/* * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you under the Apache License, Version 2.0 (the * "License"); you may not use this file except in compliance * with the License. You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, * software distributed under the License is distributed on an * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY * KIND, either express or implied. See the License for the * specific language governing permissions and limitations * under the License. */ /*! * Copyright (c) 2016 by Contributors * \file node.cc * \brief Graph node data structure. */ #include <nnvm/node.h> namespace nnvm { Node::~Node() { if (inputs.size() != 0) { // explicit deletion via DFS // this is used to avoid stackoverflow caused by chain of deletions std::vector<Node*> stack{this}; std::vector<NodePtr> to_delete; while (!stack.empty()) { Node* n = stack.back(); stack.pop_back(); for (NodeEntry& e : n->inputs) { if (e.node.unique()) { stack.push_back(e.node.get()); to_delete.emplace_back(std::move(e.node)); } else { e.node.reset(); } } for (NodePtr& sp : n->control_deps) { if (sp.unique()) { stack.push_back(sp.get()); to_delete.emplace_back(std::move(sp)); } else { sp.reset(); } } n->inputs.clear(); } } } } // namespace nnvm