Lines Matching refs:returnValues
1804 log << TestLog::Image("ReturnValues" + toString(sliceOrFaceNdx),
1821 IntFloatArr returnValues;
1836 returnValues.i[i] = resultSlice.getPixelInt(gid.x(), y).x();
1841 returnValues.f[i] = resultSlice.getPixel(gid.x(), y).x();
1852 returnValues.i)
1857 returnValues.f);
1862 << (isIntegerFormat ? arrayStr(returnValues.i) : arrayStr(returnValues.f)) << TestLog::EndMessage
1880 //! Check whether there exists an ordering of args such that { init*A", init*A*B, ..., init*A*B*...*LAST } is the "returnValues" sequence, where { A, B, ..., LAST } is args, and * denotes the operation.
1881 // That is, whether "returnValues" is a valid sequence of intermediate return values when "operation" has been accumulated on "args" (and "init") in some arbitrary order.
1883 static bool verifyOperationAccumulationIntermediateValues (AtomicOperation operation, T init, const T (&args)[NUM_INVOCATIONS_PER_PIXEL], const T (&returnValues)[NUM_INVOCATIONS_PER_PIXEL])
1887 return verifyRecursive(operation, 0, init, argsUsed, args, returnValues);
1895 static bool verifyRecursive (AtomicOperation operation, int index, T valueSoFar, bool (&argsUsed)[NUM_INVOCATIONS_PER_PIXEL], const T (&args)[NUM_INVOCATIONS_PER_PIXEL], const T (&returnValues)[NUM_INVOCATIONS_PER_PIXEL])
1901 if (!argsUsed[i] && compare(returnValues[i], valueSoFar))
1904 if (verifyRecursive(operation, index+1, computeBinaryAtomicOperationResult(operation, valueSoFar, args[i]), argsUsed, args, returnValues))
2239 log << TestLog::Image("ReturnValues" + toString(sliceOrFaceNdx),
2250 int returnValues[NUM_INVOCATIONS_PER_PIXEL];
2262 returnValues[i] = resultSlice.getPixelInt(gid.x(), y).x();
2283 if (returnValues[i] == compareArgs[currentAtomicValueNdx])
2285 if (i > 0 && returnValues[i] == compareArgs[currentAtomicValueNdx+1])
2298 << arrayStr(returnValues) << TestLog::EndMessage
2306 log << TestLog::Message << "// Note: the first return value (" << returnValues[0] << ") isn't " << compareArgs[0] << TestLog::EndMessage;
2308 log << TestLog::Message << "// Note: the return value at index " << failingNdx << " (value " << returnValues[failingNdx] << ") "
2309 << "is neither " << returnValues[failingNdx-1] << " (the one just before it) "
2310 << "nor " << compareArgs[arrayIndexOf(compareArgs, returnValues[failingNdx-1])+1] << " (the smallest value bigger than the one just before it)"
