Lines Matching defs:node
37 * heap_index] value, we have a corresponding priority search tree node. If
39 * them is used as a tree node and others are stored in a vm_set list. The tree
40 * node points to the first vma (head) of the list using vm_set.head.
50 * We need some way to identify whether a vma is a tree node, head of a vm_set
54 * removed under R->mmap_sem, H replaces R as a tree node. Since we do not hold
55 * H->mmap_sem, we cannot use H->vm_flags for marking that H is a tree node now.
59 * vma radix priority search tree node rules:
61 * vma->shared.vm_set.parent != NULL ==> a tree node
67 * vma->shared.vm_set.head == NULL ==> a list node
116 struct vm_area_struct *node, *head, *new_head;
144 node = vma->shared.vm_set.head;
151 node->shared.vm_set.head = new_head;
152 new_head->shared.vm_set.head = node;
154 node->shared.vm_set.head = NULL;