tag | line | file | source code |
fdb_avl_left | 156 | include/net/br.h | struct fdb *fdb_avl_left; |
fdb_avl_left | 58 | net/bridge/br_tree.c | fdb_head.fdb_avl_left = (struct fdb *)0; |
fdb_avl_left | 106 | net/bridge/br_tree.c | tree = tree->fdb_avl_left; |
fdb_avl_left | 127 | net/bridge/br_tree.c | struct fdb * nodeleft = node->fdb_avl_left; |
fdb_avl_left | 137 | net/bridge/br_tree.c | struct fdb * nodeleftleft = nodeleft->fdb_avl_left; |
fdb_avl_left | 148 | net/bridge/br_tree.c | node->fdb_avl_left = nodeleftright; |
fdb_avl_left | 162 | net/bridge/br_tree.c | nodeleft->fdb_avl_right = nodeleftright->fdb_avl_left; |
fdb_avl_left | 163 | net/bridge/br_tree.c | node->fdb_avl_left = nodeleftright->fdb_avl_right; |
fdb_avl_left | 164 | net/bridge/br_tree.c | nodeleftright->fdb_avl_left = nodeleft; |
fdb_avl_left | 173 | net/bridge/br_tree.c | struct fdb * noderightleft = noderight->fdb_avl_left; |
fdb_avl_left | 177 | net/bridge/br_tree.c | noderight->fdb_avl_left = node; |
fdb_avl_left | 181 | net/bridge/br_tree.c | noderight->fdb_avl_left = noderightleft->fdb_avl_right; |
fdb_avl_left | 182 | net/bridge/br_tree.c | node->fdb_avl_right = noderightleft->fdb_avl_left; |
fdb_avl_left | 184 | net/bridge/br_tree.c | noderightleft->fdb_avl_left = node; |
fdb_avl_left | 224 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_left; |
fdb_avl_left | 239 | net/bridge/br_tree.c | new_node->fdb_avl_left = avl_br_empty; |
fdb_avl_left | 274 | net/bridge/br_tree.c | nodeplace = &node->fdb_avl_left; |
fdb_avl_left | 280 | net/bridge/br_tree.c | if (node_to_delete->fdb_avl_left == avl_br_empty) { |
fdb_avl_left | 285 | net/bridge/br_tree.c | struct fdb ** nodeplace = &node_to_delete->fdb_avl_left; |
fdb_avl_left | 294 | net/bridge/br_tree.c | *nodeplace = node->fdb_avl_left; |
fdb_avl_left | 296 | net/bridge/br_tree.c | node->fdb_avl_left = node_to_delete->fdb_avl_left; |
fdb_avl_left | 300 | net/bridge/br_tree.c | *stack_ptr_to_delete = &node->fdb_avl_left; /* replace &node_to_delete->fdb_avl_left */ |
fdb_avl_left | 320 | net/bridge/br_tree.c | if (tree->fdb_avl_left != avl_br_empty) { |
fdb_avl_left | 321 | net/bridge/br_tree.c | printk_avl(tree->fdb_avl_left); |
fdb_avl_left | 342 | net/bridge/br_tree.c | avl_checkheights(tree->fdb_avl_left); |
fdb_avl_left | 345 | net/bridge/br_tree.c | hl = heightof(tree->fdb_avl_left); |
fdb_avl_left | 359 | net/bridge/br_tree.c | avl_checkleft(tree->fdb_avl_left,key); |
fdb_avl_left | 371 | net/bridge/br_tree.c | avl_checkright(tree->fdb_avl_left,key); |
fdb_avl_left | 383 | net/bridge/br_tree.c | avl_checkorder(tree->fdb_avl_left); |
fdb_avl_left | 385 | net/bridge/br_tree.c | avl_checkleft(tree->fdb_avl_left,tree->fdb_avl_key); |