123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445 |
- // Copyright 2009-2021 Intel Corporation
- // SPDX-License-Identifier: Apache-2.0
- #pragma once
- #include "grid_soa.h"
- #include "../common/ray.h"
- #include "triangle_intersector_pluecker.h"
- namespace embree
- {
- namespace isa
- {
- template<int K>
- struct MapUV0
- {
- const float* const grid_uv;
- size_t ofs00, ofs01, ofs10, ofs11;
-
- __forceinline MapUV0(const float* const grid_uv, size_t ofs00, size_t ofs01, size_t ofs10, size_t ofs11)
- : grid_uv(grid_uv), ofs00(ofs00), ofs01(ofs01), ofs10(ofs10), ofs11(ofs11) {}
-
- __forceinline void operator() (vfloat<K>& u, vfloat<K>& v, Vec3vf<K>& Ng) const {
- const vfloat<K> uv00(grid_uv[ofs00]);
- const vfloat<K> uv01(grid_uv[ofs01]);
- const vfloat<K> uv10(grid_uv[ofs10]);
- const vfloat<K> uv11(grid_uv[ofs11]);
- const Vec2vf<K> uv0 = GridSOA::decodeUV(uv00);
- const Vec2vf<K> uv1 = GridSOA::decodeUV(uv01);
- const Vec2vf<K> uv2 = GridSOA::decodeUV(uv10);
- const Vec2vf<K> uv = madd(u,uv1,madd(v,uv2,(1.0f-u-v)*uv0));
- u = uv[0]; v = uv[1];
- }
- };
-
- template<int K>
- struct MapUV1
- {
- const float* const grid_uv;
- size_t ofs00, ofs01, ofs10, ofs11;
-
- __forceinline MapUV1(const float* const grid_uv, size_t ofs00, size_t ofs01, size_t ofs10, size_t ofs11)
- : grid_uv(grid_uv), ofs00(ofs00), ofs01(ofs01), ofs10(ofs10), ofs11(ofs11) {}
-
- __forceinline void operator() (vfloat<K>& u, vfloat<K>& v, Vec3vf<K>& Ng) const {
- const vfloat<K> uv00(grid_uv[ofs00]);
- const vfloat<K> uv01(grid_uv[ofs01]);
- const vfloat<K> uv10(grid_uv[ofs10]);
- const vfloat<K> uv11(grid_uv[ofs11]);
- const Vec2vf<K> uv0 = GridSOA::decodeUV(uv10);
- const Vec2vf<K> uv1 = GridSOA::decodeUV(uv01);
- const Vec2vf<K> uv2 = GridSOA::decodeUV(uv11);
- const Vec2vf<K> uv = madd(u,uv1,madd(v,uv2,(1.0f-u-v)*uv0));
- u = uv[0]; v = uv[1];
- }
- };
-
- template<int K>
- class GridSOAIntersectorK
- {
- public:
- typedef void Primitive;
- class Precalculations
- {
- #if defined(__AVX__)
- static const int M = 8;
- #else
- static const int M = 4;
- #endif
- public:
- __forceinline Precalculations (const vbool<K>& valid, const RayK<K>& ray)
- : grid(nullptr), intersector(valid,ray) {}
- public:
- GridSOA* grid;
- PlueckerIntersectorK<M,K> intersector; // FIXME: use quad intersector
- };
- /*! Intersect a ray with the primitive. */
- static __forceinline void intersect(const vbool<K>& valid_i, Precalculations& pre, RayHitK<K>& ray, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- const size_t dim_offset = pre.grid->dim_offset;
- const size_t line_offset = pre.grid->width;
- const float* const grid_x = pre.grid->decodeLeaf(0,prim);
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- const size_t max_x = pre.grid->width == 2 ? 1 : 2;
- const size_t max_y = pre.grid->height == 2 ? 1 : 2;
- for (size_t y=0; y<max_y; y++)
- {
- for (size_t x=0; x<max_x; x++)
- {
- const size_t ofs00 = (y+0)*line_offset+(x+0);
- const size_t ofs01 = (y+0)*line_offset+(x+1);
- const size_t ofs10 = (y+1)*line_offset+(x+0);
- const size_t ofs11 = (y+1)*line_offset+(x+1);
- const Vec3vf<K> p00(grid_x[ofs00],grid_y[ofs00],grid_z[ofs00]);
- const Vec3vf<K> p01(grid_x[ofs01],grid_y[ofs01],grid_z[ofs01]);
- const Vec3vf<K> p10(grid_x[ofs10],grid_y[ofs10],grid_z[ofs10]);
- const Vec3vf<K> p11(grid_x[ofs11],grid_y[ofs11],grid_z[ofs11]);
- pre.intersector.intersectK(valid_i,ray,p00,p01,p10,MapUV0<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),IntersectKEpilogMU<1,K,true>(ray,context,pre.grid->geomID(),pre.grid->primID()));
- pre.intersector.intersectK(valid_i,ray,p10,p01,p11,MapUV1<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),IntersectKEpilogMU<1,K,true>(ray,context,pre.grid->geomID(),pre.grid->primID()));
- }
- }
- }
- /*! Test if the ray is occluded by the primitive */
- static __forceinline vbool<K> occluded(const vbool<K>& valid_i, Precalculations& pre, RayK<K>& ray, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- const size_t dim_offset = pre.grid->dim_offset;
- const size_t line_offset = pre.grid->width;
- const float* const grid_x = pre.grid->decodeLeaf(0,prim);
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- vbool<K> valid = valid_i;
- const size_t max_x = pre.grid->width == 2 ? 1 : 2;
- const size_t max_y = pre.grid->height == 2 ? 1 : 2;
- for (size_t y=0; y<max_y; y++)
- {
- for (size_t x=0; x<max_x; x++)
- {
- const size_t ofs00 = (y+0)*line_offset+(x+0);
- const size_t ofs01 = (y+0)*line_offset+(x+1);
- const size_t ofs10 = (y+1)*line_offset+(x+0);
- const size_t ofs11 = (y+1)*line_offset+(x+1);
- const Vec3vf<K> p00(grid_x[ofs00],grid_y[ofs00],grid_z[ofs00]);
- const Vec3vf<K> p01(grid_x[ofs01],grid_y[ofs01],grid_z[ofs01]);
- const Vec3vf<K> p10(grid_x[ofs10],grid_y[ofs10],grid_z[ofs10]);
- const Vec3vf<K> p11(grid_x[ofs11],grid_y[ofs11],grid_z[ofs11]);
- pre.intersector.intersectK(valid,ray,p00,p01,p10,MapUV0<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),OccludedKEpilogMU<1,K,true>(valid,ray,context,pre.grid->geomID(),pre.grid->primID()));
- if (none(valid)) break;
- pre.intersector.intersectK(valid,ray,p10,p01,p11,MapUV1<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),OccludedKEpilogMU<1,K,true>(valid,ray,context,pre.grid->geomID(),pre.grid->primID()));
- if (none(valid)) break;
- }
- }
- return !valid;
- }
- template<typename Loader>
- static __forceinline void intersect(RayHitK<K>& ray, size_t k,
- RayQueryContext* context,
- const float* const grid_x,
- const size_t line_offset,
- const size_t lines,
- Precalculations& pre)
- {
- typedef typename Loader::vfloat vfloat;
- const size_t dim_offset = pre.grid->dim_offset;
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- Vec3<vfloat> v0, v1, v2; Loader::gather(grid_x,grid_y,grid_z,line_offset,lines,v0,v1,v2);
- pre.intersector.intersect(ray,k,v0,v1,v2,GridSOA::MapUV<Loader>(grid_uv,line_offset,lines),Intersect1KEpilogMU<Loader::M,K,true>(ray,k,context,pre.grid->geomID(),pre.grid->primID()));
- };
- template<typename Loader>
- static __forceinline bool occluded(RayK<K>& ray, size_t k,
- RayQueryContext* context,
- const float* const grid_x,
- const size_t line_offset,
- const size_t lines,
- Precalculations& pre)
- {
- typedef typename Loader::vfloat vfloat;
- const size_t dim_offset = pre.grid->dim_offset;
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- Vec3<vfloat> v0, v1, v2; Loader::gather(grid_x,grid_y,grid_z,line_offset,lines,v0,v1,v2);
- return pre.intersector.intersect(ray,k,v0,v1,v2,GridSOA::MapUV<Loader>(grid_uv,line_offset,lines),Occluded1KEpilogMU<Loader::M,K,true>(ray,k,context,pre.grid->geomID(),pre.grid->primID()));
- }
- /*! Intersect a ray with the primitive. */
- static __forceinline void intersect(Precalculations& pre, RayHitK<K>& ray, size_t k, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- const size_t line_offset = pre.grid->width;
- const size_t lines = pre.grid->height;
- const float* const grid_x = pre.grid->decodeLeaf(0,prim);
- #if defined(__AVX__)
- intersect<GridSOA::Gather3x3>( ray, k, context, grid_x, line_offset, lines, pre);
- #else
- intersect<GridSOA::Gather2x3>(ray, k, context, grid_x , line_offset, lines, pre);
- if (likely(lines > 2))
- intersect<GridSOA::Gather2x3>(ray, k, context, grid_x+line_offset, line_offset, lines, pre);
- #endif
- }
- /*! Test if the ray is occluded by the primitive */
- static __forceinline bool occluded(Precalculations& pre, RayK<K>& ray, size_t k, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- const size_t line_offset = pre.grid->width;
- const size_t lines = pre.grid->height;
- const float* const grid_x = pre.grid->decodeLeaf(0,prim);
- #if defined(__AVX__)
- return occluded<GridSOA::Gather3x3>( ray, k, context, grid_x, line_offset, lines, pre);
- #else
- if (occluded<GridSOA::Gather2x3>(ray, k, context, grid_x , line_offset, lines, pre)) return true;
- if (likely(lines > 2))
- if (occluded<GridSOA::Gather2x3>(ray, k, context, grid_x+line_offset, line_offset, lines, pre)) return true;
- #endif
- return false;
- }
- };
- template<int K>
- class GridSOAMBIntersectorK
- {
- public:
- typedef void Primitive;
- typedef typename GridSOAIntersectorK<K>::Precalculations Precalculations;
- /*! Intersect a ray with the primitive. */
- static __forceinline void intersect(const vbool<K>& valid_i, Precalculations& pre, RayHitK<K>& ray, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- vfloat<K> vftime;
- vint<K> vitime = getTimeSegment<K>(ray.time(), vfloat<K>((float)(pre.grid->time_steps-1)), vftime);
- vbool<K> valid1 = valid_i;
- while (any(valid1)) {
- const size_t j = bsf(movemask(valid1));
- const int itime = vitime[j];
- const vbool<K> valid2 = valid1 & (itime == vitime);
- valid1 = valid1 & !valid2;
- intersect(valid2,pre,ray,vftime,itime,context,prim,lazy_node);
- }
- }
- /*! Intersect a ray with the primitive. */
- static __forceinline void intersect(const vbool<K>& valid_i, Precalculations& pre, RayHitK<K>& ray, const vfloat<K>& ftime, int itime, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- const size_t grid_offset = pre.grid->gridBytes >> 2;
- const size_t dim_offset = pre.grid->dim_offset;
- const size_t line_offset = pre.grid->width;
- const float* const grid_x = pre.grid->decodeLeaf(itime,prim);
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- const size_t max_x = pre.grid->width == 2 ? 1 : 2;
- const size_t max_y = pre.grid->height == 2 ? 1 : 2;
- for (size_t y=0; y<max_y; y++)
- {
- for (size_t x=0; x<max_x; x++)
- {
- size_t ofs00 = (y+0)*line_offset+(x+0);
- size_t ofs01 = (y+0)*line_offset+(x+1);
- size_t ofs10 = (y+1)*line_offset+(x+0);
- size_t ofs11 = (y+1)*line_offset+(x+1);
- const Vec3vf<K> a00(grid_x[ofs00],grid_y[ofs00],grid_z[ofs00]);
- const Vec3vf<K> a01(grid_x[ofs01],grid_y[ofs01],grid_z[ofs01]);
- const Vec3vf<K> a10(grid_x[ofs10],grid_y[ofs10],grid_z[ofs10]);
- const Vec3vf<K> a11(grid_x[ofs11],grid_y[ofs11],grid_z[ofs11]);
- ofs00 += grid_offset;
- ofs01 += grid_offset;
- ofs10 += grid_offset;
- ofs11 += grid_offset;
- const Vec3vf<K> b00(grid_x[ofs00],grid_y[ofs00],grid_z[ofs00]);
- const Vec3vf<K> b01(grid_x[ofs01],grid_y[ofs01],grid_z[ofs01]);
- const Vec3vf<K> b10(grid_x[ofs10],grid_y[ofs10],grid_z[ofs10]);
- const Vec3vf<K> b11(grid_x[ofs11],grid_y[ofs11],grid_z[ofs11]);
- const Vec3vf<K> p00 = lerp(a00,b00,ftime);
- const Vec3vf<K> p01 = lerp(a01,b01,ftime);
- const Vec3vf<K> p10 = lerp(a10,b10,ftime);
- const Vec3vf<K> p11 = lerp(a11,b11,ftime);
- pre.intersector.intersectK(valid_i,ray,p00,p01,p10,MapUV0<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),IntersectKEpilogMU<1,K,true>(ray,context,pre.grid->geomID(),pre.grid->primID()));
- pre.intersector.intersectK(valid_i,ray,p10,p01,p11,MapUV1<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),IntersectKEpilogMU<1,K,true>(ray,context,pre.grid->geomID(),pre.grid->primID()));
- }
- }
- }
- /*! Test if the ray is occluded by the primitive */
- static __forceinline vbool<K> occluded(const vbool<K>& valid_i, Precalculations& pre, RayK<K>& ray, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- vfloat<K> vftime;
- vint<K> vitime = getTimeSegment<K>(ray.time(), vfloat<K>((float)(pre.grid->time_steps-1)), vftime);
- vbool<K> valid_o = valid_i;
- vbool<K> valid1 = valid_i;
- while (any(valid1)) {
- const int j = int(bsf(movemask(valid1)));
- const int itime = vitime[j];
- const vbool<K> valid2 = valid1 & (itime == vitime);
- valid1 = valid1 & !valid2;
- valid_o &= !valid2 | occluded(valid2,pre,ray,vftime,itime,context,prim,lazy_node);
- }
- return !valid_o;
- }
- /*! Test if the ray is occluded by the primitive */
- static __forceinline vbool<K> occluded(const vbool<K>& valid_i, Precalculations& pre, RayK<K>& ray, const vfloat<K>& ftime, int itime, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- const size_t grid_offset = pre.grid->gridBytes >> 2;
- const size_t dim_offset = pre.grid->dim_offset;
- const size_t line_offset = pre.grid->width;
- const float* const grid_x = pre.grid->decodeLeaf(itime,prim);
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- vbool<K> valid = valid_i;
- const size_t max_x = pre.grid->width == 2 ? 1 : 2;
- const size_t max_y = pre.grid->height == 2 ? 1 : 2;
- for (size_t y=0; y<max_y; y++)
- {
- for (size_t x=0; x<max_x; x++)
- {
- size_t ofs00 = (y+0)*line_offset+(x+0);
- size_t ofs01 = (y+0)*line_offset+(x+1);
- size_t ofs10 = (y+1)*line_offset+(x+0);
- size_t ofs11 = (y+1)*line_offset+(x+1);
- const Vec3vf<K> a00(grid_x[ofs00],grid_y[ofs00],grid_z[ofs00]);
- const Vec3vf<K> a01(grid_x[ofs01],grid_y[ofs01],grid_z[ofs01]);
- const Vec3vf<K> a10(grid_x[ofs10],grid_y[ofs10],grid_z[ofs10]);
- const Vec3vf<K> a11(grid_x[ofs11],grid_y[ofs11],grid_z[ofs11]);
- ofs00 += grid_offset;
- ofs01 += grid_offset;
- ofs10 += grid_offset;
- ofs11 += grid_offset;
- const Vec3vf<K> b00(grid_x[ofs00],grid_y[ofs00],grid_z[ofs00]);
- const Vec3vf<K> b01(grid_x[ofs01],grid_y[ofs01],grid_z[ofs01]);
- const Vec3vf<K> b10(grid_x[ofs10],grid_y[ofs10],grid_z[ofs10]);
- const Vec3vf<K> b11(grid_x[ofs11],grid_y[ofs11],grid_z[ofs11]);
- const Vec3vf<K> p00 = lerp(a00,b00,ftime);
- const Vec3vf<K> p01 = lerp(a01,b01,ftime);
- const Vec3vf<K> p10 = lerp(a10,b10,ftime);
- const Vec3vf<K> p11 = lerp(a11,b11,ftime);
- pre.intersector.intersectK(valid,ray,p00,p01,p10,MapUV0<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),OccludedKEpilogMU<1,K,true>(valid,ray,context,pre.grid->geomID(),pre.grid->primID()));
- if (none(valid)) break;
- pre.intersector.intersectK(valid,ray,p10,p01,p11,MapUV1<K>(grid_uv,ofs00,ofs01,ofs10,ofs11),OccludedKEpilogMU<1,K,true>(valid,ray,context,pre.grid->geomID(),pre.grid->primID()));
- if (none(valid)) break;
- }
- }
- return valid;
- }
- template<typename Loader>
- static __forceinline void intersect(RayHitK<K>& ray, size_t k,
- const float ftime,
- RayQueryContext* context,
- const float* const grid_x,
- const size_t line_offset,
- const size_t lines,
- Precalculations& pre)
- {
- typedef typename Loader::vfloat vfloat;
- const size_t grid_offset = pre.grid->gridBytes >> 2;
- const size_t dim_offset = pre.grid->dim_offset;
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- Vec3<vfloat> a0, a1, a2;
- Loader::gather(grid_x,grid_y,grid_z,line_offset,lines,a0,a1,a2);
- Vec3<vfloat> b0, b1, b2;
- Loader::gather(grid_x+grid_offset,grid_y+grid_offset,grid_z+grid_offset,line_offset,lines,b0,b1,b2);
- Vec3<vfloat> v0 = lerp(a0,b0,vfloat(ftime));
- Vec3<vfloat> v1 = lerp(a1,b1,vfloat(ftime));
- Vec3<vfloat> v2 = lerp(a2,b2,vfloat(ftime));
- pre.intersector.intersect(ray,k,v0,v1,v2,GridSOA::MapUV<Loader>(grid_uv,line_offset,lines),Intersect1KEpilogMU<Loader::M,K,true>(ray,k,context,pre.grid->geomID(),pre.grid->primID()));
- };
- template<typename Loader>
- static __forceinline bool occluded(RayK<K>& ray, size_t k,
- const float ftime,
- RayQueryContext* context,
- const float* const grid_x,
- const size_t line_offset,
- const size_t lines,
- Precalculations& pre)
- {
- typedef typename Loader::vfloat vfloat;
- const size_t grid_offset = pre.grid->gridBytes >> 2;
- const size_t dim_offset = pre.grid->dim_offset;
- const float* const grid_y = grid_x + 1 * dim_offset;
- const float* const grid_z = grid_x + 2 * dim_offset;
- const float* const grid_uv = grid_x + 3 * dim_offset;
- Vec3<vfloat> a0, a1, a2;
- Loader::gather(grid_x,grid_y,grid_z,line_offset,lines,a0,a1,a2);
- Vec3<vfloat> b0, b1, b2;
- Loader::gather(grid_x+grid_offset,grid_y+grid_offset,grid_z+grid_offset,line_offset,lines,b0,b1,b2);
- Vec3<vfloat> v0 = lerp(a0,b0,vfloat(ftime));
- Vec3<vfloat> v1 = lerp(a1,b1,vfloat(ftime));
- Vec3<vfloat> v2 = lerp(a2,b2,vfloat(ftime));
- return pre.intersector.intersect(ray,k,v0,v1,v2,GridSOA::MapUV<Loader>(grid_uv,line_offset,lines),Occluded1KEpilogMU<Loader::M,K,true>(ray,k,context,pre.grid->geomID(),pre.grid->primID()));
- }
- /*! Intersect a ray with the primitive. */
- static __forceinline void intersect(Precalculations& pre, RayHitK<K>& ray, size_t k, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- float ftime;
- int itime = getTimeSegment(ray.time()[k], float(pre.grid->time_steps-1), ftime);
- const size_t line_offset = pre.grid->width;
- const size_t lines = pre.grid->height;
- const float* const grid_x = pre.grid->decodeLeaf(itime,prim);
- #if defined(__AVX__)
- intersect<GridSOA::Gather3x3>( ray, k, ftime, context, grid_x, line_offset, lines, pre);
- #else
- intersect<GridSOA::Gather2x3>(ray, k, ftime, context, grid_x, line_offset, lines, pre);
- if (likely(lines > 2))
- intersect<GridSOA::Gather2x3>(ray, k, ftime, context, grid_x+line_offset, line_offset, lines, pre);
- #endif
- }
- /*! Test if the ray is occluded by the primitive */
- static __forceinline bool occluded(Precalculations& pre, RayK<K>& ray, size_t k, RayQueryContext* context, const Primitive* prim, size_t& lazy_node)
- {
- float ftime;
- int itime = getTimeSegment(ray.time()[k], float(pre.grid->time_steps-1), ftime);
- const size_t line_offset = pre.grid->width;
- const size_t lines = pre.grid->height;
- const float* const grid_x = pre.grid->decodeLeaf(itime,prim);
- #if defined(__AVX__)
- return occluded<GridSOA::Gather3x3>( ray, k, ftime, context, grid_x, line_offset, lines, pre);
- #else
- if (occluded<GridSOA::Gather2x3>(ray, k, ftime, context, grid_x, line_offset, lines, pre)) return true;
- if (likely(lines > 2))
- if (occluded<GridSOA::Gather2x3>(ray, k, ftime, context, grid_x+line_offset, line_offset, lines, pre)) return true;
- #endif
- return false;
- }
- };
- }
- }
|