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 "includes.h"
  19 #include <errno.h>
  20 #include <ctype.h>
  21
  22 #include "pkg.h"
  23 #include "opkg_utils.h"
  24 #include "pkg_hash.h"
  25 #include "opkg_message.h"
  26 #include "pkg_parse.h"
  27 #include "hash_table.h"
  28 #include "libbb/libbb.h"
  29
  30 static int parseDepends(compound_depend_t *compound_depend, hash_table_t * hash, char * depend_str);
  31 static depend_t * depend_init(void);
  32 static char ** add_unresolved_dep(pkg_t * pkg, char ** the_lost, int ref_ndx);
  33 static char ** merge_unresolved(char ** oldstuff, char ** newstuff);
  34 static int is_pkg_in_pkg_vec(pkg_vec_t * vec, pkg_t * pkg);
  35
  36 static int pkg_installed_and_constraint_satisfied(pkg_t *pkg, void *cdata)
  37 {
  38      depend_t *depend = (depend_t *)cdata;
  39      if ((pkg->state_status == SS_INSTALLED || pkg->state_status == SS_UNPACKED) && version_constraints_satisfied(depend, pkg))
  40           return 1;
  41      else
  42           return 0;
  43 }
  44
  45 static int pkg_constraint_satisfied(pkg_t *pkg, void *cdata)
  46 {
  47      depend_t *depend = (depend_t *)cdata;
  48      if (version_constraints_satisfied(depend, pkg))
  49           return 1;
  50      else
  51           return 0;
  52 }
  53
  54 /* returns ndependences or negative error value */
  55 int pkg_hash_fetch_unsatisfied_dependencies(opkg_conf_t *conf, pkg_t * pkg,
  56                                             pkg_vec_t *unsatisfied, char *** unresolved)
  57 {
  58      pkg_t * satisfier_entry_pkg;
  59      int i, j, k;
  60      int count, found;
  61      char ** the_lost;
  62      abstract_pkg_t * ab_pkg;
  63
  64      /*
  65       * this is a setup to check for redundant/cyclic dependency checks,
  66       * which are marked at the abstract_pkg level
  67       */
  68      if (!(ab_pkg = pkg->parent)) {
  69           fprintf(stderr, "%s:%d: something terribly wrong with pkg %s\n", __FUNCTION__, __LINE__, pkg->name);
  70           *unresolved = NULL;
  71           return 0;
  72      }
  73      if (ab_pkg->dependencies_checked) {    /* avoid duplicate or cyclic checks */
  74           *unresolved = NULL;
  75           return 0;
  76      } else {
  77           ab_pkg->dependencies_checked = 1;  /* mark it for subsequent visits */
  78      }
  79      /**/
  80
  81      count = pkg->pre_depends_count + pkg->depends_count + pkg->recommends_count + pkg->suggests_count;
  82      if (!count){
  83           *unresolved = NULL;
  84           return 0;
  85      }
  86
  87      the_lost = NULL;
  88
  89      /* foreach dependency */
  90      for (i = 0; i < count; i++) {
  91           compound_depend_t * compound_depend = &pkg->depends[i];
  92           depend_t ** possible_satisfiers = compound_depend->possibilities;;
  93           found = 0;
  94           satisfier_entry_pkg = NULL;
  95
  96           if (compound_depend->type == GREEDY_DEPEND) {
  97                /* foreach possible satisfier */
  98                for (j = 0; j < compound_depend->possibility_count; j++) {
  99                     /* foreach provided_by, which includes the abstract_pkg itself */
 100                     abstract_pkg_t *abpkg = possible_satisfiers[j]->pkg;
 101                     abstract_pkg_vec_t *ab_provider_vec = abpkg->provided_by;
 102                     int nposs = ab_provider_vec->len;
 103                     abstract_pkg_t **ab_providers = ab_provider_vec->pkgs;
 104                     int l;
 105                     for (l = 0; l < nposs; l++) {
 106                          pkg_vec_t *test_vec = ab_providers[l]->pkgs;
 107                          /* if no depends on this one, try the first package that Provides this one */
 108                          if (!test_vec){   /* no pkg_vec hooked up to the abstract_pkg!  (need another feed?) */
 109                               continue;
 110                          }
 111
 112                          /* cruise this possiblity's pkg_vec looking for an installed version */
 113                          for (k = 0; k < test_vec->len; k++) {
 114                               pkg_t *pkg_scout = test_vec->pkgs[k];
 115                               /* not installed, and not already known about? */
 116                               if ((pkg_scout->state_want != SW_INSTALL)
 117                                   && !pkg_scout->parent->dependencies_checked
 118                                   && !is_pkg_in_pkg_vec(unsatisfied, pkg_scout)) {
 119                                    char ** newstuff = NULL;
 120                                    int rc;
 121                                    pkg_vec_t *tmp_vec = pkg_vec_alloc ();
 122                                    /* check for not-already-installed dependencies */
 123                                    rc = pkg_hash_fetch_unsatisfied_dependencies(conf,
 124                                                                                 pkg_scout,
 125                                                                                 tmp_vec,
 126                                                                                 &newstuff);
 127                                    if (newstuff == NULL) {
 128                                         int i;
 129                                         int ok = 1;
 130                                         for (i = 0; i < rc; i++) {
 131                                             pkg_t *p = tmp_vec->pkgs[i];
 132                                             if (p->state_want == SW_INSTALL)
 133                                                 continue;
 134                                             opkg_message(conf, OPKG_DEBUG, "not installing %s due to requirement for %s\n", pkg_scout->name, p->name);
 135                                             ok = 0;
 136                                             break;
 137                                         }
 138                                         pkg_vec_free (tmp_vec);
 139                                         if (ok) {
 140                                             /* mark this one for installation */
 141                                             opkg_message(conf, OPKG_NOTICE, "Adding satisfier for greedy dependence: %s\n", pkg_scout->name);
 142                                             pkg_vec_insert(unsatisfied, pkg_scout);
 143                                         }
 144                                    } else  {
 145                                         opkg_message(conf, OPKG_DEBUG, "not installing %s due to broken depends \n", pkg_scout->name);
 146                                         free (newstuff);
 147                                    }
 148                               }
 149                          }
 150                     }
 151                }
 152
 153                continue;
 154           }
 155
 156           /* foreach possible satisfier, look for installed package  */
 157           for (j = 0; j < compound_depend->possibility_count; j++) {
 158                /* foreach provided_by, which includes the abstract_pkg itself */
 159                depend_t *dependence_to_satisfy = possible_satisfiers[j];
 160                abstract_pkg_t *satisfying_apkg = possible_satisfiers[j]->pkg;
 161                pkg_t *satisfying_pkg =
 162                     pkg_hash_fetch_best_installation_candidate(conf, satisfying_apkg,
 163                                                                pkg_installed_and_constraint_satisfied,
 164                                                                dependence_to_satisfy, 1, NULL);
 165                /* Being that I can't test constraing in pkg_hash, I will test it here */
 166                if (satisfying_pkg != NULL) {
 167                   if (!pkg_installed_and_constraint_satisfied ( satisfying_pkg,dependence_to_satisfy)) {
 168                       satisfying_pkg = NULL;
 169                   }
 170                }
 171                opkg_message(conf, OPKG_DEBUG, "%s:%d: satisfying_pkg=%p \n", __FILE__, __LINE__, satisfying_pkg);
 172                if (satisfying_pkg != NULL) {
 173                     found = 1;
 174                     break;
 175                }
 176
 177           }
 178           /* if nothing installed matches, then look for uninstalled satisfier */
 179           if (!found) {
 180                /* foreach possible satisfier, look for installed package  */
 181                for (j = 0; j < compound_depend->possibility_count; j++) {
 182                     /* foreach provided_by, which includes the abstract_pkg itself */
 183                     depend_t *dependence_to_satisfy = possible_satisfiers[j];
 184                     abstract_pkg_t *satisfying_apkg = possible_satisfiers[j]->pkg;
 185                     pkg_t *satisfying_pkg =
 186                          pkg_hash_fetch_best_installation_candidate(conf, satisfying_apkg,
 187                                                                     pkg_constraint_satisfied,
 188                                                                     dependence_to_satisfy, 1, NULL);
 189                     /* Being that I can't test constraing in pkg_hash, I will test it here too */
 190                     if (satisfying_pkg != NULL) {
 191                          if (!pkg_constraint_satisfied ( satisfying_pkg,dependence_to_satisfy)) {
 192                             satisfying_pkg = NULL;
 193                          }
 194                     }
 195
 196                     /* user request overrides package recommendation */
 197                     if (satisfying_pkg != NULL
 198                         && (compound_depend->type == RECOMMEND || compound_depend->type == SUGGEST)
 199                         && (satisfying_pkg->state_want == SW_DEINSTALL || satisfying_pkg->state_want == SW_PURGE)) {
 200                          opkg_message (conf, OPKG_NOTICE, "%s: ignoring recommendation for %s at user request\n",
 201                                        pkg->name, satisfying_pkg->name);
 202                          continue;
 203                     }
 204
 205                     opkg_message(conf, OPKG_DEBUG, "%s:%d: satisfying_pkg=%p\n", __FILE__, __LINE__, satisfying_pkg);
 206                     if (satisfying_pkg != NULL) {
 207                          satisfier_entry_pkg = satisfying_pkg;
 208                          break;
 209                     }
 210                }
 211           }
 212
 213           /* we didn't find one, add something to the unsatisfied vector */
 214           if (!found) {
 215                if (!satisfier_entry_pkg) {
 216                     /* failure to meet recommendations is not an error */
 217                     if (compound_depend->type != RECOMMEND && compound_depend->type != SUGGEST)
 218                          the_lost = add_unresolved_dep(pkg, the_lost, i);
 219                     else
 220                          opkg_message (conf, OPKG_NOTICE, "%s: unsatisfied recommendation for %s\n",
 221                                        pkg->name, compound_depend->possibilities[0]->pkg->name);
 222                }
 223                else {
 224                     if (compound_depend->type == SUGGEST) {
 225                          /* just mention it politely */
 226                          opkg_message (conf, OPKG_NOTICE, "package %s suggests installing %s\n",
 227                                        pkg->name, satisfier_entry_pkg->name);
 228                     } else {
 229                          char ** newstuff = NULL;
 230
 231                          if (satisfier_entry_pkg != pkg &&
 232                              !is_pkg_in_pkg_vec(unsatisfied, satisfier_entry_pkg)) {
 233                               pkg_vec_insert(unsatisfied, satisfier_entry_pkg);
 234                               pkg_hash_fetch_unsatisfied_dependencies(conf,
 235                                                                       satisfier_entry_pkg,
 236                                                                       unsatisfied,
 237                                                                       &newstuff);
 238                               the_lost = merge_unresolved(the_lost, newstuff);
 239                          }
 240                     }
 241                }
 242           }
 243      }
 244      *unresolved = the_lost;
 245
 246      return unsatisfied->len;
 247 }
 248
 249 /*checking for conflicts !in replaces
 250   If a packages conflicts with another but is also replacing it, I should not consider it a
 251   really conflicts
 252   returns 0 if conflicts <> replaces or 1 if conflicts == replaces
 253 */
 254 int is_pkg_a_replaces(pkg_t *pkg_scout,pkg_t *pkg)
 255 {
 256     int i ;
 257     int replaces_count = pkg->replaces_count;
 258     abstract_pkg_t **replaces;
 259
 260     if (pkg->replaces_count==0)    // No replaces, it's surely a conflict
 261         return 0;
 262
 263     replaces = pkg->replaces;
 264
 265     for (i = 0; i < replaces_count; i++) {
 266         if (strcmp(pkg_scout->name,pkg->replaces[i]->name)==0) {      // Found
 267             opkg_message(NULL, OPKG_DEBUG2, "Seems I've found a replace %s %s \n",pkg_scout->name,pkg->replaces[i]->name);
 268             return 1;
 269         }
 270     }
 271     return 0;
 272
 273 }
 274
 275
 276 /* Abhaya: added support for conflicts */
 277 pkg_vec_t * pkg_hash_fetch_conflicts(hash_table_t * hash, pkg_t * pkg)
 278 {
 279     pkg_vec_t * installed_conflicts, * test_vec;
 280     compound_depend_t * conflicts;
 281     depend_t ** possible_satisfiers;
 282     depend_t * possible_satisfier;
 283     int i, j, k;
 284     int count;
 285     abstract_pkg_t * ab_pkg;
 286     pkg_t **pkg_scouts;
 287     pkg_t *pkg_scout;
 288
 289     /*
 290      * this is a setup to check for redundant/cyclic dependency checks,
 291      * which are marked at the abstract_pkg level
 292      */
 293     if(!(ab_pkg = pkg->parent)){
 294         fprintf(stderr, "dependency check error.  pkg %s isn't in hash table\n", pkg->name);
 295         return (pkg_vec_t *)NULL;
 296     }
 297
 298     conflicts = pkg->conflicts;
 299     if(!conflicts){
 300         return (pkg_vec_t *)NULL;
 301     }
 302     installed_conflicts = pkg_vec_alloc();
 303
 304     count = pkg->conflicts_count;
 305
 306
 307
 308     /* foreach conflict */
 309     for(i = 0; i < pkg->conflicts_count; i++){
 310
 311         possible_satisfiers = conflicts->possibilities;
 312
 313         /* foreach possible satisfier */
 314         for(j = 0; j < conflicts->possibility_count; j++){
 315             possible_satisfier = possible_satisfiers[j];
 316             if (!possible_satisfier)
 317                 fprintf(stderr, "%s:%d: possible_satisfier is null\n", __FUNCTION__, __LINE__);
 318             if (!possible_satisfier->pkg)
 319                 fprintf(stderr, "%s:%d: possible_satisfier->pkg is null\n", __FUNCTION__, __LINE__);
 320             test_vec = possible_satisfier->pkg->pkgs;
 321             if (test_vec) {
 322                 /* pkg_vec found, it is an actual package conflict
 323                  * cruise this possiblity's pkg_vec looking for an installed version */
 324                 pkg_scouts = test_vec->pkgs;
 325                 for(k = 0; k < test_vec->len; k++){
 326                     pkg_scout = pkg_scouts[k];
 327                     if (!pkg_scout) {
 328                         fprintf(stderr,  "%s: null pkg scout\n", __FUNCTION__);
 329                         continue;
 330                     }
 331                     if ((pkg_scout->state_status == SS_INSTALLED || pkg_scout->state_want == SW_INSTALL) &&
 332                        version_constraints_satisfied(possible_satisfier, pkg_scout) && !is_pkg_a_replaces(pkg_scout,pkg)){
 333                         if (!is_pkg_in_pkg_vec(installed_conflicts, pkg_scout)){
 334                             pkg_vec_insert(installed_conflicts, pkg_scout);
 335                         }
 336                     }
 337                 }
 338             }
 339         }
 340         conflicts++;
 341     }
 342
 343     if (installed_conflicts->len)
 344             return installed_conflicts;
 345     pkg_vec_free(installed_conflicts);
 346         return (pkg_vec_t *)NULL;
 347 }
 348
 349 int version_constraints_satisfied(depend_t * depends, pkg_t * pkg)
 350 {
 351     pkg_t * temp;
 352     int comparison;
 353
 354     if(depends->constraint == NONE)
 355         return 1;
 356
 357     temp = pkg_new();
 358
 359     parseVersion(temp, depends->version);
 360
 361     comparison = pkg_compare_versions(pkg, temp);
 362
 363     free (temp->version);
 364     free(temp);
 365
 366     if((depends->constraint == EARLIER) &&
 367        (comparison < 0))
 368         return 1;
 369     else if((depends->constraint == LATER) &&
 370             (comparison > 0))
 371         return 1;
 372     else if(comparison == 0)
 373         return 1;
 374     else if((depends->constraint == LATER_EQUAL) &&
 375             (comparison >= 0))
 376         return 1;
 377     else if((depends->constraint == EARLIER_EQUAL) &&
 378             (comparison <= 0))
 379         return 1;
 380
 381     return 0;
 382 }
 383
 384 int pkg_dependence_satisfiable(opkg_conf_t *conf, depend_t *depend)
 385 {
 386      abstract_pkg_t *apkg = depend->pkg;
 387      abstract_pkg_vec_t *provider_apkgs = apkg->provided_by;
 388      int n_providers = provider_apkgs->len;
 389      abstract_pkg_t **apkgs = provider_apkgs->pkgs;
 390      pkg_vec_t *pkg_vec;
 391      int n_pkgs ;
 392      int i;
 393      int j;
 394
 395      for (i = 0; i < n_providers; i++) {
 396           abstract_pkg_t *papkg = apkgs[i];
 397           pkg_vec = papkg->pkgs;
 398           if (pkg_vec) {
 399                n_pkgs = pkg_vec->len;
 400                for (j = 0; j < n_pkgs; j++) {
 401                     pkg_t *pkg = pkg_vec->pkgs[j];
 402                     if (version_constraints_satisfied(depend, pkg)) {
 403                          return 1;
 404                     }
 405                }
 406           }
 407      }
 408      return 0;
 409 }
 410
 411 int pkg_dependence_satisfied(opkg_conf_t *conf, depend_t *depend)
 412 {
 413      abstract_pkg_t *apkg = depend->pkg;
 414      abstract_pkg_vec_t *provider_apkgs = apkg->provided_by;
 415      int n_providers = provider_apkgs->len;
 416      abstract_pkg_t **apkgs = provider_apkgs->pkgs;
 417      int i;
 418      int n_pkgs;
 419      int j;
 420
 421      for (i = 0; i < n_providers; i++) {
 422           abstract_pkg_t *papkg = apkgs[i];
 423           pkg_vec_t *pkg_vec = papkg->pkgs;
 424           if (pkg_vec) {
 425                n_pkgs = pkg_vec->len;
 426                for (j = 0; j < n_pkgs; j++) {
 427                     pkg_t *pkg = pkg_vec->pkgs[j];
 428                     if (version_constraints_satisfied(depend, pkg)) {
 429                          if (pkg->state_status == SS_INSTALLED || pkg->state_status == SS_UNPACKED)
 430                               return 1;
 431                     }
 432                }
 433           }
 434      }
 435      return 0;
 436 }
 437
 438 static int is_pkg_in_pkg_vec(pkg_vec_t * vec, pkg_t * pkg)
 439 {
 440     int i;
 441     pkg_t ** pkgs = vec->pkgs;
 442
 443     for(i = 0; i < vec->len; i++)
 444         if((strcmp(pkg->name, (*(pkgs + i))->name) == 0)
 445            && (pkg_compare_versions(pkg, *(pkgs + i)) == 0)
 446            && (strcmp(pkg->architecture, (*(pkgs + i))->architecture) == 0))
 447             return 1;
 448     return 0;
 449 }
 450
 451 /**
 452  * pkg_replaces returns 1 if pkg->replaces contains one of replacee's provides and 0
 453  * otherwise.
 454  */
 455 int pkg_replaces(pkg_t *pkg, pkg_t *replacee)
 456 {
 457      abstract_pkg_t **replaces = pkg->replaces;
 458      int replaces_count = pkg->replaces_count;
 459      int replacee_provides_count = replacee->provides_count;
 460      int i, j;
 461      for (i = 0; i < replaces_count; i++) {
 462           abstract_pkg_t *abstract_replacee = replaces[i];
 463           for (j = 0; j < replacee_provides_count; j++) {
 464                if (replacee->provides[j] == abstract_replacee)
 465                     return 1;
 466           }
 467      }
 468      return 0;
 469 }
 470
 471
 472 /**
 473  * pkg_conflicts_abstract returns 1 if pkg->conflicts contains conflictee and 0
 474  * otherwise.
 475  */
 476 int pkg_conflicts_abstract(pkg_t *pkg, abstract_pkg_t *conflictee)
 477 {
 478      compound_depend_t *conflicts = pkg->conflicts;
 479      int conflicts_count = pkg->conflicts_count;
 480      int i, j;
 481      for (i = 0; i < conflicts_count; i++) {
 482           int possibility_count = conflicts[i].possibility_count;
 483           struct depend **possibilities = conflicts[i].possibilities;
 484           for (j = 0; j < possibility_count; j++) {
 485                if (possibilities[j]->pkg == conflictee) {
 486                     return 1;
 487                }
 488           }
 489      }
 490      return 0;
 491 }
 492
 493 /**
 494  * pkg_conflicts returns 1 if pkg->conflicts contains one of
 495  * conflictee's provides and 0 otherwise.
 496  */
 497 int pkg_conflicts(pkg_t *pkg, pkg_t *conflictee)
 498 {
 499      compound_depend_t *conflicts = pkg->conflicts;
 500      int conflicts_count = pkg->conflicts_count;
 501      abstract_pkg_t **conflictee_provides = conflictee->provides;
 502      int conflictee_provides_count = conflictee->provides_count;
 503      int i, j, k;
 504      int possibility_count;
 505      struct depend **possibilities;
 506      abstract_pkg_t *possibility ;
 507
 508      for (i = 0; i < conflicts_count; i++) {
 509           possibility_count = conflicts[i].possibility_count;
 510           possibilities = conflicts[i].possibilities;
 511           for (j = 0; j < possibility_count; j++) {
 512                possibility = possibilities[j]->pkg;
 513                for (k = 0; k < conflictee_provides_count; k++) {
 514                     if (possibility == conflictee_provides[k]) {
 515                          return 1;
 516                     }
 517                }
 518           }
 519      }
 520      return 0;
 521 }
 522
 523 static char ** merge_unresolved(char ** oldstuff, char ** newstuff)
 524 {
 525     int oldlen = 0, newlen = 0;
 526     char ** result;
 527     int i, j;
 528
 529     if(!newstuff)
 530         return oldstuff;
 531
 532     while(oldstuff && oldstuff[oldlen]) oldlen++;
 533     while(newstuff && newstuff[newlen]) newlen++;
 534
 535     result = xrealloc(oldstuff, sizeof(char *) * (oldlen + newlen + 1));
 536
 537     for(i = oldlen, j = 0; i < (oldlen + newlen); i++, j++)
 538         *(result + i) = *(newstuff + j);
 539
 540     *(result + i) = NULL;
 541
 542     return result;
 543 }
 544
 545 /*
 546  * a kinda kludgy way to back out depends str from two different arrays (reg'l'r 'n pre)
 547  * this is null terminated, no count is carried around
 548  */
 549 char ** add_unresolved_dep(pkg_t * pkg, char ** the_lost, int ref_ndx)
 550 {
 551     int count;
 552     char ** resized;
 553     char *depend_str = pkg_depend_str(pkg, ref_ndx);
 554
 555     count = 0;
 556     while(the_lost && the_lost[count]) count++;
 557
 558     count++;  /* need one to hold the null */
 559     resized = xrealloc(the_lost, sizeof(char *) * (count + 1));
 560     resized[count - 1] = xstrdup(depend_str);
 561     resized[count] = NULL;
 562
 563     return resized;
 564 }
 565
 566 void buildProvides(hash_table_t * hash, abstract_pkg_t * ab_pkg, pkg_t * pkg)
 567 {
 568     int i;
 569
 570     /* every pkg provides itself */
 571     pkg->provides_count++;
 572     abstract_pkg_vec_insert(ab_pkg->provided_by, ab_pkg);
 573     pkg->provides = xcalloc(pkg->provides_count, sizeof(abstract_pkg_t *));
 574     pkg->provides[0] = ab_pkg;
 575
 576     for (i=1; i<pkg->provides_count; i++) {
 577         abstract_pkg_t *provided_abpkg = ensure_abstract_pkg_by_name(hash,
 578                         pkg->provides_str[i-1]);
 579
 580         pkg->provides[i] = provided_abpkg;
 581
 582         abstract_pkg_vec_insert(provided_abpkg->provided_by, ab_pkg);
 583     }
 584 }
 585
 586 /* Abhaya: added conflicts support */
 587 void buildConflicts(hash_table_t * hash, abstract_pkg_t * ab_pkg, pkg_t * pkg)
 588 {
 589     int i;
 590     compound_depend_t * conflicts;
 591
 592     if (!pkg->conflicts_count)
 593         return;
 594
 595     conflicts = pkg->conflicts = xcalloc(pkg->conflicts_count, sizeof(compound_depend_t));
 596     for (i = 0; i < pkg->conflicts_count; i++) {
 597          conflicts->type = CONFLICTS;
 598          parseDepends(conflicts, hash,
 599                       pkg->conflicts_str[i]);
 600          conflicts++;
 601     }
 602 }
 603
 604 void buildReplaces(hash_table_t * hash, abstract_pkg_t * ab_pkg, pkg_t * pkg)
 605 {
 606      int i;
 607
 608      if (!pkg->replaces_count)
 609           return;
 610
 611      pkg->replaces = xcalloc(pkg->replaces_count, sizeof(abstract_pkg_t *));
 612
 613      for(i = 0; i < pkg->replaces_count; i++){
 614           abstract_pkg_t *old_abpkg = ensure_abstract_pkg_by_name(hash, pkg->replaces_str[i]);
 615
 616           pkg->replaces[i] = old_abpkg;
 617
 618           if (!old_abpkg->replaced_by)
 619                old_abpkg->replaced_by = abstract_pkg_vec_alloc();
 620           /* if a package pkg both replaces and conflicts old_abpkg,
 621            * then add it to the replaced_by vector so that old_abpkg
 622            * will be upgraded to ab_pkg automatically */
 623           if (pkg_conflicts_abstract(pkg, old_abpkg))
 624                abstract_pkg_vec_insert(old_abpkg->replaced_by, ab_pkg);
 625      }
 626 }
 627
 628 void buildDepends(hash_table_t * hash, pkg_t * pkg)
 629 {
 630      int count;
 631      int i;
 632      compound_depend_t * depends;
 633
 634      if(!(count = pkg->pre_depends_count + pkg->depends_count + pkg->recommends_count + pkg->suggests_count))
 635           return;
 636
 637      depends = pkg->depends = xcalloc(count, sizeof(compound_depend_t));
 638
 639      for(i = 0; i < pkg->pre_depends_count; i++){
 640           parseDepends(depends, hash, pkg->pre_depends_str[i]);
 641           depends->type = PREDEPEND;
 642           depends++;
 643      }
 644
 645      for(i = 0; i < pkg->recommends_count; i++){
 646           parseDepends(depends, hash, pkg->recommends_str[i]);
 647           depends->type = RECOMMEND;
 648           depends++;
 649      }
 650
 651      for(i = 0; i < pkg->suggests_count; i++){
 652           parseDepends(depends, hash, pkg->suggests_str[i]);
 653           depends->type = SUGGEST;
 654           depends++;
 655      }
 656
 657      for(i = 0; i < pkg->depends_count; i++){
 658           parseDepends(depends, hash, pkg->depends_str[i]);
 659           depends++;
 660      }
 661 }
 662
 663 /*
 664  * pkg_depend_string: returns the depends string specified by index.
 665  *   All 4 kinds of dependences: dependence, pre-dependence, recommend, and suggest are number starting from 0.
 666  *   [0,npredepends) -> returns pre_depends_str[index]
 667  *   [npredepends,npredepends+nrecommends) -> returns recommends_str[index]
 668  *   [npredepends+nrecommends,npredepends+nrecommends+nsuggests) -> returns recommends_str[index]
 669  *   [npredepends+nrecommends+nsuggests,npredepends+nrecommends+nsuggests+ndepends) -> returns depends_str[index]
 670  */
 671 char *pkg_depend_str(pkg_t *pkg, int index)
 672 {
 673      if (index < pkg->pre_depends_count) {
 674           return pkg->pre_depends_str[index];
 675      }
 676      index -= pkg->pre_depends_count;
 677
 678      if (index < pkg->recommends_count) {
 679           return pkg->recommends_str[index];
 680      }
 681      index -= pkg->recommends_count;
 682
 683      if (index < pkg->suggests_count) {
 684           return pkg->suggests_str[index];
 685      }
 686      index -= pkg->suggests_count;
 687
 688      if (index < pkg->depends_count) {
 689           return pkg->depends_str[index];
 690      }
 691      fprintf(stderr, "pkg_depend_str: index %d out of range for pkg=%s\n", index, pkg->name);
 692      return NULL;
 693 }
 694
 695 void buildDependedUponBy(pkg_t * pkg, abstract_pkg_t * ab_pkg)
 696 {
 697      compound_depend_t * depends;
 698      int count, othercount;
 699      int i, j;
 700      abstract_pkg_t * ab_depend;
 701      abstract_pkg_t ** temp;
 702
 703      count = pkg->pre_depends_count + pkg->depends_count;
 704      depends = pkg->depends;
 705
 706      for (i = 0; i < count; i++) {
 707           for (j = 0; j < depends->possibility_count; j++){
 708                ab_depend = depends->possibilities[j]->pkg;
 709                if(!ab_depend->depended_upon_by)
 710                     ab_depend->depended_upon_by = xcalloc(1, sizeof(abstract_pkg_t *));
 711
 712                temp = ab_depend->depended_upon_by;
 713                othercount = 1;
 714                while(*temp){
 715                     temp++;
 716                     othercount++;
 717                }
 718                *temp = ab_pkg;
 719
 720                ab_depend->depended_upon_by = xrealloc(ab_depend->depended_upon_by,
 721                                                                         (othercount + 1) * sizeof(abstract_pkg_t *));
 722                /* the array may have moved */
 723                temp = ab_depend->depended_upon_by + othercount;
 724                *temp = NULL;
 725           }
 726           depends++;
 727      }
 728 }
 729
 730 static depend_t * depend_init(void)
 731 {
 732     depend_t * d = xcalloc(1, sizeof(depend_t));
 733     d->constraint = NONE;
 734     d->version = NULL;
 735     d->pkg = NULL;
 736
 737     return d;
 738 }
 739
 740 static int parseDepends(compound_depend_t *compound_depend,
 741                         hash_table_t * hash, char * depend_str)
 742 {
 743      char * pkg_name, buffer[2048];
 744      int num_of_ors = 0;
 745      int i;
 746      char * src, * dest;
 747      depend_t ** possibilities;
 748
 749      /* first count the number of ored possibilities for satisfying dependency */
 750      src = depend_str;
 751      while(*src)
 752           if(*src++ == '|')
 753                num_of_ors++;
 754
 755      compound_depend->type = DEPEND;
 756
 757      compound_depend->possibility_count = num_of_ors + 1;
 758      possibilities = xcalloc((num_of_ors + 1), sizeof(depend_t *) );
 759      compound_depend->possibilities = possibilities;
 760
 761      src = depend_str;
 762      for(i = 0; i < num_of_ors + 1; i++){
 763           possibilities[i] = depend_init();
 764           /* gobble up just the name first */
 765           dest = buffer;
 766           while(*src &&
 767                 !isspace(*src) &&
 768                 (*src != '(') &&
 769                 (*src != '*') &&
 770                 (*src != '|'))
 771                *dest++ = *src++;
 772           *dest = '\0';
 773           pkg_name = trim_alloc(buffer);
 774           if (pkg_name == NULL )
 775                return -ENOMEM;
 776
 777           /* now look at possible version info */
 778
 779           /* skip to next chars */
 780           if(isspace(*src))
 781                while(*src && isspace(*src)) src++;
 782
 783           /* extract constraint and version */
 784           if(*src == '('){
 785                src++;
 786                if(!strncmp(src, "<<", 2)){
 787                     possibilities[i]->constraint = EARLIER;
 788                     src += 2;
 789                }
 790                else if(!strncmp(src, "<=", 2)){
 791                     possibilities[i]->constraint = EARLIER_EQUAL;
 792                     src += 2;
 793                }
 794                else if(!strncmp(src, ">=", 2)){
 795                     possibilities[i]->constraint = LATER_EQUAL;
 796                     src += 2;
 797                }
 798                else if(!strncmp(src, ">>", 2)){
 799                     possibilities[i]->constraint = LATER;
 800                     src += 2;
 801                }
 802                else if(!strncmp(src, "=", 1)){
 803                     possibilities[i]->constraint = EQUAL;
 804                     src++;
 805                }
 806                /* should these be here to support deprecated designations; dpkg does */
 807                else if(!strncmp(src, "<", 1)){
 808                     possibilities[i]->constraint = EARLIER_EQUAL;
 809                     src++;
 810                }
 811                else if(!strncmp(src, ">", 1)){
 812                     possibilities[i]->constraint = LATER_EQUAL;
 813                     src++;
 814                }
 815
 816                /* now we have any constraint, pass space to version string */
 817                while(isspace(*src)) src++;
 818
 819                /* this would be the version string */
 820                dest = buffer;
 821                while(*src && *src != ')')
 822                     *dest++ = *src++;
 823                *dest = '\0';
 824
 825                possibilities[i]->version = trim_alloc(buffer);
 826                /*                   fprintf(stderr, "let's print the depends version string:");
 827                                     fprintf(stderr, "version %s\n", possibilities[i]->version);*/
 828                if (possibilities[i]->version == NULL )
 829                     return -ENOMEM;
 830
 831
 832           }
 833           /* hook up the dependency to its abstract pkg */
 834           possibilities[i]->pkg = ensure_abstract_pkg_by_name(hash, pkg_name);
 835
 836           free(pkg_name);
 837
 838           /* now get past the ) and any possible | chars */
 839           while(*src &&
 840                 (isspace(*src) ||
 841                  (*src == ')') ||
 842                  (*src == '|')))
 843                src++;
 844           if (*src == '*')
 845           {
 846                compound_depend->type = GREEDY_DEPEND;
 847                src++;
 848           }
 849      }
 850
 851      return 0;
 852 }