tag | line | file | source code |
vm_avl_left | 43 | include/linux/mm.h | struct vm_area_struct * vm_avl_left; |
vm_avl_left | 265 | include/linux/mm.h | tree = tree->vm_avl_left; |
vm_avl_left | 257 | mm/mmap.c | tree = tree->vm_avl_left; |
vm_avl_left | 267 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
vm_avl_left | 269 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_left | 275 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_left | 294 | mm/mmap.c | struct vm_area_struct * nodeleft = node->vm_avl_left; |
vm_avl_left | 304 | mm/mmap.c | struct vm_area_struct * nodeleftleft = nodeleft->vm_avl_left; |
vm_avl_left | 315 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_left | 328 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_left | 329 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_left | 330 | mm/mmap.c | nodeleftright->vm_avl_left = nodeleft; |
vm_avl_left | 340 | mm/mmap.c | struct vm_area_struct * noderightleft = noderight->vm_avl_left; |
vm_avl_left | 343 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_left | 347 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_left | 348 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_left | 350 | mm/mmap.c | noderightleft->vm_avl_left = node; |
vm_avl_left | 379 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 383 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
vm_avl_left | 409 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 415 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
vm_avl_left | 442 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 448 | mm/mmap.c | if (node_to_delete->vm_avl_left == avl_empty) { |
vm_avl_left | 453 | mm/mmap.c | struct vm_area_struct ** nodeplace = &node_to_delete->vm_avl_left; |
vm_avl_left | 462 | mm/mmap.c | *nodeplace = node->vm_avl_left; |
vm_avl_left | 464 | mm/mmap.c | node->vm_avl_left = node_to_delete->vm_avl_left; |
vm_avl_left | 468 | mm/mmap.c | *stack_ptr_to_delete = &node->vm_avl_left; /* replace &node_to_delete->vm_avl_left */ |
vm_avl_left | 494 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
vm_avl_left | 495 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
vm_avl_left | 516 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
vm_avl_left | 519 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
vm_avl_left | 533 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
vm_avl_left | 545 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
vm_avl_left | 557 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
vm_avl_left | 559 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |