Changeset 437 for trunk/kernel/libk

Timestamp:

Mar 28, 2018, 2:40:29 PM (7 years ago)

Author:

alain

Message:

Fix various bugs

File:

• trunk/kernel/libk/list.h (modified) (2 diffs)

trunk/kernel/libk/list.h

@@ -97 +97 @@
 #define LIST_LAST( root , type , member )               \
         LIST_ELEMENT( (root)->pred , type , member )
-
-/***************************************************************************
- * This function returns the pointer on the next list_entry_t.
- ***************************************************************************
- * @ root    : pointer on the list root.
- * @ current : pointer on the current list_entry_t.
- * @ returns pointer on next entry if success.
- *   returns NULL if list empty or next is the root. 
- **************************************************************************/
-static inline list_entry_t * list_next( list_entry_t * root,
-                                        list_entry_t * current )
-{
-        if((root == root->next) || (current->next == root)) return NULL;
-  
-        return current->next;
-}
-
-/***************************************************************************
- * This function returns the pointer on the previous list_entry_t.
- ***************************************************************************
- * @ root    : pointer on the list root.
- * @ current : pointer on the current list_entry.
- * @ returns pointer on previous entry if success.
- *   returns NULL if list empty or previous is the root. 
- **************************************************************************/
-static inline list_entry_t * list_pred( list_entry_t * root,
-                                        list_entry_t * current )
-{
-        if((root == root->next) || (current->pred == root))
-                return NULL;
-  
-        return current->pred;
-}
 
 /***************************************************************************
@@ -211 +178 @@
                                   list_entry_t * entry )
 {
-    list_add_first( root->pred , entry );
+    list_entry_t * pred_entry;
+    list_entry_t * next_entry;
+
+        pred_entry = root->pred;
+        next_entry = root;
+        
+        entry->next = next_entry;
+        entry->pred = pred_entry;
+  
+        pred_entry->next = entry;
+        next_entry->pred = entry;
 }