libopkg/pkg_vec.c

   1 /* pkg_vec.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 <fnmatch.h>
  20 #include "xregex.h"
  21 #include "pkg.h"
  22 #include "opkg_message.h"
  23
  24 pkg_vec_t * pkg_vec_alloc(void)
  25 {
  26     pkg_vec_t * vec = (pkg_vec_t *)malloc(sizeof(pkg_vec_t));
  27     if (!vec) {
  28       fprintf(stderr, "%s: out of memory\n", __FUNCTION__);
  29       return NULL;
  30     }
  31     vec->pkgs = NULL;
  32     vec->len = 0;
  33
  34     return vec;
  35 }
  36
  37 void pkg_vec_free(pkg_vec_t *vec)
  38 {
  39     if (!vec)
  40       return;
  41
  42     if (vec->pkgs)
  43       free(vec->pkgs);
  44
  45     free(vec);
  46 }
  47
  48 /*
  49  * assumption: all names in a vector are identical
  50  * assumption: all version strings are trimmed,
  51  *             so identical versions have identical version strings,
  52  *             implying identical packages; let's marry these
  53  */
  54 pkg_t *pkg_vec_insert_merge(pkg_vec_t *vec, pkg_t *pkg, int set_status,opkg_conf_t *conf)
  55 {
  56      int i;
  57      int found = 0;
  58
  59      /* look for a duplicate pkg by name, version, and architecture */
  60      for (i = 0; i < vec->len; i++){
  61          opkg_message(conf, OPKG_DEBUG2, "Function: %s. Found pkg=%s version=%s arch=%s cmp=%s version=%s arch=%s \n",
  62                       __FUNCTION__, pkg->name, pkg->version, pkg->architecture,
  63                        vec->pkgs[i]->name, vec->pkgs[i]->version,vec->pkgs[i]->architecture );
  64           if ((strcmp(pkg->name, vec->pkgs[i]->name) == 0)
  65               && (pkg_compare_versions(pkg, vec->pkgs[i]) == 0)
  66               && (strcmp(pkg->architecture, vec->pkgs[i]->architecture) == 0)) {
  67                found  = 1;
  68                opkg_message(conf, OPKG_DEBUG2, "Function: %s. Found duplicate for pkg=%s version=%s arch=%s\n",
  69                              __FUNCTION__, pkg->name, pkg->version, pkg->architecture);
  70                break;
  71           }
  72      }
  73
  74      /* we didn't find one, add it */
  75      if (!found){
  76          opkg_message(conf, OPKG_DEBUG2, "Function: %s. Adding new pkg=%s version=%s arch=%s\n",
  77                       __FUNCTION__, pkg->name, pkg->version, pkg->architecture);
  78
  79           vec->pkgs = (pkg_t **)realloc(vec->pkgs, (vec->len + 1) * sizeof(pkg_t *));
  80           vec->pkgs[vec->len] = pkg;
  81           vec->len++;
  82           return pkg;
  83      }
  84      /* update the one that we have */
  85      else {
  86           opkg_message(conf, OPKG_DEBUG2, "Function: %s. calling pkg_merge for pkg=%s version=%s arch=%s",
  87                         __FUNCTION__, pkg->name, pkg->version, pkg->architecture);
  88           if (set_status) {
  89                /* this is from the status file, so need to merge with existing database */
  90                opkg_message(conf, OPKG_DEBUG2, " with set_status\n");
  91                pkg_merge(vec->pkgs[i], pkg, set_status);
  92                /* XXX: CLEANUP: It's not so polite to free something here
  93                   that was passed in from above. */
  94                pkg_deinit(pkg);
  95                free(pkg);
  96           } else {
  97                opkg_message(conf, OPKG_DEBUG2, " WITHOUT set_status\n");
  98                /* just overwrite the old one */
  99                pkg_deinit(vec->pkgs[i]);
 100                free(vec->pkgs[i]);
 101                vec->pkgs[i] = pkg;
 102           }
 103           return vec->pkgs[i];
 104      }
 105 }
 106
 107 void pkg_vec_insert(pkg_vec_t *vec, const pkg_t *pkg)
 108 {
 109      int found = 0;
 110
 111      /* we didn't find one, add it */
 112      if(!found){
 113           vec->pkgs = (pkg_t **)realloc(vec->pkgs, (vec->len + 1) * sizeof(pkg_t *));
 114           *(const pkg_t **)&vec->pkgs[vec->len] = pkg;
 115           vec->len++;
 116      }
 117 }
 118
 119 int pkg_vec_contains(pkg_vec_t *vec, pkg_t *apkg)
 120 {
 121      int i;
 122      for (i = 0; i < vec->len; i++)
 123           if (vec->pkgs[i] == apkg)
 124                return 1;
 125      return 0;
 126 }
 127
 128 void pkg_vec_sort(pkg_vec_t *vec, compare_fcn_t compar)
 129 {
 130      qsort(vec->pkgs, vec->len, sizeof(pkg_t *), compar);
 131 }
 132
 133 int pkg_vec_clear_marks(pkg_vec_t *vec)
 134 {
 135      int npkgs = vec->len;
 136      int i;
 137      for (i = 0; i < npkgs; i++) {
 138           pkg_t *pkg = vec->pkgs[i];
 139           pkg->state_flag &= ~SF_MARKED;
 140      }
 141      return 0;
 142 }
 143
 144 int pkg_vec_mark_if_matches(pkg_vec_t *vec, const char *pattern)
 145 {
 146      int matching_count = 0;
 147      pkg_t **pkgs = vec->pkgs;
 148      int npkgs = vec->len;
 149      int i;
 150      for (i = 0; i < npkgs; i++) {
 151           pkg_t *pkg = pkgs[i];
 152           if (fnmatch(pattern, pkg->name, 0)==0) {
 153                pkg->state_flag |= SF_MARKED;
 154                matching_count++;
 155           }
 156      }
 157      return matching_count;
 158 }
 159
 160
 161 abstract_pkg_vec_t * abstract_pkg_vec_alloc(void)
 162 {
 163     abstract_pkg_vec_t * vec ;
 164     vec = (abstract_pkg_vec_t *)malloc(sizeof(abstract_pkg_vec_t));
 165     if (!vec) {
 166       fprintf(stderr, "%s: out of memory\n", __FUNCTION__);
 167       return NULL;
 168     }
 169     vec->pkgs = NULL;
 170     vec->len = 0;
 171
 172     return vec;
 173 }
 174
 175 void abstract_pkg_vec_free(abstract_pkg_vec_t *vec)
 176 {
 177     if (!vec)
 178       return;
 179     free(vec->pkgs);
 180     free(vec);
 181 }
 182
 183 /*
 184  * assumption: all names in a vector are unique
 185  */
 186 void abstract_pkg_vec_insert(abstract_pkg_vec_t *vec, abstract_pkg_t *pkg)
 187 {
 188     vec->pkgs = (abstract_pkg_t **) realloc(vec->pkgs, (vec->len + 1) * sizeof(abstract_pkg_t *));
 189     vec->pkgs[vec->len] = pkg;
 190     vec->len++;
 191 }
 192
 193 abstract_pkg_t * abstract_pkg_vec_get(abstract_pkg_vec_t *vec, int i)
 194 {
 195     if (vec->len > i)
 196         return vec->pkgs[i];
 197     else
 198         return NULL;
 199 }
 200
 201 int abstract_pkg_vec_contains(abstract_pkg_vec_t *vec, abstract_pkg_t *apkg)
 202 {
 203      int i;
 204      for (i = 0; i < vec->len; i++)
 205           if (vec->pkgs[i] == apkg)
 206                return 1;
 207      return 0;
 208 }
 209
 210 void abstract_pkg_vec_sort(pkg_vec_t *vec, compare_fcn_t compar)
 211 {
 212      qsort(vec->pkgs, vec->len, sizeof(pkg_t *), compar);
 213 }
 214