/haiku-fatelf/src/bin/coreutils/lib/ |
H A D | memcmp2.c | 28 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 D | memcmp2.h | 30 /* Compare the memory regions S1 = [s1..s1+N1-1], S2 = [s2..s2+n2-1], 35 extern int memcmp2 (const char *s1, size_t n1, const char *s2, size_t n2);
|
H A D | mpsort.c | 42 size_t n2 = n - n1; local 50 mpsort_with_tmp (base + n1, n2, tmp, cmp); 106 size_t n2 = n - n1; local 115 mpsort_with_tmp (base + n1, n2, tmp, cmp);
|
H A D | memcoll.c | 52 char n2 = s2[s2len]; local 83 s2[s2len - 1] = n2;
|
/haiku-fatelf/src/bin/gzip/ |
H A D | zmore | 6 n1=''; n2='\c' 8 n1='-n'; n2='' 34 echo $n1 "--More--(Next file: $FILE)$n2"
|
/haiku-fatelf/src/bin/bc/lib/ |
H A D | number.c | 153 _bc_do_compare (n1, n2, use_sign, ignore_last) 154 bc_num n1, n2; 162 if (use_sign && n1->n_sign != n2->n_sign) 171 if (n1->n_len != n2->n_len) 173 if (n1->n_len > n2->n_len) 175 /* Magnitude of n1 > n2. */ 183 /* Magnitude of n1 < n2. */ 193 count = n1->n_len + MIN (n1->n_scale, n2->n_scale); 195 n2ptr = n2->n_value; 203 if (ignore_last && count == 1 && n1->n_scale == n2 657 _bc_simp_mul(bc_num n1, int n1len, bc_num n2, int n2len, bc_num *prod, int full_scale) argument [all...] |
H A D | testmul.c | 134 int n1, n2; local 175 t2 = timeit (num, num, &n2); 176 permul2 = (float)t2/(float)n2; 184 fprintf (stderr, "n1 = %d :: n2 = %d\n", n1, n2); 223 t2 = timeit (big, num, &n2); 224 permul2 = (float)t2/(float)n2; 232 fprintf (stderr, "n1 = %d :: n2 = %d\n", n1, n2);
|
/haiku-fatelf/src/system/libroot/posix/glibc/arch/generic/ |
H A D | divrem.c | 97 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-fatelf/src/libs/ncurses/ncurses/base/ |
H A D | lib_instr.c | 68 int n2; local 75 n2 = getcchar(cell, 0, 0, 0, 0); 76 if (n2 > 0 77 && (wch = typeCalloc(wchar_t, (unsigned) n2 + 1)) != 0) {
|
/haiku-fatelf/src/bin/bc/h/ |
H A D | number.h | 120 _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 D | bastring.cc | 119 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...] |
/haiku-fatelf/src/system/libroot/posix/glibc/stdlib/ |
H A D | gmp-impl.h | 248 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-fatelf/src/add-ons/accelerants/s3/ |
H A D | trio64_mode.cpp | 45 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 D | trio64_init.cpp | 128 uint8 n2 = (n >> 5) & 0x03; local 129 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
|
H A D | virge_init.cpp | 205 uint8 n2 = (n >> 5) & 0x03; local 206 si.mclk = ((1431818 * (m + 2)) / (n1 + 2) / (1 << n2) + 50) / 100;
|
H A D | savage_mode.cpp | 477 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;
|
/haiku-fatelf/src/libs/util/ |
H A D | login_cap.c | 435 rmultiply(u_quad_t n1, u_quad_t n2) argument 443 if (n1 == 0 || n2 == 0) 446 return n2; 447 if (n2 == 1) 467 for (b2 = bpw; (((u_quad_t)1 << (b2-1)) & n2) == 0; --b2) 477 * h2 = n2 & ~1 479 * l2 = n2 & 1 494 m = (n1 >> 1) * (n2 >> 1); 501 r = (n1 & n2 & 1) 502 + (n2 [all...] |
/haiku-fatelf/src/add-ons/media/plugins/ffmpeg/libbz2/ |
H A D | huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; local 102 n2 = 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/libs/libtelnet/ |
H A D | pk.c | 246 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-fatelf/src/system/libroot/posix/stdio/ |
H A D | vfprintf.c | 164 register int n, m, n2; /* handy integers (short term usage) */ local 265 n2 = 0; \ 268 n2 = 10 * n2 + to_digit(*cp); \ 277 nextarg = n2; \ 804 register int n, n2; /* handy integer (short term usage) */ local 834 n2 = 0; \ 837 n2 = 10 * n2 + to_digit(*cp); \ 842 nextarg = n2; \ [all...] |
/haiku-fatelf/src/add-ons/accelerants/nvidia/engine/ |
H A D | nv_dac2.c | 235 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 D | nv_dac.c | 274 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-fatelf/src/libs/ncurses/ncurses/tinfo/ |
H A D | comp_parse.c | 164 _nc_entry_match(char *n1, char *n2) 171 n2 = force_bar(nc2, n2); 174 for (qstart = n2; (qend = strchr(qstart, '|')); qstart = qend + 1)
|
/haiku-fatelf/src/add-ons/translators/exr/openexr/imath/ |
H A D | ImathLineAlgo.h | 102 T n2 = d2w - d1d2 * d1w; local 108 abs (n2) < limits<T>::max() * absD)) 111 point2 = line2 (n2 / d);
|
/haiku-fatelf/src/tests/kits/storage/ |
H A D | NodeTest.h | 56 void EqualityTest(BNode &n1, BNode &n2, BNode &y1a, BNode &y1b, BNode &y2);
|