| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIModeRegister.cpp | 215 // - if it isn't compatible and an InsertionPoint isn't set, then we set the
216 // InsertionPoint to the current instruction, and we remember the current
218 // - if it isn't compatible and InsertionPoint is set we insert a seteg before
230 MachineInstr *InsertionPoint = nullptr; local
232 // requirements for the block, and need to defer the first InsertionPoint to
257 // If an InsertionPoint is set we will insert a setreg there.
258 if (InsertionPoint) {
259 insertSetreg(MBB, InsertionPoint, TII, IPChange.delta(NewInfo->Change));
260 InsertionPoint = nullptr;
279 if (InsertionPoint) {
[all...] |
| /freebsd-11-stable/contrib/llvm-project/clang/lib/Format/ |
| H A D | SortJavaScriptImports.cpp | 170 SourceRange InsertionPoint = References[0].Range;
171 InsertionPoint.setEnd(References[References.size() - 1].Range.getEnd());
180 unsigned PreviousSize = getSourceText(InsertionPoint).size();
190 << getSourceText(InsertionPoint) << "\nwith:\n"
193 Env.getSourceManager(), CharSourceRange::getCharRange(InsertionPoint),
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 450 Instruction *InsertionPoint = findInsertionPoint(*User, OpNo); local
453 LLVM_DEBUG(InsertionPoint->print(dbgs()));
456 if (isDominated(InsertionPoint, User, OpNo, InsertPts))
460 if (tryAndMerge(InsertionPoint, User, OpNo, InsertPts))
466 InsertPts[InsertionPoint].emplace_back(User, OpNo);
|
| H A D | AArch64LoadStoreOptimizer.cpp | 696 MachineBasicBlock::iterator InsertionPoint = MergeForward ? MergeMI : I;
721 MIB = BuildMI(*MBB, InsertionPoint, DL, TII->get(getMatchingWideOpcode(Opc)))
870 MachineBasicBlock::iterator InsertionPoint = MergeForward ? Paired : I;
942 MIB = BuildMI(*MBB, InsertionPoint, DL, TII->get(getMatchingPairOpcode(Opc)))
976 // InsertionPoint.
978 BuildMI(*MBB, InsertionPoint, DL, TII->get(TargetOpcode::KILL), DstRegW)
984 BuildMI(*MBB, InsertionPoint, DL, TII->get(AArch64::SBFMXri), DstRegX)
|
| /freebsd-11-stable/contrib/llvm-project/clang/tools/driver/ |
| H A D | driver.cpp | 218 int InsertionPoint = 0; local
220 ++InsertionPoint;
224 ArgVector.insert(ArgVector.begin() + InsertionPoint,
231 ArgVector.insert(ArgVector.begin() + InsertionPoint,
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | InterleavedLoadCombinePass.cpp | 1122 // just before InsertionPoint.
1123 LoadInst *InsertionPoint = InterleavedLoad.front().EI[0].LI; local
1126 if (!InsertionPoint)
1194 if (!DT.dominates(InsertionPoint, VI.SVI))
1200 IRBuilder<> Builder(InsertionPoint);
1210 Instruction::Load, ILTy, Factor, Indices, InsertionPoint->getAlignment(),
1211 InsertionPoint->getPointerAddressSpace());
1218 auto CI = Builder.CreatePointerCast(InsertionPoint->getOperand(0),
1223 auto LI = Builder.CreateAlignedLoad(ILTy, CI, InsertionPoint->getAlignment(),
1227 LI, nullptr, MSSA.getMemoryAccess(InsertionPoint)));
[all...] |
| H A D | EarlyIfConversion.cpp | 139 MachineBasicBlock::iterator InsertionPoint; member in class:__anon1707::SSAIfConv
359 /// This function sets InsertionPoint and returns true when successful, it
419 InsertionPoint = I;
638 Head->splice(InsertionPoint, TBB, TBB->begin(), TBB->getFirstTerminator());
643 Head->splice(InsertionPoint, FBB, FBB->begin(), FBB->getFirstTerminator());
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/Unix/ |
| H A D | Signals.inc | 122 std::atomic<FileToRemoveList *> *InsertionPoint = &Head;
124 while (!InsertionPoint->compare_exchange_strong(OldHead, NewHead)) {
125 InsertionPoint = &OldHead->Next;
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
| H A D | MipsELFObjectWriter.cpp | 494 auto InsertionPoint = local
515 if (InsertionPoint != Sorted.end())
516 InsertionPoint->Matched = true;
517 Sorted.insert(InsertionPoint, R)->Matched = true;
|
| /freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | ScalarEvolutionExpander.h | 36 bool isSafeToExpandAt(const SCEV *S, const Instruction *InsertionPoint,
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ScalarEvolutionExpander.cpp | 2430 bool isSafeToExpandAt(const SCEV *S, const Instruction *InsertionPoint, argument
2434 // We have to prove that the expanded site of S dominates InsertionPoint.
2440 if (SE.properlyDominates(S, InsertionPoint->getParent()))
2442 if (SE.dominates(S, InsertionPoint->getParent())) {
2443 if (InsertionPoint->getParent()->getTerminator() == InsertionPoint)
2446 for (const Value *V : InsertionPoint->operand_values())
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | JumpThreading.cpp | 2747 Instruction *InsertionPoint = &*BB->getFirstInsertionPt(); local
2748 assert(InsertionPoint && "Empty block?");
2755 NewPN->insertBefore(InsertionPoint);
|
| H A D | SROA.cpp | 3287 OpSplitter(Instruction *InsertionPoint, Value *Ptr, Type *BaseTy,
3289 : IRB(InsertionPoint), GEPIndices(1, IRB.getInt32(0)), Ptr(Ptr),
3350 LoadOpSplitter(Instruction *InsertionPoint, Value *Ptr, Type *BaseTy,
3352 : OpSplitter<LoadOpSplitter>(InsertionPoint, Ptr, BaseTy, BaseAlign,
3391 StoreOpSplitter(Instruction *InsertionPoint, Value *Ptr, Type *BaseTy,
3393 : OpSplitter<StoreOpSplitter>(InsertionPoint, Ptr, BaseTy, BaseAlign,
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVISelLowering.cpp | 1375 auto InsertionPoint = TailMBB->begin(); local
1380 BuildMI(*TailMBB, InsertionPoint, SelectMBBI->getDebugLoc(),
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86ISelLowering.cpp | [all...] |