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

1234567891011>>

/illumos-gate/usr/src/test/util-tests/tests/ctf/test-merge-forward/
H A Dtest-impl.c19 int right; member in struct:foo
26 foo->left = foo->right - foo->count;
27 foo->count += foo->right;
28 foo->right--;
/illumos-gate/usr/src/tools/smatch/src/
H A Dcheck_64bit_shift.c25 struct expression *right, *shifter; local
36 if (type_bits(get_type(expr->right)) == 64)
39 right = strip_expr(expr->right);
40 if (right->type != EXPR_BINOP || right->op != SPECIAL_LEFTSHIFT)
43 shifter = strip_expr(right->right);
48 str = expr_to_str(expr->right);
56 struct expression *right; local
[all...]
H A Dcheck_or_vs_and.c42 static int inconsistent_check(struct expression *left, struct expression *right) argument
47 if (get_value(right->left, &sval))
48 return expr_equiv_no_inc_dec(left->right, right->right);
49 if (get_value(right->right, &sval))
50 return expr_equiv_no_inc_dec(left->right, right->left);
53 if (get_value(left->right,
66 struct expression *left, *right; local
100 struct expression *left, *right; local
168 sval_t left, right, sval; local
[all...]
H A Dcheck_logical_instead_of_bitwise.c44 if (!get_value(expr->right, &sval)) {
57 struct expression *right; local
59 right = strip_expr(expr->right);
60 if (right->type != EXPR_LOGICAL)
62 if (is_bitshift(right->left) || is_bitshift(right->right))
H A Dsmatch_mtag_map.c31 struct expression *left, *right; local
40 right = strip_expr(expr->right);
42 if (!type_is_ptr(get_type(right)))
44 if (!get_implied_value(right, &sval))
H A Dcheck_assign_vs_compare.c26 if (!get_value(expr->right, &val))
34 struct expression *right = strip_expr(expr->right); local
39 if (right->type != EXPR_PREOP ||
40 right->op != '&')
46 str = expr_to_str(right);
H A Dsmatch_struct_assignment.c48 * I don't have a proper solution for this problem right now. I just copy one
88 static struct expression *get_right_base_expr(struct symbol *left_type, struct expression *right) argument
92 if (!right)
95 struct_type = get_struct_type(right);
101 if (right->type == EXPR_PREOP && right->op == '&')
102 right = strip_expr(right->unop);
104 if (right->type == EXPR_CALL)
107 if (is_pointer(right))
149 handle_non_struct_assignments(struct expression *left, struct expression *right) argument
177 set_inner_struct_members(int mode, struct expression *faked, struct expression *left, struct expression *right, struct symbol *member) argument
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
362 struct expression *right; local
452 struct expression *left, *right, *arg; local
[all...]
H A Dsmatch_data_source.c70 struct expression *right; local
75 right = get_assigned_expr(expr);
76 right = strip_expr(right);
77 if (!right)
79 if (right->type != EXPR_CALL || right->fn->type != EXPR_SYMBOL)
81 if (is_fake_call(right))
83 name = expr_to_str(right->fn);
H A Dcheck_signed.c54 if (!get_implied_value(expr->right, &sval))
61 right_name = expr_to_str(expr->right);
70 if (expr->right->type == EXPR_PREOP && expr->right->op == '~')
99 if (!get_value(expr->right, &known) || known.value != 0)
107 struct expression *right = strip_expr(tmp->right); local
109 if (right->op != '<' &&
110 right->op != SPECIAL_UNSIGNED_LT &&
111 right
155 struct expression *right = strip_expr(tmp->right); local
[all...]
H A Dcheck_impossible_mask.c36 unsigned long long left, right;
41 right = find_possible_bits(expr->right);
42 if (!right)
46 return left & right;
47 return left | right;
73 if (!get_implied_value(expr->right, &sval))
95 if (!get_value(expr->right, &sval))
H A Dcheck_signed_integer_overflow_check.c31 struct expression *left, *right; local
46 right = strip_expr(expr->right);
58 if (has_variable(left, right) == 1) {
60 right_name = expr_to_str(right);
90 get_absolute_min(expr->right, &right_min);
H A Dcheck_precedence.c64 if (expr->left->type == EXPR_COMPARE || expr->right->type == EXPR_COMPARE)
69 if (expr->right->op == '!')
71 if (is_bool(expr->right))
82 if (expr->left->type == EXPR_COMPARE || expr->right->type == EXPR_COMPARE)
96 if (is_bool_op(expr->right))
115 if (expr->right->type != EXPR_BINOP)
117 if (expr->right->op != SPECIAL_RIGHTSHIFT)
127 if (expr->right->type != EXPR_COMPARE)
137 if (expr->right->type != EXPR_BINOP)
139 if (expr->right
[all...]
H A Dsmatch_integer_overflow.c56 struct expression *left, *right, *binop; local
70 right = strip_parens(expr->right);
72 if (right->type != EXPR_BINOP || right->op != '/')
74 if (!get_value(right->left, &max))
87 binop = binop_expression(left, '*', right->right);
98 struct expression *left, *right; local
110 right
230 int right = -1; local
[all...]
H A Dsmatch_constraints_required.c99 struct expression *left, *right; local
125 right = strip_expr(size->right);
132 if (right->type == EXPR_BINOP && right->op == '*') {
136 mult_left = strip_expr(right->left);
137 mult_right = strip_expr(right->right);
194 mult_right = strip_expr(size->right);
207 get_implied_value(size->right,
300 struct expression *right, *arg, *tmp; local
434 char *left, *right; local
[all...]
H A Dcheck_buffer_too_small_for_struct.c39 right_type = get_type(expr->right);
48 bytes = get_array_size_bytes(expr->right);
52 size_expr = get_size_variable(expr->right, &limit_type);
68 struct expression *right; local
90 right = get_assigned_expr(expr);
91 size_expr = get_size_variable(right, &limit_type);
101 name = expr_to_str(right);
H A Dsmatch_assigned_expr.c69 if (is_fake_call(expr->right))
74 if (!get_implied_rl(expr->right, &rl))
89 set_state(my_id, left_name, left_sym, alloc_state_expr(strip_expr(expr->right)));
91 right_name = expr_to_var_sym(expr->right, &right_sym);
104 struct expression *arg, *right; local
111 expr = strip_expr(expr->right);
125 right = get_argument_from_call_expr(expr->args, right_param);
126 if (!right || !arg)
133 set_state(my_id, name, sym, alloc_state_expr(right));
H A Dcheck_macros.c46 if (positions_eq(expr->right->pos, pos))
64 if (expr->right->type == EXPR_POSTOP)
65 match_inside(expr->right, expr->pos);
69 if (expr->right->type == EXPR_BINOP)
70 match_one_side(expr->right, expr->pos, expr->op);
H A Dcheck_kmalloc_to_bugon.c41 struct expression *right; local
50 right = (struct expression *)state->data;
51 if (!is_kmalloc_call(right))
/illumos-gate/usr/src/cmd/cron/
H A Delm.c87 * right = points to the notice immediately following this one.
95 struct notice *right; }; member in struct:notice
106 * right = points to the key immediately following this one.
112 struct key *right; }; member in struct:key
123 struct index *right; }; member in struct:index
177 nprev->right = n;
184 kprev->right = k;
192 indprev->right = ind;
199 n->right = NULL;
200 nprev->right
[all...]
/illumos-gate/usr/src/tools/scripts/
H A Dbringovercheck.sh46 right=$(/bin/ls -E "$2" 2>/dev/null | awk '{print $7}')
47 right=${right##*.}
48 [ -z "$left" -o -z "$right" -o "$left" -gt "$right" ] && return 0
/illumos-gate/usr/src/lib/libast/common/cdt/
H A Ddtrenew.c50 { if(!e->right ) /* make left child the new root */
52 else /* make right child the new root */
53 { dt->data->here = e->right;
55 /* merge left subtree to right subtree */
57 { for(t = e->right; t->left; t = t->left)
66 *s = e->right;
68 { for(; t->right != e; t = t->right)
70 t->right = e->right;
[all...]
H A Ddtflatten.c48 last->right = t;
50 while(last->right)
51 last = last->right;
61 for(list = last = r, r = r->right; r; last = r, r = r->right)
66 last->right = r;
H A Ddttreeset.c44 l = l->right;
46 mid = l->right; l->right = NIL(Dtlink_t*);
48 mid->right = treebalance(mid->right, size - (n + 1));
/illumos-gate/usr/src/cmd/print/printmgr/com/sun/admin/pm/client/
H A DBST.java44 public BST right = null; field in class:BST
53 left = right = null;
82 if (right != null)
83 right.insert(theItem);
85 right = node = new BST(theItem);
116 if (right != null)
117 rv = right.find_tree(newKey, exactMatch);
139 if (right != null)
140 rv = right.find(newKey, exactMatch);
155 if (right !
[all...]
/illumos-gate/usr/src/lib/libresolv2/common/isc/
H A Dtree.c107 RET(tree_srch(&(**ppr_tree).right,
160 if (!tree_trav(&(**ppr_tree).right, pfi_uar))
170 tree_mung(&(**ppr_tree).right, pfv_uar);
196 (*ppr)->right = NULL;
218 /* right branch WAS longer; bal is ok now */
234 (*ppr)->left = p1->right;
235 p1->right = *ppr;
241 p2 = p1->right;
242 p1->right = p2->left;
245 (*ppr)->left = p2->right;
[all...]

Completed in 225 milliseconds

1234567891011>>