47 						  struct ebitmap_node **n)  in ebitmap_start_positive()  argument
51 	for (*n = e->node; *n; *n = (*n)->next) {  in ebitmap_start_positive()
52 		ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);  in ebitmap_start_positive()
54 			return (*n)->startbit + ofs;  in ebitmap_start_positive()
65 						 struct ebitmap_node **n,  in ebitmap_next_positive()  argument
70 	ofs = find_next_bit((*n)->maps, EBITMAP_SIZE, bit - (*n)->startbit + 1);  in ebitmap_next_positive()
72 		return ofs + (*n)->startbit;  in ebitmap_next_positive()
74 	for (*n = (*n)->next; *n; *n = (*n)->next) {  in ebitmap_next_positive()
75 		ofs = find_first_bit((*n)->maps, EBITMAP_SIZE);  in ebitmap_next_positive()
77 			return ofs + (*n)->startbit;  in ebitmap_next_positive()
87 static inline int ebitmap_node_get_bit(struct ebitmap_node *n,  in ebitmap_node_get_bit()  argument
90 	unsigned int index = EBITMAP_NODE_INDEX(n, bit);  in ebitmap_node_get_bit()
91 	unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);  in ebitmap_node_get_bit()
94 	if ((n->maps[index] & (EBITMAP_BIT << ofs)))  in ebitmap_node_get_bit()
99 static inline void ebitmap_node_set_bit(struct ebitmap_node *n,  in ebitmap_node_set_bit()  argument
102 	unsigned int index = EBITMAP_NODE_INDEX(n, bit);  in ebitmap_node_set_bit()
103 	unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);  in ebitmap_node_set_bit()
106 	n->maps[index] |= (EBITMAP_BIT << ofs);  in ebitmap_node_set_bit()
109 static inline void ebitmap_node_clr_bit(struct ebitmap_node *n,  in ebitmap_node_clr_bit()  argument
112 	unsigned int index = EBITMAP_NODE_INDEX(n, bit);  in ebitmap_node_clr_bit()
113 	unsigned int ofs = EBITMAP_NODE_OFFSET(n, bit);  in ebitmap_node_clr_bit()
116 	n->maps[index] &= ~(EBITMAP_BIT << ofs);  in ebitmap_node_clr_bit()
119 #define ebitmap_for_each_positive_bit(e, n, bit)	\  argument
120 	for (bit = ebitmap_start_positive(e, &n);	\
122 	     bit = ebitmap_next_positive(e, &n, bit))	\