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
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
|
/* pkg_vec.c - the itsy package management system
Steven M. Ayer
Copyright (C) 2002 Compaq Computer Corporation
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 2, 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.
*/
#include <stdlib.h>
#include <fnmatch.h>
#include "xregex.h"
#include "opkg.h"
#include "pkg.h"
pkg_vec_t * pkg_vec_alloc(void)
{
pkg_vec_t * vec = (pkg_vec_t *)malloc(sizeof(pkg_vec_t));
if (!vec) {
fprintf(stderr, "%s: out of memory\n", __FUNCTION__);
return NULL;
}
vec->pkgs = NULL;
vec->len = 0;
return vec;
}
void pkg_vec_free(pkg_vec_t *vec)
{
free(vec->pkgs);
free(vec);
}
/*
* assumption: all names in a vector are identical
* assumption: all version strings are trimmed,
* so identical versions have identical version strings,
* implying identical packages; let's marry these
*/
pkg_t *pkg_vec_insert_merge(pkg_vec_t *vec, pkg_t *pkg, int set_status,opkg_conf_t *conf)
{
int i;
int found = 0;
/* look for a duplicate pkg by name, version, and architecture */
for (i = 0; i < vec->len; i++){
opkg_message(conf, OPKG_DEBUG2, "Function: %s. Found pkg=%s version=%s arch=%s cmp=%s version=%s arch=%s \n",
__FUNCTION__, pkg->name, pkg->version, pkg->architecture,
vec->pkgs[i]->name, vec->pkgs[i]->version,vec->pkgs[i]->architecture );
if ((strcmp(pkg->name, vec->pkgs[i]->name) == 0)
&& (pkg_compare_versions(pkg, vec->pkgs[i]) == 0)
&& (strcmp(pkg->architecture, vec->pkgs[i]->architecture) == 0)) {
found = 1;
opkg_message(conf, OPKG_DEBUG2, "Function: %s. Found duplicate for pkg=%s version=%s arch=%s\n",
__FUNCTION__, pkg->name, pkg->version, pkg->architecture);
break;
}
}
/* we didn't find one, add it */
if (!found){
opkg_message(conf, OPKG_DEBUG2, "Function: %s. Adding new pkg=%s version=%s arch=%s\n",
__FUNCTION__, pkg->name, pkg->version, pkg->architecture);
vec->pkgs = (pkg_t **)realloc(vec->pkgs, (vec->len + 1) * sizeof(pkg_t *));
vec->pkgs[vec->len] = pkg;
vec->len++;
return pkg;
}
/* update the one that we have */
else {
opkg_message(conf, OPKG_DEBUG2, "Function: %s. calling pkg_merge for pkg=%s version=%s arch=%s",
__FUNCTION__, pkg->name, pkg->version, pkg->architecture);
if (set_status) {
/* this is from the status file, so need to merge with existing database */
opkg_message(conf, OPKG_DEBUG2, " with set_status\n");
pkg_merge(vec->pkgs[i], pkg, set_status);
/* XXX: CLEANUP: It's not so polite to free something here
that was passed in from above. */
pkg_deinit(pkg);
free(pkg);
} else {
opkg_message(conf, OPKG_DEBUG2, " WITHOUT set_status\n");
/* just overwrite the old one */
pkg_deinit(vec->pkgs[i]);
free(vec->pkgs[i]);
vec->pkgs[i] = pkg;
}
return vec->pkgs[i];
}
}
void pkg_vec_insert(pkg_vec_t *vec, const pkg_t *pkg)
{
int found = 0;
#if 0
/* look for a duplicate pkg by name, version, and architecture */
for (i = 0; i < vec->len; i++)
if ((strcmp(pkg->name, vec->pkgs[i]->name) == 0)
&& (pkg_compare_versions(pkg, vec->pkgs[i]) == 0)
&& (strcmp(pkg->architecture, vec->pkgs[i]->name) == 0)) {
found = 1;
break;
}
#endif
/* we didn't find one, add it */
if(!found){
vec->pkgs = (pkg_t **)realloc(vec->pkgs, (vec->len + 1) * sizeof(pkg_t *));
*(const pkg_t **)&vec->pkgs[vec->len] = pkg;
vec->len++;
}
}
int pkg_vec_contains(pkg_vec_t *vec, pkg_t *apkg)
{
int i;
for (i = 0; i < vec->len; i++)
if (vec->pkgs[i] == apkg)
return 1;
return 0;
}
void pkg_vec_sort(pkg_vec_t *vec, compare_fcn_t compar)
{
qsort(vec->pkgs, vec->len, sizeof(pkg_t *), compar);
}
int pkg_vec_clear_marks(pkg_vec_t *vec)
{
int npkgs = vec->len;
int i;
for (i = 0; i < npkgs; i++) {
pkg_t *pkg = vec->pkgs[i];
pkg->state_flag &= ~SF_MARKED;
}
return 0;
}
int pkg_vec_mark_if_matches(pkg_vec_t *vec, const char *pattern)
{
int matching_count = 0;
pkg_t **pkgs = vec->pkgs;
int npkgs = vec->len;
int i;
for (i = 0; i < npkgs; i++) {
pkg_t *pkg = pkgs[i];
if (fnmatch(pattern, pkg->name, 0)==0) {
pkg->state_flag |= SF_MARKED;
matching_count++;
}
}
return matching_count;
}
abstract_pkg_vec_t * abstract_pkg_vec_alloc(void)
{
abstract_pkg_vec_t * vec ;
vec = (abstract_pkg_vec_t *)malloc(sizeof(abstract_pkg_vec_t));
if (!vec) {
fprintf(stderr, "%s: out of memory\n", __FUNCTION__);
return NULL;
}
vec->pkgs = NULL;
vec->len = 0;
return vec;
}
void abstract_pkg_vec_free(abstract_pkg_vec_t *vec)
{
free(vec->pkgs);
free(vec);
}
/*
* assumption: all names in a vector are unique
*/
void abstract_pkg_vec_insert(abstract_pkg_vec_t *vec, abstract_pkg_t *pkg)
{
#if 0
/* look for a duplicate pkg by name */
for(i = 0; i < vec->len; i++)
if (strcmp(pkg->name, vec->pkgs[i]->name) == 0)
break;
/* we didn't find one, add it */
if(i == vec->len){
#endif
vec->pkgs =
(abstract_pkg_t **)
realloc(vec->pkgs, (vec->len + 1) * sizeof(abstract_pkg_t *));
vec->pkgs[vec->len] = pkg;
vec->len++;
#if 0
}
#endif
}
abstract_pkg_t * abstract_pkg_vec_get(abstract_pkg_vec_t *vec, int i)
{
if (vec->len > i)
return vec->pkgs[i];
else
return NULL;
}
int abstract_pkg_vec_contains(abstract_pkg_vec_t *vec, abstract_pkg_t *apkg)
{
int i;
for (i = 0; i < vec->len; i++)
if (vec->pkgs[i] == apkg)
return 1;
return 0;
}
void abstract_pkg_vec_sort(pkg_vec_t *vec, compare_fcn_t compar)
{
qsort(vec->pkgs, vec->len, sizeof(pkg_t *), compar);
}
|
