tag | line | file | source code |
vm_avl_right | 46 | include/linux/mm.h | struct vm_area_struct * vm_avl_right; |
vm_avl_right | 350 | include/linux/mm.h | tree = tree->vm_avl_right; |
vm_avl_right | 265 | mm/mmap.c | tree = tree->vm_avl_right; |
vm_avl_right | 274 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_right | 278 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 280 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_right | 300 | mm/mmap.c | struct vm_area_struct * noderight = node->vm_avl_right; |
vm_avl_right | 310 | mm/mmap.c | struct vm_area_struct * nodeleftright = nodeleft->vm_avl_right; |
vm_avl_right | 320 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_right | 333 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_right | 334 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_right | 336 | mm/mmap.c | nodeleftright->vm_avl_right = node; |
vm_avl_right | 344 | mm/mmap.c | struct vm_area_struct * noderightright = noderight->vm_avl_right; |
vm_avl_right | 348 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_right | 352 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_right | 353 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_right | 354 | mm/mmap.c | noderightleft->vm_avl_right = noderight; |
vm_avl_right | 386 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 389 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 417 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 421 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 449 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 454 | mm/mmap.c | *nodeplace_to_delete = node_to_delete->vm_avl_right; |
vm_avl_right | 462 | mm/mmap.c | if (node->vm_avl_right == avl_empty) |
vm_avl_right | 465 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 470 | mm/mmap.c | node->vm_avl_right = node_to_delete->vm_avl_right; |
vm_avl_right | 504 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 506 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
vm_avl_right | 522 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
vm_avl_right | 525 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
vm_avl_right | 539 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
vm_avl_right | 551 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
vm_avl_right | 563 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
vm_avl_right | 565 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |