Home
last modified time | relevance | path

Searched refs:Copies (Results 1 – 25 of 90) sorted by relevance

1234

/openbsd/gnu/llvm/libcxx/benchmarks/algorithms/
H A Dcommon.h201 TEST_ALWAYS_INLINE void resetCopies(benchmark::State& state, T& Copies, in resetCopies() argument
204 for (auto& Copy : Copies) in resetCopies()
217 auto Copies = makeOrderedValues<ValueType>(Quantity, O); in runOpOnCopies() local
218 auto Orig = Copies; in runOpOnCopies()
221 ? Copies.size() * Quantity in runOpOnCopies()
222 : Copies.size(); in runOpOnCopies()
224 for (auto& Copy : Copies) { in runOpOnCopies()
229 Copies = Orig; in runOpOnCopies()
/openbsd/gnu/llvm/llvm/lib/CodeGen/
H A DMachineCopyPropagation.cpp122 if (CI != Copies.end()) in markRegsUnavailable()
137 auto I = Copies.find(*RUI); in invalidateRegister()
138 if (I != Copies.end()) { in invalidateRegister()
154 Copies.erase(*RUI); in invalidateRegister()
161 auto I = Copies.find(*RUI); in clobberRegister()
162 if (I != Copies.end()) { in clobberRegister()
175 Copies.erase(I); in clobberRegister()
205 return !Copies.empty(); in hasAnyCopies()
212 if (CI == Copies.end()) in findCopyForUnit()
222 if (CI == Copies.end()) in findCopyDefViaUnit()
[all …]
H A DTailDuplicator.cpp166 SmallVector<MachineInstr *, 16> Copies; in tailDuplicateAndUpdate() local
168 TDBBs, Copies, CandidatePtr)) in tailDuplicateAndUpdate()
244 for (unsigned i = 0, e = Copies.size(); i != e; ++i) { in tailDuplicateAndUpdate()
245 MachineInstr *Copy = Copies[i]; in tailDuplicateAndUpdate()
350 SmallVectorImpl<std::pair<Register, RegSubRegPair>> &Copies, in processPHI() argument
828 SmallVectorImpl<MachineInstr *> &Copies, in tailDuplicate() argument
893 appendCopies(PredBB, CopyInfos, Copies); in tailDuplicate()
961 appendCopies(PrevBB, CopyInfos, Copies); in tailDuplicate()
1027 appendCopies(PredBB, CopyInfos, Copies); in tailDuplicate()
1037 SmallVectorImpl<MachineInstr*> &Copies) { in appendCopies() argument
[all …]
H A DRegAllocGreedy.h408 unsigned Copies = 0; member
417 ZeroCostFoldedReloads || Copies); in isEmpty()
426 Copies += other.Copies; in add()
H A DMIRCanonicalizerPass.cpp294 std::vector<MachineInstr *> Copies; in propagateLocalCopies() local
297 Copies.push_back(&MI); in propagateLocalCopies()
300 for (MachineInstr *MI : Copies) { in propagateLocalCopies()
H A DSplitKit.h384 void removeBackCopies(SmallVectorImpl<VNInfo*> &Copies);
H A DRegAllocGreedy.cpp2439 if (Copies) { in report()
2440 R << NV("NumVRCopies", Copies) << " virtual registers copies "; in report()
2478 ++Stats.Copies; in computeStats()
2532 Stats.CopiesCost = RelFreq * Stats.Copies; in computeStats()
/openbsd/gnu/llvm/llvm/include/llvm/CodeGen/
H A DTailDuplicator.h106 SmallVectorImpl<std::pair<Register, RegSubRegPair>> &Copies,
123 SmallVectorImpl<MachineInstr *> &Copies,
127 SmallVectorImpl<MachineInstr *> &Copies);
/openbsd/gnu/llvm/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp379 SmallVectorImpl<SUnit*> &Copies) { in InsertCopiesAndMoveSuccs() argument
412 Copies.push_back(CopyFromSU); in InsertCopiesAndMoveSuccs()
413 Copies.push_back(CopyToSU); in InsertCopiesAndMoveSuccs()
608 SmallVector<SUnit*, 2> Copies; in ListScheduleBottomUp() local
609 InsertCopiesAndMoveSuccs(LRDef, Reg, DestRC, RC, Copies); in ListScheduleBottomUp()
611 << " to SU #" << Copies.front()->NodeNum << "\n"); in ListScheduleBottomUp()
612 AddPred(TrySU, SDep(Copies.front(), SDep::Artificial)); in ListScheduleBottomUp()
613 NewDef = Copies.back(); in ListScheduleBottomUp()
H A DScheduleDAGRRList.cpp1228 SmallVectorImpl<SUnit*> &Copies) { in InsertCopiesAndMoveSuccs() argument
1270 Copies.push_back(CopyFromSU); in InsertCopiesAndMoveSuccs()
1271 Copies.push_back(CopyToSU); in InsertCopiesAndMoveSuccs()
1590 SmallVector<SUnit*, 2> Copies; in PickNodeToScheduleBottomUp() local
1591 InsertCopiesAndMoveSuccs(LRDef, Reg, DestRC, RC, Copies); in PickNodeToScheduleBottomUp()
1593 << " to SU #" << Copies.front()->NodeNum << "\n"); in PickNodeToScheduleBottomUp()
1594 AddPredQueued(TrySU, SDep(Copies.front(), SDep::Artificial)); in PickNodeToScheduleBottomUp()
1595 NewDef = Copies.back(); in PickNodeToScheduleBottomUp()
/openbsd/gnu/llvm/llvm/lib/Target/Hexagon/
H A DRDFCopy.cpp65 Copies.push_back(SA.Id); in recordCopy()
106 for (NodeId I : Copies) { in run()
133 for (NodeId C : Copies) { in run()
H A DRDFCopy.h50 std::vector<NodeId> Copies; member
/openbsd/gnu/llvm/llvm/lib/Target/ARM/
H A DMVETPAndVPTOptimisationsPass.cpp360 SmallVector<MachineInstr *, 4> Copies; in MergeLoopEnd() local
361 auto CheckUsers = [&Copies](Register BaseReg, in MergeLoopEnd()
377 Copies.push_back(&MI); in MergeLoopEnd()
429 for (auto *MI : Copies) in MergeLoopEnd()
/openbsd/gnu/llvm/llvm/docs/GlobalISel/
H A DRegBankSelect.rst32 * **Cross-Bank Copies**: ``copyCost`` --- the cost of a ``COPY`` from one bank
/openbsd/gnu/llvm/llvm/lib/Target/X86/
H A DX86FlagsCopyLowering.cpp383 SmallVector<MachineInstr *, 4> Copies; in runOnMachineFunction() local
389 Copies.push_back(&MI); in runOnMachineFunction()
391 for (MachineInstr *CopyI : Copies) { in runOnMachineFunction()
/openbsd/gnu/gcc/gcc/doc/
H A Dbugreport.texi93 submit bug reports. Copies of this file in HTML (@file{bugs.html}) and
H A Dgccint.texi47 software. Copies published by the Free Software Foundation raise
H A Dgcc.texi61 software. Copies published by the Free Software Foundation raise
/openbsd/gnu/usr.bin/gcc/gcc/doc/
H A Dbugreport.texi93 submit bug reports. Copies of this file in HTML (@file{bugs.html}) and
H A Dgcc.texi82 software. Copies published by the Free Software Foundation raise
H A Dgccint.texi68 software. Copies published by the Free Software Foundation raise
/openbsd/gnu/lib/libstdc++/libstdc++/include/ext/
H A Dmemory117 * @brief Copies the range [first,last) into result.
/openbsd/gnu/gcc/libstdc++-v3/include/ext/
H A Dmemory114 * @brief Copies the range [first,last) into result.
/openbsd/gnu/gcc/gcc/config/mt/
H A DABI.txt178 Copies of large structs are made under the following rules:
/openbsd/gnu/gcc/gcc/config/iq2000/
H A Dabi186 Copies of large structs are made under the following rules:

1234