Searched refs:index1 (Results 1 - 10 of 10) sorted by relevance

/haiku-fatelf/src/system/libroot/posix/glibc/locale/
H A Dcoll-lookup.c32 uint32_t index1 = wc >> shift1; local
34 if (index1 < bound)
36 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1];
63 uint32_t index1 = wc >> shift1; local
65 if (index1 < bound)
67 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1];
/haiku-fatelf/src/system/libroot/posix/glibc/wctype/
H A Dwchar-lookup.h55 uint32_t index1 = wc >> shift1; local
57 if (index1 < bound)
59 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1];
86 uint32_t index1 = wc >> shift1; local
88 if (index1 < bound)
90 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1];
119 uint32_t index1 = wc >> shift1; local
121 if (index1 < bound)
123 uint32_t lookup1 = ((const uint32_t *) table)[5 + index1];
/haiku-fatelf/src/libs/iconv/
H A Djohab_hangul.h116 int index1 = jamo_initial_index[bitspart1]; local
120 if (index1 >= 0 && index2 >= 0 && index3 >= 0) {
122 if (index1 == fill) {
147 /* index1 and index2 are not fill, but index3 may be fill. */
149 *pwc = 0xac00 + ((index1 - 1) * 21 + (index2 - 1)) * 28 + index3;
173 /* index1+1 = jamo_initial_index[bitspart1] <==>
174 bitspart1 = jamo_initial_index_inverse[index1] */
206 unsigned int index1; local
213 index1 = tmp;
215 | jamo_initial_index_inverse[index1]) <<
[all...]
H A Djisx0213.h5904 int index1 = jisx0213_from_ucs_level1[ucs >> 6]; local
5905 if (index1 >= 0) {
5906 const Summary16 *summary = &jisx0213_from_ucs_level2_2indx[((index1 << 6) + (ucs & 0x3f)) >> 4];
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxinclude.c887 int index1, index2; local
904 index1 = range->index;
946 if ((cur == start) && (index1 > 1)) {
947 content += (index1 - 1);
948 len -= (index1 - 1);
949 index1 = 0;
986 if ((cur == start) && (index1 > 1)) {
987 cur = xmlXIncludeGetNthChild(cur, index1 - 1);
988 index1 = 0;
1006 if (index1 >
[all...]
H A Dxpointer.c208 * @index1: the first index
218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) { argument
225 if (index1 < index2)
227 if (index1 > index2)
1436 int index1, index2; local
1451 index1 = range->index;
1463 if ((cur == start) && (index1 > 1)) {
1464 content += (index1 - 1);
1465 len -= (index1 - 1);
1466 index1
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dsecurity.c1290 unsigned int index1; local
1295 index1 = securindex >> CACHE_PERMISSIONS_BITS;
1298 + index1*sizeof(struct CACHED_PERMISSIONS*));
1300 cache->head.last = index1;
1305 for (i=0; i<=index1; i++)
1319 unsigned int index1; local
1324 for (index1=0; index1<=pseccache->head.last; index1++)
1325 if (pseccache->cachetable[index1]) {
1400 unsigned int index1; local
1456 unsigned int index1; local
1608 unsigned int index1; local
[all...]
/haiku-fatelf/headers/private/graphics/common/
H A Dedid_raw.h178 uint8 index1; member in struct:_PACKED
/haiku-fatelf/src/add-ons/accelerants/common/
H A Ddecode_edid.c115 whitepoint[0].index = raw->index1;
/haiku-fatelf/src/tests/kits/storage/
H A DEntryTest.cpp177 int32 index1 = get_error_index(error1); local
179 if (index1 >= 0 && index2 >= 0)
180 result = index1 * kErrorCount + index2 + 1;
194 int32 index1 = (fuzzyError - 1) / kErrorCount; local
196 if (index1 >= kErrorCount)
199 status_t error1 = kErrors[index1];

Completed in 158 milliseconds