| tag | line | file | source code |
|---|
| tree | 217 | mm/mmap.c | #define heightof(tree) ((tree) == avl_empty ? 0 : (tree)->vm_avl_height) |
| tree | 240 | mm/mmap.c | struct vm_area_struct * tree; |
| tree | 242 | mm/mmap.c | for (tree = task->mm->mmap_avl ; ; ) { |
| tree | 243 | mm/mmap.c | if (tree == avl_empty) |
| tree | 245 | mm/mmap.c | if (tree->vm_end > addr) { |
| tree | 246 | mm/mmap.c | if (tree->vm_start <= addr) |
| tree | 247 | mm/mmap.c | return tree; |
| tree | 248 | mm/mmap.c | result = tree; |
| tree | 249 | mm/mmap.c | tree = tree->vm_avl_left; |
| tree | 251 | mm/mmap.c | tree = tree->vm_avl_right; |
| tree | 279 | 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 | 285 | mm/mmap.c | if (tree == avl_empty) { |
| tree | 289 | mm/mmap.c | if (key == tree->vm_avl_key) |
| tree | 291 | mm/mmap.c | if (key < tree->vm_avl_key) { |
| tree | 292 | mm/mmap.c | *to_the_right = tree; |
| tree | 293 | mm/mmap.c | tree = tree->vm_avl_left; |
| tree | 295 | mm/mmap.c | *to_the_left = tree; |
| tree | 296 | mm/mmap.c | tree = tree->vm_avl_right; |
| tree | 299 | mm/mmap.c | if (tree != node) { |
| tree | 303 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| tree | 305 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
| tree | 309 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
| tree | 311 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
| tree | 526 | mm/mmap.c | static void printk_avl (struct vm_area_struct * tree) |
| tree | 528 | mm/mmap.c | if (tree != avl_empty) { |
| tree | 530 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| tree | 531 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
| tree | 534 | mm/mmap.c | printk("%08lX-%08lX", tree->vm_start, tree->vm_end); |
| tree | 535 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
| tree | 537 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
| tree | 546 | mm/mmap.c | static void avl_checkheights (struct vm_area_struct * tree) |
| tree | 550 | mm/mmap.c | if (tree == avl_empty) |
| tree | 552 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
| tree | 553 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
| tree | 554 | mm/mmap.c | h = tree->vm_avl_height; |
| tree | 555 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
| tree | 556 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
| tree | 565 | mm/mmap.c | static void avl_checkleft (struct vm_area_struct * tree, vm_avl_key_t key) |
| tree | 567 | mm/mmap.c | if (tree == avl_empty) |
| tree | 569 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
| tree | 570 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
| tree | 571 | mm/mmap.c | if (tree->vm_avl_key < key) |
| tree | 573 | mm/mmap.c | printk("%s: avl_checkleft: left key %lu >= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
| tree | 577 | mm/mmap.c | static void avl_checkright (struct vm_area_struct * tree, vm_avl_key_t key) |
| tree | 579 | mm/mmap.c | if (tree == avl_empty) |
| tree | 581 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
| tree | 582 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
| tree | 583 | mm/mmap.c | if (tree->vm_avl_key > key) |
| tree | 585 | mm/mmap.c | printk("%s: avl_checkright: right key %lu <= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
| tree | 589 | mm/mmap.c | static void avl_checkorder (struct vm_area_struct * tree) |
| tree | 591 | mm/mmap.c | if (tree == avl_empty) |
| tree | 593 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
| tree | 594 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
| tree | 595 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |
| tree | 596 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |