HomeSort by: relevance | last modified time | path
    Searched refs:CSEMap (Results 1 - 6 of 6) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
CSEInfo.cpp 103 bool Removed = CSEMap.RemoveNode(UMI);
112 auto *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos);
130 CSEMap.InsertNode(UMI, InsertPos);
132 MaybeNewNode = CSEMap.GetOrInsertNode(UMI);
251 CSEMap.clear();
273 CSEMap.FindNodeOrInsertPos(TmpID, InsertPos);
276 "CSEMap mismatch, InstrMapping has MIs without "
277 "corresponding Nodes in CSEMap");
280 // For every node in the CSEMap, make sure that the InstrMapping
282 for (const UniqueMachineInstr &UMI : CSEMap) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineLICM.cpp 155 DenseMap<unsigned, std::vector<MachineInstr *>> CSEMap;
189 CSEMap.clear();
385 // CSEMap is initialized for loop header when the first instruction is
390 CSEMap.clear();
1291 CSEMap[MI.getOpcode()].push_back(&MI);
1315 if (CI == CSEMap.end() || MI->isImplicitDef())
1375 CSEMap.find(Opcode);
1378 if (CI == CSEMap.end() || MI->isImplicitDef())
1430 CSEMap.find(Opcode);
1452 if (CI != CSEMap.end()
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
CSEInfo.h 27 /// be uniqued in a CSEMap. The tradeoff here is extra memory allocations for
67 /// the CSEMap. There is Opcode level granularity on which instructions can be
74 FoldingSet<UniqueMachineInstr> CSEMap;
86 /// list and avoid inserting and then removing from the CSEMap.
104 /// Get the MachineInstr(Unique) if it exists already in the CSEMap and the
111 /// into the CSEMap. MI should return true for shouldCSE(MI->getOpcode())
123 /// Records a newly created inst in a list and lazily insert it to the CSEMap.
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAG.cpp 1018 assert(N->getOpcode() != ISD::DELETED_NODE && "DELETED_NODE in CSEMap!");
1019 assert(N->getOpcode() != ISD::EntryToken && "EntryToken in CSEMap!");
1020 Erased = CSEMap.RemoveNode(N);
1046 SDNode *Existing = CSEMap.GetOrInsertNode(N);
1182 SDNode *N = CSEMap.FindNodeOrInsertPos(ID, InsertPos);
1197 SDNode *N = CSEMap.FindNodeOrInsertPos(ID, InsertPos);
1224 CSEMap.clear();
1457 CSEMap.InsertNode(N, IP);
1514 CSEMap.InsertNode(N, IP);
1573 CSEMap.InsertNode(N, IP)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
SelectionDAG.h 256 FoldingSet<SDNode> CSEMap;
2002 /// Look up the node specified by ID in CSEMap. If it exists, return it. If
2008 /// Look up the node specified by ID in CSEMap. If it exists, return it. If
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 3813 SmallDenseMap<Instruction *, Instruction *, 4, CSEDenseMapInfo> CSEMap;
3822 if (Instruction *V = CSEMap.lookup(In)) {
3828 CSEMap[In] = In;

Completed in 49 milliseconds