| /external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| D | erase_key.pass.cpp | 26 typedef M::size_type I; in main() typedef
39 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
91 typedef M::size_type I; in main() typedef
104 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_iter_iter.pass.cpp | 26 typedef M::iterator I; in main() typedef
38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
93 typedef M::iterator I; in main() typedef
105 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_iter.pass.cpp | 34 typedef M::iterator I; in main() typedef
47 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
162 typedef M::iterator I; in main() typedef
175 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
292 typedef C::iterator I; in main() typedef
|
| /external/libcxx/test/std/containers/associative/set/ |
| D | erase_iter_iter.pass.cpp | 26 typedef M::iterator I; in main() typedef
38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
85 typedef M::iterator I; in main() typedef
97 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_key.pass.cpp | 26 typedef M::size_type I; in main() typedef
38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
116 typedef M::size_type I; in main() typedef
128 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_iter.pass.cpp | 34 typedef M::iterator I; in main() typedef
46 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
113 typedef M::iterator I; in main() typedef
125 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
194 typedef C::iterator I; in main() typedef
|
| /external/libcxx/test/std/containers/associative/map/map.modifiers/ |
| D | erase_iter_iter.pass.cpp | 26 typedef M::iterator I; in main() typedef
38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
93 typedef M::iterator I; in main() typedef
105 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_iter.pass.cpp | 34 typedef M::iterator I; in main() typedef
46 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
141 typedef M::iterator I; in main() typedef
153 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
250 typedef C::iterator I; in main() typedef
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter_iter.pass.cpp | 26 typedef M::iterator I; in main() typedef
38 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
85 typedef M::iterator I; in main() typedef
97 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_key.pass.cpp | 26 typedef M::size_type I; in main() typedef
39 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
79 typedef M::size_type I; in main() typedef
92 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
|
| D | erase_iter.pass.cpp | 34 typedef M::iterator I; in main() typedef
46 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
113 typedef M::iterator I; in main() typedef
125 M m(ar, ar + sizeof(ar)/sizeof(ar[0])); in main() local
194 typedef C::iterator I; in main() typedef
|
| /external/mesa3d/src/gallium/drivers/r600/sb/ |
| D | sb_gcm.cpp | 52 for (node_iterator N, I = pending.begin(), E = pending.end(); in run() local
111 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in collect_instructions() local
124 for (node_iterator I = c->begin(), E = c->end(); I != E; ++I) { in collect_instructions() local
140 for (node_iterator I = n->begin(), E = n->end(); I != E; ++I) { in sched_early() local
181 for (sq_iterator N, I = ready.begin(), E = ready.end(); I != E; in td_sched_bb() local
202 for (uselist::iterator I = v->uses.begin(), E = v->uses.end(); I != E; ++I) { in td_release_val() local
230 for (vvec::iterator I = v.begin(), E = v.end(); I != E; ++I) { in td_release_uses() local
259 for (node_riterator I = n->rbegin(), E = n->rend(); I != E; ++I) { in sched_late() local
300 for (node_list::iterator I = pending_nodes.begin(), in bu_sched_bb() local
312 for (vvec::iterator I = pending_defs.begin(), E = pending_defs.end(); in bu_sched_bb() local
[all …]
|
| D | sb_ssa_builder.cpp | 40 for (val_set::iterator I = vars.begin(sh), E = vars.end(sh); I != E; ++I) { in create_phi_nodes() local
51 for (vvec::iterator I = n.dst.begin(), E = n.dst.end(); I != E; ++I) { in add_defs() local
141 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() local
145 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() local
213 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() local
217 for (node_iterator I = n.begin(), E = n.end(); I != E; ++I) { in visit() local
323 for(vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) { in rename_src_vec() local
348 for(vvec::iterator I = vv.begin(), E = vv.end(); I != E; ++I) { in rename_dst_vec() local
367 unsigned ssa_rename::get_index(def_map& m, value* v) { in get_index()
368 def_map::iterator I = m.find(v); in get_index() local
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Analysis/IPA/ |
| D | FindUsedTypes.cpp | 39 for (Type::subtype_iterator I = Ty->subtype_begin(), E = Ty->subtype_end(); in IncorporateType() local
59 bool FindUsedTypes::runOnModule(Module &m) { in runOnModule()
63 for (Module::const_global_iterator I = m.global_begin(), E = m.global_end(); in runOnModule() local
79 const Instruction &I = *II; in runOnModule() local
97 for (SetVector<Type *>::const_iterator I = UsedTypes.begin(), in print() local
|
| /external/clang/lib/Analysis/ |
| D | CFGStmtMap.cpp | 23 static SMap *AsMap(void *m) { return (SMap*) m; } in AsMap()
34 SMap::iterator I = SM->find(X); in getBlock() local
51 for (CFGBlock::iterator I = B->begin(), E = B->end(); I != E; ++I) { in Accumulate() local
86 for (CFG::iterator I = C->begin(), E = C->end(); I != E; ++I) in Build() local
|
| /external/eigen/bench/ |
| D | benchmarkXcwise.cpp | 23 VECTYPE I = VECTYPE::Ones(VECSIZE); in main() local
24 VECTYPE m(VECSIZE,1); in main() local
|
| D | benchmark.cpp | 24 Matrix<SCALAR,MATSIZE,MATSIZE> I = Matrix<SCALAR,MATSIZE,MATSIZE>::Ones(); in main() local
25 Matrix<SCALAR,MATSIZE,MATSIZE> m; in main() local
|
| D | benchmarkX.cpp | 24 MATTYPE I = MATTYPE::Ones(MATSIZE,MATSIZE); in main() local
25 MATTYPE m(MATSIZE,MATSIZE); in main() local
|
| D | basicbenchmark.h | 11 void benchBasic_loop(const MatrixType& I, MatrixType& m, int iterations) in benchBasic_loop()
|
| /external/llvm/lib/Target/NVPTX/ |
| D | NVPTXUtilities.cpp | 69 static void cacheAnnotationFromMD(const Module *m, const GlobalValue *gv) { in cacheAnnotationFromMD()
105 const Module *m = gv->getParent(); in findOneNVVMAnnotation() local
119 const Module *m = gv->getParent(); in findAllNVVMAnnotation() local
319 bool llvm::getAlign(const CallInst &I, unsigned index, unsigned &align) { in getAlign()
344 if (Instruction *I = dyn_cast<Instruction>(v)) in getParentBlock() local
354 if (Instruction *I = dyn_cast<Instruction>(v)) in getParentFunction() local
385 Instruction *I = &*it; in getInst() local
396 Instruction *I = getInst(base, instName); in dumpInst() local
403 if (Instruction *I = dyn_cast<Instruction>(v)) { in dumpInstRec() local
428 if (Instruction *I = dyn_cast<Instruction>(v)) { in dumpParent() local
|
| /external/clang/test/CodeGenCXX/ |
| D | mangle-ms-templates-memptrs.cpp | 8 struct I { union { struct { int a, b; }; }; }; argument
33 M m; in ReadFields() local
93 M m; in CallMethods() local
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | ScheduleDAGInstrs.cpp | 141 for (MachineBasicBlock::livein_iterator I = Header->livein_begin(), in StartBlock() local
179 for (MachineBasicBlock::livein_iterator I = (*SI)->livein_begin(), in AddSchedBarrierDeps() local
351 LoopDependencies::LoopDeps::iterator I = LoopRegs.Deps.find(Reg); in BuildSchedGraph() local
427 for (std::map<const Value *, SUnit *>::iterator I = in BuildSchedGraph() local
431 for (std::map<const Value *, std::vector<SUnit *> >::iterator I = in BuildSchedGraph() local
449 for (unsigned k = 0, m = PendingLoads.size(); k != m; ++k) in BuildSchedGraph() local
451 for (std::map<const Value *, SUnit *>::iterator I = AliasMemDefs.begin(), in BuildSchedGraph() local
455 for (std::map<const Value *, std::vector<SUnit *> >::iterator I = in BuildSchedGraph() local
470 std::map<const Value *, SUnit *>::iterator I = in BuildSchedGraph() local
498 for (unsigned k = 0, m = PendingLoads.size(); k != m; ++k) in BuildSchedGraph() local
[all …]
|
| /external/swiftshader/third_party/LLVM/lib/Archive/ |
| D | ArchiveReader.cpp | 346 for (iterator I=begin(), E=end(); I != E; ++I) { in getAllModules() local
494 Module *m = getLazyBitcodeModule(Buffer, Context, ErrMsg); in findModuleDefiningSymbol() local
546 for (std::vector<std::string>::iterator I = symbols.begin(), in findModulesDefiningSymbols() local
572 for (std::set<std::string>::iterator I=symbols.begin(), in findModulesDefiningSymbols() local
575 Module* m = findModuleDefiningSymbol(*I,error); in findModulesDefiningSymbols() local
611 for (iterator I = begin(), E = end(); I != E; ++I) { in isBitcodeArchive() local
|
| /external/clang/test/CXX/special/class.copy/ |
| D | implicit-move-def.cpp | 23 E m; member
61 struct I { struct
67 I i; in h() argument
|
| /external/clang/test/Analysis/ |
| D | templates.cpp | 25 template<class T> void MyClass<T>::I() { in I() function in MyClass
30 Mf m; in main() local
|