Searched defs:It (Results 1 - 25 of 32) sorted by relevance

12

/external/stlport/test/compiler/StTerm-order/
H A Dstterm-test.cc19 It ctor done <-- 0
23 It dtor done <-- 0
32 It ctor done <-- 0
38 It dtor done <-- 0
66 class It class
69 It();
70 ~It();
89 static It it;
104 It::It() function in class:It
[all...]
/external/chromium/chrome/browser/chromeos/login/
H A Dsigned_settings_temp_storage_unittest.cc45 typedef std::map<std::string, std::string>::iterator It; typedef
46 std::vector<It> a_list;
47 for (It it = ref_map_.begin(); it != ref_map_.end(); ++it) {
51 std::vector<It> b_list(a_list);
/external/clang/test/SemaTemplate/
H A Doverload-uneval.cpp27 class It class in class:Wibble
33 inline bool operator!=(const It &o) const { return i !=
39 Wibble<void*>::It a, b;
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineWorklist.h67 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I); local
68 if (It == WorklistMap.end()) return; // Not in worklist.
71 Worklist[It->second] = 0;
73 WorklistMap.erase(It);
H A DInstCombineLoadStoreAlloca.cpp196 BasicBlock::iterator It = New; local
197 while (isa<AllocaInst>(*It) || isa<DbgInfoIntrinsic>(*It)) ++It;
208 InsertNewInstBefore(GEP, *It);
/external/clang/include/clang/AST/
H A DDeclLookups.h26 StoredDeclsMap::iterator It, End; member in class:clang::DeclContext::all_lookups_iterator
35 all_lookups_iterator(StoredDeclsMap::iterator It, argument
37 : It(It), End(End) {}
39 reference operator*() const { return It->second.getLookupResult(); }
40 pointer operator->() const { return It->second.getLookupResult(); }
47 ++It;
48 } while (It != End &&
49 It->first == DeclarationName::getUsingDirectiveName());
61 return x.It
[all...]
/external/llvm/include/llvm/Support/
H A DGetElementPtrTypeIterator.h33 static generic_gep_type_iterator begin(Type *Ty, ItTy It) { argument
36 I.OpIt = It;
39 static generic_gep_type_iterator end(ItTy It) { argument
42 I.OpIt = It;
62 // This is a non-standard operator->. It allows you to call methods on the
H A DCFG.h33 USE_iterator It; member in class:llvm::PredIterator
37 while (!It.atEnd() && !isa<TerminatorInst>(*It))
38 ++It;
45 explicit inline PredIterator(Ptr *bb) : It(bb->use_begin()) {
48 inline PredIterator(Ptr *bb, bool) : It(bb->use_end()) {}
50 inline bool operator==(const Self& x) const { return It == x.It; }
54 assert(!It.atEnd() && "pred_iterator out of range!");
55 return cast<TerminatorInst>(*It)
[all...]
/external/llvm/include/llvm/CodeGen/
H A DFunctionLoweringInfo.h191 DenseMap<const Value*, unsigned>::const_iterator It = ValueMap.find(PN); local
192 if (It == ValueMap.end())
195 unsigned Reg = It->second;
/external/clang/tools/arcmt-test/
H A Darcmt-test.cpp265 std::map<StringRef, StringRef>::iterator It; local
266 It = resultMap.find(sys::path::filename(inputOrigFname));
267 if (It == resultMap.end()) {
274 sys::fs::exists(It->second, exists);
276 errs() << "error: '" << It->second << "' does not exist\n";
285 if (!filesCompareEqual(It->second, inputResultFname)) {
286 errs() << "error: '" << It->second << "' is different than "
291 resultMap.erase(It);
/external/llvm/include/llvm/ADT/
H A DDepthFirstIterator.h105 ChildItTy &It = Top.second; local
108 It = GT::child_begin(Node);
112 while (It != GT::child_end(Node)) {
113 NodeType *Next = *It++;
H A DSTLExtras.h57 // delete on something. It is used like this:
98 inline mapped_iterator(const mapped_iterator &It) argument
99 : current(It.current), Fn(It.Fn) {}
/external/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp10 // This file implements some loop unrolling utilities. It does not define any
45 ValueToValueMapTy::iterator It = VMap.find(Op); local
46 if (It != VMap.end())
47 I->setOperand(op, It->second);
52 ValueToValueMapTy::iterator It = VMap.find(PN->getIncomingBlock(i)); local
53 if (It != VMap.end())
54 PN->setIncomingBlock(i, cast<BasicBlock>(It->second));
270 for (unsigned It = 1; It != Count; ++It) {
307 ValueToValueMapTy::iterator It = LastValueMap.find(Incoming); local
[all...]
H A DPromoteMemoryToRegister.cpp10 // This file promotes memory references to be register references. It promotes
23 // It has been modified to not explicitly use the DJ graph data structure and to
173 DenseMap<const Instruction *, unsigned>::iterator It = InstNumbers.find(I); local
174 if (It != InstNumbers.end()) return It->second;
185 It = InstNumbers.find(I);
187 assert(It != InstNumbers.end() && "Didn't insert instruction?");
188 return It->second;
709 // Okay, we found a load before a store to the alloca. It is actually
/external/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h83 IDToNodeMap::const_iterator It = NodeMap.find(ID); local
84 if (It == NodeMap.end()) {
87 return It->second.get<T>();
716 /// but not actually used. It will always be instantiated with a type
/external/llvm/lib/Analysis/
H A DMemoryDependenceAnalysis.cpp11 // operation, what preceding memory operations it depends on. It builds on
83 /// getAnalysisUsage - Does not modify anything. It uses Alias Analysis.
376 // pointer, not on query pointers that are indexed off of them. It'd
1189 // for the given block. It assumes that we haven't modified any of
1237 CachedNonLocalPointerInfo::iterator It = local
1239 if (It == NonLocalPointerDeps.end()) return;
1243 NonLocalDepInfo &PInfo = It->second.NonLocalDeps;
1255 NonLocalPointerDeps.erase(It);
H A DScalarEvolution.cpp672 /// BinomialCoefficient - Compute BC(It, K). The result has width W.
674 static const SCEV *BinomialCoefficient(const SCEV *It, unsigned K, argument
679 return SE.getTruncateOrZeroExtend(It, ResultTy);
681 // We are using the following formula for BC(It, K):
683 // BC(It, K) = (It * (It - 1) * ... * (It - K + 1)) / K!
695 // BC(It, K) = (It * (I
793 evaluateAtIteration(const SCEV *It, ScalarEvolution &SE) const argument
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp526 LeafMap::iterator It = Leaves.find(Op); local
527 if (It == Leaves.end()) {
539 } else if (It != Leaves.end()) {
544 IncorporateWeight(It->second, Weight, Opcode);
558 DEBUG(dbgs() << "UNLEAF: " << *Op << " (" << It->second << ")\n");
559 Worklist.push_back(std::make_pair(BO, It->second));
560 Leaves.erase(It);
571 Weight = It->second;
572 Leaves.erase(It); // Since the value may be morphed below.
610 LeafMap::iterator It local
[all...]
H A DLoopUnswitch.cpp849 ValueToValueMapTy::iterator It = VMap.find(V); local
850 if (It != VMap.end()) V = It->second;
897 // It's possible that simplifying one loop could cause the other to be
H A DSCCP.cpp54 /// an LLVM value may occupy. It is a simple class with value semantics.
1070 DenseMap<GlobalVariable*, LatticeVal>::iterator It = local
1072 if (It != TrackedGlobals.end()) {
1073 mergeInValue(IV, &I, It->second);
1436 // 1. It could be tracked.
1437 // 2. It could be constant-foldable.
1459 // values live. It doesn't really matter which way we force it.
/external/llvm/lib/Target/MBlaze/
H A DMBlazeISelLowering.cpp258 MachineFunction::iterator It = MBB; local
259 ++It;
275 F->insert(It, loop);
276 F->insert(It, finish);
358 MachineFunction::iterator It = MBB; local
359 ++It;
382 F->insert(It, flsBB);
383 F->insert(It, dneBB);
438 MachineFunction::iterator It = MBB; local
439 ++It;
[all...]
/external/llvm/lib/Target/Sparc/
H A DSparcISelLowering.cpp1196 MachineFunction::iterator It = BB; local
1197 ++It;
1208 F->insert(It, copy0MBB);
1209 F->insert(It, sinkMBB);
/external/clang/lib/AST/
H A DDeclCXX.cpp435 // Save this copy-assignment operator. It might be "the one".
1056 /// bases. It might be worth special-casing that, really.
1743 method_iterator It = getASTContext().overridden_methods_begin(this); local
1744 if (It == getASTContext().overridden_methods_end(this))
1747 return cast<CXXConstructorDecl>(*It);
/external/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp342 ResolveConstantsTy::iterator It = local
346 assert(It != ResolveConstants.end() && It->first == *I);
347 NewOp = operator[](It->second);
/external/llvm/lib/Target/XCore/
H A DXCoreISelLowering.cpp1283 MachineFunction::iterator It = BB; local
1284 ++It;
1296 F->insert(It, copy0MBB);
1297 F->insert(It, sinkMBB);

Completed in 680 milliseconds

12