HomeSort by: relevance | last modified time | path
    Searched defs:Copies (Results 1 - 10 of 10) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
RDFCopy.h 50 std::vector<NodeId> Copies;
  /src/external/apache2/llvm/dist/libcxx/benchmarks/
algorithms.bench.cpp 155 TEST_ALWAYS_INLINE void resetCopies(benchmark::State& state, T& Copies,
158 for (auto& Copy : Copies)
171 auto Copies = makeOrderedValues<ValueType>(Quantity, O);
172 auto Orig = Copies;
175 ? Copies.size() * Quantity
176 : Copies.size();
178 for (auto& Copy : Copies) {
183 Copies = Orig;
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MIRCanonicalizerPass.cpp 304 std::vector<MachineInstr *> Copies;
307 Copies.push_back(&MI);
310 for (MachineInstr *MI : Copies) {
MachineCopyPropagation.cpp 80 STATISTIC(NumDeletes, "Number of dead copies deleted");
95 DenseMap<MCRegister, CopyInfo> Copies;
105 auto CI = Copies.find(*RUI);
106 if (CI != Copies.end())
120 auto I = Copies.find(*RUI);
121 if (I != Copies.end()) {
132 Copies.erase(*RUI);
138 auto I = Copies.find(*RUI);
139 if (I != Copies.end()) {
148 Copies.erase(I)
    [all...]
TailDuplicator.cpp 169 SmallVector<MachineInstr *, 16> Copies;
171 TDBBs, Copies, CandidatePtr))
241 // Eliminate some of the copies inserted by tail duplication to maintain
243 for (unsigned i = 0, e = Copies.size(); i != e; ++i) {
244 MachineInstr *Copy = Copies[i];
350 SmallVectorImpl<std::pair<Register, RegSubRegPair>> &Copies,
363 Copies.push_back(std::make_pair(NewDef, RegSubRegPair(SrcReg, SrcSubReg)));
720 SmallVectorImpl<MachineInstr *> &Copies) {
819 /// \p Copies A vector of copy instructions inserted. Used later to
820 /// walk all the inserted copies and remove redundant ones
    [all...]
RegAllocGreedy.cpp 557 unsigned Copies = 0;
566 ZeroCostFoldedReloads || Copies);
575 Copies += other.Copies;
1708 // is all copies.
2088 /// class, it may help to insert copies such that parts of the live range can
2117 // Otherwise, splitting just inserts uncoalescable copies that do not help
2135 LLVM_DEBUG(dbgs() << "All uses were copies.\n");
2910 /// been recolored and so on, until no more copies can be coalesced or
2913 /// frequencies of the non-identity copies it would introduce with the ol
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGFast.cpp 34 STATISTIC(NumPRCopies, "Number of physical copies");
378 /// InsertCopiesAndMoveSuccs - Insert register copies and move all
383 SmallVectorImpl<SUnit*> &Copies) {
416 Copies.push_back(CopyFromSU);
417 Copies.push_back(CopyToSU);
560 // Try code duplication or inserting cross class copies
566 // that doesn't work, insert cross class copies.
580 // possible to copy the value but it require cross register class copies
592 // Issue copies, these can be expensive cross register class copies
    [all...]
ScheduleDAGRRList.cpp 67 STATISTIC(NumPRCopies, "Number of physical register copies");
713 // Noops don't affect the scoreboard state. Copies are likely to be
1220 /// InsertCopiesAndMoveSuccs - Insert register copies and move all
1225 SmallVectorImpl<SUnit*> &Copies) {
1250 // continue inserting copies indefinitely.
1267 Copies.push_back(CopyFromSU);
1268 Copies.push_back(CopyToSU);
1498 // Try backtracking, code duplication, or inserting cross class copies
1549 // insert cross class copies.
1550 // If it's not too expensive, i.e. cost != -1, issue copies
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
MVETPAndVPTOptimisationsPass.cpp 135 // Find the dec from the use of the end. There may be copies between
308 // is using LR (especially calls) and there are no superfluous copies in the
345 // Remove any copies from the loop, to ensure the phi that remains is both
351 // Ensure the uses are expected, and collect any copies we want to remove.
352 SmallVector<MachineInstr *, 4> Copies;
353 auto CheckUsers = [&Copies](Register BaseReg,
369 Copies.push_back(&MI);
410 for (auto *MI : Copies)
ARMISelLowering.cpp 1571 // due to the common occurrence of cross class copies and subregister insertions
2092 /// appropriate copies out of appropriate physical registers.
2315 // Walk the register/memloc assignments, inserting copies/loads. In the case
3084 // Guarantee that all emitted copies are
3144 SmallPtrSet<SDNode*, 2> Copies;
3149 Copies.insert(*UI);
3151 if (Copies.size() > 2)
3157 if (Copies.count(UseChain.getNode()))
7595 // such that the register coalescer will remove unnecessary copies.
10723 // Otherwise, we will generate unrolled scalar copies
    [all...]

Completed in 113 milliseconds