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

/haiku/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/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/headers/private/storage/mime/
H A DDatabaseDirectory.h33 int32 index1, const entry_ref& entry2,
/haiku/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/headers/build/private/storage/
H A DMergedDirectory.h53 int32 index1, const entry_ref& entry2,
55 // always invoked with index1 < index2
/haiku/headers/private/storage/
H A DMergedDirectory.h53 int32 index1, const entry_ref& entry2,
55 // always invoked with index1 < index2
/haiku/src/kits/storage/mime/
H A DDatabaseDirectory.cpp60 DatabaseDirectory::ShallPreferFirstEntry(const entry_ref& entry1, int32 index1, argument
/haiku/src/system/libroot/posix/crypt/
H A Dcrypt.cpp86 const char index1 = kHexLookup[char1]; local
92 outBuffer[outIndex++] = (index1 << 4) | index2;
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dsecurity.c1437 unsigned int index1; local
1442 index1 = securindex >> CACHE_PERMISSIONS_BITS;
1445 + index1*sizeof(struct CACHED_PERMISSIONS*));
1447 cache->head.last = index1;
1452 for (i=0; i<=index1; i++)
1466 unsigned int index1; local
1471 for (index1=0; index1<=pseccache->head.last; index1++)
1472 if (pseccache->cachetable[index1]) {
1547 unsigned int index1; local
1603 unsigned int index1; local
1755 unsigned int index1; local
[all...]
/haiku/src/build/libbe/storage/
H A DMergedDirectory.cpp213 BMergedDirectory::ShallPreferFirstEntry(const entry_ref& entry1, int32 index1, argument
/haiku/src/kits/storage/
H A DMergedDirectory.cpp206 BMergedDirectory::ShallPreferFirstEntry(const entry_ref& entry1, int32 index1, argument
/haiku/headers/private/interface/
H A DColumnListView.h334 bool SwapRows(int32 index1, int32 index2, BRow*
/haiku/headers/private/graphics/common/
H A Dedid_raw.h198 uint8 index1; member in struct:_PACKED
/haiku/src/add-ons/accelerants/common/
H A Ddecode_edid.c129 whitepoint[0].index = raw->index1;
/haiku/src/tests/kits/storage/
H A DEntryTest.cpp181 int32 index1 = get_error_index(error1); local
183 if (index1 >= 0 && index2 >= 0)
184 result = index1 * kErrorCount + index2 + 1;
198 int32 index1 = (fuzzyError - 1) / kErrorCount; local
200 if (index1 >= kErrorCount)
203 status_t error1 = kErrors[index1];
/haiku/src/kits/interface/
H A DColumnListView.cpp1398 BColumnListView::SwapRows(int32 index1, int32 index2, BRow* parentRow1, argument
1423 row1 = container1->ItemAt(index1);
1434 container2->ReplaceItem(index1, row2);

Completed in 228 milliseconds