1891 lines
51 KiB
C++
1891 lines
51 KiB
C++
/**
|
|
******************************************************************************
|
|
* Xenia : Xbox 360 Emulator Research Project *
|
|
******************************************************************************
|
|
* Copyright 2021 Ben Vanik. All rights reserved. *
|
|
* Released under the BSD license - see LICENSE in the root for more details. *
|
|
******************************************************************************
|
|
*/
|
|
|
|
#include "xenia/cpu/hir/value.h"
|
|
#include "xenia/cpu/hir/instr.h"
|
|
|
|
#include <cmath>
|
|
#include <cstdlib>
|
|
|
|
#include "xenia/base/assert.h"
|
|
#include "xenia/base/byte_order.h"
|
|
#include "xenia/base/math.h"
|
|
#include "xenia/cpu/hir/hir_builder.h"
|
|
namespace xe {
|
|
namespace cpu {
|
|
namespace hir {
|
|
|
|
Value::Use* Value::AddUse(Arena* arena, Instr* instr) {
|
|
Use* use = HIRBuilder::GetCurrent()->AllocateUse();
|
|
use->instr = instr;
|
|
use->prev = NULL;
|
|
use->next = use_head;
|
|
if (use_head) {
|
|
use_head->prev = use;
|
|
}
|
|
use_head = use;
|
|
return use;
|
|
}
|
|
|
|
void Value::RemoveUse(Use* use) {
|
|
if (use == use_head) {
|
|
use_head = use->next;
|
|
} else {
|
|
use->prev->next = use->next;
|
|
}
|
|
if (use->next) {
|
|
use->next->prev = use->prev;
|
|
}
|
|
|
|
// HIRBuilder::GetCurrent()->DeallocateUse(use);
|
|
}
|
|
|
|
uint32_t Value::AsUint32() {
|
|
assert_true(IsConstant());
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
return constant.u8;
|
|
case INT16_TYPE:
|
|
return constant.u16;
|
|
case INT32_TYPE:
|
|
return constant.u32;
|
|
case INT64_TYPE:
|
|
return (uint32_t)constant.u64;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
uint64_t Value::AsUint64() {
|
|
assert_true(IsConstant());
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
return constant.u8;
|
|
case INT16_TYPE:
|
|
return constant.u16;
|
|
case INT32_TYPE:
|
|
return constant.u32;
|
|
case INT64_TYPE:
|
|
return constant.u64;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
void Value::Cast(TypeName target_type) {
|
|
// Only need a type change.
|
|
type = target_type;
|
|
}
|
|
|
|
void Value::ZeroExtend(TypeName target_type) {
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
type = target_type;
|
|
constant.u64 = constant.u8;
|
|
return;
|
|
case INT16_TYPE:
|
|
type = target_type;
|
|
constant.u64 = constant.u16;
|
|
return;
|
|
case INT32_TYPE:
|
|
type = target_type;
|
|
constant.u64 = constant.u32;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::SignExtend(TypeName target_type) {
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
type = target_type;
|
|
switch (target_type) {
|
|
case INT16_TYPE:
|
|
constant.i16 = constant.i8;
|
|
return;
|
|
case INT32_TYPE:
|
|
constant.i32 = constant.i8;
|
|
return;
|
|
case INT64_TYPE:
|
|
constant.i64 = constant.i8;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
case INT16_TYPE:
|
|
type = target_type;
|
|
switch (target_type) {
|
|
case INT32_TYPE:
|
|
constant.i32 = constant.i16;
|
|
return;
|
|
case INT64_TYPE:
|
|
constant.i64 = constant.i16;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
case INT32_TYPE:
|
|
type = target_type;
|
|
switch (target_type) {
|
|
case INT64_TYPE:
|
|
constant.i64 = constant.i32;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return;
|
|
}
|
|
}
|
|
|
|
void Value::Truncate(TypeName target_type) {
|
|
switch (type) {
|
|
case INT16_TYPE:
|
|
switch (target_type) {
|
|
case INT8_TYPE:
|
|
type = target_type;
|
|
constant.i64 = constant.i64 & 0xFF;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
case INT32_TYPE:
|
|
switch (target_type) {
|
|
case INT8_TYPE:
|
|
type = target_type;
|
|
constant.i64 = constant.i64 & 0xFF;
|
|
return;
|
|
case INT16_TYPE:
|
|
type = target_type;
|
|
constant.i64 = constant.i64 & 0xFFFF;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
case INT64_TYPE:
|
|
switch (target_type) {
|
|
case INT8_TYPE:
|
|
type = target_type;
|
|
constant.i64 = constant.i64 & 0xFF;
|
|
return;
|
|
case INT16_TYPE:
|
|
type = target_type;
|
|
constant.i64 = constant.i64 & 0xFFFF;
|
|
return;
|
|
case INT32_TYPE:
|
|
type = target_type;
|
|
constant.i64 = constant.i64 & 0xFFFFFFFF;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return;
|
|
}
|
|
}
|
|
// WARNING: this does not handle rounding flags at all!
|
|
void Value::Convert(TypeName target_type, RoundMode round_mode) {
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
switch (target_type) {
|
|
case FLOAT64_TYPE:
|
|
type = target_type;
|
|
constant.f64 = constant.f32;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
case INT64_TYPE:
|
|
switch (target_type) {
|
|
case FLOAT64_TYPE:
|
|
type = target_type;
|
|
constant.f64 = (double)constant.i64;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
case FLOAT64_TYPE:
|
|
switch (target_type) {
|
|
case FLOAT32_TYPE:
|
|
type = target_type;
|
|
constant.f32 = (float)constant.f64;
|
|
return;
|
|
case INT32_TYPE:
|
|
type = target_type;
|
|
constant.i32 = (int32_t)constant.f64;
|
|
return;
|
|
case INT64_TYPE:
|
|
type = target_type;
|
|
constant.i64 = (int64_t)constant.f64;
|
|
return;
|
|
default:
|
|
assert_unhandled_case(target_type);
|
|
return;
|
|
}
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return;
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
T __inline RoundValue(RoundMode round_mode, T value) {
|
|
switch (round_mode) {
|
|
case ROUND_TO_ZERO:
|
|
return std::trunc(value);
|
|
case ROUND_TO_NEAREST:
|
|
return std::round(value);
|
|
case ROUND_TO_MINUS_INFINITY:
|
|
return std::floor(value);
|
|
case ROUND_TO_POSITIVE_INFINITY:
|
|
return std::ceil(value);
|
|
default:
|
|
assert_unhandled_case(round_mode);
|
|
return value;
|
|
}
|
|
}
|
|
|
|
void Value::Round(RoundMode round_mode) {
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = RoundValue(round_mode, constant.f32);
|
|
return;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = RoundValue(round_mode, constant.f64);
|
|
return;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.f32[i] = RoundValue(round_mode, constant.v128.f32[i]);
|
|
}
|
|
return;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return;
|
|
}
|
|
}
|
|
|
|
bool Value::Add(Value* other) {
|
|
#define CHECK_DID_CARRY(v1, v2) (((uint64_t)v2) > ~((uint64_t)v1))
|
|
#define ADD_DID_CARRY(a, b) CHECK_DID_CARRY(a, b)
|
|
assert_true(type == other->type);
|
|
bool did_carry = false;
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
did_carry = ADD_DID_CARRY(constant.i8, other->constant.i8);
|
|
constant.i8 += other->constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
did_carry = ADD_DID_CARRY(constant.i16, other->constant.i16);
|
|
constant.i16 += other->constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
did_carry = ADD_DID_CARRY(constant.i32, other->constant.i32);
|
|
constant.i32 += other->constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
did_carry = ADD_DID_CARRY(constant.i64, other->constant.i64);
|
|
constant.i64 += other->constant.i64;
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
constant.f32 += other->constant.f32;
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 += other->constant.f64;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
return did_carry;
|
|
}
|
|
|
|
bool Value::Sub(Value* other) {
|
|
#define SUB_DID_CARRY(a, b) (b == 0 || a > (~(0 - b)))
|
|
assert_true(type == other->type);
|
|
bool did_carry = false;
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
did_carry =
|
|
SUB_DID_CARRY(uint16_t(constant.i8), uint16_t(other->constant.i8));
|
|
constant.i8 -= other->constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
did_carry =
|
|
SUB_DID_CARRY(uint16_t(constant.i16), uint16_t(other->constant.i16));
|
|
constant.i16 -= other->constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
did_carry =
|
|
SUB_DID_CARRY(uint32_t(constant.i32), uint32_t(other->constant.i32));
|
|
constant.i32 -= other->constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
did_carry =
|
|
SUB_DID_CARRY(uint64_t(constant.i64), uint64_t(other->constant.i64));
|
|
constant.i64 -= other->constant.i64;
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
constant.f32 -= other->constant.f32;
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 -= other->constant.f64;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
return did_carry;
|
|
}
|
|
|
|
void Value::Mul(Value* other) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 *= other->constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 *= other->constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 *= other->constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 *= other->constant.i64;
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
constant.f32 *= other->constant.f32;
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 *= other->constant.f64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.f32[i] *= other->constant.v128.f32[i];
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::MulHi(Value* other, bool is_unsigned) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case INT32_TYPE:
|
|
if (is_unsigned) {
|
|
constant.i32 = (int32_t)(((uint64_t)((uint32_t)constant.i32) *
|
|
(uint32_t)other->constant.i32) >>
|
|
32);
|
|
} else {
|
|
constant.i32 =
|
|
(int32_t)(((int64_t)constant.i32 * (int64_t)other->constant.i32) >>
|
|
32);
|
|
}
|
|
break;
|
|
case INT64_TYPE: {
|
|
#if XE_COMPILER_MSVC
|
|
if (is_unsigned) {
|
|
constant.i64 = __umulh(constant.i64, other->constant.i64);
|
|
} else {
|
|
constant.i64 = __mulh(constant.i64, other->constant.i64);
|
|
}
|
|
#else
|
|
unsigned __int128 product;
|
|
if (is_unsigned) {
|
|
product = static_cast<unsigned __int128>(constant.i64) *
|
|
static_cast<unsigned __int128>(other->constant.i64);
|
|
} else {
|
|
product = static_cast<unsigned __int128>(
|
|
static_cast<__int128>(constant.i64) *
|
|
static_cast<__int128>(other->constant.i64));
|
|
}
|
|
constant.i64 = static_cast<int64_t>(product >> 64);
|
|
#endif // XE_COMPILER_MSVC
|
|
break;
|
|
}
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
template <typename T>
|
|
static T PPCUDiv(T numer, T denom) {
|
|
if (!denom) {
|
|
return 0;
|
|
} else {
|
|
return numer / denom;
|
|
}
|
|
}
|
|
template <typename T>
|
|
static T PPCIDiv(T numer, T denom) {
|
|
if (!denom) {
|
|
return 0;
|
|
} else if (numer == static_cast<T>(1LL << ((sizeof(T) * CHAR_BIT) - 1)) &&
|
|
!~denom) { // if numer is signbit and denom is all ones, signed
|
|
// oflow
|
|
return 0;
|
|
} else {
|
|
return numer / denom;
|
|
}
|
|
}
|
|
|
|
// warning : we tolerate division by 0 in x64_sequences, but here we do not
|
|
void Value::Div(Value* other, bool is_unsigned) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
if (is_unsigned) {
|
|
constant.i8 = PPCUDiv<uint8_t>(constant.i8, other->constant.i8);
|
|
} else {
|
|
constant.i8 = PPCIDiv<int8_t>(constant.i8, other->constant.i8);
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
if (is_unsigned) {
|
|
constant.i16 = PPCUDiv<uint16_t>(constant.i16, other->constant.i16);
|
|
} else {
|
|
constant.i16 = PPCIDiv<int16_t>(constant.i16, other->constant.i16);
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
if (is_unsigned) {
|
|
constant.i32 = PPCUDiv<uint32_t>(constant.i32, other->constant.i32);
|
|
} else {
|
|
constant.i32 = PPCIDiv<int32_t>(constant.i32, other->constant.i32);
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
if (is_unsigned) {
|
|
constant.i64 = PPCUDiv<uint64_t>(constant.i64, other->constant.i64);
|
|
} else {
|
|
constant.i64 = PPCIDiv<int64_t>(constant.i64, other->constant.i64);
|
|
}
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
constant.f32 /= other->constant.f32;
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 /= other->constant.f64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.f32[i] /= other->constant.v128.f32[i];
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Max(Value* other) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = std::max(constant.f32, other->constant.f32);
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = std::max(constant.f64, other->constant.f64);
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.f32[i] =
|
|
std::max(constant.v128.f32[i], other->constant.v128.f32[i]);
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Neg() {
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 = -constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 = -constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 = -constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 = -constant.i64;
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = -constant.f32;
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = -constant.f64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; ++i) {
|
|
constant.v128.f32[i] = -constant.v128.f32[i];
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Abs() {
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 = int8_t(std::abs(constant.i8));
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 = int16_t(std::abs(constant.i16));
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 = std::abs(constant.i32);
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 = std::abs(constant.i64);
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = std::abs(constant.f32);
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = std::abs(constant.f64);
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; ++i) {
|
|
constant.v128.f32[i] = std::abs(constant.v128.f32[i]);
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Sqrt() {
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = std::sqrt(constant.f32);
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = std::sqrt(constant.f64);
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::RSqrt() {
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = 1.0f / std::sqrt(constant.f32);
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = 1.0f / std::sqrt(constant.f64);
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; ++i) {
|
|
constant.v128.f32[i] = 1.0f / std::sqrt(constant.v128.f32[i]);
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Recip() {
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
constant.f32 = 1.0f / constant.f32;
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
constant.f64 = 1.0f / constant.f64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.f32[i] = 1.0f / constant.v128.f32[i];
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::And(Value* other) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 &= other->constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 &= other->constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 &= other->constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 &= other->constant.i64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
constant.v128 &= other->constant.v128;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Or(Value* other) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 |= other->constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 |= other->constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 |= other->constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 |= other->constant.i64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
constant.v128 |= other->constant.v128;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Xor(Value* other) {
|
|
assert_true(type == other->type);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 ^= other->constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 ^= other->constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 ^= other->constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 ^= other->constant.i64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
constant.v128 ^= other->constant.v128;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Not() {
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 = ~constant.i8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 = ~constant.i16;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 = ~constant.i32;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 = ~constant.i64;
|
|
break;
|
|
case VEC128_TYPE:
|
|
constant.v128.low = ~constant.v128.low;
|
|
constant.v128.high = ~constant.v128.high;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::AndNot(Value* other) {
|
|
assert_true(type == other->type);
|
|
Value second = Value(*other);
|
|
second.Not();
|
|
And(&second);
|
|
}
|
|
|
|
void Value::Shl(Value* other) {
|
|
assert_true(other->type == INT8_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.u8 <<= other->constant.u8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.u16 <<= other->constant.u8;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.u32 <<= other->constant.u8;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.u64 <<= other->constant.u8;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Shr(Value* other) {
|
|
assert_true(other->type == INT8_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.u8 = constant.u8 >> other->constant.u8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.u16 = constant.u16 >> other->constant.u8;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.u32 = constant.u32 >> other->constant.u8;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.u64 = constant.u64 >> other->constant.u8;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Sha(Value* other) {
|
|
assert_true(other->type == INT8_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.i8 = constant.i8 >> other->constant.u8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 = constant.i16 >> other->constant.u8;
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 = constant.i32 >> other->constant.u8;
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 = constant.i64 >> other->constant.u8;
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::RotateLeft(Value* other) {
|
|
assert_true(other->type == INT8_TYPE);
|
|
auto rotation = other->constant.u8;
|
|
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.u8 = rotate_left<uint8_t>(constant.u8, rotation);
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.u16 = rotate_left<uint16_t>(constant.u16, rotation);
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.u32 = rotate_left<uint32_t>(constant.u32, rotation);
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.u64 = rotate_left<uint64_t>(constant.u64, rotation);
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::Extract(Value* vec, Value* index) {
|
|
assert_true(vec->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
constant.u8 = vec->constant.v128.u8[index->constant.u8 & 0x1F];
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.u16 = vec->constant.v128.u16[index->constant.u16 & 0x7];
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.u32 = vec->constant.v128.u32[index->constant.u32 & 0x3];
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.u64 = vec->constant.v128.u64[index->constant.u64 & 0x1];
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
void Value::Permute(Value* src1, Value* src2, TypeName type) {
|
|
if (type == INT8_TYPE) {
|
|
uint8_t table[32];
|
|
|
|
for (uint32_t i = 0; i < 16; ++i) {
|
|
table[i] = src1->constant.v128.u8[i];
|
|
table[i + 16] = src2->constant.v128.u8[i];
|
|
}
|
|
|
|
for (uint32_t i = 0; i < 16; ++i) {
|
|
constant.v128.u8[i] = table[(constant.v128.u8[i] ^ 3) & 0x1f];
|
|
}
|
|
} else if (type == INT16_TYPE) {
|
|
vec128_t perm = (constant.v128 & vec128s(0xF)) ^ vec128s(0x1);
|
|
vec128_t perm_ctrl = vec128b(0);
|
|
for (int i = 0; i < 8; i++) {
|
|
perm_ctrl.i16[i] = perm.i16[i] > 7 ? -1 : 0;
|
|
|
|
auto v = uint8_t(perm.u16[i]);
|
|
perm.u8[i * 2] = v * 2;
|
|
perm.u8[i * 2 + 1] = v * 2 + 1;
|
|
}
|
|
auto lod = [](const vec128_t& v) {
|
|
return _mm_loadu_si128((const __m128i*)&v);
|
|
};
|
|
auto sto = [](vec128_t& v, __m128i x) {
|
|
return _mm_storeu_si128((__m128i*)&v, x);
|
|
};
|
|
|
|
__m128i xmm1 = lod(src1->constant.v128);
|
|
__m128i xmm2 = lod(src2->constant.v128);
|
|
xmm1 = _mm_shuffle_epi8(xmm1, lod(perm));
|
|
xmm2 = _mm_shuffle_epi8(xmm2, lod(perm));
|
|
uint8_t mask = 0;
|
|
for (int i = 0; i < 8; i++) {
|
|
if (perm_ctrl.i16[i] == 0) {
|
|
mask |= 1 << (7 - i);
|
|
}
|
|
}
|
|
|
|
vec128_t unp_mask = vec128b(0);
|
|
for (int i = 0; i < 8; i++) {
|
|
if (mask & (1 << i)) {
|
|
unp_mask.u16[i] = 0xFFFF;
|
|
}
|
|
}
|
|
|
|
sto(constant.v128, _mm_blendv_epi8(xmm1, xmm2, lod(unp_mask)));
|
|
|
|
} else {
|
|
assert_unhandled_case(type);
|
|
}
|
|
}
|
|
void Value::Insert(Value* index, Value* part, TypeName type) {
|
|
vec128_t* me = &constant.v128;
|
|
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
me->u8[index->constant.u8 ^ 3] = part->constant.u8;
|
|
break;
|
|
case INT16_TYPE:
|
|
me->u16[index->constant.u8 ^ 1] = part->constant.u16;
|
|
break;
|
|
case INT32_TYPE:
|
|
me->u32[index->constant.u8] = part->constant.u32;
|
|
break;
|
|
}
|
|
}
|
|
void Value::Swizzle(uint32_t mask, TypeName type) {
|
|
if (type == INT32_TYPE || type == FLOAT32_TYPE) {
|
|
vec128_t result = vec128b(0);
|
|
for (uint32_t i = 0; i < 4; ++i) {
|
|
result.u32[i] = constant.v128.u32[(mask >> (i * 2)) & 0b11];
|
|
}
|
|
constant.v128 = result;
|
|
} else {
|
|
assert_unhandled_case(type);
|
|
}
|
|
}
|
|
void Value::Select(Value* other, Value* ctrl) {
|
|
if (ctrl->type == VEC128_TYPE) {
|
|
constant.v128.low = (constant.v128.low & ~ctrl->constant.v128.low) |
|
|
(other->constant.v128.low & ctrl->constant.v128.low);
|
|
constant.v128.high = (constant.v128.high & ~ctrl->constant.v128.high) |
|
|
(other->constant.v128.high & ctrl->constant.v128.high);
|
|
|
|
} else {
|
|
if (ctrl->constant.u8) {
|
|
switch (other->type) {
|
|
case INT8_TYPE:
|
|
constant.u8 = other->constant.u8;
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.u16 = other->constant.u16;
|
|
break;
|
|
case INT32_TYPE:
|
|
case FLOAT32_TYPE:
|
|
constant.u32 = other->constant.u32;
|
|
break;
|
|
case INT64_TYPE:
|
|
case FLOAT64_TYPE:
|
|
constant.u64 = other->constant.u64;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void Value::Splat(Value* other) {
|
|
assert_true(type == VEC128_TYPE);
|
|
switch (other->type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.i8[i] = other->constant.i8;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.i16[i] = other->constant.i16;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
case FLOAT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.i32[i] = other->constant.i32;
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
case FLOAT64_TYPE:
|
|
for (int i = 0; i < 2; i++) {
|
|
constant.v128.i64[i] = other->constant.i64;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(other->type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorCompareEQ(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] =
|
|
constant.v128.u8[i] == other->constant.v128.u8[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] =
|
|
constant.v128.u16[i] == other->constant.v128.u16[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
case FLOAT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.u32[i] == other->constant.v128.u32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
case FLOAT64_TYPE:
|
|
for (int i = 0; i < 2; i++) {
|
|
constant.v128.u64[i] =
|
|
constant.v128.u64[i] == other->constant.v128.u64[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorCompareSGT(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] =
|
|
constant.v128.i8[i] > other->constant.v128.i8[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] =
|
|
constant.v128.i16[i] > other->constant.v128.i16[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.i32[i] > other->constant.v128.i32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
for (int i = 0; i < 2; i++) {
|
|
constant.v128.u64[i] =
|
|
constant.v128.i64[i] > other->constant.v128.i64[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.f32[i] > other->constant.v128.f32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorCompareSGE(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] =
|
|
constant.v128.i8[i] >= other->constant.v128.i8[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] =
|
|
constant.v128.i16[i] >= other->constant.v128.i16[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.i32[i] >= other->constant.v128.i32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
for (int i = 0; i < 2; i++) {
|
|
constant.v128.u64[i] =
|
|
constant.v128.i64[i] >= other->constant.v128.i64[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case FLOAT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.f32[i] >= other->constant.v128.f32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorCompareUGT(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] =
|
|
constant.v128.u8[i] > other->constant.v128.u8[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] =
|
|
constant.v128.u16[i] > other->constant.v128.u16[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.u32[i] > other->constant.v128.u32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
for (int i = 0; i < 2; i++) {
|
|
constant.v128.u64[i] =
|
|
constant.v128.u64[i] > other->constant.v128.u64[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorCompareUGE(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] =
|
|
constant.v128.u8[i] >= other->constant.v128.u8[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] =
|
|
constant.v128.u16[i] >= other->constant.v128.u16[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] =
|
|
constant.v128.u32[i] >= other->constant.v128.u32[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
for (int i = 0; i < 2; i++) {
|
|
constant.v128.u64[i] =
|
|
constant.v128.u64[i] >= other->constant.v128.u64[i] ? -1 : 0;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorConvertI2F(Value* other, bool is_unsigned) {
|
|
assert_true(type == VEC128_TYPE);
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.f32[i] = (float)other->constant.v128.u32[i];
|
|
} else {
|
|
constant.v128.f32[i] = (float)other->constant.v128.i32[i];
|
|
}
|
|
}
|
|
}
|
|
|
|
void Value::VectorConvertF2I(Value* other, bool is_unsigned) {
|
|
assert_true(type == VEC128_TYPE);
|
|
|
|
// FIXME(DrChat): This does not saturate!
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u32[i] = (uint32_t)other->constant.v128.f32[i];
|
|
} else {
|
|
constant.v128.i32[i] = (int32_t)other->constant.v128.f32[i];
|
|
}
|
|
}
|
|
}
|
|
|
|
void Value::VectorShl(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] <<= other->constant.v128.u8[i] & 0x7;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] <<= other->constant.v128.u16[i] & 0xF;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] <<= other->constant.v128.u32[i] & 0x1F;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorShr(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] >>= other->constant.v128.u8[i] & 0x7;
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] >>= other->constant.v128.u16[i] & 0xF;
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] >>= other->constant.v128.u32[i] & 0x1F;
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorRol(Value* other, TypeName type) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
for (int i = 0; i < 16; i++) {
|
|
constant.v128.u8[i] = xe::rotate_left(constant.v128.u8[i],
|
|
other->constant.v128.i8[i] & 0x7);
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
for (int i = 0; i < 8; i++) {
|
|
constant.v128.u16[i] = xe::rotate_left(
|
|
constant.v128.u16[i], other->constant.v128.u16[i] & 0xF);
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
for (int i = 0; i < 4; i++) {
|
|
constant.v128.u32[i] = xe::rotate_left(
|
|
constant.v128.u32[i], other->constant.v128.u32[i] & 0x1F);
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorAdd(Value* other, TypeName type, bool is_unsigned,
|
|
bool saturate) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
if (saturate) {
|
|
assert_always();
|
|
} else {
|
|
constant.v128.x += other->constant.v128.x;
|
|
constant.v128.y += other->constant.v128.y;
|
|
constant.v128.z += other->constant.v128.z;
|
|
constant.v128.w += other->constant.v128.w;
|
|
}
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
if (saturate) {
|
|
assert_always();
|
|
} else {
|
|
constant.v128.f64[0] += other->constant.v128.f64[0];
|
|
constant.v128.f64[1] += other->constant.v128.f64[1];
|
|
}
|
|
break;
|
|
case INT8_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 16; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u8[i] =
|
|
xe::sat_add(constant.v128.u8[i], other->constant.v128.u8[i]);
|
|
} else {
|
|
constant.v128.i8[i] =
|
|
xe::sat_add(constant.v128.i8[i], other->constant.v128.i8[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
for (int i = 0; i < 16; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u8[i] += other->constant.v128.u8[i];
|
|
} else {
|
|
constant.v128.i8[i] += other->constant.v128.i8[i];
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 8; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u16[i] =
|
|
xe::sat_add(constant.v128.u16[i], other->constant.v128.u16[i]);
|
|
} else {
|
|
constant.v128.i16[i] =
|
|
xe::sat_add(constant.v128.i16[i], other->constant.v128.i16[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
for (int i = 0; i < 8; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u16[i] += other->constant.v128.u16[i];
|
|
} else {
|
|
constant.v128.i16[i] += other->constant.v128.i16[i];
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u32[i] =
|
|
xe::sat_add(constant.v128.u32[i], other->constant.v128.u32[i]);
|
|
} else {
|
|
constant.v128.i32[i] =
|
|
xe::sat_add(constant.v128.i32[i], other->constant.v128.i32[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u32[i] += other->constant.v128.u32[i];
|
|
} else {
|
|
constant.v128.i32[i] += other->constant.v128.i32[i];
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 2; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u64[i] =
|
|
xe::sat_add(constant.v128.u64[i], other->constant.v128.u64[i]);
|
|
} else {
|
|
constant.v128.i64[i] =
|
|
xe::sat_add(constant.v128.i64[i], other->constant.v128.i64[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
if (is_unsigned) {
|
|
constant.v128.u64[0] += other->constant.v128.u64[0];
|
|
constant.v128.u64[1] += other->constant.v128.u64[1];
|
|
} else {
|
|
constant.v128.i64[0] += other->constant.v128.i64[0];
|
|
constant.v128.i64[1] += other->constant.v128.i64[1];
|
|
}
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorSub(Value* other, TypeName type, bool is_unsigned,
|
|
bool saturate) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case FLOAT32_TYPE:
|
|
if (saturate) {
|
|
assert_always();
|
|
} else {
|
|
constant.v128.x -= other->constant.v128.x;
|
|
constant.v128.y -= other->constant.v128.y;
|
|
constant.v128.z -= other->constant.v128.z;
|
|
constant.v128.w -= other->constant.v128.w;
|
|
}
|
|
break;
|
|
case FLOAT64_TYPE:
|
|
if (saturate) {
|
|
assert_always();
|
|
} else {
|
|
constant.v128.f64[0] -= other->constant.v128.f64[0];
|
|
constant.v128.f64[1] -= other->constant.v128.f64[1];
|
|
}
|
|
break;
|
|
case INT8_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 16; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u8[i] =
|
|
xe::sat_sub(constant.v128.u8[i], other->constant.v128.u8[i]);
|
|
} else {
|
|
constant.v128.i8[i] =
|
|
xe::sat_sub(constant.v128.i8[i], other->constant.v128.i8[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
for (int i = 0; i < 16; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u8[i] -= other->constant.v128.u8[i];
|
|
} else {
|
|
constant.v128.i8[i] -= other->constant.v128.i8[i];
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case INT16_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 8; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u16[i] =
|
|
xe::sat_sub(constant.v128.u16[i], other->constant.v128.u16[i]);
|
|
} else {
|
|
constant.v128.i16[i] =
|
|
xe::sat_sub(constant.v128.i16[i], other->constant.v128.i16[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
for (int i = 0; i < 8; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u16[i] -= other->constant.v128.u16[i];
|
|
} else {
|
|
constant.v128.i16[i] -= other->constant.v128.i16[i];
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case INT32_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u32[i] =
|
|
xe::sat_sub(constant.v128.u32[i], other->constant.v128.u32[i]);
|
|
} else {
|
|
constant.v128.i32[i] =
|
|
xe::sat_sub(constant.v128.i32[i], other->constant.v128.i32[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u32[i] -= other->constant.v128.u32[i];
|
|
} else {
|
|
constant.v128.i32[i] -= other->constant.v128.i32[i];
|
|
}
|
|
}
|
|
}
|
|
break;
|
|
case INT64_TYPE:
|
|
if (saturate) {
|
|
for (int i = 0; i < 2; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u64[i] =
|
|
xe::sat_sub(constant.v128.u64[i], other->constant.v128.u64[i]);
|
|
} else {
|
|
constant.v128.i64[i] =
|
|
xe::sat_sub(constant.v128.i64[i], other->constant.v128.i64[i]);
|
|
}
|
|
}
|
|
// TODO(Triang3l): Trace DID_SATURATE.
|
|
} else {
|
|
if (is_unsigned) {
|
|
constant.v128.u64[0] -= other->constant.v128.u64[0];
|
|
constant.v128.u64[1] -= other->constant.v128.u64[1];
|
|
} else {
|
|
constant.v128.i64[0] -= other->constant.v128.i64[0];
|
|
constant.v128.i64[1] -= other->constant.v128.i64[1];
|
|
}
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::DotProduct3(Value* other) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case VEC128_TYPE: {
|
|
// TODO(rick): is this sane?
|
|
type = FLOAT32_TYPE;
|
|
// Using x86 DPPS ordering for consistency with x86-64 code generation:
|
|
// (X1 * X2 + Y1 * Y2) + (Z1 * Z2 + 0.0f)
|
|
// (+ 0.0f for zero sign, as zero imm8[4:7] bits result in zero terms,
|
|
// not in complete exclusion of them)
|
|
// TODO(Triang3l): NaN on overflow.
|
|
constant.f32 =
|
|
(constant.v128.f32[0] * other->constant.v128.f32[0] +
|
|
constant.v128.f32[1] * other->constant.v128.f32[1]) +
|
|
(constant.v128.f32[2] * other->constant.v128.f32[2] + 0.0f);
|
|
} break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::DotProduct4(Value* other) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case VEC128_TYPE: {
|
|
// TODO(rick): is this sane?
|
|
type = FLOAT32_TYPE;
|
|
// Using x86 DPPS ordering for consistency with x86-64 code generation:
|
|
// (X1 * X2 + Y1 * Y2) + (Z1 * Z2 + W1 * W2)
|
|
// TODO(Triang3l): NaN on overflow.
|
|
constant.f32 = (constant.v128.f32[0] * other->constant.v128.f32[0] +
|
|
constant.v128.f32[1] * other->constant.v128.f32[1]) +
|
|
(constant.v128.f32[2] * other->constant.v128.f32[2] +
|
|
constant.v128.f32[3] * other->constant.v128.f32[3]);
|
|
} break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::VectorAverage(Value* other, TypeName type, bool is_unsigned,
|
|
bool saturate) {
|
|
assert_true(this->type == VEC128_TYPE && other->type == VEC128_TYPE);
|
|
switch (type) {
|
|
case INT8_TYPE: {
|
|
for (int i = 0; i < 16; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u8[i] =
|
|
uint8_t((uint16_t(constant.v128.u8[i]) +
|
|
uint16_t(other->constant.v128.u8[i]) + 1) >>
|
|
1);
|
|
} else {
|
|
constant.v128.i8[i] =
|
|
int8_t((int16_t(constant.v128.i8[i]) +
|
|
int16_t(other->constant.v128.i8[i]) + 1) >>
|
|
1);
|
|
}
|
|
}
|
|
} break;
|
|
case INT16_TYPE: {
|
|
for (int i = 0; i < 8; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u16[i] =
|
|
uint16_t((uint32_t(constant.v128.u16[i]) +
|
|
uint32_t(other->constant.v128.u16[i]) + 1) >>
|
|
1);
|
|
} else {
|
|
constant.v128.i16[i] =
|
|
int16_t((int32_t(constant.v128.i16[i]) +
|
|
int32_t(other->constant.v128.i16[i]) + 1) >>
|
|
1);
|
|
}
|
|
}
|
|
} break;
|
|
case INT32_TYPE: {
|
|
for (int i = 0; i < 4; i++) {
|
|
if (is_unsigned) {
|
|
constant.v128.u32[i] =
|
|
uint32_t((uint64_t(constant.v128.u32[i]) +
|
|
uint64_t(other->constant.v128.u32[i]) + 1) >>
|
|
1);
|
|
} else {
|
|
constant.v128.i32[i] =
|
|
int32_t((int64_t(constant.v128.i32[i]) +
|
|
int64_t(other->constant.v128.i32[i]) + 1) >>
|
|
1);
|
|
}
|
|
}
|
|
} break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
void Value::ByteSwap() {
|
|
switch (type) {
|
|
case INT8_TYPE:
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i16 = xe::byte_swap(constant.i16);
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i32 = xe::byte_swap(constant.i32);
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i64 = xe::byte_swap(constant.i64);
|
|
break;
|
|
case VEC128_TYPE:
|
|
for (int n = 0; n < 4; n++) {
|
|
constant.v128.u32[n] = xe::byte_swap(constant.v128.u32[n]);
|
|
}
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
void Value::DenormalFlush() {
|
|
for (int i = 0; i < 4; ++i) {
|
|
uint32_t current_element = constant.v128.u32[i];
|
|
if ((current_element & 0x7f800000) == 0) {
|
|
current_element = current_element & 0x80000000;
|
|
}
|
|
constant.v128.u32[i] = current_element;
|
|
}
|
|
}
|
|
|
|
void Value::CountLeadingZeros(const Value* other) {
|
|
switch (other->type) {
|
|
case INT8_TYPE:
|
|
constant.i8 = xe::lzcnt(other->constant.i8);
|
|
break;
|
|
case INT16_TYPE:
|
|
constant.i8 = xe::lzcnt(other->constant.i16);
|
|
break;
|
|
case INT32_TYPE:
|
|
constant.i8 = xe::lzcnt(other->constant.i32);
|
|
break;
|
|
case INT64_TYPE:
|
|
constant.i8 = xe::lzcnt(other->constant.i64);
|
|
break;
|
|
default:
|
|
assert_unhandled_case(type);
|
|
break;
|
|
}
|
|
}
|
|
|
|
bool Value::Compare(Opcode opcode, Value* other) {
|
|
assert_true(type == other->type);
|
|
switch (other->type) {
|
|
case INT8_TYPE:
|
|
return CompareInt8(opcode, this, other);
|
|
case INT16_TYPE:
|
|
return CompareInt16(opcode, this, other);
|
|
case INT32_TYPE:
|
|
return CompareInt32(opcode, this, other);
|
|
case INT64_TYPE:
|
|
return CompareInt64(opcode, this, other);
|
|
default:
|
|
assert_unhandled_case(type);
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool Value::CompareInt8(Opcode opcode, Value* a, Value* b) {
|
|
switch (opcode) {
|
|
case OPCODE_COMPARE_EQ:
|
|
return a->constant.i8 == b->constant.i8;
|
|
case OPCODE_COMPARE_NE:
|
|
return a->constant.i8 != b->constant.i8;
|
|
case OPCODE_COMPARE_SLT:
|
|
return a->constant.i8 < b->constant.i8;
|
|
case OPCODE_COMPARE_SLE:
|
|
return a->constant.i8 <= b->constant.i8;
|
|
case OPCODE_COMPARE_SGT:
|
|
return a->constant.i8 > b->constant.i8;
|
|
case OPCODE_COMPARE_SGE:
|
|
return a->constant.i8 >= b->constant.i8;
|
|
case OPCODE_COMPARE_ULT:
|
|
return uint8_t(a->constant.i8) < uint8_t(b->constant.i8);
|
|
case OPCODE_COMPARE_ULE:
|
|
return uint8_t(a->constant.i8) <= uint8_t(b->constant.i8);
|
|
case OPCODE_COMPARE_UGT:
|
|
return uint8_t(a->constant.i8) > uint8_t(b->constant.i8);
|
|
case OPCODE_COMPARE_UGE:
|
|
return uint8_t(a->constant.i8) >= uint8_t(b->constant.i8);
|
|
default:
|
|
assert_unhandled_case(opcode);
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool Value::CompareInt16(Opcode opcode, Value* a, Value* b) {
|
|
switch (opcode) {
|
|
case OPCODE_COMPARE_EQ:
|
|
return a->constant.i16 == b->constant.i16;
|
|
case OPCODE_COMPARE_NE:
|
|
return a->constant.i16 != b->constant.i16;
|
|
case OPCODE_COMPARE_SLT:
|
|
return a->constant.i16 < b->constant.i16;
|
|
case OPCODE_COMPARE_SLE:
|
|
return a->constant.i16 <= b->constant.i16;
|
|
case OPCODE_COMPARE_SGT:
|
|
return a->constant.i16 > b->constant.i16;
|
|
case OPCODE_COMPARE_SGE:
|
|
return a->constant.i16 >= b->constant.i16;
|
|
case OPCODE_COMPARE_ULT:
|
|
return uint16_t(a->constant.i16) < uint16_t(b->constant.i16);
|
|
case OPCODE_COMPARE_ULE:
|
|
return uint16_t(a->constant.i16) <= uint16_t(b->constant.i16);
|
|
case OPCODE_COMPARE_UGT:
|
|
return uint16_t(a->constant.i16) > uint16_t(b->constant.i16);
|
|
case OPCODE_COMPARE_UGE:
|
|
return uint16_t(a->constant.i16) >= uint16_t(b->constant.i16);
|
|
default:
|
|
assert_unhandled_case(opcode);
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool Value::CompareInt32(Opcode opcode, Value* a, Value* b) {
|
|
switch (opcode) {
|
|
case OPCODE_COMPARE_EQ:
|
|
return a->constant.i32 == b->constant.i32;
|
|
case OPCODE_COMPARE_NE:
|
|
return a->constant.i32 != b->constant.i32;
|
|
case OPCODE_COMPARE_SLT:
|
|
return a->constant.i32 < b->constant.i32;
|
|
case OPCODE_COMPARE_SLE:
|
|
return a->constant.i32 <= b->constant.i32;
|
|
case OPCODE_COMPARE_SGT:
|
|
return a->constant.i32 > b->constant.i32;
|
|
case OPCODE_COMPARE_SGE:
|
|
return a->constant.i32 >= b->constant.i32;
|
|
case OPCODE_COMPARE_ULT:
|
|
return uint32_t(a->constant.i32) < uint32_t(b->constant.i32);
|
|
case OPCODE_COMPARE_ULE:
|
|
return uint32_t(a->constant.i32) <= uint32_t(b->constant.i32);
|
|
case OPCODE_COMPARE_UGT:
|
|
return uint32_t(a->constant.i32) > uint32_t(b->constant.i32);
|
|
case OPCODE_COMPARE_UGE:
|
|
return uint32_t(a->constant.i32) >= uint32_t(b->constant.i32);
|
|
default:
|
|
assert_unhandled_case(opcode);
|
|
return false;
|
|
}
|
|
}
|
|
|
|
bool Value::CompareInt64(Opcode opcode, Value* a, Value* b) {
|
|
switch (opcode) {
|
|
case OPCODE_COMPARE_EQ:
|
|
return a->constant.i64 == b->constant.i64;
|
|
case OPCODE_COMPARE_NE:
|
|
return a->constant.i64 != b->constant.i64;
|
|
case OPCODE_COMPARE_SLT:
|
|
return a->constant.i64 < b->constant.i64;
|
|
case OPCODE_COMPARE_SLE:
|
|
return a->constant.i64 <= b->constant.i64;
|
|
case OPCODE_COMPARE_SGT:
|
|
return a->constant.i64 > b->constant.i64;
|
|
case OPCODE_COMPARE_SGE:
|
|
return a->constant.i64 >= b->constant.i64;
|
|
case OPCODE_COMPARE_ULT:
|
|
return uint64_t(a->constant.i64) < uint64_t(b->constant.i64);
|
|
case OPCODE_COMPARE_ULE:
|
|
return uint64_t(a->constant.i64) <= uint64_t(b->constant.i64);
|
|
case OPCODE_COMPARE_UGT:
|
|
return uint64_t(a->constant.i64) > uint64_t(b->constant.i64);
|
|
case OPCODE_COMPARE_UGE:
|
|
return uint64_t(a->constant.i64) >= uint64_t(b->constant.i64);
|
|
default:
|
|
assert_unhandled_case(opcode);
|
|
return false;
|
|
}
|
|
}
|
|
hir::Instr* Value::GetDefSkipAssigns() {
|
|
if (def) {
|
|
return def->GetDestDefSkipAssigns();
|
|
} else {
|
|
return nullptr;
|
|
}
|
|
}
|
|
hir::Instr* Value::GetDefTunnelMovs(unsigned int* tunnel_flags) {
|
|
if (def) {
|
|
return def->GetDestDefTunnelMovs(tunnel_flags);
|
|
} else {
|
|
return nullptr;
|
|
}
|
|
}
|
|
// does the value only have one instr that uses it?
|
|
bool Value::HasSingleUse() const {
|
|
return use_head && use_head->next == nullptr;
|
|
}
|
|
bool Value::AllUsesByOneInsn() const {
|
|
if (!use_head) {
|
|
return false;
|
|
}
|
|
const Use* first_use = use_head;
|
|
const Instr* should_match = first_use->instr;
|
|
|
|
for (const Use* current_use = first_use->next; current_use;
|
|
current_use = current_use->next) {
|
|
if (current_use->instr != should_match) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
bool Value::AllFloatVectorLanesSameValue(const hir::Value* for_value,
|
|
uint32_t current_depth) {
|
|
// limit recursion, otherwise this function will slow down emission
|
|
if (current_depth == 16) {
|
|
return false;
|
|
}
|
|
using namespace hir;
|
|
hir::Instr* definition;
|
|
Opcode definition_opcode_number;
|
|
re_enter:
|
|
definition = for_value->def;
|
|
if (!definition) {
|
|
xenia_assert(for_value->IsConstant());
|
|
|
|
auto&& constant_value = for_value->constant.v128;
|
|
for (unsigned constant_lane_index = 1; constant_lane_index < 4;
|
|
++constant_lane_index) {
|
|
if (constant_value.u32[0] != constant_value.u32[constant_lane_index]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
definition_opcode_number = definition->GetOpcodeNum();
|
|
|
|
if (definition_opcode_number == OPCODE_ASSIGN) {
|
|
for_value = definition->src1.value;
|
|
goto re_enter;
|
|
}
|
|
|
|
if (definition_opcode_number == OPCODE_VECTOR_DENORMFLUSH) {
|
|
for_value = definition->src1.value;
|
|
goto re_enter;
|
|
}
|
|
/*
|
|
vmsum propagates its result to every lane
|
|
*/
|
|
if (definition_opcode_number == OPCODE_DOT_PRODUCT_4 ||
|
|
definition_opcode_number == OPCODE_DOT_PRODUCT_3) {
|
|
return true;
|
|
}
|
|
// if splat of 32-bit value type, return true
|
|
// technically a splat of int16 or int8 would also produce the same "float" in
|
|
// all lanes but i think its best to keep this function focused on
|
|
// specifically float data
|
|
if (definition_opcode_number == OPCODE_SPLAT) {
|
|
if (definition->dest->type == VEC128_TYPE) {
|
|
auto splat_src_value_type = definition->src1.value->type;
|
|
if (splat_src_value_type == INT32_TYPE ||
|
|
splat_src_value_type == FLOAT32_TYPE) {
|
|
return true;
|
|
}
|
|
}
|
|
}
|
|
|
|
switch (definition_opcode_number) {
|
|
// all of these opcodes produce the same value for the same input
|
|
case OPCODE_RSQRT:
|
|
case OPCODE_RECIP:
|
|
case OPCODE_POW2:
|
|
case OPCODE_LOG2:
|
|
for_value = definition->src1.value;
|
|
goto re_enter;
|
|
|
|
// binary opcodes
|
|
case OPCODE_ADD:
|
|
case OPCODE_SUB:
|
|
case OPCODE_MUL:
|
|
if (!AllFloatVectorLanesSameValue(definition->src1.value,
|
|
current_depth + 1)) {
|
|
return false;
|
|
}
|
|
for_value = definition->src2.value;
|
|
goto re_enter;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
} // namespace hir
|
|
} // namespace cpu
|
|
} // namespace xe
|