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
|
/* EINA_GRAPH - EFL graph processing library
* Copyright (C) 2013 Jérémy Zurcher
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to
* deal in the Software without restriction, including without limitation the
* rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies of the Software and its Copyright notices. In addition publicly
* documented acknowledgment must be given that this software has been used if no
* source code of this software is made available publicly. This includes
* acknowledgments in either Copyright notices, Manuals, Publicity and Marketing
* documents or any documentation provided with any product containing this
* software. This License does not apply to any software that links to the
* libraries provided by this software (statically or dynamically), but only to
* the software provided.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
* IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#ifndef _EINA_GRAPH_PRIVATE_H
#define _EINA_GRAPH_PRIVATE_H
#include <Eina.h>
#include "Eina_Graph.h"
extern int _eina_graph_log_dom;
#ifdef CRITICAL
#undef CRITICAL
#endif
#define CRITICAL(...) EINA_LOG_DOM_CRIT(_eina_graph_log_dom, __VA_ARGS__)
#ifdef ERR
#undef ERR
#endif
#define ERR(...) EINA_LOG_DOM_ERR(_eina_graph_log_dom, __VA_ARGS__)
#ifdef WRN
#undef WRN
#endif
#define WRN(...) EINA_LOG_DOM_WARN(_eina_graph_log_dom, __VA_ARGS__)
#ifdef INF
#undef INF
#endif
#define INF(...) EINA_LOG_DOM_INFO(_eina_graph_log_dom, __VA_ARGS__)
#ifdef DBG
#undef DBG
#endif
#define DBG(...) EINA_LOG_DOM_DBG(_eina_graph_log_dom, __VA_ARGS__)
typedef struct _Eina_Graph_Adjacents
{
unsigned int *data;
unsigned int total;
unsigned int count;
} Eina_Graph_Adjacents;
static inline void
eina_graph_adjacents_free(Eina_Graph_Adjacents *adjs)
{
if (adjs->data)
free(adjs->data);
adjs->data = NULL;
}
Eina_Bool
_eina_graph_adjacents_grow(Eina_Graph_Adjacents *adjs, unsigned int step);
static inline Eina_Bool
eina_graph_adjacents_push(Eina_Graph_Adjacents *adjs, unsigned int v, unsigned int step)
{
if (EINA_UNLIKELY((adjs->count + 1) > adjs->total))
if (!_eina_graph_adjacents_grow(adjs, step))
return EINA_FALSE;
adjs->data[adjs->count++] = v;
return EINA_TRUE;
}
/*+
* To cast a vertex number into Eina_List data.
*/
#define CAST_V(_v) ((void *) (uintptr_t) _v)
typedef struct _Eina_Graph
{
unsigned int vertices;
unsigned int edges;
unsigned int step;
Eina_Graph_Adjacents *adjs;
} _Eina_Graph;
typedef struct _Eina_Graph_DFS
{
unsigned int s;
unsigned int vertices;
Eina_Bool *marked;
unsigned int *edge_to;
} _Eina_Graph_DFS;
#endif /* _EINA_GRAPH_PRIVATE_H */
|
