[hcoop/debian/openafs.git] / src / aklog / linked_list.h

/*
 * $Id$
 *
 * This is the header file for a general list linked package.
 *
 * Copyright 1990,1991 by the Massachusetts Institute of Technology
 * For distribution and copying rights, see the file "mit-copyright.h"
 */

#ifndef __LINKED_LIST_H__
#define __LINKED_LIST_H__

#define LL_SUCCESS 0
#define LL_FAILURE -1

typedef struct _ll_node {
    struct _ll_node *prev;
    struct _ll_node *next;
    char *data;
} ll_node;

typedef struct {
    ll_node *first;
    ll_node *last;
    int nelements;
} linked_list;

typedef enum {ll_head, ll_tail} ll_end;
typedef enum {ll_s_add, ll_s_check} ll_s_action;


/*
 * ll_add_data just assigns the data field of node to be d.
 * If this were c++, this would be an inline function and d
 * would be a void *, but we'll take what we can get...
 */
#define ll_add_data(n,d) (((n)->data)=(char*)(d))

#ifdef __STDC__

void ll_init(linked_list *list);
ll_node *ll_add_node(linked_list *list, ll_end which_end);
int ll_delete_node(linked_list *list, ll_node *node);
int ll_string(linked_list *, ll_s_action, char *);

#else /* __STDC__ */

void ll_init();
ll_node *ll_add_node();
int ll_delete_node();
int ll_string();

#endif /* __STDC__ */

#endif /* __LINKED_LIST_H__ */
Commit	Line	Data
805e021f CE	1	/*
	2	* $Id$
	3	*
	4	* This is the header file for a general list linked package.
	5	*
	6	* Copyright 1990,1991 by the Massachusetts Institute of Technology
	7	* For distribution and copying rights, see the file "mit-copyright.h"
	8	*/
	9
	10	#ifndef __LINKED_LIST_H__
	11	#define __LINKED_LIST_H__
	12
	13	#define LL_SUCCESS 0
	14	#define LL_FAILURE -1
	15
	16	typedef struct _ll_node {
	17	struct _ll_node *prev;
	18	struct _ll_node *next;
	19	char *data;
	20	} ll_node;
	21
	22	typedef struct {
	23	ll_node *first;
	24	ll_node *last;
	25	int nelements;
	26	} linked_list;
	27
	28	typedef enum {ll_head, ll_tail} ll_end;
	29	typedef enum {ll_s_add, ll_s_check} ll_s_action;
	30
	31
	32	/*
	33	* ll_add_data just assigns the data field of node to be d.
	34	* If this were c++, this would be an inline function and d
	35	* would be a void *, but we'll take what we can get...
	36	*/
	37	#define ll_add_data(n,d) (((n)->data)=(char*)(d))
	38
	39	#ifdef __STDC__
	40
	41	void ll_init(linked_list *list);
	42	ll_node ll_add_node(linked_list list, ll_end which_end);
	43	int ll_delete_node(linked_list list, ll_node node);
	44	int ll_string(linked_list , ll_s_action, char );
	45
	46	#else /* __STDC__ */
	47
	48	void ll_init();
	49	ll_node *ll_add_node();
	50	int ll_delete_node();
	51	int ll_string();
	52
	53	#endif /* __STDC__ */
	54
	55	#endif /* __LINKED_LIST_H__ */