Searched refs:tn (Results 1 - 25 of 42) sorted by relevance

12

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/
H A Dpr28230.c4 void foo( unsigned long long bb, unsigned short tn, unsigned e, unsigned* w );
5 void foo( unsigned long long bb, unsigned short tn, unsigned e, unsigned* w ) argument
7 unsigned n = tn + bb;
/haiku-buildtools/gcc/libcilkrts/include/cilk/
H A Dreducer_opmul.h330 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
336 #define CILK_C_REDUCER_OPMUL_TYPE(tn) \
337 __CILKRTS_MKIDENT(cilk_c_reducer_opmul_,tn)
347 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
350 * assigned to the numeric type represented by @a tn.)
355 #define CILK_C_REDUCER_OPMUL(obj,tn,v) \
356 CILK_C_REDUCER_OPMUL_TYPE(tn) obj = \
358 __CILKRTS_MKIDENT(cilk_c_reducer_opmul_reduce_,tn), \
359 __CILKRTS_MKIDENT(cilk_c_reducer_opmul_identity_,tn), \
371 * @param tn Th
[all...]
H A Dreducer_opand.h495 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
501 #define CILK_C_REDUCER_OPAND_TYPE(tn) \
502 __CILKRTS_MKIDENT(cilk_c_reducer_opand_,tn)
512 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
515 * assigned to the numeric type represented by @a tn.)
520 #define CILK_C_REDUCER_OPAND(obj,tn,v) \
521 CILK_C_REDUCER_OPAND_TYPE(tn) obj = \
523 __CILKRTS_MKIDENT(cilk_c_reducer_opand_reduce_,tn), \
524 __CILKRTS_MKIDENT(cilk_c_reducer_opand_identity_,tn), \
536 * @param tn Th
[all...]
H A Dreducer_opor.h489 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
495 #define CILK_C_REDUCER_OPOR_TYPE(tn) \
496 __CILKRTS_MKIDENT(cilk_c_reducer_opor_,tn)
506 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
509 * assigned to the numeric type represented by @a tn.)
514 #define CILK_C_REDUCER_OPOR(obj,tn,v) \
515 CILK_C_REDUCER_OPOR_TYPE(tn) obj = \
517 __CILKRTS_MKIDENT(cilk_c_reducer_opor_reduce_,tn), \
518 __CILKRTS_MKIDENT(cilk_c_reducer_opor_identity_,tn), \
530 * @param tn Th
[all...]
H A Dreducer_opxor.h489 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
495 #define CILK_C_REDUCER_OPXOR_TYPE(tn) \
496 __CILKRTS_MKIDENT(cilk_c_reducer_opxor_,tn)
506 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
509 * assigned to the numeric type represented by @a tn.)
514 #define CILK_C_REDUCER_OPXOR(obj,tn,v) \
515 CILK_C_REDUCER_OPXOR_TYPE(tn) obj = \
517 __CILKRTS_MKIDENT(cilk_c_reducer_opxor_reduce_,tn), \
518 __CILKRTS_MKIDENT(cilk_c_reducer_opxor_identity_,tn), \
530 * @param tn Th
[all...]
H A Dreducer_opadd.h578 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
584 #define CILK_C_REDUCER_OPADD_TYPE(tn) \
585 __CILKRTS_MKIDENT(cilk_c_reducer_opadd_,tn)
595 * @param tn The @ref reducers_c_type_names "numeric type name" specifying
598 * assigned to the numeric type represented by @a tn.)
603 #define CILK_C_REDUCER_OPADD(obj,tn,v) \
604 CILK_C_REDUCER_OPADD_TYPE(tn) obj = \
606 __CILKRTS_MKIDENT(cilk_c_reducer_opadd_reduce_,tn), \
607 __CILKRTS_MKIDENT(cilk_c_reducer_opadd_identity_,tn), \
619 * @param tn Th
[all...]
H A Dreducer_min_max.h3053 * @param tn The @ref reducers_c_type_names "numeric type name" specifying the type of the
3058 #define CILK_C_REDUCER_MAX_TYPE(tn) \
3059 __CILKRTS_MKIDENT(cilk_c_reducer_max_,tn)
3069 * @param tn The @ref reducers_c_type_names "numeric type name" specifying the type of the
3072 * numeric type represented by @a tn.)
3076 #define CILK_C_REDUCER_MAX(obj,tn,v) \
3077 CILK_C_REDUCER_MAX_TYPE(tn) obj = \
3079 __CILKRTS_MKIDENT(cilk_c_reducer_max_reduce_,tn), \
3080 __CILKRTS_MKIDENT(cilk_c_reducer_max_identity_,tn), \
3109 * @param tn Th
[all...]
/haiku-buildtools/gcc/gmp/mpn/generic/
H A Dmu_bdiv_qr.c68 mp_size_t tn, wn; local
85 #define scratch_out (scratch + in + tn)/* mulmod_bnm1_itch(next_size(dn)) */
113 tn = mpn_mulmod_bnm1_next_size (dn);
114 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
115 wn = dn + in - tn; /* number of wrapped limbs */
118 c0 = mpn_sub_n (tp + tn, tp, rp, wn);
148 tn = mpn_mulmod_bnm1_next_size (dn);
149 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, qn, scratch_out);
150 wn = dn + qn - tn; /* number of wrapped limbs */
153 c0 = mpn_sub_n (tp + tn, t
240 mp_size_t qn, in, tn, itch_binvert, itch_out, itches; local
[all...]
H A Dmu_bdiv_q.c67 mp_size_t tn, wn; local
84 #define scratch_out (scratch + in + dn + tn) /* mulmod_bnm1_itch(next_size(dn)) */
113 tn = mpn_mulmod_bnm1_next_size (dn);
114 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
115 wn = dn + in - tn; /* number of wrapped limbs */
118 c0 = mpn_sub_n (tp + tn, tp, rp, wn);
149 tn = mpn_mulmod_bnm1_next_size (dn);
150 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
151 wn = dn + in - tn; /* number of wrapped limbs */
154 c0 = mpn_sub_n (tp + tn, t
220 mp_size_t qn, in, tn, itch_binvert, itch_out, itches; local
[all...]
H A Dtrialdiv.c68 mpn_trialdiv (mp_srcptr tp, mp_size_t tn, mp_size_t nprimes, int *where) argument
76 ASSERT (tn >= 1);
84 if (tn < 4)
85 r = mpn_mod_1 (tp, tn, ppp); /* FIXME */
88 r = mpn_mod_1s_4p (tp, tn, ppp << cps[1], cps);
H A Dsqrtrem.c264 mp_size_t rn, tn; local
292 tn = (nn + 1) / 2; /* 2*tn is the smallest even integer >= nn */
297 tp = TMP_ALLOC_LIMBS (2 * tn);
298 tp[0] = 0; /* needed only when 2*tn > nn, but saves a test */
300 mpn_lshift (tp + 2 * tn - nn, np, nn, 2 * c);
302 MPN_COPY (tp + 2 * tn - nn, np, nn);
303 rl = mpn_dc_sqrtrem (sp, tp, tn);
304 /* We have 2^(2k)*N = S^2 + R where k = c + (2tn-nn)*GMP_NUMB_BITS/2,
308 rl += mpn_addmul_1 (tp, sp, tn,
[all...]
H A Dmu_divappr_q.c161 mp_size_t tn, wn; local
165 #define scratch_out (scratch + dn + tn)
209 tn = mpn_mulmod_bnm1_next_size (dn + 1);
210 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
211 wn = dn + in - tn; /* number of wrapped limbs */
215 cy = mpn_sub_1 (tp + wn, tp + wn, tn - wn, cy);
216 cx = mpn_cmp (rp + dn - in, tp + dn, tn - dn) < 0;
H A Dmu_div_qr.c236 mp_size_t tn, wn; local
239 #define scratch_out (scratch + tn)
281 tn = mpn_mulmod_bnm1_next_size (dn + 1);
282 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
283 wn = dn + in - tn; /* number of wrapped limbs */
287 cy = mpn_sub_1 (tp + wn, tp + wn, tn - wn, cy);
288 cx = mpn_cmp (rp + dn - in, tp + dn, tn - dn) < 0;
/haiku-buildtools/gcc/gmp/mpz/
H A Dpowm_ui.c46 mp_size_t xn, tn, mn, bn; local
130 tn = 2 * xn; tn -= tp[tn - 1] == 0;
131 if (tn < mn)
133 MPN_COPY (xp, tp, tn);
134 xn = tn;
138 mpn_tdiv_qr (qp, xp, 0L, tp, tn, mp, mn);
145 tn = xn + bn; tn
[all...]
/haiku-buildtools/gcc/gmp/
H A Drandlc2x.c66 mp_size_t tn, seedn, an; local
90 tn = BITS_TO_LIMBS (m2exp);
91 if (ta <= tn) /* that is, if (ta < tn + 1) */
94 ta = tn + 1;
105 /* t = t + c. NOTE: tn is always >= p->_cn (precondition for __GMPN_ADD);
107 ASSERT (tn >= p->_cn);
108 __GMPN_ADD (cy, tp, tp, tn, p->_cp, p->_cn);
114 MPN_COPY (PTR (p->_mp_seed), tp, tn);
120 tn
147 mp_size_t tn; local
[all...]
/haiku-buildtools/gcc/mpfr/src/
H A Dfrac.c35 mp_size_t un, tn, t0; local
106 tn = (MPFR_PREC(t) - 1) / GMP_NUMB_BITS;
107 MPFR_ASSERTN(tn >= un);
108 t0 = tn - un;
113 tp[tn] = k | ((un) ? mpn_lshift (tp + t0, up, un, sh) : (mp_limb_t) 0);
132 (mpfr_prec_t) (tn + 1) * GMP_NUMB_BITS,
137 tp[tn] = MPFR_LIMB_HIGHBIT;
H A Drec_sqrt.c197 mp_size_t xn, rn, th, ln, tn, sn, ahn, un; local
221 This is sufficient to prove that the upper limb of {t,tn} below is
225 tn = LIMB_SIZE(2 * h + 1 + as);
240 un = xn + (tn - th);
242 limbs where u needs xn+(tn-th) limbs. Since tn can store at least
243 2h bits, and th at most h bits, then tn-th can store at least h bits,
244 thus tn - th >= xn, and reserving the space for u is enough. */
298 limbs, where rn = LIMBS(2h), an=LIMBS(a), and tn = LIMBS(2h+1+as). */
299 t = s + sn - tn; /* pointe
[all...]
H A Dsqr.c33 mp_size_t bn, tn; local
62 tn = MPFR_PREC2LIMBS (2 * bq); /* number of limbs of square,
82 tmp += 2 * bn - tn; /* +0 or +1 */
84 mpn_lshift (tmp, tmp, tn, 1); /* tn <= k, so no stack corruption */
H A Dmul.c44 mp_size_t bn, cn, tn, k; local
103 k = bn + cn; /* effective nb of limbs used by b*c (= tn or tn+1) below */
104 tn = MPFR_PREC2LIMBS (bq + cq);
106 MPFR_ASSERTD(tn <= k);
125 tmp += k - tn;
127 mpn_lshift (tmp, tmp, tn, 1); /* tn <= k, so no stack corruption */
220 mp_size_t bn, cn, tn, k, threshold; local
299 k = bn + cn; /* effective nb of limbs used by b*c (= tn o
[all...]
H A Dcmp2.c110 mp_size_t tn; local
113 tn = bn; bn = cn; cn = tn;
/haiku-buildtools/gcc/gmp/mpf/
H A Dget_str.c117 mp_size_t un, pn, tn; local
202 tn = un + pn;
203 tn -= tp[tn - 1] == 0;
207 MPN_COPY_DECR (tp - off, tp, tn);
209 tn -= off;
212 n_digits_computed = mpn_get_str (tstr, base, tp + off, tn - off);
244 tn = xn - pn + 1;
245 tn -= tp[tn
[all...]
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/
H A Dbinary-tree.c44 typedef struct tn { struct
45 struct tn* left;
46 struct tn* right;
/haiku-buildtools/gcc/libstdc++-v3/testsuite/20_util/tuple/cons/
H A Dconstructor.cc60 tuple<int,int> tn(pair1);
/haiku-buildtools/gcc/libstdc++-v3/testsuite/tr1/6_containers/tuple/cons/
H A Dconstructor.cc60 tuple<int,int> tn(pair1);
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/
H A Dbug336.go67 tn struct{ Next *T11 }
76 tn.Next = &T11{}
77 tz.z = &tn

Completed in 129 milliseconds

12