27 	size_t key;  member
155 		if (v < k->key) {  in rb_lookup()
157 		} else if (v > k->key) {  in rb_lookup()
175 	size_t e_ckey = e->count.key;  in rb_insert_count()
176 	size_t e_skey = e->start.key;  in rb_insert_count()
182 		if (e_ckey > k->count.key) {  in rb_insert_count()
184 		} else if (e_ckey < k->count.key) {  in rb_insert_count()
186 		} else if (e_skey < k->start.key) {  in rb_insert_count()
188 		} else if (e_skey > k->start.key) {  in rb_insert_count()
208 	size_t e_skey = e->start.key;  in rb_insert_start()
216 		if (e_skey < k->start.key) {  in rb_insert_start()
218 		} else if (e_skey > k->start.key) {  in rb_insert_start()
258 			if (e->start.key + e->count.key == bit) {  in wnd_add_free_ext()
260 				bit = e->start.key;  in wnd_add_free_ext()
261 				len += e->count.key;  in wnd_add_free_ext()
273 			next_end = e->start.key + e->count.key;  in wnd_add_free_ext()
274 			if (e->start.key > end_in)  in wnd_add_free_ext()
325 		if (len <= e->count.key)  in wnd_add_free_ext()
334 			wnd->extent_min = e2->count.key;  in wnd_add_free_ext()
351 	e->start.key = bit;  in wnd_add_free_ext()
352 	e->count.key = len;  in wnd_add_free_ext()
380 	end = e->start.key + e->count.key;  in wnd_remove_free_ext()
383 	len = e->count.key;  in wnd_remove_free_ext()
386 	if (e->start.key > bit)  in wnd_remove_free_ext()
392 		len = bit - e->start.key;  in wnd_remove_free_ext()
400 			if (e3->start.key >= end_in)  in wnd_remove_free_ext()
403 			if (e3->count.key == wnd->extent_max)  in wnd_remove_free_ext()
406 			end3 = e3->start.key + e3->count.key;  in wnd_remove_free_ext()
408 				e3->start.key = end_in;  in wnd_remove_free_ext()
410 				e3->count.key = end3 - end_in;  in wnd_remove_free_ext()
425 			n3 ? rb_entry(n3, struct e_node, count.node)->count.key  in wnd_remove_free_ext()
430 	if (e->count.key != wnd->extent_max) {  in wnd_remove_free_ext()
441 			wnd->extent_max = max(e3->count.key, max_new_len);  in wnd_remove_free_ext()
447 			e->start.key = new_key;  in wnd_remove_free_ext()
449 			e->count.key = new_len;  in wnd_remove_free_ext()
460 	e->count.key = len;  in wnd_remove_free_ext()
472 		if (e->count.key > new_len)  in wnd_remove_free_ext()
486 		e->start.key = new_key;  in wnd_remove_free_ext()
487 		e->count.key = new_len;  in wnd_remove_free_ext()
882 	end = e->start.key + e->count.key;  in wnd_is_free()
918 	if (e->start.key + e->count.key > bit)  in wnd_is_used()
1019 		if (e->start.key == hint)  in wnd_find()
1022 		if (e->start.key < hint) {  in wnd_find()
1040 	if (e->start.key + e->count.key > hint) {  in wnd_find()
1042 		size_t len = e->start.key + e->count.key - hint;  in wnd_find()
1064 	if (e->count.key != wnd->extent_max)  in wnd_find()
1065 		wnd->extent_max = e->count.key;  in wnd_find()
1067 	if (e->count.key < max_alloc) {  in wnd_find()
1068 		if (e->count.key >= to_alloc) {  in wnd_find()
1071 			if (e->count.key < to_alloc0) {  in wnd_find()
1075 			to_alloc = e->count.key;  in wnd_find()
1077 			to_alloc = e->count.key;  in wnd_find()
1087 			max_check = e->start.key + to_alloc;  in wnd_find()
1090 			for (op = e->start.key + e->count.key; op < max_check;  in wnd_find()
1097 			to_alloc = op - e->start.key;  in wnd_find()
1101 		fnd = e->start.key;  in wnd_find()
1102 		if (e->start.key + to_alloc > max_alloc)  in wnd_find()
1103 			to_alloc = max_alloc - e->start.key;  in wnd_find()
1112 	b_len = e->count.key;  in wnd_find()
1113 	b_pos = e->start.key;  in wnd_find()