Searched refs:merge_order (Results 1 – 2 of 2) sorted by relevance
1326 const std::vector<Node*>& merge_order) { in DeleteReachableAndDeadNodes() argument1353 for (Node* m : merge_order) { in DeleteReachableAndDeadNodes()1387 void FunctionalizeCond::SortMergeNodes(std::vector<Node*>* merge_order) { in SortMergeNodes() argument1391 inner_to_outer_merge_order.reserve(merge_order->size()); in SortMergeNodes()1392 for (auto it = merge_order->rbegin(); it != merge_order->rend(); ++it) { in SortMergeNodes()1401 merge_order->clear(); in SortMergeNodes()1403 merge_order->push_back(t.second); in SortMergeNodes()1429 std::vector<Node*> merge_order; in FunctionalizeInternal() local1435 merge_order.push_back(n); in FunctionalizeInternal()1443 if (merge_order.empty()) { in FunctionalizeInternal()[all …]
248 void SortMergeNodes(std::vector<Node*>* merge_order);252 void DeleteReachableAndDeadNodes(const std::vector<Node*>& merge_order);