1 /* pkg_vec.c - the opkg package management system
5 Copyright (C) 2002 Compaq Computer Corporation
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.
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.
22 #include "opkg_message.h"
24 pkg_vec_t
* pkg_vec_alloc(void)
26 pkg_vec_t
* vec
= (pkg_vec_t
*)calloc(1, sizeof(pkg_vec_t
));
28 fprintf(stderr
, "%s: out of memory\n", __FUNCTION__
);
37 void pkg_vec_free(pkg_vec_t
*vec
)
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
54 pkg_t
*pkg_vec_insert_merge(pkg_vec_t
*vec
, pkg_t
*pkg
, int set_status
,opkg_conf_t
*conf
)
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)) {
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
);
74 /* we didn't find one, add it */
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
);
79 vec
->pkgs
= (pkg_t
**)realloc(vec
->pkgs
, (vec
->len
+ 1) * sizeof(pkg_t
*));
80 vec
->pkgs
[vec
->len
] = pkg
;
84 /* update the one that we have */
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
);
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. */
97 opkg_message(conf
, OPKG_DEBUG2
, " WITHOUT set_status\n");
98 /* just overwrite the old one */
99 pkg_deinit(vec
->pkgs
[i
]);
107 int pkg_vec_insert_called
=0;
108 void pkg_vec_insert(pkg_vec_t
*vec
, const pkg_t
*pkg
)
110 vec
->pkgs
= (pkg_t
**)realloc(vec
->pkgs
, (vec
->len
+ 1) * sizeof(pkg_t
*));
111 pkg_vec_insert_called
++;
112 *(const pkg_t
**)&vec
->pkgs
[vec
->len
] = pkg
;
116 int pkg_vec_contains(pkg_vec_t
*vec
, pkg_t
*apkg
)
119 for (i
= 0; i
< vec
->len
; i
++)
120 if (vec
->pkgs
[i
] == apkg
)
125 void pkg_vec_sort(pkg_vec_t
*vec
, compare_fcn_t compar
)
127 qsort(vec
->pkgs
, vec
->len
, sizeof(pkg_t
*), compar
);
130 int pkg_vec_clear_marks(pkg_vec_t
*vec
)
132 int npkgs
= vec
->len
;
134 for (i
= 0; i
< npkgs
; i
++) {
135 pkg_t
*pkg
= vec
->pkgs
[i
];
136 pkg
->state_flag
&= ~SF_MARKED
;
141 int pkg_vec_mark_if_matches(pkg_vec_t
*vec
, const char *pattern
)
143 int matching_count
= 0;
144 pkg_t
**pkgs
= vec
->pkgs
;
145 int npkgs
= vec
->len
;
147 for (i
= 0; i
< npkgs
; i
++) {
148 pkg_t
*pkg
= pkgs
[i
];
149 if (fnmatch(pattern
, pkg
->name
, 0)==0) {
150 pkg
->state_flag
|= SF_MARKED
;
154 return matching_count
;
158 abstract_pkg_vec_t
* abstract_pkg_vec_alloc(void)
160 abstract_pkg_vec_t
* vec
;
161 vec
= (abstract_pkg_vec_t
*)calloc(1, sizeof(abstract_pkg_vec_t
));
163 fprintf(stderr
, "%s: out of memory\n", __FUNCTION__
);
172 void abstract_pkg_vec_free(abstract_pkg_vec_t
*vec
)
181 * assumption: all names in a vector are unique
183 void abstract_pkg_vec_insert(abstract_pkg_vec_t
*vec
, abstract_pkg_t
*pkg
)
185 vec
->pkgs
= (abstract_pkg_t
**) realloc(vec
->pkgs
, (vec
->len
+ 1) * sizeof(abstract_pkg_t
*));
186 vec
->pkgs
[vec
->len
] = pkg
;
190 abstract_pkg_t
* abstract_pkg_vec_get(abstract_pkg_vec_t
*vec
, int i
)
198 int abstract_pkg_vec_contains(abstract_pkg_vec_t
*vec
, abstract_pkg_t
*apkg
)
201 for (i
= 0; i
< vec
->len
; i
++)
202 if (vec
->pkgs
[i
] == apkg
)
207 void abstract_pkg_vec_sort(pkg_vec_t
*vec
, compare_fcn_t compar
)
209 qsort(vec
->pkgs
, vec
->len
, sizeof(pkg_t
*), compar
);
212 int pkg_compare_names(const void *p1
, const void *p2
)
214 const pkg_t
*pkg1
= *(const pkg_t
**)p1
;
215 const pkg_t
*pkg2
= *(const pkg_t
**)p2
;
216 if (pkg1
->name
== NULL
)
218 if (pkg2
->name
== NULL
)
220 return(strcmp(pkg1
->name
, pkg2
->name
));