500 	struct node *nodep1, *nodep2;  in node_split()  local
510 	nodep1 = node_find(s, idx);  in node_split()
511 	if (!nodep1)  in node_split()
518 	if (nodep1->idx == idx)  in node_split()
519 		return nodep1;  in node_split()
530 	offset = idx - (nodep1->idx + MASK_BITS);  in node_split()
531 	orig_num_after = nodep1->num_after;  in node_split()
537 	nodep1->num_after = offset;  in node_split()
1103 	struct node *nodep1, *nodep2;  in sparsebit_first_clear()  local
1109 	nodep1 = node_first(s);  in sparsebit_first_clear()
1110 	if (!nodep1 || nodep1->idx > 0)  in sparsebit_first_clear()
1114 	if (nodep1->mask != ~(mask_t) 0)  in sparsebit_first_clear()
1115 		return node_first_clear(nodep1, 0);  in sparsebit_first_clear()
1122 	nodep2 = node_next(s, nodep1);  in sparsebit_first_clear()
1128 		assert(nodep1->mask == ~(mask_t) 0);  in sparsebit_first_clear()
1129 		assert(nodep1->idx + MASK_BITS + nodep1->num_after != (sparsebit_idx_t) 0);  in sparsebit_first_clear()
1130 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_first_clear()
1139 	if (nodep1->idx + MASK_BITS + nodep1->num_after != nodep2->idx)  in sparsebit_first_clear()
1140 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_first_clear()
1253 	struct node *nodep1, *nodep2;  in sparsebit_next_clear()  local
1263 	nodep1 = node_find(s, lowest_possible);  in sparsebit_next_clear()
1264 	if (!nodep1)  in sparsebit_next_clear()
1268 	for (idx = lowest_possible - nodep1->idx; idx < MASK_BITS; idx++)  in sparsebit_next_clear()
1269 		if (!(nodep1->mask & (1 << idx)))  in sparsebit_next_clear()
1270 			return nodep1->idx + idx;  in sparsebit_next_clear()
1277 	nodep2 = node_next(s, nodep1);  in sparsebit_next_clear()
1279 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_next_clear()
1287 	if (nodep1->idx + MASK_BITS + nodep1->num_after != nodep2->idx)  in sparsebit_next_clear()
1288 		return nodep1->idx + MASK_BITS + nodep1->num_after;  in sparsebit_next_clear()