12 #define LOC_LOCAL 0x10
16 #define REG_PC 15 /* program counter */
17 #define REG_LR 14 /* link register */
18 #define REG_SP 13 /* stack pointer */
19 #define REG_TMP 12 /* temporary register */
20 #define REG_FP 11 /* frame pointer register */
21 #define REG_DP 10 /* data pointer register */
22 #define REG_RET 0 /* returned value register */
24 #define MIN(a, b) ((a) < (b) ? (a) : (b))
25 #define ALIGN(x, a) (((x) + (a) - 1) & ~((a) - 1))
27 static char cs
[SECSIZE
]; /* code segment */
29 static char ds
[SECSIZE
]; /* data segment */
31 static long bsslen
; /* bss segment size */
33 static int nogen
; /* don't generate code */
38 #define TMP(i) (((i) < ntmp) ? &tmps[ntmp - 1 - (i)] : NULL)
43 long off
; /* offset from a symbol or a local */
44 unsigned loc
; /* variable location */
45 unsigned bt
; /* type of address; zero when not a pointer */
51 static struct tmp
*regs
[NREGS
];
52 static int tmpregs
[] = {4, 5, 6, 7, 8, 9, 0, 1, 2, 3};
53 static int argregs
[] = {0, 1, 2, 3};
66 #define MAXRET (1 << 8)
68 static long ret
[MAXRET
];
71 /* output div/mod functions */
72 static int putdiv
= 0;
74 /* for optimizing cmp + bcc */
75 static long last_cmp
= -1;
76 static long last_set
= -1;
77 static long last_cond
;
79 static void os(void *s
, int n
)
81 memcpy(cs
+ cslen
, s
, n
);
85 static void oi(long n
)
89 *(int *) (cs
+ cslen
) = n
;
96 static long num_offs
[MAXNUMS
]; /* data immediate value */
97 static char num_names
[MAXNUMS
][NAMELEN
]; /* relocation data symbol name */
100 static int pool_find(char *name
, int off
)
103 for (i
= 0; i
< nums
; i
++)
104 if (!strcmp(name
, num_names
[i
]) && off
== num_offs
[i
])
109 static int pool_num(long num
)
111 int idx
= pool_find("", num
);
115 num_names
[idx
][0] = '\0';
120 static int pool_reloc(char *name
, long off
)
122 int idx
= pool_find(name
, off
);
126 strcpy(num_names
[idx
], name
);
131 static void pool_write(void)
134 for (i
= 0; i
< nums
; i
++) {
136 out_rel(num_names
[i
], OUT_CS
, cslen
);
143 * +---------------------------------------+
144 * |COND|00|I| op |S| Rn | Rd | operand2 |
145 * +---------------------------------------+
147 * S: set condition code
149 * Rd: destination operand
151 * I=0 operand2=| shift | Rm |
152 * I=1 operand2=|rota| imm |
154 #define ADD(op, rd, rn, s, i, cond) \
155 (((cond) << 28) | ((i) << 25) | ((s) << 20) | \
156 ((op) << 21) | ((rn) << 16) | ((rd) << 12))
158 static void i_add(int op
, int rd
, int rn
, int rm
)
160 oi(ADD(op
, rd
, rn
, 0, 0, 14) | rm
);
163 static int add_encimm(unsigned n
)
166 while (i
< 12 && (n
>> ((4 + i
) << 1)))
168 return (n
>> (i
<< 1)) | (((16 - i
) & 0x0f) << 8);
171 static int add_decimm(unsigned n
)
173 int rot
= (16 - ((n
>> 8) & 0x0f)) & 0x0f;
174 return (n
& 0xff) << (rot
<< 1);
177 static int add_rndimm(unsigned n
)
179 int rot
= (n
>> 8) & 0x0f;
185 rot
= (rot
+ 12) & 0x0f;
187 return ((num
+ 1) & 0xff) | (rot
<< 8);
190 static void i_ldr(int l
, int rd
, int rn
, int off
, int bt
);
192 static void i_num(int rd
, long n
)
195 int p
= neg
? -n
- 1 : n
;
196 int enc
= add_encimm(p
);
197 if (p
== add_decimm(enc
)) {
198 oi(ADD(neg
? I_MVN
: I_MOV
, rd
, 0, 0, 1, 14) | enc
);
201 int off
= pool_num(n
);
202 i_ldr(1, rd
, REG_DP
, off
, LONGSZ
);
207 static void i_add_imm(int op
, int rd
, int rn
, int n
)
210 int imm
= add_encimm(neg
? -n
: n
);
211 if (imm
== add_decimm(neg
? -n
: n
)) {
212 oi(ADD(neg
? I_SUB
: I_ADD
, rd
, rn
, 0, 1, 14) | imm
);
215 i_add(I_ADD
, rd
, rd
, rn
);
221 * +----------------------------------------+
222 * |COND|000000|A|S| Rd | Rn | Rs |1001| Rm |
223 * +----------------------------------------+
227 * C: set condition codes
229 * I=0 operand2=| shift | Rm |
230 * I=1 operand2=|rota| imm |
232 #define MUL(rd, rn, rs) \
233 ((14 << 28) | ((rd) << 16) | ((0) << 12) | ((rn) << 8) | ((9) << 4) | (rm))
235 static void i_mul(int rd
, int rn
, int rm
)
240 static void i_cmp(int op
, int rn
, int rm
)
242 oi(ADD(op
, 0, rn
, 1, 0, 14) | rm
);
246 static void i_set(int cond
, int rd
)
250 oi(ADD(I_MOV
, rd
, 0, 0, 1, 14));
251 oi(ADD(I_MOV
, rd
, 0, 0, 1, cond
) | 1);
258 static void i_shl(int sm
, int rd
, int rm
, int rs
)
260 oi(ADD(I_MOV
, rd
, 0, 0, 0, 14) | (rs
<< 8) | (sm
<< 5) | (1 << 4) | rm
);
263 static void i_shl_imm(int sm
, int rd
, int n
)
265 oi(ADD(I_MOV
, rd
, 0, 0, 0, 14) | (n
<< 7) | (sm
<< 5) | rd
);
268 static void i_mov(int op
, int rd
, int rn
)
270 oi(ADD(op
, rd
, 0, 0, 0, 14) | rn
);
274 * single data transfer:
275 * +------------------------------------------+
276 * |COND|01|I|P|U|B|W|L| Rn | Rd | offset |
277 * +------------------------------------------+
279 * I: immediate/offset
280 * P: post/pre indexing
286 * Rd: source/destination register
288 * I=0 offset=| immediate |
289 * I=1 offset=| shift | Rm |
291 * halfword and signed data transfer
292 * +----------------------------------------------+
293 * |COND|000|P|U|0|W|L| Rn | Rd |0000|1|S|H|1| Rm |
294 * +----------------------------------------------+
296 * +----------------------------------------------+
297 * |COND|000|P|U|1|W|L| Rn | Rd |off1|1|S|H|1|off2|
298 * +----------------------------------------------+
303 #define LDR(l, rd, rn, b, u, p, w) \
304 ((14 << 28) | (1 << 26) | ((p) << 24) | ((b) << 22) | ((u) << 23) | \
305 ((w) << 21) | ((l) << 20) | ((rn) << 16) | ((rd) << 12))
306 #define LDRH(l, rd, rn, s, h, u, i) \
307 ((14 << 28) | (1 << 24) | ((u) << 23) | ((i) << 22) | ((l) << 20) | \
308 ((rn) << 16) | ((rd) << 12) | ((s) << 6) | ((h) << 5) | (9 << 4))
310 static void i_ldr(int l
, int rd
, int rn
, int off
, int bt
)
312 int b
= BT_SZ(bt
) == 1;
313 int h
= BT_SZ(bt
) == 2;
314 int s
= l
&& (bt
& BT_SIGNED
);
315 int half
= h
|| (b
&& s
);
316 int maximm
= half
? 0x100 : 0x1000;
320 while (off
>= maximm
) {
321 int imm
= add_encimm(off
);
322 oi(ADD(neg
? I_SUB
: I_ADD
, rd
, rn
, 0, 1, 14) | imm
);
324 off
-= add_decimm(imm
);
327 oi(LDR(l
, rd
, rn
, b
, !neg
, 1, 0) | off
);
329 oi(LDRH(l
, rd
, rn
, s
, h
, !neg
, 1) |
330 ((off
& 0xf0) << 4) | (off
& 0x0f));
333 static void i_sym(int rd
, char *sym
, int off
)
336 int doff
= pool_reloc(sym
, off
);
337 i_ldr(1, rd
, REG_DP
, doff
, LONGSZ
);
341 static void i_neg(int rd
)
343 oi(ADD(I_RSB
, rd
, rd
, 0, 1, 14));
346 static void i_not(int rd
)
348 oi(ADD(I_MVN
, rd
, 0, rd
, 1, 14));
351 static void i_lnot(int rd
)
353 i_cmp(I_TST
, rd
, rd
);
354 oi(ADD(I_MOV
, rd
, 0, 0, 1, 14));
355 oi(ADD(I_MOV
, rd
, 0, 0, 1, 0) | 1);
358 /* rd = rd & ((1 << bits) - 1) */
359 static void i_zx(int rd
, int bits
)
362 oi(ADD(I_AND
, rd
, rd
, 0, 1, 14) | add_encimm((1 << bits
) - 1));
364 i_shl_imm(SM_LSL
, rd
, 32 - bits
);
365 i_shl_imm(SM_LSR
, rd
, 32 - bits
);
369 static void i_sx(int rd
, int bits
)
371 i_shl_imm(SM_LSL
, rd
, 32 - bits
);
372 i_shl_imm(SM_ASR
, rd
, 32 - bits
);
377 * +-----------------------------------+
378 * |COND|101|L| offset |
379 * +-----------------------------------+
383 #define BL(cond, l, o) (((cond) << 28) | (5 << 25) | ((l) << 24) | \
384 ((((o) - 8) >> 2) & 0x00ffffff))
386 static void i_b(long addr
)
388 oi(BL(14, 0, addr
- cslen
));
391 static void i_b_if(long addr
, int rn
, int z
)
393 static int nots
[] = {1, 0, 3, 2, -1, -1, -1, -1, 9, 8, 11, 10, 13, 12, -1};
394 if (last_cmp
+ 8 != cslen
|| last_set
!= last_cmp
) {
395 i_cmp(I_TST
, rn
, rn
);
396 oi(BL(z
? 0 : 1, 0, addr
- cslen
));
400 oi(BL(z
? nots
[last_cond
] : last_cond
, 0, addr
- cslen
));
403 static void i_b_fill(long *dst
, int diff
)
405 *dst
= (*dst
& 0xff000000) | (((diff
- 8) >> 2) & 0x00ffffff);
408 static void i_memcpy(int rd
, int rs
, int rn
)
410 oi(ADD(I_SUB
, rn
, rn
, 1, 1, 14) | 1);
412 oi(LDR(1, REG_TMP
, rs
, 1, 1, 0, 0) | 1);
413 oi(LDR(0, REG_TMP
, rd
, 1, 1, 0, 0) | 1);
417 static void i_memset(int rd
, int rs
, int rn
)
419 oi(ADD(I_SUB
, rn
, rn
, 1, 1, 14) | 1);
421 oi(LDR(0, rs
, rd
, 1, 1, 0, 0) | 1);
425 static void i_call_reg(int rd
)
427 i_mov(I_MOV
, REG_LR
, REG_PC
);
428 i_mov(I_MOV
, REG_PC
, rd
);
431 static void i_call(char *sym
)
434 out_rel(sym
, OUT_CS
| OUT_REL24
, cslen
);
438 static void i_prolog(void)
442 oi(0xe1a0c00d); /* mov r12, sp */
443 oi(0xe92d000f); /* stmfd sp!, {r0-r3} */
444 oi(0xe92d5ff0); /* stmfd sp!, {r0-r11, r12, lr} */
445 oi(0xe1a0b00d); /* mov fp, sp */
446 oi(0xe24dd000); /* sub sp, sp, xx */
447 oi(0xe28fa000); /* add dp, pc, xx */
450 static void i_epilog(void)
453 oi(0xe89baff0); /* ldmfd fp, {r4-r11, sp, pc} */
454 dpoff
= add_decimm(add_rndimm(add_encimm(cslen
- func_beg
- 28)));
455 cslen
= func_beg
+ dpoff
+ 28;
456 maxsp
= ALIGN(maxsp
, 8);
457 maxsp
= add_decimm(add_rndimm(add_encimm(maxsp
)));
458 /* fill stack sub: sp = sp - xx */
459 *(long *) (cs
+ func_beg
+ 16) |= add_encimm(maxsp
);
460 /* fill data ptr addition: dp = pc + xx */
461 *(long *) (cs
+ func_beg
+ 20) |= add_encimm(dpoff
);
465 static long sp_push(int size
)
473 static void tmp_mem(struct tmp
*tmp
)
476 if (!(tmp
->loc
== LOC_REG
))
480 tmp
->addr
= -sp_push(LONGSZ
);
481 i_ldr(0, src
, REG_FP
, tmp
->addr
, LONGSZ
);
486 static void num_cast(struct tmp
*t
, unsigned bt
)
488 if (!(bt
& BT_SIGNED
) && BT_SZ(bt
) != LONGSZ
)
489 t
->addr
&= ((1l << (long) (BT_SZ(bt
) * 8)) - 1);
490 if (bt
& BT_SIGNED
&& BT_SZ(bt
) != LONGSZ
&&
491 t
->addr
> (1l << (BT_SZ(bt
) * 8 - 1)))
492 t
->addr
= -((1l << (BT_SZ(bt
) * 8)) - t
->addr
);
495 static void tmp_reg(struct tmp
*tmp
, int dst
, int deref
)
502 if (tmp
->loc
== LOC_NUM
) {
503 i_num(dst
, tmp
->addr
);
508 if (tmp
->loc
== LOC_SYM
) {
509 i_sym(dst
, tmp
->sym
, tmp
->off
);
514 if (tmp
->loc
== LOC_REG
) {
516 i_ldr(1, dst
, tmp
->addr
, 0, bt
);
517 else if (dst
!= tmp
->addr
)
518 i_mov(I_MOV
, dst
, tmp
->addr
);
519 regs
[tmp
->addr
] = NULL
;
521 if (tmp
->loc
== LOC_LOCAL
) {
523 i_ldr(1, dst
, REG_FP
, tmp
->addr
+ tmp
->off
, bt
);
525 i_add_imm(I_ADD
, dst
, REG_FP
, tmp
->addr
+ tmp
->off
);
527 if (tmp
->loc
== LOC_MEM
) {
528 i_ldr(1, dst
, REG_FP
, tmp
->addr
, LONGSZ
);
530 i_ldr(1, dst
, dst
, 0, bt
);
537 static void reg_free(int reg
)
542 for (i
= 0; i
< ARRAY_SIZE(tmpregs
); i
++)
543 if (!regs
[tmpregs
[i
]]) {
544 tmp_reg(regs
[reg
], tmpregs
[i
], 0);
550 static void reg_for(int reg
, struct tmp
*t
)
552 if (regs
[reg
] && regs
[reg
] != t
)
556 static void tmp_mv(struct tmp
*t
, int reg
)
562 static void tmp_to(struct tmp
*t
, int reg
)
568 static void tmp_drop(int n
)
571 for (i
= ntmp
- n
; i
< ntmp
; i
++)
572 if (tmps
[i
].loc
== LOC_REG
)
573 regs
[tmps
[i
].addr
] = NULL
;
577 static void tmp_pop(int reg
)
579 struct tmp
*t
= TMP(0);
584 static struct tmp
*tmp_new(void)
586 return &tmps
[ntmp
++];
589 static void tmp_push(int reg
)
591 struct tmp
*t
= tmp_new();
598 void o_local(long addr
)
600 struct tmp
*t
= tmp_new();
609 struct tmp
*t
= tmp_new();
615 void o_sym(char *name
)
617 struct tmp
*t
= tmp_new();
618 strcpy(t
->sym
, name
);
624 void o_tmpdrop(int n
)
626 if (n
== -1 || n
> ntmp
)
636 #define FORK_REG 0x00
638 /* make sure tmps remain intact after a conditional expression */
642 for (i
= 0; i
< ntmp
- 1; i
++)
646 void o_forkpush(void)
651 void o_forkjoin(void)
658 struct tmp
*t1
= TMP(0);
659 struct tmp
*t2
= TMP(1);
661 memcpy(&t
, t1
, sizeof(t
));
662 memcpy(t1
, t2
, sizeof(t
));
663 memcpy(t2
, &t
, sizeof(t
));
664 if (t1
->loc
== LOC_REG
)
666 if (t2
->loc
== LOC_REG
)
670 static int reg_get(int mask
)
673 for (i
= 0; i
< ARRAY_SIZE(tmpregs
); i
++)
674 if ((1 << tmpregs
[i
]) & mask
&& !regs
[tmpregs
[i
]])
676 for (i
= 0; i
< ARRAY_SIZE(tmpregs
); i
++)
677 if ((1 << tmpregs
[i
]) & mask
) {
678 reg_free(tmpregs
[i
]);
684 static int reg_fortmp(struct tmp
*t
, int notmask
)
686 if (t
->loc
== LOC_REG
&& !(notmask
& (1 << t
->addr
)))
688 return reg_get(~notmask
);
691 static void tmp_copy(struct tmp
*t1
)
693 struct tmp
*t2
= tmp_new();
694 memcpy(t2
, t1
, sizeof(*t1
));
695 if (!(t1
->loc
& (LOC_REG
| LOC_MEM
)))
697 if (t1
->loc
== LOC_MEM
) {
698 tmp_mv(t2
, reg_get(~0));
699 } else if (t1
->loc
== LOC_REG
) {
700 t2
->addr
= reg_fortmp(t2
, 1 << t1
->addr
);
701 i_mov(I_MOV
, t2
->addr
, t1
->addr
);
711 void o_cast(unsigned bt
)
713 struct tmp
*t
= TMP(0);
718 if (t
->loc
== LOC_NUM
) {
722 if (BT_SZ(bt
) != LONGSZ
) {
723 int reg
= reg_fortmp(t
, 0);
726 i_sx(reg
, BT_SZ(bt
) * 8);
728 i_zx(reg
, BT_SZ(bt
) * 8);
732 void o_func_beg(char *name
, int global
)
734 out_sym(name
, (global
? OUT_GLOB
: 0) | OUT_CS
, cslen
, 0);
741 memset(regs
, 0, sizeof(regs
));
744 void o_deref(unsigned bt
)
746 struct tmp
*t
= TMP(0);
748 tmp_to(t
, reg_fortmp(t
, 0));
754 struct tmp
*t
= TMP(0);
755 tmp_to(t
, reg_fortmp(t
, 0));
758 #define TMP_NUM(t) ((t)->loc == LOC_NUM && !(t)->bt)
759 #define LOCAL_PTR(t) ((t)->loc == LOC_LOCAL && !(t)->bt)
760 #define SYM_PTR(t) ((t)->loc == LOC_SYM && !(t)->bt)
762 int o_popnum(long *c
)
764 struct tmp
*t
= TMP(0);
778 ret
[nret
++] = o_jmp(0);
781 void o_func_end(void)
784 if (nret
&& ret
[nret
- 1] == cslen
- 4) {
788 for (i
= 0; i
< nret
; i
++)
793 long o_mklocal(int size
)
795 return sp_push(ALIGN(size
, LONGSZ
));
798 void o_rmlocal(long addr
, int sz
)
805 return -(10 + i
) << 2;
808 void o_assign(unsigned bt
)
810 struct tmp
*t1
= TMP(0);
811 struct tmp
*t2
= TMP(1);
812 int r1
= reg_fortmp(t1
, 0);
813 int r2
= reg_fortmp(t2
, 1 << r1
);
818 if (t2
->loc
== LOC_LOCAL
) {
820 off
= t2
->addr
+ t2
->off
;
825 i_ldr(0, r1
, r2
, off
, bt
);
829 static long cu(int op
, long i
)
842 static int c_uop(int op
)
844 struct tmp
*t1
= TMP(0);
848 o_num(cu(op
, t1
->addr
));
852 static long cb(int op
, long a
, long b
)
877 return (unsigned long) a
>> b
;
894 static int c_bop(int op
)
896 struct tmp
*t1
= TMP(0);
897 struct tmp
*t2
= TMP(1);
898 int locals
= LOCAL_PTR(t1
) + LOCAL_PTR(t2
);
899 int syms
= SYM_PTR(t1
) + SYM_PTR(t2
);
900 int nums
= TMP_NUM(t1
) + TMP_NUM(t2
);
901 if (syms
+ locals
== 2 || syms
+ nums
+ locals
!= 2)
904 if ((op
& 0xff) != O_ADD
&& ((op
& 0xff) != O_SUB
|| TMP_NUM(t2
)))
907 long o1
= TMP_NUM(t1
) ? t1
->addr
: t1
->off
;
908 long o2
= TMP_NUM(t2
) ? t2
->addr
: t2
->off
;
909 long ret
= cb(op
, o2
, o1
);
915 long ret
= cb(op
, t2
->addr
, t1
->addr
);
924 int r1
= reg_fortmp(TMP(0), 0);
941 static void bin_regs(int *r1
, int *r2
)
943 struct tmp
*t2
= TMP(0);
944 struct tmp
*t1
= TMP(1);
945 *r2
= reg_fortmp(t2
, 0);
947 *r1
= reg_fortmp(t1
, 1 << *r2
);
952 static void bin_add(int op
)
954 /* opcode for O_ADD, O_SUB, O_AND, O_OR, O_XOR */
955 static int rx
[] = {I_ADD
, I_SUB
, I_AND
, I_ORR
, I_EOR
};
958 i_add(rx
[op
& 0x0f], r1
, r1
, r2
);
962 static void bin_shx(int op
)
967 if ((op
& 0x0f) == 1)
968 sm
= op
& O_SIGNED
? SM_ASR
: SM_LSR
;
969 i_shl(sm
, r1
, r1
, r2
);
973 static int log2a(unsigned long n
)
976 for (i
= 0; i
< LONGSZ
* 8; i
++)
979 if (i
== LONGSZ
* 8 || !(n
>> (i
+ 1)))
984 /* optimized version of mul/div/mod for powers of two */
985 static int mul_2(int op
)
987 struct tmp
*t1
= TMP(0);
988 struct tmp
*t2
= TMP(1);
992 if ((op
& 0xff) == O_MUL
&& t2
->loc
== LOC_NUM
&& !t2
->bt
)
994 if (t1
->loc
!= LOC_NUM
|| t1
->bt
)
1000 if ((op
& 0xff) == O_MUL
) {
1009 r2
= reg_fortmp(t2
, 0);
1011 i_shl_imm(SM_LSL
, r2
, p
);
1018 r2
= reg_fortmp(t2
, 0);
1020 i_shl_imm(op
& O_SIGNED
? SM_ASR
: SM_LSR
, r2
, p
);
1030 r2
= reg_fortmp(t2
, 0);
1038 static void bin_div(int op
)
1040 struct tmp
*t2
= TMP(0);
1041 struct tmp
*t1
= TMP(1);
1045 if ((op
& 0xff) == O_DIV
)
1046 func
= op
& O_SIGNED
? "__divdi3" : "__udivdi3";
1048 func
= op
& O_SIGNED
? "__moddi3" : "__umoddi3";
1049 for (i
= 0; i
< ARRAY_SIZE(argregs
); i
++)
1050 if (regs
[argregs
[i
]] && regs
[argregs
[i
]] - tmps
< ntmp
- 2)
1051 tmp_mem(regs
[argregs
[i
]]);
1052 tmp_to(t1
, argregs
[0]);
1053 tmp_to(t2
, argregs
[1]);
1059 static void bin_mul(int op
)
1064 if ((op
& 0xff) == O_DIV
|| (op
& 0xff) == O_MOD
) {
1073 static void bin_cmp(int op
)
1075 /* lt, gt, le, ge, eq, neq */
1076 static int ucond
[] = {3, 8, 9, 2, 0, 1};
1077 static int scond
[] = {11, 12, 13, 10, 0, 1};
1080 i_cmp(I_CMP
, r1
, r2
);
1081 i_set(op
& O_SIGNED
? scond
[op
& 0x0f] : ucond
[op
& 0x0f], r1
);
1089 if ((op
& 0xf0) == 0x00)
1091 if ((op
& 0xf0) == 0x10)
1093 if ((op
& 0xf0) == 0x20)
1095 if ((op
& 0xf0) == 0x30)
1099 static void load_regs2(int *r0
, int *r1
, int *r2
)
1101 struct tmp
*t0
= TMP(0);
1102 struct tmp
*t1
= TMP(1);
1103 struct tmp
*t2
= TMP(2);
1104 *r0
= reg_fortmp(t0
, 0);
1105 *r1
= reg_fortmp(t1
, 1 << *r0
);
1106 *r2
= reg_fortmp(t2
, (1 << *r0
) | (1 << *r1
));
1115 load_regs2(&rn
, &rs
, &rd
);
1116 i_memcpy(rd
, rs
, rn
);
1123 load_regs2(&rn
, &rs
, &rd
);
1124 i_memset(rd
, rs
, rn
);
1128 long o_mklabel(void)
1133 static long jxz(long addr
, int z
)
1135 int r
= reg_fortmp(TMP(0), 0);
1141 long o_jz(long addr
)
1143 return jxz(addr
, 1);
1146 long o_jnz(long addr
)
1148 return jxz(addr
, 0);
1151 long o_jmp(long addr
)
1157 void o_filljmp2(long addr
, long jmpdst
)
1159 i_b_fill((void *) cs
+ addr
, jmpdst
- addr
);
1162 void o_filljmp(long addr
)
1164 o_filljmp2(addr
, cslen
);
1167 void o_call(int argc
, int rets
)
1171 int aregs
= MIN(ARRAY_SIZE(argregs
), argc
);
1172 for (i
= 0; i
< ARRAY_SIZE(argregs
); i
++)
1173 if (regs
[argregs
[i
]] && regs
[argregs
[i
]] - tmps
< ntmp
- argc
)
1174 tmp_mem(regs
[argregs
[i
]]);
1176 sp_push(LONGSZ
* (argc
- aregs
));
1177 for (i
= argc
- 1; i
>= aregs
; --i
) {
1178 int reg
= reg_fortmp(TMP(0), 0);
1180 i_ldr(0, reg
, REG_SP
, (i
- aregs
) * LONGSZ
, LONGSZ
);
1183 for (i
= aregs
- 1; i
>= 0; --i
)
1184 tmp_to(TMP(aregs
- i
- 1), argregs
[i
]);
1187 if (t
->loc
== LOC_SYM
&& !t
->bt
) {
1191 int reg
= t
->loc
== LOC_REG
? t
->addr
: REG_TMP
;
1209 void dat_bss(char *name
, int size
, int global
)
1211 out_sym(name
, OUT_BSS
| (global
? OUT_GLOB
: 0), bsslen
, size
);
1212 bsslen
+= ALIGN(size
, LONGSZ
);
1215 #define MAXDATS (1 << 10)
1216 static char dat_names
[MAXDATS
][NAMELEN
];
1217 static int dat_offs
[MAXDATS
];
1220 void err(char *msg
);
1221 void *dat_dat(char *name
, int size
, int global
)
1223 void *addr
= ds
+ dslen
;
1226 err("nomem: MAXDATS reached!\n");
1227 strcpy(dat_names
[idx
], name
);
1228 dat_offs
[idx
] = dslen
;
1229 out_sym(name
, OUT_DS
| (global
? OUT_GLOB
: 0), dslen
, size
);
1230 dslen
+= ALIGN(size
, LONGSZ
);
1234 static int dat_off(char *name
)
1237 for (i
= 0; i
< ndats
; i
++)
1238 if (!strcmp(name
, dat_names
[i
]))
1243 void o_datset(char *name
, int off
, unsigned bt
)
1245 struct tmp
*t
= TMP(0);
1246 int sym_off
= dat_off(name
) + off
;
1247 if (t
->loc
== LOC_NUM
&& !t
->bt
) {
1249 memcpy(ds
+ sym_off
, &t
->addr
, BT_SZ(bt
));
1251 if (t
->loc
== LOC_SYM
&& !t
->bt
) {
1252 out_rel(t
->sym
, OUT_DS
, sym_off
);
1253 memcpy(ds
+ sym_off
, &t
->off
, BT_SZ(bt
));
1258 /* compiled division functions; div.s contains the source */
1259 static int udivdi3
[] = {
1260 0xe3a02000, 0xe3a03000, 0xe1110001, 0x0a00000a,
1261 0xe1b0c211, 0xe2822001, 0x5afffffc, 0xe3a0c001,
1262 0xe2522001, 0x4a000004, 0xe1500211, 0x3afffffb,
1263 0xe0400211, 0xe083321c, 0xeafffff8, 0xe1a01000,
1264 0xe1a00003, 0xe1a0f00e,
1266 static int umoddi3
[] = {
1267 0xe92d4000, 0xebffffeb, 0xe1a00001, 0xe8bd8000,
1269 static int divdi3
[] = {
1270 0xe92d4030, 0xe1a04000, 0xe1a05001, 0xe1100000,
1271 0x42600000, 0xe1110001, 0x42611000, 0xebffffe1,
1272 0xe1340005, 0x42600000, 0xe1140004, 0x42611000,
1275 static int moddi3
[] = {
1276 0xe92d4000, 0xebfffff0, 0xe1a00001, 0xe8bd8000,
1279 void o_write(int fd
)
1282 out_sym("__udivdi3", OUT_CS
, cslen
, 0);
1283 os(udivdi3
, sizeof(udivdi3
));
1284 out_sym("__umoddi3", OUT_CS
, cslen
, 0);
1285 os(umoddi3
, sizeof(umoddi3
));
1286 out_sym("__divdi3", OUT_CS
, cslen
, 0);
1287 os(divdi3
, sizeof(divdi3
));
1288 out_sym("__moddi3", OUT_CS
, cslen
, 0);
1289 os(moddi3
, sizeof(moddi3
));
1291 out_write(fd
, cs
, cslen
, ds
, dslen
);