609 		/* Nodes with all bits cleared may be removed. */  in node_reduce()
835 	/* Skip bits that are already cleared */  in bit_clear()
936  * of the newly allocated sparsebit array has all bits cleared.
970  * if different from src will be cleared.
996 	/* Find the next cleared bit */  in sparsebit_is_set_num()
1000 	 * If no cleared bits beyond idx, then there are at least num  in sparsebit_is_set_num()
1002 	 * there are enough set bits between idx and the next cleared bit.  in sparsebit_is_set_num()
1014 /* Returns whether num consecutive bits starting at idx are all cleared.  */
1023 	/* With num > 0, the first bit must be cleared. */  in sparsebit_is_clear_num()
1032 	 * cleared bits. idx + num doesn't wrap.  Otherwise check if  in sparsebit_is_clear_num()
1033 	 * there are enough cleared bits between idx and the next set bit.  in sparsebit_is_clear_num()
1072 /* Returns whether all the bits in the sparsebit array are cleared.  */
1097 /* Returns the index of the first cleared bit.  Abort if
1098  * no bits are cleared.
1104 	/* Validate at least 1 bit is cleared. */  in sparsebit_first_clear()
1107 	/* If no nodes or first node index > 0 then lowest cleared is 0 */  in sparsebit_first_clear()
1112 	/* Does the mask in the first node contain any cleared bits. */  in sparsebit_first_clear()
1118 	 * then the first cleared bit is the first bit after the bits  in sparsebit_first_clear()
1124 		 * No second node.  First cleared bit is first bit beyond  in sparsebit_first_clear()
1135 	 * of cleared bits between the nodes, and the first cleared bit  in sparsebit_first_clear()
1232 	 * latter that are described by candidate are cleared.  With  in sparsebit_next_set()
1244 /* Returns index of next bit cleared within s after the index given by prev.
1245  * Returns 0 if there are no bits after prev that are cleared.
1260 	 * If not, the bit at lowest_possible is cleared.  in sparsebit_next_clear()
1266 	/* Does a mask bit in node 1 describe the next cleared bit. */  in sparsebit_next_clear()
1272 	 * Next cleared bit is not described by node 1.  If there  in sparsebit_next_clear()
1273 	 * isn't a next node, then next cleared bit is described  in sparsebit_next_clear()
1283 	 * of cleared bits between the nodes, and the next cleared bit  in sparsebit_next_clear()
1335  * and returns the index of the first sequence of num consecutively cleared
1352 		 * num cleared bits?  in sparsebit_next_clear_num()
1358 		 * Sequence of cleared bits at idx isn't large enough.  in sparsebit_next_clear_num()
1359 		 * Skip this entire sequence of cleared bits.  in sparsebit_next_clear_num()