| /src/external/bsd/am-utils/dist/amd/ |
| amfs_direct.c | 89 am_node *xp; local
92 xp = next_nonerror_node(mp->am_child);
93 if (!xp) {
96 xp = amfs_generic_lookup_child(mp, mp->am_path + 1, &rc, VLOOK_CREATE);
97 if (xp && rc < 0)
98 xp = amfs_generic_mount_child(xp, &rc);
100 if (xp) {
101 new_ttl(xp); /* (7/12/89) from Rein Tollevik */
102 return xp;
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| invert.c | 54 mp_ptr xp; local
56 xp = scratch; /* 2 * n limbs */
58 MPN_FILL (xp, n, GMP_NUMB_MAX);
59 mpn_com (xp + n, dp, n);
61 mpn_divrem_2 (ip, 0, xp, 4, dp);
66 mpn_sbpi1_div_q (ip, xp, 2 * n, dp, n, inv.inv32);
|
| redc_n.c | 52 mp_ptr xp, yp, scratch; local
64 xp = scratch;
65 mpn_mullo_n (xp, up, ip, n);
68 mpn_mulmod_bnm1 (yp, rn, xp, n, mp, n, scratch + n + rn);
|
| fib2_ui.c | 83 mp_ptr xp; local
88 xp = TMP_ALLOC_LIMBS (alloc);
112 mpn_sqr (xp, fp, size);
117 most one high zero on xp (and if there is then there's one on
119 ASSERT (xp[size-1] != 0 || fp[size-1] == 0);
120 size -= (xp[size-1] == 0);
121 ASSERT (xp[size-1] != 0); /* only one xp high zero */
124 f1p[size] = mpn_add_n (f1p, xp, fp, size);
133 fp[size] = mpn_rsblsh2_n (fp, fp, xp, size)
[all...] |
| /src/external/lgpl3/gmp/dist/mpz/ |
| random2.c | 40 mp_ptr xp; local
45 xp = MPZ_NEWALLOC (x, abs_size);
47 mpn_random2 (xp, abs_size);
|
| get_str.c | 43 mp_ptr xp; local
89 xp = PTR (x);
92 xp = TMP_ALLOC_LIMBS (x_size | 1); /* |1 in case x_size==0 */
93 MPN_COPY (xp, PTR (x), x_size);
96 str_size = mpn_get_str ((unsigned char *) res_str, base, xp, x_size);
|
| out_str.c | 40 mp_ptr xp; local
86 xp = PTR (x);
89 xp = TMP_ALLOC_LIMBS (x_size | 1); /* |1 in case x_size==0 */
90 MPN_COPY (xp, PTR (x), x_size);
93 str_size = mpn_get_str (str, base, xp, x_size);
|
| rrandomb.c | 41 mp_ptr xp; local
46 xp = MPZ_NEWALLOC (x, nl);
47 gmp_rrandomb (xp, rstate, nbits);
|
| /src/external/lgpl3/mpfr/dist/src/ |
| setmin.c | 31 mp_limb_t *xp; local
35 xp = MPFR_MANT(x);
36 xp[xn] = MPFR_LIMB_HIGHBIT;
37 MPN_ZERO(xp, xn);
|
| isinteger.c | 32 mp_limb_t *xp; local
51 xp = MPFR_MANT(x);
53 if (MPFR_LIMB_LSHIFT(xp[xn], expo % GMP_NUMB_BITS) != 0)
56 if (xp[xn] != 0)
|
| setmax.c | 32 mp_limb_t *xp; local
37 xp = MPFR_MANT(x);
38 xp[0] = MPFR_LIMB_MAX << sh;
40 xp[i] = MPFR_LIMB_MAX;
|
| asin.c | 28 mpfr_t xp; local
62 mpfr_init2 (xp, MPFR_PREC (x));
63 inexact = mpfr_abs (xp, x, MPFR_RNDN);
66 compared = mpfr_cmp_ui (xp, 1);
72 mpfr_clear (xp);
94 mpfr_ui_sub (xp, 1, xp, MPFR_RNDD);
95 MPFR_ASSERTD (MPFR_GET_EXP (xp) <= 0);
97 xp_exp = 2 - MPFR_GET_EXP (xp);
106 mpfr_set_prec (xp, prec)
[all...] |
| get_sj.c | 66 mp_limb_t *xp; local
69 xp = MPFR_MANT (x);
82 /* sh is the number of bits that remain to be considered in {xp, xn} */
87 r = xp[0] >> (GMP_NUMB_BITS - sh);
92 an undefined behavior on xp[n] >> S when S >= GMP_NUMB_BITS
93 (even though xp[n] == 0 in such a case). This can happen if
110 ? (intmax_t) xp[n] << sh
111 : (intmax_t) (xp[n] >> (-sh));
|
| set_ui_2exp.c | 42 mp_limb_t *xp; local
61 xp = MPFR_MANT(x);
62 xp[xn] = ((mp_limb_t) i) << cnt;
64 MPN_ZERO(xp, xn);
71 MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, 0,
75 xp[xn] = MPFR_LIMB_HIGHBIT;
|
| acos.c | 29 mpfr_t xp, arcc, tmp; local
63 mpfr_init2 (xp, MPFR_PREC (x));
64 mpfr_abs (xp, x, MPFR_RNDN); /* Exact */
66 compared = mpfr_cmp_ui (xp, 1);
70 mpfr_clear (xp);
88 mpfr_ui_sub (xp, 1, xp, MPFR_RNDD);
90 supplement = 2 - 2 * MPFR_GET_EXP (xp);
92 supplement = 2 - MPFR_GET_EXP (xp);
93 mpfr_clear (xp);
[all...] |
| get_uj.c | 64 mp_limb_t *xp; local
68 xp = MPFR_MANT (x);
75 ? (uintmax_t) xp[n] << sh
76 : (uintmax_t) xp[n] >> (- sh));
|
| next.c | 66 mp_limb_t *xp; local
70 xp = MPFR_MANT(x);
71 mpn_sub_1 (xp, xp, xn, MPFR_LIMB_ONE << sh);
72 if (MPFR_UNLIKELY (MPFR_LIMB_MSB (xp[xn-1]) == 0))
82 xp[xn-1] |= MPFR_LIMB_HIGHBIT;
100 mp_limb_t *xp; local
104 xp = MPFR_MANT(x);
105 if (MPFR_UNLIKELY (mpn_add_1 (xp, xp, xn, MPFR_LIMB_ONE << sh))
[all...] |
| set_si_2exp.c | 41 mp_limb_t ai, *xp; local
61 xp = MPFR_MANT(x);
62 xp[xn] = ai << cnt;
64 MPN_ZERO(xp, xn);
72 MPFR_UNLIKELY (mpfr_round_raw (xp + xn, xp + xn, nbits, i < 0,
76 xp[xn] = MPFR_LIMB_HIGHBIT;
|
| /src/external/bsd/libarchive/dist/libarchive/ |
| archive_entry_xattr.c | 74 struct ae_xattr *xp; local
77 xp = entry->xattr_head->next;
81 entry->xattr_head = xp;
91 struct ae_xattr *xp; local
93 if ((xp = malloc(sizeof(struct ae_xattr))) == NULL)
96 if ((xp->name = strdup(name)) == NULL)
99 if ((xp->value = malloc(size)) != NULL) {
100 memcpy(xp->value, value, size);
101 xp->size = size;
103 xp->size = 0
116 struct ae_xattr *xp; local
[all...] |
| /src/external/lgpl3/gmp/dist/mpf/ |
| set_prc.c | 45 mp_ptr xp; local
60 xp = PTR(x);
64 MPN_COPY_INCR (xp, xp + size - new_prec_plus1, new_prec_plus1);
67 PTR(x) = __GMP_REALLOCATE_FUNC_LIMBS (xp, old_prec+1, new_prec_plus1);
|
| /src/external/ibm-public/postfix/dist/src/xsasl/ |
| xsasl_client.c | 227 const XSASL_CLIENT_IMPL_INFO *xp; local
229 for (xp = client_impl_info; xp->client_type; xp++)
230 if (strcmp(client_type, xp->client_type) == 0)
231 return (xp->client_init(client_type, path_info));
240 const XSASL_CLIENT_IMPL_INFO *xp; local
243 for (xp = client_impl_info; xp->client_type; xp++
[all...] |
| xsasl_server.c | 260 const XSASL_SERVER_IMPL_INFO *xp; local
262 for (xp = server_impl_info; xp->server_type; xp++)
263 if (strcmp(server_type, xp->server_type) == 0)
264 return (xp->server_init(server_type, path_info));
273 const XSASL_SERVER_IMPL_INFO *xp; local
276 for (xp = server_impl_info; xp->server_type; xp++
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/cray/ieee/ |
| addmul_1.c | 51 mp_limb_t xp[n]; local
52 MPN_COPY (xp, up, n);
53 return mpn_addmul_1 (rp, xp, n, vl);
|
| mul_1.c | 50 mp_limb_t xp[n]; local
51 MPN_COPY (xp, up, n);
52 return mpn_mul_1 (rp, xp, n, vl);
|
| submul_1.c | 51 mp_limb_t xp[n]; local
52 MPN_COPY (xp, up, n);
53 return mpn_submul_1 (rp, xp, n, vl);
|
