]> The Tcpdump Group git mirrors - tcpdump/blob - print-rx.c
projects / tcpdump / blob
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
VECOUT() lacked proper boundary checks.
[tcpdump] / print-rx.c
1 /*
2 * This code unmangles RX packets. RX is the mutant form of RPC that AFS
3 * uses to communicate between clients and servers.
4 *
5 * In this code, I mainly concern myself with decoding the AFS calls, not
6 * with the guts of RX, per se.
7 *
8 * Bah. If I never look at rx_packet.h again, it will be too soon.
9 *
10 * Ken Hornstein <kenh@cmf.nrl.navy.mil>
11 *
12 */
13
14 #ifndef lint
15 static const char rcsid[] =
16 "@(#) $Header: /tcpdump/master/tcpdump/print-rx.c,v 1.25 2001-07-09 09:24:09 itojun Exp $";
17 #endif
18
19 #ifdef HAVE_CONFIG_H
20 #include "config.h"
21 #endif
22
23 #include <stdio.h>
24 #include <stdlib.h>
25 #include <string.h>
26 #include <time.h>
27 #include <sys/param.h>
28 #include <sys/time.h>
29 #include <sys/types.h>
30 #include <sys/socket.h>
31 #include <netinet/in.h>
32 #include <arpa/inet.h>
33
34 #include "interface.h"
35 #include "addrtoname.h"
36 #include "extract.h"
37
38 #include "rx.h"
39
40 #include "ip.h"
41
42 static struct tok rx_types[] = {
43 { RX_PACKET_TYPE_DATA, "data" },
44 { RX_PACKET_TYPE_ACK, "ack" },
45 { RX_PACKET_TYPE_BUSY, "busy" },
46 { RX_PACKET_TYPE_ABORT, "abort" },
47 { RX_PACKET_TYPE_ACKALL, "ackall" },
48 { RX_PACKET_TYPE_CHALLENGE, "challenge" },
49 { RX_PACKET_TYPE_RESPONSE, "response" },
50 { RX_PACKET_TYPE_DEBUG, "debug" },
51 { RX_PACKET_TYPE_PARAMS, "params" },
52 { RX_PACKET_TYPE_VERSION, "version" },
53 { 0, NULL },
54 };
55
56 static struct tok rx_flags[] = {
57 { RX_CLIENT_INITIATED, "client-init" },
58 { RX_REQUEST_ACK, "req-ack" },
59 { RX_LAST_PACKET, "last-pckt" },
60 { RX_MORE_PACKETS, "more-pckts" },
61 { RX_FREE_PACKET, "free-pckt" }
62 };
63
64 static struct tok fs_req[] = {
65 { 130, "fetch-data" },
66 { 131, "fetch-acl" },
67 { 132, "fetch-status" },
68 { 133, "store-data" },
69 { 134, "store-acl" },
70 { 135, "store-status" },
71 { 136, "remove-file" },
72 { 137, "create-file" },
73 { 138, "rename" },
74 { 139, "symlink" },
75 { 140, "link" },
76 { 141, "makedir" },
77 { 142, "rmdir" },
78 { 143, "oldsetlock" },
79 { 144, "oldextlock" },
80 { 145, "oldrellock" },
81 { 146, "get-stats" },
82 { 147, "give-cbs" },
83 { 148, "get-vlinfo" },
84 { 149, "get-vlstats" },
85 { 150, "set-vlstats" },
86 { 151, "get-rootvl" },
87 { 152, "check-token" },
88 { 153, "get-time" },
89 { 154, "nget-vlinfo" },
90 { 155, "bulk-stat" },
91 { 156, "setlock" },
92 { 157, "extlock" },
93 { 158, "rellock" },
94 { 159, "xstat-ver" },
95 { 160, "get-xstat" },
96 { 161, "dfs-lookup" },
97 { 162, "dfs-flushcps" },
98 { 163, "dfs-symlink" },
99 { 0, NULL },
100 };
101
102 static struct tok cb_req[] = {
103 { 204, "callback" },
104 { 205, "initcb" },
105 { 206, "probe" },
106 { 207, "getlock" },
107 { 208, "getce" },
108 { 209, "xstatver" },
109 { 210, "getxstat" },
110 { 211, "initcb2" },
111 { 212, "whoareyou" },
112 { 213, "initcb3" },
113 { 214, "probeuuid" },
114 { 0, NULL },
115 };
116
117 static struct tok pt_req[] = {
118 { 500, "new-user" },
119 { 501, "where-is-it" },
120 { 502, "dump-entry" },
121 { 503, "add-to-group" },
122 { 504, "name-to-id" },
123 { 505, "id-to-name" },
124 { 506, "delete" },
125 { 507, "remove-from-group" },
126 { 508, "get-cps" },
127 { 509, "new-entry" },
128 { 510, "list-max" },
129 { 511, "set-max" },
130 { 512, "list-entry" },
131 { 513, "change-entry" },
132 { 514, "list-elements" },
133 { 515, "same-mbr-of" },
134 { 516, "set-fld-sentry" },
135 { 517, "list-owned" },
136 { 518, "get-cps2" },
137 { 519, "get-host-cps" },
138 { 520, "update-entry" },
139 { 0, NULL },
140 };
141
142 static struct tok vldb_req[] = {
143 { 501, "create-entry" },
144 { 502, "delete-entry" },
145 { 503, "get-entry-by-id" },
146 { 504, "get-entry-by-name" },
147 { 505, "get-new-volume-id" },
148 { 506, "replace-entry" },
149 { 507, "update-entry" },
150 { 508, "setlock" },
151 { 509, "releaselock" },
152 { 510, "list-entry" },
153 { 511, "list-attrib" },
154 { 512, "linked-list" },
155 { 513, "get-stats" },
156 { 514, "probe" },
157 { 515, "get-addrs" },
158 { 516, "change-addr" },
159 { 517, "create-entry-n" },
160 { 518, "get-entry-by-id-n" },
161 { 519, "get-entry-by-name-n" },
162 { 520, "replace-entry-n" },
163 { 521, "list-entry-n" },
164 { 522, "list-attrib-n" },
165 { 523, "linked-list-n" },
166 { 524, "update-entry-by-name" },
167 { 525, "create-entry-u" },
168 { 526, "get-entry-by-id-u" },
169 { 527, "get-entry-by-name-u" },
170 { 528, "replace-entry-u" },
171 { 529, "list-entry-u" },
172 { 530, "list-attrib-u" },
173 { 531, "linked-list-u" },
174 { 532, "regaddr" },
175 { 533, "get-addrs-u" },
176 { 0, NULL },
177 };
178
179 static struct tok kauth_req[] = {
180 { 1, "auth-old" },
181 { 21, "authenticate" },
182 { 22, "authenticate-v2" },
183 { 2, "change-pw" },
184 { 3, "get-ticket-old" },
185 { 23, "get-ticket" },
186 { 4, "set-pw" },
187 { 5, "set-fields" },
188 { 6, "create-user" },
189 { 7, "delete-user" },
190 { 8, "get-entry" },
191 { 9, "list-entry" },
192 { 10, "get-stats" },
193 { 11, "debug" },
194 { 12, "get-pw" },
195 { 13, "get-random-key" },
196 { 14, "unlock" },
197 { 15, "lock-status" },
198 { 0, NULL },
199 };
200
201 static struct tok vol_req[] = {
202 { 100, "create-volume" },
203 { 101, "delete-volume" },
204 { 102, "restore" },
205 { 103, "forward" },
206 { 104, "end-trans" },
207 { 105, "clone" },
208 { 106, "set-flags" },
209 { 107, "get-flags" },
210 { 108, "trans-create" },
211 { 109, "dump" },
212 { 110, "get-nth-volume" },
213 { 111, "set-forwarding" },
214 { 112, "get-name" },
215 { 113, "get-status" },
216 { 114, "sig-restore" },
217 { 115, "list-partitions" },
218 { 116, "list-volumes" },
219 { 117, "set-id-types" },
220 { 118, "monitor" },
221 { 119, "partition-info" },
222 { 120, "reclone" },
223 { 121, "list-one-volume" },
224 { 122, "nuke" },
225 { 123, "set-date" },
226 { 124, "x-list-volumes" },
227 { 125, "x-list-one-volume" },
228 { 126, "set-info" },
229 { 127, "x-list-partitions" },
230 { 128, "forward-multiple" },
231 { 0, NULL },
232 };
233
234 static struct tok bos_req[] = {
235 { 80, "create-bnode" },
236 { 81, "delete-bnode" },
237 { 82, "set-status" },
238 { 83, "get-status" },
239 { 84, "enumerate-instance" },
240 { 85, "get-instance-info" },
241 { 86, "get-instance-parm" },
242 { 87, "add-superuser" },
243 { 88, "delete-superuser" },
244 { 89, "list-superusers" },
245 { 90, "list-keys" },
246 { 91, "add-key" },
247 { 92, "delete-key" },
248 { 93, "set-cell-name" },
249 { 94, "get-cell-name" },
250 { 95, "get-cell-host" },
251 { 96, "add-cell-host" },
252 { 97, "delete-cell-host" },
253 { 98, "set-t-status" },
254 { 99, "shutdown-all" },
255 { 100, "restart-all" },
256 { 101, "startup-all" },
257 { 102, "set-noauth-flag" },
258 { 103, "re-bozo" },
259 { 104, "restart" },
260 { 105, "start-bozo-install" },
261 { 106, "uninstall" },
262 { 107, "get-dates" },
263 { 108, "exec" },
264 { 109, "prune" },
265 { 110, "set-restart-time" },
266 { 111, "get-restart-time" },
267 { 112, "start-bozo-log" },
268 { 113, "wait-all" },
269 { 114, "get-instance-strings" },
270 { 0, NULL },
271 };
272
273 static struct tok ubik_req[] = {
274 { 10000, "vote-beacon" },
275 { 10001, "vote-debug-old" },
276 { 10002, "vote-sdebug-old" },
277 { 10003, "vote-getsyncsite" },
278 { 10004, "vote-debug" },
279 { 10005, "vote-sdebug" },
280 { 20000, "disk-begin" },
281 { 20001, "disk-commit" },
282 { 20002, "disk-lock" },
283 { 20003, "disk-write" },
284 { 20004, "disk-getversion" },
285 { 20005, "disk-getfile" },
286 { 20006, "disk-sendfile" },
287 { 20007, "disk-abort" },
288 { 20008, "disk-releaselocks" },
289 { 20009, "disk-truncate" },
290 { 20010, "disk-probe" },
291 { 20011, "disk-writev" },
292 { 20012, "disk-interfaceaddr" },
293 { 20013, "disk-setversion" },
294 { 0, NULL },
295 };
296
297 #define VOTE_LOW 10000
298 #define VOTE_HIGH 10005
299 #define DISK_LOW 20000
300 #define DISK_HIGH 20013
301
302 static struct tok cb_types[] = {
303 { 1, "exclusive" },
304 { 2, "shared" },
305 { 3, "dropped" },
306 { 0, NULL },
307 };
308
309 static struct tok ubik_lock_types[] = {
310 { 1, "read" },
311 { 2, "write" },
312 { 3, "wait" },
313 { 0, NULL },
314 };
315
316 static char *voltype[] = { "read-write", "read-only", "backup" };
317
318 static struct tok afs_fs_errors[] = {
319 { 101, "salvage volume" },
320 { 102, "no such vnode" },
321 { 103, "no such volume" },
322 { 104, "volume exist" },
323 { 105, "no service" },
324 { 106, "volume offline" },
325 { 107, "voline online" },
326 { 108, "diskfull" },
327 { 109, "diskquota exceeded" },
328 { 110, "volume busy" },
329 { 111, "volume moved" },
330 { 112, "AFS IO error" },
331 { -100, "restarting fileserver" },
332 { 0, NULL }
333 };
334
335 /*
336 * Reasons for acknowledging a packet
337 */
338
339 static struct tok rx_ack_reasons[] = {
340 { 1, "ack requested" },
341 { 2, "duplicate packet" },
342 { 3, "out of sequence" },
343 { 4, "exceeds window" },
344 { 5, "no buffer space" },
345 { 6, "ping" },
346 { 7, "ping response" },
347 { 8, "delay" },
348 { 0, NULL },
349 };
350
351 /*
352 * Cache entries we keep around so we can figure out the RX opcode
353 * numbers for replies. This allows us to make sense of RX reply packets.
354 */
355
356 struct rx_cache_entry {
357 u_int32_t callnum; /* Call number (net order) */
358 struct in_addr client; /* client IP address (net order) */
359 struct in_addr server; /* server IP address (net order) */
360 int dport; /* server port (host order) */
361 u_short serviceId; /* Service identifier (net order) */
362 u_int32_t opcode; /* RX opcode (host order) */
363 };
364
365 #define RX_CACHE_SIZE 64
366
367 static struct rx_cache_entry rx_cache[RX_CACHE_SIZE];
368
369 static int rx_cache_next = 0;
370 static int rx_cache_hint = 0;
371 static void rx_cache_insert(const u_char *, const struct ip *, int, int);
372 static int rx_cache_find(const struct rx_header *, const struct ip *,
373 int, int32_t *);
374
375 static void ack_print(const u_char *, int);
376 static void fs_print(const u_char *, int);
377 static void fs_reply_print(const u_char *, int, int32_t);
378 static void acl_print(u_char *, int, u_char *);
379 static void cb_print(const u_char *, int);
380 static void cb_reply_print(const u_char *, int, int32_t);
381 static void prot_print(const u_char *, int);
382 static void prot_reply_print(const u_char *, int, int32_t);
383 static void vldb_print(const u_char *, int);
384 static void vldb_reply_print(const u_char *, int, int32_t);
385 static void kauth_print(const u_char *, int);
386 static void kauth_reply_print(const u_char *, int, int32_t);
387 static void vol_print(const u_char *, int);
388 static void vol_reply_print(const u_char *, int, int32_t);
389 static void bos_print(const u_char *, int);
390 static void bos_reply_print(const u_char *, int, int32_t);
391 static void ubik_print(const u_char *, int);
392 static void ubik_reply_print(const u_char *, int, int32_t);
393
394 static void rx_ack_print(const u_char *, int);
395
396 static int is_ubik(u_int32_t);
397
398 /*
399 * Handle the rx-level packet. See if we know what port it's going to so
400 * we can peek at the afs call inside
401 */
402
403 void
404 rx_print(register const u_char *bp, int length, int sport, int dport,
405 u_char *bp2)
406 {
407 register struct rx_header *rxh;
408 int i;
409 int32_t opcode;
410
411 if (snapend - bp < sizeof (struct rx_header)) {
412 printf(" [|rx] (%d)", length);
413 return;
414 }
415
416 rxh = (struct rx_header *) bp;
417
418 printf(" rx %s", tok2str(rx_types, "type %d", rxh->type));
419
420 if (vflag) {
421 int firstflag = 0;
422
423 if (vflag > 1)
424 printf(" cid %08x call# %d",
425 (int) EXTRACT_32BITS(&rxh->cid),
426 (int) EXTRACT_32BITS(&rxh->callNumber));
427
428 printf(" seq %d ser %d",
429 (int) EXTRACT_32BITS(&rxh->seq),
430 (int) EXTRACT_32BITS(&rxh->serial));
431
432 if (vflag > 2)
433 printf(" secindex %d serviceid %hu",
434 (int) rxh->securityIndex,
435 EXTRACT_16BITS(&rxh->serviceId));
436
437 if (vflag > 1)
438 for (i = 0; i < NUM_RX_FLAGS; i++) {
439 if (rxh->flags & rx_flags[i].v) {
440 if (!firstflag) {
441 firstflag = 1;
442 printf(" ");
443 } else {
444 printf(",");
445 }
446 printf("<%s>", rx_flags[i].s);
447 }
448 }
449 }
450
451 /*
452 * Try to handle AFS calls that we know about. Check the destination
453 * port and make sure it's a data packet. Also, make sure the
454 * seq number is 1 (because otherwise it's a continuation packet,
455 * and we can't interpret that). Also, seems that reply packets
456 * do not have the client-init flag set, so we check for that
457 * as well.
458 */
459
460 if (rxh->type == RX_PACKET_TYPE_ACK)
461 ack_print(bp, length);
462 else if (rxh->type == RX_PACKET_TYPE_DATA &&
463 EXTRACT_32BITS(&rxh->seq) == 1 &&
464 rxh->flags & RX_CLIENT_INITIATED) {
465
466 /*
467 * Insert this call into the call cache table, so we
468 * have a chance to print out replies
469 */
470
471 rx_cache_insert(bp, (const struct ip *) bp2, dport, length);
472
473 switch (dport) {
474 case FS_RX_PORT: /* AFS file service */
475 fs_print(bp, length);
476 break;
477 case CB_RX_PORT: /* AFS callback service */
478 cb_print(bp, length);
479 break;
480 case PROT_RX_PORT: /* AFS protection service */
481 prot_print(bp, length);
482 break;
483 case VLDB_RX_PORT: /* AFS VLDB service */
484 vldb_print(bp, length);
485 break;
486 case KAUTH_RX_PORT: /* AFS Kerberos auth service */
487 kauth_print(bp, length);
488 break;
489 case VOL_RX_PORT: /* AFS Volume service */
490 vol_print(bp, length);
491 break;
492 case BOS_RX_PORT: /* AFS BOS service */
493 bos_print(bp, length);
494 break;
495 default:
496 ;
497 }
498
499 /*
500 * If it's a reply (client-init is _not_ set, but seq is one)
501 * then look it up in the cache. If we find it, call the reply
502 * printing functions Note that we handle abort packets here,
503 * because printing out the return code can be useful at times.
504 */
505
506 } else if (((rxh->type == RX_PACKET_TYPE_DATA &&
507 EXTRACT_32BITS(&rxh->seq) == 1) ||
508 rxh->type == RX_PACKET_TYPE_ABORT) &&
509 (rxh->flags & RX_CLIENT_INITIATED) == 0 &&
510 rx_cache_find(rxh, (const struct ip *) bp2,
511 sport, &opcode)) {
512
513 switch (sport) {
514 case FS_RX_PORT: /* AFS file service */
515 fs_reply_print(bp, length, opcode);
516 break;
517 case CB_RX_PORT: /* AFS callback service */
518 cb_reply_print(bp, length, opcode);
519 break;
520 case PROT_RX_PORT: /* AFS PT service */
521 prot_reply_print(bp, length, opcode);
522 break;
523 case VLDB_RX_PORT: /* AFS VLDB service */
524 vldb_reply_print(bp, length, opcode);
525 break;
526 case KAUTH_RX_PORT: /* AFS Kerberos auth service */
527 kauth_reply_print(bp, length, opcode);
528 break;
529 case VOL_RX_PORT: /* AFS Volume service */
530 vol_reply_print(bp, length, opcode);
531 break;
532 case BOS_RX_PORT: /* AFS BOS service */
533 bos_reply_print(bp, length, opcode);
534 break;
535 default:
536 ;
537 }
538
539 /*
540 * If it's an RX ack packet, then use the appropriate ack decoding
541 * function (there isn't any service-specific information in the
542 * ack packet, so we can use one for all AFS services)
543 */
544
545 } else if (rxh->type == RX_PACKET_TYPE_ACK)
546 rx_ack_print(bp, length);
547
548
549 printf(" (%d)", length);
550 }
551
552 /*
553 * Insert an entry into the cache. Taken from print-nfs.c
554 */
555
556 static void
557 rx_cache_insert(const u_char *bp, const struct ip *ip, int dport,
558 int length)
559 {
560 struct rx_cache_entry *rxent;
561 const struct rx_header *rxh = (const struct rx_header *) bp;
562
563 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t))
564 return;
565
566 rxent = &rx_cache[rx_cache_next];
567
568 if (++rx_cache_next >= RX_CACHE_SIZE)
569 rx_cache_next = 0;
570
571 rxent->callnum = rxh->callNumber;
572 rxent->client = ip->ip_src;
573 rxent->server = ip->ip_dst;
574 rxent->dport = dport;
575 rxent->serviceId = rxh->serviceId;
576 rxent->opcode = EXTRACT_32BITS(bp + sizeof(struct rx_header));
577 }
578
579 /*
580 * Lookup an entry in the cache. Also taken from print-nfs.c
581 *
582 * Note that because this is a reply, we're looking at the _source_
583 * port.
584 */
585
586 static int
587 rx_cache_find(const struct rx_header *rxh, const struct ip *ip, int sport,
588 int32_t *opcode)
589 {
590 int i;
591 struct rx_cache_entry *rxent;
592 u_int32_t clip = ip->ip_dst.s_addr;
593 u_int32_t sip = ip->ip_src.s_addr;
594
595 /* Start the search where we last left off */
596
597 i = rx_cache_hint;
598 do {
599 rxent = &rx_cache[i];
600 if (rxent->callnum == rxh->callNumber &&
601 rxent->client.s_addr == clip &&
602 rxent->server.s_addr == sip &&
603 rxent->serviceId == rxh->serviceId &&
604 rxent->dport == sport) {
605
606 /* We got a match! */
607
608 rx_cache_hint = i;
609 *opcode = rxent->opcode;
610 return(1);
611 }
612 if (++i > RX_CACHE_SIZE)
613 i = 0;
614 } while (i != rx_cache_hint);
615
616 /* Our search failed */
617 return(0);
618 }
619
620 /*
621 * These extrememly grody macros handle the printing of various AFS stuff.
622 */
623
624 #define FIDOUT() { unsigned long n1, n2, n3; \
625 TCHECK2(bp[0], sizeof(int32_t) * 3); \
626 n1 = EXTRACT_32BITS(bp); \
627 bp += sizeof(int32_t); \
628 n2 = EXTRACT_32BITS(bp); \
629 bp += sizeof(int32_t); \
630 n3 = EXTRACT_32BITS(bp); \
631 bp += sizeof(int32_t); \
632 printf(" fid %d/%d/%d", (int) n1, (int) n2, (int) n3); \
633 }
634
635 #define STROUT(MAX) { unsigned int i; \
636 TCHECK2(bp[0], sizeof(int32_t)); \
637 i = EXTRACT_32BITS(bp); \
638 if (i > (MAX)) \
639 goto trunc; \
640 bp += sizeof(int32_t); \
641 printf(" \""); \
642 if (fn_printn(bp, i, snapend)) \
643 goto trunc; \
644 printf("\""); \
645 bp += ((i + sizeof(int32_t) - 1) / sizeof(int32_t)) * sizeof(int32_t); \
646 }
647
648 #define INTOUT() { int i; \
649 TCHECK2(bp[0], sizeof(int32_t)); \
650 i = (int) EXTRACT_32BITS(bp); \
651 bp += sizeof(int32_t); \
652 printf(" %d", i); \
653 }
654
655 #define UINTOUT() { unsigned long i; \
656 TCHECK2(bp[0], sizeof(int32_t)); \
657 i = EXTRACT_32BITS(bp); \
658 bp += sizeof(int32_t); \
659 printf(" %lu", i); \
660 }
661
662 #define DATEOUT() { time_t t; struct tm *tm; char str[256]; \
663 TCHECK2(bp[0], sizeof(int32_t)); \
664 t = (time_t) EXTRACT_32BITS(bp); \
665 bp += sizeof(int32_t); \
666 tm = localtime(&t); \
667 strftime(str, 256, "%Y/%m/%d %T", tm); \
668 printf(" %s", str); \
669 }
670
671 #define STOREATTROUT() { unsigned long mask, i; \
672 TCHECK2(bp[0], (sizeof(int32_t)*6)); \
673 mask = EXTRACT_32BITS(bp); bp += sizeof(int32_t); \
674 if (mask) printf (" StoreStatus"); \
675 if (mask & 1) { printf(" date"); DATEOUT(); } \
676 else bp += sizeof(int32_t); \
677 i = EXTRACT_32BITS(bp); bp += sizeof(int32_t); \
678 if (mask & 2) printf(" owner %lu", i); \
679 i = EXTRACT_32BITS(bp); bp += sizeof(int32_t); \
680 if (mask & 4) printf(" group %lu", i); \
681 i = EXTRACT_32BITS(bp); bp += sizeof(int32_t); \
682 if (mask & 8) printf(" mode %lo", i & 07777); \
683 i = EXTRACT_32BITS(bp); bp += sizeof(int32_t); \
684 if (mask & 16) printf(" segsize %lu", i); \
685 /* undocumented in 3.3 docu */ \
686 if (mask & 1024) printf(" fsync"); \
687 }
688
689 #define UBIK_VERSIONOUT() {int32_t epoch; int32_t counter; \
690 TCHECK2(bp[0], sizeof(int32_t) * 2); \
691 epoch = EXTRACT_32BITS(bp); \
692 bp += sizeof(int32_t); \
693 counter = EXTRACT_32BITS(bp); \
694 bp += sizeof(int32_t); \
695 printf(" %d.%d", epoch, counter); \
696 }
697
698 #define AFSUUIDOUT() {u_int32_t temp; int i; \
699 TCHECK2(bp[0], 11*sizeof(u_int32_t)); \
700 temp = EXTRACT_32BITS(bp); \
701 bp += sizeof(u_int32_t); \
702 printf(" %08x", temp); \
703 temp = EXTRACT_32BITS(bp); \
704 bp += sizeof(u_int32_t); \
705 printf("%04x", temp); \
706 temp = EXTRACT_32BITS(bp); \
707 bp += sizeof(u_int32_t); \
708 printf("%04x", temp); \
709 for (i = 0; i < 8; i++) { \
710 temp = EXTRACT_32BITS(bp); \
711 bp += sizeof(u_int32_t); \
712 printf("%02x", (unsigned char) temp); \
713 } \
714 }
715
716 /*
717 * This is the sickest one of all
718 */
719
720 #define VECOUT(MAX) { char *sp; \
721 char s[AFSNAMEMAX]; \
722 int k; \
723 if ((MAX) + 1 > sizeof(s)) \
724 goto trunc; \
725 TCHECK2(bp[0], (MAX) * sizeof(int32_t)); \
726 sp = s; \
727 for (k = 0; k < (MAX); k++) { \
728 *sp++ = (char) EXTRACT_32BITS(bp); \
729 bp += sizeof(int32_t); \
730 } \
731 s[(MAX)] = '\0'; \
732 printf(" \""); \
733 fn_print(s, NULL); \
734 printf("\""); \
735 }
736
737 static void
738 ack_print(register const u_char *bp, int length)
739 {
740 u_char nAcks;
741 int i;
742
743 if (vflag <= 1)
744 return;
745
746 if (length <= sizeof(struct rx_header))
747 return;
748
749 bp += sizeof(struct rx_header);
750
751 /*
752 * Packets < firstPacket are implicitly acknowledged and may
753 * be discarded by the sender.
754 *
755 * Packets >= firstPacket+nAcks are implicitly NOT acknowledged.
756 *
757 * No packets with sequence numbers >= firstPacket should be
758 * discarded by the sender (they may thrown out at any time by
759 * the receiver)
760 */
761 #define RX_ACK_REASONS "RDOXSprn"
762 /* Requested, Duplicate, Out_of_sequence, eXceeds_window, no_Space,
763 * Ping, ping_Response, No_{progress, particular_reason}.
764 */
765 #if 0
766 struct rx_ackPacket {
767 u_short bufferSpace; /* Skip! */
768 u_short maxSkew; /* Skip! */
769 u_long firstPacket;
770 u_long previousPacket; /* Obsolete! */
771 u_long serial; /* Serial that prompted the ack, */
772 u_char reason; /* and the reason why. */
773 u_char nAcks;
774 u_char acks[RX_MAXACKS]; /* Selective acks (not a bitmap). */
775 };
776 #endif
777 #define RX_ACK_TYPE_NACK 0
778
779 TCHECK2(bp[0], 8); /* bufferSpace and maxSkew */
780 bp += 4;
781 printf(" fir %u", (unsigned)EXTRACT_32BITS(bp));
782 bp += 4;
783 TCHECK2(bp[0], 8); /* previousPacket and serial */
784 bp += 4;
785 printf(" %u", (unsigned)EXTRACT_32BITS(bp));
786 bp += 4;
787 TCHECK2(bp[0], 1);
788 printf("%c", RX_ACK_REASONS[(*bp - 1) & 07u]);
789 bp += 1; /* reason */
790 TCHECK2(bp[0], 1);
791 nAcks = *bp;
792 bp += 1; /* nAcks */
793
794 for (i = 0; i < nAcks; i++) {
795 TCHECK2(bp[0], 1);
796 putchar(*bp == RX_ACK_TYPE_NACK? '-' : '*');
797 bp += 1;
798 }
799
800 return;
801
802 trunc:
803 printf(" [|ack]");
804 }
805
806 /*
807 * Handle calls to the AFS file service (fs)
808 */
809
810 static void
811 fs_print(register const u_char *bp, int length)
812 {
813 int fs_op;
814 unsigned long i;
815
816 if (length <= sizeof(struct rx_header))
817 return;
818
819 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
820 goto trunc;
821 }
822
823 /*
824 * Print out the afs call we're invoking. The table used here was
825 * gleaned from fsint/afsint.xg
826 */
827
828 fs_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
829
830 printf(" fs call %s", tok2str(fs_req, "op#%d", fs_op));
831
832 /*
833 * Print out arguments to some of the AFS calls. This stuff is
834 * all from afsint.xg
835 */
836
837 bp += sizeof(struct rx_header) + 4;
838
839 /*
840 * Sigh. This is gross. Ritchie forgive me.
841 */
842
843 switch (fs_op) {
844 case 130: /* Fetch data */
845 FIDOUT();
846 printf(" offset");
847 UINTOUT();
848 printf(" length");
849 UINTOUT();
850 break;
851 case 131: /* Fetch ACL */
852 case 132: /* Fetch Status */
853 case 143: /* Old set lock */
854 case 144: /* Old extend lock */
855 case 145: /* Old release lock */
856 case 156: /* Set lock */
857 case 157: /* Extend lock */
858 case 158: /* Release lock */
859 FIDOUT();
860 break;
861 case 135: /* Store status */
862 FIDOUT();
863 STOREATTROUT();
864 break;
865 case 133: /* Store data */
866 FIDOUT();
867 STOREATTROUT();
868 printf(" offset");
869 UINTOUT();
870 printf(" length");
871 UINTOUT();
872 printf(" flen");
873 UINTOUT();
874 break;
875 case 134: /* Store ACL */
876 {
877 char a[AFSOPAQUEMAX+1];
878 FIDOUT();
879 TCHECK2(bp[0], 4);
880 i = EXTRACT_32BITS(bp);
881 bp += sizeof(int32_t);
882 TCHECK2(bp[0], i);
883 i = min(AFSOPAQUEMAX, i);
884 strncpy(a, (char *) bp, i);
885 a[i] = '\0';
886 acl_print((u_char *) a, sizeof(a), (u_char *) a + i);
887 break;
888 }
889 case 137: /* Create file */
890 case 141: /* MakeDir */
891 FIDOUT();
892 STROUT(AFSNAMEMAX);
893 STOREATTROUT();
894 break;
895 case 136: /* Remove file */
896 case 142: /* Remove directory */
897 FIDOUT();
898 STROUT(AFSNAMEMAX);
899 break;
900 case 138: /* Rename file */
901 printf(" old");
902 FIDOUT();
903 STROUT(AFSNAMEMAX);
904 printf(" new");
905 FIDOUT();
906 STROUT(AFSNAMEMAX);
907 break;
908 case 139: /* Symlink */
909 FIDOUT();
910 STROUT(AFSNAMEMAX);
911 printf(" link to");
912 STROUT(AFSNAMEMAX);
913 break;
914 case 140: /* Link */
915 FIDOUT();
916 STROUT(AFSNAMEMAX);
917 printf(" link to");
918 FIDOUT();
919 break;
920 case 148: /* Get volume info */
921 STROUT(AFSNAMEMAX);
922 break;
923 case 149: /* Get volume stats */
924 case 150: /* Set volume stats */
925 printf(" volid");
926 UINTOUT();
927 break;
928 case 154: /* New get volume info */
929 printf(" volname");
930 STROUT(AFSNAMEMAX);
931 break;
932 case 155: /* Bulk stat */
933 {
934 unsigned long j;
935 TCHECK2(bp[0], 4);
936 j = EXTRACT_32BITS(bp);
937 bp += sizeof(int32_t);
938
939 for (i = 0; i < j; i++) {
940 FIDOUT();
941 if (i != j - 1)
942 printf(",");
943 }
944 if (j == 0)
945 printf(" <none!>");
946 }
947 default:
948 ;
949 }
950
951 return;
952
953 trunc:
954 printf(" [|fs]");
955 }
956
957 /*
958 * Handle replies to the AFS file service
959 */
960
961 static void
962 fs_reply_print(register const u_char *bp, int length, int32_t opcode)
963 {
964 unsigned long i;
965 struct rx_header *rxh;
966
967 if (length <= sizeof(struct rx_header))
968 return;
969
970 rxh = (struct rx_header *) bp;
971
972 /*
973 * Print out the afs call we're invoking. The table used here was
974 * gleaned from fsint/afsint.xg
975 */
976
977 printf(" fs reply %s", tok2str(fs_req, "op#%d", opcode));
978
979 bp += sizeof(struct rx_header);
980
981 /*
982 * If it was a data packet, interpret the response
983 */
984
985 if (rxh->type == RX_PACKET_TYPE_DATA) {
986 switch (opcode) {
987 case 131: /* Fetch ACL */
988 {
989 char a[AFSOPAQUEMAX+1];
990 TCHECK2(bp[0], 4);
991 i = EXTRACT_32BITS(bp);
992 bp += sizeof(int32_t);
993 TCHECK2(bp[0], i);
994 i = min(AFSOPAQUEMAX, i);
995 strncpy(a, (char *) bp, i);
996 a[i] = '\0';
997 acl_print((u_char *) a, sizeof(a), (u_char *) a + i);
998 break;
999 }
1000 case 137: /* Create file */
1001 case 141: /* MakeDir */
1002 printf(" new");
1003 FIDOUT();
1004 break;
1005 case 151: /* Get root volume */
1006 printf(" root volume");
1007 STROUT(AFSNAMEMAX);
1008 break;
1009 case 153: /* Get time */
1010 DATEOUT();
1011 break;
1012 default:
1013 ;
1014 }
1015 } else if (rxh->type == RX_PACKET_TYPE_ABORT) {
1016 int i;
1017
1018 /*
1019 * Otherwise, just print out the return code
1020 */
1021 TCHECK2(bp[0], sizeof(int32_t));
1022 i = (int) EXTRACT_32BITS(bp);
1023 bp += sizeof(int32_t);
1024
1025 printf(" error %s", tok2str(afs_fs_errors, "#%d", i));
1026 } else {
1027 printf(" strange fs reply of type %d", rxh->type);
1028 }
1029
1030 return;
1031
1032 trunc:
1033 printf(" [|fs]");
1034 }
1035
1036 /*
1037 * Print out an AFS ACL string. An AFS ACL is a string that has the
1038 * following format:
1039 *
1040 * <positive> <negative>
1041 * <uid1> <aclbits1>
1042 * ....
1043 *
1044 * "positive" and "negative" are integers which contain the number of
1045 * positive and negative ACL's in the string. The uid/aclbits pair are
1046 * ASCII strings containing the UID/PTS record and and a ascii number
1047 * representing a logical OR of all the ACL permission bits
1048 */
1049
1050 static void
1051 acl_print(u_char *s, int maxsize, u_char *end)
1052 {
1053 int pos, neg, acl;
1054 int n, i;
1055 char *user;
1056
1057 if ((user = (char *)malloc(maxsize)) == NULL)
1058 return;
1059
1060 if (sscanf((char *) s, "%d %d\n%n", &pos, &neg, &n) != 2)
1061 goto finish;
1062
1063 s += n;
1064
1065 if (s > end)
1066 goto finish;
1067
1068 /*
1069 * This wacky order preserves the order used by the "fs" command
1070 */
1071
1072 #define ACLOUT(acl) \
1073 if (acl & PRSFS_READ) \
1074 printf("r"); \
1075 if (acl & PRSFS_LOOKUP) \
1076 printf("l"); \
1077 if (acl & PRSFS_INSERT) \
1078 printf("i"); \
1079 if (acl & PRSFS_DELETE) \
1080 printf("d"); \
1081 if (acl & PRSFS_WRITE) \
1082 printf("w"); \
1083 if (acl & PRSFS_LOCK) \
1084 printf("k"); \
1085 if (acl & PRSFS_ADMINISTER) \
1086 printf("a");
1087
1088 for (i = 0; i < pos; i++) {
1089 if (sscanf((char *) s, "%s %d\n%n", user, &acl, &n) != 2)
1090 goto finish;
1091 s += n;
1092 printf(" +{");
1093 fn_print(user, NULL);
1094 printf(" ");
1095 ACLOUT(acl);
1096 printf("}");
1097 if (s > end)
1098 goto finish;
1099 }
1100
1101 for (i = 0; i < neg; i++) {
1102 if (sscanf((char *) s, "%s %d\n%n", user, &acl, &n) != 2)
1103 goto finish;
1104 s += n;
1105 printf(" -{");
1106 fn_print(user, NULL);
1107 printf(" ");
1108 ACLOUT(acl);
1109 printf("}");
1110 if (s > end)
1111 goto finish;
1112 }
1113
1114 finish:
1115 free(user);
1116 return;
1117 }
1118
1119 #undef ACLOUT
1120
1121 /*
1122 * Handle calls to the AFS callback service
1123 */
1124
1125 static void
1126 cb_print(register const u_char *bp, int length)
1127 {
1128 int cb_op;
1129 unsigned long i;
1130
1131 if (length <= sizeof(struct rx_header))
1132 return;
1133
1134 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1135 goto trunc;
1136 }
1137
1138 /*
1139 * Print out the afs call we're invoking. The table used here was
1140 * gleaned from fsint/afscbint.xg
1141 */
1142
1143 cb_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1144
1145 printf(" cb call %s", tok2str(cb_req, "op#%d", cb_op));
1146
1147 bp += sizeof(struct rx_header) + 4;
1148
1149 /*
1150 * Print out the afs call we're invoking. The table used here was
1151 * gleaned from fsint/afscbint.xg
1152 */
1153
1154 switch (cb_op) {
1155 case 204: /* Callback */
1156 {
1157 unsigned long j, t;
1158 TCHECK2(bp[0], 4);
1159 j = EXTRACT_32BITS(bp);
1160 bp += sizeof(int32_t);
1161
1162 for (i = 0; i < j; i++) {
1163 FIDOUT();
1164 if (i != j - 1)
1165 printf(",");
1166 }
1167
1168 if (j == 0)
1169 printf(" <none!>");
1170
1171 j = EXTRACT_32BITS(bp);
1172 bp += sizeof(int32_t);
1173
1174 if (j != 0)
1175 printf(";");
1176
1177 for (i = 0; i < j; i++) {
1178 printf(" ver");
1179 INTOUT();
1180 printf(" expires");
1181 DATEOUT();
1182 TCHECK2(bp[0], 4);
1183 t = EXTRACT_32BITS(bp);
1184 bp += sizeof(int32_t);
1185 tok2str(cb_types, "type %d", t);
1186 }
1187 }
1188 case 214: {
1189 printf(" afsuuid");
1190 AFSUUIDOUT();
1191 break;
1192 }
1193 default:
1194 ;
1195 }
1196
1197 return;
1198
1199 trunc:
1200 printf(" [|cb]");
1201 }
1202
1203 /*
1204 * Handle replies to the AFS Callback Service
1205 */
1206
1207 static void
1208 cb_reply_print(register const u_char *bp, int length, int32_t opcode)
1209 {
1210 struct rx_header *rxh;
1211
1212 if (length <= sizeof(struct rx_header))
1213 return;
1214
1215 rxh = (struct rx_header *) bp;
1216
1217 /*
1218 * Print out the afs call we're invoking. The table used here was
1219 * gleaned from fsint/afscbint.xg
1220 */
1221
1222 printf(" cb reply %s", tok2str(cb_req, "op#%d", opcode));
1223
1224 bp += sizeof(struct rx_header);
1225
1226 /*
1227 * If it was a data packet, interpret the response.
1228 */
1229
1230 if (rxh->type == RX_PACKET_TYPE_DATA)
1231 switch (opcode) {
1232 case 213: /* InitCallBackState3 */
1233 AFSUUIDOUT();
1234 break;
1235 default:
1236 ;
1237 }
1238 else {
1239 /*
1240 * Otherwise, just print out the return code
1241 */
1242 printf(" errcode");
1243 INTOUT();
1244 }
1245
1246 return;
1247
1248 trunc:
1249 printf(" [|cb]");
1250 }
1251
1252 /*
1253 * Handle calls to the AFS protection database server
1254 */
1255
1256 static void
1257 prot_print(register const u_char *bp, int length)
1258 {
1259 unsigned long i;
1260 int pt_op;
1261
1262 if (length <= sizeof(struct rx_header))
1263 return;
1264
1265 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1266 goto trunc;
1267 }
1268
1269 /*
1270 * Print out the afs call we're invoking. The table used here was
1271 * gleaned from ptserver/ptint.xg
1272 */
1273
1274 pt_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1275
1276 printf(" pt");
1277
1278 if (is_ubik(pt_op)) {
1279 ubik_print(bp, length);
1280 return;
1281 }
1282
1283 printf(" call %s", tok2str(pt_req, "op#%d", pt_op));
1284
1285 /*
1286 * Decode some of the arguments to the PT calls
1287 */
1288
1289 bp += sizeof(struct rx_header) + 4;
1290
1291 switch (pt_op) {
1292 case 500: /* I New User */
1293 STROUT(PRNAMEMAX);
1294 printf(" id");
1295 INTOUT();
1296 printf(" oldid");
1297 INTOUT();
1298 break;
1299 case 501: /* Where is it */
1300 case 506: /* Delete */
1301 case 508: /* Get CPS */
1302 case 512: /* List entry */
1303 case 514: /* List elements */
1304 case 517: /* List owned */
1305 case 518: /* Get CPS2 */
1306 case 519: /* Get host CPS */
1307 printf(" id");
1308 INTOUT();
1309 break;
1310 case 502: /* Dump entry */
1311 printf(" pos");
1312 INTOUT();
1313 break;
1314 case 503: /* Add to group */
1315 case 507: /* Remove from group */
1316 case 515: /* Is a member of? */
1317 printf(" uid");
1318 INTOUT();
1319 printf(" gid");
1320 INTOUT();
1321 break;
1322 case 504: /* Name to ID */
1323 {
1324 unsigned long j;
1325 TCHECK2(bp[0], 4);
1326 j = EXTRACT_32BITS(bp);
1327 bp += sizeof(int32_t);
1328
1329 /*
1330 * Who designed this chicken-shit protocol?
1331 *
1332 * Each character is stored as a 32-bit
1333 * integer!
1334 */
1335
1336 for (i = 0; i < j; i++) {
1337 VECOUT(PRNAMEMAX);
1338 }
1339 if (j == 0)
1340 printf(" <none!>");
1341 }
1342 break;
1343 case 505: /* Id to name */
1344 {
1345 unsigned long j;
1346 printf(" ids:");
1347 TCHECK2(bp[0], 4);
1348 i = EXTRACT_32BITS(bp);
1349 bp += sizeof(int32_t);
1350 for (j = 0; j < i; j++)
1351 INTOUT();
1352 if (j == 0)
1353 printf(" <none!>");
1354 }
1355 break;
1356 case 509: /* New entry */
1357 STROUT(PRNAMEMAX);
1358 printf(" flag");
1359 INTOUT();
1360 printf(" oid");
1361 INTOUT();
1362 break;
1363 case 511: /* Set max */
1364 printf(" id");
1365 INTOUT();
1366 printf(" gflag");
1367 INTOUT();
1368 break;
1369 case 513: /* Change entry */
1370 printf(" id");
1371 INTOUT();
1372 STROUT(PRNAMEMAX);
1373 printf(" oldid");
1374 INTOUT();
1375 printf(" newid");
1376 INTOUT();
1377 break;
1378 case 520: /* Update entry */
1379 printf(" id");
1380 INTOUT();
1381 STROUT(PRNAMEMAX);
1382 break;
1383 default:
1384 ;
1385 }
1386
1387
1388 return;
1389
1390 trunc:
1391 printf(" [|pt]");
1392 }
1393
1394 /*
1395 * Handle replies to the AFS protection service
1396 */
1397
1398 static void
1399 prot_reply_print(register const u_char *bp, int length, int32_t opcode)
1400 {
1401 struct rx_header *rxh;
1402 unsigned long i;
1403
1404 if (length < sizeof(struct rx_header))
1405 return;
1406
1407 rxh = (struct rx_header *) bp;
1408
1409 /*
1410 * Print out the afs call we're invoking. The table used here was
1411 * gleaned from ptserver/ptint.xg. Check to see if it's a
1412 * Ubik call, however.
1413 */
1414
1415 printf(" pt");
1416
1417 if (is_ubik(opcode)) {
1418 ubik_reply_print(bp, length, opcode);
1419 return;
1420 }
1421
1422 printf(" reply %s", tok2str(pt_req, "op#%d", opcode));
1423
1424 bp += sizeof(struct rx_header);
1425
1426 /*
1427 * If it was a data packet, interpret the response
1428 */
1429
1430 if (rxh->type == RX_PACKET_TYPE_DATA)
1431 switch (opcode) {
1432 case 504: /* Name to ID */
1433 {
1434 unsigned long j;
1435 printf(" ids:");
1436 TCHECK2(bp[0], 4);
1437 i = EXTRACT_32BITS(bp);
1438 bp += sizeof(int32_t);
1439 for (j = 0; j < i; j++)
1440 INTOUT();
1441 if (j == 0)
1442 printf(" <none!>");
1443 }
1444 break;
1445 case 505: /* ID to name */
1446 {
1447 unsigned long j;
1448 TCHECK2(bp[0], 4);
1449 j = EXTRACT_32BITS(bp);
1450 bp += sizeof(int32_t);
1451
1452 /*
1453 * Who designed this chicken-shit protocol?
1454 *
1455 * Each character is stored as a 32-bit
1456 * integer!
1457 */
1458
1459 for (i = 0; i < j; i++) {
1460 VECOUT(PRNAMEMAX);
1461 }
1462 if (j == 0)
1463 printf(" <none!>");
1464 }
1465 break;
1466 case 508: /* Get CPS */
1467 case 514: /* List elements */
1468 case 517: /* List owned */
1469 case 518: /* Get CPS2 */
1470 case 519: /* Get host CPS */
1471 {
1472 unsigned long j;
1473 TCHECK2(bp[0], 4);
1474 j = EXTRACT_32BITS(bp);
1475 bp += sizeof(int32_t);
1476 for (i = 0; i < j; i++) {
1477 INTOUT();
1478 }
1479 if (j == 0)
1480 printf(" <none!>");
1481 }
1482 break;
1483 case 510: /* List max */
1484 printf(" maxuid");
1485 INTOUT();
1486 printf(" maxgid");
1487 INTOUT();
1488 break;
1489 default:
1490 ;
1491 }
1492 else {
1493 /*
1494 * Otherwise, just print out the return code
1495 */
1496 printf(" errcode");
1497 INTOUT();
1498 }
1499
1500 return;
1501
1502 trunc:
1503 printf(" [|pt]");
1504 }
1505
1506 /*
1507 * Handle calls to the AFS volume location database service
1508 */
1509
1510 static void
1511 vldb_print(register const u_char *bp, int length)
1512 {
1513 int vldb_op;
1514 unsigned long i;
1515
1516 if (length <= sizeof(struct rx_header))
1517 return;
1518
1519 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1520 goto trunc;
1521 }
1522
1523 /*
1524 * Print out the afs call we're invoking. The table used here was
1525 * gleaned from vlserver/vldbint.xg
1526 */
1527
1528 vldb_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1529
1530 printf(" vldb");
1531
1532 if (is_ubik(vldb_op)) {
1533 ubik_print(bp, length);
1534 return;
1535 }
1536 printf(" call %s", tok2str(vldb_req, "op#%d", vldb_op));
1537
1538 /*
1539 * Decode some of the arguments to the VLDB calls
1540 */
1541
1542 bp += sizeof(struct rx_header) + 4;
1543
1544 switch (vldb_op) {
1545 case 501: /* Create new volume */
1546 case 517: /* Create entry N */
1547 VECOUT(VLNAMEMAX);
1548 break;
1549 case 502: /* Delete entry */
1550 case 503: /* Get entry by ID */
1551 case 507: /* Update entry */
1552 case 508: /* Set lock */
1553 case 509: /* Release lock */
1554 case 518: /* Get entry by ID N */
1555 printf(" volid");
1556 INTOUT();
1557 TCHECK2(bp[0], sizeof(int32_t));
1558 i = EXTRACT_32BITS(bp);
1559 bp += sizeof(int32_t);
1560 if (i <= 2)
1561 printf(" type %s", voltype[i]);
1562 break;
1563 case 504: /* Get entry by name */
1564 case 519: /* Get entry by name N */
1565 case 524: /* Update entry by name */
1566 case 527: /* Get entry by name U */
1567 STROUT(VLNAMEMAX);
1568 break;
1569 case 505: /* Get new vol id */
1570 printf(" bump");
1571 INTOUT();
1572 break;
1573 case 506: /* Replace entry */
1574 case 520: /* Replace entry N */
1575 printf(" volid");
1576 INTOUT();
1577 TCHECK2(bp[0], sizeof(int32_t));
1578 i = EXTRACT_32BITS(bp);
1579 bp += sizeof(int32_t);
1580 if (i <= 2)
1581 printf(" type %s", voltype[i]);
1582 VECOUT(VLNAMEMAX);
1583 break;
1584 case 510: /* List entry */
1585 case 521: /* List entry N */
1586 printf(" index");
1587 INTOUT();
1588 break;
1589 default:
1590 ;
1591 }
1592
1593 return;
1594
1595 trunc:
1596 printf(" [|vldb]");
1597 }
1598
1599 /*
1600 * Handle replies to the AFS volume location database service
1601 */
1602
1603 static void
1604 vldb_reply_print(register const u_char *bp, int length, int32_t opcode)
1605 {
1606 struct rx_header *rxh;
1607 unsigned long i;
1608
1609 if (length < sizeof(struct rx_header))
1610 return;
1611
1612 rxh = (struct rx_header *) bp;
1613
1614 /*
1615 * Print out the afs call we're invoking. The table used here was
1616 * gleaned from vlserver/vldbint.xg. Check to see if it's a
1617 * Ubik call, however.
1618 */
1619
1620 printf(" vldb");
1621
1622 if (is_ubik(opcode)) {
1623 ubik_reply_print(bp, length, opcode);
1624 return;
1625 }
1626
1627 printf(" reply %s", tok2str(vldb_req, "op#%d", opcode));
1628
1629 bp += sizeof(struct rx_header);
1630
1631 /*
1632 * If it was a data packet, interpret the response
1633 */
1634
1635 if (rxh->type == RX_PACKET_TYPE_DATA)
1636 switch (opcode) {
1637 case 510: /* List entry */
1638 printf(" count");
1639 INTOUT();
1640 printf(" nextindex");
1641 INTOUT();
1642 case 503: /* Get entry by id */
1643 case 504: /* Get entry by name */
1644 { unsigned long nservers, j;
1645 VECOUT(VLNAMEMAX);
1646 TCHECK2(bp[0], sizeof(int32_t));
1647 bp += sizeof(int32_t);
1648 printf(" numservers");
1649 TCHECK2(bp[0], sizeof(int32_t));
1650 nservers = EXTRACT_32BITS(bp);
1651 bp += sizeof(int32_t);
1652 printf(" %lu", nservers);
1653 printf(" servers");
1654 for (i = 0; i < 8; i++) {
1655 TCHECK2(bp[0], sizeof(int32_t));
1656 if (i < nservers)
1657 printf(" %s",
1658 inet_ntoa(*((struct in_addr *) bp)));
1659 bp += sizeof(int32_t);
1660 }
1661 printf(" partitions");
1662 for (i = 0; i < 8; i++) {
1663 TCHECK2(bp[0], sizeof(int32_t));
1664 j = EXTRACT_32BITS(bp);
1665 if (i < nservers && j <= 26)
1666 printf(" %c", 'a' + (int)j);
1667 else if (i < nservers)
1668 printf(" %lu", j);
1669 bp += sizeof(int32_t);
1670 }
1671 TCHECK2(bp[0], 8 * sizeof(int32_t));
1672 bp += 8 * sizeof(int32_t);
1673 printf(" rwvol");
1674 UINTOUT();
1675 printf(" rovol");
1676 UINTOUT();
1677 printf(" backup");
1678 UINTOUT();
1679 }
1680 break;
1681 case 505: /* Get new volume ID */
1682 printf(" newvol");
1683 UINTOUT();
1684 break;
1685 case 521: /* List entry */
1686 case 529: /* List entry U */
1687 printf(" count");
1688 INTOUT();
1689 printf(" nextindex");
1690 INTOUT();
1691 case 518: /* Get entry by ID N */
1692 case 519: /* Get entry by name N */
1693 { unsigned long nservers, j;
1694 VECOUT(VLNAMEMAX);
1695 printf(" numservers");
1696 TCHECK2(bp[0], sizeof(int32_t));
1697 nservers = EXTRACT_32BITS(bp);
1698 bp += sizeof(int32_t);
1699 printf(" %lu", nservers);
1700 printf(" servers");
1701 for (i = 0; i < 13; i++) {
1702 TCHECK2(bp[0], sizeof(int32_t));
1703 if (i < nservers)
1704 printf(" %s",
1705 inet_ntoa(*((struct in_addr *) bp)));
1706 bp += sizeof(int32_t);
1707 }
1708 printf(" partitions");
1709 for (i = 0; i < 13; i++) {
1710 TCHECK2(bp[0], sizeof(int32_t));
1711 j = EXTRACT_32BITS(bp);
1712 if (i < nservers && j <= 26)
1713 printf(" %c", 'a' + (int)j);
1714 else if (i < nservers)
1715 printf(" %lu", j);
1716 bp += sizeof(int32_t);
1717 }
1718 TCHECK2(bp[0], 13 * sizeof(int32_t));
1719 bp += 13 * sizeof(int32_t);
1720 printf(" rwvol");
1721 UINTOUT();
1722 printf(" rovol");
1723 UINTOUT();
1724 printf(" backup");
1725 UINTOUT();
1726 }
1727 break;
1728 case 526: /* Get entry by ID U */
1729 case 527: /* Get entry by name U */
1730 { unsigned long nservers, j;
1731 VECOUT(VLNAMEMAX);
1732 printf(" numservers");
1733 TCHECK2(bp[0], sizeof(int32_t));
1734 nservers = EXTRACT_32BITS(bp);
1735 bp += sizeof(int32_t);
1736 printf(" %lu", nservers);
1737 printf(" servers");
1738 for (i = 0; i < 13; i++) {
1739 if (i < nservers) {
1740 printf(" afsuuid");
1741 AFSUUIDOUT();
1742 } else {
1743 TCHECK2(bp[0], 44);
1744 bp += 44;
1745 }
1746 }
1747 TCHECK2(bp[0], 4 * 13);
1748 bp += 4 * 13;
1749 printf(" partitions");
1750 for (i = 0; i < 13; i++) {
1751 TCHECK2(bp[0], sizeof(int32_t));
1752 j = EXTRACT_32BITS(bp);
1753 if (i < nservers && j <= 26)
1754 printf(" %c", 'a' + (int)j);
1755 else if (i < nservers)
1756 printf(" %lu", j);
1757 bp += sizeof(int32_t);
1758 }
1759 TCHECK2(bp[0], 13 * sizeof(int32_t));
1760 bp += 13 * sizeof(int32_t);
1761 printf(" rwvol");
1762 UINTOUT();
1763 printf(" rovol");
1764 UINTOUT();
1765 printf(" backup");
1766 UINTOUT();
1767 }
1768 default:
1769 ;
1770 }
1771
1772 else {
1773 /*
1774 * Otherwise, just print out the return code
1775 */
1776 printf(" errcode");
1777 INTOUT();
1778 }
1779
1780 return;
1781
1782 trunc:
1783 printf(" [|vldb]");
1784 }
1785
1786 /*
1787 * Handle calls to the AFS Kerberos Authentication service
1788 */
1789
1790 static void
1791 kauth_print(register const u_char *bp, int length)
1792 {
1793 int kauth_op;
1794
1795 if (length <= sizeof(struct rx_header))
1796 return;
1797
1798 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1799 goto trunc;
1800 }
1801
1802 /*
1803 * Print out the afs call we're invoking. The table used here was
1804 * gleaned from kauth/kauth.rg
1805 */
1806
1807 kauth_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1808
1809 printf(" kauth");
1810
1811 if (is_ubik(kauth_op)) {
1812 ubik_print(bp, length);
1813 return;
1814 }
1815
1816
1817 printf(" call %s", tok2str(kauth_req, "op#%d", kauth_op));
1818
1819 /*
1820 * Decode some of the arguments to the KA calls
1821 */
1822
1823 bp += sizeof(struct rx_header) + 4;
1824
1825 switch (kauth_op) {
1826 case 1: /* Authenticate old */;
1827 case 21: /* Authenticate */
1828 case 22: /* Authenticate-V2 */
1829 case 2: /* Change PW */
1830 case 5: /* Set fields */
1831 case 6: /* Create user */
1832 case 7: /* Delete user */
1833 case 8: /* Get entry */
1834 case 14: /* Unlock */
1835 case 15: /* Lock status */
1836 printf(" principal");
1837 STROUT(KANAMEMAX);
1838 STROUT(KANAMEMAX);
1839 break;
1840 case 3: /* GetTicket-old */
1841 case 23: /* GetTicket */
1842 {
1843 int i;
1844 printf(" kvno");
1845 INTOUT();
1846 printf(" domain");
1847 STROUT(KANAMEMAX);
1848 TCHECK2(bp[0], sizeof(int32_t));
1849 i = (int) EXTRACT_32BITS(bp);
1850 bp += sizeof(int32_t);
1851 TCHECK2(bp[0], i);
1852 bp += i;
1853 printf(" principal");
1854 STROUT(KANAMEMAX);
1855 STROUT(KANAMEMAX);
1856 break;
1857 }
1858 case 4: /* Set Password */
1859 printf(" principal");
1860 STROUT(KANAMEMAX);
1861 STROUT(KANAMEMAX);
1862 printf(" kvno");
1863 INTOUT();
1864 break;
1865 case 12: /* Get password */
1866 printf(" name");
1867 STROUT(KANAMEMAX);
1868 break;
1869 default:
1870 ;
1871 }
1872
1873 return;
1874
1875 trunc:
1876 printf(" [|kauth]");
1877 }
1878
1879 /*
1880 * Handle replies to the AFS Kerberos Authentication Service
1881 */
1882
1883 static void
1884 kauth_reply_print(register const u_char *bp, int length, int32_t opcode)
1885 {
1886 struct rx_header *rxh;
1887
1888 if (length <= sizeof(struct rx_header))
1889 return;
1890
1891 rxh = (struct rx_header *) bp;
1892
1893 /*
1894 * Print out the afs call we're invoking. The table used here was
1895 * gleaned from kauth/kauth.rg
1896 */
1897
1898 printf(" kauth");
1899
1900 if (is_ubik(opcode)) {
1901 ubik_reply_print(bp, length, opcode);
1902 return;
1903 }
1904
1905 printf(" reply %s", tok2str(kauth_req, "op#%d", opcode));
1906
1907 bp += sizeof(struct rx_header);
1908
1909 /*
1910 * If it was a data packet, interpret the response.
1911 */
1912
1913 if (rxh->type == RX_PACKET_TYPE_DATA)
1914 /* Well, no, not really. Leave this for later */
1915 ;
1916 else {
1917 /*
1918 * Otherwise, just print out the return code
1919 */
1920 printf(" errcode");
1921 INTOUT();
1922 }
1923
1924 return;
1925
1926 trunc:
1927 printf(" [|kauth]");
1928 }
1929
1930 /*
1931 * Handle calls to the AFS Volume location service
1932 */
1933
1934 static void
1935 vol_print(register const u_char *bp, int length)
1936 {
1937 int vol_op;
1938
1939 if (length <= sizeof(struct rx_header))
1940 return;
1941
1942 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1943 goto trunc;
1944 }
1945
1946 /*
1947 * Print out the afs call we're invoking. The table used here was
1948 * gleaned from volser/volint.xg
1949 */
1950
1951 vol_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1952
1953 printf(" vol call %s", tok2str(vol_req, "op#%d", vol_op));
1954
1955 /*
1956 * Normally there would be a switch statement here to decode the
1957 * arguments to the AFS call, but since I don't have access to
1958 * an AFS server (yet) and I'm not an AFS admin, I can't
1959 * test any of these calls. Leave this blank for now.
1960 */
1961
1962 return;
1963
1964 trunc:
1965 printf(" [|vol]");
1966 }
1967
1968 /*
1969 * Handle replies to the AFS Volume Service
1970 */
1971
1972 static void
1973 vol_reply_print(register const u_char *bp, int length, int32_t opcode)
1974 {
1975 struct rx_header *rxh;
1976
1977 if (length <= sizeof(struct rx_header))
1978 return;
1979
1980 rxh = (struct rx_header *) bp;
1981
1982 /*
1983 * Print out the afs call we're invoking. The table used here was
1984 * gleaned from volser/volint.xg
1985 */
1986
1987 printf(" vol reply %s", tok2str(vol_req, "op#%d", opcode));
1988
1989 bp += sizeof(struct rx_header);
1990
1991 /*
1992 * If it was a data packet, interpret the response.
1993 */
1994
1995 if (rxh->type == RX_PACKET_TYPE_DATA)
1996 /* Well, no, not really. Leave this for later */
1997 ;
1998 else {
1999 /*
2000 * Otherwise, just print out the return code
2001 */
2002 printf(" errcode");
2003 INTOUT();
2004 }
2005
2006 return;
2007
2008 trunc:
2009 printf(" [|vol]");
2010 }
2011
2012 /*
2013 * Handle calls to the AFS BOS service
2014 */
2015
2016 static void
2017 bos_print(register const u_char *bp, int length)
2018 {
2019 int bos_op;
2020
2021 if (length <= sizeof(struct rx_header))
2022 return;
2023
2024 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
2025 goto trunc;
2026 }
2027
2028 /*
2029 * Print out the afs call we're invoking. The table used here was
2030 * gleaned from bozo/bosint.xg
2031 */
2032
2033 bos_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
2034
2035 printf(" bos call %s", tok2str(bos_req, "op#%d", bos_op));
2036
2037 /*
2038 * Decode some of the arguments to the BOS calls
2039 */
2040
2041 bp += sizeof(struct rx_header) + 4;
2042
2043 switch (bos_op) {
2044 case 80: /* Create B node */
2045 printf(" type");
2046 STROUT(BOSNAMEMAX);
2047 printf(" instance");
2048 STROUT(BOSNAMEMAX);
2049 break;
2050 case 81: /* Delete B node */
2051 case 83: /* Get status */
2052 case 85: /* Get instance info */
2053 case 87: /* Add super user */
2054 case 88: /* Delete super user */
2055 case 93: /* Set cell name */
2056 case 96: /* Add cell host */
2057 case 97: /* Delete cell host */
2058 case 104: /* Restart */
2059 case 106: /* Uninstall */
2060 case 108: /* Exec */
2061 case 112: /* Getlog */
2062 case 114: /* Get instance strings */
2063 STROUT(BOSNAMEMAX);
2064 break;
2065 case 82: /* Set status */
2066 case 98: /* Set T status */
2067 STROUT(BOSNAMEMAX);
2068 printf(" status");
2069 INTOUT();
2070 break;
2071 case 86: /* Get instance parm */
2072 STROUT(BOSNAMEMAX);
2073 printf(" num");
2074 INTOUT();
2075 break;
2076 case 84: /* Enumerate instance */
2077 case 89: /* List super users */
2078 case 90: /* List keys */
2079 case 91: /* Add key */
2080 case 92: /* Delete key */
2081 case 95: /* Get cell host */
2082 INTOUT();
2083 break;
2084 case 105: /* Install */
2085 STROUT(BOSNAMEMAX);
2086 printf(" size");
2087 INTOUT();
2088 printf(" flags");
2089 INTOUT();
2090 printf(" date");
2091 INTOUT();
2092 break;
2093 default:
2094 ;
2095 }
2096
2097 return;
2098
2099 trunc:
2100 printf(" [|bos]");
2101 }
2102
2103 /*
2104 * Handle replies to the AFS BOS Service
2105 */
2106
2107 static void
2108 bos_reply_print(register const u_char *bp, int length, int32_t opcode)
2109 {
2110 struct rx_header *rxh;
2111
2112 if (length <= sizeof(struct rx_header))
2113 return;
2114
2115 rxh = (struct rx_header *) bp;
2116
2117 /*
2118 * Print out the afs call we're invoking. The table used here was
2119 * gleaned from volser/volint.xg
2120 */
2121
2122 printf(" bos reply %s", tok2str(bos_req, "op#%d", opcode));
2123
2124 bp += sizeof(struct rx_header);
2125
2126 /*
2127 * If it was a data packet, interpret the response.
2128 */
2129
2130 if (rxh->type == RX_PACKET_TYPE_DATA)
2131 /* Well, no, not really. Leave this for later */
2132 ;
2133 else {
2134 /*
2135 * Otherwise, just print out the return code
2136 */
2137 printf(" errcode");
2138 INTOUT();
2139 }
2140
2141 return;
2142
2143 trunc:
2144 printf(" [|bos]");
2145 }
2146
2147 /*
2148 * Check to see if this is a Ubik opcode.
2149 */
2150
2151 static int
2152 is_ubik(u_int32_t opcode)
2153 {
2154 if ((opcode >= VOTE_LOW && opcode <= VOTE_HIGH) ||
2155 (opcode >= DISK_LOW && opcode <= DISK_HIGH))
2156 return(1);
2157 else
2158 return(0);
2159 }
2160
2161 /*
2162 * Handle Ubik opcodes to any one of the replicated database services
2163 */
2164
2165 static void
2166 ubik_print(register const u_char *bp, int length)
2167 {
2168 int ubik_op;
2169 int32_t temp;
2170
2171 /*
2172 * Print out the afs call we're invoking. The table used here was
2173 * gleaned from ubik/ubik_int.xg
2174 */
2175
2176 ubik_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
2177
2178 printf(" ubik call %s", tok2str(ubik_req, "op#%d", ubik_op));
2179
2180 /*
2181 * Decode some of the arguments to the Ubik calls
2182 */
2183
2184 bp += sizeof(struct rx_header) + 4;
2185
2186 switch (ubik_op) {
2187 case 10000: /* Beacon */
2188 TCHECK2(bp[0], 4);
2189 temp = EXTRACT_32BITS(bp);
2190 bp += sizeof(int32_t);
2191 printf(" syncsite %s", temp ? "yes" : "no");
2192 printf(" votestart");
2193 DATEOUT();
2194 printf(" dbversion");
2195 UBIK_VERSIONOUT();
2196 printf(" tid");
2197 UBIK_VERSIONOUT();
2198 break;
2199 case 10003: /* Get sync site */
2200 printf(" site");
2201 UINTOUT();
2202 break;
2203 case 20000: /* Begin */
2204 case 20001: /* Commit */
2205 case 20007: /* Abort */
2206 case 20008: /* Release locks */
2207 case 20010: /* Writev */
2208 printf(" tid");
2209 UBIK_VERSIONOUT();
2210 break;
2211 case 20002: /* Lock */
2212 printf(" tid");
2213 UBIK_VERSIONOUT();
2214 printf(" file");
2215 INTOUT();
2216 printf(" pos");
2217 INTOUT();
2218 printf(" length");
2219 INTOUT();
2220 temp = EXTRACT_32BITS(bp);
2221 bp += sizeof(int32_t);
2222 tok2str(ubik_lock_types, "type %d", temp);
2223 break;
2224 case 20003: /* Write */
2225 printf(" tid");
2226 UBIK_VERSIONOUT();
2227 printf(" file");
2228 INTOUT();
2229 printf(" pos");
2230 INTOUT();
2231 break;
2232 case 20005: /* Get file */
2233 printf(" file");
2234 INTOUT();
2235 break;
2236 case 20006: /* Send file */
2237 printf(" file");
2238 INTOUT();
2239 printf(" length");
2240 INTOUT();
2241 printf(" dbversion");
2242 UBIK_VERSIONOUT();
2243 break;
2244 case 20009: /* Truncate */
2245 printf(" tid");
2246 UBIK_VERSIONOUT();
2247 printf(" file");
2248 INTOUT();
2249 printf(" length");
2250 INTOUT();
2251 break;
2252 case 20012: /* Set version */
2253 printf(" tid");
2254 UBIK_VERSIONOUT();
2255 printf(" oldversion");
2256 UBIK_VERSIONOUT();
2257 printf(" newversion");
2258 UBIK_VERSIONOUT();
2259 break;
2260 default:
2261 ;
2262 }
2263
2264 return;
2265
2266 trunc:
2267 printf(" [|ubik]");
2268 }
2269
2270 /*
2271 * Handle Ubik replies to any one of the replicated database services
2272 */
2273
2274 static void
2275 ubik_reply_print(register const u_char *bp, int length, int32_t opcode)
2276 {
2277 struct rx_header *rxh;
2278
2279 if (length < sizeof(struct rx_header))
2280 return;
2281
2282 rxh = (struct rx_header *) bp;
2283
2284 /*
2285 * Print out the ubik call we're invoking. This table was gleaned
2286 * from ubik/ubik_int.xg
2287 */
2288
2289 printf(" ubik reply %s", tok2str(ubik_req, "op#%d", opcode));
2290
2291 bp += sizeof(struct rx_header);
2292
2293 /*
2294 * If it was a data packet, print out the arguments to the Ubik calls
2295 */
2296
2297 if (rxh->type == RX_PACKET_TYPE_DATA)
2298 switch (opcode) {
2299 case 10000: /* Beacon */
2300 printf(" vote no");
2301 break;
2302 case 20004: /* Get version */
2303 printf(" dbversion");
2304 UBIK_VERSIONOUT();
2305 break;
2306 default:
2307 ;
2308 }
2309
2310 /*
2311 * Otherwise, print out "yes" it it was a beacon packet (because
2312 * that's how yes votes are returned, go figure), otherwise
2313 * just print out the error code.
2314 */
2315
2316 else
2317 switch (opcode) {
2318 case 10000: /* Beacon */
2319 printf(" vote yes until");
2320 DATEOUT();
2321 break;
2322 default:
2323 printf(" errcode");
2324 INTOUT();
2325 }
2326
2327 return;
2328
2329 trunc:
2330 printf(" [|ubik]");
2331 }
2332
2333 /*
2334 * Handle RX ACK packets.
2335 */
2336
2337 static void
2338 rx_ack_print(register const u_char *bp, int length)
2339 {
2340 struct rx_ackPacket *rxa;
2341 int i, start, last;
2342
2343 if (length < sizeof(struct rx_header))
2344 return;
2345
2346 bp += sizeof(struct rx_header);
2347
2348 /*
2349 * This may seem a little odd .... the rx_ackPacket structure
2350 * contains an array of individual packet acknowledgements
2351 * (used for selective ack/nack), but since it's variable in size,
2352 * we don't want to truncate based on the size of the whole
2353 * rx_ackPacket structure.
2354 */
2355
2356 TCHECK2(bp[0], sizeof(struct rx_ackPacket) - RX_MAXACKS);
2357
2358 rxa = (struct rx_ackPacket *) bp;
2359 bp += (sizeof(struct rx_ackPacket) - RX_MAXACKS);
2360
2361 /*
2362 * Print out a few useful things from the ack packet structure
2363 */
2364
2365 if (vflag > 2)
2366 printf(" bufspace %d maxskew %d",
2367 (int) EXTRACT_16BITS(&rxa->bufferSpace),
2368 (int) EXTRACT_16BITS(&rxa->maxSkew));
2369
2370 printf(" first %d serial %d reason %s",
2371 EXTRACT_32BITS(&rxa->firstPacket), EXTRACT_32BITS(&rxa->serial),
2372 tok2str(rx_ack_reasons, "#%d", (int) rxa->reason));
2373
2374 /*
2375 * Okay, now we print out the ack array. The way _this_ works
2376 * is that we start at "first", and step through the ack array.
2377 * If we have a contiguous range of acks/nacks, try to
2378 * collapse them into a range.
2379 *
2380 * If you're really clever, you might have noticed that this
2381 * doesn't seem quite correct. Specifically, due to structure
2382 * padding, sizeof(struct rx_ackPacket) - RX_MAXACKS won't actually
2383 * yield the start of the ack array (because RX_MAXACKS is 255
2384 * and the structure will likely get padded to a 2 or 4 byte
2385 * boundary). However, this is the way it's implemented inside
2386 * of AFS - the start of the extra fields are at
2387 * sizeof(struct rx_ackPacket) - RX_MAXACKS + nAcks, which _isn't_
2388 * the exact start of the ack array. Sigh. That's why we aren't
2389 * using bp, but instead use rxa->acks[]. But nAcks gets added
2390 * to bp after this, so bp ends up at the right spot. Go figure.
2391 */
2392
2393 if (rxa->nAcks != 0) {
2394
2395 TCHECK2(bp[0], rxa->nAcks);
2396
2397 /*
2398 * Sigh, this is gross, but it seems to work to collapse
2399 * ranges correctly.
2400 */
2401
2402 for (i = 0, start = last = -2; i < rxa->nAcks; i++)
2403 if (rxa->acks[i] == RX_ACK_TYPE_ACK) {
2404
2405 /*
2406 * I figured this deserved _some_ explanation.
2407 * First, print "acked" and the packet seq
2408 * number if this is the first time we've
2409 * seen an acked packet.
2410 */
2411
2412 if (last == -2) {
2413 printf(" acked %d",
2414 rxa->firstPacket + i);
2415 start = i;
2416 }
2417
2418 /*
2419 * Otherwise, if the there is a skip in
2420 * the range (such as an nacked packet in
2421 * the middle of some acked packets),
2422 * then print the current packet number
2423 * seperated from the last number by
2424 * a comma.
2425 */
2426
2427 else if (last != i - 1) {
2428 printf(",%d", rxa->firstPacket + i);
2429 start = i;
2430 }
2431
2432 /*
2433 * We always set last to the value of
2434 * the last ack we saw. Conversely, start
2435 * is set to the value of the first ack
2436 * we saw in a range.
2437 */
2438
2439 last = i;
2440
2441 /*
2442 * Okay, this bit a code gets executed when
2443 * we hit a nack ... in _this_ case we
2444 * want to print out the range of packets
2445 * that were acked, so we need to print
2446 * the _previous_ packet number seperated
2447 * from the first by a dash (-). Since we
2448 * already printed the first packet above,
2449 * just print the final packet. Don't
2450 * do this if there will be a single-length
2451 * range.
2452 */
2453 } else if (last == i - 1 && start != last)
2454 printf("-%d", rxa->firstPacket + i - 1);
2455
2456 /*
2457 * So, what's going on here? We ran off the end of the
2458 * ack list, and if we got a range we need to finish it up.
2459 * So we need to determine if the last packet in the list
2460 * was an ack (if so, then last will be set to it) and
2461 * we need to see if the last range didn't start with the
2462 * last packet (because if it _did_, then that would mean
2463 * that the packet number has already been printed and
2464 * we don't need to print it again).
2465 */
2466
2467 if (last == i - 1 && start != last)
2468 printf("-%d", rxa->firstPacket + i - 1);
2469
2470 /*
2471 * Same as above, just without comments
2472 */
2473
2474 for (i = 0, start = last = -2; i < rxa->nAcks; i++)
2475 if (rxa->acks[i] == RX_ACK_TYPE_NACK) {
2476 if (last == -2) {
2477 printf(" nacked %d",
2478 rxa->firstPacket + i);
2479 start = i;
2480 } else if (last != i - 1) {
2481 printf(",%d", rxa->firstPacket + i);
2482 start = i;
2483 }
2484 last = i;
2485 } else if (last == i - 1 && start != last)
2486 printf("-%d", rxa->firstPacket + i - 1);
2487
2488 if (last == i - 1 && start != last)
2489 printf("-%d", rxa->firstPacket + i - 1);
2490
2491 bp += rxa->nAcks;
2492 }
2493
2494
2495 /*
2496 * These are optional fields; depending on your version of AFS,
2497 * you may or may not see them
2498 */
2499
2500 #define TRUNCRET(n) if (snapend - bp + 1 <= n) return;
2501
2502 if (vflag > 1) {
2503 TRUNCRET(4);
2504 printf(" ifmtu");
2505 INTOUT();
2506
2507 TRUNCRET(4);
2508 printf(" maxmtu");
2509 INTOUT();
2510
2511 TRUNCRET(4);
2512 printf(" rwind");
2513 INTOUT();
2514
2515 TRUNCRET(4);
2516 printf(" maxpackets");
2517 INTOUT();
2518 }
2519
2520 return;
2521
2522 trunc:
2523 printf(" [|ack]");
2524 }
2525 #undef TRUNCRET
[mirror] the TCPdump network dissector