/****************************************************************************
**
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
** Contact: http://www.qt-project.org/legal
**
** This file is part of the Qt Build Suite.
**
** Commercial License Usage
** Licensees holding valid commercial Qt licenses may use this file in
** accordance with the commercial license agreement provided with the
** Software or, alternatively, in accordance with the terms contained in
** a written agreement between you and Digia.  For licensing terms and
** conditions see http://qt.digia.com/licensing.  For further information
** use the contact form at http://qt.digia.com/contact-us.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file.  Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Digia gives you certain additional
** rights.  These rights are described in the Digia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
****************************************************************************/

#include "buildgraphnode.h"

#include "buildgraphvisitor.h"
#include "projectbuilddata.h"
#include <language/language.h>
#include <logging/translator.h>
#include <tools/error.h>
#include <tools/qbsassert.h>

//#include <qglobal.h>

namespace qbs {
namespace Internal {

BuildGraphNode::BuildGraphNode()
{
}

BuildGraphNode::~BuildGraphNode()
{
    foreach (BuildGraphNode *p, parents)
        p->children.remove(this);
    foreach (BuildGraphNode *c, children)
        c->parents.remove(this);
}

void BuildGraphNode::onChildDisconnected(BuildGraphNode *child)
{
    Q_UNUSED(child);
}

void BuildGraphNode::acceptChildren(BuildGraphVisitor *visitor)
{
    foreach (BuildGraphNode *child, children)
        child->accept(visitor);
}

void BuildGraphNode::load(PersistentPool &pool)
{
    children.load(pool);
    // Parents must be updated after loading all nodes.
}

void BuildGraphNode::store(PersistentPool &pool) const
{
    children.store(pool);
    // Do not store parents to avoid recursion.
}

} // namespace Internal
} // namespace qbs