Repository navigation
Expand file tree
/
Copy pathhipe_schedule.erl
More file actions
1489 lines (1365 loc) · 60.2 KB
/
Copy pathhipe_schedule.erl
File metadata and controls
1489 lines (1365 loc) · 60.2 KB
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
2
8000
95
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
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2001-2011. All Rights Reserved.
%%
%% The contents of this file are subject to the Erlang Public License,
%% Version 1.1, (the "License"); you may not use this file except in
%% compliance with the License. You should have received a copy of the
%% Erlang Public License along with this software. If not, it can be
%% retrieved online at http://www.erlang.org/.
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and limitations
%% under the License.
%%
%% %CopyrightEnd%
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% INSTRUCTION SCHEDULER
%%
%% This is a basic ILP cycle scheduler:
%% * set cycle = 0
%% * while ready[cycle] nonempty do
%% - take x with greatest priority from ready[cycle]
%% - try to schedule x;
%% * if scheduling x was possible,
%% - reserve resources
%% - add x to schedule and delete x from dag
%% - update earliest-time for all successor nodes
%% as max[earliest[y],cycle+latency[x]]
%% - if some node y now has no predecessors,
%% add y to ready[earliest[y]]
%% * if it was impossible, put x in ready[cycle+1]
%% (= try again)
%%
%% We use the following data structures:
%% 1. all nodes are numbered and indices used as array keys
%% 2. priority per node can be computed statically or dynamically
%% * statically: before scheduling, each node gets a priority value
%% * dynamically: at each cycle, compute priorities for all ready nodes
%% 3. earliest: earliest cycle of issue, starts at 0
%% and is updated as predecessors issue
%% 4. predecessors: number of predecessors (0 = ready to issue)
%% 5. successors: list of {Latency,NodeID}
%% 6. ready: an array indexed by cycle-time (integer), where
%% ready nodes are kept.
%% 7. resources: a resource representation (ADT) that answers
%% certain queries, e.g., "can x be scheduled this cycle"
%% and "reserve resources for x".
%% 8. schedule: list of scheduled instructions {Instr,Cycle}
%% in the order of issue
%% 9. instructions: maps IDs back to instructions
%%
%% Inputs:
%% - a list of {ID,Node} pairs (where ID is a unique key)
%% - a dependence list {ID0,Latency,ID1}, which is used to
%% build the DAG.
%%
%% Note that there is some leeway in how things are represented
%% from here.
%%
%% MODIFICATIONS:
%% - Some basic blocks are not worth scheduling (e.g., GC save/restore code)
%% yet are pretty voluminous. How do we skip them?
%% - Scheduling should be done at finalization time: when basic block is
%% linearized and is definitely at Sparc assembly level, THEN reorder
%% stuff.
-module(hipe_schedule).
-export([cfg/1, est_cfg/1, delete_node/5]).
-include("../sparc/hipe_sparc.hrl").
%%-define(debug1,true).
-define(debug2(Str,Args),ok).
%%-define(debug2(Str,Args),io:format(Str,Args)).
-define(debug3(Str,Args),ok).
%%-define(debug3(Str,Args),io:format(Str,Args)).
-define(debug4(Str,Args),ok).
%%-define(debug4(Str,Args),io:format(Str,Args)).
-define(debug5(Str,Args),ok).
%%-define(debug5(Str,Args),io:format(Str,Args)).
-define(debug(Str,Args),ok).
%%-define(debug(Str,Args),io:format(Str,Args)).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : cfg
%% Argument : CFG - the control flow graph
%% Returns : CFG - A new cfg with scheduled blocks
%% Description : Takes each basic block and schedules them one by one.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
cfg(CFG) ->
?debug3("CFG: ~n~p", [CFG]),
update_all( [ {L,
hipe_bb:mk_bb(
block(L,hipe_bb:code(hipe_sparc_cfg:bb(CFG,L))) )}
|| L <- hipe_sparc_cfg:labels(CFG) ], CFG).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : update_all
%% Argument : Blocks - [{Label, Block}] , a list with labels and new code
%% used for updating the old CFG.
%% CFG - The old controlflow graph
%% Returns : An updated controlflow graph.
%% Description : Just swappes the basic blocks in the CFG to the scheduled one.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
update_all([],CFG) -> CFG;
update_all([{L,NewB}|Ls],CFG) ->
update_all(Ls,hipe_sparc_cfg:bb_add(CFG,L,NewB)).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
est_cfg(CFG) ->
update_all([ {L, hipe_bb:mk_bb(est_block(hipe_bb:code(hipe_sparc_cfg:bb(CFG,L))))}
|| L <- hipe_sparc_cfg:labels(CFG) ], CFG).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% Provides an estimation of how quickly a block will execute.
%% This is done by chaining all instructions in sequential order
%% by 0-cycle dependences (which means they will never be reordered),
%% then scheduling the mess.
est_block([]) -> [];
est_block([I]) -> [I];
est_block(Blk) ->
{IxBlk,DAG} = est_deps(Blk),
Sch = bb(IxBlk,DAG),
separate_block(Sch,IxBlk).
est_deps(Blk) ->
IxBlk = indexed_bb(Blk),
DAG = deps(IxBlk),
{IxBlk, chain_instrs(IxBlk,DAG)}.
chain_instrs([{N,_}|Xs],DAG) ->
chain_i(N,Xs,DAG).
chain_i(_,[],DAG) -> DAG;
chain_i(N,[{M,_}|Xs],DAG) ->
NewDAG = dep_arc(N,zero_latency(),M,DAG),
chain_i(M,Xs,NewDAG).
zero_latency() -> 0.
lookup_instr([{N,I}|_], N) -> I;
lookup_instr([_|Xs], N) -> lookup_instr(Xs, N).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : block
%% Argument : Instrs - [Instr], list of all the instructions in a basic
%% block.
%% Returns : A new scheduled block
%% Description : Schedule a basic block
%%
%% Note: does not consider delay slots!
%% (another argument for using only annulled delay slots?)
%% * how do we add delay slots? somewhat tricky to
%% reconcile with the sort of scheduling we consider.
%% (as-early-as-possible)
%% => rewrite scheduler into as-late-as-possible?
%% (=> just reverse the dependence arcs??)
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Don't fire up the scheduler if there's no work to do.
block(_, []) ->
[];
block(_L, [I]) ->
case hipe_sparc:is_any_branch(I) of
true -> [hipe_sparc:nop_create(), I];
false -> [I]
end;
block(_L, Blk) ->
IxBlk = indexed_bb(Blk),
case IxBlk of
[{_N, I}] -> % comments and nops may have been removed.
case hipe_sparc:is_any_branch(I) of
true -> [hipe_sparc:nop_create(), I];
false -> [I]
end;
_ ->
Sch = bb(IxBlk, {DAG, _Preds} = deps(IxBlk)),
{NewSch, NewIxBlk} = fill_delays(Sch, IxBlk, DAG),
X = finalize_block(NewSch, NewIxBlk),
debug1_stuff(Blk, DAG, IxBlk, Sch, X),
X
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : fill_delays
%% Argument : Sch - List of {{cycle, C}, {node, N}} : C = current cycle
%% N = node index
%% IxBlk - Indexed block [{N, Instr}]
%% DAG - Dependence graph
%% Returns : {NewSch, NewIxBlk} - vector with new schedule and vector
%% with {N, Instr}
%% Description : Goes through the schedule from back to front looking for
%% branches/jumps. If one is found fill_del tries to find
%% an instr to fill the delayslot.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
fill_delays(Sch, IxBlk, DAG) ->
NewIxBlk = hipe_vectors:list_to_vector(IxBlk),
%% NewSch = hipe_vectors:list_to_vector(Sch),
NewSch = fill_del(length(Sch), hipe_vectors:list_to_vector(Sch),
NewIxBlk, DAG),
{NewSch, NewIxBlk}.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : fill_del
%% Argument : N - current index in the schedule
%% Sch - schedule
%% IxBlk - indexed block
%% DAG - dependence graph
%% Returns : Sch - New schedule with possibly a delay instr in the last
%% position.
%% Description : If a call/jump is found fill_branch_delay/fill_call_delay
%% is called to find a delay-filler.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
fill_del(N, Sch, _IxBlk, _DAG) when N < 1 -> Sch;
fill_del(N, Sch, IxBlk, DAG) ->
Index = get_index(Sch, N),
?debug2("Index for ~p: ~p~nInstr: ~p~n",
[N, Index, get_instr(IxBlk, Index)]),
NewSch =
case get_instr(IxBlk, Index) of
#call_link{} ->
fill_branch_delay(N - 1, N, Sch, IxBlk, DAG);
#jmp_link{} ->
fill_call_delay(N - 1, N, Sch, IxBlk, DAG);
#jmp{} ->
fill_call_delay(N - 1, N, Sch, IxBlk, DAG);
#b{} ->
fill_branch_delay(N - 1, N, Sch, IxBlk, DAG);
#br{} ->
fill_branch_delay(N - 1, N, Sch, IxBlk, DAG);
#goto{} ->
fill_branch_delay(N - 1, N, Sch, IxBlk, DAG);
_Other ->
Sch
end,
NewSch.
%% fill_del(N - 1, NewSch, IxBlk, DAG).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : fill_call_delay
%% Argument : Cand - index in schedule of delay-candidate
%% Call - index in schedule of call
%% Sch - schedule vector: < {{cycle,Ci},{node,Nj}}, ... >
%% IxBlk - block vector: < {N, Instr1}, {N+1, Instr2} ... >
%% DAG - dependence graph
%% Returns : Sch - new updated schedule.
%% Description : Searches backwards through the schedule trying to find an
%% instr without conflicts with the Call-instr.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
fill_call_delay(Cand, _Call, Sch, _IxBlk, _DAG) when Cand < 1 -> Sch;
fill_call_delay(Cand, Call, Sch, IxBlk, DAG) ->
CandIndex = get_index(Sch, Cand),
CallIndex = get_index(Sch, Call),
CandI = get_instr(IxBlk, CandIndex),
case move_or_alu(CandI) of
true ->
case single_depend(CandIndex, CallIndex, DAG) of
false -> % Other instrs depends on Cand ...
fill_call_delay(Cand - 1, Call, Sch, IxBlk, DAG);
true ->
CallI = get_instr(IxBlk, CallIndex),
CandDefs = ordsets:from_list(hipe_sparc:defines(CandI)),
%% CandUses = ordsets:from_list(hipe_sparc:uses(CandI)),
%% CallDefs = ordsets:from_list(hipe_sparc:defines(CallI)),
CallUses = ordsets:from_list(hipe_sparc:uses(CallI)),
Args = case CallI of
#jmp_link{} ->
ordsets:from_list(
hipe_sparc:jmp_link_args(CallI));
#jmp{} ->
ordsets:from_list(hipe_sparc:jmp_args(CallI));
#call_link{} ->
ordsets:from_list(
hipe_sparc:call_link_args(CallI))
end,
CallUses2 = ordsets:subtract(CallUses, Args),
Conflict = ordsets:intersection(CandDefs, CallUses2),
%% io:format("single_depend -> true:~n ~p~n, ~p~n,~p~n",[CandI,CallI,DAG]),
%% io:format("Cand = ~p~nCall = ~p~n",[CandI,CallI]),
%% io:format("CandDefs = ~p~nCallDefs = ~p~n",[CandDefs,CallDefs]),
%% io:format("CandUses = ~p~nCallUses = ~p~n",[CandUses,CallUses]),
%% io:format("Args = ~p~nCallUses2 = ~p~n",[Args,CallUses2]),
%% io:format("Conflict = ~p~n",[Conflict]),
case Conflict of
[] -> % No conflicts ==> Cand can fill delayslot after Call
update_schedule(Cand, Call, Sch);
_ -> % Conflict: try with preceeding instrs
fill_call_delay(Cand - 1, Call, Sch, IxBlk, DAG)
end
end;
false ->
fill_call_delay(Cand - 1, Call, Sch, IxBlk, DAG)
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : fill_branch_delay
%% Argument : Cand - index in schedule of delay-candidate
%% Branch - index in schedule of branch
%% Sch - schedule
%% IxBlk - indexed block
%% DAG - dependence graph
%% Returns : Sch - new updated schedule.
%% Description : Searches backwards through the schedule trying to find an
%% instr without conflicts with the Branch-instr.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
fill_branch_delay(Cand, _Br, Sch, _IxBlk, _DAG) when Cand < 1 -> Sch;
fill_branch_delay(Cand, Br, Sch, IxBlk, DAG) ->
CandIndex = get_index(Sch, Cand),
BrIndex = get_index(Sch, Br),
CandI = get_instr(IxBlk, CandIndex),
case move_or_alu(CandI) of
true ->
case single_depend(CandIndex, BrIndex, DAG) of
false -> % Other instrs depends on Cand ...
fill_branch_delay(Cand - 1, Br, Sch, IxBlk, DAG);
true ->
BrI = get_instr(IxBlk, BrIndex),
CandDefs = ordsets:from_list(hipe_sparc:defines(CandI)),
%% CandUses = ordsets:from_list(hipe_sparc:uses(CandI)),
%% BrDefs = ordsets:from_list(hipe_sparc:defines(BrI)),
BrUses = ordsets:from_list(hipe_sparc:uses(BrI)),
Conflict = ordsets:intersection(CandDefs, BrUses),
%% io:format("single_depend -> true: ~p~n, ~p~n,~p~n", [CandI, BrI, DAG]),
%% io:format("Cand = ~p~nBr = ~p~n",[CandI,BrI]),
%% io:format("CandDefs = ~p~nBrDefs = ~p~n",[CandDefs,BrDefs]),
%% io:format("CandUses = ~p~nBrUses = ~p~n",[CandUses,BrUses]),
%% io:format("Conflict = ~p~n",[Conflict]);
case Conflict of
[] -> % No conflicts ==>
% Cand can fill delayslot after Branch
update_schedule(Cand, Br, Sch);
_ -> % Conflict: try with preceeding instrs
fill_branch_delay(Cand - 1, Br, Sch, IxBlk, DAG)
end
end;
false ->
fill_branch_delay(Cand - 1, Br, Sch, IxBlk, DAG)
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : update_schedule
%% Argument : From - the position from where to switch indexes in Sch
%% To - the position to where to switch indexes in Sch
%% Sch - schedule
%% Returns : Sch - an updated schedule
%% Description : If From is the delay-filler and To is the Call/jump, the
%% schedule is updated so From gets index To, To gets index
%% To - 1, and the nodes between From and To gets old_index - 1.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
update_schedule(To, To, Sch) ->
{{cycle, C}, {node, _N} = Node} = hipe_vectors:get(Sch, To-1),
hipe_vectors:set(Sch, To-1, {{cycle, C+1}, Node});
update_schedule(From, To, Sch) ->
Temp = hipe_vectors:get(Sch, From-1),
Sch1 = hipe_vectors:set(Sch, From-1, hipe_vectors:get(Sch, From)),
update_schedule(From + 1, To, hipe_vectors:set(Sch1, From, Temp)).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : single_depend
%% Argument : N - Index of the delayslot candidate
%% M - Index of the node that N possibly has a single
%% depend to.
%% DAG - The dependence graph
%% Returns : true if no other nodes than N os depending on N
%% Description : Checks that no other nodes than M depends on N and that the
%% latency between them is zero or 1.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
single_depend(N, M, DAG) ->
Deps = hipe_vectors:get(DAG, N-1),
single_depend(M, Deps).
single_depend(_N, []) -> true;
single_depend(N, [{0, N}]) -> true;
single_depend(N, [{1, N}]) -> true;
single_depend(_N, [{_Lat, _}|_]) -> false.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : get_index
%% Argument : Sch - schedule
%% N - index in schedule
%% Returns : Index - index of the node
%% Description : Returns the index of the node on position N in the schedule.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
get_index(Sch, N) ->
{{cycle, _C}, {node, Index}} = hipe_vectors:get(Sch,N-1),
Index.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : get_instr
%% Argument : IxBlk - indexed block
%% N - index in block
%% Returns : Instr
%% Description : Returns the instr on position N in the indexed block.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
get_instr(IxBlk, N) ->
{_, Instr} = hipe_vectors:get(IxBlk, N-1),
Instr.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : get_instr
%% Argument : Sch - schedule
%% IxBlk - indexed block
%% N - index in schedule
%% Returns : Instr
%% Description : Returns the instr on position N in the schedule.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
get_instr(Sch, IxBlk, N) ->
{{cycle, _C}, {node, Index}} = hipe_vectors:get(Sch, N-1),
{_, Instr} = hipe_vectors:get(IxBlk, Index-1),
Instr.
separate_block(Sch,IxBlk) ->
sep_comments([{C,lookup_instr(IxBlk,N)} || {{cycle,C},{node,N}} <- Sch]).
sep_comments([]) -> [];
sep_comments([{C,I}|Xs]) ->
[hipe_sparc:comment_create({cycle,C}), I | sep_comments(Xs,C)].
sep_comments([], _) -> [];
sep_comments([{C1,I}|Xs], C0) ->
if
C1 > C0 ->
[hipe_sparc:comment_create({cycle,C1}),I|sep_comments(Xs,C1)];
true ->
[I|sep_comments(Xs, C0)]
end.
finalize_block(Sch, IxBlk) ->
?debug5("Sch: ~p~nIxBlk: ~p~n",[Sch,IxBlk]),
finalize_block(1, hipe_vectors:size(Sch), 1, Sch, IxBlk, []).
finalize_block(N, End, _C, Sch, IxBlk, _Instrs) when N =:= End - 1 ->
NextLast = get_instr(Sch, IxBlk, N),
Last = get_instr(Sch, IxBlk, End),
?debug5("NextLast: ~p~nLast: ~p~n",[NextLast,Last]),
case hipe_sparc:is_any_branch(Last) of
true -> % Couldn't fill delayslot ==> add NOP
[NextLast , hipe_sparc:nop_create(), Last];
false -> % Last is a delayslot-filler ==> change order...
[Last, NextLast]
end;
finalize_block(N, End, C0, Sch, IxBlk, Instrs) ->
{{cycle, _C1}, {node, _M}} = hipe_vectors:get(Sch, N-1),
Instr = get_instr(Sch, IxBlk, N),
?debug5("Instr: ~p~n~n",[Instr]),
[Instr | finalize_block(N + 1, End, C0, Sch, IxBlk, Instrs)].
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : bb
%% Argument : IxBlk - indexed block
%% DAG - {Dag, Preds} where Dag is dependence graph and
%% Preds is number of predecessors for each node.
%% Returns : Sch
%% Description : Initializes earliest-list, ready-list, priorities, resources
%% and so on, and calls the cycle_sched which does the scheduling
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
bb(IxBlk,DAG) ->
bb(length(IxBlk), IxBlk, DAG).
bb(N,IxBlk,{DAG, Preds}) ->
Earliest = init_earliest(N),
BigArray = N*10, % "nothing" is this big :-)
Ready = hipe_schedule_prio:init_ready(BigArray,Preds),
I_res = init_instr_resources(N, IxBlk),
Prio = hipe_schedule_prio:init_instr_prio(N,DAG),
Rsrc = init_resources(BigArray),
?debug4("I_res: ~n~p~nPrio: ~n~p~nRsrc: ~n~p~n", [I_res,Prio,Rsrc]),
?debug('cycle 1~n',[]),
Sch = empty_schedule(),
cycle_sched(1,Ready,DAG,Preds,Earliest,Rsrc,I_res,Prio,Sch,N,IxBlk).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : cycle_sched
%% Argument : - C is current cycle, 1 or more.
%% - Ready is an array (Cycle -> [Node])
%% yielding the collection of nodes ready to be
%% scheduled in a cycle.
%% - DAG is an array (Instr -> [{Latency,Instr}])
%% represents the dependence DAG.
%% - Preds is an array (Instr -> NumPreds)
%% counts the number of predecessors
%% (0 preds = ready to be scheduled).
%% - Earl is an array (Instr -> EarliestCycle)
%% holds the earliest cycle an instruction can be scheduled.
%% - Rsrc is a 'resource ADT' that handles scheduler resource
%% management checks whether instruction can be scheduled
%% this cycle without a stall.
%% - I_res is an array (Instr -> Required_resources)
%% holds the resources required to schedule an instruction.
%% - Sch is the representation of the schedule current schedule.
%% - N is the number of nodes remaining to be scheduled
%% tells us when to stop the scheduler.
%% - IxBlk is the indexed block with instrs
%% Returns : present schedule
%% Description : Scheduler main loop.
%% Pick next ready node in priority order for cycle C until
%% none remain.
%% * check each node if it can be scheduled w/o stalling
%% * if so, schedule it
%% * otherwise, bump the node to the next cycle
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
cycle_sched(C,Ready,DAG,Preds,Earl,Rsrc,I_res,Prio,Sch,N,IxBlk) ->
case hipe_schedule_prio:next_ready(C,Ready,Prio,IxBlk,DAG,Preds,Earl) of
% case hipe_schedule_prio:next_ready(C,Ready,Prio,IxBlk) of
{next,I,Ready1} ->
?debug('try ~p~n==> ready = ~p~n',[I, Ready1]),
case resources_available(C,I,Rsrc,I_res) of
{yes,NewRsrc} ->
?debug(' scheduled~n==> Rscrs = ~p~n',[NewRsrc]),
NewSch = add_to_schedule(I,C,Sch),
{ReadyNs,NewDAG,NewPreds,NewEarl} =
delete_node(C,I,DAG,Preds,Earl),
?debug("NewPreds : ~p~n",[Preds]),
?debug(' ReadyNs: ~p~n',[ReadyNs]),
NewReady = hipe_schedule_prio:add_ready_nodes(ReadyNs,
Ready1),
?debug(' New ready: ~p~n',[NewReady]),
cycle_sched(C,NewReady,NewDAG,NewPreds,NewEarl,
NewRsrc,I_res,Prio,NewSch,N-1, IxBlk);
no ->
?debug(' resource conflict~n',[]),
NewReady = hipe_schedule_prio:insert_node(C+1,I,Ready1),
cycle_sched(C,NewReady,DAG,Preds,Earl,Rsrc,
I_res,Prio,Sch,N,IxBlk)
end;
none -> % schedule next cycle if some node remains
if
N > 0 ->
?debug('cycle ~p~n',[C+1]),
cycle_sched(C+1,Ready,DAG,Preds,Earl,
advance_cycle(Rsrc),
I_res,Prio,Sch,N, IxBlk);
true ->
present_schedule(Sch)
end
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : init_earliest
%% Argument : N - number of instrs
%% Returns :
%% Description :
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
init_earliest(N) ->
hipe_vectors:new(N,1).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% Schedule is kept reversed until the end.
-define(present_node(I,Cycle),{{cycle,Cycle},{node,I}}).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : empty_schedule
%% Description : Returns an empty schedule.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
empty_schedule() -> [].
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_to_schedule
%% Argument : I - instr
%% Cycle - cycle when I was placed
%% Sch - schedule
%% Description : Adds instr to schedule
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_to_schedule(I,Cycle,Sch) ->
[?present_node(I,Cycle)|Sch].
present_schedule(Sch) -> lists:reverse(Sch).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% Interface to resource manager:
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : init_resources
%% Description : Yields a 'big enough' array mapping (Cycle -> Resources);
%% this array is called Rsrc below.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
init_resources(S) ->
hipe_target_machine:init_resources(S).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : init_instr_resources
%% Argument : Nodes - a list of the instructions
%% N - is the number of nodes
%% Description : return a vector (NodeID -> Resource_requirements)
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
init_instr_resources(N,Nodes) ->
hipe_target_machine:init_instr_resources(N,Nodes).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : resources_available
%% Argument : Cycle - the current cycle
%% I - the current instruction (index = NodeID)
%% Rsrc - a map (Cycle -> Resources)
%% I_res - maps (NodeID -> Resource_requirements)
%% Description : returns {yes,NewResTab} | no
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
resources_available(Cycle,I,Rsrc,I_res) ->
hipe_target_machine:resources_available(Cycle,I,Rsrc,I_res).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : advance_cycle
%% Argument : Rsrc - resources
%% Description : Returns an empty resources-state
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
advance_cycle(Rsrc) ->
hipe_target_machine:advance_cycle(Rsrc).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : delete_node
%% Argument : Cycle - current cycle
%% I - index of instr
%% DAG - dependence dag
%% Preds - array with number of predecessors for nodes
%% Earl - array with earliest-times for nodes
%% Returns : {ReadyNs,NewDAG,NewPreds,NewEarl}
%% Description : Deletes node I and updates earliest times for the rest.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
delete_node(Cycle,I,DAG,Preds,Earl) ->
Succ = hipe_vectors:get(DAG,I-1),
NewDAG = hipe_vectors:set(DAG,I-1,scheduled), % provides debug 'support'
{ReadyNs,NewPreds,NewEarl} = update_earliest(Succ,Cycle,Preds,Earl,[]),
?debug('earliest after ~p: ~p~n',[I,[{Ix+1,V} || {Ix,V} <- hipe_vectors:list(NewEarl)]]),
{ReadyNs,NewDAG,NewPreds,NewEarl}.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : update_earliest
%% Argument : Succ - successor list
%% Cycle - current cycle
%% Preds - predecessors
%% Earl - earliest times for nodes
%% Ready - array with readynodes for cycles
%% Returns : {Ready,Preds,Earl}
%% Description : Updates the earliest times for nodes and updates number of
%% predecessors for nodes
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
update_earliest([],_Cycle,Preds,Earl,Ready) ->
{Ready,Preds,Earl};
update_earliest([{Lat,N}|Xs],Cycle,Preds,Earl,Ready) ->
Old_earl = hipe_vectors:get(Earl,N-1),
New_earl = erlang:max(Old_earl,Cycle+Lat),
NewEarl = hipe_vectors:set(Earl,N-1,New_earl),
Num_preds = hipe_vectors:get(Preds,N-1),
NewPreds = hipe_vectors:set(Preds,N-1,Num_preds-1),
if
Num_preds =:= 0 ->
?debug('inconsistent DAG~n',[]),
exit({update_earliest,N});
Num_preds =:= 1 ->
NewReady = [{New_earl,N}|Ready],
NewPreds2 = hipe_vectors:set(NewPreds,N-1,0),
update_earliest(Xs,Cycle,NewPreds2,NewEarl,NewReady);
is_integer(Num_preds), Num_preds > 1 ->
update_earliest(Xs,Cycle,NewPreds,NewEarl,Ready)
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% Collect instruction dependences.
%%
%% Three forms:
%% - data/register
%% * insert RAW, WAR, WAW dependences
%% - memory
%% * stores serialize memory references
%% * alias analysis may allow loads to bypass stores
%% - control
%% * unsafe operations are 'trapped' between branches
%% * branches are ordered
%%
%% returns { [{Index,Instr}], DepDAG }
%% DepDAG is defined below.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : deps
%% Argument : BB - Basic block
%% Returns : {IxBB,DAG} - indexed block and dependence graph. DAG consists
%% of both Dag and Preds, where Preds is number
%% of predecessors for nodes.
%% Description : Collect instruction dependences.
%%
%% Three forms:
%% - data/register
%% * insert RAW, WAR, WAW dependences
%% - memory
%% * stores serialize memory references
%% * alias analysis may allow loads to bypass stores
%% - control
%% * unsafe operations are 'trapped' between branches
%% * branches are ordered
%%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
deps(IxBB) ->
N = length(IxBB),
DAG = empty_dag(N), % The DAG contains both dependence-arcs and
% number of predeccessors...
{_DepTab,DAG1} = dd(IxBB, DAG),
DAG2 = md(IxBB, DAG1),
cd(IxBB, DAG2).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : empty_dag
%% Argument : N - number of nodes
%% Returns : empty DAG
%% Description : DAG consists of dependence graph and predeccessors
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
empty_dag(N) ->
{hipe_vectors:new(N, []), hipe_vectors:new(N, 0)}.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : indexed_bb
%% Argument : BB - basic block
%% Returns : [{N, Instr}]
%% Description : Puts indexes to all instrs of a block, removes comments.
%% NOP's are also removed because if both sparc_schedule and
%% sparc_post_schedule options are used, the first pass will
%% add nop's before the branch if necessary, and these are
%% removed before scheduling the second pass.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
indexed_bb(BB) ->
indexed_bb(BB,1).
indexed_bb([],_N) -> [];
indexed_bb([X|Xs],N) ->
case X of
#comment{} ->
indexed_bb(Xs,N);
#nop{} ->
indexed_bb(Xs,N);
_Other ->
[{N,X}|indexed_bb(Xs,N+1)]
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : dep_arc
%% Argument : N - Current node
%% Lat - Latency from current node to M
%% M - The dependent node
%% DAG - The dependence graph. Consists of both DAG and
%% predeccessors
%% Returns : A new DAG with the arc added and number of predeccessors for
%% M increased.
%% Description : Adds a new arc to the graph, if an older arc goes from N to M
%% it will be replaced with a new arc {max(OldLat, NewLat), M}.
%% Number of predeccessors for node M is increased.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
dep_arc(N, Lat, M, {Dag,Preds}) ->
OldDeps = hipe_vectors:get(Dag, N-1),
%% io:format("{OldDeps} = {~p}~n",[OldDeps]),
{NewDeps, Status} = add_arc(Lat, M, OldDeps),
%% io:format("{NewDeps, Status} = {~p, ~p}~n",[NewDeps, Status]),
NewDag = hipe_vectors:set(Dag, N-1, NewDeps),
NewPreds = case Status of
added -> % just increase preds if new arc was added
OldPreds = hipe_vectors:get(Preds, M-1),
hipe_vectors:set(Preds, M-1, OldPreds + 1);
non_added ->
Preds
end,
{NewDag, NewPreds}.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_arc
%% Argument : Lat - The latency from current node to To.
%% To - The instr-id of the node which the dependence goes to
%% Arcs - The dependecies that are already in the dep-graph
%% Returns : A dependence graph sorted by To.
%% Description : A new arc that is added is sorted in the right place, and if
%% there is already an arc between nodes A and B, the one with
%% the greatest latency is chosen.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_arc(Lat,To, []) -> {[{Lat, To}], added};
add_arc(Lat1, To, [{Lat2, To} | Arcs]) ->
{[{erlang:max(Lat1, Lat2), To} | Arcs], non_added};
add_arc(Lat1,To1, [{Lat2, To2} | Arcs]) when To1 < To2 ->
{[{Lat1, To1}, {Lat2, To2} | Arcs], added};
add_arc(Lat1 ,To1, [{Lat2, To2} | Arcs]) ->
{Arcs1, Status} = add_arc(Lat1, To1, Arcs),
{[{Lat2, To2} | Arcs1], Status}.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%
%% The register/data dependence DAG of a block is represented
%% as a mapping (Variable -> {NextWriter,NextReaders})
%% where NextWriter is a pair {Ix,Type}
%% and NextReaders is a list of pairs {Ix,Type}.
%%
%% Type is used to determine latencies of operations; on the UltraSparc,
%% latencies of arcs (n -> m) are determined by both n and m. (E.g., if
%% n is an integer op and m is a store, then latency is 0; if m is an
%% integer op, it's 1.)
dd([],DAG) -> { empty_deptab(), DAG };
dd([{N,I}|Is],DAG0) ->
{DepTab,DAG1} = dd(Is,DAG0),
add_deps(N,I,DepTab,DAG1).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_deps
%% Argument : N - current node
%% Instr - current instr
%% DepTab - hashtable with {next-writer, next-readers} for reg
%% DAG - dependence graph
%% Returns : {DepTab, BlockInfo, DAG} - with new values
%% Description : Adds dependencies for node N to the graph. The registers that
%% node N defines and uses are used for computing the
%% dependencies to the following nodes.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_deps(N,Instr,DepTab,DAG) ->
{Ds,Us} = def_use(Instr),
Type = dd_type(Instr),
{DepTab1,DAG1} = add_write_deps(Ds,N,Type,DepTab,DAG),
add_read_deps(Us,N,Type,DepTab1,DAG1).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Instructions are classified into symbolic categories,
%% which are subsequently used to determine operation latencies
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
dd_type(Instr) ->
case Instr of
#b{} -> branch;
%% #br{} -> branch;
#call_link{} -> branch;
#jmp_link{} -> branch;
#jmp{} -> branch;
#goto{} -> branch;
#load{} -> load;
#store{} -> store;
#alu{} -> alu;
#move{} -> alu;
#multimove{} ->
Src = hipe_sparc:multimove_src(Instr),
Lat = round(length(Src)/2),
{mmove,Lat};
#sethi{} -> alu;
#alu_cc{} -> alu_cc;
%% #cmov_cc{} -> cmov_cc;
%% #cmov_r{} -> alu;
#load_atom{} -> alu;
#load_address{} -> alu;
#pseudo_enter{} -> pseudo;
#pseudo_pop{} -> pseudo;
#pseudo_return{} -> pseudo;
#pseudo_spill{} -> pseudo;
#pseudo_unspill{} -> pseudo
end.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_write_deps
%% Argument : Defs - registers that node N defines.
%% N - current node
%% Ty - the type of current instr
%% DepTab - Dependence-table
%% DAG - The dependence graph.
%% Returns : {DepTab,DAG} - with new values
%% Description : Adds dependencies to the graph for nodes that depends on the
%% registers that N defines.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_write_deps([],_N,_Ty,DepTab,DAG) -> {DepTab,DAG};
add_write_deps([D|Ds],N,Ty,DepTab,DAG) ->
{NewDepTab,NewDAG} = add_write_dep(D,N,Ty,DepTab,DAG),
add_write_deps(Ds,N,Ty,NewDepTab,NewDAG).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_write_dep
%% Description : Updates the dependence table with N as next writer, and
%% updates the DAG with the dependencies from N to subsequent
%% nodes.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_write_dep(X,N,Ty,DepTab,DAG) ->
{NxtWriter,NxtReaders} = lookup(X,DepTab),
NewDepTab = writer(X,N,Ty,DepTab),
NewDAG = write_deps(N,Ty,NxtWriter,NxtReaders,DAG),
{NewDepTab, NewDAG}.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : write_deps
%% Argument : Instr - Current instr
%% Ty - Type of current instr
%% NxtWriter - The node that is the next writer of the ragister
%% that Instr defines.
%% NxtReaders - The nodes that are subsequent readers of the
%% register that N defines.
%% DAG - The dependence graph
%% Returns : Calls raw_deps that finally returns a new DAG with the new
%% dependence arcs added.
%% Description : If a next writer exists a dependence arc for this node is
%% added, and after this raw_deps is called to compute the
%% arcs for read-after-write dependencies.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
write_deps(Instr,Ty,NxtWriter,NxtReaders,DAG) ->
DAG1 = case NxtWriter of
none ->
DAG;
{Instr,_} ->
DAG;
{Wr,WrTy} ->
dep_arc(Instr,
hipe_target_machine:waw_latency(Ty,WrTy),
Wr, DAG)
end,
raw_deps(Instr,Ty,NxtReaders,DAG1).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : raw_deps
%% Argument : Instr - current instr
%% Type - type of instr
%% Readers - subsequent readers
%% DAG - dependence graph
%% Returns : DAG - A new DAG with read-after-write dependencies added
%% Description : Updates the DAG with the dependence-arcs from Instr to the
%% subsequent readers, with the appropriate latencies.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
raw_deps(_Instr,_Type,[],DAG) -> DAG;
raw_deps(Instr,Ty,[{Rd,RdTy}|Xs],DAG) ->
raw_deps(Instr,Ty,Xs,
dep_arc(Instr,hipe_target_machine:raw_latency(Ty,RdTy),
Rd,DAG)).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_read_deps
%% Argument : Uses - The registers that node N uses.
%% N - Index of the current node.
%% Ty - Type of current node.
%% DepTab - Dependence table
%% DAG - Dependence graph
%% Returns : {DepTab, DAG} - with updated values.
%% Description : Adds the read dependencies from node N to subsequent ones,
%% according to the registers that N uses.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_read_deps([],_N,_Ty,DepTab,DAG) -> {DepTab,DAG};
add_read_deps([U|Us],N,Ty,DepTab,DAG) ->
{NewDepTab,NewDAG} = add_read_dep(U,N,Ty,DepTab,DAG),
add_read_deps(Us,N,Ty,NewDepTab,NewDAG).
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : add_read_dep
%% Argument : X - Used register
%% N - Index of checked instr
%% Ty - Type of checked instr
%% DepTab - Hashtable with {next-writer, next-readers}
%% DAG - Dependence graph
%% Returns : {DepTab, DAG} - with updated values
%% Description : Looks up what the next-writer/next-readers are, and adjusts
%% the table with current node as new reader. Finally
%% read-dependencies are added to the DAG.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
add_read_dep(X,N,Ty,DepTab,DAG) ->
{NxtWriter,_NxtReaders} = lookup(X,DepTab),
NewDepTab = reader(X,N,Ty,DepTab),
NewDAG = read_deps(N,Ty,NxtWriter,DAG),
{NewDepTab, NewDAG}.
% If NxtWriter is 'none', then this var is not written subsequently
% Add WAR from Instr to NxtWriter (if it exists)
% *** UNFINISHED ***
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% Function : read_deps
%% Argument : N - Index of current node
%% Ty - Type of current node
%% Writer - tuple {NextWriter, WrType} where NextWriter is the
%% subsequent instr that writes this register next time,
%% and WrType is the type of that instr.
%% DAG - The dependence graph
%% Returns : DAG
%% Description : Returns a new DAG if a next-writer exists, otherwise the old
%% DAG is returned.
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
read_deps(_Instr,_Ty,none,DAG) ->
DAG;