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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
/*
* Copyright (c) 2007, Novell Inc.
*
* This program is licensed under the BSD license, read LICENSE.BSD
* for further information
*/
/*
* queue.c
*
*/
#include <stdlib.h>
#include <string.h>
#include "queue.h"
#include "util.h"
static inline int
queue_extra_space(int size)
{
if (size < 32)
return 8;
if (size < 64)
return 16;
if (size < 128)
return 32;
return 64;
}
void
queue_init(Queue *q)
{
q->alloc = q->elements = 0;
q->count = q->left = 0;
}
void
queue_init_clone(Queue *target, const Queue *source)
{
int extra_space;
if (!source->elements)
{
target->alloc = target->elements = 0;
target->count = target->left = 0;
return;
}
extra_space = queue_extra_space(source->count);
target->alloc = target->elements = solv_malloc2(source->count + extra_space, sizeof(Id));
if (source->count)
memcpy(target->alloc, source->elements, source->count * sizeof(Id));
target->count = source->count;
target->left = extra_space;
}
void
queue_init_buffer(Queue *q, Id *buf, int size)
{
q->alloc = 0;
q->elements = buf;
q->count = 0;
q->left = size;
}
void
queue_free(Queue *q)
{
if (q->alloc)
solv_free(q->alloc);
q->alloc = q->elements = 0;
q->count = q->left = 0;
}
/* make room for one element at the tail of the queue */
void
queue_alloc_one(Queue *q)
{
if (q->alloc && q->alloc != q->elements)
{
/* there's room at the front. just move data */
int l = q->elements - q->alloc;
if (q->count)
memmove(q->alloc, q->elements, q->count * sizeof(Id));
q->elements -= l;
q->left += l;
}
else
{
int extra_space = queue_extra_space(q->count);
if (!q->alloc)
{
q->alloc = solv_malloc2(q->count + extra_space, sizeof(Id));
if (q->count)
memcpy(q->alloc, q->elements, q->count * sizeof(Id));
}
else
q->alloc = solv_realloc2(q->alloc, q->count + extra_space, sizeof(Id));
q->elements = q->alloc;
q->left = extra_space;
}
}
/* make room for an element in front of queue */
void
queue_alloc_one_head(Queue *q)
{
int l, extra_space;
if (!q->alloc || !q->left)
queue_alloc_one(q); /* easy way to make room */
extra_space = queue_extra_space(q->count);
l = q->left > extra_space ? extra_space : q->left;
if (q->count)
memmove(q->elements + l, q->elements, q->count * sizeof(Id));
q->elements += l;
q->left -= l;
}
void
queue_insert(Queue *q, int pos, Id id)
{
queue_push(q, id); /* make room */
if (pos < q->count - 1)
{
memmove(q->elements + pos + 1, q->elements + pos, (q->count - 1 - pos) * sizeof(Id));
q->elements[pos] = id;
}
}
void
queue_delete(Queue *q, int pos)
{
if (pos >= q->count)
return;
if (pos < q->count - 1)
memmove(q->elements + pos, q->elements + pos + 1, (q->count - 1 - pos) * sizeof(Id));
q->left++;
q->count--;
}
void
queue_insert2(Queue *q, int pos, Id id1, Id id2)
{
queue_push(q, id1); /* make room */
queue_push(q, id2); /* make room */
if (pos < q->count - 2)
{
memmove(q->elements + pos + 2, q->elements + pos, (q->count - 2 - pos) * sizeof(Id));
q->elements[pos] = id1;
q->elements[pos + 1] = id2;
}
}
void
queue_delete2(Queue *q, int pos)
{
if (pos >= q->count)
return;
if (pos == q->count - 1)
{
q->left++;
q->count--;
return;
}
if (pos < q->count - 2)
memmove(q->elements + pos, q->elements + pos + 2, (q->count - 2 - pos) * sizeof(Id));
q->left += 2;
q->count -= 2;
}
void
queue_insertn(Queue *q, int pos, int n, const Id *elements)
{
if (n <= 0)
return;
if (pos > q->count)
pos = q->count;
if (q->left < n)
queue_prealloc(q, n);
if (pos < q->count)
memmove(q->elements + pos + n, q->elements + pos, (q->count - pos) * sizeof(Id));
if (elements)
memcpy(q->elements + pos, elements, n * sizeof(Id));
else
memset(q->elements + pos, 0, n * sizeof(Id));
q->left -= n;
q->count += n;
}
void
queue_deleten(Queue *q, int pos, int n)
{
if (n <= 0 || pos >= q->count)
return;
if (pos + n >= q->count)
n = q->count - pos;
else
memmove(q->elements + pos, q->elements + pos + n, (q->count - n - pos) * sizeof(Id));
q->left += n;
q->count -= n;
}
/* pre-allocate room for n more elements */
void
queue_prealloc(Queue *q, int n)
{
int off, extra_space;
if (n <= 0 || q->left >= n)
return;
if (!q->alloc)
queue_alloc_one(q);
off = q->elements - q->alloc;
extra_space = queue_extra_space(q->count + n);
q->alloc = solv_realloc2(q->alloc, off + q->count + n + extra_space, sizeof(Id));
q->elements = q->alloc + off;
q->left = n + extra_space;
}
|
