HomeSort by relevance Sort by last modified time
    Searched full:indexes (Results 76 - 100 of 1241) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/llvm/test/CodeGen/Generic/
badFoldGEP.ll 6 ;; element, and the second one indexes off that structure field.
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p2/src/
armVCM4P2_SetPredDir.c 34 * 14496-2. Furthermore, indexes 6 to 9 indicate the
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/
bn_ctx.c 121 /* Array of indexes into the bignum stack */
122 unsigned int *indexes; member in struct:bignum_ctx_stack
173 while(bnidx++ < stack->indexes[fpidx])
314 st->indexes = NULL;
320 if(st->size) OPENSSL_free(st->indexes);
341 memcpy(newitems, st->indexes, st->depth *
343 if(st->size) OPENSSL_free(st->indexes);
344 st->indexes = newitems;
347 st->indexes[(st->depth)++] = idx;
353 return st->indexes[--(st->depth)]
    [all...]
  /external/icu4c/tools/gendict/
gendict.cpp 449 int32_t indexes[DictionaryData::IX_COUNT] = {
452 int32_t size = outDataSize + indexes[DictionaryData::IX_STRING_TRIE_OFFSET];
453 indexes[DictionaryData::IX_RESERVED1_OFFSET] = size;
454 indexes[DictionaryData::IX_RESERVED2_OFFSET] = size;
455 indexes[DictionaryData::IX_TOTAL_SIZE] = size;
457 indexes[DictionaryData::IX_TRIE_TYPE] = isBytesTrie ? DictionaryData::TRIE_TYPE_BYTES : DictionaryData::TRIE_TYPE_UCHARS;
459 indexes[DictionaryData::IX_TRIE_TYPE] |= DictionaryData::TRIE_HAS_VALUES;
462 indexes[DictionaryData::IX_TRANSFORM] = dict.getTransform();
463 udata_writeBlock(pData, indexes, sizeof(indexes));
    [all...]
  /external/openssl/crypto/bn/
bn_ctx.c 121 /* Array of indexes into the bignum stack */
122 unsigned int *indexes; member in struct:bignum_ctx_stack
173 while(bnidx++ < stack->indexes[fpidx])
314 st->indexes = NULL;
320 if(st->size) OPENSSL_free(st->indexes);
341 memcpy(newitems, st->indexes, st->depth *
343 if(st->size) OPENSSL_free(st->indexes);
344 st->indexes = newitems;
347 st->indexes[(st->depth)++] = idx;
353 return st->indexes[--(st->depth)]
    [all...]
  /external/chromium_org/third_party/icu/source/common/
uresdata.c 161 /* formatVersion 1.1 must have a root item and at least 5 indexes */
179 /* bundles with formatVersion 1.1 and later contain an indexes[] array */
180 const int32_t *indexes=pResData->pRoot+1; local
181 int32_t indexLength=indexes[URES_INDEX_LENGTH]&0xff;
189 length<(indexes[URES_INDEX_BUNDLE_TOP]<<2))
195 if(indexes[URES_INDEX_KEYS_TOP]>(1+indexLength)) {
196 pResData->localKeyLimit=indexes[URES_INDEX_KEYS_TOP]<<2;
199 int32_t att=indexes[URES_INDEX_ATTRIBUTES];
210 indexes[URES_INDEX_16BIT_TOP]>indexes[URES_INDEX_KEYS_TOP
    [all...]
normalizer2impl.h 661 * int32_t indexes[indexesLength]; -- indexesLength=indexes[IX_NORM_TRIE_OFFSET]/4;
663 * The first eight indexes are byte offsets in ascending order.
668 * that is, from the beginning of the indexes[].
672 * minDecompNoCP=indexes[IX_MIN_DECOMP_NO_CP] is the lowest code point
674 * minCompNoMaybeCP=indexes[IX_MIN_COMP_NO_MAYBE_CP] is the lowest code point
677 * The next four indexes are thresholds of 16-bit trie values for ranges of
679 * minYesNo=indexes[IX_MIN_YES_NO];
680 * minNoNo=indexes[IX_MIN_NO_NO];
681 * limitNoNo=indexes[IX_LIMIT_NO_NO]
    [all...]
  /external/chromium_org/v8/src/
safepoint-table.cc 178 // Emit sorted table of pc offsets together with deoptimization indexes.
188 ZoneList<int>* indexes = indexes_[i]; local
210 // Run through the indexes and build a bitmap.
211 for (int j = 0; j < indexes->length(); j++) {
212 int index = bits_per_entry - 1 - indexes->at(j);
  /external/icu4c/common/
uresdata.c 168 /* formatVersion 1.1 must have a root item and at least 5 indexes */
186 /* bundles with formatVersion 1.1 and later contain an indexes[] array */
187 const int32_t *indexes=pResData->pRoot+1; local
188 int32_t indexLength=indexes[URES_INDEX_LENGTH]&0xff;
196 length<(indexes[URES_INDEX_BUNDLE_TOP]<<2))
202 if(indexes[URES_INDEX_KEYS_TOP]>(1+indexLength)) {
203 pResData->localKeyLimit=indexes[URES_INDEX_KEYS_TOP]<<2;
206 int32_t att=indexes[URES_INDEX_ATTRIBUTES];
217 indexes[URES_INDEX_16BIT_TOP]>indexes[URES_INDEX_KEYS_TOP
    [all...]
  /external/v8/src/
safepoint-table.cc 185 // Emit sorted table of pc offsets together with deoptimization indexes.
195 ZoneList<int>* indexes = indexes_[i]; local
217 // Run through the indexes and build a bitmap.
218 for (int j = 0; j < indexes->length(); j++) {
219 int index = bits_per_entry - 1 - indexes->at(j);
  /external/chromium_org/third_party/icu/source/test/intltest/
testidn.cpp 67 static const int32_t *indexes = NULL; variable
93 indexes = profile->indexes;
346 if(index >= indexes[_SPREP_ONE_UCHAR_MAPPING_INDEX_START] &&
347 index < indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START]){
349 }else if(index >= indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START] &&
350 index < indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START]){
352 }else if(index >= indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START] &&
353 index < indexes[_SPREP_FOUR_UCHARS_MAPPING_INDEX_START]){
  /external/icu4c/test/intltest/
testidn.cpp 68 static const int32_t *indexes = NULL; variable
94 indexes = profile->indexes;
347 if(index >= indexes[_SPREP_ONE_UCHAR_MAPPING_INDEX_START] &&
348 index < indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START]){
350 }else if(index >= indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START] &&
351 index < indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START]){
353 }else if(index >= indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START] &&
354 index < indexes[_SPREP_FOUR_UCHARS_MAPPING_INDEX_START]){
  /external/llvm/lib/CodeGen/
LiveIntervalAnalysis.cpp 115 Indexes = &getAnalysis<SlotIndexes>();
163 MF->print(OS, Indexes);
213 RegMaskSlots.push_back(Indexes->getInstructionIndex(MI).getRegSlot());
288 SlotIndex Begin = Indexes->getMBBStartIdx(MBB);
460 MachineBasicBlock *KillMBB = Indexes->getMBBFromIndex(Kill);
462 tie(MBBStart, MBBEnd) = Indexes->getMBBRange(KillMBB);
489 tie(MBBStart, MBBEnd) = Indexes->getMBBRange(MBB);
596 // getMBBFromIndex doesn't need to search the MBB table when both indexes
598 MachineBasicBlock *MBB1 = Indexes->getMBBFromIndex(Start);
599 MachineBasicBlock *MBB2 = Indexes->getMBBFromIndex(Stop)
    [all...]
SlotIndexes.cpp 1 //===-- SlotIndexes.cpp - Slot Indexes Pass ------------------------------===//
46 // iterator in lock-step (though skipping it over indexes which have
125 // Renumber indexes locally after curItr was inserted, but failed to get a new
128 // Number indexes with half the default spacing so we can catch up quickly.
145 // Repair indexes after adding and removing instructions.
152 // instructions that already have indexes.
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
BaseTree.java 155 i+1..n-1 to the right one position. Set parent / indexes properly
161 // walk others to increment their child indexes
171 // walk rest and decrement their child indexes
188 throw new IllegalArgumentException("indexes invalid; no children in list");
288 throw new IllegalStateException("child indexes don't match; expected "+i+" found "+this.getChildIndex());
297 /** BaseTree doesn't track child indexes. */
TreeWizard.java 101 // TODO: build indexes for the wizard
104 * of token types of interest to the list of indexes into the
468 ArrayList indexes = (ArrayList)tokenTypeToStreamIndexesMap.get(tokenTypeI);
469 if ( indexes==null ) {
470 indexes = new ArrayList(); // no list yet for this token type
471 indexes.add(streamIndexI); // not there yet, add
472 tokenTypeToStreamIndexesMap.put(tokenTypeI, indexes);
475 if ( !indexes.contains(streamIndexI) ) {
476 indexes.add(streamIndexI); // not there yet, add
514 ArrayList indexes = (ArrayList)tokenTypeToStreamIndexesMap.get(tokenTypeI)
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ANTLRTreeWizard.m 184 // TODO: build indexes for the wizard
187 * of token types of interest to the list of indexes into the
668 AMutableArray *indexes = (AMutableArray *)[tokenTypeToStreamIndexesMap objectAtIndex:tokenTypeI];
669 if ( indexes==nil ) {
670 indexes = [AMutableArray arrayWithCapacity:100]; // no list yet for this token type
671 indexes.add(streamIndexI); // not there yet, add
672 [tokenTypeToStreamIndexesMap put:tokenTypeI Idexes:indexes];
675 if ( ![indexes contains:streamIndexI] ) {
676 [indexes add:streamIndexI]; // not there yet, add
715 ArrayList indexes = (ArrayList)tokenTypeToStreamIndexesMap.get(tokenTypeI)
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/page/
FocusController.h 99 // The order followed is as specified in section 17.11.1 of the HTML4 spec, which is elements with tab indexes
100 // first (from lowest to highest), and then elements without tab indexes (in document order).
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/
sp_draw_arrays.c 49 * indexes.
55 * When the min/max element indexes aren't known, minIndex should be 0
  /external/chromium_org/third_party/mesa/src/src/mesa/vbo/
vbo_attrib.h 39 * for materials, color indexes, edge flags, etc.
41 /* Although it's nice to use these as bit indexes in a DWORD flag, we
  /external/libsepol/tests/
test-common.h 39 /* Test the indexes in the policydb to ensure their correctness. These include
41 * user_val_to_struct, and bool_val_to_struct indexes.
  /external/mesa3d/src/gallium/drivers/softpipe/
sp_draw_arrays.c 49 * indexes.
55 * When the min/max element indexes aren't known, minIndex should be 0
  /external/mesa3d/src/mesa/vbo/
vbo_attrib.h 39 * for materials, color indexes, edge flags, etc.
41 /* Although it's nice to use these as bit indexes in a DWORD flag, we
  /frameworks/av/media/libeffects/testlibs/
AudioCoefInterpolator.h 26 // This class provides support for out-of-range indexes.
66 // The offset between two consecutive indexes of each dimension. This is in
  /packages/apps/UnifiedEmail/src/com/android/mail/lib/base/
CharEscaperBuilder.java 22 * Simple helper class to build a "sparse" array of objects based on the indexes that were added to
23 * it. The array will be from 0 to the maximum index given. All non-set indexes will contain null

Completed in 952 milliseconds

1 2 34 5 6 7 8 91011>>