Lines Matching refs:prev
335 struct node *nodep, *parentp, *prev; in node_add() local
381 prev = node_prev(s, nodep); in node_add()
382 while (prev && prev->idx + MASK_BITS + prev->num_after - 1 >= nodep->idx) { in node_add()
383 unsigned int n1 = (prev->idx + MASK_BITS + prev->num_after - 1) in node_add()
385 assert(prev->num_after > 0); in node_add()
389 prev->num_after--; in node_add()
605 struct node *prev, *next, *tmp; in node_reduce() local
669 prev = node_prev(s, nodep); in node_reduce()
670 if (prev) { in node_reduce()
674 if (prev->mask == 0 && prev->num_after == 0) { in node_reduce()
675 node_rm(s, prev); in node_reduce()
686 prev->idx + MASK_BITS == nodep->idx) { in node_reduce()
687 prev->num_after += MASK_BITS + nodep->num_after; in node_reduce()
700 prev_highest_bit = prev->idx + MASK_BITS - 1 + prev->num_after; in node_reduce()
715 prev->num_after += num_contiguous; in node_reduce()
732 prev->num_after += nodep->num_after; in node_reduce()
1155 sparsebit_idx_t prev) in sparsebit_next_set() argument
1157 sparsebit_idx_t lowest_possible = prev + 1; in sparsebit_next_set()
1248 sparsebit_idx_t prev) in sparsebit_next_clear() argument
1250 sparsebit_idx_t lowest_possible = prev + 1; in sparsebit_next_clear()
1687 struct node *nodep, *prev = NULL; in sparsebit_validate_internal() local
1693 prev = nodep, nodep = node_next(s, nodep)) { in sparsebit_validate_internal()
1802 if (prev) { in sparsebit_validate_internal()
1807 if (prev->idx >= nodep->idx) { in sparsebit_validate_internal()
1812 prev, prev->idx, nodep, nodep->idx); in sparsebit_validate_internal()
1821 if ((prev->idx + MASK_BITS + prev->num_after - 1) in sparsebit_validate_internal()
1830 prev, prev->idx, prev->num_after, in sparsebit_validate_internal()
1843 prev->idx + MASK_BITS + prev->num_after == nodep->idx) { in sparsebit_validate_internal()
1852 prev, prev->idx, prev->num_after, in sparsebit_validate_internal()