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)
603 for (hr=0;hr<HOST_REGS;hr++) {
604 if((cur->regmap[hr]&63)==reg) {
605 return (cur->isconst>>hr)&1;
610 uint64_t get_const(struct regstat *cur,signed char reg)
614 for (hr=0;hr<HOST_REGS;hr++) {
615 if(cur->regmap[hr]==reg) {
616 return cur->constmap[hr];
619 printf("Unknown constant in r%d\n",reg);
623 // Least soon needed registers
624 // Look at the next ten instructions and see which registers
625 // will be used. Try not to reallocate these.
626 void lsn(u_char hsn[], int i, int *preferred_reg)
636 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
638 // Don't go past an unconditonal jump
645 if(rs1[i+j]) hsn[rs1[i+j]]=j;
646 if(rs2[i+j]) hsn[rs2[i+j]]=j;
647 if(rt1[i+j]) hsn[rt1[i+j]]=j;
648 if(rt2[i+j]) hsn[rt2[i+j]]=j;
649 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
650 // Stores can allocate zero
654 // On some architectures stores need invc_ptr
655 #if defined(HOST_IMM8)
656 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
660 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
668 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
670 // Follow first branch
671 int t=(ba[i+b]-start)>>2;
672 j=7-b;if(t+j>=slen) j=slen-t-1;
675 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
676 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
677 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
678 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
681 // TODO: preferred register based on backward branch
683 // Delay slot should preferably not overwrite branch conditions or cycle count
684 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
685 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
686 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
692 // Coprocessor load/store needs FTEMP, even if not declared
693 if(itype[i]==C1LS||itype[i]==C2LS) {
696 // Load L/R also uses FTEMP as a temporary register
697 if(itype[i]==LOADLR) {
700 // Also SWL/SWR/SDL/SDR
701 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
704 // Don't remove the TLB registers either
705 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
708 // Don't remove the miniht registers
709 if(itype[i]==UJUMP||itype[i]==RJUMP)
716 // We only want to allocate registers if we're going to use them again soon
717 int needed_again(int r, int i)
723 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
725 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
726 return 0; // Don't need any registers if exiting the block
734 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
736 // Don't go past an unconditonal jump
740 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||itype[i+j]==INTCALL||((source[i+j]&0xfc00003f)==0x0d))
747 if(rs1[i+j]==r) rn=j;
748 if(rs2[i+j]==r) rn=j;
749 if((unneeded_reg[i+j]>>r)&1) rn=10;
750 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
758 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
760 // Follow first branch
762 int t=(ba[i+b]-start)>>2;
763 j=7-b;if(t+j>=slen) j=slen-t-1;
766 if(!((unneeded_reg[t+j]>>r)&1)) {
767 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
768 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
778 // Try to match register allocations at the end of a loop with those
780 int loop_reg(int i, int r, int hr)
789 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
791 // Don't go past an unconditonal jump
798 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
803 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
804 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
805 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
807 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
809 int t=(ba[i+k]-start)>>2;
810 int reg=get_reg(regs[t].regmap_entry,r);
811 if(reg>=0) return reg;
812 //reg=get_reg(regs[t+1].regmap_entry,r);
813 //if(reg>=0) return reg;
821 // Allocate every register, preserving source/target regs
822 void alloc_all(struct regstat *cur,int i)
826 for(hr=0;hr<HOST_REGS;hr++) {
827 if(hr!=EXCLUDE_REG) {
828 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
829 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
832 cur->dirty&=~(1<<hr);
835 if((cur->regmap[hr]&63)==0)
838 cur->dirty&=~(1<<hr);
845 void div64(int64_t dividend,int64_t divisor)
849 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
850 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
852 void divu64(uint64_t dividend,uint64_t divisor)
856 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
857 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
860 void mult64(uint64_t m1,uint64_t m2)
862 unsigned long long int op1, op2, op3, op4;
863 unsigned long long int result1, result2, result3, result4;
864 unsigned long long int temp1, temp2, temp3, temp4;
880 op1 = op2 & 0xFFFFFFFF;
881 op2 = (op2 >> 32) & 0xFFFFFFFF;
882 op3 = op4 & 0xFFFFFFFF;
883 op4 = (op4 >> 32) & 0xFFFFFFFF;
886 temp2 = (temp1 >> 32) + op1 * op4;
888 temp4 = (temp3 >> 32) + op2 * op4;
890 result1 = temp1 & 0xFFFFFFFF;
891 result2 = temp2 + (temp3 & 0xFFFFFFFF);
892 result3 = (result2 >> 32) + temp4;
893 result4 = (result3 >> 32);
895 lo = result1 | (result2 << 32);
896 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
905 void multu64(uint64_t m1,uint64_t m2)
907 unsigned long long int op1, op2, op3, op4;
908 unsigned long long int result1, result2, result3, result4;
909 unsigned long long int temp1, temp2, temp3, temp4;
911 op1 = m1 & 0xFFFFFFFF;
912 op2 = (m1 >> 32) & 0xFFFFFFFF;
913 op3 = m2 & 0xFFFFFFFF;
914 op4 = (m2 >> 32) & 0xFFFFFFFF;
917 temp2 = (temp1 >> 32) + op1 * op4;
919 temp4 = (temp3 >> 32) + op2 * op4;
921 result1 = temp1 & 0xFFFFFFFF;
922 result2 = temp2 + (temp3 & 0xFFFFFFFF);
923 result3 = (result2 >> 32) + temp4;
924 result4 = (result3 >> 32);
926 lo = result1 | (result2 << 32);
927 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
929 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
930 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
933 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
941 else original=loaded;
944 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
947 original>>=64-(bits^56);
948 original<<=64-(bits^56);
952 else original=loaded;
957 #include "assem_x86.c"
960 #include "assem_x64.c"
963 #include "assem_arm.c"
966 // Add virtual address mapping to linked list
967 void ll_add(struct ll_entry **head,int vaddr,void *addr)
969 struct ll_entry *new_entry;
970 new_entry=malloc(sizeof(struct ll_entry));
971 assert(new_entry!=NULL);
972 new_entry->vaddr=vaddr;
974 new_entry->addr=addr;
975 new_entry->next=*head;
979 // Add virtual address mapping for 32-bit compiled block
980 void ll_add_32(struct ll_entry **head,int vaddr,u_int reg32,void *addr)
982 ll_add(head,vaddr,addr);
984 (*head)->reg32=reg32;
988 // Check if an address is already compiled
989 // but don't return addresses which are about to expire from the cache
990 void *check_addr(u_int vaddr)
992 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
993 if(ht_bin[0]==vaddr) {
994 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
995 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
997 if(ht_bin[2]==vaddr) {
998 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
999 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
1001 u_int page=get_page(vaddr);
1002 struct ll_entry *head;
1005 if(head->vaddr==vaddr&&head->reg32==0) {
1006 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1007 // Update existing entry with current address
1008 if(ht_bin[0]==vaddr) {
1009 ht_bin[1]=(int)head->addr;
1012 if(ht_bin[2]==vaddr) {
1013 ht_bin[3]=(int)head->addr;
1016 // Insert into hash table with low priority.
1017 // Don't evict existing entries, as they are probably
1018 // addresses that are being accessed frequently.
1020 ht_bin[1]=(int)head->addr;
1022 }else if(ht_bin[2]==-1) {
1023 ht_bin[3]=(int)head->addr;
1034 void remove_hash(int vaddr)
1036 //printf("remove hash: %x\n",vaddr);
1037 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1038 if(ht_bin[2]==vaddr) {
1039 ht_bin[2]=ht_bin[3]=-1;
1041 if(ht_bin[0]==vaddr) {
1042 ht_bin[0]=ht_bin[2];
1043 ht_bin[1]=ht_bin[3];
1044 ht_bin[2]=ht_bin[3]=-1;
1048 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1050 struct ll_entry *next;
1052 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1053 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1055 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1056 remove_hash((*head)->vaddr);
1063 head=&((*head)->next);
1068 // Remove all entries from linked list
1069 void ll_clear(struct ll_entry **head)
1071 struct ll_entry *cur;
1072 struct ll_entry *next;
1083 // Dereference the pointers and remove if it matches
1084 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1087 int ptr=get_pointer(head->addr);
1088 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1089 if(((ptr>>shift)==(addr>>shift)) ||
1090 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1092 inv_debug("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1093 u_int host_addr=(u_int)kill_pointer(head->addr);
1095 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1102 // This is called when we write to a compiled block (see do_invstub)
1103 void invalidate_page(u_int page)
1105 struct ll_entry *head;
1106 struct ll_entry *next;
1110 inv_debug("INVALIDATE: %x\n",head->vaddr);
1111 remove_hash(head->vaddr);
1116 head=jump_out[page];
1119 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1120 u_int host_addr=(u_int)kill_pointer(head->addr);
1122 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1129 void invalidate_block(u_int block)
1131 u_int page=get_page(block<<12);
1132 u_int vpage=get_vpage(block<<12);
1133 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1134 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1137 struct ll_entry *head;
1138 head=jump_dirty[vpage];
1139 //printf("page=%d vpage=%d\n",page,vpage);
1142 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1143 get_bounds((int)head->addr,&start,&end);
1144 //printf("start: %x end: %x\n",start,end);
1145 if(page<2048&&start>=0x80000000&&end<0x80000000+RAM_SIZE) {
1146 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1147 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1148 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1152 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1153 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1154 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1155 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;
1162 //printf("first=%d last=%d\n",first,last);
1163 invalidate_page(page);
1164 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1165 assert(last<page+5);
1166 // Invalidate the adjacent pages if a block crosses a 4K boundary
1168 invalidate_page(first);
1171 for(first=page+1;first<last;first++) {
1172 invalidate_page(first);
1178 // Don't trap writes
1179 invalid_code[block]=1;
1181 invalid_code[((u_int)0x80000000>>12)|page]=1;
1184 // If there is a valid TLB entry for this page, remove write protect
1185 if(tlb_LUT_w[block]) {
1186 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1187 // CHECK: Is this right?
1188 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1189 u_int real_block=tlb_LUT_w[block]>>12;
1190 invalid_code[real_block]=1;
1191 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1193 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1197 memset(mini_ht,-1,sizeof(mini_ht));
1200 void invalidate_addr(u_int addr)
1202 invalidate_block(addr>>12);
1204 // This is called when loading a save state.
1205 // Anything could have changed, so invalidate everything.
1206 void invalidate_all_pages()
1209 for(page=0;page<4096;page++)
1210 invalidate_page(page);
1211 for(page=0;page<1048576;page++)
1212 if(!invalid_code[page]) {
1213 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1214 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1217 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1220 memset(mini_ht,-1,sizeof(mini_ht));
1224 for(page=0;page<0x100000;page++) {
1225 if(tlb_LUT_r[page]) {
1226 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1227 if(!tlb_LUT_w[page]||!invalid_code[page])
1228 memory_map[page]|=0x40000000; // Write protect
1230 else memory_map[page]=-1;
1231 if(page==0x80000) page=0xC0000;
1237 // Add an entry to jump_out after making a link
1238 void add_link(u_int vaddr,void *src)
1240 u_int page=get_page(vaddr);
1241 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1242 ll_add(jump_out+page,vaddr,src);
1243 //int ptr=get_pointer(src);
1244 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1247 // If a code block was found to be unmodified (bit was set in
1248 // restore_candidate) and it remains unmodified (bit is clear
1249 // in invalid_code) then move the entries for that 4K page from
1250 // the dirty list to the clean list.
1251 void clean_blocks(u_int page)
1253 struct ll_entry *head;
1254 inv_debug("INV: clean_blocks page=%d\n",page);
1255 head=jump_dirty[page];
1257 if(!invalid_code[head->vaddr>>12]) {
1258 // Don't restore blocks which are about to expire from the cache
1259 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1261 if(verify_dirty((int)head->addr)) {
1262 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1265 get_bounds((int)head->addr,&start,&end);
1266 if(start-(u_int)rdram<RAM_SIZE) {
1267 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1268 inv|=invalid_code[i];
1271 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1272 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1273 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1274 if(addr<start||addr>=end) inv=1;
1276 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1280 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1281 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1284 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1286 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1287 //printf("page=%x, addr=%x\n",page,head->vaddr);
1288 //assert(head->vaddr>>12==(page|0x80000));
1289 ll_add_32(jump_in+ppage,head->vaddr,head->reg32,clean_addr);
1290 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1292 if(ht_bin[0]==head->vaddr) {
1293 ht_bin[1]=(int)clean_addr; // Replace existing entry
1295 if(ht_bin[2]==head->vaddr) {
1296 ht_bin[3]=(int)clean_addr; // Replace existing entry
1309 void mov_alloc(struct regstat *current,int i)
1311 // Note: Don't need to actually alloc the source registers
1312 if((~current->is32>>rs1[i])&1) {
1313 //alloc_reg64(current,i,rs1[i]);
1314 alloc_reg64(current,i,rt1[i]);
1315 current->is32&=~(1LL<<rt1[i]);
1317 //alloc_reg(current,i,rs1[i]);
1318 alloc_reg(current,i,rt1[i]);
1319 current->is32|=(1LL<<rt1[i]);
1321 clear_const(current,rs1[i]);
1322 clear_const(current,rt1[i]);
1323 dirty_reg(current,rt1[i]);
1326 void shiftimm_alloc(struct regstat *current,int i)
1328 clear_const(current,rs1[i]);
1329 clear_const(current,rt1[i]);
1330 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1333 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1335 alloc_reg(current,i,rt1[i]);
1336 current->is32|=1LL<<rt1[i];
1337 dirty_reg(current,rt1[i]);
1340 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1343 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1344 alloc_reg64(current,i,rt1[i]);
1345 current->is32&=~(1LL<<rt1[i]);
1346 dirty_reg(current,rt1[i]);
1349 if(opcode2[i]==0x3c) // DSLL32
1352 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1353 alloc_reg64(current,i,rt1[i]);
1354 current->is32&=~(1LL<<rt1[i]);
1355 dirty_reg(current,rt1[i]);
1358 if(opcode2[i]==0x3e) // DSRL32
1361 alloc_reg64(current,i,rs1[i]);
1363 alloc_reg64(current,i,rt1[i]);
1364 current->is32&=~(1LL<<rt1[i]);
1366 alloc_reg(current,i,rt1[i]);
1367 current->is32|=1LL<<rt1[i];
1369 dirty_reg(current,rt1[i]);
1372 if(opcode2[i]==0x3f) // DSRA32
1375 alloc_reg64(current,i,rs1[i]);
1376 alloc_reg(current,i,rt1[i]);
1377 current->is32|=1LL<<rt1[i];
1378 dirty_reg(current,rt1[i]);
1383 void shift_alloc(struct regstat *current,int i)
1386 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1388 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1389 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1390 alloc_reg(current,i,rt1[i]);
1391 if(rt1[i]==rs2[i]) {
1392 alloc_reg_temp(current,i,-1);
1393 minimum_free_regs[i]=1;
1395 current->is32|=1LL<<rt1[i];
1396 } else { // DSLLV/DSRLV/DSRAV
1397 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1398 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1399 alloc_reg64(current,i,rt1[i]);
1400 current->is32&=~(1LL<<rt1[i]);
1401 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1403 alloc_reg_temp(current,i,-1);
1404 minimum_free_regs[i]=1;
1407 clear_const(current,rs1[i]);
1408 clear_const(current,rs2[i]);
1409 clear_const(current,rt1[i]);
1410 dirty_reg(current,rt1[i]);
1414 void alu_alloc(struct regstat *current,int i)
1416 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1418 if(rs1[i]&&rs2[i]) {
1419 alloc_reg(current,i,rs1[i]);
1420 alloc_reg(current,i,rs2[i]);
1423 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1424 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1426 alloc_reg(current,i,rt1[i]);
1428 current->is32|=1LL<<rt1[i];
1430 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1432 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1434 alloc_reg64(current,i,rs1[i]);
1435 alloc_reg64(current,i,rs2[i]);
1436 alloc_reg(current,i,rt1[i]);
1438 alloc_reg(current,i,rs1[i]);
1439 alloc_reg(current,i,rs2[i]);
1440 alloc_reg(current,i,rt1[i]);
1443 current->is32|=1LL<<rt1[i];
1445 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1447 if(rs1[i]&&rs2[i]) {
1448 alloc_reg(current,i,rs1[i]);
1449 alloc_reg(current,i,rs2[i]);
1453 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1454 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1456 alloc_reg(current,i,rt1[i]);
1457 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1459 if(!((current->uu>>rt1[i])&1)) {
1460 alloc_reg64(current,i,rt1[i]);
1462 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1463 if(rs1[i]&&rs2[i]) {
1464 alloc_reg64(current,i,rs1[i]);
1465 alloc_reg64(current,i,rs2[i]);
1469 // Is is really worth it to keep 64-bit values in registers?
1471 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1472 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1476 current->is32&=~(1LL<<rt1[i]);
1478 current->is32|=1LL<<rt1[i];
1482 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1484 if(rs1[i]&&rs2[i]) {
1485 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1486 alloc_reg64(current,i,rs1[i]);
1487 alloc_reg64(current,i,rs2[i]);
1488 alloc_reg64(current,i,rt1[i]);
1490 alloc_reg(current,i,rs1[i]);
1491 alloc_reg(current,i,rs2[i]);
1492 alloc_reg(current,i,rt1[i]);
1496 alloc_reg(current,i,rt1[i]);
1497 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1498 // DADD used as move, or zeroing
1499 // If we have a 64-bit source, then make the target 64 bits too
1500 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1501 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1502 alloc_reg64(current,i,rt1[i]);
1503 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1504 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1505 alloc_reg64(current,i,rt1[i]);
1507 if(opcode2[i]>=0x2e&&rs2[i]) {
1508 // DSUB used as negation - 64-bit result
1509 // If we have a 32-bit register, extend it to 64 bits
1510 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1511 alloc_reg64(current,i,rt1[i]);
1515 if(rs1[i]&&rs2[i]) {
1516 current->is32&=~(1LL<<rt1[i]);
1518 current->is32&=~(1LL<<rt1[i]);
1519 if((current->is32>>rs1[i])&1)
1520 current->is32|=1LL<<rt1[i];
1522 current->is32&=~(1LL<<rt1[i]);
1523 if((current->is32>>rs2[i])&1)
1524 current->is32|=1LL<<rt1[i];
1526 current->is32|=1LL<<rt1[i];
1530 clear_const(current,rs1[i]);
1531 clear_const(current,rs2[i]);
1532 clear_const(current,rt1[i]);
1533 dirty_reg(current,rt1[i]);
1536 void imm16_alloc(struct regstat *current,int i)
1538 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1540 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1541 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1542 current->is32&=~(1LL<<rt1[i]);
1543 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1544 // TODO: Could preserve the 32-bit flag if the immediate is zero
1545 alloc_reg64(current,i,rt1[i]);
1546 alloc_reg64(current,i,rs1[i]);
1548 clear_const(current,rs1[i]);
1549 clear_const(current,rt1[i]);
1551 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1552 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1553 current->is32|=1LL<<rt1[i];
1554 clear_const(current,rs1[i]);
1555 clear_const(current,rt1[i]);
1557 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1558 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1559 if(rs1[i]!=rt1[i]) {
1560 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1561 alloc_reg64(current,i,rt1[i]);
1562 current->is32&=~(1LL<<rt1[i]);
1565 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1566 if(is_const(current,rs1[i])) {
1567 int v=get_const(current,rs1[i]);
1568 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1569 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1570 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1572 else clear_const(current,rt1[i]);
1574 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1575 if(is_const(current,rs1[i])) {
1576 int v=get_const(current,rs1[i]);
1577 set_const(current,rt1[i],v+imm[i]);
1579 else clear_const(current,rt1[i]);
1580 current->is32|=1LL<<rt1[i];
1583 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1584 current->is32|=1LL<<rt1[i];
1586 dirty_reg(current,rt1[i]);
1589 void load_alloc(struct regstat *current,int i)
1591 clear_const(current,rt1[i]);
1592 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1593 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1594 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1596 alloc_reg(current,i,rt1[i]);
1597 if(get_reg(current->regmap,rt1[i])<0) {
1598 // dummy load, but we still need a register to calculate the address
1599 alloc_reg_temp(current,i,-1);
1600 minimum_free_regs[i]=1;
1602 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1604 current->is32&=~(1LL<<rt1[i]);
1605 alloc_reg64(current,i,rt1[i]);
1607 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1609 current->is32&=~(1LL<<rt1[i]);
1610 alloc_reg64(current,i,rt1[i]);
1611 alloc_all(current,i);
1612 alloc_reg64(current,i,FTEMP);
1613 minimum_free_regs[i]=HOST_REGS;
1615 else current->is32|=1LL<<rt1[i];
1616 dirty_reg(current,rt1[i]);
1617 // If using TLB, need a register for pointer to the mapping table
1618 if(using_tlb) alloc_reg(current,i,TLREG);
1619 // LWL/LWR need a temporary register for the old value
1620 if(opcode[i]==0x22||opcode[i]==0x26)
1622 alloc_reg(current,i,FTEMP);
1623 alloc_reg_temp(current,i,-1);
1624 minimum_free_regs[i]=1;
1629 // Load to r0 (dummy load)
1630 // but we still need a register to calculate the address
1631 if(opcode[i]==0x22||opcode[i]==0x26)
1633 alloc_reg(current,i,FTEMP); // LWL/LWR need another temporary
1635 alloc_reg_temp(current,i,-1);
1636 minimum_free_regs[i]=1;
1637 if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1639 alloc_all(current,i);
1640 alloc_reg64(current,i,FTEMP);
1641 minimum_free_regs[i]=HOST_REGS;
1646 void store_alloc(struct regstat *current,int i)
1648 clear_const(current,rs2[i]);
1649 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1650 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1651 alloc_reg(current,i,rs2[i]);
1652 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1653 alloc_reg64(current,i,rs2[i]);
1654 if(rs2[i]) alloc_reg(current,i,FTEMP);
1656 // If using TLB, need a register for pointer to the mapping table
1657 if(using_tlb) alloc_reg(current,i,TLREG);
1658 #if defined(HOST_IMM8)
1659 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1660 else alloc_reg(current,i,INVCP);
1662 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1663 alloc_reg(current,i,FTEMP);
1665 // We need a temporary register for address generation
1666 alloc_reg_temp(current,i,-1);
1667 minimum_free_regs[i]=1;
1670 void c1ls_alloc(struct regstat *current,int i)
1672 //clear_const(current,rs1[i]); // FIXME
1673 clear_const(current,rt1[i]);
1674 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1675 alloc_reg(current,i,CSREG); // Status
1676 alloc_reg(current,i,FTEMP);
1677 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1678 alloc_reg64(current,i,FTEMP);
1680 // If using TLB, need a register for pointer to the mapping table
1681 if(using_tlb) alloc_reg(current,i,TLREG);
1682 #if defined(HOST_IMM8)
1683 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1684 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1685 alloc_reg(current,i,INVCP);
1687 // We need a temporary register for address generation
1688 alloc_reg_temp(current,i,-1);
1691 void c2ls_alloc(struct regstat *current,int i)
1693 clear_const(current,rt1[i]);
1694 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1695 alloc_reg(current,i,FTEMP);
1696 // If using TLB, need a register for pointer to the mapping table
1697 if(using_tlb) alloc_reg(current,i,TLREG);
1698 #if defined(HOST_IMM8)
1699 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1700 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1701 alloc_reg(current,i,INVCP);
1703 // We need a temporary register for address generation
1704 alloc_reg_temp(current,i,-1);
1705 minimum_free_regs[i]=1;
1708 #ifndef multdiv_alloc
1709 void multdiv_alloc(struct regstat *current,int i)
1716 // case 0x1D: DMULTU
1719 clear_const(current,rs1[i]);
1720 clear_const(current,rs2[i]);
1723 if((opcode2[i]&4)==0) // 32-bit
1725 current->u&=~(1LL<<HIREG);
1726 current->u&=~(1LL<<LOREG);
1727 alloc_reg(current,i,HIREG);
1728 alloc_reg(current,i,LOREG);
1729 alloc_reg(current,i,rs1[i]);
1730 alloc_reg(current,i,rs2[i]);
1731 current->is32|=1LL<<HIREG;
1732 current->is32|=1LL<<LOREG;
1733 dirty_reg(current,HIREG);
1734 dirty_reg(current,LOREG);
1738 current->u&=~(1LL<<HIREG);
1739 current->u&=~(1LL<<LOREG);
1740 current->uu&=~(1LL<<HIREG);
1741 current->uu&=~(1LL<<LOREG);
1742 alloc_reg64(current,i,HIREG);
1743 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1744 alloc_reg64(current,i,rs1[i]);
1745 alloc_reg64(current,i,rs2[i]);
1746 alloc_all(current,i);
1747 current->is32&=~(1LL<<HIREG);
1748 current->is32&=~(1LL<<LOREG);
1749 dirty_reg(current,HIREG);
1750 dirty_reg(current,LOREG);
1751 minimum_free_regs[i]=HOST_REGS;
1756 // Multiply by zero is zero.
1757 // MIPS does not have a divide by zero exception.
1758 // The result is undefined, we return zero.
1759 alloc_reg(current,i,HIREG);
1760 alloc_reg(current,i,LOREG);
1761 current->is32|=1LL<<HIREG;
1762 current->is32|=1LL<<LOREG;
1763 dirty_reg(current,HIREG);
1764 dirty_reg(current,LOREG);
1769 void cop0_alloc(struct regstat *current,int i)
1771 if(opcode2[i]==0) // MFC0
1774 clear_const(current,rt1[i]);
1775 alloc_all(current,i);
1776 alloc_reg(current,i,rt1[i]);
1777 current->is32|=1LL<<rt1[i];
1778 dirty_reg(current,rt1[i]);
1781 else if(opcode2[i]==4) // MTC0
1784 clear_const(current,rs1[i]);
1785 alloc_reg(current,i,rs1[i]);
1786 alloc_all(current,i);
1789 alloc_all(current,i); // FIXME: Keep r0
1791 alloc_reg(current,i,0);
1796 // TLBR/TLBWI/TLBWR/TLBP/ERET
1797 assert(opcode2[i]==0x10);
1798 alloc_all(current,i);
1800 minimum_free_regs[i]=HOST_REGS;
1803 void cop1_alloc(struct regstat *current,int i)
1805 alloc_reg(current,i,CSREG); // Load status
1806 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1809 clear_const(current,rt1[i]);
1811 alloc_reg64(current,i,rt1[i]); // DMFC1
1812 current->is32&=~(1LL<<rt1[i]);
1814 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1815 current->is32|=1LL<<rt1[i];
1817 dirty_reg(current,rt1[i]);
1819 alloc_reg_temp(current,i,-1);
1821 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1824 clear_const(current,rs1[i]);
1826 alloc_reg64(current,i,rs1[i]); // DMTC1
1828 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1829 alloc_reg_temp(current,i,-1);
1833 alloc_reg(current,i,0);
1834 alloc_reg_temp(current,i,-1);
1837 minimum_free_regs[i]=1;
1839 void fconv_alloc(struct regstat *current,int i)
1841 alloc_reg(current,i,CSREG); // Load status
1842 alloc_reg_temp(current,i,-1);
1843 minimum_free_regs[i]=1;
1845 void float_alloc(struct regstat *current,int i)
1847 alloc_reg(current,i,CSREG); // Load status
1848 alloc_reg_temp(current,i,-1);
1849 minimum_free_regs[i]=1;
1851 void c2op_alloc(struct regstat *current,int i)
1853 alloc_reg_temp(current,i,-1);
1855 void fcomp_alloc(struct regstat *current,int i)
1857 alloc_reg(current,i,CSREG); // Load status
1858 alloc_reg(current,i,FSREG); // Load flags
1859 dirty_reg(current,FSREG); // Flag will be modified
1860 alloc_reg_temp(current,i,-1);
1861 minimum_free_regs[i]=1;
1864 void syscall_alloc(struct regstat *current,int i)
1866 alloc_cc(current,i);
1867 dirty_reg(current,CCREG);
1868 alloc_all(current,i);
1869 minimum_free_regs[i]=HOST_REGS;
1873 void delayslot_alloc(struct regstat *current,int i)
1884 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1885 printf("Disabled speculative precompilation\n");
1889 imm16_alloc(current,i);
1893 load_alloc(current,i);
1897 store_alloc(current,i);
1900 alu_alloc(current,i);
1903 shift_alloc(current,i);
1906 multdiv_alloc(current,i);
1909 shiftimm_alloc(current,i);
1912 mov_alloc(current,i);
1915 cop0_alloc(current,i);
1919 cop1_alloc(current,i);
1922 c1ls_alloc(current,i);
1925 c2ls_alloc(current,i);
1928 fconv_alloc(current,i);
1931 float_alloc(current,i);
1934 fcomp_alloc(current,i);
1937 c2op_alloc(current,i);
1942 // Special case where a branch and delay slot span two pages in virtual memory
1943 static void pagespan_alloc(struct regstat *current,int i)
1946 current->wasconst=0;
1948 minimum_free_regs[i]=HOST_REGS;
1949 alloc_all(current,i);
1950 alloc_cc(current,i);
1951 dirty_reg(current,CCREG);
1952 if(opcode[i]==3) // JAL
1954 alloc_reg(current,i,31);
1955 dirty_reg(current,31);
1957 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
1959 alloc_reg(current,i,rs1[i]);
1961 alloc_reg(current,i,rt1[i]);
1962 dirty_reg(current,rt1[i]);
1965 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
1967 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1968 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1969 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1971 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1972 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
1976 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
1978 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1979 if(!((current->is32>>rs1[i])&1))
1981 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1985 if(opcode[i]==0x11) // BC1
1987 alloc_reg(current,i,FSREG);
1988 alloc_reg(current,i,CSREG);
1993 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
1995 stubs[stubcount][0]=type;
1996 stubs[stubcount][1]=addr;
1997 stubs[stubcount][2]=retaddr;
1998 stubs[stubcount][3]=a;
1999 stubs[stubcount][4]=b;
2000 stubs[stubcount][5]=c;
2001 stubs[stubcount][6]=d;
2002 stubs[stubcount][7]=e;
2006 // Write out a single register
2007 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
2010 for(hr=0;hr<HOST_REGS;hr++) {
2011 if(hr!=EXCLUDE_REG) {
2012 if((regmap[hr]&63)==r) {
2015 emit_storereg(r,hr);
2017 if((is32>>regmap[hr])&1) {
2018 emit_sarimm(hr,31,hr);
2019 emit_storereg(r|64,hr);
2023 emit_storereg(r|64,hr);
2033 //if(!tracedebug) return 0;
2036 for(i=0;i<2097152;i++) {
2037 unsigned int temp=sum;
2040 sum^=((u_int *)rdram)[i];
2049 sum^=((u_int *)reg)[i];
2057 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2059 #ifndef DISABLE_COP1
2062 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2072 void memdebug(int i)
2074 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2075 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2078 //if(Count>=-2084597794) {
2079 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2081 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2082 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2083 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2086 printf("TRACE: %x\n",(&i)[-1]);
2090 printf("TRACE: %x \n",(&j)[10]);
2091 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]);
2095 //printf("TRACE: %x\n",(&i)[-1]);
2098 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2100 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2103 void alu_assemble(int i,struct regstat *i_regs)
2105 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2107 signed char s1,s2,t;
2108 t=get_reg(i_regs->regmap,rt1[i]);
2110 s1=get_reg(i_regs->regmap,rs1[i]);
2111 s2=get_reg(i_regs->regmap,rs2[i]);
2112 if(rs1[i]&&rs2[i]) {
2115 if(opcode2[i]&2) emit_sub(s1,s2,t);
2116 else emit_add(s1,s2,t);
2119 if(s1>=0) emit_mov(s1,t);
2120 else emit_loadreg(rs1[i],t);
2124 if(opcode2[i]&2) emit_neg(s2,t);
2125 else emit_mov(s2,t);
2128 emit_loadreg(rs2[i],t);
2129 if(opcode2[i]&2) emit_neg(t,t);
2132 else emit_zeroreg(t);
2136 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2138 signed char s1l,s2l,s1h,s2h,tl,th;
2139 tl=get_reg(i_regs->regmap,rt1[i]);
2140 th=get_reg(i_regs->regmap,rt1[i]|64);
2142 s1l=get_reg(i_regs->regmap,rs1[i]);
2143 s2l=get_reg(i_regs->regmap,rs2[i]);
2144 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2145 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2146 if(rs1[i]&&rs2[i]) {
2149 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2150 else emit_adds(s1l,s2l,tl);
2152 #ifdef INVERTED_CARRY
2153 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2155 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2157 else emit_add(s1h,s2h,th);
2161 if(s1l>=0) emit_mov(s1l,tl);
2162 else emit_loadreg(rs1[i],tl);
2164 if(s1h>=0) emit_mov(s1h,th);
2165 else emit_loadreg(rs1[i]|64,th);
2170 if(opcode2[i]&2) emit_negs(s2l,tl);
2171 else emit_mov(s2l,tl);
2174 emit_loadreg(rs2[i],tl);
2175 if(opcode2[i]&2) emit_negs(tl,tl);
2178 #ifdef INVERTED_CARRY
2179 if(s2h>=0) emit_mov(s2h,th);
2180 else emit_loadreg(rs2[i]|64,th);
2182 emit_adcimm(-1,th); // x86 has inverted carry flag
2187 if(s2h>=0) emit_rscimm(s2h,0,th);
2189 emit_loadreg(rs2[i]|64,th);
2190 emit_rscimm(th,0,th);
2193 if(s2h>=0) emit_mov(s2h,th);
2194 else emit_loadreg(rs2[i]|64,th);
2201 if(th>=0) emit_zeroreg(th);
2206 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2208 signed char s1l,s1h,s2l,s2h,t;
2209 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2211 t=get_reg(i_regs->regmap,rt1[i]);
2214 s1l=get_reg(i_regs->regmap,rs1[i]);
2215 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2216 s2l=get_reg(i_regs->regmap,rs2[i]);
2217 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2218 if(rs2[i]==0) // rx<r0
2221 if(opcode2[i]==0x2a) // SLT
2222 emit_shrimm(s1h,31,t);
2223 else // SLTU (unsigned can not be less than zero)
2226 else if(rs1[i]==0) // r0<rx
2229 if(opcode2[i]==0x2a) // SLT
2230 emit_set_gz64_32(s2h,s2l,t);
2231 else // SLTU (set if not zero)
2232 emit_set_nz64_32(s2h,s2l,t);
2235 assert(s1l>=0);assert(s1h>=0);
2236 assert(s2l>=0);assert(s2h>=0);
2237 if(opcode2[i]==0x2a) // SLT
2238 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2240 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2244 t=get_reg(i_regs->regmap,rt1[i]);
2247 s1l=get_reg(i_regs->regmap,rs1[i]);
2248 s2l=get_reg(i_regs->regmap,rs2[i]);
2249 if(rs2[i]==0) // rx<r0
2252 if(opcode2[i]==0x2a) // SLT
2253 emit_shrimm(s1l,31,t);
2254 else // SLTU (unsigned can not be less than zero)
2257 else if(rs1[i]==0) // r0<rx
2260 if(opcode2[i]==0x2a) // SLT
2261 emit_set_gz32(s2l,t);
2262 else // SLTU (set if not zero)
2263 emit_set_nz32(s2l,t);
2266 assert(s1l>=0);assert(s2l>=0);
2267 if(opcode2[i]==0x2a) // SLT
2268 emit_set_if_less32(s1l,s2l,t);
2270 emit_set_if_carry32(s1l,s2l,t);
2276 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2278 signed char s1l,s1h,s2l,s2h,th,tl;
2279 tl=get_reg(i_regs->regmap,rt1[i]);
2280 th=get_reg(i_regs->regmap,rt1[i]|64);
2281 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2285 s1l=get_reg(i_regs->regmap,rs1[i]);
2286 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2287 s2l=get_reg(i_regs->regmap,rs2[i]);
2288 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2289 if(rs1[i]&&rs2[i]) {
2290 assert(s1l>=0);assert(s1h>=0);
2291 assert(s2l>=0);assert(s2h>=0);
2292 if(opcode2[i]==0x24) { // AND
2293 emit_and(s1l,s2l,tl);
2294 emit_and(s1h,s2h,th);
2296 if(opcode2[i]==0x25) { // OR
2297 emit_or(s1l,s2l,tl);
2298 emit_or(s1h,s2h,th);
2300 if(opcode2[i]==0x26) { // XOR
2301 emit_xor(s1l,s2l,tl);
2302 emit_xor(s1h,s2h,th);
2304 if(opcode2[i]==0x27) { // NOR
2305 emit_or(s1l,s2l,tl);
2306 emit_or(s1h,s2h,th);
2313 if(opcode2[i]==0x24) { // AND
2317 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2319 if(s1l>=0) emit_mov(s1l,tl);
2320 else emit_loadreg(rs1[i],tl);
2321 if(s1h>=0) emit_mov(s1h,th);
2322 else emit_loadreg(rs1[i]|64,th);
2326 if(s2l>=0) emit_mov(s2l,tl);
2327 else emit_loadreg(rs2[i],tl);
2328 if(s2h>=0) emit_mov(s2h,th);
2329 else emit_loadreg(rs2[i]|64,th);
2336 if(opcode2[i]==0x27) { // NOR
2338 if(s1l>=0) emit_not(s1l,tl);
2340 emit_loadreg(rs1[i],tl);
2343 if(s1h>=0) emit_not(s1h,th);
2345 emit_loadreg(rs1[i]|64,th);
2351 if(s2l>=0) emit_not(s2l,tl);
2353 emit_loadreg(rs2[i],tl);
2356 if(s2h>=0) emit_not(s2h,th);
2358 emit_loadreg(rs2[i]|64,th);
2374 s1l=get_reg(i_regs->regmap,rs1[i]);
2375 s2l=get_reg(i_regs->regmap,rs2[i]);
2376 if(rs1[i]&&rs2[i]) {
2379 if(opcode2[i]==0x24) { // AND
2380 emit_and(s1l,s2l,tl);
2382 if(opcode2[i]==0x25) { // OR
2383 emit_or(s1l,s2l,tl);
2385 if(opcode2[i]==0x26) { // XOR
2386 emit_xor(s1l,s2l,tl);
2388 if(opcode2[i]==0x27) { // NOR
2389 emit_or(s1l,s2l,tl);
2395 if(opcode2[i]==0x24) { // AND
2398 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2400 if(s1l>=0) emit_mov(s1l,tl);
2401 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2405 if(s2l>=0) emit_mov(s2l,tl);
2406 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2408 else emit_zeroreg(tl);
2410 if(opcode2[i]==0x27) { // NOR
2412 if(s1l>=0) emit_not(s1l,tl);
2414 emit_loadreg(rs1[i],tl);
2420 if(s2l>=0) emit_not(s2l,tl);
2422 emit_loadreg(rs2[i],tl);
2426 else emit_movimm(-1,tl);
2435 void imm16_assemble(int i,struct regstat *i_regs)
2437 if (opcode[i]==0x0f) { // LUI
2440 t=get_reg(i_regs->regmap,rt1[i]);
2443 if(!((i_regs->isconst>>t)&1))
2444 emit_movimm(imm[i]<<16,t);
2448 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2451 t=get_reg(i_regs->regmap,rt1[i]);
2452 s=get_reg(i_regs->regmap,rs1[i]);
2457 if(!((i_regs->isconst>>t)&1)) {
2459 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2460 emit_addimm(t,imm[i],t);
2462 if(!((i_regs->wasconst>>s)&1))
2463 emit_addimm(s,imm[i],t);
2465 emit_movimm(constmap[i][s]+imm[i],t);
2471 if(!((i_regs->isconst>>t)&1))
2472 emit_movimm(imm[i],t);
2477 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2479 signed char sh,sl,th,tl;
2480 th=get_reg(i_regs->regmap,rt1[i]|64);
2481 tl=get_reg(i_regs->regmap,rt1[i]);
2482 sh=get_reg(i_regs->regmap,rs1[i]|64);
2483 sl=get_reg(i_regs->regmap,rs1[i]);
2489 emit_addimm64_32(sh,sl,imm[i],th,tl);
2492 emit_addimm(sl,imm[i],tl);
2495 emit_movimm(imm[i],tl);
2496 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2501 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2503 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2504 signed char sh,sl,t;
2505 t=get_reg(i_regs->regmap,rt1[i]);
2506 sh=get_reg(i_regs->regmap,rs1[i]|64);
2507 sl=get_reg(i_regs->regmap,rs1[i]);
2511 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2512 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2513 if(opcode[i]==0x0a) { // SLTI
2515 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2516 emit_slti32(t,imm[i],t);
2518 emit_slti32(sl,imm[i],t);
2523 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2524 emit_sltiu32(t,imm[i],t);
2526 emit_sltiu32(sl,imm[i],t);
2531 if(opcode[i]==0x0a) // SLTI
2532 emit_slti64_32(sh,sl,imm[i],t);
2534 emit_sltiu64_32(sh,sl,imm[i],t);
2537 // SLTI(U) with r0 is just stupid,
2538 // nonetheless examples can be found
2539 if(opcode[i]==0x0a) // SLTI
2540 if(0<imm[i]) emit_movimm(1,t);
2541 else emit_zeroreg(t);
2544 if(imm[i]) emit_movimm(1,t);
2545 else emit_zeroreg(t);
2551 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2553 signed char sh,sl,th,tl;
2554 th=get_reg(i_regs->regmap,rt1[i]|64);
2555 tl=get_reg(i_regs->regmap,rt1[i]);
2556 sh=get_reg(i_regs->regmap,rs1[i]|64);
2557 sl=get_reg(i_regs->regmap,rs1[i]);
2558 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2559 if(opcode[i]==0x0c) //ANDI
2563 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2564 emit_andimm(tl,imm[i],tl);
2566 if(!((i_regs->wasconst>>sl)&1))
2567 emit_andimm(sl,imm[i],tl);
2569 emit_movimm(constmap[i][sl]&imm[i],tl);
2574 if(th>=0) emit_zeroreg(th);
2580 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2584 emit_loadreg(rs1[i]|64,th);
2589 if(opcode[i]==0x0d) //ORI
2591 emit_orimm(tl,imm[i],tl);
2593 if(!((i_regs->wasconst>>sl)&1))
2594 emit_orimm(sl,imm[i],tl);
2596 emit_movimm(constmap[i][sl]|imm[i],tl);
2598 if(opcode[i]==0x0e) //XORI
2600 emit_xorimm(tl,imm[i],tl);
2602 if(!((i_regs->wasconst>>sl)&1))
2603 emit_xorimm(sl,imm[i],tl);
2605 emit_movimm(constmap[i][sl]^imm[i],tl);
2609 emit_movimm(imm[i],tl);
2610 if(th>=0) emit_zeroreg(th);
2618 void shiftimm_assemble(int i,struct regstat *i_regs)
2620 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2624 t=get_reg(i_regs->regmap,rt1[i]);
2625 s=get_reg(i_regs->regmap,rs1[i]);
2634 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2636 if(opcode2[i]==0) // SLL
2638 emit_shlimm(s<0?t:s,imm[i],t);
2640 if(opcode2[i]==2) // SRL
2642 emit_shrimm(s<0?t:s,imm[i],t);
2644 if(opcode2[i]==3) // SRA
2646 emit_sarimm(s<0?t:s,imm[i],t);
2650 if(s>=0 && s!=t) emit_mov(s,t);
2654 //emit_storereg(rt1[i],t); //DEBUG
2657 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2660 signed char sh,sl,th,tl;
2661 th=get_reg(i_regs->regmap,rt1[i]|64);
2662 tl=get_reg(i_regs->regmap,rt1[i]);
2663 sh=get_reg(i_regs->regmap,rs1[i]|64);
2664 sl=get_reg(i_regs->regmap,rs1[i]);
2669 if(th>=0) emit_zeroreg(th);
2676 if(opcode2[i]==0x38) // DSLL
2678 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2679 emit_shlimm(sl,imm[i],tl);
2681 if(opcode2[i]==0x3a) // DSRL
2683 emit_shrdimm(sl,sh,imm[i],tl);
2684 if(th>=0) emit_shrimm(sh,imm[i],th);
2686 if(opcode2[i]==0x3b) // DSRA
2688 emit_shrdimm(sl,sh,imm[i],tl);
2689 if(th>=0) emit_sarimm(sh,imm[i],th);
2693 if(sl!=tl) emit_mov(sl,tl);
2694 if(th>=0&&sh!=th) emit_mov(sh,th);
2700 if(opcode2[i]==0x3c) // DSLL32
2703 signed char sl,tl,th;
2704 tl=get_reg(i_regs->regmap,rt1[i]);
2705 th=get_reg(i_regs->regmap,rt1[i]|64);
2706 sl=get_reg(i_regs->regmap,rs1[i]);
2715 emit_shlimm(th,imm[i]&31,th);
2720 if(opcode2[i]==0x3e) // DSRL32
2723 signed char sh,tl,th;
2724 tl=get_reg(i_regs->regmap,rt1[i]);
2725 th=get_reg(i_regs->regmap,rt1[i]|64);
2726 sh=get_reg(i_regs->regmap,rs1[i]|64);
2730 if(th>=0) emit_zeroreg(th);
2733 emit_shrimm(tl,imm[i]&31,tl);
2738 if(opcode2[i]==0x3f) // DSRA32
2742 tl=get_reg(i_regs->regmap,rt1[i]);
2743 sh=get_reg(i_regs->regmap,rs1[i]|64);
2749 emit_sarimm(tl,imm[i]&31,tl);
2756 #ifndef shift_assemble
2757 void shift_assemble(int i,struct regstat *i_regs)
2759 printf("Need shift_assemble for this architecture.\n");
2764 void load_assemble(int i,struct regstat *i_regs)
2766 int s,th,tl,addr,map=-1;
2769 int memtarget=0,c=0;
2771 th=get_reg(i_regs->regmap,rt1[i]|64);
2772 tl=get_reg(i_regs->regmap,rt1[i]);
2773 s=get_reg(i_regs->regmap,rs1[i]);
2775 for(hr=0;hr<HOST_REGS;hr++) {
2776 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2778 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2780 c=(i_regs->wasconst>>s)&1;
2782 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2783 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2786 //printf("load_assemble: c=%d\n",c);
2787 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2788 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2790 if(tl<0&&(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80)
2792 // could be FIFO, must perform the read
2794 assem_debug("(forced read)\n");
2795 tl=get_reg(i_regs->regmap,-1);
2799 if(offset||s<0||c) addr=tl;
2801 //if(tl<0) tl=get_reg(i_regs->regmap,-1);
2803 //printf("load_assemble: c=%d\n",c);
2804 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2805 assert(tl>=0); // Even if the load is a NOP, we must check for pagefaults and I/O
2807 if(th>=0) reglist&=~(1<<th);
2811 map=get_reg(i_regs->regmap,ROREG);
2812 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
2814 //#define R29_HACK 1
2816 // Strmnnrmn's speed hack
2817 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2821 if(sp_in_mirror&&rs1[i]==29) {
2822 emit_andimm(addr,~0x00e00000,HOST_TEMPREG);
2823 emit_cmpimm(HOST_TEMPREG,RAM_SIZE);
2827 emit_cmpimm(addr,RAM_SIZE);
2829 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
2830 // Hint to branch predictor that the branch is unlikely to be taken
2832 emit_jno_unlikely(0);
2840 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2841 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2842 map=get_reg(i_regs->regmap,TLREG);
2844 map=do_tlb_r(addr,tl,map,x,-1,-1,c,constmap[i][s]+offset);
2845 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr);
2847 int dummy=(rt1[i]==0)||(tl!=get_reg(i_regs->regmap,rt1[i])); // ignore loads to r0 and unneeded reg
2848 if (opcode[i]==0x20) { // LB
2851 #ifdef HOST_IMM_ADDR32
2853 emit_movsbl_tlb((constmap[i][s]+offset)^3,map,tl);
2857 //emit_xorimm(addr,3,tl);
2858 //gen_tlb_addr_r(tl,map);
2859 //emit_movsbl_indexed((int)rdram-0x80000000,tl,tl);
2861 #ifdef BIG_ENDIAN_MIPS
2862 if(!c) emit_xorimm(addr,3,tl);
2863 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2868 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2870 emit_movsbl_indexed_tlb(x,a,map,tl);
2874 add_stub(LOADB_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2877 inline_readstub(LOADB_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2879 if (opcode[i]==0x21) { // LH
2882 #ifdef HOST_IMM_ADDR32
2884 emit_movswl_tlb((constmap[i][s]+offset)^2,map,tl);
2889 #ifdef BIG_ENDIAN_MIPS
2890 if(!c) emit_xorimm(addr,2,tl);
2891 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2896 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2899 //emit_movswl_indexed_tlb(x,tl,map,tl);
2902 gen_tlb_addr_r(a,map);
2903 emit_movswl_indexed(x,a,tl);
2906 emit_movswl_indexed(x,a,tl);
2908 emit_movswl_indexed((int)rdram-0x80000000+x,a,tl);
2914 add_stub(LOADH_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2917 inline_readstub(LOADH_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2919 if (opcode[i]==0x23) { // LW
2924 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2926 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2927 #ifdef HOST_IMM_ADDR32
2929 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2932 emit_readword_indexed_tlb(0,a,map,tl);
2935 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2938 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2940 if (opcode[i]==0x24) { // LBU
2943 #ifdef HOST_IMM_ADDR32
2945 emit_movzbl_tlb((constmap[i][s]+offset)^3,map,tl);
2949 //emit_xorimm(addr,3,tl);
2950 //gen_tlb_addr_r(tl,map);
2951 //emit_movzbl_indexed((int)rdram-0x80000000,tl,tl);
2953 #ifdef BIG_ENDIAN_MIPS
2954 if(!c) emit_xorimm(addr,3,tl);
2955 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2960 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2962 emit_movzbl_indexed_tlb(x,a,map,tl);
2966 add_stub(LOADBU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2969 inline_readstub(LOADBU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2971 if (opcode[i]==0x25) { // LHU
2974 #ifdef HOST_IMM_ADDR32
2976 emit_movzwl_tlb((constmap[i][s]+offset)^2,map,tl);
2981 #ifdef BIG_ENDIAN_MIPS
2982 if(!c) emit_xorimm(addr,2,tl);
2983 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2988 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
2991 //emit_movzwl_indexed_tlb(x,tl,map,tl);
2994 gen_tlb_addr_r(a,map);
2995 emit_movzwl_indexed(x,a,tl);
2998 emit_movzwl_indexed(x,a,tl);
3000 emit_movzwl_indexed((int)rdram-0x80000000+x,a,tl);
3006 add_stub(LOADHU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3009 inline_readstub(LOADHU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3011 if (opcode[i]==0x27) { // LWU
3017 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3019 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
3020 #ifdef HOST_IMM_ADDR32
3022 emit_readword_tlb(constmap[i][s]+offset,map,tl);
3025 emit_readword_indexed_tlb(0,a,map,tl);
3028 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3031 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3035 if (opcode[i]==0x37) { // LD
3040 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3042 //gen_tlb_addr_r(tl,map);
3043 //if(th>=0) emit_readword_indexed((int)rdram-0x80000000,addr,th);
3044 //emit_readword_indexed((int)rdram-0x7FFFFFFC,addr,tl);
3045 #ifdef HOST_IMM_ADDR32
3047 emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3050 emit_readdword_indexed_tlb(0,a,map,th,tl);
3053 add_stub(LOADD_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3056 inline_readstub(LOADD_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3059 //emit_storereg(rt1[i],tl); // DEBUG
3060 //if(opcode[i]==0x23)
3061 //if(opcode[i]==0x24)
3062 //if(opcode[i]==0x23||opcode[i]==0x24)
3063 /*if(opcode[i]==0x21||opcode[i]==0x23||opcode[i]==0x24)
3067 emit_readword((int)&last_count,ECX);
3069 if(get_reg(i_regs->regmap,CCREG)<0)
3070 emit_loadreg(CCREG,HOST_CCREG);
3071 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3072 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3073 emit_writeword(HOST_CCREG,(int)&Count);
3076 if(get_reg(i_regs->regmap,CCREG)<0)
3077 emit_loadreg(CCREG,0);
3079 emit_mov(HOST_CCREG,0);
3081 emit_addimm(0,2*ccadj[i],0);
3082 emit_writeword(0,(int)&Count);
3084 emit_call((int)memdebug);
3086 restore_regs(0x100f);
3090 #ifndef loadlr_assemble
3091 void loadlr_assemble(int i,struct regstat *i_regs)
3093 printf("Need loadlr_assemble for this architecture.\n");
3098 void store_assemble(int i,struct regstat *i_regs)
3103 int jaddr=0,jaddr2,type;
3104 int memtarget=0,c=0;
3105 int agr=AGEN1+(i&1);
3107 th=get_reg(i_regs->regmap,rs2[i]|64);
3108 tl=get_reg(i_regs->regmap,rs2[i]);
3109 s=get_reg(i_regs->regmap,rs1[i]);
3110 temp=get_reg(i_regs->regmap,agr);
3111 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3114 c=(i_regs->wasconst>>s)&1;
3116 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3117 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3122 for(hr=0;hr<HOST_REGS;hr++) {
3123 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3125 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3126 if(offset||s<0||c) addr=temp;
3131 if(sp_in_mirror&&rs1[i]==29) {
3132 emit_andimm(addr,~0x00e00000,HOST_TEMPREG);
3133 emit_cmpimm(HOST_TEMPREG,RAM_SIZE);
3138 // Strmnnrmn's speed hack
3139 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3141 emit_cmpimm(addr,RAM_SIZE);
3142 #ifdef DESTRUCTIVE_SHIFT
3143 if(s==addr) emit_mov(s,temp);
3147 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3151 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
3152 // Hint to branch predictor that the branch is unlikely to be taken
3154 emit_jno_unlikely(0);
3162 if (opcode[i]==0x28) x=3; // SB
3163 if (opcode[i]==0x29) x=2; // SH
3164 map=get_reg(i_regs->regmap,TLREG);
3166 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3167 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3170 if (opcode[i]==0x28) { // SB
3173 #ifdef BIG_ENDIAN_MIPS
3174 if(!c) emit_xorimm(addr,3,temp);
3175 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3180 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3182 //gen_tlb_addr_w(temp,map);
3183 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3184 emit_writebyte_indexed_tlb(tl,x,a,map,a);
3188 if (opcode[i]==0x29) { // SH
3191 #ifdef BIG_ENDIAN_MIPS
3192 if(!c) emit_xorimm(addr,2,temp);
3193 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3198 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3201 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3204 gen_tlb_addr_w(a,map);
3205 emit_writehword_indexed(tl,x,a);
3207 emit_writehword_indexed(tl,(int)rdram-0x80000000+x,a);
3211 if (opcode[i]==0x2B) { // SW
3215 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3217 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3218 emit_writeword_indexed_tlb(tl,0,a,map,temp);
3222 if (opcode[i]==0x3F) { // SD
3226 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3230 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3231 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3232 emit_writedword_indexed_tlb(th,tl,0,a,map,temp);
3235 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3236 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3237 emit_writedword_indexed_tlb(tl,tl,0,a,map,temp);
3244 #ifdef DESTRUCTIVE_SHIFT
3245 // The x86 shift operation is 'destructive'; it overwrites the
3246 // source register, so we need to make a copy first and use that.
3249 #if defined(HOST_IMM8)
3250 int ir=get_reg(i_regs->regmap,INVCP);
3252 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3254 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3256 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3257 emit_callne(invalidate_addr_reg[addr]);
3261 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3266 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3267 } else if(c&&!memtarget) {
3268 inline_writestub(type,i,constmap[i][s]+offset,i_regs->regmap,rs2[i],ccadj[i],reglist);
3270 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3271 //if(opcode[i]==0x2B || opcode[i]==0x28)
3272 //if(opcode[i]==0x2B || opcode[i]==0x29)
3273 //if(opcode[i]==0x2B)
3274 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3278 emit_readword((int)&last_count,ECX);
3280 if(get_reg(i_regs->regmap,CCREG)<0)
3281 emit_loadreg(CCREG,HOST_CCREG);
3282 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3283 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3284 emit_writeword(HOST_CCREG,(int)&Count);
3287 if(get_reg(i_regs->regmap,CCREG)<0)
3288 emit_loadreg(CCREG,0);
3290 emit_mov(HOST_CCREG,0);
3292 emit_addimm(0,2*ccadj[i],0);
3293 emit_writeword(0,(int)&Count);
3295 emit_call((int)memdebug);
3297 restore_regs(0x100f);
3301 void storelr_assemble(int i,struct regstat *i_regs)
3308 int case1,case2,case3;
3309 int done0,done1,done2;
3310 int memtarget=0,c=0;
3311 int agr=AGEN1+(i&1);
3313 th=get_reg(i_regs->regmap,rs2[i]|64);
3314 tl=get_reg(i_regs->regmap,rs2[i]);
3315 s=get_reg(i_regs->regmap,rs1[i]);
3316 temp=get_reg(i_regs->regmap,agr);
3317 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3320 c=(i_regs->isconst>>s)&1;
3322 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3323 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3327 for(hr=0;hr<HOST_REGS;hr++) {
3328 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3333 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3334 if(!offset&&s!=temp) emit_mov(s,temp);
3340 if(!memtarget||!rs1[i]) {
3346 int map=get_reg(i_regs->regmap,ROREG);
3347 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
3348 gen_tlb_addr_w(temp,map);
3350 if((u_int)rdram!=0x80000000)
3351 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3354 int map=get_reg(i_regs->regmap,TLREG);
3356 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3357 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3358 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3359 if(!jaddr&&!memtarget) {
3363 gen_tlb_addr_w(temp,map);
3366 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3367 temp2=get_reg(i_regs->regmap,FTEMP);
3368 if(!rs2[i]) temp2=th=tl;
3371 #ifndef BIG_ENDIAN_MIPS
3372 emit_xorimm(temp,3,temp);
3374 emit_testimm(temp,2);
3377 emit_testimm(temp,1);
3381 if (opcode[i]==0x2A) { // SWL
3382 emit_writeword_indexed(tl,0,temp);
3384 if (opcode[i]==0x2E) { // SWR
3385 emit_writebyte_indexed(tl,3,temp);
3387 if (opcode[i]==0x2C) { // SDL
3388 emit_writeword_indexed(th,0,temp);
3389 if(rs2[i]) emit_mov(tl,temp2);
3391 if (opcode[i]==0x2D) { // SDR
3392 emit_writebyte_indexed(tl,3,temp);
3393 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3398 set_jump_target(case1,(int)out);
3399 if (opcode[i]==0x2A) { // SWL
3400 // Write 3 msb into three least significant bytes
3401 if(rs2[i]) emit_rorimm(tl,8,tl);
3402 emit_writehword_indexed(tl,-1,temp);
3403 if(rs2[i]) emit_rorimm(tl,16,tl);
3404 emit_writebyte_indexed(tl,1,temp);
3405 if(rs2[i]) emit_rorimm(tl,8,tl);
3407 if (opcode[i]==0x2E) { // SWR
3408 // Write two lsb into two most significant bytes
3409 emit_writehword_indexed(tl,1,temp);
3411 if (opcode[i]==0x2C) { // SDL
3412 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3413 // Write 3 msb into three least significant bytes
3414 if(rs2[i]) emit_rorimm(th,8,th);
3415 emit_writehword_indexed(th,-1,temp);
3416 if(rs2[i]) emit_rorimm(th,16,th);
3417 emit_writebyte_indexed(th,1,temp);
3418 if(rs2[i]) emit_rorimm(th,8,th);
3420 if (opcode[i]==0x2D) { // SDR
3421 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3422 // Write two lsb into two most significant bytes
3423 emit_writehword_indexed(tl,1,temp);
3428 set_jump_target(case2,(int)out);
3429 emit_testimm(temp,1);
3432 if (opcode[i]==0x2A) { // SWL
3433 // Write two msb into two least significant bytes
3434 if(rs2[i]) emit_rorimm(tl,16,tl);
3435 emit_writehword_indexed(tl,-2,temp);
3436 if(rs2[i]) emit_rorimm(tl,16,tl);
3438 if (opcode[i]==0x2E) { // SWR
3439 // Write 3 lsb into three most significant bytes
3440 emit_writebyte_indexed(tl,-1,temp);
3441 if(rs2[i]) emit_rorimm(tl,8,tl);
3442 emit_writehword_indexed(tl,0,temp);
3443 if(rs2[i]) emit_rorimm(tl,24,tl);
3445 if (opcode[i]==0x2C) { // SDL
3446 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3447 // Write two msb into two least significant bytes
3448 if(rs2[i]) emit_rorimm(th,16,th);
3449 emit_writehword_indexed(th,-2,temp);
3450 if(rs2[i]) emit_rorimm(th,16,th);
3452 if (opcode[i]==0x2D) { // SDR
3453 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3454 // Write 3 lsb into three most significant bytes
3455 emit_writebyte_indexed(tl,-1,temp);
3456 if(rs2[i]) emit_rorimm(tl,8,tl);
3457 emit_writehword_indexed(tl,0,temp);
3458 if(rs2[i]) emit_rorimm(tl,24,tl);
3463 set_jump_target(case3,(int)out);
3464 if (opcode[i]==0x2A) { // SWL
3465 // Write msb into least significant byte
3466 if(rs2[i]) emit_rorimm(tl,24,tl);
3467 emit_writebyte_indexed(tl,-3,temp);
3468 if(rs2[i]) emit_rorimm(tl,8,tl);
3470 if (opcode[i]==0x2E) { // SWR
3471 // Write entire word
3472 emit_writeword_indexed(tl,-3,temp);
3474 if (opcode[i]==0x2C) { // SDL
3475 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3476 // Write msb into least significant byte
3477 if(rs2[i]) emit_rorimm(th,24,th);
3478 emit_writebyte_indexed(th,-3,temp);
3479 if(rs2[i]) emit_rorimm(th,8,th);
3481 if (opcode[i]==0x2D) { // SDR
3482 if(rs2[i]) emit_mov(th,temp2);
3483 // Write entire word
3484 emit_writeword_indexed(tl,-3,temp);
3486 set_jump_target(done0,(int)out);
3487 set_jump_target(done1,(int)out);
3488 set_jump_target(done2,(int)out);
3489 if (opcode[i]==0x2C) { // SDL
3490 emit_testimm(temp,4);
3493 emit_andimm(temp,~3,temp);
3494 emit_writeword_indexed(temp2,4,temp);
3495 set_jump_target(done0,(int)out);
3497 if (opcode[i]==0x2D) { // SDR
3498 emit_testimm(temp,4);
3501 emit_andimm(temp,~3,temp);
3502 emit_writeword_indexed(temp2,-4,temp);
3503 set_jump_target(done0,(int)out);
3506 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3509 int map=get_reg(i_regs->regmap,ROREG);
3510 if(map<0) map=HOST_TEMPREG;
3511 gen_orig_addr_w(temp,map);
3513 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3515 #if defined(HOST_IMM8)
3516 int ir=get_reg(i_regs->regmap,INVCP);
3518 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3520 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3522 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3523 emit_callne(invalidate_addr_reg[temp]);
3527 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3532 //save_regs(0x100f);
3533 emit_readword((int)&last_count,ECX);
3534 if(get_reg(i_regs->regmap,CCREG)<0)
3535 emit_loadreg(CCREG,HOST_CCREG);
3536 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3537 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3538 emit_writeword(HOST_CCREG,(int)&Count);
3539 emit_call((int)memdebug);
3541 //restore_regs(0x100f);
3545 void c1ls_assemble(int i,struct regstat *i_regs)
3547 #ifndef DISABLE_COP1
3553 int jaddr,jaddr2=0,jaddr3,type;
3554 int agr=AGEN1+(i&1);
3556 th=get_reg(i_regs->regmap,FTEMP|64);
3557 tl=get_reg(i_regs->regmap,FTEMP);
3558 s=get_reg(i_regs->regmap,rs1[i]);
3559 temp=get_reg(i_regs->regmap,agr);
3560 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3565 for(hr=0;hr<HOST_REGS;hr++) {
3566 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3568 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3569 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3571 // Loads use a temporary register which we need to save
3574 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3578 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3579 //else c=(i_regs->wasconst>>s)&1;
3580 if(s>=0) c=(i_regs->wasconst>>s)&1;
3581 // Check cop1 unusable
3583 signed char rs=get_reg(i_regs->regmap,CSREG);
3585 emit_testimm(rs,0x20000000);
3588 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3591 if (opcode[i]==0x39) { // SWC1 (get float address)
3592 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3594 if (opcode[i]==0x3D) { // SDC1 (get double address)
3595 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3597 // Generate address + offset
3600 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3604 map=get_reg(i_regs->regmap,TLREG);
3606 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3607 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3609 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3610 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3613 if (opcode[i]==0x39) { // SWC1 (read float)
3614 emit_readword_indexed(0,tl,tl);
3616 if (opcode[i]==0x3D) { // SDC1 (read double)
3617 emit_readword_indexed(4,tl,th);
3618 emit_readword_indexed(0,tl,tl);
3620 if (opcode[i]==0x31) { // LWC1 (get target address)
3621 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3623 if (opcode[i]==0x35) { // LDC1 (get target address)
3624 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3631 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3633 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3635 #ifdef DESTRUCTIVE_SHIFT
3636 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3637 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3641 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3642 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3644 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3645 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3648 if (opcode[i]==0x31) { // LWC1
3649 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3650 //gen_tlb_addr_r(ar,map);
3651 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3652 #ifdef HOST_IMM_ADDR32
3653 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3656 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3659 if (opcode[i]==0x35) { // LDC1
3661 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3662 //gen_tlb_addr_r(ar,map);
3663 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3664 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3665 #ifdef HOST_IMM_ADDR32
3666 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3669 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3672 if (opcode[i]==0x39) { // SWC1
3673 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3674 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3677 if (opcode[i]==0x3D) { // SDC1
3679 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3680 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3681 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3685 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3686 #ifndef DESTRUCTIVE_SHIFT
3687 temp=offset||c||s<0?ar:s;
3689 #if defined(HOST_IMM8)
3690 int ir=get_reg(i_regs->regmap,INVCP);
3692 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3694 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3696 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3697 emit_callne(invalidate_addr_reg[temp]);
3701 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3705 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3706 if (opcode[i]==0x31) { // LWC1 (write float)
3707 emit_writeword_indexed(tl,0,temp);
3709 if (opcode[i]==0x35) { // LDC1 (write double)
3710 emit_writeword_indexed(th,4,temp);
3711 emit_writeword_indexed(tl,0,temp);
3713 //if(opcode[i]==0x39)
3714 /*if(opcode[i]==0x39||opcode[i]==0x31)
3717 emit_readword((int)&last_count,ECX);
3718 if(get_reg(i_regs->regmap,CCREG)<0)
3719 emit_loadreg(CCREG,HOST_CCREG);
3720 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3721 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3722 emit_writeword(HOST_CCREG,(int)&Count);
3723 emit_call((int)memdebug);
3727 cop1_unusable(i, i_regs);
3731 void c2ls_assemble(int i,struct regstat *i_regs)
3736 int memtarget=0,c=0;
3737 int jaddr2=0,jaddr3,type;
3738 int agr=AGEN1+(i&1);
3740 u_int copr=(source[i]>>16)&0x1f;
3741 s=get_reg(i_regs->regmap,rs1[i]);
3742 tl=get_reg(i_regs->regmap,FTEMP);
3748 for(hr=0;hr<HOST_REGS;hr++) {
3749 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3751 if(i_regs->regmap[HOST_CCREG]==CCREG)
3752 reglist&=~(1<<HOST_CCREG);
3755 if (opcode[i]==0x3a) { // SWC2
3756 ar=get_reg(i_regs->regmap,agr);
3757 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3762 if(s>=0) c=(i_regs->wasconst>>s)&1;
3763 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3764 if (!offset&&!c&&s>=0) ar=s;
3767 if (opcode[i]==0x3a) { // SWC2
3768 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3776 emit_jmp(0); // inline_readstub/inline_writestub?
3780 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3784 if (opcode[i]==0x32) { // LWC2
3785 #ifdef HOST_IMM_ADDR32
3786 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3789 emit_readword_indexed(0,ar,tl);
3791 if (opcode[i]==0x3a) { // SWC2
3792 #ifdef DESTRUCTIVE_SHIFT
3793 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3795 emit_writeword_indexed(tl,0,ar);
3799 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3800 if (opcode[i]==0x3a) { // SWC2
3801 #if defined(HOST_IMM8)
3802 int ir=get_reg(i_regs->regmap,INVCP);
3804 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3806 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3808 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3809 emit_callne(invalidate_addr_reg[ar]);
3813 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3816 if (opcode[i]==0x32) { // LWC2
3817 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3821 #ifndef multdiv_assemble
3822 void multdiv_assemble(int i,struct regstat *i_regs)
3824 printf("Need multdiv_assemble for this architecture.\n");
3829 void mov_assemble(int i,struct regstat *i_regs)
3831 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3832 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3834 signed char sh,sl,th,tl;
3835 th=get_reg(i_regs->regmap,rt1[i]|64);
3836 tl=get_reg(i_regs->regmap,rt1[i]);
3839 sh=get_reg(i_regs->regmap,rs1[i]|64);
3840 sl=get_reg(i_regs->regmap,rs1[i]);
3841 if(sl>=0) emit_mov(sl,tl);
3842 else emit_loadreg(rs1[i],tl);
3844 if(sh>=0) emit_mov(sh,th);
3845 else emit_loadreg(rs1[i]|64,th);
3851 #ifndef fconv_assemble
3852 void fconv_assemble(int i,struct regstat *i_regs)
3854 printf("Need fconv_assemble for this architecture.\n");
3860 void float_assemble(int i,struct regstat *i_regs)
3862 printf("Need float_assemble for this architecture.\n");
3867 void syscall_assemble(int i,struct regstat *i_regs)
3869 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3870 assert(ccreg==HOST_CCREG);
3871 assert(!is_delayslot);
3872 emit_movimm(start+i*4,EAX); // Get PC
3873 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3874 emit_jmp((int)jump_syscall_hle); // XXX
3877 void hlecall_assemble(int i,struct regstat *i_regs)
3879 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3880 assert(ccreg==HOST_CCREG);
3881 assert(!is_delayslot);
3882 emit_movimm(start+i*4+4,0); // Get PC
3883 emit_movimm((int)psxHLEt[source[i]&7],1);
3884 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // XXX
3885 emit_jmp((int)jump_hlecall);
3888 void intcall_assemble(int i,struct regstat *i_regs)
3890 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3891 assert(ccreg==HOST_CCREG);
3892 assert(!is_delayslot);
3893 emit_movimm(start+i*4,0); // Get PC
3894 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG);
3895 emit_jmp((int)jump_intcall);
3898 void ds_assemble(int i,struct regstat *i_regs)
3903 alu_assemble(i,i_regs);break;
3905 imm16_assemble(i,i_regs);break;
3907 shift_assemble(i,i_regs);break;
3909 shiftimm_assemble(i,i_regs);break;
3911 load_assemble(i,i_regs);break;
3913 loadlr_assemble(i,i_regs);break;
3915 store_assemble(i,i_regs);break;
3917 storelr_assemble(i,i_regs);break;
3919 cop0_assemble(i,i_regs);break;
3921 cop1_assemble(i,i_regs);break;
3923 c1ls_assemble(i,i_regs);break;
3925 cop2_assemble(i,i_regs);break;
3927 c2ls_assemble(i,i_regs);break;
3929 c2op_assemble(i,i_regs);break;
3931 fconv_assemble(i,i_regs);break;
3933 float_assemble(i,i_regs);break;
3935 fcomp_assemble(i,i_regs);break;
3937 multdiv_assemble(i,i_regs);break;
3939 mov_assemble(i,i_regs);break;
3949 printf("Jump in the delay slot. This is probably a bug.\n");
3954 // Is the branch target a valid internal jump?
3955 int internal_branch(uint64_t i_is32,int addr)
3957 if(addr&1) return 0; // Indirect (register) jump
3958 if(addr>=start && addr<start+slen*4-4)
3960 int t=(addr-start)>>2;
3961 // Delay slots are not valid branch targets
3962 //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;
3963 // 64 -> 32 bit transition requires a recompile
3964 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
3966 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
3967 else printf("optimizable: yes\n");
3969 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
3971 if(requires_32bit[t]&~i_is32) return 0;
3979 #ifndef wb_invalidate
3980 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
3981 uint64_t u,uint64_t uu)
3984 for(hr=0;hr<HOST_REGS;hr++) {
3985 if(hr!=EXCLUDE_REG) {
3986 if(pre[hr]!=entry[hr]) {
3989 if(get_reg(entry,pre[hr])<0) {
3991 if(!((u>>pre[hr])&1)) {
3992 emit_storereg(pre[hr],hr);
3993 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
3994 emit_sarimm(hr,31,hr);
3995 emit_storereg(pre[hr]|64,hr);
3999 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
4000 emit_storereg(pre[hr],hr);
4009 // Move from one register to another (no writeback)
4010 for(hr=0;hr<HOST_REGS;hr++) {
4011 if(hr!=EXCLUDE_REG) {
4012 if(pre[hr]!=entry[hr]) {
4013 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
4015 if((nr=get_reg(entry,pre[hr]))>=0) {
4025 // Load the specified registers
4026 // This only loads the registers given as arguments because
4027 // we don't want to load things that will be overwritten
4028 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
4032 for(hr=0;hr<HOST_REGS;hr++) {
4033 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4034 if(entry[hr]!=regmap[hr]) {
4035 if(regmap[hr]==rs1||regmap[hr]==rs2)
4042 emit_loadreg(regmap[hr],hr);
4049 for(hr=0;hr<HOST_REGS;hr++) {
4050 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4051 if(entry[hr]!=regmap[hr]) {
4052 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
4054 assert(regmap[hr]!=64);
4055 if((is32>>(regmap[hr]&63))&1) {
4056 int lr=get_reg(regmap,regmap[hr]-64);
4058 emit_sarimm(lr,31,hr);
4060 emit_loadreg(regmap[hr],hr);
4064 emit_loadreg(regmap[hr],hr);
4072 // Load registers prior to the start of a loop
4073 // so that they are not loaded within the loop
4074 static void loop_preload(signed char pre[],signed char entry[])
4077 for(hr=0;hr<HOST_REGS;hr++) {
4078 if(hr!=EXCLUDE_REG) {
4079 if(pre[hr]!=entry[hr]) {
4081 if(get_reg(pre,entry[hr])<0) {
4082 assem_debug("loop preload:\n");
4083 //printf("loop preload: %d\n",hr);
4087 else if(entry[hr]<TEMPREG)
4089 emit_loadreg(entry[hr],hr);
4091 else if(entry[hr]-64<TEMPREG)
4093 emit_loadreg(entry[hr],hr);
4102 // Generate address for load/store instruction
4103 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
4104 void address_generation(int i,struct regstat *i_regs,signed char entry[])
4106 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
4108 int agr=AGEN1+(i&1);
4109 int mgr=MGEN1+(i&1);
4110 if(itype[i]==LOAD) {
4111 ra=get_reg(i_regs->regmap,rt1[i]);
4112 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4115 if(itype[i]==LOADLR) {
4116 ra=get_reg(i_regs->regmap,FTEMP);
4118 if(itype[i]==STORE||itype[i]==STORELR) {
4119 ra=get_reg(i_regs->regmap,agr);
4120 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4122 if(itype[i]==C1LS||itype[i]==C2LS) {
4123 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
4124 ra=get_reg(i_regs->regmap,FTEMP);
4125 else { // SWC1/SDC1/SWC2/SDC2
4126 ra=get_reg(i_regs->regmap,agr);
4127 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4130 int rs=get_reg(i_regs->regmap,rs1[i]);
4131 int rm=get_reg(i_regs->regmap,TLREG);
4134 int c=(i_regs->wasconst>>rs)&1;
4136 // Using r0 as a base address
4138 if(!entry||entry[rm]!=mgr) {
4139 generate_map_const(offset,rm);
4140 } // else did it in the previous cycle
4142 if(!entry||entry[ra]!=agr) {
4143 if (opcode[i]==0x22||opcode[i]==0x26) {
4144 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4145 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4146 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4148 emit_movimm(offset,ra);
4150 } // else did it in the previous cycle
4153 if(!entry||entry[ra]!=rs1[i])
4154 emit_loadreg(rs1[i],ra);
4155 //if(!entry||entry[ra]!=rs1[i])
4156 // printf("poor load scheduling!\n");
4160 if(!entry||entry[rm]!=mgr) {
4161 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4162 // Stores to memory go thru the mapper to detect self-modifying
4163 // code, loads don't.
4164 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4165 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4166 generate_map_const(constmap[i][rs]+offset,rm);
4168 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4169 generate_map_const(constmap[i][rs]+offset,rm);
4173 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4174 if(!entry||entry[ra]!=agr) {
4175 if (opcode[i]==0x22||opcode[i]==0x26) {
4176 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4177 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4178 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4180 #ifdef HOST_IMM_ADDR32
4181 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4182 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4184 emit_movimm(constmap[i][rs]+offset,ra);
4186 } // else did it in the previous cycle
4187 } // else load_consts already did it
4189 if(offset&&!c&&rs1[i]) {
4191 emit_addimm(rs,offset,ra);
4193 emit_addimm(ra,offset,ra);
4198 // Preload constants for next instruction
4199 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) {
4201 #ifndef HOST_IMM_ADDR32
4203 agr=MGEN1+((i+1)&1);
4204 ra=get_reg(i_regs->regmap,agr);
4206 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4207 int offset=imm[i+1];
4208 int c=(regs[i+1].wasconst>>rs)&1;
4210 if(itype[i+1]==STORE||itype[i+1]==STORELR
4211 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4212 // Stores to memory go thru the mapper to detect self-modifying
4213 // code, loads don't.
4214 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4215 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4216 generate_map_const(constmap[i+1][rs]+offset,ra);
4218 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4219 generate_map_const(constmap[i+1][rs]+offset,ra);
4222 /*else if(rs1[i]==0) {
4223 generate_map_const(offset,ra);
4228 agr=AGEN1+((i+1)&1);
4229 ra=get_reg(i_regs->regmap,agr);
4231 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4232 int offset=imm[i+1];
4233 int c=(regs[i+1].wasconst>>rs)&1;
4234 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4235 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4236 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4237 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4238 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4240 #ifdef HOST_IMM_ADDR32
4241 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4242 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4244 emit_movimm(constmap[i+1][rs]+offset,ra);
4247 else if(rs1[i+1]==0) {
4248 // Using r0 as a base address
4249 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4250 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4251 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4252 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4254 emit_movimm(offset,ra);
4261 int get_final_value(int hr, int i, int *value)
4263 int reg=regs[i].regmap[hr];
4265 if(regs[i+1].regmap[hr]!=reg) break;
4266 if(!((regs[i+1].isconst>>hr)&1)) break;
4271 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4272 *value=constmap[i][hr];
4276 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4277 // Load in delay slot, out-of-order execution
4278 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4280 #ifdef HOST_IMM_ADDR32
4281 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4283 // Precompute load address
4284 *value=constmap[i][hr]+imm[i+2];
4288 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4290 #ifdef HOST_IMM_ADDR32
4291 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4293 // Precompute load address
4294 *value=constmap[i][hr]+imm[i+1];
4295 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4300 *value=constmap[i][hr];
4301 //printf("c=%x\n",(int)constmap[i][hr]);
4302 if(i==slen-1) return 1;
4304 return !((unneeded_reg[i+1]>>reg)&1);
4306 return !((unneeded_reg_upper[i+1]>>reg)&1);
4310 // Load registers with known constants
4311 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4315 for(hr=0;hr<HOST_REGS;hr++) {
4316 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4317 //if(entry[hr]!=regmap[hr]) {
4318 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4319 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4321 if(get_final_value(hr,i,&value)) {
4326 emit_movimm(value,hr);
4334 for(hr=0;hr<HOST_REGS;hr++) {
4335 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4336 //if(entry[hr]!=regmap[hr]) {
4337 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4338 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4339 if((is32>>(regmap[hr]&63))&1) {
4340 int lr=get_reg(regmap,regmap[hr]-64);
4342 emit_sarimm(lr,31,hr);
4347 if(get_final_value(hr,i,&value)) {
4352 emit_movimm(value,hr);
4361 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4365 for(hr=0;hr<HOST_REGS;hr++) {
4366 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4367 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4368 int value=constmap[i][hr];
4373 emit_movimm(value,hr);
4379 for(hr=0;hr<HOST_REGS;hr++) {
4380 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4381 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4382 if((is32>>(regmap[hr]&63))&1) {
4383 int lr=get_reg(regmap,regmap[hr]-64);
4385 emit_sarimm(lr,31,hr);
4389 int value=constmap[i][hr];
4394 emit_movimm(value,hr);
4402 // Write out all dirty registers (except cycle count)
4403 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4406 for(hr=0;hr<HOST_REGS;hr++) {
4407 if(hr!=EXCLUDE_REG) {
4408 if(i_regmap[hr]>0) {
4409 if(i_regmap[hr]!=CCREG) {
4410 if((i_dirty>>hr)&1) {
4411 if(i_regmap[hr]<64) {
4412 emit_storereg(i_regmap[hr],hr);
4414 if( ((i_is32>>i_regmap[hr])&1) ) {
4415 #ifdef DESTRUCTIVE_WRITEBACK
4416 emit_sarimm(hr,31,hr);
4417 emit_storereg(i_regmap[hr]|64,hr);
4419 emit_sarimm(hr,31,HOST_TEMPREG);
4420 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4425 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4426 emit_storereg(i_regmap[hr],hr);
4435 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4436 // This writes the registers not written by store_regs_bt
4437 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4440 int t=(addr-start)>>2;
4441 for(hr=0;hr<HOST_REGS;hr++) {
4442 if(hr!=EXCLUDE_REG) {
4443 if(i_regmap[hr]>0) {
4444 if(i_regmap[hr]!=CCREG) {
4445 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)) {
4446 if((i_dirty>>hr)&1) {
4447 if(i_regmap[hr]<64) {
4448 emit_storereg(i_regmap[hr],hr);
4450 if( ((i_is32>>i_regmap[hr])&1) ) {
4451 #ifdef DESTRUCTIVE_WRITEBACK
4452 emit_sarimm(hr,31,hr);
4453 emit_storereg(i_regmap[hr]|64,hr);
4455 emit_sarimm(hr,31,HOST_TEMPREG);
4456 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4461 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4462 emit_storereg(i_regmap[hr],hr);
4473 // Load all registers (except cycle count)
4474 void load_all_regs(signed char i_regmap[])
4477 for(hr=0;hr<HOST_REGS;hr++) {
4478 if(hr!=EXCLUDE_REG) {
4479 if(i_regmap[hr]==0) {
4483 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4485 emit_loadreg(i_regmap[hr],hr);
4491 // Load all current registers also needed by next instruction
4492 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4495 for(hr=0;hr<HOST_REGS;hr++) {
4496 if(hr!=EXCLUDE_REG) {
4497 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4498 if(i_regmap[hr]==0) {
4502 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4504 emit_loadreg(i_regmap[hr],hr);
4511 // Load all regs, storing cycle count if necessary
4512 void load_regs_entry(int t)
4515 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER,HOST_CCREG);
4516 else if(ccadj[t]) emit_addimm(HOST_CCREG,-ccadj[t]*CLOCK_DIVIDER,HOST_CCREG);
4517 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4518 emit_storereg(CCREG,HOST_CCREG);
4521 for(hr=0;hr<HOST_REGS;hr++) {
4522 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4523 if(regs[t].regmap_entry[hr]==0) {
4526 else if(regs[t].regmap_entry[hr]!=CCREG)
4528 emit_loadreg(regs[t].regmap_entry[hr],hr);
4533 for(hr=0;hr<HOST_REGS;hr++) {
4534 if(regs[t].regmap_entry[hr]>=64) {
4535 assert(regs[t].regmap_entry[hr]!=64);
4536 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4537 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4539 emit_loadreg(regs[t].regmap_entry[hr],hr);
4543 emit_sarimm(lr,31,hr);
4548 emit_loadreg(regs[t].regmap_entry[hr],hr);
4554 // Store dirty registers prior to branch
4555 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4557 if(internal_branch(i_is32,addr))
4559 int t=(addr-start)>>2;
4561 for(hr=0;hr<HOST_REGS;hr++) {
4562 if(hr!=EXCLUDE_REG) {
4563 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4564 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)) {
4565 if((i_dirty>>hr)&1) {
4566 if(i_regmap[hr]<64) {
4567 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4568 emit_storereg(i_regmap[hr],hr);
4569 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4570 #ifdef DESTRUCTIVE_WRITEBACK
4571 emit_sarimm(hr,31,hr);
4572 emit_storereg(i_regmap[hr]|64,hr);
4574 emit_sarimm(hr,31,HOST_TEMPREG);
4575 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4580 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4581 emit_storereg(i_regmap[hr],hr);
4592 // Branch out of this block, write out all dirty regs
4593 wb_dirtys(i_regmap,i_is32,i_dirty);
4597 // Load all needed registers for branch target
4598 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4600 //if(addr>=start && addr<(start+slen*4))
4601 if(internal_branch(i_is32,addr))
4603 int t=(addr-start)>>2;
4605 // Store the cycle count before loading something else
4606 if(i_regmap[HOST_CCREG]!=CCREG) {
4607 assert(i_regmap[HOST_CCREG]==-1);
4609 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4610 emit_storereg(CCREG,HOST_CCREG);
4613 for(hr=0;hr<HOST_REGS;hr++) {
4614 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4615 #ifdef DESTRUCTIVE_WRITEBACK
4616 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)) {
4618 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4620 if(regs[t].regmap_entry[hr]==0) {
4623 else if(regs[t].regmap_entry[hr]!=CCREG)
4625 emit_loadreg(regs[t].regmap_entry[hr],hr);
4631 for(hr=0;hr<HOST_REGS;hr++) {
4632 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64) {
4633 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4634 assert(regs[t].regmap_entry[hr]!=64);
4635 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4636 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4638 emit_loadreg(regs[t].regmap_entry[hr],hr);
4642 emit_sarimm(lr,31,hr);
4647 emit_loadreg(regs[t].regmap_entry[hr],hr);
4650 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4651 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4653 emit_sarimm(lr,31,hr);
4660 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4662 if(addr>=start && addr<start+slen*4-4)
4664 int t=(addr-start)>>2;
4666 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4667 for(hr=0;hr<HOST_REGS;hr++)
4671 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4673 if(regs[t].regmap_entry[hr]!=-1)
4682 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4687 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4692 else // Same register but is it 32-bit or dirty?
4695 if(!((regs[t].dirty>>hr)&1))
4699 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4701 //printf("%x: dirty no match\n",addr);
4706 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4708 //printf("%x: is32 no match\n",addr);
4714 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4716 if(requires_32bit[t]&~i_is32) return 0;
4718 // Delay slots are not valid branch targets
4719 //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;
4720 // Delay slots require additional processing, so do not match
4721 if(is_ds[t]) return 0;
4726 for(hr=0;hr<HOST_REGS;hr++)
4732 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4746 // Used when a branch jumps into the delay slot of another branch
4747 void ds_assemble_entry(int i)
4749 int t=(ba[i]-start)>>2;
4750 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4751 assem_debug("Assemble delay slot at %x\n",ba[i]);
4752 assem_debug("<->\n");
4753 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4754 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4755 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4756 address_generation(t,®s[t],regs[t].regmap_entry);
4757 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4758 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4763 alu_assemble(t,®s[t]);break;
4765 imm16_assemble(t,®s[t]);break;
4767 shift_assemble(t,®s[t]);break;
4769 shiftimm_assemble(t,®s[t]);break;
4771 load_assemble(t,®s[t]);break;
4773 loadlr_assemble(t,®s[t]);break;
4775 store_assemble(t,®s[t]);break;
4777 storelr_assemble(t,®s[t]);break;
4779 cop0_assemble(t,®s[t]);break;
4781 cop1_assemble(t,®s[t]);break;
4783 c1ls_assemble(t,®s[t]);break;
4785 cop2_assemble(t,®s[t]);break;
4787 c2ls_assemble(t,®s[t]);break;
4789 c2op_assemble(t,®s[t]);break;
4791 fconv_assemble(t,®s[t]);break;
4793 float_assemble(t,®s[t]);break;
4795 fcomp_assemble(t,®s[t]);break;
4797 multdiv_assemble(t,®s[t]);break;
4799 mov_assemble(t,®s[t]);break;
4809 printf("Jump in the delay slot. This is probably a bug.\n");
4811 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4812 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4813 if(internal_branch(regs[t].is32,ba[i]+4))
4814 assem_debug("branch: internal\n");
4816 assem_debug("branch: external\n");
4817 assert(internal_branch(regs[t].is32,ba[i]+4));
4818 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4822 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4831 //if(ba[i]>=start && ba[i]<(start+slen*4))
4832 if(internal_branch(branch_regs[i].is32,ba[i]))
4834 int t=(ba[i]-start)>>2;
4835 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4843 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4845 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4847 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4848 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4852 else if(*adj==0||invert) {
4853 emit_addimm_and_set_flags(CLOCK_DIVIDER*(count+2),HOST_CCREG);
4859 emit_cmpimm(HOST_CCREG,-2*(count+2));
4863 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4866 void do_ccstub(int n)
4869 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4870 set_jump_target(stubs[n][1],(int)out);
4872 if(stubs[n][6]==NULLDS) {
4873 // Delay slot instruction is nullified ("likely" branch)
4874 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4876 else if(stubs[n][6]!=TAKEN) {
4877 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4880 if(internal_branch(branch_regs[i].is32,ba[i]))
4881 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4885 // Save PC as return address
4886 emit_movimm(stubs[n][5],EAX);
4887 emit_writeword(EAX,(int)&pcaddr);
4891 // Return address depends on which way the branch goes
4892 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4894 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4895 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4896 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4897 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
4907 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
4911 #ifdef DESTRUCTIVE_WRITEBACK
4913 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
4914 emit_loadreg(rs1[i],s1l);
4917 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
4918 emit_loadreg(rs2[i],s1l);
4921 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
4922 emit_loadreg(rs2[i],s2l);
4925 int addr=-1,alt=-1,ntaddr=-1;
4928 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4929 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4930 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4938 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4939 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4940 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4946 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
4950 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4951 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4952 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4958 assert(hr<HOST_REGS);
4960 if((opcode[i]&0x2f)==4) // BEQ
4962 #ifdef HAVE_CMOV_IMM
4964 if(s2l>=0) emit_cmp(s1l,s2l);
4965 else emit_test(s1l,s1l);
4966 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
4971 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4973 if(s2h>=0) emit_cmp(s1h,s2h);
4974 else emit_test(s1h,s1h);
4975 emit_cmovne_reg(alt,addr);
4977 if(s2l>=0) emit_cmp(s1l,s2l);
4978 else emit_test(s1l,s1l);
4979 emit_cmovne_reg(alt,addr);
4982 if((opcode[i]&0x2f)==5) // BNE
4984 #ifdef HAVE_CMOV_IMM
4986 if(s2l>=0) emit_cmp(s1l,s2l);
4987 else emit_test(s1l,s1l);
4988 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
4993 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
4995 if(s2h>=0) emit_cmp(s1h,s2h);
4996 else emit_test(s1h,s1h);
4997 emit_cmovne_reg(alt,addr);
4999 if(s2l>=0) emit_cmp(s1l,s2l);
5000 else emit_test(s1l,s1l);
5001 emit_cmovne_reg(alt,addr);
5004 if((opcode[i]&0x2f)==6) // BLEZ
5006 //emit_movimm(ba[i],alt);
5007 //emit_movimm(start+i*4+8,addr);
5008 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5010 if(s1h>=0) emit_mov(addr,ntaddr);
5011 emit_cmovl_reg(alt,addr);
5014 emit_cmovne_reg(ntaddr,addr);
5015 emit_cmovs_reg(alt,addr);
5018 if((opcode[i]&0x2f)==7) // BGTZ
5020 //emit_movimm(ba[i],addr);
5021 //emit_movimm(start+i*4+8,ntaddr);
5022 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
5024 if(s1h>=0) emit_mov(addr,alt);
5025 emit_cmovl_reg(ntaddr,addr);
5028 emit_cmovne_reg(alt,addr);
5029 emit_cmovs_reg(ntaddr,addr);
5032 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
5034 //emit_movimm(ba[i],alt);
5035 //emit_movimm(start+i*4+8,addr);
5036 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5037 if(s1h>=0) emit_test(s1h,s1h);
5038 else emit_test(s1l,s1l);
5039 emit_cmovs_reg(alt,addr);
5041 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
5043 //emit_movimm(ba[i],addr);
5044 //emit_movimm(start+i*4+8,alt);
5045 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5046 if(s1h>=0) emit_test(s1h,s1h);
5047 else emit_test(s1l,s1l);
5048 emit_cmovs_reg(alt,addr);
5050 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
5051 if(source[i]&0x10000) // BC1T
5053 //emit_movimm(ba[i],alt);
5054 //emit_movimm(start+i*4+8,addr);
5055 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5056 emit_testimm(s1l,0x800000);
5057 emit_cmovne_reg(alt,addr);
5061 //emit_movimm(ba[i],addr);
5062 //emit_movimm(start+i*4+8,alt);
5063 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5064 emit_testimm(s1l,0x800000);
5065 emit_cmovne_reg(alt,addr);
5068 emit_writeword(addr,(int)&pcaddr);
5073 int r=get_reg(branch_regs[i].regmap,rs1[i]);
5074 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5075 r=get_reg(branch_regs[i].regmap,RTEMP);
5077 emit_writeword(r,(int)&pcaddr);
5079 else {printf("Unknown branch type in do_ccstub\n");exit(1);}
5081 // Update cycle count
5082 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
5083 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5084 emit_call((int)cc_interrupt);
5085 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5086 if(stubs[n][6]==TAKEN) {
5087 if(internal_branch(branch_regs[i].is32,ba[i]))
5088 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
5089 else if(itype[i]==RJUMP) {
5090 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
5091 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
5093 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
5095 }else if(stubs[n][6]==NOTTAKEN) {
5096 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
5097 else load_all_regs(branch_regs[i].regmap);
5098 }else if(stubs[n][6]==NULLDS) {
5099 // Delay slot instruction is nullified ("likely" branch)
5100 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
5101 else load_all_regs(regs[i].regmap);
5103 load_all_regs(branch_regs[i].regmap);
5105 emit_jmp(stubs[n][2]); // return address
5107 /* This works but uses a lot of memory...
5108 emit_readword((int)&last_count,ECX);
5109 emit_add(HOST_CCREG,ECX,EAX);
5110 emit_writeword(EAX,(int)&Count);
5111 emit_call((int)gen_interupt);
5112 emit_readword((int)&Count,HOST_CCREG);
5113 emit_readword((int)&next_interupt,EAX);
5114 emit_readword((int)&pending_exception,EBX);
5115 emit_writeword(EAX,(int)&last_count);
5116 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
5118 int jne_instr=(int)out;
5120 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
5121 load_all_regs(branch_regs[i].regmap);
5122 emit_jmp(stubs[n][2]); // return address
5123 set_jump_target(jne_instr,(int)out);
5124 emit_readword((int)&pcaddr,EAX);
5125 // Call get_addr_ht instead of doing the hash table here.
5126 // This code is executed infrequently and takes up a lot of space
5127 // so smaller is better.
5128 emit_storereg(CCREG,HOST_CCREG);
5130 emit_call((int)get_addr_ht);
5131 emit_loadreg(CCREG,HOST_CCREG);
5132 emit_addimm(ESP,4,ESP);
5136 add_to_linker(int addr,int target,int ext)
5138 link_addr[linkcount][0]=addr;
5139 link_addr[linkcount][1]=target;
5140 link_addr[linkcount][2]=ext;
5144 void ujump_assemble(int i,struct regstat *i_regs)
5146 signed char *i_regmap=i_regs->regmap;
5147 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5148 address_generation(i+1,i_regs,regs[i].regmap_entry);
5150 int temp=get_reg(branch_regs[i].regmap,PTEMP);
5151 if(rt1[i]==31&&temp>=0)
5153 int return_address=start+i*4+8;
5154 if(get_reg(branch_regs[i].regmap,31)>0)
5155 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5160 unsigned int return_address;
5161 rt=get_reg(branch_regs[i].regmap,31);
5162 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]);
5164 return_address=start+i*4+8;
5167 if(internal_branch(branch_regs[i].is32,return_address)&&rt1[i+1]!=31) {
5168 int temp=-1; // note: must be ds-safe
5172 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5173 else emit_movimm(return_address,rt);
5181 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5184 emit_movimm(return_address,rt); // PC into link register
5186 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5191 ds_assemble(i+1,i_regs);
5192 uint64_t bc_unneeded=branch_regs[i].u;
5193 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5194 bc_unneeded|=1|(1LL<<rt1[i]);
5195 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5196 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5197 bc_unneeded,bc_unneeded_upper);
5198 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5200 cc=get_reg(branch_regs[i].regmap,CCREG);
5201 assert(cc==HOST_CCREG);
5202 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5204 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5206 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5207 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5208 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5209 if(internal_branch(branch_regs[i].is32,ba[i]))
5210 assem_debug("branch: internal\n");
5212 assem_debug("branch: external\n");
5213 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5214 ds_assemble_entry(i);
5217 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5222 void rjump_assemble(int i,struct regstat *i_regs)
5224 signed char *i_regmap=i_regs->regmap;
5227 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5229 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5230 // Delay slot abuse, make a copy of the branch address register
5231 temp=get_reg(branch_regs[i].regmap,RTEMP);
5233 assert(regs[i].regmap[temp]==RTEMP);
5237 address_generation(i+1,i_regs,regs[i].regmap_entry);
5241 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5242 int return_address=start+i*4+8;
5243 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5249 int rh=get_reg(regs[i].regmap,RHASH);
5250 if(rh>=0) do_preload_rhash(rh);
5253 ds_assemble(i+1,i_regs);
5254 uint64_t bc_unneeded=branch_regs[i].u;
5255 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5256 bc_unneeded|=1|(1LL<<rt1[i]);
5257 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5258 bc_unneeded&=~(1LL<<rs1[i]);
5259 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5260 bc_unneeded,bc_unneeded_upper);
5261 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5263 int rt,return_address;
5264 assert(rt1[i+1]!=rt1[i]);
5265 assert(rt2[i+1]!=rt1[i]);
5266 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5267 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]);
5269 return_address=start+i*4+8;
5273 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5276 emit_movimm(return_address,rt); // PC into link register
5278 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5281 cc=get_reg(branch_regs[i].regmap,CCREG);
5282 assert(cc==HOST_CCREG);
5284 int rh=get_reg(branch_regs[i].regmap,RHASH);
5285 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5287 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5288 do_preload_rhtbl(ht);
5292 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5293 #ifdef DESTRUCTIVE_WRITEBACK
5294 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5295 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5296 emit_loadreg(rs1[i],rs);
5301 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5305 do_miniht_load(ht,rh);
5308 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5309 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5311 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5312 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5314 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5317 do_miniht_jump(rs,rh,ht);
5322 //if(rs!=EAX) emit_mov(rs,EAX);
5323 //emit_jmp((int)jump_vaddr_eax);
5324 emit_jmp(jump_vaddr_reg[rs]);
5329 emit_shrimm(rs,16,rs);
5330 emit_xor(temp,rs,rs);
5331 emit_movzwl_reg(rs,rs);
5332 emit_shlimm(rs,4,rs);
5333 emit_cmpmem_indexed((int)hash_table,rs,temp);
5334 emit_jne((int)out+14);
5335 emit_readword_indexed((int)hash_table+4,rs,rs);
5337 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5338 emit_addimm_no_flags(8,rs);
5339 emit_jeq((int)out-17);
5340 // No hit on hash table, call compiler
5343 #ifdef DEBUG_CYCLE_COUNT
5344 emit_readword((int)&last_count,ECX);
5345 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5346 emit_readword((int)&next_interupt,ECX);
5347 emit_writeword(HOST_CCREG,(int)&Count);
5348 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5349 emit_writeword(ECX,(int)&last_count);
5352 emit_storereg(CCREG,HOST_CCREG);
5353 emit_call((int)get_addr);
5354 emit_loadreg(CCREG,HOST_CCREG);
5355 emit_addimm(ESP,4,ESP);
5357 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5358 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5362 void cjump_assemble(int i,struct regstat *i_regs)
5364 signed char *i_regmap=i_regs->regmap;
5367 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5368 assem_debug("match=%d\n",match);
5369 int s1h,s1l,s2h,s2l;
5370 int prev_cop1_usable=cop1_usable;
5371 int unconditional=0,nop=0;
5374 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5375 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5376 if(!match) invert=1;
5377 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5378 if(i>(ba[i]-start)>>2) invert=1;
5382 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5383 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5384 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5385 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5388 s1l=get_reg(i_regmap,rs1[i]);
5389 s1h=get_reg(i_regmap,rs1[i]|64);
5390 s2l=get_reg(i_regmap,rs2[i]);
5391 s2h=get_reg(i_regmap,rs2[i]|64);
5393 if(rs1[i]==0&&rs2[i]==0)
5395 if(opcode[i]&1) nop=1;
5396 else unconditional=1;
5397 //assert(opcode[i]!=5);
5398 //assert(opcode[i]!=7);
5399 //assert(opcode[i]!=0x15);
5400 //assert(opcode[i]!=0x17);
5406 only32=(regs[i].was32>>rs2[i])&1;
5411 only32=(regs[i].was32>>rs1[i])&1;
5414 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5418 // Out of order execution (delay slot first)
5420 address_generation(i+1,i_regs,regs[i].regmap_entry);
5421 ds_assemble(i+1,i_regs);
5423 uint64_t bc_unneeded=branch_regs[i].u;
5424 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5425 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5426 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5428 bc_unneeded_upper|=1;
5429 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5430 bc_unneeded,bc_unneeded_upper);
5431 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5432 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5433 cc=get_reg(branch_regs[i].regmap,CCREG);
5434 assert(cc==HOST_CCREG);
5436 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5437 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5438 //assem_debug("cycle count (adj)\n");
5440 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5441 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5442 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5443 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5445 assem_debug("branch: internal\n");
5447 assem_debug("branch: external\n");
5448 if(internal&&is_ds[(ba[i]-start)>>2]) {
5449 ds_assemble_entry(i);
5452 add_to_linker((int)out,ba[i],internal);
5455 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5456 if(((u_int)out)&7) emit_addnop(0);
5461 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5464 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5467 int taken=0,nottaken=0,nottaken1=0;
5468 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5469 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5473 if(opcode[i]==4) // BEQ
5475 if(s2h>=0) emit_cmp(s1h,s2h);
5476 else emit_test(s1h,s1h);
5480 if(opcode[i]==5) // BNE
5482 if(s2h>=0) emit_cmp(s1h,s2h);
5483 else emit_test(s1h,s1h);
5484 if(invert) taken=(int)out;
5485 else add_to_linker((int)out,ba[i],internal);
5488 if(opcode[i]==6) // BLEZ
5491 if(invert) taken=(int)out;
5492 else add_to_linker((int)out,ba[i],internal);
5497 if(opcode[i]==7) // BGTZ
5502 if(invert) taken=(int)out;
5503 else add_to_linker((int)out,ba[i],internal);
5508 //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]);
5510 if(opcode[i]==4) // BEQ
5512 if(s2l>=0) emit_cmp(s1l,s2l);
5513 else emit_test(s1l,s1l);
5518 add_to_linker((int)out,ba[i],internal);
5522 if(opcode[i]==5) // BNE
5524 if(s2l>=0) emit_cmp(s1l,s2l);
5525 else emit_test(s1l,s1l);
5530 add_to_linker((int)out,ba[i],internal);
5534 if(opcode[i]==6) // BLEZ
5541 add_to_linker((int)out,ba[i],internal);
5545 if(opcode[i]==7) // BGTZ
5552 add_to_linker((int)out,ba[i],internal);
5557 if(taken) set_jump_target(taken,(int)out);
5558 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5559 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5561 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5562 add_to_linker((int)out,ba[i],internal);
5565 add_to_linker((int)out,ba[i],internal*2);
5571 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5572 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5573 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5575 assem_debug("branch: internal\n");
5577 assem_debug("branch: external\n");
5578 if(internal&&is_ds[(ba[i]-start)>>2]) {
5579 ds_assemble_entry(i);
5582 add_to_linker((int)out,ba[i],internal);
5586 set_jump_target(nottaken,(int)out);
5589 if(nottaken1) set_jump_target(nottaken1,(int)out);
5591 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5593 } // (!unconditional)
5597 // In-order execution (branch first)
5598 //if(likely[i]) printf("IOL\n");
5601 int taken=0,nottaken=0,nottaken1=0;
5602 if(!unconditional&&!nop) {
5606 if((opcode[i]&0x2f)==4) // BEQ
5608 if(s2h>=0) emit_cmp(s1h,s2h);
5609 else emit_test(s1h,s1h);
5613 if((opcode[i]&0x2f)==5) // BNE
5615 if(s2h>=0) emit_cmp(s1h,s2h);
5616 else emit_test(s1h,s1h);
5620 if((opcode[i]&0x2f)==6) // BLEZ
5628 if((opcode[i]&0x2f)==7) // BGTZ
5638 //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]);
5640 if((opcode[i]&0x2f)==4) // BEQ
5642 if(s2l>=0) emit_cmp(s1l,s2l);
5643 else emit_test(s1l,s1l);
5647 if((opcode[i]&0x2f)==5) // BNE
5649 if(s2l>=0) emit_cmp(s1l,s2l);
5650 else emit_test(s1l,s1l);
5654 if((opcode[i]&0x2f)==6) // BLEZ
5660 if((opcode[i]&0x2f)==7) // BGTZ
5666 } // if(!unconditional)
5668 uint64_t ds_unneeded=branch_regs[i].u;
5669 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5670 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5671 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5672 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5674 ds_unneeded_upper|=1;
5677 if(taken) set_jump_target(taken,(int)out);
5678 assem_debug("1:\n");
5679 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5680 ds_unneeded,ds_unneeded_upper);
5682 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5683 address_generation(i+1,&branch_regs[i],0);
5684 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5685 ds_assemble(i+1,&branch_regs[i]);
5686 cc=get_reg(branch_regs[i].regmap,CCREG);
5688 emit_loadreg(CCREG,cc=HOST_CCREG);
5689 // CHECK: Is the following instruction (fall thru) allocated ok?
5691 assert(cc==HOST_CCREG);
5692 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5693 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5694 assem_debug("cycle count (adj)\n");
5695 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5696 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5698 assem_debug("branch: internal\n");
5700 assem_debug("branch: external\n");
5701 if(internal&&is_ds[(ba[i]-start)>>2]) {
5702 ds_assemble_entry(i);
5705 add_to_linker((int)out,ba[i],internal);
5710 cop1_usable=prev_cop1_usable;
5711 if(!unconditional) {
5712 if(nottaken1) set_jump_target(nottaken1,(int)out);
5713 set_jump_target(nottaken,(int)out);
5714 assem_debug("2:\n");
5716 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5717 ds_unneeded,ds_unneeded_upper);
5718 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5719 address_generation(i+1,&branch_regs[i],0);
5720 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5721 ds_assemble(i+1,&branch_regs[i]);
5723 cc=get_reg(branch_regs[i].regmap,CCREG);
5724 if(cc==-1&&!likely[i]) {
5725 // Cycle count isn't in a register, temporarily load it then write it out
5726 emit_loadreg(CCREG,HOST_CCREG);
5727 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5730 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5731 emit_storereg(CCREG,HOST_CCREG);
5734 cc=get_reg(i_regmap,CCREG);
5735 assert(cc==HOST_CCREG);
5736 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5739 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5745 void sjump_assemble(int i,struct regstat *i_regs)
5747 signed char *i_regmap=i_regs->regmap;
5750 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5751 assem_debug("smatch=%d\n",match);
5753 int prev_cop1_usable=cop1_usable;
5754 int unconditional=0,nevertaken=0;
5757 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5758 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5759 if(!match) invert=1;
5760 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5761 if(i>(ba[i]-start)>>2) invert=1;
5764 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5765 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5768 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5769 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5772 s1l=get_reg(i_regmap,rs1[i]);
5773 s1h=get_reg(i_regmap,rs1[i]|64);
5777 if(opcode2[i]&1) unconditional=1;
5779 // These are never taken (r0 is never less than zero)
5780 //assert(opcode2[i]!=0);
5781 //assert(opcode2[i]!=2);
5782 //assert(opcode2[i]!=0x10);
5783 //assert(opcode2[i]!=0x12);
5786 only32=(regs[i].was32>>rs1[i])&1;
5790 // Out of order execution (delay slot first)
5792 address_generation(i+1,i_regs,regs[i].regmap_entry);
5793 ds_assemble(i+1,i_regs);
5795 uint64_t bc_unneeded=branch_regs[i].u;
5796 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5797 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5798 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5800 bc_unneeded_upper|=1;
5801 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5802 bc_unneeded,bc_unneeded_upper);
5803 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5804 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5806 int rt,return_address;
5807 rt=get_reg(branch_regs[i].regmap,31);
5808 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]);
5810 // Save the PC even if the branch is not taken
5811 return_address=start+i*4+8;
5812 emit_movimm(return_address,rt); // PC into link register
5814 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5818 cc=get_reg(branch_regs[i].regmap,CCREG);
5819 assert(cc==HOST_CCREG);
5821 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5822 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5823 assem_debug("cycle count (adj)\n");
5825 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5826 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5827 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5828 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5830 assem_debug("branch: internal\n");
5832 assem_debug("branch: external\n");
5833 if(internal&&is_ds[(ba[i]-start)>>2]) {
5834 ds_assemble_entry(i);
5837 add_to_linker((int)out,ba[i],internal);
5840 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5841 if(((u_int)out)&7) emit_addnop(0);
5845 else if(nevertaken) {
5846 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5849 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5853 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5854 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5858 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5865 add_to_linker((int)out,ba[i],internal);
5869 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5876 add_to_linker((int)out,ba[i],internal);
5884 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5891 add_to_linker((int)out,ba[i],internal);
5895 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5902 add_to_linker((int)out,ba[i],internal);
5909 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5910 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5912 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5913 add_to_linker((int)out,ba[i],internal);
5916 add_to_linker((int)out,ba[i],internal*2);
5922 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5923 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5924 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5926 assem_debug("branch: internal\n");
5928 assem_debug("branch: external\n");
5929 if(internal&&is_ds[(ba[i]-start)>>2]) {
5930 ds_assemble_entry(i);
5933 add_to_linker((int)out,ba[i],internal);
5937 set_jump_target(nottaken,(int)out);
5941 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5943 } // (!unconditional)
5947 // In-order execution (branch first)
5951 int rt,return_address;
5952 rt=get_reg(branch_regs[i].regmap,31);
5954 // Save the PC even if the branch is not taken
5955 return_address=start+i*4+8;
5956 emit_movimm(return_address,rt); // PC into link register
5958 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5962 if(!unconditional) {
5963 //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]);
5967 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5973 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5983 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5989 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5996 } // if(!unconditional)
5998 uint64_t ds_unneeded=branch_regs[i].u;
5999 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6000 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6001 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6002 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6004 ds_unneeded_upper|=1;
6007 //assem_debug("1:\n");
6008 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6009 ds_unneeded,ds_unneeded_upper);
6011 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6012 address_generation(i+1,&branch_regs[i],0);
6013 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6014 ds_assemble(i+1,&branch_regs[i]);
6015 cc=get_reg(branch_regs[i].regmap,CCREG);
6017 emit_loadreg(CCREG,cc=HOST_CCREG);
6018 // CHECK: Is the following instruction (fall thru) allocated ok?
6020 assert(cc==HOST_CCREG);
6021 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6022 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6023 assem_debug("cycle count (adj)\n");
6024 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6025 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6027 assem_debug("branch: internal\n");
6029 assem_debug("branch: external\n");
6030 if(internal&&is_ds[(ba[i]-start)>>2]) {
6031 ds_assemble_entry(i);
6034 add_to_linker((int)out,ba[i],internal);
6039 cop1_usable=prev_cop1_usable;
6040 if(!unconditional) {
6041 set_jump_target(nottaken,(int)out);
6042 assem_debug("1:\n");
6044 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6045 ds_unneeded,ds_unneeded_upper);
6046 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6047 address_generation(i+1,&branch_regs[i],0);
6048 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6049 ds_assemble(i+1,&branch_regs[i]);
6051 cc=get_reg(branch_regs[i].regmap,CCREG);
6052 if(cc==-1&&!likely[i]) {
6053 // Cycle count isn't in a register, temporarily load it then write it out
6054 emit_loadreg(CCREG,HOST_CCREG);
6055 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6058 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6059 emit_storereg(CCREG,HOST_CCREG);
6062 cc=get_reg(i_regmap,CCREG);
6063 assert(cc==HOST_CCREG);
6064 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6067 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6073 void fjump_assemble(int i,struct regstat *i_regs)
6075 signed char *i_regmap=i_regs->regmap;
6078 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6079 assem_debug("fmatch=%d\n",match);
6083 int internal=internal_branch(branch_regs[i].is32,ba[i]);
6084 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
6085 if(!match) invert=1;
6086 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6087 if(i>(ba[i]-start)>>2) invert=1;
6091 fs=get_reg(branch_regs[i].regmap,FSREG);
6092 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
6095 fs=get_reg(i_regmap,FSREG);
6098 // Check cop1 unusable
6100 cs=get_reg(i_regmap,CSREG);
6102 emit_testimm(cs,0x20000000);
6105 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
6110 // Out of order execution (delay slot first)
6112 ds_assemble(i+1,i_regs);
6114 uint64_t bc_unneeded=branch_regs[i].u;
6115 uint64_t bc_unneeded_upper=branch_regs[i].uu;
6116 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6117 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
6119 bc_unneeded_upper|=1;
6120 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6121 bc_unneeded,bc_unneeded_upper);
6122 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
6123 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6124 cc=get_reg(branch_regs[i].regmap,CCREG);
6125 assert(cc==HOST_CCREG);
6126 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6127 assem_debug("cycle count (adj)\n");
6130 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6133 emit_testimm(fs,0x800000);
6134 if(source[i]&0x10000) // BC1T
6140 add_to_linker((int)out,ba[i],internal);
6149 add_to_linker((int)out,ba[i],internal);
6157 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
6158 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6159 else if(match) emit_addnop(13);
6161 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6162 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6164 assem_debug("branch: internal\n");
6166 assem_debug("branch: external\n");
6167 if(internal&&is_ds[(ba[i]-start)>>2]) {
6168 ds_assemble_entry(i);
6171 add_to_linker((int)out,ba[i],internal);
6174 set_jump_target(nottaken,(int)out);
6178 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
6180 } // (!unconditional)
6184 // In-order execution (branch first)
6188 //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]);
6191 emit_testimm(fs,0x800000);
6192 if(source[i]&0x10000) // BC1T
6203 } // if(!unconditional)
6205 uint64_t ds_unneeded=branch_regs[i].u;
6206 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6207 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6208 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6209 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6211 ds_unneeded_upper|=1;
6213 //assem_debug("1:\n");
6214 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6215 ds_unneeded,ds_unneeded_upper);
6217 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6218 address_generation(i+1,&branch_regs[i],0);
6219 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6220 ds_assemble(i+1,&branch_regs[i]);
6221 cc=get_reg(branch_regs[i].regmap,CCREG);
6223 emit_loadreg(CCREG,cc=HOST_CCREG);
6224 // CHECK: Is the following instruction (fall thru) allocated ok?
6226 assert(cc==HOST_CCREG);
6227 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6228 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6229 assem_debug("cycle count (adj)\n");
6230 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6231 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6233 assem_debug("branch: internal\n");
6235 assem_debug("branch: external\n");
6236 if(internal&&is_ds[(ba[i]-start)>>2]) {
6237 ds_assemble_entry(i);
6240 add_to_linker((int)out,ba[i],internal);
6245 if(1) { // <- FIXME (don't need this)
6246 set_jump_target(nottaken,(int)out);
6247 assem_debug("1:\n");
6249 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6250 ds_unneeded,ds_unneeded_upper);
6251 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6252 address_generation(i+1,&branch_regs[i],0);
6253 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6254 ds_assemble(i+1,&branch_regs[i]);
6256 cc=get_reg(branch_regs[i].regmap,CCREG);
6257 if(cc==-1&&!likely[i]) {
6258 // Cycle count isn't in a register, temporarily load it then write it out
6259 emit_loadreg(CCREG,HOST_CCREG);
6260 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6263 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6264 emit_storereg(CCREG,HOST_CCREG);
6267 cc=get_reg(i_regmap,CCREG);
6268 assert(cc==HOST_CCREG);
6269 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6272 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6278 static void pagespan_assemble(int i,struct regstat *i_regs)
6280 int s1l=get_reg(i_regs->regmap,rs1[i]);
6281 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6282 int s2l=get_reg(i_regs->regmap,rs2[i]);
6283 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6284 void *nt_branch=NULL;
6287 int unconditional=0;
6297 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6301 int addr,alt,ntaddr;
6302 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6306 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6307 (i_regs->regmap[hr]&63)!=rs1[i] &&
6308 (i_regs->regmap[hr]&63)!=rs2[i] )
6317 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6318 (i_regs->regmap[hr]&63)!=rs1[i] &&
6319 (i_regs->regmap[hr]&63)!=rs2[i] )
6325 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6329 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6330 (i_regs->regmap[hr]&63)!=rs1[i] &&
6331 (i_regs->regmap[hr]&63)!=rs2[i] )
6338 assert(hr<HOST_REGS);
6339 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6340 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6342 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6343 if(opcode[i]==2) // J
6347 if(opcode[i]==3) // JAL
6350 int rt=get_reg(i_regs->regmap,31);
6351 emit_movimm(start+i*4+8,rt);
6354 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6357 if(opcode2[i]==9) // JALR
6359 int rt=get_reg(i_regs->regmap,rt1[i]);
6360 emit_movimm(start+i*4+8,rt);
6363 if((opcode[i]&0x3f)==4) // BEQ
6370 #ifdef HAVE_CMOV_IMM
6372 if(s2l>=0) emit_cmp(s1l,s2l);
6373 else emit_test(s1l,s1l);
6374 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6380 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6382 if(s2h>=0) emit_cmp(s1h,s2h);
6383 else emit_test(s1h,s1h);
6384 emit_cmovne_reg(alt,addr);
6386 if(s2l>=0) emit_cmp(s1l,s2l);
6387 else emit_test(s1l,s1l);
6388 emit_cmovne_reg(alt,addr);
6391 if((opcode[i]&0x3f)==5) // BNE
6393 #ifdef HAVE_CMOV_IMM
6395 if(s2l>=0) emit_cmp(s1l,s2l);
6396 else emit_test(s1l,s1l);
6397 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6403 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6405 if(s2h>=0) emit_cmp(s1h,s2h);
6406 else emit_test(s1h,s1h);
6407 emit_cmovne_reg(alt,addr);
6409 if(s2l>=0) emit_cmp(s1l,s2l);
6410 else emit_test(s1l,s1l);
6411 emit_cmovne_reg(alt,addr);
6414 if((opcode[i]&0x3f)==0x14) // BEQL
6417 if(s2h>=0) emit_cmp(s1h,s2h);
6418 else emit_test(s1h,s1h);
6422 if(s2l>=0) emit_cmp(s1l,s2l);
6423 else emit_test(s1l,s1l);
6424 if(nottaken) set_jump_target(nottaken,(int)out);
6428 if((opcode[i]&0x3f)==0x15) // BNEL
6431 if(s2h>=0) emit_cmp(s1h,s2h);
6432 else emit_test(s1h,s1h);
6436 if(s2l>=0) emit_cmp(s1l,s2l);
6437 else emit_test(s1l,s1l);
6440 if(taken) set_jump_target(taken,(int)out);
6442 if((opcode[i]&0x3f)==6) // BLEZ
6444 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6446 if(s1h>=0) emit_mov(addr,ntaddr);
6447 emit_cmovl_reg(alt,addr);
6450 emit_cmovne_reg(ntaddr,addr);
6451 emit_cmovs_reg(alt,addr);
6454 if((opcode[i]&0x3f)==7) // BGTZ
6456 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6458 if(s1h>=0) emit_mov(addr,alt);
6459 emit_cmovl_reg(ntaddr,addr);
6462 emit_cmovne_reg(alt,addr);
6463 emit_cmovs_reg(ntaddr,addr);
6466 if((opcode[i]&0x3f)==0x16) // BLEZL
6468 assert((opcode[i]&0x3f)!=0x16);
6470 if((opcode[i]&0x3f)==0x17) // BGTZL
6472 assert((opcode[i]&0x3f)!=0x17);
6474 assert(opcode[i]!=1); // BLTZ/BGEZ
6476 //FIXME: Check CSREG
6477 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6478 if((source[i]&0x30000)==0) // BC1F
6480 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6481 emit_testimm(s1l,0x800000);
6482 emit_cmovne_reg(alt,addr);
6484 if((source[i]&0x30000)==0x10000) // BC1T
6486 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6487 emit_testimm(s1l,0x800000);
6488 emit_cmovne_reg(alt,addr);
6490 if((source[i]&0x30000)==0x20000) // BC1FL
6492 emit_testimm(s1l,0x800000);
6496 if((source[i]&0x30000)==0x30000) // BC1TL
6498 emit_testimm(s1l,0x800000);
6504 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6505 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6506 if(likely[i]||unconditional)
6508 emit_movimm(ba[i],HOST_BTREG);
6510 else if(addr!=HOST_BTREG)
6512 emit_mov(addr,HOST_BTREG);
6514 void *branch_addr=out;
6516 int target_addr=start+i*4+5;
6518 void *compiled_target_addr=check_addr(target_addr);
6519 emit_extjump_ds((int)branch_addr,target_addr);
6520 if(compiled_target_addr) {
6521 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6522 add_link(target_addr,stub);
6524 else set_jump_target((int)branch_addr,(int)stub);
6527 set_jump_target((int)nottaken,(int)out);
6528 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6529 void *branch_addr=out;
6531 int target_addr=start+i*4+8;
6533 void *compiled_target_addr=check_addr(target_addr);
6534 emit_extjump_ds((int)branch_addr,target_addr);
6535 if(compiled_target_addr) {
6536 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6537 add_link(target_addr,stub);
6539 else set_jump_target((int)branch_addr,(int)stub);
6543 // Assemble the delay slot for the above
6544 static void pagespan_ds()
6546 assem_debug("initial delay slot:\n");
6547 u_int vaddr=start+1;
6548 u_int page=get_page(vaddr);
6549 u_int vpage=get_vpage(vaddr);
6550 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6552 ll_add(jump_in+page,vaddr,(void *)out);
6553 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6554 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6555 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6556 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6557 emit_writeword(HOST_BTREG,(int)&branch_target);
6558 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6559 address_generation(0,®s[0],regs[0].regmap_entry);
6560 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6561 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6566 alu_assemble(0,®s[0]);break;
6568 imm16_assemble(0,®s[0]);break;
6570 shift_assemble(0,®s[0]);break;
6572 shiftimm_assemble(0,®s[0]);break;
6574 load_assemble(0,®s[0]);break;
6576 loadlr_assemble(0,®s[0]);break;
6578 store_assemble(0,®s[0]);break;
6580 storelr_assemble(0,®s[0]);break;
6582 cop0_assemble(0,®s[0]);break;
6584 cop1_assemble(0,®s[0]);break;
6586 c1ls_assemble(0,®s[0]);break;
6588 cop2_assemble(0,®s[0]);break;
6590 c2ls_assemble(0,®s[0]);break;
6592 c2op_assemble(0,®s[0]);break;
6594 fconv_assemble(0,®s[0]);break;
6596 float_assemble(0,®s[0]);break;
6598 fcomp_assemble(0,®s[0]);break;
6600 multdiv_assemble(0,®s[0]);break;
6602 mov_assemble(0,®s[0]);break;
6612 printf("Jump in the delay slot. This is probably a bug.\n");
6614 int btaddr=get_reg(regs[0].regmap,BTREG);
6616 btaddr=get_reg(regs[0].regmap,-1);
6617 emit_readword((int)&branch_target,btaddr);
6619 assert(btaddr!=HOST_CCREG);
6620 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6622 emit_movimm(start+4,HOST_TEMPREG);
6623 emit_cmp(btaddr,HOST_TEMPREG);
6625 emit_cmpimm(btaddr,start+4);
6627 int branch=(int)out;
6629 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6630 emit_jmp(jump_vaddr_reg[btaddr]);
6631 set_jump_target(branch,(int)out);
6632 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6633 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6636 // Basic liveness analysis for MIPS registers
6637 void unneeded_registers(int istart,int iend,int r)
6641 uint64_t temp_u,temp_uu;
6646 u=unneeded_reg[iend+1];
6647 uu=unneeded_reg_upper[iend+1];
6650 for (i=iend;i>=istart;i--)
6652 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6653 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6655 // If subroutine call, flag return address as a possible branch target
6656 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6658 if(ba[i]<start || ba[i]>=(start+slen*4))
6660 // Branch out of this block, flush all regs
6664 if(itype[i]==UJUMP&&rt1[i]==31)
6666 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6668 if(itype[i]==RJUMP&&rs1[i]==31)
6670 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6672 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6673 if(itype[i]==UJUMP&&rt1[i]==31)
6675 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6676 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6678 if(itype[i]==RJUMP&&rs1[i]==31)
6680 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6681 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6684 branch_unneeded_reg[i]=u;
6685 branch_unneeded_reg_upper[i]=uu;
6686 // Merge in delay slot
6687 tdep=(~uu>>rt1[i+1])&1;
6688 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6689 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6690 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6691 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6692 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6694 // If branch is "likely" (and conditional)
6695 // then we skip the delay slot on the fall-thru path
6698 u&=unneeded_reg[i+2];
6699 uu&=unneeded_reg_upper[i+2];
6710 // Internal branch, flag target
6711 bt[(ba[i]-start)>>2]=1;
6712 if(ba[i]<=start+i*4) {
6714 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6716 // Unconditional branch
6719 // Conditional branch (not taken case)
6720 temp_u=unneeded_reg[i+2];
6721 temp_uu=unneeded_reg_upper[i+2];
6723 // Merge in delay slot
6724 tdep=(~temp_uu>>rt1[i+1])&1;
6725 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6726 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6727 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6728 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6729 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6730 temp_u|=1;temp_uu|=1;
6731 // If branch is "likely" (and conditional)
6732 // then we skip the delay slot on the fall-thru path
6735 temp_u&=unneeded_reg[i+2];
6736 temp_uu&=unneeded_reg_upper[i+2];
6744 tdep=(~temp_uu>>rt1[i])&1;
6745 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6746 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6747 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6748 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6749 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6750 temp_u|=1;temp_uu|=1;
6751 unneeded_reg[i]=temp_u;
6752 unneeded_reg_upper[i]=temp_uu;
6753 // Only go three levels deep. This recursion can take an
6754 // excessive amount of time if there are a lot of nested loops.
6756 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6758 unneeded_reg[(ba[i]-start)>>2]=1;
6759 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6762 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6764 // Unconditional branch
6765 u=unneeded_reg[(ba[i]-start)>>2];
6766 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6767 branch_unneeded_reg[i]=u;
6768 branch_unneeded_reg_upper[i]=uu;
6771 //branch_unneeded_reg[i]=u;
6772 //branch_unneeded_reg_upper[i]=uu;
6773 // Merge in delay slot
6774 tdep=(~uu>>rt1[i+1])&1;
6775 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6776 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6777 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6778 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6779 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6782 // Conditional branch
6783 b=unneeded_reg[(ba[i]-start)>>2];
6784 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6785 branch_unneeded_reg[i]=b;
6786 branch_unneeded_reg_upper[i]=bu;
6789 //branch_unneeded_reg[i]=b;
6790 //branch_unneeded_reg_upper[i]=bu;
6791 // Branch delay slot
6792 tdep=(~uu>>rt1[i+1])&1;
6793 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6794 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6795 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6796 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6797 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6799 // If branch is "likely" then we skip the
6800 // delay slot on the fall-thru path
6805 u&=unneeded_reg[i+2];
6806 uu&=unneeded_reg_upper[i+2];
6817 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6818 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6819 //branch_unneeded_reg[i]=1;
6820 //branch_unneeded_reg_upper[i]=1;
6822 branch_unneeded_reg[i]=1;
6823 branch_unneeded_reg_upper[i]=1;
6829 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
6831 // SYSCALL instruction (software interrupt)
6835 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6837 // ERET instruction (return from interrupt)
6842 tdep=(~uu>>rt1[i])&1;
6843 // Written registers are unneeded
6848 // Accessed registers are needed
6853 // Source-target dependencies
6854 uu&=~(tdep<<dep1[i]);
6855 uu&=~(tdep<<dep2[i]);
6856 // R0 is always unneeded
6860 unneeded_reg_upper[i]=uu;
6862 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
6865 for(r=1;r<=CCREG;r++) {
6866 if((unneeded_reg[i]>>r)&1) {
6867 if(r==HIREG) printf(" HI");
6868 else if(r==LOREG) printf(" LO");
6869 else printf(" r%d",r);
6873 for(r=1;r<=CCREG;r++) {
6874 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
6875 if(r==HIREG) printf(" HI");
6876 else if(r==LOREG) printf(" LO");
6877 else printf(" r%d",r);
6883 for (i=iend;i>=istart;i--)
6885 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
6890 // Identify registers which are likely to contain 32-bit values
6891 // This is used to predict whether any branches will jump to a
6892 // location with 64-bit values in registers.
6893 static void provisional_32bit()
6897 uint64_t lastbranch=1;
6902 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
6903 if(i>1) is32=lastbranch;
6909 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
6911 if(i>2) is32=lastbranch;
6915 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
6917 if(rs1[i-2]==0||rs2[i-2]==0)
6920 is32|=1LL<<rs1[i-2];
6923 is32|=1LL<<rs2[i-2];
6928 // If something jumps here with 64-bit values
6929 // then promote those registers to 64 bits
6932 uint64_t temp_is32=is32;
6935 if(ba[j]==start+i*4)
6936 //temp_is32&=branch_regs[j].is32;
6941 if(ba[j]==start+i*4)
6952 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
6953 // Branches don't write registers, consider the delay slot instead.
6964 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
6965 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
6974 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
6975 if(op==0x22) is32|=1LL<<rt; // LWL
6978 if (op==0x08||op==0x09|| // ADDI/ADDIU
6979 op==0x0a||op==0x0b|| // SLTI/SLTIU
6985 if(op==0x18||op==0x19) { // DADDI/DADDIU
6988 // is32|=((is32>>s1)&1LL)<<rt;
6990 if(op==0x0d||op==0x0e) { // ORI/XORI
6991 uint64_t sr=((is32>>s1)&1LL);
7007 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
7010 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
7013 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
7014 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
7018 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
7023 uint64_t sr=((is32>>s1)&1LL);
7028 uint64_t sr=((is32>>s2)&1LL);
7036 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
7041 uint64_t sr=((is32>>s1)&1LL);
7051 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
7052 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
7055 is32|=(1LL<<HIREG)|(1LL<<LOREG);
7060 uint64_t sr=((is32>>s1)&1LL);
7066 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
7067 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
7071 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
7072 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
7075 if(op2==0) is32|=1LL<<rt; // MFC0
7079 if(op2==0) is32|=1LL<<rt; // MFC1
7080 if(op2==1) is32&=~(1LL<<rt); // DMFC1
7081 if(op2==2) is32|=1LL<<rt; // CFC1
7103 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
7105 if(rt1[i-1]==31) // JAL/JALR
7107 // Subroutine call will return here, don't alloc any registers
7112 // Internal branch will jump here, match registers to caller
7120 // Identify registers which may be assumed to contain 32-bit values
7121 // and where optimizations will rely on this.
7122 // This is used to determine whether backward branches can safely
7123 // jump to a location with 64-bit values in registers.
7124 static void provisional_r32()
7129 for (i=slen-1;i>=0;i--)
7132 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7134 if(ba[i]<start || ba[i]>=(start+slen*4))
7136 // Branch out of this block, don't need anything
7142 // Need whatever matches the target
7143 // (and doesn't get overwritten by the delay slot instruction)
7145 int t=(ba[i]-start)>>2;
7146 if(ba[i]>start+i*4) {
7148 //if(!(requires_32bit[t]&~regs[i].was32))
7149 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7150 if(!(pr32[t]&~regs[i].was32))
7151 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7154 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7155 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7158 // Conditional branch may need registers for following instructions
7159 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7162 //r32|=requires_32bit[i+2];
7165 // Mark this address as a branch target since it may be called
7166 // upon return from interrupt
7170 // Merge in delay slot
7172 // These are overwritten unless the branch is "likely"
7173 // and the delay slot is nullified if not taken
7174 r32&=~(1LL<<rt1[i+1]);
7175 r32&=~(1LL<<rt2[i+1]);
7177 // Assume these are needed (delay slot)
7180 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7184 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7186 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7188 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7190 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7192 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7195 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7197 // SYSCALL instruction (software interrupt)
7200 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7202 // ERET instruction (return from interrupt)
7206 r32&=~(1LL<<rt1[i]);
7207 r32&=~(1LL<<rt2[i]);
7210 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7214 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7216 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7218 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7220 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7222 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7224 //requires_32bit[i]=r32;
7227 // Dirty registers which are 32-bit, require 32-bit input
7228 // as they will be written as 32-bit values
7229 for(hr=0;hr<HOST_REGS;hr++)
7231 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7232 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7233 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7234 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7235 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7242 // Write back dirty registers as soon as we will no longer modify them,
7243 // so that we don't end up with lots of writes at the branches.
7244 void clean_registers(int istart,int iend,int wr)
7248 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7249 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7251 will_dirty_i=will_dirty_next=0;
7252 wont_dirty_i=wont_dirty_next=0;
7254 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7255 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7257 for (i=iend;i>=istart;i--)
7259 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7261 if(ba[i]<start || ba[i]>=(start+slen*4))
7263 // Branch out of this block, flush all regs
7264 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7266 // Unconditional branch
7269 // Merge in delay slot (will dirty)
7270 for(r=0;r<HOST_REGS;r++) {
7271 if(r!=EXCLUDE_REG) {
7272 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7273 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7274 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7275 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7276 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7277 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7278 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7279 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7280 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7281 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7282 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7283 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7284 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7285 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7291 // Conditional branch
7293 wont_dirty_i=wont_dirty_next;
7294 // Merge in delay slot (will dirty)
7295 for(r=0;r<HOST_REGS;r++) {
7296 if(r!=EXCLUDE_REG) {
7298 // Might not dirty if likely branch is not taken
7299 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7300 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7301 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7302 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7303 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7304 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7305 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7306 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7307 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7308 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7309 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7310 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7311 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7312 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7317 // Merge in delay slot (wont dirty)
7318 for(r=0;r<HOST_REGS;r++) {
7319 if(r!=EXCLUDE_REG) {
7320 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7321 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7322 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7323 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7324 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7325 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7326 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7327 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7328 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7329 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7333 #ifndef DESTRUCTIVE_WRITEBACK
7334 branch_regs[i].dirty&=wont_dirty_i;
7336 branch_regs[i].dirty|=will_dirty_i;
7342 if(ba[i]<=start+i*4) {
7344 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7346 // Unconditional branch
7349 // Merge in delay slot (will dirty)
7350 for(r=0;r<HOST_REGS;r++) {
7351 if(r!=EXCLUDE_REG) {
7352 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7353 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7354 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7355 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7356 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7357 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7358 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7359 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7360 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7361 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7362 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7363 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7364 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7365 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7369 // Conditional branch (not taken case)
7370 temp_will_dirty=will_dirty_next;
7371 temp_wont_dirty=wont_dirty_next;
7372 // Merge in delay slot (will dirty)
7373 for(r=0;r<HOST_REGS;r++) {
7374 if(r!=EXCLUDE_REG) {
7376 // Will not dirty if likely branch is not taken
7377 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7378 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7379 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7380 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7381 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7382 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7383 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7384 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7385 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7386 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7387 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7388 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7389 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7390 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7395 // Merge in delay slot (wont dirty)
7396 for(r=0;r<HOST_REGS;r++) {
7397 if(r!=EXCLUDE_REG) {
7398 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7399 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7400 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7401 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7402 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7403 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7404 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7405 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7406 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7407 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7410 // Deal with changed mappings
7412 for(r=0;r<HOST_REGS;r++) {
7413 if(r!=EXCLUDE_REG) {
7414 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7415 temp_will_dirty&=~(1<<r);
7416 temp_wont_dirty&=~(1<<r);
7417 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7418 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7419 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7421 temp_will_dirty|=1<<r;
7422 temp_wont_dirty|=1<<r;
7429 will_dirty[i]=temp_will_dirty;
7430 wont_dirty[i]=temp_wont_dirty;
7431 clean_registers((ba[i]-start)>>2,i-1,0);
7433 // Limit recursion. It can take an excessive amount
7434 // of time if there are a lot of nested loops.
7435 will_dirty[(ba[i]-start)>>2]=0;
7436 wont_dirty[(ba[i]-start)>>2]=-1;
7441 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7443 // Unconditional branch
7446 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7447 for(r=0;r<HOST_REGS;r++) {
7448 if(r!=EXCLUDE_REG) {
7449 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7450 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7451 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7456 // Merge in delay slot
7457 for(r=0;r<HOST_REGS;r++) {
7458 if(r!=EXCLUDE_REG) {
7459 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7460 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7461 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7462 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7463 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7464 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7465 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7466 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7467 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7468 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7469 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7470 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7471 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7472 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7476 // Conditional branch
7477 will_dirty_i=will_dirty_next;
7478 wont_dirty_i=wont_dirty_next;
7479 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7480 for(r=0;r<HOST_REGS;r++) {
7481 if(r!=EXCLUDE_REG) {
7482 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7483 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7484 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7488 will_dirty_i&=~(1<<r);
7490 // Treat delay slot as part of branch too
7491 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7492 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7493 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7497 will_dirty[i+1]&=~(1<<r);
7502 // Merge in delay slot
7503 for(r=0;r<HOST_REGS;r++) {
7504 if(r!=EXCLUDE_REG) {
7506 // Might not dirty if likely branch is not taken
7507 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7508 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7509 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7510 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7511 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7512 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7513 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7514 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7515 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7516 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7517 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7518 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7519 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7520 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7525 // Merge in delay slot
7526 for(r=0;r<HOST_REGS;r++) {
7527 if(r!=EXCLUDE_REG) {
7528 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7529 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7530 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7531 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7532 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7533 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7534 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7535 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7536 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7537 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7541 #ifndef DESTRUCTIVE_WRITEBACK
7542 branch_regs[i].dirty&=wont_dirty_i;
7544 branch_regs[i].dirty|=will_dirty_i;
7549 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7551 // SYSCALL instruction (software interrupt)
7555 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7557 // ERET instruction (return from interrupt)
7561 will_dirty_next=will_dirty_i;
7562 wont_dirty_next=wont_dirty_i;
7563 for(r=0;r<HOST_REGS;r++) {
7564 if(r!=EXCLUDE_REG) {
7565 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7566 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7567 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7568 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7569 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7570 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7571 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7572 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7574 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7576 // Don't store a register immediately after writing it,
7577 // may prevent dual-issue.
7578 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7579 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7585 will_dirty[i]=will_dirty_i;
7586 wont_dirty[i]=wont_dirty_i;
7587 // Mark registers that won't be dirtied as not dirty
7589 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7590 for(r=0;r<HOST_REGS;r++) {
7591 if((will_dirty_i>>r)&1) {
7597 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7598 regs[i].dirty|=will_dirty_i;
7599 #ifndef DESTRUCTIVE_WRITEBACK
7600 regs[i].dirty&=wont_dirty_i;
7601 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7603 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7604 for(r=0;r<HOST_REGS;r++) {
7605 if(r!=EXCLUDE_REG) {
7606 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7607 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7608 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7616 for(r=0;r<HOST_REGS;r++) {
7617 if(r!=EXCLUDE_REG) {
7618 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7619 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7620 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7628 // Deal with changed mappings
7629 temp_will_dirty=will_dirty_i;
7630 temp_wont_dirty=wont_dirty_i;
7631 for(r=0;r<HOST_REGS;r++) {
7632 if(r!=EXCLUDE_REG) {
7634 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7636 #ifndef DESTRUCTIVE_WRITEBACK
7637 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7639 regs[i].wasdirty|=will_dirty_i&(1<<r);
7642 else if((nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7643 // Register moved to a different register
7644 will_dirty_i&=~(1<<r);
7645 wont_dirty_i&=~(1<<r);
7646 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7647 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7649 #ifndef DESTRUCTIVE_WRITEBACK
7650 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7652 regs[i].wasdirty|=will_dirty_i&(1<<r);
7656 will_dirty_i&=~(1<<r);
7657 wont_dirty_i&=~(1<<r);
7658 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7659 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7660 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7663 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7672 void disassemble_inst(int i)
7674 if (bt[i]) printf("*"); else printf(" ");
7677 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7679 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;
7681 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;
7683 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7685 if (opcode[i]==0x9&&rt1[i]!=31)
7686 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7688 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7691 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7693 if(opcode[i]==0xf) //LUI
7694 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7696 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7700 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7704 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7708 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7711 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7714 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7717 if((opcode2[i]&0x1d)==0x10)
7718 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7719 else if((opcode2[i]&0x1d)==0x11)
7720 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7722 printf (" %x: %s\n",start+i*4,insn[i]);
7726 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7727 else if(opcode2[i]==4)
7728 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7729 else printf (" %x: %s\n",start+i*4,insn[i]);
7733 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7734 else if(opcode2[i]>3)
7735 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7736 else printf (" %x: %s\n",start+i*4,insn[i]);
7740 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7741 else if(opcode2[i]>3)
7742 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7743 else printf (" %x: %s\n",start+i*4,insn[i]);
7746 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7749 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7752 printf (" %x: %s (INTCALL)\n",start+i*4,insn[i]);
7755 //printf (" %s %8x\n",insn[i],source[i]);
7756 printf (" %x: %s\n",start+i*4,insn[i]);
7760 // clear the state completely, instead of just marking
7761 // things invalid like invalidate_all_pages() does
7762 void new_dynarec_clear_full()
7765 out=(u_char *)BASE_ADDR;
7766 memset(invalid_code,1,sizeof(invalid_code));
7767 memset(hash_table,0xff,sizeof(hash_table));
7768 memset(mini_ht,-1,sizeof(mini_ht));
7769 memset(restore_candidate,0,sizeof(restore_candidate));
7770 memset(shadow,0,sizeof(shadow));
7772 expirep=16384; // Expiry pointer, +2 blocks
7773 pending_exception=0;
7781 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7783 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7784 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7785 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7787 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7788 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7789 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7792 void new_dynarec_init()
7794 printf("Init new dynarec\n");
7795 out=(u_char *)BASE_ADDR;
7796 if (mmap (out, 1<<TARGET_SIZE_2,
7797 PROT_READ | PROT_WRITE | PROT_EXEC,
7798 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
7799 -1, 0) <= 0) {printf("mmap() failed\n");}
7801 rdword=&readmem_dword;
7802 fake_pc.f.r.rs=&readmem_dword;
7803 fake_pc.f.r.rt=&readmem_dword;
7804 fake_pc.f.r.rd=&readmem_dword;
7807 new_dynarec_clear_full();
7809 // Copy this into local area so we don't have to put it in every literal pool
7810 invc_ptr=invalid_code;
7813 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
7814 writemem[n] = write_nomem_new;
7815 writememb[n] = write_nomemb_new;
7816 writememh[n] = write_nomemh_new;
7818 writememd[n] = write_nomemd_new;
7820 readmem[n] = read_nomem_new;
7821 readmemb[n] = read_nomemb_new;
7822 readmemh[n] = read_nomemh_new;
7824 readmemd[n] = read_nomemd_new;
7827 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
7828 writemem[n] = write_rdram_new;
7829 writememb[n] = write_rdramb_new;
7830 writememh[n] = write_rdramh_new;
7832 writememd[n] = write_rdramd_new;
7835 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
7836 writemem[n] = write_nomem_new;
7837 writememb[n] = write_nomemb_new;
7838 writememh[n] = write_nomemh_new;
7840 writememd[n] = write_nomemd_new;
7842 readmem[n] = read_nomem_new;
7843 readmemb[n] = read_nomemb_new;
7844 readmemh[n] = read_nomemh_new;
7846 readmemd[n] = read_nomemd_new;
7854 void new_dynarec_cleanup()
7857 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {printf("munmap() failed\n");}
7858 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7859 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7860 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7862 if (munmap (ROM_COPY, 67108864) < 0) {printf("munmap() failed\n");}
7866 int new_recompile_block(int addr)
7869 if(addr==0x800cd050) {
7871 for(block=0x80000;block<0x80800;block++) invalidate_block(block);
7873 for(n=0;n<=2048;n++) ll_clear(jump_dirty+n);
7876 //if(Count==365117028) tracedebug=1;
7877 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7878 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7879 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
7881 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
7882 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
7883 /*if(Count>=312978186) {
7887 start = (u_int)addr&~3;
7888 //assert(((u_int)addr&1)==0);
7890 if(!sp_in_mirror&&(signed int)(psxRegs.GPR.n.sp&0xffe00000)>0x80200000&&
7891 0x10000<=psxRegs.GPR.n.sp&&(psxRegs.GPR.n.sp&~0xe0e00000)<RAM_SIZE) {
7892 printf("SP hack enabled (%08x), @%08x\n", psxRegs.GPR.n.sp, psxRegs.pc);
7895 if (Config.HLE && start == 0x80001000) // hlecall
7897 // XXX: is this enough? Maybe check hleSoftCall?
7898 u_int beginning=(u_int)out;
7899 u_int page=get_page(start);
7900 invalid_code[start>>12]=0;
7901 emit_movimm(start,0);
7902 emit_writeword(0,(int)&pcaddr);
7903 emit_jmp((int)new_dyna_leave);
7905 __clear_cache((void *)beginning,out);
7907 ll_add(jump_in+page,start,(void *)beginning);
7910 else if ((u_int)addr < 0x00200000 ||
7911 (0xa0000000 <= addr && addr < 0xa0200000)) {
7912 // used for BIOS calls mostly?
7913 source = (u_int *)((u_int)rdram+(start&0x1fffff));
7914 pagelimit = (addr&0xa0000000)|0x00200000;
7916 else if (!Config.HLE && (
7917 /* (0x9fc00000 <= addr && addr < 0x9fc80000) ||*/
7918 (0xbfc00000 <= addr && addr < 0xbfc80000))) {
7920 source = (u_int *)((u_int)psxR+(start&0x7ffff));
7921 pagelimit = (addr&0xfff00000)|0x80000;
7926 if ((int)addr >= 0xa4000000 && (int)addr < 0xa4001000) {
7927 source = (u_int *)((u_int)SP_DMEM+start-0xa4000000);
7928 pagelimit = 0xa4001000;
7932 if ((int)addr >= 0x80000000 && (int)addr < 0x80000000+RAM_SIZE) {
7933 source = (u_int *)((u_int)rdram+start-0x80000000);
7934 pagelimit = 0x80000000+RAM_SIZE;
7937 else if ((signed int)addr >= (signed int)0xC0000000) {
7938 //printf("addr=%x mm=%x\n",(u_int)addr,(memory_map[start>>12]<<2));
7939 //if(tlb_LUT_r[start>>12])
7940 //source = (u_int *)(((int)rdram)+(tlb_LUT_r[start>>12]&0xFFFFF000)+(((int)addr)&0xFFF)-0x80000000);
7941 if((signed int)memory_map[start>>12]>=0) {
7942 source = (u_int *)((u_int)(start+(memory_map[start>>12]<<2)));
7943 pagelimit=(start+4096)&0xFFFFF000;
7944 int map=memory_map[start>>12];
7947 //printf("start: %x next: %x\n",map,memory_map[pagelimit>>12]);
7948 if((map&0xBFFFFFFF)==(memory_map[pagelimit>>12]&0xBFFFFFFF)) pagelimit+=4096;
7950 assem_debug("pagelimit=%x\n",pagelimit);
7951 assem_debug("mapping=%x (%x)\n",memory_map[start>>12],(memory_map[start>>12]<<2)+start);
7954 assem_debug("Compile at unmapped memory address: %x \n", (int)addr);
7955 //assem_debug("start: %x next: %x\n",memory_map[start>>12],memory_map[(start+4096)>>12]);
7956 return -1; // Caller will invoke exception handler
7958 //printf("source= %x\n",(int)source);
7962 printf("Compile at bogus memory address: %x \n", (int)addr);
7966 /* Pass 1: disassemble */
7967 /* Pass 2: register dependencies, branch targets */
7968 /* Pass 3: register allocation */
7969 /* Pass 4: branch dependencies */
7970 /* Pass 5: pre-alloc */
7971 /* Pass 6: optimize clean/dirty state */
7972 /* Pass 7: flag 32-bit registers */
7973 /* Pass 8: assembly */
7974 /* Pass 9: linker */
7975 /* Pass 10: garbage collection / free memory */
7979 unsigned int type,op,op2;
7981 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
7983 /* Pass 1 disassembly */
7985 for(i=0;!done;i++) {
7986 bt[i]=0;likely[i]=0;ooo[i]=0;op2=0;
7987 minimum_free_regs[i]=0;
7988 opcode[i]=op=source[i]>>26;
7991 case 0x00: strcpy(insn[i],"special"); type=NI;
7995 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
7996 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
7997 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
7998 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
7999 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
8000 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
8001 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
8002 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
8003 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
8004 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
8005 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
8006 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
8007 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
8008 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
8009 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
8010 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
8011 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
8012 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
8013 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
8014 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
8015 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
8016 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
8017 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
8018 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
8019 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
8020 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
8021 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
8022 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
8023 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
8024 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
8025 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
8026 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
8027 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
8028 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
8029 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
8031 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
8032 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
8033 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
8034 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
8035 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
8036 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
8037 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
8038 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
8039 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
8040 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
8041 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
8042 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
8043 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
8044 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
8045 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
8046 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
8047 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
8051 case 0x01: strcpy(insn[i],"regimm"); type=NI;
8052 op2=(source[i]>>16)&0x1f;
8055 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
8056 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
8057 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
8058 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
8059 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
8060 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
8061 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
8062 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
8063 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
8064 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
8065 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
8066 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
8067 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
8068 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
8071 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
8072 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
8073 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
8074 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
8075 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
8076 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
8077 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
8078 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
8079 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
8080 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
8081 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
8082 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
8083 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
8084 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
8085 case 0x10: strcpy(insn[i],"cop0"); type=NI;
8086 op2=(source[i]>>21)&0x1f;
8089 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
8090 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
8091 case 0x10: strcpy(insn[i],"tlb"); type=NI;
8092 switch(source[i]&0x3f)
8094 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
8095 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
8096 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
8097 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
8099 case 0x10: strcpy(insn[i],"RFE"); type=COP0; break;
8101 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
8106 case 0x11: strcpy(insn[i],"cop1"); type=NI;
8107 op2=(source[i]>>21)&0x1f;
8110 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
8111 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
8112 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
8113 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
8114 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
8115 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
8116 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
8117 switch((source[i]>>16)&0x3)
8119 case 0x00: strcpy(insn[i],"BC1F"); break;
8120 case 0x01: strcpy(insn[i],"BC1T"); break;
8121 case 0x02: strcpy(insn[i],"BC1FL"); break;
8122 case 0x03: strcpy(insn[i],"BC1TL"); break;
8125 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
8126 switch(source[i]&0x3f)
8128 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
8129 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
8130 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
8131 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
8132 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
8133 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
8134 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
8135 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
8136 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
8137 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
8138 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
8139 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
8140 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
8141 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
8142 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
8143 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
8144 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
8145 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
8146 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
8147 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
8148 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
8149 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
8150 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
8151 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
8152 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
8153 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
8154 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
8155 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
8156 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
8157 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
8158 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
8159 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
8160 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
8161 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
8162 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
8165 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8166 switch(source[i]&0x3f)
8168 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8169 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8170 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8171 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8172 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8173 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8174 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8175 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8176 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8177 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8178 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8179 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8180 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8181 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8182 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8183 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8184 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8185 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8186 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8187 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8188 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8189 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8190 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8191 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8192 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8193 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8194 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8195 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8196 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8197 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8198 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8199 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8200 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8201 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8202 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8205 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8206 switch(source[i]&0x3f)
8208 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8209 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8212 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8213 switch(source[i]&0x3f)
8215 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8216 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8222 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8223 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8224 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8225 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8226 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8227 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8228 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8229 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8231 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8232 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8233 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8234 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8235 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8236 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8237 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8238 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8239 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8240 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8241 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8242 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8244 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8245 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8247 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8248 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8249 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8250 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8252 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8253 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8254 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8256 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8257 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8259 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8260 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8261 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8264 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8265 // note: COP MIPS-1 encoding differs from MIPS32
8266 op2=(source[i]>>21)&0x1f;
8267 if (source[i]&0x3f) {
8268 if (gte_handlers[source[i]&0x3f]!=NULL) {
8269 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8275 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8276 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8277 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8278 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8281 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8282 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8283 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8285 default: strcpy(insn[i],"???"); type=NI;
8286 printf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8291 /* Get registers/immediates */
8299 rs1[i]=(source[i]>>21)&0x1f;
8301 rt1[i]=(source[i]>>16)&0x1f;
8303 imm[i]=(short)source[i];
8307 rs1[i]=(source[i]>>21)&0x1f;
8308 rs2[i]=(source[i]>>16)&0x1f;
8311 imm[i]=(short)source[i];
8312 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8315 // LWL/LWR only load part of the register,
8316 // therefore the target register must be treated as a source too
8317 rs1[i]=(source[i]>>21)&0x1f;
8318 rs2[i]=(source[i]>>16)&0x1f;
8319 rt1[i]=(source[i]>>16)&0x1f;
8321 imm[i]=(short)source[i];
8322 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8323 if(op==0x26) dep1[i]=rt1[i]; // LWR
8326 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8327 else rs1[i]=(source[i]>>21)&0x1f;
8329 rt1[i]=(source[i]>>16)&0x1f;
8331 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8332 imm[i]=(unsigned short)source[i];
8334 imm[i]=(short)source[i];
8336 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8337 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8338 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8345 // The JAL instruction writes to r31.
8352 rs1[i]=(source[i]>>21)&0x1f;
8356 // The JALR instruction writes to rd.
8358 rt1[i]=(source[i]>>11)&0x1f;
8363 rs1[i]=(source[i]>>21)&0x1f;
8364 rs2[i]=(source[i]>>16)&0x1f;
8367 if(op&2) { // BGTZ/BLEZ
8375 rs1[i]=(source[i]>>21)&0x1f;
8380 if(op2&0x10) { // BxxAL
8382 // NOTE: If the branch is not taken, r31 is still overwritten
8384 likely[i]=(op2&2)>>1;
8391 likely[i]=((source[i])>>17)&1;
8394 rs1[i]=(source[i]>>21)&0x1f; // source
8395 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8396 rt1[i]=(source[i]>>11)&0x1f; // destination
8398 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8399 us1[i]=rs1[i];us2[i]=rs2[i];
8401 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8402 dep1[i]=rs1[i];dep2[i]=rs2[i];
8404 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8405 dep1[i]=rs1[i];dep2[i]=rs2[i];
8409 rs1[i]=(source[i]>>21)&0x1f; // source
8410 rs2[i]=(source[i]>>16)&0x1f; // divisor
8413 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8414 us1[i]=rs1[i];us2[i]=rs2[i];
8422 if(op2==0x10) rs1[i]=HIREG; // MFHI
8423 if(op2==0x11) rt1[i]=HIREG; // MTHI
8424 if(op2==0x12) rs1[i]=LOREG; // MFLO
8425 if(op2==0x13) rt1[i]=LOREG; // MTLO
8426 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8427 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8431 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8432 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8433 rt1[i]=(source[i]>>11)&0x1f; // destination
8435 // DSLLV/DSRLV/DSRAV are 64-bit
8436 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8439 rs1[i]=(source[i]>>16)&0x1f;
8441 rt1[i]=(source[i]>>11)&0x1f;
8443 imm[i]=(source[i]>>6)&0x1f;
8444 // DSxx32 instructions
8445 if(op2>=0x3c) imm[i]|=0x20;
8446 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8447 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8454 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8455 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8456 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8457 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8465 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8466 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8467 if(op2==5) us1[i]=rs1[i]; // DMTC1
8471 rs1[i]=(source[i]>>21)&0x1F;
8475 imm[i]=(short)source[i];
8478 rs1[i]=(source[i]>>21)&0x1F;
8482 imm[i]=(short)source[i];
8511 /* Calculate branch target addresses */
8513 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8514 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8515 ba[i]=start+i*4+8; // Ignore never taken branch
8516 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8517 ba[i]=start+i*4+8; // Ignore never taken branch
8518 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8519 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8522 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
8524 // branch in delay slot?
8525 if(type==RJUMP||type==UJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
8526 // don't handle first branch and call interpreter if it's hit
8527 printf("branch in delay slot @%08x (%08x)\n", addr + i*4, addr);
8530 // basic load delay detection
8531 else if((type==LOAD||type==LOADLR||type==COP0||type==COP2||type==C2LS)&&rt1[i]!=0) {
8532 int t=(ba[i-1]-start)/4;
8533 if(0 <= t && t < i &&(rt1[i]==rs1[t]||rt1[i]==rs2[t])&&itype[t]!=CJUMP&&itype[t]!=SJUMP) {
8534 // jump target wants DS result - potential load delay effect
8535 printf("load delay @%08x (%08x)\n", addr + i*4, addr);
8537 bt[t+1]=1; // expected return from interpreter
8539 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&&
8540 !(i>=3&&(itype[i-3]==RJUMP||itype[i-3]==UJUMP||itype[i-3]==CJUMP||itype[i-3]==SJUMP))) {
8541 // v0 overwrite like this is a sign of trouble, bail out
8542 printf("v0 overwrite @%08x (%08x)\n", addr + i*4, addr);
8548 rs2[i-1]=rt1[i-1]=rt2[i-1]=0;
8552 i--; // don't compile the DS
8556 /* Is this the end of the block? */
8557 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8558 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8562 if(stop_after_jal) done=1;
8564 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8566 // Don't recompile stuff that's already compiled
8567 if(check_addr(start+i*4+4)) done=1;
8568 // Don't get too close to the limit
8569 if(i>MAXBLOCK/2) done=1;
8571 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8572 if(itype[i]==HLECALL||itype[i]==INTCALL) done=2;
8574 // Does the block continue due to a branch?
8577 if(ba[j]==start+i*4+4) done=j=0;
8578 if(ba[j]==start+i*4+8) done=j=0;
8581 //assert(i<MAXBLOCK-1);
8582 if(start+i*4==pagelimit-4) done=1;
8583 assert(start+i*4<pagelimit);
8584 if (i==MAXBLOCK-1) done=1;
8585 // Stop if we're compiling junk
8586 if(itype[i]==NI&&opcode[i]==0x11) {
8587 done=stop_after_jal=1;
8588 printf("Disabled speculative precompilation\n");
8592 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8593 if(start+i*4==pagelimit) {
8599 /* Pass 2 - Register dependencies and branch targets */
8601 unneeded_registers(0,slen-1,0);
8603 /* Pass 3 - Register allocation */
8605 struct regstat current; // Current register allocations/status
8608 current.u=unneeded_reg[0];
8609 current.uu=unneeded_reg_upper[0];
8610 clear_all_regs(current.regmap);
8611 alloc_reg(¤t,0,CCREG);
8612 dirty_reg(¤t,CCREG);
8620 provisional_32bit();
8623 // First instruction is delay slot
8628 unneeded_reg_upper[0]=1;
8629 current.regmap[HOST_BTREG]=BTREG;
8637 for(hr=0;hr<HOST_REGS;hr++)
8639 // Is this really necessary?
8640 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8646 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8648 if(rs1[i-2]==0||rs2[i-2]==0)
8651 current.is32|=1LL<<rs1[i-2];
8652 int hr=get_reg(current.regmap,rs1[i-2]|64);
8653 if(hr>=0) current.regmap[hr]=-1;
8656 current.is32|=1LL<<rs2[i-2];
8657 int hr=get_reg(current.regmap,rs2[i-2]|64);
8658 if(hr>=0) current.regmap[hr]=-1;
8664 // If something jumps here with 64-bit values
8665 // then promote those registers to 64 bits
8668 uint64_t temp_is32=current.is32;
8671 if(ba[j]==start+i*4)
8672 temp_is32&=branch_regs[j].is32;
8676 if(ba[j]==start+i*4)
8680 if(temp_is32!=current.is32) {
8681 //printf("dumping 32-bit regs (%x)\n",start+i*4);
8682 #ifdef DESTRUCTIVE_WRITEBACK
8683 for(hr=0;hr<HOST_REGS;hr++)
8685 int r=current.regmap[hr];
8688 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
8690 //printf("restore %d\n",r);
8695 current.is32=temp_is32;
8702 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
8703 regs[i].wasconst=current.isconst;
8704 regs[i].was32=current.is32;
8705 regs[i].wasdirty=current.dirty;
8706 #if defined(DESTRUCTIVE_WRITEBACK) && !defined(FORCE32)
8707 // To change a dirty register from 32 to 64 bits, we must write
8708 // it out during the previous cycle (for branches, 2 cycles)
8709 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)
8711 uint64_t temp_is32=current.is32;
8714 if(ba[j]==start+i*4+4)
8715 temp_is32&=branch_regs[j].is32;
8719 if(ba[j]==start+i*4+4)
8723 if(temp_is32!=current.is32) {
8724 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8725 for(hr=0;hr<HOST_REGS;hr++)
8727 int r=current.regmap[hr];
8730 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8731 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
8733 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
8735 //printf("dump %d/r%d\n",hr,r);
8736 current.regmap[hr]=-1;
8737 if(get_reg(current.regmap,r|64)>=0)
8738 current.regmap[get_reg(current.regmap,r|64)]=-1;
8746 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
8748 uint64_t temp_is32=current.is32;
8751 if(ba[j]==start+i*4+8)
8752 temp_is32&=branch_regs[j].is32;
8756 if(ba[j]==start+i*4+8)
8760 if(temp_is32!=current.is32) {
8761 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8762 for(hr=0;hr<HOST_REGS;hr++)
8764 int r=current.regmap[hr];
8767 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8768 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
8770 //printf("dump %d/r%d\n",hr,r);
8771 current.regmap[hr]=-1;
8772 if(get_reg(current.regmap,r|64)>=0)
8773 current.regmap[get_reg(current.regmap,r|64)]=-1;
8781 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8783 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
8784 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
8785 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8794 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
8795 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8796 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8797 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8798 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8801 } else { printf("oops, branch at end of block with no delay slot\n");exit(1); }
8805 ds=0; // Skip delay slot, already allocated as part of branch
8806 // ...but we need to alloc it in case something jumps here
8808 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
8809 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
8811 current.u=branch_unneeded_reg[i-1];
8812 current.uu=branch_unneeded_reg_upper[i-1];
8814 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8815 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8816 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8819 struct regstat temp;
8820 memcpy(&temp,¤t,sizeof(current));
8821 temp.wasdirty=temp.dirty;
8822 temp.was32=temp.is32;
8823 // TODO: Take into account unconditional branches, as below
8824 delayslot_alloc(&temp,i);
8825 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
8826 regs[i].wasdirty=temp.wasdirty;
8827 regs[i].was32=temp.was32;
8828 regs[i].dirty=temp.dirty;
8829 regs[i].is32=temp.is32;
8833 // Create entry (branch target) regmap
8834 for(hr=0;hr<HOST_REGS;hr++)
8836 int r=temp.regmap[hr];
8838 if(r!=regmap_pre[i][hr]) {
8839 regs[i].regmap_entry[hr]=-1;
8844 if((current.u>>r)&1) {
8845 regs[i].regmap_entry[hr]=-1;
8846 regs[i].regmap[hr]=-1;
8847 //Don't clear regs in the delay slot as the branch might need them
8848 //current.regmap[hr]=-1;
8850 regs[i].regmap_entry[hr]=r;
8853 if((current.uu>>(r&63))&1) {
8854 regs[i].regmap_entry[hr]=-1;
8855 regs[i].regmap[hr]=-1;
8856 //Don't clear regs in the delay slot as the branch might need them
8857 //current.regmap[hr]=-1;
8859 regs[i].regmap_entry[hr]=r;
8863 // First instruction expects CCREG to be allocated
8864 if(i==0&&hr==HOST_CCREG)
8865 regs[i].regmap_entry[hr]=CCREG;
8867 regs[i].regmap_entry[hr]=-1;
8871 else { // Not delay slot
8874 //current.isconst=0; // DEBUG
8875 //current.wasconst=0; // DEBUG
8876 //regs[i].wasconst=0; // DEBUG
8877 clear_const(¤t,rt1[i]);
8878 alloc_cc(¤t,i);
8879 dirty_reg(¤t,CCREG);
8881 delayslot_alloc(¤t,i+1);
8883 alloc_reg(¤t,i,31);
8884 dirty_reg(¤t,31);
8885 //assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8886 //assert(rt1[i+1]!=rt1[i]);
8888 alloc_reg(¤t,i,PTEMP);
8890 //current.is32|=1LL<<rt1[i];
8892 //current.isconst=0; // DEBUG
8894 //printf("i=%d, isconst=%x\n",i,current.isconst);
8897 //current.isconst=0;
8898 //current.wasconst=0;
8899 //regs[i].wasconst=0;
8900 clear_const(¤t,rs1[i]);
8901 clear_const(¤t,rt1[i]);
8902 alloc_cc(¤t,i);
8903 dirty_reg(¤t,CCREG);
8904 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
8905 alloc_reg(¤t,i,rs1[i]);
8907 alloc_reg(¤t,i,rt1[i]);
8908 dirty_reg(¤t,rt1[i]);
8909 assert(rs1[i+1]!=rt1[i]&&rs2[i+1]!=rt1[i]);
8910 assert(rt1[i+1]!=rt1[i]);
8912 alloc_reg(¤t,i,PTEMP);
8916 if(rs1[i]==31) { // JALR
8917 alloc_reg(¤t,i,RHASH);
8918 #ifndef HOST_IMM_ADDR32
8919 alloc_reg(¤t,i,RHTBL);
8923 delayslot_alloc(¤t,i+1);
8925 // The delay slot overwrites our source register,
8926 // allocate a temporary register to hold the old value.
8930 delayslot_alloc(¤t,i+1);
8932 alloc_reg(¤t,i,RTEMP);
8934 //current.isconst=0; // DEBUG
8939 //current.isconst=0;
8940 //current.wasconst=0;
8941 //regs[i].wasconst=0;
8942 clear_const(¤t,rs1[i]);
8943 clear_const(¤t,rs2[i]);
8944 if((opcode[i]&0x3E)==4) // BEQ/BNE
8946 alloc_cc(¤t,i);
8947 dirty_reg(¤t,CCREG);
8948 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8949 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8950 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8952 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8953 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8955 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
8956 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
8957 // The delay slot overwrites one of our conditions.
8958 // Allocate the branch condition registers instead.
8962 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8963 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8964 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8966 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8967 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8973 delayslot_alloc(¤t,i+1);
8977 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
8979 alloc_cc(¤t,i);
8980 dirty_reg(¤t,CCREG);
8981 alloc_reg(¤t,i,rs1[i]);
8982 if(!(current.is32>>rs1[i]&1))
8984 alloc_reg64(¤t,i,rs1[i]);
8986 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
8987 // The delay slot overwrites one of our conditions.
8988 // Allocate the branch condition registers instead.
8992 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8993 if(!((current.is32>>rs1[i])&1))
8995 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9001 delayslot_alloc(¤t,i+1);
9005 // Don't alloc the delay slot yet because we might not execute it
9006 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
9011 alloc_cc(¤t,i);
9012 dirty_reg(¤t,CCREG);
9013 alloc_reg(¤t,i,rs1[i]);
9014 alloc_reg(¤t,i,rs2[i]);
9015 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
9017 alloc_reg64(¤t,i,rs1[i]);
9018 alloc_reg64(¤t,i,rs2[i]);
9022 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
9027 alloc_cc(¤t,i);
9028 dirty_reg(¤t,CCREG);
9029 alloc_reg(¤t,i,rs1[i]);
9030 if(!(current.is32>>rs1[i]&1))
9032 alloc_reg64(¤t,i,rs1[i]);
9036 //current.isconst=0;
9039 //current.isconst=0;
9040 //current.wasconst=0;
9041 //regs[i].wasconst=0;
9042 clear_const(¤t,rs1[i]);
9043 clear_const(¤t,rt1[i]);
9044 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
9045 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
9047 alloc_cc(¤t,i);
9048 dirty_reg(¤t,CCREG);
9049 alloc_reg(¤t,i,rs1[i]);
9050 if(!(current.is32>>rs1[i]&1))
9052 alloc_reg64(¤t,i,rs1[i]);
9054 if (rt1[i]==31) { // BLTZAL/BGEZAL
9055 alloc_reg(¤t,i,31);
9056 dirty_reg(¤t,31);
9057 //#ifdef REG_PREFETCH
9058 //alloc_reg(¤t,i,PTEMP);
9060 //current.is32|=1LL<<rt1[i];
9062 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) // The delay slot overwrites the branch condition.
9063 ||(rt1[i]==31&&(rs1[i+1]==31||rs2[i+1]==31||rt1[i+1]==31||rt2[i+1]==31))) { // DS touches $ra
9064 // Allocate the branch condition registers instead.
9068 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9069 if(!((current.is32>>rs1[i])&1))
9071 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9077 delayslot_alloc(¤t,i+1);
9081 // Don't alloc the delay slot yet because we might not execute it
9082 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
9087 alloc_cc(¤t,i);
9088 dirty_reg(¤t,CCREG);
9089 alloc_reg(¤t,i,rs1[i]);
9090 if(!(current.is32>>rs1[i]&1))
9092 alloc_reg64(¤t,i,rs1[i]);
9096 //current.isconst=0;
9102 if(likely[i]==0) // BC1F/BC1T
9104 // TODO: Theoretically we can run out of registers here on x86.
9105 // The delay slot can allocate up to six, and we need to check
9106 // CSREG before executing the delay slot. Possibly we can drop
9107 // the cycle count and then reload it after checking that the
9108 // FPU is in a usable state, or don't do out-of-order execution.
9109 alloc_cc(¤t,i);
9110 dirty_reg(¤t,CCREG);
9111 alloc_reg(¤t,i,FSREG);
9112 alloc_reg(¤t,i,CSREG);
9113 if(itype[i+1]==FCOMP) {
9114 // The delay slot overwrites the branch condition.
9115 // Allocate the branch condition registers instead.
9116 alloc_cc(¤t,i);
9117 dirty_reg(¤t,CCREG);
9118 alloc_reg(¤t,i,CSREG);
9119 alloc_reg(¤t,i,FSREG);
9123 delayslot_alloc(¤t,i+1);
9124 alloc_reg(¤t,i+1,CSREG);
9128 // Don't alloc the delay slot yet because we might not execute it
9129 if(likely[i]) // BC1FL/BC1TL
9131 alloc_cc(¤t,i);
9132 dirty_reg(¤t,CCREG);
9133 alloc_reg(¤t,i,CSREG);
9134 alloc_reg(¤t,i,FSREG);
9140 imm16_alloc(¤t,i);
9144 load_alloc(¤t,i);
9148 store_alloc(¤t,i);
9151 alu_alloc(¤t,i);
9154 shift_alloc(¤t,i);
9157 multdiv_alloc(¤t,i);
9160 shiftimm_alloc(¤t,i);
9163 mov_alloc(¤t,i);
9166 cop0_alloc(¤t,i);
9170 cop1_alloc(¤t,i);
9173 c1ls_alloc(¤t,i);
9176 c2ls_alloc(¤t,i);
9179 c2op_alloc(¤t,i);
9182 fconv_alloc(¤t,i);
9185 float_alloc(¤t,i);
9188 fcomp_alloc(¤t,i);
9193 syscall_alloc(¤t,i);
9196 pagespan_alloc(¤t,i);
9200 // Drop the upper half of registers that have become 32-bit
9201 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
9202 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9203 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9204 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9207 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
9208 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9209 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9210 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9214 // Create entry (branch target) regmap
9215 for(hr=0;hr<HOST_REGS;hr++)
9218 r=current.regmap[hr];
9220 if(r!=regmap_pre[i][hr]) {
9221 // TODO: delay slot (?)
9222 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9223 if(or<0||(r&63)>=TEMPREG){
9224 regs[i].regmap_entry[hr]=-1;
9228 // Just move it to a different register
9229 regs[i].regmap_entry[hr]=r;
9230 // If it was dirty before, it's still dirty
9231 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9238 regs[i].regmap_entry[hr]=0;
9242 if((current.u>>r)&1) {
9243 regs[i].regmap_entry[hr]=-1;
9244 //regs[i].regmap[hr]=-1;
9245 current.regmap[hr]=-1;
9247 regs[i].regmap_entry[hr]=r;
9250 if((current.uu>>(r&63))&1) {
9251 regs[i].regmap_entry[hr]=-1;
9252 //regs[i].regmap[hr]=-1;
9253 current.regmap[hr]=-1;
9255 regs[i].regmap_entry[hr]=r;
9259 // Branches expect CCREG to be allocated at the target
9260 if(regmap_pre[i][hr]==CCREG)
9261 regs[i].regmap_entry[hr]=CCREG;
9263 regs[i].regmap_entry[hr]=-1;
9266 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9268 /* Branch post-alloc */
9271 current.was32=current.is32;
9272 current.wasdirty=current.dirty;
9273 switch(itype[i-1]) {
9275 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9276 branch_regs[i-1].isconst=0;
9277 branch_regs[i-1].wasconst=0;
9278 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9279 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9280 alloc_cc(&branch_regs[i-1],i-1);
9281 dirty_reg(&branch_regs[i-1],CCREG);
9282 if(rt1[i-1]==31) { // JAL
9283 alloc_reg(&branch_regs[i-1],i-1,31);
9284 dirty_reg(&branch_regs[i-1],31);
9285 branch_regs[i-1].is32|=1LL<<31;
9287 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9288 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9291 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9292 branch_regs[i-1].isconst=0;
9293 branch_regs[i-1].wasconst=0;
9294 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9295 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9296 alloc_cc(&branch_regs[i-1],i-1);
9297 dirty_reg(&branch_regs[i-1],CCREG);
9298 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9299 if(rt1[i-1]!=0) { // JALR
9300 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9301 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9302 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9305 if(rs1[i-1]==31) { // JALR
9306 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9307 #ifndef HOST_IMM_ADDR32
9308 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9312 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9313 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9316 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9318 alloc_cc(¤t,i-1);
9319 dirty_reg(¤t,CCREG);
9320 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9321 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9322 // The delay slot overwrote one of our conditions
9323 // Delay slot goes after the test (in order)
9324 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9325 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9326 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9329 delayslot_alloc(¤t,i);
9334 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9335 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9336 // Alloc the branch condition registers
9337 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9338 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9339 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9341 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9342 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9345 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9346 branch_regs[i-1].isconst=0;
9347 branch_regs[i-1].wasconst=0;
9348 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9349 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9352 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9354 alloc_cc(¤t,i-1);
9355 dirty_reg(¤t,CCREG);
9356 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9357 // The delay slot overwrote the branch condition
9358 // Delay slot goes after the test (in order)
9359 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9360 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9361 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9364 delayslot_alloc(¤t,i);
9369 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9370 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9371 // Alloc the branch condition register
9372 alloc_reg(¤t,i-1,rs1[i-1]);
9373 if(!(current.is32>>rs1[i-1]&1))
9375 alloc_reg64(¤t,i-1,rs1[i-1]);
9378 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9379 branch_regs[i-1].isconst=0;
9380 branch_regs[i-1].wasconst=0;
9381 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9382 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9385 // Alloc the delay slot in case the branch is taken
9386 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9388 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9389 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9390 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9391 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9392 alloc_cc(&branch_regs[i-1],i);
9393 dirty_reg(&branch_regs[i-1],CCREG);
9394 delayslot_alloc(&branch_regs[i-1],i);
9395 branch_regs[i-1].isconst=0;
9396 alloc_reg(¤t,i,CCREG); // Not taken path
9397 dirty_reg(¤t,CCREG);
9398 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9401 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9403 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9404 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9405 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9406 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9407 alloc_cc(&branch_regs[i-1],i);
9408 dirty_reg(&branch_regs[i-1],CCREG);
9409 delayslot_alloc(&branch_regs[i-1],i);
9410 branch_regs[i-1].isconst=0;
9411 alloc_reg(¤t,i,CCREG); // Not taken path
9412 dirty_reg(¤t,CCREG);
9413 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9417 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9418 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9420 alloc_cc(¤t,i-1);
9421 dirty_reg(¤t,CCREG);
9422 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9423 // The delay slot overwrote the branch condition
9424 // Delay slot goes after the test (in order)
9425 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9426 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9427 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9430 delayslot_alloc(¤t,i);
9435 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9436 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9437 // Alloc the branch condition register
9438 alloc_reg(¤t,i-1,rs1[i-1]);
9439 if(!(current.is32>>rs1[i-1]&1))
9441 alloc_reg64(¤t,i-1,rs1[i-1]);
9444 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9445 branch_regs[i-1].isconst=0;
9446 branch_regs[i-1].wasconst=0;
9447 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9448 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9451 // Alloc the delay slot in case the branch is taken
9452 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9454 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9455 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9456 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9457 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9458 alloc_cc(&branch_regs[i-1],i);
9459 dirty_reg(&branch_regs[i-1],CCREG);
9460 delayslot_alloc(&branch_regs[i-1],i);
9461 branch_regs[i-1].isconst=0;
9462 alloc_reg(¤t,i,CCREG); // Not taken path
9463 dirty_reg(¤t,CCREG);
9464 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9466 // FIXME: BLTZAL/BGEZAL
9467 if(opcode2[i-1]&0x10) { // BxxZAL
9468 alloc_reg(&branch_regs[i-1],i-1,31);
9469 dirty_reg(&branch_regs[i-1],31);
9470 branch_regs[i-1].is32|=1LL<<31;
9474 if(likely[i-1]==0) // BC1F/BC1T
9476 alloc_cc(¤t,i-1);
9477 dirty_reg(¤t,CCREG);
9478 if(itype[i]==FCOMP) {
9479 // The delay slot overwrote the branch condition
9480 // Delay slot goes after the test (in order)
9481 delayslot_alloc(¤t,i);
9486 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9487 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9488 // Alloc the branch condition register
9489 alloc_reg(¤t,i-1,FSREG);
9491 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9492 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9496 // Alloc the delay slot in case the branch is taken
9497 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9498 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9499 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9500 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9501 alloc_cc(&branch_regs[i-1],i);
9502 dirty_reg(&branch_regs[i-1],CCREG);
9503 delayslot_alloc(&branch_regs[i-1],i);
9504 branch_regs[i-1].isconst=0;
9505 alloc_reg(¤t,i,CCREG); // Not taken path
9506 dirty_reg(¤t,CCREG);
9507 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9512 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9514 if(rt1[i-1]==31) // JAL/JALR
9516 // Subroutine call will return here, don't alloc any registers
9519 clear_all_regs(current.regmap);
9520 alloc_reg(¤t,i,CCREG);
9521 dirty_reg(¤t,CCREG);
9525 // Internal branch will jump here, match registers to caller
9526 current.is32=0x3FFFFFFFFLL;
9528 clear_all_regs(current.regmap);
9529 alloc_reg(¤t,i,CCREG);
9530 dirty_reg(¤t,CCREG);
9533 if(ba[j]==start+i*4+4) {
9534 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9535 current.is32=branch_regs[j].is32;
9536 current.dirty=branch_regs[j].dirty;
9541 if(ba[j]==start+i*4+4) {
9542 for(hr=0;hr<HOST_REGS;hr++) {
9543 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9544 current.regmap[hr]=-1;
9546 current.is32&=branch_regs[j].is32;
9547 current.dirty&=branch_regs[j].dirty;
9556 // Count cycles in between branches
9558 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))
9563 else if(/*itype[i]==LOAD||*/itype[i]==STORE||itype[i]==C1LS) // load causes weird timing issues
9565 cc+=2; // 2 cycle penalty (after CLOCK_DIVIDER)
9567 else if(itype[i]==C2LS)
9577 flush_dirty_uppers(¤t);
9579 regs[i].is32=current.is32;
9580 regs[i].dirty=current.dirty;
9581 regs[i].isconst=current.isconst;
9582 memcpy(constmap[i],current.constmap,sizeof(current.constmap));
9584 for(hr=0;hr<HOST_REGS;hr++) {
9585 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9586 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9587 regs[i].wasconst&=~(1<<hr);
9591 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9594 /* Pass 4 - Cull unused host registers */
9598 for (i=slen-1;i>=0;i--)
9601 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9603 if(ba[i]<start || ba[i]>=(start+slen*4))
9605 // Branch out of this block, don't need anything
9611 // Need whatever matches the target
9613 int t=(ba[i]-start)>>2;
9614 for(hr=0;hr<HOST_REGS;hr++)
9616 if(regs[i].regmap_entry[hr]>=0) {
9617 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9621 // Conditional branch may need registers for following instructions
9622 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9625 nr|=needed_reg[i+2];
9626 for(hr=0;hr<HOST_REGS;hr++)
9628 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9629 //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]);
9633 // Don't need stuff which is overwritten
9634 //if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9635 //if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9636 // Merge in delay slot
9637 for(hr=0;hr<HOST_REGS;hr++)
9640 // These are overwritten unless the branch is "likely"
9641 // and the delay slot is nullified if not taken
9642 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9643 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9645 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9646 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9647 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9648 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9649 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9650 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9651 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9652 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9653 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
9654 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9655 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9657 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
9658 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9659 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9661 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
9662 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9663 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9667 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
9669 // SYSCALL instruction (software interrupt)
9672 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
9674 // ERET instruction (return from interrupt)
9680 for(hr=0;hr<HOST_REGS;hr++) {
9681 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
9682 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
9683 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9684 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9688 for(hr=0;hr<HOST_REGS;hr++)
9690 // Overwritten registers are not needed
9691 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9692 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9693 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9694 // Source registers are needed
9695 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9696 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9697 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
9698 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
9699 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9700 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9701 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9702 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9703 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
9704 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9705 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9707 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
9708 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9709 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9711 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
9712 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9713 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9715 // Don't store a register immediately after writing it,
9716 // may prevent dual-issue.
9717 // But do so if this is a branch target, otherwise we
9718 // might have to load the register before the branch.
9719 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
9720 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
9721 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
9722 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9723 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9725 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
9726 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
9727 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9728 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9732 // Cycle count is needed at branches. Assume it is needed at the target too.
9733 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
9734 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9735 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9740 // Deallocate unneeded registers
9741 for(hr=0;hr<HOST_REGS;hr++)
9744 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
9745 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9746 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9747 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
9749 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9752 regs[i].regmap[hr]=-1;
9753 regs[i].isconst&=~(1<<hr);
9754 if(i<slen-2) regmap_pre[i+2][hr]=-1;
9758 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9760 int d1=0,d2=0,map=0,temp=0;
9761 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
9767 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
9768 itype[i+1]==STORE || itype[i+1]==STORELR ||
9769 itype[i+1]==C1LS || itype[i+1]==C2LS)
9772 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
9773 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9776 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
9777 itype[i+1]==C1LS || itype[i+1]==C2LS)
9779 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9780 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9781 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
9782 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
9783 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9784 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
9785 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
9786 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
9787 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
9788 regs[i].regmap[hr]!=map )
9790 regs[i].regmap[hr]=-1;
9791 regs[i].isconst&=~(1<<hr);
9792 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
9793 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
9794 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
9795 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
9796 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
9797 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
9798 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
9799 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
9800 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
9801 branch_regs[i].regmap[hr]!=map)
9803 branch_regs[i].regmap[hr]=-1;
9804 branch_regs[i].regmap_entry[hr]=-1;
9805 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9807 if(!likely[i]&&i<slen-2) {
9808 regmap_pre[i+2][hr]=-1;
9819 int d1=0,d2=0,map=-1,temp=-1;
9820 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
9826 if(itype[i]==LOAD || itype[i]==LOADLR ||
9827 itype[i]==STORE || itype[i]==STORELR ||
9828 itype[i]==C1LS || itype[i]==C2LS)
9830 } else if(itype[i]==STORE || itype[i]==STORELR ||
9831 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9834 if(itype[i]==LOADLR || itype[i]==STORELR ||
9835 itype[i]==C1LS || itype[i]==C2LS)
9837 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9838 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
9839 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9840 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
9841 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
9842 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
9844 if(i<slen-1&&!is_ds[i]) {
9845 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
9846 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
9847 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
9849 printf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
9850 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
9852 regmap_pre[i+1][hr]=-1;
9853 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
9855 regs[i].regmap[hr]=-1;
9856 regs[i].isconst&=~(1<<hr);
9864 /* Pass 5 - Pre-allocate registers */
9866 // If a register is allocated during a loop, try to allocate it for the
9867 // entire loop, if possible. This avoids loading/storing registers
9868 // inside of the loop.
9870 signed char f_regmap[HOST_REGS];
9871 clear_all_regs(f_regmap);
9872 for(i=0;i<slen-1;i++)
9874 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9876 if(ba[i]>=start && ba[i]<(start+i*4))
9877 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
9878 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
9879 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9880 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9881 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9882 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9884 int t=(ba[i]-start)>>2;
9885 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
9886 if(t<2||(itype[t-2]!=UJUMP)) // call/ret assumes no registers allocated
9887 for(hr=0;hr<HOST_REGS;hr++)
9889 if(regs[i].regmap[hr]>64) {
9890 if(!((regs[i].dirty>>hr)&1))
9891 f_regmap[hr]=regs[i].regmap[hr];
9892 else f_regmap[hr]=-1;
9894 else if(regs[i].regmap[hr]>=0) {
9895 if(f_regmap[hr]!=regs[i].regmap[hr]) {
9896 // dealloc old register
9898 for(n=0;n<HOST_REGS;n++)
9900 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
9902 // and alloc new one
9903 f_regmap[hr]=regs[i].regmap[hr];
9906 if(branch_regs[i].regmap[hr]>64) {
9907 if(!((branch_regs[i].dirty>>hr)&1))
9908 f_regmap[hr]=branch_regs[i].regmap[hr];
9909 else f_regmap[hr]=-1;
9911 else if(branch_regs[i].regmap[hr]>=0) {
9912 if(f_regmap[hr]!=branch_regs[i].regmap[hr]) {
9913 // dealloc old register
9915 for(n=0;n<HOST_REGS;n++)
9917 if(f_regmap[n]==branch_regs[i].regmap[hr]) {f_regmap[n]=-1;}
9919 // and alloc new one
9920 f_regmap[hr]=branch_regs[i].regmap[hr];
9924 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1])
9925 f_regmap[hr]=branch_regs[i].regmap[hr];
9927 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1])
9928 f_regmap[hr]=branch_regs[i].regmap[hr];
9930 // Avoid dirty->clean transition
9931 #ifdef DESTRUCTIVE_WRITEBACK
9932 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;
9934 // This check is only strictly required in the DESTRUCTIVE_WRITEBACK
9935 // case above, however it's always a good idea. We can't hoist the
9936 // load if the register was already allocated, so there's no point
9937 // wasting time analyzing most of these cases. It only "succeeds"
9938 // when the mapping was different and the load can be replaced with
9939 // a mov, which is of negligible benefit. So such cases are
9941 if(f_regmap[hr]>0) {
9942 if(regs[t].regmap_entry[hr]<0&&get_reg(regmap_pre[t],f_regmap[hr])<0) {
9946 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9947 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
9948 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
9950 // NB This can exclude the case where the upper-half
9951 // register is lower numbered than the lower-half
9952 // register. Not sure if it's worth fixing...
9953 if(get_reg(regs[j].regmap,r&63)<0) break;
9954 if(get_reg(regs[j].regmap_entry,r&63)<0) break;
9955 if(regs[j].is32&(1LL<<(r&63))) break;
9957 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
9958 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9960 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
9961 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
9963 if(get_reg(regs[i].regmap,r&63)<0) break;
9964 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
9967 while(k>1&®s[k-1].regmap[hr]==-1) {
9968 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
9969 //printf("no free regs for store %x\n",start+(k-1)*4);
9972 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
9973 //printf("no-match due to different register\n");
9976 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
9977 //printf("no-match due to branch\n");
9980 // call/ret fast path assumes no registers allocated
9981 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)) {
9985 // NB This can exclude the case where the upper-half
9986 // register is lower numbered than the lower-half
9987 // register. Not sure if it's worth fixing...
9988 if(get_reg(regs[k-1].regmap,r&63)<0) break;
9989 if(regs[k-1].is32&(1LL<<(r&63))) break;
9994 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
9995 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
9996 //printf("bad match after branch\n");
10000 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
10001 //printf("Extend r%d, %x ->\n",hr,start+k*4);
10003 regs[k].regmap_entry[hr]=f_regmap[hr];
10004 regs[k].regmap[hr]=f_regmap[hr];
10005 regmap_pre[k+1][hr]=f_regmap[hr];
10006 regs[k].wasdirty&=~(1<<hr);
10007 regs[k].dirty&=~(1<<hr);
10008 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
10009 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
10010 regs[k].wasconst&=~(1<<hr);
10011 regs[k].isconst&=~(1<<hr);
10016 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
10019 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
10020 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
10021 //printf("OK fill %x (r%d)\n",start+i*4,hr);
10022 regs[i].regmap_entry[hr]=f_regmap[hr];
10023 regs[i].regmap[hr]=f_regmap[hr];
10024 regs[i].wasdirty&=~(1<<hr);
10025 regs[i].dirty&=~(1<<hr);
10026 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
10027 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
10028 regs[i].wasconst&=~(1<<hr);
10029 regs[i].isconst&=~(1<<hr);
10030 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
10031 branch_regs[i].wasdirty&=~(1<<hr);
10032 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
10033 branch_regs[i].regmap[hr]=f_regmap[hr];
10034 branch_regs[i].dirty&=~(1<<hr);
10035 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
10036 branch_regs[i].wasconst&=~(1<<hr);
10037 branch_regs[i].isconst&=~(1<<hr);
10038 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
10039 regmap_pre[i+2][hr]=f_regmap[hr];
10040 regs[i+2].wasdirty&=~(1<<hr);
10041 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
10042 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
10043 (regs[i+2].was32&(1LL<<f_regmap[hr])));
10048 // Alloc register clean at beginning of loop,
10049 // but may dirty it in pass 6
10050 regs[k].regmap_entry[hr]=f_regmap[hr];
10051 regs[k].regmap[hr]=f_regmap[hr];
10052 regs[k].dirty&=~(1<<hr);
10053 regs[k].wasconst&=~(1<<hr);
10054 regs[k].isconst&=~(1<<hr);
10055 if(itype[k]==UJUMP||itype[k]==RJUMP||itype[k]==CJUMP||itype[k]==SJUMP||itype[k]==FJUMP) {
10056 branch_regs[k].regmap_entry[hr]=f_regmap[hr];
10057 branch_regs[k].regmap[hr]=f_regmap[hr];
10058 branch_regs[k].dirty&=~(1<<hr);
10059 branch_regs[k].wasconst&=~(1<<hr);
10060 branch_regs[k].isconst&=~(1<<hr);
10061 if(itype[k]!=RJUMP&&itype[k]!=UJUMP&&(source[k]>>16)!=0x1000) {
10062 regmap_pre[k+2][hr]=f_regmap[hr];
10063 regs[k+2].wasdirty&=~(1<<hr);
10064 assert((branch_regs[k].is32&(1LL<<f_regmap[hr]))==
10065 (regs[k+2].was32&(1LL<<f_regmap[hr])));
10070 regmap_pre[k+1][hr]=f_regmap[hr];
10071 regs[k+1].wasdirty&=~(1<<hr);
10074 if(regs[j].regmap[hr]==f_regmap[hr])
10075 regs[j].regmap_entry[hr]=f_regmap[hr];
10079 if(regs[j].regmap[hr]>=0)
10081 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
10082 //printf("no-match due to different register\n");
10085 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
10086 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
10089 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10091 // Stop on unconditional branch
10094 if(itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP)
10097 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1])
10100 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1])
10103 if(get_reg(branch_regs[j].regmap,f_regmap[hr])>=0) {
10104 //printf("no-match due to different register (branch)\n");
10108 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10109 //printf("No free regs for store %x\n",start+j*4);
10112 if(f_regmap[hr]>=64) {
10113 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
10118 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
10130 for(hr=0;hr<HOST_REGS;hr++)
10132 if(hr!=EXCLUDE_REG) {
10133 if(regs[i].regmap[hr]>64) {
10134 if(!((regs[i].dirty>>hr)&1))
10135 f_regmap[hr]=regs[i].regmap[hr];
10137 else if(regs[i].regmap[hr]>=0) {
10138 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10139 // dealloc old register
10141 for(n=0;n<HOST_REGS;n++)
10143 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10145 // and alloc new one
10146 f_regmap[hr]=regs[i].regmap[hr];
10149 else if(regs[i].regmap[hr]<0) count++;
10152 // Try to restore cycle count at branch targets
10154 for(j=i;j<slen-1;j++) {
10155 if(regs[j].regmap[HOST_CCREG]!=-1) break;
10156 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10157 //printf("no free regs for store %x\n",start+j*4);
10161 if(regs[j].regmap[HOST_CCREG]==CCREG) {
10163 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
10165 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10166 regs[k].regmap[HOST_CCREG]=CCREG;
10167 regmap_pre[k+1][HOST_CCREG]=CCREG;
10168 regs[k+1].wasdirty|=1<<HOST_CCREG;
10169 regs[k].dirty|=1<<HOST_CCREG;
10170 regs[k].wasconst&=~(1<<HOST_CCREG);
10171 regs[k].isconst&=~(1<<HOST_CCREG);
10174 regs[j].regmap_entry[HOST_CCREG]=CCREG;
10176 // Work backwards from the branch target
10177 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
10179 //printf("Extend backwards\n");
10182 while(regs[k-1].regmap[HOST_CCREG]==-1) {
10183 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10184 //printf("no free regs for store %x\n",start+(k-1)*4);
10189 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
10190 //printf("Extend CC, %x ->\n",start+k*4);
10192 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10193 regs[k].regmap[HOST_CCREG]=CCREG;
10194 regmap_pre[k+1][HOST_CCREG]=CCREG;
10195 regs[k+1].wasdirty|=1<<HOST_CCREG;
10196 regs[k].dirty|=1<<HOST_CCREG;
10197 regs[k].wasconst&=~(1<<HOST_CCREG);
10198 regs[k].isconst&=~(1<<HOST_CCREG);
10203 //printf("Fail Extend CC, %x ->\n",start+k*4);
10207 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
10208 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
10209 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
10210 itype[i]!=FCONV&&itype[i]!=FCOMP)
10212 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
10217 // This allocates registers (if possible) one instruction prior
10218 // to use, which can avoid a load-use penalty on certain CPUs.
10219 for(i=0;i<slen-1;i++)
10221 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
10225 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
10226 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
10229 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
10231 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10233 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10234 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10235 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10236 regs[i].isconst&=~(1<<hr);
10237 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10238 constmap[i][hr]=constmap[i+1][hr];
10239 regs[i+1].wasdirty&=~(1<<hr);
10240 regs[i].dirty&=~(1<<hr);
10245 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
10247 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10249 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10250 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10251 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10252 regs[i].isconst&=~(1<<hr);
10253 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10254 constmap[i][hr]=constmap[i+1][hr];
10255 regs[i+1].wasdirty&=~(1<<hr);
10256 regs[i].dirty&=~(1<<hr);
10260 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10261 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10263 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10265 regs[i].regmap[hr]=rs1[i+1];
10266 regmap_pre[i+1][hr]=rs1[i+1];
10267 regs[i+1].regmap_entry[hr]=rs1[i+1];
10268 regs[i].isconst&=~(1<<hr);
10269 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10270 constmap[i][hr]=constmap[i+1][hr];
10271 regs[i+1].wasdirty&=~(1<<hr);
10272 regs[i].dirty&=~(1<<hr);
10276 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10277 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10279 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10281 regs[i].regmap[hr]=rs1[i+1];
10282 regmap_pre[i+1][hr]=rs1[i+1];
10283 regs[i+1].regmap_entry[hr]=rs1[i+1];
10284 regs[i].isconst&=~(1<<hr);
10285 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10286 constmap[i][hr]=constmap[i+1][hr];
10287 regs[i+1].wasdirty&=~(1<<hr);
10288 regs[i].dirty&=~(1<<hr);
10292 #ifndef HOST_IMM_ADDR32
10293 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) {
10294 hr=get_reg(regs[i+1].regmap,TLREG);
10296 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10297 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10299 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10301 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10302 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10303 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10304 regs[i].isconst&=~(1<<hr);
10305 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10306 constmap[i][hr]=constmap[i+1][hr];
10307 regs[i+1].wasdirty&=~(1<<hr);
10308 regs[i].dirty&=~(1<<hr);
10310 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10312 // move it to another register
10313 regs[i+1].regmap[hr]=-1;
10314 regmap_pre[i+2][hr]=-1;
10315 regs[i+1].regmap[nr]=TLREG;
10316 regmap_pre[i+2][nr]=TLREG;
10317 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10318 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10319 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10320 regs[i].isconst&=~(1<<nr);
10321 regs[i+1].isconst&=~(1<<nr);
10322 regs[i].dirty&=~(1<<nr);
10323 regs[i+1].wasdirty&=~(1<<nr);
10324 regs[i+1].dirty&=~(1<<nr);
10325 regs[i+2].wasdirty&=~(1<<nr);
10331 if(itype[i+1]==STORE||itype[i+1]==STORELR
10332 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10333 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10334 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10335 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10336 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10338 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10340 regs[i].regmap[hr]=rs1[i+1];
10341 regmap_pre[i+1][hr]=rs1[i+1];
10342 regs[i+1].regmap_entry[hr]=rs1[i+1];
10343 regs[i].isconst&=~(1<<hr);
10344 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10345 constmap[i][hr]=constmap[i+1][hr];
10346 regs[i+1].wasdirty&=~(1<<hr);
10347 regs[i].dirty&=~(1<<hr);
10351 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10352 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10354 hr=get_reg(regs[i+1].regmap,FTEMP);
10356 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10358 regs[i].regmap[hr]=rs1[i+1];
10359 regmap_pre[i+1][hr]=rs1[i+1];
10360 regs[i+1].regmap_entry[hr]=rs1[i+1];
10361 regs[i].isconst&=~(1<<hr);
10362 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10363 constmap[i][hr]=constmap[i+1][hr];
10364 regs[i+1].wasdirty&=~(1<<hr);
10365 regs[i].dirty&=~(1<<hr);
10367 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10369 // move it to another register
10370 regs[i+1].regmap[hr]=-1;
10371 regmap_pre[i+2][hr]=-1;
10372 regs[i+1].regmap[nr]=FTEMP;
10373 regmap_pre[i+2][nr]=FTEMP;
10374 regs[i].regmap[nr]=rs1[i+1];
10375 regmap_pre[i+1][nr]=rs1[i+1];
10376 regs[i+1].regmap_entry[nr]=rs1[i+1];
10377 regs[i].isconst&=~(1<<nr);
10378 regs[i+1].isconst&=~(1<<nr);
10379 regs[i].dirty&=~(1<<nr);
10380 regs[i+1].wasdirty&=~(1<<nr);
10381 regs[i+1].dirty&=~(1<<nr);
10382 regs[i+2].wasdirty&=~(1<<nr);
10386 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*/) {
10387 if(itype[i+1]==LOAD)
10388 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10389 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10390 hr=get_reg(regs[i+1].regmap,FTEMP);
10391 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10392 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10393 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10395 if(hr>=0&®s[i].regmap[hr]<0) {
10396 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10397 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10398 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10399 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10400 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10401 regs[i].isconst&=~(1<<hr);
10402 regs[i+1].wasdirty&=~(1<<hr);
10403 regs[i].dirty&=~(1<<hr);
10412 /* Pass 6 - Optimize clean/dirty state */
10413 clean_registers(0,slen-1,1);
10415 /* Pass 7 - Identify 32-bit registers */
10421 for (i=slen-1;i>=0;i--)
10424 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10426 if(ba[i]<start || ba[i]>=(start+slen*4))
10428 // Branch out of this block, don't need anything
10434 // Need whatever matches the target
10435 // (and doesn't get overwritten by the delay slot instruction)
10437 int t=(ba[i]-start)>>2;
10438 if(ba[i]>start+i*4) {
10440 if(!(requires_32bit[t]&~regs[i].was32))
10441 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10444 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10445 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10446 if(!(pr32[t]&~regs[i].was32))
10447 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10450 // Conditional branch may need registers for following instructions
10451 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10454 r32|=requires_32bit[i+2];
10455 r32&=regs[i].was32;
10456 // Mark this address as a branch target since it may be called
10457 // upon return from interrupt
10461 // Merge in delay slot
10463 // These are overwritten unless the branch is "likely"
10464 // and the delay slot is nullified if not taken
10465 r32&=~(1LL<<rt1[i+1]);
10466 r32&=~(1LL<<rt2[i+1]);
10468 // Assume these are needed (delay slot)
10471 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
10475 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
10477 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
10479 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
10481 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
10483 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
10486 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
10488 // SYSCALL instruction (software interrupt)
10491 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10493 // ERET instruction (return from interrupt)
10497 r32&=~(1LL<<rt1[i]);
10498 r32&=~(1LL<<rt2[i]);
10501 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
10505 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
10507 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
10509 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
10511 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
10513 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
10515 requires_32bit[i]=r32;
10517 // Dirty registers which are 32-bit, require 32-bit input
10518 // as they will be written as 32-bit values
10519 for(hr=0;hr<HOST_REGS;hr++)
10521 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
10522 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
10523 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
10524 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
10528 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
10531 for (i=slen-1;i>=0;i--)
10533 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10535 // Conditional branch
10536 if((source[i]>>16)!=0x1000&&i<slen-2) {
10537 // Mark this address as a branch target since it may be called
10538 // upon return from interrupt
10545 if(itype[slen-1]==SPAN) {
10546 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
10549 /* Debug/disassembly */
10550 if((void*)assem_debug==(void*)printf)
10551 for(i=0;i<slen;i++)
10555 for(r=1;r<=CCREG;r++) {
10556 if((unneeded_reg[i]>>r)&1) {
10557 if(r==HIREG) printf(" HI");
10558 else if(r==LOREG) printf(" LO");
10559 else printf(" r%d",r);
10564 for(r=1;r<=CCREG;r++) {
10565 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
10566 if(r==HIREG) printf(" HI");
10567 else if(r==LOREG) printf(" LO");
10568 else printf(" r%d",r);
10572 for(r=0;r<=CCREG;r++) {
10573 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10574 if((regs[i].was32>>r)&1) {
10575 if(r==CCREG) printf(" CC");
10576 else if(r==HIREG) printf(" HI");
10577 else if(r==LOREG) printf(" LO");
10578 else printf(" r%d",r);
10583 #if defined(__i386__) || defined(__x86_64__)
10584 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]);
10587 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]);
10590 if(needed_reg[i]&1) printf("eax ");
10591 if((needed_reg[i]>>1)&1) printf("ecx ");
10592 if((needed_reg[i]>>2)&1) printf("edx ");
10593 if((needed_reg[i]>>3)&1) printf("ebx ");
10594 if((needed_reg[i]>>5)&1) printf("ebp ");
10595 if((needed_reg[i]>>6)&1) printf("esi ");
10596 if((needed_reg[i]>>7)&1) printf("edi ");
10598 for(r=0;r<=CCREG;r++) {
10599 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10600 if((requires_32bit[i]>>r)&1) {
10601 if(r==CCREG) printf(" CC");
10602 else if(r==HIREG) printf(" HI");
10603 else if(r==LOREG) printf(" LO");
10604 else printf(" r%d",r);
10609 for(r=0;r<=CCREG;r++) {
10610 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10611 if((pr32[i]>>r)&1) {
10612 if(r==CCREG) printf(" CC");
10613 else if(r==HIREG) printf(" HI");
10614 else if(r==LOREG) printf(" LO");
10615 else printf(" r%d",r);
10618 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
10620 #if defined(__i386__) || defined(__x86_64__)
10621 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]);
10623 if(regs[i].wasdirty&1) printf("eax ");
10624 if((regs[i].wasdirty>>1)&1) printf("ecx ");
10625 if((regs[i].wasdirty>>2)&1) printf("edx ");
10626 if((regs[i].wasdirty>>3)&1) printf("ebx ");
10627 if((regs[i].wasdirty>>5)&1) printf("ebp ");
10628 if((regs[i].wasdirty>>6)&1) printf("esi ");
10629 if((regs[i].wasdirty>>7)&1) printf("edi ");
10632 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]);
10634 if(regs[i].wasdirty&1) printf("r0 ");
10635 if((regs[i].wasdirty>>1)&1) printf("r1 ");
10636 if((regs[i].wasdirty>>2)&1) printf("r2 ");
10637 if((regs[i].wasdirty>>3)&1) printf("r3 ");
10638 if((regs[i].wasdirty>>4)&1) printf("r4 ");
10639 if((regs[i].wasdirty>>5)&1) printf("r5 ");
10640 if((regs[i].wasdirty>>6)&1) printf("r6 ");
10641 if((regs[i].wasdirty>>7)&1) printf("r7 ");
10642 if((regs[i].wasdirty>>8)&1) printf("r8 ");
10643 if((regs[i].wasdirty>>9)&1) printf("r9 ");
10644 if((regs[i].wasdirty>>10)&1) printf("r10 ");
10645 if((regs[i].wasdirty>>12)&1) printf("r12 ");
10648 disassemble_inst(i);
10649 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
10650 #if defined(__i386__) || defined(__x86_64__)
10651 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]);
10652 if(regs[i].dirty&1) printf("eax ");
10653 if((regs[i].dirty>>1)&1) printf("ecx ");
10654 if((regs[i].dirty>>2)&1) printf("edx ");
10655 if((regs[i].dirty>>3)&1) printf("ebx ");
10656 if((regs[i].dirty>>5)&1) printf("ebp ");
10657 if((regs[i].dirty>>6)&1) printf("esi ");
10658 if((regs[i].dirty>>7)&1) printf("edi ");
10661 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]);
10662 if(regs[i].dirty&1) printf("r0 ");
10663 if((regs[i].dirty>>1)&1) printf("r1 ");
10664 if((regs[i].dirty>>2)&1) printf("r2 ");
10665 if((regs[i].dirty>>3)&1) printf("r3 ");
10666 if((regs[i].dirty>>4)&1) printf("r4 ");
10667 if((regs[i].dirty>>5)&1) printf("r5 ");
10668 if((regs[i].dirty>>6)&1) printf("r6 ");
10669 if((regs[i].dirty>>7)&1) printf("r7 ");
10670 if((regs[i].dirty>>8)&1) printf("r8 ");
10671 if((regs[i].dirty>>9)&1) printf("r9 ");
10672 if((regs[i].dirty>>10)&1) printf("r10 ");
10673 if((regs[i].dirty>>12)&1) printf("r12 ");
10676 if(regs[i].isconst) {
10677 printf("constants: ");
10678 #if defined(__i386__) || defined(__x86_64__)
10679 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
10680 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
10681 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
10682 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
10683 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
10684 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
10685 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
10688 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
10689 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
10690 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
10691 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
10692 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
10693 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
10694 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
10695 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
10696 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
10697 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
10698 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
10699 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
10705 for(r=0;r<=CCREG;r++) {
10706 if((regs[i].is32>>r)&1) {
10707 if(r==CCREG) printf(" CC");
10708 else if(r==HIREG) printf(" HI");
10709 else if(r==LOREG) printf(" LO");
10710 else printf(" r%d",r);
10716 for(r=0;r<=CCREG;r++) {
10717 if((p32[i]>>r)&1) {
10718 if(r==CCREG) printf(" CC");
10719 else if(r==HIREG) printf(" HI");
10720 else if(r==LOREG) printf(" LO");
10721 else printf(" r%d",r);
10724 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
10725 else printf("\n");*/
10726 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10727 #if defined(__i386__) || defined(__x86_64__)
10728 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]);
10729 if(branch_regs[i].dirty&1) printf("eax ");
10730 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
10731 if((branch_regs[i].dirty>>2)&1) printf("edx ");
10732 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
10733 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
10734 if((branch_regs[i].dirty>>6)&1) printf("esi ");
10735 if((branch_regs[i].dirty>>7)&1) printf("edi ");
10738 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]);
10739 if(branch_regs[i].dirty&1) printf("r0 ");
10740 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
10741 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
10742 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
10743 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
10744 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
10745 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
10746 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
10747 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
10748 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
10749 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
10750 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
10754 for(r=0;r<=CCREG;r++) {
10755 if((branch_regs[i].is32>>r)&1) {
10756 if(r==CCREG) printf(" CC");
10757 else if(r==HIREG) printf(" HI");
10758 else if(r==LOREG) printf(" LO");
10759 else printf(" r%d",r);
10767 /* Pass 8 - Assembly */
10768 linkcount=0;stubcount=0;
10769 ds=0;is_delayslot=0;
10771 uint64_t is32_pre=0;
10773 u_int beginning=(u_int)out;
10774 if((u_int)addr&1) {
10778 u_int instr_addr0_override=0;
10781 if (start == 0x80030000) {
10782 // nasty hack for fastbios thing
10783 instr_addr0_override=(u_int)out;
10784 emit_movimm(start,0);
10785 emit_readword((int)&pcaddr,1);
10786 emit_writeword(0,(int)&pcaddr);
10788 emit_jne((int)new_dyna_leave);
10791 for(i=0;i<slen;i++)
10793 //if(ds) printf("ds: ");
10794 if((void*)assem_debug==(void*)printf) disassemble_inst(i);
10796 ds=0; // Skip delay slot
10797 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
10800 #ifndef DESTRUCTIVE_WRITEBACK
10801 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10803 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
10804 unneeded_reg[i],unneeded_reg_upper[i]);
10805 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
10806 unneeded_reg[i],unneeded_reg_upper[i]);
10808 is32_pre=regs[i].is32;
10809 dirty_pre=regs[i].dirty;
10812 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10814 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
10815 unneeded_reg[i],unneeded_reg_upper[i]);
10816 loop_preload(regmap_pre[i],regs[i].regmap_entry);
10818 // branch target entry point
10819 instr_addr[i]=(u_int)out;
10820 assem_debug("<->\n");
10822 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
10823 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
10824 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
10825 address_generation(i,®s[i],regs[i].regmap_entry);
10826 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
10827 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10829 // Load the delay slot registers if necessary
10830 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i]&&(rs1[i+1]!=rt1[i]||rt1[i]==0))
10831 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10832 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))
10833 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10834 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
10835 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10839 // Preload registers for following instruction
10840 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10841 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
10842 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10843 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10844 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
10845 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10847 // TODO: if(is_ooo(i)) address_generation(i+1);
10848 if(itype[i]==CJUMP||itype[i]==FJUMP)
10849 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
10850 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
10851 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10852 if(bt[i]) cop1_usable=0;
10856 alu_assemble(i,®s[i]);break;
10858 imm16_assemble(i,®s[i]);break;
10860 shift_assemble(i,®s[i]);break;
10862 shiftimm_assemble(i,®s[i]);break;
10864 load_assemble(i,®s[i]);break;
10866 loadlr_assemble(i,®s[i]);break;
10868 store_assemble(i,®s[i]);break;
10870 storelr_assemble(i,®s[i]);break;
10872 cop0_assemble(i,®s[i]);break;
10874 cop1_assemble(i,®s[i]);break;
10876 c1ls_assemble(i,®s[i]);break;
10878 cop2_assemble(i,®s[i]);break;
10880 c2ls_assemble(i,®s[i]);break;
10882 c2op_assemble(i,®s[i]);break;
10884 fconv_assemble(i,®s[i]);break;
10886 float_assemble(i,®s[i]);break;
10888 fcomp_assemble(i,®s[i]);break;
10890 multdiv_assemble(i,®s[i]);break;
10892 mov_assemble(i,®s[i]);break;
10894 syscall_assemble(i,®s[i]);break;
10896 hlecall_assemble(i,®s[i]);break;
10898 intcall_assemble(i,®s[i]);break;
10900 ujump_assemble(i,®s[i]);ds=1;break;
10902 rjump_assemble(i,®s[i]);ds=1;break;
10904 cjump_assemble(i,®s[i]);ds=1;break;
10906 sjump_assemble(i,®s[i]);ds=1;break;
10908 fjump_assemble(i,®s[i]);ds=1;break;
10910 pagespan_assemble(i,®s[i]);break;
10912 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10913 literal_pool(1024);
10915 literal_pool_jumpover(256);
10918 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
10919 // If the block did not end with an unconditional branch,
10920 // add a jump to the next instruction.
10922 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
10923 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10925 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
10926 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10927 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10928 emit_loadreg(CCREG,HOST_CCREG);
10929 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10931 else if(!likely[i-2])
10933 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
10934 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
10938 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
10939 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
10941 add_to_linker((int)out,start+i*4,0);
10948 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10949 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10950 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10951 emit_loadreg(CCREG,HOST_CCREG);
10952 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10953 add_to_linker((int)out,start+i*4,0);
10957 // TODO: delay slot stubs?
10959 for(i=0;i<stubcount;i++)
10961 switch(stubs[i][0])
10969 do_readstub(i);break;
10974 do_writestub(i);break;
10976 do_ccstub(i);break;
10978 do_invstub(i);break;
10980 do_cop1stub(i);break;
10982 do_unalignedwritestub(i);break;
10986 if (instr_addr0_override)
10987 instr_addr[0] = instr_addr0_override;
10989 /* Pass 9 - Linker */
10990 for(i=0;i<linkcount;i++)
10992 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
10994 if(!link_addr[i][2])
10997 void *addr=check_addr(link_addr[i][1]);
10998 emit_extjump(link_addr[i][0],link_addr[i][1]);
11000 set_jump_target(link_addr[i][0],(int)addr);
11001 add_link(link_addr[i][1],stub);
11003 else set_jump_target(link_addr[i][0],(int)stub);
11008 int target=(link_addr[i][1]-start)>>2;
11009 assert(target>=0&&target<slen);
11010 assert(instr_addr[target]);
11011 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11012 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
11014 set_jump_target(link_addr[i][0],instr_addr[target]);
11018 // External Branch Targets (jump_in)
11019 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
11020 for(i=0;i<slen;i++)
11024 if(instr_addr[i]) // TODO - delay slots (=null)
11026 u_int vaddr=start+i*4;
11027 u_int page=get_page(vaddr);
11028 u_int vpage=get_vpage(vaddr);
11030 //if(!(is32[i]&(~unneeded_reg_upper[i])&~(1LL<<CCREG)))
11032 if(!requires_32bit[i])
11037 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11038 assem_debug("jump_in: %x\n",start+i*4);
11039 ll_add(jump_dirty+vpage,vaddr,(void *)out);
11040 int entry_point=do_dirty_stub(i);
11041 ll_add(jump_in+page,vaddr,(void *)entry_point);
11042 // If there was an existing entry in the hash table,
11043 // replace it with the new address.
11044 // Don't add new entries. We'll insert the
11045 // ones that actually get used in check_addr().
11046 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
11047 if(ht_bin[0]==vaddr) {
11048 ht_bin[1]=entry_point;
11050 if(ht_bin[2]==vaddr) {
11051 ht_bin[3]=entry_point;
11056 u_int r=requires_32bit[i]|!!(requires_32bit[i]>>32);
11057 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11058 assem_debug("jump_in: %x (restricted - %x)\n",start+i*4,r);
11059 //int entry_point=(int)out;
11060 ////assem_debug("entry_point: %x\n",entry_point);
11061 //load_regs_entry(i);
11062 //if(entry_point==(int)out)
11063 // entry_point=instr_addr[i];
11065 // emit_jmp(instr_addr[i]);
11066 //ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
11067 ll_add_32(jump_dirty+vpage,vaddr,r,(void *)out);
11068 int entry_point=do_dirty_stub(i);
11069 ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
11074 // Write out the literal pool if necessary
11076 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11078 if(((u_int)out)&7) emit_addnop(13);
11080 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
11081 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
11082 memcpy(copy,source,slen*4);
11086 __clear_cache((void *)beginning,out);
11089 // If we're within 256K of the end of the buffer,
11090 // start over from the beginning. (Is 256K enough?)
11091 if((int)out>BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
11093 // Trap writes to any of the pages we compiled
11094 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
11096 #ifndef DISABLE_TLB
11097 memory_map[i]|=0x40000000;
11098 if((signed int)start>=(signed int)0xC0000000) {
11100 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
11102 memory_map[j]|=0x40000000;
11103 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
11108 // PCSX maps all RAM mirror invalid_code tests to 0x80000000..0x80000000+RAM_SIZE
11109 if(get_page(start)<(RAM_SIZE>>12))
11110 for(i=start>>12;i<=(start+slen*4)>>12;i++)
11111 invalid_code[((u_int)0x80000000>>12)|i]=0;
11114 /* Pass 10 - Free memory by expiring oldest blocks */
11116 int end=((((int)out-BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
11117 while(expirep!=end)
11119 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
11120 int base=BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
11121 inv_debug("EXP: Phase %d\n",expirep);
11122 switch((expirep>>11)&3)
11125 // Clear jump_in and jump_dirty
11126 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
11127 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
11128 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
11129 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
11133 ll_kill_pointers(jump_out[expirep&2047],base,shift);
11134 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
11137 // Clear hash table
11138 for(i=0;i<32;i++) {
11139 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
11140 if((ht_bin[3]>>shift)==(base>>shift) ||
11141 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11142 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
11143 ht_bin[2]=ht_bin[3]=-1;
11145 if((ht_bin[1]>>shift)==(base>>shift) ||
11146 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11147 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
11148 ht_bin[0]=ht_bin[2];
11149 ht_bin[1]=ht_bin[3];
11150 ht_bin[2]=ht_bin[3]=-1;
11157 if((expirep&2047)==0)
11160 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
11161 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
11164 expirep=(expirep+1)&65535;
11169 // vim:shiftwidth=2:expandtab