Searched refs:TI (Results 1 - 25 of 80) sorted by relevance

1234

/external/clang/test/Sema/
H A D128bitint.c2 typedef int i128 __attribute__((__mode__(TI)));
3 typedef unsigned u128 __attribute__((__mode__(TI)));
/external/clang/lib/Frontend/
H A DInitPreprocessor.cpp167 const TargetInfo &TI, MacroBuilder &Builder) {
168 DefineTypeSize(MacroName, TI.getTypeWidth(Ty), TI.getTypeConstantSuffix(Ty),
169 TI.isTypeSigned(Ty), Builder);
178 const TargetInfo &TI, MacroBuilder &Builder) {
179 Builder.defineMacro(MacroName, Twine(TI.getTypeWidth(Ty)));
183 const TargetInfo &TI, MacroBuilder &Builder) {
185 Twine(BitWidth / TI.getCharWidth()));
189 const TargetInfo &TI, MacroBuilder &Builder) {
190 int TypeWidth = TI
166 DefineTypeSize(StringRef MacroName, TargetInfo::IntType Ty, const TargetInfo &TI, MacroBuilder &Builder) argument
177 DefineTypeWidth(StringRef MacroName, TargetInfo::IntType Ty, const TargetInfo &TI, MacroBuilder &Builder) argument
182 DefineTypeSizeof(StringRef MacroName, unsigned BitWidth, const TargetInfo &TI, MacroBuilder &Builder) argument
188 DefineExactWidthIntType(TargetInfo::IntType Ty, const TargetInfo &TI, MacroBuilder &Builder) argument
272 InitializeStandardPredefinedMacros(const TargetInfo &TI, const LangOptions &LangOpts, const FrontendOptions &FEOpts, MacroBuilder &Builder) argument
315 InitializePredefinedMacros(const TargetInfo &TI, const LangOptions &LangOpts, const FrontendOptions &FEOpts, MacroBuilder &Builder) argument
[all...]
/external/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h90 bool isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum,
99 /// If MergeIdenticalEdges is true (not the default), *all* edges from TI to the
111 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum,
127 TerminatorInst *TI = (*PI)->getTerminator(); local
128 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
129 if (TI->getSuccessor(i) == Succ)
130 MadeChange |= !!SplitCriticalEdge(TI, i, P);
142 TerminatorInst *TI = Src->getTerminator(); local
145 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!");
146 if (TI
[all...]
/external/llvm/lib/Transforms/Instrumentation/
H A DEdgeProfiling.cpp94 TerminatorInst *TI = BB->getTerminator(); local
95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
97 SplitCriticalEdge(TI, s, this);
102 if (TI->getNumSuccessors() == 1) {
107 IncrementCounterInBlock(TI->getSuccessor(s), i++, Counters);
H A DOptimalEdgeProfiling.cpp171 TerminatorInst *TI = BB->getTerminator(); local
172 if (TI->getNumSuccessors() == 0) {
182 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
183 BasicBlock *Succ = TI->getSuccessor(s);
188 bool wasInserted = SplitCriticalEdge(TI, s, this);
189 Succ = TI->getSuccessor(s);
196 if (TI->getNumSuccessors() == 1) {
H A DGCOVProfiling.cpp390 TerminatorInst *TI = BB->getTerminator(); local
391 if (int successors = TI->getNumSuccessors()) {
393 Block.addEdge(Func.getBlock(TI->getSuccessor(i)));
395 } else if (isa<ReturnInst>(TI)) {
436 TerminatorInst *TI = BB->getTerminator(); local
437 if (isa<ReturnInst>(TI))
440 Edges += TI->getNumSuccessors();
457 TerminatorInst *TI = BB->getTerminator(); local
458 int Successors = isa<ReturnInst>(TI) ? 1 : TI
545 TerminatorInst *TI = BB->getTerminator(); local
[all...]
/external/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp71 TerminatorInst *TI = I->getTerminator(); local
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)) {
91 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, argument
93 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!");
94 if (TI->getNumSuccessors() == 1) return false;
96 const BasicBlock *Dest = TI->getSuccessor(SuccNum);
102 ++I; // Skip one edge due to the incoming arc from TI
169 SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, Pass *P, bool MergeIdenticalEdges, bool DontDeleteUselessPhis) argument
[all...]
H A DCodeExtractor.cpp156 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); local
157 TI->replaceUsesOfWith(OldPred, NewBB);
231 TerminatorInst *TI = BB->getTerminator(); local
232 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
233 if (!BlocksToExtract.count(TI->getSuccessor(i)))
234 ExitBlocks.insert(TI->getSuccessor(i));
318 TerminatorInst *TI = newFunction->begin()->getTerminator(); local
320 GetElementPtrInst::Create(AI, Idx, "gep_" + inputs[i]->getName(), TI);
321 RewriteVal = new LoadInst(GEP, "loadgep_" + inputs[i]->getName(), TI);
349 if (TerminatorInst *TI
481 TerminatorInst *TI = (*i)->getTerminator(); local
[all...]
/external/llvm/lib/Analysis/
H A DSparsePropagation.cpp120 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, argument
123 Succs.resize(TI.getNumSuccessors());
124 if (TI.getNumSuccessors() == 0) return;
126 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) {
161 if (isa<InvokeInst>(TI)) {
168 if (isa<IndirectBrInst>(TI)) {
173 SwitchInst &SI = cast<SwitchInst>(TI);
183 Succs.assign(TI.getNumSuccessors(), true);
194 Succs.assign(TI.getNumSuccessors(), true);
207 TerminatorInst *TI local
217 visitTerminatorInst(TerminatorInst &TI) argument
[all...]
H A DBranchProbabilityInfo.cpp98 TerminatorInst *TI = BB->getTerminator(); local
99 if (TI->getNumSuccessors() == 0) {
100 if (isa<UnreachableInst>(TI))
117 if (UnreachableEdges.size() == TI->getNumSuccessors())
122 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty())
147 TerminatorInst *TI = BB->getTerminator(); local
148 if (TI->getNumSuccessors() == 1)
150 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI))
153 MDNode *WeightsNode = TI
[all...]
H A DProfileInfoLoaderPass.cpp166 TerminatorInst *TI = BB->getTerminator(); local
167 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
168 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
187 TerminatorInst *TI = BB->getTerminator(); local
188 if (TI->getNumSuccessors() == 0) {
191 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e; ++s) {
192 readEdge(getEdge(BB,TI->getSuccessor(s)), Counters);
H A DPathProfileVerifier.cpp91 TerminatorInst *TI = BB->getTerminator(); local
95 for (unsigned s = 0, e = TI->getNumSuccessors(); s != e;
96 prev = TI->getSuccessor(s), ++s) {
97 if (prev == TI->getSuccessor(s))
101 arrayMap[BB][TI->getSuccessor(s)][duplicate] = i++;
/external/strace/linux/arm/
H A Dsyscallent.h331 { 4, TI, sys_semop, "semop" }, /* 298 */
332 { 4, TI, sys_semget, "semget" }, /* 299 */
333 { 4, TI, sys_semctl, "semctl" }, /* 300 */
334 { 4, TI, sys_msgsnd, "msgsnd" }, /* 301 */
335 { 4, TI, sys_msgrcv, "msgrcv" }, /* 302 */
336 { 4, TI, sys_msgget, "msgget" }, /* 303 */
337 { 4, TI, sys_msgctl, "msgctl" }, /* 304 */
338 { 4, TI, sys_shmat, "shmat" }, /* 305 */
339 { 4, TI, sys_shmdt, "shmdt" }, /* 306 */
340 { 4, TI, sys_shmge
[all...]
/external/llvm/lib/Support/
H A DThreading.cpp74 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg); local
75 TI->UserFn(TI->UserData);
/external/llvm/include/llvm/
H A DPassRegistry.h48 const PassInfo *getPassInfo(const void *TI) const;
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineSelect.cpp122 /// FoldSelectOpOp - Here we have (select c, TI, FI), and we know that TI and FI
124 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI, argument
126 if (TI->getNumOperands() == 1) {
129 if (TI->isCast()) {
130 if (TI->getOperand(0)->getType() != FI->getOperand(0)->getType())
137 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0),
139 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI,
140 TI->getType());
144 if (!isa<BinaryOperator>(TI))
[all...]
/external/compiler-rt/lib/
H A Dint_types.h61 typedef int ti_int __attribute__ ((mode (TI)));
62 typedef unsigned tu_int __attribute__ ((mode (TI)));
/external/strace/linux/i386/
H A Dsyscallent.h462 { 4, TI, sys_semop, "semop" }, /* 421 */
463 { 4, TI, sys_semget, "semget" }, /* 422 */
464 { 4, TI, sys_semctl, "semctl" }, /* 423 */
465 { 5, TI, sys_semtimedop, "semtimedop" }, /* 424 */
472 { 4, TI, sys_msgsnd, "msgsnd" }, /* 431 */
473 { 4, TI, sys_msgrcv, "msgrcv" }, /* 432 */
474 { 4, TI, sys_msgget, "msgget" }, /* 433 */
475 { 4, TI, sys_msgctl, "msgctl" }, /* 434 */
482 { 4, TI, sys_shmat, "shmat" }, /* 441 */
483 { 4, TI, sys_shmd
[all...]
/external/strace/linux/sh/
H A Dsyscallent.h465 { 4, TI, sys_semop, "semop" }, /* 421 */
466 { 4, TI, sys_semget, "semget" }, /* 422 */
467 { 4, TI, sys_semctl, "semctl" }, /* 423 */
468 { 5, TI, sys_semtimedop, "semtimedop" }, /* 424 */
475 { 4, TI, sys_msgsnd, "msgsnd" }, /* 431 */
476 { 4, TI, sys_msgrcv, "msgrcv" }, /* 432 */
477 { 4, TI, sys_msgget, "msgget" }, /* 433 */
478 { 4, TI, sys_msgctl, "msgctl" }, /* 434 */
485 { 4, TI, sys_shmat, "shmat" }, /* 441 */
486 { 4, TI, sys_shmd
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DSCCP.cpp449 void getFeasibleSuccessors(TerminatorInst &TI, SmallVector<bool, 16> &Succs);
475 void visitTerminatorInst(TerminatorInst &TI);
522 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI, argument
524 Succs.resize(TI.getNumSuccessors());
525 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) {
546 if (isa<InvokeInst>(TI)) {
552 if (SwitchInst *SI = dyn_cast<SwitchInst>(&TI)) {
563 Succs.assign(TI.getNumSuccessors(), true);
572 if (isa<IndirectBrInst>(&TI)) {
574 Succs.assign(TI
743 visitTerminatorInst(TerminatorInst &TI) argument
1460 TerminatorInst *TI = BB->getTerminator(); local
1794 TerminatorInst *TI = BB->getTerminator(); local
1874 TerminatorInst *TI = I->getParent()->getTerminator(); local
[all...]
/external/llvm/lib/CodeGen/
H A DDwarfEHPrepare.cpp114 TerminatorInst *TI = I->getTerminator(); local
115 if (ResumeInst *RI = dyn_cast<ResumeInst>(TI))
117 else if (InvokeInst *II = dyn_cast<InvokeInst>(TI))
/external/llvm/lib/VMCore/
H A DBasicBlock.cpp338 TerminatorInst *TI = getTerminator(); local
339 if (!TI)
343 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) {
344 BasicBlock *Succ = TI->getSuccessor(i);
H A DPass.cpp184 const PassInfo *Pass::lookupPassInfo(const void *TI) { argument
185 return PassRegistry::getPassRegistry()->getPassInfo(TI);
/external/clang/lib/StaticAnalyzer/Frontend/
H A DAnalysisConsumer.cpp325 for (CallGraph::nodes_iterator TI = CG.parentless_begin(),
326 TE = CG.parentless_end(); TI != TE; ++TI) {
327 TopLevelFunctions.push_back(*TI);
343 TI = TopLevelFunctions.rbegin(), TE = TopLevelFunctions.rend();
344 TI != TE; ++TI)
345 BFSQueue.push(*TI);
/external/llvm/include/llvm/Analysis/
H A DSparsePropagation.h195 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs,
200 void visitTerminatorInst(TerminatorInst &TI);

Completed in 397 milliseconds

1234