blob: a807f1eba1211c52a2d2c76c9e8cc1d55d84af13 (
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
* pkg-queue.c - primitives for pkg queue handling
*
* Copyright © 2010 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-db.h>
#include <dpkg/pkg-queue.h>
/**
* Initialize a package queue.
*
* @param queue The queue to initialize.
*/
void
pkg_queue_init(struct pkg_queue *queue)
{
queue->head = NULL;
queue->tail = NULL;
queue->length = 0;
}
/**
* Destroy a package queue.
*
* It frees the contained package list and resets the queue members.
*
* @param queue The queue to destroy.
*/
void
pkg_queue_destroy(struct pkg_queue *queue)
{
pkg_list_free(queue->head);
pkg_queue_init(queue);
}
/**
* Check if a package queue is empty.
*
* @param queue The queue to check.
*
* @return A boolean value.
*/
int
pkg_queue_is_empty(struct pkg_queue *queue)
{
return (queue->head == NULL);
}
/**
* Push a new node containing pkginfo to the tail of the queue.
*
* @param queue The queue to insert to.
* @param pkg The package to use fo the new node.
*
* @return The newly inserted pkg_list node.
*/
struct pkg_list *
pkg_queue_push(struct pkg_queue *queue, struct pkginfo *pkg)
{
struct pkg_list *node;
node = pkg_list_new(pkg, NULL);
if (queue->tail == NULL)
queue->head = node;
else
queue->tail->next = node;
queue->tail = node;
queue->length++;
return node;
}
/**
* Pop a node containing pkginfo from the head of the queue.
*
* This removes and frees the node from the queue, effectively reducing its
* size.
*
* @param queue The queue to remove from.
*
* @return The pkginfo from the removed node, or NULL if the queue was empty.
*/
struct pkginfo *
pkg_queue_pop(struct pkg_queue *queue)
{
struct pkg_list *node;
struct pkginfo *pkg;
if (pkg_queue_is_empty(queue))
return NULL;
node = queue->head;
pkg = node->pkg;
queue->head = node->next;
if (queue->head == NULL)
queue->tail = NULL;
free(node);
queue->length--;
return pkg;
}
|
