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
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
|
/*
* ===================================
* 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.
*/
/*
* ATM Forum UNI 3.0/3.1 Signalling Manager
* ----------------------------------------
*
* Message buffer handling routines
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/param.h>
#include <sys/types.h>
#include <sys/systm.h>
#include <sys/errno.h>
#include <sys/time.h>
#include <sys/socket.h>
#include <sys/socketvar.h>
#include <net/if.h>
#include <netatm/port.h>
#include <netatm/queue.h>
#include <netatm/atm.h>
#include <netatm/atm_sys.h>
#include <netatm/atm_sap.h>
#include <netatm/atm_cm.h>
#include <netatm/atm_if.h>
#include <netatm/atm_vc.h>
#include <netatm/atm_sigmgr.h>
#include <netatm/atm_stack.h>
#include <netatm/atm_pcb.h>
#include <netatm/atm_var.h>
#include <netatm/uni/unisig_var.h>
#include <netatm/uni/unisig_mbuf.h>
#include <netatm/uni/unisig_msg.h>
/*
* Initialize a unisig formatting structure
*
* Arguments:
* usf pointer to a unisig formatting structure
* usp pointer to a unisig protocol instance
* buf pointer to a buffer chain (decode only)
* op operation code (encode or decode)
* headroom headroom to leave in first buffer
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_init(usf, usp, buf, op, headroom)
struct usfmt *usf;
struct unisig *usp;
KBuffer *buf;
int op;
int headroom;
{
KBuffer *m;
ATM_DEBUG3("usf_init: usf=%p, buf=%p, op=%d\n",
usf, buf, op);
/*
* Check parameters
*/
if (!usf)
return(EINVAL);
switch(op) {
case USF_ENCODE:
/*
* Get a buffer
*/
KB_ALLOCPKT(m, USF_MIN_ALLOC, KB_F_NOWAIT, KB_T_DATA);
if (m == NULL)
return(ENOMEM);
KB_LEN(m) = 0;
if (headroom < KB_BFRLEN(m)) {
KB_HEADSET(m, headroom);
}
break;
case USF_DECODE:
/*
* Verify buffer address
*/
if (!buf)
return(EINVAL);
m = buf;
break;
default:
return(EINVAL);
}
/*
* Save parameters in formatting structure
*/
usf->usf_m_addr = m;
usf->usf_m_base = m;
usf->usf_loc = 0;
usf->usf_op = op;
usf->usf_sig = usp;
return(0);
}
/*
* Get or put the next byte of a signalling message
*
* Arguments:
* usf pointer to a unisig formatting structure
* c pointer to the byte to send from or receive into
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_byte(usf, c)
struct usfmt *usf;
u_char *c;
{
u_char *mp;
KBuffer *m = usf->usf_m_addr, *m1;
int space;
switch (usf->usf_op) {
case USF_DECODE:
/*
* Make sure we're not past the end of the buffer
* (allowing for zero-length buffers)
*/
while (usf->usf_loc >= KB_LEN(m)) {
if (KB_NEXT(usf->usf_m_addr)) {
usf->usf_m_addr = m = KB_NEXT(usf->usf_m_addr);
usf->usf_loc = 0;
} else {
return(EMSGSIZE);
}
}
/*
* Get the data from the buffer
*/
KB_DATASTART(m, mp, u_char *);
*c = mp[usf->usf_loc];
usf->usf_loc++;
break;
case USF_ENCODE:
/*
* If the current buffer is full, get another
*/
KB_TAILROOM(m, space);
if (space == 0) {
KB_ALLOC(m1, USF_MIN_ALLOC, KB_F_NOWAIT, KB_T_DATA);
if (m1 == NULL)
return(ENOMEM);
KB_LEN(m1) = 0;
KB_LINK(m1, m);
usf->usf_m_addr = m = m1;
usf->usf_loc = 0;
}
/*
* Put the data into the buffer
*/
KB_DATASTART(m, mp, u_char *);
mp[usf->usf_loc] = *c;
KB_TAILADJ(m, 1);
usf->usf_loc++;
break;
default:
/*
* Invalid operation code
*/
return(EINVAL);
}
return(0);
}
/*
* Get or put a short integer
*
* Arguments:
* usf pointer to a unisig formatting structure
* s pointer to a short to send from or receive into
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_short(usf, s)
struct usfmt *usf;
u_short *s;
{
int rc;
union {
u_short value;
u_char b[sizeof(u_short)];
} tval;
tval.value = 0;
if (usf->usf_op == USF_ENCODE)
tval.value = htons(*s);
if ((rc = usf_byte(usf, &tval.b[0])) != 0)
return(rc);
if ((rc = usf_byte(usf, &tval.b[1])) != 0)
return(rc);
if (usf->usf_op == USF_DECODE)
*s = ntohs(tval.value);
return(0);
}
/*
* Get or put a 3-byte integer
*
* Arguments:
* usf pointer to a unisig formatting structure
* i pointer to an integer to send from or receive into
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_int3(usf, i)
struct usfmt *usf;
u_int *i;
{
int j, rc;
union {
u_int value;
u_char b[sizeof(u_int)];
} tval;
tval.value = 0;
if (usf->usf_op == USF_ENCODE)
tval.value = htonl(*i);
for (j=0; j<3; j++) {
rc = usf_byte(usf, &tval.b[j+sizeof(u_int)-3]);
if (rc)
return(rc);
}
if (usf->usf_op == USF_DECODE)
*i = ntohl(tval.value);
return(rc);
}
/*
* Get or put an integer
*
* Arguments:
* usf pointer to a unisig formatting structure
* i pointer to an integer to send from or receive into
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_int(usf, i)
struct usfmt *usf;
u_int *i;
{
int j, rc;
union {
u_int value;
u_char b[sizeof(u_int)];
} tval;
if (usf->usf_op == USF_ENCODE)
tval.value = htonl(*i);
for (j=0; j<4; j++) {
rc = usf_byte(usf, &tval.b[j+sizeof(u_int)-4]);
if (rc)
return(rc);
}
if (usf->usf_op == USF_DECODE)
*i = ntohl(tval.value);
return(rc);
}
/*
* Get or put an extented field
*
* An extented field consists of a string of bytes. All but the last
* byte of the field has the high-order bit set to zero. When decoding,
* this routine will read bytes until either the input is exhausted or
* a byte with a high-order one is found. Whe encoding, it will take an
* unsigned integer and write until the highest-order one bit has been
* written.
*
* Arguments:
* usf pointer to a unisig formatting structure
* i pointer to an integer to send from or receive into
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_ext(usf, i)
struct usfmt *usf;
u_int *i;
{
int j, rc;
u_char c, buff[sizeof(u_int)+1];
u_int val;
union {
u_int value;
u_char b[sizeof(u_int)];
} tval;
switch(usf->usf_op) {
case USF_ENCODE:
val = *i;
j = 0;
while (val) {
tval.value = htonl(val);
buff[j] = tval.b[sizeof(u_int)-1] & UNI_IE_EXT_MASK;
val >>= 7;
j++;
}
j--;
buff[0] |= UNI_IE_EXT_BIT;
for (; j>=0; j--) {
rc = usf_byte(usf, &buff[j]);
if (rc)
return(rc);
}
break;
case USF_DECODE:
c = 0;
val = 0;
while (!(c & UNI_IE_EXT_BIT)) {
rc = usf_byte(usf, &c);
if (rc)
return(rc);
val = (val << 7) + (c & UNI_IE_EXT_MASK);
}
*i = val;
break;
default:
return(EINVAL);
}
return(0);
}
/*
* Count the bytes remaining to be decoded
*
* Arguments:
* usf pointer to a unisig formatting structure
*
* Returns:
* int the number of bytes in the buffer chain remaining to
* be decoded
*
*/
int
usf_count(usf)
struct usfmt *usf;
{
int count;
KBuffer *m = usf->usf_m_addr;
/*
* Return zero if we're not decoding
*/
if (usf->usf_op != USF_DECODE)
return (0);
/*
* Calculate the length of data remaining in the current buffer
*/
count = KB_LEN(m) - usf->usf_loc;
/*
* Loop through any remaining buffers, adding in their lengths
*/
while (KB_NEXT(m)) {
m = KB_NEXT(m);
count += KB_LEN(m);
}
return(count);
}
/*
* Get or put the next byte of a signalling message and return
* the byte's buffer address
*
* Arguments:
* usf pointer to a unisig formatting structure
* c pointer to the byte to send from or receive into
* bp address to store the byte's buffer address
*
* Returns:
* 0 success
* errno error encountered
*
*/
int
usf_byte_mark(usf, c, bp)
struct usfmt *usf;
u_char *c;
u_char **bp;
{
u_char *mp;
int rc;
/*
* First, get/put the data byte
*/
rc = usf_byte(usf, c);
if (rc) {
/*
* Error encountered
*/
*bp = NULL;
return (rc);
}
/*
* Now return the buffer address of that byte
*/
KB_DATASTART(usf->usf_m_addr, mp, u_char *);
*bp = &mp[usf->usf_loc - 1];
return (0);
}
|