/freebsd-current/bin/cp/ |
H A D | cp.c | 79 enum op { FILE_TO_FILE, FILE_TO_DIR, DIR_TO_DNE }; enum 81 static int copy(char *[], enum op, int, struct stat *); 88 enum op type; 264 copy(char *argv[], enum op type, int fts_options, struct stat *root_stat)
|
/freebsd-current/bin/dd/ |
H A D | args.c | 414 struct oflag *op, tmp; local 418 op = bsearch(&tmp, olist, nitems(olist), sizeof(struct oflag), 420 if (op == NULL) 422 ddflags |= op->set;
|
/freebsd-current/bin/setfacl/ |
H A D | setfacl.c | 53 uint op; member in struct:sf_entry 240 switch (entry->op) { 379 entry->op = OP_MERGE_ACL; 391 entry->op = OP_REMOVE_ACL; 412 entry->op = OP_ADD_ACL; 417 entry->op = OP_REMOVE_EXT; 428 entry->op = OP_REMOVE_DEF; 436 entry->op = OP_MERGE_ACL; 451 entry->op = OP_REMOVE_BY_NUMBER; 456 entry->op [all...] |
/freebsd-current/bin/sh/ |
H A D | arith_yacc.c | 62 #define ARITH_PRECEDENCE(op, prec) [op - ARITH_BINOP_MIN] = prec 111 static inline int arith_prec(int op) argument 113 return prec[op - ARITH_BINOP_MIN]; 121 static arith_t do_binop(int op, arith_t a, arith_t b) argument 124 switch (op) { 132 return op == ARITH_REM ? a % b : a / b; 166 static arith_t primary(int token, union yystype *val, int op, int noeval) argument 173 result = assignment(op, noeval); 179 last_token = op; 203 binop2(arith_t a, int op, int precedence, int noeval) argument 233 binop(int token, union yystype *val, int op, int noeval) argument 244 and(int token, union yystype *val, int op, int noeval) argument 261 or(int token, union yystype *val, int op, int noeval) argument 278 cond(int token, union yystype *val, int op, int noeval) argument 303 int op = yylex(); local [all...] |
H A D | jobs.c | 1356 cmdtxtredir(union node *n, const char *op, int deffd) argument 1365 cmdputs(op);
|
/freebsd-current/bin/test/ |
H A D | test.c | 230 syntax(const char *op, const char *msg) argument 233 if (op && *op) 234 error("%s: %s", op, msg); 322 const char *opnd1, *op, *opnd2; local 325 op = nargc > 0 ? (--nargc, *++t_wp) : NULL; 328 syntax(op, "argument expected"); 417 find_op_1char(const struct t_op *op, const struct t_op *end, const char *s) argument 422 while (op != end) { 423 if (c == *op 431 find_op_2char(const struct t_op *op, const struct t_op *end, const char *s) argument [all...] |
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/ |
H A D | Getopt.java | 191 int op; // index into opt 211 op = 0; 214 op < ol) { 215 oc = opt.charAt(op++); 220 if (match && ip < il && ic == ')' && (op >= ol || 221 opt.charAt(op) == '=')) { 222 if (op < ol && opt.charAt(op) == '=') { 224 longoptarg.set(opt.substring(op + 1));
|
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/nfs/ |
H A D | tst.call.d | 50 nfsv4:::op-putrootfh-start 55 nfsv4:::op-putrootfh-done
|
H A D | tst.call3.d | 46 nfsv3:::op-getattr-start 59 nfsv3:::op-getattr-done 77 printf("%d ops seen, latest op is %s\n", numberseen, probename);
|
/freebsd-current/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_as.c | 325 uint_t op = DIF_INSTR_OP(instr); local 327 if (op == DIF_OP_CALL) { 334 if (op >= DIF_OP_BA && op <= DIF_OP_BLEU) { 336 dp->dtdo_buf[i] = DIF_INSTR_BRANCH(op,
|
H A D | dt_cg.c | 189 uint_t op, int dreg) 217 instr = DIF_INSTR_FMT(op, dreg, sreg, dreg); 556 uint_t op; local 566 op = DIF_OP_PUSHTR; 574 op = DIF_OP_PUSHTV; 578 instr = DIF_INSTR_PUSHTS(op, t.dtdt_kind, reg, dnp->dn_reg); 592 dt_regset_t *drp, uint_t op) 615 instr = DIF_INSTR_FMT(op, dnp->dn_left->dn_reg, 640 dt_cg_prearith_op(dt_node_t *dnp, dt_irlist_t *dlp, dt_regset_t *drp, uint_t op) argument 660 instr = DIF_INSTR_FMT(op, dn 188 dt_cg_ptrsize(dt_node_t *dnp, dt_irlist_t *dlp, dt_regset_t *drp, uint_t op, int dreg) argument 591 dt_cg_arithmetic_op(dt_node_t *dnp, dt_irlist_t *dlp, dt_regset_t *drp, uint_t op) argument 696 dt_cg_postarith_op(dt_node_t *dnp, dt_irlist_t *dlp, dt_regset_t *drp, uint_t op) argument 777 dt_cg_compare_op(dt_node_t *dnp, dt_irlist_t *dlp, dt_regset_t *drp, uint_t op) argument 1155 uint_t op; local 1232 uint_t op; local 1523 uint_t op; local [all...] |
H A D | dt_dis.c | 433 const struct opent *op; local 450 op = &optab[opcode]; 452 op->op_func(dp, op->op_name, instr, fp);
|
H A D | dt_grammar.y | 34 #define OP1(op, c) dt_node_op1(op, c) 35 #define OP2(op, l, r) dt_node_op2(op, l, r)
|
H A D | dt_link.c | 849 * are to be converted into a no-op whereas jumps should become a 956 #define DT_OP_IS_AUIPC(op) (((op) & 0x7f) == 0x17) 957 #define DT_OP_IS_JALR(op) (((op) & 0x707f) == 0x67) 1010 * is-enabled probes. Calls are to be converted into a no-op whereas
|
H A D | dt_options.c | 1095 const dt_option_t *op; local 1104 for (op = _dtrace_rtoptions; op->o_name != NULL; op++) { 1105 if (strcmp(op->o_name, opt) == 0) { 1106 *val = dtp->dt_options[op->o_option]; 1111 for (op = _dtrace_drtoptions; op->o_name != NULL; op++) { 1112 if (strcmp(op 1124 const dt_option_t *op; local [all...] |
H A D | dt_parser.c | 128 opstr(int op) argument 130 switch (op) { 1843 dt_node_op1(int op, dt_node_t *cp) argument 1848 switch (op) { 1877 if (op == DT_TOK_SIZEOF && 1899 assert(op <= USHRT_MAX); 1900 dnp->dn_op = (ushort_t)op; 1939 dt_node_op2(int op, dt_node_t *lp, dt_node_t *rp) argument 1949 (op == DT_TOK_MOD || op 3153 int op = dnp->dn_op; local 3179 int op = dnp->dn_op; local [all...] |
/freebsd-current/contrib/arm-optimized-routines/math/test/ |
H A D | mathtest.c | 684 int do_op(char* q, unsigned* op, const char* name, int num, int sop_type) { argument 689 op[i] = 0; 695 op[0] = sop->op1; 696 op[1] = sop->op2; 699 case 1: n = sscanf(q, "%x", &op[0]); break; 700 case 2: n = sscanf(q, "%x.%x", &op[0], &op[1]); break; 701 case 3: n = sscanf(q, "%x.%x.%x", &op[0], &op[1], &op[ [all...] |
H A D | ulp.c | 455 #define reduce_f1(a, f, op) (f (a.x)) 456 #define reduce_f2(a, f, op) (f (a.x) op f (a.x2)) 457 #define reduce_d1(a, f, op) (f (a.x)) 458 #define reduce_d2(a, f, op) (f (a.x) op f (a.x2))
|
/freebsd-current/contrib/arm-optimized-routines/math/test/rtest/ |
H A D | dotest.c | 446 int op; local 447 for (op = 0; op < wrapper_get_nops(ctx); op++) { 448 int size = wrapper_get_size(ctx, op); 450 if (!wrapper_is_complex(ctx, op) && 451 is_snan(wrapper_get_ieee(ctx, op), size)) {
|
H A D | wrappers.c | 78 mpfr_srcptr wrapper_get_mpfr(wrapperctx *ctx, int op) argument 80 if (op < 0) { 84 assert(ctx->mpfr_ops[op]); 85 return ctx->mpfr_ops[op]; 89 const uint32 *wrapper_get_ieee(wrapperctx *ctx, int op) argument 91 if (op < 0) { 95 assert(ctx->mpfr_ops[op]); 96 return ctx->ieee_ops[op]; 105 int wrapper_get_size(wrapperctx *ctx, int op) argument 107 if (op < 116 wrapper_is_complex(wrapperctx *ctx, int op) argument 127 wrapper_get_mpc(wrapperctx *ctx, int op) argument 138 wrapper_get_mpfr_r(wrapperctx *ctx, int op) argument 149 wrapper_get_mpfr_i(wrapperctx *ctx, int op) argument 160 wrapper_get_ieee_r(wrapperctx *ctx, int op) argument 171 wrapper_get_ieee_i(wrapperctx *ctx, int op) argument [all...] |
H A D | wrappers.h | 70 * Functions for wrappers to call. 'op' indicates which operand is 75 mpfr_srcptr wrapper_get_mpfr(wrapperctx *ctx, int op); 76 const uint32 *wrapper_get_ieee(wrapperctx *ctx, int op); 78 mpc_srcptr wrapper_get_mpc(wrapperctx *ctx, int op); 79 mpfr_srcptr wrapper_get_mpfr_r(wrapperctx *ctx, int op); 80 mpfr_srcptr wrapper_get_mpfr_i(wrapperctx *ctx, int op); 81 const uint32 *wrapper_get_ieee_r(wrapperctx *ctx, int op); 82 const uint32 *wrapper_get_ieee_i(wrapperctx *ctx, int op); 86 int wrapper_get_size(wrapperctx *ctx, int op); 87 int wrapper_is_complex(wrapperctx *ctx, int op); [all...] |
/freebsd-current/contrib/bc/include/ |
H A D | bc.h | 240 * Returns non-zero if operator @a op is left associative, zero otherwise. 241 * @param op The operator to test for associativity. 244 #define BC_PARSE_OP_LEFT(op) (BC_PARSE_OP_DATA(op) & BC_LEX_CHAR_MSB(1)) 247 * Returns the precedence of operator @a op. Lower number means higher 249 * @param op The operator to return the precedence of. 250 * @return The precedence of @a op. 252 #define BC_PARSE_OP_PREC(op) (BC_PARSE_OP_DATA(op) & ~(BC_LEX_CHAR_MSB(1)))
|
/freebsd-current/contrib/bc/src/ |
H A D | library.c | 884 * @param op The operation. 891 bcl_binary(BclNumber a, BclNumber b, const BcNumBinaryOp op, argument 924 op(BCL_NUM_NUM(aptr), BCL_NUM_NUM(bptr), BCL_NUM_NUM_NP(c), ctxt->scale);
|
H A D | num.c | 1268 * @param op The function to call, either bc_num_addArrays() or 1273 BcNumShiftAddOp op) 1277 op(n->num + shift, a->num, a->len); 1290 BcNumShiftAddOp op; local 1406 op = (BC_NUM_NEG_NP(m1) != BC_NUM_NEG_NP(m2)) ? 1409 bc_num_shiftAddSub(c, &z1, max2, op); 2231 bc_num_binary(BcNum* a, BcNum* b, BcNum* c, size_t scale, BcNumBinOp op, argument 2241 assert(a != NULL && b != NULL && c != NULL && op != NULL); 2280 op(ptr_a, ptr_b, c, scale); 1272 bc_num_shiftAddSub(BcNum* restrict n, const BcNum* restrict a, size_t shift, BcNumShiftAddOp op) argument
|
/freebsd-current/contrib/bearssl/T0/ |
H A D | T0Comp.cs | 1415 Opcode op = cpu.ipBuf[cpu.ipOff ++]; 1416 op.Run(cpu);
|