VariOCL/control_dependence.cpp at master · JiadingGai/VariOCL · GitHub

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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#define DEBUG_TYPE "mxpa_cdg"

// LLVM includes

// MxPA includes
#include "control_dependence.h"

namespace SpmdKernel {

using namespace llvm;

namespace Coarsening {

  char ControlDep::ID = 0;

  namespace {
    static
    RegisterPass<ControlDep> CDGFunPass("mxpa_cdg",
      "control dependence graph construction.");
  }

  bool ControlDep::runOnFunction(Function &F) {
    bool Changed = false;

    // Compute iterated post dominator frontiers.
    Frontiers.clear();
    PostDominatorTree &DT = getAnalysis<PostDominatorTree>();
    Roots = DT.getRoots();
    if (const DomTreeNode *Root = DT.getRootNode())
      calculate(DT, Root);

    // Put control dependence relations in a Digraph "CDG".
    DEBUG_WITH_TYPE("mxpa_cdg", debugCD(F));

    CDG.setNumNodes(F.size());
    for (Function::iterator BI = F.begin(), BE = F.end();
         BI != BE; ++BI) {
      BasicBlock *X = BI;
      CDG.addNode(X);
      for (Function::iterator BI2 = F.begin(), BE2 = F.end();
           BI2 != BE2; ++BI2) {
        BasicBlock *Y = BI2;
        bool IsCD = isCtrlDep(X, Y);
        if (IsCD) {
          CDG.addEdge(X, Y);
        }
      }
    }
    DEBUG_WITH_TYPE("mxpa_cdg", CDG.dump());

    TCCDG.setDigraph(&CDG);
    TCCDG.computeTC();
    DEBUG_WITH_TYPE("mxpa_cdg", TCCDG.dump());

    // Now the reverse CDG
    DF = &getAnalysis<DominanceFrontier>();

    RCDG.setNumNodes(F.size());
    for (Function::iterator BI = F.begin(), BE = F.end();
         BI != BE; ++BI) {
      BasicBlock *X = BI;
      RCDG.addNode(X);
      for (Function::iterator BI2 = F.begin(), BE2 = F.end();
           BI2 != BE2; ++BI2) {
        BasicBlock *Y = BI2;
        bool IsCD = isReverselyCtrlDep(X, Y);
        if (IsCD) {
          RCDG.addEdge(X, Y);
        }
      }
    }
    DEBUG_WITH_TYPE("mxpa_cdg", RCDG.dump());

    TCRCDG.setDigraph(&RCDG);
    TCRCDG.computeTC();
    DEBUG_WITH_TYPE("mxpa_cdg", TCRCDG.dump());

    return Changed;
  }

  void ControlDep::getAnalysisUsage(AnalysisUsage &AU) const {
    AU.setPreservesAll();
    AU.addRequired<DominatorTree>();
    AU.addRequired<PostDominatorTree>();
    AU.addRequired<DominanceFrontier>();
  }

  const DominanceFrontier::DomSetType &
  ControlDep::calculate(const PostDominatorTree &DT,
                        const DomTreeNode *Node) {
    BasicBlock *BB = Node->getBlock();
    DomSetType &S = Frontiers[BB];
    if (getRoots().empty()) return S;

    if (BB)
      for (pred_iterator SI = pred_begin(BB), SE = pred_end(BB);
           SI != SE; ++SI) {
        BasicBlock *P = *SI;
        DomTreeNode *SINode = DT[P];
        if (SINode && SINode->getIDom() != Node)
          S.insert(P);
      }

    for (DomTreeNode::const_iterator
           NI = Node->begin(), NE = Node->end(); NI != NE; ++NI) {
      DomTreeNode *IDominee = *NI;
      const DomSetType &ChildDF = calculate(DT, IDominee);

      DomSetType::const_iterator CDFI = ChildDF.begin();
      DomSetType::const_iterator CDFE = ChildDF.end();
      for (; CDFI != CDFE; ++CDFI) {
        if (!DT.properlyDominates(Node, DT[*CDFI]))
          S.insert(*CDFI);
      }
    }

    return S;
  }

  bool ControlDep::isCtrlDep(BasicBlock *X, BasicBlock *Y)
  {
    DomSetType YF = Frontiers[Y];

    if (YF.find(X) != YF.end()) {
      return true;
    } else {
      return false;
    }
  }

  bool ControlDep::isReverselyCtrlDep(BasicBlock *X, BasicBlock *Y)
  {
    DomSetType YF = DF->find(Y)->second;

    if (YF.find(X) != YF.end()) {
      return true;
    } else {
      return false;
    }
  }

  bool ControlDep::isIterativelyCtrlDep(BasicBlock *X, BasicBlock *Y)
  {
     return TCCDG.reachable(X, Y);
  }

  bool ControlDep::isReverselyIterativelyCtrlDep(BasicBlock *X, BasicBlock *Y)
  {
     return TCRCDG.reachable(X, Y);
  }

  void ControlDep::debugCD(Function &F)
  {
    for (Function::iterator BI = F.begin(), BE = F.end();
         BI != BE; ++BI) {
      BasicBlock *X = BI;
      for (Function::iterator BI2 = F.begin(), BE2 = F.end();
           BI2 != BE2; ++BI2) {
        BasicBlock *Y = BI2;
        bool IsCD = isCtrlDep(X, Y);
        if (IsCD) {
          DEBUG_WITH_TYPE("mxpa_cdg",
            errs() << Y->getName() << " c-depends on "
                   << X->getName() << " : " << IsCD << "\n");
        }
      }
    }
  }

}
}