/external/skia/tests/ |
H A D | LListTest.cpp | 72 typedef SkTInternalLList<ListElement>::Iter Iter; typedef 73 Iter iter; 75 ListElement* cur = iter.init(list, Iter::kHead_IterStart); 80 cur = iter.init(list, Iter::kTail_IterStart); 116 cur = iter.init(list, Iter::kHead_IterStart); 124 typedef ElList::Iter Iter; typedef 131 Iter iter1; 132 Iter iter [all...] |
H A D | skia_test.cpp | 48 class Iter { class 50 Iter() { this->reset(); } function in class:Iter 182 Iter iter;
|
/external/chromium_org/sandbox/linux/bpf_dsl/ |
H A D | bpf_dsl.h | 373 typedef typename std::vector<T>::const_iterator Iter; typedef 375 for (Iter i = values.begin(), end = values.end(); i != end; ++i) {
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | block.cc | 76 class Block::Iter : public Iterator { class in class:leveldb::Block 115 Iter(const Comparator* comparator, 264 return new Iter(cmp, data_, restart_offset_, num_restarts);
|
/external/chromium_org/third_party/skia/include/core/ |
H A D | SkTInternalLList.h | 177 class Iter { class in class:SkTInternalLList 184 Iter() : fCurr(NULL) {} function in class:SkTInternalLList::Iter 185 Iter(const Iter& iter) : fCurr(iter.fCurr) {} function in class:SkTInternalLList::Iter 186 Iter& operator= (const Iter& iter) { fCurr = iter.fCurr; return *this; } 229 Iter iter; 230 for (T* item = iter.init(*this, Iter::kHead_IterStart); item; item = iter.next()) {
|
H A D | SkClipStack.h | 364 class Iter { class in class:SkClipStack 367 kBottom_IterStart = SkDeque::Iter::kFront_IterStart, 368 kTop_IterStart = SkDeque::Iter::kBack_IterStart 374 Iter(); 376 Iter(const SkClipStack& stack, IterStart startLoc); 398 SkDeque::Iter fIter; 403 * It inherits privately from Iter to prevent access to reverse iteration. 405 class B2TIter : private Iter { 410 * Wrap Iter's 2 parameter ctor to force initialization to the 417 using Iter [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkDeque.cpp | 241 SkDeque::Iter::Iter() : fCurBlock(NULL), fPos(NULL), fElemSize(0) {} function in class:SkDeque::Iter 243 SkDeque::Iter::Iter(const SkDeque& d, IterStart startLoc) { function in class:SkDeque::Iter 249 void* SkDeque::Iter::next() { 268 void* SkDeque::Iter::prev() { 290 void SkDeque::Iter::reset(const SkDeque& d, IterStart startLoc) {
|
H A D | SkMetaData.cpp | 303 SkMetaData::Iter::Iter(const SkMetaData& metadata) { function in class:SkMetaData::Iter 307 void SkMetaData::Iter::reset(const SkMetaData& metadata) { 311 const char* SkMetaData::Iter::next(SkMetaData::Type* t, int* count) {
|
H A D | SkTDynamicHash.h | 33 class Iter { class in class:SkTDynamicHash 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { function in class:SkTDynamicHash::Iter
|
H A D | SkTLList.h | 18 const typename SkTLList<T>::Iter& location); 43 class Iter; 54 typename NodeList::Iter iter; 55 Node* node = iter.init(fList, Iter::kHead_IterStart); 107 T* addBefore(const T& t, const Iter& location) { 113 T* addAfter(const T& t, const Iter& location) { 118 Iter headIter() const { return Iter(*this, Iter::kHead_IterStart); } 119 Iter tailIte 188 class Iter : private NodeList::Iter { class in class:SkTLList 199 Iter() {} function in class:SkTLList::Iter 201 Iter(const SkTLList& list, IterStart start = kHead_IterStart) { function in class:SkTLList::Iter [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrAllocator.h | 134 class Iter { class in class:GrAllocator 139 Iter(const GrAllocator* allocator) function in class:GrAllocator::Iter 310 class Iter { class in class:GrTAllocator 315 Iter(const GrTAllocator* allocator) : fImpl(&allocator->fAllocator) {} function in class:GrTAllocator::Iter 335 GrAllocator::Iter fImpl;
|
/external/chromium_org/third_party/skia/src/lazy/ |
H A D | SkDiscardableMemoryPool.cpp | 155 typedef SkTInternalLList<PoolDiscardableMemory>::Iter Iter; typedef 156 Iter iter; 157 PoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart);
|
/external/chromium_org/v8/src/third_party/vtune/ |
H A D | vtune-jit.cc | 219 std::list<JITCodeLineInfo::LineNumInfo>::iterator Iter; local 221 for (Iter = vtunelineinfo->begin(); 222 Iter != vtunelineinfo->end(); 223 Iter++) { 225 static_cast<unsigned int>(Iter->pc_); 227 script->GetLineNumber(Iter->pos_) + 1;
|
/external/libcxxabi/src/ |
H A D | private_typeinfo.cpp | 329 typedef const __base_class_type_info* Iter; typedef 330 const Iter e = __base_info + __base_count; 331 Iter p = __base_info; 670 // typedef const __base_class_type_info* Iter; 679 // for (Iter p = __base_info, e= __base_info + __base_count; p < e; ++p) 698 // for (Iter p = __base_info, e = __base_info + __base_count; p < e; ++p) 711 typedef const __base_class_type_info* Iter; typedef 748 const Iter e = __base_info + __base_count; 749 for (Iter p = __base_info; p < e; ++p) 811 const Iter 960 typedef const __base_class_type_info* Iter; typedef 1035 typedef const __base_class_type_info* Iter; typedef [all...] |
/external/llvm/lib/Target/Mips/ |
H A D | MipsLongBranch.cpp | 49 typedef MachineBasicBlock::iterator Iter; typedef in namespace:__anon26053 81 void replaceBranch(MachineBasicBlock &MBB, Iter Br, DebugLoc DL, 217 void MipsLongBranch::replaceBranch(MachineBasicBlock &MBB, Iter Br,
|
H A D | MipsSEFrameLowering.cpp | 34 typedef MachineBasicBlock::iterator Iter; typedef in namespace:__anon26056 58 bool expandInstr(MachineBasicBlock &MBB, Iter I); 59 void expandLoadCCond(MachineBasicBlock &MBB, Iter I); 60 void expandStoreCCond(MachineBasicBlock &MBB, Iter I); 61 void expandLoadACC(MachineBasicBlock &MBB, Iter I, unsigned RegSize); 62 void expandStoreACC(MachineBasicBlock &MBB, Iter I, unsigned MFHiOpc, 64 bool expandCopy(MachineBasicBlock &MBB, Iter I); 65 bool expandCopyACC(MachineBasicBlock &MBB, Iter I, unsigned MFHiOpc, 81 for (Iter I = BB->begin(), End = BB->end(); I != End;) 87 bool ExpandPseudo::expandInstr(MachineBasicBlock &MBB, Iter [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCContract.cpp | 81 inst_iterator &Iter); 210 inst_iterator &Iter) { 287 if (&*Iter == Store) ++Iter; 209 ContractRelease(Instruction *Release, inst_iterator &Iter) argument
|
/external/skia/include/core/ |
H A D | SkTInternalLList.h | 177 class Iter { class in class:SkTInternalLList 184 Iter() : fCurr(NULL) {} function in class:SkTInternalLList::Iter 185 Iter(const Iter& iter) : fCurr(iter.fCurr) {} function in class:SkTInternalLList::Iter 186 Iter& operator= (const Iter& iter) { fCurr = iter.fCurr; return *this; } 229 Iter iter; 230 for (T* item = iter.init(*this, Iter::kHead_IterStart); NULL != item; item = iter.next()) {
|
/external/skia/src/core/ |
H A D | SkDeque.cpp | 241 SkDeque::Iter::Iter() : fCurBlock(NULL), fPos(NULL), fElemSize(0) {} function in class:SkDeque::Iter 243 SkDeque::Iter::Iter(const SkDeque& d, IterStart startLoc) { function in class:SkDeque::Iter 249 void* SkDeque::Iter::next() { 268 void* SkDeque::Iter::prev() { 290 void SkDeque::Iter::reset(const SkDeque& d, IterStart startLoc) {
|
H A D | SkMetaData.cpp | 303 SkMetaData::Iter::Iter(const SkMetaData& metadata) { function in class:SkMetaData::Iter 307 void SkMetaData::Iter::reset(const SkMetaData& metadata) { 311 const char* SkMetaData::Iter::next(SkMetaData::Type* t, int* count) {
|
H A D | SkTDynamicHash.h | 33 class Iter { class in class:SkTDynamicHash 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { function in class:SkTDynamicHash::Iter
|
/external/skia/src/lazy/ |
H A D | SkDiscardableMemoryPool.cpp | 154 typedef SkTInternalLList<PoolDiscardableMemory>::Iter Iter; typedef 155 Iter iter; 156 PoolDiscardableMemory* cur = iter.init(fList, Iter::kTail_IterStart);
|
/external/llvm/lib/MC/ |
H A D | MCContext.cpp | 290 auto Iter = IterBool.first; local 292 return Iter->second; 298 StringRef CachedName = std::get<0>(Iter->first); 302 Iter->second = Result; 314 auto Iter = COFFUniquingMap.find(T); local 315 if (Iter == COFFUniquingMap.end()) 317 return Iter->second;
|
/external/llvm/unittests/Transforms/Utils/ |
H A D | Cloning.cpp | 302 auto Iter = Finder->subprograms().begin(); local 303 DISubprogram Sub1(*Iter); 305 Iter++; 306 DISubprogram Sub2(*Iter); 318 auto Iter = Finder->compile_units().begin(); local 319 DICompileUnit CU1(*Iter); 321 Iter++; 322 DICompileUnit CU2(*Iter);
|
/external/openfst/src/include/fst/ |
H A D | replace-util.h | 328 typedef typename map<Label, size_t>::iterator Iter; typedef 329 for (Iter in = stats_[j].inref.begin(); 338 for (Iter out = stats_[j].outref.begin(); 347 for (Iter out = stats_[j].outref.begin(); 354 for (Iter in = stats_[j].inref.begin();
|