-
Notifications
You must be signed in to change notification settings - Fork 10
/
Copy pathbpred.c
1645 lines (1453 loc) · 56 KB
/
bpred.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
/* bpred.c - branch predictor routines */
/* SimpleScalar(TM) Tool Suite
* Copyright (C) 1994-2003 by Todd M. Austin, Ph.D. and SimpleScalar, LLC.
* All Rights Reserved.
*
* THIS IS A LEGAL DOCUMENT, BY USING SIMPLESCALAR,
* YOU ARE AGREEING TO THESE TERMS AND CONDITIONS.
*
* No portion of this work may be used by any commercial entity, or for any
* commercial purpose, without the prior, written permission of SimpleScalar,
* LLC ([email protected]). Nonprofit and noncommercial use is permitted
* as described below.
*
* 1. SimpleScalar is provided AS IS, with no warranty of any kind, express
* or implied. The user of the program accepts full responsibility for the
* application of the program and the use of any results.
*
* 2. Nonprofit and noncommercial use is encouraged. SimpleScalar may be
* downloaded, compiled, executed, copied, and modified solely for nonprofit,
* educational, noncommercial research, and noncommercial scholarship
* purposes provided that this notice in its entirety accompanies all copies.
* Copies of the modified software can be delivered to persons who use it
* solely for nonprofit, educational, noncommercial research, and
* noncommercial scholarship purposes provided that this notice in its
* entirety accompanies all copies.
*
* 3. ALL COMMERCIAL USE, AND ALL USE BY FOR PROFIT ENTITIES, IS EXPRESSLY
* PROHIBITED WITHOUT A LICENSE FROM SIMPLESCALAR, LLC ([email protected]).
*
* 4. No nonprofit user may place any restrictions on the use of this software,
* including as modified by the user, by any other authorized user.
*
* 5. Noncommercial and nonprofit users may distribute copies of SimpleScalar
* in compiled or executable form as set forth in Section 2, provided that
* either: (A) it is accompanied by the corresponding machine-readable source
* code, or (B) it is accompanied by a written offer, with no time limit, to
* give anyone a machine-readable copy of the corresponding source code in
* return for reimbursement of the cost of distribution. This written offer
* must permit verbatim duplication by anyone, or (C) it is distributed by
* someone who received only the executable form, and is accompanied by a
* copy of the written offer of source code.
*
* 6. SimpleScalar was developed by Todd M. Austin, Ph.D. The tool suite is
* currently maintained by SimpleScalar LLC ([email protected]). US Mail:
* 2395 Timbercrest Court, Ann Arbor, MI 48105.
*
* Copyright (C) 1994-2003 by Todd M. Austin, Ph.D. and SimpleScalar, LLC.
*/
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <assert.h>
#include "host.h"
#include "misc.h"
#include "machine.h"
#include "bpred.h"
/* turn this on to enable the SimpleScalar 2.0 RAS bug */
/* #define RAS_BUG_COMPATIBLE */
/* create a branch predictor */
struct bpred_t * /* branch predictory instance */
bpred_create(enum bpred_class class, /* type of predictor to create */
unsigned int bimod_size, /* bimod table size */
unsigned int l1size, /* 2lev l1 table size */
unsigned int l2size, /* 2lev l2 table size */
unsigned int meta_size, /* meta table size */
unsigned int shift_width, /* history register width */
unsigned int xor, /* history xor address flag */
unsigned int btb_sets, /* number of sets in BTB */
unsigned int btb_assoc, /* BTB associativity */
unsigned int retstack_size) /* num entries in ret-addr stack */
{
struct bpred_t *pred;
if (!(pred = calloc(1, sizeof(struct bpred_t))))
fatal("out of virtual memory");
pred->class = class;
// printf("class: %s\n", class);
switch (class) {
case BPredComb:
/* bimodal component */
pred->dirpred.bimod =
bpred_dir_create(BPred2bit, bimod_size, 0, 0, 0, 0);
/* 2-level component */
pred->dirpred.twolev =
bpred_dir_create(BPred2Level, l1size, l2size, shift_width, xor, 0);
/* metapredictor component */
pred->dirpred.meta =
bpred_dir_create(BPred2bit, meta_size, 0, 0, 0, 0);
break;
case BPred2Level:
pred->dirpred.twolev =
bpred_dir_create(class, l1size, l2size, shift_width, xor, 0);
break;
case BPredGehl: /* should be/default to 1, 16384, <N/A>, 0 */
pred->dirpred.gehl0 = bpred_dir_create(BPred4bit, l1size, l2size, shift_width, xor, 1); // should be bimod instead of 2lev
// printf("ADDRESS 0: %d\n", pred->dirpred.gehl0);
pred->dirpred.gehl1 = bpred_dir_create(BPred2Level, l1size, l2size, 2, xor, 1);
// printf("ADDRESS 1: %d\n", pred->dirpred.gehl1);
pred->dirpred.gehl2 = bpred_dir_create(BPred2Level, l1size, l2size, 4, xor, 1);
// printf("ADDRESS 2: %d\n", pred->dirpred.gehl2);
pred->dirpred.gehl3 = bpred_dir_create(BPred2Level, l1size, l2size, 8, xor, 1);
// printf("ADDRESS 3: %d\n", pred->dirpred.gehl3);
pred->dirpred.gehl4 = bpred_dir_create(BPred2Level, l1size, l2size, 16, xor, 1);
pred->dirpred.gehl5 = bpred_dir_create(BPred2Level, l1size, l2size, 32, xor, 1);
pred->dirpred.gehl6 = bpred_dir_create(BPred2Level, l1size, l2size, 64, xor, 1);
pred->dirpred.gehl7 = bpred_dir_create(BPred2Level, l1size, l2size, 128, xor, 1);
pred->dirpred.gehl1->config.two.is_gehl = 1;
pred->dirpred.gehl2->config.two.is_gehl = 1;
pred->dirpred.gehl3->config.two.is_gehl = 1;
pred->dirpred.gehl4->config.two.is_gehl = 1;
pred->dirpred.gehl5->config.two.is_gehl = 1;
pred->dirpred.gehl6->config.two.is_gehl = 1;
pred->dirpred.gehl7->config.two.is_gehl = 1;
break;
case BPredPercept: // Maybe you'd prefer BPredPerceptRonWeasley?
pred->dirpred.percept = bpred_dir_create(class, l1size, l2size, shift_width, xor, 0); /* (class, bhtsize, percepttablesize, hist_width, xor) */
// pred->dirpred.percept->config.percept.weight_width = pred->dirpred.percept->config.percept.hist_width + 1;
break;
case BPred6bit:
case BPred5bit:
case BPred4bit:
case BPred3bit:
case BPred2bit:
case BPred1bit:
pred->dirpred.bimod =
bpred_dir_create(class, bimod_size, 0, 0, 0, 0);
break;
case BPredTaken:
case BPredNotTaken:
/* no other state */
break;
default:
panic("bogus predictor class");
}
/* allocate ret-addr stack */
switch (class) {
case BPredGehl:
case BPredPercept:
case BPredComb:
case BPred2Level:
case BPred6bit:
case BPred5bit:
case BPred4bit:
case BPred3bit:
case BPred2bit:
case BPred1bit:
{
int i;
/* allocate BTB */
if (!btb_sets || (btb_sets & (btb_sets-1)) != 0)
fatal("number of BTB sets must be non-zero and a power of two");
if (!btb_assoc || (btb_assoc & (btb_assoc-1)) != 0)
fatal("BTB associativity must be non-zero and a power of two");
if (!(pred->btb.btb_data = calloc(btb_sets * btb_assoc,
sizeof(struct bpred_btb_ent_t))))
fatal("cannot allocate BTB");
pred->btb.sets = btb_sets;
pred->btb.assoc = btb_assoc;
if (pred->btb.assoc > 1)
for (i=0; i < (pred->btb.assoc*pred->btb.sets); i++)
{
if (i % pred->btb.assoc != pred->btb.assoc - 1)
pred->btb.btb_data[i].next = &pred->btb.btb_data[i+1];
else
pred->btb.btb_data[i].next = NULL;
if (i % pred->btb.assoc != pred->btb.assoc - 1)
pred->btb.btb_data[i+1].prev = &pred->btb.btb_data[i];
}
/* allocate retstack */
if ((retstack_size & (retstack_size-1)) != 0)
fatal("Return-address-stack size must be zero or a power of two");
pred->retstack.size = retstack_size;
if (retstack_size)
if (!(pred->retstack.stack = calloc(retstack_size,
sizeof(struct bpred_btb_ent_t))))
fatal("cannot allocate return-address-stack");
pred->retstack.tos = retstack_size - 1;
break;
}
case BPredTaken:
case BPredNotTaken:
/* no other state */
break;
default:
panic("bogus predictor class");
}
return pred;
}
/* create a branch direction predictor */
struct bpred_dir_t * /* branch direction predictor instance */
bpred_dir_create (
enum bpred_class class, /* type of predictor to create */
unsigned int l1size, /* level-1 table size */
unsigned int l2size, /* level-2 table size (if relevant) */
unsigned int shift_width, /* history register width */
unsigned int xor, /* history xor address flag */
unsigned int flag_gehl) /* gehl flag */
{
struct bpred_dir_t *pred_dir;
unsigned int cnt;
int flipflop;
if (!(pred_dir = calloc(1, sizeof(struct bpred_dir_t))))
fatal("out of virtual memory");
pred_dir->class = class;
cnt = -1;
switch (class) {
case BPred2Level:
{
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("level-1 size, `%d', must be non-zero and a power of two",
l1size);
pred_dir->config.two.l1size = l1size;
if (!l2size || (l2size & (l2size-1)) != 0)
fatal("level-2 size, `%d', must be non-zero and a power of two",
l2size);
pred_dir->config.two.l2size = l2size;
if (!shift_width || shift_width > 200)
fatal("shift register width, `%d', must be non-zero and positive",
shift_width);
pred_dir->config.two.shift_width = shift_width;
pred_dir->config.two.xor = xor;
pred_dir->config.two.shiftregs = calloc(l1size, sizeof(int));
if (!pred_dir->config.two.shiftregs)
fatal("cannot allocate shift register table");
pred_dir->config.two.l2table = calloc(l2size, sizeof(unsigned char));
if (!pred_dir->config.two.l2table)
fatal("cannot allocate second level table");
if (flag_gehl == 1) {
// printf("111111111111\n");
pred_dir->config.two.l2table_gehl = calloc(l2size, sizeof(signed char));
if (!pred_dir->config.two.l2table_gehl)
fatal("cannot allocate second level gehl table");
}
/* initialize counters to weakly this-or-that */
flipflop = 1;
for (cnt = 0; cnt < l2size; cnt++)
{
pred_dir->config.two.l2table[cnt] = flipflop;
flipflop = 3 - flipflop;
}
break;
}
case BPredPercept:
{
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("level-1 history table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.percept.bhtsize = l1size;
if (!l2size || (l2size & (l2size-1)) != 0)
fatal("level-2 perceptron table size, `%d', must be non-zero and a power of two", l2size);
pred_dir->config.percept.percepttablesize = l2size;
if (!shift_width || shift_width > 200)
fatal("shift history register width, `%d', must be non-zero and positive", shift_width);
pred_dir->config.percept.hist_width = shift_width;
pred_dir->config.percept.weight_width = shift_width + 1;
pred_dir->config.percept.xor = xor;
pred_dir->config.percept.histregs = calloc(l1size, sizeof(int)); /* times 5 for long history */
if (!pred_dir->config.percept.histregs)
fatal("cannot allocate shift register history table");
int rows = l2size;
int cols = shift_width + 1;
int i, j;
pred_dir->config.percept.percepttable = (signed char **)calloc(rows, sizeof(signed char *));
if (!pred_dir->config.percept.percepttable)
fatal("cannot allocate second level perceptron table");
for (i=0; i<rows; i++) {
pred_dir->config.percept.percepttable[i] = (signed char *)calloc(cols, sizeof(signed char));
if (!pred_dir->config.percept.percepttable[i])
fatal("cannot allocate second level perceptron table entry");
}
/* initialize perceptron weights to 0 */
for (i = 0; i < rows; i++)
for (j = 0; j < cols; j++) {
pred_dir->config.percept.percepttable[i][j] = 0;
}
break;
}
case BPred2bit:
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("2bit table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.bimod.size = l1size;
if (!(pred_dir->config.bimod.table = calloc(l1size, sizeof(unsigned char))))
fatal("cannot allocate 2bit storage");
/* initialize counters to weakly this-or-that */
flipflop = 1;
for (cnt = 0; cnt < l1size; cnt++) {
pred_dir->config.bimod.table[cnt] = flipflop;
flipflop = 3 - flipflop;
}
break;
case BPred1bit:
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("1bit table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.bimod.size = l1size;
if (!(pred_dir->config.bimod.table = calloc(l1size, sizeof(unsigned char))))
fatal("cannot allocate 1bit storage");
/* initialize counters to this-or-that */
flipflop = 1;
for (cnt = 0; cnt < l1size; cnt++) {
pred_dir->config.bimod.table[cnt] = flipflop;
flipflop = 1 - flipflop;
}
break;
case BPred3bit:
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("3bit table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.bimod.size = l1size;
if (!(pred_dir->config.bimod.table = calloc(l1size, sizeof(unsigned char))))
fatal("cannot allocate 3bit storage");
/* initialize counters to weakly this-or-that */
flipflop = 3;
for (cnt = 0; cnt < l1size; cnt++) {
pred_dir->config.bimod.table[cnt] = flipflop;
flipflop = 7 - flipflop;
}
break;
case BPred4bit:
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("4bit table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.bimod.size = l1size;
if (!(pred_dir->config.bimod.table = calloc(l1size, sizeof(unsigned char))))
fatal("cannot allocate 4bit storage");
/* initialize counters to weakly this-or-that */
flipflop = 7;
for (cnt = 0; cnt < l1size; cnt++) {
pred_dir->config.bimod.table[cnt] = flipflop;
flipflop = 15 - flipflop;
}
if (pred_dir->config.two.is_gehl == 1) {
pred_dir->config.bimod.gehl_table = calloc(l1size, sizeof(signed char));
if (!pred_dir->config.bimod.gehl_table)
fatal("cannot allocate bimodal gehl table");
}
break;
case BPred5bit:
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("5bit table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.bimod.size = l1size;
if (!(pred_dir->config.bimod.table = calloc(l1size, sizeof(unsigned char))))
fatal("cannot allocate 5bit storage");
/* initialize counters to weakly this-or-that */
flipflop = 15;
for (cnt = 0; cnt < l1size; cnt++) {
pred_dir->config.bimod.table[cnt] = flipflop;
flipflop = 31 - flipflop;
}
break;
case BPred6bit:
if (!l1size || (l1size & (l1size-1)) != 0)
fatal("6bit table size, `%d', must be non-zero and a power of two", l1size);
pred_dir->config.bimod.size = l1size;
if (!(pred_dir->config.bimod.table = calloc(l1size, sizeof(unsigned char))))
fatal("cannot allocate 6bit storage");
/* initialize counters to weakly this-or-that */
flipflop = 31;
for (cnt = 0; cnt < l1size; cnt++) {
pred_dir->config.bimod.table[cnt] = flipflop;
flipflop = 63 - flipflop;
}
break;
case BPredTaken:
case BPredNotTaken:
/* no other state */
break;
default:
panic("bogus branch direction predictor class");
}
return pred_dir;
}
/* print branch direction predictor configuration */
void
bpred_dir_config(
struct bpred_dir_t *pred_dir, /* branch direction predictor instance */
char name[], /* predictor name */
FILE *stream) /* output stream */
{
switch (pred_dir->class) {
case BPred2Level:
fprintf(stream,
"pred_dir: %s: 2-lvl: %d l1-sz, %d bits/ent, %s xor, %d l2-sz, direct-mapped\n",
name, pred_dir->config.two.l1size, pred_dir->config.two.shift_width,
pred_dir->config.two.xor ? "" : "no", pred_dir->config.two.l2size);
break;
case BPredPercept:
fprintf(stream,
"pred_dir: %s: perceptron: %d bht-sz, %d hist-bits/ent, %s xor, %d percept-table-sz, direct-mapped\n",
name, pred_dir->config.percept.bhtsize, pred_dir->config.percept.hist_width,
pred_dir->config.percept.xor ? "" : "no", pred_dir->config.percept.percepttablesize);
break;
case BPred6bit:
fprintf(stream, "pred_dir: %s: 6-bit: %d entries, direct-mapped\n",
name, pred_dir->config.bimod.size);
break;
case BPred5bit:
fprintf(stream, "pred_dir: %s: 5-bit: %d entries, direct-mapped\n",
name, pred_dir->config.bimod.size);
break;
case BPred4bit:
fprintf(stream, "pred_dir: %s: 4-bit: %d entries, direct-mapped\n",
name, pred_dir->config.bimod.size);
break;
case BPred3bit:
fprintf(stream, "pred_dir: %s: 3-bit: %d entries, direct-mapped\n",
name, pred_dir->config.bimod.size);
break;
case BPred2bit:
fprintf(stream, "pred_dir: %s: 2-bit: %d entries, direct-mapped\n",
name, pred_dir->config.bimod.size);
break;
case BPred1bit:
fprintf(stream, "pred_dir: %s: 1-bit: %d entries, direct-mapped\n",
name, pred_dir->config.bimod.size);
break;
case BPredTaken:
fprintf(stream, "pred_dir: %s: predict taken\n", name);
break;
case BPredNotTaken:
fprintf(stream, "pred_dir: %s: predict not taken\n", name);
break;
default:
panic("bogus branch direction predictor class");
}
}
/* print branch predictor configuration */
void
bpred_config(struct bpred_t *pred, /* branch predictor instance */
FILE *stream) /* output stream */
{
switch (pred->class) {
case BPredComb:
bpred_dir_config (pred->dirpred.bimod, "bimod", stream);
bpred_dir_config (pred->dirpred.twolev, "2lev", stream);
bpred_dir_config (pred->dirpred.meta, "meta", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPredPercept:
bpred_dir_config (pred->dirpred.percept, "percept", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred2Level:
bpred_dir_config (pred->dirpred.twolev, "2lev", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPredGehl: // if (pred_dir->config.two.is_gehl == 1)
// printf("222222222222\n");
bpred_dir_config (pred->dirpred.gehl0, "4bit", stream); // CHANGE TO BIMOD
// printf("3333333333333\n");
bpred_dir_config (pred->dirpred.gehl1, "2lev_gehl", stream);
bpred_dir_config (pred->dirpred.gehl2, "2lev_gehl", stream);
bpred_dir_config (pred->dirpred.gehl3, "2lev_gehl", stream);
bpred_dir_config (pred->dirpred.gehl4, "2lev_gehl", stream);
bpred_dir_config (pred->dirpred.gehl5, "2lev_gehl", stream);
bpred_dir_config (pred->dirpred.gehl6, "2lev_gehl", stream);
bpred_dir_config (pred->dirpred.gehl7, "2lev_gehl", stream);
// printf("444444444444444\n");
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred6bit:
bpred_dir_config (pred->dirpred.bimod, "6bit", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred5bit:
bpred_dir_config (pred->dirpred.bimod, "5bit", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred4bit:
bpred_dir_config (pred->dirpred.bimod, "4bit", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred3bit:
bpred_dir_config (pred->dirpred.bimod, "3bit", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred2bit:
bpred_dir_config (pred->dirpred.bimod, "bimod", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPred1bit:
bpred_dir_config (pred->dirpred.bimod, "1bit", stream);
fprintf(stream, "btb: %d sets x %d associativity",
pred->btb.sets, pred->btb.assoc);
fprintf(stream, "ret_stack: %d entries", pred->retstack.size);
break;
case BPredTaken:
bpred_dir_config (pred->dirpred.bimod, "taken", stream);
break;
case BPredNotTaken:
bpred_dir_config (pred->dirpred.bimod, "nottaken", stream);
break;
default:
panic("bogus branch predictor class");
}
}
/* print predictor stats */
void
bpred_stats(struct bpred_t *pred, /* branch predictor instance */
FILE *stream) /* output stream */
{
fprintf(stream, "pred: addr-prediction rate = %f\n",
(double)pred->addr_hits/(double)(pred->addr_hits+pred->misses));
fprintf(stream, "pred: dir-prediction rate = %f\n",
(double)pred->dir_hits/(double)(pred->dir_hits+pred->misses));
}
/* register branch predictor stats */
void
bpred_reg_stats(struct bpred_t *pred, /* branch predictor instance */
struct stat_sdb_t *sdb) /* stats database */
{
char buf[512], buf1[512], *name;
/* get a name for this predictor */
switch (pred->class)
{
case BPredComb:
name = "bpred_comb";
break;
case BPredPercept:
name = "bpred_percept";
break;
case BPred2Level:
name = "bpred_2lev";
break;
case BPredGehl:
name = "bpred_gehl";
break;
case BPred6bit:
name = "bpred_6bit";
break;
case BPred5bit:
name = "bpred_5bit";
break;
case BPred4bit:
name = "bpred_4bit";
break;
case BPred3bit:
name = "bpred_3bit";
break;
case BPred2bit:
name = "bpred_bimod";
break;
case BPred1bit:
name = "bpred_1bit";
break;
case BPredTaken:
name = "bpred_taken";
break;
case BPredNotTaken:
name = "bpred_nottaken";
break;
default:
panic("bogus branch predictor class");
}
sprintf(buf, "%s.lookups", name);
stat_reg_counter(sdb, buf, "total number of bpred lookups",
&pred->lookups, 0, NULL);
sprintf(buf, "%s.updates", name);
sprintf(buf1, "%s.dir_hits + %s.misses", name, name);
stat_reg_formula(sdb, buf, "total number of updates", buf1, "%12.0f");
sprintf(buf, "%s.addr_hits", name);
stat_reg_counter(sdb, buf, "total number of address-predicted hits",
&pred->addr_hits, 0, NULL);
sprintf(buf, "%s.dir_hits", name);
stat_reg_counter(sdb, buf,
"total number of direction-predicted hits "
"(includes addr-hits)",
&pred->dir_hits, 0, NULL);
if (pred->class == BPredComb)
{
sprintf(buf, "%s.used_bimod", name);
stat_reg_counter(sdb, buf,
"total number of bimodal predictions used",
&pred->used_bimod, 0, NULL);
sprintf(buf, "%s.used_2lev", name);
stat_reg_counter(sdb, buf,
"total number of 2-level predictions used",
&pred->used_2lev, 0, NULL);
}
sprintf(buf, "%s.misses", name);
stat_reg_counter(sdb, buf, "total number of misses", &pred->misses, 0, NULL);
sprintf(buf, "%s.jr_hits", name);
stat_reg_counter(sdb, buf,
"total number of address-predicted hits for JR's",
&pred->jr_hits, 0, NULL);
sprintf(buf, "%s.jr_seen", name);
stat_reg_counter(sdb, buf,
"total number of JR's seen",
&pred->jr_seen, 0, NULL);
sprintf(buf, "%s.jr_non_ras_hits.PP", name);
stat_reg_counter(sdb, buf,
"total number of address-predicted hits for non-RAS JR's",
&pred->jr_non_ras_hits, 0, NULL);
sprintf(buf, "%s.jr_non_ras_seen.PP", name);
stat_reg_counter(sdb, buf,
"total number of non-RAS JR's seen",
&pred->jr_non_ras_seen, 0, NULL);
sprintf(buf, "%s.bpred_addr_rate", name);
sprintf(buf1, "%s.addr_hits / %s.updates", name, name);
stat_reg_formula(sdb, buf,
"branch address-prediction rate (i.e., addr-hits/updates)",
buf1, "%9.4f");
sprintf(buf, "%s.bpred_dir_rate", name);
sprintf(buf1, "%s.dir_hits / %s.updates", name, name);
stat_reg_formula(sdb, buf,
"branch direction-prediction rate (i.e., all-hits/updates)",
buf1, "%9.4f");
sprintf(buf, "%s.bpred_jr_rate", name);
sprintf(buf1, "%s.jr_hits / %s.jr_seen", name, name);
stat_reg_formula(sdb, buf,
"JR address-prediction rate (i.e., JR addr-hits/JRs seen)",
buf1, "%9.4f");
sprintf(buf, "%s.bpred_jr_non_ras_rate.PP", name);
sprintf(buf1, "%s.jr_non_ras_hits.PP / %s.jr_non_ras_seen.PP", name, name);
stat_reg_formula(sdb, buf,
"non-RAS JR addr-pred rate (ie, non-RAS JR hits/JRs seen)",
buf1, "%9.4f");
sprintf(buf, "%s.retstack_pushes", name);
stat_reg_counter(sdb, buf,
"total number of address pushed onto ret-addr stack",
&pred->retstack_pushes, 0, NULL);
sprintf(buf, "%s.retstack_pops", name);
stat_reg_counter(sdb, buf,
"total number of address popped off of ret-addr stack",
&pred->retstack_pops, 0, NULL);
sprintf(buf, "%s.used_ras.PP", name);
stat_reg_counter(sdb, buf,
"total number of RAS predictions used",
&pred->used_ras, 0, NULL);
sprintf(buf, "%s.ras_hits.PP", name);
stat_reg_counter(sdb, buf,
"total number of RAS hits",
&pred->ras_hits, 0, NULL);
sprintf(buf, "%s.ras_rate.PP", name);
sprintf(buf1, "%s.ras_hits.PP / %s.used_ras.PP", name, name);
stat_reg_formula(sdb, buf,
"RAS prediction rate (i.e., RAS hits/used RAS)",
buf1, "%9.4f");
}
void
bpred_after_priming(struct bpred_t *bpred)
{
if (bpred == NULL)
return;
bpred->lookups = 0;
bpred->addr_hits = 0;
bpred->dir_hits = 0;
bpred->used_ras = 0;
bpred->used_bimod = 0;
bpred->used_2lev = 0;
bpred->jr_hits = 0;
bpred->jr_seen = 0;
bpred->misses = 0;
bpred->retstack_pops = 0;
bpred->retstack_pushes = 0;
bpred->ras_hits = 0;
}
#define BIMOD_HASH(PRED, ADDR) \
((((ADDR) >> 19) ^ ((ADDR) >> MD_BR_SHIFT)) & ((PRED)->config.bimod.size-1))
/* was: ((baddr >> 16) ^ baddr) & (pred->dirpred.bimod.size-1) */
#define PERCEPT_HASH(PRED, ADDR) \
((((ADDR) >> 19) ^ ((ADDR) >> MD_BR_SHIFT)) & ((PRED)->config.percept.percepttablesize-1))
/* predicts a branch direction */
char * /* pointer to counter */
bpred_dir_lookup(struct bpred_dir_t *pred_dir, /* branch dir predictor inst */
md_addr_t baddr) /* branch address */
{
unsigned char *p = NULL;
signed char *p2 = NULL;
/* Except for jumps, get a pointer to direction-prediction bits */
switch (pred_dir->class) {
case BPred2Level:
{
int l1index, l2index;
/* traverse 2-level tables */
l1index = (baddr >> MD_BR_SHIFT) & (pred_dir->config.two.l1size - 1);
l2index = pred_dir->config.two.shiftregs[l1index];
if (pred_dir->config.two.xor) {
#if 1
/* this L2 index computation is more "compatible" to McFarling's
verison of it, i.e., if the PC xor address component is only
part of the index, take the lower order address bits for the
other part of the index, rather than the higher order ones */
l2index = (((l2index ^ (baddr >> MD_BR_SHIFT)) & ((1 << pred_dir->config.two.shift_width) - 1)) | ((baddr >> MD_BR_SHIFT) << pred_dir->config.two.shift_width));
#else
l2index = l2index ^ (baddr >> MD_BR_SHIFT);
#endif
}
else {
l2index = l2index | ((baddr >> MD_BR_SHIFT) << pred_dir->config.two.shift_width);
}
l2index = l2index & (pred_dir->config.two.l2size - 1);
/* get a pointer to prediction state information */
if (pred_dir->config.two.is_gehl) {
p2 = &pred_dir->config.two.l2table_gehl[l2index];
// printf("L2TABLE IS: %d\n", pred_dir->config.two.l2table_gehl);
// printf("index: %d\n", l2index);
// printf("P2 IS: %d\n", p2);
// printf("P2 IS: %d\n", &p2);
return (char *)p2;
break;
}
p = &pred_dir->config.two.l2table[l2index];
}
break;
case BPredPercept:
p2 = pred_dir->config.percept.percepttable[PERCEPT_HASH(pred_dir, baddr)];
return (char *)p2;
break;
case BPred6bit:
case BPred5bit:
case BPred4bit:
if (pred_dir->config.two.is_gehl) {
// printf("555555555555555\n");
p2 = &pred_dir->config.bimod.gehl_table[BIMOD_HASH(pred_dir, baddr)];
// printf("6666666666666\n");
return (char *)p2;
break;
}
case BPred3bit:
case BPred2bit:
case BPred1bit:
p = &pred_dir->config.bimod.table[BIMOD_HASH(pred_dir, baddr)];
break;
case BPredTaken:
case BPredNotTaken:
break;
default:
panic("bogus branch direction predictor class");
}
return (char *)p;
}
/* probe a predictor for a next fetch address, the predictor is probed
with branch address BADDR, the branch target is BTARGET (used for
static predictors), and OP is the instruction opcode (used to simulate
predecode bits; a pointer to the predictor state entry (or null for jumps)
is returned in *DIR_UPDATE_PTR (used for updating predictor state),
and the non-speculative top-of-stack is returned in stack_recover_idx
(used for recovering ret-addr stack after mis-predict). */
md_addr_t /* predicted branch target addr */
bpred_lookup(struct bpred_t *pred, /* branch predictor instance */
md_addr_t baddr, /* branch address */
md_addr_t btarget, /* branch target if taken */
enum md_opcode op, /* opcode of instruction */
int is_call, /* non-zero if inst is fn call */
int is_return, /* non-zero if inst is fn return */
struct bpred_update_t *dir_update_ptr, /* pred state pointer */
int *stack_recover_idx) /* Non-speculative top-of-stack;
* used on mispredict recovery */
{
struct bpred_btb_ent_t *pbtb = NULL;
int index, i;
if (!dir_update_ptr)
panic("no bpred update record");
/* if this is not a branch, return not-taken */
if (!(MD_OP_FLAGS(op) & F_CTRL))
return 0;
pred->lookups++;
dir_update_ptr->dir.ras = FALSE;
dir_update_ptr->pdir1 = NULL;
dir_update_ptr->pdir2 = NULL;
dir_update_ptr->pmeta = NULL;
dir_update_ptr->input_snapshot = NULL;
dir_update_ptr->pdirgehl0 = NULL;
dir_update_ptr->pdirgehl1 = NULL;
dir_update_ptr->pdirgehl2 = NULL;
dir_update_ptr->pdirgehl3 = NULL;
dir_update_ptr->pdirgehl4 = NULL;
dir_update_ptr->pdirgehl5 = NULL;
dir_update_ptr->pdirgehl6 = NULL;
dir_update_ptr->pdirgehl7 = NULL;
/* Except for jumps, get a pointer to direction-prediction bits */
switch (pred->class) {
case BPredComb:
if ((MD_OP_FLAGS(op) & (F_CTRL|F_UNCOND)) != (F_CTRL|F_UNCOND))
{
char *bimod, *twolev, *meta;
bimod = bpred_dir_lookup (pred->dirpred.bimod, baddr);
twolev = bpred_dir_lookup (pred->dirpred.twolev, baddr);
meta = bpred_dir_lookup (pred->dirpred.meta, baddr);
dir_update_ptr->pmeta = meta;
dir_update_ptr->dir.meta = (*meta >= 2);
dir_update_ptr->dir.bimod = (*bimod >= 2);
dir_update_ptr->dir.twolev = (*twolev >= 2);
if (*meta >= 2)
{
dir_update_ptr->pdir1 = twolev;
dir_update_ptr->pdir2 = bimod;
}
else
{
dir_update_ptr->pdir1 = bimod;
dir_update_ptr->pdir2 = twolev;
}
}
break;
case BPred2Level:
if ((MD_OP_FLAGS(op) & (F_CTRL|F_UNCOND)) != (F_CTRL|F_UNCOND))
{
dir_update_ptr->pdir1 = bpred_dir_lookup (pred->dirpred.twolev, baddr);
}
break;
case BPredPercept:
if ((MD_OP_FLAGS(op) & (F_CTRL|F_UNCOND)) != (F_CTRL|F_UNCOND))
{
dir_update_ptr->pdir1 = bpred_dir_lookup (pred->dirpred.percept, baddr);
int bhtindex, bhr_entry, input;
bhtindex = (baddr >> MD_BR_SHIFT) & (pred->dirpred.percept->config.percept.bhtsize - 1);
bhr_entry = pred->dirpred.percept->config.percept.histregs[bhtindex];
input = (bhr_entry << 1) | 1;
dir_update_ptr->input_snapshot = &input;
}
break;
case BPredGehl:
if ((MD_OP_FLAGS(op) & (F_CTRL|F_UNCOND)) != (F_CTRL|F_UNCOND))
{
// printf("7777777777777\n");
dir_update_ptr->pdirgehl0 = bpred_dir_lookup (pred->dirpred.gehl0, baddr); // BIMOD
dir_update_ptr->pdirgehl1 = bpred_dir_lookup (pred->dirpred.gehl1, baddr);
dir_update_ptr->pdirgehl2 = bpred_dir_lookup (pred->dirpred.gehl2, baddr);
dir_update_ptr->pdirgehl3 = bpred_dir_lookup (pred->dirpred.gehl3, baddr);
dir_update_ptr->pdirgehl4 = bpred_dir_lookup (pred->dirpred.gehl4, baddr);
dir_update_ptr->pdirgehl5 = bpred_dir_lookup (pred->dirpred.gehl5, baddr);
dir_update_ptr->pdirgehl6 = bpred_dir_lookup (pred->dirpred.gehl6, baddr);
dir_update_ptr->pdirgehl7 = bpred_dir_lookup (pred->dirpred.gehl7, baddr);
// printf("8888888888888888\n");
}
break;
case BPred6bit:
case BPred5bit:
case BPred4bit:
case BPred3bit:
case BPred2bit:
case BPred1bit:
if ((MD_OP_FLAGS(op) & (F_CTRL|F_UNCOND)) != (F_CTRL|F_UNCOND))
{
dir_update_ptr->pdir1 = bpred_dir_lookup (pred->dirpred.bimod, baddr);
}
break;
case BPredTaken:
return btarget;
case BPredNotTaken:
if ((MD_OP_FLAGS(op) & (F_CTRL|F_UNCOND)) != (F_CTRL|F_UNCOND))
{
return baddr + sizeof(md_inst_t);
}
else
{
return btarget;
}
default:
panic("bogus predictor class");
}
/*
* We have a stateful predictor, and have gotten a pointer into the
* direction predictor (except for jumps, for which the ptr is null)
*/
/* record pre-pop TOS; if this branch is executed speculatively
* and is squashed, we'll restore the TOS and hope the data
* wasn't corrupted in the meantime. */
if (pred->retstack.size)
*stack_recover_idx = pred->retstack.tos;
else
*stack_recover_idx = 0;
/* if this is a return, pop return-address stack */
if (is_return && pred->retstack.size)