2 * Copyright 2000, International Business Machines Corporation and others.
5 * This software has been released under the terms of the IBM Public
6 * License. For details, see the LICENSE file in the top-level source
7 * directory or online at http://www.openafs.org/dl/license10.html
10 /* RX: Extended Remote Procedure Call */
12 #include <afsconfig.h>
13 #include <afs/param.h>
16 # include "afs/sysincludes.h"
17 # include "afsincludes.h"
22 # ifdef AFS_LINUX20_ENV
23 # include "h/socket.h"
25 # include "netinet/in.h"
27 # include "netinet/ip6.h"
28 # include "inet/common.h"
30 # include "inet/ip_ire.h"
32 # include "afs/afs_args.h"
33 # include "afs/afs_osi.h"
34 # ifdef RX_KERNEL_TRACE
35 # include "rx_kcommon.h"
37 # if defined(AFS_AIX_ENV)
41 # undef RXDEBUG /* turn off debugging */
43 # if defined(AFS_SGI_ENV)
44 # include "sys/debug.h"
47 # include "afs/sysincludes.h"
48 # include "afsincludes.h"
49 # endif /* !UKERNEL */
50 # include "afs/lock.h"
51 # include "rx_kmutex.h"
52 # include "rx_kernel.h"
53 # define AFSOP_STOP_RXCALLBACK 210 /* Stop CALLBACK process */
54 # define AFSOP_STOP_AFS 211 /* Stop AFS process */
55 # define AFSOP_STOP_BKG 212 /* Stop BKG process */
56 extern afs_int32 afs_termState;
58 # include "sys/lockl.h"
59 # include "sys/lock_def.h"
60 # endif /* AFS_AIX41_ENV */
61 # include "afs/rxgen_consts.h"
66 # include <afs/afsutil.h>
67 # include <WINNT\afsreg.h>
75 #include <opr/queue.h>
76 #include <hcrypto/rand.h>
80 #include "rx_atomic.h"
81 #include "rx_globals.h"
83 #include "rx_internal.h"
90 #include "rx_packet.h"
91 #include "rx_server.h"
93 #include <afs/rxgen_consts.h>
96 #ifdef AFS_PTHREAD_ENV
98 int (*registerProgram) (pid_t, char *) = 0;
99 int (*swapNameProgram) (pid_t, const char *, char *) = 0;
102 int (*registerProgram) (PROCESS, char *) = 0;
103 int (*swapNameProgram) (PROCESS, const char *, char *) = 0;
107 /* Local static routines */
108 static void rxi_DestroyConnectionNoLock(struct rx_connection *conn);
109 static void rxi_ComputeRoundTripTime(struct rx_packet *, struct rx_ackPacket *,
110 struct rx_call *, struct rx_peer *,
112 static void rxi_Resend(struct rxevent *event, void *arg0, void *arg1,
114 static void rxi_SendDelayedAck(struct rxevent *event, void *call,
115 void *dummy, int dummy2);
116 static void rxi_SendDelayedCallAbort(struct rxevent *event, void *arg1,
117 void *dummy, int dummy2);
118 static void rxi_SendDelayedConnAbort(struct rxevent *event, void *arg1,
119 void *unused, int unused2);
120 static void rxi_ReapConnections(struct rxevent *unused, void *unused1,
121 void *unused2, int unused3);
122 static struct rx_packet *rxi_SendCallAbort(struct rx_call *call,
123 struct rx_packet *packet,
124 int istack, int force);
125 static void rxi_AckAll(struct rx_call *call);
126 static struct rx_connection
127 *rxi_FindConnection(osi_socket socket, afs_uint32 host, u_short port,
128 u_short serviceId, afs_uint32 cid,
129 afs_uint32 epoch, int type, u_int securityIndex,
130 int *unknownService);
131 static struct rx_packet
132 *rxi_ReceiveDataPacket(struct rx_call *call, struct rx_packet *np,
133 int istack, osi_socket socket,
134 afs_uint32 host, u_short port, int *tnop,
135 struct rx_call **newcallp);
136 static struct rx_packet
137 *rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
139 static struct rx_packet
140 *rxi_ReceiveResponsePacket(struct rx_connection *conn,
141 struct rx_packet *np, int istack);
142 static struct rx_packet
143 *rxi_ReceiveChallengePacket(struct rx_connection *conn,
144 struct rx_packet *np, int istack);
145 static void rxi_AttachServerProc(struct rx_call *call, osi_socket socket,
146 int *tnop, struct rx_call **newcallp);
147 static void rxi_ClearTransmitQueue(struct rx_call *call, int force);
148 static void rxi_ClearReceiveQueue(struct rx_call *call);
149 static void rxi_ResetCall(struct rx_call *call, int newcall);
150 static void rxi_ScheduleKeepAliveEvent(struct rx_call *call);
151 static void rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn);
152 static void rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs);
153 static void rxi_KeepAliveOn(struct rx_call *call);
154 static void rxi_GrowMTUOn(struct rx_call *call);
155 static void rxi_ChallengeOn(struct rx_connection *conn);
156 static int rxi_CheckCall(struct rx_call *call, int haveCTLock);
157 static void rxi_AckAllInTransmitQueue(struct rx_call *call);
158 static void rxi_CancelKeepAliveEvent(struct rx_call *call);
159 static void rxi_CancelDelayedAbortEvent(struct rx_call *call);
160 static void rxi_CancelGrowMTUEvent(struct rx_call *call);
161 static void update_nextCid(void);
163 #ifdef RX_ENABLE_LOCKS
165 rx_atomic_t rxi_start_aborted; /* rxi_start awoke after rxi_Send in error.*/
166 rx_atomic_t rxi_start_in_error;
168 #endif /* RX_ENABLE_LOCKS */
170 /* Constant delay time before sending an acknowledge of the last packet
171 * received. This is to avoid sending an extra acknowledge when the
172 * client is about to make another call, anyway, or the server is
175 * The lastAckDelay may not exceeed 400ms without causing peers to
176 * unecessarily timeout.
178 struct clock rx_lastAckDelay = {0, 400000};
180 /* Constant delay time before sending a soft ack when none was requested.
181 * This is to make sure we send soft acks before the sender times out,
182 * Normally we wait and send a hard ack when the receiver consumes the packet
184 * This value has been 100ms in all shipping versions of OpenAFS. Changing it
185 * will require changes to the peer's RTT calculations.
187 struct clock rx_softAckDelay = {0, 100000};
190 * rxi_rpc_peer_stat_cnt counts the total number of peer stat structures
191 * currently allocated within rx. This number is used to allocate the
192 * memory required to return the statistics when queried.
193 * Protected by the rx_rpc_stats mutex.
196 static unsigned int rxi_rpc_peer_stat_cnt;
199 * rxi_rpc_process_stat_cnt counts the total number of local process stat
200 * structures currently allocated within rx. The number is used to allocate
201 * the memory required to return the statistics when queried.
202 * Protected by the rx_rpc_stats mutex.
205 static unsigned int rxi_rpc_process_stat_cnt;
207 rx_atomic_t rx_nWaiting = RX_ATOMIC_INIT(0);
208 rx_atomic_t rx_nWaited = RX_ATOMIC_INIT(0);
210 /* Incoming calls wait on this queue when there are no available
211 * server processes */
212 struct opr_queue rx_incomingCallQueue;
214 /* Server processes wait on this queue when there are no appropriate
215 * calls to process */
216 struct opr_queue rx_idleServerQueue;
218 #if !defined(offsetof)
219 #include <stddef.h> /* for definition of offsetof() */
222 #ifdef RX_ENABLE_LOCKS
223 afs_kmutex_t rx_atomic_mutex;
226 /* Forward prototypes */
227 static struct rx_call * rxi_NewCall(struct rx_connection *, int);
230 putConnection (struct rx_connection *conn) {
231 MUTEX_ENTER(&rx_refcnt_mutex);
233 MUTEX_EXIT(&rx_refcnt_mutex);
236 #ifdef AFS_PTHREAD_ENV
239 * Use procedural initialization of mutexes/condition variables
243 extern afs_kmutex_t rx_quota_mutex;
244 extern afs_kmutex_t rx_pthread_mutex;
245 extern afs_kmutex_t rx_packets_mutex;
246 extern afs_kmutex_t rx_refcnt_mutex;
247 extern afs_kmutex_t des_init_mutex;
248 extern afs_kmutex_t des_random_mutex;
250 extern afs_kmutex_t rx_clock_mutex;
251 extern afs_kmutex_t rxi_connCacheMutex;
252 extern afs_kmutex_t event_handler_mutex;
253 extern afs_kmutex_t listener_mutex;
254 extern afs_kmutex_t rx_if_init_mutex;
255 extern afs_kmutex_t rx_if_mutex;
257 extern afs_kcondvar_t rx_event_handler_cond;
258 extern afs_kcondvar_t rx_listener_cond;
261 static afs_kmutex_t epoch_mutex;
262 static afs_kmutex_t rx_init_mutex;
263 static afs_kmutex_t rx_debug_mutex;
264 static afs_kmutex_t rx_rpc_stats;
267 rxi_InitPthread(void)
269 MUTEX_INIT(&rx_quota_mutex, "quota", MUTEX_DEFAULT, 0);
270 MUTEX_INIT(&rx_pthread_mutex, "pthread", MUTEX_DEFAULT, 0);
271 MUTEX_INIT(&rx_packets_mutex, "packets", MUTEX_DEFAULT, 0);
272 MUTEX_INIT(&rx_refcnt_mutex, "refcnts", MUTEX_DEFAULT, 0);
274 MUTEX_INIT(&rx_clock_mutex, "clock", MUTEX_DEFAULT, 0);
275 MUTEX_INIT(&rxi_connCacheMutex, "conn cache", MUTEX_DEFAULT, 0);
276 MUTEX_INIT(&event_handler_mutex, "event handler", MUTEX_DEFAULT, 0);
277 MUTEX_INIT(&listener_mutex, "listener", MUTEX_DEFAULT, 0);
278 MUTEX_INIT(&rx_if_init_mutex, "if init", MUTEX_DEFAULT, 0);
279 MUTEX_INIT(&rx_if_mutex, "if", MUTEX_DEFAULT, 0);
281 MUTEX_INIT(&rx_stats_mutex, "stats", MUTEX_DEFAULT, 0);
282 MUTEX_INIT(&rx_atomic_mutex, "atomic", MUTEX_DEFAULT, 0);
283 MUTEX_INIT(&epoch_mutex, "epoch", MUTEX_DEFAULT, 0);
284 MUTEX_INIT(&rx_init_mutex, "init", MUTEX_DEFAULT, 0);
285 MUTEX_INIT(&rx_debug_mutex, "debug", MUTEX_DEFAULT, 0);
288 CV_INIT(&rx_event_handler_cond, "evhand", CV_DEFAULT, 0);
289 CV_INIT(&rx_listener_cond, "rxlisten", CV_DEFAULT, 0);
292 osi_Assert(pthread_key_create(&rx_thread_id_key, NULL) == 0);
293 osi_Assert(pthread_key_create(&rx_ts_info_key, NULL) == 0);
295 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
296 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
297 MUTEX_INIT(&rx_mallocedPktQ_lock, "rx_mallocedPktQ_lock", MUTEX_DEFAULT,
300 #ifdef RX_ENABLE_LOCKS
303 #endif /* RX_LOCKS_DB */
304 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
305 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
307 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
309 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
311 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
313 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
315 MUTEX_INIT(&rxi_keyCreate_lock, "rxi_keyCreate_lock", MUTEX_DEFAULT, 0);
317 #endif /* RX_ENABLE_LOCKS */
320 pthread_once_t rx_once_init = PTHREAD_ONCE_INIT;
321 #define INIT_PTHREAD_LOCKS osi_Assert(pthread_once(&rx_once_init, rxi_InitPthread)==0)
323 * The rx_stats_mutex mutex protects the following global variables:
324 * rxi_lowConnRefCount
325 * rxi_lowPeerRefCount
334 * The rx_quota_mutex mutex protects the following global variables:
342 * The rx_freePktQ_lock protects the following global variables:
347 * The rx_packets_mutex mutex protects the following global variables:
355 * The rx_pthread_mutex mutex protects the following global variables:
356 * rxi_fcfs_thread_num
359 #define INIT_PTHREAD_LOCKS
363 /* Variables for handling the minProcs implementation. availProcs gives the
364 * number of threads available in the pool at this moment (not counting dudes
365 * executing right now). totalMin gives the total number of procs required
366 * for handling all minProcs requests. minDeficit is a dynamic variable
367 * tracking the # of procs required to satisfy all of the remaining minProcs
369 * For fine grain locking to work, the quota check and the reservation of
370 * a server thread has to come while rxi_availProcs and rxi_minDeficit
371 * are locked. To this end, the code has been modified under #ifdef
372 * RX_ENABLE_LOCKS so that quota checks and reservation occur at the
373 * same time. A new function, ReturnToServerPool() returns the allocation.
375 * A call can be on several queue's (but only one at a time). When
376 * rxi_ResetCall wants to remove the call from a queue, it has to ensure
377 * that no one else is touching the queue. To this end, we store the address
378 * of the queue lock in the call structure (under the call lock) when we
379 * put the call on a queue, and we clear the call_queue_lock when the
380 * call is removed from a queue (once the call lock has been obtained).
381 * This allows rxi_ResetCall to safely synchronize with others wishing
382 * to manipulate the queue.
385 #if defined(RX_ENABLE_LOCKS)
386 static afs_kmutex_t rx_rpc_stats;
389 /* We keep a "last conn pointer" in rxi_FindConnection. The odds are
390 ** pretty good that the next packet coming in is from the same connection
391 ** as the last packet, since we're send multiple packets in a transmit window.
393 struct rx_connection *rxLastConn = 0;
395 #ifdef RX_ENABLE_LOCKS
396 /* The locking hierarchy for rx fine grain locking is composed of these
399 * rx_connHashTable_lock - synchronizes conn creation, rx_connHashTable access
400 * also protects updates to rx_nextCid
401 * conn_call_lock - used to synchonize rx_EndCall and rx_NewCall
402 * call->lock - locks call data fields.
403 * These are independent of each other:
404 * rx_freeCallQueue_lock
409 * serverQueueEntry->lock
410 * rx_peerHashTable_lock - locked under rx_connHashTable_lock
412 * peer->lock - locks peer data fields.
413 * conn_data_lock - that more than one thread is not updating a conn data
414 * field at the same time.
425 * Do we need a lock to protect the peer field in the conn structure?
426 * conn->peer was previously a constant for all intents and so has no
427 * lock protecting this field. The multihomed client delta introduced
428 * a RX code change : change the peer field in the connection structure
429 * to that remote interface from which the last packet for this
430 * connection was sent out. This may become an issue if further changes
433 #define SET_CALL_QUEUE_LOCK(C, L) (C)->call_queue_lock = (L)
434 #define CLEAR_CALL_QUEUE_LOCK(C) (C)->call_queue_lock = NULL
436 /* rxdb_fileID is used to identify the lock location, along with line#. */
437 static int rxdb_fileID = RXDB_FILE_RX;
438 #endif /* RX_LOCKS_DB */
439 #else /* RX_ENABLE_LOCKS */
440 #define SET_CALL_QUEUE_LOCK(C, L)
441 #define CLEAR_CALL_QUEUE_LOCK(C)
442 #endif /* RX_ENABLE_LOCKS */
443 struct rx_serverQueueEntry *rx_waitForPacket = 0;
445 /* ------------Exported Interfaces------------- */
447 /* Initialize rx. A port number may be mentioned, in which case this
448 * becomes the default port number for any service installed later.
449 * If 0 is provided for the port number, a random port will be chosen
450 * by the kernel. Whether this will ever overlap anything in
451 * /etc/services is anybody's guess... Returns 0 on success, -1 on
453 #if !(defined(AFS_NT40_ENV) || defined(RXK_UPCALL_ENV))
456 rx_atomic_t rxinit_status = RX_ATOMIC_INIT(1);
459 rx_InitHost(u_int host, u_int port)
466 char *htable, *ptable;
471 if (!rx_atomic_test_and_clear_bit(&rxinit_status, 0))
472 return 0; /* already started */
478 if (afs_winsockInit() < 0)
484 * Initialize anything necessary to provide a non-premptive threading
487 rxi_InitializeThreadSupport();
490 /* Allocate and initialize a socket for client and perhaps server
493 rx_socket = rxi_GetHostUDPSocket(host, (u_short) port);
494 if (rx_socket == OSI_NULLSOCKET) {
497 #if defined(RX_ENABLE_LOCKS) && defined(KERNEL)
500 #endif /* RX_LOCKS_DB */
501 MUTEX_INIT(&rx_stats_mutex, "rx_stats_mutex", MUTEX_DEFAULT, 0);
502 MUTEX_INIT(&rx_quota_mutex, "rx_quota_mutex", MUTEX_DEFAULT, 0);
503 MUTEX_INIT(&rx_atomic_mutex, "rx_atomic_mutex", MUTEX_DEFAULT, 0);
504 MUTEX_INIT(&rx_pthread_mutex, "rx_pthread_mutex", MUTEX_DEFAULT, 0);
505 MUTEX_INIT(&rx_packets_mutex, "rx_packets_mutex", MUTEX_DEFAULT, 0);
506 MUTEX_INIT(&rx_refcnt_mutex, "rx_refcnt_mutex", MUTEX_DEFAULT, 0);
507 MUTEX_INIT(&rx_rpc_stats, "rx_rpc_stats", MUTEX_DEFAULT, 0);
508 MUTEX_INIT(&rx_freePktQ_lock, "rx_freePktQ_lock", MUTEX_DEFAULT, 0);
509 MUTEX_INIT(&freeSQEList_lock, "freeSQEList lock", MUTEX_DEFAULT, 0);
510 MUTEX_INIT(&rx_freeCallQueue_lock, "rx_freeCallQueue_lock", MUTEX_DEFAULT,
512 CV_INIT(&rx_waitingForPackets_cv, "rx_waitingForPackets_cv", CV_DEFAULT,
514 MUTEX_INIT(&rx_peerHashTable_lock, "rx_peerHashTable_lock", MUTEX_DEFAULT,
516 MUTEX_INIT(&rx_connHashTable_lock, "rx_connHashTable_lock", MUTEX_DEFAULT,
518 MUTEX_INIT(&rx_serverPool_lock, "rx_serverPool_lock", MUTEX_DEFAULT, 0);
519 MUTEX_INIT(&rx_mallocedPktQ_lock, "rx_mallocedPktQ_lock", MUTEX_DEFAULT,
522 #if defined(AFS_HPUX110_ENV)
524 rx_sleepLock = alloc_spinlock(LAST_HELD_ORDER - 10, "rx_sleepLock");
525 #endif /* AFS_HPUX110_ENV */
526 #endif /* RX_ENABLE_LOCKS && KERNEL */
529 rx_connDeadTime = 12;
530 rx_tranquil = 0; /* reset flag */
531 rxi_ResetStatistics();
532 htable = osi_Alloc(rx_hashTableSize * sizeof(struct rx_connection *));
533 PIN(htable, rx_hashTableSize * sizeof(struct rx_connection *)); /* XXXXX */
534 memset(htable, 0, rx_hashTableSize * sizeof(struct rx_connection *));
535 ptable = osi_Alloc(rx_hashTableSize * sizeof(struct rx_peer *));
536 PIN(ptable, rx_hashTableSize * sizeof(struct rx_peer *)); /* XXXXX */
537 memset(ptable, 0, rx_hashTableSize * sizeof(struct rx_peer *));
539 /* Malloc up a bunch of packets & buffers */
541 opr_queue_Init(&rx_freePacketQueue);
542 rxi_NeedMorePackets = FALSE;
543 rx_nPackets = 0; /* rx_nPackets is managed by rxi_MorePackets* */
544 opr_queue_Init(&rx_mallocedPacketQueue);
546 /* enforce a minimum number of allocated packets */
547 if (rx_extraPackets < rxi_nSendFrags * rx_maxSendWindow)
548 rx_extraPackets = rxi_nSendFrags * rx_maxSendWindow;
550 /* allocate the initial free packet pool */
551 #ifdef RX_ENABLE_TSFPQ
552 rxi_MorePacketsTSFPQ(rx_extraPackets + RX_MAX_QUOTA + 2, RX_TS_FPQ_FLUSH_GLOBAL, 0);
553 #else /* RX_ENABLE_TSFPQ */
554 rxi_MorePackets(rx_extraPackets + RX_MAX_QUOTA + 2); /* fudge */
555 #endif /* RX_ENABLE_TSFPQ */
562 #if defined(AFS_NT40_ENV) && !defined(AFS_PTHREAD_ENV)
563 tv.tv_sec = clock_now.sec;
564 tv.tv_usec = clock_now.usec;
565 srand((unsigned int)tv.tv_usec);
572 #if defined(KERNEL) && !defined(UKERNEL)
573 /* Really, this should never happen in a real kernel */
576 struct sockaddr_in addr;
578 int addrlen = sizeof(addr);
580 socklen_t addrlen = sizeof(addr);
582 if (getsockname((intptr_t)rx_socket, (struct sockaddr *)&addr, &addrlen)) {
584 osi_Free(htable, rx_hashTableSize * sizeof(struct rx_connection *));
587 rx_port = addr.sin_port;
590 rx_stats.minRtt.sec = 9999999;
591 if (RAND_bytes(&rx_epoch, sizeof(rx_epoch)) != 1)
593 rx_epoch = (rx_epoch & ~0x40000000) | 0x80000000;
594 if (RAND_bytes(&rx_nextCid, sizeof(rx_nextCid)) != 1)
596 rx_nextCid &= RX_CIDMASK;
597 MUTEX_ENTER(&rx_quota_mutex);
598 rxi_dataQuota += rx_extraQuota; /* + extra pkts caller asked to rsrv */
599 MUTEX_EXIT(&rx_quota_mutex);
600 /* *Slightly* random start time for the cid. This is just to help
601 * out with the hashing function at the peer */
602 rx_nextCid = ((tv.tv_sec ^ tv.tv_usec) << RX_CIDSHIFT);
603 rx_connHashTable = (struct rx_connection **)htable;
604 rx_peerHashTable = (struct rx_peer **)ptable;
606 rx_hardAckDelay.sec = 0;
607 rx_hardAckDelay.usec = 100000; /* 100 milliseconds */
609 rxevent_Init(20, rxi_ReScheduleEvents);
611 /* Initialize various global queues */
612 opr_queue_Init(&rx_idleServerQueue);
613 opr_queue_Init(&rx_incomingCallQueue);
614 opr_queue_Init(&rx_freeCallQueue);
616 #if defined(AFS_NT40_ENV) && !defined(KERNEL)
617 /* Initialize our list of usable IP addresses. */
621 /* Start listener process (exact function is dependent on the
622 * implementation environment--kernel or user space) */
626 rx_atomic_clear_bit(&rxinit_status, 0);
633 return rx_InitHost(htonl(INADDR_ANY), port);
639 * The rxi_rto functions implement a TCP (RFC2988) style algorithm for
640 * maintaing the round trip timer.
645 * Start a new RTT timer for a given call and packet.
647 * There must be no resendEvent already listed for this call, otherwise this
648 * will leak events - intended for internal use within the RTO code only
651 * the RX call to start the timer for
652 * @param[in] lastPacket
653 * a flag indicating whether the last packet has been sent or not
655 * @pre call must be locked before calling this function
659 rxi_rto_startTimer(struct rx_call *call, int lastPacket, int istack)
661 struct clock now, retryTime;
666 clock_Add(&retryTime, &call->rto);
668 /* If we're sending the last packet, and we're the client, then the server
669 * may wait for an additional 400ms before returning the ACK, wait for it
670 * rather than hitting a timeout */
671 if (lastPacket && call->conn->type == RX_CLIENT_CONNECTION)
672 clock_Addmsec(&retryTime, 400);
674 CALL_HOLD(call, RX_CALL_REFCOUNT_RESEND);
675 call->resendEvent = rxevent_Post(&retryTime, &now, rxi_Resend,
680 * Cancel an RTT timer for a given call.
684 * the RX call to cancel the timer for
686 * @pre call must be locked before calling this function
691 rxi_rto_cancel(struct rx_call *call)
693 if (call->resendEvent != NULL) {
694 rxevent_Cancel(&call->resendEvent);
695 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
700 * Tell the RTO timer that we have sent a packet.
702 * If the timer isn't already running, then start it. If the timer is running,
706 * the RX call that the packet has been sent on
707 * @param[in] lastPacket
708 * A flag which is true if this is the last packet for the call
710 * @pre The call must be locked before calling this function
715 rxi_rto_packet_sent(struct rx_call *call, int lastPacket, int istack)
717 if (call->resendEvent)
720 rxi_rto_startTimer(call, lastPacket, istack);
724 * Tell the RTO timer that we have received an new ACK message
726 * This function should be called whenever a call receives an ACK that
727 * acknowledges new packets. Whatever happens, we stop the current timer.
728 * If there are unacked packets in the queue which have been sent, then
729 * we restart the timer from now. Otherwise, we leave it stopped.
732 * the RX call that the ACK has been received on
736 rxi_rto_packet_acked(struct rx_call *call, int istack)
738 struct opr_queue *cursor;
740 rxi_rto_cancel(call);
742 if (opr_queue_IsEmpty(&call->tq))
745 for (opr_queue_Scan(&call->tq, cursor)) {
746 struct rx_packet *p = opr_queue_Entry(cursor, struct rx_packet, entry);
747 if (p->header.seq > call->tfirst + call->twind)
750 if (!(p->flags & RX_PKTFLAG_ACKED) && p->flags & RX_PKTFLAG_SENT) {
751 rxi_rto_startTimer(call, p->header.flags & RX_LAST_PACKET, istack);
759 * Set an initial round trip timeout for a peer connection
761 * @param[in] secs The timeout to set in seconds
765 rx_rto_setPeerTimeoutSecs(struct rx_peer *peer, int secs) {
766 peer->rtt = secs * 8000;
770 * Set a delayed ack event on the specified call for the given time
772 * @param[in] call - the call on which to set the event
773 * @param[in] offset - the delay from now after which the event fires
776 rxi_PostDelayedAckEvent(struct rx_call *call, struct clock *offset)
778 struct clock now, when;
782 clock_Add(&when, offset);
784 if (call->delayedAckEvent && clock_Gt(&call->delayedAckTime, &when)) {
785 /* The event we're cancelling already has a reference, so we don't
787 rxevent_Cancel(&call->delayedAckEvent);
788 call->delayedAckEvent = rxevent_Post(&when, &now, rxi_SendDelayedAck,
791 call->delayedAckTime = when;
792 } else if (!call->delayedAckEvent) {
793 CALL_HOLD(call, RX_CALL_REFCOUNT_DELAY);
794 call->delayedAckEvent = rxevent_Post(&when, &now,
797 call->delayedAckTime = when;
802 rxi_CancelDelayedAckEvent(struct rx_call *call)
804 if (call->delayedAckEvent) {
805 rxevent_Cancel(&call->delayedAckEvent);
806 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
810 /* called with unincremented nRequestsRunning to see if it is OK to start
811 * a new thread in this service. Could be "no" for two reasons: over the
812 * max quota, or would prevent others from reaching their min quota.
814 #ifdef RX_ENABLE_LOCKS
815 /* This verion of QuotaOK reserves quota if it's ok while the
816 * rx_serverPool_lock is held. Return quota using ReturnToServerPool().
819 QuotaOK(struct rx_service *aservice)
821 /* check if over max quota */
822 if (aservice->nRequestsRunning >= aservice->maxProcs) {
826 /* under min quota, we're OK */
827 /* otherwise, can use only if there are enough to allow everyone
828 * to go to their min quota after this guy starts.
831 MUTEX_ENTER(&rx_quota_mutex);
832 if ((aservice->nRequestsRunning < aservice->minProcs)
833 || (rxi_availProcs > rxi_minDeficit)) {
834 aservice->nRequestsRunning++;
835 /* just started call in minProcs pool, need fewer to maintain
837 if (aservice->nRequestsRunning <= aservice->minProcs)
840 MUTEX_EXIT(&rx_quota_mutex);
843 MUTEX_EXIT(&rx_quota_mutex);
849 ReturnToServerPool(struct rx_service *aservice)
851 aservice->nRequestsRunning--;
852 MUTEX_ENTER(&rx_quota_mutex);
853 if (aservice->nRequestsRunning < aservice->minProcs)
856 MUTEX_EXIT(&rx_quota_mutex);
859 #else /* RX_ENABLE_LOCKS */
861 QuotaOK(struct rx_service *aservice)
864 /* under min quota, we're OK */
865 if (aservice->nRequestsRunning < aservice->minProcs)
868 /* check if over max quota */
869 if (aservice->nRequestsRunning >= aservice->maxProcs)
872 /* otherwise, can use only if there are enough to allow everyone
873 * to go to their min quota after this guy starts.
875 MUTEX_ENTER(&rx_quota_mutex);
876 if (rxi_availProcs > rxi_minDeficit)
878 MUTEX_EXIT(&rx_quota_mutex);
881 #endif /* RX_ENABLE_LOCKS */
884 /* Called by rx_StartServer to start up lwp's to service calls.
885 NExistingProcs gives the number of procs already existing, and which
886 therefore needn't be created. */
888 rxi_StartServerProcs(int nExistingProcs)
890 struct rx_service *service;
895 /* For each service, reserve N processes, where N is the "minimum"
896 * number of processes that MUST be able to execute a request in parallel,
897 * at any time, for that process. Also compute the maximum difference
898 * between any service's maximum number of processes that can run
899 * (i.e. the maximum number that ever will be run, and a guarantee
900 * that this number will run if other services aren't running), and its
901 * minimum number. The result is the extra number of processes that
902 * we need in order to provide the latter guarantee */
903 for (i = 0; i < RX_MAX_SERVICES; i++) {
905 service = rx_services[i];
906 if (service == (struct rx_service *)0)
908 nProcs += service->minProcs;
909 diff = service->maxProcs - service->minProcs;
913 nProcs += maxdiff; /* Extra processes needed to allow max number requested to run in any given service, under good conditions */
914 nProcs -= nExistingProcs; /* Subtract the number of procs that were previously created for use as server procs */
915 for (i = 0; i < nProcs; i++) {
916 rxi_StartServerProc(rx_ServerProc, rx_stackSize);
922 /* This routine is only required on Windows */
924 rx_StartClientThread(void)
926 #ifdef AFS_PTHREAD_ENV
928 pid = pthread_self();
929 #endif /* AFS_PTHREAD_ENV */
931 #endif /* AFS_NT40_ENV */
933 /* This routine must be called if any services are exported. If the
934 * donateMe flag is set, the calling process is donated to the server
937 rx_StartServer(int donateMe)
939 struct rx_service *service;
945 /* Start server processes, if necessary (exact function is dependent
946 * on the implementation environment--kernel or user space). DonateMe
947 * will be 1 if there is 1 pre-existing proc, i.e. this one. In this
948 * case, one less new proc will be created rx_StartServerProcs.
950 rxi_StartServerProcs(donateMe);
952 /* count up the # of threads in minProcs, and add set the min deficit to
953 * be that value, too.
955 for (i = 0; i < RX_MAX_SERVICES; i++) {
956 service = rx_services[i];
957 if (service == (struct rx_service *)0)
959 MUTEX_ENTER(&rx_quota_mutex);
960 rxi_totalMin += service->minProcs;
961 /* below works even if a thread is running, since minDeficit would
962 * still have been decremented and later re-incremented.
964 rxi_minDeficit += service->minProcs;
965 MUTEX_EXIT(&rx_quota_mutex);
968 /* Turn on reaping of idle server connections */
969 rxi_ReapConnections(NULL, NULL, NULL, 0);
978 #ifdef AFS_PTHREAD_ENV
980 pid = afs_pointer_to_int(pthread_self());
981 #else /* AFS_PTHREAD_ENV */
983 LWP_CurrentProcess(&pid);
984 #endif /* AFS_PTHREAD_ENV */
986 sprintf(name, "srv_%d", ++nProcs);
988 (*registerProgram) (pid, name);
990 #endif /* AFS_NT40_ENV */
991 rx_ServerProc(NULL); /* Never returns */
993 #ifdef RX_ENABLE_TSFPQ
994 /* no use leaving packets around in this thread's local queue if
995 * it isn't getting donated to the server thread pool.
997 rxi_FlushLocalPacketsTSFPQ();
998 #endif /* RX_ENABLE_TSFPQ */
1002 /* Create a new client connection to the specified service, using the
1003 * specified security object to implement the security model for this
1005 struct rx_connection *
1006 rx_NewConnection(afs_uint32 shost, u_short sport, u_short sservice,
1007 struct rx_securityClass *securityObject,
1008 int serviceSecurityIndex)
1011 struct rx_connection *conn;
1016 dpf(("rx_NewConnection(host %x, port %u, service %u, securityObject %p, "
1017 "serviceSecurityIndex %d)\n",
1018 ntohl(shost), ntohs(sport), sservice, securityObject,
1019 serviceSecurityIndex));
1021 /* Vasilsi said: "NETPRI protects Cid and Alloc", but can this be true in
1022 * the case of kmem_alloc? */
1023 conn = rxi_AllocConnection();
1024 #ifdef RX_ENABLE_LOCKS
1025 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
1026 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
1027 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
1030 MUTEX_ENTER(&rx_connHashTable_lock);
1031 conn->type = RX_CLIENT_CONNECTION;
1032 conn->epoch = rx_epoch;
1033 conn->cid = rx_nextCid;
1035 conn->peer = rxi_FindPeer(shost, sport, 1);
1036 conn->serviceId = sservice;
1037 conn->securityObject = securityObject;
1038 conn->securityData = (void *) 0;
1039 conn->securityIndex = serviceSecurityIndex;
1040 rx_SetConnDeadTime(conn, rx_connDeadTime);
1041 rx_SetConnSecondsUntilNatPing(conn, 0);
1042 conn->ackRate = RX_FAST_ACK_RATE;
1043 conn->nSpecific = 0;
1044 conn->specific = NULL;
1045 conn->challengeEvent = NULL;
1046 conn->delayedAbortEvent = NULL;
1047 conn->abortCount = 0;
1049 for (i = 0; i < RX_MAXCALLS; i++) {
1050 conn->twind[i] = rx_initSendWindow;
1051 conn->rwind[i] = rx_initReceiveWindow;
1052 conn->lastBusy[i] = 0;
1055 RXS_NewConnection(securityObject, conn);
1057 CONN_HASH(shost, sport, conn->cid, conn->epoch, RX_CLIENT_CONNECTION);
1059 conn->refCount++; /* no lock required since only this thread knows... */
1060 conn->next = rx_connHashTable[hashindex];
1061 rx_connHashTable[hashindex] = conn;
1062 if (rx_stats_active)
1063 rx_atomic_inc(&rx_stats.nClientConns);
1064 MUTEX_EXIT(&rx_connHashTable_lock);
1070 * Ensure a connection's timeout values are valid.
1072 * @param[in] conn The connection to check
1074 * @post conn->secondUntilDead <= conn->idleDeadTime <= conn->hardDeadTime,
1075 * unless idleDeadTime and/or hardDeadTime are not set
1079 rxi_CheckConnTimeouts(struct rx_connection *conn)
1081 /* a connection's timeouts must have the relationship
1082 * deadTime <= idleDeadTime <= hardDeadTime. Otherwise, for example, a
1083 * total loss of network to a peer may cause an idle timeout instead of a
1084 * dead timeout, simply because the idle timeout gets hit first. Also set
1085 * a minimum deadTime of 6, just to ensure it doesn't get set too low. */
1086 /* this logic is slightly complicated by the fact that
1087 * idleDeadTime/hardDeadTime may not be set at all, but it's not too bad.
1089 conn->secondsUntilDead = MAX(conn->secondsUntilDead, 6);
1090 if (conn->idleDeadTime) {
1091 conn->idleDeadTime = MAX(conn->idleDeadTime, conn->secondsUntilDead);
1093 if (conn->hardDeadTime) {
1094 if (conn->idleDeadTime) {
1095 conn->hardDeadTime = MAX(conn->idleDeadTime, conn->hardDeadTime);
1097 conn->hardDeadTime = MAX(conn->secondsUntilDead, conn->hardDeadTime);
1103 rx_SetConnDeadTime(struct rx_connection *conn, int seconds)
1105 /* The idea is to set the dead time to a value that allows several
1106 * keepalives to be dropped without timing out the connection. */
1107 conn->secondsUntilDead = seconds;
1108 rxi_CheckConnTimeouts(conn);
1109 conn->secondsUntilPing = conn->secondsUntilDead / 6;
1113 rx_SetConnHardDeadTime(struct rx_connection *conn, int seconds)
1115 conn->hardDeadTime = seconds;
1116 rxi_CheckConnTimeouts(conn);
1120 rx_SetConnIdleDeadTime(struct rx_connection *conn, int seconds)
1122 conn->idleDeadTime = seconds;
1123 rxi_CheckConnTimeouts(conn);
1126 int rxi_lowPeerRefCount = 0;
1127 int rxi_lowConnRefCount = 0;
1130 * Cleanup a connection that was destroyed in rxi_DestroyConnectioNoLock.
1131 * NOTE: must not be called with rx_connHashTable_lock held.
1134 rxi_CleanupConnection(struct rx_connection *conn)
1136 /* Notify the service exporter, if requested, that this connection
1137 * is being destroyed */
1138 if (conn->type == RX_SERVER_CONNECTION && conn->service->destroyConnProc)
1139 (*conn->service->destroyConnProc) (conn);
1141 /* Notify the security module that this connection is being destroyed */
1142 RXS_DestroyConnection(conn->securityObject, conn);
1144 /* If this is the last connection using the rx_peer struct, set its
1145 * idle time to now. rxi_ReapConnections will reap it if it's still
1146 * idle (refCount == 0) after rx_idlePeerTime (60 seconds) have passed.
1148 MUTEX_ENTER(&rx_peerHashTable_lock);
1149 if (conn->peer->refCount < 2) {
1150 conn->peer->idleWhen = clock_Sec();
1151 if (conn->peer->refCount < 1) {
1152 conn->peer->refCount = 1;
1153 if (rx_stats_active) {
1154 MUTEX_ENTER(&rx_stats_mutex);
1155 rxi_lowPeerRefCount++;
1156 MUTEX_EXIT(&rx_stats_mutex);
1160 conn->peer->refCount--;
1161 MUTEX_EXIT(&rx_peerHashTable_lock);
1163 if (rx_stats_active)
1165 if (conn->type == RX_SERVER_CONNECTION)
1166 rx_atomic_dec(&rx_stats.nServerConns);
1168 rx_atomic_dec(&rx_stats.nClientConns);
1171 if (conn->specific) {
1173 for (i = 0; i < conn->nSpecific; i++) {
1174 if (conn->specific[i] && rxi_keyCreate_destructor[i])
1175 (*rxi_keyCreate_destructor[i]) (conn->specific[i]);
1176 conn->specific[i] = NULL;
1178 free(conn->specific);
1180 conn->specific = NULL;
1181 conn->nSpecific = 0;
1182 #endif /* !KERNEL */
1184 MUTEX_DESTROY(&conn->conn_call_lock);
1185 MUTEX_DESTROY(&conn->conn_data_lock);
1186 CV_DESTROY(&conn->conn_call_cv);
1188 rxi_FreeConnection(conn);
1191 /* Destroy the specified connection */
1193 rxi_DestroyConnection(struct rx_connection *conn)
1195 MUTEX_ENTER(&rx_connHashTable_lock);
1196 rxi_DestroyConnectionNoLock(conn);
1197 /* conn should be at the head of the cleanup list */
1198 if (conn == rx_connCleanup_list) {
1199 rx_connCleanup_list = rx_connCleanup_list->next;
1200 MUTEX_EXIT(&rx_connHashTable_lock);
1201 rxi_CleanupConnection(conn);
1203 #ifdef RX_ENABLE_LOCKS
1205 MUTEX_EXIT(&rx_connHashTable_lock);
1207 #endif /* RX_ENABLE_LOCKS */
1211 rxi_DestroyConnectionNoLock(struct rx_connection *conn)
1213 struct rx_connection **conn_ptr;
1215 struct rx_packet *packet;
1222 MUTEX_ENTER(&conn->conn_data_lock);
1223 MUTEX_ENTER(&rx_refcnt_mutex);
1224 if (conn->refCount > 0)
1227 if (rx_stats_active) {
1228 MUTEX_ENTER(&rx_stats_mutex);
1229 rxi_lowConnRefCount++;
1230 MUTEX_EXIT(&rx_stats_mutex);
1234 if ((conn->refCount > 0) || (conn->flags & RX_CONN_BUSY)) {
1235 /* Busy; wait till the last guy before proceeding */
1236 MUTEX_EXIT(&rx_refcnt_mutex);
1237 MUTEX_EXIT(&conn->conn_data_lock);
1242 /* If the client previously called rx_NewCall, but it is still
1243 * waiting, treat this as a running call, and wait to destroy the
1244 * connection later when the call completes. */
1245 if ((conn->type == RX_CLIENT_CONNECTION)
1246 && (conn->flags & (RX_CONN_MAKECALL_WAITING|RX_CONN_MAKECALL_ACTIVE))) {
1247 conn->flags |= RX_CONN_DESTROY_ME;
1248 MUTEX_EXIT(&conn->conn_data_lock);
1252 MUTEX_EXIT(&rx_refcnt_mutex);
1253 MUTEX_EXIT(&conn->conn_data_lock);
1255 /* Check for extant references to this connection */
1256 MUTEX_ENTER(&conn->conn_call_lock);
1257 for (i = 0; i < RX_MAXCALLS; i++) {
1258 struct rx_call *call = conn->call[i];
1261 if (conn->type == RX_CLIENT_CONNECTION) {
1262 MUTEX_ENTER(&call->lock);
1263 if (call->delayedAckEvent) {
1264 /* Push the final acknowledgment out now--there
1265 * won't be a subsequent call to acknowledge the
1266 * last reply packets */
1267 rxi_CancelDelayedAckEvent(call);
1268 if (call->state == RX_STATE_PRECALL
1269 || call->state == RX_STATE_ACTIVE) {
1270 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
1275 MUTEX_EXIT(&call->lock);
1279 MUTEX_EXIT(&conn->conn_call_lock);
1281 #ifdef RX_ENABLE_LOCKS
1283 if (MUTEX_TRYENTER(&conn->conn_data_lock)) {
1284 MUTEX_EXIT(&conn->conn_data_lock);
1286 /* Someone is accessing a packet right now. */
1290 #endif /* RX_ENABLE_LOCKS */
1293 /* Don't destroy the connection if there are any call
1294 * structures still in use */
1295 MUTEX_ENTER(&conn->conn_data_lock);
1296 conn->flags |= RX_CONN_DESTROY_ME;
1297 MUTEX_EXIT(&conn->conn_data_lock);
1302 if (conn->natKeepAliveEvent) {
1303 rxi_NatKeepAliveOff(conn);
1306 if (conn->delayedAbortEvent) {
1307 rxevent_Cancel(&conn->delayedAbortEvent);
1308 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
1310 MUTEX_ENTER(&conn->conn_data_lock);
1311 rxi_SendConnectionAbort(conn, packet, 0, 1);
1312 MUTEX_EXIT(&conn->conn_data_lock);
1313 rxi_FreePacket(packet);
1317 /* Remove from connection hash table before proceeding */
1319 &rx_connHashTable[CONN_HASH
1320 (peer->host, peer->port, conn->cid, conn->epoch,
1322 for (; *conn_ptr; conn_ptr = &(*conn_ptr)->next) {
1323 if (*conn_ptr == conn) {
1324 *conn_ptr = conn->next;
1328 /* if the conn that we are destroying was the last connection, then we
1329 * clear rxLastConn as well */
1330 if (rxLastConn == conn)
1333 /* Make sure the connection is completely reset before deleting it. */
1334 /* get rid of pending events that could zap us later */
1335 rxevent_Cancel(&conn->challengeEvent);
1336 rxevent_Cancel(&conn->checkReachEvent);
1337 rxevent_Cancel(&conn->natKeepAliveEvent);
1339 /* Add the connection to the list of destroyed connections that
1340 * need to be cleaned up. This is necessary to avoid deadlocks
1341 * in the routines we call to inform others that this connection is
1342 * being destroyed. */
1343 conn->next = rx_connCleanup_list;
1344 rx_connCleanup_list = conn;
1347 /* Externally available version */
1349 rx_DestroyConnection(struct rx_connection *conn)
1354 rxi_DestroyConnection(conn);
1359 rx_GetConnection(struct rx_connection *conn)
1364 MUTEX_ENTER(&rx_refcnt_mutex);
1366 MUTEX_EXIT(&rx_refcnt_mutex);
1370 #ifdef RX_ENABLE_LOCKS
1371 /* Wait for the transmit queue to no longer be busy.
1372 * requires the call->lock to be held */
1374 rxi_WaitforTQBusy(struct rx_call *call) {
1375 while (!call->error && (call->flags & RX_CALL_TQ_BUSY)) {
1376 call->flags |= RX_CALL_TQ_WAIT;
1378 MUTEX_ASSERT(&call->lock);
1379 CV_WAIT(&call->cv_tq, &call->lock);
1381 if (call->tqWaiters == 0) {
1382 call->flags &= ~RX_CALL_TQ_WAIT;
1389 rxi_WakeUpTransmitQueue(struct rx_call *call)
1391 if (call->tqWaiters || (call->flags & RX_CALL_TQ_WAIT)) {
1392 dpf(("call %"AFS_PTR_FMT" has %d waiters and flags %d\n",
1393 call, call->tqWaiters, call->flags));
1394 #ifdef RX_ENABLE_LOCKS
1395 MUTEX_ASSERT(&call->lock);
1396 CV_BROADCAST(&call->cv_tq);
1397 #else /* RX_ENABLE_LOCKS */
1398 osi_rxWakeup(&call->tq);
1399 #endif /* RX_ENABLE_LOCKS */
1403 /* Start a new rx remote procedure call, on the specified connection.
1404 * If wait is set to 1, wait for a free call channel; otherwise return
1405 * 0. Maxtime gives the maximum number of seconds this call may take,
1406 * after rx_NewCall returns. After this time interval, a call to any
1407 * of rx_SendData, rx_ReadData, etc. will fail with RX_CALL_TIMEOUT.
1408 * For fine grain locking, we hold the conn_call_lock in order to
1409 * to ensure that we don't get signalle after we found a call in an active
1410 * state and before we go to sleep.
1413 rx_NewCall(struct rx_connection *conn)
1415 int i, wait, ignoreBusy = 1;
1416 struct rx_call *call;
1417 struct clock queueTime;
1418 afs_uint32 leastBusy = 0;
1422 dpf(("rx_NewCall(conn %"AFS_PTR_FMT")\n", conn));
1425 clock_GetTime(&queueTime);
1427 * Check if there are others waiting for a new call.
1428 * If so, let them go first to avoid starving them.
1429 * This is a fairly simple scheme, and might not be
1430 * a complete solution for large numbers of waiters.
1432 * makeCallWaiters keeps track of the number of
1433 * threads waiting to make calls and the
1434 * RX_CONN_MAKECALL_WAITING flag bit is used to
1435 * indicate that there are indeed calls waiting.
1436 * The flag is set when the waiter is incremented.
1437 * It is only cleared when makeCallWaiters is 0.
1438 * This prevents us from accidently destroying the
1439 * connection while it is potentially about to be used.
1441 MUTEX_ENTER(&conn->conn_call_lock);
1442 MUTEX_ENTER(&conn->conn_data_lock);
1443 while (conn->flags & RX_CONN_MAKECALL_ACTIVE) {
1444 conn->flags |= RX_CONN_MAKECALL_WAITING;
1445 conn->makeCallWaiters++;
1446 MUTEX_EXIT(&conn->conn_data_lock);
1448 #ifdef RX_ENABLE_LOCKS
1449 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1453 MUTEX_ENTER(&conn->conn_data_lock);
1454 conn->makeCallWaiters--;
1455 if (conn->makeCallWaiters == 0)
1456 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1459 /* We are now the active thread in rx_NewCall */
1460 conn->flags |= RX_CONN_MAKECALL_ACTIVE;
1461 MUTEX_EXIT(&conn->conn_data_lock);
1466 for (i = 0; i < RX_MAXCALLS; i++) {
1467 call = conn->call[i];
1469 if (!ignoreBusy && conn->lastBusy[i] != leastBusy) {
1470 /* we're not ignoring busy call slots; only look at the
1471 * call slot that is the "least" busy */
1475 if (call->state == RX_STATE_DALLY) {
1476 MUTEX_ENTER(&call->lock);
1477 if (call->state == RX_STATE_DALLY) {
1478 if (ignoreBusy && conn->lastBusy[i]) {
1479 /* if we're ignoring busy call slots, skip any ones that
1480 * have lastBusy set */
1481 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1482 leastBusy = conn->lastBusy[i];
1484 MUTEX_EXIT(&call->lock);
1489 * We are setting the state to RX_STATE_RESET to
1490 * ensure that no one else will attempt to use this
1491 * call once we drop the conn->conn_call_lock and
1492 * call->lock. We must drop the conn->conn_call_lock
1493 * before calling rxi_ResetCall because the process
1494 * of clearing the transmit queue can block for an
1495 * extended period of time. If we block while holding
1496 * the conn->conn_call_lock, then all rx_EndCall
1497 * processing will block as well. This has a detrimental
1498 * effect on overall system performance.
1500 call->state = RX_STATE_RESET;
1501 (*call->callNumber)++;
1502 MUTEX_EXIT(&conn->conn_call_lock);
1503 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1504 rxi_ResetCall(call, 0);
1505 if (MUTEX_TRYENTER(&conn->conn_call_lock))
1509 * If we failed to be able to safely obtain the
1510 * conn->conn_call_lock we will have to drop the
1511 * call->lock to avoid a deadlock. When the call->lock
1512 * is released the state of the call can change. If it
1513 * is no longer RX_STATE_RESET then some other thread is
1516 MUTEX_EXIT(&call->lock);
1517 MUTEX_ENTER(&conn->conn_call_lock);
1518 MUTEX_ENTER(&call->lock);
1520 if (call->state == RX_STATE_RESET)
1524 * If we get here it means that after dropping
1525 * the conn->conn_call_lock and call->lock that
1526 * the call is no longer ours. If we can't find
1527 * a free call in the remaining slots we should
1528 * not go immediately to RX_CONN_MAKECALL_WAITING
1529 * because by dropping the conn->conn_call_lock
1530 * we have given up synchronization with rx_EndCall.
1531 * Instead, cycle through one more time to see if
1532 * we can find a call that can call our own.
1534 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
1537 MUTEX_EXIT(&call->lock);
1540 if (ignoreBusy && conn->lastBusy[i]) {
1541 /* if we're ignoring busy call slots, skip any ones that
1542 * have lastBusy set */
1543 if (leastBusy == 0 || conn->lastBusy[i] < leastBusy) {
1544 leastBusy = conn->lastBusy[i];
1549 /* rxi_NewCall returns with mutex locked */
1550 call = rxi_NewCall(conn, i);
1551 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
1555 if (i < RX_MAXCALLS) {
1556 conn->lastBusy[i] = 0;
1561 if (leastBusy && ignoreBusy) {
1562 /* we didn't find a useable call slot, but we did see at least one
1563 * 'busy' slot; look again and only use a slot with the 'least
1569 MUTEX_ENTER(&conn->conn_data_lock);
1570 conn->flags |= RX_CONN_MAKECALL_WAITING;
1571 conn->makeCallWaiters++;
1572 MUTEX_EXIT(&conn->conn_data_lock);
1574 #ifdef RX_ENABLE_LOCKS
1575 CV_WAIT(&conn->conn_call_cv, &conn->conn_call_lock);
1579 MUTEX_ENTER(&conn->conn_data_lock);
1580 conn->makeCallWaiters--;
1581 if (conn->makeCallWaiters == 0)
1582 conn->flags &= ~RX_CONN_MAKECALL_WAITING;
1583 MUTEX_EXIT(&conn->conn_data_lock);
1585 /* Client is initially in send mode */
1586 call->state = RX_STATE_ACTIVE;
1587 call->error = conn->error;
1589 call->app.mode = RX_MODE_ERROR;
1591 call->app.mode = RX_MODE_SENDING;
1593 #ifdef AFS_RXERRQ_ENV
1594 /* remember how many network errors the peer has when we started, so if
1595 * more errors are encountered after the call starts, we know the other endpoint won't be
1596 * responding to us */
1597 call->neterr_gen = rx_atomic_read(&conn->peer->neterrs);
1600 /* remember start time for call in case we have hard dead time limit */
1601 call->queueTime = queueTime;
1602 clock_GetTime(&call->startTime);
1603 call->app.bytesSent = 0;
1604 call->app.bytesRcvd = 0;
1606 /* Turn on busy protocol. */
1607 rxi_KeepAliveOn(call);
1609 /* Attempt MTU discovery */
1610 rxi_GrowMTUOn(call);
1613 * We are no longer the active thread in rx_NewCall
1615 MUTEX_ENTER(&conn->conn_data_lock);
1616 conn->flags &= ~RX_CONN_MAKECALL_ACTIVE;
1617 MUTEX_EXIT(&conn->conn_data_lock);
1620 * Wake up anyone else who might be giving us a chance to
1621 * run (see code above that avoids resource starvation).
1623 #ifdef RX_ENABLE_LOCKS
1624 if (call->flags & (RX_CALL_TQ_BUSY | RX_CALL_TQ_CLEARME)) {
1625 osi_Panic("rx_NewCall call about to be used without an empty tq");
1628 CV_BROADCAST(&conn->conn_call_cv);
1632 MUTEX_EXIT(&conn->conn_call_lock);
1633 MUTEX_EXIT(&call->lock);
1636 dpf(("rx_NewCall(call %"AFS_PTR_FMT")\n", call));
1641 rxi_HasActiveCalls(struct rx_connection *aconn)
1644 struct rx_call *tcall;
1648 for (i = 0; i < RX_MAXCALLS; i++) {
1649 if ((tcall = aconn->call[i])) {
1650 if ((tcall->state == RX_STATE_ACTIVE)
1651 || (tcall->state == RX_STATE_PRECALL)) {
1662 rxi_GetCallNumberVector(struct rx_connection *aconn,
1663 afs_int32 * aint32s)
1666 struct rx_call *tcall;
1670 MUTEX_ENTER(&aconn->conn_call_lock);
1671 for (i = 0; i < RX_MAXCALLS; i++) {
1672 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1673 aint32s[i] = aconn->callNumber[i] + 1;
1675 aint32s[i] = aconn->callNumber[i];
1677 MUTEX_EXIT(&aconn->conn_call_lock);
1683 rxi_SetCallNumberVector(struct rx_connection *aconn,
1684 afs_int32 * aint32s)
1687 struct rx_call *tcall;
1691 MUTEX_ENTER(&aconn->conn_call_lock);
1692 for (i = 0; i < RX_MAXCALLS; i++) {
1693 if ((tcall = aconn->call[i]) && (tcall->state == RX_STATE_DALLY))
1694 aconn->callNumber[i] = aint32s[i] - 1;
1696 aconn->callNumber[i] = aint32s[i];
1698 MUTEX_EXIT(&aconn->conn_call_lock);
1703 /* Advertise a new service. A service is named locally by a UDP port
1704 * number plus a 16-bit service id. Returns (struct rx_service *) 0
1707 char *serviceName; Name for identification purposes (e.g. the
1708 service name might be used for probing for
1711 rx_NewServiceHost(afs_uint32 host, u_short port, u_short serviceId,
1712 char *serviceName, struct rx_securityClass **securityObjects,
1713 int nSecurityObjects,
1714 afs_int32(*serviceProc) (struct rx_call * acall))
1716 osi_socket socket = OSI_NULLSOCKET;
1717 struct rx_service *tservice;
1723 if (serviceId == 0) {
1725 "rx_NewService: service id for service %s is not non-zero.\n",
1732 "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",
1740 tservice = rxi_AllocService();
1743 MUTEX_INIT(&tservice->svc_data_lock, "svc data lock", MUTEX_DEFAULT, 0);
1745 for (i = 0; i < RX_MAX_SERVICES; i++) {
1746 struct rx_service *service = rx_services[i];
1748 if (port == service->servicePort && host == service->serviceHost) {
1749 if (service->serviceId == serviceId) {
1750 /* The identical service has already been
1751 * installed; if the caller was intending to
1752 * change the security classes used by this
1753 * service, he/she loses. */
1755 "rx_NewService: tried to install service %s with service id %d, which is already in use for service %s\n",
1756 serviceName, serviceId, service->serviceName);
1758 rxi_FreeService(tservice);
1761 /* Different service, same port: re-use the socket
1762 * which is bound to the same port */
1763 socket = service->socket;
1766 if (socket == OSI_NULLSOCKET) {
1767 /* If we don't already have a socket (from another
1768 * service on same port) get a new one */
1769 socket = rxi_GetHostUDPSocket(host, port);
1770 if (socket == OSI_NULLSOCKET) {
1772 rxi_FreeService(tservice);
1777 service->socket = socket;
1778 service->serviceHost = host;
1779 service->servicePort = port;
1780 service->serviceId = serviceId;
1781 service->serviceName = serviceName;
1782 service->nSecurityObjects = nSecurityObjects;
1783 service->securityObjects = securityObjects;
1784 service->minProcs = 0;
1785 service->maxProcs = 1;
1786 service->idleDeadTime = 60;
1787 service->connDeadTime = rx_connDeadTime;
1788 service->executeRequestProc = serviceProc;
1789 service->checkReach = 0;
1790 service->nSpecific = 0;
1791 service->specific = NULL;
1792 rx_services[i] = service; /* not visible until now */
1798 rxi_FreeService(tservice);
1799 (osi_Msg "rx_NewService: cannot support > %d services\n",
1804 /* Set configuration options for all of a service's security objects */
1807 rx_SetSecurityConfiguration(struct rx_service *service,
1808 rx_securityConfigVariables type,
1812 for (i = 0; i<service->nSecurityObjects; i++) {
1813 if (service->securityObjects[i]) {
1814 RXS_SetConfiguration(service->securityObjects[i], NULL, type,
1822 rx_NewService(u_short port, u_short serviceId, char *serviceName,
1823 struct rx_securityClass **securityObjects, int nSecurityObjects,
1824 afs_int32(*serviceProc) (struct rx_call * acall))
1826 return rx_NewServiceHost(htonl(INADDR_ANY), port, serviceId, serviceName, securityObjects, nSecurityObjects, serviceProc);
1829 /* Generic request processing loop. This routine should be called
1830 * by the implementation dependent rx_ServerProc. If socketp is
1831 * non-null, it will be set to the file descriptor that this thread
1832 * is now listening on. If socketp is null, this routine will never
1835 rxi_ServerProc(int threadID, struct rx_call *newcall, osi_socket * socketp)
1837 struct rx_call *call;
1839 struct rx_service *tservice = NULL;
1846 call = rx_GetCall(threadID, tservice, socketp);
1847 if (socketp && *socketp != OSI_NULLSOCKET) {
1848 /* We are now a listener thread */
1854 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
1855 #ifdef RX_ENABLE_LOCKS
1857 #endif /* RX_ENABLE_LOCKS */
1858 afs_termState = AFSOP_STOP_AFS;
1859 afs_osi_Wakeup(&afs_termState);
1860 #ifdef RX_ENABLE_LOCKS
1862 #endif /* RX_ENABLE_LOCKS */
1867 /* if server is restarting( typically smooth shutdown) then do not
1868 * allow any new calls.
1871 if (rx_tranquil && (call != NULL)) {
1875 MUTEX_ENTER(&call->lock);
1877 rxi_CallError(call, RX_RESTARTING);
1878 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
1880 MUTEX_EXIT(&call->lock);
1885 tservice = call->conn->service;
1887 if (tservice->beforeProc)
1888 (*tservice->beforeProc) (call);
1890 code = tservice->executeRequestProc(call);
1892 if (tservice->afterProc)
1893 (*tservice->afterProc) (call, code);
1895 rx_EndCall(call, code);
1897 if (tservice->postProc)
1898 (*tservice->postProc) (code);
1900 if (rx_stats_active) {
1901 MUTEX_ENTER(&rx_stats_mutex);
1903 MUTEX_EXIT(&rx_stats_mutex);
1910 rx_WakeupServerProcs(void)
1912 struct rx_serverQueueEntry *np, *tqp;
1913 struct opr_queue *cursor;
1917 MUTEX_ENTER(&rx_serverPool_lock);
1919 #ifdef RX_ENABLE_LOCKS
1920 if (rx_waitForPacket)
1921 CV_BROADCAST(&rx_waitForPacket->cv);
1922 #else /* RX_ENABLE_LOCKS */
1923 if (rx_waitForPacket)
1924 osi_rxWakeup(rx_waitForPacket);
1925 #endif /* RX_ENABLE_LOCKS */
1926 MUTEX_ENTER(&freeSQEList_lock);
1927 for (np = rx_FreeSQEList; np; np = tqp) {
1928 tqp = *(struct rx_serverQueueEntry **)np;
1929 #ifdef RX_ENABLE_LOCKS
1930 CV_BROADCAST(&np->cv);
1931 #else /* RX_ENABLE_LOCKS */
1933 #endif /* RX_ENABLE_LOCKS */
1935 MUTEX_EXIT(&freeSQEList_lock);
1936 for (opr_queue_Scan(&rx_idleServerQueue, cursor)) {
1937 np = opr_queue_Entry(cursor, struct rx_serverQueueEntry, entry);
1938 #ifdef RX_ENABLE_LOCKS
1939 CV_BROADCAST(&np->cv);
1940 #else /* RX_ENABLE_LOCKS */
1942 #endif /* RX_ENABLE_LOCKS */
1944 MUTEX_EXIT(&rx_serverPool_lock);
1949 * One thing that seems to happen is that all the server threads get
1950 * tied up on some empty or slow call, and then a whole bunch of calls
1951 * arrive at once, using up the packet pool, so now there are more
1952 * empty calls. The most critical resources here are server threads
1953 * and the free packet pool. The "doreclaim" code seems to help in
1954 * general. I think that eventually we arrive in this state: there
1955 * are lots of pending calls which do have all their packets present,
1956 * so they won't be reclaimed, are multi-packet calls, so they won't
1957 * be scheduled until later, and thus are tying up most of the free
1958 * packet pool for a very long time.
1960 * 1. schedule multi-packet calls if all the packets are present.
1961 * Probably CPU-bound operation, useful to return packets to pool.
1962 * Do what if there is a full window, but the last packet isn't here?
1963 * 3. preserve one thread which *only* runs "best" calls, otherwise
1964 * it sleeps and waits for that type of call.
1965 * 4. Don't necessarily reserve a whole window for each thread. In fact,
1966 * the current dataquota business is badly broken. The quota isn't adjusted
1967 * to reflect how many packets are presently queued for a running call.
1968 * So, when we schedule a queued call with a full window of packets queued
1969 * up for it, that *should* free up a window full of packets for other 2d-class
1970 * calls to be able to use from the packet pool. But it doesn't.
1972 * NB. Most of the time, this code doesn't run -- since idle server threads
1973 * sit on the idle server queue and are assigned by "...ReceivePacket" as soon
1974 * as a new call arrives.
1976 /* Sleep until a call arrives. Returns a pointer to the call, ready
1977 * for an rx_Read. */
1978 #ifdef RX_ENABLE_LOCKS
1980 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
1982 struct rx_serverQueueEntry *sq;
1983 struct rx_call *call = (struct rx_call *)0;
1984 struct rx_service *service = NULL;
1986 MUTEX_ENTER(&freeSQEList_lock);
1988 if ((sq = rx_FreeSQEList)) {
1989 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
1990 MUTEX_EXIT(&freeSQEList_lock);
1991 } else { /* otherwise allocate a new one and return that */
1992 MUTEX_EXIT(&freeSQEList_lock);
1993 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
1994 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
1995 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
1998 MUTEX_ENTER(&rx_serverPool_lock);
1999 if (cur_service != NULL) {
2000 ReturnToServerPool(cur_service);
2003 if (!opr_queue_IsEmpty(&rx_incomingCallQueue)) {
2004 struct rx_call *tcall, *choice2 = NULL;
2005 struct opr_queue *cursor;
2007 /* Scan for eligible incoming calls. A call is not eligible
2008 * if the maximum number of calls for its service type are
2009 * already executing */
2010 /* One thread will process calls FCFS (to prevent starvation),
2011 * while the other threads may run ahead looking for calls which
2012 * have all their input data available immediately. This helps
2013 * keep threads from blocking, waiting for data from the client. */
2014 for (opr_queue_Scan(&rx_incomingCallQueue, cursor)) {
2015 tcall = opr_queue_Entry(cursor, struct rx_call, entry);
2017 service = tcall->conn->service;
2018 if (!QuotaOK(service)) {
2021 MUTEX_ENTER(&rx_pthread_mutex);
2022 if (tno == rxi_fcfs_thread_num
2023 || opr_queue_IsEnd(&rx_incomingCallQueue, cursor)) {
2024 MUTEX_EXIT(&rx_pthread_mutex);
2025 /* If we're the fcfs thread , then we'll just use
2026 * this call. If we haven't been able to find an optimal
2027 * choice, and we're at the end of the list, then use a
2028 * 2d choice if one has been identified. Otherwise... */
2029 call = (choice2 ? choice2 : tcall);
2030 service = call->conn->service;
2032 MUTEX_EXIT(&rx_pthread_mutex);
2033 if (!opr_queue_IsEmpty(&tcall->rq)) {
2034 struct rx_packet *rp;
2035 rp = opr_queue_First(&tcall->rq, struct rx_packet,
2037 if (rp->header.seq == 1) {
2039 || (rp->header.flags & RX_LAST_PACKET)) {
2041 } else if (rxi_2dchoice && !choice2
2042 && !(tcall->flags & RX_CALL_CLEARED)
2043 && (tcall->rprev > rxi_HardAckRate)) {
2053 ReturnToServerPool(service);
2059 opr_queue_Remove(&call->entry);
2060 MUTEX_EXIT(&rx_serverPool_lock);
2061 MUTEX_ENTER(&call->lock);
2063 if (call->flags & RX_CALL_WAIT_PROC) {
2064 call->flags &= ~RX_CALL_WAIT_PROC;
2065 rx_atomic_dec(&rx_nWaiting);
2068 if (call->state != RX_STATE_PRECALL || call->error) {
2069 MUTEX_EXIT(&call->lock);
2070 MUTEX_ENTER(&rx_serverPool_lock);
2071 ReturnToServerPool(service);
2076 if (opr_queue_IsEmpty(&call->rq)
2077 || opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq != 1)
2078 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2080 CLEAR_CALL_QUEUE_LOCK(call);
2083 /* If there are no eligible incoming calls, add this process
2084 * to the idle server queue, to wait for one */
2088 *socketp = OSI_NULLSOCKET;
2090 sq->socketp = socketp;
2091 opr_queue_Append(&rx_idleServerQueue, &sq->entry);
2092 #ifndef AFS_AIX41_ENV
2093 rx_waitForPacket = sq;
2094 #endif /* AFS_AIX41_ENV */
2096 CV_WAIT(&sq->cv, &rx_serverPool_lock);
2098 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2099 MUTEX_EXIT(&rx_serverPool_lock);
2100 return (struct rx_call *)0;
2103 } while (!(call = sq->newcall)
2104 && !(socketp && *socketp != OSI_NULLSOCKET));
2105 MUTEX_EXIT(&rx_serverPool_lock);
2107 MUTEX_ENTER(&call->lock);
2113 MUTEX_ENTER(&freeSQEList_lock);
2114 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2115 rx_FreeSQEList = sq;
2116 MUTEX_EXIT(&freeSQEList_lock);
2119 clock_GetTime(&call->startTime);
2120 call->state = RX_STATE_ACTIVE;
2121 call->app.mode = RX_MODE_RECEIVING;
2122 #ifdef RX_KERNEL_TRACE
2123 if (ICL_SETACTIVE(afs_iclSetp)) {
2124 int glockOwner = ISAFS_GLOCK();
2127 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2128 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2135 rxi_calltrace(RX_CALL_START, call);
2136 dpf(("rx_GetCall(port=%d, service=%d) ==> call %"AFS_PTR_FMT"\n",
2137 call->conn->service->servicePort, call->conn->service->serviceId,
2140 MUTEX_EXIT(&call->lock);
2141 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
2143 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2148 #else /* RX_ENABLE_LOCKS */
2150 rx_GetCall(int tno, struct rx_service *cur_service, osi_socket * socketp)
2152 struct rx_serverQueueEntry *sq;
2153 struct rx_call *call = (struct rx_call *)0, *choice2;
2154 struct rx_service *service = NULL;
2158 MUTEX_ENTER(&freeSQEList_lock);
2160 if ((sq = rx_FreeSQEList)) {
2161 rx_FreeSQEList = *(struct rx_serverQueueEntry **)sq;
2162 MUTEX_EXIT(&freeSQEList_lock);
2163 } else { /* otherwise allocate a new one and return that */
2164 MUTEX_EXIT(&freeSQEList_lock);
2165 sq = rxi_Alloc(sizeof(struct rx_serverQueueEntry));
2166 MUTEX_INIT(&sq->lock, "server Queue lock", MUTEX_DEFAULT, 0);
2167 CV_INIT(&sq->cv, "server Queue lock", CV_DEFAULT, 0);
2169 MUTEX_ENTER(&sq->lock);
2171 if (cur_service != NULL) {
2172 cur_service->nRequestsRunning--;
2173 MUTEX_ENTER(&rx_quota_mutex);
2174 if (cur_service->nRequestsRunning < cur_service->minProcs)
2177 MUTEX_EXIT(&rx_quota_mutex);
2179 if (!opr_queue_IsEmpty(&rx_incomingCallQueue)) {
2180 struct rx_call *tcall;
2181 struct opr_queue *cursor;
2182 /* Scan for eligible incoming calls. A call is not eligible
2183 * if the maximum number of calls for its service type are
2184 * already executing */
2185 /* One thread will process calls FCFS (to prevent starvation),
2186 * while the other threads may run ahead looking for calls which
2187 * have all their input data available immediately. This helps
2188 * keep threads from blocking, waiting for data from the client. */
2189 choice2 = (struct rx_call *)0;
2190 for (opr_queue_Scan(&rx_incomingCallQueue, cursor)) {
2191 tcall = opr_queue_Entry(cursor, struct rx_call, entry);
2192 service = tcall->conn->service;
2193 if (QuotaOK(service)) {
2194 MUTEX_ENTER(&rx_pthread_mutex);
2195 /* XXX - If tcall->entry.next is NULL, then we're no longer
2196 * on a queue at all. This shouldn't happen. */
2197 if (tno == rxi_fcfs_thread_num || !tcall->entry.next) {
2198 MUTEX_EXIT(&rx_pthread_mutex);
2199 /* If we're the fcfs thread, then we'll just use
2200 * this call. If we haven't been able to find an optimal
2201 * choice, and we're at the end of the list, then use a
2202 * 2d choice if one has been identified. Otherwise... */
2203 call = (choice2 ? choice2 : tcall);
2204 service = call->conn->service;
2206 MUTEX_EXIT(&rx_pthread_mutex);
2207 if (!opr_queue_IsEmpty(&tcall->rq)) {
2208 struct rx_packet *rp;
2209 rp = opr_queue_First(&tcall->rq, struct rx_packet,
2211 if (rp->header.seq == 1
2213 || (rp->header.flags & RX_LAST_PACKET))) {
2215 } else if (rxi_2dchoice && !choice2
2216 && !(tcall->flags & RX_CALL_CLEARED)
2217 && (tcall->rprev > rxi_HardAckRate)) {
2230 opr_queue_Remove(&call->entry);
2231 /* we can't schedule a call if there's no data!!! */
2232 /* send an ack if there's no data, if we're missing the
2233 * first packet, or we're missing something between first
2234 * and last -- there's a "hole" in the incoming data. */
2235 if (opr_queue_IsEmpty(&call->rq)
2236 || opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq != 1
2237 || call->rprev != opr_queue_Last(&call->rq, struct rx_packet, entry)->header.seq)
2238 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
2240 call->flags &= (~RX_CALL_WAIT_PROC);
2241 service->nRequestsRunning++;
2242 /* just started call in minProcs pool, need fewer to maintain
2244 MUTEX_ENTER(&rx_quota_mutex);
2245 if (service->nRequestsRunning <= service->minProcs)
2248 MUTEX_EXIT(&rx_quota_mutex);
2249 rx_atomic_dec(&rx_nWaiting);
2250 /* MUTEX_EXIT(&call->lock); */
2252 /* If there are no eligible incoming calls, add this process
2253 * to the idle server queue, to wait for one */
2256 *socketp = OSI_NULLSOCKET;
2258 sq->socketp = socketp;
2259 opr_queue_Append(&rx_idleServerQueue, &sq->entry);
2263 if (afs_termState == AFSOP_STOP_RXCALLBACK) {
2265 rxi_Free(sq, sizeof(struct rx_serverQueueEntry));
2266 return (struct rx_call *)0;
2269 } while (!(call = sq->newcall)
2270 && !(socketp && *socketp != OSI_NULLSOCKET));
2272 MUTEX_EXIT(&sq->lock);
2274 MUTEX_ENTER(&freeSQEList_lock);
2275 *(struct rx_serverQueueEntry **)sq = rx_FreeSQEList;
2276 rx_FreeSQEList = sq;
2277 MUTEX_EXIT(&freeSQEList_lock);
2280 clock_GetTime(&call->startTime);
2281 call->state = RX_STATE_ACTIVE;
2282 call->app.mode = RX_MODE_RECEIVING;
2283 #ifdef RX_KERNEL_TRACE
2284 if (ICL_SETACTIVE(afs_iclSetp)) {
2285 int glockOwner = ISAFS_GLOCK();
2288 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
2289 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
2296 rxi_calltrace(RX_CALL_START, call);
2297 dpf(("rx_GetCall(port=%d, service=%d) ==> call %p\n",
2298 call->conn->service->servicePort, call->conn->service->serviceId,
2301 dpf(("rx_GetCall(socketp=%p, *socketp=0x%x)\n", socketp, *socketp));
2308 #endif /* RX_ENABLE_LOCKS */
2312 /* Establish a procedure to be called when a packet arrives for a
2313 * call. This routine will be called at most once after each call,
2314 * and will also be called if there is an error condition on the or
2315 * the call is complete. Used by multi rx to build a selection
2316 * function which determines which of several calls is likely to be a
2317 * good one to read from.
2318 * NOTE: the way this is currently implemented it is probably only a
2319 * good idea to (1) use it immediately after a newcall (clients only)
2320 * and (2) only use it once. Other uses currently void your warranty
2323 rx_SetArrivalProc(struct rx_call *call,
2324 void (*proc) (struct rx_call * call,
2327 void * handle, int arg)
2329 call->arrivalProc = proc;
2330 call->arrivalProcHandle = handle;
2331 call->arrivalProcArg = arg;
2334 /* Call is finished (possibly prematurely). Return rc to the peer, if
2335 * appropriate, and return the final error code from the conversation
2339 rx_EndCall(struct rx_call *call, afs_int32 rc)
2341 struct rx_connection *conn = call->conn;
2345 dpf(("rx_EndCall(call %"AFS_PTR_FMT" rc %d error %d abortCode %d)\n",
2346 call, rc, call->error, call->abortCode));
2349 MUTEX_ENTER(&call->lock);
2351 if (rc == 0 && call->error == 0) {
2352 call->abortCode = 0;
2353 call->abortCount = 0;
2356 call->arrivalProc = (void (*)())0;
2357 if (rc && call->error == 0) {
2358 rxi_CallError(call, rc);
2359 call->app.mode = RX_MODE_ERROR;
2360 /* Send an abort message to the peer if this error code has
2361 * only just been set. If it was set previously, assume the
2362 * peer has already been sent the error code or will request it
2364 rxi_SendCallAbort(call, (struct rx_packet *)0, 0, 0);
2366 if (conn->type == RX_SERVER_CONNECTION) {
2367 /* Make sure reply or at least dummy reply is sent */
2368 if (call->app.mode == RX_MODE_RECEIVING) {
2369 MUTEX_EXIT(&call->lock);
2370 rxi_WriteProc(call, 0, 0);
2371 MUTEX_ENTER(&call->lock);
2373 if (call->app.mode == RX_MODE_SENDING) {
2374 MUTEX_EXIT(&call->lock);
2375 rxi_FlushWrite(call);
2376 MUTEX_ENTER(&call->lock);
2378 rxi_calltrace(RX_CALL_END, call);
2379 /* Call goes to hold state until reply packets are acknowledged */
2380 if (call->tfirst + call->nSoftAcked < call->tnext) {
2381 call->state = RX_STATE_HOLD;
2383 call->state = RX_STATE_DALLY;
2384 rxi_ClearTransmitQueue(call, 0);
2385 rxi_rto_cancel(call);
2386 rxi_CancelKeepAliveEvent(call);
2388 } else { /* Client connection */
2390 /* Make sure server receives input packets, in the case where
2391 * no reply arguments are expected */
2393 if ((call->app.mode == RX_MODE_SENDING)
2394 || (call->app.mode == RX_MODE_RECEIVING && call->rnext == 1)) {
2395 MUTEX_EXIT(&call->lock);
2396 (void)rxi_ReadProc(call, &dummy, 1);
2397 MUTEX_ENTER(&call->lock);
2400 /* If we had an outstanding delayed ack, be nice to the server
2401 * and force-send it now.
2403 if (call->delayedAckEvent) {
2404 rxi_CancelDelayedAckEvent(call);
2405 rxi_SendDelayedAck(NULL, call, NULL, 0);
2408 /* We need to release the call lock since it's lower than the
2409 * conn_call_lock and we don't want to hold the conn_call_lock
2410 * over the rx_ReadProc call. The conn_call_lock needs to be held
2411 * here for the case where rx_NewCall is perusing the calls on
2412 * the connection structure. We don't want to signal until
2413 * rx_NewCall is in a stable state. Otherwise, rx_NewCall may
2414 * have checked this call, found it active and by the time it
2415 * goes to sleep, will have missed the signal.
2417 MUTEX_EXIT(&call->lock);
2418 MUTEX_ENTER(&conn->conn_call_lock);
2419 MUTEX_ENTER(&call->lock);
2422 /* While there are some circumstances where a call with an error is
2423 * obviously not on a "busy" channel, be conservative (clearing
2424 * lastBusy is just best-effort to possibly speed up rx_NewCall).
2425 * The call channel is definitely not busy if we just successfully
2426 * completed a call on it. */
2427 conn->lastBusy[call->channel] = 0;
2429 } else if (call->error == RX_CALL_TIMEOUT) {
2430 /* The call is still probably running on the server side, so try to
2431 * avoid this call channel in the future. */
2432 conn->lastBusy[call->channel] = clock_Sec();
2435 MUTEX_ENTER(&conn->conn_data_lock);
2436 conn->flags |= RX_CONN_BUSY;
2437 if (conn->flags & RX_CONN_MAKECALL_WAITING) {
2438 MUTEX_EXIT(&conn->conn_data_lock);
2439 #ifdef RX_ENABLE_LOCKS
2440 CV_BROADCAST(&conn->conn_call_cv);
2445 #ifdef RX_ENABLE_LOCKS
2447 MUTEX_EXIT(&conn->conn_data_lock);
2449 #endif /* RX_ENABLE_LOCKS */
2450 call->state = RX_STATE_DALLY;
2452 error = call->error;
2454 /* currentPacket, nLeft, and NFree must be zeroed here, because
2455 * ResetCall cannot: ResetCall may be called at splnet(), in the
2456 * kernel version, and may interrupt the macros rx_Read or
2457 * rx_Write, which run at normal priority for efficiency. */
2458 if (call->app.currentPacket) {
2459 #ifdef RX_TRACK_PACKETS
2460 call->app.currentPacket->flags &= ~RX_PKTFLAG_CP;
2462 rxi_FreePacket(call->app.currentPacket);
2463 call->app.currentPacket = (struct rx_packet *)0;
2466 call->app.nLeft = call->app.nFree = call->app.curlen = 0;
2468 /* Free any packets from the last call to ReadvProc/WritevProc */
2469 #ifdef RXDEBUG_PACKET
2471 #endif /* RXDEBUG_PACKET */
2472 rxi_FreePackets(0, &call->app.iovq);
2473 MUTEX_EXIT(&call->lock);
2475 CALL_RELE(call, RX_CALL_REFCOUNT_BEGIN);
2476 if (conn->type == RX_CLIENT_CONNECTION) {
2477 MUTEX_ENTER(&conn->conn_data_lock);
2478 conn->flags &= ~RX_CONN_BUSY;
2479 MUTEX_EXIT(&conn->conn_data_lock);
2480 MUTEX_EXIT(&conn->conn_call_lock);
2484 * Map errors to the local host's errno.h format.
2486 error = ntoh_syserr_conv(error);
2488 /* If the caller said the call failed with some error, we had better
2489 * return an error code. */
2490 osi_Assert(!rc || error);
2494 #if !defined(KERNEL)
2496 /* Call this routine when shutting down a server or client (especially
2497 * clients). This will allow Rx to gracefully garbage collect server
2498 * connections, and reduce the number of retries that a server might
2499 * make to a dead client.
2500 * This is not quite right, since some calls may still be ongoing and
2501 * we can't lock them to destroy them. */
2505 struct rx_connection **conn_ptr, **conn_end;
2508 if (rx_atomic_test_and_set_bit(&rxinit_status, 0))
2509 return; /* Already shutdown. */
2511 rxi_DeleteCachedConnections();
2512 if (rx_connHashTable) {
2513 MUTEX_ENTER(&rx_connHashTable_lock);
2514 for (conn_ptr = &rx_connHashTable[0], conn_end =
2515 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
2517 struct rx_connection *conn, *next;
2518 for (conn = *conn_ptr; conn; conn = next) {
2520 if (conn->type == RX_CLIENT_CONNECTION) {
2521 MUTEX_ENTER(&rx_refcnt_mutex);
2523 MUTEX_EXIT(&rx_refcnt_mutex);
2524 #ifdef RX_ENABLE_LOCKS
2525 rxi_DestroyConnectionNoLock(conn);
2526 #else /* RX_ENABLE_LOCKS */
2527 rxi_DestroyConnection(conn);
2528 #endif /* RX_ENABLE_LOCKS */
2532 #ifdef RX_ENABLE_LOCKS
2533 while (rx_connCleanup_list) {
2534 struct rx_connection *conn;
2535 conn = rx_connCleanup_list;
2536 rx_connCleanup_list = rx_connCleanup_list->next;
2537 MUTEX_EXIT(&rx_connHashTable_lock);
2538 rxi_CleanupConnection(conn);
2539 MUTEX_ENTER(&rx_connHashTable_lock);
2541 MUTEX_EXIT(&rx_connHashTable_lock);
2542 #endif /* RX_ENABLE_LOCKS */
2547 afs_winsockCleanup();
2553 /* if we wakeup packet waiter too often, can get in loop with two
2554 AllocSendPackets each waking each other up (from ReclaimPacket calls) */
2556 rxi_PacketsUnWait(void)
2558 if (!rx_waitingForPackets) {
2562 if (rxi_OverQuota(RX_PACKET_CLASS_SEND)) {
2563 return; /* still over quota */
2566 rx_waitingForPackets = 0;
2567 #ifdef RX_ENABLE_LOCKS
2568 CV_BROADCAST(&rx_waitingForPackets_cv);
2570 osi_rxWakeup(&rx_waitingForPackets);
2576 /* ------------------Internal interfaces------------------------- */
2578 /* Return this process's service structure for the
2579 * specified socket and service */
2580 static struct rx_service *
2581 rxi_FindService(osi_socket socket, u_short serviceId)
2583 struct rx_service **sp;
2584 for (sp = &rx_services[0]; *sp; sp++) {
2585 if ((*sp)->serviceId == serviceId && (*sp)->socket == socket)
2591 #ifdef RXDEBUG_PACKET
2592 #ifdef KDUMP_RX_LOCK
2593 static struct rx_call_rx_lock *rx_allCallsp = 0;
2595 static struct rx_call *rx_allCallsp = 0;
2597 #endif /* RXDEBUG_PACKET */
2599 /* Allocate a call structure, for the indicated channel of the
2600 * supplied connection. The mode and state of the call must be set by
2601 * the caller. Returns the call with mutex locked. */
2602 static struct rx_call *
2603 rxi_NewCall(struct rx_connection *conn, int channel)
2605 struct rx_call *call;
2606 #ifdef RX_ENABLE_LOCKS
2607 struct rx_call *cp; /* Call pointer temp */
2608 struct opr_queue *cursor;
2611 dpf(("rxi_NewCall(conn %"AFS_PTR_FMT", channel %d)\n", conn, channel));
2613 /* Grab an existing call structure, or allocate a new one.
2614 * Existing call structures are assumed to have been left reset by
2616 MUTEX_ENTER(&rx_freeCallQueue_lock);
2618 #ifdef RX_ENABLE_LOCKS
2620 * EXCEPT that the TQ might not yet be cleared out.
2621 * Skip over those with in-use TQs.
2624 for (opr_queue_Scan(&rx_freeCallQueue, cursor)) {
2625 cp = opr_queue_Entry(cursor, struct rx_call, entry);
2626 if (!(cp->flags & RX_CALL_TQ_BUSY)) {
2632 #else /* RX_ENABLE_LOCKS */
2633 if (!opr_queue_IsEmpty(&rx_freeCallQueue)) {
2634 call = opr_queue_First(&rx_freeCallQueue, struct rx_call, entry);
2635 #endif /* RX_ENABLE_LOCKS */
2636 opr_queue_Remove(&call->entry);
2637 if (rx_stats_active)
2638 rx_atomic_dec(&rx_stats.nFreeCallStructs);
2639 MUTEX_EXIT(&rx_freeCallQueue_lock);
2640 MUTEX_ENTER(&call->lock);
2641 CLEAR_CALL_QUEUE_LOCK(call);
2642 #ifdef RX_ENABLE_LOCKS
2643 /* Now, if TQ wasn't cleared earlier, do it now. */
2644 rxi_WaitforTQBusy(call);
2645 if (call->flags & RX_CALL_TQ_CLEARME) {
2646 rxi_ClearTransmitQueue(call, 1);
2647 /*queue_Init(&call->tq);*/
2649 #endif /* RX_ENABLE_LOCKS */
2650 /* Bind the call to its connection structure */
2652 rxi_ResetCall(call, 1);
2655 call = rxi_Alloc(sizeof(struct rx_call));
2656 #ifdef RXDEBUG_PACKET
2657 call->allNextp = rx_allCallsp;
2658 rx_allCallsp = call;
2660 rx_atomic_inc_and_read(&rx_stats.nCallStructs);
2661 #else /* RXDEBUG_PACKET */
2662 rx_atomic_inc(&rx_stats.nCallStructs);
2663 #endif /* RXDEBUG_PACKET */
2665 MUTEX_EXIT(&rx_freeCallQueue_lock);
2666 MUTEX_INIT(&call->lock, "call lock", MUTEX_DEFAULT, NULL);
2667 MUTEX_ENTER(&call->lock);
2668 CV_INIT(&call->cv_twind, "call twind", CV_DEFAULT, 0);
2669 CV_INIT(&call->cv_rq, "call rq", CV_DEFAULT, 0);
2670 CV_INIT(&call->cv_tq, "call tq", CV_DEFAULT, 0);
2672 /* Initialize once-only items */
2673 opr_queue_Init(&call->tq);
2674 opr_queue_Init(&call->rq);
2675 opr_queue_Init(&call->app.iovq);
2676 #ifdef RXDEBUG_PACKET
2677 call->rqc = call->tqc = call->iovqc = 0;
2678 #endif /* RXDEBUG_PACKET */
2679 /* Bind the call to its connection structure (prereq for reset) */
2681 rxi_ResetCall(call, 1);
2683 call->channel = channel;
2684 call->callNumber = &conn->callNumber[channel];
2685 call->rwind = conn->rwind[channel];
2686 call->twind = conn->twind[channel];
2687 /* Note that the next expected call number is retained (in
2688 * conn->callNumber[i]), even if we reallocate the call structure
2690 conn->call[channel] = call;
2691 /* if the channel's never been used (== 0), we should start at 1, otherwise
2692 * the call number is valid from the last time this channel was used */
2693 if (*call->callNumber == 0)
2694 *call->callNumber = 1;
2699 /* A call has been inactive long enough that so we can throw away
2700 * state, including the call structure, which is placed on the call
2703 * call->lock amd rx_refcnt_mutex are held upon entry.
2704 * haveCTLock is set when called from rxi_ReapConnections.
2706 * return 1 if the call is freed, 0 if not.
2709 rxi_FreeCall(struct rx_call *call, int haveCTLock)
2711 int channel = call->channel;
2712 struct rx_connection *conn = call->conn;
2713 u_char state = call->state;
2716 * We are setting the state to RX_STATE_RESET to
2717 * ensure that no one else will attempt to use this
2718 * call once we drop the refcnt lock. We must drop
2719 * the refcnt lock before calling rxi_ResetCall
2720 * because it cannot be held across acquiring the
2721 * freepktQ lock. NewCall does the same.
2723 call->state = RX_STATE_RESET;
2724 MUTEX_EXIT(&rx_refcnt_mutex);
2725 rxi_ResetCall(call, 0);
2727 if (MUTEX_TRYENTER(&conn->conn_call_lock))
2729 if (state == RX_STATE_DALLY || state == RX_STATE_HOLD)
2730 (*call->callNumber)++;
2732 if (call->conn->call[channel] == call)
2733 call->conn->call[channel] = 0;
2734 MUTEX_EXIT(&conn->conn_call_lock);
2737 * We couldn't obtain the conn_call_lock so we can't
2738 * disconnect the call from the connection. Set the
2739 * call state to dally so that the call can be reused.
2741 MUTEX_ENTER(&rx_refcnt_mutex);
2742 call->state = RX_STATE_DALLY;
2746 MUTEX_ENTER(&rx_freeCallQueue_lock);
2747 SET_CALL_QUEUE_LOCK(call, &rx_freeCallQueue_lock);
2748 #ifdef RX_ENABLE_LOCKS
2749 /* A call may be free even though its transmit queue is still in use.
2750 * Since we search the call list from head to tail, put busy calls at
2751 * the head of the list, and idle calls at the tail.
2753 if (call->flags & RX_CALL_TQ_BUSY)
2754 opr_queue_Prepend(&rx_freeCallQueue, &call->entry);
2756 opr_queue_Append(&rx_freeCallQueue, &call->entry);
2757 #else /* RX_ENABLE_LOCKS */
2758 opr_queue_Append(&rx_freeCallQueue, &call->entry);
2759 #endif /* RX_ENABLE_LOCKS */
2760 if (rx_stats_active)
2761 rx_atomic_inc(&rx_stats.nFreeCallStructs);
2762 MUTEX_EXIT(&rx_freeCallQueue_lock);
2764 /* Destroy the connection if it was previously slated for
2765 * destruction, i.e. the Rx client code previously called
2766 * rx_DestroyConnection (client connections), or
2767 * rxi_ReapConnections called the same routine (server
2768 * connections). Only do this, however, if there are no
2769 * outstanding calls. Note that for fine grain locking, there appears
2770 * to be a deadlock in that rxi_FreeCall has a call locked and
2771 * DestroyConnectionNoLock locks each call in the conn. But note a
2772 * few lines up where we have removed this call from the conn.
2773 * If someone else destroys a connection, they either have no
2774 * call lock held or are going through this section of code.
2776 MUTEX_ENTER(&conn->conn_data_lock);
2777 if (conn->flags & RX_CONN_DESTROY_ME && !(conn->flags & RX_CONN_MAKECALL_WAITING)) {
2778 MUTEX_ENTER(&rx_refcnt_mutex);
2780 MUTEX_EXIT(&rx_refcnt_mutex);
2781 MUTEX_EXIT(&conn->conn_data_lock);
2782 #ifdef RX_ENABLE_LOCKS
2784 rxi_DestroyConnectionNoLock(conn);
2786 rxi_DestroyConnection(conn);
2787 #else /* RX_ENABLE_LOCKS */
2788 rxi_DestroyConnection(conn);
2789 #endif /* RX_ENABLE_LOCKS */
2791 MUTEX_EXIT(&conn->conn_data_lock);
2793 MUTEX_ENTER(&rx_refcnt_mutex);
2797 rx_atomic_t rxi_Allocsize = RX_ATOMIC_INIT(0);
2798 rx_atomic_t rxi_Alloccnt = RX_ATOMIC_INIT(0);
2801 rxi_Alloc(size_t size)
2805 if (rx_stats_active) {
2806 rx_atomic_add(&rxi_Allocsize, (int) size);
2807 rx_atomic_inc(&rxi_Alloccnt);
2811 #if defined(KERNEL) && !defined(UKERNEL) && defined(AFS_FBSD80_ENV)
2812 afs_osi_Alloc_NoSleep(size);
2817 osi_Panic("rxi_Alloc error");
2823 rxi_Free(void *addr, size_t size)
2825 if (rx_stats_active) {
2826 rx_atomic_sub(&rxi_Allocsize, (int) size);
2827 rx_atomic_dec(&rxi_Alloccnt);
2829 osi_Free(addr, size);
2833 rxi_SetPeerMtu(struct rx_peer *peer, afs_uint32 host, afs_uint32 port, int mtu)
2835 struct rx_peer **peer_ptr = NULL, **peer_end = NULL;
2836 struct rx_peer *next = NULL;
2840 MUTEX_ENTER(&rx_peerHashTable_lock);
2842 peer_ptr = &rx_peerHashTable[0];
2843 peer_end = &rx_peerHashTable[rx_hashTableSize];
2846 for ( ; peer_ptr < peer_end; peer_ptr++) {
2849 for ( ; peer; peer = next) {
2851 if (host == peer->host)
2856 hashIndex = PEER_HASH(host, port);
2857 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2858 if ((peer->host == host) && (peer->port == port))
2863 MUTEX_ENTER(&rx_peerHashTable_lock);
2868 MUTEX_EXIT(&rx_peerHashTable_lock);
2870 MUTEX_ENTER(&peer->peer_lock);
2871 /* We don't handle dropping below min, so don't */
2872 mtu = MAX(mtu, RX_MIN_PACKET_SIZE);
2873 peer->ifMTU=MIN(mtu, peer->ifMTU);
2874 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
2875 /* if we tweaked this down, need to tune our peer MTU too */
2876 peer->MTU = MIN(peer->MTU, peer->natMTU);
2877 /* if we discovered a sub-1500 mtu, degrade */
2878 if (peer->ifMTU < OLD_MAX_PACKET_SIZE)
2879 peer->maxDgramPackets = 1;
2880 /* We no longer have valid peer packet information */
2881 if (peer->maxPacketSize + RX_HEADER_SIZE > peer->ifMTU)
2882 peer->maxPacketSize = 0;
2883 MUTEX_EXIT(&peer->peer_lock);
2885 MUTEX_ENTER(&rx_peerHashTable_lock);
2887 if (host && !port) {
2889 /* pick up where we left off */
2893 MUTEX_EXIT(&rx_peerHashTable_lock);
2896 #ifdef AFS_RXERRQ_ENV
2898 rxi_SetPeerDead(struct sock_extended_err *err, afs_uint32 host, afs_uint16 port)
2900 int hashIndex = PEER_HASH(host, port);
2901 struct rx_peer *peer;
2903 MUTEX_ENTER(&rx_peerHashTable_lock);
2905 for (peer = rx_peerHashTable[hashIndex]; peer; peer = peer->next) {
2906 if (peer->host == host && peer->port == port) {
2912 MUTEX_EXIT(&rx_peerHashTable_lock);
2915 rx_atomic_inc(&peer->neterrs);
2916 MUTEX_ENTER(&peer->peer_lock);
2917 peer->last_err_origin = RX_NETWORK_ERROR_ORIGIN_ICMP;
2918 peer->last_err_type = err->ee_type;
2919 peer->last_err_code = err->ee_code;
2920 MUTEX_EXIT(&peer->peer_lock);
2922 MUTEX_ENTER(&rx_peerHashTable_lock);
2924 MUTEX_EXIT(&rx_peerHashTable_lock);
2929 rxi_ProcessNetError(struct sock_extended_err *err, afs_uint32 addr, afs_uint16 port)
2931 # ifdef AFS_ADAPT_PMTU
2932 if (err->ee_errno == EMSGSIZE && err->ee_info >= 68) {
2933 rxi_SetPeerMtu(NULL, addr, port, err->ee_info - RX_IPUDP_SIZE);
2937 if (err->ee_origin == SO_EE_ORIGIN_ICMP && err->ee_type == ICMP_DEST_UNREACH) {
2938 switch (err->ee_code) {
2939 case ICMP_NET_UNREACH:
2940 case ICMP_HOST_UNREACH:
2941 case ICMP_PORT_UNREACH:
2944 rxi_SetPeerDead(err, addr, port);
2951 rxi_TranslateICMP(int type, int code)
2954 case ICMP_DEST_UNREACH:
2956 case ICMP_NET_UNREACH:
2957 return "Destination Net Unreachable";
2958 case ICMP_HOST_UNREACH:
2959 return "Destination Host Unreachable";
2960 case ICMP_PROT_UNREACH:
2961 return "Destination Protocol Unreachable";
2962 case ICMP_PORT_UNREACH:
2963 return "Destination Port Unreachable";
2965 return "Destination Net Prohibited";
2967 return "Destination Host Prohibited";
2973 #endif /* AFS_RXERRQ_ENV */
2976 * Get the last network error for a connection
2978 * A "network error" here means an error retrieved from ICMP, or some other
2979 * mechanism outside of Rx that informs us of errors in network reachability.
2981 * If a peer associated with the given Rx connection has received a network
2982 * error recently, this function allows the caller to know what error
2983 * specifically occurred. This can be useful to know, since e.g. ICMP errors
2984 * can cause calls to that peer to be quickly aborted. So, this function can
2985 * help see why a call was aborted due to network errors.
2987 * If we have received traffic from a peer since the last network error, we
2988 * treat that peer as if we had not received an network error for it.
2990 * @param[in] conn The Rx connection to examine
2991 * @param[out] err_origin The origin of the last network error (e.g. ICMP);
2992 * one of the RX_NETWORK_ERROR_ORIGIN_* constants
2993 * @param[out] err_type The type of the last error
2994 * @param[out] err_code The code of the last error
2995 * @param[out] msg Human-readable error message, if applicable; NULL otherwise
2997 * @return If we have an error
2998 * @retval -1 No error to get; 'out' params are undefined
2999 * @retval 0 We have an error; 'out' params contain the last error
3002 rx_GetNetworkError(struct rx_connection *conn, int *err_origin, int *err_type,
3003 int *err_code, const char **msg)
3005 #ifdef AFS_RXERRQ_ENV
3006 struct rx_peer *peer = conn->peer;
3007 if (rx_atomic_read(&peer->neterrs)) {
3008 MUTEX_ENTER(&peer->peer_lock);
3009 *err_origin = peer->last_err_origin;
3010 *err_type = peer->last_err_type;
3011 *err_code = peer->last_err_code;
3012 MUTEX_EXIT(&peer->peer_lock);
3015 if (*err_origin == RX_NETWORK_ERROR_ORIGIN_ICMP) {
3016 *msg = rxi_TranslateICMP(*err_type, *err_code);
3025 /* Find the peer process represented by the supplied (host,port)
3026 * combination. If there is no appropriate active peer structure, a
3027 * new one will be allocated and initialized
3030 rxi_FindPeer(afs_uint32 host, u_short port, int create)
3034 hashIndex = PEER_HASH(host, port);
3035 MUTEX_ENTER(&rx_peerHashTable_lock);
3036 for (pp = rx_peerHashTable[hashIndex]; pp; pp = pp->next) {
3037 if ((pp->host == host) && (pp->port == port))
3042 pp = rxi_AllocPeer(); /* This bzero's *pp */
3043 pp->host = host; /* set here or in InitPeerParams is zero */
3045 #ifdef AFS_RXERRQ_ENV
3046 rx_atomic_set(&pp->neterrs, 0);
3048 MUTEX_INIT(&pp->peer_lock, "peer_lock", MUTEX_DEFAULT, 0);
3049 opr_queue_Init(&pp->rpcStats);
3050 pp->next = rx_peerHashTable[hashIndex];
3051 rx_peerHashTable[hashIndex] = pp;
3052 rxi_InitPeerParams(pp);
3053 if (rx_stats_active)
3054 rx_atomic_inc(&rx_stats.nPeerStructs);
3060 MUTEX_EXIT(&rx_peerHashTable_lock);
3065 /* Find the connection at (host, port) started at epoch, and with the
3066 * given connection id. Creates the server connection if necessary.
3067 * The type specifies whether a client connection or a server
3068 * connection is desired. In both cases, (host, port) specify the
3069 * peer's (host, pair) pair. Client connections are not made
3070 * automatically by this routine. The parameter socket gives the
3071 * socket descriptor on which the packet was received. This is used,
3072 * in the case of server connections, to check that *new* connections
3073 * come via a valid (port, serviceId). Finally, the securityIndex
3074 * parameter must match the existing index for the connection. If a
3075 * server connection is created, it will be created using the supplied
3076 * index, if the index is valid for this service */
3077 static struct rx_connection *
3078 rxi_FindConnection(osi_socket socket, afs_uint32 host,
3079 u_short port, u_short serviceId, afs_uint32 cid,
3080 afs_uint32 epoch, int type, u_int securityIndex,
3081 int *unknownService)
3083 int hashindex, flag, i;
3084 struct rx_connection *conn;
3085 *unknownService = 0;
3086 hashindex = CONN_HASH(host, port, cid, epoch, type);
3087 MUTEX_ENTER(&rx_connHashTable_lock);
3088 rxLastConn ? (conn = rxLastConn, flag = 0) : (conn =
3089 rx_connHashTable[hashindex],
3092 if ((conn->type == type) && ((cid & RX_CIDMASK) == conn->cid)
3093 && (epoch == conn->epoch)) {
3094 struct rx_peer *pp = conn->peer;
3095 if (securityIndex != conn->securityIndex) {
3096 /* this isn't supposed to happen, but someone could forge a packet
3097 * like this, and there seems to be some CM bug that makes this
3098 * happen from time to time -- in which case, the fileserver
3100 MUTEX_EXIT(&rx_connHashTable_lock);
3101 return (struct rx_connection *)0;
3103 if (pp->host == host && pp->port == port)
3105 if (type == RX_CLIENT_CONNECTION && pp->port == port)
3107 /* So what happens when it's a callback connection? */
3108 if ( /*type == RX_CLIENT_CONNECTION && */
3109 (conn->epoch & 0x80000000))
3113 /* the connection rxLastConn that was used the last time is not the
3114 ** one we are looking for now. Hence, start searching in the hash */
3116 conn = rx_connHashTable[hashindex];
3121 struct rx_service *service;
3122 if (type == RX_CLIENT_CONNECTION) {
3123 MUTEX_EXIT(&rx_connHashTable_lock);
3124 return (struct rx_connection *)0;
3126 service = rxi_FindService(socket, serviceId);
3127 if (!service || (securityIndex >= service->nSecurityObjects)
3128 || (service->securityObjects[securityIndex] == 0)) {
3129 MUTEX_EXIT(&rx_connHashTable_lock);
3130 *unknownService = 1;
3131 return (struct rx_connection *)0;
3133 conn = rxi_AllocConnection(); /* This bzero's the connection */
3134 MUTEX_INIT(&conn->conn_call_lock, "conn call lock", MUTEX_DEFAULT, 0);
3135 MUTEX_INIT(&conn->conn_data_lock, "conn data lock", MUTEX_DEFAULT, 0);
3136 CV_INIT(&conn->conn_call_cv, "conn call cv", CV_DEFAULT, 0);
3137 conn->next = rx_connHashTable[hashindex];
3138 rx_connHashTable[hashindex] = conn;
3139 conn->peer = rxi_FindPeer(host, port, 1);
3140 conn->type = RX_SERVER_CONNECTION;
3141 conn->lastSendTime = clock_Sec(); /* don't GC immediately */
3142 conn->epoch = epoch;
3143 conn->cid = cid & RX_CIDMASK;
3144 conn->ackRate = RX_FAST_ACK_RATE;
3145 conn->service = service;
3146 conn->serviceId = serviceId;
3147 conn->securityIndex = securityIndex;
3148 conn->securityObject = service->securityObjects[securityIndex];
3149 conn->nSpecific = 0;
3150 conn->specific = NULL;
3151 rx_SetConnDeadTime(conn, service->connDeadTime);
3152 rx_SetConnIdleDeadTime(conn, service->idleDeadTime);
3153 for (i = 0; i < RX_MAXCALLS; i++) {
3154 conn->twind[i] = rx_initSendWindow;
3155 conn->rwind[i] = rx_initReceiveWindow;
3157 /* Notify security object of the new connection */
3158 RXS_NewConnection(conn->securityObject, conn);
3159 /* XXXX Connection timeout? */
3160 if (service->newConnProc)
3161 (*service->newConnProc) (conn);
3162 if (rx_stats_active)
3163 rx_atomic_inc(&rx_stats.nServerConns);
3166 MUTEX_ENTER(&rx_refcnt_mutex);
3168 MUTEX_EXIT(&rx_refcnt_mutex);
3170 rxLastConn = conn; /* store this connection as the last conn used */
3171 MUTEX_EXIT(&rx_connHashTable_lock);
3176 * Abort the call if the server is over the busy threshold. This
3177 * can be used without requiring a call structure be initialised,
3178 * or connected to a particular channel
3181 rxi_AbortIfServerBusy(osi_socket socket, struct rx_connection *conn,
3182 struct rx_packet *np)
3184 if ((rx_BusyThreshold > 0) &&
3185 (rx_atomic_read(&rx_nWaiting) > rx_BusyThreshold)) {
3186 rxi_SendRawAbort(socket, conn->peer->host, conn->peer->port,
3187 rx_BusyError, np, 0);
3188 if (rx_stats_active)
3189 rx_atomic_inc(&rx_stats.nBusies);
3196 static_inline struct rx_call *
3197 rxi_ReceiveClientCall(struct rx_packet *np, struct rx_connection *conn)
3200 struct rx_call *call;
3202 channel = np->header.cid & RX_CHANNELMASK;
3203 MUTEX_ENTER(&conn->conn_call_lock);
3204 call = conn->call[channel];
3205 if (np->header.type == RX_PACKET_TYPE_BUSY) {
3206 conn->lastBusy[channel] = clock_Sec();
3208 if (!call || conn->callNumber[channel] != np->header.callNumber) {
3209 MUTEX_EXIT(&conn->conn_call_lock);
3210 if (rx_stats_active)
3211 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3215 MUTEX_ENTER(&call->lock);
3216 MUTEX_EXIT(&conn->conn_call_lock);
3218 if ((call->state == RX_STATE_DALLY)
3219 && np->header.type == RX_PACKET_TYPE_ACK) {
3220 if (rx_stats_active)
3221 rx_atomic_inc(&rx_stats.ignorePacketDally);
3222 MUTEX_EXIT(&call->lock);
3229 static_inline struct rx_call *
3230 rxi_ReceiveServerCall(osi_socket socket, struct rx_packet *np,
3231 struct rx_connection *conn)
3234 struct rx_call *call;
3236 channel = np->header.cid & RX_CHANNELMASK;
3237 MUTEX_ENTER(&conn->conn_call_lock);
3238 call = conn->call[channel];
3241 if (rxi_AbortIfServerBusy(socket, conn, np)) {
3242 MUTEX_EXIT(&conn->conn_call_lock);
3246 call = rxi_NewCall(conn, channel); /* returns locked call */
3247 *call->callNumber = np->header.callNumber;
3248 MUTEX_EXIT(&conn->conn_call_lock);
3250 call->state = RX_STATE_PRECALL;
3251 clock_GetTime(&call->queueTime);
3252 call->app.bytesSent = 0;
3253 call->app.bytesRcvd = 0;
3254 rxi_KeepAliveOn(call);
3259 if (np->header.callNumber == conn->callNumber[channel]) {
3260 MUTEX_ENTER(&call->lock);
3261 MUTEX_EXIT(&conn->conn_call_lock);
3265 if (np->header.callNumber < conn->callNumber[channel]) {
3266 MUTEX_EXIT(&conn->conn_call_lock);
3267 if (rx_stats_active)
3268 rx_atomic_inc(&rx_stats.spuriousPacketsRead);
3272 MUTEX_ENTER(&call->lock);
3273 MUTEX_EXIT(&conn->conn_call_lock);
3275 /* Wait until the transmit queue is idle before deciding
3276 * whether to reset the current call. Chances are that the
3277 * call will be in ether DALLY or HOLD state once the TQ_BUSY
3280 #ifdef RX_ENABLE_LOCKS
3281 if (call->state == RX_STATE_ACTIVE && !call->error) {
3282 rxi_WaitforTQBusy(call);
3283 /* If we entered error state while waiting,
3284 * must call rxi_CallError to permit rxi_ResetCall
3285 * to processed when the tqWaiter count hits zero.
3288 rxi_CallError(call, call->error);
3289 MUTEX_EXIT(&call->lock);
3293 #endif /* RX_ENABLE_LOCKS */
3294 /* If the new call cannot be taken right now send a busy and set
3295 * the error condition in this call, so that it terminates as
3296 * quickly as possible */
3297 if (call->state == RX_STATE_ACTIVE) {
3298 rxi_CallError(call, RX_CALL_DEAD);
3299 rxi_SendSpecial(call, conn, NULL, RX_PACKET_TYPE_BUSY,
3301 MUTEX_EXIT(&call->lock);
3305 if (rxi_AbortIfServerBusy(socket, conn, np)) {
3306 MUTEX_EXIT(&call->lock);
3310 rxi_ResetCall(call, 0);
3311 /* The conn_call_lock is not held but no one else should be
3312 * using this call channel while we are processing this incoming
3313 * packet. This assignment should be safe.
3315 *call->callNumber = np->header.callNumber;
3316 call->state = RX_STATE_PRECALL;
3317 clock_GetTime(&call->queueTime);
3318 call->app.bytesSent = 0;
3319 call->app.bytesRcvd = 0;
3320 rxi_KeepAliveOn(call);
3326 /* There are two packet tracing routines available for testing and monitoring
3327 * Rx. One is called just after every packet is received and the other is
3328 * called just before every packet is sent. Received packets, have had their
3329 * headers decoded, and packets to be sent have not yet had their headers
3330 * encoded. Both take two parameters: a pointer to the packet and a sockaddr
3331 * containing the network address. Both can be modified. The return value, if
3332 * non-zero, indicates that the packet should be dropped. */
3334 int (*rx_justReceived) (struct rx_packet *, struct sockaddr_in *) = 0;
3335 int (*rx_almostSent) (struct rx_packet *, struct sockaddr_in *) = 0;
3337 /* A packet has been received off the interface. Np is the packet, socket is
3338 * the socket number it was received from (useful in determining which service
3339 * this packet corresponds to), and (host, port) reflect the host,port of the
3340 * sender. This call returns the packet to the caller if it is finished with
3341 * it, rather than de-allocating it, just as a small performance hack */
3344 rxi_ReceivePacket(struct rx_packet *np, osi_socket socket,
3345 afs_uint32 host, u_short port, int *tnop,
3346 struct rx_call **newcallp)
3348 struct rx_call *call;
3349 struct rx_connection *conn;
3351 int unknownService = 0;
3355 struct rx_packet *tnp;
3358 /* We don't print out the packet until now because (1) the time may not be
3359 * accurate enough until now in the lwp implementation (rx_Listener only gets
3360 * the time after the packet is read) and (2) from a protocol point of view,
3361 * this is the first time the packet has been seen */
3362 packetType = (np->header.type > 0 && np->header.type < RX_N_PACKET_TYPES)
3363 ? rx_packetTypes[np->header.type - 1] : "*UNKNOWN*";
3364 dpf(("R %d %s: %x.%d.%d.%d.%d.%d.%d flags %d, packet %"AFS_PTR_FMT"\n",
3365 np->header.serial, packetType, ntohl(host), ntohs(port), np->header.serviceId,
3366 np->header.epoch, np->header.cid, np->header.callNumber,
3367 np->header.seq, np->header.flags, np));
3370 /* Account for connectionless packets */
3371 if (rx_stats_active &&
3372 ((np->header.type == RX_PACKET_TYPE_VERSION) ||
3373 (np->header.type == RX_PACKET_TYPE_DEBUG))) {
3374 struct rx_peer *peer;
3376 /* Try to look up the peer structure, but don't create one */
3377 peer = rxi_FindPeer(host, port, 0);
3379 /* Since this may not be associated with a connection, it may have
3380 * no refCount, meaning we could race with ReapConnections
3383 if (peer && (peer->refCount > 0)) {
3384 #ifdef AFS_RXERRQ_ENV
3385 if (rx_atomic_read(&peer->neterrs)) {
3386 rx_atomic_set(&peer->neterrs, 0);
3389 MUTEX_ENTER(&peer->peer_lock);
3390 peer->bytesReceived += np->length;
3391 MUTEX_EXIT(&peer->peer_lock);
3395 if (np->header.type == RX_PACKET_TYPE_VERSION) {
3396 return rxi_ReceiveVersionPacket(np, socket, host, port, 1);
3399 if (np->header.type == RX_PACKET_TYPE_DEBUG) {
3400 return rxi_ReceiveDebugPacket(np, socket, host, port, 1);
3403 /* If an input tracer function is defined, call it with the packet and
3404 * network address. Note this function may modify its arguments. */
3405 if (rx_justReceived) {
3406 struct sockaddr_in addr;
3408 addr.sin_family = AF_INET;
3409 addr.sin_port = port;
3410 addr.sin_addr.s_addr = host;
3411 memset(&addr.sin_zero, 0, sizeof(addr.sin_zero));
3412 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
3413 addr.sin_len = sizeof(addr);
3414 #endif /* AFS_OSF_ENV */
3415 drop = (*rx_justReceived) (np, &addr);
3416 /* drop packet if return value is non-zero */
3419 port = addr.sin_port; /* in case fcn changed addr */
3420 host = addr.sin_addr.s_addr;
3424 /* If packet was not sent by the client, then *we* must be the client */
3425 type = ((np->header.flags & RX_CLIENT_INITIATED) != RX_CLIENT_INITIATED)
3426 ? RX_CLIENT_CONNECTION : RX_SERVER_CONNECTION;
3428 /* Find the connection (or fabricate one, if we're the server & if
3429 * necessary) associated with this packet */
3431 rxi_FindConnection(socket, host, port, np->header.serviceId,
3432 np->header.cid, np->header.epoch, type,
3433 np->header.securityIndex, &unknownService);
3435 /* To avoid having 2 connections just abort at each other,
3436 don't abort an abort. */
3438 if (unknownService && (np->header.type != RX_PACKET_TYPE_ABORT))
3439 rxi_SendRawAbort(socket, host, port, RX_INVALID_OPERATION,
3444 #ifdef AFS_RXERRQ_ENV
3445 if (rx_atomic_read(&conn->peer->neterrs)) {
3446 rx_atomic_set(&conn->peer->neterrs, 0);
3450 /* If we're doing statistics, then account for the incoming packet */
3451 if (rx_stats_active) {
3452 MUTEX_ENTER(&conn->peer->peer_lock);
3453 conn->peer->bytesReceived += np->length;
3454 MUTEX_EXIT(&conn->peer->peer_lock);
3457 /* If the connection is in an error state, send an abort packet and ignore
3458 * the incoming packet */
3460 /* Don't respond to an abort packet--we don't want loops! */
3461 MUTEX_ENTER(&conn->conn_data_lock);
3462 if (np->header.type != RX_PACKET_TYPE_ABORT)
3463 np = rxi_SendConnectionAbort(conn, np, 1, 0);
3464 putConnection(conn);
3465 MUTEX_EXIT(&conn->conn_data_lock);
3469 /* Check for connection-only requests (i.e. not call specific). */
3470 if (np->header.callNumber == 0) {
3471 switch (np->header.type) {
3472 case RX_PACKET_TYPE_ABORT: {
3473 /* What if the supplied error is zero? */
3474 afs_int32 errcode = ntohl(rx_GetInt32(np, 0));
3475 dpf(("rxi_ReceivePacket ABORT rx_GetInt32 = %d\n", errcode));
3476 rxi_ConnectionError(conn, errcode);
3477 putConnection(conn);
3480 case RX_PACKET_TYPE_CHALLENGE:
3481 tnp = rxi_ReceiveChallengePacket(conn, np, 1);
3482 putConnection(conn);
3484 case RX_PACKET_TYPE_RESPONSE:
3485 tnp = rxi_ReceiveResponsePacket(conn, np, 1);
3486 putConnection(conn);
3488 case RX_PACKET_TYPE_PARAMS:
3489 case RX_PACKET_TYPE_PARAMS + 1:
3490 case RX_PACKET_TYPE_PARAMS + 2:
3491 /* ignore these packet types for now */
3492 putConnection(conn);
3496 /* Should not reach here, unless the peer is broken: send an
3498 rxi_ConnectionError(conn, RX_PROTOCOL_ERROR);
3499 MUTEX_ENTER(&conn->conn_data_lock);
3500 tnp = rxi_SendConnectionAbort(conn, np, 1, 0);
3501 putConnection(conn);
3502 MUTEX_EXIT(&conn->conn_data_lock);
3507 if (type == RX_SERVER_CONNECTION)
3508 call = rxi_ReceiveServerCall(socket, np, conn);
3510 call = rxi_ReceiveClientCall(np, conn);
3513 putConnection(conn);
3517 MUTEX_ASSERT(&call->lock);
3518 /* Set remote user defined status from packet */
3519 call->remoteStatus = np->header.userStatus;
3521 /* Now do packet type-specific processing */
3522 switch (np->header.type) {
3523 case RX_PACKET_TYPE_DATA:
3524 /* If we're a client, and receiving a response, then all the packets
3525 * we transmitted packets are implicitly acknowledged. */
3526 if (type == RX_CLIENT_CONNECTION && !opr_queue_IsEmpty(&call->tq))
3527 rxi_AckAllInTransmitQueue(call);
3529 np = rxi_ReceiveDataPacket(call, np, 1, socket, host, port, tnop,
3532 case RX_PACKET_TYPE_ACK:
3533 /* Respond immediately to ack packets requesting acknowledgement
3535 if (np->header.flags & RX_REQUEST_ACK) {
3537 (void)rxi_SendCallAbort(call, 0, 1, 0);
3539 (void)rxi_SendAck(call, 0, np->header.serial,
3540 RX_ACK_PING_RESPONSE, 1);
3542 np = rxi_ReceiveAckPacket(call, np, 1);
3544 case RX_PACKET_TYPE_ABORT: {
3545 /* An abort packet: reset the call, passing the error up to the user. */
3546 /* What if error is zero? */
3547 /* What if the error is -1? the application will treat it as a timeout. */
3548 afs_int32 errdata = ntohl(*(afs_int32 *) rx_DataOf(np));
3549 dpf(("rxi_ReceivePacket ABORT rx_DataOf = %d\n", errdata));
3550 rxi_CallError(call, errdata);
3551 MUTEX_EXIT(&call->lock);
3552 putConnection(conn);
3553 return np; /* xmitting; drop packet */
3555 case RX_PACKET_TYPE_BUSY:
3556 /* Mostly ignore BUSY packets. We will update lastReceiveTime below,
3557 * so we don't think the endpoint is completely dead, but otherwise
3558 * just act as if we never saw anything. If all we get are BUSY packets
3559 * back, then we will eventually error out with RX_CALL_TIMEOUT if the
3560 * connection is configured with idle/hard timeouts. */
3563 case RX_PACKET_TYPE_ACKALL:
3564 /* All packets acknowledged, so we can drop all packets previously
3565 * readied for sending */
3566 rxi_AckAllInTransmitQueue(call);
3569 /* Should not reach here, unless the peer is broken: send an abort
3571 rxi_CallError(call, RX_PROTOCOL_ERROR);
3572 np = rxi_SendCallAbort(call, np, 1, 0);
3575 /* Note when this last legitimate packet was received, for keep-alive
3576 * processing. Note, we delay getting the time until now in the hope that
3577 * the packet will be delivered to the user before any get time is required
3578 * (if not, then the time won't actually be re-evaluated here). */
3579 call->lastReceiveTime = clock_Sec();
3580 MUTEX_EXIT(&call->lock);
3581 putConnection(conn);
3585 /* return true if this is an "interesting" connection from the point of view
3586 of someone trying to debug the system */
3588 rxi_IsConnInteresting(struct rx_connection *aconn)
3591 struct rx_call *tcall;
3593 if (aconn->flags & (RX_CONN_MAKECALL_WAITING | RX_CONN_DESTROY_ME))
3596 for (i = 0; i < RX_MAXCALLS; i++) {
3597 tcall = aconn->call[i];
3599 if ((tcall->state == RX_STATE_PRECALL)
3600 || (tcall->state == RX_STATE_ACTIVE))
3602 if ((tcall->app.mode == RX_MODE_SENDING)
3603 || (tcall->app.mode == RX_MODE_RECEIVING))
3611 /* if this is one of the last few packets AND it wouldn't be used by the
3612 receiving call to immediately satisfy a read request, then drop it on
3613 the floor, since accepting it might prevent a lock-holding thread from
3614 making progress in its reading. If a call has been cleared while in
3615 the precall state then ignore all subsequent packets until the call
3616 is assigned to a thread. */
3619 TooLow(struct rx_packet *ap, struct rx_call *acall)
3623 MUTEX_ENTER(&rx_quota_mutex);
3624 if (((ap->header.seq != 1) && (acall->flags & RX_CALL_CLEARED)
3625 && (acall->state == RX_STATE_PRECALL))
3626 || ((rx_nFreePackets < rxi_dataQuota + 2)
3627 && !((ap->header.seq < acall->rnext + rx_initSendWindow)
3628 && (acall->flags & RX_CALL_READER_WAIT)))) {
3631 MUTEX_EXIT(&rx_quota_mutex);
3637 * Clear the attach wait flag on a connection and proceed.
3639 * Any processing waiting for a connection to be attached should be
3640 * unblocked. We clear the flag and do any other needed tasks.
3643 * the conn to unmark waiting for attach
3645 * @pre conn's conn_data_lock must be locked before calling this function
3649 rxi_ConnClearAttachWait(struct rx_connection *conn)
3651 /* Indicate that rxi_CheckReachEvent is no longer running by
3652 * clearing the flag. Must be atomic under conn_data_lock to
3653 * avoid a new call slipping by: rxi_CheckConnReach holds
3654 * conn_data_lock while checking RX_CONN_ATTACHWAIT.
3656 conn->flags &= ~RX_CONN_ATTACHWAIT;
3657 if (conn->flags & RX_CONN_NAT_PING) {
3658 conn->flags &= ~RX_CONN_NAT_PING;
3659 rxi_ScheduleNatKeepAliveEvent(conn);
3664 rxi_CheckReachEvent(struct rxevent *event, void *arg1, void *arg2, int dummy)
3666 struct rx_connection *conn = arg1;
3667 struct rx_call *acall = arg2;
3668 struct rx_call *call = acall;
3669 struct clock when, now;
3672 MUTEX_ENTER(&conn->conn_data_lock);
3675 rxevent_Put(&conn->checkReachEvent);
3677 waiting = conn->flags & RX_CONN_ATTACHWAIT;
3679 putConnection(conn);
3681 MUTEX_EXIT(&conn->conn_data_lock);
3685 MUTEX_ENTER(&conn->conn_call_lock);
3686 MUTEX_ENTER(&conn->conn_data_lock);
3687 for (i = 0; i < RX_MAXCALLS; i++) {
3688 struct rx_call *tc = conn->call[i];
3689 if (tc && tc->state == RX_STATE_PRECALL) {
3695 rxi_ConnClearAttachWait(conn);
3696 MUTEX_EXIT(&conn->conn_data_lock);
3697 MUTEX_EXIT(&conn->conn_call_lock);
3702 MUTEX_ENTER(&call->lock);
3703 rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
3705 MUTEX_EXIT(&call->lock);
3707 clock_GetTime(&now);
3709 when.sec += RX_CHECKREACH_TIMEOUT;
3710 MUTEX_ENTER(&conn->conn_data_lock);
3711 if (!conn->checkReachEvent) {
3712 MUTEX_ENTER(&rx_refcnt_mutex);
3714 MUTEX_EXIT(&rx_refcnt_mutex);
3715 conn->checkReachEvent = rxevent_Post(&when, &now,
3716 rxi_CheckReachEvent, conn,
3719 MUTEX_EXIT(&conn->conn_data_lock);
3725 rxi_CheckConnReach(struct rx_connection *conn, struct rx_call *call)
3727 struct rx_service *service = conn->service;
3728 struct rx_peer *peer = conn->peer;
3729 afs_uint32 now, lastReach;
3731 if (service->checkReach == 0)
3735 MUTEX_ENTER(&peer->peer_lock);
3736 lastReach = peer->lastReachTime;
3737 MUTEX_EXIT(&peer->peer_lock);
3738 if (now - lastReach < RX_CHECKREACH_TTL)
3741 MUTEX_ENTER(&conn->conn_data_lock);
3742 if (conn->flags & RX_CONN_ATTACHWAIT) {
3743 MUTEX_EXIT(&conn->conn_data_lock);
3746 conn->flags |= RX_CONN_ATTACHWAIT;
3747 MUTEX_EXIT(&conn->conn_data_lock);
3748 if (!conn->checkReachEvent)
3749 rxi_CheckReachEvent(NULL, conn, call, 0);
3754 /* try to attach call, if authentication is complete */
3756 TryAttach(struct rx_call *acall, osi_socket socket,
3757 int *tnop, struct rx_call **newcallp,
3760 struct rx_connection *conn = acall->conn;
3762 if (conn->type == RX_SERVER_CONNECTION
3763 && acall->state == RX_STATE_PRECALL) {
3764 /* Don't attach until we have any req'd. authentication. */
3765 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0) {
3766 if (reachOverride || rxi_CheckConnReach(conn, acall) == 0)
3767 rxi_AttachServerProc(acall, socket, tnop, newcallp);
3768 /* Note: this does not necessarily succeed; there
3769 * may not any proc available
3772 rxi_ChallengeOn(acall->conn);
3777 /* A data packet has been received off the interface. This packet is
3778 * appropriate to the call (the call is in the right state, etc.). This
3779 * routine can return a packet to the caller, for re-use */
3781 static struct rx_packet *
3782 rxi_ReceiveDataPacket(struct rx_call *call,
3783 struct rx_packet *np, int istack,
3784 osi_socket socket, afs_uint32 host, u_short port,
3785 int *tnop, struct rx_call **newcallp)
3787 int ackNeeded = 0; /* 0 means no, otherwise ack_reason */
3792 afs_uint32 serial=0, flags=0;
3794 struct rx_packet *tnp;
3795 if (rx_stats_active)
3796 rx_atomic_inc(&rx_stats.dataPacketsRead);
3799 /* If there are no packet buffers, drop this new packet, unless we can find
3800 * packet buffers from inactive calls */
3802 && (rxi_OverQuota(RX_PACKET_CLASS_RECEIVE) || TooLow(np, call))) {
3803 MUTEX_ENTER(&rx_freePktQ_lock);
3804 rxi_NeedMorePackets = TRUE;
3805 MUTEX_EXIT(&rx_freePktQ_lock);
3806 if (rx_stats_active)
3807 rx_atomic_inc(&rx_stats.noPacketBuffersOnRead);
3808 rxi_calltrace(RX_TRACE_DROP, call);
3809 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - quota problems\n", np));
3810 /* We used to clear the receive queue here, in an attempt to free
3811 * packets. However this is unsafe if the queue has received a
3812 * soft ACK for the final packet */
3813 rxi_PostDelayedAckEvent(call, &rx_softAckDelay);
3819 * New in AFS 3.5, if the RX_JUMBO_PACKET flag is set then this
3820 * packet is one of several packets transmitted as a single
3821 * datagram. Do not send any soft or hard acks until all packets
3822 * in a jumbogram have been processed. Send negative acks right away.
3824 for (isFirst = 1, tnp = NULL; isFirst || tnp; isFirst = 0) {
3825 /* tnp is non-null when there are more packets in the
3826 * current jumbo gram */
3833 seq = np->header.seq;
3834 serial = np->header.serial;
3835 flags = np->header.flags;
3837 /* If the call is in an error state, send an abort message */
3839 return rxi_SendCallAbort(call, np, istack, 0);
3841 /* The RX_JUMBO_PACKET is set in all but the last packet in each
3842 * AFS 3.5 jumbogram. */
3843 if (flags & RX_JUMBO_PACKET) {
3844 tnp = rxi_SplitJumboPacket(np, host, port, isFirst);
3849 if (np->header.spare != 0) {
3850 MUTEX_ENTER(&call->conn->conn_data_lock);
3851 call->conn->flags |= RX_CONN_USING_PACKET_CKSUM;
3852 MUTEX_EXIT(&call->conn->conn_data_lock);
3855 /* The usual case is that this is the expected next packet */
3856 if (seq == call->rnext) {
3858 /* Check to make sure it is not a duplicate of one already queued */
3859 if (!opr_queue_IsEmpty(&call->rq)
3860 && opr_queue_First(&call->rq, struct rx_packet, entry)->header.seq == seq) {
3861 if (rx_stats_active)
3862 rx_atomic_inc(&rx_stats.dupPacketsRead);
3863 dpf(("packet %"AFS_PTR_FMT" dropped on receipt - duplicate\n", np));
3864 rxi_CancelDelayedAckEvent(call);
3865 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3871 /* It's the next packet. Stick it on the receive queue
3872 * for this call. Set newPackets to make sure we wake
3873 * the reader once all packets have been processed */
3874 #ifdef RX_TRACK_PACKETS
3875 np->flags |= RX_PKTFLAG_RQ;
3877 opr_queue_Prepend(&call->rq, &np->entry);
3878 #ifdef RXDEBUG_PACKET
3880 #endif /* RXDEBUG_PACKET */
3882 np = NULL; /* We can't use this anymore */
3885 /* If an ack is requested then set a flag to make sure we
3886 * send an acknowledgement for this packet */
3887 if (flags & RX_REQUEST_ACK) {
3888 ackNeeded = RX_ACK_REQUESTED;
3891 /* Keep track of whether we have received the last packet */
3892 if (flags & RX_LAST_PACKET) {
3893 call->flags |= RX_CALL_HAVE_LAST;
3897 /* Check whether we have all of the packets for this call */
3898 if (call->flags & RX_CALL_HAVE_LAST) {
3899 afs_uint32 tseq; /* temporary sequence number */
3900 struct opr_queue *cursor;
3902 for (tseq = seq, opr_queue_Scan(&call->rq, cursor)) {
3903 struct rx_packet *tp;
3905 tp = opr_queue_Entry(cursor, struct rx_packet, entry);
3906 if (tseq != tp->header.seq)
3908 if (tp->header.flags & RX_LAST_PACKET) {
3909 call->flags |= RX_CALL_RECEIVE_DONE;
3916 /* Provide asynchronous notification for those who want it
3917 * (e.g. multi rx) */
3918 if (call->arrivalProc) {
3919 (*call->arrivalProc) (call, call->arrivalProcHandle,
3920 call->arrivalProcArg);
3921 call->arrivalProc = (void (*)())0;
3924 /* Update last packet received */
3927 /* If there is no server process serving this call, grab
3928 * one, if available. We only need to do this once. If a
3929 * server thread is available, this thread becomes a server
3930 * thread and the server thread becomes a listener thread. */
3932 TryAttach(call, socket, tnop, newcallp, 0);
3935 /* This is not the expected next packet. */
3937 /* Determine whether this is a new or old packet, and if it's
3938 * a new one, whether it fits into the current receive window.
3939 * Also figure out whether the packet was delivered in sequence.
3940 * We use the prev variable to determine whether the new packet
3941 * is the successor of its immediate predecessor in the
3942 * receive queue, and the missing flag to determine whether
3943 * any of this packets predecessors are missing. */
3945 afs_uint32 prev; /* "Previous packet" sequence number */
3946 struct opr_queue *cursor;
3947 int missing; /* Are any predecessors missing? */
3949 /* If the new packet's sequence number has been sent to the
3950 * application already, then this is a duplicate */
3951 if (seq < call->rnext) {
3952 if (rx_stats_active)
3953 rx_atomic_inc(&rx_stats.dupPacketsRead);
3954 rxi_CancelDelayedAckEvent(call);
3955 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE, istack);
3961 /* If the sequence number is greater than what can be
3962 * accomodated by the current window, then send a negative
3963 * acknowledge and drop the packet */
3964 if ((call->rnext + call->rwind) <= seq) {
3965 rxi_CancelDelayedAckEvent(call);
3966 np = rxi_SendAck(call, np, serial, RX_ACK_EXCEEDS_WINDOW,
3973 /* Look for the packet in the queue of old received packets */
3974 prev = call->rnext - 1;
3976 for (opr_queue_Scan(&call->rq, cursor)) {
3977 struct rx_packet *tp
3978 = opr_queue_Entry(cursor, struct rx_packet, entry);
3980 /*Check for duplicate packet */
3981 if (seq == tp->header.seq) {
3982 if (rx_stats_active)
3983 rx_atomic_inc(&rx_stats.dupPacketsRead);
3984 rxi_CancelDelayedAckEvent(call);
3985 np = rxi_SendAck(call, np, serial, RX_ACK_DUPLICATE,
3991 /* If we find a higher sequence packet, break out and
3992 * insert the new packet here. */
3993 if (seq < tp->header.seq)
3995 /* Check for missing packet */
3996 if (tp->header.seq != prev + 1) {
4000 prev = tp->header.seq;
4003 /* Keep track of whether we have received the last packet. */
4004 if (flags & RX_LAST_PACKET) {
4005 call->flags |= RX_CALL_HAVE_LAST;
4008 /* It's within the window: add it to the the receive queue.
4009 * tp is left by the previous loop either pointing at the
4010 * packet before which to insert the new packet, or at the
4011 * queue head if the queue is empty or the packet should be
4013 #ifdef RX_TRACK_PACKETS
4014 np->flags |= RX_PKTFLAG_RQ;
4016 #ifdef RXDEBUG_PACKET
4018 #endif /* RXDEBUG_PACKET */
4019 opr_queue_InsertBefore(cursor, &np->entry);
4023 /* Check whether we have all of the packets for this call */
4024 if ((call->flags & RX_CALL_HAVE_LAST)
4025 && !(call->flags & RX_CALL_RECEIVE_DONE)) {
4026 afs_uint32 tseq; /* temporary sequence number */
4029 for (opr_queue_Scan(&call->rq, cursor)) {
4030 struct rx_packet *tp
4031 = opr_queue_Entry(cursor, struct rx_packet, entry);
4032 if (tseq != tp->header.seq)
4034 if (tp->header.flags & RX_LAST_PACKET) {
4035 call->flags |= RX_CALL_RECEIVE_DONE;
4042 /* We need to send an ack of the packet is out of sequence,
4043 * or if an ack was requested by the peer. */
4044 if (seq != prev + 1 || missing) {
4045 ackNeeded = RX_ACK_OUT_OF_SEQUENCE;
4046 } else if (flags & RX_REQUEST_ACK) {
4047 ackNeeded = RX_ACK_REQUESTED;
4050 /* Acknowledge the last packet for each call */
4051 if (flags & RX_LAST_PACKET) {
4062 * If the receiver is waiting for an iovec, fill the iovec
4063 * using the data from the receive queue */
4064 if (call->flags & RX_CALL_IOVEC_WAIT) {
4065 didHardAck = rxi_FillReadVec(call, serial);
4066 /* the call may have been aborted */
4075 /* Wakeup the reader if any */
4076 if ((call->flags & RX_CALL_READER_WAIT)
4077 && (!(call->flags & RX_CALL_IOVEC_WAIT) || !(call->iovNBytes)
4078 || (call->iovNext >= call->iovMax)
4079 || (call->flags & RX_CALL_RECEIVE_DONE))) {
4080 call->flags &= ~RX_CALL_READER_WAIT;
4081 #ifdef RX_ENABLE_LOCKS
4082 CV_BROADCAST(&call->cv_rq);
4084 osi_rxWakeup(&call->rq);
4090 * Send an ack when requested by the peer, or once every
4091 * rxi_SoftAckRate packets until the last packet has been
4092 * received. Always send a soft ack for the last packet in
4093 * the server's reply. */
4095 rxi_CancelDelayedAckEvent(call);
4096 np = rxi_SendAck(call, np, serial, ackNeeded, istack);
4097 } else if (call->nSoftAcks > (u_short) rxi_SoftAckRate) {
4098 rxi_CancelDelayedAckEvent(call);
4099 np = rxi_SendAck(call, np, serial, RX_ACK_IDLE, istack);
4100 } else if (call->nSoftAcks) {
4101 if (haveLast && !(flags & RX_CLIENT_INITIATED))
4102 rxi_PostDelayedAckEvent(call, &rx_lastAckDelay);
4104 rxi_PostDelayedAckEvent(call, &rx_softAckDelay);
4105 } else if (call->flags & RX_CALL_RECEIVE_DONE) {
4106 rxi_CancelDelayedAckEvent(call);
4113 rxi_UpdatePeerReach(struct rx_connection *conn, struct rx_call *acall)
4115 struct rx_peer *peer = conn->peer;
4117 MUTEX_ENTER(&peer->peer_lock);
4118 peer->lastReachTime = clock_Sec();
4119 MUTEX_EXIT(&peer->peer_lock);
4121 MUTEX_ENTER(&conn->conn_data_lock);
4122 if (conn->flags & RX_CONN_ATTACHWAIT) {
4125 rxi_ConnClearAttachWait(conn);
4126 MUTEX_EXIT(&conn->conn_data_lock);
4128 for (i = 0; i < RX_MAXCALLS; i++) {
4129 struct rx_call *call = conn->call[i];
4132 MUTEX_ENTER(&call->lock);
4133 /* tnop can be null if newcallp is null */
4134 TryAttach(call, (osi_socket) - 1, NULL, NULL, 1);
4136 MUTEX_EXIT(&call->lock);
4140 MUTEX_EXIT(&conn->conn_data_lock);
4143 #if defined(RXDEBUG) && defined(AFS_NT40_ENV)
4145 rx_ack_reason(int reason)
4148 case RX_ACK_REQUESTED:
4150 case RX_ACK_DUPLICATE:
4152 case RX_ACK_OUT_OF_SEQUENCE:
4154 case RX_ACK_EXCEEDS_WINDOW:
4156 case RX_ACK_NOSPACE:
4160 case RX_ACK_PING_RESPONSE:
4173 /* The real smarts of the whole thing. */
4174 static struct rx_packet *
4175 rxi_ReceiveAckPacket(struct rx_call *call, struct rx_packet *np,
4178 struct rx_ackPacket *ap;
4180 struct rx_packet *tp;
4181 struct rx_connection *conn = call->conn;
4182 struct rx_peer *peer = conn->peer;
4183 struct opr_queue *cursor;
4184 struct clock now; /* Current time, for RTT calculations */
4192 int newAckCount = 0;
4193 int maxDgramPackets = 0; /* Set if peer supports AFS 3.5 jumbo datagrams */
4194 int pktsize = 0; /* Set if we need to update the peer mtu */
4195 int conn_data_locked = 0;
4197 if (rx_stats_active)
4198 rx_atomic_inc(&rx_stats.ackPacketsRead);
4199 ap = (struct rx_ackPacket *)rx_DataOf(np);
4200 nbytes = rx_Contiguous(np) - (int)((ap->acks) - (u_char *) ap);
4202 return np; /* truncated ack packet */
4204 /* depends on ack packet struct */
4205 nAcks = MIN((unsigned)nbytes, (unsigned)ap->nAcks);
4206 first = ntohl(ap->firstPacket);
4207 prev = ntohl(ap->previousPacket);
4208 serial = ntohl(ap->serial);
4211 * Ignore ack packets received out of order while protecting
4212 * against peers that set the previousPacket field to a packet
4213 * serial number instead of a sequence number.
4215 if (first < call->tfirst ||
4216 (first == call->tfirst && prev < call->tprev && prev < call->tfirst
4223 if (np->header.flags & RX_SLOW_START_OK) {
4224 call->flags |= RX_CALL_SLOW_START_OK;
4227 if (ap->reason == RX_ACK_PING_RESPONSE)
4228 rxi_UpdatePeerReach(conn, call);
4230 if (conn->lastPacketSizeSeq) {
4231 MUTEX_ENTER(&conn->conn_data_lock);
4232 conn_data_locked = 1;
4233 if ((first > conn->lastPacketSizeSeq) && (conn->lastPacketSize)) {
4234 pktsize = conn->lastPacketSize;
4235 conn->lastPacketSize = conn->lastPacketSizeSeq = 0;
4238 if ((ap->reason == RX_ACK_PING_RESPONSE) && (conn->lastPingSizeSer)) {
4239 if (!conn_data_locked) {
4240 MUTEX_ENTER(&conn->conn_data_lock);
4241 conn_data_locked = 1;
4243 if ((conn->lastPingSizeSer == serial) && (conn->lastPingSize)) {
4244 /* process mtu ping ack */
4245 pktsize = conn->lastPingSize;
4246 conn->lastPingSizeSer = conn->lastPingSize = 0;
4250 if (conn_data_locked) {
4251 MUTEX_EXIT(&conn->conn_data_lock);
4252 conn_data_locked = 0;
4256 if (rxdebug_active) {
4260 len = _snprintf(msg, sizeof(msg),
4261 "tid[%d] RACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
4262 GetCurrentThreadId(), rx_ack_reason(ap->reason),
4263 ntohl(ap->serial), ntohl(ap->previousPacket),
4264 (unsigned int)np->header.seq, ntohl(ap->firstPacket),
4265 ap->nAcks, ntohs(ap->bufferSpace) );
4269 for (offset = 0; offset < nAcks && len < sizeof(msg); offset++)
4270 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
4274 OutputDebugString(msg);
4276 #else /* AFS_NT40_ENV */
4279 "RACK: reason %x previous %u seq %u serial %u first %u",
4280 ap->reason, ntohl(ap->previousPacket),
4281 (unsigned int)np->header.seq, (unsigned int)serial,
4282 ntohl(ap->firstPacket));
4285 for (offset = 0; offset < nAcks; offset++)
4286 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
4291 #endif /* AFS_NT40_ENV */
4294 MUTEX_ENTER(&peer->peer_lock);
4297 * Start somewhere. Can't assume we can send what we can receive,
4298 * but we are clearly receiving.
4300 if (!peer->maxPacketSize)
4301 peer->maxPacketSize = RX_MIN_PACKET_SIZE - RX_HEADER_SIZE;
4303 if (pktsize > peer->maxPacketSize) {
4304 peer->maxPacketSize = pktsize;
4305 if ((pktsize + RX_HEADER_SIZE > peer->ifMTU)) {
4306 peer->ifMTU = pktsize + RX_HEADER_SIZE;
4307 peer->natMTU = rxi_AdjustIfMTU(peer->ifMTU);
4308 rxi_ScheduleGrowMTUEvent(call, 1);
4313 clock_GetTime(&now);
4315 /* The transmit queue splits into 4 sections.
4317 * The first section is packets which have now been acknowledged
4318 * by a window size change in the ack. These have reached the
4319 * application layer, and may be discarded. These are packets
4320 * with sequence numbers < ap->firstPacket.
4322 * The second section is packets which have sequence numbers in
4323 * the range ap->firstPacket to ap->firstPacket + ap->nAcks. The
4324 * contents of the packet's ack array determines whether these
4325 * packets are acknowledged or not.
4327 * The third section is packets which fall above the range
4328 * addressed in the ack packet. These have not yet been received
4331 * The four section is packets which have not yet been transmitted.
4332 * These packets will have a header.serial of 0.
4335 /* First section - implicitly acknowledged packets that can be
4339 tp = opr_queue_First(&call->tq, struct rx_packet, entry);
4340 while(!opr_queue_IsEnd(&call->tq, &tp->entry) && tp->header.seq < first) {
4341 struct rx_packet *next;
4343 next = opr_queue_Next(&tp->entry, struct rx_packet, entry);
4344 call->tfirst = tp->header.seq + 1;
4346 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4348 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4351 #ifdef RX_ENABLE_LOCKS
4352 /* XXX Hack. Because we have to release the global call lock when sending
4353 * packets (osi_NetSend) we drop all acks while we're traversing the tq
4354 * in rxi_Start sending packets out because packets may move to the
4355 * freePacketQueue as result of being here! So we drop these packets until
4356 * we're safely out of the traversing. Really ugly!
4357 * To make it even uglier, if we're using fine grain locking, we can
4358 * set the ack bits in the packets and have rxi_Start remove the packets
4359 * when it's done transmitting.
4361 if (call->flags & RX_CALL_TQ_BUSY) {
4362 tp->flags |= RX_PKTFLAG_ACKED;
4363 call->flags |= RX_CALL_TQ_SOME_ACKED;
4365 #endif /* RX_ENABLE_LOCKS */
4367 opr_queue_Remove(&tp->entry);
4368 #ifdef RX_TRACK_PACKETS
4369 tp->flags &= ~RX_PKTFLAG_TQ;
4371 #ifdef RXDEBUG_PACKET
4373 #endif /* RXDEBUG_PACKET */
4374 rxi_FreePacket(tp); /* rxi_FreePacket mustn't wake up anyone, preemptively. */
4379 /* N.B. we don't turn off any timers here. They'll go away by themselves, anyway */
4381 /* Second section of the queue - packets for which we are receiving
4384 * Go through the explicit acks/nacks and record the results in
4385 * the waiting packets. These are packets that can't be released
4386 * yet, even with a positive acknowledge. This positive
4387 * acknowledge only means the packet has been received by the
4388 * peer, not that it will be retained long enough to be sent to
4389 * the peer's upper level. In addition, reset the transmit timers
4390 * of any missing packets (those packets that must be missing
4391 * because this packet was out of sequence) */
4393 call->nSoftAcked = 0;
4395 while (!opr_queue_IsEnd(&call->tq, &tp->entry)
4396 && tp->header.seq < first + nAcks) {
4397 /* Set the acknowledge flag per packet based on the
4398 * information in the ack packet. An acknowlegded packet can
4399 * be downgraded when the server has discarded a packet it
4400 * soacked previously, or when an ack packet is received
4401 * out of sequence. */
4402 if (ap->acks[tp->header.seq - first] == RX_ACK_TYPE_ACK) {
4403 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4405 tp->flags |= RX_PKTFLAG_ACKED;
4406 rxi_ComputeRoundTripTime(tp, ap, call, peer, &now);
4413 } else /* RX_ACK_TYPE_NACK */ {
4414 tp->flags &= ~RX_PKTFLAG_ACKED;
4418 tp = opr_queue_Next(&tp->entry, struct rx_packet, entry);
4421 /* We don't need to take any action with the 3rd or 4th section in the
4422 * queue - they're not addressed by the contents of this ACK packet.
4425 /* If the window has been extended by this acknowledge packet,
4426 * then wakeup a sender waiting in alloc for window space, or try
4427 * sending packets now, if he's been sitting on packets due to
4428 * lack of window space */
4429 if (call->tnext < (call->tfirst + call->twind)) {
4430 #ifdef RX_ENABLE_LOCKS
4431 CV_SIGNAL(&call->cv_twind);
4433 if (call->flags & RX_CALL_WAIT_WINDOW_ALLOC) {
4434 call->flags &= ~RX_CALL_WAIT_WINDOW_ALLOC;
4435 osi_rxWakeup(&call->twind);
4438 if (call->flags & RX_CALL_WAIT_WINDOW_SEND) {
4439 call->flags &= ~RX_CALL_WAIT_WINDOW_SEND;
4443 /* if the ack packet has a receivelen field hanging off it,
4444 * update our state */
4445 if (np->length >= rx_AckDataSize(ap->nAcks) + 2 * sizeof(afs_int32)) {
4448 /* If the ack packet has a "recommended" size that is less than
4449 * what I am using now, reduce my size to match */
4450 rx_packetread(np, rx_AckDataSize(ap->nAcks) + (int)sizeof(afs_int32),
4451 (int)sizeof(afs_int32), &tSize);
4452 tSize = (afs_uint32) ntohl(tSize);
4453 peer->natMTU = rxi_AdjustIfMTU(MIN(tSize, peer->ifMTU));
4455 /* Get the maximum packet size to send to this peer */
4456 rx_packetread(np, rx_AckDataSize(ap->nAcks), (int)sizeof(afs_int32),
4458 tSize = (afs_uint32) ntohl(tSize);
4459 tSize = (afs_uint32) MIN(tSize, rx_MyMaxSendSize);
4460 tSize = rxi_AdjustMaxMTU(peer->natMTU, tSize);
4462 /* sanity check - peer might have restarted with different params.
4463 * If peer says "send less", dammit, send less... Peer should never
4464 * be unable to accept packets of the size that prior AFS versions would
4465 * send without asking. */
4466 if (peer->maxMTU != tSize) {
4467 if (peer->maxMTU > tSize) /* possible cong., maxMTU decreased */
4469 peer->maxMTU = tSize;
4470 peer->MTU = MIN(tSize, peer->MTU);
4471 call->MTU = MIN(call->MTU, tSize);
4474 if (np->length == rx_AckDataSize(ap->nAcks) + 3 * sizeof(afs_int32)) {
4477 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4478 (int)sizeof(afs_int32), &tSize);
4479 tSize = (afs_uint32) ntohl(tSize); /* peer's receive window, if it's */
4480 if (tSize < call->twind) { /* smaller than our send */
4481 call->twind = tSize; /* window, we must send less... */
4482 call->ssthresh = MIN(call->twind, call->ssthresh);
4483 call->conn->twind[call->channel] = call->twind;
4486 /* Only send jumbograms to 3.4a fileservers. 3.3a RX gets the
4487 * network MTU confused with the loopback MTU. Calculate the
4488 * maximum MTU here for use in the slow start code below.
4490 /* Did peer restart with older RX version? */
4491 if (peer->maxDgramPackets > 1) {
4492 peer->maxDgramPackets = 1;
4494 } else if (np->length >=
4495 rx_AckDataSize(ap->nAcks) + 4 * sizeof(afs_int32)) {
4498 rx_AckDataSize(ap->nAcks) + 2 * (int)sizeof(afs_int32),
4499 sizeof(afs_int32), &tSize);
4500 tSize = (afs_uint32) ntohl(tSize);
4502 * As of AFS 3.5 we set the send window to match the receive window.
4504 if (tSize < call->twind) {
4505 call->twind = tSize;
4506 call->conn->twind[call->channel] = call->twind;
4507 call->ssthresh = MIN(call->twind, call->ssthresh);
4508 } else if (tSize > call->twind) {
4509 call->twind = tSize;
4510 call->conn->twind[call->channel] = call->twind;
4514 * As of AFS 3.5, a jumbogram is more than one fixed size
4515 * packet transmitted in a single UDP datagram. If the remote
4516 * MTU is smaller than our local MTU then never send a datagram
4517 * larger than the natural MTU.
4520 rx_AckDataSize(ap->nAcks) + 3 * (int)sizeof(afs_int32),
4521 (int)sizeof(afs_int32), &tSize);
4522 maxDgramPackets = (afs_uint32) ntohl(tSize);
4523 maxDgramPackets = MIN(maxDgramPackets, rxi_nDgramPackets);
4525 MIN(maxDgramPackets, (int)(peer->ifDgramPackets));
4526 if (maxDgramPackets > 1) {
4527 peer->maxDgramPackets = maxDgramPackets;
4528 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
4530 peer->maxDgramPackets = 1;
4531 call->MTU = peer->natMTU;
4533 } else if (peer->maxDgramPackets > 1) {
4534 /* Restarted with lower version of RX */
4535 peer->maxDgramPackets = 1;
4537 } else if (peer->maxDgramPackets > 1
4538 || peer->maxMTU != OLD_MAX_PACKET_SIZE) {
4539 /* Restarted with lower version of RX */
4540 peer->maxMTU = OLD_MAX_PACKET_SIZE;
4541 peer->natMTU = OLD_MAX_PACKET_SIZE;
4542 peer->MTU = OLD_MAX_PACKET_SIZE;
4543 peer->maxDgramPackets = 1;
4544 peer->nDgramPackets = 1;
4546 call->MTU = OLD_MAX_PACKET_SIZE;
4551 * Calculate how many datagrams were successfully received after
4552 * the first missing packet and adjust the negative ack counter
4557 nNacked = (nNacked + call->nDgramPackets - 1) / call->nDgramPackets;
4558 if (call->nNacks < nNacked) {
4559 call->nNacks = nNacked;
4562 call->nAcks += newAckCount;
4566 /* If the packet contained new acknowledgements, rather than just
4567 * being a duplicate of one we have previously seen, then we can restart
4570 if (newAckCount > 0)
4571 rxi_rto_packet_acked(call, istack);
4573 if (call->flags & RX_CALL_FAST_RECOVER) {
4574 if (newAckCount == 0) {
4575 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4577 call->flags &= ~RX_CALL_FAST_RECOVER;
4578 call->cwind = call->nextCwind;
4579 call->nextCwind = 0;
4582 call->nCwindAcks = 0;
4583 } else if (nNacked && call->nNacks >= (u_short) rx_nackThreshold) {
4584 /* Three negative acks in a row trigger congestion recovery */
4585 call->flags |= RX_CALL_FAST_RECOVER;
4586 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
4588 MIN((int)(call->ssthresh + rx_nackThreshold), rx_maxSendWindow);
4589 call->nDgramPackets = MAX(2, (int)call->nDgramPackets) >> 1;
4590 call->nextCwind = call->ssthresh;
4593 peer->MTU = call->MTU;
4594 peer->cwind = call->nextCwind;
4595 peer->nDgramPackets = call->nDgramPackets;
4597 call->congestSeq = peer->congestSeq;
4599 /* Reset the resend times on the packets that were nacked
4600 * so we will retransmit as soon as the window permits
4604 for (opr_queue_ScanBackwards(&call->tq, cursor)) {
4605 struct rx_packet *tp =
4606 opr_queue_Entry(cursor, struct rx_packet, entry);
4608 if (!(tp->flags & RX_PKTFLAG_ACKED)) {
4609 tp->flags &= ~RX_PKTFLAG_SENT;
4611 } else if (tp->flags & RX_PKTFLAG_ACKED) {
4616 /* If cwind is smaller than ssthresh, then increase
4617 * the window one packet for each ack we receive (exponential
4619 * If cwind is greater than or equal to ssthresh then increase
4620 * the congestion window by one packet for each cwind acks we
4621 * receive (linear growth). */
4622 if (call->cwind < call->ssthresh) {
4624 MIN((int)call->ssthresh, (int)(call->cwind + newAckCount));
4625 call->nCwindAcks = 0;
4627 call->nCwindAcks += newAckCount;
4628 if (call->nCwindAcks >= call->cwind) {
4629 call->nCwindAcks = 0;
4630 call->cwind = MIN((int)(call->cwind + 1), rx_maxSendWindow);
4634 * If we have received several acknowledgements in a row then
4635 * it is time to increase the size of our datagrams
4637 if ((int)call->nAcks > rx_nDgramThreshold) {
4638 if (peer->maxDgramPackets > 1) {
4639 if (call->nDgramPackets < peer->maxDgramPackets) {
4640 call->nDgramPackets++;
4642 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
4643 } else if (call->MTU < peer->maxMTU) {
4644 /* don't upgrade if we can't handle it */
4645 if ((call->nDgramPackets == 1) && (call->MTU >= peer->ifMTU))
4646 call->MTU = peer->ifMTU;
4648 call->MTU += peer->natMTU;
4649 call->MTU = MIN(call->MTU, peer->maxMTU);
4656 MUTEX_EXIT(&peer->peer_lock); /* rxi_Start will lock peer. */
4658 /* Servers need to hold the call until all response packets have
4659 * been acknowledged. Soft acks are good enough since clients
4660 * are not allowed to clear their receive queues. */
4661 if (call->state == RX_STATE_HOLD
4662 && call->tfirst + call->nSoftAcked >= call->tnext) {
4663 call->state = RX_STATE_DALLY;
4664 rxi_ClearTransmitQueue(call, 0);
4665 rxi_CancelKeepAliveEvent(call);
4666 } else if (!opr_queue_IsEmpty(&call->tq)) {
4667 rxi_Start(call, istack);
4673 * Schedule a connection abort to be sent after some delay.
4675 * @param[in] conn The connection to send the abort on.
4676 * @param[in] msec The number of milliseconds to wait before sending.
4678 * @pre conn_data_lock must be held
4681 rxi_SendConnectionAbortLater(struct rx_connection *conn, int msec)
4683 struct clock when, now;
4687 if (!conn->delayedAbortEvent) {
4688 clock_GetTime(&now);
4690 clock_Addmsec(&when, msec);
4691 conn->delayedAbortEvent =
4692 rxevent_Post(&when, &now, rxi_SendDelayedConnAbort, conn, NULL, 0);
4696 /* Received a response to a challenge packet */
4697 static struct rx_packet *
4698 rxi_ReceiveResponsePacket(struct rx_connection *conn,
4699 struct rx_packet *np, int istack)
4703 /* Ignore the packet if we're the client */
4704 if (conn->type == RX_CLIENT_CONNECTION)
4707 /* If already authenticated, ignore the packet (it's probably a retry) */
4708 if (RXS_CheckAuthentication(conn->securityObject, conn) == 0)
4711 if (!conn->securityChallengeSent) {
4712 /* We've never sent out a challenge for this connection, so this
4713 * response cannot possibly be correct; ignore it. This can happen
4714 * if we sent a challenge to the client, then we were restarted, and
4715 * then the client sent us a response. If we ignore the response, the
4716 * client will eventually resend a data packet, causing us to send a
4717 * new challenge and the client to send a new response. */
4721 /* Otherwise, have the security object evaluate the response packet */
4722 error = RXS_CheckResponse(conn->securityObject, conn, np);
4724 /* If the response is invalid, reset the connection, sending
4725 * an abort to the peer. Send the abort with a 1 second delay,
4726 * to avoid a peer hammering us by constantly recreating a
4727 * connection with bad credentials. */
4728 rxi_ConnectionError(conn, error);
4729 MUTEX_ENTER(&conn->conn_data_lock);
4730 rxi_SendConnectionAbortLater(conn, 1000);
4731 MUTEX_EXIT(&conn->conn_data_lock);
4734 /* If the response is valid, any calls waiting to attach
4735 * servers can now do so */
4738 for (i = 0; i < RX_MAXCALLS; i++) {
4739 struct rx_call *call = conn->call[i];
4741 MUTEX_ENTER(&call->lock);
4742 if (call->state == RX_STATE_PRECALL)
4743 rxi_AttachServerProc(call, (osi_socket) - 1, NULL, NULL);
4744 /* tnop can be null if newcallp is null */
4745 MUTEX_EXIT(&call->lock);
4749 /* Update the peer reachability information, just in case
4750 * some calls went into attach-wait while we were waiting
4751 * for authentication..
4753 rxi_UpdatePeerReach(conn, NULL);
4758 /* A client has received an authentication challenge: the security
4759 * object is asked to cough up a respectable response packet to send
4760 * back to the server. The server is responsible for retrying the
4761 * challenge if it fails to get a response. */
4763 static struct rx_packet *
4764 rxi_ReceiveChallengePacket(struct rx_connection *conn,
4765 struct rx_packet *np, int istack)
4769 /* Ignore the challenge if we're the server */
4770 if (conn->type == RX_SERVER_CONNECTION)
4773 /* Ignore the challenge if the connection is otherwise idle; someone's
4774 * trying to use us as an oracle. */
4775 if (!rxi_HasActiveCalls(conn))
4778 /* Send the security object the challenge packet. It is expected to fill
4779 * in the response. */
4780 error = RXS_GetResponse(conn->securityObject, conn, np);
4782 /* If the security object is unable to return a valid response, reset the
4783 * connection and send an abort to the peer. Otherwise send the response
4784 * packet to the peer connection. */
4786 rxi_ConnectionError(conn, error);
4787 MUTEX_ENTER(&conn->conn_data_lock);
4788 np = rxi_SendConnectionAbort(conn, np, istack, 0);
4789 MUTEX_EXIT(&conn->conn_data_lock);
4791 np = rxi_SendSpecial((struct rx_call *)0, conn, np,
4792 RX_PACKET_TYPE_RESPONSE, NULL, -1, istack);
4798 /* Find an available server process to service the current request in
4799 * the given call structure. If one isn't available, queue up this
4800 * call so it eventually gets one */
4802 rxi_AttachServerProc(struct rx_call *call,
4803 osi_socket socket, int *tnop,
4804 struct rx_call **newcallp)
4806 struct rx_serverQueueEntry *sq;
4807 struct rx_service *service = call->conn->service;
4810 /* May already be attached */
4811 if (call->state == RX_STATE_ACTIVE)
4814 MUTEX_ENTER(&rx_serverPool_lock);
4816 haveQuota = QuotaOK(service);
4817 if ((!haveQuota) || opr_queue_IsEmpty(&rx_idleServerQueue)) {
4818 /* If there are no processes available to service this call,
4819 * put the call on the incoming call queue (unless it's
4820 * already on the queue).
4822 #ifdef RX_ENABLE_LOCKS
4824 ReturnToServerPool(service);
4825 #endif /* RX_ENABLE_LOCKS */
4827 if (!(call->flags & RX_CALL_WAIT_PROC)) {
4828 call->flags |= RX_CALL_WAIT_PROC;
4829 rx_atomic_inc(&rx_nWaiting);
4830 rx_atomic_inc(&rx_nWaited);
4831 rxi_calltrace(RX_CALL_ARRIVAL, call);
4832 SET_CALL_QUEUE_LOCK(call, &rx_serverPool_lock);
4833 opr_queue_Append(&rx_incomingCallQueue, &call->entry);
4836 sq = opr_queue_Last(&rx_idleServerQueue,
4837 struct rx_serverQueueEntry, entry);
4839 /* If hot threads are enabled, and both newcallp and sq->socketp
4840 * are non-null, then this thread will process the call, and the
4841 * idle server thread will start listening on this threads socket.
4843 opr_queue_Remove(&sq->entry);
4845 if (rx_enable_hot_thread && newcallp && sq->socketp) {
4848 *sq->socketp = socket;
4849 clock_GetTime(&call->startTime);
4850 CALL_HOLD(call, RX_CALL_REFCOUNT_BEGIN);
4854 if (call->flags & RX_CALL_WAIT_PROC) {
4855 /* Conservative: I don't think this should happen */
4856 call->flags &= ~RX_CALL_WAIT_PROC;
4857 rx_atomic_dec(&rx_nWaiting);
4858 if (opr_queue_IsOnQueue(&call->entry)) {
4859 opr_queue_Remove(&call->entry);
4862 call->state = RX_STATE_ACTIVE;
4863 call->app.mode = RX_MODE_RECEIVING;
4864 #ifdef RX_KERNEL_TRACE
4866 int glockOwner = ISAFS_GLOCK();
4869 afs_Trace3(afs_iclSetp, CM_TRACE_WASHERE, ICL_TYPE_STRING,
4870 __FILE__, ICL_TYPE_INT32, __LINE__, ICL_TYPE_POINTER,
4876 if (call->flags & RX_CALL_CLEARED) {
4877 /* send an ack now to start the packet flow up again */
4878 call->flags &= ~RX_CALL_CLEARED;
4879 rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4881 #ifdef RX_ENABLE_LOCKS
4884 service->nRequestsRunning++;
4885 MUTEX_ENTER(&rx_quota_mutex);
4886 if (service->nRequestsRunning <= service->minProcs)
4889 MUTEX_EXIT(&rx_quota_mutex);
4893 MUTEX_EXIT(&rx_serverPool_lock);
4896 /* Delay the sending of an acknowledge event for a short while, while
4897 * a new call is being prepared (in the case of a client) or a reply
4898 * is being prepared (in the case of a server). Rather than sending
4899 * an ack packet, an ACKALL packet is sent. */
4901 rxi_AckAll(struct rx_call *call)
4903 rxi_SendSpecial(call, call->conn, NULL, RX_PACKET_TYPE_ACKALL,
4905 call->flags |= RX_CALL_ACKALL_SENT;
4909 rxi_SendDelayedAck(struct rxevent *event, void *arg1, void *unused1,
4912 struct rx_call *call = arg1;
4913 #ifdef RX_ENABLE_LOCKS
4915 MUTEX_ENTER(&call->lock);
4916 if (event == call->delayedAckEvent)
4917 rxevent_Put(&call->delayedAckEvent);
4918 CALL_RELE(call, RX_CALL_REFCOUNT_DELAY);
4920 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4922 MUTEX_EXIT(&call->lock);
4923 #else /* RX_ENABLE_LOCKS */
4925 rxevent_Put(&call->delayedAckEvent);
4926 (void)rxi_SendAck(call, 0, 0, RX_ACK_DELAY, 0);
4927 #endif /* RX_ENABLE_LOCKS */
4930 #ifdef RX_ENABLE_LOCKS
4931 /* Set ack in all packets in transmit queue. rxi_Start will deal with
4932 * clearing them out.
4935 rxi_SetAcksInTransmitQueue(struct rx_call *call)
4937 struct opr_queue *cursor;
4940 for (opr_queue_Scan(&call->tq, cursor)) {
4942 = opr_queue_Entry(cursor, struct rx_packet, entry);
4944 p->flags |= RX_PKTFLAG_ACKED;
4949 call->flags |= RX_CALL_TQ_CLEARME;
4950 call->flags |= RX_CALL_TQ_SOME_ACKED;
4953 rxi_rto_cancel(call);
4955 call->tfirst = call->tnext;
4956 call->nSoftAcked = 0;
4958 if (call->flags & RX_CALL_FAST_RECOVER) {
4959 call->flags &= ~RX_CALL_FAST_RECOVER;
4960 call->cwind = call->nextCwind;
4961 call->nextCwind = 0;
4964 CV_SIGNAL(&call->cv_twind);
4966 #endif /* RX_ENABLE_LOCKS */
4969 * Acknowledge the whole transmit queue.
4971 * If we're running without locks, or the transmit queue isn't busy, then
4972 * we can just clear the queue now. Otherwise, we have to mark all of the
4973 * packets as acknowledged, and let rxi_Start clear it later on
4976 rxi_AckAllInTransmitQueue(struct rx_call *call)
4978 #ifdef RX_ENABLE_LOCKS
4979 if (call->flags & RX_CALL_TQ_BUSY) {
4980 rxi_SetAcksInTransmitQueue(call);
4984 rxi_ClearTransmitQueue(call, 0);
4986 /* Clear out the transmit queue for the current call (all packets have
4987 * been received by peer) */
4989 rxi_ClearTransmitQueue(struct rx_call *call, int force)
4991 #ifdef RX_ENABLE_LOCKS
4992 struct opr_queue *cursor;
4993 if (!force && (call->flags & RX_CALL_TQ_BUSY)) {
4995 for (opr_queue_Scan(&call->tq, cursor)) {
4997 = opr_queue_Entry(cursor, struct rx_packet, entry);
4999 p->flags |= RX_PKTFLAG_ACKED;
5003 call->flags |= RX_CALL_TQ_CLEARME;
5004 call->flags |= RX_CALL_TQ_SOME_ACKED;
5007 #endif /* RX_ENABLE_LOCKS */
5008 #ifdef RXDEBUG_PACKET
5010 #endif /* RXDEBUG_PACKET */
5011 rxi_FreePackets(0, &call->tq);
5012 rxi_WakeUpTransmitQueue(call);
5013 #ifdef RX_ENABLE_LOCKS
5014 call->flags &= ~RX_CALL_TQ_CLEARME;
5018 rxi_rto_cancel(call);
5019 call->tfirst = call->tnext; /* implicitly acknowledge all data already sent */
5020 call->nSoftAcked = 0;
5022 if (call->flags & RX_CALL_FAST_RECOVER) {
5023 call->flags &= ~RX_CALL_FAST_RECOVER;
5024 call->cwind = call->nextCwind;
5026 #ifdef RX_ENABLE_LOCKS
5027 CV_SIGNAL(&call->cv_twind);
5029 osi_rxWakeup(&call->twind);
5034 rxi_ClearReceiveQueue(struct rx_call *call)
5036 if (!opr_queue_IsEmpty(&call->rq)) {
5039 count = rxi_FreePackets(0, &call->rq);
5040 rx_packetReclaims += count;
5041 #ifdef RXDEBUG_PACKET
5043 if ( call->rqc != 0 )
5044 dpf(("rxi_ClearReceiveQueue call %"AFS_PTR_FMT" rqc %u != 0\n", call, call->rqc));
5046 call->flags &= ~(RX_CALL_RECEIVE_DONE | RX_CALL_HAVE_LAST);
5048 if (call->state == RX_STATE_PRECALL) {
5049 call->flags |= RX_CALL_CLEARED;
5053 /* Send an abort packet for the specified call */
5054 static struct rx_packet *
5055 rxi_SendCallAbort(struct rx_call *call, struct rx_packet *packet,
5056 int istack, int force)
5059 struct clock when, now;
5064 /* Clients should never delay abort messages */
5065 if (rx_IsClientConn(call->conn))
5068 if (call->abortCode != call->error) {
5069 call->abortCode = call->error;
5070 call->abortCount = 0;
5073 if (force || rxi_callAbortThreshhold == 0
5074 || call->abortCount < rxi_callAbortThreshhold) {
5075 rxi_CancelDelayedAbortEvent(call);
5076 error = htonl(call->error);
5079 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
5080 (char *)&error, sizeof(error), istack);
5081 } else if (!call->delayedAbortEvent) {
5082 clock_GetTime(&now);
5084 clock_Addmsec(&when, rxi_callAbortDelay);
5085 CALL_HOLD(call, RX_CALL_REFCOUNT_ABORT);
5086 call->delayedAbortEvent =
5087 rxevent_Post(&when, &now, rxi_SendDelayedCallAbort, call, 0, 0);
5093 rxi_CancelDelayedAbortEvent(struct rx_call *call)
5095 if (call->delayedAbortEvent) {
5096 rxevent_Cancel(&call->delayedAbortEvent);
5097 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
5101 /* Send an abort packet for the specified connection. Packet is an
5102 * optional pointer to a packet that can be used to send the abort.
5103 * Once the number of abort messages reaches the threshhold, an
5104 * event is scheduled to send the abort. Setting the force flag
5105 * overrides sending delayed abort messages.
5107 * NOTE: Called with conn_data_lock held. conn_data_lock is dropped
5108 * to send the abort packet.
5111 rxi_SendConnectionAbort(struct rx_connection *conn,
5112 struct rx_packet *packet, int istack, int force)
5119 /* Clients should never delay abort messages */
5120 if (rx_IsClientConn(conn))
5123 if (force || rxi_connAbortThreshhold == 0
5124 || conn->abortCount < rxi_connAbortThreshhold) {
5126 rxevent_Cancel(&conn->delayedAbortEvent);
5127 error = htonl(conn->error);
5129 MUTEX_EXIT(&conn->conn_data_lock);
5131 rxi_SendSpecial((struct rx_call *)0, conn, packet,
5132 RX_PACKET_TYPE_ABORT, (char *)&error,
5133 sizeof(error), istack);
5134 MUTEX_ENTER(&conn->conn_data_lock);
5136 rxi_SendConnectionAbortLater(conn, rxi_connAbortDelay);
5141 /* Associate an error all of the calls owned by a connection. Called
5142 * with error non-zero. This is only for really fatal things, like
5143 * bad authentication responses. The connection itself is set in
5144 * error at this point, so that future packets received will be
5147 rxi_ConnectionError(struct rx_connection *conn,
5153 dpf(("rxi_ConnectionError conn %"AFS_PTR_FMT" error %d\n", conn, error));
5155 MUTEX_ENTER(&conn->conn_data_lock);
5156 rxevent_Cancel(&conn->challengeEvent);
5157 rxevent_Cancel(&conn->natKeepAliveEvent);
5158 if (conn->checkReachEvent) {
5159 rxevent_Cancel(&conn->checkReachEvent);
5160 conn->flags &= ~(RX_CONN_ATTACHWAIT|RX_CONN_NAT_PING);
5161 putConnection(conn);
5163 MUTEX_EXIT(&conn->conn_data_lock);
5164 for (i = 0; i < RX_MAXCALLS; i++) {
5165 struct rx_call *call = conn->call[i];
5167 MUTEX_ENTER(&call->lock);
5168 rxi_CallError(call, error);
5169 MUTEX_EXIT(&call->lock);
5172 conn->error = error;
5173 if (rx_stats_active)
5174 rx_atomic_inc(&rx_stats.fatalErrors);
5179 * Interrupt an in-progress call with the specified error and wakeup waiters.
5181 * @param[in] call The call to interrupt
5182 * @param[in] error The error code to send to the peer
5185 rx_InterruptCall(struct rx_call *call, afs_int32 error)
5187 MUTEX_ENTER(&call->lock);
5188 rxi_CallError(call, error);
5189 rxi_SendCallAbort(call, NULL, 0, 1);
5190 MUTEX_EXIT(&call->lock);
5194 rxi_CallError(struct rx_call *call, afs_int32 error)
5196 MUTEX_ASSERT(&call->lock);
5197 dpf(("rxi_CallError call %"AFS_PTR_FMT" error %d call->error %d\n", call, error, call->error));
5199 error = call->error;
5201 #ifdef RX_ENABLE_LOCKS
5202 if (!((call->flags & RX_CALL_TQ_BUSY) || (call->tqWaiters > 0))) {
5203 rxi_ResetCall(call, 0);
5206 rxi_ResetCall(call, 0);
5208 call->error = error;
5211 /* Reset various fields in a call structure, and wakeup waiting
5212 * processes. Some fields aren't changed: state & mode are not
5213 * touched (these must be set by the caller), and bufptr, nLeft, and
5214 * nFree are not reset, since these fields are manipulated by
5215 * unprotected macros, and may only be reset by non-interrupting code.
5219 rxi_ResetCall(struct rx_call *call, int newcall)
5222 struct rx_peer *peer;
5223 struct rx_packet *packet;
5225 MUTEX_ASSERT(&call->lock);
5226 dpf(("rxi_ResetCall(call %"AFS_PTR_FMT", newcall %d)\n", call, newcall));
5228 /* Notify anyone who is waiting for asynchronous packet arrival */
5229 if (call->arrivalProc) {
5230 (*call->arrivalProc) (call, call->arrivalProcHandle,
5231 call->arrivalProcArg);
5232 call->arrivalProc = (void (*)())0;
5236 rxi_CancelGrowMTUEvent(call);
5238 if (call->delayedAbortEvent) {
5239 rxi_CancelDelayedAbortEvent(call);
5240 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
5242 rxi_SendCallAbort(call, packet, 0, 1);
5243 rxi_FreePacket(packet);
5248 * Update the peer with the congestion information in this call
5249 * so other calls on this connection can pick up where this call
5250 * left off. If the congestion sequence numbers don't match then
5251 * another call experienced a retransmission.
5253 peer = call->conn->peer;
5254 MUTEX_ENTER(&peer->peer_lock);
5256 if (call->congestSeq == peer->congestSeq) {
5257 peer->cwind = MAX(peer->cwind, call->cwind);
5258 peer->MTU = MAX(peer->MTU, call->MTU);
5259 peer->nDgramPackets =
5260 MAX(peer->nDgramPackets, call->nDgramPackets);
5263 call->abortCode = 0;
5264 call->abortCount = 0;
5266 if (peer->maxDgramPackets > 1) {
5267 call->MTU = RX_HEADER_SIZE + RX_JUMBOBUFFERSIZE;
5269 call->MTU = peer->MTU;
5271 call->cwind = MIN((int)peer->cwind, (int)peer->nDgramPackets);
5272 call->ssthresh = rx_maxSendWindow;
5273 call->nDgramPackets = peer->nDgramPackets;
5274 call->congestSeq = peer->congestSeq;
5275 call->rtt = peer->rtt;
5276 call->rtt_dev = peer->rtt_dev;
5277 clock_Zero(&call->rto);
5278 clock_Addmsec(&call->rto,
5279 MAX(((call->rtt >> 3) + call->rtt_dev), rx_minPeerTimeout) + 200);
5280 MUTEX_EXIT(&peer->peer_lock);
5282 flags = call->flags;
5283 rxi_WaitforTQBusy(call);
5285 rxi_ClearTransmitQueue(call, 1);
5286 if (call->tqWaiters || (flags & RX_CALL_TQ_WAIT)) {
5287 dpf(("rcall %"AFS_PTR_FMT" has %d waiters and flags %d\n", call, call->tqWaiters, call->flags));
5291 rxi_ClearReceiveQueue(call);
5292 /* why init the queue if you just emptied it? queue_Init(&call->rq); */
5296 call->twind = call->conn->twind[call->channel];
5297 call->rwind = call->conn->rwind[call->channel];
5298 call->nSoftAcked = 0;
5299 call->nextCwind = 0;
5302 call->nCwindAcks = 0;
5303 call->nSoftAcks = 0;
5304 call->nHardAcks = 0;
5306 call->tfirst = call->rnext = call->tnext = 1;
5309 call->lastAcked = 0;
5310 call->localStatus = call->remoteStatus = 0;
5312 if (flags & RX_CALL_READER_WAIT) {
5313 #ifdef RX_ENABLE_LOCKS
5314 CV_BROADCAST(&call->cv_rq);
5316 osi_rxWakeup(&call->rq);
5319 if (flags & RX_CALL_WAIT_PACKETS) {
5320 MUTEX_ENTER(&rx_freePktQ_lock);
5321 rxi_PacketsUnWait(); /* XXX */
5322 MUTEX_EXIT(&rx_freePktQ_lock);
5324 #ifdef RX_ENABLE_LOCKS
5325 CV_SIGNAL(&call->cv_twind);
5327 if (flags & RX_CALL_WAIT_WINDOW_ALLOC)
5328 osi_rxWakeup(&call->twind);
5331 if (flags & RX_CALL_WAIT_PROC) {
5332 rx_atomic_dec(&rx_nWaiting);
5334 #ifdef RX_ENABLE_LOCKS
5335 /* The following ensures that we don't mess with any queue while some
5336 * other thread might also be doing so. The call_queue_lock field is
5337 * is only modified under the call lock. If the call is in the process
5338 * of being removed from a queue, the call is not locked until the
5339 * the queue lock is dropped and only then is the call_queue_lock field
5340 * zero'd out. So it's safe to lock the queue if call_queue_lock is set.
5341 * Note that any other routine which removes a call from a queue has to
5342 * obtain the queue lock before examing the queue and removing the call.
5344 if (call->call_queue_lock) {
5345 MUTEX_ENTER(call->call_queue_lock);
5346 if (opr_queue_IsOnQueue(&call->entry)) {
5347 opr_queue_Remove(&call->entry);
5349 MUTEX_EXIT(call->call_queue_lock);
5350 CLEAR_CALL_QUEUE_LOCK(call);
5352 #else /* RX_ENABLE_LOCKS */
5353 if (opr_queue_IsOnQueue(&call->entry)) {
5354 opr_queue_Remove(&call->entry);
5356 #endif /* RX_ENABLE_LOCKS */
5358 rxi_CancelKeepAliveEvent(call);
5359 rxi_CancelDelayedAckEvent(call);
5362 /* Send an acknowledge for the indicated packet (seq,serial) of the
5363 * indicated call, for the indicated reason (reason). This
5364 * acknowledge will specifically acknowledge receiving the packet, and
5365 * will also specify which other packets for this call have been
5366 * received. This routine returns the packet that was used to the
5367 * caller. The caller is responsible for freeing it or re-using it.
5368 * This acknowledgement also returns the highest sequence number
5369 * actually read out by the higher level to the sender; the sender
5370 * promises to keep around packets that have not been read by the
5371 * higher level yet (unless, of course, the sender decides to abort
5372 * the call altogether). Any of p, seq, serial, pflags, or reason may
5373 * be set to zero without ill effect. That is, if they are zero, they
5374 * will not convey any information.
5375 * NOW there is a trailer field, after the ack where it will safely be
5376 * ignored by mundanes, which indicates the maximum size packet this
5377 * host can swallow. */
5379 struct rx_packet *optionalPacket; use to send ack (or null)
5380 int seq; Sequence number of the packet we are acking
5381 int serial; Serial number of the packet
5382 int pflags; Flags field from packet header
5383 int reason; Reason an acknowledge was prompted
5386 #define RX_ZEROS 1024
5387 static char rx_zeros[RX_ZEROS];
5390 rxi_SendAck(struct rx_call *call,
5391 struct rx_packet *optionalPacket, int serial, int reason,
5394 struct rx_ackPacket *ap;
5395 struct rx_packet *p;
5396 struct opr_queue *cursor;
5399 afs_uint32 padbytes = 0;
5400 #ifdef RX_ENABLE_TSFPQ
5401 struct rx_ts_info_t * rx_ts_info;
5405 * Open the receive window once a thread starts reading packets
5407 if (call->rnext > 1) {
5408 call->conn->rwind[call->channel] = call->rwind = rx_maxReceiveWindow;
5411 /* Don't attempt to grow MTU if this is a critical ping */
5412 if (reason == RX_ACK_MTU) {
5413 /* keep track of per-call attempts, if we're over max, do in small
5414 * otherwise in larger? set a size to increment by, decrease
5417 if (call->conn->peer->maxPacketSize &&
5418 (call->conn->peer->maxPacketSize < OLD_MAX_PACKET_SIZE
5420 padbytes = call->conn->peer->maxPacketSize+16;
5422 padbytes = call->conn->peer->maxMTU + 128;
5424 /* do always try a minimum size ping */
5425 padbytes = MAX(padbytes, RX_MIN_PACKET_SIZE+RX_IPUDP_SIZE+4);
5427 /* subtract the ack payload */
5428 padbytes -= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32));
5429 reason = RX_ACK_PING;
5432 call->nHardAcks = 0;
5433 call->nSoftAcks = 0;
5434 if (call->rnext > call->lastAcked)
5435 call->lastAcked = call->rnext;
5439 rx_computelen(p, p->length); /* reset length, you never know */
5440 } /* where that's been... */
5441 #ifdef RX_ENABLE_TSFPQ
5443 RX_TS_INFO_GET(rx_ts_info);
5444 if ((p = rx_ts_info->local_special_packet)) {
5445 rx_computelen(p, p->length);
5446 } else if ((p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5447 rx_ts_info->local_special_packet = p;
5448 } else { /* We won't send the ack, but don't panic. */
5449 return optionalPacket;
5453 else if (!(p = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL))) {
5454 /* We won't send the ack, but don't panic. */
5455 return optionalPacket;
5460 rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32) -
5463 if (rxi_AllocDataBuf(p, templ, RX_PACKET_CLASS_SPECIAL) > 0) {
5464 #ifndef RX_ENABLE_TSFPQ
5465 if (!optionalPacket)
5468 return optionalPacket;
5470 templ = rx_AckDataSize(call->rwind) + 2 * sizeof(afs_int32);
5471 if (rx_Contiguous(p) < templ) {
5472 #ifndef RX_ENABLE_TSFPQ
5473 if (!optionalPacket)
5476 return optionalPacket;
5481 /* MTUXXX failing to send an ack is very serious. We should */
5482 /* try as hard as possible to send even a partial ack; it's */
5483 /* better than nothing. */
5484 ap = (struct rx_ackPacket *)rx_DataOf(p);
5485 ap->bufferSpace = htonl(0); /* Something should go here, sometime */
5486 ap->reason = reason;
5488 /* The skew computation used to be bogus, I think it's better now. */
5489 /* We should start paying attention to skew. XXX */
5490 ap->serial = htonl(serial);
5491 ap->maxSkew = 0; /* used to be peer->inPacketSkew */
5494 * First packet not yet forwarded to reader. When ACKALL has been
5495 * sent the peer has been told that all received packets will be
5496 * delivered to the reader. The value 'rnext' is used internally
5497 * to refer to the next packet in the receive queue that must be
5498 * delivered to the reader. From the perspective of the peer it
5499 * already has so report the last sequence number plus one if there
5500 * are packets in the receive queue awaiting processing.
5502 if ((call->flags & RX_CALL_ACKALL_SENT) &&
5503 !opr_queue_IsEmpty(&call->rq)) {
5504 ap->firstPacket = htonl(opr_queue_Last(&call->rq, struct rx_packet, entry)->header.seq + 1);
5506 ap->firstPacket = htonl(call->rnext);
5508 ap->previousPacket = htonl(call->rprev); /* Previous packet received */
5510 /* No fear of running out of ack packet here because there can only
5511 * be at most one window full of unacknowledged packets. The window
5512 * size must be constrained to be less than the maximum ack size,
5513 * of course. Also, an ack should always fit into a single packet
5514 * -- it should not ever be fragmented. */
5516 for (opr_queue_Scan(&call->rq, cursor)) {
5517 struct rx_packet *rqp
5518 = opr_queue_Entry(cursor, struct rx_packet, entry);
5520 if (!rqp || !call->rq.next
5521 || (rqp->header.seq > (call->rnext + call->rwind))) {
5522 #ifndef RX_ENABLE_TSFPQ
5523 if (!optionalPacket)
5526 rxi_CallError(call, RX_CALL_DEAD);
5527 return optionalPacket;
5530 while (rqp->header.seq > call->rnext + offset)
5531 ap->acks[offset++] = RX_ACK_TYPE_NACK;
5532 ap->acks[offset++] = RX_ACK_TYPE_ACK;
5534 if ((offset > (u_char) rx_maxReceiveWindow) || (offset > call->rwind)) {
5535 #ifndef RX_ENABLE_TSFPQ
5536 if (!optionalPacket)
5539 rxi_CallError(call, RX_CALL_DEAD);
5540 return optionalPacket;
5546 p->length = rx_AckDataSize(offset) + 4 * sizeof(afs_int32);
5548 /* Must zero the 3 octets that rx_AckDataSize skips at the end of the
5551 rx_packetwrite(p, rx_AckDataSize(offset) - 3, 3, rx_zeros);
5553 /* these are new for AFS 3.3 */
5554 templ = rxi_AdjustMaxMTU(call->conn->peer->ifMTU, rx_maxReceiveSize);
5555 templ = htonl(templ);
5556 rx_packetwrite(p, rx_AckDataSize(offset), sizeof(afs_int32), &templ);
5557 templ = htonl(call->conn->peer->ifMTU);
5558 rx_packetwrite(p, rx_AckDataSize(offset) + sizeof(afs_int32),
5559 sizeof(afs_int32), &templ);
5561 /* new for AFS 3.4 */
5562 templ = htonl(call->rwind);
5563 rx_packetwrite(p, rx_AckDataSize(offset) + 2 * sizeof(afs_int32),
5564 sizeof(afs_int32), &templ);
5566 /* new for AFS 3.5 */
5567 templ = htonl(call->conn->peer->ifDgramPackets);
5568 rx_packetwrite(p, rx_AckDataSize(offset) + 3 * sizeof(afs_int32),
5569 sizeof(afs_int32), &templ);
5571 p->length = rx_AckDataSize(offset) + 4 * sizeof(afs_int32);
5573 p->header.serviceId = call->conn->serviceId;
5574 p->header.cid = (call->conn->cid | call->channel);
5575 p->header.callNumber = *call->callNumber;
5577 p->header.securityIndex = call->conn->securityIndex;
5578 p->header.epoch = call->conn->epoch;
5579 p->header.type = RX_PACKET_TYPE_ACK;
5580 p->header.flags = RX_SLOW_START_OK;
5581 if (reason == RX_ACK_PING)
5582 p->header.flags |= RX_REQUEST_ACK;
5584 while (padbytes > 0) {
5585 if (padbytes > RX_ZEROS) {
5586 rx_packetwrite(p, p->length, RX_ZEROS, rx_zeros);
5587 p->length += RX_ZEROS;
5588 padbytes -= RX_ZEROS;
5590 rx_packetwrite(p, p->length, padbytes, rx_zeros);
5591 p->length += padbytes;
5596 if (call->conn->type == RX_CLIENT_CONNECTION)
5597 p->header.flags |= RX_CLIENT_INITIATED;
5601 if (rxdebug_active) {
5605 len = _snprintf(msg, sizeof(msg),
5606 "tid[%d] SACK: reason %s serial %u previous %u seq %u first %u acks %u space %u ",
5607 GetCurrentThreadId(), rx_ack_reason(ap->reason),
5608 ntohl(ap->serial), ntohl(ap->previousPacket),
5609 (unsigned int)p->header.seq, ntohl(ap->firstPacket),
5610 ap->nAcks, ntohs(ap->bufferSpace) );
5614 for (offset = 0; offset < ap->nAcks && len < sizeof(msg); offset++)
5615 msg[len++] = (ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*');
5619 OutputDebugString(msg);
5621 #else /* AFS_NT40_ENV */
5623 fprintf(rx_Log, "SACK: reason %x previous %u seq %u first %u ",
5624 ap->reason, ntohl(ap->previousPacket),
5625 (unsigned int)p->header.seq, ntohl(ap->firstPacket));
5627 for (offset = 0; offset < ap->nAcks; offset++)
5628 putc(ap->acks[offset] == RX_ACK_TYPE_NACK ? '-' : '*',
5633 #endif /* AFS_NT40_ENV */
5636 int i, nbytes = p->length;
5638 for (i = 1; i < p->niovecs; i++) { /* vec 0 is ALWAYS header */
5639 if (nbytes <= p->wirevec[i].iov_len) {
5642 savelen = p->wirevec[i].iov_len;
5644 p->wirevec[i].iov_len = nbytes;
5646 rxi_Send(call, p, istack);
5647 p->wirevec[i].iov_len = savelen;
5651 nbytes -= p->wirevec[i].iov_len;
5654 if (rx_stats_active)
5655 rx_atomic_inc(&rx_stats.ackPacketsSent);
5656 #ifndef RX_ENABLE_TSFPQ
5657 if (!optionalPacket)
5660 return optionalPacket; /* Return packet for re-use by caller */
5664 struct rx_packet **list;
5669 /* Send all of the packets in the list in single datagram */
5671 rxi_SendList(struct rx_call *call, struct xmitlist *xmit,
5672 int istack, int moreFlag)
5678 struct rx_connection *conn = call->conn;
5679 struct rx_peer *peer = conn->peer;
5681 MUTEX_ENTER(&peer->peer_lock);
5682 peer->nSent += xmit->len;
5683 if (xmit->resending)
5684 peer->reSends += xmit->len;
5685 MUTEX_EXIT(&peer->peer_lock);
5687 if (rx_stats_active) {
5688 if (xmit->resending)
5689 rx_atomic_add(&rx_stats.dataPacketsReSent, xmit->len);
5691 rx_atomic_add(&rx_stats.dataPacketsSent, xmit->len);
5694 clock_GetTime(&now);
5696 if (xmit->list[xmit->len - 1]->header.flags & RX_LAST_PACKET) {
5700 /* Set the packet flags and schedule the resend events */
5701 /* Only request an ack for the last packet in the list */
5702 for (i = 0; i < xmit->len; i++) {
5703 struct rx_packet *packet = xmit->list[i];
5705 /* Record the time sent */
5706 packet->timeSent = now;
5707 packet->flags |= RX_PKTFLAG_SENT;
5709 /* Ask for an ack on retransmitted packets, on every other packet
5710 * if the peer doesn't support slow start. Ask for an ack on every
5711 * packet until the congestion window reaches the ack rate. */
5712 if (packet->header.serial) {
5715 packet->firstSent = now;
5716 if (!lastPacket && (call->cwind <= (u_short) (conn->ackRate + 1)
5717 || (!(call->flags & RX_CALL_SLOW_START_OK)
5718 && (packet->header.seq & 1)))) {
5723 /* Tag this packet as not being the last in this group,
5724 * for the receiver's benefit */
5725 if (i < xmit->len - 1 || moreFlag) {
5726 packet->header.flags |= RX_MORE_PACKETS;
5731 xmit->list[xmit->len - 1]->header.flags |= RX_REQUEST_ACK;
5734 /* Since we're about to send a data packet to the peer, it's
5735 * safe to nuke any scheduled end-of-packets ack */
5736 rxi_CancelDelayedAckEvent(call);
5738 MUTEX_EXIT(&call->lock);
5739 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
5740 if (xmit->len > 1) {
5741 rxi_SendPacketList(call, conn, xmit->list, xmit->len, istack);
5743 rxi_SendPacket(call, conn, xmit->list[0], istack);
5745 MUTEX_ENTER(&call->lock);
5746 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
5748 /* Tell the RTO calculation engine that we have sent a packet, and
5749 * if it was the last one */
5750 rxi_rto_packet_sent(call, lastPacket, istack);
5752 /* Update last send time for this call (for keep-alive
5753 * processing), and for the connection (so that we can discover
5754 * idle connections) */
5755 conn->lastSendTime = call->lastSendTime = clock_Sec();
5758 /* When sending packets we need to follow these rules:
5759 * 1. Never send more than maxDgramPackets in a jumbogram.
5760 * 2. Never send a packet with more than two iovecs in a jumbogram.
5761 * 3. Never send a retransmitted packet in a jumbogram.
5762 * 4. Never send more than cwind/4 packets in a jumbogram
5763 * We always keep the last list we should have sent so we
5764 * can set the RX_MORE_PACKETS flags correctly.
5768 rxi_SendXmitList(struct rx_call *call, struct rx_packet **list, int len,
5773 struct xmitlist working;
5774 struct xmitlist last;
5776 struct rx_peer *peer = call->conn->peer;
5777 int morePackets = 0;
5779 memset(&last, 0, sizeof(struct xmitlist));
5780 working.list = &list[0];
5782 working.resending = 0;
5784 recovery = call->flags & RX_CALL_FAST_RECOVER;
5786 for (i = 0; i < len; i++) {
5787 /* Does the current packet force us to flush the current list? */
5789 && (list[i]->header.serial || (list[i]->flags & RX_PKTFLAG_ACKED)
5790 || list[i]->length > RX_JUMBOBUFFERSIZE)) {
5792 /* This sends the 'last' list and then rolls the current working
5793 * set into the 'last' one, and resets the working set */
5796 rxi_SendList(call, &last, istack, 1);
5797 /* If the call enters an error state stop sending, or if
5798 * we entered congestion recovery mode, stop sending */
5800 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5805 working.resending = 0;
5806 working.list = &list[i];
5808 /* Add the current packet to the list if it hasn't been acked.
5809 * Otherwise adjust the list pointer to skip the current packet. */
5810 if (!(list[i]->flags & RX_PKTFLAG_ACKED)) {
5813 if (list[i]->header.serial)
5814 working.resending = 1;
5816 /* Do we need to flush the list? */
5817 if (working.len >= (int)peer->maxDgramPackets
5818 || working.len >= (int)call->nDgramPackets
5819 || working.len >= (int)call->cwind
5820 || list[i]->header.serial
5821 || list[i]->length != RX_JUMBOBUFFERSIZE) {
5823 rxi_SendList(call, &last, istack, 1);
5824 /* If the call enters an error state stop sending, or if
5825 * we entered congestion recovery mode, stop sending */
5827 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5832 working.resending = 0;
5833 working.list = &list[i + 1];
5836 if (working.len != 0) {
5837 osi_Panic("rxi_SendList error");
5839 working.list = &list[i + 1];
5843 /* Send the whole list when the call is in receive mode, when
5844 * the call is in eof mode, when we are in fast recovery mode,
5845 * and when we have the last packet */
5846 /* XXX - The accesses to app.mode aren't safe, as this may be called by
5847 * the listener or event threads
5849 if ((list[len - 1]->header.flags & RX_LAST_PACKET)
5850 || (call->flags & RX_CALL_FLUSH)
5851 || (call->flags & RX_CALL_FAST_RECOVER)) {
5852 /* Check for the case where the current list contains
5853 * an acked packet. Since we always send retransmissions
5854 * in a separate packet, we only need to check the first
5855 * packet in the list */
5856 if (working.len > 0 && !(working.list[0]->flags & RX_PKTFLAG_ACKED)) {
5860 rxi_SendList(call, &last, istack, morePackets);
5861 /* If the call enters an error state stop sending, or if
5862 * we entered congestion recovery mode, stop sending */
5864 || (!recovery && (call->flags & RX_CALL_FAST_RECOVER)))
5868 rxi_SendList(call, &working, istack, 0);
5870 } else if (last.len > 0) {
5871 rxi_SendList(call, &last, istack, 0);
5872 /* Packets which are in 'working' are not sent by this call */
5877 * Check if the peer for the given call is known to be dead
5879 * If the call's peer appears dead (it has encountered fatal network errors
5880 * since the call started) the call is killed with RX_CALL_DEAD if the call
5881 * is active. Otherwise, we do nothing.
5883 * @param[in] call The call to check
5886 * @retval 0 The call is fine, and we haven't done anything to the call
5887 * @retval nonzero The call's peer appears dead, and the call has been
5888 * terminated if it was active
5890 * @pre call->lock must be locked
5893 rxi_CheckPeerDead(struct rx_call *call)
5895 #ifdef AFS_RXERRQ_ENV
5898 if (call->state == RX_STATE_DALLY) {
5902 peererrs = rx_atomic_read(&call->conn->peer->neterrs);
5903 if (call->neterr_gen < peererrs) {
5904 /* we have received network errors since this call started; kill
5906 if (call->state == RX_STATE_ACTIVE) {
5907 rxi_CallError(call, RX_CALL_DEAD);
5911 if (call->neterr_gen > peererrs) {
5912 /* someone has reset the number of peer errors; set the call error gen
5913 * so we can detect if more errors are encountered */
5914 call->neterr_gen = peererrs;
5921 rxi_Resend(struct rxevent *event, void *arg0, void *arg1, int istack)
5923 struct rx_call *call = arg0;
5924 struct rx_peer *peer;
5925 struct opr_queue *cursor;
5926 struct clock maxTimeout = { 60, 0 };
5928 MUTEX_ENTER(&call->lock);
5930 peer = call->conn->peer;
5932 /* Make sure that the event pointer is removed from the call
5933 * structure, since there is no longer a per-call retransmission
5935 if (event == call->resendEvent) {
5936 CALL_RELE(call, RX_CALL_REFCOUNT_RESEND);
5937 rxevent_Put(&call->resendEvent);
5940 rxi_CheckPeerDead(call);
5942 if (opr_queue_IsEmpty(&call->tq)) {
5943 /* Nothing to do. This means that we've been raced, and that an
5944 * ACK has come in between when we were triggered, and when we
5945 * actually got to run. */
5949 /* We're in loss recovery */
5950 call->flags |= RX_CALL_FAST_RECOVER;
5952 /* Mark all of the pending packets in the queue as being lost */
5953 for (opr_queue_Scan(&call->tq, cursor)) {
5954 struct rx_packet *p = opr_queue_Entry(cursor, struct rx_packet, entry);
5955 if (!(p->flags & RX_PKTFLAG_ACKED))
5956 p->flags &= ~RX_PKTFLAG_SENT;
5959 /* We're resending, so we double the timeout of the call. This will be
5960 * dropped back down by the first successful ACK that we receive.
5962 * We apply a maximum value here of 60 seconds
5964 clock_Add(&call->rto, &call->rto);
5965 if (clock_Gt(&call->rto, &maxTimeout))
5966 call->rto = maxTimeout;
5968 /* Packet loss is most likely due to congestion, so drop our window size
5969 * and start again from the beginning */
5970 if (peer->maxDgramPackets >1) {
5971 call->MTU = RX_JUMBOBUFFERSIZE + RX_HEADER_SIZE;
5972 call->MTU = MIN(peer->natMTU, peer->maxMTU);
5974 call->ssthresh = MAX(4, MIN((int)call->cwind, (int)call->twind)) >> 1;
5975 call->nDgramPackets = 1;
5977 call->nextCwind = 1;
5980 MUTEX_ENTER(&peer->peer_lock);
5981 peer->MTU = call->MTU;
5982 peer->cwind = call->cwind;
5983 peer->nDgramPackets = 1;
5985 call->congestSeq = peer->congestSeq;
5986 MUTEX_EXIT(&peer->peer_lock);
5988 rxi_Start(call, istack);
5991 MUTEX_EXIT(&call->lock);
5994 /* This routine is called when new packets are readied for
5995 * transmission and when retransmission may be necessary, or when the
5996 * transmission window or burst count are favourable. This should be
5997 * better optimized for new packets, the usual case, now that we've
5998 * got rid of queues of send packets. XXXXXXXXXXX */
6000 rxi_Start(struct rx_call *call, int istack)
6002 struct opr_queue *cursor;
6003 #ifdef RX_ENABLE_LOCKS
6004 struct opr_queue *store;
6010 #ifdef RX_ENABLE_LOCKS
6011 if (rx_stats_active)
6012 rx_atomic_inc(&rx_tq_debug.rxi_start_in_error);
6017 if (!opr_queue_IsEmpty(&call->tq)) { /* If we have anything to send */
6018 /* Send (or resend) any packets that need it, subject to
6019 * window restrictions and congestion burst control
6020 * restrictions. Ask for an ack on the last packet sent in
6021 * this burst. For now, we're relying upon the window being
6022 * considerably bigger than the largest number of packets that
6023 * are typically sent at once by one initial call to
6024 * rxi_Start. This is probably bogus (perhaps we should ask
6025 * for an ack when we're half way through the current
6026 * window?). Also, for non file transfer applications, this
6027 * may end up asking for an ack for every packet. Bogus. XXXX
6030 * But check whether we're here recursively, and let the other guy
6033 #ifdef RX_ENABLE_LOCKS
6034 if (!(call->flags & RX_CALL_TQ_BUSY)) {
6035 call->flags |= RX_CALL_TQ_BUSY;
6037 #endif /* RX_ENABLE_LOCKS */
6039 #ifdef RX_ENABLE_LOCKS
6040 call->flags &= ~RX_CALL_NEED_START;
6041 #endif /* RX_ENABLE_LOCKS */
6043 maxXmitPackets = MIN(call->twind, call->cwind);
6044 for (opr_queue_Scan(&call->tq, cursor)) {
6046 = opr_queue_Entry(cursor, struct rx_packet, entry);
6048 if (p->flags & RX_PKTFLAG_ACKED) {
6049 /* Since we may block, don't trust this */
6050 if (rx_stats_active)
6051 rx_atomic_inc(&rx_stats.ignoreAckedPacket);
6052 continue; /* Ignore this packet if it has been acknowledged */
6055 /* Turn off all flags except these ones, which are the same
6056 * on each transmission */
6057 p->header.flags &= RX_PRESET_FLAGS;
6059 if (p->header.seq >=
6060 call->tfirst + MIN((int)call->twind,
6061 (int)(call->nSoftAcked +
6063 call->flags |= RX_CALL_WAIT_WINDOW_SEND; /* Wait for transmit window */
6064 /* Note: if we're waiting for more window space, we can
6065 * still send retransmits; hence we don't return here, but
6066 * break out to schedule a retransmit event */
6067 dpf(("call %d waiting for window (seq %d, twind %d, nSoftAcked %d, cwind %d)\n",
6068 *(call->callNumber), p->header.seq, call->twind, call->nSoftAcked,
6073 /* Transmit the packet if it needs to be sent. */
6074 if (!(p->flags & RX_PKTFLAG_SENT)) {
6075 if (nXmitPackets == maxXmitPackets) {
6076 rxi_SendXmitList(call, call->xmitList,
6077 nXmitPackets, istack);
6080 dpf(("call %d xmit packet %"AFS_PTR_FMT"\n",
6081 *(call->callNumber), p));
6082 call->xmitList[nXmitPackets++] = p;
6084 } /* end of the queue_Scan */
6086 /* xmitList now hold pointers to all of the packets that are
6087 * ready to send. Now we loop to send the packets */
6088 if (nXmitPackets > 0) {
6089 rxi_SendXmitList(call, call->xmitList, nXmitPackets,
6093 #ifdef RX_ENABLE_LOCKS
6095 /* We went into the error state while sending packets. Now is
6096 * the time to reset the call. This will also inform the using
6097 * process that the call is in an error state.
6099 if (rx_stats_active)
6100 rx_atomic_inc(&rx_tq_debug.rxi_start_aborted);
6101 call->flags &= ~RX_CALL_TQ_BUSY;
6102 rxi_WakeUpTransmitQueue(call);
6103 rxi_CallError(call, call->error);
6107 if (call->flags & RX_CALL_TQ_SOME_ACKED) {
6109 call->flags &= ~RX_CALL_TQ_SOME_ACKED;
6110 /* Some packets have received acks. If they all have, we can clear
6111 * the transmit queue.
6114 for (opr_queue_ScanSafe(&call->tq, cursor, store)) {
6116 = opr_queue_Entry(cursor, struct rx_packet, entry);
6118 if (p->header.seq < call->tfirst
6119 && (p->flags & RX_PKTFLAG_ACKED)) {
6120 opr_queue_Remove(&p->entry);
6121 #ifdef RX_TRACK_PACKETS
6122 p->flags &= ~RX_PKTFLAG_TQ;
6124 #ifdef RXDEBUG_PACKET
6132 call->flags |= RX_CALL_TQ_CLEARME;
6134 if (call->flags & RX_CALL_TQ_CLEARME)
6135 rxi_ClearTransmitQueue(call, 1);
6136 } while (call->flags & RX_CALL_NEED_START);
6138 * TQ references no longer protected by this flag; they must remain
6139 * protected by the call lock.
6141 call->flags &= ~RX_CALL_TQ_BUSY;
6142 rxi_WakeUpTransmitQueue(call);
6144 call->flags |= RX_CALL_NEED_START;
6146 #endif /* RX_ENABLE_LOCKS */
6148 rxi_rto_cancel(call);
6152 /* Also adjusts the keep alive parameters for the call, to reflect
6153 * that we have just sent a packet (so keep alives aren't sent
6156 rxi_Send(struct rx_call *call, struct rx_packet *p,
6159 struct rx_connection *conn = call->conn;
6161 /* Stamp each packet with the user supplied status */
6162 p->header.userStatus = call->localStatus;
6164 /* Allow the security object controlling this call's security to
6165 * make any last-minute changes to the packet */
6166 RXS_SendPacket(conn->securityObject, call, p);
6168 /* Since we're about to send SOME sort of packet to the peer, it's
6169 * safe to nuke any scheduled end-of-packets ack */
6170 rxi_CancelDelayedAckEvent(call);
6172 /* Actually send the packet, filling in more connection-specific fields */
6173 MUTEX_EXIT(&call->lock);
6174 CALL_HOLD(call, RX_CALL_REFCOUNT_SEND);
6175 rxi_SendPacket(call, conn, p, istack);
6176 CALL_RELE(call, RX_CALL_REFCOUNT_SEND);
6177 MUTEX_ENTER(&call->lock);
6179 /* Update last send time for this call (for keep-alive
6180 * processing), and for the connection (so that we can discover
6181 * idle connections) */
6182 if ((p->header.type != RX_PACKET_TYPE_ACK) ||
6183 (((struct rx_ackPacket *)rx_DataOf(p))->reason == RX_ACK_PING) ||
6184 (p->length <= (rx_AckDataSize(call->rwind) + 4 * sizeof(afs_int32))))
6186 conn->lastSendTime = call->lastSendTime = clock_Sec();
6190 /* Check if a call needs to be destroyed. Called by keep-alive code to ensure
6191 * that things are fine. Also called periodically to guarantee that nothing
6192 * falls through the cracks (e.g. (error + dally) connections have keepalive
6193 * turned off. Returns 0 if conn is well, -1 otherwise. If otherwise, call
6195 * haveCTLock Set if calling from rxi_ReapConnections
6198 rxi_CheckCall(struct rx_call *call, int haveCTLock)
6200 struct rx_connection *conn = call->conn;
6202 afs_uint32 deadTime, idleDeadTime = 0, hardDeadTime = 0;
6203 afs_uint32 fudgeFactor;
6206 int idle_timeout = 0;
6207 afs_int32 clock_diff = 0;
6209 if (rxi_CheckPeerDead(call)) {
6215 /* Large swings in the clock can have a significant impact on
6216 * the performance of RX call processing. Forward clock shifts
6217 * will result in premature event triggering or timeouts.
6218 * Backward shifts can result in calls not completing until
6219 * the clock catches up with the original start clock value.
6221 * If a backward clock shift of more than five minutes is noticed,
6222 * just fail the call.
6224 if (now < call->lastSendTime)
6225 clock_diff = call->lastSendTime - now;
6226 if (now < call->startWait)
6227 clock_diff = MAX(clock_diff, call->startWait - now);
6228 if (now < call->lastReceiveTime)
6229 clock_diff = MAX(clock_diff, call->lastReceiveTime - now);
6230 if (clock_diff > 5 * 60)
6232 if (call->state == RX_STATE_ACTIVE)
6233 rxi_CallError(call, RX_CALL_TIMEOUT);
6237 #ifdef RX_ENABLE_LOCKS
6238 if (call->flags & RX_CALL_TQ_BUSY) {
6239 /* Call is active and will be reset by rxi_Start if it's
6240 * in an error state.
6245 /* RTT + 8*MDEV, rounded up to the next second. */
6246 fudgeFactor = (((afs_uint32) call->rtt >> 3) +
6247 ((afs_uint32) call->rtt_dev << 1) + 1023) >> 10;
6249 deadTime = conn->secondsUntilDead + fudgeFactor;
6250 /* These are computed to the second (+- 1 second). But that's
6251 * good enough for these values, which should be a significant
6252 * number of seconds. */
6253 if (now > (call->lastReceiveTime + deadTime)) {
6254 if (call->state == RX_STATE_ACTIVE) {
6255 cerror = RX_CALL_DEAD;
6258 #ifdef RX_ENABLE_LOCKS
6259 /* Cancel pending events */
6260 rxi_CancelDelayedAckEvent(call);
6261 rxi_rto_cancel(call);
6262 rxi_CancelKeepAliveEvent(call);
6263 rxi_CancelGrowMTUEvent(call);
6264 MUTEX_ENTER(&rx_refcnt_mutex);
6265 /* if rxi_FreeCall returns 1 it has freed the call */
6266 if (call->refCount == 0 &&
6267 rxi_FreeCall(call, haveCTLock))
6269 MUTEX_EXIT(&rx_refcnt_mutex);
6272 MUTEX_EXIT(&rx_refcnt_mutex);
6274 #else /* RX_ENABLE_LOCKS */
6275 rxi_FreeCall(call, 0);
6277 #endif /* RX_ENABLE_LOCKS */
6279 /* Non-active calls are destroyed if they are not responding
6280 * to pings; active calls are simply flagged in error, so the
6281 * attached process can die reasonably gracefully. */
6284 if (conn->idleDeadTime) {
6285 idleDeadTime = conn->idleDeadTime + fudgeFactor;
6289 /* see if we have a non-activity timeout */
6290 if (call->startWait && ((call->startWait + idleDeadTime) < now)) {
6291 if (call->state == RX_STATE_ACTIVE) {
6292 cerror = RX_CALL_TIMEOUT;
6298 if (conn->hardDeadTime) {
6299 hardDeadTime = conn->hardDeadTime + fudgeFactor;
6302 /* see if we have a hard timeout */
6304 && (now > (hardDeadTime + call->startTime.sec))) {
6305 if (call->state == RX_STATE_ACTIVE)
6306 rxi_CallError(call, RX_CALL_TIMEOUT);
6311 if (conn->msgsizeRetryErr && cerror != RX_CALL_TIMEOUT && !idle_timeout &&
6312 call->lastReceiveTime) {
6313 int oldMTU = conn->peer->ifMTU;
6315 /* If we thought we could send more, perhaps things got worse.
6316 * Shrink by 128 bytes and try again. */
6317 if (conn->peer->maxPacketSize < conn->lastPacketSize)
6318 /* maxPacketSize will be cleared in rxi_SetPeerMtu */
6319 newmtu = MAX(conn->peer->maxPacketSize + RX_HEADER_SIZE,
6320 conn->lastPacketSize - 128 + RX_HEADER_SIZE);
6322 newmtu = conn->lastPacketSize - 128 + RX_HEADER_SIZE;
6324 /* minimum capped in SetPeerMtu */
6325 rxi_SetPeerMtu(conn->peer, 0, 0, newmtu);
6328 conn->lastPacketSize = conn->lastPacketSizeSeq = 0;
6330 /* needed so ResetCall doesn't clobber us. */
6331 call->MTU = conn->peer->ifMTU;
6333 /* if we never succeeded, let the error pass out as-is */
6334 if (conn->peer->maxPacketSize && oldMTU != conn->peer->ifMTU)
6335 cerror = conn->msgsizeRetryErr;
6338 rxi_CallError(call, cerror);
6343 rxi_NatKeepAliveEvent(struct rxevent *event, void *arg1,
6344 void *dummy, int dummy2)
6346 struct rx_connection *conn = arg1;
6347 struct rx_header theader;
6348 char tbuffer[1 + sizeof(struct rx_header)];
6349 struct sockaddr_in taddr;
6352 struct iovec tmpiov[2];
6355 RX_CLIENT_CONNECTION ? rx_socket : conn->service->socket);
6358 tp = &tbuffer[sizeof(struct rx_header)];
6359 taddr.sin_family = AF_INET;
6360 taddr.sin_port = rx_PortOf(rx_PeerOf(conn));
6361 taddr.sin_addr.s_addr = rx_HostOf(rx_PeerOf(conn));
6362 memset(&taddr.sin_zero, 0, sizeof(taddr.sin_zero));
6363 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
6364 taddr.sin_len = sizeof(struct sockaddr_in);
6366 memset(&theader, 0, sizeof(theader));
6367 theader.epoch = htonl(999);
6369 theader.callNumber = 0;
6372 theader.type = RX_PACKET_TYPE_VERSION;
6373 theader.flags = RX_LAST_PACKET;
6374 theader.serviceId = 0;
6376 memcpy(tbuffer, &theader, sizeof(theader));
6377 memcpy(tp, &a, sizeof(a));
6378 tmpiov[0].iov_base = tbuffer;
6379 tmpiov[0].iov_len = 1 + sizeof(struct rx_header);
6381 osi_NetSend(socket, &taddr, tmpiov, 1, 1 + sizeof(struct rx_header), 1);
6383 MUTEX_ENTER(&conn->conn_data_lock);
6384 MUTEX_ENTER(&rx_refcnt_mutex);
6385 /* Only reschedule ourselves if the connection would not be destroyed */
6386 if (conn->refCount <= 1) {
6387 rxevent_Put(&conn->natKeepAliveEvent);
6388 MUTEX_EXIT(&rx_refcnt_mutex);
6389 MUTEX_EXIT(&conn->conn_data_lock);
6390 rx_DestroyConnection(conn); /* drop the reference for this */
6392 conn->refCount--; /* drop the reference for this */
6393 MUTEX_EXIT(&rx_refcnt_mutex);
6394 rxevent_Put(&conn->natKeepAliveEvent);
6395 rxi_ScheduleNatKeepAliveEvent(conn);
6396 MUTEX_EXIT(&conn->conn_data_lock);
6401 rxi_ScheduleNatKeepAliveEvent(struct rx_connection *conn)
6403 if (!conn->natKeepAliveEvent && conn->secondsUntilNatPing) {
6404 struct clock when, now;
6405 clock_GetTime(&now);
6407 when.sec += conn->secondsUntilNatPing;
6408 MUTEX_ENTER(&rx_refcnt_mutex);
6409 conn->refCount++; /* hold a reference for this */
6410 MUTEX_EXIT(&rx_refcnt_mutex);
6411 conn->natKeepAliveEvent =
6412 rxevent_Post(&when, &now, rxi_NatKeepAliveEvent, conn, NULL, 0);
6417 rx_SetConnSecondsUntilNatPing(struct rx_connection *conn, afs_int32 seconds)
6419 MUTEX_ENTER(&conn->conn_data_lock);
6420 conn->secondsUntilNatPing = seconds;
6422 if (!(conn->flags & RX_CONN_ATTACHWAIT))
6423 rxi_ScheduleNatKeepAliveEvent(conn);
6425 conn->flags |= RX_CONN_NAT_PING;
6427 MUTEX_EXIT(&conn->conn_data_lock);
6430 /* When a call is in progress, this routine is called occasionally to
6431 * make sure that some traffic has arrived (or been sent to) the peer.
6432 * If nothing has arrived in a reasonable amount of time, the call is
6433 * declared dead; if nothing has been sent for a while, we send a
6434 * keep-alive packet (if we're actually trying to keep the call alive)
6437 rxi_KeepAliveEvent(struct rxevent *event, void *arg1, void *dummy,
6440 struct rx_call *call = arg1;
6441 struct rx_connection *conn;
6444 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6445 MUTEX_ENTER(&call->lock);
6447 if (event == call->keepAliveEvent)
6448 rxevent_Put(&call->keepAliveEvent);
6452 if (rxi_CheckCall(call, 0)) {
6453 MUTEX_EXIT(&call->lock);
6457 /* Don't try to keep alive dallying calls */
6458 if (call->state == RX_STATE_DALLY) {
6459 MUTEX_EXIT(&call->lock);
6464 if ((now - call->lastSendTime) > conn->secondsUntilPing) {
6465 /* Don't try to send keepalives if there is unacknowledged data */
6466 /* the rexmit code should be good enough, this little hack
6467 * doesn't quite work XXX */
6468 (void)rxi_SendAck(call, NULL, 0, RX_ACK_PING, 0);
6470 rxi_ScheduleKeepAliveEvent(call);
6471 MUTEX_EXIT(&call->lock);
6474 /* Does what's on the nameplate. */
6476 rxi_GrowMTUEvent(struct rxevent *event, void *arg1, void *dummy, int dummy2)
6478 struct rx_call *call = arg1;
6479 struct rx_connection *conn;
6481 CALL_RELE(call, RX_CALL_REFCOUNT_MTU);
6482 MUTEX_ENTER(&call->lock);
6484 if (event == call->growMTUEvent)
6485 rxevent_Put(&call->growMTUEvent);
6487 if (rxi_CheckCall(call, 0)) {
6488 MUTEX_EXIT(&call->lock);
6492 /* Don't bother with dallying calls */
6493 if (call->state == RX_STATE_DALLY) {
6494 MUTEX_EXIT(&call->lock);
6501 * keep being scheduled, just don't do anything if we're at peak,
6502 * or we're not set up to be properly handled (idle timeout required)
6504 if ((conn->peer->maxPacketSize != 0) &&
6505 (conn->peer->natMTU < RX_MAX_PACKET_SIZE) &&
6507 (void)rxi_SendAck(call, NULL, 0, RX_ACK_MTU, 0);
6508 rxi_ScheduleGrowMTUEvent(call, 0);
6509 MUTEX_EXIT(&call->lock);
6513 rxi_ScheduleKeepAliveEvent(struct rx_call *call)
6515 if (!call->keepAliveEvent) {
6516 struct clock when, now;
6517 clock_GetTime(&now);
6519 when.sec += call->conn->secondsUntilPing;
6520 CALL_HOLD(call, RX_CALL_REFCOUNT_ALIVE);
6521 call->keepAliveEvent =
6522 rxevent_Post(&when, &now, rxi_KeepAliveEvent, call, NULL, 0);
6527 rxi_CancelKeepAliveEvent(struct rx_call *call) {
6528 if (call->keepAliveEvent) {
6529 rxevent_Cancel(&call->keepAliveEvent);
6530 CALL_RELE(call, RX_CALL_REFCOUNT_ALIVE);
6535 rxi_ScheduleGrowMTUEvent(struct rx_call *call, int secs)
6537 if (!call->growMTUEvent) {
6538 struct clock when, now;
6540 clock_GetTime(&now);
6543 if (call->conn->secondsUntilPing)
6544 secs = (6*call->conn->secondsUntilPing)-1;
6546 if (call->conn->secondsUntilDead)
6547 secs = MIN(secs, (call->conn->secondsUntilDead-1));
6551 CALL_HOLD(call, RX_CALL_REFCOUNT_MTU);
6552 call->growMTUEvent =
6553 rxevent_Post(&when, &now, rxi_GrowMTUEvent, call, NULL, 0);
6558 rxi_CancelGrowMTUEvent(struct rx_call *call)
6560 if (call->growMTUEvent) {
6561 rxevent_Cancel(&call->growMTUEvent);
6562 CALL_RELE(call, RX_CALL_REFCOUNT_MTU);
6567 * Increment the counter for the next connection ID, handling overflow.
6570 update_nextCid(void)
6572 /* Overflow is technically undefined behavior; avoid it. */
6573 if (rx_nextCid > MAX_AFS_INT32 - (1 << RX_CIDSHIFT))
6574 rx_nextCid = -1 * ((MAX_AFS_INT32 / RX_CIDSHIFT) * RX_CIDSHIFT);
6576 rx_nextCid += 1 << RX_CIDSHIFT;
6580 rxi_KeepAliveOn(struct rx_call *call)
6582 /* Pretend last packet received was received now--i.e. if another
6583 * packet isn't received within the keep alive time, then the call
6584 * will die; Initialize last send time to the current time--even
6585 * if a packet hasn't been sent yet. This will guarantee that a
6586 * keep-alive is sent within the ping time */
6587 call->lastReceiveTime = call->lastSendTime = clock_Sec();
6588 rxi_ScheduleKeepAliveEvent(call);
6592 rxi_GrowMTUOn(struct rx_call *call)
6594 struct rx_connection *conn = call->conn;
6595 MUTEX_ENTER(&conn->conn_data_lock);
6596 conn->lastPingSizeSer = conn->lastPingSize = 0;
6597 MUTEX_EXIT(&conn->conn_data_lock);
6598 rxi_ScheduleGrowMTUEvent(call, 1);
6601 /* This routine is called to send connection abort messages
6602 * that have been delayed to throttle looping clients. */
6604 rxi_SendDelayedConnAbort(struct rxevent *event, void *arg1, void *unused,
6607 struct rx_connection *conn = arg1;
6610 struct rx_packet *packet;
6612 MUTEX_ENTER(&conn->conn_data_lock);
6613 rxevent_Put(&conn->delayedAbortEvent);
6614 error = htonl(conn->error);
6616 MUTEX_EXIT(&conn->conn_data_lock);
6617 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6620 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6621 RX_PACKET_TYPE_ABORT, (char *)&error,
6623 rxi_FreePacket(packet);
6627 /* This routine is called to send call abort messages
6628 * that have been delayed to throttle looping clients. */
6630 rxi_SendDelayedCallAbort(struct rxevent *event, void *arg1, void *dummy,
6633 struct rx_call *call = arg1;
6636 struct rx_packet *packet;
6638 MUTEX_ENTER(&call->lock);
6639 rxevent_Put(&call->delayedAbortEvent);
6640 error = htonl(call->error);
6642 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6645 rxi_SendSpecial(call, call->conn, packet, RX_PACKET_TYPE_ABORT,
6646 (char *)&error, sizeof(error), 0);
6647 rxi_FreePacket(packet);
6649 MUTEX_EXIT(&call->lock);
6650 CALL_RELE(call, RX_CALL_REFCOUNT_ABORT);
6653 /* This routine is called periodically (every RX_AUTH_REQUEST_TIMEOUT
6654 * seconds) to ask the client to authenticate itself. The routine
6655 * issues a challenge to the client, which is obtained from the
6656 * security object associated with the connection */
6658 rxi_ChallengeEvent(struct rxevent *event,
6659 void *arg0, void *arg1, int tries)
6661 struct rx_connection *conn = arg0;
6664 rxevent_Put(&conn->challengeEvent);
6666 /* If there are no active calls it is not worth re-issuing the
6667 * challenge. If the client issues another call on this connection
6668 * the challenge can be requested at that time.
6670 if (!rxi_HasActiveCalls(conn))
6673 if (RXS_CheckAuthentication(conn->securityObject, conn) != 0) {
6674 struct rx_packet *packet;
6675 struct clock when, now;
6678 /* We've failed to authenticate for too long.
6679 * Reset any calls waiting for authentication;
6680 * they are all in RX_STATE_PRECALL.
6684 MUTEX_ENTER(&conn->conn_call_lock);
6685 for (i = 0; i < RX_MAXCALLS; i++) {
6686 struct rx_call *call = conn->call[i];
6688 MUTEX_ENTER(&call->lock);
6689 if (call->state == RX_STATE_PRECALL) {
6690 rxi_CallError(call, RX_CALL_DEAD);
6691 rxi_SendCallAbort(call, NULL, 0, 0);
6693 MUTEX_EXIT(&call->lock);
6696 MUTEX_EXIT(&conn->conn_call_lock);
6700 packet = rxi_AllocPacket(RX_PACKET_CLASS_SPECIAL);
6702 /* If there's no packet available, do this later. */
6703 RXS_GetChallenge(conn->securityObject, conn, packet);
6704 rxi_SendSpecial((struct rx_call *)0, conn, packet,
6705 RX_PACKET_TYPE_CHALLENGE, NULL, -1, 0);
6706 rxi_FreePacket(packet);
6707 conn->securityChallengeSent = 1;
6709 clock_GetTime(&now);
6711 when.sec += RX_CHALLENGE_TIMEOUT;
6712 conn->challengeEvent =
6713 rxevent_Post(&when, &now, rxi_ChallengeEvent, conn, 0,
6718 /* Call this routine to start requesting the client to authenticate
6719 * itself. This will continue until authentication is established,
6720 * the call times out, or an invalid response is returned. The
6721 * security object associated with the connection is asked to create
6722 * the challenge at this time. N.B. rxi_ChallengeOff is a macro,
6723 * defined earlier. */
6725 rxi_ChallengeOn(struct rx_connection *conn)
6727 if (!conn->challengeEvent) {
6728 RXS_CreateChallenge(conn->securityObject, conn);
6729 rxi_ChallengeEvent(NULL, conn, 0, RX_CHALLENGE_MAXTRIES);
6734 /* rxi_ComputeRoundTripTime is called with peer locked. */
6735 /* peer may be null */
6737 rxi_ComputeRoundTripTime(struct rx_packet *p,
6738 struct rx_ackPacket *ack,
6739 struct rx_call *call,
6740 struct rx_peer *peer,
6743 struct clock thisRtt, *sentp;
6747 /* If the ACK is delayed, then do nothing */
6748 if (ack->reason == RX_ACK_DELAY)
6751 /* On the wire, jumbograms are a single UDP packet. We shouldn't count
6752 * their RTT multiple times, so only include the RTT of the last packet
6754 if (p->flags & RX_JUMBO_PACKET)
6757 /* Use the serial number to determine which transmission the ACK is for,
6758 * and set the sent time to match this. If we have no serial number, then
6759 * only use the ACK for RTT calculations if the packet has not been
6763 serial = ntohl(ack->serial);
6765 if (serial == p->header.serial) {
6766 sentp = &p->timeSent;
6767 } else if (serial == p->firstSerial) {
6768 sentp = &p->firstSent;
6769 } else if (clock_Eq(&p->timeSent, &p->firstSent)) {
6770 sentp = &p->firstSent;
6774 if (clock_Eq(&p->timeSent, &p->firstSent)) {
6775 sentp = &p->firstSent;
6782 if (clock_Lt(&thisRtt, sentp))
6783 return; /* somebody set the clock back, don't count this time. */
6785 clock_Sub(&thisRtt, sentp);
6786 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rttp=%d.%06d sec)\n",
6787 p->header.callNumber, p, thisRtt.sec, thisRtt.usec));
6789 if (clock_IsZero(&thisRtt)) {
6791 * The actual round trip time is shorter than the
6792 * clock_GetTime resolution. It is most likely 1ms or 100ns.
6793 * Since we can't tell which at the moment we will assume 1ms.
6795 thisRtt.usec = 1000;
6798 if (rx_stats_active) {
6799 MUTEX_ENTER(&rx_stats_mutex);
6800 if (clock_Lt(&thisRtt, &rx_stats.minRtt))
6801 rx_stats.minRtt = thisRtt;
6802 if (clock_Gt(&thisRtt, &rx_stats.maxRtt)) {
6803 if (thisRtt.sec > 60) {
6804 MUTEX_EXIT(&rx_stats_mutex);
6805 return; /* somebody set the clock ahead */
6807 rx_stats.maxRtt = thisRtt;
6809 clock_Add(&rx_stats.totalRtt, &thisRtt);
6810 rx_atomic_inc(&rx_stats.nRttSamples);
6811 MUTEX_EXIT(&rx_stats_mutex);
6814 /* better rtt calculation courtesy of UMich crew (dave,larry,peter,?) */
6816 /* Apply VanJacobson round-trip estimations */
6821 * srtt (call->rtt) is in units of one-eighth-milliseconds.
6822 * srtt is stored as fixed point with 3 bits after the binary
6823 * point (i.e., scaled by 8). The following magic is
6824 * equivalent to the smoothing algorithm in rfc793 with an
6825 * alpha of .875 (srtt' = rtt/8 + srtt*7/8 in fixed point).
6826 * srtt'*8 = rtt + srtt*7
6827 * srtt'*8 = srtt*8 + rtt - srtt
6828 * srtt' = srtt + rtt/8 - srtt/8
6829 * srtt' = srtt + (rtt - srtt)/8
6832 delta = _8THMSEC(&thisRtt) - call->rtt;
6833 call->rtt += (delta >> 3);
6836 * We accumulate a smoothed rtt variance (actually, a smoothed
6837 * mean difference), then set the retransmit timer to smoothed
6838 * rtt + 4 times the smoothed variance (was 2x in van's original
6839 * paper, but 4x works better for me, and apparently for him as
6841 * rttvar is stored as
6842 * fixed point with 2 bits after the binary point (scaled by
6843 * 4). The following is equivalent to rfc793 smoothing with
6844 * an alpha of .75 (rttvar' = rttvar*3/4 + |delta| / 4).
6845 * rttvar'*4 = rttvar*3 + |delta|
6846 * rttvar'*4 = rttvar*4 + |delta| - rttvar
6847 * rttvar' = rttvar + |delta|/4 - rttvar/4
6848 * rttvar' = rttvar + (|delta| - rttvar)/4
6849 * This replaces rfc793's wired-in beta.
6850 * dev*4 = dev*4 + (|actual - expected| - dev)
6856 delta -= (call->rtt_dev << 1);
6857 call->rtt_dev += (delta >> 3);
6859 /* I don't have a stored RTT so I start with this value. Since I'm
6860 * probably just starting a call, and will be pushing more data down
6861 * this, I expect congestion to increase rapidly. So I fudge a
6862 * little, and I set deviance to half the rtt. In practice,
6863 * deviance tends to approach something a little less than
6864 * half the smoothed rtt. */
6865 call->rtt = _8THMSEC(&thisRtt) + 8;
6866 call->rtt_dev = call->rtt >> 2; /* rtt/2: they're scaled differently */
6868 /* the smoothed RTT time is RTT + 4*MDEV
6870 * We allow a user specified minimum to be set for this, to allow clamping
6871 * at a minimum value in the same way as TCP. In addition, we have to allow
6872 * for the possibility that this packet is answered by a delayed ACK, so we
6873 * add on a fixed 200ms to account for that timer expiring.
6876 rtt_timeout = MAX(((call->rtt >> 3) + call->rtt_dev),
6877 rx_minPeerTimeout) + 200;
6878 clock_Zero(&call->rto);
6879 clock_Addmsec(&call->rto, rtt_timeout);
6881 /* Update the peer, so any new calls start with our values */
6882 peer->rtt_dev = call->rtt_dev;
6883 peer->rtt = call->rtt;
6885 dpf(("rxi_ComputeRoundTripTime(call=%d packet=%"AFS_PTR_FMT" rtt=%d ms, srtt=%d ms, rtt_dev=%d ms, timeout=%d.%06d sec)\n",
6886 p->header.callNumber, p, MSEC(&thisRtt), call->rtt >> 3, call->rtt_dev >> 2, (call->rto.sec), (call->rto.usec)));
6890 /* Find all server connections that have not been active for a long time, and
6893 rxi_ReapConnections(struct rxevent *unused, void *unused1, void *unused2,
6896 struct clock now, when;
6897 struct rxevent *event;
6898 clock_GetTime(&now);
6900 /* Find server connection structures that haven't been used for
6901 * greater than rx_idleConnectionTime */
6903 struct rx_connection **conn_ptr, **conn_end;
6904 int i, havecalls = 0;
6905 MUTEX_ENTER(&rx_connHashTable_lock);
6906 for (conn_ptr = &rx_connHashTable[0], conn_end =
6907 &rx_connHashTable[rx_hashTableSize]; conn_ptr < conn_end;
6909 struct rx_connection *conn, *next;
6910 struct rx_call *call;
6914 for (conn = *conn_ptr; conn; conn = next) {
6915 /* XXX -- Shouldn't the connection be locked? */
6918 for (i = 0; i < RX_MAXCALLS; i++) {
6919 call = conn->call[i];
6923 code = MUTEX_TRYENTER(&call->lock);
6926 result = rxi_CheckCall(call, 1);
6927 MUTEX_EXIT(&call->lock);
6929 /* If CheckCall freed the call, it might
6930 * have destroyed the connection as well,
6931 * which screws up the linked lists.
6937 if (conn->type == RX_SERVER_CONNECTION) {
6938 /* This only actually destroys the connection if
6939 * there are no outstanding calls */
6940 MUTEX_ENTER(&conn->conn_data_lock);
6941 MUTEX_ENTER(&rx_refcnt_mutex);
6942 if (!havecalls && !conn->refCount
6943 && ((conn->lastSendTime + rx_idleConnectionTime) <
6945 conn->refCount++; /* it will be decr in rx_DestroyConn */
6946 MUTEX_EXIT(&rx_refcnt_mutex);
6947 MUTEX_EXIT(&conn->conn_data_lock);
6948 #ifdef RX_ENABLE_LOCKS
6949 rxi_DestroyConnectionNoLock(conn);
6950 #else /* RX_ENABLE_LOCKS */
6951 rxi_DestroyConnection(conn);
6952 #endif /* RX_ENABLE_LOCKS */
6954 #ifdef RX_ENABLE_LOCKS
6956 MUTEX_EXIT(&rx_refcnt_mutex);
6957 MUTEX_EXIT(&conn->conn_data_lock);
6959 #endif /* RX_ENABLE_LOCKS */
6963 #ifdef RX_ENABLE_LOCKS
6964 while (rx_connCleanup_list) {
6965 struct rx_connection *conn;
6966 conn = rx_connCleanup_list;
6967 rx_connCleanup_list = rx_connCleanup_list->next;
6968 MUTEX_EXIT(&rx_connHashTable_lock);
6969 rxi_CleanupConnection(conn);
6970 MUTEX_ENTER(&rx_connHashTable_lock);
6972 MUTEX_EXIT(&rx_connHashTable_lock);
6973 #endif /* RX_ENABLE_LOCKS */
6976 /* Find any peer structures that haven't been used (haven't had an
6977 * associated connection) for greater than rx_idlePeerTime */
6979 struct rx_peer **peer_ptr, **peer_end;
6983 * Why do we need to hold the rx_peerHashTable_lock across
6984 * the incrementing of peer_ptr since the rx_peerHashTable
6985 * array is not changing? We don't.
6987 * By dropping the lock periodically we can permit other
6988 * activities to be performed while a rxi_ReapConnections
6989 * call is in progress. The goal of reap connections
6990 * is to clean up quickly without causing large amounts
6991 * of contention. Therefore, it is important that global
6992 * mutexes not be held for extended periods of time.
6994 for (peer_ptr = &rx_peerHashTable[0], peer_end =
6995 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
6997 struct rx_peer *peer, *next, *prev;
6999 MUTEX_ENTER(&rx_peerHashTable_lock);
7000 for (prev = peer = *peer_ptr; peer; peer = next) {
7002 code = MUTEX_TRYENTER(&peer->peer_lock);
7003 if ((code) && (peer->refCount == 0)
7004 && ((peer->idleWhen + rx_idlePeerTime) < now.sec)) {
7005 struct opr_queue *cursor, *store;
7009 * now know that this peer object is one to be
7010 * removed from the hash table. Once it is removed
7011 * it can't be referenced by other threads.
7012 * Lets remove it first and decrement the struct
7013 * nPeerStructs count.
7015 if (peer == *peer_ptr) {
7021 if (rx_stats_active)
7022 rx_atomic_dec(&rx_stats.nPeerStructs);
7025 * Now if we hold references on 'prev' and 'next'
7026 * we can safely drop the rx_peerHashTable_lock
7027 * while we destroy this 'peer' object.
7033 MUTEX_EXIT(&rx_peerHashTable_lock);
7035 MUTEX_EXIT(&peer->peer_lock);
7036 MUTEX_DESTROY(&peer->peer_lock);
7038 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
7039 unsigned int num_funcs;
7040 struct rx_interface_stat *rpc_stat
7041 = opr_queue_Entry(cursor, struct rx_interface_stat,
7046 opr_queue_Remove(&rpc_stat->entry);
7047 opr_queue_Remove(&rpc_stat->entryPeers);
7049 num_funcs = rpc_stat->stats[0].func_total;
7051 sizeof(rx_interface_stat_t) +
7052 rpc_stat->stats[0].func_total *
7053 sizeof(rx_function_entry_v1_t);
7055 rxi_Free(rpc_stat, space);
7057 MUTEX_ENTER(&rx_rpc_stats);
7058 rxi_rpc_peer_stat_cnt -= num_funcs;
7059 MUTEX_EXIT(&rx_rpc_stats);
7064 * Regain the rx_peerHashTable_lock and
7065 * decrement the reference count on 'prev'
7068 MUTEX_ENTER(&rx_peerHashTable_lock);
7075 MUTEX_EXIT(&peer->peer_lock);
7080 MUTEX_EXIT(&rx_peerHashTable_lock);
7084 /* THIS HACK IS A TEMPORARY HACK. The idea is that the race condition in
7085 * rxi_AllocSendPacket, if it hits, will be handled at the next conn
7086 * GC, just below. Really, we shouldn't have to keep moving packets from
7087 * one place to another, but instead ought to always know if we can
7088 * afford to hold onto a packet in its particular use. */
7089 MUTEX_ENTER(&rx_freePktQ_lock);
7090 if (rx_waitingForPackets) {
7091 rx_waitingForPackets = 0;
7092 #ifdef RX_ENABLE_LOCKS
7093 CV_BROADCAST(&rx_waitingForPackets_cv);
7095 osi_rxWakeup(&rx_waitingForPackets);
7098 MUTEX_EXIT(&rx_freePktQ_lock);
7101 when.sec += RX_REAP_TIME; /* Check every RX_REAP_TIME seconds */
7102 event = rxevent_Post(&when, &now, rxi_ReapConnections, 0, NULL, 0);
7103 rxevent_Put(&event);
7107 /* rxs_Release - This isn't strictly necessary but, since the macro name from
7108 * rx.h is sort of strange this is better. This is called with a security
7109 * object before it is discarded. Each connection using a security object has
7110 * its own refcount to the object so it won't actually be freed until the last
7111 * connection is destroyed.
7113 * This is the only rxs module call. A hold could also be written but no one
7117 rxs_Release(struct rx_securityClass *aobj)
7119 return RXS_Close(aobj);
7127 #define TRACE_OPTION_RX_DEBUG 16
7135 code = RegOpenKeyEx(HKEY_LOCAL_MACHINE, AFSREG_CLT_SVC_PARAM_SUBKEY,
7136 0, KEY_QUERY_VALUE, &parmKey);
7137 if (code != ERROR_SUCCESS)
7140 dummyLen = sizeof(TraceOption);
7141 code = RegQueryValueEx(parmKey, "TraceOption", NULL, NULL,
7142 (BYTE *) &TraceOption, &dummyLen);
7143 if (code == ERROR_SUCCESS) {
7144 rxdebug_active = (TraceOption & TRACE_OPTION_RX_DEBUG) ? 1 : 0;
7146 RegCloseKey (parmKey);
7147 #endif /* AFS_NT40_ENV */
7152 rx_DebugOnOff(int on)
7156 rxdebug_active = on;
7162 rx_StatsOnOff(int on)
7164 rx_stats_active = on;
7168 /* Don't call this debugging routine directly; use dpf */
7170 rxi_DebugPrint(char *format, ...)
7179 va_start(ap, format);
7181 len = _snprintf(tformat, sizeof(tformat), "tid[%d] %s", GetCurrentThreadId(), format);
7184 len = _vsnprintf(msg, sizeof(msg)-2, tformat, ap);
7186 OutputDebugString(msg);
7192 va_start(ap, format);
7194 clock_GetTime(&now);
7195 fprintf(rx_Log, " %d.%06d:", (unsigned int)now.sec,
7196 (unsigned int)now.usec);
7197 vfprintf(rx_Log, format, ap);
7205 * This function is used to process the rx_stats structure that is local
7206 * to a process as well as an rx_stats structure received from a remote
7207 * process (via rxdebug). Therefore, it needs to do minimal version
7211 rx_PrintTheseStats(FILE * file, struct rx_statistics *s, int size,
7212 afs_int32 freePackets, char version)
7216 if (size != sizeof(struct rx_statistics)) {
7218 "Unexpected size of stats structure: was %d, expected %" AFS_SIZET_FMT "\n",
7219 size, sizeof(struct rx_statistics));
7222 fprintf(file, "rx stats: free packets %d, allocs %d, ", (int)freePackets,
7225 if (version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7226 fprintf(file, "alloc-failures(rcv %u/%u,send %u/%u,ack %u)\n",
7227 s->receivePktAllocFailures, s->receiveCbufPktAllocFailures,
7228 s->sendPktAllocFailures, s->sendCbufPktAllocFailures,
7229 s->specialPktAllocFailures);
7231 fprintf(file, "alloc-failures(rcv %u,send %u,ack %u)\n",
7232 s->receivePktAllocFailures, s->sendPktAllocFailures,
7233 s->specialPktAllocFailures);
7237 " greedy %u, " "bogusReads %u (last from host %x), "
7238 "noPackets %u, " "noBuffers %u, " "selects %u, "
7239 "sendSelects %u\n", s->socketGreedy, s->bogusPacketOnRead,
7240 s->bogusHost, s->noPacketOnRead, s->noPacketBuffersOnRead,
7241 s->selects, s->sendSelects);
7243 fprintf(file, " packets read: ");
7244 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7245 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsRead[i]);
7247 fprintf(file, "\n");
7250 " other read counters: data %u, " "ack %u, " "dup %u "
7251 "spurious %u " "dally %u\n", s->dataPacketsRead,
7252 s->ackPacketsRead, s->dupPacketsRead, s->spuriousPacketsRead,
7253 s->ignorePacketDally);
7255 fprintf(file, " packets sent: ");
7256 for (i = 0; i < RX_N_PACKET_TYPES; i++) {
7257 fprintf(file, "%s %u ", rx_packetTypes[i], s->packetsSent[i]);
7259 fprintf(file, "\n");
7262 " other send counters: ack %u, " "data %u (not resends), "
7263 "resends %u, " "pushed %u, " "acked&ignored %u\n",
7264 s->ackPacketsSent, s->dataPacketsSent, s->dataPacketsReSent,
7265 s->dataPacketsPushed, s->ignoreAckedPacket);
7268 " \t(these should be small) sendFailed %u, " "fatalErrors %u\n",
7269 s->netSendFailures, (int)s->fatalErrors);
7271 if (s->nRttSamples) {
7272 fprintf(file, " Average rtt is %0.3f, with %d samples\n",
7273 clock_Float(&s->totalRtt) / s->nRttSamples, s->nRttSamples);
7275 fprintf(file, " Minimum rtt is %0.3f, maximum is %0.3f\n",
7276 clock_Float(&s->minRtt), clock_Float(&s->maxRtt));
7280 " %d server connections, " "%d client connections, "
7281 "%d peer structs, " "%d call structs, " "%d free call structs\n",
7282 s->nServerConns, s->nClientConns, s->nPeerStructs,
7283 s->nCallStructs, s->nFreeCallStructs);
7285 #if !defined(AFS_PTHREAD_ENV) && !defined(AFS_USE_GETTIMEOFDAY)
7286 fprintf(file, " %d clock updates\n", clock_nUpdates);
7290 /* for backward compatibility */
7292 rx_PrintStats(FILE * file)
7294 MUTEX_ENTER(&rx_stats_mutex);
7295 rx_PrintTheseStats(file, (struct rx_statistics *) &rx_stats,
7296 sizeof(rx_stats), rx_nFreePackets,
7298 MUTEX_EXIT(&rx_stats_mutex);
7302 rx_PrintPeerStats(FILE * file, struct rx_peer *peer)
7304 fprintf(file, "Peer %x.%d.\n",
7305 ntohl(peer->host), (int)ntohs(peer->port));
7308 " Rtt %d, " "total sent %d, " "resent %d\n",
7309 peer->rtt, peer->nSent, peer->reSends);
7311 fprintf(file, " Packet size %d\n", peer->ifMTU);
7315 #if defined(AFS_PTHREAD_ENV) && defined(RXDEBUG)
7317 * This mutex protects the following static variables:
7321 #define LOCK_RX_DEBUG MUTEX_ENTER(&rx_debug_mutex)
7322 #define UNLOCK_RX_DEBUG MUTEX_EXIT(&rx_debug_mutex)
7324 #define LOCK_RX_DEBUG
7325 #define UNLOCK_RX_DEBUG
7326 #endif /* AFS_PTHREAD_ENV */
7328 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7330 MakeDebugCall(osi_socket socket, afs_uint32 remoteAddr, afs_uint16 remotePort,
7331 u_char type, void *inputData, size_t inputLength,
7332 void *outputData, size_t outputLength)
7334 static afs_int32 counter = 100;
7335 time_t waitTime, waitCount;
7336 struct rx_header theader;
7339 struct timeval tv_now, tv_wake, tv_delta;
7340 struct sockaddr_in taddr, faddr;
7354 tp = &tbuffer[sizeof(struct rx_header)];
7355 taddr.sin_family = AF_INET;
7356 taddr.sin_port = remotePort;
7357 taddr.sin_addr.s_addr = remoteAddr;
7358 memset(&taddr.sin_zero, 0, sizeof(taddr.sin_zero));
7359 #ifdef STRUCT_SOCKADDR_HAS_SA_LEN
7360 taddr.sin_len = sizeof(struct sockaddr_in);
7363 memset(&theader, 0, sizeof(theader));
7364 theader.epoch = htonl(999);
7366 theader.callNumber = htonl(counter);
7369 theader.type = type;
7370 theader.flags = RX_CLIENT_INITIATED | RX_LAST_PACKET;
7371 theader.serviceId = 0;
7373 memcpy(tbuffer, &theader, sizeof(theader));
7374 memcpy(tp, inputData, inputLength);
7376 sendto(socket, tbuffer, inputLength + sizeof(struct rx_header), 0,
7377 (struct sockaddr *)&taddr, sizeof(struct sockaddr_in));
7379 /* see if there's a packet available */
7380 gettimeofday(&tv_wake, NULL);
7381 tv_wake.tv_sec += waitTime;
7384 FD_SET(socket, &imask);
7385 tv_delta.tv_sec = tv_wake.tv_sec;
7386 tv_delta.tv_usec = tv_wake.tv_usec;
7387 gettimeofday(&tv_now, NULL);
7389 if (tv_delta.tv_usec < tv_now.tv_usec) {
7391 tv_delta.tv_usec += 1000000;
7394 tv_delta.tv_usec -= tv_now.tv_usec;
7396 if (tv_delta.tv_sec < tv_now.tv_sec) {
7400 tv_delta.tv_sec -= tv_now.tv_sec;
7403 code = select(0, &imask, 0, 0, &tv_delta);
7404 #else /* AFS_NT40_ENV */
7405 code = select(socket + 1, &imask, 0, 0, &tv_delta);
7406 #endif /* AFS_NT40_ENV */
7407 if (code == 1 && FD_ISSET(socket, &imask)) {
7408 /* now receive a packet */
7409 faddrLen = sizeof(struct sockaddr_in);
7411 recvfrom(socket, tbuffer, sizeof(tbuffer), 0,
7412 (struct sockaddr *)&faddr, &faddrLen);
7415 memcpy(&theader, tbuffer, sizeof(struct rx_header));
7416 if (counter == ntohl(theader.callNumber))
7424 /* see if we've timed out */
7432 code -= sizeof(struct rx_header);
7433 if (code > outputLength)
7434 code = outputLength;
7435 memcpy(outputData, tp, code);
7438 #endif /* RXDEBUG */
7441 rx_GetServerDebug(osi_socket socket, afs_uint32 remoteAddr,
7442 afs_uint16 remotePort, struct rx_debugStats * stat,
7443 afs_uint32 * supportedValues)
7445 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7447 struct rx_debugIn in;
7449 *supportedValues = 0;
7450 in.type = htonl(RX_DEBUGI_GETSTATS);
7453 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7454 &in, sizeof(in), stat, sizeof(*stat));
7457 * If the call was successful, fixup the version and indicate
7458 * what contents of the stat structure are valid.
7459 * Also do net to host conversion of fields here.
7463 if (stat->version >= RX_DEBUGI_VERSION_W_SECSTATS) {
7464 *supportedValues |= RX_SERVER_DEBUG_SEC_STATS;
7466 if (stat->version >= RX_DEBUGI_VERSION_W_GETALLCONN) {
7467 *supportedValues |= RX_SERVER_DEBUG_ALL_CONN;
7469 if (stat->version >= RX_DEBUGI_VERSION_W_RXSTATS) {
7470 *supportedValues |= RX_SERVER_DEBUG_RX_STATS;
7472 if (stat->version >= RX_DEBUGI_VERSION_W_WAITERS) {
7473 *supportedValues |= RX_SERVER_DEBUG_WAITER_CNT;
7475 if (stat->version >= RX_DEBUGI_VERSION_W_IDLETHREADS) {
7476 *supportedValues |= RX_SERVER_DEBUG_IDLE_THREADS;
7478 if (stat->version >= RX_DEBUGI_VERSION_W_NEWPACKETTYPES) {
7479 *supportedValues |= RX_SERVER_DEBUG_NEW_PACKETS;
7481 if (stat->version >= RX_DEBUGI_VERSION_W_GETPEER) {
7482 *supportedValues |= RX_SERVER_DEBUG_ALL_PEER;
7484 if (stat->version >= RX_DEBUGI_VERSION_W_WAITED) {
7485 *supportedValues |= RX_SERVER_DEBUG_WAITED_CNT;
7487 if (stat->version >= RX_DEBUGI_VERSION_W_PACKETS) {
7488 *supportedValues |= RX_SERVER_DEBUG_PACKETS_CNT;
7490 stat->nFreePackets = ntohl(stat->nFreePackets);
7491 stat->packetReclaims = ntohl(stat->packetReclaims);
7492 stat->callsExecuted = ntohl(stat->callsExecuted);
7493 stat->nWaiting = ntohl(stat->nWaiting);
7494 stat->idleThreads = ntohl(stat->idleThreads);
7495 stat->nWaited = ntohl(stat->nWaited);
7496 stat->nPackets = ntohl(stat->nPackets);
7505 rx_GetServerStats(osi_socket socket, afs_uint32 remoteAddr,
7506 afs_uint16 remotePort, struct rx_statistics * stat,
7507 afs_uint32 * supportedValues)
7509 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7511 struct rx_debugIn in;
7512 afs_int32 *lp = (afs_int32 *) stat;
7516 * supportedValues is currently unused, but added to allow future
7517 * versioning of this function.
7520 *supportedValues = 0;
7521 in.type = htonl(RX_DEBUGI_RXSTATS);
7523 memset(stat, 0, sizeof(*stat));
7525 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7526 &in, sizeof(in), stat, sizeof(*stat));
7531 * Do net to host conversion here
7534 for (i = 0; i < sizeof(*stat) / sizeof(afs_int32); i++, lp++) {
7545 rx_GetServerVersion(osi_socket socket, afs_uint32 remoteAddr,
7546 afs_uint16 remotePort, size_t version_length,
7549 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7551 return MakeDebugCall(socket, remoteAddr, remotePort,
7552 RX_PACKET_TYPE_VERSION, a, 1, version,
7560 rx_GetServerConnections(osi_socket socket, afs_uint32 remoteAddr,
7561 afs_uint16 remotePort, afs_int32 * nextConnection,
7562 int allConnections, afs_uint32 debugSupportedValues,
7563 struct rx_debugConn * conn,
7564 afs_uint32 * supportedValues)
7566 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7568 struct rx_debugIn in;
7572 * supportedValues is currently unused, but added to allow future
7573 * versioning of this function.
7576 *supportedValues = 0;
7577 if (allConnections) {
7578 in.type = htonl(RX_DEBUGI_GETALLCONN);
7580 in.type = htonl(RX_DEBUGI_GETCONN);
7582 in.index = htonl(*nextConnection);
7583 memset(conn, 0, sizeof(*conn));
7585 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7586 &in, sizeof(in), conn, sizeof(*conn));
7589 *nextConnection += 1;
7592 * Convert old connection format to new structure.
7595 if (debugSupportedValues & RX_SERVER_DEBUG_OLD_CONN) {
7596 struct rx_debugConn_vL *vL = (struct rx_debugConn_vL *)conn;
7597 #define MOVEvL(a) (conn->a = vL->a)
7599 /* any old or unrecognized version... */
7600 for (i = 0; i < RX_MAXCALLS; i++) {
7601 MOVEvL(callState[i]);
7602 MOVEvL(callMode[i]);
7603 MOVEvL(callFlags[i]);
7604 MOVEvL(callOther[i]);
7606 if (debugSupportedValues & RX_SERVER_DEBUG_SEC_STATS) {
7607 MOVEvL(secStats.type);
7608 MOVEvL(secStats.level);
7609 MOVEvL(secStats.flags);
7610 MOVEvL(secStats.expires);
7611 MOVEvL(secStats.packetsReceived);
7612 MOVEvL(secStats.packetsSent);
7613 MOVEvL(secStats.bytesReceived);
7614 MOVEvL(secStats.bytesSent);
7619 * Do net to host conversion here
7621 * I don't convert host or port since we are most likely
7622 * going to want these in NBO.
7624 conn->cid = ntohl(conn->cid);
7625 conn->serial = ntohl(conn->serial);
7626 for (i = 0; i < RX_MAXCALLS; i++) {
7627 conn->callNumber[i] = ntohl(conn->callNumber[i]);
7629 conn->error = ntohl(conn->error);
7630 conn->secStats.flags = ntohl(conn->secStats.flags);
7631 conn->secStats.expires = ntohl(conn->secStats.expires);
7632 conn->secStats.packetsReceived =
7633 ntohl(conn->secStats.packetsReceived);
7634 conn->secStats.packetsSent = ntohl(conn->secStats.packetsSent);
7635 conn->secStats.bytesReceived = ntohl(conn->secStats.bytesReceived);
7636 conn->secStats.bytesSent = ntohl(conn->secStats.bytesSent);
7637 conn->epoch = ntohl(conn->epoch);
7638 conn->natMTU = ntohl(conn->natMTU);
7647 rx_GetServerPeers(osi_socket socket, afs_uint32 remoteAddr,
7648 afs_uint16 remotePort, afs_int32 * nextPeer,
7649 afs_uint32 debugSupportedValues, struct rx_debugPeer * peer,
7650 afs_uint32 * supportedValues)
7652 #if defined(RXDEBUG) || defined(MAKEDEBUGCALL)
7654 struct rx_debugIn in;
7657 * supportedValues is currently unused, but added to allow future
7658 * versioning of this function.
7661 *supportedValues = 0;
7662 in.type = htonl(RX_DEBUGI_GETPEER);
7663 in.index = htonl(*nextPeer);
7664 memset(peer, 0, sizeof(*peer));
7666 rc = MakeDebugCall(socket, remoteAddr, remotePort, RX_PACKET_TYPE_DEBUG,
7667 &in, sizeof(in), peer, sizeof(*peer));
7673 * Do net to host conversion here
7675 * I don't convert host or port since we are most likely
7676 * going to want these in NBO.
7678 peer->ifMTU = ntohs(peer->ifMTU);
7679 peer->idleWhen = ntohl(peer->idleWhen);
7680 peer->refCount = ntohs(peer->refCount);
7681 peer->rtt = ntohl(peer->rtt);
7682 peer->rtt_dev = ntohl(peer->rtt_dev);
7683 peer->timeout.sec = 0;
7684 peer->timeout.usec = 0;
7685 peer->nSent = ntohl(peer->nSent);
7686 peer->reSends = ntohl(peer->reSends);
7687 peer->natMTU = ntohs(peer->natMTU);
7688 peer->maxMTU = ntohs(peer->maxMTU);
7689 peer->maxDgramPackets = ntohs(peer->maxDgramPackets);
7690 peer->ifDgramPackets = ntohs(peer->ifDgramPackets);
7691 peer->MTU = ntohs(peer->MTU);
7692 peer->cwind = ntohs(peer->cwind);
7693 peer->nDgramPackets = ntohs(peer->nDgramPackets);
7694 peer->congestSeq = ntohs(peer->congestSeq);
7695 peer->bytesSent.high = ntohl(peer->bytesSent.high);
7696 peer->bytesSent.low = ntohl(peer->bytesSent.low);
7697 peer->bytesReceived.high = ntohl(peer->bytesReceived.high);
7698 peer->bytesReceived.low = ntohl(peer->bytesReceived.low);
7707 rx_GetLocalPeers(afs_uint32 peerHost, afs_uint16 peerPort,
7708 struct rx_debugPeer * peerStats)
7711 afs_int32 error = 1; /* default to "did not succeed" */
7712 afs_uint32 hashValue = PEER_HASH(peerHost, peerPort);
7714 MUTEX_ENTER(&rx_peerHashTable_lock);
7715 for(tp = rx_peerHashTable[hashValue];
7716 tp != NULL; tp = tp->next) {
7717 if (tp->host == peerHost)
7723 MUTEX_EXIT(&rx_peerHashTable_lock);
7727 MUTEX_ENTER(&tp->peer_lock);
7728 peerStats->host = tp->host;
7729 peerStats->port = tp->port;
7730 peerStats->ifMTU = tp->ifMTU;
7731 peerStats->idleWhen = tp->idleWhen;
7732 peerStats->refCount = tp->refCount;
7733 peerStats->burstSize = 0;
7734 peerStats->burst = 0;
7735 peerStats->burstWait.sec = 0;
7736 peerStats->burstWait.usec = 0;
7737 peerStats->rtt = tp->rtt;
7738 peerStats->rtt_dev = tp->rtt_dev;
7739 peerStats->timeout.sec = 0;
7740 peerStats->timeout.usec = 0;
7741 peerStats->nSent = tp->nSent;
7742 peerStats->reSends = tp->reSends;
7743 peerStats->natMTU = tp->natMTU;
7744 peerStats->maxMTU = tp->maxMTU;
7745 peerStats->maxDgramPackets = tp->maxDgramPackets;
7746 peerStats->ifDgramPackets = tp->ifDgramPackets;
7747 peerStats->MTU = tp->MTU;
7748 peerStats->cwind = tp->cwind;
7749 peerStats->nDgramPackets = tp->nDgramPackets;
7750 peerStats->congestSeq = tp->congestSeq;
7751 peerStats->bytesSent.high = tp->bytesSent >> 32;
7752 peerStats->bytesSent.low = tp->bytesSent & MAX_AFS_UINT32;
7753 peerStats->bytesReceived.high = tp->bytesReceived >> 32;
7754 peerStats->bytesReceived.low
7755 = tp->bytesReceived & MAX_AFS_UINT32;
7756 MUTEX_EXIT(&tp->peer_lock);
7758 MUTEX_ENTER(&rx_peerHashTable_lock);
7761 MUTEX_EXIT(&rx_peerHashTable_lock);
7769 struct rx_serverQueueEntry *np;
7772 struct rx_call *call;
7773 struct rx_serverQueueEntry *sq;
7776 if (rx_atomic_test_and_set_bit(&rxinit_status, 0))
7777 return; /* Already shutdown. */
7781 #ifndef AFS_PTHREAD_ENV
7782 FD_ZERO(&rx_selectMask);
7783 #endif /* AFS_PTHREAD_ENV */
7784 rxi_dataQuota = RX_MAX_QUOTA;
7785 #ifndef AFS_PTHREAD_ENV
7787 #endif /* AFS_PTHREAD_ENV */
7790 #ifndef AFS_PTHREAD_ENV
7791 #ifndef AFS_USE_GETTIMEOFDAY
7793 #endif /* AFS_USE_GETTIMEOFDAY */
7794 #endif /* AFS_PTHREAD_ENV */
7796 while (!opr_queue_IsEmpty(&rx_freeCallQueue)) {
7797 call = opr_queue_First(&rx_freeCallQueue, struct rx_call, entry);
7798 opr_queue_Remove(&call->entry);
7799 rxi_Free(call, sizeof(struct rx_call));
7802 while (!opr_queue_IsEmpty(&rx_idleServerQueue)) {
7803 sq = opr_queue_First(&rx_idleServerQueue, struct rx_serverQueueEntry,
7805 opr_queue_Remove(&sq->entry);
7810 struct rx_peer **peer_ptr, **peer_end;
7811 for (peer_ptr = &rx_peerHashTable[0], peer_end =
7812 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
7814 struct rx_peer *peer, *next;
7816 MUTEX_ENTER(&rx_peerHashTable_lock);
7817 for (peer = *peer_ptr; peer; peer = next) {
7818 struct opr_queue *cursor, *store;
7821 MUTEX_ENTER(&rx_rpc_stats);
7822 MUTEX_ENTER(&peer->peer_lock);
7823 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
7824 unsigned int num_funcs;
7825 struct rx_interface_stat *rpc_stat
7826 = opr_queue_Entry(cursor, struct rx_interface_stat,
7830 opr_queue_Remove(&rpc_stat->entry);
7831 opr_queue_Remove(&rpc_stat->entryPeers);
7832 num_funcs = rpc_stat->stats[0].func_total;
7834 sizeof(rx_interface_stat_t) +
7835 rpc_stat->stats[0].func_total *
7836 sizeof(rx_function_entry_v1_t);
7838 rxi_Free(rpc_stat, space);
7840 /* rx_rpc_stats must be held */
7841 rxi_rpc_peer_stat_cnt -= num_funcs;
7843 MUTEX_EXIT(&peer->peer_lock);
7844 MUTEX_EXIT(&rx_rpc_stats);
7848 if (rx_stats_active)
7849 rx_atomic_dec(&rx_stats.nPeerStructs);
7851 MUTEX_EXIT(&rx_peerHashTable_lock);
7854 for (i = 0; i < RX_MAX_SERVICES; i++) {
7856 rxi_Free(rx_services[i], sizeof(*rx_services[i]));
7858 for (i = 0; i < rx_hashTableSize; i++) {
7859 struct rx_connection *tc, *ntc;
7860 MUTEX_ENTER(&rx_connHashTable_lock);
7861 for (tc = rx_connHashTable[i]; tc; tc = ntc) {
7863 for (j = 0; j < RX_MAXCALLS; j++) {
7865 rxi_Free(tc->call[j], sizeof(*tc->call[j]));
7868 rxi_Free(tc, sizeof(*tc));
7870 MUTEX_EXIT(&rx_connHashTable_lock);
7873 MUTEX_ENTER(&freeSQEList_lock);
7875 while ((np = rx_FreeSQEList)) {
7876 rx_FreeSQEList = *(struct rx_serverQueueEntry **)np;
7877 MUTEX_DESTROY(&np->lock);
7878 rxi_Free(np, sizeof(*np));
7881 MUTEX_EXIT(&freeSQEList_lock);
7882 MUTEX_DESTROY(&freeSQEList_lock);
7883 MUTEX_DESTROY(&rx_freeCallQueue_lock);
7884 MUTEX_DESTROY(&rx_connHashTable_lock);
7885 MUTEX_DESTROY(&rx_peerHashTable_lock);
7886 MUTEX_DESTROY(&rx_serverPool_lock);
7888 osi_Free(rx_connHashTable,
7889 rx_hashTableSize * sizeof(struct rx_connection *));
7890 osi_Free(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
7892 UNPIN(rx_connHashTable,
7893 rx_hashTableSize * sizeof(struct rx_connection *));
7894 UNPIN(rx_peerHashTable, rx_hashTableSize * sizeof(struct rx_peer *));
7896 MUTEX_ENTER(&rx_quota_mutex);
7897 rxi_dataQuota = RX_MAX_QUOTA;
7898 rxi_availProcs = rxi_totalMin = rxi_minDeficit = 0;
7899 MUTEX_EXIT(&rx_quota_mutex);
7905 * Routines to implement connection specific data.
7909 rx_KeyCreate(rx_destructor_t rtn)
7912 MUTEX_ENTER(&rxi_keyCreate_lock);
7913 key = rxi_keyCreate_counter++;
7914 rxi_keyCreate_destructor = (rx_destructor_t *)
7915 realloc((void *)rxi_keyCreate_destructor,
7916 (key + 1) * sizeof(rx_destructor_t));
7917 rxi_keyCreate_destructor[key] = rtn;
7918 MUTEX_EXIT(&rxi_keyCreate_lock);
7923 rx_SetSpecific(struct rx_connection *conn, int key, void *ptr)
7926 MUTEX_ENTER(&conn->conn_data_lock);
7927 if (!conn->specific) {
7928 conn->specific = malloc((key + 1) * sizeof(void *));
7929 for (i = 0; i < key; i++)
7930 conn->specific[i] = NULL;
7931 conn->nSpecific = key + 1;
7932 conn->specific[key] = ptr;
7933 } else if (key >= conn->nSpecific) {
7934 conn->specific = (void **)
7935 realloc(conn->specific, (key + 1) * sizeof(void *));
7936 for (i = conn->nSpecific; i < key; i++)
7937 conn->specific[i] = NULL;
7938 conn->nSpecific = key + 1;
7939 conn->specific[key] = ptr;
7941 if (conn->specific[key] && rxi_keyCreate_destructor[key])
7942 (*rxi_keyCreate_destructor[key]) (conn->specific[key]);
7943 conn->specific[key] = ptr;
7945 MUTEX_EXIT(&conn->conn_data_lock);
7949 rx_SetServiceSpecific(struct rx_service *svc, int key, void *ptr)
7952 MUTEX_ENTER(&svc->svc_data_lock);
7953 if (!svc->specific) {
7954 svc->specific = malloc((key + 1) * sizeof(void *));
7955 for (i = 0; i < key; i++)
7956 svc->specific[i] = NULL;
7957 svc->nSpecific = key + 1;
7958 svc->specific[key] = ptr;
7959 } else if (key >= svc->nSpecific) {
7960 svc->specific = (void **)
7961 realloc(svc->specific, (key + 1) * sizeof(void *));
7962 for (i = svc->nSpecific; i < key; i++)
7963 svc->specific[i] = NULL;
7964 svc->nSpecific = key + 1;
7965 svc->specific[key] = ptr;
7967 if (svc->specific[key] && rxi_keyCreate_destructor[key])
7968 (*rxi_keyCreate_destructor[key]) (svc->specific[key]);
7969 svc->specific[key] = ptr;
7971 MUTEX_EXIT(&svc->svc_data_lock);
7975 rx_GetSpecific(struct rx_connection *conn, int key)
7978 MUTEX_ENTER(&conn->conn_data_lock);
7979 if (key >= conn->nSpecific)
7982 ptr = conn->specific[key];
7983 MUTEX_EXIT(&conn->conn_data_lock);
7988 rx_GetServiceSpecific(struct rx_service *svc, int key)
7991 MUTEX_ENTER(&svc->svc_data_lock);
7992 if (key >= svc->nSpecific)
7995 ptr = svc->specific[key];
7996 MUTEX_EXIT(&svc->svc_data_lock);
8001 #endif /* !KERNEL */
8004 * processStats is a queue used to store the statistics for the local
8005 * process. Its contents are similar to the contents of the rpcStats
8006 * queue on a rx_peer structure, but the actual data stored within
8007 * this queue contains totals across the lifetime of the process (assuming
8008 * the stats have not been reset) - unlike the per peer structures
8009 * which can come and go based upon the peer lifetime.
8012 static struct opr_queue processStats = { &processStats, &processStats };
8015 * peerStats is a queue used to store the statistics for all peer structs.
8016 * Its contents are the union of all the peer rpcStats queues.
8019 static struct opr_queue peerStats = { &peerStats, &peerStats };
8022 * rxi_monitor_processStats is used to turn process wide stat collection
8026 static int rxi_monitor_processStats = 0;
8029 * rxi_monitor_peerStats is used to turn per peer stat collection on and off
8032 static int rxi_monitor_peerStats = 0;
8036 rxi_ClearRPCOpStat(rx_function_entry_v1_p rpc_stat)
8038 rpc_stat->invocations = 0;
8039 rpc_stat->bytes_sent = 0;
8040 rpc_stat->bytes_rcvd = 0;
8041 rpc_stat->queue_time_sum.sec = 0;
8042 rpc_stat->queue_time_sum.usec = 0;
8043 rpc_stat->queue_time_sum_sqr.sec = 0;
8044 rpc_stat->queue_time_sum_sqr.usec = 0;
8045 rpc_stat->queue_time_min.sec = 9999999;
8046 rpc_stat->queue_time_min.usec = 9999999;
8047 rpc_stat->queue_time_max.sec = 0;
8048 rpc_stat->queue_time_max.usec = 0;
8049 rpc_stat->execution_time_sum.sec = 0;
8050 rpc_stat->execution_time_sum.usec = 0;
8051 rpc_stat->execution_time_sum_sqr.sec = 0;
8052 rpc_stat->execution_time_sum_sqr.usec = 0;
8053 rpc_stat->execution_time_min.sec = 9999999;
8054 rpc_stat->execution_time_min.usec = 9999999;
8055 rpc_stat->execution_time_max.sec = 0;
8056 rpc_stat->execution_time_max.usec = 0;
8060 * Given all of the information for a particular rpc
8061 * call, find or create (if requested) the stat structure for the rpc.
8064 * the queue of stats that will be updated with the new value
8066 * @param rxInterface
8067 * a unique number that identifies the rpc interface
8070 * the total number of functions in this interface. this is only
8071 * required if create is true
8074 * if true, this invocation was made to a server
8077 * the ip address of the remote host. this is only required if create
8078 * and addToPeerList are true
8081 * the port of the remote host. this is only required if create
8082 * and addToPeerList are true
8084 * @param addToPeerList
8085 * if != 0, add newly created stat to the global peer list
8088 * if a new stats structure is allocated, the counter will
8089 * be updated with the new number of allocated stat structures.
8090 * only required if create is true
8093 * if no stats structure exists, allocate one
8097 static rx_interface_stat_p
8098 rxi_FindRpcStat(struct opr_queue *stats, afs_uint32 rxInterface,
8099 afs_uint32 totalFunc, int isServer, afs_uint32 remoteHost,
8100 afs_uint32 remotePort, int addToPeerList,
8101 unsigned int *counter, int create)
8103 rx_interface_stat_p rpc_stat = NULL;
8104 struct opr_queue *cursor;
8107 * See if there's already a structure for this interface
8110 for (opr_queue_Scan(stats, cursor)) {
8111 rpc_stat = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8113 if ((rpc_stat->stats[0].interfaceId == rxInterface)
8114 && (rpc_stat->stats[0].remote_is_server == isServer))
8118 /* if they didn't ask us to create, we're done */
8120 if (opr_queue_IsEnd(stats, cursor))
8126 /* can't proceed without these */
8127 if (!totalFunc || !counter)
8131 * Didn't find a match so allocate a new structure and add it to the
8135 if (opr_queue_IsEnd(stats, cursor) || (rpc_stat == NULL)
8136 || (rpc_stat->stats[0].interfaceId != rxInterface)
8137 || (rpc_stat->stats[0].remote_is_server != isServer)) {
8142 sizeof(rx_interface_stat_t) +
8143 totalFunc * sizeof(rx_function_entry_v1_t);
8145 rpc_stat = rxi_Alloc(space);
8146 if (rpc_stat == NULL)
8149 *counter += totalFunc;
8150 for (i = 0; i < totalFunc; i++) {
8151 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8152 rpc_stat->stats[i].remote_peer = remoteHost;
8153 rpc_stat->stats[i].remote_port = remotePort;
8154 rpc_stat->stats[i].remote_is_server = isServer;
8155 rpc_stat->stats[i].interfaceId = rxInterface;
8156 rpc_stat->stats[i].func_total = totalFunc;
8157 rpc_stat->stats[i].func_index = i;
8159 opr_queue_Prepend(stats, &rpc_stat->entry);
8160 if (addToPeerList) {
8161 opr_queue_Prepend(&peerStats, &rpc_stat->entryPeers);
8168 rx_ClearProcessRPCStats(afs_int32 rxInterface)
8170 rx_interface_stat_p rpc_stat;
8173 if (rxInterface == -1)
8176 MUTEX_ENTER(&rx_rpc_stats);
8177 rpc_stat = rxi_FindRpcStat(&processStats, rxInterface, 0, 0,
8180 totalFunc = rpc_stat->stats[0].func_total;
8181 for (i = 0; i < totalFunc; i++)
8182 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8184 MUTEX_EXIT(&rx_rpc_stats);
8189 rx_ClearPeerRPCStats(afs_int32 rxInterface, afs_uint32 peerHost, afs_uint16 peerPort)
8191 rx_interface_stat_p rpc_stat;
8193 struct rx_peer * peer;
8195 if (rxInterface == -1)
8198 peer = rxi_FindPeer(peerHost, peerPort, 0);
8202 MUTEX_ENTER(&rx_rpc_stats);
8203 rpc_stat = rxi_FindRpcStat(&peer->rpcStats, rxInterface, 0, 1,
8206 totalFunc = rpc_stat->stats[0].func_total;
8207 for (i = 0; i < totalFunc; i++)
8208 rxi_ClearRPCOpStat(&(rpc_stat->stats[i]));
8210 MUTEX_EXIT(&rx_rpc_stats);
8215 rx_CopyProcessRPCStats(afs_uint64 op)
8217 rx_interface_stat_p rpc_stat;
8218 rx_function_entry_v1_p rpcop_stat =
8219 rxi_Alloc(sizeof(rx_function_entry_v1_t));
8220 int currentFunc = (op & MAX_AFS_UINT32);
8221 afs_int32 rxInterface = (op >> 32);
8223 if (!rxi_monitor_processStats)
8226 if (rxInterface == -1)
8229 if (rpcop_stat == NULL)
8232 MUTEX_ENTER(&rx_rpc_stats);
8233 rpc_stat = rxi_FindRpcStat(&processStats, rxInterface, 0, 0,
8236 memcpy(rpcop_stat, &(rpc_stat->stats[currentFunc]),
8237 sizeof(rx_function_entry_v1_t));
8238 MUTEX_EXIT(&rx_rpc_stats);
8240 rxi_Free(rpcop_stat, sizeof(rx_function_entry_v1_t));
8247 rx_CopyPeerRPCStats(afs_uint64 op, afs_uint32 peerHost, afs_uint16 peerPort)
8249 rx_interface_stat_p rpc_stat;
8250 rx_function_entry_v1_p rpcop_stat =
8251 rxi_Alloc(sizeof(rx_function_entry_v1_t));
8252 int currentFunc = (op & MAX_AFS_UINT32);
8253 afs_int32 rxInterface = (op >> 32);
8254 struct rx_peer *peer;
8256 if (!rxi_monitor_peerStats)
8259 if (rxInterface == -1)
8262 if (rpcop_stat == NULL)
8265 peer = rxi_FindPeer(peerHost, peerPort, 0);
8269 MUTEX_ENTER(&rx_rpc_stats);
8270 rpc_stat = rxi_FindRpcStat(&peer->rpcStats, rxInterface, 0, 1,
8273 memcpy(rpcop_stat, &(rpc_stat->stats[currentFunc]),
8274 sizeof(rx_function_entry_v1_t));
8275 MUTEX_EXIT(&rx_rpc_stats);
8277 rxi_Free(rpcop_stat, sizeof(rx_function_entry_v1_t));
8284 rx_ReleaseRPCStats(void *stats)
8287 rxi_Free(stats, sizeof(rx_function_entry_v1_t));
8291 * Given all of the information for a particular rpc
8292 * call, create (if needed) and update the stat totals for the rpc.
8295 * the queue of stats that will be updated with the new value
8297 * @param rxInterface
8298 * a unique number that identifies the rpc interface
8300 * @param currentFunc
8301 * the index of the function being invoked
8304 * the total number of functions in this interface
8307 * the amount of time this function waited for a thread
8310 * the amount of time this function invocation took to execute
8313 * the number bytes sent by this invocation
8316 * the number bytes received by this invocation
8319 * if true, this invocation was made to a server
8322 * the ip address of the remote host
8325 * the port of the remote host
8327 * @param addToPeerList
8328 * if != 0, add newly created stat to the global peer list
8331 * if a new stats structure is allocated, the counter will
8332 * be updated with the new number of allocated stat structures
8337 rxi_AddRpcStat(struct opr_queue *stats, afs_uint32 rxInterface,
8338 afs_uint32 currentFunc, afs_uint32 totalFunc,
8339 struct clock *queueTime, struct clock *execTime,
8340 afs_uint64 bytesSent, afs_uint64 bytesRcvd, int isServer,
8341 afs_uint32 remoteHost, afs_uint32 remotePort,
8342 int addToPeerList, unsigned int *counter)
8345 rx_interface_stat_p rpc_stat;
8347 rpc_stat = rxi_FindRpcStat(stats, rxInterface, totalFunc, isServer,
8348 remoteHost, remotePort, addToPeerList, counter,
8356 * Increment the stats for this function
8359 rpc_stat->stats[currentFunc].invocations++;
8360 rpc_stat->stats[currentFunc].bytes_sent += bytesSent;
8361 rpc_stat->stats[currentFunc].bytes_rcvd += bytesRcvd;
8362 clock_Add(&rpc_stat->stats[currentFunc].queue_time_sum, queueTime);
8363 clock_AddSq(&rpc_stat->stats[currentFunc].queue_time_sum_sqr, queueTime);
8364 if (clock_Lt(queueTime, &rpc_stat->stats[currentFunc].queue_time_min)) {
8365 rpc_stat->stats[currentFunc].queue_time_min = *queueTime;
8367 if (clock_Gt(queueTime, &rpc_stat->stats[currentFunc].queue_time_max)) {
8368 rpc_stat->stats[currentFunc].queue_time_max = *queueTime;
8370 clock_Add(&rpc_stat->stats[currentFunc].execution_time_sum, execTime);
8371 clock_AddSq(&rpc_stat->stats[currentFunc].execution_time_sum_sqr,
8373 if (clock_Lt(execTime, &rpc_stat->stats[currentFunc].execution_time_min)) {
8374 rpc_stat->stats[currentFunc].execution_time_min = *execTime;
8376 if (clock_Gt(execTime, &rpc_stat->stats[currentFunc].execution_time_max)) {
8377 rpc_stat->stats[currentFunc].execution_time_max = *execTime;
8385 rxi_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8386 afs_uint32 currentFunc, afs_uint32 totalFunc,
8387 struct clock *queueTime, struct clock *execTime,
8388 afs_uint64 bytesSent, afs_uint64 bytesRcvd,
8392 if (!(rxi_monitor_peerStats || rxi_monitor_processStats))
8395 MUTEX_ENTER(&rx_rpc_stats);
8397 if (rxi_monitor_peerStats) {
8398 MUTEX_ENTER(&peer->peer_lock);
8399 rxi_AddRpcStat(&peer->rpcStats, rxInterface, currentFunc, totalFunc,
8400 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8401 peer->host, peer->port, 1, &rxi_rpc_peer_stat_cnt);
8402 MUTEX_EXIT(&peer->peer_lock);
8405 if (rxi_monitor_processStats) {
8406 rxi_AddRpcStat(&processStats, rxInterface, currentFunc, totalFunc,
8407 queueTime, execTime, bytesSent, bytesRcvd, isServer,
8408 0xffffffff, 0xffffffff, 0, &rxi_rpc_process_stat_cnt);
8411 MUTEX_EXIT(&rx_rpc_stats);
8415 * Increment the times and count for a particular rpc function.
8417 * Traditionally this call was invoked from rxgen stubs. Modern stubs
8418 * call rx_RecordCallStatistics instead, so the public version of this
8419 * function is left purely for legacy callers.
8422 * The peer who invoked the rpc
8424 * @param rxInterface
8425 * A unique number that identifies the rpc interface
8427 * @param currentFunc
8428 * The index of the function being invoked
8431 * The total number of functions in this interface
8434 * The amount of time this function waited for a thread
8437 * The amount of time this function invocation took to execute
8440 * The number bytes sent by this invocation
8443 * The number bytes received by this invocation
8446 * If true, this invocation was made to a server
8450 rx_IncrementTimeAndCount(struct rx_peer *peer, afs_uint32 rxInterface,
8451 afs_uint32 currentFunc, afs_uint32 totalFunc,
8452 struct clock *queueTime, struct clock *execTime,
8453 afs_hyper_t * bytesSent, afs_hyper_t * bytesRcvd,
8459 sent64 = ((afs_uint64)bytesSent->high << 32) + bytesSent->low;
8460 rcvd64 = ((afs_uint64)bytesRcvd->high << 32) + bytesRcvd->low;
8462 rxi_IncrementTimeAndCount(peer, rxInterface, currentFunc, totalFunc,
8463 queueTime, execTime, sent64, rcvd64,
8470 * rx_MarshallProcessRPCStats - marshall an array of rpc statistics
8474 * IN callerVersion - the rpc stat version of the caller.
8476 * IN count - the number of entries to marshall.
8478 * IN stats - pointer to stats to be marshalled.
8480 * OUT ptr - Where to store the marshalled data.
8487 rx_MarshallProcessRPCStats(afs_uint32 callerVersion, int count,
8488 rx_function_entry_v1_t * stats, afs_uint32 ** ptrP)
8494 * We only support the first version
8496 for (ptr = *ptrP, i = 0; i < count; i++, stats++) {
8497 *(ptr++) = stats->remote_peer;
8498 *(ptr++) = stats->remote_port;
8499 *(ptr++) = stats->remote_is_server;
8500 *(ptr++) = stats->interfaceId;
8501 *(ptr++) = stats->func_total;
8502 *(ptr++) = stats->func_index;
8503 *(ptr++) = stats->invocations >> 32;
8504 *(ptr++) = stats->invocations & MAX_AFS_UINT32;
8505 *(ptr++) = stats->bytes_sent >> 32;
8506 *(ptr++) = stats->bytes_sent & MAX_AFS_UINT32;
8507 *(ptr++) = stats->bytes_rcvd >> 32;
8508 *(ptr++) = stats->bytes_rcvd & MAX_AFS_UINT32;
8509 *(ptr++) = stats->queue_time_sum.sec;
8510 *(ptr++) = stats->queue_time_sum.usec;
8511 *(ptr++) = stats->queue_time_sum_sqr.sec;
8512 *(ptr++) = stats->queue_time_sum_sqr.usec;
8513 *(ptr++) = stats->queue_time_min.sec;
8514 *(ptr++) = stats->queue_time_min.usec;
8515 *(ptr++) = stats->queue_time_max.sec;
8516 *(ptr++) = stats->queue_time_max.usec;
8517 *(ptr++) = stats->execution_time_sum.sec;
8518 *(ptr++) = stats->execution_time_sum.usec;
8519 *(ptr++) = stats->execution_time_sum_sqr.sec;
8520 *(ptr++) = stats->execution_time_sum_sqr.usec;
8521 *(ptr++) = stats->execution_time_min.sec;
8522 *(ptr++) = stats->execution_time_min.usec;
8523 *(ptr++) = stats->execution_time_max.sec;
8524 *(ptr++) = stats->execution_time_max.usec;
8530 * rx_RetrieveProcessRPCStats - retrieve all of the rpc statistics for
8535 * IN callerVersion - the rpc stat version of the caller
8537 * OUT myVersion - the rpc stat version of this function
8539 * OUT clock_sec - local time seconds
8541 * OUT clock_usec - local time microseconds
8543 * OUT allocSize - the number of bytes allocated to contain stats
8545 * OUT statCount - the number stats retrieved from this process.
8547 * OUT stats - the actual stats retrieved from this process.
8551 * Returns void. If successful, stats will != NULL.
8555 rx_RetrieveProcessRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8556 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8557 size_t * allocSize, afs_uint32 * statCount,
8558 afs_uint32 ** stats)
8568 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8571 * Check to see if stats are enabled
8574 MUTEX_ENTER(&rx_rpc_stats);
8575 if (!rxi_monitor_processStats) {
8576 MUTEX_EXIT(&rx_rpc_stats);
8580 clock_GetTime(&now);
8581 *clock_sec = now.sec;
8582 *clock_usec = now.usec;
8585 * Allocate the space based upon the caller version
8587 * If the client is at an older version than we are,
8588 * we return the statistic data in the older data format, but
8589 * we still return our version number so the client knows we
8590 * are maintaining more data than it can retrieve.
8593 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8594 space = rxi_rpc_process_stat_cnt * sizeof(rx_function_entry_v1_t);
8595 *statCount = rxi_rpc_process_stat_cnt;
8598 * This can't happen yet, but in the future version changes
8599 * can be handled by adding additional code here
8603 if (space > (size_t) 0) {
8605 ptr = *stats = rxi_Alloc(space);
8608 struct opr_queue *cursor;
8610 for (opr_queue_Scan(&processStats, cursor)) {
8611 struct rx_interface_stat *rpc_stat =
8612 opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8614 * Copy the data based upon the caller version
8616 rx_MarshallProcessRPCStats(callerVersion,
8617 rpc_stat->stats[0].func_total,
8618 rpc_stat->stats, &ptr);
8624 MUTEX_EXIT(&rx_rpc_stats);
8629 * rx_RetrievePeerRPCStats - retrieve all of the rpc statistics for the peers
8633 * IN callerVersion - the rpc stat version of the caller
8635 * OUT myVersion - the rpc stat version of this function
8637 * OUT clock_sec - local time seconds
8639 * OUT clock_usec - local time microseconds
8641 * OUT allocSize - the number of bytes allocated to contain stats
8643 * OUT statCount - the number of stats retrieved from the individual
8646 * OUT stats - the actual stats retrieved from the individual peer structures.
8650 * Returns void. If successful, stats will != NULL.
8654 rx_RetrievePeerRPCStats(afs_uint32 callerVersion, afs_uint32 * myVersion,
8655 afs_uint32 * clock_sec, afs_uint32 * clock_usec,
8656 size_t * allocSize, afs_uint32 * statCount,
8657 afs_uint32 ** stats)
8667 *myVersion = RX_STATS_RETRIEVAL_VERSION;
8670 * Check to see if stats are enabled
8673 MUTEX_ENTER(&rx_rpc_stats);
8674 if (!rxi_monitor_peerStats) {
8675 MUTEX_EXIT(&rx_rpc_stats);
8679 clock_GetTime(&now);
8680 *clock_sec = now.sec;
8681 *clock_usec = now.usec;
8684 * Allocate the space based upon the caller version
8686 * If the client is at an older version than we are,
8687 * we return the statistic data in the older data format, but
8688 * we still return our version number so the client knows we
8689 * are maintaining more data than it can retrieve.
8692 if (callerVersion >= RX_STATS_RETRIEVAL_FIRST_EDITION) {
8693 space = rxi_rpc_peer_stat_cnt * sizeof(rx_function_entry_v1_t);
8694 *statCount = rxi_rpc_peer_stat_cnt;
8697 * This can't happen yet, but in the future version changes
8698 * can be handled by adding additional code here
8702 if (space > (size_t) 0) {
8704 ptr = *stats = rxi_Alloc(space);
8707 struct opr_queue *cursor;
8709 for (opr_queue_Scan(&peerStats, cursor)) {
8710 struct rx_interface_stat *rpc_stat
8711 = opr_queue_Entry(cursor, struct rx_interface_stat,
8715 * Copy the data based upon the caller version
8717 rx_MarshallProcessRPCStats(callerVersion,
8718 rpc_stat->stats[0].func_total,
8719 rpc_stat->stats, &ptr);
8725 MUTEX_EXIT(&rx_rpc_stats);
8730 * rx_FreeRPCStats - free memory allocated by
8731 * rx_RetrieveProcessRPCStats and rx_RetrievePeerRPCStats
8735 * IN stats - stats previously returned by rx_RetrieveProcessRPCStats or
8736 * rx_RetrievePeerRPCStats
8738 * IN allocSize - the number of bytes in stats.
8746 rx_FreeRPCStats(afs_uint32 * stats, size_t allocSize)
8748 rxi_Free(stats, allocSize);
8752 * rx_queryProcessRPCStats - see if process rpc stat collection is
8753 * currently enabled.
8759 * Returns 0 if stats are not enabled != 0 otherwise
8763 rx_queryProcessRPCStats(void)
8766 MUTEX_ENTER(&rx_rpc_stats);
8767 rc = rxi_monitor_processStats;
8768 MUTEX_EXIT(&rx_rpc_stats);
8773 * rx_queryPeerRPCStats - see if peer stat collection is currently enabled.
8779 * Returns 0 if stats are not enabled != 0 otherwise
8783 rx_queryPeerRPCStats(void)
8786 MUTEX_ENTER(&rx_rpc_stats);
8787 rc = rxi_monitor_peerStats;
8788 MUTEX_EXIT(&rx_rpc_stats);
8793 * rx_enableProcessRPCStats - begin rpc stat collection for entire process
8803 rx_enableProcessRPCStats(void)
8805 MUTEX_ENTER(&rx_rpc_stats);
8806 rx_enable_stats = 1;
8807 rxi_monitor_processStats = 1;
8808 MUTEX_EXIT(&rx_rpc_stats);
8812 * rx_enablePeerRPCStats - begin rpc stat collection per peer structure
8822 rx_enablePeerRPCStats(void)
8824 MUTEX_ENTER(&rx_rpc_stats);
8825 rx_enable_stats = 1;
8826 rxi_monitor_peerStats = 1;
8827 MUTEX_EXIT(&rx_rpc_stats);
8831 * rx_disableProcessRPCStats - stop rpc stat collection for entire process
8841 rx_disableProcessRPCStats(void)
8843 struct opr_queue *cursor, *store;
8846 MUTEX_ENTER(&rx_rpc_stats);
8849 * Turn off process statistics and if peer stats is also off, turn
8853 rxi_monitor_processStats = 0;
8854 if (rxi_monitor_peerStats == 0) {
8855 rx_enable_stats = 0;
8858 for (opr_queue_ScanSafe(&processStats, cursor, store)) {
8859 unsigned int num_funcs = 0;
8860 struct rx_interface_stat *rpc_stat
8861 = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8863 opr_queue_Remove(&rpc_stat->entry);
8865 num_funcs = rpc_stat->stats[0].func_total;
8867 sizeof(rx_interface_stat_t) +
8868 rpc_stat->stats[0].func_total * sizeof(rx_function_entry_v1_t);
8870 rxi_Free(rpc_stat, space);
8871 rxi_rpc_process_stat_cnt -= num_funcs;
8873 MUTEX_EXIT(&rx_rpc_stats);
8877 * rx_disablePeerRPCStats - stop rpc stat collection for peers
8887 rx_disablePeerRPCStats(void)
8889 struct rx_peer **peer_ptr, **peer_end;
8893 * Turn off peer statistics and if process stats is also off, turn
8897 rxi_monitor_peerStats = 0;
8898 if (rxi_monitor_processStats == 0) {
8899 rx_enable_stats = 0;
8902 for (peer_ptr = &rx_peerHashTable[0], peer_end =
8903 &rx_peerHashTable[rx_hashTableSize]; peer_ptr < peer_end;
8905 struct rx_peer *peer, *next, *prev;
8907 MUTEX_ENTER(&rx_peerHashTable_lock);
8908 MUTEX_ENTER(&rx_rpc_stats);
8909 for (prev = peer = *peer_ptr; peer; peer = next) {
8911 code = MUTEX_TRYENTER(&peer->peer_lock);
8914 struct opr_queue *cursor, *store;
8916 if (prev == *peer_ptr) {
8927 MUTEX_EXIT(&rx_peerHashTable_lock);
8929 for (opr_queue_ScanSafe(&peer->rpcStats, cursor, store)) {
8930 unsigned int num_funcs = 0;
8931 struct rx_interface_stat *rpc_stat
8932 = opr_queue_Entry(cursor, struct rx_interface_stat,
8935 opr_queue_Remove(&rpc_stat->entry);
8936 opr_queue_Remove(&rpc_stat->entryPeers);
8937 num_funcs = rpc_stat->stats[0].func_total;
8939 sizeof(rx_interface_stat_t) +
8940 rpc_stat->stats[0].func_total *
8941 sizeof(rx_function_entry_v1_t);
8943 rxi_Free(rpc_stat, space);
8944 rxi_rpc_peer_stat_cnt -= num_funcs;
8946 MUTEX_EXIT(&peer->peer_lock);
8948 MUTEX_ENTER(&rx_peerHashTable_lock);
8958 MUTEX_EXIT(&rx_rpc_stats);
8959 MUTEX_EXIT(&rx_peerHashTable_lock);
8964 * rx_clearProcessRPCStats - clear the contents of the rpc stats according
8969 * IN clearFlag - flag indicating which stats to clear
8977 rx_clearProcessRPCStats(afs_uint32 clearFlag)
8979 struct opr_queue *cursor;
8981 MUTEX_ENTER(&rx_rpc_stats);
8983 for (opr_queue_Scan(&processStats, cursor)) {
8984 unsigned int num_funcs = 0, i;
8985 struct rx_interface_stat *rpc_stat
8986 = opr_queue_Entry(cursor, struct rx_interface_stat, entry);
8988 num_funcs = rpc_stat->stats[0].func_total;
8989 for (i = 0; i < num_funcs; i++) {
8990 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
8991 rpc_stat->stats[i].invocations = 0;
8993 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
8994 rpc_stat->stats[i].bytes_sent = 0;
8996 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
8997 rpc_stat->stats[i].bytes_rcvd = 0;
8999 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9000 rpc_stat->stats[i].queue_time_sum.sec = 0;
9001 rpc_stat->stats[i].queue_time_sum.usec = 0;
9003 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9004 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9005 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9007 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9008 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9009 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9011 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9012 rpc_stat->stats[i].queue_time_max.sec = 0;
9013 rpc_stat->stats[i].queue_time_max.usec = 0;
9015 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9016 rpc_stat->stats[i].execution_time_sum.sec = 0;
9017 rpc_stat->stats[i].execution_time_sum.usec = 0;
9019 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9020 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9021 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9023 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9024 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9025 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9027 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9028 rpc_stat->stats[i].execution_time_max.sec = 0;
9029 rpc_stat->stats[i].execution_time_max.usec = 0;
9034 MUTEX_EXIT(&rx_rpc_stats);
9038 * rx_clearPeerRPCStats - clear the contents of the rpc stats according
9043 * IN clearFlag - flag indicating which stats to clear
9051 rx_clearPeerRPCStats(afs_uint32 clearFlag)
9053 struct opr_queue *cursor;
9055 MUTEX_ENTER(&rx_rpc_stats);
9057 for (opr_queue_Scan(&peerStats, cursor)) {
9058 unsigned int num_funcs, i;
9059 struct rx_interface_stat *rpc_stat
9060 = opr_queue_Entry(cursor, struct rx_interface_stat, entryPeers);
9062 num_funcs = rpc_stat->stats[0].func_total;
9063 for (i = 0; i < num_funcs; i++) {
9064 if (clearFlag & AFS_RX_STATS_CLEAR_INVOCATIONS) {
9065 rpc_stat->stats[i].invocations = 0;
9067 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_SENT) {
9068 rpc_stat->stats[i].bytes_sent = 0;
9070 if (clearFlag & AFS_RX_STATS_CLEAR_BYTES_RCVD) {
9071 rpc_stat->stats[i].bytes_rcvd = 0;
9073 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SUM) {
9074 rpc_stat->stats[i].queue_time_sum.sec = 0;
9075 rpc_stat->stats[i].queue_time_sum.usec = 0;
9077 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_SQUARE) {
9078 rpc_stat->stats[i].queue_time_sum_sqr.sec = 0;
9079 rpc_stat->stats[i].queue_time_sum_sqr.usec = 0;
9081 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MIN) {
9082 rpc_stat->stats[i].queue_time_min.sec = 9999999;
9083 rpc_stat->stats[i].queue_time_min.usec = 9999999;
9085 if (clearFlag & AFS_RX_STATS_CLEAR_QUEUE_TIME_MAX) {
9086 rpc_stat->stats[i].queue_time_max.sec = 0;
9087 rpc_stat->stats[i].queue_time_max.usec = 0;
9089 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SUM) {
9090 rpc_stat->stats[i].execution_time_sum.sec = 0;
9091 rpc_stat->stats[i].execution_time_sum.usec = 0;
9093 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_SQUARE) {
9094 rpc_stat->stats[i].execution_time_sum_sqr.sec = 0;
9095 rpc_stat->stats[i].execution_time_sum_sqr.usec = 0;
9097 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MIN) {
9098 rpc_stat->stats[i].execution_time_min.sec = 9999999;
9099 rpc_stat->stats[i].execution_time_min.usec = 9999999;
9101 if (clearFlag & AFS_RX_STATS_CLEAR_EXEC_TIME_MAX) {
9102 rpc_stat->stats[i].execution_time_max.sec = 0;
9103 rpc_stat->stats[i].execution_time_max.usec = 0;
9108 MUTEX_EXIT(&rx_rpc_stats);
9112 * rxi_rxstat_userok points to a routine that returns 1 if the caller
9113 * is authorized to enable/disable/clear RX statistics.
9115 static int (*rxi_rxstat_userok) (struct rx_call * call) = NULL;
9118 rx_SetRxStatUserOk(int (*proc) (struct rx_call * call))
9120 rxi_rxstat_userok = proc;
9124 rx_RxStatUserOk(struct rx_call *call)
9126 if (!rxi_rxstat_userok)
9128 return rxi_rxstat_userok(call);
9133 * DllMain() -- Entry-point function called by the DllMainCRTStartup()
9134 * function in the MSVC runtime DLL (msvcrt.dll).
9136 * Note: the system serializes calls to this function.
9139 DllMain(HINSTANCE dllInstHandle, /* instance handle for this DLL module */
9140 DWORD reason, /* reason function is being called */
9141 LPVOID reserved) /* reserved for future use */
9144 case DLL_PROCESS_ATTACH:
9145 /* library is being attached to a process */
9149 case DLL_PROCESS_DETACH:
9156 #endif /* AFS_NT40_ENV */
9159 int rx_DumpCalls(FILE *outputFile, char *cookie)
9161 #ifdef RXDEBUG_PACKET
9162 #ifdef KDUMP_RX_LOCK
9163 struct rx_call_rx_lock *c;
9170 #define RXDPRINTF sprintf
9171 #define RXDPRINTOUT output
9173 #define RXDPRINTF fprintf
9174 #define RXDPRINTOUT outputFile
9177 RXDPRINTF(RXDPRINTOUT, "%s - Start dumping all Rx Calls - count=%u\r\n", cookie, rx_stats.nCallStructs);
9179 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9182 for (c = rx_allCallsp; c; c = c->allNextp) {
9183 u_short rqc, tqc, iovqc;
9185 MUTEX_ENTER(&c->lock);
9186 rqc = opr_queue_Count(&c->rq);
9187 tqc = opr_queue_Count(&c->tq);
9188 iovqc = opr_queue_Count(&c->app.iovq);
9190 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, "
9191 "rqc=%u,%u, tqc=%u,%u, iovqc=%u,%u, "
9192 "lstatus=%u, rstatus=%u, error=%d, timeout=%u, "
9193 "resendEvent=%d, keepAliveEvt=%d, delayedAckEvt=%d, delayedAbortEvt=%d, abortCode=%d, abortCount=%d, "
9194 "lastSendTime=%u, lastRecvTime=%u"
9195 #ifdef RX_ENABLE_LOCKS
9198 #ifdef RX_REFCOUNT_CHECK
9199 ", refCountBegin=%u, refCountResend=%u, refCountDelay=%u, "
9200 "refCountAlive=%u, refCountPacket=%u, refCountSend=%u, refCountAckAll=%u, refCountAbort=%u"
9203 cookie, c, c->call_id, (afs_uint32)c->state, (afs_uint32)c->app.mode, c->conn, c->conn?c->conn->epoch:0, c->conn?c->conn->cid:0,
9204 c->callNumber?*c->callNumber:0, c->conn?c->conn->flags:0, c->flags,
9205 (afs_uint32)c->rqc, (afs_uint32)rqc, (afs_uint32)c->tqc, (afs_uint32)tqc, (afs_uint32)c->iovqc, (afs_uint32)iovqc,
9206 (afs_uint32)c->localStatus, (afs_uint32)c->remoteStatus, c->error, c->timeout,
9207 c->resendEvent?1:0, c->keepAliveEvent?1:0, c->delayedAckEvent?1:0, c->delayedAbortEvent?1:0,
9208 c->abortCode, c->abortCount, c->lastSendTime, c->lastReceiveTime
9209 #ifdef RX_ENABLE_LOCKS
9210 , (afs_uint32)c->refCount
9212 #ifdef RX_REFCOUNT_CHECK
9213 , c->refCDebug[0],c->refCDebug[1],c->refCDebug[2],c->refCDebug[3],c->refCDebug[4],c->refCDebug[5],c->refCDebug[6],c->refCDebug[7]
9216 MUTEX_EXIT(&c->lock);
9219 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9222 RXDPRINTF(RXDPRINTOUT, "%s - End dumping all Rx Calls\r\n", cookie);
9224 WriteFile(outputFile, output, (DWORD)strlen(output), &zilch, NULL);
9226 #endif /* RXDEBUG_PACKET */