Contents of /trunk/mkinitrd-magellan/busybox/archival/dpkg.c
Parent Directory | Revision Log
Revision 532 -
(show annotations)
(download)
Sat Sep 1 22:45:15 2007 UTC (16 years, 9 months ago) by niro
File MIME type: text/plain
File size: 54662 byte(s)
Sat Sep 1 22:45:15 2007 UTC (16 years, 9 months ago) by niro
File MIME type: text/plain
File size: 54662 byte(s)
-import if magellan mkinitrd; it is a fork of redhats mkinitrd-5.0.8 with all magellan patches and features; deprecates magellan-src/mkinitrd
1 | /* vi: set sw=4 ts=4: */ |
2 | /* |
3 | * mini dpkg implementation for busybox. |
4 | * this is not meant as a replacement for dpkg |
5 | * |
6 | * written by glenn mcgrath with the help of others |
7 | * copyright (c) 2001 by glenn mcgrath |
8 | * |
9 | * started life as a busybox implementation of udpkg |
10 | * |
11 | * licensed under gplv2 or later, see file license in this tarball for details. |
12 | */ |
13 | |
14 | /* |
15 | * known difference between busybox dpkg and the official dpkg that i don't |
16 | * consider important, its worth keeping a note of differences anyway, just to |
17 | * make it easier to maintain. |
18 | * - the first value for the confflile: field isnt placed on a new line. |
19 | * - when installing a package the status: field is placed at the end of the |
20 | * section, rather than just after the package: field. |
21 | * |
22 | * bugs that need to be fixed |
23 | * - (unknown, please let me know when you find any) |
24 | * |
25 | */ |
26 | |
27 | #include "busybox.h" |
28 | #include "unarchive.h" |
29 | |
30 | /* note: if you vary hash_prime sizes be aware, |
31 | * 1) tweaking these will have a big effect on how much memory this program uses. |
32 | * 2) for computational efficiency these hash tables should be at least 20% |
33 | * larger than the maximum number of elements stored in it. |
34 | * 3) all _hash_prime's must be a prime number or chaos is assured, if your looking |
35 | * for a prime, try http://www.utm.edu/research/primes/lists/small/10000.txt |
36 | * 4) if you go bigger than 15 bits you may get into trouble (untested) as its |
37 | * sometimes cast to an unsigned, if you go to 16 bit you will overlap |
38 | * int's and chaos is assured, 16381 is the max prime for 14 bit field |
39 | */ |
40 | |
41 | /* NAME_HASH_PRIME, Stores package names and versions, |
42 | * I estimate it should be at least 50% bigger than PACKAGE_HASH_PRIME, |
43 | * as there a lot of duplicate version numbers */ |
44 | #define NAME_HASH_PRIME 16381 |
45 | |
46 | /* PACKAGE_HASH_PRIME, Maximum number of unique packages, |
47 | * It must not be smaller than STATUS_HASH_PRIME, |
48 | * Currently only packages from status_hashtable are stored in here, but in |
49 | * future this may be used to store packages not only from a status file, |
50 | * but an available_hashtable, and even multiple packages files. |
51 | * Package can be stored more than once if they have different versions. |
52 | * e.g. The same package may have different versions in the status file |
53 | * and available file */ |
54 | #define PACKAGE_HASH_PRIME 10007 |
55 | typedef struct edge_s { |
56 | unsigned operator:3; |
57 | unsigned type:4; |
58 | unsigned name:14; |
59 | unsigned version:14; |
60 | } edge_t; |
61 | |
62 | typedef struct common_node_s { |
63 | unsigned name:14; |
64 | unsigned version:14; |
65 | unsigned num_of_edges:14; |
66 | edge_t **edge; |
67 | } common_node_t; |
68 | |
69 | /* Currently it doesnt store packages that have state-status of not-installed |
70 | * So it only really has to be the size of the maximum number of packages |
71 | * likely to be installed at any one time, so there is a bit of leeway here */ |
72 | #define STATUS_HASH_PRIME 8191 |
73 | typedef struct status_node_s { |
74 | unsigned package:14; /* has to fit PACKAGE_HASH_PRIME */ |
75 | unsigned status:14; /* has to fit STATUS_HASH_PRIME */ |
76 | } status_node_t; |
77 | |
78 | /* Were statically declared here, but such a big bss is nommu-unfriendly */ |
79 | static char **name_hashtable; /* [NAME_HASH_PRIME + 1] */ |
80 | static common_node_t **package_hashtable; /* [PACKAGE_HASH_PRIME + 1] */ |
81 | static status_node_t **status_hashtable; /* [STATUS_HASH_PRIME + 1] */ |
82 | |
83 | /* Even numbers are for 'extras', like ored dependencies or null */ |
84 | enum edge_type_e { |
85 | EDGE_NULL = 0, |
86 | EDGE_PRE_DEPENDS = 1, |
87 | EDGE_OR_PRE_DEPENDS = 2, |
88 | EDGE_DEPENDS = 3, |
89 | EDGE_OR_DEPENDS = 4, |
90 | EDGE_REPLACES = 5, |
91 | EDGE_PROVIDES = 7, |
92 | EDGE_CONFLICTS = 9, |
93 | EDGE_SUGGESTS = 11, |
94 | EDGE_RECOMMENDS = 13, |
95 | EDGE_ENHANCES = 15 |
96 | }; |
97 | enum operator_e { |
98 | VER_NULL = 0, |
99 | VER_EQUAL = 1, |
100 | VER_LESS = 2, |
101 | VER_LESS_EQUAL = 3, |
102 | VER_MORE = 4, |
103 | VER_MORE_EQUAL = 5, |
104 | VER_ANY = 6 |
105 | }; |
106 | |
107 | typedef struct deb_file_s { |
108 | char *control_file; |
109 | char *filename; |
110 | unsigned package:14; |
111 | } deb_file_t; |
112 | |
113 | |
114 | static void make_hash(const char *key, unsigned *start, unsigned *decrement, const int hash_prime) |
115 | { |
116 | unsigned long int hash_num = key[0]; |
117 | int len = strlen(key); |
118 | int i; |
119 | |
120 | /* Maybe i should have uses a "proper" hashing algorithm here instead |
121 | * of making one up myself, seems to be working ok though. */ |
122 | for (i = 1; i < len; i++) { |
123 | /* shifts the ascii based value and adds it to previous value |
124 | * shift amount is mod 24 because long int is 32 bit and data |
125 | * to be shifted is 8, don't want to shift data to where it has |
126 | * no effect*/ |
127 | hash_num += ((key[i] + key[i-1]) << ((key[i] * i) % 24)); |
128 | } |
129 | *start = (unsigned) hash_num % hash_prime; |
130 | *decrement = (unsigned) 1 + (hash_num % (hash_prime - 1)); |
131 | } |
132 | |
133 | /* this adds the key to the hash table */ |
134 | static int search_name_hashtable(const char *key) |
135 | { |
136 | unsigned probe_address = 0; |
137 | unsigned probe_decrement = 0; |
138 | |
139 | make_hash(key, &probe_address, &probe_decrement, NAME_HASH_PRIME); |
140 | while (name_hashtable[probe_address] != NULL) { |
141 | if (strcmp(name_hashtable[probe_address], key) == 0) { |
142 | return probe_address; |
143 | } |
144 | probe_address -= probe_decrement; |
145 | if ((int)probe_address < 0) { |
146 | probe_address += NAME_HASH_PRIME; |
147 | } |
148 | } |
149 | name_hashtable[probe_address] = xstrdup(key); |
150 | return probe_address; |
151 | } |
152 | |
153 | /* this DOESNT add the key to the hashtable |
154 | * TODO make it consistent with search_name_hashtable |
155 | */ |
156 | static unsigned search_status_hashtable(const char *key) |
157 | { |
158 | unsigned probe_address = 0; |
159 | unsigned probe_decrement = 0; |
160 | |
161 | make_hash(key, &probe_address, &probe_decrement, STATUS_HASH_PRIME); |
162 | while (status_hashtable[probe_address] != NULL) { |
163 | if (strcmp(key, name_hashtable[package_hashtable[status_hashtable[probe_address]->package]->name]) == 0) { |
164 | break; |
165 | } |
166 | probe_address -= probe_decrement; |
167 | if ((int)probe_address < 0) { |
168 | probe_address += STATUS_HASH_PRIME; |
169 | } |
170 | } |
171 | return probe_address; |
172 | } |
173 | |
174 | /* Need to rethink version comparison, maybe the official dpkg has something i can use ? */ |
175 | static int version_compare_part(const char *version1, const char *version2) |
176 | { |
177 | int upstream_len1 = 0; |
178 | int upstream_len2 = 0; |
179 | char *name1_char; |
180 | char *name2_char; |
181 | int len1 = 0; |
182 | int len2 = 0; |
183 | int tmp_int; |
184 | int ver_num1; |
185 | int ver_num2; |
186 | |
187 | if (version1 == NULL) { |
188 | version1 = xstrdup(""); |
189 | } |
190 | if (version2 == NULL) { |
191 | version2 = xstrdup(""); |
192 | } |
193 | upstream_len1 = strlen(version1); |
194 | upstream_len2 = strlen(version2); |
195 | |
196 | while ((len1 < upstream_len1) || (len2 < upstream_len2)) { |
197 | /* Compare non-digit section */ |
198 | tmp_int = strcspn(&version1[len1], "0123456789"); |
199 | name1_char = xstrndup(&version1[len1], tmp_int); |
200 | len1 += tmp_int; |
201 | tmp_int = strcspn(&version2[len2], "0123456789"); |
202 | name2_char = xstrndup(&version2[len2], tmp_int); |
203 | len2 += tmp_int; |
204 | tmp_int = strcmp(name1_char, name2_char); |
205 | free(name1_char); |
206 | free(name2_char); |
207 | if (tmp_int != 0) { |
208 | return tmp_int; |
209 | } |
210 | |
211 | /* Compare digits */ |
212 | tmp_int = strspn(&version1[len1], "0123456789"); |
213 | name1_char = xstrndup(&version1[len1], tmp_int); |
214 | len1 += tmp_int; |
215 | tmp_int = strspn(&version2[len2], "0123456789"); |
216 | name2_char = xstrndup(&version2[len2], tmp_int); |
217 | len2 += tmp_int; |
218 | ver_num1 = atoi(name1_char); |
219 | ver_num2 = atoi(name2_char); |
220 | free(name1_char); |
221 | free(name2_char); |
222 | if (ver_num1 < ver_num2) { |
223 | return -1; |
224 | } |
225 | if (ver_num1 > ver_num2) { |
226 | return 1; |
227 | } |
228 | } |
229 | return 0; |
230 | } |
231 | |
232 | /* if ver1 < ver2 return -1, |
233 | * if ver1 = ver2 return 0, |
234 | * if ver1 > ver2 return 1, |
235 | */ |
236 | static int version_compare(const unsigned ver1, const unsigned ver2) |
237 | { |
238 | char *ch_ver1 = name_hashtable[ver1]; |
239 | char *ch_ver2 = name_hashtable[ver2]; |
240 | |
241 | char epoch1, epoch2; |
242 | char *deb_ver1, *deb_ver2; |
243 | char *ver1_ptr, *ver2_ptr; |
244 | char *upstream_ver1; |
245 | char *upstream_ver2; |
246 | int result; |
247 | |
248 | /* Compare epoch */ |
249 | if (ch_ver1[1] == ':') { |
250 | epoch1 = ch_ver1[0]; |
251 | ver1_ptr = strchr(ch_ver1, ':') + 1; |
252 | } else { |
253 | epoch1 = '0'; |
254 | ver1_ptr = ch_ver1; |
255 | } |
256 | if (ch_ver2[1] == ':') { |
257 | epoch2 = ch_ver2[0]; |
258 | ver2_ptr = strchr(ch_ver2, ':') + 1; |
259 | } else { |
260 | epoch2 = '0'; |
261 | ver2_ptr = ch_ver2; |
262 | } |
263 | if (epoch1 < epoch2) { |
264 | return -1; |
265 | } |
266 | else if (epoch1 > epoch2) { |
267 | return 1; |
268 | } |
269 | |
270 | /* Compare upstream version */ |
271 | upstream_ver1 = xstrdup(ver1_ptr); |
272 | upstream_ver2 = xstrdup(ver2_ptr); |
273 | |
274 | /* Chop off debian version, and store for later use */ |
275 | deb_ver1 = strrchr(upstream_ver1, '-'); |
276 | deb_ver2 = strrchr(upstream_ver2, '-'); |
277 | if (deb_ver1) { |
278 | deb_ver1[0] = '\0'; |
279 | deb_ver1++; |
280 | } |
281 | if (deb_ver2) { |
282 | deb_ver2[0] = '\0'; |
283 | deb_ver2++; |
284 | } |
285 | result = version_compare_part(upstream_ver1, upstream_ver2); |
286 | if (!result) |
287 | /* Compare debian versions */ |
288 | result = version_compare_part(deb_ver1, deb_ver2); |
289 | |
290 | free(upstream_ver1); |
291 | free(upstream_ver2); |
292 | return result; |
293 | } |
294 | |
295 | static int test_version(const unsigned version1, const unsigned version2, const unsigned operator) |
296 | { |
297 | const int version_result = version_compare(version1, version2); |
298 | switch (operator) { |
299 | case VER_ANY: |
300 | return TRUE; |
301 | case VER_EQUAL: |
302 | return (version_result == 0); |
303 | case VER_LESS: |
304 | return (version_result < 0); |
305 | case VER_LESS_EQUAL: |
306 | return (version_result <= 0); |
307 | case VER_MORE: |
308 | return (version_result > 0); |
309 | case VER_MORE_EQUAL: |
310 | return (version_result >= 0); |
311 | } |
312 | return FALSE; |
313 | } |
314 | |
315 | |
316 | static int search_package_hashtable(const unsigned name, const unsigned version, const unsigned operator) |
317 | { |
318 | unsigned probe_address = 0; |
319 | unsigned probe_decrement = 0; |
320 | |
321 | make_hash(name_hashtable[name], &probe_address, &probe_decrement, PACKAGE_HASH_PRIME); |
322 | while (package_hashtable[probe_address] != NULL) { |
323 | if (package_hashtable[probe_address]->name == name) { |
324 | if (operator == VER_ANY) { |
325 | return probe_address; |
326 | } |
327 | if (test_version(package_hashtable[probe_address]->version, version, operator)) { |
328 | return probe_address; |
329 | } |
330 | } |
331 | probe_address -= probe_decrement; |
332 | if ((int)probe_address < 0) { |
333 | probe_address += PACKAGE_HASH_PRIME; |
334 | } |
335 | } |
336 | return probe_address; |
337 | } |
338 | |
339 | /* |
340 | * This function searches through the entire package_hashtable looking |
341 | * for a package which provides "needle". It returns the index into |
342 | * the package_hashtable for the providing package. |
343 | * |
344 | * needle is the index into name_hashtable of the package we are |
345 | * looking for. |
346 | * |
347 | * start_at is the index in the package_hashtable to start looking |
348 | * at. If start_at is -1 then start at the beginning. This is to allow |
349 | * for repeated searches since more than one package might provide |
350 | * needle. |
351 | * |
352 | * FIXME: I don't think this is very efficient, but I thought I'd keep |
353 | * it simple for now until it proves to be a problem. |
354 | */ |
355 | static int search_for_provides(int needle, int start_at) { |
356 | int i, j; |
357 | common_node_t *p; |
358 | for (i = start_at + 1; i < PACKAGE_HASH_PRIME; i++) { |
359 | p = package_hashtable[i]; |
360 | if (p == NULL) |
361 | continue; |
362 | for (j = 0; j < p->num_of_edges; j++) |
363 | if (p->edge[j]->type == EDGE_PROVIDES && p->edge[j]->name == needle) |
364 | return i; |
365 | } |
366 | return -1; |
367 | } |
368 | |
369 | /* |
370 | * Add an edge to a node |
371 | */ |
372 | static void add_edge_to_node(common_node_t *node, edge_t *edge) |
373 | { |
374 | node->num_of_edges++; |
375 | node->edge = xrealloc(node->edge, sizeof(edge_t) * (node->num_of_edges + 1)); |
376 | node->edge[node->num_of_edges - 1] = edge; |
377 | } |
378 | |
379 | /* |
380 | * Create one new node and one new edge for every dependency. |
381 | * |
382 | * Dependencies which contain multiple alternatives are represented as |
383 | * an EDGE_OR_PRE_DEPENDS or EDGE_OR_DEPENDS node, followed by a |
384 | * number of EDGE_PRE_DEPENDS or EDGE_DEPENDS nodes. The name field of |
385 | * the OR edge contains the full dependency string while the version |
386 | * field contains the number of EDGE nodes which follow as part of |
387 | * this alternative. |
388 | */ |
389 | static void add_split_dependencies(common_node_t *parent_node, const char *whole_line, unsigned edge_type) |
390 | { |
391 | char *line = xstrdup(whole_line); |
392 | char *line2; |
393 | char *line_ptr1 = NULL; |
394 | char *line_ptr2 = NULL; |
395 | char *field; |
396 | char *field2; |
397 | char *version; |
398 | edge_t *edge; |
399 | edge_t *or_edge; |
400 | int offset_ch; |
401 | |
402 | field = strtok_r(line, ",", &line_ptr1); |
403 | do { |
404 | /* skip leading spaces */ |
405 | field += strspn(field, " "); |
406 | line2 = xstrdup(field); |
407 | field2 = strtok_r(line2, "|", &line_ptr2); |
408 | or_edge = NULL; |
409 | if ((edge_type == EDGE_DEPENDS || edge_type == EDGE_PRE_DEPENDS) |
410 | && (strcmp(field, field2) != 0) |
411 | ) { |
412 | or_edge = xmalloc(sizeof(edge_t)); |
413 | or_edge->type = edge_type + 1; |
414 | or_edge->name = search_name_hashtable(field); |
415 | or_edge->version = 0; // tracks the number of altenatives |
416 | add_edge_to_node(parent_node, or_edge); |
417 | } |
418 | |
419 | do { |
420 | edge = xmalloc(sizeof(edge_t)); |
421 | edge->type = edge_type; |
422 | |
423 | /* Skip any extra leading spaces */ |
424 | field2 += strspn(field2, " "); |
425 | |
426 | /* Get dependency version info */ |
427 | version = strchr(field2, '('); |
428 | if (version == NULL) { |
429 | edge->operator = VER_ANY; |
430 | /* Get the versions hash number, adding it if the number isnt already in there */ |
431 | edge->version = search_name_hashtable("ANY"); |
432 | } else { |
433 | /* Skip leading ' ' or '(' */ |
434 | version += strspn(field2, " ("); |
435 | /* Calculate length of any operator characters */ |
436 | offset_ch = strspn(version, "<=>"); |
437 | /* Determine operator */ |
438 | if (offset_ch > 0) { |
439 | if (strncmp(version, "=", offset_ch) == 0) { |
440 | edge->operator = VER_EQUAL; |
441 | } |
442 | else if (strncmp(version, "<<", offset_ch) == 0) { |
443 | edge->operator = VER_LESS; |
444 | } |
445 | else if (strncmp(version, "<=", offset_ch) == 0) { |
446 | edge->operator = VER_LESS_EQUAL; |
447 | } |
448 | else if (strncmp(version, ">>", offset_ch) == 0) { |
449 | edge->operator = VER_MORE; |
450 | } |
451 | else if (strncmp(version, ">=", offset_ch) == 0) { |
452 | edge->operator = VER_MORE_EQUAL; |
453 | } else { |
454 | bb_error_msg_and_die("illegal operator"); |
455 | } |
456 | } |
457 | /* skip to start of version numbers */ |
458 | version += offset_ch; |
459 | version += strspn(version, " "); |
460 | |
461 | /* Truncate version at trailing ' ' or ')' */ |
462 | version[strcspn(version, " )")] = '\0'; |
463 | /* Get the versions hash number, adding it if the number isnt already in there */ |
464 | edge->version = search_name_hashtable(version); |
465 | } |
466 | |
467 | /* Get the dependency name */ |
468 | field2[strcspn(field2, " (")] = '\0'; |
469 | edge->name = search_name_hashtable(field2); |
470 | |
471 | if (or_edge) |
472 | or_edge->version++; |
473 | |
474 | add_edge_to_node(parent_node, edge); |
475 | } while ((field2 = strtok_r(NULL, "|", &line_ptr2)) != NULL); |
476 | free(line2); |
477 | } while ((field = strtok_r(NULL, ",", &line_ptr1)) != NULL); |
478 | free(line); |
479 | } |
480 | |
481 | static void free_package(common_node_t *node) |
482 | { |
483 | unsigned i; |
484 | if (node) { |
485 | for (i = 0; i < node->num_of_edges; i++) { |
486 | free(node->edge[i]); |
487 | } |
488 | free(node->edge); |
489 | free(node); |
490 | } |
491 | } |
492 | |
493 | /* |
494 | * Gets the next package field from package_buffer, seperated into the field name |
495 | * and field value, it returns the int offset to the first character of the next field |
496 | */ |
497 | static int read_package_field(const char *package_buffer, char **field_name, char **field_value) |
498 | { |
499 | int offset_name_start = 0; |
500 | int offset_name_end = 0; |
501 | int offset_value_start = 0; |
502 | int offset_value_end = 0; |
503 | int offset = 0; |
504 | int next_offset; |
505 | int name_length; |
506 | int value_length; |
507 | int exit_flag = FALSE; |
508 | |
509 | if (package_buffer == NULL) { |
510 | *field_name = NULL; |
511 | *field_value = NULL; |
512 | return -1; |
513 | } |
514 | while (1) { |
515 | next_offset = offset + 1; |
516 | switch (package_buffer[offset]) { |
517 | case '\0': |
518 | exit_flag = TRUE; |
519 | break; |
520 | case ':': |
521 | if (offset_name_end == 0) { |
522 | offset_name_end = offset; |
523 | offset_value_start = next_offset; |
524 | } |
525 | /* TODO: Name might still have trailing spaces if ':' isnt |
526 | * immediately after name */ |
527 | break; |
528 | case '\n': |
529 | /* TODO: The char next_offset may be out of bounds */ |
530 | if (package_buffer[next_offset] != ' ') { |
531 | exit_flag = TRUE; |
532 | break; |
533 | } |
534 | case '\t': |
535 | case ' ': |
536 | /* increment the value start point if its a just filler */ |
537 | if (offset_name_start == offset) { |
538 | offset_name_start++; |
539 | } |
540 | if (offset_value_start == offset) { |
541 | offset_value_start++; |
542 | } |
543 | break; |
544 | } |
545 | if (exit_flag) { |
546 | /* Check that the names are valid */ |
547 | offset_value_end = offset; |
548 | name_length = offset_name_end - offset_name_start; |
549 | value_length = offset_value_end - offset_value_start; |
550 | if (name_length == 0) { |
551 | break; |
552 | } |
553 | if ((name_length > 0) && (value_length > 0)) { |
554 | break; |
555 | } |
556 | |
557 | /* If not valid, start fresh with next field */ |
558 | exit_flag = FALSE; |
559 | offset_name_start = offset + 1; |
560 | offset_name_end = 0; |
561 | offset_value_start = offset + 1; |
562 | offset_value_end = offset + 1; |
563 | offset++; |
564 | } |
565 | offset++; |
566 | } |
567 | *field_name = NULL; |
568 | if (name_length) { |
569 | *field_name = xstrndup(&package_buffer[offset_name_start], name_length); |
570 | } |
571 | *field_value = NULL; |
572 | if (value_length > 0) { |
573 | *field_value = xstrndup(&package_buffer[offset_value_start], value_length); |
574 | } |
575 | return next_offset; |
576 | } |
577 | |
578 | static unsigned fill_package_struct(char *control_buffer) |
579 | { |
580 | static const char *const field_names[] = { "Package", "Version", |
581 | "Pre-Depends", "Depends","Replaces", "Provides", |
582 | "Conflicts", "Suggests", "Recommends", "Enhances", 0 |
583 | }; |
584 | |
585 | common_node_t *new_node = xzalloc(sizeof(common_node_t)); |
586 | char *field_name; |
587 | char *field_value; |
588 | int field_start = 0; |
589 | int num = -1; |
590 | int buffer_length = strlen(control_buffer); |
591 | |
592 | new_node->version = search_name_hashtable("unknown"); |
593 | while (field_start < buffer_length) { |
594 | unsigned field_num; |
595 | |
596 | field_start += read_package_field(&control_buffer[field_start], |
597 | &field_name, &field_value); |
598 | |
599 | if (field_name == NULL) { |
600 | goto fill_package_struct_cleanup; /* Oh no, the dreaded goto statement ! */ |
601 | } |
602 | |
603 | field_num = index_in_str_array(field_names, field_name); |
604 | switch (field_num) { |
605 | case 0: /* Package */ |
606 | new_node->name = search_name_hashtable(field_value); |
607 | break; |
608 | case 1: /* Version */ |
609 | new_node->version = search_name_hashtable(field_value); |
610 | break; |
611 | case 2: /* Pre-Depends */ |
612 | add_split_dependencies(new_node, field_value, EDGE_PRE_DEPENDS); |
613 | break; |
614 | case 3: /* Depends */ |
615 | add_split_dependencies(new_node, field_value, EDGE_DEPENDS); |
616 | break; |
617 | case 4: /* Replaces */ |
618 | add_split_dependencies(new_node, field_value, EDGE_REPLACES); |
619 | break; |
620 | case 5: /* Provides */ |
621 | add_split_dependencies(new_node, field_value, EDGE_PROVIDES); |
622 | break; |
623 | case 6: /* Conflicts */ |
624 | add_split_dependencies(new_node, field_value, EDGE_CONFLICTS); |
625 | break; |
626 | case 7: /* Suggests */ |
627 | add_split_dependencies(new_node, field_value, EDGE_SUGGESTS); |
628 | break; |
629 | case 8: /* Recommends */ |
630 | add_split_dependencies(new_node, field_value, EDGE_RECOMMENDS); |
631 | break; |
632 | case 9: /* Enhances */ |
633 | add_split_dependencies(new_node, field_value, EDGE_ENHANCES); |
634 | break; |
635 | } |
636 | fill_package_struct_cleanup: |
637 | free(field_name); |
638 | free(field_value); |
639 | } |
640 | |
641 | if (new_node->version == search_name_hashtable("unknown")) { |
642 | free_package(new_node); |
643 | return -1; |
644 | } |
645 | num = search_package_hashtable(new_node->name, new_node->version, VER_EQUAL); |
646 | if (package_hashtable[num] == NULL) { |
647 | package_hashtable[num] = new_node; |
648 | } else { |
649 | free_package(new_node); |
650 | } |
651 | return num; |
652 | } |
653 | |
654 | /* if num = 1, it returns the want status, 2 returns flag, 3 returns status */ |
655 | static unsigned get_status(const unsigned status_node, const int num) |
656 | { |
657 | char *status_string = name_hashtable[status_hashtable[status_node]->status]; |
658 | char *state_sub_string; |
659 | unsigned state_sub_num; |
660 | int len; |
661 | int i; |
662 | |
663 | /* set tmp_string to point to the start of the word number */ |
664 | for (i = 1; i < num; i++) { |
665 | /* skip past a word */ |
666 | status_string += strcspn(status_string, " "); |
667 | /* skip past the separating spaces */ |
668 | status_string += strspn(status_string, " "); |
669 | } |
670 | len = strcspn(status_string, " \n"); |
671 | state_sub_string = xstrndup(status_string, len); |
672 | state_sub_num = search_name_hashtable(state_sub_string); |
673 | free(state_sub_string); |
674 | return state_sub_num; |
675 | } |
676 | |
677 | static void set_status(const unsigned status_node_num, const char *new_value, const int position) |
678 | { |
679 | const unsigned new_value_len = strlen(new_value); |
680 | const unsigned new_value_num = search_name_hashtable(new_value); |
681 | unsigned want = get_status(status_node_num, 1); |
682 | unsigned flag = get_status(status_node_num, 2); |
683 | unsigned status = get_status(status_node_num, 3); |
684 | int want_len = strlen(name_hashtable[want]); |
685 | int flag_len = strlen(name_hashtable[flag]); |
686 | int status_len = strlen(name_hashtable[status]); |
687 | char *new_status; |
688 | |
689 | switch (position) { |
690 | case 1: |
691 | want = new_value_num; |
692 | want_len = new_value_len; |
693 | break; |
694 | case 2: |
695 | flag = new_value_num; |
696 | flag_len = new_value_len; |
697 | break; |
698 | case 3: |
699 | status = new_value_num; |
700 | status_len = new_value_len; |
701 | break; |
702 | default: |
703 | bb_error_msg_and_die("DEBUG ONLY: this shouldnt happen"); |
704 | } |
705 | |
706 | new_status = xasprintf("%s %s %s", name_hashtable[want], name_hashtable[flag], name_hashtable[status]); |
707 | status_hashtable[status_node_num]->status = search_name_hashtable(new_status); |
708 | free(new_status); |
709 | return; |
710 | } |
711 | |
712 | static const char *describe_status(int status_num) { |
713 | int status_want, status_state ; |
714 | if (status_hashtable[status_num] == NULL || status_hashtable[status_num]->status == 0) |
715 | return "is not installed or flagged to be installed\n"; |
716 | |
717 | status_want = get_status(status_num, 1); |
718 | status_state = get_status(status_num, 3); |
719 | |
720 | if (status_state == search_name_hashtable("installed")) { |
721 | if (status_want == search_name_hashtable("install")) |
722 | return "is installed"; |
723 | if (status_want == search_name_hashtable("deinstall")) |
724 | return "is marked to be removed"; |
725 | if (status_want == search_name_hashtable("purge")) |
726 | return "is marked to be purged"; |
727 | } |
728 | if (status_want == search_name_hashtable("unknown")) |
729 | return "is in an indeterminate state"; |
730 | if (status_want == search_name_hashtable("install")) |
731 | return "is marked to be installed"; |
732 | |
733 | return "is not installed or flagged to be installed"; |
734 | } |
735 | |
736 | |
737 | static void index_status_file(const char *filename) |
738 | { |
739 | FILE *status_file; |
740 | char *control_buffer; |
741 | char *status_line; |
742 | status_node_t *status_node = NULL; |
743 | unsigned status_num; |
744 | |
745 | status_file = xfopen(filename, "r"); |
746 | while ((control_buffer = xmalloc_fgets_str(status_file, "\n\n")) != NULL) { |
747 | const unsigned package_num = fill_package_struct(control_buffer); |
748 | if (package_num != -1) { |
749 | status_node = xmalloc(sizeof(status_node_t)); |
750 | /* fill_package_struct doesnt handle the status field */ |
751 | status_line = strstr(control_buffer, "Status:"); |
752 | if (status_line != NULL) { |
753 | status_line += 7; |
754 | status_line += strspn(status_line, " \n\t"); |
755 | status_line = xstrndup(status_line, strcspn(status_line, "\n")); |
756 | status_node->status = search_name_hashtable(status_line); |
757 | free(status_line); |
758 | } |
759 | status_node->package = package_num; |
760 | status_num = search_status_hashtable(name_hashtable[package_hashtable[status_node->package]->name]); |
761 | status_hashtable[status_num] = status_node; |
762 | } |
763 | free(control_buffer); |
764 | } |
765 | fclose(status_file); |
766 | return; |
767 | } |
768 | |
769 | static void write_buffer_no_status(FILE *new_status_file, const char *control_buffer) |
770 | { |
771 | char *name; |
772 | char *value; |
773 | int start = 0; |
774 | while (1) { |
775 | start += read_package_field(&control_buffer[start], &name, &value); |
776 | if (name == NULL) { |
777 | break; |
778 | } |
779 | if (strcmp(name, "Status") != 0) { |
780 | fprintf(new_status_file, "%s: %s\n", name, value); |
781 | } |
782 | } |
783 | return; |
784 | } |
785 | |
786 | /* This could do with a cleanup */ |
787 | static void write_status_file(deb_file_t **deb_file) |
788 | { |
789 | FILE *old_status_file = xfopen("/var/lib/dpkg/status", "r"); |
790 | FILE *new_status_file = xfopen("/var/lib/dpkg/status.udeb", "w"); |
791 | char *package_name; |
792 | char *status_from_file; |
793 | char *control_buffer = NULL; |
794 | char *tmp_string; |
795 | int status_num; |
796 | int field_start = 0; |
797 | int write_flag; |
798 | int i = 0; |
799 | |
800 | /* Update previously known packages */ |
801 | while ((control_buffer = xmalloc_fgets_str(old_status_file, "\n\n")) != NULL) { |
802 | if ((tmp_string = strstr(control_buffer, "Package:")) == NULL) { |
803 | continue; |
804 | } |
805 | |
806 | tmp_string += 8; |
807 | tmp_string += strspn(tmp_string, " \n\t"); |
808 | package_name = xstrndup(tmp_string, strcspn(tmp_string, "\n")); |
809 | write_flag = FALSE; |
810 | tmp_string = strstr(control_buffer, "Status:"); |
811 | if (tmp_string != NULL) { |
812 | /* Seperate the status value from the control buffer */ |
813 | tmp_string += 7; |
814 | tmp_string += strspn(tmp_string, " \n\t"); |
815 | status_from_file = xstrndup(tmp_string, strcspn(tmp_string, "\n")); |
816 | } else { |
817 | status_from_file = NULL; |
818 | } |
819 | |
820 | /* Find this package in the status hashtable */ |
821 | status_num = search_status_hashtable(package_name); |
822 | if (status_hashtable[status_num] != NULL) { |
823 | const char *status_from_hashtable = name_hashtable[status_hashtable[status_num]->status]; |
824 | if (strcmp(status_from_file, status_from_hashtable) != 0) { |
825 | /* New status isnt exactly the same as old status */ |
826 | const int state_status = get_status(status_num, 3); |
827 | if ((strcmp("installed", name_hashtable[state_status]) == 0) || |
828 | (strcmp("unpacked", name_hashtable[state_status]) == 0)) { |
829 | /* We need to add the control file from the package */ |
830 | i = 0; |
831 | while (deb_file[i] != NULL) { |
832 | if (strcmp(package_name, name_hashtable[package_hashtable[deb_file[i]->package]->name]) == 0) { |
833 | /* Write a status file entry with a modified status */ |
834 | /* remove trailing \n's */ |
835 | write_buffer_no_status(new_status_file, deb_file[i]->control_file); |
836 | set_status(status_num, "ok", 2); |
837 | fprintf(new_status_file, "Status: %s\n\n", |
838 | name_hashtable[status_hashtable[status_num]->status]); |
839 | write_flag = TRUE; |
840 | break; |
841 | } |
842 | i++; |
843 | } |
844 | /* This is temperary, debugging only */ |
845 | if (deb_file[i] == NULL) { |
846 | bb_error_msg_and_die("ALERT: cannot find a control file, " |
847 | "your status file may be broken, status may be " |
848 | "incorrect for %s", package_name); |
849 | } |
850 | } |
851 | else if (strcmp("not-installed", name_hashtable[state_status]) == 0) { |
852 | /* Only write the Package, Status, Priority and Section lines */ |
853 | fprintf(new_status_file, "Package: %s\n", package_name); |
854 | fprintf(new_status_file, "Status: %s\n", status_from_hashtable); |
855 | |
856 | while (1) { |
857 | char *field_name; |
858 | char *field_value; |
859 | field_start += read_package_field(&control_buffer[field_start], &field_name, &field_value); |
860 | if (field_name == NULL) { |
861 | break; |
862 | } |
863 | if ((strcmp(field_name, "Priority") == 0) || |
864 | (strcmp(field_name, "Section") == 0)) { |
865 | fprintf(new_status_file, "%s: %s\n", field_name, field_value); |
866 | } |
867 | } |
868 | write_flag = TRUE; |
869 | fputs("\n", new_status_file); |
870 | } |
871 | else if (strcmp("config-files", name_hashtable[state_status]) == 0) { |
872 | /* only change the status line */ |
873 | while (1) { |
874 | char *field_name; |
875 | char *field_value; |
876 | field_start += read_package_field(&control_buffer[field_start], &field_name, &field_value); |
877 | if (field_name == NULL) { |
878 | break; |
879 | } |
880 | /* Setup start point for next field */ |
881 | if (strcmp(field_name, "Status") == 0) { |
882 | fprintf(new_status_file, "Status: %s\n", status_from_hashtable); |
883 | } else { |
884 | fprintf(new_status_file, "%s: %s\n", field_name, field_value); |
885 | } |
886 | } |
887 | write_flag = TRUE; |
888 | fputs("\n", new_status_file); |
889 | } |
890 | } |
891 | } |
892 | /* If the package from the status file wasnt handle above, do it now*/ |
893 | if (! write_flag) { |
894 | fprintf(new_status_file, "%s\n\n", control_buffer); |
895 | } |
896 | |
897 | free(status_from_file); |
898 | free(package_name); |
899 | free(control_buffer); |
900 | } |
901 | |
902 | /* Write any new packages */ |
903 | for (i = 0; deb_file[i] != NULL; i++) { |
904 | status_num = search_status_hashtable(name_hashtable[package_hashtable[deb_file[i]->package]->name]); |
905 | if (strcmp("reinstreq", name_hashtable[get_status(status_num, 2)]) == 0) { |
906 | write_buffer_no_status(new_status_file, deb_file[i]->control_file); |
907 | set_status(status_num, "ok", 2); |
908 | fprintf(new_status_file, "Status: %s\n\n", name_hashtable[status_hashtable[status_num]->status]); |
909 | } |
910 | } |
911 | fclose(old_status_file); |
912 | fclose(new_status_file); |
913 | |
914 | |
915 | /* Create a separate backfile to dpkg */ |
916 | if (rename("/var/lib/dpkg/status", "/var/lib/dpkg/status.udeb.bak") == -1) { |
917 | struct stat stat_buf; |
918 | xstat("/var/lib/dpkg/status", &stat_buf); |
919 | /* Its ok if renaming the status file fails because status |
920 | * file doesnt exist, maybe we are starting from scratch */ |
921 | bb_error_msg("no status file found, creating new one"); |
922 | } |
923 | |
924 | if (rename("/var/lib/dpkg/status.udeb", "/var/lib/dpkg/status") == -1) { |
925 | bb_error_msg_and_die("DANGER: cannot create status file, " |
926 | "you need to manually repair your status file"); |
927 | } |
928 | } |
929 | |
930 | /* This function returns TRUE if the given package can satisfy a |
931 | * dependency of type depend_type. |
932 | * |
933 | * A pre-depends is satisfied only if a package is already installed, |
934 | * which a regular depends can be satisfied by a package which we want |
935 | * to install. |
936 | */ |
937 | static int package_satisfies_dependency(int package, int depend_type) |
938 | { |
939 | int status_num = search_status_hashtable(name_hashtable[package_hashtable[package]->name]); |
940 | |
941 | /* status could be unknown if package is a pure virtual |
942 | * provides which cannot satisfy any dependency by itself. |
943 | */ |
944 | if (status_hashtable[status_num] == NULL) |
945 | return 0; |
946 | |
947 | switch (depend_type) { |
948 | case EDGE_PRE_DEPENDS: return get_status(status_num, 3) == search_name_hashtable("installed"); |
949 | case EDGE_DEPENDS: return get_status(status_num, 1) == search_name_hashtable("install"); |
950 | } |
951 | return 0; |
952 | } |
953 | |
954 | static int check_deps(deb_file_t **deb_file, int deb_start, int dep_max_count) |
955 | { |
956 | int *conflicts = NULL; |
957 | int conflicts_num = 0; |
958 | int i = deb_start; |
959 | int j; |
960 | |
961 | /* Check for conflicts |
962 | * TODO: TEST if conflicts with other packages to be installed |
963 | * |
964 | * Add install packages and the packages they provide |
965 | * to the list of files to check conflicts for |
966 | */ |
967 | |
968 | /* Create array of package numbers to check against |
969 | * installed package for conflicts*/ |
970 | while (deb_file[i] != NULL) { |
971 | const unsigned package_num = deb_file[i]->package; |
972 | conflicts = xrealloc(conflicts, sizeof(int) * (conflicts_num + 1)); |
973 | conflicts[conflicts_num] = package_num; |
974 | conflicts_num++; |
975 | /* add provides to conflicts list */ |
976 | for (j = 0; j < package_hashtable[package_num]->num_of_edges; j++) { |
977 | if (package_hashtable[package_num]->edge[j]->type == EDGE_PROVIDES) { |
978 | const int conflicts_package_num = search_package_hashtable( |
979 | package_hashtable[package_num]->edge[j]->name, |
980 | package_hashtable[package_num]->edge[j]->version, |
981 | package_hashtable[package_num]->edge[j]->operator); |
982 | if (package_hashtable[conflicts_package_num] == NULL) { |
983 | /* create a new package */ |
984 | common_node_t *new_node = xzalloc(sizeof(common_node_t)); |
985 | new_node->name = package_hashtable[package_num]->edge[j]->name; |
986 | new_node->version = package_hashtable[package_num]->edge[j]->version; |
987 | package_hashtable[conflicts_package_num] = new_node; |
988 | } |
989 | conflicts = xrealloc(conflicts, sizeof(int) * (conflicts_num + 1)); |
990 | conflicts[conflicts_num] = conflicts_package_num; |
991 | conflicts_num++; |
992 | } |
993 | } |
994 | i++; |
995 | } |
996 | |
997 | /* Check conflicts */ |
998 | i = 0; |
999 | while (deb_file[i] != NULL) { |
1000 | const common_node_t *package_node = package_hashtable[deb_file[i]->package]; |
1001 | int status_num = 0; |
1002 | status_num = search_status_hashtable(name_hashtable[package_node->name]); |
1003 | |
1004 | if (get_status(status_num, 3) == search_name_hashtable("installed")) { |
1005 | i++; |
1006 | continue; |
1007 | } |
1008 | |
1009 | for (j = 0; j < package_node->num_of_edges; j++) { |
1010 | const edge_t *package_edge = package_node->edge[j]; |
1011 | |
1012 | if (package_edge->type == EDGE_CONFLICTS) { |
1013 | const unsigned package_num = |
1014 | search_package_hashtable(package_edge->name, |
1015 | package_edge->version, |
1016 | package_edge->operator); |
1017 | int result = 0; |
1018 | if (package_hashtable[package_num] != NULL) { |
1019 | status_num = search_status_hashtable(name_hashtable[package_hashtable[package_num]->name]); |
1020 | |
1021 | if (get_status(status_num, 1) == search_name_hashtable("install")) { |
1022 | result = test_version(package_hashtable[deb_file[i]->package]->version, |
1023 | package_edge->version, package_edge->operator); |
1024 | } |
1025 | } |
1026 | |
1027 | if (result) { |
1028 | bb_error_msg_and_die("package %s conflicts with %s", |
1029 | name_hashtable[package_node->name], |
1030 | name_hashtable[package_edge->name]); |
1031 | } |
1032 | } |
1033 | } |
1034 | i++; |
1035 | } |
1036 | |
1037 | |
1038 | /* Check dependendcies */ |
1039 | for (i = 0; i < PACKAGE_HASH_PRIME; i++) { |
1040 | int status_num = 0; |
1041 | int number_of_alternatives = 0; |
1042 | const edge_t * root_of_alternatives = NULL; |
1043 | const common_node_t *package_node = package_hashtable[i]; |
1044 | |
1045 | /* If the package node does not exist then this |
1046 | * package is a virtual one. In which case there are |
1047 | * no dependencies to check. |
1048 | */ |
1049 | if (package_node == NULL) continue; |
1050 | |
1051 | status_num = search_status_hashtable(name_hashtable[package_node->name]); |
1052 | |
1053 | /* If there is no status then this package is a |
1054 | * virtual one provided by something else. In which |
1055 | * case there are no dependencies to check. |
1056 | */ |
1057 | if (status_hashtable[status_num] == NULL) continue; |
1058 | |
1059 | /* If we don't want this package installed then we may |
1060 | * as well ignore it's dependencies. |
1061 | */ |
1062 | if (get_status(status_num, 1) != search_name_hashtable("install")) { |
1063 | continue; |
1064 | } |
1065 | |
1066 | /* This code is tested only for EDGE_DEPENDS, since I |
1067 | * have no suitable pre-depends available. There is no |
1068 | * reason that it shouldn't work though :-) |
1069 | */ |
1070 | for (j = 0; j < package_node->num_of_edges; j++) { |
1071 | const edge_t *package_edge = package_node->edge[j]; |
1072 | unsigned package_num; |
1073 | |
1074 | if (package_edge->type == EDGE_OR_PRE_DEPENDS || |
1075 | package_edge->type == EDGE_OR_DEPENDS) { /* start an EDGE_OR_ list */ |
1076 | number_of_alternatives = package_edge->version; |
1077 | root_of_alternatives = package_edge; |
1078 | continue; |
1079 | } else if (number_of_alternatives == 0) { /* not in the middle of an EDGE_OR_ list */ |
1080 | number_of_alternatives = 1; |
1081 | root_of_alternatives = NULL; |
1082 | } |
1083 | |
1084 | package_num = search_package_hashtable(package_edge->name, package_edge->version, package_edge->operator); |
1085 | |
1086 | if (package_edge->type == EDGE_PRE_DEPENDS || |
1087 | package_edge->type == EDGE_DEPENDS) { |
1088 | int result=1; |
1089 | status_num = 0; |
1090 | |
1091 | /* If we are inside an alternative then check |
1092 | * this edge is the right type. |
1093 | * |
1094 | * EDGE_DEPENDS == OR_DEPENDS -1 |
1095 | * EDGE_PRE_DEPENDS == OR_PRE_DEPENDS -1 |
1096 | */ |
1097 | if (root_of_alternatives && package_edge->type != root_of_alternatives->type - 1) |
1098 | bb_error_msg_and_die("fatal error, package dependencies corrupt: %d != %d - 1", |
1099 | package_edge->type, root_of_alternatives->type); |
1100 | |
1101 | if (package_hashtable[package_num] != NULL) |
1102 | result = !package_satisfies_dependency(package_num, package_edge->type); |
1103 | |
1104 | if (result) { /* check for other package which provide what we are looking for */ |
1105 | int provider = -1; |
1106 | |
1107 | while ((provider = search_for_provides(package_edge->name, provider)) > -1) { |
1108 | if (package_hashtable[provider] == NULL) { |
1109 | puts("Have a provider but no package information for it"); |
1110 | continue; |
1111 | } |
1112 | result = !package_satisfies_dependency(provider, package_edge->type); |
1113 | |
1114 | if (result == 0) |
1115 | break; |
1116 | } |
1117 | } |
1118 | |
1119 | /* It must be already installed, or to be installed */ |
1120 | number_of_alternatives--; |
1121 | if (result && number_of_alternatives == 0) { |
1122 | if (root_of_alternatives) |
1123 | bb_error_msg_and_die( |
1124 | "package %s %sdepends on %s, " |
1125 | "which cannot be satisfied", |
1126 | name_hashtable[package_node->name], |
1127 | package_edge->type == EDGE_PRE_DEPENDS ? "pre-" : "", |
1128 | name_hashtable[root_of_alternatives->name]); |
1129 | else |
1130 | bb_error_msg_and_die( |
1131 | "package %s %sdepends on %s, which %s\n", |
1132 | name_hashtable[package_node->name], |
1133 | package_edge->type == EDGE_PRE_DEPENDS ? "pre-" : "", |
1134 | name_hashtable[package_edge->name], |
1135 | describe_status(status_num)); |
1136 | } else if (result == 0 && number_of_alternatives) { |
1137 | /* we've found a package which |
1138 | * satisfies the dependency, |
1139 | * so skip over the rest of |
1140 | * the alternatives. |
1141 | */ |
1142 | j += number_of_alternatives; |
1143 | number_of_alternatives = 0; |
1144 | } |
1145 | } |
1146 | } |
1147 | } |
1148 | free(conflicts); |
1149 | return TRUE; |
1150 | } |
1151 | |
1152 | static char **create_list(const char *filename) |
1153 | { |
1154 | FILE *list_stream; |
1155 | char **file_list = NULL; |
1156 | char *line = NULL; |
1157 | int count = 0; |
1158 | |
1159 | /* don't use [xw]fopen here, handle error ourself */ |
1160 | list_stream = fopen(filename, "r"); |
1161 | if (list_stream == NULL) { |
1162 | return NULL; |
1163 | } |
1164 | |
1165 | while ((line = xmalloc_getline(list_stream)) != NULL) { |
1166 | file_list = xrealloc(file_list, sizeof(char *) * (count + 2)); |
1167 | file_list[count] = line; |
1168 | count++; |
1169 | } |
1170 | fclose(list_stream); |
1171 | |
1172 | if (count == 0) { |
1173 | return NULL; |
1174 | } else { |
1175 | file_list[count] = NULL; |
1176 | return file_list; |
1177 | } |
1178 | } |
1179 | |
1180 | /* maybe i should try and hook this into remove_file.c somehow */ |
1181 | static int remove_file_array(char **remove_names, char **exclude_names) |
1182 | { |
1183 | struct stat path_stat; |
1184 | int match_flag; |
1185 | int remove_flag = FALSE; |
1186 | int i,j; |
1187 | |
1188 | if (remove_names == NULL) { |
1189 | return FALSE; |
1190 | } |
1191 | for (i = 0; remove_names[i] != NULL; i++) { |
1192 | match_flag = FALSE; |
1193 | if (exclude_names != NULL) { |
1194 | for (j = 0; exclude_names[j] != 0; j++) { |
1195 | if (strcmp(remove_names[i], exclude_names[j]) == 0) { |
1196 | match_flag = TRUE; |
1197 | break; |
1198 | } |
1199 | } |
1200 | } |
1201 | if (!match_flag) { |
1202 | if (lstat(remove_names[i], &path_stat) < 0) { |
1203 | continue; |
1204 | } |
1205 | if (S_ISDIR(path_stat.st_mode)) { |
1206 | if (rmdir(remove_names[i]) != -1) { |
1207 | remove_flag = TRUE; |
1208 | } |
1209 | } else { |
1210 | if (unlink(remove_names[i]) != -1) { |
1211 | remove_flag = TRUE; |
1212 | } |
1213 | } |
1214 | } |
1215 | } |
1216 | return remove_flag; |
1217 | } |
1218 | |
1219 | static int run_package_script(const char *package_name, const char *script_type) |
1220 | { |
1221 | struct stat path_stat; |
1222 | char *script_path; |
1223 | int result; |
1224 | |
1225 | script_path = xasprintf("/var/lib/dpkg/info/%s.%s", package_name, script_type); |
1226 | |
1227 | /* If the file doesnt exist is isnt a fatal */ |
1228 | result = lstat(script_path, &path_stat) < 0 ? EXIT_SUCCESS : system(script_path); |
1229 | free(script_path); |
1230 | return result; |
1231 | } |
1232 | |
1233 | static const char *all_control_files[] = {"preinst", "postinst", "prerm", "postrm", |
1234 | "list", "md5sums", "shlibs", "conffiles", "config", "templates", NULL }; |
1235 | |
1236 | static char **all_control_list(const char *package_name) |
1237 | { |
1238 | unsigned i = 0; |
1239 | char **remove_files; |
1240 | |
1241 | /* Create a list of all /var/lib/dpkg/info/<package> files */ |
1242 | remove_files = xzalloc(sizeof(all_control_files)); |
1243 | while (all_control_files[i]) { |
1244 | remove_files[i] = xasprintf("/var/lib/dpkg/info/%s.%s", package_name, all_control_files[i]); |
1245 | i++; |
1246 | } |
1247 | |
1248 | return remove_files; |
1249 | } |
1250 | |
1251 | static void free_array(char **array) |
1252 | { |
1253 | |
1254 | if (array) { |
1255 | unsigned i = 0; |
1256 | while (array[i]) { |
1257 | free(array[i]); |
1258 | i++; |
1259 | } |
1260 | free(array); |
1261 | } |
1262 | } |
1263 | |
1264 | /* This function lists information on the installed packages. It loops through |
1265 | * the status_hashtable to retrieve the info. This results in smaller code than |
1266 | * scanning the status file. The resulting list, however, is unsorted. |
1267 | */ |
1268 | static void list_packages(void) |
1269 | { |
1270 | int i; |
1271 | |
1272 | puts(" Name Version"); |
1273 | puts("+++-==============-=============="); |
1274 | |
1275 | /* go through status hash, dereference package hash and finally strings */ |
1276 | for (i=0; i<STATUS_HASH_PRIME+1; i++) { |
1277 | |
1278 | if (status_hashtable[i]) { |
1279 | const char *stat_str; /* status string */ |
1280 | const char *name_str; /* package name */ |
1281 | const char *vers_str; /* version */ |
1282 | char s1, s2; /* status abbreviations */ |
1283 | int spccnt; /* space count */ |
1284 | int j; |
1285 | |
1286 | stat_str = name_hashtable[status_hashtable[i]->status]; |
1287 | name_str = name_hashtable[package_hashtable[status_hashtable[i]->package]->name]; |
1288 | vers_str = name_hashtable[package_hashtable[status_hashtable[i]->package]->version]; |
1289 | |
1290 | /* get abbreviation for status field 1 */ |
1291 | s1 = stat_str[0] == 'i' ? 'i' : 'r'; |
1292 | |
1293 | /* get abbreviation for status field 2 */ |
1294 | for (j=0, spccnt=0; stat_str[j] && spccnt<2; j++) { |
1295 | if (stat_str[j] == ' ') spccnt++; |
1296 | } |
1297 | s2 = stat_str[j]; |
1298 | |
1299 | /* print out the line formatted like Debian dpkg */ |
1300 | printf("%c%c %-14s %s\n", s1, s2, name_str, vers_str); |
1301 | } |
1302 | } |
1303 | } |
1304 | |
1305 | static void remove_package(const unsigned package_num, int noisy) |
1306 | { |
1307 | const char *package_name = name_hashtable[package_hashtable[package_num]->name]; |
1308 | const char *package_version = name_hashtable[package_hashtable[package_num]->version]; |
1309 | const unsigned status_num = search_status_hashtable(package_name); |
1310 | const int package_name_length = strlen(package_name); |
1311 | char **remove_files; |
1312 | char **exclude_files; |
1313 | char list_name[package_name_length + 25]; |
1314 | char conffile_name[package_name_length + 30]; |
1315 | int return_value; |
1316 | |
1317 | if (noisy) |
1318 | printf("Removing %s (%s)...\n", package_name, package_version); |
1319 | |
1320 | /* run prerm script */ |
1321 | return_value = run_package_script(package_name, "prerm"); |
1322 | if (return_value == -1) { |
1323 | bb_error_msg_and_die("script failed, prerm failure"); |
1324 | } |
1325 | |
1326 | /* Create a list of files to remove, and a separate list of those to keep */ |
1327 | sprintf(list_name, "/var/lib/dpkg/info/%s.list", package_name); |
1328 | remove_files = create_list(list_name); |
1329 | |
1330 | sprintf(conffile_name, "/var/lib/dpkg/info/%s.conffiles", package_name); |
1331 | exclude_files = create_list(conffile_name); |
1332 | |
1333 | /* Some directories can't be removed straight away, so do multiple passes */ |
1334 | while (remove_file_array(remove_files, exclude_files)) /*repeat */; |
1335 | free_array(exclude_files); |
1336 | free_array(remove_files); |
1337 | |
1338 | /* Create a list of files in /var/lib/dpkg/info/<package>.* to keep */ |
1339 | exclude_files = xzalloc(sizeof(char*) * 3); |
1340 | exclude_files[0] = xstrdup(conffile_name); |
1341 | exclude_files[1] = xasprintf("/var/lib/dpkg/info/%s.postrm", package_name); |
1342 | |
1343 | /* Create a list of all /var/lib/dpkg/info/<package> files */ |
1344 | remove_files = all_control_list(package_name); |
1345 | |
1346 | remove_file_array(remove_files, exclude_files); |
1347 | free_array(remove_files); |
1348 | free_array(exclude_files); |
1349 | |
1350 | /* rename <package>.conffile to <package>.list */ |
1351 | rename(conffile_name, list_name); |
1352 | |
1353 | /* Change package status */ |
1354 | set_status(status_num, "config-files", 3); |
1355 | } |
1356 | |
1357 | static void purge_package(const unsigned package_num) |
1358 | { |
1359 | const char *package_name = name_hashtable[package_hashtable[package_num]->name]; |
1360 | const char *package_version = name_hashtable[package_hashtable[package_num]->version]; |
1361 | const unsigned status_num = search_status_hashtable(package_name); |
1362 | char **remove_files; |
1363 | char **exclude_files; |
1364 | char list_name[strlen(package_name) + 25]; |
1365 | |
1366 | printf("Purging %s (%s)...\n", package_name, package_version); |
1367 | |
1368 | /* run prerm script */ |
1369 | if (run_package_script(package_name, "prerm") != 0) { |
1370 | bb_error_msg_and_die("script failed, prerm failure"); |
1371 | } |
1372 | |
1373 | /* Create a list of files to remove */ |
1374 | sprintf(list_name, "/var/lib/dpkg/info/%s.list", package_name); |
1375 | remove_files = create_list(list_name); |
1376 | |
1377 | exclude_files = xzalloc(sizeof(char*)); |
1378 | |
1379 | /* Some directories cant be removed straight away, so do multiple passes */ |
1380 | while (remove_file_array(remove_files, exclude_files)) /* repeat */; |
1381 | free_array(remove_files); |
1382 | |
1383 | /* Create a list of all /var/lib/dpkg/info/<package> files */ |
1384 | remove_files = all_control_list(package_name); |
1385 | remove_file_array(remove_files, exclude_files); |
1386 | free_array(remove_files); |
1387 | free(exclude_files); |
1388 | |
1389 | /* run postrm script */ |
1390 | if (run_package_script(package_name, "postrm") == -1) { |
1391 | bb_error_msg_and_die("postrm fialure.. set status to what?"); |
1392 | } |
1393 | |
1394 | /* Change package status */ |
1395 | set_status(status_num, "not-installed", 3); |
1396 | } |
1397 | |
1398 | static archive_handle_t *init_archive_deb_ar(const char *filename) |
1399 | { |
1400 | archive_handle_t *ar_handle; |
1401 | |
1402 | /* Setup an ar archive handle that refers to the gzip sub archive */ |
1403 | ar_handle = init_handle(); |
1404 | ar_handle->filter = filter_accept_list_reassign; |
1405 | ar_handle->src_fd = xopen(filename, O_RDONLY); |
1406 | |
1407 | return ar_handle; |
1408 | } |
1409 | |
1410 | static void init_archive_deb_control(archive_handle_t *ar_handle) |
1411 | { |
1412 | archive_handle_t *tar_handle; |
1413 | |
1414 | /* Setup the tar archive handle */ |
1415 | tar_handle = init_handle(); |
1416 | tar_handle->src_fd = ar_handle->src_fd; |
1417 | |
1418 | /* We don't care about data.tar.* or debian-binary, just control.tar.* */ |
1419 | #ifdef CONFIG_FEATURE_DEB_TAR_GZ |
1420 | llist_add_to(&(ar_handle->accept), "control.tar.gz"); |
1421 | #endif |
1422 | #ifdef CONFIG_FEATURE_DEB_TAR_BZ2 |
1423 | llist_add_to(&(ar_handle->accept), "control.tar.bz2"); |
1424 | #endif |
1425 | |
1426 | /* Assign the tar handle as a subarchive of the ar handle */ |
1427 | ar_handle->sub_archive = tar_handle; |
1428 | |
1429 | return; |
1430 | } |
1431 | |
1432 | static void init_archive_deb_data(archive_handle_t *ar_handle) |
1433 | { |
1434 | archive_handle_t *tar_handle; |
1435 | |
1436 | /* Setup the tar archive handle */ |
1437 | tar_handle = init_handle(); |
1438 | tar_handle->src_fd = ar_handle->src_fd; |
1439 | |
1440 | /* We don't care about control.tar.* or debian-binary, just data.tar.* */ |
1441 | #ifdef CONFIG_FEATURE_DEB_TAR_GZ |
1442 | llist_add_to(&(ar_handle->accept), "data.tar.gz"); |
1443 | #endif |
1444 | #ifdef CONFIG_FEATURE_DEB_TAR_BZ2 |
1445 | llist_add_to(&(ar_handle->accept), "data.tar.bz2"); |
1446 | #endif |
1447 | |
1448 | /* Assign the tar handle as a subarchive of the ar handle */ |
1449 | ar_handle->sub_archive = tar_handle; |
1450 | |
1451 | return; |
1452 | } |
1453 | |
1454 | static char *deb_extract_control_file_to_buffer(archive_handle_t *ar_handle, llist_t *myaccept) |
1455 | { |
1456 | ar_handle->sub_archive->action_data = data_extract_to_buffer; |
1457 | ar_handle->sub_archive->accept = myaccept; |
1458 | ar_handle->sub_archive->filter = filter_accept_list; |
1459 | |
1460 | unpack_ar_archive(ar_handle); |
1461 | close(ar_handle->src_fd); |
1462 | |
1463 | return ar_handle->sub_archive->buffer; |
1464 | } |
1465 | |
1466 | static void data_extract_all_prefix(archive_handle_t *archive_handle) |
1467 | { |
1468 | char *name_ptr = archive_handle->file_header->name; |
1469 | |
1470 | name_ptr += strspn(name_ptr, "./"); |
1471 | if (name_ptr[0] != '\0') { |
1472 | archive_handle->file_header->name = xasprintf("%s%s", archive_handle->buffer, name_ptr); |
1473 | data_extract_all(archive_handle); |
1474 | } |
1475 | return; |
1476 | } |
1477 | |
1478 | static void unpack_package(deb_file_t *deb_file) |
1479 | { |
1480 | const char *package_name = name_hashtable[package_hashtable[deb_file->package]->name]; |
1481 | const unsigned status_num = search_status_hashtable(package_name); |
1482 | const unsigned status_package_num = status_hashtable[status_num]->package; |
1483 | char *info_prefix; |
1484 | char *list_filename; |
1485 | archive_handle_t *archive_handle; |
1486 | FILE *out_stream; |
1487 | llist_t *accept_list = NULL; |
1488 | int i = 0; |
1489 | |
1490 | /* If existing version, remove it first */ |
1491 | if (strcmp(name_hashtable[get_status(status_num, 3)], "installed") == 0) { |
1492 | /* Package is already installed, remove old version first */ |
1493 | printf("Preparing to replace %s %s (using %s)...\n", package_name, |
1494 | name_hashtable[package_hashtable[status_package_num]->version], |
1495 | deb_file->filename); |
1496 | remove_package(status_package_num, 0); |
1497 | } else { |
1498 | printf("Unpacking %s (from %s)...\n", package_name, deb_file->filename); |
1499 | } |
1500 | |
1501 | /* Extract control.tar.gz to /var/lib/dpkg/info/<package>.filename */ |
1502 | info_prefix = xasprintf("/var/lib/dpkg/info/%s.", package_name); |
1503 | archive_handle = init_archive_deb_ar(deb_file->filename); |
1504 | init_archive_deb_control(archive_handle); |
1505 | |
1506 | while (all_control_files[i]) { |
1507 | char *c = xasprintf("./%s", all_control_files[i]); |
1508 | llist_add_to(&accept_list, c); |
1509 | i++; |
1510 | } |
1511 | archive_handle->sub_archive->accept = accept_list; |
1512 | archive_handle->sub_archive->filter = filter_accept_list; |
1513 | archive_handle->sub_archive->action_data = data_extract_all_prefix; |
1514 | archive_handle->sub_archive->buffer = info_prefix; |
1515 | archive_handle->sub_archive->flags |= ARCHIVE_EXTRACT_UNCONDITIONAL; |
1516 | unpack_ar_archive(archive_handle); |
1517 | |
1518 | /* Run the preinst prior to extracting */ |
1519 | if (run_package_script(package_name, "preinst") != 0) { |
1520 | /* when preinst returns exit code != 0 then quit installation process */ |
1521 | bb_error_msg_and_die("subprocess pre-installation script returned error"); |
1522 | } |
1523 | |
1524 | /* Extract data.tar.gz to the root directory */ |
1525 | archive_handle = init_archive_deb_ar(deb_file->filename); |
1526 | init_archive_deb_data(archive_handle); |
1527 | archive_handle->sub_archive->action_data = data_extract_all_prefix; |
1528 | archive_handle->sub_archive->buffer = "/"; |
1529 | archive_handle->sub_archive->flags |= ARCHIVE_EXTRACT_UNCONDITIONAL; |
1530 | unpack_ar_archive(archive_handle); |
1531 | |
1532 | /* Create the list file */ |
1533 | list_filename = xasprintf("/var/lib/dpkg/info/%s.list", package_name); |
1534 | out_stream = xfopen(list_filename, "w"); |
1535 | while (archive_handle->sub_archive->passed) { |
1536 | /* the leading . has been stripped by data_extract_all_prefix already */ |
1537 | fputs(archive_handle->sub_archive->passed->data, out_stream); |
1538 | fputc('\n', out_stream); |
1539 | archive_handle->sub_archive->passed = archive_handle->sub_archive->passed->link; |
1540 | } |
1541 | fclose(out_stream); |
1542 | |
1543 | /* change status */ |
1544 | set_status(status_num, "install", 1); |
1545 | set_status(status_num, "unpacked", 3); |
1546 | |
1547 | free(info_prefix); |
1548 | free(list_filename); |
1549 | } |
1550 | |
1551 | static void configure_package(deb_file_t *deb_file) |
1552 | { |
1553 | const char *package_name = name_hashtable[package_hashtable[deb_file->package]->name]; |
1554 | const char *package_version = name_hashtable[package_hashtable[deb_file->package]->version]; |
1555 | const int status_num = search_status_hashtable(package_name); |
1556 | |
1557 | printf("Setting up %s (%s)...\n", package_name, package_version); |
1558 | |
1559 | /* Run the postinst script */ |
1560 | if (run_package_script(package_name, "postinst") != 0) { |
1561 | /* TODO: handle failure gracefully */ |
1562 | bb_error_msg_and_die("postrm failure.. set status to what?"); |
1563 | } |
1564 | /* Change status to reflect success */ |
1565 | set_status(status_num, "install", 1); |
1566 | set_status(status_num, "installed", 3); |
1567 | } |
1568 | |
1569 | int dpkg_main(int argc, char **argv) |
1570 | { |
1571 | deb_file_t **deb_file = NULL; |
1572 | status_node_t *status_node; |
1573 | char *str_f; |
1574 | int opt; |
1575 | int package_num; |
1576 | int deb_count = 0; |
1577 | int state_status; |
1578 | int status_num; |
1579 | int i; |
1580 | enum { |
1581 | OPT_configure = 0x1, |
1582 | OPT_force_ignore_depends = 0x2, |
1583 | OPT_install = 0x4, |
1584 | OPT_list_installed = 0x8, |
1585 | OPT_purge = 0x10, |
1586 | OPT_remove = 0x20, |
1587 | OPT_unpack = 0x40, |
1588 | REQ_package_name = 0x8000, |
1589 | REQ_filename = 0x4000, |
1590 | }; |
1591 | |
1592 | opt = getopt32(argc, argv, "CF:ilPru", &str_f); |
1593 | if (opt & OPT_configure) opt |= REQ_package_name; // -C |
1594 | if (opt & OPT_force_ignore_depends) { // -F (--force in official dpkg) |
1595 | if (strcmp(str_f, "depends")) |
1596 | opt &= ~OPT_force_ignore_depends; |
1597 | } |
1598 | if (opt & OPT_install) opt |= REQ_filename; // -i |
1599 | //if (opt & OPT_list_installed) ... // -l |
1600 | if (opt & OPT_purge) opt |= REQ_package_name; // -P |
1601 | if (opt & OPT_remove) opt |= REQ_package_name; // -r |
1602 | if (opt & OPT_unpack) opt |= REQ_filename; // -u (--unpack in official dpkg) |
1603 | argc -= optind; |
1604 | argv += optind; |
1605 | /* check for non-option argument if expected */ |
1606 | if (!opt || (!argc && !(opt && OPT_list_installed))) |
1607 | bb_show_usage(); |
1608 | |
1609 | name_hashtable = xzalloc(sizeof(name_hashtable[0]) * (NAME_HASH_PRIME + 1)); |
1610 | package_hashtable = xzalloc(sizeof(package_hashtable[0]) * (PACKAGE_HASH_PRIME + 1)); |
1611 | status_hashtable = xzalloc(sizeof(status_hashtable[0]) * (STATUS_HASH_PRIME + 1)); |
1612 | |
1613 | /* puts("(Reading database ... xxxxx files and directories installed.)"); */ |
1614 | index_status_file("/var/lib/dpkg/status"); |
1615 | |
1616 | /* if the list action was given print the installed packages and exit */ |
1617 | if (opt & OPT_list_installed) { |
1618 | list_packages(); |
1619 | return EXIT_SUCCESS; |
1620 | } |
1621 | |
1622 | /* Read arguments and store relevant info in structs */ |
1623 | while (*argv) { |
1624 | /* deb_count = nb_elem - 1 and we need nb_elem + 1 to allocate terminal node [NULL pointer] */ |
1625 | deb_file = xrealloc(deb_file, sizeof(deb_file_t *) * (deb_count + 2)); |
1626 | deb_file[deb_count] = xzalloc(sizeof(deb_file_t)); |
1627 | if (opt & REQ_filename) { |
1628 | archive_handle_t *archive_handle; |
1629 | llist_t *control_list = NULL; |
1630 | |
1631 | /* Extract the control file */ |
1632 | llist_add_to(&control_list, "./control"); |
1633 | archive_handle = init_archive_deb_ar(argv[0]); |
1634 | init_archive_deb_control(archive_handle); |
1635 | deb_file[deb_count]->control_file = deb_extract_control_file_to_buffer(archive_handle, control_list); |
1636 | if (deb_file[deb_count]->control_file == NULL) { |
1637 | bb_error_msg_and_die("cannot extract control file"); |
1638 | } |
1639 | deb_file[deb_count]->filename = xstrdup(argv[0]); |
1640 | package_num = fill_package_struct(deb_file[deb_count]->control_file); |
1641 | |
1642 | if (package_num == -1) { |
1643 | bb_error_msg("invalid control file in %s", argv[0]); |
1644 | argv++; |
1645 | continue; |
1646 | } |
1647 | deb_file[deb_count]->package = (unsigned) package_num; |
1648 | |
1649 | /* Add the package to the status hashtable */ |
1650 | if (opt & (OPT_unpack|OPT_install)) { |
1651 | /* Try and find a currently installed version of this package */ |
1652 | status_num = search_status_hashtable(name_hashtable[package_hashtable[deb_file[deb_count]->package]->name]); |
1653 | /* If no previous entry was found initialise a new entry */ |
1654 | if (status_hashtable[status_num] == NULL |
1655 | || status_hashtable[status_num]->status == 0 |
1656 | ) { |
1657 | status_node = xmalloc(sizeof(status_node_t)); |
1658 | status_node->package = deb_file[deb_count]->package; |
1659 | /* reinstreq isnt changed to "ok" until the package control info |
1660 | * is written to the status file*/ |
1661 | status_node->status = search_name_hashtable("install reinstreq not-installed"); |
1662 | status_hashtable[status_num] = status_node; |
1663 | } else { |
1664 | set_status(status_num, "install", 1); |
1665 | set_status(status_num, "reinstreq", 2); |
1666 | } |
1667 | } |
1668 | } |
1669 | else if (opt & REQ_package_name) { |
1670 | deb_file[deb_count]->package = search_package_hashtable( |
1671 | search_name_hashtable(argv[0]), |
1672 | search_name_hashtable("ANY"), VER_ANY); |
1673 | if (package_hashtable[deb_file[deb_count]->package] == NULL) { |
1674 | bb_error_msg_and_die("package %s is uninstalled or unknown", argv[0]); |
1675 | } |
1676 | package_num = deb_file[deb_count]->package; |
1677 | status_num = search_status_hashtable(name_hashtable[package_hashtable[package_num]->name]); |
1678 | state_status = get_status(status_num, 3); |
1679 | |
1680 | /* check package status is "installed" */ |
1681 | if (opt & OPT_remove) { |
1682 | if (strcmp(name_hashtable[state_status], "not-installed") == 0 |
1683 | || strcmp(name_hashtable[state_status], "config-files") == 0 |
1684 | ) { |
1685 | bb_error_msg_and_die("%s is already removed", name_hashtable[package_hashtable[package_num]->name]); |
1686 | } |
1687 | set_status(status_num, "deinstall", 1); |
1688 | } |
1689 | else if (opt & OPT_purge) { |
1690 | /* if package status is "conf-files" then its ok */ |
1691 | if (strcmp(name_hashtable[state_status], "not-installed") == 0) { |
1692 | bb_error_msg_and_die("%s is already purged", name_hashtable[package_hashtable[package_num]->name]); |
1693 | } |
1694 | set_status(status_num, "purge", 1); |
1695 | } |
1696 | } |
1697 | deb_count++; |
1698 | argv++; |
1699 | } |
1700 | deb_file[deb_count] = NULL; |
1701 | |
1702 | /* Check that the deb file arguments are installable */ |
1703 | if (!(opt & OPT_force_ignore_depends)) { |
1704 | if (!check_deps(deb_file, 0, deb_count)) { |
1705 | bb_error_msg_and_die("dependency check failed"); |
1706 | } |
1707 | } |
1708 | |
1709 | /* TODO: install or remove packages in the correct dependency order */ |
1710 | for (i = 0; i < deb_count; i++) { |
1711 | /* Remove or purge packages */ |
1712 | if (opt & OPT_remove) { |
1713 | remove_package(deb_file[i]->package, 1); |
1714 | } |
1715 | else if (opt & OPT_purge) { |
1716 | purge_package(deb_file[i]->package); |
1717 | } |
1718 | else if (opt & OPT_unpack) { |
1719 | unpack_package(deb_file[i]); |
1720 | } |
1721 | else if (opt & OPT_install) { |
1722 | unpack_package(deb_file[i]); |
1723 | /* package is configured in second pass below */ |
1724 | } |
1725 | else if (opt & OPT_configure) { |
1726 | configure_package(deb_file[i]); |
1727 | } |
1728 | } |
1729 | /* configure installed packages */ |
1730 | if (opt & OPT_install) { |
1731 | for (i = 0; i < deb_count; i++) |
1732 | configure_package(deb_file[i]); |
1733 | } |
1734 | |
1735 | write_status_file(deb_file); |
1736 | |
1737 | if (ENABLE_FEATURE_CLEAN_UP) { |
1738 | for (i = 0; i < deb_count; i++) { |
1739 | free(deb_file[i]->control_file); |
1740 | free(deb_file[i]->filename); |
1741 | free(deb_file[i]); |
1742 | } |
1743 | |
1744 | free(deb_file); |
1745 | |
1746 | for (i = 0; i < NAME_HASH_PRIME; i++) { |
1747 | free(name_hashtable[i]); |
1748 | } |
1749 | |
1750 | for (i = 0; i < PACKAGE_HASH_PRIME; i++) { |
1751 | if (package_hashtable[i] != NULL) { |
1752 | free_package(package_hashtable[i]); |
1753 | } |
1754 | } |
1755 | |
1756 | for (i = 0; i < STATUS_HASH_PRIME; i++) { |
1757 | free(status_hashtable[i]); |
1758 | } |
1759 | |
1760 | free(status_hashtable); |
1761 | free(package_hashtable); |
1762 | free(name_hashtable); |
1763 | } |
1764 | |
1765 | return EXIT_SUCCESS; |
1766 | } |