Debian Codegraph @

dune/uggrid/parallel/ddd/xfer/sll.h

raw
1 // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
2 // vi: set et ts=4 sw=2 sts=2:
3 // SPDX-FileCopyrightInfo: Copyright © DUNE Project contributors, see file LICENSE.md in module root
4 // SPDX-License-Identifier: LGPL-2.1-or-later
5 /****************************************************************************/
6 /* */
7 /* File: sll.h */
8 /* */
9 /* Purpose: header file for sll templates */
10 /* */
11 /* Author: Klaus Birken */
12 /* Institut fuer Computeranwendungen III */
13 /* Universitaet Stuttgart */
14 /* Pfaffenwaldring 27 */
15 /* 70569 Stuttgart */
16 /* internet: [email protected] */
17 /* */
18 /* History: 960826 kb begin */
19 /* */
20 /* Remarks: */
21 /* */
22 /****************************************************************************/
23
24
25 /****************************************************************************/
26 /* */
27 /* auto include mechanism and other include files */
28 /* */
29 /****************************************************************************/
30
31 #ifndef __SLL_H__
32 #define __SLL_H__
33
34
35 /****************************************************************************/
36
37 /* size of segments for memory allocation */
38 #define SEGM_SIZE 256
39
40
41 /****************************************************************************/
42
43
44 #define SLL_INFO(T) \
45 T* sll_next /* linked list */
46
47 #define SLL_INFO_WITH_COUNTER(T) \
48 int sll_n; /* unique index number */ \
49 T* sll_next /* linked list */
50
51
52 /****************************************************************************/
53
54 /*
55 macros for template support: datatypes
56 */
57 #define _Segm(T) Segm ## T
58 #define Segm(T) _Segm(T)
59
60
61 /*
62 macros for template support: variables
63 */
64 #define _segms(T) segms ## T
65 #define segms(T) _segms(T)
66
67 #define _list(T) list ## T
68 #define list(T) _list(T)
69
70 #define _n(T) n ## T
71 #define n(T) _n(T)
72
73
74 /*
75 macros for template support: functions
76 */
77 #define _NewSegm(T) NewSegm ## T
78 #define NewSegm(T) _NewSegm(T)
79
80 #define _FreeSegms(T) FreeSegms ## T
81 #define FreeSegms(T) _FreeSegms(T)
82
83 #define _New(T) New ## T
84 #define New(T) _New(T)
85
86 #define _SortedArray(T) SortedArray ## T
87 #define SortedArray(T) _SortedArray(T)
88
89 #define _sort_OrigOrder(T) sort_OrigOrder ## T
90 #define sort_OrigOrder(T) _sort_OrigOrder(T)
91
92 #define _OrigOrder(T) OrigOrder ## T
93 #define OrigOrder(T) _OrigOrder(T)
94
95 #define _Unify(T) Unify ## T
96 #define Unify(T) _Unify(T)
97
98 #define _Init(T) Init ## T
99 #define Init(T) _Init(T)
100
101 #define _FreeAll(T) FreeAll ## T
102 #define FreeAll(T) _FreeAll(T)
103
104 #define _GetSizes(T) GetSizes ## T
105 #define GetSizes(T) _GetSizes(T)
106
107
108
109 /****************************************************************************/
110
111 #endif