circular_queue.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 QUEUE_H_
#define QUEUE_H_

#include <stddef.h>
#include <stdbool.h>
#include <stdint.h>

typedef struct tagCircularQueue32
{
    uint32_t *pQueueBuf;
    uint32_t *pFirst, *pLast;
    size_t size;
    bool bEmpty;
} CircularQueue32;

void ckCircularQueue32Init(CircularQueue32 *pQueue, uint32_t *pQueueBuf, size_t QueueSize);

bool ckCircularQueue32Put(CircularQueue32 *pQueue, uint32_t data);

uint32_t ckCircularQueue32Get(CircularQueue32 *pQueue, bool bPeek, bool *pbSuccess);

bool ckCircularQueue32Remove(CircularQueue32 *pQueue);


typedef struct tagCircularQueue8
{
    uint8_t *pQueueBuf;
    uint8_t *pFirst, *pLast;
    size_t size;
    bool bEmpty;
} CircularQueue8;
void ckCircularQueue8Init(CircularQueue8 *pQueue, uint8_t *pQueueBuf, size_t QueueSize);
bool ckCircularQueue8Put(CircularQueue8 *pQueue, uint8_t data);
uint8_t ckCircularQueue8Get(CircularQueue8 *pQueue, bool bPeek, bool *pbSuccess);
bool ckCircularQueue8Remove(CircularQueue8 *pQueue);

#endif /* QUEUE_H_ */