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
|
(* M2Code.mod coordinate the activity of the front end.
Copyright (C) 2001-2024 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 M2Code ;
FROM SYSTEM IMPORT WORD ;
FROM M2Options IMPORT Statistics, OptimizeUncalledProcedures,
OptimizeCommonSubExpressions,
StyleChecking, Optimizing, WholeProgram,
GetDumpDecl, GetDumpGimple ;
FROM M2LangDump IMPORT CreateDumpDecl, CloseDumpDecl, MakeGimpleTemplate ;
FROM M2Error IMPORT InternalError ;
FROM M2Students IMPORT StudentVariableCheck ;
FROM SymbolTable IMPORT GetMainModule, IsProcedure,
IsModuleWithinProcedure,
CheckHiddenTypeAreAddress, IsModule, IsDefImp,
DebugLineNumbers,
ForeachProcedureDo,
ForeachInnerModuleDo, GetSymName ;
FROM M2Printf IMPORT printf2, printf1, printf0 ;
FROM NameKey IMPORT Name ;
FROM M2Batch IMPORT ForeachSourceModuleDo ;
FROM M2Quads IMPORT CountQuads, GetFirstQuad,
DumpQuadruples, DisplayQuadRange,
BackPatchSubrangesAndOptParam,
LoopAnalysis, ForLoopAnalysis, GetQuad, QuadOperator ;
FROM M2SymInit IMPORT ScopeBlockVariableAnalysis ;
FROM M2Pass IMPORT SetPassToNoPass, SetPassToCodeGeneration ;
FROM M2BasicBlock IMPORT BasicBlock,
InitBasicBlocks, InitBasicBlocksFromRange,
KillBasicBlocks, FreeBasicBlocks,
ForeachBasicBlockDo ;
FROM M2Optimize IMPORT FoldBranches, RemoveProcedures ;
FROM M2GenGCC IMPORT ConvertQuadsToTree ;
FROM M2GCCDeclare IMPORT FoldConstants, StartDeclareScope,
DeclareProcedure, InitDeclarations,
DeclareModuleVariables, MarkExported,
DumpFilteredResolver, DumpFilteredDefinitive ;
FROM M2Scope IMPORT ScopeBlock, InitScopeBlock, KillScopeBlock,
ForeachScopeBlockDo2, ForeachScopeBlockDo3 ;
FROM m2top IMPORT StartGlobalContext, EndGlobalContext, SetFlagUnitAtATime ;
FROM M2Error IMPORT FlushErrors, FlushWarnings ;
FROM M2Swig IMPORT GenerateSwigFile ;
FROM m2flex IMPORT GetTotalLines ;
FROM FIO IMPORT FlushBuffer, StdOut ;
FROM M2Quiet IMPORT qprintf0 ;
FROM M2SSA IMPORT DiscoverSSA ;
FROM m2pp IMPORT CreateDumpGimple, CloseDumpGimple ;
FROM DynamicStrings IMPORT String, KillString ;
CONST
MaxOptimTimes = 10 ; (* upper limit of no of times we run through all optimization *)
Debugging = TRUE ;
TraceQuadruples = FALSE ;
VAR
Total,
Count,
OptimTimes,
DeltaProc,
Proc,
DeltaConst,
Const,
DeltaJump,
Jump,
DeltaBasicB,
BasicB : CARDINAL ;
(*
Percent - calculates the percentage from numerator and divisor
*)
PROCEDURE Percent (numerator, divisor: CARDINAL) ;
VAR
value: CARDINAL ;
BEGIN
printf0 (' (') ;
IF divisor=0
THEN
printf0 ('overflow error')
ELSE
value := numerator*100 DIV divisor ;
printf1 ('%3d', value)
END ;
printf0 ('\%)')
END Percent ;
(*
OptimizationAnalysis - displays some simple front end optimization statistics.
*)
PROCEDURE OptimizationAnalysis ;
VAR
value: CARDINAL ;
BEGIN
IF Statistics
THEN
Count := CountQuads() ;
printf1 ('M2 initial number of quadruples: %6d', Total) ;
Percent (Total, Total) ; printf0 ('\n');
printf1 ('M2 constant folding achieved : %6d', Const) ;
Percent (Const, Total) ; printf0 ('\n');
printf1 ('M2 branch folding achieved : %6d', Jump) ;
Percent (Jump, Total) ; printf0 ('\n');
value := Const+Jump+Proc ;
printf1 ('Front end optimization removed : %6d', value) ;
Percent (value, Total) ; printf0 ('\n') ;
printf1 ('Front end final : %6d', Count) ;
Percent (Count, Total) ; printf0 ('\n') ;
Count := GetTotalLines () ;
printf1 ('Total source lines compiled : %6d\n', Count) ;
FlushBuffer (StdOut)
END ;
DumpQuadruples ('after all front end optimization\n')
END OptimizationAnalysis ;
(*
RemoveUnreachableCode -
*)
PROCEDURE RemoveUnreachableCode ;
BEGIN
IF WholeProgram
THEN
ForeachSourceModuleDo(RemoveProcedures)
ELSE
RemoveProcedures(GetMainModule())
END
END RemoveUnreachableCode ;
(*
DoModuleDeclare - declare all constants, types, variables, procedures for the
main module or all modules.
*)
PROCEDURE DoModuleDeclare ;
BEGIN
IF GetDumpDecl ()
THEN
CreateDumpDecl ("symbol resolver of filtered symbols\n") ;
DumpFilteredResolver
END ;
IF WholeProgram
THEN
ForeachSourceModuleDo (StartDeclareScope)
ELSE
StartDeclareScope (GetMainModule ())
END ;
IF GetDumpDecl ()
THEN
CloseDumpDecl ;
CreateDumpDecl ("definitive declaration of filtered symbols\n") ;
DumpFilteredDefinitive ;
CloseDumpDecl
END
END DoModuleDeclare ;
(*
PrintModule -
*)
(*
PROCEDURE PrintModule (sym: CARDINAL) ;
VAR
n: Name ;
BEGIN
n := GetSymName (sym) ;
printf1 ('module %a\n', n)
END PrintModule ;
*)
(*
DoCodeBlock - generate code for the main module or all modules.
*)
PROCEDURE DoCodeBlock ;
VAR
filename: String ;
len : CARDINAL ;
BEGIN
IF GetDumpGimple ()
THEN
filename := MakeGimpleTemplate (len) ;
CreateDumpGimple (filename, len) ;
filename := KillString (filename) ;
CodeBlock (GetMainModule ()) ;
CloseDumpGimple
ELSE
CodeBlock (GetMainModule ())
END
END DoCodeBlock ;
(*
DetermineSubExpTemporaries -
*)
PROCEDURE DetermineSubExpTemporaries ;
BEGIN
IF WholeProgram
THEN
ForeachSourceModuleDo (DiscoverSSA)
ELSE
DiscoverSSA (GetMainModule ())
END
END DetermineSubExpTemporaries ;
(*
Code - calls procedures to generates trees from the quadruples.
All front end quadruple optimization is performed via this call.
*)
PROCEDURE Code ;
BEGIN
DumpQuadruples ('before any optimization\n') ;
CheckHiddenTypeAreAddress ;
SetPassToNoPass ;
BackPatchSubrangesAndOptParam ;
Total := CountQuads () ;
ForLoopAnalysis ; (* must be done before any optimization as the index variable increment quad might change *)
DumpQuadruples ('before declaring symbols to gcc\n') ;
(* now is a suitable time to check for student errors as *)
(* we know all the front end symbols must be resolved. *)
IF StyleChecking
THEN
StudentVariableCheck
END ;
SetPassToCodeGeneration ;
SetFlagUnitAtATime (Optimizing) ;
StartGlobalContext ;
InitDeclarations ; (* default and fixed sized types are all declared from now on. *)
RemoveUnreachableCode ;
DumpQuadruples ('after dead procedure elimination\n') ;
DetermineSubExpTemporaries ;
DumpQuadruples ('after identifying simple subexpression temporaries\n') ;
qprintf0 (' symbols to gcc trees\n') ;
DoModuleDeclare ;
FlushWarnings ;
FlushErrors ;
qprintf0 (' statements to gcc trees\n') ;
DoCodeBlock ;
MarkExported (GetMainModule ()) ;
GenerateSwigFile (GetMainModule ()) ;
DebugLineNumbers (GetMainModule ()) ;
qprintf0 (' gcc trees given to the gcc backend\n') ;
EndGlobalContext ;
OptimizationAnalysis
END Code ;
(*
InitialDeclareAndCodeBlock - declares all objects within scope,
*)
PROCEDURE InitialDeclareAndOptimize (scope: CARDINAL; start, end: CARDINAL) ;
BEGIN
Count := CountQuads () ;
FreeBasicBlocks (InitBasicBlocksFromRange (scope, start, end)) ;
BasicB := Count - CountQuads () ;
Count := CountQuads () ;
FoldBranches (start, end) ;
Jump := Count - CountQuads () ;
Count := CountQuads ()
END InitialDeclareAndOptimize ;
(*
DeclareAndCodeBlock - declares all objects within scope,
*)
PROCEDURE SecondDeclareAndOptimize (scope: CARDINAL;
start, end: CARDINAL) ;
VAR
bb: BasicBlock ;
BEGIN
REPEAT
bb := InitBasicBlocksFromRange (scope, start, end) ;
ForeachBasicBlockDo (bb, FoldConstants) ;
FreeBasicBlocks (bb) ;
DeltaConst := Count - CountQuads () ;
Count := CountQuads () ;
FreeBasicBlocks(InitBasicBlocksFromRange (scope, start, end)) ;
DeltaBasicB := Count - CountQuads () ;
Count := CountQuads () ;
FreeBasicBlocks (InitBasicBlocksFromRange (scope, start, end)) ;
FoldBranches(start, end) ;
DeltaJump := Count - CountQuads () ;
Count := CountQuads () ;
FreeBasicBlocks(InitBasicBlocksFromRange (scope, start, end)) ;
INC (DeltaBasicB, Count - CountQuads ()) ;
Count := CountQuads () ;
(* now total the optimization components *)
INC (Proc, DeltaProc) ;
INC (Const, DeltaConst) ;
INC (Jump, DeltaJump) ;
INC (BasicB, DeltaBasicB)
UNTIL (OptimTimes>=MaxOptimTimes) OR
((DeltaProc=0) AND (DeltaConst=0) AND (DeltaJump=0) AND (DeltaBasicB=0)) ;
IF (DeltaProc#0) OR (DeltaConst#0) OR (DeltaJump#0) OR (DeltaBasicB#0)
THEN
printf0 ('optimization finished although more reduction may be possible (increase MaxOptimTimes)\n')
END
END SecondDeclareAndOptimize ;
(*
InitOptimizeVariables -
*)
PROCEDURE InitOptimizeVariables ;
BEGIN
Count := CountQuads () ;
OptimTimes := 0 ;
DeltaProc := 0 ;
DeltaConst := 0 ;
DeltaJump := 0 ;
DeltaBasicB := 0
END InitOptimizeVariables ;
(*
Init -
*)
PROCEDURE Init ;
BEGIN
Proc := 0 ;
Const := 0 ;
Jump := 0 ;
BasicB := 0
END Init ;
(*
OptimizeScopeBlock -
*)
PROCEDURE OptimizeScopeBlock (sb: ScopeBlock) ;
VAR
OptimTimes,
Previous,
Current : CARDINAL ;
BEGIN
InitOptimizeVariables ;
OptimTimes := 1 ;
Current := CountQuads () ;
ForeachScopeBlockDo3 (sb, InitialDeclareAndOptimize) ;
ForeachScopeBlockDo3 (sb, ScopeBlockVariableAnalysis) ;
REPEAT
ForeachScopeBlockDo3 (sb, SecondDeclareAndOptimize) ;
Previous := Current ;
Current := CountQuads () ;
INC (OptimTimes)
UNTIL (OptimTimes=MaxOptimTimes) OR (Current=Previous) ;
ForeachScopeBlockDo3 (sb, LoopAnalysis)
END OptimizeScopeBlock ;
(*
CodeProceduresWithinBlock - codes the procedures within the module scope.
*)
PROCEDURE CodeProceduresWithinBlock (scope: CARDINAL) ;
BEGIN
ForeachProcedureDo (scope, CodeBlock)
END CodeProceduresWithinBlock ;
(*
CodeProcedures -
*)
PROCEDURE CodeProcedures (scope: CARDINAL) ;
BEGIN
IF IsDefImp (scope) OR IsModule (scope)
THEN
ForeachProcedureDo (scope, CodeBlock)
END
END CodeProcedures ;
(*
CodeBlock - generates all code for this block and also declares
all types and procedures for this block. It will
also optimize quadruples within this scope.
*)
PROCEDURE CodeBlock (scope: WORD) ;
VAR
sb: ScopeBlock ;
n : Name ;
BEGIN
IF TraceQuadruples
THEN
n := GetSymName (scope) ;
printf1 ('before coding block %a\n', n)
END ;
sb := InitScopeBlock (scope) ;
OptimizeScopeBlock (sb) ;
IF IsProcedure (scope)
THEN
IF TraceQuadruples
THEN
n := GetSymName(scope) ;
printf1('before coding procedure %a\n', n) ;
ForeachScopeBlockDo3 (sb, DisplayQuadRange) ;
printf0('===============\n')
END ;
ForeachScopeBlockDo2 (sb, ConvertQuadsToTree)
ELSIF IsModuleWithinProcedure(scope)
THEN
IF TraceQuadruples
THEN
n := GetSymName(scope) ;
printf1('before coding module %a within procedure\n', n) ;
ForeachScopeBlockDo3 (sb, DisplayQuadRange) ;
printf0('===============\n')
END ;
ForeachScopeBlockDo2 (sb, ConvertQuadsToTree) ;
ForeachProcedureDo(scope, CodeBlock)
ELSE
IF TraceQuadruples
THEN
n := GetSymName(scope) ;
printf1('before coding module %a\n', n) ;
ForeachScopeBlockDo3 (sb, DisplayQuadRange) ;
printf0('===============\n')
END ;
ForeachScopeBlockDo2 (sb, ConvertQuadsToTree) ;
IF WholeProgram
THEN
ForeachSourceModuleDo(CodeProcedures)
ELSE
ForeachProcedureDo(scope, CodeBlock)
END ;
ForeachInnerModuleDo(scope, CodeProceduresWithinBlock)
END ;
KillScopeBlock(sb)
END CodeBlock ;
BEGIN
Init
END M2Code.
|