blob: 3afe07dd43ab3f9b0c8a208db191877a8c47f087 (
plain) (
blame)
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
|
// SPDX-License-Identifier: GPL-2.0-only
/*
* Copyright(C) 2021 Alibaba Communications Inc.
* Author: David Li <liyong.li@alibaba-inc.com>
*/
/*
* queue management
*
*/
#pragma once
#ifndef _QUEUE_H
#define _QUEUE_H
#ifdef __cplusplus
extern "C" {
#endif
#ifndef bool
#define bool int
#endif
#ifndef true
#define true 1
#endif
#ifndef false
#define false 0
#endif
typedef int(*QueueIncreased)(void* queue, char data);
typedef struct _QueueNode{
char data;
struct _QueueNode* next;
struct _QueueNode* prior;
}QueueNode;
typedef struct _Queue{
QueueNode* head;
QueueNode* tail;
unsigned long length;
QueueIncreased onQueueIncreased;
}Queue;
Queue* Queue_Init(QueueIncreased queueIncreasedEvent);
int Queue_AddToHead(Queue* queue, char data);
int Queue_AddToTail(Queue* queue, char data);
char Queue_GetFromHead(Queue* queue);
char Queue_GetFromTail(Queue* queue);
char Queue_QueryAt(Queue* queue, unsigned long index);
void Queue_Free(Queue* queue,bool isFreeData);
int OnQueueIncreasedEvent(void* queue, char data);
#ifdef __cplusplus
}
#endif
#endif
|
