tag | line | file | source code |
vm_avl_right | 44 | include/linux/mm.h | struct vm_area_struct * vm_avl_right; |
vm_avl_right | 251 | mm/mmap.c | tree = tree->vm_avl_right; |
vm_avl_right | 296 | mm/mmap.c | tree = tree->vm_avl_right; |
vm_avl_right | 305 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_right | 309 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 311 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_right | 331 | mm/mmap.c | struct vm_area_struct * noderight = node->vm_avl_right; |
vm_avl_right | 341 | mm/mmap.c | struct vm_area_struct * nodeleftright = nodeleft->vm_avl_right; |
vm_avl_right | 351 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_right | 364 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_right | 365 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_right | 367 | mm/mmap.c | nodeleftright->vm_avl_right = node; |
vm_avl_right | 375 | mm/mmap.c | struct vm_area_struct * noderightright = noderight->vm_avl_right; |
vm_avl_right | 379 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_right | 383 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_right | 384 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_right | 385 | mm/mmap.c | noderightleft->vm_avl_right = noderight; |
vm_avl_right | 417 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 420 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 448 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 452 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 480 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 485 | mm/mmap.c | *nodeplace_to_delete = node_to_delete->vm_avl_right; |
vm_avl_right | 493 | mm/mmap.c | if (node->vm_avl_right == avl_empty) |
vm_avl_right | 496 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 501 | mm/mmap.c | node->vm_avl_right = node_to_delete->vm_avl_right; |
vm_avl_right | 535 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 537 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
vm_avl_right | 553 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
vm_avl_right | 556 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
vm_avl_right | 570 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
vm_avl_right | 582 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
vm_avl_right | 594 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
vm_avl_right | 596 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |