summaryrefslogtreecommitdiff
path: root/epan/emem.h
AgeCommit message (Collapse)AuthorFilesLines
2006-05-28Ethereal->WiresharkAnders Broman1-7/+7
svn path=/trunk/; revision=18234
2006-05-21name changeRonnie Sahlberg1-2/+2
svn path=/trunk/; revision=18197
2006-05-02Not all compilers support unnamed struct/union fields withinGuy Harris1-1/+1
structs/unions (GCC supports it "for compatibility with other compilers"; presumably that's not for compatibility with the version of Sun C that rejected it - was that a PCCism?). svn path=/trunk/; revision=18072
2006-03-18rename se_tree_lookup32_less_than_or_equal()Ronnie Sahlberg1-1/+1
to se_tree_lookup32_le() svn path=/trunk/; revision=17664
2006-03-18add new se_tree_lookup32_less_than_or_equal() callRonnie Sahlberg1-0/+8
svn path=/trunk/; revision=17663
2006-03-11give se_trees names so that it is easier to debug and to log how often ↵Ronnie Sahlberg1-2/+3
certain trees are accessed svn path=/trunk/; revision=17587
2006-03-07Rename set_string_hash... into se_tree_xxx_string as proposed by ronnie for ↵Luis Ontanon1-3/+3
consistency whith its real nature. svn path=/trunk/; revision=17496
2006-03-07Add a hash table with string keys based on the red/black tree.Luis Ontanon1-0/+15
svn path=/trunk/; revision=17485
2006-03-06add helper to build (red/black) trees from a key that is a vector of guin32 ↵Ronnie Sahlberg1-0/+67
arrays. test this functionality by calling these vector insert/lookup tree functions from the nfs dissector for when filehandles are used as a key. these vector functions could also be used to efficiently store conversations : se_tree_key_t[6] = { { addr_len/4, &src_addr }, { addr_len/4, &dst_addr }, { 1, &src_port32 }, { 1, &dst_port32 }, { 1, &protocol32 }, { 0, NULL } } (the nfs dissector needs a LOT of work. It is very painful to work with very large nfs traces with all the memory it wastes (and eats) as well as how slow all the tables make it) svn path=/trunk/; revision=17477
2006-03-05initial implementation of binary tree support with se allocation scopeRonnie Sahlberg1-0/+39
this is to test out a basic implementation of binary trees and the api required for the helpers svn path=/trunk/; revision=17467
2006-02-14Have the emem.c memdup routines accept and return "void *", asGuy Harris1-2/+2
"memcpy()" does; that eliminates some compiler warnings ("void *" is the type usually used for "generic pointer"). svn path=/trunk/; revision=17297
2005-10-10Add "ep_strdup_vprintf()" and "se_strdup_vprintf()", for completeness.Guy Harris1-2/+4
Make them not reuse a va_list; there's no guarantee that it can be used more than once and, in fact, on some platforms, you *can't* use it more than once. Based on a patch by Pekka Pietikainen. Clean up indentation a bit. svn path=/trunk/; revision=16174
2005-10-01emem.[ch]:Luis Ontanon1-0/+30
Add a simple stack implememtation that uses ep_alloc Add ep_new() ep_new0() macros tpg.[ch]: use the stack in tpg helpers svn path=/trunk/; revision=16061
2005-09-15Tag ep_strdup_printf() and se_strdup_printf() as printf-like functions,Guy Harris1-2/+6
so we get compile-time checking of arguments when possible. svn path=/trunk/; revision=15813
2005-08-16se_alloc not ep_alloc!Luis Ontanon1-1/+1
svn path=/trunk/; revision=15365
2005-08-16more allocators se_alloc0() se_memdups() se_strdup() se_strndup() ↵Luis Ontanon1-2/+21
se_strdup_printf() svn path=/trunk/; revision=15364
2005-08-12Add beginning of seasonal allocation in addition to the existing ephemeral ↵Ronnie Sahlberg1-0/+26
ones. svn path=/trunk/; revision=15301
2005-07-26new functions:Luis Ontanon1-0/+14
ep_tvb_memdup() ep_alloc0() ep_strsplit() add all of the ep_ allocators to libethereal.def svn path=/trunk/; revision=15100
2005-07-24add some utility functions that use ep_alloc instead of g_malloc.Luis Ontanon1-0/+14
ep_memdup ep_strdup ep_strndup ep_strdup_printf svn path=/trunk/; revision=15018
2005-07-22Set svn:keywords and svn:eol-styleJörg Mayer1-1/+1
svn path=/trunk/; revision=14996
2005-07-22EMEM : a simple and FAST api to allocate memory that will be automatically ↵Ronnie Sahlberg1-0/+49
freed() when the next packet is dissected. This offesr memory allocation with a packet scope making memory leaks less likely and memory management faster. Add initialization calls for both tethereal and ethereal. Convert the ip_to_str() function to use this and avoid doing the silly rotating buffers thing it previously did. We also need an equivalent set of functions for allocation with capture file scope (free when next capture is loaded) but i dont know where to put the free_all call. svn path=/trunk/; revision=14984
generated by cgit v1.2.1 (git 2.18.0) at 2024-07-09 01:56:47 +0000