Lines Matching refs:rightmost
55 /// The rightmost node in the tree. Since the tree is filled
57 index_tree_node *rightmost;
186 tree->rightmost = NULL;
233 node->parent = tree->rightmost;
243 tree->rightmost = node;
248 assert(tree->rightmost->uncompressed_base <= node->uncompressed_base);
249 assert(tree->rightmost->compressed_base < node->compressed_base);
251 // Add the new node after the rightmost node. It's the correct
253 tree->rightmost->right = node;
254 tree->rightmost = node;
325 // We must pick the rightmost one.
559 const index_stream *s = (const index_stream *)(i->streams.rightmost);
560 const index_group *g = (const index_group *)(s->groups.rightmost);
581 const index_stream *s = (const index_stream *)(i->streams.rightmost);
607 index_stream *s = (index_stream *)(i->streams.rightmost);
621 index_stream *s = (index_stream *)(i->streams.rightmost);
646 index_stream *s = (index_stream *)(i->streams.rightmost);
647 index_group *g = (index_group *)(s->groups.rightmost);
793 index_stream *s = (index_stream *)(dest->streams.rightmost);
794 index_group *g = (index_group *)(s->groups.rightmost);
825 if (s->groups.rightmost == &g->node)
826 s->groups.rightmost = &newg->node;
986 } else if (i->streams.rightmost != &stream->node
987 || stream->groups.rightmost != &group->node) {
1019 if (stream->groups.rightmost == NULL) {
1026 stream->groups.rightmost);
1220 // This is because we want the rightmost Record that fullfills the