blob: f94e32d5dc2a6fdf793b6d8bde74bbf9f562c73e (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
/****************************************************************************
**
** Copyright (C) 2016 The Qt Company Ltd.
** Contact: https://www.qt.io/licensing/
**
** This file is part of jom.
**
** 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 The Qt Company. For licensing terms
** and conditions see https://www.qt.io/terms-conditions. For further
** information use the contact form at https://www.qt.io/contact-us.
**
** GNU General Public License Usage
** Alternatively, this file may be used under the terms of the GNU
** General Public License version 3 as published by the Free Software
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
** included in the packaging of this file. Please review the following
** information to ensure the GNU General Public License requirements will
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
**
****************************************************************************/
#ifndef DEPENDENCYGRAPH_H
#define DEPENDENCYGRAPH_H
#include <QtCore/QHash>
#include <QtCore/QSet>
namespace NMakeFile {
class DescriptionBlock;
class DependencyGraph
{
public:
DependencyGraph();
~DependencyGraph();
void build(DescriptionBlock* target);
bool isEmpty() const;
void removeLeaf(DescriptionBlock* target);
DescriptionBlock *findAvailableTarget(bool ignoreTimeStamps);
void dump();
void dotDump();
void clear();
private:
bool isTargetUpToDate(DescriptionBlock* target);
struct Node
{
enum State {UnknownState, ExecutingState};
State state;
DescriptionBlock* target;
QList<Node*> children;
QList<Node*> parents;
};
Node* createNode(DescriptionBlock* target, Node* parent);
void deleteNode(Node* node);
void removeLeaf(Node* node);
void internalBuild(Node *node, QSet<Node *> &seen);
void addEdge(Node* parent, Node* child);
void internalDump(Node* node, QString& indent);
void internalDotDump(Node* node, const QString& parent);
void displayNodeBuildInfo(Node* node, bool isUpToDate);
private:
Node* m_root;
QHash<DescriptionBlock*, Node*> m_nodeContainer;
QSet<Node*> m_leavesSet;
QList<Node*> m_leavesList;
bool m_bDirtyLeaves;
};
} // namespace NMakeFile
#endif // DEPENDENCYGRAPH_H
|
