Searched refs:n1 (Results 1 - 25 of 62) sorted by relevance

123

/haiku-fatelf/src/bin/coreutils/lib/
H A Dmemcmp2.c28 memcmp2 (const char *s1, size_t n1, const char *s2, size_t n2) argument
30 int cmp = memcmp (s1, s2, n1 <= n2 ? n1 : n2);
33 if (n1 < n2)
35 else if (n1 > n2)
H A Dmemcmp2.h35 extern int memcmp2 (const char *s1, size_t n1, const char *s2, size_t n2);
H A Dmpsort.c41 size_t n1 = n / 2; local
42 size_t n2 = n - n1;
44 size_t alim = n1;
45 size_t b = n1;
50 mpsort_with_tmp (base + n1, n2, tmp, cmp);
51 mpsort_with_tmp (base, n1, tmp, cmp);
105 size_t n1 = n / 2; local
106 size_t n2 = n - n1;
109 size_t tlim = n1;
110 size_t b = n1;
[all...]
H A Dmemcoll.c51 char n1 = s1[s1len]; local
82 s1[s1len - 1] = n1;
/haiku-fatelf/src/system/libroot/posix/glibc/arch/generic/
H A Ddivrem.c70 mp_limb_t n1; local
74 n1 = np[nsize - 1];
76 if (n1 >= d)
78 n1 -= d;
84 udiv_qrnnd (qp[i], n1, n1, np[i], d);
88 udiv_qrnnd (qp[i], n1, n1, 0, d);
90 np[0] = n1;
97 mp_limb_t n1, n local
189 mp_limb_t n1, n2; local
[all...]
H A De_remainder.c49 int4 kx,ky,n,nn,n1,m1,l; local
80 n1=ww.i[HIGH_HALF];
86 ww.i[HIGH_HALF]=(n1)?n1+l:n1;
93 ww.i[HIGH_HALF]=n1;
/haiku-fatelf/src/bin/gzip/
H A Dzmore6 n1=''; n2='\c'
8 n1='-n'; n2=''
34 echo $n1 "--More--(Next file: $FILE)$n2"
/haiku-fatelf/src/bin/network/telnet/
H A Dterminal.c126 int n, n0, n1; local
129 if ((n1 = n = ring_full_consecutive(&ttyoring)) > 0) {
146 if (n1 == n && n0 > n) {
147 n1 = n0 - n;
149 n1 = TerminalWrite(ttyoring.bottom, n1);
150 if (n1 > 0)
151 n += n1;
H A Dnetwork.c134 int n, n1; local
140 if ((n1 = n = ring_full_consecutive(&netoring)) > 0) {
175 if ((n1 == n) && ring_full_consecutive(&netoring)) {
/haiku-fatelf/src/bin/bc/lib/
H A Dnumber.c153 _bc_do_compare (n1, n2, use_sign, ignore_last)
154 bc_num n1, n2;
162 if (use_sign && n1->n_sign != n2->n_sign)
164 if (n1->n_sign == PLUS)
171 if (n1->n_len != n2->n_len)
173 if (n1->n_len > n2->n_len)
175 /* Magnitude of n1 > n2. */
176 if (!use_sign || n1->n_sign == PLUS)
183 /* Magnitude of n1 < n2. */
184 if (!use_sign || n1
657 _bc_simp_mul(bc_num n1, int n1len, bc_num n2, int n2len, bc_num *prod, int full_scale) argument
[all...]
H A Dtestmul.c134 int n1, n2; local
171 t1 = timeit (num, num, &n1);
172 permul1 = (float)t1/(float)n1;
184 fprintf (stderr, "n1 = %d :: n2 = %d\n", n1, n2);
219 t1 = timeit (big, num, &n1);
220 permul1 = (float)t1/(float)n1;
232 fprintf (stderr, "n1 = %d :: n2 = %d\n", n1, n2);
/haiku-fatelf/src/libs/agg/src/
H A Dagg_bspline.cpp89 int i, k, n1; local
100 n1 = 3 * m_num;
102 pod_array<double> al(n1);
105 for(k = 0; k < n1; k++)
113 n1 = m_num - 1;
117 for(k = 1; k < n1; k++)
128 for(k = 1; k < n1; k++)
135 m_am[n1] = 0.0;
136 al[n1 - 1] = s[n1
[all...]
/haiku-fatelf/src/libs/print/libgutenprint/src/main/
H A Descp2-papers.c395 stp_mxml_node_t *node, *n1; local
406 n1 = stp_mxmlFindElement(node, node, "CD", NULL, NULL, STP_MXML_DESCEND);
407 if (n1)
409 n1 = stp_mxmlFindElement(node, node, "RollFeed", NULL, NULL, STP_MXML_DESCEND);
410 if (n1)
413 if (stp_mxmlFindElement(n1, n1, "CutAll", NULL, NULL, STP_MXML_DESCEND))
415 if (stp_mxmlFindElement(n1, n1, "CutLast", NULL, NULL, STP_MXML_DESCEND))
417 if (stp_mxmlFindElement(n1, n
[all...]
/haiku-fatelf/src/bin/bc/h/
H A Dnumber.h120 _PROTOTYPE(int bc_compare, (bc_num n1, bc_num n2));
128 _PROTOTYPE(void bc_add, (bc_num n1, bc_num n2, bc_num *result, int scale_min));
130 _PROTOTYPE(void bc_sub, (bc_num n1, bc_num n2, bc_num *result, int scale_min));
132 _PROTOTYPE(void bc_multiply, (bc_num n1, bc_num n2, bc_num *prod, int scale));
134 _PROTOTYPE(int bc_divide, (bc_num n1, bc_num n2, bc_num *quot, int scale));
/haiku-fatelf/headers/cpp/std/
H A Dbastring.cc118 replace (size_type pos1, size_type n1, argument
123 if (pos1 == 0 && n1 >= length () && pos2 == 0 && n2 >= len2)
131 return replace (pos1, n1, _str.data () + pos2, n2);
153 replace (size_type pos, size_type n1, const charT* s, size_type n2) argument
157 if (n1 > len - pos)
158 n1 = len - pos;
159 LENGTHERROR (len - n1 > max_size () - n2);
160 size_t newlen = len - n1 + n2;
166 p->copy (pos + n2, data () + pos + n1, len - (pos + n1));
189 replace(size_type pos, size_type n1, size_type n2, charT c) argument
[all...]
/haiku-fatelf/src/system/libroot/posix/glibc/stdlib/
H A Dgmp-impl.h248 mp_limb_t n2, n10, n1, nadj, q1; \
252 n1 = ((mp_limb_signed_t) n10 >> (BITS_PER_MP_LIMB - 1)); \
253 nadj = n10 + (n1 & (dnorm)); \
254 umul_ppmm (_xh, _xl, di, n2 - n1); \
267 mp_limb_t n2, n10, n1, nadj, q1; \
271 n1 = ((mp_limb_signed_t) n10 >> (BITS_PER_MP_LIMB - 1)); \
272 nadj = n10 + (n1 & (d)); \
273 umul_ppmm (_xh, _xl, di, n2 - n1); \
H A Dlonglong.h124 #define udiv_qrnnd(q, r, n1, n0, d) \
126 (q) = __udiv_qrnnd (&__r, (n1), (n0), (d)); \
325 #define sdiv_qrnnd(q, r, n1, n0, d) \
330 __xx.__i.__h = n1; __xx.__i.__l = n0; \
361 #define udiv_qrnnd(q, r, n1, n0, dv) \
366 "1" ((USItype) (n1)), \
453 #define udiv_qrnnd(q, r, n1, n0, d) \
458 "1" ((USItype) (n1)), \
461 #define sdiv_qrnnd(q, r, n1, n0, d) \
466 "1" ((USItype) (n1)), \
[all...]
H A Dstrtod.c1337 mp_limb_t d0, d1, n0, n1; variable
1351 n1 = 0;
1371 n1 = num[0];
1377 n1 = num[1];
1385 if (n1 == d1)
1395 add_ssaaaa (n1, n0, r - d0, 0, 0, d0);
1398 n1 = d0 - (d0 != 0);
1403 udiv_qrnnd (quot, r, n1, n0, d1);
1404 umul_ppmm (n1, n0, d0, quot);
1408 if (n1 >
1431 mp_limb_t cy, dX, d1, n0, n1; variable
[all...]
/haiku-fatelf/src/add-ons/accelerants/s3/
H A Dtrio64_mode.cpp46 for (uint8 n1 = min_n1 + 2; n1 <= max_n1 + 2; n1++) {
47 int m = (int)(ffreq * n1 * (1 << n2) + 0.5);
51 double div = (double)(m) / (double)(n1);
59 best_n1 = n1;
H A Dtrio64_init.cpp127 uint8 n1 = n & 0x1f; local
129 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
/haiku-fatelf/src/libs/util/
H A Dlogin_cap.c435 rmultiply(u_quad_t n1, u_quad_t n2) argument
443 if (n1 == 0 || n2 == 0)
445 if (n1 == 1)
448 return n1;
465 for (b1 = bpw; (((u_quad_t)1 << (b1-1)) & n1) == 0; --b1)
476 * h1 = n1 & ~1
478 * l1 = n1 & 1
494 m = (n1 >> 1) * (n2 >> 1);
501 r = (n1 & n2 & 1)
502 + (n2 & 1) * (n1
[all...]
/haiku-fatelf/src/bin/patch/
H A Dquotearg.c338 int n1 = n + 1; local
339 size_t s = n1 * sizeof (struct slotvec);
340 if (! (0 < n1 && n1 == s / sizeof (struct slotvec)))
343 memset (slotvec + nslots, 0, (n1 - nslots) * sizeof (struct slotvec));
/haiku-fatelf/src/bin/diffutils/src/
H A Dio.c579 size_t n0, n1;
606 n1 = filevec[1].buffered;
610 p0 = p1 += n1;
616 if (n0 < n1)
619 p1[n1] = ~p0[n1];
637 (buffer1 + n1 - filevec[1].missing_newline < p1)))
657 p1 = buffer1 + n1;
667 beg0 = filevec[0].prefix_end + (n0 < n1 ? 0 : n0 - n1);
573 size_t n0, n1; local
[all...]
/haiku-fatelf/src/add-ons/media/plugins/ffmpeg/libbz2/
H A Dhuffman.c72 Int32 nNodes, nHeap, n1, n2, i, j, k; local
101 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
104 parent[n1] = parent[n2] = nNodes;
105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
/haiku-fatelf/src/bin/sharutils/src/
H A Duudecode.c278 int mode, n1; local
332 n1 = strlen (p);
333 outname = (char *) alloca ((size_t) (n + n1 + 2));
334 memcpy (outname + n + 1, p, (size_t) (n1 + 1));

Completed in 322 milliseconds

123