subversion/libsvn_delta/compose_delta.c

56   /* 'left' and 'right' link the node into a splay tree. */
57   range_index_node_t *left, *right;
248   node->left = node->right = NULL;
272   range_index_node_t *left, *right;
277   scratch_node.left = scratch_node.right = NULL;
278   left = right = &scratch_node;
289               tree->left = node->right;
290               node->right = tree;
296           /* Remember the right subtree */
297           right->left = tree;
298           right = tree;
303           if (tree->right != NULL
304               && offset > tree->right->offset)
307               range_index_node_t *const node = tree->right;
308               tree->right = node->left;
312           if (tree->right == NULL)
316           left->right = tree;
318           tree = tree->right;
324   /* Link in the left and right subtrees */
325   left->right = tree->left;
326   right->left = tree->right;
327   tree->left  = scratch_node.right;
328   tree->right = scratch_node.left;
334      ranges) to the right of the root. This makes cleaning up the
339       if (tree->left->right == NULL)
341           /* A single right rotation is enough. */
343           tree->left = node->right; /* Which is always NULL. */
344           node->right = tree;
351           while ((*nodep)->right != NULL)
352             nodep = &(*nodep)->right;
355           right = tree;
359           right->left = tree->right; /* Which is always NULL, too. */
361           tree->right = right;
398       delete_subtree(ndx, node->right);
407   range_index_node_t **nodep = &ndx->tree->right;
412         (node->right != NULL && node->right->offset < top_offset
413          ? node->right->offset
419           *nodep = node->right;
420           node->right = NULL;
481                   /* Insert the range to the right of the splayed node. */
489                   node->right = ndx->tree->right;
490                   ndx->tree->right = NULL;
506           node->right = node->next = ndx->tree;