| /external/llvm/include/llvm/Analysis/ |
| RegionInfoImpl.h | 43 for (typename BBNodeMapT::iterator it = BBNodeMap.begin(),
45 it != ie; ++it)
46 delete it->second;
737 typename BBtoRegionMap::iterator it = BBtoRegion.find(BB); local
739 // This basic block is a start block of a region. It is already in the
741 if (it != BBtoRegion.end()) {
742 RegionT *newRegion = it->second;
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64CollectLOH.cpp | 26 // It may also be turned into either the following more efficient
89 // 2. AArch64AsmPrinter reads the LOHs from AArch64FunctionInfo and it:
234 /// \param nbRegs is used internally allocate some memory. It must be consistent
240 BlockToSetOfInstrsPerColor::iterator it = sets.find(&MBB); local
241 if (it != sets.end())
242 result = it->second.get();
279 /// definition. It also consider definitions of ADRP instructions as uses and
564 MapRegToId::const_iterator It;
572 ((It = RegToId.find((MI)->getOperand(1).getReg())) == EndIt ||
573 It->second != CurReg)))
[all...] |
| /external/ltrace/ |
| proc.c | 7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License as
12 * This program is distributed in the hope that it will be useful, but
257 * case, it's safe to pretend that there are no
461 /* If it's not a syscall, we need to find the
493 * easily free it, untracing is more work. */
638 struct process *it = start_after == NULL ? list_of_processes local
641 while (it != NULL) {
643 struct process *next = it->next;
644 switch ((*cb)(it, data))
663 struct process *it = start_after == NULL ? proc->leader local
[all...] |
| /external/openfst/src/include/fst/ |
| accumulator.h | 353 for(typename unordered_map<StateId, CacheState>::iterator it = cache_.begin();
354 it != cache_.end();
355 ++it)
356 delete it->second.weights;
362 typename unordered_map<StateId, CacheState>::iterator it = cache_.find(s); local
363 if (it != cache_.end()) {
364 it->second.recent = true;
365 return it->second.weights;
394 // 'cache_size_' is 2/3 of 'cache_limit_'. If it does not free enough
398 typename unordered_map<StateId, CacheState>::iterator it = cache_.begin() local
[all...] |
| edit-fst.h | 46 // requires that the Fst implementation it wraps provides consistent, reliable
128 IdMapIterator it = GetEditedIdMapIterator(s); local
129 return it == NotInEditedMap() ?
130 wrapped->Final(s) : edits_.Final(it->second);
138 IdMapIterator it = GetEditedIdMapIterator(s); local
139 return it == NotInEditedMap() ?
140 wrapped->NumArcs(s) : edits_.NumArcs(it->second);
144 IdMapIterator it = GetEditedIdMapIterator(s); local
145 return it == NotInEditedMap() ?
147 edits_.NumInputEpsilons(it->second)
151 IdMapIterator it = GetEditedIdMapIterator(s); local
171 IdMapIterator it = GetEditedIdMapIterator(s); local
[all...] |
| /external/parameter-framework/parameter/ |
| ConfigurableDomain.cpp | 55 ConfigurableElementListIterator it; local
57 for (it = _configurableElementList.begin(); it != _configurableElementList.end(); ++it) {
59 CConfigurableElement* pConfigurableElement = *it;
160 ConfigurableElementListIterator it; local
162 for (it = _configurableElementList.begin(); it != _configurableElementList.end(); ++it) {
164 const CConfigurableElement* pConfigurableElement = *it;
434 ConfigurableElementListIterator it; local
606 ConfigurableElementListIterator it; local
664 ConfigurableElementListIterator it; local
868 ConfigurableElementListIterator it; local
975 ConfigurableElementListIterator it; local
993 ConfigurableElementListIterator it; local
[all...] |
| /external/regex-re2/re2/ |
| compile.cc | 21 // It's kind of sleazy, but it works well in practice.
128 // Caller is responsible for deleting Prog when finished with it.
143 // each node in depth-first order. It invokes PreVisit before
476 // and it reduces the corresponding one-pass NFA from 16 nodes to 8.
506 map<uint64, int>::iterator it = rune_cache_.find(key); local
507 if (it != rune_cache_.end())
508 return it->second;
565 // with a dot in it about 10% faster.
799 // behaves the same on A-Z as it does on a-z
[all...] |
| regexp.cc | 52 // If it's possible to destroy this regexp without recurring,
333 // The parse flags remember whether it's \z or (?-m:$),
719 iterator it = ranges_.find(RuneRange(lo, lo)); local
720 if (it != end() && it->lo <= lo && hi <= it->hi)
725 // If it exists, take it out and increase our range.
727 iterator it = ranges_.find(RuneRange(lo-1, lo-1)); local
728 if (it != end())
740 iterator it = ranges_.find(RuneRange(hi+1, hi+1)); local
753 iterator it = ranges_.find(RuneRange(lo, hi)); local
812 iterator it = ranges_.find(RuneRange(r + 1, Runemax)); local
834 iterator it = begin(); local
[all...] |
| /external/v8/src/ic/arm/ |
| handler-compiler-arm.cc | 64 // Save value register, so we can restore it later.
356 HeapType::Iterator<Map> it = field_type->Classes(); local
357 if (!it.Done()) {
361 __ CompareMap(scratch1, it.Current(), &do_store);
362 it.Advance();
363 if (it.Done()) {
489 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
493 __ CompareMap(scratch1(), it.Current(), &do_store);
494 it.Advance();
495 if (it.Done())
[all...] |
| /external/v8/src/ic/arm64/ |
| handler-compiler-arm64.cc | 221 // Save value register, so we can restore it later.
405 HeapType::Iterator<Map> it = field_type->Classes(); local
406 if (!it.Done()) {
410 __ CompareMap(scratch1, it.Current());
411 it.Advance();
412 if (it.Done()) {
526 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
530 __ CompareMap(scratch1(), it.Current());
531 it.Advance();
532 if (it.Done())
[all...] |
| /external/v8/src/ic/ia32/ |
| handler-compiler-ia32.cc | 121 // the version above. It is an optimization that should will be removed
224 // Save value register, so we can restore it later.
353 HeapType::Iterator<Map> it = field_type->Classes(); local
354 if (!it.Done()) {
357 __ CompareMap(value_reg, it.Current());
358 it.Advance();
359 if (it.Done()) {
480 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
483 __ CompareMap(value_reg, it.Current());
484 it.Advance()
[all...] |
| /external/v8/src/ic/mips/ |
| handler-compiler-mips.cc | 64 // Save value register, so we can restore it later.
349 HeapType::Iterator<Map> it = field_type->Classes(); local
351 if (!it.Done()) {
356 current = it.Current();
357 it.Advance();
358 if (it.Done()) {
485 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
491 current = it.Current();
492 it.Advance();
493 if (it.Done())
[all...] |
| /external/v8/src/ic/mips64/ |
| handler-compiler-mips64.cc | 64 // Save value register, so we can restore it later.
349 HeapType::Iterator<Map> it = field_type->Classes(); local
351 if (!it.Done()) {
356 current = it.Current();
357 it.Advance();
358 if (it.Done()) {
485 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
491 current = it.Current();
492 it.Advance();
493 if (it.Done())
[all...] |
| /external/v8/src/ic/x64/ |
| handler-compiler-x64.cc | 211 // Save value register, so we can restore it later.
348 HeapType::Iterator<Map> it = field_type->Classes(); local
349 if (!it.Done()) {
352 __ CompareMap(value_reg, it.Current());
353 it.Advance();
354 if (it.Done()) {
474 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
477 __ CompareMap(value_reg, it.Current());
478 it.Advance();
479 if (it.Done())
[all...] |
| /external/v8/src/ic/x87/ |
| handler-compiler-x87.cc | 121 // the version above. It is an optimization that should will be removed
224 // Save value register, so we can restore it later.
353 HeapType::Iterator<Map> it = field_type->Classes(); local
354 if (!it.Done()) {
357 __ CompareMap(value_reg, it.Current());
358 it.Advance();
359 if (it.Done()) {
482 HeapType::Iterator<Map> it = lookup->GetFieldType()->Classes(); local
485 __ CompareMap(value_reg, it.Current());
486 it.Advance()
[all...] |
| /external/vixl/src/vixl/a64/ |
| instrument-a64.cc | 122 // Set up the output stream. If datafile is non-NULL, use that file. If it
154 std::list<Counter*>::iterator it; local
155 for (it = counters_.begin(); it != counters_.end(); it++) {
156 delete *it;
181 std::list<Counter*>::const_iterator it; local
182 for (it = counters_.begin(); it != counters_.end(); it++)
193 std::list<Counter*>::const_iterator it; local
223 std::list<Counter*>::const_iterator it; local
241 std::list<Counter*>::iterator it; local
249 std::list<Counter*>::iterator it; local
[all...] |
| /external/webp/src/enc/ |
| analysis.c | 240 static int MBAnalyzeBestIntra16Mode(VP8EncIterator* const it) {
246 VP8MakeLuma16Preds(it);
251 VP8CollectHistogram(it->yuv_in_ + Y_OFF,
252 it->yuv_p_ + VP8I16ModeOffsets[mode],
260 VP8SetIntra16Mode(it, best_mode);
264 static int MBAnalyzeBestIntra4Mode(VP8EncIterator* const it,
272 VP8IteratorStartI4(it);
277 const uint8_t* const src = it->yuv_in_ + Y_OFF + VP8Scan[it->i4_];
279 VP8MakeIntra4Preds(it);
397 VP8EncIterator it; member in struct:__anon21222
[all...] |
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPUtilsImpl.java | 7 // of the Adobe license agreement accompanying it.
103 // hurl if it isn't the right form.
126 for (Iterator it = arrayNode.iterateChildren(); it.hasNext();)
128 currItem = (XMPNode) it.next();
136 if (it.hasNext())
266 // This is not a matching quote, just append it to the
272 // This is a "matching" quote. Is it doubled, or the
291 // This is doubled, copy it and skip the double.
298 // This is an undoubled, non-closing quote, copy it
[all...] |
| /frameworks/av/media/libmedia/ |
| IOMX.cpp | 621 for (List<ComponentInfo>::iterator it = list.begin();
622 it != list.end(); ++it) {
623 ComponentInfo &cur = *it;
1082 std::list<omx_message>::const_iterator it = messages.cbegin(); local
[all...] |
| /frameworks/av/media/libstagefright/ |
| MP3Extractor.cpp | 301 // While it is safe to send the XING/VBRI frame to the decoder, this will
632 ID3::Iterator *it = new ID3::Iterator(id3, kMap[i].tag1); local
633 if (it->done()) {
634 delete it;
635 it = new ID3::Iterator(id3, kMap[i].tag2);
638 if (it->done()) {
639 delete it;
644 it->getString(&s);
645 delete it;
|
| /frameworks/av/media/libstagefright/omx/tests/ |
| OMXHarness.cpp | 69 for (std::list<omx_message>::const_iterator it = messages.cbegin(); it != messages.cend(); ) {
70 mMessageQueue.push_back(*it++);
131 List<omx_message>::iterator it = mMessageQueue.begin(); local
132 while (it != mMessageQueue.end()) {
133 if ((*it).node == node) {
134 if (handleBufferMessage(*it, inputBuffers, outputBuffers)) {
135 it = mMessageQueue.erase(it);
139 *msg = *it;
[all...] |
| /frameworks/base/core/java/android/os/ |
| RecoverySystem.java | 124 * before installing it. Note that the package is also verified
127 * package was successfully verified; otherwise it will throw an
211 Iterator<Certificate> it = encCerts.iterator(); local
213 if (it.hasNext()) {
215 InputStream is = new ByteArrayInputStream(it.next().getEncoded());
464 RECOVERY_DIR.mkdirs(); // In case we need it
465 COMMAND_FILE.delete(); // In case it's not writable
|
| /frameworks/base/drm/jni/ |
| android_drm_DrmManagerClient.cpp | 368 DrmSupportInfo::FileSuffixIterator it = info.getFileSuffixIterator(); local
369 while (it.hasNext()) {
370 String8 value = it.next();
559 DrmInfo::KeyIterator it = pDrmInfo->keyIterator(); local
563 while (it.hasNext()) {
564 String8 key = it.next();
|
| /frameworks/base/media/java/android/media/ |
| SubtitleTrack.java | 135 for(Iterator<Pair<Long, Cue> > it =
136 mCues.entriesBetween(mLastUpdateTimeMs, timeMs).iterator(); it.hasNext(); ) {
137 Pair<Long, Cue> event = it.next();
145 it.remove();
329 // handle as it we are not playing
349 // even with synchronized, it is possible that we are going
|
| /frameworks/base/services/core/java/com/android/server/am/ |
| CompatModePackages.java | 164 // any current settings for it.
374 final Iterator<Map.Entry<String, Integer>> it = pkgs.entrySet().iterator(); local
375 while (it.hasNext()) {
376 Map.Entry<String, Integer> entry = it.next();
|
