Searched refs:link (Results 1 – 9 of 9) sorted by relevance
| /mm/ |
| D | vmalloc.c | 442 struct rb_node **link; in find_va_links() local
445 link = &root->rb_node; in find_va_links()
446 if (unlikely(!*link)) { in find_va_links()
448 return link; in find_va_links()
451 link = &from; in find_va_links()
460 tmp_va = rb_entry(*link, struct vmap_area, rb_node); in find_va_links()
469 link = &(*link)->rb_left; in find_va_links()
472 link = &(*link)->rb_right; in find_va_links()
475 } while (*link); in find_va_links()
478 return link; in find_va_links()
[all …]
|
| D | interval_tree.c | 32 struct rb_node **link; in vma_interval_tree_insert_after() local
40 link = &prev->shared.rb.rb_right; in vma_interval_tree_insert_after()
52 link = &parent->shared.rb.rb_left; in vma_interval_tree_insert_after()
56 rb_link_node(&node->shared.rb, &parent->shared.rb, link); in vma_interval_tree_insert_after()
|
| D | hugetlb.c | 243 struct list_head link; member
270 list_for_each_entry(rg, head, link) in region_add()
280 if (&rg->link == head || t < rg->from) { in region_add()
285 link); in region_add()
286 list_del(&nrg->link); in region_add()
290 list_add(&nrg->link, rg->link.prev); in region_add()
302 list_for_each_entry_safe(rg, trg, rg->link.prev, link) { in region_add()
303 if (&rg->link == head) in region_add()
319 list_del(&rg->link); in region_add()
388 list_add(&trg->link, &resv->region_cache); in region_chg()
[all …]
|
| D | zsmalloc.c | 991 struct link_free *link; in init_zspage() local
997 link = (struct link_free *)vaddr + off / sizeof(*link); in init_zspage()
1000 link->next = freeobj++ << OBJ_TAG_BITS; in init_zspage()
1001 link += class->size / sizeof(*link); in init_zspage()
1011 link->next = freeobj++ << OBJ_TAG_BITS; in init_zspage()
1017 link->next = -1UL << OBJ_TAG_BITS; in init_zspage()
1412 struct link_free *link; in obj_malloc() local
1430 link = (struct link_free *)vaddr + m_offset / sizeof(*link); in obj_malloc()
1431 set_freeobj(zspage, link->next >> OBJ_TAG_BITS); in obj_malloc()
1434 link->handle = handle; in obj_malloc()
[all …]
|
| D | zswap.c | 291 struct rb_node **link = &root->rb_node, *parent = NULL; in zswap_rb_insert() local
294 while (*link) { in zswap_rb_insert()
295 parent = *link; in zswap_rb_insert()
298 link = &(*link)->rb_left; in zswap_rb_insert()
300 link = &(*link)->rb_right; in zswap_rb_insert()
306 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
|
| D | kmemleak.c | 575 struct rb_node **link, *rb_parent; in create_object() local
625 link = &object_tree_root.rb_node; in create_object()
627 while (*link) { in create_object()
628 rb_parent = *link; in create_object()
631 link = &parent->rb_node.rb_left; in create_object()
633 link = &parent->rb_node.rb_right; in create_object()
647 rb_link_node(&object->rb_node, rb_parent, link); in create_object()
|
| D | ksm.c | 121 struct hlist_node link; member
428 hash_for_each_possible(mm_slots_hash, slot, link, (unsigned long)mm) in get_mm_slot()
439 hash_add(mm_slots_hash, &mm_slot->link, (unsigned long)mm); in insert_to_mm_slots_hash()
998 hash_del(&mm_slot->link); in unmerge_and_remove_all_rmap_items()
2346 hash_del(&slot->link); in scan_get_next_rmap_item()
2539 hash_del(&mm_slot->link); in __ksm_exit()
|
| D | swapfile.c | 2314 struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL; in add_swap_extent() local
2322 while (*link) { in add_swap_extent()
2323 parent = *link; in add_swap_extent()
2324 link = &parent->rb_right; in add_swap_extent()
2345 rb_link_node(&new_se->rb_node, parent, link); in add_swap_extent()
|
| D | shmem.c | 3816 .link = shmem_link,
|