Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
godotengine
GitHub Repository: godotengine/godot
 Path: blob/master/thirdparty/embree/kernels/geometry/curve_intersector.h
9905 views
1
// Copyright 2009-2021 Intel Corporation

2
// SPDX-License-Identifier: Apache-2.0

3


4
#pragma once

5


6
#include "primitive.h"

7
#include "../subdiv/bezier_curve.h"

8
#include "../common/primref.h"

9
#include "bezier_hair_intersector.h"

10
#include "bezier_ribbon_intersector.h"

11
#include "bezier_curve_intersector.h"

12
#include "oriented_curve_intersector.h"

13
#include "../bvh/node_intersector1.h"

14


15
// FIXME: this file seems replicate of curve_intersector_virtual.h

16


17
namespace embree

18
{

19
  namespace isa

20
  {

21
    struct VirtualCurveIntersector1

22
    {

23
      typedef unsigned char Primitive;

24
      typedef CurvePrecalculations1 Precalculations;

25
      

26
      template<int N, bool robust>

27
        static __forceinline void intersect(const Accel::Intersectors* This, Precalculations& pre, RayHit& ray, RayQueryContext* context, const Primitive* prim, size_t num, const TravRay<N,robust> &tray, size_t& lazy_node)

28
      {

29
        assert(num == 1);

30
        RTCGeometryType ty = (RTCGeometryType)(*prim);

31
        assert(This->leafIntersector);

32
        VirtualCurvePrimitive::Intersectors& leafIntersector = ((VirtualCurvePrimitive*) This->leafIntersector)->vtbl[ty];

33
        leafIntersector.intersect<1>(&pre,&ray,context,prim);

34
      }

35
      

36
      template<int N, bool robust>        

37
        static __forceinline bool occluded(const Accel::Intersectors* This, Precalculations& pre, Ray& ray, RayQueryContext* context, const Primitive* prim, size_t num, const TravRay<N,robust> &tray, size_t& lazy_node)

38
      {

39
        assert(num == 1);

40
        RTCGeometryType ty = (RTCGeometryType)(*prim);

41
        assert(This->leafIntersector);

42
        VirtualCurvePrimitive::Intersectors& leafIntersector = ((VirtualCurvePrimitive*) This->leafIntersector)->vtbl[ty];

43
        return leafIntersector.occluded<1>(&pre,&ray,context,prim);

44
      }

45
    };

46


47
    template<int K>

48
      struct VirtualCurveIntersectorK 

49
      {

50
        typedef unsigned char Primitive;

51
        typedef CurvePrecalculationsK<K> Precalculations;

52
        

53
        static __forceinline void intersect(const vbool<K>& valid_i, const Accel::Intersectors* This, Precalculations& pre, RayHitK<K>& ray, RayQueryContext* context, const Primitive* prim, size_t num, size_t& lazy_node)

54
        {

55
          assert(num == 1);

56
          RTCGeometryType ty = (RTCGeometryType)(*prim);

57
          assert(This->leafIntersector);

58
          VirtualCurvePrimitive::Intersectors& leafIntersector = ((VirtualCurvePrimitive*) This->leafIntersector)->vtbl[ty];

59
          size_t mask = movemask(valid_i);

60
          while (mask) leafIntersector.intersect<K>(&pre,&ray,bscf(mask),context,prim);

61
        }

62
        

63
        static __forceinline vbool<K> occluded(const vbool<K>& valid_i, const Accel::Intersectors* This, Precalculations& pre, RayK<K>& ray, RayQueryContext* context, const Primitive* prim, size_t num, size_t& lazy_node)

64
        {

65
          assert(num == 1);

66
          RTCGeometryType ty = (RTCGeometryType)(*prim);

67
          assert(This->leafIntersector);

68
          VirtualCurvePrimitive::Intersectors& leafIntersector = ((VirtualCurvePrimitive*) This->leafIntersector)->vtbl[ty];

69
          vbool<K> valid_o = false;

70
          size_t mask = movemask(valid_i);

71
          while (mask) {

72
            size_t k = bscf(mask);

73
            if (leafIntersector.occluded<K>(&pre,&ray,k,context,prim))

74
              set(valid_o, k);

75
          }

76
          return valid_o;

77
        }

78
        

79
        static __forceinline void intersect(const Accel::Intersectors* This, Precalculations& pre, RayHitK<K>& ray, size_t k, RayQueryContext* context, const Primitive* prim, size_t num, size_t& lazy_node)

80
        {

81
          assert(num == 1);

82
          RTCGeometryType ty = (RTCGeometryType)(*prim);

83
          assert(This->leafIntersector);

84
          VirtualCurvePrimitive::Intersectors& leafIntersector = ((VirtualCurvePrimitive*) This->leafIntersector)->vtbl[ty];

85
          leafIntersector.intersect<K>(&pre,&ray,k,context,prim);

86
        }

87
        

88
        static __forceinline bool occluded(const Accel::Intersectors* This, Precalculations& pre, RayK<K>& ray, size_t k, RayQueryContext* context, const Primitive* prim, size_t num, size_t& lazy_node)

89
        {

90
          assert(num == 1);

91
          RTCGeometryType ty = (RTCGeometryType)(*prim);

92
          assert(This->leafIntersector);

93
          VirtualCurvePrimitive::Intersectors& leafIntersector = ((VirtualCurvePrimitive*) This->leafIntersector)->vtbl[ty];

94
          return leafIntersector.occluded<K>(&pre,&ray,k,context,prim);

95
        }

96
      };

97
  }

98
}

99


100