Lines Matching refs:key
27 size_t key; member
151 if (v < k->key) { in rb_lookup()
153 } else if (v > k->key) { in rb_lookup()
171 size_t e_ckey = e->count.key; in rb_insert_count()
172 size_t e_skey = e->start.key; in rb_insert_count()
178 if (e_ckey > k->count.key) { in rb_insert_count()
180 } else if (e_ckey < k->count.key) { in rb_insert_count()
182 } else if (e_skey < k->start.key) { in rb_insert_count()
184 } else if (e_skey > k->start.key) { in rb_insert_count()
204 size_t e_skey = e->start.key; in rb_insert_start()
212 if (e_skey < k->start.key) { in rb_insert_start()
214 } else if (e_skey > k->start.key) { in rb_insert_start()
254 if (e->start.key + e->count.key == bit) { in wnd_add_free_ext()
256 bit = e->start.key; in wnd_add_free_ext()
257 len += e->count.key; in wnd_add_free_ext()
269 next_end = e->start.key + e->count.key; in wnd_add_free_ext()
270 if (e->start.key > end_in) in wnd_add_free_ext()
321 if (len <= e->count.key) in wnd_add_free_ext()
330 wnd->extent_min = e2->count.key; in wnd_add_free_ext()
347 e->start.key = bit; in wnd_add_free_ext()
348 e->count.key = len; in wnd_add_free_ext()
376 end = e->start.key + e->count.key; in wnd_remove_free_ext()
379 len = e->count.key; in wnd_remove_free_ext()
382 if (e->start.key > bit) in wnd_remove_free_ext()
388 len = bit - e->start.key; in wnd_remove_free_ext()
396 if (e3->start.key >= end_in) in wnd_remove_free_ext()
399 if (e3->count.key == wnd->extent_max) in wnd_remove_free_ext()
402 end3 = e3->start.key + e3->count.key; in wnd_remove_free_ext()
404 e3->start.key = end_in; in wnd_remove_free_ext()
406 e3->count.key = end3 - end_in; in wnd_remove_free_ext()
421 n3 ? rb_entry(n3, struct e_node, count.node)->count.key : in wnd_remove_free_ext()
426 if (e->count.key != wnd->extent_max) { in wnd_remove_free_ext()
437 wnd->extent_max = max(e3->count.key, max_new_len); in wnd_remove_free_ext()
443 e->start.key = new_key; in wnd_remove_free_ext()
445 e->count.key = new_len; in wnd_remove_free_ext()
456 e->count.key = len; in wnd_remove_free_ext()
468 if (e->count.key > new_len) in wnd_remove_free_ext()
482 e->start.key = new_key; in wnd_remove_free_ext()
483 e->count.key = new_len; in wnd_remove_free_ext()
886 end = e->start.key + e->count.key; in wnd_is_free()
923 if (e->start.key + e->count.key > bit) in wnd_is_used()
1016 if (e->start.key == hint) in wnd_find()
1019 if (e->start.key < hint) { in wnd_find()
1037 if (e->start.key + e->count.key > hint) { in wnd_find()
1039 size_t len = e->start.key + e->count.key - hint; in wnd_find()
1061 if (e->count.key != wnd->extent_max) in wnd_find()
1062 wnd->extent_max = e->count.key; in wnd_find()
1064 if (e->count.key < max_alloc) { in wnd_find()
1065 if (e->count.key >= to_alloc) { in wnd_find()
1068 if (e->count.key < to_alloc0) { in wnd_find()
1072 to_alloc = e->count.key; in wnd_find()
1074 to_alloc = e->count.key; in wnd_find()
1084 max_check = e->start.key + to_alloc; in wnd_find()
1087 for (op = e->start.key + e->count.key; op < max_check; in wnd_find()
1094 to_alloc = op - e->start.key; in wnd_find()
1098 fnd = e->start.key; in wnd_find()
1099 if (e->start.key + to_alloc > max_alloc) in wnd_find()
1100 to_alloc = max_alloc - e->start.key; in wnd_find()
1109 b_len = e->count.key; in wnd_find()
1110 b_pos = e->start.key; in wnd_find()