| tag | line | file | source code |
| vm_avl_left | 43 | include/linux/mm.h | struct vm_area_struct * vm_avl_left; |
| vm_avl_left | 255 | mm/mmap.c | tree = tree->vm_avl_left; |
| vm_avl_left | 299 | mm/mmap.c | tree = tree->vm_avl_left; |
| vm_avl_left | 309 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| vm_avl_left | 311 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
| vm_avl_left | 317 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
| vm_avl_left | 336 | mm/mmap.c | struct vm_area_struct * nodeleft = node->vm_avl_left; |
| vm_avl_left | 346 | mm/mmap.c | struct vm_area_struct * nodeleftleft = nodeleft->vm_avl_left; |
| vm_avl_left | 357 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
| vm_avl_left | 370 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
| vm_avl_left | 371 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
| vm_avl_left | 372 | mm/mmap.c | nodeleftright->vm_avl_left = nodeleft; |
| vm_avl_left | 382 | mm/mmap.c | struct vm_area_struct * noderightleft = noderight->vm_avl_left; |
| vm_avl_left | 385 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
| vm_avl_left | 389 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
| vm_avl_left | 390 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
| vm_avl_left | 392 | mm/mmap.c | noderightleft->vm_avl_left = node; |
| vm_avl_left | 421 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
| vm_avl_left | 425 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
| vm_avl_left | 451 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
| vm_avl_left | 457 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
| vm_avl_left | 484 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
| vm_avl_left | 490 | mm/mmap.c | if (node_to_delete->vm_avl_left == avl_empty) { |
| vm_avl_left | 495 | mm/mmap.c | struct vm_area_struct ** nodeplace = &node_to_delete->vm_avl_left; |
| vm_avl_left | 504 | mm/mmap.c | *nodeplace = node->vm_avl_left; |
| vm_avl_left | 506 | mm/mmap.c | node->vm_avl_left = node_to_delete->vm_avl_left; |
| vm_avl_left | 510 | mm/mmap.c | *stack_ptr_to_delete = &node->vm_avl_left; /* replace &node_to_delete->vm_avl_left */ |
| vm_avl_left | 536 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| vm_avl_left | 537 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
| vm_avl_left | 558 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
| vm_avl_left | 561 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
| vm_avl_left | 575 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
| vm_avl_left | 587 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
| vm_avl_left | 599 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
| vm_avl_left | 601 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |