1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2 * Mupen64plus - new_dynarec.c *
3 * Copyright (C) 2009-2011 Ari64 *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program; if not, write to the *
17 * Free Software Foundation, Inc., *
18 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
19 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
22 #include <stdint.h> //include for uint64_t
25 #include "emu_if.h" //emulator interface
30 #include "assem_x86.h"
33 #include "assem_x64.h"
36 #include "assem_arm.h"
40 #define MAX_OUTPUT_BLOCK_SIZE 262144
41 #define CLOCK_DIVIDER 2
45 signed char regmap_entry[HOST_REGS];
46 signed char regmap[HOST_REGS];
55 uint64_t constmap[HOST_REGS];
63 struct ll_entry *next;
69 char insn[MAXBLOCK][10];
70 u_char itype[MAXBLOCK];
71 u_char opcode[MAXBLOCK];
72 u_char opcode2[MAXBLOCK];
80 u_char dep1[MAXBLOCK];
81 u_char dep2[MAXBLOCK];
85 char likely[MAXBLOCK];
88 uint64_t unneeded_reg[MAXBLOCK];
89 uint64_t unneeded_reg_upper[MAXBLOCK];
90 uint64_t branch_unneeded_reg[MAXBLOCK];
91 uint64_t branch_unneeded_reg_upper[MAXBLOCK];
92 uint64_t p32[MAXBLOCK];
93 uint64_t pr32[MAXBLOCK];
94 signed char regmap_pre[MAXBLOCK][HOST_REGS];
95 signed char regmap[MAXBLOCK][HOST_REGS];
96 signed char regmap_entry[MAXBLOCK][HOST_REGS];
97 uint64_t constmap[MAXBLOCK][HOST_REGS];
98 struct regstat regs[MAXBLOCK];
99 struct regstat branch_regs[MAXBLOCK];
100 signed char minimum_free_regs[MAXBLOCK];
101 u_int needed_reg[MAXBLOCK];
102 uint64_t requires_32bit[MAXBLOCK];
103 u_int wont_dirty[MAXBLOCK];
104 u_int will_dirty[MAXBLOCK];
107 u_int instr_addr[MAXBLOCK];
108 u_int link_addr[MAXBLOCK][3];
110 u_int stubs[MAXBLOCK*3][8];
112 u_int literals[1024][2];
117 struct ll_entry *jump_in[4096];
118 struct ll_entry *jump_out[4096];
119 struct ll_entry *jump_dirty[4096];
120 u_int hash_table[65536][4] __attribute__((aligned(16)));
121 char shadow[1048576] __attribute__((aligned(16)));
127 static const u_int using_tlb=0;
129 static u_int sp_in_mirror;
130 u_int stop_after_jal;
131 extern u_char restore_candidate[512];
132 extern int cycle_count;
134 /* registers that may be allocated */
136 #define HIREG 32 // hi
137 #define LOREG 33 // lo
138 #define FSREG 34 // FPU status (FCSR)
139 #define CSREG 35 // Coprocessor status
140 #define CCREG 36 // Cycle count
141 #define INVCP 37 // Pointer to invalid_code
142 #define MMREG 38 // Pointer to memory_map
143 #define ROREG 39 // ram offset (if rdram!=0x80000000)
145 #define FTEMP 40 // FPU temporary register
146 #define PTEMP 41 // Prefetch temporary register
147 #define TLREG 42 // TLB mapping offset
148 #define RHASH 43 // Return address hash
149 #define RHTBL 44 // Return address hash table address
150 #define RTEMP 45 // JR/JALR address register
152 #define AGEN1 46 // Address generation temporary register
153 #define AGEN2 47 // Address generation temporary register
154 #define MGEN1 48 // Maptable address generation temporary register
155 #define MGEN2 49 // Maptable address generation temporary register
156 #define BTREG 50 // Branch target temporary register
158 /* instruction types */
159 #define NOP 0 // No operation
160 #define LOAD 1 // Load
161 #define STORE 2 // Store
162 #define LOADLR 3 // Unaligned load
163 #define STORELR 4 // Unaligned store
164 #define MOV 5 // Move
165 #define ALU 6 // Arithmetic/logic
166 #define MULTDIV 7 // Multiply/divide
167 #define SHIFT 8 // Shift by register
168 #define SHIFTIMM 9// Shift by immediate
169 #define IMM16 10 // 16-bit immediate
170 #define RJUMP 11 // Unconditional jump to register
171 #define UJUMP 12 // Unconditional jump
172 #define CJUMP 13 // Conditional branch (BEQ/BNE/BGTZ/BLEZ)
173 #define SJUMP 14 // Conditional branch (regimm format)
174 #define COP0 15 // Coprocessor 0
175 #define COP1 16 // Coprocessor 1
176 #define C1LS 17 // Coprocessor 1 load/store
177 #define FJUMP 18 // Conditional branch (floating point)
178 #define FLOAT 19 // Floating point unit
179 #define FCONV 20 // Convert integer to float
180 #define FCOMP 21 // Floating point compare (sets FSREG)
181 #define SYSCALL 22// SYSCALL
182 #define OTHER 23 // Other
183 #define SPAN 24 // Branch/delay slot spans 2 pages
184 #define NI 25 // Not implemented
185 #define HLECALL 26// PCSX fake opcodes for HLE
186 #define COP2 27 // Coprocessor 2 move
187 #define C2LS 28 // Coprocessor 2 load/store
188 #define C2OP 29 // Coprocessor 2 operation
189 #define INTCALL 30// Call interpreter to handle rare corner cases
198 #define LOADBU_STUB 7
199 #define LOADHU_STUB 8
200 #define STOREB_STUB 9
201 #define STOREH_STUB 10
202 #define STOREW_STUB 11
203 #define STORED_STUB 12
204 #define STORELR_STUB 13
205 #define INVCODE_STUB 14
213 int new_recompile_block(int addr);
214 void *get_addr_ht(u_int vaddr);
215 void invalidate_block(u_int block);
216 void invalidate_addr(u_int addr);
217 void remove_hash(int vaddr);
220 void dyna_linker_ds();
222 void verify_code_vm();
223 void verify_code_ds();
226 void fp_exception_ds();
228 void jump_syscall_hle();
232 void new_dyna_leave();
237 void read_nomem_new();
238 void read_nomemb_new();
239 void read_nomemh_new();
240 void read_nomemd_new();
241 void write_nomem_new();
242 void write_nomemb_new();
243 void write_nomemh_new();
244 void write_nomemd_new();
245 void write_rdram_new();
246 void write_rdramb_new();
247 void write_rdramh_new();
248 void write_rdramd_new();
249 extern u_int memory_map[1048576];
251 // Needed by assembler
252 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32);
253 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty);
254 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr);
255 void load_all_regs(signed char i_regmap[]);
256 void load_needed_regs(signed char i_regmap[],signed char next_regmap[]);
257 void load_regs_entry(int t);
258 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i);
262 //#define DEBUG_CYCLE_COUNT 1
265 //#define assem_debug printf
266 //#define inv_debug printf
267 #define assem_debug nullf
268 #define inv_debug nullf
270 static void tlb_hacks()
274 if (strncmp((char *) ROM_HEADER->nom, "GOLDENEYE",9) == 0)
278 switch (ROM_HEADER->Country_code&0xFF)
290 // Unknown country code
294 u_int rom_addr=(u_int)rom;
296 // Since memory_map is 32-bit, on 64-bit systems the rom needs to be
297 // in the lower 4G of memory to use this hack. Copy it if necessary.
298 if((void *)rom>(void *)0xffffffff) {
299 munmap(ROM_COPY, 67108864);
300 if(mmap(ROM_COPY, 12582912,
301 PROT_READ | PROT_WRITE,
302 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
303 -1, 0) <= 0) {printf("mmap() failed\n");}
304 memcpy(ROM_COPY,rom,12582912);
305 rom_addr=(u_int)ROM_COPY;
309 for(n=0x7F000;n<0x80000;n++) {
310 memory_map[n]=(((u_int)(rom_addr+addr-0x7F000000))>>2)|0x40000000;
317 static u_int get_page(u_int vaddr)
320 u_int page=(vaddr^0x80000000)>>12;
322 u_int page=vaddr&~0xe0000000;
323 if (page < 0x1000000)
324 page &= ~0x0e00000; // RAM mirrors
328 if(page>262143&&tlb_LUT_r[vaddr>>12]) page=(tlb_LUT_r[vaddr>>12]^0x80000000)>>12;
330 if(page>2048) page=2048+(page&2047);
334 static u_int get_vpage(u_int vaddr)
336 u_int vpage=(vaddr^0x80000000)>>12;
338 if(vpage>262143&&tlb_LUT_r[vaddr>>12]) vpage&=2047; // jump_dirty uses a hash of the virtual address instead
340 if(vpage>2048) vpage=2048+(vpage&2047);
344 // Get address from virtual address
345 // This is called from the recompiled JR/JALR instructions
346 void *get_addr(u_int vaddr)
348 u_int page=get_page(vaddr);
349 u_int vpage=get_vpage(vaddr);
350 struct ll_entry *head;
351 //printf("TRACE: count=%d next=%d (get_addr %x,page %d)\n",Count,next_interupt,vaddr,page);
354 if(head->vaddr==vaddr&&head->reg32==0) {
355 //printf("TRACE: count=%d next=%d (get_addr match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
356 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
359 ht_bin[1]=(int)head->addr;
365 head=jump_dirty[vpage];
367 if(head->vaddr==vaddr&&head->reg32==0) {
368 //printf("TRACE: count=%d next=%d (get_addr match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
369 // Don't restore blocks which are about to expire from the cache
370 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
371 if(verify_dirty(head->addr)) {
372 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
373 invalid_code[vaddr>>12]=0;
374 memory_map[vaddr>>12]|=0x40000000;
377 if(tlb_LUT_r[vaddr>>12]) {
378 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
379 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
382 restore_candidate[vpage>>3]|=1<<(vpage&7);
384 else restore_candidate[page>>3]|=1<<(page&7);
385 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
386 if(ht_bin[0]==vaddr) {
387 ht_bin[1]=(int)head->addr; // Replace existing entry
393 ht_bin[1]=(int)head->addr;
401 //printf("TRACE: count=%d next=%d (get_addr no-match %x)\n",Count,next_interupt,vaddr);
402 int r=new_recompile_block(vaddr);
403 if(r==0) return get_addr(vaddr);
404 // Execute in unmapped page, generate pagefault execption
406 Cause=(vaddr<<31)|0x8;
407 EPC=(vaddr&1)?vaddr-5:vaddr;
409 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
410 EntryHi=BadVAddr&0xFFFFE000;
411 return get_addr_ht(0x80000000);
413 // Look up address in hash table first
414 void *get_addr_ht(u_int vaddr)
416 //printf("TRACE: count=%d next=%d (get_addr_ht %x)\n",Count,next_interupt,vaddr);
417 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
418 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
419 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
420 return get_addr(vaddr);
423 void *get_addr_32(u_int vaddr,u_int flags)
426 return get_addr(vaddr);
428 //printf("TRACE: count=%d next=%d (get_addr_32 %x,flags %x)\n",Count,next_interupt,vaddr,flags);
429 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
430 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
431 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
432 u_int page=get_page(vaddr);
433 u_int vpage=get_vpage(vaddr);
434 struct ll_entry *head;
437 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
438 //printf("TRACE: count=%d next=%d (get_addr_32 match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
440 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
442 ht_bin[1]=(int)head->addr;
444 }else if(ht_bin[2]==-1) {
445 ht_bin[3]=(int)head->addr;
448 //ht_bin[3]=ht_bin[1];
449 //ht_bin[2]=ht_bin[0];
450 //ht_bin[1]=(int)head->addr;
457 head=jump_dirty[vpage];
459 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
460 //printf("TRACE: count=%d next=%d (get_addr_32 match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
461 // Don't restore blocks which are about to expire from the cache
462 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
463 if(verify_dirty(head->addr)) {
464 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
465 invalid_code[vaddr>>12]=0;
466 memory_map[vaddr>>12]|=0x40000000;
469 if(tlb_LUT_r[vaddr>>12]) {
470 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
471 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
474 restore_candidate[vpage>>3]|=1<<(vpage&7);
476 else restore_candidate[page>>3]|=1<<(page&7);
478 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
480 ht_bin[1]=(int)head->addr;
482 }else if(ht_bin[2]==-1) {
483 ht_bin[3]=(int)head->addr;
486 //ht_bin[3]=ht_bin[1];
487 //ht_bin[2]=ht_bin[0];
488 //ht_bin[1]=(int)head->addr;
496 //printf("TRACE: count=%d next=%d (get_addr_32 no-match %x,flags %x)\n",Count,next_interupt,vaddr,flags);
497 int r=new_recompile_block(vaddr);
498 if(r==0) return get_addr(vaddr);
499 // Execute in unmapped page, generate pagefault execption
501 Cause=(vaddr<<31)|0x8;
502 EPC=(vaddr&1)?vaddr-5:vaddr;
504 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
505 EntryHi=BadVAddr&0xFFFFE000;
506 return get_addr_ht(0x80000000);
510 void clear_all_regs(signed char regmap[])
513 for (hr=0;hr<HOST_REGS;hr++) regmap[hr]=-1;
516 signed char get_reg(signed char regmap[],int r)
519 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map[hr]==r) return hr;
523 // Find a register that is available for two consecutive cycles
524 signed char get_reg2(signed char regmap1[],signed char regmap2[],int r)
527 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map1[hr]==r&®map2[hr]==r) return hr;
531 int count_free_regs(signed char regmap[])
535 for(hr=0;hr<HOST_REGS;hr++)
537 if(hr!=EXCLUDE_REG) {
538 if(regmap[hr]<0) count++;
544 void dirty_reg(struct regstat *cur,signed char reg)
548 for (hr=0;hr<HOST_REGS;hr++) {
549 if((cur->regmap[hr]&63)==reg) {
555 // If we dirty the lower half of a 64 bit register which is now being
556 // sign-extended, we need to dump the upper half.
557 // Note: Do this only after completion of the instruction, because
558 // some instructions may need to read the full 64-bit value even if
559 // overwriting it (eg SLTI, DSRA32).
560 static void flush_dirty_uppers(struct regstat *cur)
563 for (hr=0;hr<HOST_REGS;hr++) {
564 if((cur->dirty>>hr)&1) {
567 if((cur->is32>>(reg&63))&1) cur->regmap[hr]=-1;
572 void set_const(struct regstat *cur,signed char reg,uint64_t value)
576 for (hr=0;hr<HOST_REGS;hr++) {
577 if(cur->regmap[hr]==reg) {
579 cur->constmap[hr]=value;
581 else if((cur->regmap[hr]^64)==reg) {
583 cur->constmap[hr]=value>>32;
588 void clear_const(struct regstat *cur,signed char reg)
592 for (hr=0;hr<HOST_REGS;hr++) {
593 if((cur->regmap[hr]&63)==reg) {
594 cur->isconst&=~(1<<hr);
599 int is_const(struct regstat *cur,signed char reg)
604 for (hr=0;hr<HOST_REGS;hr++) {
605 if((cur->regmap[hr]&63)==reg) {
606 return (cur->isconst>>hr)&1;
611 uint64_t get_const(struct regstat *cur,signed char reg)
615 for (hr=0;hr<HOST_REGS;hr++) {
616 if(cur->regmap[hr]==reg) {
617 return cur->constmap[hr];
620 printf("Unknown constant in r%d\n",reg);
624 // Least soon needed registers
625 // Look at the next ten instructions and see which registers
626 // will be used. Try not to reallocate these.
627 void lsn(u_char hsn[], int i, int *preferred_reg)
637 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
639 // Don't go past an unconditonal jump
646 if(rs1[i+j]) hsn[rs1[i+j]]=j;
647 if(rs2[i+j]) hsn[rs2[i+j]]=j;
648 if(rt1[i+j]) hsn[rt1[i+j]]=j;
649 if(rt2[i+j]) hsn[rt2[i+j]]=j;
650 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
651 // Stores can allocate zero
655 // On some architectures stores need invc_ptr
656 #if defined(HOST_IMM8)
657 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
661 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
669 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
671 // Follow first branch
672 int t=(ba[i+b]-start)>>2;
673 j=7-b;if(t+j>=slen) j=slen-t-1;
676 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
677 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
678 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
679 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
682 // TODO: preferred register based on backward branch
684 // Delay slot should preferably not overwrite branch conditions or cycle count
685 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
686 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
687 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
693 // Coprocessor load/store needs FTEMP, even if not declared
694 if(itype[i]==C1LS||itype[i]==C2LS) {
697 // Load L/R also uses FTEMP as a temporary register
698 if(itype[i]==LOADLR) {
701 // Also SWL/SWR/SDL/SDR
702 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
705 // Don't remove the TLB registers either
706 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
709 // Don't remove the miniht registers
710 if(itype[i]==UJUMP||itype[i]==RJUMP)
717 // We only want to allocate registers if we're going to use them again soon
718 int needed_again(int r, int i)
724 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
726 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
727 return 0; // Don't need any registers if exiting the block
735 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
737 // Don't go past an unconditonal jump
741 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||itype[i+j]==INTCALL||((source[i+j]&0xfc00003f)==0x0d))
748 if(rs1[i+j]==r) rn=j;
749 if(rs2[i+j]==r) rn=j;
750 if((unneeded_reg[i+j]>>r)&1) rn=10;
751 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
759 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
761 // Follow first branch
763 int t=(ba[i+b]-start)>>2;
764 j=7-b;if(t+j>=slen) j=slen-t-1;
767 if(!((unneeded_reg[t+j]>>r)&1)) {
768 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
769 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
779 // Try to match register allocations at the end of a loop with those
781 int loop_reg(int i, int r, int hr)
790 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
792 // Don't go past an unconditonal jump
799 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
804 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
805 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
806 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
808 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
810 int t=(ba[i+k]-start)>>2;
811 int reg=get_reg(regs[t].regmap_entry,r);
812 if(reg>=0) return reg;
813 //reg=get_reg(regs[t+1].regmap_entry,r);
814 //if(reg>=0) return reg;
822 // Allocate every register, preserving source/target regs
823 void alloc_all(struct regstat *cur,int i)
827 for(hr=0;hr<HOST_REGS;hr++) {
828 if(hr!=EXCLUDE_REG) {
829 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
830 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
833 cur->dirty&=~(1<<hr);
836 if((cur->regmap[hr]&63)==0)
839 cur->dirty&=~(1<<hr);
846 void div64(int64_t dividend,int64_t divisor)
850 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
851 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
853 void divu64(uint64_t dividend,uint64_t divisor)
857 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
858 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
861 void mult64(uint64_t m1,uint64_t m2)
863 unsigned long long int op1, op2, op3, op4;
864 unsigned long long int result1, result2, result3, result4;
865 unsigned long long int temp1, temp2, temp3, temp4;
881 op1 = op2 & 0xFFFFFFFF;
882 op2 = (op2 >> 32) & 0xFFFFFFFF;
883 op3 = op4 & 0xFFFFFFFF;
884 op4 = (op4 >> 32) & 0xFFFFFFFF;
887 temp2 = (temp1 >> 32) + op1 * op4;
889 temp4 = (temp3 >> 32) + op2 * op4;
891 result1 = temp1 & 0xFFFFFFFF;
892 result2 = temp2 + (temp3 & 0xFFFFFFFF);
893 result3 = (result2 >> 32) + temp4;
894 result4 = (result3 >> 32);
896 lo = result1 | (result2 << 32);
897 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
906 void multu64(uint64_t m1,uint64_t m2)
908 unsigned long long int op1, op2, op3, op4;
909 unsigned long long int result1, result2, result3, result4;
910 unsigned long long int temp1, temp2, temp3, temp4;
912 op1 = m1 & 0xFFFFFFFF;
913 op2 = (m1 >> 32) & 0xFFFFFFFF;
914 op3 = m2 & 0xFFFFFFFF;
915 op4 = (m2 >> 32) & 0xFFFFFFFF;
918 temp2 = (temp1 >> 32) + op1 * op4;
920 temp4 = (temp3 >> 32) + op2 * op4;
922 result1 = temp1 & 0xFFFFFFFF;
923 result2 = temp2 + (temp3 & 0xFFFFFFFF);
924 result3 = (result2 >> 32) + temp4;
925 result4 = (result3 >> 32);
927 lo = result1 | (result2 << 32);
928 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
930 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
931 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
934 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
942 else original=loaded;
945 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
948 original>>=64-(bits^56);
949 original<<=64-(bits^56);
953 else original=loaded;
958 #include "assem_x86.c"
961 #include "assem_x64.c"
964 #include "assem_arm.c"
967 // Add virtual address mapping to linked list
968 void ll_add(struct ll_entry **head,int vaddr,void *addr)
970 struct ll_entry *new_entry;
971 new_entry=malloc(sizeof(struct ll_entry));
972 assert(new_entry!=NULL);
973 new_entry->vaddr=vaddr;
975 new_entry->addr=addr;
976 new_entry->next=*head;
980 // Add virtual address mapping for 32-bit compiled block
981 void ll_add_32(struct ll_entry **head,int vaddr,u_int reg32,void *addr)
983 ll_add(head,vaddr,addr);
985 (*head)->reg32=reg32;
989 // Check if an address is already compiled
990 // but don't return addresses which are about to expire from the cache
991 void *check_addr(u_int vaddr)
993 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
994 if(ht_bin[0]==vaddr) {
995 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
996 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
998 if(ht_bin[2]==vaddr) {
999 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
1000 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
1002 u_int page=get_page(vaddr);
1003 struct ll_entry *head;
1006 if(head->vaddr==vaddr&&head->reg32==0) {
1007 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1008 // Update existing entry with current address
1009 if(ht_bin[0]==vaddr) {
1010 ht_bin[1]=(int)head->addr;
1013 if(ht_bin[2]==vaddr) {
1014 ht_bin[3]=(int)head->addr;
1017 // Insert into hash table with low priority.
1018 // Don't evict existing entries, as they are probably
1019 // addresses that are being accessed frequently.
1021 ht_bin[1]=(int)head->addr;
1023 }else if(ht_bin[2]==-1) {
1024 ht_bin[3]=(int)head->addr;
1035 void remove_hash(int vaddr)
1037 //printf("remove hash: %x\n",vaddr);
1038 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1039 if(ht_bin[2]==vaddr) {
1040 ht_bin[2]=ht_bin[3]=-1;
1042 if(ht_bin[0]==vaddr) {
1043 ht_bin[0]=ht_bin[2];
1044 ht_bin[1]=ht_bin[3];
1045 ht_bin[2]=ht_bin[3]=-1;
1049 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1051 struct ll_entry *next;
1053 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1054 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1056 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1057 remove_hash((*head)->vaddr);
1064 head=&((*head)->next);
1069 // Remove all entries from linked list
1070 void ll_clear(struct ll_entry **head)
1072 struct ll_entry *cur;
1073 struct ll_entry *next;
1084 // Dereference the pointers and remove if it matches
1085 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1088 int ptr=get_pointer(head->addr);
1089 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1090 if(((ptr>>shift)==(addr>>shift)) ||
1091 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1093 inv_debug("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1094 u_int host_addr=(u_int)kill_pointer(head->addr);
1096 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1103 // This is called when we write to a compiled block (see do_invstub)
1104 void invalidate_page(u_int page)
1106 struct ll_entry *head;
1107 struct ll_entry *next;
1111 inv_debug("INVALIDATE: %x\n",head->vaddr);
1112 remove_hash(head->vaddr);
1117 head=jump_out[page];
1120 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1121 u_int host_addr=(u_int)kill_pointer(head->addr);
1123 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1130 void invalidate_block(u_int block)
1132 u_int page=get_page(block<<12);
1133 u_int vpage=get_vpage(block<<12);
1134 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1135 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1138 struct ll_entry *head;
1139 head=jump_dirty[vpage];
1140 //printf("page=%d vpage=%d\n",page,vpage);
1143 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1144 get_bounds((int)head->addr,&start,&end);
1145 //printf("start: %x end: %x\n",start,end);
1146 if(page<2048&&start>=0x80000000&&end<0x80000000+RAM_SIZE) {
1147 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1148 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1149 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1153 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1154 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1155 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1156 if((((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)&2047)>last) last=((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)&2047;
1163 //printf("first=%d last=%d\n",first,last);
1164 invalidate_page(page);
1165 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1166 assert(last<page+5);
1167 // Invalidate the adjacent pages if a block crosses a 4K boundary
1169 invalidate_page(first);
1172 for(first=page+1;first<last;first++) {
1173 invalidate_page(first);
1179 // Don't trap writes
1180 invalid_code[block]=1;
1182 invalid_code[((u_int)0x80000000>>12)|page]=1;
1185 // If there is a valid TLB entry for this page, remove write protect
1186 if(tlb_LUT_w[block]) {
1187 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1188 // CHECK: Is this right?
1189 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1190 u_int real_block=tlb_LUT_w[block]>>12;
1191 invalid_code[real_block]=1;
1192 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1194 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1198 memset(mini_ht,-1,sizeof(mini_ht));
1201 void invalidate_addr(u_int addr)
1203 invalidate_block(addr>>12);
1205 // This is called when loading a save state.
1206 // Anything could have changed, so invalidate everything.
1207 void invalidate_all_pages()
1210 for(page=0;page<4096;page++)
1211 invalidate_page(page);
1212 for(page=0;page<1048576;page++)
1213 if(!invalid_code[page]) {
1214 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1215 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1218 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1221 memset(mini_ht,-1,sizeof(mini_ht));
1225 for(page=0;page<0x100000;page++) {
1226 if(tlb_LUT_r[page]) {
1227 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1228 if(!tlb_LUT_w[page]||!invalid_code[page])
1229 memory_map[page]|=0x40000000; // Write protect
1231 else memory_map[page]=-1;
1232 if(page==0x80000) page=0xC0000;
1238 // Add an entry to jump_out after making a link
1239 void add_link(u_int vaddr,void *src)
1241 u_int page=get_page(vaddr);
1242 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1243 ll_add(jump_out+page,vaddr,src);
1244 //int ptr=get_pointer(src);
1245 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1248 // If a code block was found to be unmodified (bit was set in
1249 // restore_candidate) and it remains unmodified (bit is clear
1250 // in invalid_code) then move the entries for that 4K page from
1251 // the dirty list to the clean list.
1252 void clean_blocks(u_int page)
1254 struct ll_entry *head;
1255 inv_debug("INV: clean_blocks page=%d\n",page);
1256 head=jump_dirty[page];
1258 if(!invalid_code[head->vaddr>>12]) {
1259 // Don't restore blocks which are about to expire from the cache
1260 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1262 if(verify_dirty((int)head->addr)) {
1263 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1266 get_bounds((int)head->addr,&start,&end);
1267 if(start-(u_int)rdram<RAM_SIZE) {
1268 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1269 inv|=invalid_code[i];
1272 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1273 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1274 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1275 if(addr<start||addr>=end) inv=1;
1277 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1281 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1282 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1285 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1287 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1288 //printf("page=%x, addr=%x\n",page,head->vaddr);
1289 //assert(head->vaddr>>12==(page|0x80000));
1290 ll_add_32(jump_in+ppage,head->vaddr,head->reg32,clean_addr);
1291 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1293 if(ht_bin[0]==head->vaddr) {
1294 ht_bin[1]=(int)clean_addr; // Replace existing entry
1296 if(ht_bin[2]==head->vaddr) {
1297 ht_bin[3]=(int)clean_addr; // Replace existing entry
1310 void mov_alloc(struct regstat *current,int i)
1312 // Note: Don't need to actually alloc the source registers
1313 if((~current->is32>>rs1[i])&1) {
1314 //alloc_reg64(current,i,rs1[i]);
1315 alloc_reg64(current,i,rt1[i]);
1316 current->is32&=~(1LL<<rt1[i]);
1318 //alloc_reg(current,i,rs1[i]);
1319 alloc_reg(current,i,rt1[i]);
1320 current->is32|=(1LL<<rt1[i]);
1322 clear_const(current,rs1[i]);
1323 clear_const(current,rt1[i]);
1324 dirty_reg(current,rt1[i]);
1327 void shiftimm_alloc(struct regstat *current,int i)
1329 clear_const(current,rs1[i]);
1330 clear_const(current,rt1[i]);
1331 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1334 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1336 alloc_reg(current,i,rt1[i]);
1337 current->is32|=1LL<<rt1[i];
1338 dirty_reg(current,rt1[i]);
1341 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1344 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1345 alloc_reg64(current,i,rt1[i]);
1346 current->is32&=~(1LL<<rt1[i]);
1347 dirty_reg(current,rt1[i]);
1350 if(opcode2[i]==0x3c) // DSLL32
1353 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1354 alloc_reg64(current,i,rt1[i]);
1355 current->is32&=~(1LL<<rt1[i]);
1356 dirty_reg(current,rt1[i]);
1359 if(opcode2[i]==0x3e) // DSRL32
1362 alloc_reg64(current,i,rs1[i]);
1364 alloc_reg64(current,i,rt1[i]);
1365 current->is32&=~(1LL<<rt1[i]);
1367 alloc_reg(current,i,rt1[i]);
1368 current->is32|=1LL<<rt1[i];
1370 dirty_reg(current,rt1[i]);
1373 if(opcode2[i]==0x3f) // DSRA32
1376 alloc_reg64(current,i,rs1[i]);
1377 alloc_reg(current,i,rt1[i]);
1378 current->is32|=1LL<<rt1[i];
1379 dirty_reg(current,rt1[i]);
1384 void shift_alloc(struct regstat *current,int i)
1387 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1389 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1390 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1391 alloc_reg(current,i,rt1[i]);
1392 if(rt1[i]==rs2[i]) {
1393 alloc_reg_temp(current,i,-1);
1394 minimum_free_regs[i]=1;
1396 current->is32|=1LL<<rt1[i];
1397 } else { // DSLLV/DSRLV/DSRAV
1398 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1399 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1400 alloc_reg64(current,i,rt1[i]);
1401 current->is32&=~(1LL<<rt1[i]);
1402 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1404 alloc_reg_temp(current,i,-1);
1405 minimum_free_regs[i]=1;
1408 clear_const(current,rs1[i]);
1409 clear_const(current,rs2[i]);
1410 clear_const(current,rt1[i]);
1411 dirty_reg(current,rt1[i]);
1415 void alu_alloc(struct regstat *current,int i)
1417 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1419 if(rs1[i]&&rs2[i]) {
1420 alloc_reg(current,i,rs1[i]);
1421 alloc_reg(current,i,rs2[i]);
1424 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1425 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1427 alloc_reg(current,i,rt1[i]);
1429 current->is32|=1LL<<rt1[i];
1431 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1433 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1435 alloc_reg64(current,i,rs1[i]);
1436 alloc_reg64(current,i,rs2[i]);
1437 alloc_reg(current,i,rt1[i]);
1439 alloc_reg(current,i,rs1[i]);
1440 alloc_reg(current,i,rs2[i]);
1441 alloc_reg(current,i,rt1[i]);
1444 current->is32|=1LL<<rt1[i];
1446 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1448 if(rs1[i]&&rs2[i]) {
1449 alloc_reg(current,i,rs1[i]);
1450 alloc_reg(current,i,rs2[i]);
1454 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1455 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1457 alloc_reg(current,i,rt1[i]);
1458 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1460 if(!((current->uu>>rt1[i])&1)) {
1461 alloc_reg64(current,i,rt1[i]);
1463 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1464 if(rs1[i]&&rs2[i]) {
1465 alloc_reg64(current,i,rs1[i]);
1466 alloc_reg64(current,i,rs2[i]);
1470 // Is is really worth it to keep 64-bit values in registers?
1472 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1473 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1477 current->is32&=~(1LL<<rt1[i]);
1479 current->is32|=1LL<<rt1[i];
1483 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1485 if(rs1[i]&&rs2[i]) {
1486 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1487 alloc_reg64(current,i,rs1[i]);
1488 alloc_reg64(current,i,rs2[i]);
1489 alloc_reg64(current,i,rt1[i]);
1491 alloc_reg(current,i,rs1[i]);
1492 alloc_reg(current,i,rs2[i]);
1493 alloc_reg(current,i,rt1[i]);
1497 alloc_reg(current,i,rt1[i]);
1498 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1499 // DADD used as move, or zeroing
1500 // If we have a 64-bit source, then make the target 64 bits too
1501 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1502 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1503 alloc_reg64(current,i,rt1[i]);
1504 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1505 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1506 alloc_reg64(current,i,rt1[i]);
1508 if(opcode2[i]>=0x2e&&rs2[i]) {
1509 // DSUB used as negation - 64-bit result
1510 // If we have a 32-bit register, extend it to 64 bits
1511 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1512 alloc_reg64(current,i,rt1[i]);
1516 if(rs1[i]&&rs2[i]) {
1517 current->is32&=~(1LL<<rt1[i]);
1519 current->is32&=~(1LL<<rt1[i]);
1520 if((current->is32>>rs1[i])&1)
1521 current->is32|=1LL<<rt1[i];
1523 current->is32&=~(1LL<<rt1[i]);
1524 if((current->is32>>rs2[i])&1)
1525 current->is32|=1LL<<rt1[i];
1527 current->is32|=1LL<<rt1[i];
1531 clear_const(current,rs1[i]);
1532 clear_const(current,rs2[i]);
1533 clear_const(current,rt1[i]);
1534 dirty_reg(current,rt1[i]);
1537 void imm16_alloc(struct regstat *current,int i)
1539 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1541 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1542 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1543 current->is32&=~(1LL<<rt1[i]);
1544 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1545 // TODO: Could preserve the 32-bit flag if the immediate is zero
1546 alloc_reg64(current,i,rt1[i]);
1547 alloc_reg64(current,i,rs1[i]);
1549 clear_const(current,rs1[i]);
1550 clear_const(current,rt1[i]);
1552 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1553 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1554 current->is32|=1LL<<rt1[i];
1555 clear_const(current,rs1[i]);
1556 clear_const(current,rt1[i]);
1558 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1559 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1560 if(rs1[i]!=rt1[i]) {
1561 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1562 alloc_reg64(current,i,rt1[i]);
1563 current->is32&=~(1LL<<rt1[i]);
1566 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1567 if(is_const(current,rs1[i])) {
1568 int v=get_const(current,rs1[i]);
1569 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1570 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1571 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1573 else clear_const(current,rt1[i]);
1575 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1576 if(is_const(current,rs1[i])) {
1577 int v=get_const(current,rs1[i]);
1578 set_const(current,rt1[i],v+imm[i]);
1580 else clear_const(current,rt1[i]);
1581 current->is32|=1LL<<rt1[i];
1584 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1585 current->is32|=1LL<<rt1[i];
1587 dirty_reg(current,rt1[i]);
1590 void load_alloc(struct regstat *current,int i)
1592 clear_const(current,rt1[i]);
1593 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1594 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1595 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1597 alloc_reg(current,i,rt1[i]);
1598 if(get_reg(current->regmap,rt1[i])<0) {
1599 // dummy load, but we still need a register to calculate the address
1600 alloc_reg_temp(current,i,-1);
1601 minimum_free_regs[i]=1;
1603 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1605 current->is32&=~(1LL<<rt1[i]);
1606 alloc_reg64(current,i,rt1[i]);
1608 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1610 current->is32&=~(1LL<<rt1[i]);
1611 alloc_reg64(current,i,rt1[i]);
1612 alloc_all(current,i);
1613 alloc_reg64(current,i,FTEMP);
1614 minimum_free_regs[i]=HOST_REGS;
1616 else current->is32|=1LL<<rt1[i];
1617 dirty_reg(current,rt1[i]);
1618 // If using TLB, need a register for pointer to the mapping table
1619 if(using_tlb) alloc_reg(current,i,TLREG);
1620 // LWL/LWR need a temporary register for the old value
1621 if(opcode[i]==0x22||opcode[i]==0x26)
1623 alloc_reg(current,i,FTEMP);
1624 alloc_reg_temp(current,i,-1);
1625 minimum_free_regs[i]=1;
1630 // Load to r0 (dummy load)
1631 // but we still need a register to calculate the address
1632 if(opcode[i]==0x22||opcode[i]==0x26)
1634 alloc_reg(current,i,FTEMP); // LWL/LWR need another temporary
1636 alloc_reg_temp(current,i,-1);
1637 minimum_free_regs[i]=1;
1638 if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1640 alloc_all(current,i);
1641 alloc_reg64(current,i,FTEMP);
1642 minimum_free_regs[i]=HOST_REGS;
1647 void store_alloc(struct regstat *current,int i)
1649 clear_const(current,rs2[i]);
1650 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1651 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1652 alloc_reg(current,i,rs2[i]);
1653 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1654 alloc_reg64(current,i,rs2[i]);
1655 if(rs2[i]) alloc_reg(current,i,FTEMP);
1657 // If using TLB, need a register for pointer to the mapping table
1658 if(using_tlb) alloc_reg(current,i,TLREG);
1659 #if defined(HOST_IMM8)
1660 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1661 else alloc_reg(current,i,INVCP);
1663 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1664 alloc_reg(current,i,FTEMP);
1666 // We need a temporary register for address generation
1667 alloc_reg_temp(current,i,-1);
1668 minimum_free_regs[i]=1;
1671 void c1ls_alloc(struct regstat *current,int i)
1673 //clear_const(current,rs1[i]); // FIXME
1674 clear_const(current,rt1[i]);
1675 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1676 alloc_reg(current,i,CSREG); // Status
1677 alloc_reg(current,i,FTEMP);
1678 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1679 alloc_reg64(current,i,FTEMP);
1681 // If using TLB, need a register for pointer to the mapping table
1682 if(using_tlb) alloc_reg(current,i,TLREG);
1683 #if defined(HOST_IMM8)
1684 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1685 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1686 alloc_reg(current,i,INVCP);
1688 // We need a temporary register for address generation
1689 alloc_reg_temp(current,i,-1);
1692 void c2ls_alloc(struct regstat *current,int i)
1694 clear_const(current,rt1[i]);
1695 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1696 alloc_reg(current,i,FTEMP);
1697 // If using TLB, need a register for pointer to the mapping table
1698 if(using_tlb) alloc_reg(current,i,TLREG);
1699 #if defined(HOST_IMM8)
1700 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1701 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1702 alloc_reg(current,i,INVCP);
1704 // We need a temporary register for address generation
1705 alloc_reg_temp(current,i,-1);
1706 minimum_free_regs[i]=1;
1709 #ifndef multdiv_alloc
1710 void multdiv_alloc(struct regstat *current,int i)
1717 // case 0x1D: DMULTU
1720 clear_const(current,rs1[i]);
1721 clear_const(current,rs2[i]);
1724 if((opcode2[i]&4)==0) // 32-bit
1726 current->u&=~(1LL<<HIREG);
1727 current->u&=~(1LL<<LOREG);
1728 alloc_reg(current,i,HIREG);
1729 alloc_reg(current,i,LOREG);
1730 alloc_reg(current,i,rs1[i]);
1731 alloc_reg(current,i,rs2[i]);
1732 current->is32|=1LL<<HIREG;
1733 current->is32|=1LL<<LOREG;
1734 dirty_reg(current,HIREG);
1735 dirty_reg(current,LOREG);
1739 current->u&=~(1LL<<HIREG);
1740 current->u&=~(1LL<<LOREG);
1741 current->uu&=~(1LL<<HIREG);
1742 current->uu&=~(1LL<<LOREG);
1743 alloc_reg64(current,i,HIREG);
1744 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1745 alloc_reg64(current,i,rs1[i]);
1746 alloc_reg64(current,i,rs2[i]);
1747 alloc_all(current,i);
1748 current->is32&=~(1LL<<HIREG);
1749 current->is32&=~(1LL<<LOREG);
1750 dirty_reg(current,HIREG);
1751 dirty_reg(current,LOREG);
1752 minimum_free_regs[i]=HOST_REGS;
1757 // Multiply by zero is zero.
1758 // MIPS does not have a divide by zero exception.
1759 // The result is undefined, we return zero.
1760 alloc_reg(current,i,HIREG);
1761 alloc_reg(current,i,LOREG);
1762 current->is32|=1LL<<HIREG;
1763 current->is32|=1LL<<LOREG;
1764 dirty_reg(current,HIREG);
1765 dirty_reg(current,LOREG);
1770 void cop0_alloc(struct regstat *current,int i)
1772 if(opcode2[i]==0) // MFC0
1775 clear_const(current,rt1[i]);
1776 alloc_all(current,i);
1777 alloc_reg(current,i,rt1[i]);
1778 current->is32|=1LL<<rt1[i];
1779 dirty_reg(current,rt1[i]);
1782 else if(opcode2[i]==4) // MTC0
1785 clear_const(current,rs1[i]);
1786 alloc_reg(current,i,rs1[i]);
1787 alloc_all(current,i);
1790 alloc_all(current,i); // FIXME: Keep r0
1792 alloc_reg(current,i,0);
1797 // TLBR/TLBWI/TLBWR/TLBP/ERET
1798 assert(opcode2[i]==0x10);
1799 alloc_all(current,i);
1801 minimum_free_regs[i]=HOST_REGS;
1804 void cop1_alloc(struct regstat *current,int i)
1806 alloc_reg(current,i,CSREG); // Load status
1807 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1810 clear_const(current,rt1[i]);
1812 alloc_reg64(current,i,rt1[i]); // DMFC1
1813 current->is32&=~(1LL<<rt1[i]);
1815 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1816 current->is32|=1LL<<rt1[i];
1818 dirty_reg(current,rt1[i]);
1820 alloc_reg_temp(current,i,-1);
1822 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1825 clear_const(current,rs1[i]);
1827 alloc_reg64(current,i,rs1[i]); // DMTC1
1829 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1830 alloc_reg_temp(current,i,-1);
1834 alloc_reg(current,i,0);
1835 alloc_reg_temp(current,i,-1);
1838 minimum_free_regs[i]=1;
1840 void fconv_alloc(struct regstat *current,int i)
1842 alloc_reg(current,i,CSREG); // Load status
1843 alloc_reg_temp(current,i,-1);
1844 minimum_free_regs[i]=1;
1846 void float_alloc(struct regstat *current,int i)
1848 alloc_reg(current,i,CSREG); // Load status
1849 alloc_reg_temp(current,i,-1);
1850 minimum_free_regs[i]=1;
1852 void c2op_alloc(struct regstat *current,int i)
1854 alloc_reg_temp(current,i,-1);
1856 void fcomp_alloc(struct regstat *current,int i)
1858 alloc_reg(current,i,CSREG); // Load status
1859 alloc_reg(current,i,FSREG); // Load flags
1860 dirty_reg(current,FSREG); // Flag will be modified
1861 alloc_reg_temp(current,i,-1);
1862 minimum_free_regs[i]=1;
1865 void syscall_alloc(struct regstat *current,int i)
1867 alloc_cc(current,i);
1868 dirty_reg(current,CCREG);
1869 alloc_all(current,i);
1870 minimum_free_regs[i]=HOST_REGS;
1874 void delayslot_alloc(struct regstat *current,int i)
1885 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1886 printf("Disabled speculative precompilation\n");
1890 imm16_alloc(current,i);
1894 load_alloc(current,i);
1898 store_alloc(current,i);
1901 alu_alloc(current,i);
1904 shift_alloc(current,i);
1907 multdiv_alloc(current,i);
1910 shiftimm_alloc(current,i);
1913 mov_alloc(current,i);
1916 cop0_alloc(current,i);
1920 cop1_alloc(current,i);
1923 c1ls_alloc(current,i);
1926 c2ls_alloc(current,i);
1929 fconv_alloc(current,i);
1932 float_alloc(current,i);
1935 fcomp_alloc(current,i);
1938 c2op_alloc(current,i);
1943 // Special case where a branch and delay slot span two pages in virtual memory
1944 static void pagespan_alloc(struct regstat *current,int i)
1947 current->wasconst=0;
1949 minimum_free_regs[i]=HOST_REGS;
1950 alloc_all(current,i);
1951 alloc_cc(current,i);
1952 dirty_reg(current,CCREG);
1953 if(opcode[i]==3) // JAL
1955 alloc_reg(current,i,31);
1956 dirty_reg(current,31);
1958 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
1960 alloc_reg(current,i,rs1[i]);
1962 alloc_reg(current,i,rt1[i]);
1963 dirty_reg(current,rt1[i]);
1966 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
1968 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1969 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1970 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1972 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1973 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
1977 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
1979 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1980 if(!((current->is32>>rs1[i])&1))
1982 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1986 if(opcode[i]==0x11) // BC1
1988 alloc_reg(current,i,FSREG);
1989 alloc_reg(current,i,CSREG);
1994 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
1996 stubs[stubcount][0]=type;
1997 stubs[stubcount][1]=addr;
1998 stubs[stubcount][2]=retaddr;
1999 stubs[stubcount][3]=a;
2000 stubs[stubcount][4]=b;
2001 stubs[stubcount][5]=c;
2002 stubs[stubcount][6]=d;
2003 stubs[stubcount][7]=e;
2007 // Write out a single register
2008 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
2011 for(hr=0;hr<HOST_REGS;hr++) {
2012 if(hr!=EXCLUDE_REG) {
2013 if((regmap[hr]&63)==r) {
2016 emit_storereg(r,hr);
2018 if((is32>>regmap[hr])&1) {
2019 emit_sarimm(hr,31,hr);
2020 emit_storereg(r|64,hr);
2024 emit_storereg(r|64,hr);
2034 //if(!tracedebug) return 0;
2037 for(i=0;i<2097152;i++) {
2038 unsigned int temp=sum;
2041 sum^=((u_int *)rdram)[i];
2050 sum^=((u_int *)reg)[i];
2058 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2060 #ifndef DISABLE_COP1
2063 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2073 void memdebug(int i)
2075 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2076 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2079 //if(Count>=-2084597794) {
2080 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2082 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2083 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2084 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2087 printf("TRACE: %x\n",(&i)[-1]);
2091 printf("TRACE: %x \n",(&j)[10]);
2092 printf("TRACE: %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x\n",(&j)[1],(&j)[2],(&j)[3],(&j)[4],(&j)[5],(&j)[6],(&j)[7],(&j)[8],(&j)[9],(&j)[10],(&j)[11],(&j)[12],(&j)[13],(&j)[14],(&j)[15],(&j)[16],(&j)[17],(&j)[18],(&j)[19],(&j)[20]);
2096 //printf("TRACE: %x\n",(&i)[-1]);
2099 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2101 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2104 void alu_assemble(int i,struct regstat *i_regs)
2106 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2108 signed char s1,s2,t;
2109 t=get_reg(i_regs->regmap,rt1[i]);
2111 s1=get_reg(i_regs->regmap,rs1[i]);
2112 s2=get_reg(i_regs->regmap,rs2[i]);
2113 if(rs1[i]&&rs2[i]) {
2116 if(opcode2[i]&2) emit_sub(s1,s2,t);
2117 else emit_add(s1,s2,t);
2120 if(s1>=0) emit_mov(s1,t);
2121 else emit_loadreg(rs1[i],t);
2125 if(opcode2[i]&2) emit_neg(s2,t);
2126 else emit_mov(s2,t);
2129 emit_loadreg(rs2[i],t);
2130 if(opcode2[i]&2) emit_neg(t,t);
2133 else emit_zeroreg(t);
2137 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2139 signed char s1l,s2l,s1h,s2h,tl,th;
2140 tl=get_reg(i_regs->regmap,rt1[i]);
2141 th=get_reg(i_regs->regmap,rt1[i]|64);
2143 s1l=get_reg(i_regs->regmap,rs1[i]);
2144 s2l=get_reg(i_regs->regmap,rs2[i]);
2145 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2146 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2147 if(rs1[i]&&rs2[i]) {
2150 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2151 else emit_adds(s1l,s2l,tl);
2153 #ifdef INVERTED_CARRY
2154 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2156 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2158 else emit_add(s1h,s2h,th);
2162 if(s1l>=0) emit_mov(s1l,tl);
2163 else emit_loadreg(rs1[i],tl);
2165 if(s1h>=0) emit_mov(s1h,th);
2166 else emit_loadreg(rs1[i]|64,th);
2171 if(opcode2[i]&2) emit_negs(s2l,tl);
2172 else emit_mov(s2l,tl);
2175 emit_loadreg(rs2[i],tl);
2176 if(opcode2[i]&2) emit_negs(tl,tl);
2179 #ifdef INVERTED_CARRY
2180 if(s2h>=0) emit_mov(s2h,th);
2181 else emit_loadreg(rs2[i]|64,th);
2183 emit_adcimm(-1,th); // x86 has inverted carry flag
2188 if(s2h>=0) emit_rscimm(s2h,0,th);
2190 emit_loadreg(rs2[i]|64,th);
2191 emit_rscimm(th,0,th);
2194 if(s2h>=0) emit_mov(s2h,th);
2195 else emit_loadreg(rs2[i]|64,th);
2202 if(th>=0) emit_zeroreg(th);
2207 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2209 signed char s1l,s1h,s2l,s2h,t;
2210 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2212 t=get_reg(i_regs->regmap,rt1[i]);
2215 s1l=get_reg(i_regs->regmap,rs1[i]);
2216 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2217 s2l=get_reg(i_regs->regmap,rs2[i]);
2218 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2219 if(rs2[i]==0) // rx<r0
2222 if(opcode2[i]==0x2a) // SLT
2223 emit_shrimm(s1h,31,t);
2224 else // SLTU (unsigned can not be less than zero)
2227 else if(rs1[i]==0) // r0<rx
2230 if(opcode2[i]==0x2a) // SLT
2231 emit_set_gz64_32(s2h,s2l,t);
2232 else // SLTU (set if not zero)
2233 emit_set_nz64_32(s2h,s2l,t);
2236 assert(s1l>=0);assert(s1h>=0);
2237 assert(s2l>=0);assert(s2h>=0);
2238 if(opcode2[i]==0x2a) // SLT
2239 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2241 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2245 t=get_reg(i_regs->regmap,rt1[i]);
2248 s1l=get_reg(i_regs->regmap,rs1[i]);
2249 s2l=get_reg(i_regs->regmap,rs2[i]);
2250 if(rs2[i]==0) // rx<r0
2253 if(opcode2[i]==0x2a) // SLT
2254 emit_shrimm(s1l,31,t);
2255 else // SLTU (unsigned can not be less than zero)
2258 else if(rs1[i]==0) // r0<rx
2261 if(opcode2[i]==0x2a) // SLT
2262 emit_set_gz32(s2l,t);
2263 else // SLTU (set if not zero)
2264 emit_set_nz32(s2l,t);
2267 assert(s1l>=0);assert(s2l>=0);
2268 if(opcode2[i]==0x2a) // SLT
2269 emit_set_if_less32(s1l,s2l,t);
2271 emit_set_if_carry32(s1l,s2l,t);
2277 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2279 signed char s1l,s1h,s2l,s2h,th,tl;
2280 tl=get_reg(i_regs->regmap,rt1[i]);
2281 th=get_reg(i_regs->regmap,rt1[i]|64);
2282 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2286 s1l=get_reg(i_regs->regmap,rs1[i]);
2287 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2288 s2l=get_reg(i_regs->regmap,rs2[i]);
2289 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2290 if(rs1[i]&&rs2[i]) {
2291 assert(s1l>=0);assert(s1h>=0);
2292 assert(s2l>=0);assert(s2h>=0);
2293 if(opcode2[i]==0x24) { // AND
2294 emit_and(s1l,s2l,tl);
2295 emit_and(s1h,s2h,th);
2297 if(opcode2[i]==0x25) { // OR
2298 emit_or(s1l,s2l,tl);
2299 emit_or(s1h,s2h,th);
2301 if(opcode2[i]==0x26) { // XOR
2302 emit_xor(s1l,s2l,tl);
2303 emit_xor(s1h,s2h,th);
2305 if(opcode2[i]==0x27) { // NOR
2306 emit_or(s1l,s2l,tl);
2307 emit_or(s1h,s2h,th);
2314 if(opcode2[i]==0x24) { // AND
2318 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2320 if(s1l>=0) emit_mov(s1l,tl);
2321 else emit_loadreg(rs1[i],tl);
2322 if(s1h>=0) emit_mov(s1h,th);
2323 else emit_loadreg(rs1[i]|64,th);
2327 if(s2l>=0) emit_mov(s2l,tl);
2328 else emit_loadreg(rs2[i],tl);
2329 if(s2h>=0) emit_mov(s2h,th);
2330 else emit_loadreg(rs2[i]|64,th);
2337 if(opcode2[i]==0x27) { // NOR
2339 if(s1l>=0) emit_not(s1l,tl);
2341 emit_loadreg(rs1[i],tl);
2344 if(s1h>=0) emit_not(s1h,th);
2346 emit_loadreg(rs1[i]|64,th);
2352 if(s2l>=0) emit_not(s2l,tl);
2354 emit_loadreg(rs2[i],tl);
2357 if(s2h>=0) emit_not(s2h,th);
2359 emit_loadreg(rs2[i]|64,th);
2375 s1l=get_reg(i_regs->regmap,rs1[i]);
2376 s2l=get_reg(i_regs->regmap,rs2[i]);
2377 if(rs1[i]&&rs2[i]) {
2380 if(opcode2[i]==0x24) { // AND
2381 emit_and(s1l,s2l,tl);
2383 if(opcode2[i]==0x25) { // OR
2384 emit_or(s1l,s2l,tl);
2386 if(opcode2[i]==0x26) { // XOR
2387 emit_xor(s1l,s2l,tl);
2389 if(opcode2[i]==0x27) { // NOR
2390 emit_or(s1l,s2l,tl);
2396 if(opcode2[i]==0x24) { // AND
2399 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2401 if(s1l>=0) emit_mov(s1l,tl);
2402 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2406 if(s2l>=0) emit_mov(s2l,tl);
2407 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2409 else emit_zeroreg(tl);
2411 if(opcode2[i]==0x27) { // NOR
2413 if(s1l>=0) emit_not(s1l,tl);
2415 emit_loadreg(rs1[i],tl);
2421 if(s2l>=0) emit_not(s2l,tl);
2423 emit_loadreg(rs2[i],tl);
2427 else emit_movimm(-1,tl);
2436 void imm16_assemble(int i,struct regstat *i_regs)
2438 if (opcode[i]==0x0f) { // LUI
2441 t=get_reg(i_regs->regmap,rt1[i]);
2444 if(!((i_regs->isconst>>t)&1))
2445 emit_movimm(imm[i]<<16,t);
2449 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2452 t=get_reg(i_regs->regmap,rt1[i]);
2453 s=get_reg(i_regs->regmap,rs1[i]);
2458 if(!((i_regs->isconst>>t)&1)) {
2460 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2461 emit_addimm(t,imm[i],t);
2463 if(!((i_regs->wasconst>>s)&1))
2464 emit_addimm(s,imm[i],t);
2466 emit_movimm(constmap[i][s]+imm[i],t);
2472 if(!((i_regs->isconst>>t)&1))
2473 emit_movimm(imm[i],t);
2478 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2480 signed char sh,sl,th,tl;
2481 th=get_reg(i_regs->regmap,rt1[i]|64);
2482 tl=get_reg(i_regs->regmap,rt1[i]);
2483 sh=get_reg(i_regs->regmap,rs1[i]|64);
2484 sl=get_reg(i_regs->regmap,rs1[i]);
2490 emit_addimm64_32(sh,sl,imm[i],th,tl);
2493 emit_addimm(sl,imm[i],tl);
2496 emit_movimm(imm[i],tl);
2497 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2502 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2504 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2505 signed char sh,sl,t;
2506 t=get_reg(i_regs->regmap,rt1[i]);
2507 sh=get_reg(i_regs->regmap,rs1[i]|64);
2508 sl=get_reg(i_regs->regmap,rs1[i]);
2512 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2513 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2514 if(opcode[i]==0x0a) { // SLTI
2516 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2517 emit_slti32(t,imm[i],t);
2519 emit_slti32(sl,imm[i],t);
2524 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2525 emit_sltiu32(t,imm[i],t);
2527 emit_sltiu32(sl,imm[i],t);
2532 if(opcode[i]==0x0a) // SLTI
2533 emit_slti64_32(sh,sl,imm[i],t);
2535 emit_sltiu64_32(sh,sl,imm[i],t);
2538 // SLTI(U) with r0 is just stupid,
2539 // nonetheless examples can be found
2540 if(opcode[i]==0x0a) // SLTI
2541 if(0<imm[i]) emit_movimm(1,t);
2542 else emit_zeroreg(t);
2545 if(imm[i]) emit_movimm(1,t);
2546 else emit_zeroreg(t);
2552 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2554 signed char sh,sl,th,tl;
2555 th=get_reg(i_regs->regmap,rt1[i]|64);
2556 tl=get_reg(i_regs->regmap,rt1[i]);
2557 sh=get_reg(i_regs->regmap,rs1[i]|64);
2558 sl=get_reg(i_regs->regmap,rs1[i]);
2559 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2560 if(opcode[i]==0x0c) //ANDI
2564 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2565 emit_andimm(tl,imm[i],tl);
2567 if(!((i_regs->wasconst>>sl)&1))
2568 emit_andimm(sl,imm[i],tl);
2570 emit_movimm(constmap[i][sl]&imm[i],tl);
2575 if(th>=0) emit_zeroreg(th);
2581 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2585 emit_loadreg(rs1[i]|64,th);
2590 if(opcode[i]==0x0d) //ORI
2592 emit_orimm(tl,imm[i],tl);
2594 if(!((i_regs->wasconst>>sl)&1))
2595 emit_orimm(sl,imm[i],tl);
2597 emit_movimm(constmap[i][sl]|imm[i],tl);
2599 if(opcode[i]==0x0e) //XORI
2601 emit_xorimm(tl,imm[i],tl);
2603 if(!((i_regs->wasconst>>sl)&1))
2604 emit_xorimm(sl,imm[i],tl);
2606 emit_movimm(constmap[i][sl]^imm[i],tl);
2610 emit_movimm(imm[i],tl);
2611 if(th>=0) emit_zeroreg(th);
2619 void shiftimm_assemble(int i,struct regstat *i_regs)
2621 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2625 t=get_reg(i_regs->regmap,rt1[i]);
2626 s=get_reg(i_regs->regmap,rs1[i]);
2635 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2637 if(opcode2[i]==0) // SLL
2639 emit_shlimm(s<0?t:s,imm[i],t);
2641 if(opcode2[i]==2) // SRL
2643 emit_shrimm(s<0?t:s,imm[i],t);
2645 if(opcode2[i]==3) // SRA
2647 emit_sarimm(s<0?t:s,imm[i],t);
2651 if(s>=0 && s!=t) emit_mov(s,t);
2655 //emit_storereg(rt1[i],t); //DEBUG
2658 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2661 signed char sh,sl,th,tl;
2662 th=get_reg(i_regs->regmap,rt1[i]|64);
2663 tl=get_reg(i_regs->regmap,rt1[i]);
2664 sh=get_reg(i_regs->regmap,rs1[i]|64);
2665 sl=get_reg(i_regs->regmap,rs1[i]);
2670 if(th>=0) emit_zeroreg(th);
2677 if(opcode2[i]==0x38) // DSLL
2679 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2680 emit_shlimm(sl,imm[i],tl);
2682 if(opcode2[i]==0x3a) // DSRL
2684 emit_shrdimm(sl,sh,imm[i],tl);
2685 if(th>=0) emit_shrimm(sh,imm[i],th);
2687 if(opcode2[i]==0x3b) // DSRA
2689 emit_shrdimm(sl,sh,imm[i],tl);
2690 if(th>=0) emit_sarimm(sh,imm[i],th);
2694 if(sl!=tl) emit_mov(sl,tl);
2695 if(th>=0&&sh!=th) emit_mov(sh,th);
2701 if(opcode2[i]==0x3c) // DSLL32
2704 signed char sl,tl,th;
2705 tl=get_reg(i_regs->regmap,rt1[i]);
2706 th=get_reg(i_regs->regmap,rt1[i]|64);
2707 sl=get_reg(i_regs->regmap,rs1[i]);
2716 emit_shlimm(th,imm[i]&31,th);
2721 if(opcode2[i]==0x3e) // DSRL32
2724 signed char sh,tl,th;
2725 tl=get_reg(i_regs->regmap,rt1[i]);
2726 th=get_reg(i_regs->regmap,rt1[i]|64);
2727 sh=get_reg(i_regs->regmap,rs1[i]|64);
2731 if(th>=0) emit_zeroreg(th);
2734 emit_shrimm(tl,imm[i]&31,tl);
2739 if(opcode2[i]==0x3f) // DSRA32
2743 tl=get_reg(i_regs->regmap,rt1[i]);
2744 sh=get_reg(i_regs->regmap,rs1[i]|64);
2750 emit_sarimm(tl,imm[i]&31,tl);
2757 #ifndef shift_assemble
2758 void shift_assemble(int i,struct regstat *i_regs)
2760 printf("Need shift_assemble for this architecture.\n");
2765 void load_assemble(int i,struct regstat *i_regs)
2767 int s,th,tl,addr,map=-1;
2770 int memtarget=0,c=0;
2772 th=get_reg(i_regs->regmap,rt1[i]|64);
2773 tl=get_reg(i_regs->regmap,rt1[i]);
2774 s=get_reg(i_regs->regmap,rs1[i]);
2776 for(hr=0;hr<HOST_REGS;hr++) {
2777 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2779 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2781 c=(i_regs->wasconst>>s)&1;
2783 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2784 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2787 //printf("load_assemble: c=%d\n",c);
2788 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2789 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2791 if(tl<0&&(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80)
2793 // could be FIFO, must perform the read
2795 assem_debug("(forced read)\n");
2796 tl=get_reg(i_regs->regmap,-1);
2800 if(offset||s<0||c) addr=tl;
2802 //if(tl<0) tl=get_reg(i_regs->regmap,-1);
2804 //printf("load_assemble: c=%d\n",c);
2805 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2806 assert(tl>=0); // Even if the load is a NOP, we must check for pagefaults and I/O
2808 if(th>=0) reglist&=~(1<<th);
2812 map=get_reg(i_regs->regmap,ROREG);
2813 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
2815 //#define R29_HACK 1
2817 // Strmnnrmn's speed hack
2818 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2822 if(sp_in_mirror&&rs1[i]==29) {
2823 emit_andimm(addr,~0x00e00000,HOST_TEMPREG);
2824 emit_cmpimm(HOST_TEMPREG,RAM_SIZE);
2828 emit_cmpimm(addr,RAM_SIZE);
2830 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
2831 // Hint to branch predictor that the branch is unlikely to be taken
2833 emit_jno_unlikely(0);
2841 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2842 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2843 map=get_reg(i_regs->regmap,TLREG);
2845 map=do_tlb_r(addr,tl,map,x,-1,-1,c,constmap[i][s]+offset);
2846 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr);
2848 int dummy=(rt1[i]==0)||(tl!=get_reg(i_regs->regmap,rt1[i])); // ignore loads to r0 and unneeded reg
2849 if (opcode[i]==0x20) { // LB
2852 #ifdef HOST_IMM_ADDR32
2854 emit_movsbl_tlb((constmap[i][s]+offset)^3,map,tl);
2858 //emit_xorimm(addr,3,tl);
2859 //gen_tlb_addr_r(tl,map);
2860 //emit_movsbl_indexed((int)rdram-0x80000000,tl,tl);
2862 #ifdef BIG_ENDIAN_MIPS
2863 if(!c) emit_xorimm(addr,3,tl);
2864 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2869 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2871 emit_movsbl_indexed_tlb(x,a,map,tl);
2875 add_stub(LOADB_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2878 inline_readstub(LOADB_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2880 if (opcode[i]==0x21) { // LH
2883 #ifdef HOST_IMM_ADDR32
2885 emit_movswl_tlb((constmap[i][s]+offset)^2,map,tl);
2890 #ifdef BIG_ENDIAN_MIPS
2891 if(!c) emit_xorimm(addr,2,tl);
2892 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2897 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2900 //emit_movswl_indexed_tlb(x,tl,map,tl);
2903 gen_tlb_addr_r(a,map);
2904 emit_movswl_indexed(x,a,tl);
2907 emit_movswl_indexed(x,a,tl);
2909 emit_movswl_indexed((int)rdram-0x80000000+x,a,tl);
2915 add_stub(LOADH_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2918 inline_readstub(LOADH_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2920 if (opcode[i]==0x23) { // LW
2925 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2927 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2928 #ifdef HOST_IMM_ADDR32
2930 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2933 emit_readword_indexed_tlb(0,a,map,tl);
2936 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2939 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2941 if (opcode[i]==0x24) { // LBU
2944 #ifdef HOST_IMM_ADDR32
2946 emit_movzbl_tlb((constmap[i][s]+offset)^3,map,tl);
2950 //emit_xorimm(addr,3,tl);
2951 //gen_tlb_addr_r(tl,map);
2952 //emit_movzbl_indexed((int)rdram-0x80000000,tl,tl);
2954 #ifdef BIG_ENDIAN_MIPS
2955 if(!c) emit_xorimm(addr,3,tl);
2956 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2961 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2963 emit_movzbl_indexed_tlb(x,a,map,tl);
2967 add_stub(LOADBU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2970 inline_readstub(LOADBU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2972 if (opcode[i]==0x25) { // LHU
2975 #ifdef HOST_IMM_ADDR32
2977 emit_movzwl_tlb((constmap[i][s]+offset)^2,map,tl);
2982 #ifdef BIG_ENDIAN_MIPS
2983 if(!c) emit_xorimm(addr,2,tl);
2984 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2989 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2992 //emit_movzwl_indexed_tlb(x,tl,map,tl);
2995 gen_tlb_addr_r(a,map);
2996 emit_movzwl_indexed(x,a,tl);
2999 emit_movzwl_indexed(x,a,tl);
3001 emit_movzwl_indexed((int)rdram-0x80000000+x,a,tl);
3007 add_stub(LOADHU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3010 inline_readstub(LOADHU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3012 if (opcode[i]==0x27) { // LWU
3018 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3020 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
3021 #ifdef HOST_IMM_ADDR32
3023 emit_readword_tlb(constmap[i][s]+offset,map,tl);
3026 emit_readword_indexed_tlb(0,a,map,tl);
3029 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3032 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3036 if (opcode[i]==0x37) { // LD
3041 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3043 //gen_tlb_addr_r(tl,map);
3044 //if(th>=0) emit_readword_indexed((int)rdram-0x80000000,addr,th);
3045 //emit_readword_indexed((int)rdram-0x7FFFFFFC,addr,tl);
3046 #ifdef HOST_IMM_ADDR32
3048 emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3051 emit_readdword_indexed_tlb(0,a,map,th,tl);
3054 add_stub(LOADD_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3057 inline_readstub(LOADD_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3060 //emit_storereg(rt1[i],tl); // DEBUG
3061 //if(opcode[i]==0x23)
3062 //if(opcode[i]==0x24)
3063 //if(opcode[i]==0x23||opcode[i]==0x24)
3064 /*if(opcode[i]==0x21||opcode[i]==0x23||opcode[i]==0x24)
3068 emit_readword((int)&last_count,ECX);
3070 if(get_reg(i_regs->regmap,CCREG)<0)
3071 emit_loadreg(CCREG,HOST_CCREG);
3072 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3073 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3074 emit_writeword(HOST_CCREG,(int)&Count);
3077 if(get_reg(i_regs->regmap,CCREG)<0)
3078 emit_loadreg(CCREG,0);
3080 emit_mov(HOST_CCREG,0);
3082 emit_addimm(0,2*ccadj[i],0);
3083 emit_writeword(0,(int)&Count);
3085 emit_call((int)memdebug);
3087 restore_regs(0x100f);
3091 #ifndef loadlr_assemble
3092 void loadlr_assemble(int i,struct regstat *i_regs)
3094 printf("Need loadlr_assemble for this architecture.\n");
3099 void store_assemble(int i,struct regstat *i_regs)
3104 int jaddr=0,jaddr2,type;
3105 int memtarget=0,c=0;
3106 int agr=AGEN1+(i&1);
3108 th=get_reg(i_regs->regmap,rs2[i]|64);
3109 tl=get_reg(i_regs->regmap,rs2[i]);
3110 s=get_reg(i_regs->regmap,rs1[i]);
3111 temp=get_reg(i_regs->regmap,agr);
3112 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3115 c=(i_regs->wasconst>>s)&1;
3117 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3118 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3123 for(hr=0;hr<HOST_REGS;hr++) {
3124 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3126 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3127 if(offset||s<0||c) addr=temp;
3132 if(sp_in_mirror&&rs1[i]==29) {
3133 emit_andimm(addr,~0x00e00000,HOST_TEMPREG);
3134 emit_cmpimm(HOST_TEMPREG,RAM_SIZE);
3139 // Strmnnrmn's speed hack
3140 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3142 emit_cmpimm(addr,RAM_SIZE);
3143 #ifdef DESTRUCTIVE_SHIFT
3144 if(s==addr) emit_mov(s,temp);
3148 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3152 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
3153 // Hint to branch predictor that the branch is unlikely to be taken
3155 emit_jno_unlikely(0);
3163 if (opcode[i]==0x28) x=3; // SB
3164 if (opcode[i]==0x29) x=2; // SH
3165 map=get_reg(i_regs->regmap,TLREG);
3167 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3168 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3171 if (opcode[i]==0x28) { // SB
3174 #ifdef BIG_ENDIAN_MIPS
3175 if(!c) emit_xorimm(addr,3,temp);
3176 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3181 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3183 //gen_tlb_addr_w(temp,map);
3184 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3185 emit_writebyte_indexed_tlb(tl,x,a,map,a);
3189 if (opcode[i]==0x29) { // SH
3192 #ifdef BIG_ENDIAN_MIPS
3193 if(!c) emit_xorimm(addr,2,temp);
3194 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3199 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3202 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3205 gen_tlb_addr_w(a,map);
3206 emit_writehword_indexed(tl,x,a);
3208 emit_writehword_indexed(tl,(int)rdram-0x80000000+x,a);
3212 if (opcode[i]==0x2B) { // SW
3216 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3218 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3219 emit_writeword_indexed_tlb(tl,0,a,map,temp);
3223 if (opcode[i]==0x3F) { // SD
3227 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3231 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3232 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3233 emit_writedword_indexed_tlb(th,tl,0,a,map,temp);
3236 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3237 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3238 emit_writedword_indexed_tlb(tl,tl,0,a,map,temp);
3245 #ifdef DESTRUCTIVE_SHIFT
3246 // The x86 shift operation is 'destructive'; it overwrites the
3247 // source register, so we need to make a copy first and use that.
3250 #if defined(HOST_IMM8)
3251 int ir=get_reg(i_regs->regmap,INVCP);
3253 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3255 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3257 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3258 emit_callne(invalidate_addr_reg[addr]);
3262 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3267 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3268 } else if(c&&!memtarget) {
3269 inline_writestub(type,i,constmap[i][s]+offset,i_regs->regmap,rs2[i],ccadj[i],reglist);
3271 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3272 //if(opcode[i]==0x2B || opcode[i]==0x28)
3273 //if(opcode[i]==0x2B || opcode[i]==0x29)
3274 //if(opcode[i]==0x2B)
3275 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3279 emit_readword((int)&last_count,ECX);
3281 if(get_reg(i_regs->regmap,CCREG)<0)
3282 emit_loadreg(CCREG,HOST_CCREG);
3283 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3284 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3285 emit_writeword(HOST_CCREG,(int)&Count);
3288 if(get_reg(i_regs->regmap,CCREG)<0)
3289 emit_loadreg(CCREG,0);
3291 emit_mov(HOST_CCREG,0);
3293 emit_addimm(0,2*ccadj[i],0);
3294 emit_writeword(0,(int)&Count);
3296 emit_call((int)memdebug);
3298 restore_regs(0x100f);
3302 void storelr_assemble(int i,struct regstat *i_regs)
3309 int case1,case2,case3;
3310 int done0,done1,done2;
3311 int memtarget=0,c=0;
3312 int agr=AGEN1+(i&1);
3314 th=get_reg(i_regs->regmap,rs2[i]|64);
3315 tl=get_reg(i_regs->regmap,rs2[i]);
3316 s=get_reg(i_regs->regmap,rs1[i]);
3317 temp=get_reg(i_regs->regmap,agr);
3318 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3321 c=(i_regs->isconst>>s)&1;
3323 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3324 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3328 for(hr=0;hr<HOST_REGS;hr++) {
3329 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3334 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3335 if(!offset&&s!=temp) emit_mov(s,temp);
3341 if(!memtarget||!rs1[i]) {
3347 int map=get_reg(i_regs->regmap,ROREG);
3348 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
3349 gen_tlb_addr_w(temp,map);
3351 if((u_int)rdram!=0x80000000)
3352 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3355 int map=get_reg(i_regs->regmap,TLREG);
3357 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3358 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3359 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3360 if(!jaddr&&!memtarget) {
3364 gen_tlb_addr_w(temp,map);
3367 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3368 temp2=get_reg(i_regs->regmap,FTEMP);
3369 if(!rs2[i]) temp2=th=tl;
3372 #ifndef BIG_ENDIAN_MIPS
3373 emit_xorimm(temp,3,temp);
3375 emit_testimm(temp,2);
3378 emit_testimm(temp,1);
3382 if (opcode[i]==0x2A) { // SWL
3383 emit_writeword_indexed(tl,0,temp);
3385 if (opcode[i]==0x2E) { // SWR
3386 emit_writebyte_indexed(tl,3,temp);
3388 if (opcode[i]==0x2C) { // SDL
3389 emit_writeword_indexed(th,0,temp);
3390 if(rs2[i]) emit_mov(tl,temp2);
3392 if (opcode[i]==0x2D) { // SDR
3393 emit_writebyte_indexed(tl,3,temp);
3394 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3399 set_jump_target(case1,(int)out);
3400 if (opcode[i]==0x2A) { // SWL
3401 // Write 3 msb into three least significant bytes
3402 if(rs2[i]) emit_rorimm(tl,8,tl);
3403 emit_writehword_indexed(tl,-1,temp);
3404 if(rs2[i]) emit_rorimm(tl,16,tl);
3405 emit_writebyte_indexed(tl,1,temp);
3406 if(rs2[i]) emit_rorimm(tl,8,tl);
3408 if (opcode[i]==0x2E) { // SWR
3409 // Write two lsb into two most significant bytes
3410 emit_writehword_indexed(tl,1,temp);
3412 if (opcode[i]==0x2C) { // SDL
3413 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3414 // Write 3 msb into three least significant bytes
3415 if(rs2[i]) emit_rorimm(th,8,th);
3416 emit_writehword_indexed(th,-1,temp);
3417 if(rs2[i]) emit_rorimm(th,16,th);
3418 emit_writebyte_indexed(th,1,temp);
3419 if(rs2[i]) emit_rorimm(th,8,th);
3421 if (opcode[i]==0x2D) { // SDR
3422 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3423 // Write two lsb into two most significant bytes
3424 emit_writehword_indexed(tl,1,temp);
3429 set_jump_target(case2,(int)out);
3430 emit_testimm(temp,1);
3433 if (opcode[i]==0x2A) { // SWL
3434 // Write two msb into two least significant bytes
3435 if(rs2[i]) emit_rorimm(tl,16,tl);
3436 emit_writehword_indexed(tl,-2,temp);
3437 if(rs2[i]) emit_rorimm(tl,16,tl);
3439 if (opcode[i]==0x2E) { // SWR
3440 // Write 3 lsb into three most significant bytes
3441 emit_writebyte_indexed(tl,-1,temp);
3442 if(rs2[i]) emit_rorimm(tl,8,tl);
3443 emit_writehword_indexed(tl,0,temp);
3444 if(rs2[i]) emit_rorimm(tl,24,tl);
3446 if (opcode[i]==0x2C) { // SDL
3447 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3448 // Write two msb into two least significant bytes
3449 if(rs2[i]) emit_rorimm(th,16,th);
3450 emit_writehword_indexed(th,-2,temp);
3451 if(rs2[i]) emit_rorimm(th,16,th);
3453 if (opcode[i]==0x2D) { // SDR
3454 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3455 // Write 3 lsb into three most significant bytes
3456 emit_writebyte_indexed(tl,-1,temp);
3457 if(rs2[i]) emit_rorimm(tl,8,tl);
3458 emit_writehword_indexed(tl,0,temp);
3459 if(rs2[i]) emit_rorimm(tl,24,tl);
3464 set_jump_target(case3,(int)out);
3465 if (opcode[i]==0x2A) { // SWL
3466 // Write msb into least significant byte
3467 if(rs2[i]) emit_rorimm(tl,24,tl);
3468 emit_writebyte_indexed(tl,-3,temp);
3469 if(rs2[i]) emit_rorimm(tl,8,tl);
3471 if (opcode[i]==0x2E) { // SWR
3472 // Write entire word
3473 emit_writeword_indexed(tl,-3,temp);
3475 if (opcode[i]==0x2C) { // SDL
3476 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3477 // Write msb into least significant byte
3478 if(rs2[i]) emit_rorimm(th,24,th);
3479 emit_writebyte_indexed(th,-3,temp);
3480 if(rs2[i]) emit_rorimm(th,8,th);
3482 if (opcode[i]==0x2D) { // SDR
3483 if(rs2[i]) emit_mov(th,temp2);
3484 // Write entire word
3485 emit_writeword_indexed(tl,-3,temp);
3487 set_jump_target(done0,(int)out);
3488 set_jump_target(done1,(int)out);
3489 set_jump_target(done2,(int)out);
3490 if (opcode[i]==0x2C) { // SDL
3491 emit_testimm(temp,4);
3494 emit_andimm(temp,~3,temp);
3495 emit_writeword_indexed(temp2,4,temp);
3496 set_jump_target(done0,(int)out);
3498 if (opcode[i]==0x2D) { // SDR
3499 emit_testimm(temp,4);
3502 emit_andimm(temp,~3,temp);
3503 emit_writeword_indexed(temp2,-4,temp);
3504 set_jump_target(done0,(int)out);
3507 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3510 int map=get_reg(i_regs->regmap,ROREG);
3511 if(map<0) map=HOST_TEMPREG;
3512 gen_orig_addr_w(temp,map);
3514 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3516 #if defined(HOST_IMM8)
3517 int ir=get_reg(i_regs->regmap,INVCP);
3519 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3521 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3523 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3524 emit_callne(invalidate_addr_reg[temp]);
3528 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3533 //save_regs(0x100f);
3534 emit_readword((int)&last_count,ECX);
3535 if(get_reg(i_regs->regmap,CCREG)<0)
3536 emit_loadreg(CCREG,HOST_CCREG);
3537 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3538 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3539 emit_writeword(HOST_CCREG,(int)&Count);
3540 emit_call((int)memdebug);
3542 //restore_regs(0x100f);
3546 void c1ls_assemble(int i,struct regstat *i_regs)
3548 #ifndef DISABLE_COP1
3554 int jaddr,jaddr2=0,jaddr3,type;
3555 int agr=AGEN1+(i&1);
3557 th=get_reg(i_regs->regmap,FTEMP|64);
3558 tl=get_reg(i_regs->regmap,FTEMP);
3559 s=get_reg(i_regs->regmap,rs1[i]);
3560 temp=get_reg(i_regs->regmap,agr);
3561 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3566 for(hr=0;hr<HOST_REGS;hr++) {
3567 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3569 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3570 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3572 // Loads use a temporary register which we need to save
3575 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3579 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3580 //else c=(i_regs->wasconst>>s)&1;
3581 if(s>=0) c=(i_regs->wasconst>>s)&1;
3582 // Check cop1 unusable
3584 signed char rs=get_reg(i_regs->regmap,CSREG);
3586 emit_testimm(rs,0x20000000);
3589 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3592 if (opcode[i]==0x39) { // SWC1 (get float address)
3593 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3595 if (opcode[i]==0x3D) { // SDC1 (get double address)
3596 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3598 // Generate address + offset
3601 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3605 map=get_reg(i_regs->regmap,TLREG);
3607 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3608 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3610 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3611 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3614 if (opcode[i]==0x39) { // SWC1 (read float)
3615 emit_readword_indexed(0,tl,tl);
3617 if (opcode[i]==0x3D) { // SDC1 (read double)
3618 emit_readword_indexed(4,tl,th);
3619 emit_readword_indexed(0,tl,tl);
3621 if (opcode[i]==0x31) { // LWC1 (get target address)
3622 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3624 if (opcode[i]==0x35) { // LDC1 (get target address)
3625 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3632 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3634 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3636 #ifdef DESTRUCTIVE_SHIFT
3637 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3638 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3642 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3643 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3645 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3646 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3649 if (opcode[i]==0x31) { // LWC1
3650 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3651 //gen_tlb_addr_r(ar,map);
3652 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3653 #ifdef HOST_IMM_ADDR32
3654 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3657 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3660 if (opcode[i]==0x35) { // LDC1
3662 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3663 //gen_tlb_addr_r(ar,map);
3664 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3665 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3666 #ifdef HOST_IMM_ADDR32
3667 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3670 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3673 if (opcode[i]==0x39) { // SWC1
3674 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3675 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3678 if (opcode[i]==0x3D) { // SDC1
3680 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3681 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3682 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3686 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3687 #ifndef DESTRUCTIVE_SHIFT
3688 temp=offset||c||s<0?ar:s;
3690 #if defined(HOST_IMM8)
3691 int ir=get_reg(i_regs->regmap,INVCP);
3693 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3695 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3697 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3698 emit_callne(invalidate_addr_reg[temp]);
3702 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3706 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3707 if (opcode[i]==0x31) { // LWC1 (write float)
3708 emit_writeword_indexed(tl,0,temp);
3710 if (opcode[i]==0x35) { // LDC1 (write double)
3711 emit_writeword_indexed(th,4,temp);
3712 emit_writeword_indexed(tl,0,temp);
3714 //if(opcode[i]==0x39)
3715 /*if(opcode[i]==0x39||opcode[i]==0x31)
3718 emit_readword((int)&last_count,ECX);
3719 if(get_reg(i_regs->regmap,CCREG)<0)
3720 emit_loadreg(CCREG,HOST_CCREG);
3721 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3722 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3723 emit_writeword(HOST_CCREG,(int)&Count);
3724 emit_call((int)memdebug);
3728 cop1_unusable(i, i_regs);
3732 void c2ls_assemble(int i,struct regstat *i_regs)
3737 int memtarget=0,c=0;
3738 int jaddr2=0,jaddr3,type;
3739 int agr=AGEN1+(i&1);
3741 u_int copr=(source[i]>>16)&0x1f;
3742 s=get_reg(i_regs->regmap,rs1[i]);
3743 tl=get_reg(i_regs->regmap,FTEMP);
3749 for(hr=0;hr<HOST_REGS;hr++) {
3750 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3752 if(i_regs->regmap[HOST_CCREG]==CCREG)
3753 reglist&=~(1<<HOST_CCREG);
3756 if (opcode[i]==0x3a) { // SWC2
3757 ar=get_reg(i_regs->regmap,agr);
3758 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3763 if(s>=0) c=(i_regs->wasconst>>s)&1;
3764 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3765 if (!offset&&!c&&s>=0) ar=s;
3768 if (opcode[i]==0x3a) { // SWC2
3769 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3777 emit_jmp(0); // inline_readstub/inline_writestub?
3781 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3785 if (opcode[i]==0x32) { // LWC2
3786 #ifdef HOST_IMM_ADDR32
3787 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3790 emit_readword_indexed(0,ar,tl);
3792 if (opcode[i]==0x3a) { // SWC2
3793 #ifdef DESTRUCTIVE_SHIFT
3794 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3796 emit_writeword_indexed(tl,0,ar);
3800 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3801 if (opcode[i]==0x3a) { // SWC2
3802 #if defined(HOST_IMM8)
3803 int ir=get_reg(i_regs->regmap,INVCP);
3805 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3807 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3809 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3810 emit_callne(invalidate_addr_reg[ar]);
3814 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3817 if (opcode[i]==0x32) { // LWC2
3818 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3822 #ifndef multdiv_assemble
3823 void multdiv_assemble(int i,struct regstat *i_regs)
3825 printf("Need multdiv_assemble for this architecture.\n");
3830 void mov_assemble(int i,struct regstat *i_regs)
3832 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3833 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3835 signed char sh,sl,th,tl;
3836 th=get_reg(i_regs->regmap,rt1[i]|64);
3837 tl=get_reg(i_regs->regmap,rt1[i]);
3840 sh=get_reg(i_regs->regmap,rs1[i]|64);
3841 sl=get_reg(i_regs->regmap,rs1[i]);
3842 if(sl>=0) emit_mov(sl,tl);
3843 else emit_loadreg(rs1[i],tl);
3845 if(sh>=0) emit_mov(sh,th);
3846 else emit_loadreg(rs1[i]|64,th);
3852 #ifndef fconv_assemble
3853 void fconv_assemble(int i,struct regstat *i_regs)
3855 printf("Need fconv_assemble for this architecture.\n");
3861 void float_assemble(int i,struct regstat *i_regs)
3863 printf("Need float_assemble for this architecture.\n");
3868 void syscall_assemble(int i,struct regstat *i_regs)
3870 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3871 assert(ccreg==HOST_CCREG);
3872 assert(!is_delayslot);
3873 emit_movimm(start+i*4,EAX); // Get PC
3874 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3875 emit_jmp((int)jump_syscall_hle); // XXX
3878 void hlecall_assemble(int i,struct regstat *i_regs)
3880 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3881 assert(ccreg==HOST_CCREG);
3882 assert(!is_delayslot);
3883 emit_movimm(start+i*4+4,0); // Get PC
3884 emit_movimm((int)psxHLEt[source[i]&7],1);
3885 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // XXX
3886 emit_jmp((int)jump_hlecall);
3889 void intcall_assemble(int i,struct regstat *i_regs)
3891 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3892 assert(ccreg==HOST_CCREG);
3893 assert(!is_delayslot);
3894 emit_movimm(start+i*4,0); // Get PC
3895 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG);
3896 emit_jmp((int)jump_intcall);
3899 void ds_assemble(int i,struct regstat *i_regs)
3904 alu_assemble(i,i_regs);break;
3906 imm16_assemble(i,i_regs);break;
3908 shift_assemble(i,i_regs);break;
3910 shiftimm_assemble(i,i_regs);break;
3912 load_assemble(i,i_regs);break;
3914 loadlr_assemble(i,i_regs);break;
3916 store_assemble(i,i_regs);break;
3918 storelr_assemble(i,i_regs);break;
3920 cop0_assemble(i,i_regs);break;
3922 cop1_assemble(i,i_regs);break;
3924 c1ls_assemble(i,i_regs);break;
3926 cop2_assemble(i,i_regs);break;
3928 c2ls_assemble(i,i_regs);break;
3930 c2op_assemble(i,i_regs);break;
3932 fconv_assemble(i,i_regs);break;
3934 float_assemble(i,i_regs);break;
3936 fcomp_assemble(i,i_regs);break;
3938 multdiv_assemble(i,i_regs);break;
3940 mov_assemble(i,i_regs);break;
3950 printf("Jump in the delay slot. This is probably a bug.\n");
3955 // Is the branch target a valid internal jump?
3956 int internal_branch(uint64_t i_is32,int addr)
3958 if(addr&1) return 0; // Indirect (register) jump
3959 if(addr>=start && addr<start+slen*4-4)
3961 int t=(addr-start)>>2;
3962 // Delay slots are not valid branch targets
3963 //if(t>0&&(itype[t-1]==RJUMP||itype[t-1]==UJUMP||itype[t-1]==CJUMP||itype[t-1]==SJUMP||itype[t-1]==FJUMP)) return 0;
3964 // 64 -> 32 bit transition requires a recompile
3965 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
3967 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
3968 else printf("optimizable: yes\n");
3970 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
3972 if(requires_32bit[t]&~i_is32) return 0;
3980 #ifndef wb_invalidate
3981 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
3982 uint64_t u,uint64_t uu)
3985 for(hr=0;hr<HOST_REGS;hr++) {
3986 if(hr!=EXCLUDE_REG) {
3987 if(pre[hr]!=entry[hr]) {
3990 if(get_reg(entry,pre[hr])<0) {
3992 if(!((u>>pre[hr])&1)) {
3993 emit_storereg(pre[hr],hr);
3994 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
3995 emit_sarimm(hr,31,hr);
3996 emit_storereg(pre[hr]|64,hr);
4000 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
4001 emit_storereg(pre[hr],hr);
4010 // Move from one register to another (no writeback)
4011 for(hr=0;hr<HOST_REGS;hr++) {
4012 if(hr!=EXCLUDE_REG) {
4013 if(pre[hr]!=entry[hr]) {
4014 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
4016 if((nr=get_reg(entry,pre[hr]))>=0) {
4026 // Load the specified registers
4027 // This only loads the registers given as arguments because
4028 // we don't want to load things that will be overwritten
4029 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
4033 for(hr=0;hr<HOST_REGS;hr++) {
4034 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4035 if(entry[hr]!=regmap[hr]) {
4036 if(regmap[hr]==rs1||regmap[hr]==rs2)
4043 emit_loadreg(regmap[hr],hr);
4050 for(hr=0;hr<HOST_REGS;hr++) {
4051 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4052 if(entry[hr]!=regmap[hr]) {
4053 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
4055 assert(regmap[hr]!=64);
4056 if((is32>>(regmap[hr]&63))&1) {
4057 int lr=get_reg(regmap,regmap[hr]-64);
4059 emit_sarimm(lr,31,hr);
4061 emit_loadreg(regmap[hr],hr);
4065 emit_loadreg(regmap[hr],hr);
4073 // Load registers prior to the start of a loop
4074 // so that they are not loaded within the loop
4075 static void loop_preload(signed char pre[],signed char entry[])
4078 for(hr=0;hr<HOST_REGS;hr++) {
4079 if(hr!=EXCLUDE_REG) {
4080 if(pre[hr]!=entry[hr]) {
4082 if(get_reg(pre,entry[hr])<0) {
4083 assem_debug("loop preload:\n");
4084 //printf("loop preload: %d\n",hr);
4088 else if(entry[hr]<TEMPREG)
4090 emit_loadreg(entry[hr],hr);
4092 else if(entry[hr]-64<TEMPREG)
4094 emit_loadreg(entry[hr],hr);
4103 // Generate address for load/store instruction
4104 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
4105 void address_generation(int i,struct regstat *i_regs,signed char entry[])
4107 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
4109 int agr=AGEN1+(i&1);
4110 int mgr=MGEN1+(i&1);
4111 if(itype[i]==LOAD) {
4112 ra=get_reg(i_regs->regmap,rt1[i]);
4113 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4116 if(itype[i]==LOADLR) {
4117 ra=get_reg(i_regs->regmap,FTEMP);
4119 if(itype[i]==STORE||itype[i]==STORELR) {
4120 ra=get_reg(i_regs->regmap,agr);
4121 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4123 if(itype[i]==C1LS||itype[i]==C2LS) {
4124 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
4125 ra=get_reg(i_regs->regmap,FTEMP);
4126 else { // SWC1/SDC1/SWC2/SDC2
4127 ra=get_reg(i_regs->regmap,agr);
4128 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4131 int rs=get_reg(i_regs->regmap,rs1[i]);
4132 int rm=get_reg(i_regs->regmap,TLREG);
4135 int c=(i_regs->wasconst>>rs)&1;
4137 // Using r0 as a base address
4139 if(!entry||entry[rm]!=mgr) {
4140 generate_map_const(offset,rm);
4141 } // else did it in the previous cycle
4143 if(!entry||entry[ra]!=agr) {
4144 if (opcode[i]==0x22||opcode[i]==0x26) {
4145 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4146 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4147 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4149 emit_movimm(offset,ra);
4151 } // else did it in the previous cycle
4154 if(!entry||entry[ra]!=rs1[i])
4155 emit_loadreg(rs1[i],ra);
4156 //if(!entry||entry[ra]!=rs1[i])
4157 // printf("poor load scheduling!\n");
4161 if(!entry||entry[rm]!=mgr) {
4162 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4163 // Stores to memory go thru the mapper to detect self-modifying
4164 // code, loads don't.
4165 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4166 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4167 generate_map_const(constmap[i][rs]+offset,rm);
4169 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4170 generate_map_const(constmap[i][rs]+offset,rm);
4174 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4175 if(!entry||entry[ra]!=agr) {
4176 if (opcode[i]==0x22||opcode[i]==0x26) {
4177 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4178 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4179 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4181 #ifdef HOST_IMM_ADDR32
4182 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4183 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4185 emit_movimm(constmap[i][rs]+offset,ra);
4187 } // else did it in the previous cycle
4188 } // else load_consts already did it
4190 if(offset&&!c&&rs1[i]) {
4192 emit_addimm(rs,offset,ra);
4194 emit_addimm(ra,offset,ra);
4199 // Preload constants for next instruction
4200 if(itype[i+1]==LOAD||itype[i+1]==LOADLR||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS||itype[i+1]==C2LS) {
4202 #ifndef HOST_IMM_ADDR32
4204 agr=MGEN1+((i+1)&1);
4205 ra=get_reg(i_regs->regmap,agr);
4207 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4208 int offset=imm[i+1];
4209 int c=(regs[i+1].wasconst>>rs)&1;
4211 if(itype[i+1]==STORE||itype[i+1]==STORELR
4212 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4213 // Stores to memory go thru the mapper to detect self-modifying
4214 // code, loads don't.
4215 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4216 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4217 generate_map_const(constmap[i+1][rs]+offset,ra);
4219 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4220 generate_map_const(constmap[i+1][rs]+offset,ra);
4223 /*else if(rs1[i]==0) {
4224 generate_map_const(offset,ra);
4229 agr=AGEN1+((i+1)&1);
4230 ra=get_reg(i_regs->regmap,agr);
4232 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4233 int offset=imm[i+1];
4234 int c=(regs[i+1].wasconst>>rs)&1;
4235 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4236 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4237 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4238 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4239 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4241 #ifdef HOST_IMM_ADDR32
4242 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4243 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4245 emit_movimm(constmap[i+1][rs]+offset,ra);
4248 else if(rs1[i+1]==0) {
4249 // Using r0 as a base address
4250 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4251 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4252 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4253 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4255 emit_movimm(offset,ra);
4262 int get_final_value(int hr, int i, int *value)
4264 int reg=regs[i].regmap[hr];
4266 if(regs[i+1].regmap[hr]!=reg) break;
4267 if(!((regs[i+1].isconst>>hr)&1)) break;
4272 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4273 *value=constmap[i][hr];
4277 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4278 // Load in delay slot, out-of-order execution
4279 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4281 #ifdef HOST_IMM_ADDR32
4282 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4284 // Precompute load address
4285 *value=constmap[i][hr]+imm[i+2];
4289 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4291 #ifdef HOST_IMM_ADDR32
4292 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4294 // Precompute load address
4295 *value=constmap[i][hr]+imm[i+1];
4296 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4301 *value=constmap[i][hr];
4302 //printf("c=%x\n",(int)constmap[i][hr]);
4303 if(i==slen-1) return 1;
4305 return !((unneeded_reg[i+1]>>reg)&1);
4307 return !((unneeded_reg_upper[i+1]>>reg)&1);
4311 // Load registers with known constants
4312 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4316 for(hr=0;hr<HOST_REGS;hr++) {
4317 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4318 //if(entry[hr]!=regmap[hr]) {
4319 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4320 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4322 if(get_final_value(hr,i,&value)) {
4327 emit_movimm(value,hr);
4335 for(hr=0;hr<HOST_REGS;hr++) {
4336 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4337 //if(entry[hr]!=regmap[hr]) {
4338 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4339 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4340 if((is32>>(regmap[hr]&63))&1) {
4341 int lr=get_reg(regmap,regmap[hr]-64);
4343 emit_sarimm(lr,31,hr);
4348 if(get_final_value(hr,i,&value)) {
4353 emit_movimm(value,hr);
4362 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4366 for(hr=0;hr<HOST_REGS;hr++) {
4367 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4368 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4369 int value=constmap[i][hr];
4374 emit_movimm(value,hr);
4380 for(hr=0;hr<HOST_REGS;hr++) {
4381 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4382 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4383 if((is32>>(regmap[hr]&63))&1) {
4384 int lr=get_reg(regmap,regmap[hr]-64);
4386 emit_sarimm(lr,31,hr);
4390 int value=constmap[i][hr];
4395 emit_movimm(value,hr);
4403 // Write out all dirty registers (except cycle count)
4404 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4407 for(hr=0;hr<HOST_REGS;hr++) {
4408 if(hr!=EXCLUDE_REG) {
4409 if(i_regmap[hr]>0) {
4410 if(i_regmap[hr]!=CCREG) {
4411 if((i_dirty>>hr)&1) {
4412 if(i_regmap[hr]<64) {
4413 emit_storereg(i_regmap[hr],hr);
4415 if( ((i_is32>>i_regmap[hr])&1) ) {
4416 #ifdef DESTRUCTIVE_WRITEBACK
4417 emit_sarimm(hr,31,hr);
4418 emit_storereg(i_regmap[hr]|64,hr);
4420 emit_sarimm(hr,31,HOST_TEMPREG);
4421 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4426 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4427 emit_storereg(i_regmap[hr],hr);
4436 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4437 // This writes the registers not written by store_regs_bt
4438 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4441 int t=(addr-start)>>2;
4442 for(hr=0;hr<HOST_REGS;hr++) {
4443 if(hr!=EXCLUDE_REG) {
4444 if(i_regmap[hr]>0) {
4445 if(i_regmap[hr]!=CCREG) {
4446 if(i_regmap[hr]==regs[t].regmap_entry[hr] && ((regs[t].dirty>>hr)&1) && !(((i_is32&~regs[t].was32&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)) {
4447 if((i_dirty>>hr)&1) {
4448 if(i_regmap[hr]<64) {
4449 emit_storereg(i_regmap[hr],hr);
4451 if( ((i_is32>>i_regmap[hr])&1) ) {
4452 #ifdef DESTRUCTIVE_WRITEBACK
4453 emit_sarimm(hr,31,hr);
4454 emit_storereg(i_regmap[hr]|64,hr);
4456 emit_sarimm(hr,31,HOST_TEMPREG);
4457 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4462 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4463 emit_storereg(i_regmap[hr],hr);
4474 // Load all registers (except cycle count)
4475 void load_all_regs(signed char i_regmap[])
4478 for(hr=0;hr<HOST_REGS;hr++) {
4479 if(hr!=EXCLUDE_REG) {
4480 if(i_regmap[hr]==0) {
4484 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4486 emit_loadreg(i_regmap[hr],hr);
4492 // Load all current registers also needed by next instruction
4493 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4496 for(hr=0;hr<HOST_REGS;hr++) {
4497 if(hr!=EXCLUDE_REG) {
4498 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4499 if(i_regmap[hr]==0) {
4503 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4505 emit_loadreg(i_regmap[hr],hr);
4512 // Load all regs, storing cycle count if necessary
4513 void load_regs_entry(int t)
4516 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER,HOST_CCREG);
4517 else if(ccadj[t]) emit_addimm(HOST_CCREG,-ccadj[t]*CLOCK_DIVIDER,HOST_CCREG);
4518 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4519 emit_storereg(CCREG,HOST_CCREG);
4522 for(hr=0;hr<HOST_REGS;hr++) {
4523 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4524 if(regs[t].regmap_entry[hr]==0) {
4527 else if(regs[t].regmap_entry[hr]!=CCREG)
4529 emit_loadreg(regs[t].regmap_entry[hr],hr);
4534 for(hr=0;hr<HOST_REGS;hr++) {
4535 if(regs[t].regmap_entry[hr]>=64) {
4536 assert(regs[t].regmap_entry[hr]!=64);
4537 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4538 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4540 emit_loadreg(regs[t].regmap_entry[hr],hr);
4544 emit_sarimm(lr,31,hr);
4549 emit_loadreg(regs[t].regmap_entry[hr],hr);
4555 // Store dirty registers prior to branch
4556 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4558 if(internal_branch(i_is32,addr))
4560 int t=(addr-start)>>2;
4562 for(hr=0;hr<HOST_REGS;hr++) {
4563 if(hr!=EXCLUDE_REG) {
4564 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4565 if(i_regmap[hr]!=regs[t].regmap_entry[hr] || !((regs[t].dirty>>hr)&1) || (((i_is32&~regs[t].was32&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)) {
4566 if((i_dirty>>hr)&1) {
4567 if(i_regmap[hr]<64) {
4568 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4569 emit_storereg(i_regmap[hr],hr);
4570 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4571 #ifdef DESTRUCTIVE_WRITEBACK
4572 emit_sarimm(hr,31,hr);
4573 emit_storereg(i_regmap[hr]|64,hr);
4575 emit_sarimm(hr,31,HOST_TEMPREG);
4576 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4581 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4582 emit_storereg(i_regmap[hr],hr);
4593 // Branch out of this block, write out all dirty regs
4594 wb_dirtys(i_regmap,i_is32,i_dirty);
4598 // Load all needed registers for branch target
4599 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4601 //if(addr>=start && addr<(start+slen*4))
4602 if(internal_branch(i_is32,addr))
4604 int t=(addr-start)>>2;
4606 // Store the cycle count before loading something else
4607 if(i_regmap[HOST_CCREG]!=CCREG) {
4608 assert(i_regmap[HOST_CCREG]==-1);
4610 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4611 emit_storereg(CCREG,HOST_CCREG);
4614 for(hr=0;hr<HOST_REGS;hr++) {
4615 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4616 #ifdef DESTRUCTIVE_WRITEBACK
4617 if(i_regmap[hr]!=regs[t].regmap_entry[hr] || ( !((regs[t].dirty>>hr)&1) && ((i_dirty>>hr)&1) && (((i_is32&~unneeded_reg_upper[t])>>i_regmap[hr])&1) ) || (((i_is32&~regs[t].was32&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)) {
4619 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4621 if(regs[t].regmap_entry[hr]==0) {
4624 else if(regs[t].regmap_entry[hr]!=CCREG)
4626 emit_loadreg(regs[t].regmap_entry[hr],hr);
4632 for(hr=0;hr<HOST_REGS;hr++) {
4633 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64) {
4634 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4635 assert(regs[t].regmap_entry[hr]!=64);
4636 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4637 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4639 emit_loadreg(regs[t].regmap_entry[hr],hr);
4643 emit_sarimm(lr,31,hr);
4648 emit_loadreg(regs[t].regmap_entry[hr],hr);
4651 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4652 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4654 emit_sarimm(lr,31,hr);
4661 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4663 if(addr>=start && addr<start+slen*4-4)
4665 int t=(addr-start)>>2;
4667 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4668 for(hr=0;hr<HOST_REGS;hr++)
4672 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4674 if(regs[t].regmap_entry[hr]!=-1)
4683 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4688 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4693 else // Same register but is it 32-bit or dirty?
4696 if(!((regs[t].dirty>>hr)&1))
4700 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4702 //printf("%x: dirty no match\n",addr);
4707 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4709 //printf("%x: is32 no match\n",addr);
4715 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4717 if(requires_32bit[t]&~i_is32) return 0;
4719 // Delay slots are not valid branch targets
4720 //if(t>0&&(itype[t-1]==RJUMP||itype[t-1]==UJUMP||itype[t-1]==CJUMP||itype[t-1]==SJUMP||itype[t-1]==FJUMP)) return 0;
4721 // Delay slots require additional processing, so do not match
4722 if(is_ds[t]) return 0;
4727 for(hr=0;hr<HOST_REGS;hr++)
4733 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4747 // Used when a branch jumps into the delay slot of another branch
4748 void ds_assemble_entry(int i)
4750 int t=(ba[i]-start)>>2;
4751 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4752 assem_debug("Assemble delay slot at %x\n",ba[i]);
4753 assem_debug("<->\n");
4754 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4755 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4756 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4757 address_generation(t,®s[t],regs[t].regmap_entry);
4758 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4759 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4764 alu_assemble(t,®s[t]);break;
4766 imm16_assemble(t,®s[t]);break;
4768 shift_assemble(t,®s[t]);break;
4770 shiftimm_assemble(t,®s[t]);break;
4772 load_assemble(t,®s[t]);break;
4774 loadlr_assemble(t,®s[t]);break;
4776 store_assemble(t,®s[t]);break;
4778 storelr_assemble(t,®s[t]);break;
4780 cop0_assemble(t,®s[t]);break;
4782 cop1_assemble(t,®s[t]);break;
4784 c1ls_assemble(t,®s[t]);break;
4786 cop2_assemble(t,®s[t]);break;
4788 c2ls_assemble(t,®s[t]);break;
4790 c2op_assemble(t,®s[t]);break;
4792 fconv_assemble(t,®s[t]);break;
4794 float_assemble(t,®s[t]);break;
4796 fcomp_assemble(t,®s[t]);break;
4798 multdiv_assemble(t,®s[t]);break;
4800 mov_assemble(t,®s[t]);break;
4810 printf("Jump in the delay slot. This is probably a bug.\n");
4812 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4813 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4814 if(internal_branch(regs[t].is32,ba[i]+4))
4815 assem_debug("branch: internal\n");
4817 assem_debug("branch: external\n");
4818 assert(internal_branch(regs[t].is32,ba[i]+4));
4819 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4823 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4832 //if(ba[i]>=start && ba[i]<(start+slen*4))
4833 if(internal_branch(branch_regs[i].is32,ba[i]))
4835 int t=(ba[i]-start)>>2;
4836 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4844 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4846 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4848 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4849 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4853 else if(*adj==0||invert) {
4854 emit_addimm_and_set_flags(CLOCK_DIVIDER*(count+2),HOST_CCREG);
4860 emit_cmpimm(HOST_CCREG,-2*(count+2));
4864 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4867 void do_ccstub(int n)
4870 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4871 set_jump_target(stubs[n][1],(int)out);
4873 if(stubs[n][6]==NULLDS) {
4874 // Delay slot instruction is nullified ("likely" branch)
4875 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4877 else if(stubs[n][6]!=TAKEN) {
4878 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4881 if(internal_branch(branch_regs[i].is32,ba[i]))
4882 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4886 // Save PC as return address
4887 emit_movimm(stubs[n][5],EAX);
4888 emit_writeword(EAX,(int)&pcaddr);
4892 // Return address depends on which way the branch goes
4893 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4895 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4896 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4897 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4898 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
4908 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
4912 #ifdef DESTRUCTIVE_WRITEBACK
4914 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
4915 emit_loadreg(rs1[i],s1l);
4918 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
4919 emit_loadreg(rs2[i],s1l);
4922 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
4923 emit_loadreg(rs2[i],s2l);
4926 int addr=-1,alt=-1,ntaddr=-1;
4929 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4930 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4931 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4939 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4940 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4941 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4947 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
4951 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4952 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4953 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4959 assert(hr<HOST_REGS);
4961 if((opcode[i]&0x2f)==4) // BEQ
4963 #ifdef HAVE_CMOV_IMM
4965 if(s2l>=0) emit_cmp(s1l,s2l);
4966 else emit_test(s1l,s1l);
4967 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
4972 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4974 if(s2h>=0) emit_cmp(s1h,s2h);
4975 else emit_test(s1h,s1h);
4976 emit_cmovne_reg(alt,addr);
4978 if(s2l>=0) emit_cmp(s1l,s2l);
4979 else emit_test(s1l,s1l);
4980 emit_cmovne_reg(alt,addr);
4983 if((opcode[i]&0x2f)==5) // BNE
4985 #ifdef HAVE_CMOV_IMM
4987 if(s2l>=0) emit_cmp(s1l,s2l);
4988 else emit_test(s1l,s1l);
4989 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
4994 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
4996 if(s2h>=0) emit_cmp(s1h,s2h);
4997 else emit_test(s1h,s1h);
4998 emit_cmovne_reg(alt,addr);
5000 if(s2l>=0) emit_cmp(s1l,s2l);
5001 else emit_test(s1l,s1l);
5002 emit_cmovne_reg(alt,addr);
5005 if((opcode[i]&0x2f)==6) // BLEZ
5007 //emit_movimm(ba[i],alt);
5008 //emit_movimm(start+i*4+8,addr);
5009 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5011 if(s1h>=0) emit_mov(addr,ntaddr);
5012 emit_cmovl_reg(alt,addr);
5015 emit_cmovne_reg(ntaddr,addr);
5016 emit_cmovs_reg(alt,addr);
5019 if((opcode[i]&0x2f)==7) // BGTZ
5021 //emit_movimm(ba[i],addr);
5022 //emit_movimm(start+i*4+8,ntaddr);
5023 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
5025 if(s1h>=0) emit_mov(addr,alt);
5026 emit_cmovl_reg(ntaddr,addr);
5029 emit_cmovne_reg(alt,addr);
5030 emit_cmovs_reg(ntaddr,addr);
5033 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
5035 //emit_movimm(ba[i],alt);
5036 //emit_movimm(start+i*4+8,addr);
5037 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5038 if(s1h>=0) emit_test(s1h,s1h);
5039 else emit_test(s1l,s1l);
5040 emit_cmovs_reg(alt,addr);
5042 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
5044 //emit_movimm(ba[i],addr);
5045 //emit_movimm(start+i*4+8,alt);
5046 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5047 if(s1h>=0) emit_test(s1h,s1h);
5048 else emit_test(s1l,s1l);
5049 emit_cmovs_reg(alt,addr);
5051 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
5052 if(source[i]&0x10000) // BC1T
5054 //emit_movimm(ba[i],alt);
5055 //emit_movimm(start+i*4+8,addr);
5056 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5057 emit_testimm(s1l,0x800000);
5058 emit_cmovne_reg(alt,addr);
5062 //emit_movimm(ba[i],addr);
5063 //emit_movimm(start+i*4+8,alt);
5064 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5065 emit_testimm(s1l,0x800000);
5066 emit_cmovne_reg(alt,addr);
5069 emit_writeword(addr,(int)&pcaddr);
5074 int r=get_reg(branch_regs[i].regmap,rs1[i]);
5075 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5076 r=get_reg(branch_regs[i].regmap,RTEMP);
5078 emit_writeword(r,(int)&pcaddr);
5080 else {printf("Unknown branch type in do_ccstub\n");exit(1);}
5082 // Update cycle count
5083 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
5084 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5085 emit_call((int)cc_interrupt);
5086 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5087 if(stubs[n][6]==TAKEN) {
5088 if(internal_branch(branch_regs[i].is32,ba[i]))
5089 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
5090 else if(itype[i]==RJUMP) {
5091 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
5092 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
5094 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
5096 }else if(stubs[n][6]==NOTTAKEN) {
5097 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
5098 else load_all_regs(branch_regs[i].regmap);
5099 }else if(stubs[n][6]==NULLDS) {
5100 // Delay slot instruction is nullified ("likely" branch)
5101 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
5102 else load_all_regs(regs[i].regmap);
5104 load_all_regs(branch_regs[i].regmap);
5106 emit_jmp(stubs[n][2]); // return address
5108 /* This works but uses a lot of memory...
5109 emit_readword((int)&last_count,ECX);
5110 emit_add(HOST_CCREG,ECX,EAX);
5111 emit_writeword(EAX,(int)&Count);
5112 emit_call((int)gen_interupt);
5113 emit_readword((int)&Count,HOST_CCREG);
5114 emit_readword((int)&next_interupt,EAX);
5115 emit_readword((int)&pending_exception,EBX);
5116 emit_writeword(EAX,(int)&last_count);
5117 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
5119 int jne_instr=(int)out;
5121 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
5122 load_all_regs(branch_regs[i].regmap);
5123 emit_jmp(stubs[n][2]); // return address
5124 set_jump_target(jne_instr,(int)out);
5125 emit_readword((int)&pcaddr,EAX);
5126 // Call get_addr_ht instead of doing the hash table here.
5127 // This code is executed infrequently and takes up a lot of space
5128 // so smaller is better.
5129 emit_storereg(CCREG,HOST_CCREG);
5131 emit_call((int)get_addr_ht);
5132 emit_loadreg(CCREG,HOST_CCREG);
5133 emit_addimm(ESP,4,ESP);
5137 add_to_linker(int addr,int target,int ext)
5139 link_addr[linkcount][0]=addr;
5140 link_addr[linkcount][1]=target;
5141 link_addr[linkcount][2]=ext;
5145 void ujump_assemble(int i,struct regstat *i_regs)
5147 signed char *i_regmap=i_regs->regmap;
5148 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5149 address_generation(i+1,i_regs,regs[i].regmap_entry);
5151 int temp=get_reg(branch_regs[i].regmap,PTEMP);
5152 if(rt1[i]==31&&temp>=0)
5154 int return_address=start+i*4+8;
5155 if(get_reg(branch_regs[i].regmap,31)>0)
5156 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5161 unsigned int return_address;
5162 rt=get_reg(branch_regs[i].regmap,31);
5163 assem_debug("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
5165 return_address=start+i*4+8;
5168 if(internal_branch(branch_regs[i].is32,return_address)&&rt1[i+1]!=31) {
5169 int temp=-1; // note: must be ds-safe
5173 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5174 else emit_movimm(return_address,rt);
5182 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5185 emit_movimm(return_address,rt); // PC into link register
5187 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5192 ds_assemble(i+1,i_regs);
5193 uint64_t bc_unneeded=branch_regs[i].u;
5194 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5195 bc_unneeded|=1|(1LL<<rt1[i]);
5196 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5197 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5198 bc_unneeded,bc_unneeded_upper);
5199 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5201 cc=get_reg(branch_regs[i].regmap,CCREG);
5202 assert(cc==HOST_CCREG);
5203 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5205 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5207 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5208 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5209 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5210 if(internal_branch(branch_regs[i].is32,ba[i]))
5211 assem_debug("branch: internal\n");
5213 assem_debug("branch: external\n");
5214 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5215 ds_assemble_entry(i);
5218 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5223 void rjump_assemble(int i,struct regstat *i_regs)
5225 signed char *i_regmap=i_regs->regmap;
5228 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5230 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5231 // Delay slot abuse, make a copy of the branch address register
5232 temp=get_reg(branch_regs[i].regmap,RTEMP);
5234 assert(regs[i].regmap[temp]==RTEMP);
5238 address_generation(i+1,i_regs,regs[i].regmap_entry);
5242 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5243 int return_address=start+i*4+8;
5244 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5250 int rh=get_reg(regs[i].regmap,RHASH);
5251 if(rh>=0) do_preload_rhash(rh);
5254 ds_assemble(i+1,i_regs);
5255 uint64_t bc_unneeded=branch_regs[i].u;
5256 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5257 bc_unneeded|=1|(1LL<<rt1[i]);
5258 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5259 bc_unneeded&=~(1LL<<rs1[i]);
5260 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5261 bc_unneeded,bc_unneeded_upper);
5262 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5264 int rt,return_address;
5265 assert(rt1[i+1]!=rt1[i]);
5266 assert(rt2[i+1]!=rt1[i]);
5267 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5268 assem_debug("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
5270 return_address=start+i*4+8;
5274 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5277 emit_movimm(return_address,rt); // PC into link register
5279 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5282 cc=get_reg(branch_regs[i].regmap,CCREG);
5283 assert(cc==HOST_CCREG);
5285 int rh=get_reg(branch_regs[i].regmap,RHASH);
5286 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5288 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5289 do_preload_rhtbl(ht);
5293 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5294 #ifdef DESTRUCTIVE_WRITEBACK
5295 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5296 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5297 emit_loadreg(rs1[i],rs);
5302 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5306 do_miniht_load(ht,rh);
5309 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5310 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5312 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5313 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5315 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5318 do_miniht_jump(rs,rh,ht);
5323 //if(rs!=EAX) emit_mov(rs,EAX);
5324 //emit_jmp((int)jump_vaddr_eax);
5325 emit_jmp(jump_vaddr_reg[rs]);
5330 emit_shrimm(rs,16,rs);
5331 emit_xor(temp,rs,rs);
5332 emit_movzwl_reg(rs,rs);
5333 emit_shlimm(rs,4,rs);
5334 emit_cmpmem_indexed((int)hash_table,rs,temp);
5335 emit_jne((int)out+14);
5336 emit_readword_indexed((int)hash_table+4,rs,rs);
5338 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5339 emit_addimm_no_flags(8,rs);
5340 emit_jeq((int)out-17);
5341 // No hit on hash table, call compiler
5344 #ifdef DEBUG_CYCLE_COUNT
5345 emit_readword((int)&last_count,ECX);
5346 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5347 emit_readword((int)&next_interupt,ECX);
5348 emit_writeword(HOST_CCREG,(int)&Count);
5349 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5350 emit_writeword(ECX,(int)&last_count);
5353 emit_storereg(CCREG,HOST_CCREG);
5354 emit_call((int)get_addr);
5355 emit_loadreg(CCREG,HOST_CCREG);
5356 emit_addimm(ESP,4,ESP);
5358 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5359 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5363 void cjump_assemble(int i,struct regstat *i_regs)
5365 signed char *i_regmap=i_regs->regmap;
5368 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5369 assem_debug("match=%d\n",match);
5370 int s1h,s1l,s2h,s2l;
5371 int prev_cop1_usable=cop1_usable;
5372 int unconditional=0,nop=0;
5375 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5376 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5377 if(!match) invert=1;
5378 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5379 if(i>(ba[i]-start)>>2) invert=1;
5383 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5384 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5385 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5386 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5389 s1l=get_reg(i_regmap,rs1[i]);
5390 s1h=get_reg(i_regmap,rs1[i]|64);
5391 s2l=get_reg(i_regmap,rs2[i]);
5392 s2h=get_reg(i_regmap,rs2[i]|64);
5394 if(rs1[i]==0&&rs2[i]==0)
5396 if(opcode[i]&1) nop=1;
5397 else unconditional=1;
5398 //assert(opcode[i]!=5);
5399 //assert(opcode[i]!=7);
5400 //assert(opcode[i]!=0x15);
5401 //assert(opcode[i]!=0x17);
5407 only32=(regs[i].was32>>rs2[i])&1;
5412 only32=(regs[i].was32>>rs1[i])&1;
5415 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5419 // Out of order execution (delay slot first)
5421 address_generation(i+1,i_regs,regs[i].regmap_entry);
5422 ds_assemble(i+1,i_regs);
5424 uint64_t bc_unneeded=branch_regs[i].u;
5425 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5426 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5427 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5429 bc_unneeded_upper|=1;
5430 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5431 bc_unneeded,bc_unneeded_upper);
5432 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5433 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5434 cc=get_reg(branch_regs[i].regmap,CCREG);
5435 assert(cc==HOST_CCREG);
5437 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5438 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5439 //assem_debug("cycle count (adj)\n");
5441 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5442 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5443 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5444 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5446 assem_debug("branch: internal\n");
5448 assem_debug("branch: external\n");
5449 if(internal&&is_ds[(ba[i]-start)>>2]) {
5450 ds_assemble_entry(i);
5453 add_to_linker((int)out,ba[i],internal);
5456 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5457 if(((u_int)out)&7) emit_addnop(0);
5462 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5465 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5468 int taken=0,nottaken=0,nottaken1=0;
5469 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5470 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5474 if(opcode[i]==4) // BEQ
5476 if(s2h>=0) emit_cmp(s1h,s2h);
5477 else emit_test(s1h,s1h);
5481 if(opcode[i]==5) // BNE
5483 if(s2h>=0) emit_cmp(s1h,s2h);
5484 else emit_test(s1h,s1h);
5485 if(invert) taken=(int)out;
5486 else add_to_linker((int)out,ba[i],internal);
5489 if(opcode[i]==6) // BLEZ
5492 if(invert) taken=(int)out;
5493 else add_to_linker((int)out,ba[i],internal);
5498 if(opcode[i]==7) // BGTZ
5503 if(invert) taken=(int)out;
5504 else add_to_linker((int)out,ba[i],internal);
5509 //printf("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
5511 if(opcode[i]==4) // BEQ
5513 if(s2l>=0) emit_cmp(s1l,s2l);
5514 else emit_test(s1l,s1l);
5519 add_to_linker((int)out,ba[i],internal);
5523 if(opcode[i]==5) // BNE
5525 if(s2l>=0) emit_cmp(s1l,s2l);
5526 else emit_test(s1l,s1l);
5531 add_to_linker((int)out,ba[i],internal);
5535 if(opcode[i]==6) // BLEZ
5542 add_to_linker((int)out,ba[i],internal);
5546 if(opcode[i]==7) // BGTZ
5553 add_to_linker((int)out,ba[i],internal);
5558 if(taken) set_jump_target(taken,(int)out);
5559 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5560 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5562 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5563 add_to_linker((int)out,ba[i],internal);
5566 add_to_linker((int)out,ba[i],internal*2);
5572 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5573 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5574 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5576 assem_debug("branch: internal\n");
5578 assem_debug("branch: external\n");
5579 if(internal&&is_ds[(ba[i]-start)>>2]) {
5580 ds_assemble_entry(i);
5583 add_to_linker((int)out,ba[i],internal);
5587 set_jump_target(nottaken,(int)out);
5590 if(nottaken1) set_jump_target(nottaken1,(int)out);
5592 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5594 } // (!unconditional)
5598 // In-order execution (branch first)
5599 //if(likely[i]) printf("IOL\n");
5602 int taken=0,nottaken=0,nottaken1=0;
5603 if(!unconditional&&!nop) {
5607 if((opcode[i]&0x2f)==4) // BEQ
5609 if(s2h>=0) emit_cmp(s1h,s2h);
5610 else emit_test(s1h,s1h);
5614 if((opcode[i]&0x2f)==5) // BNE
5616 if(s2h>=0) emit_cmp(s1h,s2h);
5617 else emit_test(s1h,s1h);
5621 if((opcode[i]&0x2f)==6) // BLEZ
5629 if((opcode[i]&0x2f)==7) // BGTZ
5639 //printf("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
5641 if((opcode[i]&0x2f)==4) // BEQ
5643 if(s2l>=0) emit_cmp(s1l,s2l);
5644 else emit_test(s1l,s1l);
5648 if((opcode[i]&0x2f)==5) // BNE
5650 if(s2l>=0) emit_cmp(s1l,s2l);
5651 else emit_test(s1l,s1l);
5655 if((opcode[i]&0x2f)==6) // BLEZ
5661 if((opcode[i]&0x2f)==7) // BGTZ
5667 } // if(!unconditional)
5669 uint64_t ds_unneeded=branch_regs[i].u;
5670 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5671 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5672 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5673 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5675 ds_unneeded_upper|=1;
5678 if(taken) set_jump_target(taken,(int)out);
5679 assem_debug("1:\n");
5680 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5681 ds_unneeded,ds_unneeded_upper);
5683 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5684 address_generation(i+1,&branch_regs[i],0);
5685 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5686 ds_assemble(i+1,&branch_regs[i]);
5687 cc=get_reg(branch_regs[i].regmap,CCREG);
5689 emit_loadreg(CCREG,cc=HOST_CCREG);
5690 // CHECK: Is the following instruction (fall thru) allocated ok?
5692 assert(cc==HOST_CCREG);
5693 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5694 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5695 assem_debug("cycle count (adj)\n");
5696 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5697 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5699 assem_debug("branch: internal\n");
5701 assem_debug("branch: external\n");
5702 if(internal&&is_ds[(ba[i]-start)>>2]) {
5703 ds_assemble_entry(i);
5706 add_to_linker((int)out,ba[i],internal);
5711 cop1_usable=prev_cop1_usable;
5712 if(!unconditional) {
5713 if(nottaken1) set_jump_target(nottaken1,(int)out);
5714 set_jump_target(nottaken,(int)out);
5715 assem_debug("2:\n");
5717 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5718 ds_unneeded,ds_unneeded_upper);
5719 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5720 address_generation(i+1,&branch_regs[i],0);
5721 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5722 ds_assemble(i+1,&branch_regs[i]);
5724 cc=get_reg(branch_regs[i].regmap,CCREG);
5725 if(cc==-1&&!likely[i]) {
5726 // Cycle count isn't in a register, temporarily load it then write it out
5727 emit_loadreg(CCREG,HOST_CCREG);
5728 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5731 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5732 emit_storereg(CCREG,HOST_CCREG);
5735 cc=get_reg(i_regmap,CCREG);
5736 assert(cc==HOST_CCREG);
5737 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5740 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5746 void sjump_assemble(int i,struct regstat *i_regs)
5748 signed char *i_regmap=i_regs->regmap;
5751 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5752 assem_debug("smatch=%d\n",match);
5754 int prev_cop1_usable=cop1_usable;
5755 int unconditional=0,nevertaken=0;
5758 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5759 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5760 if(!match) invert=1;
5761 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5762 if(i>(ba[i]-start)>>2) invert=1;
5765 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5766 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5769 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5770 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5773 s1l=get_reg(i_regmap,rs1[i]);
5774 s1h=get_reg(i_regmap,rs1[i]|64);
5778 if(opcode2[i]&1) unconditional=1;
5780 // These are never taken (r0 is never less than zero)
5781 //assert(opcode2[i]!=0);
5782 //assert(opcode2[i]!=2);
5783 //assert(opcode2[i]!=0x10);
5784 //assert(opcode2[i]!=0x12);
5787 only32=(regs[i].was32>>rs1[i])&1;
5791 // Out of order execution (delay slot first)
5793 address_generation(i+1,i_regs,regs[i].regmap_entry);
5794 ds_assemble(i+1,i_regs);
5796 uint64_t bc_unneeded=branch_regs[i].u;
5797 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5798 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5799 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5801 bc_unneeded_upper|=1;
5802 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5803 bc_unneeded,bc_unneeded_upper);
5804 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5805 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5807 int rt,return_address;
5808 rt=get_reg(branch_regs[i].regmap,31);
5809 assem_debug("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
5811 // Save the PC even if the branch is not taken
5812 return_address=start+i*4+8;
5813 emit_movimm(return_address,rt); // PC into link register
5815 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5819 cc=get_reg(branch_regs[i].regmap,CCREG);
5820 assert(cc==HOST_CCREG);
5822 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5823 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5824 assem_debug("cycle count (adj)\n");
5826 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5827 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5828 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5829 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5831 assem_debug("branch: internal\n");
5833 assem_debug("branch: external\n");
5834 if(internal&&is_ds[(ba[i]-start)>>2]) {
5835 ds_assemble_entry(i);
5838 add_to_linker((int)out,ba[i],internal);
5841 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5842 if(((u_int)out)&7) emit_addnop(0);
5846 else if(nevertaken) {
5847 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5850 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5854 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5855 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5859 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5866 add_to_linker((int)out,ba[i],internal);
5870 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5877 add_to_linker((int)out,ba[i],internal);
5885 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5892 add_to_linker((int)out,ba[i],internal);
5896 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5903 add_to_linker((int)out,ba[i],internal);
5910 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5911 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5913 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5914 add_to_linker((int)out,ba[i],internal);
5917 add_to_linker((int)out,ba[i],internal*2);
5923 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5924 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5925 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5927 assem_debug("branch: internal\n");
5929 assem_debug("branch: external\n");
5930 if(internal&&is_ds[(ba[i]-start)>>2]) {
5931 ds_assemble_entry(i);
5934 add_to_linker((int)out,ba[i],internal);
5938 set_jump_target(nottaken,(int)out);
5942 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5944 } // (!unconditional)
5948 // In-order execution (branch first)
5952 int rt,return_address;
5953 rt=get_reg(branch_regs[i].regmap,31);
5955 // Save the PC even if the branch is not taken
5956 return_address=start+i*4+8;
5957 emit_movimm(return_address,rt); // PC into link register
5959 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5963 if(!unconditional) {
5964 //printf("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
5968 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5974 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5984 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5990 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5997 } // if(!unconditional)
5999 uint64_t ds_unneeded=branch_regs[i].u;
6000 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6001 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6002 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6003 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6005 ds_unneeded_upper|=1;
6008 //assem_debug("1:\n");
6009 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6010 ds_unneeded,ds_unneeded_upper);
6012 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6013 address_generation(i+1,&branch_regs[i],0);
6014 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6015 ds_assemble(i+1,&branch_regs[i]);
6016 cc=get_reg(branch_regs[i].regmap,CCREG);
6018 emit_loadreg(CCREG,cc=HOST_CCREG);
6019 // CHECK: Is the following instruction (fall thru) allocated ok?
6021 assert(cc==HOST_CCREG);
6022 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6023 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6024 assem_debug("cycle count (adj)\n");
6025 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6026 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6028 assem_debug("branch: internal\n");
6030 assem_debug("branch: external\n");
6031 if(internal&&is_ds[(ba[i]-start)>>2]) {
6032 ds_assemble_entry(i);
6035 add_to_linker((int)out,ba[i],internal);
6040 cop1_usable=prev_cop1_usable;
6041 if(!unconditional) {
6042 set_jump_target(nottaken,(int)out);
6043 assem_debug("1:\n");
6045 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6046 ds_unneeded,ds_unneeded_upper);
6047 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6048 address_generation(i+1,&branch_regs[i],0);
6049 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6050 ds_assemble(i+1,&branch_regs[i]);
6052 cc=get_reg(branch_regs[i].regmap,CCREG);
6053 if(cc==-1&&!likely[i]) {
6054 // Cycle count isn't in a register, temporarily load it then write it out
6055 emit_loadreg(CCREG,HOST_CCREG);
6056 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6059 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6060 emit_storereg(CCREG,HOST_CCREG);
6063 cc=get_reg(i_regmap,CCREG);
6064 assert(cc==HOST_CCREG);
6065 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6068 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6074 void fjump_assemble(int i,struct regstat *i_regs)
6076 signed char *i_regmap=i_regs->regmap;
6079 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6080 assem_debug("fmatch=%d\n",match);
6084 int internal=internal_branch(branch_regs[i].is32,ba[i]);
6085 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
6086 if(!match) invert=1;
6087 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6088 if(i>(ba[i]-start)>>2) invert=1;
6092 fs=get_reg(branch_regs[i].regmap,FSREG);
6093 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
6096 fs=get_reg(i_regmap,FSREG);
6099 // Check cop1 unusable
6101 cs=get_reg(i_regmap,CSREG);
6103 emit_testimm(cs,0x20000000);
6106 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
6111 // Out of order execution (delay slot first)
6113 ds_assemble(i+1,i_regs);
6115 uint64_t bc_unneeded=branch_regs[i].u;
6116 uint64_t bc_unneeded_upper=branch_regs[i].uu;
6117 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6118 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
6120 bc_unneeded_upper|=1;
6121 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6122 bc_unneeded,bc_unneeded_upper);
6123 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
6124 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6125 cc=get_reg(branch_regs[i].regmap,CCREG);
6126 assert(cc==HOST_CCREG);
6127 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6128 assem_debug("cycle count (adj)\n");
6131 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6134 emit_testimm(fs,0x800000);
6135 if(source[i]&0x10000) // BC1T
6141 add_to_linker((int)out,ba[i],internal);
6150 add_to_linker((int)out,ba[i],internal);
6158 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
6159 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6160 else if(match) emit_addnop(13);
6162 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6163 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6165 assem_debug("branch: internal\n");
6167 assem_debug("branch: external\n");
6168 if(internal&&is_ds[(ba[i]-start)>>2]) {
6169 ds_assemble_entry(i);
6172 add_to_linker((int)out,ba[i],internal);
6175 set_jump_target(nottaken,(int)out);
6179 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
6181 } // (!unconditional)
6185 // In-order execution (branch first)
6189 //printf("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
6192 emit_testimm(fs,0x800000);
6193 if(source[i]&0x10000) // BC1T
6204 } // if(!unconditional)
6206 uint64_t ds_unneeded=branch_regs[i].u;
6207 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6208 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6209 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6210 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6212 ds_unneeded_upper|=1;
6214 //assem_debug("1:\n");
6215 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6216 ds_unneeded,ds_unneeded_upper);
6218 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6219 address_generation(i+1,&branch_regs[i],0);
6220 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6221 ds_assemble(i+1,&branch_regs[i]);
6222 cc=get_reg(branch_regs[i].regmap,CCREG);
6224 emit_loadreg(CCREG,cc=HOST_CCREG);
6225 // CHECK: Is the following instruction (fall thru) allocated ok?
6227 assert(cc==HOST_CCREG);
6228 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6229 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6230 assem_debug("cycle count (adj)\n");
6231 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6232 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6234 assem_debug("branch: internal\n");
6236 assem_debug("branch: external\n");
6237 if(internal&&is_ds[(ba[i]-start)>>2]) {
6238 ds_assemble_entry(i);
6241 add_to_linker((int)out,ba[i],internal);
6246 if(1) { // <- FIXME (don't need this)
6247 set_jump_target(nottaken,(int)out);
6248 assem_debug("1:\n");
6250 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6251 ds_unneeded,ds_unneeded_upper);
6252 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6253 address_generation(i+1,&branch_regs[i],0);
6254 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6255 ds_assemble(i+1,&branch_regs[i]);
6257 cc=get_reg(branch_regs[i].regmap,CCREG);
6258 if(cc==-1&&!likely[i]) {
6259 // Cycle count isn't in a register, temporarily load it then write it out
6260 emit_loadreg(CCREG,HOST_CCREG);
6261 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6264 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6265 emit_storereg(CCREG,HOST_CCREG);
6268 cc=get_reg(i_regmap,CCREG);
6269 assert(cc==HOST_CCREG);
6270 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6273 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6279 static void pagespan_assemble(int i,struct regstat *i_regs)
6281 int s1l=get_reg(i_regs->regmap,rs1[i]);
6282 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6283 int s2l=get_reg(i_regs->regmap,rs2[i]);
6284 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6285 void *nt_branch=NULL;
6288 int unconditional=0;
6298 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6302 int addr,alt,ntaddr;
6303 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6307 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6308 (i_regs->regmap[hr]&63)!=rs1[i] &&
6309 (i_regs->regmap[hr]&63)!=rs2[i] )
6318 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6319 (i_regs->regmap[hr]&63)!=rs1[i] &&
6320 (i_regs->regmap[hr]&63)!=rs2[i] )
6326 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6330 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6331 (i_regs->regmap[hr]&63)!=rs1[i] &&
6332 (i_regs->regmap[hr]&63)!=rs2[i] )
6339 assert(hr<HOST_REGS);
6340 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6341 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6343 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6344 if(opcode[i]==2) // J
6348 if(opcode[i]==3) // JAL
6351 int rt=get_reg(i_regs->regmap,31);
6352 emit_movimm(start+i*4+8,rt);
6355 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6358 if(opcode2[i]==9) // JALR
6360 int rt=get_reg(i_regs->regmap,rt1[i]);
6361 emit_movimm(start+i*4+8,rt);
6364 if((opcode[i]&0x3f)==4) // BEQ
6371 #ifdef HAVE_CMOV_IMM
6373 if(s2l>=0) emit_cmp(s1l,s2l);
6374 else emit_test(s1l,s1l);
6375 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6381 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6383 if(s2h>=0) emit_cmp(s1h,s2h);
6384 else emit_test(s1h,s1h);
6385 emit_cmovne_reg(alt,addr);
6387 if(s2l>=0) emit_cmp(s1l,s2l);
6388 else emit_test(s1l,s1l);
6389 emit_cmovne_reg(alt,addr);
6392 if((opcode[i]&0x3f)==5) // BNE
6394 #ifdef HAVE_CMOV_IMM
6396 if(s2l>=0) emit_cmp(s1l,s2l);
6397 else emit_test(s1l,s1l);
6398 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6404 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6406 if(s2h>=0) emit_cmp(s1h,s2h);
6407 else emit_test(s1h,s1h);
6408 emit_cmovne_reg(alt,addr);
6410 if(s2l>=0) emit_cmp(s1l,s2l);
6411 else emit_test(s1l,s1l);
6412 emit_cmovne_reg(alt,addr);
6415 if((opcode[i]&0x3f)==0x14) // BEQL
6418 if(s2h>=0) emit_cmp(s1h,s2h);
6419 else emit_test(s1h,s1h);
6423 if(s2l>=0) emit_cmp(s1l,s2l);
6424 else emit_test(s1l,s1l);
6425 if(nottaken) set_jump_target(nottaken,(int)out);
6429 if((opcode[i]&0x3f)==0x15) // BNEL
6432 if(s2h>=0) emit_cmp(s1h,s2h);
6433 else emit_test(s1h,s1h);
6437 if(s2l>=0) emit_cmp(s1l,s2l);
6438 else emit_test(s1l,s1l);
6441 if(taken) set_jump_target(taken,(int)out);
6443 if((opcode[i]&0x3f)==6) // BLEZ
6445 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6447 if(s1h>=0) emit_mov(addr,ntaddr);
6448 emit_cmovl_reg(alt,addr);
6451 emit_cmovne_reg(ntaddr,addr);
6452 emit_cmovs_reg(alt,addr);
6455 if((opcode[i]&0x3f)==7) // BGTZ
6457 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6459 if(s1h>=0) emit_mov(addr,alt);
6460 emit_cmovl_reg(ntaddr,addr);
6463 emit_cmovne_reg(alt,addr);
6464 emit_cmovs_reg(ntaddr,addr);
6467 if((opcode[i]&0x3f)==0x16) // BLEZL
6469 assert((opcode[i]&0x3f)!=0x16);
6471 if((opcode[i]&0x3f)==0x17) // BGTZL
6473 assert((opcode[i]&0x3f)!=0x17);
6475 assert(opcode[i]!=1); // BLTZ/BGEZ
6477 //FIXME: Check CSREG
6478 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6479 if((source[i]&0x30000)==0) // BC1F
6481 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6482 emit_testimm(s1l,0x800000);
6483 emit_cmovne_reg(alt,addr);
6485 if((source[i]&0x30000)==0x10000) // BC1T
6487 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6488 emit_testimm(s1l,0x800000);
6489 emit_cmovne_reg(alt,addr);
6491 if((source[i]&0x30000)==0x20000) // BC1FL
6493 emit_testimm(s1l,0x800000);
6497 if((source[i]&0x30000)==0x30000) // BC1TL
6499 emit_testimm(s1l,0x800000);
6505 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6506 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6507 if(likely[i]||unconditional)
6509 emit_movimm(ba[i],HOST_BTREG);
6511 else if(addr!=HOST_BTREG)
6513 emit_mov(addr,HOST_BTREG);
6515 void *branch_addr=out;
6517 int target_addr=start+i*4+5;
6519 void *compiled_target_addr=check_addr(target_addr);
6520 emit_extjump_ds((int)branch_addr,target_addr);
6521 if(compiled_target_addr) {
6522 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6523 add_link(target_addr,stub);
6525 else set_jump_target((int)branch_addr,(int)stub);
6528 set_jump_target((int)nottaken,(int)out);
6529 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6530 void *branch_addr=out;
6532 int target_addr=start+i*4+8;
6534 void *compiled_target_addr=check_addr(target_addr);
6535 emit_extjump_ds((int)branch_addr,target_addr);
6536 if(compiled_target_addr) {
6537 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6538 add_link(target_addr,stub);
6540 else set_jump_target((int)branch_addr,(int)stub);
6544 // Assemble the delay slot for the above
6545 static void pagespan_ds()
6547 assem_debug("initial delay slot:\n");
6548 u_int vaddr=start+1;
6549 u_int page=get_page(vaddr);
6550 u_int vpage=get_vpage(vaddr);
6551 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6553 ll_add(jump_in+page,vaddr,(void *)out);
6554 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6555 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6556 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6557 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6558 emit_writeword(HOST_BTREG,(int)&branch_target);
6559 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6560 address_generation(0,®s[0],regs[0].regmap_entry);
6561 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6562 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6567 alu_assemble(0,®s[0]);break;
6569 imm16_assemble(0,®s[0]);break;
6571 shift_assemble(0,®s[0]);break;
6573 shiftimm_assemble(0,®s[0]);break;
6575 load_assemble(0,®s[0]);break;
6577 loadlr_assemble(0,®s[0]);break;
6579 store_assemble(0,®s[0]);break;
6581 storelr_assemble(0,®s[0]);break;
6583 cop0_assemble(0,®s[0]);break;
6585 cop1_assemble(0,®s[0]);break;
6587 c1ls_assemble(0,®s[0]);break;
6589 cop2_assemble(0,®s[0]);break;
6591 c2ls_assemble(0,®s[0]);break;
6593 c2op_assemble(0,®s[0]);break;
6595 fconv_assemble(0,®s[0]);break;
6597 float_assemble(0,®s[0]);break;
6599 fcomp_assemble(0,®s[0]);break;
6601 multdiv_assemble(0,®s[0]);break;
6603 mov_assemble(0,®s[0]);break;
6613 printf("Jump in the delay slot. This is probably a bug.\n");
6615 int btaddr=get_reg(regs[0].regmap,BTREG);
6617 btaddr=get_reg(regs[0].regmap,-1);
6618 emit_readword((int)&branch_target,btaddr);
6620 assert(btaddr!=HOST_CCREG);
6621 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6623 emit_movimm(start+4,HOST_TEMPREG);
6624 emit_cmp(btaddr,HOST_TEMPREG);
6626 emit_cmpimm(btaddr,start+4);
6628 int branch=(int)out;
6630 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6631 emit_jmp(jump_vaddr_reg[btaddr]);
6632 set_jump_target(branch,(int)out);
6633 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6634 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6637 // Basic liveness analysis for MIPS registers
6638 void unneeded_registers(int istart,int iend,int r)
6642 uint64_t temp_u,temp_uu;
6647 u=unneeded_reg[iend+1];
6648 uu=unneeded_reg_upper[iend+1];
6651 for (i=iend;i>=istart;i--)
6653 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6654 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6656 // If subroutine call, flag return address as a possible branch target
6657 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6659 if(ba[i]<start || ba[i]>=(start+slen*4))
6661 // Branch out of this block, flush all regs
6665 if(itype[i]==UJUMP&&rt1[i]==31)
6667 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6669 if(itype[i]==RJUMP&&rs1[i]==31)
6671 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6673 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6674 if(itype[i]==UJUMP&&rt1[i]==31)
6676 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6677 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6679 if(itype[i]==RJUMP&&rs1[i]==31)
6681 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6682 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6685 branch_unneeded_reg[i]=u;
6686 branch_unneeded_reg_upper[i]=uu;
6687 // Merge in delay slot
6688 tdep=(~uu>>rt1[i+1])&1;
6689 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6690 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6691 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6692 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6693 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6695 // If branch is "likely" (and conditional)
6696 // then we skip the delay slot on the fall-thru path
6699 u&=unneeded_reg[i+2];
6700 uu&=unneeded_reg_upper[i+2];
6711 // Internal branch, flag target
6712 bt[(ba[i]-start)>>2]=1;
6713 if(ba[i]<=start+i*4) {
6715 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6717 // Unconditional branch
6720 // Conditional branch (not taken case)
6721 temp_u=unneeded_reg[i+2];
6722 temp_uu=unneeded_reg_upper[i+2];
6724 // Merge in delay slot
6725 tdep=(~temp_uu>>rt1[i+1])&1;
6726 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6727 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6728 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6729 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6730 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6731 temp_u|=1;temp_uu|=1;
6732 // If branch is "likely" (and conditional)
6733 // then we skip the delay slot on the fall-thru path
6736 temp_u&=unneeded_reg[i+2];
6737 temp_uu&=unneeded_reg_upper[i+2];
6745 tdep=(~temp_uu>>rt1[i])&1;
6746 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6747 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6748 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6749 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6750 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6751 temp_u|=1;temp_uu|=1;
6752 unneeded_reg[i]=temp_u;
6753 unneeded_reg_upper[i]=temp_uu;
6754 // Only go three levels deep. This recursion can take an
6755 // excessive amount of time if there are a lot of nested loops.
6757 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6759 unneeded_reg[(ba[i]-start)>>2]=1;
6760 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6763 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6765 // Unconditional branch
6766 u=unneeded_reg[(ba[i]-start)>>2];
6767 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6768 branch_unneeded_reg[i]=u;
6769 branch_unneeded_reg_upper[i]=uu;
6772 //branch_unneeded_reg[i]=u;
6773 //branch_unneeded_reg_upper[i]=uu;
6774 // Merge in delay slot
6775 tdep=(~uu>>rt1[i+1])&1;
6776 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6777 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6778 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6779 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6780 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6783 // Conditional branch
6784 b=unneeded_reg[(ba[i]-start)>>2];
6785 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6786 branch_unneeded_reg[i]=b;
6787 branch_unneeded_reg_upper[i]=bu;
6790 //branch_unneeded_reg[i]=b;
6791 //branch_unneeded_reg_upper[i]=bu;
6792 // Branch delay slot
6793 tdep=(~uu>>rt1[i+1])&1;
6794 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6795 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6796 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6797 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6798 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6800 // If branch is "likely" then we skip the
6801 // delay slot on the fall-thru path
6806 u&=unneeded_reg[i+2];
6807 uu&=unneeded_reg_upper[i+2];
6818 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6819 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6820 //branch_unneeded_reg[i]=1;
6821 //branch_unneeded_reg_upper[i]=1;
6823 branch_unneeded_reg[i]=1;
6824 branch_unneeded_reg_upper[i]=1;
6830 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
6832 // SYSCALL instruction (software interrupt)
6836 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6838 // ERET instruction (return from interrupt)
6843 tdep=(~uu>>rt1[i])&1;
6844 // Written registers are unneeded
6849 // Accessed registers are needed
6854 // Source-target dependencies
6855 uu&=~(tdep<<dep1[i]);
6856 uu&=~(tdep<<dep2[i]);
6857 // R0 is always unneeded
6861 unneeded_reg_upper[i]=uu;
6863 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
6866 for(r=1;r<=CCREG;r++) {
6867 if((unneeded_reg[i]>>r)&1) {
6868 if(r==HIREG) printf(" HI");
6869 else if(r==LOREG) printf(" LO");
6870 else printf(" r%d",r);
6874 for(r=1;r<=CCREG;r++) {
6875 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
6876 if(r==HIREG) printf(" HI");
6877 else if(r==LOREG) printf(" LO");
6878 else printf(" r%d",r);
6884 for (i=iend;i>=istart;i--)
6886 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
6891 // Identify registers which are likely to contain 32-bit values
6892 // This is used to predict whether any branches will jump to a
6893 // location with 64-bit values in registers.
6894 static void provisional_32bit()
6898 uint64_t lastbranch=1;
6903 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
6904 if(i>1) is32=lastbranch;
6910 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
6912 if(i>2) is32=lastbranch;
6916 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
6918 if(rs1[i-2]==0||rs2[i-2]==0)
6921 is32|=1LL<<rs1[i-2];
6924 is32|=1LL<<rs2[i-2];
6929 // If something jumps here with 64-bit values
6930 // then promote those registers to 64 bits
6933 uint64_t temp_is32=is32;
6936 if(ba[j]==start+i*4)
6937 //temp_is32&=branch_regs[j].is32;
6942 if(ba[j]==start+i*4)
6953 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
6954 // Branches don't write registers, consider the delay slot instead.
6965 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
6966 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
6975 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
6976 if(op==0x22) is32|=1LL<<rt; // LWL
6979 if (op==0x08||op==0x09|| // ADDI/ADDIU
6980 op==0x0a||op==0x0b|| // SLTI/SLTIU
6986 if(op==0x18||op==0x19) { // DADDI/DADDIU
6989 // is32|=((is32>>s1)&1LL)<<rt;
6991 if(op==0x0d||op==0x0e) { // ORI/XORI
6992 uint64_t sr=((is32>>s1)&1LL);
7008 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
7011 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
7014 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
7015 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
7019 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
7024 uint64_t sr=((is32>>s1)&1LL);
7029 uint64_t sr=((is32>>s2)&1LL);
7037 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
7042 uint64_t sr=((is32>>s1)&1LL);
7052 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
7053 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
7056 is32|=(1LL<<HIREG)|(1LL<<LOREG);
7061 uint64_t sr=((is32>>s1)&1LL);
7067 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
7068 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
7072 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
7073 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
7076 if(op2==0) is32|=1LL<<rt; // MFC0
7080 if(op2==0) is32|=1LL<<rt; // MFC1
7081 if(op2==1) is32&=~(1LL<<rt); // DMFC1
7082 if(op2==2) is32|=1LL<<rt; // CFC1
7104 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
7106 if(rt1[i-1]==31) // JAL/JALR
7108 // Subroutine call will return here, don't alloc any registers
7113 // Internal branch will jump here, match registers to caller
7121 // Identify registers which may be assumed to contain 32-bit values
7122 // and where optimizations will rely on this.
7123 // This is used to determine whether backward branches can safely
7124 // jump to a location with 64-bit values in registers.
7125 static void provisional_r32()
7130 for (i=slen-1;i>=0;i--)
7133 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7135 if(ba[i]<start || ba[i]>=(start+slen*4))
7137 // Branch out of this block, don't need anything
7143 // Need whatever matches the target
7144 // (and doesn't get overwritten by the delay slot instruction)
7146 int t=(ba[i]-start)>>2;
7147 if(ba[i]>start+i*4) {
7149 //if(!(requires_32bit[t]&~regs[i].was32))
7150 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7151 if(!(pr32[t]&~regs[i].was32))
7152 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7155 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7156 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7159 // Conditional branch may need registers for following instructions
7160 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7163 //r32|=requires_32bit[i+2];
7166 // Mark this address as a branch target since it may be called
7167 // upon return from interrupt
7171 // Merge in delay slot
7173 // These are overwritten unless the branch is "likely"
7174 // and the delay slot is nullified if not taken
7175 r32&=~(1LL<<rt1[i+1]);
7176 r32&=~(1LL<<rt2[i+1]);
7178 // Assume these are needed (delay slot)
7181 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7185 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7187 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7189 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7191 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7193 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7196 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7198 // SYSCALL instruction (software interrupt)
7201 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7203 // ERET instruction (return from interrupt)
7207 r32&=~(1LL<<rt1[i]);
7208 r32&=~(1LL<<rt2[i]);
7211 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7215 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7217 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7219 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7221 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7223 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7225 //requires_32bit[i]=r32;
7228 // Dirty registers which are 32-bit, require 32-bit input
7229 // as they will be written as 32-bit values
7230 for(hr=0;hr<HOST_REGS;hr++)
7232 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7233 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7234 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7235 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7236 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7243 // Write back dirty registers as soon as we will no longer modify them,
7244 // so that we don't end up with lots of writes at the branches.
7245 void clean_registers(int istart,int iend,int wr)
7249 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7250 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7252 will_dirty_i=will_dirty_next=0;
7253 wont_dirty_i=wont_dirty_next=0;
7255 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7256 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7258 for (i=iend;i>=istart;i--)
7260 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7262 if(ba[i]<start || ba[i]>=(start+slen*4))
7264 // Branch out of this block, flush all regs
7265 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7267 // Unconditional branch
7270 // Merge in delay slot (will dirty)
7271 for(r=0;r<HOST_REGS;r++) {
7272 if(r!=EXCLUDE_REG) {
7273 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7274 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7275 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7276 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7277 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7278 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7279 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7280 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7281 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7282 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7283 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7284 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7285 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7286 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7292 // Conditional branch
7294 wont_dirty_i=wont_dirty_next;
7295 // Merge in delay slot (will dirty)
7296 for(r=0;r<HOST_REGS;r++) {
7297 if(r!=EXCLUDE_REG) {
7299 // Might not dirty if likely branch is not taken
7300 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7301 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7302 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7303 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7304 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7305 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7306 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7307 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7308 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7309 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7310 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7311 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7312 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7313 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7318 // Merge in delay slot (wont dirty)
7319 for(r=0;r<HOST_REGS;r++) {
7320 if(r!=EXCLUDE_REG) {
7321 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7322 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7323 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7324 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7325 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7326 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7327 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7328 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7329 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7330 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7334 #ifndef DESTRUCTIVE_WRITEBACK
7335 branch_regs[i].dirty&=wont_dirty_i;
7337 branch_regs[i].dirty|=will_dirty_i;
7343 if(ba[i]<=start+i*4) {
7345 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7347 // Unconditional branch
7350 // Merge in delay slot (will dirty)
7351 for(r=0;r<HOST_REGS;r++) {
7352 if(r!=EXCLUDE_REG) {
7353 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7354 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7355 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7356 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7357 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7358 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7359 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7360 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7361 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7362 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7363 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7364 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7365 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7366 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7370 // Conditional branch (not taken case)
7371 temp_will_dirty=will_dirty_next;
7372 temp_wont_dirty=wont_dirty_next;
7373 // Merge in delay slot (will dirty)
7374 for(r=0;r<HOST_REGS;r++) {
7375 if(r!=EXCLUDE_REG) {
7377 // Will not dirty if likely branch is not taken
7378 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7379 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7380 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7381 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7382 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7383 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7384 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7385 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7386 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7387 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7388 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7389 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7390 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7391 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7396 // Merge in delay slot (wont dirty)
7397 for(r=0;r<HOST_REGS;r++) {
7398 if(r!=EXCLUDE_REG) {
7399 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7400 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7401 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7402 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7403 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7404 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7405 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7406 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7407 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7408 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7411 // Deal with changed mappings
7413 for(r=0;r<HOST_REGS;r++) {
7414 if(r!=EXCLUDE_REG) {
7415 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7416 temp_will_dirty&=~(1<<r);
7417 temp_wont_dirty&=~(1<<r);
7418 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7419 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7420 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7422 temp_will_dirty|=1<<r;
7423 temp_wont_dirty|=1<<r;
7430 will_dirty[i]=temp_will_dirty;
7431 wont_dirty[i]=temp_wont_dirty;
7432 clean_registers((ba[i]-start)>>2,i-1,0);
7434 // Limit recursion. It can take an excessive amount
7435 // of time if there are a lot of nested loops.
7436 will_dirty[(ba[i]-start)>>2]=0;
7437 wont_dirty[(ba[i]-start)>>2]=-1;
7442 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7444 // Unconditional branch
7447 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7448 for(r=0;r<HOST_REGS;r++) {
7449 if(r!=EXCLUDE_REG) {
7450 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7451 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7452 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7457 // Merge in delay slot
7458 for(r=0;r<HOST_REGS;r++) {
7459 if(r!=EXCLUDE_REG) {
7460 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7461 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7462 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7463 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7464 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7465 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7466 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7467 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7468 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7469 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7470 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7471 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7472 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7473 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7477 // Conditional branch
7478 will_dirty_i=will_dirty_next;
7479 wont_dirty_i=wont_dirty_next;
7480 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7481 for(r=0;r<HOST_REGS;r++) {
7482 if(r!=EXCLUDE_REG) {
7483 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7484 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7485 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7489 will_dirty_i&=~(1<<r);
7491 // Treat delay slot as part of branch too
7492 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7493 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7494 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7498 will_dirty[i+1]&=~(1<<r);
7503 // Merge in delay slot
7504 for(r=0;r<HOST_REGS;r++) {
7505 if(r!=EXCLUDE_REG) {
7507 // Might not dirty if likely branch is not taken
7508 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7509 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7510 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7511 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7512 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7513 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7514 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7515 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7516 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7517 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7518 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7519 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7520 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7521 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7526 // Merge in delay slot
7527 for(r=0;r<HOST_REGS;r++) {
7528 if(r!=EXCLUDE_REG) {
7529 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7530 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7531 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7532 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7533 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7534 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7535 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7536 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7537 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7538 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7542 #ifndef DESTRUCTIVE_WRITEBACK
7543 branch_regs[i].dirty&=wont_dirty_i;
7545 branch_regs[i].dirty|=will_dirty_i;
7550 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7552 // SYSCALL instruction (software interrupt)
7556 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7558 // ERET instruction (return from interrupt)
7562 will_dirty_next=will_dirty_i;
7563 wont_dirty_next=wont_dirty_i;
7564 for(r=0;r<HOST_REGS;r++) {
7565 if(r!=EXCLUDE_REG) {
7566 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7567 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7568 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7569 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7570 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7571 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7572 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7573 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7575 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7577 // Don't store a register immediately after writing it,
7578 // may prevent dual-issue.
7579 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7580 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7586 will_dirty[i]=will_dirty_i;
7587 wont_dirty[i]=wont_dirty_i;
7588 // Mark registers that won't be dirtied as not dirty
7590 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7591 for(r=0;r<HOST_REGS;r++) {
7592 if((will_dirty_i>>r)&1) {
7598 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7599 regs[i].dirty|=will_dirty_i;
7600 #ifndef DESTRUCTIVE_WRITEBACK
7601 regs[i].dirty&=wont_dirty_i;
7602 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7604 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7605 for(r=0;r<HOST_REGS;r++) {
7606 if(r!=EXCLUDE_REG) {
7607 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7608 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7609 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7617 for(r=0;r<HOST_REGS;r++) {
7618 if(r!=EXCLUDE_REG) {
7619 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7620 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7621 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7629 // Deal with changed mappings
7630 temp_will_dirty=will_dirty_i;
7631 temp_wont_dirty=wont_dirty_i;
7632 for(r=0;r<HOST_REGS;r++) {
7633 if(r!=EXCLUDE_REG) {
7635 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7637 #ifndef DESTRUCTIVE_WRITEBACK
7638 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7640 regs[i].wasdirty|=will_dirty_i&(1<<r);
7643 else if((nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7644 // Register moved to a different register
7645 will_dirty_i&=~(1<<r);
7646 wont_dirty_i&=~(1<<r);
7647 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7648 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7650 #ifndef DESTRUCTIVE_WRITEBACK
7651 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7653 regs[i].wasdirty|=will_dirty_i&(1<<r);
7657 will_dirty_i&=~(1<<r);
7658 wont_dirty_i&=~(1<<r);
7659 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7660 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7661 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7664 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7673 void disassemble_inst(int i)
7675 if (bt[i]) printf("*"); else printf(" ");
7678 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7680 printf (" %x: %s r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],i?start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14):*ba);break;
7682 printf (" %x: %s r%d,%8x\n",start+i*4,insn[i],rs1[i],start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14));break;
7684 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7686 if (opcode[i]==0x9&&rt1[i]!=31)
7687 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7689 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7692 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7694 if(opcode[i]==0xf) //LUI
7695 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7697 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7701 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7705 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7709 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7712 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7715 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7718 if((opcode2[i]&0x1d)==0x10)
7719 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7720 else if((opcode2[i]&0x1d)==0x11)
7721 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7723 printf (" %x: %s\n",start+i*4,insn[i]);
7727 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7728 else if(opcode2[i]==4)
7729 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7730 else printf (" %x: %s\n",start+i*4,insn[i]);
7734 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7735 else if(opcode2[i]>3)
7736 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7737 else printf (" %x: %s\n",start+i*4,insn[i]);
7741 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7742 else if(opcode2[i]>3)
7743 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7744 else printf (" %x: %s\n",start+i*4,insn[i]);
7747 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7750 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7753 printf (" %x: %s (INTCALL)\n",start+i*4,insn[i]);
7756 //printf (" %s %8x\n",insn[i],source[i]);
7757 printf (" %x: %s\n",start+i*4,insn[i]);
7761 // clear the state completely, instead of just marking
7762 // things invalid like invalidate_all_pages() does
7763 void new_dynarec_clear_full()
7766 out=(u_char *)BASE_ADDR;
7767 memset(invalid_code,1,sizeof(invalid_code));
7768 memset(hash_table,0xff,sizeof(hash_table));
7769 memset(mini_ht,-1,sizeof(mini_ht));
7770 memset(restore_candidate,0,sizeof(restore_candidate));
7771 memset(shadow,0,sizeof(shadow));
7773 expirep=16384; // Expiry pointer, +2 blocks
7774 pending_exception=0;
7782 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7784 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7785 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7786 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7788 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7789 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7790 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7793 void new_dynarec_init()
7795 printf("Init new dynarec\n");
7796 out=(u_char *)BASE_ADDR;
7797 if (mmap (out, 1<<TARGET_SIZE_2,
7798 PROT_READ | PROT_WRITE | PROT_EXEC,
7799 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
7800 -1, 0) <= 0) {printf("mmap() failed\n");}
7802 rdword=&readmem_dword;
7803 fake_pc.f.r.rs=&readmem_dword;
7804 fake_pc.f.r.rt=&readmem_dword;
7805 fake_pc.f.r.rd=&readmem_dword;
7808 new_dynarec_clear_full();
7810 // Copy this into local area so we don't have to put it in every literal pool
7811 invc_ptr=invalid_code;
7814 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
7815 writemem[n] = write_nomem_new;
7816 writememb[n] = write_nomemb_new;
7817 writememh[n] = write_nomemh_new;
7819 writememd[n] = write_nomemd_new;
7821 readmem[n] = read_nomem_new;
7822 readmemb[n] = read_nomemb_new;
7823 readmemh[n] = read_nomemh_new;
7825 readmemd[n] = read_nomemd_new;
7828 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
7829 writemem[n] = write_rdram_new;
7830 writememb[n] = write_rdramb_new;
7831 writememh[n] = write_rdramh_new;
7833 writememd[n] = write_rdramd_new;
7836 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
7837 writemem[n] = write_nomem_new;
7838 writememb[n] = write_nomemb_new;
7839 writememh[n] = write_nomemh_new;
7841 writememd[n] = write_nomemd_new;
7843 readmem[n] = read_nomem_new;
7844 readmemb[n] = read_nomemb_new;
7845 readmemh[n] = read_nomemh_new;
7847 readmemd[n] = read_nomemd_new;
7855 void new_dynarec_cleanup()
7858 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {printf("munmap() failed\n");}
7859 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7860 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7861 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7863 if (munmap (ROM_COPY, 67108864) < 0) {printf("munmap() failed\n");}
7867 int new_recompile_block(int addr)
7870 if(addr==0x800cd050) {
7872 for(block=0x80000;block<0x80800;block++) invalidate_block(block);
7874 for(n=0;n<=2048;n++) ll_clear(jump_dirty+n);
7877 //if(Count==365117028) tracedebug=1;
7878 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7879 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7880 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
7882 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
7883 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
7884 /*if(Count>=312978186) {
7888 start = (u_int)addr&~3;
7889 //assert(((u_int)addr&1)==0);
7891 if(!sp_in_mirror&&(signed int)(psxRegs.GPR.n.sp&0xffe00000)>0x80200000&&
7892 0x10000<=psxRegs.GPR.n.sp&&(psxRegs.GPR.n.sp&~0xe0e00000)<RAM_SIZE) {
7893 printf("SP hack enabled (%08x), @%08x\n", psxRegs.GPR.n.sp, psxRegs.pc);
7896 if (Config.HLE && start == 0x80001000) // hlecall
7898 // XXX: is this enough? Maybe check hleSoftCall?
7899 u_int beginning=(u_int)out;
7900 u_int page=get_page(start);
7901 invalid_code[start>>12]=0;
7902 emit_movimm(start,0);
7903 emit_writeword(0,(int)&pcaddr);
7904 emit_jmp((int)new_dyna_leave);
7906 __clear_cache((void *)beginning,out);
7908 ll_add(jump_in+page,start,(void *)beginning);
7911 else if ((u_int)addr < 0x00200000 ||
7912 (0xa0000000 <= addr && addr < 0xa0200000)) {
7913 // used for BIOS calls mostly?
7914 source = (u_int *)((u_int)rdram+(start&0x1fffff));
7915 pagelimit = (addr&0xa0000000)|0x00200000;
7917 else if (!Config.HLE && (
7918 /* (0x9fc00000 <= addr && addr < 0x9fc80000) ||*/
7919 (0xbfc00000 <= addr && addr < 0xbfc80000))) {
7921 source = (u_int *)((u_int)psxR+(start&0x7ffff));
7922 pagelimit = (addr&0xfff00000)|0x80000;
7927 if ((int)addr >= 0xa4000000 && (int)addr < 0xa4001000) {
7928 source = (u_int *)((u_int)SP_DMEM+start-0xa4000000);
7929 pagelimit = 0xa4001000;
7933 if ((int)addr >= 0x80000000 && (int)addr < 0x80000000+RAM_SIZE) {
7934 source = (u_int *)((u_int)rdram+start-0x80000000);
7935 pagelimit = 0x80000000+RAM_SIZE;
7938 else if ((signed int)addr >= (signed int)0xC0000000) {
7939 //printf("addr=%x mm=%x\n",(u_int)addr,(memory_map[start>>12]<<2));
7940 //if(tlb_LUT_r[start>>12])
7941 //source = (u_int *)(((int)rdram)+(tlb_LUT_r[start>>12]&0xFFFFF000)+(((int)addr)&0xFFF)-0x80000000);
7942 if((signed int)memory_map[start>>12]>=0) {
7943 source = (u_int *)((u_int)(start+(memory_map[start>>12]<<2)));
7944 pagelimit=(start+4096)&0xFFFFF000;
7945 int map=memory_map[start>>12];
7948 //printf("start: %x next: %x\n",map,memory_map[pagelimit>>12]);
7949 if((map&0xBFFFFFFF)==(memory_map[pagelimit>>12]&0xBFFFFFFF)) pagelimit+=4096;
7951 assem_debug("pagelimit=%x\n",pagelimit);
7952 assem_debug("mapping=%x (%x)\n",memory_map[start>>12],(memory_map[start>>12]<<2)+start);
7955 assem_debug("Compile at unmapped memory address: %x \n", (int)addr);
7956 //assem_debug("start: %x next: %x\n",memory_map[start>>12],memory_map[(start+4096)>>12]);
7957 return -1; // Caller will invoke exception handler
7959 //printf("source= %x\n",(int)source);
7963 printf("Compile at bogus memory address: %x \n", (int)addr);
7967 /* Pass 1: disassemble */
7968 /* Pass 2: register dependencies, branch targets */
7969 /* Pass 3: register allocation */
7970 /* Pass 4: branch dependencies */
7971 /* Pass 5: pre-alloc */
7972 /* Pass 6: optimize clean/dirty state */
7973 /* Pass 7: flag 32-bit registers */
7974 /* Pass 8: assembly */
7975 /* Pass 9: linker */
7976 /* Pass 10: garbage collection / free memory */
7980 unsigned int type,op,op2;
7982 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
7984 /* Pass 1 disassembly */
7986 for(i=0;!done;i++) {
7987 bt[i]=0;likely[i]=0;ooo[i]=0;op2=0;
7988 minimum_free_regs[i]=0;
7989 opcode[i]=op=source[i]>>26;
7992 case 0x00: strcpy(insn[i],"special"); type=NI;
7996 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
7997 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
7998 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
7999 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
8000 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
8001 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
8002 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
8003 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
8004 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
8005 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
8006 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
8007 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
8008 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
8009 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
8010 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
8011 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
8012 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
8013 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
8014 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
8015 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
8016 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
8017 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
8018 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
8019 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
8020 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
8021 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
8022 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
8023 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
8024 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
8025 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
8026 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
8027 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
8028 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
8029 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
8030 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
8032 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
8033 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
8034 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
8035 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
8036 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
8037 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
8038 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
8039 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
8040 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
8041 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
8042 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
8043 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
8044 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
8045 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
8046 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
8047 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
8048 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
8052 case 0x01: strcpy(insn[i],"regimm"); type=NI;
8053 op2=(source[i]>>16)&0x1f;
8056 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
8057 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
8058 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
8059 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
8060 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
8061 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
8062 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
8063 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
8064 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
8065 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
8066 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
8067 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
8068 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
8069 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
8072 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
8073 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
8074 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
8075 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
8076 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
8077 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
8078 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
8079 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
8080 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
8081 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
8082 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
8083 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
8084 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
8085 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
8086 case 0x10: strcpy(insn[i],"cop0"); type=NI;
8087 op2=(source[i]>>21)&0x1f;
8090 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
8091 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
8092 case 0x10: strcpy(insn[i],"tlb"); type=NI;
8093 switch(source[i]&0x3f)
8095 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
8096 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
8097 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
8098 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
8100 case 0x10: strcpy(insn[i],"RFE"); type=COP0; break;
8102 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
8107 case 0x11: strcpy(insn[i],"cop1"); type=NI;
8108 op2=(source[i]>>21)&0x1f;
8111 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
8112 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
8113 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
8114 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
8115 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
8116 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
8117 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
8118 switch((source[i]>>16)&0x3)
8120 case 0x00: strcpy(insn[i],"BC1F"); break;
8121 case 0x01: strcpy(insn[i],"BC1T"); break;
8122 case 0x02: strcpy(insn[i],"BC1FL"); break;
8123 case 0x03: strcpy(insn[i],"BC1TL"); break;
8126 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
8127 switch(source[i]&0x3f)
8129 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
8130 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
8131 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
8132 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
8133 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
8134 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
8135 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
8136 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
8137 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
8138 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
8139 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
8140 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
8141 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
8142 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
8143 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
8144 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
8145 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
8146 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
8147 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
8148 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
8149 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
8150 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
8151 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
8152 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
8153 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
8154 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
8155 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
8156 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
8157 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
8158 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
8159 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
8160 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
8161 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
8162 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
8163 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
8166 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8167 switch(source[i]&0x3f)
8169 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8170 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8171 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8172 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8173 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8174 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8175 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8176 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8177 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8178 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8179 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8180 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8181 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8182 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8183 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8184 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8185 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8186 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8187 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8188 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8189 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8190 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8191 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8192 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8193 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8194 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8195 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8196 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8197 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8198 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8199 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8200 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8201 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8202 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8203 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8206 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8207 switch(source[i]&0x3f)
8209 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8210 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8213 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8214 switch(source[i]&0x3f)
8216 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8217 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8223 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8224 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8225 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8226 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8227 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8228 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8229 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8230 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8232 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8233 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8234 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8235 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8236 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8237 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8238 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8239 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8240 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8241 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8242 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8243 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8245 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8246 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8248 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8249 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8250 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8251 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8253 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8254 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8255 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8257 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8258 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8260 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8261 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8262 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8265 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8266 // note: COP MIPS-1 encoding differs from MIPS32
8267 op2=(source[i]>>21)&0x1f;
8268 if (source[i]&0x3f) {
8269 if (gte_handlers[source[i]&0x3f]!=NULL) {
8270 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8276 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8277 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8278 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8279 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8282 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8283 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8284 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8286 default: strcpy(insn[i],"???"); type=NI;
8287 printf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8292 /* Get registers/immediates */
8300 rs1[i]=(source[i]>>21)&0x1f;
8302 rt1[i]=(source[i]>>16)&0x1f;
8304 imm[i]=(short)source[i];
8308 rs1[i]=(source[i]>>21)&0x1f;
8309 rs2[i]=(source[i]>>16)&0x1f;
8312 imm[i]=(short)source[i];
8313 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8316 // LWL/LWR only load part of the register,
8317 // therefore the target register must be treated as a source too
8318 rs1[i]=(source[i]>>21)&0x1f;
8319 rs2[i]=(source[i]>>16)&0x1f;
8320 rt1[i]=(source[i]>>16)&0x1f;
8322 imm[i]=(short)source[i];
8323 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8324 if(op==0x26) dep1[i]=rt1[i]; // LWR
8327 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8328 else rs1[i]=(source[i]>>21)&0x1f;
8330 rt1[i]=(source[i]>>16)&0x1f;
8332 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8333 imm[i]=(unsigned short)source[i];
8335 imm[i]=(short)source[i];
8337 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8338 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8339 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8346 // The JAL instruction writes to r31.
8353 rs1[i]=(source[i]>>21)&0x1f;
8357 // The JALR instruction writes to rd.
8359 rt1[i]=(source[i]>>11)&0x1f;
8364 rs1[i]=(source[i]>>21)&0x1f;
8365 rs2[i]=(source[i]>>16)&0x1f;
8368 if(op&2) { // BGTZ/BLEZ
8376 rs1[i]=(source[i]>>21)&0x1f;
8381 if(op2&0x10) { // BxxAL
8383 // NOTE: If the branch is not taken, r31 is still overwritten
8385 likely[i]=(op2&2)>>1;
8392 likely[i]=((source[i])>>17)&1;
8395 rs1[i]=(source[i]>>21)&0x1f; // source
8396 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8397 rt1[i]=(source[i]>>11)&0x1f; // destination
8399 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8400 us1[i]=rs1[i];us2[i]=rs2[i];
8402 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8403 dep1[i]=rs1[i];dep2[i]=rs2[i];
8405 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8406 dep1[i]=rs1[i];dep2[i]=rs2[i];
8410 rs1[i]=(source[i]>>21)&0x1f; // source
8411 rs2[i]=(source[i]>>16)&0x1f; // divisor
8414 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8415 us1[i]=rs1[i];us2[i]=rs2[i];
8423 if(op2==0x10) rs1[i]=HIREG; // MFHI
8424 if(op2==0x11) rt1[i]=HIREG; // MTHI
8425 if(op2==0x12) rs1[i]=LOREG; // MFLO
8426 if(op2==0x13) rt1[i]=LOREG; // MTLO
8427 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8428 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8432 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8433 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8434 rt1[i]=(source[i]>>11)&0x1f; // destination
8436 // DSLLV/DSRLV/DSRAV are 64-bit
8437 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8440 rs1[i]=(source[i]>>16)&0x1f;
8442 rt1[i]=(source[i]>>11)&0x1f;
8444 imm[i]=(source[i]>>6)&0x1f;
8445 // DSxx32 instructions
8446 if(op2>=0x3c) imm[i]|=0x20;
8447 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8448 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8455 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8456 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8457 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8458 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8466 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8467 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8468 if(op2==5) us1[i]=rs1[i]; // DMTC1
8472 rs1[i]=(source[i]>>21)&0x1F;
8476 imm[i]=(short)source[i];
8479 rs1[i]=(source[i]>>21)&0x1F;
8483 imm[i]=(short)source[i];
8512 /* Calculate branch target addresses */
8514 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8515 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8516 ba[i]=start+i*4+8; // Ignore never taken branch
8517 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8518 ba[i]=start+i*4+8; // Ignore never taken branch
8519 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8520 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8523 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
8525 // branch in delay slot?
8526 if(type==RJUMP||type==UJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
8527 // don't handle first branch and call interpreter if it's hit
8528 printf("branch in delay slot @%08x (%08x)\n", addr + i*4, addr);
8531 // basic load delay detection
8532 else if((type==LOAD||type==LOADLR||type==COP0||type==COP2||type==C2LS)&&rt1[i]!=0) {
8533 int t=(ba[i-1]-start)/4;
8534 if(0 <= t && t < i &&(rt1[i]==rs1[t]||rt1[i]==rs2[t])&&itype[t]!=CJUMP&&itype[t]!=SJUMP) {
8535 // jump target wants DS result - potential load delay effect
8536 printf("load delay @%08x (%08x)\n", addr + i*4, addr);
8538 bt[t+1]=1; // expected return from interpreter
8540 else if(i>=2&&rt1[i-2]==2&&rt1[i]==2&&rs1[i]!=2&&rs2[i]!=2&&rs1[i-1]!=2&&rs2[i-1]!=2&&
8541 !(i>=3&&(itype[i-3]==RJUMP||itype[i-3]==UJUMP||itype[i-3]==CJUMP||itype[i-3]==SJUMP))) {
8542 // v0 overwrite like this is a sign of trouble, bail out
8543 printf("v0 overwrite @%08x (%08x)\n", addr + i*4, addr);
8549 rs2[i-1]=rt1[i-1]=rt2[i-1]=0;
8553 i--; // don't compile the DS
8557 /* Is this the end of the block? */
8558 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8559 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8563 if(stop_after_jal) done=1;
8565 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8567 // Don't recompile stuff that's already compiled
8568 if(check_addr(start+i*4+4)) done=1;
8569 // Don't get too close to the limit
8570 if(i>MAXBLOCK/2) done=1;
8572 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8573 if(itype[i]==HLECALL||itype[i]==INTCALL) done=2;
8575 // Does the block continue due to a branch?
8578 if(ba[j]==start+i*4+4) done=j=0;
8579 if(ba[j]==start+i*4+8) done=j=0;
8582 //assert(i<MAXBLOCK-1);
8583 if(start+i*4==pagelimit-4) done=1;
8584 assert(start+i*4<pagelimit);
8585 if (i==MAXBLOCK-1) done=1;
8586 // Stop if we're compiling junk
8587 if(itype[i]==NI&&opcode[i]==0x11) {
8588 done=stop_after_jal=1;
8589 printf("Disabled speculative precompilation\n");
8593 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8594 if(start+i*4==pagelimit) {
8600 /* Pass 2 - Register dependencies and branch targets */
8602 unneeded_registers(0,slen-1,0);
8604 /* Pass 3 - Register allocation */
8606 struct regstat current; // Current register allocations/status
8609 current.u=unneeded_reg[0];
8610 current.uu=unneeded_reg_upper[0];
8611 clear_all_regs(current.regmap);
8612 alloc_reg(¤t,0,CCREG);
8613 dirty_reg(¤t,CCREG);
8621 provisional_32bit();
8624 // First instruction is delay slot
8629 unneeded_reg_upper[0]=1;
8630 current.regmap[HOST_BTREG]=BTREG;
8638 for(hr=0;hr<HOST_REGS;hr++)
8640 // Is this really necessary?
8641 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8647 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8649 if(rs1[i-2]==0||rs2[i-2]==0)
8652 current.is32|=1LL<<rs1[i-2];
8653 int hr=get_reg(current.regmap,rs1[i-2]|64);
8654 if(hr>=0) current.regmap[hr]=-1;
8657 current.is32|=1LL<<rs2[i-2];
8658 int hr=get_reg(current.regmap,rs2[i-2]|64);
8659 if(hr>=0) current.regmap[hr]=-1;
8665 // If something jumps here with 64-bit values
8666 // then promote those registers to 64 bits
8669 uint64_t temp_is32=current.is32;
8672 if(ba[j]==start+i*4)
8673 temp_is32&=branch_regs[j].is32;
8677 if(ba[j]==start+i*4)
8681 if(temp_is32!=current.is32) {
8682 //printf("dumping 32-bit regs (%x)\n",start+i*4);
8683 #ifdef DESTRUCTIVE_WRITEBACK
8684 for(hr=0;hr<HOST_REGS;hr++)
8686 int r=current.regmap[hr];
8689 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
8691 //printf("restore %d\n",r);
8696 current.is32=temp_is32;
8703 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
8704 regs[i].wasconst=current.isconst;
8705 regs[i].was32=current.is32;
8706 regs[i].wasdirty=current.dirty;
8707 #if defined(DESTRUCTIVE_WRITEBACK) && !defined(FORCE32)
8708 // To change a dirty register from 32 to 64 bits, we must write
8709 // it out during the previous cycle (for branches, 2 cycles)
8710 if(i<slen-1&&bt[i+1]&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP)
8712 uint64_t temp_is32=current.is32;
8715 if(ba[j]==start+i*4+4)
8716 temp_is32&=branch_regs[j].is32;
8720 if(ba[j]==start+i*4+4)
8724 if(temp_is32!=current.is32) {
8725 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8726 for(hr=0;hr<HOST_REGS;hr++)
8728 int r=current.regmap[hr];
8731 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8732 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
8734 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
8736 //printf("dump %d/r%d\n",hr,r);
8737 current.regmap[hr]=-1;
8738 if(get_reg(current.regmap,r|64)>=0)
8739 current.regmap[get_reg(current.regmap,r|64)]=-1;
8747 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
8749 uint64_t temp_is32=current.is32;
8752 if(ba[j]==start+i*4+8)
8753 temp_is32&=branch_regs[j].is32;
8757 if(ba[j]==start+i*4+8)
8761 if(temp_is32!=current.is32) {
8762 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8763 for(hr=0;hr<HOST_REGS;hr++)
8765 int r=current.regmap[hr];
8768 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8769 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
8771 //printf("dump %d/r%d\n",hr,r);
8772 current.regmap[hr]=-1;
8773 if(get_reg(current.regmap,r|64)>=0)
8774 current.regmap[get_reg(current.regmap,r|64)]=-1;
8782 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8784 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
8785 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
8786 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8795 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
8796 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8797 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8798 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8799 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8802 } else { printf("oops, branch at end of block with no delay slot\n");exit(1); }
8806 ds=0; // Skip delay slot, already allocated as part of branch
8807 // ...but we need to alloc it in case something jumps here
8809 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
8810 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
8812 current.u=branch_unneeded_reg[i-1];
8813 current.uu=branch_unneeded_reg_upper[i-1];
8815 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8816 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8817 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8820 struct regstat temp;
8821 memcpy(&temp,¤t,sizeof(current));
8822 temp.wasdirty=temp.dirty;
8823 temp.was32=temp.is32;
8824 // TODO: Take into account unconditional branches, as below
8825 delayslot_alloc(&temp,i);
8826 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
8827 regs[i].wasdirty=temp.wasdirty;
8828 regs[i].was32=temp.was32;
8829 regs[i].dirty=temp.dirty;
8830 regs[i].is32=temp.is32;
8834 // Create entry (branch target) regmap
8835 for(hr=0;hr<HOST_REGS;hr++)
8837 int r=temp.regmap[hr];
8839 if(r!=regmap_pre[i][hr]) {
8840 regs[i].regmap_entry[hr]=-1;
8845 if((current.u>>r)&1) {
8846 regs[i].regmap_entry[hr]=-1;
8847 regs[i].regmap[hr]=-1;
8848 //Don't clear regs in the delay slot as the branch might need them
8849 //current.regmap[hr]=-1;
8851 regs[i].regmap_entry[hr]=r;
8854 if((current.uu>>(r&63))&1) {
8855 regs[i].regmap_entry[hr]=-1;
8856 regs[i].regmap[hr]=-1;
8857 //Don't clear regs in the delay slot as the branch might need them
8858 //current.regmap[hr]=-1;
8860 regs[i].regmap_entry[hr]=r;
8864 // First instruction expects CCREG to be allocated
8865 if(i==0&&hr==HOST_CCREG)
8866 regs[i].regmap_entry[hr]=CCREG;
8868 regs[i].regmap_entry[hr]=-1;
8872 else { // Not delay slot
8875 //current.isconst=0; // DEBUG
8876 //current.wasconst=0; // DEBUG
8877 //regs[i].wasconst=0; // DEBUG
8878 clear_const(¤t,rt1[i]);
8879 alloc_cc(¤t,i);
8880 dirty_reg(¤t,CCREG);
8882 delayslot_alloc(¤t,i+1);
8884 alloc_reg(¤t,i,31);
8885 dirty_reg(¤t,31);
8886 //assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8887 //assert(rt1[i+1]!=rt1[i]);
8889 alloc_reg(¤t,i,PTEMP);
8891 //current.is32|=1LL<<rt1[i];
8893 //current.isconst=0; // DEBUG
8895 //printf("i=%d, isconst=%x\n",i,current.isconst);
8898 //current.isconst=0;
8899 //current.wasconst=0;
8900 //regs[i].wasconst=0;
8901 clear_const(¤t,rs1[i]);
8902 clear_const(¤t,rt1[i]);
8903 alloc_cc(¤t,i);
8904 dirty_reg(¤t,CCREG);
8905 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
8906 alloc_reg(¤t,i,rs1[i]);
8908 alloc_reg(¤t,i,rt1[i]);
8909 dirty_reg(¤t,rt1[i]);
8910 assert(rs1[i+1]!=rt1[i]&&rs2[i+1]!=rt1[i]);
8911 assert(rt1[i+1]!=rt1[i]);
8913 alloc_reg(¤t,i,PTEMP);
8917 if(rs1[i]==31) { // JALR
8918 alloc_reg(¤t,i,RHASH);
8919 #ifndef HOST_IMM_ADDR32
8920 alloc_reg(¤t,i,RHTBL);
8924 delayslot_alloc(¤t,i+1);
8926 // The delay slot overwrites our source register,
8927 // allocate a temporary register to hold the old value.
8931 delayslot_alloc(¤t,i+1);
8933 alloc_reg(¤t,i,RTEMP);
8935 //current.isconst=0; // DEBUG
8940 //current.isconst=0;
8941 //current.wasconst=0;
8942 //regs[i].wasconst=0;
8943 clear_const(¤t,rs1[i]);
8944 clear_const(¤t,rs2[i]);
8945 if((opcode[i]&0x3E)==4) // BEQ/BNE
8947 alloc_cc(¤t,i);
8948 dirty_reg(¤t,CCREG);
8949 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8950 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8951 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8953 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8954 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8956 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
8957 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
8958 // The delay slot overwrites one of our conditions.
8959 // Allocate the branch condition registers instead.
8963 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8964 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8965 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8967 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8968 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8974 delayslot_alloc(¤t,i+1);
8978 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
8980 alloc_cc(¤t,i);
8981 dirty_reg(¤t,CCREG);
8982 alloc_reg(¤t,i,rs1[i]);
8983 if(!(current.is32>>rs1[i]&1))
8985 alloc_reg64(¤t,i,rs1[i]);
8987 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
8988 // The delay slot overwrites one of our conditions.
8989 // Allocate the branch condition registers instead.
8993 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8994 if(!((current.is32>>rs1[i])&1))
8996 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9002 delayslot_alloc(¤t,i+1);
9006 // Don't alloc the delay slot yet because we might not execute it
9007 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
9012 alloc_cc(¤t,i);
9013 dirty_reg(¤t,CCREG);
9014 alloc_reg(¤t,i,rs1[i]);
9015 alloc_reg(¤t,i,rs2[i]);
9016 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
9018 alloc_reg64(¤t,i,rs1[i]);
9019 alloc_reg64(¤t,i,rs2[i]);
9023 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
9028 alloc_cc(¤t,i);
9029 dirty_reg(¤t,CCREG);
9030 alloc_reg(¤t,i,rs1[i]);
9031 if(!(current.is32>>rs1[i]&1))
9033 alloc_reg64(¤t,i,rs1[i]);
9037 //current.isconst=0;
9040 //current.isconst=0;
9041 //current.wasconst=0;
9042 //regs[i].wasconst=0;
9043 clear_const(¤t,rs1[i]);
9044 clear_const(¤t,rt1[i]);
9045 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
9046 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
9048 alloc_cc(¤t,i);
9049 dirty_reg(¤t,CCREG);
9050 alloc_reg(¤t,i,rs1[i]);
9051 if(!(current.is32>>rs1[i]&1))
9053 alloc_reg64(¤t,i,rs1[i]);
9055 if (rt1[i]==31) { // BLTZAL/BGEZAL
9056 alloc_reg(¤t,i,31);
9057 dirty_reg(¤t,31);
9058 //#ifdef REG_PREFETCH
9059 //alloc_reg(¤t,i,PTEMP);
9061 //current.is32|=1LL<<rt1[i];
9063 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) // The delay slot overwrites the branch condition.
9064 ||(rt1[i]==31&&(rs1[i+1]==31||rs2[i+1]==31||rt1[i+1]==31||rt2[i+1]==31))) { // DS touches $ra
9065 // Allocate the branch condition registers instead.
9069 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9070 if(!((current.is32>>rs1[i])&1))
9072 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9078 delayslot_alloc(¤t,i+1);
9082 // Don't alloc the delay slot yet because we might not execute it
9083 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
9088 alloc_cc(¤t,i);
9089 dirty_reg(¤t,CCREG);
9090 alloc_reg(¤t,i,rs1[i]);
9091 if(!(current.is32>>rs1[i]&1))
9093 alloc_reg64(¤t,i,rs1[i]);
9097 //current.isconst=0;
9103 if(likely[i]==0) // BC1F/BC1T
9105 // TODO: Theoretically we can run out of registers here on x86.
9106 // The delay slot can allocate up to six, and we need to check
9107 // CSREG before executing the delay slot. Possibly we can drop
9108 // the cycle count and then reload it after checking that the
9109 // FPU is in a usable state, or don't do out-of-order execution.
9110 alloc_cc(¤t,i);
9111 dirty_reg(¤t,CCREG);
9112 alloc_reg(¤t,i,FSREG);
9113 alloc_reg(¤t,i,CSREG);
9114 if(itype[i+1]==FCOMP) {
9115 // The delay slot overwrites the branch condition.
9116 // Allocate the branch condition registers instead.
9117 alloc_cc(¤t,i);
9118 dirty_reg(¤t,CCREG);
9119 alloc_reg(¤t,i,CSREG);
9120 alloc_reg(¤t,i,FSREG);
9124 delayslot_alloc(¤t,i+1);
9125 alloc_reg(¤t,i+1,CSREG);
9129 // Don't alloc the delay slot yet because we might not execute it
9130 if(likely[i]) // BC1FL/BC1TL
9132 alloc_cc(¤t,i);
9133 dirty_reg(¤t,CCREG);
9134 alloc_reg(¤t,i,CSREG);
9135 alloc_reg(¤t,i,FSREG);
9141 imm16_alloc(¤t,i);
9145 load_alloc(¤t,i);
9149 store_alloc(¤t,i);
9152 alu_alloc(¤t,i);
9155 shift_alloc(¤t,i);
9158 multdiv_alloc(¤t,i);
9161 shiftimm_alloc(¤t,i);
9164 mov_alloc(¤t,i);
9167 cop0_alloc(¤t,i);
9171 cop1_alloc(¤t,i);
9174 c1ls_alloc(¤t,i);
9177 c2ls_alloc(¤t,i);
9180 c2op_alloc(¤t,i);
9183 fconv_alloc(¤t,i);
9186 float_alloc(¤t,i);
9189 fcomp_alloc(¤t,i);
9194 syscall_alloc(¤t,i);
9197 pagespan_alloc(¤t,i);
9201 // Drop the upper half of registers that have become 32-bit
9202 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
9203 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9204 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9205 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9208 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
9209 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9210 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9211 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9215 // Create entry (branch target) regmap
9216 for(hr=0;hr<HOST_REGS;hr++)
9219 r=current.regmap[hr];
9221 if(r!=regmap_pre[i][hr]) {
9222 // TODO: delay slot (?)
9223 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9224 if(or<0||(r&63)>=TEMPREG){
9225 regs[i].regmap_entry[hr]=-1;
9229 // Just move it to a different register
9230 regs[i].regmap_entry[hr]=r;
9231 // If it was dirty before, it's still dirty
9232 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9239 regs[i].regmap_entry[hr]=0;
9243 if((current.u>>r)&1) {
9244 regs[i].regmap_entry[hr]=-1;
9245 //regs[i].regmap[hr]=-1;
9246 current.regmap[hr]=-1;
9248 regs[i].regmap_entry[hr]=r;
9251 if((current.uu>>(r&63))&1) {
9252 regs[i].regmap_entry[hr]=-1;
9253 //regs[i].regmap[hr]=-1;
9254 current.regmap[hr]=-1;
9256 regs[i].regmap_entry[hr]=r;
9260 // Branches expect CCREG to be allocated at the target
9261 if(regmap_pre[i][hr]==CCREG)
9262 regs[i].regmap_entry[hr]=CCREG;
9264 regs[i].regmap_entry[hr]=-1;
9267 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9269 /* Branch post-alloc */
9272 current.was32=current.is32;
9273 current.wasdirty=current.dirty;
9274 switch(itype[i-1]) {
9276 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9277 branch_regs[i-1].isconst=0;
9278 branch_regs[i-1].wasconst=0;
9279 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9280 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9281 alloc_cc(&branch_regs[i-1],i-1);
9282 dirty_reg(&branch_regs[i-1],CCREG);
9283 if(rt1[i-1]==31) { // JAL
9284 alloc_reg(&branch_regs[i-1],i-1,31);
9285 dirty_reg(&branch_regs[i-1],31);
9286 branch_regs[i-1].is32|=1LL<<31;
9288 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9289 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9292 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9293 branch_regs[i-1].isconst=0;
9294 branch_regs[i-1].wasconst=0;
9295 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9296 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9297 alloc_cc(&branch_regs[i-1],i-1);
9298 dirty_reg(&branch_regs[i-1],CCREG);
9299 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9300 if(rt1[i-1]!=0) { // JALR
9301 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9302 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9303 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9306 if(rs1[i-1]==31) { // JALR
9307 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9308 #ifndef HOST_IMM_ADDR32
9309 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9313 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9314 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9317 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9319 alloc_cc(¤t,i-1);
9320 dirty_reg(¤t,CCREG);
9321 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9322 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9323 // The delay slot overwrote one of our conditions
9324 // Delay slot goes after the test (in order)
9325 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9326 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9327 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9330 delayslot_alloc(¤t,i);
9335 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9336 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9337 // Alloc the branch condition registers
9338 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9339 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9340 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9342 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9343 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9346 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9347 branch_regs[i-1].isconst=0;
9348 branch_regs[i-1].wasconst=0;
9349 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9350 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9353 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9355 alloc_cc(¤t,i-1);
9356 dirty_reg(¤t,CCREG);
9357 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9358 // The delay slot overwrote the branch condition
9359 // Delay slot goes after the test (in order)
9360 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9361 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9362 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9365 delayslot_alloc(¤t,i);
9370 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9371 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9372 // Alloc the branch condition register
9373 alloc_reg(¤t,i-1,rs1[i-1]);
9374 if(!(current.is32>>rs1[i-1]&1))
9376 alloc_reg64(¤t,i-1,rs1[i-1]);
9379 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9380 branch_regs[i-1].isconst=0;
9381 branch_regs[i-1].wasconst=0;
9382 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9383 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9386 // Alloc the delay slot in case the branch is taken
9387 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9389 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9390 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9391 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9392 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9393 alloc_cc(&branch_regs[i-1],i);
9394 dirty_reg(&branch_regs[i-1],CCREG);
9395 delayslot_alloc(&branch_regs[i-1],i);
9396 branch_regs[i-1].isconst=0;
9397 alloc_reg(¤t,i,CCREG); // Not taken path
9398 dirty_reg(¤t,CCREG);
9399 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9402 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9404 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9405 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9406 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9407 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9408 alloc_cc(&branch_regs[i-1],i);
9409 dirty_reg(&branch_regs[i-1],CCREG);
9410 delayslot_alloc(&branch_regs[i-1],i);
9411 branch_regs[i-1].isconst=0;
9412 alloc_reg(¤t,i,CCREG); // Not taken path
9413 dirty_reg(¤t,CCREG);
9414 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9418 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9419 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9421 alloc_cc(¤t,i-1);
9422 dirty_reg(¤t,CCREG);
9423 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9424 // The delay slot overwrote the branch condition
9425 // Delay slot goes after the test (in order)
9426 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9427 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9428 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9431 delayslot_alloc(¤t,i);
9436 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9437 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9438 // Alloc the branch condition register
9439 alloc_reg(¤t,i-1,rs1[i-1]);
9440 if(!(current.is32>>rs1[i-1]&1))
9442 alloc_reg64(¤t,i-1,rs1[i-1]);
9445 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9446 branch_regs[i-1].isconst=0;
9447 branch_regs[i-1].wasconst=0;
9448 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9449 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9452 // Alloc the delay slot in case the branch is taken
9453 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9455 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9456 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9457 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9458 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9459 alloc_cc(&branch_regs[i-1],i);
9460 dirty_reg(&branch_regs[i-1],CCREG);
9461 delayslot_alloc(&branch_regs[i-1],i);
9462 branch_regs[i-1].isconst=0;
9463 alloc_reg(¤t,i,CCREG); // Not taken path
9464 dirty_reg(¤t,CCREG);
9465 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9467 // FIXME: BLTZAL/BGEZAL
9468 if(opcode2[i-1]&0x10) { // BxxZAL
9469 alloc_reg(&branch_regs[i-1],i-1,31);
9470 dirty_reg(&branch_regs[i-1],31);
9471 branch_regs[i-1].is32|=1LL<<31;
9475 if(likely[i-1]==0) // BC1F/BC1T
9477 alloc_cc(¤t,i-1);
9478 dirty_reg(¤t,CCREG);
9479 if(itype[i]==FCOMP) {
9480 // The delay slot overwrote the branch condition
9481 // Delay slot goes after the test (in order)
9482 delayslot_alloc(¤t,i);
9487 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9488 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9489 // Alloc the branch condition register
9490 alloc_reg(¤t,i-1,FSREG);
9492 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9493 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9497 // Alloc the delay slot in case the branch is taken
9498 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9499 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9500 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9501 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9502 alloc_cc(&branch_regs[i-1],i);
9503 dirty_reg(&branch_regs[i-1],CCREG);
9504 delayslot_alloc(&branch_regs[i-1],i);
9505 branch_regs[i-1].isconst=0;
9506 alloc_reg(¤t,i,CCREG); // Not taken path
9507 dirty_reg(¤t,CCREG);
9508 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9513 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9515 if(rt1[i-1]==31) // JAL/JALR
9517 // Subroutine call will return here, don't alloc any registers
9520 clear_all_regs(current.regmap);
9521 alloc_reg(¤t,i,CCREG);
9522 dirty_reg(¤t,CCREG);
9526 // Internal branch will jump here, match registers to caller
9527 current.is32=0x3FFFFFFFFLL;
9529 clear_all_regs(current.regmap);
9530 alloc_reg(¤t,i,CCREG);
9531 dirty_reg(¤t,CCREG);
9534 if(ba[j]==start+i*4+4) {
9535 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9536 current.is32=branch_regs[j].is32;
9537 current.dirty=branch_regs[j].dirty;
9542 if(ba[j]==start+i*4+4) {
9543 for(hr=0;hr<HOST_REGS;hr++) {
9544 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9545 current.regmap[hr]=-1;
9547 current.is32&=branch_regs[j].is32;
9548 current.dirty&=branch_regs[j].dirty;
9557 // Count cycles in between branches
9559 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP||itype[i]==SYSCALL||itype[i]==HLECALL))
9564 else if(/*itype[i]==LOAD||*/itype[i]==STORE||itype[i]==C1LS) // load causes weird timing issues
9566 cc+=2; // 2 cycle penalty (after CLOCK_DIVIDER)
9568 else if(itype[i]==C2LS)
9578 flush_dirty_uppers(¤t);
9580 regs[i].is32=current.is32;
9581 regs[i].dirty=current.dirty;
9582 regs[i].isconst=current.isconst;
9583 memcpy(constmap[i],current.constmap,sizeof(current.constmap));
9585 for(hr=0;hr<HOST_REGS;hr++) {
9586 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9587 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9588 regs[i].wasconst&=~(1<<hr);
9592 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9595 /* Pass 4 - Cull unused host registers */
9599 for (i=slen-1;i>=0;i--)
9602 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9604 if(ba[i]<start || ba[i]>=(start+slen*4))
9606 // Branch out of this block, don't need anything
9612 // Need whatever matches the target
9614 int t=(ba[i]-start)>>2;
9615 for(hr=0;hr<HOST_REGS;hr++)
9617 if(regs[i].regmap_entry[hr]>=0) {
9618 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9622 // Conditional branch may need registers for following instructions
9623 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9626 nr|=needed_reg[i+2];
9627 for(hr=0;hr<HOST_REGS;hr++)
9629 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9630 //if((regmap_entry[i+2][hr])>=0) if(!((nr>>hr)&1)) printf("%x-bogus(%d=%d)\n",start+i*4,hr,regmap_entry[i+2][hr]);
9634 // Don't need stuff which is overwritten
9635 //if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9636 //if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9637 // Merge in delay slot
9638 for(hr=0;hr<HOST_REGS;hr++)
9641 // These are overwritten unless the branch is "likely"
9642 // and the delay slot is nullified if not taken
9643 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9644 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9646 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9647 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9648 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9649 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9650 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9651 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9652 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9653 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9654 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
9655 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9656 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9658 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
9659 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9660 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9662 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
9663 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9664 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9668 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
9670 // SYSCALL instruction (software interrupt)
9673 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
9675 // ERET instruction (return from interrupt)
9681 for(hr=0;hr<HOST_REGS;hr++) {
9682 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
9683 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
9684 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9685 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9689 for(hr=0;hr<HOST_REGS;hr++)
9691 // Overwritten registers are not needed
9692 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9693 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9694 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9695 // Source registers are needed
9696 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9697 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9698 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
9699 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
9700 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9701 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9702 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9703 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9704 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
9705 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9706 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9708 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
9709 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9710 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9712 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
9713 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9714 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9716 // Don't store a register immediately after writing it,
9717 // may prevent dual-issue.
9718 // But do so if this is a branch target, otherwise we
9719 // might have to load the register before the branch.
9720 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
9721 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
9722 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
9723 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9724 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9726 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
9727 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
9728 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9729 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9733 // Cycle count is needed at branches. Assume it is needed at the target too.
9734 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
9735 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9736 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9741 // Deallocate unneeded registers
9742 for(hr=0;hr<HOST_REGS;hr++)
9745 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
9746 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9747 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9748 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
9750 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9753 regs[i].regmap[hr]=-1;
9754 regs[i].isconst&=~(1<<hr);
9756 regmap_pre[i+2][hr]=-1;
9757 regs[i+2].wasconst&=~(1<<hr);
9762 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9764 int d1=0,d2=0,map=0,temp=0;
9765 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
9771 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
9772 itype[i+1]==STORE || itype[i+1]==STORELR ||
9773 itype[i+1]==C1LS || itype[i+1]==C2LS)
9776 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
9777 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9780 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
9781 itype[i+1]==C1LS || itype[i+1]==C2LS)
9783 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9784 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9785 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
9786 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
9787 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9788 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
9789 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
9790 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
9791 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
9792 regs[i].regmap[hr]!=map )
9794 regs[i].regmap[hr]=-1;
9795 regs[i].isconst&=~(1<<hr);
9796 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
9797 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
9798 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
9799 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
9800 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
9801 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
9802 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
9803 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
9804 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
9805 branch_regs[i].regmap[hr]!=map)
9807 branch_regs[i].regmap[hr]=-1;
9808 branch_regs[i].regmap_entry[hr]=-1;
9809 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9811 if(!likely[i]&&i<slen-2) {
9812 regmap_pre[i+2][hr]=-1;
9813 regs[i+2].wasconst&=~(1<<hr);
9824 int d1=0,d2=0,map=-1,temp=-1;
9825 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
9831 if(itype[i]==LOAD || itype[i]==LOADLR ||
9832 itype[i]==STORE || itype[i]==STORELR ||
9833 itype[i]==C1LS || itype[i]==C2LS)
9835 } else if(itype[i]==STORE || itype[i]==STORELR ||
9836 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9839 if(itype[i]==LOADLR || itype[i]==STORELR ||
9840 itype[i]==C1LS || itype[i]==C2LS)
9842 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9843 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
9844 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9845 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
9846 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
9847 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
9849 if(i<slen-1&&!is_ds[i]) {
9850 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
9851 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
9852 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
9854 printf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
9855 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
9857 regmap_pre[i+1][hr]=-1;
9858 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
9859 regs[i+1].wasconst&=~(1<<hr);
9861 regs[i].regmap[hr]=-1;
9862 regs[i].isconst&=~(1<<hr);
9870 /* Pass 5 - Pre-allocate registers */
9872 // If a register is allocated during a loop, try to allocate it for the
9873 // entire loop, if possible. This avoids loading/storing registers
9874 // inside of the loop.
9876 signed char f_regmap[HOST_REGS];
9877 clear_all_regs(f_regmap);
9878 for(i=0;i<slen-1;i++)
9880 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9882 if(ba[i]>=start && ba[i]<(start+i*4))
9883 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
9884 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
9885 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9886 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9887 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9888 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9890 int t=(ba[i]-start)>>2;
9891 if(t>0&&(itype[t-1]!=UJUMP&&itype[t-1]!=RJUMP&&itype[t-1]!=CJUMP&&itype[t-1]!=SJUMP&&itype[t-1]!=FJUMP)) // loop_preload can't handle jumps into delay slots
9892 if(t<2||(itype[t-2]!=UJUMP)) // call/ret assumes no registers allocated
9893 for(hr=0;hr<HOST_REGS;hr++)
9895 if(regs[i].regmap[hr]>64) {
9896 if(!((regs[i].dirty>>hr)&1))
9897 f_regmap[hr]=regs[i].regmap[hr];
9898 else f_regmap[hr]=-1;
9900 else if(regs[i].regmap[hr]>=0) {
9901 if(f_regmap[hr]!=regs[i].regmap[hr]) {
9902 // dealloc old register
9904 for(n=0;n<HOST_REGS;n++)
9906 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
9908 // and alloc new one
9909 f_regmap[hr]=regs[i].regmap[hr];
9912 if(branch_regs[i].regmap[hr]>64) {
9913 if(!((branch_regs[i].dirty>>hr)&1))
9914 f_regmap[hr]=branch_regs[i].regmap[hr];
9915 else f_regmap[hr]=-1;
9917 else if(branch_regs[i].regmap[hr]>=0) {
9918 if(f_regmap[hr]!=branch_regs[i].regmap[hr]) {
9919 // dealloc old register
9921 for(n=0;n<HOST_REGS;n++)
9923 if(f_regmap[n]==branch_regs[i].regmap[hr]) {f_regmap[n]=-1;}
9925 // and alloc new one
9926 f_regmap[hr]=branch_regs[i].regmap[hr];
9930 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1])
9931 f_regmap[hr]=branch_regs[i].regmap[hr];
9933 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1])
9934 f_regmap[hr]=branch_regs[i].regmap[hr];
9936 // Avoid dirty->clean transition
9937 #ifdef DESTRUCTIVE_WRITEBACK
9938 if(t>0) if(get_reg(regmap_pre[t],f_regmap[hr])>=0) if((regs[t].wasdirty>>get_reg(regmap_pre[t],f_regmap[hr]))&1) f_regmap[hr]=-1;
9940 // This check is only strictly required in the DESTRUCTIVE_WRITEBACK
9941 // case above, however it's always a good idea. We can't hoist the
9942 // load if the register was already allocated, so there's no point
9943 // wasting time analyzing most of these cases. It only "succeeds"
9944 // when the mapping was different and the load can be replaced with
9945 // a mov, which is of negligible benefit. So such cases are
9947 if(f_regmap[hr]>0) {
9948 if(regs[t].regmap_entry[hr]<0&&get_reg(regmap_pre[t],f_regmap[hr])<0) {
9952 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9953 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
9954 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
9956 // NB This can exclude the case where the upper-half
9957 // register is lower numbered than the lower-half
9958 // register. Not sure if it's worth fixing...
9959 if(get_reg(regs[j].regmap,r&63)<0) break;
9960 if(get_reg(regs[j].regmap_entry,r&63)<0) break;
9961 if(regs[j].is32&(1LL<<(r&63))) break;
9963 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
9964 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9966 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
9967 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
9969 if(get_reg(regs[i].regmap,r&63)<0) break;
9970 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
9973 while(k>1&®s[k-1].regmap[hr]==-1) {
9974 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
9975 //printf("no free regs for store %x\n",start+(k-1)*4);
9978 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
9979 //printf("no-match due to different register\n");
9982 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
9983 //printf("no-match due to branch\n");
9986 // call/ret fast path assumes no registers allocated
9987 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)) {
9991 // NB This can exclude the case where the upper-half
9992 // register is lower numbered than the lower-half
9993 // register. Not sure if it's worth fixing...
9994 if(get_reg(regs[k-1].regmap,r&63)<0) break;
9995 if(regs[k-1].is32&(1LL<<(r&63))) break;
10000 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
10001 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
10002 //printf("bad match after branch\n");
10006 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
10007 //printf("Extend r%d, %x ->\n",hr,start+k*4);
10009 regs[k].regmap_entry[hr]=f_regmap[hr];
10010 regs[k].regmap[hr]=f_regmap[hr];
10011 regmap_pre[k+1][hr]=f_regmap[hr];
10012 regs[k].wasdirty&=~(1<<hr);
10013 regs[k].dirty&=~(1<<hr);
10014 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
10015 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
10016 regs[k].wasconst&=~(1<<hr);
10017 regs[k].isconst&=~(1<<hr);
10022 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
10025 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
10026 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
10027 //printf("OK fill %x (r%d)\n",start+i*4,hr);
10028 regs[i].regmap_entry[hr]=f_regmap[hr];
10029 regs[i].regmap[hr]=f_regmap[hr];
10030 regs[i].wasdirty&=~(1<<hr);
10031 regs[i].dirty&=~(1<<hr);
10032 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
10033 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
10034 regs[i].wasconst&=~(1<<hr);
10035 regs[i].isconst&=~(1<<hr);
10036 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
10037 branch_regs[i].wasdirty&=~(1<<hr);
10038 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
10039 branch_regs[i].regmap[hr]=f_regmap[hr];
10040 branch_regs[i].dirty&=~(1<<hr);
10041 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
10042 branch_regs[i].wasconst&=~(1<<hr);
10043 branch_regs[i].isconst&=~(1<<hr);
10044 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
10045 regmap_pre[i+2][hr]=f_regmap[hr];
10046 regs[i+2].wasdirty&=~(1<<hr);
10047 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
10048 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
10049 (regs[i+2].was32&(1LL<<f_regmap[hr])));
10054 // Alloc register clean at beginning of loop,
10055 // but may dirty it in pass 6
10056 regs[k].regmap_entry[hr]=f_regmap[hr];
10057 regs[k].regmap[hr]=f_regmap[hr];
10058 regs[k].dirty&=~(1<<hr);
10059 regs[k].wasconst&=~(1<<hr);
10060 regs[k].isconst&=~(1<<hr);
10061 if(itype[k]==UJUMP||itype[k]==RJUMP||itype[k]==CJUMP||itype[k]==SJUMP||itype[k]==FJUMP) {
10062 branch_regs[k].regmap_entry[hr]=f_regmap[hr];
10063 branch_regs[k].regmap[hr]=f_regmap[hr];
10064 branch_regs[k].dirty&=~(1<<hr);
10065 branch_regs[k].wasconst&=~(1<<hr);
10066 branch_regs[k].isconst&=~(1<<hr);
10067 if(itype[k]!=RJUMP&&itype[k]!=UJUMP&&(source[k]>>16)!=0x1000) {
10068 regmap_pre[k+2][hr]=f_regmap[hr];
10069 regs[k+2].wasdirty&=~(1<<hr);
10070 assert((branch_regs[k].is32&(1LL<<f_regmap[hr]))==
10071 (regs[k+2].was32&(1LL<<f_regmap[hr])));
10076 regmap_pre[k+1][hr]=f_regmap[hr];
10077 regs[k+1].wasdirty&=~(1<<hr);
10080 if(regs[j].regmap[hr]==f_regmap[hr])
10081 regs[j].regmap_entry[hr]=f_regmap[hr];
10085 if(regs[j].regmap[hr]>=0)
10087 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
10088 //printf("no-match due to different register\n");
10091 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
10092 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
10095 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10097 // Stop on unconditional branch
10100 if(itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP)
10103 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1])
10106 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1])
10109 if(get_reg(branch_regs[j].regmap,f_regmap[hr])>=0) {
10110 //printf("no-match due to different register (branch)\n");
10114 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10115 //printf("No free regs for store %x\n",start+j*4);
10118 if(f_regmap[hr]>=64) {
10119 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
10124 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
10136 for(hr=0;hr<HOST_REGS;hr++)
10138 if(hr!=EXCLUDE_REG) {
10139 if(regs[i].regmap[hr]>64) {
10140 if(!((regs[i].dirty>>hr)&1))
10141 f_regmap[hr]=regs[i].regmap[hr];
10143 else if(regs[i].regmap[hr]>=0) {
10144 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10145 // dealloc old register
10147 for(n=0;n<HOST_REGS;n++)
10149 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10151 // and alloc new one
10152 f_regmap[hr]=regs[i].regmap[hr];
10155 else if(regs[i].regmap[hr]<0) count++;
10158 // Try to restore cycle count at branch targets
10160 for(j=i;j<slen-1;j++) {
10161 if(regs[j].regmap[HOST_CCREG]!=-1) break;
10162 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10163 //printf("no free regs for store %x\n",start+j*4);
10167 if(regs[j].regmap[HOST_CCREG]==CCREG) {
10169 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
10171 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10172 regs[k].regmap[HOST_CCREG]=CCREG;
10173 regmap_pre[k+1][HOST_CCREG]=CCREG;
10174 regs[k+1].wasdirty|=1<<HOST_CCREG;
10175 regs[k].dirty|=1<<HOST_CCREG;
10176 regs[k].wasconst&=~(1<<HOST_CCREG);
10177 regs[k].isconst&=~(1<<HOST_CCREG);
10180 regs[j].regmap_entry[HOST_CCREG]=CCREG;
10182 // Work backwards from the branch target
10183 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
10185 //printf("Extend backwards\n");
10188 while(regs[k-1].regmap[HOST_CCREG]==-1) {
10189 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10190 //printf("no free regs for store %x\n",start+(k-1)*4);
10195 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
10196 //printf("Extend CC, %x ->\n",start+k*4);
10198 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10199 regs[k].regmap[HOST_CCREG]=CCREG;
10200 regmap_pre[k+1][HOST_CCREG]=CCREG;
10201 regs[k+1].wasdirty|=1<<HOST_CCREG;
10202 regs[k].dirty|=1<<HOST_CCREG;
10203 regs[k].wasconst&=~(1<<HOST_CCREG);
10204 regs[k].isconst&=~(1<<HOST_CCREG);
10209 //printf("Fail Extend CC, %x ->\n",start+k*4);
10213 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
10214 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
10215 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
10216 itype[i]!=FCONV&&itype[i]!=FCOMP)
10218 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
10223 // This allocates registers (if possible) one instruction prior
10224 // to use, which can avoid a load-use penalty on certain CPUs.
10225 for(i=0;i<slen-1;i++)
10227 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
10231 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
10232 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
10235 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
10237 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10239 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10240 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10241 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10242 regs[i].isconst&=~(1<<hr);
10243 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10244 constmap[i][hr]=constmap[i+1][hr];
10245 regs[i+1].wasdirty&=~(1<<hr);
10246 regs[i].dirty&=~(1<<hr);
10251 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
10253 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10255 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10256 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10257 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10258 regs[i].isconst&=~(1<<hr);
10259 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10260 constmap[i][hr]=constmap[i+1][hr];
10261 regs[i+1].wasdirty&=~(1<<hr);
10262 regs[i].dirty&=~(1<<hr);
10266 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10267 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10269 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10271 regs[i].regmap[hr]=rs1[i+1];
10272 regmap_pre[i+1][hr]=rs1[i+1];
10273 regs[i+1].regmap_entry[hr]=rs1[i+1];
10274 regs[i].isconst&=~(1<<hr);
10275 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10276 constmap[i][hr]=constmap[i+1][hr];
10277 regs[i+1].wasdirty&=~(1<<hr);
10278 regs[i].dirty&=~(1<<hr);
10282 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10283 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10285 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10287 regs[i].regmap[hr]=rs1[i+1];
10288 regmap_pre[i+1][hr]=rs1[i+1];
10289 regs[i+1].regmap_entry[hr]=rs1[i+1];
10290 regs[i].isconst&=~(1<<hr);
10291 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10292 constmap[i][hr]=constmap[i+1][hr];
10293 regs[i+1].wasdirty&=~(1<<hr);
10294 regs[i].dirty&=~(1<<hr);
10298 #ifndef HOST_IMM_ADDR32
10299 if(itype[i+1]==LOAD||itype[i+1]==LOADLR||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS||itype[i+1]==C2LS) {
10300 hr=get_reg(regs[i+1].regmap,TLREG);
10302 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10303 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10305 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10307 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10308 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10309 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10310 regs[i].isconst&=~(1<<hr);
10311 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10312 constmap[i][hr]=constmap[i+1][hr];
10313 regs[i+1].wasdirty&=~(1<<hr);
10314 regs[i].dirty&=~(1<<hr);
10316 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10318 // move it to another register
10319 regs[i+1].regmap[hr]=-1;
10320 regmap_pre[i+2][hr]=-1;
10321 regs[i+1].regmap[nr]=TLREG;
10322 regmap_pre[i+2][nr]=TLREG;
10323 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10324 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10325 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10326 regs[i].isconst&=~(1<<nr);
10327 regs[i+1].isconst&=~(1<<nr);
10328 regs[i].dirty&=~(1<<nr);
10329 regs[i+1].wasdirty&=~(1<<nr);
10330 regs[i+1].dirty&=~(1<<nr);
10331 regs[i+2].wasdirty&=~(1<<nr);
10337 if(itype[i+1]==STORE||itype[i+1]==STORELR
10338 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10339 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10340 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10341 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10342 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10344 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10346 regs[i].regmap[hr]=rs1[i+1];
10347 regmap_pre[i+1][hr]=rs1[i+1];
10348 regs[i+1].regmap_entry[hr]=rs1[i+1];
10349 regs[i].isconst&=~(1<<hr);
10350 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10351 constmap[i][hr]=constmap[i+1][hr];
10352 regs[i+1].wasdirty&=~(1<<hr);
10353 regs[i].dirty&=~(1<<hr);
10357 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10358 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10360 hr=get_reg(regs[i+1].regmap,FTEMP);
10362 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10364 regs[i].regmap[hr]=rs1[i+1];
10365 regmap_pre[i+1][hr]=rs1[i+1];
10366 regs[i+1].regmap_entry[hr]=rs1[i+1];
10367 regs[i].isconst&=~(1<<hr);
10368 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10369 constmap[i][hr]=constmap[i+1][hr];
10370 regs[i+1].wasdirty&=~(1<<hr);
10371 regs[i].dirty&=~(1<<hr);
10373 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10375 // move it to another register
10376 regs[i+1].regmap[hr]=-1;
10377 regmap_pre[i+2][hr]=-1;
10378 regs[i+1].regmap[nr]=FTEMP;
10379 regmap_pre[i+2][nr]=FTEMP;
10380 regs[i].regmap[nr]=rs1[i+1];
10381 regmap_pre[i+1][nr]=rs1[i+1];
10382 regs[i+1].regmap_entry[nr]=rs1[i+1];
10383 regs[i].isconst&=~(1<<nr);
10384 regs[i+1].isconst&=~(1<<nr);
10385 regs[i].dirty&=~(1<<nr);
10386 regs[i+1].wasdirty&=~(1<<nr);
10387 regs[i+1].dirty&=~(1<<nr);
10388 regs[i+2].wasdirty&=~(1<<nr);
10392 if(itype[i+1]==LOAD||itype[i+1]==LOADLR||itype[i+1]==STORE||itype[i+1]==STORELR/*||itype[i+1]==C1LS||||itype[i+1]==C2LS*/) {
10393 if(itype[i+1]==LOAD)
10394 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10395 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10396 hr=get_reg(regs[i+1].regmap,FTEMP);
10397 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10398 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10399 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10401 if(hr>=0&®s[i].regmap[hr]<0) {
10402 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10403 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10404 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10405 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10406 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10407 regs[i].isconst&=~(1<<hr);
10408 regs[i+1].wasdirty&=~(1<<hr);
10409 regs[i].dirty&=~(1<<hr);
10418 /* Pass 6 - Optimize clean/dirty state */
10419 clean_registers(0,slen-1,1);
10421 /* Pass 7 - Identify 32-bit registers */
10427 for (i=slen-1;i>=0;i--)
10430 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10432 if(ba[i]<start || ba[i]>=(start+slen*4))
10434 // Branch out of this block, don't need anything
10440 // Need whatever matches the target
10441 // (and doesn't get overwritten by the delay slot instruction)
10443 int t=(ba[i]-start)>>2;
10444 if(ba[i]>start+i*4) {
10446 if(!(requires_32bit[t]&~regs[i].was32))
10447 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10450 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10451 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10452 if(!(pr32[t]&~regs[i].was32))
10453 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10456 // Conditional branch may need registers for following instructions
10457 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10460 r32|=requires_32bit[i+2];
10461 r32&=regs[i].was32;
10462 // Mark this address as a branch target since it may be called
10463 // upon return from interrupt
10467 // Merge in delay slot
10469 // These are overwritten unless the branch is "likely"
10470 // and the delay slot is nullified if not taken
10471 r32&=~(1LL<<rt1[i+1]);
10472 r32&=~(1LL<<rt2[i+1]);
10474 // Assume these are needed (delay slot)
10477 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
10481 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
10483 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
10485 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
10487 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
10489 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
10492 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
10494 // SYSCALL instruction (software interrupt)
10497 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10499 // ERET instruction (return from interrupt)
10503 r32&=~(1LL<<rt1[i]);
10504 r32&=~(1LL<<rt2[i]);
10507 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
10511 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
10513 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
10515 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
10517 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
10519 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
10521 requires_32bit[i]=r32;
10523 // Dirty registers which are 32-bit, require 32-bit input
10524 // as they will be written as 32-bit values
10525 for(hr=0;hr<HOST_REGS;hr++)
10527 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
10528 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
10529 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
10530 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
10534 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
10537 for (i=slen-1;i>=0;i--)
10539 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10541 // Conditional branch
10542 if((source[i]>>16)!=0x1000&&i<slen-2) {
10543 // Mark this address as a branch target since it may be called
10544 // upon return from interrupt
10551 if(itype[slen-1]==SPAN) {
10552 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
10555 /* Debug/disassembly */
10556 if((void*)assem_debug==(void*)printf)
10557 for(i=0;i<slen;i++)
10561 for(r=1;r<=CCREG;r++) {
10562 if((unneeded_reg[i]>>r)&1) {
10563 if(r==HIREG) printf(" HI");
10564 else if(r==LOREG) printf(" LO");
10565 else printf(" r%d",r);
10570 for(r=1;r<=CCREG;r++) {
10571 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
10572 if(r==HIREG) printf(" HI");
10573 else if(r==LOREG) printf(" LO");
10574 else printf(" r%d",r);
10578 for(r=0;r<=CCREG;r++) {
10579 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10580 if((regs[i].was32>>r)&1) {
10581 if(r==CCREG) printf(" CC");
10582 else if(r==HIREG) printf(" HI");
10583 else if(r==LOREG) printf(" LO");
10584 else printf(" r%d",r);
10589 #if defined(__i386__) || defined(__x86_64__)
10590 printf("pre: eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",regmap_pre[i][0],regmap_pre[i][1],regmap_pre[i][2],regmap_pre[i][3],regmap_pre[i][5],regmap_pre[i][6],regmap_pre[i][7]);
10593 printf("pre: r0=%d r1=%d r2=%d r3=%d r4=%d r5=%d r6=%d r7=%d r8=%d r9=%d r10=%d r12=%d\n",regmap_pre[i][0],regmap_pre[i][1],regmap_pre[i][2],regmap_pre[i][3],regmap_pre[i][4],regmap_pre[i][5],regmap_pre[i][6],regmap_pre[i][7],regmap_pre[i][8],regmap_pre[i][9],regmap_pre[i][10],regmap_pre[i][12]);
10596 if(needed_reg[i]&1) printf("eax ");
10597 if((needed_reg[i]>>1)&1) printf("ecx ");
10598 if((needed_reg[i]>>2)&1) printf("edx ");
10599 if((needed_reg[i]>>3)&1) printf("ebx ");
10600 if((needed_reg[i]>>5)&1) printf("ebp ");
10601 if((needed_reg[i]>>6)&1) printf("esi ");
10602 if((needed_reg[i]>>7)&1) printf("edi ");
10604 for(r=0;r<=CCREG;r++) {
10605 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10606 if((requires_32bit[i]>>r)&1) {
10607 if(r==CCREG) printf(" CC");
10608 else if(r==HIREG) printf(" HI");
10609 else if(r==LOREG) printf(" LO");
10610 else printf(" r%d",r);
10615 for(r=0;r<=CCREG;r++) {
10616 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10617 if((pr32[i]>>r)&1) {
10618 if(r==CCREG) printf(" CC");
10619 else if(r==HIREG) printf(" HI");
10620 else if(r==LOREG) printf(" LO");
10621 else printf(" r%d",r);
10624 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
10626 #if defined(__i386__) || defined(__x86_64__)
10627 printf("entry: eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d\n",regs[i].regmap_entry[0],regs[i].regmap_entry[1],regs[i].regmap_entry[2],regs[i].regmap_entry[3],regs[i].regmap_entry[5],regs[i].regmap_entry[6],regs[i].regmap_entry[7]);
10629 if(regs[i].wasdirty&1) printf("eax ");
10630 if((regs[i].wasdirty>>1)&1) printf("ecx ");
10631 if((regs[i].wasdirty>>2)&1) printf("edx ");
10632 if((regs[i].wasdirty>>3)&1) printf("ebx ");
10633 if((regs[i].wasdirty>>5)&1) printf("ebp ");
10634 if((regs[i].wasdirty>>6)&1) printf("esi ");
10635 if((regs[i].wasdirty>>7)&1) printf("edi ");
10638 printf("entry: r0=%d r1=%d r2=%d r3=%d r4=%d r5=%d r6=%d r7=%d r8=%d r9=%d r10=%d r12=%d\n",regs[i].regmap_entry[0],regs[i].regmap_entry[1],regs[i].regmap_entry[2],regs[i].regmap_entry[3],regs[i].regmap_entry[4],regs[i].regmap_entry[5],regs[i].regmap_entry[6],regs[i].regmap_entry[7],regs[i].regmap_entry[8],regs[i].regmap_entry[9],regs[i].regmap_entry[10],regs[i].regmap_entry[12]);
10640 if(regs[i].wasdirty&1) printf("r0 ");
10641 if((regs[i].wasdirty>>1)&1) printf("r1 ");
10642 if((regs[i].wasdirty>>2)&1) printf("r2 ");
10643 if((regs[i].wasdirty>>3)&1) printf("r3 ");
10644 if((regs[i].wasdirty>>4)&1) printf("r4 ");
10645 if((regs[i].wasdirty>>5)&1) printf("r5 ");
10646 if((regs[i].wasdirty>>6)&1) printf("r6 ");
10647 if((regs[i].wasdirty>>7)&1) printf("r7 ");
10648 if((regs[i].wasdirty>>8)&1) printf("r8 ");
10649 if((regs[i].wasdirty>>9)&1) printf("r9 ");
10650 if((regs[i].wasdirty>>10)&1) printf("r10 ");
10651 if((regs[i].wasdirty>>12)&1) printf("r12 ");
10654 disassemble_inst(i);
10655 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
10656 #if defined(__i386__) || defined(__x86_64__)
10657 printf("eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d dirty: ",regs[i].regmap[0],regs[i].regmap[1],regs[i].regmap[2],regs[i].regmap[3],regs[i].regmap[5],regs[i].regmap[6],regs[i].regmap[7]);
10658 if(regs[i].dirty&1) printf("eax ");
10659 if((regs[i].dirty>>1)&1) printf("ecx ");
10660 if((regs[i].dirty>>2)&1) printf("edx ");
10661 if((regs[i].dirty>>3)&1) printf("ebx ");
10662 if((regs[i].dirty>>5)&1) printf("ebp ");
10663 if((regs[i].dirty>>6)&1) printf("esi ");
10664 if((regs[i].dirty>>7)&1) printf("edi ");
10667 printf("r0=%d r1=%d r2=%d r3=%d r4=%d r5=%d r6=%d r7=%d r8=%d r9=%d r10=%d r12=%d dirty: ",regs[i].regmap[0],regs[i].regmap[1],regs[i].regmap[2],regs[i].regmap[3],regs[i].regmap[4],regs[i].regmap[5],regs[i].regmap[6],regs[i].regmap[7],regs[i].regmap[8],regs[i].regmap[9],regs[i].regmap[10],regs[i].regmap[12]);
10668 if(regs[i].dirty&1) printf("r0 ");
10669 if((regs[i].dirty>>1)&1) printf("r1 ");
10670 if((regs[i].dirty>>2)&1) printf("r2 ");
10671 if((regs[i].dirty>>3)&1) printf("r3 ");
10672 if((regs[i].dirty>>4)&1) printf("r4 ");
10673 if((regs[i].dirty>>5)&1) printf("r5 ");
10674 if((regs[i].dirty>>6)&1) printf("r6 ");
10675 if((regs[i].dirty>>7)&1) printf("r7 ");
10676 if((regs[i].dirty>>8)&1) printf("r8 ");
10677 if((regs[i].dirty>>9)&1) printf("r9 ");
10678 if((regs[i].dirty>>10)&1) printf("r10 ");
10679 if((regs[i].dirty>>12)&1) printf("r12 ");
10682 if(regs[i].isconst) {
10683 printf("constants: ");
10684 #if defined(__i386__) || defined(__x86_64__)
10685 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
10686 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
10687 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
10688 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
10689 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
10690 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
10691 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
10694 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
10695 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
10696 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
10697 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
10698 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
10699 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
10700 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
10701 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
10702 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
10703 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
10704 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
10705 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
10711 for(r=0;r<=CCREG;r++) {
10712 if((regs[i].is32>>r)&1) {
10713 if(r==CCREG) printf(" CC");
10714 else if(r==HIREG) printf(" HI");
10715 else if(r==LOREG) printf(" LO");
10716 else printf(" r%d",r);
10722 for(r=0;r<=CCREG;r++) {
10723 if((p32[i]>>r)&1) {
10724 if(r==CCREG) printf(" CC");
10725 else if(r==HIREG) printf(" HI");
10726 else if(r==LOREG) printf(" LO");
10727 else printf(" r%d",r);
10730 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
10731 else printf("\n");*/
10732 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10733 #if defined(__i386__) || defined(__x86_64__)
10734 printf("branch(%d): eax=%d ecx=%d edx=%d ebx=%d ebp=%d esi=%d edi=%d dirty: ",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7]);
10735 if(branch_regs[i].dirty&1) printf("eax ");
10736 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
10737 if((branch_regs[i].dirty>>2)&1) printf("edx ");
10738 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
10739 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
10740 if((branch_regs[i].dirty>>6)&1) printf("esi ");
10741 if((branch_regs[i].dirty>>7)&1) printf("edi ");
10744 printf("branch(%d): r0=%d r1=%d r2=%d r3=%d r4=%d r5=%d r6=%d r7=%d r8=%d r9=%d r10=%d r12=%d dirty: ",i,branch_regs[i].regmap[0],branch_regs[i].regmap[1],branch_regs[i].regmap[2],branch_regs[i].regmap[3],branch_regs[i].regmap[4],branch_regs[i].regmap[5],branch_regs[i].regmap[6],branch_regs[i].regmap[7],branch_regs[i].regmap[8],branch_regs[i].regmap[9],branch_regs[i].regmap[10],branch_regs[i].regmap[12]);
10745 if(branch_regs[i].dirty&1) printf("r0 ");
10746 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
10747 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
10748 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
10749 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
10750 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
10751 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
10752 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
10753 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
10754 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
10755 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
10756 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
10760 for(r=0;r<=CCREG;r++) {
10761 if((branch_regs[i].is32>>r)&1) {
10762 if(r==CCREG) printf(" CC");
10763 else if(r==HIREG) printf(" HI");
10764 else if(r==LOREG) printf(" LO");
10765 else printf(" r%d",r);
10773 /* Pass 8 - Assembly */
10774 linkcount=0;stubcount=0;
10775 ds=0;is_delayslot=0;
10777 uint64_t is32_pre=0;
10779 u_int beginning=(u_int)out;
10780 if((u_int)addr&1) {
10784 u_int instr_addr0_override=0;
10787 if (start == 0x80030000) {
10788 // nasty hack for fastbios thing
10789 instr_addr0_override=(u_int)out;
10790 emit_movimm(start,0);
10791 emit_readword((int)&pcaddr,1);
10792 emit_writeword(0,(int)&pcaddr);
10794 emit_jne((int)new_dyna_leave);
10797 for(i=0;i<slen;i++)
10799 //if(ds) printf("ds: ");
10800 if((void*)assem_debug==(void*)printf) disassemble_inst(i);
10802 ds=0; // Skip delay slot
10803 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
10806 #ifndef DESTRUCTIVE_WRITEBACK
10807 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10809 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
10810 unneeded_reg[i],unneeded_reg_upper[i]);
10811 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
10812 unneeded_reg[i],unneeded_reg_upper[i]);
10814 is32_pre=regs[i].is32;
10815 dirty_pre=regs[i].dirty;
10818 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10820 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
10821 unneeded_reg[i],unneeded_reg_upper[i]);
10822 loop_preload(regmap_pre[i],regs[i].regmap_entry);
10824 // branch target entry point
10825 instr_addr[i]=(u_int)out;
10826 assem_debug("<->\n");
10828 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
10829 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
10830 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
10831 address_generation(i,®s[i],regs[i].regmap_entry);
10832 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
10833 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10835 // Load the delay slot registers if necessary
10836 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i]&&(rs1[i+1]!=rt1[i]||rt1[i]==0))
10837 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10838 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i]&&(rs2[i+1]!=rt1[i]||rt1[i]==0))
10839 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10840 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
10841 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10845 // Preload registers for following instruction
10846 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10847 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
10848 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10849 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10850 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
10851 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10853 // TODO: if(is_ooo(i)) address_generation(i+1);
10854 if(itype[i]==CJUMP||itype[i]==FJUMP)
10855 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
10856 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
10857 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10858 if(bt[i]) cop1_usable=0;
10862 alu_assemble(i,®s[i]);break;
10864 imm16_assemble(i,®s[i]);break;
10866 shift_assemble(i,®s[i]);break;
10868 shiftimm_assemble(i,®s[i]);break;
10870 load_assemble(i,®s[i]);break;
10872 loadlr_assemble(i,®s[i]);break;
10874 store_assemble(i,®s[i]);break;
10876 storelr_assemble(i,®s[i]);break;
10878 cop0_assemble(i,®s[i]);break;
10880 cop1_assemble(i,®s[i]);break;
10882 c1ls_assemble(i,®s[i]);break;
10884 cop2_assemble(i,®s[i]);break;
10886 c2ls_assemble(i,®s[i]);break;
10888 c2op_assemble(i,®s[i]);break;
10890 fconv_assemble(i,®s[i]);break;
10892 float_assemble(i,®s[i]);break;
10894 fcomp_assemble(i,®s[i]);break;
10896 multdiv_assemble(i,®s[i]);break;
10898 mov_assemble(i,®s[i]);break;
10900 syscall_assemble(i,®s[i]);break;
10902 hlecall_assemble(i,®s[i]);break;
10904 intcall_assemble(i,®s[i]);break;
10906 ujump_assemble(i,®s[i]);ds=1;break;
10908 rjump_assemble(i,®s[i]);ds=1;break;
10910 cjump_assemble(i,®s[i]);ds=1;break;
10912 sjump_assemble(i,®s[i]);ds=1;break;
10914 fjump_assemble(i,®s[i]);ds=1;break;
10916 pagespan_assemble(i,®s[i]);break;
10918 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10919 literal_pool(1024);
10921 literal_pool_jumpover(256);
10924 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
10925 // If the block did not end with an unconditional branch,
10926 // add a jump to the next instruction.
10928 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
10929 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10931 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
10932 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10933 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10934 emit_loadreg(CCREG,HOST_CCREG);
10935 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10937 else if(!likely[i-2])
10939 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
10940 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
10944 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
10945 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
10947 add_to_linker((int)out,start+i*4,0);
10954 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10955 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10956 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10957 emit_loadreg(CCREG,HOST_CCREG);
10958 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10959 add_to_linker((int)out,start+i*4,0);
10963 // TODO: delay slot stubs?
10965 for(i=0;i<stubcount;i++)
10967 switch(stubs[i][0])
10975 do_readstub(i);break;
10980 do_writestub(i);break;
10982 do_ccstub(i);break;
10984 do_invstub(i);break;
10986 do_cop1stub(i);break;
10988 do_unalignedwritestub(i);break;
10992 if (instr_addr0_override)
10993 instr_addr[0] = instr_addr0_override;
10995 /* Pass 9 - Linker */
10996 for(i=0;i<linkcount;i++)
10998 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
11000 if(!link_addr[i][2])
11003 void *addr=check_addr(link_addr[i][1]);
11004 emit_extjump(link_addr[i][0],link_addr[i][1]);
11006 set_jump_target(link_addr[i][0],(int)addr);
11007 add_link(link_addr[i][1],stub);
11009 else set_jump_target(link_addr[i][0],(int)stub);
11014 int target=(link_addr[i][1]-start)>>2;
11015 assert(target>=0&&target<slen);
11016 assert(instr_addr[target]);
11017 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11018 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
11020 set_jump_target(link_addr[i][0],instr_addr[target]);
11024 // External Branch Targets (jump_in)
11025 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
11026 for(i=0;i<slen;i++)
11030 if(instr_addr[i]) // TODO - delay slots (=null)
11032 u_int vaddr=start+i*4;
11033 u_int page=get_page(vaddr);
11034 u_int vpage=get_vpage(vaddr);
11036 //if(!(is32[i]&(~unneeded_reg_upper[i])&~(1LL<<CCREG)))
11038 if(!requires_32bit[i])
11043 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11044 assem_debug("jump_in: %x\n",start+i*4);
11045 ll_add(jump_dirty+vpage,vaddr,(void *)out);
11046 int entry_point=do_dirty_stub(i);
11047 ll_add(jump_in+page,vaddr,(void *)entry_point);
11048 // If there was an existing entry in the hash table,
11049 // replace it with the new address.
11050 // Don't add new entries. We'll insert the
11051 // ones that actually get used in check_addr().
11052 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
11053 if(ht_bin[0]==vaddr) {
11054 ht_bin[1]=entry_point;
11056 if(ht_bin[2]==vaddr) {
11057 ht_bin[3]=entry_point;
11062 u_int r=requires_32bit[i]|!!(requires_32bit[i]>>32);
11063 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11064 assem_debug("jump_in: %x (restricted - %x)\n",start+i*4,r);
11065 //int entry_point=(int)out;
11066 ////assem_debug("entry_point: %x\n",entry_point);
11067 //load_regs_entry(i);
11068 //if(entry_point==(int)out)
11069 // entry_point=instr_addr[i];
11071 // emit_jmp(instr_addr[i]);
11072 //ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
11073 ll_add_32(jump_dirty+vpage,vaddr,r,(void *)out);
11074 int entry_point=do_dirty_stub(i);
11075 ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
11080 // Write out the literal pool if necessary
11082 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11084 if(((u_int)out)&7) emit_addnop(13);
11086 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
11087 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
11088 memcpy(copy,source,slen*4);
11092 __clear_cache((void *)beginning,out);
11095 // If we're within 256K of the end of the buffer,
11096 // start over from the beginning. (Is 256K enough?)
11097 if((int)out>BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
11099 // Trap writes to any of the pages we compiled
11100 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
11102 #ifndef DISABLE_TLB
11103 memory_map[i]|=0x40000000;
11104 if((signed int)start>=(signed int)0xC0000000) {
11106 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
11108 memory_map[j]|=0x40000000;
11109 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
11114 // PCSX maps all RAM mirror invalid_code tests to 0x80000000..0x80000000+RAM_SIZE
11115 if(get_page(start)<(RAM_SIZE>>12))
11116 for(i=start>>12;i<=(start+slen*4)>>12;i++)
11117 invalid_code[((u_int)0x80000000>>12)|i]=0;
11120 /* Pass 10 - Free memory by expiring oldest blocks */
11122 int end=((((int)out-BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
11123 while(expirep!=end)
11125 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
11126 int base=BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
11127 inv_debug("EXP: Phase %d\n",expirep);
11128 switch((expirep>>11)&3)
11131 // Clear jump_in and jump_dirty
11132 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
11133 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
11134 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
11135 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
11139 ll_kill_pointers(jump_out[expirep&2047],base,shift);
11140 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
11143 // Clear hash table
11144 for(i=0;i<32;i++) {
11145 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
11146 if((ht_bin[3]>>shift)==(base>>shift) ||
11147 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11148 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
11149 ht_bin[2]=ht_bin[3]=-1;
11151 if((ht_bin[1]>>shift)==(base>>shift) ||
11152 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11153 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
11154 ht_bin[0]=ht_bin[2];
11155 ht_bin[1]=ht_bin[3];
11156 ht_bin[2]=ht_bin[3]=-1;
11163 if((expirep&2047)==0)
11166 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
11167 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
11170 expirep=(expirep+1)&65535;
11175 // vim:shiftwidth=2:expandtab