Return to ci_list.h CVS log

Up to [Development] / failsafe / FailSafe / cluster_services / include

Initial checkin

/*
 * Copyright (c) 2000 Silicon Graphics, Inc.  All Rights Reserved.
 * 
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of version 2.1 of the GNU Lesser General Public
 * License as published by the Free Software Foundation.
 * 
 * This program is distributed in the hope that it would be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * 
 * Further, this software is distributed without any warranty that it is
 * free of the rightful claim of any third person regarding infringement
 * or the like.  Any license provided herein, whether implied or
 * otherwise, applies only to this software file.  Patent licenses, if
 * any, provided herein do not apply to combinations of this program with
 * other software, or any other product whatsoever.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this program; if not, write the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston MA 02111-1307,
 * USA.
 * 
 * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
 * Mountain View, CA 94043, or:
 * 
 * http://www.sgi.com 
 * 
 * For further information regarding this notice, see: 
 * 
 * http://oss.sgi.com/projects/GenInfo/NoticeExplan
 */
/* 
 * ci_list.h
 *
 * This file contains list management.
 */

#ifndef	CI_LIST_H
#define	CI_LIST_H
#ident "$Id: ci_list.h,v 1.1 2000/08/31 19:16:32 vasa Exp $"

typedef struct ci_list_entry_s {
	struct ci_list_entry_s	*next;
	struct ci_list_entry_s	*prev;
} ci_list_entry_t;

/* lookup function */
typedef boolean_t (*ci_list_lfun_t)(ci_list_entry_t *, void *);
/* sort function */
typedef boolean_t (*ci_list_sfun_t)(ci_list_entry_t *, ci_list_entry_t *);


#define	ci_list_insert(h, e)	ci_gen_list_insert((ci_list_entry_t **)(h), \
						(ci_list_entry_t *)(e))

#define	ci_list_insert_sorted(h, e, f)		ci_gen_list_insert_sorted( \
						(ci_list_entry_t **)(h), \
						(ci_list_entry_t *)(e), (f))

#define	ci_list_remove(h, e)	ci_gen_list_remove((ci_list_entry_t **)(h), \
						(ci_list_entry_t *)(e))

#define	ci_list_next(h, e)	ci_gen_list_next((ci_list_entry_t **)(h), \
						 (ci_list_entry_t *)(e))

#define	ci_list_lookup(h, f, a)	ci_gen_list_lookup((ci_list_entry_t **)(h), (f), (a))


#define	ci_list_init(h)	ci_gen_list_init((ci_list_entry_t **)(h))

/*		prototypes from ci_list.c		*/
void		ci_gen_list_init(ci_list_entry_t **);
void		ci_gen_list_insert(ci_list_entry_t **, ci_list_entry_t *);
void		ci_gen_list_insert_sorted(ci_list_entry_t **, ci_list_entry_t *, ci_list_sfun_t);
void		ci_gen_list_remove(ci_list_entry_t **, ci_list_entry_t *);
ci_list_entry_t *	ci_gen_list_lookup(ci_list_entry_t **, ci_list_lfun_t, void *);
ci_list_entry_t *	ci_gen_list_next(ci_list_entry_t **, ci_list_entry_t *);

#endif	/* CI_LIST_H */