264 lines
8.7 KiB
Plaintext
264 lines
8.7 KiB
Plaintext
/*
|
|
Copyright (c) 2010-2011, Intel Corporation
|
|
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 Intel Corporation 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 THE COPYRIGHT OWNER
|
|
OR CONTRIBUTORS 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.
|
|
*/
|
|
|
|
#define bool int
|
|
|
|
typedef float<3> float3;
|
|
|
|
struct Ray {
|
|
float3 origin, dir, invDir;
|
|
uniform unsigned int dirIsNeg[3];
|
|
float mint, maxt;
|
|
int hitId;
|
|
};
|
|
|
|
struct Triangle {
|
|
uniform float3 p[3];
|
|
uniform int id;
|
|
};
|
|
|
|
struct LinearBVHNode {
|
|
uniform float3 bounds[2];
|
|
uniform unsigned int offset; // num primitives for leaf, second child for interior
|
|
uniform unsigned int8 nPrimitives;
|
|
uniform unsigned int8 splitAxis;
|
|
uniform unsigned int16 pad;
|
|
};
|
|
|
|
static inline float3 Cross(const float3 v1, const float3 v2) {
|
|
float v1x = v1.x, v1y = v1.y, v1z = v1.z;
|
|
float v2x = v2.x, v2y = v2.y, v2z = v2.z;
|
|
float3 ret;
|
|
ret.x = (v1y * v2z) - (v1z * v2y);
|
|
ret.y = (v1z * v2x) - (v1x * v2z);
|
|
ret.z = (v1x * v2y) - (v1y * v2x);
|
|
return ret;
|
|
}
|
|
|
|
static inline float Dot(const float3 a, const float3 b) {
|
|
return a.x * b.x + a.y * b.y + a.z * b.z;
|
|
}
|
|
|
|
|
|
static void generateRay(uniform const float raster2camera[4][4],
|
|
uniform const float camera2world[4][4],
|
|
float x, float y, reference Ray ray) {
|
|
ray.mint = 0.f;
|
|
ray.maxt = 1e30f;
|
|
|
|
ray.hitId = 0;
|
|
|
|
// transform raster coordinate (x, y, 0) to camera space
|
|
float camx = raster2camera[0][0] * x + raster2camera[0][1] * y + raster2camera[0][3];
|
|
float camy = raster2camera[1][0] * x + raster2camera[1][1] * y + raster2camera[1][3];
|
|
float camz = raster2camera[2][3];
|
|
float camw = raster2camera[3][3];
|
|
camx /= camw;
|
|
camy /= camw;
|
|
camz /= camw;
|
|
|
|
ray.dir.x = camera2world[0][0] * camx + camera2world[0][1] * camy + camera2world[0][2] * camz;
|
|
ray.dir.y = camera2world[1][0] * camx + camera2world[1][1] * camy + camera2world[1][2] * camz;
|
|
ray.dir.z = camera2world[2][0] * camx + camera2world[2][1] * camy + camera2world[2][2] * camz;
|
|
|
|
ray.origin.x = camera2world[0][3] / camera2world[3][3];
|
|
ray.origin.y = camera2world[1][3] / camera2world[3][3];
|
|
ray.origin.z = camera2world[2][3] / camera2world[3][3];
|
|
|
|
ray.invDir = 1.f / ray.dir;
|
|
|
|
ray.dirIsNeg[0] = any(ray.invDir.x < 0) ? 1 : 0;
|
|
ray.dirIsNeg[1] = any(ray.invDir.y < 0) ? 1 : 0;
|
|
ray.dirIsNeg[2] = any(ray.invDir.z < 0) ? 1 : 0;
|
|
}
|
|
|
|
|
|
static inline bool BBoxIntersect(const reference uniform float3 bounds[2],
|
|
const reference Ray ray) {
|
|
float t0 = ray.mint, t1 = ray.maxt;
|
|
|
|
// Check all three axis-aligned slabs. Don't try to early out; it's
|
|
// not worth the trouble
|
|
float3 tNear = (bounds[0] - ray.origin) * ray.invDir;
|
|
float3 tFar = (bounds[1] - ray.origin) * ray.invDir;
|
|
if (tNear.x > tFar.x) {
|
|
float tmp = tNear.x;
|
|
tNear.x = tFar.x;
|
|
tFar.x = tmp;
|
|
}
|
|
t0 = max(tNear.x, t0);
|
|
t1 = min(tFar.x, t1);
|
|
|
|
if (tNear.y > tFar.y) {
|
|
float tmp = tNear.y;
|
|
tNear.y = tFar.y;
|
|
tFar.y = tmp;
|
|
}
|
|
t0 = max(tNear.y, t0);
|
|
t1 = min(tFar.y, t1);
|
|
|
|
if (tNear.z > tFar.z) {
|
|
float tmp = tNear.z;
|
|
tNear.z = tFar.z;
|
|
tFar.z = tmp;
|
|
}
|
|
t0 = max(tNear.z, t0);
|
|
t1 = min(tFar.z, t1);
|
|
|
|
return (t0 <= t1);
|
|
}
|
|
|
|
|
|
|
|
static inline bool TriIntersect(const reference Triangle tri, reference Ray ray) {
|
|
uniform float3 e1 = tri.p[1] - tri.p[0];
|
|
uniform float3 e2 = tri.p[2] - tri.p[0];
|
|
|
|
float3 s1 = Cross(ray.dir, e2);
|
|
float divisor = Dot(s1, e1);
|
|
bool hit = true;
|
|
|
|
if (divisor == 0.)
|
|
hit = false;
|
|
float invDivisor = 1.f / divisor;
|
|
|
|
// Compute first barycentric coordinate
|
|
float3 d = ray.origin - tri.p[0];
|
|
float b1 = Dot(d, s1) * invDivisor;
|
|
if (b1 < 0. || b1 > 1.)
|
|
hit = false;
|
|
|
|
// Compute second barycentric coordinate
|
|
float3 s2 = Cross(d, e1);
|
|
float b2 = Dot(ray.dir, s2) * invDivisor;
|
|
if (b2 < 0. || b1 + b2 > 1.)
|
|
hit = false;
|
|
|
|
// Compute _t_ to intersection point
|
|
float t = Dot(e2, s2) * invDivisor;
|
|
if (t < ray.mint || t > ray.maxt)
|
|
hit = false;
|
|
|
|
if (hit) {
|
|
ray.maxt = t;
|
|
ray.hitId = tri.id;
|
|
}
|
|
return hit;
|
|
}
|
|
|
|
|
|
bool BVHIntersect(const LinearBVHNode nodes[], const Triangle tris[],
|
|
reference Ray r) {
|
|
Ray ray = r;
|
|
bool hit = false;
|
|
// Follow ray through BVH nodes to find primitive intersections
|
|
uniform int todoOffset = 0, nodeNum = 0;
|
|
uniform int todo[64];
|
|
|
|
while (true) {
|
|
// Check ray against BVH node
|
|
LinearBVHNode node = nodes[nodeNum];
|
|
if (any(BBoxIntersect(node.bounds, ray))) {
|
|
uniform unsigned int nPrimitives = node.nPrimitives;
|
|
if (nPrimitives > 0) {
|
|
// Intersect ray with primitives in leaf BVH node
|
|
uniform unsigned int primitivesOffset = node.offset;
|
|
for (uniform unsigned int i = 0; i < nPrimitives; ++i) {
|
|
if (TriIntersect(tris[primitivesOffset+i], ray))
|
|
hit = true;
|
|
}
|
|
if (todoOffset == 0)
|
|
break;
|
|
nodeNum = todo[--todoOffset];
|
|
}
|
|
else {
|
|
// Put far BVH node on _todo_ stack, advance to near node
|
|
if (r.dirIsNeg[node.splitAxis]) {
|
|
todo[todoOffset++] = nodeNum + 1;
|
|
nodeNum = node.offset;
|
|
}
|
|
else {
|
|
todo[todoOffset++] = node.offset;
|
|
nodeNum = nodeNum + 1;
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
if (todoOffset == 0)
|
|
break;
|
|
nodeNum = todo[--todoOffset];
|
|
}
|
|
}
|
|
r.maxt = ray.maxt;
|
|
r.hitId = ray.hitId;
|
|
|
|
return hit;
|
|
}
|
|
|
|
|
|
export void raytrace(uniform int width, uniform int height,
|
|
const uniform float raster2camera[4][4],
|
|
const uniform float camera2world[4][4],
|
|
uniform float image[], uniform int id[],
|
|
const LinearBVHNode nodes[],
|
|
const Triangle triangles[]) {
|
|
static const uniform float udx[16] = { 0, 1, 0, 1, 2, 3, 2, 3,
|
|
0, 1, 0, 1, 2, 3, 2, 3 };
|
|
static const uniform float udy[16] = { 0, 0, 1, 1, 0, 0, 1, 1,
|
|
2, 2, 3, 3, 2, 2, 3, 3 };
|
|
|
|
// The outer loops are always over blocks of 4x4 pixels
|
|
for (uniform int y = 0; y < height; y += 4) {
|
|
for (uniform int x = 0; x < width; x += 4) {
|
|
// Now we have a block of 4x4=16 pixels to process; it will
|
|
// take 16/programCount iterations of this loop to process
|
|
// them.
|
|
for (uniform int o = 0; o < 16 / programCount; ++o) {
|
|
// Map program instances to samples in the udx/udy arrays
|
|
// to figure out which pixel each program instance is
|
|
// responsible for
|
|
const float dx = udx[o * programCount + programIndex];
|
|
const float dy = udy[o * programCount + programIndex];
|
|
|
|
Ray ray;
|
|
generateRay(raster2camera, camera2world, x+dx, y+dy, ray);
|
|
BVHIntersect(nodes, triangles, ray);
|
|
|
|
int offset = (y + (int)dy) * width + (x + (int)dx);
|
|
image[offset] = ray.maxt;
|
|
id[offset] = ray.hitId;
|
|
}
|
|
}
|
|
}
|
|
}
|