| /NextBSD/contrib/llvm/tools/clang/lib/Frontend/ |
| HD | InitPreprocessor.cpp | 194 const TargetInfo &TI, MacroBuilder &Builder) { in DefineTypeSize() argument 195 DefineTypeSize(MacroName, TI.getTypeWidth(Ty), TI.getTypeConstantSuffix(Ty), in DefineTypeSize() 196 TI.isTypeSigned(Ty), Builder); in DefineTypeSize() 200 const TargetInfo &TI, MacroBuilder &Builder) { in DefineFmt() argument 201 bool IsSigned = TI.isTypeSigned(Ty); in DefineFmt() 202 StringRef FmtModifier = TI.getTypeFormatModifier(Ty); in DefineFmt() 215 const TargetInfo &TI, MacroBuilder &Builder) { in DefineTypeWidth() argument 216 Builder.defineMacro(MacroName, Twine(TI.getTypeWidth(Ty))); in DefineTypeWidth() 220 const TargetInfo &TI, MacroBuilder &Builder) { in DefineTypeSizeof() argument 222 Twine(BitWidth / TI.getCharWidth())); in DefineTypeSizeof() [all …]
|
| /NextBSD/contrib/file/magic/Magdir/ |
| HD | ti-8x | 4 # ti-8x: file(1) magic for the TI-8x and TI-9x Graphing Calculators. 11 # Files for the TI-80 and TI-81 are pretty rare. I'm not going to put the 13 0 string **TI80** TI-80 Graphing Calculator File. 14 0 string **TI81** TI-81 Graphing Calculator File. 16 # Magic Numbers for the TI-73 18 0 string **TI73** TI-73 Graphing Calculator 34 # Magic Numbers for the TI-82 36 0 string **TI82** TI-82 Graphing Calculator 51 # Magic Numbers for the TI-83 53 0 string **TI83** TI-83 Graphing Calculator [all …]
|
| /NextBSD/contrib/llvm/lib/Support/ |
| HD | ARMBuildAttrs.cpp | 78 for (unsigned TI = 0, TE = sizeof(ARMAttributeTags) / sizeof(*ARMAttributeTags); in AttrTypeAsString() local 79 TI != TE; ++TI) in AttrTypeAsString() 80 if (ARMAttributeTags[TI].Attr == Attr) in AttrTypeAsString() 81 return ARMAttributeTags[TI].TagName + (HasTagPrefix ? 0 : 4); in AttrTypeAsString() 87 for (unsigned TI = 0, TE = sizeof(ARMAttributeTags) / sizeof(*ARMAttributeTags); in AttrTypeFromString() local 88 TI != TE; ++TI) in AttrTypeFromString() 89 if (StringRef(ARMAttributeTags[TI].TagName + (HasTagPrefix ? 0 : 4)) == Tag) in AttrTypeFromString() 90 return ARMAttributeTags[TI].Attr; in AttrTypeFromString()
|
| HD | Threading.cpp | 39 ThreadInfo *TI = reinterpret_cast<ThreadInfo*>(Arg); in ExecuteOnThread_Dispatch() local 40 TI->UserFn(TI->UserData); in ExecuteOnThread_Dispatch()
|
| /NextBSD/contrib/llvm/lib/Analysis/ |
| HD | SparsePropagation.cpp | 121 void SparseSolver::getFeasibleSuccessors(TerminatorInst &TI, in getFeasibleSuccessors() argument 124 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors() 125 if (TI.getNumSuccessors() == 0) return; in getFeasibleSuccessors() 127 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { in getFeasibleSuccessors() 162 if (isa<InvokeInst>(TI)) { in getFeasibleSuccessors() 169 if (isa<IndirectBrInst>(TI)) { in getFeasibleSuccessors() 174 SwitchInst &SI = cast<SwitchInst>(TI); in getFeasibleSuccessors() 184 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() 195 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() 208 TerminatorInst *TI = From->getTerminator(); in isEdgeFeasible() local [all …]
|
| HD | BranchProbabilityInfo.cpp | 123 TerminatorInst *TI = BB->getTerminator(); in calcUnreachableHeuristics() local 124 if (TI->getNumSuccessors() == 0) { in calcUnreachableHeuristics() 125 if (isa<UnreachableInst>(TI)) in calcUnreachableHeuristics() 142 if (UnreachableEdges.size() == TI->getNumSuccessors()) in calcUnreachableHeuristics() 147 if (TI->getNumSuccessors() == 1 || UnreachableEdges.empty()) in calcUnreachableHeuristics() 173 TerminatorInst *TI = BB->getTerminator(); in calcMetadataWeights() local 174 if (TI->getNumSuccessors() == 1) in calcMetadataWeights() 176 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI)) in calcMetadataWeights() 179 MDNode *WeightsNode = TI->getMetadata(LLVMContext::MD_prof); in calcMetadataWeights() 184 assert(TI->getNumSuccessors() < UINT32_MAX && "Too many successors"); in calcMetadataWeights() [all …]
|
| HD | DivergenceAnalysis.cpp | 141 void exploreSyncDependency(TerminatorInst *TI); 176 void DivergencePropagator::exploreSyncDependency(TerminatorInst *TI) { in exploreSyncDependency() argument 186 BasicBlock *ThisBB = TI->getParent(); in exploreSyncDependency() 277 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(V)) { in propagate() local 280 if (TI->getNumSuccessors() > 1) in propagate() 281 exploreSyncDependency(TI); in propagate()
|
| HD | CFG.cpp | 87 bool llvm::isCriticalEdge(const TerminatorInst *TI, unsigned SuccNum, in isCriticalEdge() argument 89 assert(SuccNum < TI->getNumSuccessors() && "Illegal edge specification!"); in isCriticalEdge() 90 if (TI->getNumSuccessors() == 1) return false; in isCriticalEdge() 92 const BasicBlock *Dest = TI->getSuccessor(SuccNum); in isCriticalEdge()
|
| HD | LoopInfo.cpp | 237 TerminatorInst *TI = (*I)->getTerminator(); in getLoopID() local 241 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { in getLoopID() 242 if (TI->getSuccessor(i) == H) { in getLoopID() 243 MD = TI->getMetadata(LoopMDName); in getLoopID() 274 TerminatorInst *TI = (*I)->getTerminator(); in setLoopID() local 275 for (unsigned i = 0, ie = TI->getNumSuccessors(); i != ie; ++i) { in setLoopID() 276 if (TI->getSuccessor(i) == H) in setLoopID() 277 TI->setMetadata(LoopMDName, LoopID); in setLoopID()
|
| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | BreakCriticalEdges.cpp | 133 BasicBlock *llvm::SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, in SplitCriticalEdge() argument 135 if (!isCriticalEdge(TI, SuccNum, Options.MergeIdenticalEdges)) in SplitCriticalEdge() 138 assert(!isa<IndirectBrInst>(TI) && in SplitCriticalEdge() 141 BasicBlock *TIBB = TI->getParent(); in SplitCriticalEdge() 142 BasicBlock *DestBB = TI->getSuccessor(SuccNum); in SplitCriticalEdge() 149 BasicBlock *NewBB = BasicBlock::Create(TI->getContext(), in SplitCriticalEdge() 153 NewBI->setDebugLoc(TI->getDebugLoc()); in SplitCriticalEdge() 156 TI->setSuccessor(SuccNum, NewBB); in SplitCriticalEdge() 188 for (unsigned i = SuccNum+1, e = TI->getNumSuccessors(); i != e; ++i) { in SplitCriticalEdge() 189 if (TI->getSuccessor(i) != DestBB) continue; in SplitCriticalEdge() [all …]
|
| HD | CodeExtractor.cpp | 238 TerminatorInst *TI = PN->getIncomingBlock(i)->getTerminator(); in severSplitPHINodes() local 239 TI->replaceUsesOfWith(OldPred, NewBB); in severSplitPHINodes() 366 TerminatorInst *TI = newFunction->begin()->getTerminator(); in constructFunction() local 368 StructTy, AI, Idx, "gep_" + inputs[i]->getName(), TI); in constructFunction() 369 RewriteVal = new LoadInst(GEP, "loadgep_" + inputs[i]->getName(), TI); in constructFunction() 397 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(Users[i])) in constructFunction() local 398 if (!Blocks.count(TI->getParent()) && in constructFunction() 399 TI->getParent()->getParent() == oldFunction) in constructFunction() 400 TI->replaceUsesOfWith(header, newHeader); in constructFunction() 527 TerminatorInst *TI = (*i)->getTerminator(); in emitCallAndSwitchStatement() local [all …]
|
| HD | SimplifyCFG.cpp | 116 Value *isValueEqualityComparison(TerminatorInst *TI); 117 BasicBlock *GetValueEqualityComparisonCases(TerminatorInst *TI, 119 bool SimplifyEqualityComparisonWithOnlyPredecessor(TerminatorInst *TI, 122 bool FoldValueComparisonIntoPredecessors(TerminatorInst *TI, 504 static void EraseTerminatorInstAndDCECond(TerminatorInst *TI) { in EraseTerminatorInstAndDCECond() argument 506 if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { in EraseTerminatorInstAndDCECond() 508 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in EraseTerminatorInstAndDCECond() 511 } else if (IndirectBrInst *IBI = dyn_cast<IndirectBrInst>(TI)) { in EraseTerminatorInstAndDCECond() 515 TI->eraseFromParent(); in EraseTerminatorInstAndDCECond() 521 Value *SimplifyCFGOpt::isValueEqualityComparison(TerminatorInst *TI) { in isValueEqualityComparison() argument [all …]
|
| /NextBSD/contrib/llvm/include/llvm/Transforms/Utils/ |
| HD | BasicBlockUtils.h | 142 BasicBlock *SplitCriticalEdge(TerminatorInst *TI, unsigned SuccNum, 163 TerminatorInst *TI = (*PI)->getTerminator(); variable 164 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i) 165 if (TI->getSuccessor(i) == Succ) 166 MadeChange |= !!SplitCriticalEdge(TI, i, Options); 178 TerminatorInst *TI = Src->getTerminator(); variable 181 assert(i != TI->getNumSuccessors() && "Edge doesn't exist!"); 182 if (TI->getSuccessor(i) == Dst) 183 return SplitCriticalEdge(TI, i, Options);
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | SCCP.cpp | 444 void getFeasibleSuccessors(TerminatorInst &TI, SmallVectorImpl<bool> &Succs); 470 void visitTerminatorInst(TerminatorInst &TI); 518 void SCCPSolver::getFeasibleSuccessors(TerminatorInst &TI, in getFeasibleSuccessors() argument 520 Succs.resize(TI.getNumSuccessors()); in getFeasibleSuccessors() 521 if (BranchInst *BI = dyn_cast<BranchInst>(&TI)) { in getFeasibleSuccessors() 542 if (isa<InvokeInst>(TI)) { in getFeasibleSuccessors() 548 if (SwitchInst *SI = dyn_cast<SwitchInst>(&TI)) { in getFeasibleSuccessors() 559 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() 568 if (isa<IndirectBrInst>(&TI)) { in getFeasibleSuccessors() 570 Succs.assign(TI.getNumSuccessors(), true); in getFeasibleSuccessors() [all …]
|
| HD | LoopUnswitch.cpp | 216 TerminatorInst *TI = nullptr); 218 BasicBlock *ExitBlock, TerminatorInst *TI); 220 TerminatorInst *TI); 229 TerminatorInst *TI); 468 TerminatorInst *TI = (*I)->getTerminator(); in processCurrentLoop() local 469 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in processCurrentLoop() 478 UnswitchIfProfitable(LoopCond, ConstantInt::getTrue(Context), TI)) { in processCurrentLoop() 483 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) { in processCurrentLoop() 668 TerminatorInst *TI) { in UnswitchIfProfitable() argument 676 UnswitchTrivialCondition(currentLoop, LoopCond, CondVal, ExitBlock, TI); in UnswitchIfProfitable() [all …]
|
| HD | SampleProfile.cpp | 605 TerminatorInst *TI = BB->getTerminator(); in propagateWeights() local 606 if (TI->getNumSuccessors() == 1) in propagateWeights() 608 if (!isa<BranchInst>(TI) && !isa<SwitchInst>(TI)) in propagateWeights() 612 << TI->getDebugLoc().getLine() << ".\n"); in propagateWeights() 615 for (unsigned I = 0; I < TI->getNumSuccessors(); ++I) { in propagateWeights() 616 BasicBlock *Succ = TI->getSuccessor(I); in propagateWeights() 629 TI->setMetadata(llvm::LLVMContext::MD_prof, in propagateWeights()
|
| /NextBSD/contrib/llvm/lib/Transforms/InstCombine/ |
| HD | InstCombineSelect.cpp | 115 Instruction *InstCombiner::FoldSelectOpOp(SelectInst &SI, Instruction *TI, in FoldSelectOpOp() argument 117 if (TI->getNumOperands() == 1) { in FoldSelectOpOp() 120 if (TI->isCast()) { in FoldSelectOpOp() 122 if (TI->getOperand(0)->getType() != FIOpndTy) in FoldSelectOpOp() 135 Value *NewSI = Builder->CreateSelect(SI.getCondition(), TI->getOperand(0), in FoldSelectOpOp() 137 return CastInst::Create(Instruction::CastOps(TI->getOpcode()), NewSI, in FoldSelectOpOp() 138 TI->getType()); in FoldSelectOpOp() 142 if (!isa<BinaryOperator>(TI)) in FoldSelectOpOp() 148 if (TI->getOperand(0) == FI->getOperand(0)) { in FoldSelectOpOp() 149 MatchOp = TI->getOperand(0); in FoldSelectOpOp() [all …]
|
| /NextBSD/contrib/llvm/tools/clang/lib/AST/ |
| HD | Mangle.cpp | 67 const TargetInfo &TI = Context.getTargetInfo(); in getCallingConvMangling() local 68 const llvm::Triple &Triple = TI.getTriple(); in getCallingConvMangling() 75 TI.getCXXABI() == TargetCXXABI::Microsoft) in getCallingConvMangling() 141 const TargetInfo &TI = Context.getTargetInfo(); in mangleName() local 142 if (CC == CCM_Other || (MCXX && TI.getCXXABI() == TargetCXXABI::Microsoft)) { in mangleName() 181 TI.getPointerWidth(0)) / in mangleName() 182 TI.getPointerWidth(0); in mangleName() 183 Out << ((TI.getPointerWidth(0) / 8) * ArgWords); in mangleName()
|
| /NextBSD/contrib/llvm/lib/Target/SystemZ/ |
| HD | SystemZLongBranch.cpp | 334 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin(); in setWorstCaseAddresses() local 339 skipTerminator(Position, *TI, true); in setWorstCaseAddresses() 340 ++TI; in setWorstCaseAddresses() 435 SmallVector<TerminatorInfo, 16>::iterator TI = Terminators.begin(); in relaxBranches() local 440 assert(Position.Address <= TI->Address && in relaxBranches() 442 if (mustRelaxBranch(*TI, Position.Address)) in relaxBranches() 443 relaxBranch(*TI); in relaxBranches() 444 skipTerminator(Position, *TI, false); in relaxBranches() 445 ++TI; in relaxBranches()
|
| /NextBSD/contrib/gcc/config/i386/ |
| HD | sse.md | 88 (const_string "TI")))]) 223 (set_attr "mode" "TI")]) 250 (set_attr "mode" "TI")]) 268 (set_attr "mode" "TI")]) 1009 (set_attr "mode" "TI")]) 1017 (set_attr "mode" "TI")]) 1848 (set_attr "mode" "TI")]) 1961 (set_attr "mode" "TI") 1980 (set_attr "mode" "TI") 2410 (set_attr "mode" "TI")]) [all …]
|
| /NextBSD/contrib/llvm/tools/clang/lib/CodeGen/ |
| HD | CGLoopInfo.cpp | 127 if (TerminatorInst *TI = dyn_cast<TerminatorInst>(I)) { in InsertHelper() local 128 for (unsigned i = 0, ie = TI->getNumSuccessors(); i < ie; ++i) in InsertHelper() 129 if (TI->getSuccessor(i) == L.getHeader()) { in InsertHelper() 130 TI->setMetadata("llvm.loop", L.getLoopID()); in InsertHelper()
|
| /NextBSD/contrib/llvm/utils/TableGen/ |
| HD | SubtargetEmitter.cpp | 837 TI = SCI->Transitions.begin(), TE = SCI->Transitions.end(); in GenSchedClassTables() local 838 TI != TE; ++TI) { in GenSchedClassTables() 839 if (TI->ProcIndices[0] == 0) { in GenSchedClassTables() 843 IdxIter PIPos = std::find(TI->ProcIndices.begin(), in GenSchedClassTables() 844 TI->ProcIndices.end(), ProcModel.Index); in GenSchedClassTables() 845 if (PIPos != TI->ProcIndices.end()) { in GenSchedClassTables() 1311 TI = SC.Transitions.begin(), TE = SC.Transitions.end(); in EmitSchedModelHelpers() local 1312 TI != TE; ++TI) { in EmitSchedModelHelpers() 1314 std::set_union(TI->ProcIndices.begin(), TI->ProcIndices.end(), in EmitSchedModelHelpers() 1327 TI = SC.Transitions.begin(), TE = SC.Transitions.end(); in EmitSchedModelHelpers() local [all …]
|
| HD | FastISelEmitter.cpp | 708 for (TypeRetPredMap::const_iterator TI = TM.begin(), TE = TM.end(); in printFunctionDefinitions() local 709 TI != TE; ++TI) { in printFunctionDefinitions() 710 MVT::SimpleValueType VT = TI->first; in printFunctionDefinitions() 711 const RetPredMap &RM = TI->second; in printFunctionDefinitions() 784 for (TypeRetPredMap::const_iterator TI = TM.begin(), TE = TM.end(); in printFunctionDefinitions() local 785 TI != TE; ++TI) { in printFunctionDefinitions() 786 MVT::SimpleValueType VT = TI->first; in printFunctionDefinitions()
|
| /NextBSD/contrib/llvm/lib/Transforms/Instrumentation/ |
| HD | GCOVProfiling.cpp | 517 TerminatorInst *TI = BB->getTerminator(); in emitProfileNotes() local 518 if (int successors = TI->getNumSuccessors()) { in emitProfileNotes() 520 Block.addEdge(Func.getBlock(TI->getSuccessor(i))); in emitProfileNotes() 522 } else if (isa<ReturnInst>(TI)) { in emitProfileNotes() 583 TerminatorInst *TI = BB->getTerminator(); in emitProfileArcs() local 584 if (isa<ReturnInst>(TI)) in emitProfileArcs() 587 Edges += TI->getNumSuccessors(); in emitProfileArcs() 604 TerminatorInst *TI = BB->getTerminator(); in emitProfileArcs() local 605 int Successors = isa<ReturnInst>(TI) ? 1 : TI->getNumSuccessors(); in emitProfileArcs() 614 } else if (BranchInst *BI = dyn_cast<BranchInst>(TI)) { in emitProfileArcs() [all …]
|
| /NextBSD/contrib/gcc/config/ia64/ |
| HD | ia64.md | 388 (define_mode_macro MODE [BI QI HI SI DI SF DF XF TI]) 409 (TI "ldfp8.a %X0 = %1%P1")]) 429 (TI "ldfp8.s %X0 = %1%P1")]) 449 (TI "ldfp8.sa %X0 = %1%P1")]) 469 (TI "ldfp8.c.clr %X0 = %1%P1")]) 471 … "=*r") (QI "=r") (HI "=r") (SI "=r") (DI "=r,*f") (SF "=f,*r") (DF "=f,*r") (XF "=f") (TI "=*x")]) 472 … "+*r") (QI "+r") (HI "+r") (SI "+r") (DI "+r,*f") (SF "+f,*r") (DF "+f,*r") (XF "+f") (TI "+*x")]) 473 …nstr [(BI "*r") (QI "r") (HI "r") (SI "r") (DI "r,*f") (SF "f,*r") (DF "f,*r") (XF "f") (TI "*x")]) 475 …m_constr [(BI "*m") (QI "m") (HI "m") (SI "m") (DI "m,Q") (SF "Q,m") (DF "Q,m") (XF "m") (TI "Q")]) 480 … [(BI "gr") (QI "gr") (HI "gr") (SI "gr") (DI "grfr") (SF "grfr") (DF "grfr") (XF "fr") (TI "fr")]) [all …]
|