-
Notifications
You must be signed in to change notification settings - Fork 44
/
payload_queue.c
executable file
·88 lines (74 loc) · 2.71 KB
/
payload_queue.c
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
87
88
/*
* Copyright (c) 2010, Regents of the University of California
* 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.
* - Neither the name of the University of California, Berkeley nor the names
* of its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* 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.
*
*
* Queue (FIFO) for Payload
*
* by Stanley S. Baek
*
* v.beta
*
* Revisions:
* Stanley S. Baek 2010-08-03 Initial release
*
* Notes:
*
*/
#include "queue.h"
#include "payload_queue.h"
#include "payload.h"
#include <xc.h>
#include <stdio.h> // for NULL
#include <stdlib.h> // for malloc
/*-----------------------------------------------------------------------------
* Public functions
-----------------------------------------------------------------------------*/
PayQueue pqInit(int max_size) {
Queue pq = queueInit(max_size);
return pq;
}
void pqPush(PayQueue pq, Payload pld) {
Payload pay;
if (queueIsFull(pq)) {
pay = (Payload)queuePop(pq);
payDelete(pay);
}
queueAppend(pq, pld);
}
Payload pqPop(PayQueue queue) {
return (Payload)queuePop(queue);
}
int pqIsFull(PayQueue queue) {
return queueIsFull(queue);
}
int pqIsEmpty(PayQueue queue) {
return queueIsEmpty(queue);
}
int pqGetSize(PayQueue queue) {
return queueGetSize(queue);
}