2 * Definitions for Wireshark memory management and garbage collection
7 * Wireshark - Network traffic analyzer
8 * By Gerald Combs <gerald@wireshark.org>
9 * Copyright 1998 Gerald Combs
11 * This program is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU General Public License
13 * as published by the Free Software Foundation; either version 2
14 * of the License, or (at your option) any later version.
16 * This program is distributed in the hope that it will be useful,
17 * but WITHOUT ANY WARRANTY; without even the implied warranty of
18 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 * GNU General Public License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with this program; if not, write to the Free Software
23 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
29 #include "gnuc_format_check.h"
31 /* Functions for handling memory allocation and garbage collection with
32 * a packet lifetime scope.
33 * These functions are used to allocate memory that will only remain persistent
34 * until Wireshark starts dissecting the next packet in the list.
35 * Everytime Wireshark starts decoding the next packet all memory allocated
36 * through these functions will be released back to the free pool.
38 * These functions are very fast and offer automatic garbage collection:
39 * Everytime a new packet is dissected, all memory allocations done in
40 * the previous packet is freed.
42 /* Initialize packet-lifetime memory allocation pool. This function is called
43 * once when [t]Wireshark is initialized to set up the required structures.
45 void ep_init_chunk(void);
47 /* Allocate memory with a packet lifetime scope */
48 void *ep_alloc(size_t size);
49 #define ep_new(type) ((type*)ep_alloc(sizeof(type)))
51 /* Allocate memory with a packet lifetime scope and fill it with zeros*/
52 void* ep_alloc0(size_t size);
53 #define ep_new0(type) ((type*)ep_alloc0(sizeof(type)))
55 /* Duplicate a string with a packet lifetime scope */
56 gchar* ep_strdup(const gchar* src);
58 /* Duplicate at most n characters of a string with a packet lifetime scope */
59 gchar* ep_strndup(const gchar* src, size_t len);
61 /* Duplicate a buffer with a packet lifetime scope */
62 void* ep_memdup(const void* src, size_t len);
64 /* Create a formatted string with a packet lifetime scope */
65 gchar* ep_strdup_vprintf(const gchar* fmt, va_list ap);
66 gchar* ep_strdup_printf(const gchar* fmt, ...)
67 GNUC_FORMAT_CHECK(printf, 1, 2);
69 /* allocates with a packet lifetime scope an array of type made of num elements */
70 #define ep_alloc_array(type,num) (type*)ep_alloc(sizeof(type)*(num))
73 * Splits a string into a maximum of max_tokens pieces, using the given
74 * delimiter. If max_tokens is reached, the remainder of string is appended
75 * to the last token. Consecutive delimiters are treated as a single delimiter.
77 * the vector and all the strings are allocated with packet lifetime scope
79 gchar** ep_strsplit(const gchar* string, const gchar* delimiter, int max_tokens);
81 /* release all memory allocated in the previous packet dissector */
82 void ep_free_all(void);
85 /* a stack implemented using ephemeral allocators */
87 typedef struct _ep_stack_frame_t** ep_stack_t;
89 struct _ep_stack_frame_t {
91 struct _ep_stack_frame_t* below;
92 struct _ep_stack_frame_t* above;
96 * creates an empty stack with a packet lifetime scope
98 ep_stack_t ep_stack_new(void);
101 * pushes item into stack, returns item
103 void* ep_stack_push(ep_stack_t stack, void* item);
106 * pops an item from the stack
108 void* ep_stack_pop(ep_stack_t stack);
111 * returns the item on top of the stack without popping it
113 #define ep_stack_peek(stack) ((*(stack))->payload)
116 /* Functions for handling memory allocation and garbage collection with
117 * a capture lifetime scope.
118 * These functions are used to allocate memory that will only remain persistent
119 * until Wireshark opens a new capture or capture file.
120 * Everytime Wireshark starts a new capture or opens a new capture file
121 * all the data allocated through these functions will be released back
124 * These functions are very fast and offer automatic garbage collection.
126 /* Initialize capture-lifetime memory allocation pool. This function is called
127 * once when [t]Wireshark is initialized to set up the required structures.
129 void se_init_chunk(void);
131 /* Allocate memory with a capture lifetime scope */
132 void *se_alloc(size_t size);
134 /* Allocate memory with a capture lifetime scope and fill it with zeros*/
135 void* se_alloc0(size_t size);
137 /* Duplicate a string with a capture lifetime scope */
138 gchar* se_strdup(const gchar* src);
140 /* Duplicate at most n characters of a string with a capture lifetime scope */
141 gchar* se_strndup(const gchar* src, size_t len);
143 /* Duplicate a buffer with a capture lifetime scope */
144 void* se_memdup(const void* src, size_t len);
146 /* Create a formatted string with a capture lifetime scope */
147 gchar* se_strdup_vprintf(const gchar* fmt, va_list ap);
148 gchar* se_strdup_printf(const gchar* fmt, ...)
149 GNUC_FORMAT_CHECK(printf, 1, 2);
151 /* allocates with a capture lifetime scope an array of type made of num elements */
152 #define se_alloc_array(type,num) (type*)se_alloc(sizeof(type)*(num))
154 /* release all memory allocated */
155 void se_free_all(void);
160 /**************************************************************
162 **************************************************************/
163 #define EMEM_TREE_RB_COLOR_RED 0x00
164 #define EMEM_TREE_RB_COLOR_BLACK 0x01
165 typedef struct _emem_tree_node_t {
166 struct _emem_tree_node_t *parent;
167 struct _emem_tree_node_t *left;
168 struct _emem_tree_node_t *right;
176 /* Right now we only do basic red/black trees but in the future we might want
177 * to try something different, such as a tree where each node keeps track
178 * of how many times it has been looked up, and letting often looked up
179 * nodes bubble upwards in the tree using rotate_right/left.
180 * That would probably be good for things like nfs filehandles
182 #define EMEM_TREE_TYPE_RED_BLACK 1
183 typedef struct _emem_tree_t {
184 struct _emem_tree_t *next;
186 char *name; /* just a string to make debugging easier */
187 emem_tree_node_t *tree;
188 void *(*malloc)(size_t);
191 /* list of all trees with se allocation scope so that they can all be reset
192 * automatically when we free all se memory
194 extern emem_tree_t *se_trees;
197 /* *******************************************************************
198 * Tree functions for SE memory allocation scope
199 * ******************************************************************* */
200 /* This function is used to create a se based tree with monitoring.
201 * When the SE heap is released back to the system the pointer to the
202 * tree is automatically reset to NULL.
204 * type is : EMEM_TREE_TYPE_RED_BLACK for a standard red/black tree.
206 emem_tree_t *se_tree_create(int type, char *name);
208 /* This function is similar to the se_tree_create() call but with the
209 * difference that when the se memory is release everything including the
210 * pointer to the tree itself will be released.
211 * This tree will not be just reset to zero it will be completely forgotten
213 * Use this function for when you want to store the pointer to a tree inside
214 * another structure that is also se allocated so that when the structure is
215 * released, the tree will be completely released as well.
217 emem_tree_t *se_tree_create_non_persistent(int type, char *name);
220 * Insert data into the tree and key it by a 32bit integer value
222 #define se_tree_insert32 emem_tree_insert32
225 * Retreive the data at the search key. the search key is a 32bit integer value
227 #define se_tree_lookup32 emem_tree_lookup32
229 /* se_tree_lookup32_le
230 * Retreive the data for the largest key that is less than or equal
233 #define se_tree_lookup32_le emem_tree_lookup32_le
235 /* se_tree_insert32_array
236 * Insert data into the tree and key it by a 32bit integer value
238 #define se_tree_insert32_array emem_tree_insert32_array
240 /* se_tree_lookup32_array
241 * Lookup data from the tree that is index by an array
243 #define se_tree_lookup32_array emem_tree_lookup32_array
247 /* Create a new string based hash table */
248 #define se_tree_create_string() se_tree_create(SE_TREE_TYPE_RED_BLACK)
250 /* Insert a new value under a string key */
251 #define se_tree_insert_string emem_tree_insert_string
253 /* Lookup the value under a string key */
254 #define se_tree_lookup_string emem_tree_lookup_string
257 /* *******************************************************************
258 * Tree functions for PE memory allocation scope
259 * ******************************************************************* */
260 /* These trees have PErmanent allocation scope and will never be released
262 emem_tree_t *pe_tree_create(int type, char *name);
263 #define pe_tree_insert32 emem_tree_insert32
264 #define pe_tree_lookup32 emem_tree_lookup32
265 #define pe_tree_lookup32_le emem_tree_lookup32_le
266 #define pe_tree_insert32_array emem_tree_insert32_array
267 #define pe_tree_lookup32_array emem_tree_lookup32_array
268 #define pe_tree_insert_string emem_tree_insert_string
269 #define pe_tree_lookup_string emem_tree_lookup_string
273 /* ******************************************************************
274 * Real tree functions
275 * ****************************************************************** */
277 /* This function is used to insert a node indexed by a guint32 key value.
278 * The data pointer should be allocated by the appropriate storage scope
279 * so that it will be released at the same time as the tree itself is
282 void emem_tree_insert32(emem_tree_t *se_tree, guint32 key, void *data);
284 /* This function will look up a node in the tree indexed by a guint32 integer
287 void *emem_tree_lookup32(emem_tree_t *se_tree, guint32 key);
289 /* This function will look up a node in the tree indexed by a guint32 integer
291 * The function will return the node that has the largest key that is
292 * equal to or smaller than the search key, or NULL if no such key was
295 void *emem_tree_lookup32_le(emem_tree_t *se_tree, guint32 key);
297 typedef struct _emem_tree_key_t {
298 guint32 length; /*length in guint32 words */
302 /* This function is used to insert a node indexed by a sequence of guint32
304 * The data pointer should be allocated by SE allocators so that the
305 * data will be released at the same time as the tree itself is destroyed.
307 * If you use ...32_array() calls you MUST make sure that every single node
308 * you add to a specific tree always has a key of exactly the same number of
309 * keylen words or things will most likely crash. Or at least that every single
310 * item that sits behind the same top level node always have exactly the same
313 * One way to guarantee this is the way that NFS does this for the
314 * nfs_name_snoop_known tree which holds filehandles for both v2 and v3.
315 * v2 filehandles are always 32 bytes (8 words) while v3 filehandles can have
316 * any length (though 32bytes are most common).
317 * The NFS dissector handles this by providing a guint32 containing the length
318 * as the very first item in this vector :
320 * emem_tree_key_t fhkey[3];
322 * fhlen=nns->fh_length;
324 * fhkey[0].key=&fhlen;
325 * fhkey[1].length=fhlen/4;
326 * fhkey[1].key=nns->fh;
329 void emem_tree_insert32_array(emem_tree_t *se_tree, emem_tree_key_t *key, void *data);
331 /* This function will look up a node in the tree indexed by a sequence of
332 * guint32 integer values.
334 void *emem_tree_lookup32_array(emem_tree_t *se_tree, emem_tree_key_t *key);
336 /* Insert a new value under a string key */
337 void emem_tree_insert_string(emem_tree_t* h, const gchar* k, void* v);
339 /* Lookup the value under a string key */
340 void* emem_tree_lookup_string(emem_tree_t* h, const gchar* k);
346 void emem_print_tree(emem_tree_t* emem_tree);