1 /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
2 * Mupen64plus - new_dynarec.c *
3 * Copyright (C) 2009-2011 Ari64 *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program; if not, write to the *
17 * Free Software Foundation, Inc., *
18 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
19 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
22 #include <stdint.h> //include for uint64_t
27 #include "emu_if.h" //emulator interface
30 //#define assem_debug printf
31 //#define inv_debug printf
32 #define assem_debug(...)
33 #define inv_debug(...)
36 #include "assem_x86.h"
39 #include "assem_x64.h"
42 #include "assem_arm.h"
45 #ifdef __BLACKBERRY_QNX__
47 #define __clear_cache(start,end) msync(start, (size_t)((void*)end - (void*)start), MS_SYNC | MS_CACHE_ONLY | MS_INVALIDATE_ICACHE);
48 #elif defined(__MACH__)
49 #include <libkern/OSCacheControl.h>
50 #define __clear_cache mach_clear_cache
51 static void __clear_cache(void *start, void *end) {
52 size_t len = (char *)end - (char *)start;
53 sys_dcache_flush(start, len);
54 sys_icache_invalidate(start, len);
57 #include "3ds_utils.h"
58 #define __clear_cache(start,end) svcFlushProcessDataCache(0xFFFF8001, start, (u32)(end)-(u32)(start))
60 #define __clear_cache vita_clear_cache
61 static void __clear_cache(void *start, void *end) {
62 size_t len = (char *)end - (char *)start;
63 int block = sceKernelFindMemBlockByAddr(start,len);
64 sceKernelSyncVMDomain(block, start, len);
69 #define MAX_OUTPUT_BLOCK_SIZE 262144
73 signed char regmap_entry[HOST_REGS];
74 signed char regmap[HOST_REGS];
83 u_int loadedconst; // host regs that have constants loaded
84 u_int waswritten; // MIPS regs that were used as store base before
87 // note: asm depends on this layout
93 struct ll_entry *next;
98 char insn[MAXBLOCK][10];
99 u_char itype[MAXBLOCK];
100 u_char opcode[MAXBLOCK];
101 u_char opcode2[MAXBLOCK];
103 u_char rs1[MAXBLOCK];
104 u_char rs2[MAXBLOCK];
105 u_char rt1[MAXBLOCK];
106 u_char rt2[MAXBLOCK];
107 u_char us1[MAXBLOCK];
108 u_char us2[MAXBLOCK];
109 u_char dep1[MAXBLOCK];
110 u_char dep2[MAXBLOCK];
111 u_char lt1[MAXBLOCK];
112 static uint64_t gte_rs[MAXBLOCK]; // gte: 32 data and 32 ctl regs
113 static uint64_t gte_rt[MAXBLOCK];
114 static uint64_t gte_unneeded[MAXBLOCK];
115 static u_int smrv[32]; // speculated MIPS register values
116 static u_int smrv_strong; // mask or regs that are likely to have correct values
117 static u_int smrv_weak; // same, but somewhat less likely
118 static u_int smrv_strong_next; // same, but after current insn executes
119 static u_int smrv_weak_next;
122 char likely[MAXBLOCK];
123 char is_ds[MAXBLOCK];
125 uint64_t unneeded_reg[MAXBLOCK];
126 uint64_t unneeded_reg_upper[MAXBLOCK];
127 uint64_t branch_unneeded_reg[MAXBLOCK];
128 uint64_t branch_unneeded_reg_upper[MAXBLOCK];
129 uint64_t p32[MAXBLOCK];
130 uint64_t pr32[MAXBLOCK];
131 signed char regmap_pre[MAXBLOCK][HOST_REGS];
132 static uint64_t current_constmap[HOST_REGS];
133 static uint64_t constmap[MAXBLOCK][HOST_REGS];
134 static struct regstat regs[MAXBLOCK];
135 static struct regstat branch_regs[MAXBLOCK];
136 signed char minimum_free_regs[MAXBLOCK];
137 u_int needed_reg[MAXBLOCK];
138 uint64_t requires_32bit[MAXBLOCK];
139 u_int wont_dirty[MAXBLOCK];
140 u_int will_dirty[MAXBLOCK];
143 u_int instr_addr[MAXBLOCK];
144 static u_int link_addr[MAXBLOCK][3];
146 u_int stubs[MAXBLOCK*3][8];
148 u_int literals[1024][2];
153 struct ll_entry *jump_in[4096] __attribute__((aligned(16)));
154 struct ll_entry *jump_out[4096];
155 struct ll_entry *jump_dirty[4096];
156 u_int hash_table[65536][4] __attribute__((aligned(16)));
157 char shadow[1048576] __attribute__((aligned(16)));
163 static const u_int using_tlb=0;
165 int new_dynarec_did_compile;
166 int new_dynarec_hacks;
167 u_int stop_after_jal;
169 static u_int ram_offset;
171 static const u_int ram_offset=0;
173 extern u_char restore_candidate[512];
174 extern int cycle_count;
176 /* registers that may be allocated */
178 #define HIREG 32 // hi
179 #define LOREG 33 // lo
180 #define FSREG 34 // FPU status (FCSR)
181 #define CSREG 35 // Coprocessor status
182 #define CCREG 36 // Cycle count
183 #define INVCP 37 // Pointer to invalid_code
184 #define MMREG 38 // Pointer to memory_map
185 #define ROREG 39 // ram offset (if rdram!=0x80000000)
187 #define FTEMP 40 // FPU temporary register
188 #define PTEMP 41 // Prefetch temporary register
189 #define TLREG 42 // TLB mapping offset
190 #define RHASH 43 // Return address hash
191 #define RHTBL 44 // Return address hash table address
192 #define RTEMP 45 // JR/JALR address register
194 #define AGEN1 46 // Address generation temporary register
195 #define AGEN2 47 // Address generation temporary register
196 #define MGEN1 48 // Maptable address generation temporary register
197 #define MGEN2 49 // Maptable address generation temporary register
198 #define BTREG 50 // Branch target temporary register
200 /* instruction types */
201 #define NOP 0 // No operation
202 #define LOAD 1 // Load
203 #define STORE 2 // Store
204 #define LOADLR 3 // Unaligned load
205 #define STORELR 4 // Unaligned store
206 #define MOV 5 // Move
207 #define ALU 6 // Arithmetic/logic
208 #define MULTDIV 7 // Multiply/divide
209 #define SHIFT 8 // Shift by register
210 #define SHIFTIMM 9// Shift by immediate
211 #define IMM16 10 // 16-bit immediate
212 #define RJUMP 11 // Unconditional jump to register
213 #define UJUMP 12 // Unconditional jump
214 #define CJUMP 13 // Conditional branch (BEQ/BNE/BGTZ/BLEZ)
215 #define SJUMP 14 // Conditional branch (regimm format)
216 #define COP0 15 // Coprocessor 0
217 #define COP1 16 // Coprocessor 1
218 #define C1LS 17 // Coprocessor 1 load/store
219 #define FJUMP 18 // Conditional branch (floating point)
220 #define FLOAT 19 // Floating point unit
221 #define FCONV 20 // Convert integer to float
222 #define FCOMP 21 // Floating point compare (sets FSREG)
223 #define SYSCALL 22// SYSCALL
224 #define OTHER 23 // Other
225 #define SPAN 24 // Branch/delay slot spans 2 pages
226 #define NI 25 // Not implemented
227 #define HLECALL 26// PCSX fake opcodes for HLE
228 #define COP2 27 // Coprocessor 2 move
229 #define C2LS 28 // Coprocessor 2 load/store
230 #define C2OP 29 // Coprocessor 2 operation
231 #define INTCALL 30// Call interpreter to handle rare corner cases
240 #define LOADBU_STUB 7
241 #define LOADHU_STUB 8
242 #define STOREB_STUB 9
243 #define STOREH_STUB 10
244 #define STOREW_STUB 11
245 #define STORED_STUB 12
246 #define STORELR_STUB 13
247 #define INVCODE_STUB 14
255 int new_recompile_block(int addr);
256 void *get_addr_ht(u_int vaddr);
257 void invalidate_block(u_int block);
258 void invalidate_addr(u_int addr);
259 void remove_hash(int vaddr);
262 void dyna_linker_ds();
264 void verify_code_vm();
265 void verify_code_ds();
268 void fp_exception_ds();
270 void jump_syscall_hle();
274 void new_dyna_leave();
279 void read_nomem_new();
280 void read_nomemb_new();
281 void read_nomemh_new();
282 void read_nomemd_new();
283 void write_nomem_new();
284 void write_nomemb_new();
285 void write_nomemh_new();
286 void write_nomemd_new();
287 void write_rdram_new();
288 void write_rdramb_new();
289 void write_rdramh_new();
290 void write_rdramd_new();
291 extern u_int memory_map[1048576];
293 // Needed by assembler
294 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32);
295 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty);
296 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr);
297 void load_all_regs(signed char i_regmap[]);
298 void load_needed_regs(signed char i_regmap[],signed char next_regmap[]);
299 void load_regs_entry(int t);
300 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i);
304 //#define DEBUG_CYCLE_COUNT 1
306 #define NO_CYCLE_PENALTY_THR 12
308 int cycle_multiplier; // 100 for 1.0
310 static int CLOCK_ADJUST(int x)
313 return (x * cycle_multiplier + s * 50) / 100;
316 static void tlb_hacks()
320 if (strncmp((char *) ROM_HEADER->nom, "GOLDENEYE",9) == 0)
324 switch (ROM_HEADER->Country_code&0xFF)
336 // Unknown country code
340 u_int rom_addr=(u_int)rom;
342 // Since memory_map is 32-bit, on 64-bit systems the rom needs to be
343 // in the lower 4G of memory to use this hack. Copy it if necessary.
344 if((void *)rom>(void *)0xffffffff) {
345 munmap(ROM_COPY, 67108864);
346 if(mmap(ROM_COPY, 12582912,
347 PROT_READ | PROT_WRITE,
348 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
349 -1, 0) <= 0) {printf("mmap() failed\n");}
350 memcpy(ROM_COPY,rom,12582912);
351 rom_addr=(u_int)ROM_COPY;
355 for(n=0x7F000;n<0x80000;n++) {
356 memory_map[n]=(((u_int)(rom_addr+addr-0x7F000000))>>2)|0x40000000;
363 static u_int get_page(u_int vaddr)
366 u_int page=(vaddr^0x80000000)>>12;
368 u_int page=vaddr&~0xe0000000;
369 if (page < 0x1000000)
370 page &= ~0x0e00000; // RAM mirrors
374 if(page>262143&&tlb_LUT_r[vaddr>>12]) page=(tlb_LUT_r[vaddr>>12]^0x80000000)>>12;
376 if(page>2048) page=2048+(page&2047);
381 static u_int get_vpage(u_int vaddr)
383 u_int vpage=(vaddr^0x80000000)>>12;
385 if(vpage>262143&&tlb_LUT_r[vaddr>>12]) vpage&=2047; // jump_dirty uses a hash of the virtual address instead
387 if(vpage>2048) vpage=2048+(vpage&2047);
391 // no virtual mem in PCSX
392 static u_int get_vpage(u_int vaddr)
394 return get_page(vaddr);
398 // Get address from virtual address
399 // This is called from the recompiled JR/JALR instructions
400 void *get_addr(u_int vaddr)
402 u_int page=get_page(vaddr);
403 u_int vpage=get_vpage(vaddr);
404 struct ll_entry *head;
405 //printf("TRACE: count=%d next=%d (get_addr %x,page %d)\n",Count,next_interupt,vaddr,page);
408 if(head->vaddr==vaddr) {
409 //printf("TRACE: count=%d next=%d (get_addr match %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
410 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
413 ht_bin[1]=(int)head->addr;
419 head=jump_dirty[vpage];
421 if(head->vaddr==vaddr) {
422 //printf("TRACE: count=%d next=%d (get_addr match dirty %x: %x)\n",Count,next_interupt,vaddr,(int)head->addr);
423 // Don't restore blocks which are about to expire from the cache
424 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
425 if(verify_dirty(head->addr)) {
426 //printf("restore candidate: %x (%d) d=%d\n",vaddr,page,invalid_code[vaddr>>12]);
427 invalid_code[vaddr>>12]=0;
428 inv_code_start=inv_code_end=~0;
430 memory_map[vaddr>>12]|=0x40000000;
434 if(tlb_LUT_r[vaddr>>12]) {
435 invalid_code[tlb_LUT_r[vaddr>>12]>>12]=0;
436 memory_map[tlb_LUT_r[vaddr>>12]>>12]|=0x40000000;
439 restore_candidate[vpage>>3]|=1<<(vpage&7);
441 else restore_candidate[page>>3]|=1<<(page&7);
442 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
443 if(ht_bin[0]==vaddr) {
444 ht_bin[1]=(int)head->addr; // Replace existing entry
450 ht_bin[1]=(int)head->addr;
458 //printf("TRACE: count=%d next=%d (get_addr no-match %x)\n",Count,next_interupt,vaddr);
459 int r=new_recompile_block(vaddr);
460 if(r==0) return get_addr(vaddr);
461 // Execute in unmapped page, generate pagefault execption
463 Cause=(vaddr<<31)|0x8;
464 EPC=(vaddr&1)?vaddr-5:vaddr;
466 Context=(Context&0xFF80000F)|((BadVAddr>>9)&0x007FFFF0);
467 EntryHi=BadVAddr&0xFFFFE000;
468 return get_addr_ht(0x80000000);
470 // Look up address in hash table first
471 void *get_addr_ht(u_int vaddr)
473 //printf("TRACE: count=%d next=%d (get_addr_ht %x)\n",Count,next_interupt,vaddr);
474 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
475 if(ht_bin[0]==vaddr) return (void *)ht_bin[1];
476 if(ht_bin[2]==vaddr) return (void *)ht_bin[3];
477 return get_addr(vaddr);
480 void clear_all_regs(signed char regmap[])
483 for (hr=0;hr<HOST_REGS;hr++) regmap[hr]=-1;
486 signed char get_reg(signed char regmap[],int r)
489 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map[hr]==r) return hr;
493 // Find a register that is available for two consecutive cycles
494 signed char get_reg2(signed char regmap1[],signed char regmap2[],int r)
497 for (hr=0;hr<HOST_REGS;hr++) if(hr!=EXCLUDE_REG&®map1[hr]==r&®map2[hr]==r) return hr;
501 int count_free_regs(signed char regmap[])
505 for(hr=0;hr<HOST_REGS;hr++)
507 if(hr!=EXCLUDE_REG) {
508 if(regmap[hr]<0) count++;
514 void dirty_reg(struct regstat *cur,signed char reg)
518 for (hr=0;hr<HOST_REGS;hr++) {
519 if((cur->regmap[hr]&63)==reg) {
525 // If we dirty the lower half of a 64 bit register which is now being
526 // sign-extended, we need to dump the upper half.
527 // Note: Do this only after completion of the instruction, because
528 // some instructions may need to read the full 64-bit value even if
529 // overwriting it (eg SLTI, DSRA32).
530 static void flush_dirty_uppers(struct regstat *cur)
533 for (hr=0;hr<HOST_REGS;hr++) {
534 if((cur->dirty>>hr)&1) {
537 if((cur->is32>>(reg&63))&1) cur->regmap[hr]=-1;
542 void set_const(struct regstat *cur,signed char reg,uint64_t value)
546 for (hr=0;hr<HOST_REGS;hr++) {
547 if(cur->regmap[hr]==reg) {
549 current_constmap[hr]=value;
551 else if((cur->regmap[hr]^64)==reg) {
553 current_constmap[hr]=value>>32;
558 void clear_const(struct regstat *cur,signed char reg)
562 for (hr=0;hr<HOST_REGS;hr++) {
563 if((cur->regmap[hr]&63)==reg) {
564 cur->isconst&=~(1<<hr);
569 int is_const(struct regstat *cur,signed char reg)
574 for (hr=0;hr<HOST_REGS;hr++) {
575 if((cur->regmap[hr]&63)==reg) {
576 return (cur->isconst>>hr)&1;
581 uint64_t get_const(struct regstat *cur,signed char reg)
585 for (hr=0;hr<HOST_REGS;hr++) {
586 if(cur->regmap[hr]==reg) {
587 return current_constmap[hr];
590 SysPrintf("Unknown constant in r%d\n",reg);
594 // Least soon needed registers
595 // Look at the next ten instructions and see which registers
596 // will be used. Try not to reallocate these.
597 void lsn(u_char hsn[], int i, int *preferred_reg)
607 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
609 // Don't go past an unconditonal jump
616 if(rs1[i+j]) hsn[rs1[i+j]]=j;
617 if(rs2[i+j]) hsn[rs2[i+j]]=j;
618 if(rt1[i+j]) hsn[rt1[i+j]]=j;
619 if(rt2[i+j]) hsn[rt2[i+j]]=j;
620 if(itype[i+j]==STORE || itype[i+j]==STORELR) {
621 // Stores can allocate zero
625 // On some architectures stores need invc_ptr
626 #if defined(HOST_IMM8)
627 if(itype[i+j]==STORE || itype[i+j]==STORELR || (opcode[i+j]&0x3b)==0x39 || (opcode[i+j]&0x3b)==0x3a) {
631 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
639 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
641 // Follow first branch
642 int t=(ba[i+b]-start)>>2;
643 j=7-b;if(t+j>=slen) j=slen-t-1;
646 if(rs1[t+j]) if(hsn[rs1[t+j]]>j+b+2) hsn[rs1[t+j]]=j+b+2;
647 if(rs2[t+j]) if(hsn[rs2[t+j]]>j+b+2) hsn[rs2[t+j]]=j+b+2;
648 //if(rt1[t+j]) if(hsn[rt1[t+j]]>j+b+2) hsn[rt1[t+j]]=j+b+2;
649 //if(rt2[t+j]) if(hsn[rt2[t+j]]>j+b+2) hsn[rt2[t+j]]=j+b+2;
652 // TODO: preferred register based on backward branch
654 // Delay slot should preferably not overwrite branch conditions or cycle count
655 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
656 if(rs1[i-1]) if(hsn[rs1[i-1]]>1) hsn[rs1[i-1]]=1;
657 if(rs2[i-1]) if(hsn[rs2[i-1]]>1) hsn[rs2[i-1]]=1;
663 // Coprocessor load/store needs FTEMP, even if not declared
664 if(itype[i]==C1LS||itype[i]==C2LS) {
667 // Load L/R also uses FTEMP as a temporary register
668 if(itype[i]==LOADLR) {
671 // Also SWL/SWR/SDL/SDR
672 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) {
675 // Don't remove the TLB registers either
676 if(itype[i]==LOAD || itype[i]==LOADLR || itype[i]==STORE || itype[i]==STORELR || itype[i]==C1LS || itype[i]==C2LS) {
679 // Don't remove the miniht registers
680 if(itype[i]==UJUMP||itype[i]==RJUMP)
687 // We only want to allocate registers if we're going to use them again soon
688 int needed_again(int r, int i)
694 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000))
696 if(ba[i-1]<start || ba[i-1]>start+slen*4-4)
697 return 0; // Don't need any registers if exiting the block
705 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
707 // Don't go past an unconditonal jump
711 if(itype[i+j]==SYSCALL||itype[i+j]==HLECALL||itype[i+j]==INTCALL||((source[i+j]&0xfc00003f)==0x0d))
718 if(rs1[i+j]==r) rn=j;
719 if(rs2[i+j]==r) rn=j;
720 if((unneeded_reg[i+j]>>r)&1) rn=10;
721 if(i+j>=0&&(itype[i+j]==UJUMP||itype[i+j]==CJUMP||itype[i+j]==SJUMP||itype[i+j]==FJUMP))
729 if(ba[i+b]>=start && ba[i+b]<(start+slen*4))
731 // Follow first branch
733 int t=(ba[i+b]-start)>>2;
734 j=7-b;if(t+j>=slen) j=slen-t-1;
737 if(!((unneeded_reg[t+j]>>r)&1)) {
738 if(rs1[t+j]==r) if(rn>j+b+2) rn=j+b+2;
739 if(rs2[t+j]==r) if(rn>j+b+2) rn=j+b+2;
749 // Try to match register allocations at the end of a loop with those
751 int loop_reg(int i, int r, int hr)
760 if(itype[i+j]==UJUMP||itype[i+j]==RJUMP||(source[i+j]>>16)==0x1000)
762 // Don't go past an unconditonal jump
769 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)
774 if(r<64&&((unneeded_reg[i+k]>>r)&1)) return hr;
775 if(r>64&&((unneeded_reg_upper[i+k]>>r)&1)) return hr;
776 if(i+k>=0&&(itype[i+k]==UJUMP||itype[i+k]==CJUMP||itype[i+k]==SJUMP||itype[i+k]==FJUMP))
778 if(ba[i+k]>=start && ba[i+k]<(start+i*4))
780 int t=(ba[i+k]-start)>>2;
781 int reg=get_reg(regs[t].regmap_entry,r);
782 if(reg>=0) return reg;
783 //reg=get_reg(regs[t+1].regmap_entry,r);
784 //if(reg>=0) return reg;
792 // Allocate every register, preserving source/target regs
793 void alloc_all(struct regstat *cur,int i)
797 for(hr=0;hr<HOST_REGS;hr++) {
798 if(hr!=EXCLUDE_REG) {
799 if(((cur->regmap[hr]&63)!=rs1[i])&&((cur->regmap[hr]&63)!=rs2[i])&&
800 ((cur->regmap[hr]&63)!=rt1[i])&&((cur->regmap[hr]&63)!=rt2[i]))
803 cur->dirty&=~(1<<hr);
806 if((cur->regmap[hr]&63)==0)
809 cur->dirty&=~(1<<hr);
816 void div64(int64_t dividend,int64_t divisor)
820 //printf("TRACE: ddiv %8x%8x %8x%8x\n" ,(int)reg[HIREG],(int)(reg[HIREG]>>32)
821 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
823 void divu64(uint64_t dividend,uint64_t divisor)
827 //printf("TRACE: ddivu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
828 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
831 void mult64(uint64_t m1,uint64_t m2)
833 unsigned long long int op1, op2, op3, op4;
834 unsigned long long int result1, result2, result3, result4;
835 unsigned long long int temp1, temp2, temp3, temp4;
851 op1 = op2 & 0xFFFFFFFF;
852 op2 = (op2 >> 32) & 0xFFFFFFFF;
853 op3 = op4 & 0xFFFFFFFF;
854 op4 = (op4 >> 32) & 0xFFFFFFFF;
857 temp2 = (temp1 >> 32) + op1 * op4;
859 temp4 = (temp3 >> 32) + op2 * op4;
861 result1 = temp1 & 0xFFFFFFFF;
862 result2 = temp2 + (temp3 & 0xFFFFFFFF);
863 result3 = (result2 >> 32) + temp4;
864 result4 = (result3 >> 32);
866 lo = result1 | (result2 << 32);
867 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
876 void multu64(uint64_t m1,uint64_t m2)
878 unsigned long long int op1, op2, op3, op4;
879 unsigned long long int result1, result2, result3, result4;
880 unsigned long long int temp1, temp2, temp3, temp4;
882 op1 = m1 & 0xFFFFFFFF;
883 op2 = (m1 >> 32) & 0xFFFFFFFF;
884 op3 = m2 & 0xFFFFFFFF;
885 op4 = (m2 >> 32) & 0xFFFFFFFF;
888 temp2 = (temp1 >> 32) + op1 * op4;
890 temp4 = (temp3 >> 32) + op2 * op4;
892 result1 = temp1 & 0xFFFFFFFF;
893 result2 = temp2 + (temp3 & 0xFFFFFFFF);
894 result3 = (result2 >> 32) + temp4;
895 result4 = (result3 >> 32);
897 lo = result1 | (result2 << 32);
898 hi = (result3 & 0xFFFFFFFF) | (result4 << 32);
900 //printf("TRACE: dmultu %8x%8x %8x%8x\n",(int)reg[HIREG],(int)(reg[HIREG]>>32)
901 // ,(int)reg[LOREG],(int)(reg[LOREG]>>32));
904 uint64_t ldl_merge(uint64_t original,uint64_t loaded,u_int bits)
912 else original=loaded;
915 uint64_t ldr_merge(uint64_t original,uint64_t loaded,u_int bits)
918 original>>=64-(bits^56);
919 original<<=64-(bits^56);
923 else original=loaded;
929 #include "assem_x86.c"
932 #include "assem_x64.c"
935 #include "assem_arm.c"
938 // Add virtual address mapping to linked list
939 void ll_add(struct ll_entry **head,int vaddr,void *addr)
941 struct ll_entry *new_entry;
942 new_entry=malloc(sizeof(struct ll_entry));
943 assert(new_entry!=NULL);
944 new_entry->vaddr=vaddr;
945 new_entry->reg_sv_flags=0;
946 new_entry->addr=addr;
947 new_entry->next=*head;
951 void ll_add_flags(struct ll_entry **head,int vaddr,u_int reg_sv_flags,void *addr)
953 ll_add(head,vaddr,addr);
954 (*head)->reg_sv_flags=reg_sv_flags;
957 // Check if an address is already compiled
958 // but don't return addresses which are about to expire from the cache
959 void *check_addr(u_int vaddr)
961 u_int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
962 if(ht_bin[0]==vaddr) {
963 if(((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
964 if(isclean(ht_bin[1])) return (void *)ht_bin[1];
966 if(ht_bin[2]==vaddr) {
967 if(((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2)))
968 if(isclean(ht_bin[3])) return (void *)ht_bin[3];
970 u_int page=get_page(vaddr);
971 struct ll_entry *head;
974 if(head->vaddr==vaddr) {
975 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
976 // Update existing entry with current address
977 if(ht_bin[0]==vaddr) {
978 ht_bin[1]=(int)head->addr;
981 if(ht_bin[2]==vaddr) {
982 ht_bin[3]=(int)head->addr;
985 // Insert into hash table with low priority.
986 // Don't evict existing entries, as they are probably
987 // addresses that are being accessed frequently.
989 ht_bin[1]=(int)head->addr;
991 }else if(ht_bin[2]==-1) {
992 ht_bin[3]=(int)head->addr;
1003 void remove_hash(int vaddr)
1005 //printf("remove hash: %x\n",vaddr);
1006 int *ht_bin=hash_table[(((vaddr)>>16)^vaddr)&0xFFFF];
1007 if(ht_bin[2]==vaddr) {
1008 ht_bin[2]=ht_bin[3]=-1;
1010 if(ht_bin[0]==vaddr) {
1011 ht_bin[0]=ht_bin[2];
1012 ht_bin[1]=ht_bin[3];
1013 ht_bin[2]=ht_bin[3]=-1;
1017 void ll_remove_matching_addrs(struct ll_entry **head,int addr,int shift)
1019 struct ll_entry *next;
1021 if(((u_int)((*head)->addr)>>shift)==(addr>>shift) ||
1022 ((u_int)((*head)->addr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift))
1024 inv_debug("EXP: Remove pointer to %x (%x)\n",(int)(*head)->addr,(*head)->vaddr);
1025 remove_hash((*head)->vaddr);
1032 head=&((*head)->next);
1037 // Remove all entries from linked list
1038 void ll_clear(struct ll_entry **head)
1040 struct ll_entry *cur;
1041 struct ll_entry *next;
1052 // Dereference the pointers and remove if it matches
1053 void ll_kill_pointers(struct ll_entry *head,int addr,int shift)
1056 int ptr=get_pointer(head->addr);
1057 inv_debug("EXP: Lookup pointer to %x at %x (%x)\n",(int)ptr,(int)head->addr,head->vaddr);
1058 if(((ptr>>shift)==(addr>>shift)) ||
1059 (((ptr-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(addr>>shift)))
1061 inv_debug("EXP: Kill pointer at %x (%x)\n",(int)head->addr,head->vaddr);
1062 u_int host_addr=(u_int)kill_pointer(head->addr);
1064 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1071 // This is called when we write to a compiled block (see do_invstub)
1072 void invalidate_page(u_int page)
1074 struct ll_entry *head;
1075 struct ll_entry *next;
1079 inv_debug("INVALIDATE: %x\n",head->vaddr);
1080 remove_hash(head->vaddr);
1085 head=jump_out[page];
1088 inv_debug("INVALIDATE: kill pointer to %x (%x)\n",head->vaddr,(int)head->addr);
1089 u_int host_addr=(u_int)kill_pointer(head->addr);
1091 needs_clear_cache[(host_addr-(u_int)BASE_ADDR)>>17]|=1<<(((host_addr-(u_int)BASE_ADDR)>>12)&31);
1099 static void invalidate_block_range(u_int block, u_int first, u_int last)
1101 u_int page=get_page(block<<12);
1102 //printf("first=%d last=%d\n",first,last);
1103 invalidate_page(page);
1104 assert(first+5>page); // NB: this assumes MAXBLOCK<=4096 (4 pages)
1105 assert(last<page+5);
1106 // Invalidate the adjacent pages if a block crosses a 4K boundary
1108 invalidate_page(first);
1111 for(first=page+1;first<last;first++) {
1112 invalidate_page(first);
1118 // Don't trap writes
1119 invalid_code[block]=1;
1121 // If there is a valid TLB entry for this page, remove write protect
1122 if(tlb_LUT_w[block]) {
1123 assert(tlb_LUT_r[block]==tlb_LUT_w[block]);
1124 // CHECK: Is this right?
1125 memory_map[block]=((tlb_LUT_w[block]&0xFFFFF000)-(block<<12)+(unsigned int)rdram-0x80000000)>>2;
1126 u_int real_block=tlb_LUT_w[block]>>12;
1127 invalid_code[real_block]=1;
1128 if(real_block>=0x80000&&real_block<0x80800) memory_map[real_block]=((u_int)rdram-0x80000000)>>2;
1130 else if(block>=0x80000&&block<0x80800) memory_map[block]=((u_int)rdram-0x80000000)>>2;
1134 memset(mini_ht,-1,sizeof(mini_ht));
1138 void invalidate_block(u_int block)
1140 u_int page=get_page(block<<12);
1141 u_int vpage=get_vpage(block<<12);
1142 inv_debug("INVALIDATE: %x (%d)\n",block<<12,page);
1143 //inv_debug("invalid_code[block]=%d\n",invalid_code[block]);
1146 struct ll_entry *head;
1147 head=jump_dirty[vpage];
1148 //printf("page=%d vpage=%d\n",page,vpage);
1151 if(vpage>2047||(head->vaddr>>12)==block) { // Ignore vaddr hash collision
1152 get_bounds((int)head->addr,&start,&end);
1153 //printf("start: %x end: %x\n",start,end);
1154 if(page<2048&&start>=(u_int)rdram&&end<(u_int)rdram+RAM_SIZE) {
1155 if(((start-(u_int)rdram)>>12)<=page&&((end-1-(u_int)rdram)>>12)>=page) {
1156 if((((start-(u_int)rdram)>>12)&2047)<first) first=((start-(u_int)rdram)>>12)&2047;
1157 if((((end-1-(u_int)rdram)>>12)&2047)>last) last=((end-1-(u_int)rdram)>>12)&2047;
1161 if(page<2048&&(signed int)start>=(signed int)0xC0000000&&(signed int)end>=(signed int)0xC0000000) {
1162 if(((start+memory_map[start>>12]-(u_int)rdram)>>12)<=page&&((end-1+memory_map[(end-1)>>12]-(u_int)rdram)>>12)>=page) {
1163 if((((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047)<first) first=((start+memory_map[start>>12]-(u_int)rdram)>>12)&2047;
1164 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;
1171 invalidate_block_range(block,first,last);
1174 void invalidate_addr(u_int addr)
1178 // this check is done by the caller
1179 //if (inv_code_start<=addr&&addr<=inv_code_end) { rhits++; return; }
1180 u_int page=get_vpage(addr);
1181 if(page<2048) { // RAM
1182 struct ll_entry *head;
1183 u_int addr_min=~0, addr_max=0;
1184 u_int mask=RAM_SIZE-1;
1185 u_int addr_main=0x80000000|(addr&mask);
1187 inv_code_start=addr_main&~0xfff;
1188 inv_code_end=addr_main|0xfff;
1191 // must check previous page too because of spans..
1193 inv_code_start-=0x1000;
1195 for(;pg1<=page;pg1++) {
1196 for(head=jump_dirty[pg1];head!=NULL;head=head->next) {
1198 get_bounds((int)head->addr,&start,&end);
1203 if(start<=addr_main&&addr_main<end) {
1204 if(start<addr_min) addr_min=start;
1205 if(end>addr_max) addr_max=end;
1207 else if(addr_main<start) {
1208 if(start<inv_code_end)
1209 inv_code_end=start-1;
1212 if(end>inv_code_start)
1218 inv_debug("INV ADDR: %08x hit %08x-%08x\n", addr, addr_min, addr_max);
1219 inv_code_start=inv_code_end=~0;
1220 invalidate_block_range(addr>>12,(addr_min&mask)>>12,(addr_max&mask)>>12);
1224 inv_code_start=(addr&~mask)|(inv_code_start&mask);
1225 inv_code_end=(addr&~mask)|(inv_code_end&mask);
1226 inv_debug("INV ADDR: %08x miss, inv %08x-%08x, sk %d\n", addr, inv_code_start, inv_code_end, 0);
1231 invalidate_block(addr>>12);
1234 // This is called when loading a save state.
1235 // Anything could have changed, so invalidate everything.
1236 void invalidate_all_pages()
1239 for(page=0;page<4096;page++)
1240 invalidate_page(page);
1241 for(page=0;page<1048576;page++)
1242 if(!invalid_code[page]) {
1243 restore_candidate[(page&2047)>>3]|=1<<(page&7);
1244 restore_candidate[((page&2047)>>3)+256]|=1<<(page&7);
1247 __clear_cache((void *)BASE_ADDR,(void *)BASE_ADDR+(1<<TARGET_SIZE_2));
1250 memset(mini_ht,-1,sizeof(mini_ht));
1254 for(page=0;page<0x100000;page++) {
1255 if(tlb_LUT_r[page]) {
1256 memory_map[page]=((tlb_LUT_r[page]&0xFFFFF000)-(page<<12)+(unsigned int)rdram-0x80000000)>>2;
1257 if(!tlb_LUT_w[page]||!invalid_code[page])
1258 memory_map[page]|=0x40000000; // Write protect
1260 else memory_map[page]=-1;
1261 if(page==0x80000) page=0xC0000;
1267 // Add an entry to jump_out after making a link
1268 void add_link(u_int vaddr,void *src)
1270 u_int page=get_page(vaddr);
1271 inv_debug("add_link: %x -> %x (%d)\n",(int)src,vaddr,page);
1272 int *ptr=(int *)(src+4);
1273 assert((*ptr&0x0fff0000)==0x059f0000);
1274 ll_add(jump_out+page,vaddr,src);
1275 //int ptr=get_pointer(src);
1276 //inv_debug("add_link: Pointer is to %x\n",(int)ptr);
1279 // If a code block was found to be unmodified (bit was set in
1280 // restore_candidate) and it remains unmodified (bit is clear
1281 // in invalid_code) then move the entries for that 4K page from
1282 // the dirty list to the clean list.
1283 void clean_blocks(u_int page)
1285 struct ll_entry *head;
1286 inv_debug("INV: clean_blocks page=%d\n",page);
1287 head=jump_dirty[page];
1289 if(!invalid_code[head->vaddr>>12]) {
1290 // Don't restore blocks which are about to expire from the cache
1291 if((((u_int)head->addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1293 if(verify_dirty((int)head->addr)) {
1294 //printf("Possibly Restore %x (%x)\n",head->vaddr, (int)head->addr);
1297 get_bounds((int)head->addr,&start,&end);
1298 if(start-(u_int)rdram<RAM_SIZE) {
1299 for(i=(start-(u_int)rdram+0x80000000)>>12;i<=(end-1-(u_int)rdram+0x80000000)>>12;i++) {
1300 inv|=invalid_code[i];
1304 if((signed int)head->vaddr>=(signed int)0xC0000000) {
1305 u_int addr = (head->vaddr+(memory_map[head->vaddr>>12]<<2));
1306 //printf("addr=%x start=%x end=%x\n",addr,start,end);
1307 if(addr<start||addr>=end) inv=1;
1310 else if((signed int)head->vaddr>=(signed int)0x80000000+RAM_SIZE) {
1314 void * clean_addr=(void *)get_clean_addr((int)head->addr);
1315 if((((u_int)clean_addr-(u_int)out)<<(32-TARGET_SIZE_2))>0x60000000+(MAX_OUTPUT_BLOCK_SIZE<<(32-TARGET_SIZE_2))) {
1318 if(page<2048&&tlb_LUT_r[head->vaddr>>12]) ppage=(tlb_LUT_r[head->vaddr>>12]^0x80000000)>>12;
1320 inv_debug("INV: Restored %x (%x/%x)\n",head->vaddr, (int)head->addr, (int)clean_addr);
1321 //printf("page=%x, addr=%x\n",page,head->vaddr);
1322 //assert(head->vaddr>>12==(page|0x80000));
1323 ll_add_flags(jump_in+ppage,head->vaddr,head->reg_sv_flags,clean_addr);
1324 int *ht_bin=hash_table[((head->vaddr>>16)^head->vaddr)&0xFFFF];
1325 if(ht_bin[0]==head->vaddr) {
1326 ht_bin[1]=(int)clean_addr; // Replace existing entry
1328 if(ht_bin[2]==head->vaddr) {
1329 ht_bin[3]=(int)clean_addr; // Replace existing entry
1341 void mov_alloc(struct regstat *current,int i)
1343 // Note: Don't need to actually alloc the source registers
1344 if((~current->is32>>rs1[i])&1) {
1345 //alloc_reg64(current,i,rs1[i]);
1346 alloc_reg64(current,i,rt1[i]);
1347 current->is32&=~(1LL<<rt1[i]);
1349 //alloc_reg(current,i,rs1[i]);
1350 alloc_reg(current,i,rt1[i]);
1351 current->is32|=(1LL<<rt1[i]);
1353 clear_const(current,rs1[i]);
1354 clear_const(current,rt1[i]);
1355 dirty_reg(current,rt1[i]);
1358 void shiftimm_alloc(struct regstat *current,int i)
1360 if(opcode2[i]<=0x3) // SLL/SRL/SRA
1363 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1365 alloc_reg(current,i,rt1[i]);
1366 current->is32|=1LL<<rt1[i];
1367 dirty_reg(current,rt1[i]);
1368 if(is_const(current,rs1[i])) {
1369 int v=get_const(current,rs1[i]);
1370 if(opcode2[i]==0x00) set_const(current,rt1[i],v<<imm[i]);
1371 if(opcode2[i]==0x02) set_const(current,rt1[i],(u_int)v>>imm[i]);
1372 if(opcode2[i]==0x03) set_const(current,rt1[i],v>>imm[i]);
1374 else clear_const(current,rt1[i]);
1379 clear_const(current,rs1[i]);
1380 clear_const(current,rt1[i]);
1383 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
1386 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1387 alloc_reg64(current,i,rt1[i]);
1388 current->is32&=~(1LL<<rt1[i]);
1389 dirty_reg(current,rt1[i]);
1392 if(opcode2[i]==0x3c) // DSLL32
1395 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1396 alloc_reg64(current,i,rt1[i]);
1397 current->is32&=~(1LL<<rt1[i]);
1398 dirty_reg(current,rt1[i]);
1401 if(opcode2[i]==0x3e) // DSRL32
1404 alloc_reg64(current,i,rs1[i]);
1406 alloc_reg64(current,i,rt1[i]);
1407 current->is32&=~(1LL<<rt1[i]);
1409 alloc_reg(current,i,rt1[i]);
1410 current->is32|=1LL<<rt1[i];
1412 dirty_reg(current,rt1[i]);
1415 if(opcode2[i]==0x3f) // DSRA32
1418 alloc_reg64(current,i,rs1[i]);
1419 alloc_reg(current,i,rt1[i]);
1420 current->is32|=1LL<<rt1[i];
1421 dirty_reg(current,rt1[i]);
1426 void shift_alloc(struct regstat *current,int i)
1429 if(opcode2[i]<=0x07) // SLLV/SRLV/SRAV
1431 if(rs1[i]) alloc_reg(current,i,rs1[i]);
1432 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1433 alloc_reg(current,i,rt1[i]);
1434 if(rt1[i]==rs2[i]) {
1435 alloc_reg_temp(current,i,-1);
1436 minimum_free_regs[i]=1;
1438 current->is32|=1LL<<rt1[i];
1439 } else { // DSLLV/DSRLV/DSRAV
1440 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
1441 if(rs2[i]) alloc_reg(current,i,rs2[i]);
1442 alloc_reg64(current,i,rt1[i]);
1443 current->is32&=~(1LL<<rt1[i]);
1444 if(opcode2[i]==0x16||opcode2[i]==0x17) // DSRLV and DSRAV need a temporary register
1446 alloc_reg_temp(current,i,-1);
1447 minimum_free_regs[i]=1;
1450 clear_const(current,rs1[i]);
1451 clear_const(current,rs2[i]);
1452 clear_const(current,rt1[i]);
1453 dirty_reg(current,rt1[i]);
1457 void alu_alloc(struct regstat *current,int i)
1459 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
1461 if(rs1[i]&&rs2[i]) {
1462 alloc_reg(current,i,rs1[i]);
1463 alloc_reg(current,i,rs2[i]);
1466 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1467 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1469 alloc_reg(current,i,rt1[i]);
1471 current->is32|=1LL<<rt1[i];
1473 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
1475 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1477 alloc_reg64(current,i,rs1[i]);
1478 alloc_reg64(current,i,rs2[i]);
1479 alloc_reg(current,i,rt1[i]);
1481 alloc_reg(current,i,rs1[i]);
1482 alloc_reg(current,i,rs2[i]);
1483 alloc_reg(current,i,rt1[i]);
1486 current->is32|=1LL<<rt1[i];
1488 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
1490 if(rs1[i]&&rs2[i]) {
1491 alloc_reg(current,i,rs1[i]);
1492 alloc_reg(current,i,rs2[i]);
1496 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1497 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg(current,i,rs2[i]);
1499 alloc_reg(current,i,rt1[i]);
1500 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
1502 if(!((current->uu>>rt1[i])&1)) {
1503 alloc_reg64(current,i,rt1[i]);
1505 if(get_reg(current->regmap,rt1[i]|64)>=0) {
1506 if(rs1[i]&&rs2[i]) {
1507 alloc_reg64(current,i,rs1[i]);
1508 alloc_reg64(current,i,rs2[i]);
1512 // Is is really worth it to keep 64-bit values in registers?
1514 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1515 if(rs2[i]&&needed_again(rs2[i],i)) alloc_reg64(current,i,rs2[i]);
1519 current->is32&=~(1LL<<rt1[i]);
1521 current->is32|=1LL<<rt1[i];
1525 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
1527 if(rs1[i]&&rs2[i]) {
1528 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1529 alloc_reg64(current,i,rs1[i]);
1530 alloc_reg64(current,i,rs2[i]);
1531 alloc_reg64(current,i,rt1[i]);
1533 alloc_reg(current,i,rs1[i]);
1534 alloc_reg(current,i,rs2[i]);
1535 alloc_reg(current,i,rt1[i]);
1539 alloc_reg(current,i,rt1[i]);
1540 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1541 // DADD used as move, or zeroing
1542 // If we have a 64-bit source, then make the target 64 bits too
1543 if(rs1[i]&&!((current->is32>>rs1[i])&1)) {
1544 if(get_reg(current->regmap,rs1[i])>=0) alloc_reg64(current,i,rs1[i]);
1545 alloc_reg64(current,i,rt1[i]);
1546 } else if(rs2[i]&&!((current->is32>>rs2[i])&1)) {
1547 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1548 alloc_reg64(current,i,rt1[i]);
1550 if(opcode2[i]>=0x2e&&rs2[i]) {
1551 // DSUB used as negation - 64-bit result
1552 // If we have a 32-bit register, extend it to 64 bits
1553 if(get_reg(current->regmap,rs2[i])>=0) alloc_reg64(current,i,rs2[i]);
1554 alloc_reg64(current,i,rt1[i]);
1558 if(rs1[i]&&rs2[i]) {
1559 current->is32&=~(1LL<<rt1[i]);
1561 current->is32&=~(1LL<<rt1[i]);
1562 if((current->is32>>rs1[i])&1)
1563 current->is32|=1LL<<rt1[i];
1565 current->is32&=~(1LL<<rt1[i]);
1566 if((current->is32>>rs2[i])&1)
1567 current->is32|=1LL<<rt1[i];
1569 current->is32|=1LL<<rt1[i];
1573 clear_const(current,rs1[i]);
1574 clear_const(current,rs2[i]);
1575 clear_const(current,rt1[i]);
1576 dirty_reg(current,rt1[i]);
1579 void imm16_alloc(struct regstat *current,int i)
1581 if(rs1[i]&&needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1583 if(rt1[i]) alloc_reg(current,i,rt1[i]);
1584 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
1585 current->is32&=~(1LL<<rt1[i]);
1586 if(!((current->uu>>rt1[i])&1)||get_reg(current->regmap,rt1[i]|64)>=0) {
1587 // TODO: Could preserve the 32-bit flag if the immediate is zero
1588 alloc_reg64(current,i,rt1[i]);
1589 alloc_reg64(current,i,rs1[i]);
1591 clear_const(current,rs1[i]);
1592 clear_const(current,rt1[i]);
1594 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
1595 if((~current->is32>>rs1[i])&1) alloc_reg64(current,i,rs1[i]);
1596 current->is32|=1LL<<rt1[i];
1597 clear_const(current,rs1[i]);
1598 clear_const(current,rt1[i]);
1600 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
1601 if(((~current->is32>>rs1[i])&1)&&opcode[i]>0x0c) {
1602 if(rs1[i]!=rt1[i]) {
1603 if(needed_again(rs1[i],i)) alloc_reg64(current,i,rs1[i]);
1604 alloc_reg64(current,i,rt1[i]);
1605 current->is32&=~(1LL<<rt1[i]);
1608 else current->is32|=1LL<<rt1[i]; // ANDI clears upper bits
1609 if(is_const(current,rs1[i])) {
1610 int v=get_const(current,rs1[i]);
1611 if(opcode[i]==0x0c) set_const(current,rt1[i],v&imm[i]);
1612 if(opcode[i]==0x0d) set_const(current,rt1[i],v|imm[i]);
1613 if(opcode[i]==0x0e) set_const(current,rt1[i],v^imm[i]);
1615 else clear_const(current,rt1[i]);
1617 else if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
1618 if(is_const(current,rs1[i])) {
1619 int v=get_const(current,rs1[i]);
1620 set_const(current,rt1[i],v+imm[i]);
1622 else clear_const(current,rt1[i]);
1623 current->is32|=1LL<<rt1[i];
1626 set_const(current,rt1[i],((long long)((short)imm[i]))<<16); // LUI
1627 current->is32|=1LL<<rt1[i];
1629 dirty_reg(current,rt1[i]);
1632 void load_alloc(struct regstat *current,int i)
1634 clear_const(current,rt1[i]);
1635 //if(rs1[i]!=rt1[i]&&needed_again(rs1[i],i)) clear_const(current,rs1[i]); // Does this help or hurt?
1636 if(!rs1[i]) current->u&=~1LL; // Allow allocating r0 if it's the source register
1637 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1638 if(rt1[i]&&!((current->u>>rt1[i])&1)) {
1639 alloc_reg(current,i,rt1[i]);
1640 assert(get_reg(current->regmap,rt1[i])>=0);
1641 if(opcode[i]==0x27||opcode[i]==0x37) // LWU/LD
1643 current->is32&=~(1LL<<rt1[i]);
1644 alloc_reg64(current,i,rt1[i]);
1646 else if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1648 current->is32&=~(1LL<<rt1[i]);
1649 alloc_reg64(current,i,rt1[i]);
1650 alloc_all(current,i);
1651 alloc_reg64(current,i,FTEMP);
1652 minimum_free_regs[i]=HOST_REGS;
1654 else current->is32|=1LL<<rt1[i];
1655 dirty_reg(current,rt1[i]);
1656 // If using TLB, need a register for pointer to the mapping table
1657 if(using_tlb) alloc_reg(current,i,TLREG);
1658 // LWL/LWR need a temporary register for the old value
1659 if(opcode[i]==0x22||opcode[i]==0x26)
1661 alloc_reg(current,i,FTEMP);
1662 alloc_reg_temp(current,i,-1);
1663 minimum_free_regs[i]=1;
1668 // Load to r0 or unneeded register (dummy load)
1669 // but we still need a register to calculate the address
1670 if(opcode[i]==0x22||opcode[i]==0x26)
1672 alloc_reg(current,i,FTEMP); // LWL/LWR need another temporary
1674 // If using TLB, need a register for pointer to the mapping table
1675 if(using_tlb) alloc_reg(current,i,TLREG);
1676 alloc_reg_temp(current,i,-1);
1677 minimum_free_regs[i]=1;
1678 if(opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
1680 alloc_all(current,i);
1681 alloc_reg64(current,i,FTEMP);
1682 minimum_free_regs[i]=HOST_REGS;
1687 void store_alloc(struct regstat *current,int i)
1689 clear_const(current,rs2[i]);
1690 if(!(rs2[i])) current->u&=~1LL; // Allow allocating r0 if necessary
1691 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1692 alloc_reg(current,i,rs2[i]);
1693 if(opcode[i]==0x2c||opcode[i]==0x2d||opcode[i]==0x3f) { // 64-bit SDL/SDR/SD
1694 alloc_reg64(current,i,rs2[i]);
1695 if(rs2[i]) alloc_reg(current,i,FTEMP);
1697 // If using TLB, need a register for pointer to the mapping table
1698 if(using_tlb) alloc_reg(current,i,TLREG);
1699 #if defined(HOST_IMM8)
1700 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1701 else alloc_reg(current,i,INVCP);
1703 if(opcode[i]==0x2a||opcode[i]==0x2e||opcode[i]==0x2c||opcode[i]==0x2d) { // SWL/SWL/SDL/SDR
1704 alloc_reg(current,i,FTEMP);
1706 // We need a temporary register for address generation
1707 alloc_reg_temp(current,i,-1);
1708 minimum_free_regs[i]=1;
1711 void c1ls_alloc(struct regstat *current,int i)
1713 //clear_const(current,rs1[i]); // FIXME
1714 clear_const(current,rt1[i]);
1715 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1716 alloc_reg(current,i,CSREG); // Status
1717 alloc_reg(current,i,FTEMP);
1718 if(opcode[i]==0x35||opcode[i]==0x3d) { // 64-bit LDC1/SDC1
1719 alloc_reg64(current,i,FTEMP);
1721 // If using TLB, need a register for pointer to the mapping table
1722 if(using_tlb) alloc_reg(current,i,TLREG);
1723 #if defined(HOST_IMM8)
1724 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1725 else if((opcode[i]&0x3b)==0x39) // SWC1/SDC1
1726 alloc_reg(current,i,INVCP);
1728 // We need a temporary register for address generation
1729 alloc_reg_temp(current,i,-1);
1732 void c2ls_alloc(struct regstat *current,int i)
1734 clear_const(current,rt1[i]);
1735 if(needed_again(rs1[i],i)) alloc_reg(current,i,rs1[i]);
1736 alloc_reg(current,i,FTEMP);
1737 // If using TLB, need a register for pointer to the mapping table
1738 if(using_tlb) alloc_reg(current,i,TLREG);
1739 #if defined(HOST_IMM8)
1740 // On CPUs without 32-bit immediates we need a pointer to invalid_code
1741 else if((opcode[i]&0x3b)==0x3a) // SWC2/SDC2
1742 alloc_reg(current,i,INVCP);
1744 // We need a temporary register for address generation
1745 alloc_reg_temp(current,i,-1);
1746 minimum_free_regs[i]=1;
1749 #ifndef multdiv_alloc
1750 void multdiv_alloc(struct regstat *current,int i)
1757 // case 0x1D: DMULTU
1760 clear_const(current,rs1[i]);
1761 clear_const(current,rs2[i]);
1764 if((opcode2[i]&4)==0) // 32-bit
1766 current->u&=~(1LL<<HIREG);
1767 current->u&=~(1LL<<LOREG);
1768 alloc_reg(current,i,HIREG);
1769 alloc_reg(current,i,LOREG);
1770 alloc_reg(current,i,rs1[i]);
1771 alloc_reg(current,i,rs2[i]);
1772 current->is32|=1LL<<HIREG;
1773 current->is32|=1LL<<LOREG;
1774 dirty_reg(current,HIREG);
1775 dirty_reg(current,LOREG);
1779 current->u&=~(1LL<<HIREG);
1780 current->u&=~(1LL<<LOREG);
1781 current->uu&=~(1LL<<HIREG);
1782 current->uu&=~(1LL<<LOREG);
1783 alloc_reg64(current,i,HIREG);
1784 //if(HOST_REGS>10) alloc_reg64(current,i,LOREG);
1785 alloc_reg64(current,i,rs1[i]);
1786 alloc_reg64(current,i,rs2[i]);
1787 alloc_all(current,i);
1788 current->is32&=~(1LL<<HIREG);
1789 current->is32&=~(1LL<<LOREG);
1790 dirty_reg(current,HIREG);
1791 dirty_reg(current,LOREG);
1792 minimum_free_regs[i]=HOST_REGS;
1797 // Multiply by zero is zero.
1798 // MIPS does not have a divide by zero exception.
1799 // The result is undefined, we return zero.
1800 alloc_reg(current,i,HIREG);
1801 alloc_reg(current,i,LOREG);
1802 current->is32|=1LL<<HIREG;
1803 current->is32|=1LL<<LOREG;
1804 dirty_reg(current,HIREG);
1805 dirty_reg(current,LOREG);
1810 void cop0_alloc(struct regstat *current,int i)
1812 if(opcode2[i]==0) // MFC0
1815 clear_const(current,rt1[i]);
1816 alloc_all(current,i);
1817 alloc_reg(current,i,rt1[i]);
1818 current->is32|=1LL<<rt1[i];
1819 dirty_reg(current,rt1[i]);
1822 else if(opcode2[i]==4) // MTC0
1825 clear_const(current,rs1[i]);
1826 alloc_reg(current,i,rs1[i]);
1827 alloc_all(current,i);
1830 alloc_all(current,i); // FIXME: Keep r0
1832 alloc_reg(current,i,0);
1837 // TLBR/TLBWI/TLBWR/TLBP/ERET
1838 assert(opcode2[i]==0x10);
1839 alloc_all(current,i);
1841 minimum_free_regs[i]=HOST_REGS;
1844 void cop1_alloc(struct regstat *current,int i)
1846 alloc_reg(current,i,CSREG); // Load status
1847 if(opcode2[i]<3) // MFC1/DMFC1/CFC1
1850 clear_const(current,rt1[i]);
1852 alloc_reg64(current,i,rt1[i]); // DMFC1
1853 current->is32&=~(1LL<<rt1[i]);
1855 alloc_reg(current,i,rt1[i]); // MFC1/CFC1
1856 current->is32|=1LL<<rt1[i];
1858 dirty_reg(current,rt1[i]);
1860 alloc_reg_temp(current,i,-1);
1862 else if(opcode2[i]>3) // MTC1/DMTC1/CTC1
1865 clear_const(current,rs1[i]);
1867 alloc_reg64(current,i,rs1[i]); // DMTC1
1869 alloc_reg(current,i,rs1[i]); // MTC1/CTC1
1870 alloc_reg_temp(current,i,-1);
1874 alloc_reg(current,i,0);
1875 alloc_reg_temp(current,i,-1);
1878 minimum_free_regs[i]=1;
1880 void fconv_alloc(struct regstat *current,int i)
1882 alloc_reg(current,i,CSREG); // Load status
1883 alloc_reg_temp(current,i,-1);
1884 minimum_free_regs[i]=1;
1886 void float_alloc(struct regstat *current,int i)
1888 alloc_reg(current,i,CSREG); // Load status
1889 alloc_reg_temp(current,i,-1);
1890 minimum_free_regs[i]=1;
1892 void c2op_alloc(struct regstat *current,int i)
1894 alloc_reg_temp(current,i,-1);
1896 void fcomp_alloc(struct regstat *current,int i)
1898 alloc_reg(current,i,CSREG); // Load status
1899 alloc_reg(current,i,FSREG); // Load flags
1900 dirty_reg(current,FSREG); // Flag will be modified
1901 alloc_reg_temp(current,i,-1);
1902 minimum_free_regs[i]=1;
1905 void syscall_alloc(struct regstat *current,int i)
1907 alloc_cc(current,i);
1908 dirty_reg(current,CCREG);
1909 alloc_all(current,i);
1910 minimum_free_regs[i]=HOST_REGS;
1914 void delayslot_alloc(struct regstat *current,int i)
1925 assem_debug("jump in the delay slot. this shouldn't happen.\n");//exit(1);
1926 SysPrintf("Disabled speculative precompilation\n");
1930 imm16_alloc(current,i);
1934 load_alloc(current,i);
1938 store_alloc(current,i);
1941 alu_alloc(current,i);
1944 shift_alloc(current,i);
1947 multdiv_alloc(current,i);
1950 shiftimm_alloc(current,i);
1953 mov_alloc(current,i);
1956 cop0_alloc(current,i);
1960 cop1_alloc(current,i);
1963 c1ls_alloc(current,i);
1966 c2ls_alloc(current,i);
1969 fconv_alloc(current,i);
1972 float_alloc(current,i);
1975 fcomp_alloc(current,i);
1978 c2op_alloc(current,i);
1983 // Special case where a branch and delay slot span two pages in virtual memory
1984 static void pagespan_alloc(struct regstat *current,int i)
1987 current->wasconst=0;
1989 minimum_free_regs[i]=HOST_REGS;
1990 alloc_all(current,i);
1991 alloc_cc(current,i);
1992 dirty_reg(current,CCREG);
1993 if(opcode[i]==3) // JAL
1995 alloc_reg(current,i,31);
1996 dirty_reg(current,31);
1998 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
2000 alloc_reg(current,i,rs1[i]);
2002 alloc_reg(current,i,rt1[i]);
2003 dirty_reg(current,rt1[i]);
2006 if((opcode[i]&0x2E)==4) // BEQ/BNE/BEQL/BNEL
2008 if(rs1[i]) alloc_reg(current,i,rs1[i]);
2009 if(rs2[i]) alloc_reg(current,i,rs2[i]);
2010 if(!((current->is32>>rs1[i])&(current->is32>>rs2[i])&1))
2012 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
2013 if(rs2[i]) alloc_reg64(current,i,rs2[i]);
2017 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ/BLEZL/BGTZL
2019 if(rs1[i]) alloc_reg(current,i,rs1[i]);
2020 if(!((current->is32>>rs1[i])&1))
2022 if(rs1[i]) alloc_reg64(current,i,rs1[i]);
2026 if(opcode[i]==0x11) // BC1
2028 alloc_reg(current,i,FSREG);
2029 alloc_reg(current,i,CSREG);
2034 add_stub(int type,int addr,int retaddr,int a,int b,int c,int d,int e)
2036 stubs[stubcount][0]=type;
2037 stubs[stubcount][1]=addr;
2038 stubs[stubcount][2]=retaddr;
2039 stubs[stubcount][3]=a;
2040 stubs[stubcount][4]=b;
2041 stubs[stubcount][5]=c;
2042 stubs[stubcount][6]=d;
2043 stubs[stubcount][7]=e;
2047 // Write out a single register
2048 void wb_register(signed char r,signed char regmap[],uint64_t dirty,uint64_t is32)
2051 for(hr=0;hr<HOST_REGS;hr++) {
2052 if(hr!=EXCLUDE_REG) {
2053 if((regmap[hr]&63)==r) {
2056 emit_storereg(r,hr);
2058 if((is32>>regmap[hr])&1) {
2059 emit_sarimm(hr,31,hr);
2060 emit_storereg(r|64,hr);
2064 emit_storereg(r|64,hr);
2074 //if(!tracedebug) return 0;
2077 for(i=0;i<2097152;i++) {
2078 unsigned int temp=sum;
2081 sum^=((u_int *)rdram)[i];
2090 sum^=((u_int *)reg)[i];
2098 printf("r%d:%8x%8x ",i,((int *)(reg+i))[1],((int *)(reg+i))[0]);
2100 #ifndef DISABLE_COP1
2103 printf("f%d:%8x%8x ",i,((int*)reg_cop1_simple[i])[1],*((int*)reg_cop1_simple[i]));
2113 void memdebug(int i)
2115 //printf("TRACE: count=%d next=%d (checksum %x) lo=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[LOREG]>>32),(int)reg[LOREG]);
2116 //printf("TRACE: count=%d next=%d (rchecksum %x)\n",Count,next_interupt,rchecksum());
2119 //if(Count>=-2084597794) {
2120 if((signed int)Count>=-2084597794&&(signed int)Count<0) {
2122 printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
2123 //printf("TRACE: count=%d next=%d (checksum %x) Status=%x\n",Count,next_interupt,mchecksum(),Status);
2124 //printf("TRACE: count=%d next=%d (checksum %x) hi=%8x%8x\n",Count,next_interupt,mchecksum(),(int)(reg[HIREG]>>32),(int)reg[HIREG]);
2127 printf("TRACE: %x\n",(&i)[-1]);
2131 printf("TRACE: %x \n",(&j)[10]);
2132 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]);
2136 //printf("TRACE: %x\n",(&i)[-1]);
2139 void tlb_debug(u_int cause, u_int addr, u_int iaddr)
2141 printf("TLB Exception: instruction=%x addr=%x cause=%x\n",iaddr, addr, cause);
2144 void alu_assemble(int i,struct regstat *i_regs)
2146 if(opcode2[i]>=0x20&&opcode2[i]<=0x23) { // ADD/ADDU/SUB/SUBU
2148 signed char s1,s2,t;
2149 t=get_reg(i_regs->regmap,rt1[i]);
2151 s1=get_reg(i_regs->regmap,rs1[i]);
2152 s2=get_reg(i_regs->regmap,rs2[i]);
2153 if(rs1[i]&&rs2[i]) {
2156 if(opcode2[i]&2) emit_sub(s1,s2,t);
2157 else emit_add(s1,s2,t);
2160 if(s1>=0) emit_mov(s1,t);
2161 else emit_loadreg(rs1[i],t);
2165 if(opcode2[i]&2) emit_neg(s2,t);
2166 else emit_mov(s2,t);
2169 emit_loadreg(rs2[i],t);
2170 if(opcode2[i]&2) emit_neg(t,t);
2173 else emit_zeroreg(t);
2177 if(opcode2[i]>=0x2c&&opcode2[i]<=0x2f) { // DADD/DADDU/DSUB/DSUBU
2179 signed char s1l,s2l,s1h,s2h,tl,th;
2180 tl=get_reg(i_regs->regmap,rt1[i]);
2181 th=get_reg(i_regs->regmap,rt1[i]|64);
2183 s1l=get_reg(i_regs->regmap,rs1[i]);
2184 s2l=get_reg(i_regs->regmap,rs2[i]);
2185 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2186 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2187 if(rs1[i]&&rs2[i]) {
2190 if(opcode2[i]&2) emit_subs(s1l,s2l,tl);
2191 else emit_adds(s1l,s2l,tl);
2193 #ifdef INVERTED_CARRY
2194 if(opcode2[i]&2) {if(s1h!=th) emit_mov(s1h,th);emit_sbb(th,s2h);}
2196 if(opcode2[i]&2) emit_sbc(s1h,s2h,th);
2198 else emit_add(s1h,s2h,th);
2202 if(s1l>=0) emit_mov(s1l,tl);
2203 else emit_loadreg(rs1[i],tl);
2205 if(s1h>=0) emit_mov(s1h,th);
2206 else emit_loadreg(rs1[i]|64,th);
2211 if(opcode2[i]&2) emit_negs(s2l,tl);
2212 else emit_mov(s2l,tl);
2215 emit_loadreg(rs2[i],tl);
2216 if(opcode2[i]&2) emit_negs(tl,tl);
2219 #ifdef INVERTED_CARRY
2220 if(s2h>=0) emit_mov(s2h,th);
2221 else emit_loadreg(rs2[i]|64,th);
2223 emit_adcimm(-1,th); // x86 has inverted carry flag
2228 if(s2h>=0) emit_rscimm(s2h,0,th);
2230 emit_loadreg(rs2[i]|64,th);
2231 emit_rscimm(th,0,th);
2234 if(s2h>=0) emit_mov(s2h,th);
2235 else emit_loadreg(rs2[i]|64,th);
2242 if(th>=0) emit_zeroreg(th);
2247 if(opcode2[i]==0x2a||opcode2[i]==0x2b) { // SLT/SLTU
2249 signed char s1l,s1h,s2l,s2h,t;
2250 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1))
2252 t=get_reg(i_regs->regmap,rt1[i]);
2255 s1l=get_reg(i_regs->regmap,rs1[i]);
2256 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2257 s2l=get_reg(i_regs->regmap,rs2[i]);
2258 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2259 if(rs2[i]==0) // rx<r0
2262 if(opcode2[i]==0x2a) // SLT
2263 emit_shrimm(s1h,31,t);
2264 else // SLTU (unsigned can not be less than zero)
2267 else if(rs1[i]==0) // r0<rx
2270 if(opcode2[i]==0x2a) // SLT
2271 emit_set_gz64_32(s2h,s2l,t);
2272 else // SLTU (set if not zero)
2273 emit_set_nz64_32(s2h,s2l,t);
2276 assert(s1l>=0);assert(s1h>=0);
2277 assert(s2l>=0);assert(s2h>=0);
2278 if(opcode2[i]==0x2a) // SLT
2279 emit_set_if_less64_32(s1h,s1l,s2h,s2l,t);
2281 emit_set_if_carry64_32(s1h,s1l,s2h,s2l,t);
2285 t=get_reg(i_regs->regmap,rt1[i]);
2288 s1l=get_reg(i_regs->regmap,rs1[i]);
2289 s2l=get_reg(i_regs->regmap,rs2[i]);
2290 if(rs2[i]==0) // rx<r0
2293 if(opcode2[i]==0x2a) // SLT
2294 emit_shrimm(s1l,31,t);
2295 else // SLTU (unsigned can not be less than zero)
2298 else if(rs1[i]==0) // r0<rx
2301 if(opcode2[i]==0x2a) // SLT
2302 emit_set_gz32(s2l,t);
2303 else // SLTU (set if not zero)
2304 emit_set_nz32(s2l,t);
2307 assert(s1l>=0);assert(s2l>=0);
2308 if(opcode2[i]==0x2a) // SLT
2309 emit_set_if_less32(s1l,s2l,t);
2311 emit_set_if_carry32(s1l,s2l,t);
2317 if(opcode2[i]>=0x24&&opcode2[i]<=0x27) { // AND/OR/XOR/NOR
2319 signed char s1l,s1h,s2l,s2h,th,tl;
2320 tl=get_reg(i_regs->regmap,rt1[i]);
2321 th=get_reg(i_regs->regmap,rt1[i]|64);
2322 if(!((i_regs->was32>>rs1[i])&(i_regs->was32>>rs2[i])&1)&&th>=0)
2326 s1l=get_reg(i_regs->regmap,rs1[i]);
2327 s1h=get_reg(i_regs->regmap,rs1[i]|64);
2328 s2l=get_reg(i_regs->regmap,rs2[i]);
2329 s2h=get_reg(i_regs->regmap,rs2[i]|64);
2330 if(rs1[i]&&rs2[i]) {
2331 assert(s1l>=0);assert(s1h>=0);
2332 assert(s2l>=0);assert(s2h>=0);
2333 if(opcode2[i]==0x24) { // AND
2334 emit_and(s1l,s2l,tl);
2335 emit_and(s1h,s2h,th);
2337 if(opcode2[i]==0x25) { // OR
2338 emit_or(s1l,s2l,tl);
2339 emit_or(s1h,s2h,th);
2341 if(opcode2[i]==0x26) { // XOR
2342 emit_xor(s1l,s2l,tl);
2343 emit_xor(s1h,s2h,th);
2345 if(opcode2[i]==0x27) { // NOR
2346 emit_or(s1l,s2l,tl);
2347 emit_or(s1h,s2h,th);
2354 if(opcode2[i]==0x24) { // AND
2358 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2360 if(s1l>=0) emit_mov(s1l,tl);
2361 else emit_loadreg(rs1[i],tl);
2362 if(s1h>=0) emit_mov(s1h,th);
2363 else emit_loadreg(rs1[i]|64,th);
2367 if(s2l>=0) emit_mov(s2l,tl);
2368 else emit_loadreg(rs2[i],tl);
2369 if(s2h>=0) emit_mov(s2h,th);
2370 else emit_loadreg(rs2[i]|64,th);
2377 if(opcode2[i]==0x27) { // NOR
2379 if(s1l>=0) emit_not(s1l,tl);
2381 emit_loadreg(rs1[i],tl);
2384 if(s1h>=0) emit_not(s1h,th);
2386 emit_loadreg(rs1[i]|64,th);
2392 if(s2l>=0) emit_not(s2l,tl);
2394 emit_loadreg(rs2[i],tl);
2397 if(s2h>=0) emit_not(s2h,th);
2399 emit_loadreg(rs2[i]|64,th);
2415 s1l=get_reg(i_regs->regmap,rs1[i]);
2416 s2l=get_reg(i_regs->regmap,rs2[i]);
2417 if(rs1[i]&&rs2[i]) {
2420 if(opcode2[i]==0x24) { // AND
2421 emit_and(s1l,s2l,tl);
2423 if(opcode2[i]==0x25) { // OR
2424 emit_or(s1l,s2l,tl);
2426 if(opcode2[i]==0x26) { // XOR
2427 emit_xor(s1l,s2l,tl);
2429 if(opcode2[i]==0x27) { // NOR
2430 emit_or(s1l,s2l,tl);
2436 if(opcode2[i]==0x24) { // AND
2439 if(opcode2[i]==0x25||opcode2[i]==0x26) { // OR/XOR
2441 if(s1l>=0) emit_mov(s1l,tl);
2442 else emit_loadreg(rs1[i],tl); // CHECK: regmap_entry?
2446 if(s2l>=0) emit_mov(s2l,tl);
2447 else emit_loadreg(rs2[i],tl); // CHECK: regmap_entry?
2449 else emit_zeroreg(tl);
2451 if(opcode2[i]==0x27) { // NOR
2453 if(s1l>=0) emit_not(s1l,tl);
2455 emit_loadreg(rs1[i],tl);
2461 if(s2l>=0) emit_not(s2l,tl);
2463 emit_loadreg(rs2[i],tl);
2467 else emit_movimm(-1,tl);
2476 void imm16_assemble(int i,struct regstat *i_regs)
2478 if (opcode[i]==0x0f) { // LUI
2481 t=get_reg(i_regs->regmap,rt1[i]);
2484 if(!((i_regs->isconst>>t)&1))
2485 emit_movimm(imm[i]<<16,t);
2489 if(opcode[i]==0x08||opcode[i]==0x09) { // ADDI/ADDIU
2492 t=get_reg(i_regs->regmap,rt1[i]);
2493 s=get_reg(i_regs->regmap,rs1[i]);
2498 if(!((i_regs->isconst>>t)&1)) {
2500 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2501 emit_addimm(t,imm[i],t);
2503 if(!((i_regs->wasconst>>s)&1))
2504 emit_addimm(s,imm[i],t);
2506 emit_movimm(constmap[i][s]+imm[i],t);
2512 if(!((i_regs->isconst>>t)&1))
2513 emit_movimm(imm[i],t);
2518 if(opcode[i]==0x18||opcode[i]==0x19) { // DADDI/DADDIU
2520 signed char sh,sl,th,tl;
2521 th=get_reg(i_regs->regmap,rt1[i]|64);
2522 tl=get_reg(i_regs->regmap,rt1[i]);
2523 sh=get_reg(i_regs->regmap,rs1[i]|64);
2524 sl=get_reg(i_regs->regmap,rs1[i]);
2530 emit_addimm64_32(sh,sl,imm[i],th,tl);
2533 emit_addimm(sl,imm[i],tl);
2536 emit_movimm(imm[i],tl);
2537 if(th>=0) emit_movimm(((signed int)imm[i])>>31,th);
2542 else if(opcode[i]==0x0a||opcode[i]==0x0b) { // SLTI/SLTIU
2544 //assert(rs1[i]!=0); // r0 might be valid, but it's probably a bug
2545 signed char sh,sl,t;
2546 t=get_reg(i_regs->regmap,rt1[i]);
2547 sh=get_reg(i_regs->regmap,rs1[i]|64);
2548 sl=get_reg(i_regs->regmap,rs1[i]);
2552 if(sh<0) assert((i_regs->was32>>rs1[i])&1);
2553 if(sh<0||((i_regs->was32>>rs1[i])&1)) {
2554 if(opcode[i]==0x0a) { // SLTI
2556 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2557 emit_slti32(t,imm[i],t);
2559 emit_slti32(sl,imm[i],t);
2564 if(i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2565 emit_sltiu32(t,imm[i],t);
2567 emit_sltiu32(sl,imm[i],t);
2572 if(opcode[i]==0x0a) // SLTI
2573 emit_slti64_32(sh,sl,imm[i],t);
2575 emit_sltiu64_32(sh,sl,imm[i],t);
2578 // SLTI(U) with r0 is just stupid,
2579 // nonetheless examples can be found
2580 if(opcode[i]==0x0a) // SLTI
2581 if(0<imm[i]) emit_movimm(1,t);
2582 else emit_zeroreg(t);
2585 if(imm[i]) emit_movimm(1,t);
2586 else emit_zeroreg(t);
2592 else if(opcode[i]>=0x0c&&opcode[i]<=0x0e) { // ANDI/ORI/XORI
2594 signed char sh,sl,th,tl;
2595 th=get_reg(i_regs->regmap,rt1[i]|64);
2596 tl=get_reg(i_regs->regmap,rt1[i]);
2597 sh=get_reg(i_regs->regmap,rs1[i]|64);
2598 sl=get_reg(i_regs->regmap,rs1[i]);
2599 if(tl>=0 && !((i_regs->isconst>>tl)&1)) {
2600 if(opcode[i]==0x0c) //ANDI
2604 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2605 emit_andimm(tl,imm[i],tl);
2607 if(!((i_regs->wasconst>>sl)&1))
2608 emit_andimm(sl,imm[i],tl);
2610 emit_movimm(constmap[i][sl]&imm[i],tl);
2615 if(th>=0) emit_zeroreg(th);
2621 if(i_regs->regmap_entry[tl]!=rs1[i]) emit_loadreg(rs1[i],tl);
2625 emit_loadreg(rs1[i]|64,th);
2630 if(opcode[i]==0x0d) //ORI
2632 emit_orimm(tl,imm[i],tl);
2634 if(!((i_regs->wasconst>>sl)&1))
2635 emit_orimm(sl,imm[i],tl);
2637 emit_movimm(constmap[i][sl]|imm[i],tl);
2639 if(opcode[i]==0x0e) //XORI
2641 emit_xorimm(tl,imm[i],tl);
2643 if(!((i_regs->wasconst>>sl)&1))
2644 emit_xorimm(sl,imm[i],tl);
2646 emit_movimm(constmap[i][sl]^imm[i],tl);
2650 emit_movimm(imm[i],tl);
2651 if(th>=0) emit_zeroreg(th);
2659 void shiftimm_assemble(int i,struct regstat *i_regs)
2661 if(opcode2[i]<=0x3) // SLL/SRL/SRA
2665 t=get_reg(i_regs->regmap,rt1[i]);
2666 s=get_reg(i_regs->regmap,rs1[i]);
2668 if(t>=0&&!((i_regs->isconst>>t)&1)){
2675 if(s<0&&i_regs->regmap_entry[t]!=rs1[i]) emit_loadreg(rs1[i],t);
2677 if(opcode2[i]==0) // SLL
2679 emit_shlimm(s<0?t:s,imm[i],t);
2681 if(opcode2[i]==2) // SRL
2683 emit_shrimm(s<0?t:s,imm[i],t);
2685 if(opcode2[i]==3) // SRA
2687 emit_sarimm(s<0?t:s,imm[i],t);
2691 if(s>=0 && s!=t) emit_mov(s,t);
2695 //emit_storereg(rt1[i],t); //DEBUG
2698 if(opcode2[i]>=0x38&&opcode2[i]<=0x3b) // DSLL/DSRL/DSRA
2701 signed char sh,sl,th,tl;
2702 th=get_reg(i_regs->regmap,rt1[i]|64);
2703 tl=get_reg(i_regs->regmap,rt1[i]);
2704 sh=get_reg(i_regs->regmap,rs1[i]|64);
2705 sl=get_reg(i_regs->regmap,rs1[i]);
2710 if(th>=0) emit_zeroreg(th);
2717 if(opcode2[i]==0x38) // DSLL
2719 if(th>=0) emit_shldimm(sh,sl,imm[i],th);
2720 emit_shlimm(sl,imm[i],tl);
2722 if(opcode2[i]==0x3a) // DSRL
2724 emit_shrdimm(sl,sh,imm[i],tl);
2725 if(th>=0) emit_shrimm(sh,imm[i],th);
2727 if(opcode2[i]==0x3b) // DSRA
2729 emit_shrdimm(sl,sh,imm[i],tl);
2730 if(th>=0) emit_sarimm(sh,imm[i],th);
2734 if(sl!=tl) emit_mov(sl,tl);
2735 if(th>=0&&sh!=th) emit_mov(sh,th);
2741 if(opcode2[i]==0x3c) // DSLL32
2744 signed char sl,tl,th;
2745 tl=get_reg(i_regs->regmap,rt1[i]);
2746 th=get_reg(i_regs->regmap,rt1[i]|64);
2747 sl=get_reg(i_regs->regmap,rs1[i]);
2756 emit_shlimm(th,imm[i]&31,th);
2761 if(opcode2[i]==0x3e) // DSRL32
2764 signed char sh,tl,th;
2765 tl=get_reg(i_regs->regmap,rt1[i]);
2766 th=get_reg(i_regs->regmap,rt1[i]|64);
2767 sh=get_reg(i_regs->regmap,rs1[i]|64);
2771 if(th>=0) emit_zeroreg(th);
2774 emit_shrimm(tl,imm[i]&31,tl);
2779 if(opcode2[i]==0x3f) // DSRA32
2783 tl=get_reg(i_regs->regmap,rt1[i]);
2784 sh=get_reg(i_regs->regmap,rs1[i]|64);
2790 emit_sarimm(tl,imm[i]&31,tl);
2797 #ifndef shift_assemble
2798 void shift_assemble(int i,struct regstat *i_regs)
2800 printf("Need shift_assemble for this architecture.\n");
2805 void load_assemble(int i,struct regstat *i_regs)
2807 int s,th,tl,addr,map=-1;
2810 int memtarget=0,c=0;
2811 int fastload_reg_override=0;
2813 th=get_reg(i_regs->regmap,rt1[i]|64);
2814 tl=get_reg(i_regs->regmap,rt1[i]);
2815 s=get_reg(i_regs->regmap,rs1[i]);
2817 for(hr=0;hr<HOST_REGS;hr++) {
2818 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
2820 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
2822 c=(i_regs->wasconst>>s)&1;
2824 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
2825 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
2828 //printf("load_assemble: c=%d\n",c);
2829 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2830 // FIXME: Even if the load is a NOP, we should check for pagefaults...
2832 if(tl<0&&(!c||(((u_int)constmap[i][s]+offset)>>16)==0x1f80)
2834 // could be FIFO, must perform the read
2836 assem_debug("(forced read)\n");
2837 tl=get_reg(i_regs->regmap,-1);
2841 if(offset||s<0||c) addr=tl;
2843 //if(tl<0) tl=get_reg(i_regs->regmap,-1);
2845 //printf("load_assemble: c=%d\n",c);
2846 //if(c) printf("load_assemble: const=%x\n",(int)constmap[i][s]+offset);
2847 assert(tl>=0); // Even if the load is a NOP, we must check for pagefaults and I/O
2849 if(th>=0) reglist&=~(1<<th);
2853 map=get_reg(i_regs->regmap,ROREG);
2854 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
2856 //#define R29_HACK 1
2858 // Strmnnrmn's speed hack
2859 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
2862 jaddr=emit_fastpath_cmp_jump(i,addr,&fastload_reg_override);
2865 else if(ram_offset&&memtarget) {
2866 emit_addimm(addr,ram_offset,HOST_TEMPREG);
2867 fastload_reg_override=HOST_TEMPREG;
2871 if (opcode[i]==0x20||opcode[i]==0x24) x=3; // LB/LBU
2872 if (opcode[i]==0x21||opcode[i]==0x25) x=2; // LH/LHU
2873 map=get_reg(i_regs->regmap,TLREG);
2876 map=do_tlb_r(addr,tl,map,x,-1,-1,c,constmap[i][s]+offset);
2877 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr);
2879 int dummy=(rt1[i]==0)||(tl!=get_reg(i_regs->regmap,rt1[i])); // ignore loads to r0 and unneeded reg
2880 if (opcode[i]==0x20) { // LB
2883 #ifdef HOST_IMM_ADDR32
2885 emit_movsbl_tlb((constmap[i][s]+offset)^3,map,tl);
2889 //emit_xorimm(addr,3,tl);
2890 //gen_tlb_addr_r(tl,map);
2891 //emit_movsbl_indexed((int)rdram-0x80000000,tl,tl);
2893 #ifdef BIG_ENDIAN_MIPS
2894 if(!c) emit_xorimm(addr,3,tl);
2895 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2899 if(fastload_reg_override) a=fastload_reg_override;
2901 emit_movsbl_indexed_tlb(x,a,map,tl);
2905 add_stub(LOADB_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2908 inline_readstub(LOADB_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2910 if (opcode[i]==0x21) { // LH
2913 #ifdef HOST_IMM_ADDR32
2915 emit_movswl_tlb((constmap[i][s]+offset)^2,map,tl);
2920 #ifdef BIG_ENDIAN_MIPS
2921 if(!c) emit_xorimm(addr,2,tl);
2922 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
2926 if(fastload_reg_override) a=fastload_reg_override;
2928 //emit_movswl_indexed_tlb(x,tl,map,tl);
2931 gen_tlb_addr_r(a,map);
2932 emit_movswl_indexed(x,a,tl);
2934 #if 1 //def RAM_OFFSET
2935 emit_movswl_indexed(x,a,tl);
2937 emit_movswl_indexed((int)rdram-0x80000000+x,a,tl);
2943 add_stub(LOADH_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2946 inline_readstub(LOADH_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2948 if (opcode[i]==0x23) { // LW
2952 if(fastload_reg_override) a=fastload_reg_override;
2953 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
2954 #ifdef HOST_IMM_ADDR32
2956 emit_readword_tlb(constmap[i][s]+offset,map,tl);
2959 emit_readword_indexed_tlb(0,a,map,tl);
2962 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2965 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2967 if (opcode[i]==0x24) { // LBU
2970 #ifdef HOST_IMM_ADDR32
2972 emit_movzbl_tlb((constmap[i][s]+offset)^3,map,tl);
2976 //emit_xorimm(addr,3,tl);
2977 //gen_tlb_addr_r(tl,map);
2978 //emit_movzbl_indexed((int)rdram-0x80000000,tl,tl);
2980 #ifdef BIG_ENDIAN_MIPS
2981 if(!c) emit_xorimm(addr,3,tl);
2982 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
2986 if(fastload_reg_override) a=fastload_reg_override;
2988 emit_movzbl_indexed_tlb(x,a,map,tl);
2992 add_stub(LOADBU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
2995 inline_readstub(LOADBU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
2997 if (opcode[i]==0x25) { // LHU
3000 #ifdef HOST_IMM_ADDR32
3002 emit_movzwl_tlb((constmap[i][s]+offset)^2,map,tl);
3007 #ifdef BIG_ENDIAN_MIPS
3008 if(!c) emit_xorimm(addr,2,tl);
3009 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3013 if(fastload_reg_override) a=fastload_reg_override;
3015 //emit_movzwl_indexed_tlb(x,tl,map,tl);
3018 gen_tlb_addr_r(a,map);
3019 emit_movzwl_indexed(x,a,tl);
3021 #if 1 //def RAM_OFFSET
3022 emit_movzwl_indexed(x,a,tl);
3024 emit_movzwl_indexed((int)rdram-0x80000000+x,a,tl);
3030 add_stub(LOADHU_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3033 inline_readstub(LOADHU_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3035 if (opcode[i]==0x27) { // LWU
3040 if(fastload_reg_override) a=fastload_reg_override;
3041 //emit_readword_indexed((int)rdram-0x80000000,addr,tl);
3042 #ifdef HOST_IMM_ADDR32
3044 emit_readword_tlb(constmap[i][s]+offset,map,tl);
3047 emit_readword_indexed_tlb(0,a,map,tl);
3050 add_stub(LOADW_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3053 inline_readstub(LOADW_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3057 if (opcode[i]==0x37) { // LD
3061 if(fastload_reg_override) a=fastload_reg_override;
3062 //gen_tlb_addr_r(tl,map);
3063 //if(th>=0) emit_readword_indexed((int)rdram-0x80000000,addr,th);
3064 //emit_readword_indexed((int)rdram-0x7FFFFFFC,addr,tl);
3065 #ifdef HOST_IMM_ADDR32
3067 emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3070 emit_readdword_indexed_tlb(0,a,map,th,tl);
3073 add_stub(LOADD_STUB,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3076 inline_readstub(LOADD_STUB,i,constmap[i][s]+offset,i_regs->regmap,rt1[i],ccadj[i],reglist);
3079 //emit_storereg(rt1[i],tl); // DEBUG
3080 //if(opcode[i]==0x23)
3081 //if(opcode[i]==0x24)
3082 //if(opcode[i]==0x23||opcode[i]==0x24)
3083 /*if(opcode[i]==0x21||opcode[i]==0x23||opcode[i]==0x24)
3087 emit_readword((int)&last_count,ECX);
3089 if(get_reg(i_regs->regmap,CCREG)<0)
3090 emit_loadreg(CCREG,HOST_CCREG);
3091 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3092 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3093 emit_writeword(HOST_CCREG,(int)&Count);
3096 if(get_reg(i_regs->regmap,CCREG)<0)
3097 emit_loadreg(CCREG,0);
3099 emit_mov(HOST_CCREG,0);
3101 emit_addimm(0,2*ccadj[i],0);
3102 emit_writeword(0,(int)&Count);
3104 emit_call((int)memdebug);
3106 restore_regs(0x100f);
3110 #ifndef loadlr_assemble
3111 void loadlr_assemble(int i,struct regstat *i_regs)
3113 printf("Need loadlr_assemble for this architecture.\n");
3118 void store_assemble(int i,struct regstat *i_regs)
3123 int jaddr=0,jaddr2,type;
3124 int memtarget=0,c=0;
3125 int agr=AGEN1+(i&1);
3126 int faststore_reg_override=0;
3128 th=get_reg(i_regs->regmap,rs2[i]|64);
3129 tl=get_reg(i_regs->regmap,rs2[i]);
3130 s=get_reg(i_regs->regmap,rs1[i]);
3131 temp=get_reg(i_regs->regmap,agr);
3132 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3135 c=(i_regs->wasconst>>s)&1;
3137 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3138 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3143 for(hr=0;hr<HOST_REGS;hr++) {
3144 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3146 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3147 if(offset||s<0||c) addr=temp;
3153 // Strmnnrmn's speed hack
3154 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3156 emit_cmpimm(addr,RAM_SIZE);
3157 #ifdef DESTRUCTIVE_SHIFT
3158 if(s==addr) emit_mov(s,temp);
3162 if(rs1[i]!=29||start<0x80001000||start>=0x80000000+RAM_SIZE)
3166 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
3167 // Hint to branch predictor that the branch is unlikely to be taken
3169 emit_jno_unlikely(0);
3175 jaddr=emit_fastpath_cmp_jump(i,addr,&faststore_reg_override);
3178 else if(ram_offset&&memtarget) {
3179 emit_addimm(addr,ram_offset,HOST_TEMPREG);
3180 faststore_reg_override=HOST_TEMPREG;
3184 if (opcode[i]==0x28) x=3; // SB
3185 if (opcode[i]==0x29) x=2; // SH
3186 map=get_reg(i_regs->regmap,TLREG);
3189 map=do_tlb_w(addr,temp,map,x,c,constmap[i][s]+offset);
3190 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3193 if (opcode[i]==0x28) { // SB
3196 #ifdef BIG_ENDIAN_MIPS
3197 if(!c) emit_xorimm(addr,3,temp);
3198 else x=((constmap[i][s]+offset)^3)-(constmap[i][s]+offset);
3202 if(faststore_reg_override) a=faststore_reg_override;
3203 //gen_tlb_addr_w(temp,map);
3204 //emit_writebyte_indexed(tl,(int)rdram-0x80000000,temp);
3205 emit_writebyte_indexed_tlb(tl,x,a,map,a);
3209 if (opcode[i]==0x29) { // SH
3212 #ifdef BIG_ENDIAN_MIPS
3213 if(!c) emit_xorimm(addr,2,temp);
3214 else x=((constmap[i][s]+offset)^2)-(constmap[i][s]+offset);
3218 if(faststore_reg_override) a=faststore_reg_override;
3220 //emit_writehword_indexed_tlb(tl,x,temp,map,temp);
3223 gen_tlb_addr_w(a,map);
3224 emit_writehword_indexed(tl,x,a);
3226 //emit_writehword_indexed(tl,(int)rdram-0x80000000+x,a);
3227 emit_writehword_indexed(tl,x,a);
3231 if (opcode[i]==0x2B) { // SW
3234 if(faststore_reg_override) a=faststore_reg_override;
3235 //emit_writeword_indexed(tl,(int)rdram-0x80000000,addr);
3236 emit_writeword_indexed_tlb(tl,0,a,map,temp);
3240 if (opcode[i]==0x3F) { // SD
3243 if(faststore_reg_override) a=faststore_reg_override;
3246 //emit_writeword_indexed(th,(int)rdram-0x80000000,addr);
3247 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,addr);
3248 emit_writedword_indexed_tlb(th,tl,0,a,map,temp);
3251 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3252 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3253 emit_writedword_indexed_tlb(tl,tl,0,a,map,temp);
3260 // PCSX store handlers don't check invcode again
3262 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3266 if(!using_tlb&&!(i_regs->waswritten&(1<<rs1[i]))&&!(new_dynarec_hacks&NDHACK_NO_SMC_CHECK)) {
3268 #ifdef DESTRUCTIVE_SHIFT
3269 // The x86 shift operation is 'destructive'; it overwrites the
3270 // source register, so we need to make a copy first and use that.
3273 #if defined(HOST_IMM8)
3274 int ir=get_reg(i_regs->regmap,INVCP);
3276 emit_cmpmem_indexedsr12_reg(ir,addr,1);
3278 emit_cmpmem_indexedsr12_imm((int)invalid_code,addr,1);
3280 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3281 emit_callne(invalidate_addr_reg[addr]);
3285 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),addr,0,0,0);
3289 u_int addr_val=constmap[i][s]+offset;
3291 add_stub(type,jaddr,(int)out,i,addr,(int)i_regs,ccadj[i],reglist);
3292 } else if(c&&!memtarget) {
3293 inline_writestub(type,i,addr_val,i_regs->regmap,rs2[i],ccadj[i],reglist);
3295 // basic current block modification detection..
3296 // not looking back as that should be in mips cache already
3297 if(c&&start+i*4<addr_val&&addr_val<start+slen*4) {
3298 SysPrintf("write to %08x hits block %08x, pc=%08x\n",addr_val,start,start+i*4);
3299 assert(i_regs->regmap==regs[i].regmap); // not delay slot
3300 if(i_regs->regmap==regs[i].regmap) {
3301 load_all_consts(regs[i].regmap_entry,regs[i].was32,regs[i].wasdirty,i);
3302 wb_dirtys(regs[i].regmap_entry,regs[i].was32,regs[i].wasdirty);
3303 emit_movimm(start+i*4+4,0);
3304 emit_writeword(0,(int)&pcaddr);
3305 emit_jmp((int)do_interrupt);
3308 //if(opcode[i]==0x2B || opcode[i]==0x3F)
3309 //if(opcode[i]==0x2B || opcode[i]==0x28)
3310 //if(opcode[i]==0x2B || opcode[i]==0x29)
3311 //if(opcode[i]==0x2B)
3312 /*if(opcode[i]==0x2B || opcode[i]==0x28 || opcode[i]==0x29 || opcode[i]==0x3F)
3320 emit_readword((int)&last_count,ECX);
3322 if(get_reg(i_regs->regmap,CCREG)<0)
3323 emit_loadreg(CCREG,HOST_CCREG);
3324 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3325 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3326 emit_writeword(HOST_CCREG,(int)&Count);
3329 if(get_reg(i_regs->regmap,CCREG)<0)
3330 emit_loadreg(CCREG,0);
3332 emit_mov(HOST_CCREG,0);
3334 emit_addimm(0,2*ccadj[i],0);
3335 emit_writeword(0,(int)&Count);
3337 emit_call((int)memdebug);
3342 restore_regs(0x100f);
3347 void storelr_assemble(int i,struct regstat *i_regs)
3354 int case1,case2,case3;
3355 int done0,done1,done2;
3356 int memtarget=0,c=0;
3357 int agr=AGEN1+(i&1);
3359 th=get_reg(i_regs->regmap,rs2[i]|64);
3360 tl=get_reg(i_regs->regmap,rs2[i]);
3361 s=get_reg(i_regs->regmap,rs1[i]);
3362 temp=get_reg(i_regs->regmap,agr);
3363 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3366 c=(i_regs->isconst>>s)&1;
3368 memtarget=((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE;
3369 if(using_tlb&&((signed int)(constmap[i][s]+offset))>=(signed int)0xC0000000) memtarget=1;
3373 for(hr=0;hr<HOST_REGS;hr++) {
3374 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3379 emit_cmpimm(s<0||offset?temp:s,RAM_SIZE);
3380 if(!offset&&s!=temp) emit_mov(s,temp);
3386 if(!memtarget||!rs1[i]) {
3392 int map=get_reg(i_regs->regmap,ROREG);
3393 if(map<0) emit_loadreg(ROREG,map=HOST_TEMPREG);
3394 gen_tlb_addr_w(temp,map);
3396 if((u_int)rdram!=0x80000000)
3397 emit_addimm_no_flags((u_int)rdram-(u_int)0x80000000,temp);
3400 int map=get_reg(i_regs->regmap,TLREG);
3403 map=do_tlb_w(c||s<0||offset?temp:s,temp,map,0,c,constmap[i][s]+offset);
3404 if(!c&&!offset&&s>=0) emit_mov(s,temp);
3405 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr);
3406 if(!jaddr&&!memtarget) {
3410 gen_tlb_addr_w(temp,map);
3413 if (opcode[i]==0x2C||opcode[i]==0x2D) { // SDL/SDR
3414 temp2=get_reg(i_regs->regmap,FTEMP);
3415 if(!rs2[i]) temp2=th=tl;
3418 #ifndef BIG_ENDIAN_MIPS
3419 emit_xorimm(temp,3,temp);
3421 emit_testimm(temp,2);
3424 emit_testimm(temp,1);
3428 if (opcode[i]==0x2A) { // SWL
3429 emit_writeword_indexed(tl,0,temp);
3431 if (opcode[i]==0x2E) { // SWR
3432 emit_writebyte_indexed(tl,3,temp);
3434 if (opcode[i]==0x2C) { // SDL
3435 emit_writeword_indexed(th,0,temp);
3436 if(rs2[i]) emit_mov(tl,temp2);
3438 if (opcode[i]==0x2D) { // SDR
3439 emit_writebyte_indexed(tl,3,temp);
3440 if(rs2[i]) emit_shldimm(th,tl,24,temp2);
3445 set_jump_target(case1,(int)out);
3446 if (opcode[i]==0x2A) { // SWL
3447 // Write 3 msb into three least significant bytes
3448 if(rs2[i]) emit_rorimm(tl,8,tl);
3449 emit_writehword_indexed(tl,-1,temp);
3450 if(rs2[i]) emit_rorimm(tl,16,tl);
3451 emit_writebyte_indexed(tl,1,temp);
3452 if(rs2[i]) emit_rorimm(tl,8,tl);
3454 if (opcode[i]==0x2E) { // SWR
3455 // Write two lsb into two most significant bytes
3456 emit_writehword_indexed(tl,1,temp);
3458 if (opcode[i]==0x2C) { // SDL
3459 if(rs2[i]) emit_shrdimm(tl,th,8,temp2);
3460 // Write 3 msb into three least significant bytes
3461 if(rs2[i]) emit_rorimm(th,8,th);
3462 emit_writehword_indexed(th,-1,temp);
3463 if(rs2[i]) emit_rorimm(th,16,th);
3464 emit_writebyte_indexed(th,1,temp);
3465 if(rs2[i]) emit_rorimm(th,8,th);
3467 if (opcode[i]==0x2D) { // SDR
3468 if(rs2[i]) emit_shldimm(th,tl,16,temp2);
3469 // Write two lsb into two most significant bytes
3470 emit_writehword_indexed(tl,1,temp);
3475 set_jump_target(case2,(int)out);
3476 emit_testimm(temp,1);
3479 if (opcode[i]==0x2A) { // SWL
3480 // Write two msb into two least significant bytes
3481 if(rs2[i]) emit_rorimm(tl,16,tl);
3482 emit_writehword_indexed(tl,-2,temp);
3483 if(rs2[i]) emit_rorimm(tl,16,tl);
3485 if (opcode[i]==0x2E) { // SWR
3486 // Write 3 lsb into three most significant bytes
3487 emit_writebyte_indexed(tl,-1,temp);
3488 if(rs2[i]) emit_rorimm(tl,8,tl);
3489 emit_writehword_indexed(tl,0,temp);
3490 if(rs2[i]) emit_rorimm(tl,24,tl);
3492 if (opcode[i]==0x2C) { // SDL
3493 if(rs2[i]) emit_shrdimm(tl,th,16,temp2);
3494 // Write two msb into two least significant bytes
3495 if(rs2[i]) emit_rorimm(th,16,th);
3496 emit_writehword_indexed(th,-2,temp);
3497 if(rs2[i]) emit_rorimm(th,16,th);
3499 if (opcode[i]==0x2D) { // SDR
3500 if(rs2[i]) emit_shldimm(th,tl,8,temp2);
3501 // Write 3 lsb into three most significant bytes
3502 emit_writebyte_indexed(tl,-1,temp);
3503 if(rs2[i]) emit_rorimm(tl,8,tl);
3504 emit_writehword_indexed(tl,0,temp);
3505 if(rs2[i]) emit_rorimm(tl,24,tl);
3510 set_jump_target(case3,(int)out);
3511 if (opcode[i]==0x2A) { // SWL
3512 // Write msb into least significant byte
3513 if(rs2[i]) emit_rorimm(tl,24,tl);
3514 emit_writebyte_indexed(tl,-3,temp);
3515 if(rs2[i]) emit_rorimm(tl,8,tl);
3517 if (opcode[i]==0x2E) { // SWR
3518 // Write entire word
3519 emit_writeword_indexed(tl,-3,temp);
3521 if (opcode[i]==0x2C) { // SDL
3522 if(rs2[i]) emit_shrdimm(tl,th,24,temp2);
3523 // Write msb into least significant byte
3524 if(rs2[i]) emit_rorimm(th,24,th);
3525 emit_writebyte_indexed(th,-3,temp);
3526 if(rs2[i]) emit_rorimm(th,8,th);
3528 if (opcode[i]==0x2D) { // SDR
3529 if(rs2[i]) emit_mov(th,temp2);
3530 // Write entire word
3531 emit_writeword_indexed(tl,-3,temp);
3533 set_jump_target(done0,(int)out);
3534 set_jump_target(done1,(int)out);
3535 set_jump_target(done2,(int)out);
3536 if (opcode[i]==0x2C) { // SDL
3537 emit_testimm(temp,4);
3540 emit_andimm(temp,~3,temp);
3541 emit_writeword_indexed(temp2,4,temp);
3542 set_jump_target(done0,(int)out);
3544 if (opcode[i]==0x2D) { // SDR
3545 emit_testimm(temp,4);
3548 emit_andimm(temp,~3,temp);
3549 emit_writeword_indexed(temp2,-4,temp);
3550 set_jump_target(done0,(int)out);
3553 add_stub(STORELR_STUB,jaddr,(int)out,i,(int)i_regs,temp,ccadj[i],reglist);
3554 if(!using_tlb&&!(i_regs->waswritten&(1<<rs1[i]))&&!(new_dynarec_hacks&NDHACK_NO_SMC_CHECK)) {
3556 int map=get_reg(i_regs->regmap,ROREG);
3557 if(map<0) map=HOST_TEMPREG;
3558 gen_orig_addr_w(temp,map);
3560 emit_addimm_no_flags((u_int)0x80000000-(u_int)rdram,temp);
3562 #if defined(HOST_IMM8)
3563 int ir=get_reg(i_regs->regmap,INVCP);
3565 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3567 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3569 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3570 emit_callne(invalidate_addr_reg[temp]);
3574 add_stub(INVCODE_STUB,jaddr2,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3579 //save_regs(0x100f);
3580 emit_readword((int)&last_count,ECX);
3581 if(get_reg(i_regs->regmap,CCREG)<0)
3582 emit_loadreg(CCREG,HOST_CCREG);
3583 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3584 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3585 emit_writeword(HOST_CCREG,(int)&Count);
3586 emit_call((int)memdebug);
3588 //restore_regs(0x100f);
3592 void c1ls_assemble(int i,struct regstat *i_regs)
3594 #ifndef DISABLE_COP1
3600 int jaddr,jaddr2=0,jaddr3,type;
3601 int agr=AGEN1+(i&1);
3603 th=get_reg(i_regs->regmap,FTEMP|64);
3604 tl=get_reg(i_regs->regmap,FTEMP);
3605 s=get_reg(i_regs->regmap,rs1[i]);
3606 temp=get_reg(i_regs->regmap,agr);
3607 if(temp<0) temp=get_reg(i_regs->regmap,-1);
3612 for(hr=0;hr<HOST_REGS;hr++) {
3613 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3615 if(i_regs->regmap[HOST_CCREG]==CCREG) reglist&=~(1<<HOST_CCREG);
3616 if (opcode[i]==0x31||opcode[i]==0x35) // LWC1/LDC1
3618 // Loads use a temporary register which we need to save
3621 if (opcode[i]==0x39||opcode[i]==0x3D) // SWC1/SDC1
3625 //if(s<0) emit_loadreg(rs1[i],ar); //address_generation does this now
3626 //else c=(i_regs->wasconst>>s)&1;
3627 if(s>=0) c=(i_regs->wasconst>>s)&1;
3628 // Check cop1 unusable
3630 signed char rs=get_reg(i_regs->regmap,CSREG);
3632 emit_testimm(rs,0x20000000);
3635 add_stub(FP_STUB,jaddr,(int)out,i,rs,(int)i_regs,is_delayslot,0);
3638 if (opcode[i]==0x39) { // SWC1 (get float address)
3639 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],tl);
3641 if (opcode[i]==0x3D) { // SDC1 (get double address)
3642 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],tl);
3644 // Generate address + offset
3647 emit_cmpimm(offset||c||s<0?ar:s,RAM_SIZE);
3651 map=get_reg(i_regs->regmap,TLREG);
3654 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3655 map=do_tlb_r(offset||c||s<0?ar:s,ar,map,0,-1,-1,c,constmap[i][s]+offset);
3657 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3658 map=do_tlb_w(offset||c||s<0?ar:s,ar,map,0,c,constmap[i][s]+offset);
3661 if (opcode[i]==0x39) { // SWC1 (read float)
3662 emit_readword_indexed(0,tl,tl);
3664 if (opcode[i]==0x3D) { // SDC1 (read double)
3665 emit_readword_indexed(4,tl,th);
3666 emit_readword_indexed(0,tl,tl);
3668 if (opcode[i]==0x31) { // LWC1 (get target address)
3669 emit_readword((int)®_cop1_simple[(source[i]>>16)&0x1f],temp);
3671 if (opcode[i]==0x35) { // LDC1 (get target address)
3672 emit_readword((int)®_cop1_double[(source[i]>>16)&0x1f],temp);
3679 else if(((signed int)(constmap[i][s]+offset))>=(signed int)0x80000000+RAM_SIZE) {
3681 emit_jmp(0); // inline_readstub/inline_writestub? Very rare case
3683 #ifdef DESTRUCTIVE_SHIFT
3684 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3685 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3689 if (opcode[i]==0x31||opcode[i]==0x35) { // LWC1/LDC1
3690 do_tlb_r_branch(map,c,constmap[i][s]+offset,&jaddr2);
3692 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3693 do_tlb_w_branch(map,c,constmap[i][s]+offset,&jaddr2);
3696 if (opcode[i]==0x31) { // LWC1
3697 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3698 //gen_tlb_addr_r(ar,map);
3699 //emit_readword_indexed((int)rdram-0x80000000,tl,tl);
3700 #ifdef HOST_IMM_ADDR32
3701 if(c) emit_readword_tlb(constmap[i][s]+offset,map,tl);
3704 emit_readword_indexed_tlb(0,offset||c||s<0?tl:s,map,tl);
3707 if (opcode[i]==0x35) { // LDC1
3709 //if(s>=0&&!c&&!offset) emit_mov(s,tl);
3710 //gen_tlb_addr_r(ar,map);
3711 //emit_readword_indexed((int)rdram-0x80000000,tl,th);
3712 //emit_readword_indexed((int)rdram-0x7FFFFFFC,tl,tl);
3713 #ifdef HOST_IMM_ADDR32
3714 if(c) emit_readdword_tlb(constmap[i][s]+offset,map,th,tl);
3717 emit_readdword_indexed_tlb(0,offset||c||s<0?tl:s,map,th,tl);
3720 if (opcode[i]==0x39) { // SWC1
3721 //emit_writeword_indexed(tl,(int)rdram-0x80000000,temp);
3722 emit_writeword_indexed_tlb(tl,0,offset||c||s<0?temp:s,map,temp);
3725 if (opcode[i]==0x3D) { // SDC1
3727 //emit_writeword_indexed(th,(int)rdram-0x80000000,temp);
3728 //emit_writeword_indexed(tl,(int)rdram-0x7FFFFFFC,temp);
3729 emit_writedword_indexed_tlb(th,tl,0,offset||c||s<0?temp:s,map,temp);
3732 if(!using_tlb&&!(i_regs->waswritten&(1<<rs1[i]))&&!(new_dynarec_hacks&NDHACK_NO_SMC_CHECK)) {
3733 if (opcode[i]==0x39||opcode[i]==0x3D) { // SWC1/SDC1
3734 #ifndef DESTRUCTIVE_SHIFT
3735 temp=offset||c||s<0?ar:s;
3737 #if defined(HOST_IMM8)
3738 int ir=get_reg(i_regs->regmap,INVCP);
3740 emit_cmpmem_indexedsr12_reg(ir,temp,1);
3742 emit_cmpmem_indexedsr12_imm((int)invalid_code,temp,1);
3744 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3745 emit_callne(invalidate_addr_reg[temp]);
3749 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),temp,0,0,0);
3753 if(jaddr2) add_stub(type,jaddr2,(int)out,i,offset||c||s<0?ar:s,(int)i_regs,ccadj[i],reglist);
3754 if (opcode[i]==0x31) { // LWC1 (write float)
3755 emit_writeword_indexed(tl,0,temp);
3757 if (opcode[i]==0x35) { // LDC1 (write double)
3758 emit_writeword_indexed(th,4,temp);
3759 emit_writeword_indexed(tl,0,temp);
3761 //if(opcode[i]==0x39)
3762 /*if(opcode[i]==0x39||opcode[i]==0x31)
3765 emit_readword((int)&last_count,ECX);
3766 if(get_reg(i_regs->regmap,CCREG)<0)
3767 emit_loadreg(CCREG,HOST_CCREG);
3768 emit_add(HOST_CCREG,ECX,HOST_CCREG);
3769 emit_addimm(HOST_CCREG,2*ccadj[i],HOST_CCREG);
3770 emit_writeword(HOST_CCREG,(int)&Count);
3771 emit_call((int)memdebug);
3775 cop1_unusable(i, i_regs);
3779 void c2ls_assemble(int i,struct regstat *i_regs)
3784 int memtarget=0,c=0;
3785 int jaddr2=0,jaddr3,type;
3786 int agr=AGEN1+(i&1);
3787 int fastio_reg_override=0;
3789 u_int copr=(source[i]>>16)&0x1f;
3790 s=get_reg(i_regs->regmap,rs1[i]);
3791 tl=get_reg(i_regs->regmap,FTEMP);
3797 for(hr=0;hr<HOST_REGS;hr++) {
3798 if(i_regs->regmap[hr]>=0) reglist|=1<<hr;
3800 if(i_regs->regmap[HOST_CCREG]==CCREG)
3801 reglist&=~(1<<HOST_CCREG);
3804 if (opcode[i]==0x3a) { // SWC2
3805 ar=get_reg(i_regs->regmap,agr);
3806 if(ar<0) ar=get_reg(i_regs->regmap,-1);
3811 if(s>=0) c=(i_regs->wasconst>>s)&1;
3812 memtarget=c&&(((signed int)(constmap[i][s]+offset))<(signed int)0x80000000+RAM_SIZE);
3813 if (!offset&&!c&&s>=0) ar=s;
3816 if (opcode[i]==0x3a) { // SWC2
3817 cop2_get_dreg(copr,tl,HOST_TEMPREG);
3825 emit_jmp(0); // inline_readstub/inline_writestub?
3829 jaddr2=emit_fastpath_cmp_jump(i,ar,&fastio_reg_override);
3831 else if(ram_offset&&memtarget) {
3832 emit_addimm(ar,ram_offset,HOST_TEMPREG);
3833 fastio_reg_override=HOST_TEMPREG;
3835 if (opcode[i]==0x32) { // LWC2
3836 #ifdef HOST_IMM_ADDR32
3837 if(c) emit_readword_tlb(constmap[i][s]+offset,-1,tl);
3841 if(fastio_reg_override) a=fastio_reg_override;
3842 emit_readword_indexed(0,a,tl);
3844 if (opcode[i]==0x3a) { // SWC2
3845 #ifdef DESTRUCTIVE_SHIFT
3846 if(!offset&&!c&&s>=0) emit_mov(s,ar);
3849 if(fastio_reg_override) a=fastio_reg_override;
3850 emit_writeword_indexed(tl,0,a);
3854 add_stub(type,jaddr2,(int)out,i,ar,(int)i_regs,ccadj[i],reglist);
3855 if(opcode[i]==0x3a) // SWC2
3856 if(!(i_regs->waswritten&(1<<rs1[i]))&&!(new_dynarec_hacks&NDHACK_NO_SMC_CHECK)) {
3857 #if defined(HOST_IMM8)
3858 int ir=get_reg(i_regs->regmap,INVCP);
3860 emit_cmpmem_indexedsr12_reg(ir,ar,1);
3862 emit_cmpmem_indexedsr12_imm((int)invalid_code,ar,1);
3864 #if defined(HAVE_CONDITIONAL_CALL) && !defined(DESTRUCTIVE_SHIFT)
3865 emit_callne(invalidate_addr_reg[ar]);
3869 add_stub(INVCODE_STUB,jaddr3,(int)out,reglist|(1<<HOST_CCREG),ar,0,0,0);
3872 if (opcode[i]==0x32) { // LWC2
3873 cop2_put_dreg(copr,tl,HOST_TEMPREG);
3877 #ifndef multdiv_assemble
3878 void multdiv_assemble(int i,struct regstat *i_regs)
3880 printf("Need multdiv_assemble for this architecture.\n");
3885 void mov_assemble(int i,struct regstat *i_regs)
3887 //if(opcode2[i]==0x10||opcode2[i]==0x12) { // MFHI/MFLO
3888 //if(opcode2[i]==0x11||opcode2[i]==0x13) { // MTHI/MTLO
3890 signed char sh,sl,th,tl;
3891 th=get_reg(i_regs->regmap,rt1[i]|64);
3892 tl=get_reg(i_regs->regmap,rt1[i]);
3895 sh=get_reg(i_regs->regmap,rs1[i]|64);
3896 sl=get_reg(i_regs->regmap,rs1[i]);
3897 if(sl>=0) emit_mov(sl,tl);
3898 else emit_loadreg(rs1[i],tl);
3900 if(sh>=0) emit_mov(sh,th);
3901 else emit_loadreg(rs1[i]|64,th);
3907 #ifndef fconv_assemble
3908 void fconv_assemble(int i,struct regstat *i_regs)
3910 printf("Need fconv_assemble for this architecture.\n");
3916 void float_assemble(int i,struct regstat *i_regs)
3918 printf("Need float_assemble for this architecture.\n");
3923 void syscall_assemble(int i,struct regstat *i_regs)
3925 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3926 assert(ccreg==HOST_CCREG);
3927 assert(!is_delayslot);
3928 emit_movimm(start+i*4,EAX); // Get PC
3929 emit_addimm(HOST_CCREG,CLOCK_ADJUST(ccadj[i]),HOST_CCREG); // CHECK: is this right? There should probably be an extra cycle...
3930 emit_jmp((int)jump_syscall_hle); // XXX
3933 void hlecall_assemble(int i,struct regstat *i_regs)
3935 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3936 assert(ccreg==HOST_CCREG);
3937 assert(!is_delayslot);
3938 emit_movimm(start+i*4+4,0); // Get PC
3939 emit_movimm((int)psxHLEt[source[i]&7],1);
3940 emit_addimm(HOST_CCREG,CLOCK_ADJUST(ccadj[i]),HOST_CCREG); // XXX
3941 emit_jmp((int)jump_hlecall);
3944 void intcall_assemble(int i,struct regstat *i_regs)
3946 signed char ccreg=get_reg(i_regs->regmap,CCREG);
3947 assert(ccreg==HOST_CCREG);
3948 assert(!is_delayslot);
3949 emit_movimm(start+i*4,0); // Get PC
3950 emit_addimm(HOST_CCREG,CLOCK_ADJUST(ccadj[i]),HOST_CCREG);
3951 emit_jmp((int)jump_intcall);
3954 void ds_assemble(int i,struct regstat *i_regs)
3956 speculate_register_values(i);
3960 alu_assemble(i,i_regs);break;
3962 imm16_assemble(i,i_regs);break;
3964 shift_assemble(i,i_regs);break;
3966 shiftimm_assemble(i,i_regs);break;
3968 load_assemble(i,i_regs);break;
3970 loadlr_assemble(i,i_regs);break;
3972 store_assemble(i,i_regs);break;
3974 storelr_assemble(i,i_regs);break;
3976 cop0_assemble(i,i_regs);break;
3978 cop1_assemble(i,i_regs);break;
3980 c1ls_assemble(i,i_regs);break;
3982 cop2_assemble(i,i_regs);break;
3984 c2ls_assemble(i,i_regs);break;
3986 c2op_assemble(i,i_regs);break;
3988 fconv_assemble(i,i_regs);break;
3990 float_assemble(i,i_regs);break;
3992 fcomp_assemble(i,i_regs);break;
3994 multdiv_assemble(i,i_regs);break;
3996 mov_assemble(i,i_regs);break;
4006 SysPrintf("Jump in the delay slot. This is probably a bug.\n");
4011 // Is the branch target a valid internal jump?
4012 int internal_branch(uint64_t i_is32,int addr)
4014 if(addr&1) return 0; // Indirect (register) jump
4015 if(addr>=start && addr<start+slen*4-4)
4017 int t=(addr-start)>>2;
4018 // Delay slots are not valid branch targets
4019 //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;
4020 // 64 -> 32 bit transition requires a recompile
4021 /*if(is32[t]&~unneeded_reg_upper[t]&~i_is32)
4023 if(requires_32bit[t]&~i_is32) printf("optimizable: no\n");
4024 else printf("optimizable: yes\n");
4026 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4028 if(requires_32bit[t]&~i_is32) return 0;
4036 #ifndef wb_invalidate
4037 void wb_invalidate(signed char pre[],signed char entry[],uint64_t dirty,uint64_t is32,
4038 uint64_t u,uint64_t uu)
4041 for(hr=0;hr<HOST_REGS;hr++) {
4042 if(hr!=EXCLUDE_REG) {
4043 if(pre[hr]!=entry[hr]) {
4046 if(get_reg(entry,pre[hr])<0) {
4048 if(!((u>>pre[hr])&1)) {
4049 emit_storereg(pre[hr],hr);
4050 if( ((is32>>pre[hr])&1) && !((uu>>pre[hr])&1) ) {
4051 emit_sarimm(hr,31,hr);
4052 emit_storereg(pre[hr]|64,hr);
4056 if(!((uu>>(pre[hr]&63))&1) && !((is32>>(pre[hr]&63))&1)) {
4057 emit_storereg(pre[hr],hr);
4066 // Move from one register to another (no writeback)
4067 for(hr=0;hr<HOST_REGS;hr++) {
4068 if(hr!=EXCLUDE_REG) {
4069 if(pre[hr]!=entry[hr]) {
4070 if(pre[hr]>=0&&(pre[hr]&63)<TEMPREG) {
4072 if((nr=get_reg(entry,pre[hr]))>=0) {
4082 // Load the specified registers
4083 // This only loads the registers given as arguments because
4084 // we don't want to load things that will be overwritten
4085 void load_regs(signed char entry[],signed char regmap[],int is32,int rs1,int rs2)
4089 for(hr=0;hr<HOST_REGS;hr++) {
4090 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4091 if(entry[hr]!=regmap[hr]) {
4092 if(regmap[hr]==rs1||regmap[hr]==rs2)
4099 emit_loadreg(regmap[hr],hr);
4106 for(hr=0;hr<HOST_REGS;hr++) {
4107 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4108 if(entry[hr]!=regmap[hr]) {
4109 if(regmap[hr]-64==rs1||regmap[hr]-64==rs2)
4111 assert(regmap[hr]!=64);
4112 if((is32>>(regmap[hr]&63))&1) {
4113 int lr=get_reg(regmap,regmap[hr]-64);
4115 emit_sarimm(lr,31,hr);
4117 emit_loadreg(regmap[hr],hr);
4121 emit_loadreg(regmap[hr],hr);
4129 // Load registers prior to the start of a loop
4130 // so that they are not loaded within the loop
4131 static void loop_preload(signed char pre[],signed char entry[])
4134 for(hr=0;hr<HOST_REGS;hr++) {
4135 if(hr!=EXCLUDE_REG) {
4136 if(pre[hr]!=entry[hr]) {
4138 if(get_reg(pre,entry[hr])<0) {
4139 assem_debug("loop preload:\n");
4140 //printf("loop preload: %d\n",hr);
4144 else if(entry[hr]<TEMPREG)
4146 emit_loadreg(entry[hr],hr);
4148 else if(entry[hr]-64<TEMPREG)
4150 emit_loadreg(entry[hr],hr);
4159 // Generate address for load/store instruction
4160 // goes to AGEN for writes, FTEMP for LOADLR and cop1/2 loads
4161 void address_generation(int i,struct regstat *i_regs,signed char entry[])
4163 if(itype[i]==LOAD||itype[i]==LOADLR||itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS||itype[i]==C2LS) {
4165 int agr=AGEN1+(i&1);
4166 int mgr=MGEN1+(i&1);
4167 if(itype[i]==LOAD) {
4168 ra=get_reg(i_regs->regmap,rt1[i]);
4169 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4172 if(itype[i]==LOADLR) {
4173 ra=get_reg(i_regs->regmap,FTEMP);
4175 if(itype[i]==STORE||itype[i]==STORELR) {
4176 ra=get_reg(i_regs->regmap,agr);
4177 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4179 if(itype[i]==C1LS||itype[i]==C2LS) {
4180 if ((opcode[i]&0x3b)==0x31||(opcode[i]&0x3b)==0x32) // LWC1/LDC1/LWC2/LDC2
4181 ra=get_reg(i_regs->regmap,FTEMP);
4182 else { // SWC1/SDC1/SWC2/SDC2
4183 ra=get_reg(i_regs->regmap,agr);
4184 if(ra<0) ra=get_reg(i_regs->regmap,-1);
4187 int rs=get_reg(i_regs->regmap,rs1[i]);
4188 int rm=get_reg(i_regs->regmap,TLREG);
4191 int c=(i_regs->wasconst>>rs)&1;
4193 // Using r0 as a base address
4195 if(!entry||entry[rm]!=mgr) {
4196 generate_map_const(offset,rm);
4197 } // else did it in the previous cycle
4199 if(!entry||entry[ra]!=agr) {
4200 if (opcode[i]==0x22||opcode[i]==0x26) {
4201 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4202 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4203 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4205 emit_movimm(offset,ra);
4207 } // else did it in the previous cycle
4210 if(!entry||entry[ra]!=rs1[i])
4211 emit_loadreg(rs1[i],ra);
4212 //if(!entry||entry[ra]!=rs1[i])
4213 // printf("poor load scheduling!\n");
4218 if(!entry||entry[rm]!=mgr) {
4219 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a) {
4220 // Stores to memory go thru the mapper to detect self-modifying
4221 // code, loads don't.
4222 if((unsigned int)(constmap[i][rs]+offset)>=0xC0000000 ||
4223 (unsigned int)(constmap[i][rs]+offset)<0x80000000+RAM_SIZE )
4224 generate_map_const(constmap[i][rs]+offset,rm);
4226 if((signed int)(constmap[i][rs]+offset)>=(signed int)0xC0000000)
4227 generate_map_const(constmap[i][rs]+offset,rm);
4232 if(rs1[i]!=rt1[i]||itype[i]!=LOAD) {
4233 if(!entry||entry[ra]!=agr) {
4234 if (opcode[i]==0x22||opcode[i]==0x26) {
4235 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4236 }else if (opcode[i]==0x1a||opcode[i]==0x1b) {
4237 emit_movimm((constmap[i][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4239 #ifdef HOST_IMM_ADDR32
4240 if((itype[i]!=LOAD&&(opcode[i]&0x3b)!=0x31&&(opcode[i]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4241 (using_tlb&&((signed int)constmap[i][rs]+offset)>=(signed int)0xC0000000))
4243 emit_movimm(constmap[i][rs]+offset,ra);
4244 regs[i].loadedconst|=1<<ra;
4246 } // else did it in the previous cycle
4247 } // else load_consts already did it
4249 if(offset&&!c&&rs1[i]) {
4251 emit_addimm(rs,offset,ra);
4253 emit_addimm(ra,offset,ra);
4258 // Preload constants for next instruction
4259 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) {
4261 #if !defined(HOST_IMM_ADDR32) && !defined(DISABLE_TLB)
4263 agr=MGEN1+((i+1)&1);
4264 ra=get_reg(i_regs->regmap,agr);
4266 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4267 int offset=imm[i+1];
4268 int c=(regs[i+1].wasconst>>rs)&1;
4270 if(itype[i+1]==STORE||itype[i+1]==STORELR
4271 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1, SWC2/SDC2
4272 // Stores to memory go thru the mapper to detect self-modifying
4273 // code, loads don't.
4274 if((unsigned int)(constmap[i+1][rs]+offset)>=0xC0000000 ||
4275 (unsigned int)(constmap[i+1][rs]+offset)<0x80000000+RAM_SIZE )
4276 generate_map_const(constmap[i+1][rs]+offset,ra);
4278 if((signed int)(constmap[i+1][rs]+offset)>=(signed int)0xC0000000)
4279 generate_map_const(constmap[i+1][rs]+offset,ra);
4282 /*else if(rs1[i]==0) {
4283 generate_map_const(offset,ra);
4288 agr=AGEN1+((i+1)&1);
4289 ra=get_reg(i_regs->regmap,agr);
4291 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
4292 int offset=imm[i+1];
4293 int c=(regs[i+1].wasconst>>rs)&1;
4294 if(c&&(rs1[i+1]!=rt1[i+1]||itype[i+1]!=LOAD)) {
4295 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4296 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFFC,ra); // LWL/LWR
4297 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4298 emit_movimm((constmap[i+1][rs]+offset)&0xFFFFFFF8,ra); // LDL/LDR
4300 #ifdef HOST_IMM_ADDR32
4301 if((itype[i+1]!=LOAD&&(opcode[i+1]&0x3b)!=0x31&&(opcode[i+1]&0x3b)!=0x32) || // LWC1/LDC1/LWC2/LDC2
4302 (using_tlb&&((signed int)constmap[i+1][rs]+offset)>=(signed int)0xC0000000))
4304 emit_movimm(constmap[i+1][rs]+offset,ra);
4305 regs[i+1].loadedconst|=1<<ra;
4308 else if(rs1[i+1]==0) {
4309 // Using r0 as a base address
4310 if (opcode[i+1]==0x22||opcode[i+1]==0x26) {
4311 emit_movimm(offset&0xFFFFFFFC,ra); // LWL/LWR
4312 }else if (opcode[i+1]==0x1a||opcode[i+1]==0x1b) {
4313 emit_movimm(offset&0xFFFFFFF8,ra); // LDL/LDR
4315 emit_movimm(offset,ra);
4322 int get_final_value(int hr, int i, int *value)
4324 int reg=regs[i].regmap[hr];
4326 if(regs[i+1].regmap[hr]!=reg) break;
4327 if(!((regs[i+1].isconst>>hr)&1)) break;
4332 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP) {
4333 *value=constmap[i][hr];
4337 if(itype[i+1]==UJUMP||itype[i+1]==RJUMP||itype[i+1]==CJUMP||itype[i+1]==SJUMP) {
4338 // Load in delay slot, out-of-order execution
4339 if(itype[i+2]==LOAD&&rs1[i+2]==reg&&rt1[i+2]==reg&&((regs[i+1].wasconst>>hr)&1))
4341 #ifdef HOST_IMM_ADDR32
4342 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+2])<(signed int)0xC0000000) return 0;
4344 // Precompute load address
4345 *value=constmap[i][hr]+imm[i+2];
4349 if(itype[i+1]==LOAD&&rs1[i+1]==reg&&rt1[i+1]==reg)
4351 #ifdef HOST_IMM_ADDR32
4352 if(!using_tlb||((signed int)constmap[i][hr]+imm[i+1])<(signed int)0xC0000000) return 0;
4354 // Precompute load address
4355 *value=constmap[i][hr]+imm[i+1];
4356 //printf("c=%x imm=%x\n",(int)constmap[i][hr],imm[i+1]);
4361 *value=constmap[i][hr];
4362 //printf("c=%x\n",(int)constmap[i][hr]);
4363 if(i==slen-1) return 1;
4365 return !((unneeded_reg[i+1]>>reg)&1);
4367 return !((unneeded_reg_upper[i+1]>>reg)&1);
4371 // Load registers with known constants
4372 void load_consts(signed char pre[],signed char regmap[],int is32,int i)
4375 // propagate loaded constant flags
4377 regs[i].loadedconst=0;
4379 for(hr=0;hr<HOST_REGS;hr++) {
4380 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((regs[i-1].isconst>>hr)&1)&&pre[hr]==regmap[hr]
4381 &®map[hr]==regs[i-1].regmap[hr]&&((regs[i-1].loadedconst>>hr)&1))
4383 regs[i].loadedconst|=1<<hr;
4388 for(hr=0;hr<HOST_REGS;hr++) {
4389 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4390 //if(entry[hr]!=regmap[hr]) {
4391 if(!((regs[i].loadedconst>>hr)&1)) {
4392 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4393 int value,similar=0;
4394 if(get_final_value(hr,i,&value)) {
4395 // see if some other register has similar value
4396 for(hr2=0;hr2<HOST_REGS;hr2++) {
4397 if(hr2!=EXCLUDE_REG&&((regs[i].loadedconst>>hr2)&1)) {
4398 if(is_similar_value(value,constmap[i][hr2])) {
4406 if(get_final_value(hr2,i,&value2)) // is this needed?
4407 emit_movimm_from(value2,hr2,value,hr);
4409 emit_movimm(value,hr);
4415 emit_movimm(value,hr);
4418 regs[i].loadedconst|=1<<hr;
4424 for(hr=0;hr<HOST_REGS;hr++) {
4425 if(hr!=EXCLUDE_REG&®map[hr]>=0) {
4426 //if(entry[hr]!=regmap[hr]) {
4427 if(i==0||!((regs[i-1].isconst>>hr)&1)||pre[hr]!=regmap[hr]||bt[i]) {
4428 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4429 if((is32>>(regmap[hr]&63))&1) {
4430 int lr=get_reg(regmap,regmap[hr]-64);
4432 emit_sarimm(lr,31,hr);
4437 if(get_final_value(hr,i,&value)) {
4442 emit_movimm(value,hr);
4451 void load_all_consts(signed char regmap[],int is32,u_int dirty,int i)
4455 for(hr=0;hr<HOST_REGS;hr++) {
4456 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4457 if(((regs[i].isconst>>hr)&1)&®map[hr]<64&®map[hr]>0) {
4458 int value=constmap[i][hr];
4463 emit_movimm(value,hr);
4469 for(hr=0;hr<HOST_REGS;hr++) {
4470 if(hr!=EXCLUDE_REG&®map[hr]>=0&&((dirty>>hr)&1)) {
4471 if(((regs[i].isconst>>hr)&1)&®map[hr]>64) {
4472 if((is32>>(regmap[hr]&63))&1) {
4473 int lr=get_reg(regmap,regmap[hr]-64);
4475 emit_sarimm(lr,31,hr);
4479 int value=constmap[i][hr];
4484 emit_movimm(value,hr);
4492 // Write out all dirty registers (except cycle count)
4493 void wb_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty)
4496 for(hr=0;hr<HOST_REGS;hr++) {
4497 if(hr!=EXCLUDE_REG) {
4498 if(i_regmap[hr]>0) {
4499 if(i_regmap[hr]!=CCREG) {
4500 if((i_dirty>>hr)&1) {
4501 if(i_regmap[hr]<64) {
4502 emit_storereg(i_regmap[hr],hr);
4504 if( ((i_is32>>i_regmap[hr])&1) ) {
4505 #ifdef DESTRUCTIVE_WRITEBACK
4506 emit_sarimm(hr,31,hr);
4507 emit_storereg(i_regmap[hr]|64,hr);
4509 emit_sarimm(hr,31,HOST_TEMPREG);
4510 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4515 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4516 emit_storereg(i_regmap[hr],hr);
4525 // Write out dirty registers that we need to reload (pair with load_needed_regs)
4526 // This writes the registers not written by store_regs_bt
4527 void wb_needed_dirtys(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4530 int t=(addr-start)>>2;
4531 for(hr=0;hr<HOST_REGS;hr++) {
4532 if(hr!=EXCLUDE_REG) {
4533 if(i_regmap[hr]>0) {
4534 if(i_regmap[hr]!=CCREG) {
4535 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)) {
4536 if((i_dirty>>hr)&1) {
4537 if(i_regmap[hr]<64) {
4538 emit_storereg(i_regmap[hr],hr);
4540 if( ((i_is32>>i_regmap[hr])&1) ) {
4541 #ifdef DESTRUCTIVE_WRITEBACK
4542 emit_sarimm(hr,31,hr);
4543 emit_storereg(i_regmap[hr]|64,hr);
4545 emit_sarimm(hr,31,HOST_TEMPREG);
4546 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4551 if( !((i_is32>>(i_regmap[hr]&63))&1) ) {
4552 emit_storereg(i_regmap[hr],hr);
4563 // Load all registers (except cycle count)
4564 void load_all_regs(signed char i_regmap[])
4567 for(hr=0;hr<HOST_REGS;hr++) {
4568 if(hr!=EXCLUDE_REG) {
4569 if(i_regmap[hr]==0) {
4573 if(i_regmap[hr]>0 && (i_regmap[hr]&63)<TEMPREG && i_regmap[hr]!=CCREG)
4575 emit_loadreg(i_regmap[hr],hr);
4581 // Load all current registers also needed by next instruction
4582 void load_needed_regs(signed char i_regmap[],signed char next_regmap[])
4585 for(hr=0;hr<HOST_REGS;hr++) {
4586 if(hr!=EXCLUDE_REG) {
4587 if(get_reg(next_regmap,i_regmap[hr])>=0) {
4588 if(i_regmap[hr]==0) {
4592 if(i_regmap[hr]>0 && (i_regmap[hr]&63)<TEMPREG && i_regmap[hr]!=CCREG)
4594 emit_loadreg(i_regmap[hr],hr);
4601 // Load all regs, storing cycle count if necessary
4602 void load_regs_entry(int t)
4605 if(is_ds[t]) emit_addimm(HOST_CCREG,CLOCK_ADJUST(1),HOST_CCREG);
4606 else if(ccadj[t]) emit_addimm(HOST_CCREG,-CLOCK_ADJUST(ccadj[t]),HOST_CCREG);
4607 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4608 emit_storereg(CCREG,HOST_CCREG);
4611 for(hr=0;hr<HOST_REGS;hr++) {
4612 if(regs[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<TEMPREG) {
4613 if(regs[t].regmap_entry[hr]==0) {
4616 else if(regs[t].regmap_entry[hr]!=CCREG)
4618 emit_loadreg(regs[t].regmap_entry[hr],hr);
4623 for(hr=0;hr<HOST_REGS;hr++) {
4624 if(regs[t].regmap_entry[hr]>=64&®s[t].regmap_entry[hr]<TEMPREG+64) {
4625 assert(regs[t].regmap_entry[hr]!=64);
4626 if((regs[t].was32>>(regs[t].regmap_entry[hr]&63))&1) {
4627 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4629 emit_loadreg(regs[t].regmap_entry[hr],hr);
4633 emit_sarimm(lr,31,hr);
4638 emit_loadreg(regs[t].regmap_entry[hr],hr);
4644 // Store dirty registers prior to branch
4645 void store_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4647 if(internal_branch(i_is32,addr))
4649 int t=(addr-start)>>2;
4651 for(hr=0;hr<HOST_REGS;hr++) {
4652 if(hr!=EXCLUDE_REG) {
4653 if(i_regmap[hr]>0 && i_regmap[hr]!=CCREG) {
4654 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)) {
4655 if((i_dirty>>hr)&1) {
4656 if(i_regmap[hr]<64) {
4657 if(!((unneeded_reg[t]>>i_regmap[hr])&1)) {
4658 emit_storereg(i_regmap[hr],hr);
4659 if( ((i_is32>>i_regmap[hr])&1) && !((unneeded_reg_upper[t]>>i_regmap[hr])&1) ) {
4660 #ifdef DESTRUCTIVE_WRITEBACK
4661 emit_sarimm(hr,31,hr);
4662 emit_storereg(i_regmap[hr]|64,hr);
4664 emit_sarimm(hr,31,HOST_TEMPREG);
4665 emit_storereg(i_regmap[hr]|64,HOST_TEMPREG);
4670 if( !((i_is32>>(i_regmap[hr]&63))&1) && !((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1) ) {
4671 emit_storereg(i_regmap[hr],hr);
4682 // Branch out of this block, write out all dirty regs
4683 wb_dirtys(i_regmap,i_is32,i_dirty);
4687 // Load all needed registers for branch target
4688 void load_regs_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4690 //if(addr>=start && addr<(start+slen*4))
4691 if(internal_branch(i_is32,addr))
4693 int t=(addr-start)>>2;
4695 // Store the cycle count before loading something else
4696 if(i_regmap[HOST_CCREG]!=CCREG) {
4697 assert(i_regmap[HOST_CCREG]==-1);
4699 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) {
4700 emit_storereg(CCREG,HOST_CCREG);
4703 for(hr=0;hr<HOST_REGS;hr++) {
4704 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=0&®s[t].regmap_entry[hr]<TEMPREG) {
4705 #ifdef DESTRUCTIVE_WRITEBACK
4706 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)) {
4708 if(i_regmap[hr]!=regs[t].regmap_entry[hr] ) {
4710 if(regs[t].regmap_entry[hr]==0) {
4713 else if(regs[t].regmap_entry[hr]!=CCREG)
4715 emit_loadreg(regs[t].regmap_entry[hr],hr);
4721 for(hr=0;hr<HOST_REGS;hr++) {
4722 if(hr!=EXCLUDE_REG&®s[t].regmap_entry[hr]>=64&®s[t].regmap_entry[hr]<TEMPREG+64) {
4723 if(i_regmap[hr]!=regs[t].regmap_entry[hr]) {
4724 assert(regs[t].regmap_entry[hr]!=64);
4725 if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4726 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4728 emit_loadreg(regs[t].regmap_entry[hr],hr);
4732 emit_sarimm(lr,31,hr);
4737 emit_loadreg(regs[t].regmap_entry[hr],hr);
4740 else if((i_is32>>(regs[t].regmap_entry[hr]&63))&1) {
4741 int lr=get_reg(regs[t].regmap_entry,regs[t].regmap_entry[hr]-64);
4743 emit_sarimm(lr,31,hr);
4750 int match_bt(signed char i_regmap[],uint64_t i_is32,uint64_t i_dirty,int addr)
4752 if(addr>=start && addr<start+slen*4-4)
4754 int t=(addr-start)>>2;
4756 if(regs[t].regmap_entry[HOST_CCREG]!=CCREG) return 0;
4757 for(hr=0;hr<HOST_REGS;hr++)
4761 if(i_regmap[hr]!=regs[t].regmap_entry[hr])
4763 if(regs[t].regmap_entry[hr]>=0&&(regs[t].regmap_entry[hr]|64)<TEMPREG+64)
4770 if(i_regmap[hr]<TEMPREG)
4772 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4775 else if(i_regmap[hr]>=64&&i_regmap[hr]<TEMPREG+64)
4777 if(!((unneeded_reg_upper[t]>>(i_regmap[hr]&63))&1))
4782 else // Same register but is it 32-bit or dirty?
4785 if(!((regs[t].dirty>>hr)&1))
4789 if(!((unneeded_reg[t]>>i_regmap[hr])&1))
4791 //printf("%x: dirty no match\n",addr);
4796 if((((regs[t].was32^i_is32)&~unneeded_reg_upper[t])>>(i_regmap[hr]&63))&1)
4798 //printf("%x: is32 no match\n",addr);
4804 //if(is32[t]&~unneeded_reg_upper[t]&~i_is32) return 0;
4806 if(requires_32bit[t]&~i_is32) return 0;
4808 // Delay slots are not valid branch targets
4809 //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;
4810 // Delay slots require additional processing, so do not match
4811 if(is_ds[t]) return 0;
4816 for(hr=0;hr<HOST_REGS;hr++)
4822 if(hr!=HOST_CCREG||i_regmap[hr]!=CCREG)
4836 // Used when a branch jumps into the delay slot of another branch
4837 void ds_assemble_entry(int i)
4839 int t=(ba[i]-start)>>2;
4840 if(!instr_addr[t]) instr_addr[t]=(u_int)out;
4841 assem_debug("Assemble delay slot at %x\n",ba[i]);
4842 assem_debug("<->\n");
4843 if(regs[t].regmap_entry[HOST_CCREG]==CCREG&®s[t].regmap[HOST_CCREG]!=CCREG)
4844 wb_register(CCREG,regs[t].regmap_entry,regs[t].wasdirty,regs[t].was32);
4845 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,rs1[t],rs2[t]);
4846 address_generation(t,®s[t],regs[t].regmap_entry);
4847 if(itype[t]==STORE||itype[t]==STORELR||(opcode[t]&0x3b)==0x39||(opcode[t]&0x3b)==0x3a)
4848 load_regs(regs[t].regmap_entry,regs[t].regmap,regs[t].was32,INVCP,INVCP);
4853 alu_assemble(t,®s[t]);break;
4855 imm16_assemble(t,®s[t]);break;
4857 shift_assemble(t,®s[t]);break;
4859 shiftimm_assemble(t,®s[t]);break;
4861 load_assemble(t,®s[t]);break;
4863 loadlr_assemble(t,®s[t]);break;
4865 store_assemble(t,®s[t]);break;
4867 storelr_assemble(t,®s[t]);break;
4869 cop0_assemble(t,®s[t]);break;
4871 cop1_assemble(t,®s[t]);break;
4873 c1ls_assemble(t,®s[t]);break;
4875 cop2_assemble(t,®s[t]);break;
4877 c2ls_assemble(t,®s[t]);break;
4879 c2op_assemble(t,®s[t]);break;
4881 fconv_assemble(t,®s[t]);break;
4883 float_assemble(t,®s[t]);break;
4885 fcomp_assemble(t,®s[t]);break;
4887 multdiv_assemble(t,®s[t]);break;
4889 mov_assemble(t,®s[t]);break;
4899 SysPrintf("Jump in the delay slot. This is probably a bug.\n");
4901 store_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4902 load_regs_bt(regs[t].regmap,regs[t].is32,regs[t].dirty,ba[i]+4);
4903 if(internal_branch(regs[t].is32,ba[i]+4))
4904 assem_debug("branch: internal\n");
4906 assem_debug("branch: external\n");
4907 assert(internal_branch(regs[t].is32,ba[i]+4));
4908 add_to_linker((int)out,ba[i]+4,internal_branch(regs[t].is32,ba[i]+4));
4912 void do_cc(int i,signed char i_regmap[],int *adj,int addr,int taken,int invert)
4922 //if(ba[i]>=start && ba[i]<(start+slen*4))
4923 if(internal_branch(branch_regs[i].is32,ba[i]))
4926 if(is_ds[t]) *adj=-1; // Branch into delay slot adds an extra cycle
4934 if(taken==TAKEN && i==(ba[i]-start)>>2 && source[i+1]==0) {
4936 if(count&1) emit_addimm_and_set_flags(2*(count+2),HOST_CCREG);
4938 //emit_subfrommem(&idlecount,HOST_CCREG); // Count idle cycles
4939 emit_andimm(HOST_CCREG,3,HOST_CCREG);
4943 else if(*adj==0||invert) {
4944 int cycles=CLOCK_ADJUST(count+2);
4948 if(-NO_CYCLE_PENALTY_THR<rel&&rel<0)
4949 cycles=CLOCK_ADJUST(*adj)+count+2-*adj;
4951 emit_addimm_and_set_flags(cycles,HOST_CCREG);
4957 emit_cmpimm(HOST_CCREG,-CLOCK_ADJUST(count+2));
4961 add_stub(CC_STUB,jaddr,idle?idle:(int)out,(*adj==0||invert||idle)?0:(count+2),i,addr,taken,0);
4964 void do_ccstub(int n)
4967 assem_debug("do_ccstub %x\n",start+stubs[n][4]*4);
4968 set_jump_target(stubs[n][1],(int)out);
4970 if(stubs[n][6]==NULLDS) {
4971 // Delay slot instruction is nullified ("likely" branch)
4972 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
4974 else if(stubs[n][6]!=TAKEN) {
4975 wb_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty);
4978 if(internal_branch(branch_regs[i].is32,ba[i]))
4979 wb_needed_dirtys(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
4983 // Save PC as return address
4984 emit_movimm(stubs[n][5],EAX);
4985 emit_writeword(EAX,(int)&pcaddr);
4989 // Return address depends on which way the branch goes
4990 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
4992 int s1l=get_reg(branch_regs[i].regmap,rs1[i]);
4993 int s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
4994 int s2l=get_reg(branch_regs[i].regmap,rs2[i]);
4995 int s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5005 if((branch_regs[i].is32>>rs1[i])&(branch_regs[i].is32>>rs2[i])&1) {
5009 #ifdef DESTRUCTIVE_WRITEBACK
5011 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs1[i])&1)
5012 emit_loadreg(rs1[i],s1l);
5015 if((branch_regs[i].dirty>>s1l)&(branch_regs[i].is32>>rs2[i])&1)
5016 emit_loadreg(rs2[i],s1l);
5019 if((branch_regs[i].dirty>>s2l)&(branch_regs[i].is32>>rs2[i])&1)
5020 emit_loadreg(rs2[i],s2l);
5023 int addr=-1,alt=-1,ntaddr=-1;
5026 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
5027 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
5028 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
5036 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
5037 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
5038 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
5044 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
5048 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
5049 (branch_regs[i].regmap[hr]&63)!=rs1[i] &&
5050 (branch_regs[i].regmap[hr]&63)!=rs2[i] )
5056 assert(hr<HOST_REGS);
5058 if((opcode[i]&0x2f)==4) // BEQ
5060 #ifdef HAVE_CMOV_IMM
5062 if(s2l>=0) emit_cmp(s1l,s2l);
5063 else emit_test(s1l,s1l);
5064 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
5069 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5071 if(s2h>=0) emit_cmp(s1h,s2h);
5072 else emit_test(s1h,s1h);
5073 emit_cmovne_reg(alt,addr);
5075 if(s2l>=0) emit_cmp(s1l,s2l);
5076 else emit_test(s1l,s1l);
5077 emit_cmovne_reg(alt,addr);
5080 if((opcode[i]&0x2f)==5) // BNE
5082 #ifdef HAVE_CMOV_IMM
5084 if(s2l>=0) emit_cmp(s1l,s2l);
5085 else emit_test(s1l,s1l);
5086 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
5091 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
5093 if(s2h>=0) emit_cmp(s1h,s2h);
5094 else emit_test(s1h,s1h);
5095 emit_cmovne_reg(alt,addr);
5097 if(s2l>=0) emit_cmp(s1l,s2l);
5098 else emit_test(s1l,s1l);
5099 emit_cmovne_reg(alt,addr);
5102 if((opcode[i]&0x2f)==6) // BLEZ
5104 //emit_movimm(ba[i],alt);
5105 //emit_movimm(start+i*4+8,addr);
5106 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5108 if(s1h>=0) emit_mov(addr,ntaddr);
5109 emit_cmovl_reg(alt,addr);
5112 emit_cmovne_reg(ntaddr,addr);
5113 emit_cmovs_reg(alt,addr);
5116 if((opcode[i]&0x2f)==7) // BGTZ
5118 //emit_movimm(ba[i],addr);
5119 //emit_movimm(start+i*4+8,ntaddr);
5120 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
5122 if(s1h>=0) emit_mov(addr,alt);
5123 emit_cmovl_reg(ntaddr,addr);
5126 emit_cmovne_reg(alt,addr);
5127 emit_cmovs_reg(ntaddr,addr);
5130 if((opcode[i]==1)&&(opcode2[i]&0x2D)==0) // BLTZ
5132 //emit_movimm(ba[i],alt);
5133 //emit_movimm(start+i*4+8,addr);
5134 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5135 if(s1h>=0) emit_test(s1h,s1h);
5136 else emit_test(s1l,s1l);
5137 emit_cmovs_reg(alt,addr);
5139 if((opcode[i]==1)&&(opcode2[i]&0x2D)==1) // BGEZ
5141 //emit_movimm(ba[i],addr);
5142 //emit_movimm(start+i*4+8,alt);
5143 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5144 if(s1h>=0) emit_test(s1h,s1h);
5145 else emit_test(s1l,s1l);
5146 emit_cmovs_reg(alt,addr);
5148 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
5149 if(source[i]&0x10000) // BC1T
5151 //emit_movimm(ba[i],alt);
5152 //emit_movimm(start+i*4+8,addr);
5153 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
5154 emit_testimm(s1l,0x800000);
5155 emit_cmovne_reg(alt,addr);
5159 //emit_movimm(ba[i],addr);
5160 //emit_movimm(start+i*4+8,alt);
5161 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
5162 emit_testimm(s1l,0x800000);
5163 emit_cmovne_reg(alt,addr);
5166 emit_writeword(addr,(int)&pcaddr);
5171 int r=get_reg(branch_regs[i].regmap,rs1[i]);
5172 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5173 r=get_reg(branch_regs[i].regmap,RTEMP);
5175 emit_writeword(r,(int)&pcaddr);
5177 else {SysPrintf("Unknown branch type in do_ccstub\n");exit(1);}
5179 // Update cycle count
5180 assert(branch_regs[i].regmap[HOST_CCREG]==CCREG||branch_regs[i].regmap[HOST_CCREG]==-1);
5181 if(stubs[n][3]) emit_addimm(HOST_CCREG,CLOCK_ADJUST((int)stubs[n][3]),HOST_CCREG);
5182 emit_call((int)cc_interrupt);
5183 if(stubs[n][3]) emit_addimm(HOST_CCREG,-CLOCK_ADJUST((int)stubs[n][3]),HOST_CCREG);
5184 if(stubs[n][6]==TAKEN) {
5185 if(internal_branch(branch_regs[i].is32,ba[i]))
5186 load_needed_regs(branch_regs[i].regmap,regs[(ba[i]-start)>>2].regmap_entry);
5187 else if(itype[i]==RJUMP) {
5188 if(get_reg(branch_regs[i].regmap,RTEMP)>=0)
5189 emit_readword((int)&pcaddr,get_reg(branch_regs[i].regmap,RTEMP));
5191 emit_loadreg(rs1[i],get_reg(branch_regs[i].regmap,rs1[i]));
5193 }else if(stubs[n][6]==NOTTAKEN) {
5194 if(i<slen-2) load_needed_regs(branch_regs[i].regmap,regmap_pre[i+2]);
5195 else load_all_regs(branch_regs[i].regmap);
5196 }else if(stubs[n][6]==NULLDS) {
5197 // Delay slot instruction is nullified ("likely" branch)
5198 if(i<slen-2) load_needed_regs(regs[i].regmap,regmap_pre[i+2]);
5199 else load_all_regs(regs[i].regmap);
5201 load_all_regs(branch_regs[i].regmap);
5203 emit_jmp(stubs[n][2]); // return address
5205 /* This works but uses a lot of memory...
5206 emit_readword((int)&last_count,ECX);
5207 emit_add(HOST_CCREG,ECX,EAX);
5208 emit_writeword(EAX,(int)&Count);
5209 emit_call((int)gen_interupt);
5210 emit_readword((int)&Count,HOST_CCREG);
5211 emit_readword((int)&next_interupt,EAX);
5212 emit_readword((int)&pending_exception,EBX);
5213 emit_writeword(EAX,(int)&last_count);
5214 emit_sub(HOST_CCREG,EAX,HOST_CCREG);
5216 int jne_instr=(int)out;
5218 if(stubs[n][3]) emit_addimm(HOST_CCREG,-2*stubs[n][3],HOST_CCREG);
5219 load_all_regs(branch_regs[i].regmap);
5220 emit_jmp(stubs[n][2]); // return address
5221 set_jump_target(jne_instr,(int)out);
5222 emit_readword((int)&pcaddr,EAX);
5223 // Call get_addr_ht instead of doing the hash table here.
5224 // This code is executed infrequently and takes up a lot of space
5225 // so smaller is better.
5226 emit_storereg(CCREG,HOST_CCREG);
5228 emit_call((int)get_addr_ht);
5229 emit_loadreg(CCREG,HOST_CCREG);
5230 emit_addimm(ESP,4,ESP);
5234 add_to_linker(int addr,int target,int ext)
5236 link_addr[linkcount][0]=addr;
5237 link_addr[linkcount][1]=target;
5238 link_addr[linkcount][2]=ext;
5242 static void ujump_assemble_write_ra(int i)
5245 unsigned int return_address;
5246 rt=get_reg(branch_regs[i].regmap,31);
5247 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]);
5249 return_address=start+i*4+8;
5252 if(internal_branch(branch_regs[i].is32,return_address)&&rt1[i+1]!=31) {
5253 int temp=-1; // note: must be ds-safe
5257 if(temp>=0) do_miniht_insert(return_address,rt,temp);
5258 else emit_movimm(return_address,rt);
5266 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5269 emit_movimm(return_address,rt); // PC into link register
5271 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5277 void ujump_assemble(int i,struct regstat *i_regs)
5279 signed char *i_regmap=i_regs->regmap;
5281 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5282 address_generation(i+1,i_regs,regs[i].regmap_entry);
5284 int temp=get_reg(branch_regs[i].regmap,PTEMP);
5285 if(rt1[i]==31&&temp>=0)
5287 int return_address=start+i*4+8;
5288 if(get_reg(branch_regs[i].regmap,31)>0)
5289 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5292 if(rt1[i]==31&&(rt1[i]==rs1[i+1]||rt1[i]==rs2[i+1])) {
5293 ujump_assemble_write_ra(i); // writeback ra for DS
5296 ds_assemble(i+1,i_regs);
5297 uint64_t bc_unneeded=branch_regs[i].u;
5298 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5299 bc_unneeded|=1|(1LL<<rt1[i]);
5300 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5301 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5302 bc_unneeded,bc_unneeded_upper);
5303 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5304 if(!ra_done&&rt1[i]==31)
5305 ujump_assemble_write_ra(i);
5307 cc=get_reg(branch_regs[i].regmap,CCREG);
5308 assert(cc==HOST_CCREG);
5309 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5311 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5313 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5314 if(adj) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
5315 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5316 if(internal_branch(branch_regs[i].is32,ba[i]))
5317 assem_debug("branch: internal\n");
5319 assem_debug("branch: external\n");
5320 if(internal_branch(branch_regs[i].is32,ba[i])&&is_ds[(ba[i]-start)>>2]) {
5321 ds_assemble_entry(i);
5324 add_to_linker((int)out,ba[i],internal_branch(branch_regs[i].is32,ba[i]));
5329 static void rjump_assemble_write_ra(int i)
5331 int rt,return_address;
5332 assert(rt1[i+1]!=rt1[i]);
5333 assert(rt2[i+1]!=rt1[i]);
5334 rt=get_reg(branch_regs[i].regmap,rt1[i]);
5335 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]);
5337 return_address=start+i*4+8;
5341 if(i_regmap[temp]!=PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5344 emit_movimm(return_address,rt); // PC into link register
5346 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5350 void rjump_assemble(int i,struct regstat *i_regs)
5352 signed char *i_regmap=i_regs->regmap;
5356 rs=get_reg(branch_regs[i].regmap,rs1[i]);
5358 if(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]) {
5359 // Delay slot abuse, make a copy of the branch address register
5360 temp=get_reg(branch_regs[i].regmap,RTEMP);
5362 assert(regs[i].regmap[temp]==RTEMP);
5366 address_generation(i+1,i_regs,regs[i].regmap_entry);
5370 if((temp=get_reg(branch_regs[i].regmap,PTEMP))>=0) {
5371 int return_address=start+i*4+8;
5372 if(i_regmap[temp]==PTEMP) emit_movimm((int)hash_table[((return_address>>16)^return_address)&0xFFFF],temp);
5378 int rh=get_reg(regs[i].regmap,RHASH);
5379 if(rh>=0) do_preload_rhash(rh);
5382 if(rt1[i]!=0&&(rt1[i]==rs1[i+1]||rt1[i]==rs2[i+1])) {
5383 rjump_assemble_write_ra(i);
5386 ds_assemble(i+1,i_regs);
5387 uint64_t bc_unneeded=branch_regs[i].u;
5388 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5389 bc_unneeded|=1|(1LL<<rt1[i]);
5390 bc_unneeded_upper|=1|(1LL<<rt1[i]);
5391 bc_unneeded&=~(1LL<<rs1[i]);
5392 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5393 bc_unneeded,bc_unneeded_upper);
5394 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],CCREG);
5395 if(!ra_done&&rt1[i]!=0)
5396 rjump_assemble_write_ra(i);
5397 cc=get_reg(branch_regs[i].regmap,CCREG);
5398 assert(cc==HOST_CCREG);
5400 int rh=get_reg(branch_regs[i].regmap,RHASH);
5401 int ht=get_reg(branch_regs[i].regmap,RHTBL);
5403 if(regs[i].regmap[rh]!=RHASH) do_preload_rhash(rh);
5404 do_preload_rhtbl(ht);
5408 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5409 #ifdef DESTRUCTIVE_WRITEBACK
5410 if((branch_regs[i].dirty>>rs)&(branch_regs[i].is32>>rs1[i])&1) {
5411 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
5412 emit_loadreg(rs1[i],rs);
5417 if(rt1[i]==31&&temp>=0) emit_prefetchreg(temp);
5421 do_miniht_load(ht,rh);
5424 //do_cc(i,branch_regs[i].regmap,&adj,-1,TAKEN);
5425 //if(adj) emit_addimm(cc,2*(ccadj[i]+2-adj),cc); // ??? - Shouldn't happen
5427 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),HOST_CCREG);
5428 add_stub(CC_STUB,(int)out,jump_vaddr_reg[rs],0,i,-1,TAKEN,0);
5430 if(itype[i+1]==COP0&&(source[i+1]&0x3f)==0x10)
5431 // special case for RFE
5436 //load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,-1);
5439 do_miniht_jump(rs,rh,ht);
5444 //if(rs!=EAX) emit_mov(rs,EAX);
5445 //emit_jmp((int)jump_vaddr_eax);
5446 emit_jmp(jump_vaddr_reg[rs]);
5451 emit_shrimm(rs,16,rs);
5452 emit_xor(temp,rs,rs);
5453 emit_movzwl_reg(rs,rs);
5454 emit_shlimm(rs,4,rs);
5455 emit_cmpmem_indexed((int)hash_table,rs,temp);
5456 emit_jne((int)out+14);
5457 emit_readword_indexed((int)hash_table+4,rs,rs);
5459 emit_cmpmem_indexed((int)hash_table+8,rs,temp);
5460 emit_addimm_no_flags(8,rs);
5461 emit_jeq((int)out-17);
5462 // No hit on hash table, call compiler
5465 #ifdef DEBUG_CYCLE_COUNT
5466 emit_readword((int)&last_count,ECX);
5467 emit_add(HOST_CCREG,ECX,HOST_CCREG);
5468 emit_readword((int)&next_interupt,ECX);
5469 emit_writeword(HOST_CCREG,(int)&Count);
5470 emit_sub(HOST_CCREG,ECX,HOST_CCREG);
5471 emit_writeword(ECX,(int)&last_count);
5474 emit_storereg(CCREG,HOST_CCREG);
5475 emit_call((int)get_addr);
5476 emit_loadreg(CCREG,HOST_CCREG);
5477 emit_addimm(ESP,4,ESP);
5479 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5480 if(rt1[i]!=31&&i<slen-2&&(((u_int)out)&7)) emit_mov(13,13);
5484 void cjump_assemble(int i,struct regstat *i_regs)
5486 signed char *i_regmap=i_regs->regmap;
5489 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5490 assem_debug("match=%d\n",match);
5491 int s1h,s1l,s2h,s2l;
5492 int prev_cop1_usable=cop1_usable;
5493 int unconditional=0,nop=0;
5496 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5497 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5498 if(!match) invert=1;
5499 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5500 if(i>(ba[i]-start)>>2) invert=1;
5504 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5505 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5506 s2l=get_reg(branch_regs[i].regmap,rs2[i]);
5507 s2h=get_reg(branch_regs[i].regmap,rs2[i]|64);
5510 s1l=get_reg(i_regmap,rs1[i]);
5511 s1h=get_reg(i_regmap,rs1[i]|64);
5512 s2l=get_reg(i_regmap,rs2[i]);
5513 s2h=get_reg(i_regmap,rs2[i]|64);
5515 if(rs1[i]==0&&rs2[i]==0)
5517 if(opcode[i]&1) nop=1;
5518 else unconditional=1;
5519 //assert(opcode[i]!=5);
5520 //assert(opcode[i]!=7);
5521 //assert(opcode[i]!=0x15);
5522 //assert(opcode[i]!=0x17);
5528 only32=(regs[i].was32>>rs2[i])&1;
5533 only32=(regs[i].was32>>rs1[i])&1;
5536 only32=(regs[i].was32>>rs1[i])&(regs[i].was32>>rs2[i])&1;
5540 // Out of order execution (delay slot first)
5542 address_generation(i+1,i_regs,regs[i].regmap_entry);
5543 ds_assemble(i+1,i_regs);
5545 uint64_t bc_unneeded=branch_regs[i].u;
5546 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5547 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5548 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5550 bc_unneeded_upper|=1;
5551 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5552 bc_unneeded,bc_unneeded_upper);
5553 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
5554 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5555 cc=get_reg(branch_regs[i].regmap,CCREG);
5556 assert(cc==HOST_CCREG);
5558 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5559 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5560 //assem_debug("cycle count (adj)\n");
5562 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5563 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5564 if(adj) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
5565 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5567 assem_debug("branch: internal\n");
5569 assem_debug("branch: external\n");
5570 if(internal&&is_ds[(ba[i]-start)>>2]) {
5571 ds_assemble_entry(i);
5574 add_to_linker((int)out,ba[i],internal);
5577 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5578 if(((u_int)out)&7) emit_addnop(0);
5583 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),cc);
5586 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5589 int taken=0,nottaken=0,nottaken1=0;
5590 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5591 if(adj&&!invert) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
5595 if(opcode[i]==4) // BEQ
5597 if(s2h>=0) emit_cmp(s1h,s2h);
5598 else emit_test(s1h,s1h);
5602 if(opcode[i]==5) // BNE
5604 if(s2h>=0) emit_cmp(s1h,s2h);
5605 else emit_test(s1h,s1h);
5606 if(invert) taken=(int)out;
5607 else add_to_linker((int)out,ba[i],internal);
5610 if(opcode[i]==6) // BLEZ
5613 if(invert) taken=(int)out;
5614 else add_to_linker((int)out,ba[i],internal);
5619 if(opcode[i]==7) // BGTZ
5624 if(invert) taken=(int)out;
5625 else add_to_linker((int)out,ba[i],internal);
5630 //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]);
5632 if(opcode[i]==4) // BEQ
5634 if(s2l>=0) emit_cmp(s1l,s2l);
5635 else emit_test(s1l,s1l);
5640 add_to_linker((int)out,ba[i],internal);
5644 if(opcode[i]==5) // BNE
5646 if(s2l>=0) emit_cmp(s1l,s2l);
5647 else emit_test(s1l,s1l);
5652 add_to_linker((int)out,ba[i],internal);
5656 if(opcode[i]==6) // BLEZ
5663 add_to_linker((int)out,ba[i],internal);
5667 if(opcode[i]==7) // BGTZ
5674 add_to_linker((int)out,ba[i],internal);
5679 if(taken) set_jump_target(taken,(int)out);
5680 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5681 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
5683 emit_addimm(cc,-CLOCK_ADJUST(adj),cc);
5684 add_to_linker((int)out,ba[i],internal);
5687 add_to_linker((int)out,ba[i],internal*2);
5693 if(adj) emit_addimm(cc,-CLOCK_ADJUST(adj),cc);
5694 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5695 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5697 assem_debug("branch: internal\n");
5699 assem_debug("branch: external\n");
5700 if(internal&&is_ds[(ba[i]-start)>>2]) {
5701 ds_assemble_entry(i);
5704 add_to_linker((int)out,ba[i],internal);
5708 set_jump_target(nottaken,(int)out);
5711 if(nottaken1) set_jump_target(nottaken1,(int)out);
5713 if(!invert) emit_addimm(cc,CLOCK_ADJUST(adj),cc);
5715 } // (!unconditional)
5719 // In-order execution (branch first)
5720 //if(likely[i]) printf("IOL\n");
5723 int taken=0,nottaken=0,nottaken1=0;
5724 if(!unconditional&&!nop) {
5728 if((opcode[i]&0x2f)==4) // BEQ
5730 if(s2h>=0) emit_cmp(s1h,s2h);
5731 else emit_test(s1h,s1h);
5735 if((opcode[i]&0x2f)==5) // BNE
5737 if(s2h>=0) emit_cmp(s1h,s2h);
5738 else emit_test(s1h,s1h);
5742 if((opcode[i]&0x2f)==6) // BLEZ
5750 if((opcode[i]&0x2f)==7) // BGTZ
5760 //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]);
5762 if((opcode[i]&0x2f)==4) // BEQ
5764 if(s2l>=0) emit_cmp(s1l,s2l);
5765 else emit_test(s1l,s1l);
5769 if((opcode[i]&0x2f)==5) // BNE
5771 if(s2l>=0) emit_cmp(s1l,s2l);
5772 else emit_test(s1l,s1l);
5776 if((opcode[i]&0x2f)==6) // BLEZ
5782 if((opcode[i]&0x2f)==7) // BGTZ
5788 } // if(!unconditional)
5790 uint64_t ds_unneeded=branch_regs[i].u;
5791 uint64_t ds_unneeded_upper=branch_regs[i].uu;
5792 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
5793 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
5794 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
5796 ds_unneeded_upper|=1;
5799 if(taken) set_jump_target(taken,(int)out);
5800 assem_debug("1:\n");
5801 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5802 ds_unneeded,ds_unneeded_upper);
5804 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5805 address_generation(i+1,&branch_regs[i],0);
5806 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
5807 ds_assemble(i+1,&branch_regs[i]);
5808 cc=get_reg(branch_regs[i].regmap,CCREG);
5810 emit_loadreg(CCREG,cc=HOST_CCREG);
5811 // CHECK: Is the following instruction (fall thru) allocated ok?
5813 assert(cc==HOST_CCREG);
5814 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5815 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
5816 assem_debug("cycle count (adj)\n");
5817 if(adj) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
5818 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5820 assem_debug("branch: internal\n");
5822 assem_debug("branch: external\n");
5823 if(internal&&is_ds[(ba[i]-start)>>2]) {
5824 ds_assemble_entry(i);
5827 add_to_linker((int)out,ba[i],internal);
5832 cop1_usable=prev_cop1_usable;
5833 if(!unconditional) {
5834 if(nottaken1) set_jump_target(nottaken1,(int)out);
5835 set_jump_target(nottaken,(int)out);
5836 assem_debug("2:\n");
5838 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5839 ds_unneeded,ds_unneeded_upper);
5840 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
5841 address_generation(i+1,&branch_regs[i],0);
5842 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5843 ds_assemble(i+1,&branch_regs[i]);
5845 cc=get_reg(branch_regs[i].regmap,CCREG);
5846 if(cc==-1&&!likely[i]) {
5847 // Cycle count isn't in a register, temporarily load it then write it out
5848 emit_loadreg(CCREG,HOST_CCREG);
5849 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),HOST_CCREG);
5852 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5853 emit_storereg(CCREG,HOST_CCREG);
5856 cc=get_reg(i_regmap,CCREG);
5857 assert(cc==HOST_CCREG);
5858 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),cc);
5861 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
5867 void sjump_assemble(int i,struct regstat *i_regs)
5869 signed char *i_regmap=i_regs->regmap;
5872 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5873 assem_debug("smatch=%d\n",match);
5875 int prev_cop1_usable=cop1_usable;
5876 int unconditional=0,nevertaken=0;
5879 int internal=internal_branch(branch_regs[i].is32,ba[i]);
5880 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
5881 if(!match) invert=1;
5882 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5883 if(i>(ba[i]-start)>>2) invert=1;
5886 //if(opcode2[i]>=0x10) return; // FIXME (BxxZAL)
5887 //assert(opcode2[i]<0x10||rs1[i]==0); // FIXME (BxxZAL)
5890 s1l=get_reg(branch_regs[i].regmap,rs1[i]);
5891 s1h=get_reg(branch_regs[i].regmap,rs1[i]|64);
5894 s1l=get_reg(i_regmap,rs1[i]);
5895 s1h=get_reg(i_regmap,rs1[i]|64);
5899 if(opcode2[i]&1) unconditional=1;
5901 // These are never taken (r0 is never less than zero)
5902 //assert(opcode2[i]!=0);
5903 //assert(opcode2[i]!=2);
5904 //assert(opcode2[i]!=0x10);
5905 //assert(opcode2[i]!=0x12);
5908 only32=(regs[i].was32>>rs1[i])&1;
5912 // Out of order execution (delay slot first)
5914 address_generation(i+1,i_regs,regs[i].regmap_entry);
5915 ds_assemble(i+1,i_regs);
5917 uint64_t bc_unneeded=branch_regs[i].u;
5918 uint64_t bc_unneeded_upper=branch_regs[i].uu;
5919 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
5920 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
5922 bc_unneeded_upper|=1;
5923 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
5924 bc_unneeded,bc_unneeded_upper);
5925 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
5926 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
5928 int rt,return_address;
5929 rt=get_reg(branch_regs[i].regmap,31);
5930 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]);
5932 // Save the PC even if the branch is not taken
5933 return_address=start+i*4+8;
5934 emit_movimm(return_address,rt); // PC into link register
5936 if(!nevertaken) emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
5940 cc=get_reg(branch_regs[i].regmap,CCREG);
5941 assert(cc==HOST_CCREG);
5943 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5944 //do_cc(i,branch_regs[i].regmap,&adj,unconditional?ba[i]:-1,unconditional);
5945 assem_debug("cycle count (adj)\n");
5947 do_cc(i,branch_regs[i].regmap,&adj,ba[i],TAKEN,0);
5948 if(i!=(ba[i]-start)>>2 || source[i+1]!=0) {
5949 if(adj) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
5950 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
5952 assem_debug("branch: internal\n");
5954 assem_debug("branch: external\n");
5955 if(internal&&is_ds[(ba[i]-start)>>2]) {
5956 ds_assemble_entry(i);
5959 add_to_linker((int)out,ba[i],internal);
5962 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
5963 if(((u_int)out)&7) emit_addnop(0);
5967 else if(nevertaken) {
5968 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),cc);
5971 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
5975 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
5976 if(adj&&!invert) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
5980 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
5987 add_to_linker((int)out,ba[i],internal);
5991 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
5998 add_to_linker((int)out,ba[i],internal);
6006 if((opcode2[i]&0xf)==0) // BLTZ/BLTZAL
6013 add_to_linker((int)out,ba[i],internal);
6017 if((opcode2[i]&0xf)==1) // BGEZ/BLTZAL
6024 add_to_linker((int)out,ba[i],internal);
6031 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6032 if(match&&(!internal||!is_ds[(ba[i]-start)>>2])) {
6034 emit_addimm(cc,-CLOCK_ADJUST(adj),cc);
6035 add_to_linker((int)out,ba[i],internal);
6038 add_to_linker((int)out,ba[i],internal*2);
6044 if(adj) emit_addimm(cc,-CLOCK_ADJUST(adj),cc);
6045 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6046 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6048 assem_debug("branch: internal\n");
6050 assem_debug("branch: external\n");
6051 if(internal&&is_ds[(ba[i]-start)>>2]) {
6052 ds_assemble_entry(i);
6055 add_to_linker((int)out,ba[i],internal);
6059 set_jump_target(nottaken,(int)out);
6063 if(!invert) emit_addimm(cc,CLOCK_ADJUST(adj),cc);
6065 } // (!unconditional)
6069 // In-order execution (branch first)
6073 int rt,return_address;
6074 rt=get_reg(branch_regs[i].regmap,31);
6076 // Save the PC even if the branch is not taken
6077 return_address=start+i*4+8;
6078 emit_movimm(return_address,rt); // PC into link register
6080 emit_prefetch(hash_table[((return_address>>16)^return_address)&0xFFFF]);
6084 if(!unconditional) {
6085 //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]);
6089 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
6095 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
6105 if((opcode2[i]&0x0d)==0) // BLTZ/BLTZL/BLTZAL/BLTZALL
6111 if((opcode2[i]&0x0d)==1) // BGEZ/BGEZL/BGEZAL/BGEZALL
6118 } // if(!unconditional)
6120 uint64_t ds_unneeded=branch_regs[i].u;
6121 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6122 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6123 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6124 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6126 ds_unneeded_upper|=1;
6129 //assem_debug("1:\n");
6130 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6131 ds_unneeded,ds_unneeded_upper);
6133 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6134 address_generation(i+1,&branch_regs[i],0);
6135 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6136 ds_assemble(i+1,&branch_regs[i]);
6137 cc=get_reg(branch_regs[i].regmap,CCREG);
6139 emit_loadreg(CCREG,cc=HOST_CCREG);
6140 // CHECK: Is the following instruction (fall thru) allocated ok?
6142 assert(cc==HOST_CCREG);
6143 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6144 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6145 assem_debug("cycle count (adj)\n");
6146 if(adj) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
6147 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6149 assem_debug("branch: internal\n");
6151 assem_debug("branch: external\n");
6152 if(internal&&is_ds[(ba[i]-start)>>2]) {
6153 ds_assemble_entry(i);
6156 add_to_linker((int)out,ba[i],internal);
6161 cop1_usable=prev_cop1_usable;
6162 if(!unconditional) {
6163 set_jump_target(nottaken,(int)out);
6164 assem_debug("1:\n");
6166 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6167 ds_unneeded,ds_unneeded_upper);
6168 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6169 address_generation(i+1,&branch_regs[i],0);
6170 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6171 ds_assemble(i+1,&branch_regs[i]);
6173 cc=get_reg(branch_regs[i].regmap,CCREG);
6174 if(cc==-1&&!likely[i]) {
6175 // Cycle count isn't in a register, temporarily load it then write it out
6176 emit_loadreg(CCREG,HOST_CCREG);
6177 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),HOST_CCREG);
6180 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6181 emit_storereg(CCREG,HOST_CCREG);
6184 cc=get_reg(i_regmap,CCREG);
6185 assert(cc==HOST_CCREG);
6186 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),cc);
6189 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6195 void fjump_assemble(int i,struct regstat *i_regs)
6197 signed char *i_regmap=i_regs->regmap;
6200 match=match_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6201 assem_debug("fmatch=%d\n",match);
6205 int internal=internal_branch(branch_regs[i].is32,ba[i]);
6206 if(i==(ba[i]-start)>>2) assem_debug("idle loop\n");
6207 if(!match) invert=1;
6208 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6209 if(i>(ba[i]-start)>>2) invert=1;
6213 fs=get_reg(branch_regs[i].regmap,FSREG);
6214 address_generation(i+1,i_regs,regs[i].regmap_entry); // Is this okay?
6217 fs=get_reg(i_regmap,FSREG);
6220 // Check cop1 unusable
6222 cs=get_reg(i_regmap,CSREG);
6224 emit_testimm(cs,0x20000000);
6227 add_stub(FP_STUB,eaddr,(int)out,i,cs,(int)i_regs,0,0);
6232 // Out of order execution (delay slot first)
6234 ds_assemble(i+1,i_regs);
6236 uint64_t bc_unneeded=branch_regs[i].u;
6237 uint64_t bc_unneeded_upper=branch_regs[i].uu;
6238 bc_unneeded&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6239 bc_unneeded_upper&=~((1LL<<us1[i])|(1LL<<us2[i]));
6241 bc_unneeded_upper|=1;
6242 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6243 bc_unneeded,bc_unneeded_upper);
6244 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i],rs1[i]);
6245 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6246 cc=get_reg(branch_regs[i].regmap,CCREG);
6247 assert(cc==HOST_CCREG);
6248 do_cc(i,branch_regs[i].regmap,&adj,-1,0,invert);
6249 assem_debug("cycle count (adj)\n");
6252 if(adj&&!invert) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
6255 emit_testimm(fs,0x800000);
6256 if(source[i]&0x10000) // BC1T
6262 add_to_linker((int)out,ba[i],internal);
6271 add_to_linker((int)out,ba[i],internal);
6279 if(adj) emit_addimm(cc,-CLOCK_ADJUST(adj),cc);
6280 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
6281 else if(match) emit_addnop(13);
6283 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6284 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6286 assem_debug("branch: internal\n");
6288 assem_debug("branch: external\n");
6289 if(internal&&is_ds[(ba[i]-start)>>2]) {
6290 ds_assemble_entry(i);
6293 add_to_linker((int)out,ba[i],internal);
6296 set_jump_target(nottaken,(int)out);
6300 if(!invert) emit_addimm(cc,CLOCK_ADJUST(adj),cc);
6302 } // (!unconditional)
6306 // In-order execution (branch first)
6310 //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]);
6313 emit_testimm(fs,0x800000);
6314 if(source[i]&0x10000) // BC1T
6325 } // if(!unconditional)
6327 uint64_t ds_unneeded=branch_regs[i].u;
6328 uint64_t ds_unneeded_upper=branch_regs[i].uu;
6329 ds_unneeded&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6330 ds_unneeded_upper&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6331 if((~ds_unneeded_upper>>rt1[i+1])&1) ds_unneeded_upper&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
6333 ds_unneeded_upper|=1;
6335 //assem_debug("1:\n");
6336 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6337 ds_unneeded,ds_unneeded_upper);
6339 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6340 address_generation(i+1,&branch_regs[i],0);
6341 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,INVCP);
6342 ds_assemble(i+1,&branch_regs[i]);
6343 cc=get_reg(branch_regs[i].regmap,CCREG);
6345 emit_loadreg(CCREG,cc=HOST_CCREG);
6346 // CHECK: Is the following instruction (fall thru) allocated ok?
6348 assert(cc==HOST_CCREG);
6349 store_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6350 do_cc(i,i_regmap,&adj,ba[i],TAKEN,0);
6351 assem_debug("cycle count (adj)\n");
6352 if(adj) emit_addimm(cc,CLOCK_ADJUST(ccadj[i]+2-adj),cc);
6353 load_regs_bt(branch_regs[i].regmap,branch_regs[i].is32,branch_regs[i].dirty,ba[i]);
6355 assem_debug("branch: internal\n");
6357 assem_debug("branch: external\n");
6358 if(internal&&is_ds[(ba[i]-start)>>2]) {
6359 ds_assemble_entry(i);
6362 add_to_linker((int)out,ba[i],internal);
6367 if(1) { // <- FIXME (don't need this)
6368 set_jump_target(nottaken,(int)out);
6369 assem_debug("1:\n");
6371 wb_invalidate(regs[i].regmap,branch_regs[i].regmap,regs[i].dirty,regs[i].is32,
6372 ds_unneeded,ds_unneeded_upper);
6373 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,rs1[i+1],rs2[i+1]);
6374 address_generation(i+1,&branch_regs[i],0);
6375 load_regs(regs[i].regmap,branch_regs[i].regmap,regs[i].was32,CCREG,CCREG);
6376 ds_assemble(i+1,&branch_regs[i]);
6378 cc=get_reg(branch_regs[i].regmap,CCREG);
6379 if(cc==-1&&!likely[i]) {
6380 // Cycle count isn't in a register, temporarily load it then write it out
6381 emit_loadreg(CCREG,HOST_CCREG);
6382 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),HOST_CCREG);
6385 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,NOTTAKEN,0);
6386 emit_storereg(CCREG,HOST_CCREG);
6389 cc=get_reg(i_regmap,CCREG);
6390 assert(cc==HOST_CCREG);
6391 emit_addimm_and_set_flags(CLOCK_ADJUST(ccadj[i]+2),cc);
6394 add_stub(CC_STUB,jaddr,(int)out,0,i,start+i*4+8,likely[i]?NULLDS:NOTTAKEN,0);
6400 static void pagespan_assemble(int i,struct regstat *i_regs)
6402 int s1l=get_reg(i_regs->regmap,rs1[i]);
6403 int s1h=get_reg(i_regs->regmap,rs1[i]|64);
6404 int s2l=get_reg(i_regs->regmap,rs2[i]);
6405 int s2h=get_reg(i_regs->regmap,rs2[i]|64);
6406 void *nt_branch=NULL;
6409 int unconditional=0;
6419 if((i_regs->is32>>rs1[i])&(i_regs->is32>>rs2[i])&1) {
6423 int addr,alt,ntaddr;
6424 if(i_regs->regmap[HOST_BTREG]<0) {addr=HOST_BTREG;}
6428 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG &&
6429 (i_regs->regmap[hr]&63)!=rs1[i] &&
6430 (i_regs->regmap[hr]&63)!=rs2[i] )
6439 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6440 (i_regs->regmap[hr]&63)!=rs1[i] &&
6441 (i_regs->regmap[hr]&63)!=rs2[i] )
6447 if((opcode[i]&0x2E)==6) // BLEZ/BGTZ needs another register
6451 if(hr!=EXCLUDE_REG && hr!=HOST_CCREG && hr!=HOST_BTREG &&
6452 (i_regs->regmap[hr]&63)!=rs1[i] &&
6453 (i_regs->regmap[hr]&63)!=rs2[i] )
6460 assert(hr<HOST_REGS);
6461 if((opcode[i]&0x2e)==4||opcode[i]==0x11) { // BEQ/BNE/BEQL/BNEL/BC1
6462 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
6464 emit_addimm(HOST_CCREG,CLOCK_ADJUST(ccadj[i]+2),HOST_CCREG);
6465 if(opcode[i]==2) // J
6469 if(opcode[i]==3) // JAL
6472 int rt=get_reg(i_regs->regmap,31);
6473 emit_movimm(start+i*4+8,rt);
6476 if(opcode[i]==0&&(opcode2[i]&0x3E)==8) // JR/JALR
6479 if(opcode2[i]==9) // JALR
6481 int rt=get_reg(i_regs->regmap,rt1[i]);
6482 emit_movimm(start+i*4+8,rt);
6485 if((opcode[i]&0x3f)==4) // BEQ
6492 #ifdef HAVE_CMOV_IMM
6494 if(s2l>=0) emit_cmp(s1l,s2l);
6495 else emit_test(s1l,s1l);
6496 emit_cmov2imm_e_ne_compact(ba[i],start+i*4+8,addr);
6502 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6504 if(s2h>=0) emit_cmp(s1h,s2h);
6505 else emit_test(s1h,s1h);
6506 emit_cmovne_reg(alt,addr);
6508 if(s2l>=0) emit_cmp(s1l,s2l);
6509 else emit_test(s1l,s1l);
6510 emit_cmovne_reg(alt,addr);
6513 if((opcode[i]&0x3f)==5) // BNE
6515 #ifdef HAVE_CMOV_IMM
6517 if(s2l>=0) emit_cmp(s1l,s2l);
6518 else emit_test(s1l,s1l);
6519 emit_cmov2imm_e_ne_compact(start+i*4+8,ba[i],addr);
6525 emit_mov2imm_compact(start+i*4+8,addr,ba[i],alt);
6527 if(s2h>=0) emit_cmp(s1h,s2h);
6528 else emit_test(s1h,s1h);
6529 emit_cmovne_reg(alt,addr);
6531 if(s2l>=0) emit_cmp(s1l,s2l);
6532 else emit_test(s1l,s1l);
6533 emit_cmovne_reg(alt,addr);
6536 if((opcode[i]&0x3f)==0x14) // BEQL
6539 if(s2h>=0) emit_cmp(s1h,s2h);
6540 else emit_test(s1h,s1h);
6544 if(s2l>=0) emit_cmp(s1l,s2l);
6545 else emit_test(s1l,s1l);
6546 if(nottaken) set_jump_target(nottaken,(int)out);
6550 if((opcode[i]&0x3f)==0x15) // BNEL
6553 if(s2h>=0) emit_cmp(s1h,s2h);
6554 else emit_test(s1h,s1h);
6558 if(s2l>=0) emit_cmp(s1l,s2l);
6559 else emit_test(s1l,s1l);
6562 if(taken) set_jump_target(taken,(int)out);
6564 if((opcode[i]&0x3f)==6) // BLEZ
6566 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6568 if(s1h>=0) emit_mov(addr,ntaddr);
6569 emit_cmovl_reg(alt,addr);
6572 emit_cmovne_reg(ntaddr,addr);
6573 emit_cmovs_reg(alt,addr);
6576 if((opcode[i]&0x3f)==7) // BGTZ
6578 emit_mov2imm_compact(ba[i],addr,start+i*4+8,ntaddr);
6580 if(s1h>=0) emit_mov(addr,alt);
6581 emit_cmovl_reg(ntaddr,addr);
6584 emit_cmovne_reg(alt,addr);
6585 emit_cmovs_reg(ntaddr,addr);
6588 if((opcode[i]&0x3f)==0x16) // BLEZL
6590 assert((opcode[i]&0x3f)!=0x16);
6592 if((opcode[i]&0x3f)==0x17) // BGTZL
6594 assert((opcode[i]&0x3f)!=0x17);
6596 assert(opcode[i]!=1); // BLTZ/BGEZ
6598 //FIXME: Check CSREG
6599 if(opcode[i]==0x11 && opcode2[i]==0x08 ) {
6600 if((source[i]&0x30000)==0) // BC1F
6602 emit_mov2imm_compact(ba[i],addr,start+i*4+8,alt);
6603 emit_testimm(s1l,0x800000);
6604 emit_cmovne_reg(alt,addr);
6606 if((source[i]&0x30000)==0x10000) // BC1T
6608 emit_mov2imm_compact(ba[i],alt,start+i*4+8,addr);
6609 emit_testimm(s1l,0x800000);
6610 emit_cmovne_reg(alt,addr);
6612 if((source[i]&0x30000)==0x20000) // BC1FL
6614 emit_testimm(s1l,0x800000);
6618 if((source[i]&0x30000)==0x30000) // BC1TL
6620 emit_testimm(s1l,0x800000);
6626 assert(i_regs->regmap[HOST_CCREG]==CCREG);
6627 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6628 if(likely[i]||unconditional)
6630 emit_movimm(ba[i],HOST_BTREG);
6632 else if(addr!=HOST_BTREG)
6634 emit_mov(addr,HOST_BTREG);
6636 void *branch_addr=out;
6638 int target_addr=start+i*4+5;
6640 void *compiled_target_addr=check_addr(target_addr);
6641 emit_extjump_ds((int)branch_addr,target_addr);
6642 if(compiled_target_addr) {
6643 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6644 add_link(target_addr,stub);
6646 else set_jump_target((int)branch_addr,(int)stub);
6649 set_jump_target((int)nottaken,(int)out);
6650 wb_dirtys(regs[i].regmap,regs[i].is32,regs[i].dirty);
6651 void *branch_addr=out;
6653 int target_addr=start+i*4+8;
6655 void *compiled_target_addr=check_addr(target_addr);
6656 emit_extjump_ds((int)branch_addr,target_addr);
6657 if(compiled_target_addr) {
6658 set_jump_target((int)branch_addr,(int)compiled_target_addr);
6659 add_link(target_addr,stub);
6661 else set_jump_target((int)branch_addr,(int)stub);
6665 // Assemble the delay slot for the above
6666 static void pagespan_ds()
6668 assem_debug("initial delay slot:\n");
6669 u_int vaddr=start+1;
6670 u_int page=get_page(vaddr);
6671 u_int vpage=get_vpage(vaddr);
6672 ll_add(jump_dirty+vpage,vaddr,(void *)out);
6674 ll_add(jump_in+page,vaddr,(void *)out);
6675 assert(regs[0].regmap_entry[HOST_CCREG]==CCREG);
6676 if(regs[0].regmap[HOST_CCREG]!=CCREG)
6677 wb_register(CCREG,regs[0].regmap_entry,regs[0].wasdirty,regs[0].was32);
6678 if(regs[0].regmap[HOST_BTREG]!=BTREG)
6679 emit_writeword(HOST_BTREG,(int)&branch_target);
6680 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,rs1[0],rs2[0]);
6681 address_generation(0,®s[0],regs[0].regmap_entry);
6682 if(itype[0]==STORE||itype[0]==STORELR||(opcode[0]&0x3b)==0x39||(opcode[0]&0x3b)==0x3a)
6683 load_regs(regs[0].regmap_entry,regs[0].regmap,regs[0].was32,INVCP,INVCP);
6688 alu_assemble(0,®s[0]);break;
6690 imm16_assemble(0,®s[0]);break;
6692 shift_assemble(0,®s[0]);break;
6694 shiftimm_assemble(0,®s[0]);break;
6696 load_assemble(0,®s[0]);break;
6698 loadlr_assemble(0,®s[0]);break;
6700 store_assemble(0,®s[0]);break;
6702 storelr_assemble(0,®s[0]);break;
6704 cop0_assemble(0,®s[0]);break;
6706 cop1_assemble(0,®s[0]);break;
6708 c1ls_assemble(0,®s[0]);break;
6710 cop2_assemble(0,®s[0]);break;
6712 c2ls_assemble(0,®s[0]);break;
6714 c2op_assemble(0,®s[0]);break;
6716 fconv_assemble(0,®s[0]);break;
6718 float_assemble(0,®s[0]);break;
6720 fcomp_assemble(0,®s[0]);break;
6722 multdiv_assemble(0,®s[0]);break;
6724 mov_assemble(0,®s[0]);break;
6734 SysPrintf("Jump in the delay slot. This is probably a bug.\n");
6736 int btaddr=get_reg(regs[0].regmap,BTREG);
6738 btaddr=get_reg(regs[0].regmap,-1);
6739 emit_readword((int)&branch_target,btaddr);
6741 assert(btaddr!=HOST_CCREG);
6742 if(regs[0].regmap[HOST_CCREG]!=CCREG) emit_loadreg(CCREG,HOST_CCREG);
6744 emit_movimm(start+4,HOST_TEMPREG);
6745 emit_cmp(btaddr,HOST_TEMPREG);
6747 emit_cmpimm(btaddr,start+4);
6749 int branch=(int)out;
6751 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,-1);
6752 emit_jmp(jump_vaddr_reg[btaddr]);
6753 set_jump_target(branch,(int)out);
6754 store_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6755 load_regs_bt(regs[0].regmap,regs[0].is32,regs[0].dirty,start+4);
6758 // Basic liveness analysis for MIPS registers
6759 void unneeded_registers(int istart,int iend,int r)
6762 uint64_t u,uu,gte_u,b,bu,gte_bu;
6763 uint64_t temp_u,temp_uu,temp_gte_u=0;
6765 uint64_t gte_u_unknown=0;
6766 if(new_dynarec_hacks&NDHACK_GTE_UNNEEDED)
6770 gte_u=gte_u_unknown;
6772 u=unneeded_reg[iend+1];
6773 uu=unneeded_reg_upper[iend+1];
6775 gte_u=gte_unneeded[iend+1];
6778 for (i=iend;i>=istart;i--)
6780 //printf("unneeded registers i=%d (%d,%d) r=%d\n",i,istart,iend,r);
6781 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
6783 // If subroutine call, flag return address as a possible branch target
6784 if(rt1[i]==31 && i<slen-2) bt[i+2]=1;
6786 if(ba[i]<start || ba[i]>=(start+slen*4))
6788 // Branch out of this block, flush all regs
6791 gte_u=gte_u_unknown;
6793 if(itype[i]==UJUMP&&rt1[i]==31)
6795 uu=u=0x300C00F; // Discard at, v0-v1, t6-t9
6797 if(itype[i]==RJUMP&&rs1[i]==31)
6799 uu=u=0x300C0F3; // Discard at, a0-a3, t6-t9
6801 if(start>0x80000400&&start<0x80000000+RAM_SIZE) {
6802 if(itype[i]==UJUMP&&rt1[i]==31)
6804 //uu=u=0x30300FF0FLL; // Discard at, v0-v1, t0-t9, lo, hi
6805 uu=u=0x300FF0F; // Discard at, v0-v1, t0-t9
6807 if(itype[i]==RJUMP&&rs1[i]==31)
6809 //uu=u=0x30300FFF3LL; // Discard at, a0-a3, t0-t9, lo, hi
6810 uu=u=0x300FFF3; // Discard at, a0-a3, t0-t9
6813 branch_unneeded_reg[i]=u;
6814 branch_unneeded_reg_upper[i]=uu;
6815 // Merge in delay slot
6816 tdep=(~uu>>rt1[i+1])&1;
6817 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6818 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6819 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6820 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6821 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6824 gte_u&=~gte_rs[i+1];
6825 // If branch is "likely" (and conditional)
6826 // then we skip the delay slot on the fall-thru path
6829 u&=unneeded_reg[i+2];
6830 uu&=unneeded_reg_upper[i+2];
6831 gte_u&=gte_unneeded[i+2];
6837 gte_u=gte_u_unknown;
6843 // Internal branch, flag target
6844 bt[(ba[i]-start)>>2]=1;
6845 if(ba[i]<=start+i*4) {
6847 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6849 // Unconditional branch
6853 // Conditional branch (not taken case)
6854 temp_u=unneeded_reg[i+2];
6855 temp_uu=unneeded_reg_upper[i+2];
6856 temp_gte_u&=gte_unneeded[i+2];
6858 // Merge in delay slot
6859 tdep=(~temp_uu>>rt1[i+1])&1;
6860 temp_u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6861 temp_uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6862 temp_u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6863 temp_uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6864 temp_uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6865 temp_u|=1;temp_uu|=1;
6866 temp_gte_u|=gte_rt[i+1];
6867 temp_gte_u&=~gte_rs[i+1];
6868 // If branch is "likely" (and conditional)
6869 // then we skip the delay slot on the fall-thru path
6872 temp_u&=unneeded_reg[i+2];
6873 temp_uu&=unneeded_reg_upper[i+2];
6874 temp_gte_u&=gte_unneeded[i+2];
6880 temp_gte_u=gte_u_unknown;
6883 tdep=(~temp_uu>>rt1[i])&1;
6884 temp_u|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6885 temp_uu|=(1LL<<rt1[i])|(1LL<<rt2[i]);
6886 temp_u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
6887 temp_uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
6888 temp_uu&=~((tdep<<dep1[i])|(tdep<<dep2[i]));
6889 temp_u|=1;temp_uu|=1;
6890 temp_gte_u|=gte_rt[i];
6891 temp_gte_u&=~gte_rs[i];
6892 unneeded_reg[i]=temp_u;
6893 unneeded_reg_upper[i]=temp_uu;
6894 gte_unneeded[i]=temp_gte_u;
6895 // Only go three levels deep. This recursion can take an
6896 // excessive amount of time if there are a lot of nested loops.
6898 unneeded_registers((ba[i]-start)>>2,i-1,r+1);
6900 unneeded_reg[(ba[i]-start)>>2]=1;
6901 unneeded_reg_upper[(ba[i]-start)>>2]=1;
6902 gte_unneeded[(ba[i]-start)>>2]=gte_u_unknown;
6905 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
6907 // Unconditional branch
6908 u=unneeded_reg[(ba[i]-start)>>2];
6909 uu=unneeded_reg_upper[(ba[i]-start)>>2];
6910 gte_u=gte_unneeded[(ba[i]-start)>>2];
6911 branch_unneeded_reg[i]=u;
6912 branch_unneeded_reg_upper[i]=uu;
6915 //branch_unneeded_reg[i]=u;
6916 //branch_unneeded_reg_upper[i]=uu;
6917 // Merge in delay slot
6918 tdep=(~uu>>rt1[i+1])&1;
6919 u|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6920 uu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6921 u&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6922 uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6923 uu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6926 gte_u&=~gte_rs[i+1];
6928 // Conditional branch
6929 b=unneeded_reg[(ba[i]-start)>>2];
6930 bu=unneeded_reg_upper[(ba[i]-start)>>2];
6931 gte_bu=gte_unneeded[(ba[i]-start)>>2];
6932 branch_unneeded_reg[i]=b;
6933 branch_unneeded_reg_upper[i]=bu;
6936 //branch_unneeded_reg[i]=b;
6937 //branch_unneeded_reg_upper[i]=bu;
6938 // Branch delay slot
6939 tdep=(~uu>>rt1[i+1])&1;
6940 b|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6941 bu|=(1LL<<rt1[i+1])|(1LL<<rt2[i+1]);
6942 b&=~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
6943 bu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
6944 bu&=~((tdep<<dep1[i+1])|(tdep<<dep2[i+1]));
6946 gte_bu|=gte_rt[i+1];
6947 gte_bu&=~gte_rs[i+1];
6948 // If branch is "likely" then we skip the
6949 // delay slot on the fall-thru path
6955 u&=unneeded_reg[i+2];
6956 uu&=unneeded_reg_upper[i+2];
6957 gte_u&=gte_unneeded[i+2];
6969 branch_unneeded_reg[i]&=unneeded_reg[i+2];
6970 branch_unneeded_reg_upper[i]&=unneeded_reg_upper[i+2];
6971 //branch_unneeded_reg[i]=1;
6972 //branch_unneeded_reg_upper[i]=1;
6974 branch_unneeded_reg[i]=1;
6975 branch_unneeded_reg_upper[i]=1;
6981 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
6983 // SYSCALL instruction (software interrupt)
6987 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
6989 // ERET instruction (return from interrupt)
6994 tdep=(~uu>>rt1[i])&1;
6995 // Written registers are unneeded
7001 // Accessed registers are needed
7007 if(gte_rs[i]&&rt1[i]&&(unneeded_reg[i+1]&(1ll<<rt1[i])))
7008 gte_u|=gte_rs[i]>e_unneeded[i+1]; // MFC2/CFC2 to dead register, unneeded
7009 // Source-target dependencies
7010 uu&=~(tdep<<dep1[i]);
7011 uu&=~(tdep<<dep2[i]);
7012 // R0 is always unneeded
7016 unneeded_reg_upper[i]=uu;
7017 gte_unneeded[i]=gte_u;
7019 printf("ur (%d,%d) %x: ",istart,iend,start+i*4);
7022 for(r=1;r<=CCREG;r++) {
7023 if((unneeded_reg[i]>>r)&1) {
7024 if(r==HIREG) printf(" HI");
7025 else if(r==LOREG) printf(" LO");
7026 else printf(" r%d",r);
7030 for(r=1;r<=CCREG;r++) {
7031 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
7032 if(r==HIREG) printf(" HI");
7033 else if(r==LOREG) printf(" LO");
7034 else printf(" r%d",r);
7040 for (i=iend;i>=istart;i--)
7042 unneeded_reg_upper[i]=branch_unneeded_reg_upper[i]=-1LL;
7047 // Identify registers which are likely to contain 32-bit values
7048 // This is used to predict whether any branches will jump to a
7049 // location with 64-bit values in registers.
7050 static void provisional_32bit()
7054 uint64_t lastbranch=1;
7059 if(itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP) {
7060 if(i>1) is32=lastbranch;
7066 if(itype[i-2]==CJUMP||itype[i-2]==SJUMP||itype[i-2]==FJUMP) {
7068 if(i>2) is32=lastbranch;
7072 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
7074 if(rs1[i-2]==0||rs2[i-2]==0)
7077 is32|=1LL<<rs1[i-2];
7080 is32|=1LL<<rs2[i-2];
7085 // If something jumps here with 64-bit values
7086 // then promote those registers to 64 bits
7089 uint64_t temp_is32=is32;
7092 if(ba[j]==start+i*4)
7093 //temp_is32&=branch_regs[j].is32;
7098 if(ba[j]==start+i*4)
7109 if(type==UJUMP||type==RJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
7110 // Branches don't write registers, consider the delay slot instead.
7121 if(opcode[i]==0x27||opcode[i]==0x37|| // LWU/LD
7122 opcode[i]==0x1A||opcode[i]==0x1B) // LDL/LDR
7131 if(op==0x1a||op==0x1b) is32&=~(1LL<<rt); // LDR/LDL
7132 if(op==0x22) is32|=1LL<<rt; // LWL
7135 if (op==0x08||op==0x09|| // ADDI/ADDIU
7136 op==0x0a||op==0x0b|| // SLTI/SLTIU
7142 if(op==0x18||op==0x19) { // DADDI/DADDIU
7145 // is32|=((is32>>s1)&1LL)<<rt;
7147 if(op==0x0d||op==0x0e) { // ORI/XORI
7148 uint64_t sr=((is32>>s1)&1LL);
7164 if(op2>=0x20&&op2<=0x23) { // ADD/ADDU/SUB/SUBU
7167 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
7170 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
7171 uint64_t sr=((is32>>s1)&(is32>>s2)&1LL);
7175 else if(op2>=0x2c&&op2<=0x2d) { // DADD/DADDU
7180 uint64_t sr=((is32>>s1)&1LL);
7185 uint64_t sr=((is32>>s2)&1LL);
7193 else if(op2>=0x2e&&op2<=0x2f) { // DSUB/DSUBU
7198 uint64_t sr=((is32>>s1)&1LL);
7208 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
7209 is32&=~((1LL<<HIREG)|(1LL<<LOREG));
7212 is32|=(1LL<<HIREG)|(1LL<<LOREG);
7217 uint64_t sr=((is32>>s1)&1LL);
7223 if(op2>=0x14&&op2<=0x17) is32&=~(1LL<<rt); // DSLLV/DSRLV/DSRAV
7224 else is32|=1LL<<rt; // SLLV/SRLV/SRAV
7228 // DSLL/DSRL/DSRA/DSLL32/DSRL32 but not DSRA32 have 64-bit result
7229 if(op2>=0x38&&op2<0x3f) is32&=~(1LL<<rt);
7232 if(op2==0) is32|=1LL<<rt; // MFC0
7236 if(op2==0) is32|=1LL<<rt; // MFC1
7237 if(op2==1) is32&=~(1LL<<rt); // DMFC1
7238 if(op2==2) is32|=1LL<<rt; // CFC1
7260 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
7262 if(rt1[i-1]==31) // JAL/JALR
7264 // Subroutine call will return here, don't alloc any registers
7269 // Internal branch will jump here, match registers to caller
7277 // Identify registers which may be assumed to contain 32-bit values
7278 // and where optimizations will rely on this.
7279 // This is used to determine whether backward branches can safely
7280 // jump to a location with 64-bit values in registers.
7281 static void provisional_r32()
7286 for (i=slen-1;i>=0;i--)
7289 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7291 if(ba[i]<start || ba[i]>=(start+slen*4))
7293 // Branch out of this block, don't need anything
7299 // Need whatever matches the target
7300 // (and doesn't get overwritten by the delay slot instruction)
7302 int t=(ba[i]-start)>>2;
7303 if(ba[i]>start+i*4) {
7305 //if(!(requires_32bit[t]&~regs[i].was32))
7306 // r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7307 if(!(pr32[t]&~regs[i].was32))
7308 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7311 if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
7312 r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
7315 // Conditional branch may need registers for following instructions
7316 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
7319 //r32|=requires_32bit[i+2];
7322 // Mark this address as a branch target since it may be called
7323 // upon return from interrupt
7327 // Merge in delay slot
7329 // These are overwritten unless the branch is "likely"
7330 // and the delay slot is nullified if not taken
7331 r32&=~(1LL<<rt1[i+1]);
7332 r32&=~(1LL<<rt2[i+1]);
7334 // Assume these are needed (delay slot)
7337 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
7341 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
7343 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
7345 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
7347 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
7349 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
7352 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7354 // SYSCALL instruction (software interrupt)
7357 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7359 // ERET instruction (return from interrupt)
7363 r32&=~(1LL<<rt1[i]);
7364 r32&=~(1LL<<rt2[i]);
7367 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
7371 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
7373 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
7375 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
7377 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
7379 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
7381 //requires_32bit[i]=r32;
7384 // Dirty registers which are 32-bit, require 32-bit input
7385 // as they will be written as 32-bit values
7386 for(hr=0;hr<HOST_REGS;hr++)
7388 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
7389 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
7390 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
7391 pr32[i]|=1LL<<regs[i].regmap_entry[hr];
7392 //requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
7399 // Write back dirty registers as soon as we will no longer modify them,
7400 // so that we don't end up with lots of writes at the branches.
7401 void clean_registers(int istart,int iend,int wr)
7405 u_int will_dirty_i,will_dirty_next,temp_will_dirty;
7406 u_int wont_dirty_i,wont_dirty_next,temp_wont_dirty;
7408 will_dirty_i=will_dirty_next=0;
7409 wont_dirty_i=wont_dirty_next=0;
7411 will_dirty_i=will_dirty_next=will_dirty[iend+1];
7412 wont_dirty_i=wont_dirty_next=wont_dirty[iend+1];
7414 for (i=iend;i>=istart;i--)
7416 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7418 if(ba[i]<start || ba[i]>=(start+slen*4))
7420 // Branch out of this block, flush all regs
7421 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7423 // Unconditional branch
7426 // Merge in delay slot (will dirty)
7427 for(r=0;r<HOST_REGS;r++) {
7428 if(r!=EXCLUDE_REG) {
7429 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7430 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7431 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7432 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7433 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7434 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7435 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7436 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7437 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7438 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7439 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7440 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7441 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7442 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7448 // Conditional branch
7450 wont_dirty_i=wont_dirty_next;
7451 // Merge in delay slot (will dirty)
7452 for(r=0;r<HOST_REGS;r++) {
7453 if(r!=EXCLUDE_REG) {
7455 // Might not dirty if likely branch is not taken
7456 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7457 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7458 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7459 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7460 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7461 if(branch_regs[i].regmap[r]==0) will_dirty_i&=~(1<<r);
7462 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7463 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7464 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7465 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7466 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7467 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7468 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7469 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7474 // Merge in delay slot (wont dirty)
7475 for(r=0;r<HOST_REGS;r++) {
7476 if(r!=EXCLUDE_REG) {
7477 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7478 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7479 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7480 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7481 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7482 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7483 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7484 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7485 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7486 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7490 #ifndef DESTRUCTIVE_WRITEBACK
7491 branch_regs[i].dirty&=wont_dirty_i;
7493 branch_regs[i].dirty|=will_dirty_i;
7499 if(ba[i]<=start+i*4) {
7501 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7503 // Unconditional branch
7506 // Merge in delay slot (will dirty)
7507 for(r=0;r<HOST_REGS;r++) {
7508 if(r!=EXCLUDE_REG) {
7509 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7510 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7511 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7512 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7513 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7514 if(branch_regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7515 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7516 if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7517 if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7518 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7519 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7520 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7521 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7522 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7526 // Conditional branch (not taken case)
7527 temp_will_dirty=will_dirty_next;
7528 temp_wont_dirty=wont_dirty_next;
7529 // Merge in delay slot (will dirty)
7530 for(r=0;r<HOST_REGS;r++) {
7531 if(r!=EXCLUDE_REG) {
7533 // Will not dirty if likely branch is not taken
7534 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7535 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7536 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7537 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7538 if((branch_regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7539 if(branch_regs[i].regmap[r]==0) temp_will_dirty&=~(1<<r);
7540 if(branch_regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7541 //if((regs[i].regmap[r]&63)==rt1[i]) temp_will_dirty|=1<<r;
7542 //if((regs[i].regmap[r]&63)==rt2[i]) temp_will_dirty|=1<<r;
7543 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_will_dirty|=1<<r;
7544 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_will_dirty|=1<<r;
7545 if((regs[i].regmap[r]&63)>33) temp_will_dirty&=~(1<<r);
7546 if(regs[i].regmap[r]<=0) temp_will_dirty&=~(1<<r);
7547 if(regs[i].regmap[r]==CCREG) temp_will_dirty|=1<<r;
7552 // Merge in delay slot (wont dirty)
7553 for(r=0;r<HOST_REGS;r++) {
7554 if(r!=EXCLUDE_REG) {
7555 if((regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7556 if((regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7557 if((regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7558 if((regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7559 if(regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7560 if((branch_regs[i].regmap[r]&63)==rt1[i]) temp_wont_dirty|=1<<r;
7561 if((branch_regs[i].regmap[r]&63)==rt2[i]) temp_wont_dirty|=1<<r;
7562 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) temp_wont_dirty|=1<<r;
7563 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) temp_wont_dirty|=1<<r;
7564 if(branch_regs[i].regmap[r]==CCREG) temp_wont_dirty|=1<<r;
7567 // Deal with changed mappings
7569 for(r=0;r<HOST_REGS;r++) {
7570 if(r!=EXCLUDE_REG) {
7571 if(regs[i].regmap[r]!=regmap_pre[i][r]) {
7572 temp_will_dirty&=~(1<<r);
7573 temp_wont_dirty&=~(1<<r);
7574 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7575 temp_will_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7576 temp_wont_dirty|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7578 temp_will_dirty|=1<<r;
7579 temp_wont_dirty|=1<<r;
7586 will_dirty[i]=temp_will_dirty;
7587 wont_dirty[i]=temp_wont_dirty;
7588 clean_registers((ba[i]-start)>>2,i-1,0);
7590 // Limit recursion. It can take an excessive amount
7591 // of time if there are a lot of nested loops.
7592 will_dirty[(ba[i]-start)>>2]=0;
7593 wont_dirty[(ba[i]-start)>>2]=-1;
7598 if(itype[i]==RJUMP||itype[i]==UJUMP||(source[i]>>16)==0x1000)
7600 // Unconditional branch
7603 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7604 for(r=0;r<HOST_REGS;r++) {
7605 if(r!=EXCLUDE_REG) {
7606 if(branch_regs[i].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7607 will_dirty_i|=will_dirty[(ba[i]-start)>>2]&(1<<r);
7608 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7610 if(branch_regs[i].regmap[r]>=0) {
7611 will_dirty_i|=((unneeded_reg[(ba[i]-start)>>2]>>(branch_regs[i].regmap[r]&63))&1)<<r;
7612 wont_dirty_i|=((unneeded_reg[(ba[i]-start)>>2]>>(branch_regs[i].regmap[r]&63))&1)<<r;
7617 // Merge in delay slot
7618 for(r=0;r<HOST_REGS;r++) {
7619 if(r!=EXCLUDE_REG) {
7620 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7621 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7622 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7623 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7624 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7625 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7626 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7627 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7628 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7629 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7630 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7631 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7632 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7633 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7637 // Conditional branch
7638 will_dirty_i=will_dirty_next;
7639 wont_dirty_i=wont_dirty_next;
7640 //if(ba[i]>start+i*4) { // Disable recursion (for debugging)
7641 for(r=0;r<HOST_REGS;r++) {
7642 if(r!=EXCLUDE_REG) {
7643 signed char target_reg=branch_regs[i].regmap[r];
7644 if(target_reg==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7645 will_dirty_i&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7646 wont_dirty_i|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7648 else if(target_reg>=0) {
7649 will_dirty_i&=((unneeded_reg[(ba[i]-start)>>2]>>(target_reg&63))&1)<<r;
7650 wont_dirty_i|=((unneeded_reg[(ba[i]-start)>>2]>>(target_reg&63))&1)<<r;
7652 // Treat delay slot as part of branch too
7653 /*if(regs[i+1].regmap[r]==regs[(ba[i]-start)>>2].regmap_entry[r]) {
7654 will_dirty[i+1]&=will_dirty[(ba[i]-start)>>2]&(1<<r);
7655 wont_dirty[i+1]|=wont_dirty[(ba[i]-start)>>2]&(1<<r);
7659 will_dirty[i+1]&=~(1<<r);
7664 // Merge in delay slot
7665 for(r=0;r<HOST_REGS;r++) {
7666 if(r!=EXCLUDE_REG) {
7668 // Might not dirty if likely branch is not taken
7669 if((branch_regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7670 if((branch_regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7671 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7672 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7673 if((branch_regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7674 if(branch_regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7675 if(branch_regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7676 //if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7677 //if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7678 if((regs[i].regmap[r]&63)==rt1[i+1]) will_dirty_i|=1<<r;
7679 if((regs[i].regmap[r]&63)==rt2[i+1]) will_dirty_i|=1<<r;
7680 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7681 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7682 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7687 // Merge in delay slot (won't dirty)
7688 for(r=0;r<HOST_REGS;r++) {
7689 if(r!=EXCLUDE_REG) {
7690 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7691 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7692 if((regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7693 if((regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7694 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7695 if((branch_regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7696 if((branch_regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7697 if((branch_regs[i].regmap[r]&63)==rt1[i+1]) wont_dirty_i|=1<<r;
7698 if((branch_regs[i].regmap[r]&63)==rt2[i+1]) wont_dirty_i|=1<<r;
7699 if(branch_regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7703 #ifndef DESTRUCTIVE_WRITEBACK
7704 branch_regs[i].dirty&=wont_dirty_i;
7706 branch_regs[i].dirty|=will_dirty_i;
7711 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
7713 // SYSCALL instruction (software interrupt)
7717 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
7719 // ERET instruction (return from interrupt)
7723 will_dirty_next=will_dirty_i;
7724 wont_dirty_next=wont_dirty_i;
7725 for(r=0;r<HOST_REGS;r++) {
7726 if(r!=EXCLUDE_REG) {
7727 if((regs[i].regmap[r]&63)==rt1[i]) will_dirty_i|=1<<r;
7728 if((regs[i].regmap[r]&63)==rt2[i]) will_dirty_i|=1<<r;
7729 if((regs[i].regmap[r]&63)>33) will_dirty_i&=~(1<<r);
7730 if(regs[i].regmap[r]<=0) will_dirty_i&=~(1<<r);
7731 if(regs[i].regmap[r]==CCREG) will_dirty_i|=1<<r;
7732 if((regs[i].regmap[r]&63)==rt1[i]) wont_dirty_i|=1<<r;
7733 if((regs[i].regmap[r]&63)==rt2[i]) wont_dirty_i|=1<<r;
7734 if(regs[i].regmap[r]==CCREG) wont_dirty_i|=1<<r;
7736 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=FJUMP)
7738 // Don't store a register immediately after writing it,
7739 // may prevent dual-issue.
7740 if((regs[i].regmap[r]&63)==rt1[i-1]) wont_dirty_i|=1<<r;
7741 if((regs[i].regmap[r]&63)==rt2[i-1]) wont_dirty_i|=1<<r;
7747 will_dirty[i]=will_dirty_i;
7748 wont_dirty[i]=wont_dirty_i;
7749 // Mark registers that won't be dirtied as not dirty
7751 /*printf("wr (%d,%d) %x will:",istart,iend,start+i*4);
7752 for(r=0;r<HOST_REGS;r++) {
7753 if((will_dirty_i>>r)&1) {
7759 //if(i==istart||(itype[i-1]!=RJUMP&&itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=FJUMP)) {
7760 regs[i].dirty|=will_dirty_i;
7761 #ifndef DESTRUCTIVE_WRITEBACK
7762 regs[i].dirty&=wont_dirty_i;
7763 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
7765 if(i<iend-1&&itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
7766 for(r=0;r<HOST_REGS;r++) {
7767 if(r!=EXCLUDE_REG) {
7768 if(regs[i].regmap[r]==regmap_pre[i+2][r]) {
7769 regs[i+2].wasdirty&=wont_dirty_i|~(1<<r);
7770 }else {/*printf("i: %x (%d) mismatch(+2): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7778 for(r=0;r<HOST_REGS;r++) {
7779 if(r!=EXCLUDE_REG) {
7780 if(regs[i].regmap[r]==regmap_pre[i+1][r]) {
7781 regs[i+1].wasdirty&=wont_dirty_i|~(1<<r);
7782 }else {/*printf("i: %x (%d) mismatch(+1): %d\n",start+i*4,i,r);/*assert(!((wont_dirty_i>>r)&1));*/}
7790 // Deal with changed mappings
7791 temp_will_dirty=will_dirty_i;
7792 temp_wont_dirty=wont_dirty_i;
7793 for(r=0;r<HOST_REGS;r++) {
7794 if(r!=EXCLUDE_REG) {
7796 if(regs[i].regmap[r]==regmap_pre[i][r]) {
7798 #ifndef DESTRUCTIVE_WRITEBACK
7799 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7801 regs[i].wasdirty|=will_dirty_i&(1<<r);
7804 else if(regmap_pre[i][r]>=0&&(nr=get_reg(regs[i].regmap,regmap_pre[i][r]))>=0) {
7805 // Register moved to a different register
7806 will_dirty_i&=~(1<<r);
7807 wont_dirty_i&=~(1<<r);
7808 will_dirty_i|=((temp_will_dirty>>nr)&1)<<r;
7809 wont_dirty_i|=((temp_wont_dirty>>nr)&1)<<r;
7811 #ifndef DESTRUCTIVE_WRITEBACK
7812 regs[i].wasdirty&=wont_dirty_i|~(1<<r);
7814 regs[i].wasdirty|=will_dirty_i&(1<<r);
7818 will_dirty_i&=~(1<<r);
7819 wont_dirty_i&=~(1<<r);
7820 if((regmap_pre[i][r]&63)>0 && (regmap_pre[i][r]&63)<34) {
7821 will_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7822 wont_dirty_i|=((unneeded_reg[i]>>(regmap_pre[i][r]&63))&1)<<r;
7825 /*printf("i: %x (%d) mismatch: %d\n",start+i*4,i,r);/*assert(!((will_dirty>>r)&1));*/
7835 void disassemble_inst(int i)
7837 if (bt[i]) printf("*"); else printf(" ");
7840 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7842 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;
7844 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;
7846 printf (" %x: %s %8x\n",start+i*4,insn[i],ba[i]);break;
7848 if (opcode[i]==0x9&&rt1[i]!=31)
7849 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i]);
7851 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7854 printf (" %x: %s (pagespan) r%d,r%d,%8x\n",start+i*4,insn[i],rs1[i],rs2[i],ba[i]);break;
7856 if(opcode[i]==0xf) //LUI
7857 printf (" %x: %s r%d,%4x0000\n",start+i*4,insn[i],rt1[i],imm[i]&0xffff);
7859 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7863 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7867 printf (" %x: %s r%d,r%d+%x\n",start+i*4,insn[i],rs2[i],rs1[i],imm[i]);
7871 printf (" %x: %s r%d,r%d,r%d\n",start+i*4,insn[i],rt1[i],rs1[i],rs2[i]);
7874 printf (" %x: %s r%d,r%d\n",start+i*4,insn[i],rs1[i],rs2[i]);
7877 printf (" %x: %s r%d,r%d,%d\n",start+i*4,insn[i],rt1[i],rs1[i],imm[i]);
7880 if((opcode2[i]&0x1d)==0x10)
7881 printf (" %x: %s r%d\n",start+i*4,insn[i],rt1[i]);
7882 else if((opcode2[i]&0x1d)==0x11)
7883 printf (" %x: %s r%d\n",start+i*4,insn[i],rs1[i]);
7885 printf (" %x: %s\n",start+i*4,insn[i]);
7889 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC0
7890 else if(opcode2[i]==4)
7891 printf (" %x: %s r%d,cpr0[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC0
7892 else printf (" %x: %s\n",start+i*4,insn[i]);
7896 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC1
7897 else if(opcode2[i]>3)
7898 printf (" %x: %s r%d,cpr1[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC1
7899 else printf (" %x: %s\n",start+i*4,insn[i]);
7903 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rt1[i],(source[i]>>11)&0x1f); // MFC2
7904 else if(opcode2[i]>3)
7905 printf (" %x: %s r%d,cpr2[%d]\n",start+i*4,insn[i],rs1[i],(source[i]>>11)&0x1f); // MTC2
7906 else printf (" %x: %s\n",start+i*4,insn[i]);
7909 printf (" %x: %s cpr1[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7912 printf (" %x: %s cpr2[%d],r%d+%x\n",start+i*4,insn[i],(source[i]>>16)&0x1f,rs1[i],imm[i]);
7915 printf (" %x: %s (INTCALL)\n",start+i*4,insn[i]);
7918 //printf (" %s %8x\n",insn[i],source[i]);
7919 printf (" %x: %s\n",start+i*4,insn[i]);
7923 static void disassemble_inst(int i) {}
7926 #define DRC_TEST_VAL 0x74657374
7928 static int new_dynarec_test(void)
7930 int (*testfunc)(void) = (void *)out;
7932 emit_movimm(DRC_TEST_VAL,0); // test
7936 __clear_cache((void *)testfunc, out);
7938 SysPrintf("testing if we can run recompiled code..\n");
7940 if (ret == DRC_TEST_VAL)
7941 SysPrintf("test passed.\n");
7943 SysPrintf("test failed: %08x\n", ret);
7944 out=(u_char *)BASE_ADDR;
7945 return ret == DRC_TEST_VAL;
7948 // clear the state completely, instead of just marking
7949 // things invalid like invalidate_all_pages() does
7950 void new_dynarec_clear_full()
7953 out=(u_char *)BASE_ADDR;
7954 memset(invalid_code,1,sizeof(invalid_code));
7955 memset(hash_table,0xff,sizeof(hash_table));
7956 memset(mini_ht,-1,sizeof(mini_ht));
7957 memset(restore_candidate,0,sizeof(restore_candidate));
7958 memset(shadow,0,sizeof(shadow));
7960 expirep=16384; // Expiry pointer, +2 blocks
7961 pending_exception=0;
7964 inv_code_start=inv_code_end=~0;
7968 for(n=0;n<524288;n++) // 0 .. 0x7FFFFFFF
7970 for(n=524288;n<526336;n++) // 0x80000000 .. 0x807FFFFF
7971 memory_map[n]=((u_int)rdram-0x80000000)>>2;
7972 for(n=526336;n<1048576;n++) // 0x80800000 .. 0xFFFFFFFF
7975 for(n=0;n<4096;n++) ll_clear(jump_in+n);
7976 for(n=0;n<4096;n++) ll_clear(jump_out+n);
7977 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
7980 void new_dynarec_init()
7982 SysPrintf("Init new dynarec\n");
7985 BASE_ADDR=mmap(BASE_ADDR, 1<<TARGET_SIZE_2,
7990 SysPrintf("mmap() failed: %s\n", strerror(errno));
7992 out=(u_char *)BASE_ADDR;
7994 out=(u_char *)BASE_ADDR;
7996 if (mmap (out, 1<<TARGET_SIZE_2,
7997 PROT_READ | PROT_WRITE | PROT_EXEC,
7998 MAP_FIXED | MAP_PRIVATE | MAP_ANONYMOUS,
8000 SysPrintf("mmap() failed: %s\n", strerror(errno));
8003 // not all systems allow execute in data segment by default
8004 if (mprotect(out, 1<<TARGET_SIZE_2, PROT_READ | PROT_WRITE | PROT_EXEC) != 0)
8005 SysPrintf("mprotect() failed: %s\n", strerror(errno));
8009 rdword=&readmem_dword;
8010 fake_pc.f.r.rs=&readmem_dword;
8011 fake_pc.f.r.rt=&readmem_dword;
8012 fake_pc.f.r.rd=&readmem_dword;
8015 cycle_multiplier=200;
8016 new_dynarec_clear_full();
8018 // Copy this into local area so we don't have to put it in every literal pool
8019 invc_ptr=invalid_code;
8022 for(n=0;n<0x8000;n++) { // 0 .. 0x7FFFFFFF
8023 writemem[n] = write_nomem_new;
8024 writememb[n] = write_nomemb_new;
8025 writememh[n] = write_nomemh_new;
8027 writememd[n] = write_nomemd_new;
8029 readmem[n] = read_nomem_new;
8030 readmemb[n] = read_nomemb_new;
8031 readmemh[n] = read_nomemh_new;
8033 readmemd[n] = read_nomemd_new;
8036 for(n=0x8000;n<0x8080;n++) { // 0x80000000 .. 0x807FFFFF
8037 writemem[n] = write_rdram_new;
8038 writememb[n] = write_rdramb_new;
8039 writememh[n] = write_rdramh_new;
8041 writememd[n] = write_rdramd_new;
8044 for(n=0xC000;n<0x10000;n++) { // 0xC0000000 .. 0xFFFFFFFF
8045 writemem[n] = write_nomem_new;
8046 writememb[n] = write_nomemb_new;
8047 writememh[n] = write_nomemh_new;
8049 writememd[n] = write_nomemd_new;
8051 readmem[n] = read_nomem_new;
8052 readmemb[n] = read_nomemb_new;
8053 readmemh[n] = read_nomemh_new;
8055 readmemd[n] = read_nomemd_new;
8063 ram_offset=(u_int)rdram-0x80000000;
8066 SysPrintf("warning: RAM is not directly mapped, performance will suffer\n");
8069 void new_dynarec_cleanup()
8072 #if BASE_ADDR_FIXED || defined(VITA)
8073 if (munmap ((void *)BASE_ADDR, 1<<TARGET_SIZE_2) < 0) {SysPrintf("munmap() failed\n");}
8075 for(n=0;n<4096;n++) ll_clear(jump_in+n);
8076 for(n=0;n<4096;n++) ll_clear(jump_out+n);
8077 for(n=0;n<4096;n++) ll_clear(jump_dirty+n);
8079 if (munmap (ROM_COPY, 67108864) < 0) {SysPrintf("munmap() failed\n");}
8083 static u_int *get_source_start(u_int addr, u_int *limit)
8085 if (addr < 0x00200000 ||
8086 (0xa0000000 <= addr && addr < 0xa0200000)) {
8087 // used for BIOS calls mostly?
8088 *limit = (addr&0xa0000000)|0x00200000;
8089 return (u_int *)((u_int)rdram + (addr&0x1fffff));
8091 else if (!Config.HLE && (
8092 /* (0x9fc00000 <= addr && addr < 0x9fc80000) ||*/
8093 (0xbfc00000 <= addr && addr < 0xbfc80000))) {
8095 *limit = (addr & 0xfff00000) | 0x80000;
8096 return (u_int *)((u_int)psxR + (addr&0x7ffff));
8098 else if (addr >= 0x80000000 && addr < 0x80000000+RAM_SIZE) {
8099 *limit = (addr & 0x80600000) + 0x00200000;
8100 return (u_int *)((u_int)rdram + (addr&0x1fffff));
8104 static u_int scan_for_ret(u_int addr)
8109 mem = get_source_start(addr, &limit);
8113 if (limit > addr + 0x1000)
8114 limit = addr + 0x1000;
8115 for (; addr < limit; addr += 4, mem++) {
8116 if (*mem == 0x03e00008) // jr $ra
8121 struct savestate_block {
8126 static int addr_cmp(const void *p1_, const void *p2_)
8128 const struct savestate_block *p1 = p1_, *p2 = p2_;
8129 return p1->addr - p2->addr;
8132 int new_dynarec_save_blocks(void *save, int size)
8134 struct savestate_block *blocks = save;
8135 int maxcount = size / sizeof(blocks[0]);
8136 struct savestate_block tmp_blocks[1024];
8137 struct ll_entry *head;
8138 int p, s, d, o, bcnt;
8142 for (p = 0; p < sizeof(jump_in) / sizeof(jump_in[0]); p++) {
8144 for (head = jump_in[p]; head != NULL; head = head->next) {
8145 tmp_blocks[bcnt].addr = head->vaddr;
8146 tmp_blocks[bcnt].regflags = head->reg_sv_flags;
8151 qsort(tmp_blocks, bcnt, sizeof(tmp_blocks[0]), addr_cmp);
8153 addr = tmp_blocks[0].addr;
8154 for (s = d = 0; s < bcnt; s++) {
8155 if (tmp_blocks[s].addr < addr)
8157 if (d == 0 || tmp_blocks[d-1].addr != tmp_blocks[s].addr)
8158 tmp_blocks[d++] = tmp_blocks[s];
8159 addr = scan_for_ret(tmp_blocks[s].addr);
8162 if (o + d > maxcount)
8164 memcpy(&blocks[o], tmp_blocks, d * sizeof(blocks[0]));
8168 return o * sizeof(blocks[0]);
8171 void new_dynarec_load_blocks(const void *save, int size)
8173 const struct savestate_block *blocks = save;
8174 int count = size / sizeof(blocks[0]);
8175 u_int regs_save[32];
8179 get_addr(psxRegs.pc);
8181 // change GPRs for speculation to at least partially work..
8182 memcpy(regs_save, &psxRegs.GPR, sizeof(regs_save));
8183 for (i = 1; i < 32; i++)
8184 psxRegs.GPR.r[i] = 0x80000000;
8186 for (b = 0; b < count; b++) {
8187 for (f = blocks[b].regflags, i = 0; f; f >>= 1, i++) {
8189 psxRegs.GPR.r[i] = 0x1f800000;
8192 get_addr(blocks[b].addr);
8194 for (f = blocks[b].regflags, i = 0; f; f >>= 1, i++) {
8196 psxRegs.GPR.r[i] = 0x80000000;
8200 memcpy(&psxRegs.GPR, regs_save, sizeof(regs_save));
8203 int new_recompile_block(int addr)
8205 u_int pagelimit = 0;
8206 u_int state_rflags = 0;
8209 assem_debug("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
8210 //printf("NOTCOMPILED: addr = %x -> %x\n", (int)addr, (int)out);
8211 //printf("TRACE: count=%d next=%d (compile %x)\n",Count,next_interupt,addr);
8213 //printf("TRACE: count=%d next=%d (checksum %x)\n",Count,next_interupt,mchecksum());
8214 //printf("fpu mapping=%x enabled=%x\n",(Status & 0x04000000)>>26,(Status & 0x20000000)>>29);
8215 /*if(Count>=312978186) {
8220 // this is just for speculation
8221 for (i = 1; i < 32; i++) {
8222 if ((psxRegs.GPR.r[i] & 0xffff0000) == 0x1f800000)
8223 state_rflags |= 1 << i;
8226 start = (u_int)addr&~3;
8227 //assert(((u_int)addr&1)==0);
8228 new_dynarec_did_compile=1;
8229 if (Config.HLE && start == 0x80001000) // hlecall
8231 // XXX: is this enough? Maybe check hleSoftCall?
8232 u_int beginning=(u_int)out;
8233 u_int page=get_page(start);
8234 invalid_code[start>>12]=0;
8235 emit_movimm(start,0);
8236 emit_writeword(0,(int)&pcaddr);
8237 emit_jmp((int)new_dyna_leave);
8240 __clear_cache((void *)beginning,out);
8242 ll_add_flags(jump_in+page,start,state_rflags,(void *)beginning);
8246 source = get_source_start(start, &pagelimit);
8247 if (source == NULL) {
8248 SysPrintf("Compile at bogus memory address: %08x\n", addr);
8252 /* Pass 1: disassemble */
8253 /* Pass 2: register dependencies, branch targets */
8254 /* Pass 3: register allocation */
8255 /* Pass 4: branch dependencies */
8256 /* Pass 5: pre-alloc */
8257 /* Pass 6: optimize clean/dirty state */
8258 /* Pass 7: flag 32-bit registers */
8259 /* Pass 8: assembly */
8260 /* Pass 9: linker */
8261 /* Pass 10: garbage collection / free memory */
8265 unsigned int type,op,op2;
8267 //printf("addr = %x source = %x %x\n", addr,source,source[0]);
8269 /* Pass 1 disassembly */
8271 for(i=0;!done;i++) {
8272 bt[i]=0;likely[i]=0;ooo[i]=0;op2=0;
8273 minimum_free_regs[i]=0;
8274 opcode[i]=op=source[i]>>26;
8277 case 0x00: strcpy(insn[i],"special"); type=NI;
8281 case 0x00: strcpy(insn[i],"SLL"); type=SHIFTIMM; break;
8282 case 0x02: strcpy(insn[i],"SRL"); type=SHIFTIMM; break;
8283 case 0x03: strcpy(insn[i],"SRA"); type=SHIFTIMM; break;
8284 case 0x04: strcpy(insn[i],"SLLV"); type=SHIFT; break;
8285 case 0x06: strcpy(insn[i],"SRLV"); type=SHIFT; break;
8286 case 0x07: strcpy(insn[i],"SRAV"); type=SHIFT; break;
8287 case 0x08: strcpy(insn[i],"JR"); type=RJUMP; break;
8288 case 0x09: strcpy(insn[i],"JALR"); type=RJUMP; break;
8289 case 0x0C: strcpy(insn[i],"SYSCALL"); type=SYSCALL; break;
8290 case 0x0D: strcpy(insn[i],"BREAK"); type=OTHER; break;
8291 case 0x0F: strcpy(insn[i],"SYNC"); type=OTHER; break;
8292 case 0x10: strcpy(insn[i],"MFHI"); type=MOV; break;
8293 case 0x11: strcpy(insn[i],"MTHI"); type=MOV; break;
8294 case 0x12: strcpy(insn[i],"MFLO"); type=MOV; break;
8295 case 0x13: strcpy(insn[i],"MTLO"); type=MOV; break;
8296 case 0x18: strcpy(insn[i],"MULT"); type=MULTDIV; break;
8297 case 0x19: strcpy(insn[i],"MULTU"); type=MULTDIV; break;
8298 case 0x1A: strcpy(insn[i],"DIV"); type=MULTDIV; break;
8299 case 0x1B: strcpy(insn[i],"DIVU"); type=MULTDIV; break;
8300 case 0x20: strcpy(insn[i],"ADD"); type=ALU; break;
8301 case 0x21: strcpy(insn[i],"ADDU"); type=ALU; break;
8302 case 0x22: strcpy(insn[i],"SUB"); type=ALU; break;
8303 case 0x23: strcpy(insn[i],"SUBU"); type=ALU; break;
8304 case 0x24: strcpy(insn[i],"AND"); type=ALU; break;
8305 case 0x25: strcpy(insn[i],"OR"); type=ALU; break;
8306 case 0x26: strcpy(insn[i],"XOR"); type=ALU; break;
8307 case 0x27: strcpy(insn[i],"NOR"); type=ALU; break;
8308 case 0x2A: strcpy(insn[i],"SLT"); type=ALU; break;
8309 case 0x2B: strcpy(insn[i],"SLTU"); type=ALU; break;
8310 case 0x30: strcpy(insn[i],"TGE"); type=NI; break;
8311 case 0x31: strcpy(insn[i],"TGEU"); type=NI; break;
8312 case 0x32: strcpy(insn[i],"TLT"); type=NI; break;
8313 case 0x33: strcpy(insn[i],"TLTU"); type=NI; break;
8314 case 0x34: strcpy(insn[i],"TEQ"); type=NI; break;
8315 case 0x36: strcpy(insn[i],"TNE"); type=NI; break;
8317 case 0x14: strcpy(insn[i],"DSLLV"); type=SHIFT; break;
8318 case 0x16: strcpy(insn[i],"DSRLV"); type=SHIFT; break;
8319 case 0x17: strcpy(insn[i],"DSRAV"); type=SHIFT; break;
8320 case 0x1C: strcpy(insn[i],"DMULT"); type=MULTDIV; break;
8321 case 0x1D: strcpy(insn[i],"DMULTU"); type=MULTDIV; break;
8322 case 0x1E: strcpy(insn[i],"DDIV"); type=MULTDIV; break;
8323 case 0x1F: strcpy(insn[i],"DDIVU"); type=MULTDIV; break;
8324 case 0x2C: strcpy(insn[i],"DADD"); type=ALU; break;
8325 case 0x2D: strcpy(insn[i],"DADDU"); type=ALU; break;
8326 case 0x2E: strcpy(insn[i],"DSUB"); type=ALU; break;
8327 case 0x2F: strcpy(insn[i],"DSUBU"); type=ALU; break;
8328 case 0x38: strcpy(insn[i],"DSLL"); type=SHIFTIMM; break;
8329 case 0x3A: strcpy(insn[i],"DSRL"); type=SHIFTIMM; break;
8330 case 0x3B: strcpy(insn[i],"DSRA"); type=SHIFTIMM; break;
8331 case 0x3C: strcpy(insn[i],"DSLL32"); type=SHIFTIMM; break;
8332 case 0x3E: strcpy(insn[i],"DSRL32"); type=SHIFTIMM; break;
8333 case 0x3F: strcpy(insn[i],"DSRA32"); type=SHIFTIMM; break;
8337 case 0x01: strcpy(insn[i],"regimm"); type=NI;
8338 op2=(source[i]>>16)&0x1f;
8341 case 0x00: strcpy(insn[i],"BLTZ"); type=SJUMP; break;
8342 case 0x01: strcpy(insn[i],"BGEZ"); type=SJUMP; break;
8343 case 0x02: strcpy(insn[i],"BLTZL"); type=SJUMP; break;
8344 case 0x03: strcpy(insn[i],"BGEZL"); type=SJUMP; break;
8345 case 0x08: strcpy(insn[i],"TGEI"); type=NI; break;
8346 case 0x09: strcpy(insn[i],"TGEIU"); type=NI; break;
8347 case 0x0A: strcpy(insn[i],"TLTI"); type=NI; break;
8348 case 0x0B: strcpy(insn[i],"TLTIU"); type=NI; break;
8349 case 0x0C: strcpy(insn[i],"TEQI"); type=NI; break;
8350 case 0x0E: strcpy(insn[i],"TNEI"); type=NI; break;
8351 case 0x10: strcpy(insn[i],"BLTZAL"); type=SJUMP; break;
8352 case 0x11: strcpy(insn[i],"BGEZAL"); type=SJUMP; break;
8353 case 0x12: strcpy(insn[i],"BLTZALL"); type=SJUMP; break;
8354 case 0x13: strcpy(insn[i],"BGEZALL"); type=SJUMP; break;
8357 case 0x02: strcpy(insn[i],"J"); type=UJUMP; break;
8358 case 0x03: strcpy(insn[i],"JAL"); type=UJUMP; break;
8359 case 0x04: strcpy(insn[i],"BEQ"); type=CJUMP; break;
8360 case 0x05: strcpy(insn[i],"BNE"); type=CJUMP; break;
8361 case 0x06: strcpy(insn[i],"BLEZ"); type=CJUMP; break;
8362 case 0x07: strcpy(insn[i],"BGTZ"); type=CJUMP; break;
8363 case 0x08: strcpy(insn[i],"ADDI"); type=IMM16; break;
8364 case 0x09: strcpy(insn[i],"ADDIU"); type=IMM16; break;
8365 case 0x0A: strcpy(insn[i],"SLTI"); type=IMM16; break;
8366 case 0x0B: strcpy(insn[i],"SLTIU"); type=IMM16; break;
8367 case 0x0C: strcpy(insn[i],"ANDI"); type=IMM16; break;
8368 case 0x0D: strcpy(insn[i],"ORI"); type=IMM16; break;
8369 case 0x0E: strcpy(insn[i],"XORI"); type=IMM16; break;
8370 case 0x0F: strcpy(insn[i],"LUI"); type=IMM16; break;
8371 case 0x10: strcpy(insn[i],"cop0"); type=NI;
8372 op2=(source[i]>>21)&0x1f;
8375 case 0x00: strcpy(insn[i],"MFC0"); type=COP0; break;
8376 case 0x04: strcpy(insn[i],"MTC0"); type=COP0; break;
8377 case 0x10: strcpy(insn[i],"tlb"); type=NI;
8378 switch(source[i]&0x3f)
8380 case 0x01: strcpy(insn[i],"TLBR"); type=COP0; break;
8381 case 0x02: strcpy(insn[i],"TLBWI"); type=COP0; break;
8382 case 0x06: strcpy(insn[i],"TLBWR"); type=COP0; break;
8383 case 0x08: strcpy(insn[i],"TLBP"); type=COP0; break;
8385 case 0x10: strcpy(insn[i],"RFE"); type=COP0; break;
8387 case 0x18: strcpy(insn[i],"ERET"); type=COP0; break;
8392 case 0x11: strcpy(insn[i],"cop1"); type=NI;
8393 op2=(source[i]>>21)&0x1f;
8396 case 0x00: strcpy(insn[i],"MFC1"); type=COP1; break;
8397 case 0x01: strcpy(insn[i],"DMFC1"); type=COP1; break;
8398 case 0x02: strcpy(insn[i],"CFC1"); type=COP1; break;
8399 case 0x04: strcpy(insn[i],"MTC1"); type=COP1; break;
8400 case 0x05: strcpy(insn[i],"DMTC1"); type=COP1; break;
8401 case 0x06: strcpy(insn[i],"CTC1"); type=COP1; break;
8402 case 0x08: strcpy(insn[i],"BC1"); type=FJUMP;
8403 switch((source[i]>>16)&0x3)
8405 case 0x00: strcpy(insn[i],"BC1F"); break;
8406 case 0x01: strcpy(insn[i],"BC1T"); break;
8407 case 0x02: strcpy(insn[i],"BC1FL"); break;
8408 case 0x03: strcpy(insn[i],"BC1TL"); break;
8411 case 0x10: strcpy(insn[i],"C1.S"); type=NI;
8412 switch(source[i]&0x3f)
8414 case 0x00: strcpy(insn[i],"ADD.S"); type=FLOAT; break;
8415 case 0x01: strcpy(insn[i],"SUB.S"); type=FLOAT; break;
8416 case 0x02: strcpy(insn[i],"MUL.S"); type=FLOAT; break;
8417 case 0x03: strcpy(insn[i],"DIV.S"); type=FLOAT; break;
8418 case 0x04: strcpy(insn[i],"SQRT.S"); type=FLOAT; break;
8419 case 0x05: strcpy(insn[i],"ABS.S"); type=FLOAT; break;
8420 case 0x06: strcpy(insn[i],"MOV.S"); type=FLOAT; break;
8421 case 0x07: strcpy(insn[i],"NEG.S"); type=FLOAT; break;
8422 case 0x08: strcpy(insn[i],"ROUND.L.S"); type=FCONV; break;
8423 case 0x09: strcpy(insn[i],"TRUNC.L.S"); type=FCONV; break;
8424 case 0x0A: strcpy(insn[i],"CEIL.L.S"); type=FCONV; break;
8425 case 0x0B: strcpy(insn[i],"FLOOR.L.S"); type=FCONV; break;
8426 case 0x0C: strcpy(insn[i],"ROUND.W.S"); type=FCONV; break;
8427 case 0x0D: strcpy(insn[i],"TRUNC.W.S"); type=FCONV; break;
8428 case 0x0E: strcpy(insn[i],"CEIL.W.S"); type=FCONV; break;
8429 case 0x0F: strcpy(insn[i],"FLOOR.W.S"); type=FCONV; break;
8430 case 0x21: strcpy(insn[i],"CVT.D.S"); type=FCONV; break;
8431 case 0x24: strcpy(insn[i],"CVT.W.S"); type=FCONV; break;
8432 case 0x25: strcpy(insn[i],"CVT.L.S"); type=FCONV; break;
8433 case 0x30: strcpy(insn[i],"C.F.S"); type=FCOMP; break;
8434 case 0x31: strcpy(insn[i],"C.UN.S"); type=FCOMP; break;
8435 case 0x32: strcpy(insn[i],"C.EQ.S"); type=FCOMP; break;
8436 case 0x33: strcpy(insn[i],"C.UEQ.S"); type=FCOMP; break;
8437 case 0x34: strcpy(insn[i],"C.OLT.S"); type=FCOMP; break;
8438 case 0x35: strcpy(insn[i],"C.ULT.S"); type=FCOMP; break;
8439 case 0x36: strcpy(insn[i],"C.OLE.S"); type=FCOMP; break;
8440 case 0x37: strcpy(insn[i],"C.ULE.S"); type=FCOMP; break;
8441 case 0x38: strcpy(insn[i],"C.SF.S"); type=FCOMP; break;
8442 case 0x39: strcpy(insn[i],"C.NGLE.S"); type=FCOMP; break;
8443 case 0x3A: strcpy(insn[i],"C.SEQ.S"); type=FCOMP; break;
8444 case 0x3B: strcpy(insn[i],"C.NGL.S"); type=FCOMP; break;
8445 case 0x3C: strcpy(insn[i],"C.LT.S"); type=FCOMP; break;
8446 case 0x3D: strcpy(insn[i],"C.NGE.S"); type=FCOMP; break;
8447 case 0x3E: strcpy(insn[i],"C.LE.S"); type=FCOMP; break;
8448 case 0x3F: strcpy(insn[i],"C.NGT.S"); type=FCOMP; break;
8451 case 0x11: strcpy(insn[i],"C1.D"); type=NI;
8452 switch(source[i]&0x3f)
8454 case 0x00: strcpy(insn[i],"ADD.D"); type=FLOAT; break;
8455 case 0x01: strcpy(insn[i],"SUB.D"); type=FLOAT; break;
8456 case 0x02: strcpy(insn[i],"MUL.D"); type=FLOAT; break;
8457 case 0x03: strcpy(insn[i],"DIV.D"); type=FLOAT; break;
8458 case 0x04: strcpy(insn[i],"SQRT.D"); type=FLOAT; break;
8459 case 0x05: strcpy(insn[i],"ABS.D"); type=FLOAT; break;
8460 case 0x06: strcpy(insn[i],"MOV.D"); type=FLOAT; break;
8461 case 0x07: strcpy(insn[i],"NEG.D"); type=FLOAT; break;
8462 case 0x08: strcpy(insn[i],"ROUND.L.D"); type=FCONV; break;
8463 case 0x09: strcpy(insn[i],"TRUNC.L.D"); type=FCONV; break;
8464 case 0x0A: strcpy(insn[i],"CEIL.L.D"); type=FCONV; break;
8465 case 0x0B: strcpy(insn[i],"FLOOR.L.D"); type=FCONV; break;
8466 case 0x0C: strcpy(insn[i],"ROUND.W.D"); type=FCONV; break;
8467 case 0x0D: strcpy(insn[i],"TRUNC.W.D"); type=FCONV; break;
8468 case 0x0E: strcpy(insn[i],"CEIL.W.D"); type=FCONV; break;
8469 case 0x0F: strcpy(insn[i],"FLOOR.W.D"); type=FCONV; break;
8470 case 0x20: strcpy(insn[i],"CVT.S.D"); type=FCONV; break;
8471 case 0x24: strcpy(insn[i],"CVT.W.D"); type=FCONV; break;
8472 case 0x25: strcpy(insn[i],"CVT.L.D"); type=FCONV; break;
8473 case 0x30: strcpy(insn[i],"C.F.D"); type=FCOMP; break;
8474 case 0x31: strcpy(insn[i],"C.UN.D"); type=FCOMP; break;
8475 case 0x32: strcpy(insn[i],"C.EQ.D"); type=FCOMP; break;
8476 case 0x33: strcpy(insn[i],"C.UEQ.D"); type=FCOMP; break;
8477 case 0x34: strcpy(insn[i],"C.OLT.D"); type=FCOMP; break;
8478 case 0x35: strcpy(insn[i],"C.ULT.D"); type=FCOMP; break;
8479 case 0x36: strcpy(insn[i],"C.OLE.D"); type=FCOMP; break;
8480 case 0x37: strcpy(insn[i],"C.ULE.D"); type=FCOMP; break;
8481 case 0x38: strcpy(insn[i],"C.SF.D"); type=FCOMP; break;
8482 case 0x39: strcpy(insn[i],"C.NGLE.D"); type=FCOMP; break;
8483 case 0x3A: strcpy(insn[i],"C.SEQ.D"); type=FCOMP; break;
8484 case 0x3B: strcpy(insn[i],"C.NGL.D"); type=FCOMP; break;
8485 case 0x3C: strcpy(insn[i],"C.LT.D"); type=FCOMP; break;
8486 case 0x3D: strcpy(insn[i],"C.NGE.D"); type=FCOMP; break;
8487 case 0x3E: strcpy(insn[i],"C.LE.D"); type=FCOMP; break;
8488 case 0x3F: strcpy(insn[i],"C.NGT.D"); type=FCOMP; break;
8491 case 0x14: strcpy(insn[i],"C1.W"); type=NI;
8492 switch(source[i]&0x3f)
8494 case 0x20: strcpy(insn[i],"CVT.S.W"); type=FCONV; break;
8495 case 0x21: strcpy(insn[i],"CVT.D.W"); type=FCONV; break;
8498 case 0x15: strcpy(insn[i],"C1.L"); type=NI;
8499 switch(source[i]&0x3f)
8501 case 0x20: strcpy(insn[i],"CVT.S.L"); type=FCONV; break;
8502 case 0x21: strcpy(insn[i],"CVT.D.L"); type=FCONV; break;
8508 case 0x14: strcpy(insn[i],"BEQL"); type=CJUMP; break;
8509 case 0x15: strcpy(insn[i],"BNEL"); type=CJUMP; break;
8510 case 0x16: strcpy(insn[i],"BLEZL"); type=CJUMP; break;
8511 case 0x17: strcpy(insn[i],"BGTZL"); type=CJUMP; break;
8512 case 0x18: strcpy(insn[i],"DADDI"); type=IMM16; break;
8513 case 0x19: strcpy(insn[i],"DADDIU"); type=IMM16; break;
8514 case 0x1A: strcpy(insn[i],"LDL"); type=LOADLR; break;
8515 case 0x1B: strcpy(insn[i],"LDR"); type=LOADLR; break;
8517 case 0x20: strcpy(insn[i],"LB"); type=LOAD; break;
8518 case 0x21: strcpy(insn[i],"LH"); type=LOAD; break;
8519 case 0x22: strcpy(insn[i],"LWL"); type=LOADLR; break;
8520 case 0x23: strcpy(insn[i],"LW"); type=LOAD; break;
8521 case 0x24: strcpy(insn[i],"LBU"); type=LOAD; break;
8522 case 0x25: strcpy(insn[i],"LHU"); type=LOAD; break;
8523 case 0x26: strcpy(insn[i],"LWR"); type=LOADLR; break;
8525 case 0x27: strcpy(insn[i],"LWU"); type=LOAD; break;
8527 case 0x28: strcpy(insn[i],"SB"); type=STORE; break;
8528 case 0x29: strcpy(insn[i],"SH"); type=STORE; break;
8529 case 0x2A: strcpy(insn[i],"SWL"); type=STORELR; break;
8530 case 0x2B: strcpy(insn[i],"SW"); type=STORE; break;
8532 case 0x2C: strcpy(insn[i],"SDL"); type=STORELR; break;
8533 case 0x2D: strcpy(insn[i],"SDR"); type=STORELR; break;
8535 case 0x2E: strcpy(insn[i],"SWR"); type=STORELR; break;
8536 case 0x2F: strcpy(insn[i],"CACHE"); type=NOP; break;
8537 case 0x30: strcpy(insn[i],"LL"); type=NI; break;
8538 case 0x31: strcpy(insn[i],"LWC1"); type=C1LS; break;
8540 case 0x34: strcpy(insn[i],"LLD"); type=NI; break;
8541 case 0x35: strcpy(insn[i],"LDC1"); type=C1LS; break;
8542 case 0x37: strcpy(insn[i],"LD"); type=LOAD; break;
8544 case 0x38: strcpy(insn[i],"SC"); type=NI; break;
8545 case 0x39: strcpy(insn[i],"SWC1"); type=C1LS; break;
8547 case 0x3C: strcpy(insn[i],"SCD"); type=NI; break;
8548 case 0x3D: strcpy(insn[i],"SDC1"); type=C1LS; break;
8549 case 0x3F: strcpy(insn[i],"SD"); type=STORE; break;
8552 case 0x12: strcpy(insn[i],"COP2"); type=NI;
8553 op2=(source[i]>>21)&0x1f;
8555 if (source[i]&0x3f) { // use this hack to support old savestates with patched gte insns
8556 if (gte_handlers[source[i]&0x3f]!=NULL) {
8557 if (gte_regnames[source[i]&0x3f]!=NULL)
8558 strcpy(insn[i],gte_regnames[source[i]&0x3f]);
8560 snprintf(insn[i], sizeof(insn[i]), "COP2 %x", source[i]&0x3f);
8566 case 0x00: strcpy(insn[i],"MFC2"); type=COP2; break;
8567 case 0x02: strcpy(insn[i],"CFC2"); type=COP2; break;
8568 case 0x04: strcpy(insn[i],"MTC2"); type=COP2; break;
8569 case 0x06: strcpy(insn[i],"CTC2"); type=COP2; break;
8572 case 0x32: strcpy(insn[i],"LWC2"); type=C2LS; break;
8573 case 0x3A: strcpy(insn[i],"SWC2"); type=C2LS; break;
8574 case 0x3B: strcpy(insn[i],"HLECALL"); type=HLECALL; break;
8576 default: strcpy(insn[i],"???"); type=NI;
8577 SysPrintf("NI %08x @%08x (%08x)\n", source[i], addr + i*4, addr);
8582 /* Get registers/immediates */
8588 gte_rs[i]=gte_rt[i]=0;
8591 rs1[i]=(source[i]>>21)&0x1f;
8593 rt1[i]=(source[i]>>16)&0x1f;
8595 imm[i]=(short)source[i];
8599 rs1[i]=(source[i]>>21)&0x1f;
8600 rs2[i]=(source[i]>>16)&0x1f;
8603 imm[i]=(short)source[i];
8604 if(op==0x2c||op==0x2d||op==0x3f) us1[i]=rs2[i]; // 64-bit SDL/SDR/SD
8607 // LWL/LWR only load part of the register,
8608 // therefore the target register must be treated as a source too
8609 rs1[i]=(source[i]>>21)&0x1f;
8610 rs2[i]=(source[i]>>16)&0x1f;
8611 rt1[i]=(source[i]>>16)&0x1f;
8613 imm[i]=(short)source[i];
8614 if(op==0x1a||op==0x1b) us1[i]=rs2[i]; // LDR/LDL
8615 if(op==0x26) dep1[i]=rt1[i]; // LWR
8618 if (op==0x0f) rs1[i]=0; // LUI instruction has no source register
8619 else rs1[i]=(source[i]>>21)&0x1f;
8621 rt1[i]=(source[i]>>16)&0x1f;
8623 if(op>=0x0c&&op<=0x0e) { // ANDI/ORI/XORI
8624 imm[i]=(unsigned short)source[i];
8626 imm[i]=(short)source[i];
8628 if(op==0x18||op==0x19) us1[i]=rs1[i]; // DADDI/DADDIU
8629 if(op==0x0a||op==0x0b) us1[i]=rs1[i]; // SLTI/SLTIU
8630 if(op==0x0d||op==0x0e) dep1[i]=rs1[i]; // ORI/XORI
8637 // The JAL instruction writes to r31.
8644 rs1[i]=(source[i]>>21)&0x1f;
8648 // The JALR instruction writes to rd.
8650 rt1[i]=(source[i]>>11)&0x1f;
8655 rs1[i]=(source[i]>>21)&0x1f;
8656 rs2[i]=(source[i]>>16)&0x1f;
8659 if(op&2) { // BGTZ/BLEZ
8667 rs1[i]=(source[i]>>21)&0x1f;
8672 if(op2&0x10) { // BxxAL
8674 // NOTE: If the branch is not taken, r31 is still overwritten
8676 likely[i]=(op2&2)>>1;
8683 likely[i]=((source[i])>>17)&1;
8686 rs1[i]=(source[i]>>21)&0x1f; // source
8687 rs2[i]=(source[i]>>16)&0x1f; // subtract amount
8688 rt1[i]=(source[i]>>11)&0x1f; // destination
8690 if(op2==0x2a||op2==0x2b) { // SLT/SLTU
8691 us1[i]=rs1[i];us2[i]=rs2[i];
8693 else if(op2>=0x24&&op2<=0x27) { // AND/OR/XOR/NOR
8694 dep1[i]=rs1[i];dep2[i]=rs2[i];
8696 else if(op2>=0x2c&&op2<=0x2f) { // DADD/DSUB
8697 dep1[i]=rs1[i];dep2[i]=rs2[i];
8701 rs1[i]=(source[i]>>21)&0x1f; // source
8702 rs2[i]=(source[i]>>16)&0x1f; // divisor
8705 if (op2>=0x1c&&op2<=0x1f) { // DMULT/DMULTU/DDIV/DDIVU
8706 us1[i]=rs1[i];us2[i]=rs2[i];
8714 if(op2==0x10) rs1[i]=HIREG; // MFHI
8715 if(op2==0x11) rt1[i]=HIREG; // MTHI
8716 if(op2==0x12) rs1[i]=LOREG; // MFLO
8717 if(op2==0x13) rt1[i]=LOREG; // MTLO
8718 if((op2&0x1d)==0x10) rt1[i]=(source[i]>>11)&0x1f; // MFxx
8719 if((op2&0x1d)==0x11) rs1[i]=(source[i]>>21)&0x1f; // MTxx
8723 rs1[i]=(source[i]>>16)&0x1f; // target of shift
8724 rs2[i]=(source[i]>>21)&0x1f; // shift amount
8725 rt1[i]=(source[i]>>11)&0x1f; // destination
8727 // DSLLV/DSRLV/DSRAV are 64-bit
8728 if(op2>=0x14&&op2<=0x17) us1[i]=rs1[i];
8731 rs1[i]=(source[i]>>16)&0x1f;
8733 rt1[i]=(source[i]>>11)&0x1f;
8735 imm[i]=(source[i]>>6)&0x1f;
8736 // DSxx32 instructions
8737 if(op2>=0x3c) imm[i]|=0x20;
8738 // DSLL/DSRL/DSRA/DSRA32/DSRL32 but not DSLL32 require 64-bit source
8739 if(op2>=0x38&&op2!=0x3c) us1[i]=rs1[i];
8746 if(op2==0) rt1[i]=(source[i]>>16)&0x1F; // MFC0
8747 if(op2==4) rs1[i]=(source[i]>>16)&0x1F; // MTC0
8748 if(op2==4&&((source[i]>>11)&0x1f)==12) rt2[i]=CSREG; // Status
8749 if(op2==16) if((source[i]&0x3f)==0x18) rs2[i]=CCREG; // ERET
8756 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC1/DMFC1/CFC1
8757 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC1/DMTC1/CTC1
8758 if(op2==5) us1[i]=rs1[i]; // DMTC1
8766 if(op2<3) rt1[i]=(source[i]>>16)&0x1F; // MFC2/CFC2
8767 if(op2>3) rs1[i]=(source[i]>>16)&0x1F; // MTC2/CTC2
8769 int gr=(source[i]>>11)&0x1F;
8772 case 0x00: gte_rs[i]=1ll<<gr; break; // MFC2
8773 case 0x04: gte_rt[i]=1ll<<gr; break; // MTC2
8774 case 0x02: gte_rs[i]=1ll<<(gr+32); break; // CFC2
8775 case 0x06: gte_rt[i]=1ll<<(gr+32); break; // CTC2
8779 rs1[i]=(source[i]>>21)&0x1F;
8783 imm[i]=(short)source[i];
8786 rs1[i]=(source[i]>>21)&0x1F;
8790 imm[i]=(short)source[i];
8791 if(op==0x32) gte_rt[i]=1ll<<((source[i]>>16)&0x1F); // LWC2
8792 else gte_rs[i]=1ll<<((source[i]>>16)&0x1F); // SWC2
8799 gte_rs[i]=gte_reg_reads[source[i]&0x3f];
8800 gte_rt[i]=gte_reg_writes[source[i]&0x3f];
8801 gte_rt[i]|=1ll<<63; // every op changes flags
8802 if((source[i]&0x3f)==GTE_MVMVA) {
8803 int v = (source[i] >> 15) & 3;
8804 gte_rs[i]&=~0xe3fll;
8805 if(v==3) gte_rs[i]|=0xe00ll;
8806 else gte_rs[i]|=3ll<<(v*2);
8836 /* Calculate branch target addresses */
8838 ba[i]=((start+i*4+4)&0xF0000000)|(((unsigned int)source[i]<<6)>>4);
8839 else if(type==CJUMP&&rs1[i]==rs2[i]&&(op&1))
8840 ba[i]=start+i*4+8; // Ignore never taken branch
8841 else if(type==SJUMP&&rs1[i]==0&&!(op2&1))
8842 ba[i]=start+i*4+8; // Ignore never taken branch
8843 else if(type==CJUMP||type==SJUMP||type==FJUMP)
8844 ba[i]=start+i*4+4+((signed int)((unsigned int)source[i]<<16)>>14);
8847 if(i>0&&(itype[i-1]==RJUMP||itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==FJUMP)) {
8849 // branch in delay slot?
8850 if(type==RJUMP||type==UJUMP||type==CJUMP||type==SJUMP||type==FJUMP) {
8851 // don't handle first branch and call interpreter if it's hit
8852 SysPrintf("branch in delay slot @%08x (%08x)\n", addr + i*4, addr);
8855 // basic load delay detection
8856 else if((type==LOAD||type==LOADLR||type==COP0||type==COP2||type==C2LS)&&rt1[i]!=0) {
8857 int t=(ba[i-1]-start)/4;
8858 if(0 <= t && t < i &&(rt1[i]==rs1[t]||rt1[i]==rs2[t])&&itype[t]!=CJUMP&&itype[t]!=SJUMP) {
8859 // jump target wants DS result - potential load delay effect
8860 SysPrintf("load delay @%08x (%08x)\n", addr + i*4, addr);
8862 bt[t+1]=1; // expected return from interpreter
8864 else if(i>=2&&rt1[i-2]==2&&rt1[i]==2&&rs1[i]!=2&&rs2[i]!=2&&rs1[i-1]!=2&&rs2[i-1]!=2&&
8865 !(i>=3&&(itype[i-3]==RJUMP||itype[i-3]==UJUMP||itype[i-3]==CJUMP||itype[i-3]==SJUMP))) {
8866 // v0 overwrite like this is a sign of trouble, bail out
8867 SysPrintf("v0 overwrite @%08x (%08x)\n", addr + i*4, addr);
8873 rs2[i-1]=rt1[i-1]=rt2[i-1]=0;
8877 i--; // don't compile the DS
8881 /* Is this the end of the block? */
8882 if(i>0&&(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)) {
8883 if(rt1[i-1]==0) { // Continue past subroutine call (JAL)
8887 if(stop_after_jal) done=1;
8889 if((source[i+1]&0xfc00003f)==0x0d) done=1;
8891 // Don't recompile stuff that's already compiled
8892 if(check_addr(start+i*4+4)) done=1;
8893 // Don't get too close to the limit
8894 if(i>MAXBLOCK/2) done=1;
8896 if(itype[i]==SYSCALL&&stop_after_jal) done=1;
8897 if(itype[i]==HLECALL||itype[i]==INTCALL) done=2;
8899 // Does the block continue due to a branch?
8902 if(ba[j]==start+i*4) done=j=0; // Branch into delay slot
8903 if(ba[j]==start+i*4+4) done=j=0;
8904 if(ba[j]==start+i*4+8) done=j=0;
8907 //assert(i<MAXBLOCK-1);
8908 if(start+i*4==pagelimit-4) done=1;
8909 assert(start+i*4<pagelimit);
8910 if (i==MAXBLOCK-1) done=1;
8911 // Stop if we're compiling junk
8912 if(itype[i]==NI&&opcode[i]==0x11) {
8913 done=stop_after_jal=1;
8914 SysPrintf("Disabled speculative precompilation\n");
8918 if(itype[i-1]==UJUMP||itype[i-1]==CJUMP||itype[i-1]==SJUMP||itype[i-1]==RJUMP||itype[i-1]==FJUMP) {
8919 if(start+i*4==pagelimit) {
8925 /* Pass 2 - Register dependencies and branch targets */
8927 unneeded_registers(0,slen-1,0);
8929 /* Pass 3 - Register allocation */
8931 struct regstat current; // Current register allocations/status
8934 current.u=unneeded_reg[0];
8935 current.uu=unneeded_reg_upper[0];
8936 clear_all_regs(current.regmap);
8937 alloc_reg(¤t,0,CCREG);
8938 dirty_reg(¤t,CCREG);
8941 current.waswritten=0;
8947 provisional_32bit();
8950 // First instruction is delay slot
8955 unneeded_reg_upper[0]=1;
8956 current.regmap[HOST_BTREG]=BTREG;
8964 for(hr=0;hr<HOST_REGS;hr++)
8966 // Is this really necessary?
8967 if(current.regmap[hr]==0) current.regmap[hr]=-1;
8970 current.waswritten=0;
8974 if((opcode[i-2]&0x2f)==0x05) // BNE/BNEL
8976 if(rs1[i-2]==0||rs2[i-2]==0)
8979 current.is32|=1LL<<rs1[i-2];
8980 int hr=get_reg(current.regmap,rs1[i-2]|64);
8981 if(hr>=0) current.regmap[hr]=-1;
8984 current.is32|=1LL<<rs2[i-2];
8985 int hr=get_reg(current.regmap,rs2[i-2]|64);
8986 if(hr>=0) current.regmap[hr]=-1;
8992 // If something jumps here with 64-bit values
8993 // then promote those registers to 64 bits
8996 uint64_t temp_is32=current.is32;
8999 if(ba[j]==start+i*4)
9000 temp_is32&=branch_regs[j].is32;
9004 if(ba[j]==start+i*4)
9008 if(temp_is32!=current.is32) {
9009 //printf("dumping 32-bit regs (%x)\n",start+i*4);
9010 #ifndef DESTRUCTIVE_WRITEBACK
9013 for(hr=0;hr<HOST_REGS;hr++)
9015 int r=current.regmap[hr];
9018 if((current.dirty>>hr)&((current.is32&~temp_is32)>>r)&1) {
9020 //printf("restore %d\n",r);
9024 current.is32=temp_is32;
9031 memcpy(regmap_pre[i],current.regmap,sizeof(current.regmap));
9032 regs[i].wasconst=current.isconst;
9033 regs[i].was32=current.is32;
9034 regs[i].wasdirty=current.dirty;
9035 regs[i].loadedconst=0;
9036 #if defined(DESTRUCTIVE_WRITEBACK) && !defined(FORCE32)
9037 // To change a dirty register from 32 to 64 bits, we must write
9038 // it out during the previous cycle (for branches, 2 cycles)
9039 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)
9041 uint64_t temp_is32=current.is32;
9044 if(ba[j]==start+i*4+4)
9045 temp_is32&=branch_regs[j].is32;
9049 if(ba[j]==start+i*4+4)
9053 if(temp_is32!=current.is32) {
9054 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
9055 for(hr=0;hr<HOST_REGS;hr++)
9057 int r=current.regmap[hr];
9060 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
9061 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP)
9063 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63))
9065 //printf("dump %d/r%d\n",hr,r);
9066 current.regmap[hr]=-1;
9067 if(get_reg(current.regmap,r|64)>=0)
9068 current.regmap[get_reg(current.regmap,r|64)]=-1;
9076 else if(i<slen-2&&bt[i+2]&&(source[i-1]>>16)!=0x1000&&(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP))
9078 uint64_t temp_is32=current.is32;
9081 if(ba[j]==start+i*4+8)
9082 temp_is32&=branch_regs[j].is32;
9086 if(ba[j]==start+i*4+8)
9090 if(temp_is32!=current.is32) {
9091 //printf("pre-dumping 32-bit regs (%x)\n",start+i*4);
9092 for(hr=0;hr<HOST_REGS;hr++)
9094 int r=current.regmap[hr];
9097 if((current.dirty>>hr)&((current.is32&~temp_is32)>>(r&63))&1) {
9098 if(rs1[i]!=(r&63)&&rs2[i]!=(r&63)&&rs1[i+1]!=(r&63)&&rs2[i+1]!=(r&63))
9100 //printf("dump %d/r%d\n",hr,r);
9101 current.regmap[hr]=-1;
9102 if(get_reg(current.regmap,r|64)>=0)
9103 current.regmap[get_reg(current.regmap,r|64)]=-1;
9111 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9113 current.u=unneeded_reg[i+1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9114 current.uu=unneeded_reg_upper[i+1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9115 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9124 current.u=branch_unneeded_reg[i]&~((1LL<<rs1[i+1])|(1LL<<rs2[i+1]));
9125 current.uu=branch_unneeded_reg_upper[i]&~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9126 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9127 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
9128 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9131 } else { SysPrintf("oops, branch at end of block with no delay slot\n");exit(1); }
9135 ds=0; // Skip delay slot, already allocated as part of branch
9136 // ...but we need to alloc it in case something jumps here
9138 current.u=branch_unneeded_reg[i-1]&unneeded_reg[i+1];
9139 current.uu=branch_unneeded_reg_upper[i-1]&unneeded_reg_upper[i+1];
9141 current.u=branch_unneeded_reg[i-1];
9142 current.uu=branch_unneeded_reg_upper[i-1];
9144 current.u&=~((1LL<<rs1[i])|(1LL<<rs2[i]));
9145 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9146 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9149 struct regstat temp;
9150 memcpy(&temp,¤t,sizeof(current));
9151 temp.wasdirty=temp.dirty;
9152 temp.was32=temp.is32;
9153 // TODO: Take into account unconditional branches, as below
9154 delayslot_alloc(&temp,i);
9155 memcpy(regs[i].regmap,temp.regmap,sizeof(temp.regmap));
9156 regs[i].wasdirty=temp.wasdirty;
9157 regs[i].was32=temp.was32;
9158 regs[i].dirty=temp.dirty;
9159 regs[i].is32=temp.is32;
9163 // Create entry (branch target) regmap
9164 for(hr=0;hr<HOST_REGS;hr++)
9166 int r=temp.regmap[hr];
9168 if(r!=regmap_pre[i][hr]) {
9169 regs[i].regmap_entry[hr]=-1;
9174 if((current.u>>r)&1) {
9175 regs[i].regmap_entry[hr]=-1;
9176 regs[i].regmap[hr]=-1;
9177 //Don't clear regs in the delay slot as the branch might need them
9178 //current.regmap[hr]=-1;
9180 regs[i].regmap_entry[hr]=r;
9183 if((current.uu>>(r&63))&1) {
9184 regs[i].regmap_entry[hr]=-1;
9185 regs[i].regmap[hr]=-1;
9186 //Don't clear regs in the delay slot as the branch might need them
9187 //current.regmap[hr]=-1;
9189 regs[i].regmap_entry[hr]=r;
9193 // First instruction expects CCREG to be allocated
9194 if(i==0&&hr==HOST_CCREG)
9195 regs[i].regmap_entry[hr]=CCREG;
9197 regs[i].regmap_entry[hr]=-1;
9201 else { // Not delay slot
9204 //current.isconst=0; // DEBUG
9205 //current.wasconst=0; // DEBUG
9206 //regs[i].wasconst=0; // DEBUG
9207 clear_const(¤t,rt1[i]);
9208 alloc_cc(¤t,i);
9209 dirty_reg(¤t,CCREG);
9211 alloc_reg(¤t,i,31);
9212 dirty_reg(¤t,31);
9213 //assert(rs1[i+1]!=31&&rs2[i+1]!=31);
9214 //assert(rt1[i+1]!=rt1[i]);
9216 alloc_reg(¤t,i,PTEMP);
9218 //current.is32|=1LL<<rt1[i];
9221 delayslot_alloc(¤t,i+1);
9222 //current.isconst=0; // DEBUG
9224 //printf("i=%d, isconst=%x\n",i,current.isconst);
9227 //current.isconst=0;
9228 //current.wasconst=0;
9229 //regs[i].wasconst=0;
9230 clear_const(¤t,rs1[i]);
9231 clear_const(¤t,rt1[i]);
9232 alloc_cc(¤t,i);
9233 dirty_reg(¤t,CCREG);
9234 if(rs1[i]!=rt1[i+1]&&rs1[i]!=rt2[i+1]) {
9235 alloc_reg(¤t,i,rs1[i]);
9237 alloc_reg(¤t,i,rt1[i]);
9238 dirty_reg(¤t,rt1[i]);
9239 assert(rs1[i+1]!=rt1[i]&&rs2[i+1]!=rt1[i]);
9240 assert(rt1[i+1]!=rt1[i]);
9242 alloc_reg(¤t,i,PTEMP);
9246 if(rs1[i]==31) { // JALR
9247 alloc_reg(¤t,i,RHASH);
9248 #ifndef HOST_IMM_ADDR32
9249 alloc_reg(¤t,i,RHTBL);
9253 delayslot_alloc(¤t,i+1);
9255 // The delay slot overwrites our source register,
9256 // allocate a temporary register to hold the old value.
9260 delayslot_alloc(¤t,i+1);
9262 alloc_reg(¤t,i,RTEMP);
9264 //current.isconst=0; // DEBUG
9269 //current.isconst=0;
9270 //current.wasconst=0;
9271 //regs[i].wasconst=0;
9272 clear_const(¤t,rs1[i]);
9273 clear_const(¤t,rs2[i]);
9274 if((opcode[i]&0x3E)==4) // BEQ/BNE
9276 alloc_cc(¤t,i);
9277 dirty_reg(¤t,CCREG);
9278 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9279 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
9280 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
9282 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9283 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
9285 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1]))||
9286 (rs2[i]&&(rs2[i]==rt1[i+1]||rs2[i]==rt2[i+1]))) {
9287 // The delay slot overwrites one of our conditions.
9288 // Allocate the branch condition registers instead.
9292 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9293 if(rs2[i]) alloc_reg(¤t,i,rs2[i]);
9294 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
9296 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9297 if(rs2[i]) alloc_reg64(¤t,i,rs2[i]);
9303 delayslot_alloc(¤t,i+1);
9307 if((opcode[i]&0x3E)==6) // BLEZ/BGTZ
9309 alloc_cc(¤t,i);
9310 dirty_reg(¤t,CCREG);
9311 alloc_reg(¤t,i,rs1[i]);
9312 if(!(current.is32>>rs1[i]&1))
9314 alloc_reg64(¤t,i,rs1[i]);
9316 if(rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) {
9317 // The delay slot overwrites one of our conditions.
9318 // Allocate the branch condition registers instead.
9322 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9323 if(!((current.is32>>rs1[i])&1))
9325 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9331 delayslot_alloc(¤t,i+1);
9335 // Don't alloc the delay slot yet because we might not execute it
9336 if((opcode[i]&0x3E)==0x14) // BEQL/BNEL
9341 alloc_cc(¤t,i);
9342 dirty_reg(¤t,CCREG);
9343 alloc_reg(¤t,i,rs1[i]);
9344 alloc_reg(¤t,i,rs2[i]);
9345 if(!((current.is32>>rs1[i])&(current.is32>>rs2[i])&1))
9347 alloc_reg64(¤t,i,rs1[i]);
9348 alloc_reg64(¤t,i,rs2[i]);
9352 if((opcode[i]&0x3E)==0x16) // BLEZL/BGTZL
9357 alloc_cc(¤t,i);
9358 dirty_reg(¤t,CCREG);
9359 alloc_reg(¤t,i,rs1[i]);
9360 if(!(current.is32>>rs1[i]&1))
9362 alloc_reg64(¤t,i,rs1[i]);
9366 //current.isconst=0;
9369 //current.isconst=0;
9370 //current.wasconst=0;
9371 //regs[i].wasconst=0;
9372 clear_const(¤t,rs1[i]);
9373 clear_const(¤t,rt1[i]);
9374 //if((opcode2[i]&0x1E)==0x0) // BLTZ/BGEZ
9375 if((opcode2[i]&0x0E)==0x0) // BLTZ/BGEZ
9377 alloc_cc(¤t,i);
9378 dirty_reg(¤t,CCREG);
9379 alloc_reg(¤t,i,rs1[i]);
9380 if(!(current.is32>>rs1[i]&1))
9382 alloc_reg64(¤t,i,rs1[i]);
9384 if (rt1[i]==31) { // BLTZAL/BGEZAL
9385 alloc_reg(¤t,i,31);
9386 dirty_reg(¤t,31);
9387 //#ifdef REG_PREFETCH
9388 //alloc_reg(¤t,i,PTEMP);
9390 //current.is32|=1LL<<rt1[i];
9392 if((rs1[i]&&(rs1[i]==rt1[i+1]||rs1[i]==rt2[i+1])) // The delay slot overwrites the branch condition.
9393 ||(rt1[i]==31&&(rs1[i+1]==31||rs2[i+1]==31||rt1[i+1]==31||rt2[i+1]==31))) { // DS touches $ra
9394 // Allocate the branch condition registers instead.
9398 if(rs1[i]) alloc_reg(¤t,i,rs1[i]);
9399 if(!((current.is32>>rs1[i])&1))
9401 if(rs1[i]) alloc_reg64(¤t,i,rs1[i]);
9407 delayslot_alloc(¤t,i+1);
9411 // Don't alloc the delay slot yet because we might not execute it
9412 if((opcode2[i]&0x1E)==0x2) // BLTZL/BGEZL
9417 alloc_cc(¤t,i);
9418 dirty_reg(¤t,CCREG);
9419 alloc_reg(¤t,i,rs1[i]);
9420 if(!(current.is32>>rs1[i]&1))
9422 alloc_reg64(¤t,i,rs1[i]);
9426 //current.isconst=0;
9432 if(likely[i]==0) // BC1F/BC1T
9434 // TODO: Theoretically we can run out of registers here on x86.
9435 // The delay slot can allocate up to six, and we need to check
9436 // CSREG before executing the delay slot. Possibly we can drop
9437 // the cycle count and then reload it after checking that the
9438 // FPU is in a usable state, or don't do out-of-order execution.
9439 alloc_cc(¤t,i);
9440 dirty_reg(¤t,CCREG);
9441 alloc_reg(¤t,i,FSREG);
9442 alloc_reg(¤t,i,CSREG);
9443 if(itype[i+1]==FCOMP) {
9444 // The delay slot overwrites the branch condition.
9445 // Allocate the branch condition registers instead.
9446 alloc_cc(¤t,i);
9447 dirty_reg(¤t,CCREG);
9448 alloc_reg(¤t,i,CSREG);
9449 alloc_reg(¤t,i,FSREG);
9453 delayslot_alloc(¤t,i+1);
9454 alloc_reg(¤t,i+1,CSREG);
9458 // Don't alloc the delay slot yet because we might not execute it
9459 if(likely[i]) // BC1FL/BC1TL
9461 alloc_cc(¤t,i);
9462 dirty_reg(¤t,CCREG);
9463 alloc_reg(¤t,i,CSREG);
9464 alloc_reg(¤t,i,FSREG);
9470 imm16_alloc(¤t,i);
9474 load_alloc(¤t,i);
9478 store_alloc(¤t,i);
9481 alu_alloc(¤t,i);
9484 shift_alloc(¤t,i);
9487 multdiv_alloc(¤t,i);
9490 shiftimm_alloc(¤t,i);
9493 mov_alloc(¤t,i);
9496 cop0_alloc(¤t,i);
9500 cop1_alloc(¤t,i);
9503 c1ls_alloc(¤t,i);
9506 c2ls_alloc(¤t,i);
9509 c2op_alloc(¤t,i);
9512 fconv_alloc(¤t,i);
9515 float_alloc(¤t,i);
9518 fcomp_alloc(¤t,i);
9523 syscall_alloc(¤t,i);
9526 pagespan_alloc(¤t,i);
9530 // Drop the upper half of registers that have become 32-bit
9531 current.uu|=current.is32&((1LL<<rt1[i])|(1LL<<rt2[i]));
9532 if(itype[i]!=UJUMP&&itype[i]!=CJUMP&&itype[i]!=SJUMP&&itype[i]!=RJUMP&&itype[i]!=FJUMP) {
9533 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9534 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9537 current.uu|=current.is32&((1LL<<rt1[i+1])|(1LL<<rt2[i+1]));
9538 current.uu&=~((1LL<<us1[i+1])|(1LL<<us2[i+1]));
9539 if((~current.uu>>rt1[i+1])&1) current.uu&=~((1LL<<dep1[i+1])|(1LL<<dep2[i+1]));
9540 current.uu&=~((1LL<<us1[i])|(1LL<<us2[i]));
9544 // Create entry (branch target) regmap
9545 for(hr=0;hr<HOST_REGS;hr++)
9548 r=current.regmap[hr];
9550 if(r!=regmap_pre[i][hr]) {
9551 // TODO: delay slot (?)
9552 or=get_reg(regmap_pre[i],r); // Get old mapping for this register
9553 if(or<0||(r&63)>=TEMPREG){
9554 regs[i].regmap_entry[hr]=-1;
9558 // Just move it to a different register
9559 regs[i].regmap_entry[hr]=r;
9560 // If it was dirty before, it's still dirty
9561 if((regs[i].wasdirty>>or)&1) dirty_reg(¤t,r&63);
9568 regs[i].regmap_entry[hr]=0;
9572 if((current.u>>r)&1) {
9573 regs[i].regmap_entry[hr]=-1;
9574 //regs[i].regmap[hr]=-1;
9575 current.regmap[hr]=-1;
9577 regs[i].regmap_entry[hr]=r;
9580 if((current.uu>>(r&63))&1) {
9581 regs[i].regmap_entry[hr]=-1;
9582 //regs[i].regmap[hr]=-1;
9583 current.regmap[hr]=-1;
9585 regs[i].regmap_entry[hr]=r;
9589 // Branches expect CCREG to be allocated at the target
9590 if(regmap_pre[i][hr]==CCREG)
9591 regs[i].regmap_entry[hr]=CCREG;
9593 regs[i].regmap_entry[hr]=-1;
9596 memcpy(regs[i].regmap,current.regmap,sizeof(current.regmap));
9599 if(i>0&&(itype[i-1]==STORE||itype[i-1]==STORELR||(itype[i-1]==C2LS&&opcode[i-1]==0x3a))&&(u_int)imm[i-1]<0x800)
9600 current.waswritten|=1<<rs1[i-1];
9601 current.waswritten&=~(1<<rt1[i]);
9602 current.waswritten&=~(1<<rt2[i]);
9603 if((itype[i]==STORE||itype[i]==STORELR||(itype[i]==C2LS&&opcode[i]==0x3a))&&(u_int)imm[i]>=0x800)
9604 current.waswritten&=~(1<<rs1[i]);
9606 /* Branch post-alloc */
9609 current.was32=current.is32;
9610 current.wasdirty=current.dirty;
9611 switch(itype[i-1]) {
9613 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9614 branch_regs[i-1].isconst=0;
9615 branch_regs[i-1].wasconst=0;
9616 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9617 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9618 alloc_cc(&branch_regs[i-1],i-1);
9619 dirty_reg(&branch_regs[i-1],CCREG);
9620 if(rt1[i-1]==31) { // JAL
9621 alloc_reg(&branch_regs[i-1],i-1,31);
9622 dirty_reg(&branch_regs[i-1],31);
9623 branch_regs[i-1].is32|=1LL<<31;
9625 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9626 memcpy(constmap[i],constmap[i-1],sizeof(current_constmap));
9629 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9630 branch_regs[i-1].isconst=0;
9631 branch_regs[i-1].wasconst=0;
9632 branch_regs[i-1].u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9633 branch_regs[i-1].uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9634 alloc_cc(&branch_regs[i-1],i-1);
9635 dirty_reg(&branch_regs[i-1],CCREG);
9636 alloc_reg(&branch_regs[i-1],i-1,rs1[i-1]);
9637 if(rt1[i-1]!=0) { // JALR
9638 alloc_reg(&branch_regs[i-1],i-1,rt1[i-1]);
9639 dirty_reg(&branch_regs[i-1],rt1[i-1]);
9640 branch_regs[i-1].is32|=1LL<<rt1[i-1];
9643 if(rs1[i-1]==31) { // JALR
9644 alloc_reg(&branch_regs[i-1],i-1,RHASH);
9645 #ifndef HOST_IMM_ADDR32
9646 alloc_reg(&branch_regs[i-1],i-1,RHTBL);
9650 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9651 memcpy(constmap[i],constmap[i-1],sizeof(current_constmap));
9654 if((opcode[i-1]&0x3E)==4) // BEQ/BNE
9656 alloc_cc(¤t,i-1);
9657 dirty_reg(¤t,CCREG);
9658 if((rs1[i-1]&&(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]))||
9659 (rs2[i-1]&&(rs2[i-1]==rt1[i]||rs2[i-1]==rt2[i]))) {
9660 // The delay slot overwrote one of our conditions
9661 // Delay slot goes after the test (in order)
9662 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9663 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9664 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9667 delayslot_alloc(¤t,i);
9672 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i-1])|(1LL<<rs2[i-1]));
9673 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i-1])|(1LL<<us2[i-1]));
9674 // Alloc the branch condition registers
9675 if(rs1[i-1]) alloc_reg(¤t,i-1,rs1[i-1]);
9676 if(rs2[i-1]) alloc_reg(¤t,i-1,rs2[i-1]);
9677 if(!((current.is32>>rs1[i-1])&(current.is32>>rs2[i-1])&1))
9679 if(rs1[i-1]) alloc_reg64(¤t,i-1,rs1[i-1]);
9680 if(rs2[i-1]) alloc_reg64(¤t,i-1,rs2[i-1]);
9683 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9684 branch_regs[i-1].isconst=0;
9685 branch_regs[i-1].wasconst=0;
9686 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9687 memcpy(constmap[i],constmap[i-1],sizeof(current_constmap));
9690 if((opcode[i-1]&0x3E)==6) // BLEZ/BGTZ
9692 alloc_cc(¤t,i-1);
9693 dirty_reg(¤t,CCREG);
9694 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9695 // The delay slot overwrote the branch condition
9696 // Delay slot goes after the test (in order)
9697 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9698 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9699 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9702 delayslot_alloc(¤t,i);
9707 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9708 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9709 // Alloc the branch condition register
9710 alloc_reg(¤t,i-1,rs1[i-1]);
9711 if(!(current.is32>>rs1[i-1]&1))
9713 alloc_reg64(¤t,i-1,rs1[i-1]);
9716 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9717 branch_regs[i-1].isconst=0;
9718 branch_regs[i-1].wasconst=0;
9719 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9720 memcpy(constmap[i],constmap[i-1],sizeof(current_constmap));
9723 // Alloc the delay slot in case the branch is taken
9724 if((opcode[i-1]&0x3E)==0x14) // BEQL/BNEL
9726 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9727 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9728 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9729 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9730 alloc_cc(&branch_regs[i-1],i);
9731 dirty_reg(&branch_regs[i-1],CCREG);
9732 delayslot_alloc(&branch_regs[i-1],i);
9733 branch_regs[i-1].isconst=0;
9734 alloc_reg(¤t,i,CCREG); // Not taken path
9735 dirty_reg(¤t,CCREG);
9736 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9739 if((opcode[i-1]&0x3E)==0x16) // BLEZL/BGTZL
9741 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9742 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9743 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9744 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9745 alloc_cc(&branch_regs[i-1],i);
9746 dirty_reg(&branch_regs[i-1],CCREG);
9747 delayslot_alloc(&branch_regs[i-1],i);
9748 branch_regs[i-1].isconst=0;
9749 alloc_reg(¤t,i,CCREG); // Not taken path
9750 dirty_reg(¤t,CCREG);
9751 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9755 //if((opcode2[i-1]&0x1E)==0) // BLTZ/BGEZ
9756 if((opcode2[i-1]&0x0E)==0) // BLTZ/BGEZ
9758 alloc_cc(¤t,i-1);
9759 dirty_reg(¤t,CCREG);
9760 if(rs1[i-1]==rt1[i]||rs1[i-1]==rt2[i]) {
9761 // The delay slot overwrote the branch condition
9762 // Delay slot goes after the test (in order)
9763 current.u=branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i]));
9764 current.uu=branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i]));
9765 if((~current.uu>>rt1[i])&1) current.uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]));
9768 delayslot_alloc(¤t,i);
9773 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9774 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9775 // Alloc the branch condition register
9776 alloc_reg(¤t,i-1,rs1[i-1]);
9777 if(!(current.is32>>rs1[i-1]&1))
9779 alloc_reg64(¤t,i-1,rs1[i-1]);
9782 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9783 branch_regs[i-1].isconst=0;
9784 branch_regs[i-1].wasconst=0;
9785 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9786 memcpy(constmap[i],constmap[i-1],sizeof(current_constmap));
9789 // Alloc the delay slot in case the branch is taken
9790 if((opcode2[i-1]&0x1E)==2) // BLTZL/BGEZL
9792 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9793 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9794 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9795 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9796 alloc_cc(&branch_regs[i-1],i);
9797 dirty_reg(&branch_regs[i-1],CCREG);
9798 delayslot_alloc(&branch_regs[i-1],i);
9799 branch_regs[i-1].isconst=0;
9800 alloc_reg(¤t,i,CCREG); // Not taken path
9801 dirty_reg(¤t,CCREG);
9802 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9804 // FIXME: BLTZAL/BGEZAL
9805 if(opcode2[i-1]&0x10) { // BxxZAL
9806 alloc_reg(&branch_regs[i-1],i-1,31);
9807 dirty_reg(&branch_regs[i-1],31);
9808 branch_regs[i-1].is32|=1LL<<31;
9812 if(likely[i-1]==0) // BC1F/BC1T
9814 alloc_cc(¤t,i-1);
9815 dirty_reg(¤t,CCREG);
9816 if(itype[i]==FCOMP) {
9817 // The delay slot overwrote the branch condition
9818 // Delay slot goes after the test (in order)
9819 delayslot_alloc(¤t,i);
9824 current.u=branch_unneeded_reg[i-1]&~(1LL<<rs1[i-1]);
9825 current.uu=branch_unneeded_reg_upper[i-1]&~(1LL<<us1[i-1]);
9826 // Alloc the branch condition register
9827 alloc_reg(¤t,i-1,FSREG);
9829 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9830 memcpy(&branch_regs[i-1].regmap_entry,¤t.regmap,sizeof(current.regmap));
9834 // Alloc the delay slot in case the branch is taken
9835 memcpy(&branch_regs[i-1],¤t,sizeof(current));
9836 branch_regs[i-1].u=(branch_unneeded_reg[i-1]&~((1LL<<rs1[i])|(1LL<<rs2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9837 branch_regs[i-1].uu=(branch_unneeded_reg_upper[i-1]&~((1LL<<us1[i])|(1LL<<us2[i])|(1LL<<rt1[i])|(1LL<<rt2[i])))|1;
9838 if((~branch_regs[i-1].uu>>rt1[i])&1) branch_regs[i-1].uu&=~((1LL<<dep1[i])|(1LL<<dep2[i]))|1;
9839 alloc_cc(&branch_regs[i-1],i);
9840 dirty_reg(&branch_regs[i-1],CCREG);
9841 delayslot_alloc(&branch_regs[i-1],i);
9842 branch_regs[i-1].isconst=0;
9843 alloc_reg(¤t,i,CCREG); // Not taken path
9844 dirty_reg(¤t,CCREG);
9845 memcpy(&branch_regs[i-1].regmap_entry,&branch_regs[i-1].regmap,sizeof(current.regmap));
9850 if(itype[i-1]==UJUMP||itype[i-1]==RJUMP||(source[i-1]>>16)==0x1000)
9852 if(rt1[i-1]==31) // JAL/JALR
9854 // Subroutine call will return here, don't alloc any registers
9857 clear_all_regs(current.regmap);
9858 alloc_reg(¤t,i,CCREG);
9859 dirty_reg(¤t,CCREG);
9863 // Internal branch will jump here, match registers to caller
9864 current.is32=0x3FFFFFFFFLL;
9866 clear_all_regs(current.regmap);
9867 alloc_reg(¤t,i,CCREG);
9868 dirty_reg(¤t,CCREG);
9871 if(ba[j]==start+i*4+4) {
9872 memcpy(current.regmap,branch_regs[j].regmap,sizeof(current.regmap));
9873 current.is32=branch_regs[j].is32;
9874 current.dirty=branch_regs[j].dirty;
9879 if(ba[j]==start+i*4+4) {
9880 for(hr=0;hr<HOST_REGS;hr++) {
9881 if(current.regmap[hr]!=branch_regs[j].regmap[hr]) {
9882 current.regmap[hr]=-1;
9884 current.is32&=branch_regs[j].is32;
9885 current.dirty&=branch_regs[j].dirty;
9894 // Count cycles in between branches
9896 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))
9900 #if defined(PCSX) && !defined(DRC_DBG)
9901 else if(itype[i]==C2OP&>e_cycletab[source[i]&0x3f]>2)
9903 // GTE runs in parallel until accessed, divide by 2 for a rough guess
9904 cc+=gte_cycletab[source[i]&0x3f]/2;
9906 else if(/*itype[i]==LOAD||itype[i]==STORE||*/itype[i]==C1LS) // load,store causes weird timing issues
9908 cc+=2; // 2 cycle penalty (after CLOCK_DIVIDER)
9910 else if(i>1&&itype[i]==STORE&&itype[i-1]==STORE&&itype[i-2]==STORE&&!bt[i])
9914 else if(itype[i]==C2LS)
9924 flush_dirty_uppers(¤t);
9926 regs[i].is32=current.is32;
9927 regs[i].dirty=current.dirty;
9928 regs[i].isconst=current.isconst;
9929 memcpy(constmap[i],current_constmap,sizeof(current_constmap));
9931 for(hr=0;hr<HOST_REGS;hr++) {
9932 if(hr!=EXCLUDE_REG&®s[i].regmap[hr]>=0) {
9933 if(regmap_pre[i][hr]!=regs[i].regmap[hr]) {
9934 regs[i].wasconst&=~(1<<hr);
9938 if(current.regmap[HOST_BTREG]==BTREG) current.regmap[HOST_BTREG]=-1;
9939 regs[i].waswritten=current.waswritten;
9942 /* Pass 4 - Cull unused host registers */
9946 for (i=slen-1;i>=0;i--)
9949 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
9951 if(ba[i]<start || ba[i]>=(start+slen*4))
9953 // Branch out of this block, don't need anything
9959 // Need whatever matches the target
9961 int t=(ba[i]-start)>>2;
9962 for(hr=0;hr<HOST_REGS;hr++)
9964 if(regs[i].regmap_entry[hr]>=0) {
9965 if(regs[i].regmap_entry[hr]==regs[t].regmap_entry[hr]) nr|=1<<hr;
9969 // Conditional branch may need registers for following instructions
9970 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
9973 nr|=needed_reg[i+2];
9974 for(hr=0;hr<HOST_REGS;hr++)
9976 if(regmap_pre[i+2][hr]>=0&&get_reg(regs[i+2].regmap_entry,regmap_pre[i+2][hr])<0) nr&=~(1<<hr);
9977 //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]);
9981 // Don't need stuff which is overwritten
9982 //if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
9983 //if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
9984 // Merge in delay slot
9985 for(hr=0;hr<HOST_REGS;hr++)
9988 // These are overwritten unless the branch is "likely"
9989 // and the delay slot is nullified if not taken
9990 if(rt1[i+1]&&rt1[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9991 if(rt2[i+1]&&rt2[i+1]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
9993 if(us1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9994 if(us2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
9995 if(rs1[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9996 if(rs2[i+1]==regmap_pre[i][hr]) nr|=1<<hr;
9997 if(us1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9998 if(us2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
9999 if(rs1[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
10000 if(rs2[i+1]==regs[i].regmap_entry[hr]) nr|=1<<hr;
10001 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1)) {
10002 if(dep1[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10003 if(dep2[i+1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10005 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1)) {
10006 if(dep1[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10007 if(dep2[i+1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10009 if(itype[i+1]==STORE || itype[i+1]==STORELR || (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) {
10010 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
10011 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
10015 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
10017 // SYSCALL instruction (software interrupt)
10020 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
10022 // ERET instruction (return from interrupt)
10028 for(hr=0;hr<HOST_REGS;hr++) {
10029 if(regmap_pre[i+1][hr]>=0&&get_reg(regs[i+1].regmap_entry,regmap_pre[i+1][hr])<0) nr&=~(1<<hr);
10030 if(regs[i].regmap[hr]!=regmap_pre[i+1][hr]) nr&=~(1<<hr);
10031 if(regs[i].regmap[hr]!=regmap_pre[i][hr]) nr&=~(1<<hr);
10032 if(regs[i].regmap[hr]<0) nr&=~(1<<hr);
10036 for(hr=0;hr<HOST_REGS;hr++)
10038 // Overwritten registers are not needed
10039 if(rt1[i]&&rt1[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
10040 if(rt2[i]&&rt2[i]==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
10041 if(FTEMP==(regs[i].regmap[hr]&63)) nr&=~(1<<hr);
10042 // Source registers are needed
10043 if(us1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10044 if(us2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10045 if(rs1[i]==regmap_pre[i][hr]) nr|=1<<hr;
10046 if(rs2[i]==regmap_pre[i][hr]) nr|=1<<hr;
10047 if(us1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10048 if(us2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10049 if(rs1[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
10050 if(rs2[i]==regs[i].regmap_entry[hr]) nr|=1<<hr;
10051 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1)) {
10052 if(dep1[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10053 if(dep1[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10055 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1)) {
10056 if(dep2[i]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10057 if(dep2[i]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10059 if(itype[i]==STORE || itype[i]==STORELR || (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) {
10060 if(regmap_pre[i][hr]==INVCP) nr|=1<<hr;
10061 if(regs[i].regmap_entry[hr]==INVCP) nr|=1<<hr;
10063 // Don't store a register immediately after writing it,
10064 // may prevent dual-issue.
10065 // But do so if this is a branch target, otherwise we
10066 // might have to load the register before the branch.
10067 if(i>0&&!bt[i]&&((regs[i].wasdirty>>hr)&1)) {
10068 if((regmap_pre[i][hr]>0&®map_pre[i][hr]<64&&!((unneeded_reg[i]>>regmap_pre[i][hr])&1)) ||
10069 (regmap_pre[i][hr]>64&&!((unneeded_reg_upper[i]>>(regmap_pre[i][hr]&63))&1)) ) {
10070 if(rt1[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10071 if(rt2[i-1]==(regmap_pre[i][hr]&63)) nr|=1<<hr;
10073 if((regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64&&!((unneeded_reg[i]>>regs[i].regmap_entry[hr])&1)) ||
10074 (regs[i].regmap_entry[hr]>64&&!((unneeded_reg_upper[i]>>(regs[i].regmap_entry[hr]&63))&1)) ) {
10075 if(rt1[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10076 if(rt2[i-1]==(regs[i].regmap_entry[hr]&63)) nr|=1<<hr;
10080 // Cycle count is needed at branches. Assume it is needed at the target too.
10081 if(i==0||bt[i]||itype[i]==CJUMP||itype[i]==FJUMP||itype[i]==SPAN) {
10082 if(regmap_pre[i][HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
10083 if(regs[i].regmap_entry[HOST_CCREG]==CCREG) nr|=1<<HOST_CCREG;
10088 // Deallocate unneeded registers
10089 for(hr=0;hr<HOST_REGS;hr++)
10091 if(!((nr>>hr)&1)) {
10092 if(regs[i].regmap_entry[hr]!=CCREG) regs[i].regmap_entry[hr]=-1;
10093 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
10094 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
10095 (regs[i].regmap[hr]&63)!=PTEMP && (regs[i].regmap[hr]&63)!=CCREG)
10097 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10100 regs[i].regmap[hr]=-1;
10101 regs[i].isconst&=~(1<<hr);
10103 regmap_pre[i+2][hr]=-1;
10104 regs[i+2].wasconst&=~(1<<hr);
10109 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10111 int d1=0,d2=0,map=0,temp=0;
10112 if(get_reg(regs[i].regmap,rt1[i+1]|64)>=0||get_reg(branch_regs[i].regmap,rt1[i+1]|64)>=0)
10118 if(itype[i+1]==LOAD || itype[i+1]==LOADLR ||
10119 itype[i+1]==STORE || itype[i+1]==STORELR ||
10120 itype[i+1]==C1LS || itype[i+1]==C2LS)
10123 if(itype[i+1]==STORE || itype[i+1]==STORELR ||
10124 (opcode[i+1]&0x3b)==0x39 || (opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
10127 if(itype[i+1]==LOADLR || itype[i+1]==STORELR ||
10128 itype[i+1]==C1LS || itype[i+1]==C2LS)
10130 if((regs[i].regmap[hr]&63)!=rs1[i] && (regs[i].regmap[hr]&63)!=rs2[i] &&
10131 (regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
10132 (regs[i].regmap[hr]&63)!=rt1[i+1] && (regs[i].regmap[hr]&63)!=rt2[i+1] &&
10133 (regs[i].regmap[hr]^64)!=us1[i+1] && (regs[i].regmap[hr]^64)!=us2[i+1] &&
10134 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
10135 regs[i].regmap[hr]!=rs1[i+1] && regs[i].regmap[hr]!=rs2[i+1] &&
10136 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=PTEMP &&
10137 regs[i].regmap[hr]!=RHASH && regs[i].regmap[hr]!=RHTBL &&
10138 regs[i].regmap[hr]!=RTEMP && regs[i].regmap[hr]!=CCREG &&
10139 regs[i].regmap[hr]!=map )
10141 regs[i].regmap[hr]=-1;
10142 regs[i].isconst&=~(1<<hr);
10143 if((branch_regs[i].regmap[hr]&63)!=rs1[i] && (branch_regs[i].regmap[hr]&63)!=rs2[i] &&
10144 (branch_regs[i].regmap[hr]&63)!=rt1[i] && (branch_regs[i].regmap[hr]&63)!=rt2[i] &&
10145 (branch_regs[i].regmap[hr]&63)!=rt1[i+1] && (branch_regs[i].regmap[hr]&63)!=rt2[i+1] &&
10146 (branch_regs[i].regmap[hr]^64)!=us1[i+1] && (branch_regs[i].regmap[hr]^64)!=us2[i+1] &&
10147 (branch_regs[i].regmap[hr]^64)!=d1 && (branch_regs[i].regmap[hr]^64)!=d2 &&
10148 branch_regs[i].regmap[hr]!=rs1[i+1] && branch_regs[i].regmap[hr]!=rs2[i+1] &&
10149 (branch_regs[i].regmap[hr]&63)!=temp && branch_regs[i].regmap[hr]!=PTEMP &&
10150 branch_regs[i].regmap[hr]!=RHASH && branch_regs[i].regmap[hr]!=RHTBL &&
10151 branch_regs[i].regmap[hr]!=RTEMP && branch_regs[i].regmap[hr]!=CCREG &&
10152 branch_regs[i].regmap[hr]!=map)
10154 branch_regs[i].regmap[hr]=-1;
10155 branch_regs[i].regmap_entry[hr]=-1;
10156 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10158 if(!likely[i]&&i<slen-2) {
10159 regmap_pre[i+2][hr]=-1;
10160 regs[i+2].wasconst&=~(1<<hr);
10171 int d1=0,d2=0,map=-1,temp=-1;
10172 if(get_reg(regs[i].regmap,rt1[i]|64)>=0)
10178 if(itype[i]==LOAD || itype[i]==LOADLR ||
10179 itype[i]==STORE || itype[i]==STORELR ||
10180 itype[i]==C1LS || itype[i]==C2LS)
10182 } else if(itype[i]==STORE || itype[i]==STORELR ||
10183 (opcode[i]&0x3b)==0x39 || (opcode[i]&0x3b)==0x3a) { // SWC1/SDC1 || SWC2/SDC2
10186 if(itype[i]==LOADLR || itype[i]==STORELR ||
10187 itype[i]==C1LS || itype[i]==C2LS)
10189 if((regs[i].regmap[hr]&63)!=rt1[i] && (regs[i].regmap[hr]&63)!=rt2[i] &&
10190 (regs[i].regmap[hr]^64)!=us1[i] && (regs[i].regmap[hr]^64)!=us2[i] &&
10191 (regs[i].regmap[hr]^64)!=d1 && (regs[i].regmap[hr]^64)!=d2 &&
10192 regs[i].regmap[hr]!=rs1[i] && regs[i].regmap[hr]!=rs2[i] &&
10193 (regs[i].regmap[hr]&63)!=temp && regs[i].regmap[hr]!=map &&
10194 (itype[i]!=SPAN||regs[i].regmap[hr]!=CCREG))
10196 if(i<slen-1&&!is_ds[i]) {
10197 if(regmap_pre[i+1][hr]!=-1 || regs[i].regmap[hr]!=-1)
10198 if(regmap_pre[i+1][hr]!=regs[i].regmap[hr])
10199 if(regs[i].regmap[hr]<64||!((regs[i].was32>>(regs[i].regmap[hr]&63))&1))
10201 SysPrintf("fail: %x (%d %d!=%d)\n",start+i*4,hr,regmap_pre[i+1][hr],regs[i].regmap[hr]);
10202 assert(regmap_pre[i+1][hr]==regs[i].regmap[hr]);
10204 regmap_pre[i+1][hr]=-1;
10205 if(regs[i+1].regmap_entry[hr]==CCREG) regs[i+1].regmap_entry[hr]=-1;
10206 regs[i+1].wasconst&=~(1<<hr);
10208 regs[i].regmap[hr]=-1;
10209 regs[i].isconst&=~(1<<hr);
10217 /* Pass 5 - Pre-allocate registers */
10219 // If a register is allocated during a loop, try to allocate it for the
10220 // entire loop, if possible. This avoids loading/storing registers
10221 // inside of the loop.
10223 signed char f_regmap[HOST_REGS];
10224 clear_all_regs(f_regmap);
10225 for(i=0;i<slen-1;i++)
10227 if(itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10229 if(ba[i]>=start && ba[i]<(start+i*4))
10230 if(itype[i+1]==NOP||itype[i+1]==MOV||itype[i+1]==ALU
10231 ||itype[i+1]==SHIFTIMM||itype[i+1]==IMM16||itype[i+1]==LOAD
10232 ||itype[i+1]==STORE||itype[i+1]==STORELR||itype[i+1]==C1LS
10233 ||itype[i+1]==SHIFT||itype[i+1]==COP1||itype[i+1]==FLOAT
10234 ||itype[i+1]==FCOMP||itype[i+1]==FCONV
10235 ||itype[i+1]==COP2||itype[i+1]==C2LS||itype[i+1]==C2OP)
10237 int t=(ba[i]-start)>>2;
10238 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
10239 if(t<2||(itype[t-2]!=UJUMP&&itype[t-2]!=RJUMP)||rt1[t-2]!=31) // call/ret assumes no registers allocated
10240 for(hr=0;hr<HOST_REGS;hr++)
10242 if(regs[i].regmap[hr]>64) {
10243 if(!((regs[i].dirty>>hr)&1))
10244 f_regmap[hr]=regs[i].regmap[hr];
10245 else f_regmap[hr]=-1;
10247 else if(regs[i].regmap[hr]>=0) {
10248 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10249 // dealloc old register
10251 for(n=0;n<HOST_REGS;n++)
10253 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10255 // and alloc new one
10256 f_regmap[hr]=regs[i].regmap[hr];
10259 if(branch_regs[i].regmap[hr]>64) {
10260 if(!((branch_regs[i].dirty>>hr)&1))
10261 f_regmap[hr]=branch_regs[i].regmap[hr];
10262 else f_regmap[hr]=-1;
10264 else if(branch_regs[i].regmap[hr]>=0) {
10265 if(f_regmap[hr]!=branch_regs[i].regmap[hr]) {
10266 // dealloc old register
10268 for(n=0;n<HOST_REGS;n++)
10270 if(f_regmap[n]==branch_regs[i].regmap[hr]) {f_regmap[n]=-1;}
10272 // and alloc new one
10273 f_regmap[hr]=branch_regs[i].regmap[hr];
10277 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1])
10278 f_regmap[hr]=branch_regs[i].regmap[hr];
10280 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1])
10281 f_regmap[hr]=branch_regs[i].regmap[hr];
10283 // Avoid dirty->clean transition
10284 #ifdef DESTRUCTIVE_WRITEBACK
10285 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;
10287 // This check is only strictly required in the DESTRUCTIVE_WRITEBACK
10288 // case above, however it's always a good idea. We can't hoist the
10289 // load if the register was already allocated, so there's no point
10290 // wasting time analyzing most of these cases. It only "succeeds"
10291 // when the mapping was different and the load can be replaced with
10292 // a mov, which is of negligible benefit. So such cases are
10294 if(f_regmap[hr]>0) {
10295 if(regs[t].regmap[hr]==f_regmap[hr]||(regs[t].regmap_entry[hr]<0&&get_reg(regmap_pre[t],f_regmap[hr])<0)) {
10296 int r=f_regmap[hr];
10299 //printf("Test %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
10300 if(r<34&&((unneeded_reg[j]>>r)&1)) break;
10301 if(r>63&&((unneeded_reg_upper[j]>>(r&63))&1)) break;
10303 // NB This can exclude the case where the upper-half
10304 // register is lower numbered than the lower-half
10305 // register. Not sure if it's worth fixing...
10306 if(get_reg(regs[j].regmap,r&63)<0) break;
10307 if(get_reg(regs[j].regmap_entry,r&63)<0) break;
10308 if(regs[j].is32&(1LL<<(r&63))) break;
10310 if(regs[j].regmap[hr]==f_regmap[hr]&&(f_regmap[hr]&63)<TEMPREG) {
10311 //printf("Hit %x -> %x, %x %d/%d\n",start+i*4,ba[i],start+j*4,hr,r);
10313 if(regs[i].regmap[hr]==-1&&branch_regs[i].regmap[hr]==-1) {
10314 if(get_reg(regs[i+2].regmap,f_regmap[hr])>=0) break;
10316 if(get_reg(regs[i].regmap,r&63)<0) break;
10317 if(get_reg(branch_regs[i].regmap,r&63)<0) break;
10320 while(k>1&®s[k-1].regmap[hr]==-1) {
10321 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10322 //printf("no free regs for store %x\n",start+(k-1)*4);
10325 if(get_reg(regs[k-1].regmap,f_regmap[hr])>=0) {
10326 //printf("no-match due to different register\n");
10329 if(itype[k-2]==UJUMP||itype[k-2]==RJUMP||itype[k-2]==CJUMP||itype[k-2]==SJUMP||itype[k-2]==FJUMP) {
10330 //printf("no-match due to branch\n");
10333 // call/ret fast path assumes no registers allocated
10334 if(k>2&&(itype[k-3]==UJUMP||itype[k-3]==RJUMP)&&rt1[k-3]==31) {
10338 // NB This can exclude the case where the upper-half
10339 // register is lower numbered than the lower-half
10340 // register. Not sure if it's worth fixing...
10341 if(get_reg(regs[k-1].regmap,r&63)<0) break;
10342 if(regs[k-1].is32&(1LL<<(r&63))) break;
10347 if((regs[k].is32&(1LL<<f_regmap[hr]))!=
10348 (regs[i+2].was32&(1LL<<f_regmap[hr]))) {
10349 //printf("bad match after branch\n");
10353 if(regs[k-1].regmap[hr]==f_regmap[hr]&®map_pre[k][hr]==f_regmap[hr]) {
10354 //printf("Extend r%d, %x ->\n",hr,start+k*4);
10356 regs[k].regmap_entry[hr]=f_regmap[hr];
10357 regs[k].regmap[hr]=f_regmap[hr];
10358 regmap_pre[k+1][hr]=f_regmap[hr];
10359 regs[k].wasdirty&=~(1<<hr);
10360 regs[k].dirty&=~(1<<hr);
10361 regs[k].wasdirty|=(1<<hr)®s[k-1].dirty;
10362 regs[k].dirty|=(1<<hr)®s[k].wasdirty;
10363 regs[k].wasconst&=~(1<<hr);
10364 regs[k].isconst&=~(1<<hr);
10369 //printf("Fail Extend r%d, %x ->\n",hr,start+k*4);
10372 assert(regs[i-1].regmap[hr]==f_regmap[hr]);
10373 if(regs[i-1].regmap[hr]==f_regmap[hr]&®map_pre[i][hr]==f_regmap[hr]) {
10374 //printf("OK fill %x (r%d)\n",start+i*4,hr);
10375 regs[i].regmap_entry[hr]=f_regmap[hr];
10376 regs[i].regmap[hr]=f_regmap[hr];
10377 regs[i].wasdirty&=~(1<<hr);
10378 regs[i].dirty&=~(1<<hr);
10379 regs[i].wasdirty|=(1<<hr)®s[i-1].dirty;
10380 regs[i].dirty|=(1<<hr)®s[i-1].dirty;
10381 regs[i].wasconst&=~(1<<hr);
10382 regs[i].isconst&=~(1<<hr);
10383 branch_regs[i].regmap_entry[hr]=f_regmap[hr];
10384 branch_regs[i].wasdirty&=~(1<<hr);
10385 branch_regs[i].wasdirty|=(1<<hr)®s[i].dirty;
10386 branch_regs[i].regmap[hr]=f_regmap[hr];
10387 branch_regs[i].dirty&=~(1<<hr);
10388 branch_regs[i].dirty|=(1<<hr)®s[i].dirty;
10389 branch_regs[i].wasconst&=~(1<<hr);
10390 branch_regs[i].isconst&=~(1<<hr);
10391 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000) {
10392 regmap_pre[i+2][hr]=f_regmap[hr];
10393 regs[i+2].wasdirty&=~(1<<hr);
10394 regs[i+2].wasdirty|=(1<<hr)®s[i].dirty;
10395 assert((branch_regs[i].is32&(1LL<<f_regmap[hr]))==
10396 (regs[i+2].was32&(1LL<<f_regmap[hr])));
10401 // Alloc register clean at beginning of loop,
10402 // but may dirty it in pass 6
10403 regs[k].regmap_entry[hr]=f_regmap[hr];
10404 regs[k].regmap[hr]=f_regmap[hr];
10405 regs[k].dirty&=~(1<<hr);
10406 regs[k].wasconst&=~(1<<hr);
10407 regs[k].isconst&=~(1<<hr);
10408 if(itype[k]==UJUMP||itype[k]==RJUMP||itype[k]==CJUMP||itype[k]==SJUMP||itype[k]==FJUMP) {
10409 branch_regs[k].regmap_entry[hr]=f_regmap[hr];
10410 branch_regs[k].regmap[hr]=f_regmap[hr];
10411 branch_regs[k].dirty&=~(1<<hr);
10412 branch_regs[k].wasconst&=~(1<<hr);
10413 branch_regs[k].isconst&=~(1<<hr);
10414 if(itype[k]!=RJUMP&&itype[k]!=UJUMP&&(source[k]>>16)!=0x1000) {
10415 regmap_pre[k+2][hr]=f_regmap[hr];
10416 regs[k+2].wasdirty&=~(1<<hr);
10417 assert((branch_regs[k].is32&(1LL<<f_regmap[hr]))==
10418 (regs[k+2].was32&(1LL<<f_regmap[hr])));
10423 regmap_pre[k+1][hr]=f_regmap[hr];
10424 regs[k+1].wasdirty&=~(1<<hr);
10427 if(regs[j].regmap[hr]==f_regmap[hr])
10428 regs[j].regmap_entry[hr]=f_regmap[hr];
10432 if(regs[j].regmap[hr]>=0)
10434 if(get_reg(regs[j].regmap,f_regmap[hr])>=0) {
10435 //printf("no-match due to different register\n");
10438 if((regs[j+1].is32&(1LL<<f_regmap[hr]))!=(regs[j].is32&(1LL<<f_regmap[hr]))) {
10439 //printf("32/64 mismatch %x %d\n",start+j*4,hr);
10442 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10444 // Stop on unconditional branch
10447 if(itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP)
10450 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1])
10453 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1])
10456 if(get_reg(branch_regs[j].regmap,f_regmap[hr])>=0) {
10457 //printf("no-match due to different register (branch)\n");
10461 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10462 //printf("No free regs for store %x\n",start+j*4);
10465 if(f_regmap[hr]>=64) {
10466 if(regs[j].is32&(1LL<<(f_regmap[hr]&63))) {
10471 if(get_reg(regs[j].regmap,f_regmap[hr]&63)<0) {
10482 // Non branch or undetermined branch target
10483 for(hr=0;hr<HOST_REGS;hr++)
10485 if(hr!=EXCLUDE_REG) {
10486 if(regs[i].regmap[hr]>64) {
10487 if(!((regs[i].dirty>>hr)&1))
10488 f_regmap[hr]=regs[i].regmap[hr];
10490 else if(regs[i].regmap[hr]>=0) {
10491 if(f_regmap[hr]!=regs[i].regmap[hr]) {
10492 // dealloc old register
10494 for(n=0;n<HOST_REGS;n++)
10496 if(f_regmap[n]==regs[i].regmap[hr]) {f_regmap[n]=-1;}
10498 // and alloc new one
10499 f_regmap[hr]=regs[i].regmap[hr];
10504 // Try to restore cycle count at branch targets
10506 for(j=i;j<slen-1;j++) {
10507 if(regs[j].regmap[HOST_CCREG]!=-1) break;
10508 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) {
10509 //printf("no free regs for store %x\n",start+j*4);
10513 if(regs[j].regmap[HOST_CCREG]==CCREG) {
10515 //printf("Extend CC, %x -> %x\n",start+k*4,start+j*4);
10517 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10518 regs[k].regmap[HOST_CCREG]=CCREG;
10519 regmap_pre[k+1][HOST_CCREG]=CCREG;
10520 regs[k+1].wasdirty|=1<<HOST_CCREG;
10521 regs[k].dirty|=1<<HOST_CCREG;
10522 regs[k].wasconst&=~(1<<HOST_CCREG);
10523 regs[k].isconst&=~(1<<HOST_CCREG);
10526 regs[j].regmap_entry[HOST_CCREG]=CCREG;
10528 // Work backwards from the branch target
10529 if(j>i&&f_regmap[HOST_CCREG]==CCREG)
10531 //printf("Extend backwards\n");
10534 while(regs[k-1].regmap[HOST_CCREG]==-1) {
10535 if(count_free_regs(regs[k-1].regmap)<=minimum_free_regs[k-1]) {
10536 //printf("no free regs for store %x\n",start+(k-1)*4);
10541 if(regs[k-1].regmap[HOST_CCREG]==CCREG) {
10542 //printf("Extend CC, %x ->\n",start+k*4);
10544 regs[k].regmap_entry[HOST_CCREG]=CCREG;
10545 regs[k].regmap[HOST_CCREG]=CCREG;
10546 regmap_pre[k+1][HOST_CCREG]=CCREG;
10547 regs[k+1].wasdirty|=1<<HOST_CCREG;
10548 regs[k].dirty|=1<<HOST_CCREG;
10549 regs[k].wasconst&=~(1<<HOST_CCREG);
10550 regs[k].isconst&=~(1<<HOST_CCREG);
10555 //printf("Fail Extend CC, %x ->\n",start+k*4);
10559 if(itype[i]!=STORE&&itype[i]!=STORELR&&itype[i]!=C1LS&&itype[i]!=SHIFT&&
10560 itype[i]!=NOP&&itype[i]!=MOV&&itype[i]!=ALU&&itype[i]!=SHIFTIMM&&
10561 itype[i]!=IMM16&&itype[i]!=LOAD&&itype[i]!=COP1&&itype[i]!=FLOAT&&
10562 itype[i]!=FCONV&&itype[i]!=FCOMP)
10564 memcpy(f_regmap,regs[i].regmap,sizeof(f_regmap));
10569 // Cache memory offset or tlb map pointer if a register is available
10570 #ifndef HOST_IMM_ADDR32
10575 int earliest_available[HOST_REGS];
10576 int loop_start[HOST_REGS];
10577 int score[HOST_REGS];
10578 int end[HOST_REGS];
10579 int reg=using_tlb?MMREG:ROREG;
10582 for(hr=0;hr<HOST_REGS;hr++) {
10583 score[hr]=0;earliest_available[hr]=0;
10584 loop_start[hr]=MAXBLOCK;
10586 for(i=0;i<slen-1;i++)
10588 // Can't do anything if no registers are available
10589 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i]) {
10590 for(hr=0;hr<HOST_REGS;hr++) {
10591 score[hr]=0;earliest_available[hr]=i+1;
10592 loop_start[hr]=MAXBLOCK;
10595 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10597 if(count_free_regs(branch_regs[i].regmap)<=minimum_free_regs[i+1]) {
10598 for(hr=0;hr<HOST_REGS;hr++) {
10599 score[hr]=0;earliest_available[hr]=i+1;
10600 loop_start[hr]=MAXBLOCK;
10604 if(count_free_regs(regs[i].regmap)<=minimum_free_regs[i+1]) {
10605 for(hr=0;hr<HOST_REGS;hr++) {
10606 score[hr]=0;earliest_available[hr]=i+1;
10607 loop_start[hr]=MAXBLOCK;
10612 // Mark unavailable registers
10613 for(hr=0;hr<HOST_REGS;hr++) {
10614 if(regs[i].regmap[hr]>=0) {
10615 score[hr]=0;earliest_available[hr]=i+1;
10616 loop_start[hr]=MAXBLOCK;
10618 if(itype[i]==UJUMP||itype[i]==RJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
10619 if(branch_regs[i].regmap[hr]>=0) {
10620 score[hr]=0;earliest_available[hr]=i+2;
10621 loop_start[hr]=MAXBLOCK;
10625 // No register allocations after unconditional jumps
10626 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
10628 for(hr=0;hr<HOST_REGS;hr++) {
10629 score[hr]=0;earliest_available[hr]=i+2;
10630 loop_start[hr]=MAXBLOCK;
10632 i++; // Skip delay slot too
10633 //printf("skip delay slot: %x\n",start+i*4);
10637 if(itype[i]==LOAD||itype[i]==LOADLR||
10638 itype[i]==STORE||itype[i]==STORELR||itype[i]==C1LS) {
10639 for(hr=0;hr<HOST_REGS;hr++) {
10640 if(hr!=EXCLUDE_REG) {
10642 for(j=i;j<slen-1;j++) {
10643 if(regs[j].regmap[hr]>=0) break;
10644 if(itype[j]==UJUMP||itype[j]==RJUMP||itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP) {
10645 if(branch_regs[j].regmap[hr]>=0) break;
10647 if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j+1]) break;
10649 if(count_free_regs(branch_regs[j].regmap)<=minimum_free_regs[j+1]) break;
10652 else if(count_free_regs(regs[j].regmap)<=minimum_free_regs[j]) break;
10653 if(itype[j]==UJUMP||itype[j]==RJUMP||itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP) {
10654 int t=(ba[j]-start)>>2;
10655 if(t<j&&t>=earliest_available[hr]) {
10656 if(t==1||(t>1&&itype[t-2]!=UJUMP&&itype[t-2]!=RJUMP)||(t>1&&rt1[t-2]!=31)) { // call/ret assumes no registers allocated
10657 // Score a point for hoisting loop invariant
10658 if(t<loop_start[hr]) loop_start[hr]=t;
10659 //printf("set loop_start: i=%x j=%x (%x)\n",start+i*4,start+j*4,start+t*4);
10665 if(regs[t].regmap[hr]==reg) {
10666 // Score a point if the branch target matches this register
10671 if(itype[j+1]==LOAD||itype[j+1]==LOADLR||
10672 itype[j+1]==STORE||itype[j+1]==STORELR||itype[j+1]==C1LS) {
10677 if(itype[j]==UJUMP||itype[j]==RJUMP||(source[j]>>16)==0x1000)
10679 // Stop on unconditional branch
10683 if(itype[j]==LOAD||itype[j]==LOADLR||
10684 itype[j]==STORE||itype[j]==STORELR||itype[j]==C1LS) {
10691 // Find highest score and allocate that register
10693 for(hr=0;hr<HOST_REGS;hr++) {
10694 if(hr!=EXCLUDE_REG) {
10695 if(score[hr]>score[maxscore]) {
10697 //printf("highest score: %d %d (%x->%x)\n",score[hr],hr,start+i*4,start+end[hr]*4);
10701 if(score[maxscore]>1)
10703 if(i<loop_start[maxscore]) loop_start[maxscore]=i;
10704 for(j=loop_start[maxscore];j<slen&&j<=end[maxscore];j++) {
10705 //if(regs[j].regmap[maxscore]>=0) {printf("oops: %x %x was %d=%d\n",loop_start[maxscore]*4+start,j*4+start,maxscore,regs[j].regmap[maxscore]);}
10706 assert(regs[j].regmap[maxscore]<0);
10707 if(j>loop_start[maxscore]) regs[j].regmap_entry[maxscore]=reg;
10708 regs[j].regmap[maxscore]=reg;
10709 regs[j].dirty&=~(1<<maxscore);
10710 regs[j].wasconst&=~(1<<maxscore);
10711 regs[j].isconst&=~(1<<maxscore);
10712 if(itype[j]==UJUMP||itype[j]==RJUMP||itype[j]==CJUMP||itype[j]==SJUMP||itype[j]==FJUMP) {
10713 branch_regs[j].regmap[maxscore]=reg;
10714 branch_regs[j].wasdirty&=~(1<<maxscore);
10715 branch_regs[j].dirty&=~(1<<maxscore);
10716 branch_regs[j].wasconst&=~(1<<maxscore);
10717 branch_regs[j].isconst&=~(1<<maxscore);
10718 if(itype[j]!=RJUMP&&itype[j]!=UJUMP&&(source[j]>>16)!=0x1000) {
10719 regmap_pre[j+2][maxscore]=reg;
10720 regs[j+2].wasdirty&=~(1<<maxscore);
10722 // loop optimization (loop_preload)
10723 int t=(ba[j]-start)>>2;
10724 if(t==loop_start[maxscore]) {
10725 if(t==1||(t>1&&itype[t-2]!=UJUMP&&itype[t-2]!=RJUMP)||(t>1&&rt1[t-2]!=31)) // call/ret assumes no registers allocated
10726 regs[t].regmap_entry[maxscore]=reg;
10731 if(j<1||(itype[j-1]!=RJUMP&&itype[j-1]!=UJUMP&&itype[j-1]!=CJUMP&&itype[j-1]!=SJUMP&&itype[j-1]!=FJUMP)) {
10732 regmap_pre[j+1][maxscore]=reg;
10733 regs[j+1].wasdirty&=~(1<<maxscore);
10738 if(itype[j-1]==RJUMP||itype[j-1]==UJUMP||itype[j-1]==CJUMP||itype[j-1]==SJUMP||itype[j-1]==FJUMP) i++; // skip delay slot
10739 for(hr=0;hr<HOST_REGS;hr++) {
10740 score[hr]=0;earliest_available[hr]=i+i;
10741 loop_start[hr]=MAXBLOCK;
10749 // This allocates registers (if possible) one instruction prior
10750 // to use, which can avoid a load-use penalty on certain CPUs.
10751 for(i=0;i<slen-1;i++)
10753 if(!i||(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP))
10757 if(itype[i]==ALU||itype[i]==MOV||itype[i]==LOAD||itype[i]==SHIFTIMM||itype[i]==IMM16
10758 ||((itype[i]==COP1||itype[i]==COP2)&&opcode2[i]<3))
10761 if((hr=get_reg(regs[i+1].regmap,rs1[i+1]))>=0)
10763 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10765 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10766 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10767 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10768 regs[i].isconst&=~(1<<hr);
10769 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10770 constmap[i][hr]=constmap[i+1][hr];
10771 regs[i+1].wasdirty&=~(1<<hr);
10772 regs[i].dirty&=~(1<<hr);
10777 if((hr=get_reg(regs[i+1].regmap,rs2[i+1]))>=0)
10779 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10781 regs[i].regmap[hr]=regs[i+1].regmap[hr];
10782 regmap_pre[i+1][hr]=regs[i+1].regmap[hr];
10783 regs[i+1].regmap_entry[hr]=regs[i+1].regmap[hr];
10784 regs[i].isconst&=~(1<<hr);
10785 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10786 constmap[i][hr]=constmap[i+1][hr];
10787 regs[i+1].wasdirty&=~(1<<hr);
10788 regs[i].dirty&=~(1<<hr);
10792 // Preload target address for load instruction (non-constant)
10793 if(itype[i+1]==LOAD&&rs1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10794 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10796 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10798 regs[i].regmap[hr]=rs1[i+1];
10799 regmap_pre[i+1][hr]=rs1[i+1];
10800 regs[i+1].regmap_entry[hr]=rs1[i+1];
10801 regs[i].isconst&=~(1<<hr);
10802 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10803 constmap[i][hr]=constmap[i+1][hr];
10804 regs[i+1].wasdirty&=~(1<<hr);
10805 regs[i].dirty&=~(1<<hr);
10809 // Load source into target register
10810 if(lt1[i+1]&&get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10811 if((hr=get_reg(regs[i+1].regmap,rt1[i+1]))>=0)
10813 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10815 regs[i].regmap[hr]=rs1[i+1];
10816 regmap_pre[i+1][hr]=rs1[i+1];
10817 regs[i+1].regmap_entry[hr]=rs1[i+1];
10818 regs[i].isconst&=~(1<<hr);
10819 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10820 constmap[i][hr]=constmap[i+1][hr];
10821 regs[i+1].wasdirty&=~(1<<hr);
10822 regs[i].dirty&=~(1<<hr);
10826 // Preload map address
10827 #ifndef HOST_IMM_ADDR32
10828 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) {
10829 hr=get_reg(regs[i+1].regmap,TLREG);
10831 int sr=get_reg(regs[i+1].regmap,rs1[i+1]);
10832 if(sr>=0&&((regs[i+1].wasconst>>sr)&1)) {
10834 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10836 regs[i].regmap[hr]=MGEN1+((i+1)&1);
10837 regmap_pre[i+1][hr]=MGEN1+((i+1)&1);
10838 regs[i+1].regmap_entry[hr]=MGEN1+((i+1)&1);
10839 regs[i].isconst&=~(1<<hr);
10840 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10841 constmap[i][hr]=constmap[i+1][hr];
10842 regs[i+1].wasdirty&=~(1<<hr);
10843 regs[i].dirty&=~(1<<hr);
10845 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10847 // move it to another register
10848 regs[i+1].regmap[hr]=-1;
10849 regmap_pre[i+2][hr]=-1;
10850 regs[i+1].regmap[nr]=TLREG;
10851 regmap_pre[i+2][nr]=TLREG;
10852 regs[i].regmap[nr]=MGEN1+((i+1)&1);
10853 regmap_pre[i+1][nr]=MGEN1+((i+1)&1);
10854 regs[i+1].regmap_entry[nr]=MGEN1+((i+1)&1);
10855 regs[i].isconst&=~(1<<nr);
10856 regs[i+1].isconst&=~(1<<nr);
10857 regs[i].dirty&=~(1<<nr);
10858 regs[i+1].wasdirty&=~(1<<nr);
10859 regs[i+1].dirty&=~(1<<nr);
10860 regs[i+2].wasdirty&=~(1<<nr);
10866 // Address for store instruction (non-constant)
10867 if(itype[i+1]==STORE||itype[i+1]==STORELR
10868 ||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SB/SH/SW/SD/SWC1/SDC1/SWC2/SDC2
10869 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10870 hr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1);
10871 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10872 else {regs[i+1].regmap[hr]=AGEN1+((i+1)&1);regs[i+1].isconst&=~(1<<hr);}
10874 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10876 regs[i].regmap[hr]=rs1[i+1];
10877 regmap_pre[i+1][hr]=rs1[i+1];
10878 regs[i+1].regmap_entry[hr]=rs1[i+1];
10879 regs[i].isconst&=~(1<<hr);
10880 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10881 constmap[i][hr]=constmap[i+1][hr];
10882 regs[i+1].wasdirty&=~(1<<hr);
10883 regs[i].dirty&=~(1<<hr);
10887 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) { // LWC1/LDC1, LWC2/LDC2
10888 if(get_reg(regs[i+1].regmap,rs1[i+1])<0) {
10890 hr=get_reg(regs[i+1].regmap,FTEMP);
10892 if(regs[i].regmap[hr]<0&®s[i+1].regmap_entry[hr]<0)
10894 regs[i].regmap[hr]=rs1[i+1];
10895 regmap_pre[i+1][hr]=rs1[i+1];
10896 regs[i+1].regmap_entry[hr]=rs1[i+1];
10897 regs[i].isconst&=~(1<<hr);
10898 regs[i].isconst|=regs[i+1].isconst&(1<<hr);
10899 constmap[i][hr]=constmap[i+1][hr];
10900 regs[i+1].wasdirty&=~(1<<hr);
10901 regs[i].dirty&=~(1<<hr);
10903 else if((nr=get_reg2(regs[i].regmap,regs[i+1].regmap,-1))>=0)
10905 // move it to another register
10906 regs[i+1].regmap[hr]=-1;
10907 regmap_pre[i+2][hr]=-1;
10908 regs[i+1].regmap[nr]=FTEMP;
10909 regmap_pre[i+2][nr]=FTEMP;
10910 regs[i].regmap[nr]=rs1[i+1];
10911 regmap_pre[i+1][nr]=rs1[i+1];
10912 regs[i+1].regmap_entry[nr]=rs1[i+1];
10913 regs[i].isconst&=~(1<<nr);
10914 regs[i+1].isconst&=~(1<<nr);
10915 regs[i].dirty&=~(1<<nr);
10916 regs[i+1].wasdirty&=~(1<<nr);
10917 regs[i+1].dirty&=~(1<<nr);
10918 regs[i+2].wasdirty&=~(1<<nr);
10922 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*/) {
10923 if(itype[i+1]==LOAD)
10924 hr=get_reg(regs[i+1].regmap,rt1[i+1]);
10925 if(itype[i+1]==LOADLR||(opcode[i+1]&0x3b)==0x31||(opcode[i+1]&0x3b)==0x32) // LWC1/LDC1, LWC2/LDC2
10926 hr=get_reg(regs[i+1].regmap,FTEMP);
10927 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a) { // SWC1/SDC1/SWC2/SDC2
10928 hr=get_reg(regs[i+1].regmap,AGEN1+((i+1)&1));
10929 if(hr<0) hr=get_reg(regs[i+1].regmap,-1);
10931 if(hr>=0&®s[i].regmap[hr]<0) {
10932 int rs=get_reg(regs[i+1].regmap,rs1[i+1]);
10933 if(rs>=0&&((regs[i+1].wasconst>>rs)&1)) {
10934 regs[i].regmap[hr]=AGEN1+((i+1)&1);
10935 regmap_pre[i+1][hr]=AGEN1+((i+1)&1);
10936 regs[i+1].regmap_entry[hr]=AGEN1+((i+1)&1);
10937 regs[i].isconst&=~(1<<hr);
10938 regs[i+1].wasdirty&=~(1<<hr);
10939 regs[i].dirty&=~(1<<hr);
10948 /* Pass 6 - Optimize clean/dirty state */
10949 clean_registers(0,slen-1,1);
10951 /* Pass 7 - Identify 32-bit registers */
10957 for (i=slen-1;i>=0;i--)
10960 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
10962 if(ba[i]<start || ba[i]>=(start+slen*4))
10964 // Branch out of this block, don't need anything
10970 // Need whatever matches the target
10971 // (and doesn't get overwritten by the delay slot instruction)
10973 int t=(ba[i]-start)>>2;
10974 if(ba[i]>start+i*4) {
10976 if(!(requires_32bit[t]&~regs[i].was32))
10977 r32|=requires_32bit[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10980 //if(!(regs[t].was32&~unneeded_reg_upper[t]&~regs[i].was32))
10981 // r32|=regs[t].was32&~unneeded_reg_upper[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10982 if(!(pr32[t]&~regs[i].was32))
10983 r32|=pr32[t]&(~(1LL<<rt1[i+1]))&(~(1LL<<rt2[i+1]));
10986 // Conditional branch may need registers for following instructions
10987 if(itype[i]!=RJUMP&&itype[i]!=UJUMP&&(source[i]>>16)!=0x1000)
10990 r32|=requires_32bit[i+2];
10991 r32&=regs[i].was32;
10992 // Mark this address as a branch target since it may be called
10993 // upon return from interrupt
10997 // Merge in delay slot
10999 // These are overwritten unless the branch is "likely"
11000 // and the delay slot is nullified if not taken
11001 r32&=~(1LL<<rt1[i+1]);
11002 r32&=~(1LL<<rt2[i+1]);
11004 // Assume these are needed (delay slot)
11007 if((regs[i].was32>>us1[i+1])&1) r32|=1LL<<us1[i+1];
11011 if((regs[i].was32>>us2[i+1])&1) r32|=1LL<<us2[i+1];
11013 if(dep1[i+1]&&!((unneeded_reg_upper[i]>>dep1[i+1])&1))
11015 if((regs[i].was32>>dep1[i+1])&1) r32|=1LL<<dep1[i+1];
11017 if(dep2[i+1]&&!((unneeded_reg_upper[i]>>dep2[i+1])&1))
11019 if((regs[i].was32>>dep2[i+1])&1) r32|=1LL<<dep2[i+1];
11022 else if(itype[i]==SYSCALL||itype[i]==HLECALL||itype[i]==INTCALL)
11024 // SYSCALL instruction (software interrupt)
11027 else if(itype[i]==COP0 && (source[i]&0x3f)==0x18)
11029 // ERET instruction (return from interrupt)
11033 r32&=~(1LL<<rt1[i]);
11034 r32&=~(1LL<<rt2[i]);
11037 if((regs[i].was32>>us1[i])&1) r32|=1LL<<us1[i];
11041 if((regs[i].was32>>us2[i])&1) r32|=1LL<<us2[i];
11043 if(dep1[i]&&!((unneeded_reg_upper[i]>>dep1[i])&1))
11045 if((regs[i].was32>>dep1[i])&1) r32|=1LL<<dep1[i];
11047 if(dep2[i]&&!((unneeded_reg_upper[i]>>dep2[i])&1))
11049 if((regs[i].was32>>dep2[i])&1) r32|=1LL<<dep2[i];
11051 requires_32bit[i]=r32;
11053 // Dirty registers which are 32-bit, require 32-bit input
11054 // as they will be written as 32-bit values
11055 for(hr=0;hr<HOST_REGS;hr++)
11057 if(regs[i].regmap_entry[hr]>0&®s[i].regmap_entry[hr]<64) {
11058 if((regs[i].was32>>regs[i].regmap_entry[hr])&(regs[i].wasdirty>>hr)&1) {
11059 if(!((unneeded_reg_upper[i]>>regs[i].regmap_entry[hr])&1))
11060 requires_32bit[i]|=1LL<<regs[i].regmap_entry[hr];
11064 //requires_32bit[i]=is32[i]&~unneeded_reg_upper[i]; // DEBUG
11067 for (i=slen-1;i>=0;i--)
11069 if(itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
11071 // Conditional branch
11072 if((source[i]>>16)!=0x1000&&i<slen-2) {
11073 // Mark this address as a branch target since it may be called
11074 // upon return from interrupt
11081 if(itype[slen-1]==SPAN) {
11082 bt[slen-1]=1; // Mark as a branch target so instruction can restart after exception
11086 /* Debug/disassembly */
11087 for(i=0;i<slen;i++)
11091 for(r=1;r<=CCREG;r++) {
11092 if((unneeded_reg[i]>>r)&1) {
11093 if(r==HIREG) printf(" HI");
11094 else if(r==LOREG) printf(" LO");
11095 else printf(" r%d",r);
11100 for(r=1;r<=CCREG;r++) {
11101 if(((unneeded_reg_upper[i]&~unneeded_reg[i])>>r)&1) {
11102 if(r==HIREG) printf(" HI");
11103 else if(r==LOREG) printf(" LO");
11104 else printf(" r%d",r);
11108 for(r=0;r<=CCREG;r++) {
11109 //if(((is32[i]>>r)&(~unneeded_reg[i]>>r))&1) {
11110 if((regs[i].was32>>r)&1) {
11111 if(r==CCREG) printf(" CC");
11112 else if(r==HIREG) printf(" HI");
11113 else if(r==LOREG) printf(" LO");
11114 else printf(" r%d",r);
11119 #if defined(__i386__) || defined(__x86_64__)
11120 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]);
11123 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]);
11126 if(needed_reg[i]&1) printf("eax ");
11127 if((needed_reg[i]>>1)&1) printf("ecx ");
11128 if((needed_reg[i]>>2)&1) printf("edx ");
11129 if((needed_reg[i]>>3)&1) printf("ebx ");
11130 if((needed_reg[i]>>5)&1) printf("ebp ");
11131 if((needed_reg[i]>>6)&1) printf("esi ");
11132 if((needed_reg[i]>>7)&1) printf("edi ");
11134 for(r=0;r<=CCREG;r++) {
11135 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
11136 if((requires_32bit[i]>>r)&1) {
11137 if(r==CCREG) printf(" CC");
11138 else if(r==HIREG) printf(" HI");
11139 else if(r==LOREG) printf(" LO");
11140 else printf(" r%d",r);
11145 for(r=0;r<=CCREG;r++) {
11146 //if(((requires_32bit[i]>>r)&(~unneeded_reg[i]>>r))&1) {
11147 if((pr32[i]>>r)&1) {
11148 if(r==CCREG) printf(" CC");
11149 else if(r==HIREG) printf(" HI");
11150 else if(r==LOREG) printf(" LO");
11151 else printf(" r%d",r);
11154 if(pr32[i]!=requires_32bit[i]) printf(" OOPS");
11156 #if defined(__i386__) || defined(__x86_64__)
11157 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]);
11159 if(regs[i].wasdirty&1) printf("eax ");
11160 if((regs[i].wasdirty>>1)&1) printf("ecx ");
11161 if((regs[i].wasdirty>>2)&1) printf("edx ");
11162 if((regs[i].wasdirty>>3)&1) printf("ebx ");
11163 if((regs[i].wasdirty>>5)&1) printf("ebp ");
11164 if((regs[i].wasdirty>>6)&1) printf("esi ");
11165 if((regs[i].wasdirty>>7)&1) printf("edi ");
11168 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]);
11170 if(regs[i].wasdirty&1) printf("r0 ");
11171 if((regs[i].wasdirty>>1)&1) printf("r1 ");
11172 if((regs[i].wasdirty>>2)&1) printf("r2 ");
11173 if((regs[i].wasdirty>>3)&1) printf("r3 ");
11174 if((regs[i].wasdirty>>4)&1) printf("r4 ");
11175 if((regs[i].wasdirty>>5)&1) printf("r5 ");
11176 if((regs[i].wasdirty>>6)&1) printf("r6 ");
11177 if((regs[i].wasdirty>>7)&1) printf("r7 ");
11178 if((regs[i].wasdirty>>8)&1) printf("r8 ");
11179 if((regs[i].wasdirty>>9)&1) printf("r9 ");
11180 if((regs[i].wasdirty>>10)&1) printf("r10 ");
11181 if((regs[i].wasdirty>>12)&1) printf("r12 ");
11184 disassemble_inst(i);
11185 //printf ("ccadj[%d] = %d\n",i,ccadj[i]);
11186 #if defined(__i386__) || defined(__x86_64__)
11187 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]);
11188 if(regs[i].dirty&1) printf("eax ");
11189 if((regs[i].dirty>>1)&1) printf("ecx ");
11190 if((regs[i].dirty>>2)&1) printf("edx ");
11191 if((regs[i].dirty>>3)&1) printf("ebx ");
11192 if((regs[i].dirty>>5)&1) printf("ebp ");
11193 if((regs[i].dirty>>6)&1) printf("esi ");
11194 if((regs[i].dirty>>7)&1) printf("edi ");
11197 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]);
11198 if(regs[i].dirty&1) printf("r0 ");
11199 if((regs[i].dirty>>1)&1) printf("r1 ");
11200 if((regs[i].dirty>>2)&1) printf("r2 ");
11201 if((regs[i].dirty>>3)&1) printf("r3 ");
11202 if((regs[i].dirty>>4)&1) printf("r4 ");
11203 if((regs[i].dirty>>5)&1) printf("r5 ");
11204 if((regs[i].dirty>>6)&1) printf("r6 ");
11205 if((regs[i].dirty>>7)&1) printf("r7 ");
11206 if((regs[i].dirty>>8)&1) printf("r8 ");
11207 if((regs[i].dirty>>9)&1) printf("r9 ");
11208 if((regs[i].dirty>>10)&1) printf("r10 ");
11209 if((regs[i].dirty>>12)&1) printf("r12 ");
11212 if(regs[i].isconst) {
11213 printf("constants: ");
11214 #if defined(__i386__) || defined(__x86_64__)
11215 if(regs[i].isconst&1) printf("eax=%x ",(int)constmap[i][0]);
11216 if((regs[i].isconst>>1)&1) printf("ecx=%x ",(int)constmap[i][1]);
11217 if((regs[i].isconst>>2)&1) printf("edx=%x ",(int)constmap[i][2]);
11218 if((regs[i].isconst>>3)&1) printf("ebx=%x ",(int)constmap[i][3]);
11219 if((regs[i].isconst>>5)&1) printf("ebp=%x ",(int)constmap[i][5]);
11220 if((regs[i].isconst>>6)&1) printf("esi=%x ",(int)constmap[i][6]);
11221 if((regs[i].isconst>>7)&1) printf("edi=%x ",(int)constmap[i][7]);
11224 if(regs[i].isconst&1) printf("r0=%x ",(int)constmap[i][0]);
11225 if((regs[i].isconst>>1)&1) printf("r1=%x ",(int)constmap[i][1]);
11226 if((regs[i].isconst>>2)&1) printf("r2=%x ",(int)constmap[i][2]);
11227 if((regs[i].isconst>>3)&1) printf("r3=%x ",(int)constmap[i][3]);
11228 if((regs[i].isconst>>4)&1) printf("r4=%x ",(int)constmap[i][4]);
11229 if((regs[i].isconst>>5)&1) printf("r5=%x ",(int)constmap[i][5]);
11230 if((regs[i].isconst>>6)&1) printf("r6=%x ",(int)constmap[i][6]);
11231 if((regs[i].isconst>>7)&1) printf("r7=%x ",(int)constmap[i][7]);
11232 if((regs[i].isconst>>8)&1) printf("r8=%x ",(int)constmap[i][8]);
11233 if((regs[i].isconst>>9)&1) printf("r9=%x ",(int)constmap[i][9]);
11234 if((regs[i].isconst>>10)&1) printf("r10=%x ",(int)constmap[i][10]);
11235 if((regs[i].isconst>>12)&1) printf("r12=%x ",(int)constmap[i][12]);
11241 for(r=0;r<=CCREG;r++) {
11242 if((regs[i].is32>>r)&1) {
11243 if(r==CCREG) printf(" CC");
11244 else if(r==HIREG) printf(" HI");
11245 else if(r==LOREG) printf(" LO");
11246 else printf(" r%d",r);
11252 for(r=0;r<=CCREG;r++) {
11253 if((p32[i]>>r)&1) {
11254 if(r==CCREG) printf(" CC");
11255 else if(r==HIREG) printf(" HI");
11256 else if(r==LOREG) printf(" LO");
11257 else printf(" r%d",r);
11260 if(p32[i]!=regs[i].is32) printf(" NO MATCH\n");
11261 else printf("\n");*/
11262 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP) {
11263 #if defined(__i386__) || defined(__x86_64__)
11264 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]);
11265 if(branch_regs[i].dirty&1) printf("eax ");
11266 if((branch_regs[i].dirty>>1)&1) printf("ecx ");
11267 if((branch_regs[i].dirty>>2)&1) printf("edx ");
11268 if((branch_regs[i].dirty>>3)&1) printf("ebx ");
11269 if((branch_regs[i].dirty>>5)&1) printf("ebp ");
11270 if((branch_regs[i].dirty>>6)&1) printf("esi ");
11271 if((branch_regs[i].dirty>>7)&1) printf("edi ");
11274 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]);
11275 if(branch_regs[i].dirty&1) printf("r0 ");
11276 if((branch_regs[i].dirty>>1)&1) printf("r1 ");
11277 if((branch_regs[i].dirty>>2)&1) printf("r2 ");
11278 if((branch_regs[i].dirty>>3)&1) printf("r3 ");
11279 if((branch_regs[i].dirty>>4)&1) printf("r4 ");
11280 if((branch_regs[i].dirty>>5)&1) printf("r5 ");
11281 if((branch_regs[i].dirty>>6)&1) printf("r6 ");
11282 if((branch_regs[i].dirty>>7)&1) printf("r7 ");
11283 if((branch_regs[i].dirty>>8)&1) printf("r8 ");
11284 if((branch_regs[i].dirty>>9)&1) printf("r9 ");
11285 if((branch_regs[i].dirty>>10)&1) printf("r10 ");
11286 if((branch_regs[i].dirty>>12)&1) printf("r12 ");
11290 for(r=0;r<=CCREG;r++) {
11291 if((branch_regs[i].is32>>r)&1) {
11292 if(r==CCREG) printf(" CC");
11293 else if(r==HIREG) printf(" HI");
11294 else if(r==LOREG) printf(" LO");
11295 else printf(" r%d",r);
11304 /* Pass 8 - Assembly */
11305 linkcount=0;stubcount=0;
11306 ds=0;is_delayslot=0;
11308 uint64_t is32_pre=0;
11310 u_int beginning=(u_int)out;
11311 if((u_int)addr&1) {
11315 u_int instr_addr0_override=0;
11318 if (start == 0x80030000) {
11319 // nasty hack for fastbios thing
11320 // override block entry to this code
11321 instr_addr0_override=(u_int)out;
11322 emit_movimm(start,0);
11323 // abuse io address var as a flag that we
11324 // have already returned here once
11325 emit_readword((int)&address,1);
11326 emit_writeword(0,(int)&pcaddr);
11327 emit_writeword(0,(int)&address);
11329 emit_jne((int)new_dyna_leave);
11332 for(i=0;i<slen;i++)
11334 //if(ds) printf("ds: ");
11335 disassemble_inst(i);
11337 ds=0; // Skip delay slot
11338 if(bt[i]) assem_debug("OOPS - branch into delay slot\n");
11341 speculate_register_values(i);
11342 #ifndef DESTRUCTIVE_WRITEBACK
11343 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
11345 wb_sx(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,is32_pre,regs[i].was32,
11346 unneeded_reg[i],unneeded_reg_upper[i]);
11347 wb_valid(regmap_pre[i],regs[i].regmap_entry,dirty_pre,regs[i].wasdirty,is32_pre,
11348 unneeded_reg[i],unneeded_reg_upper[i]);
11350 if((itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)&&!likely[i]) {
11351 is32_pre=branch_regs[i].is32;
11352 dirty_pre=branch_regs[i].dirty;
11354 is32_pre=regs[i].is32;
11355 dirty_pre=regs[i].dirty;
11359 if(i<2||(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000))
11361 wb_invalidate(regmap_pre[i],regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32,
11362 unneeded_reg[i],unneeded_reg_upper[i]);
11363 loop_preload(regmap_pre[i],regs[i].regmap_entry);
11365 // branch target entry point
11366 instr_addr[i]=(u_int)out;
11367 assem_debug("<->\n");
11369 if(regs[i].regmap_entry[HOST_CCREG]==CCREG&®s[i].regmap[HOST_CCREG]!=CCREG)
11370 wb_register(CCREG,regs[i].regmap_entry,regs[i].wasdirty,regs[i].was32);
11371 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i],rs2[i]);
11372 address_generation(i,®s[i],regs[i].regmap_entry);
11373 load_consts(regmap_pre[i],regs[i].regmap,regs[i].was32,i);
11374 if(itype[i]==RJUMP||itype[i]==UJUMP||itype[i]==CJUMP||itype[i]==SJUMP||itype[i]==FJUMP)
11376 // Load the delay slot registers if necessary
11377 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i]&&(rs1[i+1]!=rt1[i]||rt1[i]==0))
11378 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
11379 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i]&&(rs2[i+1]!=rt1[i]||rt1[i]==0))
11380 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
11381 if(itype[i+1]==STORE||itype[i+1]==STORELR||(opcode[i+1]&0x3b)==0x39||(opcode[i+1]&0x3b)==0x3a)
11382 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
11386 // Preload registers for following instruction
11387 if(rs1[i+1]!=rs1[i]&&rs1[i+1]!=rs2[i])
11388 if(rs1[i+1]!=rt1[i]&&rs1[i+1]!=rt2[i])
11389 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs1[i+1],rs1[i+1]);
11390 if(rs2[i+1]!=rs1[i+1]&&rs2[i+1]!=rs1[i]&&rs2[i+1]!=rs2[i])
11391 if(rs2[i+1]!=rt1[i]&&rs2[i+1]!=rt2[i])
11392 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,rs2[i+1],rs2[i+1]);
11394 // TODO: if(is_ooo(i)) address_generation(i+1);
11395 if(itype[i]==CJUMP||itype[i]==FJUMP)
11396 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,CCREG,CCREG);
11397 if(itype[i]==STORE||itype[i]==STORELR||(opcode[i]&0x3b)==0x39||(opcode[i]&0x3b)==0x3a)
11398 load_regs(regs[i].regmap_entry,regs[i].regmap,regs[i].was32,INVCP,INVCP);
11399 if(bt[i]) cop1_usable=0;
11403 alu_assemble(i,®s[i]);break;
11405 imm16_assemble(i,®s[i]);break;
11407 shift_assemble(i,®s[i]);break;
11409 shiftimm_assemble(i,®s[i]);break;
11411 load_assemble(i,®s[i]);break;
11413 loadlr_assemble(i,®s[i]);break;
11415 store_assemble(i,®s[i]);break;
11417 storelr_assemble(i,®s[i]);break;
11419 cop0_assemble(i,®s[i]);break;
11421 cop1_assemble(i,®s[i]);break;
11423 c1ls_assemble(i,®s[i]);break;
11425 cop2_assemble(i,®s[i]);break;
11427 c2ls_assemble(i,®s[i]);break;
11429 c2op_assemble(i,®s[i]);break;
11431 fconv_assemble(i,®s[i]);break;
11433 float_assemble(i,®s[i]);break;
11435 fcomp_assemble(i,®s[i]);break;
11437 multdiv_assemble(i,®s[i]);break;
11439 mov_assemble(i,®s[i]);break;
11441 syscall_assemble(i,®s[i]);break;
11443 hlecall_assemble(i,®s[i]);break;
11445 intcall_assemble(i,®s[i]);break;
11447 ujump_assemble(i,®s[i]);ds=1;break;
11449 rjump_assemble(i,®s[i]);ds=1;break;
11451 cjump_assemble(i,®s[i]);ds=1;break;
11453 sjump_assemble(i,®s[i]);ds=1;break;
11455 fjump_assemble(i,®s[i]);ds=1;break;
11457 pagespan_assemble(i,®s[i]);break;
11459 if(itype[i]==UJUMP||itype[i]==RJUMP||(source[i]>>16)==0x1000)
11460 literal_pool(1024);
11462 literal_pool_jumpover(256);
11465 //assert(itype[i-2]==UJUMP||itype[i-2]==RJUMP||(source[i-2]>>16)==0x1000);
11466 // If the block did not end with an unconditional branch,
11467 // add a jump to the next instruction.
11469 if(itype[i-2]!=UJUMP&&itype[i-2]!=RJUMP&&(source[i-2]>>16)!=0x1000&&itype[i-1]!=SPAN) {
11470 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
11472 if(itype[i-2]!=CJUMP&&itype[i-2]!=SJUMP&&itype[i-2]!=FJUMP) {
11473 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
11474 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
11475 emit_loadreg(CCREG,HOST_CCREG);
11476 emit_addimm(HOST_CCREG,CLOCK_ADJUST(ccadj[i-1]+1),HOST_CCREG);
11478 else if(!likely[i-2])
11480 store_regs_bt(branch_regs[i-2].regmap,branch_regs[i-2].is32,branch_regs[i-2].dirty,start+i*4);
11481 assert(branch_regs[i-2].regmap[HOST_CCREG]==CCREG);
11485 store_regs_bt(regs[i-2].regmap,regs[i-2].is32,regs[i-2].dirty,start+i*4);
11486 assert(regs[i-2].regmap[HOST_CCREG]==CCREG);
11488 add_to_linker((int)out,start+i*4,0);
11495 assert(itype[i-1]!=UJUMP&&itype[i-1]!=CJUMP&&itype[i-1]!=SJUMP&&itype[i-1]!=RJUMP&&itype[i-1]!=FJUMP);
11496 store_regs_bt(regs[i-1].regmap,regs[i-1].is32,regs[i-1].dirty,start+i*4);
11497 if(regs[i-1].regmap[HOST_CCREG]!=CCREG)
11498 emit_loadreg(CCREG,HOST_CCREG);
11499 emit_addimm(HOST_CCREG,CLOCK_ADJUST(ccadj[i-1]+1),HOST_CCREG);
11500 add_to_linker((int)out,start+i*4,0);
11504 // TODO: delay slot stubs?
11506 for(i=0;i<stubcount;i++)
11508 switch(stubs[i][0])
11516 do_readstub(i);break;
11521 do_writestub(i);break;
11523 do_ccstub(i);break;
11525 do_invstub(i);break;
11527 do_cop1stub(i);break;
11529 do_unalignedwritestub(i);break;
11533 if (instr_addr0_override)
11534 instr_addr[0] = instr_addr0_override;
11536 /* Pass 9 - Linker */
11537 for(i=0;i<linkcount;i++)
11539 assem_debug("%8x -> %8x\n",link_addr[i][0],link_addr[i][1]);
11541 if(!link_addr[i][2])
11544 void *addr=check_addr(link_addr[i][1]);
11545 emit_extjump(link_addr[i][0],link_addr[i][1]);
11547 set_jump_target(link_addr[i][0],(int)addr);
11548 add_link(link_addr[i][1],stub);
11550 else set_jump_target(link_addr[i][0],(int)stub);
11555 int target=(link_addr[i][1]-start)>>2;
11556 assert(target>=0&&target<slen);
11557 assert(instr_addr[target]);
11558 //#ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11559 //set_jump_target_fillslot(link_addr[i][0],instr_addr[target],link_addr[i][2]>>1);
11561 set_jump_target(link_addr[i][0],instr_addr[target]);
11565 // External Branch Targets (jump_in)
11566 if(copy+slen*4>(void *)shadow+sizeof(shadow)) copy=shadow;
11567 for(i=0;i<slen;i++)
11571 if(instr_addr[i]) // TODO - delay slots (=null)
11573 u_int vaddr=start+i*4;
11574 u_int page=get_page(vaddr);
11575 u_int vpage=get_vpage(vaddr);
11578 assem_debug("%8x (%d) <- %8x\n",instr_addr[i],i,start+i*4);
11579 assem_debug("jump_in: %x\n",start+i*4);
11580 ll_add(jump_dirty+vpage,vaddr,(void *)out);
11581 int entry_point=do_dirty_stub(i);
11582 ll_add_flags(jump_in+page,vaddr,state_rflags,(void *)entry_point);
11583 // If there was an existing entry in the hash table,
11584 // replace it with the new address.
11585 // Don't add new entries. We'll insert the
11586 // ones that actually get used in check_addr().
11587 int *ht_bin=hash_table[((vaddr>>16)^vaddr)&0xFFFF];
11588 if(ht_bin[0]==vaddr) {
11589 ht_bin[1]=entry_point;
11591 if(ht_bin[2]==vaddr) {
11592 ht_bin[3]=entry_point;
11598 // Write out the literal pool if necessary
11600 #ifdef CORTEX_A8_BRANCH_PREDICTION_HACK
11602 if(((u_int)out)&7) emit_addnop(13);
11604 assert((u_int)out-beginning<MAX_OUTPUT_BLOCK_SIZE);
11605 //printf("shadow buffer: %x-%x\n",(int)copy,(int)copy+slen*4);
11606 memcpy(copy,source,slen*4);
11610 __clear_cache((void *)beginning,out);
11613 // If we're within 256K of the end of the buffer,
11614 // start over from the beginning. (Is 256K enough?)
11615 if((u_int)out>(u_int)BASE_ADDR+(1<<TARGET_SIZE_2)-MAX_OUTPUT_BLOCK_SIZE) out=(u_char *)BASE_ADDR;
11617 // Trap writes to any of the pages we compiled
11618 for(i=start>>12;i<=(start+slen*4)>>12;i++) {
11620 #ifndef DISABLE_TLB
11621 memory_map[i]|=0x40000000;
11622 if((signed int)start>=(signed int)0xC0000000) {
11624 j=(((u_int)i<<12)+(memory_map[i]<<2)-(u_int)rdram+(u_int)0x80000000)>>12;
11626 memory_map[j]|=0x40000000;
11627 //printf("write protect physical page: %x (virtual %x)\n",j<<12,start);
11631 inv_code_start=inv_code_end=~0;
11633 // for PCSX we need to mark all mirrors too
11634 if(get_page(start)<(RAM_SIZE>>12))
11635 for(i=start>>12;i<=(start+slen*4)>>12;i++)
11636 invalid_code[((u_int)0x00000000>>12)|(i&0x1ff)]=
11637 invalid_code[((u_int)0x80000000>>12)|(i&0x1ff)]=
11638 invalid_code[((u_int)0xa0000000>>12)|(i&0x1ff)]=0;
11641 /* Pass 10 - Free memory by expiring oldest blocks */
11643 int end=((((int)out-(int)BASE_ADDR)>>(TARGET_SIZE_2-16))+16384)&65535;
11644 while(expirep!=end)
11646 int shift=TARGET_SIZE_2-3; // Divide into 8 blocks
11647 int base=(int)BASE_ADDR+((expirep>>13)<<shift); // Base address of this block
11648 inv_debug("EXP: Phase %d\n",expirep);
11649 switch((expirep>>11)&3)
11652 // Clear jump_in and jump_dirty
11653 ll_remove_matching_addrs(jump_in+(expirep&2047),base,shift);
11654 ll_remove_matching_addrs(jump_dirty+(expirep&2047),base,shift);
11655 ll_remove_matching_addrs(jump_in+2048+(expirep&2047),base,shift);
11656 ll_remove_matching_addrs(jump_dirty+2048+(expirep&2047),base,shift);
11660 ll_kill_pointers(jump_out[expirep&2047],base,shift);
11661 ll_kill_pointers(jump_out[(expirep&2047)+2048],base,shift);
11664 // Clear hash table
11665 for(i=0;i<32;i++) {
11666 int *ht_bin=hash_table[((expirep&2047)<<5)+i];
11667 if((ht_bin[3]>>shift)==(base>>shift) ||
11668 ((ht_bin[3]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11669 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[2],ht_bin[3]);
11670 ht_bin[2]=ht_bin[3]=-1;
11672 if((ht_bin[1]>>shift)==(base>>shift) ||
11673 ((ht_bin[1]-MAX_OUTPUT_BLOCK_SIZE)>>shift)==(base>>shift)) {
11674 inv_debug("EXP: Remove hash %x -> %x\n",ht_bin[0],ht_bin[1]);
11675 ht_bin[0]=ht_bin[2];
11676 ht_bin[1]=ht_bin[3];
11677 ht_bin[2]=ht_bin[3]=-1;
11684 if((expirep&2047)==0)
11687 ll_remove_matching_addrs(jump_out+(expirep&2047),base,shift);
11688 ll_remove_matching_addrs(jump_out+2048+(expirep&2047),base,shift);
11691 expirep=(expirep+1)&65535;
11696 // vim:shiftwidth=2:expandtab