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
|
/*--------------------------------------------------------------------
* procenv - generic list handling header.
*
* Copyright 2012-2016 James Hunt <jamesodhunt@ubuntu.com>.
*
* 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 3 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, see <http://www.gnu.org/licenses/>.
*--------------------------------------------------------------------
*/
#ifndef _PROCENV_LIST
#define _PROCENV_LIST
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif /* HAVE_CONFIG_H */
#include <stdio.h>
#include <stdlib.h>
/* Double-linked list structure with no terminal node - a list of a
* single item has next and prev pointers pointing "back round" to
* itself.
*/
typedef struct list {
void *data;
struct list *next;
struct list *prev;
} PRList;
typedef void (*PRListVisitor) (PRList *entry);
typedef int (*PRListCmp) (PRList *a, PRList *b);
PRList *pr_list_new (void *data);
PRList *pr_list_append (PRList *list, PRList *entry);
PRList *pr_list_append_str (PRList *list, const char *str);
PRList *pr_list_appendn_str (PRList *list, const char *str, size_t len);
PRList *pr_list_prepend (PRList *list, PRList *entry);
PRList *pr_list_prepend_str (PRList *list, const char *str);
PRList *pr_list_prependn_str (PRList *list, const char *str, size_t len);
PRList *pr_list_prepend_str_sorted(PRList *list, PRList *entry);
PRList *pr_list_prepend_sorted(PRList *list, PRList *entry, PRListCmp cmp);
PRList *pr_list_append_str_sorted(PRList *list, PRList *entry);
PRList *pr_list_append_sorted(PRList *list, PRList *entry, PRListCmp cmp);
PRList *pr_list_remove (PRList *entry);
void pr_list_foreach_visit (PRList *list, PRListVisitor visitor);
void pr_list_foreach_rev_visit (PRList *list, PRListVisitor visitor);
void pr_list_visitor_str (PRList *entry);
#define PR_LIST_FOREACH(list, iter) \
for (PRList *iter = (list)->next; iter != (list); iter = iter->next)
#define PR_LIST_FOREACH_SAFE(list, iter) \
for (PRList *iter = (list)->next, *tmp = iter->next; \
iter != (list); \
iter = tmp, tmp = iter->next)
#define PR_LIST_FOREACH_REV(list, iter) \
for (PRList *iter = (list)->prev; iter != (list); iter = iter->prev)
#define PR_LIST_FOREACH_STR(list) \
pr_list_foreach_visit (list, pr_list_visitor_str)
#define PR_LIST_FOREACH_REV_STR(list) \
pr_list_foreach_rev_visit (list, pr_list_visitor_str)
#endif /* _PROCENV_LIST */
|
