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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
|
(* M2Optimize.mod removes redundant quadruples.
Copyright (C) 2001-2025 Free Software Foundation, Inc.
Contributed by Gaius Mulley <gaius.mulley@southwales.ac.uk>.
This file is part of GNU Modula-2.
GNU Modula-2 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 3, or (at your option)
any later version.
GNU Modula-2 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 GNU Modula-2; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. *)
IMPLEMENTATION MODULE M2Optimize ;
(*
Title : M2Optimize
Author : Gaius Mulley
System : UNIX (GNU Modula-2)
Date : Sat Aug 14 15:07:47 1999
Description: removes redundant quadruples, redundant GotoOps, redundant procedures.
*)
FROM M2Debug IMPORT Assert ;
FROM NameKey IMPORT Name, WriteKey, MakeKey, GetKey ;
FROM StrIO IMPORT WriteString, WriteLn ;
FROM NumberIO IMPORT WriteCard ;
FROM M2Error IMPORT InternalError ;
FROM M2Batch IMPORT GetModuleNo ;
FROM M2Quiet IMPORT qprintf1 ;
FROM M2Scope IMPORT ScopeBlock, InitScopeBlock, KillScopeBlock,
ForeachScopeBlockDo2, ForeachScopeBlockDo3 ;
FROM SymbolTable IMPORT GetSymName,
GetProcedureQuads, GetModuleQuads,
GetModule, GetNthProcedure,
GetSubrange, GetModuleScope,
PutProcedureReachable, IsProcedureReachable,
PutProcedureStartQuad, PutProcedureEndQuad,
PutProcedureScopeQuad,
PutNeedSavePriority,
IsProcedure, GetPriority,
GetDeclaredMod, GetFirstUsed,
GetType,
IsExportQualified, IsExportUnQualified, IsExported,
ForeachProcedureDo, ForeachInnerModuleDo,
IsModuleWithinProcedure,
NulSym ;
FROM M2Quads IMPORT QuadOperator, GetQuad, GetFirstQuad, GetNextQuad,
PutQuad, SubQuad, Opposite, IsReferenced,
GetRealQuad, GetQuadOtok, PutQuadOtok ;
(*
FoldBranches - folds unneccessary branches in the list of quadruples.
It searches for the following patterns:
[x] GotoOp _ _ y GotoOp _ _ z
... ...
[y] GotoOp _ _ z "deleted"
WHERE ... may contain 0..n Pseudo Quads
OR
[x] IfREL _ _ z If NOT REL _ _ a
... ...
[y] Goto _ _ a "deleted"
... ...
[z]
WHERE ... may contain 0..n Pseudo Quads
but in this case they must not be a
target of any other quad.
*)
PROCEDURE FoldBranches (start, end: CARDINAL) ;
VAR
Folded : BOOLEAN ;
i, j,
Right : CARDINAL ;
Operator : QuadOperator ;
Operand1,
Operand2,
Operand3 : CARDINAL ;
BEGIN
REPEAT
i := start ;
Folded := FALSE ;
WHILE (i<=end) AND (i#0) DO
j := GetNextQuad(i) ;
IF (j>end) OR (j=0)
THEN
RETURN
END ;
Right := GetRealQuad(j) ;
IF Right=0
THEN
RETURN
END ;
GetQuad(i, Operator, Operand1, Operand2, Operand3) ;
CASE Operator OF
GotoOp : Folded := ReduceGoto (i, Operand3,
Right, Folded) |
IfInOp, IfNotInOp,
IfNotEquOp, IfEquOp,
IfLessEquOp, IfGreEquOp,
IfGreOp, IfLessOp : Folded := ReduceBranch (Operator, i,
Operand1, Operand2, Operand3,
Right, Folded)
ELSE
END ;
i := Right
END
UNTIL NOT Folded
END FoldBranches ;
(*
ReduceBranch - searches for the following pattern:
[x] IfREL _ _ z If NOT REL _ _ a
... ...
[y] Goto _ _ a "deleted"
... ...
[z]
WHERE ... may contain 0..n Pseudo Quads
but in this case they must not be a
target of any other quad.
*)
PROCEDURE ReduceBranch (Operator: QuadOperator;
CurrentQuad,
CurrentOperand1, CurrentOperand2,
CurrentOperand3: CARDINAL;
VAR NextQuad: CARDINAL;
Folded: BOOLEAN) : BOOLEAN ;
VAR
constExpr,
overflowChecking: BOOLEAN ;
OpNext : QuadOperator ;
tok,
NextPlusOne,
Op1Next,
Op2Next,
Op3Next,
op1tok,
op2tok,
op3tok,
From, To : CARDINAL ;
BEGIN
(* If op NextQuad+1 *)
(* Goto x *)
IF NextQuad#0
THEN
IF (GetNextQuad (CurrentQuad) = CurrentOperand3) OR
(GetRealQuad (GetNextQuad (CurrentQuad)) = CurrentOperand3)
THEN
SubQuad (CurrentQuad) ;
Folded := TRUE
ELSE
From := GetNextQuad (CurrentQuad) ; (* start after CurrentQuad *)
To := NextQuad ;
CurrentOperand3 := GetRealQuad (CurrentOperand3) ;
NextPlusOne := GetRealQuad (GetNextQuad (NextQuad)) ;
GetQuad (NextQuad, OpNext, Op1Next, Op2Next, Op3Next) ;
IF (OpNext = GotoOp) AND (NextPlusOne = CurrentOperand3) AND
IsBasicBlock (From, To)
THEN
GetQuadOtok (CurrentQuad, tok, Operator,
CurrentOperand1, CurrentOperand2, CurrentOperand3,
overflowChecking, constExpr, op1tok, op2tok, op3tok) ;
SubQuad (NextQuad) ;
PutQuadOtok (CurrentQuad, tok, Opposite (Operator),
CurrentOperand1, CurrentOperand2, Op3Next,
overflowChecking, constExpr,
op1tok, op2tok, op3tok) ;
NextQuad := NextPlusOne ;
Folded := TRUE
END
END ;
IF FoldMultipleGoto (CurrentQuad)
THEN
Folded := TRUE
END
END ;
RETURN Folded
END ReduceBranch ;
(*
IsBasicBlock - returns TRUE if no other quadruple jumps inbetween
the range From..To.
It assumes that there are no jumps in the quadruples
From..To.
*)
PROCEDURE IsBasicBlock (From, To: CARDINAL) : BOOLEAN ;
BEGIN
WHILE From # To DO
IF IsReferenced (From)
THEN
RETURN FALSE
ELSE
IF From > To
THEN
InternalError ('assert failed From should never be larger than To')
END ;
From := GetNextQuad (From)
END
END ;
RETURN TRUE
END IsBasicBlock ;
(*
ReduceGoto - searches for the following patterns:
[x] GotoOp _ _ y GotoOp _ _ z
... ...
[y] GotoOp _ _ z "deleted"
*)
PROCEDURE ReduceGoto (CurrentQuad, CurrentOperand3, NextQuad: CARDINAL;
Folded: BOOLEAN) : BOOLEAN ;
BEGIN
CurrentOperand3 := GetRealQuad (CurrentOperand3) ;
(* IF next quad is a GotoOp *)
IF CurrentOperand3 = NextQuad
THEN
SubQuad (CurrentQuad) ;
Folded := TRUE
ELSE
(* Does Goto point to another Goto ? *)
IF FoldMultipleGoto (CurrentQuad)
THEN
Folded := TRUE
END
END ;
RETURN Folded
END ReduceGoto ;
(*
FoldMultipleGoto - takes a QuadNo and if it jumps to another GotoOp
then it takes the later target as a replacement
for its own.
NOTE it does not remove any quadruples.
*)
PROCEDURE FoldMultipleGoto (QuadNo: CARDINAL) : BOOLEAN ;
VAR
Operator,
Op : QuadOperator ;
Op1, Op2,
Op3,
Operand1,
Operand2,
Operand3: CARDINAL ;
BEGIN
GetQuad (QuadNo, Operator, Operand1, Operand2, Operand3) ;
Operand3 := GetRealQuad (Operand3) ; (* skip pseudo quadruples *)
GetQuad (Operand3, Op, Op1, Op2, Op3) ;
IF Op = GotoOp
THEN
PutQuad (QuadNo, Operator, Operand1, Operand2, Op3) ;
(* Dont want success to be returned if in fact the Goto *)
(* line number has not changed... otherwise we loop *)
(* forever. *)
RETURN Op3 # Operand3
ELSE
RETURN FALSE
END
END FoldMultipleGoto ;
(*
CheckNeedSavePriority -
*)
PROCEDURE CheckNeedSavePriority (sym: CARDINAL) ;
BEGIN
IF IsProcedure(sym) AND (GetPriority(GetModuleScope(sym))#NulSym)
THEN
PutNeedSavePriority(sym)
END
END CheckNeedSavePriority ;
(*
CheckExportedReachable - checks to see whether procedure, sym, was
exported and if so it calls RemoveProcedures.
*)
PROCEDURE CheckExportedReachable (sym: CARDINAL) ;
BEGIN
IF IsExported(GetModuleScope(sym), sym)
THEN
RemoveProcedures(sym) ;
CheckNeedSavePriority(sym)
END
END CheckExportedReachable ;
(*
RemoveProcedures - removes any procedures that are never referenced
by the quadruples.
*)
PROCEDURE RemoveProcedures (scope: CARDINAL) ;
VAR
sb: ScopeBlock ;
BEGIN
sb := InitScopeBlock(scope) ;
IF IsProcedure(scope)
THEN
PutProcedureReachable(scope) ;
ForeachScopeBlockDo2 (sb, KnownReachable)
ELSIF IsModuleWithinProcedure(scope)
THEN
ForeachScopeBlockDo2 (sb, KnownReachable) ;
ForeachProcedureDo(scope, CheckExportedReachable)
ELSE
ForeachScopeBlockDo2 (sb, KnownReachable) ;
ForeachProcedureDo(scope, CheckExportedReachable)
END ;
ForeachInnerModuleDo(scope, RemoveProcedures) ;
KillScopeBlock(sb) ;
(* DeleteUnReachableProcedures *)
END RemoveProcedures ;
PROCEDURE KnownReachable (Start, End: CARDINAL) ;
VAR
Op : QuadOperator ;
Op1, Op2, Op3: CARDINAL ;
BEGIN
IF Start#0
THEN
REPEAT
GetQuad (Start, Op, Op1, Op2, Op3) ;
CASE Op OF
CallOp : KnownReach (Op3) |
AddrOp,
ParamOp,
XIndrOp,
BecomesOp: KnownReach (Op3) ;
CheckNeedSavePriority (Op3)
ELSE
END ;
Start := GetNextQuad (Start)
UNTIL (Start > End) OR (Start = 0)
END
END KnownReachable ;
PROCEDURE KnownReach (sym: CARDINAL) ;
BEGIN
IF IsProcedure (sym) AND (NOT IsProcedureReachable (sym))
THEN
RemoveProcedures (sym)
END
END KnownReach ;
(*
DeleteUnReachableProcedures - Deletes all procedures that are unreachable.
*)
(*
PROCEDURE DeleteUnReachableProcedures ;
VAR
ProcName: Name ;
n, m,
Scope,
Start,
End,
Module,
Proc : CARDINAL ;
BEGIN
m := 1 ;
REPEAT
Module := GetModuleNo(m) ;
IF Module#NulSym
THEN
n := 1 ;
Proc := GetNthProcedure(Module, n) ;
WHILE Proc#NulSym DO
IF IsProcedureReachable(Proc) OR
IsExportQualified(Proc) OR IsExportUnQualified(Proc)
THEN
(* is reachable - do not delete it *)
ELSE
ProcName := GetSymName(Proc) ;
qprintf1('[%a]\n', ProcName) ;
GetProcedureQuads(Proc, Scope, Start, End) ;
IF Start#0
THEN
Delete(Scope, End) ;
(* No Longer any Quads for this Procedure *)
PutProcedureScopeQuad(Proc, 0) ;
PutProcedureStartQuad(Proc, 0) ;
PutProcedureEndQuad(Proc, 0)
END
END ;
INC(n) ;
Proc := GetNthProcedure(Module, n)
END ;
INC(m)
END
UNTIL Module=NulSym
END DeleteUnReachableProcedures ;
(*
Delete - deletes all quadruples from Start..End
or the end of the procedure.
*)
PROCEDURE Delete (Start, End: CARDINAL) ;
VAR
Last,
i : CARDINAL ;
Op : QuadOperator ;
Op1,
Op2,
Op3 : CARDINAL ;
BEGIN
Last := GetNextQuad(End) ;
WHILE (GetFirstQuad()#0) AND (Start#0) AND (Last#Start) DO
GetQuad(Start, Op, Op1, Op2, Op3) ;
IF Op=DummyOp
THEN
(* Start has already been deleted - try next quad *)
INC(Start)
ELSIF Op=ReturnOp
THEN
(* Found end of procedure therefore just delete and exit *)
(* WriteString('Deleting') ; WriteCard(Start, 6) ; WriteLn ; *)
SubQuad(Start) ;
Start := Last
ELSE
(* Following the list of quadruples to the End *)
i := GetNextQuad(Start) ;
(* WriteString('Deleting') ; WriteCard(Start, 6) ; WriteLn ; *)
SubQuad(Start) ;
Start := i
END
END
END Delete ;
*)
(*
DisplayReachable - Displays the data structures surrounding Reachablity.
*)
PROCEDURE DisplayReachable ;
VAR
n, m,
Scope,
StartInit,
EndInit,
StartFinish,
EndFinish,
Module,
Proc : CARDINAL ;
BEGIN
m := 1 ;
REPEAT
Module := GetModuleNo(m) ;
IF Module#NulSym
THEN
WriteString('Module') ; WriteCard(m, 3) ; WriteKey(GetSymName(Module)) ;
GetModuleQuads(Module, StartInit, EndInit, StartFinish, EndFinish) ;
WriteString(' Reachable initialization') ;
WriteCard(StartInit, 6) ; WriteCard(EndInit, 6) ; WriteLn ;
WriteString('Module') ; WriteCard(m, 3) ; WriteKey(GetSymName(Module)) ;
GetModuleQuads(Module, StartInit, EndInit, StartFinish, EndFinish) ;
WriteString(' Reachable finalization') ;
WriteCard(StartFinish, 6) ; WriteCard(EndFinish, 6) ; WriteLn ;
n := 1 ;
Proc := GetNthProcedure(Module, n) ;
WHILE Proc#NulSym DO
WriteString('Procedure ') ; WriteKey(GetSymName(Proc)) ;
GetProcedureQuads(Proc, Scope, StartInit, EndInit) ;
WriteString(' Quads: ') ; WriteCard(StartInit, 6) ; WriteCard(EndInit, 6) ;
IF NOT IsProcedureReachable(Proc)
THEN
WriteString(' UN reachable')
ELSE
WriteString(' IS reachable')
END ;
WriteLn ;
INC(n) ;
Proc := GetNthProcedure(Module, n)
END ;
INC(m)
END
UNTIL Module=NulSym
END DisplayReachable ;
END M2Optimize.
|