kvm/lib/sparsebit.c

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.
669 		prev = node_prev(s, nodep);
670 		if (prev) {
674 			if (prev->mask == 0 && prev->num_after == 0) {
675 				node_rm(s, prev);
686 			    prev->idx + MASK_BITS == nodep->idx) {
687 				prev->num_after += MASK_BITS + nodep->num_after;
700 			prev_highest_bit = prev->idx + MASK_BITS - 1 + prev->num_after;
715 				prev->num_after += num_contiguous;
732 					prev->num_after += nodep->num_after;
1151 /* Returns index of next bit set within s after the index given by prev.
1152  * Returns 0 if there are no bits after prev that are set.
1155 	sparsebit_idx_t prev)
1157 	sparsebit_idx_t lowest_possible = prev + 1;
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.
1248 	sparsebit_idx_t prev)
1250 	sparsebit_idx_t lowest_possible = prev + 1;
1506 		 * with the nodes prev or next of nodep.
1687 	struct node *nodep, *prev = NULL;
1693 		prev = nodep, nodep = node_next(s, nodep)) {
1802 		if (prev) {
1807 			if (prev->idx >= nodep->idx) {
1810 					"  prev: %p prev->idx: 0x%lx\n"
1812 					prev, prev->idx, nodep, nodep->idx);
1821 			if ((prev->idx + MASK_BITS + prev->num_after - 1)
1825 					"  prev: %p prev->idx: 0x%lx "
1826 					"prev->num_after: 0x%lx\n"
1830 					prev, prev->idx, prev->num_after,
1843 			    prev->idx + MASK_BITS + prev->num_after == nodep->idx) {
1847 					"  prev: %p prev->idx: 0x%lx "
1848 					"prev->num_after: 0x%lx\n"
1852 					prev, prev->idx, prev->num_after,