| /src/usr.bin/fstat/ |
| tmpfs.c | 50 struct tmpfs_node tn; local
53 if (!KVM_READ(VP_TO_TMPFS_NODE(vp), &tn, sizeof(tn))) {
65 fsp->fileid = tn.tn_id;
66 fsp->mode = tn.tn_mode | getftype(vp->v_type);
67 fsp->size = tn.tn_size;
68 switch (tn.tn_type) {
71 fsp->rdev = tn.tn_spec.tn_dev.tn_rdev;
|
| /src/external/lgpl3/gmp/dist/mini-gmp/tests/ |
| t-limbs.c | 35 mp_size_t tn, an, bn; local
43 tn = an + bn;
44 tp = mpz_limbs_write (r, tn);
51 tn = - tn;
53 mpz_limbs_finish (r, tn);
|
| t-mpq_str.c | 205 size_t tn; local
207 tn = mpq_out_str (tmp, (i&1 || base > 36) ? base: -base, a);
208 if (tn != rn)
215 base, (unsigned) rn, (unsigned)tn);
220 tn = fread (bp, 1, rn, tmp);
221 if (tn != rn)
225 (unsigned long) rn, (unsigned long) tn);
|
| t-str.c | 210 size_t tn; local
212 tn = mpz_out_str (tmp, (i&1 || base > 36) ? base: -base, a);
213 if (tn != rn)
219 base, (unsigned) rn, (unsigned)tn);
224 tn = fread (bp, 1, rn, tmp);
225 if (tn != rn)
229 (unsigned long) rn, (unsigned long) tn);
264 size_t tn = mpz_size (a); local
266 assert (tn <= MAXLIMBS);
267 mpn_copyi (t, a->_mp_d, tn);
[all...] |
| /src/sys/arch/vax/boot/boot/ |
| hp.c | 111 unsigned int bn, cn, sn, tn; local
122 tn = sn / hplabel.d_nsectors;
125 cn = sn = tn = 0;
128 HP_WCSR(HP_DA, (tn << 8) | sn);
|
| tmscp.c | 154 u_int i,j,pfnum, mapnr, nsize, bn, cn, sn, tn; local
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| mu_bdiv_q.c | 77 mp_size_t tn, wn; local
94 #define scratch_out (scratch + in + dn + tn) /* mulmod_bnm1_itch(next_size(dn)) */
123 tn = mpn_mulmod_bnm1_next_size (dn);
124 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
125 wn = dn + in - tn; /* number of wrapped limbs */
128 c0 = mpn_sub_n (tp + tn, tp, rp, wn);
159 tn = mpn_mulmod_bnm1_next_size (dn);
160 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
161 wn = dn + in - tn; /* number of wrapped limbs */
164 c0 = mpn_sub_n (tp + tn, tp, rp, wn)
240 mp_size_t qn, in, tn, itch_binvert, itch_out, itches; local
[all...] |
| mu_bdiv_qr.c | 77 mp_size_t tn, wn; local
93 #define scratch_out (scratch + in + tn)/* mulmod_bnm1_itch(next_size(dn)) */
121 tn = mpn_mulmod_bnm1_next_size (dn);
122 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
123 wn = dn + in - tn; /* number of wrapped limbs */
126 c0 = mpn_sub_n (tp + tn, tp, rp, wn);
156 tn = mpn_mulmod_bnm1_next_size (dn);
157 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, qn, scratch_out);
158 wn = dn + qn - tn; /* number of wrapped limbs */
161 c0 = mpn_sub_n (tp + tn, tp, rp, wn)
281 mp_size_t qn, in, tn, itch_binvert, itch_out, itches; local
[all...] |
| mu_div_qr.c | 247 mp_size_t tn, wn; local
250 #define scratch_out (scratch + tn)
292 tn = mpn_mulmod_bnm1_next_size (dn + 1);
293 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
294 wn = dn + in - tn; /* number of wrapped limbs */
298 cy = mpn_sub_1 (tp + wn, tp + wn, tn - wn, cy);
299 cx = mpn_cmp (rp + dn - in, tp + dn, tn - dn) < 0;
|
| mu_divappr_q.c | 174 mp_size_t tn, wn; local
178 #define scratch_out (scratch + dn + tn)
222 tn = mpn_mulmod_bnm1_next_size (dn + 1);
223 mpn_mulmod_bnm1 (tp, tn, dp, dn, qp, in, scratch_out);
224 wn = dn + in - tn; /* number of wrapped limbs */
228 cy = mpn_sub_1 (tp + wn, tp + wn, tn - wn, cy);
229 cx = mpn_cmp (rp + dn - in, tp + dn, tn - dn) < 0;
|
| /src/external/lgpl3/mpfr/dist/src/ |
| cmp2.c | 145 mp_size_t tn; local
148 tn = bn; bn = cn; cn = tn;
|
| frac.c | 35 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) : MPFR_LIMB_ZERO);
132 (mpfr_prec_t) (tn + 1) * GMP_NUMB_BITS,
137 tp[tn] = MPFR_LIMB_HIGHBIT;
|
| round_prec.c | 182 mp_size_t k, k1, tn; local
382 tn = bn;
384 tmp = MPFR_TMP_LIMBS_ALLOC (tn);
403 for (tn = 0; tn + 1 < k1 && cy != 0; tn ++)
404 cy = bp[bn + tn] == MPFR_LIMB_MAX;
433 for (tn = 0; tn + 1 < k1 && cy != 0; tn ++
[all...] |
| rec_sqrt.c | 215 mp_size_t xn, rn, th, ln, tn, sn, ahn, un; local
239 This is sufficient to prove that the upper limb of {t,tn} below is
243 tn = LIMB_SIZE(2 * h + 1 + as);
258 un = xn + (tn - th);
260 limbs where u needs xn+(tn-th) limbs. Since tn can store at least
261 2h bits, and th at most h bits, then tn-th can store at least h bits,
262 thus tn - th >= xn, and reserving the space for u is enough. */
316 limbs, where rn = LIMBS(2h), an=LIMBS(a), and tn = LIMBS(2h+1+as). */
317 t = s + sn - tn; /* pointer to low limb of the high part of t *
[all...] |
| sqr.c | 515 mp_size_t bn, tn; local
562 tn = MPFR_PREC2LIMBS (2 * bq); /* number of limbs of square,
584 tmp += 2 * bn - tn; /* +0 or +1 */
586 mpn_lshift (tmp, tmp, tn, 1); /* tn <= k, so no stack corruption */
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| powm_ui.c | 127 mp_size_t xn, tn, mn, bn; local
207 tn = 2 * xn; tn -= tp[tn - 1] == 0;
208 if (tn < mn)
210 MPN_COPY (xp, tp, tn);
211 xn = tn;
215 mod (tp, tn, mp, mn, &dinv, scratch);
223 tn = xn + bn; tn -= tp[tn - 1] == 0
[all...] |
| oddfac_1.c | 306 mp_limb_t tn; local
317 for (tn = n; ABOVE_THRESHOLD (tn, FAC_DSC_THRESHOLD); s++)
318 tn >>= 1;
323 factors = TMP_SALLOC_LIMBS (1 + tn / FACTORS_PER_LIMB);
324 ASSERT (tn >= FACTORS_PER_LIMB);
333 ASSERT (tn > ODD_DOUBLEFACTORIAL_TABLE_LIMIT + 1);
340 } while (i <= tn);
342 tn >>= 1;
343 } while (tn > ODD_DOUBLEFACTORIAL_TABLE_LIMIT + 1)
[all...] |
| /src/external/mit/libuv/dist/test/ |
| test-thread-name.c | 64 char tn[UV_PTHREAD_MAX_NAMELEN_NP]; local
92 r = uv_thread_getname(&threads[0], tn, sizeof(tn));
98 r = uv_thread_getname(&threads[0], tn, sizeof(tn));
100 ASSERT_STR_EQ(tn, thread_name);
105 r = uv_thread_getname(&threads[0], tn, sizeof(tn));
107 ASSERT_STR_EQ(tn, thread_name);
109 r = uv_thread_getname(&threads[0], tn, 3)
162 char tn[UV_PTHREAD_MAX_NAMELEN_NP]; local
[all...] |
| /src/lib/libcurses/ |
| ins_wstr.c | 138 int width, len, lx, sx, x, y, tx, ty, cw, pcw, newx, tn, w; local
163 tn = n;
169 if (!tn)
212 tn--, width += w;
|
| /src/sys/external/bsd/drm2/dist/drm/i915/gt/ |
| intel_gt_requests.c | 136 struct intel_timeline *tl, *tn; local
147 list_for_each_entry_safe(tl, tn, &timelines->active_list, link) {
176 list_safe_reset_next(tl, tn, link);
190 list_for_each_entry_safe(tl, tn, &free, link)
|
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.threads/ |
| omp-par-scope.c | 136 int tn = omp_get_thread_num (); local
137 omp_set_lock_in_order (tn, &lock);
139 j = 1000 * (tn + 1);
143 printf ("nested_func: tn=%d: i=%d, p=%d, x=%d, j=%d, q=%d, y=%d\n",
144 tn, i, p, x, j, q, y);
|
| /src/external/lgpl3/gmp/dist/mpf/ |
| get_str.c | 127 mp_size_t un, pn, tn; local
213 tn = un + pn;
214 tn -= tp[tn - 1] == 0;
218 MPN_COPY_DECR (tp - off, tp, tn);
220 tn -= off;
223 n_digits_computed = mpn_get_str (tstr, base, tp + off, tn - off);
247 tn = xn - pn + 1;
248 tn -= tp[tn - 1] == 0
[all...] |
| /src/external/lgpl3/gmp/dist/rand/ |
| randlc2x.c | 76 mp_size_t tn, seedn, an; local
100 tn = BITS_TO_LIMBS (m2exp);
101 if (ta <= tn) /* that is, if (ta < tn + 1) */
104 ta = tn + 1;
115 /* t = t + c. NOTE: tn is always >= p->_cn (precondition for __GMPN_ADD);
117 ASSERT (tn >= p->_cn);
118 __GMPN_ADD (cy, tp, tp, tn, p->_cp, p->_cn);
124 MPN_COPY (PTR (p->_mp_seed), tp, tn);
130 tn -= xn
157 mp_size_t tn; local
[all...] |
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.threads/ |
| omp-par-scope.c | 136 int tn = omp_get_thread_num (); local
137 omp_set_lock_in_order (tn, &lock);
139 j = 1000 * (tn + 1);
143 printf ("nested_func: tn=%d: i=%d, p=%d, x=%d, j=%d, q=%d, y=%d\n",
144 tn, i, p, x, j, q, y);
|
| /src/libexec/mail.local/ |
| mail.local.c | 137 char *tn, line[2048]; local
139 tn = strdup(_PATH_LOCTMP);
140 if (!tn)
142 if ((fd = mkstemp(tn)) == -1 || !(fp = fdopen(fd, "w+")))
144 (void)unlink(tn);
145 free(tn);
|
