Searched refs:e0 (Results 1 - 25 of 33) sorted by relevance

12

/freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/decls/
H A Dtst.pointers.d38 extern int e0, *e1, **e2, ***e3, ****e4, *****e5;
/freebsd-11-stable/lib/msun/src/
H A Ds_cosl.c54 int e0; local
75 e0 = __ieee754_rem_pio2l(x, y);
79 switch (e0 & 3) {
H A Ds_sinl.c49 int e0, s; local
73 e0 = __ieee754_rem_pio2l(x, y);
77 switch (e0 & 3) {
H A Ds_tanl.c55 int e0, s; local
79 e0 = __ieee754_rem_pio2l(x, y);
83 switch (e0 & 3) {
H A De_rem_pio2f.c52 int32_t e0,n,ix,hx; local
78 e0 = (ix>>23)-150; /* e0 = ilogb(|x|)-23; */
79 SET_FLOAT_WORD(z, ix - ((int32_t)(e0<<23)));
81 n = __kernel_rem_pio2(tx,ty,e0,1,0);
H A Ds_sincosl.c53 int e0, sgn; local
84 e0 = __ieee754_rem_pio2l(x, y);
86 switch (e0 & 3) {
H A De_rem_pio2.c59 int32_t e0,i,j,nx,n,ix,hx; local
174 e0 = (ix>>20)-1046; /* e0 = ilogb(z)-23; */
175 INSERT_WORDS(z, ix - ((int32_t)(e0<<20)), low);
183 n = __kernel_rem_pio2(tx,ty,e0,nx,1);
H A Dk_rem_pio2.c18 * __kernel_rem_pio2(x,y,e0,nx,prec)
19 * double x[],y[]; int e0,nx,prec;
37 * of x[0] is given in input parameter e0 (i.e., x[0]*2^e0
41 * e0 = ilogb(z)-23
42 * z = scalbn(z,-e0)
63 * e0 The exponent of x[0]. Must be <= 16360 or you need to
96 * ( 2^e0*x[0] * ipio2[jv-1]*2^(-24jv) )/8
98 * e0-3-24*jv >= 0 or (e0
294 __kernel_rem_pio2(double *x, double *y, int e0, int nx, int prec) argument
[all...]
H A Dcatrig.c50 m_e = 2.7182818284590452e0, /* 0x15bf0a8b145769.0p-51 */
52 pio2_hi = 1.5707963267948966e0, /* 0x1921fb54442d18.0p-52 */
H A Dcatrigf.c63 m_e = 2.7182818285e0, /* 0xadf854.0p-22 */
65 pio2_hi = 1.5707962513e0, /* 0xc90fda.0p-23 */
/freebsd-11-stable/contrib/gcclibs/libgomp/
H A Diter.c66 unsigned long s0, e0; local
82 e0 = s0 + q;
83 if (e0 > n)
84 e0 = n;
87 if (s0 >= e0)
95 e = (long)e0 * ws->incr + ws->next;
99 thr->ts.static_trip = (e0 == n ? -1 : 1);
104 unsigned long n, s0, e0, i, c; local
118 e0 = s0 + c;
123 if (e0 >
[all...]
/freebsd-11-stable/sys/contrib/ngatm/netnatm/sig/
H A Dsig_verify.c396 struct uni_ierr *e1, *e0; local
412 e0 = e1 = uni->cx.err;
415 if (e0 != e1)
416 *e0 = *e1;
417 e0++;
421 uni->cx.errcnt = e0 - uni->cx.err;
430 struct uni_ierr *e1, *e0; local
432 e0 = e1 = uni->cx.err;
435 if (e0 != e1)
436 *e0
[all...]
/freebsd-11-stable/lib/libefivar/
H A Defivar.h58 #define EFI_GUID(a, b, c, d, e0, e1, e2, e3, e4, e5) \
60 { (e0), (e1), (e2), (e3), (e4), (e5) }})
62 #define EFI_GUID(a, b, c, d, e0, e1, e2, e3, e4, e5) \
64 { (e0), (e1), (e2), (e3), (e4), (e5) }})
/freebsd-11-stable/lib/msun/ld128/
H A De_rem_pio2l.h68 int e0,ex,i,j,nx; local
124 e0 = ex - BIAS - 23; /* e0 = ilogb(|x|)-23; */
125 u1.xbits.expsign = ex - e0;
134 n = __kernel_rem_pio2(tx,ty,e0,nx,3);
/freebsd-11-stable/lib/msun/ld80/
H A De_rem_pio2l.h79 int e0,ex,i,j,nx,n; local
134 e0 = ex - BIAS - 23; /* e0 = ilogb(|x|)-23; */
135 u1.xbits.expsign = ex - e0;
144 n = __kernel_rem_pio2(tx,ty,e0,nx,2);
/freebsd-11-stable/usr.bin/mkuzip/
H A Dmkuz_blockcache.c63 goto e0;
77 e0:
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_stats_timing.cpp116 if (interval * ranges[i].scale < 1.e0) {
117 interval = interval * 1000.e0 * ranges[i].scale;
/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-phiopt.c375 edge e0, edge e1, tree phi,
468 if ((e0 == true_edge && integer_onep (arg0))
469 || (e0 == false_edge && integer_zerop (arg0))
545 edge e0, edge e1, tree phi,
602 if (e0 == e)
623 edge e0, edge e1, tree phi,
668 if (true_edge == e0)
676 gcc_assert (false_edge == e0);
874 edge e0 ATTRIBUTE_UNUSED, edge e1,
374 conditional_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument
544 value_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument
622 minmax_replacement(basic_block cond_bb, basic_block middle_bb, edge e0, edge e1, tree phi, tree arg0, tree arg1) argument
H A Dtree-ssa-loop-niter.c780 tree e, te, e0, e1, e2, notcond; local
792 e0 = tree_simplify_using_condition_1 (cond, TREE_OPERAND (expr, 0));
793 if (TREE_OPERAND (expr, 0) != e0)
812 expr = fold_build3 (code, boolean_type_node, e0, e1, e2);
814 expr = fold_build2 (code, boolean_type_node, e0, e1);
825 e0 = TREE_OPERAND (cond, 0);
828 /* We know that e0 == e1. Check whether we cannot simplify expr
830 e = simplify_replace_tree (expr, e0, e1);
834 e = simplify_replace_tree (expr, e1, e0);
840 e0
959 tree e, e0, e1, e2; local
[all...]
H A Drtl-factoring.c381 match_seqs (p_hash_elem e0, p_hash_elem e1) argument
389 matching_length (e0->insn, e1->insn, &len, &cost);
396 if (!pattern_seqs || pattern_seqs->insn != e0->insn)
400 pseq->insn = e0->insn;
401 pseq->idx = e0->idx;
444 p_hash_elem e0, e1; local
498 FOR_EACH_HTAB_ELEMENT (hash_bucket->seq_candidates, e0, p_hash_elem, hti1)
501 if (e0 != e1
503 && !bitmap_bit_p (&stack_reg_live, INSN_UID (e0->insn))
507 match_seqs (e0, e
[all...]
H A Dtree-cfg.c1408 edge e0, e1; local
1412 e0 = EDGE_SUCC (bb, 0);
1414 if (e0->flags & EDGE_COMPLEX)
1417 return e0->dest;
5574 edge e0; local
5586 e0 = single_succ_edge (cond_bb);
5587 e0->flags &= ~EDGE_FALLTHRU;
5588 e0->flags |= EDGE_FALSE_VALUE;
H A Domp-low.c2771 e0 = min(s0 + q, n);
2772 if (s0 >= e0) goto L2; else goto L0;
2775 e = e0 * STEP + N1;
2787 tree l0, l1, l2, n, q, s0, e0, e, t, nthreads, threadid;
2855 e0 = get_formal_tmp_var (t, &list);
2857 t = build2 (GE_EXPR, boolean_type_node, s0, e0);
2876 t = fold_convert (type, e0);
2940 e0 = min(s0 + CHUNK, n);
2944 e = e0 * STEP + N1;
2958 tree l0, l1, l2, l3, l4, n, s0, e0,
2786 tree l0, l1, l2, n, q, s0, e0, e, t, nthreads, threadid; local
2957 tree l0, l1, l2, l3, l4, n, s0, e0, e, t; local
[all...]
/freebsd-11-stable/lib/libiconv_modules/HZ/
H A Dcitrus_hz.c120 escape_list e0; member in struct:__anon6797
126 #define E0SET(ei) (&(ei)->e0)
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl_report.cpp614 uptr e0 = a0 + Shadow(thr->racy_state[0]).size(); local
617 addr_max = max(e0, e1);
/freebsd-11-stable/contrib/gdtoa/
H A Dmisc.c839 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,

Completed in 333 milliseconds

12