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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
|
/*
*
* ===================================
* HARP | Host ATM Research Platform
* ===================================
*
*
* This Host ATM Research Platform ("HARP") file (the "Software") is
* made available by Network Computing Services, Inc. ("NetworkCS")
* "AS IS". NetworkCS does not provide maintenance, improvements or
* support of any kind.
*
* NETWORKCS MAKES NO WARRANTIES OR REPRESENTATIONS, EXPRESS OR IMPLIED,
* INCLUDING, BUT NOT LIMITED TO, IMPLIED WARRANTIES OF MERCHANTABILITY
* AND FITNESS FOR A PARTICULAR PURPOSE, AS TO ANY ELEMENT OF THE
* SOFTWARE OR ANY SUPPORT PROVIDED IN CONNECTION WITH THIS SOFTWARE.
* In no event shall NetworkCS be responsible for any damages, including
* but not limited to consequential damages, arising from or relating to
* any use of the Software or related support.
*
* Copyright 1994-1998 Network Computing Services, Inc.
*
* Copies of this Software may be made, however, the above copyright
* notice must be reproduced on all copies.
*
* @(#) $FreeBSD$
*
*/
/*
* Core ATM Services
* -----------------
*
* General system definitions
*
*/
#ifndef _NETATM_ATM_SYS_H
#define _NETATM_ATM_SYS_H
/*
* Software Version
*/
#define ATM_VERSION 0x00030000 /* Version 3.0 */
#define ATM_VERS_MAJ(v) ((v) >> 16)
#define ATM_VERS_MIN(v) ((v) & 0xffff)
/*
* Misc system defines
*/
#define ATM_CALLQ_MAX 100 /* Maximum length of call queue */
#define ATM_INTRQ_MAX 1000 /* Maximum length of interrupt queue */
/*
* ATM address manipulation macros
*/
#define ATM_ADDR_EQUAL(a1, a2) \
(((a1)->address_format == (a2)->address_format) && \
((a1)->address_length == (a2)->address_length) && \
(bcmp((caddr_t)(a1)->address, (caddr_t)(a2)->address, \
(a1)->address_length) == 0))
#define ATM_ADDR_SEL_EQUAL(a1, s1, a2) \
(((a1)->address_format == (a2)->address_format) && \
((a1)->address_length == (a2)->address_length) && \
(((((a1)->address_format == T_ATM_ENDSYS_ADDR) || \
((a1)->address_format == T_ATM_NSAP_ADDR)) && \
(bcmp((caddr_t)(a1)->address, (caddr_t)(a2)->address, \
(a1)->address_length - 1) == 0) && \
((s1) == ((struct atm_addr_nsap *)(a2)->address)->aan_sel)) || \
(((a1)->address_format != T_ATM_ENDSYS_ADDR) && \
((a1)->address_format != T_ATM_NSAP_ADDR) && \
(bcmp((caddr_t)(a1)->address, (caddr_t)(a2)->address, \
(a1)->address_length) == 0))))
#define ATM_ADDR_COPY(a1, a2) \
{ \
(a2)->address_format = (a1)->address_format; \
(a2)->address_length = (a1)->address_length; \
bcopy((caddr_t)(a1)->address, (caddr_t)(a2)->address, \
(a1)->address_length); \
}
#define ATM_ADDR_SEL_COPY(a1, s1, a2) \
{ \
(a2)->address_format = (a1)->address_format; \
(a2)->address_length = (a1)->address_length; \
if (((a1)->address_format == T_ATM_ENDSYS_ADDR) || \
((a1)->address_format == T_ATM_NSAP_ADDR)) { \
bcopy((caddr_t)(a1)->address, (caddr_t)(a2)->address, \
(a1)->address_length - 1); \
((struct atm_addr_nsap *)(a2)->address)->aan_sel = (s1);\
} else { \
bcopy((caddr_t)(a1)->address, (caddr_t)(a2)->address, \
(a1)->address_length); \
} \
}
/*
* ATM Cell Header definitions
*/
/*
* These macros assume that the cell header (minus the HEC)
* is contained in the least-significant 32-bits of a word
*/
#define ATM_HDR_SET_VPI(vpi) (((vpi) & 0xff) << 20)
#define ATM_HDR_SET_VCI(vci) (((vci) & 0xffff) << 4)
#define ATM_HDR_SET_PT(pt) (((pt) & 0x7) << 1)
#define ATM_HDR_SET_CLP(clp) ((clp) & 0x1)
#define ATM_HDR_SET(vpi,vci,pt,clp) (ATM_HDR_SET_VPI(vpi) | \
ATM_HDR_SET_VCI(vci) | \
ATM_HDR_SET_PT(pt) | \
ATM_HDR_SET_CLP(clp))
#define ATM_HDR_GET_VPI(hdr) (((hdr) >> 20) & 0xff)
#define ATM_HDR_GET_VCI(hdr) (((hdr) >> 4) & 0xffff)
#define ATM_HDR_GET_PT(hdr) (((hdr) >> 1) & 0x7)
#define ATM_HDR_GET_CLP(hdr) ((hdr) & 0x1)
/*
* Payload Type Identifier (3 bits)
*/
#define ATM_PT_USER_SDU0 0x0 /* User, no congestion, sdu type 0 */
#define ATM_PT_USER_SDU1 0x1 /* User, no congestion, sdu type 1 */
#define ATM_PT_USER_CONG_SDU0 0x2 /* User, congestion, sdu type 0 */
#define ATM_PT_USER_CONG_SDU1 0x3 /* User, congestion, sdu type 1 */
#define ATM_PT_NONUSER 0x4 /* User/non-user differentiator */
#define ATM_PT_OAMF5_SEG 0x4 /* OAM F5 segment flow */
#define ATM_PT_OAMF5_E2E 0x5 /* OAM F5 end-to-end flow */
/*
* AAL (ATM Adaptation Layer) codes
*/
typedef u_char Aal_t;
#define ATM_AAL0 0 /* AAL0 - Cell service */
#define ATM_AAL1 1 /* AAL1 */
#define ATM_AAL2 2 /* AAL2 */
#define ATM_AAL3_4 3 /* AAL3/4 */
#define ATM_AAL5 5 /* AAL5 */
/*
* VCC Encapsulation codes
*/
typedef u_char Encaps_t;
#define ATM_ENC_NULL 1 /* Null encapsulation */
#define ATM_ENC_LLC 2 /* LLC encapsulation */
#ifdef _KERNEL
/*
* ATM timer control block. Used to schedule a timeout via atm_timeout().
* This control block will typically be embedded in a processing-specific
* control block.
*/
struct atm_time {
u_short ti_ticks; /* Delta of ticks until timeout */
u_char ti_flag; /* Timer flag bits (see below) */
void (*ti_func) /* Call at timeout expiration */
(struct atm_time *);
struct atm_time *ti_next; /* Next on queue */
};
/*
* Timer Flags
*/
#define TIF_QUEUED 0x01 /* Control block on timer queue */
#define ATM_HZ 2 /* Time ticks per second */
/*
* To avoid heavy use of kmem_alloc, memory for protocol control blocks may
* be allocated from storage pools. Each control block type will have
* its own pool. Each storage pool will consist of individually allocated
* memory chunks, which will then be sub-divided into the separate control
* blocks. Each chunk will contain a header (sp_chunk) and 'n' blocks of the
* same type, plus a link field for each block. Each chunk will also contain
* a list of all free control blocks in the chunk.
*
* Each protocol must define an sp_info structure for each of its storage
* pools. This structure serves as the "root" for its particular pool.
* Protocols must not modify this structure after its first use.
*/
struct sp_info {
/* Values supplied by pool owner */
char *si_name; /* Name of pool */
size_t si_blksiz; /* Size of each block */
int si_blkcnt; /* Blocks per chunk */
int si_maxallow; /* Maximum allowable chunks */
/* Used by allocate/free functions - do not touch */
struct sp_info *si_next; /* Next active storage pool */
struct sp_chunk *si_poolh; /* Storage pool chunk head */
struct sp_chunk *si_poolt; /* Storage pool chunk tail */
size_t si_chunksiz; /* Size of chunk */
int si_chunks; /* Current allocated chunks */
int si_total; /* Total number of blocks */
int si_free; /* Free blocks */
int si_maxused; /* Maximum allocated chunks */
int si_allocs; /* Total allocate calls */
int si_fails; /* Allocate failures */
};
struct sp_chunk {
struct sp_chunk *sc_next; /* Next chunk in pool */
struct sp_info *sc_info; /* Storage pool info */
u_int sc_magic; /* Chunk magic number */
int sc_used; /* Allocated blocks in chunk */
struct sp_link *sc_freeh; /* Head of free blocks in chunk */
struct sp_link *sc_freet; /* Tail of free blocks in chunk */
};
struct sp_link {
union {
struct sp_link *slu_next; /* Next block in free list */
struct sp_chunk *slu_chunk; /* Link back to our chunk */
} sl_u;
};
#define SPOOL_MAGIC 0x73d4b69c /* Storage pool magic number */
#define SPOOL_MIN_CHUNK 2 /* Minimum number of chunks */
#define SPOOL_ROUNDUP 16 /* Roundup for allocated chunks */
#define SPOOL_COMPACT (300 * ATM_HZ) /* Compaction timeout value */
/*
* Debugging
*/
#ifdef DIAGNOSTIC
#define ATM_TIME \
struct timeval now, delta; \
KT_TIME(now); \
delta.tv_sec = now.tv_sec - atm_debugtime.tv_sec; \
delta.tv_usec = now.tv_usec - atm_debugtime.tv_usec; \
atm_debugtime = now; \
if (delta.tv_usec < 0) { \
delta.tv_sec--; \
delta.tv_usec += 1000000; \
} \
printf("%3ld.%6ld: ", delta.tv_sec, delta.tv_usec);
#define ATM_DEBUG0(f) if (atm_debug) {ATM_TIME; printf(f);}
#define ATM_DEBUGN0(f) if (atm_debug) {printf(f);}
#define ATM_DEBUG1(f,a1) if (atm_debug) {ATM_TIME; printf(f, a1);}
#define ATM_DEBUGN1(f,a1) if (atm_debug) {printf(f, a1);}
#define ATM_DEBUG2(f,a1,a2) if (atm_debug) {ATM_TIME; printf(f, a1, a2);}
#define ATM_DEBUGN2(f,a1,a2) if (atm_debug) {printf(f, a1, a2);}
#define ATM_DEBUG3(f,a1,a2,a3) if (atm_debug) {ATM_TIME; printf(f, a1, a2, a3);}
#define ATM_DEBUGN3(f,a1,a2,a3) if (atm_debug) {printf(f, a1, a2, a3);}
#define ATM_DEBUG4(f,a1,a2,a3,a4) if (atm_debug) {ATM_TIME; printf(f, a1, a2, a3, a4);}
#define ATM_DEBUGN4(f,a1,a2,a3,a4) if (atm_debug) {printf(f, a1, a2, a3, a4);}
#define ATM_DEBUG5(f,a1,a2,a3,a4,a5) if (atm_debug) {ATM_TIME; printf(f, a1, a2, a3, a4, a5);}
#define ATM_DEBUGN5(f,a1,a2,a3,a4,a5) if (atm_debug) {printf(f, a1, a2, a3, a4, a5);}
#else
#define ATM_DEBUG0(f)
#define ATM_DEBUGN0(f)
#define ATM_DEBUG1(f,a1)
#define ATM_DEBUGN1(f,a1)
#define ATM_DEBUG2(f,a1,a2)
#define ATM_DEBUGN2(f,a1,a2)
#define ATM_DEBUG3(f,a1,a2,a3)
#define ATM_DEBUGN3(f,a1,a2,a3)
#define ATM_DEBUG4(f,a1,a2,a3,a4)
#define ATM_DEBUGN4(f,a1,a2,a3,a4)
#define ATM_DEBUG5(f,a1,a2,a3,a4,a5)
#define ATM_DEBUGN5(f,a1,a2,a3,a4,a5)
#endif
#endif /* _KERNEL */
#endif /* _NETATM_ATM_SYS_H */
|
