Searched refs:left (Results 1 - 21 of 21) sorted by relevance

/systemd/src/basic/
H A Dverbs.c35 int left; local
43 left = argc - optind;
72 left = 1;
75 (unsigned) left < verb->min_args) {
81 (unsigned) left > verb->max_args) {
92 return verb->dispatch(left, argv + optind, userdata);
H A Dc-rbtree.c70 * does not have any left children, this returns @n.
78 while (n->left)
79 n = n->left;
145 if (n->left)
146 return c_rbnode_rightmost(n->left);
148 while ((p = c_rbnode_parent(n)) && n == p->left)
220 if (p->left == old)
221 p->left = new;
261 } else if (p == p->__parent_and_color->left) { /* parent is red, so grandparent exists */
282 * become left chil
[all...]
H A Dstrbuf.c110 int left = 0, right = node->children_count; local
112 while (right > left) {
113 int middle = (right + left) / 2 ;
115 left = middle + 1;
120 memmove(node->children + left + 1, node->children + left,
121 sizeof(struct strbuf_child_entry) * (node->children_count - left));
122 node->children[left] = new;
H A Dsiphash24.c73 size_t left = state->inlen & 7; local
83 if (left > 0) {
84 for ( ; in < end && left < 8; in ++, left ++)
85 state->padding |= ((uint64_t) *in) << (left * 8);
87 if (in == end && left < 8)
124 left = state->inlen & 7;
125 switch (left) {
H A Dc-rbtree.h33 * three fields. The @left and @right members can be accessed by the API user
51 * @left: left 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
70 CRBNode *left; member in struct:CRBNode
218 i = i->left;
285 i = &(*i)->left;
H A Dprocess-util.c137 size_t left; local
144 left = max_length;
149 if (left <= 4)
153 left--;
157 if (left <= 4)
161 left--;
166 if (left <= 4) {
167 size_t n = MIN(left-1, 3U);
H A Dhashmap.c496 unsigned left, right, prev, dib; local
507 left = idx;
509 for (right = next_idx(h, left); ; right = next_idx(h, 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;
537 prev = left, lef
[all...]
/systemd/src/login/
H A Dlogind-utmp.c42 usec_t left; local
53 left = elapse - n;
56 if (wall_timers[i] * USEC_PER_MINUTE >= left)
57 return left - wall_timers[i-1] * USEC_PER_MINUTE;
59 return left % USEC_PER_HOUR;
77 usec_t left; local
85 left = m->scheduled_shutdown_timeout > n;
91 left ? "at " : "NOW",
92 left ? format_timestamp(date, sizeof(date), m->scheduled_shutdown_timeout) : "");
156 /* Warn immediately if less than 15 minutes are left */
[all...]
/systemd/src/test/
H A Dtest-rbtree.c80 /* traverse to left-most child, count black nodes */
83 while (n && n->left) {
86 n = n->left;
111 assert(!n->left || c_rbnode_parent(n->left) == n);
119 assert(!n->left || c_rbnode_is_black(n->left));
127 if (!n->left && !n->right)
136 while (n->left) {
137 n = n->left;
[all...]
/systemd/src/hostname/
H A Dhostnamectl.c447 int left; local
453 left = argc - optind;
455 if (left <= 0)
477 if (left != verbs[i].argc) {
485 if (left < verbs[i].argc) {
493 if (left > verbs[i].argc) {
504 return verbs[i].dispatch(bus, argv + optind, left);
/systemd/src/timedate/
H A Dtimedatectl.c430 int left; local
436 left = argc - optind;
438 if (left <= 0)
460 if (left != verbs[i].argc) {
468 if (left < verbs[i].argc) {
476 if (left > verbs[i].argc) {
487 return verbs[i].dispatch(bus, argv + optind, left);
/systemd/src/shared/
H A Dutmp-wtmp.c326 size_t left; local
337 left = strlen(message);
341 while (left > 0) {
362 n = write(fd, p, left);
370 assert((size_t) n <= left);
373 left -= n;
/systemd/src/locale/
H A Dlocalectl.c606 int left; local
612 left = argc - optind;
614 if (left <= 0)
636 if (left != verbs[i].argc) {
644 if (left < verbs[i].argc) {
652 if (left > verbs[i].argc) {
663 return verbs[i].dispatch(bus, argv + optind, left);
/systemd/src/journal/
H A Djournal-vacuum.c203 * left around */
314 unsigned left; local
316 left = n_active_files + n_list - i;
320 (n_max_files <= 0 || left <= n_max_files))
H A Djournal-file.c1770 uint64_t left, right, k, lp; local
1794 left = 0;
1824 left = x + 1;
1844 left = y + 1;
1849 if (left == right) {
1853 i = left;
1857 assert(left < right);
1858 i = (left + right) / 2;
1874 left = i + 1;
/systemd/src/core/
H A Ddbus.c995 size_t left = sizeof(sa.un.sun_path); local
1005 left = strpcpy(&p, left, e);
1006 left = strpcpy(&p, left, "/systemd/private");
1008 salen = sizeof(sa.un) - left;
H A Dtimer.c484 usec_t left; local
488 left = t->next_elapse_monotonic_or_boottime > ts_monotonic ? t->next_elapse_monotonic_or_boottime - ts_monotonic : 0;
489 log_unit_debug(UNIT(t), "Monotonic timer elapses in %s.", format_timespan(buf, sizeof(buf), left, 0));
/systemd/src/import/
H A Dpull-job.c492 usec_t left, done; local
495 left = (usec_t) (((double) done * (double) dltotal) / dlnow) - done;
497 log_info("Got %u%% of %s. %s left at %s/s.",
500 format_timespan(buf, sizeof(buf), left, USEC_PER_SEC),
/systemd/src/libsystemd/sd-netlink/
H A Dsd-netlink.c617 usec_t left; local
672 left = timeout - n;
674 left = (uint64_t) -1;
676 r = rtnl_poll(rtnl, true, left);
/systemd/src/resolve/
H A Dresolved-dns-cache.c311 usec_t left; local
316 left = LESS_BY(rr->expiry, now(CLOCK_REALTIME));
317 if (u > left)
318 u = left;
/systemd/src/libsystemd/sd-bus/
H A Dsd-bus.c2027 usec_t left; local
2108 left = timeout - n;
2110 left = (uint64_t) -1;
2112 r = bus_poll(bus, true, left);
3545 * actualy path matched the template. Otherwise, they're left

Completed in 148 milliseconds