mirror of
https://github.com/KhronosGroup/OpenCL-CTS.git
synced 2026-03-19 06:09:01 +00:00
Add fp16 testing to conversions and bruteforce (#1975)
Merge the `fp16-staging` branch into `main`, adding fp16 (`half`) testing to the conversions and math bruteforce tests. --------- Signed-off-by: Ahmed Hesham <ahmed.hesham@arm.com> Signed-off-by: Sven van Haastregt <sven.vanhaastregt@arm.com> Signed-off-by: Guo, Yilong <yilong.guo@intel.com> Signed-off-by: John Kesapides <john.kesapides@arm.com> Co-authored-by: Marcin Hajder <marcin.hajder@gmail.com> Co-authored-by: Ewan Crawford <ewan@codeplay.com> Co-authored-by: Wawiorko, Grzegorz <grzegorz.wawiorko@intel.com> Co-authored-by: Sreelakshmi Haridas Maruthur <sharidas@quicinc.com> Co-authored-by: Harald van Dijk <harald@gigawatt.nl> Co-authored-by: Ben Ashbaugh <ben.ashbaugh@intel.com> Co-authored-by: Haonan Yang <haonan.yang@intel.com> Co-authored-by: Ahmed Hesham <117350656+ahesham-arm@users.noreply.github.com> Co-authored-by: niranjanjoshi121 <43807392+niranjanjoshi121@users.noreply.github.com> Co-authored-by: Wenwan Xing <wenwan.xing@intel.com> Co-authored-by: Yilong Guo <yilong.guo@intel.com> Co-authored-by: Romaric Jodin <89833130+rjodinchr@users.noreply.github.com> Co-authored-by: joshqti <127994991+joshqti@users.noreply.github.com> Co-authored-by: Pekka Jääskeläinen <pekka.jaaskelainen@tuni.fi> Co-authored-by: imilenkovic00 <155085410+imilenkovic00@users.noreply.github.com> Co-authored-by: John Kesapides <46718829+JohnKesapidesARM@users.noreply.github.com> Co-authored-by: Aharon Abramson <aharon.abramson@mobileye.com>
This commit is contained in:
Sven van Haastregt
committed by
GitHub
GitHub
parent
b3c89ebde0
commit
b6941b6c61
784
test_conformance/math_brute_force/binary_half.cpp
Normal file
784
test_conformance/math_brute_force/binary_half.cpp
Normal file
@@ -0,0 +1,784 @@
|
||||
//
|
||||
// Copyright (c) 2017-2024 The Khronos Group Inc.
|
||||
//
|
||||
// Licensed under the Apache License, Version 2.0 (the "License");
|
||||
// you may not use this file except in compliance with the License.
|
||||
// You may obtain a copy of the License at
|
||||
//
|
||||
// http://www.apache.org/licenses/LICENSE-2.0
|
||||
//
|
||||
// Unless required by applicable law or agreed to in writing, software
|
||||
// distributed under the License is distributed on an "AS IS" BASIS,
|
||||
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
// See the License for the specific language governing permissions and
|
||||
// limitations under the License.
|
||||
//
|
||||
|
||||
#include "harness/errorHelpers.h"
|
||||
|
||||
#include "common.h"
|
||||
#include "function_list.h"
|
||||
#include "test_functions.h"
|
||||
#include "utility.h"
|
||||
#include "reference_math.h"
|
||||
|
||||
#include <cstring>
|
||||
#include <algorithm>
|
||||
|
||||
namespace {
|
||||
|
||||
cl_int BuildKernel_HalfFn(cl_uint job_id, cl_uint thread_id UNUSED, void *p)
|
||||
{
|
||||
BuildKernelInfo &info = *(BuildKernelInfo *)p;
|
||||
auto generator = [](const std::string &kernel_name, const char *builtin,
|
||||
cl_uint vector_size_index) {
|
||||
return GetBinaryKernel(kernel_name, builtin, ParameterType::Half,
|
||||
ParameterType::Half, ParameterType::Half,
|
||||
vector_size_index);
|
||||
};
|
||||
return BuildKernels(info, job_id, generator);
|
||||
}
|
||||
|
||||
// Thread specific data for a worker thread
|
||||
struct ThreadInfo
|
||||
{
|
||||
clMemWrapper inBuf; // input buffer for the thread
|
||||
clMemWrapper inBuf2; // input buffer for the thread
|
||||
clMemWrapper outBuf[VECTOR_SIZE_COUNT]; // output buffers for the thread
|
||||
float maxError; // max error value. Init to 0.
|
||||
double
|
||||
maxErrorValue; // position of the max error value (param 1). Init to 0.
|
||||
double maxErrorValue2; // position of the max error value (param 2). Init
|
||||
// to 0.
|
||||
MTdataHolder d;
|
||||
|
||||
clCommandQueueWrapper
|
||||
tQueue; // per thread command queue to improve performance
|
||||
};
|
||||
|
||||
struct TestInfoBase
|
||||
{
|
||||
size_t subBufferSize; // Size of the sub-buffer in elements
|
||||
const Func *f; // A pointer to the function info
|
||||
|
||||
cl_uint threadCount; // Number of worker threads
|
||||
cl_uint jobCount; // Number of jobs
|
||||
cl_uint step; // step between each chunk and the next.
|
||||
cl_uint scale; // stride between individual test values
|
||||
float ulps; // max_allowed ulps
|
||||
int ftz; // non-zero if running in flush to zero mode
|
||||
|
||||
int isFDim;
|
||||
int skipNanInf;
|
||||
int isNextafter;
|
||||
};
|
||||
|
||||
struct TestInfo : public TestInfoBase
|
||||
{
|
||||
TestInfo(const TestInfoBase &base): TestInfoBase(base) {}
|
||||
|
||||
// Array of thread specific information
|
||||
std::vector<ThreadInfo> tinfo;
|
||||
|
||||
// Programs for various vector sizes.
|
||||
Programs programs;
|
||||
|
||||
// Thread-specific kernels for each vector size:
|
||||
// k[vector_size][thread_id]
|
||||
KernelMatrix k;
|
||||
};
|
||||
|
||||
// A table of more difficult cases to get right
|
||||
const cl_half specialValuesHalf[] = {
|
||||
0xffff, 0x0000, 0x0001, 0x7c00, /*INFINITY*/
|
||||
0xfc00, /*-INFINITY*/
|
||||
0x8000, /*-0*/
|
||||
0x7bff, /*HALF_MAX*/
|
||||
0x0400, /*HALF_MIN*/
|
||||
0x03ff, /* Largest denormal */
|
||||
0x3c00, /* 1 */
|
||||
0xbc00, /* -1 */
|
||||
0x3555, /*nearest value to 1/3*/
|
||||
0x3bff, /*largest number less than one*/
|
||||
0xc000, /* -2 */
|
||||
0xfbff, /* -HALF_MAX */
|
||||
0x8400, /* -HALF_MIN */
|
||||
0x4248, /* M_PI_H */
|
||||
0xc248, /* -M_PI_H */
|
||||
0xbbff, /* Largest negative fraction */
|
||||
};
|
||||
|
||||
constexpr size_t specialValuesHalfCount = ARRAY_SIZE(specialValuesHalf);
|
||||
|
||||
cl_int TestHalf(cl_uint job_id, cl_uint thread_id, void *data)
|
||||
{
|
||||
TestInfo *job = (TestInfo *)data;
|
||||
size_t buffer_elements = job->subBufferSize;
|
||||
size_t buffer_size = buffer_elements * sizeof(cl_half);
|
||||
cl_uint base = job_id * (cl_uint)job->step;
|
||||
ThreadInfo *tinfo = &(job->tinfo[thread_id]);
|
||||
float ulps = job->ulps;
|
||||
fptr func = job->f->func;
|
||||
int ftz = job->ftz;
|
||||
MTdata d = tinfo->d;
|
||||
cl_int error;
|
||||
const char *name = job->f->name;
|
||||
|
||||
int isFDim = job->isFDim;
|
||||
int skipNanInf = job->skipNanInf;
|
||||
int isNextafter = job->isNextafter;
|
||||
cl_ushort *t;
|
||||
cl_half *r;
|
||||
std::vector<float> s(0), s2(0);
|
||||
cl_uint j = 0;
|
||||
|
||||
RoundingMode oldRoundMode;
|
||||
cl_int copysign_test = 0;
|
||||
|
||||
// start the map of the output arrays
|
||||
cl_event e[VECTOR_SIZE_COUNT];
|
||||
cl_ushort *out[VECTOR_SIZE_COUNT];
|
||||
|
||||
if (gHostFill)
|
||||
{
|
||||
// start the map of the output arrays
|
||||
for (j = gMinVectorSizeIndex; j < gMaxVectorSizeIndex; j++)
|
||||
{
|
||||
out[j] = (cl_ushort *)clEnqueueMapBuffer(
|
||||
tinfo->tQueue, tinfo->outBuf[j], CL_FALSE, CL_MAP_WRITE, 0,
|
||||
buffer_size, 0, NULL, e + j, &error);
|
||||
if (error || NULL == out[j])
|
||||
{
|
||||
vlog_error("Error: clEnqueueMapBuffer %d failed! err: %d\n", j,
|
||||
error);
|
||||
return error;
|
||||
}
|
||||
}
|
||||
|
||||
// Get that moving
|
||||
if ((error = clFlush(tinfo->tQueue))) vlog("clFlush failed\n");
|
||||
}
|
||||
|
||||
// Init input array
|
||||
cl_ushort *p = (cl_ushort *)gIn + thread_id * buffer_elements;
|
||||
cl_ushort *p2 = (cl_ushort *)gIn2 + thread_id * buffer_elements;
|
||||
j = 0;
|
||||
int totalSpecialValueCount =
|
||||
specialValuesHalfCount * specialValuesHalfCount;
|
||||
int indx = (totalSpecialValueCount - 1) / buffer_elements;
|
||||
|
||||
if (job_id <= (cl_uint)indx)
|
||||
{ // test edge cases
|
||||
uint32_t x, y;
|
||||
|
||||
x = (job_id * buffer_elements) % specialValuesHalfCount;
|
||||
y = (job_id * buffer_elements) / specialValuesHalfCount;
|
||||
|
||||
for (; j < buffer_elements; j++)
|
||||
{
|
||||
p[j] = specialValuesHalf[x];
|
||||
p2[j] = specialValuesHalf[y];
|
||||
if (++x >= specialValuesHalfCount)
|
||||
{
|
||||
x = 0;
|
||||
y++;
|
||||
if (y >= specialValuesHalfCount) break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Init any remaining values.
|
||||
for (; j < buffer_elements; j++)
|
||||
{
|
||||
p[j] = (cl_ushort)genrand_int32(d);
|
||||
p2[j] = (cl_ushort)genrand_int32(d);
|
||||
}
|
||||
|
||||
if ((error = clEnqueueWriteBuffer(tinfo->tQueue, tinfo->inBuf, CL_FALSE, 0,
|
||||
buffer_size, p, 0, NULL, NULL)))
|
||||
{
|
||||
vlog_error("Error: clEnqueueWriteBuffer failed! err: %d\n", error);
|
||||
return error;
|
||||
}
|
||||
|
||||
if ((error = clEnqueueWriteBuffer(tinfo->tQueue, tinfo->inBuf2, CL_FALSE, 0,
|
||||
buffer_size, p2, 0, NULL, NULL)))
|
||||
{
|
||||
vlog_error("Error: clEnqueueWriteBuffer failed! err: %d\n", error);
|
||||
return error;
|
||||
}
|
||||
|
||||
for (j = gMinVectorSizeIndex; j < gMaxVectorSizeIndex; j++)
|
||||
{
|
||||
if (gHostFill)
|
||||
{
|
||||
// Wait for the map to finish
|
||||
if ((error = clWaitForEvents(1, e + j)))
|
||||
{
|
||||
vlog_error("Error: clWaitForEvents failed! err: %d\n", error);
|
||||
return error;
|
||||
}
|
||||
if ((error = clReleaseEvent(e[j])))
|
||||
{
|
||||
vlog_error("Error: clReleaseEvent failed! err: %d\n", error);
|
||||
return error;
|
||||
}
|
||||
}
|
||||
|
||||
// Fill the result buffer with garbage, so that old results don't carry
|
||||
// over
|
||||
uint32_t pattern = 0xacdcacdc;
|
||||
if (gHostFill)
|
||||
{
|
||||
memset_pattern4(out[j], &pattern, buffer_size);
|
||||
error = clEnqueueUnmapMemObject(tinfo->tQueue, tinfo->outBuf[j],
|
||||
out[j], 0, NULL, NULL);
|
||||
test_error(error, "clEnqueueUnmapMemObject failed!\n");
|
||||
}
|
||||
else
|
||||
{
|
||||
error = clEnqueueFillBuffer(tinfo->tQueue, tinfo->outBuf[j],
|
||||
&pattern, sizeof(pattern), 0,
|
||||
buffer_size, 0, NULL, NULL);
|
||||
test_error(error, "clEnqueueFillBuffer failed!\n");
|
||||
}
|
||||
|
||||
// run the kernel
|
||||
size_t vectorCount =
|
||||
(buffer_elements + sizeValues[j] - 1) / sizeValues[j];
|
||||
cl_kernel kernel = job->k[j][thread_id]; // each worker thread has its
|
||||
// own copy of the cl_kernel
|
||||
cl_program program = job->programs[j];
|
||||
|
||||
if ((error = clSetKernelArg(kernel, 0, sizeof(tinfo->outBuf[j]),
|
||||
&tinfo->outBuf[j])))
|
||||
{
|
||||
LogBuildError(program);
|
||||
return error;
|
||||
}
|
||||
if ((error = clSetKernelArg(kernel, 1, sizeof(tinfo->inBuf),
|
||||
&tinfo->inBuf)))
|
||||
{
|
||||
LogBuildError(program);
|
||||
return error;
|
||||
}
|
||||
if ((error = clSetKernelArg(kernel, 2, sizeof(tinfo->inBuf2),
|
||||
&tinfo->inBuf2)))
|
||||
{
|
||||
LogBuildError(program);
|
||||
return error;
|
||||
}
|
||||
|
||||
if ((error = clEnqueueNDRangeKernel(tinfo->tQueue, kernel, 1, NULL,
|
||||
&vectorCount, NULL, 0, NULL, NULL)))
|
||||
{
|
||||
vlog_error("FAILED -- could not execute kernel\n");
|
||||
return error;
|
||||
}
|
||||
}
|
||||
|
||||
// Get that moving
|
||||
if ((error = clFlush(tinfo->tQueue))) vlog("clFlush 2 failed\n");
|
||||
|
||||
if (gSkipCorrectnessTesting)
|
||||
{
|
||||
return CL_SUCCESS;
|
||||
}
|
||||
|
||||
FPU_mode_type oldMode;
|
||||
oldRoundMode = kRoundToNearestEven;
|
||||
if (isFDim)
|
||||
{
|
||||
// Calculate the correctly rounded reference result
|
||||
memset(&oldMode, 0, sizeof(oldMode));
|
||||
if (ftz) ForceFTZ(&oldMode);
|
||||
|
||||
// Set the rounding mode to match the device
|
||||
if (gIsInRTZMode) oldRoundMode = set_round(kRoundTowardZero, kfloat);
|
||||
}
|
||||
|
||||
if (!strcmp(name, "copysign")) copysign_test = 1;
|
||||
|
||||
#define ref_func(s, s2) (copysign_test ? func.f_ff_f(s, s2) : func.f_ff(s, s2))
|
||||
|
||||
// Calculate the correctly rounded reference result
|
||||
r = (cl_half *)gOut_Ref + thread_id * buffer_elements;
|
||||
t = (cl_ushort *)r;
|
||||
s.resize(buffer_elements);
|
||||
s2.resize(buffer_elements);
|
||||
for (j = 0; j < buffer_elements; j++)
|
||||
{
|
||||
s[j] = cl_half_to_float(p[j]);
|
||||
s2[j] = cl_half_to_float(p2[j]);
|
||||
if (isNextafter)
|
||||
r[j] = cl_half_from_float(reference_nextafterh(s[j], s2[j]),
|
||||
CL_HALF_RTE);
|
||||
else
|
||||
r[j] = cl_half_from_float(ref_func(s[j], s2[j]), CL_HALF_RTE);
|
||||
}
|
||||
|
||||
if (isFDim && ftz) RestoreFPState(&oldMode);
|
||||
// Read the data back -- no need to wait for the first N-1 buffers. This is
|
||||
// an in order queue.
|
||||
for (j = gMinVectorSizeIndex; j < gMaxVectorSizeIndex; j++)
|
||||
{
|
||||
cl_bool blocking = (j + 1 < gMaxVectorSizeIndex) ? CL_FALSE : CL_TRUE;
|
||||
out[j] = (cl_ushort *)clEnqueueMapBuffer(
|
||||
tinfo->tQueue, tinfo->outBuf[j], blocking, CL_MAP_READ, 0,
|
||||
buffer_size, 0, NULL, NULL, &error);
|
||||
if (error || NULL == out[j])
|
||||
{
|
||||
vlog_error("Error: clEnqueueMapBuffer %d failed! err: %d\n", j,
|
||||
error);
|
||||
return error;
|
||||
}
|
||||
}
|
||||
|
||||
// Verify data
|
||||
|
||||
for (j = 0; j < buffer_elements; j++)
|
||||
{
|
||||
for (auto k = gMinVectorSizeIndex; k < gMaxVectorSizeIndex; k++)
|
||||
{
|
||||
cl_ushort *q = out[k];
|
||||
|
||||
// If we aren't getting the correctly rounded result
|
||||
if (t[j] != q[j])
|
||||
{
|
||||
double correct;
|
||||
if (isNextafter)
|
||||
correct = reference_nextafterh(s[j], s2[j]);
|
||||
else
|
||||
correct = ref_func(s[j], s2[j]);
|
||||
|
||||
float test = cl_half_to_float(q[j]);
|
||||
|
||||
// Per section 10 paragraph 6, accept any result if an input or
|
||||
// output is a infinity or NaN or overflow
|
||||
if (skipNanInf)
|
||||
{
|
||||
// Note: no double rounding here. Reference functions
|
||||
// calculate in single precision.
|
||||
if (IsFloatInfinity(correct) || IsFloatNaN(correct)
|
||||
|| IsFloatInfinity(s2[j]) || IsFloatNaN(s2[j])
|
||||
|| IsFloatInfinity(s[j]) || IsFloatNaN(s[j]))
|
||||
continue;
|
||||
}
|
||||
float err = Ulp_Error_Half(q[j], correct);
|
||||
int fail = !(fabsf(err) <= ulps);
|
||||
|
||||
if (fail && ftz)
|
||||
{
|
||||
// retry per section 6.5.3.2
|
||||
if (IsHalfResultSubnormal(correct, ulps))
|
||||
{
|
||||
if (isNextafter)
|
||||
{
|
||||
correct = reference_nextafterh(s[j], s2[j], false);
|
||||
err = Ulp_Error_Half(q[j], correct);
|
||||
fail = !(fabsf(err) <= ulps);
|
||||
}
|
||||
|
||||
fail = fail && (test != 0.0f);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
|
||||
if (IsHalfSubnormal(p[j]))
|
||||
{
|
||||
double correct2, correct3;
|
||||
float err2, err3;
|
||||
if (isNextafter)
|
||||
{
|
||||
correct2 = reference_nextafterh(0.0, s2[j]);
|
||||
correct3 = reference_nextafterh(-0.0, s2[j]);
|
||||
}
|
||||
else
|
||||
{
|
||||
correct2 = ref_func(0.0, s2[j]);
|
||||
correct3 = ref_func(-0.0, s2[j]);
|
||||
}
|
||||
if (skipNanInf)
|
||||
{
|
||||
// Note: no double rounding here. Reference
|
||||
// functions calculate in single precision.
|
||||
if (IsFloatInfinity(correct2)
|
||||
|| IsFloatNaN(correct2)
|
||||
|| IsFloatInfinity(correct3)
|
||||
|| IsFloatNaN(correct3))
|
||||
continue;
|
||||
}
|
||||
|
||||
auto check_error = [&]() {
|
||||
err2 = Ulp_Error_Half(q[j], correct2);
|
||||
err3 = Ulp_Error_Half(q[j], correct3);
|
||||
fail = fail
|
||||
&& ((!(fabsf(err2) <= ulps))
|
||||
&& (!(fabsf(err3) <= ulps)));
|
||||
};
|
||||
check_error();
|
||||
if (fabsf(err2) < fabsf(err)) err = err2;
|
||||
if (fabsf(err3) < fabsf(err)) err = err3;
|
||||
|
||||
// retry per section 6.5.3.4
|
||||
if (IsHalfResultSubnormal(correct2, ulps)
|
||||
|| IsHalfResultSubnormal(correct3, ulps))
|
||||
{
|
||||
if (fail && isNextafter)
|
||||
{
|
||||
correct2 =
|
||||
reference_nextafterh(0.0, s2[j], false);
|
||||
correct3 =
|
||||
reference_nextafterh(-0.0, s2[j], false);
|
||||
check_error();
|
||||
}
|
||||
|
||||
fail = fail && (test != 0.0f);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
|
||||
// allow to omit denorm values for platforms with no
|
||||
// denorm support for nextafter
|
||||
if (fail && (isNextafter)
|
||||
&& (correct <= cl_half_to_float(0x3FF))
|
||||
&& (correct >= cl_half_to_float(0x83FF)))
|
||||
{
|
||||
fail = fail && (q[j] != p[j]);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
|
||||
// try with both args as zero
|
||||
if (IsHalfSubnormal(p2[j]))
|
||||
{
|
||||
double correct4, correct5;
|
||||
float err4, err5;
|
||||
|
||||
if (isNextafter)
|
||||
{
|
||||
correct2 = reference_nextafterh(0.0, 0.0);
|
||||
correct3 = reference_nextafterh(-0.0, 0.0);
|
||||
correct4 = reference_nextafterh(0.0, -0.0);
|
||||
correct5 = reference_nextafterh(-0.0, -0.0);
|
||||
}
|
||||
else
|
||||
{
|
||||
correct2 = ref_func(0.0, 0.0);
|
||||
correct3 = ref_func(-0.0, 0.0);
|
||||
correct4 = ref_func(0.0, -0.0);
|
||||
correct5 = ref_func(-0.0, -0.0);
|
||||
}
|
||||
|
||||
// Per section 10 paragraph 6, accept any result if
|
||||
// an input or output is a infinity or NaN or
|
||||
// overflow
|
||||
if (skipNanInf)
|
||||
{
|
||||
// Note: no double rounding here. Reference
|
||||
// functions calculate in single precision.
|
||||
if (IsFloatInfinity(correct2)
|
||||
|| IsFloatNaN(correct2)
|
||||
|| IsFloatInfinity(correct3)
|
||||
|| IsFloatNaN(correct3)
|
||||
|| IsFloatInfinity(correct4)
|
||||
|| IsFloatNaN(correct4)
|
||||
|| IsFloatInfinity(correct5)
|
||||
|| IsFloatNaN(correct5))
|
||||
continue;
|
||||
}
|
||||
|
||||
err2 = Ulp_Error_Half(q[j], correct2);
|
||||
err3 = Ulp_Error_Half(q[j], correct3);
|
||||
err4 = Ulp_Error_Half(q[j], correct4);
|
||||
err5 = Ulp_Error_Half(q[j], correct5);
|
||||
fail = fail
|
||||
&& ((!(fabsf(err2) <= ulps))
|
||||
&& (!(fabsf(err3) <= ulps))
|
||||
&& (!(fabsf(err4) <= ulps))
|
||||
&& (!(fabsf(err5) <= ulps)));
|
||||
if (fabsf(err2) < fabsf(err)) err = err2;
|
||||
if (fabsf(err3) < fabsf(err)) err = err3;
|
||||
if (fabsf(err4) < fabsf(err)) err = err4;
|
||||
if (fabsf(err5) < fabsf(err)) err = err5;
|
||||
|
||||
// retry per section 6.5.3.4
|
||||
if (IsHalfResultSubnormal(correct2, ulps)
|
||||
|| IsHalfResultSubnormal(correct3, ulps)
|
||||
|| IsHalfResultSubnormal(correct4, ulps)
|
||||
|| IsHalfResultSubnormal(correct5, ulps))
|
||||
{
|
||||
fail = fail && (test != 0.0f);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
|
||||
// allow to omit denorm values for platforms with no
|
||||
// denorm support for nextafter
|
||||
if (fail && (isNextafter)
|
||||
&& (correct <= cl_half_to_float(0x3FF))
|
||||
&& (correct >= cl_half_to_float(0x83FF)))
|
||||
{
|
||||
fail = fail && (q[j] != p2[j]);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (IsHalfSubnormal(p2[j]))
|
||||
{
|
||||
double correct2, correct3;
|
||||
float err2, err3;
|
||||
|
||||
if (isNextafter)
|
||||
{
|
||||
correct2 = reference_nextafterh(s[j], 0.0);
|
||||
correct3 = reference_nextafterh(s[j], -0.0);
|
||||
}
|
||||
else
|
||||
{
|
||||
correct2 = ref_func(s[j], 0.0);
|
||||
correct3 = ref_func(s[j], -0.0);
|
||||
}
|
||||
|
||||
if (skipNanInf)
|
||||
{
|
||||
// Note: no double rounding here. Reference
|
||||
// functions calculate in single precision.
|
||||
if (IsFloatInfinity(correct) || IsFloatNaN(correct)
|
||||
|| IsFloatInfinity(correct2)
|
||||
|| IsFloatNaN(correct2))
|
||||
continue;
|
||||
}
|
||||
|
||||
auto check_error = [&]() {
|
||||
err2 = Ulp_Error_Half(q[j], correct2);
|
||||
err3 = Ulp_Error_Half(q[j], correct3);
|
||||
fail = fail
|
||||
&& ((!(fabsf(err2) <= ulps))
|
||||
&& (!(fabsf(err3) <= ulps)));
|
||||
if (fabsf(err2) < fabsf(err)) err = err2;
|
||||
if (fabsf(err3) < fabsf(err)) err = err3;
|
||||
};
|
||||
check_error();
|
||||
|
||||
// retry per section 6.5.3.4
|
||||
if (IsHalfResultSubnormal(correct2, ulps)
|
||||
|| IsHalfResultSubnormal(correct3, ulps))
|
||||
{
|
||||
if (fail && isNextafter)
|
||||
{
|
||||
correct2 =
|
||||
reference_nextafterh(s[j], 0.0, false);
|
||||
correct3 =
|
||||
reference_nextafterh(s[j], -0.0, false);
|
||||
check_error();
|
||||
}
|
||||
|
||||
fail = fail && (test != 0.0f);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
|
||||
// allow to omit denorm values for platforms with no
|
||||
// denorm support for nextafter
|
||||
if (fail && (isNextafter)
|
||||
&& (correct <= cl_half_to_float(0x3FF))
|
||||
&& (correct >= cl_half_to_float(0x83FF)))
|
||||
{
|
||||
fail = fail && (q[j] != p2[j]);
|
||||
if (!fail) err = 0.0f;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (fabsf(err) > tinfo->maxError)
|
||||
{
|
||||
tinfo->maxError = fabsf(err);
|
||||
tinfo->maxErrorValue = s[j];
|
||||
tinfo->maxErrorValue2 = s2[j];
|
||||
}
|
||||
if (fail)
|
||||
{
|
||||
vlog_error("\nERROR: %s%s: %f ulp error at {%a (0x%04x), "
|
||||
"%a (0x%04x)}\nExpected: %a (half 0x%04x) "
|
||||
"\nActual: %a (half 0x%04x) at index: %u\n",
|
||||
name, sizeNames[k], err, s[j], p[j], s2[j],
|
||||
p2[j], cl_half_to_float(r[j]), r[j], test, q[j],
|
||||
j);
|
||||
error = -1;
|
||||
return error;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (isFDim && gIsInRTZMode) (void)set_round(oldRoundMode, kfloat);
|
||||
|
||||
for (j = gMinVectorSizeIndex; j < gMaxVectorSizeIndex; j++)
|
||||
{
|
||||
if ((error = clEnqueueUnmapMemObject(tinfo->tQueue, tinfo->outBuf[j],
|
||||
out[j], 0, NULL, NULL)))
|
||||
{
|
||||
vlog_error("Error: clEnqueueUnmapMemObject %d failed 2! err: %d\n",
|
||||
j, error);
|
||||
return error;
|
||||
}
|
||||
}
|
||||
|
||||
if ((error = clFlush(tinfo->tQueue))) vlog("clFlush 3 failed\n");
|
||||
|
||||
if (0 == (base & 0x0fffffff))
|
||||
{
|
||||
if (gVerboseBruteForce)
|
||||
{
|
||||
vlog("base:%14u step:%10u scale:%10u buf_elements:%10zu ulps:%5.3f "
|
||||
"ThreadCount:%2u\n",
|
||||
base, job->step, job->scale, buffer_elements, job->ulps,
|
||||
job->threadCount);
|
||||
}
|
||||
else
|
||||
{
|
||||
vlog(".");
|
||||
}
|
||||
fflush(stdout);
|
||||
}
|
||||
|
||||
return error;
|
||||
}
|
||||
|
||||
} // anonymous namespace
|
||||
|
||||
int TestFunc_Half_Half_Half_common(const Func *f, MTdata d, int isNextafter,
|
||||
bool relaxedMode)
|
||||
{
|
||||
TestInfoBase test_info_base;
|
||||
cl_int error;
|
||||
float maxError = 0.0f;
|
||||
double maxErrorVal = 0.0;
|
||||
double maxErrorVal2 = 0.0;
|
||||
|
||||
logFunctionInfo(f->name, sizeof(cl_half), relaxedMode);
|
||||
// Init test_info
|
||||
memset(&test_info_base, 0, sizeof(test_info_base));
|
||||
TestInfo test_info(test_info_base);
|
||||
|
||||
test_info.threadCount = GetThreadCount();
|
||||
test_info.subBufferSize = BUFFER_SIZE
|
||||
/ (sizeof(cl_half) * RoundUpToNextPowerOfTwo(test_info.threadCount));
|
||||
test_info.scale = getTestScale(sizeof(cl_half));
|
||||
|
||||
test_info.step = (cl_uint)test_info.subBufferSize * test_info.scale;
|
||||
if (test_info.step / test_info.subBufferSize != test_info.scale)
|
||||
{
|
||||
// there was overflow
|
||||
test_info.jobCount = 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
test_info.jobCount = (cl_uint)((1ULL << 32) / test_info.step);
|
||||
}
|
||||
|
||||
test_info.f = f;
|
||||
test_info.ulps = f->half_ulps;
|
||||
test_info.ftz =
|
||||
f->ftz || gForceFTZ || 0 == (CL_FP_DENORM & gHalfCapabilities);
|
||||
|
||||
test_info.isFDim = 0 == strcmp("fdim", f->nameInCode);
|
||||
test_info.skipNanInf = test_info.isFDim && !gInfNanSupport;
|
||||
test_info.isNextafter = isNextafter;
|
||||
|
||||
test_info.tinfo.resize(test_info.threadCount);
|
||||
|
||||
for (cl_uint i = 0; i < test_info.threadCount; i++)
|
||||
{
|
||||
cl_buffer_region region = { i * test_info.subBufferSize
|
||||
* sizeof(cl_half),
|
||||
test_info.subBufferSize * sizeof(cl_half) };
|
||||
test_info.tinfo[i].inBuf =
|
||||
clCreateSubBuffer(gInBuffer, CL_MEM_READ_ONLY,
|
||||
CL_BUFFER_CREATE_TYPE_REGION, ®ion, &error);
|
||||
if (error || NULL == test_info.tinfo[i].inBuf)
|
||||
{
|
||||
vlog_error("Error: Unable to create sub-buffer of gInBuffer for "
|
||||
"region {%zd, %zd}\n",
|
||||
region.origin, region.size);
|
||||
return error;
|
||||
}
|
||||
test_info.tinfo[i].inBuf2 =
|
||||
clCreateSubBuffer(gInBuffer2, CL_MEM_READ_ONLY,
|
||||
CL_BUFFER_CREATE_TYPE_REGION, ®ion, &error);
|
||||
if (error || NULL == test_info.tinfo[i].inBuf2)
|
||||
{
|
||||
vlog_error("Error: Unable to create sub-buffer of gInBuffer2 for "
|
||||
"region {%zd, %zd}\n",
|
||||
region.origin, region.size);
|
||||
return error;
|
||||
}
|
||||
|
||||
for (auto j = gMinVectorSizeIndex; j < gMaxVectorSizeIndex; j++)
|
||||
{
|
||||
test_info.tinfo[i].outBuf[j] = clCreateSubBuffer(
|
||||
gOutBuffer[j], CL_MEM_WRITE_ONLY, CL_BUFFER_CREATE_TYPE_REGION,
|
||||
®ion, &error);
|
||||
if (error || NULL == test_info.tinfo[i].outBuf[j])
|
||||
{
|
||||
vlog_error(
|
||||
"Error: Unable to create sub-buffer of gOutBuffer[%d] "
|
||||
"for region {%zd, %zd}\n",
|
||||
(int)j, region.origin, region.size);
|
||||
return error;
|
||||
}
|
||||
}
|
||||
test_info.tinfo[i].tQueue =
|
||||
clCreateCommandQueue(gContext, gDevice, 0, &error);
|
||||
if (NULL == test_info.tinfo[i].tQueue || error)
|
||||
{
|
||||
vlog_error("clCreateCommandQueue failed. (%d)\n", error);
|
||||
return error;
|
||||
}
|
||||
test_info.tinfo[i].d = MTdataHolder(genrand_int32(d));
|
||||
}
|
||||
|
||||
// Init the kernels
|
||||
{
|
||||
BuildKernelInfo build_info = { test_info.threadCount, test_info.k,
|
||||
test_info.programs, f->nameInCode };
|
||||
error = ThreadPool_Do(BuildKernel_HalfFn,
|
||||
gMaxVectorSizeIndex - gMinVectorSizeIndex,
|
||||
&build_info);
|
||||
test_error(error, "ThreadPool_Do: BuildKernel_HalfFn failed\n");
|
||||
}
|
||||
if (!gSkipCorrectnessTesting)
|
||||
{
|
||||
error = ThreadPool_Do(TestHalf, test_info.jobCount, &test_info);
|
||||
|
||||
// Accumulate the arithmetic errors
|
||||
for (cl_uint i = 0; i < test_info.threadCount; i++)
|
||||
{
|
||||
if (test_info.tinfo[i].maxError > maxError)
|
||||
{
|
||||
maxError = test_info.tinfo[i].maxError;
|
||||
maxErrorVal = test_info.tinfo[i].maxErrorValue;
|
||||
maxErrorVal2 = test_info.tinfo[i].maxErrorValue2;
|
||||
}
|
||||
}
|
||||
|
||||
test_error(error, "ThreadPool_Do: TestHalf failed\n");
|
||||
|
||||
if (gWimpyMode)
|
||||
vlog("Wimp pass");
|
||||
else
|
||||
vlog("passed");
|
||||
|
||||
vlog("\t%8.2f @ {%a, %a}", maxError, maxErrorVal, maxErrorVal2);
|
||||
}
|
||||
|
||||
vlog("\n");
|
||||
|
||||
return error;
|
||||
}
|
||||
|
||||
int TestFunc_Half_Half_Half(const Func *f, MTdata d, bool relaxedMode)
|
||||
{
|
||||
return TestFunc_Half_Half_Half_common(f, d, 0, relaxedMode);
|
||||
}
|
||||
|
||||
int TestFunc_Half_Half_Half_nextafter(const Func *f, MTdata d, bool relaxedMode)
|
||||
{
|
||||
return TestFunc_Half_Half_Half_common(f, d, 1, relaxedMode);
|
||||
}
|
||||
Reference in New Issue
Block a user