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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
/*
* Copyright (c) 2019 Balabit
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*
* As an additional exemption you are allowed to compile & link against the
* OpenSSL libraries as published by the OpenSSL project. See the file
* COPYING for details.
*
*/
#include "cfg-walker.h"
#include "logpipe.h"
Arc *
arc_new(LogPipe *from, LogPipe *to, ArcType arc_type)
{
Arc *self = g_new0(Arc, 1);
self->from = from;
self->to = to;
self->arc_type = arc_type;
return self;
};
void
arc_free(Arc *self)
{
g_free(self);
}
static guint
arc_hash(Arc *arc)
{
return g_direct_hash(arc->from);
}
static gboolean
arc_equal(Arc *arc1, Arc *arc2)
{
return arc1->to == arc2->to;
}
static void walk_pipe(LogPipe *self, gpointer *user_data);
static void
_add_arc_and_walk(Arc *arc, gpointer *user_data)
{
GHashTable **arcs = user_data[1];
g_hash_table_insert(*arcs, arc, NULL);
walk_pipe(arc->to, user_data);
}
static void
walk_pipe(LogPipe *self, gpointer *user_data)
{
GHashTable **nodes = user_data[0];
if (g_hash_table_contains(*nodes, self))
return;
g_hash_table_insert(*nodes, self, NULL);
GList *new_arcs = log_pipe_get_arcs(self);
g_list_foreach(new_arcs, (GFunc)_add_arc_and_walk, user_data);
g_list_free(new_arcs);
}
void
cfg_walker_get_graph(GPtrArray *start_nodes, GHashTable **nodes, GHashTable **arcs)
{
*nodes = g_hash_table_new(g_direct_hash, g_direct_equal);
*arcs = g_hash_table_new_full((GHashFunc)arc_hash, (GEqualFunc)arc_equal, (GDestroyNotify)arc_free, NULL);
g_ptr_array_foreach(start_nodes, (GFunc)walk_pipe, (gpointer [])
{
nodes, arcs
});
}
|
