xdasd_list.h

Go to the documentation of this file.

/*----------------------------------------------------------------------------
 * Copyright (c) 2006, Novell, Inc.
 * All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without 
 * modification, are permitted provided that the following conditions are 
 * met:
 * 
 *     * Redistributions of source code must retain the above copyright 
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright 
 *       notice, this list of conditions and the following disclaimer in the 
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the Novell nor the names of its contributors 
 *       may be used to endorse or promote products derived from this 
 *       software without specific prior written permission.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 
 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 
 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 
 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 
 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 
 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *--------------------------------------------------------------------------*/

#ifndef XDASD_LIST_H_INCLUDED
#define XDASD_LIST_H_INCLUDED

#define XDL_IS_HEAD(x) ((x)->isHead)

#define XDL_IS_EMPTY(h)    \
   ((((h)->next == (h)) && ((h)->prev == (h)) )? 1: 0)

#define XDL_INSERT(n,x)    \
  {(n)->prev = (x);        \
   (n)->next = (x)->next;  \
   (x)->next->prev = (n);  \
   (x)->next = (n);}

#define XDL_INSERT_AFTER XDL_INSERT

#define XDL_INSERT_BEFORE(n,x)\
  {(n)->next = (x);           \
   (n)->prev = (x)->prev;     \
   (x)->prev->next = (n);     \
   (x)->prev = (n);}

#define XDL_INSERT_WORKNODE_LAST(n,x)  \
  {gettimeofday(&((n)->timer));        \
   (n)->next = (x);                    \
   (n)->prev = (x)->prev;              \
   (x)->prev->next = (n);              \
   (x)->prev = (n);}

#define XDL_INSERT_WORKNODE_FIRST(n,x) \
  {gettimeofday(&((n)->timer));        \
   (n)->prev = (x);                    \
   (n)->next = (x)->next;              \
   (x)->next->prev = (n);              \
   (x)->next = (n);}

#define XDL_UNLINK(x)            \
  {(x)->prev->next = (x)->next;  \
   (x)->next->prev = (x)->prev;} 

#define XDL_IS_LAST(h,x)   \
   (((x)->prev == (h) && (h)->prev == (x))? 1: 0)

#define XDL_IS_FIRST(h,x)  \
   (((x)->prev == (h) && (h)->next == (x))? 1: 0)

#define XDL_IS_ONLY(h,x)   \
   (((x)->next == (h) && (h)->prev == (x))? 1: 0)

#define XDL_LINK_HEAD(d,s) \
  {(d)->next = (s)->next;  \
   (d)->prev = (s)->prev;  \
   (s)->next->prev = (d);  \
   (s)->prev->next = (d);}

typedef struct XDLItem_tag
{
   struct XDLItem_tag * prev;
   struct XDLItem_tag * next;
} XDLItem;

typedef struct XDList_tag
{
   XDLItem * head;
   XDLItem * tail;
   int count;
} XDList;

XDLItem * xdasd_list_unlink(XDList * list, XDLItem * item);
XDLItem * xdasd_list_link_head(XDList * list, XDLItem * item);
XDLItem * xdasd_list_link_tail(XDList * list, XDLItem * item);

#endif   /* XDASD_LIST_H_INCLUDED */