old data

StgSharp.Common/HighPerformance/Memory/HLSFAllocator.Free.cs

@@ -28,6 +28,13 @@
 //     
 // -----------------------------------------------------------------------
 // -----------------------------------------------------------------------
+using System;
+using System.Buffers;
+using System.Collections.Generic;
+using System.Linq;
+using System.Text;
+using System.Threading.Tasks;
+
 using hlsfHandle = StgSharp.HighPerformance.Memory.HybridLayerSegregatedFitAllocationHandle;
 
 namespace StgSharp.HighPerformance.Memory
@@ -47,32 +54,36 @@ namespace StgSharp.HighPerformance.Memory
             if (e == null) {
                 return;
             }
+            AcquireEntrySpinLock(e);
+            try
+            {
+                if (GetEntryState(e) != EntryState.Allocated) {
+                    return;
+                }
+                SetEntryState(e, EntryState.ThreadOccupied);
 
-            if (e->State != EntryState.Allocated) {
-                return;
+                // Step 4: Try merge with adjacent free blocks and remove them from buckets
+                MergeAndRemoveFromBuckets(e);
+
+                // Step 5: Calculate final level and segment for the merged block
+                uint finalSize = e->Size;
+                int finalLevel = GetLevelFromSize(finalSize);
+                int finalSegment = DetermineSegmentIndex(finalSize, finalLevel);
+
+                // Step 6: Set the merged entry state to Empty (ready to be reused)
+                SetEntryState(e, EntryState.Empty);
+
+                // Step 7: Push the merged entry back to appropriate bucket
+                PushLevel(finalLevel, finalSegment, (BucketNode*)e->Position);
+
+                // Note: If mergedEntry is different from original e, the original e
+                // and any merged entries have already been freed to _entries by MergeAndRemoveFromBuckets
+            }
+            finally
+            {
+                // Step 8: Always release the spin lock
+                ReleaseEntrySpinLock(e);
             }
-
-
-            // Set to ThreadOccupied to prevent other operations
-            e->State = EntryState.Empty;
-
-
-            // Try merge with adjacent free blocks and remove them from buckets
-            MergeAndRemoveFromBuckets(e);
-
-
-            // Calculate final level and segment for the merged block
-            uint finalSize = e->Size;
-            int finalLevel = GetLevelFromSize(finalSize);
-            int finalSegment = DetermineSegmentIndex(finalSize, finalLevel);
-
-
-            // Set the merged entry state to Empty (ready to be reused)
-            e->State = EntryState.Empty;
-
-
-            // Push the merged entry back to appropriate bucket
-            PushLevel(finalLevel, finalSegment, (BucketNode*)e->Position);
         }
 
     }