609 		/* Nodes with all bits cleared may be removed. */  in node_reduce()
836 	/* Skip bits that are already cleared */  in bit_clear()
937  * of the newly allocated sparsebit array has all bits cleared.
971  * if different from src will be cleared.
997 	/* Find the next cleared bit */  in sparsebit_is_set_num()
1001 	 * If no cleared bits beyond idx, then there are at least num  in sparsebit_is_set_num()
1003 	 * there are enough set bits between idx and the next cleared bit.  in sparsebit_is_set_num()
1015 /* Returns whether num consecutive bits starting at idx are all cleared.  */
1024 	/* With num > 0, the first bit must be cleared. */  in sparsebit_is_clear_num()
1033 	 * cleared bits. idx + num doesn't wrap.  Otherwise check if  in sparsebit_is_clear_num()
1034 	 * there are enough cleared bits between idx and the next set bit.  in sparsebit_is_clear_num()
1073 /* Returns whether all the bits in the sparsebit array are cleared.  */
1098 /* Returns the index of the first cleared bit.  Abort if
1099  * no bits are cleared.
1105 	/* Validate at least 1 bit is cleared. */  in sparsebit_first_clear()
1108 	/* If no nodes or first node index > 0 then lowest cleared is 0 */  in sparsebit_first_clear()
1113 	/* Does the mask in the first node contain any cleared bits. */  in sparsebit_first_clear()
1119 	 * then the first cleared bit is the first bit after the bits  in sparsebit_first_clear()
1125 		 * No second node.  First cleared bit is first bit beyond  in sparsebit_first_clear()
1136 	 * of cleared bits between the nodes, and the first cleared bit  in sparsebit_first_clear()
1233 	 * latter that are described by candidate are cleared.  With  in sparsebit_next_set()
1245 /* Returns index of next bit cleared within s after the index given by prev.
1246  * Returns 0 if there are no bits after prev that are cleared.
1261 	 * If not, the bit at lowest_possible is cleared.  in sparsebit_next_clear()
1267 	/* Does a mask bit in node 1 describe the next cleared bit. */  in sparsebit_next_clear()
1273 	 * Next cleared bit is not described by node 1.  If there  in sparsebit_next_clear()
1274 	 * isn't a next node, then next cleared bit is described  in sparsebit_next_clear()
1284 	 * of cleared bits between the nodes, and the next cleared bit  in sparsebit_next_clear()
1336  * and returns the index of the first sequence of num consecutively cleared
1353 		 * num cleared bits?  in sparsebit_next_clear_num()
1359 		 * Sequence of cleared bits at idx isn't large enough.  in sparsebit_next_clear_num()
1360 		 * Skip this entire sequence of cleared bits.  in sparsebit_next_clear_num()