-
Notifications
You must be signed in to change notification settings - Fork 252
/
ConstDivisionImplementedByMultiplication.cs
212 lines (196 loc) · 6.65 KB
/
ConstDivisionImplementedByMultiplication.cs
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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
#region License
/*
* Copyright (C) 1999-2017 John Källén.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; see the file COPYING. If not, write to
* the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#endregion
using System;
using Reko.Core.Expressions;
using Reko.Core.Operators;
using Reko.Core.Code;
using Reko.Core;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
namespace Reko.Analysis
{
/// <summary>
/// Undoes the transformation compilers sometimes do on integer constant
/// divisions.
/// </summary>
/// <remarks>
/// Compilers may transform a division
/// <code>
/// a = b / c
/// </code>
/// where c is a (small) integer constant into the corresponding
/// <code>
/// hi:lo = b * d
/// a = hi
/// a = a >> sh
/// </code>
/// for speed. This transformation undoes such transformations into
/// multiplications by a rational.
/// </remarks>
public class ConstDivisionImplementedByMultiplication
{
private Identifier idDst;
private Expression dividend;
private SsaState ssa;
private Rational bestRational;
private Identifier idOrig;
private ExpressionEmitter m;
public ConstDivisionImplementedByMultiplication(SsaState ssa)
{
this.ssa = ssa;
this.m = new ExpressionEmitter();
}
public void Transform()
{
foreach (var stm in ssa.Procedure.Statements)
{
if (Match(stm.Instruction))
{
stm.Instruction = TransformInstruction();
}
}
}
/// <summary>
/// Find the best rational that approximates the fraction
/// </summary>
/// <param name="factor">Divisor <1 1 scaled by 2^32.</param>
/// <returns></returns>
public static Rational FindBestRational(uint factor)
{
return Rational.FromDouble(factor * Math.Pow(2.0, -32));
}
/// <summary>
/// Determine whether <paramref name="instr"/> is a match for
/// the pattern that is a constant division
/// </summary>
/// <remarks>
/// The pattern is:
/// <code>
/// hi:lo = r * const
/// hi = slice(hi:lo) (alias)
/// hi = hi >> shift (optional)
/// </code>
/// This transformation must be carried out before value propagation
/// pushes the shift inside other operations.
/// </remarks>
/// <param name="instr"></param>
/// <returns></returns>
public bool Match(Instruction instr)
{
Assignment ass;
SequenceStorage dst;
BinaryExpression bin;
Constant cRight;
// Look for hi:lo = a * C
if (!instr.As(out ass) ||
!ass.Dst.Storage.As(out dst) ||
!ass.Src.As(out bin) ||
!(bin.Operator is IMulOperator) ||
!bin.Right.As(out cRight) ||
ass.Dst.DataType.Size <= bin.Left.DataType.Size)
{
return false;
}
this.idOrig = ass.Dst;
this.idDst = FindAlias(ass.Dst, dst.Head);
if (idDst == null)
return false;
var best = FindBestRational(cRight.ToUInt32());
// There may be a subsequent SAR / SHR to increase
// the divisor.
var idSlice = idDst;
Constant rShift = null;
if (idSlice != null)
{
rShift = FindShiftUse(idSlice);
if (rShift != null)
{
best = best / (1 << rShift.ToInt32());
}
}
this.bestRational = best;
this.dividend = bin.Left;
return true;
}
private Identifier FindAlias(Identifier id, Storage idHead)
{
return (ssa.Identifiers[id].Uses
.Select(u => u.Instruction)
.OfType<AliasAssignment>()
.Where(a => a.Dst.Storage == idHead)
.Select(a => a.Dst)
.FirstOrDefault());
}
private Constant FindShiftUse(Identifier idSlice)
{
return ssa.Identifiers[idSlice]
.Uses.Select(u => u.Instruction)
.OfType<Assignment>()
.Select(a =>
{
var b = a.Src as BinaryExpression;
if (b == null ||
b.Left != idSlice ||
(b.Operator != Operator.Sar &&
b.Operator != Operator.Shr))
return null;
return b.Right as Constant;
})
.Where(x => x != null)
.FirstOrDefault();
}
private Identifier FindSliceUse(Identifier id)
{
return ssa.Identifiers[id]
.Uses.Select(u => u.Instruction)
.OfType<Assignment>()
.Select(a =>
{
var s = a.Src as Slice;
if (s == null || s.Expression != id)
return null;
else
return a.Dst;
})
.Where(x => x != null)
.FirstOrDefault();
}
public Assignment TransformInstruction()
{
var eNum = dividend;
if (bestRational.Numerator != 1)
{
eNum = m.IMul(
eNum,
Constant.Int32((int)bestRational.Numerator));
}
var sidOrig = ssa.Identifiers[idOrig];
var sidDst = ssa.Identifiers[idDst];
sidOrig.Uses.Remove(sidDst.DefStatement);
sidDst.DefStatement.Instruction = new Assignment(
idDst,
m.SDiv(
eNum,
Constant.Int32((int)bestRational.Denominator)));
return sidDst.DefStatement.Instruction as Assignment;
}
}
}