tag | line | file | source code |
vm_avl_left | 43 | include/linux/mm.h | struct vm_area_struct * vm_avl_left; |
vm_avl_left | 264 | mm/mmap.c | tree = tree->vm_avl_left; |
vm_avl_left | 308 | mm/mmap.c | tree = tree->vm_avl_left; |
vm_avl_left | 318 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
vm_avl_left | 320 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_left | 326 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_left | 345 | mm/mmap.c | struct vm_area_struct * nodeleft = node->vm_avl_left; |
vm_avl_left | 355 | mm/mmap.c | struct vm_area_struct * nodeleftleft = nodeleft->vm_avl_left; |
vm_avl_left | 366 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_left | 379 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_left | 380 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_left | 381 | mm/mmap.c | nodeleftright->vm_avl_left = nodeleft; |
vm_avl_left | 391 | mm/mmap.c | struct vm_area_struct * noderightleft = noderight->vm_avl_left; |
vm_avl_left | 394 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_left | 398 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_left | 399 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_left | 401 | mm/mmap.c | noderightleft->vm_avl_left = node; |
vm_avl_left | 430 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 434 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
vm_avl_left | 460 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 466 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
vm_avl_left | 493 | mm/mmap.c | nodeplace = &node->vm_avl_left; |
vm_avl_left | 499 | mm/mmap.c | if (node_to_delete->vm_avl_left == avl_empty) { |
vm_avl_left | 504 | mm/mmap.c | struct vm_area_struct ** nodeplace = &node_to_delete->vm_avl_left; |
vm_avl_left | 513 | mm/mmap.c | *nodeplace = node->vm_avl_left; |
vm_avl_left | 515 | mm/mmap.c | node->vm_avl_left = node_to_delete->vm_avl_left; |
vm_avl_left | 519 | mm/mmap.c | *stack_ptr_to_delete = &node->vm_avl_left; /* replace &node_to_delete->vm_avl_left */ |
vm_avl_left | 545 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
vm_avl_left | 546 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
vm_avl_left | 567 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
vm_avl_left | 570 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
vm_avl_left | 584 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
vm_avl_left | 596 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
vm_avl_left | 608 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
vm_avl_left | 610 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |