Bug Summary

File:rx/rx.c
Location:line 7493, column 2
Description:Value stored to 'code' is never read

Annotated Source Code

1/*
2 * Copyright 2000, International Business Machines Corporation and others.
3 * All Rights Reserved.
4 *
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
8 */
9
10/* RX: Extended Remote Procedure Call */
11
12#include <afsconfig.h>
13#include <afs/param.h>
14
15#ifdef KERNEL
16# include "afs/sysincludes.h"
17# include "afsincludes.h"
18# ifndef UKERNEL
19# include "h/types.h"
20# include "h/time.h"
21# include "h/stat.h"
22# ifdef AFS_LINUX20_ENV
23# include "h/socket.h"
24# endif
25# include "netinet/in.h"
26# ifdef AFS_SUN5_ENV
27# include "netinet/ip6.h"
28# include "inet/common.h"
29# include "inet/ip.h"
30# include "inet/ip_ire.h"
31# endif
32# include "afs/afs_args.h"
33# include "afs/afs_osi.h"
34# ifdef RX_KERNEL_TRACE
35# include "rx_kcommon.h"
36# endif
37# if defined(AFS_AIX_ENV)
38# include "h/systm.h"
39# endif
40# ifdef RXDEBUG1
41# undef RXDEBUG1 /* turn off debugging */
42# endif /* RXDEBUG */
43# if defined(AFS_SGI_ENV)
44# include "sys/debug.h"
45# endif
46# else /* !UKERNEL */
47# include "afs/sysincludes.h"
48# include "afsincludes.h"
49# endif /* !UKERNEL */
50# include "afs/lock.h"
51# include "rx_kmutex.h"
52# include "rx_kernel.h"
53# define AFSOP_STOP_RXCALLBACK 210 /* Stop CALLBACK process */
54# define AFSOP_STOP_AFS 211 /* Stop AFS process */
55# define AFSOP_STOP_BKG 212 /* Stop BKG process */
56extern afs_int32 afs_termState;
57# ifdef AFS_AIX41_ENV
58# include "sys/lockl.h"
59# include "sys/lock_def.h"
60# endif /* AFS_AIX41_ENV */
61# include "afs/rxgen_consts.h"
62#else /* KERNEL */
63# include <roken.h>
64
65# ifdef AFS_NT40_ENV
66# include <afs/afsutil.h>
67# include <WINNT\afsreg.h>
68# endif
69
70# include "rx_user.h"
71#endif /* KERNEL */
72
73#include "rx.h"
74#include "rx_clock.h"
75#include "rx_queue.h"
76#include "rx_atomic.h"
77#include "rx_globals.h"
78#include "rx_trace.h"
79#include "rx_internal.h"
80#include "rx_stats.h"
81
82#include <afs/rxgen_consts.h>
83
84#ifndef KERNEL
85#ifdef AFS_PTHREAD_ENV
86#ifndef AFS_NT40_ENV
87int (*registerProgram) (pid_t, char *) = 0;
88int (*swapNameProgram) (pid_t, const char *, char *) = 0;
89#endif
90#else
91int (*registerProgram) (PROCESS, char *) = 0;
92int (*swapNameProgram) (PROCESS, const char *, char *) = 0;
93#endif
94#endif
95
96/* Local static routines */
97static void rxi_DestroyConnectionNoLock(struct rx_connection *conn);
98static void rxi_ComputeRoundTripTime(struct rx_packet *, struct rx_ackPacket *,
99 struct rx_call *, struct rx_peer *,
100 struct clock *);
101static void rxi_Resend(struct rxevent *event, void *arg0, void *arg1,
102 int istack);
103
104#ifdef RX_ENABLE_LOCKS
105static void rxi_SetAcksInTransmitQueue(struct rx_call *call);
106#endif
107
108#ifdef AFS_GLOBAL_RXLOCK_KERNEL
109struct rx_tq_debug {
110 rx_atomic_t rxi_start_aborted; /* rxi_start awoke after rxi_Send in error.*/
111 rx_atomic_t rxi_start_in_error;
112} rx_tq_debug;
113#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
114
115/* Constant delay time before sending an acknowledge of the last packet
116 * received. This is to avoid sending an extra acknowledge when the
117 * client is about to make another call, anyway, or the server is
118 * about to respond.
119 *
120 * The lastAckDelay may not exceeed 400ms without causing peers to
121 * unecessarily timeout.
122 */
123struct clock rx_lastAckDelay = {0, 400000};
124
125/* Constant delay time before sending a soft ack when none was requested.
126 * This is to make sure we send soft acks before the sender times out,
127 * Normally we wait and send a hard ack when the receiver consumes the packet
128 *
129 * This value has been 100ms in all shipping versions of OpenAFS. Changing it
130 * will require changes to the peer's RTT calculations.
131 */
132struct clock rx_softAckDelay = {0, 100000};
133
134/*
135 * rxi_rpc_peer_stat_cnt counts the total number of peer stat structures
136 * currently allocated within rx. This number is used to allocate the
137 * memory required to return the statistics when queried.
138 * Protected by the rx_rpc_stats mutex.
139 */
140
141static unsigned int rxi_rpc_peer_stat_cnt;
142
143/*
144 * rxi_rpc_process_stat_cnt counts the total number of local process stat
145 * structures currently allocated within rx. The number is used to allocate
146 * the memory required to return the statistics when queried.
147 * Protected by the rx_rpc_stats mutex.
148 */
149
150static unsigned int rxi_rpc_process_stat_cnt;
151
152/*
153 * rxi_busyChannelError is the error to return to the application when a call
154 * channel appears busy (inferred from the receipt of RX_PACKET_TYPE_BUSY
155 * packets on the channel), and there are other call channels in the
156 * connection that are not busy. If 0, we do not return errors upon receiving
157 * busy packets; we just keep trying on the same call channel until we hit a
158 * timeout.
159 */
160static afs_int32 rxi_busyChannelError = 0;
161
162rx_atomic_t rx_nWaiting = RX_ATOMIC_INIT(0){ (0) };
163rx_atomic_t rx_nWaited = RX_ATOMIC_INIT(0){ (0) };
164
165#if !defined(offsetof)
166#include <stddef.h> /* for definition of offsetof() */
167#endif
168
169#ifdef RX_ENABLE_LOCKS
170afs_kmutex_t rx_atomic_mutex;
171#endif
172
173/* Forward prototypes */
174static struct rx_call * rxi_NewCall(struct rx_connection *, int);
175
176#ifdef AFS_PTHREAD_ENV
177
178/*
179 * Use procedural initialization of mutexes/condition variables
180 * to ease NT porting
181 */
182
183extern afs_kmutex_t rx_quota_mutex;
184extern afs_kmutex_t rx_pthread_mutex;
185extern afs_kmutex_t rx_packets_mutex;
186extern afs_kmutex_t rx_refcnt_mutex;
187extern afs_kmutex_t des_init_mutex;
188extern afs_kmutex_t des_random_mutex;
189extern afs_kmutex_t rx_clock_mutex;
190extern afs_kmutex_t rxi_connCacheMutex;
191extern afs_kmutex_t rx_event_mutex;
192extern afs_kmutex_t event_handler_mutex;
193extern afs_kmutex_t listener_mutex;
194extern afs_kmutex_t rx_if_init_mutex;
195extern afs_kmutex_t rx_if_mutex;
196extern afs_kmutex_t rxkad_client_uid_mutex;
197extern afs_kmutex_t rxkad_random_mutex;
198
199extern afs_kcondvar_t rx_event_handler_cond;
200extern afs_kcondvar_t rx_listener_cond;
201
202static afs_kmutex_t epoch_mutex;
203static afs_kmutex_t rx_init_mutex;
204static afs_kmutex_t rx_debug_mutex;
205static afs_kmutex_t rx_rpc_stats;
206
207static void
208rxi_InitPthread(void)
209{
210 MUTEX_INIT(&rx_clock_mutex, "clock", MUTEX_DEFAULT, 0);
211 MUTEX_INIT(&rx_stats_mutex, "stats", MUTEX_DEFAULT, 0);
212 MUTEX_INIT(&rx_atomic_mutex, "atomic", MUTEX_DEFAULT, 0);
213 MUTEX_INIT(&rx_quota_mutex, "quota", MUTEX_DEFAULT, 0);
214 MUTEX_INIT(&rx_pthread_mutex, "pthread", MUTEX_DEFAULT, 0);
215 MUTEX_INIT(&rx_packets_mutex, "packets", MUTEX_DEFAULT, 0);
216 MUTEX_INIT(&rx_refcnt_mutex, "refcnts", MUTEX_DEFAULT, 0);
217 MUTEX_INIT(&epoch_mutex, "epoch", MUTEX_DEFAULT, 0);
218 MUTEX_INIT(&rx_init_mutex, "init", MUTEX_DEFAULT, 0);
219 MUTEX_INIT(&rx_event_mutex, "event", MUTEX_DEFAULT, 0);
220 MUTEX_INIT(&event_handler_mutex, "event handler", MUTEX_DEFAULT, 0);
221 MUTEX_INIT(&rxi_connCacheMutex, "conn cache", MUTEX_DEFAULT, 0);
222 MUTEX_INIT(&listener_mutex, "listener", MUTEX_DEFAULT, 0);
223 MUTEX_INIT(&rx_if_init_mutex, "if init", MUTEX_DEFAULT, 0);
224 MUTEX_INIT(&rx_if_mutex, "if", MUTEX_DEFAULT, 0);
225 MUTEX_INIT(&rxkad_client_uid_mutex, "uid", MUTEX_DEFAULT, 0);
226 MUTEX_INIT(&rxkad_random_mutex, "rxkad random", MUTEX_DEFAULT, 0);
227 MUTEX_INIT(&rx_debug_mutex, "debug", MUTEX_DEFAULT, 0);
228
229 CV_INIT(&rx_event_handler_cond, "evhand", CV_DEFAULT, 0);
230 CV_INIT(&rx_listener_cond, "rxlisten", CV_DEFAULT, 0);
231
232 osi_Assert(pthread_key_create(&rx_thread_id_key, NULL) == 0)(void)((pthread_key_create(&rx_thread_id_key, ((void *)0)
) == 0) || (osi_AssertFailU("pthread_key_create(&rx_thread_id_key, NULL) == 0"
, "rx.c", 232), 0));
233 osi_Assert(pthread_key_create(&rx_ts_info_key, NULL) == 0)(void)((pthread_key_create(&rx_ts_info_key, ((void *)0)) ==
0) || (osi_AssertFailU("pthread_key_create(&rx_ts_info_key, NULL) == 0"
, "rx.c", 233), 0));
234
235 rxkad_global_stats_init();
236
237 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
238 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
239#ifdef RX_ENABLE_LOCKS
240#ifdef RX_LOCKS_DB
241 rxdb_init();
242#endif /* RX_LOCKS_DB */
243 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
244 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
245 0);
246 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
247 0);
248 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
249 0);
250 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
251 0);
252 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
253 MUTEX_INIT(&rxi_keyCreate_lock, "rxi_keyCreate_lock", MUTEX_DEFAULT, 0);
254#endif /* RX_ENABLE_LOCKS */
255}
256
257pthread_once_t rx_once_init = PTHREAD_ONCE_INIT;
258#define INIT_PTHREAD_LOCKS osi_Assert(pthread_once(&rx_once_init, rxi_InitPthread)==0)(void)((pthread_once(&rx_once_init, rxi_InitPthread)==0) ||
(osi_AssertFailU("pthread_once(&rx_once_init, rxi_InitPthread)==0"
, "rx.c", 258), 0))
259/*
260 * The rx_stats_mutex mutex protects the following global variables:
261 * rxi_lowConnRefCount
262 * rxi_lowPeerRefCount
263 * rxi_nCalls
264 * rxi_Alloccnt
265 * rxi_Allocsize
266 * rx_tq_debug
267 * rx_stats
268 */
269
270/*
271 * The rx_quota_mutex mutex protects the following global variables:
272 * rxi_dataQuota
273 * rxi_minDeficit
274 * rxi_availProcs
275 * rxi_totalMin
276 */
277
278/*
279 * The rx_freePktQ_lock protects the following global variables:
280 * rx_nFreePackets
281 */
282
283/*
284 * The rx_packets_mutex mutex protects the following global variables:
285 * rx_nPackets
286 * rx_TSFPQLocalMax
287 * rx_TSFPQGlobSize
288 * rx_TSFPQMaxProcs
289 */
290
291/*
292 * The rx_pthread_mutex mutex protects the following global variables:
293 * rxi_fcfs_thread_num
294 */
295#else
296#define INIT_PTHREAD_LOCKS
297#endif
298
299
300/* Variables for handling the minProcs implementation. availProcs gives the
301 * number of threads available in the pool at this moment (not counting dudes
302 * executing right now). totalMin gives the total number of procs required
303 * for handling all minProcs requests. minDeficit is a dynamic variable
304 * tracking the # of procs required to satisfy all of the remaining minProcs
305 * demands.
306 * For fine grain locking to work, the quota check and the reservation of
307 * a server thread has to come while rxi_availProcs and rxi_minDeficit
308 * are locked. To this end, the code has been modified under #ifdef
309 * RX_ENABLE_LOCKS so that quota checks and reservation occur at the
310 * same time. A new function, ReturnToServerPool() returns the allocation.
311 *
312 * A call can be on several queue's (but only one at a time). When
313 * rxi_ResetCall wants to remove the call from a queue, it has to ensure
314 * that no one else is touching the queue. To this end, we store the address
315 * of the queue lock in the call structure (under the call lock) when we
316 * put the call on a queue, and we clear the call_queue_lock when the
317 * call is removed from a queue (once the call lock has been obtained).
318 * This allows rxi_ResetCall to safely synchronize with others wishing
319 * to manipulate the queue.
320 */
321
322#if defined(RX_ENABLE_LOCKS)
323static afs_kmutex_t rx_rpc_stats;
324#endif
325
326/* We keep a "last conn pointer" in rxi_FindConnection. The odds are
327** pretty good that the next packet coming in is from the same connection
328** as the last packet, since we're send multiple packets in a transmit window.
329*/
330struct rx_connection *rxLastConn = 0;
331
332#ifdef RX_ENABLE_LOCKS
333/* The locking hierarchy for rx fine grain locking is composed of these
334 * tiers:
335 *
336 * rx_connHashTable_lock - synchronizes conn creation, rx_connHashTable access
337 * conn_call_lock - used to synchonize rx_EndCall and rx_NewCall
338 * call->lock - locks call data fields.
339 * These are independent of each other:
340 * rx_freeCallQueue_lock
341 * rxi_keyCreate_lock
342 * rx_serverPool_lock
343 * freeSQEList_lock
344 *
345 * serverQueueEntry->lock
346 * rx_peerHashTable_lock - locked under rx_connHashTable_lock
347 * rx_rpc_stats
348 * peer->lock - locks peer data fields.
349 * conn_data_lock - that more than one thread is not updating a conn data
350 * field at the same time.
351 * rx_freePktQ_lock
352 *
353 * lowest level:
354 * multi_handle->lock
355 * rxevent_lock
356 * rx_packets_mutex
357 * rx_stats_mutex
358 * rx_refcnt_mutex
359 * rx_atomic_mutex
360 *
361 * Do we need a lock to protect the peer field in the conn structure?
362 * conn->peer was previously a constant for all intents and so has no
363 * lock protecting this field. The multihomed client delta introduced
364 * a RX code change : change the peer field in the connection structure
365 * to that remote interface from which the last packet for this
366 * connection was sent out. This may become an issue if further changes
367 * are made.
368 */
369#define SET_CALL_QUEUE_LOCK(C, L) (C)->call_queue_lock = (L)
370#define CLEAR_CALL_QUEUE_LOCK(C) (C)->call_queue_lock = NULL((void *)0)
371#ifdef RX_LOCKS_DB
372/* rxdb_fileID is used to identify the lock location, along with line#. */
373static int rxdb_fileID = RXDB_FILE_RX1;
374#endif /* RX_LOCKS_DB */
375#else /* RX_ENABLE_LOCKS */
376#define SET_CALL_QUEUE_LOCK(C, L)
377#define CLEAR_CALL_QUEUE_LOCK(C)
378#endif /* RX_ENABLE_LOCKS */
379struct rx_serverQueueEntry *rx_waitForPacket = 0;
380struct rx_serverQueueEntry *rx_waitingForPacket = 0;
381
382/* ------------Exported Interfaces------------- */
383
384/* This function allows rxkad to set the epoch to a suitably random number
385 * which rx_NewConnection will use in the future. The principle purpose is to
386 * get rxnull connections to use the same epoch as the rxkad connections do, at
387 * least once the first rxkad connection is established. This is important now
388 * that the host/port addresses aren't used in FindConnection: the uniqueness
389 * of epoch/cid matters and the start time won't do. */
390
391#ifdef AFS_PTHREAD_ENV
392/*
393 * This mutex protects the following global variables:
394 * rx_epoch
395 */
396
397#define LOCK_EPOCH MUTEX_ENTER(&epoch_mutex)
398#define UNLOCK_EPOCH MUTEX_EXIT(&epoch_mutex)
399#else
400#define LOCK_EPOCH
401#define UNLOCK_EPOCH
402#endif /* AFS_PTHREAD_ENV */
403
404void
405rx_SetEpoch(afs_uint32 epoch)
406{
407 LOCK_EPOCH;
408 rx_epoch = epoch;
409 UNLOCK_EPOCH;
410}
411
412/* Initialize rx. A port number may be mentioned, in which case this
413 * becomes the default port number for any service installed later.
414 * If 0 is provided for the port number, a random port will be chosen
415 * by the kernel. Whether this will ever overlap anything in
416 * /etc/services is anybody's guess... Returns 0 on success, -1 on
417 * error. */
418#ifndef AFS_NT40_ENV
419static
420#endif
421int rxinit_status = 1;
422#ifdef AFS_PTHREAD_ENV
423/*
424 * This mutex protects the following global variables:
425 * rxinit_status
426 */
427
428#define LOCK_RX_INIT MUTEX_ENTER(&rx_init_mutex)
429#define UNLOCK_RX_INIT MUTEX_EXIT(&rx_init_mutex)
430#else
431#define LOCK_RX_INIT
432#define UNLOCK_RX_INIT
433#endif
434
435int
436rx_InitHost(u_int host, u_int port)
437{
438#ifdef KERNEL
439 osi_timeval_t tv;
440#else /* KERNEL */
441 struct timeval tv;
442#endif /* KERNEL */
443 char *htable, *ptable;
444 int tmp_status;
445
446 SPLVAR;
447
448 INIT_PTHREAD_LOCKS;
449 LOCK_RX_INIT;
450 if (rxinit_status == 0) {
451 tmp_status = rxinit_status;
452 UNLOCK_RX_INIT;
453 return tmp_status; /* Already started; return previous error code. */
454 }
455#ifdef RXDEBUG1
456 rxi_DebugInit();
457#endif
458#ifdef AFS_NT40_ENV
459 if (afs_winsockInit() < 0)
460 return -1;
461#endif
462
463#ifndef KERNEL
464 /*
465 * Initialize anything necessary to provide a non-premptive threading
466 * environment.
467 */
468 rxi_InitializeThreadSupport();
469#endif
470
471 /* Allocate and initialize a socket for client and perhaps server
472 * connections. */
473
474 rx_socket = rxi_GetHostUDPSocket(host, (u_short) port);
475 if (rx_socket == OSI_NULLSOCKET((osi_socket) -1)) {
476 UNLOCK_RX_INIT;
477 return RX_ADDRINUSE(-7);
478 }
479#if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
480#ifdef RX_LOCKS_DB
481 rxdb_init();
482#endif /* RX_LOCKS_DB */
483 MUTEX_INIT(&rx_stats_mutex, "rx_stats_mutex", MUTEX_DEFAULT, 0);
484 MUTEX_INIT(&rx_quota_mutex, "rx_quota_mutex", MUTEX_DEFAULT, 0);
485 MUTEX_INIT(&rx_pthread_mutex, "rx_pthread_mutex", MUTEX_DEFAULT, 0);
486 MUTEX_INIT(&rx_packets_mutex, "rx_packets_mutex", MUTEX_DEFAULT, 0);
487 MUTEX_INIT(&rx_refcnt_mutex, "rx_refcnt_mutex", MUTEX_DEFAULT, 0);
488 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
489 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
490 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
491 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
492 0);
493 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
494 0);
495 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
496 0);
497 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
498 0);
499 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
500#if defined(AFS_HPUX110_ENV)
501 if (!uniprocessor)
502 rx_sleepLock = alloc_spinlock(LAST_HELD_ORDER - 10, "rx_sleepLock");
503#endif /* AFS_HPUX110_ENV */
504#endif /* RX_ENABLE_LOCKS && KERNEL */
505
506 rxi_nCalls = 0;
507 rx_connDeadTime = 12;
508 rx_tranquil = 0; /* reset flag */
509 rxi_ResetStatistics();
510 htable = (char *)
511 osi_Alloc(rx_hashTableSize * sizeof(struct rx_connection *))malloc(rx_hashTableSize * sizeof(struct rx_connection *));
512 PIN(htable, rx_hashTableSize * sizeof(struct rx_connection *));; /* XXXXX */
513 memset(htable, 0, rx_hashTableSize * sizeof(struct rx_connection *));
514 ptable = (char *)osi_Alloc(rx_hashTableSize * sizeof(struct rx_peer *))malloc(rx_hashTableSize * sizeof(struct rx_peer *));
515 PIN(ptable, rx_hashTableSize * sizeof(struct rx_peer *));; /* XXXXX */
516 memset(ptable, 0, rx_hashTableSize * sizeof(struct rx_peer *));
517
518 /* Malloc up a bunch of packets & buffers */
519 rx_nFreePackets = 0;
520 queue_Init(&rx_freePacketQueue)(((struct rx_queue *)(&rx_freePacketQueue)))->prev = (
((struct rx_queue *)(&rx_freePacketQueue)))->next = ((
(struct rx_queue *)(&rx_freePacketQueue)));
521 rxi_NeedMorePackets = FALSE0;
522 rx_nPackets = 0; /* rx_nPackets is managed by rxi_MorePackets* */
523
524 /* enforce a minimum number of allocated packets */
525 if (rx_extraPackets < rxi_nSendFrags * rx_maxSendWindow)
526 rx_extraPackets = rxi_nSendFrags * rx_maxSendWindow;
527
528 /* allocate the initial free packet pool */
529#ifdef RX_ENABLE_TSFPQ
530 rxi_MorePacketsTSFPQ(rx_extraPackets + RX_MAX_QUOTA15 + 2, RX_TS_FPQ_FLUSH_GLOBAL, 0);
531#else /* RX_ENABLE_TSFPQ */
532 rxi_MorePackets(rx_extraPackets + RX_MAX_QUOTA15 + 2); /* fudge */
533#endif /* RX_ENABLE_TSFPQ */
534 rx_CheckPackets();
535
536 NETPRI;
537
538 clock_Init();
539
540#if defined(AFS_NT40_ENV) && !defined(AFS_PTHREAD_ENV)
541 tv.tv_sec = clock_now.sec;
542 tv.tv_usec = clock_now.usec;
543 srand((unsigned int)tv.tv_usec);
544#else
545 osi_GetTime(&tv)gettimeofday(&tv, 0);
546#endif
547 if (port) {
548 rx_port = port;
549 } else {
550#if defined(KERNEL) && !defined(UKERNEL)
551 /* Really, this should never happen in a real kernel */
552 rx_port = 0;
553#else
554 struct sockaddr_in addr;
555#ifdef AFS_NT40_ENV
556 int addrlen = sizeof(addr);
557#else
558 socklen_t addrlen = sizeof(addr);
559#endif
560 if (getsockname((intptr_t)rx_socket, (struct sockaddr *)&addr, &addrlen)) {
561 rx_Finalize();
562 return -1;
563 }
564 rx_port = addr.sin_port;
565#endif
566 }
567 rx_stats.minRtt.sec = 9999999;
568#ifdef KERNEL
569 rx_SetEpoch(tv.tv_sec | 0x80000000);
570#else
571 rx_SetEpoch(tv.tv_sec); /* Start time of this package, rxkad
572 * will provide a randomer value. */
573#endif
574 MUTEX_ENTER(&rx_quota_mutex);
575 rxi_dataQuota += rx_extraQuota; /* + extra pkts caller asked to rsrv */
576 MUTEX_EXIT(&rx_quota_mutex);
577 /* *Slightly* random start time for the cid. This is just to help
578 * out with the hashing function at the peer */
579 rx_nextCid = ((tv.tv_sec ^ tv.tv_usec) << RX_CIDSHIFT2);
580 rx_connHashTable = (struct rx_connection **)htable;
581 rx_peerHashTable = (struct rx_peer **)ptable;
582
583 rx_hardAckDelay.sec = 0;
584 rx_hardAckDelay.usec = 100000; /* 100 milliseconds */
585
586 rxevent_Init(20, rxi_ReScheduleEvents);
587
588 /* Initialize various global queues */
589 queue_Init(&rx_idleServerQueue)(((struct rx_queue *)(&rx_idleServerQueue)))->prev = (
((struct rx_queue *)(&rx_idleServerQueue)))->next = ((
(struct rx_queue *)(&rx_idleServerQueue)));
590 queue_Init(&rx_incomingCallQueue)(((struct rx_queue *)(&rx_incomingCallQueue)))->prev =
(((struct rx_queue *)(&rx_incomingCallQueue)))->next =
(((struct rx_queue *)(&rx_incomingCallQueue)));
591 queue_Init(&rx_freeCallQueue)(((struct rx_queue *)(&rx_freeCallQueue)))->prev = (((
struct rx_queue *)(&rx_freeCallQueue)))->next = (((struct
rx_queue *)(&rx_freeCallQueue)));
592
593#if defined(AFS_NT40_ENV) && !defined(KERNEL)
594 /* Initialize our list of usable IP addresses. */
595 rx_GetIFInfo();
596#endif
597
598#if defined(RXK_LISTENER_ENV1) || !defined(KERNEL)
599 /* Start listener process (exact function is dependent on the
600 * implementation environment--kernel or user space) */
601 rxi_StartListener();
602#endif
603
604 USERPRI;
605 tmp_status = rxinit_status = 0;
606 UNLOCK_RX_INIT;
607 return tmp_status;
608}
609
610int
611rx_Init(u_int port)
612{
613 return rx_InitHost(htonl(INADDR_ANY)(__builtin_constant_p((u_int32_t)0x00000000) ? ((((__uint32_t
)((u_int32_t)0x00000000)) >> 24) | ((((__uint32_t)((u_int32_t
)0x00000000)) & (0xff << 16)) >> 8) | ((((__uint32_t
)((u_int32_t)0x00000000)) & (0xff << 8)) << 8
) | (((__uint32_t)((u_int32_t)0x00000000)) << 24)) : __bswap32_var
((u_int32_t)0x00000000)), port);
614}
615
616/* RTT Timer
617 * ---------
618 *
619 * The rxi_rto functions implement a TCP (RFC2988) style algorithm for
620 * maintaing the round trip timer.
621 *
622 */
623
624/*!
625 * Start a new RTT timer for a given call and packet.
626 *
627 * There must be no resendEvent already listed for this call, otherwise this
628 * will leak events - intended for internal use within the RTO code only
629 *
630 * @param[in] call
631 * the RX call to start the timer for
632 * @param[in] lastPacket
633 * a flag indicating whether the last packet has been sent or not
634 *
635 * @pre call must be locked before calling this function
636 *
637 */
638static_inlinestatic inline void
639rxi_rto_startTimer(struct rx_call *call, int lastPacket, int istack)
640{
641 struct clock now, retryTime;
642
643 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
644 retryTime = now;
645
646 clock_Add(&retryTime, &call->rto)do { (&retryTime)->sec += (&call->rto)->sec;
if (((&retryTime)->usec += (&call->rto)->usec
) >= 1000000) { (&retryTime)->usec -= 1000000; (&
retryTime)->sec++; } } while(0);
647
648 /* If we're sending the last packet, and we're the client, then the server
649 * may wait for an additional 400ms before returning the ACK, wait for it
650 * rather than hitting a timeout */
651 if (lastPacket && call->conn->type == RX_CLIENT_CONNECTION0)
652 clock_Addmsec(&retryTime, 400)do { if ((400) >= 1000) { (&retryTime)->sec += (afs_int32
)((400) / 1000); (&retryTime)->usec += (afs_int32)(((400
) % 1000) * 1000); } else { (&retryTime)->usec += (afs_int32
)((400) * 1000); } if ((&retryTime)->usec >= 1000000
) { (&retryTime)->usec -= 1000000; (&retryTime)->
sec++; } } while(0);
653
654 MUTEX_ENTER(&rx_refcnt_mutex);
655 CALL_HOLD(call, RX_CALL_REFCOUNT_RESEND);
656 MUTEX_EXIT(&rx_refcnt_mutex);
657 call->resendEvent = rxevent_PostNow2(&retryTime, &now, rxi_Resend,
658 call, 0, istack);
659}
660
661/*!
662 * Cancel an RTT timer for a given call.
663 *
664 *
665 * @param[in] call
666 * the RX call to cancel the timer for
667 *
668 * @pre call must be locked before calling this function
669 *
670 */
671
672static_inlinestatic inline void
673rxi_rto_cancel(struct rx_call *call)
674{
675 if (!call->resendEvent)
676 return;
677
678 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND)do { if (call->resendEvent) { rxevent_Cancel_1(call->resendEvent
, ((void *)0), 0); call->resendEvent = ((void *)0); } } while
(0);
679}
680
681/*!
682 * Tell the RTO timer that we have sent a packet.
683 *
684 * If the timer isn't already running, then start it. If the timer is running,
685 * then do nothing.
686 *
687 * @param[in] call
688 * the RX call that the packet has been sent on
689 * @param[in] lastPacket
690 * A flag which is true if this is the last packet for the call
691 *
692 * @pre The call must be locked before calling this function
693 *
694 */
695
696static_inlinestatic inline void
697rxi_rto_packet_sent(struct rx_call *call, int lastPacket, int istack)
698{
699 if (call->resendEvent)
700 return;
701
702 rxi_rto_startTimer(call, lastPacket, istack);
703}
704
705/*!
706 * Tell the RTO timer that we have received an new ACK message
707 *
708 * This function should be called whenever a call receives an ACK that
709 * acknowledges new packets. Whatever happens, we stop the current timer.
710 * If there are unacked packets in the queue which have been sent, then
711 * we restart the timer from now. Otherwise, we leave it stopped.
712 *
713 * @param[in] call
714 * the RX call that the ACK has been received on
715 */
716
717static_inlinestatic inline void
718rxi_rto_packet_acked(struct rx_call *call, int istack)
719{
720 struct rx_packet *p, *nxp;
721
722 rxi_rto_cancel(call);
723
724 if (queue_IsEmpty(&call->tq)(((struct rx_queue *)(&call->tq))->next == ((struct
rx_queue *)(&call->tq))))
725 return;
726
727 for (queue_Scan(&call->tq, p, nxp, rx_packet)(p) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(p))->next); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(p))); (p) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(p))->next)) {
728 if (p->header.seq > call->tfirst + call->twind)
729 return;
730
731 if (!(p->flags & RX_PKTFLAG_ACKED0x01) && p->flags & RX_PKTFLAG_SENT0x40) {
732 rxi_rto_startTimer(call, p->header.flags & RX_LAST_PACKET4, istack);
733 return;
734 }
735 }
736}
737
738
739/**
740 * Set an initial round trip timeout for a peer connection
741 *
742 * @param[in] secs The timeout to set in seconds
743 */
744
745void
746rx_rto_setPeerTimeoutSecs(struct rx_peer *peer, int secs) {
747 peer->rtt = secs * 8000;
748}
749
750/**
751 * Sets the error generated when a busy call channel is detected.
752 *
753 * @param[in] error The error to return for a call on a busy channel.
754 *
755 * @pre Neither rx_Init nor rx_InitHost have been called yet
756 */
757void
758rx_SetBusyChannelError(afs_int32 error)
759{
760 osi_Assert(rxinit_status != 0)(void)((rxinit_status != 0) || (osi_AssertFailU("rxinit_status != 0"
, "rx.c", 760), 0));
761 rxi_busyChannelError = error;
762}
763
764/* called with unincremented nRequestsRunning to see if it is OK to start
765 * a new thread in this service. Could be "no" for two reasons: over the
766 * max quota, or would prevent others from reaching their min quota.
767 */
768#ifdef RX_ENABLE_LOCKS
769/* This verion of QuotaOK reserves quota if it's ok while the
770 * rx_serverPool_lock is held. Return quota using ReturnToServerPool().
771 */
772static int
773QuotaOK(struct rx_service *aservice)
774{
775 /* check if over max quota */
776 if (aservice->nRequestsRunning >= aservice->maxProcs) {
777 return 0;
778 }
779
780 /* under min quota, we're OK */
781 /* otherwise, can use only if there are enough to allow everyone
782 * to go to their min quota after this guy starts.
783 */
784
785 MUTEX_ENTER(&rx_quota_mutex);
786 if ((aservice->nRequestsRunning < aservice->minProcs)
787 || (rxi_availProcs > rxi_minDeficit)) {
788 aservice->nRequestsRunning++;
789 /* just started call in minProcs pool, need fewer to maintain
790 * guarantee */
791 if (aservice->nRequestsRunning <= aservice->minProcs)
792 rxi_minDeficit--;
793 rxi_availProcs--;
794 MUTEX_EXIT(&rx_quota_mutex);
795 return 1;
796 }
797 MUTEX_EXIT(&rx_quota_mutex);
798
799 return 0;
800}
801
802static void
803ReturnToServerPool(struct rx_service *aservice)
804{
805 aservice->nRequestsRunning--;
806 MUTEX_ENTER(&rx_quota_mutex);
807 if (aservice->nRequestsRunning < aservice->minProcs)
808 rxi_minDeficit++;
809 rxi_availProcs++;
810 MUTEX_EXIT(&rx_quota_mutex);
811}
812
813#else /* RX_ENABLE_LOCKS */
814static int
815QuotaOK(struct rx_service *aservice)
816{
817 int rc = 0;
818 /* under min quota, we're OK */
819 if (aservice->nRequestsRunning < aservice->minProcs)
820 return 1;
821
822 /* check if over max quota */
823 if (aservice->nRequestsRunning >= aservice->maxProcs)
824 return 0;
825
826 /* otherwise, can use only if there are enough to allow everyone
827 * to go to their min quota after this guy starts.
828 */
829 MUTEX_ENTER(&rx_quota_mutex);
830 if (rxi_availProcs > rxi_minDeficit)
831 rc = 1;
832 MUTEX_EXIT(&rx_quota_mutex);
833 return rc;
834}
835#endif /* RX_ENABLE_LOCKS */
836
837#ifndef KERNEL
838/* Called by rx_StartServer to start up lwp's to service calls.
839 NExistingProcs gives the number of procs already existing, and which
840 therefore needn't be created. */
841static void
842rxi_StartServerProcs(int nExistingProcs)
843{
844 struct rx_service *service;
845 int i;
846 int maxdiff = 0;
847 int nProcs = 0;
848
849 /* For each service, reserve N processes, where N is the "minimum"
850 * number of processes that MUST be able to execute a request in parallel,
851 * at any time, for that process. Also compute the maximum difference
852 * between any service's maximum number of processes that can run
853 * (i.e. the maximum number that ever will be run, and a guarantee
854 * that this number will run if other services aren't running), and its
855 * minimum number. The result is the extra number of processes that
856 * we need in order to provide the latter guarantee */
857 for (i = 0; i < RX_MAX_SERVICES20; i++) {
858 int diff;
859 service = rx_services[i];
860 if (service == (struct rx_service *)0)
861 break;
862 nProcs += service->minProcs;
863 diff = service->maxProcs - service->minProcs;
864 if (diff > maxdiff)
865 maxdiff = diff;
866 }
867 nProcs += maxdiff; /* Extra processes needed to allow max number requested to run in any given service, under good conditions */
868 nProcs -= nExistingProcs; /* Subtract the number of procs that were previously created for use as server procs */
869 for (i = 0; i < nProcs; i++) {
870 rxi_StartServerProc(rx_ServerProc, rx_stackSize);
871 }
872}
873#endif /* KERNEL */
874
875#ifdef AFS_NT40_ENV
876/* This routine is only required on Windows */
877void
878rx_StartClientThread(void)
879{
880#ifdef AFS_PTHREAD_ENV
881 pthread_t pid;
882 pid = pthread_self();
883#endif /* AFS_PTHREAD_ENV */
884}
885#endif /* AFS_NT40_ENV */
886
887/* This routine must be called if any services are exported. If the
888 * donateMe flag is set, the calling process is donated to the server
889 * process pool */
890void
891rx_StartServer(int donateMe)
892{
893 struct rx_service *service;
894 int i;
895 SPLVAR;
896 clock_NewTime();
897
898 NETPRI;
899 /* Start server processes, if necessary (exact function is dependent
900 * on the implementation environment--kernel or user space). DonateMe
901 * will be 1 if there is 1 pre-existing proc, i.e. this one. In this
902 * case, one less new proc will be created rx_StartServerProcs.
903 */
904 rxi_StartServerProcs(donateMe);
905
906 /* count up the # of threads in minProcs, and add set the min deficit to
907 * be that value, too.
908 */
909 for (i = 0; i < RX_MAX_SERVICES20; i++) {
910 service = rx_services[i];
911 if (service == (struct rx_service *)0)
912 break;
913 MUTEX_ENTER(&rx_quota_mutex);
914 rxi_totalMin += service->minProcs;
915 /* below works even if a thread is running, since minDeficit would
916 * still have been decremented and later re-incremented.
917 */
918 rxi_minDeficit += service->minProcs;
919 MUTEX_EXIT(&rx_quota_mutex);
920 }
921
922 /* Turn on reaping of idle server connections */
923 rxi_ReapConnections(NULL((void *)0), NULL((void *)0), NULL((void *)0));
924
925 USERPRI;
926
927 if (donateMe) {
928#ifndef AFS_NT40_ENV
929#ifndef KERNEL
930 char name[32];
931 static int nProcs;
932#ifdef AFS_PTHREAD_ENV
933 pid_t pid;
934 pid = afs_pointer_to_int(pthread_self())((afs_uint32) (pthread_self()));
935#else /* AFS_PTHREAD_ENV */
936 PROCESS pid;
937 LWP_CurrentProcess(&pid);
938#endif /* AFS_PTHREAD_ENV */
939
940 sprintf(name, "srv_%d", ++nProcs);
941 if (registerProgram)
942 (*registerProgram) (pid, name);
943#endif /* KERNEL */
944#endif /* AFS_NT40_ENV */
945 rx_ServerProc(NULL((void *)0)); /* Never returns */
946 }
947#ifdef RX_ENABLE_TSFPQ
948 /* no use leaving packets around in this thread's local queue if
949 * it isn't getting donated to the server thread pool.
950 */
951 rxi_FlushLocalPacketsTSFPQ();
952#endif /* RX_ENABLE_TSFPQ */
953 return;
954}
955
956/* Create a new client connection to the specified service, using the
957 * specified security object to implement the security model for this
958 * connection. */
959struct rx_connection *
960rx_NewConnection(afs_uint32 shost, u_short sport, u_short sservice,
961 struct rx_securityClass *securityObject,
962 int serviceSecurityIndex)
963{
964 int hashindex, i;
965 afs_int32 cid;
966 struct rx_connection *conn;
967
968 SPLVAR;
969
970 clock_NewTime();
971 dpf(("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "do { if (rx_debugFile) rxi_DebugPrint ("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
"serviceSecurityIndex %d)\n", (__builtin_constant_p(shost) ?
((((__uint32_t)(shost)) >> 24) | ((((__uint32_t)(shost
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(shost
)) & (0xff << 8)) << 8) | (((__uint32_t)(shost
)) << 24)) : __bswap32_var(shost)), (__builtin_constant_p
(sport) ? (__uint16_t)(((__uint16_t)(sport)) << 8 | ((__uint16_t
)(sport)) >> 8) : __bswap16_var(sport)), sservice, securityObject
, serviceSecurityIndex); } while (0)
972 "serviceSecurityIndex %d)\n",do { if (rx_debugFile) rxi_DebugPrint ("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
"serviceSecurityIndex %d)\n", (__builtin_constant_p(shost) ?
((((__uint32_t)(shost)) >> 24) | ((((__uint32_t)(shost
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(shost
)) & (0xff << 8)) << 8) | (((__uint32_t)(shost
)) << 24)) : __bswap32_var(shost)), (__builtin_constant_p
(sport) ? (__uint16_t)(((__uint16_t)(sport)) << 8 | ((__uint16_t
)(sport)) >> 8) : __bswap16_var(sport)), sservice, securityObject
, serviceSecurityIndex); } while (0)
973 ntohl(shost), ntohs(sport), sservice, securityObject,do { if (rx_debugFile) rxi_DebugPrint ("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
"serviceSecurityIndex %d)\n", (__builtin_constant_p(shost) ?
((((__uint32_t)(shost)) >> 24) | ((((__uint32_t)(shost
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(shost
)) & (0xff << 8)) << 8) | (((__uint32_t)(shost
)) << 24)) : __bswap32_var(shost)), (__builtin_constant_p
(sport) ? (__uint16_t)(((__uint16_t)(sport)) << 8 | ((__uint16_t
)(sport)) >> 8) : __bswap16_var(sport)), sservice, securityObject
, serviceSecurityIndex); } while (0)
974 serviceSecurityIndex))do { if (rx_debugFile) rxi_DebugPrint ("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
"serviceSecurityIndex %d)\n", (__builtin_constant_p(shost) ?
((((__uint32_t)(shost)) >> 24) | ((((__uint32_t)(shost
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(shost
)) & (0xff << 8)) << 8) | (((__uint32_t)(shost
)) << 24)) : __bswap32_var(shost)), (__builtin_constant_p
(sport) ? (__uint16_t)(((__uint16_t)(sport)) << 8 | ((__uint16_t
)(sport)) >> 8) : __bswap16_var(sport)), sservice, securityObject
, serviceSecurityIndex); } while (0);
975
976 /* Vasilsi said: "NETPRI protects Cid and Alloc", but can this be true in
977 * the case of kmem_alloc? */
978 conn = rxi_AllocConnection()rxi_Alloc(sizeof(struct rx_connection));
979#ifdef RX_ENABLE_LOCKS
980 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
981 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
982 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
983#endif
984 NETPRI;
985 MUTEX_ENTER(&rx_connHashTable_lock);
986 cid = (rx_nextCid += RX_MAXCALLS4);
987 conn->type = RX_CLIENT_CONNECTION0;
988 conn->cid = cid;
989 conn->epoch = rx_epoch;
990 conn->peer = rxi_FindPeer(shost, sport, 0, 1);
991 conn->serviceId = sservice;
992 conn->securityObject = securityObject;
993 conn->securityData = (void *) 0;
994 conn->securityIndex = serviceSecurityIndex;
995 rx_SetConnDeadTime(conn, rx_connDeadTime);
996 rx_SetConnSecondsUntilNatPing(conn, 0);
997 conn->ackRate = RX_FAST_ACK_RATE1;
998 conn->nSpecific = 0;
999 conn->specific = NULL((void *)0);
1000 conn->challengeEvent = NULL((void *)0);
1001 conn->delayedAbortEvent = NULL((void *)0);
1002 conn->abortCount = 0;
1003 conn->error = 0;
1004 for (i = 0; i < RX_MAXCALLS4; i++) {
1005 conn->twind[i] = rx_initSendWindow;
1006 conn->rwind[i] = rx_initReceiveWindow;
1007 conn->lastBusy[i] = 0;
1008 }
1009
1010 RXS_NewConnection(securityObject, conn)((securityObject && (securityObject->ops->op_NewConnection
)) ? (*(securityObject)->ops->op_NewConnection)(securityObject
,conn) : 0);
1011 hashindex =
1012 CONN_HASH(shost, sport, conn->cid, conn->epoch, RX_CLIENT_CONNECTION)((((conn->cid)>>2)%rx_hashTableSize));
1013
1014 conn->refCount++; /* no lock required since only this thread knows... */
1015 conn->next = rx_connHashTable[hashindex];
1016 rx_connHashTable[hashindex] = conn;
1017 if (rx_stats_active)
1018 rx_atomic_inc(&rx_stats.nClientConns);
1019 MUTEX_EXIT(&rx_connHashTable_lock);
1020 USERPRI;
1021 return conn;
1022}
1023
1024/**
1025 * Ensure a connection's timeout values are valid.
1026 *
1027 * @param[in] conn The connection to check
1028 *
1029 * @post conn->secondUntilDead <= conn->idleDeadTime <= conn->hardDeadTime,
1030 * unless idleDeadTime and/or hardDeadTime are not set
1031 * @internal
1032 */
1033static void
1034rxi_CheckConnTimeouts(struct rx_connection *conn)
1035{
1036 /* a connection's timeouts must have the relationship
1037 * deadTime <= idleDeadTime <= hardDeadTime. Otherwise, for example, a
1038 * total loss of network to a peer may cause an idle timeout instead of a
1039 * dead timeout, simply because the idle timeout gets hit first. Also set
1040 * a minimum deadTime of 6, just to ensure it doesn't get set too low. */
1041 /* this logic is slightly complicated by the fact that
1042 * idleDeadTime/hardDeadTime may not be set at all, but it's not too bad.
1043 */
1044 conn->secondsUntilDead = MAX(conn->secondsUntilDead, 6)(((conn->secondsUntilDead)>(6))?(conn->secondsUntilDead
):(6));
1045 if (conn->idleDeadTime) {
1046 conn->idleDeadTime = MAX(conn->idleDeadTime, conn->secondsUntilDead)(((conn->idleDeadTime)>(conn->secondsUntilDead))?(conn
->idleDeadTime):(conn->secondsUntilDead));
1047 }
1048 if (conn->hardDeadTime) {
1049 if (conn->idleDeadTime) {
1050 conn->hardDeadTime = MAX(conn->idleDeadTime, conn->hardDeadTime)(((conn->idleDeadTime)>(conn->hardDeadTime))?(conn->
idleDeadTime):(conn->hardDeadTime));
1051 } else {
1052 conn->hardDeadTime = MAX(conn->secondsUntilDead, conn->hardDeadTime)(((conn->secondsUntilDead)>(conn->hardDeadTime))?(conn
->secondsUntilDead):(conn->hardDeadTime));
1053 }
1054 }
1055}
1056
1057void
1058rx_SetConnDeadTime(struct rx_connection *conn, int seconds)
1059{
1060 /* The idea is to set the dead time to a value that allows several
1061 * keepalives to be dropped without timing out the connection. */
1062 conn->secondsUntilDead = seconds;
1063 rxi_CheckConnTimeouts(conn);
1064 conn->secondsUntilPing = conn->secondsUntilDead / 6;
1065}
1066
1067void
1068rx_SetConnHardDeadTime(struct rx_connection *conn, int seconds)
1069{
1070 conn->hardDeadTime = seconds;
1071 rxi_CheckConnTimeouts(conn);
1072}
1073
1074void
1075rx_SetConnIdleDeadTime(struct rx_connection *conn, int seconds)
1076{
1077 conn->idleDeadTime = seconds;
1078 rxi_CheckConnTimeouts(conn);
1079}
1080
1081int rxi_lowPeerRefCount = 0;
1082int rxi_lowConnRefCount = 0;
1083
1084/*
1085 * Cleanup a connection that was destroyed in rxi_DestroyConnectioNoLock.
1086 * NOTE: must not be called with rx_connHashTable_lock held.
1087 */
1088static void
1089rxi_CleanupConnection(struct rx_connection *conn)
1090{
1091 /* Notify the service exporter, if requested, that this connection
1092 * is being destroyed */
1093 if (conn->type == RX_SERVER_CONNECTION1 && conn->service->destroyConnProc)
1094 (*conn->service->destroyConnProc) (conn);
1095
1096 /* Notify the security module that this connection is being destroyed */
1097 RXS_DestroyConnection(conn->securityObject, conn)((conn->securityObject && (conn->securityObject
->ops->op_DestroyConnection)) ? (*(conn->securityObject
)->ops->op_DestroyConnection)(conn->securityObject,conn
) : 0);
1098
1099 /* If this is the last connection using the rx_peer struct, set its
1100 * idle time to now. rxi_ReapConnections will reap it if it's still
1101 * idle (refCount == 0) after rx_idlePeerTime (60 seconds) have passed.
1102 */
1103 MUTEX_ENTER(&rx_peerHashTable_lock);
1104 if (conn->peer->refCount < 2) {
1105 conn->peer->idleWhen = clock_Sec()(time(((void *)0)));
1106 if (conn->peer->refCount < 1) {
1107 conn->peer->refCount = 1;
1108 if (rx_stats_active) {
1109 MUTEX_ENTER(&rx_stats_mutex);
1110 rxi_lowPeerRefCount++;
1111 MUTEX_EXIT(&rx_stats_mutex);
1112 }
1113 }
1114 }
1115 conn->peer->refCount--;
1116 MUTEX_EXIT(&rx_peerHashTable_lock);
1117
1118 if (rx_stats_active)
1119 {
1120 if (conn->type == RX_SERVER_CONNECTION1)
1121 rx_atomic_dec(&rx_stats.nServerConns);
1122 else
1123 rx_atomic_dec(&rx_stats.nClientConns);
1124 }
1125#ifndef KERNEL
1126 if (conn->specific) {
1127 int i;
1128 for (i = 0; i < conn->nSpecific; i++) {
1129 if (conn->specific[i] && rxi_keyCreate_destructor[i])
1130 (*rxi_keyCreate_destructor[i]) (conn->specific[i]);
1131 conn->specific[i] = NULL((void *)0);
1132 }
1133 free(conn->specific);
1134 }
1135 conn->specific = NULL((void *)0);
1136 conn->nSpecific = 0;
1137#endif /* !KERNEL */
1138
1139 MUTEX_DESTROY(&conn->conn_call_lock);
1140 MUTEX_DESTROY(&conn->conn_data_lock);
1141 CV_DESTROY(&conn->conn_call_cv);
1142
1143 rxi_FreeConnection(conn)(rxi_Free(conn, sizeof(struct rx_connection)));
1144}
1145
1146/* Destroy the specified connection */
1147void
1148rxi_DestroyConnection(struct rx_connection *conn)
1149{
1150 MUTEX_ENTER(&rx_connHashTable_lock);
1151 rxi_DestroyConnectionNoLock(conn);
1152 /* conn should be at the head of the cleanup list */
1153 if (conn == rx_connCleanup_list) {
1154 rx_connCleanup_list = rx_connCleanup_list->next;
1155 MUTEX_EXIT(&rx_connHashTable_lock);
1156 rxi_CleanupConnection(conn);
1157 }
1158#ifdef RX_ENABLE_LOCKS
1159 else {
1160 MUTEX_EXIT(&rx_connHashTable_lock);
1161 }
1162#endif /* RX_ENABLE_LOCKS */
1163}
1164
1165static void
1166rxi_DestroyConnectionNoLock(struct rx_connection *conn)
1167{
1168 struct rx_connection **conn_ptr;
1169 int havecalls = 0;
1170 struct rx_packet *packet;
1171 int i;
1172 SPLVAR;
1173
1174 clock_NewTime();
1175
1176 NETPRI;
1177 MUTEX_ENTER(&conn->conn_data_lock);
1178 MUTEX_ENTER(&rx_refcnt_mutex);
1179 if (conn->refCount > 0)
1180 conn->refCount--;
1181 else {
1182 if (rx_stats_active) {
1183 MUTEX_ENTER(&rx_stats_mutex);
1184 rxi_lowConnRefCount++;
1185 MUTEX_EXIT(&rx_stats_mutex);
1186 }
1187 }
1188
1189 if ((conn->refCount > 0) || (conn->flags & RX_CONN_BUSY32)) {
1190 /* Busy; wait till the last guy before proceeding */
1191 MUTEX_EXIT(&rx_refcnt_mutex);
1192 MUTEX_EXIT(&conn->conn_data_lock);
1193 USERPRI;
1194 return;
1195 }
1196
1197 /* If the client previously called rx_NewCall, but it is still
1198 * waiting, treat this as a running call, and wait to destroy the
1199 * connection later when the call completes. */
1200 if ((conn->type == RX_CLIENT_CONNECTION0)
1201 && (conn->flags & (RX_CONN_MAKECALL_WAITING1|RX_CONN_MAKECALL_ACTIVE128))) {
1202 conn->flags |= RX_CONN_DESTROY_ME2;
1203 MUTEX_EXIT(&conn->conn_data_lock);
1204 USERPRI;
1205 return;
1206 }
1207 MUTEX_EXIT(&rx_refcnt_mutex);
1208 MUTEX_EXIT(&conn->conn_data_lock);
1209
1210 /* Check for extant references to this connection */
1211 MUTEX_ENTER(&conn->conn_call_lock);
1212 for (i = 0; i < RX_MAXCALLS4; i++) {
1213 struct rx_call *call = conn->call[i];
1214 if (call) {
1215 havecalls = 1;
1216 if (conn->type == RX_CLIENT_CONNECTION0) {
1217 MUTEX_ENTER(&call->lock);
1218 if (call->delayedAckEvent) {
1219 /* Push the final acknowledgment out now--there
1220 * won't be a subsequent call to acknowledge the
1221 * last reply packets */
1222 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
1223 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
1224 if (call->state == RX_STATE_PRECALL1
1225 || call->state == RX_STATE_ACTIVE2) {
1226 rxi_SendAck(call, 0, 0, RX_ACK_DELAY8, 0);
1227 } else {
1228 rxi_AckAll(NULL((void *)0), call, 0);
1229 }
1230 }
1231 MUTEX_EXIT(&call->lock);
1232 }
1233 }
1234 }
1235 MUTEX_EXIT(&conn->conn_call_lock);
1236
1237#ifdef RX_ENABLE_LOCKS
1238 if (!havecalls) {
1239 if (MUTEX_TRYENTER(&conn->conn_data_lock)1) {
1240 MUTEX_EXIT(&conn->conn_data_lock);
1241 } else {
1242 /* Someone is accessing a packet right now. */
1243 havecalls = 1;
1244 }
1245 }
1246#endif /* RX_ENABLE_LOCKS */
1247
1248 if (havecalls) {
1249 /* Don't destroy the connection if there are any call
1250 * structures still in use */
1251 MUTEX_ENTER(&conn->conn_data_lock);
1252 conn->flags |= RX_CONN_DESTROY_ME2;
1253 MUTEX_EXIT(&conn->conn_data_lock);
1254 USERPRI;
1255 return;
1256 }
1257
1258 if (conn->natKeepAliveEvent) {
1259 rxi_NatKeepAliveOff(conn)do { if ((conn)->natKeepAliveEvent) { rxevent_Cancel_1((conn
)->natKeepAliveEvent, ((void *)0), 0); (conn)->natKeepAliveEvent
= ((void *)0); } } while(0);
1260 }
1261
1262 if (conn->delayedAbortEvent) {
1263 rxevent_Cancel(conn->delayedAbortEvent, (struct rx_call *)0, 0)do { if (conn->delayedAbortEvent) { rxevent_Cancel_1(conn->
delayedAbortEvent, ((void *)0), 0); conn->delayedAbortEvent
= ((void *)0); } } while(0);
1264 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2);
1265 if (packet) {
1266 MUTEX_ENTER(&conn->conn_data_lock);
1267 rxi_SendConnectionAbort(conn, packet, 0, 1);
1268 MUTEX_EXIT(&conn->conn_data_lock);
1269 rxi_FreePacket(packet);
1270 }
1271 }
1272
1273 /* Remove from connection hash table before proceeding */
1274 conn_ptr =
1275 &rx_connHashTable[CONN_HASH((((conn->cid)>>2)%rx_hashTableSize))
1276 (peer->host, peer->port, conn->cid, conn->epoch,((((conn->cid)>>2)%rx_hashTableSize))
1277 conn->type)((((conn->cid)>>2)%rx_hashTableSize))];
1278 for (; *conn_ptr; conn_ptr = &(*conn_ptr)->next) {
1279 if (*conn_ptr == conn) {
1280 *conn_ptr = conn->next;
1281 break;
1282 }
1283 }
1284 /* if the conn that we are destroying was the last connection, then we
1285 * clear rxLastConn as well */
1286 if (rxLastConn == conn)
1287 rxLastConn = 0;
1288
1289 /* Make sure the connection is completely reset before deleting it. */
1290 /* get rid of pending events that could zap us later */
1291 if (conn->challengeEvent)
1292 rxevent_Cancel(conn->challengeEvent, (struct rx_call *)0, 0)do { if (conn->challengeEvent) { rxevent_Cancel_1(conn->
challengeEvent, ((void *)0), 0); conn->challengeEvent = ((
void *)0); } } while(0);
1293 if (conn->checkReachEvent)
1294 rxevent_Cancel(conn->checkReachEvent, (struct rx_call *)0, 0)do { if (conn->checkReachEvent) { rxevent_Cancel_1(conn->
checkReachEvent, ((void *)0), 0); conn->checkReachEvent = (
(void *)0); } } while(0);
1295 if (conn->natKeepAliveEvent)
1296 rxevent_Cancel(conn->natKeepAliveEvent, (struct rx_call *)0, 0)do { if (conn->natKeepAliveEvent) { rxevent_Cancel_1(conn->
natKeepAliveEvent, ((void *)0), 0); conn->natKeepAliveEvent
= ((void *)0); } } while(0);
1297
1298 /* Add the connection to the list of destroyed connections that
1299 * need to be cleaned up. This is necessary to avoid deadlocks
1300 * in the routines we call to inform others that this connection is
1301 * being destroyed. */
1302 conn->next = rx_connCleanup_list;
1303 rx_connCleanup_list = conn;
1304}
1305
1306/* Externally available version */
1307void
1308rx_DestroyConnection(struct rx_connection *conn)
1309{
1310 SPLVAR;
1311
1312 NETPRI;
1313 rxi_DestroyConnection(conn);
1314 USERPRI;
1315}
1316
1317void
1318rx_GetConnection(struct rx_connection *conn)
1319{
1320 SPLVAR;
1321
1322 NETPRI;
1323 MUTEX_ENTER(&rx_refcnt_mutex);
1324 conn->refCount++;
1325 MUTEX_EXIT(&rx_refcnt_mutex);
1326 USERPRI;
1327}
1328
1329#ifdef AFS_GLOBAL_RXLOCK_KERNEL
1330/* Wait for the transmit queue to no longer be busy.
1331 * requires the call->lock to be held */
1332void
1333rxi_WaitforTQBusy(struct rx_call *call) {
1334 while (!call->error && (call->flags & RX_CALL_TQ_BUSY128)) {
1335 call->flags |= RX_CALL_TQ_WAIT1024;
1336 call->tqWaiters++;
1337#ifdef RX_ENABLE_LOCKS
1338 osirx_AssertMine(&call->lock, "rxi_WaitforTQ lock");
1339 CV_WAIT(&call->cv_tq, &call->lock);
1340#else /* RX_ENABLE_LOCKS */
1341 osi_rxSleep(&call->tq)rxi_Sleep(&call->tq);
1342#endif /* RX_ENABLE_LOCKS */
1343 call->tqWaiters--;
1344 if (call->tqWaiters == 0) {
1345 call->flags &= ~RX_CALL_TQ_WAIT1024;
1346 }
1347 }
1348}
1349#endif
1350
1351static void
1352rxi_WakeUpTransmitQueue(struct rx_call *call)
1353{
1354 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT1024)) {
1355 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",do { if (rx_debugFile) rxi_DebugPrint ("call %""p"" has %d waiters and flags %d\n"
, call, call->tqWaiters, call->flags); } while (0)
1356 call, call->tqWaiters, call->flags))do { if (rx_debugFile) rxi_DebugPrint ("call %""p"" has %d waiters and flags %d\n"
, call, call->tqWaiters, call->flags); } while (0);
1357#ifdef RX_ENABLE_LOCKS
1358 osirx_AssertMine(&call->lock, "rxi_Start start");
1359 CV_BROADCAST(&call->cv_tq);
1360#else /* RX_ENABLE_LOCKS */
1361 osi_rxWakeup(&call->tq)rxi_Wakeup(&call->tq);
1362#endif /* RX_ENABLE_LOCKS */
1363 }
1364}
1365
1366/* Start a new rx remote procedure call, on the specified connection.
1367 * If wait is set to 1, wait for a free call channel; otherwise return
1368 * 0. Maxtime gives the maximum number of seconds this call may take,
1369 * after rx_NewCall returns. After this time interval, a call to any
1370 * of rx_SendData, rx_ReadData, etc. will fail with RX_CALL_TIMEOUT.
1371 * For fine grain locking, we hold the conn_call_lock in order to
1372 * to ensure that we don't get signalle after we found a call in an active
1373 * state and before we go to sleep.
1374 */
1375struct rx_call *
1376rx_NewCall(struct rx_connection *conn)
1377{
1378 int i, wait, ignoreBusy = 1;
1379 struct rx_call *call;
1380 struct clock queueTime;
1381 afs_uint32 leastBusy = 0;
1382 SPLVAR;
1383
1384 clock_NewTime();
1385 dpf(("rx_NewCall(conn %"AFS_PTR_FMT")\n", conn))do { if (rx_debugFile) rxi_DebugPrint ("rx_NewCall(conn %""p"
")\n", conn); } while (0);
1386
1387 NETPRI;
1388 clock_GetTime(&queueTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&queueTime)->sec = (afs_int32)tv.tv_sec; (&queueTime
)->usec = (afs_int32)tv.tv_usec; } while(0);
1389 /*
1390 * Check if there are others waiting for a new call.
1391 * If so, let them go first to avoid starving them.
1392 * This is a fairly simple scheme, and might not be
1393 * a complete solution for large numbers of waiters.
1394 *
1395 * makeCallWaiters keeps track of the number of
1396 * threads waiting to make calls and the
1397 * RX_CONN_MAKECALL_WAITING flag bit is used to
1398 * indicate that there are indeed calls waiting.
1399 * The flag is set when the waiter is incremented.
1400 * It is only cleared when makeCallWaiters is 0.
1401 * This prevents us from accidently destroying the
1402 * connection while it is potentially about to be used.
1403 */
1404 MUTEX_ENTER(&conn->conn_call_lock);
1405 MUTEX_ENTER(&conn->conn_data_lock);
1406 while (conn->flags & RX_CONN_MAKECALL_ACTIVE128) {
1407 conn->flags |= RX_CONN_MAKECALL_WAITING1;
1408 conn->makeCallWaiters++;
1409 MUTEX_EXIT(&conn->conn_data_lock);
1410
1411#ifdef RX_ENABLE_LOCKS
1412 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1413#else
1414 osi_rxSleep(conn)rxi_Sleep(conn);
1415#endif
1416 MUTEX_ENTER(&conn->conn_data_lock);
1417 conn->makeCallWaiters--;
1418 if (conn->makeCallWaiters == 0)
1419 conn->flags &= ~RX_CONN_MAKECALL_WAITING1;
1420 }
1421
1422 /* We are now the active thread in rx_NewCall */
1423 conn->flags |= RX_CONN_MAKECALL_ACTIVE128;
1424 MUTEX_EXIT(&conn->conn_data_lock);
1425
1426 for (;;) {
1427 wait = 1;
1428
1429 for (i = 0; i < RX_MAXCALLS4; i++) {
1430 call = conn->call[i];
1431 if (call) {
1432 if (!ignoreBusy && conn->lastBusy[i] != leastBusy) {
1433 /* we're not ignoring busy call slots; only look at the
1434 * call slot that is the "least" busy */
1435 continue;
1436 }
1437
1438 if (call->state == RX_STATE_DALLY3) {
1439 MUTEX_ENTER(&call->lock);
1440 if (call->state == RX_STATE_DALLY3) {
1441 if (ignoreBusy && conn->lastBusy[i]) {
1442 /* if we're ignoring busy call slots, skip any ones that
1443 * have lastBusy set */
1444 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1445 leastBusy = conn->lastBusy[i];
1446 }
1447 MUTEX_EXIT(&call->lock);
1448 continue;
1449 }
1450
1451 /*
1452 * We are setting the state to RX_STATE_RESET to
1453 * ensure that no one else will attempt to use this
1454 * call once we drop the conn->conn_call_lock and
1455 * call->lock. We must drop the conn->conn_call_lock
1456 * before calling rxi_ResetCall because the process
1457 * of clearing the transmit queue can block for an
1458 * extended period of time. If we block while holding
1459 * the conn->conn_call_lock, then all rx_EndCall
1460 * processing will block as well. This has a detrimental
1461 * effect on overall system performance.
1462 */
1463 call->state = RX_STATE_RESET5;
1464 MUTEX_EXIT(&conn->conn_call_lock);
1465 MUTEX_ENTER(&rx_refcnt_mutex);
1466 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1467 MUTEX_EXIT(&rx_refcnt_mutex);
1468 rxi_ResetCall(call, 0);
1469 (*call->callNumber)++;
1470 if (MUTEX_TRYENTER(&conn->conn_call_lock)1)
1471 break;
1472
1473 /*
1474 * If we failed to be able to safely obtain the
1475 * conn->conn_call_lock we will have to drop the
1476 * call->lock to avoid a deadlock. When the call->lock
1477 * is released the state of the call can change. If it
1478 * is no longer RX_STATE_RESET then some other thread is
1479 * using the call.
1480 */
1481 MUTEX_EXIT(&call->lock);
1482 MUTEX_ENTER(&conn->conn_call_lock);
1483 MUTEX_ENTER(&call->lock);
1484
1485 if (call->state == RX_STATE_RESET5)
1486 break;
1487
1488 /*
1489 * If we get here it means that after dropping
1490 * the conn->conn_call_lock and call->lock that
1491 * the call is no longer ours. If we can't find
1492 * a free call in the remaining slots we should
1493 * not go immediately to RX_CONN_MAKECALL_WAITING
1494 * because by dropping the conn->conn_call_lock
1495 * we have given up synchronization with rx_EndCall.
1496 * Instead, cycle through one more time to see if
1497 * we can find a call that can call our own.
1498 */
1499 MUTEX_ENTER(&rx_refcnt_mutex);
1500 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
1501 MUTEX_EXIT(&rx_refcnt_mutex);
1502 wait = 0;
1503 }
1504 MUTEX_EXIT(&call->lock);
1505 }
1506 } else {
1507 if (ignoreBusy && conn->lastBusy[i]) {
1508 /* if we're ignoring busy call slots, skip any ones that
1509 * have lastBusy set */
1510 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1511 leastBusy = conn->lastBusy[i];
1512 }
1513 continue;
1514 }
1515
1516 /* rxi_NewCall returns with mutex locked */
1517 call = rxi_NewCall(conn, i);
1518 MUTEX_ENTER(&rx_refcnt_mutex);
1519 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1520 MUTEX_EXIT(&rx_refcnt_mutex);
1521 break;
1522 }
1523 }
1524 if (i < RX_MAXCALLS4) {
1525 conn->lastBusy[i] = 0;
1526 break;
1527 }
1528 if (!wait)
1529 continue;
1530 if (leastBusy && ignoreBusy) {
1531 /* we didn't find a useable call slot, but we did see at least one
1532 * 'busy' slot; look again and only use a slot with the 'least
1533 * busy time */
1534 ignoreBusy = 0;
1535 continue;
1536 }
1537
1538 MUTEX_ENTER(&conn->conn_data_lock);
1539 conn->flags |= RX_CONN_MAKECALL_WAITING1;
1540 conn->makeCallWaiters++;
1541 MUTEX_EXIT(&conn->conn_data_lock);
1542
1543#ifdef RX_ENABLE_LOCKS
1544 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1545#else
1546 osi_rxSleep(conn)rxi_Sleep(conn);
1547#endif
1548 MUTEX_ENTER(&conn->conn_data_lock);
1549 conn->makeCallWaiters--;
1550 if (conn->makeCallWaiters == 0)
1551 conn->flags &= ~RX_CONN_MAKECALL_WAITING1;
1552 MUTEX_EXIT(&conn->conn_data_lock);
1553 }
1554 /* Client is initially in send mode */
1555 call->state = RX_STATE_ACTIVE2;
1556 call->error = conn->error;
1557 if (call->error)
1558 call->mode = RX_MODE_ERROR3;
1559 else
1560 call->mode = RX_MODE_SENDING1;
1561
1562 /* remember start time for call in case we have hard dead time limit */
1563 call->queueTime = queueTime;
1564 clock_GetTime(&call->startTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->startTime)->sec = (afs_int32)tv.tv_sec; (&
call->startTime)->usec = (afs_int32)tv.tv_usec; } while
(0);
1565 hzero(call->bytesSent)((call->bytesSent).low = 0, (call->bytesSent).high = 0);
1566 hzero(call->bytesRcvd)((call->bytesRcvd).low = 0, (call->bytesRcvd).high = 0);
1567
1568 /* Turn on busy protocol. */
1569 rxi_KeepAliveOn(call);
1570
1571 /* Attempt MTU discovery */
1572 rxi_GrowMTUOn(call);
1573
1574 /*
1575 * We are no longer the active thread in rx_NewCall
1576 */
1577 MUTEX_ENTER(&conn->conn_data_lock);
1578 conn->flags &= ~RX_CONN_MAKECALL_ACTIVE128;
1579 MUTEX_EXIT(&conn->conn_data_lock);
1580
1581 /*
1582 * Wake up anyone else who might be giving us a chance to
1583 * run (see code above that avoids resource starvation).
1584 */
1585#ifdef RX_ENABLE_LOCKS
1586 CV_BROADCAST(&conn->conn_call_cv);
1587#else
1588 osi_rxWakeup(conn)rxi_Wakeup(conn);
1589#endif
1590 MUTEX_EXIT(&conn->conn_call_lock);
1591
1592#ifdef AFS_GLOBAL_RXLOCK_KERNEL
1593 if (call->flags & (RX_CALL_TQ_BUSY128 | RX_CALL_TQ_CLEARME256)) {
1594 osi_Panic("rx_NewCall call about to be used without an empty tq");
1595 }
1596#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
1597
1598 MUTEX_EXIT(&call->lock);
1599 USERPRI;
1600
1601 dpf(("rx_NewCall(call %"AFS_PTR_FMT")\n", call))do { if (rx_debugFile) rxi_DebugPrint ("rx_NewCall(call %""p"
")\n", call); } while (0);
1602 return call;
1603}
1604
1605static int
1606rxi_HasActiveCalls(struct rx_connection *aconn)
1607{
1608 int i;
1609 struct rx_call *tcall;
1610 SPLVAR;
1611
1612 NETPRI;
1613 for (i = 0; i < RX_MAXCALLS4; i++) {
1614 if ((tcall = aconn->call[i])) {
1615 if ((tcall->state == RX_STATE_ACTIVE2)
1616 || (tcall->state == RX_STATE_PRECALL1)) {
1617 USERPRI;
1618 return 1;
1619 }
1620 }
1621 }
1622 USERPRI;
1623 return 0;
1624}
1625
1626int
1627rxi_GetCallNumberVector(struct rx_connection *aconn,
1628 afs_int32 * aint32s)
1629{
1630 int i;
1631 struct rx_call *tcall;
1632 SPLVAR;
1633
1634 NETPRI;
1635 for (i = 0; i < RX_MAXCALLS4; i++) {
1636 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY3))
1637 aint32s[i] = aconn->callNumber[i] + 1;
1638 else
1639 aint32s[i] = aconn->callNumber[i];
1640 }
1641 USERPRI;
1642 return 0;
1643}
1644
1645int
1646rxi_SetCallNumberVector(struct rx_connection *aconn,
1647 afs_int32 * aint32s)
1648{
1649 int i;
1650 struct rx_call *tcall;
1651 SPLVAR;
1652
1653 NETPRI;
1654 for (i = 0; i < RX_MAXCALLS4; i++) {
1655 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY3))
1656 aconn->callNumber[i] = aint32s[i] - 1;
1657 else
1658 aconn->callNumber[i] = aint32s[i];
1659 }
1660 USERPRI;
1661 return 0;
1662}
1663
1664/* Advertise a new service. A service is named locally by a UDP port
1665 * number plus a 16-bit service id. Returns (struct rx_service *) 0
1666 * on a failure.
1667 *
1668 char *serviceName; Name for identification purposes (e.g. the
1669 service name might be used for probing for
1670 statistics) */
1671struct rx_service *
1672rx_NewServiceHost(afs_uint32 host, u_short port, u_short serviceId,
1673 char *serviceName, struct rx_securityClass **securityObjects,
1674 int nSecurityObjects,
1675 afs_int32(*serviceProc) (struct rx_call * acall))
1676{
1677 osi_socket socket = OSI_NULLSOCKET((osi_socket) -1);
1678 struct rx_service *tservice;
1679 int i;
1680 SPLVAR;
1681
1682 clock_NewTime();
1683
1684 if (serviceId == 0) {
1685 (osi_Msgfprintf)(__stderrp,
1686 "rx_NewService: service id for service %s is not non-zero.\n",
1687 serviceName);
1688 return 0;
1689 }
1690 if (port == 0) {
1691 if (rx_port == 0) {
1692 (osi_Msgfprintf)(__stderrp,
1693 "rx_NewService: A non-zero port must be specified on this call if a non-zero port was not provided at Rx initialization (service %s).\n",
1694 serviceName);
1695 return 0;
1696 }
1697 port = rx_port;
1698 socket = rx_socket;
1699 }
1700
1701 tservice = rxi_AllocService()rxi_Alloc(sizeof(struct rx_service));
1702 NETPRI;
1703
1704#ifdef RX_ENABLE_LOCKS
1705 MUTEX_INIT(&tservice->svc_data_lock, "svc data lock", MUTEX_DEFAULT, 0);
1706#endif
1707
1708 for (i = 0; i < RX_MAX_SERVICES20; i++) {
1709 struct rx_service *service = rx_services[i];
1710 if (service) {
1711 if (port == service->servicePort && host == service->serviceHost) {
1712 if (service->serviceId == serviceId) {
1713 /* The identical service has already been
1714 * installed; if the caller was intending to
1715 * change the security classes used by this
1716 * service, he/she loses. */
1717 (osi_Msgfprintf)(__stderrp,
1718 "rx_NewService: tried to install service %s with service id %d, which is already in use for service %s\n",
1719 serviceName, serviceId, service->serviceName);
1720 USERPRI;
1721 rxi_FreeService(tservice)do { ; rxi_Free((tservice), sizeof(struct rx_service)); } while
(0);
1722 return service;
1723 }
1724 /* Different service, same port: re-use the socket
1725 * which is bound to the same port */
1726 socket = service->socket;
1727 }
1728 } else {
1729 if (socket == OSI_NULLSOCKET((osi_socket) -1)) {
1730 /* If we don't already have a socket (from another
1731 * service on same port) get a new one */
1732 socket = rxi_GetHostUDPSocket(host, port);
1733 if (socket == OSI_NULLSOCKET((osi_socket) -1)) {
1734 USERPRI;
1735 rxi_FreeService(tservice)do { ; rxi_Free((tservice), sizeof(struct rx_service)); } while
(0);
1736 return 0;
1737 }
1738 }
1739 service = tservice;
1740 service->socket = socket;
1741 service->serviceHost = host;
1742 service->servicePort = port;
1743 service->serviceId = serviceId;
1744 service->serviceName = serviceName;
1745 service->nSecurityObjects = nSecurityObjects;
1746 service->securityObjects = securityObjects;
1747 service->minProcs = 0;
1748 service->maxProcs = 1;
1749 service->idleDeadTime = 60;
1750 service->idleDeadErr = 0;
1751 service->connDeadTime = rx_connDeadTime;
1752 service->executeRequestProc = serviceProc;
1753 service->checkReach = 0;
1754 service->nSpecific = 0;
1755 service->specific = NULL((void *)0);
1756 rx_services[i] = service; /* not visible until now */
1757 USERPRI;
1758 return service;
1759 }
1760 }
1761 USERPRI;
1762 rxi_FreeService(tservice)do { ; rxi_Free((tservice), sizeof(struct rx_service)); } while
(0);
1763 (osi_Msgfprintf)(__stderrp, "rx_NewService: cannot support > %d services\n",
1764 RX_MAX_SERVICES20);
1765 return 0;
1766}
1767
1768/* Set configuration options for all of a service's security objects */
1769
1770afs_int32
1771rx_SetSecurityConfiguration(struct rx_service *service,
1772 rx_securityConfigVariables type,
1773 void *value)
1774{
1775 int i;
1776 for (i = 0; i<service->nSecurityObjects; i++) {
1777 if (service->securityObjects[i]) {
1778 RXS_SetConfiguration(service->securityObjects[i], NULL, type,((service->securityObjects[i] && (service->securityObjects
[i]->ops->op_SetConfiguration)) ? (*(service->securityObjects
[i])->ops->op_SetConfiguration)(service->securityObjects
[i],((void *)0),type,value,((void *)0)) : 0)
1779 value, NULL)((service->securityObjects[i] && (service->securityObjects
[i]->ops->op_SetConfiguration)) ? (*(service->securityObjects
[i])->ops->op_SetConfiguration)(service->securityObjects
[i],((void *)0),type,value,((void *)0)) : 0);
1780 }
1781 }
1782 return 0;
1783}
1784
1785struct rx_service *
1786rx_NewService(u_short port, u_short serviceId, char *serviceName,
1787 struct rx_securityClass **securityObjects, int nSecurityObjects,
1788 afs_int32(*serviceProc) (struct rx_call * acall))
1789{
1790 return rx_NewServiceHost(htonl(INADDR_ANY)(__builtin_constant_p((u_int32_t)0x00000000) ? ((((__uint32_t
)((u_int32_t)0x00000000)) >> 24) | ((((__uint32_t)((u_int32_t
)0x00000000)) & (0xff << 16)) >> 8) | ((((__uint32_t
)((u_int32_t)0x00000000)) & (0xff << 8)) << 8
) | (((__uint32_t)((u_int32_t)0x00000000)) << 24)) : __bswap32_var
((u_int32_t)0x00000000)), port, serviceId, serviceName, securityObjects, nSecurityObjects, serviceProc);
1791}
1792
1793/* Generic request processing loop. This routine should be called
1794 * by the implementation dependent rx_ServerProc. If socketp is
1795 * non-null, it will be set to the file descriptor that this thread
1796 * is now listening on. If socketp is null, this routine will never
1797 * returns. */
1798void
1799rxi_ServerProc(int threadID, struct rx_call *newcall, osi_socket * socketp)
1800{
1801 struct rx_call *call;
1802 afs_int32 code;
1803 struct rx_service *tservice = NULL((void *)0);
1804
1805 for (;;) {
1806 if (newcall) {
1807 call = newcall;
1808 newcall = NULL((void *)0);
1809 } else {
1810 call = rx_GetCall(threadID, tservice, socketp);
1811 if (socketp && *socketp != OSI_NULLSOCKET((osi_socket) -1)) {
1812 /* We are now a listener thread */
1813 return;
1814 }
1815 }
1816
1817 /* if server is restarting( typically smooth shutdown) then do not
1818 * allow any new calls.
1819 */
1820
1821 if (rx_tranquil && (call != NULL((void *)0))) {
1822 SPLVAR;
1823
1824 NETPRI;
1825 MUTEX_ENTER(&call->lock);
1826
1827 rxi_CallError(call, RX_RESTARTING(-100));
1828 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1829
1830 MUTEX_EXIT(&call->lock);
1831 USERPRI;
1832 }
1833#ifdef KERNEL
1834 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1835#ifdef RX_ENABLE_LOCKS
1836 AFS_GLOCK();
1837#endif /* RX_ENABLE_LOCKS */
1838 afs_termState = AFSOP_STOP_AFS;
1839 afs_osi_Wakeup(&afs_termState);
1840#ifdef RX_ENABLE_LOCKS
1841 AFS_GUNLOCK();
1842#endif /* RX_ENABLE_LOCKS */
1843 return;
1844 }
1845#endif
1846
1847 tservice = call->conn->service;
1848
1849 if (tservice->beforeProc)
1850 (*tservice->beforeProc) (call);
1851
1852 code = tservice->executeRequestProc(call);
1853
1854 if (tservice->afterProc)
1855 (*tservice->afterProc) (call, code);
1856
1857 rx_EndCall(call, code);
1858 if (rx_stats_active) {
1859 MUTEX_ENTER(&rx_stats_mutex);
1860 rxi_nCalls++;
1861 MUTEX_EXIT(&rx_stats_mutex);
1862 }
1863 }
1864}
1865
1866
1867void
1868rx_WakeupServerProcs(void)
1869{
1870 struct rx_serverQueueEntry *np, *tqp;
1871 SPLVAR;
1872
1873 NETPRI;
1874 MUTEX_ENTER(&rx_serverPool_lock);
1875
1876#ifdef RX_ENABLE_LOCKS
1877 if (rx_waitForPacket)
1878 CV_BROADCAST(&rx_waitForPacket->cv);
1879#else /* RX_ENABLE_LOCKS */
1880 if (rx_waitForPacket)
1881 osi_rxWakeup(rx_waitForPacket)rxi_Wakeup(rx_waitForPacket);
1882#endif /* RX_ENABLE_LOCKS */
1883 MUTEX_ENTER(&freeSQEList_lock);
1884 for (np = rx_FreeSQEList; np; np = tqp) {
1885 tqp = *(struct rx_serverQueueEntry **)np;
1886#ifdef RX_ENABLE_LOCKS
1887 CV_BROADCAST(&np->cv);
1888#else /* RX_ENABLE_LOCKS */
1889 osi_rxWakeup(np)rxi_Wakeup(np);
1890#endif /* RX_ENABLE_LOCKS */
1891 }
1892 MUTEX_EXIT(&freeSQEList_lock);
1893 for (queue_Scan(&rx_idleServerQueue, np, tqp, rx_serverQueueEntry)(np) = ((struct rx_serverQueueEntry *)((struct rx_queue *)(&
rx_idleServerQueue))->next), tqp = ((struct rx_serverQueueEntry
*)((struct rx_queue *)(np))->next); !(((struct rx_queue *
)(&rx_idleServerQueue)) == ((struct rx_queue *)(np))); (np
) = (tqp), tqp = ((struct rx_serverQueueEntry *)((struct rx_queue
*)(np))->next)) {
1894#ifdef RX_ENABLE_LOCKS
1895 CV_BROADCAST(&np->cv);
1896#else /* RX_ENABLE_LOCKS */
1897 osi_rxWakeup(np)rxi_Wakeup(np);
1898#endif /* RX_ENABLE_LOCKS */
1899 }
1900 MUTEX_EXIT(&rx_serverPool_lock);
1901 USERPRI;
1902}
1903
1904/* meltdown:
1905 * One thing that seems to happen is that all the server threads get
1906 * tied up on some empty or slow call, and then a whole bunch of calls
1907 * arrive at once, using up the packet pool, so now there are more
1908 * empty calls. The most critical resources here are server threads
1909 * and the free packet pool. The "doreclaim" code seems to help in
1910 * general. I think that eventually we arrive in this state: there
1911 * are lots of pending calls which do have all their packets present,
1912 * so they won't be reclaimed, are multi-packet calls, so they won't
1913 * be scheduled until later, and thus are tying up most of the free
1914 * packet pool for a very long time.
1915 * future options:
1916 * 1. schedule multi-packet calls if all the packets are present.
1917 * Probably CPU-bound operation, useful to return packets to pool.
1918 * Do what if there is a full window, but the last packet isn't here?
1919 * 3. preserve one thread which *only* runs "best" calls, otherwise
1920 * it sleeps and waits for that type of call.
1921 * 4. Don't necessarily reserve a whole window for each thread. In fact,
1922 * the current dataquota business is badly broken. The quota isn't adjusted
1923 * to reflect how many packets are presently queued for a running call.
1924 * So, when we schedule a queued call with a full window of packets queued
1925 * up for it, that *should* free up a window full of packets for other 2d-class
1926 * calls to be able to use from the packet pool. But it doesn't.
1927 *
1928 * NB. Most of the time, this code doesn't run -- since idle server threads
1929 * sit on the idle server queue and are assigned by "...ReceivePacket" as soon
1930 * as a new call arrives.
1931 */
1932/* Sleep until a call arrives. Returns a pointer to the call, ready
1933 * for an rx_Read. */
1934#ifdef RX_ENABLE_LOCKS
1935struct rx_call *
1936rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
1937{
1938 struct rx_serverQueueEntry *sq;
1939 struct rx_call *call = (struct rx_call *)0;
1940 struct rx_service *service = NULL((void *)0);
1941
1942 MUTEX_ENTER(&freeSQEList_lock);
1943
1944 if ((sq = rx_FreeSQEList)) {
1945 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
1946 MUTEX_EXIT(&freeSQEList_lock);
1947 } else { /* otherwise allocate a new one and return that */
1948 MUTEX_EXIT(&freeSQEList_lock);
1949 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
1950 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
1951 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
1952 }
1953
1954 MUTEX_ENTER(&rx_serverPool_lock);
1955 if (cur_service != NULL((void *)0)) {
1956 ReturnToServerPool(cur_service);
1957 }
1958 while (1) {
1959 if (queue_IsNotEmpty(&rx_incomingCallQueue)(((struct rx_queue *)(&rx_incomingCallQueue))->next !=
((struct rx_queue *)(&rx_incomingCallQueue)))) {
1960 struct rx_call *tcall, *ncall, *choice2 = NULL((void *)0);
1961
1962 /* Scan for eligible incoming calls. A call is not eligible
1963 * if the maximum number of calls for its service type are
1964 * already executing */
1965 /* One thread will process calls FCFS (to prevent starvation),
1966 * while the other threads may run ahead looking for calls which
1967 * have all their input data available immediately. This helps
1968 * keep threads from blocking, waiting for data from the client. */
1969 for (queue_Scan(&rx_incomingCallQueue, tcall, ncall, rx_call)(tcall) = ((struct rx_call *)((struct rx_queue *)(&rx_incomingCallQueue
))->next), ncall = ((struct rx_call *)((struct rx_queue *)
(tcall))->next); !(((struct rx_queue *)(&rx_incomingCallQueue
)) == ((struct rx_queue *)(tcall))); (tcall) = (ncall), ncall
= ((struct rx_call *)((struct rx_queue *)(tcall))->next)) {
1970 service = tcall->conn->service;
1971 if (!QuotaOK(service)) {
1972 continue;
1973 }
1974 MUTEX_ENTER(&rx_pthread_mutex);
1975 if (tno == rxi_fcfs_thread_num(0)
1976 || !tcall->queue_item_header.next) {
1977 MUTEX_EXIT(&rx_pthread_mutex);
1978 /* If we're the fcfs thread , then we'll just use
1979 * this call. If we haven't been able to find an optimal
1980 * choice, and we're at the end of the list, then use a
1981 * 2d choice if one has been identified. Otherwise... */
1982 call = (choice2 ? choice2 : tcall);
1983 service = call->conn->service;
1984 } else {
1985 MUTEX_EXIT(&rx_pthread_mutex);
1986 if (!queue_IsEmpty(&tcall->rq)(((struct rx_queue *)(&tcall->rq))->next == ((struct
rx_queue *)(&tcall->rq)))) {
1987 struct rx_packet *rp;
1988 rp = queue_First(&tcall->rq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&tcall->rq))
->next);
1989 if (rp->header.seq == 1) {
1990 if (!meltdown_1pkt
1991 || (rp->header.flags & RX_LAST_PACKET4)) {
1992 call = tcall;
1993 } else if (rxi_2dchoice && !choice2
1994 && !(tcall->flags & RX_CALL_CLEARED64)
1995 && (tcall->rprev > rxi_HardAckRate)) {
1996 choice2 = tcall;
1997 } else
1998 rxi_md2cnt++;
1999 }
2000 }
2001 }
2002 if (call) {
2003 break;
2004 } else {
2005 ReturnToServerPool(service);
2006 }
2007 }
2008 }
2009
2010 if (call) {
2011 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
2012 MUTEX_EXIT(&rx_serverPool_lock);
2013 MUTEX_ENTER(&call->lock);
2014
2015 if (call->flags & RX_CALL_WAIT_PROC16) {
2016 call->flags &= ~RX_CALL_WAIT_PROC16;
2017 rx_atomic_dec(&rx_nWaiting);
2018 }
2019
2020 if (call->state != RX_STATE_PRECALL1 || call->error) {
2021 MUTEX_EXIT(&call->lock);
2022 MUTEX_ENTER(&rx_serverPool_lock);
2023 ReturnToServerPool(service);
2024 call = NULL((void *)0);
2025 continue;
2026 }
2027
2028 if (queue_IsEmpty(&call->rq)(((struct rx_queue *)(&call->rq))->next == ((struct
rx_queue *)(&call->rq)))
2029 || queue_First(&call->rq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&call->rq))->
next)->header.seq != 1)
2030 rxi_SendAck(call, 0, 0, RX_ACK_DELAY8, 0);
2031
2032 CLEAR_CALL_QUEUE_LOCK(call);
2033 break;
2034 } else {
2035 /* If there are no eligible incoming calls, add this process
2036 * to the idle server queue, to wait for one */
2037 sq->newcall = 0;
2038 sq->tno = tno;
2039 if (socketp) {
2040 *socketp = OSI_NULLSOCKET((osi_socket) -1);
2041 }
2042 sq->socketp = socketp;
2043 queue_Append(&rx_idleServerQueue, sq)(((((struct rx_queue *)(sq))->prev=((struct rx_queue *)(&
rx_idleServerQueue))->prev)->next=((struct rx_queue *)(
sq)))->next=((struct rx_queue *)(&rx_idleServerQueue))
, ((struct rx_queue *)(&rx_idleServerQueue))->prev=((struct
rx_queue *)(sq)));
2044#ifndef AFS_AIX41_ENV
2045 rx_waitForPacket = sq;
2046#else
2047 rx_waitingForPacket = sq;
2048#endif /* AFS_AIX41_ENV */
2049 do {
2050 CV_WAIT(&sq->cv, &rx_serverPool_lock);
2051#ifdef KERNEL
2052 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2053 MUTEX_EXIT(&rx_serverPool_lock);
2054 return (struct rx_call *)0;
2055 }
2056#endif
2057 } while (!(call = sq->newcall)
2058 && !(socketp && *socketp != OSI_NULLSOCKET((osi_socket) -1)));
2059 MUTEX_EXIT(&rx_serverPool_lock);
2060 if (call) {
2061 MUTEX_ENTER(&call->lock);
2062 }
2063 break;
2064 }
2065 }
2066
2067 MUTEX_ENTER(&freeSQEList_lock);
2068 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2069 rx_FreeSQEList = sq;
2070 MUTEX_EXIT(&freeSQEList_lock);
2071
2072 if (call) {
2073 clock_GetTime(&call->startTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->startTime)->sec = (afs_int32)tv.tv_sec; (&
call->startTime)->usec = (afs_int32)tv.tv_usec; } while
(0);
2074 call->state = RX_STATE_ACTIVE2;
2075 call->mode = RX_MODE_RECEIVING2;
2076#ifdef RX_KERNEL_TRACE
2077 if (ICL_SETACTIVE(afs_iclSetp)) {
2078 int glockOwner = ISAFS_GLOCK();
2079 if (!glockOwner)
2080 AFS_GLOCK();
2081 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2082 __FILE__"rx.c", ICL_TYPE_INT32, __LINE__2082, ICL_TYPE_POINTER,
2083 call);
2084 if (!glockOwner)
2085 AFS_GUNLOCK();
2086 }
2087#endif
2088
2089 rxi_calltrace(RX_CALL_START1, call);
2090 dpf(("rx_GetCall(port=%d, service=%d) ==> call %"AFS_PTR_FMT"\n",do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(port=%d, service=%d) ==> call %"
"p""\n", call->conn->service->servicePort, call->
conn->service->serviceId, call); } while (0)
2091 call->conn->service->servicePort, call->conn->service->serviceId,do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(port=%d, service=%d) ==> call %"
"p""\n", call->conn->service->servicePort, call->
conn->service->serviceId, call); } while (0)
2092 call))do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(port=%d, service=%d) ==> call %"
"p""\n", call->conn->service->servicePort, call->
conn->service->serviceId, call); } while (0);
2093
2094 MUTEX_EXIT(&call->lock);
2095 MUTEX_ENTER(&rx_refcnt_mutex);
2096 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
2097 MUTEX_EXIT(&rx_refcnt_mutex);
2098 } else {
2099 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp))do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(socketp=%p, *socketp=0x%x)\n"
, socketp, *socketp); } while (0);
2100 }
2101
2102 return call;
2103}
2104#else /* RX_ENABLE_LOCKS */
2105struct rx_call *
2106rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2107{
2108 struct rx_serverQueueEntry *sq;
2109 struct rx_call *call = (struct rx_call *)0, *choice2;
2110 struct rx_service *service = NULL((void *)0);
2111 SPLVAR;
2112
2113 NETPRI;
2114 MUTEX_ENTER(&freeSQEList_lock);
2115
2116 if ((sq = rx_FreeSQEList)) {
2117 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2118 MUTEX_EXIT(&freeSQEList_lock);
2119 } else { /* otherwise allocate a new one and return that */
2120 MUTEX_EXIT(&freeSQEList_lock);
2121 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2122 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2123 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2124 }
2125 MUTEX_ENTER(&sq->lock);
2126
2127 if (cur_service != NULL((void *)0)) {
2128 cur_service->nRequestsRunning--;
2129 MUTEX_ENTER(&rx_quota_mutex);
2130 if (cur_service->nRequestsRunning < cur_service->minProcs)
2131 rxi_minDeficit++;
2132 rxi_availProcs++;
2133 MUTEX_EXIT(&rx_quota_mutex);
2134 }
2135 if (queue_IsNotEmpty(&rx_incomingCallQueue)(((struct rx_queue *)(&rx_incomingCallQueue))->next !=
((struct rx_queue *)(&rx_incomingCallQueue)))) {
2136 struct rx_call *tcall, *ncall;
2137 /* Scan for eligible incoming calls. A call is not eligible
2138 * if the maximum number of calls for its service type are
2139 * already executing */
2140 /* One thread will process calls FCFS (to prevent starvation),
2141 * while the other threads may run ahead looking for calls which
2142 * have all their input data available immediately. This helps
2143 * keep threads from blocking, waiting for data from the client. */
2144 choice2 = (struct rx_call *)0;
2145 for (queue_Scan(&rx_incomingCallQueue, tcall, ncall, rx_call)(tcall) = ((struct rx_call *)((struct rx_queue *)(&rx_incomingCallQueue
))->next), ncall = ((struct rx_call *)((struct rx_queue *)
(tcall))->next); !(((struct rx_queue *)(&rx_incomingCallQueue
)) == ((struct rx_queue *)(tcall))); (tcall) = (ncall), ncall
= ((struct rx_call *)((struct rx_queue *)(tcall))->next)) {
2146 service = tcall->conn->service;
2147 if (QuotaOK(service)) {
2148 MUTEX_ENTER(&rx_pthread_mutex);
2149 if (tno == rxi_fcfs_thread_num(0)
2150 || !tcall->queue_item_header.next) {
2151 MUTEX_EXIT(&rx_pthread_mutex);
2152 /* If we're the fcfs thread, then we'll just use
2153 * this call. If we haven't been able to find an optimal
2154 * choice, and we're at the end of the list, then use a
2155 * 2d choice if one has been identified. Otherwise... */
2156 call = (choice2 ? choice2 : tcall);
2157 service = call->conn->service;
2158 } else {
2159 MUTEX_EXIT(&rx_pthread_mutex);
2160 if (!queue_IsEmpty(&tcall->rq)(((struct rx_queue *)(&tcall->rq))->next == ((struct
rx_queue *)(&tcall->rq)))) {
2161 struct rx_packet *rp;
2162 rp = queue_First(&tcall->rq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&tcall->rq))
->next);
2163 if (rp->header.seq == 1
2164 && (!meltdown_1pkt
2165 || (rp->header.flags & RX_LAST_PACKET4))) {
2166 call = tcall;
2167 } else if (rxi_2dchoice && !choice2
2168 && !(tcall->flags & RX_CALL_CLEARED64)
2169 && (tcall->rprev > rxi_HardAckRate)) {
2170 choice2 = tcall;
2171 } else
2172 rxi_md2cnt++;
2173 }
2174 }
2175 }
2176 if (call)
2177 break;
2178 }
2179 }
2180
2181 if (call) {
2182 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
2183 /* we can't schedule a call if there's no data!!! */
2184 /* send an ack if there's no data, if we're missing the
2185 * first packet, or we're missing something between first
2186 * and last -- there's a "hole" in the incoming data. */
2187 if (queue_IsEmpty(&call->rq)(((struct rx_queue *)(&call->rq))->next == ((struct
rx_queue *)(&call->rq)))
2188 || queue_First(&call->rq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&call->rq))->
next)->header.seq != 1
2189 || call->rprev != queue_Last(&call->rq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&call->rq))->
prev)->header.seq)
2190 rxi_SendAck(call, 0, 0, RX_ACK_DELAY8, 0);
2191
2192 call->flags &= (~RX_CALL_WAIT_PROC16);
2193 service->nRequestsRunning++;
2194 /* just started call in minProcs pool, need fewer to maintain
2195 * guarantee */
2196 MUTEX_ENTER(&rx_quota_mutex);
2197 if (service->nRequestsRunning <= service->minProcs)
2198 rxi_minDeficit--;
2199 rxi_availProcs--;
2200 MUTEX_EXIT(&rx_quota_mutex);
2201 rx_atomic_dec(&rx_nWaiting);
2202 /* MUTEX_EXIT(&call->lock); */
2203 } else {
2204 /* If there are no eligible incoming calls, add this process
2205 * to the idle server queue, to wait for one */
2206 sq->newcall = 0;
2207 if (socketp) {
2208 *socketp = OSI_NULLSOCKET((osi_socket) -1);
2209 }
2210 sq->socketp = socketp;
2211 queue_Append(&rx_idleServerQueue, sq)(((((struct rx_queue *)(sq))->prev=((struct rx_queue *)(&
rx_idleServerQueue))->prev)->next=((struct rx_queue *)(
sq)))->next=((struct rx_queue *)(&rx_idleServerQueue))
, ((struct rx_queue *)(&rx_idleServerQueue))->prev=((struct
rx_queue *)(sq)));
2212 do {
2213 osi_rxSleep(sq)rxi_Sleep(sq);
2214#ifdef KERNEL
2215 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2216 USERPRI;
2217 rxi_Free(sq, sizeof(struct rx_serverQueueEntry));
2218 return (struct rx_call *)0;
2219 }
2220#endif
2221 } while (!(call = sq->newcall)
2222 && !(socketp && *socketp != OSI_NULLSOCKET((osi_socket) -1)));
2223 }
2224 MUTEX_EXIT(&sq->lock);
2225
2226 MUTEX_ENTER(&freeSQEList_lock);
2227 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2228 rx_FreeSQEList = sq;
2229 MUTEX_EXIT(&freeSQEList_lock);
2230
2231 if (call) {
2232 clock_GetTime(&call->startTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->startTime)->sec = (afs_int32)tv.tv_sec; (&
call->startTime)->usec = (afs_int32)tv.tv_usec; } while
(0);
2233 call->state = RX_STATE_ACTIVE2;
2234 call->mode = RX_MODE_RECEIVING2;
2235#ifdef RX_KERNEL_TRACE
2236 if (ICL_SETACTIVE(afs_iclSetp)) {
2237 int glockOwner = ISAFS_GLOCK();
2238 if (!glockOwner)
2239 AFS_GLOCK();
2240 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2241 __FILE__"rx.c", ICL_TYPE_INT32, __LINE__2241, ICL_TYPE_POINTER,
2242 call);
2243 if (!glockOwner)
2244 AFS_GUNLOCK();
2245 }
2246#endif
2247
2248 rxi_calltrace(RX_CALL_START1, call);
2249 dpf(("rx_GetCall(port=%d, service=%d) ==> call %p\n",do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(port=%d, service=%d) ==> call %p\n"
, call->conn->service->servicePort, call->conn->
service->serviceId, call); } while (0)
2250 call->conn->service->servicePort, call->conn->service->serviceId,do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(port=%d, service=%d) ==> call %p\n"
, call->conn->service->servicePort, call->conn->
service->serviceId, call); } while (0)
2251 call))do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(port=%d, service=%d) ==> call %p\n"
, call->conn->service->servicePort, call->conn->
service->serviceId, call); } while (0);
2252 } else {
2253 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp))do { if (rx_debugFile) rxi_DebugPrint ("rx_GetCall(socketp=%p, *socketp=0x%x)\n"
, socketp, *socketp); } while (0);
2254 }
2255
2256 USERPRI;
2257
2258 return call;
2259}
2260#endif /* RX_ENABLE_LOCKS */
2261
2262
2263
2264/* Establish a procedure to be called when a packet arrives for a
2265 * call. This routine will be called at most once after each call,
2266 * and will also be called if there is an error condition on the or
2267 * the call is complete. Used by multi rx to build a selection
2268 * function which determines which of several calls is likely to be a
2269 * good one to read from.
2270 * NOTE: the way this is currently implemented it is probably only a
2271 * good idea to (1) use it immediately after a newcall (clients only)
2272 * and (2) only use it once. Other uses currently void your warranty
2273 */
2274void
2275rx_SetArrivalProc(struct rx_call *call,
2276 void (*proc) (struct rx_call * call,
2277 void * mh,
2278 int index),
2279 void * handle, int arg)
2280{
2281 call->arrivalProc = proc;
2282 call->arrivalProcHandle = handle;
2283 call->arrivalProcArg = arg;
2284}
2285
2286/* Call is finished (possibly prematurely). Return rc to the peer, if
2287 * appropriate, and return the final error code from the conversation
2288 * to the caller */
2289
2290afs_int32
2291rx_EndCall(struct rx_call *call, afs_int32 rc)
2292{
2293 struct rx_connection *conn = call->conn;
2294 afs_int32 error;
2295 SPLVAR;
2296
2297 dpf(("rx_EndCall(call %"AFS_PTR_FMT" rc %d error %d abortCode %d)\n",do { if (rx_debugFile) rxi_DebugPrint ("rx_EndCall(call %""p"
" rc %d error %d abortCode %d)\n", call, rc, call->error, call
->abortCode); } while (0)
2298 call, rc, call->error, call->abortCode))do { if (rx_debugFile) rxi_DebugPrint ("rx_EndCall(call %""p"
" rc %d error %d abortCode %d)\n", call, rc, call->error, call
->abortCode); } while (0);
2299
2300 NETPRI;
2301 MUTEX_ENTER(&call->lock);
2302
2303 if (rc == 0 && call->error == 0) {
2304 call->abortCode = 0;
2305 call->abortCount = 0;
2306 }
2307
2308 call->arrivalProc = (void (*)())0;
2309 if (rc && call->error == 0) {
2310 rxi_CallError(call, rc);
2311 call->mode = RX_MODE_ERROR3;
2312 /* Send an abort message to the peer if this error code has
2313 * only just been set. If it was set previously, assume the
2314 * peer has already been sent the error code or will request it
2315 */
2316 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
2317 }
2318 if (conn->type == RX_SERVER_CONNECTION1) {
2319 /* Make sure reply or at least dummy reply is sent */
2320 if (call->mode == RX_MODE_RECEIVING2) {
2321 MUTEX_EXIT(&call->lock);
2322 rxi_WriteProc(call, 0, 0);
2323 MUTEX_ENTER(&call->lock);
2324 }
2325 if (call->mode == RX_MODE_SENDING1) {
2326 MUTEX_EXIT(&call->lock);
2327 rxi_FlushWrite(call);
2328 MUTEX_ENTER(&call->lock);
2329 }
2330 rxi_calltrace(RX_CALL_END2, call);
2331 /* Call goes to hold state until reply packets are acknowledged */
2332 if (call->tfirst + call->nSoftAcked < call->tnext) {
2333 call->state = RX_STATE_HOLD4;
2334 } else {
2335 call->state = RX_STATE_DALLY3;
2336 rxi_ClearTransmitQueue(call, 0);
2337 rxi_rto_cancel(call);
2338 rxevent_Cancel(call->keepAliveEvent, call,do { if (call->keepAliveEvent) { rxevent_Cancel_1(call->
keepAliveEvent, ((void *)0), 0); call->keepAliveEvent = ((
void *)0); } } while(0)
2339 RX_CALL_REFCOUNT_ALIVE)do { if (call->keepAliveEvent) { rxevent_Cancel_1(call->
keepAliveEvent, ((void *)0), 0); call->keepAliveEvent = ((
void *)0); } } while(0);
2340 }
2341 } else { /* Client connection */
2342 char dummy;
2343 /* Make sure server receives input packets, in the case where
2344 * no reply arguments are expected */
2345 if ((call->mode == RX_MODE_SENDING1)
2346 || (call->mode == RX_MODE_RECEIVING2 && call->rnext == 1)) {
2347 MUTEX_EXIT(&call->lock);
2348 (void)rxi_ReadProc(call, &dummy, 1);
2349 MUTEX_ENTER(&call->lock);
2350 }
2351
2352 /* If we had an outstanding delayed ack, be nice to the server
2353 * and force-send it now.
2354 */
2355 if (call->delayedAckEvent) {
2356 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
2357 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
2358 call->delayedAckEvent = NULL((void *)0);
2359 rxi_SendDelayedAck(NULL((void *)0), call, NULL((void *)0));
2360 }
2361
2362 /* We need to release the call lock since it's lower than the
2363 * conn_call_lock and we don't want to hold the conn_call_lock
2364 * over the rx_ReadProc call. The conn_call_lock needs to be held
2365 * here for the case where rx_NewCall is perusing the calls on
2366 * the connection structure. We don't want to signal until
2367 * rx_NewCall is in a stable state. Otherwise, rx_NewCall may
2368 * have checked this call, found it active and by the time it
2369 * goes to sleep, will have missed the signal.
2370 */
2371 MUTEX_EXIT(&call->lock);
2372 MUTEX_ENTER(&conn->conn_call_lock);
2373 MUTEX_ENTER(&call->lock);
2374
2375 if (!(call->flags & RX_CALL_PEER_BUSY0x20000)) {
2376 conn->lastBusy[call->channel] = 0;
2377 }
2378
2379 MUTEX_ENTER(&conn->conn_data_lock);
2380 conn->flags |= RX_CONN_BUSY32;
2381 if (conn->flags & RX_CONN_MAKECALL_WAITING1) {
2382 MUTEX_EXIT(&conn->conn_data_lock);
2383#ifdef RX_ENABLE_LOCKS
2384 CV_BROADCAST(&conn->conn_call_cv);
2385#else
2386 osi_rxWakeup(conn)rxi_Wakeup(conn);
2387#endif
2388 }
2389#ifdef RX_ENABLE_LOCKS
2390 else {
2391 MUTEX_EXIT(&conn->conn_data_lock);
2392 }
2393#endif /* RX_ENABLE_LOCKS */
2394 call->state = RX_STATE_DALLY3;
2395 }
2396 error = call->error;
2397
2398 /* currentPacket, nLeft, and NFree must be zeroed here, because
2399 * ResetCall cannot: ResetCall may be called at splnet(), in the
2400 * kernel version, and may interrupt the macros rx_Read or
2401 * rx_Write, which run at normal priority for efficiency. */
2402 if (call->currentPacket) {
2403#ifdef RX_TRACK_PACKETS
2404 call->currentPacket->flags &= ~RX_PKTFLAG_CP;
2405#endif
2406 rxi_FreePacket(call->currentPacket);
2407 call->currentPacket = (struct rx_packet *)0;
2408 }
2409
2410 call->nLeft = call->nFree = call->curlen = 0;
2411
2412 /* Free any packets from the last call to ReadvProc/WritevProc */
2413#ifdef RXDEBUG_PACKET
2414 call->iovqc -=
2415#endif /* RXDEBUG_PACKET */
2416 rxi_FreePackets(0, &call->iovq);
2417 MUTEX_EXIT(&call->lock);
2418
2419 MUTEX_ENTER(&rx_refcnt_mutex);
2420 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
2421 MUTEX_EXIT(&rx_refcnt_mutex);
2422 if (conn->type == RX_CLIENT_CONNECTION0) {
2423 MUTEX_ENTER(&conn->conn_data_lock);
2424 conn->flags &= ~RX_CONN_BUSY32;
2425 MUTEX_EXIT(&conn->conn_data_lock);
2426 MUTEX_EXIT(&conn->conn_call_lock);
2427 }
2428 USERPRI;
2429 /*
2430 * Map errors to the local host's errno.h format.
2431 */
2432 error = ntoh_syserr_conv(error);
2433 return error;
2434}
2435
2436#if !defined(KERNEL)
2437
2438/* Call this routine when shutting down a server or client (especially
2439 * clients). This will allow Rx to gracefully garbage collect server
2440 * connections, and reduce the number of retries that a server might
2441 * make to a dead client.
2442 * This is not quite right, since some calls may still be ongoing and
2443 * we can't lock them to destroy them. */
2444void
2445rx_Finalize(void)
2446{
2447 struct rx_connection **conn_ptr, **conn_end;
2448
2449 INIT_PTHREAD_LOCKS;
2450 LOCK_RX_INIT;
2451 if (rxinit_status == 1) {
2452 UNLOCK_RX_INIT;
2453 return; /* Already shutdown. */
2454 }
2455 rxi_DeleteCachedConnections();
2456 if (rx_connHashTable) {
2457 MUTEX_ENTER(&rx_connHashTable_lock);
2458 for (conn_ptr = &rx_connHashTable[0], conn_end =
2459 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
2460 conn_ptr++) {
2461 struct rx_connection *conn, *next;
2462 for (conn = *conn_ptr; conn; conn = next) {
2463 next = conn->next;
2464 if (conn->type == RX_CLIENT_CONNECTION0) {
2465 MUTEX_ENTER(&rx_refcnt_mutex);
2466 conn->refCount++;
2467 MUTEX_EXIT(&rx_refcnt_mutex);
2468#ifdef RX_ENABLE_LOCKS
2469 rxi_DestroyConnectionNoLock(conn);
2470#else /* RX_ENABLE_LOCKS */
2471 rxi_DestroyConnection(conn);
2472#endif /* RX_ENABLE_LOCKS */
2473 }
2474 }
2475 }
2476#ifdef RX_ENABLE_LOCKS
2477 while (rx_connCleanup_list) {
2478 struct rx_connection *conn;
2479 conn = rx_connCleanup_list;
2480 rx_connCleanup_list = rx_connCleanup_list->next;
2481 MUTEX_EXIT(&rx_connHashTable_lock);
2482 rxi_CleanupConnection(conn);
2483 MUTEX_ENTER(&rx_connHashTable_lock);
2484 }
2485 MUTEX_EXIT(&rx_connHashTable_lock);
2486#endif /* RX_ENABLE_LOCKS */
2487 }
2488 rxi_flushtrace();
2489
2490#ifdef AFS_NT40_ENV
2491 afs_winsockCleanup();
2492#endif
2493
2494 rxinit_status = 1;
2495 UNLOCK_RX_INIT;
2496}
2497#endif
2498
2499/* if we wakeup packet waiter too often, can get in loop with two
2500 AllocSendPackets each waking each other up (from ReclaimPacket calls) */
2501void
2502rxi_PacketsUnWait(void)
2503{
2504 if (!rx_waitingForPackets) {
2505 return;
2506 }
2507#ifdef KERNEL
2508 if (rxi_OverQuota(RX_PACKET_CLASS_SEND1)) {
2509 return; /* still over quota */
2510 }
2511#endif /* KERNEL */
2512 rx_waitingForPackets = 0;
2513#ifdef RX_ENABLE_LOCKS
2514 CV_BROADCAST(&rx_waitingForPackets_cv);
2515#else
2516 osi_rxWakeup(&rx_waitingForPackets)rxi_Wakeup(&rx_waitingForPackets);
2517#endif
2518 return;
2519}
2520
2521
2522/* ------------------Internal interfaces------------------------- */
2523
2524/* Return this process's service structure for the
2525 * specified socket and service */
2526static struct rx_service *
2527rxi_FindService(osi_socket socket, u_short serviceId)
2528{
2529 struct rx_service **sp;
2530 for (sp = &rx_services[0]; *sp; sp++) {
2531 if ((*sp)->serviceId == serviceId && (*sp)->socket == socket)
2532 return *sp;
2533 }
2534 return 0;
2535}
2536
2537#ifdef RXDEBUG_PACKET
2538#ifdef KDUMP_RX_LOCK
2539static struct rx_call_rx_lock *rx_allCallsp = 0;
2540#else
2541static struct rx_call *rx_allCallsp = 0;
2542#endif
2543#endif /* RXDEBUG_PACKET */
2544
2545/* Allocate a call structure, for the indicated channel of the
2546 * supplied connection. The mode and state of the call must be set by
2547 * the caller. Returns the call with mutex locked. */
2548static struct rx_call *
2549rxi_NewCall(struct rx_connection *conn, int channel)
2550{
2551 struct rx_call *call;
2552#ifdef AFS_GLOBAL_RXLOCK_KERNEL
2553 struct rx_call *cp; /* Call pointer temp */
2554 struct rx_call *nxp; /* Next call pointer, for queue_Scan */
2555#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2556
2557 dpf(("rxi_NewCall(conn %"AFS_PTR_FMT", channel %d)\n", conn, channel))do { if (rx_debugFile) rxi_DebugPrint ("rxi_NewCall(conn %""p"
", channel %d)\n", conn, channel); } while (0);
2558
2559 /* Grab an existing call structure, or allocate a new one.
2560 * Existing call structures are assumed to have been left reset by
2561 * rxi_FreeCall */
2562 MUTEX_ENTER(&rx_freeCallQueue_lock);
2563
2564#ifdef AFS_GLOBAL_RXLOCK_KERNEL
2565 /*
2566 * EXCEPT that the TQ might not yet be cleared out.
2567 * Skip over those with in-use TQs.
2568 */
2569 call = NULL((void *)0);
2570 for (queue_Scan(&rx_freeCallQueue, cp, nxp, rx_call)(cp) = ((struct rx_call *)((struct rx_queue *)(&rx_freeCallQueue
))->next), nxp = ((struct rx_call *)((struct rx_queue *)(cp
))->next); !(((struct rx_queue *)(&rx_freeCallQueue)) ==
((struct rx_queue *)(cp))); (cp) = (nxp), nxp = ((struct rx_call
*)((struct rx_queue *)(cp))->next)) {
2571 if (!(cp->flags & RX_CALL_TQ_BUSY128)) {
2572 call = cp;
2573 break;
2574 }
2575 }
2576 if (call) {
2577#else /* AFS_GLOBAL_RXLOCK_KERNEL */
2578 if (queue_IsNotEmpty(&rx_freeCallQueue)(((struct rx_queue *)(&rx_freeCallQueue))->next != ((struct
rx_queue *)(&rx_freeCallQueue)))) {
2579 call = queue_First(&rx_freeCallQueue, rx_call)((struct rx_call *)((struct rx_queue *)(&rx_freeCallQueue
))->next);
2580#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2581 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
2582 if (rx_stats_active)
2583 rx_atomic_dec(&rx_stats.nFreeCallStructs);
2584 MUTEX_EXIT(&rx_freeCallQueue_lock);
2585 MUTEX_ENTER(&call->lock);
2586 CLEAR_CALL_QUEUE_LOCK(call);
2587#ifdef AFS_GLOBAL_RXLOCK_KERNEL
2588 /* Now, if TQ wasn't cleared earlier, do it now. */
2589 rxi_WaitforTQBusy(call);
2590 if (call->flags & RX_CALL_TQ_CLEARME256) {
2591 rxi_ClearTransmitQueue(call, 1);
2592 /*queue_Init(&call->tq);*/
2593 }
2594#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2595 /* Bind the call to its connection structure */
2596 call->conn = conn;
2597 rxi_ResetCall(call, 1);
2598 } else {
2599
2600 call = rxi_Alloc(sizeof(struct rx_call));
2601#ifdef RXDEBUG_PACKET
2602 call->allNextp = rx_allCallsp;
2603 rx_allCallsp = call;
2604 call->call_id =
2605 rx_atomic_inc_and_read(&rx_stats.nCallStructs);
2606#else /* RXDEBUG_PACKET */
2607 rx_atomic_inc(&rx_stats.nCallStructs);
2608#endif /* RXDEBUG_PACKET */
2609
2610 MUTEX_EXIT(&rx_freeCallQueue_lock);
2611 MUTEX_INIT(&call->lock, "call lock", MUTEX_DEFAULT, NULL);
2612 MUTEX_ENTER(&call->lock);
2613 CV_INIT(&call->cv_twind, "call twind", CV_DEFAULT, 0);
2614 CV_INIT(&call->cv_rq, "call rq", CV_DEFAULT, 0);
2615 CV_INIT(&call->cv_tq, "call tq", CV_DEFAULT, 0);
2616
2617 /* Initialize once-only items */
2618 queue_Init(&call->tq)(((struct rx_queue *)(&call->tq)))->prev = (((struct
rx_queue *)(&call->tq)))->next = (((struct rx_queue
*)(&call->tq)));
2619 queue_Init(&call->rq)(((struct rx_queue *)(&call->rq)))->prev = (((struct
rx_queue *)(&call->rq)))->next = (((struct rx_queue
*)(&call->rq)));
2620 queue_Init(&call->iovq)(((struct rx_queue *)(&call->iovq)))->prev = (((struct
rx_queue *)(&call->iovq)))->next = (((struct rx_queue
*)(&call->iovq)));
2621#ifdef RXDEBUG_PACKET
2622 call->rqc = call->tqc = call->iovqc = 0;
2623#endif /* RXDEBUG_PACKET */
2624 /* Bind the call to its connection structure (prereq for reset) */
2625 call->conn = conn;
2626 rxi_ResetCall(call, 1);
2627 }
2628 call->channel = channel;
2629 call->callNumber = &conn->callNumber[channel];
2630 call->rwind = conn->rwind[channel];
2631 call->twind = conn->twind[channel];
2632 /* Note that the next expected call number is retained (in
2633 * conn->callNumber[i]), even if we reallocate the call structure
2634 */
2635 conn->call[channel] = call;
2636 /* if the channel's never been used (== 0), we should start at 1, otherwise
2637 * the call number is valid from the last time this channel was used */
2638 if (*call->callNumber == 0)
2639 *call->callNumber = 1;
2640
2641 return call;
2642}
2643
2644/* A call has been inactive long enough that so we can throw away
2645 * state, including the call structure, which is placed on the call
2646 * free list.
2647 *
2648 * call->lock amd rx_refcnt_mutex are held upon entry.
2649 * haveCTLock is set when called from rxi_ReapConnections.
2650 */
2651static void
2652rxi_FreeCall(struct rx_call *call, int haveCTLock)
2653{
2654 int channel = call->channel;
2655 struct rx_connection *conn = call->conn;
2656
2657
2658 if (call->state == RX_STATE_DALLY3 || call->state == RX_STATE_HOLD4)
2659 (*call->callNumber)++;
2660 /*
2661 * We are setting the state to RX_STATE_RESET to
2662 * ensure that no one else will attempt to use this
2663 * call once we drop the refcnt lock. We must drop
2664 * the refcnt lock before calling rxi_ResetCall
2665 * because it cannot be held across acquiring the
2666 * freepktQ lock. NewCall does the same.
2667 */
2668 call->state = RX_STATE_RESET5;
2669 MUTEX_EXIT(&rx_refcnt_mutex);
2670 rxi_ResetCall(call, 0);
2671
2672 MUTEX_ENTER(&conn->conn_call_lock);
2673 if (call->conn->call[channel] == call)
2674 call->conn->call[channel] = 0;
2675 MUTEX_EXIT(&conn->conn_call_lock);
2676
2677 MUTEX_ENTER(&rx_freeCallQueue_lock);
2678 SET_CALL_QUEUE_LOCK(call, &rx_freeCallQueue_lock);
2679#ifdef AFS_GLOBAL_RXLOCK_KERNEL
2680 /* A call may be free even though its transmit queue is still in use.
2681 * Since we search the call list from head to tail, put busy calls at
2682 * the head of the list, and idle calls at the tail.
2683 */
2684 if (call->flags & RX_CALL_TQ_BUSY128)
2685 queue_Prepend(&rx_freeCallQueue, call)(((((struct rx_queue *)(call))->next=((struct rx_queue *)(
&rx_freeCallQueue))->next)->prev=((struct rx_queue *
)(call)))->prev=((struct rx_queue *)(&rx_freeCallQueue
)), ((struct rx_queue *)(&rx_freeCallQueue))->next=((struct
rx_queue *)(call)));
2686 else
2687 queue_Append(&rx_freeCallQueue, call)(((((struct rx_queue *)(call))->prev=((struct rx_queue *)(
&rx_freeCallQueue))->prev)->next=((struct rx_queue *
)(call)))->next=((struct rx_queue *)(&rx_freeCallQueue
)), ((struct rx_queue *)(&rx_freeCallQueue))->prev=((struct
rx_queue *)(call)));
2688#else /* AFS_GLOBAL_RXLOCK_KERNEL */
2689 queue_Append(&rx_freeCallQueue, call)(((((struct rx_queue *)(call))->prev=((struct rx_queue *)(
&rx_freeCallQueue))->prev)->next=((struct rx_queue *
)(call)))->next=((struct rx_queue *)(&rx_freeCallQueue
)), ((struct rx_queue *)(&rx_freeCallQueue))->prev=((struct
rx_queue *)(call)));
2690#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2691 if (rx_stats_active)
2692 rx_atomic_inc(&rx_stats.nFreeCallStructs);
2693 MUTEX_EXIT(&rx_freeCallQueue_lock);
2694
2695 /* Destroy the connection if it was previously slated for
2696 * destruction, i.e. the Rx client code previously called
2697 * rx_DestroyConnection (client connections), or
2698 * rxi_ReapConnections called the same routine (server
2699 * connections). Only do this, however, if there are no
2700 * outstanding calls. Note that for fine grain locking, there appears
2701 * to be a deadlock in that rxi_FreeCall has a call locked and
2702 * DestroyConnectionNoLock locks each call in the conn. But note a
2703 * few lines up where we have removed this call from the conn.
2704 * If someone else destroys a connection, they either have no
2705 * call lock held or are going through this section of code.
2706 */
2707 MUTEX_ENTER(&conn->conn_data_lock);
2708 if (conn->flags & RX_CONN_DESTROY_ME2 && !(conn->flags & RX_CONN_MAKECALL_WAITING1)) {
2709 MUTEX_ENTER(&rx_refcnt_mutex);
2710 conn->refCount++;
2711 MUTEX_EXIT(&rx_refcnt_mutex);
2712 MUTEX_EXIT(&conn->conn_data_lock);
2713#ifdef RX_ENABLE_LOCKS
2714 if (haveCTLock)
2715 rxi_DestroyConnectionNoLock(conn);
2716 else
2717 rxi_DestroyConnection(conn);
2718#else /* RX_ENABLE_LOCKS */
2719 rxi_DestroyConnection(conn);
2720#endif /* RX_ENABLE_LOCKS */
2721 } else {
2722 MUTEX_EXIT(&conn->conn_data_lock);
2723 }
2724 MUTEX_ENTER(&rx_refcnt_mutex);
2725}
2726
2727rx_atomic_t rxi_Allocsize = RX_ATOMIC_INIT(0){ (0) };
2728rx_atomic_t rxi_Alloccnt = RX_ATOMIC_INIT(0){ (0) };
2729
2730void *
2731rxi_Alloc(size_t size)
2732{
2733 char *p;
2734
2735 if (rx_stats_active) {
2736 rx_atomic_add(&rxi_Allocsize, (int) size);
2737 rx_atomic_inc(&rxi_Alloccnt);
2738 }
2739
2740p = (char *)
2741#if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV1)
2742 afs_osi_Alloc_NoSleep(size);
2743#else
2744 osi_Alloc(size)malloc(size);
2745#endif
2746 if (!p)
2747 osi_Panic("rxi_Alloc error");
2748 memset(p, 0, size);
2749 return p;
2750}
2751
2752void
2753rxi_Free(void *addr, size_t size)
2754{
2755 if (rx_stats_active) {
2756 rx_atomic_sub(&rxi_Allocsize, (int) size);
2757 rx_atomic_dec(&rxi_Alloccnt);
2758 }
2759 osi_Free(addr, size)free(addr);
2760}
2761
2762void
2763rxi_SetPeerMtu(struct rx_peer *peer, afs_uint32 host, afs_uint32 port, int mtu)
2764{
2765 struct rx_peer **peer_ptr = NULL((void *)0), **peer_end = NULL((void *)0);
2766 struct rx_peer *next = NULL((void *)0);
2767 int hashIndex;
2768
2769 if (!peer) {
2770 MUTEX_ENTER(&rx_peerHashTable_lock);
2771 if (port == 0) {
2772 peer_ptr = &rx_peerHashTable[0];
2773 peer_end = &rx_peerHashTable[rx_hashTableSize];
2774 next = NULL((void *)0);
2775 resume:
2776 for ( ; peer_ptr < peer_end; peer_ptr++) {
2777 if (!peer)
2778 peer = *peer_ptr;
2779 for ( ; peer; peer = next) {
2780 next = peer->next;
2781 if (host == peer->host)
2782 break;
2783 }
2784 }
2785 } else {
2786 hashIndex = PEER_HASH(host, port)((host ^ port) % rx_hashTableSize);
2787 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2788 if ((peer->host == host) && (peer->port == port))
2789 break;
2790 }
2791 }
2792 } else {
2793 MUTEX_ENTER(&rx_peerHashTable_lock);
2794 }
2795
2796 if (peer) {
2797 peer->refCount++;
2798 MUTEX_EXIT(&rx_peerHashTable_lock);
2799
2800 MUTEX_ENTER(&peer->peer_lock);
2801 /* We don't handle dropping below min, so don't */
2802 mtu = MAX(mtu, RX_MIN_PACKET_SIZE)(((mtu)>((576 - RX_IPUDP_SIZE)))?(mtu):((576 - RX_IPUDP_SIZE
)));
2803 peer->ifMTU=MIN(mtu, peer->ifMTU)(((mtu)<(peer->ifMTU))?(mtu):(peer->ifMTU));
2804 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2805 /* if we tweaked this down, need to tune our peer MTU too */
2806 peer->MTU = MIN(peer->MTU, peer->natMTU)(((peer->MTU)<(peer->natMTU))?(peer->MTU):(peer->
natMTU));
2807 /* if we discovered a sub-1500 mtu, degrade */
2808 if (peer->ifMTU < OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE))
2809 peer->maxDgramPackets = 1;
2810 /* We no longer have valid peer packet information */
2811 if (peer->maxPacketSize-RX_IPUDP_SIZE > peer->ifMTU)
2812 peer->maxPacketSize = 0;
2813 MUTEX_EXIT(&peer->peer_lock);
2814
2815 MUTEX_ENTER(&rx_peerHashTable_lock);
2816 peer->refCount--;
2817 if (host && !port) {
2818 peer = next;
2819 /* pick up where we left off */
2820 goto resume;
2821 }
2822 }
2823 MUTEX_EXIT(&rx_peerHashTable_lock);
2824}
2825
2826/* Find the peer process represented by the supplied (host,port)
2827 * combination. If there is no appropriate active peer structure, a
2828 * new one will be allocated and initialized
2829 * The origPeer, if set, is a pointer to a peer structure on which the
2830 * refcount will be be decremented. This is used to replace the peer
2831 * structure hanging off a connection structure */
2832struct rx_peer *
2833rxi_FindPeer(afs_uint32 host, u_short port,
2834 struct rx_peer *origPeer, int create)
2835{
2836 struct rx_peer *pp;
2837 int hashIndex;
2838 hashIndex = PEER_HASH(host, port)((host ^ port) % rx_hashTableSize);
2839 MUTEX_ENTER(&rx_peerHashTable_lock);
2840 for (pp = rx_peerHashTable[hashIndex]; pp; pp = pp->next) {
2841 if ((pp->host == host) && (pp->port == port))
2842 break;
2843 }
2844 if (!pp) {
2845 if (create) {
2846 pp = rxi_AllocPeer()rxi_Alloc(sizeof(struct rx_peer)); /* This bzero's *pp */
2847 pp->host = host; /* set here or in InitPeerParams is zero */
2848 pp->port = port;
2849 MUTEX_INIT(&pp->peer_lock, "peer_lock", MUTEX_DEFAULT, 0);
2850 queue_Init(&pp->congestionQueue)(((struct rx_queue *)(&pp->congestionQueue)))->prev
= (((struct rx_queue *)(&pp->congestionQueue)))->next
= (((struct rx_queue *)(&pp->congestionQueue)));
2851 queue_Init(&pp->rpcStats)(((struct rx_queue *)(&pp->rpcStats)))->prev = (((struct
rx_queue *)(&pp->rpcStats)))->next = (((struct rx_queue
*)(&pp->rpcStats)));
2852 pp->next = rx_peerHashTable[hashIndex];
2853 rx_peerHashTable[hashIndex] = pp;
2854 rxi_InitPeerParams(pp);
2855 if (rx_stats_active)
2856 rx_atomic_inc(&rx_stats.nPeerStructs);
2857 }
2858 }
2859 if (pp && create) {
2860 pp->refCount++;
2861 }
2862 if (origPeer)
2863 origPeer->refCount--;
2864 MUTEX_EXIT(&rx_peerHashTable_lock);
2865 return pp;
2866}
2867
2868
2869/* Find the connection at (host, port) started at epoch, and with the
2870 * given connection id. Creates the server connection if necessary.
2871 * The type specifies whether a client connection or a server
2872 * connection is desired. In both cases, (host, port) specify the
2873 * peer's (host, pair) pair. Client connections are not made
2874 * automatically by this routine. The parameter socket gives the
2875 * socket descriptor on which the packet was received. This is used,
2876 * in the case of server connections, to check that *new* connections
2877 * come via a valid (port, serviceId). Finally, the securityIndex
2878 * parameter must match the existing index for the connection. If a
2879 * server connection is created, it will be created using the supplied
2880 * index, if the index is valid for this service */
2881struct rx_connection *
2882rxi_FindConnection(osi_socket socket, afs_uint32 host,
2883 u_short port, u_short serviceId, afs_uint32 cid,
2884 afs_uint32 epoch, int type, u_int securityIndex)
2885{
2886 int hashindex, flag, i;
2887 struct rx_connection *conn;
2888 hashindex = CONN_HASH(host, port, cid, epoch, type)((((cid)>>2)%rx_hashTableSize));
2889 MUTEX_ENTER(&rx_connHashTable_lock);
2890 rxLastConn ? (conn = rxLastConn, flag = 0) : (conn =
2891 rx_connHashTable[hashindex],
2892 flag = 1);
2893 for (; conn;) {
2894 if ((conn->type == type) && ((cid & RX_CIDMASK(~(4 -1))) == conn->cid)
2895 && (epoch == conn->epoch)) {
2896 struct rx_peer *pp = conn->peer;
2897 if (securityIndex != conn->securityIndex) {
2898 /* this isn't supposed to happen, but someone could forge a packet
2899 * like this, and there seems to be some CM bug that makes this
2900 * happen from time to time -- in which case, the fileserver
2901 * asserts. */
2902 MUTEX_EXIT(&rx_connHashTable_lock);
2903 return (struct rx_connection *)0;
2904 }
2905 if (pp->host == host && pp->port == port)
2906 break;
2907 if (type == RX_CLIENT_CONNECTION0 && pp->port == port)
2908 break;
2909 /* So what happens when it's a callback connection? */
2910 if ( /*type == RX_CLIENT_CONNECTION && */
2911 (conn->epoch & 0x80000000))
2912 break;
2913 }
2914 if (!flag) {
2915 /* the connection rxLastConn that was used the last time is not the
2916 ** one we are looking for now. Hence, start searching in the hash */
2917 flag = 1;
2918 conn = rx_connHashTable[hashindex];
2919 } else
2920 conn = conn->next;
2921 }
2922 if (!conn) {
2923 struct rx_service *service;
2924 if (type == RX_CLIENT_CONNECTION0) {
2925 MUTEX_EXIT(&rx_connHashTable_lock);
2926 return (struct rx_connection *)0;
2927 }
2928 service = rxi_FindService(socket, serviceId);
2929 if (!service || (securityIndex >= service->nSecurityObjects)
2930 || (service->securityObjects[securityIndex] == 0)) {
2931 MUTEX_EXIT(&rx_connHashTable_lock);
2932 return (struct rx_connection *)0;
2933 }
2934 conn = rxi_AllocConnection()rxi_Alloc(sizeof(struct rx_connection)); /* This bzero's the connection */
2935 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
2936 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
2937 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
2938 conn->next = rx_connHashTable[hashindex];
2939 rx_connHashTable[hashindex] = conn;
2940 conn->peer = rxi_FindPeer(host, port, 0, 1);
2941 conn->type = RX_SERVER_CONNECTION1;
2942 conn->lastSendTime = clock_Sec()(time(((void *)0))); /* don't GC immediately */
2943 conn->epoch = epoch;
2944 conn->cid = cid & RX_CIDMASK(~(4 -1));
2945 /* conn->serial = conn->lastSerial = 0; */
2946 /* conn->timeout = 0; */
2947 conn->ackRate = RX_FAST_ACK_RATE1;
2948 conn->service = service;
2949 conn->serviceId = serviceId;
2950 conn->securityIndex = securityIndex;
2951 conn->securityObject = service->securityObjects[securityIndex];
2952 conn->nSpecific = 0;
2953 conn->specific = NULL((void *)0);
2954 rx_SetConnDeadTime(conn, service->connDeadTime);
2955 rx_SetConnIdleDeadTime(conn, service->idleDeadTime);
2956 rx_SetServerConnIdleDeadErr(conn, service->idleDeadErr)((conn)->idleDeadErr = (service->idleDeadErr));
2957 for (i = 0; i < RX_MAXCALLS4; i++) {
2958 conn->twind[i] = rx_initSendWindow;
2959 conn->rwind[i] = rx_initReceiveWindow;
2960 }
2961 /* Notify security object of the new connection */
2962 RXS_NewConnection(conn->securityObject, conn)((conn->securityObject && (conn->securityObject
->ops->op_NewConnection)) ? (*(conn->securityObject)
->ops->op_NewConnection)(conn->securityObject,conn) :
0);
2963 /* XXXX Connection timeout? */
2964 if (service->newConnProc)
2965 (*service->newConnProc) (conn);
2966 if (rx_stats_active)
2967 rx_atomic_inc(&rx_stats.nServerConns);
2968 }
2969
2970 MUTEX_ENTER(&rx_refcnt_mutex);
2971 conn->refCount++;
2972 MUTEX_EXIT(&rx_refcnt_mutex);
2973
2974 rxLastConn = conn; /* store this connection as the last conn used */
2975 MUTEX_EXIT(&rx_connHashTable_lock);
2976 return conn;
2977}
2978
2979/**
2980 * Timeout a call on a busy call channel if appropriate.
2981 *
2982 * @param[in] call The busy call.
2983 *
2984 * @pre 'call' is marked as busy (namely,
2985 * call->conn->lastBusy[call->channel] != 0)
2986 *
2987 * @pre call->lock is held
2988 * @pre rxi_busyChannelError is nonzero
2989 *
2990 * @note call->lock is dropped and reacquired
2991 */
2992static void
2993rxi_CheckBusy(struct rx_call *call)
2994{
2995 struct rx_connection *conn = call->conn;
2996 int channel = call->channel;
2997 int freechannel = 0;
2998 int i;
2999 afs_uint32 callNumber = *call->callNumber;
3000
3001 MUTEX_EXIT(&call->lock);
3002
3003 MUTEX_ENTER(&conn->conn_call_lock);
3004
3005 /* Are there any other call slots on this conn that we should try? Look for
3006 * slots that are empty and are either non-busy, or were marked as busy
3007 * longer than conn->secondsUntilDead seconds before this call started. */
3008
3009 for (i = 0; i < RX_MAXCALLS4 && !freechannel; i++) {
3010 if (i == channel) {
3011 /* only look at channels that aren't us */
3012 continue;
3013 }
3014
3015 if (conn->lastBusy[i]) {
3016 /* if this channel looked busy too recently, don't look at it */
3017 if (conn->lastBusy[i] >= call->startTime.sec) {
3018 continue;
3019 }
3020 if (call->startTime.sec - conn->lastBusy[i] < conn->secondsUntilDead) {
3021 continue;
3022 }
3023 }
3024
3025 if (conn->call[i]) {
3026 struct rx_call *tcall = conn->call[i];
3027 MUTEX_ENTER(&tcall->lock);
3028 if (tcall->state == RX_STATE_DALLY3) {
3029 freechannel = 1;
3030 }
3031 MUTEX_EXIT(&tcall->lock);
3032 } else {
3033 freechannel = 1;
3034 }
3035 }
3036
3037 MUTEX_EXIT(&conn->conn_call_lock);
3038
3039 MUTEX_ENTER(&call->lock);
3040
3041 /* Since the call->lock and conn->conn_call_lock have been released it is
3042 * possible that (1) the call may no longer be busy and/or (2) the call may
3043 * have been reused by another waiting thread. Therefore, we must confirm
3044 * that the call state has not changed when deciding whether or not to
3045 * force this application thread to retry by forcing a Timeout error. */
3046
3047 if (freechannel && *call->callNumber == callNumber &&
3048 (call->flags & RX_CALL_PEER_BUSY0x20000)) {
3049 /* Since 'freechannel' is set, there exists another channel in this
3050 * rx_conn that the application thread might be able to use. We know
3051 * that we have the correct call since callNumber is unchanged, and we
3052 * know that the call is still busy. So, set the call error state to
3053 * rxi_busyChannelError so the application can retry the request,
3054 * presumably on a less-busy call channel. */
3055
3056 rxi_CallError(call, rxi_busyChannelError);
3057 }
3058}
3059
3060/* There are two packet tracing routines available for testing and monitoring
3061 * Rx. One is called just after every packet is received and the other is
3062 * called just before every packet is sent. Received packets, have had their
3063 * headers decoded, and packets to be sent have not yet had their headers
3064 * encoded. Both take two parameters: a pointer to the packet and a sockaddr
3065 * containing the network address. Both can be modified. The return value, if
3066 * non-zero, indicates that the packet should be dropped. */
3067
3068int (*rx_justReceived) (struct rx_packet *, struct sockaddr_in *) = 0;
3069int (*rx_almostSent) (struct rx_packet *, struct sockaddr_in *) = 0;
3070
3071/* A packet has been received off the interface. Np is the packet, socket is
3072 * the socket number it was received from (useful in determining which service
3073 * this packet corresponds to), and (host, port) reflect the host,port of the
3074 * sender. This call returns the packet to the caller if it is finished with
3075 * it, rather than de-allocating it, just as a small performance hack */
3076
3077struct rx_packet *
3078rxi_ReceivePacket(struct rx_packet *np, osi_socket socket,
3079 afs_uint32 host, u_short port, int *tnop,
3080 struct rx_call **newcallp)
3081{
3082 struct rx_call *call;
3083 struct rx_connection *conn;
3084 int channel;
3085 afs_uint32 currentCallNumber;
3086 int type;
3087 int skew;
3088#ifdef RXDEBUG1
3089 char *packetType;
3090#endif
3091 struct rx_packet *tnp;
3092
3093#ifdef RXDEBUG1
3094/* We don't print out the packet until now because (1) the time may not be
3095 * accurate enough until now in the lwp implementation (rx_Listener only gets
3096 * the time after the packet is read) and (2) from a protocol point of view,
3097 * this is the first time the packet has been seen */
3098 packetType = (np->header.type > 0 && np->header.type < RX_N_PACKET_TYPES13)
3099 ? rx_packetTypes[np->header.type - 1] : "*UNKNOWN*";
3100 dpf(("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"AFS_PTR_FMT"\n",do { if (rx_debugFile) rxi_DebugPrint ("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"
"p""\n", np->header.serial, packetType, (__builtin_constant_p
(host) ? ((((__uint32_t)(host)) >> 24) | ((((__uint32_t
)(host)) & (0xff << 16)) >> 8) | ((((__uint32_t
)(host)) & (0xff << 8)) << 8) | (((__uint32_t
)(host)) << 24)) : __bswap32_var(host)), (__builtin_constant_p
(port) ? (__uint16_t)(((__uint16_t)(port)) << 8 | ((__uint16_t
)(port)) >> 8) : __bswap16_var(port)), np->header.serviceId
, np->header.epoch, np->header.cid, np->header.callNumber
, np->header.seq, np->header.flags, np); } while (0)
3101 np->header.serial, packetType, ntohl(host), ntohs(port), np->header.serviceId,do { if (rx_debugFile) rxi_DebugPrint ("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"
"p""\n", np->header.serial, packetType, (__builtin_constant_p
(host) ? ((((__uint32_t)(host)) >> 24) | ((((__uint32_t
)(host)) & (0xff << 16)) >> 8) | ((((__uint32_t
)(host)) & (0xff << 8)) << 8) | (((__uint32_t
)(host)) << 24)) : __bswap32_var(host)), (__builtin_constant_p
(port) ? (__uint16_t)(((__uint16_t)(port)) << 8 | ((__uint16_t
)(port)) >> 8) : __bswap16_var(port)), np->header.serviceId
, np->header.epoch, np->header.cid, np->header.callNumber
, np->header.seq, np->header.flags, np); } while (0)
3102 np->header.epoch, np->header.cid, np->header.callNumber,do { if (rx_debugFile) rxi_DebugPrint ("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"
"p""\n", np->header.serial, packetType, (__builtin_constant_p
(host) ? ((((__uint32_t)(host)) >> 24) | ((((__uint32_t
)(host)) & (0xff << 16)) >> 8) | ((((__uint32_t
)(host)) & (0xff << 8)) << 8) | (((__uint32_t
)(host)) << 24)) : __bswap32_var(host)), (__builtin_constant_p
(port) ? (__uint16_t)(((__uint16_t)(port)) << 8 | ((__uint16_t
)(port)) >> 8) : __bswap16_var(port)), np->header.serviceId
, np->header.epoch, np->header.cid, np->header.callNumber
, np->header.seq, np->header.flags, np); } while (0)
3103 np->header.seq, np->header.flags, np))do { if (rx_debugFile) rxi_DebugPrint ("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"
"p""\n", np->header.serial, packetType, (__builtin_constant_p
(host) ? ((((__uint32_t)(host)) >> 24) | ((((__uint32_t
)(host)) & (0xff << 16)) >> 8) | ((((__uint32_t
)(host)) & (0xff << 8)) << 8) | (((__uint32_t
)(host)) << 24)) : __bswap32_var(host)), (__builtin_constant_p
(port) ? (__uint16_t)(((__uint16_t)(port)) << 8 | ((__uint16_t
)(port)) >> 8) : __bswap16_var(port)), np->header.serviceId
, np->header.epoch, np->header.cid, np->header.callNumber
, np->header.seq, np->header.flags, np); } while (0);
3104#endif
3105
3106 if (np->header.type == RX_PACKET_TYPE_VERSION13) {
3107 return rxi_ReceiveVersionPacket(np, socket, host, port, 1);
3108 }
3109
3110 if (np->header.type == RX_PACKET_TYPE_DEBUG8) {
3111 return rxi_ReceiveDebugPacket(np, socket, host, port, 1);
3112 }
3113#ifdef RXDEBUG1
3114 /* If an input tracer function is defined, call it with the packet and
3115 * network address. Note this function may modify its arguments. */
3116 if (rx_justReceived) {
3117 struct sockaddr_in addr;
3118 int drop;
3119 addr.sin_family = AF_INET2;
3120 addr.sin_port = port;
3121 addr.sin_addr.s_addr = host;
3122#ifdef STRUCT_SOCKADDR_HAS_SA_LEN1
3123 addr.sin_len = sizeof(addr);
3124#endif /* AFS_OSF_ENV */
3125 drop = (*rx_justReceived) (np, &addr);
3126 /* drop packet if return value is non-zero */
3127 if (drop)
3128 return np;
3129 port = addr.sin_port; /* in case fcn changed addr */
3130 host = addr.sin_addr.s_addr;
3131 }
3132#endif
3133
3134 /* If packet was not sent by the client, then *we* must be the client */
3135 type = ((np->header.flags & RX_CLIENT_INITIATED1) != RX_CLIENT_INITIATED1)
3136 ? RX_CLIENT_CONNECTION0 : RX_SERVER_CONNECTION1;
3137
3138 /* Find the connection (or fabricate one, if we're the server & if
3139 * necessary) associated with this packet */
3140 conn =
3141 rxi_FindConnection(socket, host, port, np->header.serviceId,
3142 np->header.cid, np->header.epoch, type,
3143 np->header.securityIndex);
3144
3145 if (!conn) {
3146 /* If no connection found or fabricated, just ignore the packet.
3147 * (An argument could be made for sending an abort packet for
3148 * the conn) */
3149 return np;
3150 }
3151
3152 /* If the connection is in an error state, send an abort packet and ignore
3153 * the incoming packet */
3154 if (conn->error) {
3155 /* Don't respond to an abort packet--we don't want loops! */
3156 MUTEX_ENTER(&conn->conn_data_lock);
3157 if (np->header.type != RX_PACKET_TYPE_ABORT4)
3158 np = rxi_SendConnectionAbort(conn, np, 1, 0);
3159 MUTEX_ENTER(&rx_refcnt_mutex);
3160 conn->refCount--;
3161 MUTEX_EXIT(&rx_refcnt_mutex);
3162 MUTEX_EXIT(&conn->conn_data_lock);
3163 return np;
3164 }
3165
3166 /* Check for connection-only requests (i.e. not call specific). */
3167 if (np->header.callNumber == 0) {
3168 switch (np->header.type) {
3169 case RX_PACKET_TYPE_ABORT4: {
3170 /* What if the supplied error is zero? */
3171 afs_int32 errcode = ntohl(rx_GetInt32(np, 0))(__builtin_constant_p((( (0) >= (np)->wirevec[1].iov_len
) ? rx_SlowGetInt32((np), (0)) : *((afs_int32 *)((char *)((np
)->wirevec[1].iov_base) + (0))))) ? ((((__uint32_t)((( (0)
>= (np)->wirevec[1].iov_len) ? rx_SlowGetInt32((np), (
0)) : *((afs_int32 *)((char *)((np)->wirevec[1].iov_base) +
(0)))))) >> 24) | ((((__uint32_t)((( (0) >= (np)->
wirevec[1].iov_len) ? rx_SlowGetInt32((np), (0)) : *((afs_int32
*)((char *)((np)->wirevec[1].iov_base) + (0)))))) & (
0xff << 16)) >> 8) | ((((__uint32_t)((( (0) >=
(np)->wirevec[1].iov_len) ? rx_SlowGetInt32((np), (0)) : *
((afs_int32 *)((char *)((np)->wirevec[1].iov_base) + (0)))
))) & (0xff << 8)) << 8) | (((__uint32_t)((( (
0) >= (np)->wirevec[1].iov_len) ? rx_SlowGetInt32((np),
(0)) : *((afs_int32 *)((char *)((np)->wirevec[1].iov_base
) + (0)))))) << 24)) : __bswap32_var((( (0) >= (np)->
wirevec[1].iov_len) ? rx_SlowGetInt32((np), (0)) : *((afs_int32
*)((char *)((np)->wirevec[1].iov_base) + (0))))));
3172 dpf(("rxi_ReceivePacket ABORT rx_GetInt32 = %d\n", errcode))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ReceivePacket ABORT rx_GetInt32 = %d\n"
, errcode); } while (0);
3173 rxi_ConnectionError(conn, errcode);
3174 MUTEX_ENTER(&rx_refcnt_mutex);
3175 conn->refCount--;
3176 MUTEX_EXIT(&rx_refcnt_mutex);
3177 return np;
3178 }
3179 case RX_PACKET_TYPE_CHALLENGE6:
3180 tnp = rxi_ReceiveChallengePacket(conn, np, 1);
3181 MUTEX_ENTER(&rx_refcnt_mutex);
3182 conn->refCount--;
3183 MUTEX_EXIT(&rx_refcnt_mutex);
3184 return tnp;
3185 case RX_PACKET_TYPE_RESPONSE7:
3186 tnp = rxi_ReceiveResponsePacket(conn, np, 1);
3187 MUTEX_ENTER(&rx_refcnt_mutex);
3188 conn->refCount--;
3189 MUTEX_EXIT(&rx_refcnt_mutex);
3190 return tnp;
3191 case RX_PACKET_TYPE_PARAMS9:
3192 case RX_PACKET_TYPE_PARAMS9 + 1:
3193 case RX_PACKET_TYPE_PARAMS9 + 2:
3194 /* ignore these packet types for now */
3195 MUTEX_ENTER(&rx_refcnt_mutex);
3196 conn->refCount--;
3197 MUTEX_EXIT(&rx_refcnt_mutex);
3198 return np;
3199
3200
3201 default:
3202 /* Should not reach here, unless the peer is broken: send an
3203 * abort packet */
3204 rxi_ConnectionError(conn, RX_PROTOCOL_ERROR(-5));
3205 MUTEX_ENTER(&conn->conn_data_lock);
3206 tnp = rxi_SendConnectionAbort(conn, np, 1, 0);
3207 MUTEX_ENTER(&rx_refcnt_mutex);
3208 conn->refCount--;
3209 MUTEX_EXIT(&rx_refcnt_mutex);
3210 MUTEX_EXIT(&conn->conn_data_lock);
3211 return tnp;
3212 }
3213 }
3214
3215 channel = np->header.cid & RX_CHANNELMASK(4 -1);
3216 call = conn->call[channel];
3217
3218 if (call) {
3219 MUTEX_ENTER(&call->lock);
3220 currentCallNumber = conn->callNumber[channel];
3221 } else if (type == RX_SERVER_CONNECTION1) { /* No call allocated */
3222 MUTEX_ENTER(&conn->conn_call_lock);
3223 call = conn->call[channel];
3224 if (call) {
3225 MUTEX_ENTER(&call->lock);
3226 MUTEX_EXIT(&conn->conn_call_lock);
3227 currentCallNumber = conn->callNumber[channel];
3228 } else {
3229 call = rxi_NewCall(conn, channel); /* returns locked call */
3230 MUTEX_EXIT(&conn->conn_call_lock);
3231 *call->callNumber = currentCallNumber = np->header.callNumber;
3232#ifdef RXDEBUG1
3233 if (np->header.callNumber == 0)
3234 dpf(("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"AFS_PTR_FMT" len %d\n",do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0)
3235 np->header.serial, rx_packetTypes[np->header.type - 1], ntohl(conn->peer->host), ntohs(conn->peer->port),do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0)
3236 np->header.serial, np->header.epoch, np->header.cid, np->header.callNumber, np->header.seq,do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0)
3237 np->header.flags, np, np->length))do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0);
3238#endif
3239 call->state = RX_STATE_PRECALL1;
3240 clock_GetTime(&call->queueTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->queueTime)->sec = (afs_int32)tv.tv_sec; (&
call->queueTime)->usec = (afs_int32)tv.tv_usec; } while
(0);
3241 hzero(call->bytesSent)((call->bytesSent).low = 0, (call->bytesSent).high = 0);
3242 hzero(call->bytesRcvd)((call->bytesRcvd).low = 0, (call->bytesRcvd).high = 0);
3243 /*
3244 * If the number of queued calls exceeds the overload
3245 * threshold then abort this call.
3246 */
3247 if ((rx_BusyThreshold > 0) &&
3248 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3249 struct rx_packet *tp;
3250
3251 rxi_CallError(call, rx_BusyError);
3252 tp = rxi_SendCallAbort(call, np, 1, 0);
3253 MUTEX_EXIT(&call->lock);
3254 MUTEX_ENTER(&rx_refcnt_mutex);
3255 conn->refCount--;
3256 MUTEX_EXIT(&rx_refcnt_mutex);
3257 if (rx_stats_active)
3258 rx_atomic_inc(&rx_stats.nBusies);
3259 return tp;
3260 }
3261 rxi_KeepAliveOn(call);
3262 }
3263 } else { /* RX_CLIENT_CONNECTION and No call allocated */
3264 /* This packet can't be for this call. If the new call address is
3265 * 0 then no call is running on this channel. If there is a call
3266 * then, since this is a client connection we're getting data for
3267 * it must be for the previous call.
3268 */
3269 if (rx_stats_active)
3270 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3271 MUTEX_ENTER(&rx_refcnt_mutex);
3272 conn->refCount--;
3273 MUTEX_EXIT(&rx_refcnt_mutex);
3274 return np;
3275 }
3276
3277 /* There is a non-NULL locked call at this point */
3278 if (type == RX_SERVER_CONNECTION1) { /* We're the server */
3279 if (np->header.callNumber < currentCallNumber) {
3280 MUTEX_EXIT(&call->lock);
3281 if (rx_stats_active)
3282 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3283 MUTEX_ENTER(&rx_refcnt_mutex);
3284 conn->refCount--;
3285 MUTEX_EXIT(&rx_refcnt_mutex);
3286 return np;
3287 } else if (np->header.callNumber != currentCallNumber) {
3288 /* Wait until the transmit queue is idle before deciding
3289 * whether to reset the current call. Chances are that the
3290 * call will be in ether DALLY or HOLD state once the TQ_BUSY
3291 * flag is cleared.
3292 */
3293#ifdef AFS_GLOBAL_RXLOCK_KERNEL
3294 if (call->state == RX_STATE_ACTIVE2) {
3295 rxi_WaitforTQBusy(call);
3296 /*
3297 * If we entered error state while waiting,
3298 * must call rxi_CallError to permit rxi_ResetCall
3299 * to processed when the tqWaiter count hits zero.
3300 */
3301 if (call->error) {
3302 rxi_CallError(call, call->error);
3303 MUTEX_EXIT(&call->lock);
3304 MUTEX_ENTER(&rx_refcnt_mutex);
3305 conn->refCount--;
3306 MUTEX_EXIT(&rx_refcnt_mutex);
3307 return np;
3308 }
3309 }
3310#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3311 /* If the new call cannot be taken right now send a busy and set
3312 * the error condition in this call, so that it terminates as
3313 * quickly as possible */
3314 if (call->state == RX_STATE_ACTIVE2) {
3315 struct rx_packet *tp;
3316
3317 rxi_CallError(call, RX_CALL_DEAD(-1));
3318 tp = rxi_SendSpecial(call, conn, np, RX_PACKET_TYPE_BUSY3,
3319 NULL((void *)0), 0, 1);
3320 MUTEX_EXIT(&call->lock);
3321 MUTEX_ENTER(&rx_refcnt_mutex);
3322 conn->refCount--;
3323 MUTEX_EXIT(&rx_refcnt_mutex);
3324 return tp;
3325 }
3326 rxi_ResetCall(call, 0);
3327 *call->callNumber = np->header.callNumber;
3328#ifdef RXDEBUG1
3329 if (np->header.callNumber == 0)
3330 dpf(("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"AFS_PTR_FMT" len %d\n",do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0)
3331 np->header.serial, rx_packetTypes[np->header.type - 1], ntohl(conn->peer->host), ntohs(conn->peer->port),do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0)
3332 np->header.serial, np->header.epoch, np->header.cid, np->header.callNumber, np->header.seq,do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0)
3333 np->header.flags, np, np->length))do { if (rx_debugFile) rxi_DebugPrint ("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"
"p"" len %d\n", np->header.serial, rx_packetTypes[np->header
.type - 1], (__builtin_constant_p(conn->peer->host) ? (
(((__uint32_t)(conn->peer->host)) >> 24) | ((((__uint32_t
)(conn->peer->host)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->peer->host)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->peer->host)) <<
24)) : __bswap32_var(conn->peer->host)), (__builtin_constant_p
(conn->peer->port) ? (__uint16_t)(((__uint16_t)(conn->
peer->port)) << 8 | ((__uint16_t)(conn->peer->
port)) >> 8) : __bswap16_var(conn->peer->port)), np
->header.serial, np->header.epoch, np->header.cid, np
->header.callNumber, np->header.seq, np->header.flags
, np, np->length); } while (0);
3334#endif
3335 call->state = RX_STATE_PRECALL1;
3336 clock_GetTime(&call->queueTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->queueTime)->sec = (afs_int32)tv.tv_sec; (&
call->queueTime)->usec = (afs_int32)tv.tv_usec; } while
(0);
3337 hzero(call->bytesSent)((call->bytesSent).low = 0, (call->bytesSent).high = 0);
3338 hzero(call->bytesRcvd)((call->bytesRcvd).low = 0, (call->bytesRcvd).high = 0);
3339 /*
3340 * If the number of queued calls exceeds the overload
3341 * threshold then abort this call.
3342 */
3343 if ((rx_BusyThreshold > 0) &&
3344 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3345 struct rx_packet *tp;
3346
3347 rxi_CallError(call, rx_BusyError);
3348 tp = rxi_SendCallAbort(call, np, 1, 0);
3349 MUTEX_EXIT(&call->lock);
3350 MUTEX_ENTER(&rx_refcnt_mutex);
3351 conn->refCount--;
3352 MUTEX_EXIT(&rx_refcnt_mutex);
3353 if (rx_stats_active)
3354 rx_atomic_inc(&rx_stats.nBusies);
3355 return tp;
3356 }
3357 rxi_KeepAliveOn(call);
3358 } else {
3359 /* Continuing call; do nothing here. */
3360 }
3361 } else { /* we're the client */
3362 /* Ignore all incoming acknowledgements for calls in DALLY state */
3363 if ((call->state == RX_STATE_DALLY3)
3364 && (np->header.type == RX_PACKET_TYPE_ACK2)) {
3365 if (rx_stats_active)
3366 rx_atomic_inc(&rx_stats.ignorePacketDally);
3367 MUTEX_EXIT(&call->lock);
3368 MUTEX_ENTER(&rx_refcnt_mutex);
3369 conn->refCount--;
3370 MUTEX_EXIT(&rx_refcnt_mutex);
3371 return np;
3372 }
3373
3374 /* Ignore anything that's not relevant to the current call. If there
3375 * isn't a current call, then no packet is relevant. */
3376 if (np->header.callNumber != currentCallNumber) {
3377 if (rx_stats_active)
3378 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3379 MUTEX_EXIT(&call->lock);
3380 MUTEX_ENTER(&rx_refcnt_mutex);
3381 conn->refCount--;
3382 MUTEX_EXIT(&rx_refcnt_mutex);
3383 return np;
3384 }
3385 /* If the service security object index stamped in the packet does not
3386 * match the connection's security index, ignore the packet */
3387 if (np->header.securityIndex != conn->securityIndex) {
3388 MUTEX_EXIT(&call->lock);
3389 MUTEX_ENTER(&rx_refcnt_mutex);
3390 conn->refCount--;
3391 MUTEX_EXIT(&rx_refcnt_mutex);
3392 return np;
3393 }
3394
3395 /* If we're receiving the response, then all transmit packets are
3396 * implicitly acknowledged. Get rid of them. */
3397 if (np->header.type == RX_PACKET_TYPE_DATA1) {
3398#ifdef AFS_GLOBAL_RXLOCK_KERNEL
3399 /* XXX Hack. Because we must release the global rx lock when
3400 * sending packets (osi_NetSend) we drop all acks while we're
3401 * traversing the tq in rxi_Start sending packets out because
3402 * packets may move to the freePacketQueue as result of being here!
3403 * So we drop these packets until we're safely out of the
3404 * traversing. Really ugly!
3405 * For fine grain RX locking, we set the acked field in the
3406 * packets and let rxi_Start remove them from the transmit queue.
3407 */
3408 if (call->flags & RX_CALL_TQ_BUSY128) {
3409#ifdef RX_ENABLE_LOCKS
3410 rxi_SetAcksInTransmitQueue(call);
3411#else
3412 MUTEX_ENTER(&rx_refcnt_mutex);
3413 conn->refCount--;
3414 MUTEX_EXIT(&rx_refcnt_mutex);
3415 return np; /* xmitting; drop packet */
3416#endif
3417 } else {
3418 rxi_ClearTransmitQueue(call, 0);
3419 }
3420#else /* AFS_GLOBAL_RXLOCK_KERNEL */
3421 rxi_ClearTransmitQueue(call, 0);
3422#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3423 } else {
3424 if (np->header.type == RX_PACKET_TYPE_ACK2) {
3425 /* now check to see if this is an ack packet acknowledging that the
3426 * server actually *lost* some hard-acked data. If this happens we
3427 * ignore this packet, as it may indicate that the server restarted in
3428 * the middle of a call. It is also possible that this is an old ack
3429 * packet. We don't abort the connection in this case, because this
3430 * *might* just be an old ack packet. The right way to detect a server
3431 * restart in the midst of a call is to notice that the server epoch
3432 * changed, btw. */
3433 /* XXX I'm not sure this is exactly right, since tfirst **IS**
3434 * XXX unacknowledged. I think that this is off-by-one, but
3435 * XXX I don't dare change it just yet, since it will
3436 * XXX interact badly with the server-restart detection
3437 * XXX code in receiveackpacket. */
3438 if (ntohl(rx_GetInt32(np, FIRSTACKOFFSET))(__builtin_constant_p((( (4) >= (np)->wirevec[1].iov_len
) ? rx_SlowGetInt32((np), (4)) : *((afs_int32 *)((char *)((np
)->wirevec[1].iov_base) + (4))))) ? ((((__uint32_t)((( (4)
>= (np)->wirevec[1].iov_len) ? rx_SlowGetInt32((np), (
4)) : *((afs_int32 *)((char *)((np)->wirevec[1].iov_base) +
(4)))))) >> 24) | ((((__uint32_t)((( (4) >= (np)->
wirevec[1].iov_len) ? rx_SlowGetInt32((np), (4)) : *((afs_int32
*)((char *)((np)->wirevec[1].iov_base) + (4)))))) & (
0xff << 16)) >> 8) | ((((__uint32_t)((( (4) >=
(np)->wirevec[1].iov_len) ? rx_SlowGetInt32((np), (4)) : *
((afs_int32 *)((char *)((np)->wirevec[1].iov_base) + (4)))
))) & (0xff << 8)) << 8) | (((__uint32_t)((( (
4) >= (np)->wirevec[1].iov_len) ? rx_SlowGetInt32((np),
(4)) : *((afs_int32 *)((char *)((np)->wirevec[1].iov_base
) + (4)))))) << 24)) : __bswap32_var((( (4) >= (np)->
wirevec[1].iov_len) ? rx_SlowGetInt32((np), (4)) : *((afs_int32
*)((char *)((np)->wirevec[1].iov_base) + (4)))))) < call->tfirst) {
3439 if (rx_stats_active)
3440 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3441 MUTEX_EXIT(&call->lock);
3442 MUTEX_ENTER(&rx_refcnt_mutex);
3443 conn->refCount--;
3444 MUTEX_EXIT(&rx_refcnt_mutex);
3445 return np;
3446 }
3447 }
3448 } /* else not a data packet */
3449 }
3450
3451 osirx_AssertMine(&call->lock, "rxi_ReceivePacket middle");
3452 /* Set remote user defined status from packet */
3453 call->remoteStatus = np->header.userStatus;
3454
3455 /* Note the gap between the expected next packet and the actual
3456 * packet that arrived, when the new packet has a smaller serial number
3457 * than expected. Rioses frequently reorder packets all by themselves,
3458 * so this will be quite important with very large window sizes.
3459 * Skew is checked against 0 here to avoid any dependence on the type of
3460 * inPacketSkew (which may be unsigned). In C, -1 > (unsigned) 0 is always
3461 * true!
3462 * The inPacketSkew should be a smoothed running value, not just a maximum. MTUXXX
3463 * see CalculateRoundTripTime for an example of how to keep smoothed values.
3464 * I think using a beta of 1/8 is probably appropriate. 93.04.21
3465 */
3466 MUTEX_ENTER(&conn->conn_data_lock);
3467 skew = conn->lastSerial - np->header.serial;
3468 conn->lastSerial = np->header.serial;
3469 MUTEX_EXIT(&conn->conn_data_lock);
3470 if (skew > 0) {
3471 struct rx_peer *peer;
3472 peer = conn->peer;
3473 if (skew > peer->inPacketSkew) {
3474 dpf(("*** In skew changed from %d to %d\n",do { if (rx_debugFile) rxi_DebugPrint ("*** In skew changed from %d to %d\n"
, peer->inPacketSkew, skew); } while (0)
3475 peer->inPacketSkew, skew))do { if (rx_debugFile) rxi_DebugPrint ("*** In skew changed from %d to %d\n"
, peer->inPacketSkew, skew); } while (0);
3476 peer->inPacketSkew = skew;
3477 }
3478 }
3479
3480 /* Now do packet type-specific processing */
3481 switch (np->header.type) {
3482 case RX_PACKET_TYPE_DATA1:
3483 np = rxi_ReceiveDataPacket(call, np, 1, socket, host, port, tnop,
3484 newcallp);
3485 break;
3486 case RX_PACKET_TYPE_ACK2:
3487 /* Respond immediately to ack packets requesting acknowledgement
3488 * (ping packets) */
3489 if (np->header.flags & RX_REQUEST_ACK2) {
3490 if (call->error)
3491 (void)rxi_SendCallAbort(call, 0, 1, 0);
3492 else
3493 (void)rxi_SendAck(call, 0, np->header.serial,
3494 RX_ACK_PING_RESPONSE7, 1);
3495 }
3496 np = rxi_ReceiveAckPacket(call, np, 1);
3497 break;
3498 case RX_PACKET_TYPE_ABORT4: {
3499 /* An abort packet: reset the call, passing the error up to the user. */
3500 /* What if error is zero? */
3501 /* What if the error is -1? the application will treat it as a timeout. */
3502 afs_int32 errdata = ntohl(*(afs_int32 *) rx_DataOf(np))(__builtin_constant_p(*(afs_int32 *) ((char *) (np)->wirevec
[1].iov_base)) ? ((((__uint32_t)(*(afs_int32 *) ((char *) (np
)->wirevec[1].iov_base))) >> 24) | ((((__uint32_t)(*
(afs_int32 *) ((char *) (np)->wirevec[1].iov_base))) &
(0xff << 16)) >> 8) | ((((__uint32_t)(*(afs_int32
*) ((char *) (np)->wirevec[1].iov_base))) & (0xff <<
8)) << 8) | (((__uint32_t)(*(afs_int32 *) ((char *) (np
)->wirevec[1].iov_base))) << 24)) : __bswap32_var(*(
afs_int32 *) ((char *) (np)->wirevec[1].iov_base)));
3503 dpf(("rxi_ReceivePacket ABORT rx_DataOf = %d\n", errdata))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ReceivePacket ABORT rx_DataOf = %d\n"
, errdata); } while (0);
3504 rxi_CallError(call, errdata);
3505 MUTEX_EXIT(&call->lock);
3506 MUTEX_ENTER(&rx_refcnt_mutex);
3507 conn->refCount--;
3508 MUTEX_EXIT(&rx_refcnt_mutex);
3509 return np; /* xmitting; drop packet */
3510 }
3511 case RX_PACKET_TYPE_BUSY3: {
3512 struct clock busyTime;
3513 clock_NewTime();
3514 clock_GetTime(&busyTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&busyTime)->sec = (afs_int32)tv.tv_sec; (&busyTime
)->usec = (afs_int32)tv.tv_usec; } while(0);
3515
3516 MUTEX_EXIT(&call->lock);
3517
3518 MUTEX_ENTER(&conn->conn_call_lock);
3519 MUTEX_ENTER(&call->lock);
3520 conn->lastBusy[call->channel] = busyTime.sec;
3521 call->flags |= RX_CALL_PEER_BUSY0x20000;
3522 MUTEX_EXIT(&call->lock);
3523 MUTEX_EXIT(&conn->conn_call_lock);
3524
3525 MUTEX_ENTER(&rx_refcnt_mutex);
3526 conn->refCount--;
3527 MUTEX_EXIT(&rx_refcnt_mutex);
3528 return np;
3529 }
3530
3531 case RX_PACKET_TYPE_ACKALL5:
3532 /* All packets acknowledged, so we can drop all packets previously
3533 * readied for sending */
3534#ifdef AFS_GLOBAL_RXLOCK_KERNEL
3535 /* XXX Hack. We because we can't release the global rx lock when
3536 * sending packets (osi_NetSend) we drop all ack pkts while we're
3537 * traversing the tq in rxi_Start sending packets out because
3538 * packets may move to the freePacketQueue as result of being
3539 * here! So we drop these packets until we're safely out of the
3540 * traversing. Really ugly!
3541 * For fine grain RX locking, we set the acked field in the packets
3542 * and let rxi_Start remove the packets from the transmit queue.
3543 */
3544 if (call->flags & RX_CALL_TQ_BUSY128) {
3545#ifdef RX_ENABLE_LOCKS
3546 rxi_SetAcksInTransmitQueue(call);
3547 break;
3548#else /* RX_ENABLE_LOCKS */
3549 MUTEX_EXIT(&call->lock);
3550 MUTEX_ENTER(&rx_refcnt_mutex);
3551 conn->refCount--;
3552 MUTEX_EXIT(&rx_refcnt_mutex);
3553 return np; /* xmitting; drop packet */
3554#endif /* RX_ENABLE_LOCKS */
3555 }
3556#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3557 rxi_ClearTransmitQueue(call, 0);
3558 break;
3559 default:
3560 /* Should not reach here, unless the peer is broken: send an abort
3561 * packet */
3562 rxi_CallError(call, RX_PROTOCOL_ERROR(-5));
3563 np = rxi_SendCallAbort(call, np, 1, 0);
3564 break;
3565 };
3566 /* Note when this last legitimate packet was received, for keep-alive
3567 * processing. Note, we delay getting the time until now in the hope that
3568 * the packet will be delivered to the user before any get time is required
3569 * (if not, then the time won't actually be re-evaluated here). */
3570 call->lastReceiveTime = clock_Sec()(time(((void *)0)));
3571 /* we've received a legit packet, so the channel is not busy */
3572 call->flags &= ~RX_CALL_PEER_BUSY0x20000;
3573 MUTEX_EXIT(&call->lock);
3574 MUTEX_ENTER(&rx_refcnt_mutex);
3575 conn->refCount--;
3576 MUTEX_EXIT(&rx_refcnt_mutex);
3577 return np;
3578}
3579
3580/* return true if this is an "interesting" connection from the point of view
3581 of someone trying to debug the system */
3582int
3583rxi_IsConnInteresting(struct rx_connection *aconn)
3584{
3585 int i;
3586 struct rx_call *tcall;
3587
3588 if (aconn->flags & (RX_CONN_MAKECALL_WAITING1 | RX_CONN_DESTROY_ME2))
3589 return 1;
3590
3591 for (i = 0; i < RX_MAXCALLS4; i++) {
3592 tcall = aconn->call[i];
3593 if (tcall) {
3594 if ((tcall->state == RX_STATE_PRECALL1)
3595 || (tcall->state == RX_STATE_ACTIVE2))
3596 return 1;
3597 if ((tcall->mode == RX_MODE_SENDING1)
3598 || (tcall->mode == RX_MODE_RECEIVING2))
3599 return 1;
3600 }
3601 }
3602 return 0;
3603}
3604
3605#ifdef KERNEL
3606/* if this is one of the last few packets AND it wouldn't be used by the
3607 receiving call to immediately satisfy a read request, then drop it on
3608 the floor, since accepting it might prevent a lock-holding thread from
3609 making progress in its reading. If a call has been cleared while in
3610 the precall state then ignore all subsequent packets until the call
3611 is assigned to a thread. */
3612
3613static int
3614TooLow(struct rx_packet *ap, struct rx_call *acall)
3615{
3616 int rc = 0;
3617
3618 MUTEX_ENTER(&rx_quota_mutex);
3619 if (((ap->header.seq != 1) && (acall->flags & RX_CALL_CLEARED64)
3620 && (acall->state == RX_STATE_PRECALL1))
3621 || ((rx_nFreePackets < rxi_dataQuota + 2)
3622 && !((ap->header.seq < acall->rnext + rx_initSendWindow)
3623 && (acall->flags & RX_CALL_READER_WAIT1)))) {
3624 rc = 1;
3625 }
3626 MUTEX_EXIT(&rx_quota_mutex);
3627 return rc;
3628}
3629#endif /* KERNEL */
3630
3631static void
3632rxi_CheckReachEvent(struct rxevent *event, void *arg1, void *arg2)
3633{
3634 struct rx_connection *conn = arg1;
3635 struct rx_call *acall = arg2;
3636 struct rx_call *call = acall;
3637 struct clock when, now;
3638 int i, waiting;
3639
3640 MUTEX_ENTER(&conn->conn_data_lock);
3641 conn->checkReachEvent = NULL((void *)0);
3642 waiting = conn->flags & RX_CONN_ATTACHWAIT64;
3643 if (event) {
3644 MUTEX_ENTER(&rx_refcnt_mutex);
3645 conn->refCount--;
3646 MUTEX_EXIT(&rx_refcnt_mutex);
3647 }
3648 MUTEX_EXIT(&conn->conn_data_lock);
3649
3650 if (waiting) {
3651 if (!call) {
3652 MUTEX_ENTER(&conn->conn_call_lock);
3653 MUTEX_ENTER(&conn->conn_data_lock);
3654 for (i = 0; i < RX_MAXCALLS4; i++) {
3655 struct rx_call *tc = conn->call[i];
3656 if (tc && tc->state == RX_STATE_PRECALL1) {
3657 call = tc;
3658 break;
3659 }
3660 }
3661 if (!call)
3662 /* Indicate that rxi_CheckReachEvent is no longer running by
3663 * clearing the flag. Must be atomic under conn_data_lock to
3664 * avoid a new call slipping by: rxi_CheckConnReach holds
3665 * conn_data_lock while checking RX_CONN_ATTACHWAIT.
3666 */
3667 conn->flags &= ~RX_CONN_ATTACHWAIT64;
3668 MUTEX_EXIT(&conn->conn_data_lock);
3669 MUTEX_EXIT(&conn->conn_call_lock);
3670 }
3671
3672 if (call) {
3673 if (call != acall)
3674 MUTEX_ENTER(&call->lock);
3675 rxi_SendAck(call, NULL((void *)0), 0, RX_ACK_PING6, 0);
3676 if (call != acall)
3677 MUTEX_EXIT(&call->lock);
3678
3679 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
3680 when = now;
3681 when.sec += RX_CHECKREACH_TIMEOUT2;
3682 MUTEX_ENTER(&conn->conn_data_lock);
3683 if (!conn->checkReachEvent) {
3684 MUTEX_ENTER(&rx_refcnt_mutex);
3685 conn->refCount++;
3686 MUTEX_EXIT(&rx_refcnt_mutex);
3687 conn->checkReachEvent =
3688 rxevent_PostNow(&when, &now, rxi_CheckReachEvent, conn,
3689 NULL((void *)0));
3690 }
3691 MUTEX_EXIT(&conn->conn_data_lock);
3692 }
3693 }
3694}
3695
3696static int
3697rxi_CheckConnReach(struct rx_connection *conn, struct rx_call *call)
3698{
3699 struct rx_service *service = conn->service;
3700 struct rx_peer *peer = conn->peer;
3701 afs_uint32 now, lastReach;
3702
3703 if (service->checkReach == 0)
3704 return 0;
3705
3706 now = clock_Sec()(time(((void *)0)));
3707 MUTEX_ENTER(&peer->peer_lock);
3708 lastReach = peer->lastReachTime;
3709 MUTEX_EXIT(&peer->peer_lock);
3710 if (now - lastReach < RX_CHECKREACH_TTL60)
3711 return 0;
3712
3713 MUTEX_ENTER(&conn->conn_data_lock);
3714 if (conn->flags & RX_CONN_ATTACHWAIT64) {
3715 MUTEX_EXIT(&conn->conn_data_lock);
3716 return 1;
3717 }
3718 conn->flags |= RX_CONN_ATTACHWAIT64;
3719 MUTEX_EXIT(&conn->conn_data_lock);
3720 if (!conn->checkReachEvent)
3721 rxi_CheckReachEvent(NULL((void *)0), conn, call);
3722
3723 return 1;
3724}
3725
3726/* try to attach call, if authentication is complete */
3727static void
3728TryAttach(struct rx_call *acall, osi_socket socket,
3729 int *tnop, struct rx_call **newcallp,
3730 int reachOverride)
3731{
3732 struct rx_connection *conn = acall->conn;
3733
3734 if (conn->type == RX_SERVER_CONNECTION1
3735 && acall->state == RX_STATE_PRECALL1) {
3736 /* Don't attach until we have any req'd. authentication. */
3737 if (RXS_CheckAuthentication(conn->securityObject, conn)((conn->securityObject && (conn->securityObject
->ops->op_CheckAuthentication)) ? (*(conn->securityObject
)->ops->op_CheckAuthentication)(conn->securityObject
,conn) : 0) == 0) {
3738 if (reachOverride || rxi_CheckConnReach(conn, acall) == 0)
3739 rxi_AttachServerProc(acall, socket, tnop, newcallp);
3740 /* Note: this does not necessarily succeed; there
3741 * may not any proc available
3742 */
3743 } else {
3744 rxi_ChallengeOn(acall->conn);
3745 }
3746 }
3747}
3748
3749/* A data packet has been received off the interface. This packet is
3750 * appropriate to the call (the call is in the right state, etc.). This
3751 * routine can return a packet to the caller, for re-use */
3752
3753struct rx_packet *
3754rxi_ReceiveDataPacket(struct rx_call *call,
3755 struct rx_packet *np, int istack,
3756 osi_socket socket, afs_uint32 host, u_short port,
3757 int *tnop, struct rx_call **newcallp)
3758{
3759 int ackNeeded = 0; /* 0 means no, otherwise ack_reason */
3760 int newPackets = 0;
3761 int didHardAck = 0;
3762 int haveLast = 0;
3763 afs_uint32 seq;
3764 afs_uint32 serial=0, flags=0;
3765 int isFirst;
3766 struct rx_packet *tnp;
3767 struct clock when, now;
3768 if (rx_stats_active)
3769 rx_atomic_inc(&rx_stats.dataPacketsRead);
3770
3771#ifdef KERNEL
3772 /* If there are no packet buffers, drop this new packet, unless we can find
3773 * packet buffers from inactive calls */
3774 if (!call->error
3775 && (rxi_OverQuota(RX_PACKET_CLASS_RECEIVE0) || TooLow(np, call))) {
3776 MUTEX_ENTER(&rx_freePktQ_lock);
3777 rxi_NeedMorePackets = TRUE1;
3778 MUTEX_EXIT(&rx_freePktQ_lock);
3779 if (rx_stats_active)
3780 rx_atomic_inc(&rx_stats.noPacketBuffersOnRead);
3781 call->rprev = np->header.serial;
3782 rxi_calltrace(RX_TRACE_DROP3, call);
3783 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - quota problems\n", np))do { if (rx_debugFile) rxi_DebugPrint ("packet %""p"" dropped on receipt - quota problems\n"
, np); } while (0);
3784 if (rxi_doreclaim)
3785 rxi_ClearReceiveQueue(call);
3786 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
3787 when = now;
3788 clock_Add(&when, &rx_softAckDelay)do { (&when)->sec += (&rx_softAckDelay)->sec; if
(((&when)->usec += (&rx_softAckDelay)->usec) >=
1000000) { (&when)->usec -= 1000000; (&when)->
sec++; } } while(0);
3789 if (!call->delayedAckEvent
3790 || clock_Gt(&call->delayedAckEvent->eventTime, &when)((&call->delayedAckEvent->eventTime)->sec>(&
when)->sec || ((&call->delayedAckEvent->eventTime
)->sec==(&when)->sec && (&call->delayedAckEvent
->eventTime)->usec>(&when)->usec))) {
3791 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
3792 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
3793 MUTEX_ENTER(&rx_refcnt_mutex);
3794 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
3795 MUTEX_EXIT(&rx_refcnt_mutex);
3796
3797 call->delayedAckEvent =
3798 rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
3799 }
3800 /* we've damaged this call already, might as well do it in. */
3801 return np;
3802 }
3803#endif /* KERNEL */
3804
3805 /*
3806 * New in AFS 3.5, if the RX_JUMBO_PACKET flag is set then this
3807 * packet is one of several packets transmitted as a single
3808 * datagram. Do not send any soft or hard acks until all packets
3809 * in a jumbogram have been processed. Send negative acks right away.
3810 */
3811 for (isFirst = 1, tnp = NULL((void *)0); isFirst || tnp; isFirst = 0) {
3812 /* tnp is non-null when there are more packets in the
3813 * current jumbo gram */
3814 if (tnp) {
3815 if (np)
3816 rxi_FreePacket(np);
3817 np = tnp;
3818 }
3819
3820 seq = np->header.seq;
3821 serial = np->header.serial;
3822 flags = np->header.flags;
3823
3824 /* If the call is in an error state, send an abort message */
3825 if (call->error)
3826 return rxi_SendCallAbort(call, np, istack, 0);
3827
3828 /* The RX_JUMBO_PACKET is set in all but the last packet in each
3829 * AFS 3.5 jumbogram. */
3830 if (flags & RX_JUMBO_PACKET32) {
3831 tnp = rxi_SplitJumboPacket(np, host, port, isFirst);
3832 } else {
3833 tnp = NULL((void *)0);
3834 }
3835
3836 if (np->header.spare != 0) {
3837 MUTEX_ENTER(&call->conn->conn_data_lock);
3838 call->conn->flags |= RX_CONN_USING_PACKET_CKSUM4;
3839 MUTEX_EXIT(&call->conn->conn_data_lock);
3840 }
3841
3842 /* The usual case is that this is the expected next packet */
3843 if (seq == call->rnext) {
3844
3845 /* Check to make sure it is not a duplicate of one already queued */
3846 if (queue_IsNotEmpty(&call->rq)(((struct rx_queue *)(&call->rq))->next != ((struct
rx_queue *)(&call->rq)))
3847 && queue_First(&call->rq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&call->rq))->
next)->header.seq == seq) {
3848 if (rx_stats_active)
3849 rx_atomic_inc(&rx_stats.dupPacketsRead);
3850 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - duplicate\n", np))do { if (rx_debugFile) rxi_DebugPrint ("packet %""p"" dropped on receipt - duplicate\n"
, np); } while (0);
3851 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
3852 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
3853 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE2, istack);
3854 ackNeeded = 0;
3855 call->rprev = seq;
3856 continue;
3857 }
3858
3859 /* It's the next packet. Stick it on the receive queue
3860 * for this call. Set newPackets to make sure we wake
3861 * the reader once all packets have been processed */
3862#ifdef RX_TRACK_PACKETS
3863 np->flags |= RX_PKTFLAG_RQ;
3864#endif
3865 queue_Prepend(&call->rq, np)(((((struct rx_queue *)(np))->next=((struct rx_queue *)(&
call->rq))->next)->prev=((struct rx_queue *)(np)))->
prev=((struct rx_queue *)(&call->rq)), ((struct rx_queue
*)(&call->rq))->next=((struct rx_queue *)(np)));
3866#ifdef RXDEBUG_PACKET
3867 call->rqc++;
3868#endif /* RXDEBUG_PACKET */
3869 call->nSoftAcks++;
3870 np = NULL((void *)0); /* We can't use this anymore */
3871 newPackets = 1;
3872
3873 /* If an ack is requested then set a flag to make sure we
3874 * send an acknowledgement for this packet */
3875 if (flags & RX_REQUEST_ACK2) {
3876 ackNeeded = RX_ACK_REQUESTED1;
3877 }
3878
3879 /* Keep track of whether we have received the last packet */
3880 if (flags & RX_LAST_PACKET4) {
3881 call->flags |= RX_CALL_HAVE_LAST32768;
3882 haveLast = 1;
3883 }
3884
3885 /* Check whether we have all of the packets for this call */
3886 if (call->flags & RX_CALL_HAVE_LAST32768) {
3887 afs_uint32 tseq; /* temporary sequence number */
3888 struct rx_packet *tp; /* Temporary packet pointer */
3889 struct rx_packet *nxp; /* Next pointer, for queue_Scan */
3890
3891 for (tseq = seq, queue_Scan(&call->rq, tp, nxp, rx_packet)(tp) = ((struct rx_packet *)((struct rx_queue *)(&call->
rq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(tp))->next); !(((struct rx_queue *)(&call->rq)) ==
((struct rx_queue *)(tp))); (tp) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(tp))->next)) {
3892 if (tseq != tp->header.seq)
3893 break;
3894 if (tp->header.flags & RX_LAST_PACKET4) {
3895 call->flags |= RX_CALL_RECEIVE_DONE32;
3896 break;
3897 }
3898 tseq++;
3899 }
3900 }
3901
3902 /* Provide asynchronous notification for those who want it
3903 * (e.g. multi rx) */
3904 if (call->arrivalProc) {
3905 (*call->arrivalProc) (call, call->arrivalProcHandle,
3906 call->arrivalProcArg);
3907 call->arrivalProc = (void (*)())0;
3908 }
3909
3910 /* Update last packet received */
3911 call->rprev = seq;
3912
3913 /* If there is no server process serving this call, grab
3914 * one, if available. We only need to do this once. If a
3915 * server thread is available, this thread becomes a server
3916 * thread and the server thread becomes a listener thread. */
3917 if (isFirst) {
3918 TryAttach(call, socket, tnop, newcallp, 0);
3919 }
3920 }
3921 /* This is not the expected next packet. */
3922 else {
3923 /* Determine whether this is a new or old packet, and if it's
3924 * a new one, whether it fits into the current receive window.
3925 * Also figure out whether the packet was delivered in sequence.
3926 * We use the prev variable to determine whether the new packet
3927 * is the successor of its immediate predecessor in the
3928 * receive queue, and the missing flag to determine whether
3929 * any of this packets predecessors are missing. */
3930
3931 afs_uint32 prev; /* "Previous packet" sequence number */
3932 struct rx_packet *tp; /* Temporary packet pointer */
3933 struct rx_packet *nxp; /* Next pointer, for queue_Scan */
3934 int missing; /* Are any predecessors missing? */
3935
3936 /* If the new packet's sequence number has been sent to the
3937 * application already, then this is a duplicate */
3938 if (seq < call->rnext) {
3939 if (rx_stats_active)
3940 rx_atomic_inc(&rx_stats.dupPacketsRead);
3941 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
3942 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
3943 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE2, istack);
3944 ackNeeded = 0;
3945 call->rprev = seq;
3946 continue;
3947 }
3948
3949 /* If the sequence number is greater than what can be
3950 * accomodated by the current window, then send a negative
3951 * acknowledge and drop the packet */
3952 if ((call->rnext + call->rwind) <= seq) {
3953 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
3954 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
3955 np = rxi_SendAck(call, np, serial, RX_ACK_EXCEEDS_WINDOW4,
3956 istack);
3957 ackNeeded = 0;
3958 call->rprev = seq;
3959 continue;
3960 }
3961
3962 /* Look for the packet in the queue of old received packets */
3963 for (prev = call->rnext - 1, missing =
3964 0, queue_Scan(&call->rq, tp, nxp, rx_packet)(tp) = ((struct rx_packet *)((struct rx_queue *)(&call->
rq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(tp))->next); !(((struct rx_queue *)(&call->rq)) ==
((struct rx_queue *)(tp))); (tp) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(tp))->next)) {
3965 /*Check for duplicate packet */
3966 if (seq == tp->header.seq) {
3967 if (rx_stats_active)
3968 rx_atomic_inc(&rx_stats.dupPacketsRead);
3969 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
3970 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
3971 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE2,
3972 istack);
3973 ackNeeded = 0;
3974 call->rprev = seq;
3975 goto nextloop;
3976 }
3977 /* If we find a higher sequence packet, break out and
3978 * insert the new packet here. */
3979 if (seq < tp->header.seq)
3980 break;
3981 /* Check for missing packet */
3982 if (tp->header.seq != prev + 1) {
3983 missing = 1;
3984 }
3985
3986 prev = tp->header.seq;
3987 }
3988
3989 /* Keep track of whether we have received the last packet. */
3990 if (flags & RX_LAST_PACKET4) {
3991 call->flags |= RX_CALL_HAVE_LAST32768;
3992 }
3993
3994 /* It's within the window: add it to the the receive queue.
3995 * tp is left by the previous loop either pointing at the
3996 * packet before which to insert the new packet, or at the
3997 * queue head if the queue is empty or the packet should be
3998 * appended. */
3999#ifdef RX_TRACK_PACKETS
4000 np->flags |= RX_PKTFLAG_RQ;
4001#endif
4002#ifdef RXDEBUG_PACKET
4003 call->rqc++;
4004#endif /* RXDEBUG_PACKET */
4005 queue_InsertBefore(tp, np)(((((struct rx_queue *)(np))->prev=((struct rx_queue *)(tp
))->prev)->next=((struct rx_queue *)(np)))->next=((struct
rx_queue *)(tp)), ((struct rx_queue *)(tp))->prev=((struct
rx_queue *)(np)));
4006 call->nSoftAcks++;
4007 np = NULL((void *)0);
4008
4009 /* Check whether we have all of the packets for this call */
4010 if ((call->flags & RX_CALL_HAVE_LAST32768)
4011 && !(call->flags & RX_CALL_RECEIVE_DONE32)) {
4012 afs_uint32 tseq; /* temporary sequence number */
4013
4014 for (tseq =
4015 call->rnext, queue_Scan(&call->rq, tp, nxp, rx_packet)(tp) = ((struct rx_packet *)((struct rx_queue *)(&call->
rq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(tp))->next); !(((struct rx_queue *)(&call->rq)) ==
((struct rx_queue *)(tp))); (tp) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(tp))->next)) {
4016 if (tseq != tp->header.seq)
4017 break;
4018 if (tp->header.flags & RX_LAST_PACKET4) {
4019 call->flags |= RX_CALL_RECEIVE_DONE32;
4020 break;
4021 }
4022 tseq++;
4023 }
4024 }
4025
4026 /* We need to send an ack of the packet is out of sequence,
4027 * or if an ack was requested by the peer. */
4028 if (seq != prev + 1 || missing) {
4029 ackNeeded = RX_ACK_OUT_OF_SEQUENCE3;
4030 } else if (flags & RX_REQUEST_ACK2) {
4031 ackNeeded = RX_ACK_REQUESTED1;
4032 }
4033
4034 /* Acknowledge the last packet for each call */
4035 if (flags & RX_LAST_PACKET4) {
4036 haveLast = 1;
4037 }
4038
4039 call->rprev = seq;
4040 }
4041 nextloop:;
4042 }
4043
4044 if (newPackets) {
4045 /*
4046 * If the receiver is waiting for an iovec, fill the iovec
4047 * using the data from the receive queue */
4048 if (call->flags & RX_CALL_IOVEC_WAIT16384) {
4049 didHardAck = rxi_FillReadVec(call, serial);
4050 /* the call may have been aborted */
4051 if (call->error) {
4052 return NULL((void *)0);
4053 }
4054 if (didHardAck) {
4055 ackNeeded = 0;
4056 }
4057 }
4058
4059 /* Wakeup the reader if any */
4060 if ((call->flags & RX_CALL_READER_WAIT1)
4061 && (!(call->flags & RX_CALL_IOVEC_WAIT16384) || !(call->iovNBytes)
4062 || (call->iovNext >= call->iovMax)
4063 || (call->flags & RX_CALL_RECEIVE_DONE32))) {
4064 call->flags &= ~RX_CALL_READER_WAIT1;
4065#ifdef RX_ENABLE_LOCKS
4066 CV_BROADCAST(&call->cv_rq);
4067#else
4068 osi_rxWakeup(&call->rq)rxi_Wakeup(&call->rq);
4069#endif
4070 }
4071 }
4072
4073 /*
4074 * Send an ack when requested by the peer, or once every
4075 * rxi_SoftAckRate packets until the last packet has been
4076 * received. Always send a soft ack for the last packet in
4077 * the server's reply. */
4078 if (ackNeeded) {
4079 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
4080 np = rxi_SendAck(call, np, serial, ackNeeded, istack);
4081 } else if (call->nSoftAcks > (u_short) rxi_SoftAckRate) {
4082 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
4083 np = rxi_SendAck(call, np, serial, RX_ACK_IDLE9, istack);
4084 } else if (call->nSoftAcks) {
4085 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
4086 when = now;
4087 if (haveLast && !(flags & RX_CLIENT_INITIATED1)) {
4088 clock_Add(&when, &rx_lastAckDelay)do { (&when)->sec += (&rx_lastAckDelay)->sec; if
(((&when)->usec += (&rx_lastAckDelay)->usec) >=
1000000) { (&when)->usec -= 1000000; (&when)->
sec++; } } while(0);
4089 } else {
4090 clock_Add(&when, &rx_softAckDelay)do { (&when)->sec += (&rx_softAckDelay)->sec; if
(((&when)->usec += (&rx_softAckDelay)->usec) >=
1000000) { (&when)->usec -= 1000000; (&when)->
sec++; } } while(0);
4091 }
4092 if (!call->delayedAckEvent
4093 || clock_Gt(&call->delayedAckEvent->eventTime, &when)((&call->delayedAckEvent->eventTime)->sec>(&
when)->sec || ((&call->delayedAckEvent->eventTime
)->sec==(&when)->sec && (&call->delayedAckEvent
->eventTime)->usec>(&when)->usec))) {
4094 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
4095 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
4096 MUTEX_ENTER(&rx_refcnt_mutex);
4097 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
4098 MUTEX_EXIT(&rx_refcnt_mutex);
4099 call->delayedAckEvent =
4100 rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
4101 }
4102 } else if (call->flags & RX_CALL_RECEIVE_DONE32) {
4103 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
4104 }
4105
4106 return np;
4107}
4108
4109#ifdef ADAPT_WINDOW
4110static void rxi_ComputeRate();
4111#endif
4112
4113static void
4114rxi_UpdatePeerReach(struct rx_connection *conn, struct rx_call *acall)
4115{
4116 struct rx_peer *peer = conn->peer;
4117
4118 MUTEX_ENTER(&peer->peer_lock);
4119 peer->lastReachTime = clock_Sec()(time(((void *)0)));
4120 MUTEX_EXIT(&peer->peer_lock);
4121
4122 MUTEX_ENTER(&conn->conn_data_lock);
4123 if (conn->flags & RX_CONN_ATTACHWAIT64) {
4124 int i;
4125
4126 conn->flags &= ~RX_CONN_ATTACHWAIT64;
4127 MUTEX_EXIT(&conn->conn_data_lock);
4128
4129 for (i = 0; i < RX_MAXCALLS4; i++) {
4130 struct rx_call *call = conn->call[i];
4131 if (call) {
4132 if (call != acall)
4133 MUTEX_ENTER(&call->lock);
4134 /* tnop can be null if newcallp is null */
4135 TryAttach(call, (osi_socket) - 1, NULL((void *)0), NULL((void *)0), 1);
4136 if (call != acall)
4137 MUTEX_EXIT(&call->lock);
4138 }
4139 }
4140 } else
4141 MUTEX_EXIT(&conn->conn_data_lock);
4142}
4143
4144#if defined(RXDEBUG1) && defined(AFS_NT40_ENV)
4145static const char *
4146rx_ack_reason(int reason)
4147{
4148 switch (reason) {
4149 case RX_ACK_REQUESTED1:
4150 return "requested";
4151 case RX_ACK_DUPLICATE2:
4152 return "duplicate";
4153 case RX_ACK_OUT_OF_SEQUENCE3:
4154 return "sequence";
4155 case RX_ACK_EXCEEDS_WINDOW4:
4156 return "window";
4157 case RX_ACK_NOSPACE5:
4158 return "nospace";
4159 case RX_ACK_PING6:
4160 return "ping";
4161 case RX_ACK_PING_RESPONSE7:
4162 return "response";
4163 case RX_ACK_DELAY8:
4164 return "delay";
4165 case RX_ACK_IDLE9:
4166 return "idle";
4167 default:
4168 return "unknown!!";
4169 }
4170}
4171#endif
4172
4173
4174/* The real smarts of the whole thing. */
4175struct rx_packet *
4176rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
4177 int istack)
4178{
4179 struct rx_ackPacket *ap;
4180 int nAcks;
4181 struct rx_packet *tp;
4182 struct rx_packet *nxp; /* Next packet pointer for queue_Scan */
4183 struct rx_connection *conn = call->conn;
4184 struct rx_peer *peer = conn->peer;
4185 struct clock now; /* Current time, for RTT calculations */
4186 afs_uint32 first;
4187 afs_uint32 prev;
4188 afs_uint32 serial;
4189 /* because there are CM's that are bogus, sending weird values for this. */
4190 afs_uint32 skew = 0;
4191 int nbytes;
4192 int missing;
4193 int acked;
4194 int nNacked = 0;
4195 int newAckCount = 0;
4196 int maxDgramPackets = 0; /* Set if peer supports AFS 3.5 jumbo datagrams */
4197 int pktsize = 0; /* Set if we need to update the peer mtu */
4198 int conn_data_locked = 0;
4199
4200 if (rx_stats_active)
4201 rx_atomic_inc(&rx_stats.ackPacketsRead);
4202 ap = (struct rx_ackPacket *)rx_DataOf(np)((char *) (np)->wirevec[1].iov_base);
4203 nbytes = rx_Contiguous(np)((((unsigned) (np)->length)<((unsigned) ((np)->wirevec
[1].iov_len)))?((unsigned) (np)->length):((unsigned) ((np)
->wirevec[1].iov_len))) - (int)((ap->acks) - (u_char *) ap);
4204 if (nbytes < 0)
4205 return np; /* truncated ack packet */
4206
4207 /* depends on ack packet struct */
4208 nAcks = MIN((unsigned)nbytes, (unsigned)ap->nAcks)((((unsigned)nbytes)<((unsigned)ap->nAcks))?((unsigned)
nbytes):((unsigned)ap->nAcks));
4209 first = ntohl(ap->firstPacket)(__builtin_constant_p(ap->firstPacket) ? ((((__uint32_t)(ap
->firstPacket)) >> 24) | ((((__uint32_t)(ap->firstPacket
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(ap
->firstPacket)) & (0xff << 8)) << 8) | (((
__uint32_t)(ap->firstPacket)) << 24)) : __bswap32_var
(ap->firstPacket));
4210 prev = ntohl(ap->previousPacket)(__builtin_constant_p(ap->previousPacket) ? ((((__uint32_t
)(ap->previousPacket)) >> 24) | ((((__uint32_t)(ap->
previousPacket)) & (0xff << 16)) >> 8) | ((((
__uint32_t)(ap->previousPacket)) & (0xff << 8)) <<
8) | (((__uint32_t)(ap->previousPacket)) << 24)) : __bswap32_var
(ap->previousPacket));
4211 serial = ntohl(ap->serial)(__builtin_constant_p(ap->serial) ? ((((__uint32_t)(ap->
serial)) >> 24) | ((((__uint32_t)(ap->serial)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(ap->serial
)) & (0xff << 8)) << 8) | (((__uint32_t)(ap->
serial)) << 24)) : __bswap32_var(ap->serial));
4212 /* temporarily disabled -- needs to degrade over time
4213 * skew = ntohs(ap->maxSkew); */
4214
4215 /* Ignore ack packets received out of order */
4216 if (first < call->tfirst ||
4217 (first == call->tfirst && prev < call->tprev)) {
4218 return np;
4219 }
4220
4221 call->tprev = prev;
4222
4223 if (np->header.flags & RX_SLOW_START_OK32) {
4224 call->flags |= RX_CALL_SLOW_START_OK8192;
4225 }
4226
4227 if (ap->reason == RX_ACK_PING_RESPONSE7)
4228 rxi_UpdatePeerReach(conn, call);
4229
4230 if (conn->lastPacketSizeSeq) {
4231 MUTEX_ENTER(&conn->conn_data_lock);
4232 conn_data_locked = 1;
4233 if ((first > conn->lastPacketSizeSeq) && (conn->lastPacketSize)) {
4234 pktsize = conn->lastPacketSize;
4235 conn->lastPacketSize = conn->lastPacketSizeSeq = 0;
4236 }
4237 }
4238 if ((ap->reason == RX_ACK_PING_RESPONSE7) && (conn->lastPingSizeSer)) {
4239 if (!conn_data_locked) {
4240 MUTEX_ENTER(&conn->conn_data_lock);
4241 conn_data_locked = 1;
4242 }
4243 if ((conn->lastPingSizeSer == serial) && (conn->lastPingSize)) {
4244 /* process mtu ping ack */
4245 pktsize = conn->lastPingSize;
4246 conn->lastPingSizeSer = conn->lastPingSize = 0;
4247 }
4248 }
4249
4250 if (conn_data_locked) {
4251 MUTEX_EXIT(&conn->conn_data_lock);
4252 conn_data_locked = 0;
4253 }
4254#ifdef RXDEBUG1
4255#ifdef AFS_NT40_ENV
4256 if (rxdebug_active) {
4257 char msg[512];
4258 size_t len;
4259
4260 len = _snprintf(msg, sizeof(msg),
4261 "tid[%d] RACK: reason %s serial %u previous %u seq %u skew %d first %u acks %u space %u ",
4262 GetCurrentThreadId(), rx_ack_reason(ap->reason),
4263 ntohl(ap->serial)(__builtin_constant_p(ap->serial) ? ((((__uint32_t)(ap->
serial)) >> 24) | ((((__uint32_t)(ap->serial)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(ap->serial
)) & (0xff << 8)) << 8) | (((__uint32_t)(ap->
serial)) << 24)) : __bswap32_var(ap->serial)), ntohl(ap->previousPacket)(__builtin_constant_p(ap->previousPacket) ? ((((__uint32_t
)(ap->previousPacket)) >> 24) | ((((__uint32_t)(ap->
previousPacket)) & (0xff << 16)) >> 8) | ((((
__uint32_t)(ap->previousPacket)) & (0xff << 8)) <<
8) | (((__uint32_t)(ap->previousPacket)) << 24)) : __bswap32_var
(ap->previousPacket)),
4264 (unsigned int)np->header.seq, (unsigned int)skew,
4265 ntohl(ap->firstPacket)(__builtin_constant_p(ap->firstPacket) ? ((((__uint32_t)(ap
->firstPacket)) >> 24) | ((((__uint32_t)(ap->firstPacket
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(ap
->firstPacket)) & (0xff << 8)) << 8) | (((
__uint32_t)(ap->firstPacket)) << 24)) : __bswap32_var
(ap->firstPacket)), ap->nAcks, ntohs(ap->bufferSpace)(__builtin_constant_p(ap->bufferSpace) ? (__uint16_t)(((__uint16_t
)(ap->bufferSpace)) << 8 | ((__uint16_t)(ap->bufferSpace
)) >> 8) : __bswap16_var(ap->bufferSpace)) );
4266 if (nAcks) {
4267 int offset;
4268
4269 for (offset = 0; offset < nAcks && len < sizeof(msg); offset++)
4270 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK0 ? '-' : '*');
4271 }
4272 msg[len++]='\n';
4273 msg[len] = '\0';
4274 OutputDebugString(msg);
4275 }
4276#else /* AFS_NT40_ENV */
4277 if (rx_Logrx_debugFile) {
4278 fprintf(rx_Logrx_debugFile,
4279 "RACK: reason %x previous %u seq %u serial %u skew %d first %u",
4280 ap->reason, ntohl(ap->previousPacket)(__builtin_constant_p(ap->previousPacket) ? ((((__uint32_t
)(ap->previousPacket)) >> 24) | ((((__uint32_t)(ap->
previousPacket)) & (0xff << 16)) >> 8) | ((((
__uint32_t)(ap->previousPacket)) & (0xff << 8)) <<
8) | (((__uint32_t)(ap->previousPacket)) << 24)) : __bswap32_var
(ap->previousPacket)),
4281 (unsigned int)np->header.seq, (unsigned int)serial,
4282 (unsigned int)skew, ntohl(ap->firstPacket)(__builtin_constant_p(ap->firstPacket) ? ((((__uint32_t)(ap
->firstPacket)) >> 24) | ((((__uint32_t)(ap->firstPacket
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(ap
->firstPacket)) & (0xff << 8)) << 8) | (((
__uint32_t)(ap->firstPacket)) << 24)) : __bswap32_var
(ap->firstPacket)));
4283 if (nAcks) {
4284 int offset;
4285 for (offset = 0; offset < nAcks; offset++)
4286 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',(!__isthreaded ? __sputc(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile) : (putc)(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile))
4287 rx_Log)(!__isthreaded ? __sputc(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile) : (putc)(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile));
4288 }
4289 putc('\n', rx_Log)(!__isthreaded ? __sputc('\n', rx_debugFile) : (putc)('\n', rx_debugFile
));
4290 }
4291#endif /* AFS_NT40_ENV */
4292#endif
4293
4294 MUTEX_ENTER(&peer->peer_lock);
4295 if (pktsize) {
4296 /*
4297 * Start somewhere. Can't assume we can send what we can receive,
4298 * but we are clearly receiving.
4299 */
4300 if (!peer->maxPacketSize)
4301 peer->maxPacketSize = RX_MIN_PACKET_SIZE(576 - RX_IPUDP_SIZE)+RX_IPUDP_SIZE;
4302
4303 if (pktsize > peer->maxPacketSize) {
4304 peer->maxPacketSize = pktsize;
4305 if ((pktsize-RX_IPUDP_SIZE > peer->ifMTU)) {
4306 peer->ifMTU=pktsize-RX_IPUDP_SIZE;
4307 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
4308 rxi_ScheduleGrowMTUEvent(call, 1);
4309 }
4310 }
4311 }
4312
4313 /* Update the outgoing packet skew value to the latest value of
4314 * the peer's incoming packet skew value. The ack packet, of
4315 * course, could arrive out of order, but that won't affect things
4316 * much */
4317 peer->outPacketSkew = skew;
4318
4319
4320 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
4321
4322 /* The transmit queue splits into 4 sections.
4323 *
4324 * The first section is packets which have now been acknowledged
4325 * by a window size change in the ack. These have reached the
4326 * application layer, and may be discarded. These are packets
4327 * with sequence numbers < ap->firstPacket.
4328 *
4329 * The second section is packets which have sequence numbers in
4330 * the range ap->firstPacket to ap->firstPacket + ap->nAcks. The
4331 * contents of the packet's ack array determines whether these
4332 * packets are acknowledged or not.
4333 *
4334 * The third section is packets which fall above the range
4335 * addressed in the ack packet. These have not yet been received
4336 * by the peer.
4337 *
4338 * The four section is packets which have not yet been transmitted.
4339 * These packets will have a header.serial of 0.
4340 */
4341
4342 /* First section - implicitly acknowledged packets that can be
4343 * disposed of
4344 */
4345
4346 tp = queue_First(&call->tq, rx_packet)((struct rx_packet *)((struct rx_queue *)(&call->tq))->
next);
4347 while(!queue_IsEnd(&call->tq, tp)(((struct rx_queue *)(&call->tq)) == ((struct rx_queue
*)(tp))) && tp->header.seq < first) {
4348 struct rx_packet *next;
4349
4350 next = queue_Next(tp, rx_packet)((struct rx_packet *)((struct rx_queue *)(tp))->next);
4351 call->tfirst = tp->header.seq + 1;
4352
4353 if (!(tp->flags & RX_PKTFLAG_ACKED0x01)) {
4354 newAckCount++;
4355 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4356 }
4357
4358#ifdef ADAPT_WINDOW
4359 rxi_ComputeRate(call->conn->peer, call, p, np, ap->reason);
4360#endif
4361
4362#ifdef AFS_GLOBAL_RXLOCK_KERNEL
4363 /* XXX Hack. Because we have to release the global rx lock when sending
4364 * packets (osi_NetSend) we drop all acks while we're traversing the tq
4365 * in rxi_Start sending packets out because packets may move to the
4366 * freePacketQueue as result of being here! So we drop these packets until
4367 * we're safely out of the traversing. Really ugly!
4368 * To make it even uglier, if we're using fine grain locking, we can
4369 * set the ack bits in the packets and have rxi_Start remove the packets
4370 * when it's done transmitting.
4371 */
4372 if (call->flags & RX_CALL_TQ_BUSY128) {
4373#ifdef RX_ENABLE_LOCKS
4374 tp->flags |= RX_PKTFLAG_ACKED0x01;
4375 call->flags |= RX_CALL_TQ_SOME_ACKED512;
4376#else /* RX_ENABLE_LOCKS */
4377 break;
4378#endif /* RX_ENABLE_LOCKS */
4379 } else
4380#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4381 {
4382 queue_Remove(tp)(((((struct rx_queue *)(tp))->prev->next=((struct rx_queue
*)(tp))->next)->prev=((struct rx_queue *)(tp))->prev
), ((struct rx_queue *)(tp))->next = 0);
4383#ifdef RX_TRACK_PACKETS
4384 tp->flags &= ~RX_PKTFLAG_TQ;
4385#endif
4386#ifdef RXDEBUG_PACKET
4387 call->tqc--;
4388#endif /* RXDEBUG_PACKET */
4389 rxi_FreePacket(tp); /* rxi_FreePacket mustn't wake up anyone, preemptively. */
4390 }
4391 tp = next;
4392 }
4393
4394#ifdef ADAPT_WINDOW
4395 /* Give rate detector a chance to respond to ping requests */
4396 if (ap->reason == RX_ACK_PING_RESPONSE7) {
4397 rxi_ComputeRate(peer, call, 0, np, ap->reason);
4398 }
4399#endif
4400
4401 /* N.B. we don't turn off any timers here. They'll go away by themselves, anyway */
4402
4403 /* Second section of the queue - packets for which we are receiving
4404 * soft ACKs
4405 *
4406 * Go through the explicit acks/nacks and record the results in
4407 * the waiting packets. These are packets that can't be released
4408 * yet, even with a positive acknowledge. This positive
4409 * acknowledge only means the packet has been received by the
4410 * peer, not that it will be retained long enough to be sent to
4411 * the peer's upper level. In addition, reset the transmit timers
4412 * of any missing packets (those packets that must be missing
4413 * because this packet was out of sequence) */
4414
4415 call->nSoftAcked = 0;
4416 missing = 0;
4417 while (!queue_IsEnd(&call->tq, tp)(((struct rx_queue *)(&call->tq)) == ((struct rx_queue
*)(tp))) && tp->header.seq < first + nAcks) {
4418 /* Set the acknowledge flag per packet based on the
4419 * information in the ack packet. An acknowlegded packet can
4420 * be downgraded when the server has discarded a packet it
4421 * soacked previously, or when an ack packet is received
4422 * out of sequence. */
4423 if (ap->acks[tp->header.seq - first] == RX_ACK_TYPE_ACK1) {
4424 if (!(tp->flags & RX_PKTFLAG_ACKED0x01)) {
4425 newAckCount++;
4426 tp->flags |= RX_PKTFLAG_ACKED0x01;
4427 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4428#ifdef ADAPT_WINDOW
4429 rxi_ComputeRate(call->conn->peer, call, tp, np, ap->reason);
4430#endif
4431 }
4432 if (missing) {
4433 nNacked++;
4434 } else {
4435 call->nSoftAcked++;
4436 }
4437 } else /* RX_ACK_TYPE_NACK */ {
4438 tp->flags &= ~RX_PKTFLAG_ACKED0x01;
4439 missing = 1;
4440 }
4441
4442 tp = queue_Next(tp, rx_packet)((struct rx_packet *)((struct rx_queue *)(tp))->next);
4443 }
4444
4445 /* We don't need to take any action with the 3rd or 4th section in the
4446 * queue - they're not addressed by the contents of this ACK packet.
4447 */
4448
4449 /* If the window has been extended by this acknowledge packet,
4450 * then wakeup a sender waiting in alloc for window space, or try
4451 * sending packets now, if he's been sitting on packets due to
4452 * lack of window space */
4453 if (call->tnext < (call->tfirst + call->twind)) {
4454#ifdef RX_ENABLE_LOCKS
4455 CV_SIGNAL(&call->cv_twind);
4456#else
4457 if (call->flags & RX_CALL_WAIT_WINDOW_ALLOC2) {
4458 call->flags &= ~RX_CALL_WAIT_WINDOW_ALLOC2;
4459 osi_rxWakeup(&call->twind)rxi_Wakeup(&call->twind);
4460 }
4461#endif
4462 if (call->flags & RX_CALL_WAIT_WINDOW_SEND4) {
4463 call->flags &= ~RX_CALL_WAIT_WINDOW_SEND4;
4464 }
4465 }
4466
4467 /* if the ack packet has a receivelen field hanging off it,
4468 * update our state */
4469 if (np->length >= rx_AckDataSize(ap->nAcks)(3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * sizeof(afs_int32)) {
4470 afs_uint32 tSize;
4471
4472 /* If the ack packet has a "recommended" size that is less than
4473 * what I am using now, reduce my size to match */
4474 rx_packetread(np, rx_AckDataSize(ap->nAcks) + (int)sizeof(afs_int32),( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + (int)sizeof(afs_int32), (int)sizeof(afs_int32), (char
*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)
->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + (int)sizeof(afs_int32)), ((
int)sizeof(afs_int32)))),0))
4475 (int)sizeof(afs_int32), &tSize)( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + (int)sizeof(afs_int32), (int)sizeof(afs_int32), (char
*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)
->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + (int)sizeof(afs_int32)), ((
int)sizeof(afs_int32)))),0));
4476 tSize = (afs_uint32) ntohl(tSize)(__builtin_constant_p(tSize) ? ((((__uint32_t)(tSize)) >>
24) | ((((__uint32_t)(tSize)) & (0xff << 16)) >>
8) | ((((__uint32_t)(tSize)) & (0xff << 8)) <<
8) | (((__uint32_t)(tSize)) << 24)) : __bswap32_var(tSize
));
4477 peer->natMTU = rxi_AdjustIfMTU(MIN(tSize, peer->ifMTU)(((tSize)<(peer->ifMTU))?(tSize):(peer->ifMTU)));
4478
4479 /* Get the maximum packet size to send to this peer */
4480 rx_packetread(np, rx_AckDataSize(ap->nAcks), (int)sizeof(afs_int32),( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0]))) + ((int)sizeof(afs_int32)) > (np)->wirevec
[1].iov_len ? rx_SlowReadPacket(np, (3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])), (int)sizeof(afs_int32), (char
*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)
->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0]))), ((int)sizeof(afs_int32)))),
0))
4481 &tSize)( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0]))) + ((int)sizeof(afs_int32)) > (np)->wirevec
[1].iov_len ? rx_SlowReadPacket(np, (3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])), (int)sizeof(afs_int32), (char
*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)
->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0]))), ((int)sizeof(afs_int32)))),
0));
4482 tSize = (afs_uint32) ntohl(tSize)(__builtin_constant_p(tSize) ? ((((__uint32_t)(tSize)) >>
24) | ((((__uint32_t)(tSize)) & (0xff << 16)) >>
8) | ((((__uint32_t)(tSize)) & (0xff << 8)) <<
8) | (((__uint32_t)(tSize)) << 24)) : __bswap32_var(tSize
));
4483 tSize = (afs_uint32) MIN(tSize, rx_MyMaxSendSize)(((tSize)<(rx_MyMaxSendSize))?(tSize):(rx_MyMaxSendSize));
4484 tSize = rxi_AdjustMaxMTU(peer->natMTU, tSize);
4485
4486 /* sanity check - peer might have restarted with different params.
4487 * If peer says "send less", dammit, send less... Peer should never
4488 * be unable to accept packets of the size that prior AFS versions would
4489 * send without asking. */
4490 if (peer->maxMTU != tSize) {
4491 if (peer->maxMTU > tSize) /* possible cong., maxMTU decreased */
4492 peer->congestSeq++;
4493 peer->maxMTU = tSize;
4494 peer->MTU = MIN(tSize, peer->MTU)(((tSize)<(peer->MTU))?(tSize):(peer->MTU));
4495 call->MTU = MIN(call->MTU, tSize)(((call->MTU)<(tSize))?(call->MTU):(tSize));
4496 }
4497
4498 if (np->length == rx_AckDataSize(ap->nAcks)(3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 3 * sizeof(afs_int32)) {
4499 /* AFS 3.4a */
4500 rx_packetread(np,( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 2 * (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * (int)sizeof(afs_int32), (int)sizeof(afs_int32), (
char*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)(
(np)->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 2 * (int)sizeof(afs_int32))
, ((int)sizeof(afs_int32)))),0))
4501 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 2 * (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * (int)sizeof(afs_int32), (int)sizeof(afs_int32), (
char*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)(
(np)->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 2 * (int)sizeof(afs_int32))
, ((int)sizeof(afs_int32)))),0))
4502 (int)sizeof(afs_int32), &tSize)( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 2 * (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * (int)sizeof(afs_int32), (int)sizeof(afs_int32), (
char*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)(
(np)->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 2 * (int)sizeof(afs_int32))
, ((int)sizeof(afs_int32)))),0));
4503 tSize = (afs_uint32) ntohl(tSize)(__builtin_constant_p(tSize) ? ((((__uint32_t)(tSize)) >>
24) | ((((__uint32_t)(tSize)) & (0xff << 16)) >>
8) | ((((__uint32_t)(tSize)) & (0xff << 8)) <<
8) | (((__uint32_t)(tSize)) << 24)) : __bswap32_var(tSize
)); /* peer's receive window, if it's */
4504 if (tSize < call->twind) { /* smaller than our send */
4505 call->twind = tSize; /* window, we must send less... */
4506 call->ssthresh = MIN(call->twind, call->ssthresh)(((call->twind)<(call->ssthresh))?(call->twind):(
call->ssthresh));
4507 call->conn->twind[call->channel] = call->twind;
4508 }
4509
4510 /* Only send jumbograms to 3.4a fileservers. 3.3a RX gets the
4511 * network MTU confused with the loopback MTU. Calculate the
4512 * maximum MTU here for use in the slow start code below.
4513 */
4514 /* Did peer restart with older RX version? */
4515 if (peer->maxDgramPackets > 1) {
4516 peer->maxDgramPackets = 1;
4517 }
4518 } else if (np->length >=
4519 rx_AckDataSize(ap->nAcks)(3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 4 * sizeof(afs_int32)) {
4520 /* AFS 3.5 */
4521 rx_packetread(np,( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 2 * (int)sizeof(afs_int32)) + (sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * (int)sizeof(afs_int32), sizeof(afs_int32), (char*
)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)->
wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof(
struct rx_ackPacket, acks[0])) + 2 * (int)sizeof(afs_int32)),
(sizeof(afs_int32)))),0))
4522 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 2 * (int)sizeof(afs_int32)) + (sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * (int)sizeof(afs_int32), sizeof(afs_int32), (char*
)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)->
wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof(
struct rx_ackPacket, acks[0])) + 2 * (int)sizeof(afs_int32)),
(sizeof(afs_int32)))),0))
4523 sizeof(afs_int32), &tSize)( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 2 * (int)sizeof(afs_int32)) + (sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * (int)sizeof(afs_int32), sizeof(afs_int32), (char*
)(&tSize)) : ((memcpy((char *)(&tSize), (char*)((np)->
wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof(
struct rx_ackPacket, acks[0])) + 2 * (int)sizeof(afs_int32)),
(sizeof(afs_int32)))),0));
4524 tSize = (afs_uint32) ntohl(tSize)(__builtin_constant_p(tSize) ? ((((__uint32_t)(tSize)) >>
24) | ((((__uint32_t)(tSize)) & (0xff << 16)) >>
8) | ((((__uint32_t)(tSize)) & (0xff << 8)) <<
8) | (((__uint32_t)(tSize)) << 24)) : __bswap32_var(tSize
));
4525 /*
4526 * As of AFS 3.5 we set the send window to match the receive window.
4527 */
4528 if (tSize < call->twind) {
4529 call->twind = tSize;
4530 call->conn->twind[call->channel] = call->twind;
4531 call->ssthresh = MIN(call->twind, call->ssthresh)(((call->twind)<(call->ssthresh))?(call->twind):(
call->ssthresh));
4532 } else if (tSize > call->twind) {
4533 call->twind = tSize;
4534 call->conn->twind[call->channel] = call->twind;
4535 }
4536
4537 /*
4538 * As of AFS 3.5, a jumbogram is more than one fixed size
4539 * packet transmitted in a single UDP datagram. If the remote
4540 * MTU is smaller than our local MTU then never send a datagram
4541 * larger than the natural MTU.
4542 */
4543 rx_packetread(np,( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 3 * (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 3 * (int)sizeof(afs_int32), (int)sizeof(afs_int32), (
char*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)(
(np)->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 3 * (int)sizeof(afs_int32))
, ((int)sizeof(afs_int32)))),0))
4544 rx_AckDataSize(ap->nAcks) + 3 * (int)sizeof(afs_int32),( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 3 * (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 3 * (int)sizeof(afs_int32), (int)sizeof(afs_int32), (
char*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)(
(np)->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 3 * (int)sizeof(afs_int32))
, ((int)sizeof(afs_int32)))),0))
4545 (int)sizeof(afs_int32), &tSize)( ((3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + 3 * (int)sizeof(afs_int32)) + ((int)sizeof(afs_int32
)) > (np)->wirevec[1].iov_len ? rx_SlowReadPacket(np, (
3 + ap->nAcks + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 3 * (int)sizeof(afs_int32), (int)sizeof(afs_int32), (
char*)(&tSize)) : ((memcpy((char *)(&tSize), (char*)(
(np)->wirevec[1].iov_base)+((3 + ap->nAcks + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 3 * (int)sizeof(afs_int32))
, ((int)sizeof(afs_int32)))),0));
4546 maxDgramPackets = (afs_uint32) ntohl(tSize)(__builtin_constant_p(tSize) ? ((((__uint32_t)(tSize)) >>
24) | ((((__uint32_t)(tSize)) & (0xff << 16)) >>
8) | ((((__uint32_t)(tSize)) & (0xff << 8)) <<
8) | (((__uint32_t)(tSize)) << 24)) : __bswap32_var(tSize
));
4547 maxDgramPackets = MIN(maxDgramPackets, rxi_nDgramPackets)(((maxDgramPackets)<(rxi_nDgramPackets))?(maxDgramPackets)
:(rxi_nDgramPackets));
4548 maxDgramPackets =
4549 MIN(maxDgramPackets, (int)(peer->ifDgramPackets))(((maxDgramPackets)<((int)(peer->ifDgramPackets)))?(maxDgramPackets
):((int)(peer->ifDgramPackets)));
4550 if (maxDgramPackets > 1) {
4551 peer->maxDgramPackets = maxDgramPackets;
4552 call->MTU = RX_JUMBOBUFFERSIZE1412 + RX_HEADER_SIZEsizeof (struct rx_header);
4553 } else {
4554 peer->maxDgramPackets = 1;
4555 call->MTU = peer->natMTU;
4556 }
4557 } else if (peer->maxDgramPackets > 1) {
4558 /* Restarted with lower version of RX */
4559 peer->maxDgramPackets = 1;
4560 }
4561 } else if (peer->maxDgramPackets > 1
4562 || peer->maxMTU != OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE)) {
4563 /* Restarted with lower version of RX */
4564 peer->maxMTU = OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE);
4565 peer->natMTU = OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE);
4566 peer->MTU = OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE);
4567 peer->maxDgramPackets = 1;
4568 peer->nDgramPackets = 1;
4569 peer->congestSeq++;
4570 call->MTU = OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE);
4571 }
4572
4573 if (nNacked) {
4574 /*
4575 * Calculate how many datagrams were successfully received after
4576 * the first missing packet and adjust the negative ack counter
4577 * accordingly.
4578 */
4579 call->nAcks = 0;
4580 call->nNacks++;
4581 nNacked = (nNacked + call->nDgramPackets - 1) / call->nDgramPackets;
4582 if (call->nNacks < nNacked) {
4583 call->nNacks = nNacked;
4584 }
4585 } else {
4586 call->nAcks += newAckCount;
4587 call->nNacks = 0;
4588 }
4589
4590 /* If the packet contained new acknowledgements, rather than just
4591 * being a duplicate of one we have previously seen, then we can restart
4592 * the RTT timer
4593 */
4594 if (newAckCount > 0)
4595 rxi_rto_packet_acked(call, istack);
4596
4597 if (call->flags & RX_CALL_FAST_RECOVER2048) {
4598 if (newAckCount == 0) {
4599 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow)((((int)(call->cwind + 1))<(rx_maxSendWindow))?((int)(call
->cwind + 1)):(rx_maxSendWindow));
4600 } else {
4601 call->flags &= ~RX_CALL_FAST_RECOVER2048;
4602 call->cwind = call->nextCwind;
4603 call->nextCwind = 0;
4604 call->nAcks = 0;
4605 }
4606 call->nCwindAcks = 0;
4607 } else if (nNacked && call->nNacks >= (u_short) rx_nackThreshold) {
4608 /* Three negative acks in a row trigger congestion recovery */
4609 call->flags |= RX_CALL_FAST_RECOVER2048;
4610 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind))(((4)>(((((int)call->cwind)<((int)call->twind))?(
(int)call->cwind):((int)call->twind))))?(4):(((((int)call
->cwind)<((int)call->twind))?((int)call->cwind):(
(int)call->twind)))) >> 1;
4611 call->cwind =
4612 MIN((int)(call->ssthresh + rx_nackThreshold), rx_maxSendWindow)((((int)(call->ssthresh + rx_nackThreshold))<(rx_maxSendWindow
))?((int)(call->ssthresh + rx_nackThreshold)):(rx_maxSendWindow
));
4613 call->nDgramPackets = MAX(2, (int)call->nDgramPackets)(((2)>((int)call->nDgramPackets))?(2):((int)call->nDgramPackets
)) >> 1;
4614 call->nextCwind = call->ssthresh;
4615 call->nAcks = 0;
4616 call->nNacks = 0;
4617 peer->MTU = call->MTU;
4618 peer->cwind = call->nextCwind;
4619 peer->nDgramPackets = call->nDgramPackets;
4620 peer->congestSeq++;
4621 call->congestSeq = peer->congestSeq;
4622
4623 /* Reset the resend times on the packets that were nacked
4624 * so we will retransmit as soon as the window permits
4625 */
4626
4627 for (acked = 0, queue_ScanBackwards(&call->tq, tp, nxp, rx_packet)(tp) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->prev), nxp = ((struct rx_packet *)((struct rx_queue *
)(tp))->prev); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(tp))); (tp) = nxp, nxp = ((struct rx_packet
*)((struct rx_queue *)(tp))->prev)) {
4628 if (acked) {
4629 if (!(tp->flags & RX_PKTFLAG_ACKED0x01)) {
4630 tp->flags &= ~RX_PKTFLAG_SENT0x40;
4631 }
4632 } else if (tp->flags & RX_PKTFLAG_ACKED0x01) {
4633 acked = 1;
4634 }
4635 }
4636 } else {
4637 /* If cwind is smaller than ssthresh, then increase
4638 * the window one packet for each ack we receive (exponential
4639 * growth).
4640 * If cwind is greater than or equal to ssthresh then increase
4641 * the congestion window by one packet for each cwind acks we
4642 * receive (linear growth). */
4643 if (call->cwind < call->ssthresh) {
4644 call->cwind =
4645 MIN((int)call->ssthresh, (int)(call->cwind + newAckCount))((((int)call->ssthresh)<((int)(call->cwind + newAckCount
)))?((int)call->ssthresh):((int)(call->cwind + newAckCount
)));
4646 call->nCwindAcks = 0;
4647 } else {
4648 call->nCwindAcks += newAckCount;
4649 if (call->nCwindAcks >= call->cwind) {
4650 call->nCwindAcks = 0;
4651 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow)((((int)(call->cwind + 1))<(rx_maxSendWindow))?((int)(call
->cwind + 1)):(rx_maxSendWindow));
4652 }
4653 }
4654 /*
4655 * If we have received several acknowledgements in a row then
4656 * it is time to increase the size of our datagrams
4657 */
4658 if ((int)call->nAcks > rx_nDgramThreshold) {
4659 if (peer->maxDgramPackets > 1) {
4660 if (call->nDgramPackets < peer->maxDgramPackets) {
4661 call->nDgramPackets++;
4662 }
4663 call->MTU = RX_HEADER_SIZEsizeof (struct rx_header) + RX_JUMBOBUFFERSIZE1412;
4664 } else if (call->MTU < peer->maxMTU) {
4665 /* don't upgrade if we can't handle it */
4666 if ((call->nDgramPackets == 1) && (call->MTU >= peer->ifMTU))
4667 call->MTU = peer->ifMTU;
4668 else {
4669 call->MTU += peer->natMTU;
4670 call->MTU = MIN(call->MTU, peer->maxMTU)(((call->MTU)<(peer->maxMTU))?(call->MTU):(peer->
maxMTU));
4671 }
4672 }
4673 call->nAcks = 0;
4674 }
4675 }
4676
4677 MUTEX_EXIT(&peer->peer_lock); /* rxi_Start will lock peer. */
4678
4679 /* Servers need to hold the call until all response packets have
4680 * been acknowledged. Soft acks are good enough since clients
4681 * are not allowed to clear their receive queues. */
4682 if (call->state == RX_STATE_HOLD4
4683 && call->tfirst + call->nSoftAcked >= call->tnext) {
4684 call->state = RX_STATE_DALLY3;
4685 rxi_ClearTransmitQueue(call, 0);
4686 rxevent_Cancel(call->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE)do { if (call->keepAliveEvent) { rxevent_Cancel_1(call->
keepAliveEvent, ((void *)0), 0); call->keepAliveEvent = ((
void *)0); } } while(0);
4687 } else if (!queue_IsEmpty(&call->tq)(((struct rx_queue *)(&call->tq))->next == ((struct
rx_queue *)(&call->tq)))) {
4688 rxi_Start(call, istack);
4689 }
4690 return np;
4691}
4692
4693/* Received a response to a challenge packet */
4694struct rx_packet *
4695rxi_ReceiveResponsePacket(struct rx_connection *conn,
4696 struct rx_packet *np, int istack)
4697{
4698 int error;
4699
4700 /* Ignore the packet if we're the client */
4701 if (conn->type == RX_CLIENT_CONNECTION0)
4702 return np;
4703
4704 /* If already authenticated, ignore the packet (it's probably a retry) */
4705 if (RXS_CheckAuthentication(conn->securityObject, conn)((conn->securityObject && (conn->securityObject
->ops->op_CheckAuthentication)) ? (*(conn->securityObject
)->ops->op_CheckAuthentication)(conn->securityObject
,conn) : 0) == 0)
4706 return np;
4707
4708 /* Otherwise, have the security object evaluate the response packet */
4709 error = RXS_CheckResponse(conn->securityObject, conn, np)((conn->securityObject && (conn->securityObject
->ops->op_CheckResponse)) ? (*(conn->securityObject)
->ops->op_CheckResponse)(conn->securityObject,conn,np
) : 0);
4710 if (error) {
4711 /* If the response is invalid, reset the connection, sending
4712 * an abort to the peer */
4713#ifndef KERNEL
4714 rxi_Delay(1);
4715#endif
4716 rxi_ConnectionError(conn, error);
4717 MUTEX_ENTER(&conn->conn_data_lock);
4718 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4719 MUTEX_EXIT(&conn->conn_data_lock);
4720 return np;
4721 } else {
4722 /* If the response is valid, any calls waiting to attach
4723 * servers can now do so */
4724 int i;
4725
4726 for (i = 0; i < RX_MAXCALLS4; i++) {
4727 struct rx_call *call = conn->call[i];
4728 if (call) {
4729 MUTEX_ENTER(&call->lock);
4730 if (call->state == RX_STATE_PRECALL1)
4731 rxi_AttachServerProc(call, (osi_socket) - 1, NULL((void *)0), NULL((void *)0));
4732 /* tnop can be null if newcallp is null */
4733 MUTEX_EXIT(&call->lock);
4734 }
4735 }
4736
4737 /* Update the peer reachability information, just in case
4738 * some calls went into attach-wait while we were waiting
4739 * for authentication..
4740 */
4741 rxi_UpdatePeerReach(conn, NULL((void *)0));
4742 }
4743 return np;
4744}
4745
4746/* A client has received an authentication challenge: the security
4747 * object is asked to cough up a respectable response packet to send
4748 * back to the server. The server is responsible for retrying the
4749 * challenge if it fails to get a response. */
4750
4751struct rx_packet *
4752rxi_ReceiveChallengePacket(struct rx_connection *conn,
4753 struct rx_packet *np, int istack)
4754{
4755 int error;
4756
4757 /* Ignore the challenge if we're the server */
4758 if (conn->type == RX_SERVER_CONNECTION1)
4759 return np;
4760
4761 /* Ignore the challenge if the connection is otherwise idle; someone's
4762 * trying to use us as an oracle. */
4763 if (!rxi_HasActiveCalls(conn))
4764 return np;
4765
4766 /* Send the security object the challenge packet. It is expected to fill
4767 * in the response. */
4768 error = RXS_GetResponse(conn->securityObject, conn, np)((conn->securityObject && (conn->securityObject
->ops->op_GetResponse)) ? (*(conn->securityObject)->
ops->op_GetResponse)(conn->securityObject,conn,np) : 0);
4769
4770 /* If the security object is unable to return a valid response, reset the
4771 * connection and send an abort to the peer. Otherwise send the response
4772 * packet to the peer connection. */
4773 if (error) {
4774 rxi_ConnectionError(conn, error);
4775 MUTEX_ENTER(&conn->conn_data_lock);
4776 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4777 MUTEX_EXIT(&conn->conn_data_lock);
4778 } else {
4779 np = rxi_SendSpecial((struct rx_call *)0, conn, np,
4780 RX_PACKET_TYPE_RESPONSE7, NULL((void *)0), -1, istack);
4781 }
4782 return np;
4783}
4784
4785
4786/* Find an available server process to service the current request in
4787 * the given call structure. If one isn't available, queue up this
4788 * call so it eventually gets one */
4789void
4790rxi_AttachServerProc(struct rx_call *call,
4791 osi_socket socket, int *tnop,
4792 struct rx_call **newcallp)
4793{
4794 struct rx_serverQueueEntry *sq;
4795 struct rx_service *service = call->conn->service;
4796 int haveQuota = 0;
4797
4798 /* May already be attached */
4799 if (call->state == RX_STATE_ACTIVE2)
4800 return;
4801
4802 MUTEX_ENTER(&rx_serverPool_lock);
4803
4804 haveQuota = QuotaOK(service);
4805 if ((!haveQuota) || queue_IsEmpty(&rx_idleServerQueue)(((struct rx_queue *)(&rx_idleServerQueue))->next == (
(struct rx_queue *)(&rx_idleServerQueue)))) {
4806 /* If there are no processes available to service this call,
4807 * put the call on the incoming call queue (unless it's
4808 * already on the queue).
4809 */
4810#ifdef RX_ENABLE_LOCKS
4811 if (haveQuota)
4812 ReturnToServerPool(service);
4813#endif /* RX_ENABLE_LOCKS */
4814
4815 if (!(call->flags & RX_CALL_WAIT_PROC16)) {
4816 call->flags |= RX_CALL_WAIT_PROC16;
4817 rx_atomic_inc(&rx_nWaiting);
4818 rx_atomic_inc(&rx_nWaited);
4819 rxi_calltrace(RX_CALL_ARRIVAL0, call);
4820 SET_CALL_QUEUE_LOCK(call, &rx_serverPool_lock);
4821 queue_Append(&rx_incomingCallQueue, call)(((((struct rx_queue *)(call))->prev=((struct rx_queue *)(
&rx_incomingCallQueue))->prev)->next=((struct rx_queue
*)(call)))->next=((struct rx_queue *)(&rx_incomingCallQueue
)), ((struct rx_queue *)(&rx_incomingCallQueue))->prev
=((struct rx_queue *)(call)));
4822 }
4823 } else {
4824 sq = queue_Last(&rx_idleServerQueue, rx_serverQueueEntry)((struct rx_serverQueueEntry *)((struct rx_queue *)(&rx_idleServerQueue
))->prev);
4825
4826 /* If hot threads are enabled, and both newcallp and sq->socketp
4827 * are non-null, then this thread will process the call, and the
4828 * idle server thread will start listening on this threads socket.
4829 */
4830 queue_Remove(sq)(((((struct rx_queue *)(sq))->prev->next=((struct rx_queue
*)(sq))->next)->prev=((struct rx_queue *)(sq))->prev
), ((struct rx_queue *)(sq))->next = 0);
4831 if (rx_enable_hot_thread && newcallp && sq->socketp) {
4832 *newcallp = call;
4833 *tnop = sq->tno;
4834 *sq->socketp = socket;
4835 clock_GetTime(&call->startTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->startTime)->sec = (afs_int32)tv.tv_sec; (&
call->startTime)->usec = (afs_int32)tv.tv_usec; } while
(0);
4836 MUTEX_ENTER(&rx_refcnt_mutex);
4837 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
4838 MUTEX_EXIT(&rx_refcnt_mutex);
4839 } else {
4840 sq->newcall = call;
4841 }
4842 if (call->flags & RX_CALL_WAIT_PROC16) {
4843 /* Conservative: I don't think this should happen */
4844 call->flags &= ~RX_CALL_WAIT_PROC16;
4845 if (queue_IsOnQueue(call)(((struct rx_queue *)(call))->next != 0)) {
4846 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
4847
4848 rx_atomic_dec(&rx_nWaiting);
4849 }
4850 }
4851 call->state = RX_STATE_ACTIVE2;
4852 call->mode = RX_MODE_RECEIVING2;
4853#ifdef RX_KERNEL_TRACE
4854 {
4855 int glockOwner = ISAFS_GLOCK();
4856 if (!glockOwner)
4857 AFS_GLOCK();
4858 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
4859 __FILE__"rx.c", ICL_TYPE_INT32, __LINE__4859, ICL_TYPE_POINTER,
4860 call);
4861 if (!glockOwner)
4862 AFS_GUNLOCK();
4863 }
4864#endif
4865 if (call->flags & RX_CALL_CLEARED64) {
4866 /* send an ack now to start the packet flow up again */
4867 call->flags &= ~RX_CALL_CLEARED64;
4868 rxi_SendAck(call, 0, 0, RX_ACK_DELAY8, 0);
4869 }
4870#ifdef RX_ENABLE_LOCKS
4871 CV_SIGNAL(&sq->cv);
4872#else
4873 service->nRequestsRunning++;
4874 MUTEX_ENTER(&rx_quota_mutex);
4875 if (service->nRequestsRunning <= service->minProcs)
4876 rxi_minDeficit--;
4877 rxi_availProcs--;
4878 MUTEX_EXIT(&rx_quota_mutex);
4879 osi_rxWakeup(sq)rxi_Wakeup(sq);
4880#endif
4881 }
4882 MUTEX_EXIT(&rx_serverPool_lock);
4883}
4884
4885/* Delay the sending of an acknowledge event for a short while, while
4886 * a new call is being prepared (in the case of a client) or a reply
4887 * is being prepared (in the case of a server). Rather than sending
4888 * an ack packet, an ACKALL packet is sent. */
4889void
4890rxi_AckAll(struct rxevent *event, struct rx_call *call, char *dummy)
4891{
4892#ifdef RX_ENABLE_LOCKS
4893 if (event) {
4894 MUTEX_ENTER(&call->lock);
4895 call->delayedAckEvent = NULL((void *)0);
4896 MUTEX_ENTER(&rx_refcnt_mutex);
4897 CALL_RELE(call, RX_CALL_REFCOUNT_ACKALL);
4898 MUTEX_EXIT(&rx_refcnt_mutex);
4899 }
4900 rxi_SendSpecial(call, call->conn, (struct rx_packet *)0,
4901 RX_PACKET_TYPE_ACKALL5, NULL((void *)0), 0, 0);
4902 call->flags |= RX_CALL_ACKALL_SENT0x40000;
4903 if (event)
4904 MUTEX_EXIT(&call->lock);
4905#else /* RX_ENABLE_LOCKS */
4906 if (event)
4907 call->delayedAckEvent = NULL((void *)0);
4908 rxi_SendSpecial(call, call->conn, (struct rx_packet *)0,
4909 RX_PACKET_TYPE_ACKALL5, NULL((void *)0), 0, 0);
4910 call->flags |= RX_CALL_ACKALL_SENT0x40000;
4911#endif /* RX_ENABLE_LOCKS */
4912}
4913
4914void
4915rxi_SendDelayedAck(struct rxevent *event, void *arg1, void *unused)
4916{
4917 struct rx_call *call = arg1;
4918#ifdef RX_ENABLE_LOCKS
4919 if (event) {
4920 MUTEX_ENTER(&call->lock);
4921 if (event == call->delayedAckEvent)
4922 call->delayedAckEvent = NULL((void *)0);
4923 MUTEX_ENTER(&rx_refcnt_mutex);
4924 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
4925 MUTEX_EXIT(&rx_refcnt_mutex);
4926 }
4927 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY8, 0);
4928 if (event)
4929 MUTEX_EXIT(&call->lock);
4930#else /* RX_ENABLE_LOCKS */
4931 if (event)
4932 call->delayedAckEvent = NULL((void *)0);
4933 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY8, 0);
4934#endif /* RX_ENABLE_LOCKS */
4935}
4936
4937
4938#ifdef RX_ENABLE_LOCKS
4939/* Set ack in all packets in transmit queue. rxi_Start will deal with
4940 * clearing them out.
4941 */
4942static void
4943rxi_SetAcksInTransmitQueue(struct rx_call *call)
4944{
4945 struct rx_packet *p, *tp;
4946 int someAcked = 0;
4947
4948 for (queue_Scan(&call->tq, p, tp, rx_packet)(p) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->next), tp = ((struct rx_packet *)((struct rx_queue *
)(p))->next); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(p))); (p) = (tp), tp = ((struct rx_packet
*)((struct rx_queue *)(p))->next)) {
4949 p->flags |= RX_PKTFLAG_ACKED0x01;
4950 someAcked = 1;
4951 }
4952 if (someAcked) {
4953 call->flags |= RX_CALL_TQ_CLEARME256;
4954 call->flags |= RX_CALL_TQ_SOME_ACKED512;
4955 }
4956
4957 rxi_rto_cancel(call);
4958
4959 call->tfirst = call->tnext;
4960 call->nSoftAcked = 0;
4961
4962 if (call->flags & RX_CALL_FAST_RECOVER2048) {
4963 call->flags &= ~RX_CALL_FAST_RECOVER2048;
4964 call->cwind = call->nextCwind;
4965 call->nextCwind = 0;
4966 }
4967
4968 CV_SIGNAL(&call->cv_twind);
4969}
4970#endif /* RX_ENABLE_LOCKS */
4971
4972/* Clear out the transmit queue for the current call (all packets have
4973 * been received by peer) */
4974void
4975rxi_ClearTransmitQueue(struct rx_call *call, int force)
4976{
4977#ifdef AFS_GLOBAL_RXLOCK_KERNEL
4978 struct rx_packet *p, *tp;
4979
4980 if (!force && (call->flags & RX_CALL_TQ_BUSY128)) {
4981 int someAcked = 0;
4982 for (queue_Scan(&call->tq, p, tp, rx_packet)(p) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->next), tp = ((struct rx_packet *)((struct rx_queue *
)(p))->next); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(p))); (p) = (tp), tp = ((struct rx_packet
*)((struct rx_queue *)(p))->next)) {
4983 p->flags |= RX_PKTFLAG_ACKED0x01;
4984 someAcked = 1;
4985 }
4986 if (someAcked) {
4987 call->flags |= RX_CALL_TQ_CLEARME256;
4988 call->flags |= RX_CALL_TQ_SOME_ACKED512;
4989 }
4990 } else {
4991#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4992#ifdef RXDEBUG_PACKET
4993 call->tqc -=
4994#endif /* RXDEBUG_PACKET */
4995 rxi_FreePackets(0, &call->tq);
4996 rxi_WakeUpTransmitQueue(call);
4997#ifdef AFS_GLOBAL_RXLOCK_KERNEL
4998 call->flags &= ~RX_CALL_TQ_CLEARME256;
4999 }
5000#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5001
5002 rxi_rto_cancel(call);
5003 call->tfirst = call->tnext; /* implicitly acknowledge all data already sent */
5004 call->nSoftAcked = 0;
5005
5006 if (call->flags & RX_CALL_FAST_RECOVER2048) {
5007 call->flags &= ~RX_CALL_FAST_RECOVER2048;
5008 call->cwind = call->nextCwind;
5009 }
5010#ifdef RX_ENABLE_LOCKS
5011 CV_SIGNAL(&call->cv_twind);
5012#else
5013 osi_rxWakeup(&call->twind)rxi_Wakeup(&call->twind);
5014#endif
5015}
5016
5017void
5018rxi_ClearReceiveQueue(struct rx_call *call)
5019{
5020 if (queue_IsNotEmpty(&call->rq)(((struct rx_queue *)(&call->rq))->next != ((struct
rx_queue *)(&call->rq)))) {
5021 u_short count;
5022
5023 count = rxi_FreePackets(0, &call->rq);
5024 rx_packetReclaims += count;
5025#ifdef RXDEBUG_PACKET
5026 call->rqc -= count;
5027 if ( call->rqc != 0 )
5028 dpf(("rxi_ClearReceiveQueue call %"AFS_PTR_FMT" rqc %u != 0\n", call, call->rqc))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ClearReceiveQueue call %"
"p"" rqc %u != 0\n", call, call->rqc); } while (0);
5029#endif
5030 call->flags &= ~(RX_CALL_RECEIVE_DONE32 | RX_CALL_HAVE_LAST32768);
5031 }
5032 if (call->state == RX_STATE_PRECALL1) {
5033 call->flags |= RX_CALL_CLEARED64;
5034 }
5035}
5036
5037/* Send an abort packet for the specified call */
5038struct rx_packet *
5039rxi_SendCallAbort(struct rx_call *call, struct rx_packet *packet,
5040 int istack, int force)
5041{
5042 afs_int32 error;
5043 struct clock when, now;
5044
5045 if (!call->error)
5046 return packet;
5047
5048 /* Clients should never delay abort messages */
5049 if (rx_IsClientConn(call->conn)((call->conn)->type == 0))
5050 force = 1;
5051
5052 if (call->abortCode != call->error) {
5053 call->abortCode = call->error;
5054 call->abortCount = 0;
5055 }
5056
5057 if (force || rxi_callAbortThreshhold == 0
5058 || call->abortCount < rxi_callAbortThreshhold) {
5059 if (call->delayedAbortEvent) {
5060 rxevent_Cancel(call->delayedAbortEvent, call,do { if (call->delayedAbortEvent) { rxevent_Cancel_1(call->
delayedAbortEvent, ((void *)0), 0); call->delayedAbortEvent
= ((void *)0); } } while(0)
5061 RX_CALL_REFCOUNT_ABORT)do { if (call->delayedAbortEvent) { rxevent_Cancel_1(call->
delayedAbortEvent, ((void *)0), 0); call->delayedAbortEvent
= ((void *)0); } } while(0);
5062 }
5063 error = htonl(call->error)(__builtin_constant_p(call->error) ? ((((__uint32_t)(call->
error)) >> 24) | ((((__uint32_t)(call->error)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(call->error
)) & (0xff << 8)) << 8) | (((__uint32_t)(call
->error)) << 24)) : __bswap32_var(call->error));
5064 call->abortCount++;
5065 packet =
5066 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT4,
5067 (char *)&error, sizeof(error), istack);
5068 } else if (!call->delayedAbortEvent) {
5069 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
5070 when = now;
5071 clock_Addmsec(&when, rxi_callAbortDelay)do { if ((rxi_callAbortDelay) >= 1000) { (&when)->sec
+= (afs_int32)((rxi_callAbortDelay) / 1000); (&when)->
usec += (afs_int32)(((rxi_callAbortDelay) % 1000) * 1000); } else
{ (&when)->usec += (afs_int32)((rxi_callAbortDelay) *
1000); } if ((&when)->usec >= 1000000) { (&when
)->usec -= 1000000; (&when)->sec++; } } while(0);
5072 MUTEX_ENTER(&rx_refcnt_mutex);
5073 CALL_HOLD(call, RX_CALL_REFCOUNT_ABORT);
5074 MUTEX_EXIT(&rx_refcnt_mutex);
5075 call->delayedAbortEvent =
5076 rxevent_PostNow(&when, &now, rxi_SendDelayedCallAbort, call, 0);
5077 }
5078 return packet;
5079}
5080
5081/* Send an abort packet for the specified connection. Packet is an
5082 * optional pointer to a packet that can be used to send the abort.
5083 * Once the number of abort messages reaches the threshhold, an
5084 * event is scheduled to send the abort. Setting the force flag
5085 * overrides sending delayed abort messages.
5086 *
5087 * NOTE: Called with conn_data_lock held. conn_data_lock is dropped
5088 * to send the abort packet.
5089 */
5090struct rx_packet *
5091rxi_SendConnectionAbort(struct rx_connection *conn,
5092 struct rx_packet *packet, int istack, int force)
5093{
5094 afs_int32 error;
5095 struct clock when, now;
5096
5097 if (!conn->error)
5098 return packet;
5099
5100 /* Clients should never delay abort messages */
5101 if (rx_IsClientConn(conn)((conn)->type == 0))
5102 force = 1;
5103
5104 if (force || rxi_connAbortThreshhold == 0
5105 || conn->abortCount < rxi_connAbortThreshhold) {
5106 if (conn->delayedAbortEvent) {
5107 rxevent_Cancel(conn->delayedAbortEvent, (struct rx_call *)0, 0)do { if (conn->delayedAbortEvent) { rxevent_Cancel_1(conn->
delayedAbortEvent, ((void *)0), 0); conn->delayedAbortEvent
= ((void *)0); } } while(0);
5108 }
5109 error = htonl(conn->error)(__builtin_constant_p(conn->error) ? ((((__uint32_t)(conn->
error)) >> 24) | ((((__uint32_t)(conn->error)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(conn->error
)) & (0xff << 8)) << 8) | (((__uint32_t)(conn
->error)) << 24)) : __bswap32_var(conn->error));
5110 conn->abortCount++;
5111 MUTEX_EXIT(&conn->conn_data_lock);
5112 packet =
5113 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5114 RX_PACKET_TYPE_ABORT4, (char *)&error,
5115 sizeof(error), istack);
5116 MUTEX_ENTER(&conn->conn_data_lock);
5117 } else if (!conn->delayedAbortEvent) {
5118 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
5119 when = now;
5120 clock_Addmsec(&when, rxi_connAbortDelay)do { if ((rxi_connAbortDelay) >= 1000) { (&when)->sec
+= (afs_int32)((rxi_connAbortDelay) / 1000); (&when)->
usec += (afs_int32)(((rxi_connAbortDelay) % 1000) * 1000); } else
{ (&when)->usec += (afs_int32)((rxi_connAbortDelay) *
1000); } if ((&when)->usec >= 1000000) { (&when
)->usec -= 1000000; (&when)->sec++; } } while(0);
5121 conn->delayedAbortEvent =
5122 rxevent_PostNow(&when, &now, rxi_SendDelayedConnAbort, conn, 0);
5123 }
5124 return packet;
5125}
5126
5127/* Associate an error all of the calls owned by a connection. Called
5128 * with error non-zero. This is only for really fatal things, like
5129 * bad authentication responses. The connection itself is set in
5130 * error at this point, so that future packets received will be
5131 * rejected. */
5132void
5133rxi_ConnectionError(struct rx_connection *conn,
5134 afs_int32 error)
5135{
5136 if (error) {
5137 int i;
5138
5139 dpf(("rxi_ConnectionError conn %"AFS_PTR_FMT" error %d\n", conn, error))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ConnectionError conn %"
"p"" error %d\n", conn, error); } while (0);
5140
5141 MUTEX_ENTER(&conn->conn_data_lock);
5142 if (conn->challengeEvent)
5143 rxevent_Cancel(conn->challengeEvent, (struct rx_call *)0, 0)do { if (conn->challengeEvent) { rxevent_Cancel_1(conn->
challengeEvent, ((void *)0), 0); conn->challengeEvent = ((
void *)0); } } while(0);
5144 if (conn->natKeepAliveEvent)
5145 rxevent_Cancel(conn->natKeepAliveEvent, (struct rx_call *)0, 0)do { if (conn->natKeepAliveEvent) { rxevent_Cancel_1(conn->
natKeepAliveEvent, ((void *)0), 0); conn->natKeepAliveEvent
= ((void *)0); } } while(0);
5146 if (conn->checkReachEvent) {
5147 rxevent_Cancel(conn->checkReachEvent, (struct rx_call *)0, 0)do { if (conn->checkReachEvent) { rxevent_Cancel_1(conn->
checkReachEvent, ((void *)0), 0); conn->checkReachEvent = (
(void *)0); } } while(0);
5148 conn->checkReachEvent = 0;
5149 conn->flags &= ~RX_CONN_ATTACHWAIT64;
5150 MUTEX_ENTER(&rx_refcnt_mutex);
5151 conn->refCount--;
5152 MUTEX_EXIT(&rx_refcnt_mutex);
5153 }
5154 MUTEX_EXIT(&conn->conn_data_lock);
5155 for (i = 0; i < RX_MAXCALLS4; i++) {
5156 struct rx_call *call = conn->call[i];
5157 if (call) {
5158 MUTEX_ENTER(&call->lock);
5159 rxi_CallError(call, error);
5160 MUTEX_EXIT(&call->lock);
5161 }
5162 }
5163 conn->error = error;
5164 if (rx_stats_active)
5165 rx_atomic_inc(&rx_stats.fatalErrors);
5166 }
5167}
5168
5169/**
5170 * Interrupt an in-progress call with the specified error and wakeup waiters.
5171 *
5172 * @param[in] call The call to interrupt
5173 * @param[in] error The error code to send to the peer
5174 */
5175void
5176rx_InterruptCall(struct rx_call *call, afs_int32 error)
5177{
5178 MUTEX_ENTER(&call->lock);
5179 rxi_CallError(call, error);
5180 rxi_SendCallAbort(call, NULL((void *)0), 0, 1);
5181 MUTEX_EXIT(&call->lock);
5182}
5183
5184void
5185rxi_CallError(struct rx_call *call, afs_int32 error)
5186{
5187#ifdef DEBUG
5188 osirx_AssertMine(&call->lock, "rxi_CallError");
5189#endif
5190 dpf(("rxi_CallError call %"AFS_PTR_FMT" error %d call->error %d\n", call, error, call->error))do { if (rx_debugFile) rxi_DebugPrint ("rxi_CallError call %"
"p"" error %d call->error %d\n", call, error, call->error
); } while (0);
5191 if (call->error)
5192 error = call->error;
5193
5194#ifdef AFS_GLOBAL_RXLOCK_KERNEL
5195 if (!((call->flags & RX_CALL_TQ_BUSY128) || (call->tqWaiters > 0))) {
5196 rxi_ResetCall(call, 0);
5197 }
5198#else
5199 rxi_ResetCall(call, 0);
5200#endif
5201 call->error = error;
5202}
5203
5204/* Reset various fields in a call structure, and wakeup waiting
5205 * processes. Some fields aren't changed: state & mode are not
5206 * touched (these must be set by the caller), and bufptr, nLeft, and
5207 * nFree are not reset, since these fields are manipulated by
5208 * unprotected macros, and may only be reset by non-interrupting code.
5209 */
5210#ifdef ADAPT_WINDOW
5211/* this code requires that call->conn be set properly as a pre-condition. */
5212#endif /* ADAPT_WINDOW */
5213
5214void
5215rxi_ResetCall(struct rx_call *call, int newcall)
5216{
5217 int flags;
5218 struct rx_peer *peer;
5219 struct rx_packet *packet;
5220#ifdef DEBUG
5221 osirx_AssertMine(&call->lock, "rxi_ResetCall");
5222#endif
5223 dpf(("rxi_ResetCall(call %"AFS_PTR_FMT", newcall %d)\n", call, newcall))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ResetCall(call %"
"p"", newcall %d)\n", call, newcall); } while (0);
5224
5225 /* Notify anyone who is waiting for asynchronous packet arrival */
5226 if (call->arrivalProc) {
5227 (*call->arrivalProc) (call, call->arrivalProcHandle,
5228 call->arrivalProcArg);
5229 call->arrivalProc = (void (*)())0;
5230 }
5231
5232 if (call->growMTUEvent)
5233 rxevent_Cancel(call->growMTUEvent, call,do { if (call->growMTUEvent) { rxevent_Cancel_1(call->growMTUEvent
, ((void *)0), 0); call->growMTUEvent = ((void *)0); } } while
(0)
5234 RX_CALL_REFCOUNT_ALIVE)do { if (call->growMTUEvent) { rxevent_Cancel_1(call->growMTUEvent
, ((void *)0), 0); call->growMTUEvent = ((void *)0); } } while
(0);
5235
5236 if (call->delayedAbortEvent) {
5237 rxevent_Cancel(call->delayedAbortEvent, call, RX_CALL_REFCOUNT_ABORT)do { if (call->delayedAbortEvent) { rxevent_Cancel_1(call->
delayedAbortEvent, ((void *)0), 0); call->delayedAbortEvent
= ((void *)0); } } while(0);
5238 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2);
5239 if (packet) {
5240 rxi_SendCallAbort(call, packet, 0, 1);
5241 rxi_FreePacket(packet);
5242 }
5243 }
5244
5245 /*
5246 * Update the peer with the congestion information in this call
5247 * so other calls on this connection can pick up where this call
5248 * left off. If the congestion sequence numbers don't match then
5249 * another call experienced a retransmission.
5250 */
5251 peer = call->conn->peer;
5252 MUTEX_ENTER(&peer->peer_lock);
5253 if (!newcall) {
5254 if (call->congestSeq == peer->congestSeq) {
5255 peer->cwind = MAX(peer->cwind, call->cwind)(((peer->cwind)>(call->cwind))?(peer->cwind):(call
->cwind));
5256 peer->MTU = MAX(peer->MTU, call->MTU)(((peer->MTU)>(call->MTU))?(peer->MTU):(call->
MTU));
5257 peer->nDgramPackets =
5258 MAX(peer->nDgramPackets, call->nDgramPackets)(((peer->nDgramPackets)>(call->nDgramPackets))?(peer
->nDgramPackets):(call->nDgramPackets));
5259 }
5260 } else {
5261 call->abortCode = 0;
5262 call->abortCount = 0;
5263 }
5264 if (peer->maxDgramPackets > 1) {
5265 call->MTU = RX_HEADER_SIZEsizeof (struct rx_header) + RX_JUMBOBUFFERSIZE1412;
5266 } else {
5267 call->MTU = peer->MTU;
5268 }
5269 call->cwind = MIN((int)peer->cwind, (int)peer->nDgramPackets)((((int)peer->cwind)<((int)peer->nDgramPackets))?((int
)peer->cwind):((int)peer->nDgramPackets));
5270 call->ssthresh = rx_maxSendWindow;
5271 call->nDgramPackets = peer->nDgramPackets;
5272 call->congestSeq = peer->congestSeq;
5273 call->rtt = peer->rtt;
5274 call->rtt_dev = peer->rtt_dev;
5275 clock_Zero(&call->rto)((&call->rto)->sec = (&call->rto)->usec =
0);
5276 clock_Addmsec(&call->rto,do { if (((((((call->rtt >> 3) + call->rtt_dev))>
(rx_minPeerTimeout))?(((call->rtt >> 3) + call->rtt_dev
)):(rx_minPeerTimeout)) + 200) >= 1000) { (&call->rto
)->sec += (afs_int32)(((((((call->rtt >> 3) + call
->rtt_dev))>(rx_minPeerTimeout))?(((call->rtt >>
3) + call->rtt_dev)):(rx_minPeerTimeout)) + 200) / 1000);
(&call->rto)->usec += (afs_int32)((((((((call->
rtt >> 3) + call->rtt_dev))>(rx_minPeerTimeout))?
(((call->rtt >> 3) + call->rtt_dev)):(rx_minPeerTimeout
)) + 200) % 1000) * 1000); } else { (&call->rto)->usec
+= (afs_int32)(((((((call->rtt >> 3) + call->rtt_dev
))>(rx_minPeerTimeout))?(((call->rtt >> 3) + call
->rtt_dev)):(rx_minPeerTimeout)) + 200) * 1000); } if ((&
call->rto)->usec >= 1000000) { (&call->rto)->
usec -= 1000000; (&call->rto)->sec++; } } while(0)
5277 MAX(((call->rtt >> 3) + call->rtt_dev), rx_minPeerTimeout) + 200)do { if (((((((call->rtt >> 3) + call->rtt_dev))>
(rx_minPeerTimeout))?(((call->rtt >> 3) + call->rtt_dev
)):(rx_minPeerTimeout)) + 200) >= 1000) { (&call->rto
)->sec += (afs_int32)(((((((call->rtt >> 3) + call
->rtt_dev))>(rx_minPeerTimeout))?(((call->rtt >>
3) + call->rtt_dev)):(rx_minPeerTimeout)) + 200) / 1000);
(&call->rto)->usec += (afs_int32)((((((((call->
rtt >> 3) + call->rtt_dev))>(rx_minPeerTimeout))?
(((call->rtt >> 3) + call->rtt_dev)):(rx_minPeerTimeout
)) + 200) % 1000) * 1000); } else { (&call->rto)->usec
+= (afs_int32)(((((((call->rtt >> 3) + call->rtt_dev
))>(rx_minPeerTimeout))?(((call->rtt >> 3) + call
->rtt_dev)):(rx_minPeerTimeout)) + 200) * 1000); } if ((&
call->rto)->usec >= 1000000) { (&call->rto)->
usec -= 1000000; (&call->rto)->sec++; } } while(0);
5278 MUTEX_EXIT(&peer->peer_lock);
5279
5280 flags = call->flags;
5281#ifdef AFS_GLOBAL_RXLOCK_KERNEL
5282 rxi_WaitforTQBusy(call);
5283#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5284
5285 rxi_ClearTransmitQueue(call, 1);
5286 if (call->tqWaiters || (flags & RX_CALL_TQ_WAIT1024)) {
5287 dpf(("rcall %"AFS_PTR_FMT" has %d waiters and flags %d\n", call, call->tqWaiters, call->flags))do { if (rx_debugFile) rxi_DebugPrint ("rcall %""p"" has %d waiters and flags %d\n"
, call, call->tqWaiters, call->flags); } while (0);
5288 }
5289 call->flags = 0;
5290
5291 if ((flags & RX_CALL_PEER_BUSY0x20000)) {
5292 /* The call channel is still busy; resetting the call doesn't change
5293 * that */
5294 call->flags |= RX_CALL_PEER_BUSY0x20000;
5295 }
5296
5297 rxi_ClearReceiveQueue(call);
5298 /* why init the queue if you just emptied it? queue_Init(&call->rq); */
5299
5300
5301 call->error = 0;
5302 call->twind = call->conn->twind[call->channel];
5303 call->rwind = call->conn->rwind[call->channel];
5304 call->nSoftAcked = 0;
5305 call->nextCwind = 0;
5306 call->nAcks = 0;
5307 call->nNacks = 0;
5308 call->nCwindAcks = 0;
5309 call->nSoftAcks = 0;
5310 call->nHardAcks = 0;
5311
5312 call->tfirst = call->rnext = call->tnext = 1;
5313 call->tprev = 0;
5314 call->rprev = 0;
5315 call->lastAcked = 0;
5316 call->localStatus = call->remoteStatus = 0;
5317
5318 if (flags & RX_CALL_READER_WAIT1) {
5319#ifdef RX_ENABLE_LOCKS
5320 CV_BROADCAST(&call->cv_rq);
5321#else
5322 osi_rxWakeup(&call->rq)rxi_Wakeup(&call->rq);
5323#endif
5324 }
5325 if (flags & RX_CALL_WAIT_PACKETS8) {
5326 MUTEX_ENTER(&rx_freePktQ_lock);
5327 rxi_PacketsUnWait(); /* XXX */
5328 MUTEX_EXIT(&rx_freePktQ_lock);
5329 }
5330#ifdef RX_ENABLE_LOCKS
5331 CV_SIGNAL(&call->cv_twind);
5332#else
5333 if (flags & RX_CALL_WAIT_WINDOW_ALLOC2)
5334 osi_rxWakeup(&call->twind)rxi_Wakeup(&call->twind);
5335#endif
5336
5337#ifdef RX_ENABLE_LOCKS
5338 /* The following ensures that we don't mess with any queue while some
5339 * other thread might also be doing so. The call_queue_lock field is
5340 * is only modified under the call lock. If the call is in the process
5341 * of being removed from a queue, the call is not locked until the
5342 * the queue lock is dropped and only then is the call_queue_lock field
5343 * zero'd out. So it's safe to lock the queue if call_queue_lock is set.
5344 * Note that any other routine which removes a call from a queue has to
5345 * obtain the queue lock before examing the queue and removing the call.
5346 */
5347 if (call->call_queue_lock) {
5348 MUTEX_ENTER(call->call_queue_lock);
5349 if (queue_IsOnQueue(call)(((struct rx_queue *)(call))->next != 0)) {
5350 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
5351 if (flags & RX_CALL_WAIT_PROC16) {
5352 rx_atomic_dec(&rx_nWaiting);
5353 }
5354 }
5355 MUTEX_EXIT(call->call_queue_lock);
5356 CLEAR_CALL_QUEUE_LOCK(call);
5357 }
5358#else /* RX_ENABLE_LOCKS */
5359 if (queue_IsOnQueue(call)(((struct rx_queue *)(call))->next != 0)) {
5360 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
5361 if (flags & RX_CALL_WAIT_PROC16)
5362 rx_atomic_dec(&rx_nWaiting);
5363 }
5364#endif /* RX_ENABLE_LOCKS */
5365
5366 rxi_KeepAliveOff(call)do { if ((call)->keepAliveEvent) { rxevent_Cancel_1((call)
->keepAliveEvent, ((void *)0), 0); (call)->keepAliveEvent
= ((void *)0); } } while(0);
5367 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
5368}
5369
5370/* Send an acknowledge for the indicated packet (seq,serial) of the
5371 * indicated call, for the indicated reason (reason). This
5372 * acknowledge will specifically acknowledge receiving the packet, and
5373 * will also specify which other packets for this call have been
5374 * received. This routine returns the packet that was used to the
5375 * caller. The caller is responsible for freeing it or re-using it.
5376 * This acknowledgement also returns the highest sequence number
5377 * actually read out by the higher level to the sender; the sender
5378 * promises to keep around packets that have not been read by the
5379 * higher level yet (unless, of course, the sender decides to abort
5380 * the call altogether). Any of p, seq, serial, pflags, or reason may
5381 * be set to zero without ill effect. That is, if they are zero, they
5382 * will not convey any information.
5383 * NOW there is a trailer field, after the ack where it will safely be
5384 * ignored by mundanes, which indicates the maximum size packet this
5385 * host can swallow. */
5386/*
5387 struct rx_packet *optionalPacket; use to send ack (or null)
5388 int seq; Sequence number of the packet we are acking
5389 int serial; Serial number of the packet
5390 int pflags; Flags field from packet header
5391 int reason; Reason an acknowledge was prompted
5392*/
5393
5394struct rx_packet *
5395rxi_SendAck(struct rx_call *call,
5396 struct rx_packet *optionalPacket, int serial, int reason,
5397 int istack)
5398{
5399 struct rx_ackPacket *ap;
5400 struct rx_packet *rqp;
5401 struct rx_packet *nxp; /* For queue_Scan */
5402 struct rx_packet *p;
5403 u_char offset;
5404 afs_int32 templ;
5405 afs_uint32 padbytes = 0;
5406#ifdef RX_ENABLE_TSFPQ
5407 struct rx_ts_info_t * rx_ts_info;
5408#endif
5409
5410 /*
5411 * Open the receive window once a thread starts reading packets
5412 */
5413 if (call->rnext > 1) {
5414 call->conn->rwind[call->channel] = call->rwind = rx_maxReceiveWindow;
5415 }
5416
5417 /* Don't attempt to grow MTU if this is a critical ping */
5418 if (reason == RX_ACK_MTU-1) {
5419 /* keep track of per-call attempts, if we're over max, do in small
5420 * otherwise in larger? set a size to increment by, decrease
5421 * on failure, here?
5422 */
5423 if (call->conn->peer->maxPacketSize &&
5424 (call->conn->peer->maxPacketSize < OLD_MAX_PACKET_SIZE(1500 - RX_IPUDP_SIZE)
5425 +RX_IPUDP_SIZE))
5426 padbytes = call->conn->peer->maxPacketSize+16;
5427 else
5428 padbytes = call->conn->peer->maxMTU + 128;
5429
5430 /* do always try a minimum size ping */
5431 padbytes = MAX(padbytes, RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE+4)(((padbytes)>((576 - RX_IPUDP_SIZE)+RX_IPUDP_SIZE+4))?(padbytes
):((576 - RX_IPUDP_SIZE)+RX_IPUDP_SIZE+4));
5432
5433 /* subtract the ack payload */
5434 padbytes -= (rx_AckDataSize(call->rwind)(3 + call->rwind + __builtin_offsetof(struct rx_ackPacket,
acks[0])) + 4 * sizeof(afs_int32));
5435 reason = RX_ACK_PING6;
5436 }
5437
5438 call->nHardAcks = 0;
5439 call->nSoftAcks = 0;
5440 if (call->rnext > call->lastAcked)
5441 call->lastAcked = call->rnext;
5442 p = optionalPacket;
5443
5444 if (p) {
5445 rx_computelen(p, p->length){ unsigned int i; for (p->length=0, i=1; i < p->niovecs
; i++ ) p->length += p->wirevec[i].iov_len; }; /* reset length, you never know */
5446 } /* where that's been... */
5447#ifdef RX_ENABLE_TSFPQ
5448 else {
5449 RX_TS_INFO_GET(rx_ts_info);
5450 if ((p = rx_ts_info->local_special_packet)) {
5451 rx_computelen(p, p->length){ unsigned int i; for (p->length=0, i=1; i < p->niovecs
; i++ ) p->length += p->wirevec[i].iov_len; };
5452 } else if ((p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2))) {
5453 rx_ts_info->local_special_packet = p;
5454 } else { /* We won't send the ack, but don't panic. */
5455 return optionalPacket;
5456 }
5457 }
5458#else
5459 else if (!(p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2))) {
5460 /* We won't send the ack, but don't panic. */
5461 return optionalPacket;
5462 }
5463#endif
5464
5465 templ = padbytes +
5466 rx_AckDataSize(call->rwind)(3 + call->rwind + __builtin_offsetof(struct rx_ackPacket,
acks[0])) + 4 * sizeof(afs_int32) -
5467 rx_GetDataSize(p)((p)->length);
5468 if (templ > 0) {
5469 if (rxi_AllocDataBuf(p, templ, RX_PACKET_CLASS_SPECIAL2) > 0) {
5470#ifndef RX_ENABLE_TSFPQ
5471 if (!optionalPacket)
5472 rxi_FreePacket(p);
5473#endif
5474 return optionalPacket;
5475 }
5476 templ = rx_AckDataSize(call->rwind)(3 + call->rwind + __builtin_offsetof(struct rx_ackPacket,
acks[0])) + 2 * sizeof(afs_int32);
5477 if (rx_Contiguous(p)((((unsigned) (p)->length)<((unsigned) ((p)->wirevec
[1].iov_len)))?((unsigned) (p)->length):((unsigned) ((p)->
wirevec[1].iov_len))) < templ) {
5478#ifndef RX_ENABLE_TSFPQ
5479 if (!optionalPacket)
5480 rxi_FreePacket(p);
5481#endif
5482 return optionalPacket;
5483 }
5484 }
5485
5486
5487 /* MTUXXX failing to send an ack is very serious. We should */
5488 /* try as hard as possible to send even a partial ack; it's */
5489 /* better than nothing. */
5490 ap = (struct rx_ackPacket *)rx_DataOf(p)((char *) (p)->wirevec[1].iov_base);
5491 ap->bufferSpace = htonl(0)(__builtin_constant_p(0) ? ((((__uint32_t)(0)) >> 24) |
((((__uint32_t)(0)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(0)) & (0xff << 8)) << 8) | (((
__uint32_t)(0)) << 24)) : __bswap32_var(0)); /* Something should go here, sometime */
5492 ap->reason = reason;
5493
5494 /* The skew computation used to be bogus, I think it's better now. */
5495 /* We should start paying attention to skew. XXX */
5496 ap->serial = htonl(serial)(__builtin_constant_p(serial) ? ((((__uint32_t)(serial)) >>
24) | ((((__uint32_t)(serial)) & (0xff << 16)) >>
8) | ((((__uint32_t)(serial)) & (0xff << 8)) <<
8) | (((__uint32_t)(serial)) << 24)) : __bswap32_var(serial
));
5497 ap->maxSkew = 0; /* used to be peer->inPacketSkew */
5498
5499 /*
5500 * First packet not yet forwarded to reader. When ACKALL has been
5501 * sent the peer has been told that all received packets will be
5502 * delivered to the reader. The value 'rnext' is used internally
5503 * to refer to the next packet in the receive queue that must be
5504 * delivered to the reader. From the perspective of the peer it
5505 * already has so report the last sequence number plus one if there
5506 * are packets in the receive queue awaiting processing.
5507 */
5508 if ((call->flags & RX_CALL_ACKALL_SENT0x40000) &&
5509 !queue_IsEmpty(&call->rq)(((struct rx_queue *)(&call->rq))->next == ((struct
rx_queue *)(&call->rq)))) {
5510 ap->firstPacket = htonl(queue_Last(&call->rq, rx_packet)->header.seq + 1)(__builtin_constant_p(((struct rx_packet *)((struct rx_queue *
)(&call->rq))->prev)->header.seq + 1) ? ((((__uint32_t
)(((struct rx_packet *)((struct rx_queue *)(&call->rq)
)->prev)->header.seq + 1)) >> 24) | ((((__uint32_t
)(((struct rx_packet *)((struct rx_queue *)(&call->rq)
)->prev)->header.seq + 1)) & (0xff << 16)) >>
8) | ((((__uint32_t)(((struct rx_packet *)((struct rx_queue *
)(&call->rq))->prev)->header.seq + 1)) & (0xff
<< 8)) << 8) | (((__uint32_t)(((struct rx_packet
*)((struct rx_queue *)(&call->rq))->prev)->header
.seq + 1)) << 24)) : __bswap32_var(((struct rx_packet *
)((struct rx_queue *)(&call->rq))->prev)->header
.seq + 1));
5511 } else
5512 ap->firstPacket = htonl(call->rnext)(__builtin_constant_p(call->rnext) ? ((((__uint32_t)(call->
rnext)) >> 24) | ((((__uint32_t)(call->rnext)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(call->rnext
)) & (0xff << 8)) << 8) | (((__uint32_t)(call
->rnext)) << 24)) : __bswap32_var(call->rnext));
5513
5514 ap->previousPacket = htonl(call->rprev)(__builtin_constant_p(call->rprev) ? ((((__uint32_t)(call->
rprev)) >> 24) | ((((__uint32_t)(call->rprev)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(call->rprev
)) & (0xff << 8)) << 8) | (((__uint32_t)(call
->rprev)) << 24)) : __bswap32_var(call->rprev)); /* Previous packet received */
5515
5516 /* No fear of running out of ack packet here because there can only be at most
5517 * one window full of unacknowledged packets. The window size must be constrained
5518 * to be less than the maximum ack size, of course. Also, an ack should always
5519 * fit into a single packet -- it should not ever be fragmented. */
5520 for (offset = 0, queue_Scan(&call->rq, rqp, nxp, rx_packet)(rqp) = ((struct rx_packet *)((struct rx_queue *)(&call->
rq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(rqp))->next); !(((struct rx_queue *)(&call->rq)) ==
((struct rx_queue *)(rqp))); (rqp) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(rqp))->next)) {
5521 if (!rqp || !call->rq.next
5522 || (rqp->header.seq > (call->rnext + call->rwind))) {
5523#ifndef RX_ENABLE_TSFPQ
5524 if (!optionalPacket)
5525 rxi_FreePacket(p);
5526#endif
5527 rxi_CallError(call, RX_CALL_DEAD(-1));
5528 return optionalPacket;
5529 }
5530
5531 while (rqp->header.seq > call->rnext + offset)
5532 ap->acks[offset++] = RX_ACK_TYPE_NACK0;
5533 ap->acks[offset++] = RX_ACK_TYPE_ACK1;
5534
5535 if ((offset > (u_char) rx_maxReceiveWindow) || (offset > call->rwind)) {
5536#ifndef RX_ENABLE_TSFPQ
5537 if (!optionalPacket)
5538 rxi_FreePacket(p);
5539#endif
5540 rxi_CallError(call, RX_CALL_DEAD(-1));
5541 return optionalPacket;
5542 }
5543 }
5544
5545 ap->nAcks = offset;
5546 p->length = rx_AckDataSize(offset)(3 + offset + __builtin_offsetof(struct rx_ackPacket, acks[0]
)) + 4 * sizeof(afs_int32);
5547
5548 /* these are new for AFS 3.3 */
5549 templ = rxi_AdjustMaxMTU(call->conn->peer->ifMTU, rx_maxReceiveSize);
5550 templ = htonl(templ)(__builtin_constant_p(templ) ? ((((__uint32_t)(templ)) >>
24) | ((((__uint32_t)(templ)) & (0xff << 16)) >>
8) | ((((__uint32_t)(templ)) & (0xff << 8)) <<
8) | (((__uint32_t)(templ)) << 24)) : __bswap32_var(templ
));
5551 rx_packetwrite(p, rx_AckDataSize(offset), sizeof(afs_int32), &templ)( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0]))) + (sizeof(afs_int32)) > (p)->wirevec[1].iov_len ?
rx_SlowWritePacket(p, (3 + offset + __builtin_offsetof(struct
rx_ackPacket, acks[0])), sizeof(afs_int32), (char*)(&templ
)) : ((memcpy((char*)((p)->wirevec[1].iov_base)+((3 + offset
+ __builtin_offsetof(struct rx_ackPacket, acks[0]))), (char *
)(&templ), (sizeof(afs_int32)))),0));
5552 templ = htonl(call->conn->peer->ifMTU)(__builtin_constant_p(call->conn->peer->ifMTU) ? (((
(__uint32_t)(call->conn->peer->ifMTU)) >> 24) |
((((__uint32_t)(call->conn->peer->ifMTU)) & (0xff
<< 16)) >> 8) | ((((__uint32_t)(call->conn->
peer->ifMTU)) & (0xff << 8)) << 8) | (((__uint32_t
)(call->conn->peer->ifMTU)) << 24)) : __bswap32_var
(call->conn->peer->ifMTU));
5553 rx_packetwrite(p, rx_AckDataSize(offset) + sizeof(afs_int32),( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)->
wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + sizeof(afs_int32), sizeof(afs_int32
), (char*)(&templ)) : ((memcpy((char*)((p)->wirevec[1]
.iov_base)+((3 + offset + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + sizeof(afs_int32)), (char *)(&templ), (sizeof
(afs_int32)))),0))
5554 sizeof(afs_int32), &templ)( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)->
wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + sizeof(afs_int32), sizeof(afs_int32
), (char*)(&templ)) : ((memcpy((char*)((p)->wirevec[1]
.iov_base)+((3 + offset + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + sizeof(afs_int32)), (char *)(&templ), (sizeof
(afs_int32)))),0));
5555
5556 /* new for AFS 3.4 */
5557 templ = htonl(call->rwind)(__builtin_constant_p(call->rwind) ? ((((__uint32_t)(call->
rwind)) >> 24) | ((((__uint32_t)(call->rwind)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(call->rwind
)) & (0xff << 8)) << 8) | (((__uint32_t)(call
->rwind)) << 24)) : __bswap32_var(call->rwind));
5558 rx_packetwrite(p, rx_AckDataSize(offset) + 2 * sizeof(afs_int32),( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 2 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&templ)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 2 * sizeof(afs_int32)), (char
*)(&templ), (sizeof(afs_int32)))),0))
5559 sizeof(afs_int32), &templ)( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 2 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 2 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&templ)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 2 * sizeof(afs_int32)), (char
*)(&templ), (sizeof(afs_int32)))),0));
5560
5561 /* new for AFS 3.5 */
5562 templ = htonl(call->conn->peer->ifDgramPackets)(__builtin_constant_p(call->conn->peer->ifDgramPackets
) ? ((((__uint32_t)(call->conn->peer->ifDgramPackets
)) >> 24) | ((((__uint32_t)(call->conn->peer->
ifDgramPackets)) & (0xff << 16)) >> 8) | ((((
__uint32_t)(call->conn->peer->ifDgramPackets)) &
(0xff << 8)) << 8) | (((__uint32_t)(call->conn
->peer->ifDgramPackets)) << 24)) : __bswap32_var(
call->conn->peer->ifDgramPackets));
5563 rx_packetwrite(p, rx_AckDataSize(offset) + 3 * sizeof(afs_int32),( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 3 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 3 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&templ)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 3 * sizeof(afs_int32)), (char
*)(&templ), (sizeof(afs_int32)))),0))
5564 sizeof(afs_int32), &templ)( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 3 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 3 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&templ)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 3 * sizeof(afs_int32)), (char
*)(&templ), (sizeof(afs_int32)))),0));
5565
5566 p->header.serviceId = call->conn->serviceId;
5567 p->header.cid = (call->conn->cid | call->channel);
5568 p->header.callNumber = *call->callNumber;
5569 p->header.seq = 0;
5570 p->header.securityIndex = call->conn->securityIndex;
5571 p->header.epoch = call->conn->epoch;
5572 p->header.type = RX_PACKET_TYPE_ACK2;
5573 p->header.flags = RX_SLOW_START_OK32;
5574 if (reason == RX_ACK_PING6) {
5575 p->header.flags |= RX_REQUEST_ACK2;
5576#ifdef ADAPT_WINDOW
5577 clock_GetTime(&call->pingRequestTime)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&call->pingRequestTime)->sec = (afs_int32)tv.tv_sec
; (&call->pingRequestTime)->usec = (afs_int32)tv.tv_usec
; } while(0);
5578#endif
5579 if (padbytes) {
5580 p->length = padbytes +
5581 rx_AckDataSize(call->rwind)(3 + call->rwind + __builtin_offsetof(struct rx_ackPacket,
acks[0])) + 4 * sizeof(afs_int32);
5582
5583 while (padbytes--)
5584 /* not fast but we can potentially use this if truncated
5585 * fragments are delivered to figure out the mtu.
5586 */
5587 rx_packetwrite(p, rx_AckDataSize(offset) + 4 *( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 4 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 4 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&padbytes)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 4 * sizeof(afs_int32)), (char
*)(&padbytes), (sizeof(afs_int32)))),0))
5588 sizeof(afs_int32), sizeof(afs_int32),( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 4 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 4 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&padbytes)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 4 * sizeof(afs_int32)), (char
*)(&padbytes), (sizeof(afs_int32)))),0))
5589 &padbytes)( ((3 + offset + __builtin_offsetof(struct rx_ackPacket, acks
[0])) + 4 * sizeof(afs_int32)) + (sizeof(afs_int32)) > (p)
->wirevec[1].iov_len ? rx_SlowWritePacket(p, (3 + offset +
__builtin_offsetof(struct rx_ackPacket, acks[0])) + 4 * sizeof
(afs_int32), sizeof(afs_int32), (char*)(&padbytes)) : ((memcpy
((char*)((p)->wirevec[1].iov_base)+((3 + offset + __builtin_offsetof
(struct rx_ackPacket, acks[0])) + 4 * sizeof(afs_int32)), (char
*)(&padbytes), (sizeof(afs_int32)))),0));
5590 }
5591 }
5592 if (call->conn->type == RX_CLIENT_CONNECTION0)
5593 p->header.flags |= RX_CLIENT_INITIATED1;
5594
5595#ifdef RXDEBUG1
5596#ifdef AFS_NT40_ENV
5597 if (rxdebug_active) {
5598 char msg[512];
5599 size_t len;
5600
5601 len = _snprintf(msg, sizeof(msg),
5602 "tid[%d] SACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
5603 GetCurrentThreadId(), rx_ack_reason(ap->reason),
5604 ntohl(ap->serial)(__builtin_constant_p(ap->serial) ? ((((__uint32_t)(ap->
serial)) >> 24) | ((((__uint32_t)(ap->serial)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(ap->serial
)) & (0xff << 8)) << 8) | (((__uint32_t)(ap->
serial)) << 24)) : __bswap32_var(ap->serial)), ntohl(ap->previousPacket)(__builtin_constant_p(ap->previousPacket) ? ((((__uint32_t
)(ap->previousPacket)) >> 24) | ((((__uint32_t)(ap->
previousPacket)) & (0xff << 16)) >> 8) | ((((
__uint32_t)(ap->previousPacket)) & (0xff << 8)) <<
8) | (((__uint32_t)(ap->previousPacket)) << 24)) : __bswap32_var
(ap->previousPacket)),
5605 (unsigned int)p->header.seq, ntohl(ap->firstPacket)(__builtin_constant_p(ap->firstPacket) ? ((((__uint32_t)(ap
->firstPacket)) >> 24) | ((((__uint32_t)(ap->firstPacket
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(ap
->firstPacket)) & (0xff << 8)) << 8) | (((
__uint32_t)(ap->firstPacket)) << 24)) : __bswap32_var
(ap->firstPacket)),
5606 ap->nAcks, ntohs(ap->bufferSpace)(__builtin_constant_p(ap->bufferSpace) ? (__uint16_t)(((__uint16_t
)(ap->bufferSpace)) << 8 | ((__uint16_t)(ap->bufferSpace
)) >> 8) : __bswap16_var(ap->bufferSpace)) );
5607 if (ap->nAcks) {
5608 int offset;
5609
5610 for (offset = 0; offset < ap->nAcks && len < sizeof(msg); offset++)
5611 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK0 ? '-' : '*');
5612 }
5613 msg[len++]='\n';
5614 msg[len] = '\0';
5615 OutputDebugString(msg);
5616 }
5617#else /* AFS_NT40_ENV */
5618 if (rx_Logrx_debugFile) {
5619 fprintf(rx_Logrx_debugFile, "SACK: reason %x previous %u seq %u first %u ",
5620 ap->reason, ntohl(ap->previousPacket)(__builtin_constant_p(ap->previousPacket) ? ((((__uint32_t
)(ap->previousPacket)) >> 24) | ((((__uint32_t)(ap->
previousPacket)) & (0xff << 16)) >> 8) | ((((
__uint32_t)(ap->previousPacket)) & (0xff << 8)) <<
8) | (((__uint32_t)(ap->previousPacket)) << 24)) : __bswap32_var
(ap->previousPacket)),
5621 (unsigned int)p->header.seq, ntohl(ap->firstPacket)(__builtin_constant_p(ap->firstPacket) ? ((((__uint32_t)(ap
->firstPacket)) >> 24) | ((((__uint32_t)(ap->firstPacket
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(ap
->firstPacket)) & (0xff << 8)) << 8) | (((
__uint32_t)(ap->firstPacket)) << 24)) : __bswap32_var
(ap->firstPacket)));
5622 if (ap->nAcks) {
5623 for (offset = 0; offset < ap->nAcks; offset++)
5624 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',(!__isthreaded ? __sputc(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile) : (putc)(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile))
5625 rx_Log)(!__isthreaded ? __sputc(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile) : (putc)(ap->acks[offset] == 0 ? '-' : '*'
, rx_debugFile));
5626 }
5627 putc('\n', rx_Log)(!__isthreaded ? __sputc('\n', rx_debugFile) : (putc)('\n', rx_debugFile
));
5628 }
5629#endif /* AFS_NT40_ENV */
5630#endif
5631 {
5632 int i, nbytes = p->length;
5633
5634 for (i = 1; i < p->niovecs; i++) { /* vec 0 is ALWAYS header */
5635 if (nbytes <= p->wirevec[i].iov_len) {
5636 int savelen, saven;
5637
5638 savelen = p->wirevec[i].iov_len;
5639 saven = p->niovecs;
5640 p->wirevec[i].iov_len = nbytes;
5641 p->niovecs = i + 1;
5642 rxi_Send(call, p, istack);
5643 p->wirevec[i].iov_len = savelen;
5644 p->niovecs = saven;
5645 break;
5646 } else
5647 nbytes -= p->wirevec[i].iov_len;
5648 }
5649 }
5650 if (rx_stats_active)
5651 rx_atomic_inc(&rx_stats.ackPacketsSent);
5652#ifndef RX_ENABLE_TSFPQ
5653 if (!optionalPacket)
5654 rxi_FreePacket(p);
5655#endif
5656 return optionalPacket; /* Return packet for re-use by caller */
5657}
5658
5659struct xmitlist {
5660 struct rx_packet **list;
5661 int len;
5662 int resending;
5663};
5664
5665/* Send all of the packets in the list in single datagram */
5666static void
5667rxi_SendList(struct rx_call *call, struct xmitlist *xmit,
5668 int istack, int moreFlag)
5669{
5670 int i;
5671 int requestAck = 0;
5672 int lastPacket = 0;
5673 struct clock now;
5674 struct rx_connection *conn = call->conn;
5675 struct rx_peer *peer = conn->peer;
5676
5677 MUTEX_ENTER(&peer->peer_lock);
5678 peer->nSent += xmit->len;
5679 if (xmit->resending)
5680 peer->reSends += xmit->len;
5681 MUTEX_EXIT(&peer->peer_lock);
5682
5683 if (rx_stats_active) {
5684 if (xmit->resending)
5685 rx_atomic_add(&rx_stats.dataPacketsReSent, xmit->len);
5686 else
5687 rx_atomic_add(&rx_stats.dataPacketsSent, xmit->len);
5688 }
5689
5690 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
5691
5692 if (xmit->list[xmit->len - 1]->header.flags & RX_LAST_PACKET4) {
5693 lastPacket = 1;
5694 }
5695
5696 /* Set the packet flags and schedule the resend events */
5697 /* Only request an ack for the last packet in the list */
5698 for (i = 0; i < xmit->len; i++) {
5699 struct rx_packet *packet = xmit->list[i];
5700
5701 /* Record the time sent */
5702 packet->timeSent = now;
5703 packet->flags |= RX_PKTFLAG_SENT0x40;
5704
5705 /* Ask for an ack on retransmitted packets, on every other packet
5706 * if the peer doesn't support slow start. Ask for an ack on every
5707 * packet until the congestion window reaches the ack rate. */
5708 if (packet->header.serial) {
5709 requestAck = 1;
5710 } else {
5711 packet->firstSent = now;
5712 if (!lastPacket && (call->cwind <= (u_short) (conn->ackRate + 1)
5713 || (!(call->flags & RX_CALL_SLOW_START_OK8192)
5714 && (packet->header.seq & 1)))) {
5715 requestAck = 1;
5716 }
5717 }
5718
5719 /* Tag this packet as not being the last in this group,
5720 * for the receiver's benefit */
5721 if (i < xmit->len - 1 || moreFlag) {
5722 packet->header.flags |= RX_MORE_PACKETS8;
5723 }
5724 }
5725
5726 if (requestAck) {
5727 xmit->list[xmit->len - 1]->header.flags |= RX_REQUEST_ACK2;
5728 }
5729
5730 /* Since we're about to send a data packet to the peer, it's
5731 * safe to nuke any scheduled end-of-packets ack */
5732 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
5733
5734 MUTEX_EXIT(&call->lock);
5735 MUTEX_ENTER(&rx_refcnt_mutex);
5736 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5737 MUTEX_EXIT(&rx_refcnt_mutex);
5738 if (xmit->len > 1) {
5739 rxi_SendPacketList(call, conn, xmit->list, xmit->len, istack);
5740 } else {
5741 rxi_SendPacket(call, conn, xmit->list[0], istack);
5742 }
5743 MUTEX_ENTER(&call->lock);
5744 MUTEX_ENTER(&rx_refcnt_mutex);
5745 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5746 MUTEX_EXIT(&rx_refcnt_mutex);
5747
5748 /* Tell the RTO calculation engine that we have sent a packet, and
5749 * if it was the last one */
5750 rxi_rto_packet_sent(call, lastPacket, istack);
5751
5752 /* Update last send time for this call (for keep-alive
5753 * processing), and for the connection (so that we can discover
5754 * idle connections) */
5755 conn->lastSendTime = call->lastSendTime = clock_Sec()(time(((void *)0)));
5756 /* Let a set of retransmits trigger an idle timeout */
5757 if (!xmit->resending)
5758 call->lastSendData = call->lastSendTime;
5759}
5760
5761/* When sending packets we need to follow these rules:
5762 * 1. Never send more than maxDgramPackets in a jumbogram.
5763 * 2. Never send a packet with more than two iovecs in a jumbogram.
5764 * 3. Never send a retransmitted packet in a jumbogram.
5765 * 4. Never send more than cwind/4 packets in a jumbogram
5766 * We always keep the last list we should have sent so we
5767 * can set the RX_MORE_PACKETS flags correctly.
5768 */
5769
5770static void
5771rxi_SendXmitList(struct rx_call *call, struct rx_packet **list, int len,
5772 int istack)
5773{
5774 int i;
5775 int recovery;
5776 struct xmitlist working;
5777 struct xmitlist last;
5778
5779 struct rx_peer *peer = call->conn->peer;
5780 int morePackets = 0;
5781
5782 memset(&last, 0, sizeof(struct xmitlist));
5783 working.list = &list[0];
5784 working.len = 0;
5785 working.resending = 0;
5786
5787 recovery = call->flags & RX_CALL_FAST_RECOVER2048;
5788
5789 for (i = 0; i < len; i++) {
5790 /* Does the current packet force us to flush the current list? */
5791 if (working.len > 0
5792 && (list[i]->header.serial || (list[i]->flags & RX_PKTFLAG_ACKED0x01)
5793 || list[i]->length > RX_JUMBOBUFFERSIZE1412)) {
5794
5795 /* This sends the 'last' list and then rolls the current working
5796 * set into the 'last' one, and resets the working set */
5797
5798 if (last.len > 0) {
5799 rxi_SendList(call, &last, istack, 1);
5800 /* If the call enters an error state stop sending, or if
5801 * we entered congestion recovery mode, stop sending */
5802 if (call->error
5803 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER2048)))
5804 return;
5805 }
5806 last = working;
5807 working.len = 0;
5808 working.resending = 0;
5809 working.list = &list[i];
5810 }
5811 /* Add the current packet to the list if it hasn't been acked.
5812 * Otherwise adjust the list pointer to skip the current packet. */
5813 if (!(list[i]->flags & RX_PKTFLAG_ACKED0x01)) {
5814 working.len++;
5815
5816 if (list[i]->header.serial)
5817 working.resending = 1;
5818
5819 /* Do we need to flush the list? */
5820 if (working.len >= (int)peer->maxDgramPackets
5821 || working.len >= (int)call->nDgramPackets
5822 || working.len >= (int)call->cwind
5823 || list[i]->header.serial
5824 || list[i]->length != RX_JUMBOBUFFERSIZE1412) {
5825 if (last.len > 0) {
5826 rxi_SendList(call, &last, istack, 1);
5827 /* If the call enters an error state stop sending, or if
5828 * we entered congestion recovery mode, stop sending */
5829 if (call->error
5830 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER2048)))
5831 return;
5832 }
5833 last = working;
5834 working.len = 0;
5835 working.resending = 0;
5836 working.list = &list[i + 1];
5837 }
5838 } else {
5839 if (working.len != 0) {
5840 osi_Panic("rxi_SendList error");
5841 }
5842 working.list = &list[i + 1];
5843 }
5844 }
5845
5846 /* Send the whole list when the call is in receive mode, when
5847 * the call is in eof mode, when we are in fast recovery mode,
5848 * and when we have the last packet */
5849 if ((list[len - 1]->header.flags & RX_LAST_PACKET4)
5850 || call->mode == RX_MODE_RECEIVING2 || call->mode == RX_MODE_EOF4
5851 || (call->flags & RX_CALL_FAST_RECOVER2048)) {
5852 /* Check for the case where the current list contains
5853 * an acked packet. Since we always send retransmissions
5854 * in a separate packet, we only need to check the first
5855 * packet in the list */
5856 if (working.len > 0 && !(working.list[0]->flags & RX_PKTFLAG_ACKED0x01)) {
5857 morePackets = 1;
5858 }
5859 if (last.len > 0) {
5860 rxi_SendList(call, &last, istack, morePackets);
5861 /* If the call enters an error state stop sending, or if
5862 * we entered congestion recovery mode, stop sending */
5863 if (call->error
5864 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER2048)))
5865 return;
5866 }
5867 if (morePackets) {
5868 rxi_SendList(call, &working, istack, 0);
5869 }
5870 } else if (last.len > 0) {
5871 rxi_SendList(call, &last, istack, 0);
5872 /* Packets which are in 'working' are not sent by this call */
5873 }
5874}
5875
5876static void
5877rxi_Resend(struct rxevent *event, void *arg0, void *arg1, int istack)
5878{
5879 struct rx_call *call = arg0;
5880 struct rx_peer *peer;
5881 struct rx_packet *p, *nxp;
5882 struct clock maxTimeout = { 60, 0 };
5883
5884 MUTEX_ENTER(&call->lock);
5885
5886 peer = call->conn->peer;
5887
5888 /* Make sure that the event pointer is removed from the call
5889 * structure, since there is no longer a per-call retransmission
5890 * event pending. */
5891 if (event == call->resendEvent) {
5892 MUTEX_ENTER(&rx_refcnt_mutex);
5893 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
5894 MUTEX_EXIT(&rx_refcnt_mutex);
5895 call->resendEvent = NULL((void *)0);
5896 }
5897
5898 if (rxi_busyChannelError && (call->flags & RX_CALL_PEER_BUSY0x20000)) {
5899 rxi_CheckBusy(call);
5900 }
5901
5902 if (queue_IsEmpty(&call->tq)(((struct rx_queue *)(&call->tq))->next == ((struct
rx_queue *)(&call->tq)))) {
5903 /* Nothing to do. This means that we've been raced, and that an
5904 * ACK has come in between when we were triggered, and when we
5905 * actually got to run. */
5906 goto out;
5907 }
5908
5909 /* We're in loss recovery */
5910 call->flags |= RX_CALL_FAST_RECOVER2048;
5911
5912 /* Mark all of the pending packets in the queue as being lost */
5913 for (queue_Scan(&call->tq, p, nxp, rx_packet)(p) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(p))->next); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(p))); (p) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(p))->next)) {
5914 if (!(p->flags & RX_PKTFLAG_ACKED0x01))
5915 p->flags &= ~RX_PKTFLAG_SENT0x40;
5916 }
5917
5918 /* We're resending, so we double the timeout of the call. This will be
5919 * dropped back down by the first successful ACK that we receive.
5920 *
5921 * We apply a maximum value here of 60 seconds
5922 */
5923 clock_Add(&call->rto, &call->rto)do { (&call->rto)->sec += (&call->rto)->sec
; if (((&call->rto)->usec += (&call->rto)->
usec) >= 1000000) { (&call->rto)->usec -= 1000000
; (&call->rto)->sec++; } } while(0);
5924 if (clock_Gt(&call->rto, &maxTimeout)((&call->rto)->sec>(&maxTimeout)->sec || (
(&call->rto)->sec==(&maxTimeout)->sec &&
(&call->rto)->usec>(&maxTimeout)->usec)))
5925 call->rto = maxTimeout;
5926
5927 /* Packet loss is most likely due to congestion, so drop our window size
5928 * and start again from the beginning */
5929 if (peer->maxDgramPackets >1) {
5930 call->MTU = RX_JUMBOBUFFERSIZE1412 + RX_HEADER_SIZEsizeof (struct rx_header);
5931 call->MTU = MIN(peer->natMTU, peer->maxMTU)(((peer->natMTU)<(peer->maxMTU))?(peer->natMTU):(
peer->maxMTU));
5932 }
5933 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind))(((4)>(((((int)call->cwind)<((int)call->twind))?(
(int)call->cwind):((int)call->twind))))?(4):(((((int)call
->cwind)<((int)call->twind))?((int)call->cwind):(
(int)call->twind)))) >> 1;
5934 call->nDgramPackets = 1;
5935 call->cwind = 1;
5936 call->nextCwind = 1;
5937 call->nAcks = 0;
5938 call->nNacks = 0;
5939 MUTEX_ENTER(&peer->peer_lock);
5940 peer->MTU = call->MTU;
5941 peer->cwind = call->cwind;
5942 peer->nDgramPackets = 1;
5943 peer->congestSeq++;
5944 call->congestSeq = peer->congestSeq;
5945 MUTEX_EXIT(&peer->peer_lock);
5946
5947 rxi_Start(call, istack);
5948
5949out:
5950 MUTEX_EXIT(&call->lock);
5951}
5952
5953/* This routine is called when new packets are readied for
5954 * transmission and when retransmission may be necessary, or when the
5955 * transmission window or burst count are favourable. This should be
5956 * better optimized for new packets, the usual case, now that we've
5957 * got rid of queues of send packets. XXXXXXXXXXX */
5958void
5959rxi_Start(struct rx_call *call, int istack)
5960{
5961
5962 struct rx_packet *p;
5963 struct rx_packet *nxp; /* Next pointer for queue_Scan */
5964 int nXmitPackets;
5965 int maxXmitPackets;
5966
5967 if (call->error) {
5968#ifdef AFS_GLOBAL_RXLOCK_KERNEL
5969 if (rx_stats_active)
5970 rx_atomic_inc(&rx_tq_debug.rxi_start_in_error);
5971#endif
5972 return;
5973 }
5974
5975 if (queue_IsNotEmpty(&call->tq)(((struct rx_queue *)(&call->tq))->next != ((struct
rx_queue *)(&call->tq)))) { /* If we have anything to send */
5976
5977 /* Send (or resend) any packets that need it, subject to
5978 * window restrictions and congestion burst control
5979 * restrictions. Ask for an ack on the last packet sent in
5980 * this burst. For now, we're relying upon the window being
5981 * considerably bigger than the largest number of packets that
5982 * are typically sent at once by one initial call to
5983 * rxi_Start. This is probably bogus (perhaps we should ask
5984 * for an ack when we're half way through the current
5985 * window?). Also, for non file transfer applications, this
5986 * may end up asking for an ack for every packet. Bogus. XXXX
5987 */
5988 /*
5989 * But check whether we're here recursively, and let the other guy
5990 * do the work.
5991 */
5992#ifdef AFS_GLOBAL_RXLOCK_KERNEL
5993 if (!(call->flags & RX_CALL_TQ_BUSY128)) {
5994 call->flags |= RX_CALL_TQ_BUSY128;
5995 do {
5996#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5997 restart:
5998#ifdef AFS_GLOBAL_RXLOCK_KERNEL
5999 call->flags &= ~RX_CALL_NEED_START0x10000;
6000#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
6001 nXmitPackets = 0;
6002 maxXmitPackets = MIN(call->twind, call->cwind)(((call->twind)<(call->cwind))?(call->twind):(call
->cwind));
6003 for (queue_Scan(&call->tq, p, nxp, rx_packet)(p) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(p))->next); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(p))); (p) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(p))->next)) {
6004#ifdef RX_TRACK_PACKETS
6005 if ((p->flags & RX_PKTFLAG_FREE)
6006 || (!queue_IsEnd(&call->tq, nxp)(((struct rx_queue *)(&call->tq)) == ((struct rx_queue
*)(nxp)))
6007 && (nxp->flags & RX_PKTFLAG_FREE))
6008 || (p == (struct rx_packet *)&rx_freePacketQueue)
6009 || (nxp == (struct rx_packet *)&rx_freePacketQueue)) {
6010 osi_Panic("rxi_Start: xmit queue clobbered");
6011 }
6012#endif
6013 if (p->flags & RX_PKTFLAG_ACKED0x01) {
6014 /* Since we may block, don't trust this */
6015 if (rx_stats_active)
6016 rx_atomic_inc(&rx_stats.ignoreAckedPacket);
6017 continue; /* Ignore this packet if it has been acknowledged */
6018 }
6019
6020 /* Turn off all flags except these ones, which are the same
6021 * on each transmission */
6022 p->header.flags &= RX_PRESET_FLAGS(1 | 4);
6023
6024 if (p->header.seq >=
6025 call->tfirst + MIN((int)call->twind,((((int)call->twind)<((int)(call->nSoftAcked + call->
cwind)))?((int)call->twind):((int)(call->nSoftAcked + call
->cwind)))
6026 (int)(call->nSoftAcked +((((int)call->twind)<((int)(call->nSoftAcked + call->
cwind)))?((int)call->twind):((int)(call->nSoftAcked + call
->cwind)))
6027 call->cwind))((((int)call->twind)<((int)(call->nSoftAcked + call->
cwind)))?((int)call->twind):((int)(call->nSoftAcked + call
->cwind)))) {
6028 call->flags |= RX_CALL_WAIT_WINDOW_SEND4; /* Wait for transmit window */
6029 /* Note: if we're waiting for more window space, we can
6030 * still send retransmits; hence we don't return here, but
6031 * break out to schedule a retransmit event */
6032 dpf(("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n",do { if (rx_debugFile) rxi_DebugPrint ("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n"
, *(call->callNumber), p->header.seq, call->twind, call
->nSoftAcked, call->cwind); } while (0)
6033 *(call->callNumber), p->header.seq, call->twind, call->nSoftAcked,do { if (rx_debugFile) rxi_DebugPrint ("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n"
, *(call->callNumber), p->header.seq, call->twind, call
->nSoftAcked, call->cwind); } while (0)
6034 call->cwind))do { if (rx_debugFile) rxi_DebugPrint ("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n"
, *(call->callNumber), p->header.seq, call->twind, call
->nSoftAcked, call->cwind); } while (0);
6035 break;
6036 }
6037
6038 /* Transmit the packet if it needs to be sent. */
6039 if (!(p->flags & RX_PKTFLAG_SENT0x40)) {
6040 if (nXmitPackets == maxXmitPackets) {
6041 rxi_SendXmitList(call, call->xmitList,
6042 nXmitPackets, istack);
6043 goto restart;
6044 }
6045 dpf(("call %d xmit packet %"AFS_PTR_FMT"\n",do { if (rx_debugFile) rxi_DebugPrint ("call %d xmit packet %"
"p""\n", *(call->callNumber), p); } while (0)
6046 *(call->callNumber), p))do { if (rx_debugFile) rxi_DebugPrint ("call %d xmit packet %"
"p""\n", *(call->callNumber), p); } while (0);
6047 call->xmitList[nXmitPackets++] = p;
6048 }
6049 }
6050
6051 /* xmitList now hold pointers to all of the packets that are
6052 * ready to send. Now we loop to send the packets */
6053 if (nXmitPackets > 0) {
6054 rxi_SendXmitList(call, call->xmitList, nXmitPackets,
6055 istack);
6056 }
6057
6058#ifdef AFS_GLOBAL_RXLOCK_KERNEL
6059 if (call->error) {
6060 /* We went into the error state while sending packets. Now is
6061 * the time to reset the call. This will also inform the using
6062 * process that the call is in an error state.
6063 */
6064 if (rx_stats_active)
6065 rx_atomic_inc(&rx_tq_debug.rxi_start_aborted);
6066 call->flags &= ~RX_CALL_TQ_BUSY128;
6067 rxi_WakeUpTransmitQueue(call);
6068 rxi_CallError(call, call->error);
6069 return;
6070 }
6071#ifdef RX_ENABLE_LOCKS
6072 if (call->flags & RX_CALL_TQ_SOME_ACKED512) {
6073 int missing;
6074 call->flags &= ~RX_CALL_TQ_SOME_ACKED512;
6075 /* Some packets have received acks. If they all have, we can clear
6076 * the transmit queue.
6077 */
6078 for (missing =
6079 0, queue_Scan(&call->tq, p, nxp, rx_packet)(p) = ((struct rx_packet *)((struct rx_queue *)(&call->
tq))->next), nxp = ((struct rx_packet *)((struct rx_queue *
)(p))->next); !(((struct rx_queue *)(&call->tq)) ==
((struct rx_queue *)(p))); (p) = (nxp), nxp = ((struct rx_packet
*)((struct rx_queue *)(p))->next)) {
6080 if (p->header.seq < call->tfirst
6081 && (p->flags & RX_PKTFLAG_ACKED0x01)) {
6082 queue_Remove(p)(((((struct rx_queue *)(p))->prev->next=((struct rx_queue
*)(p))->next)->prev=((struct rx_queue *)(p))->prev)
, ((struct rx_queue *)(p))->next = 0);
6083#ifdef RX_TRACK_PACKETS
6084 p->flags &= ~RX_PKTFLAG_TQ;
6085#endif
6086#ifdef RXDEBUG_PACKET
6087 call->tqc--;
6088#endif
6089 rxi_FreePacket(p);
6090 } else
6091 missing = 1;
6092 }
6093 if (!missing)
6094 call->flags |= RX_CALL_TQ_CLEARME256;
6095 }
6096#endif /* RX_ENABLE_LOCKS */
6097 if (call->flags & RX_CALL_TQ_CLEARME256)
6098 rxi_ClearTransmitQueue(call, 1);
6099 } while (call->flags & RX_CALL_NEED_START0x10000);
6100 /*
6101 * TQ references no longer protected by this flag; they must remain
6102 * protected by the global lock.
6103 */
6104 call->flags &= ~RX_CALL_TQ_BUSY128;
6105 rxi_WakeUpTransmitQueue(call);
6106 } else {
6107 call->flags |= RX_CALL_NEED_START0x10000;
6108 }
6109#endif /* AFS_GLOBAL_RXLOCK_KERNEL */
6110 } else {
6111 rxi_rto_cancel(call);
6112 }
6113}
6114
6115/* Also adjusts the keep alive parameters for the call, to reflect
6116 * that we have just sent a packet (so keep alives aren't sent
6117 * immediately) */
6118void
6119rxi_Send(struct rx_call *call, struct rx_packet *p,
6120 int istack)
6121{
6122 struct rx_connection *conn = call->conn;
6123
6124 /* Stamp each packet with the user supplied status */
6125 p->header.userStatus = call->localStatus;
6126
6127 /* Allow the security object controlling this call's security to
6128 * make any last-minute changes to the packet */
6129 RXS_SendPacket(conn->securityObject, call, p)((conn->securityObject && (conn->securityObject
->ops->op_SendPacket)) ? (*(conn->securityObject)->
ops->op_SendPacket)(conn->securityObject,call,p) : 0);
6130
6131 /* Since we're about to send SOME sort of packet to the peer, it's
6132 * safe to nuke any scheduled end-of-packets ack */
6133 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
6134
6135 /* Actually send the packet, filling in more connection-specific fields */
6136 MUTEX_EXIT(&call->lock);
6137 MUTEX_ENTER(&rx_refcnt_mutex);
6138 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
6139 MUTEX_EXIT(&rx_refcnt_mutex);
6140 rxi_SendPacket(call, conn, p, istack);
6141 MUTEX_ENTER(&rx_refcnt_mutex);
6142 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
6143 MUTEX_EXIT(&rx_refcnt_mutex);
6144 MUTEX_ENTER(&call->lock);
6145
6146 /* Update last send time for this call (for keep-alive
6147 * processing), and for the connection (so that we can discover
6148 * idle connections) */
6149 if ((p->header.type != RX_PACKET_TYPE_ACK2) ||
6150 (((struct rx_ackPacket *)rx_DataOf(p)((char *) (p)->wirevec[1].iov_base))->reason == RX_ACK_PING6) ||
6151 (p->length <= (rx_AckDataSize(call->rwind)(3 + call->rwind + __builtin_offsetof(struct rx_ackPacket,
acks[0])) + 4 * sizeof(afs_int32))))
6152 {
6153 conn->lastSendTime = call->lastSendTime = clock_Sec()(time(((void *)0)));
6154 /* Don't count keepalive ping/acks here, so idleness can be tracked. */
6155 if ((p->header.type != RX_PACKET_TYPE_ACK2) ||
6156 ((((struct rx_ackPacket *)rx_DataOf(p)((char *) (p)->wirevec[1].iov_base))->reason != RX_ACK_PING6) &&
6157 (((struct rx_ackPacket *)rx_DataOf(p)((char *) (p)->wirevec[1].iov_base))->reason !=
6158 RX_ACK_PING_RESPONSE7)))
6159 call->lastSendData = call->lastSendTime;
6160 }
6161}
6162
6163/* Check if a call needs to be destroyed. Called by keep-alive code to ensure
6164 * that things are fine. Also called periodically to guarantee that nothing
6165 * falls through the cracks (e.g. (error + dally) connections have keepalive
6166 * turned off. Returns 0 if conn is well, -1 otherwise. If otherwise, call
6167 * may be freed!
6168 * haveCTLock Set if calling from rxi_ReapConnections
6169 */
6170#ifdef RX_ENABLE_LOCKS
6171int
6172rxi_CheckCall(struct rx_call *call, int haveCTLock)
6173#else /* RX_ENABLE_LOCKS */
6174int
6175rxi_CheckCall(struct rx_call *call)
6176#endif /* RX_ENABLE_LOCKS */
6177{
6178 struct rx_connection *conn = call->conn;
6179 afs_uint32 now;
6180 afs_uint32 deadTime, idleDeadTime = 0, hardDeadTime = 0;
6181 afs_uint32 fudgeFactor;
6182 int cerror = 0;
6183 int newmtu = 0;
6184
6185#ifdef AFS_GLOBAL_RXLOCK_KERNEL
6186 if (call->flags & RX_CALL_TQ_BUSY128) {
6187 /* Call is active and will be reset by rxi_Start if it's
6188 * in an error state.
6189 */
6190 return 0;
6191 }
6192#endif
6193 /* RTT + 8*MDEV, rounded up to the next second. */
6194 fudgeFactor = (((afs_uint32) call->rtt >> 3) +
6195 ((afs_uint32) call->rtt_dev << 1) + 1023) >> 10;
6196
6197 deadTime = conn->secondsUntilDead + fudgeFactor;
6198 now = clock_Sec()(time(((void *)0)));
6199 /* These are computed to the second (+- 1 second). But that's
6200 * good enough for these values, which should be a significant
6201 * number of seconds. */
6202 if (now > (call->lastReceiveTime + deadTime)) {
6203 if (call->state == RX_STATE_ACTIVE2) {
6204#ifdef ADAPT_PMTU
6205#if defined(KERNEL) && defined(AFS_SUN5_ENV)
6206 ire_t *ire;
6207#if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
6208 netstack_t *ns = netstack_find_by_stackid(GLOBAL_NETSTACKID);
6209 ip_stack_t *ipst = ns->netstack_ip;
6210#endif
6211 ire = ire_cache_lookup(conn->peer->host
6212#if defined(AFS_SUN510_ENV) && defined(ALL_ZONES)
6213 , ALL_ZONES
6214#if defined(AFS_SUN510_ENV) && (defined(ICL_3_ARG) || defined(GLOBAL_NETSTACKID))
6215 , NULL((void *)0)
6216#if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
6217 , ipst
6218#endif
6219#endif
6220#endif
6221 );
6222
6223 if (ire && ire->ire_max_frag > 0)
6224 rxi_SetPeerMtu(NULL((void *)0), conn->peer->host, 0,
6225 ire->ire_max_frag);
6226#if defined(GLOBAL_NETSTACKID)
6227 netstack_rele(ns);
6228#endif
6229#endif
6230#endif /* ADAPT_PMTU */
6231 cerror = RX_CALL_DEAD(-1);
6232 goto mtuout;
6233 } else {
6234#ifdef RX_ENABLE_LOCKS
6235 /* Cancel pending events */
6236 rxevent_Cancel(call->delayedAckEvent, call,do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0)
6237 RX_CALL_REFCOUNT_DELAY)do { if (call->delayedAckEvent) { rxevent_Cancel_1(call->
delayedAckEvent, ((void *)0), 0); call->delayedAckEvent = (
(void *)0); } } while(0);
6238 rxi_rto_cancel(call);
6239 rxevent_Cancel(call->keepAliveEvent, call,do { if (call->keepAliveEvent) { rxevent_Cancel_1(call->
keepAliveEvent, ((void *)0), 0); call->keepAliveEvent = ((
void *)0); } } while(0)
6240 RX_CALL_REFCOUNT_ALIVE)do { if (call->keepAliveEvent) { rxevent_Cancel_1(call->
keepAliveEvent, ((void *)0), 0); call->keepAliveEvent = ((
void *)0); } } while(0);
6241 if (call->growMTUEvent)
6242 rxevent_Cancel(call->growMTUEvent, call,do { if (call->growMTUEvent) { rxevent_Cancel_1(call->growMTUEvent
, ((void *)0), 0); call->growMTUEvent = ((void *)0); } } while
(0)
6243 RX_CALL_REFCOUNT_ALIVE)do { if (call->growMTUEvent) { rxevent_Cancel_1(call->growMTUEvent
, ((void *)0), 0); call->growMTUEvent = ((void *)0); } } while
(0);
6244 MUTEX_ENTER(&rx_refcnt_mutex);
6245 if (call->refCount == 0) {
6246 rxi_FreeCall(call, haveCTLock);
6247 MUTEX_EXIT(&rx_refcnt_mutex);
6248 return -2;
6249 }
6250 MUTEX_EXIT(&rx_refcnt_mutex);
6251 return -1;
6252#else /* RX_ENABLE_LOCKS */
6253 rxi_FreeCall(call, 0);
6254 return -2;
6255#endif /* RX_ENABLE_LOCKS */
6256 }
6257 /* Non-active calls are destroyed if they are not responding
6258 * to pings; active calls are simply flagged in error, so the
6259 * attached process can die reasonably gracefully. */
6260 }
6261
6262 if (conn->idleDeadTime) {
6263 idleDeadTime = conn->idleDeadTime + fudgeFactor;
6264 }
6265
6266 /* see if we have a non-activity timeout */
6267 if (call->startWait && idleDeadTime
6268 && ((call->startWait + idleDeadTime) < now) &&
6269 (call->flags & RX_CALL_READER_WAIT1)) {
6270 if (call->state == RX_STATE_ACTIVE2) {
6271 cerror = RX_CALL_TIMEOUT(-3);
6272 goto mtuout;
6273 }
6274 }
6275 if (call->lastSendData && idleDeadTime && (conn->idleDeadErr != 0)
6276 && ((call->lastSendData + idleDeadTime) < now)) {
6277 if (call->state == RX_STATE_ACTIVE2) {
6278 cerror = conn->idleDeadErr;
6279 goto mtuout;
6280 }
6281 }
6282
6283 if (conn->hardDeadTime) {
6284 hardDeadTime = conn->hardDeadTime + fudgeFactor;
6285 }
6286
6287 /* see if we have a hard timeout */
6288 if (hardDeadTime
6289 && (now > (hardDeadTime + call->startTime.sec))) {
6290 if (call->state == RX_STATE_ACTIVE2)
6291 rxi_CallError(call, RX_CALL_TIMEOUT(-3));
6292 return -1;
6293 }
6294 return 0;
6295mtuout:
6296 if (conn->msgsizeRetryErr && cerror != RX_CALL_TIMEOUT(-3)
6297 && call->lastReceiveTime) {
6298 int oldMTU = conn->peer->ifMTU;
6299
6300 /* if we thought we could send more, perhaps things got worse */
6301 if (conn->peer->maxPacketSize > conn->lastPacketSize)
6302 /* maxpacketsize will be cleared in rxi_SetPeerMtu */
6303 newmtu = MAX(conn->peer->maxPacketSize-RX_IPUDP_SIZE,(((conn->peer->maxPacketSize-RX_IPUDP_SIZE)>(conn->
lastPacketSize-(128 +RX_IPUDP_SIZE)))?(conn->peer->maxPacketSize
-RX_IPUDP_SIZE):(conn->lastPacketSize-(128 +RX_IPUDP_SIZE)
))
6304 conn->lastPacketSize-(128+RX_IPUDP_SIZE))(((conn->peer->maxPacketSize-RX_IPUDP_SIZE)>(conn->
lastPacketSize-(128 +RX_IPUDP_SIZE)))?(conn->peer->maxPacketSize
-RX_IPUDP_SIZE):(conn->lastPacketSize-(128 +RX_IPUDP_SIZE)
));
6305 else
6306 newmtu = conn->lastPacketSize-(128+RX_IPUDP_SIZE);
6307
6308 /* minimum capped in SetPeerMtu */
6309 rxi_SetPeerMtu(conn->peer, 0, 0, newmtu);
6310
6311 /* clean up */
6312 conn->lastPacketSize = 0;
6313
6314 /* needed so ResetCall doesn't clobber us. */
6315 call->MTU = conn->peer->ifMTU;
6316
6317 /* if we never succeeded, let the error pass out as-is */
6318 if (conn->peer->maxPacketSize && oldMTU != conn->peer->ifMTU)
6319 cerror = conn->msgsizeRetryErr;
6320
6321 }
6322 rxi_CallError(call, cerror);
6323 return -1;
6324}
6325
6326void
6327rxi_NatKeepAliveEvent(struct rxevent *event, void *arg1, void *dummy)
6328{
6329 struct rx_connection *conn = arg1;
6330 struct rx_header theader;
6331 char tbuffer[1 + sizeof(struct rx_header)];
6332 struct sockaddr_in taddr;
6333 char *tp;
6334 char a[1] = { 0 };
6335 struct iovec tmpiov[2];
6336 osi_socket socket =
6337 (conn->type ==
6338 RX_CLIENT_CONNECTION0 ? rx_socket : conn->service->socket);
6339
6340
6341 tp = &tbuffer[sizeof(struct rx_header)];
6342 taddr.sin_family = AF_INET2;
6343 taddr.sin_port = rx_PortOf(rx_PeerOf(conn))((((conn)->peer))->port);
6344 taddr.sin_addr.s_addr = rx_HostOf(rx_PeerOf(conn))((((conn)->peer))->host);
6345#ifdef STRUCT_SOCKADDR_HAS_SA_LEN1
6346 taddr.sin_len = sizeof(struct sockaddr_in);
6347#endif
6348 memset(&theader, 0, sizeof(theader));
6349 theader.epoch = htonl(999)(__builtin_constant_p(999) ? ((((__uint32_t)(999)) >> 24
) | ((((__uint32_t)(999)) & (0xff << 16)) >> 8
) | ((((__uint32_t)(999)) & (0xff << 8)) << 8
) | (((__uint32_t)(999)) << 24)) : __bswap32_var(999));
6350 theader.cid = 0;
6351 theader.callNumber = 0;
6352 theader.seq = 0;
6353 theader.serial = 0;
6354 theader.type = RX_PACKET_TYPE_VERSION13;
6355 theader.flags = RX_LAST_PACKET4;
6356 theader.serviceId = 0;
6357
6358 memcpy(tbuffer, &theader, sizeof(theader));
6359 memcpy(tp, &a, sizeof(a));
6360 tmpiov[0].iov_base = tbuffer;
6361 tmpiov[0].iov_len = 1 + sizeof(struct rx_header);
6362
6363 osi_NetSend(socket, &taddr, tmpiov, 1, 1 + sizeof(struct rx_header), 1);
6364
6365 MUTEX_ENTER(&conn->conn_data_lock);
6366 MUTEX_ENTER(&rx_refcnt_mutex);
6367 /* Only reschedule ourselves if the connection would not be destroyed */
6368 if (conn->refCount <= 1) {
6369 conn->natKeepAliveEvent = NULL((void *)0);
6370 MUTEX_EXIT(&rx_refcnt_mutex);
6371 MUTEX_EXIT(&conn->conn_data_lock);
6372 rx_DestroyConnection(conn); /* drop the reference for this */
6373 } else {
6374 conn->refCount--; /* drop the reference for this */
6375 MUTEX_EXIT(&rx_refcnt_mutex);
6376 conn->natKeepAliveEvent = NULL((void *)0);
6377 rxi_ScheduleNatKeepAliveEvent(conn);
6378 MUTEX_EXIT(&conn->conn_data_lock);
6379 }
6380}
6381
6382void
6383rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn)
6384{
6385 if (!conn->natKeepAliveEvent && conn->secondsUntilNatPing) {
6386 struct clock when, now;
6387 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
6388 when = now;
6389 when.sec += conn->secondsUntilNatPing;
6390 MUTEX_ENTER(&rx_refcnt_mutex);
6391 conn->refCount++; /* hold a reference for this */
6392 MUTEX_EXIT(&rx_refcnt_mutex);
6393 conn->natKeepAliveEvent =
6394 rxevent_PostNow(&when, &now, rxi_NatKeepAliveEvent, conn, 0);
6395 }
6396}
6397
6398void
6399rx_SetConnSecondsUntilNatPing(struct rx_connection *conn, afs_int32 seconds)
6400{
6401 MUTEX_ENTER(&conn->conn_data_lock);
6402 conn->secondsUntilNatPing = seconds;
6403 if (seconds != 0)
6404 rxi_ScheduleNatKeepAliveEvent(conn);
6405 MUTEX_EXIT(&conn->conn_data_lock);
6406}
6407
6408void
6409rxi_NatKeepAliveOn(struct rx_connection *conn)
6410{
6411 MUTEX_ENTER(&conn->conn_data_lock);
6412 rxi_ScheduleNatKeepAliveEvent(conn);
6413 MUTEX_EXIT(&conn->conn_data_lock);
6414}
6415
6416/* When a call is in progress, this routine is called occasionally to
6417 * make sure that some traffic has arrived (or been sent to) the peer.
6418 * If nothing has arrived in a reasonable amount of time, the call is
6419 * declared dead; if nothing has been sent for a while, we send a
6420 * keep-alive packet (if we're actually trying to keep the call alive)
6421 */
6422void
6423rxi_KeepAliveEvent(struct rxevent *event, void *arg1, void *dummy)
6424{
6425 struct rx_call *call = arg1;
6426 struct rx_connection *conn;
6427 afs_uint32 now;
6428
6429 MUTEX_ENTER(&rx_refcnt_mutex);
6430 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6431 MUTEX_EXIT(&rx_refcnt_mutex);
6432 MUTEX_ENTER(&call->lock);
6433 if (event == call->keepAliveEvent)
6434 call->keepAliveEvent = NULL((void *)0);
6435 now = clock_Sec()(time(((void *)0)));
6436
6437#ifdef RX_ENABLE_LOCKS
6438 if (rxi_CheckCall(call, 0)) {
6439 MUTEX_EXIT(&call->lock);
6440 return;
6441 }
6442#else /* RX_ENABLE_LOCKS */
6443 if (rxi_CheckCall(call))
6444 return;
6445#endif /* RX_ENABLE_LOCKS */
6446
6447 /* Don't try to keep alive dallying calls */
6448 if (call->state == RX_STATE_DALLY3) {
6449 MUTEX_EXIT(&call->lock);
6450 return;
6451 }
6452
6453 conn = call->conn;
6454 if ((now - call->lastSendTime) > conn->secondsUntilPing) {
6455 /* Don't try to send keepalives if there is unacknowledged data */
6456 /* the rexmit code should be good enough, this little hack
6457 * doesn't quite work XXX */
6458 (void)rxi_SendAck(call, NULL((void *)0), 0, RX_ACK_PING6, 0);
6459 }
6460 rxi_ScheduleKeepAliveEvent(call);
6461 MUTEX_EXIT(&call->lock);
6462}
6463
6464/* Does what's on the nameplate. */
6465void
6466rxi_GrowMTUEvent(struct rxevent *event, void *arg1, void *dummy)
6467{
6468 struct rx_call *call = arg1;
6469 struct rx_connection *conn;
6470
6471 MUTEX_ENTER(&rx_refcnt_mutex);
6472 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6473 MUTEX_EXIT(&rx_refcnt_mutex);
6474 MUTEX_ENTER(&call->lock);
6475
6476 if (event == call->growMTUEvent)
6477 call->growMTUEvent = NULL((void *)0);
6478
6479#ifdef RX_ENABLE_LOCKS
6480 if (rxi_CheckCall(call, 0)) {
6481 MUTEX_EXIT(&call->lock);
6482 return;
6483 }
6484#else /* RX_ENABLE_LOCKS */
6485 if (rxi_CheckCall(call))
6486 return;
6487#endif /* RX_ENABLE_LOCKS */
6488
6489 /* Don't bother with dallying calls */
6490 if (call->state == RX_STATE_DALLY3) {
6491 MUTEX_EXIT(&call->lock);
6492 return;
6493 }
6494
6495 conn = call->conn;
6496
6497 /*
6498 * keep being scheduled, just don't do anything if we're at peak,
6499 * or we're not set up to be properly handled (idle timeout required)
6500 */
6501 if ((conn->peer->maxPacketSize != 0) &&
6502 (conn->peer->natMTU < RX_MAX_PACKET_SIZE16384) &&
6503 (conn->idleDeadErr))
6504 (void)rxi_SendAck(call, NULL((void *)0), 0, RX_ACK_MTU-1, 0);
6505 rxi_ScheduleGrowMTUEvent(call, 0);
6506 MUTEX_EXIT(&call->lock);
6507}
6508
6509void
6510rxi_ScheduleKeepAliveEvent(struct rx_call *call)
6511{
6512 if (!call->keepAliveEvent) {
6513 struct clock when, now;
6514 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
6515 when = now;
6516 when.sec += call->conn->secondsUntilPing;
6517 MUTEX_ENTER(&rx_refcnt_mutex);
6518 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6519 MUTEX_EXIT(&rx_refcnt_mutex);
6520 call->keepAliveEvent =
6521 rxevent_PostNow(&when, &now, rxi_KeepAliveEvent, call, 0);
6522 }
6523}
6524
6525void
6526rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs)
6527{
6528 if (!call->growMTUEvent) {
6529 struct clock when, now;
6530
6531 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
6532 when = now;
6533 if (!secs) {
6534 if (call->conn->secondsUntilPing)
6535 secs = (6*call->conn->secondsUntilPing)-1;
6536
6537 if (call->conn->secondsUntilDead)
6538 secs = MIN(secs, (call->conn->secondsUntilDead-1))(((secs)<((call->conn->secondsUntilDead-1)))?(secs):
((call->conn->secondsUntilDead-1)));
6539 }
6540
6541 when.sec += secs;
6542 MUTEX_ENTER(&rx_refcnt_mutex);
6543 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6544 MUTEX_EXIT(&rx_refcnt_mutex);
6545 call->growMTUEvent =
6546 rxevent_PostNow(&when, &now, rxi_GrowMTUEvent, call, 0);
6547 }
6548}
6549
6550/* N.B. rxi_KeepAliveOff: is defined earlier as a macro */
6551void
6552rxi_KeepAliveOn(struct rx_call *call)
6553{
6554 /* Pretend last packet received was received now--i.e. if another
6555 * packet isn't received within the keep alive time, then the call
6556 * will die; Initialize last send time to the current time--even
6557 * if a packet hasn't been sent yet. This will guarantee that a
6558 * keep-alive is sent within the ping time */
6559 call->lastReceiveTime = call->lastSendTime = clock_Sec()(time(((void *)0)));
6560 rxi_ScheduleKeepAliveEvent(call);
6561}
6562
6563void
6564rxi_GrowMTUOn(struct rx_call *call)
6565{
6566 struct rx_connection *conn = call->conn;
6567 MUTEX_ENTER(&conn->conn_data_lock);
6568 conn->lastPingSizeSer = conn->lastPingSize = 0;
6569 MUTEX_EXIT(&conn->conn_data_lock);
6570 rxi_ScheduleGrowMTUEvent(call, 1);
6571}
6572
6573/* This routine is called to send connection abort messages
6574 * that have been delayed to throttle looping clients. */
6575void
6576rxi_SendDelayedConnAbort(struct rxevent *event,
6577 void *arg1, void *unused)
6578{
6579 struct rx_connection *conn = arg1;
6580
6581 afs_int32 error;
6582 struct rx_packet *packet;
6583
6584 MUTEX_ENTER(&conn->conn_data_lock);
6585 conn->delayedAbortEvent = NULL((void *)0);
6586 error = htonl(conn->error)(__builtin_constant_p(conn->error) ? ((((__uint32_t)(conn->
error)) >> 24) | ((((__uint32_t)(conn->error)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(conn->error
)) & (0xff << 8)) << 8) | (((__uint32_t)(conn
->error)) << 24)) : __bswap32_var(conn->error));
6587 conn->abortCount++;
6588 MUTEX_EXIT(&conn->conn_data_lock);
6589 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2);
6590 if (packet) {
6591 packet =
6592 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6593 RX_PACKET_TYPE_ABORT4, (char *)&error,
6594 sizeof(error), 0);
6595 rxi_FreePacket(packet);
6596 }
6597}
6598
6599/* This routine is called to send call abort messages
6600 * that have been delayed to throttle looping clients. */
6601void
6602rxi_SendDelayedCallAbort(struct rxevent *event,
6603 void *arg1, void *dummy)
6604{
6605 struct rx_call *call = arg1;
6606
6607 afs_int32 error;
6608 struct rx_packet *packet;
6609
6610 MUTEX_ENTER(&call->lock);
6611 call->delayedAbortEvent = NULL((void *)0);
6612 error = htonl(call->error)(__builtin_constant_p(call->error) ? ((((__uint32_t)(call->
error)) >> 24) | ((((__uint32_t)(call->error)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(call->error
)) & (0xff << 8)) << 8) | (((__uint32_t)(call
->error)) << 24)) : __bswap32_var(call->error));
6613 call->abortCount++;
6614 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2);
6615 if (packet) {
6616 packet =
6617 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT4,
6618 (char *)&error, sizeof(error), 0);
6619 rxi_FreePacket(packet);
6620 }
6621 MUTEX_EXIT(&call->lock);
6622 MUTEX_ENTER(&rx_refcnt_mutex);
6623 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
6624 MUTEX_EXIT(&rx_refcnt_mutex);
6625}
6626
6627/* This routine is called periodically (every RX_AUTH_REQUEST_TIMEOUT
6628 * seconds) to ask the client to authenticate itself. The routine
6629 * issues a challenge to the client, which is obtained from the
6630 * security object associated with the connection */
6631void
6632rxi_ChallengeEvent(struct rxevent *event,
6633 void *arg0, void *arg1, int tries)
6634{
6635 struct rx_connection *conn = arg0;
6636
6637 conn->challengeEvent = NULL((void *)0);
6638 if (RXS_CheckAuthentication(conn->securityObject, conn)((conn->securityObject && (conn->securityObject
->ops->op_CheckAuthentication)) ? (*(conn->securityObject
)->ops->op_CheckAuthentication)(conn->securityObject
,conn) : 0) != 0) {
6639 struct rx_packet *packet;
6640 struct clock when, now;
6641
6642 if (tries <= 0) {
6643 /* We've failed to authenticate for too long.
6644 * Reset any calls waiting for authentication;
6645 * they are all in RX_STATE_PRECALL.
6646 */
6647 int i;
6648
6649 MUTEX_ENTER(&conn->conn_call_lock);
6650 for (i = 0; i < RX_MAXCALLS4; i++) {
6651 struct rx_call *call = conn->call[i];
6652 if (call) {
6653 MUTEX_ENTER(&call->lock);
6654 if (call->state == RX_STATE_PRECALL1) {
6655 rxi_CallError(call, RX_CALL_DEAD(-1));
6656 rxi_SendCallAbort(call, NULL((void *)0), 0, 0);
6657 }
6658 MUTEX_EXIT(&call->lock);
6659 }
6660 }
6661 MUTEX_EXIT(&conn->conn_call_lock);
6662 return;
6663 }
6664
6665 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL2);
6666 if (packet) {
6667 /* If there's no packet available, do this later. */
6668 RXS_GetChallenge(conn->securityObject, conn, packet)((conn->securityObject && (conn->securityObject
->ops->op_GetChallenge)) ? (*(conn->securityObject)->
ops->op_GetChallenge)(conn->securityObject,conn,packet)
: 0);
6669 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6670 RX_PACKET_TYPE_CHALLENGE6, NULL((void *)0), -1, 0);
6671 rxi_FreePacket(packet);
6672 }
6673 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
6674 when = now;
6675 when.sec += RX_CHALLENGE_TIMEOUT2;
6676 conn->challengeEvent =
6677 rxevent_PostNow2(&when, &now, rxi_ChallengeEvent, conn, 0,
6678 (tries - 1));
6679 }
6680}
6681
6682/* Call this routine to start requesting the client to authenticate
6683 * itself. This will continue until authentication is established,
6684 * the call times out, or an invalid response is returned. The
6685 * security object associated with the connection is asked to create
6686 * the challenge at this time. N.B. rxi_ChallengeOff is a macro,
6687 * defined earlier. */
6688void
6689rxi_ChallengeOn(struct rx_connection *conn)
6690{
6691 if (!conn->challengeEvent) {
6692 RXS_CreateChallenge(conn->securityObject, conn)((conn->securityObject && (conn->securityObject
->ops->op_CreateChallenge)) ? (*(conn->securityObject
)->ops->op_CreateChallenge)(conn->securityObject,conn
) : 0);
6693 rxi_ChallengeEvent(NULL((void *)0), conn, 0, RX_CHALLENGE_MAXTRIES50);
6694 };
6695}
6696
6697
6698/* rxi_ComputeRoundTripTime is called with peer locked. */
6699/* peer may be null */
6700static void
6701rxi_ComputeRoundTripTime(struct rx_packet *p,
6702 struct rx_ackPacket *ack,
6703 struct rx_call *call,
6704 struct rx_peer *peer,
6705 struct clock *now)
6706{
6707 struct clock thisRtt, *sentp;
6708 int rtt_timeout;
6709 int serial;
6710
6711 /* If the ACK is delayed, then do nothing */
6712 if (ack->reason == RX_ACK_DELAY8)
6713 return;
6714
6715 /* On the wire, jumbograms are a single UDP packet. We shouldn't count
6716 * their RTT multiple times, so only include the RTT of the last packet
6717 * in a jumbogram */
6718 if (p->flags & RX_JUMBO_PACKET32)
6719 return;
6720
6721 /* Use the serial number to determine which transmission the ACK is for,
6722 * and set the sent time to match this. If we have no serial number, then
6723 * only use the ACK for RTT calculations if the packet has not been
6724 * retransmitted
6725 */
6726
6727 serial = ntohl(ack->serial)(__builtin_constant_p(ack->serial) ? ((((__uint32_t)(ack->
serial)) >> 24) | ((((__uint32_t)(ack->serial)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(ack->serial
)) & (0xff << 8)) << 8) | (((__uint32_t)(ack->
serial)) << 24)) : __bswap32_var(ack->serial));
6728 if (serial) {
6729 if (serial == p->header.serial) {
6730 sentp = &p->timeSent;
6731 } else if (serial == p->firstSerial) {
6732 sentp = &p->firstSent;
6733 } else if (clock_Eq(&p->timeSent, &p->firstSent)((&p->timeSent)->sec==(&p->firstSent)->sec
&& (&p->timeSent)->usec==(&p->firstSent
)->usec)) {
6734 sentp = &p->firstSent;
6735 } else
6736 return;
6737 } else {
6738 if (clock_Eq(&p->timeSent, &p->firstSent)((&p->timeSent)->sec==(&p->firstSent)->sec
&& (&p->timeSent)->usec==(&p->firstSent
)->usec)) {
6739 sentp = &p->firstSent;
6740 } else
6741 return;
6742 }
6743
6744 thisRtt = *now;
6745
6746 if (clock_Lt(&thisRtt, sentp)((&thisRtt)->sec<(sentp)->sec || ((&thisRtt)
->sec==(sentp)->sec && (&thisRtt)->usec<
(sentp)->usec)))
6747 return; /* somebody set the clock back, don't count this time. */
6748
6749 clock_Sub(&thisRtt, sentp)do { if (((&thisRtt)->usec -= (sentp)->usec) < 0
) { (&thisRtt)->usec += 1000000; (&thisRtt)->sec
--; } (&thisRtt)->sec -= (sentp)->sec; } while(0);
6750 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rttp=%d.%06d sec)\n",do { if (rx_debugFile) rxi_DebugPrint ("rxi_ComputeRoundTripTime(call=%d packet=%"
"p"" rttp=%d.%06d sec)\n", p->header.callNumber, p, thisRtt
.sec, thisRtt.usec); } while (0)
6751 p->header.callNumber, p, thisRtt.sec, thisRtt.usec))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ComputeRoundTripTime(call=%d packet=%"
"p"" rttp=%d.%06d sec)\n", p->header.callNumber, p, thisRtt
.sec, thisRtt.usec); } while (0);
6752
6753 if (clock_IsZero(&thisRtt)((&thisRtt)->sec == 0 && (&thisRtt)->usec
== 0)) {
6754 /*
6755 * The actual round trip time is shorter than the
6756 * clock_GetTime resolution. It is most likely 1ms or 100ns.
6757 * Since we can't tell which at the moment we will assume 1ms.
6758 */
6759 thisRtt.usec = 1000;
6760 }
6761
6762 if (rx_stats_active) {
6763 MUTEX_ENTER(&rx_stats_mutex);
6764 if (clock_Lt(&thisRtt, &rx_stats.minRtt)((&thisRtt)->sec<(&rx_stats.minRtt)->sec || (
(&thisRtt)->sec==(&rx_stats.minRtt)->sec &&
(&thisRtt)->usec<(&rx_stats.minRtt)->usec)))
6765 rx_stats.minRtt = thisRtt;
6766 if (clock_Gt(&thisRtt, &rx_stats.maxRtt)((&thisRtt)->sec>(&rx_stats.maxRtt)->sec || (
(&thisRtt)->sec==(&rx_stats.maxRtt)->sec &&
(&thisRtt)->usec>(&rx_stats.maxRtt)->usec))) {
6767 if (thisRtt.sec > 60) {
6768 MUTEX_EXIT(&rx_stats_mutex);
6769 return; /* somebody set the clock ahead */
6770 }
6771 rx_stats.maxRtt = thisRtt;
6772 }
6773 clock_Add(&rx_stats.totalRtt, &thisRtt)do { (&rx_stats.totalRtt)->sec += (&thisRtt)->sec
; if (((&rx_stats.totalRtt)->usec += (&thisRtt)->
usec) >= 1000000) { (&rx_stats.totalRtt)->usec -= 1000000
; (&rx_stats.totalRtt)->sec++; } } while(0);
6774 rx_atomic_inc(&rx_stats.nRttSamples);
6775 MUTEX_EXIT(&rx_stats_mutex);
6776 }
6777
6778 /* better rtt calculation courtesy of UMich crew (dave,larry,peter,?) */
6779
6780 /* Apply VanJacobson round-trip estimations */
6781 if (call->rtt) {
6782 int delta;
6783
6784 /*
6785 * srtt (call->rtt) is in units of one-eighth-milliseconds.
6786 * srtt is stored as fixed point with 3 bits after the binary
6787 * point (i.e., scaled by 8). The following magic is
6788 * equivalent to the smoothing algorithm in rfc793 with an
6789 * alpha of .875 (srtt' = rtt/8 + srtt*7/8 in fixed point).
6790 * srtt'*8 = rtt + srtt*7
6791 * srtt'*8 = srtt*8 + rtt - srtt
6792 * srtt' = srtt + rtt/8 - srtt/8
6793 * srtt' = srtt + (rtt - srtt)/8
6794 */
6795
6796 delta = _8THMSEC(&thisRtt)(((&thisRtt)->sec * 8000) + ((&thisRtt)->usec /
125)) - call->rtt;
6797 call->rtt += (delta >> 3);
6798
6799 /*
6800 * We accumulate a smoothed rtt variance (actually, a smoothed
6801 * mean difference), then set the retransmit timer to smoothed
6802 * rtt + 4 times the smoothed variance (was 2x in van's original
6803 * paper, but 4x works better for me, and apparently for him as
6804 * well).
6805 * rttvar is stored as
6806 * fixed point with 2 bits after the binary point (scaled by
6807 * 4). The following is equivalent to rfc793 smoothing with
6808 * an alpha of .75 (rttvar' = rttvar*3/4 + |delta| / 4).
6809 * rttvar'*4 = rttvar*3 + |delta|
6810 * rttvar'*4 = rttvar*4 + |delta| - rttvar
6811 * rttvar' = rttvar + |delta|/4 - rttvar/4
6812 * rttvar' = rttvar + (|delta| - rttvar)/4
6813 * This replaces rfc793's wired-in beta.
6814 * dev*4 = dev*4 + (|actual - expected| - dev)
6815 */
6816
6817 if (delta < 0)
6818 delta = -delta;
6819
6820 delta -= (call->rtt_dev << 1);
6821 call->rtt_dev += (delta >> 3);
6822 } else {
6823 /* I don't have a stored RTT so I start with this value. Since I'm
6824 * probably just starting a call, and will be pushing more data down
6825 * this, I expect congestion to increase rapidly. So I fudge a
6826 * little, and I set deviance to half the rtt. In practice,
6827 * deviance tends to approach something a little less than
6828 * half the smoothed rtt. */
6829 call->rtt = _8THMSEC(&thisRtt)(((&thisRtt)->sec * 8000) + ((&thisRtt)->usec /
125)) + 8;
6830 call->rtt_dev = call->rtt >> 2; /* rtt/2: they're scaled differently */
6831 }
6832 /* the smoothed RTT time is RTT + 4*MDEV
6833 *
6834 * We allow a user specified minimum to be set for this, to allow clamping
6835 * at a minimum value in the same way as TCP. In addition, we have to allow
6836 * for the possibility that this packet is answered by a delayed ACK, so we
6837 * add on a fixed 200ms to account for that timer expiring.
6838 */
6839
6840 rtt_timeout = MAX(((call->rtt >> 3) + call->rtt_dev),(((((call->rtt >> 3) + call->rtt_dev))>(rx_minPeerTimeout
))?(((call->rtt >> 3) + call->rtt_dev)):(rx_minPeerTimeout
))
6841 rx_minPeerTimeout)(((((call->rtt >> 3) + call->rtt_dev))>(rx_minPeerTimeout
))?(((call->rtt >> 3) + call->rtt_dev)):(rx_minPeerTimeout
)) + 200;
6842 clock_Zero(&call->rto)((&call->rto)->sec = (&call->rto)->usec =
0);
6843 clock_Addmsec(&call->rto, rtt_timeout)do { if ((rtt_timeout) >= 1000) { (&call->rto)->
sec += (afs_int32)((rtt_timeout) / 1000); (&call->rto)
->usec += (afs_int32)(((rtt_timeout) % 1000) * 1000); } else
{ (&call->rto)->usec += (afs_int32)((rtt_timeout) *
1000); } if ((&call->rto)->usec >= 1000000) { (
&call->rto)->usec -= 1000000; (&call->rto)->
sec++; } } while(0);
6844
6845 /* Update the peer, so any new calls start with our values */
6846 peer->rtt_dev = call->rtt_dev;
6847 peer->rtt = call->rtt;
6848
6849 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n",do { if (rx_debugFile) rxi_DebugPrint ("rxi_ComputeRoundTripTime(call=%d packet=%"
"p"" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n"
, p->header.callNumber, p, (((&thisRtt)->sec * 1000
) + ((&thisRtt)->usec / 1000)), call->rtt >> 3
, call->rtt_dev >> 2, (call->rto.sec), (call->
rto.usec)); } while (0)
6850 p->header.callNumber, p, MSEC(&thisRtt), call->rtt >> 3, call->rtt_dev >> 2, (call->rto.sec), (call->rto.usec)))do { if (rx_debugFile) rxi_DebugPrint ("rxi_ComputeRoundTripTime(call=%d packet=%"
"p"" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n"
, p->header.callNumber, p, (((&thisRtt)->sec * 1000
) + ((&thisRtt)->usec / 1000)), call->rtt >> 3
, call->rtt_dev >> 2, (call->rto.sec), (call->
rto.usec)); } while (0);
6851}
6852
6853
6854/* Find all server connections that have not been active for a long time, and
6855 * toss them */
6856void
6857rxi_ReapConnections(struct rxevent *unused, void *unused1, void *unused2)
6858{
6859 struct clock now, when;
6860 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
6861
6862 /* Find server connection structures that haven't been used for
6863 * greater than rx_idleConnectionTime */
6864 {
6865 struct rx_connection **conn_ptr, **conn_end;
6866 int i, havecalls = 0;
6867 MUTEX_ENTER(&rx_connHashTable_lock);
6868 for (conn_ptr = &rx_connHashTable[0], conn_end =
6869 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
6870 conn_ptr++) {
6871 struct rx_connection *conn, *next;
6872 struct rx_call *call;
6873 int result;
6874
6875 rereap:
6876 for (conn = *conn_ptr; conn; conn = next) {
6877 /* XXX -- Shouldn't the connection be locked? */
6878 next = conn->next;
6879 havecalls = 0;
6880 for (i = 0; i < RX_MAXCALLS4; i++) {
6881 call = conn->call[i];
6882 if (call) {
6883 int code;
6884 havecalls = 1;
6885 code = MUTEX_TRYENTER(&call->lock)1;
6886 if (!code)
6887 continue;
6888#ifdef RX_ENABLE_LOCKS
6889 result = rxi_CheckCall(call, 1);
6890#else /* RX_ENABLE_LOCKS */
6891 result = rxi_CheckCall(call);
6892#endif /* RX_ENABLE_LOCKS */
6893 MUTEX_EXIT(&call->lock);
6894 if (result == -2) {
6895 /* If CheckCall freed the call, it might
6896 * have destroyed the connection as well,
6897 * which screws up the linked lists.
6898 */
6899 goto rereap;
6900 }
6901 }
6902 }
6903 if (conn->type == RX_SERVER_CONNECTION1) {
6904 /* This only actually destroys the connection if
6905 * there are no outstanding calls */
6906 MUTEX_ENTER(&conn->conn_data_lock);
6907 MUTEX_ENTER(&rx_refcnt_mutex);
6908 if (!havecalls && !conn->refCount
6909 && ((conn->lastSendTime + rx_idleConnectionTime) <
6910 now.sec)) {
6911 conn->refCount++; /* it will be decr in rx_DestroyConn */
6912 MUTEX_EXIT(&rx_refcnt_mutex);
6913 MUTEX_EXIT(&conn->conn_data_lock);
6914#ifdef RX_ENABLE_LOCKS
6915 rxi_DestroyConnectionNoLock(conn);
6916#else /* RX_ENABLE_LOCKS */
6917 rxi_DestroyConnection(conn);
6918#endif /* RX_ENABLE_LOCKS */
6919 }
6920#ifdef RX_ENABLE_LOCKS
6921 else {
6922 MUTEX_EXIT(&rx_refcnt_mutex);
6923 MUTEX_EXIT(&conn->conn_data_lock);
6924 }
6925#endif /* RX_ENABLE_LOCKS */
6926 }
6927 }
6928 }
6929#ifdef RX_ENABLE_LOCKS
6930 while (rx_connCleanup_list) {
6931 struct rx_connection *conn;
6932 conn = rx_connCleanup_list;
6933 rx_connCleanup_list = rx_connCleanup_list->next;
6934 MUTEX_EXIT(&rx_connHashTable_lock);
6935 rxi_CleanupConnection(conn);
6936 MUTEX_ENTER(&rx_connHashTable_lock);
6937 }
6938 MUTEX_EXIT(&rx_connHashTable_lock);
6939#endif /* RX_ENABLE_LOCKS */
6940 }
6941
6942 /* Find any peer structures that haven't been used (haven't had an
6943 * associated connection) for greater than rx_idlePeerTime */
6944 {
6945 struct rx_peer **peer_ptr, **peer_end;
6946 int code;
6947
6948 /*
6949 * Why do we need to hold the rx_peerHashTable_lock across
6950 * the incrementing of peer_ptr since the rx_peerHashTable
6951 * array is not changing? We don't.
6952 *
6953 * By dropping the lock periodically we can permit other
6954 * activities to be performed while a rxi_ReapConnections
6955 * call is in progress. The goal of reap connections
6956 * is to clean up quickly without causing large amounts
6957 * of contention. Therefore, it is important that global
6958 * mutexes not be held for extended periods of time.
6959 */
6960 for (peer_ptr = &rx_peerHashTable[0], peer_end =
6961 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
6962 peer_ptr++) {
6963 struct rx_peer *peer, *next, *prev;
6964
6965 MUTEX_ENTER(&rx_peerHashTable_lock);
6966 for (prev = peer = *peer_ptr; peer; peer = next) {
6967 next = peer->next;
6968 code = MUTEX_TRYENTER(&peer->peer_lock)1;
6969 if ((code) && (peer->refCount == 0)
6970 && ((peer->idleWhen + rx_idlePeerTime) < now.sec)) {
6971 rx_interface_stat_p rpc_stat, nrpc_stat;
6972 size_t space;
6973
6974 /*
6975 * now know that this peer object is one to be
6976 * removed from the hash table. Once it is removed
6977 * it can't be referenced by other threads.
6978 * Lets remove it first and decrement the struct
6979 * nPeerStructs count.
6980 */
6981 if (peer == *peer_ptr) {
6982 *peer_ptr = next;
6983 prev = next;
6984 } else
6985 prev->next = next;
6986
6987 if (rx_stats_active)
6988 rx_atomic_dec(&rx_stats.nPeerStructs);
6989
6990 /*
6991 * Now if we hold references on 'prev' and 'next'
6992 * we can safely drop the rx_peerHashTable_lock
6993 * while we destroy this 'peer' object.
6994 */
6995 if (next)
6996 next->refCount++;
6997 if (prev)
6998 prev->refCount++;
6999 MUTEX_EXIT(&rx_peerHashTable_lock);
7000
7001 MUTEX_EXIT(&peer->peer_lock);
7002 MUTEX_DESTROY(&peer->peer_lock);
7003 for (queue_Scan(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
7004 (&peer->rpcStats, rpc_stat, nrpc_stat,(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
7005 rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)) {
7006 unsigned int num_funcs;
7007 if (!rpc_stat)
7008 break;
7009 queue_Remove(&rpc_stat->queue_header)(((((struct rx_queue *)(&rpc_stat->queue_header))->
prev->next=((struct rx_queue *)(&rpc_stat->queue_header
))->next)->prev=((struct rx_queue *)(&rpc_stat->
queue_header))->prev), ((struct rx_queue *)(&rpc_stat->
queue_header))->next = 0);
7010 queue_Remove(&rpc_stat->all_peers)(((((struct rx_queue *)(&rpc_stat->all_peers))->prev
->next=((struct rx_queue *)(&rpc_stat->all_peers))->
next)->prev=((struct rx_queue *)(&rpc_stat->all_peers
))->prev), ((struct rx_queue *)(&rpc_stat->all_peers
))->next = 0);
7011 num_funcs = rpc_stat->stats[0].func_total;
7012 space =
7013 sizeof(rx_interface_stat_t) +
7014 rpc_stat->stats[0].func_total *
7015 sizeof(rx_function_entry_v1_t);
7016
7017 rxi_Free(rpc_stat, space);
7018
7019 MUTEX_ENTER(&rx_rpc_stats);
7020 rxi_rpc_peer_stat_cnt -= num_funcs;
7021 MUTEX_EXIT(&rx_rpc_stats);
7022 }
7023 rxi_FreePeer(peer)rxi_Free(peer, sizeof(struct rx_peer));
7024
7025 /*
7026 * Regain the rx_peerHashTable_lock and
7027 * decrement the reference count on 'prev'
7028 * and 'next'.
7029 */
7030 MUTEX_ENTER(&rx_peerHashTable_lock);
7031 if (next)
7032 next->refCount--;
7033 if (prev)
7034 prev->refCount--;
7035 } else {
7036 if (code) {
7037 MUTEX_EXIT(&peer->peer_lock);
7038 }
7039 prev = peer;
7040 }
7041 }
7042 MUTEX_EXIT(&rx_peerHashTable_lock);
7043 }
7044 }
7045
7046 /* THIS HACK IS A TEMPORARY HACK. The idea is that the race condition in
7047 * rxi_AllocSendPacket, if it hits, will be handled at the next conn
7048 * GC, just below. Really, we shouldn't have to keep moving packets from
7049 * one place to another, but instead ought to always know if we can
7050 * afford to hold onto a packet in its particular use. */
7051 MUTEX_ENTER(&rx_freePktQ_lock);
7052 if (rx_waitingForPackets) {
7053 rx_waitingForPackets = 0;
7054#ifdef RX_ENABLE_LOCKS
7055 CV_BROADCAST(&rx_waitingForPackets_cv);
7056#else
7057 osi_rxWakeup(&rx_waitingForPackets)rxi_Wakeup(&rx_waitingForPackets);
7058#endif
7059 }
7060 MUTEX_EXIT(&rx_freePktQ_lock);
7061
7062 when = now;
7063 when.sec += RX_REAP_TIME60; /* Check every RX_REAP_TIME seconds */
7064 rxevent_Post(&when, rxi_ReapConnections, 0, 0);
7065}
7066
7067
7068/* rxs_Release - This isn't strictly necessary but, since the macro name from
7069 * rx.h is sort of strange this is better. This is called with a security
7070 * object before it is discarded. Each connection using a security object has
7071 * its own refcount to the object so it won't actually be freed until the last
7072 * connection is destroyed.
7073 *
7074 * This is the only rxs module call. A hold could also be written but no one
7075 * needs it. */
7076
7077int
7078rxs_Release(struct rx_securityClass *aobj)
7079{
7080 return RXS_Close(aobj)((aobj && (aobj->ops->op_Close)) ? (*(aobj)->
ops->op_Close)(aobj) : 0);
7081}
7082
7083#ifdef ADAPT_WINDOW
7084#define RXRATE_PKT_OH (RX_HEADER_SIZEsizeof (struct rx_header) + RX_IPUDP_SIZE)
7085#define RXRATE_SMALL_PKT (RXRATE_PKT_OH + sizeof(struct rx_ackPacket))
7086#define RXRATE_AVG_SMALL_PKT (RXRATE_PKT_OH + (sizeof(struct rx_ackPacket)/2))
7087#define RXRATE_LARGE_PKT (RXRATE_SMALL_PKT + 256)
7088
7089/* Adjust our estimate of the transmission rate to this peer, given
7090 * that the packet p was just acked. We can adjust peer->timeout and
7091 * call->twind. Pragmatically, this is called
7092 * only with packets of maximal length.
7093 * Called with peer and call locked.
7094 */
7095
7096static void
7097rxi_ComputeRate(struct rx_peer *peer, struct rx_call *call,
7098 struct rx_packet *p, struct rx_packet *ackp, u_char ackReason)
7099{
7100 afs_int32 xferSize, xferMs;
7101 afs_int32 minTime;
7102 struct clock newTO;
7103
7104 /* Count down packets */
7105 if (peer->rateFlag > 0)
7106 peer->rateFlag--;
7107 /* Do nothing until we're enabled */
7108 if (peer->rateFlag != 0)
7109 return;
7110 if (!call->conn)
7111 return;
7112
7113 /* Count only when the ack seems legitimate */
7114 switch (ackReason) {
7115 case RX_ACK_REQUESTED1:
7116 xferSize =
7117 p->length + RX_HEADER_SIZEsizeof (struct rx_header) + call->conn->securityMaxTrailerSize;
7118 xferMs = call->rtt;
7119 break;
7120
7121 case RX_ACK_PING_RESPONSE7:
7122 if (p) /* want the response to ping-request, not data send */
7123 return;
7124 clock_GetTime(&newTO)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&newTO)->sec = (afs_int32)tv.tv_sec; (&newTO)->
usec = (afs_int32)tv.tv_usec; } while(0);
7125 if (clock_Gt(&newTO, &call->pingRequestTime)((&newTO)->sec>(&call->pingRequestTime)->
sec || ((&newTO)->sec==(&call->pingRequestTime)
->sec && (&newTO)->usec>(&call->pingRequestTime
)->usec))) {
7126 clock_Sub(&newTO, &call->pingRequestTime)do { if (((&newTO)->usec -= (&call->pingRequestTime
)->usec) < 0) { (&newTO)->usec += 1000000; (&
newTO)->sec--; } (&newTO)->sec -= (&call->pingRequestTime
)->sec; } while(0);
7127 xferMs = (newTO.sec * 1000) + (newTO.usec / 1000);
7128 } else {
7129 return;
7130 }
7131 xferSize = rx_AckDataSize(rx_maxSendWindow)(3 + rx_maxSendWindow + __builtin_offsetof(struct rx_ackPacket
, acks[0])) + RX_HEADER_SIZEsizeof (struct rx_header);
7132 break;
7133
7134 default:
7135 return;
7136 }
7137
7138 dpf(("CONG peer %lx/%u: sample (%s) size %ld, %ld ms (to %d.%06d, rtt %u, ps %u)\n",do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: sample (%s) size %ld, %ld ms (to %d.%06d, rtt %u, ps %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), (ackReason == 1 ? "dataack" : "pingack"), xferSize
, xferMs, peer->timeout.sec, peer->timeout.usec, peer->
smRtt, peer->ifMTU); } while (0)
7139 ntohl(peer->host), ntohs(peer->port), (ackReason == RX_ACK_REQUESTED ? "dataack" : "pingack"),do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: sample (%s) size %ld, %ld ms (to %d.%06d, rtt %u, ps %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), (ackReason == 1 ? "dataack" : "pingack"), xferSize
, xferMs, peer->timeout.sec, peer->timeout.usec, peer->
smRtt, peer->ifMTU); } while (0)
7140 xferSize, xferMs, peer->timeout.sec, peer->timeout.usec, peer->smRtt, peer->ifMTU))do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: sample (%s) size %ld, %ld ms (to %d.%06d, rtt %u, ps %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), (ackReason == 1 ? "dataack" : "pingack"), xferSize
, xferMs, peer->timeout.sec, peer->timeout.usec, peer->
smRtt, peer->ifMTU); } while (0);
7141
7142 /* Track only packets that are big enough. */
7143 if ((p->length + RX_HEADER_SIZEsizeof (struct rx_header) + call->conn->securityMaxTrailerSize) <
7144 peer->ifMTU)
7145 return;
7146
7147 /* absorb RTT data (in milliseconds) for these big packets */
7148 if (peer->smRtt == 0) {
7149 peer->smRtt = xferMs;
7150 } else {
7151 peer->smRtt = ((peer->smRtt * 15) + xferMs + 4) >> 4;
7152 if (!peer->smRtt)
7153 peer->smRtt = 1;
7154 }
7155
7156 if (peer->countDown) {
7157 peer->countDown--;
7158 return;
7159 }
7160 peer->countDown = 10; /* recalculate only every so often */
7161
7162 /* In practice, we can measure only the RTT for full packets,
7163 * because of the way Rx acks the data that it receives. (If it's
7164 * smaller than a full packet, it often gets implicitly acked
7165 * either by the call response (from a server) or by the next call
7166 * (from a client), and either case confuses transmission times
7167 * with processing times.) Therefore, replace the above
7168 * more-sophisticated processing with a simpler version, where the
7169 * smoothed RTT is kept for full-size packets, and the time to
7170 * transmit a windowful of full-size packets is simply RTT *
7171 * windowSize. Again, we take two steps:
7172 - ensure the timeout is large enough for a single packet's RTT;
7173 - ensure that the window is small enough to fit in the desired timeout.*/
7174
7175 /* First, the timeout check. */
7176 minTime = peer->smRtt;
7177 /* Get a reasonable estimate for a timeout period */
7178 minTime += minTime;
7179 newTO.sec = minTime / 1000;
7180 newTO.usec = (minTime - (newTO.sec * 1000)) * 1000;
7181
7182 /* Increase the timeout period so that we can always do at least
7183 * one packet exchange */
7184 if (clock_Gt(&newTO, &peer->timeout)((&newTO)->sec>(&peer->timeout)->sec || (
(&newTO)->sec==(&peer->timeout)->sec &&
(&newTO)->usec>(&peer->timeout)->usec))) {
7185
7186 dpf(("CONG peer %lx/%u: timeout %d.%06d ==> %ld.%06d (rtt %u)\n",do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: timeout %d.%06d ==> %ld.%06d (rtt %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), peer->timeout.sec, peer->timeout.usec
, newTO.sec, newTO.usec, peer->smRtt); } while (0)
7187 ntohl(peer->host), ntohs(peer->port), peer->timeout.sec, peer->timeout.usec,do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: timeout %d.%06d ==> %ld.%06d (rtt %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), peer->timeout.sec, peer->timeout.usec
, newTO.sec, newTO.usec, peer->smRtt); } while (0)
7188 newTO.sec, newTO.usec, peer->smRtt))do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: timeout %d.%06d ==> %ld.%06d (rtt %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), peer->timeout.sec, peer->timeout.usec
, newTO.sec, newTO.usec, peer->smRtt); } while (0);
7189
7190 peer->timeout = newTO;
7191 }
7192
7193 /* Now, get an estimate for the transmit window size. */
7194 minTime = peer->timeout.sec * 1000 + (peer->timeout.usec / 1000);
7195 /* Now, convert to the number of full packets that could fit in a
7196 * reasonable fraction of that interval */
7197 minTime /= (peer->smRtt << 1);
7198 minTime = MAX(minTime, rx_minPeerTimeout)(((minTime)>(rx_minPeerTimeout))?(minTime):(rx_minPeerTimeout
));
7199 xferSize = minTime; /* (make a copy) */
7200
7201 /* Now clamp the size to reasonable bounds. */
7202 if (minTime <= 1)
7203 minTime = 1;
7204 else if (minTime > rx_maxSendWindow)
7205 minTime = rx_maxSendWindow;
7206/* if (minTime != peer->maxWindow) {
7207 dpf(("CONG peer %lx/%u: windowsize %lu ==> %lu (to %lu.%06lu, rtt %u)\n",
7208 ntohl(peer->host), ntohs(peer->port), peer->maxWindow, minTime,
7209 peer->timeout.sec, peer->timeout.usec, peer->smRtt));
7210 peer->maxWindow = minTime;
7211 elide... call->twind = minTime;
7212 }
7213*/
7214
7215 /* Cut back on the peer timeout if it had earlier grown unreasonably.
7216 * Discern this by calculating the timeout necessary for rx_Window
7217 * packets. */
7218 if ((xferSize > rx_maxSendWindow) && (peer->timeout.sec >= 3)) {
7219 /* calculate estimate for transmission interval in milliseconds */
7220 minTime = rx_maxSendWindow * peer->smRtt;
7221 if (minTime < 1000) {
7222 dpf(("CONG peer %lx/%u: cut TO %d.%06d by 0.5 (rtt %u)\n",do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: cut TO %d.%06d by 0.5 (rtt %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), peer->timeout.sec, peer->timeout.usec
, peer->smRtt); } while (0)
7223 ntohl(peer->host), ntohs(peer->port), peer->timeout.sec,do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: cut TO %d.%06d by 0.5 (rtt %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), peer->timeout.sec, peer->timeout.usec
, peer->smRtt); } while (0)
7224 peer->timeout.usec, peer->smRtt))do { if (rx_debugFile) rxi_DebugPrint ("CONG peer %lx/%u: cut TO %d.%06d by 0.5 (rtt %u)\n"
, (__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer
->host)) >> 24) | ((((__uint32_t)(peer->host)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (__builtin_constant_p
(peer->port) ? (__uint16_t)(((__uint16_t)(peer->port)) <<
8 | ((__uint16_t)(peer->port)) >> 8) : __bswap16_var
(peer->port)), peer->timeout.sec, peer->timeout.usec
, peer->smRtt); } while (0);
7225
7226 newTO.sec = 0; /* cut back on timeout by half a second */
7227 newTO.usec = 500000;
7228 clock_Sub(&peer->timeout, &newTO)do { if (((&peer->timeout)->usec -= (&newTO)->
usec) < 0) { (&peer->timeout)->usec += 1000000; (
&peer->timeout)->sec--; } (&peer->timeout)->
sec -= (&newTO)->sec; } while(0);
7229 }
7230 }
7231
7232 return;
7233} /* end of rxi_ComputeRate */
7234#endif /* ADAPT_WINDOW */
7235
7236
7237void
7238rxi_DebugInit(void)
7239{
7240#ifdef RXDEBUG1
7241#ifdef AFS_NT40_ENV
7242#define TRACE_OPTION_RX_DEBUG 16
7243 HKEY parmKey;
7244 DWORD dummyLen;
7245 DWORD TraceOption;
7246 long code;
7247
7248 rxdebug_active = 0;
7249
7250 code = RegOpenKeyEx(HKEY_LOCAL_MACHINE, AFSREG_CLT_SVC_PARAM_SUBKEY,
7251 0, KEY_QUERY_VALUE, &parmKey);
7252 if (code != ERROR_SUCCESS)
7253 return;
7254
7255 dummyLen = sizeof(TraceOption);
7256 code = RegQueryValueEx(parmKey, "TraceOption", NULL((void *)0), NULL((void *)0),
7257 (BYTE *) &TraceOption, &dummyLen);
7258 if (code == ERROR_SUCCESS) {
7259 rxdebug_active = (TraceOption & TRACE_OPTION_RX_DEBUG) ? 1 : 0;
7260 }
7261 RegCloseKey (parmKey);
7262#endif /* AFS_NT40_ENV */
7263#endif
7264}
7265
7266void
7267rx_DebugOnOff(int on)
7268{
7269#ifdef RXDEBUG1
7270#ifdef AFS_NT40_ENV
7271 rxdebug_active = on;
7272#endif
7273#endif
7274}
7275
7276void
7277rx_StatsOnOff(int on)
7278{
7279 rx_stats_active = on;
7280}
7281
7282
7283/* Don't call this debugging routine directly; use dpf */
7284void
7285rxi_DebugPrint(char *format, ...)
7286{
7287#ifdef RXDEBUG1
7288 va_list ap;
7289#ifdef AFS_NT40_ENV
7290 char msg[512];
7291 char tformat[256];
7292 size_t len;
7293
7294 va_start(ap, format)__builtin_va_start((ap), (format));
7295
7296 len = _snprintf(tformat, sizeof(tformat), "tid[%d] %s", GetCurrentThreadId(), format);
7297
7298 if (len > 0) {
7299 len = _vsnprintf(msg, sizeof(msg)-2, tformat, ap);
7300 if (len > 0)
7301 OutputDebugString(msg);
7302 }
7303 va_end(ap)__builtin_va_end(ap);
7304#else
7305 struct clock now;
7306
7307 va_start(ap, format)__builtin_va_start((ap), (format));
7308
7309 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
7310 fprintf(rx_Logrx_debugFile, " %d.%06d:", (unsigned int)now.sec,
7311 (unsigned int)now.usec);
7312 vfprintf(rx_Logrx_debugFile, format, ap);
7313 va_end(ap)__builtin_va_end(ap);
7314#endif
7315#endif
7316}
7317
7318#ifndef KERNEL
7319/*
7320 * This function is used to process the rx_stats structure that is local
7321 * to a process as well as an rx_stats structure received from a remote
7322 * process (via rxdebug). Therefore, it needs to do minimal version
7323 * checking.
7324 */
7325void
7326rx_PrintTheseStats(FILE * file, struct rx_statistics *s, int size,
7327 afs_int32 freePackets, char version)
7328{
7329 int i;
7330
7331 if (size != sizeof(struct rx_statistics)) {
7332 fprintf(file,
7333 "Unexpected size of stats structure: was %d, expected %" AFS_SIZET_FMT"zu" "\n",
7334 size, sizeof(struct rx_statistics));
7335 }
7336
7337 fprintf(file, "rx stats: free packets %d, allocs %d, ", (int)freePackets,
7338 s->packetRequests);
7339
7340 if (version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES('P')) {
7341 fprintf(file, "alloc-failures(rcv %u/%u,send %u/%u,ack %u)\n",
7342 s->receivePktAllocFailures, s->receiveCbufPktAllocFailures,
7343 s->sendPktAllocFailures, s->sendCbufPktAllocFailures,
7344 s->specialPktAllocFailures);
7345 } else {
7346 fprintf(file, "alloc-failures(rcv %u,send %u,ack %u)\n",
7347 s->receivePktAllocFailures, s->sendPktAllocFailures,
7348 s->specialPktAllocFailures);
7349 }
7350
7351 fprintf(file,
7352 " greedy %u, " "bogusReads %u (last from host %x), "
7353 "noPackets %u, " "noBuffers %u, " "selects %u, "
7354 "sendSelects %u\n", s->socketGreedy, s->bogusPacketOnRead,
7355 s->bogusHost, s->noPacketOnRead, s->noPacketBuffersOnRead,
7356 s->selects, s->sendSelects);
7357
7358 fprintf(file, " packets read: ");
7359 for (i = 0; i < RX_N_PACKET_TYPES13; i++) {
7360 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsRead[i]);
7361 }
7362 fprintf(file, "\n");
7363
7364 fprintf(file,
7365 " other read counters: data %u, " "ack %u, " "dup %u "
7366 "spurious %u " "dally %u\n", s->dataPacketsRead,
7367 s->ackPacketsRead, s->dupPacketsRead, s->spuriousPacketsRead,
7368 s->ignorePacketDally);
7369
7370 fprintf(file, " packets sent: ");
7371 for (i = 0; i < RX_N_PACKET_TYPES13; i++) {
7372 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsSent[i]);
7373 }
7374 fprintf(file, "\n");
7375
7376 fprintf(file,
7377 " other send counters: ack %u, " "data %u (not resends), "
7378 "resends %u, " "pushed %u, " "acked&ignored %u\n",
7379 s->ackPacketsSent, s->dataPacketsSent, s->dataPacketsReSent,
7380 s->dataPacketsPushed, s->ignoreAckedPacket);
7381
7382 fprintf(file,
7383 " \t(these should be small) sendFailed %u, " "fatalErrors %u\n",
7384 s->netSendFailures, (int)s->fatalErrors);
7385
7386 if (s->nRttSamples) {
7387 fprintf(file, " Average rtt is %0.3f, with %d samples\n",
7388 clock_Float(&s->totalRtt)((&s->totalRtt)->sec + (&s->totalRtt)->usec
/1e6) / s->nRttSamples, s->nRttSamples);
7389
7390 fprintf(file, " Minimum rtt is %0.3f, maximum is %0.3f\n",
7391 clock_Float(&s->minRtt)((&s->minRtt)->sec + (&s->minRtt)->usec/1e6
), clock_Float(&s->maxRtt)((&s->maxRtt)->sec + (&s->maxRtt)->usec/1e6
));
7392 }
7393
7394 fprintf(file,
7395 " %d server connections, " "%d client connections, "
7396 "%d peer structs, " "%d call structs, " "%d free call structs\n",
7397 s->nServerConns, s->nClientConns, s->nPeerStructs,
7398 s->nCallStructs, s->nFreeCallStructs);
7399
7400#if !defined(AFS_PTHREAD_ENV) && !defined(AFS_USE_GETTIMEOFDAY1)
7401 fprintf(file, " %d clock updates\n", clock_nUpdates);
7402#endif
7403}
7404
7405/* for backward compatibility */
7406void
7407rx_PrintStats(FILE * file)
7408{
7409 MUTEX_ENTER(&rx_stats_mutex);
7410 rx_PrintTheseStats(file, (struct rx_statistics *) &rx_stats,
7411 sizeof(rx_stats), rx_nFreePackets,
7412 RX_DEBUGI_VERSION('S'));
7413 MUTEX_EXIT(&rx_stats_mutex);
7414}
7415
7416void
7417rx_PrintPeerStats(FILE * file, struct rx_peer *peer)
7418{
7419 fprintf(file, "Peer %x.%d. " "Burst size %d, " "burst wait %d.%06d.\n",
7420 ntohl(peer->host)(__builtin_constant_p(peer->host) ? ((((__uint32_t)(peer->
host)) >> 24) | ((((__uint32_t)(peer->host)) & (
0xff << 16)) >> 8) | ((((__uint32_t)(peer->host
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->host)) << 24)) : __bswap32_var(peer->host)), (int)ntohs(peer->port)(__builtin_constant_p(peer->port) ? (__uint16_t)(((__uint16_t
)(peer->port)) << 8 | ((__uint16_t)(peer->port)) >>
8) : __bswap16_var(peer->port)), (int)peer->burstSize,
7421 (int)peer->burstWait.sec, (int)peer->burstWait.usec);
7422
7423 fprintf(file,
7424 " Rtt %d, " "total sent %d, " "resent %d\n",
7425 peer->rtt, peer->nSent, peer->reSends);
7426
7427 fprintf(file,
7428 " Packet size %d, " "max in packet skew %d, "
7429 "max out packet skew %d\n", peer->ifMTU, (int)peer->inPacketSkew,
7430 (int)peer->outPacketSkew);
7431}
7432#endif
7433
7434#if defined(AFS_PTHREAD_ENV) && defined(RXDEBUG1)
7435/*
7436 * This mutex protects the following static variables:
7437 * counter
7438 */
7439
7440#define LOCK_RX_DEBUG MUTEX_ENTER(&rx_debug_mutex)
7441#define UNLOCK_RX_DEBUG MUTEX_EXIT(&rx_debug_mutex)
7442#else
7443#define LOCK_RX_DEBUG
7444#define UNLOCK_RX_DEBUG
7445#endif /* AFS_PTHREAD_ENV */
7446
7447#if defined(RXDEBUG1) || defined(MAKEDEBUGCALL)
7448static int
7449MakeDebugCall(osi_socket socket, afs_uint32 remoteAddr, afs_uint16 remotePort,
7450 u_char type, void *inputData, size_t inputLength,
7451 void *outputData, size_t outputLength)
7452{
7453 static afs_int32 counter = 100;
7454 time_t waitTime, waitCount;
7455 struct rx_header theader;
7456 char tbuffer[1500];
7457 afs_int32 code;
7458 struct timeval tv_now, tv_wake, tv_delta;
7459 struct sockaddr_in taddr, faddr;
7460#ifdef AFS_NT40_ENV
7461 int faddrLen;
7462#else
7463 socklen_t faddrLen;
7464#endif
7465 fd_set imask;
7466 char *tp;
7467
7468 waitTime = 1;
7469 waitCount = 5;
7470 LOCK_RX_DEBUG;
7471 counter++;
7472 UNLOCK_RX_DEBUG;
7473 tp = &tbuffer[sizeof(struct rx_header)];
7474 taddr.sin_family = AF_INET2;
7475 taddr.sin_port = remotePort;
7476 taddr.sin_addr.s_addr = remoteAddr;
7477#ifdef STRUCT_SOCKADDR_HAS_SA_LEN1
7478 taddr.sin_len = sizeof(struct sockaddr_in);
7479#endif
7480 while (1) {
7481 memset(&theader, 0, sizeof(theader));
7482 theader.epoch = htonl(999)(__builtin_constant_p(999) ? ((((__uint32_t)(999)) >> 24
) | ((((__uint32_t)(999)) & (0xff << 16)) >> 8
) | ((((__uint32_t)(999)) & (0xff << 8)) << 8
) | (((__uint32_t)(999)) << 24)) : __bswap32_var(999));
7483 theader.cid = 0;
7484 theader.callNumber = htonl(counter)(__builtin_constant_p(counter) ? ((((__uint32_t)(counter)) >>
24) | ((((__uint32_t)(counter)) & (0xff << 16)) >>
8) | ((((__uint32_t)(counter)) & (0xff << 8)) <<
8) | (((__uint32_t)(counter)) << 24)) : __bswap32_var(
counter));
7485 theader.seq = 0;
7486 theader.serial = 0;
7487 theader.type = type;
7488 theader.flags = RX_CLIENT_INITIATED1 | RX_LAST_PACKET4;
7489 theader.serviceId = 0;
7490
7491 memcpy(tbuffer, &theader, sizeof(theader));
7492 memcpy(tp, inputData, inputLength);
7493 code =
Value stored to 'code' is never read
7494 sendto(socket, tbuffer, inputLength + sizeof(struct rx_header), 0,
7495 (struct sockaddr *)&taddr, sizeof(struct sockaddr_in));
7496
7497 /* see if there's a packet available */
7498 gettimeofday(&tv_wake, NULL((void *)0));
7499 tv_wake.tv_sec += waitTime;
7500 for (;;) {
7501 FD_ZERO(&imask)do { fd_set *_p; __size_t _n; _p = (&imask); _n = (((1024U
) + (((sizeof(__fd_mask) * 8)) - 1)) / ((sizeof(__fd_mask) * 8
))); while (_n > 0) _p->__fds_bits[--_n] = 0; } while (
0);
7502 FD_SET(socket, &imask)((&imask)->__fds_bits[(socket)/(sizeof(__fd_mask) * 8)
] |= ((__fd_mask)1 << ((socket) % (sizeof(__fd_mask) * 8
))));
7503 tv_delta.tv_sec = tv_wake.tv_sec;
7504 tv_delta.tv_usec = tv_wake.tv_usec;
7505 gettimeofday(&tv_now, NULL((void *)0));
7506
7507 if (tv_delta.tv_usec < tv_now.tv_usec) {
7508 /* borrow */
7509 tv_delta.tv_usec += 1000000;
7510 tv_delta.tv_sec--;
7511 }
7512 tv_delta.tv_usec -= tv_now.tv_usec;
7513
7514 if (tv_delta.tv_sec < tv_now.tv_sec) {
7515 /* time expired */
7516 break;
7517 }
7518 tv_delta.tv_sec -= tv_now.tv_sec;
7519
7520#ifdef AFS_NT40_ENV
7521 code = select(0, &imask, 0, 0, &tv_delta);
7522#else /* AFS_NT40_ENV */
7523 code = select(socket + 1, &imask, 0, 0, &tv_delta);
7524#endif /* AFS_NT40_ENV */
7525 if (code == 1 && FD_ISSET(socket, &imask)(((&imask)->__fds_bits[(socket)/(sizeof(__fd_mask) * 8
)] & ((__fd_mask)1 << ((socket) % (sizeof(__fd_mask
) * 8)))) != 0)) {
7526 /* now receive a packet */
7527 faddrLen = sizeof(struct sockaddr_in);
7528 code =
7529 recvfrom(socket, tbuffer, sizeof(tbuffer), 0,
7530 (struct sockaddr *)&faddr, &faddrLen);
7531
7532 if (code > 0) {
7533 memcpy(&theader, tbuffer, sizeof(struct rx_header));
7534 if (counter == ntohl(theader.callNumber)(__builtin_constant_p(theader.callNumber) ? ((((__uint32_t)(theader
.callNumber)) >> 24) | ((((__uint32_t)(theader.callNumber
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(theader
.callNumber)) & (0xff << 8)) << 8) | (((__uint32_t
)(theader.callNumber)) << 24)) : __bswap32_var(theader.
callNumber)))
7535 goto success;
7536 continue;
7537 }
7538 }
7539 break;
7540 }
7541
7542 /* see if we've timed out */
7543 if (!--waitCount) {
7544 return -1;
7545 }
7546 waitTime <<= 1;
7547 }
7548
7549 success:
7550 code -= sizeof(struct rx_header);
7551 if (code > outputLength)
7552 code = outputLength;
7553 memcpy(outputData, tp, code);
7554 return code;
7555}
7556#endif /* RXDEBUG */
7557
7558afs_int32
7559rx_GetServerDebug(osi_socket socket, afs_uint32 remoteAddr,
7560 afs_uint16 remotePort, struct rx_debugStats * stat,
7561 afs_uint32 * supportedValues)
7562{
7563#if defined(RXDEBUG1) || defined(MAKEDEBUGCALL)
7564 afs_int32 rc = 0;
7565 struct rx_debugIn in;
7566
7567 *supportedValues = 0;
7568 in.type = htonl(RX_DEBUGI_GETSTATS)(__builtin_constant_p(1) ? ((((__uint32_t)(1)) >> 24) |
((((__uint32_t)(1)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(1)) & (0xff << 8)) << 8) | (((
__uint32_t)(1)) << 24)) : __bswap32_var(1));
7569 in.index = 0;
7570
7571 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG8,
7572 &in, sizeof(in), stat, sizeof(*stat));
7573
7574 /*
7575 * If the call was successful, fixup the version and indicate
7576 * what contents of the stat structure are valid.
7577 * Also do net to host conversion of fields here.
7578 */
7579
7580 if (rc >= 0) {
7581 if (stat->version >= RX_DEBUGI_VERSION_W_SECSTATS('L')) {
7582 *supportedValues |= RX_SERVER_DEBUG_SEC_STATS0x1;
7583 }
7584 if (stat->version >= RX_DEBUGI_VERSION_W_GETALLCONN('M')) {
7585 *supportedValues |= RX_SERVER_DEBUG_ALL_CONN0x2;
7586 }
7587 if (stat->version >= RX_DEBUGI_VERSION_W_RXSTATS('M')) {
7588 *supportedValues |= RX_SERVER_DEBUG_RX_STATS0x4;
7589 }
7590 if (stat->version >= RX_DEBUGI_VERSION_W_WAITERS('N')) {
7591 *supportedValues |= RX_SERVER_DEBUG_WAITER_CNT0x8;
7592 }
7593 if (stat->version >= RX_DEBUGI_VERSION_W_IDLETHREADS('O')) {
7594 *supportedValues |= RX_SERVER_DEBUG_IDLE_THREADS0x10;
7595 }
7596 if (stat->version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES('P')) {
7597 *supportedValues |= RX_SERVER_DEBUG_NEW_PACKETS0x40;
7598 }
7599 if (stat->version >= RX_DEBUGI_VERSION_W_GETPEER('Q')) {
7600 *supportedValues |= RX_SERVER_DEBUG_ALL_PEER0x80;
7601 }
7602 if (stat->version >= RX_DEBUGI_VERSION_W_WAITED('R')) {
7603 *supportedValues |= RX_SERVER_DEBUG_WAITED_CNT0x100;
7604 }
7605 if (stat->version >= RX_DEBUGI_VERSION_W_PACKETS('S')) {
7606 *supportedValues |= RX_SERVER_DEBUG_PACKETS_CNT0x200;
7607 }
7608 stat->nFreePackets = ntohl(stat->nFreePackets)(__builtin_constant_p(stat->nFreePackets) ? ((((__uint32_t
)(stat->nFreePackets)) >> 24) | ((((__uint32_t)(stat
->nFreePackets)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(stat->nFreePackets)) & (0xff << 8
)) << 8) | (((__uint32_t)(stat->nFreePackets)) <<
24)) : __bswap32_var(stat->nFreePackets));
7609 stat->packetReclaims = ntohl(stat->packetReclaims)(__builtin_constant_p(stat->packetReclaims) ? ((((__uint32_t
)(stat->packetReclaims)) >> 24) | ((((__uint32_t)(stat
->packetReclaims)) & (0xff << 16)) >> 8) |
((((__uint32_t)(stat->packetReclaims)) & (0xff <<
8)) << 8) | (((__uint32_t)(stat->packetReclaims)) <<
24)) : __bswap32_var(stat->packetReclaims));
7610 stat->callsExecuted = ntohl(stat->callsExecuted)(__builtin_constant_p(stat->callsExecuted) ? ((((__uint32_t
)(stat->callsExecuted)) >> 24) | ((((__uint32_t)(stat
->callsExecuted)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(stat->callsExecuted)) & (0xff << 8
)) << 8) | (((__uint32_t)(stat->callsExecuted)) <<
24)) : __bswap32_var(stat->callsExecuted));
7611 stat->nWaiting = ntohl(stat->nWaiting)(__builtin_constant_p(stat->nWaiting) ? ((((__uint32_t)(stat
->nWaiting)) >> 24) | ((((__uint32_t)(stat->nWaiting
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(stat
->nWaiting)) & (0xff << 8)) << 8) | (((__uint32_t
)(stat->nWaiting)) << 24)) : __bswap32_var(stat->
nWaiting));
7612 stat->idleThreads = ntohl(stat->idleThreads)(__builtin_constant_p(stat->idleThreads) ? ((((__uint32_t)
(stat->idleThreads)) >> 24) | ((((__uint32_t)(stat->
idleThreads)) & (0xff << 16)) >> 8) | ((((__uint32_t
)(stat->idleThreads)) & (0xff << 8)) << 8)
| (((__uint32_t)(stat->idleThreads)) << 24)) : __bswap32_var
(stat->idleThreads));
7613 stat->nWaited = ntohl(stat->nWaited)(__builtin_constant_p(stat->nWaited) ? ((((__uint32_t)(stat
->nWaited)) >> 24) | ((((__uint32_t)(stat->nWaited
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(stat
->nWaited)) & (0xff << 8)) << 8) | (((__uint32_t
)(stat->nWaited)) << 24)) : __bswap32_var(stat->nWaited
));
7614 stat->nPackets = ntohl(stat->nPackets)(__builtin_constant_p(stat->nPackets) ? ((((__uint32_t)(stat
->nPackets)) >> 24) | ((((__uint32_t)(stat->nPackets
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(stat
->nPackets)) & (0xff << 8)) << 8) | (((__uint32_t
)(stat->nPackets)) << 24)) : __bswap32_var(stat->
nPackets));
7615 }
7616#else
7617 afs_int32 rc = -1;
7618#endif
7619 return rc;
7620}
7621
7622afs_int32
7623rx_GetServerStats(osi_socket socket, afs_uint32 remoteAddr,
7624 afs_uint16 remotePort, struct rx_statistics * stat,
7625 afs_uint32 * supportedValues)
7626{
7627#if defined(RXDEBUG1) || defined(MAKEDEBUGCALL)
7628 afs_int32 rc = 0;
7629 struct rx_debugIn in;
7630 afs_int32 *lp = (afs_int32 *) stat;
7631 int i;
7632
7633 /*
7634 * supportedValues is currently unused, but added to allow future
7635 * versioning of this function.
7636 */
7637
7638 *supportedValues = 0;
7639 in.type = htonl(RX_DEBUGI_RXSTATS)(__builtin_constant_p(4) ? ((((__uint32_t)(4)) >> 24) |
((((__uint32_t)(4)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(4)) & (0xff << 8)) << 8) | (((
__uint32_t)(4)) << 24)) : __bswap32_var(4));
7640 in.index = 0;
7641 memset(stat, 0, sizeof(*stat));
7642
7643 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG8,
7644 &in, sizeof(in), stat, sizeof(*stat));
7645
7646 if (rc >= 0) {
7647
7648 /*
7649 * Do net to host conversion here
7650 */
7651
7652 for (i = 0; i < sizeof(*stat) / sizeof(afs_int32); i++, lp++) {
7653 *lp = ntohl(*lp)(__builtin_constant_p(*lp) ? ((((__uint32_t)(*lp)) >> 24
) | ((((__uint32_t)(*lp)) & (0xff << 16)) >> 8
) | ((((__uint32_t)(*lp)) & (0xff << 8)) << 8
) | (((__uint32_t)(*lp)) << 24)) : __bswap32_var(*lp));
7654 }
7655 }
7656#else
7657 afs_int32 rc = -1;
7658#endif
7659 return rc;
7660}
7661
7662afs_int32
7663rx_GetServerVersion(osi_socket socket, afs_uint32 remoteAddr,
7664 afs_uint16 remotePort, size_t version_length,
7665 char *version)
7666{
7667#if defined(RXDEBUG1) || defined(MAKEDEBUGCALL)
7668 char a[1] = { 0 };
7669 return MakeDebugCall(socket, remoteAddr, remotePort,
7670 RX_PACKET_TYPE_VERSION13, a, 1, version,
7671 version_length);
7672#else
7673 return -1;
7674#endif
7675}
7676
7677afs_int32
7678rx_GetServerConnections(osi_socket socket, afs_uint32 remoteAddr,
7679 afs_uint16 remotePort, afs_int32 * nextConnection,
7680 int allConnections, afs_uint32 debugSupportedValues,
7681 struct rx_debugConn * conn,
7682 afs_uint32 * supportedValues)
7683{
7684#if defined(RXDEBUG1) || defined(MAKEDEBUGCALL)
7685 afs_int32 rc = 0;
7686 struct rx_debugIn in;
7687 int i;
7688
7689 /*
7690 * supportedValues is currently unused, but added to allow future
7691 * versioning of this function.
7692 */
7693
7694 *supportedValues = 0;
7695 if (allConnections) {
7696 in.type = htonl(RX_DEBUGI_GETALLCONN)(__builtin_constant_p(3) ? ((((__uint32_t)(3)) >> 24) |
((((__uint32_t)(3)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(3)) & (0xff << 8)) << 8) | (((
__uint32_t)(3)) << 24)) : __bswap32_var(3));
7697 } else {
7698 in.type = htonl(RX_DEBUGI_GETCONN)(__builtin_constant_p(2) ? ((((__uint32_t)(2)) >> 24) |
((((__uint32_t)(2)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(2)) & (0xff << 8)) << 8) | (((
__uint32_t)(2)) << 24)) : __bswap32_var(2));
7699 }
7700 in.index = htonl(*nextConnection)(__builtin_constant_p(*nextConnection) ? ((((__uint32_t)(*nextConnection
)) >> 24) | ((((__uint32_t)(*nextConnection)) & (0xff
<< 16)) >> 8) | ((((__uint32_t)(*nextConnection)
) & (0xff << 8)) << 8) | (((__uint32_t)(*nextConnection
)) << 24)) : __bswap32_var(*nextConnection));
7701 memset(conn, 0, sizeof(*conn));
7702
7703 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG8,
7704 &in, sizeof(in), conn, sizeof(*conn));
7705
7706 if (rc >= 0) {
7707 *nextConnection += 1;
7708
7709 /*
7710 * Convert old connection format to new structure.
7711 */
7712
7713 if (debugSupportedValues & RX_SERVER_DEBUG_OLD_CONN0x20) {
7714 struct rx_debugConn_vL *vL = (struct rx_debugConn_vL *)conn;
7715#define MOVEvL(a)(conn->a = vL->a) (conn->a = vL->a)
7716
7717 /* any old or unrecognized version... */
7718 for (i = 0; i < RX_MAXCALLS4; i++) {
7719 MOVEvL(callState[i])(conn->callState[i] = vL->callState[i]);
7720 MOVEvL(callMode[i])(conn->callMode[i] = vL->callMode[i]);
7721 MOVEvL(callFlags[i])(conn->callFlags[i] = vL->callFlags[i]);
7722 MOVEvL(callOther[i])(conn->callOther[i] = vL->callOther[i]);
7723 }
7724 if (debugSupportedValues & RX_SERVER_DEBUG_SEC_STATS0x1) {
7725 MOVEvL(secStats.type)(conn->secStats.type = vL->secStats.type);
7726 MOVEvL(secStats.level)(conn->secStats.level = vL->secStats.level);
7727 MOVEvL(secStats.flags)(conn->secStats.flags = vL->secStats.flags);
7728 MOVEvL(secStats.expires)(conn->secStats.expires = vL->secStats.expires);
7729 MOVEvL(secStats.packetsReceived)(conn->secStats.packetsReceived = vL->secStats.packetsReceived
);
7730 MOVEvL(secStats.packetsSent)(conn->secStats.packetsSent = vL->secStats.packetsSent);
7731 MOVEvL(secStats.bytesReceived)(conn->secStats.bytesReceived = vL->secStats.bytesReceived
);
7732 MOVEvL(secStats.bytesSent)(conn->secStats.bytesSent = vL->secStats.bytesSent);
7733 }
7734 }
7735
7736 /*
7737 * Do net to host conversion here
7738 * NOTE:
7739 * I don't convert host or port since we are most likely
7740 * going to want these in NBO.
7741 */
7742 conn->cid = ntohl(conn->cid)(__builtin_constant_p(conn->cid) ? ((((__uint32_t)(conn->
cid)) >> 24) | ((((__uint32_t)(conn->cid)) & (0xff
<< 16)) >> 8) | ((((__uint32_t)(conn->cid)) &
(0xff << 8)) << 8) | (((__uint32_t)(conn->cid
)) << 24)) : __bswap32_var(conn->cid));
7743 conn->serial = ntohl(conn->serial)(__builtin_constant_p(conn->serial) ? ((((__uint32_t)(conn
->serial)) >> 24) | ((((__uint32_t)(conn->serial)
) & (0xff << 16)) >> 8) | ((((__uint32_t)(conn
->serial)) & (0xff << 8)) << 8) | (((__uint32_t
)(conn->serial)) << 24)) : __bswap32_var(conn->serial
));
7744 for (i = 0; i < RX_MAXCALLS4; i++) {
7745 conn->callNumber[i] = ntohl(conn->callNumber[i])(__builtin_constant_p(conn->callNumber[i]) ? ((((__uint32_t
)(conn->callNumber[i])) >> 24) | ((((__uint32_t)(conn
->callNumber[i])) & (0xff << 16)) >> 8) | (
(((__uint32_t)(conn->callNumber[i])) & (0xff << 8
)) << 8) | (((__uint32_t)(conn->callNumber[i])) <<
24)) : __bswap32_var(conn->callNumber[i]));
7746 }
7747 conn->error = ntohl(conn->error)(__builtin_constant_p(conn->error) ? ((((__uint32_t)(conn->
error)) >> 24) | ((((__uint32_t)(conn->error)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(conn->error
)) & (0xff << 8)) << 8) | (((__uint32_t)(conn
->error)) << 24)) : __bswap32_var(conn->error));
7748 conn->secStats.flags = ntohl(conn->secStats.flags)(__builtin_constant_p(conn->secStats.flags) ? ((((__uint32_t
)(conn->secStats.flags)) >> 24) | ((((__uint32_t)(conn
->secStats.flags)) & (0xff << 16)) >> 8) |
((((__uint32_t)(conn->secStats.flags)) & (0xff <<
8)) << 8) | (((__uint32_t)(conn->secStats.flags)) <<
24)) : __bswap32_var(conn->secStats.flags));
7749 conn->secStats.expires = ntohl(conn->secStats.expires)(__builtin_constant_p(conn->secStats.expires) ? ((((__uint32_t
)(conn->secStats.expires)) >> 24) | ((((__uint32_t)(
conn->secStats.expires)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->secStats.expires)) & (0xff
<< 8)) << 8) | (((__uint32_t)(conn->secStats.
expires)) << 24)) : __bswap32_var(conn->secStats.expires
));
7750 conn->secStats.packetsReceived =
7751 ntohl(conn->secStats.packetsReceived)(__builtin_constant_p(conn->secStats.packetsReceived) ? ((
((__uint32_t)(conn->secStats.packetsReceived)) >> 24
) | ((((__uint32_t)(conn->secStats.packetsReceived)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(conn->secStats
.packetsReceived)) & (0xff << 8)) << 8) | (((
__uint32_t)(conn->secStats.packetsReceived)) << 24))
: __bswap32_var(conn->secStats.packetsReceived));
7752 conn->secStats.packetsSent = ntohl(conn->secStats.packetsSent)(__builtin_constant_p(conn->secStats.packetsSent) ? ((((__uint32_t
)(conn->secStats.packetsSent)) >> 24) | ((((__uint32_t
)(conn->secStats.packetsSent)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->secStats.packetsSent)) & (
0xff << 8)) << 8) | (((__uint32_t)(conn->secStats
.packetsSent)) << 24)) : __bswap32_var(conn->secStats
.packetsSent));
7753 conn->secStats.bytesReceived = ntohl(conn->secStats.bytesReceived)(__builtin_constant_p(conn->secStats.bytesReceived) ? ((((
__uint32_t)(conn->secStats.bytesReceived)) >> 24) | (
(((__uint32_t)(conn->secStats.bytesReceived)) & (0xff <<
16)) >> 8) | ((((__uint32_t)(conn->secStats.bytesReceived
)) & (0xff << 8)) << 8) | (((__uint32_t)(conn
->secStats.bytesReceived)) << 24)) : __bswap32_var(conn
->secStats.bytesReceived));
7754 conn->secStats.bytesSent = ntohl(conn->secStats.bytesSent)(__builtin_constant_p(conn->secStats.bytesSent) ? ((((__uint32_t
)(conn->secStats.bytesSent)) >> 24) | ((((__uint32_t
)(conn->secStats.bytesSent)) & (0xff << 16)) >>
8) | ((((__uint32_t)(conn->secStats.bytesSent)) & (0xff
<< 8)) << 8) | (((__uint32_t)(conn->secStats.
bytesSent)) << 24)) : __bswap32_var(conn->secStats.bytesSent
));
7755 conn->epoch = ntohl(conn->epoch)(__builtin_constant_p(conn->epoch) ? ((((__uint32_t)(conn->
epoch)) >> 24) | ((((__uint32_t)(conn->epoch)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(conn->epoch
)) & (0xff << 8)) << 8) | (((__uint32_t)(conn
->epoch)) << 24)) : __bswap32_var(conn->epoch));
7756 conn->natMTU = ntohl(conn->natMTU)(__builtin_constant_p(conn->natMTU) ? ((((__uint32_t)(conn
->natMTU)) >> 24) | ((((__uint32_t)(conn->natMTU)
) & (0xff << 16)) >> 8) | ((((__uint32_t)(conn
->natMTU)) & (0xff << 8)) << 8) | (((__uint32_t
)(conn->natMTU)) << 24)) : __bswap32_var(conn->natMTU
));
7757 }
7758#else
7759 afs_int32 rc = -1;
7760#endif
7761 return rc;
7762}
7763
7764afs_int32
7765rx_GetServerPeers(osi_socket socket, afs_uint32 remoteAddr,
7766 afs_uint16 remotePort, afs_int32 * nextPeer,
7767 afs_uint32 debugSupportedValues, struct rx_debugPeer * peer,
7768 afs_uint32 * supportedValues)
7769{
7770#if defined(RXDEBUG1) || defined(MAKEDEBUGCALL)
7771 afs_int32 rc = 0;
7772 struct rx_debugIn in;
7773
7774 /*
7775 * supportedValues is currently unused, but added to allow future
7776 * versioning of this function.
7777 */
7778
7779 *supportedValues = 0;
7780 in.type = htonl(RX_DEBUGI_GETPEER)(__builtin_constant_p(5) ? ((((__uint32_t)(5)) >> 24) |
((((__uint32_t)(5)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(5)) & (0xff << 8)) << 8) | (((
__uint32_t)(5)) << 24)) : __bswap32_var(5));
7781 in.index = htonl(*nextPeer)(__builtin_constant_p(*nextPeer) ? ((((__uint32_t)(*nextPeer)
) >> 24) | ((((__uint32_t)(*nextPeer)) & (0xff <<
16)) >> 8) | ((((__uint32_t)(*nextPeer)) & (0xff <<
8)) << 8) | (((__uint32_t)(*nextPeer)) << 24)) :
__bswap32_var(*nextPeer));
7782 memset(peer, 0, sizeof(*peer));
7783
7784 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG8,
7785 &in, sizeof(in), peer, sizeof(*peer));
7786
7787 if (rc >= 0) {
7788 *nextPeer += 1;
7789
7790 /*
7791 * Do net to host conversion here
7792 * NOTE:
7793 * I don't convert host or port since we are most likely
7794 * going to want these in NBO.
7795 */
7796 peer->ifMTU = ntohs(peer->ifMTU)(__builtin_constant_p(peer->ifMTU) ? (__uint16_t)(((__uint16_t
)(peer->ifMTU)) << 8 | ((__uint16_t)(peer->ifMTU)
) >> 8) : __bswap16_var(peer->ifMTU));
7797 peer->idleWhen = ntohl(peer->idleWhen)(__builtin_constant_p(peer->idleWhen) ? ((((__uint32_t)(peer
->idleWhen)) >> 24) | ((((__uint32_t)(peer->idleWhen
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(peer
->idleWhen)) & (0xff << 8)) << 8) | (((__uint32_t
)(peer->idleWhen)) << 24)) : __bswap32_var(peer->
idleWhen));
7798 peer->refCount = ntohs(peer->refCount)(__builtin_constant_p(peer->refCount) ? (__uint16_t)(((__uint16_t
)(peer->refCount)) << 8 | ((__uint16_t)(peer->refCount
)) >> 8) : __bswap16_var(peer->refCount));
7799 peer->burstWait.sec = ntohl(peer->burstWait.sec)(__builtin_constant_p(peer->burstWait.sec) ? ((((__uint32_t
)(peer->burstWait.sec)) >> 24) | ((((__uint32_t)(peer
->burstWait.sec)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(peer->burstWait.sec)) & (0xff << 8
)) << 8) | (((__uint32_t)(peer->burstWait.sec)) <<
24)) : __bswap32_var(peer->burstWait.sec));
7800 peer->burstWait.usec = ntohl(peer->burstWait.usec)(__builtin_constant_p(peer->burstWait.usec) ? ((((__uint32_t
)(peer->burstWait.usec)) >> 24) | ((((__uint32_t)(peer
->burstWait.usec)) & (0xff << 16)) >> 8) |
((((__uint32_t)(peer->burstWait.usec)) & (0xff <<
8)) << 8) | (((__uint32_t)(peer->burstWait.usec)) <<
24)) : __bswap32_var(peer->burstWait.usec));
7801 peer->rtt = ntohl(peer->rtt)(__builtin_constant_p(peer->rtt) ? ((((__uint32_t)(peer->
rtt)) >> 24) | ((((__uint32_t)(peer->rtt)) & (0xff
<< 16)) >> 8) | ((((__uint32_t)(peer->rtt)) &
(0xff << 8)) << 8) | (((__uint32_t)(peer->rtt
)) << 24)) : __bswap32_var(peer->rtt));
7802 peer->rtt_dev = ntohl(peer->rtt_dev)(__builtin_constant_p(peer->rtt_dev) ? ((((__uint32_t)(peer
->rtt_dev)) >> 24) | ((((__uint32_t)(peer->rtt_dev
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(peer
->rtt_dev)) & (0xff << 8)) << 8) | (((__uint32_t
)(peer->rtt_dev)) << 24)) : __bswap32_var(peer->rtt_dev
));
7803 peer->timeout.sec = 0;
7804 peer->timeout.usec = 0;
7805 peer->nSent = ntohl(peer->nSent)(__builtin_constant_p(peer->nSent) ? ((((__uint32_t)(peer->
nSent)) >> 24) | ((((__uint32_t)(peer->nSent)) &
(0xff << 16)) >> 8) | ((((__uint32_t)(peer->nSent
)) & (0xff << 8)) << 8) | (((__uint32_t)(peer
->nSent)) << 24)) : __bswap32_var(peer->nSent));
7806 peer->reSends = ntohl(peer->reSends)(__builtin_constant_p(peer->reSends) ? ((((__uint32_t)(peer
->reSends)) >> 24) | ((((__uint32_t)(peer->reSends
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(peer
->reSends)) & (0xff << 8)) << 8) | (((__uint32_t
)(peer->reSends)) << 24)) : __bswap32_var(peer->reSends
));
7807 peer->inPacketSkew = ntohl(peer->inPacketSkew)(__builtin_constant_p(peer->inPacketSkew) ? ((((__uint32_t
)(peer->inPacketSkew)) >> 24) | ((((__uint32_t)(peer
->inPacketSkew)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(peer->inPacketSkew)) & (0xff << 8
)) << 8) | (((__uint32_t)(peer->inPacketSkew)) <<
24)) : __bswap32_var(peer->inPacketSkew));
7808 peer->outPacketSkew = ntohl(peer->outPacketSkew)(__builtin_constant_p(peer->outPacketSkew) ? ((((__uint32_t
)(peer->outPacketSkew)) >> 24) | ((((__uint32_t)(peer
->outPacketSkew)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(peer->outPacketSkew)) & (0xff << 8
)) << 8) | (((__uint32_t)(peer->outPacketSkew)) <<
24)) : __bswap32_var(peer->outPacketSkew));
7809 peer->rateFlag = ntohl(peer->rateFlag)(__builtin_constant_p(peer->rateFlag) ? ((((__uint32_t)(peer
->rateFlag)) >> 24) | ((((__uint32_t)(peer->rateFlag
)) & (0xff << 16)) >> 8) | ((((__uint32_t)(peer
->rateFlag)) & (0xff << 8)) << 8) | (((__uint32_t
)(peer->rateFlag)) << 24)) : __bswap32_var(peer->
rateFlag));
7810 peer->natMTU = ntohs(peer->natMTU)(__builtin_constant_p(peer->natMTU) ? (__uint16_t)(((__uint16_t
)(peer->natMTU)) << 8 | ((__uint16_t)(peer->natMTU
)) >> 8) : __bswap16_var(peer->natMTU));
7811 peer->maxMTU = ntohs(peer->maxMTU)(__builtin_constant_p(peer->maxMTU) ? (__uint16_t)(((__uint16_t
)(peer->maxMTU)) << 8 | ((__uint16_t)(peer->maxMTU
)) >> 8) : __bswap16_var(peer->maxMTU));
7812 peer->maxDgramPackets = ntohs(peer->maxDgramPackets)(__builtin_constant_p(peer->maxDgramPackets) ? (__uint16_t
)(((__uint16_t)(peer->maxDgramPackets)) << 8 | ((__uint16_t
)(peer->maxDgramPackets)) >> 8) : __bswap16_var(peer
->maxDgramPackets));
7813 peer->ifDgramPackets = ntohs(peer->ifDgramPackets)(__builtin_constant_p(peer->ifDgramPackets) ? (__uint16_t)
(((__uint16_t)(peer->ifDgramPackets)) << 8 | ((__uint16_t
)(peer->ifDgramPackets)) >> 8) : __bswap16_var(peer->
ifDgramPackets));
7814 peer->MTU = ntohs(peer->MTU)(__builtin_constant_p(peer->MTU) ? (__uint16_t)(((__uint16_t
)(peer->MTU)) << 8 | ((__uint16_t)(peer->MTU)) >>
8) : __bswap16_var(peer->MTU));
7815 peer->cwind = ntohs(peer->cwind)(__builtin_constant_p(peer->cwind) ? (__uint16_t)(((__uint16_t
)(peer->cwind)) << 8 | ((__uint16_t)(peer->cwind)
) >> 8) : __bswap16_var(peer->cwind));
7816 peer->nDgramPackets = ntohs(peer->nDgramPackets)(__builtin_constant_p(peer->nDgramPackets) ? (__uint16_t)(
((__uint16_t)(peer->nDgramPackets)) << 8 | ((__uint16_t
)(peer->nDgramPackets)) >> 8) : __bswap16_var(peer->
nDgramPackets));
7817 peer->congestSeq = ntohs(peer->congestSeq)(__builtin_constant_p(peer->congestSeq) ? (__uint16_t)(((__uint16_t
)(peer->congestSeq)) << 8 | ((__uint16_t)(peer->congestSeq
)) >> 8) : __bswap16_var(peer->congestSeq));
7818 peer->bytesSent.high = ntohl(peer->bytesSent.high)(__builtin_constant_p(peer->bytesSent.high) ? ((((__uint32_t
)(peer->bytesSent.high)) >> 24) | ((((__uint32_t)(peer
->bytesSent.high)) & (0xff << 16)) >> 8) |
((((__uint32_t)(peer->bytesSent.high)) & (0xff <<
8)) << 8) | (((__uint32_t)(peer->bytesSent.high)) <<
24)) : __bswap32_var(peer->bytesSent.high));
7819 peer->bytesSent.low = ntohl(peer->bytesSent.low)(__builtin_constant_p(peer->bytesSent.low) ? ((((__uint32_t
)(peer->bytesSent.low)) >> 24) | ((((__uint32_t)(peer
->bytesSent.low)) & (0xff << 16)) >> 8) | (
(((__uint32_t)(peer->bytesSent.low)) & (0xff << 8
)) << 8) | (((__uint32_t)(peer->bytesSent.low)) <<
24)) : __bswap32_var(peer->bytesSent.low));
7820 peer->bytesReceived.high = ntohl(peer->bytesReceived.high)(__builtin_constant_p(peer->bytesReceived.high) ? ((((__uint32_t
)(peer->bytesReceived.high)) >> 24) | ((((__uint32_t
)(peer->bytesReceived.high)) & (0xff << 16)) >>
8) | ((((__uint32_t)(peer->bytesReceived.high)) & (0xff
<< 8)) << 8) | (((__uint32_t)(peer->bytesReceived
.high)) << 24)) : __bswap32_var(peer->bytesReceived.
high));
7821 peer->bytesReceived.low = ntohl(peer->bytesReceived.low)(__builtin_constant_p(peer->bytesReceived.low) ? ((((__uint32_t
)(peer->bytesReceived.low)) >> 24) | ((((__uint32_t)
(peer->bytesReceived.low)) & (0xff << 16)) >>
8) | ((((__uint32_t)(peer->bytesReceived.low)) & (0xff
<< 8)) << 8) | (((__uint32_t)(peer->bytesReceived
.low)) << 24)) : __bswap32_var(peer->bytesReceived.low
));
7822 }
7823#else
7824 afs_int32 rc = -1;
7825#endif
7826 return rc;
7827}
7828
7829afs_int32
7830rx_GetLocalPeers(afs_uint32 peerHost, afs_uint16 peerPort,
7831 struct rx_debugPeer * peerStats)
7832{
7833 struct rx_peer *tp;
7834 afs_int32 error = 1; /* default to "did not succeed" */
7835 afs_uint32 hashValue = PEER_HASH(peerHost, peerPort)((peerHost ^ peerPort) % rx_hashTableSize);
7836
7837 MUTEX_ENTER(&rx_peerHashTable_lock);
7838 for(tp = rx_peerHashTable[hashValue];
7839 tp != NULL((void *)0); tp = tp->next) {
7840 if (tp->host == peerHost)
7841 break;
7842 }
7843
7844 if (tp) {
7845 tp->refCount++;
7846 MUTEX_EXIT(&rx_peerHashTable_lock);
7847
7848 error = 0;
7849
7850 MUTEX_ENTER(&tp->peer_lock);
7851 peerStats->host = tp->host;
7852 peerStats->port = tp->port;
7853 peerStats->ifMTU = tp->ifMTU;
7854 peerStats->idleWhen = tp->idleWhen;
7855 peerStats->refCount = tp->refCount;
7856 peerStats->burstSize = tp->burstSize;
7857 peerStats->burst = tp->burst;
7858 peerStats->burstWait.sec = tp->burstWait.sec;
7859 peerStats->burstWait.usec = tp->burstWait.usec;
7860 peerStats->rtt = tp->rtt;
7861 peerStats->rtt_dev = tp->rtt_dev;
7862 peerStats->timeout.sec = 0;
7863 peerStats->timeout.usec = 0;
7864 peerStats->nSent = tp->nSent;
7865 peerStats->reSends = tp->reSends;
7866 peerStats->inPacketSkew = tp->inPacketSkew;
7867 peerStats->outPacketSkew = tp->outPacketSkew;
7868 peerStats->rateFlag = tp->rateFlag;
7869 peerStats->natMTU = tp->natMTU;
7870 peerStats->maxMTU = tp->maxMTU;
7871 peerStats->maxDgramPackets = tp->maxDgramPackets;
7872 peerStats->ifDgramPackets = tp->ifDgramPackets;
7873 peerStats->MTU = tp->MTU;
7874 peerStats->cwind = tp->cwind;
7875 peerStats->nDgramPackets = tp->nDgramPackets;
7876 peerStats->congestSeq = tp->congestSeq;
7877 peerStats->bytesSent.high = tp->bytesSent.high;
7878 peerStats->bytesSent.low = tp->bytesSent.low;
7879 peerStats->bytesReceived.high = tp->bytesReceived.high;
7880 peerStats->bytesReceived.low = tp->bytesReceived.low;
7881 MUTEX_EXIT(&tp->peer_lock);
7882
7883 MUTEX_ENTER(&rx_peerHashTable_lock);
7884 tp->refCount--;
7885 }
7886 MUTEX_EXIT(&rx_peerHashTable_lock);
7887
7888 return error;
7889}
7890
7891void
7892shutdown_rx(void)
7893{
7894 struct rx_serverQueueEntry *np;
7895 int i, j;
7896#ifndef KERNEL
7897 struct rx_call *call;
7898 struct rx_serverQueueEntry *sq;
7899#endif /* KERNEL */
7900
7901 LOCK_RX_INIT;
7902 if (rxinit_status == 1) {
7903 UNLOCK_RX_INIT;
7904 return; /* Already shutdown. */
7905 }
7906#ifndef KERNEL
7907 rx_port = 0;
7908#ifndef AFS_PTHREAD_ENV
7909 FD_ZERO(&rx_selectMask)do { fd_set *_p; __size_t _n; _p = (&rx_selectMask); _n =
(((1024U) + (((sizeof(__fd_mask) * 8)) - 1)) / ((sizeof(__fd_mask
) * 8))); while (_n > 0) _p->__fds_bits[--_n] = 0; } while
(0);
7910#endif /* AFS_PTHREAD_ENV */
7911 rxi_dataQuota = RX_MAX_QUOTA15;
7912#ifndef AFS_PTHREAD_ENV
7913 rxi_StopListener();
7914#endif /* AFS_PTHREAD_ENV */
7915 shutdown_rxevent();
7916 rx_SetEpoch(0);
7917#ifndef AFS_PTHREAD_ENV
7918#ifndef AFS_USE_GETTIMEOFDAY1
7919 clock_UnInit();
7920#endif /* AFS_USE_GETTIMEOFDAY */
7921#endif /* AFS_PTHREAD_ENV */
7922
7923 while (!queue_IsEmpty(&rx_freeCallQueue)(((struct rx_queue *)(&rx_freeCallQueue))->next == ((struct
rx_queue *)(&rx_freeCallQueue)))) {
7924 call = queue_First(&rx_freeCallQueue, rx_call)((struct rx_call *)((struct rx_queue *)(&rx_freeCallQueue
))->next);
7925 queue_Remove(call)(((((struct rx_queue *)(call))->prev->next=((struct rx_queue
*)(call))->next)->prev=((struct rx_queue *)(call))->
prev), ((struct rx_queue *)(call))->next = 0);
7926 rxi_Free(call, sizeof(struct rx_call));
7927 }
7928
7929 while (!queue_IsEmpty(&rx_idleServerQueue)(((struct rx_queue *)(&rx_idleServerQueue))->next == (
(struct rx_queue *)(&rx_idleServerQueue)))) {
7930 sq = queue_First(&rx_idleServerQueue, rx_serverQueueEntry)((struct rx_serverQueueEntry *)((struct rx_queue *)(&rx_idleServerQueue
))->next);
7931 queue_Remove(sq)(((((struct rx_queue *)(sq))->prev->next=((struct rx_queue
*)(sq))->next)->prev=((struct rx_queue *)(sq))->prev
), ((struct rx_queue *)(sq))->next = 0);
7932 }
7933#endif /* KERNEL */
7934
7935 {
7936 struct rx_peer **peer_ptr, **peer_end;
7937 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7938 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7939 peer_ptr++) {
7940 struct rx_peer *peer, *next;
7941
7942 MUTEX_ENTER(&rx_peerHashTable_lock);
7943 for (peer = *peer_ptr; peer; peer = next) {
7944 rx_interface_stat_p rpc_stat, nrpc_stat;
7945 size_t space;
7946
7947 MUTEX_ENTER(&rx_rpc_stats);
7948 MUTEX_ENTER(&peer->peer_lock);
7949 for (queue_Scan(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
7950 (&peer->rpcStats, rpc_stat, nrpc_stat,(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
7951 rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)) {
7952 unsigned int num_funcs;
7953 if (!rpc_stat)
7954 break;
7955 queue_Remove(&rpc_stat->queue_header)(((((struct rx_queue *)(&rpc_stat->queue_header))->
prev->next=((struct rx_queue *)(&rpc_stat->queue_header
))->next)->prev=((struct rx_queue *)(&rpc_stat->
queue_header))->prev), ((struct rx_queue *)(&rpc_stat->
queue_header))->next = 0);
7956 queue_Remove(&rpc_stat->all_peers)(((((struct rx_queue *)(&rpc_stat->all_peers))->prev
->next=((struct rx_queue *)(&rpc_stat->all_peers))->
next)->prev=((struct rx_queue *)(&rpc_stat->all_peers
))->prev), ((struct rx_queue *)(&rpc_stat->all_peers
))->next = 0);
7957 num_funcs = rpc_stat->stats[0].func_total;
7958 space =
7959 sizeof(rx_interface_stat_t) +
7960 rpc_stat->stats[0].func_total *
7961 sizeof(rx_function_entry_v1_t);
7962
7963 rxi_Free(rpc_stat, space);
7964
7965 /* rx_rpc_stats must be held */
7966 rxi_rpc_peer_stat_cnt -= num_funcs;
7967 }
7968 MUTEX_EXIT(&peer->peer_lock);
7969 MUTEX_EXIT(&rx_rpc_stats);
7970
7971 next = peer->next;
7972 rxi_FreePeer(peer)rxi_Free(peer, sizeof(struct rx_peer));
7973 if (rx_stats_active)
7974 rx_atomic_dec(&rx_stats.nPeerStructs);
7975 }
7976 MUTEX_EXIT(&rx_peerHashTable_lock);
7977 }
7978 }
7979 for (i = 0; i < RX_MAX_SERVICES20; i++) {
7980 if (rx_services[i])
7981 rxi_Free(rx_services[i], sizeof(*rx_services[i]));
7982 }
7983 for (i = 0; i < rx_hashTableSize; i++) {
7984 struct rx_connection *tc, *ntc;
7985 MUTEX_ENTER(&rx_connHashTable_lock);
7986 for (tc = rx_connHashTable[i]; tc; tc = ntc) {
7987 ntc = tc->next;
7988 for (j = 0; j < RX_MAXCALLS4; j++) {
7989 if (tc->call[j]) {
7990 rxi_Free(tc->call[j], sizeof(*tc->call[j]));
7991 }
7992 }
7993 rxi_Free(tc, sizeof(*tc));
7994 }
7995 MUTEX_EXIT(&rx_connHashTable_lock);
7996 }
7997
7998 MUTEX_ENTER(&freeSQEList_lock);
7999
8000 while ((np = rx_FreeSQEList)) {
8001 rx_FreeSQEList = *(struct rx_serverQueueEntry **)np;
8002 MUTEX_DESTROY(&np->lock);
8003 rxi_Free(np, sizeof(*np));
8004 }
8005
8006 MUTEX_EXIT(&freeSQEList_lock);
8007 MUTEX_DESTROY(&freeSQEList_lock);
8008 MUTEX_DESTROY(&rx_freeCallQueue_lock);
8009 MUTEX_DESTROY(&rx_connHashTable_lock);
8010 MUTEX_DESTROY(&rx_peerHashTable_lock);
8011 MUTEX_DESTROY(&rx_serverPool_lock);
8012
8013 osi_Free(rx_connHashTable,free(rx_connHashTable)
8014 rx_hashTableSize * sizeof(struct rx_connection *))free(rx_connHashTable);
8015 osi_Free(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *))free(rx_peerHashTable);
8016
8017 UNPIN(rx_connHashTable,;
8018 rx_hashTableSize * sizeof(struct rx_connection *));;
8019 UNPIN(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));;
8020
8021 rxi_FreeAllPackets();
8022
8023 MUTEX_ENTER(&rx_quota_mutex);
8024 rxi_dataQuota = RX_MAX_QUOTA15;
8025 rxi_availProcs = rxi_totalMin = rxi_minDeficit = 0;
8026 MUTEX_EXIT(&rx_quota_mutex);
8027 rxinit_status = 1;
8028 UNLOCK_RX_INIT;
8029}
8030
8031#ifdef RX_ENABLE_LOCKS
8032void
8033osirx_AssertMine(afs_kmutex_t * lockaddr, char *msg)
8034{
8035 if (!MUTEX_ISMINE(lockaddr))
8036 osi_Panic("Lock not held: %s", msg);
8037}
8038#endif /* RX_ENABLE_LOCKS */
8039
8040#ifndef KERNEL
8041
8042/*
8043 * Routines to implement connection specific data.
8044 */
8045
8046int
8047rx_KeyCreate(rx_destructor_t rtn)
8048{
8049 int key;
8050 MUTEX_ENTER(&rxi_keyCreate_lock);
8051 key = rxi_keyCreate_counter++;
8052 rxi_keyCreate_destructor = (rx_destructor_t *)
8053 realloc((void *)rxi_keyCreate_destructor,
8054 (key + 1) * sizeof(rx_destructor_t));
8055 rxi_keyCreate_destructor[key] = rtn;
8056 MUTEX_EXIT(&rxi_keyCreate_lock);
8057 return key;
8058}
8059
8060void
8061rx_SetSpecific(struct rx_connection *conn, int key, void *ptr)
8062{
8063 int i;
8064 MUTEX_ENTER(&conn->conn_data_lock);
8065 if (!conn->specific) {
8066 conn->specific = (void **)malloc((key + 1) * sizeof(void *));
8067 for (i = 0; i < key; i++)
8068 conn->specific[i] = NULL((void *)0);
8069 conn->nSpecific = key + 1;
8070 conn->specific[key] = ptr;
8071 } else if (key >= conn->nSpecific) {
8072 conn->specific = (void **)
8073 realloc(conn->specific, (key + 1) * sizeof(void *));
8074 for (i = conn->nSpecific; i < key; i++)
8075 conn->specific[i] = NULL((void *)0);
8076 conn->nSpecific = key + 1;
8077 conn->specific[key] = ptr;
8078 } else {
8079 if (conn->specific[key] && rxi_keyCreate_destructor[key])
8080 (*rxi_keyCreate_destructor[key]) (conn->specific[key]);
8081 conn->specific[key] = ptr;
8082 }
8083 MUTEX_EXIT(&conn->conn_data_lock);
8084}
8085
8086void
8087rx_SetServiceSpecific(struct rx_service *svc, int key, void *ptr)
8088{
8089 int i;
8090 MUTEX_ENTER(&svc->svc_data_lock);
8091 if (!svc->specific) {
8092 svc->specific = (void **)malloc((key + 1) * sizeof(void *));
8093 for (i = 0; i < key; i++)
8094 svc->specific[i] = NULL((void *)0);
8095 svc->nSpecific = key + 1;
8096 svc->specific[key] = ptr;
8097 } else if (key >= svc->nSpecific) {
8098 svc->specific = (void **)
8099 realloc(svc->specific, (key + 1) * sizeof(void *));
8100 for (i = svc->nSpecific; i < key; i++)
8101 svc->specific[i] = NULL((void *)0);
8102 svc->nSpecific = key + 1;
8103 svc->specific[key] = ptr;
8104 } else {
8105 if (svc->specific[key] && rxi_keyCreate_destructor[key])
8106 (*rxi_keyCreate_destructor[key]) (svc->specific[key]);
8107 svc->specific[key] = ptr;
8108 }
8109 MUTEX_EXIT(&svc->svc_data_lock);
8110}
8111
8112void *
8113rx_GetSpecific(struct rx_connection *conn, int key)
8114{
8115 void *ptr;
8116 MUTEX_ENTER(&conn->conn_data_lock);
8117 if (key >= conn->nSpecific)
8118 ptr = NULL((void *)0);
8119 else
8120 ptr = conn->specific[key];
8121 MUTEX_EXIT(&conn->conn_data_lock);
8122 return ptr;
8123}
8124
8125void *
8126rx_GetServiceSpecific(struct rx_service *svc, int key)
8127{
8128 void *ptr;
8129 MUTEX_ENTER(&svc->svc_data_lock);
8130 if (key >= svc->nSpecific)
8131 ptr = NULL((void *)0);
8132 else
8133 ptr = svc->specific[key];
8134 MUTEX_EXIT(&svc->svc_data_lock);
8135 return ptr;
8136}
8137
8138
8139#endif /* !KERNEL */
8140
8141/*
8142 * processStats is a queue used to store the statistics for the local
8143 * process. Its contents are similar to the contents of the rpcStats
8144 * queue on a rx_peer structure, but the actual data stored within
8145 * this queue contains totals across the lifetime of the process (assuming
8146 * the stats have not been reset) - unlike the per peer structures
8147 * which can come and go based upon the peer lifetime.
8148 */
8149
8150static struct rx_queue processStats = { &processStats, &processStats };
8151
8152/*
8153 * peerStats is a queue used to store the statistics for all peer structs.
8154 * Its contents are the union of all the peer rpcStats queues.
8155 */
8156
8157static struct rx_queue peerStats = { &peerStats, &peerStats };
8158
8159/*
8160 * rxi_monitor_processStats is used to turn process wide stat collection
8161 * on and off
8162 */
8163
8164static int rxi_monitor_processStats = 0;
8165
8166/*
8167 * rxi_monitor_peerStats is used to turn per peer stat collection on and off
8168 */
8169
8170static int rxi_monitor_peerStats = 0;
8171
8172/*
8173 * rxi_AddRpcStat - given all of the information for a particular rpc
8174 * call, create (if needed) and update the stat totals for the rpc.
8175 *
8176 * PARAMETERS
8177 *
8178 * IN stats - the queue of stats that will be updated with the new value
8179 *
8180 * IN rxInterface - a unique number that identifies the rpc interface
8181 *
8182 * IN currentFunc - the index of the function being invoked
8183 *
8184 * IN totalFunc - the total number of functions in this interface
8185 *
8186 * IN queueTime - the amount of time this function waited for a thread
8187 *
8188 * IN execTime - the amount of time this function invocation took to execute
8189 *
8190 * IN bytesSent - the number bytes sent by this invocation
8191 *
8192 * IN bytesRcvd - the number bytes received by this invocation
8193 *
8194 * IN isServer - if true, this invocation was made to a server
8195 *
8196 * IN remoteHost - the ip address of the remote host
8197 *
8198 * IN remotePort - the port of the remote host
8199 *
8200 * IN addToPeerList - if != 0, add newly created stat to the global peer list
8201 *
8202 * INOUT counter - if a new stats structure is allocated, the counter will
8203 * be updated with the new number of allocated stat structures
8204 *
8205 * RETURN CODES
8206 *
8207 * Returns void.
8208 */
8209
8210static int
8211rxi_AddRpcStat(struct rx_queue *stats, afs_uint32 rxInterface,
8212 afs_uint32 currentFunc, afs_uint32 totalFunc,
8213 struct clock *queueTime, struct clock *execTime,
8214 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd, int isServer,
8215 afs_uint32 remoteHost, afs_uint32 remotePort,
8216 int addToPeerList, unsigned int *counter)
8217{
8218 int rc = 0;
8219 rx_interface_stat_p rpc_stat, nrpc_stat;
8220
8221 /*
8222 * See if there's already a structure for this interface
8223 */
8224
8225 for (queue_Scan(stats, rpc_stat, nrpc_stat, rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(stats))->next), nrpc_stat = ((struct rx_interface_stat *
)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(stats)) == ((struct rx_queue *)(rpc_stat))); (rpc_stat) =
(nrpc_stat), nrpc_stat = ((struct rx_interface_stat *)((struct
rx_queue *)(rpc_stat))->next)) {
8226 if ((rpc_stat->stats[0].interfaceId == rxInterface)
8227 && (rpc_stat->stats[0].remote_is_server == isServer))
8228 break;
8229 }
8230
8231 /*
8232 * Didn't find a match so allocate a new structure and add it to the
8233 * queue.
8234 */
8235
8236 if (queue_IsEnd(stats, rpc_stat)(((struct rx_queue *)(stats)) == ((struct rx_queue *)(rpc_stat
))) || (rpc_stat == NULL((void *)0))
8237 || (rpc_stat->stats[0].interfaceId != rxInterface)
8238 || (rpc_stat->stats[0].remote_is_server != isServer)) {
8239 int i;
8240 size_t space;
8241
8242 space =
8243 sizeof(rx_interface_stat_t) +
8244 totalFunc * sizeof(rx_function_entry_v1_t);
8245
8246 rpc_stat = rxi_Alloc(space);
8247 if (rpc_stat == NULL((void *)0)) {
8248 rc = 1;
8249 goto fail;
8250 }
8251 *counter += totalFunc;
8252 for (i = 0; i < totalFunc; i++) {
8253 rpc_stat->stats[i].remote_peer = remoteHost;
8254 rpc_stat->stats[i].remote_port = remotePort;
8255 rpc_stat->stats[i].remote_is_server = isServer;
8256 rpc_stat->stats[i].interfaceId = rxInterface;
8257 rpc_stat->stats[i].func_total = totalFunc;
8258 rpc_stat->stats[i].func_index = i;
8259 hzero(rpc_stat->stats[i].invocations)((rpc_stat->stats[i].invocations).low = 0, (rpc_stat->stats
[i].invocations).high = 0);
8260 hzero(rpc_stat->stats[i].bytes_sent)((rpc_stat->stats[i].bytes_sent).low = 0, (rpc_stat->stats
[i].bytes_sent).high = 0);
8261 hzero(rpc_stat->stats[i].bytes_rcvd)((rpc_stat->stats[i].bytes_rcvd).low = 0, (rpc_stat->stats
[i].bytes_rcvd).high = 0);
8262 rpc_stat->stats[i].queue_time_sum.sec = 0;
8263 rpc_stat->stats[i].queue_time_sum.usec = 0;
8264 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
8265 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
8266 rpc_stat->stats[i].queue_time_min.sec = 9999999;
8267 rpc_stat->stats[i].queue_time_min.usec = 9999999;
8268 rpc_stat->stats[i].queue_time_max.sec = 0;
8269 rpc_stat->stats[i].queue_time_max.usec = 0;
8270 rpc_stat->stats[i].execution_time_sum.sec = 0;
8271 rpc_stat->stats[i].execution_time_sum.usec = 0;
8272 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
8273 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
8274 rpc_stat->stats[i].execution_time_min.sec = 9999999;
8275 rpc_stat->stats[i].execution_time_min.usec = 9999999;
8276 rpc_stat->stats[i].execution_time_max.sec = 0;
8277 rpc_stat->stats[i].execution_time_max.usec = 0;
8278 }
8279 queue_Prepend(stats, rpc_stat)(((((struct rx_queue *)(rpc_stat))->next=((struct rx_queue
*)(stats))->next)->prev=((struct rx_queue *)(rpc_stat)
))->prev=((struct rx_queue *)(stats)), ((struct rx_queue *
)(stats))->next=((struct rx_queue *)(rpc_stat)));
8280 if (addToPeerList) {
8281 queue_Prepend(&peerStats, &rpc_stat->all_peers)(((((struct rx_queue *)(&rpc_stat->all_peers))->next
=((struct rx_queue *)(&peerStats))->next)->prev=((struct
rx_queue *)(&rpc_stat->all_peers)))->prev=((struct
rx_queue *)(&peerStats)), ((struct rx_queue *)(&peerStats
))->next=((struct rx_queue *)(&rpc_stat->all_peers)
));
8282 }
8283 }
8284
8285 /*
8286 * Increment the stats for this function
8287 */
8288
8289 hadd32(rpc_stat->stats[currentFunc].invocations, 1)((void)((((rpc_stat->stats[currentFunc].invocations).low ^
(int)(1)) & 0x80000000) ? (((((rpc_stat->stats[currentFunc
].invocations).low + (int)(1)) & 0x80000000) == 0) &&
(rpc_stat->stats[currentFunc].invocations).high++) : (((rpc_stat
->stats[currentFunc].invocations).low & (int)(1) &
0x80000000) && (rpc_stat->stats[currentFunc].invocations
).high++)), (rpc_stat->stats[currentFunc].invocations).low
+= (int)(1));
8290 hadd(rpc_stat->stats[currentFunc].bytes_sent, *bytesSent)(((void)((((rpc_stat->stats[currentFunc].bytes_sent).low ^
(int)((*bytesSent).low)) & 0x80000000) ? (((((rpc_stat->
stats[currentFunc].bytes_sent).low + (int)((*bytesSent).low))
& 0x80000000) == 0) && (rpc_stat->stats[currentFunc
].bytes_sent).high++) : (((rpc_stat->stats[currentFunc].bytes_sent
).low & (int)((*bytesSent).low) & 0x80000000) &&
(rpc_stat->stats[currentFunc].bytes_sent).high++)), (rpc_stat
->stats[currentFunc].bytes_sent).low += (int)((*bytesSent)
.low)), (rpc_stat->stats[currentFunc].bytes_sent).high += (
*bytesSent).high);
8291 hadd(rpc_stat->stats[currentFunc].bytes_rcvd, *bytesRcvd)(((void)((((rpc_stat->stats[currentFunc].bytes_rcvd).low ^
(int)((*bytesRcvd).low)) & 0x80000000) ? (((((rpc_stat->
stats[currentFunc].bytes_rcvd).low + (int)((*bytesRcvd).low))
& 0x80000000) == 0) && (rpc_stat->stats[currentFunc
].bytes_rcvd).high++) : (((rpc_stat->stats[currentFunc].bytes_rcvd
).low & (int)((*bytesRcvd).low) & 0x80000000) &&
(rpc_stat->stats[currentFunc].bytes_rcvd).high++)), (rpc_stat
->stats[currentFunc].bytes_rcvd).low += (int)((*bytesRcvd)
.low)), (rpc_stat->stats[currentFunc].bytes_rcvd).high += (
*bytesRcvd).high);
8292 clock_Add(&rpc_stat->stats[currentFunc].queue_time_sum, queueTime)do { (&rpc_stat->stats[currentFunc].queue_time_sum)->
sec += (queueTime)->sec; if (((&rpc_stat->stats[currentFunc
].queue_time_sum)->usec += (queueTime)->usec) >= 1000000
) { (&rpc_stat->stats[currentFunc].queue_time_sum)->
usec -= 1000000; (&rpc_stat->stats[currentFunc].queue_time_sum
)->sec++; } } while(0);
8293 clock_AddSq(&rpc_stat->stats[currentFunc].queue_time_sum_sqr, queueTime)do { if((queueTime)->sec > 0 ) { (&rpc_stat->stats
[currentFunc].queue_time_sum_sqr)->sec += (queueTime)->
sec * (queueTime)->sec + 2 * (queueTime)->sec * (queueTime
)->usec /1000000; (&rpc_stat->stats[currentFunc].queue_time_sum_sqr
)->usec += (2 * (queueTime)->sec * (queueTime)->usec
) % 1000000 + ((queueTime)->usec / 1000)*((queueTime)->
usec / 1000) + 2 * ((queueTime)->usec / 1000) * ((queueTime
)->usec % 1000) / 1000 + ((((queueTime)->usec % 1000) >
707) ? 1 : 0); } else { (&rpc_stat->stats[currentFunc
].queue_time_sum_sqr)->usec += ((queueTime)->usec / 1000
)*((queueTime)->usec / 1000) + 2 * ((queueTime)->usec /
1000) * ((queueTime)->usec % 1000) / 1000 + ((((queueTime
)->usec % 1000) > 707) ? 1 : 0); } if ((&rpc_stat->
stats[currentFunc].queue_time_sum_sqr)->usec > 1000000)
{ (&rpc_stat->stats[currentFunc].queue_time_sum_sqr)->
usec -= 1000000; (&rpc_stat->stats[currentFunc].queue_time_sum_sqr
)->sec++; } } while(0);
8294 if (clock_Lt(queueTime, &rpc_stat->stats[currentFunc].queue_time_min)((queueTime)->sec<(&rpc_stat->stats[currentFunc]
.queue_time_min)->sec || ((queueTime)->sec==(&rpc_stat
->stats[currentFunc].queue_time_min)->sec && (queueTime
)->usec<(&rpc_stat->stats[currentFunc].queue_time_min
)->usec))) {
8295 rpc_stat->stats[currentFunc].queue_time_min = *queueTime;
8296 }
8297 if (clock_Gt(queueTime, &rpc_stat->stats[currentFunc].queue_time_max)((queueTime)->sec>(&rpc_stat->stats[currentFunc]
.queue_time_max)->sec || ((queueTime)->sec==(&rpc_stat
->stats[currentFunc].queue_time_max)->sec && (queueTime
)->usec>(&rpc_stat->stats[currentFunc].queue_time_max
)->usec))) {
8298 rpc_stat->stats[currentFunc].queue_time_max = *queueTime;
8299 }
8300 clock_Add(&rpc_stat->stats[currentFunc].execution_time_sum, execTime)do { (&rpc_stat->stats[currentFunc].execution_time_sum
)->sec += (execTime)->sec; if (((&rpc_stat->stats
[currentFunc].execution_time_sum)->usec += (execTime)->
usec) >= 1000000) { (&rpc_stat->stats[currentFunc].
execution_time_sum)->usec -= 1000000; (&rpc_stat->stats
[currentFunc].execution_time_sum)->sec++; } } while(0);
8301 clock_AddSq(&rpc_stat->stats[currentFunc].execution_time_sum_sqr,do { if((execTime)->sec > 0 ) { (&rpc_stat->stats
[currentFunc].execution_time_sum_sqr)->sec += (execTime)->
sec * (execTime)->sec + 2 * (execTime)->sec * (execTime
)->usec /1000000; (&rpc_stat->stats[currentFunc].execution_time_sum_sqr
)->usec += (2 * (execTime)->sec * (execTime)->usec) %
1000000 + ((execTime)->usec / 1000)*((execTime)->usec /
1000) + 2 * ((execTime)->usec / 1000) * ((execTime)->usec
% 1000) / 1000 + ((((execTime)->usec % 1000) > 707) ? 1
: 0); } else { (&rpc_stat->stats[currentFunc].execution_time_sum_sqr
)->usec += ((execTime)->usec / 1000)*((execTime)->usec
/ 1000) + 2 * ((execTime)->usec / 1000) * ((execTime)->
usec % 1000) / 1000 + ((((execTime)->usec % 1000) > 707
) ? 1 : 0); } if ((&rpc_stat->stats[currentFunc].execution_time_sum_sqr
)->usec > 1000000) { (&rpc_stat->stats[currentFunc
].execution_time_sum_sqr)->usec -= 1000000; (&rpc_stat
->stats[currentFunc].execution_time_sum_sqr)->sec++; } }
while(0)
8302 execTime)do { if((execTime)->sec > 0 ) { (&rpc_stat->stats
[currentFunc].execution_time_sum_sqr)->sec += (execTime)->
sec * (execTime)->sec + 2 * (execTime)->sec * (execTime
)->usec /1000000; (&rpc_stat->stats[currentFunc].execution_time_sum_sqr
)->usec += (2 * (execTime)->sec * (execTime)->usec) %
1000000 + ((execTime)->usec / 1000)*((execTime)->usec /
1000) + 2 * ((execTime)->usec / 1000) * ((execTime)->usec
% 1000) / 1000 + ((((execTime)->usec % 1000) > 707) ? 1
: 0); } else { (&rpc_stat->stats[currentFunc].execution_time_sum_sqr
)->usec += ((execTime)->usec / 1000)*((execTime)->usec
/ 1000) + 2 * ((execTime)->usec / 1000) * ((execTime)->
usec % 1000) / 1000 + ((((execTime)->usec % 1000) > 707
) ? 1 : 0); } if ((&rpc_stat->stats[currentFunc].execution_time_sum_sqr
)->usec > 1000000) { (&rpc_stat->stats[currentFunc
].execution_time_sum_sqr)->usec -= 1000000; (&rpc_stat
->stats[currentFunc].execution_time_sum_sqr)->sec++; } }
while(0);
8303 if (clock_Lt(execTime, &rpc_stat->stats[currentFunc].execution_time_min)((execTime)->sec<(&rpc_stat->stats[currentFunc].
execution_time_min)->sec || ((execTime)->sec==(&rpc_stat
->stats[currentFunc].execution_time_min)->sec &&
(execTime)->usec<(&rpc_stat->stats[currentFunc]
.execution_time_min)->usec))) {
8304 rpc_stat->stats[currentFunc].execution_time_min = *execTime;
8305 }
8306 if (clock_Gt(execTime, &rpc_stat->stats[currentFunc].execution_time_max)((execTime)->sec>(&rpc_stat->stats[currentFunc].
execution_time_max)->sec || ((execTime)->sec==(&rpc_stat
->stats[currentFunc].execution_time_max)->sec &&
(execTime)->usec>(&rpc_stat->stats[currentFunc]
.execution_time_max)->usec))) {
8307 rpc_stat->stats[currentFunc].execution_time_max = *execTime;
8308 }
8309
8310 fail:
8311 return rc;
8312}
8313
8314/*
8315 * rx_IncrementTimeAndCount - increment the times and count for a particular
8316 * rpc function.
8317 *
8318 * PARAMETERS
8319 *
8320 * IN peer - the peer who invoked the rpc
8321 *
8322 * IN rxInterface - a unique number that identifies the rpc interface
8323 *
8324 * IN currentFunc - the index of the function being invoked
8325 *
8326 * IN totalFunc - the total number of functions in this interface
8327 *
8328 * IN queueTime - the amount of time this function waited for a thread
8329 *
8330 * IN execTime - the amount of time this function invocation took to execute
8331 *
8332 * IN bytesSent - the number bytes sent by this invocation
8333 *
8334 * IN bytesRcvd - the number bytes received by this invocation
8335 *
8336 * IN isServer - if true, this invocation was made to a server
8337 *
8338 * RETURN CODES
8339 *
8340 * Returns void.
8341 */
8342
8343void
8344rx_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8345 afs_uint32 currentFunc, afs_uint32 totalFunc,
8346 struct clock *queueTime, struct clock *execTime,
8347 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd,
8348 int isServer)
8349{
8350
8351 if (!(rxi_monitor_peerStats || rxi_monitor_processStats))
8352 return;
8353
8354 MUTEX_ENTER(&rx_rpc_stats);
8355
8356 if (rxi_monitor_peerStats) {
8357 MUTEX_ENTER(&peer->peer_lock);
8358 rxi_AddRpcStat(&peer->rpcStats, rxInterface, currentFunc, totalFunc,
8359 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8360 peer->host, peer->port, 1, &rxi_rpc_peer_stat_cnt);
8361 MUTEX_EXIT(&peer->peer_lock);
8362 }
8363
8364 if (rxi_monitor_processStats) {
8365 rxi_AddRpcStat(&processStats, rxInterface, currentFunc, totalFunc,
8366 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8367 0xffffffff, 0xffffffff, 0, &rxi_rpc_process_stat_cnt);
8368 }
8369
8370 MUTEX_EXIT(&rx_rpc_stats);
8371
8372}
8373
8374/*
8375 * rx_MarshallProcessRPCStats - marshall an array of rpc statistics
8376 *
8377 * PARAMETERS
8378 *
8379 * IN callerVersion - the rpc stat version of the caller.
8380 *
8381 * IN count - the number of entries to marshall.
8382 *
8383 * IN stats - pointer to stats to be marshalled.
8384 *
8385 * OUT ptr - Where to store the marshalled data.
8386 *
8387 * RETURN CODES
8388 *
8389 * Returns void.
8390 */
8391void
8392rx_MarshallProcessRPCStats(afs_uint32 callerVersion, int count,
8393 rx_function_entry_v1_t * stats, afs_uint32 ** ptrP)
8394{
8395 int i;
8396 afs_uint32 *ptr;
8397
8398 /*
8399 * We only support the first version
8400 */
8401 for (ptr = *ptrP, i = 0; i < count; i++, stats++) {
8402 *(ptr++) = stats->remote_peer;
8403 *(ptr++) = stats->remote_port;
8404 *(ptr++) = stats->remote_is_server;
8405 *(ptr++) = stats->interfaceId;
8406 *(ptr++) = stats->func_total;
8407 *(ptr++) = stats->func_index;
8408 *(ptr++) = hgethi(stats->invocations)((stats->invocations).high);
8409 *(ptr++) = hgetlo(stats->invocations)((stats->invocations).low);
8410 *(ptr++) = hgethi(stats->bytes_sent)((stats->bytes_sent).high);
8411 *(ptr++) = hgetlo(stats->bytes_sent)((stats->bytes_sent).low);
8412 *(ptr++) = hgethi(stats->bytes_rcvd)((stats->bytes_rcvd).high);
8413 *(ptr++) = hgetlo(stats->bytes_rcvd)((stats->bytes_rcvd).low);
8414 *(ptr++) = stats->queue_time_sum.sec;
8415 *(ptr++) = stats->queue_time_sum.usec;
8416 *(ptr++) = stats->queue_time_sum_sqr.sec;
8417 *(ptr++) = stats->queue_time_sum_sqr.usec;
8418 *(ptr++) = stats->queue_time_min.sec;
8419 *(ptr++) = stats->queue_time_min.usec;
8420 *(ptr++) = stats->queue_time_max.sec;
8421 *(ptr++) = stats->queue_time_max.usec;
8422 *(ptr++) = stats->execution_time_sum.sec;
8423 *(ptr++) = stats->execution_time_sum.usec;
8424 *(ptr++) = stats->execution_time_sum_sqr.sec;
8425 *(ptr++) = stats->execution_time_sum_sqr.usec;
8426 *(ptr++) = stats->execution_time_min.sec;
8427 *(ptr++) = stats->execution_time_min.usec;
8428 *(ptr++) = stats->execution_time_max.sec;
8429 *(ptr++) = stats->execution_time_max.usec;
8430 }
8431 *ptrP = ptr;
8432}
8433
8434/*
8435 * rx_RetrieveProcessRPCStats - retrieve all of the rpc statistics for
8436 * this process
8437 *
8438 * PARAMETERS
8439 *
8440 * IN callerVersion - the rpc stat version of the caller
8441 *
8442 * OUT myVersion - the rpc stat version of this function
8443 *
8444 * OUT clock_sec - local time seconds
8445 *
8446 * OUT clock_usec - local time microseconds
8447 *
8448 * OUT allocSize - the number of bytes allocated to contain stats
8449 *
8450 * OUT statCount - the number stats retrieved from this process.
8451 *
8452 * OUT stats - the actual stats retrieved from this process.
8453 *
8454 * RETURN CODES
8455 *
8456 * Returns void. If successful, stats will != NULL.
8457 */
8458
8459int
8460rx_RetrieveProcessRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8461 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8462 size_t * allocSize, afs_uint32 * statCount,
8463 afs_uint32 ** stats)
8464{
8465 size_t space = 0;
8466 afs_uint32 *ptr;
8467 struct clock now;
8468 int rc = 0;
8469
8470 *stats = 0;
8471 *allocSize = 0;
8472 *statCount = 0;
8473 *myVersion = RX_STATS_RETRIEVAL_VERSION1;
8474
8475 /*
8476 * Check to see if stats are enabled
8477 */
8478
8479 MUTEX_ENTER(&rx_rpc_stats);
8480 if (!rxi_monitor_processStats) {
8481 MUTEX_EXIT(&rx_rpc_stats);
8482 return rc;
8483 }
8484
8485 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
8486 *clock_sec = now.sec;
8487 *clock_usec = now.usec;
8488
8489 /*
8490 * Allocate the space based upon the caller version
8491 *
8492 * If the client is at an older version than we are,
8493 * we return the statistic data in the older data format, but
8494 * we still return our version number so the client knows we
8495 * are maintaining more data than it can retrieve.
8496 */
8497
8498 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION1) {
8499 space = rxi_rpc_process_stat_cnt * sizeof(rx_function_entry_v1_t);
8500 *statCount = rxi_rpc_process_stat_cnt;
8501 } else {
8502 /*
8503 * This can't happen yet, but in the future version changes
8504 * can be handled by adding additional code here
8505 */
8506 }
8507
8508 if (space > (size_t) 0) {
8509 *allocSize = space;
8510 ptr = *stats = rxi_Alloc(space);
8511
8512 if (ptr != NULL((void *)0)) {
8513 rx_interface_stat_p rpc_stat, nrpc_stat;
8514
8515
8516 for (queue_Scan(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&processStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&processStats)) == ((struct rx_queue *)(rpc_stat))); (
rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
8517 (&processStats, rpc_stat, nrpc_stat, rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&processStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&processStats)) == ((struct rx_queue *)(rpc_stat))); (
rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)) {
8518 /*
8519 * Copy the data based upon the caller version
8520 */
8521 rx_MarshallProcessRPCStats(callerVersion,
8522 rpc_stat->stats[0].func_total,
8523 rpc_stat->stats, &ptr);
8524 }
8525 } else {
8526 rc = ENOMEM12;
8527 }
8528 }
8529 MUTEX_EXIT(&rx_rpc_stats);
8530 return rc;
8531}
8532
8533/*
8534 * rx_RetrievePeerRPCStats - retrieve all of the rpc statistics for the peers
8535 *
8536 * PARAMETERS
8537 *
8538 * IN callerVersion - the rpc stat version of the caller
8539 *
8540 * OUT myVersion - the rpc stat version of this function
8541 *
8542 * OUT clock_sec - local time seconds
8543 *
8544 * OUT clock_usec - local time microseconds
8545 *
8546 * OUT allocSize - the number of bytes allocated to contain stats
8547 *
8548 * OUT statCount - the number of stats retrieved from the individual
8549 * peer structures.
8550 *
8551 * OUT stats - the actual stats retrieved from the individual peer structures.
8552 *
8553 * RETURN CODES
8554 *
8555 * Returns void. If successful, stats will != NULL.
8556 */
8557
8558int
8559rx_RetrievePeerRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8560 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8561 size_t * allocSize, afs_uint32 * statCount,
8562 afs_uint32 ** stats)
8563{
8564 size_t space = 0;
8565 afs_uint32 *ptr;
8566 struct clock now;
8567 int rc = 0;
8568
8569 *stats = 0;
8570 *statCount = 0;
8571 *allocSize = 0;
8572 *myVersion = RX_STATS_RETRIEVAL_VERSION1;
8573
8574 /*
8575 * Check to see if stats are enabled
8576 */
8577
8578 MUTEX_ENTER(&rx_rpc_stats);
8579 if (!rxi_monitor_peerStats) {
8580 MUTEX_EXIT(&rx_rpc_stats);
8581 return rc;
8582 }
8583
8584 clock_GetTime(&now)do { struct timeval tv; gettimeofday(&tv, ((void *)0)); (
&now)->sec = (afs_int32)tv.tv_sec; (&now)->usec
= (afs_int32)tv.tv_usec; } while(0);
8585 *clock_sec = now.sec;
8586 *clock_usec = now.usec;
8587
8588 /*
8589 * Allocate the space based upon the caller version
8590 *
8591 * If the client is at an older version than we are,
8592 * we return the statistic data in the older data format, but
8593 * we still return our version number so the client knows we
8594 * are maintaining more data than it can retrieve.
8595 */
8596
8597 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION1) {
8598 space = rxi_rpc_peer_stat_cnt * sizeof(rx_function_entry_v1_t);
8599 *statCount = rxi_rpc_peer_stat_cnt;
8600 } else {
8601 /*
8602 * This can't happen yet, but in the future version changes
8603 * can be handled by adding additional code here
8604 */
8605 }
8606
8607 if (space > (size_t) 0) {
8608 *allocSize = space;
8609 ptr = *stats = rxi_Alloc(space);
8610
8611 if (ptr != NULL((void *)0)) {
8612 rx_interface_stat_p rpc_stat, nrpc_stat;
8613 char *fix_offset;
8614
8615 for (queue_Scan(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peerStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peerStats)) == ((struct rx_queue *)(rpc_stat))); (rpc_stat
) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat *)((struct
rx_queue *)(rpc_stat))->next)
8616 (&peerStats, rpc_stat, nrpc_stat, rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peerStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peerStats)) == ((struct rx_queue *)(rpc_stat))); (rpc_stat
) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat *)((struct
rx_queue *)(rpc_stat))->next)) {
8617 /*
8618 * We have to fix the offset of rpc_stat since we are
8619 * keeping this structure on two rx_queues. The rx_queue
8620 * package assumes that the rx_queue member is the first
8621 * member of the structure. That is, rx_queue assumes that
8622 * any one item is only on one queue at a time. We are
8623 * breaking that assumption and so we have to do a little
8624 * math to fix our pointers.
8625 */
8626
8627 fix_offset = (char *)rpc_stat;
8628 fix_offset -= offsetof(rx_interface_stat_t, all_peers)__builtin_offsetof(rx_interface_stat_t, all_peers);
8629 rpc_stat = (rx_interface_stat_p) fix_offset;
8630
8631 /*
8632 * Copy the data based upon the caller version
8633 */
8634 rx_MarshallProcessRPCStats(callerVersion,
8635 rpc_stat->stats[0].func_total,
8636 rpc_stat->stats, &ptr);
8637 }
8638 } else {
8639 rc = ENOMEM12;
8640 }
8641 }
8642 MUTEX_EXIT(&rx_rpc_stats);
8643 return rc;
8644}
8645
8646/*
8647 * rx_FreeRPCStats - free memory allocated by
8648 * rx_RetrieveProcessRPCStats and rx_RetrievePeerRPCStats
8649 *
8650 * PARAMETERS
8651 *
8652 * IN stats - stats previously returned by rx_RetrieveProcessRPCStats or
8653 * rx_RetrievePeerRPCStats
8654 *
8655 * IN allocSize - the number of bytes in stats.
8656 *
8657 * RETURN CODES
8658 *
8659 * Returns void.
8660 */
8661
8662void
8663rx_FreeRPCStats(afs_uint32 * stats, size_t allocSize)
8664{
8665 rxi_Free(stats, allocSize);
8666}
8667
8668/*
8669 * rx_queryProcessRPCStats - see if process rpc stat collection is
8670 * currently enabled.
8671 *
8672 * PARAMETERS
8673 *
8674 * RETURN CODES
8675 *
8676 * Returns 0 if stats are not enabled != 0 otherwise
8677 */
8678
8679int
8680rx_queryProcessRPCStats(void)
8681{
8682 int rc;
8683 MUTEX_ENTER(&rx_rpc_stats);
8684 rc = rxi_monitor_processStats;
8685 MUTEX_EXIT(&rx_rpc_stats);
8686 return rc;
8687}
8688
8689/*
8690 * rx_queryPeerRPCStats - see if peer stat collection is currently enabled.
8691 *
8692 * PARAMETERS
8693 *
8694 * RETURN CODES
8695 *
8696 * Returns 0 if stats are not enabled != 0 otherwise
8697 */
8698
8699int
8700rx_queryPeerRPCStats(void)
8701{
8702 int rc;
8703 MUTEX_ENTER(&rx_rpc_stats);
8704 rc = rxi_monitor_peerStats;
8705 MUTEX_EXIT(&rx_rpc_stats);
8706 return rc;
8707}
8708
8709/*
8710 * rx_enableProcessRPCStats - begin rpc stat collection for entire process
8711 *
8712 * PARAMETERS
8713 *
8714 * RETURN CODES
8715 *
8716 * Returns void.
8717 */
8718
8719void
8720rx_enableProcessRPCStats(void)
8721{
8722 MUTEX_ENTER(&rx_rpc_stats);
8723 rx_enable_stats = 1;
8724 rxi_monitor_processStats = 1;
8725 MUTEX_EXIT(&rx_rpc_stats);
8726}
8727
8728/*
8729 * rx_enablePeerRPCStats - begin rpc stat collection per peer structure
8730 *
8731 * PARAMETERS
8732 *
8733 * RETURN CODES
8734 *
8735 * Returns void.
8736 */
8737
8738void
8739rx_enablePeerRPCStats(void)
8740{
8741 MUTEX_ENTER(&rx_rpc_stats);
8742 rx_enable_stats = 1;
8743 rxi_monitor_peerStats = 1;
8744 MUTEX_EXIT(&rx_rpc_stats);
8745}
8746
8747/*
8748 * rx_disableProcessRPCStats - stop rpc stat collection for entire process
8749 *
8750 * PARAMETERS
8751 *
8752 * RETURN CODES
8753 *
8754 * Returns void.
8755 */
8756
8757void
8758rx_disableProcessRPCStats(void)
8759{
8760 rx_interface_stat_p rpc_stat, nrpc_stat;
8761 size_t space;
8762
8763 MUTEX_ENTER(&rx_rpc_stats);
8764
8765 /*
8766 * Turn off process statistics and if peer stats is also off, turn
8767 * off everything
8768 */
8769
8770 rxi_monitor_processStats = 0;
8771 if (rxi_monitor_peerStats == 0) {
8772 rx_enable_stats = 0;
8773 }
8774
8775 for (queue_Scan(&processStats, rpc_stat, nrpc_stat, rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&processStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&processStats)) == ((struct rx_queue *)(rpc_stat))); (
rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)) {
8776 unsigned int num_funcs = 0;
8777 if (!rpc_stat)
8778 break;
8779 queue_Remove(rpc_stat)(((((struct rx_queue *)(rpc_stat))->prev->next=((struct
rx_queue *)(rpc_stat))->next)->prev=((struct rx_queue *
)(rpc_stat))->prev), ((struct rx_queue *)(rpc_stat))->next
= 0);
8780 num_funcs = rpc_stat->stats[0].func_total;
8781 space =
8782 sizeof(rx_interface_stat_t) +
8783 rpc_stat->stats[0].func_total * sizeof(rx_function_entry_v1_t);
8784
8785 rxi_Free(rpc_stat, space);
8786 rxi_rpc_process_stat_cnt -= num_funcs;
8787 }
8788 MUTEX_EXIT(&rx_rpc_stats);
8789}
8790
8791/*
8792 * rx_disablePeerRPCStats - stop rpc stat collection for peers
8793 *
8794 * PARAMETERS
8795 *
8796 * RETURN CODES
8797 *
8798 * Returns void.
8799 */
8800
8801void
8802rx_disablePeerRPCStats(void)
8803{
8804 struct rx_peer **peer_ptr, **peer_end;
8805 int code;
8806
8807 /*
8808 * Turn off peer statistics and if process stats is also off, turn
8809 * off everything
8810 */
8811
8812 rxi_monitor_peerStats = 0;
8813 if (rxi_monitor_processStats == 0) {
8814 rx_enable_stats = 0;
8815 }
8816
8817 for (peer_ptr = &rx_peerHashTable[0], peer_end =
8818 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
8819 peer_ptr++) {
8820 struct rx_peer *peer, *next, *prev;
8821
8822 MUTEX_ENTER(&rx_peerHashTable_lock);
8823 MUTEX_ENTER(&rx_rpc_stats);
8824 for (prev = peer = *peer_ptr; peer; peer = next) {
8825 next = peer->next;
8826 code = MUTEX_TRYENTER(&peer->peer_lock)1;
8827 if (code) {
8828 rx_interface_stat_p rpc_stat, nrpc_stat;
8829 size_t space;
8830
8831 if (prev == *peer_ptr) {
8832 *peer_ptr = next;
8833 prev = next;
8834 } else
8835 prev->next = next;
8836
8837 if (next)
8838 next->refCount++;
8839 if (prev)
8840 prev->refCount++;
8841 peer->refCount++;
8842 MUTEX_EXIT(&rx_peerHashTable_lock);
8843
8844 for (queue_Scan(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
8845 (&peer->rpcStats, rpc_stat, nrpc_stat,(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)
8846 rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peer->rpcStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peer->rpcStats)) == ((struct rx_queue *)(rpc_stat
))); (rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)) {
8847 unsigned int num_funcs = 0;
8848 if (!rpc_stat)
8849 break;
8850 queue_Remove(&rpc_stat->queue_header)(((((struct rx_queue *)(&rpc_stat->queue_header))->
prev->next=((struct rx_queue *)(&rpc_stat->queue_header
))->next)->prev=((struct rx_queue *)(&rpc_stat->
queue_header))->prev), ((struct rx_queue *)(&rpc_stat->
queue_header))->next = 0);
8851 queue_Remove(&rpc_stat->all_peers)(((((struct rx_queue *)(&rpc_stat->all_peers))->prev
->next=((struct rx_queue *)(&rpc_stat->all_peers))->
next)->prev=((struct rx_queue *)(&rpc_stat->all_peers
))->prev), ((struct rx_queue *)(&rpc_stat->all_peers
))->next = 0);
8852 num_funcs = rpc_stat->stats[0].func_total;
8853 space =
8854 sizeof(rx_interface_stat_t) +
8855 rpc_stat->stats[0].func_total *
8856 sizeof(rx_function_entry_v1_t);
8857
8858 rxi_Free(rpc_stat, space);
8859 rxi_rpc_peer_stat_cnt -= num_funcs;
8860 }
8861 MUTEX_EXIT(&peer->peer_lock);
8862
8863 MUTEX_ENTER(&rx_peerHashTable_lock);
8864 if (next)
8865 next->refCount--;
8866 if (prev)
8867 prev->refCount--;
8868 peer->refCount--;
8869 } else {
8870 prev = peer;
8871 }
8872 }
8873 MUTEX_EXIT(&rx_rpc_stats);
8874 MUTEX_EXIT(&rx_peerHashTable_lock);
8875 }
8876}
8877
8878/*
8879 * rx_clearProcessRPCStats - clear the contents of the rpc stats according
8880 * to clearFlag
8881 *
8882 * PARAMETERS
8883 *
8884 * IN clearFlag - flag indicating which stats to clear
8885 *
8886 * RETURN CODES
8887 *
8888 * Returns void.
8889 */
8890
8891void
8892rx_clearProcessRPCStats(afs_uint32 clearFlag)
8893{
8894 rx_interface_stat_p rpc_stat, nrpc_stat;
8895
8896 MUTEX_ENTER(&rx_rpc_stats);
8897
8898 for (queue_Scan(&processStats, rpc_stat, nrpc_stat, rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&processStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&processStats)) == ((struct rx_queue *)(rpc_stat))); (
rpc_stat) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next)) {
8899 unsigned int num_funcs = 0, i;
8900 num_funcs = rpc_stat->stats[0].func_total;
8901 for (i = 0; i < num_funcs; i++) {
8902 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS0x1) {
8903 hzero(rpc_stat->stats[i].invocations)((rpc_stat->stats[i].invocations).low = 0, (rpc_stat->stats
[i].invocations).high = 0);
8904 }
8905 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT0x2) {
8906 hzero(rpc_stat->stats[i].bytes_sent)((rpc_stat->stats[i].bytes_sent).low = 0, (rpc_stat->stats
[i].bytes_sent).high = 0);
8907 }
8908 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD0x4) {
8909 hzero(rpc_stat->stats[i].bytes_rcvd)((rpc_stat->stats[i].bytes_rcvd).low = 0, (rpc_stat->stats
[i].bytes_rcvd).high = 0);
8910 }
8911 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM0x8) {
8912 rpc_stat->stats[i].queue_time_sum.sec = 0;
8913 rpc_stat->stats[i].queue_time_sum.usec = 0;
8914 }
8915 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE0x10) {
8916 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
8917 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
8918 }
8919 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN0x20) {
8920 rpc_stat->stats[i].queue_time_min.sec = 9999999;
8921 rpc_stat->stats[i].queue_time_min.usec = 9999999;
8922 }
8923 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX0x40) {
8924 rpc_stat->stats[i].queue_time_max.sec = 0;
8925 rpc_stat->stats[i].queue_time_max.usec = 0;
8926 }
8927 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM0x80) {
8928 rpc_stat->stats[i].execution_time_sum.sec = 0;
8929 rpc_stat->stats[i].execution_time_sum.usec = 0;
8930 }
8931 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE0x100) {
8932 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
8933 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
8934 }
8935 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN0x200) {
8936 rpc_stat->stats[i].execution_time_min.sec = 9999999;
8937 rpc_stat->stats[i].execution_time_min.usec = 9999999;
8938 }
8939 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX0x400) {
8940 rpc_stat->stats[i].execution_time_max.sec = 0;
8941 rpc_stat->stats[i].execution_time_max.usec = 0;
8942 }
8943 }
8944 }
8945
8946 MUTEX_EXIT(&rx_rpc_stats);
8947}
8948
8949/*
8950 * rx_clearPeerRPCStats - clear the contents of the rpc stats according
8951 * to clearFlag
8952 *
8953 * PARAMETERS
8954 *
8955 * IN clearFlag - flag indicating which stats to clear
8956 *
8957 * RETURN CODES
8958 *
8959 * Returns void.
8960 */
8961
8962void
8963rx_clearPeerRPCStats(afs_uint32 clearFlag)
8964{
8965 rx_interface_stat_p rpc_stat, nrpc_stat;
8966
8967 MUTEX_ENTER(&rx_rpc_stats);
8968
8969 for (queue_Scan(&peerStats, rpc_stat, nrpc_stat, rx_interface_stat)(rpc_stat) = ((struct rx_interface_stat *)((struct rx_queue *
)(&peerStats))->next), nrpc_stat = ((struct rx_interface_stat
*)((struct rx_queue *)(rpc_stat))->next); !(((struct rx_queue
*)(&peerStats)) == ((struct rx_queue *)(rpc_stat))); (rpc_stat
) = (nrpc_stat), nrpc_stat = ((struct rx_interface_stat *)((struct
rx_queue *)(rpc_stat))->next)) {
8970 unsigned int num_funcs = 0, i;
8971 char *fix_offset;
8972 /*
8973 * We have to fix the offset of rpc_stat since we are
8974 * keeping this structure on two rx_queues. The rx_queue
8975 * package assumes that the rx_queue member is the first
8976 * member of the structure. That is, rx_queue assumes that
8977 * any one item is only on one queue at a time. We are
8978 * breaking that assumption and so we have to do a little
8979 * math to fix our pointers.
8980 */
8981
8982 fix_offset = (char *)rpc_stat;
8983 fix_offset -= offsetof(rx_interface_stat_t, all_peers)__builtin_offsetof(rx_interface_stat_t, all_peers);
8984 rpc_stat = (rx_interface_stat_p) fix_offset;
8985
8986 num_funcs = rpc_stat->stats[0].func_total;
8987 for (i = 0; i < num_funcs; i++) {
8988 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS0x1) {
8989 hzero(rpc_stat->stats[i].invocations)((rpc_stat->stats[i].invocations).low = 0, (rpc_stat->stats
[i].invocations).high = 0);
8990 }
8991 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT0x2) {
8992 hzero(rpc_stat->stats[i].bytes_sent)((rpc_stat->stats[i].bytes_sent).low = 0, (rpc_stat->stats
[i].bytes_sent).high = 0);
8993 }
8994 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD0x4) {
8995 hzero(rpc_stat->stats[i].bytes_rcvd)((rpc_stat->stats[i].bytes_rcvd).low = 0, (rpc_stat->stats
[i].bytes_rcvd).high = 0);
8996 }
8997 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM0x8) {
8998 rpc_stat->stats[i].queue_time_sum.sec = 0;
8999 rpc_stat->stats[i].queue_time_sum.usec = 0;
9000 }
9001 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE0x10) {
9002 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9003 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9004 }
9005 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN0x20) {
9006 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9007 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9008 }
9009 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX0x40) {
9010 rpc_stat->stats[i].queue_time_max.sec = 0;
9011 rpc_stat->stats[i].queue_time_max.usec = 0;
9012 }
9013 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM0x80) {
9014 rpc_stat->stats[i].execution_time_sum.sec = 0;
9015 rpc_stat->stats[i].execution_time_sum.usec = 0;
9016 }
9017 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE0x100) {
9018 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9019 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9020 }
9021 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN0x200) {
9022 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9023 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9024 }
9025 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX0x400) {
9026 rpc_stat->stats[i].execution_time_max.sec = 0;
9027 rpc_stat->stats[i].execution_time_max.usec = 0;
9028 }
9029 }
9030 }
9031
9032 MUTEX_EXIT(&rx_rpc_stats);
9033}
9034
9035/*
9036 * rxi_rxstat_userok points to a routine that returns 1 if the caller
9037 * is authorized to enable/disable/clear RX statistics.
9038 */
9039static int (*rxi_rxstat_userok) (struct rx_call * call) = NULL((void *)0);
9040
9041void
9042rx_SetRxStatUserOk(int (*proc) (struct rx_call * call))
9043{
9044 rxi_rxstat_userok = proc;
9045}
9046
9047int
9048rx_RxStatUserOk(struct rx_call *call)
9049{
9050 if (!rxi_rxstat_userok)
9051 return 0;
9052 return rxi_rxstat_userok(call);
9053}
9054
9055#ifdef AFS_NT40_ENV
9056/*
9057 * DllMain() -- Entry-point function called by the DllMainCRTStartup()
9058 * function in the MSVC runtime DLL (msvcrt.dll).
9059 *
9060 * Note: the system serializes calls to this function.
9061 */
9062BOOL WINAPI
9063DllMain(HINSTANCE dllInstHandle, /* instance handle for this DLL module */
9064 DWORD reason, /* reason function is being called */
9065 LPVOID reserved) /* reserved for future use */
9066{
9067 switch (reason) {
9068 case DLL_PROCESS_ATTACH:
9069 /* library is being attached to a process */
9070 INIT_PTHREAD_LOCKS;
9071 return TRUE1;
9072
9073 case DLL_PROCESS_DETACH:
9074 return TRUE1;
9075
9076 default:
9077 return FALSE0;
9078 }
9079}
9080#endif /* AFS_NT40_ENV */
9081
9082#ifndef KERNEL
9083int rx_DumpCalls(FILE *outputFile, char *cookie)
9084{
9085#ifdef RXDEBUG_PACKET
9086#ifdef KDUMP_RX_LOCK
9087 struct rx_call_rx_lock *c;
9088#else
9089 struct rx_call *c;
9090#endif
9091#ifdef AFS_NT40_ENV
9092 int zilch;
9093 char output[2048];
9094#define RXDPRINTF sprintf
9095#define RXDPRINTOUT output
9096#else
9097#define RXDPRINTF fprintf
9098#define RXDPRINTOUT outputFile
9099#endif
9100
9101 RXDPRINTF(RXDPRINTOUT, "%s - Start dumping all Rx Calls - count=%u\r\n", cookie, rx_stats.nCallStructs);
9102#ifdef AFS_NT40_ENV
9103 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL((void *)0));
9104#endif
9105
9106 for (c = rx_allCallsp; c; c = c->allNextp) {
9107 u_short rqc, tqc, iovqc;
9108 struct rx_packet *p, *np;
9109
9110 MUTEX_ENTER(&c->lock);
9111 queue_Count(&c->rq, p, np, rx_packet, rqc)for (rqc=0, (p) = ((struct rx_packet *)((struct rx_queue *)(&
c->rq))->next), np = ((struct rx_packet *)((struct rx_queue
*)(p))->next); !(((struct rx_queue *)(&c->rq)) == (
(struct rx_queue *)(p))); (p) = (np), np = ((struct rx_packet
*)((struct rx_queue *)(p))->next), rqc++) {};
9112 queue_Count(&c->tq, p, np, rx_packet, tqc)for (tqc=0, (p) = ((struct rx_packet *)((struct rx_queue *)(&
c->tq))->next), np = ((struct rx_packet *)((struct rx_queue
*)(p))->next); !(((struct rx_queue *)(&c->tq)) == (
(struct rx_queue *)(p))); (p) = (np), np = ((struct rx_packet
*)((struct rx_queue *)(p))->next), tqc++) {};
9113 queue_Count(&c->iovq, p, np, rx_packet, iovqc)for (iovqc=0, (p) = ((struct rx_packet *)((struct rx_queue *)
(&c->iovq))->next), np = ((struct rx_packet *)((struct
rx_queue *)(p))->next); !(((struct rx_queue *)(&c->
iovq)) == ((struct rx_queue *)(p))); (p) = (np), np = ((struct
rx_packet *)((struct rx_queue *)(p))->next), iovqc++) {};
9114
9115 RXDPRINTF(RXDPRINTOUT, "%s - call=0x%p, id=%u, state=%u, mode=%u, conn=%p, epoch=%u, cid=%u, callNum=%u, connFlags=0x%x, flags=0x%x, "
9116 "rqc=%u,%u, tqc=%u,%u, iovqc=%u,%u, "
9117 "lstatus=%u, rstatus=%u, error=%d, timeout=%u, "
9118 "resendEvent=%d, timeoutEvt=%d, keepAliveEvt=%d, delayedAckEvt=%d, delayedAbortEvt=%d, abortCode=%d, abortCount=%d, "
9119 "lastSendTime=%u, lastRecvTime=%u, lastSendData=%u"
9120#ifdef RX_ENABLE_LOCKS
9121 ", refCount=%u"
9122#endif
9123#ifdef RX_REFCOUNT_CHECK
9124 ", refCountBegin=%u, refCountResend=%u, refCountDelay=%u, "
9125 "refCountAlive=%u, refCountPacket=%u, refCountSend=%u, refCountAckAll=%u, refCountAbort=%u"
9126#endif
9127 "\r\n",
9128 cookie, c, c->call_id, (afs_uint32)c->state, (afs_uint32)c->mode, c->conn, c->conn?c->conn->epoch:0, c->conn?c->conn->cid:0,
9129 c->callNumber?*c->callNumber:0, c->conn?c->conn->flags:0, c->flags,
9130 (afs_uint32)c->rqc, (afs_uint32)rqc, (afs_uint32)c->tqc, (afs_uint32)tqc, (afs_uint32)c->iovqc, (afs_uint32)iovqc,
9131 (afs_uint32)c->localStatus, (afs_uint32)c->remoteStatus, c->error, c->timeout,
9132 c->resendEvent?1:0, c->timeoutEvent?1:0, c->keepAliveEvent?1:0, c->delayedAckEvent?1:0, c->delayedAbortEvent?1:0,
9133 c->abortCode, c->abortCount, c->lastSendTime, c->lastReceiveTime, c->lastSendData
9134#ifdef RX_ENABLE_LOCKS
9135 , (afs_uint32)c->refCount
9136#endif
9137#ifdef RX_REFCOUNT_CHECK
9138 , c->refCDebug[0],c->refCDebug[1],c->refCDebug[2],c->refCDebug[3],c->refCDebug[4],c->refCDebug[5],c->refCDebug[6],c->refCDebug[7]
9139#endif
9140 );
9141 MUTEX_EXIT(&c->lock);
9142
9143#ifdef AFS_NT40_ENV
9144 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL((void *)0));
9145#endif
9146 }
9147 RXDPRINTF(RXDPRINTOUT, "%s - End dumping all Rx Calls\r\n", cookie);
9148#ifdef AFS_NT40_ENV
9149 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL((void *)0));
9150#endif
9151#endif /* RXDEBUG_PACKET */
9152 return 0;
9153}
9154#endif