From f49f9eb558d341ac581831c0dd576b643f5b8e26 Mon Sep 17 00:00:00 2001
From: ikpil <ikpil@naver.com>
Date: Mon, 22 Apr 2024 23:57:13 +0900
Subject: [PATCH] addedd AllocSpan/FreeSpan API

---
 src/DotRecast.Recast/RcHeightfield.cs    |  4 ++
 src/DotRecast.Recast/RcRasterizations.cs | 57 ++++++++++++++++++++++++
 2 files changed, 61 insertions(+)

diff --git a/src/DotRecast.Recast/RcHeightfield.cs b/src/DotRecast.Recast/RcHeightfield.cs
index b46cc99..b5eaba9 100644
--- a/src/DotRecast.Recast/RcHeightfield.cs
+++ b/src/DotRecast.Recast/RcHeightfield.cs
@@ -34,6 +34,10 @@ namespace DotRecast.Recast
         public readonly float ch; //< The height of each cell. (The minimum increment along the y-axis.)
         public readonly RcSpan[] spans; //< Heightfield of spans (width*height).
 
+        // memory pool for rcSpan instances.
+        public RcSpanPool pools; //< Linked list of span pools.
+        public RcSpan freelist; //< The next free span.
+
         /** Border size in cell units */
         public readonly int borderSize;
 
diff --git a/src/DotRecast.Recast/RcRasterizations.cs b/src/DotRecast.Recast/RcRasterizations.cs
index 9b1f638..d1cf465 100644
--- a/src/DotRecast.Recast/RcRasterizations.cs
+++ b/src/DotRecast.Recast/RcRasterizations.cs
@@ -41,6 +41,63 @@ namespace DotRecast.Recast
                 aMin.Y <= bMax.Y && aMax.Y >= bMin.Y &&
                 aMin.Z <= bMax.Z && aMax.Z >= bMin.Z;
         }
+        
+        /// Allocates a new span in the heightfield.
+        /// Use a memory pool and free list to minimize actual allocations.
+        /// 
+        /// @param[in]	heightfield		The heightfield
+        /// @returns A pointer to the allocated or re-used span memory. 
+        private static RcSpan AllocSpan(RcHeightfield heightfield)
+        {
+            // If necessary, allocate new page and update the freelist.
+            if (heightfield.freelist == null || heightfield.freelist.next == null)
+            {
+                // Create new page.
+                // Allocate memory for the new pool.
+                RcSpanPool spanPool = new RcSpanPool();
+                if (spanPool == null)
+                {
+                    return null;
+                }
+
+                // Add the pool into the list of pools.
+                spanPool.next = heightfield.pools;
+                heightfield.pools = spanPool;
+
+                // Add new spans to the free list.
+                RcSpan freeList = heightfield.freelist;
+                int head = 0;
+                int it = RC_SPANS_PER_POOL;
+                do
+                {
+                    --it;
+                    spanPool.items[it].next = freeList;
+                    freeList = spanPool.items[it];
+                } while (it != head);
+
+                heightfield.freelist = spanPool.items[it];
+            }
+
+            // Pop item from the front of the free list.
+            RcSpan newSpan = heightfield.freelist;
+            heightfield.freelist = heightfield.freelist.next;
+            return newSpan;
+        }
+
+        /// Releases the memory used by the span back to the heightfield, so it can be re-used for new spans.
+        /// @param[in]	heightfield		The heightfield.
+        /// @param[in]	span	A pointer to the span to free
+        private static void FreeSpan(RcHeightfield heightfield, RcSpan span)
+        {
+            if (span == null)
+            {
+                return;
+            }
+
+            // Add the span to the front of the free list.
+            span.next = heightfield.freelist;
+            heightfield.freelist = span;
+        }
 
 
         /// Adds a span to the heightfield.  If the new span overlaps existing spans,