Stack

最新推荐文章于 2024-07-15 10:21:14 发布

zyzhangyue

最新推荐文章于 2024-07-15 10:21:14 发布

阅读量276

点赞数

分类专栏： C拾遗

本文链接：https://blog.csdn.net/zyzhangyue/article/details/45824129

版权

C拾遗专栏收录该内容

14 篇文章 1 订阅

订阅专栏

#define INVALID_POINTER NULL // ((void*)INVALID32)
#define STACK_EMPTY(p) (INVALID_POINTER == p)

typedef struct
{
    uint8*     mpTopPointer;
    uint8*     mpBottomPointer;
    uint8*     mpMax;
    uint32     mdWidth;
    uint32     mdSize;
} TStackCtl, *pTStackCtl;

Bool IsStackEmpty(pTStackCtl pSatckData)
{
    if(pSatckData->mpBottomPointer == pSatckData->mpTopPointer)
        return TRUE;
    else
        return FALSE;
}

void PushStackDataEntry(pTStackCtl pSatckData)
{
    // If the stack is not full, push the entry.
    if(pSatckData->mpMax != pSatckData->mpTopPointer)
    {
        pSatckData->mpTopPointer += pSatckData->mdWidth;
    }
}

void PopStackDataEntry(pTStackCtl pSatckData)
{
    // If the stack is not empty, pop the entry.
    if(pSatckData->mpBottomPointer != pSatckData->mpTopPointer)
    {
        pSatckData->mpTopPointer -= pSatckData->mdWidth;
    }
}

void* GetStackFreeEntry(pTStackCtl pSatckData)
{
void* p;

    // If the stack is full, return invalid pointer.
    if(pSatckData->mpMax == pSatckData->mpTopPointer)
    {
        p = INVALID_POINTER;
    }
    else
    {
        p = pSatckData->mpTopPointer;
    }

return p;
}

void* GetStackTopEntry(pTStackCtl pSatckData)
{
void* p;

    // If the stack is empty, return invalid pointer.
    if(pSatckData->mpBottomPointer == pSatckData->mpTopPointer)
    {
        p = INVALID_POINTER;
    }
    else
    {
        p = pSatckData->mpTopPointer - pSatckData->mdWidth;
    }

return p;
}

void InitStackEntry(pTStackCtl pSatckData, uint8* pBottomPointer, uint32 dWidth, uint32 dCount)
{
    pSatckData->mpTopPointer     = pBottomPointer;
    pSatckData->mpBottomPointer = pBottomPointer;
    pSatckData->mdWidth          = dWidth;
    pSatckData->mdSize           = dCount * dWidth;
    pSatckData->mpMax            = pBottomPointer + dCount * dWidth;
}