Searched defs:link (Results 1 - 6 of 6) sorted by relevance
/mm/ |
H A D | interval_tree.c | 33 struct rb_node **link; local 41 link = &prev->shared.linear.rb.rb_right; 53 link = &parent->shared.linear.rb.rb_left; 57 rb_link_node(&node->shared.linear.rb, &parent->shared.linear.rb, link);
|
H A D | zswap.c | 263 struct rb_node **link = &root->rb_node, *parent = NULL; local 266 while (*link) { 267 parent = *link; 270 link = &(*link)->rb_left; 272 link = &(*link)->rb_right; 278 rb_link_node(&entry->rbnode, parent, link);
|
H A D | zsmalloc.c | 481 * We have to decide on how many pages to link together 489 * link together 3 PAGE_SIZE sized pages to form a zspage 630 struct link_free *link; local 642 link = (struct link_free *)kmap_atomic(page) + 643 off / sizeof(*link); 646 link->next = obj_location_to_handle(page, i++); 647 link += class->size / sizeof(*link); 656 link->next = obj_location_to_handle(next_page, 0); 657 kunmap_atomic(link); 1001 struct link_free *link; local 1051 struct link_free *link; local [all...] |
H A D | kmemleak.c | 521 struct rb_node **link, *rb_parent; local 568 link = &object_tree_root.rb_node; 570 while (*link) { 571 rb_parent = *link; 574 link = &parent->rb_node.rb_left; 576 link = &parent->rb_node.rb_right; 589 rb_link_node(&object->rb_node, rb_parent, link);
|
H A D | ksm.c | 97 * @link: link to the mm_slots hash list 98 * @mm_list: link into the mm_slots list, rooted in ksm_mm_head 103 struct hlist_node link; member in struct:mm_slot 113 * @rmap_list: link to the next rmap to be scanned in the rmap_list 159 * @hlist: link into hlist of rmap_items hanging off that stable_node 325 hash_for_each_possible(mm_slots_hash, slot, link, (unsigned long)mm) 336 hash_add(mm_slots_hash, &mm_slot->link, (unsigned long)mm); 800 hash_del(&mm_slot->link); 1667 hash_del(&slot->link); [all...] |
H A D | hugetlb.c | 150 struct list_head link; member in struct:file_region 162 list_for_each_entry(rg, head, link) 172 list_for_each_entry_safe(rg, trg, rg->link.prev, link) { 173 if (&rg->link == head) 184 list_del(&rg->link); 203 list_for_each_entry(rg, head, link) 210 if (&rg->link == head || t < rg->from) { 219 INIT_LIST_HEAD(&nrg->link); 223 list_add(&nrg->link, r [all...] |
Completed in 76 milliseconds