/***************************************************************************
 *
 * This file is provided under a dual BSD/GPLv2 license.  When using or
 *   redistributing this file, you may do so under either license.
 * 
 *   GPL LICENSE SUMMARY
 * 
 *   Copyright(c) 2007-2022 Intel Corporation. All rights reserved.
 * 
 *   This program is free software; you can redistribute it and/or modify
 *   it under the terms of version 2 of the GNU General Public License as
 *   published by the Free Software Foundation.
 * 
 *   This program is distributed in the hope that it will be useful, but
 *   WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *   General Public License for more details.
 * 
 *   You should have received a copy of the GNU General Public License
 *   along with this program; if not, write to the Free Software
 *   Foundation, Inc., 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
 *   The full GNU General Public License is included in this distribution
 *   in the file called LICENSE.GPL.
 * 
 *   Contact Information:
 *   Intel Corporation
 * 
 *   BSD LICENSE
 * 
 *   Copyright(c) 2007-2022 Intel Corporation. All rights reserved.
 *   All rights reserved.
 * 
 *   Redistribution and use in source and binary forms, with or without
 *   modification, are permitted provided that the following conditions
 *   are met:
 * 
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in
 *       the documentation and/or other materials provided with the
 *       distribution.
 *     * Neither the name of Intel Corporation nor the names of its
 *       contributors may be used to endorse or promote products derived
 *       from this software without specific prior written permission.
 * 
 *   THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *   "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *   LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 *   A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 *   OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 *   SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 *   LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 *   DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 *   THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 *   (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 *   OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 * 
 * 
 *
 ***************************************************************************/

/**
 ***************************************************************************
 * @file lac_mem_pools.c
 *
 * @ingroup LacMemPool
 *
 * Memory Pool creation and mgmt function implementations
 *
 ***************************************************************************/

#include "cpa.h"
#include "icp_accel_devices.h"
#include "icp_adf_init.h"
#include "icp_adf_transport.h"
#include "icp_adf_debug.h"
#include "lac_log.h"
#include "lac_lock_free_stack.h"
#include "lac_mem_pools.h"
#include "lac_mem.h"
#include "lac_common.h"
#include "cpa_dc.h"
#include "dc_session.h"
#include "dc_datapath.h"
#include "icp_qat_fw_comp.h"
#include "icp_buffer_desc.h"
#include "Osal.h"
#ifndef ICP_DC_ONLY
#include "lac_pke_qat_comms.h"
#include "lac_sym.h"
#endif

#ifdef KERNEL_SPACE
#define ASYM_NOT_SUPPORTED
#endif

#define LAC_MEM_POOLS_NUM_SUPPORTED 32000
/**< @ingroup LacMemPool
 * Number of mem pools supported */

static lac_mem_pool_hdr_t *lac_mem_pools[LAC_MEM_POOLS_NUM_SUPPORTED] = {NULL};
/**< @ingroup LacMemPool
 * Array of pointers to the mem pool header structure
 */

LAC_DECLARE_HIGHEST_BIT_OF(lac_mem_blk_t);
/**< @ingroup LacMemPool
 * local constant for quickening computation of additional space allocated
 * for holding lac_mem_blk_t container-structure
 */

/**
 *******************************************************************************
 * @ingroup LacMemPool
 * This function cleans up a mem pool.
 ******************************************************************************/
void Lac_MemPoolCleanUpInternal(lac_mem_pool_hdr_t *pPoolID);

static inline Cpa32U Lac_MemPoolGetElementRealSize(Cpa32U blkSizeInBytes,
                                                   Cpa32U blkAlignmentInBytes)
{
    Cpa32U addSize = (blkAlignmentInBytes >= sizeof(lac_mem_blk_t)
                          ? blkAlignmentInBytes
                          : 1 << (highest_bit_of_lac_mem_blk_t + 1));
    return blkSizeInBytes + addSize;
}

CpaBoolean Lac_MemPoolTestAndGet(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;
    return osalAtomicDecAndTest(&(pPoolID->sync));
}

CpaStatus Lac_MemPoolCreate(
    lac_memory_pool_id_t *pPoolID,
    char *poolName,
    unsigned int numElementsInPool,   /*Number of elements*/
    unsigned int blkSizeInBytes,      /*Block Size in bytes*/
    unsigned int blkAlignmentInBytes, /*Block alignment (bytes)*/
    CpaBoolean trackMemory,
    Cpa32U node)
{
    unsigned int poolSearch = 0;
    unsigned int counter = 0;
    lac_mem_blk_t *pMemBlkCurrent = NULL;

    void *pMemBlk = NULL;

    if (pPoolID == NULL)
    {
        LAC_LOG_ERROR("Invalid Pool ID param");
        return CPA_STATUS_INVALID_PARAM; /*Error*/
    }

    /* Find First available Pool return error otherwise */
    while (lac_mem_pools[poolSearch] != NULL)
    {
        poolSearch++;
        if (LAC_MEM_POOLS_NUM_SUPPORTED == poolSearch)
        {
            LAC_LOG_ERROR("No more memory pools available for allocation");
            return CPA_STATUS_FAIL;
        }
    }

    /* Allocate a Pool header */
    if (CPA_STATUS_SUCCESS !=
        LAC_OS_MALLOC(&lac_mem_pools[poolSearch], sizeof(lac_mem_pool_hdr_t)))
    {
        LAC_LOG_ERROR("Unable to allocate memory for creation of the pool");
        return CPA_STATUS_RESOURCE; /*Error*/
    }
    osalMemSet(lac_mem_pools[poolSearch], 0, sizeof(lac_mem_pool_hdr_t));

    /* Copy in Pool Name */
    if (poolName != NULL)
    {
        snprintf(lac_mem_pools[poolSearch]->poolName,
                 LAC_MEM_POOLS_NAME_SIZE,
                 "%s",
                 poolName);
    }
    else
    {
        LAC_OS_FREE(lac_mem_pools[poolSearch]);
        lac_mem_pools[poolSearch] = NULL;
        LAC_LOG_ERROR("Invalid Pool Name pointer");
        return CPA_STATUS_INVALID_PARAM; /*Error*/
    }

    /* Allocate table for tracking memory blocks */
    if (CPA_TRUE == trackMemory)
    {
        if (CPA_STATUS_SUCCESS !=
            LAC_OS_MALLOC(&(lac_mem_pools[poolSearch]->trackBlks),
                          (sizeof(lac_mem_blk_t *) * numElementsInPool)))
        {
            LAC_OS_FREE(lac_mem_pools[poolSearch]);
            lac_mem_pools[poolSearch] = NULL;
            LAC_LOG_ERROR(
                "Unable to allocate memory for tracking memory blocks");
            return CPA_STATUS_RESOURCE; /*Error*/
        }
    }
    else
    {
        lac_mem_pools[poolSearch]->trackBlks = NULL;
    }

    lac_mem_pools[poolSearch]->availBlks = 0;
    lac_mem_pools[poolSearch]->stack = _init_stack();

    /* Calculate alignment needed for allocation   */
    for (counter = 0; counter < numElementsInPool; counter++)
    {
        CpaPhysicalAddr physAddr = 0;
        /* realSize is computed for allocation of  blkSize bytes + additional
           capacity for lac_mem_blk_t structure storage due to the some OSes
           (BSD) limitations for memory alignment to be power of 2;
           sizeof(lac_mem_blk_t) is being round up to the closest power of 2 -
           optimised towards the least CPU overhead but at additional memory
           cost
         */
        Cpa32U realSize =
            Lac_MemPoolGetElementRealSize(blkSizeInBytes, blkAlignmentInBytes);
        Cpa32U addSize = realSize - blkSizeInBytes;

        if (CPA_STATUS_SUCCESS !=
            LAC_OS_CAMALLOC(&pMemBlk, realSize, blkAlignmentInBytes, node))
        {
            Lac_MemPoolCleanUpInternal(lac_mem_pools[poolSearch]);
            lac_mem_pools[poolSearch] = NULL;
            LAC_LOG_ERROR("Unable to allocate contiguous chunk of memory");
            return CPA_STATUS_RESOURCE;
        }

        /* Calcaulate various offsets */
        physAddr = LAC_OS_VIRT_TO_PHYS_INTERNAL(
            (void *)((LAC_ARCH_UINT)pMemBlk + addSize));

        /* physAddr is now already aligned to the greater power of 2:
            blkAlignmentInBytes or sizeof(lac_mem_blk_t) round up
            We safely put the structure right before the blkSize
            real data block
         */
        pMemBlkCurrent = (lac_mem_blk_t *)(((LAC_ARCH_UINT)(pMemBlk)) +
                                           addSize - sizeof(lac_mem_blk_t));

        pMemBlkCurrent->physDataPtr = physAddr;
        pMemBlkCurrent->pMemAllocPtr = pMemBlk;
        pMemBlkCurrent->pPoolID = lac_mem_pools[poolSearch];
        pMemBlkCurrent->isInUse = CPA_FALSE;
        pMemBlkCurrent->pNext = NULL;

        push(&lac_mem_pools[poolSearch]->stack, pMemBlkCurrent);

        /* Store allocated memory pointer */
        if (lac_mem_pools[poolSearch]->trackBlks != NULL)
        {
            (lac_mem_pools[poolSearch]->trackBlks[counter]) =
                (lac_mem_blk_t *)pMemBlkCurrent;
        }
        __sync_add_and_fetch(&lac_mem_pools[poolSearch]->availBlks, 1);
        (lac_mem_pools[poolSearch])->numElementsInPool = counter + 1;
    }

    /* Set Pool details in the header */
    (lac_mem_pools[poolSearch])->blkSizeInBytes = blkSizeInBytes;
    (lac_mem_pools[poolSearch])->blkAlignmentInBytes = blkAlignmentInBytes;
    (lac_mem_pools[poolSearch])->active = CPA_TRUE;
    osalAtomicSet(1, (OsalAtomic *)&((lac_mem_pools[poolSearch])->sync));
    /* Set the Pool ID output parameter */
    *pPoolID = (LAC_ARCH_UINT)(lac_mem_pools[poolSearch]);
    /* Success */
    return CPA_STATUS_SUCCESS;
}

void Lac_MemPoolEnable(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;

    if (NULL == pPoolID)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return;
    }

    pPoolID->active = CPA_TRUE;
    osalAtomicSet(1, (OsalAtomic *)&(pPoolID->sync));
    return;
}

void Lac_MemPoolDisable(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;

    if (NULL == pPoolID)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return;
    }

    pPoolID->active = CPA_FALSE;
    return;
}

void *Lac_MemPoolEntryAlloc(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;
    lac_mem_blk_t *pMemBlkCurrent = NULL;

#ifdef ICP_DEBUG
    /* Explicitly removing NULL PoolID check for speed */
    if (pPoolID == NULL)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return NULL;
    }
#endif /* ICP_DEBUG */

    if (unlikely(pPoolID->active == CPA_FALSE))
        return NULL;

    /* Remove block from pool */
    pMemBlkCurrent = pop(&pPoolID->stack);
    if (NULL == pMemBlkCurrent)
    {
        return (void *)CPA_STATUS_RETRY;
    }
    __sync_sub_and_fetch(&pPoolID->availBlks, 1);
    pMemBlkCurrent->isInUse = CPA_TRUE;
    return (void *)((LAC_ARCH_UINT)(pMemBlkCurrent) + sizeof(lac_mem_blk_t));
}

void Lac_MemPoolEntryFree(void *pEntry)
{
    lac_mem_blk_t *pMemBlk = NULL;

#ifdef ICP_DEBUG
    /* Explicitly NULL pointer check */
    if (pEntry == NULL)
    {
        LAC_LOG_ERROR("Memory Handle NULL");
        return;
    }
#endif /*ICP_DEBUG*/

    pMemBlk = (lac_mem_blk_t *)((LAC_ARCH_UINT)pEntry - sizeof(lac_mem_blk_t));
    pMemBlk->isInUse = CPA_FALSE;

    push(&pMemBlk->pPoolID->stack, pMemBlk);
    __sync_add_and_fetch(&pMemBlk->pPoolID->availBlks, 1);
}

void Lac_MemPoolDestroy(lac_memory_pool_id_t poolID)
{
    unsigned int poolSearch = 0;
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;

    if (pPoolID != NULL)
    {
        /*Remove entry from table*/
        while (lac_mem_pools[poolSearch] != pPoolID)
        {
            poolSearch++;

            if (LAC_MEM_POOLS_NUM_SUPPORTED == poolSearch)
            {
                LAC_LOG_ERROR("Invalid Pool ID submitted");
                return;
            }
        }

        lac_mem_pools[poolSearch] = NULL; /*Remove handle from pool*/

        Lac_MemPoolCleanUpInternal(pPoolID);
    }
}

void Lac_MemPoolCleanUpInternal(lac_mem_pool_hdr_t *pPoolID)
{
    lac_mem_blk_t *pCurrentBlk = NULL;
    void *pFreePtr = NULL;
    Cpa32U count = 0;

    if (pPoolID->trackBlks == NULL)
    {
        pCurrentBlk = pop(&pPoolID->stack);

        while (pCurrentBlk != NULL)
        {
            /* Free Data Blocks */
            pFreePtr = pCurrentBlk->pMemAllocPtr;
            pCurrentBlk = pop(&pPoolID->stack);
            LAC_OS_CAFREE(pFreePtr);
        }
    }
    else
    {
        for (count = 0; count < pPoolID->numElementsInPool; count++)
        {
            pFreePtr = (pPoolID->trackBlks[count])->pMemAllocPtr;
            LAC_OS_CAFREE(pFreePtr);
        }
        LAC_OS_FREE(pPoolID->trackBlks);
    }
    LAC_OS_FREE(pPoolID);
}

unsigned int Lac_MemPoolAvailableEntries(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;
    if (pPoolID == NULL)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return 0;
    }
    return pPoolID->availBlks;
}

void Lac_MemPoolStatsShow(void)
{
    unsigned int index = 0;
    osalLog(OSAL_LOG_LVL_USER,
            OSAL_LOG_DEV_STDOUT,
            SEPARATOR BORDER "           Memory Pools Stats\n" SEPARATOR);

    while (index < LAC_MEM_POOLS_NUM_SUPPORTED)
    {
        if (lac_mem_pools[index] != NULL)
        {
            osalLog(OSAL_LOG_LVL_USER,
                    OSAL_LOG_DEV_STDOUT,
                    BORDER " Pool Name:             %s \n" BORDER
                           " Active status:         %10s \n" BORDER
                           " No. Elements in Pool:  %10u \n" BORDER
                           " Element Size in Bytes: %10u \n" BORDER
                           " Alignment in Bytes:    %10u \n" BORDER
                           " No. Available Blocks:  %10zu \n" SEPARATOR,
                    lac_mem_pools[index]->poolName,
                    lac_mem_pools[index]->active ? "TRUE" : "FALSE",
                    lac_mem_pools[index]->numElementsInPool,
                    lac_mem_pools[index]->blkSizeInBytes,
                    lac_mem_pools[index]->blkAlignmentInBytes,
                    lac_mem_pools[index]->availBlks);
        }
        index++;
    }
}

#ifndef ICP_DC_ONLY
static void Lac_MemPoolInitSymCookies(lac_sym_cookie_t *pSymCookie)
{
    pSymCookie->keyContentDescPhyAddr =
        LAC_OS_VIRT_TO_PHYS_INTERNAL(pSymCookie->u.keyCookie.contentDesc);
    pSymCookie->keyHashStateBufferPhyAddr =
        LAC_OS_VIRT_TO_PHYS_INTERNAL(pSymCookie->u.keyCookie.hashStateBuffer);
    pSymCookie->keySslKeyInputPhyAddr =
        LAC_OS_VIRT_TO_PHYS_INTERNAL(&(pSymCookie->u.keyCookie.u.sslKeyInput));
    pSymCookie->keyTlsKeyInputPhyAddr =
        LAC_OS_VIRT_TO_PHYS_INTERNAL(&(pSymCookie->u.keyCookie.u.tlsKeyInput));
}

