tag | line | file | source code |
vm_avl_left | 43 | include/linux/mm.h | struct vm_area_struct * vm_avl_left; |
vm_avl_left | 274 | include/linux/mm.h | tree = tree->vm_avl_left; |
vm_avl_left | 271 | mm/mmap.c | tree = tree->vm_avl_left; |
vm_avl_left | 281 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
vm_avl_left | 283 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_left | 289 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_left | 308 | mm/mmap.c | struct vm_area_struct * nodeleft = node->vm_avl_left; |
vm_avl_left | 318 | mm/mmap.c | struct vm_area_struct * nodeleftleft = nodeleft->vm_avl_left; |
vm_avl_left | 329 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_left | 342 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_left | 343 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_left | 344 | mm/mmap.c | nodeleftright->vm_avl_left = nodeleft; |
vm_avl_left | 354 | mm/mmap.c | struct vm_area_struct * noderightleft = noderight->vm_avl_left; |
vm_avl_left | 357 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_left | 361 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_left | 362 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_left | 364 | mm/mmap.c | noderightleft->vm_avl_left = node; |
vm_avl_left | 393 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 397 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
vm_avl_left | 423 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 429 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
vm_avl_left | 456 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 462 | mm/mmap.c | if (node_to_delete->vm_avl_left == avl_empty) { |
vm_avl_left | 467 | mm/mmap.c | struct vm_area_struct ** nodeplace = &node_to_delete->vm_avl_left; |
vm_avl_left | 476 | mm/mmap.c | *nodeplace = node->vm_avl_left; |
vm_avl_left | 478 | mm/mmap.c | node->vm_avl_left = node_to_delete->vm_avl_left; |
vm_avl_left | 482 | mm/mmap.c | *stack_ptr_to_delete = &node->vm_avl_left; /* replace &node_to_delete->vm_avl_left */ |
vm_avl_left | 508 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
vm_avl_left | 509 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
vm_avl_left | 530 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
vm_avl_left | 533 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
vm_avl_left | 547 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
vm_avl_left | 559 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
vm_avl_left | 571 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
vm_avl_left | 573 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |