Changeset 2800 for GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.h

Timestamp:

06/27/08 01:43:45 (16 years ago)

Author:

mattausch

Message:

friendly culling debug version with timers, no materials

File:

• GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.h (modified) (10 diffs)

GTP/trunk/App/Demos/Vis/FriendlyCulling/src/Bvh.h

@@ -52 +52 @@
                 /// if the node is newly processed with no prior history available
                 bool mIsNew;
+                /// the frame this node was last queried
+                int mLastQueriedFrame;
         };
 
@@ -113 +115 @@
         inline void SetTurnedVisibleFrame(int turnedVisibleFrame);
 
-        inline int GetLastTestedFrame();
-        inline void SetLastTestedFrame(int lastTested);
+        inline int GetLastQueriedFrame() const;
+        inline void SetLastQueriedFrame(int lastTested);
         
         inline bool IsViewFrustumCulled() const;
@@ -155 +157 @@
         /////////////
         
-        /// some flags
-        //int mFlags;
         /// the depth of this node
         unsigned char mDepth;
@@ -217 +217 @@
 
 
+
 /////////////////
 //-- public inline functions
 
+
 int BvhNode::GetLastVisitedFrame() const 
 { 
@@ -268 +270 @@
 
 
-void BvhNode::SetViewFrustumCulled(const bool frustumCulled) 
+void BvhNode::SetViewFrustumCulled(bool frustumCulled) 
 { 
         mVisibility.mIsFrustumCulled = frustumCulled; 
@@ -280 +282 @@
 
 
-void BvhNode::SetIsNew(const bool isNew) 
+void BvhNode::SetIsNew(bool isNew) 
 { 
         mVisibility.mIsNew = isNew; 
@@ -320 +322 @@
         return mVisibility.mAssumedVisibleFrameId;
 }
+
+
+int BvhNode::GetLastQueriedFrame() const
+{
+        return mVisibility.mLastQueriedFrame;
+}
+
+
+void BvhNode::SetLastQueriedFrame(int lastTested)
+{
+        mVisibility.mLastQueriedFrame = lastTested;
+}
+
 
 
@@ -429 +444 @@
         */
         inline int GetNumLeaves() const { return mNumNodes / 2 + 1;}
+        /** Returns number of 'virtual' nodes in the hierarchy, i.e.
+                the number of nodes actually used for traversal.
+        */
+        int GetNumVirtualNodes() const  { return mNumVirtualNodes; }
+        /** Returns number of bvh leaves.
+        */
+        inline int GetNumVirtualLeaves() const { return mNumVirtualNodes / 2 + 1;}
         /** Returns root node of the bvh.
         */
@@ -512 +534 @@
         */
         void SetVirtualLeaves(int numTriangles);
-
+        
 
         ////////
@@ -526 +548 @@
         void SetAreaRatioThresholdForTestingChildren(float ratio);
 
+
+        ////////////////////////////
+
         /** Returns stats.
         */
         const BvhStats &GetBvhStats() const { return mBvhStats; }
-        /** Returns number of 'virtual' nodes in the hierarchy, i.e.
-                the number of nodes actually used for traversal.
-        */
-        int GetNumVirtualNodes() const  { return mNumVirtualNodes; }
         /** Render wireframe bvh for visualization purpose.
         */