501 	struct node *nodep1, *nodep2;  in node_split()  local
511 	nodep1 = node_find(s, idx);  in node_split()
512 	if (!nodep1)  in node_split()
519 	if (nodep1->idx == idx)  in node_split()
520 		return nodep1;  in node_split()
531 	offset = idx - (nodep1->idx + MASK_BITS);  in node_split()
532 	orig_num_after = nodep1->num_after;  in node_split()
538 	nodep1->num_after = offset;  in node_split()
1104 	struct node *nodep1, *nodep2;  in sparsebit_first_clear()  local
1110 	nodep1 = node_first(s);  in sparsebit_first_clear()
1111 	if (!nodep1 || nodep1->idx > 0)  in sparsebit_first_clear()
1115 	if (nodep1->mask != ~(mask_t) 0)  in sparsebit_first_clear()
1116 		return node_first_clear(nodep1, 0);  in sparsebit_first_clear()
1123 	nodep2 = node_next(s, nodep1);  in sparsebit_first_clear()
1129 		assert(nodep1->mask == ~(mask_t) 0);  in sparsebit_first_clear()
1130 		assert(nodep1->idx + MASK_BITS + nodep1->num_after != (sparsebit_idx_t) 0);  in sparsebit_first_clear()
1131 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_first_clear()
1140 	if (nodep1->idx + MASK_BITS + nodep1->num_after != nodep2->idx)  in sparsebit_first_clear()
1141 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_first_clear()
1254 	struct node *nodep1, *nodep2;  in sparsebit_next_clear()  local
1264 	nodep1 = node_find(s, lowest_possible);  in sparsebit_next_clear()
1265 	if (!nodep1)  in sparsebit_next_clear()
1269 	for (idx = lowest_possible - nodep1->idx; idx < MASK_BITS; idx++)  in sparsebit_next_clear()
1270 		if (!(nodep1->mask & (1 << idx)))  in sparsebit_next_clear()
1271 			return nodep1->idx + idx;  in sparsebit_next_clear()
1278 	nodep2 = node_next(s, nodep1);  in sparsebit_next_clear()
1280 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_next_clear()
1288 	if (nodep1->idx + MASK_BITS + nodep1->num_after != nodep2->idx)  in sparsebit_next_clear()
1289 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_next_clear()