[svn-r8475] Purpose:

    Code optimization

Description:
    Improved LRU algorithm for locating blocks of the correct size in the
block free-list

Platforms tested:
    Solaris 2.7 (arabica)
    FreeBSD 4.9 (sleipnir) w/parallel
    too minor for h5committest

1 files changed, 36 insertions, 26 deletions

diff --git a/src/H5FL.c b/src/H5FL.c
index 831cf25..0074f6d 100644
--- a/src/H5FL.c
+++ b/src/H5FL.c
@@ -26,14 +26,17 @@
  *      move frequently accessed free lists to the head of the queue.
  */
 
+/* Pablo information */
+/* (Put before include files to avoid problems with inline functions) */
+#define PABLO_MASK	H5FL_mask
+
 /* #define H5FL_DEBUG */
 
-#include "H5private.h"		/*library		  */
-#include "H5Eprivate.h"		/*error handling	  */
-#include "H5MMprivate.h"	/*Core memory management	  */
-#include "H5FLprivate.h"	/*Priority queues	  */
+#include "H5private.h"		/* Generic Functions			*/
+#include "H5Eprivate.h"		/* Error handling		  	*/
+#include "H5FLprivate.h"	/* Free Lists                           */
+#include "H5MMprivate.h"	/* Memory management			*/
 
-#define PABLO_MASK	H5FL_mask
 static int		interface_initialize_g = 0;
 #define INTERFACE_INIT	NULL
 
@@ -547,36 +550,43 @@ static H5FL_blk_node_t *
 H5FL_blk_find_list(H5FL_blk_node_t **head, size_t size)
 {
     H5FL_blk_node_t *temp;  /* Temp. pointer to node in the native list */
-    H5FL_blk_node_t *ret_value;
 
-    FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5FL_blk_find_list);
+    FUNC_ENTER_NOAPI_NOINIT_NOFUNC(H5FL_blk_find_list)
 
     /* Find the correct free list */
     temp=*head;
-    while(temp!=NULL && temp->size!=size)
+
+    /* Check if the node is at the head of the list */
+    if(temp && temp->size!=size) {
         temp=temp->next;
 
-    /* If the free list exists, move it to the front of the queue, if it's not there already */
-    if(temp!=NULL && temp!=*head) {
-        /* Take the node found out of it's current position */
-        if(temp->next==NULL) {
-            temp->prev->next=NULL;
-        } /* end if */
-        else {
-            temp->prev->next=temp->next;
-            temp->next->prev=temp->prev;
-        } /* end else */
+        while(temp!=NULL) {
+            /* Check if we found the correct node */
+            if(temp->size==size) {
+                /* Take the node found out of it's current position */
+                if(temp->next==NULL) {
+                    temp->prev->next=NULL;
+                } /* end if */
+                else {
+                    temp->prev->next=temp->next;
+                    temp->next->prev=temp->prev;
+                } /* end else */
+
+                /* Move the found node to the head of the list */
+                temp->prev=NULL;
+                temp->next=*head;
+                (*head)->prev=temp;
+                *head=temp;
+
+                /* Get out */
+                break;
+            } /* end if */
 
-        /* Move the found node to the head of the list */
-        temp->prev=NULL;
-        temp->next=*head;
-        (*head)->prev=temp;
-        *head=temp;
+            temp=temp->next;
+        } /* end while */
     } /* end if */
     
-    ret_value=temp;
-
-    FUNC_LEAVE_NOAPI(ret_value);
+    FUNC_LEAVE_NOAPI(temp)
 } /* end H5FL_blk_find_list() */