/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyDebugValueManager.cpp | 26 void WebAssemblyDebugValueManager::move(MachineInstr *Insert) { argument 27 MachineBasicBlock *MBB = Insert->getParent(); 29 MBB->splice(Insert, DBI->getParent(), DBI); 37 void WebAssemblyDebugValueManager::clone(MachineInstr *Insert, argument 39 MachineBasicBlock *MBB = Insert->getParent(); 44 MBB->insert(Insert, Clone);
|
H A D | WebAssemblyDebugValueManager.h | 30 void move(MachineInstr *Insert); 32 void clone(MachineInstr *Insert, unsigned NewReg);
|
H A D | WebAssemblyRegStackify.cpp | 269 static MachineInstr *getVRegDef(unsigned Reg, const MachineInstr *Insert, argument 278 LIS.getInstructionIndex(*Insert))) 311 // Test whether it's safe to move Def to just before Insert. 316 static bool isSafeToMove(const MachineInstr *Def, const MachineInstr *Insert, argument 318 assert(Def->getParent() == Insert->getParent()); 328 if (NextI != Insert) 339 // If the register is dead here and at Insert, ignore it. 340 if (MO.isDead() && Insert->definesRegister(Reg) && 341 !Insert->readsRegister(Reg)) 372 // Scan through the intervening instructions between Def and Insert 483 moveForSingleUse(unsigned Reg, MachineOperand &Op, MachineInstr *Def, MachineBasicBlock &MBB, MachineInstr *Insert, LiveIntervals &LIS, WebAssemblyFunctionInfo &MFI, MachineRegisterInfo &MRI) argument 528 rematerializeCheapDef( unsigned Reg, MachineOperand &Op, MachineInstr &Def, MachineBasicBlock &MBB, MachineBasicBlock::instr_iterator Insert, LiveIntervals &LIS, WebAssemblyFunctionInfo &MFI, MachineRegisterInfo &MRI, const WebAssemblyInstrInfo *TII, const WebAssemblyRegisterInfo *TRI) argument 596 moveAndTeeForMultiUse( unsigned Reg, MachineOperand &Op, MachineInstr *Def, MachineBasicBlock &MBB, MachineInstr *Insert, LiveIntervals &LIS, WebAssemblyFunctionInfo &MFI, MachineRegisterInfo &MRI, const WebAssemblyInstrInfo *TII) argument 658 TreeWalkerState(MachineInstr *Insert) argument 737 maybeCommute(MachineInstr *Insert, TreeWalkerState &TreeWalker, const WebAssemblyInstrInfo *TII) argument 789 MachineInstr *Insert = &*MII; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LiveRangeShrink.cpp | 167 MachineInstr *Insert = nullptr; local 182 Insert = nullptr; 188 Insert = nullptr; 202 Insert = FindDominatedInstruction(DefInstr, Insert, IOM); 204 Insert = nullptr; 210 // after Insert, if yes, then we should not hoist. 211 for (MachineInstr *I = Insert; I && IOM[I] == Barrier; 214 Insert = nullptr; 218 if (DefMO && Insert [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | CFGUpdate.h | 9 // This file defines a CFG Edge Update: Insert or Delete, and two Nodes as the 26 enum class UpdateKind : unsigned char { Insert, Delete }; member in class:llvm::cfg::UpdateKind 45 OS << (getKind() == UpdateKind::Insert ? "Insert " : "Delete "); 80 Operations[{From, To}] += (U.getKind() == UpdateKind::Insert ? 1 : -1); 91 NumInsertions > 0 ? UpdateKind::Insert : UpdateKind::Delete;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | IRBuilder.h | 915 /// Insert and return the specified instruction. 917 InstTy *Insert(InstTy *I, const Twine &Name = "") const { function in class:llvm::IRBuilder 924 Constant *Insert(Constant *C, const Twine& = "") const { function in class:llvm::IRBuilder 948 return Insert(ReturnInst::Create(Context)); 953 return Insert(ReturnInst::Create(Context, V)); 967 return Insert(ReturnInst::Create(Context, V)); 972 return Insert(BranchInst::Create(Dest)); 980 return Insert(addBranchMetadata(BranchInst::Create(True, False, Cond), 994 return Insert(Br); 1003 return Insert(addBranchMetadat [all...] |
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/DWARF/ |
H A D | ManualDWARFIndex.cpp | 264 set.function_fullnames.Insert(ConstString(name), ref); 266 set.objc_class_selectors.Insert(class_name_with_category, ref); 269 set.objc_class_selectors.Insert(class_name_no_category, ref); 271 set.function_selectors.Insert(objc_selector_name, ref); 273 set.function_fullnames.Insert(objc_fullname_no_category_name, 282 set.function_methods.Insert(ConstString(name), ref); 284 set.function_basenames.Insert(ConstString(name), ref); 287 set.function_fullnames.Insert(ConstString(name), ref); 297 set.function_fullnames.Insert(ConstString(mangled_cstr), ref); 315 set.types.Insert(ConstStrin [all...] |
H A D | NameToDIE.h | 29 void Insert(lldb_private::ConstString name, const DIERef &die_ref);
|
H A D | NameToDIE.cpp | 25 void NameToDIE::Insert(ConstString name, const DIERef &die_ref) { function in class:NameToDIE
|
H A D | UniqueDWARFASTType.h | 81 void Insert(lldb_private::ConstString name, function in class:UniqueDWARFASTTypeMap
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Core/ |
H A D | ThreadSafeDenseSet.h | 28 void Insert(_ElementType e) { function in class:lldb_private::ThreadSafeDenseSet
|
H A D | ThreadSafeDenseMap.h | 29 void Insert(_KeyType k, _ValueType v) { function in class:lldb_private::ThreadSafeDenseMap
|
H A D | FileSpecList.h | 167 bool Insert(size_t idx, const FileSpec &file) { function in class:lldb_private::FileSpecList
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIAnnotateControlFlow.cpp | 234 Instruction *Insert; local 236 Insert = Parent->getTerminator(); 238 Insert = L->getHeader()->getFirstNonPHIOrDbgOrLifetime(); 242 return CallInst::Create(IfBreak, Args, "", Insert); 245 // Insert IfBreak in the loop header TERM for constant COND other than true. 247 Instruction *Insert = Cond == BoolTrue ? local 251 return CallInst::Create(IfBreak, Args, "", Insert);
|
H A D | AMDGPUAtomicOptimizer.cpp | 504 Value *const Insert = local 506 NewV = B.CreateBitCast(Insert, Ty); 574 B.Insert(NewI); 603 Value *const Insert = local 605 BroadcastI = B.CreateBitCast(Insert, Ty);
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/asan/ |
H A D | asan_memory_profile.cpp | 41 Insert(id, cv.UsedSize()); 85 void Insert(u32 id, uptr size) { function in class:__asan::HeapProfile
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Symbol/ |
H A D | TypeMap.h | 33 void Insert(const lldb::TypeSP &type);
|
H A D | TypeList.h | 33 void Insert(const lldb::TypeSP &type);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | MVETailPredication.cpp | 95 /// Insert the intrinsic to represent the effect of tail predication. 227 Instruction *Insert = nullptr; 228 if (!match(Shuffle, m_ShuffleVector(m_Instruction(Insert), m_Undef(), 232 // Insert the limit into a vector. 234 if (!match(Insert, m_InsertElement(m_Undef(), m_Instruction(BECount), 264 if (!match(BroadcastSplat, m_ShuffleVector(m_Instruction(Insert), m_Undef(), 270 if (!match(Insert, m_InsertElement(m_Undef(), m_Instruction(IV), m_Zero()))) 284 unsigned Lanes = cast<VectorType>(Insert->getType())->getNumElements(); 467 // Insert a phi to count the number of elements processed by the loop. 471 // Insert th [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | DomTreeUpdater.cpp | 42 if (Kind == DominatorTree::Insert && !HasEdge) 263 // existed before. If the first update to an edge is "Insert", it means 266 // For example, if the user submits {{Delete, A, B}, {Insert, A, B}}, 275 // edge, so both {Delete, A, B}, {Insert, A, B} actually happened and 278 // actually happened but {Insert, A, B} was an invalid update which never 320 assert(isUpdateValid({DominatorTree::Insert, From, To}) && 339 PendUpdates.push_back({DominatorTree::Insert, From, To}); 349 if (!isUpdateValid({DominatorTree::Insert, From, To})) 360 PendUpdates.push_back({DominatorTree::Insert, From, To}); 463 if (U.getKind() == DominatorTree::Insert) [all...] |
H A D | BlockFrequencyInfoImpl.cpp | 753 LoopData *OuterLoop, std::list<LoopData>::iterator Insert, 762 auto Loop = BFI.Loops.emplace(Insert, OuterLoop, Headers.begin(), 776 std::list<LoopData>::iterator Insert) { 777 assert((OuterLoop == nullptr) == (Insert == Loops.begin())); 778 auto Prev = OuterLoop ? std::prev(Insert) : Loops.end(); 785 createIrreducibleLoop(*this, G, OuterLoop, Insert, *I); 789 return make_range(std::next(Prev), Insert); 790 return make_range(Loops.begin(), Insert); 751 createIrreducibleLoop( BlockFrequencyInfoImplBase &BFI, const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert, const std::vector<const IrreducibleGraph::IrrNode *> &SCC) argument 774 analyzeIrreducible( const IrreducibleGraph &G, LoopData *OuterLoop, std::list<LoopData>::iterator Insert) argument
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Target/ |
H A D | PathMappingList.h | 52 void Insert(ConstString path, ConstString replacement,
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/ASTDiff/ |
H A D | ASTDiff.h | 31 Insert, // (Src, Dst, Pos): insert Src as child of Dst at offset Pos. enumerator in enum:clang::diff::ChangeKind
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
H A D | RegBankSelect.h | 178 /// Insert \p MI in the just before ::getPoint() 320 Insert, enumerator in enum:llvm::RegBankSelect::RepairingPlacement::RepairingKind 357 RepairingKind Kind = RepairingKind::Insert); 393 /// RepairingKind::Insert. There is no fundamental problem with 396 /// \pre NewKind != RepairingKind::Insert 404 assert(NewKind != RepairingKind::Insert && 405 "We would need more MI to switch to Insert"); 530 /// Insert repairing code for \p Reg as specified by \p ValMapping.
|
/freebsd-11-stable/contrib/llvm-project/lldb/source/Symbol/ |
H A D | TypeMap.cpp | 27 void TypeMap::Insert(const TypeSP &type_sp) { function in class:TypeMap 44 Insert(type_sp); 69 // types.Insert (pos->second);
|