Home
last modified time | relevance | path

Searched refs:PredClosure (Results 1 – 2 of 2) sorted by relevance

/external/llvm/lib/Support/
DDAGDeltaAlgorithm.cpp78 std::map<change_ty, std::set<change_ty> > PredClosure; member in __anon7b74b1da0111::DAGDeltaAlgorithmImpl
92 assert(PredClosure.count(Node) && "Invalid node!"); in pred_closure_begin()
93 return PredClosure[Node].begin(); in pred_closure_begin()
96 assert(PredClosure.count(Node) && "Invalid node!"); in pred_closure_end()
97 return PredClosure[Node].end(); in pred_closure_end()
219 PredClosure.insert(std::make_pair(*it, std::set<change_ty>())); in DAGDeltaAlgorithmImpl()
224 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()
/external/swiftshader/third_party/LLVM/lib/Support/
DDAGDeltaAlgorithm.cpp79 std::map<change_ty, std::set<change_ty> > PredClosure; member in __anon9e630b860111::DAGDeltaAlgorithmImpl
93 assert(PredClosure.count(Node) && "Invalid node!"); in pred_closure_begin()
94 return PredClosure[Node].begin(); in pred_closure_begin()
97 assert(PredClosure.count(Node) && "Invalid node!"); in pred_closure_end()
98 return PredClosure[Node].end(); in pred_closure_end()
225 PredClosure.insert(std::make_pair(*it, std::set<change_ty>())); in DAGDeltaAlgorithmImpl()
230 PredClosure[*it2].insert(*it); in DAGDeltaAlgorithmImpl()