File: list.h

package info (click to toggle)
sudo 1.7.4p4-2.squeeze.6
  • links: PTS
  • area: main
  • in suites: squeeze-lts
  • size: 8,948 kB
  • ctags: 4,726
  • sloc: ansic: 22,982; sh: 15,240; yacc: 1,481; lex: 1,033; makefile: 547; perl: 366
file content (83 lines) | stat: -rw-r--r-- 2,092 bytes parent folder | download | duplicates (2)
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
/*
 * Copyright (c) 2007 Todd C. Miller <Todd.Miller@courtesan.com>
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 */

#ifndef _SUDO_LIST_H
#define _SUDO_LIST_H

/*
 * Convenience macro for declaring a list head.
 */
#ifdef __STDC__
#define TQ_DECLARE(n)					\
struct n##_list {					\
    struct n *first;					\
    struct n *last;					\
};
#else
#define TQ_DECLARE(n)					\
struct n/**/_list {					\
    struct n *first;					\
    struct n *last;					\
};
#endif

/*
 * Foreach loops: forward and reverse
 */
#undef tq_foreach_fwd
#define tq_foreach_fwd(h, v)				\
    for ((v) = (h)->first; (v) != NULL; (v) = (v)->next)

#undef tq_foreach_rev
#define tq_foreach_rev(h, v)				\
    for ((v) = (h)->last; (v) != NULL; (v) = (v)->prev)

/*
 * Init a list head.
 */
#undef tq_init
#define tq_init(h) do {					\
    (h)->first = NULL;					\
    (h)->last = NULL;					\
} while (0)

/*
 * Simple macros to avoid exposing first/last and prev/next.
 */
#undef tq_empty
#define tq_empty(h)	((h)->first == NULL)

#undef tq_first
#define tq_first(h)	((h)->first)

#undef tq_last
#define tq_last(h)	((h)->last)

#undef list_next
#define list_next(e)	((e)->next)

#undef list_prev
#define list_prev(e)	((e)->prev)

/*
 * Prototypes for list.c
 */
void *tq_pop		__P((void *));
void tq_append		__P((void *, void *));
void list_append	__P((void *, void *));
void list2tq		__P((void *, void *));

#endif /* _SUDO_LIST_H */