Searched refs:link (Results 1 – 10 of 10) sorted by relevance
| /mm/ |
| D | vmalloc.c | 529 struct rb_node **link; in find_va_links() local
532 link = &root->rb_node; in find_va_links()
533 if (unlikely(!*link)) { in find_va_links()
535 return link; in find_va_links()
538 link = &from; in find_va_links()
547 tmp_va = rb_entry(*link, struct vmap_area, rb_node); in find_va_links()
556 link = &(*link)->rb_left; in find_va_links()
559 link = &(*link)->rb_right; in find_va_links()
566 } while (*link); in find_va_links()
569 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 | zsmalloc.c | 987 struct link_free *link; in init_zspage() local
993 link = (struct link_free *)vaddr + off / sizeof(*link); in init_zspage()
996 link->next = freeobj++ << OBJ_TAG_BITS; in init_zspage()
997 link += class->size / sizeof(*link); in init_zspage()
1007 link->next = freeobj++ << OBJ_TAG_BITS; in init_zspage()
1013 link->next = -1UL << OBJ_TAG_BITS; in init_zspage()
1366 struct link_free *link; in obj_malloc() local
1384 link = (struct link_free *)vaddr + m_offset / sizeof(*link); in obj_malloc()
1385 set_freeobj(zspage, link->next >> OBJ_TAG_BITS); in obj_malloc()
1388 link->handle = handle; in obj_malloc()
[all …]
|
| D | zswap.c | 308 struct rb_node **link = &root->rb_node, *parent = NULL; in zswap_rb_insert() local
311 while (*link) { in zswap_rb_insert()
312 parent = *link; in zswap_rb_insert()
315 link = &(*link)->rb_left; in zswap_rb_insert()
317 link = &(*link)->rb_right; in zswap_rb_insert()
323 rb_link_node(&entry->rbnode, parent, link); in zswap_rb_insert()
|
| D | hugetlb.c | 259 nrg = list_first_entry(&resv->region_cache, struct file_region, link); in get_file_region_entry_from_cache()
260 list_del(&nrg->link); in get_file_region_entry_from_cache()
339 prg = list_prev_entry(rg, link); in coalesce_file_region()
340 if (&prg->link != &resv->regions && prg->to == rg->from && in coalesce_file_region()
344 list_del(&rg->link); in coalesce_file_region()
351 nrg = list_next_entry(rg, link); in coalesce_file_region()
352 if (&nrg->link != &resv->regions && nrg->from == rg->to && in coalesce_file_region()
356 list_del(&rg->link); in coalesce_file_region()
386 list_for_each_entry_safe(rg, trg, head, link) { in add_reservation_in_range()
413 list_add(&nrg->link, rg->link.prev); in add_reservation_in_range()
[all …]
|
| D | kmemleak.c | 576 struct rb_node **link, *rb_parent; in create_object() local
626 link = &object_tree_root.rb_node; in create_object()
628 while (*link) { in create_object()
629 rb_parent = *link; in create_object()
632 link = &parent->rb_node.rb_left; in create_object()
634 link = &parent->rb_node.rb_right; in create_object()
648 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()
1000 hash_del(&mm_slot->link); in unmerge_and_remove_all_rmap_items()
2356 hash_del(&slot->link); in scan_get_next_rmap_item()
2550 hash_del(&mm_slot->link); in __ksm_exit()
|
| D | swapfile.c | 2390 struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL; in add_swap_extent() local
2398 while (*link) { in add_swap_extent()
2399 parent = *link; in add_swap_extent()
2400 link = &parent->rb_right; in add_swap_extent()
2421 rb_link_node(&new_se->rb_node, parent, link); in add_swap_extent()
|
| D | mmap.c | 632 struct vm_area_struct **pprev, struct rb_node ***link, in munmap_vma_range() argument
636 while (find_vma_links(mm, start, start + len, pprev, link, parent)) in munmap_vma_range()
|
| D | shmem.c | 3898 .link = shmem_link,
|