-
Notifications
You must be signed in to change notification settings - Fork 3
/
rxe_node.c
57 lines (51 loc) · 1.49 KB
/
rxe_node.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
53
54
55
/*
* librxe - a library for enumerating sets described by regexes, version 0.9
* (C) 2011 Marco "Kiko" Carnut <kiko at postcogito dot 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
* http://www.gnu.org/licenses/gpl-2.0.html for details.
*
*/
#include "rxe.h"
struct rxe_node *rxe_new_node(struct rxe_alt *alt)
{
struct rxe_node *node = NEW(1,struct rxe_node);
node->next = NULL;
node->prev = alt->tail;
mpz_init(node->nitems);
mpz_init(node->start);
node->len = node->iterator = 0;
node->is_backref = 0;
node->str = NULL;
node->rxe = NULL;
alt->nnodes++;
if (alt->tail) alt->tail->next = node;
alt->tail = node;
if (!alt->head) alt->head = node;
if (!alt->curr) alt->curr = node;
return node;
}
void rxe_free_node_data(struct rxe_node *node)
{
if (node->rxe) {
rxe_free(node->rxe);
node->rxe = NULL;
}
if (node->len) {
free(node->str);
node->len = 0;
node->str = NULL;
}
}
void rxe_free_node(struct rxe_node *node)
{
rxe_free_node_data(node);
rxe_mem_free(node);
}