array.h

이 파일의 문서화 페이지로 가기

// Copyright (c) 2014, 임경현 (dlarudgus20)
// 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.
//
// 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 HOLDER 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.

#ifndef ARRAY_H_
#define ARRAY_H_

#include <stddef.h>
#include <stdint.h>
#include <stdbool.h>
#include "assert.h"
#include "string.h"

typedef struct tagArray8
{
    uint8_t *buf; 
    uint8_t *now; 
    uint8_t *end; 
} Array8;

static inline void ckArray8Init(Array8 *pAr, uint8_t *buf, uint8_t *end)
{
    pAr->buf = pAr->now = buf;
    pAr->end = end;
}

static inline size_t ckArray8MaxSize(Array8 *pAr)
{
    return pAr->end - pAr->buf;
}

static inline size_t ckArray8Size(Array8 *pAr)
{
    return pAr->now - pAr->buf;
}

bool ckArray8Insert(Array8 *pAr, uint8_t *ptr, uint8_t data);
void ckArray8Erase(Array8 *pAr, uint8_t *ptr);

void ckArray8Append(Array8 *pDest, const Array8 *pSrc);

static inline bool ckArray8PushBack(Array8 *pAr, uint8_t data)
{
    return ckArray8Insert(pAr, pAr->now, data);
}

static inline uint8_t ckArray8PopBack(Array8 *pAr)
{
    assert(pAr->now > pAr->buf);
    pAr->now--;
    uint8_t ret = *pAr->now;
    ckArray8Erase(pAr, pAr->now);
    return ret;
}

static inline uint8_t ckArray8PopFront(Array8 *pArr)
{
    uint8_t ret = *pArr->buf;
    ckArray8Erase(pArr, pArr->buf);
    return ret;
}

static inline uint8_t *ckArray8Find(Array8 *pArr, uint8_t data)
{
    return (uint8_t *)memchr(pArr->buf, data, pArr->now - pArr->buf);
}

static inline uint8_t *ckArray8Remove(Array8 *pArr, uint8_t data)
{
    uint8_t *pFound = ckArray8Find(pArr, data);
    if (pFound != NULL)
    {
        ckArray8Erase(pArr, pFound);
    }
    return pFound;
}

#endif /* ARRAY_H_ */