//-----------------------------------------------------------------------
// -----------------------------------------------------------------------
// file="HLSFAllocator.Debug.cs"
// Project: StgSharp
// AuthorGroup: Nitload Space
// Copyright (c) Nitload Space. All rights reserved.
//     
// Permission is hereby granted, free of charge, to any person 
// obtaining a copy of this software and associated documentation 
// files (the “Software”), to deal in the Software without restriction, 
// including without limitation the rights to use, copy, modify, merge,
// publish, distribute, sublicense, and/or sell copies of the Software, 
// and to permit persons to whom the Software is furnished to do so, 
// subject to the following conditions:
//     
// The above copyright notice and 
// this permission notice shall be included in all copies 
// or substantial portions of the Software.
//     
// THE SOFTWARE IS PROVIDED “AS IS”, 
// WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, 
// INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, 
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 
// IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, 
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, 
// ARISING FROM, OUT OF OR IN CONNECTION WITH 
// THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//     
// -----------------------------------------------------------------------
// -----------------------------------------------------------------------
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace StgSharp.HighPerformance.Memory
{
    public unsafe partial class HybridLayerSegregatedFitAllocator
    {

        private object _lock = new object();

        public void DisplayAllocatedEntryLayout(bool singleStep)
        {
            lock (_lock)
            {
                Entry* cur = _spareMemory;
                while (cur != null)
                {
                    if (cur->State == EntryState.Allocated)
                    {
                        Console.WriteLine(EntryToString(cur));
                        if (singleStep) {
                            Console.ReadKey();
                        }
                    }
                    cur = (Entry*)cur->PreviousNear;
                }
            }
        }

        public void DisplayEmptyEntryLayout(bool singleStep)
        {
            lock (_lock)
            {
                Entry* cur = _spareMemory;
                while (cur != null)
                {
                    if (cur->State == EntryState.Empty)
                    {
                        Console.WriteLine(EntryToString(cur));
                        if (singleStep) {
                            Console.ReadKey();
                        }
                    }
                    cur = (Entry*)cur->PreviousNear;
                }
            }
        }

        public void DisplayEntryLayout(bool singleStep)
        {
            lock (_lock)
            {
                Entry* cur = _spareMemory;
                while (cur != null)
                {
                    Console.WriteLine(EntryToString(cur));
                    cur = (Entry*)cur->PreviousNear;
                    if (singleStep) {
                        Console.ReadKey();
                    }
                }
            }
        }

        public IEnumerable<string> ShowEntryLayout()
        {
            lock (_lock)
            {
                Stack<string> layout = [];
                Entry* cur = _spareMemory;
                while (cur != null)
                {
                    layout.Push(EntryToString(cur));
                    cur = (Entry*)cur->PreviousNear;
                }
                return layout;
            }
        }

        private static string EntryToString(Entry* e)
        {
            BucketNode* b = (BucketNode*)e->Position;
            return $"{e->PreviousNear}<-- Position{(ulong)e} Bucket:{{{e->Position},{e->Level},{e->Size}}} -->{e->NextNear}";
        }

    }
}