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];
88 uint64_t unneeded_reg[MAXBLOCK];
89 uint64_t unneeded_reg_upper[MAXBLOCK];
90 uint64_t branch_unneeded_reg[MAXBLOCK];
91 uint64_t branch_unneeded_reg_upper[MAXBLOCK];
92 uint64_t p32[MAXBLOCK];
93 uint64_t pr32[MAXBLOCK];
94 signed char regmap_pre[MAXBLOCK][HOST_REGS];
95 signed char regmap[MAXBLOCK][HOST_REGS];
96 signed char regmap_entry[MAXBLOCK][HOST_REGS];
97 uint64_t constmap[MAXBLOCK][HOST_REGS];
98 struct regstat regs[MAXBLOCK];
99 struct regstat branch_regs[MAXBLOCK];
100 signed char minimum_free_regs[MAXBLOCK];
101 u_int needed_reg[MAXBLOCK];
102 uint64_t requires_32bit[MAXBLOCK];
103 u_int wont_dirty[MAXBLOCK];
104 u_int will_dirty[MAXBLOCK];
107 u_int instr_addr[MAXBLOCK];
108 u_int link_addr[MAXBLOCK][3];
110 u_int stubs[MAXBLOCK*3][8];
112 u_int literals[1024][2];
117 struct ll_entry *jump_in[4096];
118 struct ll_entry *jump_out[4096];
119 struct ll_entry *jump_dirty[4096];
120 u_int hash_table[65536][4] __attribute__((aligned(16)));
121 char shadow[1048576] __attribute__((aligned(16)));
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
137 #define MMREG 38 // Pointer to memory_map
138 #define ROREG 39 // ram offset (if rdram!=0x80000000)
140 #define FTEMP 40 // FPU temporary register
141 #define PTEMP 41 // Prefetch temporary register
142 #define TLREG 42 // TLB mapping offset
143 #define RHASH 43 // Return address hash
144 #define RHTBL 44 // Return address hash table address
145 #define RTEMP 45 // JR/JALR address register
147 #define AGEN1 46 // Address generation temporary register
148 #define AGEN2 47 // Address generation temporary register
149 #define MGEN1 48 // Maptable address generation temporary register
150 #define MGEN2 49 // Maptable address generation temporary register
151 #define BTREG 50 // Branch target temporary register
153 /* instruction types */
154 #define NOP 0 // No operation
155 #define LOAD 1 // Load
156 #define STORE 2 // Store
157 #define LOADLR 3 // Unaligned load
158 #define STORELR 4 // Unaligned store
159 #define MOV 5 // Move
160 #define ALU 6 // Arithmetic/logic
161 #define MULTDIV 7 // Multiply/divide
162 #define SHIFT 8 // Shift by register
163 #define SHIFTIMM 9// Shift by immediate
164 #define IMM16 10 // 16-bit immediate
165 #define RJUMP 11 // Unconditional jump to register
166 #define UJUMP 12 // Unconditional jump
167 #define CJUMP 13 // Conditional branch (BEQ/BNE/BGTZ/BLEZ)
168 #define SJUMP 14 // Conditional branch (regimm format)
169 #define COP0 15 // Coprocessor 0
170 #define COP1 16 // Coprocessor 1
171 #define C1LS 17 // Coprocessor 1 load/store
172 #define FJUMP 18 // Conditional branch (floating point)
173 #define FLOAT 19 // Floating point unit
174 #define FCONV 20 // Convert integer to float
175 #define FCOMP 21 // Floating point compare (sets FSREG)
176 #define SYSCALL 22// SYSCALL
177 #define OTHER 23 // Other
178 #define SPAN 24 // Branch/delay slot spans 2 pages
179 #define NI 25 // Not implemented
180 #define HLECALL 26// PCSX fake opcodes for HLE
181 #define COP2 27 // Coprocessor 2 move
182 #define C2LS 28 // Coprocessor 2 load/store
183 #define C2OP 29 // Coprocessor 2 operation
184 #define INTCALL 30// Call interpreter to handle rare corner cases
193 #define LOADBU_STUB 7
194 #define LOADHU_STUB 8
195 #define STOREB_STUB 9
196 #define STOREH_STUB 10
197 #define STOREW_STUB 11
198 #define STORED_STUB 12
199 #define STORELR_STUB 13
200 #define INVCODE_STUB 14
208 int new_recompile_block(int addr);
209 void *get_addr_ht(u_int vaddr);
210 void invalidate_block(u_int block);
211 void invalidate_addr(u_int addr);
212 void remove_hash(int vaddr);
215 void dyna_linker_ds();
217 void verify_code_vm();
218 void verify_code_ds();
221 void fp_exception_ds();
223 void jump_syscall_hle();
227 void new_dyna_leave();
232 void read_nomem_new();
233 void read_nomemb_new();
234 void read_nomemh_new();
235 void read_nomemd_new();
236 void write_nomem_new();
237 void write_nomemb_new();
238 void write_nomemh_new();
239 void write_nomemd_new();
240 void write_rdram_new();
241 void write_rdramb_new();
242 void write_rdramh_new();
243 void write_rdramd_new();
244 extern u_int memory_map[1048576];
246 // Needed by assembler
247 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32);
248 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty);
249 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr);
250 void load_all_regs(signed char i_regmap[]);
251 void load_needed_regs(signed char i_regmap[],signed char next_regmap[]);
252 void load_regs_entry(int t);
253 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i);
257 //#define DEBUG_CYCLE_COUNT 1
260 //#define assem_debug printf
261 //#define inv_debug printf
262 #define assem_debug nullf
263 #define inv_debug nullf
265 static void tlb_hacks()
269 if (strncmp((char *) ROM_HEADER->nom, "GOLDENEYE",9) == 0)
273 switch (ROM_HEADER->Country_code&0xFF)
285 // Unknown country code
289 u_int rom_addr=(u_int)rom;
291 // Since memory_map is 32-bit, on 64-bit systems the rom needs to be
292 // in the lower 4G of memory to use this hack. Copy it if necessary.
293 if((void *)rom>(void *)0xffffffff) {
294 munmap(ROM_COPY, 67108864);
295 if(mmap(ROM_COPY, 12582912,
296 PROT_READ | PROT_WRITE,
297 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
298 -1, 0) <= 0) {printf("mmap() failed\n");}
299 memcpy(ROM_COPY,rom,12582912);
300 rom_addr=(u_int)ROM_COPY;
304 for(n=0x7F000;n<0x80000;n++) {
305 memory_map[n]=(((u_int)(rom_addr+addr-0x7F000000))>>2)|0x40000000;
312 static u_int get_page(u_int vaddr)
315 u_int page=(vaddr^0x80000000)>>12;
317 u_int page=vaddr&~0xe0000000;
318 if (page < 0x1000000)
319 page &= ~0x0e00000; // RAM mirrors
323 if(page>262143&&tlb_LUT_r[vaddr>>12]) page=(tlb_LUT_r[vaddr>>12]^0x80000000)>>12;
325 if(page>2048) page=2048+(page&2047);
329 static u_int get_vpage(u_int vaddr)
331 u_int vpage=(vaddr^0x80000000)>>12;
333 if(vpage>262143&&tlb_LUT_r[vaddr>>12]) vpage&=2047; // jump_dirty uses a hash of the virtual address instead
335 if(vpage>2048) vpage=2048+(vpage&2047);
339 // Get address from virtual address
340 // This is called from the recompiled JR/JALR instructions
341 void *get_addr(u_int vaddr)
343 u_int page=get_page(vaddr);
344 u_int vpage=get_vpage(vaddr);
345 struct ll_entry *head;
346 //printf("TRACE: count=%d next=%d (get_addr %x,page %d)\n",Count,next_interupt,vaddr,page);
349 if(head->vaddr==vaddr&&head->reg32==0) {
350 //printf("TRACE: count=%d next=%d (get_addr match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
351 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
354 ht_bin[1]=(int)head->addr;
360 head=jump_dirty[vpage];
362 if(head->vaddr==vaddr&&head->reg32==0) {
363 //printf("TRACE: count=%d next=%d (get_addr match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
364 // Don't restore blocks which are about to expire from the cache
365 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
366 if(verify_dirty(head->addr)) {
367 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
368 invalid_code[vaddr>>12]=0;
369 memory_map[vaddr>>12]|=0x40000000;
372 if(tlb_LUT_r[vaddr>>12]) {
373 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
374 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
377 restore_candidate[vpage>>3]|=1<<(vpage&7);
379 else restore_candidate[page>>3]|=1<<(page&7);
380 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
381 if(ht_bin[0]==vaddr) {
382 ht_bin[1]=(int)head->addr; // Replace existing entry
388 ht_bin[1]=(int)head->addr;
396 //printf("TRACE: count=%d next=%d (get_addr no-match %x)\n",Count,next_interupt,vaddr);
397 int r=new_recompile_block(vaddr);
398 if(r==0) return get_addr(vaddr);
399 // Execute in unmapped page, generate pagefault execption
401 Cause=(vaddr<<31)|0x8;
402 EPC=(vaddr&1)?vaddr-5:vaddr;
404 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
405 EntryHi=BadVAddr&0xFFFFE000;
406 return get_addr_ht(0x80000000);
408 // Look up address in hash table first
409 void *get_addr_ht(u_int vaddr)
411 //printf("TRACE: count=%d next=%d (get_addr_ht %x)\n",Count,next_interupt,vaddr);
412 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
413 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
414 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
415 return get_addr(vaddr);
418 void *get_addr_32(u_int vaddr,u_int flags)
421 return get_addr(vaddr);
423 //printf("TRACE: count=%d next=%d (get_addr_32 %x,flags %x)\n",Count,next_interupt,vaddr,flags);
424 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
425 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
426 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
427 u_int page=get_page(vaddr);
428 u_int vpage=get_vpage(vaddr);
429 struct ll_entry *head;
432 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
433 //printf("TRACE: count=%d next=%d (get_addr_32 match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
435 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
437 ht_bin[1]=(int)head->addr;
439 }else if(ht_bin[2]==-1) {
440 ht_bin[3]=(int)head->addr;
443 //ht_bin[3]=ht_bin[1];
444 //ht_bin[2]=ht_bin[0];
445 //ht_bin[1]=(int)head->addr;
452 head=jump_dirty[vpage];
454 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
455 //printf("TRACE: count=%d next=%d (get_addr_32 match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
456 // Don't restore blocks which are about to expire from the cache
457 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
458 if(verify_dirty(head->addr)) {
459 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
460 invalid_code[vaddr>>12]=0;
461 memory_map[vaddr>>12]|=0x40000000;
464 if(tlb_LUT_r[vaddr>>12]) {
465 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
466 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
469 restore_candidate[vpage>>3]|=1<<(vpage&7);
471 else restore_candidate[page>>3]|=1<<(page&7);
473 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
475 ht_bin[1]=(int)head->addr;
477 }else if(ht_bin[2]==-1) {
478 ht_bin[3]=(int)head->addr;
481 //ht_bin[3]=ht_bin[1];
482 //ht_bin[2]=ht_bin[0];
483 //ht_bin[1]=(int)head->addr;
491 //printf("TRACE: count=%d next=%d (get_addr_32 no-match %x,flags %x)\n",Count,next_interupt,vaddr,flags);
492 int r=new_recompile_block(vaddr);
493 if(r==0) return get_addr(vaddr);
494 // Execute in unmapped page, generate pagefault execption
496 Cause=(vaddr<<31)|0x8;
497 EPC=(vaddr&1)?vaddr-5:vaddr;
499 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
500 EntryHi=BadVAddr&0xFFFFE000;
501 return get_addr_ht(0x80000000);
505 void clear_all_regs(signed char regmap[])
508 for (hr=0;hr<HOST_REGS;hr++) regmap[hr]=-1;
511 signed char get_reg(signed char regmap[],int r)
514 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map[hr]==r) return hr;
518 // Find a register that is available for two consecutive cycles
519 signed char get_reg2(signed char regmap1[],signed char regmap2[],int r)
522 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map1[hr]==r&®map2[hr]==r) return hr;
526 int count_free_regs(signed char regmap[])
530 for(hr=0;hr<HOST_REGS;hr++)
532 if(hr!=EXCLUDE_REG) {
533 if(regmap[hr]<0) count++;
539 void dirty_reg(struct regstat *cur,signed char reg)
543 for (hr=0;hr<HOST_REGS;hr++) {
544 if((cur->regmap[hr]&63)==reg) {
550 // If we dirty the lower half of a 64 bit register which is now being
551 // sign-extended, we need to dump the upper half.
552 // Note: Do this only after completion of the instruction, because
553 // some instructions may need to read the full 64-bit value even if
554 // overwriting it (eg SLTI, DSRA32).
555 static void flush_dirty_uppers(struct regstat *cur)
558 for (hr=0;hr<HOST_REGS;hr++) {
559 if((cur->dirty>>hr)&1) {
562 if((cur->is32>>(reg&63))&1) cur->regmap[hr]=-1;
567 void set_const(struct regstat *cur,signed char reg,uint64_t value)
571 for (hr=0;hr<HOST_REGS;hr++) {
572 if(cur->regmap[hr]==reg) {
574 cur->constmap[hr]=value;
576 else if((cur->regmap[hr]^64)==reg) {
578 cur->constmap[hr]=value>>32;
583 void clear_const(struct regstat *cur,signed char reg)
587 for (hr=0;hr<HOST_REGS;hr++) {
588 if((cur->regmap[hr]&63)==reg) {
589 cur->isconst&=~(1<<hr);
594 int is_const(struct regstat *cur,signed char reg)
598 for (hr=0;hr<HOST_REGS;hr++) {
599 if((cur->regmap[hr]&63)==reg) {
600 return (cur->isconst>>hr)&1;
605 uint64_t get_const(struct regstat *cur,signed char reg)
609 for (hr=0;hr<HOST_REGS;hr++) {
610 if(cur->regmap[hr]==reg) {
611 return cur->constmap[hr];
614 printf("Unknown constant in r%d\n",reg);
618 // Least soon needed registers
619 // Look at the next ten instructions and see which registers
620 // will be used. Try not to reallocate these.
621 void lsn(u_char hsn[], int i, int *preferred_reg)
631 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
633 // Don't go past an unconditonal jump
640 if(rs1[i+j]) hsn[rs1[i+j]]=j;
641 if(rs2[i+j]) hsn[rs2[i+j]]=j;
642 if(rt1[i+j]) hsn[rt1[i+j]]=j;
643 if(rt2[i+j]) hsn[rt2[i+j]]=j;
644 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
645 // Stores can allocate zero
649 // On some architectures stores need invc_ptr
650 #if defined(HOST_IMM8)
651 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
655 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
663 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
665 // Follow first branch
666 int t=(ba[i+b]-start)>>2;
667 j=7-b;if(t+j>=slen) j=slen-t-1;
670 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
671 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
672 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
673 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
676 // TODO: preferred register based on backward branch
678 // Delay slot should preferably not overwrite branch conditions or cycle count
679 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
680 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
681 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
687 // Coprocessor load/store needs FTEMP, even if not declared
688 if(itype[i]==C1LS||itype[i]==C2LS) {
691 // Load L/R also uses FTEMP as a temporary register
692 if(itype[i]==LOADLR) {
695 // Also SWL/SWR/SDL/SDR
696 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
699 // Don't remove the TLB registers either
700 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
703 // Don't remove the miniht registers
704 if(itype[i]==UJUMP||itype[i]==RJUMP)
711 // We only want to allocate registers if we're going to use them again soon
712 int needed_again(int r, int i)
718 u_char hsn[MAXREG+1];
721 memset(hsn,10,sizeof(hsn));
722 lsn(hsn,i,&preferred_reg);
724 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
726 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
727 return 0; // Don't need any registers if exiting the block
735 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
737 // Don't go past an unconditonal jump
741 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||itype[i+j]==INTCALL||((source[i+j]&0xfc00003f)==0x0d))
748 if(rs1[i+j]==r) rn=j;
749 if(rs2[i+j]==r) rn=j;
750 if((unneeded_reg[i+j]>>r)&1) rn=10;
751 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
759 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
761 // Follow first branch
763 int t=(ba[i+b]-start)>>2;
764 j=7-b;if(t+j>=slen) j=slen-t-1;
767 if(!((unneeded_reg[t+j]>>r)&1)) {
768 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
769 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
775 for(hr=0;hr<HOST_REGS;hr++) {
776 if(hr!=EXCLUDE_REG) {
777 if(rn<hsn[hr]) return 1;
783 // Try to match register allocations at the end of a loop with those
785 int loop_reg(int i, int r, int hr)
794 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
796 // Don't go past an unconditonal jump
803 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
808 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
809 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
810 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
812 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
814 int t=(ba[i+k]-start)>>2;
815 int reg=get_reg(regs[t].regmap_entry,r);
816 if(reg>=0) return reg;
817 //reg=get_reg(regs[t+1].regmap_entry,r);
818 //if(reg>=0) return reg;
826 // Allocate every register, preserving source/target regs
827 void alloc_all(struct regstat *cur,int i)
831 for(hr=0;hr<HOST_REGS;hr++) {
832 if(hr!=EXCLUDE_REG) {
833 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
834 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
837 cur->dirty&=~(1<<hr);
840 if((cur->regmap[hr]&63)==0)
843 cur->dirty&=~(1<<hr);
850 void div64(int64_t dividend,int64_t divisor)
854 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
855 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
857 void divu64(uint64_t dividend,uint64_t divisor)
861 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
862 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
865 void mult64(uint64_t m1,uint64_t m2)
867 unsigned long long int op1, op2, op3, op4;
868 unsigned long long int result1, result2, result3, result4;
869 unsigned long long int temp1, temp2, temp3, temp4;
885 op1 = op2 & 0xFFFFFFFF;
886 op2 = (op2 >> 32) & 0xFFFFFFFF;
887 op3 = op4 & 0xFFFFFFFF;
888 op4 = (op4 >> 32) & 0xFFFFFFFF;
891 temp2 = (temp1 >> 32) + op1 * op4;
893 temp4 = (temp3 >> 32) + op2 * op4;
895 result1 = temp1 & 0xFFFFFFFF;
896 result2 = temp2 + (temp3 & 0xFFFFFFFF);
897 result3 = (result2 >> 32) + temp4;
898 result4 = (result3 >> 32);
900 lo = result1 | (result2 << 32);
901 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
910 void multu64(uint64_t m1,uint64_t m2)
912 unsigned long long int op1, op2, op3, op4;
913 unsigned long long int result1, result2, result3, result4;
914 unsigned long long int temp1, temp2, temp3, temp4;
916 op1 = m1 & 0xFFFFFFFF;
917 op2 = (m1 >> 32) & 0xFFFFFFFF;
918 op3 = m2 & 0xFFFFFFFF;
919 op4 = (m2 >> 32) & 0xFFFFFFFF;
922 temp2 = (temp1 >> 32) + op1 * op4;
924 temp4 = (temp3 >> 32) + op2 * op4;
926 result1 = temp1 & 0xFFFFFFFF;
927 result2 = temp2 + (temp3 & 0xFFFFFFFF);
928 result3 = (result2 >> 32) + temp4;
929 result4 = (result3 >> 32);
931 lo = result1 | (result2 << 32);
932 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
934 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
935 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
938 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
946 else original=loaded;
949 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
952 original>>=64-(bits^56);
953 original<<=64-(bits^56);
957 else original=loaded;
962 #include "assem_x86.c"
965 #include "assem_x64.c"
968 #include "assem_arm.c"
971 // Add virtual address mapping to linked list
972 void ll_add(struct ll_entry **head,int vaddr,void *addr)
974 struct ll_entry *new_entry;
975 new_entry=malloc(sizeof(struct ll_entry));
976 assert(new_entry!=NULL);
977 new_entry->vaddr=vaddr;
979 new_entry->addr=addr;
980 new_entry->next=*head;
984 // Add virtual address mapping for 32-bit compiled block
985 void ll_add_32(struct ll_entry **head,int vaddr,u_int reg32,void *addr)
987 ll_add(head,vaddr,addr);
989 (*head)->reg32=reg32;
993 // Check if an address is already compiled
994 // but don't return addresses which are about to expire from the cache
995 void *check_addr(u_int vaddr)
997 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
998 if(ht_bin[0]==vaddr) {
999 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
1000 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
1002 if(ht_bin[2]==vaddr) {
1003 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
1004 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
1006 u_int page=get_page(vaddr);
1007 struct ll_entry *head;
1010 if(head->vaddr==vaddr&&head->reg32==0) {
1011 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1012 // Update existing entry with current address
1013 if(ht_bin[0]==vaddr) {
1014 ht_bin[1]=(int)head->addr;
1017 if(ht_bin[2]==vaddr) {
1018 ht_bin[3]=(int)head->addr;
1021 // Insert into hash table with low priority.
1022 // Don't evict existing entries, as they are probably
1023 // addresses that are being accessed frequently.
1025 ht_bin[1]=(int)head->addr;
1027 }else if(ht_bin[2]==-1) {
1028 ht_bin[3]=(int)head->addr;
1039 void remove_hash(int vaddr)
1041 //printf("remove hash: %x\n",vaddr);
1042 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1043 if(ht_bin[2]==vaddr) {
1044 ht_bin[2]=ht_bin[3]=-1;
1046 if(ht_bin[0]==vaddr) {
1047 ht_bin[0]=ht_bin[2];
1048 ht_bin[1]=ht_bin[3];
1049 ht_bin[2]=ht_bin[3]=-1;
1053 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1055 struct ll_entry *next;
1057 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1058 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1060 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1061 remove_hash((*head)->vaddr);
1068 head=&((*head)->next);
1073 // Remove all entries from linked list
1074 void ll_clear(struct ll_entry **head)
1076 struct ll_entry *cur;
1077 struct ll_entry *next;
1088 // Dereference the pointers and remove if it matches
1089 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1092 int ptr=get_pointer(head->addr);
1093 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1094 if(((ptr>>shift)==(addr>>shift)) ||
1095 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1097 inv_debug("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1098 u_int host_addr=(u_int)kill_pointer(head->addr);
1100 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1107 // This is called when we write to a compiled block (see do_invstub)
1108 void invalidate_page(u_int page)
1110 struct ll_entry *head;
1111 struct ll_entry *next;
1115 inv_debug("INVALIDATE: %x\n",head->vaddr);
1116 remove_hash(head->vaddr);
1121 head=jump_out[page];
1124 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1125 u_int host_addr=(u_int)kill_pointer(head->addr);
1127 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1134 void invalidate_block(u_int block)
1136 u_int page=get_page(block<<12);
1137 u_int vpage=get_vpage(block<<12);
1138 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1139 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1142 struct ll_entry *head;
1143 head=jump_dirty[vpage];
1144 //printf("page=%d vpage=%d\n",page,vpage);
1147 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1148 get_bounds((int)head->addr,&start,&end);
1149 //printf("start: %x end: %x\n",start,end);
1150 if(page<2048&&start>=0x80000000&&end<0x80000000+RAM_SIZE) {
1151 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1152 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1153 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1157 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1158 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1159 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1160 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;
1167 //printf("first=%d last=%d\n",first,last);
1168 invalidate_page(page);
1169 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1170 assert(last<page+5);
1171 // Invalidate the adjacent pages if a block crosses a 4K boundary
1173 invalidate_page(first);
1176 for(first=page+1;first<last;first++) {
1177 invalidate_page(first);
1183 // Don't trap writes
1184 invalid_code[block]=1;
1186 // If there is a valid TLB entry for this page, remove write protect
1187 if(tlb_LUT_w[block]) {
1188 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1189 // CHECK: Is this right?
1190 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1191 u_int real_block=tlb_LUT_w[block]>>12;
1192 invalid_code[real_block]=1;
1193 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1195 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1199 memset(mini_ht,-1,sizeof(mini_ht));
1202 void invalidate_addr(u_int addr)
1204 invalidate_block(addr>>12);
1206 // This is called when loading a save state.
1207 // Anything could have changed, so invalidate everything.
1208 void invalidate_all_pages()
1211 for(page=0;page<4096;page++)
1212 invalidate_page(page);
1213 for(page=0;page<1048576;page++)
1214 if(!invalid_code[page]) {
1215 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1216 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1219 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1222 memset(mini_ht,-1,sizeof(mini_ht));
1226 for(page=0;page<0x100000;page++) {
1227 if(tlb_LUT_r[page]) {
1228 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1229 if(!tlb_LUT_w[page]||!invalid_code[page])
1230 memory_map[page]|=0x40000000; // Write protect
1232 else memory_map[page]=-1;
1233 if(page==0x80000) page=0xC0000;
1239 // Add an entry to jump_out after making a link
1240 void add_link(u_int vaddr,void *src)
1242 u_int page=get_page(vaddr);
1243 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1244 ll_add(jump_out+page,vaddr,src);
1245 //int ptr=get_pointer(src);
1246 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1249 // If a code block was found to be unmodified (bit was set in
1250 // restore_candidate) and it remains unmodified (bit is clear
1251 // in invalid_code) then move the entries for that 4K page from
1252 // the dirty list to the clean list.
1253 void clean_blocks(u_int page)
1255 struct ll_entry *head;
1256 inv_debug("INV: clean_blocks page=%d\n",page);
1257 head=jump_dirty[page];
1259 if(!invalid_code[head->vaddr>>12]) {
1260 // Don't restore blocks which are about to expire from the cache
1261 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1263 if(verify_dirty((int)head->addr)) {
1264 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1267 get_bounds((int)head->addr,&start,&end);
1268 if(start-(u_int)rdram<RAM_SIZE) {
1269 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1270 inv|=invalid_code[i];
1273 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1274 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1275 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1276 if(addr<start||addr>=end) inv=1;
1278 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1282 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1283 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1286 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1288 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1289 //printf("page=%x, addr=%x\n",page,head->vaddr);
1290 //assert(head->vaddr>>12==(page|0x80000));
1291 ll_add_32(jump_in+ppage,head->vaddr,head->reg32,clean_addr);
1292 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1294 if(ht_bin[0]==head->vaddr) {
1295 ht_bin[1]=(int)clean_addr; // Replace existing entry
1297 if(ht_bin[2]==head->vaddr) {
1298 ht_bin[3]=(int)clean_addr; // Replace existing entry
1311 void mov_alloc(struct regstat *current,int i)
1313 // Note: Don't need to actually alloc the source registers
1314 if((~current->is32>>rs1[i])&1) {
1315 //alloc_reg64(current,i,rs1[i]);
1316 alloc_reg64(current,i,rt1[i]);
1317 current->is32&=~(1LL<<rt1[i]);
1319 //alloc_reg(current,i,rs1[i]);
1320 alloc_reg(current,i,rt1[i]);
1321 current->is32|=(1LL<<rt1[i]);
1323 clear_const(current,rs1[i]);
1324 clear_const(current,rt1[i]);
1325 dirty_reg(current,rt1[i]);
1328 void shiftimm_alloc(struct regstat *current,int i)
1330 clear_const(current,rs1[i]);
1331 clear_const(current,rt1[i]);
1332 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1335 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1337 alloc_reg(current,i,rt1[i]);
1338 current->is32|=1LL<<rt1[i];
1339 dirty_reg(current,rt1[i]);
1342 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1345 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1346 alloc_reg64(current,i,rt1[i]);
1347 current->is32&=~(1LL<<rt1[i]);
1348 dirty_reg(current,rt1[i]);
1351 if(opcode2[i]==0x3c) // DSLL32
1354 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1355 alloc_reg64(current,i,rt1[i]);
1356 current->is32&=~(1LL<<rt1[i]);
1357 dirty_reg(current,rt1[i]);
1360 if(opcode2[i]==0x3e) // DSRL32
1363 alloc_reg64(current,i,rs1[i]);
1365 alloc_reg64(current,i,rt1[i]);
1366 current->is32&=~(1LL<<rt1[i]);
1368 alloc_reg(current,i,rt1[i]);
1369 current->is32|=1LL<<rt1[i];
1371 dirty_reg(current,rt1[i]);
1374 if(opcode2[i]==0x3f) // DSRA32
1377 alloc_reg64(current,i,rs1[i]);
1378 alloc_reg(current,i,rt1[i]);
1379 current->is32|=1LL<<rt1[i];
1380 dirty_reg(current,rt1[i]);
1385 void shift_alloc(struct regstat *current,int i)
1388 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1390 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1391 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1392 alloc_reg(current,i,rt1[i]);
1393 if(rt1[i]==rs2[i]) {
1394 alloc_reg_temp(current,i,-1);
1395 minimum_free_regs[i]=1;
1397 current->is32|=1LL<<rt1[i];
1398 } else { // DSLLV/DSRLV/DSRAV
1399 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1400 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1401 alloc_reg64(current,i,rt1[i]);
1402 current->is32&=~(1LL<<rt1[i]);
1403 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1405 alloc_reg_temp(current,i,-1);
1406 minimum_free_regs[i]=1;
1409 clear_const(current,rs1[i]);
1410 clear_const(current,rs2[i]);
1411 clear_const(current,rt1[i]);
1412 dirty_reg(current,rt1[i]);
1416 void alu_alloc(struct regstat *current,int i)
1418 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1420 if(rs1[i]&&rs2[i]) {
1421 alloc_reg(current,i,rs1[i]);
1422 alloc_reg(current,i,rs2[i]);
1425 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1426 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1428 alloc_reg(current,i,rt1[i]);
1430 current->is32|=1LL<<rt1[i];
1432 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1434 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1436 alloc_reg64(current,i,rs1[i]);
1437 alloc_reg64(current,i,rs2[i]);
1438 alloc_reg(current,i,rt1[i]);
1440 alloc_reg(current,i,rs1[i]);
1441 alloc_reg(current,i,rs2[i]);
1442 alloc_reg(current,i,rt1[i]);
1445 current->is32|=1LL<<rt1[i];
1447 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1449 if(rs1[i]&&rs2[i]) {
1450 alloc_reg(current,i,rs1[i]);
1451 alloc_reg(current,i,rs2[i]);
1455 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1456 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1458 alloc_reg(current,i,rt1[i]);
1459 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1461 if(!((current->uu>>rt1[i])&1)) {
1462 alloc_reg64(current,i,rt1[i]);
1464 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1465 if(rs1[i]&&rs2[i]) {
1466 alloc_reg64(current,i,rs1[i]);
1467 alloc_reg64(current,i,rs2[i]);
1471 // Is is really worth it to keep 64-bit values in registers?
1473 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1474 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1478 current->is32&=~(1LL<<rt1[i]);
1480 current->is32|=1LL<<rt1[i];
1484 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1486 if(rs1[i]&&rs2[i]) {
1487 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1488 alloc_reg64(current,i,rs1[i]);
1489 alloc_reg64(current,i,rs2[i]);
1490 alloc_reg64(current,i,rt1[i]);
1492 alloc_reg(current,i,rs1[i]);
1493 alloc_reg(current,i,rs2[i]);
1494 alloc_reg(current,i,rt1[i]);
1498 alloc_reg(current,i,rt1[i]);
1499 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1500 // DADD used as move, or zeroing
1501 // If we have a 64-bit source, then make the target 64 bits too
1502 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1503 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1504 alloc_reg64(current,i,rt1[i]);
1505 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1506 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1507 alloc_reg64(current,i,rt1[i]);
1509 if(opcode2[i]>=0x2e&&rs2[i]) {
1510 // DSUB used as negation - 64-bit result
1511 // If we have a 32-bit register, extend it to 64 bits
1512 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1513 alloc_reg64(current,i,rt1[i]);
1517 if(rs1[i]&&rs2[i]) {
1518 current->is32&=~(1LL<<rt1[i]);
1520 current->is32&=~(1LL<<rt1[i]);
1521 if((current->is32>>rs1[i])&1)
1522 current->is32|=1LL<<rt1[i];
1524 current->is32&=~(1LL<<rt1[i]);
1525 if((current->is32>>rs2[i])&1)
1526 current->is32|=1LL<<rt1[i];
1528 current->is32|=1LL<<rt1[i];
1532 clear_const(current,rs1[i]);
1533 clear_const(current,rs2[i]);
1534 clear_const(current,rt1[i]);
1535 dirty_reg(current,rt1[i]);
1538 void imm16_alloc(struct regstat *current,int i)
1540 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1542 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1543 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1544 current->is32&=~(1LL<<rt1[i]);
1545 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1546 // TODO: Could preserve the 32-bit flag if the immediate is zero
1547 alloc_reg64(current,i,rt1[i]);
1548 alloc_reg64(current,i,rs1[i]);
1550 clear_const(current,rs1[i]);
1551 clear_const(current,rt1[i]);
1553 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1554 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1555 current->is32|=1LL<<rt1[i];
1556 clear_const(current,rs1[i]);
1557 clear_const(current,rt1[i]);
1559 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1560 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1561 if(rs1[i]!=rt1[i]) {
1562 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1563 alloc_reg64(current,i,rt1[i]);
1564 current->is32&=~(1LL<<rt1[i]);
1567 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1568 if(is_const(current,rs1[i])) {
1569 int v=get_const(current,rs1[i]);
1570 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1571 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1572 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1574 else clear_const(current,rt1[i]);
1576 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1577 if(is_const(current,rs1[i])) {
1578 int v=get_const(current,rs1[i]);
1579 set_const(current,rt1[i],v+imm[i]);
1581 else clear_const(current,rt1[i]);
1582 current->is32|=1LL<<rt1[i];
1585 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1586 current->is32|=1LL<<rt1[i];
1588 dirty_reg(current,rt1[i]);
1591 void load_alloc(struct regstat *current,int i)
1593 clear_const(current,rt1[i]);
1594 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1595 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1596 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1598 alloc_reg(current,i,rt1[i]);
1599 if(get_reg(current->regmap,rt1[i])<0) {
1600 // dummy load, but we still need a register to calculate the address
1601 alloc_reg_temp(current,i,-1);
1602 minimum_free_regs[i]=1;
1604 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1606 current->is32&=~(1LL<<rt1[i]);
1607 alloc_reg64(current,i,rt1[i]);
1609 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1611 current->is32&=~(1LL<<rt1[i]);
1612 alloc_reg64(current,i,rt1[i]);
1613 alloc_all(current,i);
1614 alloc_reg64(current,i,FTEMP);
1615 minimum_free_regs[i]=HOST_REGS;
1617 else current->is32|=1LL<<rt1[i];
1618 dirty_reg(current,rt1[i]);
1619 // If using TLB, need a register for pointer to the mapping table
1620 if(using_tlb) alloc_reg(current,i,TLREG);
1621 // LWL/LWR need a temporary register for the old value
1622 if(opcode[i]==0x22||opcode[i]==0x26)
1624 alloc_reg(current,i,FTEMP);
1625 alloc_reg_temp(current,i,-1);
1626 minimum_free_regs[i]=1;
1631 // Load to r0 (dummy load)
1632 // but we still need a register to calculate the address
1633 if(opcode[i]==0x22||opcode[i]==0x26)
1635 alloc_reg(current,i,FTEMP); // LWL/LWR need another temporary
1637 alloc_reg_temp(current,i,-1);
1638 minimum_free_regs[i]=1;
1639 if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1641 alloc_all(current,i);
1642 alloc_reg64(current,i,FTEMP);
1643 minimum_free_regs[i]=HOST_REGS;
1648 void store_alloc(struct regstat *current,int i)
1650 clear_const(current,rs2[i]);
1651 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1652 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1653 alloc_reg(current,i,rs2[i]);
1654 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1655 alloc_reg64(current,i,rs2[i]);
1656 if(rs2[i]) alloc_reg(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 alloc_reg(current,i,INVCP);
1664 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1665 alloc_reg(current,i,FTEMP);
1667 // We need a temporary register for address generation
1668 alloc_reg_temp(current,i,-1);
1669 minimum_free_regs[i]=1;
1672 void c1ls_alloc(struct regstat *current,int i)
1674 //clear_const(current,rs1[i]); // FIXME
1675 clear_const(current,rt1[i]);
1676 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1677 alloc_reg(current,i,CSREG); // Status
1678 alloc_reg(current,i,FTEMP);
1679 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1680 alloc_reg64(current,i,FTEMP);
1682 // If using TLB, need a register for pointer to the mapping table
1683 if(using_tlb) alloc_reg(current,i,TLREG);
1684 #if defined(HOST_IMM8)
1685 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1686 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1687 alloc_reg(current,i,INVCP);
1689 // We need a temporary register for address generation
1690 alloc_reg_temp(current,i,-1);
1693 void c2ls_alloc(struct regstat *current,int i)
1695 clear_const(current,rt1[i]);
1696 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1697 alloc_reg(current,i,FTEMP);
1698 // If using TLB, need a register for pointer to the mapping table
1699 if(using_tlb) alloc_reg(current,i,TLREG);
1700 #if defined(HOST_IMM8)
1701 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1702 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1703 alloc_reg(current,i,INVCP);
1705 // We need a temporary register for address generation
1706 alloc_reg_temp(current,i,-1);
1707 minimum_free_regs[i]=1;
1710 #ifndef multdiv_alloc
1711 void multdiv_alloc(struct regstat *current,int i)
1718 // case 0x1D: DMULTU
1721 clear_const(current,rs1[i]);
1722 clear_const(current,rs2[i]);
1725 if((opcode2[i]&4)==0) // 32-bit
1727 current->u&=~(1LL<<HIREG);
1728 current->u&=~(1LL<<LOREG);
1729 alloc_reg(current,i,HIREG);
1730 alloc_reg(current,i,LOREG);
1731 alloc_reg(current,i,rs1[i]);
1732 alloc_reg(current,i,rs2[i]);
1733 current->is32|=1LL<<HIREG;
1734 current->is32|=1LL<<LOREG;
1735 dirty_reg(current,HIREG);
1736 dirty_reg(current,LOREG);
1740 current->u&=~(1LL<<HIREG);
1741 current->u&=~(1LL<<LOREG);
1742 current->uu&=~(1LL<<HIREG);
1743 current->uu&=~(1LL<<LOREG);
1744 alloc_reg64(current,i,HIREG);
1745 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1746 alloc_reg64(current,i,rs1[i]);
1747 alloc_reg64(current,i,rs2[i]);
1748 alloc_all(current,i);
1749 current->is32&=~(1LL<<HIREG);
1750 current->is32&=~(1LL<<LOREG);
1751 dirty_reg(current,HIREG);
1752 dirty_reg(current,LOREG);
1753 minimum_free_regs[i]=HOST_REGS;
1758 // Multiply by zero is zero.
1759 // MIPS does not have a divide by zero exception.
1760 // The result is undefined, we return zero.
1761 alloc_reg(current,i,HIREG);
1762 alloc_reg(current,i,LOREG);
1763 current->is32|=1LL<<HIREG;
1764 current->is32|=1LL<<LOREG;
1765 dirty_reg(current,HIREG);
1766 dirty_reg(current,LOREG);
1771 void cop0_alloc(struct regstat *current,int i)
1773 if(opcode2[i]==0) // MFC0
1776 clear_const(current,rt1[i]);
1777 alloc_all(current,i);
1778 alloc_reg(current,i,rt1[i]);
1779 current->is32|=1LL<<rt1[i];
1780 dirty_reg(current,rt1[i]);
1783 else if(opcode2[i]==4) // MTC0
1786 clear_const(current,rs1[i]);
1787 alloc_reg(current,i,rs1[i]);
1788 alloc_all(current,i);
1791 alloc_all(current,i); // FIXME: Keep r0
1793 alloc_reg(current,i,0);
1798 // TLBR/TLBWI/TLBWR/TLBP/ERET
1799 assert(opcode2[i]==0x10);
1800 alloc_all(current,i);
1802 minimum_free_regs[i]=HOST_REGS;
1805 void cop1_alloc(struct regstat *current,int i)
1807 alloc_reg(current,i,CSREG); // Load status
1808 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1811 clear_const(current,rt1[i]);
1813 alloc_reg64(current,i,rt1[i]); // DMFC1
1814 current->is32&=~(1LL<<rt1[i]);
1816 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1817 current->is32|=1LL<<rt1[i];
1819 dirty_reg(current,rt1[i]);
1821 alloc_reg_temp(current,i,-1);
1823 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1826 clear_const(current,rs1[i]);
1828 alloc_reg64(current,i,rs1[i]); // DMTC1
1830 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1831 alloc_reg_temp(current,i,-1);
1835 alloc_reg(current,i,0);
1836 alloc_reg_temp(current,i,-1);
1839 minimum_free_regs[i]=1;
1841 void fconv_alloc(struct regstat *current,int i)
1843 alloc_reg(current,i,CSREG); // Load status
1844 alloc_reg_temp(current,i,-1);
1845 minimum_free_regs[i]=1;
1847 void float_alloc(struct regstat *current,int i)
1849 alloc_reg(current,i,CSREG); // Load status
1850 alloc_reg_temp(current,i,-1);
1851 minimum_free_regs[i]=1;
1853 void c2op_alloc(struct regstat *current,int i)
1855 alloc_reg_temp(current,i,-1);
1857 void fcomp_alloc(struct regstat *current,int i)
1859 alloc_reg(current,i,CSREG); // Load status
1860 alloc_reg(current,i,FSREG); // Load flags
1861 dirty_reg(current,FSREG); // Flag will be modified
1862 alloc_reg_temp(current,i,-1);
1863 minimum_free_regs[i]=1;
1866 void syscall_alloc(struct regstat *current,int i)
1868 alloc_cc(current,i);
1869 dirty_reg(current,CCREG);
1870 alloc_all(current,i);
1871 minimum_free_regs[i]=HOST_REGS;
1875 void delayslot_alloc(struct regstat *current,int i)
1886 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1887 printf("Disabled speculative precompilation\n");
1891 imm16_alloc(current,i);
1895 load_alloc(current,i);
1899 store_alloc(current,i);
1902 alu_alloc(current,i);
1905 shift_alloc(current,i);
1908 multdiv_alloc(current,i);
1911 shiftimm_alloc(current,i);
1914 mov_alloc(current,i);
1917 cop0_alloc(current,i);
1921 cop1_alloc(current,i);
1924 c1ls_alloc(current,i);
1927 c2ls_alloc(current,i);
1930 fconv_alloc(current,i);
1933 float_alloc(current,i);
1936 fcomp_alloc(current,i);
1939 c2op_alloc(current,i);
1944 // Special case where a branch and delay slot span two pages in virtual memory
1945 static void pagespan_alloc(struct regstat *current,int i)
1948 current->wasconst=0;
1950 minimum_free_regs[i]=HOST_REGS;
1951 alloc_all(current,i);
1952 alloc_cc(current,i);
1953 dirty_reg(current,CCREG);
1954 if(opcode[i]==3) // JAL
1956 alloc_reg(current,i,31);
1957 dirty_reg(current,31);
1959 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
1961 alloc_reg(current,i,rs1[i]);
1963 alloc_reg(current,i,rt1[i]);
1964 dirty_reg(current,rt1[i]);
1967 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
1969 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1970 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1971 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1973 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1974 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
1978 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
1980 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1981 if(!((current->is32>>rs1[i])&1))
1983 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1987 if(opcode[i]==0x11) // BC1
1989 alloc_reg(current,i,FSREG);
1990 alloc_reg(current,i,CSREG);
1995 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
1997 stubs[stubcount][0]=type;
1998 stubs[stubcount][1]=addr;
1999 stubs[stubcount][2]=retaddr;
2000 stubs[stubcount][3]=a;
2001 stubs[stubcount][4]=b;
2002 stubs[stubcount][5]=c;
2003 stubs[stubcount][6]=d;
2004 stubs[stubcount][7]=e;
2008 // Write out a single register
2009 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
2012 for(hr=0;hr<HOST_REGS;hr++) {
2013 if(hr!=EXCLUDE_REG) {
2014 if((regmap[hr]&63)==r) {
2017 emit_storereg(r,hr);
2019 if((is32>>regmap[hr])&1) {
2020 emit_sarimm(hr,31,hr);
2021 emit_storereg(r|64,hr);
2025 emit_storereg(r|64,hr);
2035 //if(!tracedebug) return 0;
2038 for(i=0;i<2097152;i++) {
2039 unsigned int temp=sum;
2042 sum^=((u_int *)rdram)[i];
2051 sum^=((u_int *)reg)[i];
2059 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2061 #ifndef DISABLE_COP1
2064 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2074 void memdebug(int i)
2076 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2077 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2080 //if(Count>=-2084597794) {
2081 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2083 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2084 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2085 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2088 printf("TRACE: %x\n",(&i)[-1]);
2092 printf("TRACE: %x \n",(&j)[10]);
2093 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]);
2097 //printf("TRACE: %x\n",(&i)[-1]);
2100 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2102 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2105 void alu_assemble(int i,struct regstat *i_regs)
2107 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2109 signed char s1,s2,t;
2110 t=get_reg(i_regs->regmap,rt1[i]);
2112 s1=get_reg(i_regs->regmap,rs1[i]);
2113 s2=get_reg(i_regs->regmap,rs2[i]);
2114 if(rs1[i]&&rs2[i]) {
2117 if(opcode2[i]&2) emit_sub(s1,s2,t);
2118 else emit_add(s1,s2,t);
2121 if(s1>=0) emit_mov(s1,t);
2122 else emit_loadreg(rs1[i],t);
2126 if(opcode2[i]&2) emit_neg(s2,t);
2127 else emit_mov(s2,t);
2130 emit_loadreg(rs2[i],t);
2131 if(opcode2[i]&2) emit_neg(t,t);
2134 else emit_zeroreg(t);
2138 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2140 signed char s1l,s2l,s1h,s2h,tl,th;
2141 tl=get_reg(i_regs->regmap,rt1[i]);
2142 th=get_reg(i_regs->regmap,rt1[i]|64);
2144 s1l=get_reg(i_regs->regmap,rs1[i]);
2145 s2l=get_reg(i_regs->regmap,rs2[i]);
2146 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2147 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2148 if(rs1[i]&&rs2[i]) {
2151 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2152 else emit_adds(s1l,s2l,tl);
2154 #ifdef INVERTED_CARRY
2155 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2157 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2159 else emit_add(s1h,s2h,th);
2163 if(s1l>=0) emit_mov(s1l,tl);
2164 else emit_loadreg(rs1[i],tl);
2166 if(s1h>=0) emit_mov(s1h,th);
2167 else emit_loadreg(rs1[i]|64,th);
2172 if(opcode2[i]&2) emit_negs(s2l,tl);
2173 else emit_mov(s2l,tl);
2176 emit_loadreg(rs2[i],tl);
2177 if(opcode2[i]&2) emit_negs(tl,tl);
2180 #ifdef INVERTED_CARRY
2181 if(s2h>=0) emit_mov(s2h,th);
2182 else emit_loadreg(rs2[i]|64,th);
2184 emit_adcimm(-1,th); // x86 has inverted carry flag
2189 if(s2h>=0) emit_rscimm(s2h,0,th);
2191 emit_loadreg(rs2[i]|64,th);
2192 emit_rscimm(th,0,th);
2195 if(s2h>=0) emit_mov(s2h,th);
2196 else emit_loadreg(rs2[i]|64,th);
2203 if(th>=0) emit_zeroreg(th);
2208 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2210 signed char s1l,s1h,s2l,s2h,t;
2211 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2213 t=get_reg(i_regs->regmap,rt1[i]);
2216 s1l=get_reg(i_regs->regmap,rs1[i]);
2217 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2218 s2l=get_reg(i_regs->regmap,rs2[i]);
2219 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2220 if(rs2[i]==0) // rx<r0
2223 if(opcode2[i]==0x2a) // SLT
2224 emit_shrimm(s1h,31,t);
2225 else // SLTU (unsigned can not be less than zero)
2228 else if(rs1[i]==0) // r0<rx
2231 if(opcode2[i]==0x2a) // SLT
2232 emit_set_gz64_32(s2h,s2l,t);
2233 else // SLTU (set if not zero)
2234 emit_set_nz64_32(s2h,s2l,t);
2237 assert(s1l>=0);assert(s1h>=0);
2238 assert(s2l>=0);assert(s2h>=0);
2239 if(opcode2[i]==0x2a) // SLT
2240 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2242 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2246 t=get_reg(i_regs->regmap,rt1[i]);
2249 s1l=get_reg(i_regs->regmap,rs1[i]);
2250 s2l=get_reg(i_regs->regmap,rs2[i]);
2251 if(rs2[i]==0) // rx<r0
2254 if(opcode2[i]==0x2a) // SLT
2255 emit_shrimm(s1l,31,t);
2256 else // SLTU (unsigned can not be less than zero)
2259 else if(rs1[i]==0) // r0<rx
2262 if(opcode2[i]==0x2a) // SLT
2263 emit_set_gz32(s2l,t);
2264 else // SLTU (set if not zero)
2265 emit_set_nz32(s2l,t);
2268 assert(s1l>=0);assert(s2l>=0);
2269 if(opcode2[i]==0x2a) // SLT
2270 emit_set_if_less32(s1l,s2l,t);
2272 emit_set_if_carry32(s1l,s2l,t);
2278 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2280 signed char s1l,s1h,s2l,s2h,th,tl;
2281 tl=get_reg(i_regs->regmap,rt1[i]);
2282 th=get_reg(i_regs->regmap,rt1[i]|64);
2283 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2287 s1l=get_reg(i_regs->regmap,rs1[i]);
2288 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2289 s2l=get_reg(i_regs->regmap,rs2[i]);
2290 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2291 if(rs1[i]&&rs2[i]) {
2292 assert(s1l>=0);assert(s1h>=0);
2293 assert(s2l>=0);assert(s2h>=0);
2294 if(opcode2[i]==0x24) { // AND
2295 emit_and(s1l,s2l,tl);
2296 emit_and(s1h,s2h,th);
2298 if(opcode2[i]==0x25) { // OR
2299 emit_or(s1l,s2l,tl);
2300 emit_or(s1h,s2h,th);
2302 if(opcode2[i]==0x26) { // XOR
2303 emit_xor(s1l,s2l,tl);
2304 emit_xor(s1h,s2h,th);
2306 if(opcode2[i]==0x27) { // NOR
2307 emit_or(s1l,s2l,tl);
2308 emit_or(s1h,s2h,th);
2315 if(opcode2[i]==0x24) { // AND
2319 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2321 if(s1l>=0) emit_mov(s1l,tl);
2322 else emit_loadreg(rs1[i],tl);
2323 if(s1h>=0) emit_mov(s1h,th);
2324 else emit_loadreg(rs1[i]|64,th);
2328 if(s2l>=0) emit_mov(s2l,tl);
2329 else emit_loadreg(rs2[i],tl);
2330 if(s2h>=0) emit_mov(s2h,th);
2331 else emit_loadreg(rs2[i]|64,th);
2338 if(opcode2[i]==0x27) { // NOR
2340 if(s1l>=0) emit_not(s1l,tl);
2342 emit_loadreg(rs1[i],tl);
2345 if(s1h>=0) emit_not(s1h,th);
2347 emit_loadreg(rs1[i]|64,th);
2353 if(s2l>=0) emit_not(s2l,tl);
2355 emit_loadreg(rs2[i],tl);
2358 if(s2h>=0) emit_not(s2h,th);
2360 emit_loadreg(rs2[i]|64,th);
2376 s1l=get_reg(i_regs->regmap,rs1[i]);
2377 s2l=get_reg(i_regs->regmap,rs2[i]);
2378 if(rs1[i]&&rs2[i]) {
2381 if(opcode2[i]==0x24) { // AND
2382 emit_and(s1l,s2l,tl);
2384 if(opcode2[i]==0x25) { // OR
2385 emit_or(s1l,s2l,tl);
2387 if(opcode2[i]==0x26) { // XOR
2388 emit_xor(s1l,s2l,tl);
2390 if(opcode2[i]==0x27) { // NOR
2391 emit_or(s1l,s2l,tl);
2397 if(opcode2[i]==0x24) { // AND
2400 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2402 if(s1l>=0) emit_mov(s1l,tl);
2403 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2407 if(s2l>=0) emit_mov(s2l,tl);
2408 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2410 else emit_zeroreg(tl);
2412 if(opcode2[i]==0x27) { // NOR
2414 if(s1l>=0) emit_not(s1l,tl);
2416 emit_loadreg(rs1[i],tl);
2422 if(s2l>=0) emit_not(s2l,tl);
2424 emit_loadreg(rs2[i],tl);
2428 else emit_movimm(-1,tl);
2437 void imm16_assemble(int i,struct regstat *i_regs)
2439 if (opcode[i]==0x0f) { // LUI
2442 t=get_reg(i_regs->regmap,rt1[i]);
2445 if(!((i_regs->isconst>>t)&1))
2446 emit_movimm(imm[i]<<16,t);
2450 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2453 t=get_reg(i_regs->regmap,rt1[i]);
2454 s=get_reg(i_regs->regmap,rs1[i]);
2459 if(!((i_regs->isconst>>t)&1)) {
2461 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2462 emit_addimm(t,imm[i],t);
2464 if(!((i_regs->wasconst>>s)&1))
2465 emit_addimm(s,imm[i],t);
2467 emit_movimm(constmap[i][s]+imm[i],t);
2473 if(!((i_regs->isconst>>t)&1))
2474 emit_movimm(imm[i],t);
2479 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2481 signed char sh,sl,th,tl;
2482 th=get_reg(i_regs->regmap,rt1[i]|64);
2483 tl=get_reg(i_regs->regmap,rt1[i]);
2484 sh=get_reg(i_regs->regmap,rs1[i]|64);
2485 sl=get_reg(i_regs->regmap,rs1[i]);
2491 emit_addimm64_32(sh,sl,imm[i],th,tl);
2494 emit_addimm(sl,imm[i],tl);
2497 emit_movimm(imm[i],tl);
2498 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2503 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2505 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2506 signed char sh,sl,t;
2507 t=get_reg(i_regs->regmap,rt1[i]);
2508 sh=get_reg(i_regs->regmap,rs1[i]|64);
2509 sl=get_reg(i_regs->regmap,rs1[i]);
2513 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2514 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2515 if(opcode[i]==0x0a) { // SLTI
2517 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2518 emit_slti32(t,imm[i],t);
2520 emit_slti32(sl,imm[i],t);
2525 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2526 emit_sltiu32(t,imm[i],t);
2528 emit_sltiu32(sl,imm[i],t);
2533 if(opcode[i]==0x0a) // SLTI
2534 emit_slti64_32(sh,sl,imm[i],t);
2536 emit_sltiu64_32(sh,sl,imm[i],t);
2539 // SLTI(U) with r0 is just stupid,
2540 // nonetheless examples can be found
2541 if(opcode[i]==0x0a) // SLTI
2542 if(0<imm[i]) emit_movimm(1,t);
2543 else emit_zeroreg(t);
2546 if(imm[i]) emit_movimm(1,t);
2547 else emit_zeroreg(t);
2553 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2555 signed char sh,sl,th,tl;
2556 th=get_reg(i_regs->regmap,rt1[i]|64);
2557 tl=get_reg(i_regs->regmap,rt1[i]);
2558 sh=get_reg(i_regs->regmap,rs1[i]|64);
2559 sl=get_reg(i_regs->regmap,rs1[i]);
2560 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2561 if(opcode[i]==0x0c) //ANDI
2565 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2566 emit_andimm(tl,imm[i],tl);
2568 if(!((i_regs->wasconst>>sl)&1))
2569 emit_andimm(sl,imm[i],tl);
2571 emit_movimm(constmap[i][sl]&imm[i],tl);
2576 if(th>=0) emit_zeroreg(th);
2582 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2586 emit_loadreg(rs1[i]|64,th);
2591 if(opcode[i]==0x0d) //ORI
2593 emit_orimm(tl,imm[i],tl);
2595 if(!((i_regs->wasconst>>sl)&1))
2596 emit_orimm(sl,imm[i],tl);
2598 emit_movimm(constmap[i][sl]|imm[i],tl);
2600 if(opcode[i]==0x0e) //XORI
2602 emit_xorimm(tl,imm[i],tl);
2604 if(!((i_regs->wasconst>>sl)&1))
2605 emit_xorimm(sl,imm[i],tl);
2607 emit_movimm(constmap[i][sl]^imm[i],tl);
2611 emit_movimm(imm[i],tl);
2612 if(th>=0) emit_zeroreg(th);
2620 void shiftimm_assemble(int i,struct regstat *i_regs)
2622 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2626 t=get_reg(i_regs->regmap,rt1[i]);
2627 s=get_reg(i_regs->regmap,rs1[i]);
2636 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2638 if(opcode2[i]==0) // SLL
2640 emit_shlimm(s<0?t:s,imm[i],t);
2642 if(opcode2[i]==2) // SRL
2644 emit_shrimm(s<0?t:s,imm[i],t);
2646 if(opcode2[i]==3) // SRA
2648 emit_sarimm(s<0?t:s,imm[i],t);
2652 if(s>=0 && s!=t) emit_mov(s,t);
2656 //emit_storereg(rt1[i],t); //DEBUG
2659 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2662 signed char sh,sl,th,tl;
2663 th=get_reg(i_regs->regmap,rt1[i]|64);
2664 tl=get_reg(i_regs->regmap,rt1[i]);
2665 sh=get_reg(i_regs->regmap,rs1[i]|64);
2666 sl=get_reg(i_regs->regmap,rs1[i]);
2671 if(th>=0) emit_zeroreg(th);
2678 if(opcode2[i]==0x38) // DSLL
2680 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2681 emit_shlimm(sl,imm[i],tl);
2683 if(opcode2[i]==0x3a) // DSRL
2685 emit_shrdimm(sl,sh,imm[i],tl);
2686 if(th>=0) emit_shrimm(sh,imm[i],th);
2688 if(opcode2[i]==0x3b) // DSRA
2690 emit_shrdimm(sl,sh,imm[i],tl);
2691 if(th>=0) emit_sarimm(sh,imm[i],th);
2695 if(sl!=tl) emit_mov(sl,tl);
2696 if(th>=0&&sh!=th) emit_mov(sh,th);
2702 if(opcode2[i]==0x3c) // DSLL32
2705 signed char sl,tl,th;
2706 tl=get_reg(i_regs->regmap,rt1[i]);
2707 th=get_reg(i_regs->regmap,rt1[i]|64);
2708 sl=get_reg(i_regs->regmap,rs1[i]);
2717 emit_shlimm(th,imm[i]&31,th);
2722 if(opcode2[i]==0x3e) // DSRL32
2725 signed char sh,tl,th;
2726 tl=get_reg(i_regs->regmap,rt1[i]);
2727 th=get_reg(i_regs->regmap,rt1[i]|64);
2728 sh=get_reg(i_regs->regmap,rs1[i]|64);
2732 if(th>=0) emit_zeroreg(th);
2735 emit_shrimm(tl,imm[i]&31,tl);
2740 if(opcode2[i]==0x3f) // DSRA32
2744 tl=get_reg(i_regs->regmap,rt1[i]);
2745 sh=get_reg(i_regs->regmap,rs1[i]|64);
2751 emit_sarimm(tl,imm[i]&31,tl);
2758 #ifndef shift_assemble
2759 void shift_assemble(int i,struct regstat *i_regs)
2761 printf("Need shift_assemble for this architecture.\n");
2766 void load_assemble(int i,struct regstat *i_regs)
2768 int s,th,tl,addr,map=-1;
2771 int memtarget=0,c=0;
2773 th=get_reg(i_regs->regmap,rt1[i]|64);
2774 tl=get_reg(i_regs->regmap,rt1[i]);
2775 s=get_reg(i_regs->regmap,rs1[i]);
2777 for(hr=0;hr<HOST_REGS;hr++) {
2778 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2780 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2782 c=(i_regs->wasconst>>s)&1;
2783 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2784 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2786 //printf("load_assemble: c=%d\n",c);
2787 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2788 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2790 if(tl<0&&(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80)
2792 // could be FIFO, must perform the read
2794 assem_debug("(forced read)\n");
2795 tl=get_reg(i_regs->regmap,-1);
2799 if(offset||s<0||c) addr=tl;
2801 //if(tl<0) tl=get_reg(i_regs->regmap,-1);
2803 //printf("load_assemble: c=%d\n",c);
2804 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2805 assert(tl>=0); // Even if the load is a NOP, we must check for pagefaults and I/O
2807 if(th>=0) reglist&=~(1<<th);
2811 map=get_reg(i_regs->regmap,ROREG);
2812 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
2814 //#define R29_HACK 1
2816 // Strmnnrmn's speed hack
2817 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2820 emit_cmpimm(addr,RAM_SIZE);
2822 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
2823 // Hint to branch predictor that the branch is unlikely to be taken
2825 emit_jno_unlikely(0);
2833 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2834 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2835 map=get_reg(i_regs->regmap,TLREG);
2837 map=do_tlb_r(addr,tl,map,x,-1,-1,c,constmap[i][s]+offset);
2838 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr);
2840 int dummy=(rt1[i]==0)||(tl!=get_reg(i_regs->regmap,rt1[i])); // ignore loads to r0 and unneeded reg
2841 if (opcode[i]==0x20) { // LB
2844 #ifdef HOST_IMM_ADDR32
2846 emit_movsbl_tlb((constmap[i][s]+offset)^3,map,tl);
2850 //emit_xorimm(addr,3,tl);
2851 //gen_tlb_addr_r(tl,map);
2852 //emit_movsbl_indexed((int)rdram-0x80000000,tl,tl);
2854 #ifdef BIG_ENDIAN_MIPS
2855 if(!c) emit_xorimm(addr,3,tl);
2856 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2860 emit_movsbl_indexed_tlb(x,a,map,tl);
2864 add_stub(LOADB_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2867 inline_readstub(LOADB_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2869 if (opcode[i]==0x21) { // LH
2872 #ifdef HOST_IMM_ADDR32
2874 emit_movswl_tlb((constmap[i][s]+offset)^2,map,tl);
2879 #ifdef BIG_ENDIAN_MIPS
2880 if(!c) emit_xorimm(addr,2,tl);
2881 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2886 //emit_movswl_indexed_tlb(x,tl,map,tl);
2889 gen_tlb_addr_r(a,map);
2890 emit_movswl_indexed(x,a,tl);
2893 emit_movswl_indexed(x,a,tl);
2895 emit_movswl_indexed((int)rdram-0x80000000+x,a,tl);
2901 add_stub(LOADH_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2904 inline_readstub(LOADH_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2906 if (opcode[i]==0x23) { // LW
2909 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2910 #ifdef HOST_IMM_ADDR32
2912 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2915 emit_readword_indexed_tlb(0,addr,map,tl);
2918 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2921 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2923 if (opcode[i]==0x24) { // LBU
2926 #ifdef HOST_IMM_ADDR32
2928 emit_movzbl_tlb((constmap[i][s]+offset)^3,map,tl);
2932 //emit_xorimm(addr,3,tl);
2933 //gen_tlb_addr_r(tl,map);
2934 //emit_movzbl_indexed((int)rdram-0x80000000,tl,tl);
2936 #ifdef BIG_ENDIAN_MIPS
2937 if(!c) emit_xorimm(addr,3,tl);
2938 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2942 emit_movzbl_indexed_tlb(x,a,map,tl);
2946 add_stub(LOADBU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2949 inline_readstub(LOADBU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2951 if (opcode[i]==0x25) { // LHU
2954 #ifdef HOST_IMM_ADDR32
2956 emit_movzwl_tlb((constmap[i][s]+offset)^2,map,tl);
2961 #ifdef BIG_ENDIAN_MIPS
2962 if(!c) emit_xorimm(addr,2,tl);
2963 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2968 //emit_movzwl_indexed_tlb(x,tl,map,tl);
2971 gen_tlb_addr_r(a,map);
2972 emit_movzwl_indexed(x,a,tl);
2975 emit_movzwl_indexed(x,a,tl);
2977 emit_movzwl_indexed((int)rdram-0x80000000+x,a,tl);
2983 add_stub(LOADHU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2986 inline_readstub(LOADHU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2988 if (opcode[i]==0x27) { // LWU
2992 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2993 #ifdef HOST_IMM_ADDR32
2995 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2998 emit_readword_indexed_tlb(0,addr,map,tl);
3001 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3004 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3008 if (opcode[i]==0x37) { // LD
3011 //gen_tlb_addr_r(tl,map);
3012 //if(th>=0) emit_readword_indexed((int)rdram-0x80000000,addr,th);
3013 //emit_readword_indexed((int)rdram-0x7FFFFFFC,addr,tl);
3014 #ifdef HOST_IMM_ADDR32
3016 emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3019 emit_readdword_indexed_tlb(0,addr,map,th,tl);
3022 add_stub(LOADD_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3025 inline_readstub(LOADD_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3028 //emit_storereg(rt1[i],tl); // DEBUG
3029 //if(opcode[i]==0x23)
3030 //if(opcode[i]==0x24)
3031 //if(opcode[i]==0x23||opcode[i]==0x24)
3032 /*if(opcode[i]==0x21||opcode[i]==0x23||opcode[i]==0x24)
3036 emit_readword((int)&last_count,ECX);
3038 if(get_reg(i_regs->regmap,CCREG)<0)
3039 emit_loadreg(CCREG,HOST_CCREG);
3040 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3041 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3042 emit_writeword(HOST_CCREG,(int)&Count);
3045 if(get_reg(i_regs->regmap,CCREG)<0)
3046 emit_loadreg(CCREG,0);
3048 emit_mov(HOST_CCREG,0);
3050 emit_addimm(0,2*ccadj[i],0);
3051 emit_writeword(0,(int)&Count);
3053 emit_call((int)memdebug);
3055 restore_regs(0x100f);
3059 #ifndef loadlr_assemble
3060 void loadlr_assemble(int i,struct regstat *i_regs)
3062 printf("Need loadlr_assemble for this architecture.\n");
3067 void store_assemble(int i,struct regstat *i_regs)
3072 int jaddr=0,jaddr2,type;
3073 int memtarget=0,c=0;
3074 int agr=AGEN1+(i&1);
3076 th=get_reg(i_regs->regmap,rs2[i]|64);
3077 tl=get_reg(i_regs->regmap,rs2[i]);
3078 s=get_reg(i_regs->regmap,rs1[i]);
3079 temp=get_reg(i_regs->regmap,agr);
3080 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3083 c=(i_regs->wasconst>>s)&1;
3084 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3085 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3089 for(hr=0;hr<HOST_REGS;hr++) {
3090 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3092 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3093 if(offset||s<0||c) addr=temp;
3098 // Strmnnrmn's speed hack
3100 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3102 emit_cmpimm(addr,RAM_SIZE);
3103 #ifdef DESTRUCTIVE_SHIFT
3104 if(s==addr) emit_mov(s,temp);
3107 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3111 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
3112 // Hint to branch predictor that the branch is unlikely to be taken
3114 emit_jno_unlikely(0);
3122 if (opcode[i]==0x28) x=3; // SB
3123 if (opcode[i]==0x29) x=2; // SH
3124 map=get_reg(i_regs->regmap,TLREG);
3126 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3127 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3130 if (opcode[i]==0x28) { // SB
3133 #ifdef BIG_ENDIAN_MIPS
3134 if(!c) emit_xorimm(addr,3,temp);
3135 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3137 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
3138 else if (addr!=temp) emit_mov(addr,temp);
3140 //gen_tlb_addr_w(temp,map);
3141 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3142 emit_writebyte_indexed_tlb(tl,x,temp,map,temp);
3146 if (opcode[i]==0x29) { // SH
3149 #ifdef BIG_ENDIAN_MIPS
3150 if(!c) emit_xorimm(addr,2,temp);
3151 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3153 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
3154 else if (addr!=temp) emit_mov(addr,temp);
3157 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3160 gen_tlb_addr_w(temp,map);
3161 emit_writehword_indexed(tl,x,temp);
3163 emit_writehword_indexed(tl,(int)rdram-0x80000000+x,temp);
3167 if (opcode[i]==0x2B) { // SW
3169 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3170 emit_writeword_indexed_tlb(tl,0,addr,map,temp);
3173 if (opcode[i]==0x3F) { // SD
3177 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3178 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3179 emit_writedword_indexed_tlb(th,tl,0,addr,map,temp);
3182 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3183 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3184 emit_writedword_indexed_tlb(tl,tl,0,addr,map,temp);
3191 #ifdef DESTRUCTIVE_SHIFT
3192 // The x86 shift operation is 'destructive'; it overwrites the
3193 // source register, so we need to make a copy first and use that.
3196 #if defined(HOST_IMM8)
3197 int ir=get_reg(i_regs->regmap,INVCP);
3199 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3201 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3203 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3204 emit_callne(invalidate_addr_reg[addr]);
3208 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3213 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3214 } else if(c&&!memtarget) {
3215 inline_writestub(type,i,constmap[i][s]+offset,i_regs->regmap,rs2[i],ccadj[i],reglist);
3217 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3218 //if(opcode[i]==0x2B || opcode[i]==0x28)
3219 //if(opcode[i]==0x2B || opcode[i]==0x29)
3220 //if(opcode[i]==0x2B)
3221 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3225 emit_readword((int)&last_count,ECX);
3227 if(get_reg(i_regs->regmap,CCREG)<0)
3228 emit_loadreg(CCREG,HOST_CCREG);
3229 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3230 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3231 emit_writeword(HOST_CCREG,(int)&Count);
3234 if(get_reg(i_regs->regmap,CCREG)<0)
3235 emit_loadreg(CCREG,0);
3237 emit_mov(HOST_CCREG,0);
3239 emit_addimm(0,2*ccadj[i],0);
3240 emit_writeword(0,(int)&Count);
3242 emit_call((int)memdebug);
3244 restore_regs(0x100f);
3248 void storelr_assemble(int i,struct regstat *i_regs)
3255 int case1,case2,case3;
3256 int done0,done1,done2;
3258 int agr=AGEN1+(i&1);
3260 th=get_reg(i_regs->regmap,rs2[i]|64);
3261 tl=get_reg(i_regs->regmap,rs2[i]);
3262 s=get_reg(i_regs->regmap,rs1[i]);
3263 temp=get_reg(i_regs->regmap,agr);
3264 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3267 c=(i_regs->isconst>>s)&1;
3268 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3269 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3272 for(hr=0;hr<HOST_REGS;hr++) {
3273 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3278 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3279 if(!offset&&s!=temp) emit_mov(s,temp);
3285 if(!memtarget||!rs1[i]) {
3291 int map=get_reg(i_regs->regmap,ROREG);
3292 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
3293 gen_tlb_addr_w(temp,map);
3295 if((u_int)rdram!=0x80000000)
3296 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3299 int map=get_reg(i_regs->regmap,TLREG);
3301 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3302 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3303 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3304 if(!jaddr&&!memtarget) {
3308 gen_tlb_addr_w(temp,map);
3311 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3312 temp2=get_reg(i_regs->regmap,FTEMP);
3313 if(!rs2[i]) temp2=th=tl;
3316 #ifndef BIG_ENDIAN_MIPS
3317 emit_xorimm(temp,3,temp);
3319 emit_testimm(temp,2);
3322 emit_testimm(temp,1);
3326 if (opcode[i]==0x2A) { // SWL
3327 emit_writeword_indexed(tl,0,temp);
3329 if (opcode[i]==0x2E) { // SWR
3330 emit_writebyte_indexed(tl,3,temp);
3332 if (opcode[i]==0x2C) { // SDL
3333 emit_writeword_indexed(th,0,temp);
3334 if(rs2[i]) emit_mov(tl,temp2);
3336 if (opcode[i]==0x2D) { // SDR
3337 emit_writebyte_indexed(tl,3,temp);
3338 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3343 set_jump_target(case1,(int)out);
3344 if (opcode[i]==0x2A) { // SWL
3345 // Write 3 msb into three least significant bytes
3346 if(rs2[i]) emit_rorimm(tl,8,tl);
3347 emit_writehword_indexed(tl,-1,temp);
3348 if(rs2[i]) emit_rorimm(tl,16,tl);
3349 emit_writebyte_indexed(tl,1,temp);
3350 if(rs2[i]) emit_rorimm(tl,8,tl);
3352 if (opcode[i]==0x2E) { // SWR
3353 // Write two lsb into two most significant bytes
3354 emit_writehword_indexed(tl,1,temp);
3356 if (opcode[i]==0x2C) { // SDL
3357 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3358 // Write 3 msb into three least significant bytes
3359 if(rs2[i]) emit_rorimm(th,8,th);
3360 emit_writehword_indexed(th,-1,temp);
3361 if(rs2[i]) emit_rorimm(th,16,th);
3362 emit_writebyte_indexed(th,1,temp);
3363 if(rs2[i]) emit_rorimm(th,8,th);
3365 if (opcode[i]==0x2D) { // SDR
3366 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3367 // Write two lsb into two most significant bytes
3368 emit_writehword_indexed(tl,1,temp);
3373 set_jump_target(case2,(int)out);
3374 emit_testimm(temp,1);
3377 if (opcode[i]==0x2A) { // SWL
3378 // Write two msb into two least significant bytes
3379 if(rs2[i]) emit_rorimm(tl,16,tl);
3380 emit_writehword_indexed(tl,-2,temp);
3381 if(rs2[i]) emit_rorimm(tl,16,tl);
3383 if (opcode[i]==0x2E) { // SWR
3384 // Write 3 lsb into three most significant bytes
3385 emit_writebyte_indexed(tl,-1,temp);
3386 if(rs2[i]) emit_rorimm(tl,8,tl);
3387 emit_writehword_indexed(tl,0,temp);
3388 if(rs2[i]) emit_rorimm(tl,24,tl);
3390 if (opcode[i]==0x2C) { // SDL
3391 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3392 // Write two msb into two least significant bytes
3393 if(rs2[i]) emit_rorimm(th,16,th);
3394 emit_writehword_indexed(th,-2,temp);
3395 if(rs2[i]) emit_rorimm(th,16,th);
3397 if (opcode[i]==0x2D) { // SDR
3398 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3399 // Write 3 lsb into three most significant bytes
3400 emit_writebyte_indexed(tl,-1,temp);
3401 if(rs2[i]) emit_rorimm(tl,8,tl);
3402 emit_writehword_indexed(tl,0,temp);
3403 if(rs2[i]) emit_rorimm(tl,24,tl);
3408 set_jump_target(case3,(int)out);
3409 if (opcode[i]==0x2A) { // SWL
3410 // Write msb into least significant byte
3411 if(rs2[i]) emit_rorimm(tl,24,tl);
3412 emit_writebyte_indexed(tl,-3,temp);
3413 if(rs2[i]) emit_rorimm(tl,8,tl);
3415 if (opcode[i]==0x2E) { // SWR
3416 // Write entire word
3417 emit_writeword_indexed(tl,-3,temp);
3419 if (opcode[i]==0x2C) { // SDL
3420 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3421 // Write msb into least significant byte
3422 if(rs2[i]) emit_rorimm(th,24,th);
3423 emit_writebyte_indexed(th,-3,temp);
3424 if(rs2[i]) emit_rorimm(th,8,th);
3426 if (opcode[i]==0x2D) { // SDR
3427 if(rs2[i]) emit_mov(th,temp2);
3428 // Write entire word
3429 emit_writeword_indexed(tl,-3,temp);
3431 set_jump_target(done0,(int)out);
3432 set_jump_target(done1,(int)out);
3433 set_jump_target(done2,(int)out);
3434 if (opcode[i]==0x2C) { // SDL
3435 emit_testimm(temp,4);
3438 emit_andimm(temp,~3,temp);
3439 emit_writeword_indexed(temp2,4,temp);
3440 set_jump_target(done0,(int)out);
3442 if (opcode[i]==0x2D) { // SDR
3443 emit_testimm(temp,4);
3446 emit_andimm(temp,~3,temp);
3447 emit_writeword_indexed(temp2,-4,temp);
3448 set_jump_target(done0,(int)out);
3451 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3454 int map=get_reg(i_regs->regmap,ROREG);
3455 if(map<0) map=HOST_TEMPREG;
3456 gen_orig_addr_w(temp,map);
3458 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3460 #if defined(HOST_IMM8)
3461 int ir=get_reg(i_regs->regmap,INVCP);
3463 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3465 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3467 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3468 emit_callne(invalidate_addr_reg[temp]);
3472 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3477 //save_regs(0x100f);
3478 emit_readword((int)&last_count,ECX);
3479 if(get_reg(i_regs->regmap,CCREG)<0)
3480 emit_loadreg(CCREG,HOST_CCREG);
3481 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3482 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3483 emit_writeword(HOST_CCREG,(int)&Count);
3484 emit_call((int)memdebug);
3486 //restore_regs(0x100f);
3490 void c1ls_assemble(int i,struct regstat *i_regs)
3492 #ifndef DISABLE_COP1
3498 int jaddr,jaddr2=0,jaddr3,type;
3499 int agr=AGEN1+(i&1);
3501 th=get_reg(i_regs->regmap,FTEMP|64);
3502 tl=get_reg(i_regs->regmap,FTEMP);
3503 s=get_reg(i_regs->regmap,rs1[i]);
3504 temp=get_reg(i_regs->regmap,agr);
3505 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3510 for(hr=0;hr<HOST_REGS;hr++) {
3511 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3513 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3514 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3516 // Loads use a temporary register which we need to save
3519 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3523 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3524 //else c=(i_regs->wasconst>>s)&1;
3525 if(s>=0) c=(i_regs->wasconst>>s)&1;
3526 // Check cop1 unusable
3528 signed char rs=get_reg(i_regs->regmap,CSREG);
3530 emit_testimm(rs,0x20000000);
3533 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3536 if (opcode[i]==0x39) { // SWC1 (get float address)
3537 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3539 if (opcode[i]==0x3D) { // SDC1 (get double address)
3540 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3542 // Generate address + offset
3545 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3549 map=get_reg(i_regs->regmap,TLREG);
3551 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3552 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3554 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3555 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3558 if (opcode[i]==0x39) { // SWC1 (read float)
3559 emit_readword_indexed(0,tl,tl);
3561 if (opcode[i]==0x3D) { // SDC1 (read double)
3562 emit_readword_indexed(4,tl,th);
3563 emit_readword_indexed(0,tl,tl);
3565 if (opcode[i]==0x31) { // LWC1 (get target address)
3566 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3568 if (opcode[i]==0x35) { // LDC1 (get target address)
3569 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3576 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3578 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3580 #ifdef DESTRUCTIVE_SHIFT
3581 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3582 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3586 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3587 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3589 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3590 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3593 if (opcode[i]==0x31) { // LWC1
3594 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3595 //gen_tlb_addr_r(ar,map);
3596 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3597 #ifdef HOST_IMM_ADDR32
3598 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3601 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3604 if (opcode[i]==0x35) { // LDC1
3606 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3607 //gen_tlb_addr_r(ar,map);
3608 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3609 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3610 #ifdef HOST_IMM_ADDR32
3611 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3614 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3617 if (opcode[i]==0x39) { // SWC1
3618 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3619 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3622 if (opcode[i]==0x3D) { // SDC1
3624 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3625 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3626 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3630 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3631 #ifndef DESTRUCTIVE_SHIFT
3632 temp=offset||c||s<0?ar:s;
3634 #if defined(HOST_IMM8)
3635 int ir=get_reg(i_regs->regmap,INVCP);
3637 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3639 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3641 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3642 emit_callne(invalidate_addr_reg[temp]);
3646 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3650 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3651 if (opcode[i]==0x31) { // LWC1 (write float)
3652 emit_writeword_indexed(tl,0,temp);
3654 if (opcode[i]==0x35) { // LDC1 (write double)
3655 emit_writeword_indexed(th,4,temp);
3656 emit_writeword_indexed(tl,0,temp);
3658 //if(opcode[i]==0x39)
3659 /*if(opcode[i]==0x39||opcode[i]==0x31)
3662 emit_readword((int)&last_count,ECX);
3663 if(get_reg(i_regs->regmap,CCREG)<0)
3664 emit_loadreg(CCREG,HOST_CCREG);
3665 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3666 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3667 emit_writeword(HOST_CCREG,(int)&Count);
3668 emit_call((int)memdebug);
3672 cop1_unusable(i, i_regs);
3676 void c2ls_assemble(int i,struct regstat *i_regs)
3681 int memtarget=0,c=0;
3682 int jaddr,jaddr2=0,jaddr3,type;
3683 int agr=AGEN1+(i&1);
3685 u_int copr=(source[i]>>16)&0x1f;
3686 s=get_reg(i_regs->regmap,rs1[i]);
3687 tl=get_reg(i_regs->regmap,FTEMP);
3693 for(hr=0;hr<HOST_REGS;hr++) {
3694 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3696 if(i_regs->regmap[HOST_CCREG]==CCREG)
3697 reglist&=~(1<<HOST_CCREG);
3700 if (opcode[i]==0x3a) { // SWC2
3701 ar=get_reg(i_regs->regmap,agr);
3702 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3707 if(s>=0) c=(i_regs->wasconst>>s)&1;
3708 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3709 if (!offset&&!c&&s>=0) ar=s;
3712 if (opcode[i]==0x3a) { // SWC2
3713 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3721 emit_jmp(0); // inline_readstub/inline_writestub?
3725 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3729 if (opcode[i]==0x32) { // LWC2
3730 #ifdef HOST_IMM_ADDR32
3731 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3734 emit_readword_indexed(0,ar,tl);
3736 if (opcode[i]==0x3a) { // SWC2
3737 #ifdef DESTRUCTIVE_SHIFT
3738 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3740 emit_writeword_indexed(tl,0,ar);
3744 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3745 if (opcode[i]==0x3a) { // SWC2
3746 #if defined(HOST_IMM8)
3747 int ir=get_reg(i_regs->regmap,INVCP);
3749 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3751 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3753 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3754 emit_callne(invalidate_addr_reg[ar]);
3758 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3761 if (opcode[i]==0x32) { // LWC2
3762 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3766 #ifndef multdiv_assemble
3767 void multdiv_assemble(int i,struct regstat *i_regs)
3769 printf("Need multdiv_assemble for this architecture.\n");
3774 void mov_assemble(int i,struct regstat *i_regs)
3776 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3777 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3779 signed char sh,sl,th,tl;
3780 th=get_reg(i_regs->regmap,rt1[i]|64);
3781 tl=get_reg(i_regs->regmap,rt1[i]);
3784 sh=get_reg(i_regs->regmap,rs1[i]|64);
3785 sl=get_reg(i_regs->regmap,rs1[i]);
3786 if(sl>=0) emit_mov(sl,tl);
3787 else emit_loadreg(rs1[i],tl);
3789 if(sh>=0) emit_mov(sh,th);
3790 else emit_loadreg(rs1[i]|64,th);
3796 #ifndef fconv_assemble
3797 void fconv_assemble(int i,struct regstat *i_regs)
3799 printf("Need fconv_assemble for this architecture.\n");
3805 void float_assemble(int i,struct regstat *i_regs)
3807 printf("Need float_assemble for this architecture.\n");
3812 void syscall_assemble(int i,struct regstat *i_regs)
3814 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3815 assert(ccreg==HOST_CCREG);
3816 assert(!is_delayslot);
3817 emit_movimm(start+i*4,EAX); // Get PC
3818 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3819 emit_jmp((int)jump_syscall_hle); // XXX
3822 void hlecall_assemble(int i,struct regstat *i_regs)
3824 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3825 assert(ccreg==HOST_CCREG);
3826 assert(!is_delayslot);
3827 emit_movimm(start+i*4+4,0); // Get PC
3828 emit_movimm((int)psxHLEt[source[i]&7],1);
3829 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // XXX
3830 emit_jmp((int)jump_hlecall);
3833 void intcall_assemble(int i,struct regstat *i_regs)
3835 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3836 assert(ccreg==HOST_CCREG);
3837 assert(!is_delayslot);
3838 emit_movimm(start+i*4,0); // Get PC
3839 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG);
3840 emit_jmp((int)jump_intcall);
3843 void ds_assemble(int i,struct regstat *i_regs)
3848 alu_assemble(i,i_regs);break;
3850 imm16_assemble(i,i_regs);break;
3852 shift_assemble(i,i_regs);break;
3854 shiftimm_assemble(i,i_regs);break;
3856 load_assemble(i,i_regs);break;
3858 loadlr_assemble(i,i_regs);break;
3860 store_assemble(i,i_regs);break;
3862 storelr_assemble(i,i_regs);break;
3864 cop0_assemble(i,i_regs);break;
3866 cop1_assemble(i,i_regs);break;
3868 c1ls_assemble(i,i_regs);break;
3870 cop2_assemble(i,i_regs);break;
3872 c2ls_assemble(i,i_regs);break;
3874 c2op_assemble(i,i_regs);break;
3876 fconv_assemble(i,i_regs);break;
3878 float_assemble(i,i_regs);break;
3880 fcomp_assemble(i,i_regs);break;
3882 multdiv_assemble(i,i_regs);break;
3884 mov_assemble(i,i_regs);break;
3894 printf("Jump in the delay slot. This is probably a bug.\n");
3899 // Is the branch target a valid internal jump?
3900 int internal_branch(uint64_t i_is32,int addr)
3902 if(addr&1) return 0; // Indirect (register) jump
3903 if(addr>=start && addr<start+slen*4-4)
3905 int t=(addr-start)>>2;
3906 // Delay slots are not valid branch targets
3907 //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;
3908 // 64 -> 32 bit transition requires a recompile
3909 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
3911 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
3912 else printf("optimizable: yes\n");
3914 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
3916 if(requires_32bit[t]&~i_is32) return 0;
3924 #ifndef wb_invalidate
3925 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
3926 uint64_t u,uint64_t uu)
3929 for(hr=0;hr<HOST_REGS;hr++) {
3930 if(hr!=EXCLUDE_REG) {
3931 if(pre[hr]!=entry[hr]) {
3934 if(get_reg(entry,pre[hr])<0) {
3936 if(!((u>>pre[hr])&1)) {
3937 emit_storereg(pre[hr],hr);
3938 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
3939 emit_sarimm(hr,31,hr);
3940 emit_storereg(pre[hr]|64,hr);
3944 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
3945 emit_storereg(pre[hr],hr);
3954 // Move from one register to another (no writeback)
3955 for(hr=0;hr<HOST_REGS;hr++) {
3956 if(hr!=EXCLUDE_REG) {
3957 if(pre[hr]!=entry[hr]) {
3958 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
3960 if((nr=get_reg(entry,pre[hr]))>=0) {
3970 // Load the specified registers
3971 // This only loads the registers given as arguments because
3972 // we don't want to load things that will be overwritten
3973 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
3977 for(hr=0;hr<HOST_REGS;hr++) {
3978 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
3979 if(entry[hr]!=regmap[hr]) {
3980 if(regmap[hr]==rs1||regmap[hr]==rs2)
3987 emit_loadreg(regmap[hr],hr);
3994 for(hr=0;hr<HOST_REGS;hr++) {
3995 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
3996 if(entry[hr]!=regmap[hr]) {
3997 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
3999 assert(regmap[hr]!=64);
4000 if((is32>>(regmap[hr]&63))&1) {
4001 int lr=get_reg(regmap,regmap[hr]-64);
4003 emit_sarimm(lr,31,hr);
4005 emit_loadreg(regmap[hr],hr);
4009 emit_loadreg(regmap[hr],hr);
4017 // Load registers prior to the start of a loop
4018 // so that they are not loaded within the loop
4019 static void loop_preload(signed char pre[],signed char entry[])
4022 for(hr=0;hr<HOST_REGS;hr++) {
4023 if(hr!=EXCLUDE_REG) {
4024 if(pre[hr]!=entry[hr]) {
4026 if(get_reg(pre,entry[hr])<0) {
4027 assem_debug("loop preload:\n");
4028 //printf("loop preload: %d\n",hr);
4032 else if(entry[hr]<TEMPREG)
4034 emit_loadreg(entry[hr],hr);
4036 else if(entry[hr]-64<TEMPREG)
4038 emit_loadreg(entry[hr],hr);
4047 // Generate address for load/store instruction
4048 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
4049 void address_generation(int i,struct regstat *i_regs,signed char entry[])
4051 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
4053 int agr=AGEN1+(i&1);
4054 int mgr=MGEN1+(i&1);
4055 if(itype[i]==LOAD) {
4056 ra=get_reg(i_regs->regmap,rt1[i]);
4057 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4060 if(itype[i]==LOADLR) {
4061 ra=get_reg(i_regs->regmap,FTEMP);
4063 if(itype[i]==STORE||itype[i]==STORELR) {
4064 ra=get_reg(i_regs->regmap,agr);
4065 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4067 if(itype[i]==C1LS||itype[i]==C2LS) {
4068 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
4069 ra=get_reg(i_regs->regmap,FTEMP);
4070 else { // SWC1/SDC1/SWC2/SDC2
4071 ra=get_reg(i_regs->regmap,agr);
4072 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4075 int rs=get_reg(i_regs->regmap,rs1[i]);
4076 int rm=get_reg(i_regs->regmap,TLREG);
4079 int c=(i_regs->wasconst>>rs)&1;
4081 // Using r0 as a base address
4083 if(!entry||entry[rm]!=mgr) {
4084 generate_map_const(offset,rm);
4085 } // else did it in the previous cycle
4087 if(!entry||entry[ra]!=agr) {
4088 if (opcode[i]==0x22||opcode[i]==0x26) {
4089 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4090 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4091 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4093 emit_movimm(offset,ra);
4095 } // else did it in the previous cycle
4098 if(!entry||entry[ra]!=rs1[i])
4099 emit_loadreg(rs1[i],ra);
4100 //if(!entry||entry[ra]!=rs1[i])
4101 // printf("poor load scheduling!\n");
4105 if(!entry||entry[rm]!=mgr) {
4106 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4107 // Stores to memory go thru the mapper to detect self-modifying
4108 // code, loads don't.
4109 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4110 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4111 generate_map_const(constmap[i][rs]+offset,rm);
4113 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4114 generate_map_const(constmap[i][rs]+offset,rm);
4118 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4119 if(!entry||entry[ra]!=agr) {
4120 if (opcode[i]==0x22||opcode[i]==0x26) {
4121 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4122 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4123 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4125 #ifdef HOST_IMM_ADDR32
4126 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4127 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4129 emit_movimm(constmap[i][rs]+offset,ra);
4131 } // else did it in the previous cycle
4132 } // else load_consts already did it
4134 if(offset&&!c&&rs1[i]) {
4136 emit_addimm(rs,offset,ra);
4138 emit_addimm(ra,offset,ra);
4143 // Preload constants for next instruction
4144 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) {
4146 #ifndef HOST_IMM_ADDR32
4148 agr=MGEN1+((i+1)&1);
4149 ra=get_reg(i_regs->regmap,agr);
4151 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4152 int offset=imm[i+1];
4153 int c=(regs[i+1].wasconst>>rs)&1;
4155 if(itype[i+1]==STORE||itype[i+1]==STORELR
4156 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4157 // Stores to memory go thru the mapper to detect self-modifying
4158 // code, loads don't.
4159 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4160 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4161 generate_map_const(constmap[i+1][rs]+offset,ra);
4163 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4164 generate_map_const(constmap[i+1][rs]+offset,ra);
4167 /*else if(rs1[i]==0) {
4168 generate_map_const(offset,ra);
4173 agr=AGEN1+((i+1)&1);
4174 ra=get_reg(i_regs->regmap,agr);
4176 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4177 int offset=imm[i+1];
4178 int c=(regs[i+1].wasconst>>rs)&1;
4179 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4180 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4181 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4182 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4183 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4185 #ifdef HOST_IMM_ADDR32
4186 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4187 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4189 emit_movimm(constmap[i+1][rs]+offset,ra);
4192 else if(rs1[i+1]==0) {
4193 // Using r0 as a base address
4194 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4195 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4196 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4197 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4199 emit_movimm(offset,ra);
4206 int get_final_value(int hr, int i, int *value)
4208 int reg=regs[i].regmap[hr];
4210 if(regs[i+1].regmap[hr]!=reg) break;
4211 if(!((regs[i+1].isconst>>hr)&1)) break;
4216 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4217 *value=constmap[i][hr];
4221 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4222 // Load in delay slot, out-of-order execution
4223 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4225 #ifdef HOST_IMM_ADDR32
4226 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4228 // Precompute load address
4229 *value=constmap[i][hr]+imm[i+2];
4233 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4235 #ifdef HOST_IMM_ADDR32
4236 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4238 // Precompute load address
4239 *value=constmap[i][hr]+imm[i+1];
4240 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4245 *value=constmap[i][hr];
4246 //printf("c=%x\n",(int)constmap[i][hr]);
4247 if(i==slen-1) return 1;
4249 return !((unneeded_reg[i+1]>>reg)&1);
4251 return !((unneeded_reg_upper[i+1]>>reg)&1);
4255 // Load registers with known constants
4256 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4260 for(hr=0;hr<HOST_REGS;hr++) {
4261 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4262 //if(entry[hr]!=regmap[hr]) {
4263 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4264 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4266 if(get_final_value(hr,i,&value)) {
4271 emit_movimm(value,hr);
4279 for(hr=0;hr<HOST_REGS;hr++) {
4280 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4281 //if(entry[hr]!=regmap[hr]) {
4282 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4283 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4284 if((is32>>(regmap[hr]&63))&1) {
4285 int lr=get_reg(regmap,regmap[hr]-64);
4287 emit_sarimm(lr,31,hr);
4292 if(get_final_value(hr,i,&value)) {
4297 emit_movimm(value,hr);
4306 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4310 for(hr=0;hr<HOST_REGS;hr++) {
4311 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4312 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4313 int value=constmap[i][hr];
4318 emit_movimm(value,hr);
4324 for(hr=0;hr<HOST_REGS;hr++) {
4325 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4326 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4327 if((is32>>(regmap[hr]&63))&1) {
4328 int lr=get_reg(regmap,regmap[hr]-64);
4330 emit_sarimm(lr,31,hr);
4334 int value=constmap[i][hr];
4339 emit_movimm(value,hr);
4347 // Write out all dirty registers (except cycle count)
4348 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4351 for(hr=0;hr<HOST_REGS;hr++) {
4352 if(hr!=EXCLUDE_REG) {
4353 if(i_regmap[hr]>0) {
4354 if(i_regmap[hr]!=CCREG) {
4355 if((i_dirty>>hr)&1) {
4356 if(i_regmap[hr]<64) {
4357 emit_storereg(i_regmap[hr],hr);
4359 if( ((i_is32>>i_regmap[hr])&1) ) {
4360 #ifdef DESTRUCTIVE_WRITEBACK
4361 emit_sarimm(hr,31,hr);
4362 emit_storereg(i_regmap[hr]|64,hr);
4364 emit_sarimm(hr,31,HOST_TEMPREG);
4365 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4370 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4371 emit_storereg(i_regmap[hr],hr);
4380 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4381 // This writes the registers not written by store_regs_bt
4382 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4385 int t=(addr-start)>>2;
4386 for(hr=0;hr<HOST_REGS;hr++) {
4387 if(hr!=EXCLUDE_REG) {
4388 if(i_regmap[hr]>0) {
4389 if(i_regmap[hr]!=CCREG) {
4390 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)) {
4391 if((i_dirty>>hr)&1) {
4392 if(i_regmap[hr]<64) {
4393 emit_storereg(i_regmap[hr],hr);
4395 if( ((i_is32>>i_regmap[hr])&1) ) {
4396 #ifdef DESTRUCTIVE_WRITEBACK
4397 emit_sarimm(hr,31,hr);
4398 emit_storereg(i_regmap[hr]|64,hr);
4400 emit_sarimm(hr,31,HOST_TEMPREG);
4401 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4406 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4407 emit_storereg(i_regmap[hr],hr);
4418 // Load all registers (except cycle count)
4419 void load_all_regs(signed char i_regmap[])
4422 for(hr=0;hr<HOST_REGS;hr++) {
4423 if(hr!=EXCLUDE_REG) {
4424 if(i_regmap[hr]==0) {
4428 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4430 emit_loadreg(i_regmap[hr],hr);
4436 // Load all current registers also needed by next instruction
4437 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4440 for(hr=0;hr<HOST_REGS;hr++) {
4441 if(hr!=EXCLUDE_REG) {
4442 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4443 if(i_regmap[hr]==0) {
4447 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4449 emit_loadreg(i_regmap[hr],hr);
4456 // Load all regs, storing cycle count if necessary
4457 void load_regs_entry(int t)
4460 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER,HOST_CCREG);
4461 else if(ccadj[t]) emit_addimm(HOST_CCREG,-ccadj[t]*CLOCK_DIVIDER,HOST_CCREG);
4462 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4463 emit_storereg(CCREG,HOST_CCREG);
4466 for(hr=0;hr<HOST_REGS;hr++) {
4467 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4468 if(regs[t].regmap_entry[hr]==0) {
4471 else if(regs[t].regmap_entry[hr]!=CCREG)
4473 emit_loadreg(regs[t].regmap_entry[hr],hr);
4478 for(hr=0;hr<HOST_REGS;hr++) {
4479 if(regs[t].regmap_entry[hr]>=64) {
4480 assert(regs[t].regmap_entry[hr]!=64);
4481 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4482 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4484 emit_loadreg(regs[t].regmap_entry[hr],hr);
4488 emit_sarimm(lr,31,hr);
4493 emit_loadreg(regs[t].regmap_entry[hr],hr);
4499 // Store dirty registers prior to branch
4500 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4502 if(internal_branch(i_is32,addr))
4504 int t=(addr-start)>>2;
4506 for(hr=0;hr<HOST_REGS;hr++) {
4507 if(hr!=EXCLUDE_REG) {
4508 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4509 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)) {
4510 if((i_dirty>>hr)&1) {
4511 if(i_regmap[hr]<64) {
4512 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4513 emit_storereg(i_regmap[hr],hr);
4514 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4515 #ifdef DESTRUCTIVE_WRITEBACK
4516 emit_sarimm(hr,31,hr);
4517 emit_storereg(i_regmap[hr]|64,hr);
4519 emit_sarimm(hr,31,HOST_TEMPREG);
4520 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4525 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4526 emit_storereg(i_regmap[hr],hr);
4537 // Branch out of this block, write out all dirty regs
4538 wb_dirtys(i_regmap,i_is32,i_dirty);
4542 // Load all needed registers for branch target
4543 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4545 //if(addr>=start && addr<(start+slen*4))
4546 if(internal_branch(i_is32,addr))
4548 int t=(addr-start)>>2;
4550 // Store the cycle count before loading something else
4551 if(i_regmap[HOST_CCREG]!=CCREG) {
4552 assert(i_regmap[HOST_CCREG]==-1);
4554 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4555 emit_storereg(CCREG,HOST_CCREG);
4558 for(hr=0;hr<HOST_REGS;hr++) {
4559 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4560 #ifdef DESTRUCTIVE_WRITEBACK
4561 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)) {
4563 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4565 if(regs[t].regmap_entry[hr]==0) {
4568 else if(regs[t].regmap_entry[hr]!=CCREG)
4570 emit_loadreg(regs[t].regmap_entry[hr],hr);
4576 for(hr=0;hr<HOST_REGS;hr++) {
4577 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64) {
4578 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4579 assert(regs[t].regmap_entry[hr]!=64);
4580 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4581 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4583 emit_loadreg(regs[t].regmap_entry[hr],hr);
4587 emit_sarimm(lr,31,hr);
4592 emit_loadreg(regs[t].regmap_entry[hr],hr);
4595 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4596 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4598 emit_sarimm(lr,31,hr);
4605 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4607 if(addr>=start && addr<start+slen*4-4)
4609 int t=(addr-start)>>2;
4611 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4612 for(hr=0;hr<HOST_REGS;hr++)
4616 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4618 if(regs[t].regmap_entry[hr]!=-1)
4627 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4632 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4637 else // Same register but is it 32-bit or dirty?
4640 if(!((regs[t].dirty>>hr)&1))
4644 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4646 //printf("%x: dirty no match\n",addr);
4651 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4653 //printf("%x: is32 no match\n",addr);
4659 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4661 if(requires_32bit[t]&~i_is32) return 0;
4663 // Delay slots are not valid branch targets
4664 //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;
4665 // Delay slots require additional processing, so do not match
4666 if(is_ds[t]) return 0;
4671 for(hr=0;hr<HOST_REGS;hr++)
4677 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4691 // Used when a branch jumps into the delay slot of another branch
4692 void ds_assemble_entry(int i)
4694 int t=(ba[i]-start)>>2;
4695 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4696 assem_debug("Assemble delay slot at %x\n",ba[i]);
4697 assem_debug("<->\n");
4698 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4699 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4700 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4701 address_generation(t,®s[t],regs[t].regmap_entry);
4702 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4703 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4708 alu_assemble(t,®s[t]);break;
4710 imm16_assemble(t,®s[t]);break;
4712 shift_assemble(t,®s[t]);break;
4714 shiftimm_assemble(t,®s[t]);break;
4716 load_assemble(t,®s[t]);break;
4718 loadlr_assemble(t,®s[t]);break;
4720 store_assemble(t,®s[t]);break;
4722 storelr_assemble(t,®s[t]);break;
4724 cop0_assemble(t,®s[t]);break;
4726 cop1_assemble(t,®s[t]);break;
4728 c1ls_assemble(t,®s[t]);break;
4730 cop2_assemble(t,®s[t]);break;
4732 c2ls_assemble(t,®s[t]);break;
4734 c2op_assemble(t,®s[t]);break;
4736 fconv_assemble(t,®s[t]);break;
4738 float_assemble(t,®s[t]);break;
4740 fcomp_assemble(t,®s[t]);break;
4742 multdiv_assemble(t,®s[t]);break;
4744 mov_assemble(t,®s[t]);break;
4754 printf("Jump in the delay slot. This is probably a bug.\n");
4756 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4757 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4758 if(internal_branch(regs[t].is32,ba[i]+4))
4759 assem_debug("branch: internal\n");
4761 assem_debug("branch: external\n");
4762 assert(internal_branch(regs[t].is32,ba[i]+4));
4763 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4767 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4776 //if(ba[i]>=start && ba[i]<(start+slen*4))
4777 if(internal_branch(branch_regs[i].is32,ba[i]))
4779 int t=(ba[i]-start)>>2;
4780 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4788 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4790 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4792 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4793 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4797 else if(*adj==0||invert) {
4798 emit_addimm_and_set_flags(CLOCK_DIVIDER*(count+2),HOST_CCREG);
4804 emit_cmpimm(HOST_CCREG,-2*(count+2));
4808 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4811 void do_ccstub(int n)
4814 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4815 set_jump_target(stubs[n][1],(int)out);
4817 if(stubs[n][6]==NULLDS) {
4818 // Delay slot instruction is nullified ("likely" branch)
4819 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4821 else if(stubs[n][6]!=TAKEN) {
4822 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4825 if(internal_branch(branch_regs[i].is32,ba[i]))
4826 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4830 // Save PC as return address
4831 emit_movimm(stubs[n][5],EAX);
4832 emit_writeword(EAX,(int)&pcaddr);
4836 // Return address depends on which way the branch goes
4837 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4839 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4840 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4841 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4842 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
4852 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
4856 #ifdef DESTRUCTIVE_WRITEBACK
4858 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
4859 emit_loadreg(rs1[i],s1l);
4862 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
4863 emit_loadreg(rs2[i],s1l);
4866 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
4867 emit_loadreg(rs2[i],s2l);
4870 int addr,alt,ntaddr;
4873 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4874 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4875 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4883 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4884 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4885 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4891 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
4895 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4896 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4897 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4903 assert(hr<HOST_REGS);
4905 if((opcode[i]&0x2f)==4) // BEQ
4907 #ifdef HAVE_CMOV_IMM
4909 if(s2l>=0) emit_cmp(s1l,s2l);
4910 else emit_test(s1l,s1l);
4911 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
4916 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4918 if(s2h>=0) emit_cmp(s1h,s2h);
4919 else emit_test(s1h,s1h);
4920 emit_cmovne_reg(alt,addr);
4922 if(s2l>=0) emit_cmp(s1l,s2l);
4923 else emit_test(s1l,s1l);
4924 emit_cmovne_reg(alt,addr);
4927 if((opcode[i]&0x2f)==5) // BNE
4929 #ifdef HAVE_CMOV_IMM
4931 if(s2l>=0) emit_cmp(s1l,s2l);
4932 else emit_test(s1l,s1l);
4933 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
4938 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
4940 if(s2h>=0) emit_cmp(s1h,s2h);
4941 else emit_test(s1h,s1h);
4942 emit_cmovne_reg(alt,addr);
4944 if(s2l>=0) emit_cmp(s1l,s2l);
4945 else emit_test(s1l,s1l);
4946 emit_cmovne_reg(alt,addr);
4949 if((opcode[i]&0x2f)==6) // BLEZ
4951 //emit_movimm(ba[i],alt);
4952 //emit_movimm(start+i*4+8,addr);
4953 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4955 if(s1h>=0) emit_mov(addr,ntaddr);
4956 emit_cmovl_reg(alt,addr);
4959 emit_cmovne_reg(ntaddr,addr);
4960 emit_cmovs_reg(alt,addr);
4963 if((opcode[i]&0x2f)==7) // BGTZ
4965 //emit_movimm(ba[i],addr);
4966 //emit_movimm(start+i*4+8,ntaddr);
4967 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
4969 if(s1h>=0) emit_mov(addr,alt);
4970 emit_cmovl_reg(ntaddr,addr);
4973 emit_cmovne_reg(alt,addr);
4974 emit_cmovs_reg(ntaddr,addr);
4977 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
4979 //emit_movimm(ba[i],alt);
4980 //emit_movimm(start+i*4+8,addr);
4981 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4982 if(s1h>=0) emit_test(s1h,s1h);
4983 else emit_test(s1l,s1l);
4984 emit_cmovs_reg(alt,addr);
4986 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
4988 //emit_movimm(ba[i],addr);
4989 //emit_movimm(start+i*4+8,alt);
4990 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4991 if(s1h>=0) emit_test(s1h,s1h);
4992 else emit_test(s1l,s1l);
4993 emit_cmovs_reg(alt,addr);
4995 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
4996 if(source[i]&0x10000) // BC1T
4998 //emit_movimm(ba[i],alt);
4999 //emit_movimm(start+i*4+8,addr);
5000 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5001 emit_testimm(s1l,0x800000);
5002 emit_cmovne_reg(alt,addr);
5006 //emit_movimm(ba[i],addr);
5007 //emit_movimm(start+i*4+8,alt);
5008 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5009 emit_testimm(s1l,0x800000);
5010 emit_cmovne_reg(alt,addr);
5013 emit_writeword(addr,(int)&pcaddr);
5018 int r=get_reg(branch_regs[i].regmap,rs1[i]);
5019 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5020 r=get_reg(branch_regs[i].regmap,RTEMP);
5022 emit_writeword(r,(int)&pcaddr);
5024 else {printf("Unknown branch type in do_ccstub\n");exit(1);}
5026 // Update cycle count
5027 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
5028 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5029 emit_call((int)cc_interrupt);
5030 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5031 if(stubs[n][6]==TAKEN) {
5032 if(internal_branch(branch_regs[i].is32,ba[i]))
5033 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
5034 else if(itype[i]==RJUMP) {
5035 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
5036 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
5038 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
5040 }else if(stubs[n][6]==NOTTAKEN) {
5041 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
5042 else load_all_regs(branch_regs[i].regmap);
5043 }else if(stubs[n][6]==NULLDS) {
5044 // Delay slot instruction is nullified ("likely" branch)
5045 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
5046 else load_all_regs(regs[i].regmap);
5048 load_all_regs(branch_regs[i].regmap);
5050 emit_jmp(stubs[n][2]); // return address
5052 /* This works but uses a lot of memory...
5053 emit_readword((int)&last_count,ECX);
5054 emit_add(HOST_CCREG,ECX,EAX);
5055 emit_writeword(EAX,(int)&Count);
5056 emit_call((int)gen_interupt);
5057 emit_readword((int)&Count,HOST_CCREG);
5058 emit_readword((int)&next_interupt,EAX);
5059 emit_readword((int)&pending_exception,EBX);
5060 emit_writeword(EAX,(int)&last_count);
5061 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
5063 int jne_instr=(int)out;
5065 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
5066 load_all_regs(branch_regs[i].regmap);
5067 emit_jmp(stubs[n][2]); // return address
5068 set_jump_target(jne_instr,(int)out);
5069 emit_readword((int)&pcaddr,EAX);
5070 // Call get_addr_ht instead of doing the hash table here.
5071 // This code is executed infrequently and takes up a lot of space
5072 // so smaller is better.
5073 emit_storereg(CCREG,HOST_CCREG);
5075 emit_call((int)get_addr_ht);
5076 emit_loadreg(CCREG,HOST_CCREG);
5077 emit_addimm(ESP,4,ESP);
5081 add_to_linker(int addr,int target,int ext)
5083 link_addr[linkcount][0]=addr;
5084 link_addr[linkcount][1]=target;
5085 link_addr[linkcount][2]=ext;
5089 void ujump_assemble(int i,struct regstat *i_regs)
5091 signed char *i_regmap=i_regs->regmap;
5092 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5093 address_generation(i+1,i_regs,regs[i].regmap_entry);
5095 int temp=get_reg(branch_regs[i].regmap,PTEMP);
5096 if(rt1[i]==31&&temp>=0)
5098 int return_address=start+i*4+8;
5099 if(get_reg(branch_regs[i].regmap,31)>0)
5100 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5103 ds_assemble(i+1,i_regs);
5104 uint64_t bc_unneeded=branch_regs[i].u;
5105 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5106 bc_unneeded|=1|(1LL<<rt1[i]);
5107 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5108 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5109 bc_unneeded,bc_unneeded_upper);
5110 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5113 unsigned int return_address;
5114 assert(rt1[i+1]!=31);
5115 assert(rt2[i+1]!=31);
5116 rt=get_reg(branch_regs[i].regmap,31);
5117 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]);
5119 return_address=start+i*4+8;
5122 if(internal_branch(branch_regs[i].is32,return_address)) {
5124 if(temp==EXCLUDE_REG||temp>=HOST_REGS||
5125 branch_regs[i].regmap[temp]>=0)
5127 temp=get_reg(branch_regs[i].regmap,-1);
5130 if(temp<0) temp=HOST_TEMPREG;
5132 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5133 else emit_movimm(return_address,rt);
5141 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5144 emit_movimm(return_address,rt); // PC into link register
5146 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5152 cc=get_reg(branch_regs[i].regmap,CCREG);
5153 assert(cc==HOST_CCREG);
5154 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5156 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5158 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5159 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5160 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5161 if(internal_branch(branch_regs[i].is32,ba[i]))
5162 assem_debug("branch: internal\n");
5164 assem_debug("branch: external\n");
5165 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5166 ds_assemble_entry(i);
5169 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5174 void rjump_assemble(int i,struct regstat *i_regs)
5176 signed char *i_regmap=i_regs->regmap;
5179 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5181 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5182 // Delay slot abuse, make a copy of the branch address register
5183 temp=get_reg(branch_regs[i].regmap,RTEMP);
5185 assert(regs[i].regmap[temp]==RTEMP);
5189 address_generation(i+1,i_regs,regs[i].regmap_entry);
5193 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5194 int return_address=start+i*4+8;
5195 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5201 int rh=get_reg(regs[i].regmap,RHASH);
5202 if(rh>=0) do_preload_rhash(rh);
5205 ds_assemble(i+1,i_regs);
5206 uint64_t bc_unneeded=branch_regs[i].u;
5207 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5208 bc_unneeded|=1|(1LL<<rt1[i]);
5209 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5210 bc_unneeded&=~(1LL<<rs1[i]);
5211 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5212 bc_unneeded,bc_unneeded_upper);
5213 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5215 int rt,return_address;
5216 assert(rt1[i+1]!=rt1[i]);
5217 assert(rt2[i+1]!=rt1[i]);
5218 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5219 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]);
5221 return_address=start+i*4+8;
5225 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5228 emit_movimm(return_address,rt); // PC into link register
5230 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5233 cc=get_reg(branch_regs[i].regmap,CCREG);
5234 assert(cc==HOST_CCREG);
5236 int rh=get_reg(branch_regs[i].regmap,RHASH);
5237 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5239 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5240 do_preload_rhtbl(ht);
5244 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5245 #ifdef DESTRUCTIVE_WRITEBACK
5246 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5247 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5248 emit_loadreg(rs1[i],rs);
5253 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5257 do_miniht_load(ht,rh);
5260 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5261 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5263 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5264 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5266 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5269 do_miniht_jump(rs,rh,ht);
5274 //if(rs!=EAX) emit_mov(rs,EAX);
5275 //emit_jmp((int)jump_vaddr_eax);
5276 emit_jmp(jump_vaddr_reg[rs]);
5281 emit_shrimm(rs,16,rs);
5282 emit_xor(temp,rs,rs);
5283 emit_movzwl_reg(rs,rs);
5284 emit_shlimm(rs,4,rs);
5285 emit_cmpmem_indexed((int)hash_table,rs,temp);
5286 emit_jne((int)out+14);
5287 emit_readword_indexed((int)hash_table+4,rs,rs);
5289 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5290 emit_addimm_no_flags(8,rs);
5291 emit_jeq((int)out-17);
5292 // No hit on hash table, call compiler
5295 #ifdef DEBUG_CYCLE_COUNT
5296 emit_readword((int)&last_count,ECX);
5297 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5298 emit_readword((int)&next_interupt,ECX);
5299 emit_writeword(HOST_CCREG,(int)&Count);
5300 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5301 emit_writeword(ECX,(int)&last_count);
5304 emit_storereg(CCREG,HOST_CCREG);
5305 emit_call((int)get_addr);
5306 emit_loadreg(CCREG,HOST_CCREG);
5307 emit_addimm(ESP,4,ESP);
5309 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5310 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5314 void cjump_assemble(int i,struct regstat *i_regs)
5316 signed char *i_regmap=i_regs->regmap;
5319 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5320 assem_debug("match=%d\n",match);
5321 int s1h,s1l,s2h,s2l;
5322 int prev_cop1_usable=cop1_usable;
5323 int unconditional=0,nop=0;
5326 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5327 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5328 if(!match) invert=1;
5329 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5330 if(i>(ba[i]-start)>>2) invert=1;
5334 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5335 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5336 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5337 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5340 s1l=get_reg(i_regmap,rs1[i]);
5341 s1h=get_reg(i_regmap,rs1[i]|64);
5342 s2l=get_reg(i_regmap,rs2[i]);
5343 s2h=get_reg(i_regmap,rs2[i]|64);
5345 if(rs1[i]==0&&rs2[i]==0)
5347 if(opcode[i]&1) nop=1;
5348 else unconditional=1;
5349 //assert(opcode[i]!=5);
5350 //assert(opcode[i]!=7);
5351 //assert(opcode[i]!=0x15);
5352 //assert(opcode[i]!=0x17);
5358 only32=(regs[i].was32>>rs2[i])&1;
5363 only32=(regs[i].was32>>rs1[i])&1;
5366 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5370 // Out of order execution (delay slot first)
5372 address_generation(i+1,i_regs,regs[i].regmap_entry);
5373 ds_assemble(i+1,i_regs);
5375 uint64_t bc_unneeded=branch_regs[i].u;
5376 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5377 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5378 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5380 bc_unneeded_upper|=1;
5381 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5382 bc_unneeded,bc_unneeded_upper);
5383 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5384 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5385 cc=get_reg(branch_regs[i].regmap,CCREG);
5386 assert(cc==HOST_CCREG);
5388 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5389 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5390 //assem_debug("cycle count (adj)\n");
5392 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5393 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5394 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5395 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5397 assem_debug("branch: internal\n");
5399 assem_debug("branch: external\n");
5400 if(internal&&is_ds[(ba[i]-start)>>2]) {
5401 ds_assemble_entry(i);
5404 add_to_linker((int)out,ba[i],internal);
5407 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5408 if(((u_int)out)&7) emit_addnop(0);
5413 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5416 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5419 int taken=0,nottaken=0,nottaken1=0;
5420 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5421 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5425 if(opcode[i]==4) // BEQ
5427 if(s2h>=0) emit_cmp(s1h,s2h);
5428 else emit_test(s1h,s1h);
5432 if(opcode[i]==5) // BNE
5434 if(s2h>=0) emit_cmp(s1h,s2h);
5435 else emit_test(s1h,s1h);
5436 if(invert) taken=(int)out;
5437 else add_to_linker((int)out,ba[i],internal);
5440 if(opcode[i]==6) // BLEZ
5443 if(invert) taken=(int)out;
5444 else add_to_linker((int)out,ba[i],internal);
5449 if(opcode[i]==7) // BGTZ
5454 if(invert) taken=(int)out;
5455 else add_to_linker((int)out,ba[i],internal);
5460 //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]);
5462 if(opcode[i]==4) // BEQ
5464 if(s2l>=0) emit_cmp(s1l,s2l);
5465 else emit_test(s1l,s1l);
5470 add_to_linker((int)out,ba[i],internal);
5474 if(opcode[i]==5) // BNE
5476 if(s2l>=0) emit_cmp(s1l,s2l);
5477 else emit_test(s1l,s1l);
5482 add_to_linker((int)out,ba[i],internal);
5486 if(opcode[i]==6) // BLEZ
5493 add_to_linker((int)out,ba[i],internal);
5497 if(opcode[i]==7) // BGTZ
5504 add_to_linker((int)out,ba[i],internal);
5509 if(taken) set_jump_target(taken,(int)out);
5510 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5511 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5513 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5514 add_to_linker((int)out,ba[i],internal);
5517 add_to_linker((int)out,ba[i],internal*2);
5523 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5524 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5525 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5527 assem_debug("branch: internal\n");
5529 assem_debug("branch: external\n");
5530 if(internal&&is_ds[(ba[i]-start)>>2]) {
5531 ds_assemble_entry(i);
5534 add_to_linker((int)out,ba[i],internal);
5538 set_jump_target(nottaken,(int)out);
5541 if(nottaken1) set_jump_target(nottaken1,(int)out);
5543 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5545 } // (!unconditional)
5549 // In-order execution (branch first)
5550 //if(likely[i]) printf("IOL\n");
5553 int taken=0,nottaken=0,nottaken1=0;
5554 if(!unconditional&&!nop) {
5558 if((opcode[i]&0x2f)==4) // BEQ
5560 if(s2h>=0) emit_cmp(s1h,s2h);
5561 else emit_test(s1h,s1h);
5565 if((opcode[i]&0x2f)==5) // BNE
5567 if(s2h>=0) emit_cmp(s1h,s2h);
5568 else emit_test(s1h,s1h);
5572 if((opcode[i]&0x2f)==6) // BLEZ
5580 if((opcode[i]&0x2f)==7) // BGTZ
5590 //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]);
5592 if((opcode[i]&0x2f)==4) // BEQ
5594 if(s2l>=0) emit_cmp(s1l,s2l);
5595 else emit_test(s1l,s1l);
5599 if((opcode[i]&0x2f)==5) // BNE
5601 if(s2l>=0) emit_cmp(s1l,s2l);
5602 else emit_test(s1l,s1l);
5606 if((opcode[i]&0x2f)==6) // BLEZ
5612 if((opcode[i]&0x2f)==7) // BGTZ
5618 } // if(!unconditional)
5620 uint64_t ds_unneeded=branch_regs[i].u;
5621 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5622 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5623 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5624 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5626 ds_unneeded_upper|=1;
5629 if(taken) set_jump_target(taken,(int)out);
5630 assem_debug("1:\n");
5631 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5632 ds_unneeded,ds_unneeded_upper);
5634 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5635 address_generation(i+1,&branch_regs[i],0);
5636 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5637 ds_assemble(i+1,&branch_regs[i]);
5638 cc=get_reg(branch_regs[i].regmap,CCREG);
5640 emit_loadreg(CCREG,cc=HOST_CCREG);
5641 // CHECK: Is the following instruction (fall thru) allocated ok?
5643 assert(cc==HOST_CCREG);
5644 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5645 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5646 assem_debug("cycle count (adj)\n");
5647 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5648 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5650 assem_debug("branch: internal\n");
5652 assem_debug("branch: external\n");
5653 if(internal&&is_ds[(ba[i]-start)>>2]) {
5654 ds_assemble_entry(i);
5657 add_to_linker((int)out,ba[i],internal);
5662 cop1_usable=prev_cop1_usable;
5663 if(!unconditional) {
5664 if(nottaken1) set_jump_target(nottaken1,(int)out);
5665 set_jump_target(nottaken,(int)out);
5666 assem_debug("2:\n");
5668 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5669 ds_unneeded,ds_unneeded_upper);
5670 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5671 address_generation(i+1,&branch_regs[i],0);
5672 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5673 ds_assemble(i+1,&branch_regs[i]);
5675 cc=get_reg(branch_regs[i].regmap,CCREG);
5676 if(cc==-1&&!likely[i]) {
5677 // Cycle count isn't in a register, temporarily load it then write it out
5678 emit_loadreg(CCREG,HOST_CCREG);
5679 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5682 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5683 emit_storereg(CCREG,HOST_CCREG);
5686 cc=get_reg(i_regmap,CCREG);
5687 assert(cc==HOST_CCREG);
5688 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5691 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5697 void sjump_assemble(int i,struct regstat *i_regs)
5699 signed char *i_regmap=i_regs->regmap;
5702 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5703 assem_debug("smatch=%d\n",match);
5705 int prev_cop1_usable=cop1_usable;
5706 int unconditional=0,nevertaken=0;
5709 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5710 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5711 if(!match) invert=1;
5712 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5713 if(i>(ba[i]-start)>>2) invert=1;
5716 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5717 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5720 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5721 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5724 s1l=get_reg(i_regmap,rs1[i]);
5725 s1h=get_reg(i_regmap,rs1[i]|64);
5729 if(opcode2[i]&1) unconditional=1;
5731 // These are never taken (r0 is never less than zero)
5732 //assert(opcode2[i]!=0);
5733 //assert(opcode2[i]!=2);
5734 //assert(opcode2[i]!=0x10);
5735 //assert(opcode2[i]!=0x12);
5738 only32=(regs[i].was32>>rs1[i])&1;
5742 // Out of order execution (delay slot first)
5744 address_generation(i+1,i_regs,regs[i].regmap_entry);
5745 ds_assemble(i+1,i_regs);
5747 uint64_t bc_unneeded=branch_regs[i].u;
5748 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5749 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5750 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5752 bc_unneeded_upper|=1;
5753 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5754 bc_unneeded,bc_unneeded_upper);
5755 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5756 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5758 int rt,return_address;
5759 rt=get_reg(branch_regs[i].regmap,31);
5760 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]);
5762 // Save the PC even if the branch is not taken
5763 return_address=start+i*4+8;
5764 emit_movimm(return_address,rt); // PC into link register
5766 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5770 cc=get_reg(branch_regs[i].regmap,CCREG);
5771 assert(cc==HOST_CCREG);
5773 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5774 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5775 assem_debug("cycle count (adj)\n");
5777 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5778 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5779 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5780 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5782 assem_debug("branch: internal\n");
5784 assem_debug("branch: external\n");
5785 if(internal&&is_ds[(ba[i]-start)>>2]) {
5786 ds_assemble_entry(i);
5789 add_to_linker((int)out,ba[i],internal);
5792 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5793 if(((u_int)out)&7) emit_addnop(0);
5797 else if(nevertaken) {
5798 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5801 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5805 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5806 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5810 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5817 add_to_linker((int)out,ba[i],internal);
5821 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5828 add_to_linker((int)out,ba[i],internal);
5836 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5843 add_to_linker((int)out,ba[i],internal);
5847 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5854 add_to_linker((int)out,ba[i],internal);
5861 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5862 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5864 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5865 add_to_linker((int)out,ba[i],internal);
5868 add_to_linker((int)out,ba[i],internal*2);
5874 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5875 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5876 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5878 assem_debug("branch: internal\n");
5880 assem_debug("branch: external\n");
5881 if(internal&&is_ds[(ba[i]-start)>>2]) {
5882 ds_assemble_entry(i);
5885 add_to_linker((int)out,ba[i],internal);
5889 set_jump_target(nottaken,(int)out);
5893 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5895 } // (!unconditional)
5899 // In-order execution (branch first)
5903 int rt,return_address;
5904 rt=get_reg(branch_regs[i].regmap,31);
5906 // Save the PC even if the branch is not taken
5907 return_address=start+i*4+8;
5908 emit_movimm(return_address,rt); // PC into link register
5910 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5914 if(!unconditional) {
5915 //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]);
5919 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5925 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5935 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5941 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5948 } // if(!unconditional)
5950 uint64_t ds_unneeded=branch_regs[i].u;
5951 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5952 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5953 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5954 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5956 ds_unneeded_upper|=1;
5959 //assem_debug("1:\n");
5960 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5961 ds_unneeded,ds_unneeded_upper);
5963 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5964 address_generation(i+1,&branch_regs[i],0);
5965 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5966 ds_assemble(i+1,&branch_regs[i]);
5967 cc=get_reg(branch_regs[i].regmap,CCREG);
5969 emit_loadreg(CCREG,cc=HOST_CCREG);
5970 // CHECK: Is the following instruction (fall thru) allocated ok?
5972 assert(cc==HOST_CCREG);
5973 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5974 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5975 assem_debug("cycle count (adj)\n");
5976 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5977 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5979 assem_debug("branch: internal\n");
5981 assem_debug("branch: external\n");
5982 if(internal&&is_ds[(ba[i]-start)>>2]) {
5983 ds_assemble_entry(i);
5986 add_to_linker((int)out,ba[i],internal);
5991 cop1_usable=prev_cop1_usable;
5992 if(!unconditional) {
5993 set_jump_target(nottaken,(int)out);
5994 assem_debug("1:\n");
5996 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5997 ds_unneeded,ds_unneeded_upper);
5998 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5999 address_generation(i+1,&branch_regs[i],0);
6000 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6001 ds_assemble(i+1,&branch_regs[i]);
6003 cc=get_reg(branch_regs[i].regmap,CCREG);
6004 if(cc==-1&&!likely[i]) {
6005 // Cycle count isn't in a register, temporarily load it then write it out
6006 emit_loadreg(CCREG,HOST_CCREG);
6007 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6010 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6011 emit_storereg(CCREG,HOST_CCREG);
6014 cc=get_reg(i_regmap,CCREG);
6015 assert(cc==HOST_CCREG);
6016 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6019 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6025 void fjump_assemble(int i,struct regstat *i_regs)
6027 signed char *i_regmap=i_regs->regmap;
6030 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6031 assem_debug("fmatch=%d\n",match);
6035 int internal=internal_branch(branch_regs[i].is32,ba[i]);
6036 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
6037 if(!match) invert=1;
6038 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6039 if(i>(ba[i]-start)>>2) invert=1;
6043 fs=get_reg(branch_regs[i].regmap,FSREG);
6044 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
6047 fs=get_reg(i_regmap,FSREG);
6050 // Check cop1 unusable
6052 cs=get_reg(i_regmap,CSREG);
6054 emit_testimm(cs,0x20000000);
6057 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
6062 // Out of order execution (delay slot first)
6064 ds_assemble(i+1,i_regs);
6066 uint64_t bc_unneeded=branch_regs[i].u;
6067 uint64_t bc_unneeded_upper=branch_regs[i].uu;
6068 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6069 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
6071 bc_unneeded_upper|=1;
6072 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6073 bc_unneeded,bc_unneeded_upper);
6074 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
6075 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6076 cc=get_reg(branch_regs[i].regmap,CCREG);
6077 assert(cc==HOST_CCREG);
6078 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6079 assem_debug("cycle count (adj)\n");
6082 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6085 emit_testimm(fs,0x800000);
6086 if(source[i]&0x10000) // BC1T
6092 add_to_linker((int)out,ba[i],internal);
6101 add_to_linker((int)out,ba[i],internal);
6109 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
6110 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6111 else if(match) emit_addnop(13);
6113 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6114 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6116 assem_debug("branch: internal\n");
6118 assem_debug("branch: external\n");
6119 if(internal&&is_ds[(ba[i]-start)>>2]) {
6120 ds_assemble_entry(i);
6123 add_to_linker((int)out,ba[i],internal);
6126 set_jump_target(nottaken,(int)out);
6130 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
6132 } // (!unconditional)
6136 // In-order execution (branch first)
6140 //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]);
6143 emit_testimm(fs,0x800000);
6144 if(source[i]&0x10000) // BC1T
6155 } // if(!unconditional)
6157 uint64_t ds_unneeded=branch_regs[i].u;
6158 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6159 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6160 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6161 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6163 ds_unneeded_upper|=1;
6165 //assem_debug("1:\n");
6166 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6167 ds_unneeded,ds_unneeded_upper);
6169 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6170 address_generation(i+1,&branch_regs[i],0);
6171 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6172 ds_assemble(i+1,&branch_regs[i]);
6173 cc=get_reg(branch_regs[i].regmap,CCREG);
6175 emit_loadreg(CCREG,cc=HOST_CCREG);
6176 // CHECK: Is the following instruction (fall thru) allocated ok?
6178 assert(cc==HOST_CCREG);
6179 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6180 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6181 assem_debug("cycle count (adj)\n");
6182 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6183 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6185 assem_debug("branch: internal\n");
6187 assem_debug("branch: external\n");
6188 if(internal&&is_ds[(ba[i]-start)>>2]) {
6189 ds_assemble_entry(i);
6192 add_to_linker((int)out,ba[i],internal);
6197 if(1) { // <- FIXME (don't need this)
6198 set_jump_target(nottaken,(int)out);
6199 assem_debug("1:\n");
6201 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6202 ds_unneeded,ds_unneeded_upper);
6203 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6204 address_generation(i+1,&branch_regs[i],0);
6205 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6206 ds_assemble(i+1,&branch_regs[i]);
6208 cc=get_reg(branch_regs[i].regmap,CCREG);
6209 if(cc==-1&&!likely[i]) {
6210 // Cycle count isn't in a register, temporarily load it then write it out
6211 emit_loadreg(CCREG,HOST_CCREG);
6212 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6215 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6216 emit_storereg(CCREG,HOST_CCREG);
6219 cc=get_reg(i_regmap,CCREG);
6220 assert(cc==HOST_CCREG);
6221 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6224 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6230 static void pagespan_assemble(int i,struct regstat *i_regs)
6232 int s1l=get_reg(i_regs->regmap,rs1[i]);
6233 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6234 int s2l=get_reg(i_regs->regmap,rs2[i]);
6235 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6236 void *nt_branch=NULL;
6239 int unconditional=0;
6249 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6253 int addr,alt,ntaddr;
6254 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6258 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6259 (i_regs->regmap[hr]&63)!=rs1[i] &&
6260 (i_regs->regmap[hr]&63)!=rs2[i] )
6269 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6270 (i_regs->regmap[hr]&63)!=rs1[i] &&
6271 (i_regs->regmap[hr]&63)!=rs2[i] )
6277 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6281 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6282 (i_regs->regmap[hr]&63)!=rs1[i] &&
6283 (i_regs->regmap[hr]&63)!=rs2[i] )
6290 assert(hr<HOST_REGS);
6291 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6292 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6294 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6295 if(opcode[i]==2) // J
6299 if(opcode[i]==3) // JAL
6302 int rt=get_reg(i_regs->regmap,31);
6303 emit_movimm(start+i*4+8,rt);
6306 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6309 if(opcode2[i]==9) // JALR
6311 int rt=get_reg(i_regs->regmap,rt1[i]);
6312 emit_movimm(start+i*4+8,rt);
6315 if((opcode[i]&0x3f)==4) // BEQ
6322 #ifdef HAVE_CMOV_IMM
6324 if(s2l>=0) emit_cmp(s1l,s2l);
6325 else emit_test(s1l,s1l);
6326 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6332 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6334 if(s2h>=0) emit_cmp(s1h,s2h);
6335 else emit_test(s1h,s1h);
6336 emit_cmovne_reg(alt,addr);
6338 if(s2l>=0) emit_cmp(s1l,s2l);
6339 else emit_test(s1l,s1l);
6340 emit_cmovne_reg(alt,addr);
6343 if((opcode[i]&0x3f)==5) // BNE
6345 #ifdef HAVE_CMOV_IMM
6347 if(s2l>=0) emit_cmp(s1l,s2l);
6348 else emit_test(s1l,s1l);
6349 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6355 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6357 if(s2h>=0) emit_cmp(s1h,s2h);
6358 else emit_test(s1h,s1h);
6359 emit_cmovne_reg(alt,addr);
6361 if(s2l>=0) emit_cmp(s1l,s2l);
6362 else emit_test(s1l,s1l);
6363 emit_cmovne_reg(alt,addr);
6366 if((opcode[i]&0x3f)==0x14) // BEQL
6369 if(s2h>=0) emit_cmp(s1h,s2h);
6370 else emit_test(s1h,s1h);
6374 if(s2l>=0) emit_cmp(s1l,s2l);
6375 else emit_test(s1l,s1l);
6376 if(nottaken) set_jump_target(nottaken,(int)out);
6380 if((opcode[i]&0x3f)==0x15) // BNEL
6383 if(s2h>=0) emit_cmp(s1h,s2h);
6384 else emit_test(s1h,s1h);
6388 if(s2l>=0) emit_cmp(s1l,s2l);
6389 else emit_test(s1l,s1l);
6392 if(taken) set_jump_target(taken,(int)out);
6394 if((opcode[i]&0x3f)==6) // BLEZ
6396 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6398 if(s1h>=0) emit_mov(addr,ntaddr);
6399 emit_cmovl_reg(alt,addr);
6402 emit_cmovne_reg(ntaddr,addr);
6403 emit_cmovs_reg(alt,addr);
6406 if((opcode[i]&0x3f)==7) // BGTZ
6408 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6410 if(s1h>=0) emit_mov(addr,alt);
6411 emit_cmovl_reg(ntaddr,addr);
6414 emit_cmovne_reg(alt,addr);
6415 emit_cmovs_reg(ntaddr,addr);
6418 if((opcode[i]&0x3f)==0x16) // BLEZL
6420 assert((opcode[i]&0x3f)!=0x16);
6422 if((opcode[i]&0x3f)==0x17) // BGTZL
6424 assert((opcode[i]&0x3f)!=0x17);
6426 assert(opcode[i]!=1); // BLTZ/BGEZ
6428 //FIXME: Check CSREG
6429 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6430 if((source[i]&0x30000)==0) // BC1F
6432 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6433 emit_testimm(s1l,0x800000);
6434 emit_cmovne_reg(alt,addr);
6436 if((source[i]&0x30000)==0x10000) // BC1T
6438 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6439 emit_testimm(s1l,0x800000);
6440 emit_cmovne_reg(alt,addr);
6442 if((source[i]&0x30000)==0x20000) // BC1FL
6444 emit_testimm(s1l,0x800000);
6448 if((source[i]&0x30000)==0x30000) // BC1TL
6450 emit_testimm(s1l,0x800000);
6456 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6457 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6458 if(likely[i]||unconditional)
6460 emit_movimm(ba[i],HOST_BTREG);
6462 else if(addr!=HOST_BTREG)
6464 emit_mov(addr,HOST_BTREG);
6466 void *branch_addr=out;
6468 int target_addr=start+i*4+5;
6470 void *compiled_target_addr=check_addr(target_addr);
6471 emit_extjump_ds((int)branch_addr,target_addr);
6472 if(compiled_target_addr) {
6473 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6474 add_link(target_addr,stub);
6476 else set_jump_target((int)branch_addr,(int)stub);
6479 set_jump_target((int)nottaken,(int)out);
6480 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6481 void *branch_addr=out;
6483 int target_addr=start+i*4+8;
6485 void *compiled_target_addr=check_addr(target_addr);
6486 emit_extjump_ds((int)branch_addr,target_addr);
6487 if(compiled_target_addr) {
6488 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6489 add_link(target_addr,stub);
6491 else set_jump_target((int)branch_addr,(int)stub);
6495 // Assemble the delay slot for the above
6496 static void pagespan_ds()
6498 assem_debug("initial delay slot:\n");
6499 u_int vaddr=start+1;
6500 u_int page=get_page(vaddr);
6501 u_int vpage=get_vpage(vaddr);
6502 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6504 ll_add(jump_in+page,vaddr,(void *)out);
6505 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6506 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6507 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6508 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6509 emit_writeword(HOST_BTREG,(int)&branch_target);
6510 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6511 address_generation(0,®s[0],regs[0].regmap_entry);
6512 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6513 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6518 alu_assemble(0,®s[0]);break;
6520 imm16_assemble(0,®s[0]);break;
6522 shift_assemble(0,®s[0]);break;
6524 shiftimm_assemble(0,®s[0]);break;
6526 load_assemble(0,®s[0]);break;
6528 loadlr_assemble(0,®s[0]);break;
6530 store_assemble(0,®s[0]);break;
6532 storelr_assemble(0,®s[0]);break;
6534 cop0_assemble(0,®s[0]);break;
6536 cop1_assemble(0,®s[0]);break;
6538 c1ls_assemble(0,®s[0]);break;
6540 cop2_assemble(0,®s[0]);break;
6542 c2ls_assemble(0,®s[0]);break;
6544 c2op_assemble(0,®s[0]);break;
6546 fconv_assemble(0,®s[0]);break;
6548 float_assemble(0,®s[0]);break;
6550 fcomp_assemble(0,®s[0]);break;
6552 multdiv_assemble(0,®s[0]);break;
6554 mov_assemble(0,®s[0]);break;
6564 printf("Jump in the delay slot. This is probably a bug.\n");
6566 int btaddr=get_reg(regs[0].regmap,BTREG);
6568 btaddr=get_reg(regs[0].regmap,-1);
6569 emit_readword((int)&branch_target,btaddr);
6571 assert(btaddr!=HOST_CCREG);
6572 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6574 emit_movimm(start+4,HOST_TEMPREG);
6575 emit_cmp(btaddr,HOST_TEMPREG);
6577 emit_cmpimm(btaddr,start+4);
6579 int branch=(int)out;
6581 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6582 emit_jmp(jump_vaddr_reg[btaddr]);
6583 set_jump_target(branch,(int)out);
6584 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6585 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6588 // Basic liveness analysis for MIPS registers
6589 void unneeded_registers(int istart,int iend,int r)
6593 uint64_t temp_u,temp_uu;
6598 u=unneeded_reg[iend+1];
6599 uu=unneeded_reg_upper[iend+1];
6602 for (i=iend;i>=istart;i--)
6604 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6605 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6607 // If subroutine call, flag return address as a possible branch target
6608 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6610 if(ba[i]<start || ba[i]>=(start+slen*4))
6612 // Branch out of this block, flush all regs
6616 if(itype[i]==UJUMP&&rt1[i]==31)
6618 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6620 if(itype[i]==RJUMP&&rs1[i]==31)
6622 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6624 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6625 if(itype[i]==UJUMP&&rt1[i]==31)
6627 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6628 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6630 if(itype[i]==RJUMP&&rs1[i]==31)
6632 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6633 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6636 branch_unneeded_reg[i]=u;
6637 branch_unneeded_reg_upper[i]=uu;
6638 // Merge in delay slot
6639 tdep=(~uu>>rt1[i+1])&1;
6640 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6641 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6642 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6643 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6644 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6646 // If branch is "likely" (and conditional)
6647 // then we skip the delay slot on the fall-thru path
6650 u&=unneeded_reg[i+2];
6651 uu&=unneeded_reg_upper[i+2];
6662 // Internal branch, flag target
6663 bt[(ba[i]-start)>>2]=1;
6664 if(ba[i]<=start+i*4) {
6666 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6668 // Unconditional branch
6671 // Conditional branch (not taken case)
6672 temp_u=unneeded_reg[i+2];
6673 temp_uu=unneeded_reg_upper[i+2];
6675 // Merge in delay slot
6676 tdep=(~temp_uu>>rt1[i+1])&1;
6677 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6678 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6679 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6680 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6681 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6682 temp_u|=1;temp_uu|=1;
6683 // If branch is "likely" (and conditional)
6684 // then we skip the delay slot on the fall-thru path
6687 temp_u&=unneeded_reg[i+2];
6688 temp_uu&=unneeded_reg_upper[i+2];
6696 tdep=(~temp_uu>>rt1[i])&1;
6697 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6698 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6699 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6700 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6701 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6702 temp_u|=1;temp_uu|=1;
6703 unneeded_reg[i]=temp_u;
6704 unneeded_reg_upper[i]=temp_uu;
6705 // Only go three levels deep. This recursion can take an
6706 // excessive amount of time if there are a lot of nested loops.
6708 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6710 unneeded_reg[(ba[i]-start)>>2]=1;
6711 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6714 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6716 // Unconditional branch
6717 u=unneeded_reg[(ba[i]-start)>>2];
6718 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6719 branch_unneeded_reg[i]=u;
6720 branch_unneeded_reg_upper[i]=uu;
6723 //branch_unneeded_reg[i]=u;
6724 //branch_unneeded_reg_upper[i]=uu;
6725 // Merge in delay slot
6726 tdep=(~uu>>rt1[i+1])&1;
6727 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6728 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6729 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6730 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6731 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6734 // Conditional branch
6735 b=unneeded_reg[(ba[i]-start)>>2];
6736 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6737 branch_unneeded_reg[i]=b;
6738 branch_unneeded_reg_upper[i]=bu;
6741 //branch_unneeded_reg[i]=b;
6742 //branch_unneeded_reg_upper[i]=bu;
6743 // Branch delay slot
6744 tdep=(~uu>>rt1[i+1])&1;
6745 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6746 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6747 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6748 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6749 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6751 // If branch is "likely" then we skip the
6752 // delay slot on the fall-thru path
6757 u&=unneeded_reg[i+2];
6758 uu&=unneeded_reg_upper[i+2];
6769 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6770 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6771 //branch_unneeded_reg[i]=1;
6772 //branch_unneeded_reg_upper[i]=1;
6774 branch_unneeded_reg[i]=1;
6775 branch_unneeded_reg_upper[i]=1;
6781 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
6783 // SYSCALL instruction (software interrupt)
6787 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6789 // ERET instruction (return from interrupt)
6794 tdep=(~uu>>rt1[i])&1;
6795 // Written registers are unneeded
6800 // Accessed registers are needed
6805 // Source-target dependencies
6806 uu&=~(tdep<<dep1[i]);
6807 uu&=~(tdep<<dep2[i]);
6808 // R0 is always unneeded
6812 unneeded_reg_upper[i]=uu;
6814 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
6817 for(r=1;r<=CCREG;r++) {
6818 if((unneeded_reg[i]>>r)&1) {
6819 if(r==HIREG) printf(" HI");
6820 else if(r==LOREG) printf(" LO");
6821 else printf(" r%d",r);
6825 for(r=1;r<=CCREG;r++) {
6826 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
6827 if(r==HIREG) printf(" HI");
6828 else if(r==LOREG) printf(" LO");
6829 else printf(" r%d",r);
6835 for (i=iend;i>=istart;i--)
6837 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
6842 // Identify registers which are likely to contain 32-bit values
6843 // This is used to predict whether any branches will jump to a
6844 // location with 64-bit values in registers.
6845 static void provisional_32bit()
6849 uint64_t lastbranch=1;
6854 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
6855 if(i>1) is32=lastbranch;
6861 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
6863 if(i>2) is32=lastbranch;
6867 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
6869 if(rs1[i-2]==0||rs2[i-2]==0)
6872 is32|=1LL<<rs1[i-2];
6875 is32|=1LL<<rs2[i-2];
6880 // If something jumps here with 64-bit values
6881 // then promote those registers to 64 bits
6884 uint64_t temp_is32=is32;
6887 if(ba[j]==start+i*4)
6888 //temp_is32&=branch_regs[j].is32;
6893 if(ba[j]==start+i*4)
6904 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
6905 // Branches don't write registers, consider the delay slot instead.
6916 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
6917 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
6926 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
6927 if(op==0x22) is32|=1LL<<rt; // LWL
6930 if (op==0x08||op==0x09|| // ADDI/ADDIU
6931 op==0x0a||op==0x0b|| // SLTI/SLTIU
6937 if(op==0x18||op==0x19) { // DADDI/DADDIU
6940 // is32|=((is32>>s1)&1LL)<<rt;
6942 if(op==0x0d||op==0x0e) { // ORI/XORI
6943 uint64_t sr=((is32>>s1)&1LL);
6959 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
6962 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
6965 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
6966 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
6970 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
6975 uint64_t sr=((is32>>s1)&1LL);
6980 uint64_t sr=((is32>>s2)&1LL);
6988 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
6993 uint64_t sr=((is32>>s1)&1LL);
7003 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
7004 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
7007 is32|=(1LL<<HIREG)|(1LL<<LOREG);
7012 uint64_t sr=((is32>>s1)&1LL);
7018 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
7019 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
7023 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
7024 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
7027 if(op2==0) is32|=1LL<<rt; // MFC0
7031 if(op2==0) is32|=1LL<<rt; // MFC1
7032 if(op2==1) is32&=~(1LL<<rt); // DMFC1
7033 if(op2==2) is32|=1LL<<rt; // CFC1
7055 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
7057 if(rt1[i-1]==31) // JAL/JALR
7059 // Subroutine call will return here, don't alloc any registers
7064 // Internal branch will jump here, match registers to caller
7072 // Identify registers which may be assumed to contain 32-bit values
7073 // and where optimizations will rely on this.
7074 // This is used to determine whether backward branches can safely
7075 // jump to a location with 64-bit values in registers.
7076 static void provisional_r32()
7081 for (i=slen-1;i>=0;i--)
7084 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7086 if(ba[i]<start || ba[i]>=(start+slen*4))
7088 // Branch out of this block, don't need anything
7094 // Need whatever matches the target
7095 // (and doesn't get overwritten by the delay slot instruction)
7097 int t=(ba[i]-start)>>2;
7098 if(ba[i]>start+i*4) {
7100 //if(!(requires_32bit[t]&~regs[i].was32))
7101 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7102 if(!(pr32[t]&~regs[i].was32))
7103 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7106 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7107 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7110 // Conditional branch may need registers for following instructions
7111 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7114 //r32|=requires_32bit[i+2];
7117 // Mark this address as a branch target since it may be called
7118 // upon return from interrupt
7122 // Merge in delay slot
7124 // These are overwritten unless the branch is "likely"
7125 // and the delay slot is nullified if not taken
7126 r32&=~(1LL<<rt1[i+1]);
7127 r32&=~(1LL<<rt2[i+1]);
7129 // Assume these are needed (delay slot)
7132 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7136 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7138 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7140 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7142 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7144 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7147 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7149 // SYSCALL instruction (software interrupt)
7152 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7154 // ERET instruction (return from interrupt)
7158 r32&=~(1LL<<rt1[i]);
7159 r32&=~(1LL<<rt2[i]);
7162 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7166 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7168 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7170 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7172 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7174 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7176 //requires_32bit[i]=r32;
7179 // Dirty registers which are 32-bit, require 32-bit input
7180 // as they will be written as 32-bit values
7181 for(hr=0;hr<HOST_REGS;hr++)
7183 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7184 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7185 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7186 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7187 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7194 // Write back dirty registers as soon as we will no longer modify them,
7195 // so that we don't end up with lots of writes at the branches.
7196 void clean_registers(int istart,int iend,int wr)
7200 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7201 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7203 will_dirty_i=will_dirty_next=0;
7204 wont_dirty_i=wont_dirty_next=0;
7206 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7207 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7209 for (i=iend;i>=istart;i--)
7211 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7213 if(ba[i]<start || ba[i]>=(start+slen*4))
7215 // Branch out of this block, flush all regs
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]) will_dirty_i|=1<<r;
7225 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7226 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7227 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7228 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7229 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7230 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7231 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7232 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7233 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7234 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7235 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7236 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7237 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7243 // Conditional branch
7245 wont_dirty_i=wont_dirty_next;
7246 // Merge in delay slot (will dirty)
7247 for(r=0;r<HOST_REGS;r++) {
7248 if(r!=EXCLUDE_REG) {
7250 // Might not dirty if likely branch is not taken
7251 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7252 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7253 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7254 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7255 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7256 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7257 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7258 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7259 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7260 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7261 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7262 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7263 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7264 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7269 // Merge in delay slot (wont dirty)
7270 for(r=0;r<HOST_REGS;r++) {
7271 if(r!=EXCLUDE_REG) {
7272 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7273 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7274 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7275 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7276 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7277 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7278 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7279 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7280 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7281 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7285 #ifndef DESTRUCTIVE_WRITEBACK
7286 branch_regs[i].dirty&=wont_dirty_i;
7288 branch_regs[i].dirty|=will_dirty_i;
7294 if(ba[i]<=start+i*4) {
7296 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7298 // Unconditional branch
7301 // Merge in delay slot (will dirty)
7302 for(r=0;r<HOST_REGS;r++) {
7303 if(r!=EXCLUDE_REG) {
7304 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7305 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7306 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7307 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7308 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7309 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7310 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7311 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7312 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7313 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7314 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7315 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7316 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7317 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7321 // Conditional branch (not taken case)
7322 temp_will_dirty=will_dirty_next;
7323 temp_wont_dirty=wont_dirty_next;
7324 // Merge in delay slot (will dirty)
7325 for(r=0;r<HOST_REGS;r++) {
7326 if(r!=EXCLUDE_REG) {
7328 // Will not dirty if likely branch is not taken
7329 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7330 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7331 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7332 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7333 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7334 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7335 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7336 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7337 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7338 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7339 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7340 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7341 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7342 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7347 // Merge in delay slot (wont dirty)
7348 for(r=0;r<HOST_REGS;r++) {
7349 if(r!=EXCLUDE_REG) {
7350 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7351 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7352 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7353 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7354 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7355 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7356 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7357 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7358 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7359 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7362 // Deal with changed mappings
7364 for(r=0;r<HOST_REGS;r++) {
7365 if(r!=EXCLUDE_REG) {
7366 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7367 temp_will_dirty&=~(1<<r);
7368 temp_wont_dirty&=~(1<<r);
7369 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7370 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7371 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7373 temp_will_dirty|=1<<r;
7374 temp_wont_dirty|=1<<r;
7381 will_dirty[i]=temp_will_dirty;
7382 wont_dirty[i]=temp_wont_dirty;
7383 clean_registers((ba[i]-start)>>2,i-1,0);
7385 // Limit recursion. It can take an excessive amount
7386 // of time if there are a lot of nested loops.
7387 will_dirty[(ba[i]-start)>>2]=0;
7388 wont_dirty[(ba[i]-start)>>2]=-1;
7393 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7395 // Unconditional branch
7398 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7399 for(r=0;r<HOST_REGS;r++) {
7400 if(r!=EXCLUDE_REG) {
7401 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7402 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7403 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7408 // Merge in delay slot
7409 for(r=0;r<HOST_REGS;r++) {
7410 if(r!=EXCLUDE_REG) {
7411 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7412 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7413 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7414 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7415 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7416 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7417 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7418 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7419 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7420 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7421 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7422 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7423 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7424 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7428 // Conditional branch
7429 will_dirty_i=will_dirty_next;
7430 wont_dirty_i=wont_dirty_next;
7431 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7432 for(r=0;r<HOST_REGS;r++) {
7433 if(r!=EXCLUDE_REG) {
7434 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7435 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7436 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7440 will_dirty_i&=~(1<<r);
7442 // Treat delay slot as part of branch too
7443 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7444 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7445 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7449 will_dirty[i+1]&=~(1<<r);
7454 // Merge in delay slot
7455 for(r=0;r<HOST_REGS;r++) {
7456 if(r!=EXCLUDE_REG) {
7458 // Might not dirty if likely branch is not taken
7459 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7460 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7461 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7462 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7463 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7464 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7465 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7466 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7467 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7468 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7469 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7470 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7471 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7472 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7477 // Merge in delay slot
7478 for(r=0;r<HOST_REGS;r++) {
7479 if(r!=EXCLUDE_REG) {
7480 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7481 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7482 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7483 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7484 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7485 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7486 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7487 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7488 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7489 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7493 #ifndef DESTRUCTIVE_WRITEBACK
7494 branch_regs[i].dirty&=wont_dirty_i;
7496 branch_regs[i].dirty|=will_dirty_i;
7501 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7503 // SYSCALL instruction (software interrupt)
7507 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7509 // ERET instruction (return from interrupt)
7513 will_dirty_next=will_dirty_i;
7514 wont_dirty_next=wont_dirty_i;
7515 for(r=0;r<HOST_REGS;r++) {
7516 if(r!=EXCLUDE_REG) {
7517 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7518 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7519 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7520 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7521 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7522 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7523 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7524 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7526 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7528 // Don't store a register immediately after writing it,
7529 // may prevent dual-issue.
7530 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7531 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7537 will_dirty[i]=will_dirty_i;
7538 wont_dirty[i]=wont_dirty_i;
7539 // Mark registers that won't be dirtied as not dirty
7541 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7542 for(r=0;r<HOST_REGS;r++) {
7543 if((will_dirty_i>>r)&1) {
7549 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7550 regs[i].dirty|=will_dirty_i;
7551 #ifndef DESTRUCTIVE_WRITEBACK
7552 regs[i].dirty&=wont_dirty_i;
7553 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7555 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7556 for(r=0;r<HOST_REGS;r++) {
7557 if(r!=EXCLUDE_REG) {
7558 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7559 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7560 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7568 for(r=0;r<HOST_REGS;r++) {
7569 if(r!=EXCLUDE_REG) {
7570 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7571 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7572 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7580 // Deal with changed mappings
7581 temp_will_dirty=will_dirty_i;
7582 temp_wont_dirty=wont_dirty_i;
7583 for(r=0;r<HOST_REGS;r++) {
7584 if(r!=EXCLUDE_REG) {
7586 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7588 #ifndef DESTRUCTIVE_WRITEBACK
7589 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7591 regs[i].wasdirty|=will_dirty_i&(1<<r);
7594 else if((nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7595 // Register moved to a different register
7596 will_dirty_i&=~(1<<r);
7597 wont_dirty_i&=~(1<<r);
7598 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7599 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7601 #ifndef DESTRUCTIVE_WRITEBACK
7602 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7604 regs[i].wasdirty|=will_dirty_i&(1<<r);
7608 will_dirty_i&=~(1<<r);
7609 wont_dirty_i&=~(1<<r);
7610 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7611 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7612 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7615 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7624 void disassemble_inst(int i)
7626 if (bt[i]) printf("*"); else printf(" ");
7629 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7631 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;
7633 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;
7635 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7637 if (opcode[i]==0x9&&rt1[i]!=31)
7638 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7640 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7643 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7645 if(opcode[i]==0xf) //LUI
7646 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7648 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7652 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7656 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7660 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7663 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7666 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7669 if((opcode2[i]&0x1d)==0x10)
7670 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7671 else if((opcode2[i]&0x1d)==0x11)
7672 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7674 printf (" %x: %s\n",start+i*4,insn[i]);
7678 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7679 else if(opcode2[i]==4)
7680 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7681 else printf (" %x: %s\n",start+i*4,insn[i]);
7685 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7686 else if(opcode2[i]>3)
7687 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7688 else printf (" %x: %s\n",start+i*4,insn[i]);
7692 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7693 else if(opcode2[i]>3)
7694 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7695 else printf (" %x: %s\n",start+i*4,insn[i]);
7698 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7701 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7704 printf (" %x: %s (INTCALL)\n",start+i*4,insn[i]);
7707 //printf (" %s %8x\n",insn[i],source[i]);
7708 printf (" %x: %s\n",start+i*4,insn[i]);
7712 void new_dynarec_init()
7714 printf("Init new dynarec\n");
7715 out=(u_char *)BASE_ADDR;
7716 if (mmap (out, 1<<TARGET_SIZE_2,
7717 PROT_READ | PROT_WRITE | PROT_EXEC,
7718 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
7719 -1, 0) <= 0) {printf("mmap() failed\n");}
7721 rdword=&readmem_dword;
7722 fake_pc.f.r.rs=&readmem_dword;
7723 fake_pc.f.r.rt=&readmem_dword;
7724 fake_pc.f.r.rd=&readmem_dword;
7727 for(n=0x80000;n<0x80800;n++)
7729 for(n=0;n<65536;n++)
7730 hash_table[n][0]=hash_table[n][2]=-1;
7731 memset(mini_ht,-1,sizeof(mini_ht));
7732 memset(restore_candidate,0,sizeof(restore_candidate));
7734 expirep=16384; // Expiry pointer, +2 blocks
7735 pending_exception=0;
7738 // Copy this into local area so we don't have to put it in every literal pool
7739 invc_ptr=invalid_code;
7744 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7746 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7747 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7748 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7751 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
7752 writemem[n] = write_nomem_new;
7753 writememb[n] = write_nomemb_new;
7754 writememh[n] = write_nomemh_new;
7756 writememd[n] = write_nomemd_new;
7758 readmem[n] = read_nomem_new;
7759 readmemb[n] = read_nomemb_new;
7760 readmemh[n] = read_nomemh_new;
7762 readmemd[n] = read_nomemd_new;
7765 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
7766 writemem[n] = write_rdram_new;
7767 writememb[n] = write_rdramb_new;
7768 writememh[n] = write_rdramh_new;
7770 writememd[n] = write_rdramd_new;
7773 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
7774 writemem[n] = write_nomem_new;
7775 writememb[n] = write_nomemb_new;
7776 writememh[n] = write_nomemh_new;
7778 writememd[n] = write_nomemd_new;
7780 readmem[n] = read_nomem_new;
7781 readmemb[n] = read_nomemb_new;
7782 readmemh[n] = read_nomemh_new;
7784 readmemd[n] = read_nomemd_new;
7792 void new_dynarec_cleanup()
7795 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {printf("munmap() failed\n");}
7796 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7797 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7798 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7800 if (munmap (ROM_COPY, 67108864) < 0) {printf("munmap() failed\n");}
7804 int new_recompile_block(int addr)
7807 if(addr==0x800cd050) {
7809 for(block=0x80000;block<0x80800;block++) invalidate_block(block);
7811 for(n=0;n<=2048;n++) ll_clear(jump_dirty+n);
7814 //if(Count==365117028) tracedebug=1;
7815 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7816 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7817 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
7819 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
7820 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
7821 /*if(Count>=312978186) {
7825 start = (u_int)addr&~3;
7826 //assert(((u_int)addr&1)==0);
7828 if (Config.HLE && start == 0x80001000) // hlecall
7830 // XXX: is this enough? Maybe check hleSoftCall?
7831 u_int beginning=(u_int)out;
7832 u_int page=get_page(start);
7833 invalid_code[start>>12]=0;
7834 emit_movimm(start,0);
7835 emit_writeword(0,(int)&pcaddr);
7836 emit_jmp((int)new_dyna_leave);
7838 __clear_cache((void *)beginning,out);
7840 ll_add(jump_in+page,start,(void *)beginning);
7843 else if ((u_int)addr < 0x00200000 ||
7844 (0xa0000000 <= addr && addr < 0xa0200000)) {
7845 // used for BIOS calls mostly?
7846 source = (u_int *)((u_int)rdram+(start&0x1fffff));
7847 pagelimit = (addr&0xa0000000)|0x00200000;
7849 else if (!Config.HLE && (
7850 /* (0x9fc00000 <= addr && addr < 0x9fc80000) ||*/
7851 (0xbfc00000 <= addr && addr < 0xbfc80000))) {
7853 source = (u_int *)((u_int)psxR+(start&0x7ffff));
7854 pagelimit = (addr&0xfff00000)|0x80000;
7859 if ((int)addr >= 0xa4000000 && (int)addr < 0xa4001000) {
7860 source = (u_int *)((u_int)SP_DMEM+start-0xa4000000);
7861 pagelimit = 0xa4001000;
7865 if ((int)addr >= 0x80000000 && (int)addr < 0x80000000+RAM_SIZE) {
7866 source = (u_int *)((u_int)rdram+start-0x80000000);
7867 pagelimit = 0x80000000+RAM_SIZE;
7870 else if ((signed int)addr >= (signed int)0xC0000000) {
7871 //printf("addr=%x mm=%x\n",(u_int)addr,(memory_map[start>>12]<<2));
7872 //if(tlb_LUT_r[start>>12])
7873 //source = (u_int *)(((int)rdram)+(tlb_LUT_r[start>>12]&0xFFFFF000)+(((int)addr)&0xFFF)-0x80000000);
7874 if((signed int)memory_map[start>>12]>=0) {
7875 source = (u_int *)((u_int)(start+(memory_map[start>>12]<<2)));
7876 pagelimit=(start+4096)&0xFFFFF000;
7877 int map=memory_map[start>>12];
7880 //printf("start: %x next: %x\n",map,memory_map[pagelimit>>12]);
7881 if((map&0xBFFFFFFF)==(memory_map[pagelimit>>12]&0xBFFFFFFF)) pagelimit+=4096;
7883 assem_debug("pagelimit=%x\n",pagelimit);
7884 assem_debug("mapping=%x (%x)\n",memory_map[start>>12],(memory_map[start>>12]<<2)+start);
7887 assem_debug("Compile at unmapped memory address: %x \n", (int)addr);
7888 //assem_debug("start: %x next: %x\n",memory_map[start>>12],memory_map[(start+4096)>>12]);
7889 return -1; // Caller will invoke exception handler
7891 //printf("source= %x\n",(int)source);
7895 printf("Compile at bogus memory address: %x \n", (int)addr);
7899 /* Pass 1: disassemble */
7900 /* Pass 2: register dependencies, branch targets */
7901 /* Pass 3: register allocation */
7902 /* Pass 4: branch dependencies */
7903 /* Pass 5: pre-alloc */
7904 /* Pass 6: optimize clean/dirty state */
7905 /* Pass 7: flag 32-bit registers */
7906 /* Pass 8: assembly */
7907 /* Pass 9: linker */
7908 /* Pass 10: garbage collection / free memory */
7912 unsigned int type,op,op2;
7914 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
7916 /* Pass 1 disassembly */
7918 for(i=0;!done;i++) {
7919 bt[i]=0;likely[i]=0;ooo[i]=0;op2=0;
7920 minimum_free_regs[i]=0;
7921 opcode[i]=op=source[i]>>26;
7924 case 0x00: strcpy(insn[i],"special"); type=NI;
7928 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
7929 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
7930 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
7931 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
7932 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
7933 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
7934 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
7935 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
7936 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
7937 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
7938 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
7939 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
7940 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
7941 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
7942 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
7943 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
7944 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
7945 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
7946 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
7947 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
7948 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
7949 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
7950 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
7951 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
7952 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
7953 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
7954 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
7955 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
7956 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
7957 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
7958 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
7959 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
7960 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
7961 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
7962 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
7963 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
7964 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
7965 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
7966 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
7967 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
7968 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
7969 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
7970 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
7971 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
7972 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
7973 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
7974 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
7975 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
7976 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
7977 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
7978 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
7979 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
7982 case 0x01: strcpy(insn[i],"regimm"); type=NI;
7983 op2=(source[i]>>16)&0x1f;
7986 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
7987 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
7988 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
7989 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
7990 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
7991 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
7992 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
7993 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
7994 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
7995 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
7996 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
7997 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
7998 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
7999 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
8002 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
8003 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
8004 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
8005 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
8006 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
8007 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
8008 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
8009 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
8010 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
8011 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
8012 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
8013 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
8014 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
8015 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
8016 case 0x10: strcpy(insn[i],"cop0"); type=NI;
8017 op2=(source[i]>>21)&0x1f;
8020 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
8021 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
8022 case 0x10: strcpy(insn[i],"tlb"); type=NI;
8023 switch(source[i]&0x3f)
8025 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
8026 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
8027 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
8028 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
8030 case 0x10: strcpy(insn[i],"RFE"); type=COP0; break;
8032 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
8037 case 0x11: strcpy(insn[i],"cop1"); type=NI;
8038 op2=(source[i]>>21)&0x1f;
8041 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
8042 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
8043 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
8044 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
8045 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
8046 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
8047 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
8048 switch((source[i]>>16)&0x3)
8050 case 0x00: strcpy(insn[i],"BC1F"); break;
8051 case 0x01: strcpy(insn[i],"BC1T"); break;
8052 case 0x02: strcpy(insn[i],"BC1FL"); break;
8053 case 0x03: strcpy(insn[i],"BC1TL"); break;
8056 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
8057 switch(source[i]&0x3f)
8059 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
8060 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
8061 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
8062 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
8063 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
8064 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
8065 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
8066 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
8067 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
8068 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
8069 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
8070 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
8071 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
8072 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
8073 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
8074 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
8075 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
8076 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
8077 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
8078 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
8079 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
8080 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
8081 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
8082 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
8083 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
8084 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
8085 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
8086 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
8087 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
8088 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
8089 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
8090 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
8091 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
8092 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
8093 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
8096 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8097 switch(source[i]&0x3f)
8099 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8100 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8101 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8102 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8103 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8104 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8105 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8106 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8107 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8108 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8109 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8110 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8111 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8112 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8113 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8114 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8115 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8116 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8117 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8118 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8119 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8120 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8121 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8122 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8123 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8124 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8125 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8126 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8127 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8128 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8129 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8130 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8131 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8132 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8133 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8136 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8137 switch(source[i]&0x3f)
8139 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8140 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8143 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8144 switch(source[i]&0x3f)
8146 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8147 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8153 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8154 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8155 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8156 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8157 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8158 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8159 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8160 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8162 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8163 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8164 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8165 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8166 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8167 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8168 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8169 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8170 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8171 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8172 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8173 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8175 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8176 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8178 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8179 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8180 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8181 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8183 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8184 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8185 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8187 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8188 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8190 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8191 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8192 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8195 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8196 // note: COP MIPS-1 encoding differs from MIPS32
8197 op2=(source[i]>>21)&0x1f;
8198 if (source[i]&0x3f) {
8199 if (gte_handlers[source[i]&0x3f]!=NULL) {
8200 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8206 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8207 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8208 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8209 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8212 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8213 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8214 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8216 default: strcpy(insn[i],"???"); type=NI;
8217 printf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8221 /* detect branch in delay slot early */
8222 if(type==RJUMP||type==UJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
8223 opcode[i+1]=source[i+1]>>26;
8224 opcode2[i+1]=source[i+1]&0x3f;
8225 if((0<opcode[i+1]&&opcode[i+1]<8)||(opcode[i+1]==0&&(opcode2[i+1]==8||opcode2[i+1]==9))) {
8226 printf("branch in delay slot @%08x (%08x)\n", addr + i*4+4, addr);
8227 // don't handle first branch and call interpreter if it's hit
8234 /* Get registers/immediates */
8242 rs1[i]=(source[i]>>21)&0x1f;
8244 rt1[i]=(source[i]>>16)&0x1f;
8246 imm[i]=(short)source[i];
8250 rs1[i]=(source[i]>>21)&0x1f;
8251 rs2[i]=(source[i]>>16)&0x1f;
8254 imm[i]=(short)source[i];
8255 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8258 // LWL/LWR only load part of the register,
8259 // therefore the target register must be treated as a source too
8260 rs1[i]=(source[i]>>21)&0x1f;
8261 rs2[i]=(source[i]>>16)&0x1f;
8262 rt1[i]=(source[i]>>16)&0x1f;
8264 imm[i]=(short)source[i];
8265 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8266 if(op==0x26) dep1[i]=rt1[i]; // LWR
8269 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8270 else rs1[i]=(source[i]>>21)&0x1f;
8272 rt1[i]=(source[i]>>16)&0x1f;
8274 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8275 imm[i]=(unsigned short)source[i];
8277 imm[i]=(short)source[i];
8279 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8280 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8281 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8288 // The JAL instruction writes to r31.
8295 rs1[i]=(source[i]>>21)&0x1f;
8299 // The JALR instruction writes to rd.
8301 rt1[i]=(source[i]>>11)&0x1f;
8306 rs1[i]=(source[i]>>21)&0x1f;
8307 rs2[i]=(source[i]>>16)&0x1f;
8310 if(op&2) { // BGTZ/BLEZ
8318 rs1[i]=(source[i]>>21)&0x1f;
8323 if(op2&0x10) { // BxxAL
8325 // NOTE: If the branch is not taken, r31 is still overwritten
8327 likely[i]=(op2&2)>>1;
8334 likely[i]=((source[i])>>17)&1;
8337 rs1[i]=(source[i]>>21)&0x1f; // source
8338 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8339 rt1[i]=(source[i]>>11)&0x1f; // destination
8341 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8342 us1[i]=rs1[i];us2[i]=rs2[i];
8344 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8345 dep1[i]=rs1[i];dep2[i]=rs2[i];
8347 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8348 dep1[i]=rs1[i];dep2[i]=rs2[i];
8352 rs1[i]=(source[i]>>21)&0x1f; // source
8353 rs2[i]=(source[i]>>16)&0x1f; // divisor
8356 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8357 us1[i]=rs1[i];us2[i]=rs2[i];
8365 if(op2==0x10) rs1[i]=HIREG; // MFHI
8366 if(op2==0x11) rt1[i]=HIREG; // MTHI
8367 if(op2==0x12) rs1[i]=LOREG; // MFLO
8368 if(op2==0x13) rt1[i]=LOREG; // MTLO
8369 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8370 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8374 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8375 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8376 rt1[i]=(source[i]>>11)&0x1f; // destination
8378 // DSLLV/DSRLV/DSRAV are 64-bit
8379 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8382 rs1[i]=(source[i]>>16)&0x1f;
8384 rt1[i]=(source[i]>>11)&0x1f;
8386 imm[i]=(source[i]>>6)&0x1f;
8387 // DSxx32 instructions
8388 if(op2>=0x3c) imm[i]|=0x20;
8389 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8390 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8397 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8398 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8399 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8400 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8408 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8409 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8410 if(op2==5) us1[i]=rs1[i]; // DMTC1
8414 rs1[i]=(source[i]>>21)&0x1F;
8418 imm[i]=(short)source[i];
8421 rs1[i]=(source[i]>>21)&0x1F;
8425 imm[i]=(short)source[i];
8454 /* Calculate branch target addresses */
8456 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8457 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8458 ba[i]=start+i*4+8; // Ignore never taken branch
8459 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8460 ba[i]=start+i*4+8; // Ignore never taken branch
8461 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8462 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8464 /* Is this the end of the block? */
8465 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8467 // check for link register access in delay slot
8469 if(rt1_!=0&&(rs1[i]==rt1_||rs2[i]==rt1_||rt1[i]==rt1_||rt2[i]==rt1_)) {
8470 printf("link access in delay slot @%08x (%08x)\n", addr + i*4, addr);
8477 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8481 if(stop_after_jal) done=1;
8483 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8485 // Don't recompile stuff that's already compiled
8486 if(check_addr(start+i*4+4)) done=1;
8487 // Don't get too close to the limit
8488 if(i>MAXBLOCK/2) done=1;
8490 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8491 if(itype[i]==HLECALL||itype[i]==INTCALL) done=2;
8493 // Does the block continue due to a branch?
8496 if(ba[j]==start+i*4+4) done=j=0;
8497 if(ba[j]==start+i*4+8) done=j=0;
8500 //assert(i<MAXBLOCK-1);
8501 if(start+i*4==pagelimit-4) done=1;
8502 assert(start+i*4<pagelimit);
8503 if (i==MAXBLOCK-1) done=1;
8504 // Stop if we're compiling junk
8505 if(itype[i]==NI&&opcode[i]==0x11) {
8506 done=stop_after_jal=1;
8507 printf("Disabled speculative precompilation\n");
8511 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8512 if(start+i*4==pagelimit) {
8518 /* Pass 2 - Register dependencies and branch targets */
8520 unneeded_registers(0,slen-1,0);
8522 /* Pass 3 - Register allocation */
8524 struct regstat current; // Current register allocations/status
8527 current.u=unneeded_reg[0];
8528 current.uu=unneeded_reg_upper[0];
8529 clear_all_regs(current.regmap);
8530 alloc_reg(¤t,0,CCREG);
8531 dirty_reg(¤t,CCREG);
8539 provisional_32bit();
8542 // First instruction is delay slot
8547 unneeded_reg_upper[0]=1;
8548 current.regmap[HOST_BTREG]=BTREG;
8556 for(hr=0;hr<HOST_REGS;hr++)
8558 // Is this really necessary?
8559 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8565 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8567 if(rs1[i-2]==0||rs2[i-2]==0)
8570 current.is32|=1LL<<rs1[i-2];
8571 int hr=get_reg(current.regmap,rs1[i-2]|64);
8572 if(hr>=0) current.regmap[hr]=-1;
8575 current.is32|=1LL<<rs2[i-2];
8576 int hr=get_reg(current.regmap,rs2[i-2]|64);
8577 if(hr>=0) current.regmap[hr]=-1;
8583 // If something jumps here with 64-bit values
8584 // then promote those registers to 64 bits
8587 uint64_t temp_is32=current.is32;
8590 if(ba[j]==start+i*4)
8591 temp_is32&=branch_regs[j].is32;
8595 if(ba[j]==start+i*4)
8599 if(temp_is32!=current.is32) {
8600 //printf("dumping 32-bit regs (%x)\n",start+i*4);
8601 #ifdef DESTRUCTIVE_WRITEBACK
8602 for(hr=0;hr<HOST_REGS;hr++)
8604 int r=current.regmap[hr];
8607 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
8609 //printf("restore %d\n",r);
8614 current.is32=temp_is32;
8621 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
8622 regs[i].wasconst=current.isconst;
8623 regs[i].was32=current.is32;
8624 regs[i].wasdirty=current.dirty;
8625 #if defined(DESTRUCTIVE_WRITEBACK) && !defined(FORCE32)
8626 // To change a dirty register from 32 to 64 bits, we must write
8627 // it out during the previous cycle (for branches, 2 cycles)
8628 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)
8630 uint64_t temp_is32=current.is32;
8633 if(ba[j]==start+i*4+4)
8634 temp_is32&=branch_regs[j].is32;
8638 if(ba[j]==start+i*4+4)
8642 if(temp_is32!=current.is32) {
8643 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8644 for(hr=0;hr<HOST_REGS;hr++)
8646 int r=current.regmap[hr];
8649 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8650 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
8652 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
8654 //printf("dump %d/r%d\n",hr,r);
8655 current.regmap[hr]=-1;
8656 if(get_reg(current.regmap,r|64)>=0)
8657 current.regmap[get_reg(current.regmap,r|64)]=-1;
8665 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
8667 uint64_t temp_is32=current.is32;
8670 if(ba[j]==start+i*4+8)
8671 temp_is32&=branch_regs[j].is32;
8675 if(ba[j]==start+i*4+8)
8679 if(temp_is32!=current.is32) {
8680 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8681 for(hr=0;hr<HOST_REGS;hr++)
8683 int r=current.regmap[hr];
8686 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8687 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
8689 //printf("dump %d/r%d\n",hr,r);
8690 current.regmap[hr]=-1;
8691 if(get_reg(current.regmap,r|64)>=0)
8692 current.regmap[get_reg(current.regmap,r|64)]=-1;
8700 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8702 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
8703 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
8704 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8713 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
8714 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8715 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8716 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8717 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8720 } else { printf("oops, branch at end of block with no delay slot\n");exit(1); }
8724 ds=0; // Skip delay slot, already allocated as part of branch
8725 // ...but we need to alloc it in case something jumps here
8727 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
8728 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
8730 current.u=branch_unneeded_reg[i-1];
8731 current.uu=branch_unneeded_reg_upper[i-1];
8733 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8734 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8735 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8738 struct regstat temp;
8739 memcpy(&temp,¤t,sizeof(current));
8740 temp.wasdirty=temp.dirty;
8741 temp.was32=temp.is32;
8742 // TODO: Take into account unconditional branches, as below
8743 delayslot_alloc(&temp,i);
8744 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
8745 regs[i].wasdirty=temp.wasdirty;
8746 regs[i].was32=temp.was32;
8747 regs[i].dirty=temp.dirty;
8748 regs[i].is32=temp.is32;
8752 // Create entry (branch target) regmap
8753 for(hr=0;hr<HOST_REGS;hr++)
8755 int r=temp.regmap[hr];
8757 if(r!=regmap_pre[i][hr]) {
8758 regs[i].regmap_entry[hr]=-1;
8763 if((current.u>>r)&1) {
8764 regs[i].regmap_entry[hr]=-1;
8765 regs[i].regmap[hr]=-1;
8766 //Don't clear regs in the delay slot as the branch might need them
8767 //current.regmap[hr]=-1;
8769 regs[i].regmap_entry[hr]=r;
8772 if((current.uu>>(r&63))&1) {
8773 regs[i].regmap_entry[hr]=-1;
8774 regs[i].regmap[hr]=-1;
8775 //Don't clear regs in the delay slot as the branch might need them
8776 //current.regmap[hr]=-1;
8778 regs[i].regmap_entry[hr]=r;
8782 // First instruction expects CCREG to be allocated
8783 if(i==0&&hr==HOST_CCREG)
8784 regs[i].regmap_entry[hr]=CCREG;
8786 regs[i].regmap_entry[hr]=-1;
8790 else { // Not delay slot
8793 //current.isconst=0; // DEBUG
8794 //current.wasconst=0; // DEBUG
8795 //regs[i].wasconst=0; // DEBUG
8796 clear_const(¤t,rt1[i]);
8797 alloc_cc(¤t,i);
8798 dirty_reg(¤t,CCREG);
8800 alloc_reg(¤t,i,31);
8801 dirty_reg(¤t,31);
8802 assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8803 assert(rt1[i+1]!=rt1[i]);
8805 alloc_reg(¤t,i,PTEMP);
8807 //current.is32|=1LL<<rt1[i];
8810 delayslot_alloc(¤t,i+1);
8811 //current.isconst=0; // DEBUG
8813 //printf("i=%d, isconst=%x\n",i,current.isconst);
8816 //current.isconst=0;
8817 //current.wasconst=0;
8818 //regs[i].wasconst=0;
8819 clear_const(¤t,rs1[i]);
8820 clear_const(¤t,rt1[i]);
8821 alloc_cc(¤t,i);
8822 dirty_reg(¤t,CCREG);
8823 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
8824 alloc_reg(¤t,i,rs1[i]);
8826 alloc_reg(¤t,i,rt1[i]);
8827 dirty_reg(¤t,rt1[i]);
8828 assert(rs1[i+1]!=rt1[i]&&rs2[i+1]!=rt1[i]);
8829 assert(rt1[i+1]!=rt1[i]);
8831 alloc_reg(¤t,i,PTEMP);
8835 if(rs1[i]==31) { // JALR
8836 alloc_reg(¤t,i,RHASH);
8837 #ifndef HOST_IMM_ADDR32
8838 alloc_reg(¤t,i,RHTBL);
8842 delayslot_alloc(¤t,i+1);
8844 // The delay slot overwrites our source register,
8845 // allocate a temporary register to hold the old value.
8849 delayslot_alloc(¤t,i+1);
8851 alloc_reg(¤t,i,RTEMP);
8853 //current.isconst=0; // DEBUG
8858 //current.isconst=0;
8859 //current.wasconst=0;
8860 //regs[i].wasconst=0;
8861 clear_const(¤t,rs1[i]);
8862 clear_const(¤t,rs2[i]);
8863 if((opcode[i]&0x3E)==4) // BEQ/BNE
8865 alloc_cc(¤t,i);
8866 dirty_reg(¤t,CCREG);
8867 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8868 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8869 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8871 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8872 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8874 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
8875 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
8876 // The delay slot overwrites one of our conditions.
8877 // Allocate the branch condition registers instead.
8881 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8882 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8883 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8885 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8886 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8892 delayslot_alloc(¤t,i+1);
8896 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
8898 alloc_cc(¤t,i);
8899 dirty_reg(¤t,CCREG);
8900 alloc_reg(¤t,i,rs1[i]);
8901 if(!(current.is32>>rs1[i]&1))
8903 alloc_reg64(¤t,i,rs1[i]);
8905 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
8906 // The delay slot overwrites one of our conditions.
8907 // Allocate the branch condition registers instead.
8911 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8912 if(!((current.is32>>rs1[i])&1))
8914 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8920 delayslot_alloc(¤t,i+1);
8924 // Don't alloc the delay slot yet because we might not execute it
8925 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
8930 alloc_cc(¤t,i);
8931 dirty_reg(¤t,CCREG);
8932 alloc_reg(¤t,i,rs1[i]);
8933 alloc_reg(¤t,i,rs2[i]);
8934 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8936 alloc_reg64(¤t,i,rs1[i]);
8937 alloc_reg64(¤t,i,rs2[i]);
8941 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
8946 alloc_cc(¤t,i);
8947 dirty_reg(¤t,CCREG);
8948 alloc_reg(¤t,i,rs1[i]);
8949 if(!(current.is32>>rs1[i]&1))
8951 alloc_reg64(¤t,i,rs1[i]);
8955 //current.isconst=0;
8958 //current.isconst=0;
8959 //current.wasconst=0;
8960 //regs[i].wasconst=0;
8961 clear_const(¤t,rs1[i]);
8962 clear_const(¤t,rt1[i]);
8963 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
8964 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
8966 alloc_cc(¤t,i);
8967 dirty_reg(¤t,CCREG);
8968 alloc_reg(¤t,i,rs1[i]);
8969 if(!(current.is32>>rs1[i]&1))
8971 alloc_reg64(¤t,i,rs1[i]);
8973 if (rt1[i]==31) { // BLTZAL/BGEZAL
8974 alloc_reg(¤t,i,31);
8975 dirty_reg(¤t,31);
8976 //#ifdef REG_PREFETCH
8977 //alloc_reg(¤t,i,PTEMP);
8979 //current.is32|=1LL<<rt1[i];
8981 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) // The delay slot overwrites the branch condition.
8982 ||(rt1[i]==31&&(rs1[i+1]==31||rs2[i+1]==31||rt1[i+1]==31||rt2[i+1]==31))) { // DS touches $ra
8983 // Allocate the branch condition registers instead.
8987 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8988 if(!((current.is32>>rs1[i])&1))
8990 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8996 delayslot_alloc(¤t,i+1);
9000 // Don't alloc the delay slot yet because we might not execute it
9001 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
9006 alloc_cc(¤t,i);
9007 dirty_reg(¤t,CCREG);
9008 alloc_reg(¤t,i,rs1[i]);
9009 if(!(current.is32>>rs1[i]&1))
9011 alloc_reg64(¤t,i,rs1[i]);
9015 //current.isconst=0;
9021 if(likely[i]==0) // BC1F/BC1T
9023 // TODO: Theoretically we can run out of registers here on x86.
9024 // The delay slot can allocate up to six, and we need to check
9025 // CSREG before executing the delay slot. Possibly we can drop
9026 // the cycle count and then reload it after checking that the
9027 // FPU is in a usable state, or don't do out-of-order execution.
9028 alloc_cc(¤t,i);
9029 dirty_reg(¤t,CCREG);
9030 alloc_reg(¤t,i,FSREG);
9031 alloc_reg(¤t,i,CSREG);
9032 if(itype[i+1]==FCOMP) {
9033 // The delay slot overwrites the branch condition.
9034 // Allocate the branch condition registers instead.
9035 alloc_cc(¤t,i);
9036 dirty_reg(¤t,CCREG);
9037 alloc_reg(¤t,i,CSREG);
9038 alloc_reg(¤t,i,FSREG);
9042 delayslot_alloc(¤t,i+1);
9043 alloc_reg(¤t,i+1,CSREG);
9047 // Don't alloc the delay slot yet because we might not execute it
9048 if(likely[i]) // BC1FL/BC1TL
9050 alloc_cc(¤t,i);
9051 dirty_reg(¤t,CCREG);
9052 alloc_reg(¤t,i,CSREG);
9053 alloc_reg(¤t,i,FSREG);
9059 imm16_alloc(¤t,i);
9063 load_alloc(¤t,i);
9067 store_alloc(¤t,i);
9070 alu_alloc(¤t,i);
9073 shift_alloc(¤t,i);
9076 multdiv_alloc(¤t,i);
9079 shiftimm_alloc(¤t,i);
9082 mov_alloc(¤t,i);
9085 cop0_alloc(¤t,i);
9089 cop1_alloc(¤t,i);
9092 c1ls_alloc(¤t,i);
9095 c2ls_alloc(¤t,i);
9098 c2op_alloc(¤t,i);
9101 fconv_alloc(¤t,i);
9104 float_alloc(¤t,i);
9107 fcomp_alloc(¤t,i);
9112 syscall_alloc(¤t,i);
9115 pagespan_alloc(¤t,i);
9119 // Drop the upper half of registers that have become 32-bit
9120 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
9121 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9122 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9123 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9126 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
9127 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9128 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9129 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9133 // Create entry (branch target) regmap
9134 for(hr=0;hr<HOST_REGS;hr++)
9137 r=current.regmap[hr];
9139 if(r!=regmap_pre[i][hr]) {
9140 // TODO: delay slot (?)
9141 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9142 if(or<0||(r&63)>=TEMPREG){
9143 regs[i].regmap_entry[hr]=-1;
9147 // Just move it to a different register
9148 regs[i].regmap_entry[hr]=r;
9149 // If it was dirty before, it's still dirty
9150 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9157 regs[i].regmap_entry[hr]=0;
9161 if((current.u>>r)&1) {
9162 regs[i].regmap_entry[hr]=-1;
9163 //regs[i].regmap[hr]=-1;
9164 current.regmap[hr]=-1;
9166 regs[i].regmap_entry[hr]=r;
9169 if((current.uu>>(r&63))&1) {
9170 regs[i].regmap_entry[hr]=-1;
9171 //regs[i].regmap[hr]=-1;
9172 current.regmap[hr]=-1;
9174 regs[i].regmap_entry[hr]=r;
9178 // Branches expect CCREG to be allocated at the target
9179 if(regmap_pre[i][hr]==CCREG)
9180 regs[i].regmap_entry[hr]=CCREG;
9182 regs[i].regmap_entry[hr]=-1;
9185 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9187 /* Branch post-alloc */
9190 current.was32=current.is32;
9191 current.wasdirty=current.dirty;
9192 switch(itype[i-1]) {
9194 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9195 branch_regs[i-1].isconst=0;
9196 branch_regs[i-1].wasconst=0;
9197 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9198 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9199 alloc_cc(&branch_regs[i-1],i-1);
9200 dirty_reg(&branch_regs[i-1],CCREG);
9201 if(rt1[i-1]==31) { // JAL
9202 alloc_reg(&branch_regs[i-1],i-1,31);
9203 dirty_reg(&branch_regs[i-1],31);
9204 branch_regs[i-1].is32|=1LL<<31;
9206 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9207 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9210 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9211 branch_regs[i-1].isconst=0;
9212 branch_regs[i-1].wasconst=0;
9213 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9214 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9215 alloc_cc(&branch_regs[i-1],i-1);
9216 dirty_reg(&branch_regs[i-1],CCREG);
9217 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9218 if(rt1[i-1]!=0) { // JALR
9219 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9220 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9221 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9224 if(rs1[i-1]==31) { // JALR
9225 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9226 #ifndef HOST_IMM_ADDR32
9227 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9231 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9232 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9235 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9237 alloc_cc(¤t,i-1);
9238 dirty_reg(¤t,CCREG);
9239 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9240 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9241 // The delay slot overwrote one of our conditions
9242 // Delay slot goes after the test (in order)
9243 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9244 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9245 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9248 delayslot_alloc(¤t,i);
9253 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9254 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9255 // Alloc the branch condition registers
9256 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9257 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9258 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9260 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9261 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9264 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9265 branch_regs[i-1].isconst=0;
9266 branch_regs[i-1].wasconst=0;
9267 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9268 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9271 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9273 alloc_cc(¤t,i-1);
9274 dirty_reg(¤t,CCREG);
9275 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9276 // The delay slot overwrote the branch condition
9277 // Delay slot goes after the test (in order)
9278 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9279 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9280 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9283 delayslot_alloc(¤t,i);
9288 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9289 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9290 // Alloc the branch condition register
9291 alloc_reg(¤t,i-1,rs1[i-1]);
9292 if(!(current.is32>>rs1[i-1]&1))
9294 alloc_reg64(¤t,i-1,rs1[i-1]);
9297 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9298 branch_regs[i-1].isconst=0;
9299 branch_regs[i-1].wasconst=0;
9300 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9301 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9304 // Alloc the delay slot in case the branch is taken
9305 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9307 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9308 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9309 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9310 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9311 alloc_cc(&branch_regs[i-1],i);
9312 dirty_reg(&branch_regs[i-1],CCREG);
9313 delayslot_alloc(&branch_regs[i-1],i);
9314 branch_regs[i-1].isconst=0;
9315 alloc_reg(¤t,i,CCREG); // Not taken path
9316 dirty_reg(¤t,CCREG);
9317 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9320 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9322 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9323 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9324 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9325 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9326 alloc_cc(&branch_regs[i-1],i);
9327 dirty_reg(&branch_regs[i-1],CCREG);
9328 delayslot_alloc(&branch_regs[i-1],i);
9329 branch_regs[i-1].isconst=0;
9330 alloc_reg(¤t,i,CCREG); // Not taken path
9331 dirty_reg(¤t,CCREG);
9332 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9336 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9337 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9339 alloc_cc(¤t,i-1);
9340 dirty_reg(¤t,CCREG);
9341 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9342 // The delay slot overwrote the branch condition
9343 // Delay slot goes after the test (in order)
9344 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9345 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9346 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9349 delayslot_alloc(¤t,i);
9354 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9355 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9356 // Alloc the branch condition register
9357 alloc_reg(¤t,i-1,rs1[i-1]);
9358 if(!(current.is32>>rs1[i-1]&1))
9360 alloc_reg64(¤t,i-1,rs1[i-1]);
9363 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9364 branch_regs[i-1].isconst=0;
9365 branch_regs[i-1].wasconst=0;
9366 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9367 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9370 // Alloc the delay slot in case the branch is taken
9371 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9373 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9374 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9375 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9376 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9377 alloc_cc(&branch_regs[i-1],i);
9378 dirty_reg(&branch_regs[i-1],CCREG);
9379 delayslot_alloc(&branch_regs[i-1],i);
9380 branch_regs[i-1].isconst=0;
9381 alloc_reg(¤t,i,CCREG); // Not taken path
9382 dirty_reg(¤t,CCREG);
9383 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9385 // FIXME: BLTZAL/BGEZAL
9386 if(opcode2[i-1]&0x10) { // BxxZAL
9387 alloc_reg(&branch_regs[i-1],i-1,31);
9388 dirty_reg(&branch_regs[i-1],31);
9389 branch_regs[i-1].is32|=1LL<<31;
9393 if(likely[i-1]==0) // BC1F/BC1T
9395 alloc_cc(¤t,i-1);
9396 dirty_reg(¤t,CCREG);
9397 if(itype[i]==FCOMP) {
9398 // The delay slot overwrote the branch condition
9399 // Delay slot goes after the test (in order)
9400 delayslot_alloc(¤t,i);
9405 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9406 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9407 // Alloc the branch condition register
9408 alloc_reg(¤t,i-1,FSREG);
9410 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9411 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9415 // Alloc the delay slot in case the branch is taken
9416 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9417 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9418 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9419 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9420 alloc_cc(&branch_regs[i-1],i);
9421 dirty_reg(&branch_regs[i-1],CCREG);
9422 delayslot_alloc(&branch_regs[i-1],i);
9423 branch_regs[i-1].isconst=0;
9424 alloc_reg(¤t,i,CCREG); // Not taken path
9425 dirty_reg(¤t,CCREG);
9426 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9431 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9433 if(rt1[i-1]==31) // JAL/JALR
9435 // Subroutine call will return here, don't alloc any registers
9438 clear_all_regs(current.regmap);
9439 alloc_reg(¤t,i,CCREG);
9440 dirty_reg(¤t,CCREG);
9444 // Internal branch will jump here, match registers to caller
9445 current.is32=0x3FFFFFFFFLL;
9447 clear_all_regs(current.regmap);
9448 alloc_reg(¤t,i,CCREG);
9449 dirty_reg(¤t,CCREG);
9452 if(ba[j]==start+i*4+4) {
9453 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9454 current.is32=branch_regs[j].is32;
9455 current.dirty=branch_regs[j].dirty;
9460 if(ba[j]==start+i*4+4) {
9461 for(hr=0;hr<HOST_REGS;hr++) {
9462 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9463 current.regmap[hr]=-1;
9465 current.is32&=branch_regs[j].is32;
9466 current.dirty&=branch_regs[j].dirty;
9475 // Count cycles in between branches
9477 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))
9482 else if(/*itype[i]==LOAD||*/itype[i]==STORE||itype[i]==C1LS) // load causes weird timing issues
9484 cc+=2; // 2 cycle penalty (after CLOCK_DIVIDER)
9486 else if(itype[i]==C2LS)
9496 flush_dirty_uppers(¤t);
9498 regs[i].is32=current.is32;
9499 regs[i].dirty=current.dirty;
9500 regs[i].isconst=current.isconst;
9501 memcpy(constmap[i],current.constmap,sizeof(current.constmap));
9503 for(hr=0;hr<HOST_REGS;hr++) {
9504 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9505 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9506 regs[i].wasconst&=~(1<<hr);
9510 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9513 /* Pass 4 - Cull unused host registers */
9517 for (i=slen-1;i>=0;i--)
9520 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9522 if(ba[i]<start || ba[i]>=(start+slen*4))
9524 // Branch out of this block, don't need anything
9530 // Need whatever matches the target
9532 int t=(ba[i]-start)>>2;
9533 for(hr=0;hr<HOST_REGS;hr++)
9535 if(regs[i].regmap_entry[hr]>=0) {
9536 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9540 // Conditional branch may need registers for following instructions
9541 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9544 nr|=needed_reg[i+2];
9545 for(hr=0;hr<HOST_REGS;hr++)
9547 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9548 //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]);
9552 // Don't need stuff which is overwritten
9553 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9554 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9555 // Merge in delay slot
9556 for(hr=0;hr<HOST_REGS;hr++)
9559 // These are overwritten unless the branch is "likely"
9560 // and the delay slot is nullified if not taken
9561 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9562 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9564 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9565 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9566 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9567 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9568 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9569 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9570 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9571 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9572 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
9573 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9574 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9576 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
9577 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9578 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9580 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
9581 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9582 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9586 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
9588 // SYSCALL instruction (software interrupt)
9591 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
9593 // ERET instruction (return from interrupt)
9599 for(hr=0;hr<HOST_REGS;hr++) {
9600 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
9601 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
9602 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9603 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9607 for(hr=0;hr<HOST_REGS;hr++)
9609 // Overwritten registers are not needed
9610 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9611 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9612 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9613 // Source registers are needed
9614 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9615 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9616 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
9617 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
9618 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9619 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9620 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9621 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9622 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
9623 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9624 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9626 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
9627 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9628 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9630 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
9631 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9632 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9634 // Don't store a register immediately after writing it,
9635 // may prevent dual-issue.
9636 // But do so if this is a branch target, otherwise we
9637 // might have to load the register before the branch.
9638 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
9639 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
9640 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
9641 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9642 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9644 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
9645 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
9646 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9647 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9651 // Cycle count is needed at branches. Assume it is needed at the target too.
9652 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
9653 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9654 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9659 // Deallocate unneeded registers
9660 for(hr=0;hr<HOST_REGS;hr++)
9663 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
9664 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9665 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9666 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
9668 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9671 regs[i].regmap[hr]=-1;
9672 regs[i].isconst&=~(1<<hr);
9673 if(i<slen-2) regmap_pre[i+2][hr]=-1;
9677 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9679 int d1=0,d2=0,map=0,temp=0;
9680 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
9686 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
9687 itype[i+1]==STORE || itype[i+1]==STORELR ||
9688 itype[i+1]==C1LS || itype[i+1]==C2LS)
9691 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
9692 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9695 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
9696 itype[i+1]==C1LS || itype[i+1]==C2LS)
9698 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9699 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9700 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
9701 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
9702 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9703 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
9704 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
9705 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
9706 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
9707 regs[i].regmap[hr]!=map )
9709 regs[i].regmap[hr]=-1;
9710 regs[i].isconst&=~(1<<hr);
9711 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
9712 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
9713 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
9714 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
9715 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
9716 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
9717 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
9718 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
9719 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
9720 branch_regs[i].regmap[hr]!=map)
9722 branch_regs[i].regmap[hr]=-1;
9723 branch_regs[i].regmap_entry[hr]=-1;
9724 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9726 if(!likely[i]&&i<slen-2) {
9727 regmap_pre[i+2][hr]=-1;
9738 int d1=0,d2=0,map=-1,temp=-1;
9739 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
9745 if(itype[i]==LOAD || itype[i]==LOADLR ||
9746 itype[i]==STORE || itype[i]==STORELR ||
9747 itype[i]==C1LS || itype[i]==C2LS)
9749 } else if(itype[i]==STORE || itype[i]==STORELR ||
9750 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9753 if(itype[i]==LOADLR || itype[i]==STORELR ||
9754 itype[i]==C1LS || itype[i]==C2LS)
9756 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9757 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
9758 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9759 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
9760 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
9761 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
9763 if(i<slen-1&&!is_ds[i]) {
9764 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
9765 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
9766 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
9768 printf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
9769 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
9771 regmap_pre[i+1][hr]=-1;
9772 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
9774 regs[i].regmap[hr]=-1;
9775 regs[i].isconst&=~(1<<hr);
9783 /* Pass 5 - Pre-allocate registers */
9785 // If a register is allocated during a loop, try to allocate it for the
9786 // entire loop, if possible. This avoids loading/storing registers
9787 // inside of the loop.
9789 signed char f_regmap[HOST_REGS];
9790 clear_all_regs(f_regmap);
9791 for(i=0;i<slen-1;i++)
9793 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9795 if(ba[i]>=start && ba[i]<(start+i*4))
9796 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
9797 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
9798 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9799 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9800 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9801 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9803 int t=(ba[i]-start)>>2;
9804 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
9805 if(t<2||(itype[t-2]!=UJUMP)) // call/ret assumes no registers allocated
9806 for(hr=0;hr<HOST_REGS;hr++)
9808 if(regs[i].regmap[hr]>64) {
9809 if(!((regs[i].dirty>>hr)&1))
9810 f_regmap[hr]=regs[i].regmap[hr];
9811 else f_regmap[hr]=-1;
9813 else if(regs[i].regmap[hr]>=0) {
9814 if(f_regmap[hr]!=regs[i].regmap[hr]) {
9815 // dealloc old register
9817 for(n=0;n<HOST_REGS;n++)
9819 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
9821 // and alloc new one
9822 f_regmap[hr]=regs[i].regmap[hr];
9825 if(branch_regs[i].regmap[hr]>64) {
9826 if(!((branch_regs[i].dirty>>hr)&1))
9827 f_regmap[hr]=branch_regs[i].regmap[hr];
9828 else f_regmap[hr]=-1;
9830 else if(branch_regs[i].regmap[hr]>=0) {
9831 if(f_regmap[hr]!=branch_regs[i].regmap[hr]) {
9832 // dealloc old register
9834 for(n=0;n<HOST_REGS;n++)
9836 if(f_regmap[n]==branch_regs[i].regmap[hr]) {f_regmap[n]=-1;}
9838 // and alloc new one
9839 f_regmap[hr]=branch_regs[i].regmap[hr];
9843 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1])
9844 f_regmap[hr]=branch_regs[i].regmap[hr];
9846 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1])
9847 f_regmap[hr]=branch_regs[i].regmap[hr];
9849 // Avoid dirty->clean transition
9850 #ifdef DESTRUCTIVE_WRITEBACK
9851 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;
9853 // This check is only strictly required in the DESTRUCTIVE_WRITEBACK
9854 // case above, however it's always a good idea. We can't hoist the
9855 // load if the register was already allocated, so there's no point
9856 // wasting time analyzing most of these cases. It only "succeeds"
9857 // when the mapping was different and the load can be replaced with
9858 // a mov, which is of negligible benefit. So such cases are
9860 if(f_regmap[hr]>0) {
9861 if(regs[t].regmap_entry[hr]<0&&get_reg(regmap_pre[t],f_regmap[hr])<0) {
9865 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9866 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
9867 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
9869 // NB This can exclude the case where the upper-half
9870 // register is lower numbered than the lower-half
9871 // register. Not sure if it's worth fixing...
9872 if(get_reg(regs[j].regmap,r&63)<0) break;
9873 if(get_reg(regs[j].regmap_entry,r&63)<0) break;
9874 if(regs[j].is32&(1LL<<(r&63))) break;
9876 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
9877 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9879 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
9880 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
9882 if(get_reg(regs[i].regmap,r&63)<0) break;
9883 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
9886 while(k>1&®s[k-1].regmap[hr]==-1) {
9887 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
9888 //printf("no free regs for store %x\n",start+(k-1)*4);
9891 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
9892 //printf("no-match due to different register\n");
9895 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
9896 //printf("no-match due to branch\n");
9899 // call/ret fast path assumes no registers allocated
9900 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)) {
9904 // NB This can exclude the case where the upper-half
9905 // register is lower numbered than the lower-half
9906 // register. Not sure if it's worth fixing...
9907 if(get_reg(regs[k-1].regmap,r&63)<0) break;
9908 if(regs[k-1].is32&(1LL<<(r&63))) break;
9913 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
9914 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
9915 //printf("bad match after branch\n");
9919 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
9920 //printf("Extend r%d, %x ->\n",hr,start+k*4);
9922 regs[k].regmap_entry[hr]=f_regmap[hr];
9923 regs[k].regmap[hr]=f_regmap[hr];
9924 regmap_pre[k+1][hr]=f_regmap[hr];
9925 regs[k].wasdirty&=~(1<<hr);
9926 regs[k].dirty&=~(1<<hr);
9927 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
9928 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
9929 regs[k].wasconst&=~(1<<hr);
9930 regs[k].isconst&=~(1<<hr);
9935 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
9938 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
9939 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
9940 //printf("OK fill %x (r%d)\n",start+i*4,hr);
9941 regs[i].regmap_entry[hr]=f_regmap[hr];
9942 regs[i].regmap[hr]=f_regmap[hr];
9943 regs[i].wasdirty&=~(1<<hr);
9944 regs[i].dirty&=~(1<<hr);
9945 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
9946 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
9947 regs[i].wasconst&=~(1<<hr);
9948 regs[i].isconst&=~(1<<hr);
9949 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
9950 branch_regs[i].wasdirty&=~(1<<hr);
9951 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
9952 branch_regs[i].regmap[hr]=f_regmap[hr];
9953 branch_regs[i].dirty&=~(1<<hr);
9954 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
9955 branch_regs[i].wasconst&=~(1<<hr);
9956 branch_regs[i].isconst&=~(1<<hr);
9957 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
9958 regmap_pre[i+2][hr]=f_regmap[hr];
9959 regs[i+2].wasdirty&=~(1<<hr);
9960 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
9961 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
9962 (regs[i+2].was32&(1LL<<f_regmap[hr])));
9967 // Alloc register clean at beginning of loop,
9968 // but may dirty it in pass 6
9969 regs[k].regmap_entry[hr]=f_regmap[hr];
9970 regs[k].regmap[hr]=f_regmap[hr];
9971 regs[k].dirty&=~(1<<hr);
9972 regs[k].wasconst&=~(1<<hr);
9973 regs[k].isconst&=~(1<<hr);
9974 if(itype[k]==UJUMP||itype[k]==RJUMP||itype[k]==CJUMP||itype[k]==SJUMP||itype[k]==FJUMP) {
9975 branch_regs[k].regmap_entry[hr]=f_regmap[hr];
9976 branch_regs[k].regmap[hr]=f_regmap[hr];
9977 branch_regs[k].dirty&=~(1<<hr);
9978 branch_regs[k].wasconst&=~(1<<hr);
9979 branch_regs[k].isconst&=~(1<<hr);
9980 if(itype[k]!=RJUMP&&itype[k]!=UJUMP&&(source[k]>>16)!=0x1000) {
9981 regmap_pre[k+2][hr]=f_regmap[hr];
9982 regs[k+2].wasdirty&=~(1<<hr);
9983 assert((branch_regs[k].is32&(1LL<<f_regmap[hr]))==
9984 (regs[k+2].was32&(1LL<<f_regmap[hr])));
9989 regmap_pre[k+1][hr]=f_regmap[hr];
9990 regs[k+1].wasdirty&=~(1<<hr);
9993 if(regs[j].regmap[hr]==f_regmap[hr])
9994 regs[j].regmap_entry[hr]=f_regmap[hr];
9998 if(regs[j].regmap[hr]>=0)
10000 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
10001 //printf("no-match due to different register\n");
10004 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
10005 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
10008 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10010 // Stop on unconditional branch
10013 if(itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP)
10016 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1])
10019 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1])
10022 if(get_reg(branch_regs[j].regmap,f_regmap[hr])>=0) {
10023 //printf("no-match due to different register (branch)\n");
10027 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10028 //printf("No free regs for store %x\n",start+j*4);
10031 if(f_regmap[hr]>=64) {
10032 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
10037 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
10049 for(hr=0;hr<HOST_REGS;hr++)
10051 if(hr!=EXCLUDE_REG) {
10052 if(regs[i].regmap[hr]>64) {
10053 if(!((regs[i].dirty>>hr)&1))
10054 f_regmap[hr]=regs[i].regmap[hr];
10056 else if(regs[i].regmap[hr]>=0) {
10057 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10058 // dealloc old register
10060 for(n=0;n<HOST_REGS;n++)
10062 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10064 // and alloc new one
10065 f_regmap[hr]=regs[i].regmap[hr];
10068 else if(regs[i].regmap[hr]<0) count++;
10071 // Try to restore cycle count at branch targets
10073 for(j=i;j<slen-1;j++) {
10074 if(regs[j].regmap[HOST_CCREG]!=-1) break;
10075 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10076 //printf("no free regs for store %x\n",start+j*4);
10080 if(regs[j].regmap[HOST_CCREG]==CCREG) {
10082 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
10084 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10085 regs[k].regmap[HOST_CCREG]=CCREG;
10086 regmap_pre[k+1][HOST_CCREG]=CCREG;
10087 regs[k+1].wasdirty|=1<<HOST_CCREG;
10088 regs[k].dirty|=1<<HOST_CCREG;
10089 regs[k].wasconst&=~(1<<HOST_CCREG);
10090 regs[k].isconst&=~(1<<HOST_CCREG);
10093 regs[j].regmap_entry[HOST_CCREG]=CCREG;
10095 // Work backwards from the branch target
10096 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
10098 //printf("Extend backwards\n");
10101 while(regs[k-1].regmap[HOST_CCREG]==-1) {
10102 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10103 //printf("no free regs for store %x\n",start+(k-1)*4);
10108 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
10109 //printf("Extend CC, %x ->\n",start+k*4);
10111 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10112 regs[k].regmap[HOST_CCREG]=CCREG;
10113 regmap_pre[k+1][HOST_CCREG]=CCREG;
10114 regs[k+1].wasdirty|=1<<HOST_CCREG;
10115 regs[k].dirty|=1<<HOST_CCREG;
10116 regs[k].wasconst&=~(1<<HOST_CCREG);
10117 regs[k].isconst&=~(1<<HOST_CCREG);
10122 //printf("Fail Extend CC, %x ->\n",start+k*4);
10126 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
10127 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
10128 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
10129 itype[i]!=FCONV&&itype[i]!=FCOMP)
10131 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
10136 // This allocates registers (if possible) one instruction prior
10137 // to use, which can avoid a load-use penalty on certain CPUs.
10138 for(i=0;i<slen-1;i++)
10140 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
10144 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
10145 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
10148 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
10150 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10152 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10153 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10154 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10155 regs[i].isconst&=~(1<<hr);
10156 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10157 constmap[i][hr]=constmap[i+1][hr];
10158 regs[i+1].wasdirty&=~(1<<hr);
10159 regs[i].dirty&=~(1<<hr);
10164 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
10166 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10168 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10169 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10170 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10171 regs[i].isconst&=~(1<<hr);
10172 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10173 constmap[i][hr]=constmap[i+1][hr];
10174 regs[i+1].wasdirty&=~(1<<hr);
10175 regs[i].dirty&=~(1<<hr);
10179 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10180 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10182 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10184 regs[i].regmap[hr]=rs1[i+1];
10185 regmap_pre[i+1][hr]=rs1[i+1];
10186 regs[i+1].regmap_entry[hr]=rs1[i+1];
10187 regs[i].isconst&=~(1<<hr);
10188 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10189 constmap[i][hr]=constmap[i+1][hr];
10190 regs[i+1].wasdirty&=~(1<<hr);
10191 regs[i].dirty&=~(1<<hr);
10195 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10196 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10198 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10200 regs[i].regmap[hr]=rs1[i+1];
10201 regmap_pre[i+1][hr]=rs1[i+1];
10202 regs[i+1].regmap_entry[hr]=rs1[i+1];
10203 regs[i].isconst&=~(1<<hr);
10204 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10205 constmap[i][hr]=constmap[i+1][hr];
10206 regs[i+1].wasdirty&=~(1<<hr);
10207 regs[i].dirty&=~(1<<hr);
10211 #ifndef HOST_IMM_ADDR32
10212 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) {
10213 hr=get_reg(regs[i+1].regmap,TLREG);
10215 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10216 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10218 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10220 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10221 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10222 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10223 regs[i].isconst&=~(1<<hr);
10224 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10225 constmap[i][hr]=constmap[i+1][hr];
10226 regs[i+1].wasdirty&=~(1<<hr);
10227 regs[i].dirty&=~(1<<hr);
10229 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10231 // move it to another register
10232 regs[i+1].regmap[hr]=-1;
10233 regmap_pre[i+2][hr]=-1;
10234 regs[i+1].regmap[nr]=TLREG;
10235 regmap_pre[i+2][nr]=TLREG;
10236 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10237 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10238 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10239 regs[i].isconst&=~(1<<nr);
10240 regs[i+1].isconst&=~(1<<nr);
10241 regs[i].dirty&=~(1<<nr);
10242 regs[i+1].wasdirty&=~(1<<nr);
10243 regs[i+1].dirty&=~(1<<nr);
10244 regs[i+2].wasdirty&=~(1<<nr);
10250 if(itype[i+1]==STORE||itype[i+1]==STORELR
10251 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10252 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10253 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10254 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10255 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10257 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10259 regs[i].regmap[hr]=rs1[i+1];
10260 regmap_pre[i+1][hr]=rs1[i+1];
10261 regs[i+1].regmap_entry[hr]=rs1[i+1];
10262 regs[i].isconst&=~(1<<hr);
10263 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10264 constmap[i][hr]=constmap[i+1][hr];
10265 regs[i+1].wasdirty&=~(1<<hr);
10266 regs[i].dirty&=~(1<<hr);
10270 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10271 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10273 hr=get_reg(regs[i+1].regmap,FTEMP);
10275 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10277 regs[i].regmap[hr]=rs1[i+1];
10278 regmap_pre[i+1][hr]=rs1[i+1];
10279 regs[i+1].regmap_entry[hr]=rs1[i+1];
10280 regs[i].isconst&=~(1<<hr);
10281 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10282 constmap[i][hr]=constmap[i+1][hr];
10283 regs[i+1].wasdirty&=~(1<<hr);
10284 regs[i].dirty&=~(1<<hr);
10286 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10288 // move it to another register
10289 regs[i+1].regmap[hr]=-1;
10290 regmap_pre[i+2][hr]=-1;
10291 regs[i+1].regmap[nr]=FTEMP;
10292 regmap_pre[i+2][nr]=FTEMP;
10293 regs[i].regmap[nr]=rs1[i+1];
10294 regmap_pre[i+1][nr]=rs1[i+1];
10295 regs[i+1].regmap_entry[nr]=rs1[i+1];
10296 regs[i].isconst&=~(1<<nr);
10297 regs[i+1].isconst&=~(1<<nr);
10298 regs[i].dirty&=~(1<<nr);
10299 regs[i+1].wasdirty&=~(1<<nr);
10300 regs[i+1].dirty&=~(1<<nr);
10301 regs[i+2].wasdirty&=~(1<<nr);
10305 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*/) {
10306 if(itype[i+1]==LOAD)
10307 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10308 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10309 hr=get_reg(regs[i+1].regmap,FTEMP);
10310 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10311 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10312 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10314 if(hr>=0&®s[i].regmap[hr]<0) {
10315 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10316 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10317 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10318 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10319 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10320 regs[i].isconst&=~(1<<hr);
10321 regs[i+1].wasdirty&=~(1<<hr);
10322 regs[i].dirty&=~(1<<hr);
10331 /* Pass 6 - Optimize clean/dirty state */
10332 clean_registers(0,slen-1,1);
10334 /* Pass 7 - Identify 32-bit registers */
10340 for (i=slen-1;i>=0;i--)
10343 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10345 if(ba[i]<start || ba[i]>=(start+slen*4))
10347 // Branch out of this block, don't need anything
10353 // Need whatever matches the target
10354 // (and doesn't get overwritten by the delay slot instruction)
10356 int t=(ba[i]-start)>>2;
10357 if(ba[i]>start+i*4) {
10359 if(!(requires_32bit[t]&~regs[i].was32))
10360 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10363 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10364 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10365 if(!(pr32[t]&~regs[i].was32))
10366 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10369 // Conditional branch may need registers for following instructions
10370 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10373 r32|=requires_32bit[i+2];
10374 r32&=regs[i].was32;
10375 // Mark this address as a branch target since it may be called
10376 // upon return from interrupt
10380 // Merge in delay slot
10382 // These are overwritten unless the branch is "likely"
10383 // and the delay slot is nullified if not taken
10384 r32&=~(1LL<<rt1[i+1]);
10385 r32&=~(1LL<<rt2[i+1]);
10387 // Assume these are needed (delay slot)
10390 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
10394 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
10396 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
10398 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
10400 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
10402 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
10405 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
10407 // SYSCALL instruction (software interrupt)
10410 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10412 // ERET instruction (return from interrupt)
10416 r32&=~(1LL<<rt1[i]);
10417 r32&=~(1LL<<rt2[i]);
10420 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
10424 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
10426 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
10428 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
10430 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
10432 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
10434 requires_32bit[i]=r32;
10436 // Dirty registers which are 32-bit, require 32-bit input
10437 // as they will be written as 32-bit values
10438 for(hr=0;hr<HOST_REGS;hr++)
10440 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
10441 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
10442 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
10443 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
10447 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
10451 if(itype[slen-1]==SPAN) {
10452 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
10455 /* Debug/disassembly */
10456 if((void*)assem_debug==(void*)printf)
10457 for(i=0;i<slen;i++)
10461 for(r=1;r<=CCREG;r++) {
10462 if((unneeded_reg[i]>>r)&1) {
10463 if(r==HIREG) printf(" HI");
10464 else if(r==LOREG) printf(" LO");
10465 else printf(" r%d",r);
10470 for(r=1;r<=CCREG;r++) {
10471 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
10472 if(r==HIREG) printf(" HI");
10473 else if(r==LOREG) printf(" LO");
10474 else printf(" r%d",r);
10478 for(r=0;r<=CCREG;r++) {
10479 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10480 if((regs[i].was32>>r)&1) {
10481 if(r==CCREG) printf(" CC");
10482 else if(r==HIREG) printf(" HI");
10483 else if(r==LOREG) printf(" LO");
10484 else printf(" r%d",r);
10489 #if defined(__i386__) || defined(__x86_64__)
10490 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]);
10493 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]);
10496 if(needed_reg[i]&1) printf("eax ");
10497 if((needed_reg[i]>>1)&1) printf("ecx ");
10498 if((needed_reg[i]>>2)&1) printf("edx ");
10499 if((needed_reg[i]>>3)&1) printf("ebx ");
10500 if((needed_reg[i]>>5)&1) printf("ebp ");
10501 if((needed_reg[i]>>6)&1) printf("esi ");
10502 if((needed_reg[i]>>7)&1) printf("edi ");
10504 for(r=0;r<=CCREG;r++) {
10505 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10506 if((requires_32bit[i]>>r)&1) {
10507 if(r==CCREG) printf(" CC");
10508 else if(r==HIREG) printf(" HI");
10509 else if(r==LOREG) printf(" LO");
10510 else printf(" r%d",r);
10515 for(r=0;r<=CCREG;r++) {
10516 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10517 if((pr32[i]>>r)&1) {
10518 if(r==CCREG) printf(" CC");
10519 else if(r==HIREG) printf(" HI");
10520 else if(r==LOREG) printf(" LO");
10521 else printf(" r%d",r);
10524 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
10526 #if defined(__i386__) || defined(__x86_64__)
10527 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]);
10529 if(regs[i].wasdirty&1) printf("eax ");
10530 if((regs[i].wasdirty>>1)&1) printf("ecx ");
10531 if((regs[i].wasdirty>>2)&1) printf("edx ");
10532 if((regs[i].wasdirty>>3)&1) printf("ebx ");
10533 if((regs[i].wasdirty>>5)&1) printf("ebp ");
10534 if((regs[i].wasdirty>>6)&1) printf("esi ");
10535 if((regs[i].wasdirty>>7)&1) printf("edi ");
10538 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]);
10540 if(regs[i].wasdirty&1) printf("r0 ");
10541 if((regs[i].wasdirty>>1)&1) printf("r1 ");
10542 if((regs[i].wasdirty>>2)&1) printf("r2 ");
10543 if((regs[i].wasdirty>>3)&1) printf("r3 ");
10544 if((regs[i].wasdirty>>4)&1) printf("r4 ");
10545 if((regs[i].wasdirty>>5)&1) printf("r5 ");
10546 if((regs[i].wasdirty>>6)&1) printf("r6 ");
10547 if((regs[i].wasdirty>>7)&1) printf("r7 ");
10548 if((regs[i].wasdirty>>8)&1) printf("r8 ");
10549 if((regs[i].wasdirty>>9)&1) printf("r9 ");
10550 if((regs[i].wasdirty>>10)&1) printf("r10 ");
10551 if((regs[i].wasdirty>>12)&1) printf("r12 ");
10554 disassemble_inst(i);
10555 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
10556 #if defined(__i386__) || defined(__x86_64__)
10557 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]);
10558 if(regs[i].dirty&1) printf("eax ");
10559 if((regs[i].dirty>>1)&1) printf("ecx ");
10560 if((regs[i].dirty>>2)&1) printf("edx ");
10561 if((regs[i].dirty>>3)&1) printf("ebx ");
10562 if((regs[i].dirty>>5)&1) printf("ebp ");
10563 if((regs[i].dirty>>6)&1) printf("esi ");
10564 if((regs[i].dirty>>7)&1) printf("edi ");
10567 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]);
10568 if(regs[i].dirty&1) printf("r0 ");
10569 if((regs[i].dirty>>1)&1) printf("r1 ");
10570 if((regs[i].dirty>>2)&1) printf("r2 ");
10571 if((regs[i].dirty>>3)&1) printf("r3 ");
10572 if((regs[i].dirty>>4)&1) printf("r4 ");
10573 if((regs[i].dirty>>5)&1) printf("r5 ");
10574 if((regs[i].dirty>>6)&1) printf("r6 ");
10575 if((regs[i].dirty>>7)&1) printf("r7 ");
10576 if((regs[i].dirty>>8)&1) printf("r8 ");
10577 if((regs[i].dirty>>9)&1) printf("r9 ");
10578 if((regs[i].dirty>>10)&1) printf("r10 ");
10579 if((regs[i].dirty>>12)&1) printf("r12 ");
10582 if(regs[i].isconst) {
10583 printf("constants: ");
10584 #if defined(__i386__) || defined(__x86_64__)
10585 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
10586 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
10587 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
10588 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
10589 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
10590 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
10591 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
10594 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
10595 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
10596 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
10597 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
10598 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
10599 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
10600 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
10601 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
10602 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
10603 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
10604 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
10605 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
10611 for(r=0;r<=CCREG;r++) {
10612 if((regs[i].is32>>r)&1) {
10613 if(r==CCREG) printf(" CC");
10614 else if(r==HIREG) printf(" HI");
10615 else if(r==LOREG) printf(" LO");
10616 else printf(" r%d",r);
10622 for(r=0;r<=CCREG;r++) {
10623 if((p32[i]>>r)&1) {
10624 if(r==CCREG) printf(" CC");
10625 else if(r==HIREG) printf(" HI");
10626 else if(r==LOREG) printf(" LO");
10627 else printf(" r%d",r);
10630 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
10631 else printf("\n");*/
10632 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10633 #if defined(__i386__) || defined(__x86_64__)
10634 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]);
10635 if(branch_regs[i].dirty&1) printf("eax ");
10636 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
10637 if((branch_regs[i].dirty>>2)&1) printf("edx ");
10638 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
10639 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
10640 if((branch_regs[i].dirty>>6)&1) printf("esi ");
10641 if((branch_regs[i].dirty>>7)&1) printf("edi ");
10644 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]);
10645 if(branch_regs[i].dirty&1) printf("r0 ");
10646 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
10647 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
10648 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
10649 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
10650 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
10651 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
10652 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
10653 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
10654 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
10655 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
10656 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
10660 for(r=0;r<=CCREG;r++) {
10661 if((branch_regs[i].is32>>r)&1) {
10662 if(r==CCREG) printf(" CC");
10663 else if(r==HIREG) printf(" HI");
10664 else if(r==LOREG) printf(" LO");
10665 else printf(" r%d",r);
10673 /* Pass 8 - Assembly */
10674 linkcount=0;stubcount=0;
10675 ds=0;is_delayslot=0;
10677 uint64_t is32_pre=0;
10679 u_int beginning=(u_int)out;
10680 if((u_int)addr&1) {
10684 u_int instr_addr0_override=0;
10687 if (start == 0x80030000) {
10688 // nasty hack for fastbios thing
10689 instr_addr0_override=(u_int)out;
10690 emit_movimm(start,0);
10691 emit_readword((int)&pcaddr,1);
10692 emit_writeword(0,(int)&pcaddr);
10694 emit_jne((int)new_dyna_leave);
10697 for(i=0;i<slen;i++)
10699 //if(ds) printf("ds: ");
10700 if((void*)assem_debug==(void*)printf) disassemble_inst(i);
10702 ds=0; // Skip delay slot
10703 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
10706 #ifndef DESTRUCTIVE_WRITEBACK
10707 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10709 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
10710 unneeded_reg[i],unneeded_reg_upper[i]);
10711 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
10712 unneeded_reg[i],unneeded_reg_upper[i]);
10714 is32_pre=regs[i].is32;
10715 dirty_pre=regs[i].dirty;
10718 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10720 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
10721 unneeded_reg[i],unneeded_reg_upper[i]);
10722 loop_preload(regmap_pre[i],regs[i].regmap_entry);
10724 // branch target entry point
10725 instr_addr[i]=(u_int)out;
10726 assem_debug("<->\n");
10728 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
10729 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
10730 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
10731 address_generation(i,®s[i],regs[i].regmap_entry);
10732 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
10733 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10735 // Load the delay slot registers if necessary
10736 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10737 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10738 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10739 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10740 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
10741 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10745 // Preload registers for following instruction
10746 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10747 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
10748 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10749 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10750 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
10751 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10753 // TODO: if(is_ooo(i)) address_generation(i+1);
10754 if(itype[i]==CJUMP||itype[i]==FJUMP)
10755 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
10756 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
10757 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10758 if(bt[i]) cop1_usable=0;
10762 alu_assemble(i,®s[i]);break;
10764 imm16_assemble(i,®s[i]);break;
10766 shift_assemble(i,®s[i]);break;
10768 shiftimm_assemble(i,®s[i]);break;
10770 load_assemble(i,®s[i]);break;
10772 loadlr_assemble(i,®s[i]);break;
10774 store_assemble(i,®s[i]);break;
10776 storelr_assemble(i,®s[i]);break;
10778 cop0_assemble(i,®s[i]);break;
10780 cop1_assemble(i,®s[i]);break;
10782 c1ls_assemble(i,®s[i]);break;
10784 cop2_assemble(i,®s[i]);break;
10786 c2ls_assemble(i,®s[i]);break;
10788 c2op_assemble(i,®s[i]);break;
10790 fconv_assemble(i,®s[i]);break;
10792 float_assemble(i,®s[i]);break;
10794 fcomp_assemble(i,®s[i]);break;
10796 multdiv_assemble(i,®s[i]);break;
10798 mov_assemble(i,®s[i]);break;
10800 syscall_assemble(i,®s[i]);break;
10802 hlecall_assemble(i,®s[i]);break;
10804 intcall_assemble(i,®s[i]);break;
10806 ujump_assemble(i,®s[i]);ds=1;break;
10808 rjump_assemble(i,®s[i]);ds=1;break;
10810 cjump_assemble(i,®s[i]);ds=1;break;
10812 sjump_assemble(i,®s[i]);ds=1;break;
10814 fjump_assemble(i,®s[i]);ds=1;break;
10816 pagespan_assemble(i,®s[i]);break;
10818 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10819 literal_pool(1024);
10821 literal_pool_jumpover(256);
10824 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
10825 // If the block did not end with an unconditional branch,
10826 // add a jump to the next instruction.
10828 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
10829 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10831 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
10832 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10833 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10834 emit_loadreg(CCREG,HOST_CCREG);
10835 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10837 else if(!likely[i-2])
10839 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
10840 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
10844 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
10845 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
10847 add_to_linker((int)out,start+i*4,0);
10854 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10855 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10856 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10857 emit_loadreg(CCREG,HOST_CCREG);
10858 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10859 add_to_linker((int)out,start+i*4,0);
10863 // TODO: delay slot stubs?
10865 for(i=0;i<stubcount;i++)
10867 switch(stubs[i][0])
10875 do_readstub(i);break;
10880 do_writestub(i);break;
10882 do_ccstub(i);break;
10884 do_invstub(i);break;
10886 do_cop1stub(i);break;
10888 do_unalignedwritestub(i);break;
10892 if (instr_addr0_override)
10893 instr_addr[0] = instr_addr0_override;
10895 /* Pass 9 - Linker */
10896 for(i=0;i<linkcount;i++)
10898 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
10900 if(!link_addr[i][2])
10903 void *addr=check_addr(link_addr[i][1]);
10904 emit_extjump(link_addr[i][0],link_addr[i][1]);
10906 set_jump_target(link_addr[i][0],(int)addr);
10907 add_link(link_addr[i][1],stub);
10909 else set_jump_target(link_addr[i][0],(int)stub);
10914 int target=(link_addr[i][1]-start)>>2;
10915 assert(target>=0&&target<slen);
10916 assert(instr_addr[target]);
10917 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
10918 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
10920 set_jump_target(link_addr[i][0],instr_addr[target]);
10924 // External Branch Targets (jump_in)
10925 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
10926 for(i=0;i<slen;i++)
10930 if(instr_addr[i]) // TODO - delay slots (=null)
10932 u_int vaddr=start+i*4;
10933 u_int page=get_page(vaddr);
10934 u_int vpage=get_vpage(vaddr);
10936 //if(!(is32[i]&(~unneeded_reg_upper[i])&~(1LL<<CCREG)))
10938 if(!requires_32bit[i])
10943 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
10944 assem_debug("jump_in: %x\n",start+i*4);
10945 ll_add(jump_dirty+vpage,vaddr,(void *)out);
10946 int entry_point=do_dirty_stub(i);
10947 ll_add(jump_in+page,vaddr,(void *)entry_point);
10948 // If there was an existing entry in the hash table,
10949 // replace it with the new address.
10950 // Don't add new entries. We'll insert the
10951 // ones that actually get used in check_addr().
10952 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
10953 if(ht_bin[0]==vaddr) {
10954 ht_bin[1]=entry_point;
10956 if(ht_bin[2]==vaddr) {
10957 ht_bin[3]=entry_point;
10962 u_int r=requires_32bit[i]|!!(requires_32bit[i]>>32);
10963 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
10964 assem_debug("jump_in: %x (restricted - %x)\n",start+i*4,r);
10965 //int entry_point=(int)out;
10966 ////assem_debug("entry_point: %x\n",entry_point);
10967 //load_regs_entry(i);
10968 //if(entry_point==(int)out)
10969 // entry_point=instr_addr[i];
10971 // emit_jmp(instr_addr[i]);
10972 //ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
10973 ll_add_32(jump_dirty+vpage,vaddr,r,(void *)out);
10974 int entry_point=do_dirty_stub(i);
10975 ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
10980 // Write out the literal pool if necessary
10982 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
10984 if(((u_int)out)&7) emit_addnop(13);
10986 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
10987 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
10988 memcpy(copy,source,slen*4);
10992 __clear_cache((void *)beginning,out);
10995 // If we're within 256K of the end of the buffer,
10996 // start over from the beginning. (Is 256K enough?)
10997 if((int)out>BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
10999 // Trap writes to any of the pages we compiled
11000 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
11002 #ifndef DISABLE_TLB
11003 memory_map[i]|=0x40000000;
11004 if((signed int)start>=(signed int)0xC0000000) {
11006 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
11008 memory_map[j]|=0x40000000;
11009 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
11014 /* Pass 10 - Free memory by expiring oldest blocks */
11016 int end=((((int)out-BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
11017 while(expirep!=end)
11019 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
11020 int base=BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
11021 inv_debug("EXP: Phase %d\n",expirep);
11022 switch((expirep>>11)&3)
11025 // Clear jump_in and jump_dirty
11026 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
11027 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
11028 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
11029 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
11033 ll_kill_pointers(jump_out[expirep&2047],base,shift);
11034 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
11037 // Clear hash table
11038 for(i=0;i<32;i++) {
11039 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
11040 if((ht_bin[3]>>shift)==(base>>shift) ||
11041 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11042 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
11043 ht_bin[2]=ht_bin[3]=-1;
11045 if((ht_bin[1]>>shift)==(base>>shift) ||
11046 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11047 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
11048 ht_bin[0]=ht_bin[2];
11049 ht_bin[1]=ht_bin[3];
11050 ht_bin[2]=ht_bin[3]=-1;
11057 if((expirep&2047)==0)
11060 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
11061 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
11064 expirep=(expirep+1)&65535;
11069 // vim:shiftwidth=2:expandtab