Lines Matching defs:prev
335 struct node *nodep, *parentp, *prev;
381 prev = node_prev(s, nodep);
382 while (prev && prev->idx + MASK_BITS + prev->num_after - 1 >= nodep->idx) {
383 unsigned int n1 = (prev->idx + MASK_BITS + prev->num_after - 1)
385 assert(prev->num_after > 0);
389 prev->num_after--;
605 struct node *prev, *next, *tmp;
620 * no other nodes between prev and next.
623 * both prev and next both check for an adjacent
628 * prev or next node. Either way, on the next pass
630 * prev or next node.
670 prev = node_prev(s, nodep);
671 if (prev) {
675 if (prev->mask == 0 && prev->num_after == 0) {
676 node_rm(s, prev);
687 prev->idx + MASK_BITS == nodep->idx) {
688 prev->num_after += MASK_BITS + nodep->num_after;
701 prev_highest_bit = prev->idx + MASK_BITS - 1 + prev->num_after;
716 prev->num_after += num_contiguous;
733 prev->num_after += nodep->num_after;
1152 /* Returns index of next bit set within s after the index given by prev.
1153 * Returns 0 if there are no bits after prev that are set.
1156 sparsebit_idx_t prev)
1158 sparsebit_idx_t lowest_possible = prev + 1;
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.
1249 sparsebit_idx_t prev)
1251 sparsebit_idx_t lowest_possible = prev + 1;
1507 * with the nodes prev or next of nodep.
1688 struct node *nodep, *prev = NULL;
1694 prev = nodep, nodep = node_next(s, nodep)) {
1803 if (prev) {
1808 if (prev->idx >= nodep->idx) {
1811 " prev: %p prev->idx: 0x%lx\n"
1813 prev, prev->idx, nodep, nodep->idx);
1822 if ((prev->idx + MASK_BITS + prev->num_after - 1)
1826 " prev: %p prev->idx: 0x%lx "
1827 "prev->num_after: 0x%lx\n"
1831 prev, prev->idx, prev->num_after,
1844 prev->idx + MASK_BITS + prev->num_after == nodep->idx) {
1848 " prev: %p prev->idx: 0x%lx "
1849 "prev->num_after: 0x%lx\n"
1853 prev, prev->idx, prev->num_after,