forked from SEL4PROJ/chronos4.2
-
Notifications
You must be signed in to change notification settings - Fork 0
/
address.c
2005 lines (1806 loc) · 54.1 KB
/
address.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
/* Memory address analysis */
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdarg.h>
#include <assert.h>
#include "tcfg.h"
#include "address.h"
#include "loops.h"
#include "common.h"
#include "infeasible.h"
#include "symexec.h"
/* Transformed CFG */
extern tcfg_node_t** tcfg;
extern int num_tcfg_nodes;
/* Loop structures */
loop_t** loop_map;
/* The instruction set */
extern isa_t* isa;
#ifdef _DEBUG
static void dumpAddress(tcfg_node_t* bb);
#endif
static void updateSuccessorAloc(tcfg_node_t* bbi, int* change);
static int checkEquality(ric_p arg1, ric_p arg2);
FILE* aFile;
/* Analysis functions */
static void analyze_top(void);
static void analyze(tcfg_node_t* bbi);
static slist_p analyze_loop_top(loop_t* loop, int loop_id);
static void analyze_loop(tcfg_node_t* bbi, int loop_id);
static void joinMemoryAloc(abs_mem_p mem1, abs_mem_p* mem2);
/* Static variables used for analysis */
static int* analyzed;
static int* analyzed_loop;
/* Analysis count */
int count = 0;
/* For getting set of addresses from base offset addressing mode */
ric_p getAddrBaseOffset(de_inst_t* inst, int base, int offset, int opt)
{
ric_p* abs_reg = inst->abs_reg;
ric_p nAddr;
#ifdef _DEBUG
if(!abs_reg)
{
printf("Some problem of abstraction at instruction %x\n", inst->addr);
}
#endif
assert(abs_reg);
if(opt && inst->mod_addr)
{
#ifdef _DEBUG
printf("modified address = (0x%x,0x%x,0x%x)\n", inst->mod_addr->lower_bound,
inst->mod_addr->upper_bound, inst->mod_addr->stride);
#endif
return inst->mod_addr;
}
if(abs_reg[base])
{
nAddr = (ric_p)malloc(sizeof(ric_s));
#ifdef _DEBUG
printf("Base register (%d) value(%x) = %d\n", base, inst->addr,
abs_reg[base]->lower_bound);
#endif
nAddr->lower_bound = abs_reg[base]->lower_bound + offset;
nAddr->upper_bound = abs_reg[base]->upper_bound + offset;
/* FIXME: HACK HACK HACK */
if(base == REG_GLOBAL)
nAddr->stride = 0;
else
nAddr->stride = abs_reg[base]->stride;
return nAddr;
}
return NULL;
}
/* For getting set of addresses from base index addressing mode */
ric_p getAddrBaseIndex(de_inst_t* inst, int base, int index, int opt)
{
ric_p* abs_reg = inst->abs_reg;
ric_p nAddr;
#ifdef _DEBUG
if(!abs_reg)
{
printf("Some problem of abstraction at instruction %x\n", inst->addr);
}
#endif
assert(abs_reg);
if(opt && inst->mod_addr)
{
#ifdef _DEBUG
printf("modified address = (0x%x,0x%x,0x%x)\n", inst->mod_addr->lower_bound,
inst->mod_addr->upper_bound, inst->mod_addr->stride);
#endif
return inst->mod_addr;
}
if(abs_reg[base] && abs_reg[index])
{
nAddr = (ric_p)malloc(sizeof(ric_s));
nAddr->lower_bound = abs_reg[base]->lower_bound +
abs_reg[index]->lower_bound;
nAddr->upper_bound = abs_reg[base]->upper_bound +
abs_reg[index]->upper_bound;
nAddr->stride = gcd(abs_reg[base]->stride, abs_reg[index]->stride);
return nAddr;
}
return NULL;
}
/* Debugging related function */
#ifdef _DEBUG
static void dump(de_inst_t* inst, ric_p addr, FILE* fp)
{
fprintf(fp, "==========================================================\n");
fprintf(fp, "Instruction name = %s, Address = %x, Immediate = %d\n",
isa[inst->op_enum].name, inst->addr, inst->imm);
fprintf(fp, "==========================================================\n");
if(addr)
fprintf(fp, "Address = (0x%x,0x%x,0x%x)\n", addr->lower_bound, addr->upper_bound,
addr->stride);
else
fprintf(fp, "UNKNOWN\n");
}
/* Dump set of all addresses accessed */
static void dump_data_address()
{
tcfg_node_t* bbi;
de_inst_t* inst;
ric_p addr;
int i, j;
int rs, rt, d, imm, base, offset, index;
FILE* fp;
fp = fopen("address.dump", "w");
if(!fp)
fatal("Internal file opening failed");
for(i = 0; i < num_tcfg_nodes; i++)
{
inst = tcfg[i]->bb->code;
for(j = 0; j < tcfg[i]->bb->num_inst; j++)
{
/* For a memory load/store instruction find out the
* memory hit/miss classification from the abstract
* cache state */
if(isStoreInst(isa_name))
{
if(inst->num_in <= 2)
{
imm = inst->imm;
base = *(inst->in + 1);
addr = getAddrBaseOffset(inst, base, imm, 0);
dump(inst, addr, fp);
}
else if(inst->num_in == 3)
{
base = *(inst->in + 1);
index = *(inst->in + 2);
addr = getAddrBaseIndex(inst, base, index, 0);
dump(inst, addr, fp);
}
}
else if(isLoadInst(isa_name))
{
if(inst->num_in <= 1)
{
imm = inst->imm;
base = *(inst->in);
addr = getAddrBaseOffset(inst, base, imm, 0);
dump(inst, addr, fp);
}
else if(inst->num_in == 2)
{
base = *(inst->in);
index = *(inst->in + 1);
addr = getAddrBaseIndex(inst, base, index, 0);
dump(inst, addr, fp);
}
}
inst++;
}
}
fclose(fp);
}
void dump_mod_data_address()
{
tcfg_node_t* bbi;
de_inst_t* inst;
char* isa_name;
ric_p addr;
int i, j;
int rs, rt, d, imm, base, offset, index;
FILE* fp;
fp = fopen("address.dump", "a");
if(!fp)
fatal("Internal file opening failed");
for(i = 0; i < num_tcfg_nodes; i++)
{
inst = tcfg[i]->bb->code;
for(j = 0; j < tcfg[i]->bb->num_inst; j++)
{
if(inst->mod_addr)
{
fprintf(fp, "modified address at 0x%x = (0x%x,0x%x,0x%x)\n",
inst->r_addr,
inst->mod_addr->lower_bound,
inst->mod_addr->upper_bound,
inst->mod_addr->stride);
}
inst++;
}
}
fclose(fp);
}
/* Dump the memory status at each instruction */
static void dumpAlocStatus(tcfg_node_t* bbi, FILE* fp)
{
ric_p* reg = bbi->bb->in_abs_reg_value;
int num_regs;
abs_mem_p iter;
char l[20],u[20];
fprintf(fp,"\n****Printing Input information to the basic block****\n");
fprintf(fp,"*****Printing Abstract Register Values*****\n\n");
fprintf(fp, "Basic block start address = 0x%x, End address = 0x%x\n",
bbi->bb->sa, bbi->bb->sa + bbi->bb->size);
for(num_regs = 0; num_regs < MAX_NO_REGISTERS; num_regs++)
{
if(! reg[num_regs])
continue;
fprintf(fp, "Register %d::\n", num_regs);
if(reg[num_regs]->lower_bound == -INFINITY)
sprintf(l, "-inf");
else
sprintf(l, "%d", reg[num_regs]->lower_bound);
if(reg[num_regs]->upper_bound == INFINITY)
sprintf(u, "inf");
else
sprintf(u, "%d", reg[num_regs]->upper_bound);
fprintf(fp, "(%s,%s,%d)\n", l, u, reg[num_regs]->stride);
}
fprintf(fp,"\n*****End Printing Abstract Register Values*****\n\n");
fprintf(fp,"\n*****Printing Abstract Memory Locations*****\n\n");
for(iter = bbi->bb->in_abs_mem_value; iter; iter = iter->next)
{
fprintf(fp, "Address = %x\n", iter->inst_addr);
if(!iter->valid)
{
fprintf(fp,"Not valid\n");
continue;
}
fprintf(fp, "Address Range::");
if(iter->addr->lower_bound == -INFINITY)
sprintf(l, "-inf");
else
sprintf(l, "%d", iter->addr->lower_bound);
if(iter->addr->upper_bound == INFINITY)
sprintf(u, "inf");
else
sprintf(u, "%d", iter->addr->upper_bound);
fprintf(fp, "(%s,%s,%d) ", l, u, iter->addr->stride);
fprintf(fp, "Value Range::");
if(!iter->value)
{
fprintf(fp, "(UNKNOWN)\n");
continue;
}
if(iter->value->lower_bound == -INFINITY)
sprintf(l, "-inf");
else
sprintf(l, "%d", iter->value->lower_bound);
if(iter->value->upper_bound == INFINITY)
sprintf(u, "inf");
else
sprintf(u, "%d", iter->value->upper_bound);
fprintf(fp, "(%s,%s,%d)\n", l, u, iter->value->stride);
}
fprintf(fp,"\n*****End Printing Abstract Memory Locations*****\n\n");
reg = bbi->bb->out_abs_reg_value;
fprintf(fp,"\n****Priniting Output information to the basic block****\n");
fprintf(fp,"*****Printing Abstract Register Values*****\n\n");
fprintf(fp, "Basic block start address = 0x%x, End address = 0x%x\n",
bbi->bb->sa, bbi->bb->sa + bbi->bb->size);
for(num_regs = 0; num_regs < MAX_NO_REGISTERS; num_regs++)
{
if(! reg[num_regs])
continue;
fprintf(fp, "Register %d::\n", num_regs);
if(reg[num_regs]->lower_bound == -INFINITY)
sprintf(l, "-inf");
else
sprintf(l, "%d", reg[num_regs]->lower_bound);
if(reg[num_regs]->upper_bound == INFINITY)
sprintf(u, "inf");
else
sprintf(u, "%d", reg[num_regs]->upper_bound);
fprintf(fp, "(%s,%s,%d)\n", l, u, reg[num_regs]->stride);
}
fprintf(fp,"\n*****End Printing Abstract Register Values*****\n\n");
fprintf(fp,"\n*****Printing Abstract Memory Locations*****\n\n");
for(iter = bbi->bb->out_abs_mem_value; iter; iter = iter->next)
{
fprintf(fp, "Address = %x\n", iter->inst_addr);
if(!iter->valid)
{
fprintf(fp,"Not valid\n");
continue;
}
fprintf(fp, "Address Range::");
if(iter->addr->lower_bound == -INFINITY)
sprintf(l, "-inf");
else
sprintf(l, "%d", iter->addr->lower_bound);
if(iter->addr->upper_bound == INFINITY)
sprintf(u, "inf");
else
sprintf(u, "%d", iter->addr->upper_bound);
fprintf(fp, "(%s,%s,%d) ", l, u, iter->addr->stride);
fprintf(fp, "Value Range::");
if(!iter->value)
{
fprintf(fp, "(UNKNOWN)\n");
continue;
}
if(iter->value->lower_bound == -INFINITY)
sprintf(l, "-inf");
else
sprintf(l, "%d", iter->value->lower_bound);
if(iter->value->upper_bound == INFINITY)
sprintf(u, "inf");
else
sprintf(u, "%d", iter->value->upper_bound);
fprintf(fp, "(%s,%s,%d)\n", l, u, iter->value->stride);
}
fprintf(fp,"\n*****End Printing Abstract Memory Locations*****\n\n");
}
/* Dump the address range calculated for different memory accesses
* in a basic block */
static void dumpAddress(tcfg_node_t* bbi)
{
de_inst_t* inst;
int i;
if(! aFile)
aFile = fopen("aloc.dump", "w");
if(!aFile)
fatal("Internal file opening failed");
fprintf(aFile, "Printing abstract value of registers and memory locations\n");
dumpAlocStatus(bbi, aFile);
}
#endif
/****************** END DEBUGGING RELATED FUNCTION ***************/
/* Get the loop bound for a particular loop */
/* FIXME: This function is rather fuzzy....better to choose a different
* implementation */
static int getLoopBound(loop_t* loop)
{
/* FIXME: Temporary */
tcfg_node_t* tail;
tcfg_node_t* head;
assert(loop);
/* This is the last node of the loop */
tail = loop->tail;
head = loop->head;
assert(tail);
if(head->exec_count != -1)
{
loop_t* parent = loop->parent;
if(parent && parent->head->exec_count != -1) {
assert(parent->head->exec_count != 0);
return (head->exec_count / parent->head->exec_count);
} else {
return head->exec_count;
}
}
{
extern inf_loop_t* inf_loops;
inf_loop_t* lp;
assert(inf_loops != NULL);
lp = &(inf_loops[loop->id]);
assert(lp);
if(lp && lp->bound >= 0)
{
printf("returning %d for loop tail %d\n", lp->bound, tail->id);
return lp->bound;
}
}
{
printf("Loop bound not constant... provide a constraint... exiting\n");
exit(-1);
}
}
/* Computes Greatest common divisor of two arguments */
int gcd ( int a, int b )
{
int c;
if(! a) return b;
if(! b) return a;
while ( a != 0 ) {
c = a; a = b%a; b = c;
}
return b;
}
/* Compute maximum of all the arguments given */
static
int maxof(int n_args, ...){
register int i;
int max, a;
va_list ap;
va_start(ap, n_args);
max = va_arg(ap, int);
for(i = 2; i <= n_args; i++) {
if((a = va_arg(ap, int)) > max)
max = a;
}
va_end(ap);
return max;
}
/* Compute minimum of all the arguments given */
static
int minof(int n_args, ...){
register int i;
int min, a;
va_list ap;
va_start(ap, n_args);
min = va_arg(ap, int);
for(i = 2; i <= n_args; i++) {
if((a = va_arg(ap, int)) < min)
min = a;
}
va_end(ap);
return min;
}
/* Create a range */
static
ric_p makeRIC(ric_p arg)
{
ric_p nRIC;
if(! arg)
return NULL;
nRIC = (ric_p)malloc(sizeof(ric_s));
if(! nRIC)
fatal("Out of memory");
nRIC->lower_bound = arg->lower_bound;
nRIC->upper_bound = arg->upper_bound;
nRIC->stride = arg->stride;
return nRIC;
}
/* Make one ric per instruction (allocate memory) */
static void makeRICPerInstruction(de_inst_t* inst, ric_p* abs_reg)
{
int i;
if(! inst->abs_reg)
{
inst->abs_reg = (ric_p *)malloc(MAX_NO_REGISTERS * sizeof(ric_p));
if(! inst->abs_reg)
fatal("Out of memory");
memset(inst->abs_reg, 0, MAX_NO_REGISTERS * sizeof(ric_p));
}
for(i = 0; i < MAX_NO_REGISTERS; i++)
{
if(! abs_reg[i])
continue;
if(! inst->abs_reg[i])
{
inst->abs_reg[i] = (ric_p)malloc(sizeof(ric_s));
if(! inst->abs_reg[i])
fatal("Out of memory");
}
inst->abs_reg[i]->lower_bound = abs_reg[i]->lower_bound;
inst->abs_reg[i]->upper_bound = abs_reg[i]->upper_bound;
inst->abs_reg[i]->stride = abs_reg[i]->stride;
}
}
/* update RIC for multiply instruction (register-register addressing mode) */
static void updateRICMul(ric_p* hi, ric_p* lo, ric_p src1, ric_p src2)
{
long long lower_bound, upper_bound;
if(! (*hi))
*hi = (ric_p)malloc(sizeof(ric_s));
if(! hi)
fatal("Out of memory");
if(! (*lo))
*lo = (ric_p)malloc(sizeof(ric_s));
if(! lo)
fatal("Out of memory");
if(src1 && src2)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1 && src2->stride != -1)
{
lower_bound = minof(4, src1->lower_bound * src2->lower_bound,
src1->lower_bound * src2->upper_bound,
src1->upper_bound * src2->upper_bound,
src1->upper_bound * src2->lower_bound);
upper_bound = maxof(4, src1->lower_bound * src2->lower_bound,
src1->lower_bound * src2->upper_bound,
src1->upper_bound * src2->upper_bound,
src1->upper_bound * src2->lower_bound);
(*hi)->lower_bound = (int)(lower_bound >> 32);
(*hi)->upper_bound = (int)(upper_bound >> 32);
(*hi)->stride = 1;
if(! ((*hi)->upper_bound)) {
(*lo)->upper_bound = (int)upper_bound;
(*lo)->lower_bound = (int)lower_bound;
(*lo)->stride = (int)(gcd(gcd(src1->stride * src2->stride,
src1->lower_bound * src2->stride),
src2->lower_bound * src1->stride));
} else
{
(*lo)->upper_bound = 0;
(*lo)->lower_bound = 0;
(*lo)->stride = -1;
}
} else
{
/* Otherwise make the conservative approximation that the
* destination is the top element. We represent [0,0,-1] as
* the top element for implementation purpose as in all other
* cases stride must be nonnegative*/
(*hi)->lower_bound = (*hi)->upper_bound = 0;
(*lo)->lower_bound = (*lo)->upper_bound = 0;
(*hi)->stride = -1;
(*lo)->stride = -1;
}
} else
{
(*hi)->lower_bound = (*hi)->upper_bound = 0;
(*lo)->lower_bound = (*lo)->upper_bound = 0;
(*hi)->stride = -1;
(*lo)->stride = -1;
}
}
/* update RIC for subtract operation (register-register addressing mode) */
static void updateRICSub(ric_p* dest, ric_p src1, ric_p src2)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
if(src1 && src2)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1 && src2->stride != -1)
{
(*dest)->lower_bound = src1->lower_bound - src2->upper_bound;
(*dest)->upper_bound = src1->upper_bound - src2->lower_bound;
(*dest)->stride = gcd(src1->stride, src2->stride);
} else
{
/* Otherwise make the conservative approximation that the
* destination is the top element. We represent [0,0,-1] as
* the top element for implementation purpose as in all other
* cases stride must be nonnegative*/
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
} else
{
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
}
/* update RIC for boolean operation (register-register addressing mode) */
static void updateRICBool(ric_p* dest, ric_p src1, ric_p src2)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
if(src1 && src2)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1 && src2->stride != -1)
{
if(src1->upper_bound < src2->lower_bound)
(*dest)->lower_bound = (*dest)->upper_bound = 1;
else
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = 0;
} else
{
(*dest)->lower_bound = 0;
(*dest)->upper_bound = 1;
(*dest)->stride = 1;
}
} else
{
(*dest)->lower_bound = 0;
(*dest)->upper_bound = 1;
(*dest)->stride = 1;
}
}
/* update RIC for boolean checking operation (immediate addressing
* mode - unsigned) */
static void updateRICBoolU(ric_p* dest)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
(*dest)->lower_bound = 0;
(*dest)->upper_bound = 1;
(*dest)->stride = 1;
}
/* update RIC for boolean checking operation (immediate addressing
* mode) */
static void updateRICBoolImm(ric_p* dest, ric_p src1, int imm)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
if(src1)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1)
{
if(src1->upper_bound < imm)
(*dest)->lower_bound = (*dest)->upper_bound = 1;
else
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = 0;
} else
{
(*dest)->lower_bound = 0;
(*dest)->upper_bound = 1;
(*dest)->stride = 1;
}
} else
{
(*dest)->lower_bound = 0;
(*dest)->upper_bound = 1;
(*dest)->stride = 1;
}
}
/* update RIC for add instruction (register-register addressing mode) */
static void updateRICAdd(ric_p* dest, ric_p src1, ric_p src2)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
if(src1 && src2)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1 && src2->stride != -1)
{
(*dest)->lower_bound = src1->lower_bound + src2->lower_bound;
(*dest)->upper_bound = src1->upper_bound + src2->upper_bound;
/* FIXME :: Assumption , stride cannot be -INFINITY or +INFINITY
*/
(*dest)->stride = gcd(src1->stride, src2->stride);
} else
{
/* Otherwise make the conservative approximation that the
* destination is the top element. We represent [0,0,-1] as
* the top element for implementation purpose as in all other
* cases stride must be nonnegative*/
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
} else
{
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
}
/* Perform join operation of two RIC-s (CHECK this) */
static ric_p updateRICJoin(ric_p src1, ric_p src2)
{
ric_p result;
int diff1, diff2, diff3, diff4;
result = (ric_p)malloc(sizeof(ric_s));
if(! result)
fatal("Out of memory");
memset(result, 0, sizeof(ric_s));
if(src1 && src2)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1 && src2->stride != -1)
{
if(!src1->lower_bound && !src1->upper_bound && src1->stride) {
result->lower_bound = src2->lower_bound;
result->upper_bound = src2->upper_bound;
result->stride = src2->stride;
}
else if(!src2->lower_bound && !src2->upper_bound && src2->stride) {
result->lower_bound = src1->lower_bound;
result->upper_bound = src1->upper_bound;
result->stride = src1->stride;
}
else
{
result->lower_bound = minof(2, src1->lower_bound, src2->lower_bound);
result->upper_bound = maxof(2, src1->upper_bound, src2->upper_bound);
/* This condition means both RIC are constant */
if(! src1->stride && !src2->stride &&
result->lower_bound != result->upper_bound)
result->stride = abs(src1->lower_bound - src2->lower_bound);
else {
diff1 = abs(src1->lower_bound - src2->lower_bound);
diff2 = abs(src1->lower_bound - src2->upper_bound);
diff3 = abs(src1->upper_bound - src2->lower_bound);
diff4 = abs(src1->upper_bound - src2->upper_bound);
result->stride = gcd(gcd(gcd(gcd(gcd(diff1, diff2),
diff3), diff4), src1->stride), src2->stride);
}
}
} else
{
/* Otherwise make the conservative approximation that the
* destination is the top element. We represent [0,0,-1] as
* the top element for implementation purpose as in all other
* cases stride must be nonnegative*/
result->lower_bound = result->upper_bound = 0;
result->stride = -1;
}
} else if(src1 || src2)
{
result->lower_bound = result->upper_bound = 0;
result->stride = -1;
} else {
free(result);
return NULL;
}
return result;
}
/* Load the value in memory */
static
ric_p returnMemoryAloc(ric_s mem, abs_mem_p abs_mem_st)
{
abs_mem_p iter;
ric_p result;
int found = 0;
ric_s t_addr;
ric_p p_addr;
result = (ric_p)malloc(sizeof(ric_s));
if(! result)
fatal("Out of memory");
t_addr.lower_bound = t_addr.upper_bound = 0;
t_addr.stride = 1;
p_addr = &t_addr;
memset(result, 0, sizeof(ric_s));
result->stride = 1;
for(iter = abs_mem_st; iter; iter = iter->next) {
if(!iter->valid)
continue;
if(mem.lower_bound >= iter->addr->lower_bound &&
mem.upper_bound <= iter->addr->upper_bound &&
mem.stride == iter->addr->stride &&
abs(mem.lower_bound - iter->addr->lower_bound) % mem.stride == 0) {
found = 1;
result = updateRICJoin(result, iter->value);
}
else if(mem.lower_bound <= iter->addr->lower_bound &&
mem.upper_bound >= iter->addr->upper_bound &&
mem.stride == iter->addr->stride &&
abs(mem.lower_bound - iter->addr->lower_bound) % mem.stride == 0) {
p_addr = updateRICJoin(p_addr, iter->addr);
result = updateRICJoin(result, iter->value);
}
}
if(!found && !checkEquality(p_addr, &mem)) {
/* Return top element (i.e., unknown) if memory store is not found */
result->lower_bound = result->upper_bound = 0;
result->stride = -1;
}
return result;
}
/* update RIC for a load instruction (base index addressing mode) */
static void updateRICLoadIndex(ric_p* dest, ric_p src1, ric_p src2,
abs_mem_p abs_mem_st, int size)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
if(src1 && src2)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1)
{
ric_s temp;
free(*dest);
temp.lower_bound = src1->lower_bound + src2->lower_bound;
temp.upper_bound = src1->upper_bound + src2->upper_bound;
temp.stride = size;
*dest = returnMemoryAloc(temp, abs_mem_st);
} else
{
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
} else
{
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
}
/* update RIC for a load instruction */
static void updateRICLoad(ric_p* dest, ric_p src1, int imm, abs_mem_p abs_mem_st,
int size)
{
if(! (*dest))
*dest = (ric_p)malloc(sizeof(ric_s));
if(! dest)
fatal("Out of memory");
if(src1)
{
/* If none of the sources are top element in the lattice */
if(src1->stride != -1)
{
ric_s temp;
free(*dest);
temp.lower_bound = src1->lower_bound + imm;
temp.upper_bound = src1->upper_bound + imm;
temp.stride = size;
*dest = returnMemoryAloc(temp, abs_mem_st);
} else
{
/* Otherwise make the conservative approximation that the
* destination is the top element. We represent [0,0,-1] as
* the top element for implementation purpose as in all other
* cases stride must be nonnegative*/
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
} else
{
(*dest)->lower_bound = (*dest)->upper_bound = 0;
(*dest)->stride = -1;
}
}
/* Allocate memory for aloc abstraction of a memory component
* (register or memory location) */
static abs_mem_p createMemoryAloc(ric_s addr, ric_p value)
{
abs_mem_p nEntry = (abs_mem_p)malloc(sizeof(abs_mem_s));
if(!nEntry)
fatal("Out of Memory");
memset(nEntry, 0, sizeof(abs_mem_s));
nEntry->addr = (ric_p)malloc(sizeof(ric_s));
if(! nEntry->addr)
fatal("Out of Memory");
nEntry->value = (ric_p)malloc(sizeof(ric_s));
if(! nEntry->value)
fatal("Out of Memory");
nEntry->addr->lower_bound = addr.lower_bound;
nEntry->addr->upper_bound = addr.upper_bound;
nEntry->addr->stride = addr.stride;
if(value)
{
nEntry->value->lower_bound = value->lower_bound;
nEntry->value->upper_bound = value->upper_bound;
nEntry->value->stride = value->stride;
}
else
{
nEntry->value->lower_bound = 0;
nEntry->value->upper_bound = 0;
nEntry->value->stride = -1;
}
nEntry->next = NULL;
return nEntry;
}
/* invalidate aloc abstraction of a memory operation as the
* values cannot be tracked anymore */
static void invalidateMemoryAloc(abs_mem_p abs_mem_st)
{
abs_mem_p iter;
/* Assign all memory location value as top */
for(iter = abs_mem_st; iter; iter = iter->next) {
if(!iter->valid || !iter->value)
continue;
iter->value->lower_bound = iter->value->upper_bound = 0;
iter->value->stride = -1;
}
}
/* update aloc abstraction for a memory location */
static void updateMemoryAloc(ric_s mem, abs_mem_p* abs_mem_st, ric_p value,
int addr)
{
abs_mem_p iter;
for(iter = *abs_mem_st; iter; iter = iter->next) {
if(!iter->valid && !(iter->inst_addr == addr))
continue;
else if(iter->inst_addr == addr)
{
if(!iter->valid)
{
iter->valid = 1;
iter->addr = makeRIC(&mem);
iter->value = makeRIC(value);