aboutsummaryrefslogtreecommitdiff
path: root/src/ARMJIT_Internal.h
blob: 66d18086f69861f80c6493e685069a4297e94870 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
#ifndef ARMJIT_INTERNAL_H
#define ARMJIT_INTERNAL_H

#include "types.h"
#include <stdint.h>

#include "ARMJIT.h"

// here lands everything which doesn't fit into ARMJIT.h
// where it would be included by pretty much everything
namespace ARMJIT
{

enum
{
	branch_IdleBranch = 1 << 0,
	branch_FollowCondTaken = 1 << 1,
	branch_FollowCondNotTaken = 1 << 2,
	branch_StaticTarget = 1 << 3,
};

struct FetchedInstr
{
    u32 A_Reg(int pos) const
    {
        return (Instr >> pos) & 0xF;
    }

    u32 T_Reg(int pos) const
    {
        return (Instr >> pos) & 0x7;
    }

    u32 Cond() const
    {
        return Instr >> 28;
    }

	u8 BranchFlags;
	u8 SetFlags;
    u32 Instr;
	u32 Addr;

	u8 DataCycles;
    u16 CodeCycles;
	u32 DataRegion;

    ARMInstrInfo::Info Info;
};

/*
	TinyVector
		- because reinventing the wheel is the best!
	
	- meant to be used very often, with not so many elements
	max 1 << 16 elements
	- doesn't allocate while no elements are inserted
	- not stl confirmant of course
	- probably only works with POD types
	- remove operations don't preserve order, but O(1)!
*/
template <typename T>
struct __attribute__((packed)) TinyVector
{
	T* Data = NULL;
	u16 Capacity = 0;
	u16 Length = 0;

	~TinyVector()
	{
		delete[] Data;
	}

	void MakeCapacity(u32 capacity)
	{
		assert(capacity <= UINT16_MAX);
		assert(capacity > Capacity);
		T* newMem = new T[capacity];
		if (Data != NULL)
			memcpy(newMem, Data, sizeof(T) * Length);

		T* oldData = Data;
		Data = newMem;
		if (oldData != NULL)
			delete[] oldData;
		
		Capacity = capacity;
	}

	void SetLength(u16 length)
	{
		if (Capacity < length)
			MakeCapacity(length);
		
		Length = length;
	}

	void Clear()
	{
		Length = 0;
	}

	void Add(T element)
	{
		assert(Length + 1 <= UINT16_MAX);
		if (Length + 1 > Capacity)
			MakeCapacity(((Capacity + 4) * 3) / 2);
		
		Data[Length++] = element;
	}

	void Remove(int index)
	{
		assert(index >= 0 && index < Length);

		Length--;
		Data[index] = Data[Length];
		/*for (int i = index; i < Length; i++)
			Data[i] = Data[i + 1];*/
	}

	int Find(T needle)
	{
		for (int i = 0; i < Length; i++)
		{
			if (Data[i] == needle)
				return i;
		}
		return -1;
	}

	bool RemoveByValue(T needle)
	{
		for (int i = 0; i < Length; i++)
		{
			if (Data[i] == needle)
			{
				Remove(i);
				return true;
			}
		}
		return false;
	}

	T& operator[](int index)
	{
		assert(index >= 0 && index < Length);
		return Data[index];
	}
};

class JitBlock
{
public:
	JitBlock(u32 numInstrs, u32 numAddresses)
	{
		NumInstrs = numInstrs;
		NumAddresses = numAddresses;
		Data.SetLength(numInstrs + numAddresses);
	}

	u32 StartAddr;
	u32 PseudoPhysicalAddr;
	
	u32 NumInstrs;
	u32 NumAddresses;

	JitBlockEntry EntryPoint;

	u32* Instrs()
	{ return &Data[0]; }
	u32* AddressRanges()
	{ return &Data[NumInstrs]; }
	u32* Links()
	{ return &Data[NumInstrs + NumAddresses]; }

	u32 NumLinks()
	{ return Data.Length - NumInstrs - NumAddresses; }

	void AddLink(u32 link)
	{
		Data.Add(link);
	}

	void ResetLinks()
	{
		Data.SetLength(NumInstrs + NumAddresses);
	}

private:
	/*
		0..<NumInstrs - the instructions of the block
		NumInstrs..<(NumLinks + NumInstrs) - pseudo physical addresses where the block is located
			(atleast one, the pseudo physical address of the block)
	*/
	TinyVector<u32> Data;
};

// size should be 16 bytes because I'm to lazy to use mul and whatnot
struct __attribute__((packed)) AddressRange
{
	TinyVector<JitBlock*> Blocks;
	u16 InvalidLiterals;
	u16 TimesInvalidated;
};

extern AddressRange CodeRanges[ExeMemSpaceSize / 512];

typedef void (*InterpreterFunc)(ARM* cpu);
extern InterpreterFunc InterpretARM[];
extern InterpreterFunc InterpretTHUMB[];

extern u8 MemRegion9[0x80000];
extern u8 MemRegion7[0x80000];

void* GetFuncForAddr(ARM* cpu, u32 addr, bool store, int size);

template <u32 Num>
void LinkBlock(ARM* cpu, u32 codeOffset);

}

#endif