-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathsquint.c
5318 lines (4865 loc) · 193 KB
/
squint.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
/* Squint -- a peephole optimizer for mc.*/
/* mc.c uses a 2-register stack based VM. */
/* Squint converts this to a 2-register frame based VM. */
/* A 2-register frame based VM makes it easier to add */
/* a register allocation pass to the peephole optimizer. */
#include <stdio.h>
#include <stdlib.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <unistd.h>
#include <string.h>
/* Register Use/Def Analysis
For each ARM instruction, create an integer descriptor describing
register usage. Since the stack simultaneously behaves like a
single register *and* an 'infinite' register file, we also need to
keep track of stack usage. We only track user-assignable registers
here, and (mostly) exclude the behavior of the fp, sp, lr, pc whose
behavior is constrained via both hardware and ABI conventions. We
do not track specific memory addresses, but do track use/def memOp.
Lower descriptor bits are used to mirror the Rn/Rd/Rs/Rm register
slots in an A32 opcode. This makes it easier to manipulate
'active' register slots in the actual instructions.
*/
/*
RI_memOp bits:
000 No memory operation
001 Inst read
010 Memory write
011 Memory read
100 Frame write
101 Frame read
110 Stack write
111 Stack read
*/
#define RI_hasD 0xc0000000 /* Destination register */
#define RI_RdDest 0x80000000 /* Rd destination register */
#define RI_RnDest 0x40000000 /* Rn destination register */
#define RI_memOp 0x38000000 /* Mem descriptor */
#define RI_memMask 0x30000000 /* Mem op mask */
#define RI_memRW 0x08000000 /* Read(1)/Write(0) mask */
#define RI_memR 0x08000000 /* Mem read op */
#define RI_instR 0x08000000 /* Instruction mem read */
#define RI_dataW 0x10000000 /* Rd written to memory */
#define RI_dataR 0x18000000 /* Rd read from memory */
#define RI_frameW 0x20000000 /* Rd written to frame var */
#define RI_frameR 0x28000000 /* Rd read from frame var */
#define RI_push 0x30000000 /* Rd is pushed onto stack */
#define RI_pop 0x38000000 /* Rd is popped off of stack */
#define RI_bb 0x04000000 /* basic block boundary */
#define RI_branch 0x02000000 /* branch instruction */
#define RI_FPacc 0x01000000 /* FP accumulate */
#define RI_func 0x00800000 /* function call */
#define RI_Sd 0x00400000 /* high bit of fp reg id */
#define RI_Sn 0x00200000 /* high bit of fp reg id */
#define RI_Sm 0x00100000 /* high bit of fp reg id */
#define RI_Active 0x000000f0 /* Bitmask for register usage in inst */
#define RI_RmAct 0x00000010
#define RI_RsAct 0x00000020
#define RI_RdAct 0x00000040
#define RI_RnAct 0x00000080
#define RI_Rm 0x0000000f /* register slots in ARM instruction */
#define RI_Rs 0x00000f00
#define RI_Rd 0x0000f000
#define RI_Rn 0x000f0000
/* NOP -- mov rn, rn */
#define NOP 0xe1a00000
#define NOP1 0xe1a01001
#define NOP11 0xe1a0b00b
#define NOP13 0xe1a0d00d
// allocable integer registers
#define UREG_MASK 0x000057ff
enum CPUregs { rSL = 10, rFP, rIP, rSP, rLR, rPC };
enum search_dir { S_BACK = -1, S_FWD = 1 };
int *cnst_bit;
struct ia_s {
int inst_addr; // inst address
struct ia_s *next;
};
static struct pd_s {
int data_addr; // data address
struct ia_s *inst;
} *cnst_pool;
static int cnst_pool_size;
static int *cbegin;
static int skip_const_blk;
static int extra_opt = 1;
/**********************************************************/
/*************** general utility functions ****************/
/**********************************************************/
static int popcount32b(int i)
{
i = i - ((i >> 1) & 0x55555555); // add pairs of bits
i = (i & 0x33333333) + ((i >> 2) & 0x33333333); // quads
i = (i + (i >> 4)) & 0x0F0F0F0F; // groups of 8
return (i * 0x01010101) >> 24; // horizontal sum of bytes
}
int avail_reg(int base)
{
int i;
int mask = 1;
for (i=0; i<32; ++i, mask <<= 1) if (base & mask) break;
return (i == 32) ? -1 : i;
}
/**********************************************************/
/********** I-stream const pool utility functions ********/
/**********************************************************/
/* The ARM processor allows use of pc-relative constants */
/* constants are sorted by the address they are stored in memory */
static int find_const(int addr)
{
int low, high, mid;
// pool is sorted by *relative address* of data values
// with respect to beginning of text segment.
// binsearch pool for address of data
low = 0; high = cnst_pool_size;
while (low != high) {
mid = (low + high) / 2;
if (cnst_pool[mid].data_addr <= addr) {
low = mid;
if (cnst_pool[mid].data_addr == addr) break;
if (high-low == 1) ++low;
}
else
high = mid;
}
return low; // this is the inseertion point, which can be cnst_pool_size
}
static int is_const(int *inst)
{
int iaddr = (inst-cbegin);
return (cnst_bit[iaddr/(sizeof(int)*8)] &
(1 << (iaddr & ((sizeof(int)*8)-1))));
}
/* pc-relative constants always appear in the instruction */
/* stream after the instructions that reference them. Because */
/* of this we can safely scan an instruction stream forward, */
/* skipping any constants we encounter. */
static void create_const_map(int *begin, int *end)
{
int *scan = begin;
int i;
/* initialize global variables */
cbegin = begin;
cnst_pool = calloc(end-begin, sizeof(struct pd_s)); // 1/4 prog size
cnst_bit = (int *) calloc(1, ((end-begin)/8) + 1);
cnst_pool_size = 0;
while (scan < end) {
if (((i = (*scan & 0xffff0000) == 0xe59f0000) || // ldr r0, [pc, #X]
(*scan & 0xffbf0f00) == 0xed9f0a00) && // vldr s0, [pc, #X]
!is_const(scan)) {
int offset = i ? ((*scan & 0xfff) / 4) : (*scan & 0xff);
int iaddr = ((scan + 2 + offset) - begin);
int addr = iaddr*4;
struct ia_s **inst;
int low = find_const(addr);
if (cnst_pool[low].data_addr != addr) {
int *mem = ((int *)&cnst_pool[cnst_pool_size]) + 1;
// insert addr at this location
for (i = cnst_pool_size; i > low; --i) {
*mem = *(mem-2); --mem;
*mem = *(mem-2); --mem;
}
cnst_pool[low].data_addr = addr;
cnst_pool[low].inst = 0;
++cnst_pool_size;
cnst_bit[iaddr/(sizeof(int)*8)] |=
1 << (iaddr & ((sizeof(int)*8)-1));
}
/* keep track of pc-relative instructions that ref this constant */
for (inst = &cnst_pool[low].inst; *inst != 0; inst = &(*inst)->next);
*inst = malloc(sizeof(struct ia_s));
(*inst)->inst_addr = (scan-begin)*4;
(*inst)->next = 0;
}
++scan;
}
}
static void delete_const(int *cnst, int *scan)
{
int iaddr = (cnst-cbegin);
int addr = (scan-cbegin)*4;
int i = find_const(iaddr*4);
struct ia_s *next, **inst = &cnst_pool[i].inst;
while (*inst && (*inst)->inst_addr != addr) inst = &(*inst)->next;
if (*inst) {
next = (*inst)->next;
(*inst)->next = 0;
free(*inst);
*inst = next;
}
if (cnst_pool[i].inst == 0) {
*cnst = NOP;
cnst_bit[iaddr/(sizeof(int)*8)] &=
~(1 << (iaddr & ((sizeof(int)*8)-1)));
}
}
static void destroy_const_map()
{
struct ia_s *inst, *next;
int i;
for (i = 0; i < cnst_pool_size; ++i) {
inst = cnst_pool[i].inst;
while (inst != 0) {
next = inst->next;
free(inst);
inst = next;
}
}
free(cnst_bit);
free(cnst_pool);
}
/* convert special ARM consts to mov immediate */
static void const_imm_opt(int *begin, int *end)
{
struct ia_s *inst, *next;
int *newinst;
int i, j, val, rotate;
for (i = 0, j = 0; i < cnst_pool_size; ++i) {
int iaddr = cnst_pool[i].data_addr/4;
val = cbegin[iaddr];
rotate = 0;
if ((val & 0x0000ff00) && !(val & 0xffff00ff)) rotate = 1;
if ((val & 0x00ff0000) && !(val & 0xff00ffff)) rotate = 2;
if ((val & 0xff000000) && !(val & 0x00ffffff)) rotate = 3;
if (rotate || (-256 <= val && val < 0)) {
if (rotate) {
val = (val >> (8*rotate)) & 0xff;
rotate = (4-rotate)*1024;
}
inst = cnst_pool[i].inst;
while (inst != 0) {
next = inst->next;
newinst = cbegin + inst->inst_addr/4;
if ((*newinst & 0xffbf0f00) == 0xed9f0a00) goto skip_fp; // vldr
if (rotate) {
*newinst = 0xe3a00000 | (*newinst & RI_Rd) | rotate | val; // mov
}
else {
*newinst = 0xe3e00000 | (*newinst & RI_Rd) | -(val+1); // mvn
}
free(inst);
inst = next;
}
cbegin[iaddr] = NOP; // for safety
cnst_bit[iaddr/(sizeof(int)*8)] &=
~(1 << (iaddr & ((sizeof(int)*8)-1)));
}
else {
skip_fp: if (i != j) {
cnst_pool[j].data_addr = cnst_pool[i].data_addr;
cnst_pool[j].inst = cnst_pool[i].inst;
}
++j;
}
}
cnst_pool_size = j;
}
static void pack_const(int start)
{
int i, j;
for (i = start, j = start; i < cnst_pool_size; ++i) {
if (cnst_pool[i].inst != 0) {
if (i != j) {
cnst_pool[j].data_addr = cnst_pool[i].data_addr;
cnst_pool[j].inst = cnst_pool[i].inst;
}
++j;
}
}
cnst_pool_size = j;
return;
}
/* relocate a (v)ldr rX, [pc, #X] instruction */
static void rel_pc_ldr(int *dst, int *src)
{
if (dst == src) return;
int is_vldr = ((*src & 0xffbf0f00) == 0xed9f0a00); // vldr sd, [pc, #x]
if (is_vldr && ((src - dst + (*src & 0xff)) > 0xff)) {
printf("Squint can't relocate vldr -- out of range\n");
exit(-1);
}
struct ia_s **inst;
int offset = is_vldr ? (*src & 0xff) : ((*src & 0xfff) / 4);
int addr = ((src + 2 + offset) - cbegin)*4;
int low = find_const(addr);
if (cnst_pool[low].data_addr == addr) { // verify 'low' is index of const
for (inst = &cnst_pool[low].inst; *inst != 0; inst = &(*inst)->next) {
if ((*inst)->inst_addr == (src - cbegin)*4) {
/* make sure pc-relative addr is still valid after move */
(*inst)->inst_addr = (dst - cbegin)*4;
*dst = *src + (src - dst)*(is_vldr ? 1 : 4);
break;
}
}
}
}
/**********************************************************/
/************* NOP related utility functions **************/
/**********************************************************/
/* check for nop, PHD, and PHR0 instructions */
static int is_nop(int inst) {
return ( (inst == NOP) || (inst == NOP1) ||
(inst == NOP11) || (inst == NOP13) );
}
/* skip any nop instructions in given direction. */
/* direction: -1 means move toward lower addresses */
/* 1 means move toward higher addresses */
/* Note that a NOP1 (PHD) will treat the instruction */
/* after it (+1) as though it were a nop */
static int *skip_nop(int *begin, enum search_dir dir)
{ /* -1 = backward, 1 = forward */
int *scan2, *scan = begin;
int *after_const_block, done;
do {
done = 1;
/* skip past any consts in instruction stream */
while (is_const(scan)) scan += dir;
/* skip past any NOPS in instruction stream */
if (*scan == NOP || *scan == NOP11 || *scan == NOP13) {
scan += dir;
done = 0;
}
else if (dir == S_FWD &&
*scan == NOP1 &&
(*(scan+1) & 0xffff0fff) != 0xe52d0004) { /* push */
scan += 2;
done = 0;
}
else if (*(scan-1) == NOP1 &&
(*scan & 0xffff0fff) != 0xe52d0004 && /* push */
dir == S_BACK) {
scan -= 2;
done = 0;
}
else if (*scan == NOP1) {
scan += dir;
done = 0;
}
else if (skip_const_blk && (*scan & 0xff800000) == 0xea000000) {
// expensive check but const-blocks have blocked many opts
after_const_block = scan + 2 + (*scan & 0x00ffffff);
for (scan2 = scan + 1; scan2 < after_const_block; ++scan2)
if (!is_const(scan2)) break;
if (scan2 == after_const_block) {
scan = ((dir == S_FWD) ? after_const_block : (scan - 1));
done = 0;
}
}
} while (!done);
return scan;
}
/* This is a convenience function that should always */
/* start from a non-nop, non-const instruction. */
/* index is a count of how many non-nop instructions */
/* to move through the instruction stream. e.g. */
/* index == 0 means return immediately */
/* index == -5 means move backward 5 active instructions */
static int *active_inst(int *cursor, int index)
{
enum search_dir dir;
int count;
if (index != 0) {
if (index < 0) {
dir = S_BACK;
count = -index;
}
else {
dir = S_FWD;
count = index;
}
while (count > 0) {
cursor += dir;
cursor = skip_nop(cursor, dir);
--count;
}
}
return cursor;
}
/* This is executed immediately before compressing */
/* all nops out of the instruction stream */
static void rename_nop(int *begin, int *end)
{
int *scan;
for (scan = begin; scan <= end; ++scan) {
if (is_nop(*scan) && !is_const(scan)) {
*scan = NOP;
}
}
}
/****************************************************/
/****************** use-def analysis ****************/
/****************************************************/
/* The following bit masks are used to transfer 'active' register
slots between the def/use descriptors and the A32 opcodes.
*/
static int activeRegMask[16] =
{
0x00000000,
0x0000000f,
0x00000f00,
0x00000f0f,
0x0000f000,
0x0000f00f,
0x0000ff00,
0x0000ff0f,
0x000f0000,
0x000f000f,
0x000f0f00,
0x000f0f0f,
0x000ff000,
0x000ff00f,
0x000fff00,
0x000fff0f
};
/**********************************************/
// check if inst modifies flag register
static int mflag(int inst)
{
return ((inst & 0x0e100000) == 0x02100000 || (inst == 0xeef1fa10) ||
((inst & 0x0e100000) == 0x00100000 && (inst & 0x90) != 0x90));
}
static int regtest(int inst, int opmask)
{
return ((inst & opmask) == opmask);
}
/* funcBegin and funcEnd instructions guaranteed not to be NOP */
static void create_inst_info(int *instInfo, int *funcBegin, int *funcEnd)
{
int *scan;
int *rInfo = instInfo;
int Rn, Rd, Rs, Rm;
int inst, instMask, op;
for (scan = funcBegin; scan <= funcEnd; ++scan) {
int info = 0;
if (is_const(scan)) {
goto next_iter;
}
else if (is_nop(*scan)) {
info = ((*scan == NOP13) ? RI_func : 0);
goto next_iter;
}
/* determine info about current instruction */
inst = *scan;
instMask = (inst >> 24) & 0x0e;
Rn = (inst >> 16) & 0x0f;
Rd = (inst >> 12) & 0x0f;
Rs = (inst >> 8) & 0x0f;
Rm = inst & 0x0f;
#if 0
if (inst == 0xe28fe000) { // add lr, pc, #0
}
#endif
if (instMask == 0x02) { /* ALU_immed */
op = (inst >> 21) & 0x0f;
if ((op != 0x0d) && (op != 0x0f)) {
info |= RI_RnAct;
}
if ((op & 0x0c) != 0x08) { // not tst instructions
info |= RI_RdAct | RI_RdDest;
}
}
else if (instMask == 0x00) { /* ALU_register */
if ((inst & 0xf0) == 0x90) { /* mul */
info |= RI_RnAct | RI_RsAct | RI_RmAct | RI_RnDest;
if (inst & (1<<21)) info |= RI_RdAct; // mla
}
else { /* not mul */
op = (inst >> 21) & 0x0f;
if ((op != 0x0d) && (op != 0x0f)) {
info |= RI_RnAct;
}
if ((op & 0x0c) != 0x08) {
info |= RI_RdAct | RI_RdDest;
}
if ((inst & 0x90) == 0x10) {
info |= RI_RsAct;
}
info |= RI_RmAct;
}
}
else if (instMask == 0x04 ||
(instMask == 0x06 && (inst & (1<<4)) == 0)) { /* MEM op */
int MEM_mask = (inst >> 20) & 0xd7;
if (MEM_mask == 0x51 || MEM_mask == 0x55) { /* ldr || ldrb */
info |= RI_RdAct | RI_RnAct | RI_RdDest;
if (inst & (1<<25)) {
info |= RI_RmAct;
}
if (Rn == 0x0f) {
info |= RI_instR;
}
else if (Rn == 0x0b) {
info |= RI_frameR;
}
else {
info |= RI_dataR;
}
if (Rd == 0x0f) {
info |= RI_branch;
}
}
else if (MEM_mask == 0x50 || MEM_mask == 0x54) { /* str | strb */
info |= RI_RdAct | RI_RnAct;
if (Rn == 0x0b) {
info |= RI_frameW;
}
else {
info |= RI_dataW;
}
}
else if (MEM_mask == 0x41) /* pop */
info |= RI_RdAct | RI_RnAct | RI_RdDest | RI_pop;
else if (MEM_mask == 0x52) /* push */
info |= RI_RdAct | RI_RnAct | RI_push;
}
else if (instMask == 0x0a) { /* BRANCH (and link) */
info |= RI_branch;
}
else if (instMask == 0x0c) { /* float */
if ((inst & 0xff200f00) == 0xed000a00) { // vldr | vstr
info |= RI_RnAct;
if ((inst & 0xff300f00) == 0xed100a00) { // vldr
info |= ((Rn == 0x0f) ? RI_instR :
((Rn == 0x0b) ? RI_frameR : RI_dataR));
}
}
if ((inst & 0xfff00f10) == 0xec500b10) // vmov rx, ry, dz
info |= RI_RnAct | RI_RdAct | RI_RnDest | RI_RdDest;
}
else if (instMask == 0x0e) { /* float */
if (((inst>>21) & 7) == 0 && // vmov sz, rx | (bit 20) vmov rx, sz
(inst & 0x10) == 0x10) {
info |= RI_RdAct | ((inst & (1<<20)) ? (RI_RdDest) : 0);
}
else if ((inst & 0xfff00f7f) == 0xee100a10) // fmrs
*rInfo = RI_RdAct | RI_RdDest;
else if ((inst & 0xfff00f7f) == 0xee000a10) // fmsr
*rInfo = RI_RdAct;
}
/* Mask out any registers outside of rename range */
if ( ((1 << Rn) & ~UREG_MASK) && regtest(info, RI_RnAct) ) {
info &= ~(RI_RnAct | RI_RnDest);
}
if ( ((1 << Rd) & ~UREG_MASK) && regtest(info, RI_RdAct) ) {
info &= ~(RI_RdAct | RI_RdDest);
if ((info & RI_memMask) == RI_push) { /* check for push or pop */
info &= ~RI_memOp; /* clear push/pop operation */
}
/* Note that RI_mem is left set here, since we still
need to handle pc relative addresses */
}
if ( ((1 << Rs) & ~UREG_MASK) && regtest(info, RI_RsAct) ) {
info &= ~RI_RsAct;
}
if ( ((1 << Rm) & ~UREG_MASK) && regtest(info, RI_RmAct) ) {
info &= ~RI_RmAct;
}
/* keep register Ids for active registers */
info |= inst & activeRegMask[(info & RI_Active) >> 4];
next_iter:
*rInfo++ = info;
}
/* termination sentinel to simplify reg_info scans */
*rInfo = 0xffffffff;
}
/* Floating point (hack) version of create_inst_info */
static void create_inst_info_f(int *instInfo, int *funcBegin, int *funcEnd)
{
int *scan;
int *rInfo = instInfo;
for (scan = funcBegin; scan <= funcEnd; ++scan) {
// order is important
if (is_const(scan))
*rInfo = 0;
else if (is_nop(*scan)) {
*rInfo = ((*scan == NOP13) ? RI_func : 0);
}
else if ((*scan & 0xffbf0fff) == 0xecbd0a01 || // vpop Fd
(*scan & 0xfe100f00) == 0xec100a00) // vldr
*rInfo = RI_RdAct | RI_RdDest | ((*scan & 0x7000) * 2) |
((*scan & RI_Sd) >> 10) | ((*scan & 0x8000) << 7);
else if (*scan == 0xed2d0a01) // vpush s0
*rInfo = RI_RdAct;
else if ((*scan & 0xfe100f00) == 0xec000a00) // vstr
*rInfo = RI_RdAct | ((*scan & 0x7000) * 2) |
((*scan & RI_Sd) >> 10) | ((*scan & 0x8000) << 7);
else if ((*scan & 0xffbf0fd0) == 0xeeb00a40) // vmov Fd, Fm
*rInfo = RI_RdAct | RI_RdDest | RI_RmAct | ((*scan & RI_Sd) >> 10) |
((*scan & 0x7000) * 2) | ((*scan & 0x8000) << 7) |
((*scan & 0x20) >> 5) | ((*scan & 0x07) * 2) |
((*scan & 0x08) << 17);
else if (*scan == 0xee300a40) // vsub s0, s0, s0
*rInfo = RI_RdAct | RI_RdDest; // def of s0, but not a use
else if ((*scan & 0xffbf0fff) == 0xeeb50ac0) // vcmpe Fd, #0
*rInfo = RI_RdAct | ((*scan & 0x7000) * 2) |
((*scan & RI_Sd) >> 10) | ((*scan & 0x8000) << 7);
else if ((*scan & 0xffbf0fd0) == 0xeeb40ac0) // vcmpe Fd, Fm
*rInfo = RI_RdAct | RI_RmAct | ((*scan & 0x7000) * 2) |
((*scan & RI_Sd) >> 10) | ((*scan & 0x8000) << 7) |
((*scan & 0x20) >> 5) | ((*scan & 0x07) * 2) |
((*scan & 0x08) << 17);
else if ((*scan & 0xffbf0fc0) == 0xeeb10ac0 || // vsqrt Fd, Fm
(*scan & 0xffbf0fc0) == 0xeeb10a40 || // vneg Fd, Fm
(*scan & 0xffbf0fc0) == 0xeeb00ac0) // vabs Fd, Fm
*rInfo = RI_RdAct | RI_RdDest | RI_RmAct | ((*scan & RI_Sd) >> 10) |
((*scan & 0x7000) * 2) | ((*scan & 0x8000) << 7) |
((*scan & 0x20) >> 5) | ((*scan & 0x07) * 2) |
((*scan & 0x08) << 17);
else if ((*scan & 0xffff0fd0) == 0xeeb70ac0) *rInfo = 0 ; // ignore
else if ((*scan & 0xfff00f7f) == 0xee100a10) // fmrs
*rInfo = RI_RnAct | ((*scan & 0x70000) * 2) |
((*scan & 0x80000) << 2) | ((*scan & 0x80) << 9);
else if ((*scan & 0xfff00f7f) == 0xee000a10) // fmsr
*rInfo = RI_RnAct | RI_RnDest | ((*scan & 0x70000) * 2) |
((*scan & 0x80000) << 2) | ((*scan & 0x80) << 9);
else if ((*scan & 0xffbf0fd0) == 0xeeb80ac0 || // fsitos
(*scan & 0xffbf0f50) == 0xeebd0a40) // ftosis
*rInfo = RI_RdAct | RI_RdDest | RI_RmAct | ((*scan & 0x20) >> 5) |
((*scan & 0x07) * 2) | ((*scan & 0x08) << 17) |
((*scan & RI_Sd) >> 10) | ((*scan & 0x7000) * 2) |
((*scan & 0x8000) << 7);
else if ((*scan & 0xff000f10) == 0xee000a00) { // Fop Fd, Fn, Fm
*rInfo = RI_RdAct | RI_RdDest | RI_RnAct | RI_RmAct |
((*scan & RI_Sd) >> 10) | ((*scan & 0x7000) * 2) |
((*scan & 0x8000) << 7) | ((*scan & 0x80) << 9) |
((*scan & 0x70000) * 2) | ((*scan & 0x80000) << 2) |
((*scan & 0x20) >> 5) | ((*scan & 0x07) * 2) |
((*scan & 0x08) << 17);
if ((*scan & 0x00b00000) == 0) *rInfo |= RI_FPacc;
}
else if ((*scan & 0x0e000000) == 0x0a000000)
*rInfo = RI_branch;
else
*rInfo = 0;
++rInfo;
}
/* termination sentinel to simplify reg_info scans */
*rInfo = 0xffffffff;
}
/* Mark block boundaries (after jump inst, or branch target inst) */
static void create_bb_info(int *instInfo, int *funcBegin, int *funcEnd)
{
int *info, *scan, *dst;
int *instEnd = &instInfo[funcEnd-funcBegin];
for (info = instInfo; info <= instEnd; ++info) {
if (*info & RI_branch) {
scan = &funcBegin[info-instInfo];
if (((*scan >> 24) & 0x0f) == 0x0a) { // not a pc load
if (((*scan >> 28) & 0x0f) < 0x0e) { // conditional branch
// mark fall-through instruction
dst = skip_nop(scan+1, S_FWD);
instInfo[dst-funcBegin] |= RI_bb;
}
// ignore const blocks, but mark other branch destinations.
// Note: const blocks act as NOP instructions for dep analysis.
if (scan == skip_nop(scan, S_FWD)) {
// mark jump destination instruction
int tmp = (*scan & 0x00ffffff) |
((*scan & 0x00800000) ? 0xff000000 : 0);
dst = skip_nop(scan + 2 + tmp, S_FWD);
instInfo[dst-funcBegin] |= RI_bb;
}
}
}
}
}
/* find first def of reg in given direction */
static int *find_def(int *instInfo, int *rInfo, int reg, enum search_dir dir)
{
int *retVal = 0;
int info;
while( (rInfo > instInfo) &&
*rInfo != 0xffffffff ) { /* if in-bounds of func */
info = *rInfo;
if (info & RI_hasD) {
int cmpReg = (info & RI_RnDest) ?
(((info & RI_Rn)>>16) | ((info & RI_Sn)>>17)) :
(((info & RI_Rd)>>12) | ((info & RI_Sd)>>18));
if (reg == cmpReg) {
retVal = rInfo;
break;
}
}
else if ((info & RI_func) && reg == 0) {
retVal = rInfo; // only good for location, not content
break;
}
rInfo += dir;
}
return retVal;
}
/* find first use of reg in given direction */
static int *find_use(int *instInfo, int *rInfo, int reg, enum search_dir dir)
{
int *retVal = 0;
int info;
while( (rInfo > instInfo) &&
*rInfo != 0xffffffff ) { /* if in-bounds of func */
info = *rInfo;
if (info & RI_hasD) {
// if not a memory op or a memory read, disable dest reg
if ((info & (RI_memOp | RI_FPacc)) == 0 || (info & RI_memRW)) {
info ^= (info & RI_RnDest) ? RI_RnAct : RI_RdAct;
}
}
if ((info & RI_RmAct) &&
((info & RI_Rm) | ((info & RI_Sm)>>16)) == reg) {
retVal = rInfo;
break;
}
if (info & RI_RsAct && ((info & RI_Rs)>>8) == reg) {
retVal = rInfo;
break;
}
if (info & RI_RdAct &&
(((info & RI_Rd)>>12) | ((info & RI_Sd)>>18)) == reg) {
retVal = rInfo;
break;
}
if (info & RI_RnAct &&
(((info & RI_Rn)>>16) | ((info & RI_Sn)>>17)) == reg) {
retVal = rInfo;
break;
}
rInfo += dir;
}
return retVal;
}
/* pass in valid use and def pointer */
static int *find_use_precede_def(int *instInfo, int *use, int *def,
int reg, enum search_dir dir)
{
int *finalUse = use;
if (def != 0) {
do {
finalUse = use;
use = find_use(instInfo, use + dir, reg, dir);
} while ( use != 0 && use < def);
}
if (use == def) finalUse = def;
return finalUse;
}
static void reg_rename(int newreg, int oldreg, int *use, int *inst)
{
int regSet = 0;
int mask = (*use & RI_Active);
if ((*use & RI_hasD) /* && !(*use & RI_FPacc) */) // don't overwite dest reg
mask &= ~((*use & RI_RdDest) ? RI_RdAct : RI_RnAct);
if ((mask & RI_RmAct) && (*inst & RI_Rm) == oldreg)
regSet |= newreg;
else
mask &= ~RI_RmAct;
if ((mask & RI_RsAct) && ((*inst & RI_Rs) >> 8) == oldreg)
regSet |= (newreg << 8);
else
mask &= ~RI_RsAct;
if ((mask & RI_RdAct) && ((*inst & RI_Rd) >> 12) == oldreg)
regSet |= (newreg << 12);
else
mask &= ~RI_RdAct;
if ((mask & RI_RnAct) && ((*inst & RI_Rn) >> 16) == oldreg)
regSet |= (newreg << 16);
else
mask &= ~RI_RnAct;
if (mask & RI_Active) { // rename registers
*inst = (*inst & ~activeRegMask[mask >> 4]) | regSet;
*use = (*use & ~activeRegMask[mask >> 4]) | regSet;
}
}
static void reg_rename_f(int newreg, int oldreg, int *use, int *inst)
{
int regSet = 0;
int mask = (*use & RI_Active);
if (*use & RI_hasD) // don't overwite dest reg
mask &= ~RI_RdAct;
if ((mask & RI_RmAct) &&
((*use & RI_Rm) | ((*use & RI_Sm) >> 16)) == oldreg)
regSet |= ((newreg & 0x0f) | ((newreg & 0x10) << 16));
else
mask &= ~RI_RmAct;
if ((mask & RI_RdAct) &&
(((*use & RI_Rd) >> 12) | ((*use & RI_Sd) >> 18)) == oldreg)
regSet |= (((newreg & 0x0f) << 12) | ((newreg & 0x10) << 18));
else
mask &= ~RI_RdAct;
if ((mask & RI_RnAct) &&
(((*use & RI_Rn) >> 16) | ((*use & RI_Sn) >> 17)) == oldreg)
regSet |= (((newreg & 0x0f) << 16) | ((newreg & 0x10) << 17));
else
mask &= ~RI_RnAct;
if (mask & RI_Active) { // rename registers
int tmp = *inst;
if (mask & RI_RdAct) {
tmp = (tmp & ~(RI_Rd | RI_Sd)) |
((newreg & 0x1e) << 11) | ((newreg & 1) << 22);
}
if (mask & RI_RnAct) {
tmp = (tmp & ~(RI_Rn | 0x80)) |
((newreg & 0x1e) << 15) | ((newreg & 1) << 7);
}
if (mask & RI_RmAct) {
tmp = (tmp & ~(RI_Rm | 0x20)) |
((newreg & 0x1e)>>1) | ((newreg & 1) << 5);
}
*inst = tmp;
*use = (*use & ~activeRegMask[mask >> 4]) | regSet;
}
}
/**********************************************************/
/********** peephole optimization funcs *******************/
/**********************************************************/
// remove add/sub of #0. Consolidate imm offset load, DP imm.
static void apply_peepholes1(int *funcBegin, int *funcEnd)
{
int *scan, *scanp1, *scanp2, *scanp3, off;
for (scan = funcBegin; scan < funcEnd; ++scan) {
if (*scan == 0xe2400000 || /* sub r0, r0, #0 */
*scan == 0xe2800000) { /* add r0, r0, #0 */
if (!is_const(scan)) *scan = NOP;
}
else if ((*scan & 0xfff00f00) == 0xe2800000 || // add rI, rS, #X
(*scan & 0xfff00f00) == 0xe2400000) { // sub rI, rS, #X
if (is_const(scan)) continue;
scanp1 = active_inst(scan, 1);
int rS = (*scan & RI_Rn) >> 16; // Source, RI_Rn
int rI = (*scan & RI_Rd) >> 12; // Index, RI_Rd
if ((*scanp1 & 0xff300000) == 0xe5100000 &&
((*scanp1 & RI_Rn) >> 16) == rI &&
((1 << rI) & UREG_MASK)) { // ldr[b] rX, [rI]
off = (*scanp1 & 0xfff) * ((*scanp1 & (1<<23)) ? 1 : -1);
off += (*scan & 0xff) *
(((*scan & 0xfff00000) == 0xe2800000) ? 1 : -1);
if (off < -4095 || off > 4095) continue;
*scanp1 = (*scanp1 & 0xff70f000) |
((off >= 0) ? (off | (1<<23)) : -off) |
(rS << 16); // ldr[b] rX, [rS, #X]
*scan = NOP;
scan = scanp1;
}
else if ((*scanp1 & 0xff7fff00) == 0xed100a00) { // vldr s0,[r0,#X]
off = (*scanp1 & 0xff) * ((*scanp1 & (1<<23)) ? 1 : -1);
off += ((*scan & 0xff) / 4) *
(((*scan & 0xfff00000) == 0xe2800000) ? 1 : -1);
if (off < -255 || off > 255) continue;
*scanp1 = (*scanp1 & 0xff70ff00) |
((off >= 0) ? (off | (1<<23)) : -off) |
(rS << 16); // vldr s0, [rS, #X]
*scan = NOP;
scan = scanp1;
}
}
else {
/* change register to immediate if possible */
if (*scan != 0xe52d0004) continue; // push {r0}
if (is_const(scan)) continue;
scanp1 = active_inst(scan, 1);
if ((*scanp1 & 0xfffff000) != 0xe3a00000) continue; // mov r0, #X
scanp2 = active_inst(scanp1, 1);
if (*scanp2 == 0xe49d1004) { // pop {r1}
scanp3 = active_inst(scanp2, 1);
if ((*scanp3 & 0xfe1fffff) == 0xe0010000 &&
(*scanp3>>23 & 0x3) != 0x2) { /* exclude comparisons */
*scanp3 = (*scanp3 ^ 1<<16) | 1<<25 | (*scanp1 & 0xfff);
*scan = NOP;
*scanp1 = NOP;
*scanp2 = NOP;
scan = scanp3 - 1;
}
else if (*scanp3 == 0xe1a00051 || /* asr r0, r1, r0 */
*scanp3 == 0xe1a00011) { /* lsl r0, r1, r0 */
int shift = ((*scanp1 & 0xff) < 0x20) ? (*scanp1 & 0x1f) : 0x1f;
*scanp3 = (*scanp3 & 0xffffffe0) | (shift << 7);
*scan = NOP;
*scanp1 = NOP;
*scanp2 = NOP;
scan = scanp3 - 1;
}
}
}
}
}
// find arr[x] pattern and consolidate index address into a single instruction