tag | line | file | source code |
avl_empty | 259 | include/linux/mm.h | if (tree == avl_empty) |
avl_empty | 233 | mm/mmap.c | #define heightof(tree) ((tree) == avl_empty ? 0 : (tree)->vm_avl_height) |
avl_empty | 249 | mm/mmap.c | if (tree == avl_empty) { |
avl_empty | 267 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
avl_empty | 269 | mm/mmap.c | for (node = tree->vm_avl_left; node->vm_avl_right != avl_empty; node = node->vm_avl_right) |
avl_empty | 273 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
avl_empty | 275 | mm/mmap.c | for (node = tree->vm_avl_right; node->vm_avl_left != avl_empty; node = node->vm_avl_left) |
avl_empty | 375 | mm/mmap.c | if (node == avl_empty) |
avl_empty | 383 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
avl_empty | 384 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
avl_empty | 404 | mm/mmap.c | if (node == avl_empty) |
avl_empty | 415 | mm/mmap.c | new_node->vm_avl_left = avl_empty; |
avl_empty | 416 | mm/mmap.c | new_node->vm_avl_right = avl_empty; |
avl_empty | 433 | mm/mmap.c | if (node == avl_empty) { |
avl_empty | 448 | mm/mmap.c | if (node_to_delete->vm_avl_left == avl_empty) { |
avl_empty | 457 | mm/mmap.c | if (node->vm_avl_right == avl_empty) |
avl_empty | 492 | mm/mmap.c | if (tree != avl_empty) { |
avl_empty | 494 | mm/mmap.c | if (tree->vm_avl_left != avl_empty) { |
avl_empty | 499 | mm/mmap.c | if (tree->vm_avl_right != avl_empty) { |
avl_empty | 514 | mm/mmap.c | if (tree == avl_empty) |
avl_empty | 531 | mm/mmap.c | if (tree == avl_empty) |
avl_empty | 543 | mm/mmap.c | if (tree == avl_empty) |
avl_empty | 555 | mm/mmap.c | if (tree == avl_empty) |