Home | History | Annotate | Download | only in common

Lines Matching full:indexes

97  * int32_t indexes[>=32];
99 * Array of indexes and lengths etc. The length of the array is at least 32.
100 * The actual length is stored in indexes[0] to be forward compatible.
102 * Each index to another array is the number of bytes from indexes[].
105 * Some of the structures may not be present, in which case their indexes
108 * Usage of indexes[i]:
109 * [0] length of indexes[]
128 * [13] index of fromUStage3[] (array of uint16_t indexes into fromUStage3b[])
152 * [>31] reserved; there are indexes[0] indexes
179 * and match the next unit; (value indexes toUTable[value])
191 * the result UChars in toUUChars[]; (0 indexes toUUChars[0])
211 * Indexes and lengths stored in the toUTable[].
228 * and match the next unit; (value indexes fromUTable[value])
246 * the result bytes in fromUBytes[]; (0 indexes fromUBytes[0])
269 * Indexes in stage 1 are all offset by the length of stage 1 so that the
278 * Stage 3 of the trie. The first array simply contains indexes to the second,
307 * Indexes and lengths stored in the fromUTableValues[].
335 UCNV_EXT_RESERVED_INDEX, /* 20, moves with additional indexes */
341 /* get the pointer to an extension array from indexes[index] */
342 #define UCNV_EXT_ARRAY(indexes, index, itemType) \
343 ((const itemType *)((const char *)(indexes)+(indexes)[index]))
345 #define UCNV_GET_MAX_BYTES_PER_UCHAR(indexes) \
346 ((indexes)[UCNV_EXT_COUNT_BYTES]&0xff)