1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/*
* Copyright 1998-1999, University of Notre Dame.
* Authors: Brian W. Barrett, Arun F. Rodrigues, Jeffrey M. Squyres,
* and Andrew Lumsdaine
*
* This file is part of XMPI
*
* You should have received a copy of the License Agreement for XMPI
* along with the software; see the file LICENSE. If not, contact
* Office of Research, University of Notre Dame, Notre Dame, IN 46556.
*
* Permission to modify the code and to distribute modified code is
* granted, provided the text of this NOTICE is retained, a notice that
* the code was modified is included with the above COPYRIGHT NOTICE and
* with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
* file is distributed with the modified code.
*
* LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
* By way of example, but not limitation, Licensor MAKES NO
* REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
* PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
* OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
* OR OTHER RIGHTS.
*
* Additional copyrights may follow.
*
* $Id: all_list.h,v 1.2 1999/08/09 12:45:50 lamteam Exp $
*
* Function: - constants and templates associated with all_list
*/
#ifndef _ALLLIST
#define _ALLLIST
#include "lam.h"
/*
* templates
*/
struct al_head {
struct al_head *al_next; /* next list element */
struct al_head *al_prev; /* previous list element */
};
struct al_desc {
int4 al_elemsize; /* element size */
int4 al_nelem; /* # of elements */
struct al_head *al_ltop; /* top of list ptr */
struct al_head *al_lbottom; /* bottom of list ptr */
struct al_head *al_ftop; /* top of free list ptr */
int4 (*al_comp)(); /* comparison function */
};
typedef struct al_desc LIST;
#define al_body(x) ((x) ? (((char *) (x)) + sizeof(struct al_head)) : 0)
#define al_count(x) ((x) ? (x)->al_nelem : 0)
#define al_top(x) ((al_count(x) > 0) ? (void *) al_body((x)->al_ltop) : 0)
#define al_bottom(x) ((al_count(x) > 0) ? (void *) al_body((x)->al_lbottom) : 0)
#ifdef __cplusplus
extern "C" {
#endif
extern LIST *al_init __ARGS((int4 elemsize, int4 (*comp)()));
extern void *al_append __ARGS((LIST *ald, void *unew));
extern void *al_find __ARGS((LIST *ald, void *key));
extern void *al_insert __ARGS((LIST *ald, void *unew));
extern void *al_next __ARGS((LIST *ald, void *old));
extern void *al_prev __ARGS((LIST *ald, void *old));
extern int4 al_delete __ARGS((LIST *ald, void *old));
extern int4 al_free __ARGS((LIST *ald));
#ifdef __cplusplus
}
#endif
#endif
|
