87d38be255
注册遍模板函数重构（针对遍的不同构造方法）， 修复phi指令更新引起的旧代码错误， 将CFG优化适配到现有终端框架中， 独立CFG优化方法使得其他优化遍能独立调用， usedelete方法回调取消删除功能。 IRGenerator代码风格修改。
52 lines
1.7 KiB
C++
52 lines
1.7 KiB
C++
#pragma once
|
|
|
|
#include "Pass.h" // 包含 Pass 框架
|
|
#include "IR.h" // 包含 IR 定义
|
|
#include <map>
|
|
#include <set>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
|
|
namespace sysy {
|
|
|
|
// 支配树分析结果类 (保持不变)
|
|
class DominatorTree : public AnalysisResultBase {
|
|
public:
|
|
DominatorTree(Function* F);
|
|
const std::set<BasicBlock*>* getDominators(BasicBlock* BB) const;
|
|
BasicBlock* getImmediateDominator(BasicBlock* BB) const;
|
|
const std::set<BasicBlock*>* getDominanceFrontier(BasicBlock* BB) const;
|
|
const std::map<BasicBlock*, std::set<BasicBlock*>>& getDominatorsMap() const { return Dominators; }
|
|
const std::map<BasicBlock*, BasicBlock*>& getIDomsMap() const { return IDoms; }
|
|
const std::map<BasicBlock*, std::set<BasicBlock*>>& getDominanceFrontiersMap() const { return DominanceFrontiers; }
|
|
void computeDominators(Function* F);
|
|
void computeIDoms(Function* F);
|
|
void computeDominanceFrontiers(Function* F);
|
|
private:
|
|
Function* AssociatedFunction;
|
|
std::map<BasicBlock*, std::set<BasicBlock*>> Dominators;
|
|
std::map<BasicBlock*, BasicBlock*> IDoms;
|
|
std::map<BasicBlock*, std::set<BasicBlock*>> DominanceFrontiers;
|
|
};
|
|
|
|
|
|
// 支配树分析遍
|
|
class DominatorTreeAnalysisPass : public AnalysisPass {
|
|
public:
|
|
// 唯一的 Pass ID
|
|
static void *ID;
|
|
|
|
DominatorTreeAnalysisPass() : AnalysisPass("DominatorTreeAnalysis", Pass::Granularity::Function) {}
|
|
|
|
// 实现 getPassID
|
|
void* getPassID() const override { return &ID; }
|
|
|
|
bool runOnFunction(Function* F, AnalysisManager &AM) override;
|
|
|
|
std::unique_ptr<AnalysisResultBase> getResult() override;
|
|
|
|
private:
|
|
std::unique_ptr<DominatorTree> CurrentDominatorTree;
|
|
};
|
|
|
|
} // namespace sysy
|