tag | line | file | source code |
vm_avl_right | 44 | include/linux/mm.h | struct vm_area_struct * vm_avl_right; |
vm_avl_right | 276 | include/linux/mm.h | tree = tree->vm_avl_right; |
vm_avl_right | 274 | mm/mmap.c | tree = tree->vm_avl_right; |
vm_avl_right | 283 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
vm_avl_right | 287 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 289 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
vm_avl_right | 309 | mm/mmap.c | struct vm_area_struct * noderight = node->vm_avl_right; |
vm_avl_right | 319 | mm/mmap.c | struct vm_area_struct * nodeleftright = nodeleft->vm_avl_right; |
vm_avl_right | 329 | mm/mmap.c | node->vm_avl_left = nodeleftright; nodeleft->vm_avl_right = node; |
vm_avl_right | 342 | mm/mmap.c | nodeleft->vm_avl_right = nodeleftright->vm_avl_left; |
vm_avl_right | 343 | mm/mmap.c | node->vm_avl_left = nodeleftright->vm_avl_right; |
vm_avl_right | 345 | mm/mmap.c | nodeleftright->vm_avl_right = node; |
vm_avl_right | 353 | mm/mmap.c | struct vm_area_struct * noderightright = noderight->vm_avl_right; |
vm_avl_right | 357 | mm/mmap.c | node->vm_avl_right = noderightleft; noderight->vm_avl_left = node; |
vm_avl_right | 361 | mm/mmap.c | noderight->vm_avl_left = noderightleft->vm_avl_right; |
vm_avl_right | 362 | mm/mmap.c | node->vm_avl_right = noderightleft->vm_avl_left; |
vm_avl_right | 363 | mm/mmap.c | noderightleft->vm_avl_right = noderight; |
vm_avl_right | 395 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 398 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 426 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 430 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
vm_avl_right | 458 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 463 | mm/mmap.c | *nodeplace_to_delete = node_to_delete->vm_avl_right; |
vm_avl_right | 471 | mm/mmap.c | if (node->vm_avl_right == avl_empty) |
vm_avl_right | 474 | mm/mmap.c | nodeplace = &node->vm_avl_right; |
vm_avl_right | 479 | mm/mmap.c | node->vm_avl_right = node_to_delete->vm_avl_right; |
vm_avl_right | 513 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
vm_avl_right | 515 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
vm_avl_right | 531 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
vm_avl_right | 534 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
vm_avl_right | 548 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
vm_avl_right | 560 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
vm_avl_right | 572 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
vm_avl_right | 574 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |