Lines Matching full:adjacent
553 /* Iteratively reduces the node pointed to by nodep and its adjacent
555 * all bits set adjacent to a previous node, will get combined into a
562 * and the adjacent nodes that are reduced are not discovered. It is the
582 * adjacent node that the bit settings could be merged into.
623 * both prev and next both check for an adjacent in node_reduce()
683 * adjacent index. in node_reduce()
696 * Is node adjacent to previous node and the node in node_reduce()
755 * Is next node index adjacent to current node in node_reduce()
1134 * If it is not adjacent to the first node, then there is a gap in sparsebit_first_clear()
1142 * Second node is adjacent to the first node. in sparsebit_first_clear()
1143 * Because it is adjacent, its mask should be non-zero. If all in sparsebit_first_clear()
1144 * its mask bits are set, then with it being adjacent, it should in sparsebit_first_clear()
1282 * If it is not adjacent to the first node, then there is a gap in sparsebit_next_clear()
1290 * Second node is adjacent to the first node. in sparsebit_next_clear()
1291 * Because it is adjacent, its mask should be non-zero. If all in sparsebit_next_clear()
1292 * its mask bits are set, then with it being adjacent, it should in sparsebit_next_clear()
1839 * be adjacent to the last bit described by the in sparsebit_validate_internal()
1845 "all bits set and is adjacent to the " in sparsebit_validate_internal()