| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyDebugValueManager.cpp | 64 MachineInstr *Insert) const { in getSinkableDebugValues() 70 if (Def->getParent() == Insert->getParent()) { in getSinkableDebugValues() 77 if (&*MI == Insert) { in getSinkableDebugValues() 90 if (!Def->getParent()->isSuccessor(Insert->getParent())) in getSinkableDebugValues() 101 for (MachineBasicBlock::iterator MI = Insert->getParent()->begin(), in getSinkableDebugValues() 102 ME = Insert->getIterator(); in getSinkableDebugValues() 221 MachineInstr *Insert) const { in isInsertSamePlace() 222 if (Def->getParent() != Insert->getParent()) in isInsertSamePlace() 225 ME = Insert; in isInsertSamePlace() 253 void WebAssemblyDebugValueManager::sink(MachineInstr *Insert) { in sink() argument [all …]
|
| H A D | WebAssemblyRegStackify.cpp | 268 static MachineInstr *getVRegDef(unsigned Reg, const MachineInstr *Insert, in getVRegDef() argument 277 SlotIndex InstIndex = LIS->getInstructionIndex(*Insert); in getVRegDef() 334 const MachineInstr *Insert, in isSafeToMove() argument 339 assert(DefI->getParent() == Insert->getParent()); in isSafeToMove() 340 assert(UseI->getParent() == Insert->getParent()); in isSafeToMove() 379 if (NextI == Insert) in isSafeToMove() 401 if (MO.isDead() && Insert->definesRegister(Reg, /*TRI=*/nullptr) && in isSafeToMove() 402 !Insert->readsRegister(Reg, /*TRI=*/nullptr)) in isSafeToMove() 434 MachineBasicBlock::const_iterator D(DefI), I(Insert); in isSafeToMove() 551 MachineInstr *Insert, LiveIntervals *LIS, in moveForSingleUse() argument [all …]
|
| H A D | WebAssemblyDebugValueManager.h | 33 getSinkableDebugValues(MachineInstr *Insert) const; 34 bool isInsertSamePlace(MachineInstr *Insert) const; 41 void sink(MachineInstr *Insert); 44 void cloneSink(MachineInstr *Insert, Register NewReg = Register(),
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/REPL/Clang/ |
| H A D | ClangREPL.cpp | 30 languages.Insert(lldb::LanguageType::eLanguageTypeC); in Initialize() 31 languages.Insert(lldb::LanguageType::eLanguageTypeC89); in Initialize() 32 languages.Insert(lldb::LanguageType::eLanguageTypeC99); in Initialize() 33 languages.Insert(lldb::LanguageType::eLanguageTypeC11); in Initialize() 34 languages.Insert(lldb::LanguageType::eLanguageTypeC_plus_plus); in Initialize() 35 languages.Insert(lldb::LanguageType::eLanguageTypeC_plus_plus_03); in Initialize() 36 languages.Insert(lldb::LanguageType::eLanguageTypeC_plus_plus_11); in Initialize() 37 languages.Insert(lldb::LanguageType::eLanguageTypeC_plus_plus_14); in Initialize() 38 languages.Insert(lldb::LanguageType::eLanguageTypeObjC); in Initialize() 39 languages.Insert(lldb::LanguageType::eLanguageTypeObjC_plus_plus); in Initialize()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeShrink.cpp | 186 MachineInstr *Insert = nullptr; in runOnMachineFunction() local 201 Insert = nullptr; in runOnMachineFunction() 207 Insert = nullptr; in runOnMachineFunction() 221 Insert = FindDominatedInstruction(DefInstr, Insert, IOM); in runOnMachineFunction() 223 Insert = nullptr; in runOnMachineFunction() 230 for (MachineInstr *I = Insert; I && IOM[I] == Barrier; in runOnMachineFunction() 233 Insert = nullptr; in runOnMachineFunction() 237 if (DefMO && Insert && NumEligibleUse > 1 && Barrier <= IOM[Insert]) { in runOnMachineFunction() 238 MachineBasicBlock::iterator I = std::next(Insert->getIterator()); in runOnMachineFunction()
|
| H A D | ExpandMemCmp.cpp | 394 Builder.Insert(CmpBr); in emitLoadCompareByteBlock() 397 {{DominatorTree::Insert, BB, EndBlock}, in emitLoadCompareByteBlock() 398 {DominatorTree::Insert, BB, LoadCmpBlocks[BlockIndex + 1]}}); in emitLoadCompareByteBlock() 402 Builder.Insert(CmpBr); in emitLoadCompareByteBlock() 404 DTU->applyUpdates({{DominatorTree::Insert, BB, EndBlock}}); in emitLoadCompareByteBlock() 491 Builder.Insert(CmpBr); in emitLoadCompareBlockMultipleLoads() 493 DTU->applyUpdates({{DominatorTree::Insert, BB, ResBlock.BB}, in emitLoadCompareBlockMultipleLoads() 494 {DominatorTree::Insert, BB, NextBB}}); in emitLoadCompareBlockMultipleLoads() 555 Builder.Insert(CmpBr); in emitLoadCompareBlock() 557 DTU->applyUpdates({{DominatorTree::Insert, BB, NextBB}, in emitLoadCompareBlock() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopIdiomVectorize.cpp | 449 Builder.Insert(JumpToVectorLoop); in createMaskedFindMismatch() 451 DTU.applyUpdates({{DominatorTree::Insert, VectorLoopPreheaderBlock, in createMaskedFindMismatch() 480 Builder.Insert(VectorEarlyExit); in createMaskedFindMismatch() 483 {{DominatorTree::Insert, VectorLoopStartBlock, VectorLoopMismatchBlock}, in createMaskedFindMismatch() 484 {DominatorTree::Insert, VectorLoopStartBlock, VectorLoopIncBlock}}); in createMaskedFindMismatch() 503 Builder.Insert(VectorLoopBranchBack); in createMaskedFindMismatch() 506 {{DominatorTree::Insert, VectorLoopIncBlock, VectorLoopStartBlock}, in createMaskedFindMismatch() 507 {DominatorTree::Insert, VectorLoopIncBlock, EndBlock}}); in createMaskedFindMismatch() 540 Builder.Insert(JumpToVectorLoop); in createPredicatedFindMismatch() 542 DTU.applyUpdates({{DominatorTree::Insert, VectorLoopPreheaderBlock, in createPredicatedFindMismatch() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/NVPTX/ |
| H A D | NVPTXTargetTransformInfo.h | 114 VectorType *InTy, const APInt &DemandedElts, bool Insert, bool Extract, 123 if (Insert && !VL.empty()) { 129 Insert = false; 132 if (Insert && NVPTX::isPackedVectorTy(VT) && VT.is32BitVector()) { 136 Insert = false; 138 if (Insert && VT == MVT::v4i8) { 143 Insert = false; 145 return Cost + BaseT::getScalarizationOverhead(InTy, DemandedElts, Insert,
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | IRBuilder.h | 172 InstTy *Insert(InstTy *I, const Twine &Name = "") const { 179 Constant *Insert(Constant *C, const Twine& = "") const { 183 Value *Insert(Value *V, const Twine &Name = "") const { 185 return Insert(I, Name); 1173 return Insert(ReturnInst::Create(Context)); in CreateRetVoid() 1178 return Insert(ReturnInst::Create(Context, V)); in CreateRet() 1192 return Insert(ReturnInst::Create(Context, V)); in CreateAggregateRet() 1197 return Insert(BranchInst::Create(Dest)); in CreateBr() 1205 return Insert(addBranchMetadata(BranchInst::Create(True, False, Cond), 1219 return Insert(Br); in CreateCondBr() [all …]
|
| /freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
| H A D | ManualDWARFIndex.cpp | 316 set.function_fullnames.Insert(ConstString(name), ref); in IndexUnitImpl() 318 set.objc_class_selectors.Insert(class_name_with_category, ref); in IndexUnitImpl() 321 set.objc_class_selectors.Insert(class_name_no_category, ref); in IndexUnitImpl() 323 set.function_selectors.Insert(objc_selector_name, ref); in IndexUnitImpl() 325 set.function_fullnames.Insert(objc_fullname_no_category_name, in IndexUnitImpl() 334 set.function_methods.Insert(ConstString(name), ref); in IndexUnitImpl() 336 set.function_basenames.Insert(ConstString(name), ref); in IndexUnitImpl() 339 set.function_fullnames.Insert(ConstString(name), ref); in IndexUnitImpl() 349 set.function_fullnames.Insert(ConstString(mangled_cstr), ref); in IndexUnitImpl() 367 set.types.Insert(ConstString(name), ref); in IndexUnitImpl() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | MatrixUtils.cpp | 53 {DominatorTree::Insert, Header, Body}, in CreateLoop() 54 {DominatorTree::Insert, Body, Latch}, in CreateLoop() 55 {DominatorTree::Insert, Latch, Header}, in CreateLoop() 56 {DominatorTree::Insert, Latch, Exit}, in CreateLoop() 57 {DominatorTree::Insert, Preheader, Header}, in CreateLoop()
|
| H A D | ControlFlowUtils.cpp | 321 Updates.push_back({DominatorTree::Insert, BB, FirstGuardBlock}); in finalize() 324 Updates.push_back({DominatorTree::Insert, GuardBlocks[I], Outgoing[I]}); in finalize() 326 {DominatorTree::Insert, GuardBlocks[I], GuardBlocks[I + 1]}); in finalize() 330 Updates.push_back({DominatorTree::Insert, GuardBlocks[NumGuards - 1], in finalize() 332 Updates.push_back({DominatorTree::Insert, GuardBlocks[NumGuards - 1], in finalize()
|
| H A D | BasicBlockUtils.cpp | 264 Updates.push_back({DominatorTree::Insert, PredBB, SuccOfBB}); in MergeBlockIntoPredecessor() 776 Updates.push_back({DominatorTree::Insert, BB, NewBB}); in ehAwareSplitEdge() 777 Updates.push_back({DominatorTree::Insert, NewBB, Succ}); in ehAwareSplitEdge() 916 Updates.push_back({DominatorTree::Insert, Old, New}); in SplitBlockImpl() 920 Updates.push_back({DominatorTree::Insert, New, SuccessorOfOld}); in SplitBlockImpl() 982 DTUpdates.push_back({DominatorTree::Insert, New, Old}); in splitBlockBefore() 986 DTUpdates.push_back({DominatorTree::Insert, PredecessorOfOld, New}); in splitBlockBefore() 1023 Updates.push_back({DominatorTree::Insert, NewBB, OldBB}); in UpdateAnalysisInformation() 1027 Updates.push_back({DominatorTree::Insert, Pred, NewBB}); in UpdateAnalysisInformation() 1566 Updates.emplace_back(DominatorTree::Insert, Head, TrueBlock); in SplitBlockAndInsertIfThenElse() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | CFGUpdate.h | 26 enum class UpdateKind : unsigned char { Insert, Delete }; enumerator 45 OS << (getKind() == UpdateKind::Insert ? "Insert " : "Delete "); in print() 80 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1); 91 NumInsertions > 0 ? UpdateKind::Insert : UpdateKind::Delete;
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIAnnotateControlFlow.cpp | 226 Instruction *Insert; in handleLoopCondition() local 231 Insert = Parent->getTerminator(); in handleLoopCondition() 233 Insert = Term; in handleLoopCondition() 235 Insert = &*L->getHeader()->getFirstNonPHIOrDbgOrLifetime(); in handleLoopCondition() 238 return CreateBreak(Insert); in handleLoopCondition() 243 Instruction *Insert = Cond == BoolTrue ? in handleLoopCondition() local 246 return CreateBreak(Insert); in handleLoopCondition() 250 Instruction *Insert = &*L->getHeader()->getFirstNonPHIOrDbgOrLifetime(); in handleLoopCondition() local 251 return CreateBreak(Insert); in handleLoopCondition()
|
| H A D | AMDGPUUnifyDivergentExitNodes.cpp | 168 Updates.emplace_back(DominatorTree::Insert, BB, NewRetBlock); in unifyReturnBlockSet() 241 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run() 252 Updates.emplace_back(DominatorTree::Insert, BB, TransitionBB); in run() 254 Updates.emplace_back(DominatorTree::Insert, TransitionBB, Successor); in run() 262 Updates.emplace_back(DominatorTree::Insert, BB, DummyReturnBB); in run() 283 Updates.emplace_back(DominatorTree::Insert, BB, UnreachableBlock); in run()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | CombinerHelperVectorOps.cpp | 125 GInsertVectorElement *Insert = in matchExtractVectorElementWithDifferentIndices() local 127 if (!Insert) in matchExtractVectorElementWithDifferentIndices() 133 getIConstantVRegValWithLookThrough(Insert->getIndexReg(), MRI); in matchExtractVectorElementWithDifferentIndices() 140 B.buildExtractVectorElement(Dst, Insert->getVectorReg(), Index); in matchExtractVectorElementWithDifferentIndices() 344 GInsertVectorElement *Insert = cast<GInsertVectorElement>(&MI); in matchInsertVectorElementOOB() local 346 Register Dst = Insert->getReg(0); in matchInsertVectorElementOOB() 348 Register Index = Insert->getIndexReg(); in matchInsertVectorElementOOB()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/asan/ |
| H A D | asan_memory_profile.cpp | 40 Insert(id, cv.UsedSize()); in ProcessChunk() 84 void Insert(u32 id, uptr size) { in Insert() function in __asan::HeapProfile
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | BlockFrequencyInfoImpl.cpp | 760 LoopData *OuterLoop, std::list<LoopData>::iterator Insert, in createIrreducibleLoop() argument 769 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), in createIrreducibleLoop() 783 std::list<LoopData>::iterator Insert) { in analyzeIrreducible() argument 784 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); in analyzeIrreducible() 785 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); in analyzeIrreducible() 792 createIrreducibleLoop(*this, G, OuterLoop, Insert, *I); in analyzeIrreducible() 796 return make_range(std::next(Prev), Insert); in analyzeIrreducible() 797 return make_range(Loops.begin(), Insert); in analyzeIrreducible()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/ |
| H A D | DXILLegalizePass.cpp | 324 if (auto *Insert = dyn_cast<InsertElementInst>(&I)) { in downcastI64toI32InsertExtractElements() local 325 Value *Idx = Insert->getOperand(2); in downcastI64toI32InsertExtractElements() 331 IRBuilder<> Builder(Insert); in downcastI64toI32InsertExtractElements() 333 Insert->getOperand(0), Insert->getOperand(1), Idx32, in downcastI64toI32InsertExtractElements() 334 Insert->getName()); in downcastI64toI32InsertExtractElements() 336 Insert->replaceAllUsesWith(Insert32Index); in downcastI64toI32InsertExtractElements() 337 ToRemove.push_back(Insert); in downcastI64toI32InsertExtractElements()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | MergeICmps.cpp | 624 Lhs = Builder.Insert(FirstCmp.Lhs().GEP->clone()); in mergeComparisons() 628 Rhs = Builder.Insert(FirstCmp.Rhs().GEP->clone()); in mergeComparisons() 649 Instruction *const LhsLoad = Builder.Insert(FirstCmp.Lhs().LoadI->clone()); in mergeComparisons() 650 Instruction *const RhsLoad = Builder.Insert(FirstCmp.Rhs().LoadI->clone()); in mergeComparisons() 680 DTU.applyUpdates({{DominatorTree::Insert, BB, PhiBB}}); in mergeComparisons() 685 DTU.applyUpdates({{DominatorTree::Insert, BB, NextCmpBlock}, in mergeComparisons() 686 {DominatorTree::Insert, BB, PhiBB}}); in mergeComparisons() 715 {DominatorTree::Insert, Pred, NextCmpBlock}}); in simplify()
|
| H A D | JumpTableToSwitch.cpp | 113 DTUpdates.push_back({DominatorTree::Insert, BB, BBUnreachable}); in expandToSwitch() 122 DTUpdates.push_back({DominatorTree::Insert, BB, B}); in expandToSwitch() 123 DTUpdates.push_back({DominatorTree::Insert, B, Tail}); in expandToSwitch()
|
| /freebsd/contrib/llvm-project/lldb/source/Symbol/ |
| H A D | TypeMap.cpp | 27 void TypeMap::Insert(const TypeSP &type_sp) { in Insert() function in TypeMap 44 Insert(type_sp); in InsertUnique()
|
| /freebsd/usr.bin/mail/misc/ |
| H A D | mail.tildehelp | 16 ~i name Insert the value of the named variable 22 ~r !command Insert the output of the command
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86MachineFunctionInfo.h | 312 auto Insert = PreallocatedIds.insert({CS, PreallocatedIds.size()}); 313 if (Insert.second) { 317 return Insert.first->second;
|