Reduce BIH node size by 32 bytes

diff --git a/bih.h b/bih.h
index 4be1564fda8bcb7f5f34c368e7872439bd0dc335..90e361ff03ea2e8747b4b78b814e038568ad2459 100644 (file)
--- a/bih.h
+++ b/bih.h
@@ -39,14 +39,18 @@ typedef struct bih_node_s
        // TODO: move bounds data to parent node and remove it from leafs?
        float mins[3];
        float maxs[3];
-       // node indexes of children (always > this node's index)
-       int front;
-       int back;
-       // interval of children
-       float frontmin; // children[0]
-       float backmax; // children[1]
-       // BIH_UNORDERED uses this for a list of leafindex (all >= 0), -1 = end of list
-       int children[BIH_MAXUNORDEREDCHILDREN];
+       union {
+               struct{
+                       // node indexes of children (always > this node's index)
+                       int front;
+                       int back;
+                       // interval of children
+                       float frontmin; // children[0]
+                       float backmax; // children[1]
+               };
+               // BIH_UNORDERED uses this for a list of leafindex (all >= 0), -1 = end of list
+               int children[BIH_MAXUNORDEREDCHILDREN];
+       };
 }
 bih_node_t;