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
|
/*
* Mach Operating System
* Copyright (c) 1991,1990,1989,1988,1987 Carnegie Mellon University
* All Rights Reserved.
*
* Permission to use, copy, modify and distribute this software and its
* documentation is hereby granted, provided that both the copyright
* notice and this permission notice appear in all copies of the
* software, derivative works or modified versions, and any portions
* thereof, and that both notices appear in supporting documentation.
*
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
*
* Carnegie Mellon requests users of this software to return to
*
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
* School of Computer Science
* Carnegie Mellon University
* Pittsburgh PA 15213-3890
*
* any improvements or extensions that they make and grant Carnegie Mellon
* the rights to redistribute these changes.
*/
/*
* Routines to implement queue package.
*/
#include <kern/queue.h>
/*
* Insert element at head of queue.
*/
void enqueue_head(
queue_t que,
queue_entry_t elt)
{
elt->next = que->next;
elt->prev = que;
elt->next->prev = elt;
que->next = elt;
}
/*
* Insert element at tail of queue.
*/
void enqueue_tail(
queue_t que,
queue_entry_t elt)
{
elt->next = que;
elt->prev = que->prev;
elt->prev->next = elt;
que->prev = elt;
}
/*
* Remove and return element at head of queue.
*/
queue_entry_t dequeue_head(
queue_t que)
{
queue_entry_t elt;
if (que->next == que)
return((queue_entry_t)0);
elt = que->next;
elt->next->prev = que;
que->next = elt->next;
return(elt);
}
/*
* Remove and return element at tail of queue.
*/
queue_entry_t dequeue_tail(
queue_t que)
{
queue_entry_t elt;
if (que->prev == que)
return((queue_entry_t)0);
elt = que->prev;
elt->prev->next = que;
que->prev = elt->prev;
return(elt);
}
/*
* Remove arbitrary element from queue.
* Does not check whether element is on queue - the world
* will go haywire if it isn't.
*/
/*ARGSUSED*/
void remqueue(
queue_t que,
queue_entry_t elt)
{
elt->next->prev = elt->prev;
elt->prev->next = elt->next;
}
/*
* Routines to directly imitate the VAX hardware queue
* package.
*/
void insque(
struct queue_entry *entry,
struct queue_entry *pred)
{
entry->next = pred->next;
entry->prev = pred;
(pred->next)->prev = entry;
pred->next = entry;
}
|
