blob: 15dfd2afc2a2ba7bcec6a2ef5d64b8cbb1f2aef2 (
plain)
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
|
/*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 2001 Gerald Combs
*
* SPDX-License-Identifier: GPL-2.0-or-later
*/
#include "config.h"
#include "syntax-tree.h"
#include "sttype-set.h"
/*
* The GSList stores a list of elements of the set. Each element is represented
* by two list items: (lower, upper) in case of a value range or (value, NULL)
* if the element is not a range value.
*/
static void
slist_stnode_free(gpointer data)
{
if (data) {
stnode_free((stnode_t *)data);
}
}
void
set_nodelist_free(GSList *params)
{
g_slist_free_full(params, slist_stnode_free);
}
static void
sttype_set_free(gpointer value)
{
/* If the data was not claimed with stnode_steal_data(), free it. */
if (value) {
set_nodelist_free((GSList *)value);
}
}
void
sttype_set_replace_element(stnode_t *node, stnode_t *oldnode, stnode_t *newnode)
{
GSList *nodelist = (GSList*)stnode_data(node);
/* This deliberately checks both the left and right nodes, covering both
* the lower and upper bound for ranges. NULL right nodes (in case of
* normal, non-range elements) will usually not match "oldnode". */
while (nodelist) {
if (nodelist->data == oldnode) {
nodelist->data = newnode;
break;
}
nodelist = g_slist_next(nodelist);
}
}
void
sttype_register_set(void)
{
static sttype_t set_type = {
STTYPE_SET,
"SET",
NULL,
sttype_set_free,
NULL
};
sttype_register(&set_type);
}
/*
* Editor modelines - https://www.wireshark.org/tools/modelines.html
*
* Local variables:
* c-basic-offset: 8
* tab-width: 8
* indent-tabs-mode: t
* End:
*
* vi: set shiftwidth=8 tabstop=8 noexpandtab:
* :indentSize=8:tabSize=8:noTabs=false:
*/
|