| 5176 | } |
| 5177 | |
| 5178 | static void tree_rotate_right(struct tree_s *t, struct node_s *n) |
| 5179 | { |
| 5180 | struct node_s *tmp = TREE_LEFT(n); |
| 5181 | if ((TREE_LEFT(n) = TREE_RIGHT(tmp)) != NULL) |
| 5182 | TREE_PARENT(TREE_RIGHT(tmp)) = n; |
| 5183 | if ((TREE_PARENT(tmp) = TREE_PARENT(n)) != NULL) |
| 5184 | { |
| 5185 | if (n == TREE_LEFT(TREE_PARENT(n))) |
| 5186 | TREE_LEFT(TREE_PARENT(n)) = tmp; |
| 5187 | else |
| 5188 | TREE_RIGHT(TREE_PARENT(n)) = tmp; |
| 5189 | } else |
| 5190 | t->root = tmp; |
| 5191 | TREE_RIGHT(tmp) = n; |
| 5192 | TREE_PARENT(n) = tmp; |
| 5193 | } |
| 5194 | |
| 5195 | static void tree_rebalance_insert(struct tree_s *t, struct node_s *n) |
| 5196 | { |
no outgoing calls
no test coverage detected