Searched defs:left (Results 1 - 25 of 202) sorted by relevance

123456789

/illumos-gate/usr/src/test/util-tests/tests/ctf/test-merge-forward/
H A Dtest-impl.c18 int left; member in struct:foo
26 foo->left = foo->right - foo->count;
/illumos-gate/usr/src/lib/libcurses/screen/
H A Dslk_set.c54 * f: 0, 1, 2 for left, center, right-justification
61 int len, slklen = slk->_len, left; local
85 left = 0;
87 left = (slklen - len) / ((f == 1) ? 2 : 1);
89 (void) memcpy(nlab + left, lab, len);
H A Doverlap.c56 top, bottom, left, right; local
72 left = _MAX(sbx, dbx); right = _MIN(sex, dex);
74 sby = top - sby; sbx = left - sbx;
76 dby = top - dby; dbx = left - dbx;
H A Dslk_start.c218 int i, k, n, spread, left, begadd; local
229 left = (COLS-(n + 1)) % (_ngroups - 1);
230 begadd = (_ngroups / 2) - (left / 2);
236 if (left > 0 && i > begadd) {
238 left--;
/illumos-gate/usr/src/lib/libeti/menu/common/
H A Dlink.c44 int left, up; local
69 /* Set up left and right links at edge of menu */
73 left = n + r;
74 if (left >= Nitems(m)) {
75 left -= Rows(m);
77 Left(IthItem(m, n)) = IthItem(m, left);
78 Right(IthItem(m, left)) = IthItem(m, n);
101 int left, up; local
134 /* Setup left and right links at edge of menu */
137 left
[all...]
/illumos-gate/usr/src/lib/libc/port/gen/
H A Dstrlcat.c44 size_t left = dstsize; local
49 while (left-- != 0 && *df != '\0')
/illumos-gate/usr/src/tools/smatch/src/
H A Dsmatch_mtag_map.c31 struct expression *left, *right; local
39 left = strip_expr(expr->left);
52 if (!expr_to_mtag_offset(left, &left_tag, &offset))
H A Dcheck_signed_integer_overflow_check.c31 struct expression *left, *right; local
45 left = strip_expr(expr->left);
48 if (left->type != EXPR_BINOP) {
49 left = get_assigned_expr(left);
50 left = strip_expr(left);
51 if (!left || left
[all...]
H A Dcheck_struct_type.c25 struct expression *left; local
31 left = strip_expr(expr->left);
32 left_type = get_type(left);
H A Dcheck_shift_to_zero.c33 type = get_type(expr->left);
45 struct expression *left; local
52 left = strip_expr(expr->left);
53 tmp = get_assigned_expr(left);
55 left = tmp;
56 if (left->type != EXPR_BINOP || left->op != '&')
61 if (!get_implied_value(left->right, &mask))
80 type = get_type(expr->left);
[all...]
H A Dcheck_testing_index_after_use.c70 int left; local
80 if (get_implied_value(expr->left, &sval))
81 left = 1;
83 left = 0;
87 if (left)
90 slist = get_possible_states_expr(my_used_id, expr->left);
101 name = expr_to_var(left ? expr->right : expr->left);
H A Dcheck_or_vs_and.c42 static int inconsistent_check(struct expression *left, struct expression *right) argument
46 if (get_value(left->left, &sval)) {
47 if (get_value(right->left, &sval))
48 return expr_equiv_no_inc_dec(left->right, right->right);
50 return expr_equiv_no_inc_dec(left->right, right->left);
53 if (get_value(left->right, &sval)) {
54 if (get_value(right->left, &sval))
55 return expr_equiv_no_inc_dec(left
66 struct expression *left, *right; local
100 struct expression *left, *right; local
168 sval_t left, right, sval; local
[all...]
H A Dsmatch_impossible.c33 static void handle_compare(struct expression *left, int op, struct expression *right) argument
38 left = strip_expr(left);
39 while (left && left->type == EXPR_ASSIGNMENT)
40 left = strip_expr(left->left);
42 if (!possibly_true(left, op, right))
44 if (!possibly_false(left, o
[all...]
H A Dsmatch_statement_count.c28 int left, right, min; local
30 left = PTR_INT(s1->data);
33 min = left;
/illumos-gate/usr/src/lib/libresolv2/include/isc/
H A Dtree.h44 struct tree_s *left, *right; member in struct:tree_s
/illumos-gate/usr/src/lib/libdevinfo/
H A Ddevinfo_realpath.c74 * in which case the path which caused trouble is left in (resolved).
88 char left[PATH_MAX], next_token[PATH_MAX], symlink[PATH_MAX]; local
98 left_len = strlcpy(left, path + 1, sizeof (left));
105 left_len = strlcpy(left, path, sizeof (left));
107 if (left_len >= sizeof (left) || resolved_len >= PATH_MAX) {
113 * Iterate over path components in `left'.
117 * Extract the next path component and adjust `left'
120 p = strchr(left, '/');
[all...]
/illumos-gate/usr/src/lib/libcryptoutil/common/
H A Dkeyfile.c112 size_t left = filesize; local
115 for (/* */; left > 0; marker += nread, left -= nread) {
117 nread = read(fd, marker, left);
137 filesize -= left;
/illumos-gate/usr/src/cmd/ipf/lib/common/
H A Dkmem.c108 int r = 0, left; local
119 for (bufp = buffer, left = size; left > 0; bufp += r, left -= r) {
120 r = read(*kvm, bufp, left);
127 r = left;
/illumos-gate/usr/src/cmd/isns/isnsd/
H A Disns_sched.h47 struct el_key *left; member in struct:el_key
/illumos-gate/usr/src/lib/libbc/libc/gen/common/
H A Dmallint.h48 * The left pointer of a header blocks is used to chain free header
64 Freehdr left; /* Left tree pointer */ member in struct:freehdr
/illumos-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DBST.java43 public BST left = null; field in class:BST
53 left = right = null;
77 if (left != null)
78 left.insert(theItem);
80 left = node = new BST(theItem);
113 if (left != null)
114 rv = left.find_tree(newKey, exactMatch);
136 if (left != null)
137 rv = left.find(newKey, exactMatch);
152 if (left !
[all...]
/illumos-gate/usr/src/cmd/mdb/common/mdb/
H A Dmdb_strio.c52 size_t left = sd->str_base + sd->str_len - sd->str_ptr; local
54 if (left != 0) {
55 size_t obytes = nbytes < left ? nbytes : left;
/illumos-gate/usr/src/cmd/ldap/common/
H A Dldaptool.h209 struct Element *left; member in struct:Element
/illumos-gate/usr/src/lib/libast/common/cdt/
H A Ddthdr.h42 #define left hl._left macro
68 #define rrotate(x,y) ((x)->left = (y)->right, (y)->right = (x))
69 #define lrotate(x,y) ((x)->right = (y)->left, (y)->left = (x))
70 #define rlink(r,x) ((r) = (r)->left = (x) )
/illumos-gate/usr/src/uts/common/krtld/
H A Dkobj_subr.c94 size_t left = dstsize; local
99 while (left-- != 0 && *df != '\0')

Completed in 306 milliseconds

123456789