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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
|
/* Licensed under LGPLv2+ - see LICENSE file for details */
#include "config.h"
#include <stdbool.h>
#include <ccan/aga/aga.h>
#include <ccan/hash/hash.h>
#include <ccan/htable/htable.h>
#include <ccan/container_of/container_of.h>
#include <ccan/tal/tal.h>
#include <ccan/agar/agar.h>
#define HASH_BASE 0
struct agar_node {
const void *nr;
struct aga_node n;
};
struct agar_state {
struct agar_graph *gr;
struct aga_graph g;
struct htable nodes;
};
static size_t agar_node_hash(const struct agar_node *nn)
{
return hash_pointer(nn->nr, HASH_BASE);
}
static size_t agar_rehash(const void *elem, void *p)
{
return agar_node_hash(elem);
}
static bool agar_node_cmp(const void *candidate, void *ptr)
{
struct agar_node *nn = (struct agar_node *)candidate;
return (nn->nr == ptr);
}
static struct aga_node *nr_to_n(struct agar_state *sr, const void *nr)
{
struct agar_node *nn;
size_t hash = hash_pointer(nr, HASH_BASE);
bool rc;
nn = htable_get(&sr->nodes, hash, agar_node_cmp, nr);
if (!nn) {
nn = tal(sr, struct agar_node);
assert(nn);
nn->nr = nr;
aga_node_init(&nn->n);
rc = htable_add(&sr->nodes, hash, nn);
assert(rc);
}
return nn ? &nn->n : NULL;
}
static const void *n_to_nr(struct agar_state *sr, const struct aga_node *n)
{
struct agar_node *nn = container_of(n, struct agar_node, n);
return nn->nr;
}
static int convert_edge_info(const struct aga_graph *g,
const struct aga_node *n,
const void *e, struct aga_edge_info *ei)
{
struct agar_state *sr = container_of(g, struct agar_state, g);
const void *nr = n_to_nr(sr, n);
struct agar_edge_info eir;
int rc;
eir.to = NULL;
rc = sr->gr->edge_info(sr->gr, nr, e, &eir);
if (eir.to)
ei->to = nr_to_n(sr, eir.to);
else
ei->to = NULL;
return rc;
}
static const void *convert_first_edge(const struct aga_graph *g,
const struct aga_node *n)
{
struct agar_state *sr = container_of(g, struct agar_state, g);
const void *nr = n_to_nr(sr, n);
return sr->gr->first_edge(sr->gr, nr);
}
static const void *convert_next_edge(const struct aga_graph *g,
const struct aga_node *n,
const void *e)
{
struct agar_state *sr = container_of(g, struct agar_state, g);
const void *nr = n_to_nr(sr, n);
return sr->gr->next_edge(sr->gr, nr, e);
}
void agar_init_graph(struct agar_graph *gr,
agar_first_edge_fn first_edge,
agar_next_edge_fn next_edge,
agar_edge_info_fn edge_info)
{
gr->edge_info = edge_info;
gr->first_edge = first_edge;
gr->next_edge = next_edge;
}
int agar_error(struct agar_state *sr)
{
return aga_error(&sr->g);
}
static void agar_destruct_htable(struct agar_state *sr)
{
htable_clear(&sr->nodes);
}
static struct agar_state *agar_new(void *ctx, struct agar_graph *gr)
{
struct agar_state *sr = tal(ctx, struct agar_state);
assert(sr);
sr->gr = gr;
htable_init(&sr->nodes, agar_rehash, NULL);
tal_add_destructor(sr, agar_destruct_htable);
aga_init_graph(&sr->g, convert_first_edge, convert_next_edge,
convert_edge_info);
return sr;
}
const void *agar_first_edge(const struct agar_graph *gr, const void *nr)
{
return gr->first_edge(gr, nr);
}
const void *agar_next_edge(const struct agar_graph *gr,
const void *nr, const void *e)
{
if (!e)
return NULL;
else
return gr->next_edge(gr, nr, e);
}
int agar_edge_info(const struct agar_graph *gr, const void *nr, const void *e,
struct agar_edge_info *eir)
{
int rc;
eir->to = NULL;
rc = gr->edge_info(gr, nr, e, eir);
assert(rc <= 0);
return rc;
}
/*
* Depth first search
*/
struct agar_dfs_state {
struct agar_state sr;
};
struct agar_state *agar_dfs_new(void *ctx, struct agar_graph *gr)
{
struct agar_state *sr = agar_new(ctx, gr);
if (aga_dfs_start(&sr->g) < 0) {
tal_free(sr);
return NULL;
}
return sr;
}
bool agar_dfs_explore(struct agar_state *sr, const void *nr,
const void **nextr)
{
struct aga_node *next;
next = aga_dfs_explore(&sr->g, nr_to_n(sr, nr));
if (!next)
return false;
*nextr = n_to_nr(sr, next);
return true;
}
/*
* Breadth first search
*/
struct agar_state *agar_bfs_new(void *ctx, struct agar_graph *gr)
{
struct agar_state *sr = agar_new(ctx, gr);
if (aga_bfs_start(&sr->g) < 0) {
tal_free(sr);
return NULL;
}
return sr;
}
bool agar_bfs_explore(struct agar_state *sr, const void *nr,
const void **nextr)
{
struct aga_node *next;
next = aga_bfs_explore(&sr->g, nr_to_n(sr, nr));
if (!next)
return false;
*nextr = n_to_nr(sr, next);
return true;
}
|
