lib/libalpm/graph.c


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52

/*
 *  graph.c - helpful graph structure and setup/teardown methods
 *
 *  Copyright (c) 2007-2011 Pacman Development Team <pacman-dev@archlinux.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, see <http://www.gnu.org/licenses/>.
 */

#include "config.h"

#include "graph.h"
#include "util.h"
#include "log.h"

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

  CALLOC(graph, 1, sizeof(pmgraph_t), RET_ERR(PM_ERR_MEMORY, NULL));
  return graph;
}

void _alpm_graph_free(void *data)
{
  pmgraph_t *graph = data;
  /* make my children forget about me */
  for(alpm_list_t *i = graph->children; i; i = i->next) {
    pmgraph_t *child = i->data;
    child->parent = NULL;
  }
  alpm_list_free(graph->children);
  /* and make my parents forget about me too */
  if(graph->parent) {
    alpm_list_t *me = alpm_list_find_ptr(graph->parent->children, &data);
    graph->parent->children = alpm_list_remove_item(graph->parent->children,
        me);
  }
  free(graph);
}

/* vim: set ts=2 sw=2 noet: */