]> The Tcpdump Group git mirrors - tcpdump/blob - print-rx.c
projects / tcpdump / blob
summary | shortlog | log | commit | commitdiff | tree
history | raw | HEAD
-Wunused pedant
[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.24 2001-07-09 09:17:44 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 int k; \
722 TCHECK2(bp[0], MAX * sizeof(int32_t)); \
723 sp = s; \
724 for (k = 0; k < MAX; k++) { \
725 *sp++ = (char) EXTRACT_32BITS(bp); \
726 bp += sizeof(int32_t); \
727 } \
728 s[MAX] = '\0'; \
729 printf(" \""); \
730 fn_print(s, NULL); \
731 printf("\""); \
732 }
733
734 static void
735 ack_print(register const u_char *bp, int length)
736 {
737 u_char nAcks;
738 int i;
739
740 if (vflag <= 1)
741 return;
742
743 if (length <= sizeof(struct rx_header))
744 return;
745
746 bp += sizeof(struct rx_header);
747
748 /*
749 * Packets < firstPacket are implicitly acknowledged and may
750 * be discarded by the sender.
751 *
752 * Packets >= firstPacket+nAcks are implicitly NOT acknowledged.
753 *
754 * No packets with sequence numbers >= firstPacket should be
755 * discarded by the sender (they may thrown out at any time by
756 * the receiver)
757 */
758 #define RX_ACK_REASONS "RDOXSprn"
759 /* Requested, Duplicate, Out_of_sequence, eXceeds_window, no_Space,
760 * Ping, ping_Response, No_{progress, particular_reason}.
761 */
762 #if 0
763 struct rx_ackPacket {
764 u_short bufferSpace; /* Skip! */
765 u_short maxSkew; /* Skip! */
766 u_long firstPacket;
767 u_long previousPacket; /* Obsolete! */
768 u_long serial; /* Serial that prompted the ack, */
769 u_char reason; /* and the reason why. */
770 u_char nAcks;
771 u_char acks[RX_MAXACKS]; /* Selective acks (not a bitmap). */
772 };
773 #endif
774 #define RX_ACK_TYPE_NACK 0
775
776 TCHECK2(bp[0], 8); /* bufferSpace and maxSkew */
777 bp += 4;
778 printf(" fir %u", (unsigned)EXTRACT_32BITS(bp));
779 bp += 4;
780 TCHECK2(bp[0], 8); /* previousPacket and serial */
781 bp += 4;
782 printf(" %u", (unsigned)EXTRACT_32BITS(bp));
783 bp += 4;
784 TCHECK2(bp[0], 1);
785 printf("%c", RX_ACK_REASONS[(*bp - 1) & 07u]);
786 bp += 1; /* reason */
787 TCHECK2(bp[0], 1);
788 nAcks = *bp;
789 bp += 1; /* nAcks */
790
791 for (i = 0; i < nAcks; i++) {
792 TCHECK2(bp[0], 1);
793 putchar(*bp == RX_ACK_TYPE_NACK? '-' : '*');
794 bp += 1;
795 }
796
797 return;
798
799 trunc:
800 printf(" [|ack]");
801 }
802
803 /*
804 * Handle calls to the AFS file service (fs)
805 */
806
807 static void
808 fs_print(register const u_char *bp, int length)
809 {
810 int fs_op;
811 unsigned long i;
812
813 if (length <= sizeof(struct rx_header))
814 return;
815
816 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
817 goto trunc;
818 }
819
820 /*
821 * Print out the afs call we're invoking. The table used here was
822 * gleaned from fsint/afsint.xg
823 */
824
825 fs_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
826
827 printf(" fs call %s", tok2str(fs_req, "op#%d", fs_op));
828
829 /*
830 * Print out arguments to some of the AFS calls. This stuff is
831 * all from afsint.xg
832 */
833
834 bp += sizeof(struct rx_header) + 4;
835
836 /*
837 * Sigh. This is gross. Ritchie forgive me.
838 */
839
840 switch (fs_op) {
841 case 130: /* Fetch data */
842 FIDOUT();
843 printf(" offset");
844 UINTOUT();
845 printf(" length");
846 UINTOUT();
847 break;
848 case 131: /* Fetch ACL */
849 case 132: /* Fetch Status */
850 case 143: /* Old set lock */
851 case 144: /* Old extend lock */
852 case 145: /* Old release lock */
853 case 156: /* Set lock */
854 case 157: /* Extend lock */
855 case 158: /* Release lock */
856 FIDOUT();
857 break;
858 case 135: /* Store status */
859 FIDOUT();
860 STOREATTROUT();
861 break;
862 case 133: /* Store data */
863 FIDOUT();
864 STOREATTROUT();
865 printf(" offset");
866 UINTOUT();
867 printf(" length");
868 UINTOUT();
869 printf(" flen");
870 UINTOUT();
871 break;
872 case 134: /* Store ACL */
873 {
874 char a[AFSOPAQUEMAX+1];
875 FIDOUT();
876 TCHECK2(bp[0], 4);
877 i = EXTRACT_32BITS(bp);
878 bp += sizeof(int32_t);
879 TCHECK2(bp[0], i);
880 i = min(AFSOPAQUEMAX, i);
881 strncpy(a, (char *) bp, i);
882 a[i] = '\0';
883 acl_print((u_char *) a, sizeof(a), (u_char *) a + i);
884 break;
885 }
886 case 137: /* Create file */
887 case 141: /* MakeDir */
888 FIDOUT();
889 STROUT(AFSNAMEMAX);
890 STOREATTROUT();
891 break;
892 case 136: /* Remove file */
893 case 142: /* Remove directory */
894 FIDOUT();
895 STROUT(AFSNAMEMAX);
896 break;
897 case 138: /* Rename file */
898 printf(" old");
899 FIDOUT();
900 STROUT(AFSNAMEMAX);
901 printf(" new");
902 FIDOUT();
903 STROUT(AFSNAMEMAX);
904 break;
905 case 139: /* Symlink */
906 FIDOUT();
907 STROUT(AFSNAMEMAX);
908 printf(" link to");
909 STROUT(AFSNAMEMAX);
910 break;
911 case 140: /* Link */
912 FIDOUT();
913 STROUT(AFSNAMEMAX);
914 printf(" link to");
915 FIDOUT();
916 break;
917 case 148: /* Get volume info */
918 STROUT(AFSNAMEMAX);
919 break;
920 case 149: /* Get volume stats */
921 case 150: /* Set volume stats */
922 printf(" volid");
923 UINTOUT();
924 break;
925 case 154: /* New get volume info */
926 printf(" volname");
927 STROUT(AFSNAMEMAX);
928 break;
929 case 155: /* Bulk stat */
930 {
931 unsigned long j;
932 TCHECK2(bp[0], 4);
933 j = EXTRACT_32BITS(bp);
934 bp += sizeof(int32_t);
935
936 for (i = 0; i < j; i++) {
937 FIDOUT();
938 if (i != j - 1)
939 printf(",");
940 }
941 if (j == 0)
942 printf(" <none!>");
943 }
944 default:
945 ;
946 }
947
948 return;
949
950 trunc:
951 printf(" [|fs]");
952 }
953
954 /*
955 * Handle replies to the AFS file service
956 */
957
958 static void
959 fs_reply_print(register const u_char *bp, int length, int32_t opcode)
960 {
961 unsigned long i;
962 struct rx_header *rxh;
963
964 if (length <= sizeof(struct rx_header))
965 return;
966
967 rxh = (struct rx_header *) bp;
968
969 /*
970 * Print out the afs call we're invoking. The table used here was
971 * gleaned from fsint/afsint.xg
972 */
973
974 printf(" fs reply %s", tok2str(fs_req, "op#%d", opcode));
975
976 bp += sizeof(struct rx_header);
977
978 /*
979 * If it was a data packet, interpret the response
980 */
981
982 if (rxh->type == RX_PACKET_TYPE_DATA) {
983 switch (opcode) {
984 case 131: /* Fetch ACL */
985 {
986 char a[AFSOPAQUEMAX+1];
987 TCHECK2(bp[0], 4);
988 i = EXTRACT_32BITS(bp);
989 bp += sizeof(int32_t);
990 TCHECK2(bp[0], i);
991 i = min(AFSOPAQUEMAX, i);
992 strncpy(a, (char *) bp, i);
993 a[i] = '\0';
994 acl_print((u_char *) a, sizeof(a), (u_char *) a + i);
995 break;
996 }
997 case 137: /* Create file */
998 case 141: /* MakeDir */
999 printf(" new");
1000 FIDOUT();
1001 break;
1002 case 151: /* Get root volume */
1003 printf(" root volume");
1004 STROUT(AFSNAMEMAX);
1005 break;
1006 case 153: /* Get time */
1007 DATEOUT();
1008 break;
1009 default:
1010 ;
1011 }
1012 } else if (rxh->type == RX_PACKET_TYPE_ABORT) {
1013 int i;
1014
1015 /*
1016 * Otherwise, just print out the return code
1017 */
1018 TCHECK2(bp[0], sizeof(int32_t));
1019 i = (int) EXTRACT_32BITS(bp);
1020 bp += sizeof(int32_t);
1021
1022 printf(" error %s", tok2str(afs_fs_errors, "#%d", i));
1023 } else {
1024 printf(" strange fs reply of type %d", rxh->type);
1025 }
1026
1027 return;
1028
1029 trunc:
1030 printf(" [|fs]");
1031 }
1032
1033 /*
1034 * Print out an AFS ACL string. An AFS ACL is a string that has the
1035 * following format:
1036 *
1037 * <positive> <negative>
1038 * <uid1> <aclbits1>
1039 * ....
1040 *
1041 * "positive" and "negative" are integers which contain the number of
1042 * positive and negative ACL's in the string. The uid/aclbits pair are
1043 * ASCII strings containing the UID/PTS record and and a ascii number
1044 * representing a logical OR of all the ACL permission bits
1045 */
1046
1047 static void
1048 acl_print(u_char *s, int maxsize, u_char *end)
1049 {
1050 int pos, neg, acl;
1051 int n, i;
1052 char *user;
1053
1054 if ((user = (char *)malloc(maxsize)) == NULL)
1055 return;
1056
1057 if (sscanf((char *) s, "%d %d\n%n", &pos, &neg, &n) != 2)
1058 goto finish;
1059
1060 s += n;
1061
1062 if (s > end)
1063 goto finish;
1064
1065 /*
1066 * This wacky order preserves the order used by the "fs" command
1067 */
1068
1069 #define ACLOUT(acl) \
1070 if (acl & PRSFS_READ) \
1071 printf("r"); \
1072 if (acl & PRSFS_LOOKUP) \
1073 printf("l"); \
1074 if (acl & PRSFS_INSERT) \
1075 printf("i"); \
1076 if (acl & PRSFS_DELETE) \
1077 printf("d"); \
1078 if (acl & PRSFS_WRITE) \
1079 printf("w"); \
1080 if (acl & PRSFS_LOCK) \
1081 printf("k"); \
1082 if (acl & PRSFS_ADMINISTER) \
1083 printf("a");
1084
1085 for (i = 0; i < pos; i++) {
1086 if (sscanf((char *) s, "%s %d\n%n", user, &acl, &n) != 2)
1087 goto finish;
1088 s += n;
1089 printf(" +{");
1090 fn_print(user, NULL);
1091 printf(" ");
1092 ACLOUT(acl);
1093 printf("}");
1094 if (s > end)
1095 goto finish;
1096 }
1097
1098 for (i = 0; i < neg; i++) {
1099 if (sscanf((char *) s, "%s %d\n%n", user, &acl, &n) != 2)
1100 goto finish;
1101 s += n;
1102 printf(" -{");
1103 fn_print(user, NULL);
1104 printf(" ");
1105 ACLOUT(acl);
1106 printf("}");
1107 if (s > end)
1108 goto finish;
1109 }
1110
1111 finish:
1112 free(user);
1113 return;
1114 }
1115
1116 #undef ACLOUT
1117
1118 /*
1119 * Handle calls to the AFS callback service
1120 */
1121
1122 static void
1123 cb_print(register const u_char *bp, int length)
1124 {
1125 int cb_op;
1126 unsigned long i;
1127
1128 if (length <= sizeof(struct rx_header))
1129 return;
1130
1131 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1132 goto trunc;
1133 }
1134
1135 /*
1136 * Print out the afs call we're invoking. The table used here was
1137 * gleaned from fsint/afscbint.xg
1138 */
1139
1140 cb_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1141
1142 printf(" cb call %s", tok2str(cb_req, "op#%d", cb_op));
1143
1144 bp += sizeof(struct rx_header) + 4;
1145
1146 /*
1147 * Print out the afs call we're invoking. The table used here was
1148 * gleaned from fsint/afscbint.xg
1149 */
1150
1151 switch (cb_op) {
1152 case 204: /* Callback */
1153 {
1154 unsigned long j, t;
1155 TCHECK2(bp[0], 4);
1156 j = EXTRACT_32BITS(bp);
1157 bp += sizeof(int32_t);
1158
1159 for (i = 0; i < j; i++) {
1160 FIDOUT();
1161 if (i != j - 1)
1162 printf(",");
1163 }
1164
1165 if (j == 0)
1166 printf(" <none!>");
1167
1168 j = EXTRACT_32BITS(bp);
1169 bp += sizeof(int32_t);
1170
1171 if (j != 0)
1172 printf(";");
1173
1174 for (i = 0; i < j; i++) {
1175 printf(" ver");
1176 INTOUT();
1177 printf(" expires");
1178 DATEOUT();
1179 TCHECK2(bp[0], 4);
1180 t = EXTRACT_32BITS(bp);
1181 bp += sizeof(int32_t);
1182 tok2str(cb_types, "type %d", t);
1183 }
1184 }
1185 case 214: {
1186 printf(" afsuuid");
1187 AFSUUIDOUT();
1188 break;
1189 }
1190 default:
1191 ;
1192 }
1193
1194 return;
1195
1196 trunc:
1197 printf(" [|cb]");
1198 }
1199
1200 /*
1201 * Handle replies to the AFS Callback Service
1202 */
1203
1204 static void
1205 cb_reply_print(register const u_char *bp, int length, int32_t opcode)
1206 {
1207 struct rx_header *rxh;
1208
1209 if (length <= sizeof(struct rx_header))
1210 return;
1211
1212 rxh = (struct rx_header *) bp;
1213
1214 /*
1215 * Print out the afs call we're invoking. The table used here was
1216 * gleaned from fsint/afscbint.xg
1217 */
1218
1219 printf(" cb reply %s", tok2str(cb_req, "op#%d", opcode));
1220
1221 bp += sizeof(struct rx_header);
1222
1223 /*
1224 * If it was a data packet, interpret the response.
1225 */
1226
1227 if (rxh->type == RX_PACKET_TYPE_DATA)
1228 switch (opcode) {
1229 case 213: /* InitCallBackState3 */
1230 AFSUUIDOUT();
1231 break;
1232 default:
1233 ;
1234 }
1235 else {
1236 /*
1237 * Otherwise, just print out the return code
1238 */
1239 printf(" errcode");
1240 INTOUT();
1241 }
1242
1243 return;
1244
1245 trunc:
1246 printf(" [|cb]");
1247 }
1248
1249 /*
1250 * Handle calls to the AFS protection database server
1251 */
1252
1253 static void
1254 prot_print(register const u_char *bp, int length)
1255 {
1256 unsigned long i;
1257 char s[AFSNAMEMAX];
1258 int pt_op;
1259
1260 if (length <= sizeof(struct rx_header))
1261 return;
1262
1263 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1264 goto trunc;
1265 }
1266
1267 /*
1268 * Print out the afs call we're invoking. The table used here was
1269 * gleaned from ptserver/ptint.xg
1270 */
1271
1272 pt_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1273
1274 printf(" pt");
1275
1276 if (is_ubik(pt_op)) {
1277 ubik_print(bp, length);
1278 return;
1279 }
1280
1281 printf(" call %s", tok2str(pt_req, "op#%d", pt_op));
1282
1283 /*
1284 * Decode some of the arguments to the PT calls
1285 */
1286
1287 bp += sizeof(struct rx_header) + 4;
1288
1289 switch (pt_op) {
1290 case 500: /* I New User */
1291 STROUT(PRNAMEMAX);
1292 printf(" id");
1293 INTOUT();
1294 printf(" oldid");
1295 INTOUT();
1296 break;
1297 case 501: /* Where is it */
1298 case 506: /* Delete */
1299 case 508: /* Get CPS */
1300 case 512: /* List entry */
1301 case 514: /* List elements */
1302 case 517: /* List owned */
1303 case 518: /* Get CPS2 */
1304 case 519: /* Get host CPS */
1305 printf(" id");
1306 INTOUT();
1307 break;
1308 case 502: /* Dump entry */
1309 printf(" pos");
1310 INTOUT();
1311 break;
1312 case 503: /* Add to group */
1313 case 507: /* Remove from group */
1314 case 515: /* Is a member of? */
1315 printf(" uid");
1316 INTOUT();
1317 printf(" gid");
1318 INTOUT();
1319 break;
1320 case 504: /* Name to ID */
1321 {
1322 unsigned long j;
1323 TCHECK2(bp[0], 4);
1324 j = EXTRACT_32BITS(bp);
1325 bp += sizeof(int32_t);
1326
1327 /*
1328 * Who designed this chicken-shit protocol?
1329 *
1330 * Each character is stored as a 32-bit
1331 * integer!
1332 */
1333
1334 for (i = 0; i < j; i++) {
1335 VECOUT(PRNAMEMAX);
1336 }
1337 if (j == 0)
1338 printf(" <none!>");
1339 }
1340 break;
1341 case 505: /* Id to name */
1342 {
1343 unsigned long j;
1344 printf(" ids:");
1345 TCHECK2(bp[0], 4);
1346 i = EXTRACT_32BITS(bp);
1347 bp += sizeof(int32_t);
1348 for (j = 0; j < i; j++)
1349 INTOUT();
1350 if (j == 0)
1351 printf(" <none!>");
1352 }
1353 break;
1354 case 509: /* New entry */
1355 STROUT(PRNAMEMAX);
1356 printf(" flag");
1357 INTOUT();
1358 printf(" oid");
1359 INTOUT();
1360 break;
1361 case 511: /* Set max */
1362 printf(" id");
1363 INTOUT();
1364 printf(" gflag");
1365 INTOUT();
1366 break;
1367 case 513: /* Change entry */
1368 printf(" id");
1369 INTOUT();
1370 STROUT(PRNAMEMAX);
1371 printf(" oldid");
1372 INTOUT();
1373 printf(" newid");
1374 INTOUT();
1375 break;
1376 case 520: /* Update entry */
1377 printf(" id");
1378 INTOUT();
1379 STROUT(PRNAMEMAX);
1380 break;
1381 default:
1382 ;
1383 }
1384
1385
1386 return;
1387
1388 trunc:
1389 printf(" [|pt]");
1390 }
1391
1392 /*
1393 * Handle replies to the AFS protection service
1394 */
1395
1396 static void
1397 prot_reply_print(register const u_char *bp, int length, int32_t opcode)
1398 {
1399 struct rx_header *rxh;
1400 unsigned long i;
1401 char s[AFSNAMEMAX];
1402
1403 if (length < sizeof(struct rx_header))
1404 return;
1405
1406 rxh = (struct rx_header *) bp;
1407
1408 /*
1409 * Print out the afs call we're invoking. The table used here was
1410 * gleaned from ptserver/ptint.xg. Check to see if it's a
1411 * Ubik call, however.
1412 */
1413
1414 printf(" pt");
1415
1416 if (is_ubik(opcode)) {
1417 ubik_reply_print(bp, length, opcode);
1418 return;
1419 }
1420
1421 printf(" reply %s", tok2str(pt_req, "op#%d", opcode));
1422
1423 bp += sizeof(struct rx_header);
1424
1425 /*
1426 * If it was a data packet, interpret the response
1427 */
1428
1429 if (rxh->type == RX_PACKET_TYPE_DATA)
1430 switch (opcode) {
1431 case 504: /* Name to ID */
1432 {
1433 unsigned long j;
1434 printf(" ids:");
1435 TCHECK2(bp[0], 4);
1436 i = EXTRACT_32BITS(bp);
1437 bp += sizeof(int32_t);
1438 for (j = 0; j < i; j++)
1439 INTOUT();
1440 if (j == 0)
1441 printf(" <none!>");
1442 }
1443 break;
1444 case 505: /* ID to name */
1445 {
1446 unsigned long j;
1447 TCHECK2(bp[0], 4);
1448 j = EXTRACT_32BITS(bp);
1449 bp += sizeof(int32_t);
1450
1451 /*
1452 * Who designed this chicken-shit protocol?
1453 *
1454 * Each character is stored as a 32-bit
1455 * integer!
1456 */
1457
1458 for (i = 0; i < j; i++) {
1459 VECOUT(PRNAMEMAX);
1460 }
1461 if (j == 0)
1462 printf(" <none!>");
1463 }
1464 break;
1465 case 508: /* Get CPS */
1466 case 514: /* List elements */
1467 case 517: /* List owned */
1468 case 518: /* Get CPS2 */
1469 case 519: /* Get host CPS */
1470 {
1471 unsigned long j;
1472 TCHECK2(bp[0], 4);
1473 j = EXTRACT_32BITS(bp);
1474 bp += sizeof(int32_t);
1475 for (i = 0; i < j; i++) {
1476 INTOUT();
1477 }
1478 if (j == 0)
1479 printf(" <none!>");
1480 }
1481 break;
1482 case 510: /* List max */
1483 printf(" maxuid");
1484 INTOUT();
1485 printf(" maxgid");
1486 INTOUT();
1487 break;
1488 default:
1489 ;
1490 }
1491 else {
1492 /*
1493 * Otherwise, just print out the return code
1494 */
1495 printf(" errcode");
1496 INTOUT();
1497 }
1498
1499 return;
1500
1501 trunc:
1502 printf(" [|pt]");
1503 }
1504
1505 /*
1506 * Handle calls to the AFS volume location database service
1507 */
1508
1509 static void
1510 vldb_print(register const u_char *bp, int length)
1511 {
1512 int vldb_op;
1513 unsigned long i;
1514 char s[AFSNAMEMAX];
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 char s[AFSNAMEMAX];
1609
1610 if (length < sizeof(struct rx_header))
1611 return;
1612
1613 rxh = (struct rx_header *) bp;
1614
1615 /*
1616 * Print out the afs call we're invoking. The table used here was
1617 * gleaned from vlserver/vldbint.xg. Check to see if it's a
1618 * Ubik call, however.
1619 */
1620
1621 printf(" vldb");
1622
1623 if (is_ubik(opcode)) {
1624 ubik_reply_print(bp, length, opcode);
1625 return;
1626 }
1627
1628 printf(" reply %s", tok2str(vldb_req, "op#%d", opcode));
1629
1630 bp += sizeof(struct rx_header);
1631
1632 /*
1633 * If it was a data packet, interpret the response
1634 */
1635
1636 if (rxh->type == RX_PACKET_TYPE_DATA)
1637 switch (opcode) {
1638 case 510: /* List entry */
1639 printf(" count");
1640 INTOUT();
1641 printf(" nextindex");
1642 INTOUT();
1643 case 503: /* Get entry by id */
1644 case 504: /* Get entry by name */
1645 { unsigned long nservers, j;
1646 VECOUT(VLNAMEMAX);
1647 TCHECK2(bp[0], sizeof(int32_t));
1648 bp += sizeof(int32_t);
1649 printf(" numservers");
1650 TCHECK2(bp[0], sizeof(int32_t));
1651 nservers = EXTRACT_32BITS(bp);
1652 bp += sizeof(int32_t);
1653 printf(" %lu", nservers);
1654 printf(" servers");
1655 for (i = 0; i < 8; i++) {
1656 TCHECK2(bp[0], sizeof(int32_t));
1657 if (i < nservers)
1658 printf(" %s",
1659 inet_ntoa(*((struct in_addr *) bp)));
1660 bp += sizeof(int32_t);
1661 }
1662 printf(" partitions");
1663 for (i = 0; i < 8; i++) {
1664 TCHECK2(bp[0], sizeof(int32_t));
1665 j = EXTRACT_32BITS(bp);
1666 if (i < nservers && j <= 26)
1667 printf(" %c", 'a' + (int)j);
1668 else if (i < nservers)
1669 printf(" %lu", j);
1670 bp += sizeof(int32_t);
1671 }
1672 TCHECK2(bp[0], 8 * sizeof(int32_t));
1673 bp += 8 * sizeof(int32_t);
1674 printf(" rwvol");
1675 UINTOUT();
1676 printf(" rovol");
1677 UINTOUT();
1678 printf(" backup");
1679 UINTOUT();
1680 }
1681 break;
1682 case 505: /* Get new volume ID */
1683 printf(" newvol");
1684 UINTOUT();
1685 break;
1686 case 521: /* List entry */
1687 case 529: /* List entry U */
1688 printf(" count");
1689 INTOUT();
1690 printf(" nextindex");
1691 INTOUT();
1692 case 518: /* Get entry by ID N */
1693 case 519: /* Get entry by name N */
1694 { unsigned long nservers, j;
1695 VECOUT(VLNAMEMAX);
1696 printf(" numservers");
1697 TCHECK2(bp[0], sizeof(int32_t));
1698 nservers = EXTRACT_32BITS(bp);
1699 bp += sizeof(int32_t);
1700 printf(" %lu", nservers);
1701 printf(" servers");
1702 for (i = 0; i < 13; i++) {
1703 TCHECK2(bp[0], sizeof(int32_t));
1704 if (i < nservers)
1705 printf(" %s",
1706 inet_ntoa(*((struct in_addr *) bp)));
1707 bp += sizeof(int32_t);
1708 }
1709 printf(" partitions");
1710 for (i = 0; i < 13; i++) {
1711 TCHECK2(bp[0], sizeof(int32_t));
1712 j = EXTRACT_32BITS(bp);
1713 if (i < nservers && j <= 26)
1714 printf(" %c", 'a' + (int)j);
1715 else if (i < nservers)
1716 printf(" %lu", j);
1717 bp += sizeof(int32_t);
1718 }
1719 TCHECK2(bp[0], 13 * sizeof(int32_t));
1720 bp += 13 * sizeof(int32_t);
1721 printf(" rwvol");
1722 UINTOUT();
1723 printf(" rovol");
1724 UINTOUT();
1725 printf(" backup");
1726 UINTOUT();
1727 }
1728 break;
1729 case 526: /* Get entry by ID U */
1730 case 527: /* Get entry by name U */
1731 { unsigned long nservers, j;
1732 VECOUT(VLNAMEMAX);
1733 printf(" numservers");
1734 TCHECK2(bp[0], sizeof(int32_t));
1735 nservers = EXTRACT_32BITS(bp);
1736 bp += sizeof(int32_t);
1737 printf(" %lu", nservers);
1738 printf(" servers");
1739 for (i = 0; i < 13; i++) {
1740 if (i < nservers) {
1741 printf(" afsuuid");
1742 AFSUUIDOUT();
1743 } else {
1744 TCHECK2(bp[0], 44);
1745 bp += 44;
1746 }
1747 }
1748 TCHECK2(bp[0], 4 * 13);
1749 bp += 4 * 13;
1750 printf(" partitions");
1751 for (i = 0; i < 13; i++) {
1752 TCHECK2(bp[0], sizeof(int32_t));
1753 j = EXTRACT_32BITS(bp);
1754 if (i < nservers && j <= 26)
1755 printf(" %c", 'a' + (int)j);
1756 else if (i < nservers)
1757 printf(" %lu", j);
1758 bp += sizeof(int32_t);
1759 }
1760 TCHECK2(bp[0], 13 * sizeof(int32_t));
1761 bp += 13 * sizeof(int32_t);
1762 printf(" rwvol");
1763 UINTOUT();
1764 printf(" rovol");
1765 UINTOUT();
1766 printf(" backup");
1767 UINTOUT();
1768 }
1769 default:
1770 ;
1771 }
1772
1773 else {
1774 /*
1775 * Otherwise, just print out the return code
1776 */
1777 printf(" errcode");
1778 INTOUT();
1779 }
1780
1781 return;
1782
1783 trunc:
1784 printf(" [|vldb]");
1785 }
1786
1787 /*
1788 * Handle calls to the AFS Kerberos Authentication service
1789 */
1790
1791 static void
1792 kauth_print(register const u_char *bp, int length)
1793 {
1794 int kauth_op;
1795
1796 if (length <= sizeof(struct rx_header))
1797 return;
1798
1799 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1800 goto trunc;
1801 }
1802
1803 /*
1804 * Print out the afs call we're invoking. The table used here was
1805 * gleaned from kauth/kauth.rg
1806 */
1807
1808 kauth_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1809
1810 printf(" kauth");
1811
1812 if (is_ubik(kauth_op)) {
1813 ubik_print(bp, length);
1814 return;
1815 }
1816
1817
1818 printf(" call %s", tok2str(kauth_req, "op#%d", kauth_op));
1819
1820 /*
1821 * Decode some of the arguments to the KA calls
1822 */
1823
1824 bp += sizeof(struct rx_header) + 4;
1825
1826 switch (kauth_op) {
1827 case 1: /* Authenticate old */;
1828 case 21: /* Authenticate */
1829 case 22: /* Authenticate-V2 */
1830 case 2: /* Change PW */
1831 case 5: /* Set fields */
1832 case 6: /* Create user */
1833 case 7: /* Delete user */
1834 case 8: /* Get entry */
1835 case 14: /* Unlock */
1836 case 15: /* Lock status */
1837 printf(" principal");
1838 STROUT(KANAMEMAX);
1839 STROUT(KANAMEMAX);
1840 break;
1841 case 3: /* GetTicket-old */
1842 case 23: /* GetTicket */
1843 {
1844 int i;
1845 printf(" kvno");
1846 INTOUT();
1847 printf(" domain");
1848 STROUT(KANAMEMAX);
1849 TCHECK2(bp[0], sizeof(int32_t));
1850 i = (int) EXTRACT_32BITS(bp);
1851 bp += sizeof(int32_t);
1852 TCHECK2(bp[0], i);
1853 bp += i;
1854 printf(" principal");
1855 STROUT(KANAMEMAX);
1856 STROUT(KANAMEMAX);
1857 break;
1858 }
1859 case 4: /* Set Password */
1860 printf(" principal");
1861 STROUT(KANAMEMAX);
1862 STROUT(KANAMEMAX);
1863 printf(" kvno");
1864 INTOUT();
1865 break;
1866 case 12: /* Get password */
1867 printf(" name");
1868 STROUT(KANAMEMAX);
1869 break;
1870 default:
1871 ;
1872 }
1873
1874 return;
1875
1876 trunc:
1877 printf(" [|kauth]");
1878 }
1879
1880 /*
1881 * Handle replies to the AFS Kerberos Authentication Service
1882 */
1883
1884 static void
1885 kauth_reply_print(register const u_char *bp, int length, int32_t opcode)
1886 {
1887 struct rx_header *rxh;
1888
1889 if (length <= sizeof(struct rx_header))
1890 return;
1891
1892 rxh = (struct rx_header *) bp;
1893
1894 /*
1895 * Print out the afs call we're invoking. The table used here was
1896 * gleaned from kauth/kauth.rg
1897 */
1898
1899 printf(" kauth");
1900
1901 if (is_ubik(opcode)) {
1902 ubik_reply_print(bp, length, opcode);
1903 return;
1904 }
1905
1906 printf(" reply %s", tok2str(kauth_req, "op#%d", opcode));
1907
1908 bp += sizeof(struct rx_header);
1909
1910 /*
1911 * If it was a data packet, interpret the response.
1912 */
1913
1914 if (rxh->type == RX_PACKET_TYPE_DATA)
1915 /* Well, no, not really. Leave this for later */
1916 ;
1917 else {
1918 /*
1919 * Otherwise, just print out the return code
1920 */
1921 printf(" errcode");
1922 INTOUT();
1923 }
1924
1925 return;
1926
1927 trunc:
1928 printf(" [|kauth]");
1929 }
1930
1931 /*
1932 * Handle calls to the AFS Volume location service
1933 */
1934
1935 static void
1936 vol_print(register const u_char *bp, int length)
1937 {
1938 int vol_op;
1939
1940 if (length <= sizeof(struct rx_header))
1941 return;
1942
1943 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
1944 goto trunc;
1945 }
1946
1947 /*
1948 * Print out the afs call we're invoking. The table used here was
1949 * gleaned from volser/volint.xg
1950 */
1951
1952 vol_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
1953
1954 printf(" vol call %s", tok2str(vol_req, "op#%d", vol_op));
1955
1956 /*
1957 * Normally there would be a switch statement here to decode the
1958 * arguments to the AFS call, but since I don't have access to
1959 * an AFS server (yet) and I'm not an AFS admin, I can't
1960 * test any of these calls. Leave this blank for now.
1961 */
1962
1963 return;
1964
1965 trunc:
1966 printf(" [|vol]");
1967 }
1968
1969 /*
1970 * Handle replies to the AFS Volume Service
1971 */
1972
1973 static void
1974 vol_reply_print(register const u_char *bp, int length, int32_t opcode)
1975 {
1976 struct rx_header *rxh;
1977
1978 if (length <= sizeof(struct rx_header))
1979 return;
1980
1981 rxh = (struct rx_header *) bp;
1982
1983 /*
1984 * Print out the afs call we're invoking. The table used here was
1985 * gleaned from volser/volint.xg
1986 */
1987
1988 printf(" vol reply %s", tok2str(vol_req, "op#%d", opcode));
1989
1990 bp += sizeof(struct rx_header);
1991
1992 /*
1993 * If it was a data packet, interpret the response.
1994 */
1995
1996 if (rxh->type == RX_PACKET_TYPE_DATA)
1997 /* Well, no, not really. Leave this for later */
1998 ;
1999 else {
2000 /*
2001 * Otherwise, just print out the return code
2002 */
2003 printf(" errcode");
2004 INTOUT();
2005 }
2006
2007 return;
2008
2009 trunc:
2010 printf(" [|vol]");
2011 }
2012
2013 /*
2014 * Handle calls to the AFS BOS service
2015 */
2016
2017 static void
2018 bos_print(register const u_char *bp, int length)
2019 {
2020 int bos_op;
2021
2022 if (length <= sizeof(struct rx_header))
2023 return;
2024
2025 if (snapend - bp + 1 <= sizeof(struct rx_header) + sizeof(int32_t)) {
2026 goto trunc;
2027 }
2028
2029 /*
2030 * Print out the afs call we're invoking. The table used here was
2031 * gleaned from bozo/bosint.xg
2032 */
2033
2034 bos_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
2035
2036 printf(" bos call %s", tok2str(bos_req, "op#%d", bos_op));
2037
2038 /*
2039 * Decode some of the arguments to the BOS calls
2040 */
2041
2042 bp += sizeof(struct rx_header) + 4;
2043
2044 switch (bos_op) {
2045 case 80: /* Create B node */
2046 printf(" type");
2047 STROUT(BOSNAMEMAX);
2048 printf(" instance");
2049 STROUT(BOSNAMEMAX);
2050 break;
2051 case 81: /* Delete B node */
2052 case 83: /* Get status */
2053 case 85: /* Get instance info */
2054 case 87: /* Add super user */
2055 case 88: /* Delete super user */
2056 case 93: /* Set cell name */
2057 case 96: /* Add cell host */
2058 case 97: /* Delete cell host */
2059 case 104: /* Restart */
2060 case 106: /* Uninstall */
2061 case 108: /* Exec */
2062 case 112: /* Getlog */
2063 case 114: /* Get instance strings */
2064 STROUT(BOSNAMEMAX);
2065 break;
2066 case 82: /* Set status */
2067 case 98: /* Set T status */
2068 STROUT(BOSNAMEMAX);
2069 printf(" status");
2070 INTOUT();
2071 break;
2072 case 86: /* Get instance parm */
2073 STROUT(BOSNAMEMAX);
2074 printf(" num");
2075 INTOUT();
2076 break;
2077 case 84: /* Enumerate instance */
2078 case 89: /* List super users */
2079 case 90: /* List keys */
2080 case 91: /* Add key */
2081 case 92: /* Delete key */
2082 case 95: /* Get cell host */
2083 INTOUT();
2084 break;
2085 case 105: /* Install */
2086 STROUT(BOSNAMEMAX);
2087 printf(" size");
2088 INTOUT();
2089 printf(" flags");
2090 INTOUT();
2091 printf(" date");
2092 INTOUT();
2093 break;
2094 default:
2095 ;
2096 }
2097
2098 return;
2099
2100 trunc:
2101 printf(" [|bos]");
2102 }
2103
2104 /*
2105 * Handle replies to the AFS BOS Service
2106 */
2107
2108 static void
2109 bos_reply_print(register const u_char *bp, int length, int32_t opcode)
2110 {
2111 struct rx_header *rxh;
2112
2113 if (length <= sizeof(struct rx_header))
2114 return;
2115
2116 rxh = (struct rx_header *) bp;
2117
2118 /*
2119 * Print out the afs call we're invoking. The table used here was
2120 * gleaned from volser/volint.xg
2121 */
2122
2123 printf(" bos reply %s", tok2str(bos_req, "op#%d", opcode));
2124
2125 bp += sizeof(struct rx_header);
2126
2127 /*
2128 * If it was a data packet, interpret the response.
2129 */
2130
2131 if (rxh->type == RX_PACKET_TYPE_DATA)
2132 /* Well, no, not really. Leave this for later */
2133 ;
2134 else {
2135 /*
2136 * Otherwise, just print out the return code
2137 */
2138 printf(" errcode");
2139 INTOUT();
2140 }
2141
2142 return;
2143
2144 trunc:
2145 printf(" [|bos]");
2146 }
2147
2148 /*
2149 * Check to see if this is a Ubik opcode.
2150 */
2151
2152 static int
2153 is_ubik(u_int32_t opcode)
2154 {
2155 if ((opcode >= VOTE_LOW && opcode <= VOTE_HIGH) ||
2156 (opcode >= DISK_LOW && opcode <= DISK_HIGH))
2157 return(1);
2158 else
2159 return(0);
2160 }
2161
2162 /*
2163 * Handle Ubik opcodes to any one of the replicated database services
2164 */
2165
2166 static void
2167 ubik_print(register const u_char *bp, int length)
2168 {
2169 int ubik_op;
2170 int32_t temp;
2171
2172 /*
2173 * Print out the afs call we're invoking. The table used here was
2174 * gleaned from ubik/ubik_int.xg
2175 */
2176
2177 ubik_op = EXTRACT_32BITS(bp + sizeof(struct rx_header));
2178
2179 printf(" ubik call %s", tok2str(ubik_req, "op#%d", ubik_op));
2180
2181 /*
2182 * Decode some of the arguments to the Ubik calls
2183 */
2184
2185 bp += sizeof(struct rx_header) + 4;
2186
2187 switch (ubik_op) {
2188 case 10000: /* Beacon */
2189 TCHECK2(bp[0], 4);
2190 temp = EXTRACT_32BITS(bp);
2191 bp += sizeof(int32_t);
2192 printf(" syncsite %s", temp ? "yes" : "no");
2193 printf(" votestart");
2194 DATEOUT();
2195 printf(" dbversion");
2196 UBIK_VERSIONOUT();
2197 printf(" tid");
2198 UBIK_VERSIONOUT();
2199 break;
2200 case 10003: /* Get sync site */
2201 printf(" site");
2202 UINTOUT();
2203 break;
2204 case 20000: /* Begin */
2205 case 20001: /* Commit */
2206 case 20007: /* Abort */
2207 case 20008: /* Release locks */
2208 case 20010: /* Writev */
2209 printf(" tid");
2210 UBIK_VERSIONOUT();
2211 break;
2212 case 20002: /* Lock */
2213 printf(" tid");
2214 UBIK_VERSIONOUT();
2215 printf(" file");
2216 INTOUT();
2217 printf(" pos");
2218 INTOUT();
2219 printf(" length");
2220 INTOUT();
2221 temp = EXTRACT_32BITS(bp);
2222 bp += sizeof(int32_t);
2223 tok2str(ubik_lock_types, "type %d", temp);
2224 break;
2225 case 20003: /* Write */
2226 printf(" tid");
2227 UBIK_VERSIONOUT();
2228 printf(" file");
2229 INTOUT();
2230 printf(" pos");
2231 INTOUT();
2232 break;
2233 case 20005: /* Get file */
2234 printf(" file");
2235 INTOUT();
2236 break;
2237 case 20006: /* Send file */
2238 printf(" file");
2239 INTOUT();
2240 printf(" length");
2241 INTOUT();
2242 printf(" dbversion");
2243 UBIK_VERSIONOUT();
2244 break;
2245 case 20009: /* Truncate */
2246 printf(" tid");
2247 UBIK_VERSIONOUT();
2248 printf(" file");
2249 INTOUT();
2250 printf(" length");
2251 INTOUT();
2252 break;
2253 case 20012: /* Set version */
2254 printf(" tid");
2255 UBIK_VERSIONOUT();
2256 printf(" oldversion");
2257 UBIK_VERSIONOUT();
2258 printf(" newversion");
2259 UBIK_VERSIONOUT();
2260 break;
2261 default:
2262 ;
2263 }
2264
2265 return;
2266
2267 trunc:
2268 printf(" [|ubik]");
2269 }
2270
2271 /*
2272 * Handle Ubik replies to any one of the replicated database services
2273 */
2274
2275 static void
2276 ubik_reply_print(register const u_char *bp, int length, int32_t opcode)
2277 {
2278 struct rx_header *rxh;
2279
2280 if (length < sizeof(struct rx_header))
2281 return;
2282
2283 rxh = (struct rx_header *) bp;
2284
2285 /*
2286 * Print out the ubik call we're invoking. This table was gleaned
2287 * from ubik/ubik_int.xg
2288 */
2289
2290 printf(" ubik reply %s", tok2str(ubik_req, "op#%d", opcode));
2291
2292 bp += sizeof(struct rx_header);
2293
2294 /*
2295 * If it was a data packet, print out the arguments to the Ubik calls
2296 */
2297
2298 if (rxh->type == RX_PACKET_TYPE_DATA)
2299 switch (opcode) {
2300 case 10000: /* Beacon */
2301 printf(" vote no");
2302 break;
2303 case 20004: /* Get version */
2304 printf(" dbversion");
2305 UBIK_VERSIONOUT();
2306 break;
2307 default:
2308 ;
2309 }
2310
2311 /*
2312 * Otherwise, print out "yes" it it was a beacon packet (because
2313 * that's how yes votes are returned, go figure), otherwise
2314 * just print out the error code.
2315 */
2316
2317 else
2318 switch (opcode) {
2319 case 10000: /* Beacon */
2320 printf(" vote yes until");
2321 DATEOUT();
2322 break;
2323 default:
2324 printf(" errcode");
2325 INTOUT();
2326 }
2327
2328 return;
2329
2330 trunc:
2331 printf(" [|ubik]");
2332 }
2333
2334 /*
2335 * Handle RX ACK packets.
2336 */
2337
2338 static void
2339 rx_ack_print(register const u_char *bp, int length)
2340 {
2341 struct rx_ackPacket *rxa;
2342 int i, start, last;
2343
2344 if (length < sizeof(struct rx_header))
2345 return;
2346
2347 bp += sizeof(struct rx_header);
2348
2349 /*
2350 * This may seem a little odd .... the rx_ackPacket structure
2351 * contains an array of individual packet acknowledgements
2352 * (used for selective ack/nack), but since it's variable in size,
2353 * we don't want to truncate based on the size of the whole
2354 * rx_ackPacket structure.
2355 */
2356
2357 TCHECK2(bp[0], sizeof(struct rx_ackPacket) - RX_MAXACKS);
2358
2359 rxa = (struct rx_ackPacket *) bp;
2360 bp += (sizeof(struct rx_ackPacket) - RX_MAXACKS);
2361
2362 /*
2363 * Print out a few useful things from the ack packet structure
2364 */
2365
2366 if (vflag > 2)
2367 printf(" bufspace %d maxskew %d",
2368 (int) EXTRACT_16BITS(&rxa->bufferSpace),
2369 (int) EXTRACT_16BITS(&rxa->maxSkew));
2370
2371 printf(" first %d serial %d reason %s",
2372 EXTRACT_32BITS(&rxa->firstPacket), EXTRACT_32BITS(&rxa->serial),
2373 tok2str(rx_ack_reasons, "#%d", (int) rxa->reason));
2374
2375 /*
2376 * Okay, now we print out the ack array. The way _this_ works
2377 * is that we start at "first", and step through the ack array.
2378 * If we have a contiguous range of acks/nacks, try to
2379 * collapse them into a range.
2380 *
2381 * If you're really clever, you might have noticed that this
2382 * doesn't seem quite correct. Specifically, due to structure
2383 * padding, sizeof(struct rx_ackPacket) - RX_MAXACKS won't actually
2384 * yield the start of the ack array (because RX_MAXACKS is 255
2385 * and the structure will likely get padded to a 2 or 4 byte
2386 * boundary). However, this is the way it's implemented inside
2387 * of AFS - the start of the extra fields are at
2388 * sizeof(struct rx_ackPacket) - RX_MAXACKS + nAcks, which _isn't_
2389 * the exact start of the ack array. Sigh. That's why we aren't
2390 * using bp, but instead use rxa->acks[]. But nAcks gets added
2391 * to bp after this, so bp ends up at the right spot. Go figure.
2392 */
2393
2394 if (rxa->nAcks != 0) {
2395
2396 TCHECK2(bp[0], rxa->nAcks);
2397
2398 /*
2399 * Sigh, this is gross, but it seems to work to collapse
2400 * ranges correctly.
2401 */
2402
2403 for (i = 0, start = last = -2; i < rxa->nAcks; i++)
2404 if (rxa->acks[i] == RX_ACK_TYPE_ACK) {
2405
2406 /*
2407 * I figured this deserved _some_ explanation.
2408 * First, print "acked" and the packet seq
2409 * number if this is the first time we've
2410 * seen an acked packet.
2411 */
2412
2413 if (last == -2) {
2414 printf(" acked %d",
2415 rxa->firstPacket + i);
2416 start = i;
2417 }
2418
2419 /*
2420 * Otherwise, if the there is a skip in
2421 * the range (such as an nacked packet in
2422 * the middle of some acked packets),
2423 * then print the current packet number
2424 * seperated from the last number by
2425 * a comma.
2426 */
2427
2428 else if (last != i - 1) {
2429 printf(",%d", rxa->firstPacket + i);
2430 start = i;
2431 }
2432
2433 /*
2434 * We always set last to the value of
2435 * the last ack we saw. Conversely, start
2436 * is set to the value of the first ack
2437 * we saw in a range.
2438 */
2439
2440 last = i;
2441
2442 /*
2443 * Okay, this bit a code gets executed when
2444 * we hit a nack ... in _this_ case we
2445 * want to print out the range of packets
2446 * that were acked, so we need to print
2447 * the _previous_ packet number seperated
2448 * from the first by a dash (-). Since we
2449 * already printed the first packet above,
2450 * just print the final packet. Don't
2451 * do this if there will be a single-length
2452 * range.
2453 */
2454 } else if (last == i - 1 && start != last)
2455 printf("-%d", rxa->firstPacket + i - 1);
2456
2457 /*
2458 * So, what's going on here? We ran off the end of the
2459 * ack list, and if we got a range we need to finish it up.
2460 * So we need to determine if the last packet in the list
2461 * was an ack (if so, then last will be set to it) and
2462 * we need to see if the last range didn't start with the
2463 * last packet (because if it _did_, then that would mean
2464 * that the packet number has already been printed and
2465 * we don't need to print it again).
2466 */
2467
2468 if (last == i - 1 && start != last)
2469 printf("-%d", rxa->firstPacket + i - 1);
2470
2471 /*
2472 * Same as above, just without comments
2473 */
2474
2475 for (i = 0, start = last = -2; i < rxa->nAcks; i++)
2476 if (rxa->acks[i] == RX_ACK_TYPE_NACK) {
2477 if (last == -2) {
2478 printf(" nacked %d",
2479 rxa->firstPacket + i);
2480 start = i;
2481 } else if (last != i - 1) {
2482 printf(",%d", rxa->firstPacket + i);
2483 start = i;
2484 }
2485 last = i;
2486 } else if (last == i - 1 && start != last)
2487 printf("-%d", rxa->firstPacket + i - 1);
2488
2489 if (last == i - 1 && start != last)
2490 printf("-%d", rxa->firstPacket + i - 1);
2491
2492 bp += rxa->nAcks;
2493 }
2494
2495
2496 /*
2497 * These are optional fields; depending on your version of AFS,
2498 * you may or may not see them
2499 */
2500
2501 #define TRUNCRET(n) if (snapend - bp + 1 <= n) return;
2502
2503 if (vflag > 1) {
2504 TRUNCRET(4);
2505 printf(" ifmtu");
2506 INTOUT();
2507
2508 TRUNCRET(4);
2509 printf(" maxmtu");
2510 INTOUT();
2511
2512 TRUNCRET(4);
2513 printf(" rwind");
2514 INTOUT();
2515
2516 TRUNCRET(4);
2517 printf(" maxpackets");
2518 INTOUT();
2519 }
2520
2521 return;
2522
2523 trunc:
2524 printf(" [|ack]");
2525 }
2526 #undef TRUNCRET
[mirror] the TCPdump network dissector