33 	const struct ebitmap_node *n1, *n2;  in ebitmap_cmp()  local
39 	n2 = e2->node;  in ebitmap_cmp()
40 	while (n1 && n2 &&  in ebitmap_cmp()
41 	       (n1->startbit == n2->startbit) &&  in ebitmap_cmp()
42 	       !memcmp(n1->maps, n2->maps, EBITMAP_SIZE / 8)) {  in ebitmap_cmp()
44 		n2 = n2->next;  in ebitmap_cmp()
47 	if (n1 || n2)  in ebitmap_cmp()
223 	const struct ebitmap_node *n1, *n2;  in ebitmap_contains()  local
230 	n2 = e2->node;  in ebitmap_contains()
232 	while (n1 && n2 && (n1->startbit <= n2->startbit)) {  in ebitmap_contains()
233 		if (n1->startbit < n2->startbit) {  in ebitmap_contains()
237 		for (i = EBITMAP_UNIT_NUMS - 1; (i >= 0) && !n2->maps[i]; )  in ebitmap_contains()
240 			u32 lastsetbit = n2->startbit + i * EBITMAP_UNIT_SIZE +  in ebitmap_contains()
241 					 __fls(n2->maps[i]);  in ebitmap_contains()
247 			if ((n1->maps[i] & n2->maps[i]) != n2->maps[i])  in ebitmap_contains()
253 		n2 = n2->next;  in ebitmap_contains()
256 	if (n2)  in ebitmap_contains()