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