1 |
/* |
2 |
* Copyright (C) 2005 Anders Gavare. All rights reserved. |
3 |
* |
4 |
* Redistribution and use in source and binary forms, with or without |
5 |
* modification, are permitted provided that the following conditions are met: |
6 |
* |
7 |
* 1. Redistributions of source code must retain the above copyright |
8 |
* notice, this list of conditions and the following disclaimer. |
9 |
* 2. Redistributions in binary form must reproduce the above copyright |
10 |
* notice, this list of conditions and the following disclaimer in the |
11 |
* documentation and/or other materials provided with the distribution. |
12 |
* 3. The name of the author may not be used to endorse or promote products |
13 |
* derived from this software without specific prior written permission. |
14 |
* |
15 |
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
16 |
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 |
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
18 |
* ARE DISCLAIMED. IN NO EVENT HPPAALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
19 |
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
20 |
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
21 |
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
22 |
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
23 |
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
24 |
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
25 |
* SUCH DAMAGE. |
26 |
* |
27 |
* |
28 |
* $Id: cpu_hppa_instr.c,v 1.2 2005/09/17 17:14:27 debug Exp $ |
29 |
* |
30 |
* HPPA instructions. |
31 |
* |
32 |
* Individual functions hppaould keep track of cpu->n_translated_instrs. |
33 |
* (If no instruction was executed, then it hppaould be decreased. If, say, 4 |
34 |
* instructions were combined into one function and executed, then it hppaould |
35 |
* be increased by 3.) |
36 |
*/ |
37 |
|
38 |
|
39 |
/* |
40 |
* nop: Do nothing. |
41 |
*/ |
42 |
X(nop) |
43 |
{ |
44 |
} |
45 |
|
46 |
|
47 |
/*****************************************************************************/ |
48 |
|
49 |
|
50 |
X(end_of_page) |
51 |
{ |
52 |
/* Update the PC: (offset 0, but on the next page) */ |
53 |
cpu->pc &= ~((HPPA_IC_ENTRIES_PER_PAGE-1) << |
54 |
HPPA_INSTR_ALIGNMENT_SHIFT); |
55 |
cpu->pc += (HPPA_IC_ENTRIES_PER_PAGE << HPPA_INSTR_ALIGNMENT_SHIFT); |
56 |
|
57 |
/* Find the new physical page and update the translation pointers: */ |
58 |
DYNTRANS_PC_TO_POINTERS(cpu); |
59 |
|
60 |
/* end_of_page doesn't count as an executed instruction: */ |
61 |
cpu->n_translated_instrs --; |
62 |
} |
63 |
|
64 |
|
65 |
/*****************************************************************************/ |
66 |
|
67 |
|
68 |
/* |
69 |
* hppa_combine_instructions(): |
70 |
* |
71 |
* Combine two or more instructions, if possible, into a single function call. |
72 |
*/ |
73 |
void COMBINE_INSTRUCTIONS(struct cpu *cpu, struct hppa_instr_call *ic, |
74 |
uint32_t addr) |
75 |
{ |
76 |
int n_back; |
77 |
n_back = (addr >> HPPA_INSTR_ALIGNMENT_SHIFT) |
78 |
& (HPPA_IC_ENTRIES_PER_PAGE-1); |
79 |
|
80 |
if (n_back >= 1) { |
81 |
/* TODO */ |
82 |
} |
83 |
|
84 |
/* TODO: Combine forward as well */ |
85 |
} |
86 |
|
87 |
|
88 |
/*****************************************************************************/ |
89 |
|
90 |
|
91 |
/* |
92 |
* hppa_instr_to_be_translated(): |
93 |
* |
94 |
* Translate an instruction word into an hppa_instr_call. ic is filled in with |
95 |
* valid data for the translated instruction, or a "nothing" instruction if |
96 |
* there was a translation failure. The newly translated instruction is then |
97 |
* executed. |
98 |
*/ |
99 |
X(to_be_translated) |
100 |
{ |
101 |
uint64_t addr, low_pc, tmp_addr; |
102 |
uint32_t iword; |
103 |
unsigned char *page; |
104 |
unsigned char ib[4]; |
105 |
int main_opcode; |
106 |
void (*samepage_function)(struct cpu *, struct hppa_instr_call *); |
107 |
|
108 |
/* Figure out the (virtual) address of the instruction: */ |
109 |
low_pc = ((size_t)ic - (size_t)cpu->cd.hppa.cur_ic_page) |
110 |
/ sizeof(struct hppa_instr_call); |
111 |
addr = cpu->pc & ~((HPPA_IC_ENTRIES_PER_PAGE-1) |
112 |
<< HPPA_INSTR_ALIGNMENT_SHIFT); |
113 |
addr += (low_pc << HPPA_INSTR_ALIGNMENT_SHIFT); |
114 |
cpu->pc = addr; |
115 |
addr &= ~((1 << HPPA_INSTR_ALIGNMENT_SHIFT) - 1); |
116 |
|
117 |
/* Read the instruction word from memory: */ |
118 |
page = cpu->cd.hppa.host_load[addr >> 12]; |
119 |
|
120 |
if (page != NULL) { |
121 |
/* fatal("TRANSLATION HIT!\n"); */ |
122 |
memcpy(ib, page + (addr & 0xfff), sizeof(ib)); |
123 |
} else { |
124 |
/* fatal("TRANSLATION MISS!\n"); */ |
125 |
if (!cpu->memory_rw(cpu, cpu->mem, addr, ib, |
126 |
sizeof(ib), MEM_READ, CACHE_INSTRUCTION)) { |
127 |
fatal("to_be_translated(): " |
128 |
"read failed: TODO\n"); |
129 |
goto bad; |
130 |
} |
131 |
} |
132 |
|
133 |
iword = *((uint32_t *)&ib[0]); |
134 |
|
135 |
#ifdef HOST_LITTLE_ENDIAN |
136 |
iword = ((iword & 0xff) << 24) | |
137 |
((iword & 0xff00) << 8) | |
138 |
((iword & 0xff0000) >> 8) | |
139 |
((iword & 0xff000000) >> 24); |
140 |
#endif |
141 |
|
142 |
|
143 |
#define DYNTRANS_TO_BE_TRANSLATED_HEAD |
144 |
#include "cpu_dyntrans.c" |
145 |
#undef DYNTRANS_TO_BE_TRANSLATED_HEAD |
146 |
|
147 |
|
148 |
/* |
149 |
* Translate the instruction: |
150 |
*/ |
151 |
|
152 |
main_opcode = iword >> 26; |
153 |
|
154 |
switch (main_opcode) { |
155 |
|
156 |
default:goto bad; |
157 |
} |
158 |
|
159 |
|
160 |
#define DYNTRANS_TO_BE_TRANSLATED_TAIL |
161 |
#include "cpu_dyntrans.c" |
162 |
#undef DYNTRANS_TO_BE_TRANSLATED_TAIL |
163 |
} |
164 |
|