From ac7d5ef06a6d6e8d84abbd1f0b82162725f98326 Mon Sep 17 00:00:00 2001
From: Joel Sherrill <joel.sherrill@OARcorp.com>
Date: Thu, 11 May 1995 17:39:37 +0000
Subject: Initial revision

---
 cpukit/score/macros/rtems/score/chain.inl | 200 ++++++++++++++++++++++++++++++
 1 file changed, 200 insertions(+)
 create mode 100644 cpukit/score/macros/rtems/score/chain.inl

(limited to 'cpukit/score/macros/rtems/score/chain.inl')

diff --git a/cpukit/score/macros/rtems/score/chain.inl b/cpukit/score/macros/rtems/score/chain.inl
new file mode 100644
index 0000000000..a53b3fc270
--- /dev/null
+++ b/cpukit/score/macros/rtems/score/chain.inl
@@ -0,0 +1,200 @@
+/*  macros/chain.h
+ *
+ *  This include file contains the bodies of the routines which are
+ *  associated with doubly linked chains and inlined.
+ *
+ *  COPYRIGHT (c) 1989, 1990, 1991, 1992, 1993, 1994.
+ *  On-Line Applications Research Corporation (OAR).
+ *  All rights assigned to U.S. Government, 1994.
+ *
+ *  This material may be reproduced by or for the U.S. Government pursuant
+ *  to the copyright license under the clause at DFARS 252.227-7013.  This
+ *  notice must appear in all copies of this file and its derivatives.
+ *
+ *  $Id$
+ */
+
+#ifndef __MACROS_CHAIN_h
+#define __MACROS_CHAIN_h
+
+/*PAGE
+ *
+ *  _Chain_Are_nodes_equal
+ */
+
+#define _Chain_Are_nodes_equal( _left, _right ) \
+  ( (_left) == (_right) )
+
+/*PAGE
+ *
+ *  _Chain_Is_null
+ */
+
+#define _Chain_Is_null( _the_chain ) \
+  ( (_the_chain) == NULL )
+
+/*PAGE
+ *
+ *  _Chain_Is_null_node
+ */
+
+#define _Chain_Is_null_node( _the_node ) \
+  ( (_the_node) == NULL )
+
+/*PAGE
+ *
+ *  _Chain_Head
+ */
+
+#define _Chain_Head( _the_chain ) \
+   ((Chain_Node *) (_the_chain))
+
+/*PAGE
+ *
+ *  _Chain_Tail
+ */
+
+#define _Chain_Tail( _the_chain ) \
+   ((Chain_Node *) &(_the_chain)->permanent_null)
+
+/*PAGE
+ *
+ *  _Chain_Is_empty
+ */
+
+#define _Chain_Is_empty( _the_chain ) \
+  ( (_the_chain)->first == _Chain_Tail( (_the_chain) ) )
+
+/*PAGE
+ *
+ *  _Chain_Is_first
+ */
+
+#define _Chain_Is_first( _the_node ) \
+  ( (the_node)->previous == NULL )
+
+/*PAGE
+ *
+ *  _Chain_Is_last
+ */
+
+#define _Chain_Is_last( _the_node ) \
+  ( (_the_node)->next == NULL )
+
+/*PAGE
+ *
+ *  _Chain_Has_only_one_node
+ */
+
+#define _Chain_Has_only_one_node( _the_chain ) \
+  ( (_the_chain)->first == (_the_chain)->last )
+
+/*PAGE
+ *
+ *  _Chain_Is_head
+ */
+
+#define _Chain_Is_head( _the_chain, _the_node ) \
+   ( (_the_node) == _Chain_Head( (_the_chain) ) )
+
+/*PAGE
+ *
+ *  _Chain_Is_tail
+ */
+
+#define _Chain_Is_tail( _the_chain, _the_node ) \
+   ( (_the_node) == _Chain_Tail( (_the_chain) ) )
+
+/*PAGE
+ *
+ *  Chain_Initialize_empty
+ */
+
+#define _Chain_Initialize_empty( _the_chain ) \
+{ \
+  (_the_chain)->first          = _Chain_Tail( (_the_chain) ); \
+  (_the_chain)->permanent_null = NULL; \
+  (_the_chain)->last           = _Chain_Head( (_the_chain) ); \
+}
+
+/*PAGE
+ *
+ *  _Chain_Extract_unprotected
+ */
+
+#define _Chain_Extract_unprotected( _the_node ) \
+{ \
+  Chain_Node *_next; \
+  Chain_Node *_previous; \
+   \
+  _next           = (_the_node)->next; \
+  _previous       = (_the_node)->previous; \
+  _next->previous = _previous; \
+  _previous->next = _next; \
+}
+
+/*PAGE
+ *
+ *  _Chain_Get_unprotected
+ */
+
+/*PAGE
+ *
+ *  Chain_Get_unprotected
+ */
+
+#define _Chain_Get_unprotected( _the_chain ) \
+  (( !_Chain_Is_empty( (_the_chain) ) ) \
+    ? _Chain_Get_unprotected( (_the_chain) ) \
+    : NULL)
+
+/*PAGE
+ *
+ *  _Chain_Insert_unprotected
+ */
+
+#define _Chain_Insert_unprotected( _after_node, _the_node ) \
+{  \
+  Chain_Node *_before_node; \
+   \
+  (_the_node)->previous  = (_after_node); \
+  _before_node           = (_after_node)->next; \
+  (_after_node)->next    = (_the_node);  \
+  (_the_node)->next      = _before_node;  \
+  _before_node->previous = (_the_node);  \
+}
+
+/*PAGE
+ *
+ *  _Chain_Append_unprotected
+ */
+
+#define _Chain_Append_unprotected( _the_chain, _the_node ) \
+{ \
+  Chain_Node *_old_last_node; \
+    \
+  (_the_node)->next     = _Chain_Tail( (_the_chain) ); \
+  _old_last_node        = (_the_chain)->last; \
+  (_the_chain)->last    = (_the_node); \
+  _old_last_node->next  = (_the_node); \
+  (_the_node)->previous = _old_last_node; \
+}
+
+/*PAGE
+ *
+ *  _Chain_Prepend_unprotected
+ */
+
+#define _Chain_Prepend_unprotected( _the_chain, _the_node ) \
+  _Chain_Insert_unprotected( _Chain_Head( (_the_chain) ), (_the_node) )
+
+/*PAGE
+ *
+ *  _Chain_Prepend
+ */
+
+#define _Chain_Prepend( _the_chain, _the_node ) \
+  _Chain_Insert( _Chain_Head( (_the_chain) ), (_the_node) )
+
+#endif
+/* end of include file */
-- 
cgit v1.2.3