| /external/clang/test/SemaCXX/ |
| D | array-bounds.cpp | 8 …y[2] = 2; // expected-warning {{array index of '2' indexes past the end of an array (that contains… in foo() 9 …return x[2] + // expected-warning {{array index of '2' indexes past the end of an array (that con… in foo() 10 … y[-1] + // expected-warning {{array index of '-1' indexes before the beginning of the array}} in foo() 11 …x[sizeof(x)] + // expected-warning {{array index of '8' indexes past the end of an array (that co… in foo() 12 …x[sizeof(x) / sizeof(x[0])] + // expected-warning {{array index of '2' indexes past the end of an… in foo() 14 …x[sizeof(x[2])]; // expected-warning {{array index of '4' indexes past the end of an array (that c… in foo() 28 …int val = a[3]; // expected-warning {{array index of '3' indexes past the end of an array (that c… in f2() 41 …u.a[3] = 1; // expected-warning {{array index of '3' indexes past the end of an array (that contai… in test() 46 …array[const_subscript] = 0; // expected-warning {{array index of '3' indexes past the end of an a… in test() 52 …array2[3] = 0; // expected-warning {{array index of '3' indexes past the end of an array (that con… in test() [all …]
|
| /external/apache-harmony/auth/src/test/java/common/org/apache/harmony/auth/tests/javax/security/sasl/ |
| D | RealmChoiceCallbackTest.java | 46 private static final int indexes[] = { Integer.MIN_VALUE, -1, 0, 100, field in RealmChoiceCallbackTest 124 assertNull("Incorrect selected indexes", ind); in test02() 136 for (int j = 0; j < indexes.length; j++) { in test02() 137 rCCB.setSelectedIndex(indexes[j]); in test02() 140 assertEquals("Incorrect index", ind[0], indexes[j]); in test02() 164 assertNull("Incorrect selected indexes", ind); in test03() 165 rCCB.setSelectedIndexes(indexes); in test03() 167 assertEquals("Incorrect index length", ind.length, indexes.length); in test03() 168 for (int j = 0; j < indexes.length; j++) { in test03() 170 ind[j], indexes[j]); in test03() [all …]
|
| /external/icu4c/common/ |
| D | unormimp.h | 88 /* canonStartSets[0..31] contains indexes for what is in the array */ 107 /* 14 bit indexes to canonical USerializedSets */ 114 /* indexes[] value names */ 195 * int32_t indexes[_NORM_INDEX_TOP]; -- _NORM_INDEX_TOP=32, see enum in this file 197 * UTrie normTrie; -- size in bytes=indexes[_NORM_INDEX_TRIE_SIZE] 199 * uint16_t extraData[extraDataTop]; -- extraDataTop=indexes[_NORM_INDEX_UCHAR_COUNT] 203 …* uint16_t combiningTable[combiningTableTop]; -- combiningTableTop=indexes[_NORM_INDEX_COMBINE_DA… 207 * UTrie fcdTrie; -- size in bytes=indexes[_NORM_INDEX_FCD_TRIE_SIZE] 209 * UTrie auxTrie; -- size in bytes=indexes[_NORM_INDEX_AUX_TRIE_SIZE] 211 …* uint16_t canonStartSets[canonStartSetsTop] -- canonStartSetsTop=indexes[_NORM_INDEX_CANON_SET_… [all …]
|
| D | ucnv_ext.h | 95 * int32_t indexes[>=32]; 97 * Array of indexes and lengths etc. The length of the array is at least 32. 98 * The actual length is stored in indexes[0] to be forward compatible. 100 * Each index to another array is the number of bytes from indexes[]. 103 * Some of the structures may not be present, in which case their indexes 106 * Usage of indexes[i]: 107 * [0] length of indexes[] 126 * [13] index of fromUStage3[] (array of uint16_t indexes into fromUStage3b[]) 150 * [>31] reserved; there are indexes[0] indexes 177 * and match the next unit; (value indexes toUTable[value]) [all …]
|
| D | ucnvsel.cpp | 270 * int32_t indexes[UCNVSEL_INDEX_COUNT]; // see index entry constants above 271 * serialized UTrie2; // indexes[UCNVSEL_INDEX_TRIE_SIZE] bytes 272 * uint32_t pv[indexes[UCNVSEL_INDEX_PV_COUNT]]; // bit vectors 273 * char* encodingNames[indexes[UCNVSEL_INDEX_NAMES_LENGTH]]; // NUL-terminated strings + padding 306 int32_t indexes[UCNVSEL_INDEX_COUNT] = { in ucnvsel_serialize() local 315 (int32_t)sizeof(indexes) + in ucnvsel_serialize() 319 indexes[UCNVSEL_INDEX_SIZE] = totalSize - header.dataHeader.headerSize; in ucnvsel_serialize() 330 length = (int32_t)sizeof(indexes); in ucnvsel_serialize() 331 uprv_memcpy(p, indexes, length); in ucnvsel_serialize() 408 /* read the indexes */ in ucnvsel_swap() [all …]
|
| D | uresdata.h | 79 /* indexes[] value names; indexes are generally 32-bit (Resource) indexes */ 81 URES_INDEX_LENGTH, /* [0] contains URES_INDEX_TOP==the length of indexes[]; 82 * formatVersion==1: all bits contain the length of indexes[] 85 * only bits 7..0 contain the length of indexes[], 101 * Nofallback attribute, attribute bit 0 in indexes[URES_INDEX_ATTRIBUTES]. 107 * If indexes[] is missing or too short, then the attribute cannot be determined 145 * The using-bundle's and the pool-bundle's indexes[URES_INDEX_POOL_CHECKSUM] values 147 * Two bits in indexes[URES_INDEX_ATTRIBUTES] indicate whether a resource bundle 169 * int32_t indexes[indexes[0]]; -- array of indexes for friendly 174 * (minus the space for root and indexes[]), [all …]
|
| D | usprep.cpp | 270 uprv_memcpy(&profile->indexes, p, sizeof(profile->indexes)); in loadData() 277 …profile->mappingData=(uint16_t *)((uint8_t *)(p+_SPREP_INDEX_TOP)+profile->indexes[_SPREP_INDEX_TR… in loadData() 284 normCorrVer = profile->indexes[_SPREP_NORM_CORRECTNS_LAST_UNI_VERSION]; in loadData() 292 … ((profile->indexes[_SPREP_OPTIONS] & _SPREP_NORMALIZATION_ON) > 0) /* normalization turned on*/ in loadData() 353 … newProfile->doNFKC = (UBool)((newProfile->indexes[_SPREP_OPTIONS] & _SPREP_NORMALIZATION_ON) > 0); in usprep_getProfile() 354 … newProfile->checkBiDi = (UBool)((newProfile->indexes[_SPREP_OPTIONS] & _SPREP_CHECK_BIDI_ON) > 0); in usprep_getProfile() 531 const int32_t* indexes = profile->indexes; in usprep_map() local 560 if(index >= indexes[_SPREP_ONE_UCHAR_MAPPING_INDEX_START] && in usprep_map() 561 index < indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START]){ in usprep_map() 563 }else if(index >= indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START] && in usprep_map() [all …]
|
| D | ubidi_props.c | 33 const int32_t *indexes; member 77 length=bdp->indexes[UBIDI_IX_MIRROR_LENGTH]; in ubidi_addPropertyStarts() 84 start=bdp->indexes[UBIDI_IX_JG_START]; in ubidi_addPropertyStarts() 85 limit=bdp->indexes[UBIDI_IX_JG_LIMIT]; in ubidi_addPropertyStarts() 116 max=bdp->indexes[UBIDI_MAX_VALUES_INDEX]; in ubidi_getMaxValue() 155 length=bdp->indexes[UBIDI_IX_MIRROR_LENGTH]; in ubidi_getMirror() 196 start=bdp->indexes[UBIDI_IX_JG_START]; in ubidi_getJoiningGroup() 197 limit=bdp->indexes[UBIDI_IX_JG_LIMIT]; in ubidi_getJoiningGroup()
|
| D | uresdata.c | 161 /* formatVersion 1.1 must have a root item and at least 5 indexes */ in res_init() 179 /* bundles with formatVersion 1.1 and later contain an indexes[] array */ in res_init() 180 const int32_t *indexes=pResData->pRoot+1; in res_init() local 181 int32_t indexLength=indexes[URES_INDEX_LENGTH]&0xff; in res_init() 189 length<(indexes[URES_INDEX_BUNDLE_TOP]<<2)) in res_init() 195 if(indexes[URES_INDEX_KEYS_TOP]>(1+indexLength)) { in res_init() 196 pResData->localKeyLimit=indexes[URES_INDEX_KEYS_TOP]<<2; in res_init() 199 int32_t att=indexes[URES_INDEX_ATTRIBUTES]; in res_init() 210 indexes[URES_INDEX_16BIT_TOP]>indexes[URES_INDEX_KEYS_TOP] in res_init() 212 pResData->p16BitUnits=(const uint16_t *)(pResData->pRoot+indexes[URES_INDEX_KEYS_TOP]); in res_init() [all …]
|
| /external/icu4c/tools/toolutil/ |
| D | swapimpl.cpp | 109 /* the properties file must contain at least the indexes array */ in uprops_swap() 117 /* read the indexes */ in uprops_swap() 125 * indexes[] constants are in uprops.h in uprops_swap() 152 /* swap the indexes[16] */ in uprops_swap() 232 int32_t indexes[16]; in ucase_swap() local 277 /* read the first 16 indexes (ICU 3.2/format version 1: UCASE_IX_TOP==16, might grow) */ in ucase_swap() 279 indexes[i]=udata_readInt32(ds, inIndexes[i]); in ucase_swap() 283 size=indexes[UCASE_IX_LENGTH]; in ucase_swap() 300 /* swap the int32_t indexes[] */ in ucase_swap() 301 count=indexes[UCASE_IX_INDEX_TOP]*4; in ucase_swap() [all …]
|
| /external/icu4c/tools/gensprep/ |
| D | store.c | 59 * int32_t indexes[_SPREP_INDEX_TOP]; -- _SPREP_INDEX_TOP=16, see enum in sprpimpl.h file 61 * UTrie stringPrepTrie; -- size in bytes=indexes[_SPREP_INDEX_TRIE_SIZE] 64 …* size in bytes = indexes[_SPREP_INDEX_MAPPING_DAT… 66 * The indexes array contains the following values: 67 * indexes[_SPREP_INDEX_TRIE_SIZE] -- The size of the StringPrep trie in bytes 68 * indexes[_SPREP_INDEX_MAPPING_DATA_SIZE] -- The size of the mappingTable in bytes 69 …* indexes[_SPREP_NORM_CORRECTNS_LAST_UNI_VERSION] -- The index of Unicode version of last entry … 70 …* indexes[_SPREP_ONE_UCHAR_MAPPING_INDEX_START] -- The starting index of 1 UChar mapping inde… 71 …* indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START] -- The starting index of 2 UChars mapping inde… 72 …* indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START] -- The starting index of 3 UChars mapping inde… [all …]
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| D | table_model_array_controller.mm | 77 NSIndexSet* indexes = [NSIndexSet indexSetWithIndexesInRange: 79 [self removeObjectsAtArrangedObjectIndexes:indexes]; 142 NSMutableIndexSet* indexes = [NSMutableIndexSet indexSet]; 147 [indexes addIndex:i + offset]; 149 return indexes; 158 NSIndexSet* indexes = [self controllerRowsForModelRowsInRange:range]; 159 [self insertObjects:rows atArrangedObjectIndexes:indexes]; 165 NSMutableIndexSet* indexes = 176 [indexes shiftIndexesStartingAtIndex:0 by:offset]; 182 [indexes shiftIndexesStartingAtIndex:row by:1]; [all …]
|
| /external/icu4c/tools/genbidi/ |
| D | store.c | 41 structures that store indexes or data. 52 const int32_t indexes[i0] with values i0, i1, ...: 53 (see UBIDI_IX_... constants for names of indexes) 55 i0 indexLength; -- length of indexes[] (UBIDI_IX_TOP) 56 i1 dataLength; -- length in bytes of the post-header data (incl. indexes[]) 119 The start and limit code points for the range are stored in the indexes[] 223 * find each mirror code point in the source column and set each other's indexes in makeMirror() 226 * reduce the table, combine the source code points with their indexes in makeMirror() 257 * set both entries' indexes to each other in makeMirror() 289 static int32_t indexes[UBIDI_IX_TOP]={ in generateData() local [all …]
|
| /external/icu4c/tools/gennorm2/ |
| D | n2builder.cpp | 167 memset(indexes, 0, sizeof(indexes)); in Normalizer2DataBuilder() 854 norm16=indexes[Normalizer2Impl::IX_MIN_MAYBE_YES]+offset; in writeNorm16() 861 norm16=indexes[Normalizer2Impl::IX_MIN_YES_NO]+offset; in writeNorm16() 865 norm16=indexes[Normalizer2Impl::IX_MIN_NO_NO]+offset; in writeNorm16() 877 if(isDecompNo && start<indexes[Normalizer2Impl::IX_MIN_DECOMP_NO_CP]) { in writeNorm16() 878 indexes[Normalizer2Impl::IX_MIN_DECOMP_NO_CP]=start; in writeNorm16() 880 if(isCompNoMaybe && start<indexes[Normalizer2Impl::IX_MIN_COMP_NO_MAYBE_CP]) { in writeNorm16() 881 indexes[Normalizer2Impl::IX_MIN_COMP_NO_MAYBE_CP]=start; in writeNorm16() 907 … norm16=(uint16_t)indexes[Normalizer2Impl::IX_MIN_YES_NO]; // Hangul LV/LVT encoded as minYesNo in setHangulData() 908 if(range->start<indexes[Normalizer2Impl::IX_MIN_DECOMP_NO_CP]) { in setHangulData() [all …]
|
| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| D | example-bind.cpp | 206 template<int I, int... Indexes, typename T, typename... Types> 207 struct make_indexes_impl<I, int_tuple<Indexes...>, T, Types...> { 208 typedef typename make_indexes_impl<I+1, int_tuple<Indexes..., I>, Types...>::type type; 211 template<int I, int... Indexes> 212 struct make_indexes_impl<I, int_tuple<Indexes...> > { 213 typedef int_tuple<Indexes...> type; 231 typedef typename make_indexes<BoundArgs...>::type indexes; typedef in bound_functor 286 template<typename F, int... Indexes, typename... Args> 288 unwrap_and_forward(F& f, int_tuple<Indexes...>, const tuple<Args&...>& args) { in unwrap_and_forward() argument 289 return f(get<Indexes>(args)...); in unwrap_and_forward() [all …]
|
| /external/icu4c/tools/makeconv/ |
| D | gencnvex.c | 60 …6_t stage3[0x10000<<UCNV_EXT_STAGE_2_LEFT_SHIFT]; /* 0x10000 because of 16-bit stage 2/3 indexes */ 119 int32_t indexes[UCNV_EXT_INDEXES_MIN_LENGTH]={ 0 }; in CnvExtWrite() local 145 /* fill indexes[] - offsets/indexes are in units of the target array */ in CnvExtWrite() 148 indexes[UCNV_EXT_INDEXES_LENGTH]=length=UCNV_EXT_INDEXES_MIN_LENGTH; in CnvExtWrite() 151 indexes[UCNV_EXT_TO_U_INDEX]=top; in CnvExtWrite() 152 indexes[UCNV_EXT_TO_U_LENGTH]=length=utm_countItems(extData->toUTable); in CnvExtWrite() 155 indexes[UCNV_EXT_TO_U_UCHARS_INDEX]=top; in CnvExtWrite() 156 indexes[UCNV_EXT_TO_U_UCHARS_LENGTH]=length=utm_countItems(extData->toUUChars); in CnvExtWrite() 159 indexes[UCNV_EXT_FROM_U_UCHARS_INDEX]=top; in CnvExtWrite() 170 indexes[UCNV_EXT_FROM_U_LENGTH]=length; in CnvExtWrite() [all …]
|
| /external/icu4c/tools/genprops/ |
| D | store.c | 37 structures that store indexes or data. 63 const int32_t indexes[16] with values i0..i15: 142 The data words consist of 32-bit unit indexes (not row indexes!) into the 189 The indexes[] values for the omitted structures are still filled in 357 static int32_t indexes[UPROPS_INDEX_COUNT]={ in generateData() local 378 offset=sizeof(indexes)/4; /* uint32_t offset to the properties trie */ in generateData() 383 indexes[UPROPS_PROPS32_INDEX]= /* set indexes to the same offsets for empty */ in generateData() 384 indexes[UPROPS_EXCEPTIONS_INDEX]= /* structures from the old format version 3 */ in generateData() 385 indexes[UPROPS_EXCEPTIONS_TOP_INDEX]= /* so that less runtime code has to be changed */ in generateData() 386 indexes[UPROPS_ADDITIONAL_TRIE_INDEX]=offset; in generateData() [all …]
|
| /external/llvm/lib/CodeGen/ |
| D | InterferenceCache.h | 24 SlotIndexes *Indexes; variable 52 /// Indexes - Mapping block numbers to SlotIndex ranges. 53 SlotIndexes *Indexes; variable 74 Entry() : PhysReg(0), Tag(0), RefCount(0), Indexes(0) {} in Entry() 76 void clear(MachineFunction *mf, SlotIndexes *indexes) { in clear() argument 80 Indexes = indexes; in clear() 127 InterferenceCache() : TRI(0), LIUArray(0), Indexes(0), MF(0), RoundRobin(0) {} in InterferenceCache()
|
| /external/clang/test/Index/ |
| D | complete-kvc.m | 59 …TypedText arrayPropertyAtIndexes:}{LeftParen (}{Text NSIndexSet *}{RightParen )}{Text indexes} (40) 61 …{TypedText boolPropertyAtIndexes:}{LeftParen (}{Text NSIndexSet *}{RightParen )}{Text indexes} (55) 69 …ce }{TypedText atIndexes:}{LeftParen (}{Placeholder NSIndexSet *}{RightParen )}{Text indexes} (55) 70 …ce }{TypedText atIndexes:}{LeftParen (}{Placeholder NSIndexSet *}{RightParen )}{Text indexes} (40) 83 …Text mutableSetPropertyAtIndexes:}{LeftParen (}{Text NSIndexSet *}{RightParen )}{Text indexes} (55) 85 …pedText myArrayPropertyAtIndexes:}{LeftParen (}{Text NSIndexSet *}{RightParen )}{Text indexes} (40) 88 …t removeMyArrayPropertyAtIndexes:}{LeftParen (}{Text NSIndexSet *}{RightParen )}{Text indexes} (40) 89 …ext removeMySetPropertyAtIndexes:}{LeftParen (}{Text NSIndexSet *}{RightParen )}{Text indexes} (55) 92 …rtyAtIndexes:}{LeftParen (}{Placeholder NSIndexSet *}{RightParen )}{Text indexes}{HorizontalSpace … 93 …rtyAtIndexes:}{LeftParen (}{Placeholder NSIndexSet *}{RightParen )}{Text indexes}{HorizontalSpace …
|
| /external/chromium/chrome/browser/resources/shared/js/cr/ui/ |
| D | list_selection_model.js | 20 // iteration in the order of the indexes. 36 * @type {!Array} The selected indexes. 77 * Selects a range of indexes, starting with {@code start} and ends with 101 * Selects all indexes. 185 var indexes = Object.keys(this.changedIndexes_); 186 if (indexes.length) { 188 e.changes = indexes.map(function(index) {
|
| D | list_single_selection_model.js | 35 * @type {!Array} The selected indexes. 61 * Selects a range of indexes, starting with {@code start} and ends with 72 * Selects all indexes. 142 var indexes = [this.selectedIndexBefore_, this.selectedIndex_]; 143 e.changes = indexes.filter(function(index) {
|
| /external/antlr/src/org/antlr/runtime/tree/ |
| D | 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/icu4c/test/cintltst/ |
| D | sprpdata.c | 153 int32_t* indexes = data->indexes; in compareMapping() local 172 if(index >= indexes[_SPREP_ONE_UCHAR_MAPPING_INDEX_START] && in compareMapping() 173 index < indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START]){ in compareMapping() 175 }else if(index >= indexes[_SPREP_TWO_UCHARS_MAPPING_INDEX_START] && in compareMapping() 176 index < indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START]){ in compareMapping() 178 }else if(index >= indexes[_SPREP_THREE_UCHARS_MAPPING_INDEX_START] && in compareMapping() 179 index < indexes[_SPREP_FOUR_UCHARS_MAPPING_INDEX_START]){ in compareMapping()
|
| /external/webkit/LayoutTests/storage/indexeddb/ |
| D | tutorial.html | 105 // We could skip setting up the object stores and indexes if this were a real application 117 // can add or delete indexes and objectStores. The result (property of the request) is an 178 // Now let's create some indexes. Indexes allow you to create other keys via key paths which 180 // indexes for a persons first and last name. Indexes can optionally be specified to not be 186 // Note that if you wanted to delete these indexes, you can either call objectStore.deleteIndex 187 // or simply delete the objectStores that own the indexes. 191 // can be atomic with changes to the objectStores/indexes. 254 // Verify that fname and lname are the only indexes in existance. 338 …// return unique entires (only applies to indexes with unique set to false), PREV to move backward… 390 // Similarly, indexes have openCursor and openKeyCursor. We'll try a few of them with various [all …]
|
| /external/openssl/crypto/bn/ |
| D | bn_ctx.c | 121 /* Array of indexes into the bignum stack */ 122 unsigned int *indexes; member 173 while(bnidx++ < stack->indexes[fpidx]) in ctxdbg() 314 st->indexes = NULL; in BN_STACK_init() 320 if(st->size) OPENSSL_free(st->indexes); in BN_STACK_finish() 341 memcpy(newitems, st->indexes, st->depth * in BN_STACK_push() 343 if(st->size) OPENSSL_free(st->indexes); in BN_STACK_push() 344 st->indexes = newitems; in BN_STACK_push() 347 st->indexes[(st->depth)++] = idx; in BN_STACK_push() 353 return st->indexes[--(st->depth)]; in BN_STACK_pop()
|