blob: a585c1c8622f3b6c97d9fa28b74cefa7a5707b03 (
plain)
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
|
/*
* 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"
void
queue_clone(Queue *t, Queue *s)
{
t->alloc = t->elements = xmalloc((s->count + 8) * sizeof(Id));
if (s->count)
memcpy(t->alloc, s->elements, s->count * sizeof(Id));
t->count = s->count;
t->left = 8;
}
void
queue_init(Queue *q)
{
q->alloc = q->elements = 0;
q->count = q->left = 0;
}
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)
free(q->alloc);
q->alloc = q->elements = 0;
q->count = q->left = 0;
}
void
queue_alloc_one(Queue *q)
{
if (q->alloc && q->alloc != q->elements)
{
memmove(q->alloc, q->elements, q->count * sizeof(Id));
q->left += q->elements - q->alloc;
q->elements = q->alloc;
}
else if (q->alloc)
{
q->elements = q->alloc = realloc(q->alloc, (q->count + 8) * sizeof(Id));
q->left += 8;
}
else
{
q->alloc = xmalloc((q->count + 8) * sizeof(Id));
if (q->count)
memcpy(q->alloc, q->elements, q->count * sizeof(Id));
q->elements = q->alloc;
q->left += 8;
}
}
|
