Searched refs:i2 (Results 1 - 24 of 24) sorted by relevance

/haiku/src/system/libroot/posix/musl/math/
H A D__fpclassifyl.c37 return u.i2.lo | u.i2.hi ? FP_SUBNORMAL : FP_ZERO;
39 return u.i2.lo | u.i2.hi ? FP_NAN : FP_INFINITE;
H A Dnextafterl.c59 ux.i2.lo++;
60 if (ux.i2.lo == 0)
61 ux.i2.hi++;
63 if (ux.i2.lo == 0)
64 ux.i2.hi--;
65 ux.i2.lo--;
H A Dfmodl.c63 xhi = (ux.i2.hi & -1ULL>>16) | 1ULL<<48;
64 yhi = (uy.i2.hi & -1ULL>>16) | 1ULL<<48;
65 xlo = ux.i2.lo;
66 ylo = uy.i2.lo;
93 ux.i2.hi = xhi;
94 ux.i2.lo = xlo;
H A Dremquol.c70 xhi = (ux.i2.hi & -1ULL>>16) | 1ULL<<48;
71 yhi = (uy.i2.hi & -1ULL>>16) | 1ULL<<48;
72 xlo = ux.i2.lo;
73 ylo = ux.i2.lo;
102 ux.i2.hi = xhi;
103 ux.i2.lo = xlo;
H A Dexp2l.c604 i0 = u.i2.lo + TBLSIZE / 2;
/haiku/src/system/libroot/posix/glibc/arch/generic/
H A Ds_catanh.c61 double i2, num, den; local
63 i2 = __imag__ x * __imag__ x;
66 num = i2 + num * num;
69 den = i2 + den * den;
73 den = 1 - __real__ x * __real__ x - i2;
H A Ds_catanhl.c61 long double i2, num, den; local
63 i2 = __imag__ x * __imag__ x;
66 num = i2 + num * num;
69 den = i2 + den * den;
73 den = 1 - __real__ x * __real__ x - i2;
H A Ds_catanhf.c61 float i2, num, den; local
63 i2 = __imag__ x * __imag__ x;
66 num = i2 + num * num;
69 den = i2 + den * den;
73 den = 1 - __real__ x * __real__ x - i2;
H A Dmpa.c430 int i, i1, i2, j, k, k2; local
441 if (k > p) {i1=k-p; i2=p+1; }
442 else {i1=1; i2=k; }
443 for (i=i1,j=i2-1; i<i2; i++,j--) Z[k] += X[i]*Y[j];
/haiku/src/system/boot/platform/openfirmware/arch/sparc/
H A Darch_start_kernel.S21 // - Kernel stack top in i2
24 sub %i2, 2047, %sp // apply stack bias
/haiku/headers/posix/arch/sparc64/
H A Dsignal.h43 ulong i2; member in struct:vregs
/haiku/src/libs/iconv/
H A Dcp1255.h189 unsigned int i1, i2; local
202 i2 = i1 + cp1255_comp_table[k].len-1;
204 && last_wc <= cp1255_comp_table_data[i2].base) {
207 i = (i1+i2)>>1;
213 i2 = i;
218 i = i2;
330 unsigned int i2 = sizeof(cp1255_decomp_table)/sizeof(cp1255_decomp_table[0])-1; local
332 && wc <= cp1255_decomp_table[i2].composed) {
335 /* Here i2 - i1 > 0. */
336 i = (i1+i2)>>
[all...]
H A Dcp1258.h92 unsigned int i1, i2; local
102 i2 = i1 + viet_comp_table[k].len-1;
104 && last_wc <= viet_comp_table_data[i2].base) {
107 i = (i1+i2)>>1;
113 i2 = i;
118 i = i2;
239 unsigned int i2 = sizeof(viet_decomp_table)/sizeof(viet_decomp_table[0])-1; local
241 && wc <= viet_decomp_table[i2].composed) {
244 /* Here i2 - i1 > 0. */
245 i = (i1+i2)>>
[all...]
H A Dtcvn.h97 unsigned int i1, i2; local
107 i2 = i1 + viet_comp_table[k].len-1;
109 && last_wc <= viet_comp_table_data[i2].base) {
112 i = (i1+i2)>>1;
118 i2 = i;
123 i = i2;
241 unsigned int i2 = sizeof(viet_decomp_table)/sizeof(viet_decomp_table[0])-1; local
243 && wc <= viet_decomp_table[i2].composed) {
246 /* Here i2 - i1 > 0. */
247 i = (i1+i2)>>
[all...]
/haiku/headers/cpp/std/
H A Dbastring.h305 basic_string& replace (iterator i1, iterator i2, const basic_string& str) argument
306 { return replace (i1 - ibegin (), i2 - i1, str); }
307 basic_string& replace (iterator i1, iterator i2, const charT* s, size_type n) argument
308 { return replace (i1 - ibegin (), i2 - i1, s, n); }
309 basic_string& replace (iterator i1, iterator i2, const charT* s) argument
310 { return replace (i1 - ibegin (), i2 - i1, s); }
311 basic_string& replace (iterator i1, iterator i2, size_type n, charT c) argument
312 { return replace (i1 - ibegin (), i2 - i1, n, c); }
315 basic_string& replace(iterator i1, iterator i2,
318 basic_string& replace(iterator i1, iterator i2,
459 replace(iterator i1, iterator i2, InputIterator j1, InputIterator j2) argument
[all...]
/haiku/src/libs/mapm/
H A Dmapm_fpf.c251 int places, i2, ii, jj, kk, xp, dl, numb; local
362 i2 = ii; /* save for later */
401 for (kk=0; kk < i2; kk++)
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c1043 int i1, i2, is, id, delta, sbase;
1063 i2 = src2->nelem - 1;
1067 if (src1->elems[i1] == src2->elems[i2])
1076 if (--i1 < 0 || --i2 < 0)
1081 else if (src1->elems[i1] < src2->elems[i2])
1083 if (--i2 < 0)
1134 int i1, i2, id;
1152 for (i1 = i2 = id = 0 ; i1 < src1->nelem && i2 < src2->nelem ;)
1154 if (src1->elems[i1] > src2->elems[i2])
1041 int i1, i2, is, id, delta, sbase; local
1132 int i1, i2, id; local
[all...]
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Daddmul_1.S35 sub %g0,%i2,%o7
H A Dmul_1.S36 sub %g0,%i2,%o7
H A Dsubmul_1.S34 sub %g0,%i2,%o7
/haiku/src/system/libroot/posix/musl/internal/
H A Dlibm.h43 } i2; member in union:ldshape
57 } i2; member in union:ldshape
/haiku/src/kits/tracker/
H A DNavMenu.cpp714 BNavMenu::CompareFolderNamesFirstOne(const BMenuItem* i1, const BMenuItem* i2) argument
716 ThrowOnAssert(i1 != NULL && i2 != NULL);
719 const ModelMenuItem* item2 = dynamic_cast<const ModelMenuItem*>(i2);
726 return strcasecmp(i1->Label(), i2->Label());
731 BNavMenu::CompareOne(const BMenuItem* i1, const BMenuItem* i2) argument
733 ThrowOnAssert(i1 != NULL && i2 != NULL);
735 return strcasecmp(i1->Label(), i2->Label());
/haiku/src/bin/rc/
H A Dparser.y1321 int32 i2 = *((int32*) op2.ptr);
1326 out = make_int(i1 + i2);
1329 out = make_int(i1 - i2);
1332 out = make_int(i1 * i2);
1336 if (i2 == 0)
1339 out = make_int(i1 / i2);
1343 if (i2 == 0)
1346 out = make_int(i1 % i2);
1350 out = make_int(i1 | i2);
1353 out = make_int(i1 ^ i2);
[all...]
/haiku/src/add-ons/screen_savers/ifs/
H A DIFS.cpp69 static int i2; variable
75 int ret = a[i1] + a[i2];
80 if (++i2 >= VECTOR_SIZE)
81 i2 = 0;
106 i2 = (i1 + 24) % VECTOR_SIZE;

Completed in 153 milliseconds