aboutsummaryrefslogtreecommitdiffstats
path: root/epan/emem.h
diff options
context:
space:
mode:
authorGuy Harris <guy@alum.mit.edu>2007-04-28 21:09:20 +0000
committerGuy Harris <guy@alum.mit.edu>2007-04-28 21:09:20 +0000
commitb98d651b21aa7b469211b268e7daff22f5a892f8 (patch)
tree337e2634a017fb7bd7852398ed5bccd8c2e89e01 /epan/emem.h
parentb19c9f63e9f951af112fc35780fcd58d41cc4a17 (diff)
In calls to the emem_tree routines, forcibly align items not known to be
aligned on 32-bit boundaries. svn path=/trunk/; revision=21611
Diffstat (limited to 'epan/emem.h')
-rw-r--r--epan/emem.h4
1 files changed, 4 insertions, 0 deletions
diff --git a/epan/emem.h b/epan/emem.h
index e834caa6c9..a440b9f61f 100644
--- a/epan/emem.h
+++ b/epan/emem.h
@@ -309,6 +309,10 @@ typedef struct _emem_tree_key_t {
* The data pointer should be allocated by SE allocators so that the
* data will be released at the same time as the tree itself is destroyed.
*
+ * Note: all the "key" members of the "key" argument MUST be aligned on
+ * 32-bit boundaries; otherwise, this code will crash on platforms such
+ * as SPARC that require aligned pointers.
+ *
* If you use ...32_array() calls you MUST make sure that every single node
* you add to a specific tree always has a key of exactly the same number of
* keylen words or things will most likely crash. Or at least that every single