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
|
/* next_tvb.c
* Routines for "next tvb" list
*
* $Id$
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* 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
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
#include <glib.h>
#include <epan/packet.h>
#include <epan/emem.h>
#include "next_tvb.h"
void next_tvb_init(next_tvb_list_t *list) {
list->first = NULL;
list->last = NULL;
list->count = 0;
}
void next_tvb_add_handle(next_tvb_list_t *list, tvbuff_t *tvb, proto_tree *tree, dissector_handle_t handle) {
next_tvb_item_t *item;
item = ep_new(next_tvb_item_t);
item->type = NTVB_HANDLE;
item->handle = handle;
item->tvb = tvb;
item->tree = tree;
if (list->last) {
list->last->next = item;
} else {
list->first = item;
}
item->next = NULL;
item->previous = list->last;
list->last = item;
list->count++;
}
void next_tvb_add_uint(next_tvb_list_t *list, tvbuff_t *tvb, proto_tree *tree, dissector_table_t table, guint32 uint_val) {
next_tvb_item_t *item;
item = ep_new(next_tvb_item_t);
item->type = NTVB_UINT;
item->table = table;
item->uint_val = uint_val;
item->tvb = tvb;
item->tree = tree;
if (list->last) {
list->last->next = item;
} else {
list->first = item;
}
item->next = NULL;
item->previous = list->last;
list->last = item;
list->count++;
}
void next_tvb_add_string(next_tvb_list_t *list, tvbuff_t *tvb, proto_tree *tree, dissector_table_t table, const gchar *string) {
next_tvb_item_t *item;
item = ep_new(next_tvb_item_t);
item->type = NTVB_STRING;
item->table = table;
item->string = string;
item->tvb = tvb;
item->tree = tree;
if (list->last) {
list->last->next = item;
} else {
list->first = item;
}
item->next = NULL;
item->previous = list->last;
list->last = item;
list->count++;
}
void next_tvb_call(next_tvb_list_t *list, packet_info *pinfo, proto_tree *tree, dissector_handle_t handle, dissector_handle_t data_handle) {
next_tvb_item_t *item;
item = list->first;
while (item) {
if (item->tvb && tvb_length(item->tvb)) {
switch (item->type) {
case NTVB_HANDLE:
call_dissector((item->handle) ? item->handle : ((handle) ? handle : data_handle), item->tvb, pinfo, (item->tree) ? item->tree : tree);
break;
case NTVB_UINT:
dissector_try_uint(item->table, item->uint_val, item->tvb, pinfo, (item->tree) ? item->tree : tree);
break;
case NTVB_STRING:
dissector_try_string(item->table, item->string, item->tvb, pinfo, (item->tree) ? item->tree : tree);
break;
}
}
item = item->next;
}
}
|
