1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2 * Mupen64plus - new_dynarec.c *
3 * Copyright (C) 2009-2011 Ari64 *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program; if not, write to the *
17 * Free Software Foundation, Inc., *
18 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
19 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
22 #include <stdint.h> //include for uint64_t
25 #include "emu_if.h" //emulator interface
30 #include "assem_x86.h"
33 #include "assem_x64.h"
36 #include "assem_arm.h"
40 #define MAX_OUTPUT_BLOCK_SIZE 262144
41 #define CLOCK_DIVIDER 2
45 signed char regmap_entry[HOST_REGS];
46 signed char regmap[HOST_REGS];
55 uint64_t constmap[HOST_REGS];
63 struct ll_entry *next;
69 char insn[MAXBLOCK][10];
70 u_char itype[MAXBLOCK];
71 u_char opcode[MAXBLOCK];
72 u_char opcode2[MAXBLOCK];
80 u_char dep1[MAXBLOCK];
81 u_char dep2[MAXBLOCK];
85 char likely[MAXBLOCK];
88 uint64_t unneeded_reg[MAXBLOCK];
89 uint64_t unneeded_reg_upper[MAXBLOCK];
90 uint64_t branch_unneeded_reg[MAXBLOCK];
91 uint64_t branch_unneeded_reg_upper[MAXBLOCK];
92 uint64_t p32[MAXBLOCK];
93 uint64_t pr32[MAXBLOCK];
94 signed char regmap_pre[MAXBLOCK][HOST_REGS];
95 signed char regmap[MAXBLOCK][HOST_REGS];
96 signed char regmap_entry[MAXBLOCK][HOST_REGS];
97 uint64_t constmap[MAXBLOCK][HOST_REGS];
98 struct regstat regs[MAXBLOCK];
99 struct regstat branch_regs[MAXBLOCK];
100 signed char minimum_free_regs[MAXBLOCK];
101 u_int needed_reg[MAXBLOCK];
102 uint64_t requires_32bit[MAXBLOCK];
103 u_int wont_dirty[MAXBLOCK];
104 u_int will_dirty[MAXBLOCK];
107 u_int instr_addr[MAXBLOCK];
108 u_int link_addr[MAXBLOCK][3];
110 u_int stubs[MAXBLOCK*3][8];
112 u_int literals[1024][2];
117 struct ll_entry *jump_in[4096];
118 struct ll_entry *jump_out[4096];
119 struct ll_entry *jump_dirty[4096];
120 u_int hash_table[65536][4] __attribute__((aligned(16)));
121 char shadow[1048576] __attribute__((aligned(16)));
127 static const u_int using_tlb=0;
129 static u_int sp_in_mirror;
130 u_int stop_after_jal;
131 extern u_char restore_candidate[512];
132 extern int cycle_count;
134 /* registers that may be allocated */
136 #define HIREG 32 // hi
137 #define LOREG 33 // lo
138 #define FSREG 34 // FPU status (FCSR)
139 #define CSREG 35 // Coprocessor status
140 #define CCREG 36 // Cycle count
141 #define INVCP 37 // Pointer to invalid_code
142 #define MMREG 38 // Pointer to memory_map
143 #define ROREG 39 // ram offset (if rdram!=0x80000000)
145 #define FTEMP 40 // FPU temporary register
146 #define PTEMP 41 // Prefetch temporary register
147 #define TLREG 42 // TLB mapping offset
148 #define RHASH 43 // Return address hash
149 #define RHTBL 44 // Return address hash table address
150 #define RTEMP 45 // JR/JALR address register
152 #define AGEN1 46 // Address generation temporary register
153 #define AGEN2 47 // Address generation temporary register
154 #define MGEN1 48 // Maptable address generation temporary register
155 #define MGEN2 49 // Maptable address generation temporary register
156 #define BTREG 50 // Branch target temporary register
158 /* instruction types */
159 #define NOP 0 // No operation
160 #define LOAD 1 // Load
161 #define STORE 2 // Store
162 #define LOADLR 3 // Unaligned load
163 #define STORELR 4 // Unaligned store
164 #define MOV 5 // Move
165 #define ALU 6 // Arithmetic/logic
166 #define MULTDIV 7 // Multiply/divide
167 #define SHIFT 8 // Shift by register
168 #define SHIFTIMM 9// Shift by immediate
169 #define IMM16 10 // 16-bit immediate
170 #define RJUMP 11 // Unconditional jump to register
171 #define UJUMP 12 // Unconditional jump
172 #define CJUMP 13 // Conditional branch (BEQ/BNE/BGTZ/BLEZ)
173 #define SJUMP 14 // Conditional branch (regimm format)
174 #define COP0 15 // Coprocessor 0
175 #define COP1 16 // Coprocessor 1
176 #define C1LS 17 // Coprocessor 1 load/store
177 #define FJUMP 18 // Conditional branch (floating point)
178 #define FLOAT 19 // Floating point unit
179 #define FCONV 20 // Convert integer to float
180 #define FCOMP 21 // Floating point compare (sets FSREG)
181 #define SYSCALL 22// SYSCALL
182 #define OTHER 23 // Other
183 #define SPAN 24 // Branch/delay slot spans 2 pages
184 #define NI 25 // Not implemented
185 #define HLECALL 26// PCSX fake opcodes for HLE
186 #define COP2 27 // Coprocessor 2 move
187 #define C2LS 28 // Coprocessor 2 load/store
188 #define C2OP 29 // Coprocessor 2 operation
189 #define INTCALL 30// Call interpreter to handle rare corner cases
198 #define LOADBU_STUB 7
199 #define LOADHU_STUB 8
200 #define STOREB_STUB 9
201 #define STOREH_STUB 10
202 #define STOREW_STUB 11
203 #define STORED_STUB 12
204 #define STORELR_STUB 13
205 #define INVCODE_STUB 14
213 int new_recompile_block(int addr);
214 void *get_addr_ht(u_int vaddr);
215 void invalidate_block(u_int block);
216 void invalidate_addr(u_int addr);
217 void remove_hash(int vaddr);
220 void dyna_linker_ds();
222 void verify_code_vm();
223 void verify_code_ds();
226 void fp_exception_ds();
228 void jump_syscall_hle();
232 void new_dyna_leave();
237 void read_nomem_new();
238 void read_nomemb_new();
239 void read_nomemh_new();
240 void read_nomemd_new();
241 void write_nomem_new();
242 void write_nomemb_new();
243 void write_nomemh_new();
244 void write_nomemd_new();
245 void write_rdram_new();
246 void write_rdramb_new();
247 void write_rdramh_new();
248 void write_rdramd_new();
249 extern u_int memory_map[1048576];
251 // Needed by assembler
252 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32);
253 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty);
254 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr);
255 void load_all_regs(signed char i_regmap[]);
256 void load_needed_regs(signed char i_regmap[],signed char next_regmap[]);
257 void load_regs_entry(int t);
258 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i);
262 //#define DEBUG_CYCLE_COUNT 1
265 //#define assem_debug printf
266 //#define inv_debug printf
267 #define assem_debug nullf
268 #define inv_debug nullf
270 static void tlb_hacks()
274 if (strncmp((char *) ROM_HEADER->nom, "GOLDENEYE",9) == 0)
278 switch (ROM_HEADER->Country_code&0xFF)
290 // Unknown country code
294 u_int rom_addr=(u_int)rom;
296 // Since memory_map is 32-bit, on 64-bit systems the rom needs to be
297 // in the lower 4G of memory to use this hack. Copy it if necessary.
298 if((void *)rom>(void *)0xffffffff) {
299 munmap(ROM_COPY, 67108864);
300 if(mmap(ROM_COPY, 12582912,
301 PROT_READ | PROT_WRITE,
302 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
303 -1, 0) <= 0) {printf("mmap() failed\n");}
304 memcpy(ROM_COPY,rom,12582912);
305 rom_addr=(u_int)ROM_COPY;
309 for(n=0x7F000;n<0x80000;n++) {
310 memory_map[n]=(((u_int)(rom_addr+addr-0x7F000000))>>2)|0x40000000;
317 static u_int get_page(u_int vaddr)
320 u_int page=(vaddr^0x80000000)>>12;
322 u_int page=vaddr&~0xe0000000;
323 if (page < 0x1000000)
324 page &= ~0x0e00000; // RAM mirrors
328 if(page>262143&&tlb_LUT_r[vaddr>>12]) page=(tlb_LUT_r[vaddr>>12]^0x80000000)>>12;
330 if(page>2048) page=2048+(page&2047);
334 static u_int get_vpage(u_int vaddr)
336 u_int vpage=(vaddr^0x80000000)>>12;
338 if(vpage>262143&&tlb_LUT_r[vaddr>>12]) vpage&=2047; // jump_dirty uses a hash of the virtual address instead
340 if(vpage>2048) vpage=2048+(vpage&2047);
344 // Get address from virtual address
345 // This is called from the recompiled JR/JALR instructions
346 void *get_addr(u_int vaddr)
348 u_int page=get_page(vaddr);
349 u_int vpage=get_vpage(vaddr);
350 struct ll_entry *head;
351 //printf("TRACE: count=%d next=%d (get_addr %x,page %d)\n",Count,next_interupt,vaddr,page);
354 if(head->vaddr==vaddr&&head->reg32==0) {
355 //printf("TRACE: count=%d next=%d (get_addr match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
356 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
359 ht_bin[1]=(int)head->addr;
365 head=jump_dirty[vpage];
367 if(head->vaddr==vaddr&&head->reg32==0) {
368 //printf("TRACE: count=%d next=%d (get_addr match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
369 // Don't restore blocks which are about to expire from the cache
370 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
371 if(verify_dirty(head->addr)) {
372 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
373 invalid_code[vaddr>>12]=0;
374 memory_map[vaddr>>12]|=0x40000000;
377 if(tlb_LUT_r[vaddr>>12]) {
378 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
379 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
382 restore_candidate[vpage>>3]|=1<<(vpage&7);
384 else restore_candidate[page>>3]|=1<<(page&7);
385 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
386 if(ht_bin[0]==vaddr) {
387 ht_bin[1]=(int)head->addr; // Replace existing entry
393 ht_bin[1]=(int)head->addr;
401 //printf("TRACE: count=%d next=%d (get_addr no-match %x)\n",Count,next_interupt,vaddr);
402 int r=new_recompile_block(vaddr);
403 if(r==0) return get_addr(vaddr);
404 // Execute in unmapped page, generate pagefault execption
406 Cause=(vaddr<<31)|0x8;
407 EPC=(vaddr&1)?vaddr-5:vaddr;
409 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
410 EntryHi=BadVAddr&0xFFFFE000;
411 return get_addr_ht(0x80000000);
413 // Look up address in hash table first
414 void *get_addr_ht(u_int vaddr)
416 //printf("TRACE: count=%d next=%d (get_addr_ht %x)\n",Count,next_interupt,vaddr);
417 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
418 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
419 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
420 return get_addr(vaddr);
423 void *get_addr_32(u_int vaddr,u_int flags)
426 return get_addr(vaddr);
428 //printf("TRACE: count=%d next=%d (get_addr_32 %x,flags %x)\n",Count,next_interupt,vaddr,flags);
429 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
430 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
431 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
432 u_int page=get_page(vaddr);
433 u_int vpage=get_vpage(vaddr);
434 struct ll_entry *head;
437 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
438 //printf("TRACE: count=%d next=%d (get_addr_32 match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
440 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
442 ht_bin[1]=(int)head->addr;
444 }else if(ht_bin[2]==-1) {
445 ht_bin[3]=(int)head->addr;
448 //ht_bin[3]=ht_bin[1];
449 //ht_bin[2]=ht_bin[0];
450 //ht_bin[1]=(int)head->addr;
457 head=jump_dirty[vpage];
459 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
460 //printf("TRACE: count=%d next=%d (get_addr_32 match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
461 // Don't restore blocks which are about to expire from the cache
462 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
463 if(verify_dirty(head->addr)) {
464 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
465 invalid_code[vaddr>>12]=0;
466 memory_map[vaddr>>12]|=0x40000000;
469 if(tlb_LUT_r[vaddr>>12]) {
470 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
471 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
474 restore_candidate[vpage>>3]|=1<<(vpage&7);
476 else restore_candidate[page>>3]|=1<<(page&7);
478 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
480 ht_bin[1]=(int)head->addr;
482 }else if(ht_bin[2]==-1) {
483 ht_bin[3]=(int)head->addr;
486 //ht_bin[3]=ht_bin[1];
487 //ht_bin[2]=ht_bin[0];
488 //ht_bin[1]=(int)head->addr;
496 //printf("TRACE: count=%d next=%d (get_addr_32 no-match %x,flags %x)\n",Count,next_interupt,vaddr,flags);
497 int r=new_recompile_block(vaddr);
498 if(r==0) return get_addr(vaddr);
499 // Execute in unmapped page, generate pagefault execption
501 Cause=(vaddr<<31)|0x8;
502 EPC=(vaddr&1)?vaddr-5:vaddr;
504 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
505 EntryHi=BadVAddr&0xFFFFE000;
506 return get_addr_ht(0x80000000);
510 void clear_all_regs(signed char regmap[])
513 for (hr=0;hr<HOST_REGS;hr++) regmap[hr]=-1;
516 signed char get_reg(signed char regmap[],int r)
519 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map[hr]==r) return hr;
523 // Find a register that is available for two consecutive cycles
524 signed char get_reg2(signed char regmap1[],signed char regmap2[],int r)
527 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map1[hr]==r&®map2[hr]==r) return hr;
531 int count_free_regs(signed char regmap[])
535 for(hr=0;hr<HOST_REGS;hr++)
537 if(hr!=EXCLUDE_REG) {
538 if(regmap[hr]<0) count++;
544 void dirty_reg(struct regstat *cur,signed char reg)
548 for (hr=0;hr<HOST_REGS;hr++) {
549 if((cur->regmap[hr]&63)==reg) {
555 // If we dirty the lower half of a 64 bit register which is now being
556 // sign-extended, we need to dump the upper half.
557 // Note: Do this only after completion of the instruction, because
558 // some instructions may need to read the full 64-bit value even if
559 // overwriting it (eg SLTI, DSRA32).
560 static void flush_dirty_uppers(struct regstat *cur)
563 for (hr=0;hr<HOST_REGS;hr++) {
564 if((cur->dirty>>hr)&1) {
567 if((cur->is32>>(reg&63))&1) cur->regmap[hr]=-1;
572 void set_const(struct regstat *cur,signed char reg,uint64_t value)
576 for (hr=0;hr<HOST_REGS;hr++) {
577 if(cur->regmap[hr]==reg) {
579 cur->constmap[hr]=value;
581 else if((cur->regmap[hr]^64)==reg) {
583 cur->constmap[hr]=value>>32;
588 void clear_const(struct regstat *cur,signed char reg)
592 for (hr=0;hr<HOST_REGS;hr++) {
593 if((cur->regmap[hr]&63)==reg) {
594 cur->isconst&=~(1<<hr);
599 int is_const(struct regstat *cur,signed char reg)
604 for (hr=0;hr<HOST_REGS;hr++) {
605 if((cur->regmap[hr]&63)==reg) {
606 return (cur->isconst>>hr)&1;
611 uint64_t get_const(struct regstat *cur,signed char reg)
615 for (hr=0;hr<HOST_REGS;hr++) {
616 if(cur->regmap[hr]==reg) {
617 return cur->constmap[hr];
620 printf("Unknown constant in r%d\n",reg);
624 // Least soon needed registers
625 // Look at the next ten instructions and see which registers
626 // will be used. Try not to reallocate these.
627 void lsn(u_char hsn[], int i, int *preferred_reg)
637 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
639 // Don't go past an unconditonal jump
646 if(rs1[i+j]) hsn[rs1[i+j]]=j;
647 if(rs2[i+j]) hsn[rs2[i+j]]=j;
648 if(rt1[i+j]) hsn[rt1[i+j]]=j;
649 if(rt2[i+j]) hsn[rt2[i+j]]=j;
650 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
651 // Stores can allocate zero
655 // On some architectures stores need invc_ptr
656 #if defined(HOST_IMM8)
657 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
661 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
669 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
671 // Follow first branch
672 int t=(ba[i+b]-start)>>2;
673 j=7-b;if(t+j>=slen) j=slen-t-1;
676 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
677 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
678 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
679 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
682 // TODO: preferred register based on backward branch
684 // Delay slot should preferably not overwrite branch conditions or cycle count
685 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
686 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
687 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
693 // Coprocessor load/store needs FTEMP, even if not declared
694 if(itype[i]==C1LS||itype[i]==C2LS) {
697 // Load L/R also uses FTEMP as a temporary register
698 if(itype[i]==LOADLR) {
701 // Also SWL/SWR/SDL/SDR
702 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
705 // Don't remove the TLB registers either
706 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
709 // Don't remove the miniht registers
710 if(itype[i]==UJUMP||itype[i]==RJUMP)
717 // We only want to allocate registers if we're going to use them again soon
718 int needed_again(int r, int i)
724 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
726 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
727 return 0; // Don't need any registers if exiting the block
735 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
737 // Don't go past an unconditonal jump
741 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||itype[i+j]==INTCALL||((source[i+j]&0xfc00003f)==0x0d))
748 if(rs1[i+j]==r) rn=j;
749 if(rs2[i+j]==r) rn=j;
750 if((unneeded_reg[i+j]>>r)&1) rn=10;
751 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
759 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
761 // Follow first branch
763 int t=(ba[i+b]-start)>>2;
764 j=7-b;if(t+j>=slen) j=slen-t-1;
767 if(!((unneeded_reg[t+j]>>r)&1)) {
768 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
769 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
779 // Try to match register allocations at the end of a loop with those
781 int loop_reg(int i, int r, int hr)
790 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
792 // Don't go past an unconditonal jump
799 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
804 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
805 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
806 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
808 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
810 int t=(ba[i+k]-start)>>2;
811 int reg=get_reg(regs[t].regmap_entry,r);
812 if(reg>=0) return reg;
813 //reg=get_reg(regs[t+1].regmap_entry,r);
814 //if(reg>=0) return reg;
822 // Allocate every register, preserving source/target regs
823 void alloc_all(struct regstat *cur,int i)
827 for(hr=0;hr<HOST_REGS;hr++) {
828 if(hr!=EXCLUDE_REG) {
829 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
830 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
833 cur->dirty&=~(1<<hr);
836 if((cur->regmap[hr]&63)==0)
839 cur->dirty&=~(1<<hr);
846 void div64(int64_t dividend,int64_t divisor)
850 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
851 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
853 void divu64(uint64_t dividend,uint64_t divisor)
857 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
858 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
861 void mult64(uint64_t m1,uint64_t m2)
863 unsigned long long int op1, op2, op3, op4;
864 unsigned long long int result1, result2, result3, result4;
865 unsigned long long int temp1, temp2, temp3, temp4;
881 op1 = op2 & 0xFFFFFFFF;
882 op2 = (op2 >> 32) & 0xFFFFFFFF;
883 op3 = op4 & 0xFFFFFFFF;
884 op4 = (op4 >> 32) & 0xFFFFFFFF;
887 temp2 = (temp1 >> 32) + op1 * op4;
889 temp4 = (temp3 >> 32) + op2 * op4;
891 result1 = temp1 & 0xFFFFFFFF;
892 result2 = temp2 + (temp3 & 0xFFFFFFFF);
893 result3 = (result2 >> 32) + temp4;
894 result4 = (result3 >> 32);
896 lo = result1 | (result2 << 32);
897 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
906 void multu64(uint64_t m1,uint64_t m2)
908 unsigned long long int op1, op2, op3, op4;
909 unsigned long long int result1, result2, result3, result4;
910 unsigned long long int temp1, temp2, temp3, temp4;
912 op1 = m1 & 0xFFFFFFFF;
913 op2 = (m1 >> 32) & 0xFFFFFFFF;
914 op3 = m2 & 0xFFFFFFFF;
915 op4 = (m2 >> 32) & 0xFFFFFFFF;
918 temp2 = (temp1 >> 32) + op1 * op4;
920 temp4 = (temp3 >> 32) + op2 * op4;
922 result1 = temp1 & 0xFFFFFFFF;
923 result2 = temp2 + (temp3 & 0xFFFFFFFF);
924 result3 = (result2 >> 32) + temp4;
925 result4 = (result3 >> 32);
927 lo = result1 | (result2 << 32);
928 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
930 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
931 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
934 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
942 else original=loaded;
945 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
948 original>>=64-(bits^56);
949 original<<=64-(bits^56);
953 else original=loaded;
958 #include "assem_x86.c"
961 #include "assem_x64.c"
964 #include "assem_arm.c"
967 // Add virtual address mapping to linked list
968 void ll_add(struct ll_entry **head,int vaddr,void *addr)
970 struct ll_entry *new_entry;
971 new_entry=malloc(sizeof(struct ll_entry));
972 assert(new_entry!=NULL);
973 new_entry->vaddr=vaddr;
975 new_entry->addr=addr;
976 new_entry->next=*head;
980 // Add virtual address mapping for 32-bit compiled block
981 void ll_add_32(struct ll_entry **head,int vaddr,u_int reg32,void *addr)
983 ll_add(head,vaddr,addr);
985 (*head)->reg32=reg32;
989 // Check if an address is already compiled
990 // but don't return addresses which are about to expire from the cache
991 void *check_addr(u_int vaddr)
993 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
994 if(ht_bin[0]==vaddr) {
995 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
996 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
998 if(ht_bin[2]==vaddr) {
999 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
1000 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
1002 u_int page=get_page(vaddr);
1003 struct ll_entry *head;
1006 if(head->vaddr==vaddr&&head->reg32==0) {
1007 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1008 // Update existing entry with current address
1009 if(ht_bin[0]==vaddr) {
1010 ht_bin[1]=(int)head->addr;
1013 if(ht_bin[2]==vaddr) {
1014 ht_bin[3]=(int)head->addr;
1017 // Insert into hash table with low priority.
1018 // Don't evict existing entries, as they are probably
1019 // addresses that are being accessed frequently.
1021 ht_bin[1]=(int)head->addr;
1023 }else if(ht_bin[2]==-1) {
1024 ht_bin[3]=(int)head->addr;
1035 void remove_hash(int vaddr)
1037 //printf("remove hash: %x\n",vaddr);
1038 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1039 if(ht_bin[2]==vaddr) {
1040 ht_bin[2]=ht_bin[3]=-1;
1042 if(ht_bin[0]==vaddr) {
1043 ht_bin[0]=ht_bin[2];
1044 ht_bin[1]=ht_bin[3];
1045 ht_bin[2]=ht_bin[3]=-1;
1049 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1051 struct ll_entry *next;
1053 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1054 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1056 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1057 remove_hash((*head)->vaddr);
1064 head=&((*head)->next);
1069 // Remove all entries from linked list
1070 void ll_clear(struct ll_entry **head)
1072 struct ll_entry *cur;
1073 struct ll_entry *next;
1084 // Dereference the pointers and remove if it matches
1085 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1088 int ptr=get_pointer(head->addr);
1089 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1090 if(((ptr>>shift)==(addr>>shift)) ||
1091 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1093 inv_debug("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1094 u_int host_addr=(u_int)kill_pointer(head->addr);
1096 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1103 // This is called when we write to a compiled block (see do_invstub)
1104 void invalidate_page(u_int page)
1106 struct ll_entry *head;
1107 struct ll_entry *next;
1111 inv_debug("INVALIDATE: %x\n",head->vaddr);
1112 remove_hash(head->vaddr);
1117 head=jump_out[page];
1120 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1121 u_int host_addr=(u_int)kill_pointer(head->addr);
1123 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1130 void invalidate_block(u_int block)
1132 u_int page=get_page(block<<12);
1133 u_int vpage=get_vpage(block<<12);
1134 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1135 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1138 struct ll_entry *head;
1139 head=jump_dirty[vpage];
1140 //printf("page=%d vpage=%d\n",page,vpage);
1143 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1144 get_bounds((int)head->addr,&start,&end);
1145 //printf("start: %x end: %x\n",start,end);
1146 if(page<2048&&start>=0x80000000&&end<0x80000000+RAM_SIZE) {
1147 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1148 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1149 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1153 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1154 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1155 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1156 if((((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)&2047)>last) last=((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)&2047;
1163 //printf("first=%d last=%d\n",first,last);
1164 invalidate_page(page);
1165 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1166 assert(last<page+5);
1167 // Invalidate the adjacent pages if a block crosses a 4K boundary
1169 invalidate_page(first);
1172 for(first=page+1;first<last;first++) {
1173 invalidate_page(first);
1179 // Don't trap writes
1180 invalid_code[block]=1;
1182 invalid_code[((u_int)0x80000000>>12)|page]=1;
1185 // If there is a valid TLB entry for this page, remove write protect
1186 if(tlb_LUT_w[block]) {
1187 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1188 // CHECK: Is this right?
1189 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1190 u_int real_block=tlb_LUT_w[block]>>12;
1191 invalid_code[real_block]=1;
1192 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1194 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1198 memset(mini_ht,-1,sizeof(mini_ht));
1201 void invalidate_addr(u_int addr)
1203 invalidate_block(addr>>12);
1205 // This is called when loading a save state.
1206 // Anything could have changed, so invalidate everything.
1207 void invalidate_all_pages()
1210 for(page=0;page<4096;page++)
1211 invalidate_page(page);
1212 for(page=0;page<1048576;page++)
1213 if(!invalid_code[page]) {
1214 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1215 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1218 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1221 memset(mini_ht,-1,sizeof(mini_ht));
1225 for(page=0;page<0x100000;page++) {
1226 if(tlb_LUT_r[page]) {
1227 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1228 if(!tlb_LUT_w[page]||!invalid_code[page])
1229 memory_map[page]|=0x40000000; // Write protect
1231 else memory_map[page]=-1;
1232 if(page==0x80000) page=0xC0000;
1238 // Add an entry to jump_out after making a link
1239 void add_link(u_int vaddr,void *src)
1241 u_int page=get_page(vaddr);
1242 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1243 ll_add(jump_out+page,vaddr,src);
1244 //int ptr=get_pointer(src);
1245 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1248 // If a code block was found to be unmodified (bit was set in
1249 // restore_candidate) and it remains unmodified (bit is clear
1250 // in invalid_code) then move the entries for that 4K page from
1251 // the dirty list to the clean list.
1252 void clean_blocks(u_int page)
1254 struct ll_entry *head;
1255 inv_debug("INV: clean_blocks page=%d\n",page);
1256 head=jump_dirty[page];
1258 if(!invalid_code[head->vaddr>>12]) {
1259 // Don't restore blocks which are about to expire from the cache
1260 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1262 if(verify_dirty((int)head->addr)) {
1263 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1266 get_bounds((int)head->addr,&start,&end);
1267 if(start-(u_int)rdram<RAM_SIZE) {
1268 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1269 inv|=invalid_code[i];
1272 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1273 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1274 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1275 if(addr<start||addr>=end) inv=1;
1277 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1281 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1282 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1285 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1287 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1288 //printf("page=%x, addr=%x\n",page,head->vaddr);
1289 //assert(head->vaddr>>12==(page|0x80000));
1290 ll_add_32(jump_in+ppage,head->vaddr,head->reg32,clean_addr);
1291 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1293 if(ht_bin[0]==head->vaddr) {
1294 ht_bin[1]=(int)clean_addr; // Replace existing entry
1296 if(ht_bin[2]==head->vaddr) {
1297 ht_bin[3]=(int)clean_addr; // Replace existing entry
1310 void mov_alloc(struct regstat *current,int i)
1312 // Note: Don't need to actually alloc the source registers
1313 if((~current->is32>>rs1[i])&1) {
1314 //alloc_reg64(current,i,rs1[i]);
1315 alloc_reg64(current,i,rt1[i]);
1316 current->is32&=~(1LL<<rt1[i]);
1318 //alloc_reg(current,i,rs1[i]);
1319 alloc_reg(current,i,rt1[i]);
1320 current->is32|=(1LL<<rt1[i]);
1322 clear_const(current,rs1[i]);
1323 clear_const(current,rt1[i]);
1324 dirty_reg(current,rt1[i]);
1327 void shiftimm_alloc(struct regstat *current,int i)
1329 clear_const(current,rs1[i]);
1330 clear_const(current,rt1[i]);
1331 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1334 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1336 alloc_reg(current,i,rt1[i]);
1337 current->is32|=1LL<<rt1[i];
1338 dirty_reg(current,rt1[i]);
1341 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1344 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1345 alloc_reg64(current,i,rt1[i]);
1346 current->is32&=~(1LL<<rt1[i]);
1347 dirty_reg(current,rt1[i]);
1350 if(opcode2[i]==0x3c) // DSLL32
1353 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1354 alloc_reg64(current,i,rt1[i]);
1355 current->is32&=~(1LL<<rt1[i]);
1356 dirty_reg(current,rt1[i]);
1359 if(opcode2[i]==0x3e) // DSRL32
1362 alloc_reg64(current,i,rs1[i]);
1364 alloc_reg64(current,i,rt1[i]);
1365 current->is32&=~(1LL<<rt1[i]);
1367 alloc_reg(current,i,rt1[i]);
1368 current->is32|=1LL<<rt1[i];
1370 dirty_reg(current,rt1[i]);
1373 if(opcode2[i]==0x3f) // DSRA32
1376 alloc_reg64(current,i,rs1[i]);
1377 alloc_reg(current,i,rt1[i]);
1378 current->is32|=1LL<<rt1[i];
1379 dirty_reg(current,rt1[i]);
1384 void shift_alloc(struct regstat *current,int i)
1387 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1389 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1390 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1391 alloc_reg(current,i,rt1[i]);
1392 if(rt1[i]==rs2[i]) {
1393 alloc_reg_temp(current,i,-1);
1394 minimum_free_regs[i]=1;
1396 current->is32|=1LL<<rt1[i];
1397 } else { // DSLLV/DSRLV/DSRAV
1398 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1399 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1400 alloc_reg64(current,i,rt1[i]);
1401 current->is32&=~(1LL<<rt1[i]);
1402 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1404 alloc_reg_temp(current,i,-1);
1405 minimum_free_regs[i]=1;
1408 clear_const(current,rs1[i]);
1409 clear_const(current,rs2[i]);
1410 clear_const(current,rt1[i]);
1411 dirty_reg(current,rt1[i]);
1415 void alu_alloc(struct regstat *current,int i)
1417 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1419 if(rs1[i]&&rs2[i]) {
1420 alloc_reg(current,i,rs1[i]);
1421 alloc_reg(current,i,rs2[i]);
1424 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1425 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1427 alloc_reg(current,i,rt1[i]);
1429 current->is32|=1LL<<rt1[i];
1431 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1433 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1435 alloc_reg64(current,i,rs1[i]);
1436 alloc_reg64(current,i,rs2[i]);
1437 alloc_reg(current,i,rt1[i]);
1439 alloc_reg(current,i,rs1[i]);
1440 alloc_reg(current,i,rs2[i]);
1441 alloc_reg(current,i,rt1[i]);
1444 current->is32|=1LL<<rt1[i];
1446 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1448 if(rs1[i]&&rs2[i]) {
1449 alloc_reg(current,i,rs1[i]);
1450 alloc_reg(current,i,rs2[i]);
1454 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1455 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1457 alloc_reg(current,i,rt1[i]);
1458 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1460 if(!((current->uu>>rt1[i])&1)) {
1461 alloc_reg64(current,i,rt1[i]);
1463 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1464 if(rs1[i]&&rs2[i]) {
1465 alloc_reg64(current,i,rs1[i]);
1466 alloc_reg64(current,i,rs2[i]);
1470 // Is is really worth it to keep 64-bit values in registers?
1472 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1473 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1477 current->is32&=~(1LL<<rt1[i]);
1479 current->is32|=1LL<<rt1[i];
1483 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1485 if(rs1[i]&&rs2[i]) {
1486 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1487 alloc_reg64(current,i,rs1[i]);
1488 alloc_reg64(current,i,rs2[i]);
1489 alloc_reg64(current,i,rt1[i]);
1491 alloc_reg(current,i,rs1[i]);
1492 alloc_reg(current,i,rs2[i]);
1493 alloc_reg(current,i,rt1[i]);
1497 alloc_reg(current,i,rt1[i]);
1498 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1499 // DADD used as move, or zeroing
1500 // If we have a 64-bit source, then make the target 64 bits too
1501 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1502 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1503 alloc_reg64(current,i,rt1[i]);
1504 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1505 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1506 alloc_reg64(current,i,rt1[i]);
1508 if(opcode2[i]>=0x2e&&rs2[i]) {
1509 // DSUB used as negation - 64-bit result
1510 // If we have a 32-bit register, extend it to 64 bits
1511 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1512 alloc_reg64(current,i,rt1[i]);
1516 if(rs1[i]&&rs2[i]) {
1517 current->is32&=~(1LL<<rt1[i]);
1519 current->is32&=~(1LL<<rt1[i]);
1520 if((current->is32>>rs1[i])&1)
1521 current->is32|=1LL<<rt1[i];
1523 current->is32&=~(1LL<<rt1[i]);
1524 if((current->is32>>rs2[i])&1)
1525 current->is32|=1LL<<rt1[i];
1527 current->is32|=1LL<<rt1[i];
1531 clear_const(current,rs1[i]);
1532 clear_const(current,rs2[i]);
1533 clear_const(current,rt1[i]);
1534 dirty_reg(current,rt1[i]);
1537 void imm16_alloc(struct regstat *current,int i)
1539 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1541 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1542 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1543 current->is32&=~(1LL<<rt1[i]);
1544 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1545 // TODO: Could preserve the 32-bit flag if the immediate is zero
1546 alloc_reg64(current,i,rt1[i]);
1547 alloc_reg64(current,i,rs1[i]);
1549 clear_const(current,rs1[i]);
1550 clear_const(current,rt1[i]);
1552 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1553 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1554 current->is32|=1LL<<rt1[i];
1555 clear_const(current,rs1[i]);
1556 clear_const(current,rt1[i]);
1558 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1559 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1560 if(rs1[i]!=rt1[i]) {
1561 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1562 alloc_reg64(current,i,rt1[i]);
1563 current->is32&=~(1LL<<rt1[i]);
1566 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1567 if(is_const(current,rs1[i])) {
1568 int v=get_const(current,rs1[i]);
1569 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1570 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1571 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1573 else clear_const(current,rt1[i]);
1575 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1576 if(is_const(current,rs1[i])) {
1577 int v=get_const(current,rs1[i]);
1578 set_const(current,rt1[i],v+imm[i]);
1580 else clear_const(current,rt1[i]);
1581 current->is32|=1LL<<rt1[i];
1584 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1585 current->is32|=1LL<<rt1[i];
1587 dirty_reg(current,rt1[i]);
1590 void load_alloc(struct regstat *current,int i)
1592 clear_const(current,rt1[i]);
1593 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1594 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1595 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1596 if(rt1[i]&&!((current->u>>rt1[i])&1)) {
1597 alloc_reg(current,i,rt1[i]);
1598 assert(get_reg(current->regmap,rt1[i])>=0);
1599 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1601 current->is32&=~(1LL<<rt1[i]);
1602 alloc_reg64(current,i,rt1[i]);
1604 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1606 current->is32&=~(1LL<<rt1[i]);
1607 alloc_reg64(current,i,rt1[i]);
1608 alloc_all(current,i);
1609 alloc_reg64(current,i,FTEMP);
1610 minimum_free_regs[i]=HOST_REGS;
1612 else current->is32|=1LL<<rt1[i];
1613 dirty_reg(current,rt1[i]);
1614 // If using TLB, need a register for pointer to the mapping table
1615 if(using_tlb) alloc_reg(current,i,TLREG);
1616 // LWL/LWR need a temporary register for the old value
1617 if(opcode[i]==0x22||opcode[i]==0x26)
1619 alloc_reg(current,i,FTEMP);
1620 alloc_reg_temp(current,i,-1);
1621 minimum_free_regs[i]=1;
1626 // Load to r0 or unneeded register (dummy load)
1627 // but we still need a register to calculate the address
1628 if(opcode[i]==0x22||opcode[i]==0x26)
1630 alloc_reg(current,i,FTEMP); // LWL/LWR need another temporary
1632 // If using TLB, need a register for pointer to the mapping table
1633 if(using_tlb) alloc_reg(current,i,TLREG);
1634 alloc_reg_temp(current,i,-1);
1635 minimum_free_regs[i]=1;
1636 if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1638 alloc_all(current,i);
1639 alloc_reg64(current,i,FTEMP);
1640 minimum_free_regs[i]=HOST_REGS;
1645 void store_alloc(struct regstat *current,int i)
1647 clear_const(current,rs2[i]);
1648 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1649 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1650 alloc_reg(current,i,rs2[i]);
1651 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1652 alloc_reg64(current,i,rs2[i]);
1653 if(rs2[i]) alloc_reg(current,i,FTEMP);
1655 // If using TLB, need a register for pointer to the mapping table
1656 if(using_tlb) alloc_reg(current,i,TLREG);
1657 #if defined(HOST_IMM8)
1658 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1659 else alloc_reg(current,i,INVCP);
1661 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1662 alloc_reg(current,i,FTEMP);
1664 // We need a temporary register for address generation
1665 alloc_reg_temp(current,i,-1);
1666 minimum_free_regs[i]=1;
1669 void c1ls_alloc(struct regstat *current,int i)
1671 //clear_const(current,rs1[i]); // FIXME
1672 clear_const(current,rt1[i]);
1673 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1674 alloc_reg(current,i,CSREG); // Status
1675 alloc_reg(current,i,FTEMP);
1676 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1677 alloc_reg64(current,i,FTEMP);
1679 // If using TLB, need a register for pointer to the mapping table
1680 if(using_tlb) alloc_reg(current,i,TLREG);
1681 #if defined(HOST_IMM8)
1682 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1683 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1684 alloc_reg(current,i,INVCP);
1686 // We need a temporary register for address generation
1687 alloc_reg_temp(current,i,-1);
1690 void c2ls_alloc(struct regstat *current,int i)
1692 clear_const(current,rt1[i]);
1693 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1694 alloc_reg(current,i,FTEMP);
1695 // If using TLB, need a register for pointer to the mapping table
1696 if(using_tlb) alloc_reg(current,i,TLREG);
1697 #if defined(HOST_IMM8)
1698 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1699 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1700 alloc_reg(current,i,INVCP);
1702 // We need a temporary register for address generation
1703 alloc_reg_temp(current,i,-1);
1704 minimum_free_regs[i]=1;
1707 #ifndef multdiv_alloc
1708 void multdiv_alloc(struct regstat *current,int i)
1715 // case 0x1D: DMULTU
1718 clear_const(current,rs1[i]);
1719 clear_const(current,rs2[i]);
1722 if((opcode2[i]&4)==0) // 32-bit
1724 current->u&=~(1LL<<HIREG);
1725 current->u&=~(1LL<<LOREG);
1726 alloc_reg(current,i,HIREG);
1727 alloc_reg(current,i,LOREG);
1728 alloc_reg(current,i,rs1[i]);
1729 alloc_reg(current,i,rs2[i]);
1730 current->is32|=1LL<<HIREG;
1731 current->is32|=1LL<<LOREG;
1732 dirty_reg(current,HIREG);
1733 dirty_reg(current,LOREG);
1737 current->u&=~(1LL<<HIREG);
1738 current->u&=~(1LL<<LOREG);
1739 current->uu&=~(1LL<<HIREG);
1740 current->uu&=~(1LL<<LOREG);
1741 alloc_reg64(current,i,HIREG);
1742 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1743 alloc_reg64(current,i,rs1[i]);
1744 alloc_reg64(current,i,rs2[i]);
1745 alloc_all(current,i);
1746 current->is32&=~(1LL<<HIREG);
1747 current->is32&=~(1LL<<LOREG);
1748 dirty_reg(current,HIREG);
1749 dirty_reg(current,LOREG);
1750 minimum_free_regs[i]=HOST_REGS;
1755 // Multiply by zero is zero.
1756 // MIPS does not have a divide by zero exception.
1757 // The result is undefined, we return zero.
1758 alloc_reg(current,i,HIREG);
1759 alloc_reg(current,i,LOREG);
1760 current->is32|=1LL<<HIREG;
1761 current->is32|=1LL<<LOREG;
1762 dirty_reg(current,HIREG);
1763 dirty_reg(current,LOREG);
1768 void cop0_alloc(struct regstat *current,int i)
1770 if(opcode2[i]==0) // MFC0
1773 clear_const(current,rt1[i]);
1774 alloc_all(current,i);
1775 alloc_reg(current,i,rt1[i]);
1776 current->is32|=1LL<<rt1[i];
1777 dirty_reg(current,rt1[i]);
1780 else if(opcode2[i]==4) // MTC0
1783 clear_const(current,rs1[i]);
1784 alloc_reg(current,i,rs1[i]);
1785 alloc_all(current,i);
1788 alloc_all(current,i); // FIXME: Keep r0
1790 alloc_reg(current,i,0);
1795 // TLBR/TLBWI/TLBWR/TLBP/ERET
1796 assert(opcode2[i]==0x10);
1797 alloc_all(current,i);
1799 minimum_free_regs[i]=HOST_REGS;
1802 void cop1_alloc(struct regstat *current,int i)
1804 alloc_reg(current,i,CSREG); // Load status
1805 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1808 clear_const(current,rt1[i]);
1810 alloc_reg64(current,i,rt1[i]); // DMFC1
1811 current->is32&=~(1LL<<rt1[i]);
1813 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1814 current->is32|=1LL<<rt1[i];
1816 dirty_reg(current,rt1[i]);
1818 alloc_reg_temp(current,i,-1);
1820 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1823 clear_const(current,rs1[i]);
1825 alloc_reg64(current,i,rs1[i]); // DMTC1
1827 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1828 alloc_reg_temp(current,i,-1);
1832 alloc_reg(current,i,0);
1833 alloc_reg_temp(current,i,-1);
1836 minimum_free_regs[i]=1;
1838 void fconv_alloc(struct regstat *current,int i)
1840 alloc_reg(current,i,CSREG); // Load status
1841 alloc_reg_temp(current,i,-1);
1842 minimum_free_regs[i]=1;
1844 void float_alloc(struct regstat *current,int i)
1846 alloc_reg(current,i,CSREG); // Load status
1847 alloc_reg_temp(current,i,-1);
1848 minimum_free_regs[i]=1;
1850 void c2op_alloc(struct regstat *current,int i)
1852 alloc_reg_temp(current,i,-1);
1854 void fcomp_alloc(struct regstat *current,int i)
1856 alloc_reg(current,i,CSREG); // Load status
1857 alloc_reg(current,i,FSREG); // Load flags
1858 dirty_reg(current,FSREG); // Flag will be modified
1859 alloc_reg_temp(current,i,-1);
1860 minimum_free_regs[i]=1;
1863 void syscall_alloc(struct regstat *current,int i)
1865 alloc_cc(current,i);
1866 dirty_reg(current,CCREG);
1867 alloc_all(current,i);
1868 minimum_free_regs[i]=HOST_REGS;
1872 void delayslot_alloc(struct regstat *current,int i)
1883 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1884 printf("Disabled speculative precompilation\n");
1888 imm16_alloc(current,i);
1892 load_alloc(current,i);
1896 store_alloc(current,i);
1899 alu_alloc(current,i);
1902 shift_alloc(current,i);
1905 multdiv_alloc(current,i);
1908 shiftimm_alloc(current,i);
1911 mov_alloc(current,i);
1914 cop0_alloc(current,i);
1918 cop1_alloc(current,i);
1921 c1ls_alloc(current,i);
1924 c2ls_alloc(current,i);
1927 fconv_alloc(current,i);
1930 float_alloc(current,i);
1933 fcomp_alloc(current,i);
1936 c2op_alloc(current,i);
1941 // Special case where a branch and delay slot span two pages in virtual memory
1942 static void pagespan_alloc(struct regstat *current,int i)
1945 current->wasconst=0;
1947 minimum_free_regs[i]=HOST_REGS;
1948 alloc_all(current,i);
1949 alloc_cc(current,i);
1950 dirty_reg(current,CCREG);
1951 if(opcode[i]==3) // JAL
1953 alloc_reg(current,i,31);
1954 dirty_reg(current,31);
1956 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
1958 alloc_reg(current,i,rs1[i]);
1960 alloc_reg(current,i,rt1[i]);
1961 dirty_reg(current,rt1[i]);
1964 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
1966 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1967 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1968 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1970 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1971 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
1975 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
1977 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1978 if(!((current->is32>>rs1[i])&1))
1980 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1984 if(opcode[i]==0x11) // BC1
1986 alloc_reg(current,i,FSREG);
1987 alloc_reg(current,i,CSREG);
1992 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
1994 stubs[stubcount][0]=type;
1995 stubs[stubcount][1]=addr;
1996 stubs[stubcount][2]=retaddr;
1997 stubs[stubcount][3]=a;
1998 stubs[stubcount][4]=b;
1999 stubs[stubcount][5]=c;
2000 stubs[stubcount][6]=d;
2001 stubs[stubcount][7]=e;
2005 // Write out a single register
2006 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
2009 for(hr=0;hr<HOST_REGS;hr++) {
2010 if(hr!=EXCLUDE_REG) {
2011 if((regmap[hr]&63)==r) {
2014 emit_storereg(r,hr);
2016 if((is32>>regmap[hr])&1) {
2017 emit_sarimm(hr,31,hr);
2018 emit_storereg(r|64,hr);
2022 emit_storereg(r|64,hr);
2032 //if(!tracedebug) return 0;
2035 for(i=0;i<2097152;i++) {
2036 unsigned int temp=sum;
2039 sum^=((u_int *)rdram)[i];
2048 sum^=((u_int *)reg)[i];
2056 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2058 #ifndef DISABLE_COP1
2061 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2071 void memdebug(int i)
2073 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2074 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2077 //if(Count>=-2084597794) {
2078 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2080 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2081 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2082 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2085 printf("TRACE: %x\n",(&i)[-1]);
2089 printf("TRACE: %x \n",(&j)[10]);
2090 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]);
2094 //printf("TRACE: %x\n",(&i)[-1]);
2097 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2099 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2102 void alu_assemble(int i,struct regstat *i_regs)
2104 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2106 signed char s1,s2,t;
2107 t=get_reg(i_regs->regmap,rt1[i]);
2109 s1=get_reg(i_regs->regmap,rs1[i]);
2110 s2=get_reg(i_regs->regmap,rs2[i]);
2111 if(rs1[i]&&rs2[i]) {
2114 if(opcode2[i]&2) emit_sub(s1,s2,t);
2115 else emit_add(s1,s2,t);
2118 if(s1>=0) emit_mov(s1,t);
2119 else emit_loadreg(rs1[i],t);
2123 if(opcode2[i]&2) emit_neg(s2,t);
2124 else emit_mov(s2,t);
2127 emit_loadreg(rs2[i],t);
2128 if(opcode2[i]&2) emit_neg(t,t);
2131 else emit_zeroreg(t);
2135 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2137 signed char s1l,s2l,s1h,s2h,tl,th;
2138 tl=get_reg(i_regs->regmap,rt1[i]);
2139 th=get_reg(i_regs->regmap,rt1[i]|64);
2141 s1l=get_reg(i_regs->regmap,rs1[i]);
2142 s2l=get_reg(i_regs->regmap,rs2[i]);
2143 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2144 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2145 if(rs1[i]&&rs2[i]) {
2148 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2149 else emit_adds(s1l,s2l,tl);
2151 #ifdef INVERTED_CARRY
2152 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2154 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2156 else emit_add(s1h,s2h,th);
2160 if(s1l>=0) emit_mov(s1l,tl);
2161 else emit_loadreg(rs1[i],tl);
2163 if(s1h>=0) emit_mov(s1h,th);
2164 else emit_loadreg(rs1[i]|64,th);
2169 if(opcode2[i]&2) emit_negs(s2l,tl);
2170 else emit_mov(s2l,tl);
2173 emit_loadreg(rs2[i],tl);
2174 if(opcode2[i]&2) emit_negs(tl,tl);
2177 #ifdef INVERTED_CARRY
2178 if(s2h>=0) emit_mov(s2h,th);
2179 else emit_loadreg(rs2[i]|64,th);
2181 emit_adcimm(-1,th); // x86 has inverted carry flag
2186 if(s2h>=0) emit_rscimm(s2h,0,th);
2188 emit_loadreg(rs2[i]|64,th);
2189 emit_rscimm(th,0,th);
2192 if(s2h>=0) emit_mov(s2h,th);
2193 else emit_loadreg(rs2[i]|64,th);
2200 if(th>=0) emit_zeroreg(th);
2205 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2207 signed char s1l,s1h,s2l,s2h,t;
2208 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2210 t=get_reg(i_regs->regmap,rt1[i]);
2213 s1l=get_reg(i_regs->regmap,rs1[i]);
2214 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2215 s2l=get_reg(i_regs->regmap,rs2[i]);
2216 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2217 if(rs2[i]==0) // rx<r0
2220 if(opcode2[i]==0x2a) // SLT
2221 emit_shrimm(s1h,31,t);
2222 else // SLTU (unsigned can not be less than zero)
2225 else if(rs1[i]==0) // r0<rx
2228 if(opcode2[i]==0x2a) // SLT
2229 emit_set_gz64_32(s2h,s2l,t);
2230 else // SLTU (set if not zero)
2231 emit_set_nz64_32(s2h,s2l,t);
2234 assert(s1l>=0);assert(s1h>=0);
2235 assert(s2l>=0);assert(s2h>=0);
2236 if(opcode2[i]==0x2a) // SLT
2237 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2239 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2243 t=get_reg(i_regs->regmap,rt1[i]);
2246 s1l=get_reg(i_regs->regmap,rs1[i]);
2247 s2l=get_reg(i_regs->regmap,rs2[i]);
2248 if(rs2[i]==0) // rx<r0
2251 if(opcode2[i]==0x2a) // SLT
2252 emit_shrimm(s1l,31,t);
2253 else // SLTU (unsigned can not be less than zero)
2256 else if(rs1[i]==0) // r0<rx
2259 if(opcode2[i]==0x2a) // SLT
2260 emit_set_gz32(s2l,t);
2261 else // SLTU (set if not zero)
2262 emit_set_nz32(s2l,t);
2265 assert(s1l>=0);assert(s2l>=0);
2266 if(opcode2[i]==0x2a) // SLT
2267 emit_set_if_less32(s1l,s2l,t);
2269 emit_set_if_carry32(s1l,s2l,t);
2275 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2277 signed char s1l,s1h,s2l,s2h,th,tl;
2278 tl=get_reg(i_regs->regmap,rt1[i]);
2279 th=get_reg(i_regs->regmap,rt1[i]|64);
2280 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2284 s1l=get_reg(i_regs->regmap,rs1[i]);
2285 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2286 s2l=get_reg(i_regs->regmap,rs2[i]);
2287 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2288 if(rs1[i]&&rs2[i]) {
2289 assert(s1l>=0);assert(s1h>=0);
2290 assert(s2l>=0);assert(s2h>=0);
2291 if(opcode2[i]==0x24) { // AND
2292 emit_and(s1l,s2l,tl);
2293 emit_and(s1h,s2h,th);
2295 if(opcode2[i]==0x25) { // OR
2296 emit_or(s1l,s2l,tl);
2297 emit_or(s1h,s2h,th);
2299 if(opcode2[i]==0x26) { // XOR
2300 emit_xor(s1l,s2l,tl);
2301 emit_xor(s1h,s2h,th);
2303 if(opcode2[i]==0x27) { // NOR
2304 emit_or(s1l,s2l,tl);
2305 emit_or(s1h,s2h,th);
2312 if(opcode2[i]==0x24) { // AND
2316 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2318 if(s1l>=0) emit_mov(s1l,tl);
2319 else emit_loadreg(rs1[i],tl);
2320 if(s1h>=0) emit_mov(s1h,th);
2321 else emit_loadreg(rs1[i]|64,th);
2325 if(s2l>=0) emit_mov(s2l,tl);
2326 else emit_loadreg(rs2[i],tl);
2327 if(s2h>=0) emit_mov(s2h,th);
2328 else emit_loadreg(rs2[i]|64,th);
2335 if(opcode2[i]==0x27) { // NOR
2337 if(s1l>=0) emit_not(s1l,tl);
2339 emit_loadreg(rs1[i],tl);
2342 if(s1h>=0) emit_not(s1h,th);
2344 emit_loadreg(rs1[i]|64,th);
2350 if(s2l>=0) emit_not(s2l,tl);
2352 emit_loadreg(rs2[i],tl);
2355 if(s2h>=0) emit_not(s2h,th);
2357 emit_loadreg(rs2[i]|64,th);
2373 s1l=get_reg(i_regs->regmap,rs1[i]);
2374 s2l=get_reg(i_regs->regmap,rs2[i]);
2375 if(rs1[i]&&rs2[i]) {
2378 if(opcode2[i]==0x24) { // AND
2379 emit_and(s1l,s2l,tl);
2381 if(opcode2[i]==0x25) { // OR
2382 emit_or(s1l,s2l,tl);
2384 if(opcode2[i]==0x26) { // XOR
2385 emit_xor(s1l,s2l,tl);
2387 if(opcode2[i]==0x27) { // NOR
2388 emit_or(s1l,s2l,tl);
2394 if(opcode2[i]==0x24) { // AND
2397 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2399 if(s1l>=0) emit_mov(s1l,tl);
2400 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2404 if(s2l>=0) emit_mov(s2l,tl);
2405 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2407 else emit_zeroreg(tl);
2409 if(opcode2[i]==0x27) { // NOR
2411 if(s1l>=0) emit_not(s1l,tl);
2413 emit_loadreg(rs1[i],tl);
2419 if(s2l>=0) emit_not(s2l,tl);
2421 emit_loadreg(rs2[i],tl);
2425 else emit_movimm(-1,tl);
2434 void imm16_assemble(int i,struct regstat *i_regs)
2436 if (opcode[i]==0x0f) { // LUI
2439 t=get_reg(i_regs->regmap,rt1[i]);
2442 if(!((i_regs->isconst>>t)&1))
2443 emit_movimm(imm[i]<<16,t);
2447 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2450 t=get_reg(i_regs->regmap,rt1[i]);
2451 s=get_reg(i_regs->regmap,rs1[i]);
2456 if(!((i_regs->isconst>>t)&1)) {
2458 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2459 emit_addimm(t,imm[i],t);
2461 if(!((i_regs->wasconst>>s)&1))
2462 emit_addimm(s,imm[i],t);
2464 emit_movimm(constmap[i][s]+imm[i],t);
2470 if(!((i_regs->isconst>>t)&1))
2471 emit_movimm(imm[i],t);
2476 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2478 signed char sh,sl,th,tl;
2479 th=get_reg(i_regs->regmap,rt1[i]|64);
2480 tl=get_reg(i_regs->regmap,rt1[i]);
2481 sh=get_reg(i_regs->regmap,rs1[i]|64);
2482 sl=get_reg(i_regs->regmap,rs1[i]);
2488 emit_addimm64_32(sh,sl,imm[i],th,tl);
2491 emit_addimm(sl,imm[i],tl);
2494 emit_movimm(imm[i],tl);
2495 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2500 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2502 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2503 signed char sh,sl,t;
2504 t=get_reg(i_regs->regmap,rt1[i]);
2505 sh=get_reg(i_regs->regmap,rs1[i]|64);
2506 sl=get_reg(i_regs->regmap,rs1[i]);
2510 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2511 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2512 if(opcode[i]==0x0a) { // SLTI
2514 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2515 emit_slti32(t,imm[i],t);
2517 emit_slti32(sl,imm[i],t);
2522 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2523 emit_sltiu32(t,imm[i],t);
2525 emit_sltiu32(sl,imm[i],t);
2530 if(opcode[i]==0x0a) // SLTI
2531 emit_slti64_32(sh,sl,imm[i],t);
2533 emit_sltiu64_32(sh,sl,imm[i],t);
2536 // SLTI(U) with r0 is just stupid,
2537 // nonetheless examples can be found
2538 if(opcode[i]==0x0a) // SLTI
2539 if(0<imm[i]) emit_movimm(1,t);
2540 else emit_zeroreg(t);
2543 if(imm[i]) emit_movimm(1,t);
2544 else emit_zeroreg(t);
2550 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2552 signed char sh,sl,th,tl;
2553 th=get_reg(i_regs->regmap,rt1[i]|64);
2554 tl=get_reg(i_regs->regmap,rt1[i]);
2555 sh=get_reg(i_regs->regmap,rs1[i]|64);
2556 sl=get_reg(i_regs->regmap,rs1[i]);
2557 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2558 if(opcode[i]==0x0c) //ANDI
2562 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2563 emit_andimm(tl,imm[i],tl);
2565 if(!((i_regs->wasconst>>sl)&1))
2566 emit_andimm(sl,imm[i],tl);
2568 emit_movimm(constmap[i][sl]&imm[i],tl);
2573 if(th>=0) emit_zeroreg(th);
2579 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2583 emit_loadreg(rs1[i]|64,th);
2588 if(opcode[i]==0x0d) //ORI
2590 emit_orimm(tl,imm[i],tl);
2592 if(!((i_regs->wasconst>>sl)&1))
2593 emit_orimm(sl,imm[i],tl);
2595 emit_movimm(constmap[i][sl]|imm[i],tl);
2597 if(opcode[i]==0x0e) //XORI
2599 emit_xorimm(tl,imm[i],tl);
2601 if(!((i_regs->wasconst>>sl)&1))
2602 emit_xorimm(sl,imm[i],tl);
2604 emit_movimm(constmap[i][sl]^imm[i],tl);
2608 emit_movimm(imm[i],tl);
2609 if(th>=0) emit_zeroreg(th);
2617 void shiftimm_assemble(int i,struct regstat *i_regs)
2619 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2623 t=get_reg(i_regs->regmap,rt1[i]);
2624 s=get_reg(i_regs->regmap,rs1[i]);
2633 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2635 if(opcode2[i]==0) // SLL
2637 emit_shlimm(s<0?t:s,imm[i],t);
2639 if(opcode2[i]==2) // SRL
2641 emit_shrimm(s<0?t:s,imm[i],t);
2643 if(opcode2[i]==3) // SRA
2645 emit_sarimm(s<0?t:s,imm[i],t);
2649 if(s>=0 && s!=t) emit_mov(s,t);
2653 //emit_storereg(rt1[i],t); //DEBUG
2656 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2659 signed char sh,sl,th,tl;
2660 th=get_reg(i_regs->regmap,rt1[i]|64);
2661 tl=get_reg(i_regs->regmap,rt1[i]);
2662 sh=get_reg(i_regs->regmap,rs1[i]|64);
2663 sl=get_reg(i_regs->regmap,rs1[i]);
2668 if(th>=0) emit_zeroreg(th);
2675 if(opcode2[i]==0x38) // DSLL
2677 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2678 emit_shlimm(sl,imm[i],tl);
2680 if(opcode2[i]==0x3a) // DSRL
2682 emit_shrdimm(sl,sh,imm[i],tl);
2683 if(th>=0) emit_shrimm(sh,imm[i],th);
2685 if(opcode2[i]==0x3b) // DSRA
2687 emit_shrdimm(sl,sh,imm[i],tl);
2688 if(th>=0) emit_sarimm(sh,imm[i],th);
2692 if(sl!=tl) emit_mov(sl,tl);
2693 if(th>=0&&sh!=th) emit_mov(sh,th);
2699 if(opcode2[i]==0x3c) // DSLL32
2702 signed char sl,tl,th;
2703 tl=get_reg(i_regs->regmap,rt1[i]);
2704 th=get_reg(i_regs->regmap,rt1[i]|64);
2705 sl=get_reg(i_regs->regmap,rs1[i]);
2714 emit_shlimm(th,imm[i]&31,th);
2719 if(opcode2[i]==0x3e) // DSRL32
2722 signed char sh,tl,th;
2723 tl=get_reg(i_regs->regmap,rt1[i]);
2724 th=get_reg(i_regs->regmap,rt1[i]|64);
2725 sh=get_reg(i_regs->regmap,rs1[i]|64);
2729 if(th>=0) emit_zeroreg(th);
2732 emit_shrimm(tl,imm[i]&31,tl);
2737 if(opcode2[i]==0x3f) // DSRA32
2741 tl=get_reg(i_regs->regmap,rt1[i]);
2742 sh=get_reg(i_regs->regmap,rs1[i]|64);
2748 emit_sarimm(tl,imm[i]&31,tl);
2755 #ifndef shift_assemble
2756 void shift_assemble(int i,struct regstat *i_regs)
2758 printf("Need shift_assemble for this architecture.\n");
2763 void load_assemble(int i,struct regstat *i_regs)
2765 int s,th,tl,addr,map=-1;
2768 int memtarget=0,c=0;
2770 th=get_reg(i_regs->regmap,rt1[i]|64);
2771 tl=get_reg(i_regs->regmap,rt1[i]);
2772 s=get_reg(i_regs->regmap,rs1[i]);
2774 for(hr=0;hr<HOST_REGS;hr++) {
2775 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2777 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2779 c=(i_regs->wasconst>>s)&1;
2781 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2782 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2785 //printf("load_assemble: c=%d\n",c);
2786 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2787 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2789 if(tl<0&&(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80)
2791 // could be FIFO, must perform the read
2793 assem_debug("(forced read)\n");
2794 tl=get_reg(i_regs->regmap,-1);
2798 if(offset||s<0||c) addr=tl;
2800 //if(tl<0) tl=get_reg(i_regs->regmap,-1);
2802 //printf("load_assemble: c=%d\n",c);
2803 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2804 assert(tl>=0); // Even if the load is a NOP, we must check for pagefaults and I/O
2806 if(th>=0) reglist&=~(1<<th);
2810 map=get_reg(i_regs->regmap,ROREG);
2811 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
2813 //#define R29_HACK 1
2815 // Strmnnrmn's speed hack
2816 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2820 if(sp_in_mirror&&rs1[i]==29) {
2821 emit_andimm(addr,~0x00e00000,HOST_TEMPREG);
2822 emit_cmpimm(HOST_TEMPREG,RAM_SIZE);
2826 emit_cmpimm(addr,RAM_SIZE);
2828 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
2829 // Hint to branch predictor that the branch is unlikely to be taken
2831 emit_jno_unlikely(0);
2839 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2840 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2841 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);
3167 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3168 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3171 if (opcode[i]==0x28) { // SB
3174 #ifdef BIG_ENDIAN_MIPS
3175 if(!c) emit_xorimm(addr,3,temp);
3176 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3181 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3183 //gen_tlb_addr_w(temp,map);
3184 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3185 emit_writebyte_indexed_tlb(tl,x,a,map,a);
3189 if (opcode[i]==0x29) { // SH
3192 #ifdef BIG_ENDIAN_MIPS
3193 if(!c) emit_xorimm(addr,2,temp);
3194 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3199 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3202 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3205 gen_tlb_addr_w(a,map);
3206 emit_writehword_indexed(tl,x,a);
3208 emit_writehword_indexed(tl,(int)rdram-0x80000000+x,a);
3212 if (opcode[i]==0x2B) { // SW
3216 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3218 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3219 emit_writeword_indexed_tlb(tl,0,a,map,temp);
3223 if (opcode[i]==0x3F) { // SD
3227 if(sp_in_mirror&&rs1[i]==29) a=HOST_TEMPREG;
3231 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3232 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3233 emit_writedword_indexed_tlb(th,tl,0,a,map,temp);
3236 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3237 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3238 emit_writedword_indexed_tlb(tl,tl,0,a,map,temp);
3245 #ifdef DESTRUCTIVE_SHIFT
3246 // The x86 shift operation is 'destructive'; it overwrites the
3247 // source register, so we need to make a copy first and use that.
3250 #if defined(HOST_IMM8)
3251 int ir=get_reg(i_regs->regmap,INVCP);
3253 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3255 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3257 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3258 emit_callne(invalidate_addr_reg[addr]);
3262 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3267 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3268 } else if(c&&!memtarget) {
3269 inline_writestub(type,i,constmap[i][s]+offset,i_regs->regmap,rs2[i],ccadj[i],reglist);
3271 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3272 //if(opcode[i]==0x2B || opcode[i]==0x28)
3273 //if(opcode[i]==0x2B || opcode[i]==0x29)
3274 //if(opcode[i]==0x2B)
3275 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3283 emit_readword((int)&last_count,ECX);
3285 if(get_reg(i_regs->regmap,CCREG)<0)
3286 emit_loadreg(CCREG,HOST_CCREG);
3287 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3288 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3289 emit_writeword(HOST_CCREG,(int)&Count);
3292 if(get_reg(i_regs->regmap,CCREG)<0)
3293 emit_loadreg(CCREG,0);
3295 emit_mov(HOST_CCREG,0);
3297 emit_addimm(0,2*ccadj[i],0);
3298 emit_writeword(0,(int)&Count);
3300 emit_call((int)memdebug);
3305 restore_regs(0x100f);
3310 void storelr_assemble(int i,struct regstat *i_regs)
3317 int case1,case2,case3;
3318 int done0,done1,done2;
3319 int memtarget=0,c=0;
3320 int agr=AGEN1+(i&1);
3322 th=get_reg(i_regs->regmap,rs2[i]|64);
3323 tl=get_reg(i_regs->regmap,rs2[i]);
3324 s=get_reg(i_regs->regmap,rs1[i]);
3325 temp=get_reg(i_regs->regmap,agr);
3326 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3329 c=(i_regs->isconst>>s)&1;
3331 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3332 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3336 for(hr=0;hr<HOST_REGS;hr++) {
3337 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3342 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3343 if(!offset&&s!=temp) emit_mov(s,temp);
3349 if(!memtarget||!rs1[i]) {
3355 int map=get_reg(i_regs->regmap,ROREG);
3356 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
3357 gen_tlb_addr_w(temp,map);
3359 if((u_int)rdram!=0x80000000)
3360 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3363 int map=get_reg(i_regs->regmap,TLREG);
3366 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3367 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3368 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3369 if(!jaddr&&!memtarget) {
3373 gen_tlb_addr_w(temp,map);
3376 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3377 temp2=get_reg(i_regs->regmap,FTEMP);
3378 if(!rs2[i]) temp2=th=tl;
3381 #ifndef BIG_ENDIAN_MIPS
3382 emit_xorimm(temp,3,temp);
3384 emit_testimm(temp,2);
3387 emit_testimm(temp,1);
3391 if (opcode[i]==0x2A) { // SWL
3392 emit_writeword_indexed(tl,0,temp);
3394 if (opcode[i]==0x2E) { // SWR
3395 emit_writebyte_indexed(tl,3,temp);
3397 if (opcode[i]==0x2C) { // SDL
3398 emit_writeword_indexed(th,0,temp);
3399 if(rs2[i]) emit_mov(tl,temp2);
3401 if (opcode[i]==0x2D) { // SDR
3402 emit_writebyte_indexed(tl,3,temp);
3403 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3408 set_jump_target(case1,(int)out);
3409 if (opcode[i]==0x2A) { // SWL
3410 // Write 3 msb into three least significant bytes
3411 if(rs2[i]) emit_rorimm(tl,8,tl);
3412 emit_writehword_indexed(tl,-1,temp);
3413 if(rs2[i]) emit_rorimm(tl,16,tl);
3414 emit_writebyte_indexed(tl,1,temp);
3415 if(rs2[i]) emit_rorimm(tl,8,tl);
3417 if (opcode[i]==0x2E) { // SWR
3418 // Write two lsb into two most significant bytes
3419 emit_writehword_indexed(tl,1,temp);
3421 if (opcode[i]==0x2C) { // SDL
3422 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3423 // Write 3 msb into three least significant bytes
3424 if(rs2[i]) emit_rorimm(th,8,th);
3425 emit_writehword_indexed(th,-1,temp);
3426 if(rs2[i]) emit_rorimm(th,16,th);
3427 emit_writebyte_indexed(th,1,temp);
3428 if(rs2[i]) emit_rorimm(th,8,th);
3430 if (opcode[i]==0x2D) { // SDR
3431 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3432 // Write two lsb into two most significant bytes
3433 emit_writehword_indexed(tl,1,temp);
3438 set_jump_target(case2,(int)out);
3439 emit_testimm(temp,1);
3442 if (opcode[i]==0x2A) { // SWL
3443 // Write two msb into two least significant bytes
3444 if(rs2[i]) emit_rorimm(tl,16,tl);
3445 emit_writehword_indexed(tl,-2,temp);
3446 if(rs2[i]) emit_rorimm(tl,16,tl);
3448 if (opcode[i]==0x2E) { // SWR
3449 // Write 3 lsb into three most significant bytes
3450 emit_writebyte_indexed(tl,-1,temp);
3451 if(rs2[i]) emit_rorimm(tl,8,tl);
3452 emit_writehword_indexed(tl,0,temp);
3453 if(rs2[i]) emit_rorimm(tl,24,tl);
3455 if (opcode[i]==0x2C) { // SDL
3456 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3457 // Write two msb into two least significant bytes
3458 if(rs2[i]) emit_rorimm(th,16,th);
3459 emit_writehword_indexed(th,-2,temp);
3460 if(rs2[i]) emit_rorimm(th,16,th);
3462 if (opcode[i]==0x2D) { // SDR
3463 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3464 // Write 3 lsb into three most significant bytes
3465 emit_writebyte_indexed(tl,-1,temp);
3466 if(rs2[i]) emit_rorimm(tl,8,tl);
3467 emit_writehword_indexed(tl,0,temp);
3468 if(rs2[i]) emit_rorimm(tl,24,tl);
3473 set_jump_target(case3,(int)out);
3474 if (opcode[i]==0x2A) { // SWL
3475 // Write msb into least significant byte
3476 if(rs2[i]) emit_rorimm(tl,24,tl);
3477 emit_writebyte_indexed(tl,-3,temp);
3478 if(rs2[i]) emit_rorimm(tl,8,tl);
3480 if (opcode[i]==0x2E) { // SWR
3481 // Write entire word
3482 emit_writeword_indexed(tl,-3,temp);
3484 if (opcode[i]==0x2C) { // SDL
3485 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3486 // Write msb into least significant byte
3487 if(rs2[i]) emit_rorimm(th,24,th);
3488 emit_writebyte_indexed(th,-3,temp);
3489 if(rs2[i]) emit_rorimm(th,8,th);
3491 if (opcode[i]==0x2D) { // SDR
3492 if(rs2[i]) emit_mov(th,temp2);
3493 // Write entire word
3494 emit_writeword_indexed(tl,-3,temp);
3496 set_jump_target(done0,(int)out);
3497 set_jump_target(done1,(int)out);
3498 set_jump_target(done2,(int)out);
3499 if (opcode[i]==0x2C) { // SDL
3500 emit_testimm(temp,4);
3503 emit_andimm(temp,~3,temp);
3504 emit_writeword_indexed(temp2,4,temp);
3505 set_jump_target(done0,(int)out);
3507 if (opcode[i]==0x2D) { // SDR
3508 emit_testimm(temp,4);
3511 emit_andimm(temp,~3,temp);
3512 emit_writeword_indexed(temp2,-4,temp);
3513 set_jump_target(done0,(int)out);
3516 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3519 int map=get_reg(i_regs->regmap,ROREG);
3520 if(map<0) map=HOST_TEMPREG;
3521 gen_orig_addr_w(temp,map);
3523 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3525 #if defined(HOST_IMM8)
3526 int ir=get_reg(i_regs->regmap,INVCP);
3528 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3530 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3532 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3533 emit_callne(invalidate_addr_reg[temp]);
3537 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3542 //save_regs(0x100f);
3543 emit_readword((int)&last_count,ECX);
3544 if(get_reg(i_regs->regmap,CCREG)<0)
3545 emit_loadreg(CCREG,HOST_CCREG);
3546 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3547 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3548 emit_writeword(HOST_CCREG,(int)&Count);
3549 emit_call((int)memdebug);
3551 //restore_regs(0x100f);
3555 void c1ls_assemble(int i,struct regstat *i_regs)
3557 #ifndef DISABLE_COP1
3563 int jaddr,jaddr2=0,jaddr3,type;
3564 int agr=AGEN1+(i&1);
3566 th=get_reg(i_regs->regmap,FTEMP|64);
3567 tl=get_reg(i_regs->regmap,FTEMP);
3568 s=get_reg(i_regs->regmap,rs1[i]);
3569 temp=get_reg(i_regs->regmap,agr);
3570 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3575 for(hr=0;hr<HOST_REGS;hr++) {
3576 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3578 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3579 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3581 // Loads use a temporary register which we need to save
3584 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3588 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3589 //else c=(i_regs->wasconst>>s)&1;
3590 if(s>=0) c=(i_regs->wasconst>>s)&1;
3591 // Check cop1 unusable
3593 signed char rs=get_reg(i_regs->regmap,CSREG);
3595 emit_testimm(rs,0x20000000);
3598 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3601 if (opcode[i]==0x39) { // SWC1 (get float address)
3602 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3604 if (opcode[i]==0x3D) { // SDC1 (get double address)
3605 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3607 // Generate address + offset
3610 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3614 map=get_reg(i_regs->regmap,TLREG);
3617 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3618 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3620 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3621 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3624 if (opcode[i]==0x39) { // SWC1 (read float)
3625 emit_readword_indexed(0,tl,tl);
3627 if (opcode[i]==0x3D) { // SDC1 (read double)
3628 emit_readword_indexed(4,tl,th);
3629 emit_readword_indexed(0,tl,tl);
3631 if (opcode[i]==0x31) { // LWC1 (get target address)
3632 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3634 if (opcode[i]==0x35) { // LDC1 (get target address)
3635 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3642 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3644 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3646 #ifdef DESTRUCTIVE_SHIFT
3647 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3648 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3652 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3653 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3655 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3656 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3659 if (opcode[i]==0x31) { // LWC1
3660 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3661 //gen_tlb_addr_r(ar,map);
3662 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3663 #ifdef HOST_IMM_ADDR32
3664 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3667 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3670 if (opcode[i]==0x35) { // LDC1
3672 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3673 //gen_tlb_addr_r(ar,map);
3674 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3675 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3676 #ifdef HOST_IMM_ADDR32
3677 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3680 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3683 if (opcode[i]==0x39) { // SWC1
3684 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3685 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3688 if (opcode[i]==0x3D) { // SDC1
3690 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3691 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3692 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3696 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3697 #ifndef DESTRUCTIVE_SHIFT
3698 temp=offset||c||s<0?ar:s;
3700 #if defined(HOST_IMM8)
3701 int ir=get_reg(i_regs->regmap,INVCP);
3703 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3705 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3707 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3708 emit_callne(invalidate_addr_reg[temp]);
3712 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3716 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3717 if (opcode[i]==0x31) { // LWC1 (write float)
3718 emit_writeword_indexed(tl,0,temp);
3720 if (opcode[i]==0x35) { // LDC1 (write double)
3721 emit_writeword_indexed(th,4,temp);
3722 emit_writeword_indexed(tl,0,temp);
3724 //if(opcode[i]==0x39)
3725 /*if(opcode[i]==0x39||opcode[i]==0x31)
3728 emit_readword((int)&last_count,ECX);
3729 if(get_reg(i_regs->regmap,CCREG)<0)
3730 emit_loadreg(CCREG,HOST_CCREG);
3731 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3732 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3733 emit_writeword(HOST_CCREG,(int)&Count);
3734 emit_call((int)memdebug);
3738 cop1_unusable(i, i_regs);
3742 void c2ls_assemble(int i,struct regstat *i_regs)
3747 int memtarget=0,c=0;
3748 int jaddr2=0,jaddr3,type;
3749 int agr=AGEN1+(i&1);
3751 u_int copr=(source[i]>>16)&0x1f;
3752 s=get_reg(i_regs->regmap,rs1[i]);
3753 tl=get_reg(i_regs->regmap,FTEMP);
3759 for(hr=0;hr<HOST_REGS;hr++) {
3760 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3762 if(i_regs->regmap[HOST_CCREG]==CCREG)
3763 reglist&=~(1<<HOST_CCREG);
3766 if (opcode[i]==0x3a) { // SWC2
3767 ar=get_reg(i_regs->regmap,agr);
3768 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3773 if(s>=0) c=(i_regs->wasconst>>s)&1;
3774 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3775 if (!offset&&!c&&s>=0) ar=s;
3778 if (opcode[i]==0x3a) { // SWC2
3779 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3787 emit_jmp(0); // inline_readstub/inline_writestub?
3791 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3795 if (opcode[i]==0x32) { // LWC2
3796 #ifdef HOST_IMM_ADDR32
3797 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3800 emit_readword_indexed(0,ar,tl);
3802 if (opcode[i]==0x3a) { // SWC2
3803 #ifdef DESTRUCTIVE_SHIFT
3804 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3806 emit_writeword_indexed(tl,0,ar);
3810 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3811 if (opcode[i]==0x3a) { // SWC2
3812 #if defined(HOST_IMM8)
3813 int ir=get_reg(i_regs->regmap,INVCP);
3815 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3817 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3819 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3820 emit_callne(invalidate_addr_reg[ar]);
3824 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3827 if (opcode[i]==0x32) { // LWC2
3828 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3832 #ifndef multdiv_assemble
3833 void multdiv_assemble(int i,struct regstat *i_regs)
3835 printf("Need multdiv_assemble for this architecture.\n");
3840 void mov_assemble(int i,struct regstat *i_regs)
3842 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3843 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3845 signed char sh,sl,th,tl;
3846 th=get_reg(i_regs->regmap,rt1[i]|64);
3847 tl=get_reg(i_regs->regmap,rt1[i]);
3850 sh=get_reg(i_regs->regmap,rs1[i]|64);
3851 sl=get_reg(i_regs->regmap,rs1[i]);
3852 if(sl>=0) emit_mov(sl,tl);
3853 else emit_loadreg(rs1[i],tl);
3855 if(sh>=0) emit_mov(sh,th);
3856 else emit_loadreg(rs1[i]|64,th);
3862 #ifndef fconv_assemble
3863 void fconv_assemble(int i,struct regstat *i_regs)
3865 printf("Need fconv_assemble for this architecture.\n");
3871 void float_assemble(int i,struct regstat *i_regs)
3873 printf("Need float_assemble for this architecture.\n");
3878 void syscall_assemble(int i,struct regstat *i_regs)
3880 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3881 assert(ccreg==HOST_CCREG);
3882 assert(!is_delayslot);
3883 emit_movimm(start+i*4,EAX); // Get PC
3884 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3885 emit_jmp((int)jump_syscall_hle); // XXX
3888 void hlecall_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+4,0); // Get PC
3894 emit_movimm((int)psxHLEt[source[i]&7],1);
3895 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // XXX
3896 emit_jmp((int)jump_hlecall);
3899 void intcall_assemble(int i,struct regstat *i_regs)
3901 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3902 assert(ccreg==HOST_CCREG);
3903 assert(!is_delayslot);
3904 emit_movimm(start+i*4,0); // Get PC
3905 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG);
3906 emit_jmp((int)jump_intcall);
3909 void ds_assemble(int i,struct regstat *i_regs)
3914 alu_assemble(i,i_regs);break;
3916 imm16_assemble(i,i_regs);break;
3918 shift_assemble(i,i_regs);break;
3920 shiftimm_assemble(i,i_regs);break;
3922 load_assemble(i,i_regs);break;
3924 loadlr_assemble(i,i_regs);break;
3926 store_assemble(i,i_regs);break;
3928 storelr_assemble(i,i_regs);break;
3930 cop0_assemble(i,i_regs);break;
3932 cop1_assemble(i,i_regs);break;
3934 c1ls_assemble(i,i_regs);break;
3936 cop2_assemble(i,i_regs);break;
3938 c2ls_assemble(i,i_regs);break;
3940 c2op_assemble(i,i_regs);break;
3942 fconv_assemble(i,i_regs);break;
3944 float_assemble(i,i_regs);break;
3946 fcomp_assemble(i,i_regs);break;
3948 multdiv_assemble(i,i_regs);break;
3950 mov_assemble(i,i_regs);break;
3960 printf("Jump in the delay slot. This is probably a bug.\n");
3965 // Is the branch target a valid internal jump?
3966 int internal_branch(uint64_t i_is32,int addr)
3968 if(addr&1) return 0; // Indirect (register) jump
3969 if(addr>=start && addr<start+slen*4-4)
3971 int t=(addr-start)>>2;
3972 // Delay slots are not valid branch targets
3973 //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;
3974 // 64 -> 32 bit transition requires a recompile
3975 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
3977 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
3978 else printf("optimizable: yes\n");
3980 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
3982 if(requires_32bit[t]&~i_is32) return 0;
3990 #ifndef wb_invalidate
3991 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
3992 uint64_t u,uint64_t uu)
3995 for(hr=0;hr<HOST_REGS;hr++) {
3996 if(hr!=EXCLUDE_REG) {
3997 if(pre[hr]!=entry[hr]) {
4000 if(get_reg(entry,pre[hr])<0) {
4002 if(!((u>>pre[hr])&1)) {
4003 emit_storereg(pre[hr],hr);
4004 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
4005 emit_sarimm(hr,31,hr);
4006 emit_storereg(pre[hr]|64,hr);
4010 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
4011 emit_storereg(pre[hr],hr);
4020 // Move from one register to another (no writeback)
4021 for(hr=0;hr<HOST_REGS;hr++) {
4022 if(hr!=EXCLUDE_REG) {
4023 if(pre[hr]!=entry[hr]) {
4024 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
4026 if((nr=get_reg(entry,pre[hr]))>=0) {
4036 // Load the specified registers
4037 // This only loads the registers given as arguments because
4038 // we don't want to load things that will be overwritten
4039 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
4043 for(hr=0;hr<HOST_REGS;hr++) {
4044 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4045 if(entry[hr]!=regmap[hr]) {
4046 if(regmap[hr]==rs1||regmap[hr]==rs2)
4053 emit_loadreg(regmap[hr],hr);
4060 for(hr=0;hr<HOST_REGS;hr++) {
4061 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4062 if(entry[hr]!=regmap[hr]) {
4063 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
4065 assert(regmap[hr]!=64);
4066 if((is32>>(regmap[hr]&63))&1) {
4067 int lr=get_reg(regmap,regmap[hr]-64);
4069 emit_sarimm(lr,31,hr);
4071 emit_loadreg(regmap[hr],hr);
4075 emit_loadreg(regmap[hr],hr);
4083 // Load registers prior to the start of a loop
4084 // so that they are not loaded within the loop
4085 static void loop_preload(signed char pre[],signed char entry[])
4088 for(hr=0;hr<HOST_REGS;hr++) {
4089 if(hr!=EXCLUDE_REG) {
4090 if(pre[hr]!=entry[hr]) {
4092 if(get_reg(pre,entry[hr])<0) {
4093 assem_debug("loop preload:\n");
4094 //printf("loop preload: %d\n",hr);
4098 else if(entry[hr]<TEMPREG)
4100 emit_loadreg(entry[hr],hr);
4102 else if(entry[hr]-64<TEMPREG)
4104 emit_loadreg(entry[hr],hr);
4113 // Generate address for load/store instruction
4114 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
4115 void address_generation(int i,struct regstat *i_regs,signed char entry[])
4117 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
4119 int agr=AGEN1+(i&1);
4120 int mgr=MGEN1+(i&1);
4121 if(itype[i]==LOAD) {
4122 ra=get_reg(i_regs->regmap,rt1[i]);
4123 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4126 if(itype[i]==LOADLR) {
4127 ra=get_reg(i_regs->regmap,FTEMP);
4129 if(itype[i]==STORE||itype[i]==STORELR) {
4130 ra=get_reg(i_regs->regmap,agr);
4131 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4133 if(itype[i]==C1LS||itype[i]==C2LS) {
4134 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
4135 ra=get_reg(i_regs->regmap,FTEMP);
4136 else { // SWC1/SDC1/SWC2/SDC2
4137 ra=get_reg(i_regs->regmap,agr);
4138 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4141 int rs=get_reg(i_regs->regmap,rs1[i]);
4142 int rm=get_reg(i_regs->regmap,TLREG);
4145 int c=(i_regs->wasconst>>rs)&1;
4147 // Using r0 as a base address
4149 if(!entry||entry[rm]!=mgr) {
4150 generate_map_const(offset,rm);
4151 } // else did it in the previous cycle
4153 if(!entry||entry[ra]!=agr) {
4154 if (opcode[i]==0x22||opcode[i]==0x26) {
4155 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4156 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4157 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4159 emit_movimm(offset,ra);
4161 } // else did it in the previous cycle
4164 if(!entry||entry[ra]!=rs1[i])
4165 emit_loadreg(rs1[i],ra);
4166 //if(!entry||entry[ra]!=rs1[i])
4167 // printf("poor load scheduling!\n");
4171 if(!entry||entry[rm]!=mgr) {
4172 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4173 // Stores to memory go thru the mapper to detect self-modifying
4174 // code, loads don't.
4175 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4176 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4177 generate_map_const(constmap[i][rs]+offset,rm);
4179 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4180 generate_map_const(constmap[i][rs]+offset,rm);
4184 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4185 if(!entry||entry[ra]!=agr) {
4186 if (opcode[i]==0x22||opcode[i]==0x26) {
4187 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4188 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4189 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4191 #ifdef HOST_IMM_ADDR32
4192 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4193 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4195 emit_movimm(constmap[i][rs]+offset,ra);
4197 } // else did it in the previous cycle
4198 } // else load_consts already did it
4200 if(offset&&!c&&rs1[i]) {
4202 emit_addimm(rs,offset,ra);
4204 emit_addimm(ra,offset,ra);
4209 // Preload constants for next instruction
4210 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) {
4212 #ifndef HOST_IMM_ADDR32
4214 agr=MGEN1+((i+1)&1);
4215 ra=get_reg(i_regs->regmap,agr);
4217 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4218 int offset=imm[i+1];
4219 int c=(regs[i+1].wasconst>>rs)&1;
4221 if(itype[i+1]==STORE||itype[i+1]==STORELR
4222 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4223 // Stores to memory go thru the mapper to detect self-modifying
4224 // code, loads don't.
4225 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4226 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4227 generate_map_const(constmap[i+1][rs]+offset,ra);
4229 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4230 generate_map_const(constmap[i+1][rs]+offset,ra);
4233 /*else if(rs1[i]==0) {
4234 generate_map_const(offset,ra);
4239 agr=AGEN1+((i+1)&1);
4240 ra=get_reg(i_regs->regmap,agr);
4242 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4243 int offset=imm[i+1];
4244 int c=(regs[i+1].wasconst>>rs)&1;
4245 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4246 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4247 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4248 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4249 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4251 #ifdef HOST_IMM_ADDR32
4252 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4253 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4255 emit_movimm(constmap[i+1][rs]+offset,ra);
4258 else if(rs1[i+1]==0) {
4259 // Using r0 as a base address
4260 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4261 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4262 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4263 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4265 emit_movimm(offset,ra);
4272 int get_final_value(int hr, int i, int *value)
4274 int reg=regs[i].regmap[hr];
4276 if(regs[i+1].regmap[hr]!=reg) break;
4277 if(!((regs[i+1].isconst>>hr)&1)) break;
4282 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4283 *value=constmap[i][hr];
4287 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4288 // Load in delay slot, out-of-order execution
4289 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4291 #ifdef HOST_IMM_ADDR32
4292 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4294 // Precompute load address
4295 *value=constmap[i][hr]+imm[i+2];
4299 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4301 #ifdef HOST_IMM_ADDR32
4302 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4304 // Precompute load address
4305 *value=constmap[i][hr]+imm[i+1];
4306 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4311 *value=constmap[i][hr];
4312 //printf("c=%x\n",(int)constmap[i][hr]);
4313 if(i==slen-1) return 1;
4315 return !((unneeded_reg[i+1]>>reg)&1);
4317 return !((unneeded_reg_upper[i+1]>>reg)&1);
4321 // Load registers with known constants
4322 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4326 for(hr=0;hr<HOST_REGS;hr++) {
4327 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4328 //if(entry[hr]!=regmap[hr]) {
4329 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4330 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4332 if(get_final_value(hr,i,&value)) {
4337 emit_movimm(value,hr);
4345 for(hr=0;hr<HOST_REGS;hr++) {
4346 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4347 //if(entry[hr]!=regmap[hr]) {
4348 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4349 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4350 if((is32>>(regmap[hr]&63))&1) {
4351 int lr=get_reg(regmap,regmap[hr]-64);
4353 emit_sarimm(lr,31,hr);
4358 if(get_final_value(hr,i,&value)) {
4363 emit_movimm(value,hr);
4372 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4376 for(hr=0;hr<HOST_REGS;hr++) {
4377 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4378 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4379 int value=constmap[i][hr];
4384 emit_movimm(value,hr);
4390 for(hr=0;hr<HOST_REGS;hr++) {
4391 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4392 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4393 if((is32>>(regmap[hr]&63))&1) {
4394 int lr=get_reg(regmap,regmap[hr]-64);
4396 emit_sarimm(lr,31,hr);
4400 int value=constmap[i][hr];
4405 emit_movimm(value,hr);
4413 // Write out all dirty registers (except cycle count)
4414 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4417 for(hr=0;hr<HOST_REGS;hr++) {
4418 if(hr!=EXCLUDE_REG) {
4419 if(i_regmap[hr]>0) {
4420 if(i_regmap[hr]!=CCREG) {
4421 if((i_dirty>>hr)&1) {
4422 if(i_regmap[hr]<64) {
4423 emit_storereg(i_regmap[hr],hr);
4425 if( ((i_is32>>i_regmap[hr])&1) ) {
4426 #ifdef DESTRUCTIVE_WRITEBACK
4427 emit_sarimm(hr,31,hr);
4428 emit_storereg(i_regmap[hr]|64,hr);
4430 emit_sarimm(hr,31,HOST_TEMPREG);
4431 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4436 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4437 emit_storereg(i_regmap[hr],hr);
4446 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4447 // This writes the registers not written by store_regs_bt
4448 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4451 int t=(addr-start)>>2;
4452 for(hr=0;hr<HOST_REGS;hr++) {
4453 if(hr!=EXCLUDE_REG) {
4454 if(i_regmap[hr]>0) {
4455 if(i_regmap[hr]!=CCREG) {
4456 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)) {
4457 if((i_dirty>>hr)&1) {
4458 if(i_regmap[hr]<64) {
4459 emit_storereg(i_regmap[hr],hr);
4461 if( ((i_is32>>i_regmap[hr])&1) ) {
4462 #ifdef DESTRUCTIVE_WRITEBACK
4463 emit_sarimm(hr,31,hr);
4464 emit_storereg(i_regmap[hr]|64,hr);
4466 emit_sarimm(hr,31,HOST_TEMPREG);
4467 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4472 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4473 emit_storereg(i_regmap[hr],hr);
4484 // Load all registers (except cycle count)
4485 void load_all_regs(signed char i_regmap[])
4488 for(hr=0;hr<HOST_REGS;hr++) {
4489 if(hr!=EXCLUDE_REG) {
4490 if(i_regmap[hr]==0) {
4494 if(i_regmap[hr]>0 && (i_regmap[hr]&63)<TEMPREG && i_regmap[hr]!=CCREG)
4496 emit_loadreg(i_regmap[hr],hr);
4502 // Load all current registers also needed by next instruction
4503 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4506 for(hr=0;hr<HOST_REGS;hr++) {
4507 if(hr!=EXCLUDE_REG) {
4508 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4509 if(i_regmap[hr]==0) {
4513 if(i_regmap[hr]>0 && (i_regmap[hr]&63)<TEMPREG && i_regmap[hr]!=CCREG)
4515 emit_loadreg(i_regmap[hr],hr);
4522 // Load all regs, storing cycle count if necessary
4523 void load_regs_entry(int t)
4526 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER,HOST_CCREG);
4527 else if(ccadj[t]) emit_addimm(HOST_CCREG,-ccadj[t]*CLOCK_DIVIDER,HOST_CCREG);
4528 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4529 emit_storereg(CCREG,HOST_CCREG);
4532 for(hr=0;hr<HOST_REGS;hr++) {
4533 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<TEMPREG) {
4534 if(regs[t].regmap_entry[hr]==0) {
4537 else if(regs[t].regmap_entry[hr]!=CCREG)
4539 emit_loadreg(regs[t].regmap_entry[hr],hr);
4544 for(hr=0;hr<HOST_REGS;hr++) {
4545 if(regs[t].regmap_entry[hr]>=64&®s[t].regmap_entry[hr]<TEMPREG+64) {
4546 assert(regs[t].regmap_entry[hr]!=64);
4547 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4548 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4550 emit_loadreg(regs[t].regmap_entry[hr],hr);
4554 emit_sarimm(lr,31,hr);
4559 emit_loadreg(regs[t].regmap_entry[hr],hr);
4565 // Store dirty registers prior to branch
4566 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4568 if(internal_branch(i_is32,addr))
4570 int t=(addr-start)>>2;
4572 for(hr=0;hr<HOST_REGS;hr++) {
4573 if(hr!=EXCLUDE_REG) {
4574 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4575 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)) {
4576 if((i_dirty>>hr)&1) {
4577 if(i_regmap[hr]<64) {
4578 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4579 emit_storereg(i_regmap[hr],hr);
4580 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4581 #ifdef DESTRUCTIVE_WRITEBACK
4582 emit_sarimm(hr,31,hr);
4583 emit_storereg(i_regmap[hr]|64,hr);
4585 emit_sarimm(hr,31,HOST_TEMPREG);
4586 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4591 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4592 emit_storereg(i_regmap[hr],hr);
4603 // Branch out of this block, write out all dirty regs
4604 wb_dirtys(i_regmap,i_is32,i_dirty);
4608 // Load all needed registers for branch target
4609 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4611 //if(addr>=start && addr<(start+slen*4))
4612 if(internal_branch(i_is32,addr))
4614 int t=(addr-start)>>2;
4616 // Store the cycle count before loading something else
4617 if(i_regmap[HOST_CCREG]!=CCREG) {
4618 assert(i_regmap[HOST_CCREG]==-1);
4620 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4621 emit_storereg(CCREG,HOST_CCREG);
4624 for(hr=0;hr<HOST_REGS;hr++) {
4625 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<TEMPREG) {
4626 #ifdef DESTRUCTIVE_WRITEBACK
4627 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)) {
4629 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4631 if(regs[t].regmap_entry[hr]==0) {
4634 else if(regs[t].regmap_entry[hr]!=CCREG)
4636 emit_loadreg(regs[t].regmap_entry[hr],hr);
4642 for(hr=0;hr<HOST_REGS;hr++) {
4643 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64&®s[t].regmap_entry[hr]<TEMPREG+64) {
4644 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4645 assert(regs[t].regmap_entry[hr]!=64);
4646 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4647 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4649 emit_loadreg(regs[t].regmap_entry[hr],hr);
4653 emit_sarimm(lr,31,hr);
4658 emit_loadreg(regs[t].regmap_entry[hr],hr);
4661 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4662 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4664 emit_sarimm(lr,31,hr);
4671 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4673 if(addr>=start && addr<start+slen*4-4)
4675 int t=(addr-start)>>2;
4677 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4678 for(hr=0;hr<HOST_REGS;hr++)
4682 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4684 if(regs[t].regmap_entry[hr]>=0&&(regs[t].regmap_entry[hr]|64)<TEMPREG+64)
4691 if(i_regmap[hr]<TEMPREG)
4693 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4696 else if(i_regmap[hr]>=64&&i_regmap[hr]<TEMPREG+64)
4698 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4703 else // Same register but is it 32-bit or dirty?
4706 if(!((regs[t].dirty>>hr)&1))
4710 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4712 //printf("%x: dirty no match\n",addr);
4717 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4719 //printf("%x: is32 no match\n",addr);
4725 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4727 if(requires_32bit[t]&~i_is32) return 0;
4729 // Delay slots are not valid branch targets
4730 //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;
4731 // Delay slots require additional processing, so do not match
4732 if(is_ds[t]) return 0;
4737 for(hr=0;hr<HOST_REGS;hr++)
4743 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4757 // Used when a branch jumps into the delay slot of another branch
4758 void ds_assemble_entry(int i)
4760 int t=(ba[i]-start)>>2;
4761 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4762 assem_debug("Assemble delay slot at %x\n",ba[i]);
4763 assem_debug("<->\n");
4764 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4765 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4766 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4767 address_generation(t,®s[t],regs[t].regmap_entry);
4768 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4769 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4774 alu_assemble(t,®s[t]);break;
4776 imm16_assemble(t,®s[t]);break;
4778 shift_assemble(t,®s[t]);break;
4780 shiftimm_assemble(t,®s[t]);break;
4782 load_assemble(t,®s[t]);break;
4784 loadlr_assemble(t,®s[t]);break;
4786 store_assemble(t,®s[t]);break;
4788 storelr_assemble(t,®s[t]);break;
4790 cop0_assemble(t,®s[t]);break;
4792 cop1_assemble(t,®s[t]);break;
4794 c1ls_assemble(t,®s[t]);break;
4796 cop2_assemble(t,®s[t]);break;
4798 c2ls_assemble(t,®s[t]);break;
4800 c2op_assemble(t,®s[t]);break;
4802 fconv_assemble(t,®s[t]);break;
4804 float_assemble(t,®s[t]);break;
4806 fcomp_assemble(t,®s[t]);break;
4808 multdiv_assemble(t,®s[t]);break;
4810 mov_assemble(t,®s[t]);break;
4820 printf("Jump in the delay slot. This is probably a bug.\n");
4822 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4823 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4824 if(internal_branch(regs[t].is32,ba[i]+4))
4825 assem_debug("branch: internal\n");
4827 assem_debug("branch: external\n");
4828 assert(internal_branch(regs[t].is32,ba[i]+4));
4829 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4833 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4842 //if(ba[i]>=start && ba[i]<(start+slen*4))
4843 if(internal_branch(branch_regs[i].is32,ba[i]))
4845 int t=(ba[i]-start)>>2;
4846 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4854 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4856 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4858 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4859 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4863 else if(*adj==0||invert) {
4864 emit_addimm_and_set_flags(CLOCK_DIVIDER*(count+2),HOST_CCREG);
4870 emit_cmpimm(HOST_CCREG,-CLOCK_DIVIDER*(count+2));
4874 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4877 void do_ccstub(int n)
4880 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4881 set_jump_target(stubs[n][1],(int)out);
4883 if(stubs[n][6]==NULLDS) {
4884 // Delay slot instruction is nullified ("likely" branch)
4885 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4887 else if(stubs[n][6]!=TAKEN) {
4888 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4891 if(internal_branch(branch_regs[i].is32,ba[i]))
4892 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4896 // Save PC as return address
4897 emit_movimm(stubs[n][5],EAX);
4898 emit_writeword(EAX,(int)&pcaddr);
4902 // Return address depends on which way the branch goes
4903 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4905 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4906 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4907 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4908 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
4918 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
4922 #ifdef DESTRUCTIVE_WRITEBACK
4924 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
4925 emit_loadreg(rs1[i],s1l);
4928 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
4929 emit_loadreg(rs2[i],s1l);
4932 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
4933 emit_loadreg(rs2[i],s2l);
4936 int addr=-1,alt=-1,ntaddr=-1;
4939 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4940 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4941 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4949 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4950 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4951 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4957 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
4961 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4962 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4963 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4969 assert(hr<HOST_REGS);
4971 if((opcode[i]&0x2f)==4) // BEQ
4973 #ifdef HAVE_CMOV_IMM
4975 if(s2l>=0) emit_cmp(s1l,s2l);
4976 else emit_test(s1l,s1l);
4977 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
4982 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4984 if(s2h>=0) emit_cmp(s1h,s2h);
4985 else emit_test(s1h,s1h);
4986 emit_cmovne_reg(alt,addr);
4988 if(s2l>=0) emit_cmp(s1l,s2l);
4989 else emit_test(s1l,s1l);
4990 emit_cmovne_reg(alt,addr);
4993 if((opcode[i]&0x2f)==5) // BNE
4995 #ifdef HAVE_CMOV_IMM
4997 if(s2l>=0) emit_cmp(s1l,s2l);
4998 else emit_test(s1l,s1l);
4999 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
5004 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
5006 if(s2h>=0) emit_cmp(s1h,s2h);
5007 else emit_test(s1h,s1h);
5008 emit_cmovne_reg(alt,addr);
5010 if(s2l>=0) emit_cmp(s1l,s2l);
5011 else emit_test(s1l,s1l);
5012 emit_cmovne_reg(alt,addr);
5015 if((opcode[i]&0x2f)==6) // BLEZ
5017 //emit_movimm(ba[i],alt);
5018 //emit_movimm(start+i*4+8,addr);
5019 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5021 if(s1h>=0) emit_mov(addr,ntaddr);
5022 emit_cmovl_reg(alt,addr);
5025 emit_cmovne_reg(ntaddr,addr);
5026 emit_cmovs_reg(alt,addr);
5029 if((opcode[i]&0x2f)==7) // BGTZ
5031 //emit_movimm(ba[i],addr);
5032 //emit_movimm(start+i*4+8,ntaddr);
5033 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
5035 if(s1h>=0) emit_mov(addr,alt);
5036 emit_cmovl_reg(ntaddr,addr);
5039 emit_cmovne_reg(alt,addr);
5040 emit_cmovs_reg(ntaddr,addr);
5043 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
5045 //emit_movimm(ba[i],alt);
5046 //emit_movimm(start+i*4+8,addr);
5047 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5048 if(s1h>=0) emit_test(s1h,s1h);
5049 else emit_test(s1l,s1l);
5050 emit_cmovs_reg(alt,addr);
5052 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
5054 //emit_movimm(ba[i],addr);
5055 //emit_movimm(start+i*4+8,alt);
5056 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5057 if(s1h>=0) emit_test(s1h,s1h);
5058 else emit_test(s1l,s1l);
5059 emit_cmovs_reg(alt,addr);
5061 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
5062 if(source[i]&0x10000) // BC1T
5064 //emit_movimm(ba[i],alt);
5065 //emit_movimm(start+i*4+8,addr);
5066 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5067 emit_testimm(s1l,0x800000);
5068 emit_cmovne_reg(alt,addr);
5072 //emit_movimm(ba[i],addr);
5073 //emit_movimm(start+i*4+8,alt);
5074 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5075 emit_testimm(s1l,0x800000);
5076 emit_cmovne_reg(alt,addr);
5079 emit_writeword(addr,(int)&pcaddr);
5084 int r=get_reg(branch_regs[i].regmap,rs1[i]);
5085 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5086 r=get_reg(branch_regs[i].regmap,RTEMP);
5088 emit_writeword(r,(int)&pcaddr);
5090 else {printf("Unknown branch type in do_ccstub\n");exit(1);}
5092 // Update cycle count
5093 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
5094 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5095 emit_call((int)cc_interrupt);
5096 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5097 if(stubs[n][6]==TAKEN) {
5098 if(internal_branch(branch_regs[i].is32,ba[i]))
5099 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
5100 else if(itype[i]==RJUMP) {
5101 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
5102 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
5104 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
5106 }else if(stubs[n][6]==NOTTAKEN) {
5107 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
5108 else load_all_regs(branch_regs[i].regmap);
5109 }else if(stubs[n][6]==NULLDS) {
5110 // Delay slot instruction is nullified ("likely" branch)
5111 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
5112 else load_all_regs(regs[i].regmap);
5114 load_all_regs(branch_regs[i].regmap);
5116 emit_jmp(stubs[n][2]); // return address
5118 /* This works but uses a lot of memory...
5119 emit_readword((int)&last_count,ECX);
5120 emit_add(HOST_CCREG,ECX,EAX);
5121 emit_writeword(EAX,(int)&Count);
5122 emit_call((int)gen_interupt);
5123 emit_readword((int)&Count,HOST_CCREG);
5124 emit_readword((int)&next_interupt,EAX);
5125 emit_readword((int)&pending_exception,EBX);
5126 emit_writeword(EAX,(int)&last_count);
5127 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
5129 int jne_instr=(int)out;
5131 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
5132 load_all_regs(branch_regs[i].regmap);
5133 emit_jmp(stubs[n][2]); // return address
5134 set_jump_target(jne_instr,(int)out);
5135 emit_readword((int)&pcaddr,EAX);
5136 // Call get_addr_ht instead of doing the hash table here.
5137 // This code is executed infrequently and takes up a lot of space
5138 // so smaller is better.
5139 emit_storereg(CCREG,HOST_CCREG);
5141 emit_call((int)get_addr_ht);
5142 emit_loadreg(CCREG,HOST_CCREG);
5143 emit_addimm(ESP,4,ESP);
5147 add_to_linker(int addr,int target,int ext)
5149 link_addr[linkcount][0]=addr;
5150 link_addr[linkcount][1]=target;
5151 link_addr[linkcount][2]=ext;
5155 void ujump_assemble(int i,struct regstat *i_regs)
5157 signed char *i_regmap=i_regs->regmap;
5158 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5159 address_generation(i+1,i_regs,regs[i].regmap_entry);
5161 int temp=get_reg(branch_regs[i].regmap,PTEMP);
5162 if(rt1[i]==31&&temp>=0)
5164 int return_address=start+i*4+8;
5165 if(get_reg(branch_regs[i].regmap,31)>0)
5166 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5171 unsigned int return_address;
5172 rt=get_reg(branch_regs[i].regmap,31);
5173 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]);
5175 return_address=start+i*4+8;
5178 if(internal_branch(branch_regs[i].is32,return_address)&&rt1[i+1]!=31) {
5179 int temp=-1; // note: must be ds-safe
5183 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5184 else emit_movimm(return_address,rt);
5192 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5195 emit_movimm(return_address,rt); // PC into link register
5197 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5202 ds_assemble(i+1,i_regs);
5203 uint64_t bc_unneeded=branch_regs[i].u;
5204 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5205 bc_unneeded|=1|(1LL<<rt1[i]);
5206 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5207 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5208 bc_unneeded,bc_unneeded_upper);
5209 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5211 cc=get_reg(branch_regs[i].regmap,CCREG);
5212 assert(cc==HOST_CCREG);
5213 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5215 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5217 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5218 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5219 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5220 if(internal_branch(branch_regs[i].is32,ba[i]))
5221 assem_debug("branch: internal\n");
5223 assem_debug("branch: external\n");
5224 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5225 ds_assemble_entry(i);
5228 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5233 void rjump_assemble(int i,struct regstat *i_regs)
5235 signed char *i_regmap=i_regs->regmap;
5238 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5240 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5241 // Delay slot abuse, make a copy of the branch address register
5242 temp=get_reg(branch_regs[i].regmap,RTEMP);
5244 assert(regs[i].regmap[temp]==RTEMP);
5248 address_generation(i+1,i_regs,regs[i].regmap_entry);
5252 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5253 int return_address=start+i*4+8;
5254 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5260 int rh=get_reg(regs[i].regmap,RHASH);
5261 if(rh>=0) do_preload_rhash(rh);
5264 ds_assemble(i+1,i_regs);
5265 uint64_t bc_unneeded=branch_regs[i].u;
5266 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5267 bc_unneeded|=1|(1LL<<rt1[i]);
5268 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5269 bc_unneeded&=~(1LL<<rs1[i]);
5270 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5271 bc_unneeded,bc_unneeded_upper);
5272 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5274 int rt,return_address;
5275 assert(rt1[i+1]!=rt1[i]);
5276 assert(rt2[i+1]!=rt1[i]);
5277 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5278 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]);
5280 return_address=start+i*4+8;
5284 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5287 emit_movimm(return_address,rt); // PC into link register
5289 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5292 cc=get_reg(branch_regs[i].regmap,CCREG);
5293 assert(cc==HOST_CCREG);
5295 int rh=get_reg(branch_regs[i].regmap,RHASH);
5296 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5298 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5299 do_preload_rhtbl(ht);
5303 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5304 #ifdef DESTRUCTIVE_WRITEBACK
5305 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5306 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5307 emit_loadreg(rs1[i],rs);
5312 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5316 do_miniht_load(ht,rh);
5319 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5320 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5322 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5323 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5325 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5328 do_miniht_jump(rs,rh,ht);
5333 //if(rs!=EAX) emit_mov(rs,EAX);
5334 //emit_jmp((int)jump_vaddr_eax);
5335 emit_jmp(jump_vaddr_reg[rs]);
5340 emit_shrimm(rs,16,rs);
5341 emit_xor(temp,rs,rs);
5342 emit_movzwl_reg(rs,rs);
5343 emit_shlimm(rs,4,rs);
5344 emit_cmpmem_indexed((int)hash_table,rs,temp);
5345 emit_jne((int)out+14);
5346 emit_readword_indexed((int)hash_table+4,rs,rs);
5348 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5349 emit_addimm_no_flags(8,rs);
5350 emit_jeq((int)out-17);
5351 // No hit on hash table, call compiler
5354 #ifdef DEBUG_CYCLE_COUNT
5355 emit_readword((int)&last_count,ECX);
5356 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5357 emit_readword((int)&next_interupt,ECX);
5358 emit_writeword(HOST_CCREG,(int)&Count);
5359 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5360 emit_writeword(ECX,(int)&last_count);
5363 emit_storereg(CCREG,HOST_CCREG);
5364 emit_call((int)get_addr);
5365 emit_loadreg(CCREG,HOST_CCREG);
5366 emit_addimm(ESP,4,ESP);
5368 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5369 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5373 void cjump_assemble(int i,struct regstat *i_regs)
5375 signed char *i_regmap=i_regs->regmap;
5378 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5379 assem_debug("match=%d\n",match);
5380 int s1h,s1l,s2h,s2l;
5381 int prev_cop1_usable=cop1_usable;
5382 int unconditional=0,nop=0;
5385 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5386 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5387 if(!match) invert=1;
5388 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5389 if(i>(ba[i]-start)>>2) invert=1;
5393 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5394 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5395 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5396 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5399 s1l=get_reg(i_regmap,rs1[i]);
5400 s1h=get_reg(i_regmap,rs1[i]|64);
5401 s2l=get_reg(i_regmap,rs2[i]);
5402 s2h=get_reg(i_regmap,rs2[i]|64);
5404 if(rs1[i]==0&&rs2[i]==0)
5406 if(opcode[i]&1) nop=1;
5407 else unconditional=1;
5408 //assert(opcode[i]!=5);
5409 //assert(opcode[i]!=7);
5410 //assert(opcode[i]!=0x15);
5411 //assert(opcode[i]!=0x17);
5417 only32=(regs[i].was32>>rs2[i])&1;
5422 only32=(regs[i].was32>>rs1[i])&1;
5425 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5429 // Out of order execution (delay slot first)
5431 address_generation(i+1,i_regs,regs[i].regmap_entry);
5432 ds_assemble(i+1,i_regs);
5434 uint64_t bc_unneeded=branch_regs[i].u;
5435 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5436 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5437 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5439 bc_unneeded_upper|=1;
5440 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5441 bc_unneeded,bc_unneeded_upper);
5442 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5443 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5444 cc=get_reg(branch_regs[i].regmap,CCREG);
5445 assert(cc==HOST_CCREG);
5447 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5448 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5449 //assem_debug("cycle count (adj)\n");
5451 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5452 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5453 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5454 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5456 assem_debug("branch: internal\n");
5458 assem_debug("branch: external\n");
5459 if(internal&&is_ds[(ba[i]-start)>>2]) {
5460 ds_assemble_entry(i);
5463 add_to_linker((int)out,ba[i],internal);
5466 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5467 if(((u_int)out)&7) emit_addnop(0);
5472 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5475 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5478 int taken=0,nottaken=0,nottaken1=0;
5479 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5480 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5484 if(opcode[i]==4) // BEQ
5486 if(s2h>=0) emit_cmp(s1h,s2h);
5487 else emit_test(s1h,s1h);
5491 if(opcode[i]==5) // BNE
5493 if(s2h>=0) emit_cmp(s1h,s2h);
5494 else emit_test(s1h,s1h);
5495 if(invert) taken=(int)out;
5496 else add_to_linker((int)out,ba[i],internal);
5499 if(opcode[i]==6) // BLEZ
5502 if(invert) taken=(int)out;
5503 else add_to_linker((int)out,ba[i],internal);
5508 if(opcode[i]==7) // BGTZ
5513 if(invert) taken=(int)out;
5514 else add_to_linker((int)out,ba[i],internal);
5519 //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]);
5521 if(opcode[i]==4) // BEQ
5523 if(s2l>=0) emit_cmp(s1l,s2l);
5524 else emit_test(s1l,s1l);
5529 add_to_linker((int)out,ba[i],internal);
5533 if(opcode[i]==5) // BNE
5535 if(s2l>=0) emit_cmp(s1l,s2l);
5536 else emit_test(s1l,s1l);
5541 add_to_linker((int)out,ba[i],internal);
5545 if(opcode[i]==6) // BLEZ
5552 add_to_linker((int)out,ba[i],internal);
5556 if(opcode[i]==7) // BGTZ
5563 add_to_linker((int)out,ba[i],internal);
5568 if(taken) set_jump_target(taken,(int)out);
5569 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5570 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5572 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5573 add_to_linker((int)out,ba[i],internal);
5576 add_to_linker((int)out,ba[i],internal*2);
5582 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5583 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5584 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5586 assem_debug("branch: internal\n");
5588 assem_debug("branch: external\n");
5589 if(internal&&is_ds[(ba[i]-start)>>2]) {
5590 ds_assemble_entry(i);
5593 add_to_linker((int)out,ba[i],internal);
5597 set_jump_target(nottaken,(int)out);
5600 if(nottaken1) set_jump_target(nottaken1,(int)out);
5602 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5604 } // (!unconditional)
5608 // In-order execution (branch first)
5609 //if(likely[i]) printf("IOL\n");
5612 int taken=0,nottaken=0,nottaken1=0;
5613 if(!unconditional&&!nop) {
5617 if((opcode[i]&0x2f)==4) // BEQ
5619 if(s2h>=0) emit_cmp(s1h,s2h);
5620 else emit_test(s1h,s1h);
5624 if((opcode[i]&0x2f)==5) // BNE
5626 if(s2h>=0) emit_cmp(s1h,s2h);
5627 else emit_test(s1h,s1h);
5631 if((opcode[i]&0x2f)==6) // BLEZ
5639 if((opcode[i]&0x2f)==7) // BGTZ
5649 //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]);
5651 if((opcode[i]&0x2f)==4) // BEQ
5653 if(s2l>=0) emit_cmp(s1l,s2l);
5654 else emit_test(s1l,s1l);
5658 if((opcode[i]&0x2f)==5) // BNE
5660 if(s2l>=0) emit_cmp(s1l,s2l);
5661 else emit_test(s1l,s1l);
5665 if((opcode[i]&0x2f)==6) // BLEZ
5671 if((opcode[i]&0x2f)==7) // BGTZ
5677 } // if(!unconditional)
5679 uint64_t ds_unneeded=branch_regs[i].u;
5680 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5681 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5682 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5683 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5685 ds_unneeded_upper|=1;
5688 if(taken) set_jump_target(taken,(int)out);
5689 assem_debug("1:\n");
5690 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5691 ds_unneeded,ds_unneeded_upper);
5693 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5694 address_generation(i+1,&branch_regs[i],0);
5695 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5696 ds_assemble(i+1,&branch_regs[i]);
5697 cc=get_reg(branch_regs[i].regmap,CCREG);
5699 emit_loadreg(CCREG,cc=HOST_CCREG);
5700 // CHECK: Is the following instruction (fall thru) allocated ok?
5702 assert(cc==HOST_CCREG);
5703 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5704 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5705 assem_debug("cycle count (adj)\n");
5706 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5707 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5709 assem_debug("branch: internal\n");
5711 assem_debug("branch: external\n");
5712 if(internal&&is_ds[(ba[i]-start)>>2]) {
5713 ds_assemble_entry(i);
5716 add_to_linker((int)out,ba[i],internal);
5721 cop1_usable=prev_cop1_usable;
5722 if(!unconditional) {
5723 if(nottaken1) set_jump_target(nottaken1,(int)out);
5724 set_jump_target(nottaken,(int)out);
5725 assem_debug("2:\n");
5727 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5728 ds_unneeded,ds_unneeded_upper);
5729 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5730 address_generation(i+1,&branch_regs[i],0);
5731 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5732 ds_assemble(i+1,&branch_regs[i]);
5734 cc=get_reg(branch_regs[i].regmap,CCREG);
5735 if(cc==-1&&!likely[i]) {
5736 // Cycle count isn't in a register, temporarily load it then write it out
5737 emit_loadreg(CCREG,HOST_CCREG);
5738 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5741 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5742 emit_storereg(CCREG,HOST_CCREG);
5745 cc=get_reg(i_regmap,CCREG);
5746 assert(cc==HOST_CCREG);
5747 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5750 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5756 void sjump_assemble(int i,struct regstat *i_regs)
5758 signed char *i_regmap=i_regs->regmap;
5761 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5762 assem_debug("smatch=%d\n",match);
5764 int prev_cop1_usable=cop1_usable;
5765 int unconditional=0,nevertaken=0;
5768 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5769 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5770 if(!match) invert=1;
5771 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5772 if(i>(ba[i]-start)>>2) invert=1;
5775 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5776 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5779 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5780 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5783 s1l=get_reg(i_regmap,rs1[i]);
5784 s1h=get_reg(i_regmap,rs1[i]|64);
5788 if(opcode2[i]&1) unconditional=1;
5790 // These are never taken (r0 is never less than zero)
5791 //assert(opcode2[i]!=0);
5792 //assert(opcode2[i]!=2);
5793 //assert(opcode2[i]!=0x10);
5794 //assert(opcode2[i]!=0x12);
5797 only32=(regs[i].was32>>rs1[i])&1;
5801 // Out of order execution (delay slot first)
5803 address_generation(i+1,i_regs,regs[i].regmap_entry);
5804 ds_assemble(i+1,i_regs);
5806 uint64_t bc_unneeded=branch_regs[i].u;
5807 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5808 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5809 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5811 bc_unneeded_upper|=1;
5812 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5813 bc_unneeded,bc_unneeded_upper);
5814 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5815 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5817 int rt,return_address;
5818 rt=get_reg(branch_regs[i].regmap,31);
5819 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]);
5821 // Save the PC even if the branch is not taken
5822 return_address=start+i*4+8;
5823 emit_movimm(return_address,rt); // PC into link register
5825 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5829 cc=get_reg(branch_regs[i].regmap,CCREG);
5830 assert(cc==HOST_CCREG);
5832 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5833 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5834 assem_debug("cycle count (adj)\n");
5836 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5837 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5838 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5839 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5841 assem_debug("branch: internal\n");
5843 assem_debug("branch: external\n");
5844 if(internal&&is_ds[(ba[i]-start)>>2]) {
5845 ds_assemble_entry(i);
5848 add_to_linker((int)out,ba[i],internal);
5851 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5852 if(((u_int)out)&7) emit_addnop(0);
5856 else if(nevertaken) {
5857 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5860 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5864 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5865 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5869 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5876 add_to_linker((int)out,ba[i],internal);
5880 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5887 add_to_linker((int)out,ba[i],internal);
5895 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5902 add_to_linker((int)out,ba[i],internal);
5906 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5913 add_to_linker((int)out,ba[i],internal);
5920 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5921 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5923 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5924 add_to_linker((int)out,ba[i],internal);
5927 add_to_linker((int)out,ba[i],internal*2);
5933 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5934 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5935 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5937 assem_debug("branch: internal\n");
5939 assem_debug("branch: external\n");
5940 if(internal&&is_ds[(ba[i]-start)>>2]) {
5941 ds_assemble_entry(i);
5944 add_to_linker((int)out,ba[i],internal);
5948 set_jump_target(nottaken,(int)out);
5952 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5954 } // (!unconditional)
5958 // In-order execution (branch first)
5962 int rt,return_address;
5963 rt=get_reg(branch_regs[i].regmap,31);
5965 // Save the PC even if the branch is not taken
5966 return_address=start+i*4+8;
5967 emit_movimm(return_address,rt); // PC into link register
5969 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5973 if(!unconditional) {
5974 //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]);
5978 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5984 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5994 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
6000 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
6007 } // if(!unconditional)
6009 uint64_t ds_unneeded=branch_regs[i].u;
6010 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6011 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6012 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6013 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6015 ds_unneeded_upper|=1;
6018 //assem_debug("1:\n");
6019 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6020 ds_unneeded,ds_unneeded_upper);
6022 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6023 address_generation(i+1,&branch_regs[i],0);
6024 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6025 ds_assemble(i+1,&branch_regs[i]);
6026 cc=get_reg(branch_regs[i].regmap,CCREG);
6028 emit_loadreg(CCREG,cc=HOST_CCREG);
6029 // CHECK: Is the following instruction (fall thru) allocated ok?
6031 assert(cc==HOST_CCREG);
6032 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6033 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6034 assem_debug("cycle count (adj)\n");
6035 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6036 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6038 assem_debug("branch: internal\n");
6040 assem_debug("branch: external\n");
6041 if(internal&&is_ds[(ba[i]-start)>>2]) {
6042 ds_assemble_entry(i);
6045 add_to_linker((int)out,ba[i],internal);
6050 cop1_usable=prev_cop1_usable;
6051 if(!unconditional) {
6052 set_jump_target(nottaken,(int)out);
6053 assem_debug("1:\n");
6055 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6056 ds_unneeded,ds_unneeded_upper);
6057 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6058 address_generation(i+1,&branch_regs[i],0);
6059 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6060 ds_assemble(i+1,&branch_regs[i]);
6062 cc=get_reg(branch_regs[i].regmap,CCREG);
6063 if(cc==-1&&!likely[i]) {
6064 // Cycle count isn't in a register, temporarily load it then write it out
6065 emit_loadreg(CCREG,HOST_CCREG);
6066 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6069 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6070 emit_storereg(CCREG,HOST_CCREG);
6073 cc=get_reg(i_regmap,CCREG);
6074 assert(cc==HOST_CCREG);
6075 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6078 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6084 void fjump_assemble(int i,struct regstat *i_regs)
6086 signed char *i_regmap=i_regs->regmap;
6089 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6090 assem_debug("fmatch=%d\n",match);
6094 int internal=internal_branch(branch_regs[i].is32,ba[i]);
6095 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
6096 if(!match) invert=1;
6097 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6098 if(i>(ba[i]-start)>>2) invert=1;
6102 fs=get_reg(branch_regs[i].regmap,FSREG);
6103 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
6106 fs=get_reg(i_regmap,FSREG);
6109 // Check cop1 unusable
6111 cs=get_reg(i_regmap,CSREG);
6113 emit_testimm(cs,0x20000000);
6116 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
6121 // Out of order execution (delay slot first)
6123 ds_assemble(i+1,i_regs);
6125 uint64_t bc_unneeded=branch_regs[i].u;
6126 uint64_t bc_unneeded_upper=branch_regs[i].uu;
6127 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6128 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
6130 bc_unneeded_upper|=1;
6131 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6132 bc_unneeded,bc_unneeded_upper);
6133 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
6134 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6135 cc=get_reg(branch_regs[i].regmap,CCREG);
6136 assert(cc==HOST_CCREG);
6137 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6138 assem_debug("cycle count (adj)\n");
6141 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6144 emit_testimm(fs,0x800000);
6145 if(source[i]&0x10000) // BC1T
6151 add_to_linker((int)out,ba[i],internal);
6160 add_to_linker((int)out,ba[i],internal);
6168 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
6169 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6170 else if(match) emit_addnop(13);
6172 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6173 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6175 assem_debug("branch: internal\n");
6177 assem_debug("branch: external\n");
6178 if(internal&&is_ds[(ba[i]-start)>>2]) {
6179 ds_assemble_entry(i);
6182 add_to_linker((int)out,ba[i],internal);
6185 set_jump_target(nottaken,(int)out);
6189 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
6191 } // (!unconditional)
6195 // In-order execution (branch first)
6199 //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]);
6202 emit_testimm(fs,0x800000);
6203 if(source[i]&0x10000) // BC1T
6214 } // if(!unconditional)
6216 uint64_t ds_unneeded=branch_regs[i].u;
6217 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6218 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6219 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6220 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6222 ds_unneeded_upper|=1;
6224 //assem_debug("1:\n");
6225 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6226 ds_unneeded,ds_unneeded_upper);
6228 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6229 address_generation(i+1,&branch_regs[i],0);
6230 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6231 ds_assemble(i+1,&branch_regs[i]);
6232 cc=get_reg(branch_regs[i].regmap,CCREG);
6234 emit_loadreg(CCREG,cc=HOST_CCREG);
6235 // CHECK: Is the following instruction (fall thru) allocated ok?
6237 assert(cc==HOST_CCREG);
6238 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6239 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6240 assem_debug("cycle count (adj)\n");
6241 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6242 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6244 assem_debug("branch: internal\n");
6246 assem_debug("branch: external\n");
6247 if(internal&&is_ds[(ba[i]-start)>>2]) {
6248 ds_assemble_entry(i);
6251 add_to_linker((int)out,ba[i],internal);
6256 if(1) { // <- FIXME (don't need this)
6257 set_jump_target(nottaken,(int)out);
6258 assem_debug("1:\n");
6260 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6261 ds_unneeded,ds_unneeded_upper);
6262 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6263 address_generation(i+1,&branch_regs[i],0);
6264 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6265 ds_assemble(i+1,&branch_regs[i]);
6267 cc=get_reg(branch_regs[i].regmap,CCREG);
6268 if(cc==-1&&!likely[i]) {
6269 // Cycle count isn't in a register, temporarily load it then write it out
6270 emit_loadreg(CCREG,HOST_CCREG);
6271 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6274 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6275 emit_storereg(CCREG,HOST_CCREG);
6278 cc=get_reg(i_regmap,CCREG);
6279 assert(cc==HOST_CCREG);
6280 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6283 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6289 static void pagespan_assemble(int i,struct regstat *i_regs)
6291 int s1l=get_reg(i_regs->regmap,rs1[i]);
6292 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6293 int s2l=get_reg(i_regs->regmap,rs2[i]);
6294 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6295 void *nt_branch=NULL;
6298 int unconditional=0;
6308 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6312 int addr,alt,ntaddr;
6313 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6317 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6318 (i_regs->regmap[hr]&63)!=rs1[i] &&
6319 (i_regs->regmap[hr]&63)!=rs2[i] )
6328 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6329 (i_regs->regmap[hr]&63)!=rs1[i] &&
6330 (i_regs->regmap[hr]&63)!=rs2[i] )
6336 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6340 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6341 (i_regs->regmap[hr]&63)!=rs1[i] &&
6342 (i_regs->regmap[hr]&63)!=rs2[i] )
6349 assert(hr<HOST_REGS);
6350 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6351 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6353 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6354 if(opcode[i]==2) // J
6358 if(opcode[i]==3) // JAL
6361 int rt=get_reg(i_regs->regmap,31);
6362 emit_movimm(start+i*4+8,rt);
6365 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6368 if(opcode2[i]==9) // JALR
6370 int rt=get_reg(i_regs->regmap,rt1[i]);
6371 emit_movimm(start+i*4+8,rt);
6374 if((opcode[i]&0x3f)==4) // BEQ
6381 #ifdef HAVE_CMOV_IMM
6383 if(s2l>=0) emit_cmp(s1l,s2l);
6384 else emit_test(s1l,s1l);
6385 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6391 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6393 if(s2h>=0) emit_cmp(s1h,s2h);
6394 else emit_test(s1h,s1h);
6395 emit_cmovne_reg(alt,addr);
6397 if(s2l>=0) emit_cmp(s1l,s2l);
6398 else emit_test(s1l,s1l);
6399 emit_cmovne_reg(alt,addr);
6402 if((opcode[i]&0x3f)==5) // BNE
6404 #ifdef HAVE_CMOV_IMM
6406 if(s2l>=0) emit_cmp(s1l,s2l);
6407 else emit_test(s1l,s1l);
6408 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6414 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6416 if(s2h>=0) emit_cmp(s1h,s2h);
6417 else emit_test(s1h,s1h);
6418 emit_cmovne_reg(alt,addr);
6420 if(s2l>=0) emit_cmp(s1l,s2l);
6421 else emit_test(s1l,s1l);
6422 emit_cmovne_reg(alt,addr);
6425 if((opcode[i]&0x3f)==0x14) // BEQL
6428 if(s2h>=0) emit_cmp(s1h,s2h);
6429 else emit_test(s1h,s1h);
6433 if(s2l>=0) emit_cmp(s1l,s2l);
6434 else emit_test(s1l,s1l);
6435 if(nottaken) set_jump_target(nottaken,(int)out);
6439 if((opcode[i]&0x3f)==0x15) // BNEL
6442 if(s2h>=0) emit_cmp(s1h,s2h);
6443 else emit_test(s1h,s1h);
6447 if(s2l>=0) emit_cmp(s1l,s2l);
6448 else emit_test(s1l,s1l);
6451 if(taken) set_jump_target(taken,(int)out);
6453 if((opcode[i]&0x3f)==6) // BLEZ
6455 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6457 if(s1h>=0) emit_mov(addr,ntaddr);
6458 emit_cmovl_reg(alt,addr);
6461 emit_cmovne_reg(ntaddr,addr);
6462 emit_cmovs_reg(alt,addr);
6465 if((opcode[i]&0x3f)==7) // BGTZ
6467 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6469 if(s1h>=0) emit_mov(addr,alt);
6470 emit_cmovl_reg(ntaddr,addr);
6473 emit_cmovne_reg(alt,addr);
6474 emit_cmovs_reg(ntaddr,addr);
6477 if((opcode[i]&0x3f)==0x16) // BLEZL
6479 assert((opcode[i]&0x3f)!=0x16);
6481 if((opcode[i]&0x3f)==0x17) // BGTZL
6483 assert((opcode[i]&0x3f)!=0x17);
6485 assert(opcode[i]!=1); // BLTZ/BGEZ
6487 //FIXME: Check CSREG
6488 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6489 if((source[i]&0x30000)==0) // BC1F
6491 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6492 emit_testimm(s1l,0x800000);
6493 emit_cmovne_reg(alt,addr);
6495 if((source[i]&0x30000)==0x10000) // BC1T
6497 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6498 emit_testimm(s1l,0x800000);
6499 emit_cmovne_reg(alt,addr);
6501 if((source[i]&0x30000)==0x20000) // BC1FL
6503 emit_testimm(s1l,0x800000);
6507 if((source[i]&0x30000)==0x30000) // BC1TL
6509 emit_testimm(s1l,0x800000);
6515 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6516 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6517 if(likely[i]||unconditional)
6519 emit_movimm(ba[i],HOST_BTREG);
6521 else if(addr!=HOST_BTREG)
6523 emit_mov(addr,HOST_BTREG);
6525 void *branch_addr=out;
6527 int target_addr=start+i*4+5;
6529 void *compiled_target_addr=check_addr(target_addr);
6530 emit_extjump_ds((int)branch_addr,target_addr);
6531 if(compiled_target_addr) {
6532 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6533 add_link(target_addr,stub);
6535 else set_jump_target((int)branch_addr,(int)stub);
6538 set_jump_target((int)nottaken,(int)out);
6539 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6540 void *branch_addr=out;
6542 int target_addr=start+i*4+8;
6544 void *compiled_target_addr=check_addr(target_addr);
6545 emit_extjump_ds((int)branch_addr,target_addr);
6546 if(compiled_target_addr) {
6547 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6548 add_link(target_addr,stub);
6550 else set_jump_target((int)branch_addr,(int)stub);
6554 // Assemble the delay slot for the above
6555 static void pagespan_ds()
6557 assem_debug("initial delay slot:\n");
6558 u_int vaddr=start+1;
6559 u_int page=get_page(vaddr);
6560 u_int vpage=get_vpage(vaddr);
6561 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6563 ll_add(jump_in+page,vaddr,(void *)out);
6564 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6565 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6566 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6567 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6568 emit_writeword(HOST_BTREG,(int)&branch_target);
6569 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6570 address_generation(0,®s[0],regs[0].regmap_entry);
6571 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6572 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6577 alu_assemble(0,®s[0]);break;
6579 imm16_assemble(0,®s[0]);break;
6581 shift_assemble(0,®s[0]);break;
6583 shiftimm_assemble(0,®s[0]);break;
6585 load_assemble(0,®s[0]);break;
6587 loadlr_assemble(0,®s[0]);break;
6589 store_assemble(0,®s[0]);break;
6591 storelr_assemble(0,®s[0]);break;
6593 cop0_assemble(0,®s[0]);break;
6595 cop1_assemble(0,®s[0]);break;
6597 c1ls_assemble(0,®s[0]);break;
6599 cop2_assemble(0,®s[0]);break;
6601 c2ls_assemble(0,®s[0]);break;
6603 c2op_assemble(0,®s[0]);break;
6605 fconv_assemble(0,®s[0]);break;
6607 float_assemble(0,®s[0]);break;
6609 fcomp_assemble(0,®s[0]);break;
6611 multdiv_assemble(0,®s[0]);break;
6613 mov_assemble(0,®s[0]);break;
6623 printf("Jump in the delay slot. This is probably a bug.\n");
6625 int btaddr=get_reg(regs[0].regmap,BTREG);
6627 btaddr=get_reg(regs[0].regmap,-1);
6628 emit_readword((int)&branch_target,btaddr);
6630 assert(btaddr!=HOST_CCREG);
6631 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6633 emit_movimm(start+4,HOST_TEMPREG);
6634 emit_cmp(btaddr,HOST_TEMPREG);
6636 emit_cmpimm(btaddr,start+4);
6638 int branch=(int)out;
6640 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6641 emit_jmp(jump_vaddr_reg[btaddr]);
6642 set_jump_target(branch,(int)out);
6643 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6644 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6647 // Basic liveness analysis for MIPS registers
6648 void unneeded_registers(int istart,int iend,int r)
6652 uint64_t temp_u,temp_uu;
6657 u=unneeded_reg[iend+1];
6658 uu=unneeded_reg_upper[iend+1];
6661 for (i=iend;i>=istart;i--)
6663 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6664 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6666 // If subroutine call, flag return address as a possible branch target
6667 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6669 if(ba[i]<start || ba[i]>=(start+slen*4))
6671 // Branch out of this block, flush all regs
6675 if(itype[i]==UJUMP&&rt1[i]==31)
6677 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6679 if(itype[i]==RJUMP&&rs1[i]==31)
6681 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6683 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6684 if(itype[i]==UJUMP&&rt1[i]==31)
6686 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6687 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6689 if(itype[i]==RJUMP&&rs1[i]==31)
6691 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6692 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6695 branch_unneeded_reg[i]=u;
6696 branch_unneeded_reg_upper[i]=uu;
6697 // Merge in delay slot
6698 tdep=(~uu>>rt1[i+1])&1;
6699 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6700 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6701 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6702 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6703 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6705 // If branch is "likely" (and conditional)
6706 // then we skip the delay slot on the fall-thru path
6709 u&=unneeded_reg[i+2];
6710 uu&=unneeded_reg_upper[i+2];
6721 // Internal branch, flag target
6722 bt[(ba[i]-start)>>2]=1;
6723 if(ba[i]<=start+i*4) {
6725 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6727 // Unconditional branch
6730 // Conditional branch (not taken case)
6731 temp_u=unneeded_reg[i+2];
6732 temp_uu=unneeded_reg_upper[i+2];
6734 // Merge in delay slot
6735 tdep=(~temp_uu>>rt1[i+1])&1;
6736 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6737 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6738 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6739 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6740 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6741 temp_u|=1;temp_uu|=1;
6742 // If branch is "likely" (and conditional)
6743 // then we skip the delay slot on the fall-thru path
6746 temp_u&=unneeded_reg[i+2];
6747 temp_uu&=unneeded_reg_upper[i+2];
6755 tdep=(~temp_uu>>rt1[i])&1;
6756 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6757 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6758 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6759 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6760 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6761 temp_u|=1;temp_uu|=1;
6762 unneeded_reg[i]=temp_u;
6763 unneeded_reg_upper[i]=temp_uu;
6764 // Only go three levels deep. This recursion can take an
6765 // excessive amount of time if there are a lot of nested loops.
6767 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6769 unneeded_reg[(ba[i]-start)>>2]=1;
6770 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6773 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6775 // Unconditional branch
6776 u=unneeded_reg[(ba[i]-start)>>2];
6777 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6778 branch_unneeded_reg[i]=u;
6779 branch_unneeded_reg_upper[i]=uu;
6782 //branch_unneeded_reg[i]=u;
6783 //branch_unneeded_reg_upper[i]=uu;
6784 // Merge in delay slot
6785 tdep=(~uu>>rt1[i+1])&1;
6786 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6787 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6788 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6789 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6790 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6793 // Conditional branch
6794 b=unneeded_reg[(ba[i]-start)>>2];
6795 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6796 branch_unneeded_reg[i]=b;
6797 branch_unneeded_reg_upper[i]=bu;
6800 //branch_unneeded_reg[i]=b;
6801 //branch_unneeded_reg_upper[i]=bu;
6802 // Branch delay slot
6803 tdep=(~uu>>rt1[i+1])&1;
6804 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6805 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6806 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6807 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6808 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6810 // If branch is "likely" then we skip the
6811 // delay slot on the fall-thru path
6816 u&=unneeded_reg[i+2];
6817 uu&=unneeded_reg_upper[i+2];
6828 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6829 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6830 //branch_unneeded_reg[i]=1;
6831 //branch_unneeded_reg_upper[i]=1;
6833 branch_unneeded_reg[i]=1;
6834 branch_unneeded_reg_upper[i]=1;
6840 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
6842 // SYSCALL instruction (software interrupt)
6846 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6848 // ERET instruction (return from interrupt)
6853 tdep=(~uu>>rt1[i])&1;
6854 // Written registers are unneeded
6859 // Accessed registers are needed
6864 // Source-target dependencies
6865 uu&=~(tdep<<dep1[i]);
6866 uu&=~(tdep<<dep2[i]);
6867 // R0 is always unneeded
6871 unneeded_reg_upper[i]=uu;
6873 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
6876 for(r=1;r<=CCREG;r++) {
6877 if((unneeded_reg[i]>>r)&1) {
6878 if(r==HIREG) printf(" HI");
6879 else if(r==LOREG) printf(" LO");
6880 else printf(" r%d",r);
6884 for(r=1;r<=CCREG;r++) {
6885 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
6886 if(r==HIREG) printf(" HI");
6887 else if(r==LOREG) printf(" LO");
6888 else printf(" r%d",r);
6894 for (i=iend;i>=istart;i--)
6896 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
6901 // Identify registers which are likely to contain 32-bit values
6902 // This is used to predict whether any branches will jump to a
6903 // location with 64-bit values in registers.
6904 static void provisional_32bit()
6908 uint64_t lastbranch=1;
6913 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
6914 if(i>1) is32=lastbranch;
6920 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
6922 if(i>2) is32=lastbranch;
6926 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
6928 if(rs1[i-2]==0||rs2[i-2]==0)
6931 is32|=1LL<<rs1[i-2];
6934 is32|=1LL<<rs2[i-2];
6939 // If something jumps here with 64-bit values
6940 // then promote those registers to 64 bits
6943 uint64_t temp_is32=is32;
6946 if(ba[j]==start+i*4)
6947 //temp_is32&=branch_regs[j].is32;
6952 if(ba[j]==start+i*4)
6963 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
6964 // Branches don't write registers, consider the delay slot instead.
6975 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
6976 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
6985 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
6986 if(op==0x22) is32|=1LL<<rt; // LWL
6989 if (op==0x08||op==0x09|| // ADDI/ADDIU
6990 op==0x0a||op==0x0b|| // SLTI/SLTIU
6996 if(op==0x18||op==0x19) { // DADDI/DADDIU
6999 // is32|=((is32>>s1)&1LL)<<rt;
7001 if(op==0x0d||op==0x0e) { // ORI/XORI
7002 uint64_t sr=((is32>>s1)&1LL);
7018 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
7021 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
7024 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
7025 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
7029 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
7034 uint64_t sr=((is32>>s1)&1LL);
7039 uint64_t sr=((is32>>s2)&1LL);
7047 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
7052 uint64_t sr=((is32>>s1)&1LL);
7062 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
7063 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
7066 is32|=(1LL<<HIREG)|(1LL<<LOREG);
7071 uint64_t sr=((is32>>s1)&1LL);
7077 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
7078 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
7082 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
7083 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
7086 if(op2==0) is32|=1LL<<rt; // MFC0
7090 if(op2==0) is32|=1LL<<rt; // MFC1
7091 if(op2==1) is32&=~(1LL<<rt); // DMFC1
7092 if(op2==2) is32|=1LL<<rt; // CFC1
7114 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
7116 if(rt1[i-1]==31) // JAL/JALR
7118 // Subroutine call will return here, don't alloc any registers
7123 // Internal branch will jump here, match registers to caller
7131 // Identify registers which may be assumed to contain 32-bit values
7132 // and where optimizations will rely on this.
7133 // This is used to determine whether backward branches can safely
7134 // jump to a location with 64-bit values in registers.
7135 static void provisional_r32()
7140 for (i=slen-1;i>=0;i--)
7143 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7145 if(ba[i]<start || ba[i]>=(start+slen*4))
7147 // Branch out of this block, don't need anything
7153 // Need whatever matches the target
7154 // (and doesn't get overwritten by the delay slot instruction)
7156 int t=(ba[i]-start)>>2;
7157 if(ba[i]>start+i*4) {
7159 //if(!(requires_32bit[t]&~regs[i].was32))
7160 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7161 if(!(pr32[t]&~regs[i].was32))
7162 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7165 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7166 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7169 // Conditional branch may need registers for following instructions
7170 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7173 //r32|=requires_32bit[i+2];
7176 // Mark this address as a branch target since it may be called
7177 // upon return from interrupt
7181 // Merge in delay slot
7183 // These are overwritten unless the branch is "likely"
7184 // and the delay slot is nullified if not taken
7185 r32&=~(1LL<<rt1[i+1]);
7186 r32&=~(1LL<<rt2[i+1]);
7188 // Assume these are needed (delay slot)
7191 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7195 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7197 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7199 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7201 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7203 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7206 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7208 // SYSCALL instruction (software interrupt)
7211 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7213 // ERET instruction (return from interrupt)
7217 r32&=~(1LL<<rt1[i]);
7218 r32&=~(1LL<<rt2[i]);
7221 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7225 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7227 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7229 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7231 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7233 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7235 //requires_32bit[i]=r32;
7238 // Dirty registers which are 32-bit, require 32-bit input
7239 // as they will be written as 32-bit values
7240 for(hr=0;hr<HOST_REGS;hr++)
7242 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7243 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7244 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7245 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7246 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7253 // Write back dirty registers as soon as we will no longer modify them,
7254 // so that we don't end up with lots of writes at the branches.
7255 void clean_registers(int istart,int iend,int wr)
7259 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7260 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7262 will_dirty_i=will_dirty_next=0;
7263 wont_dirty_i=wont_dirty_next=0;
7265 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7266 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7268 for (i=iend;i>=istart;i--)
7270 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7272 if(ba[i]<start || ba[i]>=(start+slen*4))
7274 // Branch out of this block, flush all regs
7275 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7277 // Unconditional branch
7280 // Merge in delay slot (will dirty)
7281 for(r=0;r<HOST_REGS;r++) {
7282 if(r!=EXCLUDE_REG) {
7283 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7284 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7285 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7286 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7287 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7288 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7289 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7290 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7291 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7292 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7293 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7294 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7295 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7296 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7302 // Conditional branch
7304 wont_dirty_i=wont_dirty_next;
7305 // Merge in delay slot (will dirty)
7306 for(r=0;r<HOST_REGS;r++) {
7307 if(r!=EXCLUDE_REG) {
7309 // Might not dirty if likely branch is not taken
7310 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7311 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7312 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7313 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7314 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7315 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7316 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7317 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7318 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7319 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7320 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7321 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7322 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7323 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7328 // Merge in delay slot (wont dirty)
7329 for(r=0;r<HOST_REGS;r++) {
7330 if(r!=EXCLUDE_REG) {
7331 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7332 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7333 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7334 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7335 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7336 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7337 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7338 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7339 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7340 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7344 #ifndef DESTRUCTIVE_WRITEBACK
7345 branch_regs[i].dirty&=wont_dirty_i;
7347 branch_regs[i].dirty|=will_dirty_i;
7353 if(ba[i]<=start+i*4) {
7355 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7357 // Unconditional branch
7360 // Merge in delay slot (will dirty)
7361 for(r=0;r<HOST_REGS;r++) {
7362 if(r!=EXCLUDE_REG) {
7363 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7364 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7365 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7366 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7367 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7368 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7369 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7370 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7371 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7372 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7373 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7374 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7375 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7376 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7380 // Conditional branch (not taken case)
7381 temp_will_dirty=will_dirty_next;
7382 temp_wont_dirty=wont_dirty_next;
7383 // Merge in delay slot (will dirty)
7384 for(r=0;r<HOST_REGS;r++) {
7385 if(r!=EXCLUDE_REG) {
7387 // Will not dirty if likely branch is not taken
7388 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7389 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7390 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7391 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7392 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7393 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7394 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7395 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7396 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7397 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7398 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7399 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7400 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7401 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7406 // Merge in delay slot (wont dirty)
7407 for(r=0;r<HOST_REGS;r++) {
7408 if(r!=EXCLUDE_REG) {
7409 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7410 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7411 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7412 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7413 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7414 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7415 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7416 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7417 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7418 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7421 // Deal with changed mappings
7423 for(r=0;r<HOST_REGS;r++) {
7424 if(r!=EXCLUDE_REG) {
7425 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7426 temp_will_dirty&=~(1<<r);
7427 temp_wont_dirty&=~(1<<r);
7428 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7429 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7430 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7432 temp_will_dirty|=1<<r;
7433 temp_wont_dirty|=1<<r;
7440 will_dirty[i]=temp_will_dirty;
7441 wont_dirty[i]=temp_wont_dirty;
7442 clean_registers((ba[i]-start)>>2,i-1,0);
7444 // Limit recursion. It can take an excessive amount
7445 // of time if there are a lot of nested loops.
7446 will_dirty[(ba[i]-start)>>2]=0;
7447 wont_dirty[(ba[i]-start)>>2]=-1;
7452 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7454 // Unconditional branch
7457 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7458 for(r=0;r<HOST_REGS;r++) {
7459 if(r!=EXCLUDE_REG) {
7460 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7461 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7462 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7464 if(branch_regs[i].regmap[r]>=0) {
7465 will_dirty_i|=((unneeded_reg[(ba[i]-start)>>2]>>(branch_regs[i].regmap[r]&63))&1)<<r;
7466 wont_dirty_i|=((unneeded_reg[(ba[i]-start)>>2]>>(branch_regs[i].regmap[r]&63))&1)<<r;
7471 // Merge in delay slot
7472 for(r=0;r<HOST_REGS;r++) {
7473 if(r!=EXCLUDE_REG) {
7474 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7475 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7476 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7477 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7478 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7479 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7480 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7481 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7482 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7483 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7484 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7485 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7486 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7487 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7491 // Conditional branch
7492 will_dirty_i=will_dirty_next;
7493 wont_dirty_i=wont_dirty_next;
7494 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7495 for(r=0;r<HOST_REGS;r++) {
7496 if(r!=EXCLUDE_REG) {
7497 signed char target_reg=branch_regs[i].regmap[r];
7498 if(target_reg==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7499 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7500 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7502 else if(target_reg>=0) {
7503 will_dirty_i&=((unneeded_reg[(ba[i]-start)>>2]>>(target_reg&63))&1)<<r;
7504 wont_dirty_i|=((unneeded_reg[(ba[i]-start)>>2]>>(target_reg&63))&1)<<r;
7506 // Treat delay slot as part of branch too
7507 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7508 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7509 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7513 will_dirty[i+1]&=~(1<<r);
7518 // Merge in delay slot
7519 for(r=0;r<HOST_REGS;r++) {
7520 if(r!=EXCLUDE_REG) {
7522 // Might not dirty if likely branch is not taken
7523 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7524 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7525 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7526 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7527 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7528 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7529 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7530 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7531 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7532 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7533 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7534 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7535 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7536 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7541 // Merge in delay slot (won't dirty)
7542 for(r=0;r<HOST_REGS;r++) {
7543 if(r!=EXCLUDE_REG) {
7544 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7545 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7546 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7547 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7548 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7549 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7550 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7551 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7552 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7553 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7557 #ifndef DESTRUCTIVE_WRITEBACK
7558 branch_regs[i].dirty&=wont_dirty_i;
7560 branch_regs[i].dirty|=will_dirty_i;
7565 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7567 // SYSCALL instruction (software interrupt)
7571 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7573 // ERET instruction (return from interrupt)
7577 will_dirty_next=will_dirty_i;
7578 wont_dirty_next=wont_dirty_i;
7579 for(r=0;r<HOST_REGS;r++) {
7580 if(r!=EXCLUDE_REG) {
7581 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7582 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7583 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7584 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7585 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7586 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7587 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7588 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7590 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7592 // Don't store a register immediately after writing it,
7593 // may prevent dual-issue.
7594 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7595 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7601 will_dirty[i]=will_dirty_i;
7602 wont_dirty[i]=wont_dirty_i;
7603 // Mark registers that won't be dirtied as not dirty
7605 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7606 for(r=0;r<HOST_REGS;r++) {
7607 if((will_dirty_i>>r)&1) {
7613 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7614 regs[i].dirty|=will_dirty_i;
7615 #ifndef DESTRUCTIVE_WRITEBACK
7616 regs[i].dirty&=wont_dirty_i;
7617 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7619 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7620 for(r=0;r<HOST_REGS;r++) {
7621 if(r!=EXCLUDE_REG) {
7622 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7623 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7624 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7632 for(r=0;r<HOST_REGS;r++) {
7633 if(r!=EXCLUDE_REG) {
7634 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7635 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7636 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7644 // Deal with changed mappings
7645 temp_will_dirty=will_dirty_i;
7646 temp_wont_dirty=wont_dirty_i;
7647 for(r=0;r<HOST_REGS;r++) {
7648 if(r!=EXCLUDE_REG) {
7650 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7652 #ifndef DESTRUCTIVE_WRITEBACK
7653 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7655 regs[i].wasdirty|=will_dirty_i&(1<<r);
7658 else if(regmap_pre[i][r]>=0&&(nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7659 // Register moved to a different register
7660 will_dirty_i&=~(1<<r);
7661 wont_dirty_i&=~(1<<r);
7662 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7663 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7665 #ifndef DESTRUCTIVE_WRITEBACK
7666 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7668 regs[i].wasdirty|=will_dirty_i&(1<<r);
7672 will_dirty_i&=~(1<<r);
7673 wont_dirty_i&=~(1<<r);
7674 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7675 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7676 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7679 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7688 void disassemble_inst(int i)
7690 if (bt[i]) printf("*"); else printf(" ");
7693 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7695 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;
7697 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;
7699 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7701 if (opcode[i]==0x9&&rt1[i]!=31)
7702 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7704 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7707 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7709 if(opcode[i]==0xf) //LUI
7710 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7712 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7716 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7720 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7724 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7727 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7730 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7733 if((opcode2[i]&0x1d)==0x10)
7734 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7735 else if((opcode2[i]&0x1d)==0x11)
7736 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7738 printf (" %x: %s\n",start+i*4,insn[i]);
7742 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7743 else if(opcode2[i]==4)
7744 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7745 else printf (" %x: %s\n",start+i*4,insn[i]);
7749 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7750 else if(opcode2[i]>3)
7751 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7752 else printf (" %x: %s\n",start+i*4,insn[i]);
7756 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7757 else if(opcode2[i]>3)
7758 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7759 else printf (" %x: %s\n",start+i*4,insn[i]);
7762 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7765 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7768 printf (" %x: %s (INTCALL)\n",start+i*4,insn[i]);
7771 //printf (" %s %8x\n",insn[i],source[i]);
7772 printf (" %x: %s\n",start+i*4,insn[i]);
7776 // clear the state completely, instead of just marking
7777 // things invalid like invalidate_all_pages() does
7778 void new_dynarec_clear_full()
7781 out=(u_char *)BASE_ADDR;
7782 memset(invalid_code,1,sizeof(invalid_code));
7783 memset(hash_table,0xff,sizeof(hash_table));
7784 memset(mini_ht,-1,sizeof(mini_ht));
7785 memset(restore_candidate,0,sizeof(restore_candidate));
7786 memset(shadow,0,sizeof(shadow));
7788 expirep=16384; // Expiry pointer, +2 blocks
7789 pending_exception=0;
7797 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7799 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7800 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7801 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7803 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7804 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7805 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7808 void new_dynarec_init()
7810 printf("Init new dynarec\n");
7811 out=(u_char *)BASE_ADDR;
7812 if (mmap (out, 1<<TARGET_SIZE_2,
7813 PROT_READ | PROT_WRITE | PROT_EXEC,
7814 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
7815 -1, 0) <= 0) {printf("mmap() failed\n");}
7817 rdword=&readmem_dword;
7818 fake_pc.f.r.rs=&readmem_dword;
7819 fake_pc.f.r.rt=&readmem_dword;
7820 fake_pc.f.r.rd=&readmem_dword;
7823 new_dynarec_clear_full();
7825 // Copy this into local area so we don't have to put it in every literal pool
7826 invc_ptr=invalid_code;
7829 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
7830 writemem[n] = write_nomem_new;
7831 writememb[n] = write_nomemb_new;
7832 writememh[n] = write_nomemh_new;
7834 writememd[n] = write_nomemd_new;
7836 readmem[n] = read_nomem_new;
7837 readmemb[n] = read_nomemb_new;
7838 readmemh[n] = read_nomemh_new;
7840 readmemd[n] = read_nomemd_new;
7843 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
7844 writemem[n] = write_rdram_new;
7845 writememb[n] = write_rdramb_new;
7846 writememh[n] = write_rdramh_new;
7848 writememd[n] = write_rdramd_new;
7851 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
7852 writemem[n] = write_nomem_new;
7853 writememb[n] = write_nomemb_new;
7854 writememh[n] = write_nomemh_new;
7856 writememd[n] = write_nomemd_new;
7858 readmem[n] = read_nomem_new;
7859 readmemb[n] = read_nomemb_new;
7860 readmemh[n] = read_nomemh_new;
7862 readmemd[n] = read_nomemd_new;
7870 void new_dynarec_cleanup()
7873 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {printf("munmap() failed\n");}
7874 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7875 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7876 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7878 if (munmap (ROM_COPY, 67108864) < 0) {printf("munmap() failed\n");}
7882 int new_recompile_block(int addr)
7885 if(addr==0x800cd050) {
7887 for(block=0x80000;block<0x80800;block++) invalidate_block(block);
7889 for(n=0;n<=2048;n++) ll_clear(jump_dirty+n);
7892 //if(Count==365117028) tracedebug=1;
7893 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7894 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7895 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
7897 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
7898 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
7899 /*if(Count>=312978186) {
7903 start = (u_int)addr&~3;
7904 //assert(((u_int)addr&1)==0);
7906 if(!sp_in_mirror&&(signed int)(psxRegs.GPR.n.sp&0xffe00000)>0x80200000&&
7907 0x10000<=psxRegs.GPR.n.sp&&(psxRegs.GPR.n.sp&~0xe0e00000)<RAM_SIZE) {
7908 printf("SP hack enabled (%08x), @%08x\n", psxRegs.GPR.n.sp, psxRegs.pc);
7911 if (Config.HLE && start == 0x80001000) // hlecall
7913 // XXX: is this enough? Maybe check hleSoftCall?
7914 u_int beginning=(u_int)out;
7915 u_int page=get_page(start);
7916 invalid_code[start>>12]=0;
7917 emit_movimm(start,0);
7918 emit_writeword(0,(int)&pcaddr);
7919 emit_jmp((int)new_dyna_leave);
7921 __clear_cache((void *)beginning,out);
7923 ll_add(jump_in+page,start,(void *)beginning);
7926 else if ((u_int)addr < 0x00200000 ||
7927 (0xa0000000 <= addr && addr < 0xa0200000)) {
7928 // used for BIOS calls mostly?
7929 source = (u_int *)((u_int)rdram+(start&0x1fffff));
7930 pagelimit = (addr&0xa0000000)|0x00200000;
7932 else if (!Config.HLE && (
7933 /* (0x9fc00000 <= addr && addr < 0x9fc80000) ||*/
7934 (0xbfc00000 <= addr && addr < 0xbfc80000))) {
7936 source = (u_int *)((u_int)psxR+(start&0x7ffff));
7937 pagelimit = (addr&0xfff00000)|0x80000;
7942 if ((int)addr >= 0xa4000000 && (int)addr < 0xa4001000) {
7943 source = (u_int *)((u_int)SP_DMEM+start-0xa4000000);
7944 pagelimit = 0xa4001000;
7948 if ((int)addr >= 0x80000000 && (int)addr < 0x80000000+RAM_SIZE) {
7949 source = (u_int *)((u_int)rdram+start-0x80000000);
7950 pagelimit = 0x80000000+RAM_SIZE;
7953 else if ((signed int)addr >= (signed int)0xC0000000) {
7954 //printf("addr=%x mm=%x\n",(u_int)addr,(memory_map[start>>12]<<2));
7955 //if(tlb_LUT_r[start>>12])
7956 //source = (u_int *)(((int)rdram)+(tlb_LUT_r[start>>12]&0xFFFFF000)+(((int)addr)&0xFFF)-0x80000000);
7957 if((signed int)memory_map[start>>12]>=0) {
7958 source = (u_int *)((u_int)(start+(memory_map[start>>12]<<2)));
7959 pagelimit=(start+4096)&0xFFFFF000;
7960 int map=memory_map[start>>12];
7963 //printf("start: %x next: %x\n",map,memory_map[pagelimit>>12]);
7964 if((map&0xBFFFFFFF)==(memory_map[pagelimit>>12]&0xBFFFFFFF)) pagelimit+=4096;
7966 assem_debug("pagelimit=%x\n",pagelimit);
7967 assem_debug("mapping=%x (%x)\n",memory_map[start>>12],(memory_map[start>>12]<<2)+start);
7970 assem_debug("Compile at unmapped memory address: %x \n", (int)addr);
7971 //assem_debug("start: %x next: %x\n",memory_map[start>>12],memory_map[(start+4096)>>12]);
7972 return -1; // Caller will invoke exception handler
7974 //printf("source= %x\n",(int)source);
7978 printf("Compile at bogus memory address: %x \n", (int)addr);
7982 /* Pass 1: disassemble */
7983 /* Pass 2: register dependencies, branch targets */
7984 /* Pass 3: register allocation */
7985 /* Pass 4: branch dependencies */
7986 /* Pass 5: pre-alloc */
7987 /* Pass 6: optimize clean/dirty state */
7988 /* Pass 7: flag 32-bit registers */
7989 /* Pass 8: assembly */
7990 /* Pass 9: linker */
7991 /* Pass 10: garbage collection / free memory */
7995 unsigned int type,op,op2;
7997 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
7999 /* Pass 1 disassembly */
8001 for(i=0;!done;i++) {
8002 bt[i]=0;likely[i]=0;ooo[i]=0;op2=0;
8003 minimum_free_regs[i]=0;
8004 opcode[i]=op=source[i]>>26;
8007 case 0x00: strcpy(insn[i],"special"); type=NI;
8011 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
8012 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
8013 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
8014 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
8015 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
8016 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
8017 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
8018 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
8019 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
8020 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
8021 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
8022 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
8023 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
8024 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
8025 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
8026 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
8027 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
8028 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
8029 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
8030 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
8031 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
8032 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
8033 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
8034 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
8035 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
8036 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
8037 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
8038 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
8039 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
8040 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
8041 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
8042 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
8043 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
8044 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
8045 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
8047 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
8048 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
8049 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
8050 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
8051 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
8052 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
8053 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
8054 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
8055 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
8056 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
8057 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
8058 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
8059 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
8060 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
8061 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
8062 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
8063 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
8067 case 0x01: strcpy(insn[i],"regimm"); type=NI;
8068 op2=(source[i]>>16)&0x1f;
8071 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
8072 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
8073 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
8074 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
8075 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
8076 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
8077 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
8078 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
8079 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
8080 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
8081 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
8082 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
8083 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
8084 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
8087 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
8088 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
8089 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
8090 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
8091 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
8092 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
8093 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
8094 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
8095 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
8096 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
8097 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
8098 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
8099 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
8100 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
8101 case 0x10: strcpy(insn[i],"cop0"); type=NI;
8102 op2=(source[i]>>21)&0x1f;
8105 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
8106 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
8107 case 0x10: strcpy(insn[i],"tlb"); type=NI;
8108 switch(source[i]&0x3f)
8110 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
8111 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
8112 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
8113 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
8115 case 0x10: strcpy(insn[i],"RFE"); type=COP0; break;
8117 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
8122 case 0x11: strcpy(insn[i],"cop1"); type=NI;
8123 op2=(source[i]>>21)&0x1f;
8126 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
8127 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
8128 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
8129 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
8130 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
8131 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
8132 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
8133 switch((source[i]>>16)&0x3)
8135 case 0x00: strcpy(insn[i],"BC1F"); break;
8136 case 0x01: strcpy(insn[i],"BC1T"); break;
8137 case 0x02: strcpy(insn[i],"BC1FL"); break;
8138 case 0x03: strcpy(insn[i],"BC1TL"); break;
8141 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
8142 switch(source[i]&0x3f)
8144 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
8145 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
8146 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
8147 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
8148 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
8149 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
8150 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
8151 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
8152 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
8153 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
8154 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
8155 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
8156 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
8157 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
8158 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
8159 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
8160 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
8161 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
8162 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
8163 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
8164 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
8165 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
8166 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
8167 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
8168 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
8169 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
8170 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
8171 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
8172 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
8173 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
8174 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
8175 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
8176 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
8177 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
8178 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
8181 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8182 switch(source[i]&0x3f)
8184 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8185 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8186 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8187 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8188 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8189 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8190 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8191 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8192 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8193 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8194 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8195 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8196 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8197 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8198 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8199 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8200 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8201 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8202 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8203 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8204 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8205 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8206 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8207 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8208 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8209 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8210 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8211 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8212 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8213 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8214 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8215 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8216 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8217 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8218 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8221 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8222 switch(source[i]&0x3f)
8224 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8225 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8228 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8229 switch(source[i]&0x3f)
8231 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8232 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8238 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8239 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8240 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8241 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8242 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8243 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8244 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8245 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8247 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8248 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8249 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8250 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8251 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8252 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8253 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8254 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8255 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8256 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8257 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8258 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8260 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8261 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8263 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8264 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8265 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8266 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8268 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8269 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8270 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8272 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8273 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8275 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8276 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8277 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8280 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8281 // note: COP MIPS-1 encoding differs from MIPS32
8282 op2=(source[i]>>21)&0x1f;
8283 if (source[i]&0x3f) {
8284 if (gte_handlers[source[i]&0x3f]!=NULL) {
8285 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8291 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8292 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8293 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8294 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8297 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8298 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8299 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8301 default: strcpy(insn[i],"???"); type=NI;
8302 printf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8307 /* Get registers/immediates */
8315 rs1[i]=(source[i]>>21)&0x1f;
8317 rt1[i]=(source[i]>>16)&0x1f;
8319 imm[i]=(short)source[i];
8323 rs1[i]=(source[i]>>21)&0x1f;
8324 rs2[i]=(source[i]>>16)&0x1f;
8327 imm[i]=(short)source[i];
8328 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8331 // LWL/LWR only load part of the register,
8332 // therefore the target register must be treated as a source too
8333 rs1[i]=(source[i]>>21)&0x1f;
8334 rs2[i]=(source[i]>>16)&0x1f;
8335 rt1[i]=(source[i]>>16)&0x1f;
8337 imm[i]=(short)source[i];
8338 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8339 if(op==0x26) dep1[i]=rt1[i]; // LWR
8342 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8343 else rs1[i]=(source[i]>>21)&0x1f;
8345 rt1[i]=(source[i]>>16)&0x1f;
8347 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8348 imm[i]=(unsigned short)source[i];
8350 imm[i]=(short)source[i];
8352 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8353 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8354 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8361 // The JAL instruction writes to r31.
8368 rs1[i]=(source[i]>>21)&0x1f;
8372 // The JALR instruction writes to rd.
8374 rt1[i]=(source[i]>>11)&0x1f;
8379 rs1[i]=(source[i]>>21)&0x1f;
8380 rs2[i]=(source[i]>>16)&0x1f;
8383 if(op&2) { // BGTZ/BLEZ
8391 rs1[i]=(source[i]>>21)&0x1f;
8396 if(op2&0x10) { // BxxAL
8398 // NOTE: If the branch is not taken, r31 is still overwritten
8400 likely[i]=(op2&2)>>1;
8407 likely[i]=((source[i])>>17)&1;
8410 rs1[i]=(source[i]>>21)&0x1f; // source
8411 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8412 rt1[i]=(source[i]>>11)&0x1f; // destination
8414 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8415 us1[i]=rs1[i];us2[i]=rs2[i];
8417 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8418 dep1[i]=rs1[i];dep2[i]=rs2[i];
8420 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8421 dep1[i]=rs1[i];dep2[i]=rs2[i];
8425 rs1[i]=(source[i]>>21)&0x1f; // source
8426 rs2[i]=(source[i]>>16)&0x1f; // divisor
8429 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8430 us1[i]=rs1[i];us2[i]=rs2[i];
8438 if(op2==0x10) rs1[i]=HIREG; // MFHI
8439 if(op2==0x11) rt1[i]=HIREG; // MTHI
8440 if(op2==0x12) rs1[i]=LOREG; // MFLO
8441 if(op2==0x13) rt1[i]=LOREG; // MTLO
8442 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8443 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8447 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8448 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8449 rt1[i]=(source[i]>>11)&0x1f; // destination
8451 // DSLLV/DSRLV/DSRAV are 64-bit
8452 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8455 rs1[i]=(source[i]>>16)&0x1f;
8457 rt1[i]=(source[i]>>11)&0x1f;
8459 imm[i]=(source[i]>>6)&0x1f;
8460 // DSxx32 instructions
8461 if(op2>=0x3c) imm[i]|=0x20;
8462 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8463 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8470 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8471 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8472 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8473 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8481 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8482 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8483 if(op2==5) us1[i]=rs1[i]; // DMTC1
8487 rs1[i]=(source[i]>>21)&0x1F;
8491 imm[i]=(short)source[i];
8494 rs1[i]=(source[i]>>21)&0x1F;
8498 imm[i]=(short)source[i];
8527 /* Calculate branch target addresses */
8529 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8530 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8531 ba[i]=start+i*4+8; // Ignore never taken branch
8532 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8533 ba[i]=start+i*4+8; // Ignore never taken branch
8534 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8535 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8538 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
8540 // branch in delay slot?
8541 if(type==RJUMP||type==UJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
8542 // don't handle first branch and call interpreter if it's hit
8543 printf("branch in delay slot @%08x (%08x)\n", addr + i*4, addr);
8546 // basic load delay detection
8547 else if((type==LOAD||type==LOADLR||type==COP0||type==COP2||type==C2LS)&&rt1[i]!=0) {
8548 int t=(ba[i-1]-start)/4;
8549 if(0 <= t && t < i &&(rt1[i]==rs1[t]||rt1[i]==rs2[t])&&itype[t]!=CJUMP&&itype[t]!=SJUMP) {
8550 // jump target wants DS result - potential load delay effect
8551 printf("load delay @%08x (%08x)\n", addr + i*4, addr);
8553 bt[t+1]=1; // expected return from interpreter
8555 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&&
8556 !(i>=3&&(itype[i-3]==RJUMP||itype[i-3]==UJUMP||itype[i-3]==CJUMP||itype[i-3]==SJUMP))) {
8557 // v0 overwrite like this is a sign of trouble, bail out
8558 printf("v0 overwrite @%08x (%08x)\n", addr + i*4, addr);
8564 rs2[i-1]=rt1[i-1]=rt2[i-1]=0;
8568 i--; // don't compile the DS
8572 /* Is this the end of the block? */
8573 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8574 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8578 if(stop_after_jal) done=1;
8580 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8582 // Don't recompile stuff that's already compiled
8583 if(check_addr(start+i*4+4)) done=1;
8584 // Don't get too close to the limit
8585 if(i>MAXBLOCK/2) done=1;
8587 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8588 if(itype[i]==HLECALL||itype[i]==INTCALL) done=2;
8590 // Does the block continue due to a branch?
8593 if(ba[j]==start+i*4) done=j=0; // Branch into delay slot
8594 if(ba[j]==start+i*4+4) done=j=0;
8595 if(ba[j]==start+i*4+8) done=j=0;
8598 //assert(i<MAXBLOCK-1);
8599 if(start+i*4==pagelimit-4) done=1;
8600 assert(start+i*4<pagelimit);
8601 if (i==MAXBLOCK-1) done=1;
8602 // Stop if we're compiling junk
8603 if(itype[i]==NI&&opcode[i]==0x11) {
8604 done=stop_after_jal=1;
8605 printf("Disabled speculative precompilation\n");
8609 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8610 if(start+i*4==pagelimit) {
8616 /* Pass 2 - Register dependencies and branch targets */
8618 unneeded_registers(0,slen-1,0);
8620 /* Pass 3 - Register allocation */
8622 struct regstat current; // Current register allocations/status
8625 current.u=unneeded_reg[0];
8626 current.uu=unneeded_reg_upper[0];
8627 clear_all_regs(current.regmap);
8628 alloc_reg(¤t,0,CCREG);
8629 dirty_reg(¤t,CCREG);
8637 provisional_32bit();
8640 // First instruction is delay slot
8645 unneeded_reg_upper[0]=1;
8646 current.regmap[HOST_BTREG]=BTREG;
8654 for(hr=0;hr<HOST_REGS;hr++)
8656 // Is this really necessary?
8657 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8663 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8665 if(rs1[i-2]==0||rs2[i-2]==0)
8668 current.is32|=1LL<<rs1[i-2];
8669 int hr=get_reg(current.regmap,rs1[i-2]|64);
8670 if(hr>=0) current.regmap[hr]=-1;
8673 current.is32|=1LL<<rs2[i-2];
8674 int hr=get_reg(current.regmap,rs2[i-2]|64);
8675 if(hr>=0) current.regmap[hr]=-1;
8681 // If something jumps here with 64-bit values
8682 // then promote those registers to 64 bits
8685 uint64_t temp_is32=current.is32;
8688 if(ba[j]==start+i*4)
8689 temp_is32&=branch_regs[j].is32;
8693 if(ba[j]==start+i*4)
8697 if(temp_is32!=current.is32) {
8698 //printf("dumping 32-bit regs (%x)\n",start+i*4);
8699 #ifndef DESTRUCTIVE_WRITEBACK
8702 for(hr=0;hr<HOST_REGS;hr++)
8704 int r=current.regmap[hr];
8707 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
8709 //printf("restore %d\n",r);
8713 current.is32=temp_is32;
8720 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
8721 regs[i].wasconst=current.isconst;
8722 regs[i].was32=current.is32;
8723 regs[i].wasdirty=current.dirty;
8724 #if defined(DESTRUCTIVE_WRITEBACK) && !defined(FORCE32)
8725 // To change a dirty register from 32 to 64 bits, we must write
8726 // it out during the previous cycle (for branches, 2 cycles)
8727 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)
8729 uint64_t temp_is32=current.is32;
8732 if(ba[j]==start+i*4+4)
8733 temp_is32&=branch_regs[j].is32;
8737 if(ba[j]==start+i*4+4)
8741 if(temp_is32!=current.is32) {
8742 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8743 for(hr=0;hr<HOST_REGS;hr++)
8745 int r=current.regmap[hr];
8748 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8749 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
8751 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
8753 //printf("dump %d/r%d\n",hr,r);
8754 current.regmap[hr]=-1;
8755 if(get_reg(current.regmap,r|64)>=0)
8756 current.regmap[get_reg(current.regmap,r|64)]=-1;
8764 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
8766 uint64_t temp_is32=current.is32;
8769 if(ba[j]==start+i*4+8)
8770 temp_is32&=branch_regs[j].is32;
8774 if(ba[j]==start+i*4+8)
8778 if(temp_is32!=current.is32) {
8779 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8780 for(hr=0;hr<HOST_REGS;hr++)
8782 int r=current.regmap[hr];
8785 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8786 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
8788 //printf("dump %d/r%d\n",hr,r);
8789 current.regmap[hr]=-1;
8790 if(get_reg(current.regmap,r|64)>=0)
8791 current.regmap[get_reg(current.regmap,r|64)]=-1;
8799 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8801 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
8802 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
8803 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8812 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
8813 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8814 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8815 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8816 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8819 } else { printf("oops, branch at end of block with no delay slot\n");exit(1); }
8823 ds=0; // Skip delay slot, already allocated as part of branch
8824 // ...but we need to alloc it in case something jumps here
8826 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
8827 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
8829 current.u=branch_unneeded_reg[i-1];
8830 current.uu=branch_unneeded_reg_upper[i-1];
8832 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8833 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8834 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8837 struct regstat temp;
8838 memcpy(&temp,¤t,sizeof(current));
8839 temp.wasdirty=temp.dirty;
8840 temp.was32=temp.is32;
8841 // TODO: Take into account unconditional branches, as below
8842 delayslot_alloc(&temp,i);
8843 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
8844 regs[i].wasdirty=temp.wasdirty;
8845 regs[i].was32=temp.was32;
8846 regs[i].dirty=temp.dirty;
8847 regs[i].is32=temp.is32;
8851 // Create entry (branch target) regmap
8852 for(hr=0;hr<HOST_REGS;hr++)
8854 int r=temp.regmap[hr];
8856 if(r!=regmap_pre[i][hr]) {
8857 regs[i].regmap_entry[hr]=-1;
8862 if((current.u>>r)&1) {
8863 regs[i].regmap_entry[hr]=-1;
8864 regs[i].regmap[hr]=-1;
8865 //Don't clear regs in the delay slot as the branch might need them
8866 //current.regmap[hr]=-1;
8868 regs[i].regmap_entry[hr]=r;
8871 if((current.uu>>(r&63))&1) {
8872 regs[i].regmap_entry[hr]=-1;
8873 regs[i].regmap[hr]=-1;
8874 //Don't clear regs in the delay slot as the branch might need them
8875 //current.regmap[hr]=-1;
8877 regs[i].regmap_entry[hr]=r;
8881 // First instruction expects CCREG to be allocated
8882 if(i==0&&hr==HOST_CCREG)
8883 regs[i].regmap_entry[hr]=CCREG;
8885 regs[i].regmap_entry[hr]=-1;
8889 else { // Not delay slot
8892 //current.isconst=0; // DEBUG
8893 //current.wasconst=0; // DEBUG
8894 //regs[i].wasconst=0; // DEBUG
8895 clear_const(¤t,rt1[i]);
8896 alloc_cc(¤t,i);
8897 dirty_reg(¤t,CCREG);
8899 delayslot_alloc(¤t,i+1);
8901 alloc_reg(¤t,i,31);
8902 dirty_reg(¤t,31);
8903 //assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8904 //assert(rt1[i+1]!=rt1[i]);
8906 alloc_reg(¤t,i,PTEMP);
8908 //current.is32|=1LL<<rt1[i];
8910 //current.isconst=0; // DEBUG
8912 //printf("i=%d, isconst=%x\n",i,current.isconst);
8915 //current.isconst=0;
8916 //current.wasconst=0;
8917 //regs[i].wasconst=0;
8918 clear_const(¤t,rs1[i]);
8919 clear_const(¤t,rt1[i]);
8920 alloc_cc(¤t,i);
8921 dirty_reg(¤t,CCREG);
8922 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
8923 alloc_reg(¤t,i,rs1[i]);
8925 alloc_reg(¤t,i,rt1[i]);
8926 dirty_reg(¤t,rt1[i]);
8927 assert(rs1[i+1]!=rt1[i]&&rs2[i+1]!=rt1[i]);
8928 assert(rt1[i+1]!=rt1[i]);
8930 alloc_reg(¤t,i,PTEMP);
8934 if(rs1[i]==31) { // JALR
8935 alloc_reg(¤t,i,RHASH);
8936 #ifndef HOST_IMM_ADDR32
8937 alloc_reg(¤t,i,RHTBL);
8941 delayslot_alloc(¤t,i+1);
8943 // The delay slot overwrites our source register,
8944 // allocate a temporary register to hold the old value.
8948 delayslot_alloc(¤t,i+1);
8950 alloc_reg(¤t,i,RTEMP);
8952 //current.isconst=0; // DEBUG
8957 //current.isconst=0;
8958 //current.wasconst=0;
8959 //regs[i].wasconst=0;
8960 clear_const(¤t,rs1[i]);
8961 clear_const(¤t,rs2[i]);
8962 if((opcode[i]&0x3E)==4) // BEQ/BNE
8964 alloc_cc(¤t,i);
8965 dirty_reg(¤t,CCREG);
8966 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8967 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8968 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8970 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8971 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8973 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
8974 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
8975 // The delay slot overwrites one of our conditions.
8976 // Allocate the branch condition registers instead.
8980 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8981 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8982 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8984 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8985 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8991 delayslot_alloc(¤t,i+1);
8995 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
8997 alloc_cc(¤t,i);
8998 dirty_reg(¤t,CCREG);
8999 alloc_reg(¤t,i,rs1[i]);
9000 if(!(current.is32>>rs1[i]&1))
9002 alloc_reg64(¤t,i,rs1[i]);
9004 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
9005 // The delay slot overwrites one of our conditions.
9006 // Allocate the branch condition registers instead.
9010 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9011 if(!((current.is32>>rs1[i])&1))
9013 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9019 delayslot_alloc(¤t,i+1);
9023 // Don't alloc the delay slot yet because we might not execute it
9024 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
9029 alloc_cc(¤t,i);
9030 dirty_reg(¤t,CCREG);
9031 alloc_reg(¤t,i,rs1[i]);
9032 alloc_reg(¤t,i,rs2[i]);
9033 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
9035 alloc_reg64(¤t,i,rs1[i]);
9036 alloc_reg64(¤t,i,rs2[i]);
9040 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
9045 alloc_cc(¤t,i);
9046 dirty_reg(¤t,CCREG);
9047 alloc_reg(¤t,i,rs1[i]);
9048 if(!(current.is32>>rs1[i]&1))
9050 alloc_reg64(¤t,i,rs1[i]);
9054 //current.isconst=0;
9057 //current.isconst=0;
9058 //current.wasconst=0;
9059 //regs[i].wasconst=0;
9060 clear_const(¤t,rs1[i]);
9061 clear_const(¤t,rt1[i]);
9062 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
9063 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
9065 alloc_cc(¤t,i);
9066 dirty_reg(¤t,CCREG);
9067 alloc_reg(¤t,i,rs1[i]);
9068 if(!(current.is32>>rs1[i]&1))
9070 alloc_reg64(¤t,i,rs1[i]);
9072 if (rt1[i]==31) { // BLTZAL/BGEZAL
9073 alloc_reg(¤t,i,31);
9074 dirty_reg(¤t,31);
9075 //#ifdef REG_PREFETCH
9076 //alloc_reg(¤t,i,PTEMP);
9078 //current.is32|=1LL<<rt1[i];
9080 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) // The delay slot overwrites the branch condition.
9081 ||(rt1[i]==31&&(rs1[i+1]==31||rs2[i+1]==31||rt1[i+1]==31||rt2[i+1]==31))) { // DS touches $ra
9082 // Allocate the branch condition registers instead.
9086 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9087 if(!((current.is32>>rs1[i])&1))
9089 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9095 delayslot_alloc(¤t,i+1);
9099 // Don't alloc the delay slot yet because we might not execute it
9100 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
9105 alloc_cc(¤t,i);
9106 dirty_reg(¤t,CCREG);
9107 alloc_reg(¤t,i,rs1[i]);
9108 if(!(current.is32>>rs1[i]&1))
9110 alloc_reg64(¤t,i,rs1[i]);
9114 //current.isconst=0;
9120 if(likely[i]==0) // BC1F/BC1T
9122 // TODO: Theoretically we can run out of registers here on x86.
9123 // The delay slot can allocate up to six, and we need to check
9124 // CSREG before executing the delay slot. Possibly we can drop
9125 // the cycle count and then reload it after checking that the
9126 // FPU is in a usable state, or don't do out-of-order execution.
9127 alloc_cc(¤t,i);
9128 dirty_reg(¤t,CCREG);
9129 alloc_reg(¤t,i,FSREG);
9130 alloc_reg(¤t,i,CSREG);
9131 if(itype[i+1]==FCOMP) {
9132 // The delay slot overwrites the branch condition.
9133 // Allocate the branch condition registers instead.
9134 alloc_cc(¤t,i);
9135 dirty_reg(¤t,CCREG);
9136 alloc_reg(¤t,i,CSREG);
9137 alloc_reg(¤t,i,FSREG);
9141 delayslot_alloc(¤t,i+1);
9142 alloc_reg(¤t,i+1,CSREG);
9146 // Don't alloc the delay slot yet because we might not execute it
9147 if(likely[i]) // BC1FL/BC1TL
9149 alloc_cc(¤t,i);
9150 dirty_reg(¤t,CCREG);
9151 alloc_reg(¤t,i,CSREG);
9152 alloc_reg(¤t,i,FSREG);
9158 imm16_alloc(¤t,i);
9162 load_alloc(¤t,i);
9166 store_alloc(¤t,i);
9169 alu_alloc(¤t,i);
9172 shift_alloc(¤t,i);
9175 multdiv_alloc(¤t,i);
9178 shiftimm_alloc(¤t,i);
9181 mov_alloc(¤t,i);
9184 cop0_alloc(¤t,i);
9188 cop1_alloc(¤t,i);
9191 c1ls_alloc(¤t,i);
9194 c2ls_alloc(¤t,i);
9197 c2op_alloc(¤t,i);
9200 fconv_alloc(¤t,i);
9203 float_alloc(¤t,i);
9206 fcomp_alloc(¤t,i);
9211 syscall_alloc(¤t,i);
9214 pagespan_alloc(¤t,i);
9218 // Drop the upper half of registers that have become 32-bit
9219 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
9220 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9221 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9222 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9225 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
9226 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9227 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9228 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9232 // Create entry (branch target) regmap
9233 for(hr=0;hr<HOST_REGS;hr++)
9236 r=current.regmap[hr];
9238 if(r!=regmap_pre[i][hr]) {
9239 // TODO: delay slot (?)
9240 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9241 if(or<0||(r&63)>=TEMPREG){
9242 regs[i].regmap_entry[hr]=-1;
9246 // Just move it to a different register
9247 regs[i].regmap_entry[hr]=r;
9248 // If it was dirty before, it's still dirty
9249 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9256 regs[i].regmap_entry[hr]=0;
9260 if((current.u>>r)&1) {
9261 regs[i].regmap_entry[hr]=-1;
9262 //regs[i].regmap[hr]=-1;
9263 current.regmap[hr]=-1;
9265 regs[i].regmap_entry[hr]=r;
9268 if((current.uu>>(r&63))&1) {
9269 regs[i].regmap_entry[hr]=-1;
9270 //regs[i].regmap[hr]=-1;
9271 current.regmap[hr]=-1;
9273 regs[i].regmap_entry[hr]=r;
9277 // Branches expect CCREG to be allocated at the target
9278 if(regmap_pre[i][hr]==CCREG)
9279 regs[i].regmap_entry[hr]=CCREG;
9281 regs[i].regmap_entry[hr]=-1;
9284 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9286 /* Branch post-alloc */
9289 current.was32=current.is32;
9290 current.wasdirty=current.dirty;
9291 switch(itype[i-1]) {
9293 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9294 branch_regs[i-1].isconst=0;
9295 branch_regs[i-1].wasconst=0;
9296 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9297 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9298 alloc_cc(&branch_regs[i-1],i-1);
9299 dirty_reg(&branch_regs[i-1],CCREG);
9300 if(rt1[i-1]==31) { // JAL
9301 alloc_reg(&branch_regs[i-1],i-1,31);
9302 dirty_reg(&branch_regs[i-1],31);
9303 branch_regs[i-1].is32|=1LL<<31;
9305 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9306 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9309 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9310 branch_regs[i-1].isconst=0;
9311 branch_regs[i-1].wasconst=0;
9312 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9313 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9314 alloc_cc(&branch_regs[i-1],i-1);
9315 dirty_reg(&branch_regs[i-1],CCREG);
9316 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9317 if(rt1[i-1]!=0) { // JALR
9318 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9319 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9320 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9323 if(rs1[i-1]==31) { // JALR
9324 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9325 #ifndef HOST_IMM_ADDR32
9326 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9330 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9331 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9334 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9336 alloc_cc(¤t,i-1);
9337 dirty_reg(¤t,CCREG);
9338 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9339 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9340 // The delay slot overwrote one of our conditions
9341 // Delay slot goes after the test (in order)
9342 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9343 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9344 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9347 delayslot_alloc(¤t,i);
9352 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9353 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9354 // Alloc the branch condition registers
9355 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9356 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9357 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9359 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9360 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9363 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9364 branch_regs[i-1].isconst=0;
9365 branch_regs[i-1].wasconst=0;
9366 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9367 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9370 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9372 alloc_cc(¤t,i-1);
9373 dirty_reg(¤t,CCREG);
9374 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9375 // The delay slot overwrote the branch condition
9376 // Delay slot goes after the test (in order)
9377 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9378 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9379 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9382 delayslot_alloc(¤t,i);
9387 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9388 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9389 // Alloc the branch condition register
9390 alloc_reg(¤t,i-1,rs1[i-1]);
9391 if(!(current.is32>>rs1[i-1]&1))
9393 alloc_reg64(¤t,i-1,rs1[i-1]);
9396 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9397 branch_regs[i-1].isconst=0;
9398 branch_regs[i-1].wasconst=0;
9399 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9400 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9403 // Alloc the delay slot in case the branch is taken
9404 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9406 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9407 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9408 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9409 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9410 alloc_cc(&branch_regs[i-1],i);
9411 dirty_reg(&branch_regs[i-1],CCREG);
9412 delayslot_alloc(&branch_regs[i-1],i);
9413 branch_regs[i-1].isconst=0;
9414 alloc_reg(¤t,i,CCREG); // Not taken path
9415 dirty_reg(¤t,CCREG);
9416 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9419 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9421 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9422 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9423 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9424 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9425 alloc_cc(&branch_regs[i-1],i);
9426 dirty_reg(&branch_regs[i-1],CCREG);
9427 delayslot_alloc(&branch_regs[i-1],i);
9428 branch_regs[i-1].isconst=0;
9429 alloc_reg(¤t,i,CCREG); // Not taken path
9430 dirty_reg(¤t,CCREG);
9431 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9435 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9436 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9438 alloc_cc(¤t,i-1);
9439 dirty_reg(¤t,CCREG);
9440 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9441 // The delay slot overwrote the branch condition
9442 // Delay slot goes after the test (in order)
9443 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9444 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9445 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9448 delayslot_alloc(¤t,i);
9453 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9454 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9455 // Alloc the branch condition register
9456 alloc_reg(¤t,i-1,rs1[i-1]);
9457 if(!(current.is32>>rs1[i-1]&1))
9459 alloc_reg64(¤t,i-1,rs1[i-1]);
9462 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9463 branch_regs[i-1].isconst=0;
9464 branch_regs[i-1].wasconst=0;
9465 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9466 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9469 // Alloc the delay slot in case the branch is taken
9470 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9472 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9473 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9474 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9475 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9476 alloc_cc(&branch_regs[i-1],i);
9477 dirty_reg(&branch_regs[i-1],CCREG);
9478 delayslot_alloc(&branch_regs[i-1],i);
9479 branch_regs[i-1].isconst=0;
9480 alloc_reg(¤t,i,CCREG); // Not taken path
9481 dirty_reg(¤t,CCREG);
9482 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9484 // FIXME: BLTZAL/BGEZAL
9485 if(opcode2[i-1]&0x10) { // BxxZAL
9486 alloc_reg(&branch_regs[i-1],i-1,31);
9487 dirty_reg(&branch_regs[i-1],31);
9488 branch_regs[i-1].is32|=1LL<<31;
9492 if(likely[i-1]==0) // BC1F/BC1T
9494 alloc_cc(¤t,i-1);
9495 dirty_reg(¤t,CCREG);
9496 if(itype[i]==FCOMP) {
9497 // The delay slot overwrote the branch condition
9498 // Delay slot goes after the test (in order)
9499 delayslot_alloc(¤t,i);
9504 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9505 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9506 // Alloc the branch condition register
9507 alloc_reg(¤t,i-1,FSREG);
9509 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9510 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9514 // Alloc the delay slot in case the branch is taken
9515 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9516 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9517 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9518 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9519 alloc_cc(&branch_regs[i-1],i);
9520 dirty_reg(&branch_regs[i-1],CCREG);
9521 delayslot_alloc(&branch_regs[i-1],i);
9522 branch_regs[i-1].isconst=0;
9523 alloc_reg(¤t,i,CCREG); // Not taken path
9524 dirty_reg(¤t,CCREG);
9525 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9530 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9532 if(rt1[i-1]==31) // JAL/JALR
9534 // Subroutine call will return here, don't alloc any registers
9537 clear_all_regs(current.regmap);
9538 alloc_reg(¤t,i,CCREG);
9539 dirty_reg(¤t,CCREG);
9543 // Internal branch will jump here, match registers to caller
9544 current.is32=0x3FFFFFFFFLL;
9546 clear_all_regs(current.regmap);
9547 alloc_reg(¤t,i,CCREG);
9548 dirty_reg(¤t,CCREG);
9551 if(ba[j]==start+i*4+4) {
9552 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9553 current.is32=branch_regs[j].is32;
9554 current.dirty=branch_regs[j].dirty;
9559 if(ba[j]==start+i*4+4) {
9560 for(hr=0;hr<HOST_REGS;hr++) {
9561 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9562 current.regmap[hr]=-1;
9564 current.is32&=branch_regs[j].is32;
9565 current.dirty&=branch_regs[j].dirty;
9574 // Count cycles in between branches
9576 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))
9581 else if(/*itype[i]==LOAD||*/itype[i]==STORE||itype[i]==C1LS) // load causes weird timing issues
9583 cc+=2; // 2 cycle penalty (after CLOCK_DIVIDER)
9585 else if(itype[i]==C2LS)
9595 flush_dirty_uppers(¤t);
9597 regs[i].is32=current.is32;
9598 regs[i].dirty=current.dirty;
9599 regs[i].isconst=current.isconst;
9600 memcpy(constmap[i],current.constmap,sizeof(current.constmap));
9602 for(hr=0;hr<HOST_REGS;hr++) {
9603 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9604 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9605 regs[i].wasconst&=~(1<<hr);
9609 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9612 /* Pass 4 - Cull unused host registers */
9616 for (i=slen-1;i>=0;i--)
9619 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9621 if(ba[i]<start || ba[i]>=(start+slen*4))
9623 // Branch out of this block, don't need anything
9629 // Need whatever matches the target
9631 int t=(ba[i]-start)>>2;
9632 for(hr=0;hr<HOST_REGS;hr++)
9634 if(regs[i].regmap_entry[hr]>=0) {
9635 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9639 // Conditional branch may need registers for following instructions
9640 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9643 nr|=needed_reg[i+2];
9644 for(hr=0;hr<HOST_REGS;hr++)
9646 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9647 //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]);
9651 // Don't need stuff which is overwritten
9652 //if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9653 //if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9654 // Merge in delay slot
9655 for(hr=0;hr<HOST_REGS;hr++)
9658 // These are overwritten unless the branch is "likely"
9659 // and the delay slot is nullified if not taken
9660 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9661 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9663 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9664 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9665 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9666 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9667 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9668 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9669 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9670 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9671 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
9672 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9673 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9675 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
9676 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9677 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9679 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
9680 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9681 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9685 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
9687 // SYSCALL instruction (software interrupt)
9690 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
9692 // ERET instruction (return from interrupt)
9698 for(hr=0;hr<HOST_REGS;hr++) {
9699 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
9700 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
9701 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9702 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9706 for(hr=0;hr<HOST_REGS;hr++)
9708 // Overwritten registers are not needed
9709 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9710 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9711 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9712 // Source registers are needed
9713 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9714 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9715 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
9716 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
9717 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9718 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9719 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9720 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9721 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
9722 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9723 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9725 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
9726 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9727 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9729 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
9730 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9731 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9733 // Don't store a register immediately after writing it,
9734 // may prevent dual-issue.
9735 // But do so if this is a branch target, otherwise we
9736 // might have to load the register before the branch.
9737 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
9738 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
9739 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
9740 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9741 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9743 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
9744 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
9745 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9746 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9750 // Cycle count is needed at branches. Assume it is needed at the target too.
9751 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
9752 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9753 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9758 // Deallocate unneeded registers
9759 for(hr=0;hr<HOST_REGS;hr++)
9762 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
9763 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9764 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9765 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
9767 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9770 regs[i].regmap[hr]=-1;
9771 regs[i].isconst&=~(1<<hr);
9773 regmap_pre[i+2][hr]=-1;
9774 regs[i+2].wasconst&=~(1<<hr);
9779 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9781 int d1=0,d2=0,map=0,temp=0;
9782 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
9788 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
9789 itype[i+1]==STORE || itype[i+1]==STORELR ||
9790 itype[i+1]==C1LS || itype[i+1]==C2LS)
9793 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
9794 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9797 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
9798 itype[i+1]==C1LS || itype[i+1]==C2LS)
9800 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9801 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9802 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
9803 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
9804 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9805 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
9806 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
9807 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
9808 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
9809 regs[i].regmap[hr]!=map )
9811 regs[i].regmap[hr]=-1;
9812 regs[i].isconst&=~(1<<hr);
9813 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
9814 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
9815 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
9816 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
9817 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
9818 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
9819 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
9820 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
9821 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
9822 branch_regs[i].regmap[hr]!=map)
9824 branch_regs[i].regmap[hr]=-1;
9825 branch_regs[i].regmap_entry[hr]=-1;
9826 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9828 if(!likely[i]&&i<slen-2) {
9829 regmap_pre[i+2][hr]=-1;
9830 regs[i+2].wasconst&=~(1<<hr);
9841 int d1=0,d2=0,map=-1,temp=-1;
9842 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
9848 if(itype[i]==LOAD || itype[i]==LOADLR ||
9849 itype[i]==STORE || itype[i]==STORELR ||
9850 itype[i]==C1LS || itype[i]==C2LS)
9852 } else if(itype[i]==STORE || itype[i]==STORELR ||
9853 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9856 if(itype[i]==LOADLR || itype[i]==STORELR ||
9857 itype[i]==C1LS || itype[i]==C2LS)
9859 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9860 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
9861 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9862 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
9863 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
9864 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
9866 if(i<slen-1&&!is_ds[i]) {
9867 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
9868 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
9869 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
9871 printf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
9872 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
9874 regmap_pre[i+1][hr]=-1;
9875 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
9876 regs[i+1].wasconst&=~(1<<hr);
9878 regs[i].regmap[hr]=-1;
9879 regs[i].isconst&=~(1<<hr);
9887 /* Pass 5 - Pre-allocate registers */
9889 // If a register is allocated during a loop, try to allocate it for the
9890 // entire loop, if possible. This avoids loading/storing registers
9891 // inside of the loop.
9893 signed char f_regmap[HOST_REGS];
9894 clear_all_regs(f_regmap);
9895 for(i=0;i<slen-1;i++)
9897 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9899 if(ba[i]>=start && ba[i]<(start+i*4))
9900 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
9901 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
9902 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9903 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9904 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9905 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9907 int t=(ba[i]-start)>>2;
9908 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
9909 if(t<2||(itype[t-2]!=UJUMP&&itype[t-2]!=RJUMP)||rt1[t-2]!=31) // call/ret assumes no registers allocated
9910 for(hr=0;hr<HOST_REGS;hr++)
9912 if(regs[i].regmap[hr]>64) {
9913 if(!((regs[i].dirty>>hr)&1))
9914 f_regmap[hr]=regs[i].regmap[hr];
9915 else f_regmap[hr]=-1;
9917 else if(regs[i].regmap[hr]>=0) {
9918 if(f_regmap[hr]!=regs[i].regmap[hr]) {
9919 // dealloc old register
9921 for(n=0;n<HOST_REGS;n++)
9923 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
9925 // and alloc new one
9926 f_regmap[hr]=regs[i].regmap[hr];
9929 if(branch_regs[i].regmap[hr]>64) {
9930 if(!((branch_regs[i].dirty>>hr)&1))
9931 f_regmap[hr]=branch_regs[i].regmap[hr];
9932 else f_regmap[hr]=-1;
9934 else if(branch_regs[i].regmap[hr]>=0) {
9935 if(f_regmap[hr]!=branch_regs[i].regmap[hr]) {
9936 // dealloc old register
9938 for(n=0;n<HOST_REGS;n++)
9940 if(f_regmap[n]==branch_regs[i].regmap[hr]) {f_regmap[n]=-1;}
9942 // and alloc new one
9943 f_regmap[hr]=branch_regs[i].regmap[hr];
9947 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1])
9948 f_regmap[hr]=branch_regs[i].regmap[hr];
9950 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1])
9951 f_regmap[hr]=branch_regs[i].regmap[hr];
9953 // Avoid dirty->clean transition
9954 #ifdef DESTRUCTIVE_WRITEBACK
9955 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;
9957 // This check is only strictly required in the DESTRUCTIVE_WRITEBACK
9958 // case above, however it's always a good idea. We can't hoist the
9959 // load if the register was already allocated, so there's no point
9960 // wasting time analyzing most of these cases. It only "succeeds"
9961 // when the mapping was different and the load can be replaced with
9962 // a mov, which is of negligible benefit. So such cases are
9964 if(f_regmap[hr]>0) {
9965 if(regs[t].regmap[hr]==f_regmap[hr]||(regs[t].regmap_entry[hr]<0&&get_reg(regmap_pre[t],f_regmap[hr])<0)) {
9969 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9970 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
9971 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
9973 // NB This can exclude the case where the upper-half
9974 // register is lower numbered than the lower-half
9975 // register. Not sure if it's worth fixing...
9976 if(get_reg(regs[j].regmap,r&63)<0) break;
9977 if(get_reg(regs[j].regmap_entry,r&63)<0) break;
9978 if(regs[j].is32&(1LL<<(r&63))) break;
9980 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
9981 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9983 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
9984 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
9986 if(get_reg(regs[i].regmap,r&63)<0) break;
9987 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
9990 while(k>1&®s[k-1].regmap[hr]==-1) {
9991 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
9992 //printf("no free regs for store %x\n",start+(k-1)*4);
9995 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
9996 //printf("no-match due to different register\n");
9999 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
10000 //printf("no-match due to branch\n");
10003 // call/ret fast path assumes no registers allocated
10004 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)&&rt1[k-3]==31) {
10008 // NB This can exclude the case where the upper-half
10009 // register is lower numbered than the lower-half
10010 // register. Not sure if it's worth fixing...
10011 if(get_reg(regs[k-1].regmap,r&63)<0) break;
10012 if(regs[k-1].is32&(1LL<<(r&63))) break;
10017 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
10018 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
10019 //printf("bad match after branch\n");
10023 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
10024 //printf("Extend r%d, %x ->\n",hr,start+k*4);
10026 regs[k].regmap_entry[hr]=f_regmap[hr];
10027 regs[k].regmap[hr]=f_regmap[hr];
10028 regmap_pre[k+1][hr]=f_regmap[hr];
10029 regs[k].wasdirty&=~(1<<hr);
10030 regs[k].dirty&=~(1<<hr);
10031 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
10032 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
10033 regs[k].wasconst&=~(1<<hr);
10034 regs[k].isconst&=~(1<<hr);
10039 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
10042 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
10043 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
10044 //printf("OK fill %x (r%d)\n",start+i*4,hr);
10045 regs[i].regmap_entry[hr]=f_regmap[hr];
10046 regs[i].regmap[hr]=f_regmap[hr];
10047 regs[i].wasdirty&=~(1<<hr);
10048 regs[i].dirty&=~(1<<hr);
10049 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
10050 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
10051 regs[i].wasconst&=~(1<<hr);
10052 regs[i].isconst&=~(1<<hr);
10053 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
10054 branch_regs[i].wasdirty&=~(1<<hr);
10055 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
10056 branch_regs[i].regmap[hr]=f_regmap[hr];
10057 branch_regs[i].dirty&=~(1<<hr);
10058 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
10059 branch_regs[i].wasconst&=~(1<<hr);
10060 branch_regs[i].isconst&=~(1<<hr);
10061 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
10062 regmap_pre[i+2][hr]=f_regmap[hr];
10063 regs[i+2].wasdirty&=~(1<<hr);
10064 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
10065 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
10066 (regs[i+2].was32&(1LL<<f_regmap[hr])));
10071 // Alloc register clean at beginning of loop,
10072 // but may dirty it in pass 6
10073 regs[k].regmap_entry[hr]=f_regmap[hr];
10074 regs[k].regmap[hr]=f_regmap[hr];
10075 regs[k].dirty&=~(1<<hr);
10076 regs[k].wasconst&=~(1<<hr);
10077 regs[k].isconst&=~(1<<hr);
10078 if(itype[k]==UJUMP||itype[k]==RJUMP||itype[k]==CJUMP||itype[k]==SJUMP||itype[k]==FJUMP) {
10079 branch_regs[k].regmap_entry[hr]=f_regmap[hr];
10080 branch_regs[k].regmap[hr]=f_regmap[hr];
10081 branch_regs[k].dirty&=~(1<<hr);
10082 branch_regs[k].wasconst&=~(1<<hr);
10083 branch_regs[k].isconst&=~(1<<hr);
10084 if(itype[k]!=RJUMP&&itype[k]!=UJUMP&&(source[k]>>16)!=0x1000) {
10085 regmap_pre[k+2][hr]=f_regmap[hr];
10086 regs[k+2].wasdirty&=~(1<<hr);
10087 assert((branch_regs[k].is32&(1LL<<f_regmap[hr]))==
10088 (regs[k+2].was32&(1LL<<f_regmap[hr])));
10093 regmap_pre[k+1][hr]=f_regmap[hr];
10094 regs[k+1].wasdirty&=~(1<<hr);
10097 if(regs[j].regmap[hr]==f_regmap[hr])
10098 regs[j].regmap_entry[hr]=f_regmap[hr];
10102 if(regs[j].regmap[hr]>=0)
10104 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
10105 //printf("no-match due to different register\n");
10108 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
10109 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
10112 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10114 // Stop on unconditional branch
10117 if(itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP)
10120 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1])
10123 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1])
10126 if(get_reg(branch_regs[j].regmap,f_regmap[hr])>=0) {
10127 //printf("no-match due to different register (branch)\n");
10131 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10132 //printf("No free regs for store %x\n",start+j*4);
10135 if(f_regmap[hr]>=64) {
10136 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
10141 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
10152 // Non branch or undetermined branch target
10153 for(hr=0;hr<HOST_REGS;hr++)
10155 if(hr!=EXCLUDE_REG) {
10156 if(regs[i].regmap[hr]>64) {
10157 if(!((regs[i].dirty>>hr)&1))
10158 f_regmap[hr]=regs[i].regmap[hr];
10160 else if(regs[i].regmap[hr]>=0) {
10161 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10162 // dealloc old register
10164 for(n=0;n<HOST_REGS;n++)
10166 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10168 // and alloc new one
10169 f_regmap[hr]=regs[i].regmap[hr];
10174 // Try to restore cycle count at branch targets
10176 for(j=i;j<slen-1;j++) {
10177 if(regs[j].regmap[HOST_CCREG]!=-1) break;
10178 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10179 //printf("no free regs for store %x\n",start+j*4);
10183 if(regs[j].regmap[HOST_CCREG]==CCREG) {
10185 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
10187 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10188 regs[k].regmap[HOST_CCREG]=CCREG;
10189 regmap_pre[k+1][HOST_CCREG]=CCREG;
10190 regs[k+1].wasdirty|=1<<HOST_CCREG;
10191 regs[k].dirty|=1<<HOST_CCREG;
10192 regs[k].wasconst&=~(1<<HOST_CCREG);
10193 regs[k].isconst&=~(1<<HOST_CCREG);
10196 regs[j].regmap_entry[HOST_CCREG]=CCREG;
10198 // Work backwards from the branch target
10199 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
10201 //printf("Extend backwards\n");
10204 while(regs[k-1].regmap[HOST_CCREG]==-1) {
10205 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10206 //printf("no free regs for store %x\n",start+(k-1)*4);
10211 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
10212 //printf("Extend CC, %x ->\n",start+k*4);
10214 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10215 regs[k].regmap[HOST_CCREG]=CCREG;
10216 regmap_pre[k+1][HOST_CCREG]=CCREG;
10217 regs[k+1].wasdirty|=1<<HOST_CCREG;
10218 regs[k].dirty|=1<<HOST_CCREG;
10219 regs[k].wasconst&=~(1<<HOST_CCREG);
10220 regs[k].isconst&=~(1<<HOST_CCREG);
10225 //printf("Fail Extend CC, %x ->\n",start+k*4);
10229 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
10230 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
10231 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
10232 itype[i]!=FCONV&&itype[i]!=FCOMP)
10234 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
10239 // Cache memory offset or tlb map pointer if a register is available
10240 #ifndef HOST_IMM_ADDR32
10245 int earliest_available[HOST_REGS];
10246 int loop_start[HOST_REGS];
10247 int score[HOST_REGS];
10248 int end[HOST_REGS];
10249 int reg=using_tlb?MMREG:ROREG;
10252 for(hr=0;hr<HOST_REGS;hr++) {
10253 score[hr]=0;earliest_available[hr]=0;
10254 loop_start[hr]=MAXBLOCK;
10256 for(i=0;i<slen-1;i++)
10258 // Can't do anything if no registers are available
10259 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i]) {
10260 for(hr=0;hr<HOST_REGS;hr++) {
10261 score[hr]=0;earliest_available[hr]=i+1;
10262 loop_start[hr]=MAXBLOCK;
10265 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10267 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1]) {
10268 for(hr=0;hr<HOST_REGS;hr++) {
10269 score[hr]=0;earliest_available[hr]=i+1;
10270 loop_start[hr]=MAXBLOCK;
10274 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1]) {
10275 for(hr=0;hr<HOST_REGS;hr++) {
10276 score[hr]=0;earliest_available[hr]=i+1;
10277 loop_start[hr]=MAXBLOCK;
10282 // Mark unavailable registers
10283 for(hr=0;hr<HOST_REGS;hr++) {
10284 if(regs[i].regmap[hr]>=0) {
10285 score[hr]=0;earliest_available[hr]=i+1;
10286 loop_start[hr]=MAXBLOCK;
10288 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10289 if(branch_regs[i].regmap[hr]>=0) {
10290 score[hr]=0;earliest_available[hr]=i+2;
10291 loop_start[hr]=MAXBLOCK;
10295 // No register allocations after unconditional jumps
10296 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10298 for(hr=0;hr<HOST_REGS;hr++) {
10299 score[hr]=0;earliest_available[hr]=i+2;
10300 loop_start[hr]=MAXBLOCK;
10302 i++; // Skip delay slot too
10303 //printf("skip delay slot: %x\n",start+i*4);
10307 if(itype[i]==LOAD||itype[i]==LOADLR||
10308 itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS) {
10309 for(hr=0;hr<HOST_REGS;hr++) {
10310 if(hr!=EXCLUDE_REG) {
10312 for(j=i;j<slen-1;j++) {
10313 if(regs[j].regmap[hr]>=0) break;
10314 if(itype[j]==UJUMP||itype[j]==RJUMP||itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP) {
10315 if(branch_regs[j].regmap[hr]>=0) break;
10317 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1]) break;
10319 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1]) break;
10322 else if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) break;
10323 if(itype[j]==UJUMP||itype[j]==RJUMP||itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP) {
10324 int t=(ba[j]-start)>>2;
10325 if(t<j&&t>=earliest_available[hr]) {
10326 if(t==1||(t>1&&itype[t-2]!=UJUMP&&itype[t-2]!=RJUMP)||(t>1&&rt1[t-2]!=31)) { // call/ret assumes no registers allocated
10327 // Score a point for hoisting loop invariant
10328 if(t<loop_start[hr]) loop_start[hr]=t;
10329 //printf("set loop_start: i=%x j=%x (%x)\n",start+i*4,start+j*4,start+t*4);
10335 if(regs[t].regmap[hr]==reg) {
10336 // Score a point if the branch target matches this register
10341 if(itype[j+1]==LOAD||itype[j+1]==LOADLR||
10342 itype[j+1]==STORE||itype[j+1]==STORELR||itype[j+1]==C1LS) {
10347 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10349 // Stop on unconditional branch
10353 if(itype[j]==LOAD||itype[j]==LOADLR||
10354 itype[j]==STORE||itype[j]==STORELR||itype[j]==C1LS) {
10361 // Find highest score and allocate that register
10363 for(hr=0;hr<HOST_REGS;hr++) {
10364 if(hr!=EXCLUDE_REG) {
10365 if(score[hr]>score[maxscore]) {
10367 //printf("highest score: %d %d (%x->%x)\n",score[hr],hr,start+i*4,start+end[hr]*4);
10371 if(score[maxscore]>1)
10373 if(i<loop_start[maxscore]) loop_start[maxscore]=i;
10374 for(j=loop_start[maxscore];j<slen&&j<=end[maxscore];j++) {
10375 //if(regs[j].regmap[maxscore]>=0) {printf("oops: %x %x was %d=%d\n",loop_start[maxscore]*4+start,j*4+start,maxscore,regs[j].regmap[maxscore]);}
10376 assert(regs[j].regmap[maxscore]<0);
10377 if(j>loop_start[maxscore]) regs[j].regmap_entry[maxscore]=reg;
10378 regs[j].regmap[maxscore]=reg;
10379 regs[j].dirty&=~(1<<maxscore);
10380 regs[j].wasconst&=~(1<<maxscore);
10381 regs[j].isconst&=~(1<<maxscore);
10382 if(itype[j]==UJUMP||itype[j]==RJUMP||itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP) {
10383 branch_regs[j].regmap[maxscore]=reg;
10384 branch_regs[j].wasdirty&=~(1<<maxscore);
10385 branch_regs[j].dirty&=~(1<<maxscore);
10386 branch_regs[j].wasconst&=~(1<<maxscore);
10387 branch_regs[j].isconst&=~(1<<maxscore);
10388 if(itype[j]!=RJUMP&&itype[j]!=UJUMP&&(source[j]>>16)!=0x1000) {
10389 regmap_pre[j+2][maxscore]=reg;
10390 regs[j+2].wasdirty&=~(1<<maxscore);
10392 // loop optimization (loop_preload)
10393 int t=(ba[j]-start)>>2;
10394 if(t==loop_start[maxscore]) {
10395 if(t==1||(t>1&&itype[t-2]!=UJUMP&&itype[t-2]!=RJUMP)||(t>1&&rt1[t-2]!=31)) // call/ret assumes no registers allocated
10396 regs[t].regmap_entry[maxscore]=reg;
10401 if(j<1||(itype[j-1]!=RJUMP&&itype[j-1]!=UJUMP&&itype[j-1]!=CJUMP&&itype[j-1]!=SJUMP&&itype[j-1]!=FJUMP)) {
10402 regmap_pre[j+1][maxscore]=reg;
10403 regs[j+1].wasdirty&=~(1<<maxscore);
10408 if(itype[j-1]==RJUMP||itype[j-1]==UJUMP||itype[j-1]==CJUMP||itype[j-1]==SJUMP||itype[j-1]==FJUMP) i++; // skip delay slot
10409 for(hr=0;hr<HOST_REGS;hr++) {
10410 score[hr]=0;earliest_available[hr]=i+i;
10411 loop_start[hr]=MAXBLOCK;
10419 // This allocates registers (if possible) one instruction prior
10420 // to use, which can avoid a load-use penalty on certain CPUs.
10421 for(i=0;i<slen-1;i++)
10423 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
10427 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
10428 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
10431 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
10433 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10435 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10436 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10437 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10438 regs[i].isconst&=~(1<<hr);
10439 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10440 constmap[i][hr]=constmap[i+1][hr];
10441 regs[i+1].wasdirty&=~(1<<hr);
10442 regs[i].dirty&=~(1<<hr);
10447 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
10449 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10451 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10452 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10453 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10454 regs[i].isconst&=~(1<<hr);
10455 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10456 constmap[i][hr]=constmap[i+1][hr];
10457 regs[i+1].wasdirty&=~(1<<hr);
10458 regs[i].dirty&=~(1<<hr);
10462 // Preload target address for load instruction (non-constant)
10463 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10464 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10466 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10468 regs[i].regmap[hr]=rs1[i+1];
10469 regmap_pre[i+1][hr]=rs1[i+1];
10470 regs[i+1].regmap_entry[hr]=rs1[i+1];
10471 regs[i].isconst&=~(1<<hr);
10472 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10473 constmap[i][hr]=constmap[i+1][hr];
10474 regs[i+1].wasdirty&=~(1<<hr);
10475 regs[i].dirty&=~(1<<hr);
10479 // Load source into target register
10480 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10481 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10483 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10485 regs[i].regmap[hr]=rs1[i+1];
10486 regmap_pre[i+1][hr]=rs1[i+1];
10487 regs[i+1].regmap_entry[hr]=rs1[i+1];
10488 regs[i].isconst&=~(1<<hr);
10489 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10490 constmap[i][hr]=constmap[i+1][hr];
10491 regs[i+1].wasdirty&=~(1<<hr);
10492 regs[i].dirty&=~(1<<hr);
10496 // Preload map address
10497 #ifndef HOST_IMM_ADDR32
10498 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) {
10499 hr=get_reg(regs[i+1].regmap,TLREG);
10501 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10502 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10504 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10506 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10507 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10508 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10509 regs[i].isconst&=~(1<<hr);
10510 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10511 constmap[i][hr]=constmap[i+1][hr];
10512 regs[i+1].wasdirty&=~(1<<hr);
10513 regs[i].dirty&=~(1<<hr);
10515 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10517 // move it to another register
10518 regs[i+1].regmap[hr]=-1;
10519 regmap_pre[i+2][hr]=-1;
10520 regs[i+1].regmap[nr]=TLREG;
10521 regmap_pre[i+2][nr]=TLREG;
10522 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10523 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10524 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10525 regs[i].isconst&=~(1<<nr);
10526 regs[i+1].isconst&=~(1<<nr);
10527 regs[i].dirty&=~(1<<nr);
10528 regs[i+1].wasdirty&=~(1<<nr);
10529 regs[i+1].dirty&=~(1<<nr);
10530 regs[i+2].wasdirty&=~(1<<nr);
10536 // Address for store instruction (non-constant)
10537 if(itype[i+1]==STORE||itype[i+1]==STORELR
10538 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10539 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10540 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10541 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10542 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10544 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10546 regs[i].regmap[hr]=rs1[i+1];
10547 regmap_pre[i+1][hr]=rs1[i+1];
10548 regs[i+1].regmap_entry[hr]=rs1[i+1];
10549 regs[i].isconst&=~(1<<hr);
10550 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10551 constmap[i][hr]=constmap[i+1][hr];
10552 regs[i+1].wasdirty&=~(1<<hr);
10553 regs[i].dirty&=~(1<<hr);
10557 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10558 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10560 hr=get_reg(regs[i+1].regmap,FTEMP);
10562 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10564 regs[i].regmap[hr]=rs1[i+1];
10565 regmap_pre[i+1][hr]=rs1[i+1];
10566 regs[i+1].regmap_entry[hr]=rs1[i+1];
10567 regs[i].isconst&=~(1<<hr);
10568 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10569 constmap[i][hr]=constmap[i+1][hr];
10570 regs[i+1].wasdirty&=~(1<<hr);
10571 regs[i].dirty&=~(1<<hr);
10573 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10575 // move it to another register
10576 regs[i+1].regmap[hr]=-1;
10577 regmap_pre[i+2][hr]=-1;
10578 regs[i+1].regmap[nr]=FTEMP;
10579 regmap_pre[i+2][nr]=FTEMP;
10580 regs[i].regmap[nr]=rs1[i+1];
10581 regmap_pre[i+1][nr]=rs1[i+1];
10582 regs[i+1].regmap_entry[nr]=rs1[i+1];
10583 regs[i].isconst&=~(1<<nr);
10584 regs[i+1].isconst&=~(1<<nr);
10585 regs[i].dirty&=~(1<<nr);
10586 regs[i+1].wasdirty&=~(1<<nr);
10587 regs[i+1].dirty&=~(1<<nr);
10588 regs[i+2].wasdirty&=~(1<<nr);
10592 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*/) {
10593 if(itype[i+1]==LOAD)
10594 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10595 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10596 hr=get_reg(regs[i+1].regmap,FTEMP);
10597 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10598 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10599 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10601 if(hr>=0&®s[i].regmap[hr]<0) {
10602 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10603 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10604 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10605 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10606 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10607 regs[i].isconst&=~(1<<hr);
10608 regs[i+1].wasdirty&=~(1<<hr);
10609 regs[i].dirty&=~(1<<hr);
10618 /* Pass 6 - Optimize clean/dirty state */
10619 clean_registers(0,slen-1,1);
10621 /* Pass 7 - Identify 32-bit registers */
10627 for (i=slen-1;i>=0;i--)
10630 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10632 if(ba[i]<start || ba[i]>=(start+slen*4))
10634 // Branch out of this block, don't need anything
10640 // Need whatever matches the target
10641 // (and doesn't get overwritten by the delay slot instruction)
10643 int t=(ba[i]-start)>>2;
10644 if(ba[i]>start+i*4) {
10646 if(!(requires_32bit[t]&~regs[i].was32))
10647 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10650 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10651 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10652 if(!(pr32[t]&~regs[i].was32))
10653 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10656 // Conditional branch may need registers for following instructions
10657 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10660 r32|=requires_32bit[i+2];
10661 r32&=regs[i].was32;
10662 // Mark this address as a branch target since it may be called
10663 // upon return from interrupt
10667 // Merge in delay slot
10669 // These are overwritten unless the branch is "likely"
10670 // and the delay slot is nullified if not taken
10671 r32&=~(1LL<<rt1[i+1]);
10672 r32&=~(1LL<<rt2[i+1]);
10674 // Assume these are needed (delay slot)
10677 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
10681 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
10683 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
10685 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
10687 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
10689 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
10692 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
10694 // SYSCALL instruction (software interrupt)
10697 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10699 // ERET instruction (return from interrupt)
10703 r32&=~(1LL<<rt1[i]);
10704 r32&=~(1LL<<rt2[i]);
10707 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
10711 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
10713 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
10715 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
10717 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
10719 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
10721 requires_32bit[i]=r32;
10723 // Dirty registers which are 32-bit, require 32-bit input
10724 // as they will be written as 32-bit values
10725 for(hr=0;hr<HOST_REGS;hr++)
10727 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
10728 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
10729 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
10730 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
10734 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
10737 for (i=slen-1;i>=0;i--)
10739 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10741 // Conditional branch
10742 if((source[i]>>16)!=0x1000&&i<slen-2) {
10743 // Mark this address as a branch target since it may be called
10744 // upon return from interrupt
10751 if(itype[slen-1]==SPAN) {
10752 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
10755 /* Debug/disassembly */
10756 if((void*)assem_debug==(void*)printf)
10757 for(i=0;i<slen;i++)
10761 for(r=1;r<=CCREG;r++) {
10762 if((unneeded_reg[i]>>r)&1) {
10763 if(r==HIREG) printf(" HI");
10764 else if(r==LOREG) printf(" LO");
10765 else printf(" r%d",r);
10770 for(r=1;r<=CCREG;r++) {
10771 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
10772 if(r==HIREG) printf(" HI");
10773 else if(r==LOREG) printf(" LO");
10774 else printf(" r%d",r);
10778 for(r=0;r<=CCREG;r++) {
10779 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10780 if((regs[i].was32>>r)&1) {
10781 if(r==CCREG) printf(" CC");
10782 else if(r==HIREG) printf(" HI");
10783 else if(r==LOREG) printf(" LO");
10784 else printf(" r%d",r);
10789 #if defined(__i386__) || defined(__x86_64__)
10790 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]);
10793 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]);
10796 if(needed_reg[i]&1) printf("eax ");
10797 if((needed_reg[i]>>1)&1) printf("ecx ");
10798 if((needed_reg[i]>>2)&1) printf("edx ");
10799 if((needed_reg[i]>>3)&1) printf("ebx ");
10800 if((needed_reg[i]>>5)&1) printf("ebp ");
10801 if((needed_reg[i]>>6)&1) printf("esi ");
10802 if((needed_reg[i]>>7)&1) printf("edi ");
10804 for(r=0;r<=CCREG;r++) {
10805 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10806 if((requires_32bit[i]>>r)&1) {
10807 if(r==CCREG) printf(" CC");
10808 else if(r==HIREG) printf(" HI");
10809 else if(r==LOREG) printf(" LO");
10810 else printf(" r%d",r);
10815 for(r=0;r<=CCREG;r++) {
10816 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10817 if((pr32[i]>>r)&1) {
10818 if(r==CCREG) printf(" CC");
10819 else if(r==HIREG) printf(" HI");
10820 else if(r==LOREG) printf(" LO");
10821 else printf(" r%d",r);
10824 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
10826 #if defined(__i386__) || defined(__x86_64__)
10827 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]);
10829 if(regs[i].wasdirty&1) printf("eax ");
10830 if((regs[i].wasdirty>>1)&1) printf("ecx ");
10831 if((regs[i].wasdirty>>2)&1) printf("edx ");
10832 if((regs[i].wasdirty>>3)&1) printf("ebx ");
10833 if((regs[i].wasdirty>>5)&1) printf("ebp ");
10834 if((regs[i].wasdirty>>6)&1) printf("esi ");
10835 if((regs[i].wasdirty>>7)&1) printf("edi ");
10838 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]);
10840 if(regs[i].wasdirty&1) printf("r0 ");
10841 if((regs[i].wasdirty>>1)&1) printf("r1 ");
10842 if((regs[i].wasdirty>>2)&1) printf("r2 ");
10843 if((regs[i].wasdirty>>3)&1) printf("r3 ");
10844 if((regs[i].wasdirty>>4)&1) printf("r4 ");
10845 if((regs[i].wasdirty>>5)&1) printf("r5 ");
10846 if((regs[i].wasdirty>>6)&1) printf("r6 ");
10847 if((regs[i].wasdirty>>7)&1) printf("r7 ");
10848 if((regs[i].wasdirty>>8)&1) printf("r8 ");
10849 if((regs[i].wasdirty>>9)&1) printf("r9 ");
10850 if((regs[i].wasdirty>>10)&1) printf("r10 ");
10851 if((regs[i].wasdirty>>12)&1) printf("r12 ");
10854 disassemble_inst(i);
10855 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
10856 #if defined(__i386__) || defined(__x86_64__)
10857 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]);
10858 if(regs[i].dirty&1) printf("eax ");
10859 if((regs[i].dirty>>1)&1) printf("ecx ");
10860 if((regs[i].dirty>>2)&1) printf("edx ");
10861 if((regs[i].dirty>>3)&1) printf("ebx ");
10862 if((regs[i].dirty>>5)&1) printf("ebp ");
10863 if((regs[i].dirty>>6)&1) printf("esi ");
10864 if((regs[i].dirty>>7)&1) printf("edi ");
10867 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]);
10868 if(regs[i].dirty&1) printf("r0 ");
10869 if((regs[i].dirty>>1)&1) printf("r1 ");
10870 if((regs[i].dirty>>2)&1) printf("r2 ");
10871 if((regs[i].dirty>>3)&1) printf("r3 ");
10872 if((regs[i].dirty>>4)&1) printf("r4 ");
10873 if((regs[i].dirty>>5)&1) printf("r5 ");
10874 if((regs[i].dirty>>6)&1) printf("r6 ");
10875 if((regs[i].dirty>>7)&1) printf("r7 ");
10876 if((regs[i].dirty>>8)&1) printf("r8 ");
10877 if((regs[i].dirty>>9)&1) printf("r9 ");
10878 if((regs[i].dirty>>10)&1) printf("r10 ");
10879 if((regs[i].dirty>>12)&1) printf("r12 ");
10882 if(regs[i].isconst) {
10883 printf("constants: ");
10884 #if defined(__i386__) || defined(__x86_64__)
10885 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
10886 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
10887 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
10888 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
10889 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
10890 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
10891 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
10894 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
10895 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
10896 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
10897 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
10898 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
10899 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
10900 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
10901 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
10902 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
10903 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
10904 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
10905 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
10911 for(r=0;r<=CCREG;r++) {
10912 if((regs[i].is32>>r)&1) {
10913 if(r==CCREG) printf(" CC");
10914 else if(r==HIREG) printf(" HI");
10915 else if(r==LOREG) printf(" LO");
10916 else printf(" r%d",r);
10922 for(r=0;r<=CCREG;r++) {
10923 if((p32[i]>>r)&1) {
10924 if(r==CCREG) printf(" CC");
10925 else if(r==HIREG) printf(" HI");
10926 else if(r==LOREG) printf(" LO");
10927 else printf(" r%d",r);
10930 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
10931 else printf("\n");*/
10932 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10933 #if defined(__i386__) || defined(__x86_64__)
10934 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]);
10935 if(branch_regs[i].dirty&1) printf("eax ");
10936 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
10937 if((branch_regs[i].dirty>>2)&1) printf("edx ");
10938 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
10939 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
10940 if((branch_regs[i].dirty>>6)&1) printf("esi ");
10941 if((branch_regs[i].dirty>>7)&1) printf("edi ");
10944 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]);
10945 if(branch_regs[i].dirty&1) printf("r0 ");
10946 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
10947 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
10948 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
10949 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
10950 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
10951 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
10952 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
10953 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
10954 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
10955 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
10956 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
10960 for(r=0;r<=CCREG;r++) {
10961 if((branch_regs[i].is32>>r)&1) {
10962 if(r==CCREG) printf(" CC");
10963 else if(r==HIREG) printf(" HI");
10964 else if(r==LOREG) printf(" LO");
10965 else printf(" r%d",r);
10973 /* Pass 8 - Assembly */
10974 linkcount=0;stubcount=0;
10975 ds=0;is_delayslot=0;
10977 uint64_t is32_pre=0;
10979 u_int beginning=(u_int)out;
10980 if((u_int)addr&1) {
10984 u_int instr_addr0_override=0;
10987 if (start == 0x80030000) {
10988 // nasty hack for fastbios thing
10989 instr_addr0_override=(u_int)out;
10990 emit_movimm(start,0);
10991 emit_readword((int)&pcaddr,1);
10992 emit_writeword(0,(int)&pcaddr);
10994 emit_jne((int)new_dyna_leave);
10997 for(i=0;i<slen;i++)
10999 //if(ds) printf("ds: ");
11000 if((void*)assem_debug==(void*)printf) disassemble_inst(i);
11002 ds=0; // Skip delay slot
11003 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
11006 #ifndef DESTRUCTIVE_WRITEBACK
11007 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
11009 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
11010 unneeded_reg[i],unneeded_reg_upper[i]);
11011 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
11012 unneeded_reg[i],unneeded_reg_upper[i]);
11014 if((itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)&&!likely[i]) {
11015 is32_pre=branch_regs[i].is32;
11016 dirty_pre=branch_regs[i].dirty;
11018 is32_pre=regs[i].is32;
11019 dirty_pre=regs[i].dirty;
11023 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
11025 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
11026 unneeded_reg[i],unneeded_reg_upper[i]);
11027 loop_preload(regmap_pre[i],regs[i].regmap_entry);
11029 // branch target entry point
11030 instr_addr[i]=(u_int)out;
11031 assem_debug("<->\n");
11033 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
11034 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
11035 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
11036 address_generation(i,®s[i],regs[i].regmap_entry);
11037 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
11038 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
11040 // Load the delay slot registers if necessary
11041 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i]&&(rs1[i+1]!=rt1[i]||rt1[i]==0))
11042 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
11043 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))
11044 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
11045 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
11046 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
11050 // Preload registers for following instruction
11051 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
11052 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
11053 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
11054 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
11055 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
11056 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
11058 // TODO: if(is_ooo(i)) address_generation(i+1);
11059 if(itype[i]==CJUMP||itype[i]==FJUMP)
11060 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
11061 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
11062 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
11063 if(bt[i]) cop1_usable=0;
11067 alu_assemble(i,®s[i]);break;
11069 imm16_assemble(i,®s[i]);break;
11071 shift_assemble(i,®s[i]);break;
11073 shiftimm_assemble(i,®s[i]);break;
11075 load_assemble(i,®s[i]);break;
11077 loadlr_assemble(i,®s[i]);break;
11079 store_assemble(i,®s[i]);break;
11081 storelr_assemble(i,®s[i]);break;
11083 cop0_assemble(i,®s[i]);break;
11085 cop1_assemble(i,®s[i]);break;
11087 c1ls_assemble(i,®s[i]);break;
11089 cop2_assemble(i,®s[i]);break;
11091 c2ls_assemble(i,®s[i]);break;
11093 c2op_assemble(i,®s[i]);break;
11095 fconv_assemble(i,®s[i]);break;
11097 float_assemble(i,®s[i]);break;
11099 fcomp_assemble(i,®s[i]);break;
11101 multdiv_assemble(i,®s[i]);break;
11103 mov_assemble(i,®s[i]);break;
11105 syscall_assemble(i,®s[i]);break;
11107 hlecall_assemble(i,®s[i]);break;
11109 intcall_assemble(i,®s[i]);break;
11111 ujump_assemble(i,®s[i]);ds=1;break;
11113 rjump_assemble(i,®s[i]);ds=1;break;
11115 cjump_assemble(i,®s[i]);ds=1;break;
11117 sjump_assemble(i,®s[i]);ds=1;break;
11119 fjump_assemble(i,®s[i]);ds=1;break;
11121 pagespan_assemble(i,®s[i]);break;
11123 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
11124 literal_pool(1024);
11126 literal_pool_jumpover(256);
11129 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
11130 // If the block did not end with an unconditional branch,
11131 // add a jump to the next instruction.
11133 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
11134 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
11136 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
11137 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
11138 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
11139 emit_loadreg(CCREG,HOST_CCREG);
11140 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
11142 else if(!likely[i-2])
11144 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
11145 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
11149 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
11150 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
11152 add_to_linker((int)out,start+i*4,0);
11159 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
11160 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
11161 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
11162 emit_loadreg(CCREG,HOST_CCREG);
11163 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
11164 add_to_linker((int)out,start+i*4,0);
11168 // TODO: delay slot stubs?
11170 for(i=0;i<stubcount;i++)
11172 switch(stubs[i][0])
11180 do_readstub(i);break;
11185 do_writestub(i);break;
11187 do_ccstub(i);break;
11189 do_invstub(i);break;
11191 do_cop1stub(i);break;
11193 do_unalignedwritestub(i);break;
11197 if (instr_addr0_override)
11198 instr_addr[0] = instr_addr0_override;
11200 /* Pass 9 - Linker */
11201 for(i=0;i<linkcount;i++)
11203 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
11205 if(!link_addr[i][2])
11208 void *addr=check_addr(link_addr[i][1]);
11209 emit_extjump(link_addr[i][0],link_addr[i][1]);
11211 set_jump_target(link_addr[i][0],(int)addr);
11212 add_link(link_addr[i][1],stub);
11214 else set_jump_target(link_addr[i][0],(int)stub);
11219 int target=(link_addr[i][1]-start)>>2;
11220 assert(target>=0&&target<slen);
11221 assert(instr_addr[target]);
11222 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11223 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
11225 set_jump_target(link_addr[i][0],instr_addr[target]);
11229 // External Branch Targets (jump_in)
11230 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
11231 for(i=0;i<slen;i++)
11235 if(instr_addr[i]) // TODO - delay slots (=null)
11237 u_int vaddr=start+i*4;
11238 u_int page=get_page(vaddr);
11239 u_int vpage=get_vpage(vaddr);
11241 //if(!(is32[i]&(~unneeded_reg_upper[i])&~(1LL<<CCREG)))
11243 if(!requires_32bit[i])
11248 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11249 assem_debug("jump_in: %x\n",start+i*4);
11250 ll_add(jump_dirty+vpage,vaddr,(void *)out);
11251 int entry_point=do_dirty_stub(i);
11252 ll_add(jump_in+page,vaddr,(void *)entry_point);
11253 // If there was an existing entry in the hash table,
11254 // replace it with the new address.
11255 // Don't add new entries. We'll insert the
11256 // ones that actually get used in check_addr().
11257 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
11258 if(ht_bin[0]==vaddr) {
11259 ht_bin[1]=entry_point;
11261 if(ht_bin[2]==vaddr) {
11262 ht_bin[3]=entry_point;
11267 u_int r=requires_32bit[i]|!!(requires_32bit[i]>>32);
11268 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11269 assem_debug("jump_in: %x (restricted - %x)\n",start+i*4,r);
11270 //int entry_point=(int)out;
11271 ////assem_debug("entry_point: %x\n",entry_point);
11272 //load_regs_entry(i);
11273 //if(entry_point==(int)out)
11274 // entry_point=instr_addr[i];
11276 // emit_jmp(instr_addr[i]);
11277 //ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
11278 ll_add_32(jump_dirty+vpage,vaddr,r,(void *)out);
11279 int entry_point=do_dirty_stub(i);
11280 ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
11285 // Write out the literal pool if necessary
11287 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11289 if(((u_int)out)&7) emit_addnop(13);
11291 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
11292 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
11293 memcpy(copy,source,slen*4);
11297 __clear_cache((void *)beginning,out);
11300 // If we're within 256K of the end of the buffer,
11301 // start over from the beginning. (Is 256K enough?)
11302 if((int)out>BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
11304 // Trap writes to any of the pages we compiled
11305 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
11307 #ifndef DISABLE_TLB
11308 memory_map[i]|=0x40000000;
11309 if((signed int)start>=(signed int)0xC0000000) {
11311 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
11313 memory_map[j]|=0x40000000;
11314 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
11319 // PCSX maps all RAM mirror invalid_code tests to 0x80000000..0x80000000+RAM_SIZE
11320 if(get_page(start)<(RAM_SIZE>>12))
11321 for(i=start>>12;i<=(start+slen*4)>>12;i++)
11322 invalid_code[((u_int)0x80000000>>12)|i]=0;
11325 /* Pass 10 - Free memory by expiring oldest blocks */
11327 int end=((((int)out-BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
11328 while(expirep!=end)
11330 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
11331 int base=BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
11332 inv_debug("EXP: Phase %d\n",expirep);
11333 switch((expirep>>11)&3)
11336 // Clear jump_in and jump_dirty
11337 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
11338 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
11339 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
11340 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
11344 ll_kill_pointers(jump_out[expirep&2047],base,shift);
11345 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
11348 // Clear hash table
11349 for(i=0;i<32;i++) {
11350 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
11351 if((ht_bin[3]>>shift)==(base>>shift) ||
11352 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11353 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
11354 ht_bin[2]=ht_bin[3]=-1;
11356 if((ht_bin[1]>>shift)==(base>>shift) ||
11357 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11358 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
11359 ht_bin[0]=ht_bin[2];
11360 ht_bin[1]=ht_bin[3];
11361 ht_bin[2]=ht_bin[3]=-1;
11368 if((expirep&2047)==0)
11371 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
11372 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
11375 expirep=(expirep+1)&65535;
11380 // vim:shiftwidth=2:expandtab