b2e0df0c0ef45add09519f0ddac3b4f4778a309c
[oweals/opkg-lede.git] / libopkg / pkg_depends.c
1 /* pkg_depends.c - the opkg package management system
2
3    Steven M. Ayer
4
5    Copyright (C) 2002 Compaq Computer Corporation
6
7    This program is free software; you can redistribute it and/or
8    modify it under the terms of the GNU General Public License as
9    published by the Free Software Foundation; either version 2, or (at
10    your option) any later version.
11
12    This program is distributed in the hope that it will be useful, but
13    WITHOUT ANY WARRANTY; without even the implied warranty of
14    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
15    General Public License for more details.
16 */
17
18 #include <stdio.h>
19 #include <ctype.h>
20
21 #include "pkg.h"
22 #include "opkg_utils.h"
23 #include "pkg_hash.h"
24 #include "opkg_message.h"
25 #include "pkg_parse.h"
26 #include "hash_table.h"
27 #include "libbb/libbb.h"
28
29 static int parseDepends(compound_depend_t * compound_depend, char *depend_str);
30 static depend_t *depend_init(void);
31 static char **add_unresolved_dep(pkg_t * pkg, char **the_lost, int ref_ndx);
32 static char **merge_unresolved(char **oldstuff, char **newstuff);
33 static int is_pkg_in_pkg_vec(pkg_vec_t * vec, pkg_t * pkg);
34
35 static int pkg_installed_and_constraint_satisfied(pkg_t * pkg, void *cdata)
36 {
37         depend_t *depend = (depend_t *) cdata;
38         if ((pkg->state_status == SS_INSTALLED
39              || pkg->state_status == SS_UNPACKED)
40             && version_constraints_satisfied(depend, pkg))
41                 return 1;
42         else
43                 return 0;
44 }
45
46 static int pkg_constraint_satisfied(pkg_t * pkg, void *cdata)
47 {
48         depend_t *depend = (depend_t *) cdata;
49         if (version_constraints_satisfied(depend, pkg))
50                 return 1;
51         else
52                 return 0;
53 }
54
55 /* returns ndependencies or negative error value */
56 int
57 pkg_hash_fetch_unsatisfied_dependencies(pkg_t * pkg, pkg_vec_t * unsatisfied,
58                                         char ***unresolved)
59 {
60         pkg_t *satisfier_entry_pkg;
61         int i, j, k;
62         int found;
63         char **the_lost;
64         abstract_pkg_t *ab_pkg;
65         compound_depend_t *compound_depend;
66
67         /*
68          * this is a setup to check for redundant/cyclic dependency checks,
69          * which are marked at the abstract_pkg level
70          */
71         if (!(ab_pkg = pkg->parent)) {
72                 opkg_msg(ERROR, "Internal error, with pkg %s.\n", pkg->name);
73                 *unresolved = NULL;
74                 return 0;
75         }
76         if (ab_pkg->dependencies_checked) {     /* avoid duplicate or cyclic checks */
77                 *unresolved = NULL;
78                 return 0;
79         } else {
80                 ab_pkg->dependencies_checked = 1;       /* mark it for subsequent visits */
81         }
82
83         compound_depend = pkg_get_ptr(pkg, PKG_DEPENDS);
84
85         if (!compound_depend || !compound_depend->type) {
86                 *unresolved = NULL;
87                 return 0;
88         }
89
90         the_lost = NULL;
91
92         /* foreach dependency */
93         for (; compound_depend && compound_depend->type; compound_depend++) {
94                 depend_t **possible_satisfiers =
95                     compound_depend->possibilities;;
96                 found = 0;
97                 satisfier_entry_pkg = NULL;
98
99                 if (compound_depend->type == GREEDY_DEPEND) {
100                         /* foreach possible satisfier */
101                         for (j = 0; j < compound_depend->possibility_count; j++) {
102                                 /* foreach provided_by, which includes the abstract_pkg itself */
103                                 abstract_pkg_t *abpkg =
104                                     possible_satisfiers[j]->pkg;
105                                 abstract_pkg_vec_t *ab_provider_vec =
106                                     abpkg->provided_by;
107                                 int nposs = ab_provider_vec->len;
108                                 abstract_pkg_t **ab_providers =
109                                     ab_provider_vec->pkgs;
110                                 int l;
111                                 for (l = 0; l < nposs; l++) {
112                                         pkg_vec_t *test_vec =
113                                             ab_providers[l]->pkgs;
114                                         /* if no depends on this one, try the first package that Provides this one */
115                                         if (!test_vec) {        /* no pkg_vec hooked up to the abstract_pkg!  (need another feed?) */
116                                                 continue;
117                                         }
118
119                                         /* cruise this possiblity's pkg_vec looking for an installed version */
120                                         for (k = 0; k < test_vec->len; k++) {
121                                                 pkg_t *pkg_scout =
122                                                     test_vec->pkgs[k];
123                                                 /* not installed, and not already known about? */
124                                                 if ((pkg_scout->state_want !=
125                                                      SW_INSTALL)
126                                                     && !pkg_scout->parent->
127                                                     dependencies_checked
128                                                     &&
129                                                     !is_pkg_in_pkg_vec
130                                                     (unsatisfied, pkg_scout)) {
131                                                         char **newstuff = NULL;
132                                                         int rc;
133                                                         pkg_vec_t *tmp_vec =
134                                                             pkg_vec_alloc();
135                                                         /* check for not-already-installed dependencies */
136                                                         rc = pkg_hash_fetch_unsatisfied_dependencies(pkg_scout, tmp_vec, &newstuff);
137                                                         if (newstuff == NULL) {
138                                                                 int m;
139                                                                 int ok = 1;
140                                                                 for (m = 0;
141                                                                      m < rc;
142                                                                      m++) {
143                                                                         pkg_t *p
144                                                                             =
145                                                                             tmp_vec->
146                                                                             pkgs
147                                                                             [m];
148                                                                         if (p->
149                                                                             state_want
150                                                                             ==
151                                                                             SW_INSTALL)
152                                                                                 continue;
153                                                                         opkg_msg
154                                                                             (DEBUG,
155                                                                              "Not installing %s due"
156                                                                              " to requirement for %s.\n",
157                                                                              pkg_scout->
158                                                                              name,
159                                                                              p->
160                                                                              name);
161                                                                         ok = 0;
162                                                                         break;
163                                                                 }
164                                                                 pkg_vec_free
165                                                                     (tmp_vec);
166                                                                 if (ok) {
167                                                                         /* mark this one for installation */
168                                                                         opkg_msg
169                                                                             (NOTICE,
170                                                                              "Adding satisfier for greedy"
171                                                                              " dependence %s.\n",
172                                                                              pkg_scout->
173                                                                              name);
174                                                                         pkg_vec_insert
175                                                                             (unsatisfied,
176                                                                              pkg_scout);
177                                                                 }
178                                                         } else {
179                                                                 opkg_msg(DEBUG,
180                                                                          "Not installing %s due to "
181                                                                          "broken depends.\n",
182                                                                          pkg_scout->
183                                                                          name);
184                                                                 free(newstuff);
185                                                         }
186                                                 }
187                                         }
188                                 }
189                         }
190
191                         continue;
192                 }
193
194                 /* foreach possible satisfier, look for installed package  */
195                 for (j = 0; j < compound_depend->possibility_count; j++) {
196                         /* foreach provided_by, which includes the abstract_pkg itself */
197                         depend_t *dependence_to_satisfy =
198                             possible_satisfiers[j];
199                         abstract_pkg_t *satisfying_apkg =
200                             possible_satisfiers[j]->pkg;
201                         pkg_t *satisfying_pkg =
202                             pkg_hash_fetch_best_installation_candidate
203                             (satisfying_apkg,
204                              pkg_installed_and_constraint_satisfied,
205                              dependence_to_satisfy, 1);
206                         /* Being that I can't test constraing in pkg_hash, I will test it here */
207                         if (satisfying_pkg != NULL) {
208                                 if (!pkg_installed_and_constraint_satisfied
209                                     (satisfying_pkg, dependence_to_satisfy)) {
210                                         satisfying_pkg = NULL;
211                                 }
212                         }
213                         opkg_msg(DEBUG, "satisfying_pkg=%p\n", satisfying_pkg);
214                         if (satisfying_pkg != NULL) {
215                                 found = 1;
216                                 break;
217                         }
218
219                 }
220                 /* if nothing installed matches, then look for uninstalled satisfier */
221                 if (!found) {
222                         /* foreach possible satisfier, look for installed package  */
223                         for (j = 0; j < compound_depend->possibility_count; j++) {
224                                 /* foreach provided_by, which includes the abstract_pkg itself */
225                                 depend_t *dependence_to_satisfy =
226                                     possible_satisfiers[j];
227                                 abstract_pkg_t *satisfying_apkg =
228                                     possible_satisfiers[j]->pkg;
229                                 pkg_t *satisfying_pkg =
230                                     pkg_hash_fetch_best_installation_candidate
231                                     (satisfying_apkg,
232                                      pkg_constraint_satisfied,
233                                      dependence_to_satisfy, 1);
234                                 /* Being that I can't test constraing in pkg_hash, I will test it here too */
235                                 if (satisfying_pkg != NULL) {
236                                         if (!pkg_constraint_satisfied
237                                             (satisfying_pkg,
238                                              dependence_to_satisfy)) {
239                                                 satisfying_pkg = NULL;
240                                         }
241                                 }
242
243                                 /* user request overrides package recommendation */
244                                 if (satisfying_pkg != NULL
245                                     && (compound_depend->type == RECOMMEND
246                                         || compound_depend->type == SUGGEST)
247                                     && (satisfying_pkg->state_want ==
248                                         SW_DEINSTALL
249                                         || satisfying_pkg->state_want ==
250                                         SW_PURGE)) {
251                                         opkg_msg(NOTICE,
252                                                  "%s: ignoring recommendation for "
253                                                  "%s at user request\n",
254                                                  pkg->name,
255                                                  satisfying_pkg->name);
256                                         continue;
257                                 }
258
259                                 opkg_msg(DEBUG, "satisfying_pkg=%p\n",
260                                          satisfying_pkg);
261                                 if (satisfying_pkg != NULL) {
262                                         satisfier_entry_pkg = satisfying_pkg;
263                                         break;
264                                 }
265                         }
266                 }
267
268                 /* we didn't find one, add something to the unsatisfied vector */
269                 if (!found) {
270                         if (!satisfier_entry_pkg) {
271                                 /* failure to meet recommendations is not an error */
272                                 if (compound_depend->type != RECOMMEND
273                                     && compound_depend->type != SUGGEST)
274                                         the_lost =
275                                             add_unresolved_dep(pkg, the_lost,
276                                                                i);
277                                 else
278                                         opkg_msg(NOTICE,
279                                                  "%s: unsatisfied recommendation for %s\n",
280                                                  pkg->name,
281                                                  compound_depend->
282                                                  possibilities[0]->pkg->name);
283                         } else {
284                                 if (compound_depend->type == SUGGEST) {
285                                         /* just mention it politely */
286                                         opkg_msg(NOTICE,
287                                                  "package %s suggests installing %s\n",
288                                                  pkg->name,
289                                                  satisfier_entry_pkg->name);
290                                 } else {
291                                         char **newstuff = NULL;
292
293                                         if (satisfier_entry_pkg != pkg &&
294                                             !is_pkg_in_pkg_vec(unsatisfied,
295                                                                satisfier_entry_pkg))
296                                         {
297                                                 pkg_vec_insert(unsatisfied,
298                                                                satisfier_entry_pkg);
299                                                 pkg_hash_fetch_unsatisfied_dependencies
300                                                     (satisfier_entry_pkg,
301                                                      unsatisfied, &newstuff);
302                                                 the_lost =
303                                                     merge_unresolved(the_lost,
304                                                                      newstuff);
305                                                 if (newstuff)
306                                                         free(newstuff);
307                                         }
308                                 }
309                         }
310                 }
311         }
312         *unresolved = the_lost;
313
314         return unsatisfied->len;
315 }
316
317 /*checking for conflicts !in replaces
318   If a packages conflicts with another but is also replacing it, I should not consider it a
319   really conflicts
320   returns 0 if conflicts <> replaces or 1 if conflicts == replaces
321 */
322 static int is_pkg_a_replaces(pkg_t * pkg_scout, pkg_t * pkg)
323 {
324         abstract_pkg_t **replaces = pkg_get_ptr(pkg, PKG_REPLACES);
325
326         if (!replaces || !*replaces)
327                 return 0;
328
329         while (*replaces) {
330                 if (strcmp(pkg_scout->name, (*replaces)->name) == 0) {  // Found
331                         opkg_msg(DEBUG2, "Seems I've found a replace %s %s\n",
332                                  pkg_scout->name, (*replaces)->name);
333                         return 1;
334                 }
335                 replaces++;
336         }
337
338         return 0;
339 }
340
341 pkg_vec_t *pkg_hash_fetch_conflicts(pkg_t * pkg)
342 {
343         pkg_vec_t *installed_conflicts, *test_vec;
344         compound_depend_t *conflicts, *conflict;
345         depend_t **possible_satisfiers;
346         depend_t *possible_satisfier;
347         int j, k;
348         abstract_pkg_t *ab_pkg;
349         pkg_t **pkg_scouts;
350         pkg_t *pkg_scout;
351
352         /*
353          * this is a setup to check for redundant/cyclic dependency checks,
354          * which are marked at the abstract_pkg level
355          */
356         if (!(ab_pkg = pkg->parent)) {
357                 opkg_msg(ERROR, "Internal error: %s not in hash table\n",
358                          pkg->name);
359                 return (pkg_vec_t *) NULL;
360         }
361
362         conflicts = pkg_get_ptr(pkg, PKG_CONFLICTS);
363         if (!conflicts) {
364                 return (pkg_vec_t *) NULL;
365         }
366         installed_conflicts = pkg_vec_alloc();
367
368         /* foreach conflict */
369         for (conflict = conflicts; conflict->type; conflict++ ) {
370                 possible_satisfiers = conflicts->possibilities;
371
372                 /* foreach possible satisfier */
373                 for (j = 0; j < conflicts->possibility_count; j++) {
374                         possible_satisfier = possible_satisfiers[j];
375                         if (!possible_satisfier)
376                                 opkg_msg(ERROR,
377                                          "Internal error: possible_satisfier=NULL\n");
378                         if (!possible_satisfier->pkg)
379                                 opkg_msg(ERROR,
380                                          "Internal error: possible_satisfier->pkg=NULL\n");
381                         test_vec = possible_satisfier->pkg->pkgs;
382                         if (test_vec) {
383                                 /* pkg_vec found, it is an actual package conflict
384                                  * cruise this possiblity's pkg_vec looking for an installed version */
385                                 pkg_scouts = test_vec->pkgs;
386                                 for (k = 0; k < test_vec->len; k++) {
387                                         pkg_scout = pkg_scouts[k];
388                                         if (!pkg_scout) {
389                                                 opkg_msg(ERROR,
390                                                          "Internal error: pkg_scout=NULL\n");
391                                                 continue;
392                                         }
393                                         if ((pkg_scout->state_status ==
394                                              SS_INSTALLED
395                                              || pkg_scout->state_want ==
396                                              SW_INSTALL)
397                                             &&
398                                             version_constraints_satisfied
399                                             (possible_satisfier, pkg_scout)
400                                             && !is_pkg_a_replaces(pkg_scout,
401                                                                   pkg)) {
402                                                 if (!is_pkg_in_pkg_vec
403                                                     (installed_conflicts,
404                                                      pkg_scout)) {
405                                                         pkg_vec_insert
406                                                             (installed_conflicts,
407                                                              pkg_scout);
408                                                 }
409                                         }
410                                 }
411                         }
412                 }
413                 conflicts++;
414         }
415
416         if (installed_conflicts->len)
417                 return installed_conflicts;
418         pkg_vec_free(installed_conflicts);
419         return (pkg_vec_t *) NULL;
420 }
421
422 int version_constraints_satisfied(depend_t * depends, pkg_t * pkg)
423 {
424         pkg_t *temp;
425         int comparison;
426
427         if (depends->constraint == NONE)
428                 return 1;
429
430         temp = pkg_new();
431
432         parse_version(temp, depends->version);
433
434         comparison = pkg_compare_versions(pkg, temp);
435
436         pkg_deinit(temp);
437         free(temp);
438
439         if ((depends->constraint == EARLIER) && (comparison < 0))
440                 return 1;
441         else if ((depends->constraint == LATER) && (comparison > 0))
442                 return 1;
443         else if (comparison == 0)
444                 return 1;
445         else if ((depends->constraint == LATER_EQUAL) && (comparison >= 0))
446                 return 1;
447         else if ((depends->constraint == EARLIER_EQUAL) && (comparison <= 0))
448                 return 1;
449
450         return 0;
451 }
452
453 int pkg_dependence_satisfiable(depend_t * depend)
454 {
455         abstract_pkg_t *apkg = depend->pkg;
456         abstract_pkg_vec_t *provider_apkgs = apkg->provided_by;
457         int n_providers = provider_apkgs->len;
458         abstract_pkg_t **apkgs = provider_apkgs->pkgs;
459         pkg_vec_t *pkg_vec;
460         int n_pkgs;
461         int i;
462         int j;
463
464         for (i = 0; i < n_providers; i++) {
465                 abstract_pkg_t *papkg = apkgs[i];
466                 pkg_vec = papkg->pkgs;
467                 if (pkg_vec) {
468                         n_pkgs = pkg_vec->len;
469                         for (j = 0; j < n_pkgs; j++) {
470                                 pkg_t *pkg = pkg_vec->pkgs[j];
471                                 if (version_constraints_satisfied(depend, pkg)) {
472                                         return 1;
473                                 }
474                         }
475                 }
476         }
477         return 0;
478 }
479
480 int pkg_dependence_satisfied(depend_t * depend)
481 {
482         abstract_pkg_t *apkg = depend->pkg;
483         abstract_pkg_vec_t *provider_apkgs = apkg->provided_by;
484         int n_providers = provider_apkgs->len;
485         abstract_pkg_t **apkgs = provider_apkgs->pkgs;
486         int i;
487         int n_pkgs;
488         int j;
489
490         for (i = 0; i < n_providers; i++) {
491                 abstract_pkg_t *papkg = apkgs[i];
492                 pkg_vec_t *pkg_vec = papkg->pkgs;
493                 if (pkg_vec) {
494                         n_pkgs = pkg_vec->len;
495                         for (j = 0; j < n_pkgs; j++) {
496                                 pkg_t *pkg = pkg_vec->pkgs[j];
497                                 if (version_constraints_satisfied(depend, pkg)) {
498                                         if (pkg->state_status == SS_INSTALLED
499                                             || pkg->state_status == SS_UNPACKED)
500                                                 return 1;
501                                 }
502                         }
503                 }
504         }
505         return 0;
506 }
507
508 static int is_pkg_in_pkg_vec(pkg_vec_t * vec, pkg_t * pkg)
509 {
510         int i;
511         char *arch1, *arch2;
512         pkg_t **pkgs = vec->pkgs;
513         arch1 = pkg_get_architecture(pkg);
514
515         for (i = 0; i < vec->len; i++) {
516                 arch2 = pkg_get_architecture(*(pkgs + i));
517
518                 if ((strcmp(pkg->name, (*(pkgs + i))->name) == 0)
519                     && (pkg_compare_versions(pkg, *(pkgs + i)) == 0)
520                     && (strcmp(arch1, arch2) == 0))
521                         return 1;
522         }
523         return 0;
524 }
525
526 /**
527  * pkg_replaces returns 1 if pkg->replaces contains one of replacee's provides and 0
528  * otherwise.
529  */
530 int pkg_replaces(pkg_t * pkg, pkg_t * replacee)
531 {
532         abstract_pkg_t **replaces = pkg_get_ptr(pkg, PKG_REPLACES);
533         abstract_pkg_t **provides = pkg_get_ptr(replacee, PKG_PROVIDES);
534         abstract_pkg_t **r, **p;
535
536         for (r = replaces; r && *r; r++)
537                 for (p = provides; p && *p; p++)
538                         if (*r == *p)
539                                 return 1;
540
541         return 0;
542 }
543
544 /**
545  * pkg_conflicts_abstract returns 1 if pkg->conflicts contains conflictee and 0
546  * otherwise.
547  */
548 int pkg_conflicts_abstract(pkg_t * pkg, abstract_pkg_t * conflictee)
549 {
550         compound_depend_t *conflicts, *conflict;
551
552         conflicts = pkg_get_ptr(pkg, PKG_CONFLICTS);
553
554         int j;
555         for (conflict = conflicts; conflict->type; conflict++) {
556                 int possibility_count = conflict->possibility_count;
557                 struct depend **possibilities = conflict->possibilities;
558                 for (j = 0; j < possibility_count; j++) {
559                         if (possibilities[j]->pkg == conflictee) {
560                                 return 1;
561                         }
562                 }
563         }
564         return 0;
565 }
566
567 /**
568  * pkg_conflicts returns 1 if pkg->conflicts contains one of
569  * conflictee's provides and 0 otherwise.
570  */
571 int pkg_conflicts(pkg_t * pkg, pkg_t * conflictee)
572 {
573         int j;
574         int possibility_count;
575         struct depend **possibilities;
576         compound_depend_t *conflicts, *conflict;
577         abstract_pkg_t **conflictee_provides, **provider, *possibility;
578
579         conflicts = pkg_get_ptr(pkg, PKG_CONFLICTS);
580         conflictee_provides = pkg_get_ptr(conflictee, PKG_PROVIDES);
581
582         for (conflict = conflicts; conflict->type; conflict++) {
583                 possibility_count = conflict->possibility_count;
584                 possibilities = conflict->possibilities;
585                 for (j = 0; j < possibility_count; j++) {
586                         possibility = possibilities[j]->pkg;
587                         for (provider = conflictee_provides; provider && *provider; provider++) {
588                                 if (possibility == *provider) {
589                                         return 1;
590                                 }
591                         }
592                 }
593         }
594         return 0;
595 }
596
597 static char **merge_unresolved(char **oldstuff, char **newstuff)
598 {
599         int oldlen = 0, newlen = 0;
600         char **result;
601         int i, j;
602
603         if (!newstuff)
604                 return oldstuff;
605
606         while (oldstuff && oldstuff[oldlen])
607                 oldlen++;
608         while (newstuff && newstuff[newlen])
609                 newlen++;
610
611         result = xrealloc(oldstuff, sizeof(char *) * (oldlen + newlen + 1));
612
613         for (i = oldlen, j = 0; i < (oldlen + newlen); i++, j++)
614                 *(result + i) = *(newstuff + j);
615
616         *(result + i) = NULL;
617
618         return result;
619 }
620
621 /*
622  * a kinda kludgy way to back out depends str from two different arrays (reg'l'r 'n pre)
623  * this is null terminated, no count is carried around
624  */
625 char **add_unresolved_dep(pkg_t * pkg, char **the_lost, int ref_ndx)
626 {
627         int count;
628         char **resized;
629
630         count = 0;
631         while (the_lost && the_lost[count])
632                 count++;
633
634         count++;                /* need one to hold the null */
635         resized = xrealloc(the_lost, sizeof(char *) * (count + 1));
636         resized[count - 1] = pkg_depend_str(pkg, ref_ndx);
637         resized[count] = NULL;
638
639         return resized;
640 }
641
642 abstract_pkg_t **init_providelist(pkg_t *pkg, int *count)
643 {
644         abstract_pkg_t *ab_pkg;
645         abstract_pkg_t **provides = pkg_get_ptr(pkg, PKG_PROVIDES);
646
647         if (!provides) {
648                 provides = calloc(2, sizeof(abstract_pkg_t *));
649
650                 if (!provides) {
651                         if (count)
652                                 *count = 0;
653
654                         return NULL;
655                 }
656
657                 ab_pkg = ensure_abstract_pkg_by_name(pkg->name);
658
659                 if (!ab_pkg->pkgs)
660                         ab_pkg->pkgs = pkg_vec_alloc();
661
662                 abstract_pkg_vec_insert(ab_pkg->provided_by, ab_pkg);
663
664                 provides[0] = ab_pkg;
665                 provides[1] = NULL;
666
667                 if (count)
668                         *count = 2;
669
670                 pkg_set_ptr(pkg, PKG_PROVIDES, provides);
671         }
672         else if (count) {
673                 for (*count = 1; *provides; provides++)
674                         (*count)++;
675         }
676
677         return provides;
678 }
679
680 void parse_providelist(pkg_t *pkg, char *list)
681 {
682         int count = 0;
683         char *item, *tok;
684         abstract_pkg_t *ab_pkg, *provided_abpkg, **tmp, **provides;
685
686         provides = init_providelist(pkg, &count);
687         ab_pkg = ensure_abstract_pkg_by_name(pkg->name);
688
689         if (!provides || !ab_pkg)
690                 return;
691
692         for (item = strtok_r(list, ", ", &tok); item;
693              count++, item = strtok_r(NULL, ", ", &tok)) {
694                 tmp = realloc(provides, sizeof(abstract_pkg_t *) * (count + 1));
695
696                 if (!tmp)
697                         break;
698
699                 provided_abpkg = ensure_abstract_pkg_by_name(item);
700
701                 abstract_pkg_vec_insert(provided_abpkg->provided_by, ab_pkg);
702
703                 provides = tmp;
704                 provides[count - 1] = provided_abpkg;
705         }
706
707         provides[count - 1] = NULL;
708
709         pkg_set_ptr(pkg, PKG_PROVIDES, provides);
710 }
711
712 void parse_replacelist(pkg_t *pkg, char *list)
713 {
714         int count;
715         char *item, *tok;
716         abstract_pkg_t *ab_pkg, *old_abpkg, **tmp, **replaces = NULL;
717
718         ab_pkg = ensure_abstract_pkg_by_name(pkg->name);
719
720         if (!ab_pkg->pkgs)
721                 ab_pkg->pkgs = pkg_vec_alloc();
722
723         abstract_pkg_vec_insert(ab_pkg->provided_by, ab_pkg);
724
725         for (count = 1, item = strtok_r(list, ", ", &tok);
726              item;
727              count++, item = strtok_r(NULL, ", ", &tok), count++) {
728                 tmp = realloc(replaces, sizeof(abstract_pkg_t *) * (count + 1));
729
730                 if (!tmp)
731                         break;
732
733                 old_abpkg = ensure_abstract_pkg_by_name(item);
734
735                 if (!old_abpkg->replaced_by)
736                         old_abpkg->replaced_by = abstract_pkg_vec_alloc();
737
738                 /* if a package pkg both replaces and conflicts old_abpkg,
739                  * then add it to the replaced_by vector so that old_abpkg
740                  * will be upgraded to ab_pkg automatically */
741                 if (pkg_conflicts_abstract(pkg, old_abpkg))
742                         abstract_pkg_vec_insert(old_abpkg->replaced_by, ab_pkg);
743
744                 replaces = tmp;
745                 replaces[count - 1] = old_abpkg;
746         }
747
748         if (!replaces)
749                 return;
750
751         replaces[count - 1] = NULL;
752
753         pkg_set_ptr(pkg, PKG_REPLACES, replaces);
754 }
755
756 void buildProvides(abstract_pkg_t * ab_pkg, pkg_t * pkg)
757 {
758 #if 0
759         int i;
760
761         /* every pkg provides itself */
762         pkg->provides_count++;
763         abstract_pkg_vec_insert(ab_pkg->provided_by, ab_pkg);
764         pkg->provides = xcalloc(pkg->provides_count, sizeof(abstract_pkg_t *));
765         pkg->provides[0] = ab_pkg;
766         for (i = 1; i < pkg->provides_count; i++) {
767                 abstract_pkg_t *provided_abpkg =
768                     ensure_abstract_pkg_by_name(pkg->provides_str[i - 1]);
769                 free(pkg->provides_str[i - 1]);
770
771                 pkg->provides[i] = provided_abpkg;
772
773                 abstract_pkg_vec_insert(provided_abpkg->provided_by, ab_pkg);
774         }
775         if (pkg->provides_str)
776                 free(pkg->provides_str);
777 #endif
778 }
779
780 void buildConflicts(pkg_t * pkg)
781 {
782         /*
783         int i;
784         compound_depend_t *conflicts, *conflict;
785
786         if (!pkg->conflicts_count)
787                 return;
788
789         conflicts = pkg->conflicts =
790             xcalloc(pkg->conflicts_count, sizeof(compound_depend_t));
791         for (i = 0; i < pkg->conflicts_count; i++) {
792                 conflicts->type = CONFLICTS;
793                 parseDepends(conflicts, pkg->conflicts_str[i]);
794                 free(pkg->conflicts_str[i]);
795                 conflicts++;
796         }
797         if (pkg->conflicts_str)
798                 free(pkg->conflicts_str);
799                 */
800 }
801
802 void buildReplaces(abstract_pkg_t * ab_pkg, pkg_t * pkg)
803 {
804 #if 0
805         int i;
806
807         if (!pkg->replaces_count)
808                 return;
809
810         pkg->replaces = xcalloc(pkg->replaces_count, sizeof(abstract_pkg_t *));
811
812         for (i = 0; i < pkg->replaces_count; i++) {
813                 abstract_pkg_t *old_abpkg =
814                     ensure_abstract_pkg_by_name(pkg->replaces_str[i]);
815
816                 pkg->replaces[i] = old_abpkg;
817                 free(pkg->replaces_str[i]);
818
819                 if (!old_abpkg->replaced_by)
820                         old_abpkg->replaced_by = abstract_pkg_vec_alloc();
821                 /* if a package pkg both replaces and conflicts old_abpkg,
822                  * then add it to the replaced_by vector so that old_abpkg
823                  * will be upgraded to ab_pkg automatically */
824                 if (pkg_conflicts_abstract(pkg, old_abpkg))
825                         abstract_pkg_vec_insert(old_abpkg->replaced_by, ab_pkg);
826         }
827
828         if (pkg->replaces_str)
829                 free(pkg->replaces_str);
830 #endif
831 }
832
833 void parse_deplist(pkg_t *pkg, enum depend_type type, char *list)
834 {
835         int id, count;
836         char *item, *tok;
837         compound_depend_t *tmp, *deps;
838
839         switch (type)
840         {
841         case DEPEND:
842         case PREDEPEND:
843         case RECOMMEND:
844         case SUGGEST:
845         case GREEDY_DEPEND:
846                 id = PKG_DEPENDS;
847                 break;
848
849         case CONFLICTS:
850                 id = PKG_CONFLICTS;
851                 break;
852
853         default:
854                 return;
855         }
856
857         deps = pkg_get_ptr(pkg, id);
858
859         for (tmp = deps, count = 1; tmp && tmp->type; tmp++)
860                 count++;
861
862         for (item = strtok_r(list, ",", &tok); item; item = strtok_r(NULL, ",", &tok), count++) {
863                 tmp = realloc(deps, sizeof(compound_depend_t) * (count + 1));
864
865                 if (!tmp)
866                         break;
867
868                 deps = tmp;
869
870                 memset(deps + count - 1, 0, sizeof(compound_depend_t));
871                 parseDepends(deps + count - 1, item);
872
873                 deps[count - 1].type = type;
874         }
875
876         if (!deps)
877                 return;
878
879         memset(deps + count - 1, 0, sizeof(compound_depend_t));
880         pkg_set_ptr(pkg, id, deps);
881 }
882
883 void buildDepends(pkg_t * pkg)
884 {
885 #if 0
886         unsigned int count;
887         int i;
888         compound_depend_t *depends;
889
890         if (!
891             (count =
892              pkg->pre_depends_count + pkg->depends_count +
893              pkg->recommends_count + pkg->suggests_count))
894                 return;
895
896         depends = pkg->depends = xcalloc(count, sizeof(compound_depend_t));
897
898         for (i = 0; i < pkg->pre_depends_count; i++) {
899                 parseDepends(depends, pkg->pre_depends_str[i]);
900                 free(pkg->pre_depends_str[i]);
901                 depends->type = PREDEPEND;
902                 depends++;
903         }
904         if (pkg->pre_depends_str)
905                 free(pkg->pre_depends_str);
906
907         for (i = 0; i < pkg->depends_count; i++) {
908                 parseDepends(depends, pkg->depends_str[i]);
909                 free(pkg->depends_str[i]);
910                 depends++;
911         }
912         if (pkg->depends_str)
913                 free(pkg->depends_str);
914
915         for (i = 0; i < pkg->recommends_count; i++) {
916                 parseDepends(depends, pkg->recommends_str[i]);
917                 free(pkg->recommends_str[i]);
918                 depends->type = RECOMMEND;
919                 depends++;
920         }
921         if (pkg->recommends_str)
922                 free(pkg->recommends_str);
923
924         for (i = 0; i < pkg->suggests_count; i++) {
925                 parseDepends(depends, pkg->suggests_str[i]);
926                 free(pkg->suggests_str[i]);
927                 depends->type = SUGGEST;
928                 depends++;
929         }
930         if (pkg->suggests_str)
931                 free(pkg->suggests_str);
932
933 #endif
934 }
935
936 const char *constraint_to_str(enum version_constraint c)
937 {
938         switch (c) {
939         case NONE:
940                 return "";
941         case EARLIER:
942                 return "< ";
943         case EARLIER_EQUAL:
944                 return "<= ";
945         case EQUAL:
946                 return "= ";
947         case LATER_EQUAL:
948                 return ">= ";
949         case LATER:
950                 return "> ";
951         }
952
953         return "";
954 }
955
956 /*
957  * Returns a printable string for pkg's dependency at the specified idx. The
958  * resultant string must be passed to free() by the caller.
959  */
960 char *pkg_depend_str(pkg_t * pkg, int idx)
961 {
962         int i;
963         unsigned int len;
964         char *str;
965         compound_depend_t *cdep = NULL, *p;
966         depend_t *dep;
967
968         for (i = 0, p = pkg_get_ptr(pkg, PKG_DEPENDS); p && p->type; i++, p++)
969                 if (i == idx) {
970                         cdep = p;
971                         break;
972                 }
973
974         if (!cdep)
975                 return NULL;
976
977         len = 0;
978
979         /* calculate string length */
980         for (i = 0; i < cdep->possibility_count; i++) {
981                 dep = cdep->possibilities[i];
982
983                 if (i != 0)
984                         len += 3;       /* space, pipe, space */
985
986                 len += strlen(dep->pkg->name);
987
988                 if (dep->version) {
989                         len += 2;       /* space, left parenthesis */
990                         len += 3;       /* constraint string (<=, >=, etc), space */
991                         len += strlen(dep->version);
992                         len += 1;       /* right parenthesis */
993                 }
994         }
995
996         str = xmalloc(len + 1); /* +1 for the NULL terminator */
997         str[0] = '\0';
998
999         for (i = 0; i < cdep->possibility_count; i++) {
1000                 dep = cdep->possibilities[i];
1001
1002                 if (i != 0)
1003                         strncat(str, " | ", len);
1004
1005                 strncat(str, dep->pkg->name, len);
1006
1007                 if (dep->version) {
1008                         strncat(str, " (", len);
1009                         strncat(str, constraint_to_str(dep->constraint), len);
1010                         strncat(str, dep->version, len);
1011                         strncat(str, ")", len);
1012                 }
1013         }
1014
1015         return str;
1016 }
1017
1018 void buildDependedUponBy(pkg_t * pkg, abstract_pkg_t * ab_pkg)
1019 {
1020         compound_depend_t *depends;
1021         int othercount;
1022         int j;
1023         abstract_pkg_t *ab_depend;
1024         abstract_pkg_t **temp;
1025
1026         for (depends = pkg_get_ptr(pkg, PKG_DEPENDS); depends && depends->type; depends++) {
1027                 if (depends->type != PREDEPEND
1028                     && depends->type != DEPEND && depends->type != RECOMMEND)
1029                         continue;
1030                 for (j = 0; j < depends->possibility_count; j++) {
1031                         ab_depend = depends->possibilities[j]->pkg;
1032                         if (!ab_depend->depended_upon_by) {
1033                                 ab_depend->depended_upon_by =
1034                                     xcalloc(1, sizeof(abstract_pkg_t *));
1035                         }
1036
1037                         temp = ab_depend->depended_upon_by;
1038                         othercount = 1;
1039                         while (*temp) {
1040                                 temp++;
1041                                 othercount++;
1042                         }
1043                         *temp = ab_pkg;
1044
1045                         ab_depend->depended_upon_by =
1046                             xrealloc(ab_depend->depended_upon_by,
1047                                      (othercount +
1048                                       1) * sizeof(abstract_pkg_t *));
1049
1050                         /* the array may have been moved by realloc */
1051                         temp = ab_depend->depended_upon_by + othercount;
1052                         *temp = NULL;
1053                 }
1054         }
1055 }
1056
1057 static depend_t *depend_init(void)
1058 {
1059         depend_t *d = xcalloc(1, sizeof(depend_t));
1060         d->constraint = NONE;
1061         d->version = NULL;
1062         d->pkg = NULL;
1063
1064         return d;
1065 }
1066
1067 static int parseDepends(compound_depend_t * compound_depend, char *depend_str)
1068 {
1069         int i;
1070         char *depend, *name, *vstr, *rest, *tok = NULL;
1071         depend_t **possibilities = NULL, **tmp;
1072
1073         compound_depend->type = DEPEND;
1074
1075         for (i = 0, depend = strtok_r(depend_str, "|", &tok); depend; i++, depend = strtok_r(NULL, "|", &tok)) {
1076                 name = strtok(depend, " ");
1077                 rest = strtok(NULL, "\n");
1078
1079                 tmp = realloc(possibilities, sizeof(tmp) * (i + 1));
1080
1081                 if (!tmp)
1082                         return -1;
1083
1084                 possibilities = tmp;
1085                 possibilities[i] = depend_init();
1086                 possibilities[i]->pkg = ensure_abstract_pkg_by_name(name);
1087
1088                 if (rest && *rest == '(') {
1089                         vstr = strtok(rest + 1, ")");
1090
1091                         if (!strncmp(vstr, "<<", 2)) {
1092                                 possibilities[i]->constraint = EARLIER;
1093                                 vstr += 2;
1094                         } else if (!strncmp(vstr, "<=", 2)) {
1095                                 possibilities[i]->constraint = EARLIER_EQUAL;
1096                                 vstr += 2;
1097                         } else if (!strncmp(vstr, ">=", 2)) {
1098                                 possibilities[i]->constraint = LATER_EQUAL;
1099                                 vstr += 2;
1100                         } else if (!strncmp(vstr, ">>", 2)) {
1101                                 possibilities[i]->constraint = LATER;
1102                                 vstr += 2;
1103                         } else if (!strncmp(vstr, "=", 1)) {
1104                                 possibilities[i]->constraint = EQUAL;
1105                                 vstr++;
1106                         }
1107                         /* should these be here to support deprecated designations; dpkg does */
1108                         else if (!strncmp(vstr, "<", 1)) {
1109                                 possibilities[i]->constraint = EARLIER_EQUAL;
1110                                 vstr++;
1111                         } else if (!strncmp(vstr, ">", 1)) {
1112                                 possibilities[i]->constraint = LATER_EQUAL;
1113                                 vstr++;
1114                         }
1115
1116                         possibilities[i]->version = trim_xstrdup(vstr);
1117                         rest = strtok(NULL, " ");
1118                 }
1119                 else {
1120                         rest = strtok(rest, " ");
1121                 }
1122
1123                 if (rest && *rest == '*')
1124                         compound_depend->type = GREEDY_DEPEND;
1125         }
1126
1127         compound_depend->possibility_count = i;
1128         compound_depend->possibilities = possibilities;
1129
1130         return 0;
1131 }
1132
1133 compound_depend_t *pkg_get_depends(pkg_t *pkg, enum depend_type type)
1134 {
1135         compound_depend_t *dep;
1136
1137         for (dep = pkg_get_ptr(pkg, PKG_DEPENDS); dep && dep->type; dep++)
1138                 if (type == UNSPEC || dep->type == type)
1139                         return dep;
1140
1141         return NULL;
1142 }