Searched refs:i1 (Results 1 - 14 of 14) sorted by relevance

/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Daddmul_1.S40 sub %i1,%o7,%o3
55 mulx %i3,%i0,%i1 ! mid-1 product
59 add %i1,%i0,%i1 ! ...and add it to the mid-1 product
60 addcc %i1,%l2,%i1 ! add mid products
63 sllx %i1,32,%i0 ! align low bits of mid product
67 srlx %i1,32,%i1 ! extract high bits of mid product...
69 add %i5,%i1,
[all...]
H A Dmul_1.S38 sub %i1,%g5,%o3
57 mulx %i3,%i0,%i1 ! mid-1 product
61 add %i1,%i0,%i1 ! ...and add it to the mid-1 product
62 addcc %i1,%l2,%i1 ! add mid products
66 sllx %i1,32,%i0 ! align low bits of mid product
69 srlx %i1,32,%i1 ! extract high bits of mid product...
70 add %i5,%i1,
[all...]
H A Dsubmul_1.S39 sub %i1,%o7,%o3
54 mulx %i3,%i0,%i1 ! mid-1 product
58 add %i1,%i0,%i1 ! ...and add it to the mid-1 product
59 addcc %i1,%l2,%i1 ! add mid products
62 sllx %i1,32,%i0 ! align low bits of mid product
66 srlx %i1,32,%i1 ! extract high bits of mid product...
68 add %i5,%i1,
[all...]
/haiku/src/system/boot/platform/openfirmware/arch/sparc/
H A Darch_start_kernel.S20 // - Kernel entry in i1
34 jmpl %i1, %o7
/haiku/src/libs/iconv/
H A Dcp1255.h189 unsigned int i1, i2; local
201 i1 = cp1255_comp_table[k].idx;
202 i2 = i1 + cp1255_comp_table[k].len-1;
203 if (last_wc >= cp1255_comp_table_data[i1].base
207 i = (i1+i2)>>1;
211 if (i1 == i)
215 if (i1 != i)
216 i1 = i;
329 unsigned int i1 = 0; local
331 if (wc >= cp1255_decomp_table[i1]
[all...]
H A Dcp1258.h92 unsigned int i1, i2; local
101 i1 = viet_comp_table[k].idx;
102 i2 = i1 + viet_comp_table[k].len-1;
103 if (last_wc >= viet_comp_table_data[i1].base
107 i = (i1+i2)>>1;
111 if (i1 == i)
115 if (i1 != i)
116 i1 = i;
238 unsigned int i1 = 0; local
240 if (wc >= viet_decomp_table[i1]
[all...]
H A Dtcvn.h97 unsigned int i1, i2; local
106 i1 = viet_comp_table[k].idx;
107 i2 = i1 + viet_comp_table[k].len-1;
108 if (last_wc >= viet_comp_table_data[i1].base
112 i = (i1+i2)>>1;
116 if (i1 == i)
120 if (i1 != i)
121 i1 = i;
240 unsigned int i1 = 0; local
242 if (wc >= viet_decomp_table[i1]
[all...]
/haiku/headers/posix/arch/sparc64/
H A Dsignal.h42 ulong i1; member in struct:vregs
/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, iterato argument
459 replace(iterator i1, iterator i2, InputIterator j1, InputIterator j2) argument
[all...]
/haiku/src/system/libroot/posix/glibc/regex/
H A Dregex_internal.c1043 int i1, i2, is, id, delta, sbase;
1062 i1 = src1->nelem - 1;
1067 if (src1->elems[i1] == src2->elems[i2])
1070 while (id >= 0 && dest->elems[id] > src1->elems[i1])
1073 if (id < 0 || dest->elems[id] != src1->elems[i1])
1074 dest->elems[--sbase] = src1->elems[i1];
1076 if (--i1 < 0 || --i2 < 0)
1081 else if (src1->elems[i1] < src2->elems[i2])
1088 if (--i1 < 0)
1134 int i1, i
1041 int i1, i2, is, id, delta, sbase; local
1132 int i1, i2, id; local
[all...]
/haiku/src/add-ons/screen_savers/ifs/
H A DIFS.cpp68 static int i1; variable
75 int ret = a[i1] + a[i2];
76 a[i1] = ret;
77 if (++i1 >= VECTOR_SIZE)
78 i1 = 0;
105 i1 = a[0] % VECTOR_SIZE;
106 i2 = (i1 + 24) % VECTOR_SIZE;
/haiku/src/kits/tracker/
H A DNavMenu.cpp714 BNavMenu::CompareFolderNamesFirstOne(const BMenuItem* i1, const BMenuItem* i2) argument
716 ThrowOnAssert(i1 != NULL && i2 != NULL);
718 const ModelMenuItem* item1 = dynamic_cast<const ModelMenuItem*>(i1);
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/system/libroot/posix/glibc/arch/generic/
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/bin/rc/
H A Dparser.y1320 int32 i1 = *((int32*) op1.ptr);
1326 out = make_int(i1 + i2);
1329 out = make_int(i1 - i2);
1332 out = make_int(i1 * i2);
1339 out = make_int(i1 / i2);
1346 out = make_int(i1 % i2);
1350 out = make_int(i1 | i2);
1353 out = make_int(i1 ^ i2);
1356 out = make_int(i1 & i2);

Completed in 120 milliseconds