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

/haiku/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...]
/haiku/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/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/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...]
H A Dbastring.h296 basic_string& replace (size_type pos1, size_type n1, const basic_string& str,
298 basic_string& replace (size_type pos, size_type n1, const charT* s,
300 basic_string& replace (size_type pos, size_type n1, const charT* s) argument
301 { return replace (pos, n1, s, traits::length (s)); }
302 basic_string& replace (size_type pos, size_type n1, size_type n2, charT c);
468 size_type n1 = i2 - i1; local
472 if (n1 > len - pos)
473 n1 = len - pos;
474 LENGTHERROR (len - n1 > max_size () - n2);
475 size_t newlen = len - n1
[all...]
/haiku/3rdparty/kallisti5/
H A DvalidateRepoFile16 HTTP_STATUS=$(curl -s -I -L "$1" | head -n1 | awk '{ print $2 }')
/haiku/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)); \
340 #define sdiv_qrnnd(q, r, n1, n0, d) \
345 __xx.__i.__h = n1; __xx.__i.__l = n0; \
376 #define udiv_qrnnd(q, r, n1, n0, dv) \
381 "1" ((USItype) (n1)), \
468 #define udiv_qrnnd(q, r, n1, n0, d) \
473 "1" ((USItype) (n1)), \
476 #define sdiv_qrnnd(q, r, n1, n0, d) \
481 "1" ((USItype) (n1)), \
[all...]
H A Dstrtod.c1354 mp_limb_t d0, d1, n0, n1; variable
1368 n1 = 0;
1388 n1 = num[0];
1394 n1 = num[1];
1402 if (n1 == d1)
1412 add_ssaaaa (n1, n0, r - d0, 0, 0, d0);
1415 n1 = d0 - (d0 != 0);
1420 udiv_qrnnd (quot, r, n1, n0, d1);
1421 umul_ppmm (n1, n0, d0, quot);
1425 if (n1 >
1448 mp_limb_t cy, dX, d1, n0, n1; variable
[all...]
/haiku/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;
H A Dvirge_init.cpp204 uint8 n1 = n & 0x1f; local
206 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
H A Dsavage_mode.cpp478 for (uint8 n1 = min_n1 + 2; n1 <= max_n1 + 2; n1++) {
479 int m = (int)(ffreq * n1 * (1 << n2) + 0.5);
483 double div = (double)(m) / (double)(n1);
491 best_n1 = n1;
H A Dsavage_init.cpp285 uint8 n1 = n & 0x1f; local
287 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
H A Dvirge_mode.cpp215 for (uint8 n1 = min_n1 + 2; n1 <= max_n1 + 2; n1++) {
216 int m = (int)(ffreq * n1 * (1 << n2) + 0.5) ;
220 double div = (double)(m) / (double)(n1);
228 best_n1 = n1;
/haiku/src/libs/libtelnet/
H A Dpk.c246 int n1,n2,op; local
253 n1 = in[op] - 'A' + 10;
255 n1 = in[op] - '0';
260 buf[l] = n1*16 +n2;
/haiku/src/tests/kits/storage/
H A DNodeTest.cpp1125 // n1 and n2 should both be uninitialized. y1a and y1b should be initialized
1128 NodeTest::EqualityTest(BNode &n1, BNode &n2, BNode &y1a, BNode &y1b, BNode &y2) { argument
1129 CPPUNIT_ASSERT( n1 == n2 );
1130 CPPUNIT_ASSERT( !(n1 != n2) );
1131 CPPUNIT_ASSERT( n1 != y2 );
1132 CPPUNIT_ASSERT( !(n1 == y2) );
1141 CPPUNIT_ASSERT( n1 == n1 );
1142 CPPUNIT_ASSERT( !(n1 != n1) );
1151 BNode n1, n2, y1a("/boot"), y1b("/boot"), y2("/"); local
1160 BNode n1, n2, y1a("/boot"), y1b("/boot"), y2("/"); local
[all...]
H A DNodeTest.h56 void EqualityTest(BNode &n1, BNode &n2, BNode &y1a, BNode &y1b, BNode &y2);
/haiku/src/add-ons/accelerants/nvidia/engine/
H A Dnv_dac2.c234 uint8 m1, n1, p1; local
242 n1 = (dividers1 & 0x0000ff00) >> 8;
244 LOG(2,("DAC2: divider1 settings ($%08x): M1=%d, N1=%d, P1=%d\n", dividers1, m1, n1, p1));
260 f_vco = (f_phase * n1 * n2);
H A Dnv_dac.c273 uint8 m1, n1, p1; local
281 n1 = (dividers1 & 0x0000ff00) >> 8;
283 LOG(2,("DAC: divider1 settings ($%08x): M1=%d, N1=%d, P1=%d\n", dividers1, m1, n1, p1));
299 f_vco = (f_phase * n1 * n2);
/haiku/src/libs/glut/
H A Dglut_shapes.c374 recorditem(GLfloat * n1, GLfloat * n2, GLfloat * n3, argument
379 DIFF3(n1, n2, q0);
386 glVertex3fv(n1);
/haiku/src/system/libroot/posix/stdlib/
H A Dstrtod.c687 int i, k1, n, n1; local
697 n1 = n + b->wds + 1;
698 for (i = b->maxwds; n1 > i; i <<= 1)
715 ++n1;
726 ++n1;
733 b1->wds = n1 - 1;

Completed in 128 milliseconds