Repository navigation
Expand file tree
/
Copy pathbase.c
More file actions
87 lines (69 loc) · 1.63 KB
/
Copy pathbase.c
File metadata and controls
87 lines (69 loc) · 1.63 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
/**
*************************************************************************
*
* base.c
* 2016-02-16 by zlq
*
*------------------------------------------------------------------------
* @berif 定义了一些基础的数据类型的处理函数
*************************************************************************
*/
#include <miniOS/base.h>
#include "stdio.h"
void circular_queue_init(Circular_Queue *queue, int size, uint8_t *buf)
{
queue->size = size;
queue->free_size = size;
queue->pop_index = 0;
queue->push_index = 0;
queue->flags = 0;
queue->buf = buf;
return;
}
uint8_t circular_queue_pop(Circular_Queue *queue, uint8_t *data)
{
if(queue->free_size == queue->size){
return -1;
}
*data = queue->buf[queue->pop_index++];
if(queue->pop_index == queue->size){
queue->pop_index = 0;
}
queue->free_size++;
return 0;
}
uint8_t circular_queue_push(Circular_Queue *queue, uint8_t data)
{
if(queue->free_size == 0){
queue->flags |= OVERFLOW;
return -1;
}
queue->buf[queue->push_index++] = data;
if(queue->push_index == queue->size){
queue->push_index = 0;
}
queue->free_size--;
return 0;
}
uint8_t is_empty(Circular_Queue *queue)
{
if(queue == NULL){
return -1;
}
if(queue->free_size == queue->size){
return 0;
}else{
return 1;
}
}
uint8_t is_full(Circular_Queue *queue)
{
if(queue == NULL){
return -1;
}
if(queue->free_size == 0){
return 0;
}else{
return 1;
}
}