Searched refs:un (Results 1 - 25 of 132) sorted by relevance

123456

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dnewunit_3.f904 integer :: st, un = 0 variable in program:test_newunit
5 open (newunit=un, file='nonexisting.dat', status='old', iostat=st)
6 if (un /= 0) call abort
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr39082-1.c6 union un union
12 extern int bar1 (union un);
13 extern union un bar2 (int);
16 foo1 (union un u) /* { dg-message "note: the ABI of passing union with long double has changed in GCC 4.4" } */
25 union un u;
33 union un u = bar2 (x);
/haiku-buildtools/gcc/gmp/mpz/
H A Dcmpabs_ui.c29 mp_size_t un; variable
33 un = SIZ(u);
35 if (un == 0)
38 un = ABS (un);
40 if (un == 1)
53 if (un == 2)
H A Dcmp_ui.c29 mp_size_t un; variable
33 un = SIZ(u);
35 if (un == 0)
38 if (un == 1)
51 if (un == 2)
67 return un > 0 ? 1 : -1;
H A Dgcd_ui.c28 mp_size_t un; local
47 un = ABSIZ(u);
49 if (un == 0)
57 MPZ_REALLOC (w, un);
58 MPN_COPY (PTR(w), PTR(u), un); local
60 SIZ(w) = un;
64 return (un == 1 && res <= ULONG_MAX ? res : 0);
67 res = mpn_gcd_1 (PTR(u), un, (mp_limb_t) v);
H A Droot.c29 mp_size_t us, un, rootn, remn; local
50 un = ABS (us);
51 rootn = (un - 1) / nth + 1;
65 MPN_COPY (rootp, up, un);
70 remn = mpn_rootrem (rootp, NULL, up, un, (mp_limb_t) nth);
H A Drootrem.c29 mp_size_t us, un, rootn, remn; local
51 un = ABS (us);
52 rootn = (un - 1) / nth + 1;
63 remp = MPZ_REALLOC (rem, un);
65 remp = TMP_ALLOC_LIMBS (un);
71 MPN_COPY (rootp, up, un);
76 remn = mpn_rootrem (rootp, remp, up, un, (mp_limb_t) nth);
/haiku-buildtools/gcc/gmp/mpn/generic/
H A Dmul_basecase.c46 mp_srcptr up, mp_size_t un,
49 ASSERT (un >= vn);
51 ASSERT (! MPN_OVERLAP_P (rp, un+vn, up, un));
52 ASSERT (! MPN_OVERLAP_P (rp, un+vn, vp, vn));
61 rp[un + 1] = mpn_mul_2 (rp, up, un, vp);
66 rp[un] = mpn_mul_1 (rp, up, un, vp[0]);
70 rp[un]
45 mpn_mul_basecase(mp_ptr rp, mp_srcptr up, mp_size_t un, mp_srcptr vp, mp_size_t vn) argument
[all...]
H A Dgcdext_subdiv_step.c44 mp_size_t an, bn, un; local
58 un = *unp;
68 MPN_NORMALIZE (u0, un);
69 MPN_COPY (up, u0, un);
71 *usizep = swapped ? un : -un;
80 MPN_NORMALIZE (u1, un);
81 MPN_COPY (up, u1, un);
83 *usizep = swapped ? -un : un;
[all...]
H A Dmul.c52 remaining area might have un < vn. Should we fix the toomX2 code in a
76 mp_srcptr up, mp_size_t un,
79 ASSERT (un >= vn);
81 ASSERT (! MPN_OVERLAP_P (prodp, un+vn, up, un));
82 ASSERT (! MPN_OVERLAP_P (prodp, un+vn, vp, vn));
84 if (un == vn)
87 mpn_sqr (prodp, up, un);
89 mpn_mul_n (prodp, up, vp, un);
94 /* Unless un i
75 mpn_mul(mp_ptr prodp, mp_srcptr up, mp_size_t un, mp_srcptr vp, mp_size_t vn) argument
[all...]
H A Dgcdext_lehmer.c46 mp_size_t un; local
56 u1[0] = 1; un = 1;
101 un = mpn_hgcd_mul_matrix1_vector(&M, u2, u0, u1, un);
110 mp_size_t updated_un = un;
119 un = updated_un;
136 MPN_CMP (c, u0, u1, un);
137 ASSERT (c != 0 || (un == 1 && u0[0] == 1 && u1[0] == 1));
140 MPN_NORMALIZE (u0, un);
141 MPN_COPY (up, u0, un);
[all...]
H A Dpre_mod_1.c1 /* mpn_preinv_mod_1 (up, un, d, dinv) -- Divide (UP,,UN) by the normalized D.
33 mpn_preinv_mod_1 (mp_srcptr up, mp_size_t un, mp_limb_t d, mp_limb_t dinv) argument
39 ASSERT (un >= 1);
42 r = up[un - 1];
46 for (i = un - 2; i >= 0; i--)
H A Ddiveby3.c26 mpn_divexact_by3c (mp_ptr rp, mp_srcptr up, mp_size_t un, mp_limb_t c) argument
29 r = mpn_bdiv_dbm1c (rp, up, un, GMP_NUMB_MASK / 3, GMP_NUMB_MASK / 3 * c);
64 mpn_divexact_by3c (mp_ptr restrict rp, mp_srcptr restrict up, mp_size_t un, mp_limb_t c) argument
69 ASSERT (un >= 1);
71 ASSERT (MPN_SAME_OR_SEPARATE_P (rp, up, un));
85 while (++i < un);
133 mpn_divexact_by3c (mp_ptr restrict rp, mp_srcptr restrict up, mp_size_t un, mp_limb_t cy) argument
138 ASSERT (un >= 1);
140 ASSERT (MPN_SAME_OR_SEPARATE_P (rp, up, un));
144 for (i = 0; i < un;
[all...]
H A Dmod_1.c73 mpn_mod_1_unnorm (mp_srcptr up, mp_size_t un, mp_limb_t d) argument
80 ASSERT (un > 0);
87 r = up[un - 1] << GMP_NAIL_BITS;
91 un--;
92 if (un == 0)
101 && BELOW_THRESHOLD (un, MOD_1_UNNORM_THRESHOLD))
103 for (i = un - 1; i >= 0; i--)
115 n1 = up[un - 1] << GMP_NAIL_BITS;
119 && BELOW_THRESHOLD (un, MOD_1_UNNORM_THRESHOLD))
121 for (i = un
155 mpn_mod_1_norm(mp_srcptr up, mp_size_t un, mp_limb_t d) argument
[all...]
H A Ddivrem_1.c80 mp_srcptr up, mp_size_t un, mp_limb_t d)
88 ASSERT (un >= 0);
91 ASSERT (MPN_SAME_OR_SEPARATE_P (qp+qxn, up, un));
93 n = un + qxn;
103 if (un != 0)
107 r = up[un - 1] << GMP_NAIL_BITS;
113 un--;
119 for (i = un - 1; i >= 0; i--)
140 for (i = un - 1; i >= 0; i--)
163 if (un !
79 mpn_divrem_1(mp_ptr qp, mp_size_t qxn, mp_srcptr up, mp_size_t un, mp_limb_t d) argument
[all...]
H A Dgcdext.c197 mp_size_t un; local
299 un = M.n;
300 while ( (u0[un-1] | u1[un-1] ) == 0)
301 un--;
322 un = updated_un;
323 ASSERT (un < ualloc);
347 ASSERT (M.n + un <= ualloc);
351 MPN_COPY (t0, u0, un);
354 un
[all...]
H A Dremove.c37 /* Input: U = {up,un}, V = {vp,vn} must be odd, cap
45 * If we require W to have space for un limbs, we could save qp or qp2 (but
52 mp_ptr up, mp_size_t un, mp_ptr vp, mp_size_t vn,
63 ASSERT (un > 0);
70 tp = TMP_ALLOC_LIMBS ((un + vn) / 2); /* remainder */
71 qp = TMP_ALLOC_LIMBS (un); /* quotient, alternating */
72 qp2 = TMP_ALLOC_LIMBS (un); /* quotient, alternating */
73 np = TMP_ALLOC_LIMBS (un + LOG); /* powers of V */
78 Which operands not greater than un,un wil
51 mpn_remove(mp_ptr wp, mp_size_t *wn, mp_ptr up, mp_size_t un, mp_ptr vp, mp_size_t vn, mp_bitcnt_t cap) argument
[all...]
H A Drootrem.c42 #define MPN_RSHIFT(cy,rp,up,un,cnt) \
45 cy = mpn_rshift (rp, up, un, cnt); \
48 MPN_COPY_INCR (rp, up, un); \
53 #define MPN_LSHIFT(cy,rp,up,un,cnt) \
56 cy = mpn_lshift (rp, up, un, cnt); \
59 MPN_COPY_DECR (rp, up, un); \
65 /* Put in {rootp, ceil(un/k)} the kth root of {up, un}, rounded toward zero.
66 If remp <> NULL, put in {remp, un} the remainder.
70 (a) up[un
79 mpn_rootrem(mp_ptr rootp, mp_ptr remp, mp_srcptr up, mp_size_t un, mp_limb_t k) argument
119 mpn_rootrem_internal(mp_ptr rootp, mp_ptr remp, mp_srcptr up, mp_size_t un, mp_limb_t k, int approx) argument
[all...]
H A Dget_str.c32 /* Conversion of U {up,un} to a string in base b. Internally, we convert to
81 if (un < GET_STR_PRECOMPUTE_THRESHOLD)
82 mpn_sb_get_str (str, base, up, un);
134 /* Convert {up,un} to a string in base base, and put the result in str.
137 after the last digit of the result string. Complexity is O(un^2); intended
141 mp_ptr up, mp_size_t un, int base)
147 for operands with un < GET_STR_PRECOMPUTE_THRESHOLD and that the smallest
166 MPN_COPY (rp + 1, up, un);
169 while (un > 1)
173 MPN_DIVREM_OR_PREINV_DIVREM_1 (rp, (mp_size_t) 1, rp + 1, un,
139 mpn_sb_get_str(unsigned char *str, size_t len, mp_ptr up, mp_size_t un, int base) argument
300 mpn_dc_get_str(unsigned char *str, size_t len, mp_ptr up, mp_size_t un, const powers_t *powtab, mp_ptr tmp) argument
356 mpn_get_str(unsigned char *str, int base, mp_ptr up, mp_size_t un) argument
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/compat/
H A Dunion-m128-1_x.c5 SS_union_mi128 un; variable
18 un.x = x.x;
20 bar(un);
22 foo(un);
H A Dunion-m128-1_y.c8 bar (SS_union_mi128 un) argument
12 x.x = un.x;
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A Dpr30564-2.c3 static inline void addpair(int fp, int un) argument
5 if (RawOrEnc == 0 && fp != un)
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.pt/
H A Denum11.C6 un, du, toi }; enumerator in enum:foo::T2
/haiku-buildtools/gcc/mpfr/src/
H A Dfrac.c35 mp_size_t un, tn, t0; local
63 un = (uq - 1) / GMP_NUMB_BITS; /* index of most significant limb */
64 un -= (mp_size_t) (ue / GMP_NUMB_BITS);
69 k = up[un] << sh;
87 while (up[--un] == 0)
89 MPFR_ASSERTN(un >= 0);
90 k = up[un];
96 /* un: index of the limb of u that contains the first bit 1 of the FP */
98 t = (mp_size_t) (MPFR_PREC(r) - 1) / GMP_NUMB_BITS < un ?
99 (mpfr_init2 (tmp, (un
[all...]
/haiku-buildtools/gcc/gmp/mpn/cray/ieee/
H A Dsqr_basecase.c28 mp_srcptr up, mp_size_t un)
30 mp_limb_t cy[un + un];
36 for (i = 0; i < un + un; i++)
43 for (j = 0; j < un; j++)
55 for (i = 1; i < un; i++)
67 rp[j + un] = _int_mult_upper (up[un - 1], ul);
72 for (i = 1; i < un
27 mpn_sqr_basecase(mp_ptr rp, mp_srcptr up, mp_size_t un) argument
[all...]

Completed in 214 milliseconds

123456