CpaStatus Lac_MemPoolInitSymCookiesPhyAddr(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;
    lac_sym_cookie_t *pSymCookie = NULL;
    lac_mem_blk_t *pCurrentBlk = NULL;

    if (NULL == pPoolID)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return CPA_STATUS_FAIL;
    }

    if (pPoolID->trackBlks == NULL)
    {
        pCurrentBlk = top(&pPoolID->stack);

        while (pCurrentBlk != NULL)
        {
            pSymCookie = (lac_sym_cookie_t *)((LAC_ARCH_UINT)(pCurrentBlk) +
                                              sizeof(lac_mem_blk_t));
            pCurrentBlk = pCurrentBlk->pNext;
            Lac_MemPoolInitSymCookies(pSymCookie);
        }
    }
    else
    {
        Cpa32U count = 0;

        for (count = 0; count < pPoolID->numElementsInPool; count++)
        {
            pCurrentBlk = pPoolID->trackBlks[count];
            pSymCookie = (lac_sym_cookie_t *)((LAC_ARCH_UINT)(pCurrentBlk) +
                                              sizeof(lac_mem_blk_t));
            Lac_MemPoolInitSymCookies(pSymCookie);
        }
    }
    return CPA_STATUS_SUCCESS;
}

#ifndef ASYM_NOT_SUPPORTED
CpaStatus Lac_MemPoolInitAsymCookies(lac_memory_pool_id_t poolID,
                                     CpaInstanceHandle instanceHandle)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;
    lac_mem_blk_t *pCurrentBlk = NULL;
    Cpa8U *pAsymReq = NULL;

    if (NULL == pPoolID)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return CPA_STATUS_FAIL;
    }

    if (pPoolID->trackBlks == NULL)
    {
        pCurrentBlk = top(&pPoolID->stack);

        while (pCurrentBlk != NULL)
        {
            pAsymReq =
                (Cpa8U *)((LAC_ARCH_UINT)(pCurrentBlk) + sizeof(lac_mem_blk_t));
            pCurrentBlk = pCurrentBlk->pNext;
            LacPke_InitAsymRequest(pAsymReq, instanceHandle);
        }
    }
    else
    {
        Cpa32U count = 0;

        for (count = 0; count < pPoolID->numElementsInPool; count++)
        {
            pCurrentBlk = pPoolID->trackBlks[count];
            pCurrentBlk->opaque = ICP_ADF_INVALID_SEND_SEQ;
            pAsymReq =
                (Cpa8U *)((LAC_ARCH_UINT)(pCurrentBlk) + sizeof(lac_mem_blk_t));
            LacPke_InitAsymRequest(pAsymReq, instanceHandle);
        }
    }
    return CPA_STATUS_SUCCESS;
}
#endif
#endif

CpaStatus Lac_MemPoolInitDcCookiePhyAddr(lac_memory_pool_id_t poolID)
{
    lac_mem_pool_hdr_t *pPoolID = (lac_mem_pool_hdr_t *)poolID;
    dc_compression_cookie_t *pCookie = NULL;
    lac_mem_blk_t *pCurrentBlk = NULL;

    if (NULL == pPoolID)
    {
        LAC_LOG_ERROR("Invalid Pool ID");
        return CPA_STATUS_FAIL;
    }

    if (NULL == pPoolID->trackBlks)
    {
        pCurrentBlk = top(&pPoolID->stack);

        while (pCurrentBlk != NULL)
        {
            pCookie = (dc_compression_cookie_t *)((LAC_ARCH_UINT)(pCurrentBlk) +
                                                  sizeof(lac_mem_blk_t));
            pCurrentBlk = pCurrentBlk->pNext;

            // pCookie->dcReqParamsBufferPhyAddr =
            //    LAC_OS_VIRT_TO_PHYS_INTERNAL(pCookie->dcReqParamsBuffer);
        }
    }
    else
    {
        Cpa32U count = 0;

        for (count = 0; count < pPoolID->numElementsInPool; count++)
        {
            pCurrentBlk = pPoolID->trackBlks[count];
            pCookie = (dc_compression_cookie_t *)((LAC_ARCH_UINT)(pCurrentBlk) +
                                                  sizeof(lac_mem_blk_t));

            // pCookie->dcReqParamsBufferPhyAddr =
            LAC_OS_VIRT_TO_PHYS_INTERNAL(pCookie->dcReqParamsBuffer);
        }
    }
    return CPA_STATUS_SUCCESS;
}
