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
|
/* Licensed under LGPLv2+ - see LICENSE file for details */
#include "config.h"
#include <stdbool.h>
#include <stdlib.h>
#include <assert.h>
#include <ccan/aga/aga.h>
#include "private.h"
void aga_init_graph_(struct aga_graph *g,
aga_first_edge_fn first_edge,
aga_next_edge_fn next_edge,
aga_edge_info_fn edge_info)
{
g->sequence = 0;
g->error = 0;
g->first_edge = first_edge;
g->next_edge = next_edge;
g->edge_info = edge_info;
}
int aga_error(const struct aga_graph *g)
{
return g->error;
}
void aga_fail(struct aga_graph *g, int error)
{
g->error = error;
}
int aga_start(struct aga_graph *g)
{
if (g->sequence & 1) /* Odd means someone's already running */
return -1;
assert(g->error == 0);
/* FIXME: Want an atomic cmpxchg to make this thread safe */
++g->sequence;
return 0;
}
bool aga_check_state(const struct aga_graph *g)
{
if (!(g->sequence & 1))
return false; /* No algo in progress */
if (g->error)
return false; /* error state */
return true;
}
void aga_finish(struct aga_graph *g)
{
assert(g->sequence & 1);
g->error = 0;
g->sequence++;
}
bool aga_update_node(const struct aga_graph *g, struct aga_node *node)
{
if (node->sequence == g->sequence)
return false;
node->sequence = g->sequence;
return true;
}
const void *aga_first_edge(const struct aga_graph *g, const struct aga_node *n)
{
return g->first_edge(g, n);
}
const void *aga_next_edge(const struct aga_graph *g, const struct aga_node *n,
const void *e)
{
if (!e)
return NULL;
else
return g->next_edge(g, n, e);
}
int aga_edge_info(const struct aga_graph *g, const struct aga_node *n,
const void *e, struct aga_edge_info *ei)
{
int rc;
ei->to = NULL;
rc = g->edge_info(g, n, e, ei);
assert(rc <= 0);
return rc;
}
|
