path: root/lib/libalpm/deps.c

/*
 *  deps.c
 *
 *  Copyright (c) 2002-2006 by Judd Vinet <jvinet@zeroflux.org>
 *  Copyright (c) 2005 by Aurelien Foret <orelien@chez.com>
 *  Copyright (c) 2005, 2006 by Miklos Vajna <vmiklos@frugalware.org>
 *
 *  This program is free software; you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation; either version 2 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program; if not, write to the Free Software
 *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,
 *  USA.
 */

#include "config.h"

#include <stdlib.h>
#include <stdio.h>
#include <string.h>

/* libalpm */
#include "deps.h"
#include "alpm_list.h"
#include "util.h"
#include "log.h"
#include "error.h"
#include "package.h"
#include "db.h"
#include "cache.h"
#include "handle.h"

static pmgraph_t *_alpm_graph_new(void)
{
  pmgraph_t *graph = NULL;

  MALLOC(graph, sizeof(pmgraph_t), RET_ERR(PM_ERR_MEMORY, NULL));

  if(graph) {
    graph->state = 0;
    graph->data = NULL;
    graph->parent = NULL;
    graph->children = NULL;
    graph->childptr = NULL;
  }
  return(graph);
}

static void _alpm_graph_free(void *data)
{
  pmgraph_t *graph = data;
  alpm_list_free(graph->children);
  free(graph);
}

pmdepmissing_t *_alpm_depmiss_new(const char *target, pmdepmod_t depmod,
    const char *depname, const char *depversion)
{
  pmdepmissing_t *miss;

  ALPM_LOG_FUNC;

  MALLOC(miss, sizeof(pmdepmissing_t), RET_ERR(PM_ERR_MEMORY, NULL));

  strncpy(miss->target, target, PKG_NAME_LEN);
  miss->depend.mod = depmod;
  strncpy(miss->depend.name, depname, PKG_NAME_LEN);
  if(depversion) {
    strncpy(miss->depend.version, depversion, PKG_VERSION_LEN);
  } else {
    miss->depend.version[0] = 0;
  }

  return(miss);
}

int _alpm_depmiss_isin(pmdepmissing_t *needle, alpm_list_t *haystack)
{
  alpm_list_t *i;

  ALPM_LOG_FUNC;

  for(i = haystack; i; i = i->next) {
    pmdepmissing_t *miss = i->data;
    if(!strcmp(needle->target, miss->target) &&
       needle->depend.mod == miss->depend.mod &&
       !strcmp(needle->depend.name, miss->depend.name) &&
       !strcmp(needle->depend.version, miss->depend.version)) {
      return(1);
    }
  }

  return(0);
}

/* Convert a list of pmpkg_t * to a graph structure,
 * with a edge for each dependency.
 * Returns a list of vertices (one vertex = one package)
 * (used by alpm_sortbydeps)
 */
static alpm_list_t *_alpm_graph_init(alpm_list_t *targets)
{
  alpm_list_t *i, *j, *k;
  alpm_list_t *vertices = NULL;
  /* We create the vertices */
  for(i = targets; i; i = i->next) {
    pmgraph_t *vertex = _alpm_graph_new();
    vertex->data = (void *)i->data;
    vertices = alpm_list_add(vertices, vertex);
  }

  /* We compute the edges */
  for(i = vertices; i; i = i->next) {