xbps/lib/package_fulldeptree.c
Juan RP 1bae26606e Introduce xbps_{pkgdb,rpool}_get_pkg_fulldeptree().
These routines return a xbps_array_t with a full sorted dependency graph
for the target pkg, by querying pkgdb or rpool.

Update xbps-query(8) to use the new libxbps API.
2014-11-20 09:23:51 +01:00

195 lines
5.2 KiB
C

/*-
* Copyright (c) 2014 Juan Romero Pardines.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <errno.h>
#include "xbps_api_impl.h"
struct pkgdep {
SLIST_ENTRY(pkgdep) pkgdep_entries;
const char *pkg;
xbps_array_t rdeps;
};
static SLIST_HEAD(pkgdep_head, pkgdep) pkgdep_list =
SLIST_HEAD_INITIALIZER(pkgdep_list);
static xbps_dictionary_t pkgdep_pvmap;
static int
collect_rdeps(struct xbps_handle *xhp, xbps_array_t rdeps, bool rpool)
{
xbps_array_t currdeps;
xbps_dictionary_t pkgd;
const char *curdep;
for (unsigned int i = 0; i < xbps_array_count(rdeps); i++) {
struct pkgdep *pd;
const char *pkgver;
bool virtual = false, found = false;
xbps_array_get_cstring_nocopy(rdeps, i, &curdep);
if (rpool) {
if ((pkgd = xbps_rpool_get_pkg(xhp, curdep)) == NULL) {
pkgd = xbps_rpool_get_virtualpkg(xhp, curdep);
virtual = true;
}
} else {
if ((pkgd = xbps_pkgdb_get_pkg(xhp, curdep)) == NULL) {
pkgd = xbps_pkgdb_get_virtualpkg(xhp, curdep);
virtual = true;
}
}
if (pkgd == NULL) {
xbps_dbg_printf(xhp, "%s: cannot find `%s' dependency\n",
__func__, curdep);
return ENOENT;
}
currdeps = xbps_dictionary_get(pkgd, "run_depends");
xbps_dictionary_get_cstring_nocopy(pkgd, "pkgver", &pkgver);
assert(pkgver);
if (virtual) {
char *p;
if (((p = xbps_pkgpattern_name(curdep)) == NULL) &&
((p = xbps_pkg_name(curdep)) == NULL))
return EINVAL;
if (pkgdep_pvmap == NULL)
pkgdep_pvmap = xbps_dictionary_create();
xbps_dictionary_set_cstring_nocopy(pkgdep_pvmap, p, pkgver);
free(p);
}
/* uniquify dependencies, sorting will be done later */
SLIST_FOREACH(pd, &pkgdep_list, pkgdep_entries) {
if (strcmp(pd->pkg, pkgver) == 0) {
found = true;
break;
}
}
if (!found) {
pd = malloc(sizeof(*pd));
assert(pd);
pd->pkg = pkgver;
pd->rdeps = xbps_array_copy(currdeps);
SLIST_INSERT_HEAD(&pkgdep_list, pd, pkgdep_entries);
}
if (xbps_array_count(currdeps)) {
int rv;
if ((rv = collect_rdeps(xhp, currdeps, rpool)) != 0)
return rv;
}
}
return 0;
}
static xbps_array_t
sortfulldeptree(void)
{
struct pkgdep *pd;
xbps_array_t result;
unsigned int ndeps = 0;
result = xbps_array_create();
assert(result);
SLIST_FOREACH(pd, &pkgdep_list, pkgdep_entries) {
if (!pd->rdeps) {
xbps_array_add_cstring_nocopy(result, pd->pkg);
SLIST_REMOVE(&pkgdep_list, pd, pkgdep, pkgdep_entries);
}
ndeps++;
}
while (xbps_array_count(result) < ndeps) {
bool found = false;
SLIST_FOREACH(pd, &pkgdep_list, pkgdep_entries) {
unsigned int i = 0, mdeps = 0, rdeps = 0;
rdeps = xbps_array_count(pd->rdeps);
for (i = 0; i < rdeps; i++) {
const char *pkgdep;
char *pkgname;
xbps_array_get_cstring_nocopy(pd->rdeps, i, &pkgdep);
if (((pkgname = xbps_pkgpattern_name(pkgdep)) == NULL) &&
((pkgname = xbps_pkg_name(pkgdep)) == NULL))
return NULL;
if (xbps_match_pkgname_in_array(result, pkgname)) {
mdeps++;
free(pkgname);
continue;
}
if (xbps_dictionary_get(pkgdep_pvmap, pkgname)) {
mdeps++;
free(pkgname);
continue;
}
free(pkgname);
}
if (mdeps == rdeps) {
found = true;
break;
}
}
if (found && !xbps_match_string_in_array(result, pd->pkg)) {
xbps_array_add_cstring_nocopy(result, pd->pkg);
SLIST_REMOVE(&pkgdep_list, pd, pkgdep, pkgdep_entries);
}
}
return result;
}
xbps_array_t HIDDEN
xbps_get_pkg_fulldeptree(struct xbps_handle *xhp, const char *pkg, bool rpool)
{
xbps_array_t rdeps;
xbps_dictionary_t pkgd;
int rv;
if (rpool) {
if (((pkgd = xbps_rpool_get_pkg(xhp, pkg)) == NULL) &&
((pkgd = xbps_rpool_get_virtualpkg(xhp, pkg)) == NULL))
return NULL;
} else {
if (((pkgd = xbps_pkgdb_get_pkg(xhp, pkg)) == NULL) &&
((pkgd = xbps_pkgdb_get_virtualpkg(xhp, pkg)) == NULL))
return NULL;
}
if ((rdeps = xbps_dictionary_get(pkgd, "run_depends"))) {
if ((rv = collect_rdeps(xhp, rdeps, rpool)) != 0)
return NULL;
}
return sortfulldeptree();
}