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>
14 #include "afs/param.h"
16 #include <afs/param.h>
21 #include "afs/sysincludes.h"
22 #include "afsincludes.h"
28 #include <net/net_globals.h>
29 #endif /* AFS_OSF_ENV */
30 #ifdef AFS_LINUX20_ENV
33 #include "netinet/in.h"
35 #include "inet/common.h"
37 #include "inet/ip_ire.h"
39 #include "afs/afs_args.h"
40 #include "afs/afs_osi.h"
41 #ifdef RX_KERNEL_TRACE
42 #include "rx_kcommon.h"
44 #if (defined(AFS_AUX_ENV) || defined(AFS_AIX_ENV))
48 #undef RXDEBUG /* turn off debugging */
50 #if defined(AFS_SGI_ENV)
51 #include "sys/debug.h"
60 #endif /* AFS_OSF_ENV */
62 #include "afs/sysincludes.h"
63 #include "afsincludes.h"
66 #include "rx_kmutex.h"
67 #include "rx_kernel.h"
71 #include "rx_globals.h"
73 #define AFSOP_STOP_RXCALLBACK 210 /* Stop CALLBACK process */
74 #define AFSOP_STOP_AFS 211 /* Stop AFS process */
75 #define AFSOP_STOP_BKG 212 /* Stop BKG process */
77 extern afs_int32 afs_termState;
79 #include "sys/lockl.h"
80 #include "sys/lock_def.h"
81 #endif /* AFS_AIX41_ENV */
82 # include "rxgen_consts.h"
84 # include <sys/types.h>
91 # include <afs/afsutil.h>
92 # include <WINNT\afsreg.h>
94 # include <sys/socket.h>
95 # include <sys/file.h>
97 # include <sys/stat.h>
98 # include <netinet/in.h>
99 # include <sys/time.h>
102 # include "rx_user.h"
103 # include "rx_clock.h"
104 # include "rx_queue.h"
105 # include "rx_globals.h"
106 # include "rx_trace.h"
107 # include <afs/rxgen_consts.h>
111 #ifdef AFS_PTHREAD_ENV
113 int (*registerProgram) (pid_t, char *) = 0;
114 int (*swapNameProgram) (pid_t, const char *, char *) = 0;
117 int (*registerProgram) (PROCESS, char *) = 0;
118 int (*swapNameProgram) (PROCESS, const char *, char *) = 0;
122 /* Local static routines */
123 static void rxi_DestroyConnectionNoLock(struct rx_connection *conn);
124 #ifdef RX_ENABLE_LOCKS
125 static void rxi_SetAcksInTransmitQueue(struct rx_call *call);
128 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
130 afs_int32 rxi_start_aborted; /* rxi_start awoke after rxi_Send in error. */
131 afs_int32 rxi_start_in_error;
133 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
136 * rxi_rpc_peer_stat_cnt counts the total number of peer stat structures
137 * currently allocated within rx. This number is used to allocate the
138 * memory required to return the statistics when queried.
141 static unsigned int rxi_rpc_peer_stat_cnt;
144 * rxi_rpc_process_stat_cnt counts the total number of local process stat
145 * structures currently allocated within rx. The number is used to allocate
146 * the memory required to return the statistics when queried.
149 static unsigned int rxi_rpc_process_stat_cnt;
151 #if !defined(offsetof)
152 #include <stddef.h> /* for definition of offsetof() */
155 #ifdef AFS_PTHREAD_ENV
159 * Use procedural initialization of mutexes/condition variables
163 extern afs_kmutex_t rx_stats_mutex;
164 extern afs_kmutex_t rx_waiting_mutex;
165 extern afs_kmutex_t rx_quota_mutex;
166 extern afs_kmutex_t rx_pthread_mutex;
167 extern afs_kmutex_t rx_packets_mutex;
168 extern afs_kmutex_t des_init_mutex;
169 extern afs_kmutex_t des_random_mutex;
170 extern afs_kmutex_t rx_clock_mutex;
171 extern afs_kmutex_t rxi_connCacheMutex;
172 extern afs_kmutex_t rx_event_mutex;
173 extern afs_kmutex_t osi_malloc_mutex;
174 extern afs_kmutex_t event_handler_mutex;
175 extern afs_kmutex_t listener_mutex;
176 extern afs_kmutex_t rx_if_init_mutex;
177 extern afs_kmutex_t rx_if_mutex;
178 extern afs_kmutex_t rxkad_client_uid_mutex;
179 extern afs_kmutex_t rxkad_random_mutex;
181 extern afs_kcondvar_t rx_event_handler_cond;
182 extern afs_kcondvar_t rx_listener_cond;
184 static afs_kmutex_t epoch_mutex;
185 static afs_kmutex_t rx_init_mutex;
186 static afs_kmutex_t rx_debug_mutex;
187 static afs_kmutex_t rx_rpc_stats;
190 rxi_InitPthread(void)
192 MUTEX_INIT(&rx_clock_mutex, "clock", MUTEX_DEFAULT, 0);
193 MUTEX_INIT(&rx_stats_mutex, "stats", MUTEX_DEFAULT, 0);
194 MUTEX_INIT(&rx_waiting_mutex, "waiting", MUTEX_DEFAULT, 0);
195 MUTEX_INIT(&rx_quota_mutex, "quota", MUTEX_DEFAULT, 0);
196 MUTEX_INIT(&rx_pthread_mutex, "pthread", MUTEX_DEFAULT, 0);
197 MUTEX_INIT(&rx_packets_mutex, "packets", MUTEX_DEFAULT, 0);
198 MUTEX_INIT(&epoch_mutex, "epoch", MUTEX_DEFAULT, 0);
199 MUTEX_INIT(&rx_init_mutex, "init", MUTEX_DEFAULT, 0);
200 MUTEX_INIT(&rx_event_mutex, "event", MUTEX_DEFAULT, 0);
201 MUTEX_INIT(&des_init_mutex, "des", MUTEX_DEFAULT, 0);
202 MUTEX_INIT(&des_random_mutex, "random", MUTEX_DEFAULT, 0);
203 MUTEX_INIT(&osi_malloc_mutex, "malloc", MUTEX_DEFAULT, 0);
204 MUTEX_INIT(&event_handler_mutex, "event handler", MUTEX_DEFAULT, 0);
205 MUTEX_INIT(&rxi_connCacheMutex, "conn cache", MUTEX_DEFAULT, 0);
206 MUTEX_INIT(&listener_mutex, "listener", MUTEX_DEFAULT, 0);
207 MUTEX_INIT(&rx_if_init_mutex, "if init", MUTEX_DEFAULT, 0);
208 MUTEX_INIT(&rx_if_mutex, "if", MUTEX_DEFAULT, 0);
209 MUTEX_INIT(&rxkad_client_uid_mutex, "uid", MUTEX_DEFAULT, 0);
210 MUTEX_INIT(&rxkad_random_mutex, "rxkad random", MUTEX_DEFAULT, 0);
211 MUTEX_INIT(&rx_debug_mutex, "debug", MUTEX_DEFAULT, 0);
213 assert(pthread_cond_init
214 (&rx_event_handler_cond, (const pthread_condattr_t *)0) == 0);
215 assert(pthread_cond_init(&rx_listener_cond, (const pthread_condattr_t *)0)
217 assert(pthread_key_create(&rx_thread_id_key, NULL) == 0);
218 assert(pthread_key_create(&rx_ts_info_key, NULL) == 0);
220 rxkad_global_stats_init();
222 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
223 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
224 #ifdef RX_ENABLE_LOCKS
227 #endif /* RX_LOCKS_DB */
228 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
229 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
231 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
233 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
235 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
237 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
238 MUTEX_INIT(&rxi_keyCreate_lock, "rxi_keyCreate_lock", MUTEX_DEFAULT, 0);
239 #endif /* RX_ENABLE_LOCKS */
242 pthread_once_t rx_once_init = PTHREAD_ONCE_INIT;
243 #define INIT_PTHREAD_LOCKS \
244 assert(pthread_once(&rx_once_init, rxi_InitPthread)==0)
246 * The rx_stats_mutex mutex protects the following global variables:
247 * rxi_lowConnRefCount
248 * rxi_lowPeerRefCount
257 * The rx_quota_mutex mutex protects the following global variables:
265 * The rx_freePktQ_lock protects the following global variables:
270 * The rx_packets_mutex mutex protects the following global variables:
278 * The rx_pthread_mutex mutex protects the following global variables:
282 #define INIT_PTHREAD_LOCKS
286 /* Variables for handling the minProcs implementation. availProcs gives the
287 * number of threads available in the pool at this moment (not counting dudes
288 * executing right now). totalMin gives the total number of procs required
289 * for handling all minProcs requests. minDeficit is a dynamic variable
290 * tracking the # of procs required to satisfy all of the remaining minProcs
292 * For fine grain locking to work, the quota check and the reservation of
293 * a server thread has to come while rxi_availProcs and rxi_minDeficit
294 * are locked. To this end, the code has been modified under #ifdef
295 * RX_ENABLE_LOCKS so that quota checks and reservation occur at the
296 * same time. A new function, ReturnToServerPool() returns the allocation.
298 * A call can be on several queue's (but only one at a time). When
299 * rxi_ResetCall wants to remove the call from a queue, it has to ensure
300 * that no one else is touching the queue. To this end, we store the address
301 * of the queue lock in the call structure (under the call lock) when we
302 * put the call on a queue, and we clear the call_queue_lock when the
303 * call is removed from a queue (once the call lock has been obtained).
304 * This allows rxi_ResetCall to safely synchronize with others wishing
305 * to manipulate the queue.
308 #if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
309 static afs_kmutex_t rx_rpc_stats;
310 void rxi_StartUnlocked(struct rxevent *event, void *call,
311 void *arg1, int istack);
314 /* We keep a "last conn pointer" in rxi_FindConnection. The odds are
315 ** pretty good that the next packet coming in is from the same connection
316 ** as the last packet, since we're send multiple packets in a transmit window.
318 struct rx_connection *rxLastConn = 0;
320 #ifdef RX_ENABLE_LOCKS
321 /* The locking hierarchy for rx fine grain locking is composed of these
324 * rx_connHashTable_lock - synchronizes conn creation, rx_connHashTable access
325 * conn_call_lock - used to synchonize rx_EndCall and rx_NewCall
326 * call->lock - locks call data fields.
327 * These are independent of each other:
328 * rx_freeCallQueue_lock
333 * serverQueueEntry->lock
335 * rx_peerHashTable_lock - locked under rx_connHashTable_lock
336 * peer->lock - locks peer data fields.
337 * conn_data_lock - that more than one thread is not updating a conn data
338 * field at the same time.
346 * Do we need a lock to protect the peer field in the conn structure?
347 * conn->peer was previously a constant for all intents and so has no
348 * lock protecting this field. The multihomed client delta introduced
349 * a RX code change : change the peer field in the connection structure
350 * to that remote inetrface from which the last packet for this
351 * connection was sent out. This may become an issue if further changes
354 #define SET_CALL_QUEUE_LOCK(C, L) (C)->call_queue_lock = (L)
355 #define CLEAR_CALL_QUEUE_LOCK(C) (C)->call_queue_lock = NULL
357 /* rxdb_fileID is used to identify the lock location, along with line#. */
358 static int rxdb_fileID = RXDB_FILE_RX;
359 #endif /* RX_LOCKS_DB */
360 #else /* RX_ENABLE_LOCKS */
361 #define SET_CALL_QUEUE_LOCK(C, L)
362 #define CLEAR_CALL_QUEUE_LOCK(C)
363 #endif /* RX_ENABLE_LOCKS */
364 struct rx_serverQueueEntry *rx_waitForPacket = 0;
365 struct rx_serverQueueEntry *rx_waitingForPacket = 0;
367 /* ------------Exported Interfaces------------- */
369 /* This function allows rxkad to set the epoch to a suitably random number
370 * which rx_NewConnection will use in the future. The principle purpose is to
371 * get rxnull connections to use the same epoch as the rxkad connections do, at
372 * least once the first rxkad connection is established. This is important now
373 * that the host/port addresses aren't used in FindConnection: the uniqueness
374 * of epoch/cid matters and the start time won't do. */
376 #ifdef AFS_PTHREAD_ENV
378 * This mutex protects the following global variables:
382 #define LOCK_EPOCH MUTEX_ENTER(&epoch_mutex)
383 #define UNLOCK_EPOCH MUTEX_EXIT(&epoch_mutex)
387 #endif /* AFS_PTHREAD_ENV */
390 rx_SetEpoch(afs_uint32 epoch)
397 /* Initialize rx. A port number may be mentioned, in which case this
398 * becomes the default port number for any service installed later.
399 * If 0 is provided for the port number, a random port will be chosen
400 * by the kernel. Whether this will ever overlap anything in
401 * /etc/services is anybody's guess... Returns 0 on success, -1 on
406 int rxinit_status = 1;
407 #ifdef AFS_PTHREAD_ENV
409 * This mutex protects the following global variables:
413 #define LOCK_RX_INIT MUTEX_ENTER(&rx_init_mutex)
414 #define UNLOCK_RX_INIT MUTEX_EXIT(&rx_init_mutex)
417 #define UNLOCK_RX_INIT
421 rx_InitHost(u_int host, u_int port)
428 char *htable, *ptable;
435 if (rxinit_status == 0) {
436 tmp_status = rxinit_status;
438 return tmp_status; /* Already started; return previous error code. */
444 if (afs_winsockInit() < 0)
450 * Initialize anything necessary to provide a non-premptive threading
453 rxi_InitializeThreadSupport();
456 /* Allocate and initialize a socket for client and perhaps server
459 rx_socket = rxi_GetHostUDPSocket(host, (u_short) port);
460 if (rx_socket == OSI_NULLSOCKET) {
464 #if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
467 #endif /* RX_LOCKS_DB */
468 MUTEX_INIT(&rx_stats_mutex, "rx_stats_mutex", MUTEX_DEFAULT, 0);
469 MUTEX_INIT(&rx_waiting_mutex, "rx_waiting_mutex", MUTEX_DEFAULT, 0);
470 MUTEX_INIT(&rx_quota_mutex, "rx_quota_mutex", MUTEX_DEFAULT, 0);
471 MUTEX_INIT(&rx_pthread_mutex, "rx_pthread_mutex", MUTEX_DEFAULT, 0);
472 MUTEX_INIT(&rx_packets_mutex, "rx_packets_mutex", MUTEX_DEFAULT, 0);
473 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
474 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
475 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
476 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
478 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
480 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
482 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
484 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
485 #if defined(AFS_HPUX110_ENV)
487 rx_sleepLock = alloc_spinlock(LAST_HELD_ORDER - 10, "rx_sleepLock");
488 #endif /* AFS_HPUX110_ENV */
489 #endif /* RX_ENABLE_LOCKS && KERNEL */
492 rx_connDeadTime = 12;
493 rx_tranquil = 0; /* reset flag */
494 memset(&rx_stats, 0, sizeof(struct rx_statistics));
496 osi_Alloc(rx_hashTableSize * sizeof(struct rx_connection *));
497 PIN(htable, rx_hashTableSize * sizeof(struct rx_connection *)); /* XXXXX */
498 memset(htable, 0, rx_hashTableSize * sizeof(struct rx_connection *));
499 ptable = (char *)osi_Alloc(rx_hashTableSize * sizeof(struct rx_peer *));
500 PIN(ptable, rx_hashTableSize * sizeof(struct rx_peer *)); /* XXXXX */
501 memset(ptable, 0, rx_hashTableSize * sizeof(struct rx_peer *));
503 /* Malloc up a bunch of packets & buffers */
505 queue_Init(&rx_freePacketQueue);
506 rxi_NeedMorePackets = FALSE;
507 #ifdef RX_ENABLE_TSFPQ
508 rx_nPackets = 0; /* in TSFPQ version, rx_nPackets is managed by rxi_MorePackets* */
509 rxi_MorePacketsTSFPQ(rx_extraPackets + RX_MAX_QUOTA + 2, RX_TS_FPQ_FLUSH_GLOBAL, 0);
510 #else /* RX_ENABLE_TSFPQ */
511 rx_nPackets = rx_extraPackets + RX_MAX_QUOTA + 2; /* fudge */
512 rxi_MorePackets(rx_nPackets);
513 #endif /* RX_ENABLE_TSFPQ */
520 #if defined(AFS_NT40_ENV) && !defined(AFS_PTHREAD_ENV)
521 tv.tv_sec = clock_now.sec;
522 tv.tv_usec = clock_now.usec;
523 srand((unsigned int)tv.tv_usec);
530 #if defined(KERNEL) && !defined(UKERNEL)
531 /* Really, this should never happen in a real kernel */
534 struct sockaddr_in addr;
536 int addrlen = sizeof(addr);
538 socklen_t addrlen = sizeof(addr);
540 if (getsockname((intptr_t)rx_socket, (struct sockaddr *)&addr, &addrlen)) {
544 rx_port = addr.sin_port;
547 rx_stats.minRtt.sec = 9999999;
549 rx_SetEpoch(tv.tv_sec | 0x80000000);
551 rx_SetEpoch(tv.tv_sec); /* Start time of this package, rxkad
552 * will provide a randomer value. */
554 MUTEX_ENTER(&rx_quota_mutex);
555 rxi_dataQuota += rx_extraQuota; /* + extra pkts caller asked to rsrv */
556 MUTEX_EXIT(&rx_quota_mutex);
557 /* *Slightly* random start time for the cid. This is just to help
558 * out with the hashing function at the peer */
559 rx_nextCid = ((tv.tv_sec ^ tv.tv_usec) << RX_CIDSHIFT);
560 rx_connHashTable = (struct rx_connection **)htable;
561 rx_peerHashTable = (struct rx_peer **)ptable;
563 rx_lastAckDelay.sec = 0;
564 rx_lastAckDelay.usec = 400000; /* 400 milliseconds */
565 rx_hardAckDelay.sec = 0;
566 rx_hardAckDelay.usec = 100000; /* 100 milliseconds */
567 rx_softAckDelay.sec = 0;
568 rx_softAckDelay.usec = 100000; /* 100 milliseconds */
570 rxevent_Init(20, rxi_ReScheduleEvents);
572 /* Initialize various global queues */
573 queue_Init(&rx_idleServerQueue);
574 queue_Init(&rx_incomingCallQueue);
575 queue_Init(&rx_freeCallQueue);
577 #if defined(AFS_NT40_ENV) && !defined(KERNEL)
578 /* Initialize our list of usable IP addresses. */
582 /* Start listener process (exact function is dependent on the
583 * implementation environment--kernel or user space) */
587 tmp_status = rxinit_status = 0;
595 return rx_InitHost(htonl(INADDR_ANY), port);
598 /* called with unincremented nRequestsRunning to see if it is OK to start
599 * a new thread in this service. Could be "no" for two reasons: over the
600 * max quota, or would prevent others from reaching their min quota.
602 #ifdef RX_ENABLE_LOCKS
603 /* This verion of QuotaOK reserves quota if it's ok while the
604 * rx_serverPool_lock is held. Return quota using ReturnToServerPool().
607 QuotaOK(struct rx_service *aservice)
609 /* check if over max quota */
610 if (aservice->nRequestsRunning >= aservice->maxProcs) {
614 /* under min quota, we're OK */
615 /* otherwise, can use only if there are enough to allow everyone
616 * to go to their min quota after this guy starts.
619 MUTEX_ENTER(&rx_quota_mutex);
620 if ((aservice->nRequestsRunning < aservice->minProcs)
621 || (rxi_availProcs > rxi_minDeficit)) {
622 aservice->nRequestsRunning++;
623 /* just started call in minProcs pool, need fewer to maintain
625 if (aservice->nRequestsRunning <= aservice->minProcs)
628 MUTEX_EXIT(&rx_quota_mutex);
631 MUTEX_EXIT(&rx_quota_mutex);
637 ReturnToServerPool(struct rx_service *aservice)
639 aservice->nRequestsRunning--;
640 MUTEX_ENTER(&rx_quota_mutex);
641 if (aservice->nRequestsRunning < aservice->minProcs)
644 MUTEX_EXIT(&rx_quota_mutex);
647 #else /* RX_ENABLE_LOCKS */
649 QuotaOK(struct rx_service *aservice)
652 /* under min quota, we're OK */
653 if (aservice->nRequestsRunning < aservice->minProcs)
656 /* check if over max quota */
657 if (aservice->nRequestsRunning >= aservice->maxProcs)
660 /* otherwise, can use only if there are enough to allow everyone
661 * to go to their min quota after this guy starts.
663 if (rxi_availProcs > rxi_minDeficit)
667 #endif /* RX_ENABLE_LOCKS */
670 /* Called by rx_StartServer to start up lwp's to service calls.
671 NExistingProcs gives the number of procs already existing, and which
672 therefore needn't be created. */
674 rxi_StartServerProcs(int nExistingProcs)
676 struct rx_service *service;
681 /* For each service, reserve N processes, where N is the "minimum"
682 * number of processes that MUST be able to execute a request in parallel,
683 * at any time, for that process. Also compute the maximum difference
684 * between any service's maximum number of processes that can run
685 * (i.e. the maximum number that ever will be run, and a guarantee
686 * that this number will run if other services aren't running), and its
687 * minimum number. The result is the extra number of processes that
688 * we need in order to provide the latter guarantee */
689 for (i = 0; i < RX_MAX_SERVICES; i++) {
691 service = rx_services[i];
692 if (service == (struct rx_service *)0)
694 nProcs += service->minProcs;
695 diff = service->maxProcs - service->minProcs;
699 nProcs += maxdiff; /* Extra processes needed to allow max number requested to run in any given service, under good conditions */
700 nProcs -= nExistingProcs; /* Subtract the number of procs that were previously created for use as server procs */
701 for (i = 0; i < nProcs; i++) {
702 rxi_StartServerProc(rx_ServerProc, rx_stackSize);
708 /* This routine is only required on Windows */
710 rx_StartClientThread(void)
712 #ifdef AFS_PTHREAD_ENV
714 pid = pthread_self();
715 #endif /* AFS_PTHREAD_ENV */
717 #endif /* AFS_NT40_ENV */
719 /* This routine must be called if any services are exported. If the
720 * donateMe flag is set, the calling process is donated to the server
723 rx_StartServer(int donateMe)
725 struct rx_service *service;
731 /* Start server processes, if necessary (exact function is dependent
732 * on the implementation environment--kernel or user space). DonateMe
733 * will be 1 if there is 1 pre-existing proc, i.e. this one. In this
734 * case, one less new proc will be created rx_StartServerProcs.
736 rxi_StartServerProcs(donateMe);
738 /* count up the # of threads in minProcs, and add set the min deficit to
739 * be that value, too.
741 for (i = 0; i < RX_MAX_SERVICES; i++) {
742 service = rx_services[i];
743 if (service == (struct rx_service *)0)
745 MUTEX_ENTER(&rx_quota_mutex);
746 rxi_totalMin += service->minProcs;
747 /* below works even if a thread is running, since minDeficit would
748 * still have been decremented and later re-incremented.
750 rxi_minDeficit += service->minProcs;
751 MUTEX_EXIT(&rx_quota_mutex);
754 /* Turn on reaping of idle server connections */
755 rxi_ReapConnections(NULL, NULL, NULL);
764 #ifdef AFS_PTHREAD_ENV
766 pid = afs_pointer_to_int(pthread_self());
767 #else /* AFS_PTHREAD_ENV */
769 LWP_CurrentProcess(&pid);
770 #endif /* AFS_PTHREAD_ENV */
772 sprintf(name, "srv_%d", ++nProcs);
774 (*registerProgram) (pid, name);
776 #endif /* AFS_NT40_ENV */
777 rx_ServerProc(NULL); /* Never returns */
779 #ifdef RX_ENABLE_TSFPQ
780 /* no use leaving packets around in this thread's local queue if
781 * it isn't getting donated to the server thread pool.
783 rxi_FlushLocalPacketsTSFPQ();
784 #endif /* RX_ENABLE_TSFPQ */
788 /* Create a new client connection to the specified service, using the
789 * specified security object to implement the security model for this
791 struct rx_connection *
792 rx_NewConnection(afs_uint32 shost, u_short sport, u_short sservice,
793 struct rx_securityClass *securityObject,
794 int serviceSecurityIndex)
798 struct rx_connection *conn;
803 dpf(("rx_NewConnection(host %x, port %u, service %u, securityObject %x, serviceSecurityIndex %d)\n",
804 ntohl(shost), ntohs(sport), sservice, securityObject, serviceSecurityIndex));
806 /* Vasilsi said: "NETPRI protects Cid and Alloc", but can this be true in
807 * the case of kmem_alloc? */
808 conn = rxi_AllocConnection();
809 #ifdef RX_ENABLE_LOCKS
810 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
811 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
812 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
815 MUTEX_ENTER(&rx_connHashTable_lock);
816 cid = (rx_nextCid += RX_MAXCALLS);
817 conn->type = RX_CLIENT_CONNECTION;
819 conn->epoch = rx_epoch;
820 conn->peer = rxi_FindPeer(shost, sport, 0, 1);
821 conn->serviceId = sservice;
822 conn->securityObject = securityObject;
823 conn->securityData = (void *) 0;
824 conn->securityIndex = serviceSecurityIndex;
825 rx_SetConnDeadTime(conn, rx_connDeadTime);
826 conn->ackRate = RX_FAST_ACK_RATE;
828 conn->specific = NULL;
829 conn->challengeEvent = NULL;
830 conn->delayedAbortEvent = NULL;
831 conn->abortCount = 0;
833 for (i = 0; i < RX_MAXCALLS; i++) {
834 conn->twind[i] = rx_initSendWindow;
835 conn->rwind[i] = rx_initReceiveWindow;
838 RXS_NewConnection(securityObject, conn);
840 CONN_HASH(shost, sport, conn->cid, conn->epoch, RX_CLIENT_CONNECTION);
842 conn->refCount++; /* no lock required since only this thread knows... */
843 conn->next = rx_connHashTable[hashindex];
844 rx_connHashTable[hashindex] = conn;
846 rx_MutexIncrement(rx_stats.nClientConns, rx_stats_mutex);
847 MUTEX_EXIT(&rx_connHashTable_lock);
853 rx_SetConnDeadTime(struct rx_connection *conn, int seconds)
855 /* The idea is to set the dead time to a value that allows several
856 * keepalives to be dropped without timing out the connection. */
857 conn->secondsUntilDead = MAX(seconds, 6);
858 conn->secondsUntilPing = conn->secondsUntilDead / 6;
861 int rxi_lowPeerRefCount = 0;
862 int rxi_lowConnRefCount = 0;
865 * Cleanup a connection that was destroyed in rxi_DestroyConnectioNoLock.
866 * NOTE: must not be called with rx_connHashTable_lock held.
869 rxi_CleanupConnection(struct rx_connection *conn)
871 /* Notify the service exporter, if requested, that this connection
872 * is being destroyed */
873 if (conn->type == RX_SERVER_CONNECTION && conn->service->destroyConnProc)
874 (*conn->service->destroyConnProc) (conn);
876 /* Notify the security module that this connection is being destroyed */
877 RXS_DestroyConnection(conn->securityObject, conn);
879 /* If this is the last connection using the rx_peer struct, set its
880 * idle time to now. rxi_ReapConnections will reap it if it's still
881 * idle (refCount == 0) after rx_idlePeerTime (60 seconds) have passed.
883 MUTEX_ENTER(&rx_peerHashTable_lock);
884 if (conn->peer->refCount < 2) {
885 conn->peer->idleWhen = clock_Sec();
886 if (conn->peer->refCount < 1) {
887 conn->peer->refCount = 1;
888 if (rx_stats_active) {
889 MUTEX_ENTER(&rx_stats_mutex);
890 rxi_lowPeerRefCount++;
891 MUTEX_EXIT(&rx_stats_mutex);
895 conn->peer->refCount--;
896 MUTEX_EXIT(&rx_peerHashTable_lock);
900 if (conn->type == RX_SERVER_CONNECTION)
901 rx_MutexDecrement(rx_stats.nServerConns, rx_stats_mutex);
903 rx_MutexDecrement(rx_stats.nClientConns, rx_stats_mutex);
906 if (conn->specific) {
908 for (i = 0; i < conn->nSpecific; i++) {
909 if (conn->specific[i] && rxi_keyCreate_destructor[i])
910 (*rxi_keyCreate_destructor[i]) (conn->specific[i]);
911 conn->specific[i] = NULL;
913 free(conn->specific);
915 conn->specific = NULL;
919 MUTEX_DESTROY(&conn->conn_call_lock);
920 MUTEX_DESTROY(&conn->conn_data_lock);
921 CV_DESTROY(&conn->conn_call_cv);
923 rxi_FreeConnection(conn);
926 /* Destroy the specified connection */
928 rxi_DestroyConnection(struct rx_connection *conn)
930 MUTEX_ENTER(&rx_connHashTable_lock);
931 rxi_DestroyConnectionNoLock(conn);
932 /* conn should be at the head of the cleanup list */
933 if (conn == rx_connCleanup_list) {
934 rx_connCleanup_list = rx_connCleanup_list->next;
935 MUTEX_EXIT(&rx_connHashTable_lock);
936 rxi_CleanupConnection(conn);
938 #ifdef RX_ENABLE_LOCKS
940 MUTEX_EXIT(&rx_connHashTable_lock);
942 #endif /* RX_ENABLE_LOCKS */
946 rxi_DestroyConnectionNoLock(struct rx_connection *conn)
948 struct rx_connection **conn_ptr;
950 struct rx_packet *packet;
957 MUTEX_ENTER(&conn->conn_data_lock);
958 if (conn->refCount > 0)
961 if (rx_stats_active) {
962 MUTEX_ENTER(&rx_stats_mutex);
963 rxi_lowConnRefCount++;
964 MUTEX_EXIT(&rx_stats_mutex);
968 if ((conn->refCount > 0) || (conn->flags & RX_CONN_BUSY)) {
969 /* Busy; wait till the last guy before proceeding */
970 MUTEX_EXIT(&conn->conn_data_lock);
975 /* If the client previously called rx_NewCall, but it is still
976 * waiting, treat this as a running call, and wait to destroy the
977 * connection later when the call completes. */
978 if ((conn->type == RX_CLIENT_CONNECTION)
979 && (conn->flags & RX_CONN_MAKECALL_WAITING)) {
980 conn->flags |= RX_CONN_DESTROY_ME;
981 MUTEX_EXIT(&conn->conn_data_lock);
985 MUTEX_EXIT(&conn->conn_data_lock);
987 /* Check for extant references to this connection */
988 for (i = 0; i < RX_MAXCALLS; i++) {
989 struct rx_call *call = conn->call[i];
992 if (conn->type == RX_CLIENT_CONNECTION) {
993 MUTEX_ENTER(&call->lock);
994 if (call->delayedAckEvent) {
995 /* Push the final acknowledgment out now--there
996 * won't be a subsequent call to acknowledge the
997 * last reply packets */
998 rxevent_Cancel(call->delayedAckEvent, call,
999 RX_CALL_REFCOUNT_DELAY);
1000 if (call->state == RX_STATE_PRECALL
1001 || call->state == RX_STATE_ACTIVE) {
1002 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1004 rxi_AckAll(NULL, call, 0);
1007 MUTEX_EXIT(&call->lock);
1011 #ifdef RX_ENABLE_LOCKS
1013 if (MUTEX_TRYENTER(&conn->conn_data_lock)) {
1014 MUTEX_EXIT(&conn->conn_data_lock);
1016 /* Someone is accessing a packet right now. */
1020 #endif /* RX_ENABLE_LOCKS */
1023 /* Don't destroy the connection if there are any call
1024 * structures still in use */
1025 MUTEX_ENTER(&conn->conn_data_lock);
1026 conn->flags |= RX_CONN_DESTROY_ME;
1027 MUTEX_EXIT(&conn->conn_data_lock);
1032 if (conn->delayedAbortEvent) {
1033 rxevent_Cancel(conn->delayedAbortEvent, (struct rx_call *)0, 0);
1034 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
1036 MUTEX_ENTER(&conn->conn_data_lock);
1037 rxi_SendConnectionAbort(conn, packet, 0, 1);
1038 MUTEX_EXIT(&conn->conn_data_lock);
1039 rxi_FreePacket(packet);
1043 /* Remove from connection hash table before proceeding */
1045 &rx_connHashTable[CONN_HASH
1046 (peer->host, peer->port, conn->cid, conn->epoch,
1048 for (; *conn_ptr; conn_ptr = &(*conn_ptr)->next) {
1049 if (*conn_ptr == conn) {
1050 *conn_ptr = conn->next;
1054 /* if the conn that we are destroying was the last connection, then we
1055 * clear rxLastConn as well */
1056 if (rxLastConn == conn)
1059 /* Make sure the connection is completely reset before deleting it. */
1060 /* get rid of pending events that could zap us later */
1061 if (conn->challengeEvent)
1062 rxevent_Cancel(conn->challengeEvent, (struct rx_call *)0, 0);
1063 if (conn->checkReachEvent)
1064 rxevent_Cancel(conn->checkReachEvent, (struct rx_call *)0, 0);
1066 /* Add the connection to the list of destroyed connections that
1067 * need to be cleaned up. This is necessary to avoid deadlocks
1068 * in the routines we call to inform others that this connection is
1069 * being destroyed. */
1070 conn->next = rx_connCleanup_list;
1071 rx_connCleanup_list = conn;
1074 /* Externally available version */
1076 rx_DestroyConnection(struct rx_connection *conn)
1081 rxi_DestroyConnection(conn);
1086 rx_GetConnection(struct rx_connection *conn)
1091 MUTEX_ENTER(&conn->conn_data_lock);
1093 MUTEX_EXIT(&conn->conn_data_lock);
1097 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
1098 /* Wait for the transmit queue to no longer be busy.
1099 * requires the call->lock to be held */
1100 static void rxi_WaitforTQBusy(struct rx_call *call) {
1101 while (call->flags & RX_CALL_TQ_BUSY) {
1102 call->flags |= RX_CALL_TQ_WAIT;
1104 #ifdef RX_ENABLE_LOCKS
1105 osirx_AssertMine(&call->lock, "rxi_WaitforTQ lock");
1106 CV_WAIT(&call->cv_tq, &call->lock);
1107 #else /* RX_ENABLE_LOCKS */
1108 osi_rxSleep(&call->tq);
1109 #endif /* RX_ENABLE_LOCKS */
1111 if (call->tqWaiters == 0) {
1112 call->flags &= ~RX_CALL_TQ_WAIT;
1118 /* Start a new rx remote procedure call, on the specified connection.
1119 * If wait is set to 1, wait for a free call channel; otherwise return
1120 * 0. Maxtime gives the maximum number of seconds this call may take,
1121 * after rx_NewCall returns. After this time interval, a call to any
1122 * of rx_SendData, rx_ReadData, etc. will fail with RX_CALL_TIMEOUT.
1123 * For fine grain locking, we hold the conn_call_lock in order to
1124 * to ensure that we don't get signalle after we found a call in an active
1125 * state and before we go to sleep.
1128 rx_NewCall(struct rx_connection *conn)
1131 struct rx_call *call;
1132 struct clock queueTime;
1136 dpf(("rx_NewCall(conn %"AFS_PTR_FMT")\n", conn));
1139 clock_GetTime(&queueTime);
1140 MUTEX_ENTER(&conn->conn_call_lock);
1143 * Check if there are others waiting for a new call.
1144 * If so, let them go first to avoid starving them.
1145 * This is a fairly simple scheme, and might not be
1146 * a complete solution for large numbers of waiters.
1148 * makeCallWaiters keeps track of the number of
1149 * threads waiting to make calls and the
1150 * RX_CONN_MAKECALL_WAITING flag bit is used to
1151 * indicate that there are indeed calls waiting.
1152 * The flag is set when the waiter is incremented.
1153 * It is only cleared in rx_EndCall when
1154 * makeCallWaiters is 0. This prevents us from
1155 * accidently destroying the connection while it
1156 * is potentially about to be used.
1158 MUTEX_ENTER(&conn->conn_data_lock);
1159 if (conn->makeCallWaiters) {
1160 conn->flags |= RX_CONN_MAKECALL_WAITING;
1161 conn->makeCallWaiters++;
1162 MUTEX_EXIT(&conn->conn_data_lock);
1164 #ifdef RX_ENABLE_LOCKS
1165 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1169 MUTEX_ENTER(&conn->conn_data_lock);
1170 conn->makeCallWaiters--;
1172 MUTEX_EXIT(&conn->conn_data_lock);
1175 for (i = 0; i < RX_MAXCALLS; i++) {
1176 call = conn->call[i];
1178 MUTEX_ENTER(&call->lock);
1179 if (call->state == RX_STATE_DALLY) {
1180 rxi_ResetCall(call, 0);
1181 (*call->callNumber)++;
1184 MUTEX_EXIT(&call->lock);
1186 call = rxi_NewCall(conn, i);
1190 if (i < RX_MAXCALLS) {
1193 MUTEX_ENTER(&conn->conn_data_lock);
1194 conn->flags |= RX_CONN_MAKECALL_WAITING;
1195 conn->makeCallWaiters++;
1196 MUTEX_EXIT(&conn->conn_data_lock);
1198 #ifdef RX_ENABLE_LOCKS
1199 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1203 MUTEX_ENTER(&conn->conn_data_lock);
1204 conn->makeCallWaiters--;
1205 MUTEX_EXIT(&conn->conn_data_lock);
1208 * Wake up anyone else who might be giving us a chance to
1209 * run (see code above that avoids resource starvation).
1211 #ifdef RX_ENABLE_LOCKS
1212 CV_BROADCAST(&conn->conn_call_cv);
1217 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1219 /* Client is initially in send mode */
1220 call->state = RX_STATE_ACTIVE;
1221 call->error = conn->error;
1223 call->mode = RX_MODE_ERROR;
1225 call->mode = RX_MODE_SENDING;
1227 /* remember start time for call in case we have hard dead time limit */
1228 call->queueTime = queueTime;
1229 clock_GetTime(&call->startTime);
1230 hzero(call->bytesSent);
1231 hzero(call->bytesRcvd);
1233 /* Turn on busy protocol. */
1234 rxi_KeepAliveOn(call);
1236 MUTEX_EXIT(&call->lock);
1237 MUTEX_EXIT(&conn->conn_call_lock);
1240 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
1241 /* Now, if TQ wasn't cleared earlier, do it now. */
1242 MUTEX_ENTER(&call->lock);
1243 rxi_WaitforTQBusy(call);
1244 if (call->flags & RX_CALL_TQ_CLEARME) {
1245 rxi_ClearTransmitQueue(call, 1);
1246 /*queue_Init(&call->tq);*/
1248 MUTEX_EXIT(&call->lock);
1249 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
1251 dpf(("rx_NewCall(call %"AFS_PTR_FMT")\n", call));
1256 rxi_HasActiveCalls(struct rx_connection *aconn)
1259 struct rx_call *tcall;
1263 for (i = 0; i < RX_MAXCALLS; i++) {
1264 if ((tcall = aconn->call[i])) {
1265 if ((tcall->state == RX_STATE_ACTIVE)
1266 || (tcall->state == RX_STATE_PRECALL)) {
1277 rxi_GetCallNumberVector(struct rx_connection *aconn,
1278 afs_int32 * aint32s)
1281 struct rx_call *tcall;
1285 for (i = 0; i < RX_MAXCALLS; i++) {
1286 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1287 aint32s[i] = aconn->callNumber[i] + 1;
1289 aint32s[i] = aconn->callNumber[i];
1296 rxi_SetCallNumberVector(struct rx_connection *aconn,
1297 afs_int32 * aint32s)
1300 struct rx_call *tcall;
1304 for (i = 0; i < RX_MAXCALLS; i++) {
1305 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1306 aconn->callNumber[i] = aint32s[i] - 1;
1308 aconn->callNumber[i] = aint32s[i];
1314 /* Advertise a new service. A service is named locally by a UDP port
1315 * number plus a 16-bit service id. Returns (struct rx_service *) 0
1318 char *serviceName; Name for identification purposes (e.g. the
1319 service name might be used for probing for
1322 rx_NewServiceHost(afs_uint32 host, u_short port, u_short serviceId,
1323 char *serviceName, struct rx_securityClass **securityObjects,
1324 int nSecurityObjects,
1325 afs_int32(*serviceProc) (struct rx_call * acall))
1327 osi_socket socket = OSI_NULLSOCKET;
1328 struct rx_service *tservice;
1334 if (serviceId == 0) {
1336 "rx_NewService: service id for service %s is not non-zero.\n",
1343 "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",
1351 tservice = rxi_AllocService();
1353 for (i = 0; i < RX_MAX_SERVICES; i++) {
1354 struct rx_service *service = rx_services[i];
1356 if (port == service->servicePort && host == service->serviceHost) {
1357 if (service->serviceId == serviceId) {
1358 /* The identical service has already been
1359 * installed; if the caller was intending to
1360 * change the security classes used by this
1361 * service, he/she loses. */
1363 "rx_NewService: tried to install service %s with service id %d, which is already in use for service %s\n",
1364 serviceName, serviceId, service->serviceName);
1366 rxi_FreeService(tservice);
1369 /* Different service, same port: re-use the socket
1370 * which is bound to the same port */
1371 socket = service->socket;
1374 if (socket == OSI_NULLSOCKET) {
1375 /* If we don't already have a socket (from another
1376 * service on same port) get a new one */
1377 socket = rxi_GetHostUDPSocket(host, port);
1378 if (socket == OSI_NULLSOCKET) {
1380 rxi_FreeService(tservice);
1385 service->socket = socket;
1386 service->serviceHost = host;
1387 service->servicePort = port;
1388 service->serviceId = serviceId;
1389 service->serviceName = serviceName;
1390 service->nSecurityObjects = nSecurityObjects;
1391 service->securityObjects = securityObjects;
1392 service->minProcs = 0;
1393 service->maxProcs = 1;
1394 service->idleDeadTime = 60;
1395 service->idleDeadErr = 0;
1396 service->connDeadTime = rx_connDeadTime;
1397 service->executeRequestProc = serviceProc;
1398 service->checkReach = 0;
1399 rx_services[i] = service; /* not visible until now */
1405 rxi_FreeService(tservice);
1406 (osi_Msg "rx_NewService: cannot support > %d services\n",
1411 /* Set configuration options for all of a service's security objects */
1414 rx_SetSecurityConfiguration(struct rx_service *service,
1415 rx_securityConfigVariables type,
1419 for (i = 0; i<service->nSecurityObjects; i++) {
1420 if (service->securityObjects[i]) {
1421 RXS_SetConfiguration(service->securityObjects[i], NULL, type,
1429 rx_NewService(u_short port, u_short serviceId, char *serviceName,
1430 struct rx_securityClass **securityObjects, int nSecurityObjects,
1431 afs_int32(*serviceProc) (struct rx_call * acall))
1433 return rx_NewServiceHost(htonl(INADDR_ANY), port, serviceId, serviceName, securityObjects, nSecurityObjects, serviceProc);
1436 /* Generic request processing loop. This routine should be called
1437 * by the implementation dependent rx_ServerProc. If socketp is
1438 * non-null, it will be set to the file descriptor that this thread
1439 * is now listening on. If socketp is null, this routine will never
1442 rxi_ServerProc(int threadID, struct rx_call *newcall, osi_socket * socketp)
1444 struct rx_call *call;
1446 struct rx_service *tservice = NULL;
1453 call = rx_GetCall(threadID, tservice, socketp);
1454 if (socketp && *socketp != OSI_NULLSOCKET) {
1455 /* We are now a listener thread */
1460 /* if server is restarting( typically smooth shutdown) then do not
1461 * allow any new calls.
1464 if (rx_tranquil && (call != NULL)) {
1468 MUTEX_ENTER(&call->lock);
1470 rxi_CallError(call, RX_RESTARTING);
1471 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1473 MUTEX_EXIT(&call->lock);
1477 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1478 #ifdef RX_ENABLE_LOCKS
1480 #endif /* RX_ENABLE_LOCKS */
1481 afs_termState = AFSOP_STOP_AFS;
1482 afs_osi_Wakeup(&afs_termState);
1483 #ifdef RX_ENABLE_LOCKS
1485 #endif /* RX_ENABLE_LOCKS */
1490 tservice = call->conn->service;
1492 if (tservice->beforeProc)
1493 (*tservice->beforeProc) (call);
1495 code = call->conn->service->executeRequestProc(call);
1497 if (tservice->afterProc)
1498 (*tservice->afterProc) (call, code);
1500 rx_EndCall(call, code);
1501 if (rx_stats_active) {
1502 MUTEX_ENTER(&rx_stats_mutex);
1504 MUTEX_EXIT(&rx_stats_mutex);
1511 rx_WakeupServerProcs(void)
1513 struct rx_serverQueueEntry *np, *tqp;
1517 MUTEX_ENTER(&rx_serverPool_lock);
1519 #ifdef RX_ENABLE_LOCKS
1520 if (rx_waitForPacket)
1521 CV_BROADCAST(&rx_waitForPacket->cv);
1522 #else /* RX_ENABLE_LOCKS */
1523 if (rx_waitForPacket)
1524 osi_rxWakeup(rx_waitForPacket);
1525 #endif /* RX_ENABLE_LOCKS */
1526 MUTEX_ENTER(&freeSQEList_lock);
1527 for (np = rx_FreeSQEList; np; np = tqp) {
1528 tqp = *(struct rx_serverQueueEntry **)np;
1529 #ifdef RX_ENABLE_LOCKS
1530 CV_BROADCAST(&np->cv);
1531 #else /* RX_ENABLE_LOCKS */
1533 #endif /* RX_ENABLE_LOCKS */
1535 MUTEX_EXIT(&freeSQEList_lock);
1536 for (queue_Scan(&rx_idleServerQueue, np, tqp, rx_serverQueueEntry)) {
1537 #ifdef RX_ENABLE_LOCKS
1538 CV_BROADCAST(&np->cv);
1539 #else /* RX_ENABLE_LOCKS */
1541 #endif /* RX_ENABLE_LOCKS */
1543 MUTEX_EXIT(&rx_serverPool_lock);
1548 * One thing that seems to happen is that all the server threads get
1549 * tied up on some empty or slow call, and then a whole bunch of calls
1550 * arrive at once, using up the packet pool, so now there are more
1551 * empty calls. The most critical resources here are server threads
1552 * and the free packet pool. The "doreclaim" code seems to help in
1553 * general. I think that eventually we arrive in this state: there
1554 * are lots of pending calls which do have all their packets present,
1555 * so they won't be reclaimed, are multi-packet calls, so they won't
1556 * be scheduled until later, and thus are tying up most of the free
1557 * packet pool for a very long time.
1559 * 1. schedule multi-packet calls if all the packets are present.
1560 * Probably CPU-bound operation, useful to return packets to pool.
1561 * Do what if there is a full window, but the last packet isn't here?
1562 * 3. preserve one thread which *only* runs "best" calls, otherwise
1563 * it sleeps and waits for that type of call.
1564 * 4. Don't necessarily reserve a whole window for each thread. In fact,
1565 * the current dataquota business is badly broken. The quota isn't adjusted
1566 * to reflect how many packets are presently queued for a running call.
1567 * So, when we schedule a queued call with a full window of packets queued
1568 * up for it, that *should* free up a window full of packets for other 2d-class
1569 * calls to be able to use from the packet pool. But it doesn't.
1571 * NB. Most of the time, this code doesn't run -- since idle server threads
1572 * sit on the idle server queue and are assigned by "...ReceivePacket" as soon
1573 * as a new call arrives.
1575 /* Sleep until a call arrives. Returns a pointer to the call, ready
1576 * for an rx_Read. */
1577 #ifdef RX_ENABLE_LOCKS
1579 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
1581 struct rx_serverQueueEntry *sq;
1582 struct rx_call *call = (struct rx_call *)0;
1583 struct rx_service *service = NULL;
1586 MUTEX_ENTER(&freeSQEList_lock);
1588 if ((sq = rx_FreeSQEList)) {
1589 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
1590 MUTEX_EXIT(&freeSQEList_lock);
1591 } else { /* otherwise allocate a new one and return that */
1592 MUTEX_EXIT(&freeSQEList_lock);
1593 sq = (struct rx_serverQueueEntry *)
1594 rxi_Alloc(sizeof(struct rx_serverQueueEntry));
1595 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
1596 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
1599 MUTEX_ENTER(&rx_serverPool_lock);
1600 if (cur_service != NULL) {
1601 ReturnToServerPool(cur_service);
1604 if (queue_IsNotEmpty(&rx_incomingCallQueue)) {
1605 struct rx_call *tcall, *ncall, *choice2 = NULL;
1607 /* Scan for eligible incoming calls. A call is not eligible
1608 * if the maximum number of calls for its service type are
1609 * already executing */
1610 /* One thread will process calls FCFS (to prevent starvation),
1611 * while the other threads may run ahead looking for calls which
1612 * have all their input data available immediately. This helps
1613 * keep threads from blocking, waiting for data from the client. */
1614 for (queue_Scan(&rx_incomingCallQueue, tcall, ncall, rx_call)) {
1615 service = tcall->conn->service;
1616 if (!QuotaOK(service)) {
1619 MUTEX_ENTER(&rx_pthread_mutex);
1620 if (tno == rxi_fcfs_thread_num
1621 || !tcall->queue_item_header.next) {
1622 MUTEX_EXIT(&rx_pthread_mutex);
1623 /* If we're the fcfs thread , then we'll just use
1624 * this call. If we haven't been able to find an optimal
1625 * choice, and we're at the end of the list, then use a
1626 * 2d choice if one has been identified. Otherwise... */
1627 call = (choice2 ? choice2 : tcall);
1628 service = call->conn->service;
1630 MUTEX_EXIT(&rx_pthread_mutex);
1631 if (!queue_IsEmpty(&tcall->rq)) {
1632 struct rx_packet *rp;
1633 rp = queue_First(&tcall->rq, rx_packet);
1634 if (rp->header.seq == 1) {
1636 || (rp->header.flags & RX_LAST_PACKET)) {
1638 } else if (rxi_2dchoice && !choice2
1639 && !(tcall->flags & RX_CALL_CLEARED)
1640 && (tcall->rprev > rxi_HardAckRate)) {
1650 ReturnToServerPool(service);
1657 MUTEX_EXIT(&rx_serverPool_lock);
1658 MUTEX_ENTER(&call->lock);
1660 if (call->flags & RX_CALL_WAIT_PROC) {
1661 call->flags &= ~RX_CALL_WAIT_PROC;
1662 MUTEX_ENTER(&rx_waiting_mutex);
1664 MUTEX_EXIT(&rx_waiting_mutex);
1667 if (call->state != RX_STATE_PRECALL || call->error) {
1668 MUTEX_EXIT(&call->lock);
1669 MUTEX_ENTER(&rx_serverPool_lock);
1670 ReturnToServerPool(service);
1675 if (queue_IsEmpty(&call->rq)
1676 || queue_First(&call->rq, rx_packet)->header.seq != 1)
1677 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1679 CLEAR_CALL_QUEUE_LOCK(call);
1682 /* If there are no eligible incoming calls, add this process
1683 * to the idle server queue, to wait for one */
1687 *socketp = OSI_NULLSOCKET;
1689 sq->socketp = socketp;
1690 queue_Append(&rx_idleServerQueue, sq);
1691 #ifndef AFS_AIX41_ENV
1692 rx_waitForPacket = sq;
1694 rx_waitingForPacket = sq;
1695 #endif /* AFS_AIX41_ENV */
1697 CV_WAIT(&sq->cv, &rx_serverPool_lock);
1699 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1700 MUTEX_EXIT(&rx_serverPool_lock);
1701 return (struct rx_call *)0;
1704 } while (!(call = sq->newcall)
1705 && !(socketp && *socketp != OSI_NULLSOCKET));
1706 MUTEX_EXIT(&rx_serverPool_lock);
1708 MUTEX_ENTER(&call->lock);
1714 MUTEX_ENTER(&freeSQEList_lock);
1715 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
1716 rx_FreeSQEList = sq;
1717 MUTEX_EXIT(&freeSQEList_lock);
1720 clock_GetTime(&call->startTime);
1721 call->state = RX_STATE_ACTIVE;
1722 call->mode = RX_MODE_RECEIVING;
1723 #ifdef RX_KERNEL_TRACE
1724 if (ICL_SETACTIVE(afs_iclSetp)) {
1725 int glockOwner = ISAFS_GLOCK();
1728 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
1729 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
1736 rxi_calltrace(RX_CALL_START, call);
1737 dpf(("rx_GetCall(port=%d, service=%d) ==> call %"AFS_PTR_FMT"\n",
1738 call->conn->service->servicePort, call->conn->service->serviceId,
1741 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1742 MUTEX_EXIT(&call->lock);
1744 dpf(("rx_GetCall(socketp=0x%"AFS_PTR_FMT", *socketp=0x%"AFS_PTR_FMT")\n", socketp, *socketp));
1749 #else /* RX_ENABLE_LOCKS */
1751 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
1753 struct rx_serverQueueEntry *sq;
1754 struct rx_call *call = (struct rx_call *)0, *choice2;
1755 struct rx_service *service = NULL;
1759 MUTEX_ENTER(&freeSQEList_lock);
1761 if ((sq = rx_FreeSQEList)) {
1762 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
1763 MUTEX_EXIT(&freeSQEList_lock);
1764 } else { /* otherwise allocate a new one and return that */
1765 MUTEX_EXIT(&freeSQEList_lock);
1766 sq = (struct rx_serverQueueEntry *)
1767 rxi_Alloc(sizeof(struct rx_serverQueueEntry));
1768 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
1769 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
1771 MUTEX_ENTER(&sq->lock);
1773 if (cur_service != NULL) {
1774 cur_service->nRequestsRunning--;
1775 if (cur_service->nRequestsRunning < cur_service->minProcs)
1779 if (queue_IsNotEmpty(&rx_incomingCallQueue)) {
1780 struct rx_call *tcall, *ncall;
1781 /* Scan for eligible incoming calls. A call is not eligible
1782 * if the maximum number of calls for its service type are
1783 * already executing */
1784 /* One thread will process calls FCFS (to prevent starvation),
1785 * while the other threads may run ahead looking for calls which
1786 * have all their input data available immediately. This helps
1787 * keep threads from blocking, waiting for data from the client. */
1788 choice2 = (struct rx_call *)0;
1789 for (queue_Scan(&rx_incomingCallQueue, tcall, ncall, rx_call)) {
1790 service = tcall->conn->service;
1791 if (QuotaOK(service)) {
1792 MUTEX_ENTER(&rx_pthread_mutex);
1793 if (tno == rxi_fcfs_thread_num
1794 || !tcall->queue_item_header.next) {
1795 MUTEX_EXIT(&rx_pthread_mutex);
1796 /* If we're the fcfs thread, then we'll just use
1797 * this call. If we haven't been able to find an optimal
1798 * choice, and we're at the end of the list, then use a
1799 * 2d choice if one has been identified. Otherwise... */
1800 call = (choice2 ? choice2 : tcall);
1801 service = call->conn->service;
1803 MUTEX_EXIT(&rx_pthread_mutex);
1804 if (!queue_IsEmpty(&tcall->rq)) {
1805 struct rx_packet *rp;
1806 rp = queue_First(&tcall->rq, rx_packet);
1807 if (rp->header.seq == 1
1809 || (rp->header.flags & RX_LAST_PACKET))) {
1811 } else if (rxi_2dchoice && !choice2
1812 && !(tcall->flags & RX_CALL_CLEARED)
1813 && (tcall->rprev > rxi_HardAckRate)) {
1827 /* we can't schedule a call if there's no data!!! */
1828 /* send an ack if there's no data, if we're missing the
1829 * first packet, or we're missing something between first
1830 * and last -- there's a "hole" in the incoming data. */
1831 if (queue_IsEmpty(&call->rq)
1832 || queue_First(&call->rq, rx_packet)->header.seq != 1
1833 || call->rprev != queue_Last(&call->rq, rx_packet)->header.seq)
1834 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1836 call->flags &= (~RX_CALL_WAIT_PROC);
1837 service->nRequestsRunning++;
1838 /* just started call in minProcs pool, need fewer to maintain
1840 if (service->nRequestsRunning <= service->minProcs)
1844 /* MUTEX_EXIT(&call->lock); */
1846 /* If there are no eligible incoming calls, add this process
1847 * to the idle server queue, to wait for one */
1850 *socketp = OSI_NULLSOCKET;
1852 sq->socketp = socketp;
1853 queue_Append(&rx_idleServerQueue, sq);
1857 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1859 rxi_Free(sq, sizeof(struct rx_serverQueueEntry));
1860 return (struct rx_call *)0;
1863 } while (!(call = sq->newcall)
1864 && !(socketp && *socketp != OSI_NULLSOCKET));
1866 MUTEX_EXIT(&sq->lock);
1868 MUTEX_ENTER(&freeSQEList_lock);
1869 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
1870 rx_FreeSQEList = sq;
1871 MUTEX_EXIT(&freeSQEList_lock);
1874 clock_GetTime(&call->startTime);
1875 call->state = RX_STATE_ACTIVE;
1876 call->mode = RX_MODE_RECEIVING;
1877 #ifdef RX_KERNEL_TRACE
1878 if (ICL_SETACTIVE(afs_iclSetp)) {
1879 int glockOwner = ISAFS_GLOCK();
1882 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
1883 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
1890 rxi_calltrace(RX_CALL_START, call);
1891 dpf(("rx_GetCall(port=%d, service=%d) ==> call %x\n",
1892 call->conn->service->servicePort, call->conn->service->serviceId,
1895 dpf(("rx_GetCall(socketp=0x%"AFS_PTR_FMT", *socketp=0x%"AFS_PTR_FMT")\n", socketp, *socketp));
1902 #endif /* RX_ENABLE_LOCKS */
1906 /* Establish a procedure to be called when a packet arrives for a
1907 * call. This routine will be called at most once after each call,
1908 * and will also be called if there is an error condition on the or
1909 * the call is complete. Used by multi rx to build a selection
1910 * function which determines which of several calls is likely to be a
1911 * good one to read from.
1912 * NOTE: the way this is currently implemented it is probably only a
1913 * good idea to (1) use it immediately after a newcall (clients only)
1914 * and (2) only use it once. Other uses currently void your warranty
1917 rx_SetArrivalProc(struct rx_call *call,
1918 void (*proc) (struct rx_call * call,
1921 void * handle, int arg)
1923 call->arrivalProc = proc;
1924 call->arrivalProcHandle = handle;
1925 call->arrivalProcArg = arg;
1928 /* Call is finished (possibly prematurely). Return rc to the peer, if
1929 * appropriate, and return the final error code from the conversation
1933 rx_EndCall(struct rx_call *call, afs_int32 rc)
1935 struct rx_connection *conn = call->conn;
1936 struct rx_service *service;
1942 dpf(("rx_EndCall(call %"AFS_PTR_FMT" rc %d error %d abortCode %d)\n",
1943 call, rc, call->error, call->abortCode));
1946 MUTEX_ENTER(&call->lock);
1948 if (rc == 0 && call->error == 0) {
1949 call->abortCode = 0;
1950 call->abortCount = 0;
1953 call->arrivalProc = (void (*)())0;
1954 if (rc && call->error == 0) {
1955 rxi_CallError(call, rc);
1956 /* Send an abort message to the peer if this error code has
1957 * only just been set. If it was set previously, assume the
1958 * peer has already been sent the error code or will request it
1960 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1962 if (conn->type == RX_SERVER_CONNECTION) {
1963 /* Make sure reply or at least dummy reply is sent */
1964 if (call->mode == RX_MODE_RECEIVING) {
1965 rxi_WriteProc(call, 0, 0);
1967 if (call->mode == RX_MODE_SENDING) {
1968 rxi_FlushWrite(call);
1970 service = conn->service;
1971 rxi_calltrace(RX_CALL_END, call);
1972 /* Call goes to hold state until reply packets are acknowledged */
1973 if (call->tfirst + call->nSoftAcked < call->tnext) {
1974 call->state = RX_STATE_HOLD;
1976 call->state = RX_STATE_DALLY;
1977 rxi_ClearTransmitQueue(call, 0);
1978 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
1979 rxevent_Cancel(call->keepAliveEvent, call,
1980 RX_CALL_REFCOUNT_ALIVE);
1982 } else { /* Client connection */
1984 /* Make sure server receives input packets, in the case where
1985 * no reply arguments are expected */
1986 if ((call->mode == RX_MODE_SENDING)
1987 || (call->mode == RX_MODE_RECEIVING && call->rnext == 1)) {
1988 (void)rxi_ReadProc(call, &dummy, 1);
1991 /* If we had an outstanding delayed ack, be nice to the server
1992 * and force-send it now.
1994 if (call->delayedAckEvent) {
1995 rxevent_Cancel(call->delayedAckEvent, call,
1996 RX_CALL_REFCOUNT_DELAY);
1997 call->delayedAckEvent = NULL;
1998 rxi_SendDelayedAck(NULL, call, NULL);
2001 /* We need to release the call lock since it's lower than the
2002 * conn_call_lock and we don't want to hold the conn_call_lock
2003 * over the rx_ReadProc call. The conn_call_lock needs to be held
2004 * here for the case where rx_NewCall is perusing the calls on
2005 * the connection structure. We don't want to signal until
2006 * rx_NewCall is in a stable state. Otherwise, rx_NewCall may
2007 * have checked this call, found it active and by the time it
2008 * goes to sleep, will have missed the signal.
2010 * Do not clear the RX_CONN_MAKECALL_WAITING flag as long as
2011 * there are threads waiting to use the conn object.
2013 MUTEX_EXIT(&call->lock);
2014 MUTEX_ENTER(&conn->conn_call_lock);
2015 MUTEX_ENTER(&call->lock);
2016 MUTEX_ENTER(&conn->conn_data_lock);
2017 conn->flags |= RX_CONN_BUSY;
2018 if (conn->flags & RX_CONN_MAKECALL_WAITING) {
2019 if (conn->makeCallWaiters == 0)
2020 conn->flags &= (~RX_CONN_MAKECALL_WAITING);
2021 MUTEX_EXIT(&conn->conn_data_lock);
2022 #ifdef RX_ENABLE_LOCKS
2023 CV_BROADCAST(&conn->conn_call_cv);
2028 #ifdef RX_ENABLE_LOCKS
2030 MUTEX_EXIT(&conn->conn_data_lock);
2032 #endif /* RX_ENABLE_LOCKS */
2033 call->state = RX_STATE_DALLY;
2035 error = call->error;
2037 /* currentPacket, nLeft, and NFree must be zeroed here, because
2038 * ResetCall cannot: ResetCall may be called at splnet(), in the
2039 * kernel version, and may interrupt the macros rx_Read or
2040 * rx_Write, which run at normal priority for efficiency. */
2041 if (call->currentPacket) {
2042 call->currentPacket->flags &= ~RX_PKTFLAG_CP;
2043 rxi_FreePacket(call->currentPacket);
2044 call->currentPacket = (struct rx_packet *)0;
2047 call->nLeft = call->nFree = call->curlen = 0;
2049 /* Free any packets from the last call to ReadvProc/WritevProc */
2050 #ifdef RXDEBUG_PACKET
2052 #endif /* RXDEBUG_PACKET */
2053 rxi_FreePackets(0, &call->iovq);
2055 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
2056 MUTEX_EXIT(&call->lock);
2057 if (conn->type == RX_CLIENT_CONNECTION) {
2058 MUTEX_EXIT(&conn->conn_call_lock);
2059 conn->flags &= ~RX_CONN_BUSY;
2063 * Map errors to the local host's errno.h format.
2065 error = ntoh_syserr_conv(error);
2069 #if !defined(KERNEL)
2071 /* Call this routine when shutting down a server or client (especially
2072 * clients). This will allow Rx to gracefully garbage collect server
2073 * connections, and reduce the number of retries that a server might
2074 * make to a dead client.
2075 * This is not quite right, since some calls may still be ongoing and
2076 * we can't lock them to destroy them. */
2080 struct rx_connection **conn_ptr, **conn_end;
2084 if (rxinit_status == 1) {
2086 return; /* Already shutdown. */
2088 rxi_DeleteCachedConnections();
2089 if (rx_connHashTable) {
2090 MUTEX_ENTER(&rx_connHashTable_lock);
2091 for (conn_ptr = &rx_connHashTable[0], conn_end =
2092 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
2094 struct rx_connection *conn, *next;
2095 for (conn = *conn_ptr; conn; conn = next) {
2097 if (conn->type == RX_CLIENT_CONNECTION) {
2098 /* MUTEX_ENTER(&conn->conn_data_lock); when used in kernel */
2100 /* MUTEX_EXIT(&conn->conn_data_lock); when used in kernel */
2101 #ifdef RX_ENABLE_LOCKS
2102 rxi_DestroyConnectionNoLock(conn);
2103 #else /* RX_ENABLE_LOCKS */
2104 rxi_DestroyConnection(conn);
2105 #endif /* RX_ENABLE_LOCKS */
2109 #ifdef RX_ENABLE_LOCKS
2110 while (rx_connCleanup_list) {
2111 struct rx_connection *conn;
2112 conn = rx_connCleanup_list;
2113 rx_connCleanup_list = rx_connCleanup_list->next;
2114 MUTEX_EXIT(&rx_connHashTable_lock);
2115 rxi_CleanupConnection(conn);
2116 MUTEX_ENTER(&rx_connHashTable_lock);
2118 MUTEX_EXIT(&rx_connHashTable_lock);
2119 #endif /* RX_ENABLE_LOCKS */
2124 afs_winsockCleanup();
2132 /* if we wakeup packet waiter too often, can get in loop with two
2133 AllocSendPackets each waking each other up (from ReclaimPacket calls) */
2135 rxi_PacketsUnWait(void)
2137 if (!rx_waitingForPackets) {
2141 if (rxi_OverQuota(RX_PACKET_CLASS_SEND)) {
2142 return; /* still over quota */
2145 rx_waitingForPackets = 0;
2146 #ifdef RX_ENABLE_LOCKS
2147 CV_BROADCAST(&rx_waitingForPackets_cv);
2149 osi_rxWakeup(&rx_waitingForPackets);
2155 /* ------------------Internal interfaces------------------------- */
2157 /* Return this process's service structure for the
2158 * specified socket and service */
2160 rxi_FindService(osi_socket socket, u_short serviceId)
2162 struct rx_service **sp;
2163 for (sp = &rx_services[0]; *sp; sp++) {
2164 if ((*sp)->serviceId == serviceId && (*sp)->socket == socket)
2170 #ifdef RXDEBUG_PACKET
2171 #ifdef KDUMP_RX_LOCK
2172 static struct rx_call_rx_lock *rx_allCallsp = 0;
2174 static struct rx_call *rx_allCallsp = 0;
2176 #endif /* RXDEBUG_PACKET */
2178 /* Allocate a call structure, for the indicated channel of the
2179 * supplied connection. The mode and state of the call must be set by
2180 * the caller. Returns the call with mutex locked. */
2182 rxi_NewCall(struct rx_connection *conn, int channel)
2184 struct rx_call *call;
2185 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2186 struct rx_call *cp; /* Call pointer temp */
2187 struct rx_call *nxp; /* Next call pointer, for queue_Scan */
2188 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2190 dpf(("rxi_NewCall(conn %"AFS_PTR_FMT", channel %d)\n", conn, channel));
2192 /* Grab an existing call structure, or allocate a new one.
2193 * Existing call structures are assumed to have been left reset by
2195 MUTEX_ENTER(&rx_freeCallQueue_lock);
2197 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2199 * EXCEPT that the TQ might not yet be cleared out.
2200 * Skip over those with in-use TQs.
2203 for (queue_Scan(&rx_freeCallQueue, cp, nxp, rx_call)) {
2204 if (!(cp->flags & RX_CALL_TQ_BUSY)) {
2210 #else /* AFS_GLOBAL_RXLOCK_KERNEL */
2211 if (queue_IsNotEmpty(&rx_freeCallQueue)) {
2212 call = queue_First(&rx_freeCallQueue, rx_call);
2213 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2215 if (rx_stats_active)
2216 rx_MutexDecrement(rx_stats.nFreeCallStructs, rx_stats_mutex);
2217 MUTEX_EXIT(&rx_freeCallQueue_lock);
2218 MUTEX_ENTER(&call->lock);
2219 CLEAR_CALL_QUEUE_LOCK(call);
2220 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2221 /* Now, if TQ wasn't cleared earlier, do it now. */
2222 rxi_WaitforTQBusy(call);
2223 if (call->flags & RX_CALL_TQ_CLEARME) {
2224 rxi_ClearTransmitQueue(call, 1);
2225 /*queue_Init(&call->tq);*/
2227 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2228 /* Bind the call to its connection structure */
2230 rxi_ResetCall(call, 1);
2233 call = (struct rx_call *)rxi_Alloc(sizeof(struct rx_call));
2234 #ifdef RXDEBUG_PACKET
2235 call->allNextp = rx_allCallsp;
2236 rx_allCallsp = call;
2238 #endif /* RXDEBUG_PACKET */
2239 rx_MutexIncrement(rx_stats.nCallStructs, rx_stats_mutex);
2241 MUTEX_EXIT(&rx_freeCallQueue_lock);
2242 MUTEX_INIT(&call->lock, "call lock", MUTEX_DEFAULT, NULL);
2243 MUTEX_ENTER(&call->lock);
2244 CV_INIT(&call->cv_twind, "call twind", CV_DEFAULT, 0);
2245 CV_INIT(&call->cv_rq, "call rq", CV_DEFAULT, 0);
2246 CV_INIT(&call->cv_tq, "call tq", CV_DEFAULT, 0);
2248 /* Initialize once-only items */
2249 queue_Init(&call->tq);
2250 queue_Init(&call->rq);
2251 queue_Init(&call->iovq);
2252 #ifdef RXDEBUG_PACKET
2253 call->rqc = call->tqc = call->iovqc = 0;
2254 #endif /* RXDEBUG_PACKET */
2255 /* Bind the call to its connection structure (prereq for reset) */
2257 rxi_ResetCall(call, 1);
2259 call->channel = channel;
2260 call->callNumber = &conn->callNumber[channel];
2261 call->rwind = conn->rwind[channel];
2262 call->twind = conn->twind[channel];
2263 /* Note that the next expected call number is retained (in
2264 * conn->callNumber[i]), even if we reallocate the call structure
2266 conn->call[channel] = call;
2267 /* if the channel's never been used (== 0), we should start at 1, otherwise
2268 * the call number is valid from the last time this channel was used */
2269 if (*call->callNumber == 0)
2270 *call->callNumber = 1;
2275 /* A call has been inactive long enough that so we can throw away
2276 * state, including the call structure, which is placed on the call
2278 * Call is locked upon entry.
2279 * haveCTLock set if called from rxi_ReapConnections
2281 #ifdef RX_ENABLE_LOCKS
2283 rxi_FreeCall(struct rx_call *call, int haveCTLock)
2284 #else /* RX_ENABLE_LOCKS */
2286 rxi_FreeCall(struct rx_call *call)
2287 #endif /* RX_ENABLE_LOCKS */
2289 int channel = call->channel;
2290 struct rx_connection *conn = call->conn;
2293 if (call->state == RX_STATE_DALLY || call->state == RX_STATE_HOLD)
2294 (*call->callNumber)++;
2295 rxi_ResetCall(call, 0);
2296 call->conn->call[channel] = (struct rx_call *)0;
2298 MUTEX_ENTER(&rx_freeCallQueue_lock);
2299 SET_CALL_QUEUE_LOCK(call, &rx_freeCallQueue_lock);
2300 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2301 /* A call may be free even though its transmit queue is still in use.
2302 * Since we search the call list from head to tail, put busy calls at
2303 * the head of the list, and idle calls at the tail.
2305 if (call->flags & RX_CALL_TQ_BUSY)
2306 queue_Prepend(&rx_freeCallQueue, call);
2308 queue_Append(&rx_freeCallQueue, call);
2309 #else /* AFS_GLOBAL_RXLOCK_KERNEL */
2310 queue_Append(&rx_freeCallQueue, call);
2311 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2312 if (rx_stats_active)
2313 rx_MutexIncrement(rx_stats.nFreeCallStructs, rx_stats_mutex);
2314 MUTEX_EXIT(&rx_freeCallQueue_lock);
2316 /* Destroy the connection if it was previously slated for
2317 * destruction, i.e. the Rx client code previously called
2318 * rx_DestroyConnection (client connections), or
2319 * rxi_ReapConnections called the same routine (server
2320 * connections). Only do this, however, if there are no
2321 * outstanding calls. Note that for fine grain locking, there appears
2322 * to be a deadlock in that rxi_FreeCall has a call locked and
2323 * DestroyConnectionNoLock locks each call in the conn. But note a
2324 * few lines up where we have removed this call from the conn.
2325 * If someone else destroys a connection, they either have no
2326 * call lock held or are going through this section of code.
2328 if (conn->flags & RX_CONN_DESTROY_ME && !(conn->flags & RX_CONN_MAKECALL_WAITING)) {
2329 MUTEX_ENTER(&conn->conn_data_lock);
2331 MUTEX_EXIT(&conn->conn_data_lock);
2332 #ifdef RX_ENABLE_LOCKS
2334 rxi_DestroyConnectionNoLock(conn);
2336 rxi_DestroyConnection(conn);
2337 #else /* RX_ENABLE_LOCKS */
2338 rxi_DestroyConnection(conn);
2339 #endif /* RX_ENABLE_LOCKS */
2343 afs_int32 rxi_Alloccnt = 0, rxi_Allocsize = 0;
2345 rxi_Alloc(size_t size)
2349 if (rx_stats_active)
2350 rx_MutexAdd1Increment2(rxi_Allocsize, (afs_int32)size, rxi_Alloccnt, rx_stats_mutex);
2353 #if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV)
2354 afs_osi_Alloc_NoSleep(size);
2359 osi_Panic("rxi_Alloc error");
2365 rxi_Free(void *addr, size_t size)
2367 if (rx_stats_active)
2368 rx_MutexAdd1Decrement2(rxi_Allocsize, -(afs_int32)size, rxi_Alloccnt, rx_stats_mutex);
2369 osi_Free(addr, size);
2373 rxi_SetPeerMtu(afs_uint32 host, afs_uint32 port, int mtu)
2375 struct rx_peer **peer_ptr, **peer_end;
2378 MUTEX_ENTER(&rx_peerHashTable_lock);
2380 for (peer_ptr = &rx_peerHashTable[0], peer_end =
2381 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
2383 struct rx_peer *peer, *next;
2384 for (peer = *peer_ptr; peer; peer = next) {
2386 if (host == peer->host) {
2387 MUTEX_ENTER(&peer->peer_lock);
2388 peer->ifMTU=MIN(mtu, peer->ifMTU);
2389 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2390 MUTEX_EXIT(&peer->peer_lock);
2395 struct rx_peer *peer;
2396 hashIndex = PEER_HASH(host, port);
2397 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2398 if ((peer->host == host) && (peer->port == port)) {
2399 MUTEX_ENTER(&peer->peer_lock);
2400 peer->ifMTU=MIN(mtu, peer->ifMTU);
2401 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2402 MUTEX_EXIT(&peer->peer_lock);
2406 MUTEX_EXIT(&rx_peerHashTable_lock);
2409 /* Find the peer process represented by the supplied (host,port)
2410 * combination. If there is no appropriate active peer structure, a
2411 * new one will be allocated and initialized
2412 * The origPeer, if set, is a pointer to a peer structure on which the
2413 * refcount will be be decremented. This is used to replace the peer
2414 * structure hanging off a connection structure */
2416 rxi_FindPeer(afs_uint32 host, u_short port,
2417 struct rx_peer *origPeer, int create)
2421 hashIndex = PEER_HASH(host, port);
2422 MUTEX_ENTER(&rx_peerHashTable_lock);
2423 for (pp = rx_peerHashTable[hashIndex]; pp; pp = pp->next) {
2424 if ((pp->host == host) && (pp->port == port))
2429 pp = rxi_AllocPeer(); /* This bzero's *pp */
2430 pp->host = host; /* set here or in InitPeerParams is zero */
2432 MUTEX_INIT(&pp->peer_lock, "peer_lock", MUTEX_DEFAULT, 0);
2433 queue_Init(&pp->congestionQueue);
2434 queue_Init(&pp->rpcStats);
2435 pp->next = rx_peerHashTable[hashIndex];
2436 rx_peerHashTable[hashIndex] = pp;
2437 rxi_InitPeerParams(pp);
2438 if (rx_stats_active)
2439 rx_MutexIncrement(rx_stats.nPeerStructs, rx_stats_mutex);
2446 origPeer->refCount--;
2447 MUTEX_EXIT(&rx_peerHashTable_lock);
2452 /* Find the connection at (host, port) started at epoch, and with the
2453 * given connection id. Creates the server connection if necessary.
2454 * The type specifies whether a client connection or a server
2455 * connection is desired. In both cases, (host, port) specify the
2456 * peer's (host, pair) pair. Client connections are not made
2457 * automatically by this routine. The parameter socket gives the
2458 * socket descriptor on which the packet was received. This is used,
2459 * in the case of server connections, to check that *new* connections
2460 * come via a valid (port, serviceId). Finally, the securityIndex
2461 * parameter must match the existing index for the connection. If a
2462 * server connection is created, it will be created using the supplied
2463 * index, if the index is valid for this service */
2464 struct rx_connection *
2465 rxi_FindConnection(osi_socket socket, afs_int32 host,
2466 u_short port, u_short serviceId, afs_uint32 cid,
2467 afs_uint32 epoch, int type, u_int securityIndex)
2469 int hashindex, flag, i;
2470 struct rx_connection *conn;
2471 hashindex = CONN_HASH(host, port, cid, epoch, type);
2472 MUTEX_ENTER(&rx_connHashTable_lock);
2473 rxLastConn ? (conn = rxLastConn, flag = 0) : (conn =
2474 rx_connHashTable[hashindex],
2477 if ((conn->type == type) && ((cid & RX_CIDMASK) == conn->cid)
2478 && (epoch == conn->epoch)) {
2479 struct rx_peer *pp = conn->peer;
2480 if (securityIndex != conn->securityIndex) {
2481 /* this isn't supposed to happen, but someone could forge a packet
2482 * like this, and there seems to be some CM bug that makes this
2483 * happen from time to time -- in which case, the fileserver
2485 MUTEX_EXIT(&rx_connHashTable_lock);
2486 return (struct rx_connection *)0;
2488 if (pp->host == host && pp->port == port)
2490 if (type == RX_CLIENT_CONNECTION && pp->port == port)
2492 /* So what happens when it's a callback connection? */
2493 if ( /*type == RX_CLIENT_CONNECTION && */
2494 (conn->epoch & 0x80000000))
2498 /* the connection rxLastConn that was used the last time is not the
2499 ** one we are looking for now. Hence, start searching in the hash */
2501 conn = rx_connHashTable[hashindex];
2506 struct rx_service *service;
2507 if (type == RX_CLIENT_CONNECTION) {
2508 MUTEX_EXIT(&rx_connHashTable_lock);
2509 return (struct rx_connection *)0;
2511 service = rxi_FindService(socket, serviceId);
2512 if (!service || (securityIndex >= service->nSecurityObjects)
2513 || (service->securityObjects[securityIndex] == 0)) {
2514 MUTEX_EXIT(&rx_connHashTable_lock);
2515 return (struct rx_connection *)0;
2517 conn = rxi_AllocConnection(); /* This bzero's the connection */
2518 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
2519 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
2520 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
2521 conn->next = rx_connHashTable[hashindex];
2522 rx_connHashTable[hashindex] = conn;
2523 conn->peer = rxi_FindPeer(host, port, 0, 1);
2524 conn->type = RX_SERVER_CONNECTION;
2525 conn->lastSendTime = clock_Sec(); /* don't GC immediately */
2526 conn->epoch = epoch;
2527 conn->cid = cid & RX_CIDMASK;
2528 /* conn->serial = conn->lastSerial = 0; */
2529 /* conn->timeout = 0; */
2530 conn->ackRate = RX_FAST_ACK_RATE;
2531 conn->service = service;
2532 conn->serviceId = serviceId;
2533 conn->securityIndex = securityIndex;
2534 conn->securityObject = service->securityObjects[securityIndex];
2535 conn->nSpecific = 0;
2536 conn->specific = NULL;
2537 rx_SetConnDeadTime(conn, service->connDeadTime);
2538 rx_SetConnIdleDeadTime(conn, service->idleDeadTime);
2539 rx_SetServerConnIdleDeadErr(conn, service->idleDeadErr);
2540 for (i = 0; i < RX_MAXCALLS; i++) {
2541 conn->twind[i] = rx_initSendWindow;
2542 conn->rwind[i] = rx_initReceiveWindow;
2544 /* Notify security object of the new connection */
2545 RXS_NewConnection(conn->securityObject, conn);
2546 /* XXXX Connection timeout? */
2547 if (service->newConnProc)
2548 (*service->newConnProc) (conn);
2549 if (rx_stats_active)
2550 rx_MutexIncrement(rx_stats.nServerConns, rx_stats_mutex);
2553 MUTEX_ENTER(&conn->conn_data_lock);
2555 MUTEX_EXIT(&conn->conn_data_lock);
2557 rxLastConn = conn; /* store this connection as the last conn used */
2558 MUTEX_EXIT(&rx_connHashTable_lock);
2562 /* There are two packet tracing routines available for testing and monitoring
2563 * Rx. One is called just after every packet is received and the other is
2564 * called just before every packet is sent. Received packets, have had their
2565 * headers decoded, and packets to be sent have not yet had their headers
2566 * encoded. Both take two parameters: a pointer to the packet and a sockaddr
2567 * containing the network address. Both can be modified. The return value, if
2568 * non-zero, indicates that the packet should be dropped. */
2570 int (*rx_justReceived) (struct rx_packet *, struct sockaddr_in *) = 0;
2571 int (*rx_almostSent) (struct rx_packet *, struct sockaddr_in *) = 0;
2573 /* A packet has been received off the interface. Np is the packet, socket is
2574 * the socket number it was received from (useful in determining which service
2575 * this packet corresponds to), and (host, port) reflect the host,port of the
2576 * sender. This call returns the packet to the caller if it is finished with
2577 * it, rather than de-allocating it, just as a small performance hack */
2580 rxi_ReceivePacket(struct rx_packet *np, osi_socket socket,
2581 afs_uint32 host, u_short port, int *tnop,
2582 struct rx_call **newcallp)
2584 struct rx_call *call;
2585 struct rx_connection *conn;
2587 afs_uint32 currentCallNumber;
2593 struct rx_packet *tnp;
2596 /* We don't print out the packet until now because (1) the time may not be
2597 * accurate enough until now in the lwp implementation (rx_Listener only gets
2598 * the time after the packet is read) and (2) from a protocol point of view,
2599 * this is the first time the packet has been seen */
2600 packetType = (np->header.type > 0 && np->header.type < RX_N_PACKET_TYPES)
2601 ? rx_packetTypes[np->header.type - 1] : "*UNKNOWN*";
2602 dpf(("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"AFS_PTR_FMT,
2603 np->header.serial, packetType, ntohl(host), ntohs(port), np->header.serviceId,
2604 np->header.epoch, np->header.cid, np->header.callNumber,
2605 np->header.seq, np->header.flags, np));
2608 if (np->header.type == RX_PACKET_TYPE_VERSION) {
2609 return rxi_ReceiveVersionPacket(np, socket, host, port, 1);
2612 if (np->header.type == RX_PACKET_TYPE_DEBUG) {
2613 return rxi_ReceiveDebugPacket(np, socket, host, port, 1);
2616 /* If an input tracer function is defined, call it with the packet and
2617 * network address. Note this function may modify its arguments. */
2618 if (rx_justReceived) {
2619 struct sockaddr_in addr;
2621 addr.sin_family = AF_INET;
2622 addr.sin_port = port;
2623 addr.sin_addr.s_addr = host;
2624 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
2625 addr.sin_len = sizeof(addr);
2626 #endif /* AFS_OSF_ENV */
2627 drop = (*rx_justReceived) (np, &addr);
2628 /* drop packet if return value is non-zero */
2631 port = addr.sin_port; /* in case fcn changed addr */
2632 host = addr.sin_addr.s_addr;
2636 /* If packet was not sent by the client, then *we* must be the client */
2637 type = ((np->header.flags & RX_CLIENT_INITIATED) != RX_CLIENT_INITIATED)
2638 ? RX_CLIENT_CONNECTION : RX_SERVER_CONNECTION;
2640 /* Find the connection (or fabricate one, if we're the server & if
2641 * necessary) associated with this packet */
2643 rxi_FindConnection(socket, host, port, np->header.serviceId,
2644 np->header.cid, np->header.epoch, type,
2645 np->header.securityIndex);
2648 /* If no connection found or fabricated, just ignore the packet.
2649 * (An argument could be made for sending an abort packet for
2654 MUTEX_ENTER(&conn->conn_data_lock);
2655 if (conn->maxSerial < np->header.serial)
2656 conn->maxSerial = np->header.serial;
2657 MUTEX_EXIT(&conn->conn_data_lock);
2659 /* If the connection is in an error state, send an abort packet and ignore
2660 * the incoming packet */
2662 /* Don't respond to an abort packet--we don't want loops! */
2663 MUTEX_ENTER(&conn->conn_data_lock);
2664 if (np->header.type != RX_PACKET_TYPE_ABORT)
2665 np = rxi_SendConnectionAbort(conn, np, 1, 0);
2667 MUTEX_EXIT(&conn->conn_data_lock);
2671 /* Check for connection-only requests (i.e. not call specific). */
2672 if (np->header.callNumber == 0) {
2673 switch (np->header.type) {
2674 case RX_PACKET_TYPE_ABORT: {
2675 /* What if the supplied error is zero? */
2676 afs_int32 errcode = ntohl(rx_GetInt32(np, 0));
2677 dpf(("rxi_ReceivePacket ABORT rx_GetInt32 = %d", errcode));
2678 rxi_ConnectionError(conn, errcode);
2679 MUTEX_ENTER(&conn->conn_data_lock);
2681 MUTEX_EXIT(&conn->conn_data_lock);
2684 case RX_PACKET_TYPE_CHALLENGE:
2685 tnp = rxi_ReceiveChallengePacket(conn, np, 1);
2686 MUTEX_ENTER(&conn->conn_data_lock);
2688 MUTEX_EXIT(&conn->conn_data_lock);
2690 case RX_PACKET_TYPE_RESPONSE:
2691 tnp = rxi_ReceiveResponsePacket(conn, np, 1);
2692 MUTEX_ENTER(&conn->conn_data_lock);
2694 MUTEX_EXIT(&conn->conn_data_lock);
2696 case RX_PACKET_TYPE_PARAMS:
2697 case RX_PACKET_TYPE_PARAMS + 1:
2698 case RX_PACKET_TYPE_PARAMS + 2:
2699 /* ignore these packet types for now */
2700 MUTEX_ENTER(&conn->conn_data_lock);
2702 MUTEX_EXIT(&conn->conn_data_lock);
2707 /* Should not reach here, unless the peer is broken: send an
2709 rxi_ConnectionError(conn, RX_PROTOCOL_ERROR);
2710 MUTEX_ENTER(&conn->conn_data_lock);
2711 tnp = rxi_SendConnectionAbort(conn, np, 1, 0);
2713 MUTEX_EXIT(&conn->conn_data_lock);
2718 channel = np->header.cid & RX_CHANNELMASK;
2719 call = conn->call[channel];
2720 #ifdef RX_ENABLE_LOCKS
2722 MUTEX_ENTER(&call->lock);
2723 /* Test to see if call struct is still attached to conn. */
2724 if (call != conn->call[channel]) {
2726 MUTEX_EXIT(&call->lock);
2727 if (type == RX_SERVER_CONNECTION) {
2728 call = conn->call[channel];
2729 /* If we started with no call attached and there is one now,
2730 * another thread is also running this routine and has gotten
2731 * the connection channel. We should drop this packet in the tests
2732 * below. If there was a call on this connection and it's now
2733 * gone, then we'll be making a new call below.
2734 * If there was previously a call and it's now different then
2735 * the old call was freed and another thread running this routine
2736 * has created a call on this channel. One of these two threads
2737 * has a packet for the old call and the code below handles those
2741 MUTEX_ENTER(&call->lock);
2743 /* This packet can't be for this call. If the new call address is
2744 * 0 then no call is running on this channel. If there is a call
2745 * then, since this is a client connection we're getting data for
2746 * it must be for the previous call.
2748 if (rx_stats_active)
2749 rx_MutexIncrement(rx_stats.spuriousPacketsRead, rx_stats_mutex);
2750 MUTEX_ENTER(&conn->conn_data_lock);
2752 MUTEX_EXIT(&conn->conn_data_lock);
2757 currentCallNumber = conn->callNumber[channel];
2759 if (type == RX_SERVER_CONNECTION) { /* We're the server */
2760 if (np->header.callNumber < currentCallNumber) {
2761 if (rx_stats_active)
2762 rx_MutexIncrement(rx_stats.spuriousPacketsRead, rx_stats_mutex);
2763 #ifdef RX_ENABLE_LOCKS
2765 MUTEX_EXIT(&call->lock);
2767 MUTEX_ENTER(&conn->conn_data_lock);
2769 MUTEX_EXIT(&conn->conn_data_lock);
2773 MUTEX_ENTER(&conn->conn_call_lock);
2774 call = rxi_NewCall(conn, channel);
2775 MUTEX_EXIT(&conn->conn_call_lock);
2776 *call->callNumber = np->header.callNumber;
2778 if (np->header.callNumber == 0)
2779 dpf(("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"AFS_PTR_FMT" resend %d.%0.06d len %d",
2780 np->header.serial, rx_packetTypes[np->header.type - 1], ntohl(conn->peer->host), ntohs(conn->peer->port),
2781 np->header.serial, np->header.epoch, np->header.cid, np->header.callNumber, np->header.seq,
2782 np->header.flags, np, np->retryTime.sec, np->retryTime.usec / 1000, np->length));
2784 call->state = RX_STATE_PRECALL;
2785 clock_GetTime(&call->queueTime);
2786 hzero(call->bytesSent);
2787 hzero(call->bytesRcvd);
2789 * If the number of queued calls exceeds the overload
2790 * threshold then abort this call.
2792 if ((rx_BusyThreshold > 0) && (rx_nWaiting > rx_BusyThreshold)) {
2793 struct rx_packet *tp;
2795 rxi_CallError(call, rx_BusyError);
2796 tp = rxi_SendCallAbort(call, np, 1, 0);
2797 MUTEX_EXIT(&call->lock);
2798 MUTEX_ENTER(&conn->conn_data_lock);
2800 MUTEX_EXIT(&conn->conn_data_lock);
2801 if (rx_stats_active)
2802 rx_MutexIncrement(rx_stats.nBusies, rx_stats_mutex);
2805 rxi_KeepAliveOn(call);
2806 } else if (np->header.callNumber != currentCallNumber) {
2807 /* Wait until the transmit queue is idle before deciding
2808 * whether to reset the current call. Chances are that the
2809 * call will be in ether DALLY or HOLD state once the TQ_BUSY
2812 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2813 while ((call->state == RX_STATE_ACTIVE)
2814 && (call->flags & RX_CALL_TQ_BUSY)) {
2815 call->flags |= RX_CALL_TQ_WAIT;
2817 #ifdef RX_ENABLE_LOCKS
2818 osirx_AssertMine(&call->lock, "rxi_Start lock3");
2819 CV_WAIT(&call->cv_tq, &call->lock);
2820 #else /* RX_ENABLE_LOCKS */
2821 osi_rxSleep(&call->tq);
2822 #endif /* RX_ENABLE_LOCKS */
2824 if (call->tqWaiters == 0)
2825 call->flags &= ~RX_CALL_TQ_WAIT;
2827 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2828 /* If the new call cannot be taken right now send a busy and set
2829 * the error condition in this call, so that it terminates as
2830 * quickly as possible */
2831 if (call->state == RX_STATE_ACTIVE) {
2832 struct rx_packet *tp;
2834 rxi_CallError(call, RX_CALL_DEAD);
2835 tp = rxi_SendSpecial(call, conn, np, RX_PACKET_TYPE_BUSY,
2837 MUTEX_EXIT(&call->lock);
2838 MUTEX_ENTER(&conn->conn_data_lock);
2840 MUTEX_EXIT(&conn->conn_data_lock);
2843 rxi_ResetCall(call, 0);
2844 *call->callNumber = np->header.callNumber;
2846 if (np->header.callNumber == 0)
2847 dpf(("RecPacket call 0 %d %s: %x.%u.%u.%u.%u.%u.%u flags %d, packet %"AFS_PTR_FMT" resend %d.%06d len %d",
2848 np->header.serial, rx_packetTypes[np->header.type - 1], ntohl(conn->peer->host), ntohs(conn->peer->port),
2849 np->header.serial, np->header.epoch, np->header.cid, np->header.callNumber, np->header.seq,
2850 np->header.flags, np, np->retryTime.sec, np->retryTime.usec, np->length));
2852 call->state = RX_STATE_PRECALL;
2853 clock_GetTime(&call->queueTime);
2854 hzero(call->bytesSent);
2855 hzero(call->bytesRcvd);
2857 * If the number of queued calls exceeds the overload
2858 * threshold then abort this call.
2860 if ((rx_BusyThreshold > 0) && (rx_nWaiting > rx_BusyThreshold)) {
2861 struct rx_packet *tp;
2863 rxi_CallError(call, rx_BusyError);
2864 tp = rxi_SendCallAbort(call, np, 1, 0);
2865 MUTEX_EXIT(&call->lock);
2866 MUTEX_ENTER(&conn->conn_data_lock);
2868 MUTEX_EXIT(&conn->conn_data_lock);
2869 if (rx_stats_active)
2870 rx_MutexIncrement(rx_stats.nBusies, rx_stats_mutex);
2873 rxi_KeepAliveOn(call);
2875 /* Continuing call; do nothing here. */
2877 } else { /* we're the client */
2878 /* Ignore all incoming acknowledgements for calls in DALLY state */
2879 if (call && (call->state == RX_STATE_DALLY)
2880 && (np->header.type == RX_PACKET_TYPE_ACK)) {
2881 if (rx_stats_active)
2882 rx_MutexIncrement(rx_stats.ignorePacketDally, rx_stats_mutex);
2883 #ifdef RX_ENABLE_LOCKS
2885 MUTEX_EXIT(&call->lock);
2888 MUTEX_ENTER(&conn->conn_data_lock);
2890 MUTEX_EXIT(&conn->conn_data_lock);
2894 /* Ignore anything that's not relevant to the current call. If there
2895 * isn't a current call, then no packet is relevant. */
2896 if (!call || (np->header.callNumber != currentCallNumber)) {
2897 if (rx_stats_active)
2898 rx_MutexIncrement(rx_stats.spuriousPacketsRead, rx_stats_mutex);
2899 #ifdef RX_ENABLE_LOCKS
2901 MUTEX_EXIT(&call->lock);
2904 MUTEX_ENTER(&conn->conn_data_lock);
2906 MUTEX_EXIT(&conn->conn_data_lock);
2909 /* If the service security object index stamped in the packet does not
2910 * match the connection's security index, ignore the packet */
2911 if (np->header.securityIndex != conn->securityIndex) {
2912 #ifdef RX_ENABLE_LOCKS
2913 MUTEX_EXIT(&call->lock);
2915 MUTEX_ENTER(&conn->conn_data_lock);
2917 MUTEX_EXIT(&conn->conn_data_lock);
2921 /* If we're receiving the response, then all transmit packets are
2922 * implicitly acknowledged. Get rid of them. */
2923 if (np->header.type == RX_PACKET_TYPE_DATA) {
2924 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
2925 /* XXX Hack. Because we must release the global rx lock when
2926 * sending packets (osi_NetSend) we drop all acks while we're
2927 * traversing the tq in rxi_Start sending packets out because
2928 * packets may move to the freePacketQueue as result of being here!
2929 * So we drop these packets until we're safely out of the
2930 * traversing. Really ugly!
2931 * For fine grain RX locking, we set the acked field in the
2932 * packets and let rxi_Start remove them from the transmit queue.
2934 if (call->flags & RX_CALL_TQ_BUSY) {
2935 #ifdef RX_ENABLE_LOCKS
2936 rxi_SetAcksInTransmitQueue(call);
2939 return np; /* xmitting; drop packet */
2942 rxi_ClearTransmitQueue(call, 0);
2944 #else /* AFS_GLOBAL_RXLOCK_KERNEL */
2945 rxi_ClearTransmitQueue(call, 0);
2946 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
2948 if (np->header.type == RX_PACKET_TYPE_ACK) {
2949 /* now check to see if this is an ack packet acknowledging that the
2950 * server actually *lost* some hard-acked data. If this happens we
2951 * ignore this packet, as it may indicate that the server restarted in
2952 * the middle of a call. It is also possible that this is an old ack
2953 * packet. We don't abort the connection in this case, because this
2954 * *might* just be an old ack packet. The right way to detect a server
2955 * restart in the midst of a call is to notice that the server epoch
2957 /* XXX I'm not sure this is exactly right, since tfirst **IS**
2958 * XXX unacknowledged. I think that this is off-by-one, but
2959 * XXX I don't dare change it just yet, since it will
2960 * XXX interact badly with the server-restart detection
2961 * XXX code in receiveackpacket. */
2962 if (ntohl(rx_GetInt32(np, FIRSTACKOFFSET)) < call->tfirst) {
2963 if (rx_stats_active)
2964 rx_MutexIncrement(rx_stats.spuriousPacketsRead, rx_stats_mutex);
2965 MUTEX_EXIT(&call->lock);
2966 MUTEX_ENTER(&conn->conn_data_lock);
2968 MUTEX_EXIT(&conn->conn_data_lock);
2972 } /* else not a data packet */
2975 osirx_AssertMine(&call->lock, "rxi_ReceivePacket middle");
2976 /* Set remote user defined status from packet */
2977 call->remoteStatus = np->header.userStatus;
2979 /* Note the gap between the expected next packet and the actual
2980 * packet that arrived, when the new packet has a smaller serial number
2981 * than expected. Rioses frequently reorder packets all by themselves,
2982 * so this will be quite important with very large window sizes.
2983 * Skew is checked against 0 here to avoid any dependence on the type of
2984 * inPacketSkew (which may be unsigned). In C, -1 > (unsigned) 0 is always
2986 * The inPacketSkew should be a smoothed running value, not just a maximum. MTUXXX
2987 * see CalculateRoundTripTime for an example of how to keep smoothed values.
2988 * I think using a beta of 1/8 is probably appropriate. 93.04.21
2990 MUTEX_ENTER(&conn->conn_data_lock);
2991 skew = conn->lastSerial - np->header.serial;
2992 conn->lastSerial = np->header.serial;
2993 MUTEX_EXIT(&conn->conn_data_lock);
2995 struct rx_peer *peer;
2997 if (skew > peer->inPacketSkew) {
2998 dpf(("*** In skew changed from %d to %d\n",
2999 peer->inPacketSkew, skew));
3000 peer->inPacketSkew = skew;
3004 /* Now do packet type-specific processing */
3005 switch (np->header.type) {
3006 case RX_PACKET_TYPE_DATA:
3007 np = rxi_ReceiveDataPacket(call, np, 1, socket, host, port, tnop,
3010 case RX_PACKET_TYPE_ACK:
3011 /* Respond immediately to ack packets requesting acknowledgement
3013 if (np->header.flags & RX_REQUEST_ACK) {
3015 (void)rxi_SendCallAbort(call, 0, 1, 0);
3017 (void)rxi_SendAck(call, 0, np->header.serial,
3018 RX_ACK_PING_RESPONSE, 1);
3020 np = rxi_ReceiveAckPacket(call, np, 1);
3022 case RX_PACKET_TYPE_ABORT: {
3023 /* An abort packet: reset the call, passing the error up to the user. */
3024 /* What if error is zero? */
3025 /* What if the error is -1? the application will treat it as a timeout. */
3026 afs_int32 errdata = ntohl(*(afs_int32 *) rx_DataOf(np));
3027 dpf(("rxi_ReceivePacket ABORT rx_DataOf = %d", errdata));
3028 rxi_CallError(call, errdata);
3029 MUTEX_EXIT(&call->lock);
3030 MUTEX_ENTER(&conn->conn_data_lock);
3032 MUTEX_EXIT(&conn->conn_data_lock);
3033 return np; /* xmitting; drop packet */
3035 case RX_PACKET_TYPE_BUSY:
3038 case RX_PACKET_TYPE_ACKALL:
3039 /* All packets acknowledged, so we can drop all packets previously
3040 * readied for sending */
3041 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
3042 /* XXX Hack. We because we can't release the global rx lock when
3043 * sending packets (osi_NetSend) we drop all ack pkts while we're
3044 * traversing the tq in rxi_Start sending packets out because
3045 * packets may move to the freePacketQueue as result of being
3046 * here! So we drop these packets until we're safely out of the
3047 * traversing. Really ugly!
3048 * For fine grain RX locking, we set the acked field in the packets
3049 * and let rxi_Start remove the packets from the transmit queue.
3051 if (call->flags & RX_CALL_TQ_BUSY) {
3052 #ifdef RX_ENABLE_LOCKS
3053 rxi_SetAcksInTransmitQueue(call);
3055 #else /* RX_ENABLE_LOCKS */
3056 MUTEX_EXIT(&call->lock);
3057 MUTEX_ENTER(&conn->conn_data_lock);
3059 MUTEX_EXIT(&conn->conn_data_lock);
3060 return np; /* xmitting; drop packet */
3061 #endif /* RX_ENABLE_LOCKS */
3063 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3064 rxi_ClearTransmitQueue(call, 0);
3065 rxevent_Cancel(call->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE);
3068 /* Should not reach here, unless the peer is broken: send an abort
3070 rxi_CallError(call, RX_PROTOCOL_ERROR);
3071 np = rxi_SendCallAbort(call, np, 1, 0);
3074 /* Note when this last legitimate packet was received, for keep-alive
3075 * processing. Note, we delay getting the time until now in the hope that
3076 * the packet will be delivered to the user before any get time is required
3077 * (if not, then the time won't actually be re-evaluated here). */
3078 call->lastReceiveTime = clock_Sec();
3079 MUTEX_EXIT(&call->lock);
3080 MUTEX_ENTER(&conn->conn_data_lock);
3082 MUTEX_EXIT(&conn->conn_data_lock);
3086 /* return true if this is an "interesting" connection from the point of view
3087 of someone trying to debug the system */
3089 rxi_IsConnInteresting(struct rx_connection *aconn)
3092 struct rx_call *tcall;
3094 if (aconn->flags & (RX_CONN_MAKECALL_WAITING | RX_CONN_DESTROY_ME))
3096 for (i = 0; i < RX_MAXCALLS; i++) {
3097 tcall = aconn->call[i];
3099 if ((tcall->state == RX_STATE_PRECALL)
3100 || (tcall->state == RX_STATE_ACTIVE))
3102 if ((tcall->mode == RX_MODE_SENDING)
3103 || (tcall->mode == RX_MODE_RECEIVING))
3111 /* if this is one of the last few packets AND it wouldn't be used by the
3112 receiving call to immediately satisfy a read request, then drop it on
3113 the floor, since accepting it might prevent a lock-holding thread from
3114 making progress in its reading. If a call has been cleared while in
3115 the precall state then ignore all subsequent packets until the call
3116 is assigned to a thread. */
3119 TooLow(struct rx_packet *ap, struct rx_call *acall)
3123 MUTEX_ENTER(&rx_quota_mutex);
3124 if (((ap->header.seq != 1) && (acall->flags & RX_CALL_CLEARED)
3125 && (acall->state == RX_STATE_PRECALL))
3126 || ((rx_nFreePackets < rxi_dataQuota + 2)
3127 && !((ap->header.seq < acall->rnext + rx_initSendWindow)
3128 && (acall->flags & RX_CALL_READER_WAIT)))) {
3131 MUTEX_EXIT(&rx_quota_mutex);
3137 rxi_CheckReachEvent(struct rxevent *event, void *arg1, void *arg2)
3139 struct rx_connection *conn = arg1;
3140 struct rx_call *acall = arg2;
3141 struct rx_call *call = acall;
3142 struct clock when, now;
3145 MUTEX_ENTER(&conn->conn_data_lock);
3146 conn->checkReachEvent = NULL;
3147 waiting = conn->flags & RX_CONN_ATTACHWAIT;
3150 MUTEX_EXIT(&conn->conn_data_lock);
3154 MUTEX_ENTER(&conn->conn_call_lock);
3155 MUTEX_ENTER(&conn->conn_data_lock);
3156 for (i = 0; i < RX_MAXCALLS; i++) {
3157 struct rx_call *tc = conn->call[i];
3158 if (tc && tc->state == RX_STATE_PRECALL) {
3164 /* Indicate that rxi_CheckReachEvent is no longer running by
3165 * clearing the flag. Must be atomic under conn_data_lock to
3166 * avoid a new call slipping by: rxi_CheckConnReach holds
3167 * conn_data_lock while checking RX_CONN_ATTACHWAIT.
3169 conn->flags &= ~RX_CONN_ATTACHWAIT;
3170 MUTEX_EXIT(&conn->conn_data_lock);
3171 MUTEX_EXIT(&conn->conn_call_lock);
3176 MUTEX_ENTER(&call->lock);
3177 rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
3179 MUTEX_EXIT(&call->lock);
3181 clock_GetTime(&now);
3183 when.sec += RX_CHECKREACH_TIMEOUT;
3184 MUTEX_ENTER(&conn->conn_data_lock);
3185 if (!conn->checkReachEvent) {
3187 conn->checkReachEvent =
3188 rxevent_PostNow(&when, &now, rxi_CheckReachEvent, conn,
3191 MUTEX_EXIT(&conn->conn_data_lock);
3197 rxi_CheckConnReach(struct rx_connection *conn, struct rx_call *call)
3199 struct rx_service *service = conn->service;
3200 struct rx_peer *peer = conn->peer;
3201 afs_uint32 now, lastReach;
3203 if (service->checkReach == 0)
3207 MUTEX_ENTER(&peer->peer_lock);
3208 lastReach = peer->lastReachTime;
3209 MUTEX_EXIT(&peer->peer_lock);
3210 if (now - lastReach < RX_CHECKREACH_TTL)
3213 MUTEX_ENTER(&conn->conn_data_lock);
3214 if (conn->flags & RX_CONN_ATTACHWAIT) {
3215 MUTEX_EXIT(&conn->conn_data_lock);
3218 conn->flags |= RX_CONN_ATTACHWAIT;
3219 MUTEX_EXIT(&conn->conn_data_lock);
3220 if (!conn->checkReachEvent)
3221 rxi_CheckReachEvent(NULL, conn, call);
3226 /* try to attach call, if authentication is complete */
3228 TryAttach(struct rx_call *acall, osi_socket socket,
3229 int *tnop, struct rx_call **newcallp,
3232 struct rx_connection *conn = acall->conn;
3234 if (conn->type == RX_SERVER_CONNECTION
3235 && acall->state == RX_STATE_PRECALL) {
3236 /* Don't attach until we have any req'd. authentication. */
3237 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0) {
3238 if (reachOverride || rxi_CheckConnReach(conn, acall) == 0)
3239 rxi_AttachServerProc(acall, socket, tnop, newcallp);
3240 /* Note: this does not necessarily succeed; there
3241 * may not any proc available
3244 rxi_ChallengeOn(acall->conn);
3249 /* A data packet has been received off the interface. This packet is
3250 * appropriate to the call (the call is in the right state, etc.). This
3251 * routine can return a packet to the caller, for re-use */
3254 rxi_ReceiveDataPacket(struct rx_call *call,
3255 struct rx_packet *np, int istack,
3256 osi_socket socket, afs_uint32 host, u_short port,
3257 int *tnop, struct rx_call **newcallp)
3259 int ackNeeded = 0; /* 0 means no, otherwise ack_reason */
3264 afs_uint32 serial=0, flags=0;
3266 struct rx_packet *tnp;
3267 struct clock when, now;
3268 if (rx_stats_active)
3269 rx_MutexIncrement(rx_stats.dataPacketsRead, rx_stats_mutex);
3272 /* If there are no packet buffers, drop this new packet, unless we can find
3273 * packet buffers from inactive calls */
3275 && (rxi_OverQuota(RX_PACKET_CLASS_RECEIVE) || TooLow(np, call))) {
3276 MUTEX_ENTER(&rx_freePktQ_lock);
3277 rxi_NeedMorePackets = TRUE;
3278 MUTEX_EXIT(&rx_freePktQ_lock);
3279 if (rx_stats_active)
3280 rx_MutexIncrement(rx_stats.noPacketBuffersOnRead, rx_stats_mutex);
3281 call->rprev = np->header.serial;
3282 rxi_calltrace(RX_TRACE_DROP, call);
3283 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - quota problems", np));
3285 rxi_ClearReceiveQueue(call);
3286 clock_GetTime(&now);
3288 clock_Add(&when, &rx_softAckDelay);
3289 if (!call->delayedAckEvent
3290 || clock_Gt(&call->delayedAckEvent->eventTime, &when)) {
3291 rxevent_Cancel(call->delayedAckEvent, call,
3292 RX_CALL_REFCOUNT_DELAY);
3293 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
3294 call->delayedAckEvent =
3295 rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
3297 /* we've damaged this call already, might as well do it in. */
3303 * New in AFS 3.5, if the RX_JUMBO_PACKET flag is set then this
3304 * packet is one of several packets transmitted as a single
3305 * datagram. Do not send any soft or hard acks until all packets
3306 * in a jumbogram have been processed. Send negative acks right away.
3308 for (isFirst = 1, tnp = NULL; isFirst || tnp; isFirst = 0) {
3309 /* tnp is non-null when there are more packets in the
3310 * current jumbo gram */
3317 seq = np->header.seq;
3318 serial = np->header.serial;
3319 flags = np->header.flags;
3321 /* If the call is in an error state, send an abort message */
3323 return rxi_SendCallAbort(call, np, istack, 0);
3325 /* The RX_JUMBO_PACKET is set in all but the last packet in each
3326 * AFS 3.5 jumbogram. */
3327 if (flags & RX_JUMBO_PACKET) {
3328 tnp = rxi_SplitJumboPacket(np, host, port, isFirst);
3333 if (np->header.spare != 0) {
3334 MUTEX_ENTER(&call->conn->conn_data_lock);
3335 call->conn->flags |= RX_CONN_USING_PACKET_CKSUM;
3336 MUTEX_EXIT(&call->conn->conn_data_lock);
3339 /* The usual case is that this is the expected next packet */
3340 if (seq == call->rnext) {
3342 /* Check to make sure it is not a duplicate of one already queued */
3343 if (queue_IsNotEmpty(&call->rq)
3344 && queue_First(&call->rq, rx_packet)->header.seq == seq) {
3345 if (rx_stats_active)
3346 rx_MutexIncrement(rx_stats.dupPacketsRead, rx_stats_mutex);
3347 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - duplicate", np));
3348 rxevent_Cancel(call->delayedAckEvent, call,
3349 RX_CALL_REFCOUNT_DELAY);
3350 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3356 /* It's the next packet. Stick it on the receive queue
3357 * for this call. Set newPackets to make sure we wake
3358 * the reader once all packets have been processed */
3359 np->flags |= RX_PKTFLAG_RQ;
3360 queue_Prepend(&call->rq, np);
3361 #ifdef RXDEBUG_PACKET
3363 #endif /* RXDEBUG_PACKET */
3365 np = NULL; /* We can't use this anymore */
3368 /* If an ack is requested then set a flag to make sure we
3369 * send an acknowledgement for this packet */
3370 if (flags & RX_REQUEST_ACK) {
3371 ackNeeded = RX_ACK_REQUESTED;
3374 /* Keep track of whether we have received the last packet */
3375 if (flags & RX_LAST_PACKET) {
3376 call->flags |= RX_CALL_HAVE_LAST;
3380 /* Check whether we have all of the packets for this call */
3381 if (call->flags & RX_CALL_HAVE_LAST) {
3382 afs_uint32 tseq; /* temporary sequence number */
3383 struct rx_packet *tp; /* Temporary packet pointer */
3384 struct rx_packet *nxp; /* Next pointer, for queue_Scan */
3386 for (tseq = seq, queue_Scan(&call->rq, tp, nxp, rx_packet)) {
3387 if (tseq != tp->header.seq)
3389 if (tp->header.flags & RX_LAST_PACKET) {
3390 call->flags |= RX_CALL_RECEIVE_DONE;
3397 /* Provide asynchronous notification for those who want it
3398 * (e.g. multi rx) */
3399 if (call->arrivalProc) {
3400 (*call->arrivalProc) (call, call->arrivalProcHandle,
3401 call->arrivalProcArg);
3402 call->arrivalProc = (void (*)())0;
3405 /* Update last packet received */
3408 /* If there is no server process serving this call, grab
3409 * one, if available. We only need to do this once. If a
3410 * server thread is available, this thread becomes a server
3411 * thread and the server thread becomes a listener thread. */
3413 TryAttach(call, socket, tnop, newcallp, 0);
3416 /* This is not the expected next packet. */
3418 /* Determine whether this is a new or old packet, and if it's
3419 * a new one, whether it fits into the current receive window.
3420 * Also figure out whether the packet was delivered in sequence.
3421 * We use the prev variable to determine whether the new packet
3422 * is the successor of its immediate predecessor in the
3423 * receive queue, and the missing flag to determine whether
3424 * any of this packets predecessors are missing. */
3426 afs_uint32 prev; /* "Previous packet" sequence number */
3427 struct rx_packet *tp; /* Temporary packet pointer */
3428 struct rx_packet *nxp; /* Next pointer, for queue_Scan */
3429 int missing; /* Are any predecessors missing? */
3431 /* If the new packet's sequence number has been sent to the
3432 * application already, then this is a duplicate */
3433 if (seq < call->rnext) {
3434 if (rx_stats_active)
3435 rx_MutexIncrement(rx_stats.dupPacketsRead, rx_stats_mutex);
3436 rxevent_Cancel(call->delayedAckEvent, call,
3437 RX_CALL_REFCOUNT_DELAY);
3438 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3444 /* If the sequence number is greater than what can be
3445 * accomodated by the current window, then send a negative
3446 * acknowledge and drop the packet */
3447 if ((call->rnext + call->rwind) <= seq) {
3448 rxevent_Cancel(call->delayedAckEvent, call,
3449 RX_CALL_REFCOUNT_DELAY);
3450 np = rxi_SendAck(call, np, serial, RX_ACK_EXCEEDS_WINDOW,
3457 /* Look for the packet in the queue of old received packets */
3458 for (prev = call->rnext - 1, missing =
3459 0, queue_Scan(&call->rq, tp, nxp, rx_packet)) {
3460 /*Check for duplicate packet */
3461 if (seq == tp->header.seq) {
3462 if (rx_stats_active)
3463 rx_MutexIncrement(rx_stats.dupPacketsRead, rx_stats_mutex);
3464 rxevent_Cancel(call->delayedAckEvent, call,
3465 RX_CALL_REFCOUNT_DELAY);
3466 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE,
3472 /* If we find a higher sequence packet, break out and
3473 * insert the new packet here. */
3474 if (seq < tp->header.seq)
3476 /* Check for missing packet */
3477 if (tp->header.seq != prev + 1) {
3481 prev = tp->header.seq;
3484 /* Keep track of whether we have received the last packet. */
3485 if (flags & RX_LAST_PACKET) {
3486 call->flags |= RX_CALL_HAVE_LAST;
3489 /* It's within the window: add it to the the receive queue.
3490 * tp is left by the previous loop either pointing at the
3491 * packet before which to insert the new packet, or at the
3492 * queue head if the queue is empty or the packet should be
3494 np->flags |= RX_PKTFLAG_RQ;
3495 #ifdef RXDEBUG_PACKET
3497 #endif /* RXDEBUG_PACKET */
3498 queue_InsertBefore(tp, np);
3502 /* Check whether we have all of the packets for this call */
3503 if ((call->flags & RX_CALL_HAVE_LAST)
3504 && !(call->flags & RX_CALL_RECEIVE_DONE)) {
3505 afs_uint32 tseq; /* temporary sequence number */
3508 call->rnext, queue_Scan(&call->rq, tp, nxp, rx_packet)) {
3509 if (tseq != tp->header.seq)
3511 if (tp->header.flags & RX_LAST_PACKET) {
3512 call->flags |= RX_CALL_RECEIVE_DONE;
3519 /* We need to send an ack of the packet is out of sequence,
3520 * or if an ack was requested by the peer. */
3521 if (seq != prev + 1 || missing) {
3522 ackNeeded = RX_ACK_OUT_OF_SEQUENCE;
3523 } else if (flags & RX_REQUEST_ACK) {
3524 ackNeeded = RX_ACK_REQUESTED;
3527 /* Acknowledge the last packet for each call */
3528 if (flags & RX_LAST_PACKET) {
3539 * If the receiver is waiting for an iovec, fill the iovec
3540 * using the data from the receive queue */
3541 if (call->flags & RX_CALL_IOVEC_WAIT) {
3542 didHardAck = rxi_FillReadVec(call, serial);
3543 /* the call may have been aborted */
3552 /* Wakeup the reader if any */
3553 if ((call->flags & RX_CALL_READER_WAIT)
3554 && (!(call->flags & RX_CALL_IOVEC_WAIT) || !(call->iovNBytes)
3555 || (call->iovNext >= call->iovMax)
3556 || (call->flags & RX_CALL_RECEIVE_DONE))) {
3557 call->flags &= ~RX_CALL_READER_WAIT;
3558 #ifdef RX_ENABLE_LOCKS
3559 CV_BROADCAST(&call->cv_rq);
3561 osi_rxWakeup(&call->rq);
3567 * Send an ack when requested by the peer, or once every
3568 * rxi_SoftAckRate packets until the last packet has been
3569 * received. Always send a soft ack for the last packet in
3570 * the server's reply. */
3572 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
3573 np = rxi_SendAck(call, np, serial, ackNeeded, istack);
3574 } else if (call->nSoftAcks > (u_short) rxi_SoftAckRate) {
3575 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
3576 np = rxi_SendAck(call, np, serial, RX_ACK_IDLE, istack);
3577 } else if (call->nSoftAcks) {
3578 clock_GetTime(&now);
3580 if (haveLast && !(flags & RX_CLIENT_INITIATED)) {
3581 clock_Add(&when, &rx_lastAckDelay);
3583 clock_Add(&when, &rx_softAckDelay);
3585 if (!call->delayedAckEvent
3586 || clock_Gt(&call->delayedAckEvent->eventTime, &when)) {
3587 rxevent_Cancel(call->delayedAckEvent, call,
3588 RX_CALL_REFCOUNT_DELAY);
3589 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
3590 call->delayedAckEvent =
3591 rxevent_PostNow(&when, &now, rxi_SendDelayedAck, call, 0);
3593 } else if (call->flags & RX_CALL_RECEIVE_DONE) {
3594 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
3601 static void rxi_ComputeRate();
3605 rxi_UpdatePeerReach(struct rx_connection *conn, struct rx_call *acall)
3607 struct rx_peer *peer = conn->peer;
3609 MUTEX_ENTER(&peer->peer_lock);
3610 peer->lastReachTime = clock_Sec();
3611 MUTEX_EXIT(&peer->peer_lock);
3613 MUTEX_ENTER(&conn->conn_data_lock);
3614 if (conn->flags & RX_CONN_ATTACHWAIT) {
3617 conn->flags &= ~RX_CONN_ATTACHWAIT;
3618 MUTEX_EXIT(&conn->conn_data_lock);
3620 for (i = 0; i < RX_MAXCALLS; i++) {
3621 struct rx_call *call = conn->call[i];
3624 MUTEX_ENTER(&call->lock);
3625 /* tnop can be null if newcallp is null */
3626 TryAttach(call, (osi_socket) - 1, NULL, NULL, 1);
3628 MUTEX_EXIT(&call->lock);
3632 MUTEX_EXIT(&conn->conn_data_lock);
3635 #if defined(RXDEBUG) && defined(AFS_NT40_ENV)
3637 rx_ack_reason(int reason)
3640 case RX_ACK_REQUESTED:
3642 case RX_ACK_DUPLICATE:
3644 case RX_ACK_OUT_OF_SEQUENCE:
3646 case RX_ACK_EXCEEDS_WINDOW:
3648 case RX_ACK_NOSPACE:
3652 case RX_ACK_PING_RESPONSE:
3665 /* rxi_ComputePeerNetStats
3667 * Called exclusively by rxi_ReceiveAckPacket to compute network link
3668 * estimates (like RTT and throughput) based on ack packets. Caller
3669 * must ensure that the packet in question is the right one (i.e.
3670 * serial number matches).
3673 rxi_ComputePeerNetStats(struct rx_call *call, struct rx_packet *p,
3674 struct rx_ackPacket *ap, struct rx_packet *np)
3676 struct rx_peer *peer = call->conn->peer;
3678 /* Use RTT if not delayed by client and
3679 * ignore packets that were retransmitted. */
3680 if (!(p->flags & RX_PKTFLAG_ACKED) &&
3681 ap->reason != RX_ACK_DELAY &&
3682 clock_Eq(&p->timeSent, &p->firstSent))
3683 rxi_ComputeRoundTripTime(p, &p->timeSent, peer);
3685 rxi_ComputeRate(peer, call, p, np, ap->reason);
3689 /* The real smarts of the whole thing. */
3691 rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
3694 struct rx_ackPacket *ap;
3696 struct rx_packet *tp;
3697 struct rx_packet *nxp; /* Next packet pointer for queue_Scan */
3698 struct rx_connection *conn = call->conn;
3699 struct rx_peer *peer = conn->peer;
3702 /* because there are CM's that are bogus, sending weird values for this. */
3703 afs_uint32 skew = 0;
3709 int newAckCount = 0;
3710 u_short maxMTU = 0; /* Set if peer supports AFS 3.4a jumbo datagrams */
3711 int maxDgramPackets = 0; /* Set if peer supports AFS 3.5 jumbo datagrams */
3713 if (rx_stats_active)
3714 rx_MutexIncrement(rx_stats.ackPacketsRead, rx_stats_mutex);
3715 ap = (struct rx_ackPacket *)rx_DataOf(np);
3716 nbytes = rx_Contiguous(np) - (int)((ap->acks) - (u_char *) ap);
3718 return np; /* truncated ack packet */
3720 /* depends on ack packet struct */
3721 nAcks = MIN((unsigned)nbytes, (unsigned)ap->nAcks);
3722 first = ntohl(ap->firstPacket);
3723 serial = ntohl(ap->serial);
3724 /* temporarily disabled -- needs to degrade over time
3725 * skew = ntohs(ap->maxSkew); */
3727 /* Ignore ack packets received out of order */
3728 if (first < call->tfirst) {
3732 if (np->header.flags & RX_SLOW_START_OK) {
3733 call->flags |= RX_CALL_SLOW_START_OK;
3736 if (ap->reason == RX_ACK_PING_RESPONSE)
3737 rxi_UpdatePeerReach(conn, call);
3741 if (rxdebug_active) {
3745 len = _snprintf(msg, sizeof(msg),
3746 "tid[%d] RACK: reason %s serial %u previous %u seq %u skew %d first %u acks %u space %u ",
3747 GetCurrentThreadId(), rx_ack_reason(ap->reason),
3748 ntohl(ap->serial), ntohl(ap->previousPacket),
3749 (unsigned int)np->header.seq, (unsigned int)skew,
3750 ntohl(ap->firstPacket), ap->nAcks, ntohs(ap->bufferSpace) );
3754 for (offset = 0; offset < nAcks && len < sizeof(msg); offset++)
3755 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
3759 OutputDebugString(msg);
3761 #else /* AFS_NT40_ENV */
3764 "RACK: reason %x previous %u seq %u serial %u skew %d first %u",
3765 ap->reason, ntohl(ap->previousPacket),
3766 (unsigned int)np->header.seq, (unsigned int)serial,
3767 (unsigned int)skew, ntohl(ap->firstPacket));
3770 for (offset = 0; offset < nAcks; offset++)
3771 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
3776 #endif /* AFS_NT40_ENV */
3779 /* Update the outgoing packet skew value to the latest value of
3780 * the peer's incoming packet skew value. The ack packet, of
3781 * course, could arrive out of order, but that won't affect things
3783 MUTEX_ENTER(&peer->peer_lock);
3784 peer->outPacketSkew = skew;
3786 /* Check for packets that no longer need to be transmitted, and
3787 * discard them. This only applies to packets positively
3788 * acknowledged as having been sent to the peer's upper level.
3789 * All other packets must be retained. So only packets with
3790 * sequence numbers < ap->firstPacket are candidates. */
3791 for (queue_Scan(&call->tq, tp, nxp, rx_packet)) {
3792 if (tp->header.seq >= first)
3794 call->tfirst = tp->header.seq + 1;
3795 rxi_ComputePeerNetStats(call, tp, ap, np);
3796 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
3799 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
3800 /* XXX Hack. Because we have to release the global rx lock when sending
3801 * packets (osi_NetSend) we drop all acks while we're traversing the tq
3802 * in rxi_Start sending packets out because packets may move to the
3803 * freePacketQueue as result of being here! So we drop these packets until
3804 * we're safely out of the traversing. Really ugly!
3805 * To make it even uglier, if we're using fine grain locking, we can
3806 * set the ack bits in the packets and have rxi_Start remove the packets
3807 * when it's done transmitting.
3809 if (call->flags & RX_CALL_TQ_BUSY) {
3810 #ifdef RX_ENABLE_LOCKS
3811 tp->flags |= RX_PKTFLAG_ACKED;
3812 call->flags |= RX_CALL_TQ_SOME_ACKED;
3813 #else /* RX_ENABLE_LOCKS */
3815 #endif /* RX_ENABLE_LOCKS */
3817 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3820 tp->flags &= ~RX_PKTFLAG_TQ;
3821 #ifdef RXDEBUG_PACKET
3823 #endif /* RXDEBUG_PACKET */
3824 rxi_FreePacket(tp); /* rxi_FreePacket mustn't wake up anyone, preemptively. */
3829 /* Give rate detector a chance to respond to ping requests */
3830 if (ap->reason == RX_ACK_PING_RESPONSE) {
3831 rxi_ComputeRate(peer, call, 0, np, ap->reason);
3835 /* N.B. we don't turn off any timers here. They'll go away by themselves, anyway */
3837 /* Now go through explicit acks/nacks and record the results in
3838 * the waiting packets. These are packets that can't be released
3839 * yet, even with a positive acknowledge. This positive
3840 * acknowledge only means the packet has been received by the
3841 * peer, not that it will be retained long enough to be sent to
3842 * the peer's upper level. In addition, reset the transmit timers
3843 * of any missing packets (those packets that must be missing
3844 * because this packet was out of sequence) */
3846 call->nSoftAcked = 0;
3847 for (missing = 0, queue_Scan(&call->tq, tp, nxp, rx_packet)) {
3848 /* Update round trip time if the ack was stimulated on receipt
3850 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
3851 #ifdef RX_ENABLE_LOCKS
3852 if (tp->header.seq >= first)
3853 #endif /* RX_ENABLE_LOCKS */
3854 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
3855 rxi_ComputePeerNetStats(call, tp, ap, np);
3857 /* Set the acknowledge flag per packet based on the
3858 * information in the ack packet. An acknowlegded packet can
3859 * be downgraded when the server has discarded a packet it
3860 * soacked previously, or when an ack packet is received
3861 * out of sequence. */
3862 if (tp->header.seq < first) {
3863 /* Implicit ack information */
3864 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
3867 tp->flags |= RX_PKTFLAG_ACKED;
3868 } else if (tp->header.seq < first + nAcks) {
3869 /* Explicit ack information: set it in the packet appropriately */
3870 if (ap->acks[tp->header.seq - first] == RX_ACK_TYPE_ACK) {
3871 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
3873 tp->flags |= RX_PKTFLAG_ACKED;
3880 } else /* RX_ACK_TYPE_NACK */ {
3881 tp->flags &= ~RX_PKTFLAG_ACKED;
3885 tp->flags &= ~RX_PKTFLAG_ACKED;
3890 * Following the suggestion of Phil Kern, we back off the peer's
3891 * timeout value for future packets until a successful response
3892 * is received for an initial transmission.
3894 if (missing && !backedOff) {
3895 struct clock c = peer->timeout;
3896 struct clock max_to = {3, 0};
3898 clock_Add(&peer->timeout, &c);
3899 if (clock_Gt(&peer->timeout, &max_to))
3900 peer->timeout = max_to;
3904 /* If packet isn't yet acked, and it has been transmitted at least
3905 * once, reset retransmit time using latest timeout
3906 * ie, this should readjust the retransmit timer for all outstanding
3907 * packets... So we don't just retransmit when we should know better*/
3909 if (!(tp->flags & RX_PKTFLAG_ACKED) && !clock_IsZero(&tp->retryTime)) {
3910 tp->retryTime = tp->timeSent;
3911 clock_Add(&tp->retryTime, &peer->timeout);
3912 /* shift by eight because one quarter-sec ~ 256 milliseconds */
3913 clock_Addmsec(&(tp->retryTime), ((afs_uint32) tp->backoff) << 8);
3917 /* If the window has been extended by this acknowledge packet,
3918 * then wakeup a sender waiting in alloc for window space, or try
3919 * sending packets now, if he's been sitting on packets due to
3920 * lack of window space */
3921 if (call->tnext < (call->tfirst + call->twind)) {
3922 #ifdef RX_ENABLE_LOCKS
3923 CV_SIGNAL(&call->cv_twind);
3925 if (call->flags & RX_CALL_WAIT_WINDOW_ALLOC) {
3926 call->flags &= ~RX_CALL_WAIT_WINDOW_ALLOC;
3927 osi_rxWakeup(&call->twind);
3930 if (call->flags & RX_CALL_WAIT_WINDOW_SEND) {
3931 call->flags &= ~RX_CALL_WAIT_WINDOW_SEND;
3935 /* if the ack packet has a receivelen field hanging off it,
3936 * update our state */
3937 if (np->length >= rx_AckDataSize(ap->nAcks) + 2 * sizeof(afs_int32)) {
3940 /* If the ack packet has a "recommended" size that is less than
3941 * what I am using now, reduce my size to match */
3942 rx_packetread(np, rx_AckDataSize(ap->nAcks) + (int)sizeof(afs_int32),
3943 (int)sizeof(afs_int32), &tSize);
3944 tSize = (afs_uint32) ntohl(tSize);
3945 peer->natMTU = rxi_AdjustIfMTU(MIN(tSize, peer->ifMTU));
3947 /* Get the maximum packet size to send to this peer */
3948 rx_packetread(np, rx_AckDataSize(ap->nAcks), (int)sizeof(afs_int32),
3950 tSize = (afs_uint32) ntohl(tSize);
3951 tSize = (afs_uint32) MIN(tSize, rx_MyMaxSendSize);
3952 tSize = rxi_AdjustMaxMTU(peer->natMTU, tSize);
3954 /* sanity check - peer might have restarted with different params.
3955 * If peer says "send less", dammit, send less... Peer should never
3956 * be unable to accept packets of the size that prior AFS versions would
3957 * send without asking. */
3958 if (peer->maxMTU != tSize) {
3959 if (peer->maxMTU > tSize) /* possible cong., maxMTU decreased */
3961 peer->maxMTU = tSize;
3962 peer->MTU = MIN(tSize, peer->MTU);
3963 call->MTU = MIN(call->MTU, tSize);
3966 if (np->length == rx_AckDataSize(ap->nAcks) + 3 * sizeof(afs_int32)) {
3969 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
3970 (int)sizeof(afs_int32), &tSize);
3971 tSize = (afs_uint32) ntohl(tSize); /* peer's receive window, if it's */
3972 if (tSize < call->twind) { /* smaller than our send */
3973 call->twind = tSize; /* window, we must send less... */
3974 call->ssthresh = MIN(call->twind, call->ssthresh);
3975 call->conn->twind[call->channel] = call->twind;
3978 /* Only send jumbograms to 3.4a fileservers. 3.3a RX gets the
3979 * network MTU confused with the loopback MTU. Calculate the
3980 * maximum MTU here for use in the slow start code below.
3982 maxMTU = peer->maxMTU;
3983 /* Did peer restart with older RX version? */
3984 if (peer->maxDgramPackets > 1) {
3985 peer->maxDgramPackets = 1;
3987 } else if (np->length >=
3988 rx_AckDataSize(ap->nAcks) + 4 * sizeof(afs_int32)) {
3991 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
3992 sizeof(afs_int32), &tSize);
3993 tSize = (afs_uint32) ntohl(tSize);
3995 * As of AFS 3.5 we set the send window to match the receive window.
3997 if (tSize < call->twind) {
3998 call->twind = tSize;
3999 call->conn->twind[call->channel] = call->twind;
4000 call->ssthresh = MIN(call->twind, call->ssthresh);
4001 } else if (tSize > call->twind) {
4002 call->twind = tSize;
4003 call->conn->twind[call->channel] = call->twind;
4007 * As of AFS 3.5, a jumbogram is more than one fixed size
4008 * packet transmitted in a single UDP datagram. If the remote
4009 * MTU is smaller than our local MTU then never send a datagram
4010 * larger than the natural MTU.
4013 rx_AckDataSize(ap->nAcks) + 3 * (int)sizeof(afs_int32),
4014 (int)sizeof(afs_int32), &tSize);
4015 maxDgramPackets = (afs_uint32) ntohl(tSize);
4016 maxDgramPackets = MIN(maxDgramPackets, rxi_nDgramPackets);
4018 MIN(maxDgramPackets, (int)(peer->ifDgramPackets));
4019 maxDgramPackets = MIN(maxDgramPackets, tSize);
4020 if (maxDgramPackets > 1) {
4021 peer->maxDgramPackets = maxDgramPackets;
4022 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
4024 peer->maxDgramPackets = 1;
4025 call->MTU = peer->natMTU;
4027 } else if (peer->maxDgramPackets > 1) {
4028 /* Restarted with lower version of RX */
4029 peer->maxDgramPackets = 1;
4031 } else if (peer->maxDgramPackets > 1
4032 || peer->maxMTU != OLD_MAX_PACKET_SIZE) {
4033 /* Restarted with lower version of RX */
4034 peer->maxMTU = OLD_MAX_PACKET_SIZE;
4035 peer->natMTU = OLD_MAX_PACKET_SIZE;
4036 peer->MTU = OLD_MAX_PACKET_SIZE;
4037 peer->maxDgramPackets = 1;
4038 peer->nDgramPackets = 1;
4040 call->MTU = OLD_MAX_PACKET_SIZE;
4045 * Calculate how many datagrams were successfully received after
4046 * the first missing packet and adjust the negative ack counter
4051 nNacked = (nNacked + call->nDgramPackets - 1) / call->nDgramPackets;
4052 if (call->nNacks < nNacked) {
4053 call->nNacks = nNacked;
4056 call->nAcks += newAckCount;
4060 if (call->flags & RX_CALL_FAST_RECOVER) {
4062 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4064 call->flags &= ~RX_CALL_FAST_RECOVER;
4065 call->cwind = call->nextCwind;
4066 call->nextCwind = 0;
4069 call->nCwindAcks = 0;
4070 } else if (nNacked && call->nNacks >= (u_short) rx_nackThreshold) {
4071 /* Three negative acks in a row trigger congestion recovery */
4072 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
4073 MUTEX_EXIT(&peer->peer_lock);
4074 if (call->flags & RX_CALL_FAST_RECOVER_WAIT) {
4075 /* someone else is waiting to start recovery */
4078 call->flags |= RX_CALL_FAST_RECOVER_WAIT;
4079 rxi_WaitforTQBusy(call);
4080 MUTEX_ENTER(&peer->peer_lock);
4081 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4082 call->flags &= ~RX_CALL_FAST_RECOVER_WAIT;
4083 call->flags |= RX_CALL_FAST_RECOVER;
4084 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
4086 MIN((int)(call->ssthresh + rx_nackThreshold), rx_maxSendWindow);
4087 call->nDgramPackets = MAX(2, (int)call->nDgramPackets) >> 1;
4088 call->nextCwind = call->ssthresh;
4091 peer->MTU = call->MTU;
4092 peer->cwind = call->nextCwind;
4093 peer->nDgramPackets = call->nDgramPackets;
4095 call->congestSeq = peer->congestSeq;
4096 /* Reset the resend times on the packets that were nacked
4097 * so we will retransmit as soon as the window permits*/
4098 for (acked = 0, queue_ScanBackwards(&call->tq, tp, nxp, rx_packet)) {
4100 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4101 clock_Zero(&tp->retryTime);
4103 } else if (tp->flags & RX_PKTFLAG_ACKED) {
4108 /* If cwind is smaller than ssthresh, then increase
4109 * the window one packet for each ack we receive (exponential
4111 * If cwind is greater than or equal to ssthresh then increase
4112 * the congestion window by one packet for each cwind acks we
4113 * receive (linear growth). */
4114 if (call->cwind < call->ssthresh) {
4116 MIN((int)call->ssthresh, (int)(call->cwind + newAckCount));
4117 call->nCwindAcks = 0;
4119 call->nCwindAcks += newAckCount;
4120 if (call->nCwindAcks >= call->cwind) {
4121 call->nCwindAcks = 0;
4122 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4126 * If we have received several acknowledgements in a row then
4127 * it is time to increase the size of our datagrams
4129 if ((int)call->nAcks > rx_nDgramThreshold) {
4130 if (peer->maxDgramPackets > 1) {
4131 if (call->nDgramPackets < peer->maxDgramPackets) {
4132 call->nDgramPackets++;
4134 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
4135 } else if (call->MTU < peer->maxMTU) {
4136 call->MTU += peer->natMTU;
4137 call->MTU = MIN(call->MTU, peer->maxMTU);
4143 MUTEX_EXIT(&peer->peer_lock); /* rxi_Start will lock peer. */
4145 /* Servers need to hold the call until all response packets have
4146 * been acknowledged. Soft acks are good enough since clients
4147 * are not allowed to clear their receive queues. */
4148 if (call->state == RX_STATE_HOLD
4149 && call->tfirst + call->nSoftAcked >= call->tnext) {
4150 call->state = RX_STATE_DALLY;
4151 rxi_ClearTransmitQueue(call, 0);
4152 rxevent_Cancel(call->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE);
4153 } else if (!queue_IsEmpty(&call->tq)) {
4154 rxi_Start(0, call, 0, istack);
4159 /* Received a response to a challenge packet */
4161 rxi_ReceiveResponsePacket(struct rx_connection *conn,
4162 struct rx_packet *np, int istack)
4166 /* Ignore the packet if we're the client */
4167 if (conn->type == RX_CLIENT_CONNECTION)
4170 /* If already authenticated, ignore the packet (it's probably a retry) */
4171 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0)
4174 /* Otherwise, have the security object evaluate the response packet */
4175 error = RXS_CheckResponse(conn->securityObject, conn, np);
4177 /* If the response is invalid, reset the connection, sending
4178 * an abort to the peer */
4182 rxi_ConnectionError(conn, error);
4183 MUTEX_ENTER(&conn->conn_data_lock);
4184 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4185 MUTEX_EXIT(&conn->conn_data_lock);
4188 /* If the response is valid, any calls waiting to attach
4189 * servers can now do so */
4192 for (i = 0; i < RX_MAXCALLS; i++) {
4193 struct rx_call *call = conn->call[i];
4195 MUTEX_ENTER(&call->lock);
4196 if (call->state == RX_STATE_PRECALL)
4197 rxi_AttachServerProc(call, (osi_socket) - 1, NULL, NULL);
4198 /* tnop can be null if newcallp is null */
4199 MUTEX_EXIT(&call->lock);
4203 /* Update the peer reachability information, just in case
4204 * some calls went into attach-wait while we were waiting
4205 * for authentication..
4207 rxi_UpdatePeerReach(conn, NULL);
4212 /* A client has received an authentication challenge: the security
4213 * object is asked to cough up a respectable response packet to send
4214 * back to the server. The server is responsible for retrying the
4215 * challenge if it fails to get a response. */
4218 rxi_ReceiveChallengePacket(struct rx_connection *conn,
4219 struct rx_packet *np, int istack)
4223 /* Ignore the challenge if we're the server */
4224 if (conn->type == RX_SERVER_CONNECTION)
4227 /* Ignore the challenge if the connection is otherwise idle; someone's
4228 * trying to use us as an oracle. */
4229 if (!rxi_HasActiveCalls(conn))
4232 /* Send the security object the challenge packet. It is expected to fill
4233 * in the response. */
4234 error = RXS_GetResponse(conn->securityObject, conn, np);
4236 /* If the security object is unable to return a valid response, reset the
4237 * connection and send an abort to the peer. Otherwise send the response
4238 * packet to the peer connection. */
4240 rxi_ConnectionError(conn, error);
4241 MUTEX_ENTER(&conn->conn_data_lock);
4242 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4243 MUTEX_EXIT(&conn->conn_data_lock);
4245 np = rxi_SendSpecial((struct rx_call *)0, conn, np,
4246 RX_PACKET_TYPE_RESPONSE, NULL, -1, istack);
4252 /* Find an available server process to service the current request in
4253 * the given call structure. If one isn't available, queue up this
4254 * call so it eventually gets one */
4256 rxi_AttachServerProc(struct rx_call *call,
4257 osi_socket socket, int *tnop,
4258 struct rx_call **newcallp)
4260 struct rx_serverQueueEntry *sq;
4261 struct rx_service *service = call->conn->service;
4264 /* May already be attached */
4265 if (call->state == RX_STATE_ACTIVE)
4268 MUTEX_ENTER(&rx_serverPool_lock);
4270 haveQuota = QuotaOK(service);
4271 if ((!haveQuota) || queue_IsEmpty(&rx_idleServerQueue)) {
4272 /* If there are no processes available to service this call,
4273 * put the call on the incoming call queue (unless it's
4274 * already on the queue).
4276 #ifdef RX_ENABLE_LOCKS
4278 ReturnToServerPool(service);
4279 #endif /* RX_ENABLE_LOCKS */
4281 if (!(call->flags & RX_CALL_WAIT_PROC)) {
4282 call->flags |= RX_CALL_WAIT_PROC;
4283 MUTEX_ENTER(&rx_waiting_mutex);
4286 MUTEX_EXIT(&rx_waiting_mutex);
4287 rxi_calltrace(RX_CALL_ARRIVAL, call);
4288 SET_CALL_QUEUE_LOCK(call, &rx_serverPool_lock);
4289 queue_Append(&rx_incomingCallQueue, call);
4292 sq = queue_First(&rx_idleServerQueue, rx_serverQueueEntry);
4294 /* If hot threads are enabled, and both newcallp and sq->socketp
4295 * are non-null, then this thread will process the call, and the
4296 * idle server thread will start listening on this threads socket.
4299 if (rx_enable_hot_thread && newcallp && sq->socketp) {
4302 *sq->socketp = socket;
4303 clock_GetTime(&call->startTime);
4304 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
4308 if (call->flags & RX_CALL_WAIT_PROC) {
4309 /* Conservative: I don't think this should happen */
4310 call->flags &= ~RX_CALL_WAIT_PROC;
4311 if (queue_IsOnQueue(call)) {
4314 MUTEX_ENTER(&rx_waiting_mutex);
4316 MUTEX_EXIT(&rx_waiting_mutex);
4319 call->state = RX_STATE_ACTIVE;
4320 call->mode = RX_MODE_RECEIVING;
4321 #ifdef RX_KERNEL_TRACE
4323 int glockOwner = ISAFS_GLOCK();
4326 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
4327 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
4333 if (call->flags & RX_CALL_CLEARED) {
4334 /* send an ack now to start the packet flow up again */
4335 call->flags &= ~RX_CALL_CLEARED;
4336 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4338 #ifdef RX_ENABLE_LOCKS
4341 service->nRequestsRunning++;
4342 if (service->nRequestsRunning <= service->minProcs)
4348 MUTEX_EXIT(&rx_serverPool_lock);
4351 /* Delay the sending of an acknowledge event for a short while, while
4352 * a new call is being prepared (in the case of a client) or a reply
4353 * is being prepared (in the case of a server). Rather than sending
4354 * an ack packet, an ACKALL packet is sent. */
4356 rxi_AckAll(struct rxevent *event, struct rx_call *call, char *dummy)
4358 #ifdef RX_ENABLE_LOCKS
4360 MUTEX_ENTER(&call->lock);
4361 call->delayedAckEvent = NULL;
4362 CALL_RELE(call, RX_CALL_REFCOUNT_ACKALL);
4364 rxi_SendSpecial(call, call->conn, (struct rx_packet *)0,
4365 RX_PACKET_TYPE_ACKALL, NULL, 0, 0);
4367 MUTEX_EXIT(&call->lock);
4368 #else /* RX_ENABLE_LOCKS */
4370 call->delayedAckEvent = NULL;
4371 rxi_SendSpecial(call, call->conn, (struct rx_packet *)0,
4372 RX_PACKET_TYPE_ACKALL, NULL, 0, 0);
4373 #endif /* RX_ENABLE_LOCKS */
4377 rxi_SendDelayedAck(struct rxevent *event, void *arg1, void *unused)
4379 struct rx_call *call = arg1;
4380 #ifdef RX_ENABLE_LOCKS
4382 MUTEX_ENTER(&call->lock);
4383 if (event == call->delayedAckEvent)
4384 call->delayedAckEvent = NULL;
4385 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
4387 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4389 MUTEX_EXIT(&call->lock);
4390 #else /* RX_ENABLE_LOCKS */
4392 call->delayedAckEvent = NULL;
4393 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4394 #endif /* RX_ENABLE_LOCKS */
4398 #ifdef RX_ENABLE_LOCKS
4399 /* Set ack in all packets in transmit queue. rxi_Start will deal with
4400 * clearing them out.
4403 rxi_SetAcksInTransmitQueue(struct rx_call *call)
4405 struct rx_packet *p, *tp;
4408 for (queue_Scan(&call->tq, p, tp, rx_packet)) {
4409 p->flags |= RX_PKTFLAG_ACKED;
4413 call->flags |= RX_CALL_TQ_CLEARME;
4414 call->flags |= RX_CALL_TQ_SOME_ACKED;
4417 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
4418 call->tfirst = call->tnext;
4419 call->nSoftAcked = 0;
4421 if (call->flags & RX_CALL_FAST_RECOVER) {
4422 call->flags &= ~RX_CALL_FAST_RECOVER;
4423 call->cwind = call->nextCwind;
4424 call->nextCwind = 0;
4427 CV_SIGNAL(&call->cv_twind);
4429 #endif /* RX_ENABLE_LOCKS */
4431 /* Clear out the transmit queue for the current call (all packets have
4432 * been received by peer) */
4434 rxi_ClearTransmitQueue(struct rx_call *call, int force)
4436 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
4437 struct rx_packet *p, *tp;
4439 if (!force && (call->flags & RX_CALL_TQ_BUSY)) {
4441 for (queue_Scan(&call->tq, p, tp, rx_packet)) {
4442 p->flags |= RX_PKTFLAG_ACKED;
4446 call->flags |= RX_CALL_TQ_CLEARME;
4447 call->flags |= RX_CALL_TQ_SOME_ACKED;
4450 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4451 #ifdef RXDEBUG_PACKET
4453 #endif /* RXDEBUG_PACKET */
4454 rxi_FreePackets(0, &call->tq);
4455 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
4456 call->flags &= ~RX_CALL_TQ_CLEARME;
4458 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4460 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
4461 call->tfirst = call->tnext; /* implicitly acknowledge all data already sent */
4462 call->nSoftAcked = 0;
4464 if (call->flags & RX_CALL_FAST_RECOVER) {
4465 call->flags &= ~RX_CALL_FAST_RECOVER;
4466 call->cwind = call->nextCwind;
4468 #ifdef RX_ENABLE_LOCKS
4469 CV_SIGNAL(&call->cv_twind);
4471 osi_rxWakeup(&call->twind);
4476 rxi_ClearReceiveQueue(struct rx_call *call)
4478 if (queue_IsNotEmpty(&call->rq)) {
4481 count = rxi_FreePackets(0, &call->rq);
4482 rx_packetReclaims += count;
4483 #ifdef RXDEBUG_PACKET
4485 if ( call->rqc != 0 )
4486 dpf(("rxi_ClearReceiveQueue call %"AFS_PTR_FMT" rqc %u != 0", call, call->rqc));
4488 call->flags &= ~(RX_CALL_RECEIVE_DONE | RX_CALL_HAVE_LAST);
4490 if (call->state == RX_STATE_PRECALL) {
4491 call->flags |= RX_CALL_CLEARED;
4495 /* Send an abort packet for the specified call */
4497 rxi_SendCallAbort(struct rx_call *call, struct rx_packet *packet,
4498 int istack, int force)
4501 struct clock when, now;
4506 /* Clients should never delay abort messages */
4507 if (rx_IsClientConn(call->conn))
4510 if (call->abortCode != call->error) {
4511 call->abortCode = call->error;
4512 call->abortCount = 0;
4515 if (force || rxi_callAbortThreshhold == 0
4516 || call->abortCount < rxi_callAbortThreshhold) {
4517 if (call->delayedAbortEvent) {
4518 rxevent_Cancel(call->delayedAbortEvent, call,
4519 RX_CALL_REFCOUNT_ABORT);
4521 error = htonl(call->error);
4524 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
4525 (char *)&error, sizeof(error), istack);
4526 } else if (!call->delayedAbortEvent) {
4527 clock_GetTime(&now);
4529 clock_Addmsec(&when, rxi_callAbortDelay);
4530 CALL_HOLD(call, RX_CALL_REFCOUNT_ABORT);
4531 call->delayedAbortEvent =
4532 rxevent_PostNow(&when, &now, rxi_SendDelayedCallAbort, call, 0);
4537 /* Send an abort packet for the specified connection. Packet is an
4538 * optional pointer to a packet that can be used to send the abort.
4539 * Once the number of abort messages reaches the threshhold, an
4540 * event is scheduled to send the abort. Setting the force flag
4541 * overrides sending delayed abort messages.
4543 * NOTE: Called with conn_data_lock held. conn_data_lock is dropped
4544 * to send the abort packet.
4547 rxi_SendConnectionAbort(struct rx_connection *conn,
4548 struct rx_packet *packet, int istack, int force)
4551 struct clock when, now;
4556 /* Clients should never delay abort messages */
4557 if (rx_IsClientConn(conn))
4560 if (force || rxi_connAbortThreshhold == 0
4561 || conn->abortCount < rxi_connAbortThreshhold) {
4562 if (conn->delayedAbortEvent) {
4563 rxevent_Cancel(conn->delayedAbortEvent, (struct rx_call *)0, 0);
4565 error = htonl(conn->error);
4567 MUTEX_EXIT(&conn->conn_data_lock);
4569 rxi_SendSpecial((struct rx_call *)0, conn, packet,
4570 RX_PACKET_TYPE_ABORT, (char *)&error,
4571 sizeof(error), istack);
4572 MUTEX_ENTER(&conn->conn_data_lock);
4573 } else if (!conn->delayedAbortEvent) {
4574 clock_GetTime(&now);
4576 clock_Addmsec(&when, rxi_connAbortDelay);
4577 conn->delayedAbortEvent =
4578 rxevent_PostNow(&when, &now, rxi_SendDelayedConnAbort, conn, 0);
4583 /* Associate an error all of the calls owned by a connection. Called
4584 * with error non-zero. This is only for really fatal things, like
4585 * bad authentication responses. The connection itself is set in
4586 * error at this point, so that future packets received will be
4589 rxi_ConnectionError(struct rx_connection *conn,
4595 dpf(("rxi_ConnectionError conn %"AFS_PTR_FMT" error %d", conn, error));
4597 MUTEX_ENTER(&conn->conn_data_lock);
4598 if (conn->challengeEvent)
4599 rxevent_Cancel(conn->challengeEvent, (struct rx_call *)0, 0);
4600 if (conn->checkReachEvent) {
4601 rxevent_Cancel(conn->checkReachEvent, (struct rx_call *)0, 0);
4602 conn->checkReachEvent = 0;
4603 conn->flags &= ~RX_CONN_ATTACHWAIT;
4606 MUTEX_EXIT(&conn->conn_data_lock);
4607 for (i = 0; i < RX_MAXCALLS; i++) {
4608 struct rx_call *call = conn->call[i];
4610 MUTEX_ENTER(&call->lock);
4611 rxi_CallError(call, error);
4612 MUTEX_EXIT(&call->lock);
4615 conn->error = error;
4616 if (rx_stats_active)
4617 rx_MutexIncrement(rx_stats.fatalErrors, rx_stats_mutex);
4622 rxi_CallError(struct rx_call *call, afs_int32 error)
4625 osirx_AssertMine(&call->lock, "rxi_CallError");
4627 dpf(("rxi_CallError call %"AFS_PTR_FMT" error %d call->error %d", call, error, call->error));
4629 error = call->error;
4631 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
4632 if (!((call->flags & RX_CALL_TQ_BUSY) || (call->tqWaiters > 0))) {
4633 rxi_ResetCall(call, 0);
4636 rxi_ResetCall(call, 0);
4638 call->error = error;
4639 call->mode = RX_MODE_ERROR;
4642 /* Reset various fields in a call structure, and wakeup waiting
4643 * processes. Some fields aren't changed: state & mode are not
4644 * touched (these must be set by the caller), and bufptr, nLeft, and
4645 * nFree are not reset, since these fields are manipulated by
4646 * unprotected macros, and may only be reset by non-interrupting code.
4649 /* this code requires that call->conn be set properly as a pre-condition. */
4650 #endif /* ADAPT_WINDOW */
4653 rxi_ResetCall(struct rx_call *call, int newcall)
4656 struct rx_peer *peer;
4657 struct rx_packet *packet;
4659 osirx_AssertMine(&call->lock, "rxi_ResetCall");
4661 dpf(("rxi_ResetCall(call %"AFS_PTR_FMT", newcall %d)\n", call, newcall));
4663 /* Notify anyone who is waiting for asynchronous packet arrival */
4664 if (call->arrivalProc) {
4665 (*call->arrivalProc) (call, call->arrivalProcHandle,
4666 call->arrivalProcArg);
4667 call->arrivalProc = (void (*)())0;
4670 if (call->delayedAbortEvent) {
4671 rxevent_Cancel(call->delayedAbortEvent, call, RX_CALL_REFCOUNT_ABORT);
4672 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
4674 rxi_SendCallAbort(call, packet, 0, 1);
4675 rxi_FreePacket(packet);
4680 * Update the peer with the congestion information in this call
4681 * so other calls on this connection can pick up where this call
4682 * left off. If the congestion sequence numbers don't match then
4683 * another call experienced a retransmission.
4685 peer = call->conn->peer;
4686 MUTEX_ENTER(&peer->peer_lock);
4688 if (call->congestSeq == peer->congestSeq) {
4689 peer->cwind = MAX(peer->cwind, call->cwind);
4690 peer->MTU = MAX(peer->MTU, call->MTU);
4691 peer->nDgramPackets =
4692 MAX(peer->nDgramPackets, call->nDgramPackets);
4695 call->abortCode = 0;
4696 call->abortCount = 0;
4698 if (peer->maxDgramPackets > 1) {
4699 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
4701 call->MTU = peer->MTU;
4703 call->cwind = MIN((int)peer->cwind, (int)peer->nDgramPackets);
4704 call->ssthresh = rx_maxSendWindow;
4705 call->nDgramPackets = peer->nDgramPackets;
4706 call->congestSeq = peer->congestSeq;
4707 MUTEX_EXIT(&peer->peer_lock);
4709 flags = call->flags;
4710 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
4711 if (flags & RX_CALL_TQ_BUSY) {
4712 call->flags = RX_CALL_TQ_CLEARME | RX_CALL_TQ_BUSY;
4713 call->flags |= (flags & RX_CALL_TQ_WAIT);
4714 #ifdef RX_ENABLE_LOCKS
4715 CV_WAIT(&call->cv_tq, &call->lock);
4716 #else /* RX_ENABLE_LOCKS */
4717 osi_rxSleep(&call->tq);
4718 #endif /* RX_ENABLE_LOCKS */
4720 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
4722 rxi_ClearTransmitQueue(call, 1);
4723 /* why init the queue if you just emptied it? queue_Init(&call->tq); */
4724 if (call->tqWaiters || (flags & RX_CALL_TQ_WAIT)) {
4725 dpf(("rcall %"AFS_PTR_FMT" has %d waiters and flags %d\n", call, call->tqWaiters, call->flags));
4728 while (call->tqWaiters) {
4729 #ifdef RX_ENABLE_LOCKS
4730 CV_BROADCAST(&call->cv_tq);
4731 #else /* RX_ENABLE_LOCKS */
4732 osi_rxWakeup(&call->tq);
4733 #endif /* RX_ENABLE_LOCKS */
4738 rxi_ClearReceiveQueue(call);
4739 /* why init the queue if you just emptied it? queue_Init(&call->rq); */
4741 if (call->currentPacket) {
4742 call->currentPacket->flags &= ~RX_PKTFLAG_CP;
4743 call->currentPacket->flags |= RX_PKTFLAG_IOVQ;
4744 queue_Prepend(&call->iovq, call->currentPacket);
4745 #ifdef RXDEBUG_PACKET
4747 #endif /* RXDEBUG_PACKET */
4748 call->currentPacket = (struct rx_packet *)0;
4750 call->curlen = call->nLeft = call->nFree = 0;
4752 #ifdef RXDEBUG_PACKET
4755 rxi_FreePackets(0, &call->iovq);
4758 call->twind = call->conn->twind[call->channel];
4759 call->rwind = call->conn->rwind[call->channel];
4760 call->nSoftAcked = 0;
4761 call->nextCwind = 0;
4764 call->nCwindAcks = 0;
4765 call->nSoftAcks = 0;
4766 call->nHardAcks = 0;
4768 call->tfirst = call->rnext = call->tnext = 1;
4770 call->lastAcked = 0;
4771 call->localStatus = call->remoteStatus = 0;
4773 if (flags & RX_CALL_READER_WAIT) {
4774 #ifdef RX_ENABLE_LOCKS
4775 CV_BROADCAST(&call->cv_rq);
4777 osi_rxWakeup(&call->rq);
4780 if (flags & RX_CALL_WAIT_PACKETS) {
4781 MUTEX_ENTER(&rx_freePktQ_lock);
4782 rxi_PacketsUnWait(); /* XXX */
4783 MUTEX_EXIT(&rx_freePktQ_lock);
4785 #ifdef RX_ENABLE_LOCKS
4786 CV_SIGNAL(&call->cv_twind);
4788 if (flags & RX_CALL_WAIT_WINDOW_ALLOC)
4789 osi_rxWakeup(&call->twind);
4792 #ifdef RX_ENABLE_LOCKS
4793 /* The following ensures that we don't mess with any queue while some
4794 * other thread might also be doing so. The call_queue_lock field is
4795 * is only modified under the call lock. If the call is in the process
4796 * of being removed from a queue, the call is not locked until the
4797 * the queue lock is dropped and only then is the call_queue_lock field
4798 * zero'd out. So it's safe to lock the queue if call_queue_lock is set.
4799 * Note that any other routine which removes a call from a queue has to
4800 * obtain the queue lock before examing the queue and removing the call.
4802 if (call->call_queue_lock) {
4803 MUTEX_ENTER(call->call_queue_lock);
4804 if (queue_IsOnQueue(call)) {
4806 if (flags & RX_CALL_WAIT_PROC) {
4808 MUTEX_ENTER(&rx_waiting_mutex);
4810 MUTEX_EXIT(&rx_waiting_mutex);
4813 MUTEX_EXIT(call->call_queue_lock);
4814 CLEAR_CALL_QUEUE_LOCK(call);
4816 #else /* RX_ENABLE_LOCKS */
4817 if (queue_IsOnQueue(call)) {
4819 if (flags & RX_CALL_WAIT_PROC)
4822 #endif /* RX_ENABLE_LOCKS */
4824 rxi_KeepAliveOff(call);
4825 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
4828 /* Send an acknowledge for the indicated packet (seq,serial) of the
4829 * indicated call, for the indicated reason (reason). This
4830 * acknowledge will specifically acknowledge receiving the packet, and
4831 * will also specify which other packets for this call have been
4832 * received. This routine returns the packet that was used to the
4833 * caller. The caller is responsible for freeing it or re-using it.
4834 * This acknowledgement also returns the highest sequence number
4835 * actually read out by the higher level to the sender; the sender
4836 * promises to keep around packets that have not been read by the
4837 * higher level yet (unless, of course, the sender decides to abort
4838 * the call altogether). Any of p, seq, serial, pflags, or reason may
4839 * be set to zero without ill effect. That is, if they are zero, they
4840 * will not convey any information.
4841 * NOW there is a trailer field, after the ack where it will safely be
4842 * ignored by mundanes, which indicates the maximum size packet this
4843 * host can swallow. */
4845 struct rx_packet *optionalPacket; use to send ack (or null)
4846 int seq; Sequence number of the packet we are acking
4847 int serial; Serial number of the packet
4848 int pflags; Flags field from packet header
4849 int reason; Reason an acknowledge was prompted
4853 rxi_SendAck(struct rx_call *call,
4854 struct rx_packet *optionalPacket, int serial, int reason,
4857 struct rx_ackPacket *ap;
4858 struct rx_packet *rqp;
4859 struct rx_packet *nxp; /* For queue_Scan */
4860 struct rx_packet *p;
4863 #ifdef RX_ENABLE_TSFPQ
4864 struct rx_ts_info_t * rx_ts_info;
4868 * Open the receive window once a thread starts reading packets
4870 if (call->rnext > 1) {
4871 call->conn->rwind[call->channel] = call->rwind = rx_maxReceiveWindow;
4874 call->nHardAcks = 0;
4875 call->nSoftAcks = 0;
4876 if (call->rnext > call->lastAcked)
4877 call->lastAcked = call->rnext;
4881 rx_computelen(p, p->length); /* reset length, you never know */
4882 } /* where that's been... */
4883 #ifdef RX_ENABLE_TSFPQ
4885 RX_TS_INFO_GET(rx_ts_info);
4886 if ((p = rx_ts_info->local_special_packet)) {
4887 rx_computelen(p, p->length);
4888 } else if ((p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
4889 rx_ts_info->local_special_packet = p;
4890 } else { /* We won't send the ack, but don't panic. */
4891 return optionalPacket;
4895 else if (!(p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
4896 /* We won't send the ack, but don't panic. */
4897 return optionalPacket;
4902 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32) -
4905 if (rxi_AllocDataBuf(p, templ, RX_PACKET_CLASS_SPECIAL) > 0) {
4906 #ifndef RX_ENABLE_TSFPQ
4907 if (!optionalPacket)
4910 return optionalPacket;
4912 templ = rx_AckDataSize(call->rwind) + 2 * sizeof(afs_int32);
4913 if (rx_Contiguous(p) < templ) {
4914 #ifndef RX_ENABLE_TSFPQ
4915 if (!optionalPacket)
4918 return optionalPacket;
4923 /* MTUXXX failing to send an ack is very serious. We should */
4924 /* try as hard as possible to send even a partial ack; it's */
4925 /* better than nothing. */
4926 ap = (struct rx_ackPacket *)rx_DataOf(p);
4927 ap->bufferSpace = htonl(0); /* Something should go here, sometime */
4928 ap->reason = reason;
4930 /* The skew computation used to be bogus, I think it's better now. */
4931 /* We should start paying attention to skew. XXX */
4932 ap->serial = htonl(serial);
4933 ap->maxSkew = 0; /* used to be peer->inPacketSkew */
4935 ap->firstPacket = htonl(call->rnext); /* First packet not yet forwarded to reader */
4936 ap->previousPacket = htonl(call->rprev); /* Previous packet received */
4938 /* No fear of running out of ack packet here because there can only be at most
4939 * one window full of unacknowledged packets. The window size must be constrained
4940 * to be less than the maximum ack size, of course. Also, an ack should always
4941 * fit into a single packet -- it should not ever be fragmented. */
4942 for (offset = 0, queue_Scan(&call->rq, rqp, nxp, rx_packet)) {
4943 if (!rqp || !call->rq.next
4944 || (rqp->header.seq > (call->rnext + call->rwind))) {
4945 #ifndef RX_ENABLE_TSFPQ
4946 if (!optionalPacket)
4949 rxi_CallError(call, RX_CALL_DEAD);
4950 return optionalPacket;
4953 while (rqp->header.seq > call->rnext + offset)
4954 ap->acks[offset++] = RX_ACK_TYPE_NACK;
4955 ap->acks[offset++] = RX_ACK_TYPE_ACK;
4957 if ((offset > (u_char) rx_maxReceiveWindow) || (offset > call->rwind)) {
4958 #ifndef RX_ENABLE_TSFPQ
4959 if (!optionalPacket)
4962 rxi_CallError(call, RX_CALL_DEAD);
4963 return optionalPacket;
4968 p->length = rx_AckDataSize(offset) + 4 * sizeof(afs_int32);
4970 /* these are new for AFS 3.3 */
4971 templ = rxi_AdjustMaxMTU(call->conn->peer->ifMTU, rx_maxReceiveSize);
4972 templ = htonl(templ);
4973 rx_packetwrite(p, rx_AckDataSize(offset), sizeof(afs_int32), &templ);
4974 templ = htonl(call->conn->peer->ifMTU);
4975 rx_packetwrite(p, rx_AckDataSize(offset) + sizeof(afs_int32),
4976 sizeof(afs_int32), &templ);
4978 /* new for AFS 3.4 */
4979 templ = htonl(call->rwind);
4980 rx_packetwrite(p, rx_AckDataSize(offset) + 2 * sizeof(afs_int32),
4981 sizeof(afs_int32), &templ);
4983 /* new for AFS 3.5 */
4984 templ = htonl(call->conn->peer->ifDgramPackets);
4985 rx_packetwrite(p, rx_AckDataSize(offset) + 3 * sizeof(afs_int32),
4986 sizeof(afs_int32), &templ);
4988 p->header.serviceId = call->conn->serviceId;
4989 p->header.cid = (call->conn->cid | call->channel);
4990 p->header.callNumber = *call->callNumber;
4992 p->header.securityIndex = call->conn->securityIndex;
4993 p->header.epoch = call->conn->epoch;
4994 p->header.type = RX_PACKET_TYPE_ACK;
4995 p->header.flags = RX_SLOW_START_OK;
4996 if (reason == RX_ACK_PING) {
4997 p->header.flags |= RX_REQUEST_ACK;
4999 clock_GetTime(&call->pingRequestTime);
5002 if (call->conn->type == RX_CLIENT_CONNECTION)
5003 p->header.flags |= RX_CLIENT_INITIATED;
5007 if (rxdebug_active) {
5011 len = _snprintf(msg, sizeof(msg),
5012 "tid[%d] SACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
5013 GetCurrentThreadId(), rx_ack_reason(ap->reason),
5014 ntohl(ap->serial), ntohl(ap->previousPacket),
5015 (unsigned int)p->header.seq, ntohl(ap->firstPacket),
5016 ap->nAcks, ntohs(ap->bufferSpace) );
5020 for (offset = 0; offset < ap->nAcks && len < sizeof(msg); offset++)
5021 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
5025 OutputDebugString(msg);
5027 #else /* AFS_NT40_ENV */
5029 fprintf(rx_Log, "SACK: reason %x previous %u seq %u first %u ",
5030 ap->reason, ntohl(ap->previousPacket),
5031 (unsigned int)p->header.seq, ntohl(ap->firstPacket));
5033 for (offset = 0; offset < ap->nAcks; offset++)
5034 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
5039 #endif /* AFS_NT40_ENV */
5042 int i, nbytes = p->length;
5044 for (i = 1; i < p->niovecs; i++) { /* vec 0 is ALWAYS header */
5045 if (nbytes <= p->wirevec[i].iov_len) {
5048 savelen = p->wirevec[i].iov_len;
5050 p->wirevec[i].iov_len = nbytes;
5052 rxi_Send(call, p, istack);
5053 p->wirevec[i].iov_len = savelen;
5057 nbytes -= p->wirevec[i].iov_len;
5060 if (rx_stats_active)
5061 rx_MutexIncrement(rx_stats.ackPacketsSent, rx_stats_mutex);
5062 #ifndef RX_ENABLE_TSFPQ
5063 if (!optionalPacket)
5066 return optionalPacket; /* Return packet for re-use by caller */
5069 /* Send all of the packets in the list in single datagram */
5071 rxi_SendList(struct rx_call *call, struct rx_packet **list, int len,
5072 int istack, int moreFlag, struct clock *now,
5073 struct clock *retryTime, int resending)
5078 struct rx_connection *conn = call->conn;
5079 struct rx_peer *peer = conn->peer;
5081 MUTEX_ENTER(&peer->peer_lock);
5084 peer->reSends += len;
5085 if (rx_stats_active)
5086 rx_MutexAdd(rx_stats.dataPacketsSent, len, rx_stats_mutex);
5087 MUTEX_EXIT(&peer->peer_lock);
5089 if (list[len - 1]->header.flags & RX_LAST_PACKET) {
5093 /* Set the packet flags and schedule the resend events */
5094 /* Only request an ack for the last packet in the list */
5095 for (i = 0; i < len; i++) {
5096 list[i]->retryTime = *retryTime;
5097 if (list[i]->header.serial) {
5098 /* Exponentially backoff retry times */
5099 if (list[i]->backoff < MAXBACKOFF) {
5100 /* so it can't stay == 0 */
5101 list[i]->backoff = (list[i]->backoff << 1) + 1;
5104 clock_Addmsec(&(list[i]->retryTime),
5105 ((afs_uint32) list[i]->backoff) << 8);
5108 /* Wait a little extra for the ack on the last packet */
5109 if (lastPacket && !(list[i]->header.flags & RX_CLIENT_INITIATED)) {
5110 clock_Addmsec(&(list[i]->retryTime), 400);
5113 /* Record the time sent */
5114 list[i]->timeSent = *now;
5116 /* Ask for an ack on retransmitted packets, on every other packet
5117 * if the peer doesn't support slow start. Ask for an ack on every
5118 * packet until the congestion window reaches the ack rate. */
5119 if (list[i]->header.serial) {
5121 if (rx_stats_active)
5122 rx_MutexIncrement(rx_stats.dataPacketsReSent, rx_stats_mutex);
5124 /* improved RTO calculation- not Karn */
5125 list[i]->firstSent = *now;
5126 if (!lastPacket && (call->cwind <= (u_short) (conn->ackRate + 1)
5127 || (!(call->flags & RX_CALL_SLOW_START_OK)
5128 && (list[i]->header.seq & 1)))) {
5133 /* Tag this packet as not being the last in this group,
5134 * for the receiver's benefit */
5135 if (i < len - 1 || moreFlag) {
5136 list[i]->header.flags |= RX_MORE_PACKETS;
5139 /* Install the new retransmit time for the packet, and
5140 * record the time sent */
5141 list[i]->timeSent = *now;
5145 list[len - 1]->header.flags |= RX_REQUEST_ACK;
5148 /* Since we're about to send a data packet to the peer, it's
5149 * safe to nuke any scheduled end-of-packets ack */
5150 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
5152 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5153 MUTEX_EXIT(&call->lock);
5155 rxi_SendPacketList(call, conn, list, len, istack);
5157 rxi_SendPacket(call, conn, list[0], istack);
5159 MUTEX_ENTER(&call->lock);
5160 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5162 /* Update last send time for this call (for keep-alive
5163 * processing), and for the connection (so that we can discover
5164 * idle connections) */
5165 call->lastSendData = conn->lastSendTime = call->lastSendTime = clock_Sec();
5168 /* When sending packets we need to follow these rules:
5169 * 1. Never send more than maxDgramPackets in a jumbogram.
5170 * 2. Never send a packet with more than two iovecs in a jumbogram.
5171 * 3. Never send a retransmitted packet in a jumbogram.
5172 * 4. Never send more than cwind/4 packets in a jumbogram
5173 * We always keep the last list we should have sent so we
5174 * can set the RX_MORE_PACKETS flags correctly.
5177 rxi_SendXmitList(struct rx_call *call, struct rx_packet **list, int len,
5178 int istack, struct clock *now, struct clock *retryTime,
5181 int i, cnt, lastCnt = 0;
5182 struct rx_packet **listP, **lastP = 0;
5183 struct rx_peer *peer = call->conn->peer;
5184 int morePackets = 0;
5186 for (cnt = 0, listP = &list[0], i = 0; i < len; i++) {
5187 /* Does the current packet force us to flush the current list? */
5189 && (list[i]->header.serial || (list[i]->flags & RX_PKTFLAG_ACKED)
5190 || list[i]->length > RX_JUMBOBUFFERSIZE)) {
5192 rxi_SendList(call, lastP, lastCnt, istack, 1, now, retryTime,
5194 /* If the call enters an error state stop sending, or if
5195 * we entered congestion recovery mode, stop sending */
5196 if (call->error || (call->flags & RX_CALL_FAST_RECOVER_WAIT))
5204 /* Add the current packet to the list if it hasn't been acked.
5205 * Otherwise adjust the list pointer to skip the current packet. */
5206 if (!(list[i]->flags & RX_PKTFLAG_ACKED)) {
5208 /* Do we need to flush the list? */
5209 if (cnt >= (int)peer->maxDgramPackets
5210 || cnt >= (int)call->nDgramPackets || cnt >= (int)call->cwind
5211 || list[i]->header.serial
5212 || list[i]->length != RX_JUMBOBUFFERSIZE) {
5214 rxi_SendList(call, lastP, lastCnt, istack, 1, now,
5215 retryTime, resending);
5216 /* If the call enters an error state stop sending, or if
5217 * we entered congestion recovery mode, stop sending */
5219 || (call->flags & RX_CALL_FAST_RECOVER_WAIT))
5224 listP = &list[i + 1];
5229 osi_Panic("rxi_SendList error");
5231 listP = &list[i + 1];
5235 /* Send the whole list when the call is in receive mode, when
5236 * the call is in eof mode, when we are in fast recovery mode,
5237 * and when we have the last packet */
5238 if ((list[len - 1]->header.flags & RX_LAST_PACKET)
5239 || call->mode == RX_MODE_RECEIVING || call->mode == RX_MODE_EOF
5240 || (call->flags & RX_CALL_FAST_RECOVER)) {
5241 /* Check for the case where the current list contains
5242 * an acked packet. Since we always send retransmissions
5243 * in a separate packet, we only need to check the first
5244 * packet in the list */
5245 if (cnt > 0 && !(listP[0]->flags & RX_PKTFLAG_ACKED)) {
5249 rxi_SendList(call, lastP, lastCnt, istack, morePackets, now,
5250 retryTime, resending);
5251 /* If the call enters an error state stop sending, or if
5252 * we entered congestion recovery mode, stop sending */
5253 if (call->error || (call->flags & RX_CALL_FAST_RECOVER_WAIT))
5257 rxi_SendList(call, listP, cnt, istack, 0, now, retryTime,
5260 } else if (lastCnt > 0) {
5261 rxi_SendList(call, lastP, lastCnt, istack, 0, now, retryTime,
5266 #ifdef RX_ENABLE_LOCKS
5267 /* Call rxi_Start, below, but with the call lock held. */
5269 rxi_StartUnlocked(struct rxevent *event,
5270 void *arg0, void *arg1, int istack)
5272 struct rx_call *call = arg0;
5274 MUTEX_ENTER(&call->lock);
5275 rxi_Start(event, call, arg1, istack);
5276 MUTEX_EXIT(&call->lock);
5278 #endif /* RX_ENABLE_LOCKS */
5280 /* This routine is called when new packets are readied for
5281 * transmission and when retransmission may be necessary, or when the
5282 * transmission window or burst count are favourable. This should be
5283 * better optimized for new packets, the usual case, now that we've
5284 * got rid of queues of send packets. XXXXXXXXXXX */
5286 rxi_Start(struct rxevent *event,
5287 void *arg0, void *arg1, int istack)
5289 struct rx_call *call = arg0;
5291 struct rx_packet *p;
5292 struct rx_packet *nxp; /* Next pointer for queue_Scan */
5293 struct rx_peer *peer = call->conn->peer;
5294 struct clock now, usenow, retryTime;
5298 struct rx_packet **xmitList;
5301 /* If rxi_Start is being called as a result of a resend event,
5302 * then make sure that the event pointer is removed from the call
5303 * structure, since there is no longer a per-call retransmission
5305 if (event && event == call->resendEvent) {
5306 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
5307 call->resendEvent = NULL;
5309 if (queue_IsEmpty(&call->tq)) {
5313 /* Timeouts trigger congestion recovery */
5314 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5315 if (call->flags & RX_CALL_FAST_RECOVER_WAIT) {
5316 /* someone else is waiting to start recovery */
5319 call->flags |= RX_CALL_FAST_RECOVER_WAIT;
5320 rxi_WaitforTQBusy(call);
5321 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5322 call->flags &= ~RX_CALL_FAST_RECOVER_WAIT;
5323 call->flags |= RX_CALL_FAST_RECOVER;
5324 if (peer->maxDgramPackets > 1) {
5325 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
5327 call->MTU = MIN(peer->natMTU, peer->maxMTU);
5329 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
5330 call->nDgramPackets = 1;
5332 call->nextCwind = 1;
5335 MUTEX_ENTER(&peer->peer_lock);
5336 peer->MTU = call->MTU;
5337 peer->cwind = call->cwind;
5338 peer->nDgramPackets = 1;
5340 call->congestSeq = peer->congestSeq;
5341 MUTEX_EXIT(&peer->peer_lock);
5342 /* Clear retry times on packets. Otherwise, it's possible for
5343 * some packets in the queue to force resends at rates faster
5344 * than recovery rates.
5346 for (queue_Scan(&call->tq, p, nxp, rx_packet)) {
5347 if (!(p->flags & RX_PKTFLAG_ACKED)) {
5348 clock_Zero(&p->retryTime);
5353 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5354 if (rx_stats_active)
5355 rx_MutexIncrement(rx_tq_debug.rxi_start_in_error, rx_stats_mutex);
5360 if (queue_IsNotEmpty(&call->tq)) { /* If we have anything to send */
5361 /* Get clock to compute the re-transmit time for any packets
5362 * in this burst. Note, if we back off, it's reasonable to
5363 * back off all of the packets in the same manner, even if
5364 * some of them have been retransmitted more times than more
5366 * Do a dance to avoid blocking after setting now. */
5367 MUTEX_ENTER(&peer->peer_lock);
5368 retryTime = peer->timeout;
5369 MUTEX_EXIT(&peer->peer_lock);
5370 clock_GetTime(&now);
5371 clock_Add(&retryTime, &now);
5373 /* Send (or resend) any packets that need it, subject to
5374 * window restrictions and congestion burst control
5375 * restrictions. Ask for an ack on the last packet sent in
5376 * this burst. For now, we're relying upon the window being
5377 * considerably bigger than the largest number of packets that
5378 * are typically sent at once by one initial call to
5379 * rxi_Start. This is probably bogus (perhaps we should ask
5380 * for an ack when we're half way through the current
5381 * window?). Also, for non file transfer applications, this
5382 * may end up asking for an ack for every packet. Bogus. XXXX
5385 * But check whether we're here recursively, and let the other guy
5388 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5389 if (!(call->flags & RX_CALL_TQ_BUSY)) {
5390 call->flags |= RX_CALL_TQ_BUSY;
5392 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5394 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5395 call->flags &= ~RX_CALL_NEED_START;
5396 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5398 maxXmitPackets = MIN(call->twind, call->cwind);
5399 xmitList = (struct rx_packet **)
5400 #if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV)
5401 /* XXXX else we must drop any mtx we hold */
5402 afs_osi_Alloc_NoSleep(maxXmitPackets * sizeof(struct rx_packet *));
5404 osi_Alloc(maxXmitPackets * sizeof(struct rx_packet *));
5406 if (xmitList == NULL)
5407 osi_Panic("rxi_Start, failed to allocate xmit list");
5408 for (queue_Scan(&call->tq, p, nxp, rx_packet)) {
5409 if (call->flags & RX_CALL_FAST_RECOVER_WAIT) {
5410 /* We shouldn't be sending packets if a thread is waiting
5411 * to initiate congestion recovery */
5412 dpf(("call %d waiting to initiate fast recovery\n",
5413 *(call->callNumber)));
5417 && (call->flags & RX_CALL_FAST_RECOVER)) {
5418 /* Only send one packet during fast recovery */
5419 dpf(("call %d restricted to one packet per send during fast recovery\n",
5420 *(call->callNumber)));
5423 if ((p->flags & RX_PKTFLAG_FREE)
5424 || (!queue_IsEnd(&call->tq, nxp)
5425 && (nxp->flags & RX_PKTFLAG_FREE))
5426 || (p == (struct rx_packet *)&rx_freePacketQueue)
5427 || (nxp == (struct rx_packet *)&rx_freePacketQueue)) {
5428 osi_Panic("rxi_Start: xmit queue clobbered");
5430 if (p->flags & RX_PKTFLAG_ACKED) {
5431 /* Since we may block, don't trust this */
5432 usenow.sec = usenow.usec = 0;
5433 if (rx_stats_active)
5434 rx_MutexIncrement(rx_stats.ignoreAckedPacket, rx_stats_mutex);
5435 continue; /* Ignore this packet if it has been acknowledged */
5438 /* Turn off all flags except these ones, which are the same
5439 * on each transmission */
5440 p->header.flags &= RX_PRESET_FLAGS;
5442 if (p->header.seq >=
5443 call->tfirst + MIN((int)call->twind,
5444 (int)(call->nSoftAcked +
5446 call->flags |= RX_CALL_WAIT_WINDOW_SEND; /* Wait for transmit window */
5447 /* Note: if we're waiting for more window space, we can
5448 * still send retransmits; hence we don't return here, but
5449 * break out to schedule a retransmit event */
5450 dpf(("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n",
5451 *(call->callNumber), p->header.seq, call->twind, call->nSoftAcked,
5456 /* Transmit the packet if it needs to be sent. */
5457 if (!clock_Lt(&now, &p->retryTime)) {
5458 if (nXmitPackets == maxXmitPackets) {
5459 rxi_SendXmitList(call, xmitList, nXmitPackets,
5460 istack, &now, &retryTime,
5462 osi_Free(xmitList, maxXmitPackets *
5463 sizeof(struct rx_packet *));
5466 dpf(("call %d xmit packet %"AFS_PTR_FMT" now %u.%06u retryTime %u.%06u nextRetry %u.%06u\n",
5467 *(call->callNumber), p,
5469 p->retryTime.sec, p->retryTime.usec,
5470 retryTime.sec, retryTime.usec));
5471 xmitList[nXmitPackets++] = p;
5475 /* xmitList now hold pointers to all of the packets that are
5476 * ready to send. Now we loop to send the packets */
5477 if (nXmitPackets > 0) {
5478 rxi_SendXmitList(call, xmitList, nXmitPackets, istack,
5479 &now, &retryTime, resending);
5482 maxXmitPackets * sizeof(struct rx_packet *));
5484 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5486 * TQ references no longer protected by this flag; they must remain
5487 * protected by the global lock.
5489 if (call->flags & RX_CALL_FAST_RECOVER_WAIT) {
5490 call->flags &= ~RX_CALL_TQ_BUSY;
5491 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
5492 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",
5493 call, call->tqWaiters, call->flags));
5494 #ifdef RX_ENABLE_LOCKS
5495 osirx_AssertMine(&call->lock, "rxi_Start start");
5496 CV_BROADCAST(&call->cv_tq);
5497 #else /* RX_ENABLE_LOCKS */
5498 osi_rxWakeup(&call->tq);
5499 #endif /* RX_ENABLE_LOCKS */
5504 /* We went into the error state while sending packets. Now is
5505 * the time to reset the call. This will also inform the using
5506 * process that the call is in an error state.
5508 if (rx_stats_active)
5509 rx_MutexIncrement(rx_tq_debug.rxi_start_aborted, rx_stats_mutex);
5510 call->flags &= ~RX_CALL_TQ_BUSY;
5511 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
5512 dpf(("call error %d while xmit %x has %d waiters and flags %d\n",
5513 call, call->error, call->tqWaiters, call->flags));
5514 #ifdef RX_ENABLE_LOCKS
5515 osirx_AssertMine(&call->lock, "rxi_Start middle");
5516 CV_BROADCAST(&call->cv_tq);
5517 #else /* RX_ENABLE_LOCKS */
5518 osi_rxWakeup(&call->tq);
5519 #endif /* RX_ENABLE_LOCKS */
5521 rxi_CallError(call, call->error);
5524 #ifdef RX_ENABLE_LOCKS
5525 if (call->flags & RX_CALL_TQ_SOME_ACKED) {
5527 call->flags &= ~RX_CALL_TQ_SOME_ACKED;
5528 /* Some packets have received acks. If they all have, we can clear
5529 * the transmit queue.
5532 0, queue_Scan(&call->tq, p, nxp, rx_packet)) {
5533 if (p->header.seq < call->tfirst
5534 && (p->flags & RX_PKTFLAG_ACKED)) {
5536 p->flags &= ~RX_PKTFLAG_TQ;
5537 #ifdef RXDEBUG_PACKET
5545 call->flags |= RX_CALL_TQ_CLEARME;
5547 #endif /* RX_ENABLE_LOCKS */
5548 /* Don't bother doing retransmits if the TQ is cleared. */
5549 if (call->flags & RX_CALL_TQ_CLEARME) {
5550 rxi_ClearTransmitQueue(call, 1);
5552 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5555 /* Always post a resend event, if there is anything in the
5556 * queue, and resend is possible. There should be at least
5557 * one unacknowledged packet in the queue ... otherwise none
5558 * of these packets should be on the queue in the first place.
5560 if (call->resendEvent) {
5561 /* Cancel the existing event and post a new one */
5562 rxevent_Cancel(call->resendEvent, call,
5563 RX_CALL_REFCOUNT_RESEND);
5566 /* The retry time is the retry time on the first unacknowledged
5567 * packet inside the current window */
5569 0, queue_Scan(&call->tq, p, nxp, rx_packet)) {
5570 /* Don't set timers for packets outside the window */
5571 if (p->header.seq >= call->tfirst + call->twind) {
5575 if (!(p->flags & RX_PKTFLAG_ACKED)
5576 && !clock_IsZero(&p->retryTime)) {
5578 retryTime = p->retryTime;
5583 /* Post a new event to re-run rxi_Start when retries may be needed */
5584 if (haveEvent && !(call->flags & RX_CALL_NEED_START)) {
5585 #ifdef RX_ENABLE_LOCKS
5586 CALL_HOLD(call, RX_CALL_REFCOUNT_RESEND);
5588 rxevent_PostNow2(&retryTime, &usenow,
5590 (void *)call, 0, istack);
5591 #else /* RX_ENABLE_LOCKS */
5593 rxevent_PostNow2(&retryTime, &usenow, rxi_Start,
5594 (void *)call, 0, istack);
5595 #endif /* RX_ENABLE_LOCKS */
5598 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5599 } while (call->flags & RX_CALL_NEED_START);
5601 * TQ references no longer protected by this flag; they must remain
5602 * protected by the global lock.
5604 call->flags &= ~RX_CALL_TQ_BUSY;
5605 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
5606 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",
5607 call, call->tqWaiters, call->flags));
5608 #ifdef RX_ENABLE_LOCKS
5609 osirx_AssertMine(&call->lock, "rxi_Start end");
5610 CV_BROADCAST(&call->cv_tq);
5611 #else /* RX_ENABLE_LOCKS */
5612 osi_rxWakeup(&call->tq);
5613 #endif /* RX_ENABLE_LOCKS */
5616 call->flags |= RX_CALL_NEED_START;
5618 #endif /* AFS_GLOBAL_RXLOCK_KERNEL */
5620 if (call->resendEvent) {
5621 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
5626 /* Also adjusts the keep alive parameters for the call, to reflect
5627 * that we have just sent a packet (so keep alives aren't sent
5630 rxi_Send(struct rx_call *call, struct rx_packet *p,
5633 struct rx_connection *conn = call->conn;
5635 /* Stamp each packet with the user supplied status */
5636 p->header.userStatus = call->localStatus;
5638 /* Allow the security object controlling this call's security to
5639 * make any last-minute changes to the packet */
5640 RXS_SendPacket(conn->securityObject, call, p);
5642 /* Since we're about to send SOME sort of packet to the peer, it's
5643 * safe to nuke any scheduled end-of-packets ack */
5644 rxevent_Cancel(call->delayedAckEvent, call, RX_CALL_REFCOUNT_DELAY);
5646 /* Actually send the packet, filling in more connection-specific fields */
5647 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5648 MUTEX_EXIT(&call->lock);
5649 rxi_SendPacket(call, conn, p, istack);
5650 MUTEX_ENTER(&call->lock);
5651 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5653 /* Update last send time for this call (for keep-alive
5654 * processing), and for the connection (so that we can discover
5655 * idle connections) */
5656 conn->lastSendTime = call->lastSendTime = clock_Sec();
5657 /* Don't count keepalives here, so idleness can be tracked. */
5658 if ((p->header.type != RX_PACKET_TYPE_ACK) || (((struct rx_ackPacket *)rx_DataOf(p))->reason != RX_ACK_PING))
5659 call->lastSendData = call->lastSendTime;
5663 /* Check if a call needs to be destroyed. Called by keep-alive code to ensure
5664 * that things are fine. Also called periodically to guarantee that nothing
5665 * falls through the cracks (e.g. (error + dally) connections have keepalive
5666 * turned off. Returns 0 if conn is well, -1 otherwise. If otherwise, call
5668 * haveCTLock Set if calling from rxi_ReapConnections
5670 #ifdef RX_ENABLE_LOCKS
5672 rxi_CheckCall(struct rx_call *call, int haveCTLock)
5673 #else /* RX_ENABLE_LOCKS */
5675 rxi_CheckCall(struct rx_call *call)
5676 #endif /* RX_ENABLE_LOCKS */
5678 struct rx_connection *conn = call->conn;
5680 afs_uint32 deadTime;
5682 #ifdef AFS_GLOBAL_RXLOCK_KERNEL
5683 if (call->flags & RX_CALL_TQ_BUSY) {
5684 /* Call is active and will be reset by rxi_Start if it's
5685 * in an error state.
5690 /* dead time + RTT + 8*MDEV, rounded up to next second. */
5692 (((afs_uint32) conn->secondsUntilDead << 10) +
5693 ((afs_uint32) conn->peer->rtt >> 3) +
5694 ((afs_uint32) conn->peer->rtt_dev << 1) + 1023) >> 10;
5696 /* These are computed to the second (+- 1 second). But that's
5697 * good enough for these values, which should be a significant
5698 * number of seconds. */
5699 if (now > (call->lastReceiveTime + deadTime)) {
5700 if (call->state == RX_STATE_ACTIVE) {
5702 #if defined(KERNEL) && defined(AFS_SUN57_ENV)
5704 #if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
5705 netstack_t *ns = netstack_find_by_stackid(GLOBAL_NETSTACKID);
5706 ip_stack_t *ipst = ns->netstack_ip;
5708 ire = ire_cache_lookup(call->conn->peer->host
5709 #if defined(AFS_SUN510_ENV) && defined(ALL_ZONES)
5711 #if defined(AFS_SUN510_ENV) && (defined(ICL_3_ARG) || defined(GLOBAL_NETSTACKID))
5713 #if defined(AFS_SUN510_ENV) && defined(GLOBAL_NETSTACKID)
5720 if (ire && ire->ire_max_frag > 0)
5721 rxi_SetPeerMtu(call->conn->peer->host, 0, ire->ire_max_frag);
5722 #if defined(GLOBAL_NETSTACKID)
5726 #endif /* ADAPT_PMTU */
5727 rxi_CallError(call, RX_CALL_DEAD);
5730 #ifdef RX_ENABLE_LOCKS
5731 /* Cancel pending events */
5732 rxevent_Cancel(call->delayedAckEvent, call,
5733 RX_CALL_REFCOUNT_DELAY);
5734 rxevent_Cancel(call->resendEvent, call, RX_CALL_REFCOUNT_RESEND);
5735 rxevent_Cancel(call->keepAliveEvent, call,
5736 RX_CALL_REFCOUNT_ALIVE);
5737 if (call->refCount == 0) {
5738 rxi_FreeCall(call, haveCTLock);
5742 #else /* RX_ENABLE_LOCKS */
5745 #endif /* RX_ENABLE_LOCKS */
5747 /* Non-active calls are destroyed if they are not responding
5748 * to pings; active calls are simply flagged in error, so the
5749 * attached process can die reasonably gracefully. */
5751 /* see if we have a non-activity timeout */
5752 if (call->startWait && conn->idleDeadTime
5753 && ((call->startWait + conn->idleDeadTime) < now)) {
5754 if (call->state == RX_STATE_ACTIVE) {
5755 rxi_CallError(call, RX_CALL_TIMEOUT);
5759 if (call->lastSendData && conn->idleDeadTime && (conn->idleDeadErr != 0)
5760 && ((call->lastSendData + conn->idleDeadTime) < now)) {
5761 if (call->state == RX_STATE_ACTIVE) {
5762 rxi_CallError(call, conn->idleDeadErr);
5766 /* see if we have a hard timeout */
5767 if (conn->hardDeadTime
5768 && (now > (conn->hardDeadTime + call->startTime.sec))) {
5769 if (call->state == RX_STATE_ACTIVE)
5770 rxi_CallError(call, RX_CALL_TIMEOUT);
5777 /* When a call is in progress, this routine is called occasionally to
5778 * make sure that some traffic has arrived (or been sent to) the peer.
5779 * If nothing has arrived in a reasonable amount of time, the call is
5780 * declared dead; if nothing has been sent for a while, we send a
5781 * keep-alive packet (if we're actually trying to keep the call alive)
5784 rxi_KeepAliveEvent(struct rxevent *event, void *arg1, void *dummy)
5786 struct rx_call *call = arg1;
5787 struct rx_connection *conn;
5790 MUTEX_ENTER(&call->lock);
5791 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
5792 if (event == call->keepAliveEvent)
5793 call->keepAliveEvent = NULL;
5796 #ifdef RX_ENABLE_LOCKS
5797 if (rxi_CheckCall(call, 0)) {
5798 MUTEX_EXIT(&call->lock);
5801 #else /* RX_ENABLE_LOCKS */
5802 if (rxi_CheckCall(call))
5804 #endif /* RX_ENABLE_LOCKS */
5806 /* Don't try to keep alive dallying calls */
5807 if (call->state == RX_STATE_DALLY) {
5808 MUTEX_EXIT(&call->lock);
5813 if ((now - call->lastSendTime) > conn->secondsUntilPing) {
5814 /* Don't try to send keepalives if there is unacknowledged data */
5815 /* the rexmit code should be good enough, this little hack
5816 * doesn't quite work XXX */
5817 (void)rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
5819 rxi_ScheduleKeepAliveEvent(call);
5820 MUTEX_EXIT(&call->lock);
5825 rxi_ScheduleKeepAliveEvent(struct rx_call *call)
5827 if (!call->keepAliveEvent) {
5828 struct clock when, now;
5829 clock_GetTime(&now);
5831 when.sec += call->conn->secondsUntilPing;
5832 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
5833 call->keepAliveEvent =
5834 rxevent_PostNow(&when, &now, rxi_KeepAliveEvent, call, 0);
5838 /* N.B. rxi_KeepAliveOff: is defined earlier as a macro */
5840 rxi_KeepAliveOn(struct rx_call *call)
5842 /* Pretend last packet received was received now--i.e. if another
5843 * packet isn't received within the keep alive time, then the call
5844 * will die; Initialize last send time to the current time--even
5845 * if a packet hasn't been sent yet. This will guarantee that a
5846 * keep-alive is sent within the ping time */
5847 call->lastReceiveTime = call->lastSendTime = clock_Sec();
5848 rxi_ScheduleKeepAliveEvent(call);
5851 /* This routine is called to send connection abort messages
5852 * that have been delayed to throttle looping clients. */
5854 rxi_SendDelayedConnAbort(struct rxevent *event,
5855 void *arg1, void *unused)
5857 struct rx_connection *conn = arg1;
5860 struct rx_packet *packet;
5862 MUTEX_ENTER(&conn->conn_data_lock);
5863 conn->delayedAbortEvent = NULL;
5864 error = htonl(conn->error);
5866 MUTEX_EXIT(&conn->conn_data_lock);
5867 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5870 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5871 RX_PACKET_TYPE_ABORT, (char *)&error,
5873 rxi_FreePacket(packet);
5877 /* This routine is called to send call abort messages
5878 * that have been delayed to throttle looping clients. */
5880 rxi_SendDelayedCallAbort(struct rxevent *event,
5881 void *arg1, void *dummy)
5883 struct rx_call *call = arg1;
5886 struct rx_packet *packet;
5888 MUTEX_ENTER(&call->lock);
5889 call->delayedAbortEvent = NULL;
5890 error = htonl(call->error);
5892 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5895 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
5896 (char *)&error, sizeof(error), 0);
5897 rxi_FreePacket(packet);
5899 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
5900 MUTEX_EXIT(&call->lock);
5903 /* This routine is called periodically (every RX_AUTH_REQUEST_TIMEOUT
5904 * seconds) to ask the client to authenticate itself. The routine
5905 * issues a challenge to the client, which is obtained from the
5906 * security object associated with the connection */
5908 rxi_ChallengeEvent(struct rxevent *event,
5909 void *arg0, void *arg1, int tries)
5911 struct rx_connection *conn = arg0;
5913 conn->challengeEvent = NULL;
5914 if (RXS_CheckAuthentication(conn->securityObject, conn) != 0) {
5915 struct rx_packet *packet;
5916 struct clock when, now;
5919 /* We've failed to authenticate for too long.
5920 * Reset any calls waiting for authentication;
5921 * they are all in RX_STATE_PRECALL.
5925 MUTEX_ENTER(&conn->conn_call_lock);
5926 for (i = 0; i < RX_MAXCALLS; i++) {
5927 struct rx_call *call = conn->call[i];
5929 MUTEX_ENTER(&call->lock);
5930 if (call->state == RX_STATE_PRECALL) {
5931 rxi_CallError(call, RX_CALL_DEAD);
5932 rxi_SendCallAbort(call, NULL, 0, 0);
5934 MUTEX_EXIT(&call->lock);
5937 MUTEX_EXIT(&conn->conn_call_lock);
5941 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5943 /* If there's no packet available, do this later. */
5944 RXS_GetChallenge(conn->securityObject, conn, packet);
5945 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5946 RX_PACKET_TYPE_CHALLENGE, NULL, -1, 0);
5947 rxi_FreePacket(packet);
5949 clock_GetTime(&now);
5951 when.sec += RX_CHALLENGE_TIMEOUT;
5952 conn->challengeEvent =
5953 rxevent_PostNow2(&when, &now, rxi_ChallengeEvent, conn, 0,
5958 /* Call this routine to start requesting the client to authenticate
5959 * itself. This will continue until authentication is established,
5960 * the call times out, or an invalid response is returned. The
5961 * security object associated with the connection is asked to create
5962 * the challenge at this time. N.B. rxi_ChallengeOff is a macro,
5963 * defined earlier. */
5965 rxi_ChallengeOn(struct rx_connection *conn)
5967 if (!conn->challengeEvent) {
5968 RXS_CreateChallenge(conn->securityObject, conn);
5969 rxi_ChallengeEvent(NULL, conn, 0, RX_CHALLENGE_MAXTRIES);
5974 /* Compute round trip time of the packet provided, in *rttp.
5977 /* rxi_ComputeRoundTripTime is called with peer locked. */
5978 /* sentp and/or peer may be null */
5980 rxi_ComputeRoundTripTime(struct rx_packet *p,
5981 struct clock *sentp,
5982 struct rx_peer *peer)
5984 struct clock thisRtt, *rttp = &thisRtt;
5988 clock_GetTime(rttp);
5990 if (clock_Lt(rttp, sentp)) {
5992 return; /* somebody set the clock back, don't count this time. */
5994 clock_Sub(rttp, sentp);
5995 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rttp=%d.%06d sec)\n",
5996 p->header.callNumber, p, rttp->sec, rttp->usec));
5998 if (rttp->sec == 0 && rttp->usec == 0) {
6000 * The actual round trip time is shorter than the
6001 * clock_GetTime resolution. It is most likely 1ms or 100ns.
6002 * Since we can't tell which at the moment we will assume 1ms.
6007 if (rx_stats_active) {
6008 MUTEX_ENTER(&rx_stats_mutex);
6009 if (clock_Lt(rttp, &rx_stats.minRtt))
6010 rx_stats.minRtt = *rttp;
6011 if (clock_Gt(rttp, &rx_stats.maxRtt)) {
6012 if (rttp->sec > 60) {
6013 MUTEX_EXIT(&rx_stats_mutex);
6014 return; /* somebody set the clock ahead */
6016 rx_stats.maxRtt = *rttp;
6018 clock_Add(&rx_stats.totalRtt, rttp);
6019 rx_stats.nRttSamples++;
6020 MUTEX_EXIT(&rx_stats_mutex);
6023 /* better rtt calculation courtesy of UMich crew (dave,larry,peter,?) */
6025 /* Apply VanJacobson round-trip estimations */
6030 * srtt (peer->rtt) is in units of one-eighth-milliseconds.
6031 * srtt is stored as fixed point with 3 bits after the binary
6032 * point (i.e., scaled by 8). The following magic is
6033 * equivalent to the smoothing algorithm in rfc793 with an
6034 * alpha of .875 (srtt' = rtt/8 + srtt*7/8 in fixed point).
6035 * srtt'*8 = rtt + srtt*7
6036 * srtt'*8 = srtt*8 + rtt - srtt
6037 * srtt' = srtt + rtt/8 - srtt/8
6038 * srtt' = srtt + (rtt - srtt)/8
6041 delta = _8THMSEC(rttp) - peer->rtt;
6042 peer->rtt += (delta >> 3);
6045 * We accumulate a smoothed rtt variance (actually, a smoothed
6046 * mean difference), then set the retransmit timer to smoothed
6047 * rtt + 4 times the smoothed variance (was 2x in van's original
6048 * paper, but 4x works better for me, and apparently for him as
6050 * rttvar is stored as
6051 * fixed point with 2 bits after the binary point (scaled by
6052 * 4). The following is equivalent to rfc793 smoothing with
6053 * an alpha of .75 (rttvar' = rttvar*3/4 + |delta| / 4).
6054 * rttvar'*4 = rttvar*3 + |delta|
6055 * rttvar'*4 = rttvar*4 + |delta| - rttvar
6056 * rttvar' = rttvar + |delta|/4 - rttvar/4
6057 * rttvar' = rttvar + (|delta| - rttvar)/4
6058 * This replaces rfc793's wired-in beta.
6059 * dev*4 = dev*4 + (|actual - expected| - dev)
6065 delta -= (peer->rtt_dev << 1);
6066 peer->rtt_dev += (delta >> 3);
6068 /* I don't have a stored RTT so I start with this value. Since I'm
6069 * probably just starting a call, and will be pushing more data down
6070 * this, I expect congestion to increase rapidly. So I fudge a
6071 * little, and I set deviance to half the rtt. In practice,
6072 * deviance tends to approach something a little less than
6073 * half the smoothed rtt. */
6074 peer->rtt = _8THMSEC(rttp) + 8;
6075 peer->rtt_dev = peer->rtt >> 2; /* rtt/2: they're scaled differently */
6077 /* the timeout is RTT + 4*MDEV but no less than rx_minPeerTimeout msec.
6078 * This is because one end or the other of these connections is usually
6079 * in a user process, and can be switched and/or swapped out. So on fast,
6080 * reliable networks, the timeout would otherwise be too short. */
6081 rtt_timeout = MAX(((peer->rtt >> 3) + peer->rtt_dev), rx_minPeerTimeout);
6082 clock_Zero(&(peer->timeout));
6083 clock_Addmsec(&(peer->timeout), rtt_timeout);
6085 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n",
6086 p->header.callNumber, p, MSEC(rttp), peer->rtt >> 3, peer->rtt_dev >> 2, (peer->timeout.sec), (peer->timeout.usec)));
6090 /* Find all server connections that have not been active for a long time, and
6093 rxi_ReapConnections(struct rxevent *unused, void *unused1, void *unused2)
6095 struct clock now, when;
6096 clock_GetTime(&now);
6098 /* Find server connection structures that haven't been used for
6099 * greater than rx_idleConnectionTime */
6101 struct rx_connection **conn_ptr, **conn_end;
6102 int i, havecalls = 0;
6103 MUTEX_ENTER(&rx_connHashTable_lock);
6104 for (conn_ptr = &rx_connHashTable[0], conn_end =
6105 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
6107 struct rx_connection *conn, *next;
6108 struct rx_call *call;
6112 for (conn = *conn_ptr; conn; conn = next) {
6113 /* XXX -- Shouldn't the connection be locked? */
6116 for (i = 0; i < RX_MAXCALLS; i++) {
6117 call = conn->call[i];
6121 code = MUTEX_TRYENTER(&call->lock);
6124 #ifdef RX_ENABLE_LOCKS
6125 result = rxi_CheckCall(call, 1);
6126 #else /* RX_ENABLE_LOCKS */
6127 result = rxi_CheckCall(call);
6128 #endif /* RX_ENABLE_LOCKS */
6129 MUTEX_EXIT(&call->lock);
6131 /* If CheckCall freed the call, it might
6132 * have destroyed the connection as well,
6133 * which screws up the linked lists.
6139 if (conn->type == RX_SERVER_CONNECTION) {
6140 /* This only actually destroys the connection if
6141 * there are no outstanding calls */
6142 MUTEX_ENTER(&conn->conn_data_lock);
6143 if (!havecalls && !conn->refCount
6144 && ((conn->lastSendTime + rx_idleConnectionTime) <
6146 conn->refCount++; /* it will be decr in rx_DestroyConn */
6147 MUTEX_EXIT(&conn->conn_data_lock);
6148 #ifdef RX_ENABLE_LOCKS
6149 rxi_DestroyConnectionNoLock(conn);
6150 #else /* RX_ENABLE_LOCKS */
6151 rxi_DestroyConnection(conn);
6152 #endif /* RX_ENABLE_LOCKS */
6154 #ifdef RX_ENABLE_LOCKS
6156 MUTEX_EXIT(&conn->conn_data_lock);
6158 #endif /* RX_ENABLE_LOCKS */
6162 #ifdef RX_ENABLE_LOCKS
6163 while (rx_connCleanup_list) {
6164 struct rx_connection *conn;
6165 conn = rx_connCleanup_list;
6166 rx_connCleanup_list = rx_connCleanup_list->next;
6167 MUTEX_EXIT(&rx_connHashTable_lock);
6168 rxi_CleanupConnection(conn);
6169 MUTEX_ENTER(&rx_connHashTable_lock);
6171 MUTEX_EXIT(&rx_connHashTable_lock);
6172 #endif /* RX_ENABLE_LOCKS */
6175 /* Find any peer structures that haven't been used (haven't had an
6176 * associated connection) for greater than rx_idlePeerTime */
6178 struct rx_peer **peer_ptr, **peer_end;
6180 MUTEX_ENTER(&rx_rpc_stats);
6181 MUTEX_ENTER(&rx_peerHashTable_lock);
6182 for (peer_ptr = &rx_peerHashTable[0], peer_end =
6183 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
6185 struct rx_peer *peer, *next, *prev;
6186 for (prev = peer = *peer_ptr; peer; peer = next) {
6188 code = MUTEX_TRYENTER(&peer->peer_lock);
6189 if ((code) && (peer->refCount == 0)
6190 && ((peer->idleWhen + rx_idlePeerTime) < now.sec)) {
6191 rx_interface_stat_p rpc_stat, nrpc_stat;
6193 MUTEX_EXIT(&peer->peer_lock);
6194 MUTEX_DESTROY(&peer->peer_lock);
6196 (&peer->rpcStats, rpc_stat, nrpc_stat,
6197 rx_interface_stat)) {
6198 unsigned int num_funcs;
6201 queue_Remove(&rpc_stat->queue_header);
6202 queue_Remove(&rpc_stat->all_peers);
6203 num_funcs = rpc_stat->stats[0].func_total;
6205 sizeof(rx_interface_stat_t) +
6206 rpc_stat->stats[0].func_total *
6207 sizeof(rx_function_entry_v1_t);
6209 rxi_Free(rpc_stat, space);
6210 rxi_rpc_peer_stat_cnt -= num_funcs;
6213 if (rx_stats_active)
6214 rx_MutexDecrement(rx_stats.nPeerStructs, rx_stats_mutex);
6215 if (peer == *peer_ptr) {
6222 MUTEX_EXIT(&peer->peer_lock);
6228 MUTEX_EXIT(&rx_peerHashTable_lock);
6229 MUTEX_EXIT(&rx_rpc_stats);
6232 /* THIS HACK IS A TEMPORARY HACK. The idea is that the race condition in
6233 * rxi_AllocSendPacket, if it hits, will be handled at the next conn
6234 * GC, just below. Really, we shouldn't have to keep moving packets from
6235 * one place to another, but instead ought to always know if we can
6236 * afford to hold onto a packet in its particular use. */
6237 MUTEX_ENTER(&rx_freePktQ_lock);
6238 if (rx_waitingForPackets) {
6239 rx_waitingForPackets = 0;
6240 #ifdef RX_ENABLE_LOCKS
6241 CV_BROADCAST(&rx_waitingForPackets_cv);
6243 osi_rxWakeup(&rx_waitingForPackets);
6246 MUTEX_EXIT(&rx_freePktQ_lock);
6249 when.sec += RX_REAP_TIME; /* Check every RX_REAP_TIME seconds */
6250 rxevent_Post(&when, rxi_ReapConnections, 0, 0);
6254 /* rxs_Release - This isn't strictly necessary but, since the macro name from
6255 * rx.h is sort of strange this is better. This is called with a security
6256 * object before it is discarded. Each connection using a security object has
6257 * its own refcount to the object so it won't actually be freed until the last
6258 * connection is destroyed.
6260 * This is the only rxs module call. A hold could also be written but no one
6264 rxs_Release(struct rx_securityClass *aobj)
6266 return RXS_Close(aobj);
6270 #define RXRATE_PKT_OH (RX_HEADER_SIZE + RX_IPUDP_SIZE)
6271 #define RXRATE_SMALL_PKT (RXRATE_PKT_OH + sizeof(struct rx_ackPacket))
6272 #define RXRATE_AVG_SMALL_PKT (RXRATE_PKT_OH + (sizeof(struct rx_ackPacket)/2))
6273 #define RXRATE_LARGE_PKT (RXRATE_SMALL_PKT + 256)
6275 /* Adjust our estimate of the transmission rate to this peer, given
6276 * that the packet p was just acked. We can adjust peer->timeout and
6277 * call->twind. Pragmatically, this is called
6278 * only with packets of maximal length.
6279 * Called with peer and call locked.
6283 rxi_ComputeRate(struct rx_peer *peer, struct rx_call *call,
6284 struct rx_packet *p, struct rx_packet *ackp, u_char ackReason)
6286 afs_int32 xferSize, xferMs;
6290 /* Count down packets */
6291 if (peer->rateFlag > 0)
6293 /* Do nothing until we're enabled */
6294 if (peer->rateFlag != 0)
6299 /* Count only when the ack seems legitimate */
6300 switch (ackReason) {
6301 case RX_ACK_REQUESTED:
6303 p->length + RX_HEADER_SIZE + call->conn->securityMaxTrailerSize;
6307 case RX_ACK_PING_RESPONSE:
6308 if (p) /* want the response to ping-request, not data send */
6310 clock_GetTime(&newTO);
6311 if (clock_Gt(&newTO, &call->pingRequestTime)) {
6312 clock_Sub(&newTO, &call->pingRequestTime);
6313 xferMs = (newTO.sec * 1000) + (newTO.usec / 1000);
6317 xferSize = rx_AckDataSize(rx_Window) + RX_HEADER_SIZE;
6324 dpf(("CONG peer %lx/%u: sample (%s) size %ld, %ld ms (to %d.%06d, rtt %u, ps %u)",
6325 ntohl(peer->host), ntohs(peer->port), (ackReason == RX_ACK_REQUESTED ? "dataack" : "pingack"),
6326 xferSize, xferMs, peer->timeout.sec, peer->timeout.usec, peer->smRtt, peer->ifMTU));
6328 /* Track only packets that are big enough. */
6329 if ((p->length + RX_HEADER_SIZE + call->conn->securityMaxTrailerSize) <
6333 /* absorb RTT data (in milliseconds) for these big packets */
6334 if (peer->smRtt == 0) {
6335 peer->smRtt = xferMs;
6337 peer->smRtt = ((peer->smRtt * 15) + xferMs + 4) >> 4;
6342 if (peer->countDown) {
6346 peer->countDown = 10; /* recalculate only every so often */
6348 /* In practice, we can measure only the RTT for full packets,
6349 * because of the way Rx acks the data that it receives. (If it's
6350 * smaller than a full packet, it often gets implicitly acked
6351 * either by the call response (from a server) or by the next call
6352 * (from a client), and either case confuses transmission times
6353 * with processing times.) Therefore, replace the above
6354 * more-sophisticated processing with a simpler version, where the
6355 * smoothed RTT is kept for full-size packets, and the time to
6356 * transmit a windowful of full-size packets is simply RTT *
6357 * windowSize. Again, we take two steps:
6358 - ensure the timeout is large enough for a single packet's RTT;
6359 - ensure that the window is small enough to fit in the desired timeout.*/
6361 /* First, the timeout check. */
6362 minTime = peer->smRtt;
6363 /* Get a reasonable estimate for a timeout period */
6365 newTO.sec = minTime / 1000;
6366 newTO.usec = (minTime - (newTO.sec * 1000)) * 1000;
6368 /* Increase the timeout period so that we can always do at least
6369 * one packet exchange */
6370 if (clock_Gt(&newTO, &peer->timeout)) {
6372 dpf(("CONG peer %lx/%u: timeout %d.%06d ==> %ld.%06d (rtt %u, ps %u)",
6373 ntohl(peer->host), ntohs(peer->port), peer->timeout.sec, peer->timeout.usec,
6374 newTO.sec, newTO.usec, peer->smRtt, peer->packetSize));
6376 peer->timeout = newTO;
6379 /* Now, get an estimate for the transmit window size. */
6380 minTime = peer->timeout.sec * 1000 + (peer->timeout.usec / 1000);
6381 /* Now, convert to the number of full packets that could fit in a
6382 * reasonable fraction of that interval */
6383 minTime /= (peer->smRtt << 1);
6384 xferSize = minTime; /* (make a copy) */
6386 /* Now clamp the size to reasonable bounds. */
6389 else if (minTime > rx_Window)
6390 minTime = rx_Window;
6391 /* if (minTime != peer->maxWindow) {
6392 dpf(("CONG peer %lx/%u: windowsize %lu ==> %lu (to %lu.%06lu, rtt %u, ps %u)",
6393 ntohl(peer->host), ntohs(peer->port), peer->maxWindow, minTime,
6394 peer->timeout.sec, peer->timeout.usec, peer->smRtt,
6396 peer->maxWindow = minTime;
6397 elide... call->twind = minTime;
6401 /* Cut back on the peer timeout if it had earlier grown unreasonably.
6402 * Discern this by calculating the timeout necessary for rx_Window
6404 if ((xferSize > rx_Window) && (peer->timeout.sec >= 3)) {
6405 /* calculate estimate for transmission interval in milliseconds */
6406 minTime = rx_Window * peer->smRtt;
6407 if (minTime < 1000) {
6408 dpf(("CONG peer %lx/%u: cut TO %d.%06d by 0.5 (rtt %u, ps %u)",
6409 ntohl(peer->host), ntohs(peer->port), peer->timeout.sec,
6410 peer->timeout.usec, peer->smRtt, peer->packetSize));
6412 newTO.sec = 0; /* cut back on timeout by half a second */
6413 newTO.usec = 500000;
6414 clock_Sub(&peer->timeout, &newTO);
6419 } /* end of rxi_ComputeRate */
6420 #endif /* ADAPT_WINDOW */
6428 #define TRACE_OPTION_RX_DEBUG 16
6436 code = RegOpenKeyEx(HKEY_LOCAL_MACHINE, AFSREG_CLT_SVC_PARAM_SUBKEY,
6437 0, KEY_QUERY_VALUE, &parmKey);
6438 if (code != ERROR_SUCCESS)
6441 dummyLen = sizeof(TraceOption);
6442 code = RegQueryValueEx(parmKey, "TraceOption", NULL, NULL,
6443 (BYTE *) &TraceOption, &dummyLen);
6444 if (code == ERROR_SUCCESS) {
6445 rxdebug_active = (TraceOption & TRACE_OPTION_RX_DEBUG) ? 1 : 0;
6447 RegCloseKey (parmKey);
6448 #endif /* AFS_NT40_ENV */
6453 rx_DebugOnOff(int on)
6457 rxdebug_active = on;
6463 rx_StatsOnOff(int on)
6466 rx_stats_active = on;
6471 /* Don't call this debugging routine directly; use dpf */
6473 rxi_DebugPrint(char *format, ...)
6482 va_start(ap, format);
6484 len = _snprintf(tformat, sizeof(tformat), "tid[%d] %s", GetCurrentThreadId(), format);
6487 len = _vsnprintf(msg, sizeof(msg)-2, tformat, ap);
6489 if (msg[len-1] != '\n') {
6493 OutputDebugString(msg);
6500 va_start(ap, format);
6502 clock_GetTime(&now);
6503 fprintf(rx_Log, " %d.%06d:", (unsigned int)now.sec,
6504 (unsigned int)now.usec);
6505 vfprintf(rx_Log, format, ap);
6514 * This function is used to process the rx_stats structure that is local
6515 * to a process as well as an rx_stats structure received from a remote
6516 * process (via rxdebug). Therefore, it needs to do minimal version
6520 rx_PrintTheseStats(FILE * file, struct rx_statistics *s, int size,
6521 afs_int32 freePackets, char version)
6526 if (size != sizeof(struct rx_statistics)) {
6528 "Unexpected size of stats structure: was %d, expected %" AFS_SIZET_FMT "\n",
6529 size, sizeof(struct rx_statistics));
6532 fprintf(file, "rx stats: free packets %d, allocs %d, ", (int)freePackets,
6535 if (version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
6536 fprintf(file, "alloc-failures(rcv %u/%u,send %u/%u,ack %u)\n",
6537 s->receivePktAllocFailures, s->receiveCbufPktAllocFailures,
6538 s->sendPktAllocFailures, s->sendCbufPktAllocFailures,
6539 s->specialPktAllocFailures);
6541 fprintf(file, "alloc-failures(rcv %u,send %u,ack %u)\n",
6542 s->receivePktAllocFailures, s->sendPktAllocFailures,
6543 s->specialPktAllocFailures);
6547 " greedy %u, " "bogusReads %u (last from host %x), "
6548 "noPackets %u, " "noBuffers %u, " "selects %u, "
6549 "sendSelects %u\n", s->socketGreedy, s->bogusPacketOnRead,
6550 s->bogusHost, s->noPacketOnRead, s->noPacketBuffersOnRead,
6551 s->selects, s->sendSelects);
6553 fprintf(file, " packets read: ");
6554 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
6555 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsRead[i]);
6557 fprintf(file, "\n");
6560 " other read counters: data %u, " "ack %u, " "dup %u "
6561 "spurious %u " "dally %u\n", s->dataPacketsRead,
6562 s->ackPacketsRead, s->dupPacketsRead, s->spuriousPacketsRead,
6563 s->ignorePacketDally);
6565 fprintf(file, " packets sent: ");
6566 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
6567 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsSent[i]);
6569 fprintf(file, "\n");
6572 " other send counters: ack %u, " "data %u (not resends), "
6573 "resends %u, " "pushed %u, " "acked&ignored %u\n",
6574 s->ackPacketsSent, s->dataPacketsSent, s->dataPacketsReSent,
6575 s->dataPacketsPushed, s->ignoreAckedPacket);
6578 " \t(these should be small) sendFailed %u, " "fatalErrors %u\n",
6579 s->netSendFailures, (int)s->fatalErrors);
6581 if (s->nRttSamples) {
6582 fprintf(file, " Average rtt is %0.3f, with %d samples\n",
6583 clock_Float(&s->totalRtt) / s->nRttSamples, s->nRttSamples);
6585 fprintf(file, " Minimum rtt is %0.3f, maximum is %0.3f\n",
6586 clock_Float(&s->minRtt), clock_Float(&s->maxRtt));
6590 " %d server connections, " "%d client connections, "
6591 "%d peer structs, " "%d call structs, " "%d free call structs\n",
6592 s->nServerConns, s->nClientConns, s->nPeerStructs,
6593 s->nCallStructs, s->nFreeCallStructs);
6595 #if !defined(AFS_PTHREAD_ENV) && !defined(AFS_USE_GETTIMEOFDAY)
6596 fprintf(file, " %d clock updates\n", clock_nUpdates);
6599 fprintf(file, "ERROR: compiled without RXDEBUG\n");
6603 /* for backward compatibility */
6605 rx_PrintStats(FILE * file)
6607 MUTEX_ENTER(&rx_stats_mutex);
6608 rx_PrintTheseStats(file, &rx_stats, sizeof(rx_stats), rx_nFreePackets,
6610 MUTEX_EXIT(&rx_stats_mutex);
6614 rx_PrintPeerStats(FILE * file, struct rx_peer *peer)
6616 fprintf(file, "Peer %x.%d. " "Burst size %d, " "burst wait %d.%06d.\n",
6617 ntohl(peer->host), (int)peer->port, (int)peer->burstSize,
6618 (int)peer->burstWait.sec, (int)peer->burstWait.usec);
6621 " Rtt %d, " "retry time %u.%06d, " "total sent %d, "
6622 "resent %d\n", peer->rtt, (int)peer->timeout.sec,
6623 (int)peer->timeout.usec, peer->nSent, peer->reSends);
6626 " Packet size %d, " "max in packet skew %d, "
6627 "max out packet skew %d\n", peer->ifMTU, (int)peer->inPacketSkew,
6628 (int)peer->outPacketSkew);
6632 #if defined(AFS_PTHREAD_ENV) && defined(RXDEBUG)
6634 * This mutex protects the following static variables:
6638 #define LOCK_RX_DEBUG MUTEX_ENTER(&rx_debug_mutex)
6639 #define UNLOCK_RX_DEBUG MUTEX_EXIT(&rx_debug_mutex)
6641 #define LOCK_RX_DEBUG
6642 #define UNLOCK_RX_DEBUG
6643 #endif /* AFS_PTHREAD_ENV */
6647 MakeDebugCall(osi_socket socket, afs_uint32 remoteAddr, afs_uint16 remotePort,
6648 u_char type, void *inputData, size_t inputLength,
6649 void *outputData, size_t outputLength)
6651 static afs_int32 counter = 100;
6652 time_t waitTime, waitCount, startTime;
6653 struct rx_header theader;
6656 struct timeval tv_now, tv_wake, tv_delta;
6657 struct sockaddr_in taddr, faddr;
6666 startTime = time(0);
6672 tp = &tbuffer[sizeof(struct rx_header)];
6673 taddr.sin_family = AF_INET;
6674 taddr.sin_port = remotePort;
6675 taddr.sin_addr.s_addr = remoteAddr;
6676 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
6677 taddr.sin_len = sizeof(struct sockaddr_in);
6680 memset(&theader, 0, sizeof(theader));
6681 theader.epoch = htonl(999);
6683 theader.callNumber = htonl(counter);
6686 theader.type = type;
6687 theader.flags = RX_CLIENT_INITIATED | RX_LAST_PACKET;
6688 theader.serviceId = 0;
6690 memcpy(tbuffer, &theader, sizeof(theader));
6691 memcpy(tp, inputData, inputLength);
6693 sendto(socket, tbuffer, inputLength + sizeof(struct rx_header), 0,
6694 (struct sockaddr *)&taddr, sizeof(struct sockaddr_in));
6696 /* see if there's a packet available */
6697 gettimeofday(&tv_wake,0);
6698 tv_wake.tv_sec += waitTime;
6701 FD_SET(socket, &imask);
6702 tv_delta.tv_sec = tv_wake.tv_sec;
6703 tv_delta.tv_usec = tv_wake.tv_usec;
6704 gettimeofday(&tv_now, 0);
6706 if (tv_delta.tv_usec < tv_now.tv_usec) {
6708 tv_delta.tv_usec += 1000000;
6711 tv_delta.tv_usec -= tv_now.tv_usec;
6713 if (tv_delta.tv_sec < tv_now.tv_sec) {
6717 tv_delta.tv_sec -= tv_now.tv_sec;
6720 code = select(0, &imask, 0, 0, &tv_delta);
6721 #else /* AFS_NT40_ENV */
6722 code = select(socket + 1, &imask, 0, 0, &tv_delta);
6723 #endif /* AFS_NT40_ENV */
6724 if (code == 1 && FD_ISSET(socket, &imask)) {
6725 /* now receive a packet */
6726 faddrLen = sizeof(struct sockaddr_in);
6728 recvfrom(socket, tbuffer, sizeof(tbuffer), 0,
6729 (struct sockaddr *)&faddr, &faddrLen);
6732 memcpy(&theader, tbuffer, sizeof(struct rx_header));
6733 if (counter == ntohl(theader.callNumber))
6741 /* see if we've timed out */
6749 code -= sizeof(struct rx_header);
6750 if (code > outputLength)
6751 code = outputLength;
6752 memcpy(outputData, tp, code);
6755 #endif /* RXDEBUG */
6758 rx_GetServerDebug(osi_socket socket, afs_uint32 remoteAddr,
6759 afs_uint16 remotePort, struct rx_debugStats * stat,
6760 afs_uint32 * supportedValues)
6766 struct rx_debugIn in;
6768 *supportedValues = 0;
6769 in.type = htonl(RX_DEBUGI_GETSTATS);
6772 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
6773 &in, sizeof(in), stat, sizeof(*stat));
6776 * If the call was successful, fixup the version and indicate
6777 * what contents of the stat structure are valid.
6778 * Also do net to host conversion of fields here.
6782 if (stat->version >= RX_DEBUGI_VERSION_W_SECSTATS) {
6783 *supportedValues |= RX_SERVER_DEBUG_SEC_STATS;
6785 if (stat->version >= RX_DEBUGI_VERSION_W_GETALLCONN) {
6786 *supportedValues |= RX_SERVER_DEBUG_ALL_CONN;
6788 if (stat->version >= RX_DEBUGI_VERSION_W_RXSTATS) {
6789 *supportedValues |= RX_SERVER_DEBUG_RX_STATS;
6791 if (stat->version >= RX_DEBUGI_VERSION_W_WAITERS) {
6792 *supportedValues |= RX_SERVER_DEBUG_WAITER_CNT;
6794 if (stat->version >= RX_DEBUGI_VERSION_W_IDLETHREADS) {
6795 *supportedValues |= RX_SERVER_DEBUG_IDLE_THREADS;
6797 if (stat->version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
6798 *supportedValues |= RX_SERVER_DEBUG_NEW_PACKETS;
6800 if (stat->version >= RX_DEBUGI_VERSION_W_GETPEER) {
6801 *supportedValues |= RX_SERVER_DEBUG_ALL_PEER;
6803 if (stat->version >= RX_DEBUGI_VERSION_W_WAITED) {
6804 *supportedValues |= RX_SERVER_DEBUG_WAITED_CNT;
6806 if (stat->version >= RX_DEBUGI_VERSION_W_PACKETS) {
6807 *supportedValues |= RX_SERVER_DEBUG_PACKETS_CNT;
6809 stat->nFreePackets = ntohl(stat->nFreePackets);
6810 stat->packetReclaims = ntohl(stat->packetReclaims);
6811 stat->callsExecuted = ntohl(stat->callsExecuted);
6812 stat->nWaiting = ntohl(stat->nWaiting);
6813 stat->idleThreads = ntohl(stat->idleThreads);
6814 stat->nWaited = ntohl(stat->nWaited);
6815 stat->nPackets = ntohl(stat->nPackets);
6822 rx_GetServerStats(osi_socket socket, afs_uint32 remoteAddr,
6823 afs_uint16 remotePort, struct rx_statistics * stat,
6824 afs_uint32 * supportedValues)
6830 struct rx_debugIn in;
6831 afs_int32 *lp = (afs_int32 *) stat;
6835 * supportedValues is currently unused, but added to allow future
6836 * versioning of this function.
6839 *supportedValues = 0;
6840 in.type = htonl(RX_DEBUGI_RXSTATS);
6842 memset(stat, 0, sizeof(*stat));
6844 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
6845 &in, sizeof(in), stat, sizeof(*stat));
6850 * Do net to host conversion here
6853 for (i = 0; i < sizeof(*stat) / sizeof(afs_int32); i++, lp++) {
6862 rx_GetServerVersion(osi_socket socket, afs_uint32 remoteAddr,
6863 afs_uint16 remotePort, size_t version_length,
6868 return MakeDebugCall(socket, remoteAddr, remotePort,
6869 RX_PACKET_TYPE_VERSION, a, 1, version,
6877 rx_GetServerConnections(osi_socket socket, afs_uint32 remoteAddr,
6878 afs_uint16 remotePort, afs_int32 * nextConnection,
6879 int allConnections, afs_uint32 debugSupportedValues,
6880 struct rx_debugConn * conn,
6881 afs_uint32 * supportedValues)
6887 struct rx_debugIn in;
6891 * supportedValues is currently unused, but added to allow future
6892 * versioning of this function.
6895 *supportedValues = 0;
6896 if (allConnections) {
6897 in.type = htonl(RX_DEBUGI_GETALLCONN);
6899 in.type = htonl(RX_DEBUGI_GETCONN);
6901 in.index = htonl(*nextConnection);
6902 memset(conn, 0, sizeof(*conn));
6904 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
6905 &in, sizeof(in), conn, sizeof(*conn));
6908 *nextConnection += 1;
6911 * Convert old connection format to new structure.
6914 if (debugSupportedValues & RX_SERVER_DEBUG_OLD_CONN) {
6915 struct rx_debugConn_vL *vL = (struct rx_debugConn_vL *)conn;
6916 #define MOVEvL(a) (conn->a = vL->a)
6918 /* any old or unrecognized version... */
6919 for (i = 0; i < RX_MAXCALLS; i++) {
6920 MOVEvL(callState[i]);
6921 MOVEvL(callMode[i]);
6922 MOVEvL(callFlags[i]);
6923 MOVEvL(callOther[i]);
6925 if (debugSupportedValues & RX_SERVER_DEBUG_SEC_STATS) {
6926 MOVEvL(secStats.type);
6927 MOVEvL(secStats.level);
6928 MOVEvL(secStats.flags);
6929 MOVEvL(secStats.expires);
6930 MOVEvL(secStats.packetsReceived);
6931 MOVEvL(secStats.packetsSent);
6932 MOVEvL(secStats.bytesReceived);
6933 MOVEvL(secStats.bytesSent);
6938 * Do net to host conversion here
6940 * I don't convert host or port since we are most likely
6941 * going to want these in NBO.
6943 conn->cid = ntohl(conn->cid);
6944 conn->serial = ntohl(conn->serial);
6945 for (i = 0; i < RX_MAXCALLS; i++) {
6946 conn->callNumber[i] = ntohl(conn->callNumber[i]);
6948 conn->error = ntohl(conn->error);
6949 conn->secStats.flags = ntohl(conn->secStats.flags);
6950 conn->secStats.expires = ntohl(conn->secStats.expires);
6951 conn->secStats.packetsReceived =
6952 ntohl(conn->secStats.packetsReceived);
6953 conn->secStats.packetsSent = ntohl(conn->secStats.packetsSent);
6954 conn->secStats.bytesReceived = ntohl(conn->secStats.bytesReceived);
6955 conn->secStats.bytesSent = ntohl(conn->secStats.bytesSent);
6956 conn->epoch = ntohl(conn->epoch);
6957 conn->natMTU = ntohl(conn->natMTU);
6964 rx_GetServerPeers(osi_socket socket, afs_uint32 remoteAddr,
6965 afs_uint16 remotePort, afs_int32 * nextPeer,
6966 afs_uint32 debugSupportedValues, struct rx_debugPeer * peer,
6967 afs_uint32 * supportedValues)
6973 struct rx_debugIn in;
6976 * supportedValues is currently unused, but added to allow future
6977 * versioning of this function.
6980 *supportedValues = 0;
6981 in.type = htonl(RX_DEBUGI_GETPEER);
6982 in.index = htonl(*nextPeer);
6983 memset(peer, 0, sizeof(*peer));
6985 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
6986 &in, sizeof(in), peer, sizeof(*peer));
6992 * Do net to host conversion here
6994 * I don't convert host or port since we are most likely
6995 * going to want these in NBO.
6997 peer->ifMTU = ntohs(peer->ifMTU);
6998 peer->idleWhen = ntohl(peer->idleWhen);
6999 peer->refCount = ntohs(peer->refCount);
7000 peer->burstWait.sec = ntohl(peer->burstWait.sec);
7001 peer->burstWait.usec = ntohl(peer->burstWait.usec);
7002 peer->rtt = ntohl(peer->rtt);
7003 peer->rtt_dev = ntohl(peer->rtt_dev);
7004 peer->timeout.sec = ntohl(peer->timeout.sec);
7005 peer->timeout.usec = ntohl(peer->timeout.usec);
7006 peer->nSent = ntohl(peer->nSent);
7007 peer->reSends = ntohl(peer->reSends);
7008 peer->inPacketSkew = ntohl(peer->inPacketSkew);
7009 peer->outPacketSkew = ntohl(peer->outPacketSkew);
7010 peer->rateFlag = ntohl(peer->rateFlag);
7011 peer->natMTU = ntohs(peer->natMTU);
7012 peer->maxMTU = ntohs(peer->maxMTU);
7013 peer->maxDgramPackets = ntohs(peer->maxDgramPackets);
7014 peer->ifDgramPackets = ntohs(peer->ifDgramPackets);
7015 peer->MTU = ntohs(peer->MTU);
7016 peer->cwind = ntohs(peer->cwind);
7017 peer->nDgramPackets = ntohs(peer->nDgramPackets);
7018 peer->congestSeq = ntohs(peer->congestSeq);
7019 peer->bytesSent.high = ntohl(peer->bytesSent.high);
7020 peer->bytesSent.low = ntohl(peer->bytesSent.low);
7021 peer->bytesReceived.high = ntohl(peer->bytesReceived.high);
7022 peer->bytesReceived.low = ntohl(peer->bytesReceived.low);
7029 rx_GetLocalPeers(afs_uint32 peerHost, afs_uint16 peerPort,
7030 struct rx_debugPeer * peerStats)
7033 afs_int32 error = 1; /* default to "did not succeed" */
7034 afs_uint32 hashValue = PEER_HASH(peerHost, peerPort);
7036 MUTEX_ENTER(&rx_peerHashTable_lock);
7037 for(tp = rx_peerHashTable[hashValue];
7038 tp != NULL; tp = tp->next) {
7039 if (tp->host == peerHost)
7046 peerStats->host = tp->host;
7047 peerStats->port = tp->port;
7048 peerStats->ifMTU = tp->ifMTU;
7049 peerStats->idleWhen = tp->idleWhen;
7050 peerStats->refCount = tp->refCount;
7051 peerStats->burstSize = tp->burstSize;
7052 peerStats->burst = tp->burst;
7053 peerStats->burstWait.sec = tp->burstWait.sec;
7054 peerStats->burstWait.usec = tp->burstWait.usec;
7055 peerStats->rtt = tp->rtt;
7056 peerStats->rtt_dev = tp->rtt_dev;
7057 peerStats->timeout.sec = tp->timeout.sec;
7058 peerStats->timeout.usec = tp->timeout.usec;
7059 peerStats->nSent = tp->nSent;
7060 peerStats->reSends = tp->reSends;
7061 peerStats->inPacketSkew = tp->inPacketSkew;
7062 peerStats->outPacketSkew = tp->outPacketSkew;
7063 peerStats->rateFlag = tp->rateFlag;
7064 peerStats->natMTU = tp->natMTU;
7065 peerStats->maxMTU = tp->maxMTU;
7066 peerStats->maxDgramPackets = tp->maxDgramPackets;
7067 peerStats->ifDgramPackets = tp->ifDgramPackets;
7068 peerStats->MTU = tp->MTU;
7069 peerStats->cwind = tp->cwind;
7070 peerStats->nDgramPackets = tp->nDgramPackets;
7071 peerStats->congestSeq = tp->congestSeq;
7072 peerStats->bytesSent.high = tp->bytesSent.high;
7073 peerStats->bytesSent.low = tp->bytesSent.low;
7074 peerStats->bytesReceived.high = tp->bytesReceived.high;
7075 peerStats->bytesReceived.low = tp->bytesReceived.low;
7077 MUTEX_EXIT(&rx_peerHashTable_lock);
7085 struct rx_serverQueueEntry *np;
7088 struct rx_call *call;
7089 struct rx_serverQueueEntry *sq;
7093 if (rxinit_status == 1) {
7095 return; /* Already shutdown. */
7099 #ifndef AFS_PTHREAD_ENV
7100 FD_ZERO(&rx_selectMask);
7101 #endif /* AFS_PTHREAD_ENV */
7102 rxi_dataQuota = RX_MAX_QUOTA;
7103 #ifndef AFS_PTHREAD_ENV
7105 #endif /* AFS_PTHREAD_ENV */
7108 #ifndef AFS_PTHREAD_ENV
7109 #ifndef AFS_USE_GETTIMEOFDAY
7111 #endif /* AFS_USE_GETTIMEOFDAY */
7112 #endif /* AFS_PTHREAD_ENV */
7114 while (!queue_IsEmpty(&rx_freeCallQueue)) {
7115 call = queue_First(&rx_freeCallQueue, rx_call);
7117 rxi_Free(call, sizeof(struct rx_call));
7120 while (!queue_IsEmpty(&rx_idleServerQueue)) {
7121 sq = queue_First(&rx_idleServerQueue, rx_serverQueueEntry);
7127 struct rx_peer **peer_ptr, **peer_end;
7128 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7129 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7131 struct rx_peer *peer, *next;
7132 for (peer = *peer_ptr; peer; peer = next) {
7133 rx_interface_stat_p rpc_stat, nrpc_stat;
7136 (&peer->rpcStats, rpc_stat, nrpc_stat,
7137 rx_interface_stat)) {
7138 unsigned int num_funcs;
7141 queue_Remove(&rpc_stat->queue_header);
7142 queue_Remove(&rpc_stat->all_peers);
7143 num_funcs = rpc_stat->stats[0].func_total;
7145 sizeof(rx_interface_stat_t) +
7146 rpc_stat->stats[0].func_total *
7147 sizeof(rx_function_entry_v1_t);
7149 rxi_Free(rpc_stat, space);
7150 MUTEX_ENTER(&rx_rpc_stats);
7151 rxi_rpc_peer_stat_cnt -= num_funcs;
7152 MUTEX_EXIT(&rx_rpc_stats);
7156 if (rx_stats_active)
7157 rx_MutexDecrement(rx_stats.nPeerStructs, rx_stats_mutex);
7161 for (i = 0; i < RX_MAX_SERVICES; i++) {
7163 rxi_Free(rx_services[i], sizeof(*rx_services[i]));
7165 for (i = 0; i < rx_hashTableSize; i++) {
7166 struct rx_connection *tc, *ntc;
7167 MUTEX_ENTER(&rx_connHashTable_lock);
7168 for (tc = rx_connHashTable[i]; tc; tc = ntc) {
7170 for (j = 0; j < RX_MAXCALLS; j++) {
7172 rxi_Free(tc->call[j], sizeof(*tc->call[j]));
7175 rxi_Free(tc, sizeof(*tc));
7177 MUTEX_EXIT(&rx_connHashTable_lock);
7180 MUTEX_ENTER(&freeSQEList_lock);
7182 while ((np = rx_FreeSQEList)) {
7183 rx_FreeSQEList = *(struct rx_serverQueueEntry **)np;
7184 MUTEX_DESTROY(&np->lock);
7185 rxi_Free(np, sizeof(*np));
7188 MUTEX_EXIT(&freeSQEList_lock);
7189 MUTEX_DESTROY(&freeSQEList_lock);
7190 MUTEX_DESTROY(&rx_freeCallQueue_lock);
7191 MUTEX_DESTROY(&rx_connHashTable_lock);
7192 MUTEX_DESTROY(&rx_peerHashTable_lock);
7193 MUTEX_DESTROY(&rx_serverPool_lock);
7195 osi_Free(rx_connHashTable,
7196 rx_hashTableSize * sizeof(struct rx_connection *));
7197 osi_Free(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
7199 UNPIN(rx_connHashTable,
7200 rx_hashTableSize * sizeof(struct rx_connection *));
7201 UNPIN(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
7203 rxi_FreeAllPackets();
7205 MUTEX_ENTER(&rx_quota_mutex);
7206 rxi_dataQuota = RX_MAX_QUOTA;
7207 rxi_availProcs = rxi_totalMin = rxi_minDeficit = 0;
7208 MUTEX_EXIT(&rx_quota_mutex);
7213 #ifdef RX_ENABLE_LOCKS
7215 osirx_AssertMine(afs_kmutex_t * lockaddr, char *msg)
7217 if (!MUTEX_ISMINE(lockaddr))
7218 osi_Panic("Lock not held: %s", msg);
7220 #endif /* RX_ENABLE_LOCKS */
7225 * Routines to implement connection specific data.
7229 rx_KeyCreate(rx_destructor_t rtn)
7232 MUTEX_ENTER(&rxi_keyCreate_lock);
7233 key = rxi_keyCreate_counter++;
7234 rxi_keyCreate_destructor = (rx_destructor_t *)
7235 realloc((void *)rxi_keyCreate_destructor,
7236 (key + 1) * sizeof(rx_destructor_t));
7237 rxi_keyCreate_destructor[key] = rtn;
7238 MUTEX_EXIT(&rxi_keyCreate_lock);
7243 rx_SetSpecific(struct rx_connection *conn, int key, void *ptr)
7246 MUTEX_ENTER(&conn->conn_data_lock);
7247 if (!conn->specific) {
7248 conn->specific = (void **)malloc((key + 1) * sizeof(void *));
7249 for (i = 0; i < key; i++)
7250 conn->specific[i] = NULL;
7251 conn->nSpecific = key + 1;
7252 conn->specific[key] = ptr;
7253 } else if (key >= conn->nSpecific) {
7254 conn->specific = (void **)
7255 realloc(conn->specific, (key + 1) * sizeof(void *));
7256 for (i = conn->nSpecific; i < key; i++)
7257 conn->specific[i] = NULL;
7258 conn->nSpecific = key + 1;
7259 conn->specific[key] = ptr;
7261 if (conn->specific[key] && rxi_keyCreate_destructor[key])
7262 (*rxi_keyCreate_destructor[key]) (conn->specific[key]);
7263 conn->specific[key] = ptr;
7265 MUTEX_EXIT(&conn->conn_data_lock);
7269 rx_GetSpecific(struct rx_connection *conn, int key)
7272 MUTEX_ENTER(&conn->conn_data_lock);
7273 if (key >= conn->nSpecific)
7276 ptr = conn->specific[key];
7277 MUTEX_EXIT(&conn->conn_data_lock);
7281 #endif /* !KERNEL */
7284 * processStats is a queue used to store the statistics for the local
7285 * process. Its contents are similar to the contents of the rpcStats
7286 * queue on a rx_peer structure, but the actual data stored within
7287 * this queue contains totals across the lifetime of the process (assuming
7288 * the stats have not been reset) - unlike the per peer structures
7289 * which can come and go based upon the peer lifetime.
7292 static struct rx_queue processStats = { &processStats, &processStats };
7295 * peerStats is a queue used to store the statistics for all peer structs.
7296 * Its contents are the union of all the peer rpcStats queues.
7299 static struct rx_queue peerStats = { &peerStats, &peerStats };
7302 * rxi_monitor_processStats is used to turn process wide stat collection
7306 static int rxi_monitor_processStats = 0;
7309 * rxi_monitor_peerStats is used to turn per peer stat collection on and off
7312 static int rxi_monitor_peerStats = 0;
7315 * rxi_AddRpcStat - given all of the information for a particular rpc
7316 * call, create (if needed) and update the stat totals for the rpc.
7320 * IN stats - the queue of stats that will be updated with the new value
7322 * IN rxInterface - a unique number that identifies the rpc interface
7324 * IN currentFunc - the index of the function being invoked
7326 * IN totalFunc - the total number of functions in this interface
7328 * IN queueTime - the amount of time this function waited for a thread
7330 * IN execTime - the amount of time this function invocation took to execute
7332 * IN bytesSent - the number bytes sent by this invocation
7334 * IN bytesRcvd - the number bytes received by this invocation
7336 * IN isServer - if true, this invocation was made to a server
7338 * IN remoteHost - the ip address of the remote host
7340 * IN remotePort - the port of the remote host
7342 * IN addToPeerList - if != 0, add newly created stat to the global peer list
7344 * INOUT counter - if a new stats structure is allocated, the counter will
7345 * be updated with the new number of allocated stat structures
7353 rxi_AddRpcStat(struct rx_queue *stats, afs_uint32 rxInterface,
7354 afs_uint32 currentFunc, afs_uint32 totalFunc,
7355 struct clock *queueTime, struct clock *execTime,
7356 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd, int isServer,
7357 afs_uint32 remoteHost, afs_uint32 remotePort,
7358 int addToPeerList, unsigned int *counter)
7361 rx_interface_stat_p rpc_stat, nrpc_stat;
7364 * See if there's already a structure for this interface
7367 for (queue_Scan(stats, rpc_stat, nrpc_stat, rx_interface_stat)) {
7368 if ((rpc_stat->stats[0].interfaceId == rxInterface)
7369 && (rpc_stat->stats[0].remote_is_server == isServer))
7374 * Didn't find a match so allocate a new structure and add it to the
7378 if (queue_IsEnd(stats, rpc_stat) || (rpc_stat == NULL)
7379 || (rpc_stat->stats[0].interfaceId != rxInterface)
7380 || (rpc_stat->stats[0].remote_is_server != isServer)) {
7385 sizeof(rx_interface_stat_t) +
7386 totalFunc * sizeof(rx_function_entry_v1_t);
7388 rpc_stat = (rx_interface_stat_p) rxi_Alloc(space);
7389 if (rpc_stat == NULL) {
7393 *counter += totalFunc;
7394 for (i = 0; i < totalFunc; i++) {
7395 rpc_stat->stats[i].remote_peer = remoteHost;
7396 rpc_stat->stats[i].remote_port = remotePort;
7397 rpc_stat->stats[i].remote_is_server = isServer;
7398 rpc_stat->stats[i].interfaceId = rxInterface;
7399 rpc_stat->stats[i].func_total = totalFunc;
7400 rpc_stat->stats[i].func_index = i;
7401 hzero(rpc_stat->stats[i].invocations);
7402 hzero(rpc_stat->stats[i].bytes_sent);
7403 hzero(rpc_stat->stats[i].bytes_rcvd);
7404 rpc_stat->stats[i].queue_time_sum.sec = 0;
7405 rpc_stat->stats[i].queue_time_sum.usec = 0;
7406 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
7407 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
7408 rpc_stat->stats[i].queue_time_min.sec = 9999999;
7409 rpc_stat->stats[i].queue_time_min.usec = 9999999;
7410 rpc_stat->stats[i].queue_time_max.sec = 0;
7411 rpc_stat->stats[i].queue_time_max.usec = 0;
7412 rpc_stat->stats[i].execution_time_sum.sec = 0;
7413 rpc_stat->stats[i].execution_time_sum.usec = 0;
7414 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
7415 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
7416 rpc_stat->stats[i].execution_time_min.sec = 9999999;
7417 rpc_stat->stats[i].execution_time_min.usec = 9999999;
7418 rpc_stat->stats[i].execution_time_max.sec = 0;
7419 rpc_stat->stats[i].execution_time_max.usec = 0;
7421 queue_Prepend(stats, rpc_stat);
7422 if (addToPeerList) {
7423 queue_Prepend(&peerStats, &rpc_stat->all_peers);
7428 * Increment the stats for this function
7431 hadd32(rpc_stat->stats[currentFunc].invocations, 1);
7432 hadd(rpc_stat->stats[currentFunc].bytes_sent, *bytesSent);
7433 hadd(rpc_stat->stats[currentFunc].bytes_rcvd, *bytesRcvd);
7434 clock_Add(&rpc_stat->stats[currentFunc].queue_time_sum, queueTime);
7435 clock_AddSq(&rpc_stat->stats[currentFunc].queue_time_sum_sqr, queueTime);
7436 if (clock_Lt(queueTime, &rpc_stat->stats[currentFunc].queue_time_min)) {
7437 rpc_stat->stats[currentFunc].queue_time_min = *queueTime;
7439 if (clock_Gt(queueTime, &rpc_stat->stats[currentFunc].queue_time_max)) {
7440 rpc_stat->stats[currentFunc].queue_time_max = *queueTime;
7442 clock_Add(&rpc_stat->stats[currentFunc].execution_time_sum, execTime);
7443 clock_AddSq(&rpc_stat->stats[currentFunc].execution_time_sum_sqr,
7445 if (clock_Lt(execTime, &rpc_stat->stats[currentFunc].execution_time_min)) {
7446 rpc_stat->stats[currentFunc].execution_time_min = *execTime;
7448 if (clock_Gt(execTime, &rpc_stat->stats[currentFunc].execution_time_max)) {
7449 rpc_stat->stats[currentFunc].execution_time_max = *execTime;
7457 * rx_IncrementTimeAndCount - increment the times and count for a particular
7462 * IN peer - the peer who invoked the rpc
7464 * IN rxInterface - a unique number that identifies the rpc interface
7466 * IN currentFunc - the index of the function being invoked
7468 * IN totalFunc - the total number of functions in this interface
7470 * IN queueTime - the amount of time this function waited for a thread
7472 * IN execTime - the amount of time this function invocation took to execute
7474 * IN bytesSent - the number bytes sent by this invocation
7476 * IN bytesRcvd - the number bytes received by this invocation
7478 * IN isServer - if true, this invocation was made to a server
7486 rx_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
7487 afs_uint32 currentFunc, afs_uint32 totalFunc,
7488 struct clock *queueTime, struct clock *execTime,
7489 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd,
7493 if (!(rxi_monitor_peerStats || rxi_monitor_processStats))
7496 MUTEX_ENTER(&rx_rpc_stats);
7497 MUTEX_ENTER(&peer->peer_lock);
7499 if (rxi_monitor_peerStats) {
7500 rxi_AddRpcStat(&peer->rpcStats, rxInterface, currentFunc, totalFunc,
7501 queueTime, execTime, bytesSent, bytesRcvd, isServer,
7502 peer->host, peer->port, 1, &rxi_rpc_peer_stat_cnt);
7505 if (rxi_monitor_processStats) {
7506 rxi_AddRpcStat(&processStats, rxInterface, currentFunc, totalFunc,
7507 queueTime, execTime, bytesSent, bytesRcvd, isServer,
7508 0xffffffff, 0xffffffff, 0, &rxi_rpc_process_stat_cnt);
7511 MUTEX_EXIT(&peer->peer_lock);
7512 MUTEX_EXIT(&rx_rpc_stats);
7517 * rx_MarshallProcessRPCStats - marshall an array of rpc statistics
7521 * IN callerVersion - the rpc stat version of the caller.
7523 * IN count - the number of entries to marshall.
7525 * IN stats - pointer to stats to be marshalled.
7527 * OUT ptr - Where to store the marshalled data.
7534 rx_MarshallProcessRPCStats(afs_uint32 callerVersion, int count,
7535 rx_function_entry_v1_t * stats, afs_uint32 ** ptrP)
7541 * We only support the first version
7543 for (ptr = *ptrP, i = 0; i < count; i++, stats++) {
7544 *(ptr++) = stats->remote_peer;
7545 *(ptr++) = stats->remote_port;
7546 *(ptr++) = stats->remote_is_server;
7547 *(ptr++) = stats->interfaceId;
7548 *(ptr++) = stats->func_total;
7549 *(ptr++) = stats->func_index;
7550 *(ptr++) = hgethi(stats->invocations);
7551 *(ptr++) = hgetlo(stats->invocations);
7552 *(ptr++) = hgethi(stats->bytes_sent);
7553 *(ptr++) = hgetlo(stats->bytes_sent);
7554 *(ptr++) = hgethi(stats->bytes_rcvd);
7555 *(ptr++) = hgetlo(stats->bytes_rcvd);
7556 *(ptr++) = stats->queue_time_sum.sec;
7557 *(ptr++) = stats->queue_time_sum.usec;
7558 *(ptr++) = stats->queue_time_sum_sqr.sec;
7559 *(ptr++) = stats->queue_time_sum_sqr.usec;
7560 *(ptr++) = stats->queue_time_min.sec;
7561 *(ptr++) = stats->queue_time_min.usec;
7562 *(ptr++) = stats->queue_time_max.sec;
7563 *(ptr++) = stats->queue_time_max.usec;
7564 *(ptr++) = stats->execution_time_sum.sec;
7565 *(ptr++) = stats->execution_time_sum.usec;
7566 *(ptr++) = stats->execution_time_sum_sqr.sec;
7567 *(ptr++) = stats->execution_time_sum_sqr.usec;
7568 *(ptr++) = stats->execution_time_min.sec;
7569 *(ptr++) = stats->execution_time_min.usec;
7570 *(ptr++) = stats->execution_time_max.sec;
7571 *(ptr++) = stats->execution_time_max.usec;
7577 * rx_RetrieveProcessRPCStats - retrieve all of the rpc statistics for
7582 * IN callerVersion - the rpc stat version of the caller
7584 * OUT myVersion - the rpc stat version of this function
7586 * OUT clock_sec - local time seconds
7588 * OUT clock_usec - local time microseconds
7590 * OUT allocSize - the number of bytes allocated to contain stats
7592 * OUT statCount - the number stats retrieved from this process.
7594 * OUT stats - the actual stats retrieved from this process.
7598 * Returns void. If successful, stats will != NULL.
7602 rx_RetrieveProcessRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
7603 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
7604 size_t * allocSize, afs_uint32 * statCount,
7605 afs_uint32 ** stats)
7615 *myVersion = RX_STATS_RETRIEVAL_VERSION;
7618 * Check to see if stats are enabled
7621 MUTEX_ENTER(&rx_rpc_stats);
7622 if (!rxi_monitor_processStats) {
7623 MUTEX_EXIT(&rx_rpc_stats);
7627 clock_GetTime(&now);
7628 *clock_sec = now.sec;
7629 *clock_usec = now.usec;
7632 * Allocate the space based upon the caller version
7634 * If the client is at an older version than we are,
7635 * we return the statistic data in the older data format, but
7636 * we still return our version number so the client knows we
7637 * are maintaining more data than it can retrieve.
7640 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
7641 space = rxi_rpc_process_stat_cnt * sizeof(rx_function_entry_v1_t);
7642 *statCount = rxi_rpc_process_stat_cnt;
7645 * This can't happen yet, but in the future version changes
7646 * can be handled by adding additional code here
7650 if (space > (size_t) 0) {
7652 ptr = *stats = (afs_uint32 *) rxi_Alloc(space);
7655 rx_interface_stat_p rpc_stat, nrpc_stat;
7659 (&processStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
7661 * Copy the data based upon the caller version
7663 rx_MarshallProcessRPCStats(callerVersion,
7664 rpc_stat->stats[0].func_total,
7665 rpc_stat->stats, &ptr);
7671 MUTEX_EXIT(&rx_rpc_stats);
7676 * rx_RetrievePeerRPCStats - retrieve all of the rpc statistics for the peers
7680 * IN callerVersion - the rpc stat version of the caller
7682 * OUT myVersion - the rpc stat version of this function
7684 * OUT clock_sec - local time seconds
7686 * OUT clock_usec - local time microseconds
7688 * OUT allocSize - the number of bytes allocated to contain stats
7690 * OUT statCount - the number of stats retrieved from the individual
7693 * OUT stats - the actual stats retrieved from the individual peer structures.
7697 * Returns void. If successful, stats will != NULL.
7701 rx_RetrievePeerRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
7702 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
7703 size_t * allocSize, afs_uint32 * statCount,
7704 afs_uint32 ** stats)
7714 *myVersion = RX_STATS_RETRIEVAL_VERSION;
7717 * Check to see if stats are enabled
7720 MUTEX_ENTER(&rx_rpc_stats);
7721 if (!rxi_monitor_peerStats) {
7722 MUTEX_EXIT(&rx_rpc_stats);
7726 clock_GetTime(&now);
7727 *clock_sec = now.sec;
7728 *clock_usec = now.usec;
7731 * Allocate the space based upon the caller version
7733 * If the client is at an older version than we are,
7734 * we return the statistic data in the older data format, but
7735 * we still return our version number so the client knows we
7736 * are maintaining more data than it can retrieve.
7739 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
7740 space = rxi_rpc_peer_stat_cnt * sizeof(rx_function_entry_v1_t);
7741 *statCount = rxi_rpc_peer_stat_cnt;
7744 * This can't happen yet, but in the future version changes
7745 * can be handled by adding additional code here
7749 if (space > (size_t) 0) {
7751 ptr = *stats = (afs_uint32 *) rxi_Alloc(space);
7754 rx_interface_stat_p rpc_stat, nrpc_stat;
7758 (&peerStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
7760 * We have to fix the offset of rpc_stat since we are
7761 * keeping this structure on two rx_queues. The rx_queue
7762 * package assumes that the rx_queue member is the first
7763 * member of the structure. That is, rx_queue assumes that
7764 * any one item is only on one queue at a time. We are
7765 * breaking that assumption and so we have to do a little
7766 * math to fix our pointers.
7769 fix_offset = (char *)rpc_stat;
7770 fix_offset -= offsetof(rx_interface_stat_t, all_peers);
7771 rpc_stat = (rx_interface_stat_p) fix_offset;
7774 * Copy the data based upon the caller version
7776 rx_MarshallProcessRPCStats(callerVersion,
7777 rpc_stat->stats[0].func_total,
7778 rpc_stat->stats, &ptr);
7784 MUTEX_EXIT(&rx_rpc_stats);
7789 * rx_FreeRPCStats - free memory allocated by
7790 * rx_RetrieveProcessRPCStats and rx_RetrievePeerRPCStats
7794 * IN stats - stats previously returned by rx_RetrieveProcessRPCStats or
7795 * rx_RetrievePeerRPCStats
7797 * IN allocSize - the number of bytes in stats.
7805 rx_FreeRPCStats(afs_uint32 * stats, size_t allocSize)
7807 rxi_Free(stats, allocSize);
7811 * rx_queryProcessRPCStats - see if process rpc stat collection is
7812 * currently enabled.
7818 * Returns 0 if stats are not enabled != 0 otherwise
7822 rx_queryProcessRPCStats(void)
7825 MUTEX_ENTER(&rx_rpc_stats);
7826 rc = rxi_monitor_processStats;
7827 MUTEX_EXIT(&rx_rpc_stats);
7832 * rx_queryPeerRPCStats - see if peer stat collection is currently enabled.
7838 * Returns 0 if stats are not enabled != 0 otherwise
7842 rx_queryPeerRPCStats(void)
7845 MUTEX_ENTER(&rx_rpc_stats);
7846 rc = rxi_monitor_peerStats;
7847 MUTEX_EXIT(&rx_rpc_stats);
7852 * rx_enableProcessRPCStats - begin rpc stat collection for entire process
7862 rx_enableProcessRPCStats(void)
7864 MUTEX_ENTER(&rx_rpc_stats);
7865 rx_enable_stats = 1;
7866 rxi_monitor_processStats = 1;
7867 MUTEX_EXIT(&rx_rpc_stats);
7871 * rx_enablePeerRPCStats - begin rpc stat collection per peer structure
7881 rx_enablePeerRPCStats(void)
7883 MUTEX_ENTER(&rx_rpc_stats);
7884 rx_enable_stats = 1;
7885 rxi_monitor_peerStats = 1;
7886 MUTEX_EXIT(&rx_rpc_stats);
7890 * rx_disableProcessRPCStats - stop rpc stat collection for entire process
7900 rx_disableProcessRPCStats(void)
7902 rx_interface_stat_p rpc_stat, nrpc_stat;
7905 MUTEX_ENTER(&rx_rpc_stats);
7908 * Turn off process statistics and if peer stats is also off, turn
7912 rxi_monitor_processStats = 0;
7913 if (rxi_monitor_peerStats == 0) {
7914 rx_enable_stats = 0;
7917 for (queue_Scan(&processStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
7918 unsigned int num_funcs = 0;
7921 queue_Remove(rpc_stat);
7922 num_funcs = rpc_stat->stats[0].func_total;
7924 sizeof(rx_interface_stat_t) +
7925 rpc_stat->stats[0].func_total * sizeof(rx_function_entry_v1_t);
7927 rxi_Free(rpc_stat, space);
7928 rxi_rpc_process_stat_cnt -= num_funcs;
7930 MUTEX_EXIT(&rx_rpc_stats);
7934 * rx_disablePeerRPCStats - stop rpc stat collection for peers
7944 rx_disablePeerRPCStats(void)
7946 struct rx_peer **peer_ptr, **peer_end;
7949 MUTEX_ENTER(&rx_rpc_stats);
7952 * Turn off peer statistics and if process stats is also off, turn
7956 rxi_monitor_peerStats = 0;
7957 if (rxi_monitor_processStats == 0) {
7958 rx_enable_stats = 0;
7961 MUTEX_ENTER(&rx_peerHashTable_lock);
7962 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7963 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7965 struct rx_peer *peer, *next, *prev;
7966 for (prev = peer = *peer_ptr; peer; peer = next) {
7968 code = MUTEX_TRYENTER(&peer->peer_lock);
7970 rx_interface_stat_p rpc_stat, nrpc_stat;
7973 (&peer->rpcStats, rpc_stat, nrpc_stat,
7974 rx_interface_stat)) {
7975 unsigned int num_funcs = 0;
7978 queue_Remove(&rpc_stat->queue_header);
7979 queue_Remove(&rpc_stat->all_peers);
7980 num_funcs = rpc_stat->stats[0].func_total;
7982 sizeof(rx_interface_stat_t) +
7983 rpc_stat->stats[0].func_total *
7984 sizeof(rx_function_entry_v1_t);
7986 rxi_Free(rpc_stat, space);
7987 rxi_rpc_peer_stat_cnt -= num_funcs;
7989 MUTEX_EXIT(&peer->peer_lock);
7990 if (prev == *peer_ptr) {
8000 MUTEX_EXIT(&rx_peerHashTable_lock);
8001 MUTEX_EXIT(&rx_rpc_stats);
8005 * rx_clearProcessRPCStats - clear the contents of the rpc stats according
8010 * IN clearFlag - flag indicating which stats to clear
8018 rx_clearProcessRPCStats(afs_uint32 clearFlag)
8020 rx_interface_stat_p rpc_stat, nrpc_stat;
8022 MUTEX_ENTER(&rx_rpc_stats);
8024 for (queue_Scan(&processStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8025 unsigned int num_funcs = 0, i;
8026 num_funcs = rpc_stat->stats[0].func_total;
8027 for (i = 0; i < num_funcs; i++) {
8028 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
8029 hzero(rpc_stat->stats[i].invocations);
8031 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
8032 hzero(rpc_stat->stats[i].bytes_sent);
8034 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
8035 hzero(rpc_stat->stats[i].bytes_rcvd);
8037 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
8038 rpc_stat->stats[i].queue_time_sum.sec = 0;
8039 rpc_stat->stats[i].queue_time_sum.usec = 0;
8041 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
8042 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
8043 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
8045 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
8046 rpc_stat->stats[i].queue_time_min.sec = 9999999;
8047 rpc_stat->stats[i].queue_time_min.usec = 9999999;
8049 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
8050 rpc_stat->stats[i].queue_time_max.sec = 0;
8051 rpc_stat->stats[i].queue_time_max.usec = 0;
8053 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
8054 rpc_stat->stats[i].execution_time_sum.sec = 0;
8055 rpc_stat->stats[i].execution_time_sum.usec = 0;
8057 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
8058 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
8059 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
8061 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
8062 rpc_stat->stats[i].execution_time_min.sec = 9999999;
8063 rpc_stat->stats[i].execution_time_min.usec = 9999999;
8065 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
8066 rpc_stat->stats[i].execution_time_max.sec = 0;
8067 rpc_stat->stats[i].execution_time_max.usec = 0;
8072 MUTEX_EXIT(&rx_rpc_stats);
8076 * rx_clearPeerRPCStats - clear the contents of the rpc stats according
8081 * IN clearFlag - flag indicating which stats to clear
8089 rx_clearPeerRPCStats(afs_uint32 clearFlag)
8091 rx_interface_stat_p rpc_stat, nrpc_stat;
8093 MUTEX_ENTER(&rx_rpc_stats);
8095 for (queue_Scan(&peerStats, rpc_stat, nrpc_stat, rx_interface_stat)) {
8096 unsigned int num_funcs = 0, i;
8099 * We have to fix the offset of rpc_stat since we are
8100 * keeping this structure on two rx_queues. The rx_queue
8101 * package assumes that the rx_queue member is the first
8102 * member of the structure. That is, rx_queue assumes that
8103 * any one item is only on one queue at a time. We are
8104 * breaking that assumption and so we have to do a little
8105 * math to fix our pointers.
8108 fix_offset = (char *)rpc_stat;
8109 fix_offset -= offsetof(rx_interface_stat_t, all_peers);
8110 rpc_stat = (rx_interface_stat_p) fix_offset;
8112 num_funcs = rpc_stat->stats[0].func_total;
8113 for (i = 0; i < num_funcs; i++) {
8114 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
8115 hzero(rpc_stat->stats[i].invocations);
8117 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
8118 hzero(rpc_stat->stats[i].bytes_sent);
8120 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
8121 hzero(rpc_stat->stats[i].bytes_rcvd);
8123 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
8124 rpc_stat->stats[i].queue_time_sum.sec = 0;
8125 rpc_stat->stats[i].queue_time_sum.usec = 0;
8127 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
8128 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
8129 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
8131 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
8132 rpc_stat->stats[i].queue_time_min.sec = 9999999;
8133 rpc_stat->stats[i].queue_time_min.usec = 9999999;
8135 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
8136 rpc_stat->stats[i].queue_time_max.sec = 0;
8137 rpc_stat->stats[i].queue_time_max.usec = 0;
8139 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
8140 rpc_stat->stats[i].execution_time_sum.sec = 0;
8141 rpc_stat->stats[i].execution_time_sum.usec = 0;
8143 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
8144 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
8145 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
8147 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
8148 rpc_stat->stats[i].execution_time_min.sec = 9999999;
8149 rpc_stat->stats[i].execution_time_min.usec = 9999999;
8151 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
8152 rpc_stat->stats[i].execution_time_max.sec = 0;
8153 rpc_stat->stats[i].execution_time_max.usec = 0;
8158 MUTEX_EXIT(&rx_rpc_stats);
8162 * rxi_rxstat_userok points to a routine that returns 1 if the caller
8163 * is authorized to enable/disable/clear RX statistics.
8165 static int (*rxi_rxstat_userok) (struct rx_call * call) = NULL;
8168 rx_SetRxStatUserOk(int (*proc) (struct rx_call * call))
8170 rxi_rxstat_userok = proc;
8174 rx_RxStatUserOk(struct rx_call *call)
8176 if (!rxi_rxstat_userok)
8178 return rxi_rxstat_userok(call);
8183 * DllMain() -- Entry-point function called by the DllMainCRTStartup()
8184 * function in the MSVC runtime DLL (msvcrt.dll).
8186 * Note: the system serializes calls to this function.
8189 DllMain(HINSTANCE dllInstHandle, /* instance handle for this DLL module */
8190 DWORD reason, /* reason function is being called */
8191 LPVOID reserved) /* reserved for future use */
8194 case DLL_PROCESS_ATTACH:
8195 /* library is being attached to a process */
8199 case DLL_PROCESS_DETACH:
8206 #endif /* AFS_NT40_ENV */
8209 int rx_DumpCalls(FILE *outputFile, char *cookie)
8211 #ifdef RXDEBUG_PACKET
8212 #ifdef KDUMP_RX_LOCK
8213 struct rx_call_rx_lock *c;
8220 #define RXDPRINTF sprintf
8221 #define RXDPRINTOUT output
8223 #define RXDPRINTF fprintf
8224 #define RXDPRINTOUT outputFile
8227 RXDPRINTF(RXDPRINTOUT, "%s - Start dumping all Rx Calls - count=%u\r\n", cookie, rx_stats.nCallStructs);
8229 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
8232 for (c = rx_allCallsp; c; c = c->allNextp) {
8233 u_short rqc, tqc, iovqc;
8234 struct rx_packet *p, *np;
8236 MUTEX_ENTER(&c->lock);
8237 queue_Count(&c->rq, p, np, rx_packet, rqc);
8238 queue_Count(&c->tq, p, np, rx_packet, tqc);
8239 queue_Count(&c->iovq, p, np, rx_packet, iovqc);
8241 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, "
8242 "rqc=%u,%u, tqc=%u,%u, iovqc=%u,%u, "
8243 "lstatus=%u, rstatus=%u, error=%d, timeout=%u, "
8244 "resendEvent=%d, timeoutEvt=%d, keepAliveEvt=%d, delayedAckEvt=%d, delayedAbortEvt=%d, abortCode=%d, abortCount=%d, "
8245 "lastSendTime=%u, lastRecvTime=%u, lastSendData=%u"
8246 #ifdef RX_ENABLE_LOCKS
8249 #ifdef RX_REFCOUNT_CHECK
8250 ", refCountBegin=%u, refCountResend=%u, refCountDelay=%u, "
8251 "refCountAlive=%u, refCountPacket=%u, refCountSend=%u, refCountAckAll=%u, refCountAbort=%u"
8254 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,
8255 c->callNumber?*c->callNumber:0, c->conn?c->conn->flags:0, c->flags,
8256 (afs_uint32)c->rqc, (afs_uint32)rqc, (afs_uint32)c->tqc, (afs_uint32)tqc, (afs_uint32)c->iovqc, (afs_uint32)iovqc,
8257 (afs_uint32)c->localStatus, (afs_uint32)c->remoteStatus, c->error, c->timeout,
8258 c->resendEvent?1:0, c->timeoutEvent?1:0, c->keepAliveEvent?1:0, c->delayedAckEvent?1:0, c->delayedAbortEvent?1:0,
8259 c->abortCode, c->abortCount, c->lastSendTime, c->lastReceiveTime, c->lastSendData
8260 #ifdef RX_ENABLE_LOCKS
8261 , (afs_uint32)c->refCount
8263 #ifdef RX_REFCOUNT_CHECK
8264 , c->refCDebug[0],c->refCDebug[1],c->refCDebug[2],c->refCDebug[3],c->refCDebug[4],c->refCDebug[5],c->refCDebug[6],c->refCDebug[7]
8267 MUTEX_EXIT(&c->lock);
8270 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
8273 RXDPRINTF(RXDPRINTOUT, "%s - End dumping all Rx Calls\r\n", cookie);
8275 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
8277 #endif /* RXDEBUG_PACKET */