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
|
/*
This file is part of FFTS -- The Fastest Fourier Transform in the South
Copyright (c) 2012, Anthony M. Blake <amb@anthonix.com>
Copyright (c) 2012, The University of Waikato
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the organization nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL ANTHONY M. BLAKE BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef __CODEGEN_SSE_H__
#define __CODEGEN_SSE_H__
void neon_x4(float *, size_t, float *);
void neon_x8(float *, size_t, float *);
void neon_x8_t(float *, size_t, float *);
void leaf_ee_init();
void leaf_ee();
void leaf_oo();
void leaf_eo();
void leaf_oe();
void leaf_end();
void x_init();
void x4();
void x8_soft();
void x8_hard();
void sse_constants();
void sse_constants_inv();
// typedef uint8_t insns_t;
extern const uint32_t sse_leaf_ee_offsets[8];
extern const uint32_t sse_leaf_oo_offsets[8];
extern const uint32_t sse_leaf_eo_offsets[8];
extern const uint32_t sse_leaf_oe_offsets[8];
#define EAX 0
#define ECX 1
#define EDX 2
#define EBX 3
#define ESI 6
#define EDI 7
#define EBP 5
#define RAX 0
#define RCX 1
#define RDX 2
#define RBX 3
#define RSI 6
#define RDI 7
#define RBP 5
#define R8 8
#define R9 9
#define R10 10
#define R11 11
#define R12 12
#define R13 13
#define R14 14
#define R15 15
void IMM8(uint8_t **p, int32_t imm) {
*(*p)++ = (imm & 0xff);
}
void IMM16(uint8_t **p, int32_t imm) {
int i;
for(i=0;i<2;i++) {
*(*p)++ = (imm & (0xff << (i*8))) >> (i*8);
}
}
void IMM32(uint8_t **p, int32_t imm) {
int i;
for(i=0;i<4;i++) {
*(*p)++ = (imm & (0xff << (i*8))) >> (i*8);
}
}
void IMM32_NI(uint8_t *p, int32_t imm) {
int i;
for(i=0;i<4;i++) {
*(p+i) = (imm & (0xff << (i*8))) >> (i*8);
}
}
int32_t READ_IMM32(uint8_t *p) {
int32_t rval = 0;
int i;
for(i=0;i<4;i++) {
rval |= *(p+i) << (i*8);
}
return rval;
}
void MOVI(uint8_t **p, uint8_t dst, uint32_t imm) {
// if(imm < 65536) *(*p)++ = 0x66;
if(dst >= 8) *(*p)++ = 0x41;
//if(imm < 65536 && imm >= 256) *(*p)++ = 0x66;
//if(imm >= 256)
*(*p)++ = 0xb8 | (dst & 0x7);
// else *(*p)++ = 0xb0 | (dst & 0x7);
// if(imm < 256) IMM8(p, imm);
// else
//if(imm < 65536) IMM16(p, imm);
//else
IMM32(p, imm);
//if(dst < 8) {
// *(*p)++ = 0xb8 + dst;
//}else{
// *(*p)++ = 0x49;
// *(*p)++ = 0xc7;
// *(*p)++ = 0xc0 | (dst - 8);
//}
//IMM32(p, imm);
}
void ADDRMODE(uint8_t **p, uint8_t reg, uint8_t rm, int32_t disp) {
if(disp == 0) {
*(*p)++ = (rm & 7) | ((reg & 7) << 3);
}else if(disp <= 127 || disp >= -128) {
*(*p)++ = 0x40 | (rm & 7) | ((reg & 7) << 3);
IMM8(p, disp);
}else{
*(*p)++ = 0x80 | (rm & 7) | ((reg & 7) << 3);
IMM32(p, disp);
}
}
void LEA(uint8_t **p, uint8_t dst, uint8_t base, int32_t disp) {
*(*p)++ = 0x48 | ((base & 0x8) >> 3) | ((dst & 0x8) >> 1);
*(*p)++ = 0x8d;
ADDRMODE(p, dst, base, disp);
}
void RET(uint8_t **p) {
*(*p)++ = 0xc3;
}
void ADDI(uint8_t **p, uint8_t dst, int32_t imm) {
if(dst >= 8) *(*p)++ = 0x49;
else *(*p)++ = 0x48;
if(imm > 127 || imm <= -128) *(*p)++ = 0x81;
else *(*p)++ = 0x83;
*(*p)++ = 0xc0 | (dst & 0x7);
if(imm > 127 || imm <= -128) IMM32(p, imm);
else IMM8(p, imm);
}
void CALL(uint8_t **p, uint8_t *func) {
*(*p)++ = 0xe8;
IMM32(p, ((void *)func) - (void *)(*p) - 4);
}
void PUSH(uint8_t **p, uint8_t reg) {
if(reg >= 8) *(*p)++ = 0x41;
*(*p)++ = 0x50 | (reg & 7);
}
void POP(uint8_t **p, uint8_t reg) {
if(reg >= 8) *(*p)++ = 0x41;
*(*p)++ = 0x58 | (reg & 7);
}
#endif
// vim: set autoindent noexpandtab tabstop=3 shiftwidth=3:
|
