tag | line | file | source code |
vm_avl_right | 44 | include/linux/mm.h | struct vm_area_struct * vm_avl_right; |
vm_avl_right | 267 | include/linux/mm.h | tree = tree->vm_avl_right; |
vm_avl_right | 260 | mm/mmap.c | tree = tree->vm_avl_right; |
vm_avl_right | 269 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_right | 273 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 275 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_right | 295 | mm/mmap.c | struct vm_area_struct * noderight = node->vm_avl_right; |
vm_avl_right | 305 | mm/mmap.c | struct vm_area_struct * nodeleftright = nodeleft->vm_avl_right; |
vm_avl_right | 315 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_right | 328 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_right | 329 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_right | 331 | mm/mmap.c | nodeleftright->vm_avl_right = node; |
vm_avl_right | 339 | mm/mmap.c | struct vm_area_struct * noderightright = noderight->vm_avl_right; |
vm_avl_right | 343 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_right | 347 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_right | 348 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_right | 349 | mm/mmap.c | noderightleft->vm_avl_right = noderight; |
vm_avl_right | 381 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 384 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 412 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 416 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 444 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 449 | mm/mmap.c | *nodeplace_to_delete = node_to_delete->vm_avl_right; |
vm_avl_right | 457 | mm/mmap.c | if (node->vm_avl_right == avl_empty) |
vm_avl_right | 460 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 465 | mm/mmap.c | node->vm_avl_right = node_to_delete->vm_avl_right; |
vm_avl_right | 499 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 501 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
vm_avl_right | 517 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
vm_avl_right | 520 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
vm_avl_right | 534 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
vm_avl_right | 546 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
vm_avl_right | 558 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
vm_avl_right | 560 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |