增加窥孔优化：取余数优化

ComradeProgrammer · ComradeProgrammer · commit 88dfe9ee6bd6 · 2019-12-11T23:48:59.000+08:00
diff --git a/Block.cpp b/Block.cpp
@@ -26,7 +26,7 @@ void Block::useDefScan() {
 		if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
 			|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
 			|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
-			|| i.op == MIDNEQ||i.op==MIDARRAYGET) {
+			|| i.op == MIDNEQ||i.op==MIDARRAYGET||i.op==MIDREM) {
 			use.erase(i.target);
 			def.insert(i.target);
 			if (!i.isImmediate1) {
@@ -97,7 +97,7 @@ vector<vector<int>>Block::conflictEdgeAnalyze(){
 		if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
 			|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
 			|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
-			|| i.op == MIDNEQ || i.op == MIDARRAYGET) {
+			|| i.op == MIDNEQ || i.op == MIDARRAYGET||i.op==MIDREM) {
 			localActive.erase(i.target);
 			if (!i.isImmediate1) {
 				localActive.insert(i.operand1);
@@ -190,6 +190,16 @@ void Block::eliminateDeadCode() {
 	v=eliminator.eliminateDeadCode(v);
 }
 
+void Block::blockOptimize() {
+	BlockOptimization bop(activeOut);
+	v = bop.propagationInBlock(v);
+}
+
+void Block::peepholeOptimize() {
+	PeepHoleOptimization opt;
+	v = opt.peepHoleOptimization(v);
+}
+
 set<int>Block::setUnion(set<int> a, set<int> b) {
 	set<int>res;
 	for (int i : a) {
@@ -258,10 +268,6 @@ ostream& operator<<(ostream& out, Block b) {
 	return out;
 }
 
-void Block::blockOptimize() {
-	BlockOptimization bop(activeOut);
-	v = bop.propagationInBlock(v);
-}
 
 void Block::activeVariableAnalyzePerLine() {
 	set<int>localActive = activeOut;
@@ -272,7 +278,7 @@ void Block::activeVariableAnalyzePerLine() {
 		if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
 			|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
 			|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
-			|| i.op == MIDNEQ || i.op == MIDARRAYGET) {
+			|| i.op == MIDNEQ || i.op == MIDARRAYGET||i.op==MIDREM) {
 			localActive.erase(i.target);
 			if (!i.isImmediate1) {
 				localActive.insert(i.operand1);
diff --git a/Block.h b/Block.h
@@ -5,6 +5,7 @@
 #include"DagMap.h"
 #include"DeadCodeEliminator.h"
 #include"BlockOptimization.h"
+#include"PeepHoleOptimization.h"
 using namespace std;
 
 class Block {
@@ -34,4 +35,5 @@ class Block {
 	void eliminateDeadCode();
 	void blockOptimize();
 	void activeVariableAnalyzePerLine();
+	void peepholeOptimize();
 };
diff --git a/BlockOptimization.cpp b/BlockOptimization.cpp
@@ -56,6 +56,7 @@ vector<MidCode>BlockOptimization::propagationInBlock(vector<MidCode>& v) {
 			case MIDGEQ:
 			case MIDEQL:
 			case MIDNEQ:
+			case MIDREM:
 			{
 				MidCode tmp = c;
 				//����������������ǳ����Ļ�
diff --git a/C0Compiler.rar b/C0Compiler.rar
diff --git a/C0Compiler.vcxproj b/C0Compiler.vcxproj
@@ -147,6 +147,7 @@
     <ClCompile Include="MidCode.cpp" />
     <ClCompile Include="MidCodeFrameWork.cpp" />
     <ClCompile Include="MipsTranslator.cpp" />
+    <ClCompile Include="PeepHoleOptimization.cpp" />
     <ClCompile Include="SubSymbolTable.cpp" />
     <ClCompile Include="SymbolTable.cpp" />
   </ItemGroup>
@@ -164,6 +165,7 @@
     <ClInclude Include="MidCodeContainer.h" />
     <ClInclude Include="MidCodeFramework.h" />
     <ClInclude Include="MipsTranslator.h" />
+    <ClInclude Include="PeepHoleOptimization.h" />
     <ClInclude Include="SubSymbolTable.h" />
     <ClInclude Include="SymbolTable.h" />
   </ItemGroup>
diff --git a/C0Compiler.vcxproj.filters b/C0Compiler.vcxproj.filters
@@ -104,6 +104,9 @@
     <ClCompile Include="BlockOptimization.cpp">
       <Filter>源文件\BackEnd</Filter>
     </ClCompile>
+    <ClCompile Include="PeepHoleOptimization.cpp">
+      <Filter>源文件\BackEnd</Filter>
+    </ClCompile>
   </ItemGroup>
   <ItemGroup>
     <ClInclude Include="LexicalAnalyzer.h">
@@ -151,6 +154,9 @@
     <ClInclude Include="BlockOptimization.h">
       <Filter>头文件\BackEnd</Filter>
     </ClInclude>
+    <ClInclude Include="PeepHoleOptimization.h">
+      <Filter>头文件\BackEnd</Filter>
+    </ClInclude>
   </ItemGroup>
   <ItemGroup>
     <Image Include="Annotation 2019-09-26 123820.jpg">
diff --git a/DagMap.cpp b/DagMap.cpp
@@ -114,6 +114,7 @@ void DagMap::handleMidCode(MidCode c){
 		case MIDGEQ:
 		case MIDEQL:
 		case MIDNEQ:
+		case MIDREM:
 		case MIDARRAYGET:
 		{
 			DagNode* node1 = getNodeByVar(c.operand1, c.isImmediate1);
@@ -372,6 +373,7 @@ MidCode DagMap::nodeToMidCode(DagNode* node) {
 		case MIDNEQ:
 		case MIDARRAYGET:
 		case MIDARRAYWRITE:
+		case MIDREM:
 		{
 			MidCode res;
 			res.op = node->op;
diff --git a/DeadCodeEliminator.cpp b/DeadCodeEliminator.cpp
@@ -16,7 +16,7 @@ vector<MidCode> DeadCodeEliminator::eliminateDeadCode(vector<MidCode>& v) {
 		if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
 			|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
 			|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
-			|| i.op == MIDNEQ || i.op == MIDARRAYGET) {
+			|| i.op == MIDNEQ || i.op == MIDARRAYGET||i.op==MIDREM) {
 			SymbolEntry* entry = MidCode::table->getSymbolById(i.target);
 			if (localActive.find(i.target) == localActive.end()
 				&& (i.target < 0 || entry->scope != "")) {
diff --git a/FlowGraph.cpp b/FlowGraph.cpp
@@ -14,7 +14,9 @@ FlowGraph::FlowGraph(MidCodeContainer& c) {
 			Block* oldBlock = block;
 			block = new Block(functionId);
 			graph.push_back(oldBlock);
-			addLink(oldBlock, block);
+			if (!(i != 0 && (c.v[i - 1].op == MIDGOTO || c.v[i - 1].op == MIDRET))) {
+				addLink(oldBlock, block);
+			}
 		}
 		else if (i != 0 &&( c.v[i - 1].op == MIDGOTO||c.v[i-1].op==MIDRET)) {
 			Block* oldBlock = block;
@@ -52,12 +54,20 @@ void FlowGraph::addLink(Block* from, Block* to) {
 }
 
 void FlowGraph::optimize() {
+
 	activeVariableAnalyze();
 	DAGoptimize();
+
 	activeVariableAnalyze();
 	blockOptimize();
+
 	activeVariableAnalyze();
 	eliminateDeadCode();
+
+	activeVariableAnalyze();
+	activeVariablePerLine();
+	peepholeOptimize();
+
 	activeVariableAnalyze();
 	variableSummary();
 	activeVariablePerLine();
@@ -124,6 +134,7 @@ void FlowGraph::variableSummary() {
 			case MIDGEQ:
 			case MIDEQL:
 			case MIDNEQ:
+			case MIDREM:
 				if (!j.isImmediate1 && j.operand1 < -1) {
 					tmpVariable.insert(j.operand1);
 				}
@@ -271,4 +282,10 @@ ostream& operator<<(ostream& out, FlowGraph& f) {
 		out << (*i);
 	}
 	return out;
-}
+}
+
+void FlowGraph::peepholeOptimize() {
+	for (Block* i : graph) {
+		i->peepholeOptimize();
+	}
+}
diff --git a/FlowGraph.h b/FlowGraph.h
@@ -25,4 +25,5 @@ class FlowGraph {
 	void eliminateDeadCode();
 	void blockOptimize();
 	void activeVariablePerLine();
+	void peepholeOptimize();
 };
diff --git a/GrammarAnalyzer.cpp b/GrammarAnalyzer.cpp
@@ -749,7 +749,7 @@ void GrammarAnalyzer::parameterList(SymbolEntry* entry) {
 
 /*<复合语句>*/
  void GrammarAnalyzer::compoundSentence(){
-	inlineable = true;
+	 inlineable = true;
 	if (currentScope == "main") {
 		inlineable = false;
 	}
diff --git a/MidCode.cpp b/MidCode.cpp
@@ -50,6 +50,7 @@ ostream& operator<<(ostream& out, MidCode c) {
 	ops[MIDGEQ] = ">=";
 	ops[MIDEQL] = "==";
 	ops[MIDNEQ] = "!=";
+	ops[MIDREM] = "mod";
 	if (c.labelNo < -1) {
 		out << "_label" << -(c.labelNo) << ": ";
 	}
@@ -92,6 +93,7 @@ ostream& operator<<(ostream& out, MidCode c) {
 		case MIDGEQ:
 		case MIDEQL:
 		case MIDNEQ:
+		case MIDREM:
 			out << MidCode::getOperandName(c.target,false);
 			out << " " << "=" << " ";
 			out << MidCode::getOperandName(c.operand1, c.isImmediate1);
diff --git a/MidCode.h b/MidCode.h
@@ -41,6 +41,7 @@ enum MidCodeOp {
 	MIDREADINTEGER,//SYSCALL5 target-读入整数的id
 	MIDREADCHAR,//SYSCALL12  target-读入字符的id
 	MIDNOP,//对付跳转使用的，优化时候就都干掉了，什么都不要什么都不做
+	MIDREM,//取余数 xinzeng
 };
 /*再这里记录一下*/
 class MidCode {
diff --git a/MipsTranslator.cpp b/MipsTranslator.cpp
@@ -906,6 +906,46 @@ void MipsTranslator::translate(MidCode c) {
 			specialVarwriteback(c.target, false);
 			break;
 		}
+		case MIDREM:
+		{
+			if (c.isImmediate2) {
+				vector<int>conflictVar;
+				if (!c.isImmediate1) { conflictVar.push_back(c.operand1); }
+				int target = loadOperand(c.target, false, conflictVar, {}, &(c.activeVariable));
+
+				conflictVar.clear();
+				conflictVar.push_back(c.target);
+				int operand1 = loadOperand(c.operand1, c.isImmediate1, conflictVar,
+					{ target }, &(c.activeVariable));
+
+				out << "rem " << name[target] << "," << name[operand1] << "," << c.operand2;
+				out << "#" << c << endl;
+				specialVarwriteback(c.target, false);
+				break;
+			}
+			vector<int>conflictVar;
+			if (!c.isImmediate1) { conflictVar.push_back(c.operand1); }
+			if (!c.isImmediate2) { conflictVar.push_back(c.operand2); }
+			int target = loadOperand(c.target, false, conflictVar, {}, &(c.activeVariable));
+
+			conflictVar.clear();
+			conflictVar.push_back(c.target);
+			if (!c.isImmediate2) { conflictVar.push_back(c.operand2); }
+			int operand1 = loadOperand(c.operand1, c.isImmediate1, conflictVar,
+				{ target }, &(c.activeVariable));
+
+			conflictVar.clear();
+			conflictVar.push_back(c.target);
+			if (!c.isImmediate1) { conflictVar.push_back(c.operand1); }
+			int operand2 = loadOperand(c.operand2, c.isImmediate2, conflictVar,
+				{ target,operand1 }, &(c.activeVariable));
+
+			out << "div " << name[operand1] << "," << name[operand2]<<endl;
+			out << "mfhi " << name[target]<<endl;
+			out << "#" << c << endl;
+			specialVarwriteback(c.target, false);
+			break;
+		}
 		case MIDNEGATE:
 		{
 			vector<int>conflictVar;
diff --git a/PeepHoleOptimization.cpp b/PeepHoleOptimization.cpp
@@ -0,0 +1,55 @@
+#include"PeepHoleOptimization.h"
+vector<MidCode> PeepHoleOptimization::peepHoleOptimization(vector<MidCode>& v) {
+	vector<MidCode>res;
+	/*���ȡ��������Ż�*/
+	for (int i = 0; i < v.size(); i++) {
+		if (i > (int)(v.size()) - 3) {
+			res.push_back(v[i]);
+			continue;
+		}
+		if (v[i].op == MIDDIV && v[i + 1].op == MIDMULT && v[i+2].op == MIDSUB) {
+			int a0 = v[i].operand1;
+			bool a1 = v[i].isImmediate1;
+			int b0 = v[i].operand2;
+			bool b1 = v[i].isImmediate2;
+			int c0 = v[i].target;
+			bool c1 = false;
+			if (!(v[i + 1].operand1 == c0 && v[i + 1].isImmediate1 == c1)) {
+				res.push_back(v[i]);
+				continue;
+			}
+			if (!(v[i + 1].operand2 == b0 && v[i + 1].isImmediate2 == b1)) {
+				res.push_back(v[i]);
+				continue;
+			}
+			int d0 = v[i+1].target;
+			bool d1 = false;
+			if (!(v[i + 2].operand1 == a0 && v[i + 2].isImmediate1 == a1)) {
+				res.push_back(v[i]);
+				continue;
+			}
+			if (!(v[i + 2].operand2 == d0 && v[i + 2].isImmediate2 == d1)) {
+				res.push_back(v[i]);
+				continue;
+			}
+			/*��Ϊ�����ȡ����c d�ĸ�ֵ�����Ա��뱣֤�Ժ�cd��������ʹ��*/
+			if (!c1 && v[i + 2].activeVariable.find(c0) != v[i + 2].activeVariable.end()) {
+				res.push_back(v[i]);
+				continue;
+			}
+			if (!d1 && v[i + 2].activeVariable.find(d0) != v[i + 2].activeVariable.end()) {
+				res.push_back(v[i]);
+				continue;
+			}
+			MidCode tmp = MidCode::generateMidCode(MIDREM, v[i + 2].target,
+				a0, a1, b0, b1, v[i].labelNo);
+			i += 2;
+			res.push_back(tmp);
+		}
+		else {
+			res.push_back(v[i]);
+			continue;
+		}
+	}
+	return res;
+}
diff --git a/PeepHoleOptimization.h b/PeepHoleOptimization.h
@@ -0,0 +1,6 @@
+#pragma once
+#include"MidCode.h"
+class PeepHoleOptimization {
+public:
+	vector<MidCode>peepHoleOptimization(vector<MidCode>& v);
+};
diff --git a/debug.txt b/debug.txt
diff --git a/main.cpp b/main.cpp
diff --git a/mips.txt b/mips.txt

Original file line number	Diff line number	Diff line change
`@@ -56,6 +56,7 @@ vector<MidCode>BlockOptimization::propagationInBlock(vector<MidCode>& v) {`
`56`	`56`	`case MIDGEQ:`
`57`	`57`	`case MIDEQL:`
`58`	`58`	`case MIDNEQ:`
	`59`	`+ case MIDREM:`
`59`	`60`	`{`
`60`	`61`	`MidCode tmp = c;`
`61`	`62`	`//如果两个立即数都是常量的话`