Searched refs:right (Results 1 - 6 of 6) sorted by relevance

/systemd/src/basic/
H A Dc-rbtree.c89 * @n does not have any right children, this returns @n.
97 while (n->right)
98 n = n->right;
119 if (n->right)
120 return c_rbnode_leftmost(n->right);
122 while ((p = c_rbnode_parent(n)) && n == p->right)
223 p->right = new;
264 u = g->right;
279 if (n == p->right) {
281 * We're the right chil
[all...]
H A Dc-rbtree.h33 * three fields. The @left and @right members can be accessed by the API user
52 * @right: right child, or NULL
55 * pointers to its left and right child, which can be freely accessed by the
56 * API user at any time. They are NULL, if the node does not have a left/right
71 CRBNode *right; member in struct:CRBNode
220 i = i->right;
287 i = &(*i)->right;
H A Dstrbuf.c110 int left = 0, right = node->children_count; local
112 while (right > left) {
113 int middle = (right + left) / 2 ;
117 right = middle;
H A Dhashmap.c496 unsigned left, right, prev, dib; local
508 /* Find the stop bucket ("right"). It is either free or has DIB == 0. */
509 for (right = next_idx(h, left); ; right = next_idx(h, right)) {
510 raw_dib = dibs[right];
517 assert(left != right);
535 /* Now shift all buckets in the interval (left, right) one step backwards */
536 for (prev = left, left = next_idx(h, left); left != right;
/systemd/src/test/
H A Dtest-rbtree.c110 assert(!n->right || c_rbnode_parent(n->right) == n);
120 assert(!n->right || c_rbnode_is_black(n->right));
127 if (!n->left && !n->right)
131 if (n->right) {
132 n = n->right;
142 while ((p = c_rbnode_parent(n)) && n == p->right) {
144 if (c_rbnode_is_black(p->right))
172 i = &(*i)->right;
[all...]
/systemd/src/journal/
H A Djournal-file.c1757 /* OK, what we are looking for is right of the
1770 uint64_t left, right, k, lp; local
1777 right = MIN(k, n);
1778 if (right <= 0)
1781 i = right - 1;
1795 right -= 1;
1798 assert(last_index <= right);
1822 right = x;
1827 if (last_index < right) {
1842 right
[all...]

Completed in 1815 milliseconds