Path: blob/master/thirdparty/embree/kernels/common/acceln.cpp
9905 views
// Copyright 2009-2021 Intel Corporation1// SPDX-License-Identifier: Apache-2.023#include "acceln.h"4#include "ray.h"5#include "../../include/embree4/rtcore_ray.h"6#include "../../common/algorithms/parallel_for.h"78namespace embree9{10AccelN::AccelN()11: Accel(AccelData::TY_ACCELN), accels() {}1213AccelN::~AccelN()14{15for (size_t i=0; i<accels.size(); i++)16delete accels[i];17}1819void AccelN::accels_add(Accel* accel)20{21assert(accel);22accels.push_back(accel);23}2425void AccelN::accels_init()26{27for (size_t i=0; i<accels.size(); i++)28delete accels[i];2930accels.clear();31}3233bool AccelN::pointQuery (Accel::Intersectors* This_in, PointQuery* query, PointQueryContext* context)34{35bool changed = false;36AccelN* This = (AccelN*)This_in->ptr;37for (size_t i=0; i<This->accels.size(); i++)38if (!This->accels[i]->isEmpty())39changed |= This->accels[i]->intersectors.pointQuery(query,context);40return changed;41}4243void AccelN::intersect (Accel::Intersectors* This_in, RTCRayHit& ray, RayQueryContext* context)44{45AccelN* This = (AccelN*)This_in->ptr;46for (size_t i=0; i<This->accels.size(); i++)47if (!This->accels[i]->isEmpty())48This->accels[i]->intersectors.intersect(ray,context);49}5051void AccelN::intersect4 (const void* valid, Accel::Intersectors* This_in, RTCRayHit4& ray, RayQueryContext* context)52{53AccelN* This = (AccelN*)This_in->ptr;54for (size_t i=0; i<This->accels.size(); i++)55if (!This->accels[i]->isEmpty())56This->accels[i]->intersectors.intersect4(valid,ray,context);57}5859void AccelN::intersect8 (const void* valid, Accel::Intersectors* This_in, RTCRayHit8& ray, RayQueryContext* context)60{61AccelN* This = (AccelN*)This_in->ptr;62for (size_t i=0; i<This->accels.size(); i++)63if (!This->accels[i]->isEmpty())64This->accels[i]->intersectors.intersect8(valid,ray,context);65}6667void AccelN::intersect16 (const void* valid, Accel::Intersectors* This_in, RTCRayHit16& ray, RayQueryContext* context)68{69AccelN* This = (AccelN*)This_in->ptr;70for (size_t i=0; i<This->accels.size(); i++)71if (!This->accels[i]->isEmpty())72This->accels[i]->intersectors.intersect16(valid,ray,context);73}7475void AccelN::occluded (Accel::Intersectors* This_in, RTCRay& ray, RayQueryContext* context)76{77AccelN* This = (AccelN*)This_in->ptr;78for (size_t i=0; i<This->accels.size(); i++) {79if (This->accels[i]->isEmpty()) continue;80This->accels[i]->intersectors.occluded(ray,context);81if (ray.tfar < 0.0f) break;82}83}8485void AccelN::occluded4 (const void* valid, Accel::Intersectors* This_in, RTCRay4& ray, RayQueryContext* context)86{87AccelN* This = (AccelN*)This_in->ptr;88for (size_t i=0; i<This->accels.size(); i++) {89if (This->accels[i]->isEmpty()) continue;90This->accels[i]->intersectors.occluded4(valid,ray,context);91#if defined(__SSE2__) || defined(__ARM_NEON)92vbool4 valid0 = asBool(((vint4*)valid)[0]);93vbool4 hit0 = ((vfloat4*)ray.tfar)[0] >= vfloat4(zero);94if (unlikely(none(valid0 & hit0))) break;95#endif96}97}9899void AccelN::occluded8 (const void* valid, Accel::Intersectors* This_in, RTCRay8& ray, RayQueryContext* context)100{101AccelN* This = (AccelN*)This_in->ptr;102for (size_t i=0; i<This->accels.size(); i++) {103if (This->accels[i]->isEmpty()) continue;104This->accels[i]->intersectors.occluded8(valid,ray,context);105#if defined(__SSE2__) || defined(__ARM_NEON) // FIXME: use higher ISA106vbool4 valid0 = asBool(((vint4*)valid)[0]);107vbool4 hit0 = ((vfloat4*)ray.tfar)[0] >= vfloat4(zero);108vbool4 valid1 = asBool(((vint4*)valid)[1]);109vbool4 hit1 = ((vfloat4*)ray.tfar)[1] >= vfloat4(zero);110if (unlikely((none((valid0 & hit0) | (valid1 & hit1))))) break;111#endif112}113}114115void AccelN::occluded16 (const void* valid, Accel::Intersectors* This_in, RTCRay16& ray, RayQueryContext* context)116{117AccelN* This = (AccelN*)This_in->ptr;118for (size_t i=0; i<This->accels.size(); i++) {119if (This->accels[i]->isEmpty()) continue;120This->accels[i]->intersectors.occluded16(valid,ray,context);121#if defined(__SSE2__) || defined(__ARM_NEON) // FIXME: use higher ISA122vbool4 valid0 = asBool(((vint4*)valid)[0]);123vbool4 hit0 = ((vfloat4*)ray.tfar)[0] >= vfloat4(zero);124vbool4 valid1 = asBool(((vint4*)valid)[1]);125vbool4 hit1 = ((vfloat4*)ray.tfar)[1] >= vfloat4(zero);126vbool4 valid2 = asBool(((vint4*)valid)[2]);127vbool4 hit2 = ((vfloat4*)ray.tfar)[2] >= vfloat4(zero);128vbool4 valid3 = asBool(((vint4*)valid)[3]);129vbool4 hit3 = ((vfloat4*)ray.tfar)[3] >= vfloat4(zero);130if (unlikely((none((valid0 & hit0) | (valid1 & hit1) | (valid2 & hit2) | (valid3 & hit3))))) break;131#endif132}133}134135void AccelN::accels_print(size_t ident)136{137for (size_t i=0; i<accels.size(); i++)138{139for (size_t j=0; j<ident; j++) std::cout << " ";140std::cout << "accels[" << i << "]" << std::endl;141accels[i]->intersectors.print(ident+2);142}143}144145void AccelN::accels_immutable()146{147for (size_t i=0; i<accels.size(); i++)148accels[i]->immutable();149}150151void AccelN::accels_build ()152{153/* reduce memory consumption */154accels.shrink_to_fit();155156/* build all acceleration structures in parallel */157parallel_for (accels.size(), [&] (size_t i) {158accels[i]->build();159});160161/* create list of non-empty acceleration structures */162bool valid1 = true;163bool valid4 = true;164bool valid8 = true;165bool valid16 = true;166for (size_t i=0; i<accels.size(); i++) {167valid1 &= (bool) accels[i]->intersectors.intersector1;168valid4 &= (bool) accels[i]->intersectors.intersector4;169valid8 &= (bool) accels[i]->intersectors.intersector8;170valid16 &= (bool) accels[i]->intersectors.intersector16;171}172173if (accels.size() == 1) {174type = accels[0]->type; // FIXME: should just assign entire Accel175bounds = accels[0]->bounds;176intersectors = accels[0]->intersectors;177}178else179{180type = AccelData::TY_ACCELN;181intersectors.ptr = this;182intersectors.intersector1 = Intersector1(&intersect,&occluded,&pointQuery,valid1 ? "AccelN::intersector1": nullptr);183intersectors.intersector4 = Intersector4(&intersect4,&occluded4,valid4 ? "AccelN::intersector4" : nullptr);184intersectors.intersector8 = Intersector8(&intersect8,&occluded8,valid8 ? "AccelN::intersector8" : nullptr);185intersectors.intersector16 = Intersector16(&intersect16,&occluded16,valid16 ? "AccelN::intersector16": nullptr);186187/*! calculate bounds */188bounds = empty;189for (size_t i=0; i<accels.size(); i++)190bounds.extend(accels[i]->bounds);191}192}193194void AccelN::accels_select(bool filter)195{196for (size_t i=0; i<accels.size(); i++)197accels[i]->intersectors.select(filter);198}199200void AccelN::accels_deleteGeometry(size_t geomID)201{202for (size_t i=0; i<accels.size(); i++)203accels[i]->deleteGeometry(geomID);204}205206void AccelN::accels_clear()207{208for (size_t i=0; i<accels.size(); i++) {209accels[i]->clear();210}211}212}213214215216