/freebsd-9.3-release/contrib/ntp/tests/libntp/ |
H A D | lfpfunc.c | 74 const l_fp op2 = second; local 77 b[0] = op2.l_uf; b[1] = op2.l_ui; b[2] = 0; 80 b[2] -= (op2.l_i < 0); 90 const l_fp op2 = second; local 93 b[0] = op2.l_uf; b[1] = op2.l_ui; b[2] = 0; 302 l_fp op2 = l_fp_init(addsub_tab[idx][1].h, addsub_tab[idx][1].l); local 304 l_fp res = l_fp_add(op1, op2); 317 l_fp op2 local 337 l_fp op2 = l_fp_init(addsub_tab[idx][0].h, addsub_tab[idx][0].l); local 354 l_fp op2 = l_fp_init(addsub_tab[idx][1].h, addsub_tab[idx][1].l); local 374 l_fp op2 = l_fp_negate(op1); local 396 l_fp op2 = l_fp_abs(op1); local 440 double op2 = l_fp_convert_to_double(op1); local 466 l_fp op2 = l_fp_init(tv[1].h, tv[1].l); local 510 l_fp op2 = l_fp_init(tv[1].h, tv[1].l); local [all...] |
/freebsd-9.3-release/sys/amd64/amd64/ |
H A D | db_disasm.c | 116 #define op2(x,y) ((x)|((y)<<8)) macro 128 /*80*/ { "", TRUE, SDEP, op2(E, Rq), "invept" }, 129 /*81*/ { "", TRUE, SDEP, op2(E, Rq), "invvpid" }, 130 /*82*/ { "", TRUE, SDEP, op2(E, Rq), "invpcid" }, 235 /*02*/ { "lar", TRUE, LONG, op2(E,R), 0 }, 236 /*03*/ { "lsl", TRUE, LONG, op2(E,R), 0 }, 253 /*20*/ { "mov", TRUE, LONG, op2(CR,El), 0 }, 254 /*21*/ { "mov", TRUE, LONG, op2(DR,El), 0 }, 255 /*22*/ { "mov", TRUE, LONG, op2(El,CR), 0 }, 256 /*23*/ { "mov", TRUE, LONG, op2(E [all...] |
/freebsd-9.3-release/sys/i386/i386/ |
H A D | db_disasm.c | 101 #define op2(x,y) ((x)|((y)<<8)) macro 181 /*02*/ { "lar", TRUE, LONG, op2(E,R), 0 }, 182 /*03*/ { "lsl", TRUE, LONG, op2(E,R), 0 }, 199 /*20*/ { "mov", TRUE, LONG, op2(CR,El), 0 }, 200 /*21*/ { "mov", TRUE, LONG, op2(DR,El), 0 }, 201 /*22*/ { "mov", TRUE, LONG, op2(El,CR), 0 }, 202 /*23*/ { "mov", TRUE, LONG, op2(El,DR), 0 }, 203 /*24*/ { "mov", TRUE, LONG, op2(TR,El), 0 }, 205 /*26*/ { "mov", TRUE, LONG, op2(El,TR), 0 }, 239 /*40*/ { "cmovo", TRUE, NONE, op2( [all...] |
/freebsd-9.3-release/contrib/one-true-awk/ |
H A D | awkgram.y | 199 var ASGNOP ppattern { $$ = op2($2, $1, $3); } 203 { $$ = op2(BOR, notnull($1), notnull($3)); } 205 { $$ = op2(AND, notnull($1), notnull($3)); } 212 | ppattern IN varname { $$ = op2(INTEST, $1, makearr($3)); } 213 | '(' plist ')' IN varname { $$ = op2(INTEST, $2, makearr($5)); } 214 | ppattern term %prec CAT { $$ = op2(CAT, $1, $2); } 220 var ASGNOP pattern { $$ = op2($2, $1, $3); } 224 { $$ = op2(BOR, notnull($1), notnull($3)); } 226 { $$ = op2(AND, notnull($1), notnull($3)); } 227 | pattern EQ pattern { $$ = op2( [all...] |
H A D | b.c | 131 p1 = op2(CAT, op2(STAR, op2(ALL, NIL, NIL), NIL), p); 133 p1 = op2(CAT, p1, op2(FINAL, NIL, NIL)); 633 return(op2(EMPTYRE, NIL, NIL)); 652 np = op2(CHAR, NIL, itonp(rlxval)); 657 return (unary(op2(ALL, NIL, NIL))); 660 return (unary(op2(ALL, NIL, NIL))); 663 return (unary(op2(DO [all...] |
H A D | proto.h | 77 extern Node *op2(int, Node *, Node *);
|
H A D | parse.c | 141 Node *op2(int a, Node *b, Node *c) function
|
/freebsd-9.3-release/bin/sh/ |
H A D | arith_yacc.c | 116 static inline int higher_prec(int op1, int op2) argument 118 return arith_prec(op1) < arith_prec(op2); 208 int op2; local 216 op2 = last_token; 217 if (op2 >= ARITH_BINOP_MIN && op2 < ARITH_BINOP_MAX && 218 higher_prec(op2, op)) { 219 b = binop2(b, op2, arith_prec(op), noeval); 220 op2 = last_token; 225 if (op2 < ARITH_BINOP_MI [all...] |
/freebsd-9.3-release/usr.sbin/config/ |
H A D | config.y | 414 struct opt *op, *op2; 424 op2 = findopt(list, name); 425 if (op2 != NULL && !append) { 437 if (op2 != NULL) { 438 while (SLIST_NEXT(op2, op_append) != NULL) 439 op2 = SLIST_NEXT(op2, op_append); 440 SLIST_NEXT(op2, op_append) = op;
|
/freebsd-9.3-release/contrib/gcc/ |
H A D | value-prof.c | 176 tree op1, tree op2, tree value, int prob, gcov_type count, 197 stmt2 = build2 (MODIFY_EXPR, optype, tmp1, op2); 217 build2 (TREE_CODE (operation), optype, op1, op2)); 266 tree modify, op, op1, op2, result, value, tree_val; local 285 op2 = TREE_OPERAND (op, 1); 304 if (simple_cst_equal (op2, value) != 1 || 2 * count < all) 316 result = tree_divmod_fixed_value (stmt, op, op1, op2, tree_val, prob, count, all); 339 tree_mod_pow2 (tree stmt, tree operation, tree op1, tree op2, int prob, argument 361 build2 (PLUS_EXPR, optype, op2, build_int_cst (optype, -1))); 363 build2 (BIT_AND_EXPR, optype, tmp2, op2)); 175 tree_divmod_fixed_value(tree stmt, tree operation, tree op1, tree op2, tree value, int prob, gcov_type count, gcov_type all) argument 433 tree modify, op, op1, op2, result, value; local 502 tree_mod_subtract(tree stmt, tree operation, tree op1, tree op2, int prob1, int prob2, int ncounts, gcov_type count1, gcov_type count2, gcov_type all) argument 615 tree modify, op, op1, op2, result, value; local [all...] |
H A D | tree-ssa-pre.c | 1555 tree op2 = TREE_OPERAND (expr, 1); local 1556 return set_contains_value (set, op1) && set_contains_value (set, op2); 1571 tree op2 = TREE_OPERAND (expr, 2); local 1575 || (op2 && !set_contains_value (set, op2))) 1603 tree op2 = TREE_OPERAND (expr, 2); local 1609 gcc_assert (!op2 || is_gimple_min_invariant (op2) 1610 || TREE_CODE (op2) == VALUE_HANDLE); 1611 if (op2 2223 tree op1, op2, op3; local 2329 tree op0, op2; local 2384 tree op2 = TREE_OPERAND (expr, 1); local 3204 poolify_modify_expr(tree type, tree op1, tree op2) argument [all...] |
H A D | expr.c | 1310 rtx op2; 1314 op2 = convert_to_mode (mode, size, 1); 1316 if (pred != 0 && ! (*pred) (op2, mode)) 1317 op2 = copy_to_mode_reg (mode, op2); 1324 pat = GEN_FCN ((int) code) (x, y, op2, opalign); 5974 rtx op1, op2; 6008 op2 = XEXP (value, 1); 6009 if (!CONSTANT_P (op2) && !(REG_P (op2) 1306 rtx op2; local 5958 rtx op1, op2; local 8748 rtx op2; local 8764 rtx op2; local 9280 rtx op1, op2, index; local [all...] |
H A D | simplify-rtx.c | 235 enum machine_mode op0_mode, rtx op0, rtx op1, rtx op2) 241 op0, op1, op2))) 244 return gen_rtx_fmt_eee (code, mode, op0, op1, op2); 273 rtx op0, op1, op2; 317 op2 = simplify_replace_rtx (XEXP (x, 2), old_rtx, new_rtx); 318 if (op0 == XEXP (x, 0) && op1 == XEXP (x, 1) && op2 == XEXP (x, 2)) 322 return simplify_gen_ternary (code, mode, op_mode, op0, op1, op2); 4051 rtx op2) 4065 && GET_CODE (op2) == CONST_INT 4066 && ((unsigned) INTVAL (op1) + (unsigned) INTVAL (op2) < 230 simplify_gen_ternary(enum rtx_code code, enum machine_mode mode, enum machine_mode op0_mode, rtx op0, rtx op1, rtx op2) argument 268 rtx op0, op1, op2; local 4040 simplify_ternary_operation(enum rtx_code code, enum machine_mode mode, enum machine_mode op0_mode, rtx op0, rtx op1, rtx op2) argument [all...] |
H A D | optabs.c | 512 rtx op1, rtx op2, rtx target, int unsignedp) 520 rtx xop0 = op0, xop1 = op1, xop2 = op2; 550 if (GET_MODE (op2) != mode2 && mode2 != VOIDmode) 552 GET_MODE (op2) != VOIDmode 553 ? GET_MODE (op2) 4066 enum machine_mode cmode, rtx op2, rtx op3, 4095 if (swap_commutative_operands_p (op2, op3) 4099 tem = op2; 4100 op2 = op3; 4106 mode = GET_MODE (op2); 507 expand_ternary_op(enum machine_mode mode, optab ternary_optab, rtx op0, rtx op1, rtx op2, rtx target, int unsignedp) argument 4047 emit_conditional_move(rtx target, enum rtx_code code, rtx op0, rtx op1, enum machine_mode cmode, rtx op2, rtx op3, enum machine_mode mode, int unsignedp) argument 4175 emit_conditional_add(rtx target, enum rtx_code code, rtx op0, rtx op1, enum machine_mode cmode, rtx op2, rtx op3, enum machine_mode mode, int unsignedp) argument [all...] |
H A D | tree-vectorizer.c | 1820 tree operation, op1, op2; 1874 op2 = TREE_OPERAND (operation, 1); 1875 if (TREE_CODE (op1) != SSA_NAME || TREE_CODE (op2) != SSA_NAME) 1888 || TYPE_MAIN_VARIANT (type) != TYPE_MAIN_VARIANT (TREE_TYPE (op2))) 1897 print_generic_expr (vect_dump, TREE_TYPE (op2), TDF_SLIM); 1929 def2 = SSA_NAME_DEF_STMT (op2); 1819 tree operation, op1, op2; local
|
H A D | tree.c | 1650 chainon (tree op1, tree op2) 1655 return op2; 1656 if (!op2) 1661 TREE_CHAIN (t1) = op2; 1666 for (t2 = op2; t2; t2 = TREE_CHAIN (t2)) 2356 tree op0, op1, op2, op3; 2432 op2 = SUBSTITUTE_IN_EXPR (TREE_OPERAND (exp, 2), f, r); 2435 && op2 == TREE_OPERAND (exp, 2)) 2438 new = fold_build3 (code, TREE_TYPE (exp), op0, op1, op2); 2444 op2 1644 chainon(tree op1, tree op2) argument 2340 tree op0, op1, op2, op3; local 2459 tree op0, op1, op2, op3; local [all...] |
H A D | df-problems.c | 641 bitmap op2 = df_ru_get_bb_info (dflow, e->dest->index)->in; 654 bitmap_copy (tmp, op2); 667 bitmap_ior_into (op1, op2); 1166 bitmap op2 = df_rd_get_bb_info (dflow, e->src->index)->out; 1179 bitmap_copy (tmp, op2); 1192 bitmap_ior_into (op1, op2); 1659 bitmap op2 = df_lr_get_bb_info (dflow, e->dest->index)->in; 1665 bitmap_ior_and_compl_into (op1, op2, df_invalidated_by_call); 1667 bitmap_ior_into (op1, op2); 2021 bitmap op2 639 bitmap op2 = df_ru_get_bb_info (dflow, e->dest->index)->in; local 1163 bitmap op2 = df_rd_get_bb_info (dflow, e->src->index)->out; local 1655 bitmap op2 = df_lr_get_bb_info (dflow, e->dest->index)->in; local 2016 bitmap op2 = df_ur_get_bb_info (dflow, e->src->index)->out; local 2619 bitmap op2 = df_urec_get_bb_info (dflow, e->src->index)->out; local [all...] |
H A D | tree-flow-inline.h | 1194 tree op2 = NULL_TREE; local 1214 op2 = op_iter_init_tree (&iter2, stmt2, flags); 1223 if (op1 != op2) 1226 op2 = op_iter_next_tree (&iter2);
|
H A D | tree-scalar-evolution.c | 2146 tree res, op0, op1, op2; 2358 op2 = instantiate_parameters_1 (loop, TREE_OPERAND (chrec, 2), 2360 if (op2 == chrec_dont_know) 2365 && op2 == TREE_OPERAND (chrec, 2)) 2369 TREE_TYPE (chrec), op0, op1, op2); 2141 tree res, op0, op1, op2; local
|
/freebsd-9.3-release/sys/boot/arm/at91/boot2/ |
H A D | boot2.c | 349 const u_int8_t op2[] = "ufs:ad0"; local 375 ps = memmem(addr, klen, op2, sizeof(op2) - 1); 377 p = ps + sizeof(op2) - 1;
|
/freebsd-9.3-release/sys/boot/arm/ixp425/boot2/ |
H A D | boot2.c | 439 const u_int8_t op2[] = "ufs:ad0"; local 465 ps = memmem(addr, klen, op2, sizeof(op2) - 1); 467 p = ps + sizeof(op2) - 1;
|
/freebsd-9.3-release/contrib/gdb/gdb/ |
H A D | s390-tdep.c | 951 is_ri (bfd_byte *insn, int op1, int op2, unsigned int *r1, int *i2) argument 953 if (insn[0] == op1 && (insn[1] & 0xf) == op2) 966 is_ril (bfd_byte *insn, int op1, int op2, argument 969 if (insn[0] == op1 && (insn[1] & 0xf) == op2) 1033 is_rsy (bfd_byte *insn, int op1, int op2, argument 1037 && insn[5] == op2) 1070 is_rxy (bfd_byte *insn, int op1, int op2, argument 1074 && insn[5] == op2)
|
/freebsd-9.3-release/contrib/gcc/cp/ |
H A D | cvt.c | 822 tree op2 = TREE_OPERAND (expr,2); 824 (op1, (implicit && !TREE_SIDE_EFFECTS (op2) 827 (op2, (implicit && !TREE_SIDE_EFFECTS (op1) 820 tree op2 = TREE_OPERAND (expr,2); local
|
H A D | typeck.c | 4687 build_x_conditional_expr (tree ifexp, tree op1, tree op2) 4691 tree orig_op2 = op2; 4702 || type_dependent_expression_p (op2)) 4703 return build_min_nt (COND_EXPR, ifexp, op1, op2); 4707 op2 = build_non_dependent_expr (op2); 4710 expr = build_conditional_expr (ifexp, op1, op2); 4740 build_x_compound_expr (tree op1, tree op2) 4744 tree orig_op2 = op2; 4749 || type_dependent_expression_p (op2)) 4675 build_x_conditional_expr(tree ifexp, tree op1, tree op2) argument 4727 build_x_compound_expr(tree op1, tree op2) argument [all...] |
/freebsd-9.3-release/sys/fs/nfsclient/ |
H A D | nfs_clstate.c | 2721 struct nfsclopen *op, *op2; local 2754 LIST_FOREACH(op2, &owp2->nfsow_open, nfso_list) { 2757 if (op != op2 && 2761 op->nfso_stateid.other[0] == op2->nfso_stateid.other[0] && 2762 op->nfso_stateid.other[1] == op2->nfso_stateid.other[1] && 2763 op->nfso_stateid.other[2] == op2->nfso_stateid.other[2]) { 2783 LIST_FOREACH(op2, &owp2->nfsow_open, nfso_list) { 2784 if (nfhp->nfh_len == op2->nfso_fhlen && 2785 !NFSBCMP(nfhp->nfh_fh, op2->nfso_fh, nfhp->nfh_len)) { 2788 if (op != op2 [all...] |