1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2 * Mupen64plus - new_dynarec.c *
3 * Copyright (C) 2009-2010 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];
87 uint64_t unneeded_reg[MAXBLOCK];
88 uint64_t unneeded_reg_upper[MAXBLOCK];
89 uint64_t branch_unneeded_reg[MAXBLOCK];
90 uint64_t branch_unneeded_reg_upper[MAXBLOCK];
91 uint64_t p32[MAXBLOCK];
92 uint64_t pr32[MAXBLOCK];
93 signed char regmap_pre[MAXBLOCK][HOST_REGS];
94 signed char regmap[MAXBLOCK][HOST_REGS];
95 signed char regmap_entry[MAXBLOCK][HOST_REGS];
96 uint64_t constmap[MAXBLOCK][HOST_REGS];
97 uint64_t known_value[HOST_REGS];
99 struct regstat regs[MAXBLOCK];
100 struct regstat branch_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)));
125 u_int stop_after_jal;
126 extern u_char restore_candidate[512];
127 extern int cycle_count;
129 /* registers that may be allocated */
131 #define HIREG 32 // hi
132 #define LOREG 33 // lo
133 #define FSREG 34 // FPU status (FCSR)
134 #define CSREG 35 // Coprocessor status
135 #define CCREG 36 // Cycle count
136 #define INVCP 37 // Pointer to invalid_code
138 #define FTEMP 38 // FPU/LDL/LDR temporary register
139 #define PTEMP 39 // Prefetch temporary register
140 #define TLREG 40 // TLB mapping offset
141 #define RHASH 41 // Return address hash
142 #define RHTBL 42 // Return address hash table address
143 #define RTEMP 43 // JR/JALR address register
145 #define AGEN1 44 // Address generation temporary register
146 #define AGEN2 45 // Address generation temporary register
147 #define MGEN1 46 // Maptable address generation temporary register
148 #define MGEN2 47 // Maptable address generation temporary register
149 #define BTREG 48 // Branch target temporary register
151 /* instruction types */
152 #define NOP 0 // No operation
153 #define LOAD 1 // Load
154 #define STORE 2 // Store
155 #define LOADLR 3 // Unaligned load
156 #define STORELR 4 // Unaligned store
157 #define MOV 5 // Move
158 #define ALU 6 // Arithmetic/logic
159 #define MULTDIV 7 // Multiply/divide
160 #define SHIFT 8 // Shift by register
161 #define SHIFTIMM 9// Shift by immediate
162 #define IMM16 10 // 16-bit immediate
163 #define RJUMP 11 // Unconditional jump to register
164 #define UJUMP 12 // Unconditional jump
165 #define CJUMP 13 // Conditional branch (BEQ/BNE/BGTZ/BLEZ)
166 #define SJUMP 14 // Conditional branch (regimm format)
167 #define COP0 15 // Coprocessor 0
168 #define COP1 16 // Coprocessor 1
169 #define C1LS 17 // Coprocessor 1 load/store
170 #define FJUMP 18 // Conditional branch (floating point)
171 #define FLOAT 19 // Floating point unit
172 #define FCONV 20 // Convert integer to float
173 #define FCOMP 21 // Floating point compare (sets FSREG)
174 #define SYSCALL 22// SYSCALL
175 #define OTHER 23 // Other
176 #define SPAN 24 // Branch/delay slot spans 2 pages
177 #define NI 25 // Not implemented
178 #define HLECALL 26// PCSX fake opcodes for HLE
179 #define COP2 27 // Coprocessor 2 move
180 #define C2LS 28 // Coprocessor 2 load/store
181 #define C2OP 29 // Coprocessor 2 operation
190 #define LOADBU_STUB 7
191 #define LOADHU_STUB 8
192 #define STOREB_STUB 9
193 #define STOREH_STUB 10
194 #define STOREW_STUB 11
195 #define STORED_STUB 12
196 #define STORELR_STUB 13
197 #define INVCODE_STUB 14
205 int new_recompile_block(int addr);
206 void *get_addr_ht(u_int vaddr);
207 void invalidate_block(u_int block);
208 void invalidate_addr(u_int addr);
209 void remove_hash(int vaddr);
212 void dyna_linker_ds();
214 void verify_code_vm();
215 void verify_code_ds();
218 void fp_exception_ds();
220 void jump_syscall_hle();
223 void new_dyna_leave();
228 void read_nomem_new();
229 void read_nomemb_new();
230 void read_nomemh_new();
231 void read_nomemd_new();
232 void write_nomem_new();
233 void write_nomemb_new();
234 void write_nomemh_new();
235 void write_nomemd_new();
236 void write_rdram_new();
237 void write_rdramb_new();
238 void write_rdramh_new();
239 void write_rdramd_new();
240 extern u_int memory_map[1048576];
242 // Needed by assembler
243 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32);
244 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty);
245 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr);
246 void load_all_regs(signed char i_regmap[]);
247 void load_needed_regs(signed char i_regmap[],signed char next_regmap[]);
248 void load_regs_entry(int t);
249 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i);
253 //#define DEBUG_CYCLE_COUNT 1
256 //#define assem_debug printf
257 //#define inv_debug printf
258 #define assem_debug nullf
259 #define inv_debug nullf
261 static void tlb_hacks()
265 if (strncmp((char *) ROM_HEADER->nom, "GOLDENEYE",9) == 0)
269 switch (ROM_HEADER->Country_code&0xFF)
281 // Unknown country code
285 u_int rom_addr=(u_int)rom;
287 // Since memory_map is 32-bit, on 64-bit systems the rom needs to be
288 // in the lower 4G of memory to use this hack. Copy it if necessary.
289 if((void *)rom>(void *)0xffffffff) {
290 munmap(ROM_COPY, 67108864);
291 if(mmap(ROM_COPY, 12582912,
292 PROT_READ | PROT_WRITE,
293 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
294 -1, 0) <= 0) {printf("mmap() failed\n");}
295 memcpy(ROM_COPY,rom,12582912);
296 rom_addr=(u_int)ROM_COPY;
300 for(n=0x7F000;n<0x80000;n++) {
301 memory_map[n]=(((u_int)(rom_addr+addr-0x7F000000))>>2)|0x40000000;
308 static u_int get_page(u_int vaddr)
310 u_int page=(vaddr^0x80000000)>>12;
312 if(page>262143&&tlb_LUT_r[vaddr>>12]) page=(tlb_LUT_r[vaddr>>12]^0x80000000)>>12;
314 if(page>2048) page=2048+(page&2047);
318 static u_int get_vpage(u_int vaddr)
320 u_int vpage=(vaddr^0x80000000)>>12;
322 if(vpage>262143&&tlb_LUT_r[vaddr>>12]) vpage&=2047; // jump_dirty uses a hash of the virtual address instead
324 if(vpage>2048) vpage=2048+(vpage&2047);
328 // Get address from virtual address
329 // This is called from the recompiled JR/JALR instructions
330 void *get_addr(u_int vaddr)
332 u_int page=get_page(vaddr);
333 u_int vpage=get_vpage(vaddr);
334 struct ll_entry *head;
335 //printf("TRACE: count=%d next=%d (get_addr %x,page %d)\n",Count,next_interupt,vaddr,page);
338 if(head->vaddr==vaddr&&head->reg32==0) {
339 //printf("TRACE: count=%d next=%d (get_addr match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
340 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
343 ht_bin[1]=(int)head->addr;
349 head=jump_dirty[vpage];
351 if(head->vaddr==vaddr&&head->reg32==0) {
352 //printf("TRACE: count=%d next=%d (get_addr match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
353 // Don't restore blocks which are about to expire from the cache
354 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
355 if(verify_dirty(head->addr)) {
356 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
357 invalid_code[vaddr>>12]=0;
358 memory_map[vaddr>>12]|=0x40000000;
361 if(tlb_LUT_r[vaddr>>12]) {
362 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
363 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
366 restore_candidate[vpage>>3]|=1<<(vpage&7);
368 else restore_candidate[page>>3]|=1<<(page&7);
369 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
370 if(ht_bin[0]==vaddr) {
371 ht_bin[1]=(int)head->addr; // Replace existing entry
377 ht_bin[1]=(int)head->addr;
385 //printf("TRACE: count=%d next=%d (get_addr no-match %x)\n",Count,next_interupt,vaddr);
386 int r=new_recompile_block(vaddr);
387 if(r==0) return get_addr(vaddr);
388 // Execute in unmapped page, generate pagefault execption
390 Cause=(vaddr<<31)|0x8;
391 EPC=(vaddr&1)?vaddr-5:vaddr;
393 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
394 EntryHi=BadVAddr&0xFFFFE000;
395 return get_addr_ht(0x80000000);
397 // Look up address in hash table first
398 void *get_addr_ht(u_int vaddr)
400 //printf("TRACE: count=%d next=%d (get_addr_ht %x)\n",Count,next_interupt,vaddr);
401 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
402 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
403 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
404 return get_addr(vaddr);
407 void *get_addr_32(u_int vaddr,u_int flags)
410 return get_addr(vaddr);
412 //printf("TRACE: count=%d next=%d (get_addr_32 %x,flags %x)\n",Count,next_interupt,vaddr,flags);
413 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
414 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
415 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
416 u_int page=get_page(vaddr);
417 u_int vpage=get_vpage(vaddr);
418 struct ll_entry *head;
421 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
422 //printf("TRACE: count=%d next=%d (get_addr_32 match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
424 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
426 ht_bin[1]=(int)head->addr;
428 }else if(ht_bin[2]==-1) {
429 ht_bin[3]=(int)head->addr;
432 //ht_bin[3]=ht_bin[1];
433 //ht_bin[2]=ht_bin[0];
434 //ht_bin[1]=(int)head->addr;
441 head=jump_dirty[vpage];
443 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
444 //printf("TRACE: count=%d next=%d (get_addr_32 match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
445 // Don't restore blocks which are about to expire from the cache
446 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
447 if(verify_dirty(head->addr)) {
448 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
449 invalid_code[vaddr>>12]=0;
450 memory_map[vaddr>>12]|=0x40000000;
453 if(tlb_LUT_r[vaddr>>12]) {
454 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
455 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
458 restore_candidate[vpage>>3]|=1<<(vpage&7);
460 else restore_candidate[page>>3]|=1<<(page&7);
462 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
464 ht_bin[1]=(int)head->addr;
466 }else if(ht_bin[2]==-1) {
467 ht_bin[3]=(int)head->addr;
470 //ht_bin[3]=ht_bin[1];
471 //ht_bin[2]=ht_bin[0];
472 //ht_bin[1]=(int)head->addr;
480 //printf("TRACE: count=%d next=%d (get_addr_32 no-match %x,flags %x)\n",Count,next_interupt,vaddr,flags);
481 int r=new_recompile_block(vaddr);
482 if(r==0) return get_addr(vaddr);
483 // Execute in unmapped page, generate pagefault execption
485 Cause=(vaddr<<31)|0x8;
486 EPC=(vaddr&1)?vaddr-5:vaddr;
488 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
489 EntryHi=BadVAddr&0xFFFFE000;
490 return get_addr_ht(0x80000000);
493 void clear_all_regs(signed char regmap[])
496 for (hr=0;hr<HOST_REGS;hr++) regmap[hr]=-1;
499 signed char get_reg(signed char regmap[],int r)
502 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map[hr]==r) return hr;
506 // Find a register that is available for two consecutive cycles
507 signed char get_reg2(signed char regmap1[],signed char regmap2[],int r)
510 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map1[hr]==r&®map2[hr]==r) return hr;
514 int count_free_regs(signed char regmap[])
518 for(hr=0;hr<HOST_REGS;hr++)
520 if(hr!=EXCLUDE_REG) {
521 if(regmap[hr]<0) count++;
527 void dirty_reg(struct regstat *cur,signed char reg)
531 for (hr=0;hr<HOST_REGS;hr++) {
532 if((cur->regmap[hr]&63)==reg) {
538 // If we dirty the lower half of a 64 bit register which is now being
539 // sign-extended, we need to dump the upper half.
540 // Note: Do this only after completion of the instruction, because
541 // some instructions may need to read the full 64-bit value even if
542 // overwriting it (eg SLTI, DSRA32).
543 static void flush_dirty_uppers(struct regstat *cur)
546 for (hr=0;hr<HOST_REGS;hr++) {
547 if((cur->dirty>>hr)&1) {
550 if((cur->is32>>(reg&63))&1) cur->regmap[hr]=-1;
555 void set_const(struct regstat *cur,signed char reg,uint64_t value)
559 for (hr=0;hr<HOST_REGS;hr++) {
560 if(cur->regmap[hr]==reg) {
562 cur->constmap[hr]=value;
564 else if((cur->regmap[hr]^64)==reg) {
566 cur->constmap[hr]=value>>32;
571 void clear_const(struct regstat *cur,signed char reg)
575 for (hr=0;hr<HOST_REGS;hr++) {
576 if((cur->regmap[hr]&63)==reg) {
577 cur->isconst&=~(1<<hr);
582 int is_const(struct regstat *cur,signed char reg)
586 for (hr=0;hr<HOST_REGS;hr++) {
587 if((cur->regmap[hr]&63)==reg) {
588 return (cur->isconst>>hr)&1;
593 uint64_t get_const(struct regstat *cur,signed char reg)
597 for (hr=0;hr<HOST_REGS;hr++) {
598 if(cur->regmap[hr]==reg) {
599 return cur->constmap[hr];
602 printf("Unknown constant in r%d\n",reg);
606 // Least soon needed registers
607 // Look at the next ten instructions and see which registers
608 // will be used. Try not to reallocate these.
609 void lsn(u_char hsn[], int i, int *preferred_reg)
619 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
621 // Don't go past an unconditonal jump
628 if(rs1[i+j]) hsn[rs1[i+j]]=j;
629 if(rs2[i+j]) hsn[rs2[i+j]]=j;
630 if(rt1[i+j]) hsn[rt1[i+j]]=j;
631 if(rt2[i+j]) hsn[rt2[i+j]]=j;
632 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
633 // Stores can allocate zero
637 // On some architectures stores need invc_ptr
638 #if defined(HOST_IMM8)
639 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
643 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
651 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
653 // Follow first branch
654 int t=(ba[i+b]-start)>>2;
655 j=7-b;if(t+j>=slen) j=slen-t-1;
658 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
659 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
660 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
661 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
664 // TODO: preferred register based on backward branch
666 // Delay slot should preferably not overwrite branch conditions or cycle count
667 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
668 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
669 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
675 // Coprocessor load/store needs FTEMP, even if not declared
676 if(itype[i]==C1LS||itype[i]==C2LS) {
679 // Load L/R also uses FTEMP as a temporary register
680 if(itype[i]==LOADLR) {
683 // Also SWL/SWR/SDL/SDR
684 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
687 // Don't remove the TLB registers either
688 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
691 // Don't remove the miniht registers
692 if(itype[i]==UJUMP||itype[i]==RJUMP)
699 // We only want to allocate registers if we're going to use them again soon
700 int needed_again(int r, int i)
706 u_char hsn[MAXREG+1];
709 memset(hsn,10,sizeof(hsn));
710 lsn(hsn,i,&preferred_reg);
712 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
714 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
715 return 0; // Don't need any registers if exiting the block
723 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
725 // Don't go past an unconditonal jump
729 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||((source[i+j]&0xfc00003f)==0x0d))
736 if(rs1[i+j]==r) rn=j;
737 if(rs2[i+j]==r) rn=j;
738 if((unneeded_reg[i+j]>>r)&1) rn=10;
739 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
747 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
749 // Follow first branch
751 int t=(ba[i+b]-start)>>2;
752 j=7-b;if(t+j>=slen) j=slen-t-1;
755 if(!((unneeded_reg[t+j]>>r)&1)) {
756 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
757 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
763 for(hr=0;hr<HOST_REGS;hr++) {
764 if(hr!=EXCLUDE_REG) {
765 if(rn<hsn[hr]) return 1;
771 // Try to match register allocations at the end of a loop with those
773 int loop_reg(int i, int r, int hr)
782 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
784 // Don't go past an unconditonal jump
791 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
796 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
797 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
798 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
800 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
802 int t=(ba[i+k]-start)>>2;
803 int reg=get_reg(regs[t].regmap_entry,r);
804 if(reg>=0) return reg;
805 //reg=get_reg(regs[t+1].regmap_entry,r);
806 //if(reg>=0) return reg;
814 // Allocate every register, preserving source/target regs
815 void alloc_all(struct regstat *cur,int i)
819 for(hr=0;hr<HOST_REGS;hr++) {
820 if(hr!=EXCLUDE_REG) {
821 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
822 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
825 cur->dirty&=~(1<<hr);
828 if((cur->regmap[hr]&63)==0)
831 cur->dirty&=~(1<<hr);
838 void div64(int64_t dividend,int64_t divisor)
842 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
843 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
845 void divu64(uint64_t dividend,uint64_t divisor)
849 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
850 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
853 void mult64(uint64_t m1,uint64_t m2)
855 unsigned long long int op1, op2, op3, op4;
856 unsigned long long int result1, result2, result3, result4;
857 unsigned long long int temp1, temp2, temp3, temp4;
873 op1 = op2 & 0xFFFFFFFF;
874 op2 = (op2 >> 32) & 0xFFFFFFFF;
875 op3 = op4 & 0xFFFFFFFF;
876 op4 = (op4 >> 32) & 0xFFFFFFFF;
879 temp2 = (temp1 >> 32) + op1 * op4;
881 temp4 = (temp3 >> 32) + op2 * op4;
883 result1 = temp1 & 0xFFFFFFFF;
884 result2 = temp2 + (temp3 & 0xFFFFFFFF);
885 result3 = (result2 >> 32) + temp4;
886 result4 = (result3 >> 32);
888 lo = result1 | (result2 << 32);
889 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
898 void multu64(uint64_t m1,uint64_t m2)
900 unsigned long long int op1, op2, op3, op4;
901 unsigned long long int result1, result2, result3, result4;
902 unsigned long long int temp1, temp2, temp3, temp4;
904 op1 = m1 & 0xFFFFFFFF;
905 op2 = (m1 >> 32) & 0xFFFFFFFF;
906 op3 = m2 & 0xFFFFFFFF;
907 op4 = (m2 >> 32) & 0xFFFFFFFF;
910 temp2 = (temp1 >> 32) + op1 * op4;
912 temp4 = (temp3 >> 32) + op2 * op4;
914 result1 = temp1 & 0xFFFFFFFF;
915 result2 = temp2 + (temp3 & 0xFFFFFFFF);
916 result3 = (result2 >> 32) + temp4;
917 result4 = (result3 >> 32);
919 lo = result1 | (result2 << 32);
920 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
922 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
923 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
926 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
934 else original=loaded;
937 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
940 original>>=64-(bits^56);
941 original<<=64-(bits^56);
945 else original=loaded;
950 #include "assem_x86.c"
953 #include "assem_x64.c"
956 #include "assem_arm.c"
959 // Add virtual address mapping to linked list
960 void ll_add(struct ll_entry **head,int vaddr,void *addr)
962 struct ll_entry *new_entry;
963 new_entry=malloc(sizeof(struct ll_entry));
964 assert(new_entry!=NULL);
965 new_entry->vaddr=vaddr;
967 new_entry->addr=addr;
968 new_entry->next=*head;
972 // Add virtual address mapping for 32-bit compiled block
973 void ll_add_32(struct ll_entry **head,int vaddr,u_int reg32,void *addr)
975 ll_add(head,vaddr,addr);
977 (*head)->reg32=reg32;
981 // Check if an address is already compiled
982 // but don't return addresses which are about to expire from the cache
983 void *check_addr(u_int vaddr)
985 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
986 if(ht_bin[0]==vaddr) {
987 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
988 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
990 if(ht_bin[2]==vaddr) {
991 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
992 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
994 u_int page=get_page(vaddr);
995 struct ll_entry *head;
998 if(head->vaddr==vaddr&&head->reg32==0) {
999 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1000 // Update existing entry with current address
1001 if(ht_bin[0]==vaddr) {
1002 ht_bin[1]=(int)head->addr;
1005 if(ht_bin[2]==vaddr) {
1006 ht_bin[3]=(int)head->addr;
1009 // Insert into hash table with low priority.
1010 // Don't evict existing entries, as they are probably
1011 // addresses that are being accessed frequently.
1013 ht_bin[1]=(int)head->addr;
1015 }else if(ht_bin[2]==-1) {
1016 ht_bin[3]=(int)head->addr;
1027 void remove_hash(int vaddr)
1029 //printf("remove hash: %x\n",vaddr);
1030 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1031 if(ht_bin[2]==vaddr) {
1032 ht_bin[2]=ht_bin[3]=-1;
1034 if(ht_bin[0]==vaddr) {
1035 ht_bin[0]=ht_bin[2];
1036 ht_bin[1]=ht_bin[3];
1037 ht_bin[2]=ht_bin[3]=-1;
1041 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1043 struct ll_entry *next;
1045 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1046 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1048 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1049 remove_hash((*head)->vaddr);
1056 head=&((*head)->next);
1061 // Remove all entries from linked list
1062 void ll_clear(struct ll_entry **head)
1064 struct ll_entry *cur;
1065 struct ll_entry *next;
1076 // Dereference the pointers and remove if it matches
1077 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1079 u_int old_host_addr=0;
1081 int ptr=get_pointer(head->addr);
1082 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1083 if(((ptr>>shift)==(addr>>shift)) ||
1084 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1086 printf("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1087 u_int host_addr=(u_int)kill_pointer(head->addr);
1089 if((host_addr>>12)!=(old_host_addr>>12)) {
1091 __clear_cache((void *)(old_host_addr&~0xfff),(void *)(old_host_addr|0xfff));
1093 old_host_addr=host_addr;
1100 __clear_cache((void *)(old_host_addr&~0xfff),(void *)(old_host_addr|0xfff));
1104 // This is called when we write to a compiled block (see do_invstub)
1105 void invalidate_page(u_int page)
1107 struct ll_entry *head;
1108 struct ll_entry *next;
1109 u_int old_host_addr=0;
1113 inv_debug("INVALIDATE: %x\n",head->vaddr);
1114 remove_hash(head->vaddr);
1119 head=jump_out[page];
1122 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1123 u_int host_addr=(u_int)kill_pointer(head->addr);
1125 if((host_addr>>12)!=(old_host_addr>>12)) {
1127 __clear_cache((void *)(old_host_addr&~0xfff),(void *)(old_host_addr|0xfff));
1129 old_host_addr=host_addr;
1137 __clear_cache((void *)(old_host_addr&~0xfff),(void *)(old_host_addr|0xfff));
1140 void invalidate_block(u_int block)
1142 u_int page=get_page(block<<12);
1143 u_int vpage=get_vpage(block<<12);
1144 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1145 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1148 struct ll_entry *head;
1149 head=jump_dirty[vpage];
1150 //printf("page=%d vpage=%d\n",page,vpage);
1153 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1154 get_bounds((int)head->addr,&start,&end);
1155 //printf("start: %x end: %x\n",start,end);
1156 if(page<2048&&start>=0x80000000&&end<0x80000000+RAM_SIZE) {
1157 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1158 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1159 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1163 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1164 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1165 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1166 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;
1173 //printf("first=%d last=%d\n",first,last);
1174 invalidate_page(page);
1175 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1176 assert(last<page+5);
1177 // Invalidate the adjacent pages if a block crosses a 4K boundary
1179 invalidate_page(first);
1182 for(first=page+1;first<last;first++) {
1183 invalidate_page(first);
1186 // Don't trap writes
1187 invalid_code[block]=1;
1189 // If there is a valid TLB entry for this page, remove write protect
1190 if(tlb_LUT_w[block]) {
1191 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1192 // CHECK: Is this right?
1193 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1194 u_int real_block=tlb_LUT_w[block]>>12;
1195 invalid_code[real_block]=1;
1196 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1198 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1202 memset(mini_ht,-1,sizeof(mini_ht));
1205 void invalidate_addr(u_int addr)
1207 invalidate_block(addr>>12);
1209 void invalidate_all_pages()
1212 for(page=0;page<4096;page++)
1213 invalidate_page(page);
1214 for(page=0;page<1048576;page++)
1215 if(!invalid_code[page]) {
1216 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1217 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1220 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1223 memset(mini_ht,-1,sizeof(mini_ht));
1227 for(page=0;page<0x100000;page++) {
1228 if(tlb_LUT_r[page]) {
1229 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1230 if(!tlb_LUT_w[page]||!invalid_code[page])
1231 memory_map[page]|=0x40000000; // Write protect
1233 else memory_map[page]=-1;
1234 if(page==0x80000) page=0xC0000;
1240 // Add an entry to jump_out after making a link
1241 void add_link(u_int vaddr,void *src)
1243 u_int page=get_page(vaddr);
1244 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1245 ll_add(jump_out+page,vaddr,src);
1246 //int ptr=get_pointer(src);
1247 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1250 // If a code block was found to be unmodified (bit was set in
1251 // restore_candidate) and it remains unmodified (bit is clear
1252 // in invalid_code) then move the entries for that 4K page from
1253 // the dirty list to the clean list.
1254 void clean_blocks(u_int page)
1256 struct ll_entry *head;
1257 inv_debug("INV: clean_blocks page=%d\n",page);
1258 head=jump_dirty[page];
1260 if(!invalid_code[head->vaddr>>12]) {
1261 // Don't restore blocks which are about to expire from the cache
1262 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1264 if(verify_dirty((int)head->addr)) {
1265 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1268 get_bounds((int)head->addr,&start,&end);
1269 if(start-(u_int)rdram<RAM_SIZE) {
1270 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1271 inv|=invalid_code[i];
1274 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1275 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1276 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1277 if(addr<start||addr>=end) inv=1;
1279 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1283 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1284 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1287 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1289 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1290 //printf("page=%x, addr=%x\n",page,head->vaddr);
1291 //assert(head->vaddr>>12==(page|0x80000));
1292 ll_add_32(jump_in+ppage,head->vaddr,head->reg32,clean_addr);
1293 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1295 if(ht_bin[0]==head->vaddr) {
1296 ht_bin[1]=(int)clean_addr; // Replace existing entry
1298 if(ht_bin[2]==head->vaddr) {
1299 ht_bin[3]=(int)clean_addr; // Replace existing entry
1312 void mov_alloc(struct regstat *current,int i)
1314 // Note: Don't need to actually alloc the source registers
1315 if((~current->is32>>rs1[i])&1) {
1316 //alloc_reg64(current,i,rs1[i]);
1317 alloc_reg64(current,i,rt1[i]);
1318 current->is32&=~(1LL<<rt1[i]);
1320 //alloc_reg(current,i,rs1[i]);
1321 alloc_reg(current,i,rt1[i]);
1322 current->is32|=(1LL<<rt1[i]);
1324 clear_const(current,rs1[i]);
1325 clear_const(current,rt1[i]);
1326 dirty_reg(current,rt1[i]);
1329 void shiftimm_alloc(struct regstat *current,int i)
1331 clear_const(current,rs1[i]);
1332 clear_const(current,rt1[i]);
1333 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1336 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1338 alloc_reg(current,i,rt1[i]);
1339 current->is32|=1LL<<rt1[i];
1340 dirty_reg(current,rt1[i]);
1343 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1346 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1347 alloc_reg64(current,i,rt1[i]);
1348 current->is32&=~(1LL<<rt1[i]);
1349 dirty_reg(current,rt1[i]);
1352 if(opcode2[i]==0x3c) // DSLL32
1355 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1356 alloc_reg64(current,i,rt1[i]);
1357 current->is32&=~(1LL<<rt1[i]);
1358 dirty_reg(current,rt1[i]);
1361 if(opcode2[i]==0x3e) // DSRL32
1364 alloc_reg64(current,i,rs1[i]);
1366 alloc_reg64(current,i,rt1[i]);
1367 current->is32&=~(1LL<<rt1[i]);
1369 alloc_reg(current,i,rt1[i]);
1370 current->is32|=1LL<<rt1[i];
1372 dirty_reg(current,rt1[i]);
1375 if(opcode2[i]==0x3f) // DSRA32
1378 alloc_reg64(current,i,rs1[i]);
1379 alloc_reg(current,i,rt1[i]);
1380 current->is32|=1LL<<rt1[i];
1381 dirty_reg(current,rt1[i]);
1386 void shift_alloc(struct regstat *current,int i)
1389 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1391 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1392 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1393 alloc_reg(current,i,rt1[i]);
1394 if(rt1[i]==rs2[i]) alloc_reg_temp(current,i,-1);
1395 current->is32|=1LL<<rt1[i];
1396 } else { // DSLLV/DSRLV/DSRAV
1397 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1398 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1399 alloc_reg64(current,i,rt1[i]);
1400 current->is32&=~(1LL<<rt1[i]);
1401 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1402 alloc_reg_temp(current,i,-1);
1404 clear_const(current,rs1[i]);
1405 clear_const(current,rs2[i]);
1406 clear_const(current,rt1[i]);
1407 dirty_reg(current,rt1[i]);
1411 void alu_alloc(struct regstat *current,int i)
1413 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1415 if(rs1[i]&&rs2[i]) {
1416 alloc_reg(current,i,rs1[i]);
1417 alloc_reg(current,i,rs2[i]);
1420 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1421 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1423 alloc_reg(current,i,rt1[i]);
1425 current->is32|=1LL<<rt1[i];
1427 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1429 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1431 alloc_reg64(current,i,rs1[i]);
1432 alloc_reg64(current,i,rs2[i]);
1433 alloc_reg(current,i,rt1[i]);
1435 alloc_reg(current,i,rs1[i]);
1436 alloc_reg(current,i,rs2[i]);
1437 alloc_reg(current,i,rt1[i]);
1440 current->is32|=1LL<<rt1[i];
1442 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1444 if(rs1[i]&&rs2[i]) {
1445 alloc_reg(current,i,rs1[i]);
1446 alloc_reg(current,i,rs2[i]);
1450 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1451 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1453 alloc_reg(current,i,rt1[i]);
1454 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1456 if(!((current->uu>>rt1[i])&1)) {
1457 alloc_reg64(current,i,rt1[i]);
1459 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1460 if(rs1[i]&&rs2[i]) {
1461 alloc_reg64(current,i,rs1[i]);
1462 alloc_reg64(current,i,rs2[i]);
1466 // Is is really worth it to keep 64-bit values in registers?
1468 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1469 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1473 current->is32&=~(1LL<<rt1[i]);
1475 current->is32|=1LL<<rt1[i];
1479 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1481 if(rs1[i]&&rs2[i]) {
1482 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1483 alloc_reg64(current,i,rs1[i]);
1484 alloc_reg64(current,i,rs2[i]);
1485 alloc_reg64(current,i,rt1[i]);
1487 alloc_reg(current,i,rs1[i]);
1488 alloc_reg(current,i,rs2[i]);
1489 alloc_reg(current,i,rt1[i]);
1493 alloc_reg(current,i,rt1[i]);
1494 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1495 // DADD used as move, or zeroing
1496 // If we have a 64-bit source, then make the target 64 bits too
1497 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1498 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1499 alloc_reg64(current,i,rt1[i]);
1500 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1501 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1502 alloc_reg64(current,i,rt1[i]);
1504 if(opcode2[i]>=0x2e&&rs2[i]) {
1505 // DSUB used as negation - 64-bit result
1506 // If we have a 32-bit register, extend it to 64 bits
1507 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1508 alloc_reg64(current,i,rt1[i]);
1512 if(rs1[i]&&rs2[i]) {
1513 current->is32&=~(1LL<<rt1[i]);
1515 current->is32&=~(1LL<<rt1[i]);
1516 if((current->is32>>rs1[i])&1)
1517 current->is32|=1LL<<rt1[i];
1519 current->is32&=~(1LL<<rt1[i]);
1520 if((current->is32>>rs2[i])&1)
1521 current->is32|=1LL<<rt1[i];
1523 current->is32|=1LL<<rt1[i];
1527 clear_const(current,rs1[i]);
1528 clear_const(current,rs2[i]);
1529 clear_const(current,rt1[i]);
1530 dirty_reg(current,rt1[i]);
1533 void imm16_alloc(struct regstat *current,int i)
1535 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1537 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1538 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1539 current->is32&=~(1LL<<rt1[i]);
1540 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1541 // TODO: Could preserve the 32-bit flag if the immediate is zero
1542 alloc_reg64(current,i,rt1[i]);
1543 alloc_reg64(current,i,rs1[i]);
1545 clear_const(current,rs1[i]);
1546 clear_const(current,rt1[i]);
1548 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1549 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1550 current->is32|=1LL<<rt1[i];
1551 clear_const(current,rs1[i]);
1552 clear_const(current,rt1[i]);
1554 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1555 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1556 if(rs1[i]!=rt1[i]) {
1557 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1558 alloc_reg64(current,i,rt1[i]);
1559 current->is32&=~(1LL<<rt1[i]);
1562 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1563 if(is_const(current,rs1[i])) {
1564 int v=get_const(current,rs1[i]);
1565 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1566 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1567 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1569 else clear_const(current,rt1[i]);
1571 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1572 if(is_const(current,rs1[i])) {
1573 int v=get_const(current,rs1[i]);
1574 set_const(current,rt1[i],v+imm[i]);
1576 else clear_const(current,rt1[i]);
1577 current->is32|=1LL<<rt1[i];
1580 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1581 current->is32|=1LL<<rt1[i];
1583 dirty_reg(current,rt1[i]);
1586 void load_alloc(struct regstat *current,int i)
1588 clear_const(current,rt1[i]);
1589 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1590 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1591 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1593 alloc_reg(current,i,rt1[i]);
1594 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1596 current->is32&=~(1LL<<rt1[i]);
1597 alloc_reg64(current,i,rt1[i]);
1599 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1601 current->is32&=~(1LL<<rt1[i]);
1602 alloc_reg64(current,i,rt1[i]);
1603 alloc_all(current,i);
1604 alloc_reg64(current,i,FTEMP);
1606 else current->is32|=1LL<<rt1[i];
1607 dirty_reg(current,rt1[i]);
1608 // If using TLB, need a register for pointer to the mapping table
1609 if(using_tlb) alloc_reg(current,i,TLREG);
1610 // LWL/LWR need a temporary register for the old value
1611 if(opcode[i]==0x22||opcode[i]==0x26)
1613 alloc_reg(current,i,FTEMP);
1614 alloc_reg_temp(current,i,-1);
1619 // Load to r0 (dummy load)
1620 // but we still need a register to calculate the address
1621 alloc_reg_temp(current,i,-1);
1625 void store_alloc(struct regstat *current,int i)
1627 clear_const(current,rs2[i]);
1628 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1629 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1630 alloc_reg(current,i,rs2[i]);
1631 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1632 alloc_reg64(current,i,rs2[i]);
1633 if(rs2[i]) alloc_reg(current,i,FTEMP);
1635 // If using TLB, need a register for pointer to the mapping table
1636 if(using_tlb) alloc_reg(current,i,TLREG);
1637 #if defined(HOST_IMM8)
1638 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1639 else alloc_reg(current,i,INVCP);
1641 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1642 alloc_reg(current,i,FTEMP);
1644 // We need a temporary register for address generation
1645 alloc_reg_temp(current,i,-1);
1648 void c1ls_alloc(struct regstat *current,int i)
1650 //clear_const(current,rs1[i]); // FIXME
1651 clear_const(current,rt1[i]);
1652 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1653 alloc_reg(current,i,CSREG); // Status
1654 alloc_reg(current,i,FTEMP);
1655 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1656 alloc_reg64(current,i,FTEMP);
1658 // If using TLB, need a register for pointer to the mapping table
1659 if(using_tlb) alloc_reg(current,i,TLREG);
1660 #if defined(HOST_IMM8)
1661 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1662 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1663 alloc_reg(current,i,INVCP);
1665 // We need a temporary register for address generation
1666 alloc_reg_temp(current,i,-1);
1669 void c2ls_alloc(struct regstat *current,int i)
1671 clear_const(current,rt1[i]);
1672 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1673 alloc_reg(current,i,FTEMP);
1674 // If using TLB, need a register for pointer to the mapping table
1675 if(using_tlb) alloc_reg(current,i,TLREG);
1676 #if defined(HOST_IMM8)
1677 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1678 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1679 alloc_reg(current,i,INVCP);
1681 // We need a temporary register for address generation
1682 alloc_reg_temp(current,i,-1);
1685 #ifndef multdiv_alloc
1686 void multdiv_alloc(struct regstat *current,int i)
1693 // case 0x1D: DMULTU
1696 clear_const(current,rs1[i]);
1697 clear_const(current,rs2[i]);
1700 if((opcode2[i]&4)==0) // 32-bit
1702 current->u&=~(1LL<<HIREG);
1703 current->u&=~(1LL<<LOREG);
1704 alloc_reg(current,i,HIREG);
1705 alloc_reg(current,i,LOREG);
1706 alloc_reg(current,i,rs1[i]);
1707 alloc_reg(current,i,rs2[i]);
1708 current->is32|=1LL<<HIREG;
1709 current->is32|=1LL<<LOREG;
1710 dirty_reg(current,HIREG);
1711 dirty_reg(current,LOREG);
1715 current->u&=~(1LL<<HIREG);
1716 current->u&=~(1LL<<LOREG);
1717 current->uu&=~(1LL<<HIREG);
1718 current->uu&=~(1LL<<LOREG);
1719 alloc_reg64(current,i,HIREG);
1720 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1721 alloc_reg64(current,i,rs1[i]);
1722 alloc_reg64(current,i,rs2[i]);
1723 alloc_all(current,i);
1724 current->is32&=~(1LL<<HIREG);
1725 current->is32&=~(1LL<<LOREG);
1726 dirty_reg(current,HIREG);
1727 dirty_reg(current,LOREG);
1732 // Multiply by zero is zero.
1733 // MIPS does not have a divide by zero exception.
1734 // The result is undefined, we return zero.
1735 alloc_reg(current,i,HIREG);
1736 alloc_reg(current,i,LOREG);
1737 current->is32|=1LL<<HIREG;
1738 current->is32|=1LL<<LOREG;
1739 dirty_reg(current,HIREG);
1740 dirty_reg(current,LOREG);
1745 void cop0_alloc(struct regstat *current,int i)
1747 if(opcode2[i]==0) // MFC0
1750 clear_const(current,rt1[i]);
1751 alloc_all(current,i);
1752 alloc_reg(current,i,rt1[i]);
1753 current->is32|=1LL<<rt1[i];
1754 dirty_reg(current,rt1[i]);
1757 else if(opcode2[i]==4) // MTC0
1760 clear_const(current,rs1[i]);
1761 alloc_reg(current,i,rs1[i]);
1762 alloc_all(current,i);
1765 alloc_all(current,i); // FIXME: Keep r0
1767 alloc_reg(current,i,0);
1772 // TLBR/TLBWI/TLBWR/TLBP/ERET
1773 assert(opcode2[i]==0x10);
1774 alloc_all(current,i);
1778 void cop1_alloc(struct regstat *current,int i)
1780 alloc_reg(current,i,CSREG); // Load status
1781 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1784 clear_const(current,rt1[i]);
1786 alloc_reg64(current,i,rt1[i]); // DMFC1
1787 current->is32&=~(1LL<<rt1[i]);
1789 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1790 current->is32|=1LL<<rt1[i];
1792 dirty_reg(current,rt1[i]);
1793 alloc_reg_temp(current,i,-1);
1795 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1798 clear_const(current,rs1[i]);
1800 alloc_reg64(current,i,rs1[i]); // DMTC1
1802 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1803 alloc_reg_temp(current,i,-1);
1807 alloc_reg(current,i,0);
1808 alloc_reg_temp(current,i,-1);
1812 void fconv_alloc(struct regstat *current,int i)
1814 alloc_reg(current,i,CSREG); // Load status
1815 alloc_reg_temp(current,i,-1);
1817 void float_alloc(struct regstat *current,int i)
1819 alloc_reg(current,i,CSREG); // Load status
1820 alloc_reg_temp(current,i,-1);
1822 void c2op_alloc(struct regstat *current,int i)
1824 alloc_reg_temp(current,i,-1);
1826 void fcomp_alloc(struct regstat *current,int i)
1828 alloc_reg(current,i,CSREG); // Load status
1829 alloc_reg(current,i,FSREG); // Load flags
1830 dirty_reg(current,FSREG); // Flag will be modified
1831 alloc_reg_temp(current,i,-1);
1834 void syscall_alloc(struct regstat *current,int i)
1836 alloc_cc(current,i);
1837 dirty_reg(current,CCREG);
1838 alloc_all(current,i);
1842 void delayslot_alloc(struct regstat *current,int i)
1853 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1854 printf("Disabled speculative precompilation\n");
1858 imm16_alloc(current,i);
1862 load_alloc(current,i);
1866 store_alloc(current,i);
1869 alu_alloc(current,i);
1872 shift_alloc(current,i);
1875 multdiv_alloc(current,i);
1878 shiftimm_alloc(current,i);
1881 mov_alloc(current,i);
1884 cop0_alloc(current,i);
1888 cop1_alloc(current,i);
1891 c1ls_alloc(current,i);
1894 c2ls_alloc(current,i);
1897 fconv_alloc(current,i);
1900 float_alloc(current,i);
1903 fcomp_alloc(current,i);
1906 c2op_alloc(current,i);
1911 // Special case where a branch and delay slot span two pages in virtual memory
1912 static void pagespan_alloc(struct regstat *current,int i)
1915 current->wasconst=0;
1917 alloc_all(current,i);
1918 alloc_cc(current,i);
1919 dirty_reg(current,CCREG);
1920 if(opcode[i]==3) // JAL
1922 alloc_reg(current,i,31);
1923 dirty_reg(current,31);
1925 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
1927 alloc_reg(current,i,rs1[i]);
1929 alloc_reg(current,i,rt1[i]);
1930 dirty_reg(current,rt1[i]);
1933 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
1935 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1936 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1937 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1939 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1940 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
1944 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
1946 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1947 if(!((current->is32>>rs1[i])&1))
1949 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1953 if(opcode[i]==0x11) // BC1
1955 alloc_reg(current,i,FSREG);
1956 alloc_reg(current,i,CSREG);
1961 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
1963 stubs[stubcount][0]=type;
1964 stubs[stubcount][1]=addr;
1965 stubs[stubcount][2]=retaddr;
1966 stubs[stubcount][3]=a;
1967 stubs[stubcount][4]=b;
1968 stubs[stubcount][5]=c;
1969 stubs[stubcount][6]=d;
1970 stubs[stubcount][7]=e;
1974 // Write out a single register
1975 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
1978 for(hr=0;hr<HOST_REGS;hr++) {
1979 if(hr!=EXCLUDE_REG) {
1980 if((regmap[hr]&63)==r) {
1983 emit_storereg(r,hr);
1985 if((is32>>regmap[hr])&1) {
1986 emit_sarimm(hr,31,hr);
1987 emit_storereg(r|64,hr);
1991 emit_storereg(r|64,hr);
2001 //if(!tracedebug) return 0;
2004 for(i=0;i<2097152;i++) {
2005 unsigned int temp=sum;
2008 sum^=((u_int *)rdram)[i];
2017 sum^=((u_int *)reg)[i];
2025 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2027 #ifndef DISABLE_COP1
2030 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2040 void memdebug(int i)
2042 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2043 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2046 //if(Count>=-2084597794) {
2047 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2049 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2050 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2051 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2054 printf("TRACE: %x\n",(&i)[-1]);
2058 printf("TRACE: %x \n",(&j)[10]);
2059 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]);
2063 //printf("TRACE: %x\n",(&i)[-1]);
2066 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2068 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2071 void alu_assemble(int i,struct regstat *i_regs)
2073 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2075 signed char s1,s2,t;
2076 t=get_reg(i_regs->regmap,rt1[i]);
2078 s1=get_reg(i_regs->regmap,rs1[i]);
2079 s2=get_reg(i_regs->regmap,rs2[i]);
2080 if(rs1[i]&&rs2[i]) {
2083 if(opcode2[i]&2) emit_sub(s1,s2,t);
2084 else emit_add(s1,s2,t);
2087 if(s1>=0) emit_mov(s1,t);
2088 else emit_loadreg(rs1[i],t);
2092 if(opcode2[i]&2) emit_neg(s2,t);
2093 else emit_mov(s2,t);
2096 emit_loadreg(rs2[i],t);
2097 if(opcode2[i]&2) emit_neg(t,t);
2100 else emit_zeroreg(t);
2104 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2106 signed char s1l,s2l,s1h,s2h,tl,th;
2107 tl=get_reg(i_regs->regmap,rt1[i]);
2108 th=get_reg(i_regs->regmap,rt1[i]|64);
2110 s1l=get_reg(i_regs->regmap,rs1[i]);
2111 s2l=get_reg(i_regs->regmap,rs2[i]);
2112 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2113 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2114 if(rs1[i]&&rs2[i]) {
2117 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2118 else emit_adds(s1l,s2l,tl);
2120 #ifdef INVERTED_CARRY
2121 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2123 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2125 else emit_add(s1h,s2h,th);
2129 if(s1l>=0) emit_mov(s1l,tl);
2130 else emit_loadreg(rs1[i],tl);
2132 if(s1h>=0) emit_mov(s1h,th);
2133 else emit_loadreg(rs1[i]|64,th);
2138 if(opcode2[i]&2) emit_negs(s2l,tl);
2139 else emit_mov(s2l,tl);
2142 emit_loadreg(rs2[i],tl);
2143 if(opcode2[i]&2) emit_negs(tl,tl);
2146 #ifdef INVERTED_CARRY
2147 if(s2h>=0) emit_mov(s2h,th);
2148 else emit_loadreg(rs2[i]|64,th);
2150 emit_adcimm(-1,th); // x86 has inverted carry flag
2155 if(s2h>=0) emit_rscimm(s2h,0,th);
2157 emit_loadreg(rs2[i]|64,th);
2158 emit_rscimm(th,0,th);
2161 if(s2h>=0) emit_mov(s2h,th);
2162 else emit_loadreg(rs2[i]|64,th);
2169 if(th>=0) emit_zeroreg(th);
2174 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2176 signed char s1l,s1h,s2l,s2h,t;
2177 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2179 t=get_reg(i_regs->regmap,rt1[i]);
2182 s1l=get_reg(i_regs->regmap,rs1[i]);
2183 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2184 s2l=get_reg(i_regs->regmap,rs2[i]);
2185 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2186 if(rs2[i]==0) // rx<r0
2189 if(opcode2[i]==0x2a) // SLT
2190 emit_shrimm(s1h,31,t);
2191 else // SLTU (unsigned can not be less than zero)
2194 else if(rs1[i]==0) // r0<rx
2197 if(opcode2[i]==0x2a) // SLT
2198 emit_set_gz64_32(s2h,s2l,t);
2199 else // SLTU (set if not zero)
2200 emit_set_nz64_32(s2h,s2l,t);
2203 assert(s1l>=0);assert(s1h>=0);
2204 assert(s2l>=0);assert(s2h>=0);
2205 if(opcode2[i]==0x2a) // SLT
2206 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2208 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2212 t=get_reg(i_regs->regmap,rt1[i]);
2215 s1l=get_reg(i_regs->regmap,rs1[i]);
2216 s2l=get_reg(i_regs->regmap,rs2[i]);
2217 if(rs2[i]==0) // rx<r0
2220 if(opcode2[i]==0x2a) // SLT
2221 emit_shrimm(s1l,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_gz32(s2l,t);
2230 else // SLTU (set if not zero)
2231 emit_set_nz32(s2l,t);
2234 assert(s1l>=0);assert(s2l>=0);
2235 if(opcode2[i]==0x2a) // SLT
2236 emit_set_if_less32(s1l,s2l,t);
2238 emit_set_if_carry32(s1l,s2l,t);
2244 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2246 signed char s1l,s1h,s2l,s2h,th,tl;
2247 tl=get_reg(i_regs->regmap,rt1[i]);
2248 th=get_reg(i_regs->regmap,rt1[i]|64);
2249 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2253 s1l=get_reg(i_regs->regmap,rs1[i]);
2254 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2255 s2l=get_reg(i_regs->regmap,rs2[i]);
2256 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2257 if(rs1[i]&&rs2[i]) {
2258 assert(s1l>=0);assert(s1h>=0);
2259 assert(s2l>=0);assert(s2h>=0);
2260 if(opcode2[i]==0x24) { // AND
2261 emit_and(s1l,s2l,tl);
2262 emit_and(s1h,s2h,th);
2264 if(opcode2[i]==0x25) { // OR
2265 emit_or(s1l,s2l,tl);
2266 emit_or(s1h,s2h,th);
2268 if(opcode2[i]==0x26) { // XOR
2269 emit_xor(s1l,s2l,tl);
2270 emit_xor(s1h,s2h,th);
2272 if(opcode2[i]==0x27) { // NOR
2273 emit_or(s1l,s2l,tl);
2274 emit_or(s1h,s2h,th);
2281 if(opcode2[i]==0x24) { // AND
2285 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2287 if(s1l>=0) emit_mov(s1l,tl);
2288 else emit_loadreg(rs1[i],tl);
2289 if(s1h>=0) emit_mov(s1h,th);
2290 else emit_loadreg(rs1[i]|64,th);
2294 if(s2l>=0) emit_mov(s2l,tl);
2295 else emit_loadreg(rs2[i],tl);
2296 if(s2h>=0) emit_mov(s2h,th);
2297 else emit_loadreg(rs2[i]|64,th);
2304 if(opcode2[i]==0x27) { // NOR
2306 if(s1l>=0) emit_not(s1l,tl);
2308 emit_loadreg(rs1[i],tl);
2311 if(s1h>=0) emit_not(s1h,th);
2313 emit_loadreg(rs1[i]|64,th);
2319 if(s2l>=0) emit_not(s2l,tl);
2321 emit_loadreg(rs2[i],tl);
2324 if(s2h>=0) emit_not(s2h,th);
2326 emit_loadreg(rs2[i]|64,th);
2342 s1l=get_reg(i_regs->regmap,rs1[i]);
2343 s2l=get_reg(i_regs->regmap,rs2[i]);
2344 if(rs1[i]&&rs2[i]) {
2347 if(opcode2[i]==0x24) { // AND
2348 emit_and(s1l,s2l,tl);
2350 if(opcode2[i]==0x25) { // OR
2351 emit_or(s1l,s2l,tl);
2353 if(opcode2[i]==0x26) { // XOR
2354 emit_xor(s1l,s2l,tl);
2356 if(opcode2[i]==0x27) { // NOR
2357 emit_or(s1l,s2l,tl);
2363 if(opcode2[i]==0x24) { // AND
2366 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2368 if(s1l>=0) emit_mov(s1l,tl);
2369 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2373 if(s2l>=0) emit_mov(s2l,tl);
2374 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2376 else emit_zeroreg(tl);
2378 if(opcode2[i]==0x27) { // NOR
2380 if(s1l>=0) emit_not(s1l,tl);
2382 emit_loadreg(rs1[i],tl);
2388 if(s2l>=0) emit_not(s2l,tl);
2390 emit_loadreg(rs2[i],tl);
2394 else emit_movimm(-1,tl);
2403 void imm16_assemble(int i,struct regstat *i_regs)
2405 if (opcode[i]==0x0f) { // LUI
2408 t=get_reg(i_regs->regmap,rt1[i]);
2411 if(!((i_regs->isconst>>t)&1))
2412 emit_movimm(imm[i]<<16,t);
2416 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2419 t=get_reg(i_regs->regmap,rt1[i]);
2420 s=get_reg(i_regs->regmap,rs1[i]);
2425 if(!((i_regs->isconst>>t)&1)) {
2427 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2428 emit_addimm(t,imm[i],t);
2430 if(!((i_regs->wasconst>>s)&1))
2431 emit_addimm(s,imm[i],t);
2433 emit_movimm(constmap[i][s]+imm[i],t);
2439 if(!((i_regs->isconst>>t)&1))
2440 emit_movimm(imm[i],t);
2445 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2447 signed char sh,sl,th,tl;
2448 th=get_reg(i_regs->regmap,rt1[i]|64);
2449 tl=get_reg(i_regs->regmap,rt1[i]);
2450 sh=get_reg(i_regs->regmap,rs1[i]|64);
2451 sl=get_reg(i_regs->regmap,rs1[i]);
2457 emit_addimm64_32(sh,sl,imm[i],th,tl);
2460 emit_addimm(sl,imm[i],tl);
2463 emit_movimm(imm[i],tl);
2464 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2469 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2471 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2472 signed char sh,sl,t;
2473 t=get_reg(i_regs->regmap,rt1[i]);
2474 sh=get_reg(i_regs->regmap,rs1[i]|64);
2475 sl=get_reg(i_regs->regmap,rs1[i]);
2479 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2480 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2481 if(opcode[i]==0x0a) { // SLTI
2483 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2484 emit_slti32(t,imm[i],t);
2486 emit_slti32(sl,imm[i],t);
2491 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2492 emit_sltiu32(t,imm[i],t);
2494 emit_sltiu32(sl,imm[i],t);
2499 if(opcode[i]==0x0a) // SLTI
2500 emit_slti64_32(sh,sl,imm[i],t);
2502 emit_sltiu64_32(sh,sl,imm[i],t);
2505 // SLTI(U) with r0 is just stupid,
2506 // nonetheless examples can be found
2507 if(opcode[i]==0x0a) // SLTI
2508 if(0<imm[i]) emit_movimm(1,t);
2509 else emit_zeroreg(t);
2512 if(imm[i]) emit_movimm(1,t);
2513 else emit_zeroreg(t);
2519 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2521 signed char sh,sl,th,tl;
2522 th=get_reg(i_regs->regmap,rt1[i]|64);
2523 tl=get_reg(i_regs->regmap,rt1[i]);
2524 sh=get_reg(i_regs->regmap,rs1[i]|64);
2525 sl=get_reg(i_regs->regmap,rs1[i]);
2526 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2527 if(opcode[i]==0x0c) //ANDI
2531 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2532 emit_andimm(tl,imm[i],tl);
2534 if(!((i_regs->wasconst>>sl)&1))
2535 emit_andimm(sl,imm[i],tl);
2537 emit_movimm(constmap[i][sl]&imm[i],tl);
2542 if(th>=0) emit_zeroreg(th);
2548 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2552 emit_loadreg(rs1[i]|64,th);
2557 if(opcode[i]==0x0d) //ORI
2559 emit_orimm(tl,imm[i],tl);
2561 if(!((i_regs->wasconst>>sl)&1))
2562 emit_orimm(sl,imm[i],tl);
2564 emit_movimm(constmap[i][sl]|imm[i],tl);
2566 if(opcode[i]==0x0e) //XORI
2568 emit_xorimm(tl,imm[i],tl);
2570 if(!((i_regs->wasconst>>sl)&1))
2571 emit_xorimm(sl,imm[i],tl);
2573 emit_movimm(constmap[i][sl]^imm[i],tl);
2577 emit_movimm(imm[i],tl);
2578 if(th>=0) emit_zeroreg(th);
2586 void shiftimm_assemble(int i,struct regstat *i_regs)
2588 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2592 t=get_reg(i_regs->regmap,rt1[i]);
2593 s=get_reg(i_regs->regmap,rs1[i]);
2602 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2604 if(opcode2[i]==0) // SLL
2606 emit_shlimm(s<0?t:s,imm[i],t);
2608 if(opcode2[i]==2) // SRL
2610 emit_shrimm(s<0?t:s,imm[i],t);
2612 if(opcode2[i]==3) // SRA
2614 emit_sarimm(s<0?t:s,imm[i],t);
2618 if(s>=0 && s!=t) emit_mov(s,t);
2622 //emit_storereg(rt1[i],t); //DEBUG
2625 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2628 signed char sh,sl,th,tl;
2629 th=get_reg(i_regs->regmap,rt1[i]|64);
2630 tl=get_reg(i_regs->regmap,rt1[i]);
2631 sh=get_reg(i_regs->regmap,rs1[i]|64);
2632 sl=get_reg(i_regs->regmap,rs1[i]);
2637 if(th>=0) emit_zeroreg(th);
2644 if(opcode2[i]==0x38) // DSLL
2646 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2647 emit_shlimm(sl,imm[i],tl);
2649 if(opcode2[i]==0x3a) // DSRL
2651 emit_shrdimm(sl,sh,imm[i],tl);
2652 if(th>=0) emit_shrimm(sh,imm[i],th);
2654 if(opcode2[i]==0x3b) // DSRA
2656 emit_shrdimm(sl,sh,imm[i],tl);
2657 if(th>=0) emit_sarimm(sh,imm[i],th);
2661 if(sl!=tl) emit_mov(sl,tl);
2662 if(th>=0&&sh!=th) emit_mov(sh,th);
2668 if(opcode2[i]==0x3c) // DSLL32
2671 signed char sl,tl,th;
2672 tl=get_reg(i_regs->regmap,rt1[i]);
2673 th=get_reg(i_regs->regmap,rt1[i]|64);
2674 sl=get_reg(i_regs->regmap,rs1[i]);
2683 emit_shlimm(th,imm[i]&31,th);
2688 if(opcode2[i]==0x3e) // DSRL32
2691 signed char sh,tl,th;
2692 tl=get_reg(i_regs->regmap,rt1[i]);
2693 th=get_reg(i_regs->regmap,rt1[i]|64);
2694 sh=get_reg(i_regs->regmap,rs1[i]|64);
2698 if(th>=0) emit_zeroreg(th);
2701 emit_shrimm(tl,imm[i]&31,tl);
2706 if(opcode2[i]==0x3f) // DSRA32
2710 tl=get_reg(i_regs->regmap,rt1[i]);
2711 sh=get_reg(i_regs->regmap,rs1[i]|64);
2717 emit_sarimm(tl,imm[i]&31,tl);
2724 #ifndef shift_assemble
2725 void shift_assemble(int i,struct regstat *i_regs)
2727 printf("Need shift_assemble for this architecture.\n");
2732 void load_assemble(int i,struct regstat *i_regs)
2734 int s,th,tl,addr,map=-1;
2737 int memtarget=0,c=0;
2739 th=get_reg(i_regs->regmap,rt1[i]|64);
2740 tl=get_reg(i_regs->regmap,rt1[i]);
2741 s=get_reg(i_regs->regmap,rs1[i]);
2743 for(hr=0;hr<HOST_REGS;hr++) {
2744 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2746 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2748 c=(i_regs->wasconst>>s)&1;
2749 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2750 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2752 //printf("load_assemble: c=%d\n",c);
2753 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2754 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2757 if(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80) {
2758 // could be FIFO, must perform the read
2759 assem_debug("(forced read)\n");
2760 tl=get_reg(i_regs->regmap,-1);
2764 if(offset||s<0||c) addr=tl;
2771 if(th>=0) reglist&=~(1<<th);
2774 //#define R29_HACK 1
2776 // Strmnnrmn's speed hack
2777 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2780 emit_cmpimm(addr,RAM_SIZE);
2782 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
2783 // Hint to branch predictor that the branch is unlikely to be taken
2785 emit_jno_unlikely(0);
2793 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2794 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2795 map=get_reg(i_regs->regmap,TLREG);
2797 map=do_tlb_r(addr,tl,map,x,-1,-1,c,constmap[i][s]+offset);
2798 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr);
2800 if (opcode[i]==0x20) { // LB
2802 #ifdef HOST_IMM_ADDR32
2804 emit_movsbl_tlb((constmap[i][s]+offset)^3,map,tl);
2808 //emit_xorimm(addr,3,tl);
2809 //gen_tlb_addr_r(tl,map);
2810 //emit_movsbl_indexed((int)rdram-0x80000000,tl,tl);
2812 #ifdef BIG_ENDIAN_MIPS
2813 if(!c) emit_xorimm(addr,3,tl);
2814 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2816 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
2817 else if (tl!=addr) emit_mov(addr,tl);
2819 emit_movsbl_indexed_tlb(x,tl,map,tl);
2822 add_stub(LOADB_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2825 inline_readstub(LOADB_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2827 if (opcode[i]==0x21) { // LH
2829 #ifdef HOST_IMM_ADDR32
2831 emit_movswl_tlb((constmap[i][s]+offset)^2,map,tl);
2836 #ifdef BIG_ENDIAN_MIPS
2837 if(!c) emit_xorimm(addr,2,tl);
2838 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2840 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
2841 else if (tl!=addr) emit_mov(addr,tl);
2844 //emit_movswl_indexed_tlb(x,tl,map,tl);
2847 gen_tlb_addr_r(tl,map);
2848 emit_movswl_indexed(x,tl,tl);
2850 emit_movswl_indexed((int)rdram-0x80000000+x,tl,tl);
2853 add_stub(LOADH_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2856 inline_readstub(LOADH_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2858 if (opcode[i]==0x23) { // LW
2860 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2861 #ifdef HOST_IMM_ADDR32
2863 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2866 emit_readword_indexed_tlb(0,addr,map,tl);
2868 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2871 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2873 if (opcode[i]==0x24) { // LBU
2875 #ifdef HOST_IMM_ADDR32
2877 emit_movzbl_tlb((constmap[i][s]+offset)^3,map,tl);
2881 //emit_xorimm(addr,3,tl);
2882 //gen_tlb_addr_r(tl,map);
2883 //emit_movzbl_indexed((int)rdram-0x80000000,tl,tl);
2885 #ifdef BIG_ENDIAN_MIPS
2886 if(!c) emit_xorimm(addr,3,tl);
2887 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2889 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
2890 else if (tl!=addr) emit_mov(addr,tl);
2892 emit_movzbl_indexed_tlb(x,tl,map,tl);
2895 add_stub(LOADBU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2898 inline_readstub(LOADBU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2900 if (opcode[i]==0x25) { // LHU
2902 #ifdef HOST_IMM_ADDR32
2904 emit_movzwl_tlb((constmap[i][s]+offset)^2,map,tl);
2909 #ifdef BIG_ENDIAN_MIPS
2910 if(!c) emit_xorimm(addr,2,tl);
2911 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2913 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
2914 else if (tl!=addr) emit_mov(addr,tl);
2917 //emit_movzwl_indexed_tlb(x,tl,map,tl);
2920 gen_tlb_addr_r(tl,map);
2921 emit_movzwl_indexed(x,tl,tl);
2923 emit_movzwl_indexed((int)rdram-0x80000000+x,tl,tl);
2925 add_stub(LOADHU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2929 inline_readstub(LOADHU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2931 if (opcode[i]==0x27) { // LWU
2934 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2935 #ifdef HOST_IMM_ADDR32
2937 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2940 emit_readword_indexed_tlb(0,addr,map,tl);
2942 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2945 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2949 if (opcode[i]==0x37) { // LD
2951 //gen_tlb_addr_r(tl,map);
2952 //if(th>=0) emit_readword_indexed((int)rdram-0x80000000,addr,th);
2953 //emit_readword_indexed((int)rdram-0x7FFFFFFC,addr,tl);
2954 #ifdef HOST_IMM_ADDR32
2956 emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
2959 emit_readdword_indexed_tlb(0,addr,map,th,tl);
2961 add_stub(LOADD_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2964 inline_readstub(LOADD_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2966 //emit_storereg(rt1[i],tl); // DEBUG
2968 //if(opcode[i]==0x23)
2969 //if(opcode[i]==0x24)
2970 //if(opcode[i]==0x23||opcode[i]==0x24)
2971 /*if(opcode[i]==0x21||opcode[i]==0x23||opcode[i]==0x24)
2975 emit_readword((int)&last_count,ECX);
2977 if(get_reg(i_regs->regmap,CCREG)<0)
2978 emit_loadreg(CCREG,HOST_CCREG);
2979 emit_add(HOST_CCREG,ECX,HOST_CCREG);
2980 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
2981 emit_writeword(HOST_CCREG,(int)&Count);
2984 if(get_reg(i_regs->regmap,CCREG)<0)
2985 emit_loadreg(CCREG,0);
2987 emit_mov(HOST_CCREG,0);
2989 emit_addimm(0,2*ccadj[i],0);
2990 emit_writeword(0,(int)&Count);
2992 emit_call((int)memdebug);
2994 restore_regs(0x100f);
2998 #ifndef loadlr_assemble
2999 void loadlr_assemble(int i,struct regstat *i_regs)
3001 printf("Need loadlr_assemble for this architecture.\n");
3006 void store_assemble(int i,struct regstat *i_regs)
3011 int jaddr=0,jaddr2,type;
3012 int memtarget=0,c=0;
3013 int agr=AGEN1+(i&1);
3015 th=get_reg(i_regs->regmap,rs2[i]|64);
3016 tl=get_reg(i_regs->regmap,rs2[i]);
3017 s=get_reg(i_regs->regmap,rs1[i]);
3018 temp=get_reg(i_regs->regmap,agr);
3019 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3022 c=(i_regs->wasconst>>s)&1;
3023 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3024 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3028 for(hr=0;hr<HOST_REGS;hr++) {
3029 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3031 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3032 if(offset||s<0||c) addr=temp;
3037 // Strmnnrmn's speed hack
3039 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3041 emit_cmpimm(addr,RAM_SIZE);
3042 #ifdef DESTRUCTIVE_SHIFT
3043 if(s==addr) emit_mov(s,temp);
3046 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3050 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
3051 // Hint to branch predictor that the branch is unlikely to be taken
3053 emit_jno_unlikely(0);
3061 if (opcode[i]==0x28) x=3; // SB
3062 if (opcode[i]==0x29) x=2; // SH
3063 map=get_reg(i_regs->regmap,TLREG);
3065 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3066 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3069 if (opcode[i]==0x28) { // SB
3072 #ifdef BIG_ENDIAN_MIPS
3073 if(!c) emit_xorimm(addr,3,temp);
3074 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3076 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
3077 else if (addr!=temp) emit_mov(addr,temp);
3079 //gen_tlb_addr_w(temp,map);
3080 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3081 emit_writebyte_indexed_tlb(tl,x,temp,map,temp);
3085 if (opcode[i]==0x29) { // SH
3088 #ifdef BIG_ENDIAN_MIPS
3089 if(!c) emit_xorimm(addr,2,temp);
3090 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3092 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
3093 else if (addr!=temp) emit_mov(addr,temp);
3096 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3099 gen_tlb_addr_w(temp,map);
3100 emit_writehword_indexed(tl,x,temp);
3102 emit_writehword_indexed(tl,(int)rdram-0x80000000+x,temp);
3106 if (opcode[i]==0x2B) { // SW
3108 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3109 emit_writeword_indexed_tlb(tl,0,addr,map,temp);
3112 if (opcode[i]==0x3F) { // SD
3116 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3117 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3118 emit_writedword_indexed_tlb(th,tl,0,addr,map,temp);
3121 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3122 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3123 emit_writedword_indexed_tlb(tl,tl,0,addr,map,temp);
3128 if(!using_tlb&&(!c||memtarget))
3129 // addr could be a temp, make sure it survives STORE*_STUB
3132 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3133 } else if(!memtarget) {
3134 inline_writestub(type,i,constmap[i][s]+offset,i_regs->regmap,rs2[i],ccadj[i],reglist);
3138 #ifdef DESTRUCTIVE_SHIFT
3139 // The x86 shift operation is 'destructive'; it overwrites the
3140 // source register, so we need to make a copy first and use that.
3143 #if defined(HOST_IMM8)
3144 int ir=get_reg(i_regs->regmap,INVCP);
3146 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3148 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3152 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3155 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3156 //if(opcode[i]==0x2B || opcode[i]==0x28)
3157 //if(opcode[i]==0x2B || opcode[i]==0x29)
3158 //if(opcode[i]==0x2B)
3159 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3163 emit_readword((int)&last_count,ECX);
3165 if(get_reg(i_regs->regmap,CCREG)<0)
3166 emit_loadreg(CCREG,HOST_CCREG);
3167 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3168 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3169 emit_writeword(HOST_CCREG,(int)&Count);
3172 if(get_reg(i_regs->regmap,CCREG)<0)
3173 emit_loadreg(CCREG,0);
3175 emit_mov(HOST_CCREG,0);
3177 emit_addimm(0,2*ccadj[i],0);
3178 emit_writeword(0,(int)&Count);
3180 emit_call((int)memdebug);
3182 restore_regs(0x100f);
3186 void storelr_assemble(int i,struct regstat *i_regs)
3193 int case1,case2,case3;
3194 int done0,done1,done2;
3196 int agr=AGEN1+(i&1);
3198 th=get_reg(i_regs->regmap,rs2[i]|64);
3199 tl=get_reg(i_regs->regmap,rs2[i]);
3200 s=get_reg(i_regs->regmap,rs1[i]);
3201 temp=get_reg(i_regs->regmap,agr);
3202 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3205 c=(i_regs->isconst>>s)&1;
3206 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3207 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3210 for(hr=0;hr<HOST_REGS;hr++) {
3211 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3217 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3218 if(!offset&&s!=temp) emit_mov(s,temp);
3224 if(!memtarget||!rs1[i]) {
3229 if((u_int)rdram!=0x80000000)
3230 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3232 int map=get_reg(i_regs->regmap,TLREG);
3234 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3235 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3236 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3237 if(!jaddr&&!memtarget) {
3241 gen_tlb_addr_w(temp,map);
3244 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3245 temp2=get_reg(i_regs->regmap,FTEMP);
3246 if(!rs2[i]) temp2=th=tl;
3249 #ifndef BIG_ENDIAN_MIPS
3250 emit_xorimm(temp,3,temp);
3252 emit_testimm(temp,2);
3255 emit_testimm(temp,1);
3259 if (opcode[i]==0x2A) { // SWL
3260 emit_writeword_indexed(tl,0,temp);
3262 if (opcode[i]==0x2E) { // SWR
3263 emit_writebyte_indexed(tl,3,temp);
3265 if (opcode[i]==0x2C) { // SDL
3266 emit_writeword_indexed(th,0,temp);
3267 if(rs2[i]) emit_mov(tl,temp2);
3269 if (opcode[i]==0x2D) { // SDR
3270 emit_writebyte_indexed(tl,3,temp);
3271 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3276 set_jump_target(case1,(int)out);
3277 if (opcode[i]==0x2A) { // SWL
3278 // Write 3 msb into three least significant bytes
3279 if(rs2[i]) emit_rorimm(tl,8,tl);
3280 emit_writehword_indexed(tl,-1,temp);
3281 if(rs2[i]) emit_rorimm(tl,16,tl);
3282 emit_writebyte_indexed(tl,1,temp);
3283 if(rs2[i]) emit_rorimm(tl,8,tl);
3285 if (opcode[i]==0x2E) { // SWR
3286 // Write two lsb into two most significant bytes
3287 emit_writehword_indexed(tl,1,temp);
3289 if (opcode[i]==0x2C) { // SDL
3290 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3291 // Write 3 msb into three least significant bytes
3292 if(rs2[i]) emit_rorimm(th,8,th);
3293 emit_writehword_indexed(th,-1,temp);
3294 if(rs2[i]) emit_rorimm(th,16,th);
3295 emit_writebyte_indexed(th,1,temp);
3296 if(rs2[i]) emit_rorimm(th,8,th);
3298 if (opcode[i]==0x2D) { // SDR
3299 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3300 // Write two lsb into two most significant bytes
3301 emit_writehword_indexed(tl,1,temp);
3306 set_jump_target(case2,(int)out);
3307 emit_testimm(temp,1);
3310 if (opcode[i]==0x2A) { // SWL
3311 // Write two msb into two least significant bytes
3312 if(rs2[i]) emit_rorimm(tl,16,tl);
3313 emit_writehword_indexed(tl,-2,temp);
3314 if(rs2[i]) emit_rorimm(tl,16,tl);
3316 if (opcode[i]==0x2E) { // SWR
3317 // Write 3 lsb into three most significant bytes
3318 emit_writebyte_indexed(tl,-1,temp);
3319 if(rs2[i]) emit_rorimm(tl,8,tl);
3320 emit_writehword_indexed(tl,0,temp);
3321 if(rs2[i]) emit_rorimm(tl,24,tl);
3323 if (opcode[i]==0x2C) { // SDL
3324 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3325 // Write two msb into two least significant bytes
3326 if(rs2[i]) emit_rorimm(th,16,th);
3327 emit_writehword_indexed(th,-2,temp);
3328 if(rs2[i]) emit_rorimm(th,16,th);
3330 if (opcode[i]==0x2D) { // SDR
3331 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3332 // Write 3 lsb into three most significant bytes
3333 emit_writebyte_indexed(tl,-1,temp);
3334 if(rs2[i]) emit_rorimm(tl,8,tl);
3335 emit_writehword_indexed(tl,0,temp);
3336 if(rs2[i]) emit_rorimm(tl,24,tl);
3341 set_jump_target(case3,(int)out);
3342 if (opcode[i]==0x2A) { // SWL
3343 // Write msb into least significant byte
3344 if(rs2[i]) emit_rorimm(tl,24,tl);
3345 emit_writebyte_indexed(tl,-3,temp);
3346 if(rs2[i]) emit_rorimm(tl,8,tl);
3348 if (opcode[i]==0x2E) { // SWR
3349 // Write entire word
3350 emit_writeword_indexed(tl,-3,temp);
3352 if (opcode[i]==0x2C) { // SDL
3353 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3354 // Write msb into least significant byte
3355 if(rs2[i]) emit_rorimm(th,24,th);
3356 emit_writebyte_indexed(th,-3,temp);
3357 if(rs2[i]) emit_rorimm(th,8,th);
3359 if (opcode[i]==0x2D) { // SDR
3360 if(rs2[i]) emit_mov(th,temp2);
3361 // Write entire word
3362 emit_writeword_indexed(tl,-3,temp);
3364 set_jump_target(done0,(int)out);
3365 set_jump_target(done1,(int)out);
3366 set_jump_target(done2,(int)out);
3367 if (opcode[i]==0x2C) { // SDL
3368 emit_testimm(temp,4);
3371 emit_andimm(temp,~3,temp);
3372 emit_writeword_indexed(temp2,4,temp);
3373 set_jump_target(done0,(int)out);
3375 if (opcode[i]==0x2D) { // SDR
3376 emit_testimm(temp,4);
3379 emit_andimm(temp,~3,temp);
3380 emit_writeword_indexed(temp2,-4,temp);
3381 set_jump_target(done0,(int)out);
3384 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3387 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3388 #if defined(HOST_IMM8)
3389 int ir=get_reg(i_regs->regmap,INVCP);
3391 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3393 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3397 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3401 //save_regs(0x100f);
3402 emit_readword((int)&last_count,ECX);
3403 if(get_reg(i_regs->regmap,CCREG)<0)
3404 emit_loadreg(CCREG,HOST_CCREG);
3405 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3406 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3407 emit_writeword(HOST_CCREG,(int)&Count);
3408 emit_call((int)memdebug);
3410 //restore_regs(0x100f);
3414 void c1ls_assemble(int i,struct regstat *i_regs)
3416 #ifndef DISABLE_COP1
3422 int jaddr,jaddr2=0,jaddr3,type;
3423 int agr=AGEN1+(i&1);
3425 th=get_reg(i_regs->regmap,FTEMP|64);
3426 tl=get_reg(i_regs->regmap,FTEMP);
3427 s=get_reg(i_regs->regmap,rs1[i]);
3428 temp=get_reg(i_regs->regmap,agr);
3429 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3434 for(hr=0;hr<HOST_REGS;hr++) {
3435 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3437 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3438 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3440 // Loads use a temporary register which we need to save
3443 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3447 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3448 //else c=(i_regs->wasconst>>s)&1;
3449 if(s>=0) c=(i_regs->wasconst>>s)&1;
3450 // Check cop1 unusable
3452 signed char rs=get_reg(i_regs->regmap,CSREG);
3454 emit_testimm(rs,0x20000000);
3457 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3460 if (opcode[i]==0x39) { // SWC1 (get float address)
3461 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3463 if (opcode[i]==0x3D) { // SDC1 (get double address)
3464 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3466 // Generate address + offset
3469 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3473 map=get_reg(i_regs->regmap,TLREG);
3475 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3476 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3478 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3479 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3482 if (opcode[i]==0x39) { // SWC1 (read float)
3483 emit_readword_indexed(0,tl,tl);
3485 if (opcode[i]==0x3D) { // SDC1 (read double)
3486 emit_readword_indexed(4,tl,th);
3487 emit_readword_indexed(0,tl,tl);
3489 if (opcode[i]==0x31) { // LWC1 (get target address)
3490 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3492 if (opcode[i]==0x35) { // LDC1 (get target address)
3493 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3500 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3502 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3504 #ifdef DESTRUCTIVE_SHIFT
3505 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3506 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3510 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3511 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3513 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3514 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3517 if (opcode[i]==0x31) { // LWC1
3518 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3519 //gen_tlb_addr_r(ar,map);
3520 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3521 #ifdef HOST_IMM_ADDR32
3522 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3525 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3528 if (opcode[i]==0x35) { // LDC1
3530 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3531 //gen_tlb_addr_r(ar,map);
3532 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3533 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3534 #ifdef HOST_IMM_ADDR32
3535 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3538 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3541 if (opcode[i]==0x39) { // SWC1
3542 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3543 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3546 if (opcode[i]==0x3D) { // SDC1
3548 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3549 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3550 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3554 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3555 #ifndef DESTRUCTIVE_SHIFT
3556 temp=offset||c||s<0?ar:s;
3558 #if defined(HOST_IMM8)
3559 int ir=get_reg(i_regs->regmap,INVCP);
3561 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3563 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3567 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3570 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3571 if (opcode[i]==0x31) { // LWC1 (write float)
3572 emit_writeword_indexed(tl,0,temp);
3574 if (opcode[i]==0x35) { // LDC1 (write double)
3575 emit_writeword_indexed(th,4,temp);
3576 emit_writeword_indexed(tl,0,temp);
3578 //if(opcode[i]==0x39)
3579 /*if(opcode[i]==0x39||opcode[i]==0x31)
3582 emit_readword((int)&last_count,ECX);
3583 if(get_reg(i_regs->regmap,CCREG)<0)
3584 emit_loadreg(CCREG,HOST_CCREG);
3585 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3586 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3587 emit_writeword(HOST_CCREG,(int)&Count);
3588 emit_call((int)memdebug);
3592 cop1_unusable(i, i_regs);
3596 void c2ls_assemble(int i,struct regstat *i_regs)
3601 int memtarget=0,c=0;
3602 int jaddr,jaddr2=0,jaddr3,type;
3603 int agr=AGEN1+(i&1);
3605 u_int copr=(source[i]>>16)&0x1f;
3606 s=get_reg(i_regs->regmap,rs1[i]);
3607 tl=get_reg(i_regs->regmap,FTEMP);
3613 for(hr=0;hr<HOST_REGS;hr++) {
3614 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3616 if(i_regs->regmap[HOST_CCREG]==CCREG)
3617 reglist&=~(1<<HOST_CCREG);
3620 if (opcode[i]==0x3a) { // SWC2
3621 ar=get_reg(i_regs->regmap,agr);
3622 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3627 if(s>=0) c=(i_regs->wasconst>>s)&1;
3628 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3629 if (!offset&&!c&&s>=0) ar=s;
3632 if (opcode[i]==0x3a) { // SWC2
3633 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3641 emit_jmp(0); // inline_readstub/inline_writestub?
3645 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3649 if (opcode[i]==0x32) { // LWC2
3650 #ifdef HOST_IMM_ADDR32
3651 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3654 emit_readword_indexed(0,ar,tl);
3656 if (opcode[i]==0x3a) { // SWC2
3657 #ifdef DESTRUCTIVE_SHIFT
3658 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3660 emit_writeword_indexed(tl,0,ar);
3664 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3665 if (opcode[i]==0x3a) { // SWC2
3666 #if defined(HOST_IMM8)
3667 int ir=get_reg(i_regs->regmap,INVCP);
3669 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3671 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3675 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3677 if (opcode[i]==0x32) { // LWC2
3678 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3682 #ifndef multdiv_assemble
3683 void multdiv_assemble(int i,struct regstat *i_regs)
3685 printf("Need multdiv_assemble for this architecture.\n");
3690 void mov_assemble(int i,struct regstat *i_regs)
3692 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3693 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3696 signed char sh,sl,th,tl;
3697 th=get_reg(i_regs->regmap,rt1[i]|64);
3698 tl=get_reg(i_regs->regmap,rt1[i]);
3701 sh=get_reg(i_regs->regmap,rs1[i]|64);
3702 sl=get_reg(i_regs->regmap,rs1[i]);
3703 if(sl>=0) emit_mov(sl,tl);
3704 else emit_loadreg(rs1[i],tl);
3706 if(sh>=0) emit_mov(sh,th);
3707 else emit_loadreg(rs1[i]|64,th);
3713 #ifndef fconv_assemble
3714 void fconv_assemble(int i,struct regstat *i_regs)
3716 printf("Need fconv_assemble for this architecture.\n");
3722 void float_assemble(int i,struct regstat *i_regs)
3724 printf("Need float_assemble for this architecture.\n");
3729 void syscall_assemble(int i,struct regstat *i_regs)
3731 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3732 assert(ccreg==HOST_CCREG);
3733 assert(!is_delayslot);
3734 emit_movimm(start+i*4,EAX); // Get PC
3735 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3736 emit_jmp((int)jump_syscall_hle); // XXX
3739 void hlecall_assemble(int i,struct regstat *i_regs)
3741 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3742 assert(ccreg==HOST_CCREG);
3743 assert(!is_delayslot);
3744 emit_movimm(start+i*4+4,0); // Get PC
3745 emit_movimm((int)psxHLEt[source[i]&7],1);
3746 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // XXX
3747 emit_jmp((int)jump_hlecall);
3750 void ds_assemble(int i,struct regstat *i_regs)
3755 alu_assemble(i,i_regs);break;
3757 imm16_assemble(i,i_regs);break;
3759 shift_assemble(i,i_regs);break;
3761 shiftimm_assemble(i,i_regs);break;
3763 load_assemble(i,i_regs);break;
3765 loadlr_assemble(i,i_regs);break;
3767 store_assemble(i,i_regs);break;
3769 storelr_assemble(i,i_regs);break;
3771 cop0_assemble(i,i_regs);break;
3773 cop1_assemble(i,i_regs);break;
3775 c1ls_assemble(i,i_regs);break;
3777 cop2_assemble(i,i_regs);break;
3779 c2ls_assemble(i,i_regs);break;
3781 c2op_assemble(i,i_regs);break;
3783 fconv_assemble(i,i_regs);break;
3785 float_assemble(i,i_regs);break;
3787 fcomp_assemble(i,i_regs);break;
3789 multdiv_assemble(i,i_regs);break;
3791 mov_assemble(i,i_regs);break;
3800 printf("Jump in the delay slot. This is probably a bug.\n");
3805 // Is the branch target a valid internal jump?
3806 int internal_branch(uint64_t i_is32,int addr)
3808 if(addr&1) return 0; // Indirect (register) jump
3809 if(addr>=start && addr<start+slen*4-4)
3811 int t=(addr-start)>>2;
3812 // Delay slots are not valid branch targets
3813 //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;
3814 // 64 -> 32 bit transition requires a recompile
3815 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
3817 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
3818 else printf("optimizable: yes\n");
3820 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
3821 if(requires_32bit[t]&~i_is32) return 0;
3827 #ifndef wb_invalidate
3828 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
3829 uint64_t u,uint64_t uu)
3832 for(hr=0;hr<HOST_REGS;hr++) {
3833 if(hr!=EXCLUDE_REG) {
3834 if(pre[hr]!=entry[hr]) {
3837 if(get_reg(entry,pre[hr])<0) {
3839 if(!((u>>pre[hr])&1)) {
3840 emit_storereg(pre[hr],hr);
3841 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
3842 emit_sarimm(hr,31,hr);
3843 emit_storereg(pre[hr]|64,hr);
3847 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
3848 emit_storereg(pre[hr],hr);
3857 // Move from one register to another (no writeback)
3858 for(hr=0;hr<HOST_REGS;hr++) {
3859 if(hr!=EXCLUDE_REG) {
3860 if(pre[hr]!=entry[hr]) {
3861 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
3863 if((nr=get_reg(entry,pre[hr]))>=0) {
3873 // Load the specified registers
3874 // This only loads the registers given as arguments because
3875 // we don't want to load things that will be overwritten
3876 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
3880 for(hr=0;hr<HOST_REGS;hr++) {
3881 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
3882 if(entry[hr]!=regmap[hr]) {
3883 if(regmap[hr]==rs1||regmap[hr]==rs2)
3890 emit_loadreg(regmap[hr],hr);
3897 for(hr=0;hr<HOST_REGS;hr++) {
3898 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
3899 if(entry[hr]!=regmap[hr]) {
3900 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
3902 assert(regmap[hr]!=64);
3903 if((is32>>(regmap[hr]&63))&1) {
3904 int lr=get_reg(regmap,regmap[hr]-64);
3906 emit_sarimm(lr,31,hr);
3908 emit_loadreg(regmap[hr],hr);
3912 emit_loadreg(regmap[hr],hr);
3920 // Load registers prior to the start of a loop
3921 // so that they are not loaded within the loop
3922 static void loop_preload(signed char pre[],signed char entry[])
3925 for(hr=0;hr<HOST_REGS;hr++) {
3926 if(hr!=EXCLUDE_REG) {
3927 if(pre[hr]!=entry[hr]) {
3929 if(get_reg(pre,entry[hr])<0) {
3930 assem_debug("loop preload:\n");
3931 //printf("loop preload: %d\n",hr);
3935 else if(entry[hr]<TEMPREG)
3937 emit_loadreg(entry[hr],hr);
3939 else if(entry[hr]-64<TEMPREG)
3941 emit_loadreg(entry[hr],hr);
3950 // Generate address for load/store instruction
3951 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
3952 void address_generation(int i,struct regstat *i_regs,signed char entry[])
3954 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
3956 int agr=AGEN1+(i&1);
3957 int mgr=MGEN1+(i&1);
3958 if(itype[i]==LOAD) {
3959 ra=get_reg(i_regs->regmap,rt1[i]);
3960 //if(rt1[i]) assert(ra>=0);
3962 if(itype[i]==LOADLR) {
3963 ra=get_reg(i_regs->regmap,FTEMP);
3965 if(itype[i]==STORE||itype[i]==STORELR) {
3966 ra=get_reg(i_regs->regmap,agr);
3967 if(ra<0) ra=get_reg(i_regs->regmap,-1);
3969 if(itype[i]==C1LS||itype[i]==C2LS) {
3970 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
3971 ra=get_reg(i_regs->regmap,FTEMP);
3972 else { // SWC1/SDC1/SWC2/SDC2
3973 ra=get_reg(i_regs->regmap,agr);
3974 if(ra<0) ra=get_reg(i_regs->regmap,-1);
3977 int rs=get_reg(i_regs->regmap,rs1[i]);
3978 int rm=get_reg(i_regs->regmap,TLREG);
3981 int c=(i_regs->wasconst>>rs)&1;
3983 // Using r0 as a base address
3985 if(!entry||entry[rm]!=mgr) {
3986 generate_map_const(offset,rm);
3987 } // else did it in the previous cycle
3989 if(!entry||entry[ra]!=agr) {
3990 if (opcode[i]==0x22||opcode[i]==0x26) {
3991 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
3992 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
3993 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
3995 emit_movimm(offset,ra);
3997 } // else did it in the previous cycle
4000 if(!entry||entry[ra]!=rs1[i])
4001 emit_loadreg(rs1[i],ra);
4002 //if(!entry||entry[ra]!=rs1[i])
4003 // printf("poor load scheduling!\n");
4007 if(!entry||entry[rm]!=mgr) {
4008 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4009 // Stores to memory go thru the mapper to detect self-modifying
4010 // code, loads don't.
4011 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4012 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4013 generate_map_const(constmap[i][rs]+offset,rm);
4015 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4016 generate_map_const(constmap[i][rs]+offset,rm);
4020 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4021 if(!entry||entry[ra]!=agr) {
4022 if (opcode[i]==0x22||opcode[i]==0x26) {
4023 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4024 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4025 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4027 #ifdef HOST_IMM_ADDR32
4028 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4029 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4031 emit_movimm(constmap[i][rs]+offset,ra);
4033 } // else did it in the previous cycle
4034 } // else load_consts already did it
4036 if(offset&&!c&&rs1[i]) {
4038 emit_addimm(rs,offset,ra);
4040 emit_addimm(ra,offset,ra);
4045 // Preload constants for next instruction
4046 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) {
4048 #ifndef HOST_IMM_ADDR32
4050 agr=MGEN1+((i+1)&1);
4051 ra=get_reg(i_regs->regmap,agr);
4053 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4054 int offset=imm[i+1];
4055 int c=(regs[i+1].wasconst>>rs)&1;
4057 if(itype[i+1]==STORE||itype[i+1]==STORELR
4058 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4059 // Stores to memory go thru the mapper to detect self-modifying
4060 // code, loads don't.
4061 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4062 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4063 generate_map_const(constmap[i+1][rs]+offset,ra);
4065 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4066 generate_map_const(constmap[i+1][rs]+offset,ra);
4069 /*else if(rs1[i]==0) {
4070 generate_map_const(offset,ra);
4075 agr=AGEN1+((i+1)&1);
4076 ra=get_reg(i_regs->regmap,agr);
4078 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4079 int offset=imm[i+1];
4080 int c=(regs[i+1].wasconst>>rs)&1;
4081 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4082 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4083 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4084 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4085 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4087 #ifdef HOST_IMM_ADDR32
4088 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4089 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4091 emit_movimm(constmap[i+1][rs]+offset,ra);
4094 else if(rs1[i+1]==0) {
4095 // Using r0 as a base address
4096 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4097 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4098 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4099 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4101 emit_movimm(offset,ra);
4108 int get_final_value(int hr, int i, int *value)
4110 int reg=regs[i].regmap[hr];
4112 if(regs[i+1].regmap[hr]!=reg) break;
4113 if(!((regs[i+1].isconst>>hr)&1)) break;
4118 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4119 *value=constmap[i][hr];
4123 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4124 // Load in delay slot, out-of-order execution
4125 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4127 #ifdef HOST_IMM_ADDR32
4128 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4130 // Precompute load address
4131 *value=constmap[i][hr]+imm[i+2];
4135 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4137 #ifdef HOST_IMM_ADDR32
4138 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4140 // Precompute load address
4141 *value=constmap[i][hr]+imm[i+1];
4142 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4147 *value=constmap[i][hr];
4148 //printf("c=%x\n",(int)constmap[i][hr]);
4149 if(i==slen-1) return 1;
4151 return !((unneeded_reg[i+1]>>reg)&1);
4153 return !((unneeded_reg_upper[i+1]>>reg)&1);
4157 // Load registers with known constants
4158 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4162 for(hr=0;hr<HOST_REGS;hr++) {
4163 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4164 //if(entry[hr]!=regmap[hr]) {
4165 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4166 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4168 if(get_final_value(hr,i,&value)) {
4173 emit_movimm(value,hr);
4181 for(hr=0;hr<HOST_REGS;hr++) {
4182 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4183 //if(entry[hr]!=regmap[hr]) {
4184 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4185 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4186 if((is32>>(regmap[hr]&63))&1) {
4187 int lr=get_reg(regmap,regmap[hr]-64);
4189 emit_sarimm(lr,31,hr);
4194 if(get_final_value(hr,i,&value)) {
4199 emit_movimm(value,hr);
4208 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4212 for(hr=0;hr<HOST_REGS;hr++) {
4213 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4214 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4215 int value=constmap[i][hr];
4220 emit_movimm(value,hr);
4226 for(hr=0;hr<HOST_REGS;hr++) {
4227 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4228 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4229 if((is32>>(regmap[hr]&63))&1) {
4230 int lr=get_reg(regmap,regmap[hr]-64);
4232 emit_sarimm(lr,31,hr);
4236 int value=constmap[i][hr];
4241 emit_movimm(value,hr);
4249 // Write out all dirty registers (except cycle count)
4250 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4253 for(hr=0;hr<HOST_REGS;hr++) {
4254 if(hr!=EXCLUDE_REG) {
4255 if(i_regmap[hr]>0) {
4256 if(i_regmap[hr]!=CCREG) {
4257 if((i_dirty>>hr)&1) {
4258 if(i_regmap[hr]<64) {
4259 emit_storereg(i_regmap[hr],hr);
4261 if( ((i_is32>>i_regmap[hr])&1) ) {
4262 #ifdef DESTRUCTIVE_WRITEBACK
4263 emit_sarimm(hr,31,hr);
4264 emit_storereg(i_regmap[hr]|64,hr);
4266 emit_sarimm(hr,31,HOST_TEMPREG);
4267 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4272 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4273 emit_storereg(i_regmap[hr],hr);
4282 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4283 // This writes the registers not written by store_regs_bt
4284 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4287 int t=(addr-start)>>2;
4288 for(hr=0;hr<HOST_REGS;hr++) {
4289 if(hr!=EXCLUDE_REG) {
4290 if(i_regmap[hr]>0) {
4291 if(i_regmap[hr]!=CCREG) {
4292 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)) {
4293 if((i_dirty>>hr)&1) {
4294 if(i_regmap[hr]<64) {
4295 emit_storereg(i_regmap[hr],hr);
4297 if( ((i_is32>>i_regmap[hr])&1) ) {
4298 #ifdef DESTRUCTIVE_WRITEBACK
4299 emit_sarimm(hr,31,hr);
4300 emit_storereg(i_regmap[hr]|64,hr);
4302 emit_sarimm(hr,31,HOST_TEMPREG);
4303 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4308 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4309 emit_storereg(i_regmap[hr],hr);
4320 // Load all registers (except cycle count)
4321 void load_all_regs(signed char i_regmap[])
4324 for(hr=0;hr<HOST_REGS;hr++) {
4325 if(hr!=EXCLUDE_REG) {
4326 if(i_regmap[hr]==0) {
4330 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4332 emit_loadreg(i_regmap[hr],hr);
4338 // Load all current registers also needed by next instruction
4339 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4342 for(hr=0;hr<HOST_REGS;hr++) {
4343 if(hr!=EXCLUDE_REG) {
4344 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4345 if(i_regmap[hr]==0) {
4349 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4351 emit_loadreg(i_regmap[hr],hr);
4358 // Load all regs, storing cycle count if necessary
4359 void load_regs_entry(int t)
4362 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER,HOST_CCREG);
4363 else if(ccadj[t]) emit_addimm(HOST_CCREG,-ccadj[t]*CLOCK_DIVIDER,HOST_CCREG);
4364 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4365 emit_storereg(CCREG,HOST_CCREG);
4368 for(hr=0;hr<HOST_REGS;hr++) {
4369 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4370 if(regs[t].regmap_entry[hr]==0) {
4373 else if(regs[t].regmap_entry[hr]!=CCREG)
4375 emit_loadreg(regs[t].regmap_entry[hr],hr);
4380 for(hr=0;hr<HOST_REGS;hr++) {
4381 if(regs[t].regmap_entry[hr]>=64) {
4382 assert(regs[t].regmap_entry[hr]!=64);
4383 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4384 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4386 emit_loadreg(regs[t].regmap_entry[hr],hr);
4390 emit_sarimm(lr,31,hr);
4395 emit_loadreg(regs[t].regmap_entry[hr],hr);
4401 // Store dirty registers prior to branch
4402 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4404 if(internal_branch(i_is32,addr))
4406 int t=(addr-start)>>2;
4408 for(hr=0;hr<HOST_REGS;hr++) {
4409 if(hr!=EXCLUDE_REG) {
4410 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4411 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)) {
4412 if((i_dirty>>hr)&1) {
4413 if(i_regmap[hr]<64) {
4414 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4415 emit_storereg(i_regmap[hr],hr);
4416 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4417 #ifdef DESTRUCTIVE_WRITEBACK
4418 emit_sarimm(hr,31,hr);
4419 emit_storereg(i_regmap[hr]|64,hr);
4421 emit_sarimm(hr,31,HOST_TEMPREG);
4422 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4427 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4428 emit_storereg(i_regmap[hr],hr);
4439 // Branch out of this block, write out all dirty regs
4440 wb_dirtys(i_regmap,i_is32,i_dirty);
4444 // Load all needed registers for branch target
4445 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4447 //if(addr>=start && addr<(start+slen*4))
4448 if(internal_branch(i_is32,addr))
4450 int t=(addr-start)>>2;
4452 // Store the cycle count before loading something else
4453 if(i_regmap[HOST_CCREG]!=CCREG) {
4454 assert(i_regmap[HOST_CCREG]==-1);
4456 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4457 emit_storereg(CCREG,HOST_CCREG);
4460 for(hr=0;hr<HOST_REGS;hr++) {
4461 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4462 #ifdef DESTRUCTIVE_WRITEBACK
4463 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)) {
4465 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4467 if(regs[t].regmap_entry[hr]==0) {
4470 else if(regs[t].regmap_entry[hr]!=CCREG)
4472 emit_loadreg(regs[t].regmap_entry[hr],hr);
4478 for(hr=0;hr<HOST_REGS;hr++) {
4479 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64) {
4480 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4481 assert(regs[t].regmap_entry[hr]!=64);
4482 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4483 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4485 emit_loadreg(regs[t].regmap_entry[hr],hr);
4489 emit_sarimm(lr,31,hr);
4494 emit_loadreg(regs[t].regmap_entry[hr],hr);
4497 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4498 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4500 emit_sarimm(lr,31,hr);
4507 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4509 if(addr>=start && addr<start+slen*4-4)
4511 int t=(addr-start)>>2;
4513 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4514 for(hr=0;hr<HOST_REGS;hr++)
4518 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4520 if(regs[t].regmap_entry[hr]!=-1)
4529 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4534 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4539 else // Same register but is it 32-bit or dirty?
4542 if(!((regs[t].dirty>>hr)&1))
4546 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4548 //printf("%x: dirty no match\n",addr);
4553 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4555 //printf("%x: is32 no match\n",addr);
4561 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4562 if(requires_32bit[t]&~i_is32) return 0;
4563 // Delay slots are not valid branch targets
4564 //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;
4565 // Delay slots require additional processing, so do not match
4566 if(is_ds[t]) return 0;
4571 for(hr=0;hr<HOST_REGS;hr++)
4577 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4591 // Used when a branch jumps into the delay slot of another branch
4592 void ds_assemble_entry(int i)
4594 int t=(ba[i]-start)>>2;
4595 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4596 assem_debug("Assemble delay slot at %x\n",ba[i]);
4597 assem_debug("<->\n");
4598 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4599 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4600 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4601 address_generation(t,®s[t],regs[t].regmap_entry);
4602 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4603 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4608 alu_assemble(t,®s[t]);break;
4610 imm16_assemble(t,®s[t]);break;
4612 shift_assemble(t,®s[t]);break;
4614 shiftimm_assemble(t,®s[t]);break;
4616 load_assemble(t,®s[t]);break;
4618 loadlr_assemble(t,®s[t]);break;
4620 store_assemble(t,®s[t]);break;
4622 storelr_assemble(t,®s[t]);break;
4624 cop0_assemble(t,®s[t]);break;
4626 cop1_assemble(t,®s[t]);break;
4628 c1ls_assemble(t,®s[t]);break;
4630 cop2_assemble(t,®s[t]);break;
4632 c2ls_assemble(t,®s[t]);break;
4634 c2op_assemble(t,®s[t]);break;
4636 fconv_assemble(t,®s[t]);break;
4638 float_assemble(t,®s[t]);break;
4640 fcomp_assemble(t,®s[t]);break;
4642 multdiv_assemble(t,®s[t]);break;
4644 mov_assemble(t,®s[t]);break;
4653 printf("Jump in the delay slot. This is probably a bug.\n");
4655 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4656 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4657 if(internal_branch(regs[t].is32,ba[i]+4))
4658 assem_debug("branch: internal\n");
4660 assem_debug("branch: external\n");
4661 assert(internal_branch(regs[t].is32,ba[i]+4));
4662 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4666 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4675 //if(ba[i]>=start && ba[i]<(start+slen*4))
4676 if(internal_branch(branch_regs[i].is32,ba[i]))
4678 int t=(ba[i]-start)>>2;
4679 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4687 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4689 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4691 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4692 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4696 else if(*adj==0||invert) {
4697 emit_addimm_and_set_flags(CLOCK_DIVIDER*(count+2),HOST_CCREG);
4703 emit_cmpimm(HOST_CCREG,-2*(count+2));
4707 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4710 void do_ccstub(int n)
4713 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4714 set_jump_target(stubs[n][1],(int)out);
4716 if(stubs[n][6]==NULLDS) {
4717 // Delay slot instruction is nullified ("likely" branch)
4718 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4720 else if(stubs[n][6]!=TAKEN) {
4721 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4724 if(internal_branch(branch_regs[i].is32,ba[i]))
4725 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4729 // Save PC as return address
4730 emit_movimm(stubs[n][5],EAX);
4731 emit_writeword(EAX,(int)&pcaddr);
4735 // Return address depends on which way the branch goes
4736 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4738 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4739 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4740 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4741 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
4751 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
4755 #ifdef DESTRUCTIVE_WRITEBACK
4757 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
4758 emit_loadreg(rs1[i],s1l);
4761 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
4762 emit_loadreg(rs2[i],s1l);
4765 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
4766 emit_loadreg(rs2[i],s2l);
4769 int addr,alt,ntaddr;
4772 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4773 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4774 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4782 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4783 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4784 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4790 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
4794 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4795 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4796 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4802 assert(hr<HOST_REGS);
4804 if((opcode[i]&0x2f)==4) // BEQ
4806 #ifdef HAVE_CMOV_IMM
4808 if(s2l>=0) emit_cmp(s1l,s2l);
4809 else emit_test(s1l,s1l);
4810 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
4815 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4817 if(s2h>=0) emit_cmp(s1h,s2h);
4818 else emit_test(s1h,s1h);
4819 emit_cmovne_reg(alt,addr);
4821 if(s2l>=0) emit_cmp(s1l,s2l);
4822 else emit_test(s1l,s1l);
4823 emit_cmovne_reg(alt,addr);
4826 if((opcode[i]&0x2f)==5) // BNE
4828 #ifdef HAVE_CMOV_IMM
4830 if(s2l>=0) emit_cmp(s1l,s2l);
4831 else emit_test(s1l,s1l);
4832 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
4837 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
4839 if(s2h>=0) emit_cmp(s1h,s2h);
4840 else emit_test(s1h,s1h);
4841 emit_cmovne_reg(alt,addr);
4843 if(s2l>=0) emit_cmp(s1l,s2l);
4844 else emit_test(s1l,s1l);
4845 emit_cmovne_reg(alt,addr);
4848 if((opcode[i]&0x2f)==6) // BLEZ
4850 //emit_movimm(ba[i],alt);
4851 //emit_movimm(start+i*4+8,addr);
4852 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4854 if(s1h>=0) emit_mov(addr,ntaddr);
4855 emit_cmovl_reg(alt,addr);
4858 emit_cmovne_reg(ntaddr,addr);
4859 emit_cmovs_reg(alt,addr);
4862 if((opcode[i]&0x2f)==7) // BGTZ
4864 //emit_movimm(ba[i],addr);
4865 //emit_movimm(start+i*4+8,ntaddr);
4866 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
4868 if(s1h>=0) emit_mov(addr,alt);
4869 emit_cmovl_reg(ntaddr,addr);
4872 emit_cmovne_reg(alt,addr);
4873 emit_cmovs_reg(ntaddr,addr);
4876 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
4878 //emit_movimm(ba[i],alt);
4879 //emit_movimm(start+i*4+8,addr);
4880 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4881 if(s1h>=0) emit_test(s1h,s1h);
4882 else emit_test(s1l,s1l);
4883 emit_cmovs_reg(alt,addr);
4885 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
4887 //emit_movimm(ba[i],addr);
4888 //emit_movimm(start+i*4+8,alt);
4889 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4890 if(s1h>=0) emit_test(s1h,s1h);
4891 else emit_test(s1l,s1l);
4892 emit_cmovs_reg(alt,addr);
4894 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
4895 if(source[i]&0x10000) // BC1T
4897 //emit_movimm(ba[i],alt);
4898 //emit_movimm(start+i*4+8,addr);
4899 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4900 emit_testimm(s1l,0x800000);
4901 emit_cmovne_reg(alt,addr);
4905 //emit_movimm(ba[i],addr);
4906 //emit_movimm(start+i*4+8,alt);
4907 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4908 emit_testimm(s1l,0x800000);
4909 emit_cmovne_reg(alt,addr);
4912 emit_writeword(addr,(int)&pcaddr);
4917 int r=get_reg(branch_regs[i].regmap,rs1[i]);
4918 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
4919 r=get_reg(branch_regs[i].regmap,RTEMP);
4921 emit_writeword(r,(int)&pcaddr);
4923 else {printf("Unknown branch type in do_ccstub\n");exit(1);}
4925 // Update cycle count
4926 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
4927 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
4928 emit_call((int)cc_interrupt);
4929 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
4930 if(stubs[n][6]==TAKEN) {
4931 if(internal_branch(branch_regs[i].is32,ba[i]))
4932 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
4933 else if(itype[i]==RJUMP) {
4934 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
4935 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
4937 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
4939 }else if(stubs[n][6]==NOTTAKEN) {
4940 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
4941 else load_all_regs(branch_regs[i].regmap);
4942 }else if(stubs[n][6]==NULLDS) {
4943 // Delay slot instruction is nullified ("likely" branch)
4944 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
4945 else load_all_regs(regs[i].regmap);
4947 load_all_regs(branch_regs[i].regmap);
4949 emit_jmp(stubs[n][2]); // return address
4951 /* This works but uses a lot of memory...
4952 emit_readword((int)&last_count,ECX);
4953 emit_add(HOST_CCREG,ECX,EAX);
4954 emit_writeword(EAX,(int)&Count);
4955 emit_call((int)gen_interupt);
4956 emit_readword((int)&Count,HOST_CCREG);
4957 emit_readword((int)&next_interupt,EAX);
4958 emit_readword((int)&pending_exception,EBX);
4959 emit_writeword(EAX,(int)&last_count);
4960 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
4962 int jne_instr=(int)out;
4964 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
4965 load_all_regs(branch_regs[i].regmap);
4966 emit_jmp(stubs[n][2]); // return address
4967 set_jump_target(jne_instr,(int)out);
4968 emit_readword((int)&pcaddr,EAX);
4969 // Call get_addr_ht instead of doing the hash table here.
4970 // This code is executed infrequently and takes up a lot of space
4971 // so smaller is better.
4972 emit_storereg(CCREG,HOST_CCREG);
4974 emit_call((int)get_addr_ht);
4975 emit_loadreg(CCREG,HOST_CCREG);
4976 emit_addimm(ESP,4,ESP);
4980 add_to_linker(int addr,int target,int ext)
4982 link_addr[linkcount][0]=addr;
4983 link_addr[linkcount][1]=target;
4984 link_addr[linkcount][2]=ext;
4988 void ujump_assemble(int i,struct regstat *i_regs)
4990 signed char *i_regmap=i_regs->regmap;
4991 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
4992 address_generation(i+1,i_regs,regs[i].regmap_entry);
4994 int temp=get_reg(branch_regs[i].regmap,PTEMP);
4995 if(rt1[i]==31&&temp>=0)
4997 int return_address=start+i*4+8;
4998 if(get_reg(branch_regs[i].regmap,31)>0)
4999 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5002 ds_assemble(i+1,i_regs);
5003 uint64_t bc_unneeded=branch_regs[i].u;
5004 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5005 bc_unneeded|=1|(1LL<<rt1[i]);
5006 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5007 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5008 bc_unneeded,bc_unneeded_upper);
5009 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5012 unsigned int return_address;
5013 assert(rt1[i+1]!=31);
5014 assert(rt2[i+1]!=31);
5015 rt=get_reg(branch_regs[i].regmap,31);
5016 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]);
5018 return_address=start+i*4+8;
5021 if(internal_branch(branch_regs[i].is32,return_address)) {
5023 if(temp==EXCLUDE_REG||temp>=HOST_REGS||
5024 branch_regs[i].regmap[temp]>=0)
5026 temp=get_reg(branch_regs[i].regmap,-1);
5029 if(temp<0) temp=HOST_TEMPREG;
5031 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5032 else emit_movimm(return_address,rt);
5040 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5043 emit_movimm(return_address,rt); // PC into link register
5045 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5051 cc=get_reg(branch_regs[i].regmap,CCREG);
5052 assert(cc==HOST_CCREG);
5053 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5055 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5057 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5058 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5059 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5060 if(internal_branch(branch_regs[i].is32,ba[i]))
5061 assem_debug("branch: internal\n");
5063 assem_debug("branch: external\n");
5064 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5065 ds_assemble_entry(i);
5068 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5073 void rjump_assemble(int i,struct regstat *i_regs)
5075 signed char *i_regmap=i_regs->regmap;
5078 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5080 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5081 // Delay slot abuse, make a copy of the branch address register
5082 temp=get_reg(branch_regs[i].regmap,RTEMP);
5084 assert(regs[i].regmap[temp]==RTEMP);
5088 address_generation(i+1,i_regs,regs[i].regmap_entry);
5092 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5093 int return_address=start+i*4+8;
5094 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5100 int rh=get_reg(regs[i].regmap,RHASH);
5101 if(rh>=0) do_preload_rhash(rh);
5104 ds_assemble(i+1,i_regs);
5105 uint64_t bc_unneeded=branch_regs[i].u;
5106 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5107 bc_unneeded|=1|(1LL<<rt1[i]);
5108 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5109 bc_unneeded&=~(1LL<<rs1[i]);
5110 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5111 bc_unneeded,bc_unneeded_upper);
5112 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5114 int rt,return_address;
5115 assert(rt1[i+1]!=rt1[i]);
5116 assert(rt2[i+1]!=rt1[i]);
5117 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5118 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]);
5120 return_address=start+i*4+8;
5124 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5127 emit_movimm(return_address,rt); // PC into link register
5129 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5132 cc=get_reg(branch_regs[i].regmap,CCREG);
5133 assert(cc==HOST_CCREG);
5135 int rh=get_reg(branch_regs[i].regmap,RHASH);
5136 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5138 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5139 do_preload_rhtbl(ht);
5143 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5144 #ifdef DESTRUCTIVE_WRITEBACK
5145 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5146 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5147 emit_loadreg(rs1[i],rs);
5152 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5156 do_miniht_load(ht,rh);
5159 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5160 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5162 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5163 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5165 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5168 do_miniht_jump(rs,rh,ht);
5173 //if(rs!=EAX) emit_mov(rs,EAX);
5174 //emit_jmp((int)jump_vaddr_eax);
5175 emit_jmp(jump_vaddr_reg[rs]);
5180 emit_shrimm(rs,16,rs);
5181 emit_xor(temp,rs,rs);
5182 emit_movzwl_reg(rs,rs);
5183 emit_shlimm(rs,4,rs);
5184 emit_cmpmem_indexed((int)hash_table,rs,temp);
5185 emit_jne((int)out+14);
5186 emit_readword_indexed((int)hash_table+4,rs,rs);
5188 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5189 emit_addimm_no_flags(8,rs);
5190 emit_jeq((int)out-17);
5191 // No hit on hash table, call compiler
5194 #ifdef DEBUG_CYCLE_COUNT
5195 emit_readword((int)&last_count,ECX);
5196 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5197 emit_readword((int)&next_interupt,ECX);
5198 emit_writeword(HOST_CCREG,(int)&Count);
5199 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5200 emit_writeword(ECX,(int)&last_count);
5203 emit_storereg(CCREG,HOST_CCREG);
5204 emit_call((int)get_addr);
5205 emit_loadreg(CCREG,HOST_CCREG);
5206 emit_addimm(ESP,4,ESP);
5208 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5209 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5213 void cjump_assemble(int i,struct regstat *i_regs)
5215 signed char *i_regmap=i_regs->regmap;
5218 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5219 assem_debug("match=%d\n",match);
5220 int s1h,s1l,s2h,s2l;
5221 int prev_cop1_usable=cop1_usable;
5222 int unconditional=0,nop=0;
5226 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5227 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5228 if(likely[i]) ooo=0;
5229 if(!match) invert=1;
5230 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5231 if(i>(ba[i]-start)>>2) invert=1;
5235 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
5236 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1])))
5238 // Write-after-read dependency prevents out of order execution
5239 // First test branch condition, then execute delay slot, then branch
5244 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5245 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5246 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5247 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5250 s1l=get_reg(i_regmap,rs1[i]);
5251 s1h=get_reg(i_regmap,rs1[i]|64);
5252 s2l=get_reg(i_regmap,rs2[i]);
5253 s2h=get_reg(i_regmap,rs2[i]|64);
5255 if(rs1[i]==0&&rs2[i]==0)
5257 if(opcode[i]&1) nop=1;
5258 else unconditional=1;
5259 //assert(opcode[i]!=5);
5260 //assert(opcode[i]!=7);
5261 //assert(opcode[i]!=0x15);
5262 //assert(opcode[i]!=0x17);
5268 only32=(regs[i].was32>>rs2[i])&1;
5273 only32=(regs[i].was32>>rs1[i])&1;
5276 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5280 // Out of order execution (delay slot first)
5282 address_generation(i+1,i_regs,regs[i].regmap_entry);
5283 ds_assemble(i+1,i_regs);
5285 uint64_t bc_unneeded=branch_regs[i].u;
5286 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5287 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5288 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5290 bc_unneeded_upper|=1;
5291 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5292 bc_unneeded,bc_unneeded_upper);
5293 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5294 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5295 cc=get_reg(branch_regs[i].regmap,CCREG);
5296 assert(cc==HOST_CCREG);
5298 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5299 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5300 //assem_debug("cycle count (adj)\n");
5302 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5303 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5304 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5305 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5307 assem_debug("branch: internal\n");
5309 assem_debug("branch: external\n");
5310 if(internal&&is_ds[(ba[i]-start)>>2]) {
5311 ds_assemble_entry(i);
5314 add_to_linker((int)out,ba[i],internal);
5317 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5318 if(((u_int)out)&7) emit_addnop(0);
5323 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5326 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5329 int taken=0,nottaken=0,nottaken1=0;
5330 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5331 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5335 if(opcode[i]==4) // BEQ
5337 if(s2h>=0) emit_cmp(s1h,s2h);
5338 else emit_test(s1h,s1h);
5342 if(opcode[i]==5) // BNE
5344 if(s2h>=0) emit_cmp(s1h,s2h);
5345 else emit_test(s1h,s1h);
5346 if(invert) taken=(int)out;
5347 else add_to_linker((int)out,ba[i],internal);
5350 if(opcode[i]==6) // BLEZ
5353 if(invert) taken=(int)out;
5354 else add_to_linker((int)out,ba[i],internal);
5359 if(opcode[i]==7) // BGTZ
5364 if(invert) taken=(int)out;
5365 else add_to_linker((int)out,ba[i],internal);
5370 //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]);
5372 if(opcode[i]==4) // BEQ
5374 if(s2l>=0) emit_cmp(s1l,s2l);
5375 else emit_test(s1l,s1l);
5380 add_to_linker((int)out,ba[i],internal);
5384 if(opcode[i]==5) // BNE
5386 if(s2l>=0) emit_cmp(s1l,s2l);
5387 else emit_test(s1l,s1l);
5392 add_to_linker((int)out,ba[i],internal);
5396 if(opcode[i]==6) // BLEZ
5403 add_to_linker((int)out,ba[i],internal);
5407 if(opcode[i]==7) // BGTZ
5414 add_to_linker((int)out,ba[i],internal);
5419 if(taken) set_jump_target(taken,(int)out);
5420 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5421 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5423 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5424 add_to_linker((int)out,ba[i],internal);
5427 add_to_linker((int)out,ba[i],internal*2);
5433 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5434 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5435 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5437 assem_debug("branch: internal\n");
5439 assem_debug("branch: external\n");
5440 if(internal&&is_ds[(ba[i]-start)>>2]) {
5441 ds_assemble_entry(i);
5444 add_to_linker((int)out,ba[i],internal);
5448 set_jump_target(nottaken,(int)out);
5451 if(nottaken1) set_jump_target(nottaken1,(int)out);
5453 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5455 } // (!unconditional)
5459 // In-order execution (branch first)
5460 //if(likely[i]) printf("IOL\n");
5463 int taken=0,nottaken=0,nottaken1=0;
5464 if(!unconditional&&!nop) {
5468 if((opcode[i]&0x2f)==4) // BEQ
5470 if(s2h>=0) emit_cmp(s1h,s2h);
5471 else emit_test(s1h,s1h);
5475 if((opcode[i]&0x2f)==5) // BNE
5477 if(s2h>=0) emit_cmp(s1h,s2h);
5478 else emit_test(s1h,s1h);
5482 if((opcode[i]&0x2f)==6) // BLEZ
5490 if((opcode[i]&0x2f)==7) // BGTZ
5500 //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]);
5502 if((opcode[i]&0x2f)==4) // BEQ
5504 if(s2l>=0) emit_cmp(s1l,s2l);
5505 else emit_test(s1l,s1l);
5509 if((opcode[i]&0x2f)==5) // BNE
5511 if(s2l>=0) emit_cmp(s1l,s2l);
5512 else emit_test(s1l,s1l);
5516 if((opcode[i]&0x2f)==6) // BLEZ
5522 if((opcode[i]&0x2f)==7) // BGTZ
5528 } // if(!unconditional)
5530 uint64_t ds_unneeded=branch_regs[i].u;
5531 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5532 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5533 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5534 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5536 ds_unneeded_upper|=1;
5539 if(taken) set_jump_target(taken,(int)out);
5540 assem_debug("1:\n");
5541 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5542 ds_unneeded,ds_unneeded_upper);
5544 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5545 address_generation(i+1,&branch_regs[i],0);
5546 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5547 ds_assemble(i+1,&branch_regs[i]);
5548 cc=get_reg(branch_regs[i].regmap,CCREG);
5550 emit_loadreg(CCREG,cc=HOST_CCREG);
5551 // CHECK: Is the following instruction (fall thru) allocated ok?
5553 assert(cc==HOST_CCREG);
5554 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5555 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5556 assem_debug("cycle count (adj)\n");
5557 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5558 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5560 assem_debug("branch: internal\n");
5562 assem_debug("branch: external\n");
5563 if(internal&&is_ds[(ba[i]-start)>>2]) {
5564 ds_assemble_entry(i);
5567 add_to_linker((int)out,ba[i],internal);
5572 cop1_usable=prev_cop1_usable;
5573 if(!unconditional) {
5574 if(nottaken1) set_jump_target(nottaken1,(int)out);
5575 set_jump_target(nottaken,(int)out);
5576 assem_debug("2:\n");
5578 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5579 ds_unneeded,ds_unneeded_upper);
5580 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5581 address_generation(i+1,&branch_regs[i],0);
5582 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5583 ds_assemble(i+1,&branch_regs[i]);
5585 cc=get_reg(branch_regs[i].regmap,CCREG);
5586 if(cc==-1&&!likely[i]) {
5587 // Cycle count isn't in a register, temporarily load it then write it out
5588 emit_loadreg(CCREG,HOST_CCREG);
5589 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5592 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5593 emit_storereg(CCREG,HOST_CCREG);
5596 cc=get_reg(i_regmap,CCREG);
5597 assert(cc==HOST_CCREG);
5598 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5601 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5607 void sjump_assemble(int i,struct regstat *i_regs)
5609 signed char *i_regmap=i_regs->regmap;
5612 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5613 assem_debug("smatch=%d\n",match);
5615 int prev_cop1_usable=cop1_usable;
5616 int unconditional=0,nevertaken=0;
5620 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5621 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5622 if(likely[i]) ooo=0;
5623 if(!match) invert=1;
5624 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5625 if(i>(ba[i]-start)>>2) invert=1;
5628 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5629 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5632 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))
5634 // Write-after-read dependency prevents out of order execution
5635 // First test branch condition, then execute delay slot, then branch
5638 assert(opcode2[i]<0x10||ooo); // FIXME (BxxZALL)
5641 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5642 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5645 s1l=get_reg(i_regmap,rs1[i]);
5646 s1h=get_reg(i_regmap,rs1[i]|64);
5650 if(opcode2[i]&1) unconditional=1;
5652 // These are never taken (r0 is never less than zero)
5653 //assert(opcode2[i]!=0);
5654 //assert(opcode2[i]!=2);
5655 //assert(opcode2[i]!=0x10);
5656 //assert(opcode2[i]!=0x12);
5659 only32=(regs[i].was32>>rs1[i])&1;
5663 // Out of order execution (delay slot first)
5665 address_generation(i+1,i_regs,regs[i].regmap_entry);
5666 ds_assemble(i+1,i_regs);
5668 uint64_t bc_unneeded=branch_regs[i].u;
5669 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5670 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5671 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5673 bc_unneeded_upper|=1;
5674 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5675 bc_unneeded,bc_unneeded_upper);
5676 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5677 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5679 int rt,return_address;
5680 assert(rt1[i+1]!=31);
5681 assert(rt2[i+1]!=31);
5682 rt=get_reg(branch_regs[i].regmap,31);
5683 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]);
5685 // Save the PC even if the branch is not taken
5686 return_address=start+i*4+8;
5687 emit_movimm(return_address,rt); // PC into link register
5689 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5693 cc=get_reg(branch_regs[i].regmap,CCREG);
5694 assert(cc==HOST_CCREG);
5696 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5697 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5698 assem_debug("cycle count (adj)\n");
5700 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5701 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5702 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5703 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5705 assem_debug("branch: internal\n");
5707 assem_debug("branch: external\n");
5708 if(internal&&is_ds[(ba[i]-start)>>2]) {
5709 ds_assemble_entry(i);
5712 add_to_linker((int)out,ba[i],internal);
5715 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5716 if(((u_int)out)&7) emit_addnop(0);
5720 else if(nevertaken) {
5721 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5724 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5728 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5729 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5733 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5740 add_to_linker((int)out,ba[i],internal);
5744 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5751 add_to_linker((int)out,ba[i],internal);
5759 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5766 add_to_linker((int)out,ba[i],internal);
5770 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5777 add_to_linker((int)out,ba[i],internal);
5784 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5785 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5787 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5788 add_to_linker((int)out,ba[i],internal);
5791 add_to_linker((int)out,ba[i],internal*2);
5797 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5798 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5799 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5801 assem_debug("branch: internal\n");
5803 assem_debug("branch: external\n");
5804 if(internal&&is_ds[(ba[i]-start)>>2]) {
5805 ds_assemble_entry(i);
5808 add_to_linker((int)out,ba[i],internal);
5812 set_jump_target(nottaken,(int)out);
5816 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5818 } // (!unconditional)
5822 // In-order execution (branch first)
5825 if(!unconditional) {
5826 //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]);
5830 if((opcode2[i]&0x1d)==0) // BLTZ/BLTZL
5836 if((opcode2[i]&0x1d)==1) // BGEZ/BGEZL
5846 if((opcode2[i]&0x1d)==0) // BLTZ/BLTZL
5852 if((opcode2[i]&0x1d)==1) // BGEZ/BGEZL
5859 } // if(!unconditional)
5861 uint64_t ds_unneeded=branch_regs[i].u;
5862 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5863 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5864 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5865 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5867 ds_unneeded_upper|=1;
5870 //assem_debug("1:\n");
5871 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5872 ds_unneeded,ds_unneeded_upper);
5874 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5875 address_generation(i+1,&branch_regs[i],0);
5876 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5877 ds_assemble(i+1,&branch_regs[i]);
5878 cc=get_reg(branch_regs[i].regmap,CCREG);
5880 emit_loadreg(CCREG,cc=HOST_CCREG);
5881 // CHECK: Is the following instruction (fall thru) allocated ok?
5883 assert(cc==HOST_CCREG);
5884 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5885 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5886 assem_debug("cycle count (adj)\n");
5887 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5888 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5890 assem_debug("branch: internal\n");
5892 assem_debug("branch: external\n");
5893 if(internal&&is_ds[(ba[i]-start)>>2]) {
5894 ds_assemble_entry(i);
5897 add_to_linker((int)out,ba[i],internal);
5902 cop1_usable=prev_cop1_usable;
5903 if(!unconditional) {
5904 set_jump_target(nottaken,(int)out);
5905 assem_debug("1:\n");
5907 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5908 ds_unneeded,ds_unneeded_upper);
5909 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5910 address_generation(i+1,&branch_regs[i],0);
5911 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5912 ds_assemble(i+1,&branch_regs[i]);
5914 cc=get_reg(branch_regs[i].regmap,CCREG);
5915 if(cc==-1&&!likely[i]) {
5916 // Cycle count isn't in a register, temporarily load it then write it out
5917 emit_loadreg(CCREG,HOST_CCREG);
5918 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5921 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5922 emit_storereg(CCREG,HOST_CCREG);
5925 cc=get_reg(i_regmap,CCREG);
5926 assert(cc==HOST_CCREG);
5927 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5930 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5936 void fjump_assemble(int i,struct regstat *i_regs)
5938 signed char *i_regmap=i_regs->regmap;
5941 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5942 assem_debug("fmatch=%d\n",match);
5947 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5948 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5949 if(likely[i]) ooo=0;
5950 if(!match) invert=1;
5951 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5952 if(i>(ba[i]-start)>>2) invert=1;
5956 if(itype[i+1]==FCOMP)
5958 // Write-after-read dependency prevents out of order execution
5959 // First test branch condition, then execute delay slot, then branch
5964 fs=get_reg(branch_regs[i].regmap,FSREG);
5965 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
5968 fs=get_reg(i_regmap,FSREG);
5971 // Check cop1 unusable
5973 cs=get_reg(i_regmap,CSREG);
5975 emit_testimm(cs,0x20000000);
5978 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
5983 // Out of order execution (delay slot first)
5985 ds_assemble(i+1,i_regs);
5987 uint64_t bc_unneeded=branch_regs[i].u;
5988 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5989 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5990 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5992 bc_unneeded_upper|=1;
5993 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5994 bc_unneeded,bc_unneeded_upper);
5995 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5996 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5997 cc=get_reg(branch_regs[i].regmap,CCREG);
5998 assert(cc==HOST_CCREG);
5999 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6000 assem_debug("cycle count (adj)\n");
6003 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6006 emit_testimm(fs,0x800000);
6007 if(source[i]&0x10000) // BC1T
6013 add_to_linker((int)out,ba[i],internal);
6022 add_to_linker((int)out,ba[i],internal);
6030 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
6031 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6032 else if(match) emit_addnop(13);
6034 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6035 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6037 assem_debug("branch: internal\n");
6039 assem_debug("branch: external\n");
6040 if(internal&&is_ds[(ba[i]-start)>>2]) {
6041 ds_assemble_entry(i);
6044 add_to_linker((int)out,ba[i],internal);
6047 set_jump_target(nottaken,(int)out);
6051 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
6053 } // (!unconditional)
6057 // In-order execution (branch first)
6061 //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]);
6064 emit_testimm(fs,0x800000);
6065 if(source[i]&0x10000) // BC1T
6076 } // if(!unconditional)
6078 uint64_t ds_unneeded=branch_regs[i].u;
6079 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6080 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6081 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6082 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6084 ds_unneeded_upper|=1;
6086 //assem_debug("1:\n");
6087 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6088 ds_unneeded,ds_unneeded_upper);
6090 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6091 address_generation(i+1,&branch_regs[i],0);
6092 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6093 ds_assemble(i+1,&branch_regs[i]);
6094 cc=get_reg(branch_regs[i].regmap,CCREG);
6096 emit_loadreg(CCREG,cc=HOST_CCREG);
6097 // CHECK: Is the following instruction (fall thru) allocated ok?
6099 assert(cc==HOST_CCREG);
6100 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6101 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6102 assem_debug("cycle count (adj)\n");
6103 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6104 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6106 assem_debug("branch: internal\n");
6108 assem_debug("branch: external\n");
6109 if(internal&&is_ds[(ba[i]-start)>>2]) {
6110 ds_assemble_entry(i);
6113 add_to_linker((int)out,ba[i],internal);
6118 if(1) { // <- FIXME (don't need this)
6119 set_jump_target(nottaken,(int)out);
6120 assem_debug("1:\n");
6122 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6123 ds_unneeded,ds_unneeded_upper);
6124 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6125 address_generation(i+1,&branch_regs[i],0);
6126 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6127 ds_assemble(i+1,&branch_regs[i]);
6129 cc=get_reg(branch_regs[i].regmap,CCREG);
6130 if(cc==-1&&!likely[i]) {
6131 // Cycle count isn't in a register, temporarily load it then write it out
6132 emit_loadreg(CCREG,HOST_CCREG);
6133 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6136 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6137 emit_storereg(CCREG,HOST_CCREG);
6140 cc=get_reg(i_regmap,CCREG);
6141 assert(cc==HOST_CCREG);
6142 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6145 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6151 static void pagespan_assemble(int i,struct regstat *i_regs)
6153 int s1l=get_reg(i_regs->regmap,rs1[i]);
6154 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6155 int s2l=get_reg(i_regs->regmap,rs2[i]);
6156 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6157 void *nt_branch=NULL;
6160 int unconditional=0;
6170 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6174 int addr,alt,ntaddr;
6175 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6179 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6180 (i_regs->regmap[hr]&63)!=rs1[i] &&
6181 (i_regs->regmap[hr]&63)!=rs2[i] )
6190 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6191 (i_regs->regmap[hr]&63)!=rs1[i] &&
6192 (i_regs->regmap[hr]&63)!=rs2[i] )
6198 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6202 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6203 (i_regs->regmap[hr]&63)!=rs1[i] &&
6204 (i_regs->regmap[hr]&63)!=rs2[i] )
6211 assert(hr<HOST_REGS);
6212 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6213 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6215 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6216 if(opcode[i]==2) // J
6220 if(opcode[i]==3) // JAL
6223 int rt=get_reg(i_regs->regmap,31);
6224 emit_movimm(start+i*4+8,rt);
6227 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6230 if(opcode2[i]==9) // JALR
6232 int rt=get_reg(i_regs->regmap,rt1[i]);
6233 emit_movimm(start+i*4+8,rt);
6236 if((opcode[i]&0x3f)==4) // BEQ
6243 #ifdef HAVE_CMOV_IMM
6245 if(s2l>=0) emit_cmp(s1l,s2l);
6246 else emit_test(s1l,s1l);
6247 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6253 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6255 if(s2h>=0) emit_cmp(s1h,s2h);
6256 else emit_test(s1h,s1h);
6257 emit_cmovne_reg(alt,addr);
6259 if(s2l>=0) emit_cmp(s1l,s2l);
6260 else emit_test(s1l,s1l);
6261 emit_cmovne_reg(alt,addr);
6264 if((opcode[i]&0x3f)==5) // BNE
6266 #ifdef HAVE_CMOV_IMM
6268 if(s2l>=0) emit_cmp(s1l,s2l);
6269 else emit_test(s1l,s1l);
6270 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6276 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6278 if(s2h>=0) emit_cmp(s1h,s2h);
6279 else emit_test(s1h,s1h);
6280 emit_cmovne_reg(alt,addr);
6282 if(s2l>=0) emit_cmp(s1l,s2l);
6283 else emit_test(s1l,s1l);
6284 emit_cmovne_reg(alt,addr);
6287 if((opcode[i]&0x3f)==0x14) // BEQL
6290 if(s2h>=0) emit_cmp(s1h,s2h);
6291 else emit_test(s1h,s1h);
6295 if(s2l>=0) emit_cmp(s1l,s2l);
6296 else emit_test(s1l,s1l);
6297 if(nottaken) set_jump_target(nottaken,(int)out);
6301 if((opcode[i]&0x3f)==0x15) // BNEL
6304 if(s2h>=0) emit_cmp(s1h,s2h);
6305 else emit_test(s1h,s1h);
6309 if(s2l>=0) emit_cmp(s1l,s2l);
6310 else emit_test(s1l,s1l);
6313 if(taken) set_jump_target(taken,(int)out);
6315 if((opcode[i]&0x3f)==6) // BLEZ
6317 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6319 if(s1h>=0) emit_mov(addr,ntaddr);
6320 emit_cmovl_reg(alt,addr);
6323 emit_cmovne_reg(ntaddr,addr);
6324 emit_cmovs_reg(alt,addr);
6327 if((opcode[i]&0x3f)==7) // BGTZ
6329 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6331 if(s1h>=0) emit_mov(addr,alt);
6332 emit_cmovl_reg(ntaddr,addr);
6335 emit_cmovne_reg(alt,addr);
6336 emit_cmovs_reg(ntaddr,addr);
6339 if((opcode[i]&0x3f)==0x16) // BLEZL
6341 assert((opcode[i]&0x3f)!=0x16);
6343 if((opcode[i]&0x3f)==0x17) // BGTZL
6345 assert((opcode[i]&0x3f)!=0x17);
6347 assert(opcode[i]!=1); // BLTZ/BGEZ
6349 //FIXME: Check CSREG
6350 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6351 if((source[i]&0x30000)==0) // BC1F
6353 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6354 emit_testimm(s1l,0x800000);
6355 emit_cmovne_reg(alt,addr);
6357 if((source[i]&0x30000)==0x10000) // BC1T
6359 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6360 emit_testimm(s1l,0x800000);
6361 emit_cmovne_reg(alt,addr);
6363 if((source[i]&0x30000)==0x20000) // BC1FL
6365 emit_testimm(s1l,0x800000);
6369 if((source[i]&0x30000)==0x30000) // BC1TL
6371 emit_testimm(s1l,0x800000);
6377 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6378 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6379 if(likely[i]||unconditional)
6381 emit_movimm(ba[i],HOST_BTREG);
6383 else if(addr!=HOST_BTREG)
6385 emit_mov(addr,HOST_BTREG);
6387 void *branch_addr=out;
6389 int target_addr=start+i*4+5;
6391 void *compiled_target_addr=check_addr(target_addr);
6392 emit_extjump_ds((int)branch_addr,target_addr);
6393 if(compiled_target_addr) {
6394 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6395 add_link(target_addr,stub);
6397 else set_jump_target((int)branch_addr,(int)stub);
6400 set_jump_target((int)nottaken,(int)out);
6401 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6402 void *branch_addr=out;
6404 int target_addr=start+i*4+8;
6406 void *compiled_target_addr=check_addr(target_addr);
6407 emit_extjump_ds((int)branch_addr,target_addr);
6408 if(compiled_target_addr) {
6409 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6410 add_link(target_addr,stub);
6412 else set_jump_target((int)branch_addr,(int)stub);
6416 // Assemble the delay slot for the above
6417 static void pagespan_ds()
6419 assem_debug("initial delay slot:\n");
6420 u_int vaddr=start+1;
6421 u_int page=get_page(vaddr);
6422 u_int vpage=get_vpage(vaddr);
6423 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6425 ll_add(jump_in+page,vaddr,(void *)out);
6426 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6427 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6428 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6429 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6430 emit_writeword(HOST_BTREG,(int)&branch_target);
6431 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6432 address_generation(0,®s[0],regs[0].regmap_entry);
6433 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6434 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6439 alu_assemble(0,®s[0]);break;
6441 imm16_assemble(0,®s[0]);break;
6443 shift_assemble(0,®s[0]);break;
6445 shiftimm_assemble(0,®s[0]);break;
6447 load_assemble(0,®s[0]);break;
6449 loadlr_assemble(0,®s[0]);break;
6451 store_assemble(0,®s[0]);break;
6453 storelr_assemble(0,®s[0]);break;
6455 cop0_assemble(0,®s[0]);break;
6457 cop1_assemble(0,®s[0]);break;
6459 c1ls_assemble(0,®s[0]);break;
6461 cop2_assemble(0,®s[0]);break;
6463 c2ls_assemble(0,®s[0]);break;
6465 c2op_assemble(0,®s[0]);break;
6467 fconv_assemble(0,®s[0]);break;
6469 float_assemble(0,®s[0]);break;
6471 fcomp_assemble(0,®s[0]);break;
6473 multdiv_assemble(0,®s[0]);break;
6475 mov_assemble(0,®s[0]);break;
6484 printf("Jump in the delay slot. This is probably a bug.\n");
6486 int btaddr=get_reg(regs[0].regmap,BTREG);
6488 btaddr=get_reg(regs[0].regmap,-1);
6489 emit_readword((int)&branch_target,btaddr);
6491 assert(btaddr!=HOST_CCREG);
6492 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6494 emit_movimm(start+4,HOST_TEMPREG);
6495 emit_cmp(btaddr,HOST_TEMPREG);
6497 emit_cmpimm(btaddr,start+4);
6499 int branch=(int)out;
6501 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6502 emit_jmp(jump_vaddr_reg[btaddr]);
6503 set_jump_target(branch,(int)out);
6504 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6505 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6508 // Basic liveness analysis for MIPS registers
6509 void unneeded_registers(int istart,int iend,int r)
6513 uint64_t temp_u,temp_uu;
6518 u=unneeded_reg[iend+1];
6519 uu=unneeded_reg_upper[iend+1];
6522 for (i=iend;i>=istart;i--)
6524 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6525 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6527 // If subroutine call, flag return address as a possible branch target
6528 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6530 if(ba[i]<start || ba[i]>=(start+slen*4))
6532 // Branch out of this block, flush all regs
6536 if(itype[i]==UJUMP&&rt1[i]==31)
6538 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6540 if(itype[i]==RJUMP&&rs1[i]==31)
6542 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6544 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6545 if(itype[i]==UJUMP&&rt1[i]==31)
6547 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6548 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6550 if(itype[i]==RJUMP&&rs1[i]==31)
6552 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6553 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6556 branch_unneeded_reg[i]=u;
6557 branch_unneeded_reg_upper[i]=uu;
6558 // Merge in delay slot
6559 tdep=(~uu>>rt1[i+1])&1;
6560 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6561 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6562 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6563 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6564 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6566 // If branch is "likely" (and conditional)
6567 // then we skip the delay slot on the fall-thru path
6570 u&=unneeded_reg[i+2];
6571 uu&=unneeded_reg_upper[i+2];
6582 // Internal branch, flag target
6583 bt[(ba[i]-start)>>2]=1;
6584 if(ba[i]<=start+i*4) {
6586 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6588 // Unconditional branch
6591 // Conditional branch (not taken case)
6592 temp_u=unneeded_reg[i+2];
6593 temp_uu=unneeded_reg_upper[i+2];
6595 // Merge in delay slot
6596 tdep=(~temp_uu>>rt1[i+1])&1;
6597 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6598 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6599 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6600 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6601 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6602 temp_u|=1;temp_uu|=1;
6603 // If branch is "likely" (and conditional)
6604 // then we skip the delay slot on the fall-thru path
6607 temp_u&=unneeded_reg[i+2];
6608 temp_uu&=unneeded_reg_upper[i+2];
6616 tdep=(~temp_uu>>rt1[i])&1;
6617 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6618 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6619 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6620 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6621 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6622 temp_u|=1;temp_uu|=1;
6623 unneeded_reg[i]=temp_u;
6624 unneeded_reg_upper[i]=temp_uu;
6625 // Only go three levels deep. This recursion can take an
6626 // excessive amount of time if there are a lot of nested loops.
6628 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6630 unneeded_reg[(ba[i]-start)>>2]=1;
6631 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6634 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6636 // Unconditional branch
6637 u=unneeded_reg[(ba[i]-start)>>2];
6638 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6639 branch_unneeded_reg[i]=u;
6640 branch_unneeded_reg_upper[i]=uu;
6643 //branch_unneeded_reg[i]=u;
6644 //branch_unneeded_reg_upper[i]=uu;
6645 // Merge in delay slot
6646 tdep=(~uu>>rt1[i+1])&1;
6647 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6648 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6649 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6650 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6651 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6654 // Conditional branch
6655 b=unneeded_reg[(ba[i]-start)>>2];
6656 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6657 branch_unneeded_reg[i]=b;
6658 branch_unneeded_reg_upper[i]=bu;
6661 //branch_unneeded_reg[i]=b;
6662 //branch_unneeded_reg_upper[i]=bu;
6663 // Branch delay slot
6664 tdep=(~uu>>rt1[i+1])&1;
6665 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6666 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6667 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6668 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6669 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6671 // If branch is "likely" then we skip the
6672 // delay slot on the fall-thru path
6677 u&=unneeded_reg[i+2];
6678 uu&=unneeded_reg_upper[i+2];
6689 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6690 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6691 //branch_unneeded_reg[i]=1;
6692 //branch_unneeded_reg_upper[i]=1;
6694 branch_unneeded_reg[i]=1;
6695 branch_unneeded_reg_upper[i]=1;
6701 else if(itype[i]==SYSCALL||itype[i]==HLECALL)
6703 // SYSCALL instruction (software interrupt)
6707 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6709 // ERET instruction (return from interrupt)
6714 tdep=(~uu>>rt1[i])&1;
6715 // Written registers are unneeded
6720 // Accessed registers are needed
6725 // Source-target dependencies
6726 uu&=~(tdep<<dep1[i]);
6727 uu&=~(tdep<<dep2[i]);
6728 // R0 is always unneeded
6732 unneeded_reg_upper[i]=uu;
6734 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
6737 for(r=1;r<=CCREG;r++) {
6738 if((unneeded_reg[i]>>r)&1) {
6739 if(r==HIREG) printf(" HI");
6740 else if(r==LOREG) printf(" LO");
6741 else printf(" r%d",r);
6745 for(r=1;r<=CCREG;r++) {
6746 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
6747 if(r==HIREG) printf(" HI");
6748 else if(r==LOREG) printf(" LO");
6749 else printf(" r%d",r);
6755 for (i=iend;i>=istart;i--)
6757 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
6762 // Identify registers which are likely to contain 32-bit values
6763 // This is used to predict whether any branches will jump to a
6764 // location with 64-bit values in registers.
6765 static void provisional_32bit()
6769 uint64_t lastbranch=1;
6774 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
6775 if(i>1) is32=lastbranch;
6781 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
6783 if(i>2) is32=lastbranch;
6787 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
6789 if(rs1[i-2]==0||rs2[i-2]==0)
6792 is32|=1LL<<rs1[i-2];
6795 is32|=1LL<<rs2[i-2];
6800 // If something jumps here with 64-bit values
6801 // then promote those registers to 64 bits
6804 uint64_t temp_is32=is32;
6807 if(ba[j]==start+i*4)
6808 //temp_is32&=branch_regs[j].is32;
6813 if(ba[j]==start+i*4)
6824 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
6825 // Branches don't write registers, consider the delay slot instead.
6836 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
6837 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
6846 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
6847 if(op==0x22) is32|=1LL<<rt; // LWL
6850 if (op==0x08||op==0x09|| // ADDI/ADDIU
6851 op==0x0a||op==0x0b|| // SLTI/SLTIU
6857 if(op==0x18||op==0x19) { // DADDI/DADDIU
6860 // is32|=((is32>>s1)&1LL)<<rt;
6862 if(op==0x0d||op==0x0e) { // ORI/XORI
6863 uint64_t sr=((is32>>s1)&1LL);
6879 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
6882 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
6885 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
6886 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
6890 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
6895 uint64_t sr=((is32>>s1)&1LL);
6900 uint64_t sr=((is32>>s2)&1LL);
6908 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
6913 uint64_t sr=((is32>>s1)&1LL);
6923 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
6924 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
6927 is32|=(1LL<<HIREG)|(1LL<<LOREG);
6932 uint64_t sr=((is32>>s1)&1LL);
6938 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
6939 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
6943 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
6944 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
6947 if(op2==0) is32|=1LL<<rt; // MFC0
6951 if(op2==0) is32|=1LL<<rt; // MFC1
6952 if(op2==1) is32&=~(1LL<<rt); // DMFC1
6953 if(op2==2) is32|=1LL<<rt; // CFC1
6975 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
6977 if(rt1[i-1]==31) // JAL/JALR
6979 // Subroutine call will return here, don't alloc any registers
6984 // Internal branch will jump here, match registers to caller
6992 // Identify registers which may be assumed to contain 32-bit values
6993 // and where optimizations will rely on this.
6994 // This is used to determine whether backward branches can safely
6995 // jump to a location with 64-bit values in registers.
6996 static void provisional_r32()
7001 for (i=slen-1;i>=0;i--)
7004 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7006 if(ba[i]<start || ba[i]>=(start+slen*4))
7008 // Branch out of this block, don't need anything
7014 // Need whatever matches the target
7015 // (and doesn't get overwritten by the delay slot instruction)
7017 int t=(ba[i]-start)>>2;
7018 if(ba[i]>start+i*4) {
7020 //if(!(requires_32bit[t]&~regs[i].was32))
7021 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7022 if(!(pr32[t]&~regs[i].was32))
7023 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7026 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7027 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7030 // Conditional branch may need registers for following instructions
7031 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7034 //r32|=requires_32bit[i+2];
7037 // Mark this address as a branch target since it may be called
7038 // upon return from interrupt
7042 // Merge in delay slot
7044 // These are overwritten unless the branch is "likely"
7045 // and the delay slot is nullified if not taken
7046 r32&=~(1LL<<rt1[i+1]);
7047 r32&=~(1LL<<rt2[i+1]);
7049 // Assume these are needed (delay slot)
7052 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7056 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7058 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7060 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7062 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7064 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7067 else if(itype[i]==SYSCALL||itype[i]==HLECALL)
7069 // SYSCALL instruction (software interrupt)
7072 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7074 // ERET instruction (return from interrupt)
7078 r32&=~(1LL<<rt1[i]);
7079 r32&=~(1LL<<rt2[i]);
7082 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7086 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7088 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7090 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7092 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7094 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7096 //requires_32bit[i]=r32;
7099 // Dirty registers which are 32-bit, require 32-bit input
7100 // as they will be written as 32-bit values
7101 for(hr=0;hr<HOST_REGS;hr++)
7103 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7104 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7105 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7106 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7107 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7114 // Write back dirty registers as soon as we will no longer modify them,
7115 // so that we don't end up with lots of writes at the branches.
7116 void clean_registers(int istart,int iend,int wr)
7120 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7121 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7123 will_dirty_i=will_dirty_next=0;
7124 wont_dirty_i=wont_dirty_next=0;
7126 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7127 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7129 for (i=iend;i>=istart;i--)
7131 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7133 if(ba[i]<start || ba[i]>=(start+slen*4))
7135 // Branch out of this block, flush all regs
7136 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7138 // Unconditional branch
7141 // Merge in delay slot (will dirty)
7142 for(r=0;r<HOST_REGS;r++) {
7143 if(r!=EXCLUDE_REG) {
7144 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7145 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7146 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7147 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7148 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7149 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7150 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7151 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7152 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7153 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7154 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7155 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7156 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7157 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7163 // Conditional branch
7165 wont_dirty_i=wont_dirty_next;
7166 // Merge in delay slot (will dirty)
7167 for(r=0;r<HOST_REGS;r++) {
7168 if(r!=EXCLUDE_REG) {
7170 // Might not dirty if likely branch is not taken
7171 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7172 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7173 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7174 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7175 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7176 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7177 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7178 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7179 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7180 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7181 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7182 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7183 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7184 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7189 // Merge in delay slot (wont dirty)
7190 for(r=0;r<HOST_REGS;r++) {
7191 if(r!=EXCLUDE_REG) {
7192 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7193 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7194 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7195 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7196 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7197 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7198 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7199 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7200 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7201 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7205 #ifndef DESTRUCTIVE_WRITEBACK
7206 branch_regs[i].dirty&=wont_dirty_i;
7208 branch_regs[i].dirty|=will_dirty_i;
7214 if(ba[i]<=start+i*4) {
7216 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7218 // Unconditional branch
7221 // Merge in delay slot (will dirty)
7222 for(r=0;r<HOST_REGS;r++) {
7223 if(r!=EXCLUDE_REG) {
7224 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7225 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7226 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7227 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7228 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7229 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7230 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7231 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7232 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7233 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7234 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7235 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7236 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7237 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7241 // Conditional branch (not taken case)
7242 temp_will_dirty=will_dirty_next;
7243 temp_wont_dirty=wont_dirty_next;
7244 // Merge in delay slot (will dirty)
7245 for(r=0;r<HOST_REGS;r++) {
7246 if(r!=EXCLUDE_REG) {
7248 // Will not dirty if likely branch is not taken
7249 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7250 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7251 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7252 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7253 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7254 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7255 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7256 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7257 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7258 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7259 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7260 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7261 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7262 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7267 // Merge in delay slot (wont dirty)
7268 for(r=0;r<HOST_REGS;r++) {
7269 if(r!=EXCLUDE_REG) {
7270 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7271 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7272 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7273 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7274 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7275 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7276 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7277 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7278 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7279 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7282 // Deal with changed mappings
7284 for(r=0;r<HOST_REGS;r++) {
7285 if(r!=EXCLUDE_REG) {
7286 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7287 temp_will_dirty&=~(1<<r);
7288 temp_wont_dirty&=~(1<<r);
7289 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7290 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7291 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7293 temp_will_dirty|=1<<r;
7294 temp_wont_dirty|=1<<r;
7301 will_dirty[i]=temp_will_dirty;
7302 wont_dirty[i]=temp_wont_dirty;
7303 clean_registers((ba[i]-start)>>2,i-1,0);
7305 // Limit recursion. It can take an excessive amount
7306 // of time if there are a lot of nested loops.
7307 will_dirty[(ba[i]-start)>>2]=0;
7308 wont_dirty[(ba[i]-start)>>2]=-1;
7313 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7315 // Unconditional branch
7318 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7319 for(r=0;r<HOST_REGS;r++) {
7320 if(r!=EXCLUDE_REG) {
7321 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7322 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7323 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7328 // Merge in delay slot
7329 for(r=0;r<HOST_REGS;r++) {
7330 if(r!=EXCLUDE_REG) {
7331 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7332 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7333 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7334 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7335 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7336 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7337 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7338 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7339 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7340 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7341 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7342 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7343 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7344 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7348 // Conditional branch
7349 will_dirty_i=will_dirty_next;
7350 wont_dirty_i=wont_dirty_next;
7351 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7352 for(r=0;r<HOST_REGS;r++) {
7353 if(r!=EXCLUDE_REG) {
7354 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7355 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7356 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7360 will_dirty_i&=~(1<<r);
7362 // Treat delay slot as part of branch too
7363 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7364 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7365 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7369 will_dirty[i+1]&=~(1<<r);
7374 // Merge in delay slot
7375 for(r=0;r<HOST_REGS;r++) {
7376 if(r!=EXCLUDE_REG) {
7378 // Might not dirty if likely branch is not taken
7379 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7380 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7381 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7382 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7383 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7384 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7385 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7386 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7387 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7388 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7389 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7390 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7391 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7392 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7397 // Merge in delay slot
7398 for(r=0;r<HOST_REGS;r++) {
7399 if(r!=EXCLUDE_REG) {
7400 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7401 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7402 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7403 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7404 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7405 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7406 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7407 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7408 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7409 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7413 #ifndef DESTRUCTIVE_WRITEBACK
7414 branch_regs[i].dirty&=wont_dirty_i;
7416 branch_regs[i].dirty|=will_dirty_i;
7421 else if(itype[i]==SYSCALL||itype[i]==HLECALL)
7423 // SYSCALL instruction (software interrupt)
7427 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7429 // ERET instruction (return from interrupt)
7433 will_dirty_next=will_dirty_i;
7434 wont_dirty_next=wont_dirty_i;
7435 for(r=0;r<HOST_REGS;r++) {
7436 if(r!=EXCLUDE_REG) {
7437 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7438 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7439 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7440 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7441 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7442 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7443 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7444 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7446 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7448 // Don't store a register immediately after writing it,
7449 // may prevent dual-issue.
7450 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7451 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7457 will_dirty[i]=will_dirty_i;
7458 wont_dirty[i]=wont_dirty_i;
7459 // Mark registers that won't be dirtied as not dirty
7461 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7462 for(r=0;r<HOST_REGS;r++) {
7463 if((will_dirty_i>>r)&1) {
7469 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7470 regs[i].dirty|=will_dirty_i;
7471 #ifndef DESTRUCTIVE_WRITEBACK
7472 regs[i].dirty&=wont_dirty_i;
7473 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7475 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7476 for(r=0;r<HOST_REGS;r++) {
7477 if(r!=EXCLUDE_REG) {
7478 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7479 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7480 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7488 for(r=0;r<HOST_REGS;r++) {
7489 if(r!=EXCLUDE_REG) {
7490 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7491 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7492 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7500 // Deal with changed mappings
7501 temp_will_dirty=will_dirty_i;
7502 temp_wont_dirty=wont_dirty_i;
7503 for(r=0;r<HOST_REGS;r++) {
7504 if(r!=EXCLUDE_REG) {
7506 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7508 #ifndef DESTRUCTIVE_WRITEBACK
7509 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7511 regs[i].wasdirty|=will_dirty_i&(1<<r);
7514 else if((nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7515 // Register moved to a different register
7516 will_dirty_i&=~(1<<r);
7517 wont_dirty_i&=~(1<<r);
7518 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7519 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7521 #ifndef DESTRUCTIVE_WRITEBACK
7522 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7524 regs[i].wasdirty|=will_dirty_i&(1<<r);
7528 will_dirty_i&=~(1<<r);
7529 wont_dirty_i&=~(1<<r);
7530 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7531 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7532 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7535 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7544 void disassemble_inst(int i)
7546 if (bt[i]) printf("*"); else printf(" ");
7549 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7551 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;
7553 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;
7555 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7558 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7560 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7563 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7565 if(opcode[i]==0xf) //LUI
7566 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7568 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7572 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7576 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7580 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7583 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7586 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7589 if((opcode2[i]&0x1d)==0x10)
7590 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7591 else if((opcode2[i]&0x1d)==0x11)
7592 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7594 printf (" %x: %s\n",start+i*4,insn[i]);
7598 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7599 else if(opcode2[i]==4)
7600 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7601 else printf (" %x: %s\n",start+i*4,insn[i]);
7605 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7606 else if(opcode2[i]>3)
7607 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7608 else printf (" %x: %s\n",start+i*4,insn[i]);
7612 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7613 else if(opcode2[i]>3)
7614 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7615 else printf (" %x: %s\n",start+i*4,insn[i]);
7618 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7621 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7624 //printf (" %s %8x\n",insn[i],source[i]);
7625 printf (" %x: %s\n",start+i*4,insn[i]);
7629 void new_dynarec_init()
7631 printf("Init new dynarec\n");
7632 out=(u_char *)BASE_ADDR;
7633 if (mmap (out, 1<<TARGET_SIZE_2,
7634 PROT_READ | PROT_WRITE | PROT_EXEC,
7635 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
7636 -1, 0) <= 0) {printf("mmap() failed\n");}
7638 rdword=&readmem_dword;
7639 fake_pc.f.r.rs=&readmem_dword;
7640 fake_pc.f.r.rt=&readmem_dword;
7641 fake_pc.f.r.rd=&readmem_dword;
7644 for(n=0x80000;n<0x80800;n++)
7646 for(n=0;n<65536;n++)
7647 hash_table[n][0]=hash_table[n][2]=-1;
7648 memset(mini_ht,-1,sizeof(mini_ht));
7649 memset(restore_candidate,0,sizeof(restore_candidate));
7651 expirep=16384; // Expiry pointer, +2 blocks
7652 pending_exception=0;
7655 // Copy this into local area so we don't have to put it in every literal pool
7656 invc_ptr=invalid_code;
7661 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7663 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7664 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7665 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7668 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
7669 writemem[n] = write_nomem_new;
7670 writememb[n] = write_nomemb_new;
7671 writememh[n] = write_nomemh_new;
7673 writememd[n] = write_nomemd_new;
7675 readmem[n] = read_nomem_new;
7676 readmemb[n] = read_nomemb_new;
7677 readmemh[n] = read_nomemh_new;
7679 readmemd[n] = read_nomemd_new;
7682 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
7683 writemem[n] = write_rdram_new;
7684 writememb[n] = write_rdramb_new;
7685 writememh[n] = write_rdramh_new;
7687 writememd[n] = write_rdramd_new;
7690 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
7691 writemem[n] = write_nomem_new;
7692 writememb[n] = write_nomemb_new;
7693 writememh[n] = write_nomemh_new;
7695 writememd[n] = write_nomemd_new;
7697 readmem[n] = read_nomem_new;
7698 readmemb[n] = read_nomemb_new;
7699 readmemh[n] = read_nomemh_new;
7701 readmemd[n] = read_nomemd_new;
7709 void new_dynarec_cleanup()
7712 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {printf("munmap() failed\n");}
7713 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7714 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7715 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7717 if (munmap (ROM_COPY, 67108864) < 0) {printf("munmap() failed\n");}
7721 int new_recompile_block(int addr)
7724 if(addr==0x800cd050) {
7726 for(block=0x80000;block<0x80800;block++) invalidate_block(block);
7728 for(n=0;n<=2048;n++) ll_clear(jump_dirty+n);
7731 //if(Count==365117028) tracedebug=1;
7732 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7733 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7734 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
7736 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
7737 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
7738 /*if(Count>=312978186) {
7742 start = (u_int)addr&~3;
7743 //assert(((u_int)addr&1)==0);
7745 if (Config.HLE && start == 0x80001000) {
7746 // XXX: is this enough? Maybe check hleSoftCall?
7747 u_int beginning=(u_int)out;
7748 u_int page=get_page(start);
7749 ll_add(jump_in+page,start,out);
7750 invalid_code[start>>12]=0;
7751 emit_movimm(start,0);
7752 emit_writeword(0,(int)&pcaddr);
7753 emit_jmp((int)new_dyna_leave);
7755 __clear_cache((void *)beginning,out);
7759 else if ((u_int)addr < 0x00200000) {
7760 // used for BIOS calls mostly?
7761 source = (u_int *)((u_int)rdram+start-0);
7762 pagelimit = 0x00200000;
7767 if ((int)addr >= 0xa4000000 && (int)addr < 0xa4001000) {
7768 source = (u_int *)((u_int)SP_DMEM+start-0xa4000000);
7769 pagelimit = 0xa4001000;
7773 if ((int)addr >= 0x80000000 && (int)addr < 0x80000000+RAM_SIZE) {
7774 source = (u_int *)((u_int)rdram+start-0x80000000);
7775 pagelimit = 0x80000000+RAM_SIZE;
7778 else if ((signed int)addr >= (signed int)0xC0000000) {
7779 //printf("addr=%x mm=%x\n",(u_int)addr,(memory_map[start>>12]<<2));
7780 //if(tlb_LUT_r[start>>12])
7781 //source = (u_int *)(((int)rdram)+(tlb_LUT_r[start>>12]&0xFFFFF000)+(((int)addr)&0xFFF)-0x80000000);
7782 if((signed int)memory_map[start>>12]>=0) {
7783 source = (u_int *)((u_int)(start+(memory_map[start>>12]<<2)));
7784 pagelimit=(start+4096)&0xFFFFF000;
7785 int map=memory_map[start>>12];
7788 //printf("start: %x next: %x\n",map,memory_map[pagelimit>>12]);
7789 if((map&0xBFFFFFFF)==(memory_map[pagelimit>>12]&0xBFFFFFFF)) pagelimit+=4096;
7791 assem_debug("pagelimit=%x\n",pagelimit);
7792 assem_debug("mapping=%x (%x)\n",memory_map[start>>12],(memory_map[start>>12]<<2)+start);
7795 assem_debug("Compile at unmapped memory address: %x \n", (int)addr);
7796 //assem_debug("start: %x next: %x\n",memory_map[start>>12],memory_map[(start+4096)>>12]);
7797 return 1; // Caller will invoke exception handler
7799 //printf("source= %x\n",(int)source);
7803 printf("Compile at bogus memory address: %x \n", (int)addr);
7807 /* Pass 1: disassemble */
7808 /* Pass 2: register dependencies, branch targets */
7809 /* Pass 3: register allocation */
7810 /* Pass 4: branch dependencies */
7811 /* Pass 5: pre-alloc */
7812 /* Pass 6: optimize clean/dirty state */
7813 /* Pass 7: flag 32-bit registers */
7814 /* Pass 8: assembly */
7815 /* Pass 9: linker */
7816 /* Pass 10: garbage collection / free memory */
7820 unsigned int type,op,op2;
7822 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
7824 /* Pass 1 disassembly */
7826 for(i=0;!done;i++) {
7827 bt[i]=0;likely[i]=0;op2=0;
7828 opcode[i]=op=source[i]>>26;
7831 case 0x00: strcpy(insn[i],"special"); type=NI;
7835 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
7836 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
7837 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
7838 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
7839 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
7840 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
7841 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
7842 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
7843 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
7844 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
7845 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
7846 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
7847 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
7848 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
7849 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
7850 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
7851 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
7852 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
7853 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
7854 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
7855 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
7856 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
7857 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
7858 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
7859 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
7860 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
7861 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
7862 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
7863 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
7864 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
7865 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
7866 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
7867 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
7868 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
7869 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
7870 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
7871 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
7872 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
7873 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
7874 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
7875 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
7876 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
7877 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
7878 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
7879 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
7880 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
7881 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
7882 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
7883 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
7884 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
7885 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
7886 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
7889 case 0x01: strcpy(insn[i],"regimm"); type=NI;
7890 op2=(source[i]>>16)&0x1f;
7893 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
7894 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
7895 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
7896 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
7897 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
7898 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
7899 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
7900 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
7901 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
7902 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
7903 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
7904 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
7905 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
7906 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
7909 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
7910 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
7911 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
7912 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
7913 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
7914 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
7915 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
7916 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
7917 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
7918 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
7919 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
7920 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
7921 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
7922 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
7923 case 0x10: strcpy(insn[i],"cop0"); type=NI;
7924 op2=(source[i]>>21)&0x1f;
7927 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
7928 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
7929 case 0x10: strcpy(insn[i],"tlb"); type=NI;
7930 switch(source[i]&0x3f)
7932 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
7933 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
7934 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
7935 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
7936 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
7940 case 0x11: strcpy(insn[i],"cop1"); type=NI;
7941 op2=(source[i]>>21)&0x1f;
7944 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
7945 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
7946 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
7947 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
7948 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
7949 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
7950 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
7951 switch((source[i]>>16)&0x3)
7953 case 0x00: strcpy(insn[i],"BC1F"); break;
7954 case 0x01: strcpy(insn[i],"BC1T"); break;
7955 case 0x02: strcpy(insn[i],"BC1FL"); break;
7956 case 0x03: strcpy(insn[i],"BC1TL"); break;
7959 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
7960 switch(source[i]&0x3f)
7962 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
7963 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
7964 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
7965 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
7966 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
7967 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
7968 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
7969 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
7970 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
7971 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
7972 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
7973 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
7974 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
7975 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
7976 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
7977 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
7978 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
7979 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
7980 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
7981 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
7982 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
7983 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
7984 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
7985 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
7986 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
7987 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
7988 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
7989 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
7990 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
7991 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
7992 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
7993 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
7994 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
7995 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
7996 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
7999 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8000 switch(source[i]&0x3f)
8002 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8003 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8004 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8005 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8006 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8007 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8008 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8009 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8010 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8011 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8012 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8013 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8014 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8015 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8016 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8017 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8018 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8019 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8020 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8021 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8022 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8023 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8024 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8025 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8026 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8027 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8028 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8029 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8030 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8031 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8032 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8033 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8034 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8035 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8036 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8039 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8040 switch(source[i]&0x3f)
8042 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8043 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8046 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8047 switch(source[i]&0x3f)
8049 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8050 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8055 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8056 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8057 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8058 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8060 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8061 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8062 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8063 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8065 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8066 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8067 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8068 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8069 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8070 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8071 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8072 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8073 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8074 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8075 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8076 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8078 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8079 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8081 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8082 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8083 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8084 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8086 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8087 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8088 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8090 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8091 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8093 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8094 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8095 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8098 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8099 op2=(source[i]>>21)&0x1f;
8102 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8103 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8104 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8105 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8107 if (gte_handlers[source[i]&0x3f]!=NULL) {
8108 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8114 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8115 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8116 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8118 default: strcpy(insn[i],"???"); type=NI;
8119 printf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8124 /* Get registers/immediates */
8132 rs1[i]=(source[i]>>21)&0x1f;
8134 rt1[i]=(source[i]>>16)&0x1f;
8136 imm[i]=(short)source[i];
8140 rs1[i]=(source[i]>>21)&0x1f;
8141 rs2[i]=(source[i]>>16)&0x1f;
8144 imm[i]=(short)source[i];
8145 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8148 // LWL/LWR only load part of the register,
8149 // therefore the target register must be treated as a source too
8150 rs1[i]=(source[i]>>21)&0x1f;
8151 rs2[i]=(source[i]>>16)&0x1f;
8152 rt1[i]=(source[i]>>16)&0x1f;
8154 imm[i]=(short)source[i];
8155 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8156 if(op==0x26) dep1[i]=rt1[i]; // LWR
8159 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8160 else rs1[i]=(source[i]>>21)&0x1f;
8162 rt1[i]=(source[i]>>16)&0x1f;
8164 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8165 imm[i]=(unsigned short)source[i];
8167 imm[i]=(short)source[i];
8169 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8170 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8171 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8178 // The JAL instruction writes to r31.
8185 rs1[i]=(source[i]>>21)&0x1f;
8189 // The JALR instruction writes to rd.
8191 rt1[i]=(source[i]>>11)&0x1f;
8196 rs1[i]=(source[i]>>21)&0x1f;
8197 rs2[i]=(source[i]>>16)&0x1f;
8200 if(op&2) { // BGTZ/BLEZ
8208 rs1[i]=(source[i]>>21)&0x1f;
8213 if(op2&0x10) { // BxxAL
8215 // NOTE: If the branch is not taken, r31 is still overwritten
8217 likely[i]=(op2&2)>>1;
8224 likely[i]=((source[i])>>17)&1;
8227 rs1[i]=(source[i]>>21)&0x1f; // source
8228 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8229 rt1[i]=(source[i]>>11)&0x1f; // destination
8231 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8232 us1[i]=rs1[i];us2[i]=rs2[i];
8234 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8235 dep1[i]=rs1[i];dep2[i]=rs2[i];
8237 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8238 dep1[i]=rs1[i];dep2[i]=rs2[i];
8242 rs1[i]=(source[i]>>21)&0x1f; // source
8243 rs2[i]=(source[i]>>16)&0x1f; // divisor
8246 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8247 us1[i]=rs1[i];us2[i]=rs2[i];
8255 if(op2==0x10) rs1[i]=HIREG; // MFHI
8256 if(op2==0x11) rt1[i]=HIREG; // MTHI
8257 if(op2==0x12) rs1[i]=LOREG; // MFLO
8258 if(op2==0x13) rt1[i]=LOREG; // MTLO
8259 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8260 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8264 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8265 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8266 rt1[i]=(source[i]>>11)&0x1f; // destination
8268 // DSLLV/DSRLV/DSRAV are 64-bit
8269 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8272 rs1[i]=(source[i]>>16)&0x1f;
8274 rt1[i]=(source[i]>>11)&0x1f;
8276 imm[i]=(source[i]>>6)&0x1f;
8277 // DSxx32 instructions
8278 if(op2>=0x3c) imm[i]|=0x20;
8279 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8280 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8287 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8288 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8289 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8290 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8298 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8299 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8300 if(op2==5) us1[i]=rs1[i]; // DMTC1
8304 rs1[i]=(source[i]>>21)&0x1F;
8308 imm[i]=(short)source[i];
8311 rs1[i]=(source[i]>>21)&0x1F;
8315 imm[i]=(short)source[i];
8343 /* Calculate branch target addresses */
8345 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8346 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8347 ba[i]=start+i*4+8; // Ignore never taken branch
8348 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8349 ba[i]=start+i*4+8; // Ignore never taken branch
8350 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8351 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8353 /* Is this the end of the block? */
8354 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8355 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8357 // Does the block continue due to a branch?
8360 if(ba[j]==start+i*4+4) done=j=0;
8361 if(ba[j]==start+i*4+8) done=j=0;
8365 if(stop_after_jal) done=1;
8367 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8369 // Don't recompile stuff that's already compiled
8370 if(check_addr(start+i*4+4)) done=1;
8371 // Don't get too close to the limit
8372 if(i>MAXBLOCK/2) done=1;
8374 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8375 if(itype[i]==HLECALL) done=1;
8376 //assert(i<MAXBLOCK-1);
8377 if(start+i*4==pagelimit-4) done=1;
8378 assert(start+i*4<pagelimit);
8379 if (i==MAXBLOCK-1) done=1;
8380 // Stop if we're compiling junk
8381 if(itype[i]==NI&&opcode[i]==0x11) {
8382 done=stop_after_jal=1;
8383 printf("Disabled speculative precompilation\n");
8387 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8388 if(start+i*4==pagelimit) {
8394 /* Pass 2 - Register dependencies and branch targets */
8396 unneeded_registers(0,slen-1,0);
8398 /* Pass 3 - Register allocation */
8400 struct regstat current; // Current register allocations/status
8403 current.u=unneeded_reg[0];
8404 current.uu=unneeded_reg_upper[0];
8405 clear_all_regs(current.regmap);
8406 alloc_reg(¤t,0,CCREG);
8407 dirty_reg(¤t,CCREG);
8414 provisional_32bit();
8417 // First instruction is delay slot
8422 unneeded_reg_upper[0]=1;
8423 current.regmap[HOST_BTREG]=BTREG;
8431 for(hr=0;hr<HOST_REGS;hr++)
8433 // Is this really necessary?
8434 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8440 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8442 if(rs1[i-2]==0||rs2[i-2]==0)
8445 current.is32|=1LL<<rs1[i-2];
8446 int hr=get_reg(current.regmap,rs1[i-2]|64);
8447 if(hr>=0) current.regmap[hr]=-1;
8450 current.is32|=1LL<<rs2[i-2];
8451 int hr=get_reg(current.regmap,rs2[i-2]|64);
8452 if(hr>=0) current.regmap[hr]=-1;
8457 // If something jumps here with 64-bit values
8458 // then promote those registers to 64 bits
8461 uint64_t temp_is32=current.is32;
8464 if(ba[j]==start+i*4)
8465 temp_is32&=branch_regs[j].is32;
8469 if(ba[j]==start+i*4)
8473 if(temp_is32!=current.is32) {
8474 //printf("dumping 32-bit regs (%x)\n",start+i*4);
8475 #ifdef DESTRUCTIVE_WRITEBACK
8476 for(hr=0;hr<HOST_REGS;hr++)
8478 int r=current.regmap[hr];
8481 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
8483 //printf("restore %d\n",r);
8488 current.is32=temp_is32;
8492 memset(p32, 0xff, sizeof(p32));
8496 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
8497 regs[i].wasconst=current.isconst;
8498 regs[i].was32=current.is32;
8499 regs[i].wasdirty=current.dirty;
8500 #ifdef DESTRUCTIVE_WRITEBACK
8501 // To change a dirty register from 32 to 64 bits, we must write
8502 // it out during the previous cycle (for branches, 2 cycles)
8503 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)
8505 uint64_t temp_is32=current.is32;
8508 if(ba[j]==start+i*4+4)
8509 temp_is32&=branch_regs[j].is32;
8513 if(ba[j]==start+i*4+4)
8517 if(temp_is32!=current.is32) {
8518 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8519 for(hr=0;hr<HOST_REGS;hr++)
8521 int r=current.regmap[hr];
8524 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8525 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
8527 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
8529 //printf("dump %d/r%d\n",hr,r);
8530 current.regmap[hr]=-1;
8531 if(get_reg(current.regmap,r|64)>=0)
8532 current.regmap[get_reg(current.regmap,r|64)]=-1;
8540 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
8542 uint64_t temp_is32=current.is32;
8545 if(ba[j]==start+i*4+8)
8546 temp_is32&=branch_regs[j].is32;
8550 if(ba[j]==start+i*4+8)
8554 if(temp_is32!=current.is32) {
8555 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8556 for(hr=0;hr<HOST_REGS;hr++)
8558 int r=current.regmap[hr];
8561 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8562 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
8564 //printf("dump %d/r%d\n",hr,r);
8565 current.regmap[hr]=-1;
8566 if(get_reg(current.regmap,r|64)>=0)
8567 current.regmap[get_reg(current.regmap,r|64)]=-1;
8575 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8577 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
8578 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
8579 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8588 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
8589 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8590 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8591 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8592 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8595 } else { printf("oops, branch at end of block with no delay slot\n");exit(1); }
8599 ds=0; // Skip delay slot, already allocated as part of branch
8600 // ...but we need to alloc it in case something jumps here
8602 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
8603 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
8605 current.u=branch_unneeded_reg[i-1];
8606 current.uu=branch_unneeded_reg_upper[i-1];
8608 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8609 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8610 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8613 struct regstat temp;
8614 memcpy(&temp,¤t,sizeof(current));
8615 temp.wasdirty=temp.dirty;
8616 temp.was32=temp.is32;
8617 // TODO: Take into account unconditional branches, as below
8618 delayslot_alloc(&temp,i);
8619 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
8620 regs[i].wasdirty=temp.wasdirty;
8621 regs[i].was32=temp.was32;
8622 regs[i].dirty=temp.dirty;
8623 regs[i].is32=temp.is32;
8627 // Create entry (branch target) regmap
8628 for(hr=0;hr<HOST_REGS;hr++)
8630 int r=temp.regmap[hr];
8632 if(r!=regmap_pre[i][hr]) {
8633 regs[i].regmap_entry[hr]=-1;
8638 if((current.u>>r)&1) {
8639 regs[i].regmap_entry[hr]=-1;
8640 regs[i].regmap[hr]=-1;
8641 //Don't clear regs in the delay slot as the branch might need them
8642 //current.regmap[hr]=-1;
8644 regs[i].regmap_entry[hr]=r;
8647 if((current.uu>>(r&63))&1) {
8648 regs[i].regmap_entry[hr]=-1;
8649 regs[i].regmap[hr]=-1;
8650 //Don't clear regs in the delay slot as the branch might need them
8651 //current.regmap[hr]=-1;
8653 regs[i].regmap_entry[hr]=r;
8657 // First instruction expects CCREG to be allocated
8658 if(i==0&&hr==HOST_CCREG)
8659 regs[i].regmap_entry[hr]=CCREG;
8661 regs[i].regmap_entry[hr]=-1;
8665 else { // Not delay slot
8668 //current.isconst=0; // DEBUG
8669 //current.wasconst=0; // DEBUG
8670 //regs[i].wasconst=0; // DEBUG
8671 clear_const(¤t,rt1[i]);
8672 alloc_cc(¤t,i);
8673 dirty_reg(¤t,CCREG);
8675 alloc_reg(¤t,i,31);
8676 dirty_reg(¤t,31);
8677 assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8679 alloc_reg(¤t,i,PTEMP);
8681 //current.is32|=1LL<<rt1[i];
8683 delayslot_alloc(¤t,i+1);
8684 //current.isconst=0; // DEBUG
8686 //printf("i=%d, isconst=%x\n",i,current.isconst);
8689 //current.isconst=0;
8690 //current.wasconst=0;
8691 //regs[i].wasconst=0;
8692 clear_const(¤t,rs1[i]);
8693 clear_const(¤t,rt1[i]);
8694 alloc_cc(¤t,i);
8695 dirty_reg(¤t,CCREG);
8696 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
8697 alloc_reg(¤t,i,rs1[i]);
8699 alloc_reg(¤t,i,rt1[i]);
8700 dirty_reg(¤t,rt1[i]);
8701 assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8703 alloc_reg(¤t,i,PTEMP);
8707 if(rs1[i]==31) { // JALR
8708 alloc_reg(¤t,i,RHASH);
8709 #ifndef HOST_IMM_ADDR32
8710 alloc_reg(¤t,i,RHTBL);
8714 delayslot_alloc(¤t,i+1);
8716 // The delay slot overwrites our source register,
8717 // allocate a temporary register to hold the old value.
8721 delayslot_alloc(¤t,i+1);
8723 alloc_reg(¤t,i,RTEMP);
8725 //current.isconst=0; // DEBUG
8729 //current.isconst=0;
8730 //current.wasconst=0;
8731 //regs[i].wasconst=0;
8732 clear_const(¤t,rs1[i]);
8733 clear_const(¤t,rs2[i]);
8734 if((opcode[i]&0x3E)==4) // BEQ/BNE
8736 alloc_cc(¤t,i);
8737 dirty_reg(¤t,CCREG);
8738 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8739 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8740 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8742 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8743 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8745 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
8746 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
8747 // The delay slot overwrites one of our conditions.
8748 // Allocate the branch condition registers instead.
8749 // Note that such a sequence of instructions could
8750 // be considered a bug since the branch can not be
8751 // re-executed if an exception occurs.
8755 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8756 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8757 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8759 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8760 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8763 else delayslot_alloc(¤t,i+1);
8766 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
8768 alloc_cc(¤t,i);
8769 dirty_reg(¤t,CCREG);
8770 alloc_reg(¤t,i,rs1[i]);
8771 if(!(current.is32>>rs1[i]&1))
8773 alloc_reg64(¤t,i,rs1[i]);
8775 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
8776 // The delay slot overwrites one of our conditions.
8777 // Allocate the branch condition registers instead.
8778 // Note that such a sequence of instructions could
8779 // be considered a bug since the branch can not be
8780 // re-executed if an exception occurs.
8784 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8785 if(!((current.is32>>rs1[i])&1))
8787 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8790 else delayslot_alloc(¤t,i+1);
8793 // Don't alloc the delay slot yet because we might not execute it
8794 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
8799 alloc_cc(¤t,i);
8800 dirty_reg(¤t,CCREG);
8801 alloc_reg(¤t,i,rs1[i]);
8802 alloc_reg(¤t,i,rs2[i]);
8803 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8805 alloc_reg64(¤t,i,rs1[i]);
8806 alloc_reg64(¤t,i,rs2[i]);
8810 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
8815 alloc_cc(¤t,i);
8816 dirty_reg(¤t,CCREG);
8817 alloc_reg(¤t,i,rs1[i]);
8818 if(!(current.is32>>rs1[i]&1))
8820 alloc_reg64(¤t,i,rs1[i]);
8824 //current.isconst=0;
8827 //current.isconst=0;
8828 //current.wasconst=0;
8829 //regs[i].wasconst=0;
8830 clear_const(¤t,rs1[i]);
8831 clear_const(¤t,rt1[i]);
8832 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
8833 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
8835 alloc_cc(¤t,i);
8836 dirty_reg(¤t,CCREG);
8837 alloc_reg(¤t,i,rs1[i]);
8838 if(!(current.is32>>rs1[i]&1))
8840 alloc_reg64(¤t,i,rs1[i]);
8842 if (rt1[i]==31) { // BLTZAL/BGEZAL
8843 alloc_reg(¤t,i,31);
8844 dirty_reg(¤t,31);
8845 assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8846 //#ifdef REG_PREFETCH
8847 //alloc_reg(¤t,i,PTEMP);
8849 //current.is32|=1LL<<rt1[i];
8851 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
8852 // The delay slot overwrites the branch condition.
8853 // Allocate the branch condition registers instead.
8854 // Note that such a sequence of instructions could
8855 // be considered a bug since the branch can not be
8856 // re-executed if an exception occurs.
8860 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8861 if(!((current.is32>>rs1[i])&1))
8863 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8866 else delayslot_alloc(¤t,i+1);
8869 // Don't alloc the delay slot yet because we might not execute it
8870 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
8875 alloc_cc(¤t,i);
8876 dirty_reg(¤t,CCREG);
8877 alloc_reg(¤t,i,rs1[i]);
8878 if(!(current.is32>>rs1[i]&1))
8880 alloc_reg64(¤t,i,rs1[i]);
8884 //current.isconst=0;
8890 if(likely[i]==0) // BC1F/BC1T
8892 // TODO: Theoretically we can run out of registers here on x86.
8893 // The delay slot can allocate up to six, and we need to check
8894 // CSREG before executing the delay slot. Possibly we can drop
8895 // the cycle count and then reload it after checking that the
8896 // FPU is in a usable state, or don't do out-of-order execution.
8897 alloc_cc(¤t,i);
8898 dirty_reg(¤t,CCREG);
8899 alloc_reg(¤t,i,FSREG);
8900 alloc_reg(¤t,i,CSREG);
8901 if(itype[i+1]==FCOMP) {
8902 // The delay slot overwrites the branch condition.
8903 // Allocate the branch condition registers instead.
8904 // Note that such a sequence of instructions could
8905 // be considered a bug since the branch can not be
8906 // re-executed if an exception occurs.
8907 alloc_cc(¤t,i);
8908 dirty_reg(¤t,CCREG);
8909 alloc_reg(¤t,i,CSREG);
8910 alloc_reg(¤t,i,FSREG);
8913 delayslot_alloc(¤t,i+1);
8914 alloc_reg(¤t,i+1,CSREG);
8918 // Don't alloc the delay slot yet because we might not execute it
8919 if(likely[i]) // BC1FL/BC1TL
8921 alloc_cc(¤t,i);
8922 dirty_reg(¤t,CCREG);
8923 alloc_reg(¤t,i,CSREG);
8924 alloc_reg(¤t,i,FSREG);
8930 imm16_alloc(¤t,i);
8934 load_alloc(¤t,i);
8938 store_alloc(¤t,i);
8941 alu_alloc(¤t,i);
8944 shift_alloc(¤t,i);
8947 multdiv_alloc(¤t,i);
8950 shiftimm_alloc(¤t,i);
8953 mov_alloc(¤t,i);
8956 cop0_alloc(¤t,i);
8960 cop1_alloc(¤t,i);
8963 c1ls_alloc(¤t,i);
8966 c2ls_alloc(¤t,i);
8969 c2op_alloc(¤t,i);
8972 fconv_alloc(¤t,i);
8975 float_alloc(¤t,i);
8978 fcomp_alloc(¤t,i);
8982 syscall_alloc(¤t,i);
8985 pagespan_alloc(¤t,i);
8989 // Drop the upper half of registers that have become 32-bit
8990 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
8991 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8992 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8993 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8996 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
8997 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8998 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8999 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9003 // Create entry (branch target) regmap
9004 for(hr=0;hr<HOST_REGS;hr++)
9007 r=current.regmap[hr];
9009 if(r!=regmap_pre[i][hr]) {
9010 // TODO: delay slot (?)
9011 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9012 if(or<0||(r&63)>=TEMPREG){
9013 regs[i].regmap_entry[hr]=-1;
9017 // Just move it to a different register
9018 regs[i].regmap_entry[hr]=r;
9019 // If it was dirty before, it's still dirty
9020 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9027 regs[i].regmap_entry[hr]=0;
9031 if((current.u>>r)&1) {
9032 regs[i].regmap_entry[hr]=-1;
9033 //regs[i].regmap[hr]=-1;
9034 current.regmap[hr]=-1;
9036 regs[i].regmap_entry[hr]=r;
9039 if((current.uu>>(r&63))&1) {
9040 regs[i].regmap_entry[hr]=-1;
9041 //regs[i].regmap[hr]=-1;
9042 current.regmap[hr]=-1;
9044 regs[i].regmap_entry[hr]=r;
9048 // Branches expect CCREG to be allocated at the target
9049 if(regmap_pre[i][hr]==CCREG)
9050 regs[i].regmap_entry[hr]=CCREG;
9052 regs[i].regmap_entry[hr]=-1;
9055 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9057 /* Branch post-alloc */
9060 current.was32=current.is32;
9061 current.wasdirty=current.dirty;
9062 switch(itype[i-1]) {
9064 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9065 branch_regs[i-1].isconst=0;
9066 branch_regs[i-1].wasconst=0;
9067 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9068 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9069 alloc_cc(&branch_regs[i-1],i-1);
9070 dirty_reg(&branch_regs[i-1],CCREG);
9071 if(rt1[i-1]==31) { // JAL
9072 alloc_reg(&branch_regs[i-1],i-1,31);
9073 dirty_reg(&branch_regs[i-1],31);
9074 branch_regs[i-1].is32|=1LL<<31;
9076 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9077 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9080 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9081 branch_regs[i-1].isconst=0;
9082 branch_regs[i-1].wasconst=0;
9083 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9084 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9085 alloc_cc(&branch_regs[i-1],i-1);
9086 dirty_reg(&branch_regs[i-1],CCREG);
9087 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9088 if(rt1[i-1]!=0) { // JALR
9089 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9090 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9091 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9094 if(rs1[i-1]==31) { // JALR
9095 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9096 #ifndef HOST_IMM_ADDR32
9097 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9101 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9102 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9105 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9107 alloc_cc(¤t,i-1);
9108 dirty_reg(¤t,CCREG);
9109 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9110 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9111 // The delay slot overwrote one of our conditions
9112 // Delay slot goes after the test (in order)
9113 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9114 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9115 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9118 delayslot_alloc(¤t,i);
9123 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9124 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9125 // Alloc the branch condition registers
9126 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9127 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9128 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9130 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9131 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9134 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9135 branch_regs[i-1].isconst=0;
9136 branch_regs[i-1].wasconst=0;
9137 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9138 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9141 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9143 alloc_cc(¤t,i-1);
9144 dirty_reg(¤t,CCREG);
9145 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9146 // The delay slot overwrote the branch condition
9147 // Delay slot goes after the test (in order)
9148 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9149 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9150 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9153 delayslot_alloc(¤t,i);
9158 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9159 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9160 // Alloc the branch condition register
9161 alloc_reg(¤t,i-1,rs1[i-1]);
9162 if(!(current.is32>>rs1[i-1]&1))
9164 alloc_reg64(¤t,i-1,rs1[i-1]);
9167 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9168 branch_regs[i-1].isconst=0;
9169 branch_regs[i-1].wasconst=0;
9170 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9171 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9174 // Alloc the delay slot in case the branch is taken
9175 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9177 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9178 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9179 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9180 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9181 alloc_cc(&branch_regs[i-1],i);
9182 dirty_reg(&branch_regs[i-1],CCREG);
9183 delayslot_alloc(&branch_regs[i-1],i);
9184 branch_regs[i-1].isconst=0;
9185 alloc_reg(¤t,i,CCREG); // Not taken path
9186 dirty_reg(¤t,CCREG);
9187 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9190 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9192 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9193 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9194 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9195 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9196 alloc_cc(&branch_regs[i-1],i);
9197 dirty_reg(&branch_regs[i-1],CCREG);
9198 delayslot_alloc(&branch_regs[i-1],i);
9199 branch_regs[i-1].isconst=0;
9200 alloc_reg(¤t,i,CCREG); // Not taken path
9201 dirty_reg(¤t,CCREG);
9202 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9206 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9207 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9209 alloc_cc(¤t,i-1);
9210 dirty_reg(¤t,CCREG);
9211 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9212 // The delay slot overwrote the branch condition
9213 // Delay slot goes after the test (in order)
9214 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9215 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9216 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9219 delayslot_alloc(¤t,i);
9224 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9225 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9226 // Alloc the branch condition register
9227 alloc_reg(¤t,i-1,rs1[i-1]);
9228 if(!(current.is32>>rs1[i-1]&1))
9230 alloc_reg64(¤t,i-1,rs1[i-1]);
9233 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9234 branch_regs[i-1].isconst=0;
9235 branch_regs[i-1].wasconst=0;
9236 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9237 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9240 // Alloc the delay slot in case the branch is taken
9241 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9243 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9244 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9245 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9246 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9247 alloc_cc(&branch_regs[i-1],i);
9248 dirty_reg(&branch_regs[i-1],CCREG);
9249 delayslot_alloc(&branch_regs[i-1],i);
9250 branch_regs[i-1].isconst=0;
9251 alloc_reg(¤t,i,CCREG); // Not taken path
9252 dirty_reg(¤t,CCREG);
9253 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9255 // FIXME: BLTZAL/BGEZAL
9256 if(opcode2[i-1]&0x10) { // BxxZAL
9257 alloc_reg(&branch_regs[i-1],i-1,31);
9258 dirty_reg(&branch_regs[i-1],31);
9259 branch_regs[i-1].is32|=1LL<<31;
9263 if(likely[i-1]==0) // BC1F/BC1T
9265 alloc_cc(¤t,i-1);
9266 dirty_reg(¤t,CCREG);
9267 if(itype[i]==FCOMP) {
9268 // The delay slot overwrote the branch condition
9269 // Delay slot goes after the test (in order)
9270 delayslot_alloc(¤t,i);
9275 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9276 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9277 // Alloc the branch condition register
9278 alloc_reg(¤t,i-1,FSREG);
9280 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9281 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9285 // Alloc the delay slot in case the branch is taken
9286 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9287 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9288 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9289 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9290 alloc_cc(&branch_regs[i-1],i);
9291 dirty_reg(&branch_regs[i-1],CCREG);
9292 delayslot_alloc(&branch_regs[i-1],i);
9293 branch_regs[i-1].isconst=0;
9294 alloc_reg(¤t,i,CCREG); // Not taken path
9295 dirty_reg(¤t,CCREG);
9296 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9301 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9303 if(rt1[i-1]==31) // JAL/JALR
9305 // Subroutine call will return here, don't alloc any registers
9308 clear_all_regs(current.regmap);
9309 alloc_reg(¤t,i,CCREG);
9310 dirty_reg(¤t,CCREG);
9314 // Internal branch will jump here, match registers to caller
9315 current.is32=0x3FFFFFFFFLL;
9317 clear_all_regs(current.regmap);
9318 alloc_reg(¤t,i,CCREG);
9319 dirty_reg(¤t,CCREG);
9322 if(ba[j]==start+i*4+4) {
9323 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9324 current.is32=branch_regs[j].is32;
9325 current.dirty=branch_regs[j].dirty;
9330 if(ba[j]==start+i*4+4) {
9331 for(hr=0;hr<HOST_REGS;hr++) {
9332 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9333 current.regmap[hr]=-1;
9335 current.is32&=branch_regs[j].is32;
9336 current.dirty&=branch_regs[j].dirty;
9345 // Count cycles in between branches
9347 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))
9356 flush_dirty_uppers(¤t);
9358 regs[i].is32=current.is32;
9359 regs[i].dirty=current.dirty;
9360 regs[i].isconst=current.isconst;
9361 memcpy(constmap[i],current.constmap,sizeof(current.constmap));
9363 for(hr=0;hr<HOST_REGS;hr++) {
9364 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9365 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9366 regs[i].wasconst&=~(1<<hr);
9370 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9373 /* Pass 4 - Cull unused host registers */
9377 for (i=slen-1;i>=0;i--)
9380 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9382 if(ba[i]<start || ba[i]>=(start+slen*4))
9384 // Branch out of this block, don't need anything
9390 // Need whatever matches the target
9392 int t=(ba[i]-start)>>2;
9393 for(hr=0;hr<HOST_REGS;hr++)
9395 if(regs[i].regmap_entry[hr]>=0) {
9396 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9400 // Conditional branch may need registers for following instructions
9401 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9404 nr|=needed_reg[i+2];
9405 for(hr=0;hr<HOST_REGS;hr++)
9407 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9408 //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]);
9412 // Don't need stuff which is overwritten
9413 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9414 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9415 // Merge in delay slot
9416 for(hr=0;hr<HOST_REGS;hr++)
9419 // These are overwritten unless the branch is "likely"
9420 // and the delay slot is nullified if not taken
9421 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9422 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9424 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9425 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9426 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9427 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9428 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9429 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9430 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9431 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9432 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
9433 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9434 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9436 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
9437 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9438 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9440 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
9441 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9442 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9446 else if(itype[i]==SYSCALL||itype[i]==HLECALL)
9448 // SYSCALL instruction (software interrupt)
9451 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
9453 // ERET instruction (return from interrupt)
9459 for(hr=0;hr<HOST_REGS;hr++) {
9460 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
9461 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
9462 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9463 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9467 for(hr=0;hr<HOST_REGS;hr++)
9469 // Overwritten registers are not needed
9470 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9471 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9472 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9473 // Source registers are needed
9474 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9475 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9476 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
9477 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
9478 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9479 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9480 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9481 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9482 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
9483 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9484 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9486 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
9487 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9488 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9490 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
9491 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9492 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9494 // Don't store a register immediately after writing it,
9495 // may prevent dual-issue.
9496 // But do so if this is a branch target, otherwise we
9497 // might have to load the register before the branch.
9498 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
9499 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
9500 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
9501 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9502 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9504 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
9505 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
9506 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9507 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9511 // Cycle count is needed at branches. Assume it is needed at the target too.
9512 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
9513 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9514 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9519 // Deallocate unneeded registers
9520 for(hr=0;hr<HOST_REGS;hr++)
9523 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
9524 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9525 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9526 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
9528 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9531 regs[i].regmap[hr]=-1;
9532 regs[i].isconst&=~(1<<hr);
9533 if(i<slen-2) regmap_pre[i+2][hr]=-1;
9537 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9539 int d1=0,d2=0,map=0,temp=0;
9540 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
9546 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
9547 itype[i+1]==STORE || itype[i+1]==STORELR ||
9548 itype[i+1]==C1LS || itype[i+1]==C2LS)
9551 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
9552 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9555 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
9556 itype[i+1]==C1LS || itype[i+1]==C2LS)
9558 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9559 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9560 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
9561 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
9562 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9563 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
9564 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
9565 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
9566 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
9567 regs[i].regmap[hr]!=map )
9569 regs[i].regmap[hr]=-1;
9570 regs[i].isconst&=~(1<<hr);
9571 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
9572 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
9573 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
9574 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
9575 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
9576 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
9577 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
9578 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
9579 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
9580 branch_regs[i].regmap[hr]!=map)
9582 branch_regs[i].regmap[hr]=-1;
9583 branch_regs[i].regmap_entry[hr]=-1;
9584 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9586 if(!likely[i]&&i<slen-2) {
9587 regmap_pre[i+2][hr]=-1;
9598 int d1=0,d2=0,map=-1,temp=-1;
9599 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
9605 if(itype[i]==LOAD || itype[i]==LOADLR ||
9606 itype[i]==STORE || itype[i]==STORELR ||
9607 itype[i]==C1LS || itype[i]==C2LS)
9609 } else if(itype[i]==STORE || itype[i]==STORELR ||
9610 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9613 if(itype[i]==LOADLR || itype[i]==STORELR ||
9614 itype[i]==C1LS || itype[i]==C2LS)
9616 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9617 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
9618 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9619 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
9620 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
9621 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
9623 if(i<slen-1&&!is_ds[i]) {
9624 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
9625 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
9626 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
9628 printf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
9629 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
9631 regmap_pre[i+1][hr]=-1;
9632 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
9634 regs[i].regmap[hr]=-1;
9635 regs[i].isconst&=~(1<<hr);
9643 /* Pass 5 - Pre-allocate registers */
9645 // If a register is allocated during a loop, try to allocate it for the
9646 // entire loop, if possible. This avoids loading/storing registers
9647 // inside of the loop.
9649 signed char f_regmap[HOST_REGS];
9650 clear_all_regs(f_regmap);
9651 for(i=0;i<slen-1;i++)
9653 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9655 if(ba[i]>=start && ba[i]<(start+i*4))
9656 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
9657 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
9658 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9659 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9660 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9661 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9663 int t=(ba[i]-start)>>2;
9664 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
9665 if(t<2||(itype[t-2]!=UJUMP)) // call/ret assumes no registers allocated
9666 for(hr=0;hr<HOST_REGS;hr++)
9668 if(regs[i].regmap[hr]>64) {
9669 if(!((regs[i].dirty>>hr)&1))
9670 f_regmap[hr]=regs[i].regmap[hr];
9671 else f_regmap[hr]=-1;
9673 else if(regs[i].regmap[hr]>=0) f_regmap[hr]=regs[i].regmap[hr];
9674 if(branch_regs[i].regmap[hr]>64) {
9675 if(!((branch_regs[i].dirty>>hr)&1))
9676 f_regmap[hr]=branch_regs[i].regmap[hr];
9677 else f_regmap[hr]=-1;
9679 else if(branch_regs[i].regmap[hr]>=0) f_regmap[hr]=branch_regs[i].regmap[hr];
9680 if(itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9681 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9682 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9683 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9685 // Test both in case the delay slot is ooo,
9686 // could be done better...
9687 if(count_free_regs(branch_regs[i].regmap)<2
9688 ||count_free_regs(regs[i].regmap)<2)
9689 f_regmap[hr]=branch_regs[i].regmap[hr];
9691 // Avoid dirty->clean transition
9692 // #ifdef DESTRUCTIVE_WRITEBACK here?
9693 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;
9694 if(f_regmap[hr]>0) {
9695 if(regs[t].regmap_entry[hr]<0) {
9699 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9700 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
9701 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
9703 // NB This can exclude the case where the upper-half
9704 // register is lower numbered than the lower-half
9705 // register. Not sure if it's worth fixing...
9706 if(get_reg(regs[j].regmap,r&63)<0) break;
9707 if(regs[j].is32&(1LL<<(r&63))) break;
9709 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
9710 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9712 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
9713 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
9715 if(get_reg(regs[i].regmap,r&63)<0) break;
9716 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
9719 while(k>1&®s[k-1].regmap[hr]==-1) {
9720 if(itype[k-1]==STORE||itype[k-1]==STORELR
9721 ||itype[k-1]==C1LS||itype[k-1]==SHIFT||itype[k-1]==COP1
9722 ||itype[k-1]==FLOAT||itype[k-1]==FCONV||itype[k-1]==FCOMP
9723 ||itype[k-1]==COP2||itype[k-1]==C2LS||itype[k-1]==C2OP) {
9724 if(count_free_regs(regs[k-1].regmap)<2) {
9725 //printf("no free regs for store %x\n",start+(k-1)*4);
9730 if(itype[k-1]!=NOP&&itype[k-1]!=MOV&&itype[k-1]!=ALU&&itype[k-1]!=SHIFTIMM&&itype[k-1]!=IMM16&&itype[k-1]!=LOAD) break;
9731 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
9732 //printf("no-match due to different register\n");
9735 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
9736 //printf("no-match due to branch\n");
9739 // call/ret fast path assumes no registers allocated
9740 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)) {
9744 // NB This can exclude the case where the upper-half
9745 // register is lower numbered than the lower-half
9746 // register. Not sure if it's worth fixing...
9747 if(get_reg(regs[k-1].regmap,r&63)<0) break;
9748 if(regs[k-1].is32&(1LL<<(r&63))) break;
9753 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
9754 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
9755 //printf("bad match after branch\n");
9759 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
9760 //printf("Extend r%d, %x ->\n",hr,start+k*4);
9762 regs[k].regmap_entry[hr]=f_regmap[hr];
9763 regs[k].regmap[hr]=f_regmap[hr];
9764 regmap_pre[k+1][hr]=f_regmap[hr];
9765 regs[k].wasdirty&=~(1<<hr);
9766 regs[k].dirty&=~(1<<hr);
9767 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
9768 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
9769 regs[k].wasconst&=~(1<<hr);
9770 regs[k].isconst&=~(1<<hr);
9775 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
9778 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
9779 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
9780 //printf("OK fill %x (r%d)\n",start+i*4,hr);
9781 regs[i].regmap_entry[hr]=f_regmap[hr];
9782 regs[i].regmap[hr]=f_regmap[hr];
9783 regs[i].wasdirty&=~(1<<hr);
9784 regs[i].dirty&=~(1<<hr);
9785 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
9786 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
9787 regs[i].wasconst&=~(1<<hr);
9788 regs[i].isconst&=~(1<<hr);
9789 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
9790 branch_regs[i].wasdirty&=~(1<<hr);
9791 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
9792 branch_regs[i].regmap[hr]=f_regmap[hr];
9793 branch_regs[i].dirty&=~(1<<hr);
9794 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
9795 branch_regs[i].wasconst&=~(1<<hr);
9796 branch_regs[i].isconst&=~(1<<hr);
9797 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
9798 regmap_pre[i+2][hr]=f_regmap[hr];
9799 regs[i+2].wasdirty&=~(1<<hr);
9800 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
9801 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
9802 (regs[i+2].was32&(1LL<<f_regmap[hr])));
9807 regs[k].regmap_entry[hr]=f_regmap[hr];
9808 regs[k].regmap[hr]=f_regmap[hr];
9809 regmap_pre[k+1][hr]=f_regmap[hr];
9810 regs[k+1].wasdirty&=~(1<<hr);
9811 regs[k].dirty&=~(1<<hr);
9812 regs[k].wasconst&=~(1<<hr);
9813 regs[k].isconst&=~(1<<hr);
9815 if(regs[j].regmap[hr]==f_regmap[hr])
9816 regs[j].regmap_entry[hr]=f_regmap[hr];
9820 if(regs[j].regmap[hr]>=0)
9822 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
9823 //printf("no-match due to different register\n");
9826 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
9827 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
9830 if(itype[j]==STORE||itype[j]==STORELR||itype[j]==C1LS
9831 ||itype[j]==SHIFT||itype[j]==COP1||itype[j]==FLOAT
9832 ||itype[j]==FCOMP||itype[j]==FCONV
9833 ||itype[j]==COP2||itype[j]==C2LS||itype[j]==C2OP) {
9834 if(count_free_regs(regs[j].regmap)<2) {
9835 //printf("No free regs for store %x\n",start+j*4);
9839 else if(itype[j]!=NOP&&itype[j]!=MOV&&itype[j]!=ALU&&itype[j]!=SHIFTIMM&&itype[j]!=IMM16&&itype[j]!=LOAD) break;
9840 if(f_regmap[hr]>=64) {
9841 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
9846 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
9858 for(hr=0;hr<HOST_REGS;hr++)
9860 if(hr!=EXCLUDE_REG) {
9861 if(regs[i].regmap[hr]>64) {
9862 if(!((regs[i].dirty>>hr)&1))
9863 f_regmap[hr]=regs[i].regmap[hr];
9865 else if(regs[i].regmap[hr]>=0) f_regmap[hr]=regs[i].regmap[hr];
9866 else if(regs[i].regmap[hr]<0) count++;
9869 // Try to restore cycle count at branch targets
9871 for(j=i;j<slen-1;j++) {
9872 if(regs[j].regmap[HOST_CCREG]!=-1) break;
9873 if(itype[j]==STORE||itype[j]==STORELR||itype[j]==C1LS
9874 ||itype[j]==SHIFT||itype[j]==COP1||itype[j]==FLOAT
9875 ||itype[j]==FCOMP||itype[j]==FCONV
9876 ||itype[j]==COP2||itype[j]==C2LS||itype[j]==C2OP) {
9877 if(count_free_regs(regs[j].regmap)<2) {
9878 //printf("no free regs for store %x\n",start+j*4);
9883 if(itype[j]!=NOP&&itype[j]!=MOV&&itype[j]!=ALU&&itype[j]!=SHIFTIMM&&itype[j]!=IMM16&&itype[j]!=LOAD) break;
9885 if(regs[j].regmap[HOST_CCREG]==CCREG) {
9887 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
9889 regs[k].regmap_entry[HOST_CCREG]=CCREG;
9890 regs[k].regmap[HOST_CCREG]=CCREG;
9891 regmap_pre[k+1][HOST_CCREG]=CCREG;
9892 regs[k+1].wasdirty|=1<<HOST_CCREG;
9893 regs[k].dirty|=1<<HOST_CCREG;
9894 regs[k].wasconst&=~(1<<HOST_CCREG);
9895 regs[k].isconst&=~(1<<HOST_CCREG);
9898 regs[j].regmap_entry[HOST_CCREG]=CCREG;
9900 // Work backwards from the branch target
9901 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
9903 //printf("Extend backwards\n");
9906 while(regs[k-1].regmap[HOST_CCREG]==-1) {
9907 if(itype[k-1]==STORE||itype[k-1]==STORELR||itype[k-1]==C1LS
9908 ||itype[k-1]==SHIFT||itype[k-1]==COP1||itype[k-1]==FLOAT
9909 ||itype[k-1]==FCONV||itype[k-1]==FCOMP
9910 ||itype[k-1]==COP2||itype[k-1]==C2LS||itype[k-1]==C2OP) {
9911 if(count_free_regs(regs[k-1].regmap)<2) {
9912 //printf("no free regs for store %x\n",start+(k-1)*4);
9917 if(itype[k-1]!=NOP&&itype[k-1]!=MOV&&itype[k-1]!=ALU&&itype[k-1]!=SHIFTIMM&&itype[k-1]!=IMM16&&itype[k-1]!=LOAD) break;
9920 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
9921 //printf("Extend CC, %x ->\n",start+k*4);
9923 regs[k].regmap_entry[HOST_CCREG]=CCREG;
9924 regs[k].regmap[HOST_CCREG]=CCREG;
9925 regmap_pre[k+1][HOST_CCREG]=CCREG;
9926 regs[k+1].wasdirty|=1<<HOST_CCREG;
9927 regs[k].dirty|=1<<HOST_CCREG;
9928 regs[k].wasconst&=~(1<<HOST_CCREG);
9929 regs[k].isconst&=~(1<<HOST_CCREG);
9934 //printf("Fail Extend CC, %x ->\n",start+k*4);
9938 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
9939 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
9940 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
9941 itype[i]!=FCONV&&itype[i]!=FCOMP&&
9942 itype[i]!=COP2&&itype[i]!=C2LS&&itype[i]!=C2OP)
9944 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
9949 // This allocates registers (if possible) one instruction prior
9950 // to use, which can avoid a load-use penalty on certain CPUs.
9951 for(i=0;i<slen-1;i++)
9953 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
9957 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
9958 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
9961 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
9963 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
9965 regs[i].regmap[hr]=regs[i+1].regmap[hr];
9966 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
9967 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
9968 regs[i].isconst&=~(1<<hr);
9969 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
9970 constmap[i][hr]=constmap[i+1][hr];
9971 regs[i+1].wasdirty&=~(1<<hr);
9972 regs[i].dirty&=~(1<<hr);
9977 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
9979 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
9981 regs[i].regmap[hr]=regs[i+1].regmap[hr];
9982 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
9983 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
9984 regs[i].isconst&=~(1<<hr);
9985 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
9986 constmap[i][hr]=constmap[i+1][hr];
9987 regs[i+1].wasdirty&=~(1<<hr);
9988 regs[i].dirty&=~(1<<hr);
9992 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
9993 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
9995 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
9997 regs[i].regmap[hr]=rs1[i+1];
9998 regmap_pre[i+1][hr]=rs1[i+1];
9999 regs[i+1].regmap_entry[hr]=rs1[i+1];
10000 regs[i].isconst&=~(1<<hr);
10001 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10002 constmap[i][hr]=constmap[i+1][hr];
10003 regs[i+1].wasdirty&=~(1<<hr);
10004 regs[i].dirty&=~(1<<hr);
10008 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10009 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10011 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10013 regs[i].regmap[hr]=rs1[i+1];
10014 regmap_pre[i+1][hr]=rs1[i+1];
10015 regs[i+1].regmap_entry[hr]=rs1[i+1];
10016 regs[i].isconst&=~(1<<hr);
10017 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10018 constmap[i][hr]=constmap[i+1][hr];
10019 regs[i+1].wasdirty&=~(1<<hr);
10020 regs[i].dirty&=~(1<<hr);
10024 #ifndef HOST_IMM_ADDR32
10025 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) {
10026 hr=get_reg(regs[i+1].regmap,TLREG);
10028 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10029 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10031 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10033 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10034 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10035 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10036 regs[i].isconst&=~(1<<hr);
10037 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10038 constmap[i][hr]=constmap[i+1][hr];
10039 regs[i+1].wasdirty&=~(1<<hr);
10040 regs[i].dirty&=~(1<<hr);
10042 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10044 // move it to another register
10045 regs[i+1].regmap[hr]=-1;
10046 regmap_pre[i+2][hr]=-1;
10047 regs[i+1].regmap[nr]=TLREG;
10048 regmap_pre[i+2][nr]=TLREG;
10049 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10050 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10051 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10052 regs[i].isconst&=~(1<<nr);
10053 regs[i+1].isconst&=~(1<<nr);
10054 regs[i].dirty&=~(1<<nr);
10055 regs[i+1].wasdirty&=~(1<<nr);
10056 regs[i+1].dirty&=~(1<<nr);
10057 regs[i+2].wasdirty&=~(1<<nr);
10063 if(itype[i+1]==STORE||itype[i+1]==STORELR
10064 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10065 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10066 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10067 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10068 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10070 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10072 regs[i].regmap[hr]=rs1[i+1];
10073 regmap_pre[i+1][hr]=rs1[i+1];
10074 regs[i+1].regmap_entry[hr]=rs1[i+1];
10075 regs[i].isconst&=~(1<<hr);
10076 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10077 constmap[i][hr]=constmap[i+1][hr];
10078 regs[i+1].wasdirty&=~(1<<hr);
10079 regs[i].dirty&=~(1<<hr);
10083 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10084 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10086 hr=get_reg(regs[i+1].regmap,FTEMP);
10088 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10090 regs[i].regmap[hr]=rs1[i+1];
10091 regmap_pre[i+1][hr]=rs1[i+1];
10092 regs[i+1].regmap_entry[hr]=rs1[i+1];
10093 regs[i].isconst&=~(1<<hr);
10094 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10095 constmap[i][hr]=constmap[i+1][hr];
10096 regs[i+1].wasdirty&=~(1<<hr);
10097 regs[i].dirty&=~(1<<hr);
10099 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10101 // move it to another register
10102 regs[i+1].regmap[hr]=-1;
10103 regmap_pre[i+2][hr]=-1;
10104 regs[i+1].regmap[nr]=FTEMP;
10105 regmap_pre[i+2][nr]=FTEMP;
10106 regs[i].regmap[nr]=rs1[i+1];
10107 regmap_pre[i+1][nr]=rs1[i+1];
10108 regs[i+1].regmap_entry[nr]=rs1[i+1];
10109 regs[i].isconst&=~(1<<nr);
10110 regs[i+1].isconst&=~(1<<nr);
10111 regs[i].dirty&=~(1<<nr);
10112 regs[i+1].wasdirty&=~(1<<nr);
10113 regs[i+1].dirty&=~(1<<nr);
10114 regs[i+2].wasdirty&=~(1<<nr);
10118 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*/) {
10119 if(itype[i+1]==LOAD)
10120 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10121 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10122 hr=get_reg(regs[i+1].regmap,FTEMP);
10123 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10124 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10125 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10127 if(hr>=0&®s[i].regmap[hr]<0) {
10128 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10129 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10130 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10131 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10132 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10133 regs[i].isconst&=~(1<<hr);
10134 regs[i+1].wasdirty&=~(1<<hr);
10135 regs[i].dirty&=~(1<<hr);
10144 /* Pass 6 - Optimize clean/dirty state */
10145 clean_registers(0,slen-1,1);
10147 /* Pass 7 - Identify 32-bit registers */
10153 for (i=slen-1;i>=0;i--)
10156 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10158 if(ba[i]<start || ba[i]>=(start+slen*4))
10160 // Branch out of this block, don't need anything
10166 // Need whatever matches the target
10167 // (and doesn't get overwritten by the delay slot instruction)
10169 int t=(ba[i]-start)>>2;
10170 if(ba[i]>start+i*4) {
10172 if(!(requires_32bit[t]&~regs[i].was32))
10173 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10176 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10177 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10178 if(!(pr32[t]&~regs[i].was32))
10179 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10182 // Conditional branch may need registers for following instructions
10183 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10186 r32|=requires_32bit[i+2];
10187 r32&=regs[i].was32;
10188 // Mark this address as a branch target since it may be called
10189 // upon return from interrupt
10193 // Merge in delay slot
10195 // These are overwritten unless the branch is "likely"
10196 // and the delay slot is nullified if not taken
10197 r32&=~(1LL<<rt1[i+1]);
10198 r32&=~(1LL<<rt2[i+1]);
10200 // Assume these are needed (delay slot)
10203 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
10207 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
10209 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
10211 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
10213 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
10215 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
10218 else if(itype[i]==SYSCALL||itype[i]==HLECALL)
10220 // SYSCALL instruction (software interrupt)
10223 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10225 // ERET instruction (return from interrupt)
10229 r32&=~(1LL<<rt1[i]);
10230 r32&=~(1LL<<rt2[i]);
10233 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
10237 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
10239 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
10241 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
10243 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
10245 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
10247 requires_32bit[i]=r32;
10249 // Dirty registers which are 32-bit, require 32-bit input
10250 // as they will be written as 32-bit values
10251 for(hr=0;hr<HOST_REGS;hr++)
10253 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
10254 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
10255 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
10256 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
10260 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
10263 if(itype[slen-1]==SPAN) {
10264 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
10267 /* Debug/disassembly */
10268 if((void*)assem_debug==(void*)printf)
10269 for(i=0;i<slen;i++)
10273 for(r=1;r<=CCREG;r++) {
10274 if((unneeded_reg[i]>>r)&1) {
10275 if(r==HIREG) printf(" HI");
10276 else if(r==LOREG) printf(" LO");
10277 else printf(" r%d",r);
10282 for(r=1;r<=CCREG;r++) {
10283 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
10284 if(r==HIREG) printf(" HI");
10285 else if(r==LOREG) printf(" LO");
10286 else printf(" r%d",r);
10290 for(r=0;r<=CCREG;r++) {
10291 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10292 if((regs[i].was32>>r)&1) {
10293 if(r==CCREG) printf(" CC");
10294 else if(r==HIREG) printf(" HI");
10295 else if(r==LOREG) printf(" LO");
10296 else printf(" r%d",r);
10301 #if defined(__i386__) || defined(__x86_64__)
10302 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]);
10305 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]);
10308 if(needed_reg[i]&1) printf("eax ");
10309 if((needed_reg[i]>>1)&1) printf("ecx ");
10310 if((needed_reg[i]>>2)&1) printf("edx ");
10311 if((needed_reg[i]>>3)&1) printf("ebx ");
10312 if((needed_reg[i]>>5)&1) printf("ebp ");
10313 if((needed_reg[i]>>6)&1) printf("esi ");
10314 if((needed_reg[i]>>7)&1) printf("edi ");
10316 for(r=0;r<=CCREG;r++) {
10317 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10318 if((requires_32bit[i]>>r)&1) {
10319 if(r==CCREG) printf(" CC");
10320 else if(r==HIREG) printf(" HI");
10321 else if(r==LOREG) printf(" LO");
10322 else printf(" r%d",r);
10327 for(r=0;r<=CCREG;r++) {
10328 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10329 if((pr32[i]>>r)&1) {
10330 if(r==CCREG) printf(" CC");
10331 else if(r==HIREG) printf(" HI");
10332 else if(r==LOREG) printf(" LO");
10333 else printf(" r%d",r);
10336 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
10338 #if defined(__i386__) || defined(__x86_64__)
10339 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]);
10341 if(regs[i].wasdirty&1) printf("eax ");
10342 if((regs[i].wasdirty>>1)&1) printf("ecx ");
10343 if((regs[i].wasdirty>>2)&1) printf("edx ");
10344 if((regs[i].wasdirty>>3)&1) printf("ebx ");
10345 if((regs[i].wasdirty>>5)&1) printf("ebp ");
10346 if((regs[i].wasdirty>>6)&1) printf("esi ");
10347 if((regs[i].wasdirty>>7)&1) printf("edi ");
10350 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]);
10352 if(regs[i].wasdirty&1) printf("r0 ");
10353 if((regs[i].wasdirty>>1)&1) printf("r1 ");
10354 if((regs[i].wasdirty>>2)&1) printf("r2 ");
10355 if((regs[i].wasdirty>>3)&1) printf("r3 ");
10356 if((regs[i].wasdirty>>4)&1) printf("r4 ");
10357 if((regs[i].wasdirty>>5)&1) printf("r5 ");
10358 if((regs[i].wasdirty>>6)&1) printf("r6 ");
10359 if((regs[i].wasdirty>>7)&1) printf("r7 ");
10360 if((regs[i].wasdirty>>8)&1) printf("r8 ");
10361 if((regs[i].wasdirty>>9)&1) printf("r9 ");
10362 if((regs[i].wasdirty>>10)&1) printf("r10 ");
10363 if((regs[i].wasdirty>>12)&1) printf("r12 ");
10366 disassemble_inst(i);
10367 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
10368 #if defined(__i386__) || defined(__x86_64__)
10369 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]);
10370 if(regs[i].dirty&1) printf("eax ");
10371 if((regs[i].dirty>>1)&1) printf("ecx ");
10372 if((regs[i].dirty>>2)&1) printf("edx ");
10373 if((regs[i].dirty>>3)&1) printf("ebx ");
10374 if((regs[i].dirty>>5)&1) printf("ebp ");
10375 if((regs[i].dirty>>6)&1) printf("esi ");
10376 if((regs[i].dirty>>7)&1) printf("edi ");
10379 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]);
10380 if(regs[i].dirty&1) printf("r0 ");
10381 if((regs[i].dirty>>1)&1) printf("r1 ");
10382 if((regs[i].dirty>>2)&1) printf("r2 ");
10383 if((regs[i].dirty>>3)&1) printf("r3 ");
10384 if((regs[i].dirty>>4)&1) printf("r4 ");
10385 if((regs[i].dirty>>5)&1) printf("r5 ");
10386 if((regs[i].dirty>>6)&1) printf("r6 ");
10387 if((regs[i].dirty>>7)&1) printf("r7 ");
10388 if((regs[i].dirty>>8)&1) printf("r8 ");
10389 if((regs[i].dirty>>9)&1) printf("r9 ");
10390 if((regs[i].dirty>>10)&1) printf("r10 ");
10391 if((regs[i].dirty>>12)&1) printf("r12 ");
10394 if(regs[i].isconst) {
10395 printf("constants: ");
10396 #if defined(__i386__) || defined(__x86_64__)
10397 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
10398 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
10399 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
10400 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
10401 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
10402 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
10403 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
10406 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
10407 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
10408 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
10409 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
10410 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
10411 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
10412 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
10413 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
10414 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
10415 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
10416 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
10417 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
10423 for(r=0;r<=CCREG;r++) {
10424 if((regs[i].is32>>r)&1) {
10425 if(r==CCREG) printf(" CC");
10426 else if(r==HIREG) printf(" HI");
10427 else if(r==LOREG) printf(" LO");
10428 else printf(" r%d",r);
10434 for(r=0;r<=CCREG;r++) {
10435 if((p32[i]>>r)&1) {
10436 if(r==CCREG) printf(" CC");
10437 else if(r==HIREG) printf(" HI");
10438 else if(r==LOREG) printf(" LO");
10439 else printf(" r%d",r);
10442 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
10443 else printf("\n");*/
10444 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10445 #if defined(__i386__) || defined(__x86_64__)
10446 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]);
10447 if(branch_regs[i].dirty&1) printf("eax ");
10448 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
10449 if((branch_regs[i].dirty>>2)&1) printf("edx ");
10450 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
10451 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
10452 if((branch_regs[i].dirty>>6)&1) printf("esi ");
10453 if((branch_regs[i].dirty>>7)&1) printf("edi ");
10456 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]);
10457 if(branch_regs[i].dirty&1) printf("r0 ");
10458 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
10459 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
10460 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
10461 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
10462 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
10463 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
10464 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
10465 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
10466 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
10467 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
10468 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
10472 for(r=0;r<=CCREG;r++) {
10473 if((branch_regs[i].is32>>r)&1) {
10474 if(r==CCREG) printf(" CC");
10475 else if(r==HIREG) printf(" HI");
10476 else if(r==LOREG) printf(" LO");
10477 else printf(" r%d",r);
10485 /* Pass 8 - Assembly */
10486 linkcount=0;stubcount=0;
10487 ds=0;is_delayslot=0;
10489 uint64_t is32_pre=0;
10491 u_int beginning=(u_int)out;
10492 if((u_int)addr&1) {
10496 for(i=0;i<slen;i++)
10498 //if(ds) printf("ds: ");
10499 if((void*)assem_debug==(void*)printf) disassemble_inst(i);
10501 ds=0; // Skip delay slot
10502 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
10505 #ifndef DESTRUCTIVE_WRITEBACK
10506 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10508 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
10509 unneeded_reg[i],unneeded_reg_upper[i]);
10510 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
10511 unneeded_reg[i],unneeded_reg_upper[i]);
10513 is32_pre=regs[i].is32;
10514 dirty_pre=regs[i].dirty;
10517 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10519 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
10520 unneeded_reg[i],unneeded_reg_upper[i]);
10521 loop_preload(regmap_pre[i],regs[i].regmap_entry);
10523 // branch target entry point
10524 instr_addr[i]=(u_int)out;
10525 assem_debug("<->\n");
10527 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
10528 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
10529 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
10530 address_generation(i,®s[i],regs[i].regmap_entry);
10531 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
10532 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10534 // Load the delay slot registers if necessary
10535 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10536 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10537 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10538 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10539 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
10540 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10544 // Preload registers for following instruction
10545 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10546 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
10547 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10548 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10549 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
10550 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10552 // TODO: if(is_ooo(i)) address_generation(i+1);
10553 if(itype[i]==CJUMP||itype[i]==FJUMP)
10554 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
10555 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
10556 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10557 if(bt[i]) cop1_usable=0;
10561 alu_assemble(i,®s[i]);break;
10563 imm16_assemble(i,®s[i]);break;
10565 shift_assemble(i,®s[i]);break;
10567 shiftimm_assemble(i,®s[i]);break;
10569 load_assemble(i,®s[i]);break;
10571 loadlr_assemble(i,®s[i]);break;
10573 store_assemble(i,®s[i]);break;
10575 storelr_assemble(i,®s[i]);break;
10577 cop0_assemble(i,®s[i]);break;
10579 cop1_assemble(i,®s[i]);break;
10581 c1ls_assemble(i,®s[i]);break;
10583 cop2_assemble(i,®s[i]);break;
10585 c2ls_assemble(i,®s[i]);break;
10587 c2op_assemble(i,®s[i]);break;
10589 fconv_assemble(i,®s[i]);break;
10591 float_assemble(i,®s[i]);break;
10593 fcomp_assemble(i,®s[i]);break;
10595 multdiv_assemble(i,®s[i]);break;
10597 mov_assemble(i,®s[i]);break;
10599 syscall_assemble(i,®s[i]);break;
10601 hlecall_assemble(i,®s[i]);break;
10603 ujump_assemble(i,®s[i]);ds=1;break;
10605 rjump_assemble(i,®s[i]);ds=1;break;
10607 cjump_assemble(i,®s[i]);ds=1;break;
10609 sjump_assemble(i,®s[i]);ds=1;break;
10611 fjump_assemble(i,®s[i]);ds=1;break;
10613 pagespan_assemble(i,®s[i]);break;
10615 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10616 literal_pool(1024);
10618 literal_pool_jumpover(256);
10621 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
10622 // If the block did not end with an unconditional branch,
10623 // add a jump to the next instruction.
10625 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
10626 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10628 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
10629 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10630 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10631 emit_loadreg(CCREG,HOST_CCREG);
10632 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10634 else if(!likely[i-2])
10636 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
10637 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
10641 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
10642 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
10644 add_to_linker((int)out,start+i*4,0);
10651 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10652 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10653 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10654 emit_loadreg(CCREG,HOST_CCREG);
10655 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10656 add_to_linker((int)out,start+i*4,0);
10660 // TODO: delay slot stubs?
10662 for(i=0;i<stubcount;i++)
10664 switch(stubs[i][0])
10672 do_readstub(i);break;
10677 do_writestub(i);break;
10679 do_ccstub(i);break;
10681 do_invstub(i);break;
10683 do_cop1stub(i);break;
10685 do_unalignedwritestub(i);break;
10689 /* Pass 9 - Linker */
10690 for(i=0;i<linkcount;i++)
10692 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
10694 if(!link_addr[i][2])
10697 void *addr=check_addr(link_addr[i][1]);
10698 emit_extjump(link_addr[i][0],link_addr[i][1]);
10700 set_jump_target(link_addr[i][0],(int)addr);
10701 add_link(link_addr[i][1],stub);
10703 else set_jump_target(link_addr[i][0],(int)stub);
10708 int target=(link_addr[i][1]-start)>>2;
10709 assert(target>=0&&target<slen);
10710 assert(instr_addr[target]);
10711 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
10712 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
10714 set_jump_target(link_addr[i][0],instr_addr[target]);
10718 // External Branch Targets (jump_in)
10719 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
10720 for(i=0;i<slen;i++)
10724 if(instr_addr[i]) // TODO - delay slots (=null)
10726 u_int vaddr=start+i*4;
10727 u_int page=get_page(vaddr);
10728 u_int vpage=get_vpage(vaddr);
10730 //if(!(is32[i]&(~unneeded_reg_upper[i])&~(1LL<<CCREG)))
10731 if(!requires_32bit[i])
10733 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
10734 assem_debug("jump_in: %x\n",start+i*4);
10735 ll_add(jump_dirty+vpage,vaddr,(void *)out);
10736 int entry_point=do_dirty_stub(i);
10737 ll_add(jump_in+page,vaddr,(void *)entry_point);
10738 // If there was an existing entry in the hash table,
10739 // replace it with the new address.
10740 // Don't add new entries. We'll insert the
10741 // ones that actually get used in check_addr().
10742 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
10743 if(ht_bin[0]==vaddr) {
10744 ht_bin[1]=entry_point;
10746 if(ht_bin[2]==vaddr) {
10747 ht_bin[3]=entry_point;
10752 u_int r=requires_32bit[i]|!!(requires_32bit[i]>>32);
10753 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
10754 assem_debug("jump_in: %x (restricted - %x)\n",start+i*4,r);
10755 //int entry_point=(int)out;
10756 ////assem_debug("entry_point: %x\n",entry_point);
10757 //load_regs_entry(i);
10758 //if(entry_point==(int)out)
10759 // entry_point=instr_addr[i];
10761 // emit_jmp(instr_addr[i]);
10762 //ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
10763 ll_add_32(jump_dirty+vpage,vaddr,r,(void *)out);
10764 int entry_point=do_dirty_stub(i);
10765 ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
10770 // Write out the literal pool if necessary
10772 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
10774 if(((u_int)out)&7) emit_addnop(13);
10776 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
10777 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
10778 memcpy(copy,source,slen*4);
10782 __clear_cache((void *)beginning,out);
10785 // If we're within 256K of the end of the buffer,
10786 // start over from the beginning. (Is 256K enough?)
10787 if((int)out>BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
10789 // Trap writes to any of the pages we compiled
10790 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
10792 #ifndef DISABLE_TLB
10793 memory_map[i]|=0x40000000;
10794 if((signed int)start>=(signed int)0xC0000000) {
10796 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
10798 memory_map[j]|=0x40000000;
10799 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
10804 /* Pass 10 - Free memory by expiring oldest blocks */
10806 int end=((((int)out-BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
10807 while(expirep!=end)
10809 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
10810 int base=BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
10811 inv_debug("EXP: Phase %d\n",expirep);
10812 switch((expirep>>11)&3)
10815 // Clear jump_in and jump_dirty
10816 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
10817 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
10818 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
10819 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
10823 ll_kill_pointers(jump_out[expirep&2047],base,shift);
10824 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
10827 // Clear hash table
10828 for(i=0;i<32;i++) {
10829 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
10830 if((ht_bin[3]>>shift)==(base>>shift) ||
10831 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
10832 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
10833 ht_bin[2]=ht_bin[3]=-1;
10835 if((ht_bin[1]>>shift)==(base>>shift) ||
10836 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
10837 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
10838 ht_bin[0]=ht_bin[2];
10839 ht_bin[1]=ht_bin[3];
10840 ht_bin[2]=ht_bin[3]=-1;
10846 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
10847 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
10850 expirep=(expirep+1)&65535;
10855 // vim:shiftwidth=2:expandtab