tag | line | file | source code |
tree | 263 | include/linux/mm.h | struct vm_area_struct * tree; |
tree | 267 | include/linux/mm.h | for (tree = task->mm->mmap_avl ; ; ) { |
tree | 268 | include/linux/mm.h | if (tree == avl_empty) |
tree | 270 | include/linux/mm.h | if (tree->vm_end > addr) { |
tree | 271 | include/linux/mm.h | if (tree->vm_start <= addr) |
tree | 272 | include/linux/mm.h | return tree; |
tree | 273 | include/linux/mm.h | result = tree; |
tree | 274 | include/linux/mm.h | tree = tree->vm_avl_left; |
tree | 276 | include/linux/mm.h | tree = tree->vm_avl_right; |
tree | 247 | mm/mmap.c | #define heightof(tree) ((tree) == avl_empty ? 0 : (tree)->vm_avl_height) |
tree | 257 | mm/mmap.c | static inline 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 | 263 | mm/mmap.c | if (tree == avl_empty) { |
tree | 267 | mm/mmap.c | if (key == tree->vm_avl_key) |
tree | 269 | mm/mmap.c | if (key < tree->vm_avl_key) { |
tree | 270 | mm/mmap.c | *to_the_right = tree; |
tree | 271 | mm/mmap.c | tree = tree->vm_avl_left; |
tree | 273 | mm/mmap.c | *to_the_left = tree; |
tree | 274 | mm/mmap.c | tree = tree->vm_avl_right; |
tree | 277 | mm/mmap.c | if (tree != node) { |
tree | 281 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
tree | 283 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
tree | 287 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
tree | 289 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
tree | 504 | mm/mmap.c | static void printk_avl (struct vm_area_struct * tree) |
tree | 506 | mm/mmap.c | if (tree != avl_empty) { |
tree | 508 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
tree | 509 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
tree | 512 | mm/mmap.c | printk("%08lX-%08lX", tree->vm_start, tree->vm_end); |
tree | 513 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
tree | 515 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
tree | 524 | mm/mmap.c | static void avl_checkheights (struct vm_area_struct * tree) |
tree | 528 | mm/mmap.c | if (tree == avl_empty) |
tree | 530 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
tree | 531 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
tree | 532 | mm/mmap.c | h = tree->vm_avl_height; |
tree | 533 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
tree | 534 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
tree | 543 | mm/mmap.c | static void avl_checkleft (struct vm_area_struct * tree, vm_avl_key_t key) |
tree | 545 | mm/mmap.c | if (tree == avl_empty) |
tree | 547 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
tree | 548 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
tree | 549 | mm/mmap.c | if (tree->vm_avl_key < key) |
tree | 551 | mm/mmap.c | printk("%s: avl_checkleft: left key %lu >= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
tree | 555 | mm/mmap.c | static void avl_checkright (struct vm_area_struct * tree, vm_avl_key_t key) |
tree | 557 | mm/mmap.c | if (tree == avl_empty) |
tree | 559 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
tree | 560 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
tree | 561 | mm/mmap.c | if (tree->vm_avl_key > key) |
tree | 563 | mm/mmap.c | printk("%s: avl_checkright: right key %lu <= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
tree | 567 | mm/mmap.c | static void avl_checkorder (struct vm_area_struct * tree) |
tree | 569 | mm/mmap.c | if (tree == avl_empty) |
tree | 571 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
tree | 572 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
tree | 573 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |
tree | 574 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |