| /external/icu/icu4c/source/common/ |
| ucnvsel.cpp | 274 * int32_t indexes[UCNVSEL_INDEX_COUNT]; // see index entry constants above
275 * serialized UTrie2; // indexes[UCNVSEL_INDEX_TRIE_SIZE] bytes
276 * uint32_t pv[indexes[UCNVSEL_INDEX_PV_COUNT]]; // bit vectors
277 * char* encodingNames[indexes[UCNVSEL_INDEX_NAMES_LENGTH]]; // NUL-terminated strings + padding
310 int32_t indexes[UCNVSEL_INDEX_COUNT] = { local
319 (int32_t)sizeof(indexes) +
323 indexes[UCNVSEL_INDEX_SIZE] = totalSize - header.dataHeader.headerSize;
334 length = (int32_t)sizeof(indexes);
335 uprv_memcpy(p, indexes, length);
412 /* read the indexes */
414 int32_t indexes[16]; local
542 const int32_t *indexes = (const int32_t *)p; local
[all...] |
| brkeng.cpp | 266 const int32_t *indexes = (const int32_t *)data; local
267 const int32_t offset = indexes[DictionaryData::IX_STRING_TRIE_OFFSET];
268 const int32_t trieType = indexes[DictionaryData::IX_TRIE_TYPE] & DictionaryData::TRIE_TYPE_MASK;
271 const int32_t transform = indexes[DictionaryData::IX_TRANSFORM];
|
| propname.h | 115 static const int32_t indexes[]; member in class:PropNameData
134 * int32_t indexes[8];
138 * The first 6 indexes are byte offsets from the beginning of the data
139 * (beginning of indexes[]) to following structures.
144 * The last offset (indexes[PropNameData::IX_TOTAL_SIZE]) indicates the
147 * The sixth index (indexes[PropNameData::IX_MAX_NAME_LENGTH]) has the
|
| sprpimpl.h | 67 /* indexes[] value names */
89 int32_t indexes[_SPREP_INDEX_TOP]; member in struct:UStringPrepProfile
|
| unames.cpp | 94 * @param names (const UCharNames *) pointer to the UCharNames indexes
776 uint16_t indexes[8], /* output fields from here */
793 indexes[i]=(uint16_t)(code%factor);
800 indexes[0]=(uint16_t)code;
808 /* skip indexes[i] strings */
809 factor=indexes[i];
829 factor=(uint16_t)(factors[i]-indexes[i]-1);
904 uint16_t indexes[8]; local
916 s, code-range->start, indexes, NULL, NULL, buffer, bufferLength);
993 uint16_t indexes[8] local
1122 uint16_t indexes[8]; local
[all...] |
| /external/lzma/CPP/7zip/Archive/7z/ |
| 7zFolderInStream.cpp | 11 const UInt32 *indexes, unsigned numFiles)
14 _indexes = indexes;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| InterferenceCache.h | 24 SlotIndexes *Indexes;
52 /// Indexes - Mapping block numbers to SlotIndex ranges.
53 SlotIndexes *Indexes;
74 Entry() : PhysReg(0), Tag(0), RefCount(0), Indexes(0) {}
76 void clear(MachineFunction *mf, SlotIndexes *indexes) {
80 Indexes = indexes;
127 InterferenceCache() : TRI(0), LIUArray(0), Indexes(0), MF(0), RoundRobin(0) {}
|
| /external/tensorflow/tensorflow/compiler/xla/ |
| array.h | 322 // Returns the value at the cell specified by the indexes. The number of
334 std::array<int64, sizeof...(dims)> indexes{{static_cast<int64>(dims)...}};
335 return values_[calculate_index(indexes)];
338 // Returns the value at the cell specified by the indexes. The number of
346 std::array<int64, sizeof...(dims)> indexes{{static_cast<int64>(dims)...}};
347 return values_[calculate_index(indexes)];
350 // Returns the value at the cell specified by the indexes. The number of
352 const T& operator()(tensorflow::gtl::ArraySlice<int64> indexes) const {
353 return values_[calculate_index(indexes)];
356 // Returns the value at the cell specified by the indexes. The number o
[all...] |
| shape_util.h | 40 // element of ShapeIndex indexes into a tuple (or nested tuple) within the
556 // Iterates through all the shape indexes, in minor to major order, starting
557 // from the base indexes, incrementing by the incr steps, up to count
579 // once with the proper empty indexes.
581 std::vector<int64> indexes(base.begin(), base.end());
582 while (n < rank && visitor_function(indexes)) {
586 indexes[dim] += incr[dim];
587 if (indexes[dim] < base[dim] + count[dim]) {
590 indexes[dim] = base[dim];
|
| /external/squashfs-tools/squashfs-tools/ |
| read_fs.c | 701 int indexes = SQUASHFS_ID_BLOCKS(sBlk->no_ids); local
702 long long index[indexes];
720 SQUASHFS_INSWAP_ID_BLOCKS(index, indexes);
722 for(i = 0; i < indexes; i++) {
723 int expected = (i + 1) != indexes ? SQUASHFS_METADATA_SIZE :
755 int indexes = SQUASHFS_FRAGMENT_INDEXES(sBlk->fragments); local
756 long long fragment_table_index[indexes];
758 TRACE("read_fragment_table: %d fragments, reading %d fragment indexes "
759 "from 0x%llx\n", sBlk->fragments, indexes,
779 SQUASHFS_INSWAP_FRAGMENT_INDEXES(fragment_table_index, indexes);
810 int indexes = SQUASHFS_LOOKUP_BLOCKS(sBlk->inodes); local
[all...] |
| unsquash-3.c | 34 int indexes = SQUASHFS_FRAGMENT_INDEXES_3(sBlk.s.fragments); local
35 long long fragment_table_index[indexes];
37 TRACE("read_fragment_table: %d fragments, reading %d fragment indexes "
38 "from 0x%llx\n", sBlk.s.fragments, indexes,
52 long long sfragment_table_index[indexes];
63 sfragment_table_index, indexes);
75 for(i = 0; i < indexes; i++) {
76 int expected = (i + 1) != indexes ? SQUASHFS_METADATA_SIZE :
|
| /external/tensorflow/tensorflow/core/graph/ |
| graph_partition_test.cc | 522 std::vector<int> indexes; local
524 indexes.push_back((i + 2001) % 20);
527 for (int i : indexes) {
551 std::vector<int> indexes; local
555 indexes.push_back((i + 2001) % num_leaves);
561 for (int i : indexes) {
569 for (int i : indexes) {
617 std::vector<int> indexes; local
621 indexes.push_back((i + 2001) % num_leaves);
627 placeholders.reserve(indexes.size())
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBase.java | 83 * These hold indexes to elements based on namespace and local name.
251 * Ensure that the size of the element indexes can hold the information.
265 int[][][] indexes = m_elemIndexes; local
269 System.arraycopy(indexes, 0, m_elemIndexes, 0, indexes.length);
281 int[][] indexes = localNameIndex; local
285 System.arraycopy(indexes, 0, localNameIndex, 0, indexes.length);
300 int[] indexes = elemHandles; local
304 System.arraycopy(indexes, 0, elemHandles, 0, indexes.length)
388 int[][][] indexes = m_elemIndexes; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| InterferenceCache.h | 54 /// Indexes - Mapping block numbers to SlotIndex ranges.
55 SlotIndexes *Indexes;
97 Entry() : PhysReg(0), Tag(0), RefCount(0), Indexes(nullptr), LIS(nullptr) {}
99 void clear(MachineFunction *mf, SlotIndexes *indexes, LiveIntervals *lis) {
103 Indexes = indexes;
|
| /external/tensorflow/tensorflow/contrib/lite/kernels/ |
| gather.cc | 105 const int32* indexes = positions->data.i32; local
108 const int pos = indexes[i];
|
| /external/v8/src/ |
| safepoint-table.h | 169 Safepoint(ZoneList<int>* indexes, ZoneList<int>* registers)
170 : indexes_(indexes), registers_(registers) {}
206 // entry must be enough to hold all the pointer indexes.
|
| safepoint-table.cc | 156 // Emit sorted table of pc offsets together with deoptimization indexes.
166 ZoneList<int>* indexes = indexes_[i]; local
188 // Run through the indexes and build a bitmap.
189 for (int j = 0; j < indexes->length(); j++) {
190 int index = bits_per_entry - 1 - indexes->at(j);
|
| /external/webrtc/webrtc/common_audio/signal_processing/ |
| complex_bit_reverse_arm.S | 87 @ The index tables. Note the values are doubles of the actual indexes for 16-bit
89 @ for the indexes.
92 index_7: @ Indexes for stages == 7.
102 index_8: @ Indexes for stages == 8.
|
| /external/mesa3d/src/gallium/drivers/svga/svgadump/ |
| svga_dump.py | 217 indexes = 'ijklmn'
224 print ' unsigned ' + ', '.join(indexes[:len(body)]) + ';'
229 idx = indexes[i]
|
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/unicode/bidi/ |
| bracket.go | 71 // For each rune, it takes the indexes into the original string, the class the
82 indexes: s.indexes,
120 indexes []int // array of index values into the original string
127 return pairValues[p.indexes[opener]] == pairValues[p.indexes[closer]]
140 for i, index := range p.indexes {
316 index := p.indexes[i]
323 for i := loc.closer + 1; i < len(p.indexes); i++ {
324 index := p.indexes[i
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/unicode/bidi/ |
| bracket.go | 71 // For each rune, it takes the indexes into the original string, the class the
82 indexes: s.indexes,
120 indexes []int // array of index values into the original string
127 return pairValues[p.indexes[opener]] == pairValues[p.indexes[closer]]
140 for i, index := range p.indexes {
316 index := p.indexes[i]
323 for i := loc.closer + 1; i < len(p.indexes); i++ {
324 index := p.indexes[i
[all...] |
| /external/icu/icu4c/source/tools/genrb/ |
| reslist.cpp | 59 // This can also help to keep the pool and total (pool+local) string indexes
599 // After the mapping, negative key indexes are used for shared pool bundle keys.
838 int32_t indexes[URES_INDEX_TOP]; local
900 // 16-bit indexes work for all pool + local strings.
903 // Set the pool index threshold so that 16-bit indexes work
1001 * write int32_t indexes[] after root and before the key strings
1004 uprv_memset(indexes, 0, sizeof(indexes));
1005 indexes[URES_INDEX_LENGTH]= fIndexLength;
1006 indexes[URES_INDEX_KEYS_TOP]= fKeysTop>>2
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/link/internal/ld/ |
| pcln.go | 462 // for each subbucket, compute the minimum of all symbol indexes
466 indexes := make([]int32, n)
468 indexes[i] = NOIDX
493 if indexes[i] > idx {
494 indexes[i] = idx
499 if indexes[i] > idx {
500 indexes[i] = idx
512 base := indexes[i*SUBBUCKETS]
518 idx = indexes[i*SUBBUCKETS+j]
|
| /prebuilts/go/linux-x86/src/cmd/link/internal/ld/ |
| pcln.go | 462 // for each subbucket, compute the minimum of all symbol indexes
466 indexes := make([]int32, n)
468 indexes[i] = NOIDX
493 if indexes[i] > idx {
494 indexes[i] = idx
499 if indexes[i] > idx {
500 indexes[i] = idx
512 base := indexes[i*SUBBUCKETS]
518 idx = indexes[i*SUBBUCKETS+j]
|
| /external/annotation-tools/asmx/src/org/objectweb/asm/ |
| MethodWriter.java | 102 * array contains the indexes of the constant pool items that contain the
[all...] |
