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
|
/*
* jabberd - Jabber Open Source Server
* Copyright (c) 2002 Jeremie Miller, Thomas Muldowney,
* Ryan Eatmon, Robert Norris
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA02111-1307USA
*/
/* priority jqueues */
#include "util.h"
jqueue_t jqueue_new(void) {
pool_t p;
jqueue_t q;
p = pool_new();
q = (jqueue_t) pmalloco(p, sizeof(struct _jqueue_st));
q->p = p;
q->init_time = time(NULL);
return q;
}
void jqueue_free(jqueue_t q) {
assert((int) (q != NULL));
pool_free(q->p);
}
void jqueue_push(jqueue_t q, void *data, int priority) {
_jqueue_node_t qn, scan;
assert((int) (q != NULL));
q->size++;
/* node from the cache, or make a new one */
qn = q->cache;
if(qn != NULL)
q->cache = qn->next;
else
qn = (_jqueue_node_t) pmalloc(q->p, sizeof(struct _jqueue_node_st));
qn->data = data;
qn->priority = priority;
qn->next = NULL;
qn->prev = NULL;
/* first one */
if(q->back == NULL && q->front == NULL) {
q->back = qn;
q->front = qn;
return;
}
/* find the first node with priority <= to us */
for(scan = q->back; scan != NULL && scan->priority > priority; scan = scan->next);
/* didn't find one, so we have top priority - push us on the front */
if(scan == NULL) {
qn->prev = q->front;
qn->prev->next = qn;
q->front = qn;
return;
}
/* push us in front of scan */
qn->next = scan;
qn->prev = scan->prev;
if(scan->prev != NULL)
scan->prev->next = qn;
else
q->back = qn;
scan->prev = qn;
}
void *jqueue_pull(jqueue_t q) {
void *data;
_jqueue_node_t qn;
assert((int) (q != NULL));
if(q->front == NULL)
return NULL;
data = q->front->data;
qn = q->front;
if(qn->prev != NULL)
qn->prev->next = NULL;
q->front = qn->prev;
/* node to cache for later reuse */
qn->next = q->cache;
q->cache = qn;
if(q->front == NULL)
q->back = NULL;
q->size--;
return data;
}
int jqueue_size(jqueue_t q) {
return q->size;
}
time_t jqueue_age(jqueue_t q) {
return time(NULL) - q->init_time;
}
|
