//-----------------------------------------------------------------------
// -----------------------------------------------------------------------
// file="MatrixParallelWrap"
// Project: StgSharp
// AuthorGroup: Nitload
// Copyright (c) Nitload. 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 StgSharp.HighPerformance;
using System;
using System.Collections.Generic;
using System.Diagnostics.CodeAnalysis;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Text;
using System.Threading.Tasks;

namespace StgSharp.Mathematics.Numeric
{
    public unsafe class MatrixParallelWrap
    {

        private readonly MatrixParallelThread[] _threads;
        private int _begin;

        internal MatrixParallelWrap(MatrixParallelThread[] threads, int begin, int count)
        {
            WrapTaskCapacity = count;
            _threads = threads;
            _begin = begin;
            _threads[_begin].Role = 1;
            for (int i = _begin; i < _begin + WrapTaskCapacity; i++) {
                _threads[i].BindedWrap = this;
            }
        }

        public MatrixParallelWrap()
        {
            _threads = new MatrixParallelThread[5];
        }

        public static SleepMode AfterWork
        {
            get;
            set => Interlocked.Exchange(ref Unsafe.As<SleepMode, int>(ref field), (int)value);
        }

        internal int Magic { get; set; }

        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public void SetAllWorker()
        {
            for (int i = _begin; i < _begin + WrapTaskCapacity; i++)
            {
                if (_threads[i].Role != 3) {
                    _threads[i].Restart();
                }
            }
        }

        internal void PublishTaskToWorkers(Queue<IntPtr> tasks)
        {
            while (tasks.TryDequeue(out nint handle))
            {
                MatrixParallelTaskPackage* task = (MatrixParallelTaskPackage*)handle;
                switch (task->ComputeMode.OperationStyle)
                {
                    case MatrixOperationStyle.PANEL_OP:
                        break;
                    case MatrixOperationStyle.BUFFER_OP:
                        PublishBufferTaskToWorkers(task);
                        break;
                    case MatrixOperationStyle.KERNEL_OP:
                        PublishBufferTaskToWorkers(task);
                        break;
                    default:
                        break;
                }
            }
        }

        internal void SetScheduler()
        {
            MatrixParallelThread thread = _threads[_begin];
            thread.Restart();
        }

        private void PublishBufferTaskToWorkers(MatrixParallelTaskPackage* package)
        {
            long count = Unsafe.As<int, long>(ref package->PrimCount);
            long recommendCount = count / 1024;
            MatrixParallelThread[] pool = _threads;
            if (pool.Length == 1)
            {
                pool[0].Tasks.Enqueue((nint)package);
                return;
            }
            long actual = count / pool.Length;
            long extra = count % pool.Length;

            long offset = 0;
            MatrixParallelTaskPackage* current = package;
            foreach (MatrixParallelThread thread in pool)
            {
                long wrapTaskLength = actual;
                long ex = extra > 0 ? 1 : 0;
                extra -= ex;
                ref long offsetRef = ref Unsafe.As<int, long>(ref current->PrimTileOffset);
                offsetRef += offset;
                ref long lengthRef = ref Unsafe.As<int, long>(ref current->PrimCount);
                lengthRef = wrapTaskLength + ex;
                pool[0].Tasks.Enqueue((nint)current);
                current = MatrixParallelFactory.FromExistPackage(current);
                offset += wrapTaskLength;
            }
        }

        private void PublishKernelTaskToWorkers(MatrixParallelTaskPackage* package)
        {
            int primCount = package->PrimCount;
            int secCount = package->SecCount;
            MatrixParallelThread[] pool = _threads;

            if (pool.Length == 1)
            {
                pool[0].Tasks.Enqueue((nint)package);
                return;
            }
            throw new NotImplementedException();
            /*
            int threadCount = pool.Length;
            int tilePerThreadLess = tileCount / threadCount;                           // tiles per thread without extra slice
            int columnAfterBaseTile = tileCount % threadCount * tileWidth;             // tile sliced into columns
            int extraColumnPerThread = columnAfterBaseTile / threadCount;
            int extraColumnCount = columnAfterBaseTile % threadCount;                  // columns to be sliced

            int total = primCount;
            Stack<MatrixParallelWrap> taskBunch = new Stack<MatrixParallelWrap>(threadCount);
            MatrixParallelTaskPackageNonGeneric* current = package;
            foreach (MatrixParallelWrap wrap in pool.Wraps)
            {
                bool hasSlice = columnAfterBaseTile > 0;
                bool isLargeSlice = extraColumnCount > 0;

                // _count tiles for wrap
                int wrapWidth = wrap!.WrapTaskCapacity;
                int columnFromSlicingCount = (hasSlice ? extraColumnPerThread : 0) * wrapWidth;
                int baseColumn = wrapWidth * tilePerThreadLess * tileWidth;
                int columnInWrap = baseColumn + columnFromSlicingCount + (isLargeSlice ? 1 : 0);

                // set tasks
                if (columnInWrap == 0)
                {
#if DEBUG
                    throw new InvalidOperationException("Zero tasks published.");
#else
                    break;
#endif
                }

                // update current task
                current->PrimColumnCountInTile = columnInWrap;
                current->SecColumnCountInTile = current->SecCount;
                current->SecTileOffset = 0;

                // remove tiles _count
                extraColumnCount--;
                columnAfterBaseTile -= columnFromSlicingCount;
                total -= columnInWrap;

                // set to wrap and push
                wrap.WrapTask = current;

                if (total <= 0)
                {
                    break;
                }
                current = MatrixParallelFactory.FromExistPackage(current);
                current->PrimTileOffset += columnInWrap;
            }
            /**/
            return;
        }

        public class Handle(int inWrapIndex, MatrixParallelWrap wrap)
        {

            public int InWrapIndex { get; } = inWrapIndex;

            /// <summary>
            ///   Role of the thread in the wrap. 1 is Scheduler, 0 are Workers. 2 is leader, beyond
            ///   wrap's control.
            /// </summary>
            public int Role { get; internal set; }

            public Queue<IntPtr> TaskCache { get; } = [];

            internal ManualResetEventSlim ResetEvent { get; } = new(false);

            internal MatrixParallelWrap Wrap { get; } = wrap;

        }

        #region wrap task

        internal unsafe Queue<nint> WrapTask { get; set; } = [];

        internal int WrapTaskSliceCount { get; set; }

        internal int WrapTaskCapacity { get ; init; }

        #endregion
    }

    public enum SleepMode : int
    {

        QuickWakeup = ThreadPriority.AboveNormal,
        NormalSleep = ThreadPriority.BelowNormal,
        DeepSleep = ThreadPriority.Lowest,

    }
}