| tag | line | file | source code |
|---|
| tree | 237 | mm/mmap.c | #define heightof(tree) ((tree) == avl_empty ? 0 : (tree)->vm_avl_height) |
| tree | 260 | mm/mmap.c | struct vm_area_struct * tree; |
| tree | 262 | mm/mmap.c | for (tree = task->mm->mmap_avl ; ; ) { |
| tree | 263 | mm/mmap.c | if (tree == avl_empty) |
| tree | 265 | mm/mmap.c | if (tree->vm_end > addr) { |
| tree | 266 | mm/mmap.c | if (tree->vm_start <= addr) |
| tree | 267 | mm/mmap.c | return tree; |
| tree | 268 | mm/mmap.c | result = tree; |
| tree | 269 | mm/mmap.c | tree = tree->vm_avl_left; |
| tree | 271 | mm/mmap.c | tree = tree->vm_avl_right; |
| tree | 299 | mm/mmap.c | static void avl_neighbours (struct vm_area_struct * node, struct vm_area_struct * tree, struct vm_area_struct ** to_the_left, struct vm_area_struct ** to_the_right) |
| tree | 305 | mm/mmap.c | if (tree == avl_empty) { |
| tree | 309 | mm/mmap.c | if (key == tree->vm_avl_key) |
| tree | 311 | mm/mmap.c | if (key < tree->vm_avl_key) { |
| tree | 312 | mm/mmap.c | *to_the_right = tree; |
| tree | 313 | mm/mmap.c | tree = tree->vm_avl_left; |
| tree | 315 | mm/mmap.c | *to_the_left = tree; |
| tree | 316 | mm/mmap.c | tree = tree->vm_avl_right; |
| tree | 319 | mm/mmap.c | if (tree != node) { |
| tree | 323 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| tree | 325 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
| tree | 329 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
| tree | 331 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
| tree | 546 | mm/mmap.c | static void printk_avl (struct vm_area_struct * tree) |
| tree | 548 | mm/mmap.c | if (tree != avl_empty) { |
| tree | 550 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| tree | 551 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
| tree | 554 | mm/mmap.c | printk("%08lX-%08lX", tree->vm_start, tree->vm_end); |
| tree | 555 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
| tree | 557 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
| tree | 566 | mm/mmap.c | static void avl_checkheights (struct vm_area_struct * tree) |
| tree | 570 | mm/mmap.c | if (tree == avl_empty) |
| tree | 572 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
| tree | 573 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
| tree | 574 | mm/mmap.c | h = tree->vm_avl_height; |
| tree | 575 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
| tree | 576 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
| tree | 585 | mm/mmap.c | static void avl_checkleft (struct vm_area_struct * tree, vm_avl_key_t key) |
| tree | 587 | mm/mmap.c | if (tree == avl_empty) |
| tree | 589 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
| tree | 590 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
| tree | 591 | mm/mmap.c | if (tree->vm_avl_key < key) |
| tree | 593 | mm/mmap.c | printk("%s: avl_checkleft: left key %lu >= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
| tree | 597 | mm/mmap.c | static void avl_checkright (struct vm_area_struct * tree, vm_avl_key_t key) |
| tree | 599 | mm/mmap.c | if (tree == avl_empty) |
| tree | 601 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
| tree | 602 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
| tree | 603 | mm/mmap.c | if (tree->vm_avl_key > key) |
| tree | 605 | mm/mmap.c | printk("%s: avl_checkright: right key %lu <= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
| tree | 609 | mm/mmap.c | static void avl_checkorder (struct vm_area_struct * tree) |
| tree | 611 | mm/mmap.c | if (tree == avl_empty) |
| tree | 613 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
| tree | 614 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
| tree | 615 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |
| tree | 616 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |