| 205 | } |
| 206 | |
| 207 | void |
| 208 | rte_rib_remove(struct rte_rib *rib, uint32_t ip, uint8_t depth) |
| 209 | { |
| 210 | struct rte_rib_node *cur, *prev, *child; |
| 211 | |
| 212 | cur = rte_rib_lookup_exact(rib, ip, depth); |
| 213 | if (cur == NULL) |
| 214 | return; |
| 215 | |
| 216 | --rib->cur_routes; |
| 217 | cur->flag &= ~RTE_RIB_VALID_NODE; |
| 218 | while (!is_valid_node(cur)) { |
| 219 | if ((cur->left != NULL) && (cur->right != NULL)) |
| 220 | return; |
| 221 | child = (cur->left == NULL) ? cur->right : cur->left; |
| 222 | if (child != NULL) |
| 223 | child->parent = cur->parent; |
| 224 | if (cur->parent == NULL) { |
| 225 | rib->tree = child; |
| 226 | node_free(rib, cur); |
| 227 | return; |
| 228 | } |
| 229 | if (cur->parent->left == cur) |
| 230 | cur->parent->left = child; |
| 231 | else |
| 232 | cur->parent->right = child; |
| 233 | prev = cur; |
| 234 | cur = cur->parent; |
| 235 | node_free(rib, prev); |
| 236 | } |
| 237 | } |
| 238 | |
| 239 | struct rte_rib_node * |
| 240 | rte_rib_insert(struct rte_rib *rib, uint32_t ip, uint8_t depth) |