| /external/clang/lib/Frontend/ |
| InitPreprocessor.cpp | 194 const TargetInfo &TI, MacroBuilder &Builder) {
195 DefineTypeSize(MacroName, TI.getTypeWidth(Ty), TI.getTypeConstantSuffix(Ty),
196 TI.isTypeSigned(Ty), Builder);
205 const TargetInfo &TI, MacroBuilder &Builder) {
206 Builder.defineMacro(MacroName, Twine(TI.getTypeWidth(Ty)));
210 const TargetInfo &TI, MacroBuilder &Builder) {
212 Twine(BitWidth / TI.getCharWidth()));
216 const TargetInfo &TI,
218 int TypeWidth = TI.getTypeWidth(Ty)
[all...] |
| /external/llvm/lib/Support/ |
| ARMBuildAttrs.cpp | 78 for (unsigned TI = 0, TE = sizeof(ARMAttributeTags) / sizeof(*ARMAttributeTags);
79 TI != TE; ++TI)
80 if (ARMAttributeTags[TI].Attr == Attr)
81 return ARMAttributeTags[TI].TagName + (HasTagPrefix ? 0 : 4);
87 for (unsigned TI = 0, TE = sizeof(ARMAttributeTags) / sizeof(*ARMAttributeTags);
88 TI != TE; ++TI)
89 if (StringRef(ARMAttributeTags[TI].TagName + (HasTagPrefix ? 0 : 4)) == Tag)
90 return ARMAttributeTags[TI].Attr
[all...] |
| Threading.cpp | 39 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg);
40 TI->UserFn(TI->UserData);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 78 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the
90 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum,
109 TerminatorInst *TI = (*PI)->getTerminator();
110 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
111 if (TI->getSuccessor(i) == Succ)
112 MadeChange |= !!SplitCriticalEdge(TI, i, P);
124 TerminatorInst *TI = Src->getTerminator();
127 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
128 if (TI->getSuccessor(i) == Dst)
129 return SplitCriticalEdge(TI, i, P, MergeIdenticalEdges
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 71 TerminatorInst *TI = I->getTerminator();
72 if (TI->getNumSuccessors() > 1 && !isa<IndirectBrInst>(TI))
73 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
74 if (SplitCriticalEdge(TI, i, this)) {
129 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the
141 BasicBlock *llvm::SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum,
145 if (!isCriticalEdge(TI, SuccNum, MergeIdenticalEdges)) return nullptr;
147 assert(!isa<IndirectBrInst>(TI) &&
150 BasicBlock *TIBB = TI->getParent()
[all...] |
| DemoteRegToStack.cpp | 91 TerminatorInst *TI = &cast<TerminatorInst>(I);
92 assert (isCriticalEdge(TI, SuccNum) &&
94 BasicBlock *BB = SplitCriticalEdge(TI, SuccNum);
|
| CodeExtractor.cpp | 238 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator();
239 TI->replaceUsesOfWith(OldPred, NewBB);
366 TerminatorInst *TI = newFunction->begin()->getTerminator();
368 GetElementPtrInst::Create(AI, Idx, "gep_" + inputs[i]->getName(), TI);
369 RewriteVal = new LoadInst(GEP, "loadgep_" + inputs[i]->getName(), TI);
397 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(Users[i]))
398 if (!Blocks.count(TI->getParent()) &&
399 TI->getParent()->getParent() == oldFunction)
400 TI->replaceUsesOfWith(header, newHeader);
528 TerminatorInst *TI = (*i)->getTerminator()
[all...] |
| /external/llvm/lib/Analysis/ |
| SparsePropagation.cpp | 121 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI,
124 Succs.resize(TI.getNumSuccessors());
125 if (TI.getNumSuccessors() == 0) return;
127 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) {
162 if (isa<InvokeInst>(TI)) {
169 if (isa<IndirectBrInst>(TI)) {
174 SwitchInst &SI = cast<SwitchInst>(TI);
184 Succs.assign(TI.getNumSuccessors(), true);
195 Succs.assign(TI.getNumSuccessors(), true);
208 TerminatorInst *TI = From->getTerminator()
[all...] |
| BranchProbabilityInfo.cpp | 127 TerminatorInst *TI = BB->getTerminator();
128 if (TI->getNumSuccessors() == 0) {
129 if (isa<UnreachableInst>(TI))
146 if (UnreachableEdges.size() == TI->getNumSuccessors())
151 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
177 TerminatorInst *TI = BB->getTerminator();
178 if (TI->getNumSuccessors() == 1)
180 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI))
183 MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof)
[all...] |
| CFG.cpp | 87 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
89 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
90 if (TI->getNumSuccessors() == 1) return false;
92 const BasicBlock *Dest = TI->getSuccessor(SuccNum);
98 ++I; // Skip one edge due to the incoming arc from TI.
103 // non-critical iff all preds come from TI's block.
|
| LoopInfo.cpp | 243 TerminatorInst *TI = (*I)->getTerminator();
247 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
248 if (TI->getSuccessor(i) == H) {
249 MD = TI->getMetadata(LoopMDName);
280 TerminatorInst *TI = (*I)->getTerminator();
281 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) {
282 if (TI->getSuccessor(i) == H)
283 TI->setMetadata(LoopMDName, LoopID);
|
| /external/clang/test/Sema/ |
| 128bitint.c | 5 typedef int i128 __attribute__((__mode__(TI)));
6 typedef unsigned u128 __attribute__((__mode__(TI)));
|
| /external/clang/lib/CodeGen/ |
| CGLoopInfo.cpp | 101 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(I)) {
102 for (unsigned i = 0, ie = TI->getNumSuccessors(); i < ie; ++i)
103 if (TI->getSuccessor(i) == L.getHeader()) {
104 TI->setMetadata("llvm.loop", L.getLoopID());
|
| /external/llvm/include/llvm/Analysis/ |
| CFG.h | 49 bool isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
|
| SparsePropagation.h | 195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
200 void visitTerminatorInst(TerminatorInst &TI);
|
| /external/compiler-rt/lib/builtins/ |
| int_types.h | 64 typedef int ti_int __attribute__ ((mode (TI)));
65 typedef unsigned tu_int __attribute__ ((mode (TI)));
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZLongBranch.cpp | 334 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin();
339 skipTerminator(Position, *TI, true);
340 ++TI;
435 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin();
440 assert(Position.Address <= TI->Address &&
442 if (mustRelaxBranch(*TI, Position.Address))
443 relaxBranch(*TI);
444 skipTerminator(Position, *TI, false);
445 ++TI;
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSelect.cpp | 146 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
148 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI,
150 if (TI->getNumOperands() == 1) {
153 if (TI->isCast()) {
155 if (TI->getOperand(0)->getType() != FIOpndTy)
168 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0),
170 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI,
171 TI->getType());
175 if (!isa<BinaryOperator>(TI))
[all...] |
| /external/llvm/include/llvm/ |
| PassRegistry.h | 71 const PassInfo *getPassInfo(const void *TI) const;
|
| /external/llvm/unittests/IR/ |
| IRBuilderTest.cpp | 86 TerminatorInst *TI = BB->getTerminator();
87 EXPECT_EQ(BI, TI);
88 EXPECT_EQ(2u, TI->getNumSuccessors());
89 EXPECT_EQ(TBB, TI->getSuccessor(0));
90 EXPECT_EQ(FBB, TI->getSuccessor(1));
95 TI = BB->getTerminator();
96 EXPECT_EQ(BI, TI);
97 EXPECT_EQ(2u, TI->getNumSuccessors());
98 EXPECT_EQ(TBB, TI->getSuccessor(0));
99 EXPECT_EQ(FBB, TI->getSuccessor(1))
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| SCCP.cpp | 443 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs);
469 void visitTerminatorInst(TerminatorInst &TI);
517 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI,
519 Succs.resize(TI.getNumSuccessors());
520 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) {
541 if (isa<InvokeInst>(TI)) {
547 if (SwitchInst *SI = dyn_cast<SwitchInst>(&TI)) {
558 Succs.assign(TI.getNumSuccessors(), true);
567 if (isa<IndirectBrInst>(&TI)) {
569 Succs.assign(TI.getNumSuccessors(), true)
[all...] |
| /external/clang/lib/AST/ |
| Mangle.cpp | 66 const TargetInfo &TI = Context.getTargetInfo();
67 const llvm::Triple &Triple = TI.getTriple();
72 TI.getCXXABI() == TargetCXXABI::Microsoft)
136 const TargetInfo &TI = Context.getTargetInfo();
137 if (CC == SOF_OTHER || (MCXX && TI.getCXXABI() == TargetCXXABI::Microsoft)) {
|
| /external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
| SkPdfChoiceFieldDictionary_autogen.cpp | 23 int64_t SkPdfChoiceFieldDictionary::TI(SkPdfNativeDoc* doc) {
24 SkPdfNativeObject* ret = get("TI", "");
32 return get("TI", "") != NULL;
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 342 TerminatorInst *TI = getTerminator();
343 if (!TI)
347 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
348 BasicBlock *Succ = TI->getSuccessor(i);
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| GCOVProfiling.cpp | 514 TerminatorInst *TI = BB->getTerminator();
515 if (int successors = TI->getNumSuccessors()) {
517 Block.addEdge(Func.getBlock(TI->getSuccessor(i)));
519 } else if (isa<ReturnInst>(TI)) {
584 TerminatorInst *TI = BB->getTerminator();
585 if (isa<ReturnInst>(TI))
588 Edges += TI->getNumSuccessors();
605 TerminatorInst *TI = BB->getTerminator();
606 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors()
[all...] |
