[svn-r14353] Description:

    - Add hash value for skip list string types, to reduce # of string
        comparisons.
    - Fixed bug with metadata/small data block aggregator adding size == 0
        block into file free space list.
    - Refactored metadata/small data block aggregator code into single set of
        common routines.
    - Changed block aggregator code to be smarter about releasing space in the
        'other' block when the 'other' block has aggregated enough data.

Tested on:
        FreeBSD/32 6.2 (duty) in debug mode
        FreeBSD/64 6.2 (liberty) w/C++ & FORTRAN, in debug mode
        Linux/32 2.6 (kagiso) w/PGI compilers, w/C++ & FORTRAN, w/threadsafe,
                                in debug mode
        Linux/64-amd64 2.6 (smirom) w/default API=1.6.x, w/C++ & FORTRAN,
                                in production mode
        Linux/64-ia64 2.6 (cobalt) w/Intel compilers, w/C++ & FORTRAN,
                                in production mode
        Solaris/32 2.10 (linew) w/deprecated symbols disabled, w/C++ & FORTRAN,
                                w/szip filter, in production mode
        Mac OS X/32 10.4.10 (amazon) in debug mode
        Linux/64-ia64 2.4 (tg-login3) w/parallel, w/FORTRAN, in production mode

1 files changed, 4 insertions, 3 deletions

diff --git a/test/tskiplist.c b/test/tskiplist.c
index 0a1ef25..6f56c39 100644
--- a/test/tskiplist.c
+++ b/test/tskiplist.c
@@ -539,7 +539,7 @@ test_skiplist_string(void)
         {32,"32"},
         {80,"80"},
         {90,"90"}};
-    string_node sorted_data[10]={
+    string_node hashed_data[10]={
         { 5,"05"},
         {10,"10"},
         {15,"15"},
@@ -549,7 +549,8 @@ test_skiplist_string(void)
         {32,"32"},
         {50,"50"},
         {80,"80"},
-        {90,"90"}};
+        {90,"90"}
+        };
     string_node *found_item;    /* Item found in skip list */
     herr_t ret;         /* Generic return value */
 
@@ -579,7 +580,7 @@ test_skiplist_string(void)
     u=0;
     while(node!=NULL) {
         found_item=H5SL_item(node);
-        VERIFY(found_item->i,sorted_data[u].i,"H5SL_next");
+        VERIFY(found_item->i, hashed_data[u].i, "H5SL_next");
         u++;
         node=H5SL_next(node);
     } /* end while */