HomeSort by: relevance | last modified time | path
    Searched refs:rn (Results 1 - 25 of 442) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /src/external/lgpl3/gmp/dist/mpz/
tdiv_q_2exp.c 38 mp_size_t un, rn; local
45 rn = ABS (un) - limb_cnt;
47 if (rn <= 0)
48 rn = 0;
51 rp = MPZ_REALLOC (r, rn);
57 mpn_rshift (rp, up, rn, cnt);
58 rn -= rp[rn - 1] == 0;
62 MPN_COPY_INCR (rp, up, rn);
66 SIZ(r) = un >= 0 ? rn : -rn
    [all...]
mul_2exp.c 37 mp_size_t un, rn; local
45 rn = un + limb_cnt;
48 rn = 0;
51 rp = MPZ_REALLOC (r, rn + 1);
58 rp[rn] = rlimb;
59 rn += (rlimb != 0);
71 SIZ(r) = SIZ(u) >= 0 ? rn : -rn;
powm_sec.c 44 mp_size_t rn, bn, es, en; local
86 rn = n;
88 MPN_NORMALIZE (rp, rn);
90 if ((ep[0] & 1) && SIZ(b) < 0 && rn != 0)
92 mpn_sub (rp, PTR(m), n, rp, rn);
93 rn = n;
94 MPN_NORMALIZE (rp, rn);
97 MPZ_NEWALLOC (r, rn);
98 SIZ(r) = rn;
99 MPN_COPY (PTR(r), rp, rn); local
    [all...]
set_d.c 53 mp_size_t rn; local
62 rn = __gmp_extract_double (tp, d);
64 if (rn <= 0)
65 rn = 0;
67 rp = MPZ_NEWALLOC (r, rn);
69 switch (rn)
72 MPN_ZERO (rp, rn - LIMBS_PER_DOUBLE);
73 rp += rn - LIMBS_PER_DOUBLE;
112 SIZ(r) = negative ? -rn : rn;
    [all...]
  /src/external/lgpl3/gmp/dist/mpn/generic/
