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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
|
/* Part of publib.
Copyright (c) 1994-2006 Lars Wirzenius. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. 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 AUTHOR ``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 AUTHOR 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.
*/
/*
* File: queue.c
* Purpose: Implement the queue abstract data type.
* Author: Lars Wirzenius
* Version: "@(#)publib:$Id: queue.c,v 1.1.1.1 1996/01/18 15:44:03 liw Exp $"
*/
#include <assert.h>
#include <stdlib.h>
#include "publib/queue.h"
#include "publib/alloc.h"
#include "publib/errormsg.h"
/*
* Function: queue_create
* Purpose: Create a new queue.
* Arguments: None.
* Return: Pointer to queue handle.
*/
Queue *queue_create(void) {
Queue *q;
q = malloc(sizeof(*q));
if (q == NULL) {
__publib_error("queue_create: out of memory");
return NULL;
}
q->queue_front = NULL;
q->queue_behind = NULL;
return q;
}
/*
* Function: queue_destroy
* Purpose: Destroy a queue and its contents.
* Arguments: q pointer to queue
* Return: Nothing.
*/
void queue_destroy(Queue *q) {
assert(q != NULL);
while (q->queue_front != NULL)
(void) queue_remove(q);
free(q);
}
/*
* Function: queue_front
* Purpose: Return foremost datum in queue.
* Arguments: q pointer to queue
* Return: Pointer to data.
*/
void *queue_front(Queue *q) {
assert(q != NULL);
assert(q->queue_front != NULL);
return q->queue_front->queue_data;
}
/*
* Function: queue_remove
* Purpose: Remove and return foremost datum in queue.
* Arguments: q pointer to queue
* Return: Pointer to data.
*/
void *queue_remove(Queue *q) {
struct queue_node *p;
void *data;
assert(q != NULL);
assert(q->queue_front != NULL);
p = q->queue_front;
data = p->queue_data;
q->queue_front = p->queue_previous;
if (q->queue_front == NULL)
q->queue_behind = NULL;
free(p);
return data;
}
/*
* Function: queue_is_empty
* Purpose: Is the queue empty?
* Arguments: q pointer to queue
* Return: 0 for not empty, 1 for empty.
*/
int queue_is_empty(Queue *q) {
assert(q != NULL);
return q->queue_front == NULL;
}
/*
* Function: queue_add
* Purpose: Add a new datum at end of queue.
* Arguments: q pointer to queue
* data pointer to data
* size size of data
* Description: queue_add adds a new datum at the behind end of a queue.
* If `size' is 0, it only adds the pointer value `data'.
* Otherwise it makes a copy of the datum (first `size'
* bytes beginning at `data') and adds that into the queue.
* In the latter case, when the datum is removed from the queue,
* it is the responsibility of the user to free the memory.
* Return: -1 for failure (memory allocation error), 0 for OK.
*/
int queue_add(Queue *q, const void *data, size_t size) {
struct queue_node *p;
p = malloc(sizeof(*p));
if (p == NULL) {
__publib_error("queue_add: out of memory");
return -1;
}
if (size > 0) {
data = memdup(data, size);
if (data == NULL) {
__publib_error("queue_add: out of memory");
free(p);
return -1;
}
}
p->queue_previous = NULL;
p->queue_data = (void *) data;
if (q->queue_behind == NULL) {
q->queue_behind = p;
q->queue_front = p;
} else {
q->queue_behind->queue_previous = p;
q->queue_behind = p;
}
return 0;
}
|
