| /src/external/lgpl3/gmp/dist/mpq/ |
| set_d.c | 52 mp_size_t nn, dn; local
87 np[0] = tp[3], nn = 1;
89 np[1] = tp[3], np[0] = tp[2], nn = 2;
91 np[2] = tp[3], np[1] = tp[2], np[0] = tp[1], nn = 3;
93 np[3] = tp[3], np[2] = tp[2], np[1] = tp[1], np[0] = tp[0], nn = 4;
98 np[0] = tp[2], nn = 1;
100 np[1] = tp[2], np[0] = tp[1], nn = 2;
102 np[2] = tp[2], np[1] = tp[1], np[0] = tp[0], nn = 3;
107 np[0] = tp[1], nn = 1;
109 np[1] = tp[1], np[0] = tp[0], nn = 2
[all...] |
| /src/external/lgpl3/gmp/dist/mpz/ |
| cdiv_q_ui.c | 40 mp_size_t ns, nn, qn; local
54 nn = ABS(ns);
55 qp = MPZ_REALLOC (quot, nn);
63 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
73 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
75 qn = nn - 2 + 1;
89 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
97 qn = nn - (qp[nn - 1] == 0);
|
| cdiv_qr_ui.c | 40 mp_size_t ns, nn, qn; local
55 nn = ABS(ns);
56 qp = MPZ_REALLOC (quot, nn);
68 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
79 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
81 qn = nn - 2 + 1;
99 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
113 qn = nn - (qp[nn - 1] == 0);
|
| cdiv_r_ui.c | 40 mp_size_t ns, nn; local
54 nn = ABS(ns);
66 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
76 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
77 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
95 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
| cdiv_ui.c | 40 mp_size_t ns, nn; local
53 nn = ABS(ns);
63 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
73 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
74 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
91 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
| divexact.c | 43 mp_size_t nn, dn; local
56 nn = ABSIZ (num);
59 if (nn < dn)
68 qn = nn - dn + 1;
80 mpn_divexact (qp, np, nn, dp, dn);
|
| fdiv_q_ui.c | 38 mp_size_t ns, nn, qn; local
52 nn = ABS(ns);
53 qp = MPZ_REALLOC (quot, nn);
61 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
71 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
73 qn = nn - 2 + 1;
87 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
95 qn = nn - (qp[nn - 1] == 0);
|
| fdiv_qr_ui.c | 38 mp_size_t ns, nn, qn; local
53 nn = ABS(ns);
54 qp = MPZ_REALLOC (quot, nn);
66 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
77 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
79 qn = nn - 2 + 1;
97 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
111 qn = nn - (qp[nn - 1] == 0);
|
| fdiv_r_ui.c | 38 mp_size_t ns, nn; local
52 nn = ABS(ns);
64 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
74 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
75 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
93 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
| fdiv_ui.c | 38 mp_size_t ns, nn; local
51 nn = ABS(ns);
61 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
71 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
72 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
89 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
| tdiv_q_ui.c | 38 mp_size_t ns, nn, qn; local
52 nn = ABS(ns);
53 qp = MPZ_REALLOC (quot, nn);
61 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
70 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
72 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
77 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
78 qn = nn - (qp[nn - 1] == 0);
|
| tdiv_qr_ui.c | 39 mp_size_t ns, nn, qn; local
54 nn = ABS(ns);
55 qp = MPZ_REALLOC (quot, nn);
65 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
78 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
80 qn = nn - 2 + 1; qn -= qp[qn - 1] == 0; qn -= qn != 0 && qp[qn - 1] == 0;
87 rl = mpn_divrem_1 (qp, (mp_size_t) 0, np, nn, (mp_limb_t) divisor);
95 qn = nn - (qp[nn - 1] == 0);
|
| tdiv_r_ui.c | 38 mp_size_t ns, nn; local
52 nn = ABS(ns);
62 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
75 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
76 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
85 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
| tdiv_ui.c | 38 mp_size_t ns, nn; local
51 nn = ABS(ns);
62 if (nn == 1) /* tdiv_qr requirements; tested above for 0 */
71 qp = TMP_ALLOC_LIMBS (nn - 2 + 1);
72 mpn_tdiv_qr (qp, rp, (mp_size_t) 0, np, nn, dp, (mp_size_t) 2);
80 rl = mpn_mod_1 (np, nn, (mp_limb_t) divisor);
|
| /src/games/dab/ |
| main.cc | 104 size_t ny, nx, nn = 1, wt = 0; local
123 nn = atoi(optarg);
179 while (nn--) {
|
| /src/sys/rump/net/lib/libshmif/ |
| shmif_user.c | 117 ssize_t nn; local
131 nn = readlink(procbuf, linkbuf, sizeof(linkbuf)-1);
132 if (nn >= (ssize_t)sizeof(linkbuf)-1) {
133 nn = -1;
136 if (nn == -1) {
142 linkbuf[nn] = '\0';
160 ssize_t nn; local
165 nn = read(kq, &iev, sizeof(iev));
166 } while (nn == -1 && errno == EINTR);
167 if (nn == -1)
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| hgcd.c | 87 mp_size_t nn; local
104 nn = mpn_hgcd_reduce (M, ap, bp, n, p, tp);
105 if (nn)
107 n = nn;
116 nn = mpn_hgcd_step (n, ap, bp, s, M, tp);
117 if (!nn)
120 n = nn;
137 nn = mpn_hgcd (ap + p, bp + p, n - p, &M1, tp + scratch);
138 if (nn > 0)
153 n = mpn_hgcd_matrix_adjust (&M1, p + nn, ap, bp, p, tp + scratch)
[all...] |
| hgcd_appr.c | 91 mp_size_t nn; local
96 nn = mpn_hgcd_step (n, ap, bp, s, M, tp);
97 if (!nn)
100 n = nn;
159 mp_size_t nn; local
164 nn = mpn_hgcd_step (n, ap, bp, s, M, tp);
166 if (!nn)
169 n = nn;
191 mp_size_t nn; local
193 nn = mpn_hgcd_reduce (M, ap, bp, n, p, tp)
203 mp_size_t nn; local
253 mp_size_t nn; local
[all...] |
| sec_div.c | 52 FNAME_itch (mp_size_t nn, mp_size_t dn)
55 /* Needs (nn + dn + 1) + mpn_sec_pi1_div_qr's needs of (2nn' - dn + 1) for a
56 total of 3nn + 4 limbs at tp. Note that mpn_sec_pi1_div_qr's nn is one
58 return 3 * nn + 4;
61 /* Needs (nn + dn + 1) + mpn_sec_pi1_div_r's needs of (dn + 1) for a total of
62 nn + 2dn + 2 limbs at tp. */
63 return nn + 2 * dn + 2;
69 mp_ptr np, mp_size_t nn, variable
[all...] |
| hgcd_reduce.c | 77 mp_size_t an, bn, un, vn, nn; local
117 nn = submul (bp, bn, ap, an, M->p[1][0], mn[1][0]);
128 nn = submul (ap, an, bp, bn, M->p[0][1], mn[0][1]);
137 nn = MAX (un, vn);
139 modn = mpn_mulmod_bnm1_next_size (nn + 1);
170 ASSERT (mpn_zero_p (tp + nn, modn - nn));
173 MPN_COPY (ap, tp, nn);
184 ASSERT (mpn_zero_p (tp + nn, modn - nn));
225 mp_size_t nn; local
[all...] |
| remove.c | 67 mp_srcptr np, mp_size_t nn,
74 scratch_out = TMP_ALLOC_LIMBS (mpn_bdiv_qr_itch (nn, dn));
75 mpn_bdiv_qr (qp, rp, np, nn, dp, dn, scratch_out);
90 mp_size_t pn, nn, qn, i; local
134 nn = 2 * pn - 1; /* next power will be at least this large */
135 if (nn > qn)
144 pn = nn + (np[nn] != 0);
|
| sec_pi1_div.c | 65 /* Needs (dn + 1) + (nn - dn) + (nn - dn) = 2nn - dn + 1 limbs at tp. */
79 mp_ptr np, mp_size_t nn, variable
93 ASSERT (nn >= dn);
96 if (nn == dn)
112 qlp = tp + (dn + 1); /* (nn - dn) limbs */
113 qhp = tp + (nn + 1); /* (nn - dn) limbs */
116 np += nn - dn
[all...] |
| /src/sys/external/bsd/drm2/drm/ |
| drm_sysctl.c | 145 char copy[256], *n, *nn; local
148 for (n = copy; (nn = strchr(n, '.')) != NULL; n = nn) {
149 *nn++ = '\0';
|
| /src/external/bsd/openldap/dist/libraries/libldap/ |
| charray.c | 82 int i, n, nn; local
88 for ( nn = 0; s[nn] != NULL; nn++ ) {
92 aa = (char **) LDAP_REALLOC( (char *) *a, (n + nn + 1) * sizeof(char *) );
100 for ( i = 0; i < nn; i++ ) {
112 (*a)[n + nn] = NULL;
|
| /src/lib/libresolv/ |
| ns_sign.c | 165 int nn; local
183 nn = ns_name_ntol(name, buf, sizeof(buf));
184 INSIST(nn > 0);
185 dst_sign_data(SIG_MODE_UPDATE, key, &ctx, buf, nn, NULL, 0);
195 nn = ns_name_ntol(alg, buf, sizeof(buf));
196 INSIST(nn > 0);
197 dst_sign_data(SIG_MODE_UPDATE, key, &ctx, buf, nn, NULL, 0);
218 nn = dst_sign_data(SIG_MODE_FINAL, key, &ctx, NULL, 0,
220 if (nn < 0)
222 *siglen = nn;
[all...] |
