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
|
/* $Id: queue.c,v 1.1 2009/06/23 22:12:55 erg Exp $ $Revision: 1.1 $ */
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
/*
* Queue implementation using cdt
*
*/
#include <queue.h>
#include <ast.h>
typedef struct {
Dtlink_t link;
void *np;
} nsitem;
static Void_t *makef(Dt_t * d, nsitem * obj, Dtdisc_t * disc)
{
nsitem *p;
p = oldof(0, nsitem, 1, 0);
p->np = obj->np;
return p;
}
static void freef(Dt_t * d, nsitem * obj, Dtdisc_t * disc)
{
free(obj);
}
static Dtdisc_t ndisc = {
offsetof(nsitem, np),
sizeof(void *),
offsetof(nsitem, link),
(Dtmake_f) makef,
(Dtfree_f) freef,
0,
0,
0,
0
};
queue *mkQ(Dtmethod_t * meth)
{
queue *nq;
nq = dtopen(&ndisc, meth);
return nq;
}
void push(queue * nq, void *n)
{
nsitem obj;
obj.np = n;
dtinsert(nq, &obj);
}
void *pop(queue * nq, int delete)
{
nsitem *obj;
void *n;
obj = dtfirst(nq);
if (obj) {
n = obj->np;
if (delete)
dtdelete(nq, 0);
return n;
} else
return 0;
}
void freeQ(queue * nq)
{
dtclose(nq);
}
|
