| tag | line | file | source code |
|---|
| tree | 340 | include/linux/mm.h | struct vm_area_struct * tree = task->mm->mmap_avl; |
| tree | 342 | include/linux/mm.h | if (tree == avl_empty) |
| tree | 344 | include/linux/mm.h | if (tree->vm_end > addr) { |
| tree | 345 | include/linux/mm.h | result = tree; |
| tree | 346 | include/linux/mm.h | if (tree->vm_start <= addr) |
| tree | 348 | include/linux/mm.h | tree = tree->vm_avl_left; |
| tree | 350 | include/linux/mm.h | tree = tree->vm_avl_right; |
| tree | 238 | mm/mmap.c | #define heightof(tree) ((tree) == avl_empty ? 0 : (tree)->vm_avl_height) |
| tree | 248 | 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 | 254 | mm/mmap.c | if (tree == avl_empty) { |
| tree | 258 | mm/mmap.c | if (key == tree->vm_avl_key) |
| tree | 260 | mm/mmap.c | if (key < tree->vm_avl_key) { |
| tree | 261 | mm/mmap.c | *to_the_right = tree; |
| tree | 262 | mm/mmap.c | tree = tree->vm_avl_left; |
| tree | 264 | mm/mmap.c | *to_the_left = tree; |
| tree | 265 | mm/mmap.c | tree = tree->vm_avl_right; |
| tree | 268 | mm/mmap.c | if (tree != node) { |
| tree | 272 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| tree | 274 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
| tree | 278 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
| tree | 280 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
| tree | 495 | mm/mmap.c | static void printk_avl (struct vm_area_struct * tree) |
| tree | 497 | mm/mmap.c | if (tree != avl_empty) { |
| tree | 499 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
| tree | 500 | mm/mmap.c | printk_avl(tree->vm_avl_left); |
| tree | 503 | mm/mmap.c | printk("%08lX-%08lX", tree->vm_start, tree->vm_end); |
| tree | 504 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
| tree | 506 | mm/mmap.c | printk_avl(tree->vm_avl_right); |
| tree | 515 | mm/mmap.c | static void avl_checkheights (struct vm_area_struct * tree) |
| tree | 519 | mm/mmap.c | if (tree == avl_empty) |
| tree | 521 | mm/mmap.c | avl_checkheights(tree->vm_avl_left); |
| tree | 522 | mm/mmap.c | avl_checkheights(tree->vm_avl_right); |
| tree | 523 | mm/mmap.c | h = tree->vm_avl_height; |
| tree | 524 | mm/mmap.c | hl = heightof(tree->vm_avl_left); |
| tree | 525 | mm/mmap.c | hr = heightof(tree->vm_avl_right); |
| tree | 534 | mm/mmap.c | static void avl_checkleft (struct vm_area_struct * tree, vm_avl_key_t key) |
| tree | 536 | mm/mmap.c | if (tree == avl_empty) |
| tree | 538 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,key); |
| tree | 539 | mm/mmap.c | avl_checkleft(tree->vm_avl_right,key); |
| tree | 540 | mm/mmap.c | if (tree->vm_avl_key < key) |
| tree | 542 | mm/mmap.c | printk("%s: avl_checkleft: left key %lu >= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
| tree | 546 | mm/mmap.c | static void avl_checkright (struct vm_area_struct * tree, vm_avl_key_t key) |
| tree | 548 | mm/mmap.c | if (tree == avl_empty) |
| tree | 550 | mm/mmap.c | avl_checkright(tree->vm_avl_left,key); |
| tree | 551 | mm/mmap.c | avl_checkright(tree->vm_avl_right,key); |
| tree | 552 | mm/mmap.c | if (tree->vm_avl_key > key) |
| tree | 554 | mm/mmap.c | printk("%s: avl_checkright: right key %lu <= top key %lu\n",avl_check_point,tree->vm_avl_key,key); |
| tree | 558 | mm/mmap.c | static void avl_checkorder (struct vm_area_struct * tree) |
| tree | 560 | mm/mmap.c | if (tree == avl_empty) |
| tree | 562 | mm/mmap.c | avl_checkorder(tree->vm_avl_left); |
| tree | 563 | mm/mmap.c | avl_checkorder(tree->vm_avl_right); |
| tree | 564 | mm/mmap.c | avl_checkleft(tree->vm_avl_left,tree->vm_avl_key); |
| tree | 565 | mm/mmap.c | avl_checkright(tree->vm_avl_right,tree->vm_avl_key); |
| tree | 27 | net/bridge/br_tree.c | static void printk_avl (struct fdb * tree); |
| tree | 45 | net/bridge/br_tree.c | #define heightof(tree) ((tree) == avl_br_empty ? 0 : (tree)->fdb_avl_height) |
| tree | 68 | net/bridge/br_tree.c | struct fdb * tree; |
| tree | 81 | net/bridge/br_tree.c | for (tree = &fdb_head ; ; ) { |
| tree | 82 | net/bridge/br_tree.c | if (tree == avl_br_empty) { |
| tree | 91 | net/bridge/br_tree.c | (unsigned int)tree, |
| tree | 92 | net/bridge/br_tree.c | tree->ula[0], |
| tree | 93 | net/bridge/br_tree.c | tree->ula[1], |
| tree | 94 | net/bridge/br_tree.c | tree->ula[2], |
| tree | 95 | net/bridge/br_tree.c | tree->ula[3], |
| tree | 96 | net/bridge/br_tree.c | tree->ula[4], |
| tree | 97 | net/bridge/br_tree.c | tree->ula[5]); |
| tree | 99 | net/bridge/br_tree.c | if (addr_cmp(addr, tree->ula) == 0) { |
| tree | 101 | net/bridge/br_tree.c | printk("found node 0x%x\n", (unsigned int)tree); |
| tree | 103 | net/bridge/br_tree.c | return tree; |
| tree | 105 | net/bridge/br_tree.c | if (addr_cmp(addr, tree->ula) < 0) { |
| tree | 106 | net/bridge/br_tree.c | tree = tree->fdb_avl_left; |
| tree | 108 | net/bridge/br_tree.c | tree = tree->fdb_avl_right; |
| tree | 309 | net/bridge/br_tree.c | static void printk_avl (struct fdb * tree) |
| tree | 311 | net/bridge/br_tree.c | if (tree != avl_br_empty) { |
| tree | 314 | net/bridge/br_tree.c | tree->ula[0], |
| tree | 315 | net/bridge/br_tree.c | tree->ula[1], |
| tree | 316 | net/bridge/br_tree.c | tree->ula[2], |
| tree | 317 | net/bridge/br_tree.c | tree->ula[3], |
| tree | 318 | net/bridge/br_tree.c | tree->ula[4], |
| tree | 319 | net/bridge/br_tree.c | tree->ula[5]); |
| tree | 320 | net/bridge/br_tree.c | if (tree->fdb_avl_left != avl_br_empty) { |
| tree | 321 | net/bridge/br_tree.c | printk_avl(tree->fdb_avl_left); |
| tree | 324 | net/bridge/br_tree.c | if (tree->fdb_avl_right != avl_br_empty) { |
| tree | 326 | net/bridge/br_tree.c | printk_avl(tree->fdb_avl_right); |
| tree | 336 | net/bridge/br_tree.c | static void avl_checkheights (struct fdb * tree) |
| tree | 340 | net/bridge/br_tree.c | if (tree == avl_br_empty) |
| tree | 342 | net/bridge/br_tree.c | avl_checkheights(tree->fdb_avl_left); |
| tree | 343 | net/bridge/br_tree.c | avl_checkheights(tree->fdb_avl_right); |
| tree | 344 | net/bridge/br_tree.c | h = tree->fdb_avl_height; |
| tree | 345 | net/bridge/br_tree.c | hl = heightof(tree->fdb_avl_left); |
| tree | 346 | net/bridge/br_tree.c | hr = heightof(tree->fdb_avl_right); |
| tree | 355 | net/bridge/br_tree.c | static void avl_checkleft (struct fdb * tree, fdb_avl_key_t key) |
| tree | 357 | net/bridge/br_tree.c | if (tree == avl_br_empty) |
| tree | 359 | net/bridge/br_tree.c | avl_checkleft(tree->fdb_avl_left,key); |
| tree | 360 | net/bridge/br_tree.c | avl_checkleft(tree->fdb_avl_right,key); |
| tree | 361 | net/bridge/br_tree.c | if (tree->fdb_avl_key < key) |
| tree | 363 | net/bridge/br_tree.c | printk("%s: avl_checkleft: left key %lu >= top key %lu\n",avl_check_point,tree->fdb_avl_key,key); |
| tree | 367 | net/bridge/br_tree.c | static void avl_checkright (struct fdb * tree, fdb_avl_key_t key) |
| tree | 369 | net/bridge/br_tree.c | if (tree == avl_br_empty) |
| tree | 371 | net/bridge/br_tree.c | avl_checkright(tree->fdb_avl_left,key); |
| tree | 372 | net/bridge/br_tree.c | avl_checkright(tree->fdb_avl_right,key); |
| tree | 373 | net/bridge/br_tree.c | if (tree->fdb_avl_key > key) |
| tree | 375 | net/bridge/br_tree.c | printk("%s: avl_checkright: right key %lu <= top key %lu\n",avl_check_point,tree->fdb_avl_key,key); |
| tree | 379 | net/bridge/br_tree.c | static void avl_checkorder (struct fdb * tree) |
| tree | 381 | net/bridge/br_tree.c | if (tree == avl_br_empty) |
| tree | 383 | net/bridge/br_tree.c | avl_checkorder(tree->fdb_avl_left); |
| tree | 384 | net/bridge/br_tree.c | avl_checkorder(tree->fdb_avl_right); |
| tree | 385 | net/bridge/br_tree.c | avl_checkleft(tree->fdb_avl_left,tree->fdb_avl_key); |
| tree | 386 | net/bridge/br_tree.c | avl_checkright(tree->fdb_avl_right,tree->fdb_avl_key); |