binvert.c 65 mp_size_t rn, newrn; local
70 base case size in 'rn'. */
72 for (rn = n; ABOVE_THRESHOLD (rn, BINV_NEWTON_THRESHOLD); rn = (rn + 1) >> 1)
73 *sizp++ = rn;
77 /* Compute a base value of rn limbs. */
78 MPN_ZERO (xp, rn);
81 if (BELOW_THRESHOLD (rn, DC_BDIV_Q_THRESHOLD)
    [all...]
pow_1.c 44 mp_size_t rn; local
89 rn = 1 + (rh != 0);
96 rp[rn] = rh = mpn_mul_1 (rp, rp, rn, bl);
97 rn += rh != 0;
103 mpn_sqr (tp, rp, rn);
104 rn = 2 * rn; rn -= tp[rn - 1] == 0
    [all...]
matrix22_mul.c 79 mpn_matrix22_mul_itch (mp_size_t rn, mp_size_t mn)
81 if (BELOW_THRESHOLD (rn, MATRIX22_STRASSEN_THRESHOLD)
83 return 3*rn + 2*mn;
85 return 3*(rn + mn) + 5;
126 * Resulting elements are of size up to rn + mn + 1.
128 * Temporary storage: 3 rn + 3 mn + 5. */
130 mpn_matrix22_mul_strassen (mp_ptr r0, mp_ptr r1, mp_ptr r2, mp_ptr r3, mp_size_t rn,
136 s0 = tp; tp += rn + 1;
138 u0 = tp; tp += rn + mn + 1;
139 u1 = tp; /* rn + mn + 2 *
    [all...]
redc_n.c 54 mp_size_t rn; local
60 rn = mpn_mulmod_bnm1_next_size (n);
62 scratch = TMP_ALLOC_LIMBS (n + rn + mpn_mulmod_bnm1_itch (rn, n, n));
68 mpn_mulmod_bnm1 (yp, rn, xp, n, mp, n, scratch + n + rn);
70 ASSERT_ALWAYS (2 * n > rn); /* could handle this */
72 cy = mpn_sub_n (yp + rn, yp, up, 2*n - rn); /* undo wrap around */
73 MPN_DECR_U (yp + 2*n - rn, rn, cy)
    [all...]
nussbaumer_mul.c 47 mp_size_t rn; local
58 rn = mpn_sqrmod_bnm1_next_size (2*an);
59 tp = TMP_ALLOC_LIMBS (mpn_sqrmod_bnm1_itch (rn, an));
60 mpn_sqrmod_bnm1 (pp, rn, ap, an, tp);
64 rn = mpn_mulmod_bnm1_next_size (an + bn);
65 tp = TMP_ALLOC_LIMBS (mpn_mulmod_bnm1_itch (rn, an, bn));
66 mpn_mulmod_bnm1 (pp, rn, ap, an, bp, bn, tp);
invertappr.c 138 Maximum scratch needed by this branch <= 2*n, but have to fit 3*rn
139 in the scratch, i.e. 3*rn <= 2*n: we require n>4.
156 mp_size_t rn, mn; local
169 base case size in 'rn'. */
171 rn = n;
173 *sizp = rn;
174 rn = (rn >> 1) + 1;
176 } while (ABOVE_THRESHOLD (rn, INV_NEWTON_THRESHOLD));
182 /* Compute a base value of rn limbs. *
    [all...]
sqrmod_bnm1.c 42 /* Input is {ap,rn}; output is {rp,rn}, computation is
43 mod B^rn - 1, and values are semi-normalised; zero is represented
44 as either 0 or B^n - 1. Needs a scratch of 2rn limbs at tp.
47 mpn_bc_sqrmod_bnm1 (mp_ptr rp, mp_srcptr ap, mp_size_t rn, mp_ptr tp)
51 ASSERT (0 < rn);
53 mpn_sqr (tp, ap, rn);
54 cy = mpn_add_n (rp, tp, tp + rn, rn);
55 /* If cy == 1, then the value of rp is at most B^rn - 2, so there ca
    [all...]
mulmid.c 49 mp_size_t rn, k; local
110 rn = an - bn + 1;
112 if (rn < MULMID_TOOM42_THRESHOLD)
136 temp = TMP_ALLOC_LIMBS (rn + 2);
149 mpn_add_n (rp, rp, temp, rn + 2);
157 mpn_mulmid_basecase (temp, ap, rn + bn - 1, bp, bn);
158 mpn_add_n (rp, rp, temp, rn + 2);
167 if (bn > rn)
182 temp = TMP_ALLOC_LIMBS (rn + 2 + mpn_toom42_mulmid_itch (rn));
    [all...]
broot.c 81 mp_size_t rn; local
149 rn = 1;
154 mpn_sqr (ep, rp, rn); /* For odd n, writes n+1 limbs in the
161 ASSERT (mpn_cmp (ep, rp, rn) == 0);
163 ASSERT (sizes[i] <= 2*rn);
164 mpn_pi1_bdiv_q_1 (rp + rn, ep + rn, sizes[i] - rn, k, kinv, 0);
165 mpn_neg (rp + rn, rp + rn, sizes[i] - rn)
    [all...]
  /src/external/gpl3/gdb.old/dist/sim/lm32/
lm32.c 34 lm32bf_fetch_register (SIM_CPU * current_cpu, int rn, void *buf, int len)
36 if (rn < 32)
37 SETTSI (buf, lm32bf_h_gr_get (current_cpu, rn));
39 switch (rn)
54 lm32bf_store_register (SIM_CPU * current_cpu, int rn, const void *buf, int len)
56 if (rn < 32)
57 lm32bf_h_gr_set (current_cpu, rn, GETTSI (buf));
59 switch (rn)
  /src/external/gpl3/gdb/dist/sim/lm32/
lm32.c 34 lm32bf_fetch_register (SIM_CPU * current_cpu, int rn, void *buf, int len)
36 if (rn < 32)
37 SETTSI (buf, lm32bf_h_gr_get (current_cpu, rn));
39 switch (rn)
54 lm32bf_store_register (SIM_CPU * current_cpu, int rn, const void *buf, int len)
56 if (rn < 32)
57 lm32bf_h_gr_set (current_cpu, rn, GETTSI (buf));
59 switch (rn)
  /src/external/gpl3/gdb.old/dist/sim/common/
sim-reg.c 33 sim_fetch_register (SIM_DESC sd, int rn, void *buf, int length)
38 return (* CPU_REG_FETCH (cpu)) (cpu, rn, buf, length);
48 sim_store_register (SIM_DESC sd, int rn, const void *buf, int length)
53 return (* CPU_REG_STORE (cpu)) (cpu, rn, buf, length);
  /src/external/gpl3/gdb/dist/sim/common/
sim-reg.c 33 sim_fetch_register (SIM_DESC sd, int rn, void *buf, int length)
38 return (* CPU_REG_FETCH (cpu)) (cpu, rn, buf, length);
48 sim_store_register (SIM_DESC sd, int rn, const void *buf, int length)
53 return (* CPU_REG_STORE (cpu)) (cpu, rn, buf, length);
  /src/sys/arch/sh3/sh3/
db_disasm.c 195 int rn, type, md; local
197 rn = (insn & 0x0f00) >> 8;
205 snprintf(buf, len, "stc sr, r%d", rn);
209 snprintf(buf, len, "stc gbr, r%d", rn);
213 snprintf(buf, len, "stc vbr, r%d", rn);
217 snprintf(buf, len, "stc ssr, r%d", rn);
226 snprintf(buf, len, "stc spc, r%d", rn);
232 snprintf(buf, len, "stc r%d_bank, r%d", md, rn);
236 snprintf(buf, len, "stc r%d_bank, r%d", md+4, rn);
245 int rn, type, md local
279 int rn, rm, md; local
356 int rn, fx; local
384 int rn, type, md; local
451 int rn, rm, md; local
480 int rn, rm, disp; local
494 int rn, rm, md; local
520 int rn, rm, md; local
549 int rn, rm, md; local
579 int rn, rm, md; local
608 int rn, rm, md; local
634 int rn, rm, md; local
663 int rn, rm, md; local
689 int rn, rm, md; local
719 int rn, fx; local
743 int rn, fx; local
768 int rn, type, md; local
809 int rn, type, md; local
858 int rn, fx; local
878 int rn, fx; local
992 int rn, fx; local
1016 int rn, fx; local
1105 int rn, rm; local
1116 int rn, rm; local
1176 int rn, rm; local
1187 int rn, rm, disp; local
1201 int rn, rm, md; local
1230 int rn, rm, md; local
1259 int rn, rm, md; local
1288 int rn, rm, md; local
1317 int rn, imm; local
1329 int type, md, rn, disp; local
1410 int rn, disp; local
1550 int rn, disp; local
1563 int rn, imm; local
1575 int rn, rm, md; local
1604 int rn, rm, md; local
1633 int rn, rm, md; local
1662 int rn, rm; local
1674 int rn, type, md; local
1732 int rn, rm; local
    [all...]
  /src/external/lgpl3/gmp/dist/mpf/
set_str.c 74 mp_size_t rn; local
79 rn = 1;
85 mpn_sqr (tp, rp + off, rn);
86 rn = 2 * rn;
87 rn -= tp[rn - 1] == 0;
91 if (rn > prec)
93 ign += rn - prec;
94 off = rn - prec
256 mp_size_t ra, ma, rn, mn; local
406 MPN_COPY (PTR(x), tp, rn); local
    [all...]
  /src/sys/netatalk/
at_rmx.c 85 struct radix_node *rn; local
91 rn = rn_addroute(v_arg, n_arg, head, treenodes);
93 printf("at_addroute: returns rn=%p\n", rn);
95 return rn;
101 struct radix_node *rn; local
106 rn = rn_match(v_arg, head);
108 printf("at_matroute: returns rn=%p\n", rn);
110 return rn;
116 struct radix_node *rn; local
132 struct radix_node *rn; local
    [all...]
  /src/lib/libm/complex/
cephes_subr.c 87 double f, x, x2, y, y2, rn, t; local
100 rn = 0.0;
103 rn += 1.0;
104 f *= rn;
105 rn += 1.0;
106 f *= rn;
113 rn += 1.0;
114 f *= rn;
115 rn += 1.0;
116 f *= rn;
    [all...]
cephes_subrf.c 87 float f, x, x2, y, y2, rn, t, d; local
99 rn = 0.0f;
102 rn += 1.0f;
103 f *= rn;
104 rn += 1.0f;
105 f *= rn;
112 rn += 1.0f;
113 f *= rn;
114 rn += 1.0f;
115 f *= rn;
    [all...]
cephes_subrl.c 92 long double f, x, x2, y, y2, rn, t; local
105 rn = 0.0;
108 rn += 1.0L;
109 f *= rn;
110 rn += 1.0L;
111 f *= rn;
118 rn += 1.0L;
119 f *= rn;
120 rn += 1.0L;
121 f *= rn;
    [all...]
  /src/sys/net/
rtbl.c 137 struct radix_node *rn; local
139 rn = rnh->rnh_matchaddr(dst, rnh);
140 if (rn == NULL || (rn->rn_flags & RNF_ROOT) != 0)
142 return (struct rtentry *)rn;
149 struct radix_node *rn; local
151 rn = rnh->rnh_addaddr(rt_getkey(rt), netmask, rnh, rt->rt_nodes);
153 return (rn == NULL) ? EEXIST : 0;
160 struct radix_node *rn; local
162 rn = rnh->rnh_lookup(dst, netmask, rnh)
173 struct radix_node *rn; local
    [all...]
  /src/sys/rump/librump/rumpvfs/
rumpfs.c 332 struct rumpfs_node *rn; local
377 et->et_rn = rn = makeprivate(ettype_to_vtype(ftype), RUMPFS_DEFAULTMODE,
382 rn->rn_flags |= RUMPNODE_ET_PHONE_HOST;
387 rn->rn_hostpath = malloc(len, M_TEMP, M_WAITOK | M_ZERO);
388 memcpy(rn->rn_hostpath, hostpath, len);
389 rn->rn_offset = begin;
393 rn->rn_flags |= RUMPNODE_DIR_ET;
400 rn->rn_flags |= RUMPNODE_DIR_ETSUBS;
478 struct rumpfs_node *rn; local
483 rn = vp->v_data
512 struct rumpfs_node *rn; local
619 struct rumpfs_node *rn = vp->v_data; local
680 struct rumpfs_node *rnd = dvp->v_data, *rn; local
865 struct rumpfs_node *rn = vp->v_data; local
886 struct rumpfs_node *rn = vp->v_data; local
904 struct rumpfs_node *rn = vp->v_data; local
1027 struct rumpfs_node *rnd = dvp->v_data, *rn; local
1057 struct rumpfs_node *rn = vp->v_data; local
1097 struct rumpfs_node *rn = vp->v_data; local
1124 struct rumpfs_node *rnd = dvp->v_data, *rn; local
1155 struct rumpfs_node *rnd = dvp->v_data, *rn; local
1189 struct rumpfs_node *rnd = dvp->v_data, *rn; local
1224 struct rumpfs_node *rn = vp->v_data; local
1269 struct rumpfs_node *rn = vp->v_data; local
1401 struct rumpfs_node *rn = vp->v_data; local
1472 struct rumpfs_node *rn = vp->v_data; local
1579 struct rumpfs_node *rn = vp->v_data; local
1668 struct rumpfs_node *rn = vp->v_data; local
1692 struct rumpfs_node *rn = vp->v_data; local
1762 struct rumpfs_node *rn = vp->v_data; local
1779 struct rumpfs_node *rn = vp->v_data; local
1863 struct rumpfs_node *rn; local
1962 struct rumpfs_node *rn; local
    [all...]

Completed in 66 milliseconds

1 2 3 4 5 6 7 8 91011>>