aboutsummaryrefslogtreecommitdiffstats
path: root/doc/README.binarytrees
diff options
context:
space:
mode:
authorGerald Combs <gerald@wireshark.org>2006-05-31 19:12:15 +0000
committerGerald Combs <gerald@wireshark.org>2006-05-31 19:12:15 +0000
commiteb71f7fb96f883b748536eecde9f6f49eedbcfee (patch)
treee686fde4e5609ee0ed12778fccbded159b386785 /doc/README.binarytrees
parent2fd928645b5aa69feb967d00f8604b98ed0dc237 (diff)
Rename the main executable to "wireshark", along with more conversions:
ethereal.com -> wireshark.org mailing lists and addresses ETHEREAL -> WIRESHARK Man pages Automake/Autoconf names svn path=/trunk/; revision=18271
Diffstat (limited to 'doc/README.binarytrees')
-rw-r--r--doc/README.binarytrees14
1 files changed, 7 insertions, 7 deletions
diff --git a/doc/README.binarytrees b/doc/README.binarytrees
index c5c039a6d3..0561f8af71 100644
--- a/doc/README.binarytrees
+++ b/doc/README.binarytrees
@@ -13,12 +13,12 @@ Benefits of using binary trees are that they are incredibly fast for
accessing data and they scale very well with good characteristics even to
very large number of objects.
-Ethereal provides its own version of red black binary trees designed in
+Wireshark provides its own version of red black binary trees designed in
particular to be easy to use and to eliminate most of the memory management
often associated with such trees.
The trees supported by wireshark are currently all created using SEasonal
-storage which means that when you load a new trace into ethereal, the SEasonal
+storage which means that when you load a new trace into wireshark, the SEasonal
memory management will automatically release every single byte of data
associated with the tree.
@@ -34,8 +34,8 @@ void *se_tree_lookup32(se_tree_t *se_tree, guint32 key);
2.1 se_tree_create(int type, char *name);
se_tree_create() is used to initialize a tree that will be automatically
-cleared and reset everytime ethereal is resetting all SEasonal storage,
-that is every time you load a new capture file into ethereal or when
+cleared and reset everytime wireshark is resetting all SEasonal storage,
+that is every time you load a new capture file into wireshark or when
you rescan the entire capture file from scratch.
Name is just a literal text string and serves no other purpose than making
@@ -58,7 +58,7 @@ void proto_register_...(void) {
}
That is how easy it is to create a binary tree. You only need to create it once
-when ethereal starts and the tree will remain there until you exit ethereal.
+when wireshark starts and the tree will remain there until you exit wireshark.
Everytime a new capture is loaded, all nodes allocated to the tree is
automatically and the tree is reset without you having to do anything at all.
@@ -89,7 +89,7 @@ This is very neat and makes real difficult to have memory leaks in your code.
NOTE: When you insert items in the tree, it is very likely that you only
want to add any data to the tree during the very first time you process
a particular packet.
-Ethereal may reprocess the same packet multiple times afterwards by the user
+Wireshark may reprocess the same packet multiple times afterwards by the user
clicking on the packet or for other reasons.
You probably DO want to protect the insert call within an if statement such
as
@@ -175,7 +175,7 @@ until an array element where length==0 is found indicating the end of the
array.
NOTE: you MUST terminate the se_tree_key_t array by {0, NULL}
-If you forget to do this ethereal will immediately crash.
+If you forget to do this wireshark will immediately crash.
NOTE: length indicates the number of guint32 values in the vector, not number
of bytes.