20 	const ebitmap_node_t *n1, *n2;  in ebitmap_or()  local
25 	n1 = e1->node;  in ebitmap_or()
28 	while (n1 || n2) {  in ebitmap_or()
35 		if (n1 && n2 && n1->startbit == n2->startbit) {  in ebitmap_or()
36 			new->startbit = n1->startbit;  in ebitmap_or()
37 			new->map = n1->map | n2->map;  in ebitmap_or()
38 			n1 = n1->next;  in ebitmap_or()
40 		} else if (!n2 || (n1 && n1->startbit < n2->startbit)) {  in ebitmap_or()
41 			new->startbit = n1->startbit;  in ebitmap_or()
42 			new->map = n1->map;  in ebitmap_or()
43 			n1 = n1->next;  in ebitmap_or()
158 	const ebitmap_node_t *n1, *n2;  in ebitmap_cmp()  local
163 	n1 = e1->node;  in ebitmap_cmp()
165 	while (n1 && n2 &&  in ebitmap_cmp()
166 	       (n1->startbit == n2->startbit) && (n1->map == n2->map)) {  in ebitmap_cmp()
167 		n1 = n1->next;  in ebitmap_cmp()
171 	if (n1 || n2)  in ebitmap_cmp()
209 	const ebitmap_node_t *n1, *n2;  in ebitmap_contains()  local
214 	n1 = e1->node;  in ebitmap_contains()
216 	while (n1 && n2 && (n1->startbit <= n2->startbit)) {  in ebitmap_contains()
217 		if (n1->startbit < n2->startbit) {  in ebitmap_contains()
218 			n1 = n1->next;  in ebitmap_contains()
221 		if ((n1->map & n2->map) != n2->map)  in ebitmap_contains()
224 		n1 = n1->next;  in ebitmap_contains()
236 	const ebitmap_node_t *n1 = e1->node;  in ebitmap_match_any()  local
239 	while (n1 && n2) {  in ebitmap_match_any()
240 		if (n1->startbit < n2->startbit) {  in ebitmap_match_any()
241 			n1 = n1->next;  in ebitmap_match_any()
242 		} else if (n2->startbit < n1->startbit) {  in ebitmap_match_any()
245 			if (n1->map & n2->map) {  in ebitmap_match_any()
248 			n1 = n1->next;  in ebitmap_match_any()