2 * Copyright 2000, International Business Machines Corporation and others.
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
10 /* RX: Extended Remote Procedure Call */
12 #include <afsconfig.h>
13 #include <afs/param.h>
16 # include "afs/sysincludes.h"
17 # include "afsincludes.h"
22 # ifdef AFS_LINUX20_ENV
23 # include "h/socket.h"
25 # include "netinet/in.h"
27 # include "netinet/ip6.h"
30 # include "inet/common.h"
32 # include "inet/ip_ire.h"
34 # include "afs/afs_args.h"
35 # include "afs/afs_osi.h"
36 # ifdef RX_KERNEL_TRACE
37 # include "rx_kcommon.h"
39 # if defined(AFS_AIX_ENV)
43 # undef RXDEBUG /* turn off debugging */
45 # if defined(AFS_SGI_ENV)
46 # include "sys/debug.h"
49 # include "afs/sysincludes.h"
50 # include "afsincludes.h"
51 # endif /* !UKERNEL */
52 # include "afs/lock.h"
53 # include "rx_kmutex.h"
54 # include "rx_kernel.h"
55 # define AFSOP_STOP_RXCALLBACK 210 /* Stop CALLBACK process */
56 # define AFSOP_STOP_AFS 211 /* Stop AFS process */
57 # define AFSOP_STOP_BKG 212 /* Stop BKG process */
58 extern afs_int32 afs_termState;
60 # include "sys/lockl.h"
61 # include "sys/lock_def.h"
62 # endif /* AFS_AIX41_ENV */
63 # include "afs/rxgen_consts.h"
68 # include <afs/afsutil.h>
69 # include <WINNT\afsreg.h>
78 #include "rx_atomic.h"
79 #include "rx_globals.h"
81 #include "rx_internal.h"
84 #include <afs/rxgen_consts.h>
87 #ifdef AFS_PTHREAD_ENV
89 int (*registerProgram) (pid_t, char *) = 0;
90 int (*swapNameProgram) (pid_t, const char *, char *) = 0;
93 int (*registerProgram) (PROCESS, char *) = 0;
94 int (*swapNameProgram) (PROCESS, const char *, char *) = 0;
98 /* Local static routines */
99 static void rxi_DestroyConnectionNoLock(struct rx_connection *conn);
100 static void rxi_ComputeRoundTripTime(struct rx_packet *, struct rx_ackPacket *,
101 struct rx_call *, struct rx_peer *,
103 static void rxi_Resend(struct rxevent *event, void *arg0, void *arg1,
106 #ifdef RX_ENABLE_LOCKS
107 static void rxi_SetAcksInTransmitQueue(struct rx_call *call);
110 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
112 rx_atomic_t rxi_start_aborted; /* rxi_start awoke after rxi_Send in error.*/
113 rx_atomic_t rxi_start_in_error;
115 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
117 /* Constant delay time before sending an acknowledge of the last packet
118 * received. This is to avoid sending an extra acknowledge when the
119 * client is about to make another call, anyway, or the server is
122 * The lastAckDelay may not exceeed 400ms without causing peers to
123 * unecessarily timeout.
125 struct clock rx_lastAckDelay = {0, 400000};
127 /* Constant delay time before sending a soft ack when none was requested.
128 * This is to make sure we send soft acks before the sender times out,
129 * Normally we wait and send a hard ack when the receiver consumes the packet
131 * This value has been 100ms in all shipping versions of OpenAFS. Changing it
132 * will require changes to the peer's RTT calculations.
134 struct clock rx_softAckDelay = {0, 100000};
137 * rxi_rpc_peer_stat_cnt counts the total number of peer stat structures
138 * currently allocated within rx. This number is used to allocate the
139 * memory required to return the statistics when queried.
140 * Protected by the rx_rpc_stats mutex.
143 static unsigned int rxi_rpc_peer_stat_cnt;
146 * rxi_rpc_process_stat_cnt counts the total number of local process stat
147 * structures currently allocated within rx. The number is used to allocate
148 * the memory required to return the statistics when queried.
149 * Protected by the rx_rpc_stats mutex.
152 static unsigned int rxi_rpc_process_stat_cnt;
155 * rxi_busyChannelError is the error to return to the application when a call
156 * channel appears busy (inferred from the receipt of RX_PACKET_TYPE_BUSY
157 * packets on the channel), and there are other call channels in the
158 * connection that are not busy. If 0, we do not return errors upon receiving
159 * busy packets; we just keep trying on the same call channel until we hit a
162 static afs_int32 rxi_busyChannelError = 0;
164 rx_atomic_t rx_nWaiting = RX_ATOMIC_INIT(0);
165 rx_atomic_t rx_nWaited = RX_ATOMIC_INIT(0);
167 #if !defined(offsetof)
168 #include <stddef.h> /* for definition of offsetof() */
171 #ifdef RX_ENABLE_LOCKS
172 afs_kmutex_t rx_atomic_mutex;
175 /* Forward prototypes */
176 static struct rx_call * rxi_NewCall(struct rx_connection *, int);
178 #ifdef AFS_PTHREAD_ENV
181 * Use procedural initialization of mutexes/condition variables
185 extern afs_kmutex_t rx_quota_mutex;
186 extern afs_kmutex_t rx_pthread_mutex;
187 extern afs_kmutex_t rx_packets_mutex;
188 extern afs_kmutex_t rx_refcnt_mutex;
189 extern afs_kmutex_t des_init_mutex;
190 extern afs_kmutex_t des_random_mutex;
191 extern afs_kmutex_t rx_clock_mutex;
192 extern afs_kmutex_t rxi_connCacheMutex;
193 extern afs_kmutex_t rx_event_mutex;
194 extern afs_kmutex_t event_handler_mutex;
195 extern afs_kmutex_t listener_mutex;
196 extern afs_kmutex_t rx_if_init_mutex;
197 extern afs_kmutex_t rx_if_mutex;
198 extern afs_kmutex_t rxkad_client_uid_mutex;
199 extern afs_kmutex_t rxkad_random_mutex;
201 extern afs_kcondvar_t rx_event_handler_cond;
202 extern afs_kcondvar_t rx_listener_cond;
204 static afs_kmutex_t epoch_mutex;
205 static afs_kmutex_t rx_init_mutex;
206 static afs_kmutex_t rx_debug_mutex;
207 static afs_kmutex_t rx_rpc_stats;
210 rxi_InitPthread(void)
212 MUTEX_INIT(&rx_clock_mutex, "clock", MUTEX_DEFAULT, 0);
213 MUTEX_INIT(&rx_stats_mutex, "stats", MUTEX_DEFAULT, 0);
214 MUTEX_INIT(&rx_atomic_mutex, "atomic", MUTEX_DEFAULT, 0);
215 MUTEX_INIT(&rx_quota_mutex, "quota", MUTEX_DEFAULT, 0);
216 MUTEX_INIT(&rx_pthread_mutex, "pthread", MUTEX_DEFAULT, 0);
217 MUTEX_INIT(&rx_packets_mutex, "packets", MUTEX_DEFAULT, 0);
218 MUTEX_INIT(&rx_refcnt_mutex, "refcnts", MUTEX_DEFAULT, 0);
219 MUTEX_INIT(&epoch_mutex, "epoch", MUTEX_DEFAULT, 0);
220 MUTEX_INIT(&rx_init_mutex, "init", MUTEX_DEFAULT, 0);
221 MUTEX_INIT(&rx_event_mutex, "event", MUTEX_DEFAULT, 0);
222 MUTEX_INIT(&event_handler_mutex, "event handler", MUTEX_DEFAULT, 0);
223 MUTEX_INIT(&rxi_connCacheMutex, "conn cache", MUTEX_DEFAULT, 0);
224 MUTEX_INIT(&listener_mutex, "listener", MUTEX_DEFAULT, 0);
225 MUTEX_INIT(&rx_if_init_mutex, "if init", MUTEX_DEFAULT, 0);
226 MUTEX_INIT(&rx_if_mutex, "if", MUTEX_DEFAULT, 0);
227 MUTEX_INIT(&rxkad_client_uid_mutex, "uid", MUTEX_DEFAULT, 0);
228 MUTEX_INIT(&rxkad_random_mutex, "rxkad random", MUTEX_DEFAULT, 0);
229 MUTEX_INIT(&rx_debug_mutex, "debug", MUTEX_DEFAULT, 0);
231 CV_INIT(&rx_event_handler_cond, "evhand", CV_DEFAULT, 0);
232 CV_INIT(&rx_listener_cond, "rxlisten", CV_DEFAULT, 0);
234 osi_Assert(pthread_key_create(&rx_thread_id_key, NULL) == 0);
235 osi_Assert(pthread_key_create(&rx_ts_info_key, NULL) == 0);
237 rxkad_global_stats_init();
239 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
240 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
241 #ifdef RX_ENABLE_LOCKS
244 #endif /* RX_LOCKS_DB */
245 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
246 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
248 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
250 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
252 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
254 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
255 MUTEX_INIT(&rxi_keyCreate_lock, "rxi_keyCreate_lock", MUTEX_DEFAULT, 0);
256 #endif /* RX_ENABLE_LOCKS */
259 pthread_once_t rx_once_init = PTHREAD_ONCE_INIT;
260 #define INIT_PTHREAD_LOCKS osi_Assert(pthread_once(&rx_once_init, rxi_InitPthread)==0)
262 * The rx_stats_mutex mutex protects the following global variables:
263 * rxi_lowConnRefCount
264 * rxi_lowPeerRefCount
273 * The rx_quota_mutex mutex protects the following global variables:
281 * The rx_freePktQ_lock protects the following global variables:
286 * The rx_packets_mutex mutex protects the following global variables:
294 * The rx_pthread_mutex mutex protects the following global variables:
295 * rxi_fcfs_thread_num
298 #define INIT_PTHREAD_LOCKS
302 /* Variables for handling the minProcs implementation. availProcs gives the
303 * number of threads available in the pool at this moment (not counting dudes
304 * executing right now). totalMin gives the total number of procs required
305 * for handling all minProcs requests. minDeficit is a dynamic variable
306 * tracking the # of procs required to satisfy all of the remaining minProcs
308 * For fine grain locking to work, the quota check and the reservation of
309 * a server thread has to come while rxi_availProcs and rxi_minDeficit
310 * are locked. To this end, the code has been modified under #ifdef
311 * RX_ENABLE_LOCKS so that quota checks and reservation occur at the
312 * same time. A new function, ReturnToServerPool() returns the allocation.
314 * A call can be on several queue's (but only one at a time). When
315 * rxi_ResetCall wants to remove the call from a queue, it has to ensure
316 * that no one else is touching the queue. To this end, we store the address
317 * of the queue lock in the call structure (under the call lock) when we
318 * put the call on a queue, and we clear the call_queue_lock when the
319 * call is removed from a queue (once the call lock has been obtained).
320 * This allows rxi_ResetCall to safely synchronize with others wishing
321 * to manipulate the queue.
324 #if defined(RX_ENABLE_LOCKS)
325 static afs_kmutex_t rx_rpc_stats;
328 /* We keep a "last conn pointer" in rxi_FindConnection. The odds are
329 ** pretty good that the next packet coming in is from the same connection
330 ** as the last packet, since we're send multiple packets in a transmit window.
332 struct rx_connection *rxLastConn = 0;
334 #ifdef RX_ENABLE_LOCKS
335 /* The locking hierarchy for rx fine grain locking is composed of these
338 * rx_connHashTable_lock - synchronizes conn creation, rx_connHashTable access
339 * conn_call_lock - used to synchonize rx_EndCall and rx_NewCall
340 * call->lock - locks call data fields.
341 * These are independent of each other:
342 * rx_freeCallQueue_lock
347 * serverQueueEntry->lock
348 * rx_peerHashTable_lock - locked under rx_connHashTable_lock
350 * peer->lock - locks peer data fields.
351 * conn_data_lock - that more than one thread is not updating a conn data
352 * field at the same time.
363 * Do we need a lock to protect the peer field in the conn structure?
364 * conn->peer was previously a constant for all intents and so has no
365 * lock protecting this field. The multihomed client delta introduced
366 * a RX code change : change the peer field in the connection structure
367 * to that remote interface from which the last packet for this
368 * connection was sent out. This may become an issue if further changes
371 #define SET_CALL_QUEUE_LOCK(C, L) (C)->call_queue_lock = (L)
372 #define CLEAR_CALL_QUEUE_LOCK(C) (C)->call_queue_lock = NULL
374 /* rxdb_fileID is used to identify the lock location, along with line#. */
375 static int rxdb_fileID = RXDB_FILE_RX;
376 #endif /* RX_LOCKS_DB */
377 #else /* RX_ENABLE_LOCKS */
378 #define SET_CALL_QUEUE_LOCK(C, L)
379 #define CLEAR_CALL_QUEUE_LOCK(C)
380 #endif /* RX_ENABLE_LOCKS */
381 struct rx_serverQueueEntry *rx_waitForPacket = 0;
382 struct rx_serverQueueEntry *rx_waitingForPacket = 0;
384 /* ------------Exported Interfaces------------- */
386 /* This function allows rxkad to set the epoch to a suitably random number
387 * which rx_NewConnection will use in the future. The principle purpose is to
388 * get rxnull connections to use the same epoch as the rxkad connections do, at
389 * least once the first rxkad connection is established. This is important now
390 * that the host/port addresses aren't used in FindConnection: the uniqueness
391 * of epoch/cid matters and the start time won't do. */
393 #ifdef AFS_PTHREAD_ENV
395 * This mutex protects the following global variables:
399 #define LOCK_EPOCH MUTEX_ENTER(&epoch_mutex)
400 #define UNLOCK_EPOCH MUTEX_EXIT(&epoch_mutex)
404 #endif /* AFS_PTHREAD_ENV */
407 rx_SetEpoch(afs_uint32 epoch)
414 /* Initialize rx. A port number may be mentioned, in which case this
415 * becomes the default port number for any service installed later.
416 * If 0 is provided for the port number, a random port will be chosen
417 * by the kernel. Whether this will ever overlap anything in
418 * /etc/services is anybody's guess... Returns 0 on success, -1 on
423 int rxinit_status = 1;
424 #ifdef AFS_PTHREAD_ENV
426 * This mutex protects the following global variables:
430 #define LOCK_RX_INIT MUTEX_ENTER(&rx_init_mutex)
431 #define UNLOCK_RX_INIT MUTEX_EXIT(&rx_init_mutex)
434 #define UNLOCK_RX_INIT
438 rx_InitHost(u_int host, u_int port)
445 char *htable, *ptable;
452 if (rxinit_status == 0) {
453 tmp_status = rxinit_status;
455 return tmp_status; /* Already started; return previous error code. */
461 if (afs_winsockInit() < 0)
467 * Initialize anything necessary to provide a non-premptive threading
470 rxi_InitializeThreadSupport();
473 /* Allocate and initialize a socket for client and perhaps server
476 rx_socket = rxi_GetHostUDPSocket(host, (u_short) port);
477 if (rx_socket == OSI_NULLSOCKET) {
481 #if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
484 #endif /* RX_LOCKS_DB */
485 MUTEX_INIT(&rx_stats_mutex, "rx_stats_mutex", MUTEX_DEFAULT, 0);
486 MUTEX_INIT(&rx_quota_mutex, "rx_quota_mutex", MUTEX_DEFAULT, 0);
487 MUTEX_INIT(&rx_pthread_mutex, "rx_pthread_mutex", MUTEX_DEFAULT, 0);
488 MUTEX_INIT(&rx_packets_mutex, "rx_packets_mutex", MUTEX_DEFAULT, 0);
489 MUTEX_INIT(&rx_refcnt_mutex, "rx_refcnt_mutex", MUTEX_DEFAULT, 0);
490 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
491 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
492 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
493 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
495 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
497 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
499 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
501 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
502 #if defined(AFS_HPUX110_ENV)
504 rx_sleepLock = alloc_spinlock(LAST_HELD_ORDER - 10, "rx_sleepLock");
505 #endif /* AFS_HPUX110_ENV */
506 #endif /* RX_ENABLE_LOCKS && KERNEL */
509 rx_connDeadTime = 12;
510 rx_tranquil = 0; /* reset flag */
511 rxi_ResetStatistics();
513 osi_Alloc(rx_hashTableSize * sizeof(struct rx_connection *));
514 PIN(htable, rx_hashTableSize * sizeof(struct rx_connection *)); /* XXXXX */
515 memset(htable, 0, rx_hashTableSize * sizeof(struct rx_connection *));
516 ptable = (char *)osi_Alloc(rx_hashTableSize * sizeof(struct rx_peer *));
517 PIN(ptable, rx_hashTableSize * sizeof(struct rx_peer *)); /* XXXXX */
518 memset(ptable, 0, rx_hashTableSize * sizeof(struct rx_peer *));
520 /* Malloc up a bunch of packets & buffers */
522 queue_Init(&rx_freePacketQueue);
523 rxi_NeedMorePackets = FALSE;
524 rx_nPackets = 0; /* rx_nPackets is managed by rxi_MorePackets* */
526 /* enforce a minimum number of allocated packets */
527 if (rx_extraPackets < rxi_nSendFrags * rx_maxSendWindow)
528 rx_extraPackets = rxi_nSendFrags * rx_maxSendWindow;
530 /* allocate the initial free packet pool */
531 #ifdef RX_ENABLE_TSFPQ
532 rxi_MorePacketsTSFPQ(rx_extraPackets + RX_MAX_QUOTA + 2, RX_TS_FPQ_FLUSH_GLOBAL, 0);
533 #else /* RX_ENABLE_TSFPQ */
534 rxi_MorePackets(rx_extraPackets + RX_MAX_QUOTA + 2); /* fudge */
535 #endif /* RX_ENABLE_TSFPQ */
542 #if defined(AFS_NT40_ENV) && !defined(AFS_PTHREAD_ENV)
543 tv.tv_sec = clock_now.sec;
544 tv.tv_usec = clock_now.usec;
545 srand((unsigned int)tv.tv_usec);
552 #if defined(KERNEL) && !defined(UKERNEL)
553 /* Really, this should never happen in a real kernel */
556 struct sockaddr_in addr;
558 int addrlen = sizeof(addr);
560 socklen_t addrlen = sizeof(addr);
562 if (getsockname((intptr_t)rx_socket, (struct sockaddr *)&addr, &addrlen)) {
566 rx_port = addr.sin_port;
569 rx_stats.minRtt.sec = 9999999;
571 rx_SetEpoch(tv.tv_sec | 0x80000000);
573 rx_SetEpoch(tv.tv_sec); /* Start time of this package, rxkad
574 * will provide a randomer value. */
576 MUTEX_ENTER(&rx_quota_mutex);
577 rxi_dataQuota += rx_extraQuota; /* + extra pkts caller asked to rsrv */
578 MUTEX_EXIT(&rx_quota_mutex);
579 /* *Slightly* random start time for the cid. This is just to help
580 * out with the hashing function at the peer */
581 rx_nextCid = ((tv.tv_sec ^ tv.tv_usec) << RX_CIDSHIFT);
582 rx_connHashTable = (struct rx_connection **)htable;
583 rx_peerHashTable = (struct rx_peer **)ptable;
585 rx_hardAckDelay.sec = 0;
586 rx_hardAckDelay.usec = 100000; /* 100 milliseconds */
588 rxevent_Init(20, rxi_ReScheduleEvents);
590 /* Initialize various global queues */
591 queue_Init(&rx_idleServerQueue);
592 queue_Init(&rx_incomingCallQueue);
593 queue_Init(&rx_freeCallQueue);
595 #if defined(AFS_NT40_ENV) && !defined(KERNEL)
596 /* Initialize our list of usable IP addresses. */
600 #if defined(RXK_LISTENER_ENV) || !defined(KERNEL)
601 /* Start listener process (exact function is dependent on the
602 * implementation environment--kernel or user space) */
607 tmp_status = rxinit_status = 0;
615 return rx_InitHost(htonl(INADDR_ANY), port);
621 * The rxi_rto functions implement a TCP (RFC2988) style algorithm for
622 * maintaing the round trip timer.
627 * Start a new RTT timer for a given call and packet.
629 * There must be no resendEvent already listed for this call, otherwise this
630 * will leak events - intended for internal use within the RTO code only
633 * the RX call to start the timer for
634 * @param[in] lastPacket
635 * a flag indicating whether the last packet has been sent or not
637 * @pre call must be locked before calling this function
641 rxi_rto_startTimer(struct rx_call *call, int lastPacket, int istack)
643 struct clock now, retryTime;
648 clock_Add(&retryTime, &call->rto);
650 /* If we're sending the last packet, and we're the client, then the server
651 * may wait for an additional 400ms before returning the ACK, wait for it
652 * rather than hitting a timeout */
653 if (lastPacket && call->conn->type == RX_CLIENT_CONNECTION)
654 clock_Addmsec(&retryTime, 400);
656 MUTEX_ENTER(&rx_refcnt_mutex);
657 CALL_HOLD(call, RX_CALL_REFCOUNT_RESEND);
658 MUTEX_EXIT(&rx_refcnt_mutex);
659 call->resendEvent = rxevent_PostNow2(&retryTime, &now, rxi_Resend,
664 * Cancel an RTT timer for a given call.
668 * the RX call to cancel the timer for
670 * @pre call must be locked before calling this function
675 rxi_rto_cancel(struct rx_call *call)
677 if (!call->resendEvent)
680 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
684 * Tell the RTO timer that we have sent a packet.
686 * If the timer isn't already running, then start it. If the timer is running,
690 * the RX call that the packet has been sent on
691 * @param[in] lastPacket
692 * A flag which is true if this is the last packet for the call
694 * @pre The call must be locked before calling this function
699 rxi_rto_packet_sent(struct rx_call *call, int lastPacket, int istack)
701 if (call->resendEvent)
704 rxi_rto_startTimer(call, lastPacket, istack);
708 * Tell the RTO timer that we have received an new ACK message
710 * This function should be called whenever a call receives an ACK that
711 * acknowledges new packets. Whatever happens, we stop the current timer.
712 * If there are unacked packets in the queue which have been sent, then
713 * we restart the timer from now. Otherwise, we leave it stopped.
716 * the RX call that the ACK has been received on
720 rxi_rto_packet_acked(struct rx_call *call, int istack)
722 struct rx_packet *p, *nxp;
724 rxi_rto_cancel(call);
726 if (queue_IsEmpty(&call->tq))
729 for (queue_Scan(&call->tq, p, nxp, rx_packet)) {
730 if (p->header.seq > call->tfirst + call->twind)
733 if (!(p->flags & RX_PKTFLAG_ACKED) && p->flags & RX_PKTFLAG_SENT) {
734 rxi_rto_startTimer(call, p->header.flags & RX_LAST_PACKET, istack);
742 * Set an initial round trip timeout for a peer connection
744 * @param[in] secs The timeout to set in seconds
748 rx_rto_setPeerTimeoutSecs(struct rx_peer *peer, int secs) {
749 peer->rtt = secs * 8000;
753 * Sets the error generated when a busy call channel is detected.
755 * @param[in] error The error to return for a call on a busy channel.
757 * @pre Neither rx_Init nor rx_InitHost have been called yet
760 rx_SetBusyChannelError(afs_int32 error)
762 osi_Assert(rxinit_status != 0);
763 rxi_busyChannelError = error;
766 /* called with unincremented nRequestsRunning to see if it is OK to start
767 * a new thread in this service. Could be "no" for two reasons: over the
768 * max quota, or would prevent others from reaching their min quota.
770 #ifdef RX_ENABLE_LOCKS
771 /* This verion of QuotaOK reserves quota if it's ok while the
772 * rx_serverPool_lock is held. Return quota using ReturnToServerPool().
775 QuotaOK(struct rx_service *aservice)
777 /* check if over max quota */
778 if (aservice->nRequestsRunning >= aservice->maxProcs) {
782 /* under min quota, we're OK */
783 /* otherwise, can use only if there are enough to allow everyone
784 * to go to their min quota after this guy starts.
787 MUTEX_ENTER(&rx_quota_mutex);
788 if ((aservice->nRequestsRunning < aservice->minProcs)
789 || (rxi_availProcs > rxi_minDeficit)) {
790 aservice->nRequestsRunning++;
791 /* just started call in minProcs pool, need fewer to maintain
793 if (aservice->nRequestsRunning <= aservice->minProcs)
796 MUTEX_EXIT(&rx_quota_mutex);
799 MUTEX_EXIT(&rx_quota_mutex);
805 ReturnToServerPool(struct rx_service *aservice)
807 aservice->nRequestsRunning--;
808 MUTEX_ENTER(&rx_quota_mutex);
809 if (aservice->nRequestsRunning < aservice->minProcs)
812 MUTEX_EXIT(&rx_quota_mutex);
815 #else /* RX_ENABLE_LOCKS */
817 QuotaOK(struct rx_service *aservice)
820 /* under min quota, we're OK */
821 if (aservice->nRequestsRunning < aservice->minProcs)
824 /* check if over max quota */
825 if (aservice->nRequestsRunning >= aservice->maxProcs)
828 /* otherwise, can use only if there are enough to allow everyone
829 * to go to their min quota after this guy starts.
831 MUTEX_ENTER(&rx_quota_mutex);
832 if (rxi_availProcs > rxi_minDeficit)
834 MUTEX_EXIT(&rx_quota_mutex);
837 #endif /* RX_ENABLE_LOCKS */
840 /* Called by rx_StartServer to start up lwp's to service calls.
841 NExistingProcs gives the number of procs already existing, and which
842 therefore needn't be created. */
844 rxi_StartServerProcs(int nExistingProcs)
846 struct rx_service *service;
851 /* For each service, reserve N processes, where N is the "minimum"
852 * number of processes that MUST be able to execute a request in parallel,
853 * at any time, for that process. Also compute the maximum difference
854 * between any service's maximum number of processes that can run
855 * (i.e. the maximum number that ever will be run, and a guarantee
856 * that this number will run if other services aren't running), and its
857 * minimum number. The result is the extra number of processes that
858 * we need in order to provide the latter guarantee */
859 for (i = 0; i < RX_MAX_SERVICES; i++) {
861 service = rx_services[i];
862 if (service == (struct rx_service *)0)
864 nProcs += service->minProcs;
865 diff = service->maxProcs - service->minProcs;
869 nProcs += maxdiff; /* Extra processes needed to allow max number requested to run in any given service, under good conditions */
870 nProcs -= nExistingProcs; /* Subtract the number of procs that were previously created for use as server procs */
871 for (i = 0; i < nProcs; i++) {
872 rxi_StartServerProc(rx_ServerProc, rx_stackSize);
878 /* This routine is only required on Windows */
880 rx_StartClientThread(void)
882 #ifdef AFS_PTHREAD_ENV
884 pid = pthread_self();
885 #endif /* AFS_PTHREAD_ENV */
887 #endif /* AFS_NT40_ENV */
889 /* This routine must be called if any services are exported. If the
890 * donateMe flag is set, the calling process is donated to the server
893 rx_StartServer(int donateMe)
895 struct rx_service *service;
901 /* Start server processes, if necessary (exact function is dependent
902 * on the implementation environment--kernel or user space). DonateMe
903 * will be 1 if there is 1 pre-existing proc, i.e. this one. In this
904 * case, one less new proc will be created rx_StartServerProcs.
906 rxi_StartServerProcs(donateMe);
908 /* count up the # of threads in minProcs, and add set the min deficit to
909 * be that value, too.
911 for (i = 0; i < RX_MAX_SERVICES; i++) {
912 service = rx_services[i];
913 if (service == (struct rx_service *)0)
915 MUTEX_ENTER(&rx_quota_mutex);
916 rxi_totalMin += service->minProcs;
917 /* below works even if a thread is running, since minDeficit would
918 * still have been decremented and later re-incremented.
920 rxi_minDeficit += service->minProcs;
921 MUTEX_EXIT(&rx_quota_mutex);
924 /* Turn on reaping of idle server connections */
925 rxi_ReapConnections(NULL, NULL, NULL);
934 #ifdef AFS_PTHREAD_ENV
936 pid = afs_pointer_to_int(pthread_self());
937 #else /* AFS_PTHREAD_ENV */
939 LWP_CurrentProcess(&pid);
940 #endif /* AFS_PTHREAD_ENV */
942 sprintf(name, "srv_%d", ++nProcs);
944 (*registerProgram) (pid, name);
946 #endif /* AFS_NT40_ENV */
947 rx_ServerProc(NULL); /* Never returns */
949 #ifdef RX_ENABLE_TSFPQ
950 /* no use leaving packets around in this thread's local queue if
951 * it isn't getting donated to the server thread pool.
953 rxi_FlushLocalPacketsTSFPQ();
954 #endif /* RX_ENABLE_TSFPQ */
958 /* Create a new client connection to the specified service, using the
959 * specified security object to implement the security model for this
961 struct rx_connection *
962 rx_NewConnection(afs_uint32 shost, u_short sport, u_short sservice,
963 struct rx_securityClass *securityObject,
964 int serviceSecurityIndex)
968 struct rx_connection *conn;
973 dpf(("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
974 "serviceSecurityIndex %d)\n",
975 ntohl(shost), ntohs(sport), sservice, securityObject,
976 serviceSecurityIndex));
978 /* Vasilsi said: "NETPRI protects Cid and Alloc", but can this be true in
979 * the case of kmem_alloc? */
980 conn = rxi_AllocConnection();
981 #ifdef RX_ENABLE_LOCKS
982 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
983 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
984 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
987 MUTEX_ENTER(&rx_connHashTable_lock);
988 cid = (rx_nextCid += RX_MAXCALLS);
989 conn->type = RX_CLIENT_CONNECTION;
991 conn->epoch = rx_epoch;
992 conn->peer = rxi_FindPeer(shost, sport, 0, 1);
993 conn->serviceId = sservice;
994 conn->securityObject = securityObject;
995 conn->securityData = (void *) 0;
996 conn->securityIndex = serviceSecurityIndex;
997 rx_SetConnDeadTime(conn, rx_connDeadTime);
998 rx_SetConnSecondsUntilNatPing(conn, 0);
999 conn->ackRate = RX_FAST_ACK_RATE;
1000 conn->nSpecific = 0;
1001 conn->specific = NULL;
1002 conn->challengeEvent = NULL;
1003 conn->delayedAbortEvent = NULL;
1004 conn->abortCount = 0;
1006 for (i = 0; i < RX_MAXCALLS; i++) {
1007 conn->twind[i] = rx_initSendWindow;
1008 conn->rwind[i] = rx_initReceiveWindow;
1009 conn->lastBusy[i] = 0;
1012 RXS_NewConnection(securityObject, conn);
1014 CONN_HASH(shost, sport, conn->cid, conn->epoch, RX_CLIENT_CONNECTION);
1016 conn->refCount++; /* no lock required since only this thread knows... */
1017 conn->next = rx_connHashTable[hashindex];
1018 rx_connHashTable[hashindex] = conn;
1019 if (rx_stats_active)
1020 rx_atomic_inc(&rx_stats.nClientConns);
1021 MUTEX_EXIT(&rx_connHashTable_lock);
1027 * Ensure a connection's timeout values are valid.
1029 * @param[in] conn The connection to check
1031 * @post conn->secondUntilDead <= conn->idleDeadTime <= conn->hardDeadTime,
1032 * unless idleDeadTime and/or hardDeadTime are not set
1036 rxi_CheckConnTimeouts(struct rx_connection *conn)
1038 /* a connection's timeouts must have the relationship
1039 * deadTime <= idleDeadTime <= hardDeadTime. Otherwise, for example, a
1040 * total loss of network to a peer may cause an idle timeout instead of a
1041 * dead timeout, simply because the idle timeout gets hit first. Also set
1042 * a minimum deadTime of 6, just to ensure it doesn't get set too low. */
1043 /* this logic is slightly complicated by the fact that
1044 * idleDeadTime/hardDeadTime may not be set at all, but it's not too bad.
1046 conn->secondsUntilDead = MAX(conn->secondsUntilDead, 6);
1047 if (conn->idleDeadTime) {
1048 conn->idleDeadTime = MAX(conn->idleDeadTime, conn->secondsUntilDead);
1050 if (conn->hardDeadTime) {
1051 if (conn->idleDeadTime) {
1052 conn->hardDeadTime = MAX(conn->idleDeadTime, conn->hardDeadTime);
1054 conn->hardDeadTime = MAX(conn->secondsUntilDead, conn->hardDeadTime);
1060 rx_SetConnDeadTime(struct rx_connection *conn, int seconds)
1062 /* The idea is to set the dead time to a value that allows several
1063 * keepalives to be dropped without timing out the connection. */
1064 conn->secondsUntilDead = seconds;
1065 rxi_CheckConnTimeouts(conn);
1066 conn->secondsUntilPing = conn->secondsUntilDead / 6;
1070 rx_SetConnHardDeadTime(struct rx_connection *conn, int seconds)
1072 conn->hardDeadTime = seconds;
1073 rxi_CheckConnTimeouts(conn);
1077 rx_SetConnIdleDeadTime(struct rx_connection *conn, int seconds)
1079 conn->idleDeadTime = seconds;
1080 rxi_CheckConnTimeouts(conn);
1083 int rxi_lowPeerRefCount = 0;
1084 int rxi_lowConnRefCount = 0;
1087 * Cleanup a connection that was destroyed in rxi_DestroyConnectioNoLock.
1088 * NOTE: must not be called with rx_connHashTable_lock held.
1091 rxi_CleanupConnection(struct rx_connection *conn)
1093 /* Notify the service exporter, if requested, that this connection
1094 * is being destroyed */
1095 if (conn->type == RX_SERVER_CONNECTION && conn->service->destroyConnProc)
1096 (*conn->service->destroyConnProc) (conn);
1098 /* Notify the security module that this connection is being destroyed */
1099 RXS_DestroyConnection(conn->securityObject, conn);
1101 /* If this is the last connection using the rx_peer struct, set its
1102 * idle time to now. rxi_ReapConnections will reap it if it's still
1103 * idle (refCount == 0) after rx_idlePeerTime (60 seconds) have passed.
1105 MUTEX_ENTER(&rx_peerHashTable_lock);
1106 if (conn->peer->refCount < 2) {
1107 conn->peer->idleWhen = clock_Sec();
1108 if (conn->peer->refCount < 1) {
1109 conn->peer->refCount = 1;
1110 if (rx_stats_active) {
1111 MUTEX_ENTER(&rx_stats_mutex);
1112 rxi_lowPeerRefCount++;
1113 MUTEX_EXIT(&rx_stats_mutex);
1117 conn->peer->refCount--;
1118 MUTEX_EXIT(&rx_peerHashTable_lock);
1120 if (rx_stats_active)
1122 if (conn->type == RX_SERVER_CONNECTION)
1123 rx_atomic_dec(&rx_stats.nServerConns);
1125 rx_atomic_dec(&rx_stats.nClientConns);
1128 if (conn->specific) {
1130 for (i = 0; i < conn->nSpecific; i++) {
1131 if (conn->specific[i] && rxi_keyCreate_destructor[i])
1132 (*rxi_keyCreate_destructor[i]) (conn->specific[i]);
1133 conn->specific[i] = NULL;
1135 free(conn->specific);
1137 conn->specific = NULL;
1138 conn->nSpecific = 0;
1139 #endif /* !KERNEL */
1141 MUTEX_DESTROY(&conn->conn_call_lock);
1142 MUTEX_DESTROY(&conn->conn_data_lock);
1143 CV_DESTROY(&conn->conn_call_cv);
1145 rxi_FreeConnection(conn);
1148 /* Destroy the specified connection */
1150 rxi_DestroyConnection(struct rx_connection *conn)
1152 MUTEX_ENTER(&rx_connHashTable_lock);
1153 rxi_DestroyConnectionNoLock(conn);
1154 /* conn should be at the head of the cleanup list */
1155 if (conn == rx_connCleanup_list) {
1156 rx_connCleanup_list = rx_connCleanup_list->next;
1157 MUTEX_EXIT(&rx_connHashTable_lock);
1158 rxi_CleanupConnection(conn);
1160 #ifdef RX_ENABLE_LOCKS
1162 MUTEX_EXIT(&rx_connHashTable_lock);
1164 #endif /* RX_ENABLE_LOCKS */
1168 rxi_DestroyConnectionNoLock(struct rx_connection *conn)
1170 struct rx_connection **conn_ptr;
1172 struct rx_packet *packet;
1179 MUTEX_ENTER(&conn->conn_data_lock);
1180 MUTEX_ENTER(&rx_refcnt_mutex);
1181 if (conn->refCount > 0)
1184 if (rx_stats_active) {
1185 MUTEX_ENTER(&rx_stats_mutex);
1186 rxi_lowConnRefCount++;
1187 MUTEX_EXIT(&rx_stats_mutex);
1191 if ((conn->refCount > 0) || (conn->flags & RX_CONN_BUSY)) {
1192 /* Busy; wait till the last guy before proceeding */
1193 MUTEX_EXIT(&rx_refcnt_mutex);
1194 MUTEX_EXIT(&conn->conn_data_lock);
1199 /* If the client previously called rx_NewCall, but it is still
1200 * waiting, treat this as a running call, and wait to destroy the
1201 * connection later when the call completes. */
1202 if ((conn->type == RX_CLIENT_CONNECTION)
1203 && (conn->flags & (RX_CONN_MAKECALL_WAITING|RX_CONN_MAKECALL_ACTIVE))) {
1204 conn->flags |= RX_CONN_DESTROY_ME;
1205 MUTEX_EXIT(&conn->conn_data_lock);
1209 MUTEX_EXIT(&rx_refcnt_mutex);
1210 MUTEX_EXIT(&conn->conn_data_lock);
1212 /* Check for extant references to this connection */
1213 for (i = 0; i < RX_MAXCALLS; i++) {
1214 struct rx_call *call = conn->call[i];
1217 if (conn->type == RX_CLIENT_CONNECTION) {
1218 MUTEX_ENTER(&call->lock);
1219 if (call->delayedAckEvent) {
1220 /* Push the final acknowledgment out now--there
1221 * won't be a subsequent call to acknowledge the
1222 * last reply packets */
1223 rxevent_Cancel(call->delayedAckEvent, call,
1224 RX_CALL_REFCOUNT_DELAY);
1225 if (call->state == RX_STATE_PRECALL
1226 || call->state == RX_STATE_ACTIVE) {
1227 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1229 rxi_AckAll(NULL, call, 0);
1232 MUTEX_EXIT(&call->lock);
1236 #ifdef RX_ENABLE_LOCKS
1238 if (MUTEX_TRYENTER(&conn->conn_data_lock)) {
1239 MUTEX_EXIT(&conn->conn_data_lock);
1241 /* Someone is accessing a packet right now. */
1245 #endif /* RX_ENABLE_LOCKS */
1248 /* Don't destroy the connection if there are any call
1249 * structures still in use */
1250 MUTEX_ENTER(&conn->conn_data_lock);
1251 conn->flags |= RX_CONN_DESTROY_ME;
1252 MUTEX_EXIT(&conn->conn_data_lock);
1257 if (conn->natKeepAliveEvent) {
1258 rxi_NatKeepAliveOff(conn);
1261 if (conn->delayedAbortEvent) {
1262 rxevent_Cancel(conn->delayedAbortEvent, (struct rx_call *)0, 0);
1263 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
1265 MUTEX_ENTER(&conn->conn_data_lock);
1266 rxi_SendConnectionAbort(conn, packet, 0, 1);
1267 MUTEX_EXIT(&conn->conn_data_lock);
1268 rxi_FreePacket(packet);
1272 /* Remove from connection hash table before proceeding */
1274 &rx_connHashTable[CONN_HASH
1275 (peer->host, peer->port, conn->cid, conn->epoch,
1277 for (; *conn_ptr; conn_ptr = &(*conn_ptr)->next) {
1278 if (*conn_ptr == conn) {
1279 *conn_ptr = conn->next;
1283 /* if the conn that we are destroying was the last connection, then we
1284 * clear rxLastConn as well */
1285 if (rxLastConn == conn)
1288 /* Make sure the connection is completely reset before deleting it. */
1289 /* get rid of pending events that could zap us later */
1290 if (conn->challengeEvent)
1291 rxevent_Cancel(conn->challengeEvent, (struct rx_call *)0, 0);
1292 if (conn->checkReachEvent)
1293 rxevent_Cancel(conn->checkReachEvent, (struct rx_call *)0, 0);
1294 if (conn->natKeepAliveEvent)
1295 rxevent_Cancel(conn->natKeepAliveEvent, (struct rx_call *)0, 0);
1297 /* Add the connection to the list of destroyed connections that
1298 * need to be cleaned up. This is necessary to avoid deadlocks
1299 * in the routines we call to inform others that this connection is
1300 * being destroyed. */
1301 conn->next = rx_connCleanup_list;
1302 rx_connCleanup_list = conn;
1305 /* Externally available version */
1307 rx_DestroyConnection(struct rx_connection *conn)
1312 rxi_DestroyConnection(conn);
1317 rx_GetConnection(struct rx_connection *conn)
1322 MUTEX_ENTER(&rx_refcnt_mutex);
1324 MUTEX_EXIT(&rx_refcnt_mutex);
1328 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
1329 /* Wait for the transmit queue to no longer be busy.
1330 * requires the call->lock to be held */
1332 rxi_WaitforTQBusy(struct rx_call *call) {
1333 while (!call->error && (call->flags & RX_CALL_TQ_BUSY)) {
1334 call->flags |= RX_CALL_TQ_WAIT;
1336 #ifdef RX_ENABLE_LOCKS
1337 osirx_AssertMine(&call->lock, "rxi_WaitforTQ lock");
1338 CV_WAIT(&call->cv_tq, &call->lock);
1339 #else /* RX_ENABLE_LOCKS */
1340 osi_rxSleep(&call->tq);
1341 #endif /* RX_ENABLE_LOCKS */
1343 if (call->tqWaiters == 0) {
1344 call->flags &= ~RX_CALL_TQ_WAIT;
1351 rxi_WakeUpTransmitQueue(struct rx_call *call)
1353 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
1354 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",
1355 call, call->tqWaiters, call->flags));
1356 #ifdef RX_ENABLE_LOCKS
1357 osirx_AssertMine(&call->lock, "rxi_Start start");
1358 CV_BROADCAST(&call->cv_tq);
1359 #else /* RX_ENABLE_LOCKS */
1360 osi_rxWakeup(&call->tq);
1361 #endif /* RX_ENABLE_LOCKS */
1365 /* Start a new rx remote procedure call, on the specified connection.
1366 * If wait is set to 1, wait for a free call channel; otherwise return
1367 * 0. Maxtime gives the maximum number of seconds this call may take,
1368 * after rx_NewCall returns. After this time interval, a call to any
1369 * of rx_SendData, rx_ReadData, etc. will fail with RX_CALL_TIMEOUT.
1370 * For fine grain locking, we hold the conn_call_lock in order to
1371 * to ensure that we don't get signalle after we found a call in an active
1372 * state and before we go to sleep.
1375 rx_NewCall(struct rx_connection *conn)
1377 int i, wait, ignoreBusy = 1;
1378 struct rx_call *call;
1379 struct clock queueTime;
1380 afs_uint32 leastBusy = 0;
1384 dpf(("rx_NewCall(conn %"AFS_PTR_FMT")\n", conn));
1387 clock_GetTime(&queueTime);
1389 * Check if there are others waiting for a new call.
1390 * If so, let them go first to avoid starving them.
1391 * This is a fairly simple scheme, and might not be
1392 * a complete solution for large numbers of waiters.
1394 * makeCallWaiters keeps track of the number of
1395 * threads waiting to make calls and the
1396 * RX_CONN_MAKECALL_WAITING flag bit is used to
1397 * indicate that there are indeed calls waiting.
1398 * The flag is set when the waiter is incremented.
1399 * It is only cleared when makeCallWaiters is 0.
1400 * This prevents us from accidently destroying the
1401 * connection while it is potentially about to be used.
1403 MUTEX_ENTER(&conn->conn_call_lock);
1404 MUTEX_ENTER(&conn->conn_data_lock);
1405 while (conn->flags & RX_CONN_MAKECALL_ACTIVE) {
1406 conn->flags |= RX_CONN_MAKECALL_WAITING;
1407 conn->makeCallWaiters++;
1408 MUTEX_EXIT(&conn->conn_data_lock);
1410 #ifdef RX_ENABLE_LOCKS
1411 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1415 MUTEX_ENTER(&conn->conn_data_lock);
1416 conn->makeCallWaiters--;
1417 if (conn->makeCallWaiters == 0)
1418 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1421 /* We are now the active thread in rx_NewCall */
1422 conn->flags |= RX_CONN_MAKECALL_ACTIVE;
1423 MUTEX_EXIT(&conn->conn_data_lock);
1428 for (i = 0; i < RX_MAXCALLS; i++) {
1429 call = conn->call[i];
1431 if (!ignoreBusy && conn->lastBusy[i] != leastBusy) {
1432 /* we're not ignoring busy call slots; only look at the
1433 * call slot that is the "least" busy */
1437 if (call->state == RX_STATE_DALLY) {
1438 MUTEX_ENTER(&call->lock);
1439 if (call->state == RX_STATE_DALLY) {
1440 if (ignoreBusy && conn->lastBusy[i]) {
1441 /* if we're ignoring busy call slots, skip any ones that
1442 * have lastBusy set */
1443 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1444 leastBusy = conn->lastBusy[i];
1446 MUTEX_EXIT(&call->lock);
1451 * We are setting the state to RX_STATE_RESET to
1452 * ensure that no one else will attempt to use this
1453 * call once we drop the conn->conn_call_lock and
1454 * call->lock. We must drop the conn->conn_call_lock
1455 * before calling rxi_ResetCall because the process
1456 * of clearing the transmit queue can block for an
1457 * extended period of time. If we block while holding
1458 * the conn->conn_call_lock, then all rx_EndCall
1459 * processing will block as well. This has a detrimental
1460 * effect on overall system performance.
1462 call->state = RX_STATE_RESET;
1463 MUTEX_EXIT(&conn->conn_call_lock);
1464 MUTEX_ENTER(&rx_refcnt_mutex);
1465 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1466 MUTEX_EXIT(&rx_refcnt_mutex);
1467 rxi_ResetCall(call, 0);
1468 (*call->callNumber)++;
1469 if (MUTEX_TRYENTER(&conn->conn_call_lock))
1473 * If we failed to be able to safely obtain the
1474 * conn->conn_call_lock we will have to drop the
1475 * call->lock to avoid a deadlock. When the call->lock
1476 * is released the state of the call can change. If it
1477 * is no longer RX_STATE_RESET then some other thread is
1480 MUTEX_EXIT(&call->lock);
1481 MUTEX_ENTER(&conn->conn_call_lock);
1482 MUTEX_ENTER(&call->lock);
1484 if (call->state == RX_STATE_RESET)
1488 * If we get here it means that after dropping
1489 * the conn->conn_call_lock and call->lock that
1490 * the call is no longer ours. If we can't find
1491 * a free call in the remaining slots we should
1492 * not go immediately to RX_CONN_MAKECALL_WAITING
1493 * because by dropping the conn->conn_call_lock
1494 * we have given up synchronization with rx_EndCall.
1495 * Instead, cycle through one more time to see if
1496 * we can find a call that can call our own.
1498 MUTEX_ENTER(&rx_refcnt_mutex);
1499 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
1500 MUTEX_EXIT(&rx_refcnt_mutex);
1503 MUTEX_EXIT(&call->lock);
1506 if (ignoreBusy && conn->lastBusy[i]) {
1507 /* if we're ignoring busy call slots, skip any ones that
1508 * have lastBusy set */
1509 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1510 leastBusy = conn->lastBusy[i];
1515 /* rxi_NewCall returns with mutex locked */
1516 call = rxi_NewCall(conn, i);
1517 MUTEX_ENTER(&rx_refcnt_mutex);
1518 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1519 MUTEX_EXIT(&rx_refcnt_mutex);
1523 if (i < RX_MAXCALLS) {
1524 conn->lastBusy[i] = 0;
1529 if (leastBusy && ignoreBusy) {
1530 /* we didn't find a useable call slot, but we did see at least one
1531 * 'busy' slot; look again and only use a slot with the 'least
1537 MUTEX_ENTER(&conn->conn_data_lock);
1538 conn->flags |= RX_CONN_MAKECALL_WAITING;
1539 conn->makeCallWaiters++;
1540 MUTEX_EXIT(&conn->conn_data_lock);
1542 #ifdef RX_ENABLE_LOCKS
1543 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1547 MUTEX_ENTER(&conn->conn_data_lock);
1548 conn->makeCallWaiters--;
1549 if (conn->makeCallWaiters == 0)
1550 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1551 MUTEX_EXIT(&conn->conn_data_lock);
1553 /* Client is initially in send mode */
1554 call->state = RX_STATE_ACTIVE;
1555 call->error = conn->error;
1557 call->mode = RX_MODE_ERROR;
1559 call->mode = RX_MODE_SENDING;
1561 /* remember start time for call in case we have hard dead time limit */
1562 call->queueTime = queueTime;
1563 clock_GetTime(&call->startTime);
1564 hzero(call->bytesSent);
1565 hzero(call->bytesRcvd);
1567 /* Turn on busy protocol. */
1568 rxi_KeepAliveOn(call);
1570 /* Attempt MTU discovery */
1571 rxi_GrowMTUOn(call);
1574 * We are no longer the active thread in rx_NewCall
1576 MUTEX_ENTER(&conn->conn_data_lock);
1577 conn->flags &= ~RX_CONN_MAKECALL_ACTIVE;
1578 MUTEX_EXIT(&conn->conn_data_lock);
1581 * Wake up anyone else who might be giving us a chance to
1582 * run (see code above that avoids resource starvation).
1584 #ifdef RX_ENABLE_LOCKS
1585 CV_BROADCAST(&conn->conn_call_cv);
1589 MUTEX_EXIT(&conn->conn_call_lock);
1591 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
1592 if (call->flags & (RX_CALL_TQ_BUSY | RX_CALL_TQ_CLEARME)) {
1593 osi_Panic("rx_NewCall call about to be used without an empty tq");
1595 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
1597 MUTEX_EXIT(&call->lock);
1600 dpf(("rx_NewCall(call %"AFS_PTR_FMT")\n", call));
1605 rxi_HasActiveCalls(struct rx_connection *aconn)
1608 struct rx_call *tcall;
1612 for (i = 0; i < RX_MAXCALLS; i++) {
1613 if ((tcall = aconn->call[i])) {
1614 if ((tcall->state == RX_STATE_ACTIVE)
1615 || (tcall->state == RX_STATE_PRECALL)) {
1626 rxi_GetCallNumberVector(struct rx_connection *aconn,
1627 afs_int32 * aint32s)
1630 struct rx_call *tcall;
1634 for (i = 0; i < RX_MAXCALLS; i++) {
1635 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1636 aint32s[i] = aconn->callNumber[i] + 1;
1638 aint32s[i] = aconn->callNumber[i];
1645 rxi_SetCallNumberVector(struct rx_connection *aconn,
1646 afs_int32 * aint32s)
1649 struct rx_call *tcall;
1653 for (i = 0; i < RX_MAXCALLS; i++) {
1654 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1655 aconn->callNumber[i] = aint32s[i] - 1;
1657 aconn->callNumber[i] = aint32s[i];
1663 /* Advertise a new service. A service is named locally by a UDP port
1664 * number plus a 16-bit service id. Returns (struct rx_service *) 0
1667 char *serviceName; Name for identification purposes (e.g. the
1668 service name might be used for probing for
1671 rx_NewServiceHost(afs_uint32 host, u_short port, u_short serviceId,
1672 char *serviceName, struct rx_securityClass **securityObjects,
1673 int nSecurityObjects,
1674 afs_int32(*serviceProc) (struct rx_call * acall))
1676 osi_socket socket = OSI_NULLSOCKET;
1677 struct rx_service *tservice;
1683 if (serviceId == 0) {
1685 "rx_NewService: service id for service %s is not non-zero.\n",
1692 "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",
1700 tservice = rxi_AllocService();
1703 #ifdef RX_ENABLE_LOCKS
1704 MUTEX_INIT(&tservice->svc_data_lock, "svc data lock", MUTEX_DEFAULT, 0);
1707 for (i = 0; i < RX_MAX_SERVICES; i++) {
1708 struct rx_service *service = rx_services[i];
1710 if (port == service->servicePort && host == service->serviceHost) {
1711 if (service->serviceId == serviceId) {
1712 /* The identical service has already been
1713 * installed; if the caller was intending to
1714 * change the security classes used by this
1715 * service, he/she loses. */
1717 "rx_NewService: tried to install service %s with service id %d, which is already in use for service %s\n",
1718 serviceName, serviceId, service->serviceName);
1720 rxi_FreeService(tservice);
1723 /* Different service, same port: re-use the socket
1724 * which is bound to the same port */
1725 socket = service->socket;
1728 if (socket == OSI_NULLSOCKET) {
1729 /* If we don't already have a socket (from another
1730 * service on same port) get a new one */
1731 socket = rxi_GetHostUDPSocket(host, port);
1732 if (socket == OSI_NULLSOCKET) {
1734 rxi_FreeService(tservice);
1739 service->socket = socket;
1740 service->serviceHost = host;
1741 service->servicePort = port;
1742 service->serviceId = serviceId;
1743 service->serviceName = serviceName;
1744 service->nSecurityObjects = nSecurityObjects;
1745 service->securityObjects = securityObjects;
1746 service->minProcs = 0;
1747 service->maxProcs = 1;
1748 service->idleDeadTime = 60;
1749 service->idleDeadErr = 0;
1750 service->connDeadTime = rx_connDeadTime;
1751 service->executeRequestProc = serviceProc;
1752 service->checkReach = 0;
1753 service->nSpecific = 0;
1754 service->specific = NULL;
1755 rx_services[i] = service; /* not visible until now */
1761 rxi_FreeService(tservice);
1762 (osi_Msg "rx_NewService: cannot support > %d services\n",
1767 /* Set configuration options for all of a service's security objects */
1770 rx_SetSecurityConfiguration(struct rx_service *service,
1771 rx_securityConfigVariables type,
1775 for (i = 0; i<service->nSecurityObjects; i++) {
1776 if (service->securityObjects[i]) {
1777 RXS_SetConfiguration(service->securityObjects[i], NULL, type,
1785 rx_NewService(u_short port, u_short serviceId, char *serviceName,
1786 struct rx_securityClass **securityObjects, int nSecurityObjects,
1787 afs_int32(*serviceProc) (struct rx_call * acall))
1789 return rx_NewServiceHost(htonl(INADDR_ANY), port, serviceId, serviceName, securityObjects, nSecurityObjects, serviceProc);
1792 /* Generic request processing loop. This routine should be called
1793 * by the implementation dependent rx_ServerProc. If socketp is
1794 * non-null, it will be set to the file descriptor that this thread
1795 * is now listening on. If socketp is null, this routine will never
1798 rxi_ServerProc(int threadID, struct rx_call *newcall, osi_socket * socketp)
1800 struct rx_call *call;
1802 struct rx_service *tservice = NULL;
1809 call = rx_GetCall(threadID, tservice, socketp);
1810 if (socketp && *socketp != OSI_NULLSOCKET) {
1811 /* We are now a listener thread */
1816 /* if server is restarting( typically smooth shutdown) then do not
1817 * allow any new calls.
1820 if (rx_tranquil && (call != NULL)) {
1824 MUTEX_ENTER(&call->lock);
1826 rxi_CallError(call, RX_RESTARTING);
1827 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1829 MUTEX_EXIT(&call->lock);
1833 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1834 #ifdef RX_ENABLE_LOCKS
1836 #endif /* RX_ENABLE_LOCKS */
1837 afs_termState = AFSOP_STOP_AFS;
1838 afs_osi_Wakeup(&afs_termState);
1839 #ifdef RX_ENABLE_LOCKS
1841 #endif /* RX_ENABLE_LOCKS */
1846 tservice = call->conn->service;
1848 if (tservice->beforeProc)
1849 (*tservice->beforeProc) (call);
1851 code = tservice->executeRequestProc(call);
1853 if (tservice->afterProc)
1854 (*tservice->afterProc) (call, code);
1856 rx_EndCall(call, code);
1857 if (rx_stats_active) {
1858 MUTEX_ENTER(&rx_stats_mutex);
1860 MUTEX_EXIT(&rx_stats_mutex);
1867 rx_WakeupServerProcs(void)
1869 struct rx_serverQueueEntry *np, *tqp;
1873 MUTEX_ENTER(&rx_serverPool_lock);
1875 #ifdef RX_ENABLE_LOCKS
1876 if (rx_waitForPacket)
1877 CV_BROADCAST(&rx_waitForPacket->cv);
1878 #else /* RX_ENABLE_LOCKS */
1879 if (rx_waitForPacket)
1880 osi_rxWakeup(rx_waitForPacket);
1881 #endif /* RX_ENABLE_LOCKS */
1882 MUTEX_ENTER(&freeSQEList_lock);
1883 for (np = rx_FreeSQEList; np; np = tqp) {
1884 tqp = *(struct rx_serverQueueEntry **)np;
1885 #ifdef RX_ENABLE_LOCKS
1886 CV_BROADCAST(&np->cv);
1887 #else /* RX_ENABLE_LOCKS */
1889 #endif /* RX_ENABLE_LOCKS */
1891 MUTEX_EXIT(&freeSQEList_lock);
1892 for (queue_Scan(&rx_idleServerQueue, np, tqp, rx_serverQueueEntry)) {
1893 #ifdef RX_ENABLE_LOCKS
1894 CV_BROADCAST(&np->cv);
1895 #else /* RX_ENABLE_LOCKS */
1897 #endif /* RX_ENABLE_LOCKS */
1899 MUTEX_EXIT(&rx_serverPool_lock);
1904 * One thing that seems to happen is that all the server threads get
1905 * tied up on some empty or slow call, and then a whole bunch of calls
1906 * arrive at once, using up the packet pool, so now there are more
1907 * empty calls. The most critical resources here are server threads
1908 * and the free packet pool. The "doreclaim" code seems to help in
1909 * general. I think that eventually we arrive in this state: there
1910 * are lots of pending calls which do have all their packets present,
1911 * so they won't be reclaimed, are multi-packet calls, so they won't
1912 * be scheduled until later, and thus are tying up most of the free
1913 * packet pool for a very long time.
1915 * 1. schedule multi-packet calls if all the packets are present.
1916 * Probably CPU-bound operation, useful to return packets to pool.
1917 * Do what if there is a full window, but the last packet isn't here?
1918 * 3. preserve one thread which *only* runs "best" calls, otherwise
1919 * it sleeps and waits for that type of call.
1920 * 4. Don't necessarily reserve a whole window for each thread. In fact,
1921 * the current dataquota business is badly broken. The quota isn't adjusted
1922 * to reflect how many packets are presently queued for a running call.
1923 * So, when we schedule a queued call with a full window of packets queued
1924 * up for it, that *should* free up a window full of packets for other 2d-class
1925 * calls to be able to use from the packet pool. But it doesn't.
1927 * NB. Most of the time, this code doesn't run -- since idle server threads
1928 * sit on the idle server queue and are assigned by "...ReceivePacket" as soon
1929 * as a new call arrives.
1931 /* Sleep until a call arrives. Returns a pointer to the call, ready
1932 * for an rx_Read. */
1933 #ifdef RX_ENABLE_LOCKS
1935 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
1937 struct rx_serverQueueEntry *sq;
1938 struct rx_call *call = (struct rx_call *)0;
1939 struct rx_service *service = NULL;
1941 MUTEX_ENTER(&freeSQEList_lock);
1943 if ((sq = rx_FreeSQEList)) {
1944 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
1945 MUTEX_EXIT(&freeSQEList_lock);
1946 } else { /* otherwise allocate a new one and return that */
1947 MUTEX_EXIT(&freeSQEList_lock);
1948 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
1949 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
1950 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
1953 MUTEX_ENTER(&rx_serverPool_lock);
1954 if (cur_service != NULL) {
1955 ReturnToServerPool(cur_service);
1958 if (queue_IsNotEmpty(&rx_incomingCallQueue)) {
1959 struct rx_call *tcall, *ncall, *choice2 = NULL;
1961 /* Scan for eligible incoming calls. A call is not eligible
1962 * if the maximum number of calls for its service type are
1963 * already executing */
1964 /* One thread will process calls FCFS (to prevent starvation),
1965 * while the other threads may run ahead looking for calls which
1966 * have all their input data available immediately. This helps
1967 * keep threads from blocking, waiting for data from the client. */
1968 for (queue_Scan(&rx_incomingCallQueue, tcall, ncall, rx_call)) {
1969 service = tcall->conn->service;
1970 if (!QuotaOK(service)) {
1973 MUTEX_ENTER(&rx_pthread_mutex);
1974 if (tno == rxi_fcfs_thread_num
1975 || !tcall->queue_item_header.next) {
1976 MUTEX_EXIT(&rx_pthread_mutex);
1977 /* If we're the fcfs thread , then we'll just use
1978 * this call. If we haven't been able to find an optimal
1979 * choice, and we're at the end of the list, then use a
1980 * 2d choice if one has been identified. Otherwise... */
1981 call = (choice2 ? choice2 : tcall);
1982 service = call->conn->service;
1984 MUTEX_EXIT(&rx_pthread_mutex);
1985 if (!queue_IsEmpty(&tcall->rq)) {
1986 struct rx_packet *rp;
1987 rp = queue_First(&tcall->rq, rx_packet);
1988 if (rp->header.seq == 1) {
1990 || (rp->header.flags & RX_LAST_PACKET)) {
1992 } else if (rxi_2dchoice && !choice2
1993 && !(tcall->flags & RX_CALL_CLEARED)
1994 && (tcall->rprev > rxi_HardAckRate)) {
2004 ReturnToServerPool(service);
2011 MUTEX_EXIT(&rx_serverPool_lock);
2012 MUTEX_ENTER(&call->lock);
2014 if (call->flags & RX_CALL_WAIT_PROC) {
2015 call->flags &= ~RX_CALL_WAIT_PROC;
2016 rx_atomic_dec(&rx_nWaiting);
2019 if (call->state != RX_STATE_PRECALL || call->error) {
2020 MUTEX_EXIT(&call->lock);
2021 MUTEX_ENTER(&rx_serverPool_lock);
2022 ReturnToServerPool(service);
2027 if (queue_IsEmpty(&call->rq)
2028 || queue_First(&call->rq, rx_packet)->header.seq != 1)
2029 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2031 CLEAR_CALL_QUEUE_LOCK(call);
2034 /* If there are no eligible incoming calls, add this process
2035 * to the idle server queue, to wait for one */
2039 *socketp = OSI_NULLSOCKET;
2041 sq->socketp = socketp;
2042 queue_Append(&rx_idleServerQueue, sq);
2043 #ifndef AFS_AIX41_ENV
2044 rx_waitForPacket = sq;
2046 rx_waitingForPacket = sq;
2047 #endif /* AFS_AIX41_ENV */
2049 CV_WAIT(&sq->cv, &rx_serverPool_lock);
2051 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2052 MUTEX_EXIT(&rx_serverPool_lock);
2053 return (struct rx_call *)0;
2056 } while (!(call = sq->newcall)
2057 && !(socketp && *socketp != OSI_NULLSOCKET));
2058 MUTEX_EXIT(&rx_serverPool_lock);
2060 MUTEX_ENTER(&call->lock);
2066 MUTEX_ENTER(&freeSQEList_lock);
2067 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2068 rx_FreeSQEList = sq;
2069 MUTEX_EXIT(&freeSQEList_lock);
2072 clock_GetTime(&call->startTime);
2073 call->state = RX_STATE_ACTIVE;
2074 call->mode = RX_MODE_RECEIVING;
2075 #ifdef RX_KERNEL_TRACE
2076 if (ICL_SETACTIVE(afs_iclSetp)) {
2077 int glockOwner = ISAFS_GLOCK();
2080 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2081 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2088 rxi_calltrace(RX_CALL_START, call);
2089 dpf(("rx_GetCall(port=%d, service=%d) ==> call %"AFS_PTR_FMT"\n",
2090 call->conn->service->servicePort, call->conn->service->serviceId,
2093 MUTEX_EXIT(&call->lock);
2094 MUTEX_ENTER(&rx_refcnt_mutex);
2095 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
2096 MUTEX_EXIT(&rx_refcnt_mutex);
2098 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2103 #else /* RX_ENABLE_LOCKS */
2105 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2107 struct rx_serverQueueEntry *sq;
2108 struct rx_call *call = (struct rx_call *)0, *choice2;
2109 struct rx_service *service = NULL;
2113 MUTEX_ENTER(&freeSQEList_lock);
2115 if ((sq = rx_FreeSQEList)) {
2116 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2117 MUTEX_EXIT(&freeSQEList_lock);
2118 } else { /* otherwise allocate a new one and return that */
2119 MUTEX_EXIT(&freeSQEList_lock);
2120 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2121 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2122 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2124 MUTEX_ENTER(&sq->lock);
2126 if (cur_service != NULL) {
2127 cur_service->nRequestsRunning--;
2128 MUTEX_ENTER(&rx_quota_mutex);
2129 if (cur_service->nRequestsRunning < cur_service->minProcs)
2132 MUTEX_EXIT(&rx_quota_mutex);
2134 if (queue_IsNotEmpty(&rx_incomingCallQueue)) {
2135 struct rx_call *tcall, *ncall;
2136 /* Scan for eligible incoming calls. A call is not eligible
2137 * if the maximum number of calls for its service type are
2138 * already executing */
2139 /* One thread will process calls FCFS (to prevent starvation),
2140 * while the other threads may run ahead looking for calls which
2141 * have all their input data available immediately. This helps
2142 * keep threads from blocking, waiting for data from the client. */
2143 choice2 = (struct rx_call *)0;
2144 for (queue_Scan(&rx_incomingCallQueue, tcall, ncall, rx_call)) {
2145 service = tcall->conn->service;
2146 if (QuotaOK(service)) {
2147 MUTEX_ENTER(&rx_pthread_mutex);
2148 if (tno == rxi_fcfs_thread_num
2149 || !tcall->queue_item_header.next) {
2150 MUTEX_EXIT(&rx_pthread_mutex);
2151 /* If we're the fcfs thread, then we'll just use
2152 * this call. If we haven't been able to find an optimal
2153 * choice, and we're at the end of the list, then use a
2154 * 2d choice if one has been identified. Otherwise... */
2155 call = (choice2 ? choice2 : tcall);
2156 service = call->conn->service;
2158 MUTEX_EXIT(&rx_pthread_mutex);
2159 if (!queue_IsEmpty(&tcall->rq)) {
2160 struct rx_packet *rp;
2161 rp = queue_First(&tcall->rq, rx_packet);
2162 if (rp->header.seq == 1
2164 || (rp->header.flags & RX_LAST_PACKET))) {
2166 } else if (rxi_2dchoice && !choice2
2167 && !(tcall->flags & RX_CALL_CLEARED)
2168 && (tcall->rprev > rxi_HardAckRate)) {
2182 /* we can't schedule a call if there's no data!!! */
2183 /* send an ack if there's no data, if we're missing the
2184 * first packet, or we're missing something between first
2185 * and last -- there's a "hole" in the incoming data. */
2186 if (queue_IsEmpty(&call->rq)
2187 || queue_First(&call->rq, rx_packet)->header.seq != 1
2188 || call->rprev != queue_Last(&call->rq, rx_packet)->header.seq)
2189 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2191 call->flags &= (~RX_CALL_WAIT_PROC);
2192 service->nRequestsRunning++;
2193 /* just started call in minProcs pool, need fewer to maintain
2195 MUTEX_ENTER(&rx_quota_mutex);
2196 if (service->nRequestsRunning <= service->minProcs)
2199 MUTEX_EXIT(&rx_quota_mutex);
2200 rx_atomic_dec(&rx_nWaiting);
2201 /* MUTEX_EXIT(&call->lock); */
2203 /* If there are no eligible incoming calls, add this process
2204 * to the idle server queue, to wait for one */
2207 *socketp = OSI_NULLSOCKET;
2209 sq->socketp = socketp;
2210 queue_Append(&rx_idleServerQueue, sq);
2214 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2216 rxi_Free(sq, sizeof(struct rx_serverQueueEntry));
2217 return (struct rx_call *)0;
2220 } while (!(call = sq->newcall)
2221 && !(socketp && *socketp != OSI_NULLSOCKET));
2223 MUTEX_EXIT(&sq->lock);
2225 MUTEX_ENTER(&freeSQEList_lock);
2226 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2227 rx_FreeSQEList = sq;
2228 MUTEX_EXIT(&freeSQEList_lock);
2231 clock_GetTime(&call->startTime);
2232 call->state = RX_STATE_ACTIVE;
2233 call->mode = RX_MODE_RECEIVING;
2234 #ifdef RX_KERNEL_TRACE
2235 if (ICL_SETACTIVE(afs_iclSetp)) {
2236 int glockOwner = ISAFS_GLOCK();
2239 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2240 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2247 rxi_calltrace(RX_CALL_START, call);
2248 dpf(("rx_GetCall(port=%d, service=%d) ==> call %p\n",
2249 call->conn->service->servicePort, call->conn->service->serviceId,
2252 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2259 #endif /* RX_ENABLE_LOCKS */
2263 /* Establish a procedure to be called when a packet arrives for a
2264 * call. This routine will be called at most once after each call,
2265 * and will also be called if there is an error condition on the or
2266 * the call is complete. Used by multi rx to build a selection
2267 * function which determines which of several calls is likely to be a
2268 * good one to read from.
2269 * NOTE: the way this is currently implemented it is probably only a
2270 * good idea to (1) use it immediately after a newcall (clients only)
2271 * and (2) only use it once. Other uses currently void your warranty
2274 rx_SetArrivalProc(struct rx_call *call,
2275 void (*proc) (struct rx_call * call,
2278 void * handle, int arg)
2280 call->arrivalProc = proc;
2281 call->arrivalProcHandle = handle;
2282 call->arrivalProcArg = arg;
2285 /* Call is finished (possibly prematurely). Return rc to the peer, if
2286 * appropriate, and return the final error code from the conversation
2290 rx_EndCall(struct rx_call *call, afs_int32 rc)
2292 struct rx_connection *conn = call->conn;
2296 dpf(("rx_EndCall(call %"AFS_PTR_FMT" rc %d error %d abortCode %d)\n",
2297 call, rc, call->error, call->abortCode));
2300 MUTEX_ENTER(&call->lock);
2302 if (rc == 0 && call->error == 0) {
2303 call->abortCode = 0;
2304 call->abortCount = 0;
2307 call->arrivalProc = (void (*)())0;
2308 if (rc && call->error == 0) {
2309 rxi_CallError(call, rc);
2310 call->mode = RX_MODE_ERROR;
2311 /* Send an abort message to the peer if this error code has
2312 * only just been set. If it was set previously, assume the
2313 * peer has already been sent the error code or will request it
2315 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
2317 if (conn->type == RX_SERVER_CONNECTION) {
2318 /* Make sure reply or at least dummy reply is sent */
2319 if (call->mode == RX_MODE_RECEIVING) {
2320 MUTEX_EXIT(&call->lock);
2321 rxi_WriteProc(call, 0, 0);
2322 MUTEX_ENTER(&call->lock);
2324 if (call->mode == RX_MODE_SENDING) {
2325 MUTEX_EXIT(&call->lock);
2326 rxi_FlushWrite(call);
2327 MUTEX_ENTER(&call->lock);
2329 rxi_calltrace(RX_CALL_END, call);
2330 /* Call goes to hold state until reply packets are acknowledged */
2331 if (call->tfirst + call->nSoftAcked < call->tnext) {
2332 call->state = RX_STATE_HOLD;
2334 call->state = RX_STATE_DALLY;
2335 rxi_ClearTransmitQueue(call, 0);
2336 rxi_rto_cancel(call);
2337 rxevent_Cancel(call->keepAliveEvent, call,
2338 RX_CALL_REFCOUNT_ALIVE);
2340 } else { /* Client connection */
2342 /* Make sure server receives input packets, in the case where
2343 * no reply arguments are expected */
2344 if ((call->mode == RX_MODE_SENDING)
2345 || (call->mode == RX_MODE_RECEIVING && call->rnext == 1)) {
2346 MUTEX_EXIT(&call->lock);
2347 (void)rxi_ReadProc(call, &dummy, 1);
2348 MUTEX_ENTER(&call->lock);
2351 /* If we had an outstanding delayed ack, be nice to the server
2352 * and force-send it now.
2354 if (call->delayedAckEvent) {
2355 rxevent_Cancel(call->delayedAckEvent, call,
2356 RX_CALL_REFCOUNT_DELAY);
2357 call->delayedAckEvent = NULL;
2358 rxi_SendDelayedAck(NULL, call, NULL);
2361 /* We need to release the call lock since it's lower than the
2362 * conn_call_lock and we don't want to hold the conn_call_lock
2363 * over the rx_ReadProc call. The conn_call_lock needs to be held
2364 * here for the case where rx_NewCall is perusing the calls on
2365 * the connection structure. We don't want to signal until
2366 * rx_NewCall is in a stable state. Otherwise, rx_NewCall may
2367 * have checked this call, found it active and by the time it
2368 * goes to sleep, will have missed the signal.
2370 MUTEX_EXIT(&call->lock);
2371 MUTEX_ENTER(&conn->conn_call_lock);
2372 MUTEX_ENTER(&call->lock);
2374 if (!(call->flags & RX_CALL_PEER_BUSY)) {
2375 conn->lastBusy[call->channel] = 0;
2378 MUTEX_ENTER(&conn->conn_data_lock);
2379 conn->flags |= RX_CONN_BUSY;
2380 if (conn->flags & RX_CONN_MAKECALL_WAITING) {
2381 MUTEX_EXIT(&conn->conn_data_lock);
2382 #ifdef RX_ENABLE_LOCKS
2383 CV_BROADCAST(&conn->conn_call_cv);
2388 #ifdef RX_ENABLE_LOCKS
2390 MUTEX_EXIT(&conn->conn_data_lock);
2392 #endif /* RX_ENABLE_LOCKS */
2393 call->state = RX_STATE_DALLY;
2395 error = call->error;
2397 /* currentPacket, nLeft, and NFree must be zeroed here, because
2398 * ResetCall cannot: ResetCall may be called at splnet(), in the
2399 * kernel version, and may interrupt the macros rx_Read or
2400 * rx_Write, which run at normal priority for efficiency. */
2401 if (call->currentPacket) {
2402 #ifdef RX_TRACK_PACKETS
2403 call->currentPacket->flags &= ~RX_PKTFLAG_CP;
2405 rxi_FreePacket(call->currentPacket);
2406 call->currentPacket = (struct rx_packet *)0;
2409 call->nLeft = call->nFree = call->curlen = 0;
2411 /* Free any packets from the last call to ReadvProc/WritevProc */
2412 #ifdef RXDEBUG_PACKET
2414 #endif /* RXDEBUG_PACKET */
2415 rxi_FreePackets(0, &call->iovq);
2416 MUTEX_EXIT(&call->lock);
2418 MUTEX_ENTER(&rx_refcnt_mutex);
2419 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
2420 MUTEX_EXIT(&rx_refcnt_mutex);
2421 if (conn->type == RX_CLIENT_CONNECTION) {
2422 MUTEX_ENTER(&conn->conn_data_lock);
2423 conn->flags &= ~RX_CONN_BUSY;
2424 MUTEX_EXIT(&conn->conn_data_lock);
2425 MUTEX_EXIT(&conn->conn_call_lock);
2429 * Map errors to the local host's errno.h format.
2431 error = ntoh_syserr_conv(error);
2435 #if !defined(KERNEL)
2437 /* Call this routine when shutting down a server or client (especially
2438 * clients). This will allow Rx to gracefully garbage collect server
2439 * connections, and reduce the number of retries that a server might
2440 * make to a dead client.
2441 * This is not quite right, since some calls may still be ongoing and
2442 * we can't lock them to destroy them. */
2446 struct rx_connection **conn_ptr, **conn_end;
2450 if (rxinit_status == 1) {
2452 return; /* Already shutdown. */
2454 rxi_DeleteCachedConnections();
2455 if (rx_connHashTable) {
2456 MUTEX_ENTER(&rx_connHashTable_lock);
2457 for (conn_ptr = &rx_connHashTable[0], conn_end =
2458 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
2460 struct rx_connection *conn, *next;
2461 for (conn = *conn_ptr; conn; conn = next) {
2463 if (conn->type == RX_CLIENT_CONNECTION) {
2464 MUTEX_ENTER(&rx_refcnt_mutex);
2466 MUTEX_EXIT(&rx_refcnt_mutex);
2467 #ifdef RX_ENABLE_LOCKS
2468 rxi_DestroyConnectionNoLock(conn);
2469 #else /* RX_ENABLE_LOCKS */
2470 rxi_DestroyConnection(conn);
2471 #endif /* RX_ENABLE_LOCKS */
2475 #ifdef RX_ENABLE_LOCKS
2476 while (rx_connCleanup_list) {
2477 struct rx_connection *conn;
2478 conn = rx_connCleanup_list;
2479 rx_connCleanup_list = rx_connCleanup_list->next;
2480 MUTEX_EXIT(&rx_connHashTable_lock);
2481 rxi_CleanupConnection(conn);
2482 MUTEX_ENTER(&rx_connHashTable_lock);
2484 MUTEX_EXIT(&rx_connHashTable_lock);
2485 #endif /* RX_ENABLE_LOCKS */
2490 afs_winsockCleanup();
2498 /* if we wakeup packet waiter too often, can get in loop with two
2499 AllocSendPackets each waking each other up (from ReclaimPacket calls) */
2501 rxi_PacketsUnWait(void)
2503 if (!rx_waitingForPackets) {
2507 if (rxi_OverQuota(RX_PACKET_CLASS_SEND)) {
2508 return; /* still over quota */
2511 rx_waitingForPackets = 0;
2512 #ifdef RX_ENABLE_LOCKS
2513 CV_BROADCAST(&rx_waitingForPackets_cv);
2515 osi_rxWakeup(&rx_waitingForPackets);
2521 /* ------------------Internal interfaces------------------------- */
2523 /* Return this process's service structure for the
2524 * specified socket and service */
2525 static struct rx_service *
2526 rxi_FindService(osi_socket socket, u_short serviceId)
2528 struct rx_service **sp;
2529 for (sp = &rx_services[0]; *sp; sp++) {
2530 if ((*sp)->serviceId == serviceId && (*sp)->socket == socket)
2536 #ifdef RXDEBUG_PACKET
2537 #ifdef KDUMP_RX_LOCK
2538 static struct rx_call_rx_lock *rx_allCallsp = 0;
2540 static struct rx_call *rx_allCallsp = 0;
2542 #endif /* RXDEBUG_PACKET */
2544 /* Allocate a call structure, for the indicated channel of the
2545 * supplied connection. The mode and state of the call must be set by
2546 * the caller. Returns the call with mutex locked. */
2547 static struct rx_call *
2548 rxi_NewCall(struct rx_connection *conn, int channel)
2550 struct rx_call *call;
2551 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2552 struct rx_call *cp; /* Call pointer temp */
2553 struct rx_call *nxp; /* Next call pointer, for queue_Scan */
2554 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2556 dpf(("rxi_NewCall(conn %"AFS_PTR_FMT", channel %d)\n", conn, channel));
2558 /* Grab an existing call structure, or allocate a new one.
2559 * Existing call structures are assumed to have been left reset by
2561 MUTEX_ENTER(&rx_freeCallQueue_lock);
2563 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2565 * EXCEPT that the TQ might not yet be cleared out.
2566 * Skip over those with in-use TQs.
2569 for (queue_Scan(&rx_freeCallQueue, cp, nxp, rx_call)) {
2570 if (!(cp->flags & RX_CALL_TQ_BUSY)) {
2576 #else /* AFS_GLOBAL_RXLOCK_KERNEL */
2577 if (queue_IsNotEmpty(&rx_freeCallQueue)) {
2578 call = queue_First(&rx_freeCallQueue, rx_call);
2579 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2581 if (rx_stats_active)
2582 rx_atomic_dec(&rx_stats.nFreeCallStructs);
2583 MUTEX_EXIT(&rx_freeCallQueue_lock);
2584 MUTEX_ENTER(&call->lock);
2585 CLEAR_CALL_QUEUE_LOCK(call);
2586 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2587 /* Now, if TQ wasn't cleared earlier, do it now. */
2588 rxi_WaitforTQBusy(call);
2589 if (call->flags & RX_CALL_TQ_CLEARME) {
2590 rxi_ClearTransmitQueue(call, 1);
2591 /*queue_Init(&call->tq);*/
2593 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2594 /* Bind the call to its connection structure */
2596 rxi_ResetCall(call, 1);
2599 call = rxi_Alloc(sizeof(struct rx_call));
2600 #ifdef RXDEBUG_PACKET
2601 call->allNextp = rx_allCallsp;
2602 rx_allCallsp = call;
2604 rx_atomic_inc_and_read(&rx_stats.nCallStructs);
2605 #else /* RXDEBUG_PACKET */
2606 rx_atomic_inc(&rx_stats.nCallStructs);
2607 #endif /* RXDEBUG_PACKET */
2609 MUTEX_EXIT(&rx_freeCallQueue_lock);
2610 MUTEX_INIT(&call->lock, "call lock", MUTEX_DEFAULT, NULL);
2611 MUTEX_ENTER(&call->lock);
2612 CV_INIT(&call->cv_twind, "call twind", CV_DEFAULT, 0);
2613 CV_INIT(&call->cv_rq, "call rq", CV_DEFAULT, 0);
2614 CV_INIT(&call->cv_tq, "call tq", CV_DEFAULT, 0);
2616 /* Initialize once-only items */
2617 queue_Init(&call->tq);
2618 queue_Init(&call->rq);
2619 queue_Init(&call->iovq);
2620 #ifdef RXDEBUG_PACKET
2621 call->rqc = call->tqc = call->iovqc = 0;
2622 #endif /* RXDEBUG_PACKET */
2623 /* Bind the call to its connection structure (prereq for reset) */
2625 rxi_ResetCall(call, 1);
2627 call->channel = channel;
2628 call->callNumber = &conn->callNumber[channel];
2629 call->rwind = conn->rwind[channel];
2630 call->twind = conn->twind[channel];
2631 /* Note that the next expected call number is retained (in
2632 * conn->callNumber[i]), even if we reallocate the call structure
2634 conn->call[channel] = call;
2635 /* if the channel's never been used (== 0), we should start at 1, otherwise
2636 * the call number is valid from the last time this channel was used */
2637 if (*call->callNumber == 0)
2638 *call->callNumber = 1;
2643 /* A call has been inactive long enough that so we can throw away
2644 * state, including the call structure, which is placed on the call
2647 * call->lock amd rx_refcnt_mutex are held upon entry.
2648 * haveCTLock is set when called from rxi_ReapConnections.
2651 rxi_FreeCall(struct rx_call *call, int haveCTLock)
2653 int channel = call->channel;
2654 struct rx_connection *conn = call->conn;
2657 if (call->state == RX_STATE_DALLY || call->state == RX_STATE_HOLD)
2658 (*call->callNumber)++;
2660 * We are setting the state to RX_STATE_RESET to
2661 * ensure that no one else will attempt to use this
2662 * call once we drop the refcnt lock. We must drop
2663 * the refcnt lock before calling rxi_ResetCall
2664 * because it cannot be held across acquiring the
2665 * freepktQ lock. NewCall does the same.
2667 call->state = RX_STATE_RESET;
2668 MUTEX_EXIT(&rx_refcnt_mutex);
2669 rxi_ResetCall(call, 0);
2670 call->conn->call[channel] = (struct rx_call *)0;
2672 MUTEX_ENTER(&rx_freeCallQueue_lock);
2673 SET_CALL_QUEUE_LOCK(call, &rx_freeCallQueue_lock);
2674 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2675 /* A call may be free even though its transmit queue is still in use.
2676 * Since we search the call list from head to tail, put busy calls at
2677 * the head of the list, and idle calls at the tail.
2679 if (call->flags & RX_CALL_TQ_BUSY)
2680 queue_Prepend(&rx_freeCallQueue, call);
2682 queue_Append(&rx_freeCallQueue, call);
2683 #else /* AFS_GLOBAL_RXLOCK_KERNEL */
2684 queue_Append(&rx_freeCallQueue, call);
2685 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2686 if (rx_stats_active)
2687 rx_atomic_inc(&rx_stats.nFreeCallStructs);
2688 MUTEX_EXIT(&rx_freeCallQueue_lock);
2690 /* Destroy the connection if it was previously slated for
2691 * destruction, i.e. the Rx client code previously called
2692 * rx_DestroyConnection (client connections), or
2693 * rxi_ReapConnections called the same routine (server
2694 * connections). Only do this, however, if there are no
2695 * outstanding calls. Note that for fine grain locking, there appears
2696 * to be a deadlock in that rxi_FreeCall has a call locked and
2697 * DestroyConnectionNoLock locks each call in the conn. But note a
2698 * few lines up where we have removed this call from the conn.
2699 * If someone else destroys a connection, they either have no
2700 * call lock held or are going through this section of code.
2702 MUTEX_ENTER(&conn->conn_data_lock);
2703 if (conn->flags & RX_CONN_DESTROY_ME && !(conn->flags & RX_CONN_MAKECALL_WAITING)) {
2704 MUTEX_ENTER(&rx_refcnt_mutex);
2706 MUTEX_EXIT(&rx_refcnt_mutex);
2707 MUTEX_EXIT(&conn->conn_data_lock);
2708 #ifdef RX_ENABLE_LOCKS
2710 rxi_DestroyConnectionNoLock(conn);
2712 rxi_DestroyConnection(conn);
2713 #else /* RX_ENABLE_LOCKS */
2714 rxi_DestroyConnection(conn);
2715 #endif /* RX_ENABLE_LOCKS */
2717 MUTEX_EXIT(&conn->conn_data_lock);
2719 MUTEX_ENTER(&rx_refcnt_mutex);
2722 rx_atomic_t rxi_Allocsize = RX_ATOMIC_INIT(0);
2723 rx_atomic_t rxi_Alloccnt = RX_ATOMIC_INIT(0);
2726 rxi_Alloc(size_t size)
2730 if (rx_stats_active) {
2731 rx_atomic_add(&rxi_Allocsize, (int) size);
2732 rx_atomic_inc(&rxi_Alloccnt);
2736 #if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV)
2737 afs_osi_Alloc_NoSleep(size);
2742 osi_Panic("rxi_Alloc error");
2748 rxi_Free(void *addr, size_t size)
2750 if (rx_stats_active) {
2751 rx_atomic_sub(&rxi_Allocsize, (int) size);
2752 rx_atomic_dec(&rxi_Alloccnt);
2754 osi_Free(addr, size);
2758 rxi_SetPeerMtu(struct rx_peer *peer, afs_uint32 host, afs_uint32 port, int mtu)
2760 struct rx_peer **peer_ptr = NULL, **peer_end = NULL;
2761 struct rx_peer *next = NULL;
2765 MUTEX_ENTER(&rx_peerHashTable_lock);
2767 peer_ptr = &rx_peerHashTable[0];
2768 peer_end = &rx_peerHashTable[rx_hashTableSize];
2771 for ( ; peer_ptr < peer_end; peer_ptr++) {
2774 for ( ; peer; peer = next) {
2776 if (host == peer->host)
2781 hashIndex = PEER_HASH(host, port);
2782 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2783 if ((peer->host == host) && (peer->port == port))
2788 MUTEX_ENTER(&rx_peerHashTable_lock);
2793 MUTEX_EXIT(&rx_peerHashTable_lock);
2795 MUTEX_ENTER(&peer->peer_lock);
2796 /* We don't handle dropping below min, so don't */
2797 mtu = MAX(mtu, RX_MIN_PACKET_SIZE);
2798 peer->ifMTU=MIN(mtu, peer->ifMTU);
2799 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2800 /* if we tweaked this down, need to tune our peer MTU too */
2801 peer->MTU = MIN(peer->MTU, peer->natMTU);
2802 /* if we discovered a sub-1500 mtu, degrade */
2803 if (peer->ifMTU < OLD_MAX_PACKET_SIZE)
2804 peer->maxDgramPackets = 1;
2805 /* We no longer have valid peer packet information */
2806 if (peer->maxPacketSize-RX_IPUDP_SIZE > peer->ifMTU)
2807 peer->maxPacketSize = 0;
2808 MUTEX_EXIT(&peer->peer_lock);
2810 MUTEX_ENTER(&rx_peerHashTable_lock);
2812 if (host && !port) {
2814 /* pick up where we left off */
2818 MUTEX_EXIT(&rx_peerHashTable_lock);
2821 /* Find the peer process represented by the supplied (host,port)
2822 * combination. If there is no appropriate active peer structure, a
2823 * new one will be allocated and initialized
2824 * The origPeer, if set, is a pointer to a peer structure on which the
2825 * refcount will be be decremented. This is used to replace the peer
2826 * structure hanging off a connection structure */
2828 rxi_FindPeer(afs_uint32 host, u_short port,
2829 struct rx_peer *origPeer, int create)
2833 hashIndex = PEER_HASH(host, port);
2834 MUTEX_ENTER(&rx_peerHashTable_lock);
2835 for (pp = rx_peerHashTable[hashIndex]; pp; pp = pp->next) {
2836 if ((pp->host == host) && (pp->port == port))
2841 pp = rxi_AllocPeer(); /* This bzero's *pp */
2842 pp->host = host; /* set here or in InitPeerParams is zero */
2844 MUTEX_INIT(&pp->peer_lock, "peer_lock", MUTEX_DEFAULT, 0);
2845 queue_Init(&pp->congestionQueue);
2846 queue_Init(&pp->rpcStats);
2847 pp->next = rx_peerHashTable[hashIndex];
2848 rx_peerHashTable[hashIndex] = pp;
2849 rxi_InitPeerParams(pp);
2850 if (rx_stats_active)
2851 rx_atomic_inc(&rx_stats.nPeerStructs);
2858 origPeer->refCount--;
2859 MUTEX_EXIT(&rx_peerHashTable_lock);
2864 /* Find the connection at (host, port) started at epoch, and with the
2865 * given connection id. Creates the server connection if necessary.
2866 * The type specifies whether a client connection or a server
2867 * connection is desired. In both cases, (host, port) specify the
2868 * peer's (host, pair) pair. Client connections are not made
2869 * automatically by this routine. The parameter socket gives the
2870 * socket descriptor on which the packet was received. This is used,
2871 * in the case of server connections, to check that *new* connections
2872 * come via a valid (port, serviceId). Finally, the securityIndex
2873 * parameter must match the existing index for the connection. If a
2874 * server connection is created, it will be created using the supplied
2875 * index, if the index is valid for this service */
2876 struct rx_connection *
2877 rxi_FindConnection(osi_socket socket, afs_uint32 host,
2878 u_short port, u_short serviceId, afs_uint32 cid,
2879 afs_uint32 epoch, int type, u_int securityIndex)
2881 int hashindex, flag, i;
2882 struct rx_connection *conn;
2883 hashindex = CONN_HASH(host, port, cid, epoch, type);
2884 MUTEX_ENTER(&rx_connHashTable_lock);
2885 rxLastConn ? (conn = rxLastConn, flag = 0) : (conn =
2886 rx_connHashTable[hashindex],
2889 if ((conn->type == type) && ((cid & RX_CIDMASK) == conn->cid)
2890 && (epoch == conn->epoch)) {
2891 struct rx_peer *pp = conn->peer;
2892 if (securityIndex != conn->securityIndex) {
2893 /* this isn't supposed to happen, but someone could forge a packet
2894 * like this, and there seems to be some CM bug that makes this
2895 * happen from time to time -- in which case, the fileserver
2897 MUTEX_EXIT(&rx_connHashTable_lock);
2898 return (struct rx_connection *)0;
2900 if (pp->host == host && pp->port == port)
2902 if (type == RX_CLIENT_CONNECTION && pp->port == port)
2904 /* So what happens when it's a callback connection? */
2905 if ( /*type == RX_CLIENT_CONNECTION && */
2906 (conn->epoch & 0x80000000))
2910 /* the connection rxLastConn that was used the last time is not the
2911 ** one we are looking for now. Hence, start searching in the hash */
2913 conn = rx_connHashTable[hashindex];
2918 struct rx_service *service;
2919 if (type == RX_CLIENT_CONNECTION) {
2920 MUTEX_EXIT(&rx_connHashTable_lock);
2921 return (struct rx_connection *)0;
2923 service = rxi_FindService(socket, serviceId);
2924 if (!service || (securityIndex >= service->nSecurityObjects)
2925 || (service->securityObjects[securityIndex] == 0)) {
2926 MUTEX_EXIT(&rx_connHashTable_lock);
2927 return (struct rx_connection *)0;
2929 conn = rxi_AllocConnection(); /* This bzero's the connection */
2930 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
2931 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
2932 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
2933 conn->next = rx_connHashTable[hashindex];
2934 rx_connHashTable[hashindex] = conn;
2935 conn->peer = rxi_FindPeer(host, port, 0, 1);
2936 conn->type = RX_SERVER_CONNECTION;
2937 conn->lastSendTime = clock_Sec(); /* don't GC immediately */
2938 conn->epoch = epoch;
2939 conn->cid = cid & RX_CIDMASK;
2940 /* conn->serial = conn->lastSerial = 0; */
2941 /* conn->timeout = 0; */
2942 conn->ackRate = RX_FAST_ACK_RATE;
2943 conn->service = service;
2944 conn->serviceId = serviceId;
2945 conn->securityIndex = securityIndex;
2946 conn->securityObject = service->securityObjects[securityIndex];
2947 conn->nSpecific = 0;
2948 conn->specific = NULL;
2949 rx_SetConnDeadTime(conn, service->connDeadTime);
2950 rx_SetConnIdleDeadTime(conn, service->idleDeadTime);
2951 rx_SetServerConnIdleDeadErr(conn, service->idleDeadErr);
2952 for (i = 0; i < RX_MAXCALLS; i++) {
2953 conn->twind[i] = rx_initSendWindow;
2954 conn->rwind[i] = rx_initReceiveWindow;
2956 /* Notify security object of the new connection */
2957 RXS_NewConnection(conn->securityObject, conn);
2958 /* XXXX Connection timeout? */
2959 if (service->newConnProc)
2960 (*service->newConnProc) (conn);
2961 if (rx_stats_active)
2962 rx_atomic_inc(&rx_stats.nServerConns);
2965 MUTEX_ENTER(&rx_refcnt_mutex);
2967 MUTEX_EXIT(&rx_refcnt_mutex);
2969 rxLastConn = conn; /* store this connection as the last conn used */
2970 MUTEX_EXIT(&rx_connHashTable_lock);
2975 * Timeout a call on a busy call channel if appropriate.
2977 * @param[in] call The busy call.
2979 * @pre 'call' is marked as busy (namely,
2980 * call->conn->lastBusy[call->channel] != 0)
2982 * @pre call->lock is held
2983 * @pre rxi_busyChannelError is nonzero
2985 * @note call->lock is dropped and reacquired
2988 rxi_CheckBusy(struct rx_call *call)
2990 struct rx_connection *conn = call->conn;
2991 int channel = call->channel;
2992 int freechannel = 0;
2994 afs_uint32 callNumber = *call->callNumber;
2996 MUTEX_EXIT(&call->lock);
2998 MUTEX_ENTER(&conn->conn_call_lock);
3000 /* Are there any other call slots on this conn that we should try? Look for
3001 * slots that are empty and are either non-busy, or were marked as busy
3002 * longer than conn->secondsUntilDead seconds before this call started. */
3004 for (i = 0; i < RX_MAXCALLS && !freechannel; i++) {
3006 /* only look at channels that aren't us */
3010 if (conn->lastBusy[i]) {
3011 /* if this channel looked busy too recently, don't look at it */
3012 if (conn->lastBusy[i] >= call->startTime.sec) {
3015 if (call->startTime.sec - conn->lastBusy[i] < conn->secondsUntilDead) {
3020 if (conn->call[i]) {
3021 struct rx_call *tcall = conn->call[i];
3022 MUTEX_ENTER(&tcall->lock);
3023 if (tcall->state == RX_STATE_DALLY) {
3026 MUTEX_EXIT(&tcall->lock);
3032 MUTEX_EXIT(&conn->conn_call_lock);
3034 MUTEX_ENTER(&call->lock);
3036 /* Since the call->lock and conn->conn_call_lock have been released it is
3037 * possible that (1) the call may no longer be busy and/or (2) the call may
3038 * have been reused by another waiting thread. Therefore, we must confirm
3039 * that the call state has not changed when deciding whether or not to
3040 * force this application thread to retry by forcing a Timeout error. */
3042 if (freechannel && *call->callNumber == callNumber &&
3043 (call->flags & RX_CALL_PEER_BUSY)) {
3044 /* Since 'freechannel' is set, there exists another channel in this
3045 * rx_conn that the application thread might be able to use. We know
3046 * that we have the correct call since callNumber is unchanged, and we
3047 * know that the call is still busy. So, set the call error state to
3048 * rxi_busyChannelError so the application can retry the request,
3049 * presumably on a less-busy call channel. */
3051 rxi_CallError(call, rxi_busyChannelError);
3055 /* There are two packet tracing routines available for testing and monitoring
3056 * Rx. One is called just after every packet is received and the other is
3057 * called just before every packet is sent. Received packets, have had their
3058 * headers decoded, and packets to be sent have not yet had their headers
3059 * encoded. Both take two parameters: a pointer to the packet and a sockaddr
3060 * containing the network address. Both can be modified. The return value, if
3061 * non-zero, indicates that the packet should be dropped. */
3063 int (*rx_justReceived) (struct rx_packet *, struct sockaddr_in *) = 0;
3064 int (*rx_almostSent) (struct rx_packet *, struct sockaddr_in *) = 0;
3066 /* A packet has been received off the interface. Np is the packet, socket is
3067 * the socket number it was received from (useful in determining which service
3068 * this packet corresponds to), and (host, port) reflect the host,port of the
3069 * sender. This call returns the packet to the caller if it is finished with
3070 * it, rather than de-allocating it, just as a small performance hack */
3073 rxi_ReceivePacket(struct rx_packet *np, osi_socket socket,
3074 afs_uint32 host, u_short port, int *tnop,
3075 struct rx_call **newcallp)
3077 struct rx_call *call;
3078 struct rx_connection *conn;
3080 afs_uint32 currentCallNumber;
3086 struct rx_packet *tnp;
3089 /* We don't print out the packet until now because (1) the time may not be
3090 * accurate enough until now in the lwp implementation (rx_Listener only gets
3091 * the time after the packet is read) and (2) from a protocol point of view,
3092 * this is the first time the packet has been seen */
3093 packetType = (np->header.type > 0 && np->header.type < RX_N_PACKET_TYPES)
3094 ? rx_packetTypes[np->header.type - 1] : "*UNKNOWN*";
3095 dpf(("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"AFS_PTR_FMT"\n",
3096 np->header.serial, packetType, ntohl(host), ntohs(port), np->header.serviceId,
3097 np->header.epoch, np->header.cid, np->header.callNumber,
3098 np->header.seq, np->header.flags, np));
3101 if (np->header.type == RX_PACKET_TYPE_VERSION) {
3102 return rxi_ReceiveVersionPacket(np, socket, host, port, 1);
3105 if (np->header.type == RX_PACKET_TYPE_DEBUG) {
3106 return rxi_ReceiveDebugPacket(np, socket, host, port, 1);
3109 /* If an input tracer function is defined, call it with the packet and
3110 * network address. Note this function may modify its arguments. */
3111 if (rx_justReceived) {
3112 struct sockaddr_in addr;
3114 addr.sin_family = AF_INET;
3115 addr.sin_port = port;
3116 addr.sin_addr.s_addr = host;
3117 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
3118 addr.sin_len = sizeof(addr);
3119 #endif /* AFS_OSF_ENV */
3120 drop = (*rx_justReceived) (np, &addr);
3121 /* drop packet if return value is non-zero */
3124 port = addr.sin_port; /* in case fcn changed addr */
3125 host = addr.sin_addr.s_addr;
3129 /* If packet was not sent by the client, then *we* must be the client */
3130 type = ((np->header.flags & RX_CLIENT_INITIATED) != RX_CLIENT_INITIATED)
3131 ? RX_CLIENT_CONNECTION : RX_SERVER_CONNECTION;
3133 /* Find the connection (or fabricate one, if we're the server & if
3134 * necessary) associated with this packet */
3136 rxi_FindConnection(socket, host, port, np->header.serviceId,
3137 np->header.cid, np->header.epoch, type,
3138 np->header.securityIndex);
3141 /* If no connection found or fabricated, just ignore the packet.
3142 * (An argument could be made for sending an abort packet for
3147 /* If the connection is in an error state, send an abort packet and ignore
3148 * the incoming packet */
3150 /* Don't respond to an abort packet--we don't want loops! */
3151 MUTEX_ENTER(&conn->conn_data_lock);
3152 if (np->header.type != RX_PACKET_TYPE_ABORT)
3153 np = rxi_SendConnectionAbort(conn, np, 1, 0);
3154 MUTEX_ENTER(&rx_refcnt_mutex);
3156 MUTEX_EXIT(&rx_refcnt_mutex);
3157 MUTEX_EXIT(&conn->conn_data_lock);
3161 /* Check for connection-only requests (i.e. not call specific). */
3162 if (np->header.callNumber == 0) {
3163 switch (np->header.type) {
3164 case RX_PACKET_TYPE_ABORT: {
3165 /* What if the supplied error is zero? */
3166 afs_int32 errcode = ntohl(rx_GetInt32(np, 0));
3167 dpf(("rxi_ReceivePacket ABORT rx_GetInt32 = %d\n", errcode));
3168 rxi_ConnectionError(conn, errcode);
3169 MUTEX_ENTER(&rx_refcnt_mutex);
3171 MUTEX_EXIT(&rx_refcnt_mutex);
3174 case RX_PACKET_TYPE_CHALLENGE:
3175 tnp = rxi_ReceiveChallengePacket(conn, np, 1);
3176 MUTEX_ENTER(&rx_refcnt_mutex);
3178 MUTEX_EXIT(&rx_refcnt_mutex);
3180 case RX_PACKET_TYPE_RESPONSE:
3181 tnp = rxi_ReceiveResponsePacket(conn, np, 1);
3182 MUTEX_ENTER(&rx_refcnt_mutex);
3184 MUTEX_EXIT(&rx_refcnt_mutex);
3186 case RX_PACKET_TYPE_PARAMS:
3187 case RX_PACKET_TYPE_PARAMS + 1:
3188 case RX_PACKET_TYPE_PARAMS + 2:
3189 /* ignore these packet types for now */
3190 MUTEX_ENTER(&rx_refcnt_mutex);
3192 MUTEX_EXIT(&rx_refcnt_mutex);
3197 /* Should not reach here, unless the peer is broken: send an
3199 rxi_ConnectionError(conn, RX_PROTOCOL_ERROR);
3200 MUTEX_ENTER(&conn->conn_data_lock);
3201 tnp = rxi_SendConnectionAbort(conn, np, 1, 0);
3202 MUTEX_ENTER(&rx_refcnt_mutex);
3204 MUTEX_EXIT(&rx_refcnt_mutex);
3205 MUTEX_EXIT(&conn->conn_data_lock);
3210 channel = np->header.cid & RX_CHANNELMASK;
3211 call = conn->call[channel];
3212 #ifdef RX_ENABLE_LOCKS
3214 MUTEX_ENTER(&call->lock);
3215 /* Test to see if call struct is still attached to conn. */
3216 if (call != conn->call[channel]) {
3218 MUTEX_EXIT(&call->lock);
3219 if (type == RX_SERVER_CONNECTION) {
3220 call = conn->call[channel];
3221 /* If we started with no call attached and there is one now,
3222 * another thread is also running this routine and has gotten
3223 * the connection channel. We should drop this packet in the tests
3224 * below. If there was a call on this connection and it's now
3225 * gone, then we'll be making a new call below.
3226 * If there was previously a call and it's now different then
3227 * the old call was freed and another thread running this routine
3228 * has created a call on this channel. One of these two threads
3229 * has a packet for the old call and the code below handles those
3233 MUTEX_ENTER(&call->lock);
3235 /* This packet can't be for this call. If the new call address is
3236 * 0 then no call is running on this channel. If there is a call
3237 * then, since this is a client connection we're getting data for
3238 * it must be for the previous call.
3240 if (rx_stats_active)
3241 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3242 MUTEX_ENTER(&rx_refcnt_mutex);
3244 MUTEX_EXIT(&rx_refcnt_mutex);
3249 currentCallNumber = conn->callNumber[channel];
3251 if (type == RX_SERVER_CONNECTION) { /* We're the server */
3252 if (np->header.callNumber < currentCallNumber) {
3253 if (rx_stats_active)
3254 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3255 #ifdef RX_ENABLE_LOCKS
3257 MUTEX_EXIT(&call->lock);
3259 MUTEX_ENTER(&rx_refcnt_mutex);
3261 MUTEX_EXIT(&rx_refcnt_mutex);
3265 MUTEX_ENTER(&conn->conn_call_lock);
3266 call = rxi_NewCall(conn, channel);
3267 MUTEX_EXIT(&conn->conn_call_lock);
3268 *call->callNumber = np->header.callNumber;
3270 if (np->header.callNumber == 0)
3271 dpf(("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"AFS_PTR_FMT" len %d\n",
3272 np->header.serial, rx_packetTypes[np->header.type - 1], ntohl(conn->peer->host), ntohs(conn->peer->port),
3273 np->header.serial, np->header.epoch, np->header.cid, np->header.callNumber, np->header.seq,
3274 np->header.flags, np, np->length));
3276 call->state = RX_STATE_PRECALL;
3277 clock_GetTime(&call->queueTime);
3278 hzero(call->bytesSent);
3279 hzero(call->bytesRcvd);
3281 * If the number of queued calls exceeds the overload
3282 * threshold then abort this call.
3284 if ((rx_BusyThreshold > 0) &&
3285 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3286 struct rx_packet *tp;
3288 rxi_CallError(call, rx_BusyError);
3289 tp = rxi_SendCallAbort(call, np, 1, 0);
3290 MUTEX_EXIT(&call->lock);
3291 MUTEX_ENTER(&rx_refcnt_mutex);
3293 MUTEX_EXIT(&rx_refcnt_mutex);
3294 if (rx_stats_active)
3295 rx_atomic_inc(&rx_stats.nBusies);
3298 rxi_KeepAliveOn(call);
3299 } else if (np->header.callNumber != currentCallNumber) {
3300 /* Wait until the transmit queue is idle before deciding
3301 * whether to reset the current call. Chances are that the
3302 * call will be in ether DALLY or HOLD state once the TQ_BUSY
3305 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
3306 if (call->state == RX_STATE_ACTIVE) {
3307 rxi_WaitforTQBusy(call);
3309 * If we entered error state while waiting,
3310 * must call rxi_CallError to permit rxi_ResetCall
3311 * to processed when the tqWaiter count hits zero.
3314 rxi_CallError(call, call->error);
3315 MUTEX_EXIT(&call->lock);
3316 MUTEX_ENTER(&rx_refcnt_mutex);
3318 MUTEX_EXIT(&rx_refcnt_mutex);
3322 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3323 /* If the new call cannot be taken right now send a busy and set
3324 * the error condition in this call, so that it terminates as
3325 * quickly as possible */
3326 if (call->state == RX_STATE_ACTIVE) {
3327 struct rx_packet *tp;
3329 rxi_CallError(call, RX_CALL_DEAD);
3330 tp = rxi_SendSpecial(call, conn, np, RX_PACKET_TYPE_BUSY,
3332 MUTEX_EXIT(&call->lock);
3333 MUTEX_ENTER(&rx_refcnt_mutex);
3335 MUTEX_EXIT(&rx_refcnt_mutex);
3338 rxi_ResetCall(call, 0);
3339 *call->callNumber = np->header.callNumber;
3341 if (np->header.callNumber == 0)
3342 dpf(("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"AFS_PTR_FMT" len %d\n",
3343 np->header.serial, rx_packetTypes[np->header.type - 1], ntohl(conn->peer->host), ntohs(conn->peer->port),
3344 np->header.serial, np->header.epoch, np->header.cid, np->header.callNumber, np->header.seq,
3345 np->header.flags, np, np->length));
3347 call->state = RX_STATE_PRECALL;
3348 clock_GetTime(&call->queueTime);
3349 hzero(call->bytesSent);
3350 hzero(call->bytesRcvd);
3352 * If the number of queued calls exceeds the overload
3353 * threshold then abort this call.
3355 if ((rx_BusyThreshold > 0) &&
3356 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3357 struct rx_packet *tp;
3359 rxi_CallError(call, rx_BusyError);
3360 tp = rxi_SendCallAbort(call, np, 1, 0);
3361 MUTEX_EXIT(&call->lock);
3362 MUTEX_ENTER(&rx_refcnt_mutex);
3364 MUTEX_EXIT(&rx_refcnt_mutex);
3365 if (rx_stats_active)
3366 rx_atomic_inc(&rx_stats.nBusies);
3369 rxi_KeepAliveOn(call);
3371 /* Continuing call; do nothing here. */
3373 } else { /* we're the client */
3374 /* Ignore all incoming acknowledgements for calls in DALLY state */
3375 if (call && (call->state == RX_STATE_DALLY)
3376 && (np->header.type == RX_PACKET_TYPE_ACK)) {
3377 if (rx_stats_active)
3378 rx_atomic_inc(&rx_stats.ignorePacketDally);
3379 #ifdef RX_ENABLE_LOCKS
3381 MUTEX_EXIT(&call->lock);
3384 MUTEX_ENTER(&rx_refcnt_mutex);
3386 MUTEX_EXIT(&rx_refcnt_mutex);
3390 /* Ignore anything that's not relevant to the current call. If there
3391 * isn't a current call, then no packet is relevant. */
3392 if (!call || (np->header.callNumber != currentCallNumber)) {
3393 if (rx_stats_active)
3394 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3395 #ifdef RX_ENABLE_LOCKS
3397 MUTEX_EXIT(&call->lock);
3400 MUTEX_ENTER(&rx_refcnt_mutex);
3402 MUTEX_EXIT(&rx_refcnt_mutex);
3405 /* If the service security object index stamped in the packet does not
3406 * match the connection's security index, ignore the packet */
3407 if (np->header.securityIndex != conn->securityIndex) {
3408 #ifdef RX_ENABLE_LOCKS
3409 MUTEX_EXIT(&call->lock);
3411 MUTEX_ENTER(&rx_refcnt_mutex);
3413 MUTEX_EXIT(&rx_refcnt_mutex);
3417 /* If we're receiving the response, then all transmit packets are
3418 * implicitly acknowledged. Get rid of them. */
3419 if (np->header.type == RX_PACKET_TYPE_DATA) {
3420 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
3421 /* XXX Hack. Because we must release the global rx lock when
3422 * sending packets (osi_NetSend) we drop all acks while we're
3423 * traversing the tq in rxi_Start sending packets out because
3424 * packets may move to the freePacketQueue as result of being here!
3425 * So we drop these packets until we're safely out of the
3426 * traversing. Really ugly!
3427 * For fine grain RX locking, we set the acked field in the
3428 * packets and let rxi_Start remove them from the transmit queue.
3430 if (call->flags & RX_CALL_TQ_BUSY) {
3431 #ifdef RX_ENABLE_LOCKS
3432 rxi_SetAcksInTransmitQueue(call);
3434 MUTEX_ENTER(&rx_refcnt_mutex);
3436 MUTEX_EXIT(&rx_refcnt_mutex);
3437 return np; /* xmitting; drop packet */
3440 rxi_ClearTransmitQueue(call, 0);
3442 #else /* AFS_GLOBAL_RXLOCK_KERNEL */
3443 rxi_ClearTransmitQueue(call, 0);
3444 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3446 if (np->header.type == RX_PACKET_TYPE_ACK) {
3447 /* now check to see if this is an ack packet acknowledging that the
3448 * server actually *lost* some hard-acked data. If this happens we
3449 * ignore this packet, as it may indicate that the server restarted in
3450 * the middle of a call. It is also possible that this is an old ack
3451 * packet. We don't abort the connection in this case, because this
3452 * *might* just be an old ack packet. The right way to detect a server
3453 * restart in the midst of a call is to notice that the server epoch
3455 /* XXX I'm not sure this is exactly right, since tfirst **IS**
3456 * XXX unacknowledged. I think that this is off-by-one, but
3457 * XXX I don't dare change it just yet, since it will
3458 * XXX interact badly with the server-restart detection
3459 * XXX code in receiveackpacket. */
3460 if (ntohl(rx_GetInt32(np, FIRSTACKOFFSET)) < call->tfirst) {
3461 if (rx_stats_active)
3462 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3463 MUTEX_EXIT(&call->lock);
3464 MUTEX_ENTER(&rx_refcnt_mutex);
3466 MUTEX_EXIT(&rx_refcnt_mutex);
3470 } /* else not a data packet */
3473 osirx_AssertMine(&call->lock, "rxi_ReceivePacket middle");
3474 /* Set remote user defined status from packet */
3475 call->remoteStatus = np->header.userStatus;
3477 /* Note the gap between the expected next packet and the actual
3478 * packet that arrived, when the new packet has a smaller serial number
3479 * than expected. Rioses frequently reorder packets all by themselves,
3480 * so this will be quite important with very large window sizes.
3481 * Skew is checked against 0 here to avoid any dependence on the type of
3482 * inPacketSkew (which may be unsigned). In C, -1 > (unsigned) 0 is always
3484 * The inPacketSkew should be a smoothed running value, not just a maximum. MTUXXX
3485 * see CalculateRoundTripTime for an example of how to keep smoothed values.
3486 * I think using a beta of 1/8 is probably appropriate. 93.04.21
3488 MUTEX_ENTER(&conn->conn_data_lock);
3489 skew = conn->lastSerial - np->header.serial;
3490 conn->lastSerial = np->header.serial;
3491 MUTEX_EXIT(&conn->conn_data_lock);
3493 struct rx_peer *peer;
3495 if (skew > peer->inPacketSkew) {
3496 dpf(("*** In skew changed from %d to %d\n",
3497 peer->inPacketSkew, skew));
3498 peer->inPacketSkew = skew;
3502 /* Now do packet type-specific processing */
3503 switch (np->header.type) {
3504 case RX_PACKET_TYPE_DATA:
3505 np = rxi_ReceiveDataPacket(call, np, 1, socket, host, port, tnop,
3508 case RX_PACKET_TYPE_ACK:
3509 /* Respond immediately to ack packets requesting acknowledgement
3511 if (np->header.flags & RX_REQUEST_ACK) {
3513 (void)rxi_SendCallAbort(call, 0, 1, 0);
3515 (void)rxi_SendAck(call, 0, np->header.serial,
3516 RX_ACK_PING_RESPONSE, 1);
3518 np = rxi_ReceiveAckPacket(call, np, 1);
3520 case RX_PACKET_TYPE_ABORT: {
3521 /* An abort packet: reset the call, passing the error up to the user. */
3522 /* What if error is zero? */
3523 /* What if the error is -1? the application will treat it as a timeout. */
3524 afs_int32 errdata = ntohl(*(afs_int32 *) rx_DataOf(np));
3525 dpf(("rxi_ReceivePacket ABORT rx_DataOf = %d\n", errdata));
3526 rxi_CallError(call, errdata);
3527 MUTEX_EXIT(&call->lock);
3528 MUTEX_ENTER(&rx_refcnt_mutex);
3530 MUTEX_EXIT(&rx_refcnt_mutex);
3531 return np; /* xmitting; drop packet */
3533 case RX_PACKET_TYPE_BUSY: {
3534 struct clock busyTime;
3536 clock_GetTime(&busyTime);
3538 MUTEX_EXIT(&call->lock);
3540 MUTEX_ENTER(&conn->conn_call_lock);
3541 MUTEX_ENTER(&call->lock);
3542 conn->lastBusy[call->channel] = busyTime.sec;
3543 call->flags |= RX_CALL_PEER_BUSY;
3544 MUTEX_EXIT(&call->lock);
3545 MUTEX_EXIT(&conn->conn_call_lock);
3547 MUTEX_ENTER(&rx_refcnt_mutex);
3549 MUTEX_EXIT(&rx_refcnt_mutex);
3553 case RX_PACKET_TYPE_ACKALL:
3554 /* All packets acknowledged, so we can drop all packets previously
3555 * readied for sending */
3556 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
3557 /* XXX Hack. We because we can't release the global rx lock when
3558 * sending packets (osi_NetSend) we drop all ack pkts while we're
3559 * traversing the tq in rxi_Start sending packets out because
3560 * packets may move to the freePacketQueue as result of being
3561 * here! So we drop these packets until we're safely out of the
3562 * traversing. Really ugly!
3563 * For fine grain RX locking, we set the acked field in the packets
3564 * and let rxi_Start remove the packets from the transmit queue.
3566 if (call->flags & RX_CALL_TQ_BUSY) {
3567 #ifdef RX_ENABLE_LOCKS
3568 rxi_SetAcksInTransmitQueue(call);
3570 #else /* RX_ENABLE_LOCKS */
3571 MUTEX_EXIT(&call->lock);
3572 MUTEX_ENTER(&rx_refcnt_mutex);
3574 MUTEX_EXIT(&rx_refcnt_mutex);
3575 return np; /* xmitting; drop packet */
3576 #endif /* RX_ENABLE_LOCKS */
3578 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3579 rxi_ClearTransmitQueue(call, 0);
3582 /* Should not reach here, unless the peer is broken: send an abort
3584 rxi_CallError(call, RX_PROTOCOL_ERROR);
3585 np = rxi_SendCallAbort(call, np, 1, 0);
3588 /* Note when this last legitimate packet was received, for keep-alive
3589 * processing. Note, we delay getting the time until now in the hope that
3590 * the packet will be delivered to the user before any get time is required
3591 * (if not, then the time won't actually be re-evaluated here). */
3592 call->lastReceiveTime = clock_Sec();
3593 /* we've received a legit packet, so the channel is not busy */
3594 call->flags &= ~RX_CALL_PEER_BUSY;
3595 MUTEX_EXIT(&call->lock);
3596 MUTEX_ENTER(&rx_refcnt_mutex);
3598 MUTEX_EXIT(&rx_refcnt_mutex);
3602 /* return true if this is an "interesting" connection from the point of view
3603 of someone trying to debug the system */
3605 rxi_IsConnInteresting(struct rx_connection *aconn)
3608 struct rx_call *tcall;
3610 if (aconn->flags & (RX_CONN_MAKECALL_WAITING | RX_CONN_DESTROY_ME))
3613 for (i = 0; i < RX_MAXCALLS; i++) {
3614 tcall = aconn->call[i];
3616 if ((tcall->state == RX_STATE_PRECALL)
3617 || (tcall->state == RX_STATE_ACTIVE))
3619 if ((tcall->mode == RX_MODE_SENDING)
3620 || (tcall->mode == RX_MODE_RECEIVING))
3628 /* if this is one of the last few packets AND it wouldn't be used by the
3629 receiving call to immediately satisfy a read request, then drop it on
3630 the floor, since accepting it might prevent a lock-holding thread from
3631 making progress in its reading. If a call has been cleared while in
3632 the precall state then ignore all subsequent packets until the call
3633 is assigned to a thread. */
3636 TooLow(struct rx_packet *ap, struct rx_call *acall)
3640 MUTEX_ENTER(&rx_quota_mutex);
3641 if (((ap->header.seq != 1) && (acall->flags & RX_CALL_CLEARED)
3642 && (acall->state == RX_STATE_PRECALL))
3643 || ((rx_nFreePackets < rxi_dataQuota + 2)
3644 && !((ap->header.seq < acall->rnext + rx_initSendWindow)
3645 && (acall->flags & RX_CALL_READER_WAIT)))) {
3648 MUTEX_EXIT(&rx_quota_mutex);
3654 rxi_CheckReachEvent(struct rxevent *event, void *arg1, void *arg2)
3656 struct rx_connection *conn = arg1;
3657 struct rx_call *acall = arg2;
3658 struct rx_call *call = acall;
3659 struct clock when, now;
3662 MUTEX_ENTER(&conn->conn_data_lock);
3663 conn->checkReachEvent = NULL;
3664 waiting = conn->flags & RX_CONN_ATTACHWAIT;
3666 MUTEX_ENTER(&rx_refcnt_mutex);
3668 MUTEX_EXIT(&rx_refcnt_mutex);
3670 MUTEX_EXIT(&conn->conn_data_lock);
3674 MUTEX_ENTER(&conn->conn_call_lock);
3675 MUTEX_ENTER(&conn->conn_data_lock);
3676 for (i = 0; i < RX_MAXCALLS; i++) {
3677 struct rx_call *tc = conn->call[i];
3678 if (tc && tc->state == RX_STATE_PRECALL) {
3684 /* Indicate that rxi_CheckReachEvent is no longer running by
3685 * clearing the flag. Must be atomic under conn_data_lock to
3686 * avoid a new call slipping by: rxi_CheckConnReach holds
3687 * conn_data_lock while checking RX_CONN_ATTACHWAIT.
3689 conn->flags &= ~RX_CONN_ATTACHWAIT;
3690 MUTEX_EXIT(&conn->conn_data_lock);
3691 MUTEX_EXIT(&conn->conn_call_lock);
3696 MUTEX_ENTER(&call->lock);
3697 rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
3699 MUTEX_EXIT(&call->lock);
3701 clock_GetTime(&now);
3703 when.sec += RX_CHECKREACH_TIMEOUT;
3704 MUTEX_ENTER(&conn->conn_data_lock);
3705 if (!conn->checkReachEvent) {
3706 MUTEX_ENTER(&rx_refcnt_mutex);
3708 MUTEX_EXIT(&rx_refcnt_mutex);
3709 conn->checkReachEvent =
3710 rxevent_PostNow(&when, &now, rxi_CheckReachEvent, conn,
3713 MUTEX_EXIT(&conn->conn_data_lock);
3719 rxi_CheckConnReach(struct rx_connection *conn, struct rx_call *call)
3721 struct rx_service *service = conn->service;
3722 struct rx_peer *peer = conn->peer;
3723 afs_uint32 now, lastReach;
3725 if (service->checkReach == 0)
3729 MUTEX_ENTER(&peer->peer_lock);
3730 lastReach = peer->lastReachTime;
3731 MUTEX_EXIT(&peer->peer_lock);
3732 if (now - lastReach < RX_CHECKREACH_TTL)
3735 MUTEX_ENTER(&conn->conn_data_lock);
3736 if (conn->flags & RX_CONN_ATTACHWAIT) {
3737 MUTEX_EXIT(&conn->conn_data_lock);
3740 conn->flags |= RX_CONN_ATTACHWAIT;
3741 MUTEX_EXIT(&conn->conn_data_lock);
3742 if (!conn->checkReachEvent)
3743 rxi_CheckReachEvent(NULL, conn, call);
3748 /* try to attach call, if authentication is complete */
3750 TryAttach(struct rx_call *acall, osi_socket socket,
3751 int *tnop, struct rx_call **newcallp,
3754 struct rx_connection *conn = acall->conn;
3756 if (conn->type == RX_SERVER_CONNECTION
3757 && acall->state == RX_STATE_PRECALL) {
3758 /* Don't attach until we have any req'd. authentication. */
3759 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0) {
3760 if (reachOverride || rxi_CheckConnReach(conn, acall) == 0)
3761 rxi_AttachServerProc(acall, socket, tnop, newcallp);
3762 /* Note: this does not necessarily succeed; there
3763 * may not any proc available
3766 rxi_ChallengeOn(acall->conn);
3771 /* A data packet has been received off the interface. This packet is
3772 * appropriate to the call (the call is in the right state, etc.). This
3773 * routine can return a packet to the caller, for re-use */
3776 rxi_ReceiveDataPacket(struct rx_call *call,
3777 struct rx_packet *np, int istack,
3778 osi_socket socket, afs_uint32 host, u_short port,
3779 int *tnop, struct rx_call **newcallp)
3781 int ackNeeded = 0; /* 0 means no, otherwise ack_reason */
3786 afs_uint32 serial=0, flags=0;
3788 struct rx_packet *tnp;
3789 struct clock when, now;
3790 if (rx_stats_active)
3791 rx_atomic_inc(&rx_stats.dataPacketsRead);
3794 /* If there are no packet buffers, drop this new packet, unless we can find
3795 * packet buffers from inactive calls */
3797 && (rxi_OverQuota(RX_PACKET_CLASS_RECEIVE) || TooLow(np, call))) {
3798 MUTEX_ENTER(&rx_freePktQ_lock);
3799 rxi_NeedMorePackets = TRUE;
3800 MUTEX_EXIT(&rx_freePktQ_lock);
3801 if (rx_stats_active)
3802 rx_atomic_inc(&rx_stats.noPacketBuffersOnRead);
3803 call->rprev = np->header.serial;
3804 rxi_calltrace(RX_TRACE_DROP, call);
3805 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - quota problems\n", np));
3807 rxi_ClearReceiveQueue(call);
3808 clock_GetTime(&now);
3810 clock_Add(&when, &rx_softAckDelay);
3811 if (!call->delayedAckEvent
3812 || clock_Gt(&call->delayedAckEvent->eventTime, &when)) {
3813 rxevent_Cancel(call->delayedAckEvent, call,
3814 RX_CALL_REFCOUNT_DELAY);
3815 MUTEX_ENTER(&rx_refcnt_mutex);
3816 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
3817 MUTEX_EXIT(&rx_refcnt_mutex);
3819 call->delayedAckEvent =
3820 rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
3822 /* we've damaged this call already, might as well do it in. */
3828 * New in AFS 3.5, if the RX_JUMBO_PACKET flag is set then this
3829 * packet is one of several packets transmitted as a single
3830 * datagram. Do not send any soft or hard acks until all packets
3831 * in a jumbogram have been processed. Send negative acks right away.
3833 for (isFirst = 1, tnp = NULL; isFirst || tnp; isFirst = 0) {
3834 /* tnp is non-null when there are more packets in the
3835 * current jumbo gram */
3842 seq = np->header.seq;
3843 serial = np->header.serial;
3844 flags = np->header.flags;
3846 /* If the call is in an error state, send an abort message */
3848 return rxi_SendCallAbort(call, np, istack, 0);
3850 /* The RX_JUMBO_PACKET is set in all but the last packet in each
3851 * AFS 3.5 jumbogram. */
3852 if (flags & RX_JUMBO_PACKET) {
3853 tnp = rxi_SplitJumboPacket(np, host, port, isFirst);
3858 if (np->header.spare != 0) {
3859 MUTEX_ENTER(&call->conn->conn_data_lock);
3860 call->conn->flags |= RX_CONN_USING_PACKET_CKSUM;
3861 MUTEX_EXIT(&call->conn->conn_data_lock);
3864 /* The usual case is that this is the expected next packet */
3865 if (seq == call->rnext) {
3867 /* Check to make sure it is not a duplicate of one already queued */
3868 if (queue_IsNotEmpty(&call->rq)
3869 && queue_First(&call->rq, rx_packet)->header.seq == seq) {
3870 if (rx_stats_active)
3871 rx_atomic_inc(&rx_stats.dupPacketsRead);
3872 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - duplicate\n", np));
3873 rxevent_Cancel(call->delayedAckEvent, call,
3874 RX_CALL_REFCOUNT_DELAY);
3875 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3881 /* It's the next packet. Stick it on the receive queue
3882 * for this call. Set newPackets to make sure we wake
3883 * the reader once all packets have been processed */
3884 #ifdef RX_TRACK_PACKETS
3885 np->flags |= RX_PKTFLAG_RQ;
3887 queue_Prepend(&call->rq, np);
3888 #ifdef RXDEBUG_PACKET
3890 #endif /* RXDEBUG_PACKET */
3892 np = NULL; /* We can't use this anymore */
3895 /* If an ack is requested then set a flag to make sure we
3896 * send an acknowledgement for this packet */
3897 if (flags & RX_REQUEST_ACK) {
3898 ackNeeded = RX_ACK_REQUESTED;
3901 /* Keep track of whether we have received the last packet */
3902 if (flags & RX_LAST_PACKET) {
3903 call->flags |= RX_CALL_HAVE_LAST;
3907 /* Check whether we have all of the packets for this call */
3908 if (call->flags & RX_CALL_HAVE_LAST) {
3909 afs_uint32 tseq; /* temporary sequence number */
3910 struct rx_packet *tp; /* Temporary packet pointer */
3911 struct rx_packet *nxp; /* Next pointer, for queue_Scan */
3913 for (tseq = seq, queue_Scan(&call->rq, tp, nxp, rx_packet)) {
3914 if (tseq != tp->header.seq)
3916 if (tp->header.flags & RX_LAST_PACKET) {
3917 call->flags |= RX_CALL_RECEIVE_DONE;
3924 /* Provide asynchronous notification for those who want it
3925 * (e.g. multi rx) */
3926 if (call->arrivalProc) {
3927 (*call->arrivalProc) (call, call->arrivalProcHandle,
3928 call->arrivalProcArg);
3929 call->arrivalProc = (void (*)())0;
3932 /* Update last packet received */
3935 /* If there is no server process serving this call, grab
3936 * one, if available. We only need to do this once. If a
3937 * server thread is available, this thread becomes a server
3938 * thread and the server thread becomes a listener thread. */
3940 TryAttach(call, socket, tnop, newcallp, 0);
3943 /* This is not the expected next packet. */
3945 /* Determine whether this is a new or old packet, and if it's
3946 * a new one, whether it fits into the current receive window.
3947 * Also figure out whether the packet was delivered in sequence.
3948 * We use the prev variable to determine whether the new packet
3949 * is the successor of its immediate predecessor in the
3950 * receive queue, and the missing flag to determine whether
3951 * any of this packets predecessors are missing. */
3953 afs_uint32 prev; /* "Previous packet" sequence number */
3954 struct rx_packet *tp; /* Temporary packet pointer */
3955 struct rx_packet *nxp; /* Next pointer, for queue_Scan */
3956 int missing; /* Are any predecessors missing? */
3958 /* If the new packet's sequence number has been sent to the
3959 * application already, then this is a duplicate */
3960 if (seq < call->rnext) {
3961 if (rx_stats_active)
3962 rx_atomic_inc(&rx_stats.dupPacketsRead);
3963 rxevent_Cancel(call->delayedAckEvent, call,
3964 RX_CALL_REFCOUNT_DELAY);
3965 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3971 /* If the sequence number is greater than what can be
3972 * accomodated by the current window, then send a negative
3973 * acknowledge and drop the packet */
3974 if ((call->rnext + call->rwind) <= seq) {
3975 rxevent_Cancel(call->delayedAckEvent, call,
3976 RX_CALL_REFCOUNT_DELAY);
3977 np = rxi_SendAck(call, np, serial, RX_ACK_EXCEEDS_WINDOW,
3984 /* Look for the packet in the queue of old received packets */
3985 for (prev = call->rnext - 1, missing =
3986 0, queue_Scan(&call->rq, tp, nxp, rx_packet)) {
3987 /*Check for duplicate packet */
3988 if (seq == tp->header.seq) {
3989 if (rx_stats_active)
3990 rx_atomic_inc(&rx_stats.dupPacketsRead);
3991 rxevent_Cancel(call->delayedAckEvent, call,
3992 RX_CALL_REFCOUNT_DELAY);
3993 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE,
3999 /* If we find a higher sequence packet, break out and
4000 * insert the new packet here. */
4001 if (seq < tp->header.seq)
4003 /* Check for missing packet */
4004 if (tp->header.seq != prev + 1) {
4008 prev = tp->header.seq;
4011 /* Keep track of whether we have received the last packet. */
4012 if (flags & RX_LAST_PACKET) {
4013 call->flags |= RX_CALL_HAVE_LAST;
4016 /* It's within the window: add it to the the receive queue.
4017 * tp is left by the previous loop either pointing at the
4018 * packet before which to insert the new packet, or at the
4019 * queue head if the queue is empty or the packet should be
4021 #ifdef RX_TRACK_PACKETS
4022 np->flags |= RX_PKTFLAG_RQ;
4024 #ifdef RXDEBUG_PACKET
4026 #endif /* RXDEBUG_PACKET */
4027 queue_InsertBefore(tp, np);
4031 /* Check whether we have all of the packets for this call */
4032 if ((call->flags & RX_CALL_HAVE_LAST)
4033 && !(call->flags & RX_CALL_RECEIVE_DONE)) {
4034 afs_uint32 tseq; /* temporary sequence number */
4037 call->rnext, queue_Scan(&call->rq, tp, nxp, rx_packet)) {
4038 if (tseq != tp->header.seq)
4040 if (tp->header.flags & RX_LAST_PACKET) {
4041 call->flags |= RX_CALL_RECEIVE_DONE;
4048 /* We need to send an ack of the packet is out of sequence,
4049 * or if an ack was requested by the peer. */
4050 if (seq != prev + 1 || missing) {
4051 ackNeeded = RX_ACK_OUT_OF_SEQUENCE;
4052 } else if (flags & RX_REQUEST_ACK) {
4053 ackNeeded = RX_ACK_REQUESTED;
4056 /* Acknowledge the last packet for each call */
4057 if (flags & RX_LAST_PACKET) {
4068 * If the receiver is waiting for an iovec, fill the iovec
4069 * using the data from the receive queue */
4070 if (call->flags & RX_CALL_IOVEC_WAIT) {
4071 didHardAck = rxi_FillReadVec(call, serial);
4072 /* the call may have been aborted */
4081 /* Wakeup the reader if any */
4082 if ((call->flags & RX_CALL_READER_WAIT)
4083 && (!(call->flags & RX_CALL_IOVEC_WAIT) || !(call->iovNBytes)
4084 || (call->iovNext >= call->iovMax)
4085 || (call->flags & RX_CALL_RECEIVE_DONE))) {
4086 call->flags &= ~RX_CALL_READER_WAIT;
4087 #ifdef RX_ENABLE_LOCKS
4088 CV_BROADCAST(&call->cv_rq);
4090 osi_rxWakeup(&call->rq);
4096 * Send an ack when requested by the peer, or once every
4097 * rxi_SoftAckRate packets until the last packet has been
4098 * received. Always send a soft ack for the last packet in
4099 * the server's reply. */
4101 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4102 np = rxi_SendAck(call, np, serial, ackNeeded, istack);
4103 } else if (call->nSoftAcks > (u_short) rxi_SoftAckRate) {
4104 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4105 np = rxi_SendAck(call, np, serial, RX_ACK_IDLE, istack);
4106 } else if (call->nSoftAcks) {
4107 clock_GetTime(&now);
4109 if (haveLast && !(flags & RX_CLIENT_INITIATED)) {
4110 clock_Add(&when, &rx_lastAckDelay);
4112 clock_Add(&when, &rx_softAckDelay);
4114 if (!call->delayedAckEvent
4115 || clock_Gt(&call->delayedAckEvent->eventTime, &when)) {
4116 rxevent_Cancel(call->delayedAckEvent, call,
4117 RX_CALL_REFCOUNT_DELAY);
4118 MUTEX_ENTER(&rx_refcnt_mutex);
4119 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
4120 MUTEX_EXIT(&rx_refcnt_mutex);
4121 call->delayedAckEvent =
4122 rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
4124 } else if (call->flags & RX_CALL_RECEIVE_DONE) {
4125 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4132 static void rxi_ComputeRate();
4136 rxi_UpdatePeerReach(struct rx_connection *conn, struct rx_call *acall)
4138 struct rx_peer *peer = conn->peer;
4140 MUTEX_ENTER(&peer->peer_lock);
4141 peer->lastReachTime = clock_Sec();
4142 MUTEX_EXIT(&peer->peer_lock);
4144 MUTEX_ENTER(&conn->conn_data_lock);
4145 if (conn->flags & RX_CONN_ATTACHWAIT) {
4148 conn->flags &= ~RX_CONN_ATTACHWAIT;
4149 MUTEX_EXIT(&conn->conn_data_lock);
4151 for (i = 0; i < RX_MAXCALLS; i++) {
4152 struct rx_call *call = conn->call[i];
4155 MUTEX_ENTER(&call->lock);
4156 /* tnop can be null if newcallp is null */
4157 TryAttach(call, (osi_socket) - 1, NULL, NULL, 1);
4159 MUTEX_EXIT(&call->lock);
4163 MUTEX_EXIT(&conn->conn_data_lock);
4166 #if defined(RXDEBUG) && defined(AFS_NT40_ENV)
4168 rx_ack_reason(int reason)
4171 case RX_ACK_REQUESTED:
4173 case RX_ACK_DUPLICATE:
4175 case RX_ACK_OUT_OF_SEQUENCE:
4177 case RX_ACK_EXCEEDS_WINDOW:
4179 case RX_ACK_NOSPACE:
4183 case RX_ACK_PING_RESPONSE:
4196 /* The real smarts of the whole thing. */
4198 rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
4201 struct rx_ackPacket *ap;
4203 struct rx_packet *tp;
4204 struct rx_packet *nxp; /* Next packet pointer for queue_Scan */
4205 struct rx_connection *conn = call->conn;
4206 struct rx_peer *peer = conn->peer;
4207 struct clock now; /* Current time, for RTT calculations */
4211 /* because there are CM's that are bogus, sending weird values for this. */
4212 afs_uint32 skew = 0;
4217 int newAckCount = 0;
4218 int maxDgramPackets = 0; /* Set if peer supports AFS 3.5 jumbo datagrams */
4219 int pktsize = 0; /* Set if we need to update the peer mtu */
4220 int conn_data_locked = 0;
4222 if (rx_stats_active)
4223 rx_atomic_inc(&rx_stats.ackPacketsRead);
4224 ap = (struct rx_ackPacket *)rx_DataOf(np);
4225 nbytes = rx_Contiguous(np) - (int)((ap->acks) - (u_char *) ap);
4227 return np; /* truncated ack packet */
4229 /* depends on ack packet struct */
4230 nAcks = MIN((unsigned)nbytes, (unsigned)ap->nAcks);
4231 first = ntohl(ap->firstPacket);
4232 prev = ntohl(ap->previousPacket);
4233 serial = ntohl(ap->serial);
4234 /* temporarily disabled -- needs to degrade over time
4235 * skew = ntohs(ap->maxSkew); */
4237 /* Ignore ack packets received out of order */
4238 if (first < call->tfirst ||
4239 (first == call->tfirst && prev < call->tprev)) {
4245 if (np->header.flags & RX_SLOW_START_OK) {
4246 call->flags |= RX_CALL_SLOW_START_OK;
4249 if (ap->reason == RX_ACK_PING_RESPONSE)
4250 rxi_UpdatePeerReach(conn, call);
4252 if (conn->lastPacketSizeSeq) {
4253 MUTEX_ENTER(&conn->conn_data_lock);
4254 conn_data_locked = 1;
4255 if ((first > conn->lastPacketSizeSeq) && (conn->lastPacketSize)) {
4256 pktsize = conn->lastPacketSize;
4257 conn->lastPacketSize = conn->lastPacketSizeSeq = 0;
4260 if ((ap->reason == RX_ACK_PING_RESPONSE) && (conn->lastPingSizeSer)) {
4261 if (!conn_data_locked) {
4262 MUTEX_ENTER(&conn->conn_data_lock);
4263 conn_data_locked = 1;
4265 if ((conn->lastPingSizeSer == serial) && (conn->lastPingSize)) {
4266 /* process mtu ping ack */
4267 pktsize = conn->lastPingSize;
4268 conn->lastPingSizeSer = conn->lastPingSize = 0;
4272 if (conn_data_locked) {
4273 MUTEX_EXIT(&conn->conn_data_lock);
4274 conn_data_locked = 0;
4278 if (rxdebug_active) {
4282 len = _snprintf(msg, sizeof(msg),
4283 "tid[%d] RACK: reason %s serial %u previous %u seq %u skew %d first %u acks %u space %u ",
4284 GetCurrentThreadId(), rx_ack_reason(ap->reason),
4285 ntohl(ap->serial), ntohl(ap->previousPacket),
4286 (unsigned int)np->header.seq, (unsigned int)skew,
4287 ntohl(ap->firstPacket), ap->nAcks, ntohs(ap->bufferSpace) );
4291 for (offset = 0; offset < nAcks && len < sizeof(msg); offset++)
4292 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
4296 OutputDebugString(msg);
4298 #else /* AFS_NT40_ENV */
4301 "RACK: reason %x previous %u seq %u serial %u skew %d first %u",
4302 ap->reason, ntohl(ap->previousPacket),
4303 (unsigned int)np->header.seq, (unsigned int)serial,
4304 (unsigned int)skew, ntohl(ap->firstPacket));
4307 for (offset = 0; offset < nAcks; offset++)
4308 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
4313 #endif /* AFS_NT40_ENV */
4316 MUTEX_ENTER(&peer->peer_lock);
4319 * Start somewhere. Can't assume we can send what we can receive,
4320 * but we are clearly receiving.
4322 if (!peer->maxPacketSize)
4323 peer->maxPacketSize = RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE;
4325 if (pktsize > peer->maxPacketSize) {
4326 peer->maxPacketSize = pktsize;
4327 if ((pktsize-RX_IPUDP_SIZE > peer->ifMTU)) {
4328 peer->ifMTU=pktsize-RX_IPUDP_SIZE;
4329 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
4330 rxi_ScheduleGrowMTUEvent(call, 1);
4335 /* Update the outgoing packet skew value to the latest value of
4336 * the peer's incoming packet skew value. The ack packet, of
4337 * course, could arrive out of order, but that won't affect things
4339 peer->outPacketSkew = skew;
4342 clock_GetTime(&now);
4344 /* The transmit queue splits into 4 sections.
4346 * The first section is packets which have now been acknowledged
4347 * by a window size change in the ack. These have reached the
4348 * application layer, and may be discarded. These are packets
4349 * with sequence numbers < ap->firstPacket.
4351 * The second section is packets which have sequence numbers in
4352 * the range ap->firstPacket to ap->firstPacket + ap->nAcks. The
4353 * contents of the packet's ack array determines whether these
4354 * packets are acknowledged or not.
4356 * The third section is packets which fall above the range
4357 * addressed in the ack packet. These have not yet been received
4360 * The four section is packets which have not yet been transmitted.
4361 * These packets will have a header.serial of 0.
4364 /* First section - implicitly acknowledged packets that can be
4368 tp = queue_First(&call->tq, rx_packet);
4369 while(!queue_IsEnd(&call->tq, tp) && tp->header.seq < first) {
4370 struct rx_packet *next;
4372 next = queue_Next(tp, rx_packet);
4373 call->tfirst = tp->header.seq + 1;
4375 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4377 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4381 rxi_ComputeRate(call->conn->peer, call, p, np, ap->reason);
4384 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
4385 /* XXX Hack. Because we have to release the global rx lock when sending
4386 * packets (osi_NetSend) we drop all acks while we're traversing the tq
4387 * in rxi_Start sending packets out because packets may move to the
4388 * freePacketQueue as result of being here! So we drop these packets until
4389 * we're safely out of the traversing. Really ugly!
4390 * To make it even uglier, if we're using fine grain locking, we can
4391 * set the ack bits in the packets and have rxi_Start remove the packets
4392 * when it's done transmitting.
4394 if (call->flags & RX_CALL_TQ_BUSY) {
4395 #ifdef RX_ENABLE_LOCKS
4396 tp->flags |= RX_PKTFLAG_ACKED;
4397 call->flags |= RX_CALL_TQ_SOME_ACKED;
4398 #else /* RX_ENABLE_LOCKS */
4400 #endif /* RX_ENABLE_LOCKS */
4402 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4405 #ifdef RX_TRACK_PACKETS
4406 tp->flags &= ~RX_PKTFLAG_TQ;
4408 #ifdef RXDEBUG_PACKET
4410 #endif /* RXDEBUG_PACKET */
4411 rxi_FreePacket(tp); /* rxi_FreePacket mustn't wake up anyone, preemptively. */
4417 /* Give rate detector a chance to respond to ping requests */
4418 if (ap->reason == RX_ACK_PING_RESPONSE) {
4419 rxi_ComputeRate(peer, call, 0, np, ap->reason);
4423 /* N.B. we don't turn off any timers here. They'll go away by themselves, anyway */
4425 /* Second section of the queue - packets for which we are receiving
4428 * Go through the explicit acks/nacks and record the results in
4429 * the waiting packets. These are packets that can't be released
4430 * yet, even with a positive acknowledge. This positive
4431 * acknowledge only means the packet has been received by the
4432 * peer, not that it will be retained long enough to be sent to
4433 * the peer's upper level. In addition, reset the transmit timers
4434 * of any missing packets (those packets that must be missing
4435 * because this packet was out of sequence) */
4437 call->nSoftAcked = 0;
4439 while (!queue_IsEnd(&call->tq, tp) && tp->header.seq < first + nAcks) {
4440 /* Set the acknowledge flag per packet based on the
4441 * information in the ack packet. An acknowlegded packet can
4442 * be downgraded when the server has discarded a packet it
4443 * soacked previously, or when an ack packet is received
4444 * out of sequence. */
4445 if (ap->acks[tp->header.seq - first] == RX_ACK_TYPE_ACK) {
4446 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4448 tp->flags |= RX_PKTFLAG_ACKED;
4449 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4451 rxi_ComputeRate(call->conn->peer, call, tp, np, ap->reason);
4459 } else /* RX_ACK_TYPE_NACK */ {
4460 tp->flags &= ~RX_PKTFLAG_ACKED;
4464 tp = queue_Next(tp, rx_packet);
4467 /* We don't need to take any action with the 3rd or 4th section in the
4468 * queue - they're not addressed by the contents of this ACK packet.
4471 /* If the window has been extended by this acknowledge packet,
4472 * then wakeup a sender waiting in alloc for window space, or try
4473 * sending packets now, if he's been sitting on packets due to
4474 * lack of window space */
4475 if (call->tnext < (call->tfirst + call->twind)) {
4476 #ifdef RX_ENABLE_LOCKS
4477 CV_SIGNAL(&call->cv_twind);
4479 if (call->flags & RX_CALL_WAIT_WINDOW_ALLOC) {
4480 call->flags &= ~RX_CALL_WAIT_WINDOW_ALLOC;
4481 osi_rxWakeup(&call->twind);
4484 if (call->flags & RX_CALL_WAIT_WINDOW_SEND) {
4485 call->flags &= ~RX_CALL_WAIT_WINDOW_SEND;
4489 /* if the ack packet has a receivelen field hanging off it,
4490 * update our state */
4491 if (np->length >= rx_AckDataSize(ap->nAcks) + 2 * sizeof(afs_int32)) {
4494 /* If the ack packet has a "recommended" size that is less than
4495 * what I am using now, reduce my size to match */
4496 rx_packetread(np, rx_AckDataSize(ap->nAcks) + (int)sizeof(afs_int32),
4497 (int)sizeof(afs_int32), &tSize);
4498 tSize = (afs_uint32) ntohl(tSize);
4499 peer->natMTU = rxi_AdjustIfMTU(MIN(tSize, peer->ifMTU));
4501 /* Get the maximum packet size to send to this peer */
4502 rx_packetread(np, rx_AckDataSize(ap->nAcks), (int)sizeof(afs_int32),
4504 tSize = (afs_uint32) ntohl(tSize);
4505 tSize = (afs_uint32) MIN(tSize, rx_MyMaxSendSize);
4506 tSize = rxi_AdjustMaxMTU(peer->natMTU, tSize);
4508 /* sanity check - peer might have restarted with different params.
4509 * If peer says "send less", dammit, send less... Peer should never
4510 * be unable to accept packets of the size that prior AFS versions would
4511 * send without asking. */
4512 if (peer->maxMTU != tSize) {
4513 if (peer->maxMTU > tSize) /* possible cong., maxMTU decreased */
4515 peer->maxMTU = tSize;
4516 peer->MTU = MIN(tSize, peer->MTU);
4517 call->MTU = MIN(call->MTU, tSize);
4520 if (np->length == rx_AckDataSize(ap->nAcks) + 3 * sizeof(afs_int32)) {
4523 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4524 (int)sizeof(afs_int32), &tSize);
4525 tSize = (afs_uint32) ntohl(tSize); /* peer's receive window, if it's */
4526 if (tSize < call->twind) { /* smaller than our send */
4527 call->twind = tSize; /* window, we must send less... */
4528 call->ssthresh = MIN(call->twind, call->ssthresh);
4529 call->conn->twind[call->channel] = call->twind;
4532 /* Only send jumbograms to 3.4a fileservers. 3.3a RX gets the
4533 * network MTU confused with the loopback MTU. Calculate the
4534 * maximum MTU here for use in the slow start code below.
4536 /* Did peer restart with older RX version? */
4537 if (peer->maxDgramPackets > 1) {
4538 peer->maxDgramPackets = 1;
4540 } else if (np->length >=
4541 rx_AckDataSize(ap->nAcks) + 4 * sizeof(afs_int32)) {
4544 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4545 sizeof(afs_int32), &tSize);
4546 tSize = (afs_uint32) ntohl(tSize);
4548 * As of AFS 3.5 we set the send window to match the receive window.
4550 if (tSize < call->twind) {
4551 call->twind = tSize;
4552 call->conn->twind[call->channel] = call->twind;
4553 call->ssthresh = MIN(call->twind, call->ssthresh);
4554 } else if (tSize > call->twind) {
4555 call->twind = tSize;
4556 call->conn->twind[call->channel] = call->twind;
4560 * As of AFS 3.5, a jumbogram is more than one fixed size
4561 * packet transmitted in a single UDP datagram. If the remote
4562 * MTU is smaller than our local MTU then never send a datagram
4563 * larger than the natural MTU.
4566 rx_AckDataSize(ap->nAcks) + 3 * (int)sizeof(afs_int32),
4567 (int)sizeof(afs_int32), &tSize);
4568 maxDgramPackets = (afs_uint32) ntohl(tSize);
4569 maxDgramPackets = MIN(maxDgramPackets, rxi_nDgramPackets);
4571 MIN(maxDgramPackets, (int)(peer->ifDgramPackets));
4572 if (maxDgramPackets > 1) {
4573 peer->maxDgramPackets = maxDgramPackets;
4574 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
4576 peer->maxDgramPackets = 1;
4577 call->MTU = peer->natMTU;
4579 } else if (peer->maxDgramPackets > 1) {
4580 /* Restarted with lower version of RX */
4581 peer->maxDgramPackets = 1;
4583 } else if (peer->maxDgramPackets > 1
4584 || peer->maxMTU != OLD_MAX_PACKET_SIZE) {
4585 /* Restarted with lower version of RX */
4586 peer->maxMTU = OLD_MAX_PACKET_SIZE;
4587 peer->natMTU = OLD_MAX_PACKET_SIZE;
4588 peer->MTU = OLD_MAX_PACKET_SIZE;
4589 peer->maxDgramPackets = 1;
4590 peer->nDgramPackets = 1;
4592 call->MTU = OLD_MAX_PACKET_SIZE;
4597 * Calculate how many datagrams were successfully received after
4598 * the first missing packet and adjust the negative ack counter
4603 nNacked = (nNacked + call->nDgramPackets - 1) / call->nDgramPackets;
4604 if (call->nNacks < nNacked) {
4605 call->nNacks = nNacked;
4608 call->nAcks += newAckCount;
4612 /* If the packet contained new acknowledgements, rather than just
4613 * being a duplicate of one we have previously seen, then we can restart
4616 if (newAckCount > 0)
4617 rxi_rto_packet_acked(call, istack);
4619 if (call->flags & RX_CALL_FAST_RECOVER) {
4620 if (newAckCount == 0) {
4621 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4623 call->flags &= ~RX_CALL_FAST_RECOVER;
4624 call->cwind = call->nextCwind;
4625 call->nextCwind = 0;
4628 call->nCwindAcks = 0;
4629 } else if (nNacked && call->nNacks >= (u_short) rx_nackThreshold) {
4630 /* Three negative acks in a row trigger congestion recovery */
4631 call->flags |= RX_CALL_FAST_RECOVER;
4632 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
4634 MIN((int)(call->ssthresh + rx_nackThreshold), rx_maxSendWindow);
4635 call->nDgramPackets = MAX(2, (int)call->nDgramPackets) >> 1;
4636 call->nextCwind = call->ssthresh;
4639 peer->MTU = call->MTU;
4640 peer->cwind = call->nextCwind;
4641 peer->nDgramPackets = call->nDgramPackets;
4643 call->congestSeq = peer->congestSeq;
4645 /* Reset the resend times on the packets that were nacked
4646 * so we will retransmit as soon as the window permits
4649 for (acked = 0, queue_ScanBackwards(&call->tq, tp, nxp, rx_packet)) {
4651 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4652 tp->flags &= ~RX_PKTFLAG_SENT;
4654 } else if (tp->flags & RX_PKTFLAG_ACKED) {
4659 /* If cwind is smaller than ssthresh, then increase
4660 * the window one packet for each ack we receive (exponential
4662 * If cwind is greater than or equal to ssthresh then increase
4663 * the congestion window by one packet for each cwind acks we
4664 * receive (linear growth). */
4665 if (call->cwind < call->ssthresh) {
4667 MIN((int)call->ssthresh, (int)(call->cwind + newAckCount));
4668 call->nCwindAcks = 0;
4670 call->nCwindAcks += newAckCount;
4671 if (call->nCwindAcks >= call->cwind) {
4672 call->nCwindAcks = 0;
4673 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4677 * If we have received several acknowledgements in a row then
4678 * it is time to increase the size of our datagrams
4680 if ((int)call->nAcks > rx_nDgramThreshold) {
4681 if (peer->maxDgramPackets > 1) {
4682 if (call->nDgramPackets < peer->maxDgramPackets) {
4683 call->nDgramPackets++;
4685 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
4686 } else if (call->MTU < peer->maxMTU) {
4687 /* don't upgrade if we can't handle it */
4688 if ((call->nDgramPackets == 1) && (call->MTU >= peer->ifMTU))
4689 call->MTU = peer->ifMTU;
4691 call->MTU += peer->natMTU;
4692 call->MTU = MIN(call->MTU, peer->maxMTU);
4699 MUTEX_EXIT(&peer->peer_lock); /* rxi_Start will lock peer. */
4701 /* Servers need to hold the call until all response packets have
4702 * been acknowledged. Soft acks are good enough since clients
4703 * are not allowed to clear their receive queues. */
4704 if (call->state == RX_STATE_HOLD
4705 && call->tfirst + call->nSoftAcked >= call->tnext) {
4706 call->state = RX_STATE_DALLY;
4707 rxi_ClearTransmitQueue(call, 0);
4708 rxevent_Cancel(call->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE);
4709 } else if (!queue_IsEmpty(&call->tq)) {
4710 rxi_Start(call, istack);
4715 /* Received a response to a challenge packet */
4717 rxi_ReceiveResponsePacket(struct rx_connection *conn,
4718 struct rx_packet *np, int istack)
4722 /* Ignore the packet if we're the client */
4723 if (conn->type == RX_CLIENT_CONNECTION)
4726 /* If already authenticated, ignore the packet (it's probably a retry) */
4727 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0)
4730 /* Otherwise, have the security object evaluate the response packet */
4731 error = RXS_CheckResponse(conn->securityObject, conn, np);
4733 /* If the response is invalid, reset the connection, sending
4734 * an abort to the peer */
4738 rxi_ConnectionError(conn, error);
4739 MUTEX_ENTER(&conn->conn_data_lock);
4740 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4741 MUTEX_EXIT(&conn->conn_data_lock);
4744 /* If the response is valid, any calls waiting to attach
4745 * servers can now do so */
4748 for (i = 0; i < RX_MAXCALLS; i++) {
4749 struct rx_call *call = conn->call[i];
4751 MUTEX_ENTER(&call->lock);
4752 if (call->state == RX_STATE_PRECALL)
4753 rxi_AttachServerProc(call, (osi_socket) - 1, NULL, NULL);
4754 /* tnop can be null if newcallp is null */
4755 MUTEX_EXIT(&call->lock);
4759 /* Update the peer reachability information, just in case
4760 * some calls went into attach-wait while we were waiting
4761 * for authentication..
4763 rxi_UpdatePeerReach(conn, NULL);
4768 /* A client has received an authentication challenge: the security
4769 * object is asked to cough up a respectable response packet to send
4770 * back to the server. The server is responsible for retrying the
4771 * challenge if it fails to get a response. */
4774 rxi_ReceiveChallengePacket(struct rx_connection *conn,
4775 struct rx_packet *np, int istack)
4779 /* Ignore the challenge if we're the server */
4780 if (conn->type == RX_SERVER_CONNECTION)
4783 /* Ignore the challenge if the connection is otherwise idle; someone's
4784 * trying to use us as an oracle. */
4785 if (!rxi_HasActiveCalls(conn))
4788 /* Send the security object the challenge packet. It is expected to fill
4789 * in the response. */
4790 error = RXS_GetResponse(conn->securityObject, conn, np);
4792 /* If the security object is unable to return a valid response, reset the
4793 * connection and send an abort to the peer. Otherwise send the response
4794 * packet to the peer connection. */
4796 rxi_ConnectionError(conn, error);
4797 MUTEX_ENTER(&conn->conn_data_lock);
4798 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4799 MUTEX_EXIT(&conn->conn_data_lock);
4801 np = rxi_SendSpecial((struct rx_call *)0, conn, np,
4802 RX_PACKET_TYPE_RESPONSE, NULL, -1, istack);
4808 /* Find an available server process to service the current request in
4809 * the given call structure. If one isn't available, queue up this
4810 * call so it eventually gets one */
4812 rxi_AttachServerProc(struct rx_call *call,
4813 osi_socket socket, int *tnop,
4814 struct rx_call **newcallp)
4816 struct rx_serverQueueEntry *sq;
4817 struct rx_service *service = call->conn->service;
4820 /* May already be attached */
4821 if (call->state == RX_STATE_ACTIVE)
4824 MUTEX_ENTER(&rx_serverPool_lock);
4826 haveQuota = QuotaOK(service);
4827 if ((!haveQuota) || queue_IsEmpty(&rx_idleServerQueue)) {
4828 /* If there are no processes available to service this call,
4829 * put the call on the incoming call queue (unless it's
4830 * already on the queue).
4832 #ifdef RX_ENABLE_LOCKS
4834 ReturnToServerPool(service);
4835 #endif /* RX_ENABLE_LOCKS */
4837 if (!(call->flags & RX_CALL_WAIT_PROC)) {
4838 call->flags |= RX_CALL_WAIT_PROC;
4839 rx_atomic_inc(&rx_nWaiting);
4840 rx_atomic_inc(&rx_nWaited);
4841 rxi_calltrace(RX_CALL_ARRIVAL, call);
4842 SET_CALL_QUEUE_LOCK(call, &rx_serverPool_lock);
4843 queue_Append(&rx_incomingCallQueue, call);
4846 sq = queue_Last(&rx_idleServerQueue, rx_serverQueueEntry);
4848 /* If hot threads are enabled, and both newcallp and sq->socketp
4849 * are non-null, then this thread will process the call, and the
4850 * idle server thread will start listening on this threads socket.
4853 if (rx_enable_hot_thread && newcallp && sq->socketp) {
4856 *sq->socketp = socket;
4857 clock_GetTime(&call->startTime);
4858 MUTEX_ENTER(&rx_refcnt_mutex);
4859 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
4860 MUTEX_EXIT(&rx_refcnt_mutex);
4864 if (call->flags & RX_CALL_WAIT_PROC) {
4865 /* Conservative: I don't think this should happen */
4866 call->flags &= ~RX_CALL_WAIT_PROC;
4867 if (queue_IsOnQueue(call)) {
4870 rx_atomic_dec(&rx_nWaiting);
4873 call->state = RX_STATE_ACTIVE;
4874 call->mode = RX_MODE_RECEIVING;
4875 #ifdef RX_KERNEL_TRACE
4877 int glockOwner = ISAFS_GLOCK();
4880 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
4881 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
4887 if (call->flags & RX_CALL_CLEARED) {
4888 /* send an ack now to start the packet flow up again */
4889 call->flags &= ~RX_CALL_CLEARED;
4890 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4892 #ifdef RX_ENABLE_LOCKS
4895 service->nRequestsRunning++;
4896 MUTEX_ENTER(&rx_quota_mutex);
4897 if (service->nRequestsRunning <= service->minProcs)
4900 MUTEX_EXIT(&rx_quota_mutex);
4904 MUTEX_EXIT(&rx_serverPool_lock);
4907 /* Delay the sending of an acknowledge event for a short while, while
4908 * a new call is being prepared (in the case of a client) or a reply
4909 * is being prepared (in the case of a server). Rather than sending
4910 * an ack packet, an ACKALL packet is sent. */
4912 rxi_AckAll(struct rxevent *event, struct rx_call *call, char *dummy)
4914 #ifdef RX_ENABLE_LOCKS
4916 MUTEX_ENTER(&call->lock);
4917 call->delayedAckEvent = NULL;
4918 MUTEX_ENTER(&rx_refcnt_mutex);
4919 CALL_RELE(call, RX_CALL_REFCOUNT_ACKALL);
4920 MUTEX_EXIT(&rx_refcnt_mutex);
4922 rxi_SendSpecial(call, call->conn, (struct rx_packet *)0,
4923 RX_PACKET_TYPE_ACKALL, NULL, 0, 0);
4924 call->flags |= RX_CALL_ACKALL_SENT;
4926 MUTEX_EXIT(&call->lock);
4927 #else /* RX_ENABLE_LOCKS */
4929 call->delayedAckEvent = NULL;
4930 rxi_SendSpecial(call, call->conn, (struct rx_packet *)0,
4931 RX_PACKET_TYPE_ACKALL, NULL, 0, 0);
4932 call->flags |= RX_CALL_ACKALL_SENT;
4933 #endif /* RX_ENABLE_LOCKS */
4937 rxi_SendDelayedAck(struct rxevent *event, void *arg1, void *unused)
4939 struct rx_call *call = arg1;
4940 #ifdef RX_ENABLE_LOCKS
4942 MUTEX_ENTER(&call->lock);
4943 if (event == call->delayedAckEvent)
4944 call->delayedAckEvent = NULL;
4945 MUTEX_ENTER(&rx_refcnt_mutex);
4946 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
4947 MUTEX_EXIT(&rx_refcnt_mutex);
4949 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4951 MUTEX_EXIT(&call->lock);
4952 #else /* RX_ENABLE_LOCKS */
4954 call->delayedAckEvent = NULL;
4955 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4956 #endif /* RX_ENABLE_LOCKS */
4960 #ifdef RX_ENABLE_LOCKS
4961 /* Set ack in all packets in transmit queue. rxi_Start will deal with
4962 * clearing them out.
4965 rxi_SetAcksInTransmitQueue(struct rx_call *call)
4967 struct rx_packet *p, *tp;
4970 for (queue_Scan(&call->tq, p, tp, rx_packet)) {
4971 p->flags |= RX_PKTFLAG_ACKED;
4975 call->flags |= RX_CALL_TQ_CLEARME;
4976 call->flags |= RX_CALL_TQ_SOME_ACKED;
4979 rxi_rto_cancel(call);
4981 call->tfirst = call->tnext;
4982 call->nSoftAcked = 0;
4984 if (call->flags & RX_CALL_FAST_RECOVER) {
4985 call->flags &= ~RX_CALL_FAST_RECOVER;
4986 call->cwind = call->nextCwind;
4987 call->nextCwind = 0;
4990 CV_SIGNAL(&call->cv_twind);
4992 #endif /* RX_ENABLE_LOCKS */
4994 /* Clear out the transmit queue for the current call (all packets have
4995 * been received by peer) */
4997 rxi_ClearTransmitQueue(struct rx_call *call, int force)
4999 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5000 struct rx_packet *p, *tp;
5002 if (!force && (call->flags & RX_CALL_TQ_BUSY)) {
5004 for (queue_Scan(&call->tq, p, tp, rx_packet)) {
5005 p->flags |= RX_PKTFLAG_ACKED;
5009 call->flags |= RX_CALL_TQ_CLEARME;
5010 call->flags |= RX_CALL_TQ_SOME_ACKED;
5013 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5014 #ifdef RXDEBUG_PACKET
5016 #endif /* RXDEBUG_PACKET */
5017 rxi_FreePackets(0, &call->tq);
5018 rxi_WakeUpTransmitQueue(call);
5019 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5020 call->flags &= ~RX_CALL_TQ_CLEARME;
5022 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5024 rxi_rto_cancel(call);
5025 call->tfirst = call->tnext; /* implicitly acknowledge all data already sent */
5026 call->nSoftAcked = 0;
5028 if (call->flags & RX_CALL_FAST_RECOVER) {
5029 call->flags &= ~RX_CALL_FAST_RECOVER;
5030 call->cwind = call->nextCwind;
5032 #ifdef RX_ENABLE_LOCKS
5033 CV_SIGNAL(&call->cv_twind);
5035 osi_rxWakeup(&call->twind);
5040 rxi_ClearReceiveQueue(struct rx_call *call)
5042 if (queue_IsNotEmpty(&call->rq)) {
5045 count = rxi_FreePackets(0, &call->rq);
5046 rx_packetReclaims += count;
5047 #ifdef RXDEBUG_PACKET
5049 if ( call->rqc != 0 )
5050 dpf(("rxi_ClearReceiveQueue call %"AFS_PTR_FMT" rqc %u != 0\n", call, call->rqc));
5052 call->flags &= ~(RX_CALL_RECEIVE_DONE | RX_CALL_HAVE_LAST);
5054 if (call->state == RX_STATE_PRECALL) {
5055 call->flags |= RX_CALL_CLEARED;
5059 /* Send an abort packet for the specified call */
5061 rxi_SendCallAbort(struct rx_call *call, struct rx_packet *packet,
5062 int istack, int force)
5065 struct clock when, now;
5070 /* Clients should never delay abort messages */
5071 if (rx_IsClientConn(call->conn))
5074 if (call->abortCode != call->error) {
5075 call->abortCode = call->error;
5076 call->abortCount = 0;
5079 if (force || rxi_callAbortThreshhold == 0
5080 || call->abortCount < rxi_callAbortThreshhold) {
5081 if (call->delayedAbortEvent) {
5082 rxevent_Cancel(call->delayedAbortEvent, call,
5083 RX_CALL_REFCOUNT_ABORT);
5085 error = htonl(call->error);
5088 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
5089 (char *)&error, sizeof(error), istack);
5090 } else if (!call->delayedAbortEvent) {
5091 clock_GetTime(&now);
5093 clock_Addmsec(&when, rxi_callAbortDelay);
5094 MUTEX_ENTER(&rx_refcnt_mutex);
5095 CALL_HOLD(call, RX_CALL_REFCOUNT_ABORT);
5096 MUTEX_EXIT(&rx_refcnt_mutex);
5097 call->delayedAbortEvent =
5098 rxevent_PostNow(&when, &now, rxi_SendDelayedCallAbort, call, 0);
5103 /* Send an abort packet for the specified connection. Packet is an
5104 * optional pointer to a packet that can be used to send the abort.
5105 * Once the number of abort messages reaches the threshhold, an
5106 * event is scheduled to send the abort. Setting the force flag
5107 * overrides sending delayed abort messages.
5109 * NOTE: Called with conn_data_lock held. conn_data_lock is dropped
5110 * to send the abort packet.
5113 rxi_SendConnectionAbort(struct rx_connection *conn,
5114 struct rx_packet *packet, int istack, int force)
5117 struct clock when, now;
5122 /* Clients should never delay abort messages */
5123 if (rx_IsClientConn(conn))
5126 if (force || rxi_connAbortThreshhold == 0
5127 || conn->abortCount < rxi_connAbortThreshhold) {
5128 if (conn->delayedAbortEvent) {
5129 rxevent_Cancel(conn->delayedAbortEvent, (struct rx_call *)0, 0);
5131 error = htonl(conn->error);
5133 MUTEX_EXIT(&conn->conn_data_lock);
5135 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5136 RX_PACKET_TYPE_ABORT, (char *)&error,
5137 sizeof(error), istack);
5138 MUTEX_ENTER(&conn->conn_data_lock);
5139 } else if (!conn->delayedAbortEvent) {
5140 clock_GetTime(&now);
5142 clock_Addmsec(&when, rxi_connAbortDelay);
5143 conn->delayedAbortEvent =
5144 rxevent_PostNow(&when, &now, rxi_SendDelayedConnAbort, conn, 0);
5149 /* Associate an error all of the calls owned by a connection. Called
5150 * with error non-zero. This is only for really fatal things, like
5151 * bad authentication responses. The connection itself is set in
5152 * error at this point, so that future packets received will be
5155 rxi_ConnectionError(struct rx_connection *conn,
5161 dpf(("rxi_ConnectionError conn %"AFS_PTR_FMT" error %d\n", conn, error));
5163 MUTEX_ENTER(&conn->conn_data_lock);
5164 if (conn->challengeEvent)
5165 rxevent_Cancel(conn->challengeEvent, (struct rx_call *)0, 0);
5166 if (conn->natKeepAliveEvent)
5167 rxevent_Cancel(conn->natKeepAliveEvent, (struct rx_call *)0, 0);
5168 if (conn->checkReachEvent) {
5169 rxevent_Cancel(conn->checkReachEvent, (struct rx_call *)0, 0);
5170 conn->checkReachEvent = 0;
5171 conn->flags &= ~RX_CONN_ATTACHWAIT;
5172 MUTEX_ENTER(&rx_refcnt_mutex);
5174 MUTEX_EXIT(&rx_refcnt_mutex);
5176 MUTEX_EXIT(&conn->conn_data_lock);
5177 for (i = 0; i < RX_MAXCALLS; i++) {
5178 struct rx_call *call = conn->call[i];
5180 MUTEX_ENTER(&call->lock);
5181 rxi_CallError(call, error);
5182 MUTEX_EXIT(&call->lock);
5185 conn->error = error;
5186 if (rx_stats_active)
5187 rx_atomic_inc(&rx_stats.fatalErrors);
5192 * Interrupt an in-progress call with the specified error and wakeup waiters.
5194 * @param[in] call The call to interrupt
5195 * @param[in] error The error code to send to the peer
5198 rx_InterruptCall(struct rx_call *call, afs_int32 error)
5200 MUTEX_ENTER(&call->lock);
5201 rxi_CallError(call, error);
5202 rxi_SendCallAbort(call, NULL, 0, 1);
5203 MUTEX_EXIT(&call->lock);
5207 rxi_CallError(struct rx_call *call, afs_int32 error)
5210 osirx_AssertMine(&call->lock, "rxi_CallError");
5212 dpf(("rxi_CallError call %"AFS_PTR_FMT" error %d call->error %d\n", call, error, call->error));
5214 error = call->error;
5216 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5217 if (!((call->flags & RX_CALL_TQ_BUSY) || (call->tqWaiters > 0))) {
5218 rxi_ResetCall(call, 0);
5221 rxi_ResetCall(call, 0);
5223 call->error = error;
5226 /* Reset various fields in a call structure, and wakeup waiting
5227 * processes. Some fields aren't changed: state & mode are not
5228 * touched (these must be set by the caller), and bufptr, nLeft, and
5229 * nFree are not reset, since these fields are manipulated by
5230 * unprotected macros, and may only be reset by non-interrupting code.
5233 /* this code requires that call->conn be set properly as a pre-condition. */
5234 #endif /* ADAPT_WINDOW */
5237 rxi_ResetCall(struct rx_call *call, int newcall)
5240 struct rx_peer *peer;
5241 struct rx_packet *packet;
5243 osirx_AssertMine(&call->lock, "rxi_ResetCall");
5245 dpf(("rxi_ResetCall(call %"AFS_PTR_FMT", newcall %d)\n", call, newcall));
5247 /* Notify anyone who is waiting for asynchronous packet arrival */
5248 if (call->arrivalProc) {
5249 (*call->arrivalProc) (call, call->arrivalProcHandle,
5250 call->arrivalProcArg);
5251 call->arrivalProc = (void (*)())0;
5254 if (call->growMTUEvent)
5255 rxevent_Cancel(call->growMTUEvent, call,
5256 RX_CALL_REFCOUNT_ALIVE);
5258 if (call->delayedAbortEvent) {
5259 rxevent_Cancel(call->delayedAbortEvent, call, RX_CALL_REFCOUNT_ABORT);
5260 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5262 rxi_SendCallAbort(call, packet, 0, 1);
5263 rxi_FreePacket(packet);
5268 * Update the peer with the congestion information in this call
5269 * so other calls on this connection can pick up where this call
5270 * left off. If the congestion sequence numbers don't match then
5271 * another call experienced a retransmission.
5273 peer = call->conn->peer;
5274 MUTEX_ENTER(&peer->peer_lock);
5276 if (call->congestSeq == peer->congestSeq) {
5277 peer->cwind = MAX(peer->cwind, call->cwind);
5278 peer->MTU = MAX(peer->MTU, call->MTU);
5279 peer->nDgramPackets =
5280 MAX(peer->nDgramPackets, call->nDgramPackets);
5283 call->abortCode = 0;
5284 call->abortCount = 0;
5286 if (peer->maxDgramPackets > 1) {
5287 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
5289 call->MTU = peer->MTU;
5291 call->cwind = MIN((int)peer->cwind, (int)peer->nDgramPackets);
5292 call->ssthresh = rx_maxSendWindow;
5293 call->nDgramPackets = peer->nDgramPackets;
5294 call->congestSeq = peer->congestSeq;
5295 call->rtt = peer->rtt;
5296 call->rtt_dev = peer->rtt_dev;
5297 clock_Zero(&call->rto);
5298 clock_Addmsec(&call->rto,
5299 MAX(((call->rtt >> 3) + call->rtt_dev), rx_minPeerTimeout) + 200);
5300 MUTEX_EXIT(&peer->peer_lock);
5302 flags = call->flags;
5303 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5304 rxi_WaitforTQBusy(call);
5305 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5307 rxi_ClearTransmitQueue(call, 1);
5308 if (call->tqWaiters || (flags & RX_CALL_TQ_WAIT)) {
5309 dpf(("rcall %"AFS_PTR_FMT" has %d waiters and flags %d\n", call, call->tqWaiters, call->flags));
5313 if ((flags & RX_CALL_PEER_BUSY)) {
5314 /* The call channel is still busy; resetting the call doesn't change
5316 call->flags |= RX_CALL_PEER_BUSY;
5319 rxi_ClearReceiveQueue(call);
5320 /* why init the queue if you just emptied it? queue_Init(&call->rq); */
5324 call->twind = call->conn->twind[call->channel];
5325 call->rwind = call->conn->rwind[call->channel];
5326 call->nSoftAcked = 0;
5327 call->nextCwind = 0;
5330 call->nCwindAcks = 0;
5331 call->nSoftAcks = 0;
5332 call->nHardAcks = 0;
5334 call->tfirst = call->rnext = call->tnext = 1;
5337 call->lastAcked = 0;
5338 call->localStatus = call->remoteStatus = 0;
5340 if (flags & RX_CALL_READER_WAIT) {
5341 #ifdef RX_ENABLE_LOCKS
5342 CV_BROADCAST(&call->cv_rq);
5344 osi_rxWakeup(&call->rq);
5347 if (flags & RX_CALL_WAIT_PACKETS) {
5348 MUTEX_ENTER(&rx_freePktQ_lock);
5349 rxi_PacketsUnWait(); /* XXX */
5350 MUTEX_EXIT(&rx_freePktQ_lock);
5352 #ifdef RX_ENABLE_LOCKS
5353 CV_SIGNAL(&call->cv_twind);
5355 if (flags & RX_CALL_WAIT_WINDOW_ALLOC)
5356 osi_rxWakeup(&call->twind);
5359 #ifdef RX_ENABLE_LOCKS
5360 /* The following ensures that we don't mess with any queue while some
5361 * other thread might also be doing so. The call_queue_lock field is
5362 * is only modified under the call lock. If the call is in the process
5363 * of being removed from a queue, the call is not locked until the
5364 * the queue lock is dropped and only then is the call_queue_lock field
5365 * zero'd out. So it's safe to lock the queue if call_queue_lock is set.
5366 * Note that any other routine which removes a call from a queue has to
5367 * obtain the queue lock before examing the queue and removing the call.
5369 if (call->call_queue_lock) {
5370 MUTEX_ENTER(call->call_queue_lock);
5371 if (queue_IsOnQueue(call)) {
5373 if (flags & RX_CALL_WAIT_PROC) {
5374 rx_atomic_dec(&rx_nWaiting);
5377 MUTEX_EXIT(call->call_queue_lock);
5378 CLEAR_CALL_QUEUE_LOCK(call);
5380 #else /* RX_ENABLE_LOCKS */
5381 if (queue_IsOnQueue(call)) {
5383 if (flags & RX_CALL_WAIT_PROC)
5384 rx_atomic_dec(&rx_nWaiting);
5386 #endif /* RX_ENABLE_LOCKS */
5388 rxi_KeepAliveOff(call);
5389 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
5392 /* Send an acknowledge for the indicated packet (seq,serial) of the
5393 * indicated call, for the indicated reason (reason). This
5394 * acknowledge will specifically acknowledge receiving the packet, and
5395 * will also specify which other packets for this call have been
5396 * received. This routine returns the packet that was used to the
5397 * caller. The caller is responsible for freeing it or re-using it.
5398 * This acknowledgement also returns the highest sequence number
5399 * actually read out by the higher level to the sender; the sender
5400 * promises to keep around packets that have not been read by the
5401 * higher level yet (unless, of course, the sender decides to abort
5402 * the call altogether). Any of p, seq, serial, pflags, or reason may
5403 * be set to zero without ill effect. That is, if they are zero, they
5404 * will not convey any information.
5405 * NOW there is a trailer field, after the ack where it will safely be
5406 * ignored by mundanes, which indicates the maximum size packet this
5407 * host can swallow. */
5409 struct rx_packet *optionalPacket; use to send ack (or null)
5410 int seq; Sequence number of the packet we are acking
5411 int serial; Serial number of the packet
5412 int pflags; Flags field from packet header
5413 int reason; Reason an acknowledge was prompted
5417 rxi_SendAck(struct rx_call *call,
5418 struct rx_packet *optionalPacket, int serial, int reason,
5421 struct rx_ackPacket *ap;
5422 struct rx_packet *rqp;
5423 struct rx_packet *nxp; /* For queue_Scan */
5424 struct rx_packet *p;
5427 afs_uint32 padbytes = 0;
5428 #ifdef RX_ENABLE_TSFPQ
5429 struct rx_ts_info_t * rx_ts_info;
5433 * Open the receive window once a thread starts reading packets
5435 if (call->rnext > 1) {
5436 call->conn->rwind[call->channel] = call->rwind = rx_maxReceiveWindow;
5439 /* Don't attempt to grow MTU if this is a critical ping */
5440 if (reason == RX_ACK_MTU) {
5441 /* keep track of per-call attempts, if we're over max, do in small
5442 * otherwise in larger? set a size to increment by, decrease
5445 if (call->conn->peer->maxPacketSize &&
5446 (call->conn->peer->maxPacketSize < OLD_MAX_PACKET_SIZE
5448 padbytes = call->conn->peer->maxPacketSize+16;
5450 padbytes = call->conn->peer->maxMTU + 128;
5452 /* do always try a minimum size ping */
5453 padbytes = MAX(padbytes, RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE+4);
5455 /* subtract the ack payload */
5456 padbytes -= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32));
5457 reason = RX_ACK_PING;
5460 call->nHardAcks = 0;
5461 call->nSoftAcks = 0;
5462 if (call->rnext > call->lastAcked)
5463 call->lastAcked = call->rnext;
5467 rx_computelen(p, p->length); /* reset length, you never know */
5468 } /* where that's been... */
5469 #ifdef RX_ENABLE_TSFPQ
5471 RX_TS_INFO_GET(rx_ts_info);
5472 if ((p = rx_ts_info->local_special_packet)) {
5473 rx_computelen(p, p->length);
5474 } else if ((p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5475 rx_ts_info->local_special_packet = p;
5476 } else { /* We won't send the ack, but don't panic. */
5477 return optionalPacket;
5481 else if (!(p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5482 /* We won't send the ack, but don't panic. */
5483 return optionalPacket;
5488 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32) -
5491 if (rxi_AllocDataBuf(p, templ, RX_PACKET_CLASS_SPECIAL) > 0) {
5492 #ifndef RX_ENABLE_TSFPQ
5493 if (!optionalPacket)
5496 return optionalPacket;
5498 templ = rx_AckDataSize(call->rwind) + 2 * sizeof(afs_int32);
5499 if (rx_Contiguous(p) < templ) {
5500 #ifndef RX_ENABLE_TSFPQ
5501 if (!optionalPacket)
5504 return optionalPacket;
5509 /* MTUXXX failing to send an ack is very serious. We should */
5510 /* try as hard as possible to send even a partial ack; it's */
5511 /* better than nothing. */
5512 ap = (struct rx_ackPacket *)rx_DataOf(p);
5513 ap->bufferSpace = htonl(0); /* Something should go here, sometime */
5514 ap->reason = reason;
5516 /* The skew computation used to be bogus, I think it's better now. */
5517 /* We should start paying attention to skew. XXX */
5518 ap->serial = htonl(serial);
5519 ap->maxSkew = 0; /* used to be peer->inPacketSkew */
5522 * First packet not yet forwarded to reader. When ACKALL has been
5523 * sent the peer has been told that all received packets will be
5524 * delivered to the reader. The value 'rnext' is used internally
5525 * to refer to the next packet in the receive queue that must be
5526 * delivered to the reader. From the perspective of the peer it
5527 * already has so report the last sequence number plus one if there
5528 * are packets in the receive queue awaiting processing.
5530 if ((call->flags & RX_CALL_ACKALL_SENT) &&
5531 !queue_IsEmpty(&call->rq)) {
5532 ap->firstPacket = htonl(queue_Last(&call->rq, rx_packet)->header.seq + 1);
5534 ap->firstPacket = htonl(call->rnext);
5536 ap->previousPacket = htonl(call->rprev); /* Previous packet received */
5538 /* No fear of running out of ack packet here because there can only be at most
5539 * one window full of unacknowledged packets. The window size must be constrained
5540 * to be less than the maximum ack size, of course. Also, an ack should always
5541 * fit into a single packet -- it should not ever be fragmented. */
5542 for (offset = 0, queue_Scan(&call->rq, rqp, nxp, rx_packet)) {
5543 if (!rqp || !call->rq.next
5544 || (rqp->header.seq > (call->rnext + call->rwind))) {
5545 #ifndef RX_ENABLE_TSFPQ
5546 if (!optionalPacket)
5549 rxi_CallError(call, RX_CALL_DEAD);
5550 return optionalPacket;
5553 while (rqp->header.seq > call->rnext + offset)
5554 ap->acks[offset++] = RX_ACK_TYPE_NACK;
5555 ap->acks[offset++] = RX_ACK_TYPE_ACK;
5557 if ((offset > (u_char) rx_maxReceiveWindow) || (offset > call->rwind)) {
5558 #ifndef RX_ENABLE_TSFPQ
5559 if (!optionalPacket)
5562 rxi_CallError(call, RX_CALL_DEAD);
5563 return optionalPacket;
5568 p->length = rx_AckDataSize(offset) + 4 * sizeof(afs_int32);
5570 /* these are new for AFS 3.3 */
5571 templ = rxi_AdjustMaxMTU(call->conn->peer->ifMTU, rx_maxReceiveSize);
5572 templ = htonl(templ);
5573 rx_packetwrite(p, rx_AckDataSize(offset), sizeof(afs_int32), &templ);
5574 templ = htonl(call->conn->peer->ifMTU);
5575 rx_packetwrite(p, rx_AckDataSize(offset) + sizeof(afs_int32),
5576 sizeof(afs_int32), &templ);
5578 /* new for AFS 3.4 */
5579 templ = htonl(call->rwind);
5580 rx_packetwrite(p, rx_AckDataSize(offset) + 2 * sizeof(afs_int32),
5581 sizeof(afs_int32), &templ);
5583 /* new for AFS 3.5 */
5584 templ = htonl(call->conn->peer->ifDgramPackets);
5585 rx_packetwrite(p, rx_AckDataSize(offset) + 3 * sizeof(afs_int32),
5586 sizeof(afs_int32), &templ);
5588 p->header.serviceId = call->conn->serviceId;
5589 p->header.cid = (call->conn->cid | call->channel);
5590 p->header.callNumber = *call->callNumber;
5592 p->header.securityIndex = call->conn->securityIndex;
5593 p->header.epoch = call->conn->epoch;
5594 p->header.type = RX_PACKET_TYPE_ACK;
5595 p->header.flags = RX_SLOW_START_OK;
5596 if (reason == RX_ACK_PING) {
5597 p->header.flags |= RX_REQUEST_ACK;
5599 clock_GetTime(&call->pingRequestTime);
5602 p->length = padbytes +
5603 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32);
5606 /* not fast but we can potentially use this if truncated
5607 * fragments are delivered to figure out the mtu.
5609 rx_packetwrite(p, rx_AckDataSize(offset) + 4 *
5610 sizeof(afs_int32), sizeof(afs_int32),
5614 if (call->conn->type == RX_CLIENT_CONNECTION)
5615 p->header.flags |= RX_CLIENT_INITIATED;
5619 if (rxdebug_active) {
5623 len = _snprintf(msg, sizeof(msg),
5624 "tid[%d] SACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
5625 GetCurrentThreadId(), rx_ack_reason(ap->reason),
5626 ntohl(ap->serial), ntohl(ap->previousPacket),
5627 (unsigned int)p->header.seq, ntohl(ap->firstPacket),
5628 ap->nAcks, ntohs(ap->bufferSpace) );
5632 for (offset = 0; offset < ap->nAcks && len < sizeof(msg); offset++)
5633 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
5637 OutputDebugString(msg);
5639 #else /* AFS_NT40_ENV */
5641 fprintf(rx_Log, "SACK: reason %x previous %u seq %u first %u ",
5642 ap->reason, ntohl(ap->previousPacket),
5643 (unsigned int)p->header.seq, ntohl(ap->firstPacket));
5645 for (offset = 0; offset < ap->nAcks; offset++)
5646 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
5651 #endif /* AFS_NT40_ENV */
5654 int i, nbytes = p->length;
5656 for (i = 1; i < p->niovecs; i++) { /* vec 0 is ALWAYS header */
5657 if (nbytes <= p->wirevec[i].iov_len) {
5660 savelen = p->wirevec[i].iov_len;
5662 p->wirevec[i].iov_len = nbytes;
5664 rxi_Send(call, p, istack);
5665 p->wirevec[i].iov_len = savelen;
5669 nbytes -= p->wirevec[i].iov_len;
5672 if (rx_stats_active)
5673 rx_atomic_inc(&rx_stats.ackPacketsSent);
5674 #ifndef RX_ENABLE_TSFPQ
5675 if (!optionalPacket)
5678 return optionalPacket; /* Return packet for re-use by caller */
5682 struct rx_packet **list;
5687 /* Send all of the packets in the list in single datagram */
5689 rxi_SendList(struct rx_call *call, struct xmitlist *xmit,
5690 int istack, int moreFlag)
5696 struct rx_connection *conn = call->conn;
5697 struct rx_peer *peer = conn->peer;
5699 MUTEX_ENTER(&peer->peer_lock);
5700 peer->nSent += xmit->len;
5701 if (xmit->resending)
5702 peer->reSends += xmit->len;
5703 MUTEX_EXIT(&peer->peer_lock);
5705 if (rx_stats_active) {
5706 if (xmit->resending)
5707 rx_atomic_add(&rx_stats.dataPacketsReSent, xmit->len);
5709 rx_atomic_add(&rx_stats.dataPacketsSent, xmit->len);
5712 clock_GetTime(&now);
5714 if (xmit->list[xmit->len - 1]->header.flags & RX_LAST_PACKET) {
5718 /* Set the packet flags and schedule the resend events */
5719 /* Only request an ack for the last packet in the list */
5720 for (i = 0; i < xmit->len; i++) {
5721 struct rx_packet *packet = xmit->list[i];
5723 /* Record the time sent */
5724 packet->timeSent = now;
5725 packet->flags |= RX_PKTFLAG_SENT;
5727 /* Ask for an ack on retransmitted packets, on every other packet
5728 * if the peer doesn't support slow start. Ask for an ack on every
5729 * packet until the congestion window reaches the ack rate. */
5730 if (packet->header.serial) {
5733 packet->firstSent = now;
5734 if (!lastPacket && (call->cwind <= (u_short) (conn->ackRate + 1)
5735 || (!(call->flags & RX_CALL_SLOW_START_OK)
5736 && (packet->header.seq & 1)))) {
5741 /* Tag this packet as not being the last in this group,
5742 * for the receiver's benefit */
5743 if (i < xmit->len - 1 || moreFlag) {
5744 packet->header.flags |= RX_MORE_PACKETS;
5749 xmit->list[xmit->len - 1]->header.flags |= RX_REQUEST_ACK;
5752 /* Since we're about to send a data packet to the peer, it's
5753 * safe to nuke any scheduled end-of-packets ack */
5754 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
5756 MUTEX_EXIT(&call->lock);
5757 MUTEX_ENTER(&rx_refcnt_mutex);
5758 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5759 MUTEX_EXIT(&rx_refcnt_mutex);
5760 if (xmit->len > 1) {
5761 rxi_SendPacketList(call, conn, xmit->list, xmit->len, istack);
5763 rxi_SendPacket(call, conn, xmit->list[0], istack);
5765 MUTEX_ENTER(&call->lock);
5766 MUTEX_ENTER(&rx_refcnt_mutex);
5767 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5768 MUTEX_EXIT(&rx_refcnt_mutex);
5770 /* Tell the RTO calculation engine that we have sent a packet, and
5771 * if it was the last one */
5772 rxi_rto_packet_sent(call, lastPacket, istack);
5774 /* Update last send time for this call (for keep-alive
5775 * processing), and for the connection (so that we can discover
5776 * idle connections) */
5777 conn->lastSendTime = call->lastSendTime = clock_Sec();
5778 /* Let a set of retransmits trigger an idle timeout */
5779 if (!xmit->resending)
5780 call->lastSendData = call->lastSendTime;
5783 /* When sending packets we need to follow these rules:
5784 * 1. Never send more than maxDgramPackets in a jumbogram.
5785 * 2. Never send a packet with more than two iovecs in a jumbogram.
5786 * 3. Never send a retransmitted packet in a jumbogram.
5787 * 4. Never send more than cwind/4 packets in a jumbogram
5788 * We always keep the last list we should have sent so we
5789 * can set the RX_MORE_PACKETS flags correctly.
5793 rxi_SendXmitList(struct rx_call *call, struct rx_packet **list, int len,
5798 struct xmitlist working;
5799 struct xmitlist last;
5801 struct rx_peer *peer = call->conn->peer;
5802 int morePackets = 0;
5804 memset(&last, 0, sizeof(struct xmitlist));
5805 working.list = &list[0];
5807 working.resending = 0;
5809 recovery = call->flags & RX_CALL_FAST_RECOVER;
5811 for (i = 0; i < len; i++) {
5812 /* Does the current packet force us to flush the current list? */
5814 && (list[i]->header.serial || (list[i]->flags & RX_PKTFLAG_ACKED)
5815 || list[i]->length > RX_JUMBOBUFFERSIZE)) {
5817 /* This sends the 'last' list and then rolls the current working
5818 * set into the 'last' one, and resets the working set */
5821 rxi_SendList(call, &last, istack, 1);
5822 /* If the call enters an error state stop sending, or if
5823 * we entered congestion recovery mode, stop sending */
5825 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5830 working.resending = 0;
5831 working.list = &list[i];
5833 /* Add the current packet to the list if it hasn't been acked.
5834 * Otherwise adjust the list pointer to skip the current packet. */
5835 if (!(list[i]->flags & RX_PKTFLAG_ACKED)) {
5838 if (list[i]->header.serial)
5839 working.resending = 1;
5841 /* Do we need to flush the list? */
5842 if (working.len >= (int)peer->maxDgramPackets
5843 || working.len >= (int)call->nDgramPackets
5844 || working.len >= (int)call->cwind
5845 || list[i]->header.serial
5846 || list[i]->length != RX_JUMBOBUFFERSIZE) {
5848 rxi_SendList(call, &last, istack, 1);
5849 /* If the call enters an error state stop sending, or if
5850 * we entered congestion recovery mode, stop sending */
5852 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5857 working.resending = 0;
5858 working.list = &list[i + 1];
5861 if (working.len != 0) {
5862 osi_Panic("rxi_SendList error");
5864 working.list = &list[i + 1];
5868 /* Send the whole list when the call is in receive mode, when
5869 * the call is in eof mode, when we are in fast recovery mode,
5870 * and when we have the last packet */
5871 if ((list[len - 1]->header.flags & RX_LAST_PACKET)
5872 || call->mode == RX_MODE_RECEIVING || call->mode == RX_MODE_EOF
5873 || (call->flags & RX_CALL_FAST_RECOVER)) {
5874 /* Check for the case where the current list contains
5875 * an acked packet. Since we always send retransmissions
5876 * in a separate packet, we only need to check the first
5877 * packet in the list */
5878 if (working.len > 0 && !(working.list[0]->flags & RX_PKTFLAG_ACKED)) {
5882 rxi_SendList(call, &last, istack, morePackets);
5883 /* If the call enters an error state stop sending, or if
5884 * we entered congestion recovery mode, stop sending */
5886 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5890 rxi_SendList(call, &working, istack, 0);
5892 } else if (last.len > 0) {
5893 rxi_SendList(call, &last, istack, 0);
5894 /* Packets which are in 'working' are not sent by this call */
5899 rxi_Resend(struct rxevent *event, void *arg0, void *arg1, int istack)
5901 struct rx_call *call = arg0;
5902 struct rx_peer *peer;
5903 struct rx_packet *p, *nxp;
5904 struct clock maxTimeout = { 60, 0 };
5906 MUTEX_ENTER(&call->lock);
5908 peer = call->conn->peer;
5910 /* Make sure that the event pointer is removed from the call
5911 * structure, since there is no longer a per-call retransmission
5913 if (event == call->resendEvent) {
5914 MUTEX_ENTER(&rx_refcnt_mutex);
5915 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
5916 MUTEX_EXIT(&rx_refcnt_mutex);
5917 call->resendEvent = NULL;
5920 if (rxi_busyChannelError && (call->flags & RX_CALL_PEER_BUSY)) {
5921 rxi_CheckBusy(call);
5924 if (queue_IsEmpty(&call->tq)) {
5925 /* Nothing to do. This means that we've been raced, and that an
5926 * ACK has come in between when we were triggered, and when we
5927 * actually got to run. */
5931 /* We're in loss recovery */
5932 call->flags |= RX_CALL_FAST_RECOVER;
5934 /* Mark all of the pending packets in the queue as being lost */
5935 for (queue_Scan(&call->tq, p, nxp, rx_packet)) {
5936 if (!(p->flags & RX_PKTFLAG_ACKED))
5937 p->flags &= ~RX_PKTFLAG_SENT;
5940 /* We're resending, so we double the timeout of the call. This will be
5941 * dropped back down by the first successful ACK that we receive.
5943 * We apply a maximum value here of 60 seconds
5945 clock_Add(&call->rto, &call->rto);
5946 if (clock_Gt(&call->rto, &maxTimeout))
5947 call->rto = maxTimeout;
5949 /* Packet loss is most likely due to congestion, so drop our window size
5950 * and start again from the beginning */
5951 if (peer->maxDgramPackets >1) {
5952 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
5953 call->MTU = MIN(peer->natMTU, peer->maxMTU);
5955 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
5956 call->nDgramPackets = 1;
5958 call->nextCwind = 1;
5961 MUTEX_ENTER(&peer->peer_lock);
5962 peer->MTU = call->MTU;
5963 peer->cwind = call->cwind;
5964 peer->nDgramPackets = 1;
5966 call->congestSeq = peer->congestSeq;
5967 MUTEX_EXIT(&peer->peer_lock);
5969 rxi_Start(call, istack);
5972 MUTEX_EXIT(&call->lock);
5975 /* This routine is called when new packets are readied for
5976 * transmission and when retransmission may be necessary, or when the
5977 * transmission window or burst count are favourable. This should be
5978 * better optimized for new packets, the usual case, now that we've
5979 * got rid of queues of send packets. XXXXXXXXXXX */
5981 rxi_Start(struct rx_call *call, int istack)
5984 struct rx_packet *p;
5985 struct rx_packet *nxp; /* Next pointer for queue_Scan */
5990 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5991 if (rx_stats_active)
5992 rx_atomic_inc(&rx_tq_debug.rxi_start_in_error);
5997 if (queue_IsNotEmpty(&call->tq)) { /* If we have anything to send */
5999 /* Send (or resend) any packets that need it, subject to
6000 * window restrictions and congestion burst control
6001 * restrictions. Ask for an ack on the last packet sent in
6002 * this burst. For now, we're relying upon the window being
6003 * considerably bigger than the largest number of packets that
6004 * are typically sent at once by one initial call to
6005 * rxi_Start. This is probably bogus (perhaps we should ask
6006 * for an ack when we're half way through the current
6007 * window?). Also, for non file transfer applications, this
6008 * may end up asking for an ack for every packet. Bogus. XXXX
6011 * But check whether we're here recursively, and let the other guy
6014 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
6015 if (!(call->flags & RX_CALL_TQ_BUSY)) {
6016 call->flags |= RX_CALL_TQ_BUSY;
6018 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
6020 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
6021 call->flags &= ~RX_CALL_NEED_START;
6022 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
6024 maxXmitPackets = MIN(call->twind, call->cwind);
6025 for (queue_Scan(&call->tq, p, nxp, rx_packet)) {
6026 #ifdef RX_TRACK_PACKETS
6027 if ((p->flags & RX_PKTFLAG_FREE)
6028 || (!queue_IsEnd(&call->tq, nxp)
6029 && (nxp->flags & RX_PKTFLAG_FREE))
6030 || (p == (struct rx_packet *)&rx_freePacketQueue)
6031 || (nxp == (struct rx_packet *)&rx_freePacketQueue)) {
6032 osi_Panic("rxi_Start: xmit queue clobbered");
6035 if (p->flags & RX_PKTFLAG_ACKED) {
6036 /* Since we may block, don't trust this */
6037 if (rx_stats_active)
6038 rx_atomic_inc(&rx_stats.ignoreAckedPacket);
6039 continue; /* Ignore this packet if it has been acknowledged */
6042 /* Turn off all flags except these ones, which are the same
6043 * on each transmission */
6044 p->header.flags &= RX_PRESET_FLAGS;
6046 if (p->header.seq >=
6047 call->tfirst + MIN((int)call->twind,
6048 (int)(call->nSoftAcked +
6050 call->flags |= RX_CALL_WAIT_WINDOW_SEND; /* Wait for transmit window */
6051 /* Note: if we're waiting for more window space, we can
6052 * still send retransmits; hence we don't return here, but
6053 * break out to schedule a retransmit event */
6054 dpf(("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n",
6055 *(call->callNumber), p->header.seq, call->twind, call->nSoftAcked,
6060 /* Transmit the packet if it needs to be sent. */
6061 if (!(p->flags & RX_PKTFLAG_SENT)) {
6062 if (nXmitPackets == maxXmitPackets) {
6063 rxi_SendXmitList(call, call->xmitList,
6064 nXmitPackets, istack);
6067 dpf(("call %d xmit packet %"AFS_PTR_FMT"\n",
6068 *(call->callNumber), p));
6069 call->xmitList[nXmitPackets++] = p;
6073 /* xmitList now hold pointers to all of the packets that are
6074 * ready to send. Now we loop to send the packets */
6075 if (nXmitPackets > 0) {
6076 rxi_SendXmitList(call, call->xmitList, nXmitPackets,
6080 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
6082 /* We went into the error state while sending packets. Now is
6083 * the time to reset the call. This will also inform the using
6084 * process that the call is in an error state.
6086 if (rx_stats_active)
6087 rx_atomic_inc(&rx_tq_debug.rxi_start_aborted);
6088 call->flags &= ~RX_CALL_TQ_BUSY;
6089 rxi_WakeUpTransmitQueue(call);
6090 rxi_CallError(call, call->error);
6093 #ifdef RX_ENABLE_LOCKS
6094 if (call->flags & RX_CALL_TQ_SOME_ACKED) {
6096 call->flags &= ~RX_CALL_TQ_SOME_ACKED;
6097 /* Some packets have received acks. If they all have, we can clear
6098 * the transmit queue.
6101 0, queue_Scan(&call->tq, p, nxp, rx_packet)) {
6102 if (p->header.seq < call->tfirst
6103 && (p->flags & RX_PKTFLAG_ACKED)) {
6105 #ifdef RX_TRACK_PACKETS
6106 p->flags &= ~RX_PKTFLAG_TQ;
6108 #ifdef RXDEBUG_PACKET
6116 call->flags |= RX_CALL_TQ_CLEARME;
6118 #endif /* RX_ENABLE_LOCKS */
6119 if (call->flags & RX_CALL_TQ_CLEARME)
6120 rxi_ClearTransmitQueue(call, 1);
6121 } while (call->flags & RX_CALL_NEED_START);
6123 * TQ references no longer protected by this flag; they must remain
6124 * protected by the global lock.
6126 call->flags &= ~RX_CALL_TQ_BUSY;
6127 rxi_WakeUpTransmitQueue(call);
6129 call->flags |= RX_CALL_NEED_START;
6131 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
6133 rxi_rto_cancel(call);
6137 /* Also adjusts the keep alive parameters for the call, to reflect
6138 * that we have just sent a packet (so keep alives aren't sent
6141 rxi_Send(struct rx_call *call, struct rx_packet *p,
6144 struct rx_connection *conn = call->conn;
6146 /* Stamp each packet with the user supplied status */
6147 p->header.userStatus = call->localStatus;
6149 /* Allow the security object controlling this call's security to
6150 * make any last-minute changes to the packet */
6151 RXS_SendPacket(conn->securityObject, call, p);
6153 /* Since we're about to send SOME sort of packet to the peer, it's
6154 * safe to nuke any scheduled end-of-packets ack */
6155 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
6157 /* Actually send the packet, filling in more connection-specific fields */
6158 MUTEX_EXIT(&call->lock);
6159 MUTEX_ENTER(&rx_refcnt_mutex);
6160 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
6161 MUTEX_EXIT(&rx_refcnt_mutex);
6162 rxi_SendPacket(call, conn, p, istack);
6163 MUTEX_ENTER(&rx_refcnt_mutex);
6164 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
6165 MUTEX_EXIT(&rx_refcnt_mutex);
6166 MUTEX_ENTER(&call->lock);
6168 /* Update last send time for this call (for keep-alive
6169 * processing), and for the connection (so that we can discover
6170 * idle connections) */
6171 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6172 (((struct rx_ackPacket *)rx_DataOf(p))->reason == RX_ACK_PING) ||
6173 (p->length <= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32))))
6175 conn->lastSendTime = call->lastSendTime = clock_Sec();
6176 /* Don't count keepalive ping/acks here, so idleness can be tracked. */
6177 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6178 ((((struct rx_ackPacket *)rx_DataOf(p))->reason != RX_ACK_PING) &&
6179 (((struct rx_ackPacket *)rx_DataOf(p))->reason !=
6180 RX_ACK_PING_RESPONSE)))
6181 call->lastSendData = call->lastSendTime;
6185 /* Check if a call needs to be destroyed. Called by keep-alive code to ensure
6186 * that things are fine. Also called periodically to guarantee that nothing
6187 * falls through the cracks (e.g. (error + dally) connections have keepalive
6188 * turned off. Returns 0 if conn is well, -1 otherwise. If otherwise, call
6190 * haveCTLock Set if calling from rxi_ReapConnections
6192 #ifdef RX_ENABLE_LOCKS
6194 rxi_CheckCall(struct rx_call *call, int haveCTLock)
6195 #else /* RX_ENABLE_LOCKS */
6197 rxi_CheckCall(struct rx_call *call)
6198 #endif /* RX_ENABLE_LOCKS */
6200 struct rx_connection *conn = call->conn;
6202 afs_uint32 deadTime, idleDeadTime = 0, hardDeadTime = 0;
6203 afs_uint32 fudgeFactor;
6207 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
6208 if (call->flags & RX_CALL_TQ_BUSY) {
6209 /* Call is active and will be reset by rxi_Start if it's
6210 * in an error state.
6215 /* RTT + 8*MDEV, rounded up to the next second. */
6216 fudgeFactor = (((afs_uint32) call->rtt >> 3) +
6217 ((afs_uint32) call->rtt_dev << 1) + 1023) >> 10;
6219 deadTime = conn->secondsUntilDead + fudgeFactor;
6221 /* These are computed to the second (+- 1 second). But that's
6222 * good enough for these values, which should be a significant
6223 * number of seconds. */
6224 if (now > (call->lastReceiveTime + deadTime)) {
6225 if (call->state == RX_STATE_ACTIVE) {
6227 #if defined(KERNEL) && defined(AFS_SUN57_ENV)
6229 #if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
6230 netstack_t *ns = netstack_find_by_stackid(GLOBAL_NETSTACKID);
6231 ip_stack_t *ipst = ns->netstack_ip;
6233 ire = ire_cache_lookup(conn->peer->host
6234 #if defined(AFS_SUN510_ENV) && defined(ALL_ZONES)
6236 #if defined(AFS_SUN510_ENV) && (defined(ICL_3_ARG) || defined(GLOBAL_NETSTACKID))
6238 #if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
6245 if (ire && ire->ire_max_frag > 0)
6246 rxi_SetPeerMtu(NULL, conn->peer->host, 0,
6248 #if defined(GLOBAL_NETSTACKID)
6252 #endif /* ADAPT_PMTU */
6253 cerror = RX_CALL_DEAD;
6256 #ifdef RX_ENABLE_LOCKS
6257 /* Cancel pending events */
6258 rxevent_Cancel(call->delayedAckEvent, call,
6259 RX_CALL_REFCOUNT_DELAY);
6260 rxi_rto_cancel(call);
6261 rxevent_Cancel(call->keepAliveEvent, call,
6262 RX_CALL_REFCOUNT_ALIVE);
6263 if (call->growMTUEvent)
6264 rxevent_Cancel(call->growMTUEvent, call,
6265 RX_CALL_REFCOUNT_ALIVE);
6266 MUTEX_ENTER(&rx_refcnt_mutex);
6267 if (call->refCount == 0) {
6268 rxi_FreeCall(call, haveCTLock);
6269 MUTEX_EXIT(&rx_refcnt_mutex);
6272 MUTEX_EXIT(&rx_refcnt_mutex);
6274 #else /* RX_ENABLE_LOCKS */
6275 rxi_FreeCall(call, 0);
6277 #endif /* RX_ENABLE_LOCKS */
6279 /* Non-active calls are destroyed if they are not responding
6280 * to pings; active calls are simply flagged in error, so the
6281 * attached process can die reasonably gracefully. */
6284 if (conn->idleDeadTime) {
6285 idleDeadTime = conn->idleDeadTime + fudgeFactor;
6288 /* see if we have a non-activity timeout */
6289 if (call->startWait && idleDeadTime
6290 && ((call->startWait + idleDeadTime) < now) &&
6291 (call->flags & RX_CALL_READER_WAIT)) {
6292 if (call->state == RX_STATE_ACTIVE) {
6293 cerror = RX_CALL_TIMEOUT;
6297 if (call->lastSendData && idleDeadTime && (conn->idleDeadErr != 0)
6298 && ((call->lastSendData + idleDeadTime) < now)) {
6299 if (call->state == RX_STATE_ACTIVE) {
6300 cerror = conn->idleDeadErr;
6305 if (conn->hardDeadTime) {
6306 hardDeadTime = conn->hardDeadTime + fudgeFactor;
6309 /* see if we have a hard timeout */
6311 && (now > (hardDeadTime + call->startTime.sec))) {
6312 if (call->state == RX_STATE_ACTIVE)
6313 rxi_CallError(call, RX_CALL_TIMEOUT);
6318 if (conn->msgsizeRetryErr && cerror != RX_CALL_TIMEOUT
6319 && call->lastReceiveTime) {
6320 int oldMTU = conn->peer->ifMTU;
6322 /* if we thought we could send more, perhaps things got worse */
6323 if (conn->peer->maxPacketSize > conn->lastPacketSize)
6324 /* maxpacketsize will be cleared in rxi_SetPeerMtu */
6325 newmtu = MAX(conn->peer->maxPacketSize-RX_IPUDP_SIZE,
6326 conn->lastPacketSize-(128+RX_IPUDP_SIZE));
6328 newmtu = conn->lastPacketSize-(128+RX_IPUDP_SIZE);
6330 /* minimum capped in SetPeerMtu */
6331 rxi_SetPeerMtu(conn->peer, 0, 0, newmtu);
6334 conn->lastPacketSize = 0;
6336 /* needed so ResetCall doesn't clobber us. */
6337 call->MTU = conn->peer->ifMTU;
6339 /* if we never succeeded, let the error pass out as-is */
6340 if (conn->peer->maxPacketSize && oldMTU != conn->peer->ifMTU)
6341 cerror = conn->msgsizeRetryErr;
6344 rxi_CallError(call, cerror);
6349 rxi_NatKeepAliveEvent(struct rxevent *event, void *arg1, void *dummy)
6351 struct rx_connection *conn = arg1;
6352 struct rx_header theader;
6353 char tbuffer[1 + sizeof(struct rx_header)];
6354 struct sockaddr_in taddr;
6357 struct iovec tmpiov[2];
6360 RX_CLIENT_CONNECTION ? rx_socket : conn->service->socket);
6363 tp = &tbuffer[sizeof(struct rx_header)];
6364 taddr.sin_family = AF_INET;
6365 taddr.sin_port = rx_PortOf(rx_PeerOf(conn));
6366 taddr.sin_addr.s_addr = rx_HostOf(rx_PeerOf(conn));
6367 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
6368 taddr.sin_len = sizeof(struct sockaddr_in);
6370 memset(&theader, 0, sizeof(theader));
6371 theader.epoch = htonl(999);
6373 theader.callNumber = 0;
6376 theader.type = RX_PACKET_TYPE_VERSION;
6377 theader.flags = RX_LAST_PACKET;
6378 theader.serviceId = 0;
6380 memcpy(tbuffer, &theader, sizeof(theader));
6381 memcpy(tp, &a, sizeof(a));
6382 tmpiov[0].iov_base = tbuffer;
6383 tmpiov[0].iov_len = 1 + sizeof(struct rx_header);
6385 osi_NetSend(socket, &taddr, tmpiov, 1, 1 + sizeof(struct rx_header), 1);
6387 MUTEX_ENTER(&conn->conn_data_lock);
6388 MUTEX_ENTER(&rx_refcnt_mutex);
6389 /* Only reschedule ourselves if the connection would not be destroyed */
6390 if (conn->refCount <= 1) {
6391 conn->natKeepAliveEvent = NULL;
6392 MUTEX_EXIT(&rx_refcnt_mutex);
6393 MUTEX_EXIT(&conn->conn_data_lock);
6394 rx_DestroyConnection(conn); /* drop the reference for this */
6396 conn->refCount--; /* drop the reference for this */
6397 MUTEX_EXIT(&rx_refcnt_mutex);
6398 conn->natKeepAliveEvent = NULL;
6399 rxi_ScheduleNatKeepAliveEvent(conn);
6400 MUTEX_EXIT(&conn->conn_data_lock);
6405 rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn)
6407 if (!conn->natKeepAliveEvent && conn->secondsUntilNatPing) {
6408 struct clock when, now;
6409 clock_GetTime(&now);
6411 when.sec += conn->secondsUntilNatPing;
6412 MUTEX_ENTER(&rx_refcnt_mutex);
6413 conn->refCount++; /* hold a reference for this */
6414 MUTEX_EXIT(&rx_refcnt_mutex);
6415 conn->natKeepAliveEvent =
6416 rxevent_PostNow(&when, &now, rxi_NatKeepAliveEvent, conn, 0);
6421 rx_SetConnSecondsUntilNatPing(struct rx_connection *conn, afs_int32 seconds)
6423 MUTEX_ENTER(&conn->conn_data_lock);
6424 conn->secondsUntilNatPing = seconds;
6426 rxi_ScheduleNatKeepAliveEvent(conn);
6427 MUTEX_EXIT(&conn->conn_data_lock);
6431 rxi_NatKeepAliveOn(struct rx_connection *conn)
6433 MUTEX_ENTER(&conn->conn_data_lock);
6434 rxi_ScheduleNatKeepAliveEvent(conn);
6435 MUTEX_EXIT(&conn->conn_data_lock);
6438 /* When a call is in progress, this routine is called occasionally to
6439 * make sure that some traffic has arrived (or been sent to) the peer.
6440 * If nothing has arrived in a reasonable amount of time, the call is
6441 * declared dead; if nothing has been sent for a while, we send a
6442 * keep-alive packet (if we're actually trying to keep the call alive)
6445 rxi_KeepAliveEvent(struct rxevent *event, void *arg1, void *dummy)
6447 struct rx_call *call = arg1;
6448 struct rx_connection *conn;
6451 MUTEX_ENTER(&rx_refcnt_mutex);
6452 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6453 MUTEX_EXIT(&rx_refcnt_mutex);
6454 MUTEX_ENTER(&call->lock);
6455 if (event == call->keepAliveEvent)
6456 call->keepAliveEvent = NULL;
6459 #ifdef RX_ENABLE_LOCKS
6460 if (rxi_CheckCall(call, 0)) {
6461 MUTEX_EXIT(&call->lock);
6464 #else /* RX_ENABLE_LOCKS */
6465 if (rxi_CheckCall(call))
6467 #endif /* RX_ENABLE_LOCKS */
6469 /* Don't try to keep alive dallying calls */
6470 if (call->state == RX_STATE_DALLY) {
6471 MUTEX_EXIT(&call->lock);
6476 if ((now - call->lastSendTime) > conn->secondsUntilPing) {
6477 /* Don't try to send keepalives if there is unacknowledged data */
6478 /* the rexmit code should be good enough, this little hack
6479 * doesn't quite work XXX */
6480 (void)rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
6482 rxi_ScheduleKeepAliveEvent(call);
6483 MUTEX_EXIT(&call->lock);
6486 /* Does what's on the nameplate. */
6488 rxi_GrowMTUEvent(struct rxevent *event, void *arg1, void *dummy)
6490 struct rx_call *call = arg1;
6491 struct rx_connection *conn;
6493 MUTEX_ENTER(&rx_refcnt_mutex);
6494 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6495 MUTEX_EXIT(&rx_refcnt_mutex);
6496 MUTEX_ENTER(&call->lock);
6498 if (event == call->growMTUEvent)
6499 call->growMTUEvent = NULL;
6501 #ifdef RX_ENABLE_LOCKS
6502 if (rxi_CheckCall(call, 0)) {
6503 MUTEX_EXIT(&call->lock);
6506 #else /* RX_ENABLE_LOCKS */
6507 if (rxi_CheckCall(call))
6509 #endif /* RX_ENABLE_LOCKS */
6511 /* Don't bother with dallying calls */
6512 if (call->state == RX_STATE_DALLY) {
6513 MUTEX_EXIT(&call->lock);
6520 * keep being scheduled, just don't do anything if we're at peak,
6521 * or we're not set up to be properly handled (idle timeout required)
6523 if ((conn->peer->maxPacketSize != 0) &&
6524 (conn->peer->natMTU < RX_MAX_PACKET_SIZE) &&
6525 (conn->idleDeadErr))
6526 (void)rxi_SendAck(call, NULL, 0, RX_ACK_MTU, 0);
6527 rxi_ScheduleGrowMTUEvent(call, 0);
6528 MUTEX_EXIT(&call->lock);
6532 rxi_ScheduleKeepAliveEvent(struct rx_call *call)
6534 if (!call->keepAliveEvent) {
6535 struct clock when, now;
6536 clock_GetTime(&now);
6538 when.sec += call->conn->secondsUntilPing;
6539 MUTEX_ENTER(&rx_refcnt_mutex);
6540 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6541 MUTEX_EXIT(&rx_refcnt_mutex);
6542 call->keepAliveEvent =
6543 rxevent_PostNow(&when, &now, rxi_KeepAliveEvent, call, 0);
6548 rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs)
6550 if (!call->growMTUEvent) {
6551 struct clock when, now;
6553 clock_GetTime(&now);
6556 if (call->conn->secondsUntilPing)
6557 secs = (6*call->conn->secondsUntilPing)-1;
6559 if (call->conn->secondsUntilDead)
6560 secs = MIN(secs, (call->conn->secondsUntilDead-1));
6564 MUTEX_ENTER(&rx_refcnt_mutex);
6565 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6566 MUTEX_EXIT(&rx_refcnt_mutex);
6567 call->growMTUEvent =
6568 rxevent_PostNow(&when, &now, rxi_GrowMTUEvent, call, 0);
6572 /* N.B. rxi_KeepAliveOff: is defined earlier as a macro */
6574 rxi_KeepAliveOn(struct rx_call *call)
6576 /* Pretend last packet received was received now--i.e. if another
6577 * packet isn't received within the keep alive time, then the call
6578 * will die; Initialize last send time to the current time--even
6579 * if a packet hasn't been sent yet. This will guarantee that a
6580 * keep-alive is sent within the ping time */
6581 call->lastReceiveTime = call->lastSendTime = clock_Sec();
6582 rxi_ScheduleKeepAliveEvent(call);
6586 rxi_GrowMTUOn(struct rx_call *call)
6588 struct rx_connection *conn = call->conn;
6589 MUTEX_ENTER(&conn->conn_data_lock);
6590 conn->lastPingSizeSer = conn->lastPingSize = 0;
6591 MUTEX_EXIT(&conn->conn_data_lock);
6592 rxi_ScheduleGrowMTUEvent(call, 1);
6595 /* This routine is called to send connection abort messages
6596 * that have been delayed to throttle looping clients. */
6598 rxi_SendDelayedConnAbort(struct rxevent *event,
6599 void *arg1, void *unused)
6601 struct rx_connection *conn = arg1;
6604 struct rx_packet *packet;
6606 MUTEX_ENTER(&conn->conn_data_lock);
6607 conn->delayedAbortEvent = NULL;
6608 error = htonl(conn->error);
6610 MUTEX_EXIT(&conn->conn_data_lock);
6611 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6614 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6615 RX_PACKET_TYPE_ABORT, (char *)&error,
6617 rxi_FreePacket(packet);
6621 /* This routine is called to send call abort messages
6622 * that have been delayed to throttle looping clients. */
6624 rxi_SendDelayedCallAbort(struct rxevent *event,
6625 void *arg1, void *dummy)
6627 struct rx_call *call = arg1;
6630 struct rx_packet *packet;
6632 MUTEX_ENTER(&call->lock);
6633 call->delayedAbortEvent = NULL;
6634 error = htonl(call->error);
6636 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6639 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
6640 (char *)&error, sizeof(error), 0);
6641 rxi_FreePacket(packet);
6643 MUTEX_EXIT(&call->lock);
6644 MUTEX_ENTER(&rx_refcnt_mutex);
6645 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
6646 MUTEX_EXIT(&rx_refcnt_mutex);
6649 /* This routine is called periodically (every RX_AUTH_REQUEST_TIMEOUT
6650 * seconds) to ask the client to authenticate itself. The routine
6651 * issues a challenge to the client, which is obtained from the
6652 * security object associated with the connection */
6654 rxi_ChallengeEvent(struct rxevent *event,
6655 void *arg0, void *arg1, int tries)
6657 struct rx_connection *conn = arg0;
6659 conn->challengeEvent = NULL;
6660 if (RXS_CheckAuthentication(conn->securityObject, conn) != 0) {
6661 struct rx_packet *packet;
6662 struct clock when, now;
6665 /* We've failed to authenticate for too long.
6666 * Reset any calls waiting for authentication;
6667 * they are all in RX_STATE_PRECALL.
6671 MUTEX_ENTER(&conn->conn_call_lock);
6672 for (i = 0; i < RX_MAXCALLS; i++) {
6673 struct rx_call *call = conn->call[i];
6675 MUTEX_ENTER(&call->lock);
6676 if (call->state == RX_STATE_PRECALL) {
6677 rxi_CallError(call, RX_CALL_DEAD);
6678 rxi_SendCallAbort(call, NULL, 0, 0);
6680 MUTEX_EXIT(&call->lock);
6683 MUTEX_EXIT(&conn->conn_call_lock);
6687 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6689 /* If there's no packet available, do this later. */
6690 RXS_GetChallenge(conn->securityObject, conn, packet);
6691 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6692 RX_PACKET_TYPE_CHALLENGE, NULL, -1, 0);
6693 rxi_FreePacket(packet);
6695 clock_GetTime(&now);
6697 when.sec += RX_CHALLENGE_TIMEOUT;
6698 conn->challengeEvent =
6699 rxevent_PostNow2(&when, &now, rxi_ChallengeEvent, conn, 0,
6704 /* Call this routine to start requesting the client to authenticate
6705 * itself. This will continue until authentication is established,
6706 * the call times out, or an invalid response is returned. The
6707 * security object associated with the connection is asked to create
6708 * the challenge at this time. N.B. rxi_ChallengeOff is a macro,
6709 * defined earlier. */
6711 rxi_ChallengeOn(struct rx_connection *conn)
6713 if (!conn->challengeEvent) {
6714 RXS_CreateChallenge(conn->securityObject, conn);
6715 rxi_ChallengeEvent(NULL, conn, 0, RX_CHALLENGE_MAXTRIES);
6720 /* rxi_ComputeRoundTripTime is called with peer locked. */
6721 /* peer may be null */
6723 rxi_ComputeRoundTripTime(struct rx_packet *p,
6724 struct rx_ackPacket *ack,
6725 struct rx_call *call,
6726 struct rx_peer *peer,
6729 struct clock thisRtt, *sentp;
6733 /* If the ACK is delayed, then do nothing */
6734 if (ack->reason == RX_ACK_DELAY)
6737 /* On the wire, jumbograms are a single UDP packet. We shouldn't count
6738 * their RTT multiple times, so only include the RTT of the last packet
6740 if (p->flags & RX_JUMBO_PACKET)
6743 /* Use the serial number to determine which transmission the ACK is for,
6744 * and set the sent time to match this. If we have no serial number, then
6745 * only use the ACK for RTT calculations if the packet has not been
6749 serial = ntohl(ack->serial);
6751 if (serial == p->header.serial) {
6752 sentp = &p->timeSent;
6753 } else if (serial == p->firstSerial) {
6754 sentp = &p->firstSent;
6755 } else if (clock_Eq(&p->timeSent, &p->firstSent)) {
6756 sentp = &p->firstSent;
6760 if (clock_Eq(&p->timeSent, &p->firstSent)) {
6761 sentp = &p->firstSent;
6768 if (clock_Lt(&thisRtt, sentp))
6769 return; /* somebody set the clock back, don't count this time. */
6771 clock_Sub(&thisRtt, sentp);
6772 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rttp=%d.%06d sec)\n",
6773 p->header.callNumber, p, thisRtt.sec, thisRtt.usec));
6775 if (clock_IsZero(&thisRtt)) {
6777 * The actual round trip time is shorter than the
6778 * clock_GetTime resolution. It is most likely 1ms or 100ns.
6779 * Since we can't tell which at the moment we will assume 1ms.
6781 thisRtt.usec = 1000;
6784 if (rx_stats_active) {
6785 MUTEX_ENTER(&rx_stats_mutex);
6786 if (clock_Lt(&thisRtt, &rx_stats.minRtt))
6787 rx_stats.minRtt = thisRtt;
6788 if (clock_Gt(&thisRtt, &rx_stats.maxRtt)) {
6789 if (thisRtt.sec > 60) {
6790 MUTEX_EXIT(&rx_stats_mutex);
6791 return; /* somebody set the clock ahead */
6793 rx_stats.maxRtt = thisRtt;
6795 clock_Add(&rx_stats.totalRtt, &thisRtt);
6796 rx_atomic_inc(&rx_stats.nRttSamples);
6797 MUTEX_EXIT(&rx_stats_mutex);
6800 /* better rtt calculation courtesy of UMich crew (dave,larry,peter,?) */
6802 /* Apply VanJacobson round-trip estimations */
6807 * srtt (call->rtt) is in units of one-eighth-milliseconds.
6808 * srtt is stored as fixed point with 3 bits after the binary
6809 * point (i.e., scaled by 8). The following magic is
6810 * equivalent to the smoothing algorithm in rfc793 with an
6811 * alpha of .875 (srtt' = rtt/8 + srtt*7/8 in fixed point).
6812 * srtt'*8 = rtt + srtt*7
6813 * srtt'*8 = srtt*8 + rtt - srtt
6814 * srtt' = srtt + rtt/8 - srtt/8
6815 * srtt' = srtt + (rtt - srtt)/8
6818 delta = _8THMSEC(&thisRtt) - call->rtt;
6819 call->rtt += (delta >> 3);
6822 * We accumulate a smoothed rtt variance (actually, a smoothed
6823 * mean difference), then set the retransmit timer to smoothed
6824 * rtt + 4 times the smoothed variance (was 2x in van's original
6825 * paper, but 4x works better for me, and apparently for him as
6827 * rttvar is stored as
6828 * fixed point with 2 bits after the binary point (scaled by
6829 * 4). The following is equivalent to rfc793 smoothing with
6830 * an alpha of .75 (rttvar' = rttvar*3/4 + |delta| / 4).
6831 * rttvar'*4 = rttvar*3 + |delta|
6832 * rttvar'*4 = rttvar*4 + |delta| - rttvar
6833 * rttvar' = rttvar + |delta|/4 - rttvar/4
6834 * rttvar' = rttvar + (|delta| - rttvar)/4
6835 * This replaces rfc793's wired-in beta.
6836 * dev*4 = dev*4 + (|actual - expected| - dev)
6842 delta -= (call->rtt_dev << 1);
6843 call->rtt_dev += (delta >> 3);
6845 /* I don't have a stored RTT so I start with this value. Since I'm
6846 * probably just starting a call, and will be pushing more data down
6847 * this, I expect congestion to increase rapidly. So I fudge a
6848 * little, and I set deviance to half the rtt. In practice,
6849 * deviance tends to approach something a little less than
6850 * half the smoothed rtt. */
6851 call->rtt = _8THMSEC(&thisRtt) + 8;
6852 call->rtt_dev = call->rtt >> 2; /* rtt/2: they're scaled differently */
6854 /* the smoothed RTT time is RTT + 4*MDEV
6856 * We allow a user specified minimum to be set for this, to allow clamping
6857 * at a minimum value in the same way as TCP. In addition, we have to allow
6858 * for the possibility that this packet is answered by a delayed ACK, so we
6859 * add on a fixed 200ms to account for that timer expiring.
6862 rtt_timeout = MAX(((call->rtt >> 3) + call->rtt_dev),
6863 rx_minPeerTimeout) + 200;
6864 clock_Zero(&call->rto);
6865 clock_Addmsec(&call->rto, rtt_timeout);
6867 /* Update the peer, so any new calls start with our values */
6868 peer->rtt_dev = call->rtt_dev;
6869 peer->rtt = call->rtt;
6871 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n",
6872 p->header.callNumber, p, MSEC(&thisRtt), call->rtt >> 3, call->rtt_dev >> 2, (call->rto.sec), (call->rto.usec)));
6876 /* Find all server connections that have not been active for a long time, and
6879 rxi_ReapConnections(struct rxevent *unused, void *unused1, void *unused2)
6881 struct clock now, when;
6882 clock_GetTime(&now);
6884 /* Find server connection structures that haven't been used for
6885 * greater than rx_idleConnectionTime */
6887 struct rx_connection **conn_ptr, **conn_end;
6888 int i, havecalls = 0;
6889 MUTEX_ENTER(&rx_connHashTable_lock);
6890 for (conn_ptr = &rx_connHashTable[0], conn_end =
6891 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
6893 struct rx_connection *conn, *next;
6894 struct rx_call *call;
6898 for (conn = *conn_ptr; conn; conn = next) {
6899 /* XXX -- Shouldn't the connection be locked? */
6902 for (i = 0; i < RX_MAXCALLS; i++) {
6903 call = conn->call[i];
6907 code = MUTEX_TRYENTER(&call->lock);
6910 #ifdef RX_ENABLE_LOCKS
6911 result = rxi_CheckCall(call, 1);
6912 #else /* RX_ENABLE_LOCKS */
6913 result = rxi_CheckCall(call);
6914 #endif /* RX_ENABLE_LOCKS */
6915 MUTEX_EXIT(&call->lock);
6917 /* If CheckCall freed the call, it might
6918 * have destroyed the connection as well,
6919 * which screws up the linked lists.
6925 if (conn->type == RX_SERVER_CONNECTION) {
6926 /* This only actually destroys the connection if
6927 * there are no outstanding calls */
6928 MUTEX_ENTER(&conn->conn_data_lock);
6929 MUTEX_ENTER(&rx_refcnt_mutex);
6930 if (!havecalls && !conn->refCount
6931 && ((conn->lastSendTime + rx_idleConnectionTime) <
6933 conn->refCount++; /* it will be decr in rx_DestroyConn */
6934 MUTEX_EXIT(&rx_refcnt_mutex);
6935 MUTEX_EXIT(&conn->conn_data_lock);
6936 #ifdef RX_ENABLE_LOCKS
6937 rxi_DestroyConnectionNoLock(conn);
6938 #else /* RX_ENABLE_LOCKS */
6939 rxi_DestroyConnection(conn);
6940 #endif /* RX_ENABLE_LOCKS */
6942 #ifdef RX_ENABLE_LOCKS
6944 MUTEX_EXIT(&rx_refcnt_mutex);
6945 MUTEX_EXIT(&conn->conn_data_lock);
6947 #endif /* RX_ENABLE_LOCKS */
6951 #ifdef RX_ENABLE_LOCKS
6952 while (rx_connCleanup_list) {
6953 struct rx_connection *conn;
6954 conn = rx_connCleanup_list;
6955 rx_connCleanup_list = rx_connCleanup_list->next;
6956 MUTEX_EXIT(&rx_connHashTable_lock);
6957 rxi_CleanupConnection(conn);
6958 MUTEX_ENTER(&rx_connHashTable_lock);
6960 MUTEX_EXIT(&rx_connHashTable_lock);
6961 #endif /* RX_ENABLE_LOCKS */
6964 /* Find any peer structures that haven't been used (haven't had an
6965 * associated connection) for greater than rx_idlePeerTime */
6967 struct rx_peer **peer_ptr, **peer_end;
6971 * Why do we need to hold the rx_peerHashTable_lock across
6972 * the incrementing of peer_ptr since the rx_peerHashTable
6973 * array is not changing? We don't.
6975 * By dropping the lock periodically we can permit other
6976 * activities to be performed while a rxi_ReapConnections
6977 * call is in progress. The goal of reap connections
6978 * is to clean up quickly without causing large amounts
6979 * of contention. Therefore, it is important that global
6980 * mutexes not be held for extended periods of time.
6982 for (peer_ptr = &rx_peerHashTable[0], peer_end =
6983 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
6985 struct rx_peer *peer, *next, *prev;
6987 MUTEX_ENTER(&rx_peerHashTable_lock);
6988 for (prev = peer = *peer_ptr; peer; peer = next) {
6990 code = MUTEX_TRYENTER(&peer->peer_lock);
6991 if ((code) && (peer->refCount == 0)
6992 && ((peer->idleWhen + rx_idlePeerTime) < now.sec)) {
6993 rx_interface_stat_p rpc_stat, nrpc_stat;
6997 * now know that this peer object is one to be
6998 * removed from the hash table. Once it is removed
6999 * it can't be referenced by other threads.
7000 * Lets remove it first and decrement the struct
7001 * nPeerStructs count.
7003 if (peer == *peer_ptr) {
7009 if (rx_stats_active)
7010 rx_atomic_dec(&rx_stats.nPeerStructs);
7013 * Now if we hold references on 'prev' and 'next'
7014 * we can safely drop the rx_peerHashTable_lock
7015 * while we destroy this 'peer' object.
7021 MUTEX_EXIT(&rx_peerHashTable_lock);
7023 MUTEX_EXIT(&peer->peer_lock);
7024 MUTEX_DESTROY(&peer->peer_lock);
7026 (&peer->rpcStats, rpc_stat, nrpc_stat,
7027 rx_interface_stat)) {
7028 unsigned int num_funcs;
7031 queue_Remove(&rpc_stat->queue_header);
7032 queue_Remove(&rpc_stat->all_peers);
7033 num_funcs = rpc_stat->stats[0].func_total;
7035 sizeof(rx_interface_stat_t) +
7036 rpc_stat->stats[0].func_total *
7037 sizeof(rx_function_entry_v1_t);
7039 rxi_Free(rpc_stat, space);
7041 MUTEX_ENTER(&rx_rpc_stats);
7042 rxi_rpc_peer_stat_cnt -= num_funcs;
7043 MUTEX_EXIT(&rx_rpc_stats);
7048 * Regain the rx_peerHashTable_lock and
7049 * decrement the reference count on 'prev'
7052 MUTEX_ENTER(&rx_peerHashTable_lock);
7059 MUTEX_EXIT(&peer->peer_lock);
7064 MUTEX_EXIT(&rx_peerHashTable_lock);
7068 /* THIS HACK IS A TEMPORARY HACK. The idea is that the race condition in
7069 * rxi_AllocSendPacket, if it hits, will be handled at the next conn
7070 * GC, just below. Really, we shouldn't have to keep moving packets from
7071 * one place to another, but instead ought to always know if we can
7072 * afford to hold onto a packet in its particular use. */
7073 MUTEX_ENTER(&rx_freePktQ_lock);
7074 if (rx_waitingForPackets) {
7075 rx_waitingForPackets = 0;
7076 #ifdef RX_ENABLE_LOCKS
7077 CV_BROADCAST(&rx_waitingForPackets_cv);
7079 osi_rxWakeup(&rx_waitingForPackets);
7082 MUTEX_EXIT(&rx_freePktQ_lock);
7085 when.sec += RX_REAP_TIME; /* Check every RX_REAP_TIME seconds */
7086 rxevent_Post(&when, rxi_ReapConnections, 0, 0);
7090 /* rxs_Release - This isn't strictly necessary but, since the macro name from
7091 * rx.h is sort of strange this is better. This is called with a security
7092 * object before it is discarded. Each connection using a security object has
7093 * its own refcount to the object so it won't actually be freed until the last
7094 * connection is destroyed.
7096 * This is the only rxs module call. A hold could also be written but no one
7100 rxs_Release(struct rx_securityClass *aobj)
7102 return RXS_Close(aobj);
7106 #define RXRATE_PKT_OH (RX_HEADER_SIZE + RX_IPUDP_SIZE)
7107 #define RXRATE_SMALL_PKT (RXRATE_PKT_OH + sizeof(struct rx_ackPacket))
7108 #define RXRATE_AVG_SMALL_PKT (RXRATE_PKT_OH + (sizeof(struct rx_ackPacket)/2))
7109 #define RXRATE_LARGE_PKT (RXRATE_SMALL_PKT + 256)
7111 /* Adjust our estimate of the transmission rate to this peer, given
7112 * that the packet p was just acked. We can adjust peer->timeout and
7113 * call->twind. Pragmatically, this is called
7114 * only with packets of maximal length.
7115 * Called with peer and call locked.
7119 rxi_ComputeRate(struct rx_peer *peer, struct rx_call *call,
7120 struct rx_packet *p, struct rx_packet *ackp, u_char ackReason)
7122 afs_int32 xferSize, xferMs;
7126 /* Count down packets */
7127 if (peer->rateFlag > 0)
7129 /* Do nothing until we're enabled */
7130 if (peer->rateFlag != 0)
7135 /* Count only when the ack seems legitimate */
7136 switch (ackReason) {
7137 case RX_ACK_REQUESTED:
7139 p->length + RX_HEADER_SIZE + call->conn->securityMaxTrailerSize;
7143 case RX_ACK_PING_RESPONSE:
7144 if (p) /* want the response to ping-request, not data send */
7146 clock_GetTime(&newTO);
7147 if (clock_Gt(&newTO, &call->pingRequestTime)) {
7148 clock_Sub(&newTO, &call->pingRequestTime);
7149 xferMs = (newTO.sec * 1000) + (newTO.usec / 1000);
7153 xferSize = rx_AckDataSize(rx_maxSendWindow) + RX_HEADER_SIZE;
7160 dpf(("CONG peer %lx/%u: sample (%s) size %ld, %ld ms (to %d.%06d, rtt %u, ps %u)\n",
7161 ntohl(peer->host), ntohs(peer->port), (ackReason == RX_ACK_REQUESTED ? "dataack" : "pingack"),
7162 xferSize, xferMs, peer->timeout.sec, peer->timeout.usec, peer->smRtt, peer->ifMTU));
7164 /* Track only packets that are big enough. */
7165 if ((p->length + RX_HEADER_SIZE + call->conn->securityMaxTrailerSize) <
7169 /* absorb RTT data (in milliseconds) for these big packets */
7170 if (peer->smRtt == 0) {
7171 peer->smRtt = xferMs;
7173 peer->smRtt = ((peer->smRtt * 15) + xferMs + 4) >> 4;
7178 if (peer->countDown) {
7182 peer->countDown = 10; /* recalculate only every so often */
7184 /* In practice, we can measure only the RTT for full packets,
7185 * because of the way Rx acks the data that it receives. (If it's
7186 * smaller than a full packet, it often gets implicitly acked
7187 * either by the call response (from a server) or by the next call
7188 * (from a client), and either case confuses transmission times
7189 * with processing times.) Therefore, replace the above
7190 * more-sophisticated processing with a simpler version, where the
7191 * smoothed RTT is kept for full-size packets, and the time to
7192 * transmit a windowful of full-size packets is simply RTT *
7193 * windowSize. Again, we take two steps:
7194 - ensure the timeout is large enough for a single packet's RTT;
7195 - ensure that the window is small enough to fit in the desired timeout.*/
7197 /* First, the timeout check. */
7198 minTime = peer->smRtt;
7199 /* Get a reasonable estimate for a timeout period */
7201 newTO.sec = minTime / 1000;
7202 newTO.usec = (minTime - (newTO.sec * 1000)) * 1000;
7204 /* Increase the timeout period so that we can always do at least
7205 * one packet exchange */
7206 if (clock_Gt(&newTO, &peer->timeout)) {
7208 dpf(("CONG peer %lx/%u: timeout %d.%06d ==> %ld.%06d (rtt %u)\n",
7209 ntohl(peer->host), ntohs(peer->port), peer->timeout.sec, peer->timeout.usec,
7210 newTO.sec, newTO.usec, peer->smRtt));
7212 peer->timeout = newTO;
7215 /* Now, get an estimate for the transmit window size. */
7216 minTime = peer->timeout.sec * 1000 + (peer->timeout.usec / 1000);
7217 /* Now, convert to the number of full packets that could fit in a
7218 * reasonable fraction of that interval */
7219 minTime /= (peer->smRtt << 1);
7220 minTime = MAX(minTime, rx_minPeerTimeout);
7221 xferSize = minTime; /* (make a copy) */
7223 /* Now clamp the size to reasonable bounds. */
7226 else if (minTime > rx_maxSendWindow)
7227 minTime = rx_maxSendWindow;
7228 /* if (minTime != peer->maxWindow) {
7229 dpf(("CONG peer %lx/%u: windowsize %lu ==> %lu (to %lu.%06lu, rtt %u)\n",
7230 ntohl(peer->host), ntohs(peer->port), peer->maxWindow, minTime,
7231 peer->timeout.sec, peer->timeout.usec, peer->smRtt));
7232 peer->maxWindow = minTime;
7233 elide... call->twind = minTime;
7237 /* Cut back on the peer timeout if it had earlier grown unreasonably.
7238 * Discern this by calculating the timeout necessary for rx_Window
7240 if ((xferSize > rx_maxSendWindow) && (peer->timeout.sec >= 3)) {
7241 /* calculate estimate for transmission interval in milliseconds */
7242 minTime = rx_maxSendWindow * peer->smRtt;
7243 if (minTime < 1000) {
7244 dpf(("CONG peer %lx/%u: cut TO %d.%06d by 0.5 (rtt %u)\n",
7245 ntohl(peer->host), ntohs(peer->port), peer->timeout.sec,
7246 peer->timeout.usec, peer->smRtt));
7248 newTO.sec = 0; /* cut back on timeout by half a second */
7249 newTO.usec = 500000;
7250 clock_Sub(&peer->timeout, &newTO);
7255 } /* end of rxi_ComputeRate */
7256 #endif /* ADAPT_WINDOW */
7264 #define TRACE_OPTION_RX_DEBUG 16
7272 code = RegOpenKeyEx(HKEY_LOCAL_MACHINE, AFSREG_CLT_SVC_PARAM_SUBKEY,
7273 0, KEY_QUERY_VALUE, &parmKey);
7274 if (code != ERROR_SUCCESS)
7277 dummyLen = sizeof(TraceOption);
7278 code = RegQueryValueEx(parmKey, "TraceOption", NULL, NULL,
7279 (BYTE *) &TraceOption, &dummyLen);
7280 if (code == ERROR_SUCCESS) {
7281 rxdebug_active = (TraceOption & TRACE_OPTION_RX_DEBUG) ? 1 : 0;
7283 RegCloseKey (parmKey);
7284 #endif /* AFS_NT40_ENV */
7289 rx_DebugOnOff(int on)
7293 rxdebug_active = on;
7299 rx_StatsOnOff(int on)
7301 rx_stats_active = on;
7305 /* Don't call this debugging routine directly; use dpf */
7307 rxi_DebugPrint(char *format, ...)
7316 va_start(ap, format);
7318 len = _snprintf(tformat, sizeof(tformat), "tid[%d] %s", GetCurrentThreadId(), format);
7321 len = _vsnprintf(msg, sizeof(msg)-2, tformat, ap);
7323 OutputDebugString(msg);
7329 va_start(ap, format);
7331 clock_GetTime(&now);
7332 fprintf(rx_Log, " %d.%06d:", (unsigned int)now.sec,
7333 (unsigned int)now.usec);
7334 vfprintf(rx_Log, format, ap);
7342 * This function is used to process the rx_stats structure that is local
7343 * to a process as well as an rx_stats structure received from a remote
7344 * process (via rxdebug). Therefore, it needs to do minimal version
7348 rx_PrintTheseStats(FILE * file, struct rx_statistics *s, int size,
7349 afs_int32 freePackets, char version)
7353 if (size != sizeof(struct rx_statistics)) {
7355 "Unexpected size of stats structure: was %d, expected %" AFS_SIZET_FMT "\n",
7356 size, sizeof(struct rx_statistics));
7359 fprintf(file, "rx stats: free packets %d, allocs %d, ", (int)freePackets,
7362 if (version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7363 fprintf(file, "alloc-failures(rcv %u/%u,send %u/%u,ack %u)\n",
7364 s->receivePktAllocFailures, s->receiveCbufPktAllocFailures,
7365 s->sendPktAllocFailures, s->sendCbufPktAllocFailures,
7366 s->specialPktAllocFailures);
7368 fprintf(file, "alloc-failures(rcv %u,send %u,ack %u)\n",
7369 s->receivePktAllocFailures, s->sendPktAllocFailures,
7370 s->specialPktAllocFailures);
7374 " greedy %u, " "bogusReads %u (last from host %x), "
7375 "noPackets %u, " "noBuffers %u, " "selects %u, "
7376 "sendSelects %u\n", s->socketGreedy, s->bogusPacketOnRead,
7377 s->bogusHost, s->noPacketOnRead, s->noPacketBuffersOnRead,
7378 s->selects, s->sendSelects);
7380 fprintf(file, " packets read: ");
7381 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7382 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsRead[i]);
7384 fprintf(file, "\n");
7387 " other read counters: data %u, " "ack %u, " "dup %u "
7388 "spurious %u " "dally %u\n", s->dataPacketsRead,
7389 s->ackPacketsRead, s->dupPacketsRead, s->spuriousPacketsRead,
7390 s->ignorePacketDally);
7392 fprintf(file, " packets sent: ");
7393 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7394 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsSent[i]);
7396 fprintf(file, "\n");
7399 " other send counters: ack %u, " "data %u (not resends), "
7400 "resends %u, " "pushed %u, " "acked&ignored %u\n",
7401 s->ackPacketsSent, s->dataPacketsSent, s->dataPacketsReSent,
7402 s->dataPacketsPushed, s->ignoreAckedPacket);
7405 " \t(these should be small) sendFailed %u, " "fatalErrors %u\n",
7406 s->netSendFailures, (int)s->fatalErrors);
7408 if (s->nRttSamples) {
7409 fprintf(file, " Average rtt is %0.3f, with %d samples\n",
7410 clock_Float(&s->totalRtt) / s->nRttSamples, s->nRttSamples);
7412 fprintf(file, " Minimum rtt is %0.3f, maximum is %0.3f\n",
7413 clock_Float(&s->minRtt), clock_Float(&s->maxRtt));
7417 " %d server connections, " "%d client connections, "
7418 "%d peer structs, " "%d call structs, " "%d free call structs\n",
7419 s->nServerConns, s->nClientConns, s->nPeerStructs,
7420 s->nCallStructs, s->nFreeCallStructs);
7422 #if !defined(AFS_PTHREAD_ENV) && !defined(AFS_USE_GETTIMEOFDAY)
7423 fprintf(file, " %d clock updates\n", clock_nUpdates);
7427 /* for backward compatibility */
7429 rx_PrintStats(FILE * file)
7431 MUTEX_ENTER(&rx_stats_mutex);
7432 rx_PrintTheseStats(file, (struct rx_statistics *) &rx_stats,
7433 sizeof(rx_stats), rx_nFreePackets,
7435 MUTEX_EXIT(&rx_stats_mutex);
7439 rx_PrintPeerStats(FILE * file, struct rx_peer *peer)
7441 fprintf(file, "Peer %x.%d. " "Burst size %d, " "burst wait %d.%06d.\n",
7442 ntohl(peer->host), (int)ntohs(peer->port), (int)peer->burstSize,
7443 (int)peer->burstWait.sec, (int)peer->burstWait.usec);
7446 " Rtt %d, " "total sent %d, " "resent %d\n",
7447 peer->rtt, peer->nSent, peer->reSends);
7450 " Packet size %d, " "max in packet skew %d, "
7451 "max out packet skew %d\n", peer->ifMTU, (int)peer->inPacketSkew,
7452 (int)peer->outPacketSkew);
7456 #if defined(AFS_PTHREAD_ENV) && defined(RXDEBUG)
7458 * This mutex protects the following static variables:
7462 #define LOCK_RX_DEBUG MUTEX_ENTER(&rx_debug_mutex)
7463 #define UNLOCK_RX_DEBUG MUTEX_EXIT(&rx_debug_mutex)
7465 #define LOCK_RX_DEBUG
7466 #define UNLOCK_RX_DEBUG
7467 #endif /* AFS_PTHREAD_ENV */
7469 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7471 MakeDebugCall(osi_socket socket, afs_uint32 remoteAddr, afs_uint16 remotePort,
7472 u_char type, void *inputData, size_t inputLength,
7473 void *outputData, size_t outputLength)
7475 static afs_int32 counter = 100;
7476 time_t waitTime, waitCount;
7477 struct rx_header theader;
7480 struct timeval tv_now, tv_wake, tv_delta;
7481 struct sockaddr_in taddr, faddr;
7495 tp = &tbuffer[sizeof(struct rx_header)];
7496 taddr.sin_family = AF_INET;
7497 taddr.sin_port = remotePort;
7498 taddr.sin_addr.s_addr = remoteAddr;
7499 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
7500 taddr.sin_len = sizeof(struct sockaddr_in);
7503 memset(&theader, 0, sizeof(theader));
7504 theader.epoch = htonl(999);
7506 theader.callNumber = htonl(counter);
7509 theader.type = type;
7510 theader.flags = RX_CLIENT_INITIATED | RX_LAST_PACKET;
7511 theader.serviceId = 0;
7513 memcpy(tbuffer, &theader, sizeof(theader));
7514 memcpy(tp, inputData, inputLength);
7516 sendto(socket, tbuffer, inputLength + sizeof(struct rx_header), 0,
7517 (struct sockaddr *)&taddr, sizeof(struct sockaddr_in));
7519 /* see if there's a packet available */
7520 gettimeofday(&tv_wake, NULL);
7521 tv_wake.tv_sec += waitTime;
7524 FD_SET(socket, &imask);
7525 tv_delta.tv_sec = tv_wake.tv_sec;
7526 tv_delta.tv_usec = tv_wake.tv_usec;
7527 gettimeofday(&tv_now, NULL);
7529 if (tv_delta.tv_usec < tv_now.tv_usec) {
7531 tv_delta.tv_usec += 1000000;
7534 tv_delta.tv_usec -= tv_now.tv_usec;
7536 if (tv_delta.tv_sec < tv_now.tv_sec) {
7540 tv_delta.tv_sec -= tv_now.tv_sec;
7543 code = select(0, &imask, 0, 0, &tv_delta);
7544 #else /* AFS_NT40_ENV */
7545 code = select(socket + 1, &imask, 0, 0, &tv_delta);
7546 #endif /* AFS_NT40_ENV */
7547 if (code == 1 && FD_ISSET(socket, &imask)) {
7548 /* now receive a packet */
7549 faddrLen = sizeof(struct sockaddr_in);
7551 recvfrom(socket, tbuffer, sizeof(tbuffer), 0,
7552 (struct sockaddr *)&faddr, &faddrLen);
7555 memcpy(&theader, tbuffer, sizeof(struct rx_header));
7556 if (counter == ntohl(theader.callNumber))
7564 /* see if we've timed out */
7572 code -= sizeof(struct rx_header);
7573 if (code > outputLength)
7574 code = outputLength;
7575 memcpy(outputData, tp, code);
7578 #endif /* RXDEBUG */
7581 rx_GetServerDebug(osi_socket socket, afs_uint32 remoteAddr,
7582 afs_uint16 remotePort, struct rx_debugStats * stat,
7583 afs_uint32 * supportedValues)
7585 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7587 struct rx_debugIn in;
7589 *supportedValues = 0;
7590 in.type = htonl(RX_DEBUGI_GETSTATS);
7593 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7594 &in, sizeof(in), stat, sizeof(*stat));
7597 * If the call was successful, fixup the version and indicate
7598 * what contents of the stat structure are valid.
7599 * Also do net to host conversion of fields here.
7603 if (stat->version >= RX_DEBUGI_VERSION_W_SECSTATS) {
7604 *supportedValues |= RX_SERVER_DEBUG_SEC_STATS;
7606 if (stat->version >= RX_DEBUGI_VERSION_W_GETALLCONN) {
7607 *supportedValues |= RX_SERVER_DEBUG_ALL_CONN;
7609 if (stat->version >= RX_DEBUGI_VERSION_W_RXSTATS) {
7610 *supportedValues |= RX_SERVER_DEBUG_RX_STATS;
7612 if (stat->version >= RX_DEBUGI_VERSION_W_WAITERS) {
7613 *supportedValues |= RX_SERVER_DEBUG_WAITER_CNT;
7615 if (stat->version >= RX_DEBUGI_VERSION_W_IDLETHREADS) {
7616 *supportedValues |= RX_SERVER_DEBUG_IDLE_THREADS;
7618 if (stat->version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7619 *supportedValues |= RX_SERVER_DEBUG_NEW_PACKETS;
7621 if (stat->version >= RX_DEBUGI_VERSION_W_GETPEER) {
7622 *supportedValues |= RX_SERVER_DEBUG_ALL_PEER;
7624 if (stat->version >= RX_DEBUGI_VERSION_W_WAITED) {
7625 *supportedValues |= RX_SERVER_DEBUG_WAITED_CNT;
7627 if (stat->version >= RX_DEBUGI_VERSION_W_PACKETS) {
7628 *supportedValues |= RX_SERVER_DEBUG_PACKETS_CNT;
7630 stat->nFreePackets = ntohl(stat->nFreePackets);
7631 stat->packetReclaims = ntohl(stat->packetReclaims);
7632 stat->callsExecuted = ntohl(stat->callsExecuted);
7633 stat->nWaiting = ntohl(stat->nWaiting);
7634 stat->idleThreads = ntohl(stat->idleThreads);
7635 stat->nWaited = ntohl(stat->nWaited);
7636 stat->nPackets = ntohl(stat->nPackets);
7645 rx_GetServerStats(osi_socket socket, afs_uint32 remoteAddr,
7646 afs_uint16 remotePort, struct rx_statistics * stat,
7647 afs_uint32 * supportedValues)
7649 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7651 struct rx_debugIn in;
7652 afs_int32 *lp = (afs_int32 *) stat;
7656 * supportedValues is currently unused, but added to allow future
7657 * versioning of this function.
7660 *supportedValues = 0;
7661 in.type = htonl(RX_DEBUGI_RXSTATS);
7663 memset(stat, 0, sizeof(*stat));
7665 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7666 &in, sizeof(in), stat, sizeof(*stat));
7671 * Do net to host conversion here
7674 for (i = 0; i < sizeof(*stat) / sizeof(afs_int32); i++, lp++) {
7685 rx_GetServerVersion(osi_socket socket, afs_uint32 remoteAddr,
7686 afs_uint16 remotePort, size_t version_length,
7689 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7691 return MakeDebugCall(socket, remoteAddr, remotePort,
7692 RX_PACKET_TYPE_VERSION, a, 1, version,
7700 rx_GetServerConnections(osi_socket socket, afs_uint32 remoteAddr,
7701 afs_uint16 remotePort, afs_int32 * nextConnection,
7702 int allConnections, afs_uint32 debugSupportedValues,
7703 struct rx_debugConn * conn,
7704 afs_uint32 * supportedValues)
7706 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7708 struct rx_debugIn in;
7712 * supportedValues is currently unused, but added to allow future
7713 * versioning of this function.
7716 *supportedValues = 0;
7717 if (allConnections) {
7718 in.type = htonl(RX_DEBUGI_GETALLCONN);
7720 in.type = htonl(RX_DEBUGI_GETCONN);
7722 in.index = htonl(*nextConnection);
7723 memset(conn, 0, sizeof(*conn));
7725 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7726 &in, sizeof(in), conn, sizeof(*conn));
7729 *nextConnection += 1;
7732 * Convert old connection format to new structure.
7735 if (debugSupportedValues & RX_SERVER_DEBUG_OLD_CONN) {
7736 struct rx_debugConn_vL *vL = (struct rx_debugConn_vL *)conn;
7737 #define MOVEvL(a) (conn->a = vL->a)
7739 /* any old or unrecognized version... */
7740 for (i = 0; i < RX_MAXCALLS; i++) {
7741 MOVEvL(callState[i]);
7742 MOVEvL(callMode[i]);
7743 MOVEvL(callFlags[i]);
7744 MOVEvL(callOther[i]);
7746 if (debugSupportedValues & RX_SERVER_DEBUG_SEC_STATS) {
7747 MOVEvL(secStats.type);
7748 MOVEvL(secStats.level);
7749 MOVEvL(secStats.flags);
7750 MOVEvL(secStats.expires);
7751 MOVEvL(secStats.packetsReceived);
7752 MOVEvL(secStats.packetsSent);
7753 MOVEvL(secStats.bytesReceived);
7754 MOVEvL(secStats.bytesSent);
7759 * Do net to host conversion here
7761 * I don't convert host or port since we are most likely
7762 * going to want these in NBO.
7764 conn->cid = ntohl(conn->cid);
7765 conn->serial = ntohl(conn->serial);
7766 for (i = 0; i < RX_MAXCALLS; i++) {
7767 conn->callNumber[i] = ntohl(conn->callNumber[i]);
7769 conn->error = ntohl(conn->error);
7770 conn->secStats.flags = ntohl(conn->secStats.flags);
7771 conn->secStats.expires = ntohl(conn->secStats.expires);
7772 conn->secStats.packetsReceived =
7773 ntohl(conn->secStats.packetsReceived);
7774 conn->secStats.packetsSent = ntohl(conn->secStats.packetsSent);
7775 conn->secStats.bytesReceived = ntohl(conn->secStats.bytesReceived);
7776 conn->secStats.bytesSent = ntohl(conn->secStats.bytesSent);
7777 conn->epoch = ntohl(conn->epoch);
7778 conn->natMTU = ntohl(conn->natMTU);
7787 rx_GetServerPeers(osi_socket socket, afs_uint32 remoteAddr,
7788 afs_uint16 remotePort, afs_int32 * nextPeer,
7789 afs_uint32 debugSupportedValues, struct rx_debugPeer * peer,
7790 afs_uint32 * supportedValues)
7792 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7794 struct rx_debugIn in;
7797 * supportedValues is currently unused, but added to allow future
7798 * versioning of this function.
7801 *supportedValues = 0;
7802 in.type = htonl(RX_DEBUGI_GETPEER);
7803 in.index = htonl(*nextPeer);
7804 memset(peer, 0, sizeof(*peer));
7806 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7807 &in, sizeof(in), peer, sizeof(*peer));
7813 * Do net to host conversion here
7815 * I don't convert host or port since we are most likely
7816 * going to want these in NBO.
7818 peer->ifMTU = ntohs(peer->ifMTU);
7819 peer->idleWhen = ntohl(peer->idleWhen);
7820 peer->refCount = ntohs(peer->refCount);
7821 peer->burstWait.sec = ntohl(peer->burstWait.sec);
7822 peer->burstWait.usec = ntohl(peer->burstWait.usec);
7823 peer->rtt = ntohl(peer->rtt);
7824 peer->rtt_dev = ntohl(peer->rtt_dev);
7825 peer->timeout.sec = 0;
7826 peer->timeout.usec = 0;
7827 peer->nSent = ntohl(peer->nSent);
7828 peer->reSends = ntohl(peer->reSends);
7829 peer->inPacketSkew = ntohl(peer->inPacketSkew);
7830 peer->outPacketSkew = ntohl(peer->outPacketSkew);
7831 peer->rateFlag = ntohl(peer->rateFlag);
7832 peer->natMTU = ntohs(peer->natMTU);
7833 peer->maxMTU = ntohs(peer->maxMTU);
7834 peer->maxDgramPackets = ntohs(peer->maxDgramPackets);
7835 peer->ifDgramPackets = ntohs(peer->ifDgramPackets);
7836 peer->MTU = ntohs(peer->MTU);
7837 peer->cwind = ntohs(peer->cwind);
7838 peer->nDgramPackets = ntohs(peer->nDgramPackets);
7839 peer->congestSeq = ntohs(peer->congestSeq);
7840 peer->bytesSent.high = ntohl(peer->bytesSent.high);
7841 peer->bytesSent.low = ntohl(peer->bytesSent.low);
7842 peer->bytesReceived.high = ntohl(peer->bytesReceived.high);
7843 peer->bytesReceived.low = ntohl(peer->bytesReceived.low);
7852 rx_GetLocalPeers(afs_uint32 peerHost, afs_uint16 peerPort,
7853 struct rx_debugPeer * peerStats)
7856 afs_int32 error = 1; /* default to "did not succeed" */
7857 afs_uint32 hashValue = PEER_HASH(peerHost, peerPort);
7859 MUTEX_ENTER(&rx_peerHashTable_lock);
7860 for(tp = rx_peerHashTable[hashValue];
7861 tp != NULL; tp = tp->next) {
7862 if (tp->host == peerHost)
7868 MUTEX_EXIT(&rx_peerHashTable_lock);
7872 MUTEX_ENTER(&tp->peer_lock);
7873 peerStats->host = tp->host;
7874 peerStats->port = tp->port;
7875 peerStats->ifMTU = tp->ifMTU;
7876 peerStats->idleWhen = tp->idleWhen;
7877 peerStats->refCount = tp->refCount;
7878 peerStats->burstSize = tp->burstSize;
7879 peerStats->burst = tp->burst;
7880 peerStats->burstWait.sec = tp->burstWait.sec;
7881 peerStats->burstWait.usec = tp->burstWait.usec;
7882 peerStats->rtt = tp->rtt;
7883 peerStats->rtt_dev = tp->rtt_dev;
7884 peerStats->timeout.sec = 0;
7885 peerStats->timeout.usec = 0;
7886 peerStats->nSent = tp->nSent;
7887 peerStats->reSends = tp->reSends;
7888 peerStats->inPacketSkew = tp->inPacketSkew;
7889 peerStats->outPacketSkew = tp->outPacketSkew;
7890 peerStats->rateFlag = tp->rateFlag;
7891 peerStats->natMTU = tp->natMTU;
7892 peerStats->maxMTU = tp->maxMTU;
7893 peerStats->maxDgramPackets = tp->maxDgramPackets;
7894 peerStats->ifDgramPackets = tp->ifDgramPackets;
7895 peerStats->MTU = tp->MTU;
7896 peerStats->cwind = tp->cwind;
7897 peerStats->nDgramPackets = tp->nDgramPackets;
7898 peerStats->congestSeq = tp->congestSeq;
7899 peerStats->bytesSent.high = tp->bytesSent.high;
7900 peerStats->bytesSent.low = tp->bytesSent.low;
7901 peerStats->bytesReceived.high = tp->bytesReceived.high;
7902 peerStats->bytesReceived.low = tp->bytesReceived.low;
7903 MUTEX_EXIT(&tp->peer_lock);
7905 MUTEX_ENTER(&rx_peerHashTable_lock);
7908 MUTEX_EXIT(&rx_peerHashTable_lock);
7916 struct rx_serverQueueEntry *np;
7919 struct rx_call *call;
7920 struct rx_serverQueueEntry *sq;
7924 if (rxinit_status == 1) {
7926 return; /* Already shutdown. */
7930 #ifndef AFS_PTHREAD_ENV
7931 FD_ZERO(&rx_selectMask);
7932 #endif /* AFS_PTHREAD_ENV */
7933 rxi_dataQuota = RX_MAX_QUOTA;
7934 #ifndef AFS_PTHREAD_ENV
7936 #endif /* AFS_PTHREAD_ENV */
7939 #ifndef AFS_PTHREAD_ENV
7940 #ifndef AFS_USE_GETTIMEOFDAY
7942 #endif /* AFS_USE_GETTIMEOFDAY */
7943 #endif /* AFS_PTHREAD_ENV */
7945 while (!queue_IsEmpty(&rx_freeCallQueue)) {
7946 call = queue_First(&rx_freeCallQueue, rx_call);
7948 rxi_Free(call, sizeof(struct rx_call));
7951 while (!queue_IsEmpty(&rx_idleServerQueue)) {
7952 sq = queue_First(&rx_idleServerQueue, rx_serverQueueEntry);
7958 struct rx_peer **peer_ptr, **peer_end;
7959 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7960 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7962 struct rx_peer *peer, *next;
7964 MUTEX_ENTER(&rx_peerHashTable_lock);
7965 for (peer = *peer_ptr; peer; peer = next) {
7966 rx_interface_stat_p rpc_stat, nrpc_stat;
7969 MUTEX_ENTER(&rx_rpc_stats);
7970 MUTEX_ENTER(&peer->peer_lock);
7972 (&peer->rpcStats, rpc_stat, nrpc_stat,
7973 rx_interface_stat)) {
7974 unsigned int num_funcs;
7977 queue_Remove(&rpc_stat->queue_header);
7978 queue_Remove(&rpc_stat->all_peers);
7979 num_funcs = rpc_stat->stats[0].func_total;
7981 sizeof(rx_interface_stat_t) +
7982 rpc_stat->stats[0].func_total *
7983 sizeof(rx_function_entry_v1_t);
7985 rxi_Free(rpc_stat, space);
7987 /* rx_rpc_stats must be held */
7988 rxi_rpc_peer_stat_cnt -= num_funcs;
7990 MUTEX_EXIT(&peer->peer_lock);
7991 MUTEX_EXIT(&rx_rpc_stats);
7995 if (rx_stats_active)
7996 rx_atomic_dec(&rx_stats.nPeerStructs);
7998 MUTEX_EXIT(&rx_peerHashTable_lock);
8001 for (i = 0; i < RX_MAX_SERVICES; i++) {
8003 rxi_Free(rx_services[i], sizeof(*rx_services[i]));
8005 for (i = 0; i < rx_hashTableSize; i++) {
8006 struct rx_connection *tc, *ntc;
8007 MUTEX_ENTER(&rx_connHashTable_lock);
8008 for (tc = rx_connHashTable[i]; tc; tc = ntc) {
8010 for (j = 0; j < RX_MAXCALLS; j++) {
8012 rxi_Free(tc->call[j], sizeof(*tc->call[j]));
8015 rxi_Free(tc, sizeof(*tc));
8017 MUTEX_EXIT(&rx_connHashTable_lock);
8020 MUTEX_ENTER(&freeSQEList_lock);
8022 while ((np = rx_FreeSQEList)) {
8023 rx_FreeSQEList = *(struct rx_serverQueueEntry **)np;
8024 MUTEX_DESTROY(&np->lock);
8025 rxi_Free(np, sizeof(*np));
8028 MUTEX_EXIT(&freeSQEList_lock);
8029 MUTEX_DESTROY(&freeSQEList_lock);
8030 MUTEX_DESTROY(&rx_freeCallQueue_lock);
8031 MUTEX_DESTROY(&rx_connHashTable_lock);
8032 MUTEX_DESTROY(&rx_peerHashTable_lock);
8033 MUTEX_DESTROY(&rx_serverPool_lock);
8035 osi_Free(rx_connHashTable,
8036 rx_hashTableSize * sizeof(struct rx_connection *));
8037 osi_Free(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
8039 UNPIN(rx_connHashTable,
8040 rx_hashTableSize * sizeof(struct rx_connection *));
8041 UNPIN(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
8043 rxi_FreeAllPackets();
8045 MUTEX_ENTER(&rx_quota_mutex);
8046 rxi_dataQuota = RX_MAX_QUOTA;
8047 rxi_availProcs = rxi_totalMin = rxi_minDeficit = 0;
8048 MUTEX_EXIT(&rx_quota_mutex);
8053 #ifdef RX_ENABLE_LOCKS
8055 osirx_AssertMine(afs_kmutex_t * lockaddr, char *msg)
8057 if (!MUTEX_ISMINE(lockaddr))
8058 osi_Panic("Lock not held: %s", msg);
8060 #endif /* RX_ENABLE_LOCKS */
8065 * Routines to implement connection specific data.
8069 rx_KeyCreate(rx_destructor_t rtn)
8072 MUTEX_ENTER(&rxi_keyCreate_lock);
8073 key = rxi_keyCreate_counter++;
8074 rxi_keyCreate_destructor = (rx_destructor_t *)
8075 realloc((void *)rxi_keyCreate_destructor,
8076 (key + 1) * sizeof(rx_destructor_t));
8077 rxi_keyCreate_destructor[key] = rtn;
8078 MUTEX_EXIT(&rxi_keyCreate_lock);
8083 rx_SetSpecific(struct rx_connection *conn, int key, void *ptr)
8086 MUTEX_ENTER(&conn->conn_data_lock);
8087 if (!conn->specific) {
8088 conn->specific = (void **)malloc((key + 1) * sizeof(void *));
8089 for (i = 0; i < key; i++)
8090 conn->specific[i] = NULL;
8091 conn->nSpecific = key + 1;
8092 conn->specific[key] = ptr;
8093 } else if (key >= conn->nSpecific) {
8094 conn->specific = (void **)
8095 realloc(conn->specific, (key + 1) * sizeof(void *));
8096 for (i = conn->nSpecific; i < key; i++)
8097 conn->specific[i] = NULL;
8098 conn->nSpecific = key + 1;
8099 conn->specific[key] = ptr;
8101 if (conn->specific[key] && rxi_keyCreate_destructor[key])
8102 (*rxi_keyCreate_destructor[key]) (conn->specific[key]);
8103 conn->specific[key] = ptr;
8105 MUTEX_EXIT(&conn->conn_data_lock);
8109 rx_SetServiceSpecific(struct rx_service *svc, int key, void *ptr)
8112 MUTEX_ENTER(&svc->svc_data_lock);
8113 if (!svc->specific) {
8114 svc->specific = (void **)malloc((key + 1) * sizeof(void *));
8115 for (i = 0; i < key; i++)
8116 svc->specific[i] = NULL;
8117 svc->nSpecific = key + 1;
8118 svc->specific[key] = ptr;
8119 } else if (key >= svc->nSpecific) {
8120 svc->specific = (void **)
8121 realloc(svc->specific, (key + 1) * sizeof(void *));
8122 for (i = svc->nSpecific; i < key; i++)
8123 svc->specific[i] = NULL;
8124 svc->nSpecific = key + 1;
8125 svc->specific[key] = ptr;
8127 if (svc->specific[key] && rxi_keyCreate_destructor[key])
8128 (*rxi_keyCreate_destructor[key]) (svc->specific[key]);
8129 svc->specific[key] = ptr;
8131 MUTEX_EXIT(&svc->svc_data_lock);
8135 rx_GetSpecific(struct rx_connection *conn, int key)
8138 MUTEX_ENTER(&conn->conn_data_lock);
8139 if (key >= conn->nSpecific)
8142 ptr = conn->specific[key];
8143 MUTEX_EXIT(&conn->conn_data_lock);
8148 rx_GetServiceSpecific(struct rx_service *svc, int key)
8151 MUTEX_ENTER(&svc->svc_data_lock);
8152 if (key >= svc->nSpecific)
8155 ptr = svc->specific[key];
8156 MUTEX_EXIT(&svc->svc_data_lock);
8161 #endif /* !KERNEL */
8164 * processStats is a queue used to store the statistics for the local
8165 * process. Its contents are similar to the contents of the rpcStats
8166 * queue on a rx_peer structure, but the actual data stored within
8167 * this queue contains totals across the lifetime of the process (assuming
8168 * the stats have not been reset) - unlike the per peer structures
8169 * which can come and go based upon the peer lifetime.
8172 static struct rx_queue processStats = { &processStats, &processStats };
8175 * peerStats is a queue used to store the statistics for all peer structs.
8176 * Its contents are the union of all the peer rpcStats queues.
8179 static struct rx_queue peerStats = { &peerStats, &peerStats };
8182 * rxi_monitor_processStats is used to turn process wide stat collection
8186 static int rxi_monitor_processStats = 0;
8189 * rxi_monitor_peerStats is used to turn per peer stat collection on and off
8192 static int rxi_monitor_peerStats = 0;
8195 * rxi_AddRpcStat - given all of the information for a particular rpc
8196 * call, create (if needed) and update the stat totals for the rpc.
8200 * IN stats - the queue of stats that will be updated with the new value
8202 * IN rxInterface - a unique number that identifies the rpc interface
8204 * IN currentFunc - the index of the function being invoked
8206 * IN totalFunc - the total number of functions in this interface
8208 * IN queueTime - the amount of time this function waited for a thread
8210 * IN execTime - the amount of time this function invocation took to execute
8212 * IN bytesSent - the number bytes sent by this invocation
8214 * IN bytesRcvd - the number bytes received by this invocation
8216 * IN isServer - if true, this invocation was made to a server
8218 * IN remoteHost - the ip address of the remote host
8220 * IN remotePort - the port of the remote host
8222 * IN addToPeerList - if != 0, add newly created stat to the global peer list
8224 * INOUT counter - if a new stats structure is allocated, the counter will
8225 * be updated with the new number of allocated stat structures
8233 rxi_AddRpcStat(struct rx_queue *stats, afs_uint32 rxInterface,
8234 afs_uint32 currentFunc, afs_uint32 totalFunc,
8235 struct clock *queueTime, struct clock *execTime,
8236 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd, int isServer,
8237 afs_uint32 remoteHost, afs_uint32 remotePort,
8238 int addToPeerList, unsigned int *counter)
8241 rx_interface_stat_p rpc_stat, nrpc_stat;
8244 * See if there's already a structure for this interface
8247 for (queue_Scan(stats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8248 if ((rpc_stat->stats[0].interfaceId == rxInterface)
8249 && (rpc_stat->stats[0].remote_is_server == isServer))
8254 * Didn't find a match so allocate a new structure and add it to the
8258 if (queue_IsEnd(stats, rpc_stat) || (rpc_stat == NULL)
8259 || (rpc_stat->stats[0].interfaceId != rxInterface)
8260 || (rpc_stat->stats[0].remote_is_server != isServer)) {
8265 sizeof(rx_interface_stat_t) +
8266 totalFunc * sizeof(rx_function_entry_v1_t);
8268 rpc_stat = rxi_Alloc(space);
8269 if (rpc_stat == NULL) {
8273 *counter += totalFunc;
8274 for (i = 0; i < totalFunc; i++) {
8275 rpc_stat->stats[i].remote_peer = remoteHost;
8276 rpc_stat->stats[i].remote_port = remotePort;
8277 rpc_stat->stats[i].remote_is_server = isServer;
8278 rpc_stat->stats[i].interfaceId = rxInterface;
8279 rpc_stat->stats[i].func_total = totalFunc;
8280 rpc_stat->stats[i].func_index = i;
8281 hzero(rpc_stat->stats[i].invocations);
8282 hzero(rpc_stat->stats[i].bytes_sent);
8283 hzero(rpc_stat->stats[i].bytes_rcvd);
8284 rpc_stat->stats[i].queue_time_sum.sec = 0;
8285 rpc_stat->stats[i].queue_time_sum.usec = 0;
8286 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
8287 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
8288 rpc_stat->stats[i].queue_time_min.sec = 9999999;
8289 rpc_stat->stats[i].queue_time_min.usec = 9999999;
8290 rpc_stat->stats[i].queue_time_max.sec = 0;
8291 rpc_stat->stats[i].queue_time_max.usec = 0;
8292 rpc_stat->stats[i].execution_time_sum.sec = 0;
8293 rpc_stat->stats[i].execution_time_sum.usec = 0;
8294 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
8295 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
8296 rpc_stat->stats[i].execution_time_min.sec = 9999999;
8297 rpc_stat->stats[i].execution_time_min.usec = 9999999;
8298 rpc_stat->stats[i].execution_time_max.sec = 0;
8299 rpc_stat->stats[i].execution_time_max.usec = 0;
8301 queue_Prepend(stats, rpc_stat);
8302 if (addToPeerList) {
8303 queue_Prepend(&peerStats, &rpc_stat->all_peers);
8308 * Increment the stats for this function
8311 hadd32(rpc_stat->stats[currentFunc].invocations, 1);
8312 hadd(rpc_stat->stats[currentFunc].bytes_sent, *bytesSent);
8313 hadd(rpc_stat->stats[currentFunc].bytes_rcvd, *bytesRcvd);
8314 clock_Add(&rpc_stat->stats[currentFunc].queue_time_sum, queueTime);
8315 clock_AddSq(&rpc_stat->stats[currentFunc].queue_time_sum_sqr, queueTime);
8316 if (clock_Lt(queueTime, &rpc_stat->stats[currentFunc].queue_time_min)) {
8317 rpc_stat->stats[currentFunc].queue_time_min = *queueTime;
8319 if (clock_Gt(queueTime, &rpc_stat->stats[currentFunc].queue_time_max)) {
8320 rpc_stat->stats[currentFunc].queue_time_max = *queueTime;
8322 clock_Add(&rpc_stat->stats[currentFunc].execution_time_sum, execTime);
8323 clock_AddSq(&rpc_stat->stats[currentFunc].execution_time_sum_sqr,
8325 if (clock_Lt(execTime, &rpc_stat->stats[currentFunc].execution_time_min)) {
8326 rpc_stat->stats[currentFunc].execution_time_min = *execTime;
8328 if (clock_Gt(execTime, &rpc_stat->stats[currentFunc].execution_time_max)) {
8329 rpc_stat->stats[currentFunc].execution_time_max = *execTime;
8337 * rx_IncrementTimeAndCount - increment the times and count for a particular
8342 * IN peer - the peer who invoked the rpc
8344 * IN rxInterface - a unique number that identifies the rpc interface
8346 * IN currentFunc - the index of the function being invoked
8348 * IN totalFunc - the total number of functions in this interface
8350 * IN queueTime - the amount of time this function waited for a thread
8352 * IN execTime - the amount of time this function invocation took to execute
8354 * IN bytesSent - the number bytes sent by this invocation
8356 * IN bytesRcvd - the number bytes received by this invocation
8358 * IN isServer - if true, this invocation was made to a server
8366 rx_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8367 afs_uint32 currentFunc, afs_uint32 totalFunc,
8368 struct clock *queueTime, struct clock *execTime,
8369 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd,
8373 if (!(rxi_monitor_peerStats || rxi_monitor_processStats))
8376 MUTEX_ENTER(&rx_rpc_stats);
8378 if (rxi_monitor_peerStats) {
8379 MUTEX_ENTER(&peer->peer_lock);
8380 rxi_AddRpcStat(&peer->rpcStats, rxInterface, currentFunc, totalFunc,
8381 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8382 peer->host, peer->port, 1, &rxi_rpc_peer_stat_cnt);
8383 MUTEX_EXIT(&peer->peer_lock);
8386 if (rxi_monitor_processStats) {
8387 rxi_AddRpcStat(&processStats, rxInterface, currentFunc, totalFunc,
8388 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8389 0xffffffff, 0xffffffff, 0, &rxi_rpc_process_stat_cnt);
8392 MUTEX_EXIT(&rx_rpc_stats);
8397 * rx_MarshallProcessRPCStats - marshall an array of rpc statistics
8401 * IN callerVersion - the rpc stat version of the caller.
8403 * IN count - the number of entries to marshall.
8405 * IN stats - pointer to stats to be marshalled.
8407 * OUT ptr - Where to store the marshalled data.
8414 rx_MarshallProcessRPCStats(afs_uint32 callerVersion, int count,
8415 rx_function_entry_v1_t * stats, afs_uint32 ** ptrP)
8421 * We only support the first version
8423 for (ptr = *ptrP, i = 0; i < count; i++, stats++) {
8424 *(ptr++) = stats->remote_peer;
8425 *(ptr++) = stats->remote_port;
8426 *(ptr++) = stats->remote_is_server;
8427 *(ptr++) = stats->interfaceId;
8428 *(ptr++) = stats->func_total;
8429 *(ptr++) = stats->func_index;
8430 *(ptr++) = hgethi(stats->invocations);
8431 *(ptr++) = hgetlo(stats->invocations);
8432 *(ptr++) = hgethi(stats->bytes_sent);
8433 *(ptr++) = hgetlo(stats->bytes_sent);
8434 *(ptr++) = hgethi(stats->bytes_rcvd);
8435 *(ptr++) = hgetlo(stats->bytes_rcvd);
8436 *(ptr++) = stats->queue_time_sum.sec;
8437 *(ptr++) = stats->queue_time_sum.usec;
8438 *(ptr++) = stats->queue_time_sum_sqr.sec;
8439 *(ptr++) = stats->queue_time_sum_sqr.usec;
8440 *(ptr++) = stats->queue_time_min.sec;
8441 *(ptr++) = stats->queue_time_min.usec;
8442 *(ptr++) = stats->queue_time_max.sec;
8443 *(ptr++) = stats->queue_time_max.usec;
8444 *(ptr++) = stats->execution_time_sum.sec;
8445 *(ptr++) = stats->execution_time_sum.usec;
8446 *(ptr++) = stats->execution_time_sum_sqr.sec;
8447 *(ptr++) = stats->execution_time_sum_sqr.usec;
8448 *(ptr++) = stats->execution_time_min.sec;
8449 *(ptr++) = stats->execution_time_min.usec;
8450 *(ptr++) = stats->execution_time_max.sec;
8451 *(ptr++) = stats->execution_time_max.usec;
8457 * rx_RetrieveProcessRPCStats - retrieve all of the rpc statistics for
8462 * IN callerVersion - the rpc stat version of the caller
8464 * OUT myVersion - the rpc stat version of this function
8466 * OUT clock_sec - local time seconds
8468 * OUT clock_usec - local time microseconds
8470 * OUT allocSize - the number of bytes allocated to contain stats
8472 * OUT statCount - the number stats retrieved from this process.
8474 * OUT stats - the actual stats retrieved from this process.
8478 * Returns void. If successful, stats will != NULL.
8482 rx_RetrieveProcessRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8483 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8484 size_t * allocSize, afs_uint32 * statCount,
8485 afs_uint32 ** stats)
8495 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8498 * Check to see if stats are enabled
8501 MUTEX_ENTER(&rx_rpc_stats);
8502 if (!rxi_monitor_processStats) {
8503 MUTEX_EXIT(&rx_rpc_stats);
8507 clock_GetTime(&now);
8508 *clock_sec = now.sec;
8509 *clock_usec = now.usec;
8512 * Allocate the space based upon the caller version
8514 * If the client is at an older version than we are,
8515 * we return the statistic data in the older data format, but
8516 * we still return our version number so the client knows we
8517 * are maintaining more data than it can retrieve.
8520 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8521 space = rxi_rpc_process_stat_cnt * sizeof(rx_function_entry_v1_t);
8522 *statCount = rxi_rpc_process_stat_cnt;
8525 * This can't happen yet, but in the future version changes
8526 * can be handled by adding additional code here
8530 if (space > (size_t) 0) {
8532 ptr = *stats = rxi_Alloc(space);
8535 rx_interface_stat_p rpc_stat, nrpc_stat;
8539 (&processStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8541 * Copy the data based upon the caller version
8543 rx_MarshallProcessRPCStats(callerVersion,
8544 rpc_stat->stats[0].func_total,
8545 rpc_stat->stats, &ptr);
8551 MUTEX_EXIT(&rx_rpc_stats);
8556 * rx_RetrievePeerRPCStats - retrieve all of the rpc statistics for the peers
8560 * IN callerVersion - the rpc stat version of the caller
8562 * OUT myVersion - the rpc stat version of this function
8564 * OUT clock_sec - local time seconds
8566 * OUT clock_usec - local time microseconds
8568 * OUT allocSize - the number of bytes allocated to contain stats
8570 * OUT statCount - the number of stats retrieved from the individual
8573 * OUT stats - the actual stats retrieved from the individual peer structures.
8577 * Returns void. If successful, stats will != NULL.
8581 rx_RetrievePeerRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8582 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8583 size_t * allocSize, afs_uint32 * statCount,
8584 afs_uint32 ** stats)
8594 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8597 * Check to see if stats are enabled
8600 MUTEX_ENTER(&rx_rpc_stats);
8601 if (!rxi_monitor_peerStats) {
8602 MUTEX_EXIT(&rx_rpc_stats);
8606 clock_GetTime(&now);
8607 *clock_sec = now.sec;
8608 *clock_usec = now.usec;
8611 * Allocate the space based upon the caller version
8613 * If the client is at an older version than we are,
8614 * we return the statistic data in the older data format, but
8615 * we still return our version number so the client knows we
8616 * are maintaining more data than it can retrieve.
8619 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8620 space = rxi_rpc_peer_stat_cnt * sizeof(rx_function_entry_v1_t);
8621 *statCount = rxi_rpc_peer_stat_cnt;
8624 * This can't happen yet, but in the future version changes
8625 * can be handled by adding additional code here
8629 if (space > (size_t) 0) {
8631 ptr = *stats = rxi_Alloc(space);
8634 rx_interface_stat_p rpc_stat, nrpc_stat;
8638 (&peerStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8640 * We have to fix the offset of rpc_stat since we are
8641 * keeping this structure on two rx_queues. The rx_queue
8642 * package assumes that the rx_queue member is the first
8643 * member of the structure. That is, rx_queue assumes that
8644 * any one item is only on one queue at a time. We are
8645 * breaking that assumption and so we have to do a little
8646 * math to fix our pointers.
8649 fix_offset = (char *)rpc_stat;
8650 fix_offset -= offsetof(rx_interface_stat_t, all_peers);
8651 rpc_stat = (rx_interface_stat_p) fix_offset;
8654 * Copy the data based upon the caller version
8656 rx_MarshallProcessRPCStats(callerVersion,
8657 rpc_stat->stats[0].func_total,
8658 rpc_stat->stats, &ptr);
8664 MUTEX_EXIT(&rx_rpc_stats);
8669 * rx_FreeRPCStats - free memory allocated by
8670 * rx_RetrieveProcessRPCStats and rx_RetrievePeerRPCStats
8674 * IN stats - stats previously returned by rx_RetrieveProcessRPCStats or
8675 * rx_RetrievePeerRPCStats
8677 * IN allocSize - the number of bytes in stats.
8685 rx_FreeRPCStats(afs_uint32 * stats, size_t allocSize)
8687 rxi_Free(stats, allocSize);
8691 * rx_queryProcessRPCStats - see if process rpc stat collection is
8692 * currently enabled.
8698 * Returns 0 if stats are not enabled != 0 otherwise
8702 rx_queryProcessRPCStats(void)
8705 MUTEX_ENTER(&rx_rpc_stats);
8706 rc = rxi_monitor_processStats;
8707 MUTEX_EXIT(&rx_rpc_stats);
8712 * rx_queryPeerRPCStats - see if peer stat collection is currently enabled.
8718 * Returns 0 if stats are not enabled != 0 otherwise
8722 rx_queryPeerRPCStats(void)
8725 MUTEX_ENTER(&rx_rpc_stats);
8726 rc = rxi_monitor_peerStats;
8727 MUTEX_EXIT(&rx_rpc_stats);
8732 * rx_enableProcessRPCStats - begin rpc stat collection for entire process
8742 rx_enableProcessRPCStats(void)
8744 MUTEX_ENTER(&rx_rpc_stats);
8745 rx_enable_stats = 1;
8746 rxi_monitor_processStats = 1;
8747 MUTEX_EXIT(&rx_rpc_stats);
8751 * rx_enablePeerRPCStats - begin rpc stat collection per peer structure
8761 rx_enablePeerRPCStats(void)
8763 MUTEX_ENTER(&rx_rpc_stats);
8764 rx_enable_stats = 1;
8765 rxi_monitor_peerStats = 1;
8766 MUTEX_EXIT(&rx_rpc_stats);
8770 * rx_disableProcessRPCStats - stop rpc stat collection for entire process
8780 rx_disableProcessRPCStats(void)
8782 rx_interface_stat_p rpc_stat, nrpc_stat;
8785 MUTEX_ENTER(&rx_rpc_stats);
8788 * Turn off process statistics and if peer stats is also off, turn
8792 rxi_monitor_processStats = 0;
8793 if (rxi_monitor_peerStats == 0) {
8794 rx_enable_stats = 0;
8797 for (queue_Scan(&processStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8798 unsigned int num_funcs = 0;
8801 queue_Remove(rpc_stat);
8802 num_funcs = rpc_stat->stats[0].func_total;
8804 sizeof(rx_interface_stat_t) +
8805 rpc_stat->stats[0].func_total * sizeof(rx_function_entry_v1_t);
8807 rxi_Free(rpc_stat, space);
8808 rxi_rpc_process_stat_cnt -= num_funcs;
8810 MUTEX_EXIT(&rx_rpc_stats);
8814 * rx_disablePeerRPCStats - stop rpc stat collection for peers
8824 rx_disablePeerRPCStats(void)
8826 struct rx_peer **peer_ptr, **peer_end;
8830 * Turn off peer statistics and if process stats is also off, turn
8834 rxi_monitor_peerStats = 0;
8835 if (rxi_monitor_processStats == 0) {
8836 rx_enable_stats = 0;
8839 for (peer_ptr = &rx_peerHashTable[0], peer_end =
8840 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
8842 struct rx_peer *peer, *next, *prev;
8844 MUTEX_ENTER(&rx_peerHashTable_lock);
8845 MUTEX_ENTER(&rx_rpc_stats);
8846 for (prev = peer = *peer_ptr; peer; peer = next) {
8848 code = MUTEX_TRYENTER(&peer->peer_lock);
8850 rx_interface_stat_p rpc_stat, nrpc_stat;
8853 if (prev == *peer_ptr) {
8864 MUTEX_EXIT(&rx_peerHashTable_lock);
8867 (&peer->rpcStats, rpc_stat, nrpc_stat,
8868 rx_interface_stat)) {
8869 unsigned int num_funcs = 0;
8872 queue_Remove(&rpc_stat->queue_header);
8873 queue_Remove(&rpc_stat->all_peers);
8874 num_funcs = rpc_stat->stats[0].func_total;
8876 sizeof(rx_interface_stat_t) +
8877 rpc_stat->stats[0].func_total *
8878 sizeof(rx_function_entry_v1_t);
8880 rxi_Free(rpc_stat, space);
8881 rxi_rpc_peer_stat_cnt -= num_funcs;
8883 MUTEX_EXIT(&peer->peer_lock);
8885 MUTEX_ENTER(&rx_peerHashTable_lock);
8895 MUTEX_EXIT(&rx_rpc_stats);
8896 MUTEX_EXIT(&rx_peerHashTable_lock);
8901 * rx_clearProcessRPCStats - clear the contents of the rpc stats according
8906 * IN clearFlag - flag indicating which stats to clear
8914 rx_clearProcessRPCStats(afs_uint32 clearFlag)
8916 rx_interface_stat_p rpc_stat, nrpc_stat;
8918 MUTEX_ENTER(&rx_rpc_stats);
8920 for (queue_Scan(&processStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8921 unsigned int num_funcs = 0, i;
8922 num_funcs = rpc_stat->stats[0].func_total;
8923 for (i = 0; i < num_funcs; i++) {
8924 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
8925 hzero(rpc_stat->stats[i].invocations);
8927 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
8928 hzero(rpc_stat->stats[i].bytes_sent);
8930 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
8931 hzero(rpc_stat->stats[i].bytes_rcvd);
8933 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
8934 rpc_stat->stats[i].queue_time_sum.sec = 0;
8935 rpc_stat->stats[i].queue_time_sum.usec = 0;
8937 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
8938 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
8939 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
8941 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
8942 rpc_stat->stats[i].queue_time_min.sec = 9999999;
8943 rpc_stat->stats[i].queue_time_min.usec = 9999999;
8945 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
8946 rpc_stat->stats[i].queue_time_max.sec = 0;
8947 rpc_stat->stats[i].queue_time_max.usec = 0;
8949 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
8950 rpc_stat->stats[i].execution_time_sum.sec = 0;
8951 rpc_stat->stats[i].execution_time_sum.usec = 0;
8953 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
8954 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
8955 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
8957 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
8958 rpc_stat->stats[i].execution_time_min.sec = 9999999;
8959 rpc_stat->stats[i].execution_time_min.usec = 9999999;
8961 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
8962 rpc_stat->stats[i].execution_time_max.sec = 0;
8963 rpc_stat->stats[i].execution_time_max.usec = 0;
8968 MUTEX_EXIT(&rx_rpc_stats);
8972 * rx_clearPeerRPCStats - clear the contents of the rpc stats according
8977 * IN clearFlag - flag indicating which stats to clear
8985 rx_clearPeerRPCStats(afs_uint32 clearFlag)
8987 rx_interface_stat_p rpc_stat, nrpc_stat;
8989 MUTEX_ENTER(&rx_rpc_stats);
8991 for (queue_Scan(&peerStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8992 unsigned int num_funcs = 0, i;
8995 * We have to fix the offset of rpc_stat since we are
8996 * keeping this structure on two rx_queues. The rx_queue
8997 * package assumes that the rx_queue member is the first
8998 * member of the structure. That is, rx_queue assumes that
8999 * any one item is only on one queue at a time. We are
9000 * breaking that assumption and so we have to do a little
9001 * math to fix our pointers.
9004 fix_offset = (char *)rpc_stat;
9005 fix_offset -= offsetof(rx_interface_stat_t, all_peers);
9006 rpc_stat = (rx_interface_stat_p) fix_offset;
9008 num_funcs = rpc_stat->stats[0].func_total;
9009 for (i = 0; i < num_funcs; i++) {
9010 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
9011 hzero(rpc_stat->stats[i].invocations);
9013 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
9014 hzero(rpc_stat->stats[i].bytes_sent);
9016 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
9017 hzero(rpc_stat->stats[i].bytes_rcvd);
9019 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9020 rpc_stat->stats[i].queue_time_sum.sec = 0;
9021 rpc_stat->stats[i].queue_time_sum.usec = 0;
9023 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9024 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9025 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9027 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9028 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9029 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9031 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9032 rpc_stat->stats[i].queue_time_max.sec = 0;
9033 rpc_stat->stats[i].queue_time_max.usec = 0;
9035 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9036 rpc_stat->stats[i].execution_time_sum.sec = 0;
9037 rpc_stat->stats[i].execution_time_sum.usec = 0;
9039 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9040 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9041 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9043 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9044 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9045 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9047 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9048 rpc_stat->stats[i].execution_time_max.sec = 0;
9049 rpc_stat->stats[i].execution_time_max.usec = 0;
9054 MUTEX_EXIT(&rx_rpc_stats);
9058 * rxi_rxstat_userok points to a routine that returns 1 if the caller
9059 * is authorized to enable/disable/clear RX statistics.
9061 static int (*rxi_rxstat_userok) (struct rx_call * call) = NULL;
9064 rx_SetRxStatUserOk(int (*proc) (struct rx_call * call))
9066 rxi_rxstat_userok = proc;
9070 rx_RxStatUserOk(struct rx_call *call)
9072 if (!rxi_rxstat_userok)
9074 return rxi_rxstat_userok(call);
9079 * DllMain() -- Entry-point function called by the DllMainCRTStartup()
9080 * function in the MSVC runtime DLL (msvcrt.dll).
9082 * Note: the system serializes calls to this function.
9085 DllMain(HINSTANCE dllInstHandle, /* instance handle for this DLL module */
9086 DWORD reason, /* reason function is being called */
9087 LPVOID reserved) /* reserved for future use */
9090 case DLL_PROCESS_ATTACH:
9091 /* library is being attached to a process */
9095 case DLL_PROCESS_DETACH:
9102 #endif /* AFS_NT40_ENV */
9105 int rx_DumpCalls(FILE *outputFile, char *cookie)
9107 #ifdef RXDEBUG_PACKET
9108 #ifdef KDUMP_RX_LOCK
9109 struct rx_call_rx_lock *c;
9116 #define RXDPRINTF sprintf
9117 #define RXDPRINTOUT output
9119 #define RXDPRINTF fprintf
9120 #define RXDPRINTOUT outputFile
9123 RXDPRINTF(RXDPRINTOUT, "%s - Start dumping all Rx Calls - count=%u\r\n", cookie, rx_stats.nCallStructs);
9125 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9128 for (c = rx_allCallsp; c; c = c->allNextp) {
9129 u_short rqc, tqc, iovqc;
9130 struct rx_packet *p, *np;
9132 MUTEX_ENTER(&c->lock);
9133 queue_Count(&c->rq, p, np, rx_packet, rqc);
9134 queue_Count(&c->tq, p, np, rx_packet, tqc);
9135 queue_Count(&c->iovq, p, np, rx_packet, iovqc);
9137 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, "
9138 "rqc=%u,%u, tqc=%u,%u, iovqc=%u,%u, "
9139 "lstatus=%u, rstatus=%u, error=%d, timeout=%u, "
9140 "resendEvent=%d, timeoutEvt=%d, keepAliveEvt=%d, delayedAckEvt=%d, delayedAbortEvt=%d, abortCode=%d, abortCount=%d, "
9141 "lastSendTime=%u, lastRecvTime=%u, lastSendData=%u"
9142 #ifdef RX_ENABLE_LOCKS
9145 #ifdef RX_REFCOUNT_CHECK
9146 ", refCountBegin=%u, refCountResend=%u, refCountDelay=%u, "
9147 "refCountAlive=%u, refCountPacket=%u, refCountSend=%u, refCountAckAll=%u, refCountAbort=%u"
9150 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,
9151 c->callNumber?*c->callNumber:0, c->conn?c->conn->flags:0, c->flags,
9152 (afs_uint32)c->rqc, (afs_uint32)rqc, (afs_uint32)c->tqc, (afs_uint32)tqc, (afs_uint32)c->iovqc, (afs_uint32)iovqc,
9153 (afs_uint32)c->localStatus, (afs_uint32)c->remoteStatus, c->error, c->timeout,
9154 c->resendEvent?1:0, c->timeoutEvent?1:0, c->keepAliveEvent?1:0, c->delayedAckEvent?1:0, c->delayedAbortEvent?1:0,
9155 c->abortCode, c->abortCount, c->lastSendTime, c->lastReceiveTime, c->lastSendData
9156 #ifdef RX_ENABLE_LOCKS
9157 , (afs_uint32)c->refCount
9159 #ifdef RX_REFCOUNT_CHECK
9160 , c->refCDebug[0],c->refCDebug[1],c->refCDebug[2],c->refCDebug[3],c->refCDebug[4],c->refCDebug[5],c->refCDebug[6],c->refCDebug[7]
9163 MUTEX_EXIT(&c->lock);
9166 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9169 RXDPRINTF(RXDPRINTOUT, "%s - End dumping all Rx Calls\r\n", cookie);
9171 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9173 #endif /* RXDEBUG_PACKET */