mirror of
https://github.com/Motorhead1991/qemu.git
synced 2025-08-06 01:03:55 -06:00
target/ppc: Implement xxgenpcv[bhwd]m instruction
Signed-off-by: Matheus Ferst <matheus.ferst@eldorado.org.br> Reviewed-by: Richard Henderson <richard.henderson@linaro.org> Message-Id: <20220225210936.1749575-36-matheus.ferst@eldorado.org.br> Signed-off-by: Cédric Le Goater <clg@kaod.org>
This commit is contained in:
parent
1015fcab89
commit
b090f4f1e3
4 changed files with 160 additions and 0 deletions
|
@ -1072,6 +1072,97 @@ void helper_VPERMR(ppc_avr_t *r, ppc_avr_t *a, ppc_avr_t *b, ppc_avr_t *c)
|
|||
*r = result;
|
||||
}
|
||||
|
||||
#define XXGENPCV(NAME, SZ) \
|
||||
void glue(helper_, glue(NAME, _be_exp))(ppc_vsr_t *t, ppc_vsr_t *b) \
|
||||
{ \
|
||||
ppc_vsr_t tmp; \
|
||||
\
|
||||
/* Initialize tmp with the result of an all-zeros mask */ \
|
||||
tmp.VsrD(0) = 0x1011121314151617; \
|
||||
tmp.VsrD(1) = 0x18191A1B1C1D1E1F; \
|
||||
\
|
||||
/* Iterate over the most significant byte of each element */ \
|
||||
for (int i = 0, j = 0; i < ARRAY_SIZE(b->u8); i += SZ) { \
|
||||
if (b->VsrB(i) & 0x80) { \
|
||||
/* Update each byte of the element */ \
|
||||
for (int k = 0; k < SZ; k++) { \
|
||||
tmp.VsrB(i + k) = j + k; \
|
||||
} \
|
||||
j += SZ; \
|
||||
} \
|
||||
} \
|
||||
\
|
||||
*t = tmp; \
|
||||
} \
|
||||
\
|
||||
void glue(helper_, glue(NAME, _be_comp))(ppc_vsr_t *t, ppc_vsr_t *b)\
|
||||
{ \
|
||||
ppc_vsr_t tmp = { .u64 = { 0, 0 } }; \
|
||||
\
|
||||
/* Iterate over the most significant byte of each element */ \
|
||||
for (int i = 0, j = 0; i < ARRAY_SIZE(b->u8); i += SZ) { \
|
||||
if (b->VsrB(i) & 0x80) { \
|
||||
/* Update each byte of the element */ \
|
||||
for (int k = 0; k < SZ; k++) { \
|
||||
tmp.VsrB(j + k) = i + k; \
|
||||
} \
|
||||
j += SZ; \
|
||||
} \
|
||||
} \
|
||||
\
|
||||
*t = tmp; \
|
||||
} \
|
||||
\
|
||||
void glue(helper_, glue(NAME, _le_exp))(ppc_vsr_t *t, ppc_vsr_t *b) \
|
||||
{ \
|
||||
ppc_vsr_t tmp; \
|
||||
\
|
||||
/* Initialize tmp with the result of an all-zeros mask */ \
|
||||
tmp.VsrD(0) = 0x1F1E1D1C1B1A1918; \
|
||||
tmp.VsrD(1) = 0x1716151413121110; \
|
||||
\
|
||||
/* Iterate over the most significant byte of each element */ \
|
||||
for (int i = 0, j = 0; i < ARRAY_SIZE(b->u8); i += SZ) { \
|
||||
/* Reverse indexing of "i" */ \
|
||||
const int idx = ARRAY_SIZE(b->u8) - i - SZ; \
|
||||
if (b->VsrB(idx) & 0x80) { \
|
||||
/* Update each byte of the element */ \
|
||||
for (int k = 0, rk = SZ - 1; k < SZ; k++, rk--) { \
|
||||
tmp.VsrB(idx + rk) = j + k; \
|
||||
} \
|
||||
j += SZ; \
|
||||
} \
|
||||
} \
|
||||
\
|
||||
*t = tmp; \
|
||||
} \
|
||||
\
|
||||
void glue(helper_, glue(NAME, _le_comp))(ppc_vsr_t *t, ppc_vsr_t *b)\
|
||||
{ \
|
||||
ppc_vsr_t tmp = { .u64 = { 0, 0 } }; \
|
||||
\
|
||||
/* Iterate over the most significant byte of each element */ \
|
||||
for (int i = 0, j = 0; i < ARRAY_SIZE(b->u8); i += SZ) { \
|
||||
if (b->VsrB(ARRAY_SIZE(b->u8) - i - SZ) & 0x80) { \
|
||||
/* Update each byte of the element */ \
|
||||
for (int k = 0, rk = SZ - 1; k < SZ; k++, rk--) { \
|
||||
/* Reverse indexing of "j" */ \
|
||||
const int idx = ARRAY_SIZE(b->u8) - j - SZ; \
|
||||
tmp.VsrB(idx + rk) = i + k; \
|
||||
} \
|
||||
j += SZ; \
|
||||
} \
|
||||
} \
|
||||
\
|
||||
*t = tmp; \
|
||||
}
|
||||
|
||||
XXGENPCV(XXGENPCVBM, 1)
|
||||
XXGENPCV(XXGENPCVHM, 2)
|
||||
XXGENPCV(XXGENPCVWM, 4)
|
||||
XXGENPCV(XXGENPCVDM, 8)
|
||||
#undef XXGENPCV
|
||||
|
||||
#if defined(HOST_WORDS_BIGENDIAN)
|
||||
#define VBPERMQ_INDEX(avr, i) ((avr)->u8[(i)])
|
||||
#define VBPERMD_INDEX(i) (i)
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue