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

1234567891011>>

/illumos-gate/usr/src/tools/smatch/src/
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_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 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 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_wait_for_common.c26 if (!expr_unsigned(expr->left))
28 name = expr_to_str(expr->left);
H A Dsmatch_type_links.c54 if (!is_void_pointer(expr->left))
64 sql_insert_data_info(expr->left, TYPE_LINK, type_to_str(type));
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_unused_ret.c101 struct expression *left; local
114 left = strip_expr(expr->left);
115 if (!left || left->type != EXPR_SYMBOL)
117 if (left->symbol->ctype.modifiers & (MOD_TOPLEVEL | MOD_EXTERN | MOD_STATIC))
120 skip_this = left;
122 set_state_expr(my_id, left, alloc_state_num(assign_id));
126 assign->name = expr_to_var(left);
134 struct expression *left; local
[all...]
H A Dcheck_precedence.c64 if (expr->left->type == EXPR_COMPARE || expr->right->type == EXPR_COMPARE)
66 if (expr->left->type == EXPR_PREOP && expr->left->op == '!') {
67 if (expr->left->unop->type == EXPR_PREOP && expr->left->unop->op == '!')
73 if (is_bool(expr->left->unop))
75 if (is_bool_from_context(expr->left->unop))
82 if (expr->left->type == EXPR_COMPARE || expr->right->type == EXPR_COMPARE)
94 if (is_bool_op(expr->left))
107 if (expr->left
[all...]
H A Dsmatch_integer_overflow.c56 struct expression *left, *right, *binop; local
69 left = strip_parens(expr->left);
74 if (!get_value(right->left, &max))
87 binop = binop_expression(left, '*', right->right);
98 struct expression *left, *right; local
109 left = strip_parens(expr->left);
112 if (left->op != '+')
121 if (!expr_equiv(left
229 int left = -1; local
[all...]
H A Dcheck_impossible_mask.c36 unsigned long long left, right;
38 left = find_possible_bits(expr->left);
39 if (!left)
46 return left & right;
47 return left | right;
99 left_mask = get_possible_bits(expr->left);
H A Dcheck_macros.c48 if (positions_eq(expr->left->pos, pos))
62 if (expr->left->type == EXPR_PREOP)
63 match_inside(expr->left, expr->pos);
67 if (expr->left->type == EXPR_BINOP)
68 match_one_side(expr->left, expr->pos, expr->op);
H A Dsmatch_struct_assignment.c149 static void handle_non_struct_assignments(struct expression *left, struct expression *right) argument
154 type = get_type(left);
158 left = deref_expression(left);
162 right = unknown_value_expression(left);
163 assign = assign_expression(left, '=', right);
172 right = unknown_value_expression(left);
173 assign = assign_expression(left, '=', right);
177 static void set_inner_struct_members(int mode, struct expression *faked, struct expression *left, struct expression *right, struct symbol *member) argument
186 left
227 __struct_members_copy(int mode, struct expression *faked, struct expression *left, struct expression *right) argument
321 copy_containter_states(struct expression *left, struct expression *right, int offset) argument
452 struct expression *left, *right, *arg; local
[all...]
/illumos-gate/usr/src/cmd/cron/
H A Delm.c86 * left = points to the notice immediately preceding this one.
94 struct notice *left; member in struct:notice
105 * left = points to the key immediately preceding this one.
111 struct key *left; member in struct:key
156 n->left = NULL;
163 k->left = NULL;
176 n->left = nprev;
183 k->left = kprev;
198 n->left = nprev;
206 k->left
[all...]
/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/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/tools/scripts/
H A Dbringovercheck.sh44 left=$(/bin/ls -E "$1" 2>/dev/null | awk '{print $7}')
45 left=${left##*.}
48 [ -z "$left" -o -z "$right" -o "$left" -gt "$right" ] && return 0
/illumos-gate/usr/src/lib/libast/common/cdt/
H A Ddtlist.c52 r = r->left;
99 { r->left = t->left;
100 t->left->right = r;
102 t->left = r;
110 { r->left = t->left;
111 t->left = r;
113 else r->left = r;
118 { t->left
[all...]
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) )
H A Ddttree.c61 { while((t = root->left) )
81 { while((t = root->left) )
90 /* note that link.right is LEFT tree and link.left is RIGHT tree */
102 l->right = root->left;
103 r->left = root->right;
133 if(!(t = cmp < 0 ? t->left : t->right) )
141 { t = root->left;
145 root = t->left;
163 root = t->left;
174 { if((t = root->left) )
[all...]
H A Ddtrenew.c50 { if(!e->right ) /* make left child the new root */
51 dt->data->here = e->left;
55 /* merge left subtree to right subtree */
56 if(e->left)
57 { for(t = e->right; t->left; t = t->left)
59 t->left = e->left;
/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/sgs/m4/common/
H A Dm4y.y40 %left OROR
41 %left ANDAND
42 %left '|' '^'
43 %left '&'
46 %left '+' '-'
47 %left '*' '/' '%'
/illumos-gate/usr/src/lib/libc/port/gen/
H A Dstrlcat.c44 size_t left = dstsize; local
49 while (left-- != 0 && *df != '\0')

Completed in 319 milliseconds

1234567891011>>