blob: 807aabbb011339b34b35daf45a90eca13b094401 (
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
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
|
/*
* libdpkg - Debian packaging suite library routines
* fsys-iter.c - filesystem nodes iterators
*
* Copyright © 1995 Ian Jackson <ijackson@chiark.greenend.org.uk>
* Copyright © 2000, 2001 Wichert Akkerman <wakkerma@debian.org>
* Copyright © 2008-2014 Guillem Jover <guillem@debian.org>
*
* This 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 2 of the License, or
* (at your option) any later version.
*
* This 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 <https://www.gnu.org/licenses/>.
*/
#include <config.h>
#include <compat.h>
#include <stdlib.h>
#include <dpkg/dpkg.h>
#include <dpkg/dpkg-db.h>
#include <dpkg/pkg-list.h>
#include "fsys.h"
/*
* Reverse iterator.
*/
/*
* Initializes an iterator that appears to go through the file list ‘files’
* in reverse order, returning the namenode from each. What actually happens
* is that we walk the list here, building up a reverse list, and then peel
* it apart one entry at a time.
*/
void
fsys_hash_rev_iter_init(struct fsys_hash_rev_iter *iter,
struct fsys_namenode_list *files)
{
struct fsys_namenode_list *newent;
iter->todo = NULL;
while (files) {
newent = m_malloc(sizeof(*newent));
newent->namenode = files->namenode;
newent->next = iter->todo;
iter->todo = newent;
files = files->next;
}
}
struct fsys_namenode *
fsys_hash_rev_iter_next(struct fsys_hash_rev_iter *iter)
{
struct fsys_namenode *next;
struct fsys_namenode_list *todo;
todo = iter->todo;
if (!todo)
return NULL;
next = todo->namenode;
iter->todo = todo->next;
free(todo);
return next;
}
/*
* Clients must call this function to clean up the fsys_hash_rev_iter
* if they wish to break out of the iteration before it is all done.
* Calling this function is not necessary if fsys_hash_rev_iter_next() has
* been called until it returned 0.
*/
void
fsys_hash_rev_iter_abort(struct fsys_hash_rev_iter *iter)
{
while (fsys_hash_rev_iter_next(iter))
;
}
/*
* Iterator for packages owning a file.
*/
struct fsys_node_pkgs_iter {
struct pkg_list *pkg_node;
};
struct fsys_node_pkgs_iter *
fsys_node_pkgs_iter_new(struct fsys_namenode *fnn)
{
struct fsys_node_pkgs_iter *iter;
iter = m_malloc(sizeof(*iter));
iter->pkg_node = fnn->packages;
return iter;
}
struct pkginfo *
fsys_node_pkgs_iter_next(struct fsys_node_pkgs_iter *iter)
{
struct pkg_list *pkg_node;
if (iter->pkg_node == NULL)
return NULL;
pkg_node = iter->pkg_node;
iter->pkg_node = pkg_node->next;
return pkg_node->pkg;
}
void
fsys_node_pkgs_iter_free(struct fsys_node_pkgs_iter *iter)
{
free(iter);
}
|
