-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDependenceGraph.h
74 lines (62 loc) · 2.12 KB
/
DependenceGraph.h
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
// Copyright (C) 2013 The University of Michigan
//
// Licensed 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.
//
// Authors - Chun-Hung Hsiao ([email protected])
//
#ifndef DEPENDENCEGRAPHBUILDER_H
#define DEPENDENCEGRAPHBUILDER_H
#include <list>
#include <map>
#include <utility>
#include "CanonicalAst.h"
using std::list;
using std::map;
using std::pair;
class DependenceGraph : public map<Statement*,list<Statement*> > {
public:
const DependenceGraph GetNeighborhood(Statement* node, int radius) const;
};
class DependenceGraphBuilder : public CanonicalAstVisitor {
public:
void Build(FunctionLiteral* program);
inline const DependenceGraph& GetGraph() const { return graph_; }
inline const list<Statement*>& GetSuccessors(Statement* node) const { return reverse_graph_.at(node); }
#define DECLARE_VISIT(type) \
void Visit##type(type* node);
AST_NODE_LIST(DECLARE_VISIT)
CANONICAL_NODE_LIST(DECLARE_VISIT)
#undef DECLARE_VISIT
private:
class Region {
public:
Region(Region* outer_region, Statement* entry);
~Region();
inline Statement* entry() const { return entry_; }
inline Region* outer_region() const { return outer_region_; }
pair<list<Statement*>::const_iterator,list<Statement*>::const_iterator> Find(Variable* var);
void Define(Variable* var, Statement* stmt);
private:
Region* outer_region_;
Statement* entry_;
map<Variable*,list<Statement*> > defs_;
};
Statement* visiting_;
Region* region_;
DependenceGraph graph_;
DependenceGraph reverse_graph_;
void VisitStatements(ZoneList<Statement*>* stmts);
void Read(Variable* var);
void Write(Variable* var);
};
#endif // DEPENDENCEGRAPHBUILDER_H