-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathpipeline.c
1715 lines (1475 loc) · 52.6 KB
/
pipeline.c
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
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
/*******************************************************************************
*
* Chronos: A Timing Analyzer for Embedded Software
* =============================================================================
* http://www.comp.nus.edu.sg/~rpembed/chronos/
*
* Copyright (C) 2005 Xianfeng Li
*
* 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.
*
* $Id: pipeline.c,v 1.4 2006/07/23 09:20:46 lixianfe Exp $
*
* traverse t-cfg to formulate execution paths; and estimate their execution
* timing bounds
*
******************************************************************************/
#include <string.h>
#include <stdlib.h>
#include "isa.h"
#include "cfg.h"
#include "tcfg.h"
#include "cache.h"
#include "bpred.h"
#include "loops.h"
#include "estimate.h"
#include "exegraph.h"
#include "arch_funcs.h"
#include "scp_cache.h"
#include "pipeline.h"
extern tcfg_node_t **tcfg;
extern int num_tcfg_nodes;
extern tcfg_edge_t **tcfg_edges;
extern int num_tcfg_edges;
extern cache_t cache;
extern cache_t cache_l2;
extern int bpred_scheme;
extern int enable_icache;
extern char ***hit_miss;
extern int *num_hit_miss;
extern loop_t ***bbi_hm_list;
extern int *num_bbi_hm_list;
extern de_inst_t ***mp_insts;
extern int *num_mp_insts;
extern int num_eg_insts;
extern int **num_mblk_conflicts;
extern loop_t **loops;
extern loop_t **loop_map; // bbi => loop
extern int num_tcfg_loops;
extern mem_blk_t **mp_gen;
extern int enable_il2cache;
extern int enable_ul2cache;
int pipe_stages = 5;
int pipe_ibuf_size;
int pipe_iwin_size;
int prolog_size, pipe_iwin_size;
code_link_t **prologs, **epilogs;
mas_inst_t **bodies, *start_body;
int **cpred_times, **mpred_times, start_time;
// temporary variables
// to indicate for each bbi whether it contains long latency instr
int *mlat_bbi;
// to indicate for each edge, the shortest distance of producer to any long
// latency instr in edge->dst or its predecessors
int *max_elog_len;
// the first multi-cycle latency instr along each mispred path
int *mlat_mpinst;
// if est unit's source is BP_CPRED, the number of mispred instr to be
// truncated at the end of the prolog
int *num_plog_trunc;
mblk_tag_t *tmp_cs;
/* sudiptac :::: for level 2 cache */
mblk_tag_t *tmp_cs_l2;
int num_plogs, num_elogs;
/************************************************/
extern int enable_scp_dcache;
extern int enable_scp_dl2cache;
int *** extend_cpred_times;
int* numberOfLoop;
int* numberofContext;
// if a bbi has mult-latency instructions, then set its corresponding entry
// to 1, such bbi has direct contribution to late contentions
static void
set_mlat_bbi(void)
{
int bbi_id, i;
cfg_node_t *bb;
mlat_bbi = (int *) calloc(num_tcfg_nodes, sizeof(int));
for (bbi_id = 0; bbi_id < num_tcfg_nodes; bbi_id++) {
bb = tcfg[bbi_id]->bb;
if (bb->num_inst > 0) {
for (i = bb->num_inst - 1; i >= 0; i--) {
if (max_inst_lat(&bb->code[i]) > 1)
break;
}
mlat_bbi[bbi_id] = i;
} else {
mlat_bbi[bbi_id] = 0;
}
}
}
#define MAX_REGS 256
int dep_regs[MAX_REGS];
static void
lookup_mlat(int orig, int dist, tcfg_node_t *bbi, int no_mlat)
{
int i, k, tmp, r;
de_inst_t *inst;
tcfg_edge_t *e;
if (no_mlat && (mlat_bbi[bbi->id] < 0)) {
dist += bbi->bb->num_inst;
if ((bbi->in == NULL) || (dist >= pipe_iwin_size))
return;
for (e = bbi->in; e != NULL; e = e->next_in)
lookup_mlat(orig, dist, e->src, 1);
return;
}
for (i = bbi->bb->num_inst - 1; i >= 0; i--) {
inst = &bbi->bb->code[i];
for (k = 0; k < inst->num_out; k++) {
r = inst->out[k];
if (dep_regs[r] == orig) {
tmp = pipe_iwin_size - (dist + (bbi->bb->num_inst - i));
max_elog_len[orig] = max(tmp, max_elog_len[orig]);
return;
}
}
if (max_inst_lat(inst) > 1) {
for (k = 0; k < inst->num_in; k++) {
r = inst->in[k];
dep_regs[r] = orig;
}
}
}
dist += bbi->bb->num_inst;
if (dist < pipe_iwin_size) {
for (e = bbi->in; e != NULL; e = e->next_in)
lookup_mlat(orig, dist, e->src, 0);
}
}
static void
bound_elog_len(void)
{
int i;
max_elog_len = (int *) malloc(num_tcfg_nodes * sizeof(int));
for (i = 0; i < MAX_REGS; i++)
dep_regs[i] = -1;
max_elog_len[0] = 0;
if (mlat_bbi[0] >= 0)
max_elog_len[0] = pipe_iwin_size - (tcfg[0]->bb->num_inst - mlat_bbi[0]);
for (i = 1; i < num_tcfg_nodes; i++) {
max_elog_len[i] = 0;
lookup_mlat(i, 0, tcfg[i], 1);
}
}
static void
find_mlat_mpinst(void)
{
int i, k;
mlat_mpinst = (int *) calloc(num_tcfg_edges, sizeof(int));
num_plog_trunc = (int *) calloc(num_tcfg_edges, sizeof(int));
for (i = 0; i < num_tcfg_edges; i++) {
for (k = 0; k < num_mp_insts[i]; k++) {
if (max_inst_lat(mp_insts[i][k]) > 1) {
mlat_mpinst[i] = k + 1;
break;
}
}
}
}
// create a prologue from the reverse of path; and for the first node, skip the
// first num_skip instructions
static void
new_prolog(int log_set, tcfg_edge_t **path, int path_len, int num_skip)
{
int i, k, num = 0, num_mp = 0, tag, set, edge_id,
max_num_mp, set_l2, tag_l2;;
tcfg_node_t *bbi, *mbbi;
Queue queue;
code_link_t *plog;
mas_inst_t mas_inst;
addr_t sa;
if (num_skip < 0)
num_skip = 0;
memset(tmp_cs, 0, cache.ns * sizeof(mblk_tag_t));
/* sudiptac :::: for level 2 cache analysis */
if (enable_il2cache || enable_ul2cache) {
memset(tmp_cs_l2, 0, cache_l2.ns * sizeof(mblk_tag_t));
}
init_queue(&queue, sizeof(mas_inst_t));
for (i = path_len-1; i >= 0; i--) {
bbi = path[i]->src;
sa = bbi->bb->sa;
// copy code of e->src into prologue
for (k = num_skip; k < bbi->bb->num_inst; k++) {
// bpred related
mas_inst.inst = &bbi->bb->code[k];
mas_inst.bbi_id = bbi->id;
assert(bbi->id >= 0);
mas_inst.mblk_id = MBLK_ID(sa, mas_inst.inst->addr);
mas_inst.bp_flag = BP_CPRED;
// cache related
tag = TAG(mas_inst.inst->addr);
set = SET(mas_inst.inst->addr);
tag_l2 = TAG_L2(mas_inst.inst->addr);
set_l2 = SET_L2(mas_inst.inst->addr);
if (tmp_cs[set].valid == 0)
mas_inst.ic_flag = IC_UNCLEAR;
else if (tmp_cs[set].tag == tag)
mas_inst.ic_flag = IC_HIT;
else
mas_inst.ic_flag = IC_MISS;
tmp_cs[set].valid = 1;
tmp_cs[set].tag = tag;
/* sudiptac :::: for L2 cache analysis */
if (enable_il2cache || enable_ul2cache) {
if (tmp_cs_l2[set_l2].valid == 0)
mas_inst.ic_flag_l2 = IC_UNCLEAR;
else if (tmp_cs_l2[set_l2].tag == tag_l2)
mas_inst.ic_flag_l2 = IC_HIT;
else
mas_inst.ic_flag_l2 = IC_MISS;
tmp_cs_l2[set_l2].valid = 1;
tmp_cs_l2[set_l2].tag = tag_l2;
}
/******************************************************/
if (enable_scp_dcache || enable_ul2cache) {
int iType = inst_type(mas_inst.inst);
if (iType == INST_LOAD) {
mas_inst.dc_flag = DC_UNCLEAR;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_UNCLEAR;
} else if (iType == INST_STORE) {
mas_inst.dc_flag = DC_STORE;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_STORE;
} else {
mas_inst.dc_flag = DC_HIT;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_HIT;
}
} else {
mas_inst.dc_flag = DC_HIT;
mas_inst.dc_flag_l2 = DC_HIT;
}
/******************************************************/
enqueue(&queue, &mas_inst);
num++;
}
num_skip = 0;
if ((bpred_scheme == NO_BPRED) || !cond_bbi(bbi))
continue;
// mispred instructions
edge_id = path[i]->id;
if (mlat_mpinst[edge_id] > max_elog_len[bbi->id])
continue;
max_num_mp = min(num_mp_insts[edge_id], max_elog_len[bbi->id]);
if (bbi->out == path[i])
mbbi = bbi->out->next_out->dst;
else
mbbi = bbi->out->dst;
num_mp = 0;
for (k = 0; k < max_num_mp; k++) {
if (num_mp >= mbbi->bb->num_inst) {
mbbi = mbbi->out->dst;
num_mp = 0;
}
mas_inst.inst = mp_insts[edge_id][k];
mas_inst.bbi_id = mbbi->id;
assert(mbbi->id >= 0);
mas_inst.mblk_id = MBLK_ID(mbbi->bb->sa, mas_inst.inst->addr);
/* sudiptac ::: for level 2 cache analysis */
mas_inst.mblk_id_l2 = MBLK_ID_L2(sa, mas_inst.inst->addr);
if (i == 0)
mas_inst.bp_flag = BP_MPRED;
else
mas_inst.bp_flag = BP_UNCLEAR;
tag = TAG(mas_inst.inst->addr);
set = SET(mas_inst.inst->addr);
if (tmp_cs[set].valid == 0)
mas_inst.ic_flag = IC_UNCLEAR;
else if (tmp_cs[set].tag == tag)
mas_inst.ic_flag = IC_HIT;
else {
mas_inst.ic_flag = IC_MISS;
tmp_cs[set].valid = 1;
}
/* sudiptac :::: for level 2 cache analysis */
if (enable_il2cache || enable_ul2cache) {
if (tmp_cs_l2[set_l2].valid == 0)
mas_inst.ic_flag_l2 = IC_UNCLEAR;
else if (tmp_cs_l2[set_l2].tag == tag_l2)
mas_inst.ic_flag_l2 = IC_HIT;
else {
mas_inst.ic_flag_l2 = IC_MISS;
tmp_cs_l2[set_l2].valid = 1;
}
}
/******************************************************/
if (enable_scp_dcache || enable_ul2cache) {
int iType = inst_type(mas_inst.inst);
if (iType == INST_LOAD) {
mas_inst.dc_flag = DC_UNCLEAR;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_UNCLEAR;
} else if (iType == INST_STORE) {
mas_inst.dc_flag = DC_STORE;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_STORE;
} else {
mas_inst.dc_flag = DC_HIT;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_HIT;
}
} else {
mas_inst.dc_flag = DC_HIT;
mas_inst.dc_flag_l2 = DC_HIT;
}
/******************************************************/
enqueue(&queue, &mas_inst);
num++;
num_mp++;
}
if (i == 0)
num_plog_trunc[log_set] = max_num_mp;
}
// copy code from temporary storage to the new prologue node
plog = (code_link_t *) calloc(1, sizeof(code_link_t));
CHECK_MEM(plog);
plog->code = (mas_inst_t *) calloc(num, sizeof(mas_inst_t));
CHECK_MEM(plog->code);
for (k = 0; k < num; k++)
plog->code[k] = *((mas_inst_t *) dequeue(&queue));
plog->num_inst = num;
plog->next = prologs[log_set];
prologs[log_set] = plog;
free_queue(&queue);
}
static void
trav_backward(int log_set, tcfg_edge_t **path, int path_len, int code_len)
{
tcfg_node_t *bbi;
tcfg_edge_t *e;
assert(path_len > 0);
assert(code_len >= 0);
bbi = path[path_len-1]->src;
code_len += bbi->bb->num_inst;
if ((code_len >= prolog_size) || (bbi->in == NULL))
new_prolog(log_set, path, path_len, code_len - prolog_size);
else {
for (e = bbi->in; e != NULL; e = e->next_in) {
// TODO: FIXME: bodgy hack.
// if (path_len >= prolog_size)
// return;
path[path_len] = e;
trav_backward(log_set, path, path_len+1, code_len);
}
}
}
// collect the set of prologue code for each edge e, where e->src is the last
// block of the prologue code
static void
collect_prologs(void)
{
tcfg_edge_t **path;
int i;
path = (tcfg_edge_t **) calloc(prolog_size, sizeof(tcfg_edge_t *));
CHECK_MEM(path);
prologs = (code_link_t **) calloc(num_tcfg_edges, sizeof(code_link_t *));
CHECK_MEM(prologs);
for (i = 0; i < num_tcfg_edges; i++) {
path[0] = tcfg_edges[i];
trav_backward(i, path, 1, 0);
}
free(path);
}
// create an epilogue from the path
static int
new_epilog(int log_set, tcfg_edge_t **path, int path_len)
{
int i, k, num = 0, num1 = 0, m = 0, max_len,
hit_mlat = 0, set, tag, set_l2, tag_l2;
tcfg_node_t *bbi;
Queue queue;
code_link_t *elog;
mas_inst_t mas_inst;
addr_t sa;
max_len = max_elog_len[tcfg_edges[log_set]->src->id];
memset(tmp_cs, 0, cache.ns * sizeof(mblk_tag_t));
/* sudiptac :::: for level 2 cache */
if (enable_il2cache || enable_ul2cache) {
memset(tmp_cs_l2, 0, cache_l2.ns * sizeof(mblk_tag_t));
}
init_queue(&queue, sizeof(de_inst_t));
for (i = 0; i < path_len; i++) {
hit_mlat = 0;
// copy code of e->dst
bbi = path[i]->dst;
sa = bbi->bb->sa;
for (k = 0; (k < bbi->bb->num_inst) && (m < max_len); k++, m++) {
mas_inst.inst = &bbi->bb->code[k];
mas_inst.bbi_id = bbi->id;
assert(bbi->id >= 0);
mas_inst.mblk_id = MBLK_ID(sa, mas_inst.inst->addr);
/* sudiptac ::: for level 2 cache analysis */
mas_inst.mblk_id_l2 = MBLK_ID_L2(sa, mas_inst.inst->addr);
// bpred related
mas_inst.bp_flag = BP_CPRED;
// cache related
tag = TAG(mas_inst.inst->addr);
set = SET(mas_inst.inst->addr);
/* sudiptac :::: for level 2 cache */
tag_l2 = TAG_L2(mas_inst.inst->addr);
set_l2 = SET_L2(mas_inst.inst->addr);
if (tmp_cs[set].valid == 0)
mas_inst.ic_flag = IC_UNCLEAR;
else if (tmp_cs[set].tag == tag)
mas_inst.ic_flag = IC_HIT;
else
mas_inst.ic_flag = IC_MISS;
tmp_cs[set].valid = 1;
tmp_cs[set].tag = tag;
/* sudiptac :::: for level 2 cache hierarchy */
if (enable_il2cache || enable_ul2cache) {
if (tmp_cs_l2[set_l2].valid == 0)
mas_inst.ic_flag_l2 = IC_UNCLEAR;
else if (tmp_cs[set_l2].tag == tag_l2)
mas_inst.ic_flag_l2 = IC_HIT;
else
mas_inst.ic_flag_l2 = IC_MISS;
tmp_cs_l2[set_l2].valid = 1;
tmp_cs_l2[set_l2].tag = tag_l2;
}
/******************************************************/
mas_inst.dc_flag = mas_inst.dc_flag_l2 = DC_HIT;
if (enable_scp_dcache || enable_ul2cache) {
int iType = inst_type(mas_inst.inst);
if (iType == INST_LOAD) {
mas_inst.dc_flag = DC_UNCLEAR;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_UNCLEAR;
} else if (iType == INST_STORE) {
mas_inst.dc_flag = DC_STORE;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_STORE;
} else {
mas_inst.dc_flag = DC_HIT;
if (enable_scp_dl2cache || enable_ul2cache)
mas_inst.dc_flag_l2 = DC_HIT;
}
} else {
mas_inst.dc_flag = DC_HIT;
mas_inst.dc_flag_l2 = DC_HIT;
}
/******************************************************/
enqueue(&queue, &mas_inst);
if (max_inst_lat(mas_inst.inst) > 1) {
num1 = num + k + 1;
hit_mlat = 1;
}
}
num += k;
}
if ((num1 == 0) || (hit_mlat == 0)) {
free_queue(&queue);
return 0;
}
// copy code from tmporary storage to the new epilogue node
elog = (code_link_t *) calloc(1, sizeof(code_link_t));
CHECK_MEM(elog);
elog->code = (mas_inst_t *) calloc(num1, sizeof(mas_inst_t));
CHECK_MEM(elog->code);
for (k = 0; k < num1; k++) {
elog->code[k] = *((mas_inst_t *) dequeue(&queue));
}
elog->num_inst = num1;
elog->next = epilogs[log_set];
epilogs[log_set] = elog;
free_queue(&queue);
return 1;
}
static int
trav_forward(int log_set, tcfg_edge_t **path, int path_len, int code_len)
{
tcfg_node_t *bbi;
tcfg_edge_t *e;
int elog_created = 0, tmp;
assert(path_len > 0);
assert(code_len >= 0);
bbi = path[path_len-1]->dst;
code_len += bbi->bb->num_inst;
if ((code_len >= max_elog_len[path[0]->src->id]) || (bbi->out == NULL)) {
if (mlat_bbi[bbi->id] >= 0)
elog_created = new_epilog(log_set, path, path_len);
} else {
for (e = bbi->out; e != NULL; e = e->next_out) {
// TODO: FIXME: bodgy hack.
// if (path_len >= pipe_iwin_size)
// return 0;
path[path_len] = e;
tmp = trav_forward(log_set, path, path_len+1, code_len);
elog_created |= tmp;
}
if ((elog_created == 0) && (mlat_bbi[bbi->id] >= 0))
elog_created = new_epilog(log_set, path, path_len);
}
return elog_created;
}
// collect the set of epilogue code for each edge e, where e->dst is the first
// block of the epilogue code
static void
collect_epilogs(void)
{
tcfg_edge_t **path;
int i;
path = (tcfg_edge_t **) calloc(pipe_iwin_size, sizeof(tcfg_edge_t *));
CHECK_MEM(path);
epilogs = (code_link_t **) calloc(num_tcfg_edges, sizeof(code_link_t *));
CHECK_MEM(epilogs);
for (i = 0; i < num_tcfg_edges; i++) {
if (max_elog_len[tcfg_edges[i]->src->id] == 0)
continue;
path[0] = tcfg_edges[i];
trav_forward(i, path, 1, 0);
}
free(path);
}
static void
collect_bodies(void)
{
int i, k, num;
tcfg_node_t *bbi;
num = tcfg[0]->bb->num_inst;
start_body = (mas_inst_t *) calloc(num, sizeof(mas_inst_t));
CHECK_MEM(start_body);
for (k = 0; k < num; k++) {
start_body[k].inst = &tcfg[0]->bb->code[k];
start_body[k].bp_flag = BP_CPRED;
}
bodies = (mas_inst_t **) calloc(num_tcfg_edges, sizeof(mas_inst_t *));
CHECK_MEM(bodies);
for (i = 0; i < num_tcfg_edges; i++) {
bbi = tcfg_edges[i]->dst;
num = bbi->bb->num_inst;
bodies[i] = (mas_inst_t *) calloc(num, sizeof(mas_inst_t));
CHECK_MEM(bodies[i]);
for (k = 0; k < num; k++) {
bodies[i][k].inst = &bbi->bb->code[k];
bodies[i][k].bbi_id = bbi->id;
assert(bbi->id >= 0);
bodies[i][k].bp_flag = BP_CPRED;
/*Initialise (ic)dc_flag & (ic)dc_flag_l2*/
bodies[i][k].dc_flag = bodies[i][k].ic_flag = IC_HIT;
bodies[i][k].dc_flag_l2 = bodies[i][k].ic_flag_l2 = IC_HIT;
}
}
}
static void
set_body_hitmiss(int edge_id, int hm_id, int contextMask)
{
int i, num, offset, offset_l2, mblk_id = 1, mblk_id_l2 = 1;
int offset_ul2, mblk_id_ul2 = 1;
tcfg_node_t *bbi;
loop_t *lp = NULL;
assert(edge_id >= 0 && edge_id < num_tcfg_edges);
bbi = tcfg_edges[edge_id]->dst;
//lp = bbi_hm_list[bbi->id][hm_id];
num = bbi->bb->num_inst;
if (num > 0) {
bodies[edge_id][0].ic_flag = get_mblk_hitmiss(bbi, 0, lp);
}
/* sudiptac :::: set L2 cache CHMC flag */
/* used for computing BB timing in add_inst (ss/ss_exegraph.c) */
if (enable_il2cache)
bodies[edge_id][0].ic_flag_l2 = get_mblk_hitmiss_l2(bbi, 0, lp);
else if (enable_ul2cache)
bodies[edge_id][0].ic_flag_l2 = get_mblk_hitmiss_ul2(bbi, 0, lp,
contextMask);
for (i = 1; i < num; i++) {
offset = CACHE_LINE(bbi->bb->code[i].addr);
if (offset == 0) {
bodies[edge_id][i].ic_flag = get_mblk_hitmiss(bbi, mblk_id, lp);
mblk_id++;
}
if (enable_il2cache) {
offset_l2 = CACHE_LINE_L2(bbi->bb->code[i].addr);
//printf("offset=%d %d\n",offset_l2,cache_l2.l_msk);
if (offset_l2 == 0) {
/* sudiptac :::: set L2 cache CHMC flag */
bodies[edge_id][i].ic_flag_l2 = get_mblk_hitmiss_l2(bbi,
mblk_id_l2, lp);
mblk_id_l2++;
}
} else if (enable_ul2cache) {
offset_ul2 = CACHE_LINE_L2(bbi->bb->code[i].addr);
//printf("offset=%d %d\n",offset_ul2,cache_l2.l_msk);
if (offset_ul2 == 0) {
bodies[edge_id][i].ic_flag_l2 = get_mblk_hitmiss_ul2(bbi,
mblk_id_ul2, lp, contextMask);
mblk_id_ul2++;
}
}
}
}
int get_context_forward(int src_ctx, int src_length, int dst_legnth) {
while (src_length < dst_legnth) {
src_ctx = src_ctx << 1;
src_length++;
}
while (src_length > dst_legnth) {
src_ctx = src_ctx >> 1;
src_length--;
}
return src_ctx;
}
int get_context_backward(int dst_ctx, int src_length, int dst_length) {
while (src_length < dst_length) {
dst_ctx = dst_ctx >> 1;
dst_length--;
}
while (src_length > dst_length) {
dst_ctx = (dst_ctx << 1) | 1;
dst_length++;
}
return dst_ctx;
}
static void set_body_data_cache_hitmiss(int edge_id, int contextMask) {
tcfg_edge_t* edge = tcfg_edges[edge_id];
tcfg_node_t* src = edge->src;
tcfg_node_t* dst = edge->dst;
int i;
for (i = 0; i < dst->bb->num_inst; i++) {
int iType = inst_type((bodies[edge_id][i]).inst);
if (iType == INST_LOAD) {
int srcContextBitLength = numberOfLoop[src->id] - 1;
int dstContextBitLength = numberOfLoop[dst->id] - 1;
int dstContext = get_context_forward(contextMask,
srcContextBitLength, dstContextBitLength);
loop_t* inner_lp = loop_map[dst->id];
loop_t* ps_lp = NULL;
ps_lp = (loop_t*) scp_psloop_dl(&bodies[edge_id][i], 1);
if (ps_lp == NULL) {
bodies[edge_id][i].dc_flag = DC_UNCLEAR;
} else {
int distance = loop_dist(inner_lp, ps_lp);
if (distance < 0) {
#if 0
printf("edge %d_%d\n", tcfg_edges[edge_id]->src->id,
tcfg_edges[edge_id]->dst->id);
if (inner_lp == NULL
)
printf("inner_lp:NULL\n");
else
printf("inner_lp:%d\n", inner_lp->id);
if (ps_lp == NULL) {
printf("ps_lp:NULL\n");
} else
printf("ps_lp:%d\n", ps_lp->id);
printf("BUGGG!!!!!???? %d\n", distance);
#endif
exit(1);
}
int ps_ctx = dstContext & ((1 << distance) - 1);
if (ps_ctx == 0)
bodies[edge_id][i].dc_flag = DC_MISS;
else
bodies[edge_id][i].dc_flag = DC_HIT;
}
if (enable_scp_dl2cache || enable_ul2cache) {
loop_t* ps_lp_l2 = (loop_t*) scp_psloop_dl(&bodies[edge_id][i],
2);
if (ps_lp_l2 == NULL) {
bodies[edge_id][i].dc_flag_l2 = DC_UNCLEAR;
} else {
int distance = loop_dist(inner_lp, ps_lp_l2);
if (distance < 0) {
printf("BUGGG!!!!!\n");
exit(1);
}
int ps_ctx = dstContext & ((1 << distance) - 1);
if (ps_ctx == 0)
bodies[edge_id][i].dc_flag_l2 = DC_MISS;
else
bodies[edge_id][i].dc_flag_l2 = DC_HIT;
}
}
} else if (iType == INST_STORE) {
bodies[edge_id][i].dc_flag = DC_STORE;
if (enable_scp_dl2cache || enable_ul2cache)
bodies[edge_id][i].dc_flag_l2 = DC_STORE;
} else {
bodies[edge_id][i].dc_flag = DC_HIT;
if (enable_scp_dl2cache || enable_ul2cache)
bodies[edge_id][i].dc_flag_l2 = DC_HIT;
}
}
}
static void set_prolog_data_cache_hitmiss(int edge_id, mas_inst_t* code,
int num_inst, int contextMask) {
if (num_inst <= 0)
return;
int context = contextMask;
int dst = tcfg_edges[edge_id]->src->id;
int src = code[num_inst - 1].bbi_id;
//printf("EDGE %d_%d context %d:\n", src, dst, contextMask);
int i;
for (i = num_inst - 1; i >= 0; i--) {
src = code[i].bbi_id;
int src_ctx_length = numberOfLoop[src] - 1;
int dst_ctx_length = numberOfLoop[dst] - 1;
context = get_context_backward(context, src_ctx_length, dst_ctx_length);
// printf("0x%x bbi_id:%d ctx:%d", code[i].inst->addr, code[i].bbi_id,
// context);
int iType = inst_type(code[i].inst);
if (iType == INST_LOAD) {
loop_t* lp = loop_map[src];
loop_t* ps_lp = (loop_t*) scp_psloop_dl(&code[i], 1);
if (ps_lp == NULL) {
code[i].dc_flag = DC_UNCLEAR;
} else {
int distantce = loop_dist(ps_lp, lp);
if (distantce < 0) {
printf("BUGGG\n");
exit(1);
}
int ps_ctx = context & ((1 << distantce) - 1);
if (ps_ctx == 0)
code[i].dc_flag = DC_MISS;
else
code[i].dc_flag = DC_HIT;
}
if (enable_scp_dl2cache || enable_ul2cache) {
loop_t* ps_lp_l2 = (loop_t*) scp_psloop_dl(&code[i], 2);
if (ps_lp_l2 == NULL) {
code[i].dc_flag_l2 = DC_UNCLEAR;
} else {
int distance = loop_dist(lp, ps_lp_l2);
if (distance < 0) {
printf("BUGGGG\n");
exit(1);
}
int ps_ctx = context & ((1 << distance) - 1);
if (ps_ctx == 0)
code[i].dc_flag_l2 = DC_MISS;
else
code[i].dc_flag_l2 = DC_HIT;
}
}
} else if (iType == INST_STORE) {
code[i].dc_flag = DC_STORE;
if (enable_scp_dl2cache || enable_ul2cache)
code[i].dc_flag_l2 = DC_STORE;
} else {
code[i].dc_flag = DC_HIT;
if (enable_scp_dl2cache || enable_ul2cache)
code[i].dc_flag_l2 = DC_STORE;
}
dst = src;
// printf(" dc_flag: %d\n", code[i].dc_flag);
}
}
static void set_epilog_data_cache_hitmiss(int edge_id, mas_inst_t* code,
int num_inst, int contextMask) {
if (num_inst <= 0)
return;
tcfg_node_t* src_node = tcfg_edges[edge_id]->src;
int src_id = src_node->id;
int src_ctx_length = numberOfLoop[src_id] - 1;
tcfg_node_t* dst_node = tcfg_edges[edge_id]->dst;
int dst_id = dst_node->id;
int dst_ctx_length = numberOfLoop[dst_id] - 1;
int context = get_context_forward(contextMask, src_ctx_length,
dst_ctx_length);
src_id = dst_id;
int i;
for (i = 0; i < num_inst; i++) {
dst_id = code[i].bbi_id;
src_ctx_length = numberOfLoop[src_id] - 1;
dst_ctx_length = numberOfLoop[dst_id] - 1;
context = get_context_forward(context, src_ctx_length, dst_ctx_length);
int iType = inst_type(code[i].inst);
if (iType == INST_LOAD) {
loop_t* lp = loop_map[dst_id];
loop_t* ps_lp = (loop_t*) scp_psloop_dl(&code[i], 1);
if (ps_lp == NULL) {
code[i].dc_flag = DC_UNCLEAR;
} else {
int distance = loop_dist(ps_lp, lp);
if (distance < 0) {
printf("BUGGGG\n");
exit(1);
}
int ps_ctx = context & ((1 << distance) - 1);
if (ps_ctx == 0)
code[i].dc_flag = DC_MISS;
else
code[i].dc_flag = DC_HIT;
}
if (enable_scp_dl2cache || enable_ul2cache) {
loop_t* ps_lp_l2 = (loop_t*) scp_psloop_dl(&code[i], 2);
if (ps_lp_l2 == NULL) {
code[i].dc_flag_l2 = DC_UNCLEAR;
} else {
int distance = loop_dist(lp, ps_lp_l2);
if (distance < 0) {
printf("BUGGGG\n");
exit(1);
}
int ps_ctx = context & ((1 << distance) - 1);
if (ps_ctx == 0)
code[i].dc_flag_l2 = DC_MISS;
else
code[i].dc_flag_l2 = DC_HIT;
}
}
} else if (iType == INST_STORE) {
code[i].dc_flag = DC_STORE;
if (enable_scp_dl2cache || enable_ul2cache)
code[i].dc_flag_l2 = DC_STORE;
} else {
code[i].dc_flag = DC_HIT;
if (enable_scp_dl2cache || enable_ul2cache)
code[i].dc_flag_l2 = DC_HIT;
}
src_id = dst_id;
}
}
static void
init_pa(void)
{
prolog_size = pipe_ibuf_size + pipe_iwin_size;
}
static void
alloc_est_units(void)
{
int i, num_hm;
cpred_times = (int **) calloc(num_tcfg_edges, sizeof(int *));
mpred_times = (int **) calloc(num_tcfg_edges, sizeof(int *));
extend_cpred_times = (int ***) calloc(num_tcfg_edges, sizeof(int**));
numberOfLoop = (int*) calloc(num_tcfg_nodes, sizeof(int*));
numberofContext = (int*) calloc(num_tcfg_nodes, sizeof(int*));
CHECK_MEM(cpred_times);
CHECK_MEM(mpred_times);
for (i = 0; i < num_tcfg_nodes; i++) {
loop_t* lp = (loop_t*) loop_map[tcfg[i]->id];
numberOfLoop[i] = 0;
while (lp != NULL) {
numberOfLoop[i]++;
lp = lp->parent;
}
numberofContext[i] = (1 << (numberOfLoop[i] - 1));
}
start_time = 0;
for (i = 0; i < num_tcfg_edges; i++) {
num_hm = 1;
cpred_times[i] = (int *) calloc(num_hm, sizeof(int));
CHECK_MEM(cpred_times);
if (cond_bbi(tcfg_edges[i]->src)) {
mpred_times[i] = (int *) calloc(num_hm, sizeof(int));
CHECK_MEM(mpred_times);
}
int size = numberofContext[tcfg_edges[i]->src->id];
if (enable_scp_dcache == 0)
size = 1;
//num_ex_cpred_times[i] = size*num_hm;
extend_cpred_times[i] = (int**) calloc(size, sizeof(int*));
int v;
for (v = 0; v < numberofContext[tcfg_edges[i]->src->id]; v++) {
extend_cpred_times[i][v] = (int*) calloc(num_hm, sizeof(int));
}
}
}
// edge_id: tcfg edge id;
// hm_id: id in the set of hit/miss combinations of tcfg_edge[edge_id]->dst
// bp: BP_CORRECT or BP_MISPRED
static void
ctx_unit_time(int edge_id, int bp, int contextMask)
{