Lines Matching refs:start
31 struct rb_node_key start; /* Tree sorted by start. */ member
137 rb_entry(node, struct e_node, start.node)); in wnd_close()
172 size_t e_skey = e->start.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()
211 k = rb_entry(parent, struct e_node, start.node); 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()
222 rb_link_node(&e->start.node, parent, p); in rb_insert_start()
223 rb_insert_color(&e->start.node, root); in rb_insert_start()
252 e = rb_entry(n, struct e_node, start.node); in wnd_add_free_ext()
254 if (e->start.key + e->count.key == bit) { in wnd_add_free_ext()
256 bit = e->start.key; in wnd_add_free_ext()
258 rb_erase(&e->start.node, &wnd->start_tree); in wnd_add_free_ext()
268 e = rb_entry(n, struct e_node, start.node); 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()
277 rb_erase(&e->start.node, &wnd->start_tree); in wnd_add_free_ext()
334 rb_erase(&e->start.node, &wnd->start_tree); in wnd_add_free_ext()
347 e->start.key = bit; in wnd_add_free_ext()
375 e = rb_entry(n, struct e_node, start.node); in wnd_remove_free_ext()
376 end = e->start.key + 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()
395 e3 = rb_entry(n3, struct e_node, start.node); in wnd_remove_free_ext()
396 if (e3->start.key >= end_in) 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()
412 rb_erase(&e3->start.node, &wnd->start_tree); in wnd_remove_free_ext()
443 e->start.key = new_key; in wnd_remove_free_ext()
448 rb_erase(&e->start.node, &wnd->start_tree); in wnd_remove_free_ext()
472 rb_erase(&e->start.node, &wnd->start_tree); in wnd_remove_free_ext()
482 e->start.key = new_key; in wnd_remove_free_ext()
884 e = rb_entry(n, struct e_node, start.node); in wnd_is_free()
886 end = e->start.key + e->count.key; in wnd_is_free()
922 e = rb_entry(n, struct e_node, start.node); in wnd_is_used()
923 if (e->start.key + e->count.key > bit) in wnd_is_used()
1014 e = rb_entry(cr, struct e_node, start.node); in wnd_find()
1016 if (e->start.key == hint) in wnd_find()
1019 if (e->start.key < hint) { in wnd_find()
1029 e = pr ? rb_entry(pr, struct e_node, start.node) : NULL; 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()
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()
1110 b_pos = e->start.key; in wnd_find()
1410 CLST lcn_from = bytes_to_cluster(sbi, range->start); in ntfs_trim_fs()
1421 lcn_to = bytes_to_cluster(sbi, range->start + range->len); in ntfs_trim_fs()
1491 void ntfs_bitmap_set_le(void *map, unsigned int start, int len) in ntfs_bitmap_set_le() argument
1493 bitmap_ulong *p = (bitmap_ulong *)map + BIT_WORD(start); in ntfs_bitmap_set_le()
1494 const unsigned int size = start + len; in ntfs_bitmap_set_le()
1495 int bits_to_set = BITS_PER_LONG - (start % BITS_PER_LONG); in ntfs_bitmap_set_le()
1496 bitmap_ulong mask_to_set = cpu_to_ul(BITMAP_FIRST_WORD_MASK(start)); in ntfs_bitmap_set_le()
1511 void ntfs_bitmap_clear_le(void *map, unsigned int start, int len) in ntfs_bitmap_clear_le() argument
1513 bitmap_ulong *p = (bitmap_ulong *)map + BIT_WORD(start); in ntfs_bitmap_clear_le()
1514 const unsigned int size = start + len; in ntfs_bitmap_clear_le()
1515 int bits_to_clear = BITS_PER_LONG - (start % BITS_PER_LONG); in ntfs_bitmap_clear_le()
1516 bitmap_ulong mask_to_clear = cpu_to_ul(BITMAP_FIRST_WORD_MASK(start)); in ntfs_bitmap_clear_le()