Searched refs:exp (Results 26 - 50 of 575) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/netbsd-tests/lib/libc/stdlib/
H A Dt_atexit.sh38 cat >exp <<EOF
47 diff -Nru exp out \
/freebsd-11-stable/lib/libc/powerpc/
H A D_fpmath.h35 unsigned int exp :11; member in struct:IEEEl2bits::__anon6691
39 unsigned int exp :11;
/freebsd-11-stable/lib/libc/powerpc64/
H A D_fpmath.h35 unsigned int exp :11; member in struct:IEEEl2bits::__anon6698
39 unsigned int exp :11;
/freebsd-11-stable/lib/libc/mips/
H A D_fpmath.h35 unsigned int exp :11; member in struct:IEEEl2bits::__anon6672
39 unsigned int exp :11;
/freebsd-11-stable/tools/regression/zfs/zpool/add/
H A Doption-n.t13 exp=`(
19 expect "${exp}" ${ZPOOL} add -n ${name0} ${disk1}
20 exp=`(
30 expect "${exp}" ${ZPOOL} status ${name0}
/freebsd-11-stable/tools/regression/zfs/zpool/replace/
H A Dcache.t13 exp=`(
25 expect "${exp}" ${ZPOOL} status ${name0}
27 exp=`(
39 expect "${exp}" ${ZPOOL} status ${name0}
H A Dspare.t13 exp=`(
25 expect "${exp}" ${ZPOOL} status ${name0}
27 exp=`(
39 expect "${exp}" ${ZPOOL} status ${name0}
/freebsd-11-stable/contrib/gcc/config/s390/
H A Dfixdfdi.h58 register int exp; local
69 exp = EXPD (dl1) - EXPONENT_BIAS - MANTISSA_BITS;
74 if (exp <= -PRECISION)
83 if (exp >= -HIGH_LL_FRAC_BITS)
86 exp += HIGH_LL_FRAC_BITS + 1;
91 return l >> -exp;
131 register int exp; local
142 exp = EXPD (dl1) - EXPONENT_BIAS - MANTISSA_BITS;
146 if (exp <= -PRECISION)
155 if (exp >
203 register int exp; local
235 l <<= exp; local
275 register int exp; local
310 l <<= exp; local
347 register int exp; local
378 l <<= exp; local
415 register int exp; local
449 l <<= exp; local
[all...]
/freebsd-11-stable/contrib/gdb/gdb/
H A Dc-exp.y155 %type <voidval> exp exp1 type_exp start variable qualified_name lcurly
245 exp1 : exp
246 | exp1 ',' exp
251 exp : '*' exp %prec UNARY
255 exp : '&' exp %prec UNARY
259 exp : '-' exp %prec UNARY
263 exp
250 exp : '*' exp %prec UNARY label
254 exp : '&' exp %prec UNARY label
258 exp : '-' exp %prec UNARY label
262 exp : '!' exp %prec UNARY label
266 exp : '~' exp %prec UNARY label
270 exp : INCREMENT exp %prec UNARY label
274 exp : DECREMENT exp %prec UNARY label
278 exp : exp INCREMENT %prec UNARY label
282 exp : exp DECREMENT %prec UNARY label
286 exp : SIZEOF exp %prec UNARY label
290 exp : exp ARROW name label
296 exp : exp ARROW qualified_name label
304 exp : exp ARROW '*' exp label
308 exp : exp '.' name label
314 exp : exp '.' qualified_name label
322 exp : exp '.' '*' exp label
326 exp : exp '[' exp1 ']' label
330 exp : exp '(' label
358 exp : lcurly arglist rcurly %prec ARROW label
365 exp : lcurly type rcurly exp %prec UNARY label
371 exp : '(' type ')' exp %prec UNARY label
377 exp : '(' exp1 ')' label
383 exp : exp '@' exp label
387 exp : exp '*' exp label
391 exp : exp '/' exp label
395 exp : exp '%' exp label
399 exp : exp '+' exp label
403 exp : exp '-' exp label
407 exp : exp LSH exp label
411 exp : exp RSH exp label
415 exp : exp EQUAL exp label
419 exp : exp NOTEQUAL exp label
423 exp : exp LEQ exp label
427 exp : exp GEQ exp label
431 exp : exp '<' exp label
435 exp : exp '>' exp label
439 exp : exp '&' exp label
443 exp : exp '^' exp label
447 exp : exp '|' exp label
451 exp : exp ANDAND exp label
455 exp : exp OROR exp label
459 exp : exp '?' exp ':' exp %prec '?' label
463 exp : exp '=' exp label
467 exp : exp ASSIGN_MODIFY exp label
473 exp : INT label
480 exp : NAME_OR_INT label
491 exp : FLOAT label
498 exp : variable label
501 exp : VARIABLE label
505 exp : SIZEOF '(' type ')' %prec UNARY label
513 exp : STRING label
538 exp : TRUEKEYWORD label
545 exp : FALSEKEYWORD label
[all...]
/freebsd-11-stable/contrib/gcc/cp/
H A Dexcept.c126 tree exp; local
132 exp = build_java_class_ref (TREE_TYPE (type));
134 exp = get_tinfo_decl (type);
136 return exp;
145 tree exp = eh_type_info (type); local
147 if (!exp)
150 mark_used (exp);
152 return convert (ptr_type_node, build_address (exp));
355 initialize_handler_parm (tree decl, tree exp) argument
378 exp
407 tree exp; local
573 tree exp = *tp; local
599 build_throw(tree exp) argument
[all...]
/freebsd-11-stable/usr.sbin/pmcstudy/
H A Deval_expr.c45 printf("Out of memory in exp allocation\n");
67 validate_expr(struct expression *exp, int val1_is_set, int op_is_set, int val2_is_set, argument
83 if (exp == NULL) {
91 switch(exp->type) {
111 if (exp->next == NULL) {
115 if ((exp->next->type == TYPE_OP_PLUS) ||
116 (exp->next->type == TYPE_OP_MINUS) ||
117 (exp->next->type == TYPE_OP_DIVIDE) ||
118 (exp->next->type == TYPE_OP_MULT)) {
133 if (validate_expr(exp
172 print_exp(struct expression *exp) argument
353 set_math_precidence(struct expression **beg, struct expression *exp, struct expression **stopped) argument
429 struct expression *exp=NULL, *last=NULL, *at; local
548 gather_exp_to_paren_close(struct expression *exp, double *val_fill) argument
572 run_expr(struct expression *exp, int initial_call, struct expression **lastone) argument
673 calc_expr(struct expression *exp) argument
706 struct expression *exp; local
[all...]
/freebsd-11-stable/contrib/gdtoa/
H A Dstrtord.c36 ULtod(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
38 ULtod(ULong *L, ULong *bits, Long exp, int k)
55 L[_0] = (bits[1] & ~0x100000) | ((exp + 0x3ff + 52) << 20);
82 Long exp; local
91 k = strtodg_l(s, sp, fpi, &exp, bits, locale);
92 ULtod((ULong*)d, bits, exp, k);
H A Dstrtorf.c36 ULtof(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
38 ULtof(ULong *L, ULong *bits, Long exp, int k)
49 L[0] = (bits[0] & 0x7fffff) | ((exp + 0x7f + 23) << 23);
77 Long exp; local
86 k = strtodg(s, sp, fpi, &exp, bits);
87 ULtof((ULong*)f, bits, exp, k);
H A DstrtorxL.c52 ULtoxL(L, bits, exp, k) ULong *L; ULong *bits; Long exp; int k;
54 ULtoxL(ULong *L, ULong *bits, Long exp, int k)
66 L[_0] = (exp + 0x3fff + 63) << 16;
96 Long exp; local
105 k = strtodg(s, sp, fpi, &exp, bits);
106 ULtoxL((ULong*)L, bits, exp, k);
H A DstrtoIQ.c42 Long exp[2]; local
49 k = strtoIg(s, sp, &fpi, exp, B, rv);
50 ULtoQ(L, B[0]->x, exp[0], rv[0]);
53 ULtoQ(M, B[1]->x, exp[1], rv[1]);
H A DstrtoId.c42 Long exp[2]; local
48 k = strtoIg(s, sp, &fpi, exp, B, rv);
49 ULtod((ULong*)f0, B[0]->x, exp[0], rv[0]);
52 ULtod((ULong*)f1, B[1]->x, exp[1], rv[1]);
H A DstrtoIdd.c46 Long exp[2]; local
52 k = strtoIg(s, sp, &fpi, exp, B, rv);
53 ULtodd((ULong*)f0, B[0]->x, exp[0], rv[0]);
56 ULtodd((ULong*)f1, B[1]->x, exp[1], rv[1]);
/freebsd-11-stable/lib/libc/gen/
H A Dfpclassify.c45 if (u.bits.exp == 0) {
50 if (u.bits.exp == 255) {
64 if (u.bits.exp == 0) {
69 if (u.bits.exp == 2047) {
83 if (u.bits.exp == 0) {
90 if (u.bits.exp == 2047) {
96 if (u.bits.exp == 32767) {
/freebsd-11-stable/contrib/gcc/
H A Dgenattrtab.c714 check_attr_test (rtx exp, int is_const, int lineno) argument
721 switch (GET_CODE (exp))
725 if (XSTR (exp, 1)[0] == '!')
727 attr_eq (XSTR (exp, 0),
728 &XSTR (exp, 1)[1])),
731 else if (n_comma_elts (XSTR (exp, 1)) == 1)
733 attr = find_attr (&XSTR (exp, 0), 0);
736 if (! strcmp (XSTR (exp, 0), "alternative"))
737 return mk_attr_alt (1 << atoi (XSTR (exp, 1)));
739 fatal ("unknown attribute `%s' in EQ_ATTR", XSTR (exp,
867 check_attr_value(rtx exp, struct attr_desc *attr) argument
1036 convert_set_attr_alternative(rtx exp, struct insn_def *id) argument
1073 convert_set_attr(rtx exp, struct insn_def *id) argument
1168 make_canonical(struct attr_desc *attr, rtx exp) argument
1243 copy_boolean(rtx exp) argument
1449 substitute_address(rtx exp, rtx (*no_address_fn) (rtx), rtx (*address_fn) (rtx)) argument
1576 identity_fn(rtx exp) argument
1594 max_fn(rtx exp) argument
1601 min_fn(rtx exp) argument
1643 simplify_cond(rtx exp, int insn_code, int insn_index) argument
1804 insert_right_side(enum rtx_code code, rtx exp, rtx term, int insn_code, int insn_index) argument
1866 compute_alternative_mask(rtx exp, enum rtx_code code) argument
1919 evaluate_eq_attr(rtx exp, rtx value, int insn_code, int insn_index) argument
2037 simplify_and_tree(rtx exp, rtx *pterm, int insn_code, int insn_index) argument
2167 simplify_or_tree(rtx exp, rtx *pterm, int insn_code, int insn_index) argument
2287 simplify_test_exp_in_temp(rtx exp, int insn_code, int insn_index) argument
2445 simplify_test_exp(rtx exp, int insn_code, int insn_index) argument
2903 gen_attr(rtx exp, int lineno) argument
2971 count_alternatives(rtx exp) argument
3008 compares_alternatives_p(rtx exp) argument
3039 contained_in_p(rtx inner, rtx exp) argument
3070 gen_insn(rtx exp, int lineno) argument
3155 write_test_expr(rtx exp, int flags) argument
3446 max_attr_value(rtx exp, int *unknownp) argument
3487 min_attr_value(rtx exp, int *unknownp) argument
3529 or_attr_value(rtx exp, int *unknownp) argument
3571 walk_attr_value(rtx exp) argument
3698 eliminate_known_true(rtx known_true, rtx exp, int insn_code, int insn_index) argument
4268 rtx exp; local
[all...]
H A Dgenpreds.c38 validate_exp (rtx exp, const char *name, int lineno) argument
40 if (exp == 0)
46 switch (GET_CODE (exp))
50 if (validate_exp (XEXP (exp, 2), name, lineno))
55 if (validate_exp (XEXP (exp, 1), name, lineno))
59 return validate_exp (XEXP (exp, 0), name, lineno);
65 for (p = XSTR (exp, 1); *p; p++)
70 "string '%s'", name, XSTR (exp, 1));
86 name, GET_RTX_NAME (GET_CODE (exp)));
111 pred->exp
197 needs_variable(rtx exp, const char *var) argument
260 mark_mode_tests(rtx exp) argument
322 generate_switch_p(rtx exp) argument
485 write_predicate_expr(rtx exp) argument
544 write_match_code_switch(rtx exp) argument
571 write_predicate_stmts(rtx exp) argument
669 rtx exp; /* for other constraints */ member in struct:constraint_data
747 add_constraint(const char *name, const char *regclass, rtx exp, bool is_memory, bool is_address, int lineno) argument
[all...]
H A Ddojump.c100 jumpifnot (tree exp, rtx label)
102 do_jump (exp, label, NULL_RTX);
108 jumpif (tree exp, rtx label)
110 do_jump (exp, NULL_RTX, label);
162 do_jump (tree exp, rtx if_false_label, rtx if_true_label)
164 enum tree_code code = TREE_CODE (exp);
177 temp = integer_zerop (exp) ? if_false_label : if_true_label;
192 if (TREE_CODE (TREE_OPERAND (exp, 0)) == COMPONENT_REF
193 || TREE_CODE (TREE_OPERAND (exp, 0)) == BIT_FIELD_REF
194 || TREE_CODE (TREE_OPERAND (exp,
99 jumpifnot(tree exp, rtx label) argument
107 jumpif(tree exp, rtx label) argument
161 do_jump(tree exp, rtx if_false_label, rtx if_true_label) argument
670 do_jump_by_parts_greater(tree exp, int swap, rtx if_false_label, rtx if_true_label) argument
775 do_jump_by_parts_equality(tree exp, rtx if_false_label, rtx if_true_label) argument
985 do_compare_and_jump(tree exp, enum rtx_code signed_code, enum rtx_code unsigned_code, rtx if_false_label, rtx if_true_label) argument
[all...]
/freebsd-11-stable/lib/msun/src/
H A De_sqrtl.c45 u.bits.exp++;
61 u.bits.exp--;
88 if (u.bits.exp == LDBL_MAX_EXP * 2 - 1)
92 if ((u.bits.manh | u.bits.manl | u.bits.exp) == 0)
101 if (u.bits.exp == 0) {
112 if ((u.bits.exp - 0x3ffe) & 1) { /* n is odd. */
113 k += u.bits.exp - 0x3fff; /* 2k = n - 1. */
114 u.bits.exp = 0x3fff; /* u.e in [1,2). */
116 k += u.bits.exp - 0x4000; /* 2k = n - 2. */
117 u.bits.exp
[all...]
/freebsd-11-stable/tools/regression/zfs/zpool/offline/
H A Doption-t.t14 exp=`(
31 expect "${exp}" ${ZPOOL} status ${name0}
34 exp=`(
51 expect "${exp}" ${ZPOOL} status ${name0}
58 exp=`(
75 expect "${exp}" ${ZPOOL} status ${name0}
78 exp=`(
89 expect "${exp}" ${ZPOOL} status ${name0} \| grep -v 'scrub:'
96 exp=`(
114 expect "${exp}"
[all...]
H A Draidz1.t14 exp=`(
31 expect "${exp}" ${ZPOOL} status ${name0}
37 exp=`(
54 expect "${exp}" ${ZPOOL} status ${name0}
61 exp=`(
78 expect "${exp}" ${ZPOOL} status ${name0}
84 exp=`(
107 exp=`(
127 expect "${exp}" ${ZPOOL} status ${name0}
133 exp
[all...]
/freebsd-11-stable/contrib/nvi/ex/
H A Dex_argv.c49 EX_PRIVATE *exp; local
51 exp = EXP(sp);
52 exp->argsoff = 0;
55 excp->argv = exp->args;
56 excp->argc = exp->argsoff;
69 EX_PRIVATE *exp; local
71 exp = EXP(sp);
73 MEMCPY(exp->args[exp->argsoff]->bp, cmd, cmdlen);
74 exp
92 EX_PRIVATE *exp; local
217 EX_PRIVATE *exp; local
285 EX_PRIVATE *exp; local
318 EX_PRIVATE *exp; local
363 EX_PRIVATE *exp; local
464 EX_PRIVATE *exp; local
528 EX_PRIVATE *exp; local
560 EX_PRIVATE *exp; local
[all...]

Completed in 167 milliseconds

1234567891011>>