listnode.h

/*
 * Copyright 2003, 2004 Ian Searle. All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following
 * conditions are met:  
 *
 * 1: Redistributions of source code must retain the above
 * copyright notice, this list of conditions and the following
 * disclaimer. 
 *
 * 2: 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. 
 *
 * THIS SOFTWARE IS PROVIDED ``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 IAN SEARLE 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  LIST_NODE_H
#define  LIST_NODE_H

#include <stdlib.h>

typedef struct _listNode ListNode;

struct _listNode {
  void *data;               
  void (*delete) (void *);  
  ListNode *next;           
  ListNode *prev;           
};

void listNode_Init(void *(*ln_allocate)(size_t size), void (*ln_deallocate)(void *ptr));

extern ListNode *listNode_Create (void);

/*
 * Destroy a ListNode. The node itself is destroyed (free'd).
 * The data is untouched.  If you want to destroy the data,
 * you have to do it yourself.
 */
extern void listNode_Destroy (ListNode *);

/*
 * Copy a ListNode.  Note that the copy contains the same
 * data value pointer. The data is NOT copied. 
 */
extern ListNode *listNode_Copy (ListNode *lnode);

extern int listNode_AttachAhead (ListNode *, ListNode *);
extern int listNode_AttachBehind (ListNode *, ListNode *);

extern ListNode *listNode_AttachData (ListNode *lnode, void *data, void (*delete)(void *));

extern int listNode_Detach (ListNode *);

extern void listNode_Print (ListNode *listNode);

#define listNode_IsNodeAttached(lnode) ((lnode->next || lnode->prev) ? 1 : 0)

#define listNode_GetNodeAhead(lnode)     (lnode->next);
#define listNode_GetNodeBehind(lnode)    (lnode->prev);

#define listNode_GetNextNode(lnode)      (lnode->next)
#define listNode_GetPrevNode(lnode)      (lnode->prev)

#define listNode_GetData(a)              (((ListNode *) (a))->data)
#define listNode_GetDelete(a)            (((ListNode *) (a))->delete)
#endif /* LIST_NODE_H */

---