Searched refs:n2 (Results 1 - 18 of 18) sorted by relevance

/haiku/src/system/libroot/posix/glibc/arch/generic/
H A Ddivrem.c97 mp_limb_t n1, n0, n2; local
145 n2 = np[0];
147 if (n1 > r || (n1 == r && n0 > n2))
159 sub_ddmmss (n1, n0, r, n2, n1, n0);
189 mp_limb_t n1, n2; local
195 n2 = np[dsize];
199 n2 = np[dsize - 1];
232 if (n2 != cy_limb)
/haiku/headers/cpp/std/
H A Dbastring.cc119 const basic_string& _str, size_type pos2, size_type n2)
123 if (pos1 == 0 && n1 >= length () && pos2 == 0 && n2 >= len2)
128 if (n2 > len2 - pos2)
129 n2 = len2 - pos2;
131 return replace (pos1, n1, _str.data () + pos2, n2);
153 replace (size_type pos, size_type n1, const charT* s, size_type n2) argument
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));
167 p->copy (pos, s, n2);
118 replace(size_type pos1, size_type n1, const basic_string& _str, size_type pos2, size_type n2) argument
189 replace(size_type pos, size_type n1, size_type n2, charT c) argument
[all...]
H A Dbastring.h297 size_type pos2 = 0, size_type n2 = npos);
299 size_type n2);
302 basic_string& replace (size_type pos, size_type n1, size_type n2, charT c);
424 int compare (size_type pos, size_type n, const charT* s, size_type n2) const
425 { if (n > n2) n = n2; return compare(s, pos, n); }
469 size_type n2 = j2 - j1; local
474 LENGTHERROR (len - n1 > max_size () - n2);
475 size_t newlen = len - n1 + n2;
481 p->copy (pos + n2, dat
[all...]
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dgmp-impl.h248 mp_limb_t n2, n10, n1, nadj, q1; \
250 n2 = ((nh) << (BITS_PER_MP_LIMB - (lgup))) + ((nl) >> 1 >> (l - 1));\
254 umul_ppmm (_xh, _xl, di, n2 - n1); \
256 q1 = ~(n2 + _xh); \
267 mp_limb_t n2, n10, n1, nadj, q1; \
269 n2 = (nh); \
273 umul_ppmm (_xh, _xl, di, n2 - n1); \
275 q1 = ~(n2 + _xh); \
/haiku/src/add-ons/accelerants/s3/
H A Dtrio64_mode.cpp45 for (uint8 n2 = min_n2; n2 <= max_n2; n2++) {
47 int m = (int)(ffreq * n1 * (1 << n2) + 0.5);
53 double diff = ffreq - div / (1 << n2);
60 best_n2 = n2;
H A Dtrio64_init.cpp128 uint8 n2 = (n >> 5) & 0x03; local
129 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
H A Dvirge_init.cpp205 uint8 n2 = (n >> 5) & 0x03; local
206 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
H A Dsavage_mode.cpp477 for (uint8 n2 = min_n2; n2 <= max_n2; n2++) {
479 int m = (int)(ffreq * n1 * (1 << n2) + 0.5);
485 double diff = ffreq - div / (1 << n2);
492 best_n2 = n2;
H A Dsavage_init.cpp286 uint8 n2 = (n >> 5) & 0x03; local
287 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
H A Dvirge_mode.cpp214 for (uint8 n2 = min_n2; n2 <= max_n2; n2++) {
216 int m = (int)(ffreq * n1 * (1 << n2) + 0.5) ;
222 double diff = ffreq - div / (1 << n2);
229 best_n2 = n2;
/haiku/src/add-ons/accelerants/intel_extreme/
H A Dpll.cpp619 unsigned p, n2, r2; member in struct:hsw_wrpll_rnp
697 unsigned int r2, unsigned int n2,
706 best->n2 = n2;
716 * abs(freq2k - (LC_FREQ_2K * n2/(p * r2))) /
727 diff = AbsSubtr64((uint64)freq2k * p * r2, LC_FREQ_2K * n2);
729 LC_FREQ_2K * best->n2);
737 best->n2 = n2;
743 best->n2
696 hsw_wrpll_update_rnp(uint64 freq2k, unsigned int budget, unsigned int r2, unsigned int n2, unsigned int p, struct hsw_wrpll_rnp *best) argument
761 unsigned p, n2, r2; local
[all...]
/haiku/src/libs/libtelnet/
H A Dpk.c246 int n1,n2,op; local
257 n2 = in[op+1] - 'A' + 10;
259 n2 = in[op+1] - '0';
260 buf[l] = n1*16 +n2;
/haiku/src/add-ons/accelerants/nvidia/engine/
H A Dnv_dac2.c235 uint8 m2 = 1, n2 = 1; local
251 n2 = (dividers2 & 0x0000ff00) >> 8;
252 LOG(2,("DAC2: divider2 is enabled, settings ($%08x): M2=%d, N2=%d\n", dividers2, m2, n2));
260 f_vco = (f_phase * n1 * n2);
H A Dnv_dac.c274 uint8 m2 = 1, n2 = 1; local
290 n2 = (dividers2 & 0x0000ff00) >> 8;
291 LOG(2,("DAC: divider2 is enabled, settings ($%08x): M2=%d, N2=%d\n", dividers2, m2, n2));
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);
380 DIFF3(n2, n3, q1);
387 glVertex3fv(n2);
/haiku/src/tests/kits/storage/
H A DNodeTest.h56 void EqualityTest(BNode &n1, BNode &n2, BNode &y1a, BNode &y1b, BNode &y2);
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) );
1134 CPPUNIT_ASSERT( y1a != n2 );
1135 CPPUNIT_ASSERT( !(y1a == n2) );
1151 BNode n1, n2, y1a("/boot"), y1b("/boot"), y2("/"); local
1153 EqualityTest(n1, n2, y1a, y1b, y2);
1160 BNode n1, n2, y1a("/boot"), y1b("/boot"), y2("/"); local
1165 n2
[all...]
/haiku/src/libs/compat/freebsd_network/
H A Dfbsd_uipc_mbuf.c1346 struct mbuf *m, *n, *n2, **prev; local
1386 if ((n2 = n->m_next) != NULL &&
1387 n->m_len + n2->m_len < MCLBYTES) {
1392 bcopy(mtod(n2, void *), mtod(m, char *) + n->m_len,
1393 n2->m_len);
1394 m->m_len = n->m_len + n2->m_len;
1395 m->m_next = n2->m_next;
1398 m_free(n2);

Completed in 251 milliseconds