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

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
GISelWorkList.h 30 DenseMap<MachineInstr *, unsigned> WorklistMap;
37 GISelWorkList() : WorklistMap(N) {}
39 bool empty() const { return WorklistMap.empty(); }
41 unsigned size() const { return WorklistMap.size(); }
59 // This asserts that the WorklistMap is empty, and then
63 assert(WorklistMap.empty() && "Expecting empty worklistmap");
65 WorklistMap.reserve(Worklist.size());
67 if (!WorklistMap.try_emplace(Worklist[i], i).second)
77 if (WorklistMap.try_emplace(I, Worklist.size()).second
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/InstCombine/
InstCombineWorklist.h 29 DenseMap<Instruction *, unsigned> WorklistMap;
64 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
83 WorklistMap.reserve(Size);
88 DenseMap<Instruction*, unsigned>::iterator It = WorklistMap.find(I);
89 if (It != WorklistMap.end()) {
92 WorklistMap.erase(It);
102 WorklistMap.erase(I);
116 assert(WorklistMap.empty() && "Worklist empty, but map not?");
120 WorklistMap.clear();
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp 168 DenseMap<SDNode *, unsigned> WorklistMap;
227 bool GoodWorklistEntry = WorklistMap.erase(N);
274 if (WorklistMap.insert(std::make_pair(N, Worklist.size())).second)
284 auto It = WorklistMap.find(N);
285 if (It == WorklistMap.end())
290 WorklistMap.erase(It);

Completed in 98 milliseconds