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
138 #define FTEMP 38 // FPU/LDL/LDR temporary register
139 #define PTEMP 39 // Prefetch temporary register
140 #define TLREG 40 // TLB mapping offset
141 #define RHASH 41 // Return address hash
142 #define RHTBL 42 // Return address hash table address
143 #define RTEMP 43 // JR/JALR address register
145 #define AGEN1 44 // Address generation temporary register
146 #define AGEN2 45 // Address generation temporary register
147 #define MGEN1 46 // Maptable address generation temporary register
148 #define MGEN2 47 // Maptable address generation temporary register
149 #define BTREG 48 // Branch target temporary register
151 /* instruction types */
152 #define NOP 0 // No operation
153 #define LOAD 1 // Load
154 #define STORE 2 // Store
155 #define LOADLR 3 // Unaligned load
156 #define STORELR 4 // Unaligned store
157 #define MOV 5 // Move
158 #define ALU 6 // Arithmetic/logic
159 #define MULTDIV 7 // Multiply/divide
160 #define SHIFT 8 // Shift by register
161 #define SHIFTIMM 9// Shift by immediate
162 #define IMM16 10 // 16-bit immediate
163 #define RJUMP 11 // Unconditional jump to register
164 #define UJUMP 12 // Unconditional jump
165 #define CJUMP 13 // Conditional branch (BEQ/BNE/BGTZ/BLEZ)
166 #define SJUMP 14 // Conditional branch (regimm format)
167 #define COP0 15 // Coprocessor 0
168 #define COP1 16 // Coprocessor 1
169 #define C1LS 17 // Coprocessor 1 load/store
170 #define FJUMP 18 // Conditional branch (floating point)
171 #define FLOAT 19 // Floating point unit
172 #define FCONV 20 // Convert integer to float
173 #define FCOMP 21 // Floating point compare (sets FSREG)
174 #define SYSCALL 22// SYSCALL
175 #define OTHER 23 // Other
176 #define SPAN 24 // Branch/delay slot spans 2 pages
177 #define NI 25 // Not implemented
178 #define HLECALL 26// PCSX fake opcodes for HLE
179 #define COP2 27 // Coprocessor 2 move
180 #define C2LS 28 // Coprocessor 2 load/store
181 #define C2OP 29 // Coprocessor 2 operation
182 #define INTCALL 30// Call interpreter to handle rare corner cases
191 #define LOADBU_STUB 7
192 #define LOADHU_STUB 8
193 #define STOREB_STUB 9
194 #define STOREH_STUB 10
195 #define STOREW_STUB 11
196 #define STORED_STUB 12
197 #define STORELR_STUB 13
198 #define INVCODE_STUB 14
206 int new_recompile_block(int addr);
207 void *get_addr_ht(u_int vaddr);
208 void invalidate_block(u_int block);
209 void invalidate_addr(u_int addr);
210 void remove_hash(int vaddr);
213 void dyna_linker_ds();
215 void verify_code_vm();
216 void verify_code_ds();
219 void fp_exception_ds();
221 void jump_syscall_hle();
225 void new_dyna_leave();
230 void read_nomem_new();
231 void read_nomemb_new();
232 void read_nomemh_new();
233 void read_nomemd_new();
234 void write_nomem_new();
235 void write_nomemb_new();
236 void write_nomemh_new();
237 void write_nomemd_new();
238 void write_rdram_new();
239 void write_rdramb_new();
240 void write_rdramh_new();
241 void write_rdramd_new();
242 extern u_int memory_map[1048576];
244 // Needed by assembler
245 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32);
246 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty);
247 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr);
248 void load_all_regs(signed char i_regmap[]);
249 void load_needed_regs(signed char i_regmap[],signed char next_regmap[]);
250 void load_regs_entry(int t);
251 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i);
255 //#define DEBUG_CYCLE_COUNT 1
258 //#define assem_debug printf
259 //#define inv_debug printf
260 #define assem_debug nullf
261 #define inv_debug nullf
263 static void tlb_hacks()
267 if (strncmp((char *) ROM_HEADER->nom, "GOLDENEYE",9) == 0)
271 switch (ROM_HEADER->Country_code&0xFF)
283 // Unknown country code
287 u_int rom_addr=(u_int)rom;
289 // Since memory_map is 32-bit, on 64-bit systems the rom needs to be
290 // in the lower 4G of memory to use this hack. Copy it if necessary.
291 if((void *)rom>(void *)0xffffffff) {
292 munmap(ROM_COPY, 67108864);
293 if(mmap(ROM_COPY, 12582912,
294 PROT_READ | PROT_WRITE,
295 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
296 -1, 0) <= 0) {printf("mmap() failed\n");}
297 memcpy(ROM_COPY,rom,12582912);
298 rom_addr=(u_int)ROM_COPY;
302 for(n=0x7F000;n<0x80000;n++) {
303 memory_map[n]=(((u_int)(rom_addr+addr-0x7F000000))>>2)|0x40000000;
310 static u_int get_page(u_int vaddr)
313 u_int page=(vaddr^0x80000000)>>12;
315 u_int page=vaddr&~0xe0000000;
316 if (page < 0x1000000)
317 page &= ~0x0e00000; // RAM mirrors
321 if(page>262143&&tlb_LUT_r[vaddr>>12]) page=(tlb_LUT_r[vaddr>>12]^0x80000000)>>12;
323 if(page>2048) page=2048+(page&2047);
327 static u_int get_vpage(u_int vaddr)
329 u_int vpage=(vaddr^0x80000000)>>12;
331 if(vpage>262143&&tlb_LUT_r[vaddr>>12]) vpage&=2047; // jump_dirty uses a hash of the virtual address instead
333 if(vpage>2048) vpage=2048+(vpage&2047);
337 // Get address from virtual address
338 // This is called from the recompiled JR/JALR instructions
339 void *get_addr(u_int vaddr)
341 u_int page=get_page(vaddr);
342 u_int vpage=get_vpage(vaddr);
343 struct ll_entry *head;
344 //printf("TRACE: count=%d next=%d (get_addr %x,page %d)\n",Count,next_interupt,vaddr,page);
347 if(head->vaddr==vaddr&&head->reg32==0) {
348 //printf("TRACE: count=%d next=%d (get_addr match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
349 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
352 ht_bin[1]=(int)head->addr;
358 head=jump_dirty[vpage];
360 if(head->vaddr==vaddr&&head->reg32==0) {
361 //printf("TRACE: count=%d next=%d (get_addr match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
362 // Don't restore blocks which are about to expire from the cache
363 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
364 if(verify_dirty(head->addr)) {
365 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
366 invalid_code[vaddr>>12]=0;
367 memory_map[vaddr>>12]|=0x40000000;
370 if(tlb_LUT_r[vaddr>>12]) {
371 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
372 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
375 restore_candidate[vpage>>3]|=1<<(vpage&7);
377 else restore_candidate[page>>3]|=1<<(page&7);
378 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
379 if(ht_bin[0]==vaddr) {
380 ht_bin[1]=(int)head->addr; // Replace existing entry
386 ht_bin[1]=(int)head->addr;
394 //printf("TRACE: count=%d next=%d (get_addr no-match %x)\n",Count,next_interupt,vaddr);
395 int r=new_recompile_block(vaddr);
396 if(r==0) return get_addr(vaddr);
397 // Execute in unmapped page, generate pagefault execption
399 Cause=(vaddr<<31)|0x8;
400 EPC=(vaddr&1)?vaddr-5:vaddr;
402 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
403 EntryHi=BadVAddr&0xFFFFE000;
404 return get_addr_ht(0x80000000);
406 // Look up address in hash table first
407 void *get_addr_ht(u_int vaddr)
409 //printf("TRACE: count=%d next=%d (get_addr_ht %x)\n",Count,next_interupt,vaddr);
410 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
411 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
412 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
413 return get_addr(vaddr);
416 void *get_addr_32(u_int vaddr,u_int flags)
419 return get_addr(vaddr);
421 //printf("TRACE: count=%d next=%d (get_addr_32 %x,flags %x)\n",Count,next_interupt,vaddr,flags);
422 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
423 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
424 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
425 u_int page=get_page(vaddr);
426 u_int vpage=get_vpage(vaddr);
427 struct ll_entry *head;
430 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
431 //printf("TRACE: count=%d next=%d (get_addr_32 match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
433 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
435 ht_bin[1]=(int)head->addr;
437 }else if(ht_bin[2]==-1) {
438 ht_bin[3]=(int)head->addr;
441 //ht_bin[3]=ht_bin[1];
442 //ht_bin[2]=ht_bin[0];
443 //ht_bin[1]=(int)head->addr;
450 head=jump_dirty[vpage];
452 if(head->vaddr==vaddr&&(head->reg32&flags)==0) {
453 //printf("TRACE: count=%d next=%d (get_addr_32 match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
454 // Don't restore blocks which are about to expire from the cache
455 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
456 if(verify_dirty(head->addr)) {
457 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
458 invalid_code[vaddr>>12]=0;
459 memory_map[vaddr>>12]|=0x40000000;
462 if(tlb_LUT_r[vaddr>>12]) {
463 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
464 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
467 restore_candidate[vpage>>3]|=1<<(vpage&7);
469 else restore_candidate[page>>3]|=1<<(page&7);
471 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
473 ht_bin[1]=(int)head->addr;
475 }else if(ht_bin[2]==-1) {
476 ht_bin[3]=(int)head->addr;
479 //ht_bin[3]=ht_bin[1];
480 //ht_bin[2]=ht_bin[0];
481 //ht_bin[1]=(int)head->addr;
489 //printf("TRACE: count=%d next=%d (get_addr_32 no-match %x,flags %x)\n",Count,next_interupt,vaddr,flags);
490 int r=new_recompile_block(vaddr);
491 if(r==0) return get_addr(vaddr);
492 // Execute in unmapped page, generate pagefault execption
494 Cause=(vaddr<<31)|0x8;
495 EPC=(vaddr&1)?vaddr-5:vaddr;
497 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
498 EntryHi=BadVAddr&0xFFFFE000;
499 return get_addr_ht(0x80000000);
503 void clear_all_regs(signed char regmap[])
506 for (hr=0;hr<HOST_REGS;hr++) regmap[hr]=-1;
509 signed char get_reg(signed char regmap[],int r)
512 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map[hr]==r) return hr;
516 // Find a register that is available for two consecutive cycles
517 signed char get_reg2(signed char regmap1[],signed char regmap2[],int r)
520 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map1[hr]==r&®map2[hr]==r) return hr;
524 int count_free_regs(signed char regmap[])
528 for(hr=0;hr<HOST_REGS;hr++)
530 if(hr!=EXCLUDE_REG) {
531 if(regmap[hr]<0) count++;
537 void dirty_reg(struct regstat *cur,signed char reg)
541 for (hr=0;hr<HOST_REGS;hr++) {
542 if((cur->regmap[hr]&63)==reg) {
548 // If we dirty the lower half of a 64 bit register which is now being
549 // sign-extended, we need to dump the upper half.
550 // Note: Do this only after completion of the instruction, because
551 // some instructions may need to read the full 64-bit value even if
552 // overwriting it (eg SLTI, DSRA32).
553 static void flush_dirty_uppers(struct regstat *cur)
556 for (hr=0;hr<HOST_REGS;hr++) {
557 if((cur->dirty>>hr)&1) {
560 if((cur->is32>>(reg&63))&1) cur->regmap[hr]=-1;
565 void set_const(struct regstat *cur,signed char reg,uint64_t value)
569 for (hr=0;hr<HOST_REGS;hr++) {
570 if(cur->regmap[hr]==reg) {
572 cur->constmap[hr]=value;
574 else if((cur->regmap[hr]^64)==reg) {
576 cur->constmap[hr]=value>>32;
581 void clear_const(struct regstat *cur,signed char reg)
585 for (hr=0;hr<HOST_REGS;hr++) {
586 if((cur->regmap[hr]&63)==reg) {
587 cur->isconst&=~(1<<hr);
592 int is_const(struct regstat *cur,signed char reg)
596 for (hr=0;hr<HOST_REGS;hr++) {
597 if((cur->regmap[hr]&63)==reg) {
598 return (cur->isconst>>hr)&1;
603 uint64_t get_const(struct regstat *cur,signed char reg)
607 for (hr=0;hr<HOST_REGS;hr++) {
608 if(cur->regmap[hr]==reg) {
609 return cur->constmap[hr];
612 printf("Unknown constant in r%d\n",reg);
616 // Least soon needed registers
617 // Look at the next ten instructions and see which registers
618 // will be used. Try not to reallocate these.
619 void lsn(u_char hsn[], int i, int *preferred_reg)
629 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
631 // Don't go past an unconditonal jump
638 if(rs1[i+j]) hsn[rs1[i+j]]=j;
639 if(rs2[i+j]) hsn[rs2[i+j]]=j;
640 if(rt1[i+j]) hsn[rt1[i+j]]=j;
641 if(rt2[i+j]) hsn[rt2[i+j]]=j;
642 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
643 // Stores can allocate zero
647 // On some architectures stores need invc_ptr
648 #if defined(HOST_IMM8)
649 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
653 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
661 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
663 // Follow first branch
664 int t=(ba[i+b]-start)>>2;
665 j=7-b;if(t+j>=slen) j=slen-t-1;
668 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
669 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
670 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
671 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
674 // TODO: preferred register based on backward branch
676 // Delay slot should preferably not overwrite branch conditions or cycle count
677 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
678 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
679 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
685 // Coprocessor load/store needs FTEMP, even if not declared
686 if(itype[i]==C1LS||itype[i]==C2LS) {
689 // Load L/R also uses FTEMP as a temporary register
690 if(itype[i]==LOADLR) {
693 // Also SWL/SWR/SDL/SDR
694 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
697 // Don't remove the TLB registers either
698 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
701 // Don't remove the miniht registers
702 if(itype[i]==UJUMP||itype[i]==RJUMP)
709 // We only want to allocate registers if we're going to use them again soon
710 int needed_again(int r, int i)
716 u_char hsn[MAXREG+1];
719 memset(hsn,10,sizeof(hsn));
720 lsn(hsn,i,&preferred_reg);
722 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
724 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
725 return 0; // Don't need any registers if exiting the block
733 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
735 // Don't go past an unconditonal jump
739 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||itype[i+j]==INTCALL||((source[i+j]&0xfc00003f)==0x0d))
746 if(rs1[i+j]==r) rn=j;
747 if(rs2[i+j]==r) rn=j;
748 if((unneeded_reg[i+j]>>r)&1) rn=10;
749 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
757 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
759 // Follow first branch
761 int t=(ba[i+b]-start)>>2;
762 j=7-b;if(t+j>=slen) j=slen-t-1;
765 if(!((unneeded_reg[t+j]>>r)&1)) {
766 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
767 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
773 for(hr=0;hr<HOST_REGS;hr++) {
774 if(hr!=EXCLUDE_REG) {
775 if(rn<hsn[hr]) return 1;
781 // Try to match register allocations at the end of a loop with those
783 int loop_reg(int i, int r, int hr)
792 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
794 // Don't go past an unconditonal jump
801 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
806 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
807 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
808 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
810 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
812 int t=(ba[i+k]-start)>>2;
813 int reg=get_reg(regs[t].regmap_entry,r);
814 if(reg>=0) return reg;
815 //reg=get_reg(regs[t+1].regmap_entry,r);
816 //if(reg>=0) return reg;
824 // Allocate every register, preserving source/target regs
825 void alloc_all(struct regstat *cur,int i)
829 for(hr=0;hr<HOST_REGS;hr++) {
830 if(hr!=EXCLUDE_REG) {
831 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
832 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
835 cur->dirty&=~(1<<hr);
838 if((cur->regmap[hr]&63)==0)
841 cur->dirty&=~(1<<hr);
848 void div64(int64_t dividend,int64_t divisor)
852 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
853 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
855 void divu64(uint64_t dividend,uint64_t divisor)
859 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
860 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
863 void mult64(uint64_t m1,uint64_t m2)
865 unsigned long long int op1, op2, op3, op4;
866 unsigned long long int result1, result2, result3, result4;
867 unsigned long long int temp1, temp2, temp3, temp4;
883 op1 = op2 & 0xFFFFFFFF;
884 op2 = (op2 >> 32) & 0xFFFFFFFF;
885 op3 = op4 & 0xFFFFFFFF;
886 op4 = (op4 >> 32) & 0xFFFFFFFF;
889 temp2 = (temp1 >> 32) + op1 * op4;
891 temp4 = (temp3 >> 32) + op2 * op4;
893 result1 = temp1 & 0xFFFFFFFF;
894 result2 = temp2 + (temp3 & 0xFFFFFFFF);
895 result3 = (result2 >> 32) + temp4;
896 result4 = (result3 >> 32);
898 lo = result1 | (result2 << 32);
899 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
908 void multu64(uint64_t m1,uint64_t m2)
910 unsigned long long int op1, op2, op3, op4;
911 unsigned long long int result1, result2, result3, result4;
912 unsigned long long int temp1, temp2, temp3, temp4;
914 op1 = m1 & 0xFFFFFFFF;
915 op2 = (m1 >> 32) & 0xFFFFFFFF;
916 op3 = m2 & 0xFFFFFFFF;
917 op4 = (m2 >> 32) & 0xFFFFFFFF;
920 temp2 = (temp1 >> 32) + op1 * op4;
922 temp4 = (temp3 >> 32) + op2 * op4;
924 result1 = temp1 & 0xFFFFFFFF;
925 result2 = temp2 + (temp3 & 0xFFFFFFFF);
926 result3 = (result2 >> 32) + temp4;
927 result4 = (result3 >> 32);
929 lo = result1 | (result2 << 32);
930 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
932 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
933 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
936 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
944 else original=loaded;
947 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
950 original>>=64-(bits^56);
951 original<<=64-(bits^56);
955 else original=loaded;
960 #include "assem_x86.c"
963 #include "assem_x64.c"
966 #include "assem_arm.c"
969 // Add virtual address mapping to linked list
970 void ll_add(struct ll_entry **head,int vaddr,void *addr)
972 struct ll_entry *new_entry;
973 new_entry=malloc(sizeof(struct ll_entry));
974 assert(new_entry!=NULL);
975 new_entry->vaddr=vaddr;
977 new_entry->addr=addr;
978 new_entry->next=*head;
982 // Add virtual address mapping for 32-bit compiled block
983 void ll_add_32(struct ll_entry **head,int vaddr,u_int reg32,void *addr)
985 ll_add(head,vaddr,addr);
987 (*head)->reg32=reg32;
991 // Check if an address is already compiled
992 // but don't return addresses which are about to expire from the cache
993 void *check_addr(u_int vaddr)
995 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
996 if(ht_bin[0]==vaddr) {
997 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
998 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
1000 if(ht_bin[2]==vaddr) {
1001 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
1002 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
1004 u_int page=get_page(vaddr);
1005 struct ll_entry *head;
1008 if(head->vaddr==vaddr&&head->reg32==0) {
1009 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1010 // Update existing entry with current address
1011 if(ht_bin[0]==vaddr) {
1012 ht_bin[1]=(int)head->addr;
1015 if(ht_bin[2]==vaddr) {
1016 ht_bin[3]=(int)head->addr;
1019 // Insert into hash table with low priority.
1020 // Don't evict existing entries, as they are probably
1021 // addresses that are being accessed frequently.
1023 ht_bin[1]=(int)head->addr;
1025 }else if(ht_bin[2]==-1) {
1026 ht_bin[3]=(int)head->addr;
1037 void remove_hash(int vaddr)
1039 //printf("remove hash: %x\n",vaddr);
1040 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1041 if(ht_bin[2]==vaddr) {
1042 ht_bin[2]=ht_bin[3]=-1;
1044 if(ht_bin[0]==vaddr) {
1045 ht_bin[0]=ht_bin[2];
1046 ht_bin[1]=ht_bin[3];
1047 ht_bin[2]=ht_bin[3]=-1;
1051 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1053 struct ll_entry *next;
1055 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1056 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1058 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1059 remove_hash((*head)->vaddr);
1066 head=&((*head)->next);
1071 // Remove all entries from linked list
1072 void ll_clear(struct ll_entry **head)
1074 struct ll_entry *cur;
1075 struct ll_entry *next;
1086 // Dereference the pointers and remove if it matches
1087 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1090 int ptr=get_pointer(head->addr);
1091 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1092 if(((ptr>>shift)==(addr>>shift)) ||
1093 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1095 inv_debug("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1096 u_int host_addr=(u_int)kill_pointer(head->addr);
1098 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1105 // This is called when we write to a compiled block (see do_invstub)
1106 void invalidate_page(u_int page)
1108 struct ll_entry *head;
1109 struct ll_entry *next;
1113 inv_debug("INVALIDATE: %x\n",head->vaddr);
1114 remove_hash(head->vaddr);
1119 head=jump_out[page];
1122 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1123 u_int host_addr=(u_int)kill_pointer(head->addr);
1125 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1132 void invalidate_block(u_int block)
1134 u_int page=get_page(block<<12);
1135 u_int vpage=get_vpage(block<<12);
1136 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1137 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1140 struct ll_entry *head;
1141 head=jump_dirty[vpage];
1142 //printf("page=%d vpage=%d\n",page,vpage);
1145 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1146 get_bounds((int)head->addr,&start,&end);
1147 //printf("start: %x end: %x\n",start,end);
1148 if(page<2048&&start>=0x80000000&&end<0x80000000+RAM_SIZE) {
1149 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1150 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1151 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1155 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1156 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1157 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1158 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;
1165 //printf("first=%d last=%d\n",first,last);
1166 invalidate_page(page);
1167 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1168 assert(last<page+5);
1169 // Invalidate the adjacent pages if a block crosses a 4K boundary
1171 invalidate_page(first);
1174 for(first=page+1;first<last;first++) {
1175 invalidate_page(first);
1181 // Don't trap writes
1182 invalid_code[block]=1;
1184 // If there is a valid TLB entry for this page, remove write protect
1185 if(tlb_LUT_w[block]) {
1186 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1187 // CHECK: Is this right?
1188 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1189 u_int real_block=tlb_LUT_w[block]>>12;
1190 invalid_code[real_block]=1;
1191 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1193 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1197 memset(mini_ht,-1,sizeof(mini_ht));
1200 void invalidate_addr(u_int addr)
1202 invalidate_block(addr>>12);
1204 // This is called when loading a save state.
1205 // Anything could have changed, so invalidate everything.
1206 void invalidate_all_pages()
1209 for(page=0;page<4096;page++)
1210 invalidate_page(page);
1211 for(page=0;page<1048576;page++)
1212 if(!invalid_code[page]) {
1213 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1214 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1217 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1220 memset(mini_ht,-1,sizeof(mini_ht));
1224 for(page=0;page<0x100000;page++) {
1225 if(tlb_LUT_r[page]) {
1226 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1227 if(!tlb_LUT_w[page]||!invalid_code[page])
1228 memory_map[page]|=0x40000000; // Write protect
1230 else memory_map[page]=-1;
1231 if(page==0x80000) page=0xC0000;
1237 // Add an entry to jump_out after making a link
1238 void add_link(u_int vaddr,void *src)
1240 u_int page=get_page(vaddr);
1241 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1242 ll_add(jump_out+page,vaddr,src);
1243 //int ptr=get_pointer(src);
1244 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1247 // If a code block was found to be unmodified (bit was set in
1248 // restore_candidate) and it remains unmodified (bit is clear
1249 // in invalid_code) then move the entries for that 4K page from
1250 // the dirty list to the clean list.
1251 void clean_blocks(u_int page)
1253 struct ll_entry *head;
1254 inv_debug("INV: clean_blocks page=%d\n",page);
1255 head=jump_dirty[page];
1257 if(!invalid_code[head->vaddr>>12]) {
1258 // Don't restore blocks which are about to expire from the cache
1259 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1261 if(verify_dirty((int)head->addr)) {
1262 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1265 get_bounds((int)head->addr,&start,&end);
1266 if(start-(u_int)rdram<RAM_SIZE) {
1267 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1268 inv|=invalid_code[i];
1271 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1272 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1273 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1274 if(addr<start||addr>=end) inv=1;
1276 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1280 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1281 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1284 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1286 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1287 //printf("page=%x, addr=%x\n",page,head->vaddr);
1288 //assert(head->vaddr>>12==(page|0x80000));
1289 ll_add_32(jump_in+ppage,head->vaddr,head->reg32,clean_addr);
1290 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1292 if(ht_bin[0]==head->vaddr) {
1293 ht_bin[1]=(int)clean_addr; // Replace existing entry
1295 if(ht_bin[2]==head->vaddr) {
1296 ht_bin[3]=(int)clean_addr; // Replace existing entry
1309 void mov_alloc(struct regstat *current,int i)
1311 // Note: Don't need to actually alloc the source registers
1312 if((~current->is32>>rs1[i])&1) {
1313 //alloc_reg64(current,i,rs1[i]);
1314 alloc_reg64(current,i,rt1[i]);
1315 current->is32&=~(1LL<<rt1[i]);
1317 //alloc_reg(current,i,rs1[i]);
1318 alloc_reg(current,i,rt1[i]);
1319 current->is32|=(1LL<<rt1[i]);
1321 clear_const(current,rs1[i]);
1322 clear_const(current,rt1[i]);
1323 dirty_reg(current,rt1[i]);
1326 void shiftimm_alloc(struct regstat *current,int i)
1328 clear_const(current,rs1[i]);
1329 clear_const(current,rt1[i]);
1330 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1333 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1335 alloc_reg(current,i,rt1[i]);
1336 current->is32|=1LL<<rt1[i];
1337 dirty_reg(current,rt1[i]);
1340 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1343 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1344 alloc_reg64(current,i,rt1[i]);
1345 current->is32&=~(1LL<<rt1[i]);
1346 dirty_reg(current,rt1[i]);
1349 if(opcode2[i]==0x3c) // DSLL32
1352 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1353 alloc_reg64(current,i,rt1[i]);
1354 current->is32&=~(1LL<<rt1[i]);
1355 dirty_reg(current,rt1[i]);
1358 if(opcode2[i]==0x3e) // DSRL32
1361 alloc_reg64(current,i,rs1[i]);
1363 alloc_reg64(current,i,rt1[i]);
1364 current->is32&=~(1LL<<rt1[i]);
1366 alloc_reg(current,i,rt1[i]);
1367 current->is32|=1LL<<rt1[i];
1369 dirty_reg(current,rt1[i]);
1372 if(opcode2[i]==0x3f) // DSRA32
1375 alloc_reg64(current,i,rs1[i]);
1376 alloc_reg(current,i,rt1[i]);
1377 current->is32|=1LL<<rt1[i];
1378 dirty_reg(current,rt1[i]);
1383 void shift_alloc(struct regstat *current,int i)
1386 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1388 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1389 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1390 alloc_reg(current,i,rt1[i]);
1391 if(rt1[i]==rs2[i]) {
1392 alloc_reg_temp(current,i,-1);
1393 minimum_free_regs[i]=1;
1395 current->is32|=1LL<<rt1[i];
1396 } else { // DSLLV/DSRLV/DSRAV
1397 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1398 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1399 alloc_reg64(current,i,rt1[i]);
1400 current->is32&=~(1LL<<rt1[i]);
1401 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1403 alloc_reg_temp(current,i,-1);
1404 minimum_free_regs[i]=1;
1407 clear_const(current,rs1[i]);
1408 clear_const(current,rs2[i]);
1409 clear_const(current,rt1[i]);
1410 dirty_reg(current,rt1[i]);
1414 void alu_alloc(struct regstat *current,int i)
1416 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1418 if(rs1[i]&&rs2[i]) {
1419 alloc_reg(current,i,rs1[i]);
1420 alloc_reg(current,i,rs2[i]);
1423 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1424 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1426 alloc_reg(current,i,rt1[i]);
1428 current->is32|=1LL<<rt1[i];
1430 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1432 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1434 alloc_reg64(current,i,rs1[i]);
1435 alloc_reg64(current,i,rs2[i]);
1436 alloc_reg(current,i,rt1[i]);
1438 alloc_reg(current,i,rs1[i]);
1439 alloc_reg(current,i,rs2[i]);
1440 alloc_reg(current,i,rt1[i]);
1443 current->is32|=1LL<<rt1[i];
1445 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1447 if(rs1[i]&&rs2[i]) {
1448 alloc_reg(current,i,rs1[i]);
1449 alloc_reg(current,i,rs2[i]);
1453 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1454 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1456 alloc_reg(current,i,rt1[i]);
1457 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1459 if(!((current->uu>>rt1[i])&1)) {
1460 alloc_reg64(current,i,rt1[i]);
1462 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1463 if(rs1[i]&&rs2[i]) {
1464 alloc_reg64(current,i,rs1[i]);
1465 alloc_reg64(current,i,rs2[i]);
1469 // Is is really worth it to keep 64-bit values in registers?
1471 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1472 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1476 current->is32&=~(1LL<<rt1[i]);
1478 current->is32|=1LL<<rt1[i];
1482 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1484 if(rs1[i]&&rs2[i]) {
1485 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1486 alloc_reg64(current,i,rs1[i]);
1487 alloc_reg64(current,i,rs2[i]);
1488 alloc_reg64(current,i,rt1[i]);
1490 alloc_reg(current,i,rs1[i]);
1491 alloc_reg(current,i,rs2[i]);
1492 alloc_reg(current,i,rt1[i]);
1496 alloc_reg(current,i,rt1[i]);
1497 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1498 // DADD used as move, or zeroing
1499 // If we have a 64-bit source, then make the target 64 bits too
1500 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1501 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1502 alloc_reg64(current,i,rt1[i]);
1503 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1504 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1505 alloc_reg64(current,i,rt1[i]);
1507 if(opcode2[i]>=0x2e&&rs2[i]) {
1508 // DSUB used as negation - 64-bit result
1509 // If we have a 32-bit register, extend it to 64 bits
1510 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1511 alloc_reg64(current,i,rt1[i]);
1515 if(rs1[i]&&rs2[i]) {
1516 current->is32&=~(1LL<<rt1[i]);
1518 current->is32&=~(1LL<<rt1[i]);
1519 if((current->is32>>rs1[i])&1)
1520 current->is32|=1LL<<rt1[i];
1522 current->is32&=~(1LL<<rt1[i]);
1523 if((current->is32>>rs2[i])&1)
1524 current->is32|=1LL<<rt1[i];
1526 current->is32|=1LL<<rt1[i];
1530 clear_const(current,rs1[i]);
1531 clear_const(current,rs2[i]);
1532 clear_const(current,rt1[i]);
1533 dirty_reg(current,rt1[i]);
1536 void imm16_alloc(struct regstat *current,int i)
1538 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1540 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1541 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1542 current->is32&=~(1LL<<rt1[i]);
1543 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1544 // TODO: Could preserve the 32-bit flag if the immediate is zero
1545 alloc_reg64(current,i,rt1[i]);
1546 alloc_reg64(current,i,rs1[i]);
1548 clear_const(current,rs1[i]);
1549 clear_const(current,rt1[i]);
1551 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1552 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1553 current->is32|=1LL<<rt1[i];
1554 clear_const(current,rs1[i]);
1555 clear_const(current,rt1[i]);
1557 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1558 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1559 if(rs1[i]!=rt1[i]) {
1560 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1561 alloc_reg64(current,i,rt1[i]);
1562 current->is32&=~(1LL<<rt1[i]);
1565 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1566 if(is_const(current,rs1[i])) {
1567 int v=get_const(current,rs1[i]);
1568 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1569 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1570 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1572 else clear_const(current,rt1[i]);
1574 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1575 if(is_const(current,rs1[i])) {
1576 int v=get_const(current,rs1[i]);
1577 set_const(current,rt1[i],v+imm[i]);
1579 else clear_const(current,rt1[i]);
1580 current->is32|=1LL<<rt1[i];
1583 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1584 current->is32|=1LL<<rt1[i];
1586 dirty_reg(current,rt1[i]);
1589 void load_alloc(struct regstat *current,int i)
1591 clear_const(current,rt1[i]);
1592 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1593 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1594 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1596 alloc_reg(current,i,rt1[i]);
1597 if(get_reg(current->regmap,rt1[i])<0) {
1598 // dummy load, but we still need a register to calculate the address
1599 alloc_reg_temp(current,i,-1);
1600 minimum_free_regs[i]=1;
1602 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1604 current->is32&=~(1LL<<rt1[i]);
1605 alloc_reg64(current,i,rt1[i]);
1607 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1609 current->is32&=~(1LL<<rt1[i]);
1610 alloc_reg64(current,i,rt1[i]);
1611 alloc_all(current,i);
1612 alloc_reg64(current,i,FTEMP);
1613 minimum_free_regs[i]=HOST_REGS;
1615 else current->is32|=1LL<<rt1[i];
1616 dirty_reg(current,rt1[i]);
1617 // If using TLB, need a register for pointer to the mapping table
1618 if(using_tlb) alloc_reg(current,i,TLREG);
1619 // LWL/LWR need a temporary register for the old value
1620 if(opcode[i]==0x22||opcode[i]==0x26)
1622 alloc_reg(current,i,FTEMP);
1623 alloc_reg_temp(current,i,-1);
1624 minimum_free_regs[i]=1;
1629 // Load to r0 (dummy load)
1630 // but we still need a register to calculate the address
1631 if(opcode[i]==0x22||opcode[i]==0x26)
1633 alloc_reg(current,i,FTEMP); // LWL/LWR need another temporary
1635 alloc_reg_temp(current,i,-1);
1636 minimum_free_regs[i]=1;
1637 if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1639 alloc_all(current,i);
1640 alloc_reg64(current,i,FTEMP);
1641 minimum_free_regs[i]=HOST_REGS;
1646 void store_alloc(struct regstat *current,int i)
1648 clear_const(current,rs2[i]);
1649 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1650 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1651 alloc_reg(current,i,rs2[i]);
1652 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1653 alloc_reg64(current,i,rs2[i]);
1654 if(rs2[i]) alloc_reg(current,i,FTEMP);
1656 // If using TLB, need a register for pointer to the mapping table
1657 if(using_tlb) alloc_reg(current,i,TLREG);
1658 #if defined(HOST_IMM8)
1659 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1660 else alloc_reg(current,i,INVCP);
1662 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1663 alloc_reg(current,i,FTEMP);
1665 // We need a temporary register for address generation
1666 alloc_reg_temp(current,i,-1);
1667 minimum_free_regs[i]=1;
1670 void c1ls_alloc(struct regstat *current,int i)
1672 //clear_const(current,rs1[i]); // FIXME
1673 clear_const(current,rt1[i]);
1674 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1675 alloc_reg(current,i,CSREG); // Status
1676 alloc_reg(current,i,FTEMP);
1677 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1678 alloc_reg64(current,i,FTEMP);
1680 // If using TLB, need a register for pointer to the mapping table
1681 if(using_tlb) alloc_reg(current,i,TLREG);
1682 #if defined(HOST_IMM8)
1683 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1684 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1685 alloc_reg(current,i,INVCP);
1687 // We need a temporary register for address generation
1688 alloc_reg_temp(current,i,-1);
1691 void c2ls_alloc(struct regstat *current,int i)
1693 clear_const(current,rt1[i]);
1694 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1695 alloc_reg(current,i,FTEMP);
1696 // If using TLB, need a register for pointer to the mapping table
1697 if(using_tlb) alloc_reg(current,i,TLREG);
1698 #if defined(HOST_IMM8)
1699 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1700 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1701 alloc_reg(current,i,INVCP);
1703 // We need a temporary register for address generation
1704 alloc_reg_temp(current,i,-1);
1705 minimum_free_regs[i]=1;
1708 #ifndef multdiv_alloc
1709 void multdiv_alloc(struct regstat *current,int i)
1716 // case 0x1D: DMULTU
1719 clear_const(current,rs1[i]);
1720 clear_const(current,rs2[i]);
1723 if((opcode2[i]&4)==0) // 32-bit
1725 current->u&=~(1LL<<HIREG);
1726 current->u&=~(1LL<<LOREG);
1727 alloc_reg(current,i,HIREG);
1728 alloc_reg(current,i,LOREG);
1729 alloc_reg(current,i,rs1[i]);
1730 alloc_reg(current,i,rs2[i]);
1731 current->is32|=1LL<<HIREG;
1732 current->is32|=1LL<<LOREG;
1733 dirty_reg(current,HIREG);
1734 dirty_reg(current,LOREG);
1738 current->u&=~(1LL<<HIREG);
1739 current->u&=~(1LL<<LOREG);
1740 current->uu&=~(1LL<<HIREG);
1741 current->uu&=~(1LL<<LOREG);
1742 alloc_reg64(current,i,HIREG);
1743 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1744 alloc_reg64(current,i,rs1[i]);
1745 alloc_reg64(current,i,rs2[i]);
1746 alloc_all(current,i);
1747 current->is32&=~(1LL<<HIREG);
1748 current->is32&=~(1LL<<LOREG);
1749 dirty_reg(current,HIREG);
1750 dirty_reg(current,LOREG);
1751 minimum_free_regs[i]=HOST_REGS;
1756 // Multiply by zero is zero.
1757 // MIPS does not have a divide by zero exception.
1758 // The result is undefined, we return zero.
1759 alloc_reg(current,i,HIREG);
1760 alloc_reg(current,i,LOREG);
1761 current->is32|=1LL<<HIREG;
1762 current->is32|=1LL<<LOREG;
1763 dirty_reg(current,HIREG);
1764 dirty_reg(current,LOREG);
1769 void cop0_alloc(struct regstat *current,int i)
1771 if(opcode2[i]==0) // MFC0
1774 clear_const(current,rt1[i]);
1775 alloc_all(current,i);
1776 alloc_reg(current,i,rt1[i]);
1777 current->is32|=1LL<<rt1[i];
1778 dirty_reg(current,rt1[i]);
1781 else if(opcode2[i]==4) // MTC0
1784 clear_const(current,rs1[i]);
1785 alloc_reg(current,i,rs1[i]);
1786 alloc_all(current,i);
1789 alloc_all(current,i); // FIXME: Keep r0
1791 alloc_reg(current,i,0);
1796 // TLBR/TLBWI/TLBWR/TLBP/ERET
1797 assert(opcode2[i]==0x10);
1798 alloc_all(current,i);
1800 minimum_free_regs[i]=HOST_REGS;
1803 void cop1_alloc(struct regstat *current,int i)
1805 alloc_reg(current,i,CSREG); // Load status
1806 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1809 clear_const(current,rt1[i]);
1811 alloc_reg64(current,i,rt1[i]); // DMFC1
1812 current->is32&=~(1LL<<rt1[i]);
1814 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1815 current->is32|=1LL<<rt1[i];
1817 dirty_reg(current,rt1[i]);
1819 alloc_reg_temp(current,i,-1);
1821 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1824 clear_const(current,rs1[i]);
1826 alloc_reg64(current,i,rs1[i]); // DMTC1
1828 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1829 alloc_reg_temp(current,i,-1);
1833 alloc_reg(current,i,0);
1834 alloc_reg_temp(current,i,-1);
1837 minimum_free_regs[i]=1;
1839 void fconv_alloc(struct regstat *current,int i)
1841 alloc_reg(current,i,CSREG); // Load status
1842 alloc_reg_temp(current,i,-1);
1843 minimum_free_regs[i]=1;
1845 void float_alloc(struct regstat *current,int i)
1847 alloc_reg(current,i,CSREG); // Load status
1848 alloc_reg_temp(current,i,-1);
1849 minimum_free_regs[i]=1;
1851 void c2op_alloc(struct regstat *current,int i)
1853 alloc_reg_temp(current,i,-1);
1855 void fcomp_alloc(struct regstat *current,int i)
1857 alloc_reg(current,i,CSREG); // Load status
1858 alloc_reg(current,i,FSREG); // Load flags
1859 dirty_reg(current,FSREG); // Flag will be modified
1860 alloc_reg_temp(current,i,-1);
1861 minimum_free_regs[i]=1;
1864 void syscall_alloc(struct regstat *current,int i)
1866 alloc_cc(current,i);
1867 dirty_reg(current,CCREG);
1868 alloc_all(current,i);
1869 minimum_free_regs[i]=HOST_REGS;
1873 void delayslot_alloc(struct regstat *current,int i)
1884 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1885 printf("Disabled speculative precompilation\n");
1889 imm16_alloc(current,i);
1893 load_alloc(current,i);
1897 store_alloc(current,i);
1900 alu_alloc(current,i);
1903 shift_alloc(current,i);
1906 multdiv_alloc(current,i);
1909 shiftimm_alloc(current,i);
1912 mov_alloc(current,i);
1915 cop0_alloc(current,i);
1919 cop1_alloc(current,i);
1922 c1ls_alloc(current,i);
1925 c2ls_alloc(current,i);
1928 fconv_alloc(current,i);
1931 float_alloc(current,i);
1934 fcomp_alloc(current,i);
1937 c2op_alloc(current,i);
1942 // Special case where a branch and delay slot span two pages in virtual memory
1943 static void pagespan_alloc(struct regstat *current,int i)
1946 current->wasconst=0;
1948 minimum_free_regs[i]=HOST_REGS;
1949 alloc_all(current,i);
1950 alloc_cc(current,i);
1951 dirty_reg(current,CCREG);
1952 if(opcode[i]==3) // JAL
1954 alloc_reg(current,i,31);
1955 dirty_reg(current,31);
1957 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
1959 alloc_reg(current,i,rs1[i]);
1961 alloc_reg(current,i,rt1[i]);
1962 dirty_reg(current,rt1[i]);
1965 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
1967 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1968 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1969 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1971 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1972 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
1976 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
1978 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1979 if(!((current->is32>>rs1[i])&1))
1981 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1985 if(opcode[i]==0x11) // BC1
1987 alloc_reg(current,i,FSREG);
1988 alloc_reg(current,i,CSREG);
1993 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
1995 stubs[stubcount][0]=type;
1996 stubs[stubcount][1]=addr;
1997 stubs[stubcount][2]=retaddr;
1998 stubs[stubcount][3]=a;
1999 stubs[stubcount][4]=b;
2000 stubs[stubcount][5]=c;
2001 stubs[stubcount][6]=d;
2002 stubs[stubcount][7]=e;
2006 // Write out a single register
2007 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
2010 for(hr=0;hr<HOST_REGS;hr++) {
2011 if(hr!=EXCLUDE_REG) {
2012 if((regmap[hr]&63)==r) {
2015 emit_storereg(r,hr);
2017 if((is32>>regmap[hr])&1) {
2018 emit_sarimm(hr,31,hr);
2019 emit_storereg(r|64,hr);
2023 emit_storereg(r|64,hr);
2033 //if(!tracedebug) return 0;
2036 for(i=0;i<2097152;i++) {
2037 unsigned int temp=sum;
2040 sum^=((u_int *)rdram)[i];
2049 sum^=((u_int *)reg)[i];
2057 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2059 #ifndef DISABLE_COP1
2062 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2072 void memdebug(int i)
2074 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2075 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2078 //if(Count>=-2084597794) {
2079 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2081 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2082 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2083 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2086 printf("TRACE: %x\n",(&i)[-1]);
2090 printf("TRACE: %x \n",(&j)[10]);
2091 printf("TRACE: %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x %x\n",(&j)[1],(&j)[2],(&j)[3],(&j)[4],(&j)[5],(&j)[6],(&j)[7],(&j)[8],(&j)[9],(&j)[10],(&j)[11],(&j)[12],(&j)[13],(&j)[14],(&j)[15],(&j)[16],(&j)[17],(&j)[18],(&j)[19],(&j)[20]);
2095 //printf("TRACE: %x\n",(&i)[-1]);
2098 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2100 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2103 void alu_assemble(int i,struct regstat *i_regs)
2105 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2107 signed char s1,s2,t;
2108 t=get_reg(i_regs->regmap,rt1[i]);
2110 s1=get_reg(i_regs->regmap,rs1[i]);
2111 s2=get_reg(i_regs->regmap,rs2[i]);
2112 if(rs1[i]&&rs2[i]) {
2115 if(opcode2[i]&2) emit_sub(s1,s2,t);
2116 else emit_add(s1,s2,t);
2119 if(s1>=0) emit_mov(s1,t);
2120 else emit_loadreg(rs1[i],t);
2124 if(opcode2[i]&2) emit_neg(s2,t);
2125 else emit_mov(s2,t);
2128 emit_loadreg(rs2[i],t);
2129 if(opcode2[i]&2) emit_neg(t,t);
2132 else emit_zeroreg(t);
2136 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2138 signed char s1l,s2l,s1h,s2h,tl,th;
2139 tl=get_reg(i_regs->regmap,rt1[i]);
2140 th=get_reg(i_regs->regmap,rt1[i]|64);
2142 s1l=get_reg(i_regs->regmap,rs1[i]);
2143 s2l=get_reg(i_regs->regmap,rs2[i]);
2144 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2145 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2146 if(rs1[i]&&rs2[i]) {
2149 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2150 else emit_adds(s1l,s2l,tl);
2152 #ifdef INVERTED_CARRY
2153 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2155 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2157 else emit_add(s1h,s2h,th);
2161 if(s1l>=0) emit_mov(s1l,tl);
2162 else emit_loadreg(rs1[i],tl);
2164 if(s1h>=0) emit_mov(s1h,th);
2165 else emit_loadreg(rs1[i]|64,th);
2170 if(opcode2[i]&2) emit_negs(s2l,tl);
2171 else emit_mov(s2l,tl);
2174 emit_loadreg(rs2[i],tl);
2175 if(opcode2[i]&2) emit_negs(tl,tl);
2178 #ifdef INVERTED_CARRY
2179 if(s2h>=0) emit_mov(s2h,th);
2180 else emit_loadreg(rs2[i]|64,th);
2182 emit_adcimm(-1,th); // x86 has inverted carry flag
2187 if(s2h>=0) emit_rscimm(s2h,0,th);
2189 emit_loadreg(rs2[i]|64,th);
2190 emit_rscimm(th,0,th);
2193 if(s2h>=0) emit_mov(s2h,th);
2194 else emit_loadreg(rs2[i]|64,th);
2201 if(th>=0) emit_zeroreg(th);
2206 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2208 signed char s1l,s1h,s2l,s2h,t;
2209 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2211 t=get_reg(i_regs->regmap,rt1[i]);
2214 s1l=get_reg(i_regs->regmap,rs1[i]);
2215 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2216 s2l=get_reg(i_regs->regmap,rs2[i]);
2217 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2218 if(rs2[i]==0) // rx<r0
2221 if(opcode2[i]==0x2a) // SLT
2222 emit_shrimm(s1h,31,t);
2223 else // SLTU (unsigned can not be less than zero)
2226 else if(rs1[i]==0) // r0<rx
2229 if(opcode2[i]==0x2a) // SLT
2230 emit_set_gz64_32(s2h,s2l,t);
2231 else // SLTU (set if not zero)
2232 emit_set_nz64_32(s2h,s2l,t);
2235 assert(s1l>=0);assert(s1h>=0);
2236 assert(s2l>=0);assert(s2h>=0);
2237 if(opcode2[i]==0x2a) // SLT
2238 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2240 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2244 t=get_reg(i_regs->regmap,rt1[i]);
2247 s1l=get_reg(i_regs->regmap,rs1[i]);
2248 s2l=get_reg(i_regs->regmap,rs2[i]);
2249 if(rs2[i]==0) // rx<r0
2252 if(opcode2[i]==0x2a) // SLT
2253 emit_shrimm(s1l,31,t);
2254 else // SLTU (unsigned can not be less than zero)
2257 else if(rs1[i]==0) // r0<rx
2260 if(opcode2[i]==0x2a) // SLT
2261 emit_set_gz32(s2l,t);
2262 else // SLTU (set if not zero)
2263 emit_set_nz32(s2l,t);
2266 assert(s1l>=0);assert(s2l>=0);
2267 if(opcode2[i]==0x2a) // SLT
2268 emit_set_if_less32(s1l,s2l,t);
2270 emit_set_if_carry32(s1l,s2l,t);
2276 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2278 signed char s1l,s1h,s2l,s2h,th,tl;
2279 tl=get_reg(i_regs->regmap,rt1[i]);
2280 th=get_reg(i_regs->regmap,rt1[i]|64);
2281 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2285 s1l=get_reg(i_regs->regmap,rs1[i]);
2286 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2287 s2l=get_reg(i_regs->regmap,rs2[i]);
2288 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2289 if(rs1[i]&&rs2[i]) {
2290 assert(s1l>=0);assert(s1h>=0);
2291 assert(s2l>=0);assert(s2h>=0);
2292 if(opcode2[i]==0x24) { // AND
2293 emit_and(s1l,s2l,tl);
2294 emit_and(s1h,s2h,th);
2296 if(opcode2[i]==0x25) { // OR
2297 emit_or(s1l,s2l,tl);
2298 emit_or(s1h,s2h,th);
2300 if(opcode2[i]==0x26) { // XOR
2301 emit_xor(s1l,s2l,tl);
2302 emit_xor(s1h,s2h,th);
2304 if(opcode2[i]==0x27) { // NOR
2305 emit_or(s1l,s2l,tl);
2306 emit_or(s1h,s2h,th);
2313 if(opcode2[i]==0x24) { // AND
2317 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2319 if(s1l>=0) emit_mov(s1l,tl);
2320 else emit_loadreg(rs1[i],tl);
2321 if(s1h>=0) emit_mov(s1h,th);
2322 else emit_loadreg(rs1[i]|64,th);
2326 if(s2l>=0) emit_mov(s2l,tl);
2327 else emit_loadreg(rs2[i],tl);
2328 if(s2h>=0) emit_mov(s2h,th);
2329 else emit_loadreg(rs2[i]|64,th);
2336 if(opcode2[i]==0x27) { // NOR
2338 if(s1l>=0) emit_not(s1l,tl);
2340 emit_loadreg(rs1[i],tl);
2343 if(s1h>=0) emit_not(s1h,th);
2345 emit_loadreg(rs1[i]|64,th);
2351 if(s2l>=0) emit_not(s2l,tl);
2353 emit_loadreg(rs2[i],tl);
2356 if(s2h>=0) emit_not(s2h,th);
2358 emit_loadreg(rs2[i]|64,th);
2374 s1l=get_reg(i_regs->regmap,rs1[i]);
2375 s2l=get_reg(i_regs->regmap,rs2[i]);
2376 if(rs1[i]&&rs2[i]) {
2379 if(opcode2[i]==0x24) { // AND
2380 emit_and(s1l,s2l,tl);
2382 if(opcode2[i]==0x25) { // OR
2383 emit_or(s1l,s2l,tl);
2385 if(opcode2[i]==0x26) { // XOR
2386 emit_xor(s1l,s2l,tl);
2388 if(opcode2[i]==0x27) { // NOR
2389 emit_or(s1l,s2l,tl);
2395 if(opcode2[i]==0x24) { // AND
2398 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2400 if(s1l>=0) emit_mov(s1l,tl);
2401 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2405 if(s2l>=0) emit_mov(s2l,tl);
2406 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2408 else emit_zeroreg(tl);
2410 if(opcode2[i]==0x27) { // NOR
2412 if(s1l>=0) emit_not(s1l,tl);
2414 emit_loadreg(rs1[i],tl);
2420 if(s2l>=0) emit_not(s2l,tl);
2422 emit_loadreg(rs2[i],tl);
2426 else emit_movimm(-1,tl);
2435 void imm16_assemble(int i,struct regstat *i_regs)
2437 if (opcode[i]==0x0f) { // LUI
2440 t=get_reg(i_regs->regmap,rt1[i]);
2443 if(!((i_regs->isconst>>t)&1))
2444 emit_movimm(imm[i]<<16,t);
2448 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2451 t=get_reg(i_regs->regmap,rt1[i]);
2452 s=get_reg(i_regs->regmap,rs1[i]);
2457 if(!((i_regs->isconst>>t)&1)) {
2459 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2460 emit_addimm(t,imm[i],t);
2462 if(!((i_regs->wasconst>>s)&1))
2463 emit_addimm(s,imm[i],t);
2465 emit_movimm(constmap[i][s]+imm[i],t);
2471 if(!((i_regs->isconst>>t)&1))
2472 emit_movimm(imm[i],t);
2477 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2479 signed char sh,sl,th,tl;
2480 th=get_reg(i_regs->regmap,rt1[i]|64);
2481 tl=get_reg(i_regs->regmap,rt1[i]);
2482 sh=get_reg(i_regs->regmap,rs1[i]|64);
2483 sl=get_reg(i_regs->regmap,rs1[i]);
2489 emit_addimm64_32(sh,sl,imm[i],th,tl);
2492 emit_addimm(sl,imm[i],tl);
2495 emit_movimm(imm[i],tl);
2496 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2501 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2503 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2504 signed char sh,sl,t;
2505 t=get_reg(i_regs->regmap,rt1[i]);
2506 sh=get_reg(i_regs->regmap,rs1[i]|64);
2507 sl=get_reg(i_regs->regmap,rs1[i]);
2511 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2512 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2513 if(opcode[i]==0x0a) { // SLTI
2515 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2516 emit_slti32(t,imm[i],t);
2518 emit_slti32(sl,imm[i],t);
2523 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2524 emit_sltiu32(t,imm[i],t);
2526 emit_sltiu32(sl,imm[i],t);
2531 if(opcode[i]==0x0a) // SLTI
2532 emit_slti64_32(sh,sl,imm[i],t);
2534 emit_sltiu64_32(sh,sl,imm[i],t);
2537 // SLTI(U) with r0 is just stupid,
2538 // nonetheless examples can be found
2539 if(opcode[i]==0x0a) // SLTI
2540 if(0<imm[i]) emit_movimm(1,t);
2541 else emit_zeroreg(t);
2544 if(imm[i]) emit_movimm(1,t);
2545 else emit_zeroreg(t);
2551 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2553 signed char sh,sl,th,tl;
2554 th=get_reg(i_regs->regmap,rt1[i]|64);
2555 tl=get_reg(i_regs->regmap,rt1[i]);
2556 sh=get_reg(i_regs->regmap,rs1[i]|64);
2557 sl=get_reg(i_regs->regmap,rs1[i]);
2558 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2559 if(opcode[i]==0x0c) //ANDI
2563 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2564 emit_andimm(tl,imm[i],tl);
2566 if(!((i_regs->wasconst>>sl)&1))
2567 emit_andimm(sl,imm[i],tl);
2569 emit_movimm(constmap[i][sl]&imm[i],tl);
2574 if(th>=0) emit_zeroreg(th);
2580 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2584 emit_loadreg(rs1[i]|64,th);
2589 if(opcode[i]==0x0d) //ORI
2591 emit_orimm(tl,imm[i],tl);
2593 if(!((i_regs->wasconst>>sl)&1))
2594 emit_orimm(sl,imm[i],tl);
2596 emit_movimm(constmap[i][sl]|imm[i],tl);
2598 if(opcode[i]==0x0e) //XORI
2600 emit_xorimm(tl,imm[i],tl);
2602 if(!((i_regs->wasconst>>sl)&1))
2603 emit_xorimm(sl,imm[i],tl);
2605 emit_movimm(constmap[i][sl]^imm[i],tl);
2609 emit_movimm(imm[i],tl);
2610 if(th>=0) emit_zeroreg(th);
2618 void shiftimm_assemble(int i,struct regstat *i_regs)
2620 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2624 t=get_reg(i_regs->regmap,rt1[i]);
2625 s=get_reg(i_regs->regmap,rs1[i]);
2634 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2636 if(opcode2[i]==0) // SLL
2638 emit_shlimm(s<0?t:s,imm[i],t);
2640 if(opcode2[i]==2) // SRL
2642 emit_shrimm(s<0?t:s,imm[i],t);
2644 if(opcode2[i]==3) // SRA
2646 emit_sarimm(s<0?t:s,imm[i],t);
2650 if(s>=0 && s!=t) emit_mov(s,t);
2654 //emit_storereg(rt1[i],t); //DEBUG
2657 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2660 signed char sh,sl,th,tl;
2661 th=get_reg(i_regs->regmap,rt1[i]|64);
2662 tl=get_reg(i_regs->regmap,rt1[i]);
2663 sh=get_reg(i_regs->regmap,rs1[i]|64);
2664 sl=get_reg(i_regs->regmap,rs1[i]);
2669 if(th>=0) emit_zeroreg(th);
2676 if(opcode2[i]==0x38) // DSLL
2678 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2679 emit_shlimm(sl,imm[i],tl);
2681 if(opcode2[i]==0x3a) // DSRL
2683 emit_shrdimm(sl,sh,imm[i],tl);
2684 if(th>=0) emit_shrimm(sh,imm[i],th);
2686 if(opcode2[i]==0x3b) // DSRA
2688 emit_shrdimm(sl,sh,imm[i],tl);
2689 if(th>=0) emit_sarimm(sh,imm[i],th);
2693 if(sl!=tl) emit_mov(sl,tl);
2694 if(th>=0&&sh!=th) emit_mov(sh,th);
2700 if(opcode2[i]==0x3c) // DSLL32
2703 signed char sl,tl,th;
2704 tl=get_reg(i_regs->regmap,rt1[i]);
2705 th=get_reg(i_regs->regmap,rt1[i]|64);
2706 sl=get_reg(i_regs->regmap,rs1[i]);
2715 emit_shlimm(th,imm[i]&31,th);
2720 if(opcode2[i]==0x3e) // DSRL32
2723 signed char sh,tl,th;
2724 tl=get_reg(i_regs->regmap,rt1[i]);
2725 th=get_reg(i_regs->regmap,rt1[i]|64);
2726 sh=get_reg(i_regs->regmap,rs1[i]|64);
2730 if(th>=0) emit_zeroreg(th);
2733 emit_shrimm(tl,imm[i]&31,tl);
2738 if(opcode2[i]==0x3f) // DSRA32
2742 tl=get_reg(i_regs->regmap,rt1[i]);
2743 sh=get_reg(i_regs->regmap,rs1[i]|64);
2749 emit_sarimm(tl,imm[i]&31,tl);
2756 #ifndef shift_assemble
2757 void shift_assemble(int i,struct regstat *i_regs)
2759 printf("Need shift_assemble for this architecture.\n");
2764 void load_assemble(int i,struct regstat *i_regs)
2766 int s,th,tl,addr,map=-1;
2769 int memtarget=0,c=0;
2771 th=get_reg(i_regs->regmap,rt1[i]|64);
2772 tl=get_reg(i_regs->regmap,rt1[i]);
2773 s=get_reg(i_regs->regmap,rs1[i]);
2775 for(hr=0;hr<HOST_REGS;hr++) {
2776 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2778 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2780 c=(i_regs->wasconst>>s)&1;
2781 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2782 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2784 //printf("load_assemble: c=%d\n",c);
2785 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2786 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2788 if(tl<0&&(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80)
2790 // could be FIFO, must perform the read
2792 assem_debug("(forced read)\n");
2793 tl=get_reg(i_regs->regmap,-1);
2797 if(offset||s<0||c) addr=tl;
2799 //if(tl<0) tl=get_reg(i_regs->regmap,-1);
2801 //printf("load_assemble: c=%d\n",c);
2802 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2803 assert(tl>=0); // Even if the load is a NOP, we must check for pagefaults and I/O
2805 if(th>=0) reglist&=~(1<<th);
2809 map=get_reg(i_regs->regmap,ROREG);
2810 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
2812 //#define R29_HACK 1
2814 // Strmnnrmn's speed hack
2815 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2818 emit_cmpimm(addr,RAM_SIZE);
2820 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
2821 // Hint to branch predictor that the branch is unlikely to be taken
2823 emit_jno_unlikely(0);
2831 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2832 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2833 map=get_reg(i_regs->regmap,TLREG);
2835 map=do_tlb_r(addr,tl,map,x,-1,-1,c,constmap[i][s]+offset);
2836 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr);
2838 int dummy=(rt1[i]==0)||(tl!=get_reg(i_regs->regmap,rt1[i])); // ignore loads to r0 and unneeded reg
2839 if (opcode[i]==0x20) { // LB
2842 #ifdef HOST_IMM_ADDR32
2844 emit_movsbl_tlb((constmap[i][s]+offset)^3,map,tl);
2848 //emit_xorimm(addr,3,tl);
2849 //gen_tlb_addr_r(tl,map);
2850 //emit_movsbl_indexed((int)rdram-0x80000000,tl,tl);
2852 #ifdef BIG_ENDIAN_MIPS
2853 if(!c) emit_xorimm(addr,3,tl);
2854 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2858 emit_movsbl_indexed_tlb(x,a,map,tl);
2862 add_stub(LOADB_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2865 inline_readstub(LOADB_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2867 if (opcode[i]==0x21) { // LH
2870 #ifdef HOST_IMM_ADDR32
2872 emit_movswl_tlb((constmap[i][s]+offset)^2,map,tl);
2877 #ifdef BIG_ENDIAN_MIPS
2878 if(!c) emit_xorimm(addr,2,tl);
2879 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2884 //emit_movswl_indexed_tlb(x,tl,map,tl);
2887 gen_tlb_addr_r(a,map);
2888 emit_movswl_indexed(x,a,tl);
2891 emit_movswl_indexed(x,a,tl);
2893 emit_movswl_indexed((int)rdram-0x80000000+x,a,tl);
2899 add_stub(LOADH_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2902 inline_readstub(LOADH_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2904 if (opcode[i]==0x23) { // LW
2907 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2908 #ifdef HOST_IMM_ADDR32
2910 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2913 emit_readword_indexed_tlb(0,addr,map,tl);
2916 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2919 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2921 if (opcode[i]==0x24) { // LBU
2924 #ifdef HOST_IMM_ADDR32
2926 emit_movzbl_tlb((constmap[i][s]+offset)^3,map,tl);
2930 //emit_xorimm(addr,3,tl);
2931 //gen_tlb_addr_r(tl,map);
2932 //emit_movzbl_indexed((int)rdram-0x80000000,tl,tl);
2934 #ifdef BIG_ENDIAN_MIPS
2935 if(!c) emit_xorimm(addr,3,tl);
2936 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2940 emit_movzbl_indexed_tlb(x,a,map,tl);
2944 add_stub(LOADBU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2947 inline_readstub(LOADBU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2949 if (opcode[i]==0x25) { // LHU
2952 #ifdef HOST_IMM_ADDR32
2954 emit_movzwl_tlb((constmap[i][s]+offset)^2,map,tl);
2959 #ifdef BIG_ENDIAN_MIPS
2960 if(!c) emit_xorimm(addr,2,tl);
2961 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2966 //emit_movzwl_indexed_tlb(x,tl,map,tl);
2969 gen_tlb_addr_r(a,map);
2970 emit_movzwl_indexed(x,a,tl);
2973 emit_movzwl_indexed(x,a,tl);
2975 emit_movzwl_indexed((int)rdram-0x80000000+x,a,tl);
2981 add_stub(LOADHU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2984 inline_readstub(LOADHU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2986 if (opcode[i]==0x27) { // LWU
2990 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2991 #ifdef HOST_IMM_ADDR32
2993 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2996 emit_readword_indexed_tlb(0,addr,map,tl);
2999 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3002 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3006 if (opcode[i]==0x37) { // LD
3009 //gen_tlb_addr_r(tl,map);
3010 //if(th>=0) emit_readword_indexed((int)rdram-0x80000000,addr,th);
3011 //emit_readword_indexed((int)rdram-0x7FFFFFFC,addr,tl);
3012 #ifdef HOST_IMM_ADDR32
3014 emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3017 emit_readdword_indexed_tlb(0,addr,map,th,tl);
3020 add_stub(LOADD_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3023 inline_readstub(LOADD_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3026 //emit_storereg(rt1[i],tl); // DEBUG
3027 //if(opcode[i]==0x23)
3028 //if(opcode[i]==0x24)
3029 //if(opcode[i]==0x23||opcode[i]==0x24)
3030 /*if(opcode[i]==0x21||opcode[i]==0x23||opcode[i]==0x24)
3034 emit_readword((int)&last_count,ECX);
3036 if(get_reg(i_regs->regmap,CCREG)<0)
3037 emit_loadreg(CCREG,HOST_CCREG);
3038 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3039 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3040 emit_writeword(HOST_CCREG,(int)&Count);
3043 if(get_reg(i_regs->regmap,CCREG)<0)
3044 emit_loadreg(CCREG,0);
3046 emit_mov(HOST_CCREG,0);
3048 emit_addimm(0,2*ccadj[i],0);
3049 emit_writeword(0,(int)&Count);
3051 emit_call((int)memdebug);
3053 restore_regs(0x100f);
3057 #ifndef loadlr_assemble
3058 void loadlr_assemble(int i,struct regstat *i_regs)
3060 printf("Need loadlr_assemble for this architecture.\n");
3065 void store_assemble(int i,struct regstat *i_regs)
3070 int jaddr=0,jaddr2,type;
3071 int memtarget=0,c=0;
3072 int agr=AGEN1+(i&1);
3074 th=get_reg(i_regs->regmap,rs2[i]|64);
3075 tl=get_reg(i_regs->regmap,rs2[i]);
3076 s=get_reg(i_regs->regmap,rs1[i]);
3077 temp=get_reg(i_regs->regmap,agr);
3078 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3081 c=(i_regs->wasconst>>s)&1;
3082 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3083 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3087 for(hr=0;hr<HOST_REGS;hr++) {
3088 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3090 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3091 if(offset||s<0||c) addr=temp;
3096 // Strmnnrmn's speed hack
3098 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3100 emit_cmpimm(addr,RAM_SIZE);
3101 #ifdef DESTRUCTIVE_SHIFT
3102 if(s==addr) emit_mov(s,temp);
3105 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3109 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
3110 // Hint to branch predictor that the branch is unlikely to be taken
3112 emit_jno_unlikely(0);
3120 if (opcode[i]==0x28) x=3; // SB
3121 if (opcode[i]==0x29) x=2; // SH
3122 map=get_reg(i_regs->regmap,TLREG);
3124 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3125 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3128 if (opcode[i]==0x28) { // SB
3131 #ifdef BIG_ENDIAN_MIPS
3132 if(!c) emit_xorimm(addr,3,temp);
3133 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3135 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
3136 else if (addr!=temp) emit_mov(addr,temp);
3138 //gen_tlb_addr_w(temp,map);
3139 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3140 emit_writebyte_indexed_tlb(tl,x,temp,map,temp);
3144 if (opcode[i]==0x29) { // SH
3147 #ifdef BIG_ENDIAN_MIPS
3148 if(!c) emit_xorimm(addr,2,temp);
3149 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3151 if(c) x=(constmap[i][s]+offset)-(constmap[i][s]+offset);
3152 else if (addr!=temp) emit_mov(addr,temp);
3155 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3158 gen_tlb_addr_w(temp,map);
3159 emit_writehword_indexed(tl,x,temp);
3161 emit_writehword_indexed(tl,(int)rdram-0x80000000+x,temp);
3165 if (opcode[i]==0x2B) { // SW
3167 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3168 emit_writeword_indexed_tlb(tl,0,addr,map,temp);
3171 if (opcode[i]==0x3F) { // SD
3175 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3176 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3177 emit_writedword_indexed_tlb(th,tl,0,addr,map,temp);
3180 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3181 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3182 emit_writedword_indexed_tlb(tl,tl,0,addr,map,temp);
3187 if(!using_tlb&&(!c||memtarget))
3188 // addr could be a temp, make sure it survives STORE*_STUB
3191 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3192 } else if(!memtarget) {
3193 inline_writestub(type,i,constmap[i][s]+offset,i_regs->regmap,rs2[i],ccadj[i],reglist);
3197 #ifdef DESTRUCTIVE_SHIFT
3198 // The x86 shift operation is 'destructive'; it overwrites the
3199 // source register, so we need to make a copy first and use that.
3202 #if defined(HOST_IMM8)
3203 int ir=get_reg(i_regs->regmap,INVCP);
3205 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3207 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3211 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3214 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3215 //if(opcode[i]==0x2B || opcode[i]==0x28)
3216 //if(opcode[i]==0x2B || opcode[i]==0x29)
3217 //if(opcode[i]==0x2B)
3218 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3222 emit_readword((int)&last_count,ECX);
3224 if(get_reg(i_regs->regmap,CCREG)<0)
3225 emit_loadreg(CCREG,HOST_CCREG);
3226 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3227 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3228 emit_writeword(HOST_CCREG,(int)&Count);
3231 if(get_reg(i_regs->regmap,CCREG)<0)
3232 emit_loadreg(CCREG,0);
3234 emit_mov(HOST_CCREG,0);
3236 emit_addimm(0,2*ccadj[i],0);
3237 emit_writeword(0,(int)&Count);
3239 emit_call((int)memdebug);
3241 restore_regs(0x100f);
3245 void storelr_assemble(int i,struct regstat *i_regs)
3252 int case1,case2,case3;
3253 int done0,done1,done2;
3255 int agr=AGEN1+(i&1);
3257 th=get_reg(i_regs->regmap,rs2[i]|64);
3258 tl=get_reg(i_regs->regmap,rs2[i]);
3259 s=get_reg(i_regs->regmap,rs1[i]);
3260 temp=get_reg(i_regs->regmap,agr);
3261 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3264 c=(i_regs->isconst>>s)&1;
3265 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3266 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3269 for(hr=0;hr<HOST_REGS;hr++) {
3270 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3275 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3276 if(!offset&&s!=temp) emit_mov(s,temp);
3282 if(!memtarget||!rs1[i]) {
3288 int map=get_reg(i_regs->regmap,ROREG);
3289 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
3290 gen_tlb_addr_w(temp,map);
3292 if((u_int)rdram!=0x80000000)
3293 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3296 int map=get_reg(i_regs->regmap,TLREG);
3298 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3299 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3300 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3301 if(!jaddr&&!memtarget) {
3305 gen_tlb_addr_w(temp,map);
3308 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3309 temp2=get_reg(i_regs->regmap,FTEMP);
3310 if(!rs2[i]) temp2=th=tl;
3313 #ifndef BIG_ENDIAN_MIPS
3314 emit_xorimm(temp,3,temp);
3316 emit_testimm(temp,2);
3319 emit_testimm(temp,1);
3323 if (opcode[i]==0x2A) { // SWL
3324 emit_writeword_indexed(tl,0,temp);
3326 if (opcode[i]==0x2E) { // SWR
3327 emit_writebyte_indexed(tl,3,temp);
3329 if (opcode[i]==0x2C) { // SDL
3330 emit_writeword_indexed(th,0,temp);
3331 if(rs2[i]) emit_mov(tl,temp2);
3333 if (opcode[i]==0x2D) { // SDR
3334 emit_writebyte_indexed(tl,3,temp);
3335 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3340 set_jump_target(case1,(int)out);
3341 if (opcode[i]==0x2A) { // SWL
3342 // Write 3 msb into three least significant bytes
3343 if(rs2[i]) emit_rorimm(tl,8,tl);
3344 emit_writehword_indexed(tl,-1,temp);
3345 if(rs2[i]) emit_rorimm(tl,16,tl);
3346 emit_writebyte_indexed(tl,1,temp);
3347 if(rs2[i]) emit_rorimm(tl,8,tl);
3349 if (opcode[i]==0x2E) { // SWR
3350 // Write two lsb into two most significant bytes
3351 emit_writehword_indexed(tl,1,temp);
3353 if (opcode[i]==0x2C) { // SDL
3354 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3355 // Write 3 msb into three least significant bytes
3356 if(rs2[i]) emit_rorimm(th,8,th);
3357 emit_writehword_indexed(th,-1,temp);
3358 if(rs2[i]) emit_rorimm(th,16,th);
3359 emit_writebyte_indexed(th,1,temp);
3360 if(rs2[i]) emit_rorimm(th,8,th);
3362 if (opcode[i]==0x2D) { // SDR
3363 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3364 // Write two lsb into two most significant bytes
3365 emit_writehword_indexed(tl,1,temp);
3370 set_jump_target(case2,(int)out);
3371 emit_testimm(temp,1);
3374 if (opcode[i]==0x2A) { // SWL
3375 // Write two msb into two least significant bytes
3376 if(rs2[i]) emit_rorimm(tl,16,tl);
3377 emit_writehword_indexed(tl,-2,temp);
3378 if(rs2[i]) emit_rorimm(tl,16,tl);
3380 if (opcode[i]==0x2E) { // SWR
3381 // Write 3 lsb into three most significant bytes
3382 emit_writebyte_indexed(tl,-1,temp);
3383 if(rs2[i]) emit_rorimm(tl,8,tl);
3384 emit_writehword_indexed(tl,0,temp);
3385 if(rs2[i]) emit_rorimm(tl,24,tl);
3387 if (opcode[i]==0x2C) { // SDL
3388 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3389 // Write two msb into two least significant bytes
3390 if(rs2[i]) emit_rorimm(th,16,th);
3391 emit_writehword_indexed(th,-2,temp);
3392 if(rs2[i]) emit_rorimm(th,16,th);
3394 if (opcode[i]==0x2D) { // SDR
3395 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3396 // Write 3 lsb into three most significant bytes
3397 emit_writebyte_indexed(tl,-1,temp);
3398 if(rs2[i]) emit_rorimm(tl,8,tl);
3399 emit_writehword_indexed(tl,0,temp);
3400 if(rs2[i]) emit_rorimm(tl,24,tl);
3405 set_jump_target(case3,(int)out);
3406 if (opcode[i]==0x2A) { // SWL
3407 // Write msb into least significant byte
3408 if(rs2[i]) emit_rorimm(tl,24,tl);
3409 emit_writebyte_indexed(tl,-3,temp);
3410 if(rs2[i]) emit_rorimm(tl,8,tl);
3412 if (opcode[i]==0x2E) { // SWR
3413 // Write entire word
3414 emit_writeword_indexed(tl,-3,temp);
3416 if (opcode[i]==0x2C) { // SDL
3417 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3418 // Write msb into least significant byte
3419 if(rs2[i]) emit_rorimm(th,24,th);
3420 emit_writebyte_indexed(th,-3,temp);
3421 if(rs2[i]) emit_rorimm(th,8,th);
3423 if (opcode[i]==0x2D) { // SDR
3424 if(rs2[i]) emit_mov(th,temp2);
3425 // Write entire word
3426 emit_writeword_indexed(tl,-3,temp);
3428 set_jump_target(done0,(int)out);
3429 set_jump_target(done1,(int)out);
3430 set_jump_target(done2,(int)out);
3431 if (opcode[i]==0x2C) { // SDL
3432 emit_testimm(temp,4);
3435 emit_andimm(temp,~3,temp);
3436 emit_writeword_indexed(temp2,4,temp);
3437 set_jump_target(done0,(int)out);
3439 if (opcode[i]==0x2D) { // SDR
3440 emit_testimm(temp,4);
3443 emit_andimm(temp,~3,temp);
3444 emit_writeword_indexed(temp2,-4,temp);
3445 set_jump_target(done0,(int)out);
3448 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3451 int map=get_reg(i_regs->regmap,ROREG);
3452 if(map<0) map=HOST_TEMPREG;
3453 gen_orig_addr_w(temp,map);
3455 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3457 #if defined(HOST_IMM8)
3458 int ir=get_reg(i_regs->regmap,INVCP);
3460 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3462 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3464 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3465 emit_callne(invalidate_addr_reg[temp]);
3469 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3474 //save_regs(0x100f);
3475 emit_readword((int)&last_count,ECX);
3476 if(get_reg(i_regs->regmap,CCREG)<0)
3477 emit_loadreg(CCREG,HOST_CCREG);
3478 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3479 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3480 emit_writeword(HOST_CCREG,(int)&Count);
3481 emit_call((int)memdebug);
3483 //restore_regs(0x100f);
3487 void c1ls_assemble(int i,struct regstat *i_regs)
3489 #ifndef DISABLE_COP1
3495 int jaddr,jaddr2=0,jaddr3,type;
3496 int agr=AGEN1+(i&1);
3498 th=get_reg(i_regs->regmap,FTEMP|64);
3499 tl=get_reg(i_regs->regmap,FTEMP);
3500 s=get_reg(i_regs->regmap,rs1[i]);
3501 temp=get_reg(i_regs->regmap,agr);
3502 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3507 for(hr=0;hr<HOST_REGS;hr++) {
3508 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3510 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3511 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3513 // Loads use a temporary register which we need to save
3516 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3520 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3521 //else c=(i_regs->wasconst>>s)&1;
3522 if(s>=0) c=(i_regs->wasconst>>s)&1;
3523 // Check cop1 unusable
3525 signed char rs=get_reg(i_regs->regmap,CSREG);
3527 emit_testimm(rs,0x20000000);
3530 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3533 if (opcode[i]==0x39) { // SWC1 (get float address)
3534 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3536 if (opcode[i]==0x3D) { // SDC1 (get double address)
3537 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3539 // Generate address + offset
3542 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3546 map=get_reg(i_regs->regmap,TLREG);
3548 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3549 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3551 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3552 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3555 if (opcode[i]==0x39) { // SWC1 (read float)
3556 emit_readword_indexed(0,tl,tl);
3558 if (opcode[i]==0x3D) { // SDC1 (read double)
3559 emit_readword_indexed(4,tl,th);
3560 emit_readword_indexed(0,tl,tl);
3562 if (opcode[i]==0x31) { // LWC1 (get target address)
3563 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3565 if (opcode[i]==0x35) { // LDC1 (get target address)
3566 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3573 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3575 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3577 #ifdef DESTRUCTIVE_SHIFT
3578 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3579 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3583 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3584 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3586 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3587 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3590 if (opcode[i]==0x31) { // LWC1
3591 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3592 //gen_tlb_addr_r(ar,map);
3593 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3594 #ifdef HOST_IMM_ADDR32
3595 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3598 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3601 if (opcode[i]==0x35) { // LDC1
3603 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3604 //gen_tlb_addr_r(ar,map);
3605 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3606 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3607 #ifdef HOST_IMM_ADDR32
3608 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3611 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3614 if (opcode[i]==0x39) { // SWC1
3615 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3616 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3619 if (opcode[i]==0x3D) { // SDC1
3621 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3622 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3623 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3627 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3628 #ifndef DESTRUCTIVE_SHIFT
3629 temp=offset||c||s<0?ar:s;
3631 #if defined(HOST_IMM8)
3632 int ir=get_reg(i_regs->regmap,INVCP);
3634 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3636 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3640 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3643 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3644 if (opcode[i]==0x31) { // LWC1 (write float)
3645 emit_writeword_indexed(tl,0,temp);
3647 if (opcode[i]==0x35) { // LDC1 (write double)
3648 emit_writeword_indexed(th,4,temp);
3649 emit_writeword_indexed(tl,0,temp);
3651 //if(opcode[i]==0x39)
3652 /*if(opcode[i]==0x39||opcode[i]==0x31)
3655 emit_readword((int)&last_count,ECX);
3656 if(get_reg(i_regs->regmap,CCREG)<0)
3657 emit_loadreg(CCREG,HOST_CCREG);
3658 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3659 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3660 emit_writeword(HOST_CCREG,(int)&Count);
3661 emit_call((int)memdebug);
3665 cop1_unusable(i, i_regs);
3669 void c2ls_assemble(int i,struct regstat *i_regs)
3674 int memtarget=0,c=0;
3675 int jaddr,jaddr2=0,jaddr3,type;
3676 int agr=AGEN1+(i&1);
3678 u_int copr=(source[i]>>16)&0x1f;
3679 s=get_reg(i_regs->regmap,rs1[i]);
3680 tl=get_reg(i_regs->regmap,FTEMP);
3686 for(hr=0;hr<HOST_REGS;hr++) {
3687 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3689 if(i_regs->regmap[HOST_CCREG]==CCREG)
3690 reglist&=~(1<<HOST_CCREG);
3693 if (opcode[i]==0x3a) { // SWC2
3694 ar=get_reg(i_regs->regmap,agr);
3695 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3700 if(s>=0) c=(i_regs->wasconst>>s)&1;
3701 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3702 if (!offset&&!c&&s>=0) ar=s;
3705 if (opcode[i]==0x3a) { // SWC2
3706 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3714 emit_jmp(0); // inline_readstub/inline_writestub?
3718 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3722 if (opcode[i]==0x32) { // LWC2
3723 #ifdef HOST_IMM_ADDR32
3724 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3727 emit_readword_indexed(0,ar,tl);
3729 if (opcode[i]==0x3a) { // SWC2
3730 #ifdef DESTRUCTIVE_SHIFT
3731 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3733 emit_writeword_indexed(tl,0,ar);
3737 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3738 if (opcode[i]==0x3a) { // SWC2
3739 #if defined(HOST_IMM8)
3740 int ir=get_reg(i_regs->regmap,INVCP);
3742 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3744 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3748 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3750 if (opcode[i]==0x32) { // LWC2
3751 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3755 #ifndef multdiv_assemble
3756 void multdiv_assemble(int i,struct regstat *i_regs)
3758 printf("Need multdiv_assemble for this architecture.\n");
3763 void mov_assemble(int i,struct regstat *i_regs)
3765 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3766 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3768 signed char sh,sl,th,tl;
3769 th=get_reg(i_regs->regmap,rt1[i]|64);
3770 tl=get_reg(i_regs->regmap,rt1[i]);
3773 sh=get_reg(i_regs->regmap,rs1[i]|64);
3774 sl=get_reg(i_regs->regmap,rs1[i]);
3775 if(sl>=0) emit_mov(sl,tl);
3776 else emit_loadreg(rs1[i],tl);
3778 if(sh>=0) emit_mov(sh,th);
3779 else emit_loadreg(rs1[i]|64,th);
3785 #ifndef fconv_assemble
3786 void fconv_assemble(int i,struct regstat *i_regs)
3788 printf("Need fconv_assemble for this architecture.\n");
3794 void float_assemble(int i,struct regstat *i_regs)
3796 printf("Need float_assemble for this architecture.\n");
3801 void syscall_assemble(int i,struct regstat *i_regs)
3803 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3804 assert(ccreg==HOST_CCREG);
3805 assert(!is_delayslot);
3806 emit_movimm(start+i*4,EAX); // Get PC
3807 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3808 emit_jmp((int)jump_syscall_hle); // XXX
3811 void hlecall_assemble(int i,struct regstat *i_regs)
3813 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3814 assert(ccreg==HOST_CCREG);
3815 assert(!is_delayslot);
3816 emit_movimm(start+i*4+4,0); // Get PC
3817 emit_movimm((int)psxHLEt[source[i]&7],1);
3818 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG); // XXX
3819 emit_jmp((int)jump_hlecall);
3822 void intcall_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,0); // Get PC
3828 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*ccadj[i],HOST_CCREG);
3829 emit_jmp((int)jump_intcall);
3832 void ds_assemble(int i,struct regstat *i_regs)
3837 alu_assemble(i,i_regs);break;
3839 imm16_assemble(i,i_regs);break;
3841 shift_assemble(i,i_regs);break;
3843 shiftimm_assemble(i,i_regs);break;
3845 load_assemble(i,i_regs);break;
3847 loadlr_assemble(i,i_regs);break;
3849 store_assemble(i,i_regs);break;
3851 storelr_assemble(i,i_regs);break;
3853 cop0_assemble(i,i_regs);break;
3855 cop1_assemble(i,i_regs);break;
3857 c1ls_assemble(i,i_regs);break;
3859 cop2_assemble(i,i_regs);break;
3861 c2ls_assemble(i,i_regs);break;
3863 c2op_assemble(i,i_regs);break;
3865 fconv_assemble(i,i_regs);break;
3867 float_assemble(i,i_regs);break;
3869 fcomp_assemble(i,i_regs);break;
3871 multdiv_assemble(i,i_regs);break;
3873 mov_assemble(i,i_regs);break;
3883 printf("Jump in the delay slot. This is probably a bug.\n");
3888 // Is the branch target a valid internal jump?
3889 int internal_branch(uint64_t i_is32,int addr)
3891 if(addr&1) return 0; // Indirect (register) jump
3892 if(addr>=start && addr<start+slen*4-4)
3894 int t=(addr-start)>>2;
3895 // Delay slots are not valid branch targets
3896 //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;
3897 // 64 -> 32 bit transition requires a recompile
3898 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
3900 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
3901 else printf("optimizable: yes\n");
3903 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
3905 if(requires_32bit[t]&~i_is32) return 0;
3913 #ifndef wb_invalidate
3914 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
3915 uint64_t u,uint64_t uu)
3918 for(hr=0;hr<HOST_REGS;hr++) {
3919 if(hr!=EXCLUDE_REG) {
3920 if(pre[hr]!=entry[hr]) {
3923 if(get_reg(entry,pre[hr])<0) {
3925 if(!((u>>pre[hr])&1)) {
3926 emit_storereg(pre[hr],hr);
3927 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
3928 emit_sarimm(hr,31,hr);
3929 emit_storereg(pre[hr]|64,hr);
3933 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
3934 emit_storereg(pre[hr],hr);
3943 // Move from one register to another (no writeback)
3944 for(hr=0;hr<HOST_REGS;hr++) {
3945 if(hr!=EXCLUDE_REG) {
3946 if(pre[hr]!=entry[hr]) {
3947 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
3949 if((nr=get_reg(entry,pre[hr]))>=0) {
3959 // Load the specified registers
3960 // This only loads the registers given as arguments because
3961 // we don't want to load things that will be overwritten
3962 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
3966 for(hr=0;hr<HOST_REGS;hr++) {
3967 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
3968 if(entry[hr]!=regmap[hr]) {
3969 if(regmap[hr]==rs1||regmap[hr]==rs2)
3976 emit_loadreg(regmap[hr],hr);
3983 for(hr=0;hr<HOST_REGS;hr++) {
3984 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
3985 if(entry[hr]!=regmap[hr]) {
3986 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
3988 assert(regmap[hr]!=64);
3989 if((is32>>(regmap[hr]&63))&1) {
3990 int lr=get_reg(regmap,regmap[hr]-64);
3992 emit_sarimm(lr,31,hr);
3994 emit_loadreg(regmap[hr],hr);
3998 emit_loadreg(regmap[hr],hr);
4006 // Load registers prior to the start of a loop
4007 // so that they are not loaded within the loop
4008 static void loop_preload(signed char pre[],signed char entry[])
4011 for(hr=0;hr<HOST_REGS;hr++) {
4012 if(hr!=EXCLUDE_REG) {
4013 if(pre[hr]!=entry[hr]) {
4015 if(get_reg(pre,entry[hr])<0) {
4016 assem_debug("loop preload:\n");
4017 //printf("loop preload: %d\n",hr);
4021 else if(entry[hr]<TEMPREG)
4023 emit_loadreg(entry[hr],hr);
4025 else if(entry[hr]-64<TEMPREG)
4027 emit_loadreg(entry[hr],hr);
4036 // Generate address for load/store instruction
4037 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
4038 void address_generation(int i,struct regstat *i_regs,signed char entry[])
4040 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
4042 int agr=AGEN1+(i&1);
4043 int mgr=MGEN1+(i&1);
4044 if(itype[i]==LOAD) {
4045 ra=get_reg(i_regs->regmap,rt1[i]);
4046 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4049 if(itype[i]==LOADLR) {
4050 ra=get_reg(i_regs->regmap,FTEMP);
4052 if(itype[i]==STORE||itype[i]==STORELR) {
4053 ra=get_reg(i_regs->regmap,agr);
4054 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4056 if(itype[i]==C1LS||itype[i]==C2LS) {
4057 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
4058 ra=get_reg(i_regs->regmap,FTEMP);
4059 else { // SWC1/SDC1/SWC2/SDC2
4060 ra=get_reg(i_regs->regmap,agr);
4061 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4064 int rs=get_reg(i_regs->regmap,rs1[i]);
4065 int rm=get_reg(i_regs->regmap,TLREG);
4068 int c=(i_regs->wasconst>>rs)&1;
4070 // Using r0 as a base address
4072 if(!entry||entry[rm]!=mgr) {
4073 generate_map_const(offset,rm);
4074 } // else did it in the previous cycle
4076 if(!entry||entry[ra]!=agr) {
4077 if (opcode[i]==0x22||opcode[i]==0x26) {
4078 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4079 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4080 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4082 emit_movimm(offset,ra);
4084 } // else did it in the previous cycle
4087 if(!entry||entry[ra]!=rs1[i])
4088 emit_loadreg(rs1[i],ra);
4089 //if(!entry||entry[ra]!=rs1[i])
4090 // printf("poor load scheduling!\n");
4094 if(!entry||entry[rm]!=mgr) {
4095 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4096 // Stores to memory go thru the mapper to detect self-modifying
4097 // code, loads don't.
4098 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4099 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4100 generate_map_const(constmap[i][rs]+offset,rm);
4102 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4103 generate_map_const(constmap[i][rs]+offset,rm);
4107 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4108 if(!entry||entry[ra]!=agr) {
4109 if (opcode[i]==0x22||opcode[i]==0x26) {
4110 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4111 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4112 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4114 #ifdef HOST_IMM_ADDR32
4115 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4116 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4118 emit_movimm(constmap[i][rs]+offset,ra);
4120 } // else did it in the previous cycle
4121 } // else load_consts already did it
4123 if(offset&&!c&&rs1[i]) {
4125 emit_addimm(rs,offset,ra);
4127 emit_addimm(ra,offset,ra);
4132 // Preload constants for next instruction
4133 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) {
4135 #ifndef HOST_IMM_ADDR32
4137 agr=MGEN1+((i+1)&1);
4138 ra=get_reg(i_regs->regmap,agr);
4140 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4141 int offset=imm[i+1];
4142 int c=(regs[i+1].wasconst>>rs)&1;
4144 if(itype[i+1]==STORE||itype[i+1]==STORELR
4145 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4146 // Stores to memory go thru the mapper to detect self-modifying
4147 // code, loads don't.
4148 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4149 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4150 generate_map_const(constmap[i+1][rs]+offset,ra);
4152 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4153 generate_map_const(constmap[i+1][rs]+offset,ra);
4156 /*else if(rs1[i]==0) {
4157 generate_map_const(offset,ra);
4162 agr=AGEN1+((i+1)&1);
4163 ra=get_reg(i_regs->regmap,agr);
4165 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4166 int offset=imm[i+1];
4167 int c=(regs[i+1].wasconst>>rs)&1;
4168 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4169 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4170 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4171 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4172 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4174 #ifdef HOST_IMM_ADDR32
4175 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4176 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4178 emit_movimm(constmap[i+1][rs]+offset,ra);
4181 else if(rs1[i+1]==0) {
4182 // Using r0 as a base address
4183 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4184 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4185 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4186 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4188 emit_movimm(offset,ra);
4195 int get_final_value(int hr, int i, int *value)
4197 int reg=regs[i].regmap[hr];
4199 if(regs[i+1].regmap[hr]!=reg) break;
4200 if(!((regs[i+1].isconst>>hr)&1)) break;
4205 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4206 *value=constmap[i][hr];
4210 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4211 // Load in delay slot, out-of-order execution
4212 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4214 #ifdef HOST_IMM_ADDR32
4215 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4217 // Precompute load address
4218 *value=constmap[i][hr]+imm[i+2];
4222 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4224 #ifdef HOST_IMM_ADDR32
4225 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4227 // Precompute load address
4228 *value=constmap[i][hr]+imm[i+1];
4229 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4234 *value=constmap[i][hr];
4235 //printf("c=%x\n",(int)constmap[i][hr]);
4236 if(i==slen-1) return 1;
4238 return !((unneeded_reg[i+1]>>reg)&1);
4240 return !((unneeded_reg_upper[i+1]>>reg)&1);
4244 // Load registers with known constants
4245 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4249 for(hr=0;hr<HOST_REGS;hr++) {
4250 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4251 //if(entry[hr]!=regmap[hr]) {
4252 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4253 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4255 if(get_final_value(hr,i,&value)) {
4260 emit_movimm(value,hr);
4268 for(hr=0;hr<HOST_REGS;hr++) {
4269 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4270 //if(entry[hr]!=regmap[hr]) {
4271 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4272 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4273 if((is32>>(regmap[hr]&63))&1) {
4274 int lr=get_reg(regmap,regmap[hr]-64);
4276 emit_sarimm(lr,31,hr);
4281 if(get_final_value(hr,i,&value)) {
4286 emit_movimm(value,hr);
4295 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4299 for(hr=0;hr<HOST_REGS;hr++) {
4300 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4301 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4302 int value=constmap[i][hr];
4307 emit_movimm(value,hr);
4313 for(hr=0;hr<HOST_REGS;hr++) {
4314 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4315 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4316 if((is32>>(regmap[hr]&63))&1) {
4317 int lr=get_reg(regmap,regmap[hr]-64);
4319 emit_sarimm(lr,31,hr);
4323 int value=constmap[i][hr];
4328 emit_movimm(value,hr);
4336 // Write out all dirty registers (except cycle count)
4337 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4340 for(hr=0;hr<HOST_REGS;hr++) {
4341 if(hr!=EXCLUDE_REG) {
4342 if(i_regmap[hr]>0) {
4343 if(i_regmap[hr]!=CCREG) {
4344 if((i_dirty>>hr)&1) {
4345 if(i_regmap[hr]<64) {
4346 emit_storereg(i_regmap[hr],hr);
4348 if( ((i_is32>>i_regmap[hr])&1) ) {
4349 #ifdef DESTRUCTIVE_WRITEBACK
4350 emit_sarimm(hr,31,hr);
4351 emit_storereg(i_regmap[hr]|64,hr);
4353 emit_sarimm(hr,31,HOST_TEMPREG);
4354 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4359 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4360 emit_storereg(i_regmap[hr],hr);
4369 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4370 // This writes the registers not written by store_regs_bt
4371 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4374 int t=(addr-start)>>2;
4375 for(hr=0;hr<HOST_REGS;hr++) {
4376 if(hr!=EXCLUDE_REG) {
4377 if(i_regmap[hr]>0) {
4378 if(i_regmap[hr]!=CCREG) {
4379 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)) {
4380 if((i_dirty>>hr)&1) {
4381 if(i_regmap[hr]<64) {
4382 emit_storereg(i_regmap[hr],hr);
4384 if( ((i_is32>>i_regmap[hr])&1) ) {
4385 #ifdef DESTRUCTIVE_WRITEBACK
4386 emit_sarimm(hr,31,hr);
4387 emit_storereg(i_regmap[hr]|64,hr);
4389 emit_sarimm(hr,31,HOST_TEMPREG);
4390 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4395 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4396 emit_storereg(i_regmap[hr],hr);
4407 // Load all registers (except cycle count)
4408 void load_all_regs(signed char i_regmap[])
4411 for(hr=0;hr<HOST_REGS;hr++) {
4412 if(hr!=EXCLUDE_REG) {
4413 if(i_regmap[hr]==0) {
4417 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4419 emit_loadreg(i_regmap[hr],hr);
4425 // Load all current registers also needed by next instruction
4426 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4429 for(hr=0;hr<HOST_REGS;hr++) {
4430 if(hr!=EXCLUDE_REG) {
4431 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4432 if(i_regmap[hr]==0) {
4436 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG)
4438 emit_loadreg(i_regmap[hr],hr);
4445 // Load all regs, storing cycle count if necessary
4446 void load_regs_entry(int t)
4449 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER,HOST_CCREG);
4450 else if(ccadj[t]) emit_addimm(HOST_CCREG,-ccadj[t]*CLOCK_DIVIDER,HOST_CCREG);
4451 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4452 emit_storereg(CCREG,HOST_CCREG);
4455 for(hr=0;hr<HOST_REGS;hr++) {
4456 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4457 if(regs[t].regmap_entry[hr]==0) {
4460 else if(regs[t].regmap_entry[hr]!=CCREG)
4462 emit_loadreg(regs[t].regmap_entry[hr],hr);
4467 for(hr=0;hr<HOST_REGS;hr++) {
4468 if(regs[t].regmap_entry[hr]>=64) {
4469 assert(regs[t].regmap_entry[hr]!=64);
4470 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4471 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4473 emit_loadreg(regs[t].regmap_entry[hr],hr);
4477 emit_sarimm(lr,31,hr);
4482 emit_loadreg(regs[t].regmap_entry[hr],hr);
4488 // Store dirty registers prior to branch
4489 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4491 if(internal_branch(i_is32,addr))
4493 int t=(addr-start)>>2;
4495 for(hr=0;hr<HOST_REGS;hr++) {
4496 if(hr!=EXCLUDE_REG) {
4497 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4498 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)) {
4499 if((i_dirty>>hr)&1) {
4500 if(i_regmap[hr]<64) {
4501 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4502 emit_storereg(i_regmap[hr],hr);
4503 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4504 #ifdef DESTRUCTIVE_WRITEBACK
4505 emit_sarimm(hr,31,hr);
4506 emit_storereg(i_regmap[hr]|64,hr);
4508 emit_sarimm(hr,31,HOST_TEMPREG);
4509 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4514 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4515 emit_storereg(i_regmap[hr],hr);
4526 // Branch out of this block, write out all dirty regs
4527 wb_dirtys(i_regmap,i_is32,i_dirty);
4531 // Load all needed registers for branch target
4532 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4534 //if(addr>=start && addr<(start+slen*4))
4535 if(internal_branch(i_is32,addr))
4537 int t=(addr-start)>>2;
4539 // Store the cycle count before loading something else
4540 if(i_regmap[HOST_CCREG]!=CCREG) {
4541 assert(i_regmap[HOST_CCREG]==-1);
4543 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4544 emit_storereg(CCREG,HOST_CCREG);
4547 for(hr=0;hr<HOST_REGS;hr++) {
4548 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<64) {
4549 #ifdef DESTRUCTIVE_WRITEBACK
4550 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)) {
4552 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4554 if(regs[t].regmap_entry[hr]==0) {
4557 else if(regs[t].regmap_entry[hr]!=CCREG)
4559 emit_loadreg(regs[t].regmap_entry[hr],hr);
4565 for(hr=0;hr<HOST_REGS;hr++) {
4566 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64) {
4567 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4568 assert(regs[t].regmap_entry[hr]!=64);
4569 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4570 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4572 emit_loadreg(regs[t].regmap_entry[hr],hr);
4576 emit_sarimm(lr,31,hr);
4581 emit_loadreg(regs[t].regmap_entry[hr],hr);
4584 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4585 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4587 emit_sarimm(lr,31,hr);
4594 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4596 if(addr>=start && addr<start+slen*4-4)
4598 int t=(addr-start)>>2;
4600 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4601 for(hr=0;hr<HOST_REGS;hr++)
4605 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4607 if(regs[t].regmap_entry[hr]!=-1)
4616 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4621 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4626 else // Same register but is it 32-bit or dirty?
4629 if(!((regs[t].dirty>>hr)&1))
4633 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4635 //printf("%x: dirty no match\n",addr);
4640 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4642 //printf("%x: is32 no match\n",addr);
4648 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4650 if(requires_32bit[t]&~i_is32) return 0;
4652 // Delay slots are not valid branch targets
4653 //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;
4654 // Delay slots require additional processing, so do not match
4655 if(is_ds[t]) return 0;
4660 for(hr=0;hr<HOST_REGS;hr++)
4666 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4680 // Used when a branch jumps into the delay slot of another branch
4681 void ds_assemble_entry(int i)
4683 int t=(ba[i]-start)>>2;
4684 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4685 assem_debug("Assemble delay slot at %x\n",ba[i]);
4686 assem_debug("<->\n");
4687 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4688 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4689 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4690 address_generation(t,®s[t],regs[t].regmap_entry);
4691 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4692 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4697 alu_assemble(t,®s[t]);break;
4699 imm16_assemble(t,®s[t]);break;
4701 shift_assemble(t,®s[t]);break;
4703 shiftimm_assemble(t,®s[t]);break;
4705 load_assemble(t,®s[t]);break;
4707 loadlr_assemble(t,®s[t]);break;
4709 store_assemble(t,®s[t]);break;
4711 storelr_assemble(t,®s[t]);break;
4713 cop0_assemble(t,®s[t]);break;
4715 cop1_assemble(t,®s[t]);break;
4717 c1ls_assemble(t,®s[t]);break;
4719 cop2_assemble(t,®s[t]);break;
4721 c2ls_assemble(t,®s[t]);break;
4723 c2op_assemble(t,®s[t]);break;
4725 fconv_assemble(t,®s[t]);break;
4727 float_assemble(t,®s[t]);break;
4729 fcomp_assemble(t,®s[t]);break;
4731 multdiv_assemble(t,®s[t]);break;
4733 mov_assemble(t,®s[t]);break;
4743 printf("Jump in the delay slot. This is probably a bug.\n");
4745 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4746 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4747 if(internal_branch(regs[t].is32,ba[i]+4))
4748 assem_debug("branch: internal\n");
4750 assem_debug("branch: external\n");
4751 assert(internal_branch(regs[t].is32,ba[i]+4));
4752 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4756 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4765 //if(ba[i]>=start && ba[i]<(start+slen*4))
4766 if(internal_branch(branch_regs[i].is32,ba[i]))
4768 int t=(ba[i]-start)>>2;
4769 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4777 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4779 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4781 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4782 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4786 else if(*adj==0||invert) {
4787 emit_addimm_and_set_flags(CLOCK_DIVIDER*(count+2),HOST_CCREG);
4793 emit_cmpimm(HOST_CCREG,-2*(count+2));
4797 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4800 void do_ccstub(int n)
4803 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4804 set_jump_target(stubs[n][1],(int)out);
4806 if(stubs[n][6]==NULLDS) {
4807 // Delay slot instruction is nullified ("likely" branch)
4808 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4810 else if(stubs[n][6]!=TAKEN) {
4811 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4814 if(internal_branch(branch_regs[i].is32,ba[i]))
4815 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4819 // Save PC as return address
4820 emit_movimm(stubs[n][5],EAX);
4821 emit_writeword(EAX,(int)&pcaddr);
4825 // Return address depends on which way the branch goes
4826 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4828 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4829 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4830 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4831 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
4841 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
4845 #ifdef DESTRUCTIVE_WRITEBACK
4847 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
4848 emit_loadreg(rs1[i],s1l);
4851 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
4852 emit_loadreg(rs2[i],s1l);
4855 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
4856 emit_loadreg(rs2[i],s2l);
4859 int addr,alt,ntaddr;
4862 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4863 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4864 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4872 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4873 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4874 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4880 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
4884 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
4885 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
4886 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
4892 assert(hr<HOST_REGS);
4894 if((opcode[i]&0x2f)==4) // BEQ
4896 #ifdef HAVE_CMOV_IMM
4898 if(s2l>=0) emit_cmp(s1l,s2l);
4899 else emit_test(s1l,s1l);
4900 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
4905 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4907 if(s2h>=0) emit_cmp(s1h,s2h);
4908 else emit_test(s1h,s1h);
4909 emit_cmovne_reg(alt,addr);
4911 if(s2l>=0) emit_cmp(s1l,s2l);
4912 else emit_test(s1l,s1l);
4913 emit_cmovne_reg(alt,addr);
4916 if((opcode[i]&0x2f)==5) // BNE
4918 #ifdef HAVE_CMOV_IMM
4920 if(s2l>=0) emit_cmp(s1l,s2l);
4921 else emit_test(s1l,s1l);
4922 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
4927 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
4929 if(s2h>=0) emit_cmp(s1h,s2h);
4930 else emit_test(s1h,s1h);
4931 emit_cmovne_reg(alt,addr);
4933 if(s2l>=0) emit_cmp(s1l,s2l);
4934 else emit_test(s1l,s1l);
4935 emit_cmovne_reg(alt,addr);
4938 if((opcode[i]&0x2f)==6) // BLEZ
4940 //emit_movimm(ba[i],alt);
4941 //emit_movimm(start+i*4+8,addr);
4942 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4944 if(s1h>=0) emit_mov(addr,ntaddr);
4945 emit_cmovl_reg(alt,addr);
4948 emit_cmovne_reg(ntaddr,addr);
4949 emit_cmovs_reg(alt,addr);
4952 if((opcode[i]&0x2f)==7) // BGTZ
4954 //emit_movimm(ba[i],addr);
4955 //emit_movimm(start+i*4+8,ntaddr);
4956 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
4958 if(s1h>=0) emit_mov(addr,alt);
4959 emit_cmovl_reg(ntaddr,addr);
4962 emit_cmovne_reg(alt,addr);
4963 emit_cmovs_reg(ntaddr,addr);
4966 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
4968 //emit_movimm(ba[i],alt);
4969 //emit_movimm(start+i*4+8,addr);
4970 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4971 if(s1h>=0) emit_test(s1h,s1h);
4972 else emit_test(s1l,s1l);
4973 emit_cmovs_reg(alt,addr);
4975 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
4977 //emit_movimm(ba[i],addr);
4978 //emit_movimm(start+i*4+8,alt);
4979 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4980 if(s1h>=0) emit_test(s1h,s1h);
4981 else emit_test(s1l,s1l);
4982 emit_cmovs_reg(alt,addr);
4984 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
4985 if(source[i]&0x10000) // BC1T
4987 //emit_movimm(ba[i],alt);
4988 //emit_movimm(start+i*4+8,addr);
4989 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
4990 emit_testimm(s1l,0x800000);
4991 emit_cmovne_reg(alt,addr);
4995 //emit_movimm(ba[i],addr);
4996 //emit_movimm(start+i*4+8,alt);
4997 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
4998 emit_testimm(s1l,0x800000);
4999 emit_cmovne_reg(alt,addr);
5002 emit_writeword(addr,(int)&pcaddr);
5007 int r=get_reg(branch_regs[i].regmap,rs1[i]);
5008 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5009 r=get_reg(branch_regs[i].regmap,RTEMP);
5011 emit_writeword(r,(int)&pcaddr);
5013 else {printf("Unknown branch type in do_ccstub\n");exit(1);}
5015 // Update cycle count
5016 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
5017 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5018 emit_call((int)cc_interrupt);
5019 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_DIVIDER*stubs[n][3],HOST_CCREG);
5020 if(stubs[n][6]==TAKEN) {
5021 if(internal_branch(branch_regs[i].is32,ba[i]))
5022 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
5023 else if(itype[i]==RJUMP) {
5024 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
5025 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
5027 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
5029 }else if(stubs[n][6]==NOTTAKEN) {
5030 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
5031 else load_all_regs(branch_regs[i].regmap);
5032 }else if(stubs[n][6]==NULLDS) {
5033 // Delay slot instruction is nullified ("likely" branch)
5034 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
5035 else load_all_regs(regs[i].regmap);
5037 load_all_regs(branch_regs[i].regmap);
5039 emit_jmp(stubs[n][2]); // return address
5041 /* This works but uses a lot of memory...
5042 emit_readword((int)&last_count,ECX);
5043 emit_add(HOST_CCREG,ECX,EAX);
5044 emit_writeword(EAX,(int)&Count);
5045 emit_call((int)gen_interupt);
5046 emit_readword((int)&Count,HOST_CCREG);
5047 emit_readword((int)&next_interupt,EAX);
5048 emit_readword((int)&pending_exception,EBX);
5049 emit_writeword(EAX,(int)&last_count);
5050 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
5052 int jne_instr=(int)out;
5054 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
5055 load_all_regs(branch_regs[i].regmap);
5056 emit_jmp(stubs[n][2]); // return address
5057 set_jump_target(jne_instr,(int)out);
5058 emit_readword((int)&pcaddr,EAX);
5059 // Call get_addr_ht instead of doing the hash table here.
5060 // This code is executed infrequently and takes up a lot of space
5061 // so smaller is better.
5062 emit_storereg(CCREG,HOST_CCREG);
5064 emit_call((int)get_addr_ht);
5065 emit_loadreg(CCREG,HOST_CCREG);
5066 emit_addimm(ESP,4,ESP);
5070 add_to_linker(int addr,int target,int ext)
5072 link_addr[linkcount][0]=addr;
5073 link_addr[linkcount][1]=target;
5074 link_addr[linkcount][2]=ext;
5078 void ujump_assemble(int i,struct regstat *i_regs)
5080 signed char *i_regmap=i_regs->regmap;
5081 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5082 address_generation(i+1,i_regs,regs[i].regmap_entry);
5084 int temp=get_reg(branch_regs[i].regmap,PTEMP);
5085 if(rt1[i]==31&&temp>=0)
5087 int return_address=start+i*4+8;
5088 if(get_reg(branch_regs[i].regmap,31)>0)
5089 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5092 ds_assemble(i+1,i_regs);
5093 uint64_t bc_unneeded=branch_regs[i].u;
5094 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5095 bc_unneeded|=1|(1LL<<rt1[i]);
5096 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5097 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5098 bc_unneeded,bc_unneeded_upper);
5099 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5102 unsigned int return_address;
5103 assert(rt1[i+1]!=31);
5104 assert(rt2[i+1]!=31);
5105 rt=get_reg(branch_regs[i].regmap,31);
5106 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]);
5108 return_address=start+i*4+8;
5111 if(internal_branch(branch_regs[i].is32,return_address)) {
5113 if(temp==EXCLUDE_REG||temp>=HOST_REGS||
5114 branch_regs[i].regmap[temp]>=0)
5116 temp=get_reg(branch_regs[i].regmap,-1);
5119 if(temp<0) temp=HOST_TEMPREG;
5121 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5122 else emit_movimm(return_address,rt);
5130 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5133 emit_movimm(return_address,rt); // PC into link register
5135 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5141 cc=get_reg(branch_regs[i].regmap,CCREG);
5142 assert(cc==HOST_CCREG);
5143 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5145 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5147 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5148 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5149 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5150 if(internal_branch(branch_regs[i].is32,ba[i]))
5151 assem_debug("branch: internal\n");
5153 assem_debug("branch: external\n");
5154 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5155 ds_assemble_entry(i);
5158 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5163 void rjump_assemble(int i,struct regstat *i_regs)
5165 signed char *i_regmap=i_regs->regmap;
5168 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5170 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5171 // Delay slot abuse, make a copy of the branch address register
5172 temp=get_reg(branch_regs[i].regmap,RTEMP);
5174 assert(regs[i].regmap[temp]==RTEMP);
5178 address_generation(i+1,i_regs,regs[i].regmap_entry);
5182 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5183 int return_address=start+i*4+8;
5184 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5190 int rh=get_reg(regs[i].regmap,RHASH);
5191 if(rh>=0) do_preload_rhash(rh);
5194 ds_assemble(i+1,i_regs);
5195 uint64_t bc_unneeded=branch_regs[i].u;
5196 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5197 bc_unneeded|=1|(1LL<<rt1[i]);
5198 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5199 bc_unneeded&=~(1LL<<rs1[i]);
5200 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5201 bc_unneeded,bc_unneeded_upper);
5202 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5204 int rt,return_address;
5205 assert(rt1[i+1]!=rt1[i]);
5206 assert(rt2[i+1]!=rt1[i]);
5207 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5208 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]);
5210 return_address=start+i*4+8;
5214 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5217 emit_movimm(return_address,rt); // PC into link register
5219 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5222 cc=get_reg(branch_regs[i].regmap,CCREG);
5223 assert(cc==HOST_CCREG);
5225 int rh=get_reg(branch_regs[i].regmap,RHASH);
5226 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5228 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5229 do_preload_rhtbl(ht);
5233 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5234 #ifdef DESTRUCTIVE_WRITEBACK
5235 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5236 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5237 emit_loadreg(rs1[i],rs);
5242 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5246 do_miniht_load(ht,rh);
5249 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5250 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5252 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5253 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5255 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5258 do_miniht_jump(rs,rh,ht);
5263 //if(rs!=EAX) emit_mov(rs,EAX);
5264 //emit_jmp((int)jump_vaddr_eax);
5265 emit_jmp(jump_vaddr_reg[rs]);
5270 emit_shrimm(rs,16,rs);
5271 emit_xor(temp,rs,rs);
5272 emit_movzwl_reg(rs,rs);
5273 emit_shlimm(rs,4,rs);
5274 emit_cmpmem_indexed((int)hash_table,rs,temp);
5275 emit_jne((int)out+14);
5276 emit_readword_indexed((int)hash_table+4,rs,rs);
5278 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5279 emit_addimm_no_flags(8,rs);
5280 emit_jeq((int)out-17);
5281 // No hit on hash table, call compiler
5284 #ifdef DEBUG_CYCLE_COUNT
5285 emit_readword((int)&last_count,ECX);
5286 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5287 emit_readword((int)&next_interupt,ECX);
5288 emit_writeword(HOST_CCREG,(int)&Count);
5289 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5290 emit_writeword(ECX,(int)&last_count);
5293 emit_storereg(CCREG,HOST_CCREG);
5294 emit_call((int)get_addr);
5295 emit_loadreg(CCREG,HOST_CCREG);
5296 emit_addimm(ESP,4,ESP);
5298 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5299 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5303 void cjump_assemble(int i,struct regstat *i_regs)
5305 signed char *i_regmap=i_regs->regmap;
5308 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5309 assem_debug("match=%d\n",match);
5310 int s1h,s1l,s2h,s2l;
5311 int prev_cop1_usable=cop1_usable;
5312 int unconditional=0,nop=0;
5315 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5316 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5317 if(!match) invert=1;
5318 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5319 if(i>(ba[i]-start)>>2) invert=1;
5323 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5324 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5325 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5326 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5329 s1l=get_reg(i_regmap,rs1[i]);
5330 s1h=get_reg(i_regmap,rs1[i]|64);
5331 s2l=get_reg(i_regmap,rs2[i]);
5332 s2h=get_reg(i_regmap,rs2[i]|64);
5334 if(rs1[i]==0&&rs2[i]==0)
5336 if(opcode[i]&1) nop=1;
5337 else unconditional=1;
5338 //assert(opcode[i]!=5);
5339 //assert(opcode[i]!=7);
5340 //assert(opcode[i]!=0x15);
5341 //assert(opcode[i]!=0x17);
5347 only32=(regs[i].was32>>rs2[i])&1;
5352 only32=(regs[i].was32>>rs1[i])&1;
5355 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5359 // Out of order execution (delay slot first)
5361 address_generation(i+1,i_regs,regs[i].regmap_entry);
5362 ds_assemble(i+1,i_regs);
5364 uint64_t bc_unneeded=branch_regs[i].u;
5365 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5366 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5367 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5369 bc_unneeded_upper|=1;
5370 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5371 bc_unneeded,bc_unneeded_upper);
5372 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5373 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5374 cc=get_reg(branch_regs[i].regmap,CCREG);
5375 assert(cc==HOST_CCREG);
5377 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5378 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5379 //assem_debug("cycle count (adj)\n");
5381 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5382 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5383 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5384 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5386 assem_debug("branch: internal\n");
5388 assem_debug("branch: external\n");
5389 if(internal&&is_ds[(ba[i]-start)>>2]) {
5390 ds_assemble_entry(i);
5393 add_to_linker((int)out,ba[i],internal);
5396 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5397 if(((u_int)out)&7) emit_addnop(0);
5402 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5405 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5408 int taken=0,nottaken=0,nottaken1=0;
5409 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5410 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5414 if(opcode[i]==4) // BEQ
5416 if(s2h>=0) emit_cmp(s1h,s2h);
5417 else emit_test(s1h,s1h);
5421 if(opcode[i]==5) // BNE
5423 if(s2h>=0) emit_cmp(s1h,s2h);
5424 else emit_test(s1h,s1h);
5425 if(invert) taken=(int)out;
5426 else add_to_linker((int)out,ba[i],internal);
5429 if(opcode[i]==6) // BLEZ
5432 if(invert) taken=(int)out;
5433 else add_to_linker((int)out,ba[i],internal);
5438 if(opcode[i]==7) // BGTZ
5443 if(invert) taken=(int)out;
5444 else add_to_linker((int)out,ba[i],internal);
5449 //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]);
5451 if(opcode[i]==4) // BEQ
5453 if(s2l>=0) emit_cmp(s1l,s2l);
5454 else emit_test(s1l,s1l);
5459 add_to_linker((int)out,ba[i],internal);
5463 if(opcode[i]==5) // BNE
5465 if(s2l>=0) emit_cmp(s1l,s2l);
5466 else emit_test(s1l,s1l);
5471 add_to_linker((int)out,ba[i],internal);
5475 if(opcode[i]==6) // BLEZ
5482 add_to_linker((int)out,ba[i],internal);
5486 if(opcode[i]==7) // BGTZ
5493 add_to_linker((int)out,ba[i],internal);
5498 if(taken) set_jump_target(taken,(int)out);
5499 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5500 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5502 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5503 add_to_linker((int)out,ba[i],internal);
5506 add_to_linker((int)out,ba[i],internal*2);
5512 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5513 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5514 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5516 assem_debug("branch: internal\n");
5518 assem_debug("branch: external\n");
5519 if(internal&&is_ds[(ba[i]-start)>>2]) {
5520 ds_assemble_entry(i);
5523 add_to_linker((int)out,ba[i],internal);
5527 set_jump_target(nottaken,(int)out);
5530 if(nottaken1) set_jump_target(nottaken1,(int)out);
5532 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5534 } // (!unconditional)
5538 // In-order execution (branch first)
5539 //if(likely[i]) printf("IOL\n");
5542 int taken=0,nottaken=0,nottaken1=0;
5543 if(!unconditional&&!nop) {
5547 if((opcode[i]&0x2f)==4) // BEQ
5549 if(s2h>=0) emit_cmp(s1h,s2h);
5550 else emit_test(s1h,s1h);
5554 if((opcode[i]&0x2f)==5) // BNE
5556 if(s2h>=0) emit_cmp(s1h,s2h);
5557 else emit_test(s1h,s1h);
5561 if((opcode[i]&0x2f)==6) // BLEZ
5569 if((opcode[i]&0x2f)==7) // BGTZ
5579 //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]);
5581 if((opcode[i]&0x2f)==4) // BEQ
5583 if(s2l>=0) emit_cmp(s1l,s2l);
5584 else emit_test(s1l,s1l);
5588 if((opcode[i]&0x2f)==5) // BNE
5590 if(s2l>=0) emit_cmp(s1l,s2l);
5591 else emit_test(s1l,s1l);
5595 if((opcode[i]&0x2f)==6) // BLEZ
5601 if((opcode[i]&0x2f)==7) // BGTZ
5607 } // if(!unconditional)
5609 uint64_t ds_unneeded=branch_regs[i].u;
5610 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5611 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5612 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5613 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5615 ds_unneeded_upper|=1;
5618 if(taken) set_jump_target(taken,(int)out);
5619 assem_debug("1:\n");
5620 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5621 ds_unneeded,ds_unneeded_upper);
5623 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5624 address_generation(i+1,&branch_regs[i],0);
5625 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5626 ds_assemble(i+1,&branch_regs[i]);
5627 cc=get_reg(branch_regs[i].regmap,CCREG);
5629 emit_loadreg(CCREG,cc=HOST_CCREG);
5630 // CHECK: Is the following instruction (fall thru) allocated ok?
5632 assert(cc==HOST_CCREG);
5633 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5634 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5635 assem_debug("cycle count (adj)\n");
5636 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5637 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5639 assem_debug("branch: internal\n");
5641 assem_debug("branch: external\n");
5642 if(internal&&is_ds[(ba[i]-start)>>2]) {
5643 ds_assemble_entry(i);
5646 add_to_linker((int)out,ba[i],internal);
5651 cop1_usable=prev_cop1_usable;
5652 if(!unconditional) {
5653 if(nottaken1) set_jump_target(nottaken1,(int)out);
5654 set_jump_target(nottaken,(int)out);
5655 assem_debug("2:\n");
5657 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5658 ds_unneeded,ds_unneeded_upper);
5659 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5660 address_generation(i+1,&branch_regs[i],0);
5661 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5662 ds_assemble(i+1,&branch_regs[i]);
5664 cc=get_reg(branch_regs[i].regmap,CCREG);
5665 if(cc==-1&&!likely[i]) {
5666 // Cycle count isn't in a register, temporarily load it then write it out
5667 emit_loadreg(CCREG,HOST_CCREG);
5668 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5671 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5672 emit_storereg(CCREG,HOST_CCREG);
5675 cc=get_reg(i_regmap,CCREG);
5676 assert(cc==HOST_CCREG);
5677 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5680 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5686 void sjump_assemble(int i,struct regstat *i_regs)
5688 signed char *i_regmap=i_regs->regmap;
5691 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5692 assem_debug("smatch=%d\n",match);
5694 int prev_cop1_usable=cop1_usable;
5695 int unconditional=0,nevertaken=0;
5698 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5699 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5700 if(!match) invert=1;
5701 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5702 if(i>(ba[i]-start)>>2) invert=1;
5705 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5706 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5709 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5710 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5713 s1l=get_reg(i_regmap,rs1[i]);
5714 s1h=get_reg(i_regmap,rs1[i]|64);
5718 if(opcode2[i]&1) unconditional=1;
5720 // These are never taken (r0 is never less than zero)
5721 //assert(opcode2[i]!=0);
5722 //assert(opcode2[i]!=2);
5723 //assert(opcode2[i]!=0x10);
5724 //assert(opcode2[i]!=0x12);
5727 only32=(regs[i].was32>>rs1[i])&1;
5731 // Out of order execution (delay slot first)
5733 address_generation(i+1,i_regs,regs[i].regmap_entry);
5734 ds_assemble(i+1,i_regs);
5736 uint64_t bc_unneeded=branch_regs[i].u;
5737 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5738 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5739 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5741 bc_unneeded_upper|=1;
5742 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5743 bc_unneeded,bc_unneeded_upper);
5744 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5745 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5747 int rt,return_address;
5748 rt=get_reg(branch_regs[i].regmap,31);
5749 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]);
5751 // Save the PC even if the branch is not taken
5752 return_address=start+i*4+8;
5753 emit_movimm(return_address,rt); // PC into link register
5755 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5759 cc=get_reg(branch_regs[i].regmap,CCREG);
5760 assert(cc==HOST_CCREG);
5762 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5763 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5764 assem_debug("cycle count (adj)\n");
5766 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5767 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5768 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5769 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5771 assem_debug("branch: internal\n");
5773 assem_debug("branch: external\n");
5774 if(internal&&is_ds[(ba[i]-start)>>2]) {
5775 ds_assemble_entry(i);
5778 add_to_linker((int)out,ba[i],internal);
5781 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5782 if(((u_int)out)&7) emit_addnop(0);
5786 else if(nevertaken) {
5787 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
5790 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5794 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5795 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5799 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5806 add_to_linker((int)out,ba[i],internal);
5810 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5817 add_to_linker((int)out,ba[i],internal);
5825 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5832 add_to_linker((int)out,ba[i],internal);
5836 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5843 add_to_linker((int)out,ba[i],internal);
5850 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5851 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5853 emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5854 add_to_linker((int)out,ba[i],internal);
5857 add_to_linker((int)out,ba[i],internal*2);
5863 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
5864 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5865 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5867 assem_debug("branch: internal\n");
5869 assem_debug("branch: external\n");
5870 if(internal&&is_ds[(ba[i]-start)>>2]) {
5871 ds_assemble_entry(i);
5874 add_to_linker((int)out,ba[i],internal);
5878 set_jump_target(nottaken,(int)out);
5882 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
5884 } // (!unconditional)
5888 // In-order execution (branch first)
5892 int rt,return_address;
5893 rt=get_reg(branch_regs[i].regmap,31);
5895 // Save the PC even if the branch is not taken
5896 return_address=start+i*4+8;
5897 emit_movimm(return_address,rt); // PC into link register
5899 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5903 if(!unconditional) {
5904 //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]);
5908 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5914 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5924 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
5930 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
5937 } // if(!unconditional)
5939 uint64_t ds_unneeded=branch_regs[i].u;
5940 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5941 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5942 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5943 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5945 ds_unneeded_upper|=1;
5948 //assem_debug("1:\n");
5949 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5950 ds_unneeded,ds_unneeded_upper);
5952 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5953 address_generation(i+1,&branch_regs[i],0);
5954 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5955 ds_assemble(i+1,&branch_regs[i]);
5956 cc=get_reg(branch_regs[i].regmap,CCREG);
5958 emit_loadreg(CCREG,cc=HOST_CCREG);
5959 // CHECK: Is the following instruction (fall thru) allocated ok?
5961 assert(cc==HOST_CCREG);
5962 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5963 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5964 assem_debug("cycle count (adj)\n");
5965 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
5966 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5968 assem_debug("branch: internal\n");
5970 assem_debug("branch: external\n");
5971 if(internal&&is_ds[(ba[i]-start)>>2]) {
5972 ds_assemble_entry(i);
5975 add_to_linker((int)out,ba[i],internal);
5980 cop1_usable=prev_cop1_usable;
5981 if(!unconditional) {
5982 set_jump_target(nottaken,(int)out);
5983 assem_debug("1:\n");
5985 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5986 ds_unneeded,ds_unneeded_upper);
5987 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5988 address_generation(i+1,&branch_regs[i],0);
5989 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5990 ds_assemble(i+1,&branch_regs[i]);
5992 cc=get_reg(branch_regs[i].regmap,CCREG);
5993 if(cc==-1&&!likely[i]) {
5994 // Cycle count isn't in a register, temporarily load it then write it out
5995 emit_loadreg(CCREG,HOST_CCREG);
5996 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
5999 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6000 emit_storereg(CCREG,HOST_CCREG);
6003 cc=get_reg(i_regmap,CCREG);
6004 assert(cc==HOST_CCREG);
6005 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6008 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6014 void fjump_assemble(int i,struct regstat *i_regs)
6016 signed char *i_regmap=i_regs->regmap;
6019 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6020 assem_debug("fmatch=%d\n",match);
6024 int internal=internal_branch(branch_regs[i].is32,ba[i]);
6025 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
6026 if(!match) invert=1;
6027 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6028 if(i>(ba[i]-start)>>2) invert=1;
6032 fs=get_reg(branch_regs[i].regmap,FSREG);
6033 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
6036 fs=get_reg(i_regmap,FSREG);
6039 // Check cop1 unusable
6041 cs=get_reg(i_regmap,CSREG);
6043 emit_testimm(cs,0x20000000);
6046 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
6051 // Out of order execution (delay slot first)
6053 ds_assemble(i+1,i_regs);
6055 uint64_t bc_unneeded=branch_regs[i].u;
6056 uint64_t bc_unneeded_upper=branch_regs[i].uu;
6057 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6058 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
6060 bc_unneeded_upper|=1;
6061 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6062 bc_unneeded,bc_unneeded_upper);
6063 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
6064 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6065 cc=get_reg(branch_regs[i].regmap,CCREG);
6066 assert(cc==HOST_CCREG);
6067 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6068 assem_debug("cycle count (adj)\n");
6071 if(adj&&!invert) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6074 emit_testimm(fs,0x800000);
6075 if(source[i]&0x10000) // BC1T
6081 add_to_linker((int)out,ba[i],internal);
6090 add_to_linker((int)out,ba[i],internal);
6098 if(adj) emit_addimm(cc,-CLOCK_DIVIDER*adj,cc);
6099 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6100 else if(match) emit_addnop(13);
6102 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6103 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6105 assem_debug("branch: internal\n");
6107 assem_debug("branch: external\n");
6108 if(internal&&is_ds[(ba[i]-start)>>2]) {
6109 ds_assemble_entry(i);
6112 add_to_linker((int)out,ba[i],internal);
6115 set_jump_target(nottaken,(int)out);
6119 if(!invert) emit_addimm(cc,CLOCK_DIVIDER*adj,cc);
6121 } // (!unconditional)
6125 // In-order execution (branch first)
6129 //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]);
6132 emit_testimm(fs,0x800000);
6133 if(source[i]&0x10000) // BC1T
6144 } // if(!unconditional)
6146 uint64_t ds_unneeded=branch_regs[i].u;
6147 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6148 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6149 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6150 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6152 ds_unneeded_upper|=1;
6154 //assem_debug("1:\n");
6155 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6156 ds_unneeded,ds_unneeded_upper);
6158 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6159 address_generation(i+1,&branch_regs[i],0);
6160 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6161 ds_assemble(i+1,&branch_regs[i]);
6162 cc=get_reg(branch_regs[i].regmap,CCREG);
6164 emit_loadreg(CCREG,cc=HOST_CCREG);
6165 // CHECK: Is the following instruction (fall thru) allocated ok?
6167 assert(cc==HOST_CCREG);
6168 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6169 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6170 assem_debug("cycle count (adj)\n");
6171 if(adj) emit_addimm(cc,CLOCK_DIVIDER*(ccadj[i]+2-adj),cc);
6172 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6174 assem_debug("branch: internal\n");
6176 assem_debug("branch: external\n");
6177 if(internal&&is_ds[(ba[i]-start)>>2]) {
6178 ds_assemble_entry(i);
6181 add_to_linker((int)out,ba[i],internal);
6186 if(1) { // <- FIXME (don't need this)
6187 set_jump_target(nottaken,(int)out);
6188 assem_debug("1:\n");
6190 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6191 ds_unneeded,ds_unneeded_upper);
6192 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6193 address_generation(i+1,&branch_regs[i],0);
6194 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6195 ds_assemble(i+1,&branch_regs[i]);
6197 cc=get_reg(branch_regs[i].regmap,CCREG);
6198 if(cc==-1&&!likely[i]) {
6199 // Cycle count isn't in a register, temporarily load it then write it out
6200 emit_loadreg(CCREG,HOST_CCREG);
6201 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6204 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6205 emit_storereg(CCREG,HOST_CCREG);
6208 cc=get_reg(i_regmap,CCREG);
6209 assert(cc==HOST_CCREG);
6210 emit_addimm_and_set_flags(CLOCK_DIVIDER*(ccadj[i]+2),cc);
6213 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6219 static void pagespan_assemble(int i,struct regstat *i_regs)
6221 int s1l=get_reg(i_regs->regmap,rs1[i]);
6222 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6223 int s2l=get_reg(i_regs->regmap,rs2[i]);
6224 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6225 void *nt_branch=NULL;
6228 int unconditional=0;
6238 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6242 int addr,alt,ntaddr;
6243 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6247 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6248 (i_regs->regmap[hr]&63)!=rs1[i] &&
6249 (i_regs->regmap[hr]&63)!=rs2[i] )
6258 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6259 (i_regs->regmap[hr]&63)!=rs1[i] &&
6260 (i_regs->regmap[hr]&63)!=rs2[i] )
6266 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6270 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6271 (i_regs->regmap[hr]&63)!=rs1[i] &&
6272 (i_regs->regmap[hr]&63)!=rs2[i] )
6279 assert(hr<HOST_REGS);
6280 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6281 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6283 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i]+2),HOST_CCREG);
6284 if(opcode[i]==2) // J
6288 if(opcode[i]==3) // JAL
6291 int rt=get_reg(i_regs->regmap,31);
6292 emit_movimm(start+i*4+8,rt);
6295 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6298 if(opcode2[i]==9) // JALR
6300 int rt=get_reg(i_regs->regmap,rt1[i]);
6301 emit_movimm(start+i*4+8,rt);
6304 if((opcode[i]&0x3f)==4) // BEQ
6311 #ifdef HAVE_CMOV_IMM
6313 if(s2l>=0) emit_cmp(s1l,s2l);
6314 else emit_test(s1l,s1l);
6315 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6321 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6323 if(s2h>=0) emit_cmp(s1h,s2h);
6324 else emit_test(s1h,s1h);
6325 emit_cmovne_reg(alt,addr);
6327 if(s2l>=0) emit_cmp(s1l,s2l);
6328 else emit_test(s1l,s1l);
6329 emit_cmovne_reg(alt,addr);
6332 if((opcode[i]&0x3f)==5) // BNE
6334 #ifdef HAVE_CMOV_IMM
6336 if(s2l>=0) emit_cmp(s1l,s2l);
6337 else emit_test(s1l,s1l);
6338 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6344 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6346 if(s2h>=0) emit_cmp(s1h,s2h);
6347 else emit_test(s1h,s1h);
6348 emit_cmovne_reg(alt,addr);
6350 if(s2l>=0) emit_cmp(s1l,s2l);
6351 else emit_test(s1l,s1l);
6352 emit_cmovne_reg(alt,addr);
6355 if((opcode[i]&0x3f)==0x14) // BEQL
6358 if(s2h>=0) emit_cmp(s1h,s2h);
6359 else emit_test(s1h,s1h);
6363 if(s2l>=0) emit_cmp(s1l,s2l);
6364 else emit_test(s1l,s1l);
6365 if(nottaken) set_jump_target(nottaken,(int)out);
6369 if((opcode[i]&0x3f)==0x15) // BNEL
6372 if(s2h>=0) emit_cmp(s1h,s2h);
6373 else emit_test(s1h,s1h);
6377 if(s2l>=0) emit_cmp(s1l,s2l);
6378 else emit_test(s1l,s1l);
6381 if(taken) set_jump_target(taken,(int)out);
6383 if((opcode[i]&0x3f)==6) // BLEZ
6385 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6387 if(s1h>=0) emit_mov(addr,ntaddr);
6388 emit_cmovl_reg(alt,addr);
6391 emit_cmovne_reg(ntaddr,addr);
6392 emit_cmovs_reg(alt,addr);
6395 if((opcode[i]&0x3f)==7) // BGTZ
6397 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6399 if(s1h>=0) emit_mov(addr,alt);
6400 emit_cmovl_reg(ntaddr,addr);
6403 emit_cmovne_reg(alt,addr);
6404 emit_cmovs_reg(ntaddr,addr);
6407 if((opcode[i]&0x3f)==0x16) // BLEZL
6409 assert((opcode[i]&0x3f)!=0x16);
6411 if((opcode[i]&0x3f)==0x17) // BGTZL
6413 assert((opcode[i]&0x3f)!=0x17);
6415 assert(opcode[i]!=1); // BLTZ/BGEZ
6417 //FIXME: Check CSREG
6418 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6419 if((source[i]&0x30000)==0) // BC1F
6421 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6422 emit_testimm(s1l,0x800000);
6423 emit_cmovne_reg(alt,addr);
6425 if((source[i]&0x30000)==0x10000) // BC1T
6427 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6428 emit_testimm(s1l,0x800000);
6429 emit_cmovne_reg(alt,addr);
6431 if((source[i]&0x30000)==0x20000) // BC1FL
6433 emit_testimm(s1l,0x800000);
6437 if((source[i]&0x30000)==0x30000) // BC1TL
6439 emit_testimm(s1l,0x800000);
6445 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6446 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6447 if(likely[i]||unconditional)
6449 emit_movimm(ba[i],HOST_BTREG);
6451 else if(addr!=HOST_BTREG)
6453 emit_mov(addr,HOST_BTREG);
6455 void *branch_addr=out;
6457 int target_addr=start+i*4+5;
6459 void *compiled_target_addr=check_addr(target_addr);
6460 emit_extjump_ds((int)branch_addr,target_addr);
6461 if(compiled_target_addr) {
6462 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6463 add_link(target_addr,stub);
6465 else set_jump_target((int)branch_addr,(int)stub);
6468 set_jump_target((int)nottaken,(int)out);
6469 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6470 void *branch_addr=out;
6472 int target_addr=start+i*4+8;
6474 void *compiled_target_addr=check_addr(target_addr);
6475 emit_extjump_ds((int)branch_addr,target_addr);
6476 if(compiled_target_addr) {
6477 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6478 add_link(target_addr,stub);
6480 else set_jump_target((int)branch_addr,(int)stub);
6484 // Assemble the delay slot for the above
6485 static void pagespan_ds()
6487 assem_debug("initial delay slot:\n");
6488 u_int vaddr=start+1;
6489 u_int page=get_page(vaddr);
6490 u_int vpage=get_vpage(vaddr);
6491 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6493 ll_add(jump_in+page,vaddr,(void *)out);
6494 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6495 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6496 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6497 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6498 emit_writeword(HOST_BTREG,(int)&branch_target);
6499 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6500 address_generation(0,®s[0],regs[0].regmap_entry);
6501 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6502 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6507 alu_assemble(0,®s[0]);break;
6509 imm16_assemble(0,®s[0]);break;
6511 shift_assemble(0,®s[0]);break;
6513 shiftimm_assemble(0,®s[0]);break;
6515 load_assemble(0,®s[0]);break;
6517 loadlr_assemble(0,®s[0]);break;
6519 store_assemble(0,®s[0]);break;
6521 storelr_assemble(0,®s[0]);break;
6523 cop0_assemble(0,®s[0]);break;
6525 cop1_assemble(0,®s[0]);break;
6527 c1ls_assemble(0,®s[0]);break;
6529 cop2_assemble(0,®s[0]);break;
6531 c2ls_assemble(0,®s[0]);break;
6533 c2op_assemble(0,®s[0]);break;
6535 fconv_assemble(0,®s[0]);break;
6537 float_assemble(0,®s[0]);break;
6539 fcomp_assemble(0,®s[0]);break;
6541 multdiv_assemble(0,®s[0]);break;
6543 mov_assemble(0,®s[0]);break;
6553 printf("Jump in the delay slot. This is probably a bug.\n");
6555 int btaddr=get_reg(regs[0].regmap,BTREG);
6557 btaddr=get_reg(regs[0].regmap,-1);
6558 emit_readword((int)&branch_target,btaddr);
6560 assert(btaddr!=HOST_CCREG);
6561 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6563 emit_movimm(start+4,HOST_TEMPREG);
6564 emit_cmp(btaddr,HOST_TEMPREG);
6566 emit_cmpimm(btaddr,start+4);
6568 int branch=(int)out;
6570 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6571 emit_jmp(jump_vaddr_reg[btaddr]);
6572 set_jump_target(branch,(int)out);
6573 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6574 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6577 // Basic liveness analysis for MIPS registers
6578 void unneeded_registers(int istart,int iend,int r)
6582 uint64_t temp_u,temp_uu;
6587 u=unneeded_reg[iend+1];
6588 uu=unneeded_reg_upper[iend+1];
6591 for (i=iend;i>=istart;i--)
6593 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6594 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6596 // If subroutine call, flag return address as a possible branch target
6597 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6599 if(ba[i]<start || ba[i]>=(start+slen*4))
6601 // Branch out of this block, flush all regs
6605 if(itype[i]==UJUMP&&rt1[i]==31)
6607 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6609 if(itype[i]==RJUMP&&rs1[i]==31)
6611 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6613 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6614 if(itype[i]==UJUMP&&rt1[i]==31)
6616 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6617 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6619 if(itype[i]==RJUMP&&rs1[i]==31)
6621 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6622 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6625 branch_unneeded_reg[i]=u;
6626 branch_unneeded_reg_upper[i]=uu;
6627 // Merge in delay slot
6628 tdep=(~uu>>rt1[i+1])&1;
6629 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6630 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6631 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6632 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6633 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6635 // If branch is "likely" (and conditional)
6636 // then we skip the delay slot on the fall-thru path
6639 u&=unneeded_reg[i+2];
6640 uu&=unneeded_reg_upper[i+2];
6651 // Internal branch, flag target
6652 bt[(ba[i]-start)>>2]=1;
6653 if(ba[i]<=start+i*4) {
6655 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6657 // Unconditional branch
6660 // Conditional branch (not taken case)
6661 temp_u=unneeded_reg[i+2];
6662 temp_uu=unneeded_reg_upper[i+2];
6664 // Merge in delay slot
6665 tdep=(~temp_uu>>rt1[i+1])&1;
6666 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6667 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6668 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6669 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6670 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6671 temp_u|=1;temp_uu|=1;
6672 // If branch is "likely" (and conditional)
6673 // then we skip the delay slot on the fall-thru path
6676 temp_u&=unneeded_reg[i+2];
6677 temp_uu&=unneeded_reg_upper[i+2];
6685 tdep=(~temp_uu>>rt1[i])&1;
6686 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6687 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6688 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6689 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6690 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6691 temp_u|=1;temp_uu|=1;
6692 unneeded_reg[i]=temp_u;
6693 unneeded_reg_upper[i]=temp_uu;
6694 // Only go three levels deep. This recursion can take an
6695 // excessive amount of time if there are a lot of nested loops.
6697 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6699 unneeded_reg[(ba[i]-start)>>2]=1;
6700 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6703 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6705 // Unconditional branch
6706 u=unneeded_reg[(ba[i]-start)>>2];
6707 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6708 branch_unneeded_reg[i]=u;
6709 branch_unneeded_reg_upper[i]=uu;
6712 //branch_unneeded_reg[i]=u;
6713 //branch_unneeded_reg_upper[i]=uu;
6714 // Merge in delay slot
6715 tdep=(~uu>>rt1[i+1])&1;
6716 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6717 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6718 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6719 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6720 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6723 // Conditional branch
6724 b=unneeded_reg[(ba[i]-start)>>2];
6725 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6726 branch_unneeded_reg[i]=b;
6727 branch_unneeded_reg_upper[i]=bu;
6730 //branch_unneeded_reg[i]=b;
6731 //branch_unneeded_reg_upper[i]=bu;
6732 // Branch delay slot
6733 tdep=(~uu>>rt1[i+1])&1;
6734 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6735 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6736 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6737 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6738 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6740 // If branch is "likely" then we skip the
6741 // delay slot on the fall-thru path
6746 u&=unneeded_reg[i+2];
6747 uu&=unneeded_reg_upper[i+2];
6758 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6759 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6760 //branch_unneeded_reg[i]=1;
6761 //branch_unneeded_reg_upper[i]=1;
6763 branch_unneeded_reg[i]=1;
6764 branch_unneeded_reg_upper[i]=1;
6770 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
6772 // SYSCALL instruction (software interrupt)
6776 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6778 // ERET instruction (return from interrupt)
6783 tdep=(~uu>>rt1[i])&1;
6784 // Written registers are unneeded
6789 // Accessed registers are needed
6794 // Source-target dependencies
6795 uu&=~(tdep<<dep1[i]);
6796 uu&=~(tdep<<dep2[i]);
6797 // R0 is always unneeded
6801 unneeded_reg_upper[i]=uu;
6803 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
6806 for(r=1;r<=CCREG;r++) {
6807 if((unneeded_reg[i]>>r)&1) {
6808 if(r==HIREG) printf(" HI");
6809 else if(r==LOREG) printf(" LO");
6810 else printf(" r%d",r);
6814 for(r=1;r<=CCREG;r++) {
6815 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
6816 if(r==HIREG) printf(" HI");
6817 else if(r==LOREG) printf(" LO");
6818 else printf(" r%d",r);
6824 for (i=iend;i>=istart;i--)
6826 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
6831 // Identify registers which are likely to contain 32-bit values
6832 // This is used to predict whether any branches will jump to a
6833 // location with 64-bit values in registers.
6834 static void provisional_32bit()
6838 uint64_t lastbranch=1;
6843 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
6844 if(i>1) is32=lastbranch;
6850 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
6852 if(i>2) is32=lastbranch;
6856 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
6858 if(rs1[i-2]==0||rs2[i-2]==0)
6861 is32|=1LL<<rs1[i-2];
6864 is32|=1LL<<rs2[i-2];
6869 // If something jumps here with 64-bit values
6870 // then promote those registers to 64 bits
6873 uint64_t temp_is32=is32;
6876 if(ba[j]==start+i*4)
6877 //temp_is32&=branch_regs[j].is32;
6882 if(ba[j]==start+i*4)
6893 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
6894 // Branches don't write registers, consider the delay slot instead.
6905 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
6906 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
6915 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
6916 if(op==0x22) is32|=1LL<<rt; // LWL
6919 if (op==0x08||op==0x09|| // ADDI/ADDIU
6920 op==0x0a||op==0x0b|| // SLTI/SLTIU
6926 if(op==0x18||op==0x19) { // DADDI/DADDIU
6929 // is32|=((is32>>s1)&1LL)<<rt;
6931 if(op==0x0d||op==0x0e) { // ORI/XORI
6932 uint64_t sr=((is32>>s1)&1LL);
6948 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
6951 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
6954 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
6955 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
6959 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
6964 uint64_t sr=((is32>>s1)&1LL);
6969 uint64_t sr=((is32>>s2)&1LL);
6977 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
6982 uint64_t sr=((is32>>s1)&1LL);
6992 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
6993 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
6996 is32|=(1LL<<HIREG)|(1LL<<LOREG);
7001 uint64_t sr=((is32>>s1)&1LL);
7007 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
7008 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
7012 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
7013 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
7016 if(op2==0) is32|=1LL<<rt; // MFC0
7020 if(op2==0) is32|=1LL<<rt; // MFC1
7021 if(op2==1) is32&=~(1LL<<rt); // DMFC1
7022 if(op2==2) is32|=1LL<<rt; // CFC1
7044 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
7046 if(rt1[i-1]==31) // JAL/JALR
7048 // Subroutine call will return here, don't alloc any registers
7053 // Internal branch will jump here, match registers to caller
7061 // Identify registers which may be assumed to contain 32-bit values
7062 // and where optimizations will rely on this.
7063 // This is used to determine whether backward branches can safely
7064 // jump to a location with 64-bit values in registers.
7065 static void provisional_r32()
7070 for (i=slen-1;i>=0;i--)
7073 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7075 if(ba[i]<start || ba[i]>=(start+slen*4))
7077 // Branch out of this block, don't need anything
7083 // Need whatever matches the target
7084 // (and doesn't get overwritten by the delay slot instruction)
7086 int t=(ba[i]-start)>>2;
7087 if(ba[i]>start+i*4) {
7089 //if(!(requires_32bit[t]&~regs[i].was32))
7090 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7091 if(!(pr32[t]&~regs[i].was32))
7092 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7095 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7096 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7099 // Conditional branch may need registers for following instructions
7100 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7103 //r32|=requires_32bit[i+2];
7106 // Mark this address as a branch target since it may be called
7107 // upon return from interrupt
7111 // Merge in delay slot
7113 // These are overwritten unless the branch is "likely"
7114 // and the delay slot is nullified if not taken
7115 r32&=~(1LL<<rt1[i+1]);
7116 r32&=~(1LL<<rt2[i+1]);
7118 // Assume these are needed (delay slot)
7121 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7125 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7127 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7129 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7131 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7133 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7136 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7138 // SYSCALL instruction (software interrupt)
7141 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7143 // ERET instruction (return from interrupt)
7147 r32&=~(1LL<<rt1[i]);
7148 r32&=~(1LL<<rt2[i]);
7151 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7155 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7157 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7159 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7161 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7163 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7165 //requires_32bit[i]=r32;
7168 // Dirty registers which are 32-bit, require 32-bit input
7169 // as they will be written as 32-bit values
7170 for(hr=0;hr<HOST_REGS;hr++)
7172 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7173 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7174 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7175 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7176 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7183 // Write back dirty registers as soon as we will no longer modify them,
7184 // so that we don't end up with lots of writes at the branches.
7185 void clean_registers(int istart,int iend,int wr)
7189 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7190 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7192 will_dirty_i=will_dirty_next=0;
7193 wont_dirty_i=wont_dirty_next=0;
7195 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7196 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7198 for (i=iend;i>=istart;i--)
7200 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7202 if(ba[i]<start || ba[i]>=(start+slen*4))
7204 // Branch out of this block, flush all regs
7205 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7207 // Unconditional branch
7210 // Merge in delay slot (will dirty)
7211 for(r=0;r<HOST_REGS;r++) {
7212 if(r!=EXCLUDE_REG) {
7213 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7214 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7215 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7216 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7217 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7218 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7219 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7220 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7221 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7222 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7223 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7224 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7225 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7226 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7232 // Conditional branch
7234 wont_dirty_i=wont_dirty_next;
7235 // Merge in delay slot (will dirty)
7236 for(r=0;r<HOST_REGS;r++) {
7237 if(r!=EXCLUDE_REG) {
7239 // Might not dirty if likely branch is not taken
7240 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7241 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7242 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7243 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7244 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7245 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7246 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7247 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7248 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7249 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7250 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7251 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7252 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7253 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7258 // Merge in delay slot (wont dirty)
7259 for(r=0;r<HOST_REGS;r++) {
7260 if(r!=EXCLUDE_REG) {
7261 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7262 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7263 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7264 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7265 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7266 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7267 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7268 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7269 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7270 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7274 #ifndef DESTRUCTIVE_WRITEBACK
7275 branch_regs[i].dirty&=wont_dirty_i;
7277 branch_regs[i].dirty|=will_dirty_i;
7283 if(ba[i]<=start+i*4) {
7285 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7287 // Unconditional branch
7290 // Merge in delay slot (will dirty)
7291 for(r=0;r<HOST_REGS;r++) {
7292 if(r!=EXCLUDE_REG) {
7293 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7294 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7295 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7296 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7297 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7298 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7299 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7300 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7301 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7302 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7303 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7304 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7305 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7306 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7310 // Conditional branch (not taken case)
7311 temp_will_dirty=will_dirty_next;
7312 temp_wont_dirty=wont_dirty_next;
7313 // Merge in delay slot (will dirty)
7314 for(r=0;r<HOST_REGS;r++) {
7315 if(r!=EXCLUDE_REG) {
7317 // Will not dirty if likely branch is not taken
7318 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7319 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7320 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7321 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7322 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7323 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7324 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7325 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7326 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7327 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7328 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7329 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7330 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7331 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7336 // Merge in delay slot (wont dirty)
7337 for(r=0;r<HOST_REGS;r++) {
7338 if(r!=EXCLUDE_REG) {
7339 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7340 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7341 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7342 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7343 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7344 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7345 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7346 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7347 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7348 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7351 // Deal with changed mappings
7353 for(r=0;r<HOST_REGS;r++) {
7354 if(r!=EXCLUDE_REG) {
7355 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7356 temp_will_dirty&=~(1<<r);
7357 temp_wont_dirty&=~(1<<r);
7358 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7359 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7360 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7362 temp_will_dirty|=1<<r;
7363 temp_wont_dirty|=1<<r;
7370 will_dirty[i]=temp_will_dirty;
7371 wont_dirty[i]=temp_wont_dirty;
7372 clean_registers((ba[i]-start)>>2,i-1,0);
7374 // Limit recursion. It can take an excessive amount
7375 // of time if there are a lot of nested loops.
7376 will_dirty[(ba[i]-start)>>2]=0;
7377 wont_dirty[(ba[i]-start)>>2]=-1;
7382 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7384 // Unconditional branch
7387 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7388 for(r=0;r<HOST_REGS;r++) {
7389 if(r!=EXCLUDE_REG) {
7390 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7391 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7392 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7397 // Merge in delay slot
7398 for(r=0;r<HOST_REGS;r++) {
7399 if(r!=EXCLUDE_REG) {
7400 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7401 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7402 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7403 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7404 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7405 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7406 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7407 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7408 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7409 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7410 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7411 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7412 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7413 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7417 // Conditional branch
7418 will_dirty_i=will_dirty_next;
7419 wont_dirty_i=wont_dirty_next;
7420 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7421 for(r=0;r<HOST_REGS;r++) {
7422 if(r!=EXCLUDE_REG) {
7423 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7424 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7425 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7429 will_dirty_i&=~(1<<r);
7431 // Treat delay slot as part of branch too
7432 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7433 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7434 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7438 will_dirty[i+1]&=~(1<<r);
7443 // Merge in delay slot
7444 for(r=0;r<HOST_REGS;r++) {
7445 if(r!=EXCLUDE_REG) {
7447 // Might not dirty if likely branch is not taken
7448 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7449 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7450 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7451 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7452 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7453 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7454 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7455 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7456 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7457 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7458 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7459 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7460 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7461 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7466 // Merge in delay slot
7467 for(r=0;r<HOST_REGS;r++) {
7468 if(r!=EXCLUDE_REG) {
7469 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7470 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7471 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7472 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7473 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7474 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7475 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7476 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7477 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7478 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7482 #ifndef DESTRUCTIVE_WRITEBACK
7483 branch_regs[i].dirty&=wont_dirty_i;
7485 branch_regs[i].dirty|=will_dirty_i;
7490 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7492 // SYSCALL instruction (software interrupt)
7496 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7498 // ERET instruction (return from interrupt)
7502 will_dirty_next=will_dirty_i;
7503 wont_dirty_next=wont_dirty_i;
7504 for(r=0;r<HOST_REGS;r++) {
7505 if(r!=EXCLUDE_REG) {
7506 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7507 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7508 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7509 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7510 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7511 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7512 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7513 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7515 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7517 // Don't store a register immediately after writing it,
7518 // may prevent dual-issue.
7519 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7520 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7526 will_dirty[i]=will_dirty_i;
7527 wont_dirty[i]=wont_dirty_i;
7528 // Mark registers that won't be dirtied as not dirty
7530 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7531 for(r=0;r<HOST_REGS;r++) {
7532 if((will_dirty_i>>r)&1) {
7538 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7539 regs[i].dirty|=will_dirty_i;
7540 #ifndef DESTRUCTIVE_WRITEBACK
7541 regs[i].dirty&=wont_dirty_i;
7542 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7544 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7545 for(r=0;r<HOST_REGS;r++) {
7546 if(r!=EXCLUDE_REG) {
7547 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7548 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7549 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7557 for(r=0;r<HOST_REGS;r++) {
7558 if(r!=EXCLUDE_REG) {
7559 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7560 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7561 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7569 // Deal with changed mappings
7570 temp_will_dirty=will_dirty_i;
7571 temp_wont_dirty=wont_dirty_i;
7572 for(r=0;r<HOST_REGS;r++) {
7573 if(r!=EXCLUDE_REG) {
7575 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7577 #ifndef DESTRUCTIVE_WRITEBACK
7578 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7580 regs[i].wasdirty|=will_dirty_i&(1<<r);
7583 else if((nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7584 // Register moved to a different register
7585 will_dirty_i&=~(1<<r);
7586 wont_dirty_i&=~(1<<r);
7587 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7588 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7590 #ifndef DESTRUCTIVE_WRITEBACK
7591 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7593 regs[i].wasdirty|=will_dirty_i&(1<<r);
7597 will_dirty_i&=~(1<<r);
7598 wont_dirty_i&=~(1<<r);
7599 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7600 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7601 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7604 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7613 void disassemble_inst(int i)
7615 if (bt[i]) printf("*"); else printf(" ");
7618 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7620 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;
7622 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;
7624 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7626 if (opcode[i]==0x9&&rt1[i]!=31)
7627 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7629 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7632 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7634 if(opcode[i]==0xf) //LUI
7635 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7637 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7641 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7645 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7649 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7652 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7655 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7658 if((opcode2[i]&0x1d)==0x10)
7659 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7660 else if((opcode2[i]&0x1d)==0x11)
7661 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7663 printf (" %x: %s\n",start+i*4,insn[i]);
7667 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7668 else if(opcode2[i]==4)
7669 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7670 else printf (" %x: %s\n",start+i*4,insn[i]);
7674 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7675 else if(opcode2[i]>3)
7676 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7677 else printf (" %x: %s\n",start+i*4,insn[i]);
7681 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7682 else if(opcode2[i]>3)
7683 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7684 else printf (" %x: %s\n",start+i*4,insn[i]);
7687 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7690 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7693 printf (" %x: %s (INTCALL)\n",start+i*4,insn[i]);
7696 //printf (" %s %8x\n",insn[i],source[i]);
7697 printf (" %x: %s\n",start+i*4,insn[i]);
7701 void new_dynarec_init()
7703 printf("Init new dynarec\n");
7704 out=(u_char *)BASE_ADDR;
7705 if (mmap (out, 1<<TARGET_SIZE_2,
7706 PROT_READ | PROT_WRITE | PROT_EXEC,
7707 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
7708 -1, 0) <= 0) {printf("mmap() failed\n");}
7710 rdword=&readmem_dword;
7711 fake_pc.f.r.rs=&readmem_dword;
7712 fake_pc.f.r.rt=&readmem_dword;
7713 fake_pc.f.r.rd=&readmem_dword;
7716 for(n=0x80000;n<0x80800;n++)
7718 for(n=0;n<65536;n++)
7719 hash_table[n][0]=hash_table[n][2]=-1;
7720 memset(mini_ht,-1,sizeof(mini_ht));
7721 memset(restore_candidate,0,sizeof(restore_candidate));
7723 expirep=16384; // Expiry pointer, +2 blocks
7724 pending_exception=0;
7727 // Copy this into local area so we don't have to put it in every literal pool
7728 invc_ptr=invalid_code;
7733 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7735 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7736 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7737 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7740 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
7741 writemem[n] = write_nomem_new;
7742 writememb[n] = write_nomemb_new;
7743 writememh[n] = write_nomemh_new;
7745 writememd[n] = write_nomemd_new;
7747 readmem[n] = read_nomem_new;
7748 readmemb[n] = read_nomemb_new;
7749 readmemh[n] = read_nomemh_new;
7751 readmemd[n] = read_nomemd_new;
7754 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
7755 writemem[n] = write_rdram_new;
7756 writememb[n] = write_rdramb_new;
7757 writememh[n] = write_rdramh_new;
7759 writememd[n] = write_rdramd_new;
7762 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
7763 writemem[n] = write_nomem_new;
7764 writememb[n] = write_nomemb_new;
7765 writememh[n] = write_nomemh_new;
7767 writememd[n] = write_nomemd_new;
7769 readmem[n] = read_nomem_new;
7770 readmemb[n] = read_nomemb_new;
7771 readmemh[n] = read_nomemh_new;
7773 readmemd[n] = read_nomemd_new;
7781 void new_dynarec_cleanup()
7784 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {printf("munmap() failed\n");}
7785 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7786 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7787 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7789 if (munmap (ROM_COPY, 67108864) < 0) {printf("munmap() failed\n");}
7793 int new_recompile_block(int addr)
7796 if(addr==0x800cd050) {
7798 for(block=0x80000;block<0x80800;block++) invalidate_block(block);
7800 for(n=0;n<=2048;n++) ll_clear(jump_dirty+n);
7803 //if(Count==365117028) tracedebug=1;
7804 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7805 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
7806 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
7808 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
7809 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
7810 /*if(Count>=312978186) {
7814 start = (u_int)addr&~3;
7815 //assert(((u_int)addr&1)==0);
7817 if (Config.HLE && start == 0x80001000) // hlecall
7819 // XXX: is this enough? Maybe check hleSoftCall?
7820 u_int beginning=(u_int)out;
7821 u_int page=get_page(start);
7822 invalid_code[start>>12]=0;
7823 emit_movimm(start,0);
7824 emit_writeword(0,(int)&pcaddr);
7825 emit_jmp((int)new_dyna_leave);
7827 __clear_cache((void *)beginning,out);
7829 ll_add(jump_in+page,start,(void *)beginning);
7832 else if ((u_int)addr < 0x00200000 ||
7833 (0xa0000000 <= addr && addr < 0xa0200000)) {
7834 // used for BIOS calls mostly?
7835 source = (u_int *)((u_int)rdram+(start&0x1fffff));
7836 pagelimit = (addr&0xa0000000)|0x00200000;
7838 else if (!Config.HLE && (
7839 /* (0x9fc00000 <= addr && addr < 0x9fc80000) ||*/
7840 (0xbfc00000 <= addr && addr < 0xbfc80000))) {
7842 source = (u_int *)((u_int)psxR+(start&0x7ffff));
7843 pagelimit = (addr&0xfff00000)|0x80000;
7848 if ((int)addr >= 0xa4000000 && (int)addr < 0xa4001000) {
7849 source = (u_int *)((u_int)SP_DMEM+start-0xa4000000);
7850 pagelimit = 0xa4001000;
7854 if ((int)addr >= 0x80000000 && (int)addr < 0x80000000+RAM_SIZE) {
7855 source = (u_int *)((u_int)rdram+start-0x80000000);
7856 pagelimit = 0x80000000+RAM_SIZE;
7859 else if ((signed int)addr >= (signed int)0xC0000000) {
7860 //printf("addr=%x mm=%x\n",(u_int)addr,(memory_map[start>>12]<<2));
7861 //if(tlb_LUT_r[start>>12])
7862 //source = (u_int *)(((int)rdram)+(tlb_LUT_r[start>>12]&0xFFFFF000)+(((int)addr)&0xFFF)-0x80000000);
7863 if((signed int)memory_map[start>>12]>=0) {
7864 source = (u_int *)((u_int)(start+(memory_map[start>>12]<<2)));
7865 pagelimit=(start+4096)&0xFFFFF000;
7866 int map=memory_map[start>>12];
7869 //printf("start: %x next: %x\n",map,memory_map[pagelimit>>12]);
7870 if((map&0xBFFFFFFF)==(memory_map[pagelimit>>12]&0xBFFFFFFF)) pagelimit+=4096;
7872 assem_debug("pagelimit=%x\n",pagelimit);
7873 assem_debug("mapping=%x (%x)\n",memory_map[start>>12],(memory_map[start>>12]<<2)+start);
7876 assem_debug("Compile at unmapped memory address: %x \n", (int)addr);
7877 //assem_debug("start: %x next: %x\n",memory_map[start>>12],memory_map[(start+4096)>>12]);
7878 return -1; // Caller will invoke exception handler
7880 //printf("source= %x\n",(int)source);
7884 printf("Compile at bogus memory address: %x \n", (int)addr);
7888 /* Pass 1: disassemble */
7889 /* Pass 2: register dependencies, branch targets */
7890 /* Pass 3: register allocation */
7891 /* Pass 4: branch dependencies */
7892 /* Pass 5: pre-alloc */
7893 /* Pass 6: optimize clean/dirty state */
7894 /* Pass 7: flag 32-bit registers */
7895 /* Pass 8: assembly */
7896 /* Pass 9: linker */
7897 /* Pass 10: garbage collection / free memory */
7901 unsigned int type,op,op2;
7903 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
7905 /* Pass 1 disassembly */
7907 for(i=0;!done;i++) {
7908 bt[i]=0;likely[i]=0;ooo[i]=0;op2=0;
7909 minimum_free_regs[i]=0;
7910 opcode[i]=op=source[i]>>26;
7913 case 0x00: strcpy(insn[i],"special"); type=NI;
7917 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
7918 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
7919 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
7920 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
7921 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
7922 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
7923 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
7924 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
7925 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
7926 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
7927 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
7928 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
7929 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
7930 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
7931 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
7932 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
7933 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
7934 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
7935 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
7936 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
7937 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
7938 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
7939 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
7940 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
7941 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
7942 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
7943 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
7944 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
7945 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
7946 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
7947 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
7948 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
7949 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
7950 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
7951 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
7952 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
7953 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
7954 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
7955 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
7956 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
7957 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
7958 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
7959 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
7960 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
7961 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
7962 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
7963 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
7964 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
7965 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
7966 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
7967 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
7968 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
7971 case 0x01: strcpy(insn[i],"regimm"); type=NI;
7972 op2=(source[i]>>16)&0x1f;
7975 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
7976 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
7977 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
7978 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
7979 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
7980 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
7981 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
7982 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
7983 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
7984 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
7985 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
7986 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
7987 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
7988 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
7991 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
7992 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
7993 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
7994 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
7995 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
7996 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
7997 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
7998 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
7999 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
8000 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
8001 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
8002 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
8003 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
8004 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
8005 case 0x10: strcpy(insn[i],"cop0"); type=NI;
8006 op2=(source[i]>>21)&0x1f;
8009 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
8010 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
8011 case 0x10: strcpy(insn[i],"tlb"); type=NI;
8012 switch(source[i]&0x3f)
8014 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
8015 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
8016 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
8017 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
8019 case 0x10: strcpy(insn[i],"RFE"); type=COP0; break;
8021 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
8026 case 0x11: strcpy(insn[i],"cop1"); type=NI;
8027 op2=(source[i]>>21)&0x1f;
8030 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
8031 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
8032 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
8033 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
8034 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
8035 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
8036 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
8037 switch((source[i]>>16)&0x3)
8039 case 0x00: strcpy(insn[i],"BC1F"); break;
8040 case 0x01: strcpy(insn[i],"BC1T"); break;
8041 case 0x02: strcpy(insn[i],"BC1FL"); break;
8042 case 0x03: strcpy(insn[i],"BC1TL"); break;
8045 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
8046 switch(source[i]&0x3f)
8048 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
8049 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
8050 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
8051 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
8052 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
8053 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
8054 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
8055 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
8056 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
8057 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
8058 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
8059 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
8060 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
8061 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
8062 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
8063 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
8064 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
8065 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
8066 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
8067 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
8068 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
8069 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
8070 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
8071 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
8072 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
8073 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
8074 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
8075 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
8076 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
8077 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
8078 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
8079 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
8080 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
8081 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
8082 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
8085 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8086 switch(source[i]&0x3f)
8088 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8089 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8090 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8091 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8092 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8093 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8094 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8095 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8096 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8097 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8098 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8099 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8100 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8101 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8102 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8103 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8104 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8105 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8106 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8107 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8108 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8109 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8110 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8111 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8112 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8113 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8114 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8115 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8116 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8117 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8118 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8119 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8120 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8121 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8122 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8125 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8126 switch(source[i]&0x3f)
8128 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8129 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8132 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8133 switch(source[i]&0x3f)
8135 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8136 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8142 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8143 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8144 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8145 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8146 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8147 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8148 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8149 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8151 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8152 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8153 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8154 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8155 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8156 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8157 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8158 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8159 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8160 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8161 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8162 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8164 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8165 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8167 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8168 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8169 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8170 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8172 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8173 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8174 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8176 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8177 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8179 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8180 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8181 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8184 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8185 // note: COP MIPS-1 encoding differs from MIPS32
8186 op2=(source[i]>>21)&0x1f;
8187 if (source[i]&0x3f) {
8188 if (gte_handlers[source[i]&0x3f]!=NULL) {
8189 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8195 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8196 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8197 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8198 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8201 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8202 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8203 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8205 default: strcpy(insn[i],"???"); type=NI;
8206 printf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8210 /* detect branch in delay slot early */
8211 if(type==RJUMP||type==UJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
8212 opcode[i+1]=source[i+1]>>26;
8213 opcode2[i+1]=source[i+1]&0x3f;
8214 if((0<opcode[i+1]&&opcode[i+1]<8)||(opcode[i+1]==0&&(opcode2[i+1]==8||opcode2[i+1]==9))) {
8215 printf("branch in delay slot @%08x (%08x)\n", addr + i*4+4, addr);
8216 // don't handle first branch and call interpreter if it's hit
8223 /* Get registers/immediates */
8231 rs1[i]=(source[i]>>21)&0x1f;
8233 rt1[i]=(source[i]>>16)&0x1f;
8235 imm[i]=(short)source[i];
8239 rs1[i]=(source[i]>>21)&0x1f;
8240 rs2[i]=(source[i]>>16)&0x1f;
8243 imm[i]=(short)source[i];
8244 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8247 // LWL/LWR only load part of the register,
8248 // therefore the target register must be treated as a source too
8249 rs1[i]=(source[i]>>21)&0x1f;
8250 rs2[i]=(source[i]>>16)&0x1f;
8251 rt1[i]=(source[i]>>16)&0x1f;
8253 imm[i]=(short)source[i];
8254 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8255 if(op==0x26) dep1[i]=rt1[i]; // LWR
8258 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8259 else rs1[i]=(source[i]>>21)&0x1f;
8261 rt1[i]=(source[i]>>16)&0x1f;
8263 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8264 imm[i]=(unsigned short)source[i];
8266 imm[i]=(short)source[i];
8268 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8269 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8270 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8277 // The JAL instruction writes to r31.
8284 rs1[i]=(source[i]>>21)&0x1f;
8288 // The JALR instruction writes to rd.
8290 rt1[i]=(source[i]>>11)&0x1f;
8295 rs1[i]=(source[i]>>21)&0x1f;
8296 rs2[i]=(source[i]>>16)&0x1f;
8299 if(op&2) { // BGTZ/BLEZ
8307 rs1[i]=(source[i]>>21)&0x1f;
8312 if(op2&0x10) { // BxxAL
8314 // NOTE: If the branch is not taken, r31 is still overwritten
8316 likely[i]=(op2&2)>>1;
8323 likely[i]=((source[i])>>17)&1;
8326 rs1[i]=(source[i]>>21)&0x1f; // source
8327 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8328 rt1[i]=(source[i]>>11)&0x1f; // destination
8330 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8331 us1[i]=rs1[i];us2[i]=rs2[i];
8333 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8334 dep1[i]=rs1[i];dep2[i]=rs2[i];
8336 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8337 dep1[i]=rs1[i];dep2[i]=rs2[i];
8341 rs1[i]=(source[i]>>21)&0x1f; // source
8342 rs2[i]=(source[i]>>16)&0x1f; // divisor
8345 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8346 us1[i]=rs1[i];us2[i]=rs2[i];
8354 if(op2==0x10) rs1[i]=HIREG; // MFHI
8355 if(op2==0x11) rt1[i]=HIREG; // MTHI
8356 if(op2==0x12) rs1[i]=LOREG; // MFLO
8357 if(op2==0x13) rt1[i]=LOREG; // MTLO
8358 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8359 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8363 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8364 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8365 rt1[i]=(source[i]>>11)&0x1f; // destination
8367 // DSLLV/DSRLV/DSRAV are 64-bit
8368 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8371 rs1[i]=(source[i]>>16)&0x1f;
8373 rt1[i]=(source[i]>>11)&0x1f;
8375 imm[i]=(source[i]>>6)&0x1f;
8376 // DSxx32 instructions
8377 if(op2>=0x3c) imm[i]|=0x20;
8378 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8379 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8386 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8387 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8388 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8389 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8397 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8398 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8399 if(op2==5) us1[i]=rs1[i]; // DMTC1
8403 rs1[i]=(source[i]>>21)&0x1F;
8407 imm[i]=(short)source[i];
8410 rs1[i]=(source[i]>>21)&0x1F;
8414 imm[i]=(short)source[i];
8443 /* Calculate branch target addresses */
8445 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8446 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8447 ba[i]=start+i*4+8; // Ignore never taken branch
8448 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8449 ba[i]=start+i*4+8; // Ignore never taken branch
8450 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8451 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8453 /* Is this the end of the block? */
8454 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8456 // check for link register access in delay slot
8458 if(rt1_!=0&&(rs1[i]==rt1_||rs2[i]==rt1_||rt1[i]==rt1_||rt2[i]==rt1_)) {
8459 printf("link access in delay slot @%08x (%08x)\n", addr + i*4, addr);
8466 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8470 if(stop_after_jal) done=1;
8472 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8474 // Don't recompile stuff that's already compiled
8475 if(check_addr(start+i*4+4)) done=1;
8476 // Don't get too close to the limit
8477 if(i>MAXBLOCK/2) done=1;
8479 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8480 if(itype[i]==HLECALL||itype[i]==INTCALL) done=2;
8482 // Does the block continue due to a branch?
8485 if(ba[j]==start+i*4+4) done=j=0;
8486 if(ba[j]==start+i*4+8) done=j=0;
8489 //assert(i<MAXBLOCK-1);
8490 if(start+i*4==pagelimit-4) done=1;
8491 assert(start+i*4<pagelimit);
8492 if (i==MAXBLOCK-1) done=1;
8493 // Stop if we're compiling junk
8494 if(itype[i]==NI&&opcode[i]==0x11) {
8495 done=stop_after_jal=1;
8496 printf("Disabled speculative precompilation\n");
8500 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8501 if(start+i*4==pagelimit) {
8507 /* Pass 2 - Register dependencies and branch targets */
8509 unneeded_registers(0,slen-1,0);
8511 /* Pass 3 - Register allocation */
8513 struct regstat current; // Current register allocations/status
8516 current.u=unneeded_reg[0];
8517 current.uu=unneeded_reg_upper[0];
8518 clear_all_regs(current.regmap);
8519 alloc_reg(¤t,0,CCREG);
8520 dirty_reg(¤t,CCREG);
8528 provisional_32bit();
8531 // First instruction is delay slot
8536 unneeded_reg_upper[0]=1;
8537 current.regmap[HOST_BTREG]=BTREG;
8545 for(hr=0;hr<HOST_REGS;hr++)
8547 // Is this really necessary?
8548 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8554 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8556 if(rs1[i-2]==0||rs2[i-2]==0)
8559 current.is32|=1LL<<rs1[i-2];
8560 int hr=get_reg(current.regmap,rs1[i-2]|64);
8561 if(hr>=0) current.regmap[hr]=-1;
8564 current.is32|=1LL<<rs2[i-2];
8565 int hr=get_reg(current.regmap,rs2[i-2]|64);
8566 if(hr>=0) current.regmap[hr]=-1;
8572 // If something jumps here with 64-bit values
8573 // then promote those registers to 64 bits
8576 uint64_t temp_is32=current.is32;
8579 if(ba[j]==start+i*4)
8580 temp_is32&=branch_regs[j].is32;
8584 if(ba[j]==start+i*4)
8588 if(temp_is32!=current.is32) {
8589 //printf("dumping 32-bit regs (%x)\n",start+i*4);
8590 #ifdef DESTRUCTIVE_WRITEBACK
8591 for(hr=0;hr<HOST_REGS;hr++)
8593 int r=current.regmap[hr];
8596 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
8598 //printf("restore %d\n",r);
8603 current.is32=temp_is32;
8610 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
8611 regs[i].wasconst=current.isconst;
8612 regs[i].was32=current.is32;
8613 regs[i].wasdirty=current.dirty;
8614 #if defined(DESTRUCTIVE_WRITEBACK) && !defined(FORCE32)
8615 // To change a dirty register from 32 to 64 bits, we must write
8616 // it out during the previous cycle (for branches, 2 cycles)
8617 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)
8619 uint64_t temp_is32=current.is32;
8622 if(ba[j]==start+i*4+4)
8623 temp_is32&=branch_regs[j].is32;
8627 if(ba[j]==start+i*4+4)
8631 if(temp_is32!=current.is32) {
8632 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8633 for(hr=0;hr<HOST_REGS;hr++)
8635 int r=current.regmap[hr];
8638 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8639 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
8641 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
8643 //printf("dump %d/r%d\n",hr,r);
8644 current.regmap[hr]=-1;
8645 if(get_reg(current.regmap,r|64)>=0)
8646 current.regmap[get_reg(current.regmap,r|64)]=-1;
8654 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
8656 uint64_t temp_is32=current.is32;
8659 if(ba[j]==start+i*4+8)
8660 temp_is32&=branch_regs[j].is32;
8664 if(ba[j]==start+i*4+8)
8668 if(temp_is32!=current.is32) {
8669 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
8670 for(hr=0;hr<HOST_REGS;hr++)
8672 int r=current.regmap[hr];
8675 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
8676 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
8678 //printf("dump %d/r%d\n",hr,r);
8679 current.regmap[hr]=-1;
8680 if(get_reg(current.regmap,r|64)>=0)
8681 current.regmap[get_reg(current.regmap,r|64)]=-1;
8689 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
8691 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
8692 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
8693 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8702 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
8703 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
8704 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
8705 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8706 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8709 } else { printf("oops, branch at end of block with no delay slot\n");exit(1); }
8713 ds=0; // Skip delay slot, already allocated as part of branch
8714 // ...but we need to alloc it in case something jumps here
8716 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
8717 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
8719 current.u=branch_unneeded_reg[i-1];
8720 current.uu=branch_unneeded_reg_upper[i-1];
8722 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
8723 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
8724 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
8727 struct regstat temp;
8728 memcpy(&temp,¤t,sizeof(current));
8729 temp.wasdirty=temp.dirty;
8730 temp.was32=temp.is32;
8731 // TODO: Take into account unconditional branches, as below
8732 delayslot_alloc(&temp,i);
8733 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
8734 regs[i].wasdirty=temp.wasdirty;
8735 regs[i].was32=temp.was32;
8736 regs[i].dirty=temp.dirty;
8737 regs[i].is32=temp.is32;
8741 // Create entry (branch target) regmap
8742 for(hr=0;hr<HOST_REGS;hr++)
8744 int r=temp.regmap[hr];
8746 if(r!=regmap_pre[i][hr]) {
8747 regs[i].regmap_entry[hr]=-1;
8752 if((current.u>>r)&1) {
8753 regs[i].regmap_entry[hr]=-1;
8754 regs[i].regmap[hr]=-1;
8755 //Don't clear regs in the delay slot as the branch might need them
8756 //current.regmap[hr]=-1;
8758 regs[i].regmap_entry[hr]=r;
8761 if((current.uu>>(r&63))&1) {
8762 regs[i].regmap_entry[hr]=-1;
8763 regs[i].regmap[hr]=-1;
8764 //Don't clear regs in the delay slot as the branch might need them
8765 //current.regmap[hr]=-1;
8767 regs[i].regmap_entry[hr]=r;
8771 // First instruction expects CCREG to be allocated
8772 if(i==0&&hr==HOST_CCREG)
8773 regs[i].regmap_entry[hr]=CCREG;
8775 regs[i].regmap_entry[hr]=-1;
8779 else { // Not delay slot
8782 //current.isconst=0; // DEBUG
8783 //current.wasconst=0; // DEBUG
8784 //regs[i].wasconst=0; // DEBUG
8785 clear_const(¤t,rt1[i]);
8786 alloc_cc(¤t,i);
8787 dirty_reg(¤t,CCREG);
8789 alloc_reg(¤t,i,31);
8790 dirty_reg(¤t,31);
8791 assert(rs1[i+1]!=31&&rs2[i+1]!=31);
8792 assert(rt1[i+1]!=rt1[i]);
8794 alloc_reg(¤t,i,PTEMP);
8796 //current.is32|=1LL<<rt1[i];
8799 delayslot_alloc(¤t,i+1);
8800 //current.isconst=0; // DEBUG
8802 //printf("i=%d, isconst=%x\n",i,current.isconst);
8805 //current.isconst=0;
8806 //current.wasconst=0;
8807 //regs[i].wasconst=0;
8808 clear_const(¤t,rs1[i]);
8809 clear_const(¤t,rt1[i]);
8810 alloc_cc(¤t,i);
8811 dirty_reg(¤t,CCREG);
8812 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
8813 alloc_reg(¤t,i,rs1[i]);
8815 alloc_reg(¤t,i,rt1[i]);
8816 dirty_reg(¤t,rt1[i]);
8817 assert(rs1[i+1]!=rt1[i]&&rs2[i+1]!=rt1[i]);
8818 assert(rt1[i+1]!=rt1[i]);
8820 alloc_reg(¤t,i,PTEMP);
8824 if(rs1[i]==31) { // JALR
8825 alloc_reg(¤t,i,RHASH);
8826 #ifndef HOST_IMM_ADDR32
8827 alloc_reg(¤t,i,RHTBL);
8831 delayslot_alloc(¤t,i+1);
8833 // The delay slot overwrites our source register,
8834 // allocate a temporary register to hold the old value.
8838 delayslot_alloc(¤t,i+1);
8840 alloc_reg(¤t,i,RTEMP);
8842 //current.isconst=0; // DEBUG
8847 //current.isconst=0;
8848 //current.wasconst=0;
8849 //regs[i].wasconst=0;
8850 clear_const(¤t,rs1[i]);
8851 clear_const(¤t,rs2[i]);
8852 if((opcode[i]&0x3E)==4) // BEQ/BNE
8854 alloc_cc(¤t,i);
8855 dirty_reg(¤t,CCREG);
8856 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8857 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8858 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8860 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8861 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8863 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
8864 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
8865 // The delay slot overwrites one of our conditions.
8866 // Allocate the branch condition registers instead.
8870 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8871 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
8872 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8874 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8875 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
8881 delayslot_alloc(¤t,i+1);
8885 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
8887 alloc_cc(¤t,i);
8888 dirty_reg(¤t,CCREG);
8889 alloc_reg(¤t,i,rs1[i]);
8890 if(!(current.is32>>rs1[i]&1))
8892 alloc_reg64(¤t,i,rs1[i]);
8894 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
8895 // The delay slot overwrites one of our conditions.
8896 // Allocate the branch condition registers instead.
8900 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8901 if(!((current.is32>>rs1[i])&1))
8903 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8909 delayslot_alloc(¤t,i+1);
8913 // Don't alloc the delay slot yet because we might not execute it
8914 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
8919 alloc_cc(¤t,i);
8920 dirty_reg(¤t,CCREG);
8921 alloc_reg(¤t,i,rs1[i]);
8922 alloc_reg(¤t,i,rs2[i]);
8923 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
8925 alloc_reg64(¤t,i,rs1[i]);
8926 alloc_reg64(¤t,i,rs2[i]);
8930 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
8935 alloc_cc(¤t,i);
8936 dirty_reg(¤t,CCREG);
8937 alloc_reg(¤t,i,rs1[i]);
8938 if(!(current.is32>>rs1[i]&1))
8940 alloc_reg64(¤t,i,rs1[i]);
8944 //current.isconst=0;
8947 //current.isconst=0;
8948 //current.wasconst=0;
8949 //regs[i].wasconst=0;
8950 clear_const(¤t,rs1[i]);
8951 clear_const(¤t,rt1[i]);
8952 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
8953 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
8955 alloc_cc(¤t,i);
8956 dirty_reg(¤t,CCREG);
8957 alloc_reg(¤t,i,rs1[i]);
8958 if(!(current.is32>>rs1[i]&1))
8960 alloc_reg64(¤t,i,rs1[i]);
8962 if (rt1[i]==31) { // BLTZAL/BGEZAL
8963 alloc_reg(¤t,i,31);
8964 dirty_reg(¤t,31);
8965 //#ifdef REG_PREFETCH
8966 //alloc_reg(¤t,i,PTEMP);
8968 //current.is32|=1LL<<rt1[i];
8970 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) // The delay slot overwrites the branch condition.
8971 ||(rt1[i]==31&&(rs1[i+1]==31||rs2[i+1]==31||rt1[i+1]==31||rt2[i+1]==31))) { // DS touches $ra
8972 // Allocate the branch condition registers instead.
8976 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
8977 if(!((current.is32>>rs1[i])&1))
8979 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
8985 delayslot_alloc(¤t,i+1);
8989 // Don't alloc the delay slot yet because we might not execute it
8990 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
8995 alloc_cc(¤t,i);
8996 dirty_reg(¤t,CCREG);
8997 alloc_reg(¤t,i,rs1[i]);
8998 if(!(current.is32>>rs1[i]&1))
9000 alloc_reg64(¤t,i,rs1[i]);
9004 //current.isconst=0;
9010 if(likely[i]==0) // BC1F/BC1T
9012 // TODO: Theoretically we can run out of registers here on x86.
9013 // The delay slot can allocate up to six, and we need to check
9014 // CSREG before executing the delay slot. Possibly we can drop
9015 // the cycle count and then reload it after checking that the
9016 // FPU is in a usable state, or don't do out-of-order execution.
9017 alloc_cc(¤t,i);
9018 dirty_reg(¤t,CCREG);
9019 alloc_reg(¤t,i,FSREG);
9020 alloc_reg(¤t,i,CSREG);
9021 if(itype[i+1]==FCOMP) {
9022 // The delay slot overwrites the branch condition.
9023 // Allocate the branch condition registers instead.
9024 alloc_cc(¤t,i);
9025 dirty_reg(¤t,CCREG);
9026 alloc_reg(¤t,i,CSREG);
9027 alloc_reg(¤t,i,FSREG);
9031 delayslot_alloc(¤t,i+1);
9032 alloc_reg(¤t,i+1,CSREG);
9036 // Don't alloc the delay slot yet because we might not execute it
9037 if(likely[i]) // BC1FL/BC1TL
9039 alloc_cc(¤t,i);
9040 dirty_reg(¤t,CCREG);
9041 alloc_reg(¤t,i,CSREG);
9042 alloc_reg(¤t,i,FSREG);
9048 imm16_alloc(¤t,i);
9052 load_alloc(¤t,i);
9056 store_alloc(¤t,i);
9059 alu_alloc(¤t,i);
9062 shift_alloc(¤t,i);
9065 multdiv_alloc(¤t,i);
9068 shiftimm_alloc(¤t,i);
9071 mov_alloc(¤t,i);
9074 cop0_alloc(¤t,i);
9078 cop1_alloc(¤t,i);
9081 c1ls_alloc(¤t,i);
9084 c2ls_alloc(¤t,i);
9087 c2op_alloc(¤t,i);
9090 fconv_alloc(¤t,i);
9093 float_alloc(¤t,i);
9096 fcomp_alloc(¤t,i);
9101 syscall_alloc(¤t,i);
9104 pagespan_alloc(¤t,i);
9108 // Drop the upper half of registers that have become 32-bit
9109 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
9110 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9111 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9112 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9115 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
9116 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9117 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9118 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9122 // Create entry (branch target) regmap
9123 for(hr=0;hr<HOST_REGS;hr++)
9126 r=current.regmap[hr];
9128 if(r!=regmap_pre[i][hr]) {
9129 // TODO: delay slot (?)
9130 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9131 if(or<0||(r&63)>=TEMPREG){
9132 regs[i].regmap_entry[hr]=-1;
9136 // Just move it to a different register
9137 regs[i].regmap_entry[hr]=r;
9138 // If it was dirty before, it's still dirty
9139 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9146 regs[i].regmap_entry[hr]=0;
9150 if((current.u>>r)&1) {
9151 regs[i].regmap_entry[hr]=-1;
9152 //regs[i].regmap[hr]=-1;
9153 current.regmap[hr]=-1;
9155 regs[i].regmap_entry[hr]=r;
9158 if((current.uu>>(r&63))&1) {
9159 regs[i].regmap_entry[hr]=-1;
9160 //regs[i].regmap[hr]=-1;
9161 current.regmap[hr]=-1;
9163 regs[i].regmap_entry[hr]=r;
9167 // Branches expect CCREG to be allocated at the target
9168 if(regmap_pre[i][hr]==CCREG)
9169 regs[i].regmap_entry[hr]=CCREG;
9171 regs[i].regmap_entry[hr]=-1;
9174 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9176 /* Branch post-alloc */
9179 current.was32=current.is32;
9180 current.wasdirty=current.dirty;
9181 switch(itype[i-1]) {
9183 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9184 branch_regs[i-1].isconst=0;
9185 branch_regs[i-1].wasconst=0;
9186 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9187 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9188 alloc_cc(&branch_regs[i-1],i-1);
9189 dirty_reg(&branch_regs[i-1],CCREG);
9190 if(rt1[i-1]==31) { // JAL
9191 alloc_reg(&branch_regs[i-1],i-1,31);
9192 dirty_reg(&branch_regs[i-1],31);
9193 branch_regs[i-1].is32|=1LL<<31;
9195 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9196 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9199 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9200 branch_regs[i-1].isconst=0;
9201 branch_regs[i-1].wasconst=0;
9202 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9203 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9204 alloc_cc(&branch_regs[i-1],i-1);
9205 dirty_reg(&branch_regs[i-1],CCREG);
9206 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9207 if(rt1[i-1]!=0) { // JALR
9208 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9209 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9210 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9213 if(rs1[i-1]==31) { // JALR
9214 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9215 #ifndef HOST_IMM_ADDR32
9216 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9220 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9221 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9224 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9226 alloc_cc(¤t,i-1);
9227 dirty_reg(¤t,CCREG);
9228 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9229 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9230 // The delay slot overwrote one of our conditions
9231 // Delay slot goes after the test (in order)
9232 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9233 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9234 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9237 delayslot_alloc(¤t,i);
9242 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9243 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9244 // Alloc the branch condition registers
9245 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9246 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9247 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9249 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9250 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9253 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9254 branch_regs[i-1].isconst=0;
9255 branch_regs[i-1].wasconst=0;
9256 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9257 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9260 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9262 alloc_cc(¤t,i-1);
9263 dirty_reg(¤t,CCREG);
9264 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9265 // The delay slot overwrote the branch condition
9266 // Delay slot goes after the test (in order)
9267 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9268 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9269 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9272 delayslot_alloc(¤t,i);
9277 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9278 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9279 // Alloc the branch condition register
9280 alloc_reg(¤t,i-1,rs1[i-1]);
9281 if(!(current.is32>>rs1[i-1]&1))
9283 alloc_reg64(¤t,i-1,rs1[i-1]);
9286 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9287 branch_regs[i-1].isconst=0;
9288 branch_regs[i-1].wasconst=0;
9289 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9290 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9293 // Alloc the delay slot in case the branch is taken
9294 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9296 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9297 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9298 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9299 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9300 alloc_cc(&branch_regs[i-1],i);
9301 dirty_reg(&branch_regs[i-1],CCREG);
9302 delayslot_alloc(&branch_regs[i-1],i);
9303 branch_regs[i-1].isconst=0;
9304 alloc_reg(¤t,i,CCREG); // Not taken path
9305 dirty_reg(¤t,CCREG);
9306 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9309 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9311 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9312 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9313 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9314 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9315 alloc_cc(&branch_regs[i-1],i);
9316 dirty_reg(&branch_regs[i-1],CCREG);
9317 delayslot_alloc(&branch_regs[i-1],i);
9318 branch_regs[i-1].isconst=0;
9319 alloc_reg(¤t,i,CCREG); // Not taken path
9320 dirty_reg(¤t,CCREG);
9321 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9325 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9326 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9328 alloc_cc(¤t,i-1);
9329 dirty_reg(¤t,CCREG);
9330 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9331 // The delay slot overwrote the branch condition
9332 // Delay slot goes after the test (in order)
9333 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9334 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9335 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9338 delayslot_alloc(¤t,i);
9343 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9344 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9345 // Alloc the branch condition register
9346 alloc_reg(¤t,i-1,rs1[i-1]);
9347 if(!(current.is32>>rs1[i-1]&1))
9349 alloc_reg64(¤t,i-1,rs1[i-1]);
9352 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9353 branch_regs[i-1].isconst=0;
9354 branch_regs[i-1].wasconst=0;
9355 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9356 memcpy(constmap[i],constmap[i-1],sizeof(current.constmap));
9359 // Alloc the delay slot in case the branch is taken
9360 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9362 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9363 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9364 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9365 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9366 alloc_cc(&branch_regs[i-1],i);
9367 dirty_reg(&branch_regs[i-1],CCREG);
9368 delayslot_alloc(&branch_regs[i-1],i);
9369 branch_regs[i-1].isconst=0;
9370 alloc_reg(¤t,i,CCREG); // Not taken path
9371 dirty_reg(¤t,CCREG);
9372 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9374 // FIXME: BLTZAL/BGEZAL
9375 if(opcode2[i-1]&0x10) { // BxxZAL
9376 alloc_reg(&branch_regs[i-1],i-1,31);
9377 dirty_reg(&branch_regs[i-1],31);
9378 branch_regs[i-1].is32|=1LL<<31;
9382 if(likely[i-1]==0) // BC1F/BC1T
9384 alloc_cc(¤t,i-1);
9385 dirty_reg(¤t,CCREG);
9386 if(itype[i]==FCOMP) {
9387 // The delay slot overwrote the branch condition
9388 // Delay slot goes after the test (in order)
9389 delayslot_alloc(¤t,i);
9394 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9395 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9396 // Alloc the branch condition register
9397 alloc_reg(¤t,i-1,FSREG);
9399 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9400 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9404 // Alloc the delay slot in case the branch is taken
9405 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9406 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9407 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9408 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9409 alloc_cc(&branch_regs[i-1],i);
9410 dirty_reg(&branch_regs[i-1],CCREG);
9411 delayslot_alloc(&branch_regs[i-1],i);
9412 branch_regs[i-1].isconst=0;
9413 alloc_reg(¤t,i,CCREG); // Not taken path
9414 dirty_reg(¤t,CCREG);
9415 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9420 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9422 if(rt1[i-1]==31) // JAL/JALR
9424 // Subroutine call will return here, don't alloc any registers
9427 clear_all_regs(current.regmap);
9428 alloc_reg(¤t,i,CCREG);
9429 dirty_reg(¤t,CCREG);
9433 // Internal branch will jump here, match registers to caller
9434 current.is32=0x3FFFFFFFFLL;
9436 clear_all_regs(current.regmap);
9437 alloc_reg(¤t,i,CCREG);
9438 dirty_reg(¤t,CCREG);
9441 if(ba[j]==start+i*4+4) {
9442 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9443 current.is32=branch_regs[j].is32;
9444 current.dirty=branch_regs[j].dirty;
9449 if(ba[j]==start+i*4+4) {
9450 for(hr=0;hr<HOST_REGS;hr++) {
9451 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9452 current.regmap[hr]=-1;
9454 current.is32&=branch_regs[j].is32;
9455 current.dirty&=branch_regs[j].dirty;
9464 // Count cycles in between branches
9466 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))
9475 flush_dirty_uppers(¤t);
9477 regs[i].is32=current.is32;
9478 regs[i].dirty=current.dirty;
9479 regs[i].isconst=current.isconst;
9480 memcpy(constmap[i],current.constmap,sizeof(current.constmap));
9482 for(hr=0;hr<HOST_REGS;hr++) {
9483 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9484 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9485 regs[i].wasconst&=~(1<<hr);
9489 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9492 /* Pass 4 - Cull unused host registers */
9496 for (i=slen-1;i>=0;i--)
9499 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9501 if(ba[i]<start || ba[i]>=(start+slen*4))
9503 // Branch out of this block, don't need anything
9509 // Need whatever matches the target
9511 int t=(ba[i]-start)>>2;
9512 for(hr=0;hr<HOST_REGS;hr++)
9514 if(regs[i].regmap_entry[hr]>=0) {
9515 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9519 // Conditional branch may need registers for following instructions
9520 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9523 nr|=needed_reg[i+2];
9524 for(hr=0;hr<HOST_REGS;hr++)
9526 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9527 //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]);
9531 // Don't need stuff which is overwritten
9532 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9533 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9534 // Merge in delay slot
9535 for(hr=0;hr<HOST_REGS;hr++)
9538 // These are overwritten unless the branch is "likely"
9539 // and the delay slot is nullified if not taken
9540 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9541 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9543 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9544 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9545 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9546 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9547 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9548 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9549 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9550 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9551 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
9552 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9553 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9555 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
9556 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9557 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9559 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
9560 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9561 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9565 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
9567 // SYSCALL instruction (software interrupt)
9570 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
9572 // ERET instruction (return from interrupt)
9578 for(hr=0;hr<HOST_REGS;hr++) {
9579 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
9580 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
9581 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9582 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9586 for(hr=0;hr<HOST_REGS;hr++)
9588 // Overwritten registers are not needed
9589 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9590 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9591 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9592 // Source registers are needed
9593 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9594 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9595 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
9596 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
9597 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9598 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9599 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9600 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
9601 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
9602 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9603 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9605 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
9606 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9607 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9609 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
9610 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
9611 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
9613 // Don't store a register immediately after writing it,
9614 // may prevent dual-issue.
9615 // But do so if this is a branch target, otherwise we
9616 // might have to load the register before the branch.
9617 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
9618 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
9619 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
9620 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9621 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9623 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
9624 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
9625 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9626 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9630 // Cycle count is needed at branches. Assume it is needed at the target too.
9631 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
9632 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9633 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
9638 // Deallocate unneeded registers
9639 for(hr=0;hr<HOST_REGS;hr++)
9642 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
9643 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9644 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9645 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
9647 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9650 regs[i].regmap[hr]=-1;
9651 regs[i].isconst&=~(1<<hr);
9652 if(i<slen-2) regmap_pre[i+2][hr]=-1;
9656 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9658 int d1=0,d2=0,map=0,temp=0;
9659 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
9665 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
9666 itype[i+1]==STORE || itype[i+1]==STORELR ||
9667 itype[i+1]==C1LS || itype[i+1]==C2LS)
9670 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
9671 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9674 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
9675 itype[i+1]==C1LS || itype[i+1]==C2LS)
9677 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
9678 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9679 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
9680 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
9681 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9682 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
9683 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
9684 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
9685 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
9686 regs[i].regmap[hr]!=map )
9688 regs[i].regmap[hr]=-1;
9689 regs[i].isconst&=~(1<<hr);
9690 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
9691 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
9692 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
9693 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
9694 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
9695 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
9696 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
9697 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
9698 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
9699 branch_regs[i].regmap[hr]!=map)
9701 branch_regs[i].regmap[hr]=-1;
9702 branch_regs[i].regmap_entry[hr]=-1;
9703 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9705 if(!likely[i]&&i<slen-2) {
9706 regmap_pre[i+2][hr]=-1;
9717 int d1=0,d2=0,map=-1,temp=-1;
9718 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
9724 if(itype[i]==LOAD || itype[i]==LOADLR ||
9725 itype[i]==STORE || itype[i]==STORELR ||
9726 itype[i]==C1LS || itype[i]==C2LS)
9728 } else if(itype[i]==STORE || itype[i]==STORELR ||
9729 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
9732 if(itype[i]==LOADLR || itype[i]==STORELR ||
9733 itype[i]==C1LS || itype[i]==C2LS)
9735 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
9736 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
9737 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
9738 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
9739 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
9740 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
9742 if(i<slen-1&&!is_ds[i]) {
9743 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
9744 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
9745 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
9747 printf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
9748 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
9750 regmap_pre[i+1][hr]=-1;
9751 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
9753 regs[i].regmap[hr]=-1;
9754 regs[i].isconst&=~(1<<hr);
9762 /* Pass 5 - Pre-allocate registers */
9764 // If a register is allocated during a loop, try to allocate it for the
9765 // entire loop, if possible. This avoids loading/storing registers
9766 // inside of the loop.
9768 signed char f_regmap[HOST_REGS];
9769 clear_all_regs(f_regmap);
9770 for(i=0;i<slen-1;i++)
9772 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9774 if(ba[i]>=start && ba[i]<(start+i*4))
9775 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
9776 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
9777 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
9778 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
9779 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
9780 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
9782 int t=(ba[i]-start)>>2;
9783 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
9784 if(t<2||(itype[t-2]!=UJUMP)) // call/ret assumes no registers allocated
9785 for(hr=0;hr<HOST_REGS;hr++)
9787 if(regs[i].regmap[hr]>64) {
9788 if(!((regs[i].dirty>>hr)&1))
9789 f_regmap[hr]=regs[i].regmap[hr];
9790 else f_regmap[hr]=-1;
9792 else if(regs[i].regmap[hr]>=0) {
9793 if(f_regmap[hr]!=regs[i].regmap[hr]) {
9794 // dealloc old register
9796 for(n=0;n<HOST_REGS;n++)
9798 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
9800 // and alloc new one
9801 f_regmap[hr]=regs[i].regmap[hr];
9804 if(branch_regs[i].regmap[hr]>64) {
9805 if(!((branch_regs[i].dirty>>hr)&1))
9806 f_regmap[hr]=branch_regs[i].regmap[hr];
9807 else f_regmap[hr]=-1;
9809 else if(branch_regs[i].regmap[hr]>=0) {
9810 if(f_regmap[hr]!=branch_regs[i].regmap[hr]) {
9811 // dealloc old register
9813 for(n=0;n<HOST_REGS;n++)
9815 if(f_regmap[n]==branch_regs[i].regmap[hr]) {f_regmap[n]=-1;}
9817 // and alloc new one
9818 f_regmap[hr]=branch_regs[i].regmap[hr];
9822 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1])
9823 f_regmap[hr]=branch_regs[i].regmap[hr];
9825 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1])
9826 f_regmap[hr]=branch_regs[i].regmap[hr];
9828 // Avoid dirty->clean transition
9829 #ifdef DESTRUCTIVE_WRITEBACK
9830 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;
9832 // This check is only strictly required in the DESTRUCTIVE_WRITEBACK
9833 // case above, however it's always a good idea. We can't hoist the
9834 // load if the register was already allocated, so there's no point
9835 // wasting time analyzing most of these cases. It only "succeeds"
9836 // when the mapping was different and the load can be replaced with
9837 // a mov, which is of negligible benefit. So such cases are
9839 if(f_regmap[hr]>0) {
9840 if(regs[t].regmap_entry[hr]<0&&get_reg(regmap_pre[t],f_regmap[hr])<0) {
9844 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9845 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
9846 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
9848 // NB This can exclude the case where the upper-half
9849 // register is lower numbered than the lower-half
9850 // register. Not sure if it's worth fixing...
9851 if(get_reg(regs[j].regmap,r&63)<0) break;
9852 if(get_reg(regs[j].regmap_entry,r&63)<0) break;
9853 if(regs[j].is32&(1LL<<(r&63))) break;
9855 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
9856 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
9858 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
9859 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
9861 if(get_reg(regs[i].regmap,r&63)<0) break;
9862 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
9865 while(k>1&®s[k-1].regmap[hr]==-1) {
9866 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
9867 //printf("no free regs for store %x\n",start+(k-1)*4);
9870 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
9871 //printf("no-match due to different register\n");
9874 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
9875 //printf("no-match due to branch\n");
9878 // call/ret fast path assumes no registers allocated
9879 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)) {
9883 // NB This can exclude the case where the upper-half
9884 // register is lower numbered than the lower-half
9885 // register. Not sure if it's worth fixing...
9886 if(get_reg(regs[k-1].regmap,r&63)<0) break;
9887 if(regs[k-1].is32&(1LL<<(r&63))) break;
9892 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
9893 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
9894 //printf("bad match after branch\n");
9898 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
9899 //printf("Extend r%d, %x ->\n",hr,start+k*4);
9901 regs[k].regmap_entry[hr]=f_regmap[hr];
9902 regs[k].regmap[hr]=f_regmap[hr];
9903 regmap_pre[k+1][hr]=f_regmap[hr];
9904 regs[k].wasdirty&=~(1<<hr);
9905 regs[k].dirty&=~(1<<hr);
9906 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
9907 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
9908 regs[k].wasconst&=~(1<<hr);
9909 regs[k].isconst&=~(1<<hr);
9914 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
9917 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
9918 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
9919 //printf("OK fill %x (r%d)\n",start+i*4,hr);
9920 regs[i].regmap_entry[hr]=f_regmap[hr];
9921 regs[i].regmap[hr]=f_regmap[hr];
9922 regs[i].wasdirty&=~(1<<hr);
9923 regs[i].dirty&=~(1<<hr);
9924 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
9925 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
9926 regs[i].wasconst&=~(1<<hr);
9927 regs[i].isconst&=~(1<<hr);
9928 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
9929 branch_regs[i].wasdirty&=~(1<<hr);
9930 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
9931 branch_regs[i].regmap[hr]=f_regmap[hr];
9932 branch_regs[i].dirty&=~(1<<hr);
9933 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
9934 branch_regs[i].wasconst&=~(1<<hr);
9935 branch_regs[i].isconst&=~(1<<hr);
9936 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
9937 regmap_pre[i+2][hr]=f_regmap[hr];
9938 regs[i+2].wasdirty&=~(1<<hr);
9939 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
9940 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
9941 (regs[i+2].was32&(1LL<<f_regmap[hr])));
9946 // Alloc register clean at beginning of loop,
9947 // but may dirty it in pass 6
9948 regs[k].regmap_entry[hr]=f_regmap[hr];
9949 regs[k].regmap[hr]=f_regmap[hr];
9950 regs[k].dirty&=~(1<<hr);
9951 regs[k].wasconst&=~(1<<hr);
9952 regs[k].isconst&=~(1<<hr);
9953 if(itype[k]==UJUMP||itype[k]==RJUMP||itype[k]==CJUMP||itype[k]==SJUMP||itype[k]==FJUMP) {
9954 branch_regs[k].regmap_entry[hr]=f_regmap[hr];
9955 branch_regs[k].regmap[hr]=f_regmap[hr];
9956 branch_regs[k].dirty&=~(1<<hr);
9957 branch_regs[k].wasconst&=~(1<<hr);
9958 branch_regs[k].isconst&=~(1<<hr);
9959 if(itype[k]!=RJUMP&&itype[k]!=UJUMP&&(source[k]>>16)!=0x1000) {
9960 regmap_pre[k+2][hr]=f_regmap[hr];
9961 regs[k+2].wasdirty&=~(1<<hr);
9962 assert((branch_regs[k].is32&(1LL<<f_regmap[hr]))==
9963 (regs[k+2].was32&(1LL<<f_regmap[hr])));
9968 regmap_pre[k+1][hr]=f_regmap[hr];
9969 regs[k+1].wasdirty&=~(1<<hr);
9972 if(regs[j].regmap[hr]==f_regmap[hr])
9973 regs[j].regmap_entry[hr]=f_regmap[hr];
9977 if(regs[j].regmap[hr]>=0)
9979 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
9980 //printf("no-match due to different register\n");
9983 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
9984 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
9987 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
9989 // Stop on unconditional branch
9992 if(itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP)
9995 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1])
9998 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1])
10001 if(get_reg(branch_regs[j].regmap,f_regmap[hr])>=0) {
10002 //printf("no-match due to different register (branch)\n");
10006 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10007 //printf("No free regs for store %x\n",start+j*4);
10010 if(f_regmap[hr]>=64) {
10011 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
10016 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
10028 for(hr=0;hr<HOST_REGS;hr++)
10030 if(hr!=EXCLUDE_REG) {
10031 if(regs[i].regmap[hr]>64) {
10032 if(!((regs[i].dirty>>hr)&1))
10033 f_regmap[hr]=regs[i].regmap[hr];
10035 else if(regs[i].regmap[hr]>=0) {
10036 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10037 // dealloc old register
10039 for(n=0;n<HOST_REGS;n++)
10041 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10043 // and alloc new one
10044 f_regmap[hr]=regs[i].regmap[hr];
10047 else if(regs[i].regmap[hr]<0) count++;
10050 // Try to restore cycle count at branch targets
10052 for(j=i;j<slen-1;j++) {
10053 if(regs[j].regmap[HOST_CCREG]!=-1) break;
10054 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10055 //printf("no free regs for store %x\n",start+j*4);
10059 if(regs[j].regmap[HOST_CCREG]==CCREG) {
10061 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
10063 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10064 regs[k].regmap[HOST_CCREG]=CCREG;
10065 regmap_pre[k+1][HOST_CCREG]=CCREG;
10066 regs[k+1].wasdirty|=1<<HOST_CCREG;
10067 regs[k].dirty|=1<<HOST_CCREG;
10068 regs[k].wasconst&=~(1<<HOST_CCREG);
10069 regs[k].isconst&=~(1<<HOST_CCREG);
10072 regs[j].regmap_entry[HOST_CCREG]=CCREG;
10074 // Work backwards from the branch target
10075 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
10077 //printf("Extend backwards\n");
10080 while(regs[k-1].regmap[HOST_CCREG]==-1) {
10081 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10082 //printf("no free regs for store %x\n",start+(k-1)*4);
10087 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
10088 //printf("Extend CC, %x ->\n",start+k*4);
10090 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10091 regs[k].regmap[HOST_CCREG]=CCREG;
10092 regmap_pre[k+1][HOST_CCREG]=CCREG;
10093 regs[k+1].wasdirty|=1<<HOST_CCREG;
10094 regs[k].dirty|=1<<HOST_CCREG;
10095 regs[k].wasconst&=~(1<<HOST_CCREG);
10096 regs[k].isconst&=~(1<<HOST_CCREG);
10101 //printf("Fail Extend CC, %x ->\n",start+k*4);
10105 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
10106 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
10107 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
10108 itype[i]!=FCONV&&itype[i]!=FCOMP)
10110 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
10115 // This allocates registers (if possible) one instruction prior
10116 // to use, which can avoid a load-use penalty on certain CPUs.
10117 for(i=0;i<slen-1;i++)
10119 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
10123 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
10124 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
10127 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
10129 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10131 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10132 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10133 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10134 regs[i].isconst&=~(1<<hr);
10135 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10136 constmap[i][hr]=constmap[i+1][hr];
10137 regs[i+1].wasdirty&=~(1<<hr);
10138 regs[i].dirty&=~(1<<hr);
10143 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
10145 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10147 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10148 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10149 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10150 regs[i].isconst&=~(1<<hr);
10151 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10152 constmap[i][hr]=constmap[i+1][hr];
10153 regs[i+1].wasdirty&=~(1<<hr);
10154 regs[i].dirty&=~(1<<hr);
10158 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10159 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10161 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10163 regs[i].regmap[hr]=rs1[i+1];
10164 regmap_pre[i+1][hr]=rs1[i+1];
10165 regs[i+1].regmap_entry[hr]=rs1[i+1];
10166 regs[i].isconst&=~(1<<hr);
10167 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10168 constmap[i][hr]=constmap[i+1][hr];
10169 regs[i+1].wasdirty&=~(1<<hr);
10170 regs[i].dirty&=~(1<<hr);
10174 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10175 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10177 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10179 regs[i].regmap[hr]=rs1[i+1];
10180 regmap_pre[i+1][hr]=rs1[i+1];
10181 regs[i+1].regmap_entry[hr]=rs1[i+1];
10182 regs[i].isconst&=~(1<<hr);
10183 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10184 constmap[i][hr]=constmap[i+1][hr];
10185 regs[i+1].wasdirty&=~(1<<hr);
10186 regs[i].dirty&=~(1<<hr);
10190 #ifndef HOST_IMM_ADDR32
10191 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) {
10192 hr=get_reg(regs[i+1].regmap,TLREG);
10194 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10195 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10197 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10199 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10200 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10201 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10202 regs[i].isconst&=~(1<<hr);
10203 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10204 constmap[i][hr]=constmap[i+1][hr];
10205 regs[i+1].wasdirty&=~(1<<hr);
10206 regs[i].dirty&=~(1<<hr);
10208 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10210 // move it to another register
10211 regs[i+1].regmap[hr]=-1;
10212 regmap_pre[i+2][hr]=-1;
10213 regs[i+1].regmap[nr]=TLREG;
10214 regmap_pre[i+2][nr]=TLREG;
10215 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10216 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10217 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10218 regs[i].isconst&=~(1<<nr);
10219 regs[i+1].isconst&=~(1<<nr);
10220 regs[i].dirty&=~(1<<nr);
10221 regs[i+1].wasdirty&=~(1<<nr);
10222 regs[i+1].dirty&=~(1<<nr);
10223 regs[i+2].wasdirty&=~(1<<nr);
10229 if(itype[i+1]==STORE||itype[i+1]==STORELR
10230 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10231 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10232 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10233 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10234 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10236 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10238 regs[i].regmap[hr]=rs1[i+1];
10239 regmap_pre[i+1][hr]=rs1[i+1];
10240 regs[i+1].regmap_entry[hr]=rs1[i+1];
10241 regs[i].isconst&=~(1<<hr);
10242 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10243 constmap[i][hr]=constmap[i+1][hr];
10244 regs[i+1].wasdirty&=~(1<<hr);
10245 regs[i].dirty&=~(1<<hr);
10249 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10250 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10252 hr=get_reg(regs[i+1].regmap,FTEMP);
10254 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10256 regs[i].regmap[hr]=rs1[i+1];
10257 regmap_pre[i+1][hr]=rs1[i+1];
10258 regs[i+1].regmap_entry[hr]=rs1[i+1];
10259 regs[i].isconst&=~(1<<hr);
10260 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10261 constmap[i][hr]=constmap[i+1][hr];
10262 regs[i+1].wasdirty&=~(1<<hr);
10263 regs[i].dirty&=~(1<<hr);
10265 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10267 // move it to another register
10268 regs[i+1].regmap[hr]=-1;
10269 regmap_pre[i+2][hr]=-1;
10270 regs[i+1].regmap[nr]=FTEMP;
10271 regmap_pre[i+2][nr]=FTEMP;
10272 regs[i].regmap[nr]=rs1[i+1];
10273 regmap_pre[i+1][nr]=rs1[i+1];
10274 regs[i+1].regmap_entry[nr]=rs1[i+1];
10275 regs[i].isconst&=~(1<<nr);
10276 regs[i+1].isconst&=~(1<<nr);
10277 regs[i].dirty&=~(1<<nr);
10278 regs[i+1].wasdirty&=~(1<<nr);
10279 regs[i+1].dirty&=~(1<<nr);
10280 regs[i+2].wasdirty&=~(1<<nr);
10284 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*/) {
10285 if(itype[i+1]==LOAD)
10286 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10287 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10288 hr=get_reg(regs[i+1].regmap,FTEMP);
10289 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10290 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10291 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10293 if(hr>=0&®s[i].regmap[hr]<0) {
10294 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10295 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10296 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10297 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10298 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10299 regs[i].isconst&=~(1<<hr);
10300 regs[i+1].wasdirty&=~(1<<hr);
10301 regs[i].dirty&=~(1<<hr);
10310 /* Pass 6 - Optimize clean/dirty state */
10311 clean_registers(0,slen-1,1);
10313 /* Pass 7 - Identify 32-bit registers */
10319 for (i=slen-1;i>=0;i--)
10322 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10324 if(ba[i]<start || ba[i]>=(start+slen*4))
10326 // Branch out of this block, don't need anything
10332 // Need whatever matches the target
10333 // (and doesn't get overwritten by the delay slot instruction)
10335 int t=(ba[i]-start)>>2;
10336 if(ba[i]>start+i*4) {
10338 if(!(requires_32bit[t]&~regs[i].was32))
10339 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10342 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10343 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10344 if(!(pr32[t]&~regs[i].was32))
10345 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10348 // Conditional branch may need registers for following instructions
10349 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10352 r32|=requires_32bit[i+2];
10353 r32&=regs[i].was32;
10354 // Mark this address as a branch target since it may be called
10355 // upon return from interrupt
10359 // Merge in delay slot
10361 // These are overwritten unless the branch is "likely"
10362 // and the delay slot is nullified if not taken
10363 r32&=~(1LL<<rt1[i+1]);
10364 r32&=~(1LL<<rt2[i+1]);
10366 // Assume these are needed (delay slot)
10369 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
10373 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
10375 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
10377 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
10379 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
10381 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
10384 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
10386 // SYSCALL instruction (software interrupt)
10389 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10391 // ERET instruction (return from interrupt)
10395 r32&=~(1LL<<rt1[i]);
10396 r32&=~(1LL<<rt2[i]);
10399 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
10403 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
10405 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
10407 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
10409 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
10411 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
10413 requires_32bit[i]=r32;
10415 // Dirty registers which are 32-bit, require 32-bit input
10416 // as they will be written as 32-bit values
10417 for(hr=0;hr<HOST_REGS;hr++)
10419 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
10420 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
10421 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
10422 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
10426 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
10430 if(itype[slen-1]==SPAN) {
10431 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
10434 /* Debug/disassembly */
10435 if((void*)assem_debug==(void*)printf)
10436 for(i=0;i<slen;i++)
10440 for(r=1;r<=CCREG;r++) {
10441 if((unneeded_reg[i]>>r)&1) {
10442 if(r==HIREG) printf(" HI");
10443 else if(r==LOREG) printf(" LO");
10444 else printf(" r%d",r);
10449 for(r=1;r<=CCREG;r++) {
10450 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
10451 if(r==HIREG) printf(" HI");
10452 else if(r==LOREG) printf(" LO");
10453 else printf(" r%d",r);
10457 for(r=0;r<=CCREG;r++) {
10458 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10459 if((regs[i].was32>>r)&1) {
10460 if(r==CCREG) printf(" CC");
10461 else if(r==HIREG) printf(" HI");
10462 else if(r==LOREG) printf(" LO");
10463 else printf(" r%d",r);
10468 #if defined(__i386__) || defined(__x86_64__)
10469 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]);
10472 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]);
10475 if(needed_reg[i]&1) printf("eax ");
10476 if((needed_reg[i]>>1)&1) printf("ecx ");
10477 if((needed_reg[i]>>2)&1) printf("edx ");
10478 if((needed_reg[i]>>3)&1) printf("ebx ");
10479 if((needed_reg[i]>>5)&1) printf("ebp ");
10480 if((needed_reg[i]>>6)&1) printf("esi ");
10481 if((needed_reg[i]>>7)&1) printf("edi ");
10483 for(r=0;r<=CCREG;r++) {
10484 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10485 if((requires_32bit[i]>>r)&1) {
10486 if(r==CCREG) printf(" CC");
10487 else if(r==HIREG) printf(" HI");
10488 else if(r==LOREG) printf(" LO");
10489 else printf(" r%d",r);
10494 for(r=0;r<=CCREG;r++) {
10495 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
10496 if((pr32[i]>>r)&1) {
10497 if(r==CCREG) printf(" CC");
10498 else if(r==HIREG) printf(" HI");
10499 else if(r==LOREG) printf(" LO");
10500 else printf(" r%d",r);
10503 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
10505 #if defined(__i386__) || defined(__x86_64__)
10506 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]);
10508 if(regs[i].wasdirty&1) printf("eax ");
10509 if((regs[i].wasdirty>>1)&1) printf("ecx ");
10510 if((regs[i].wasdirty>>2)&1) printf("edx ");
10511 if((regs[i].wasdirty>>3)&1) printf("ebx ");
10512 if((regs[i].wasdirty>>5)&1) printf("ebp ");
10513 if((regs[i].wasdirty>>6)&1) printf("esi ");
10514 if((regs[i].wasdirty>>7)&1) printf("edi ");
10517 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]);
10519 if(regs[i].wasdirty&1) printf("r0 ");
10520 if((regs[i].wasdirty>>1)&1) printf("r1 ");
10521 if((regs[i].wasdirty>>2)&1) printf("r2 ");
10522 if((regs[i].wasdirty>>3)&1) printf("r3 ");
10523 if((regs[i].wasdirty>>4)&1) printf("r4 ");
10524 if((regs[i].wasdirty>>5)&1) printf("r5 ");
10525 if((regs[i].wasdirty>>6)&1) printf("r6 ");
10526 if((regs[i].wasdirty>>7)&1) printf("r7 ");
10527 if((regs[i].wasdirty>>8)&1) printf("r8 ");
10528 if((regs[i].wasdirty>>9)&1) printf("r9 ");
10529 if((regs[i].wasdirty>>10)&1) printf("r10 ");
10530 if((regs[i].wasdirty>>12)&1) printf("r12 ");
10533 disassemble_inst(i);
10534 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
10535 #if defined(__i386__) || defined(__x86_64__)
10536 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]);
10537 if(regs[i].dirty&1) printf("eax ");
10538 if((regs[i].dirty>>1)&1) printf("ecx ");
10539 if((regs[i].dirty>>2)&1) printf("edx ");
10540 if((regs[i].dirty>>3)&1) printf("ebx ");
10541 if((regs[i].dirty>>5)&1) printf("ebp ");
10542 if((regs[i].dirty>>6)&1) printf("esi ");
10543 if((regs[i].dirty>>7)&1) printf("edi ");
10546 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]);
10547 if(regs[i].dirty&1) printf("r0 ");
10548 if((regs[i].dirty>>1)&1) printf("r1 ");
10549 if((regs[i].dirty>>2)&1) printf("r2 ");
10550 if((regs[i].dirty>>3)&1) printf("r3 ");
10551 if((regs[i].dirty>>4)&1) printf("r4 ");
10552 if((regs[i].dirty>>5)&1) printf("r5 ");
10553 if((regs[i].dirty>>6)&1) printf("r6 ");
10554 if((regs[i].dirty>>7)&1) printf("r7 ");
10555 if((regs[i].dirty>>8)&1) printf("r8 ");
10556 if((regs[i].dirty>>9)&1) printf("r9 ");
10557 if((regs[i].dirty>>10)&1) printf("r10 ");
10558 if((regs[i].dirty>>12)&1) printf("r12 ");
10561 if(regs[i].isconst) {
10562 printf("constants: ");
10563 #if defined(__i386__) || defined(__x86_64__)
10564 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
10565 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
10566 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
10567 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
10568 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
10569 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
10570 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
10573 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
10574 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
10575 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
10576 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
10577 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
10578 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
10579 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
10580 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
10581 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
10582 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
10583 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
10584 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
10590 for(r=0;r<=CCREG;r++) {
10591 if((regs[i].is32>>r)&1) {
10592 if(r==CCREG) printf(" CC");
10593 else if(r==HIREG) printf(" HI");
10594 else if(r==LOREG) printf(" LO");
10595 else printf(" r%d",r);
10601 for(r=0;r<=CCREG;r++) {
10602 if((p32[i]>>r)&1) {
10603 if(r==CCREG) printf(" CC");
10604 else if(r==HIREG) printf(" HI");
10605 else if(r==LOREG) printf(" LO");
10606 else printf(" r%d",r);
10609 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
10610 else printf("\n");*/
10611 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10612 #if defined(__i386__) || defined(__x86_64__)
10613 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]);
10614 if(branch_regs[i].dirty&1) printf("eax ");
10615 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
10616 if((branch_regs[i].dirty>>2)&1) printf("edx ");
10617 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
10618 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
10619 if((branch_regs[i].dirty>>6)&1) printf("esi ");
10620 if((branch_regs[i].dirty>>7)&1) printf("edi ");
10623 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]);
10624 if(branch_regs[i].dirty&1) printf("r0 ");
10625 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
10626 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
10627 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
10628 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
10629 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
10630 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
10631 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
10632 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
10633 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
10634 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
10635 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
10639 for(r=0;r<=CCREG;r++) {
10640 if((branch_regs[i].is32>>r)&1) {
10641 if(r==CCREG) printf(" CC");
10642 else if(r==HIREG) printf(" HI");
10643 else if(r==LOREG) printf(" LO");
10644 else printf(" r%d",r);
10652 /* Pass 8 - Assembly */
10653 linkcount=0;stubcount=0;
10654 ds=0;is_delayslot=0;
10656 uint64_t is32_pre=0;
10658 u_int beginning=(u_int)out;
10659 if((u_int)addr&1) {
10663 u_int instr_addr0_override=0;
10666 if (start == 0x80030000) {
10667 // nasty hack for fastbios thing
10668 instr_addr0_override=(u_int)out;
10669 emit_movimm(start,0);
10670 emit_readword((int)&pcaddr,1);
10671 emit_writeword(0,(int)&pcaddr);
10673 emit_jne((int)new_dyna_leave);
10676 for(i=0;i<slen;i++)
10678 //if(ds) printf("ds: ");
10679 if((void*)assem_debug==(void*)printf) disassemble_inst(i);
10681 ds=0; // Skip delay slot
10682 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
10685 #ifndef DESTRUCTIVE_WRITEBACK
10686 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10688 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
10689 unneeded_reg[i],unneeded_reg_upper[i]);
10690 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
10691 unneeded_reg[i],unneeded_reg_upper[i]);
10693 is32_pre=regs[i].is32;
10694 dirty_pre=regs[i].dirty;
10697 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
10699 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
10700 unneeded_reg[i],unneeded_reg_upper[i]);
10701 loop_preload(regmap_pre[i],regs[i].regmap_entry);
10703 // branch target entry point
10704 instr_addr[i]=(u_int)out;
10705 assem_debug("<->\n");
10707 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
10708 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
10709 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
10710 address_generation(i,®s[i],regs[i].regmap_entry);
10711 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
10712 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10714 // Load the delay slot registers if necessary
10715 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10716 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10717 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10718 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10719 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
10720 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10724 // Preload registers for following instruction
10725 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
10726 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
10727 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
10728 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
10729 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
10730 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
10732 // TODO: if(is_ooo(i)) address_generation(i+1);
10733 if(itype[i]==CJUMP||itype[i]==FJUMP)
10734 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
10735 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
10736 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
10737 if(bt[i]) cop1_usable=0;
10741 alu_assemble(i,®s[i]);break;
10743 imm16_assemble(i,®s[i]);break;
10745 shift_assemble(i,®s[i]);break;
10747 shiftimm_assemble(i,®s[i]);break;
10749 load_assemble(i,®s[i]);break;
10751 loadlr_assemble(i,®s[i]);break;
10753 store_assemble(i,®s[i]);break;
10755 storelr_assemble(i,®s[i]);break;
10757 cop0_assemble(i,®s[i]);break;
10759 cop1_assemble(i,®s[i]);break;
10761 c1ls_assemble(i,®s[i]);break;
10763 cop2_assemble(i,®s[i]);break;
10765 c2ls_assemble(i,®s[i]);break;
10767 c2op_assemble(i,®s[i]);break;
10769 fconv_assemble(i,®s[i]);break;
10771 float_assemble(i,®s[i]);break;
10773 fcomp_assemble(i,®s[i]);break;
10775 multdiv_assemble(i,®s[i]);break;
10777 mov_assemble(i,®s[i]);break;
10779 syscall_assemble(i,®s[i]);break;
10781 hlecall_assemble(i,®s[i]);break;
10783 intcall_assemble(i,®s[i]);break;
10785 ujump_assemble(i,®s[i]);ds=1;break;
10787 rjump_assemble(i,®s[i]);ds=1;break;
10789 cjump_assemble(i,®s[i]);ds=1;break;
10791 sjump_assemble(i,®s[i]);ds=1;break;
10793 fjump_assemble(i,®s[i]);ds=1;break;
10795 pagespan_assemble(i,®s[i]);break;
10797 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10798 literal_pool(1024);
10800 literal_pool_jumpover(256);
10803 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
10804 // If the block did not end with an unconditional branch,
10805 // add a jump to the next instruction.
10807 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
10808 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10810 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
10811 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10812 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10813 emit_loadreg(CCREG,HOST_CCREG);
10814 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10816 else if(!likely[i-2])
10818 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
10819 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
10823 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
10824 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
10826 add_to_linker((int)out,start+i*4,0);
10833 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
10834 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
10835 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
10836 emit_loadreg(CCREG,HOST_CCREG);
10837 emit_addimm(HOST_CCREG,CLOCK_DIVIDER*(ccadj[i-1]+1),HOST_CCREG);
10838 add_to_linker((int)out,start+i*4,0);
10842 // TODO: delay slot stubs?
10844 for(i=0;i<stubcount;i++)
10846 switch(stubs[i][0])
10854 do_readstub(i);break;
10859 do_writestub(i);break;
10861 do_ccstub(i);break;
10863 do_invstub(i);break;
10865 do_cop1stub(i);break;
10867 do_unalignedwritestub(i);break;
10871 if (instr_addr0_override)
10872 instr_addr[0] = instr_addr0_override;
10874 /* Pass 9 - Linker */
10875 for(i=0;i<linkcount;i++)
10877 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
10879 if(!link_addr[i][2])
10882 void *addr=check_addr(link_addr[i][1]);
10883 emit_extjump(link_addr[i][0],link_addr[i][1]);
10885 set_jump_target(link_addr[i][0],(int)addr);
10886 add_link(link_addr[i][1],stub);
10888 else set_jump_target(link_addr[i][0],(int)stub);
10893 int target=(link_addr[i][1]-start)>>2;
10894 assert(target>=0&&target<slen);
10895 assert(instr_addr[target]);
10896 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
10897 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
10899 set_jump_target(link_addr[i][0],instr_addr[target]);
10903 // External Branch Targets (jump_in)
10904 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
10905 for(i=0;i<slen;i++)
10909 if(instr_addr[i]) // TODO - delay slots (=null)
10911 u_int vaddr=start+i*4;
10912 u_int page=get_page(vaddr);
10913 u_int vpage=get_vpage(vaddr);
10915 //if(!(is32[i]&(~unneeded_reg_upper[i])&~(1LL<<CCREG)))
10917 if(!requires_32bit[i])
10922 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
10923 assem_debug("jump_in: %x\n",start+i*4);
10924 ll_add(jump_dirty+vpage,vaddr,(void *)out);
10925 int entry_point=do_dirty_stub(i);
10926 ll_add(jump_in+page,vaddr,(void *)entry_point);
10927 // If there was an existing entry in the hash table,
10928 // replace it with the new address.
10929 // Don't add new entries. We'll insert the
10930 // ones that actually get used in check_addr().
10931 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
10932 if(ht_bin[0]==vaddr) {
10933 ht_bin[1]=entry_point;
10935 if(ht_bin[2]==vaddr) {
10936 ht_bin[3]=entry_point;
10941 u_int r=requires_32bit[i]|!!(requires_32bit[i]>>32);
10942 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
10943 assem_debug("jump_in: %x (restricted - %x)\n",start+i*4,r);
10944 //int entry_point=(int)out;
10945 ////assem_debug("entry_point: %x\n",entry_point);
10946 //load_regs_entry(i);
10947 //if(entry_point==(int)out)
10948 // entry_point=instr_addr[i];
10950 // emit_jmp(instr_addr[i]);
10951 //ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
10952 ll_add_32(jump_dirty+vpage,vaddr,r,(void *)out);
10953 int entry_point=do_dirty_stub(i);
10954 ll_add_32(jump_in+page,vaddr,r,(void *)entry_point);
10959 // Write out the literal pool if necessary
10961 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
10963 if(((u_int)out)&7) emit_addnop(13);
10965 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
10966 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
10967 memcpy(copy,source,slen*4);
10971 __clear_cache((void *)beginning,out);
10974 // If we're within 256K of the end of the buffer,
10975 // start over from the beginning. (Is 256K enough?)
10976 if((int)out>BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
10978 // Trap writes to any of the pages we compiled
10979 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
10981 #ifndef DISABLE_TLB
10982 memory_map[i]|=0x40000000;
10983 if((signed int)start>=(signed int)0xC0000000) {
10985 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
10987 memory_map[j]|=0x40000000;
10988 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
10993 /* Pass 10 - Free memory by expiring oldest blocks */
10995 int end=((((int)out-BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
10996 while(expirep!=end)
10998 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
10999 int base=BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
11000 inv_debug("EXP: Phase %d\n",expirep);
11001 switch((expirep>>11)&3)
11004 // Clear jump_in and jump_dirty
11005 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
11006 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
11007 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
11008 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
11012 ll_kill_pointers(jump_out[expirep&2047],base,shift);
11013 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
11016 // Clear hash table
11017 for(i=0;i<32;i++) {
11018 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
11019 if((ht_bin[3]>>shift)==(base>>shift) ||
11020 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11021 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
11022 ht_bin[2]=ht_bin[3]=-1;
11024 if((ht_bin[1]>>shift)==(base>>shift) ||
11025 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11026 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
11027 ht_bin[0]=ht_bin[2];
11028 ht_bin[1]=ht_bin[3];
11029 ht_bin[2]=ht_bin[3]=-1;
11036 if((expirep&2047)==0)
11039 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
11040 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
11043 expirep=(expirep+1)&65535;
11048 // vim:shiftwidth=2:expandtab