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: Globals for internal use, basically */
12 #ifndef AFS_RX_GLOBALS_H
13 #define AFS_RX_GLOBALS_H
23 #define GLOBALSINIT(x)
24 #if defined(AFS_NT40_ENV)
25 #define RX_STATS_INTERLOCKED 1
26 #if defined(AFS_PTHREAD_ENV)
27 #define EXT __declspec(dllimport) extern
28 #else /* AFS_PTHREAD_ENV */
30 #endif /* AFS_PTHREAD_ENV */
31 #else /* AFS_NT40_ENV */
33 #endif /* AFS_NT40_ENV */
34 #endif /* !GLOBALSINIT */
36 /* Basic socket for client requests; other sockets (for receiving server requests) are in the service structures */
37 EXT osi_socket rx_socket;
39 /* The array of installed services. Null terminated. */
40 EXT struct rx_service *rx_services[RX_MAX_SERVICES + 1];
41 #ifdef RX_ENABLE_LOCKS
42 /* Protects nRequestsRunning as well as pool allocation variables. */
43 EXT afs_kmutex_t rx_serverPool_lock;
44 #endif /* RX_ENABLE_LOCKS */
46 /* Incoming calls wait on this queue when there are no available server processes */
47 EXT struct rx_queue rx_incomingCallQueue;
49 /* Server processes wait on this queue when there are no appropriate calls to process */
50 EXT struct rx_queue rx_idleServerQueue;
52 /* Constant delay time before sending an acknowledge of the last packet received. This is to avoid sending an extra acknowledge when the client is about to make another call, anyway, or the server is about to respond. */
53 EXT struct clock rx_lastAckDelay;
55 /* Constant delay time before sending a hard ack if the receiver consumes
56 * a packet while no delayed ack event is scheduled. Ensures that the
57 * sender is able to advance its window when the receiver consumes a packet
58 * after the sender has exhausted its transmit window.
60 EXT struct clock rx_hardAckDelay;
62 /* Constant delay time before sending a soft ack when none was requested.
63 * This is to make sure we send soft acks before the sender times out,
64 * Normally we wait and send a hard ack when the receiver consumes the packet */
65 EXT struct clock rx_softAckDelay;
67 /* Variable to allow introduction of network unreliability */
69 EXT int rx_intentionallyDroppedPacketsPer100 GLOBALSINIT(0); /* Dropped on Send */
70 EXT int rx_intentionallyDroppedOnReadPer100 GLOBALSINIT(0); /* Dropped on Read */
73 /* extra packets to add to the quota */
74 EXT int rx_extraQuota GLOBALSINIT(0);
75 /* extra packets to alloc (2 * maxWindowSize by default) */
76 EXT int rx_extraPackets GLOBALSINIT(256);
78 EXT int rx_stackSize GLOBALSINIT(RX_DEFAULT_STACK_SIZE);
80 /* Time until an unresponsive connection is declared dead */
81 EXT int rx_connDeadTime GLOBALSINIT(12);
83 /* Set rx default connection dead time; set on both services and connections at creation time */
85 void rx_SetRxDeadTime(int seconds);
87 #define rx_SetRxDeadTime(seconds) (rx_connDeadTime = (seconds))
90 /* Time until we toss an idle connection */
91 EXT int rx_idleConnectionTime GLOBALSINIT(700);
92 /* Time until we toss a peer structure, after all connections using are gone */
93 EXT int rx_idlePeerTime GLOBALSINIT(60);
95 /* The file server is temporarily salvaging */
96 EXT int rx_tranquil GLOBALSINIT(0);
98 /* UDP rcv buffer size */
99 EXT int rx_UdpBufSize GLOBALSINIT(64 * 1024);
101 int rx_GetMinUdpBufSize(void);
102 void rx_SetUdpBufSize(int x);
104 #define rx_GetMinUdpBufSize() (64*1024)
105 #define rx_SetUdpBufSize(x) (((x)>rx_GetMinUdpBufSize()) ? (rx_UdpBufSize = (x)):0)
108 * Variables to control RX overload management. When the number of calls
109 * waiting for a thread exceed the threshold, new calls are aborted
110 * with the busy error.
112 EXT int rx_BusyThreshold GLOBALSINIT(-1); /* default is disabled */
113 EXT int rx_BusyError GLOBALSINIT(-1);
115 /* These definitions should be in one place */
117 #define RX_CBUF_TIME 180 /* Check for packet deficit */
118 #define RX_REAP_TIME 90 /* Check for tossable connections every 90 seconds */
120 #define RX_CBUF_TIME 120 /* Check for packet deficit */
121 #define RX_REAP_TIME 60 /* Check for tossable connections every 60 seconds */
124 #define RX_FAST_ACK_RATE 1 /* as of 3.4, ask for an ack every
127 EXT int rx_minPeerTimeout GLOBALSINIT(350); /* in milliseconds */
128 EXT int rx_minWindow GLOBALSINIT(1);
129 EXT int rx_maxWindow GLOBALSINIT(65535); /* twind is u_short */
130 EXT int rx_initReceiveWindow GLOBALSINIT(16); /* how much to accept */
131 EXT int rx_maxReceiveWindow GLOBALSINIT(128); /* how much to accept */
132 EXT int rx_initSendWindow GLOBALSINIT(16);
133 EXT int rx_maxSendWindow GLOBALSINIT(128);
134 EXT int rx_nackThreshold GLOBALSINIT(3); /* Number NACKS to trigger congestion recovery */
135 EXT int rx_nDgramThreshold GLOBALSINIT(4); /* Number of packets before increasing
136 * packets per datagram */
137 #define RX_MAX_FRAGS 4
138 EXT int rxi_nSendFrags GLOBALSINIT(RX_MAX_FRAGS); /* max fragments in a datagram */
139 EXT int rxi_nRecvFrags GLOBALSINIT(RX_MAX_FRAGS);
140 EXT int rxi_OrphanFragSize GLOBALSINIT(512);
142 #define RX_MAX_DGRAM_PACKETS 6 /* max packets per jumbogram */
144 EXT int rxi_nDgramPackets GLOBALSINIT(RX_MAX_DGRAM_PACKETS);
145 /* allow n packets between soft acks - must be power of 2 -1, else change
147 EXT int rxi_SoftAckRate GLOBALSINIT(RX_FAST_ACK_RATE);
148 /* consume n packets before sending hard ack, should be larger than above,
149 but not absolutely necessary. If it's smaller, than fast receivers will
150 send a soft ack, immediately followed by a hard ack. */
151 EXT int rxi_HardAckRate GLOBALSINIT(RX_FAST_ACK_RATE + 1);
153 /* If window sizes become very variable (in terms of #packets), be
154 * sure that the sender can get back a hard acks without having to wait for
155 * some kind of timer event first (like a keep-alive, for instance).
156 * It might be kind of tricky, so it might be better to shrink the
157 * window size by reducing the packet size below the "natural" MTU. */
159 #define ACKHACK(p,r) { if (((p)->header.seq & (rxi_SoftAckRate))==0) (p)->header.flags |= RX_REQUEST_ACK; }
161 EXT int rx_nPackets GLOBALSINIT(0); /* preallocate packets with rx_extraPackets */
164 * pthreads thread-specific rx info support
165 * the rx_ts_info_t struct is meant to support all kinds of
166 * thread-specific rx data:
168 * _FPQ member contains a thread-specific free packet queue
170 #ifdef AFS_PTHREAD_ENV
171 EXT pthread_key_t rx_ts_info_key;
172 typedef struct rx_ts_info_t {
174 struct rx_queue queue;
175 int len; /* local queue length */
176 int delta; /* number of new packets alloc'd locally since last sync w/ global queue */
192 struct rx_packet * local_special_packet;
194 EXT struct rx_ts_info_t * rx_ts_info_init(void); /* init function for thread-specific data struct */
195 #define RX_TS_INFO_GET(ts_info_p) \
197 ts_info_p = (struct rx_ts_info_t*)pthread_getspecific(rx_ts_info_key); \
198 if (ts_info_p == NULL) { \
199 assert((ts_info_p = rx_ts_info_init()) != NULL); \
202 #endif /* AFS_PTHREAD_ENV */
205 /* List of free packets */
206 /* in pthreads rx, free packet queue is now a two-tiered queueing system
207 * in which the first tier is thread-specific, and the second tier is
208 * a global free packet queue */
209 EXT struct rx_queue rx_freePacketQueue;
210 #ifdef RX_TRACK_PACKETS
211 #define RX_FPQ_MARK_FREE(p) \
213 if ((p)->flags & RX_PKTFLAG_FREE) \
214 osi_Panic("rx packet already free\n"); \
215 (p)->flags |= RX_PKTFLAG_FREE; \
216 (p)->flags &= ~(RX_PKTFLAG_TQ|RX_PKTFLAG_IOVQ|RX_PKTFLAG_RQ|RX_PKTFLAG_CP); \
220 #define RX_FPQ_MARK_USED(p) \
222 if (!((p)->flags & RX_PKTFLAG_FREE)) \
223 osi_Panic("rx packet not free\n"); \
224 (p)->flags = 0; /* clear RX_PKTFLAG_FREE, initialize the rest */ \
225 (p)->header.flags = 0; \
228 #define RX_FPQ_MARK_FREE(p) \
233 #define RX_FPQ_MARK_USED(p) \
235 (p)->flags = 0; /* clear RX_PKTFLAG_FREE, initialize the rest */ \
236 (p)->header.flags = 0; \
239 #define RX_PACKET_IOV_INIT(p) \
241 (p)->wirevec[0].iov_base = (char *)((p)->wirehead); \
242 (p)->wirevec[0].iov_len = RX_HEADER_SIZE; \
243 (p)->wirevec[1].iov_base = (char *)((p)->localdata); \
244 (p)->wirevec[1].iov_len = RX_FIRSTBUFFERSIZE; \
246 #define RX_PACKET_IOV_FULLINIT(p) \
248 (p)->wirevec[0].iov_base = (char *)((p)->wirehead); \
249 (p)->wirevec[0].iov_len = RX_HEADER_SIZE; \
250 (p)->wirevec[1].iov_base = (char *)((p)->localdata); \
251 (p)->wirevec[1].iov_len = RX_FIRSTBUFFERSIZE; \
253 (p)->length = RX_FIRSTBUFFERSIZE; \
256 #ifdef RX_ENABLE_LOCKS
257 EXT afs_kmutex_t rx_freePktQ_lock;
258 #endif /* RX_ENABLE_LOCKS */
260 #if defined(AFS_PTHREAD_ENV)
261 #define RX_ENABLE_TSFPQ
262 EXT int rx_TSFPQGlobSize GLOBALSINIT(3); /* number of packets to transfer between global and local queues in one op */
263 EXT int rx_TSFPQLocalMax GLOBALSINIT(15); /* max number of packets on local FPQ before returning a glob to the global pool */
264 EXT int rx_TSFPQMaxProcs GLOBALSINIT(0); /* max number of threads expected */
265 EXT void rxi_MorePacketsTSFPQ(int apackets, int flush_global, int num_keep_local); /* more flexible packet alloc function */
266 EXT void rxi_AdjustLocalPacketsTSFPQ(int num_keep_local, int allow_overcommit); /* adjust thread-local queue length, for places where we know how many packets we will need a priori */
267 EXT void rxi_FlushLocalPacketsTSFPQ(void); /* flush all thread-local packets to global queue */
268 #define RX_TS_FPQ_FLUSH_GLOBAL 1
269 #define RX_TS_FPQ_PULL_GLOBAL 1
270 #define RX_TS_FPQ_ALLOW_OVERCOMMIT 1
272 * compute the localmax and globsize values from rx_TSFPQMaxProcs and rx_nPackets.
273 * arbitarily set local max so that all threads consume 90% of packets, if all local queues are full.
274 * arbitarily set transfer glob size to 20% of max local packet queue length.
275 * also set minimum values of 15 and 3. Given the algorithms, the number of buffers allocated
276 * by each call to AllocPacketBufs() will increase indefinitely without a cap on the transfer
277 * glob size. A cap of 64 is selected because that will produce an allocation of greater than
278 * three times that amount which is greater than half of ncalls * maxReceiveWindow.
279 * Must be called under rx_packets_mutex.
281 #define RX_TS_FPQ_COMPUTE_LIMITS \
283 int newmax, newglob; \
284 newmax = (rx_nPackets * 9) / (10 * rx_TSFPQMaxProcs); \
285 newmax = (newmax >= 15) ? newmax : 15; \
286 newglob = newmax / 5; \
287 newglob = (newglob >= 3) ? (newglob < 64 ? newglob : 64) : 3; \
288 rx_TSFPQLocalMax = newmax; \
289 rx_TSFPQGlobSize = newglob; \
291 /* record the number of packets allocated by this thread
292 * and stored in the thread local queue */
293 #define RX_TS_FPQ_LOCAL_ALLOC(rx_ts_info_p,num_alloc) \
295 (rx_ts_info_p)->_FPQ.lalloc_ops++; \
296 (rx_ts_info_p)->_FPQ.lalloc_xfer += num_alloc; \
298 /* record the number of packets allocated by this thread
299 * and stored in the global queue */
300 #define RX_TS_FPQ_GLOBAL_ALLOC(rx_ts_info_p,num_alloc) \
302 (rx_ts_info_p)->_FPQ.galloc_ops++; \
303 (rx_ts_info_p)->_FPQ.galloc_xfer += num_alloc; \
305 /* move packets from local (thread-specific) to global free packet queue.
306 rx_freePktQ_lock must be held. default is to reduce the queue size to 40% ofmax */
307 #define RX_TS_FPQ_LTOG(rx_ts_info_p) \
310 struct rx_packet * p; \
311 int tsize = MIN((rx_ts_info_p)->_FPQ.len, (rx_ts_info_p)->_FPQ.len - rx_TSFPQLocalMax + 3 * rx_TSFPQGlobSize); \
312 if (tsize <= 0) break; \
313 for (i=0,p=queue_Last(&((rx_ts_info_p)->_FPQ), rx_packet); \
314 i < tsize; i++,p=queue_Prev(p, rx_packet)); \
315 queue_SplitAfterPrepend(&((rx_ts_info_p)->_FPQ),&rx_freePacketQueue,p); \
316 (rx_ts_info_p)->_FPQ.len -= tsize; \
317 rx_nFreePackets += tsize; \
318 (rx_ts_info_p)->_FPQ.ltog_ops++; \
319 (rx_ts_info_p)->_FPQ.ltog_xfer += tsize; \
320 if ((rx_ts_info_p)->_FPQ.delta) { \
321 MUTEX_ENTER(&rx_packets_mutex); \
322 RX_TS_FPQ_COMPUTE_LIMITS; \
323 MUTEX_EXIT(&rx_packets_mutex); \
324 (rx_ts_info_p)->_FPQ.delta = 0; \
327 /* same as above, except user has direct control over number to transfer */
328 #define RX_TS_FPQ_LTOG2(rx_ts_info_p,num_transfer) \
331 struct rx_packet * p; \
332 if (num_transfer <= 0) break; \
333 for (i=0,p=queue_Last(&((rx_ts_info_p)->_FPQ), rx_packet); \
334 i < (num_transfer); i++,p=queue_Prev(p, rx_packet)); \
335 queue_SplitAfterPrepend(&((rx_ts_info_p)->_FPQ),&rx_freePacketQueue,p); \
336 (rx_ts_info_p)->_FPQ.len -= (num_transfer); \
337 rx_nFreePackets += (num_transfer); \
338 (rx_ts_info_p)->_FPQ.ltog_ops++; \
339 (rx_ts_info_p)->_FPQ.ltog_xfer += (num_transfer); \
340 if ((rx_ts_info_p)->_FPQ.delta) { \
341 MUTEX_ENTER(&rx_packets_mutex); \
342 RX_TS_FPQ_COMPUTE_LIMITS; \
343 MUTEX_EXIT(&rx_packets_mutex); \
344 (rx_ts_info_p)->_FPQ.delta = 0; \
347 /* move packets from global to local (thread-specific) free packet queue.
348 rx_freePktQ_lock must be held. */
349 #define RX_TS_FPQ_GTOL(rx_ts_info_p) \
352 struct rx_packet * p; \
353 tsize = (rx_TSFPQGlobSize <= rx_nFreePackets) ? \
354 rx_TSFPQGlobSize : rx_nFreePackets; \
355 for (i=0,p=queue_First(&rx_freePacketQueue, rx_packet); \
356 i < tsize; i++,p=queue_Next(p, rx_packet)); \
357 queue_SplitBeforeAppend(&rx_freePacketQueue,&((rx_ts_info_p)->_FPQ),p); \
358 (rx_ts_info_p)->_FPQ.len += i; \
359 rx_nFreePackets -= i; \
360 (rx_ts_info_p)->_FPQ.gtol_ops++; \
361 (rx_ts_info_p)->_FPQ.gtol_xfer += i; \
363 /* same as above, except user has direct control over number to transfer */
364 #define RX_TS_FPQ_GTOL2(rx_ts_info_p,num_transfer) \
367 struct rx_packet * p; \
368 tsize = (num_transfer); \
369 if (tsize > rx_nFreePackets) tsize = rx_nFreePackets; \
370 for (i=0,p=queue_First(&rx_freePacketQueue, rx_packet); \
371 i < tsize; i++,p=queue_Next(p, rx_packet)); \
372 queue_SplitBeforeAppend(&rx_freePacketQueue,&((rx_ts_info_p)->_FPQ),p); \
373 (rx_ts_info_p)->_FPQ.len += i; \
374 rx_nFreePackets -= i; \
375 (rx_ts_info_p)->_FPQ.gtol_ops++; \
376 (rx_ts_info_p)->_FPQ.gtol_xfer += i; \
378 /* checkout a packet from the thread-specific free packet queue */
379 #define RX_TS_FPQ_CHECKOUT(rx_ts_info_p,p) \
381 (p) = queue_First(&((rx_ts_info_p)->_FPQ), rx_packet); \
383 RX_FPQ_MARK_USED(p); \
384 (rx_ts_info_p)->_FPQ.len--; \
385 (rx_ts_info_p)->_FPQ.checkout_ops++; \
386 (rx_ts_info_p)->_FPQ.checkout_xfer++; \
388 /* checkout multiple packets from the thread-specific free packet queue.
389 * num_transfer must be a variable.
391 #define RX_TS_FPQ_QCHECKOUT(rx_ts_info_p,num_transfer,q) \
394 struct rx_packet *p; \
395 if (num_transfer > (rx_ts_info_p)->_FPQ.len) num_transfer = (rx_ts_info_p)->_FPQ.len; \
396 for (i=0, p=queue_First(&((rx_ts_info_p)->_FPQ), rx_packet); \
398 i++, p=queue_Next(p, rx_packet)) { \
399 RX_FPQ_MARK_USED(p); \
401 queue_SplitBeforeAppend(&((rx_ts_info_p)->_FPQ),(q),p); \
402 (rx_ts_info_p)->_FPQ.len -= num_transfer; \
403 (rx_ts_info_p)->_FPQ.checkout_ops++; \
404 (rx_ts_info_p)->_FPQ.checkout_xfer += num_transfer; \
406 /* check a packet into the thread-specific free packet queue */
407 #define RX_TS_FPQ_CHECKIN(rx_ts_info_p,p) \
409 queue_Prepend(&((rx_ts_info_p)->_FPQ), (p)); \
410 RX_FPQ_MARK_FREE(p); \
411 (rx_ts_info_p)->_FPQ.len++; \
412 (rx_ts_info_p)->_FPQ.checkin_ops++; \
413 (rx_ts_info_p)->_FPQ.checkin_xfer++; \
415 /* check multiple packets into the thread-specific free packet queue */
416 /* num_transfer must equal length of (q); it is not a means of checking
417 * in part of (q). passing num_transfer just saves us instructions
418 * since caller already knows length of (q) for other reasons */
419 #define RX_TS_FPQ_QCHECKIN(rx_ts_info_p,num_transfer,q) \
421 struct rx_packet *p, *np; \
422 for (queue_Scan((q), p, np, rx_packet)) { \
423 RX_FPQ_MARK_FREE(p); \
425 queue_SplicePrepend(&((rx_ts_info_p)->_FPQ),(q)); \
426 (rx_ts_info_p)->_FPQ.len += (num_transfer); \
427 (rx_ts_info_p)->_FPQ.checkin_ops++; \
428 (rx_ts_info_p)->_FPQ.checkin_xfer += (num_transfer); \
430 #endif /* AFS_PTHREAD_ENV */
432 /* Number of free packets */
433 EXT int rx_nFreePackets GLOBALSINIT(0);
434 EXT int rxi_NeedMorePackets GLOBALSINIT(0);
435 EXT int rx_nWaiting GLOBALSINIT(0);
436 EXT int rx_nWaited GLOBALSINIT(0);
437 EXT int rx_packetReclaims GLOBALSINIT(0);
439 /* largest packet which we can safely receive, initialized to AFS 3.2 value
440 * This is provided for backward compatibility with peers which may be unable
441 * to swallow anything larger. THIS MUST NEVER DECREASE WHILE AN APPLICATION
443 EXT afs_uint32 rx_maxReceiveSize GLOBALSINIT(_OLD_MAX_PACKET_SIZE * RX_MAX_FRAGS +
444 UDP_HDR_SIZE * (RX_MAX_FRAGS - 1));
446 /* this is the maximum packet size that the user wants us to receive */
447 /* this is set by rxTune if required */
448 EXT afs_uint32 rx_maxReceiveSizeUser GLOBALSINIT(0xffffffff);
450 /* rx_MyMaxSendSize is the size of the largest packet we will send,
451 * including the RX header. Just as rx_maxReceiveSize is the
452 * max we will receive, including the rx header.
454 EXT afs_uint32 rx_MyMaxSendSize GLOBALSINIT(8588);
456 /* Maximum size of a jumbo datagram we can receive */
457 EXT afs_uint32 rx_maxJumboRecvSize GLOBALSINIT(RX_MAX_PACKET_SIZE);
459 /* need this to permit progs to run on AIX systems */
460 EXT int (*rxi_syscallp) (afs_uint32 a3, afs_uint32 a4, void *a5)GLOBALSINIT(0);
462 /* List of free queue entries */
463 EXT struct rx_serverQueueEntry *rx_FreeSQEList GLOBALSINIT(0);
464 #ifdef RX_ENABLE_LOCKS
465 EXT afs_kmutex_t freeSQEList_lock;
468 /* List of free call structures */
469 EXT struct rx_queue rx_freeCallQueue;
470 #ifdef RX_ENABLE_LOCKS
471 EXT afs_kmutex_t rx_freeCallQueue_lock;
473 EXT afs_int32 rxi_nCalls GLOBALSINIT(0);
475 /* Port requested at rx_Init. If this is zero, the actual port used will be different--but it will only be used for client operations. If non-zero, server provided services may use the same port. */
478 #if !defined(KERNEL) && !defined(AFS_PTHREAD_ENV)
479 /* 32-bit select Mask for rx_Listener. */
480 EXT fd_set rx_selectMask;
481 EXT osi_socket rx_maxSocketNumber; /* Maximum socket number in the select mask. */
482 /* Minumum socket number in the select mask. */
483 EXT osi_socket rx_minSocketNumber GLOBALSINIT(0x7fffffff);
486 /* This is actually the minimum number of packets that must remain free,
487 overall, immediately after a packet of the requested class has been
488 allocated. *WARNING* These must be assigned with a great deal of care.
489 In order, these are receive quota, send quota, special quota, receive
490 continuation quota, and send continuation quota. */
491 #define RX_PACKET_QUOTAS {1, 10, 0, 1, 10}
492 /* value large enough to guarantee that no allocation fails due to RX_PACKET_QUOTAS.
493 Make it a little bigger, just for fun */
494 #define RX_MAX_QUOTA 15 /* part of min packet computation */
495 EXT int rx_packetQuota[RX_N_PACKET_CLASSES] GLOBALSINIT(RX_PACKET_QUOTAS);
496 EXT int meltdown_1pkt GLOBALSINIT(1); /* prefer to schedule single-packet calls */
497 EXT int rxi_doreclaim GLOBALSINIT(1); /* if discard one packet, discard all */
498 EXT int rxi_md2cnt GLOBALSINIT(0); /* counter of skipped calls */
499 EXT int rxi_2dchoice GLOBALSINIT(1); /* keep track of another call to schedule */
501 /* quota system: each attached server process must be able to make
502 progress to avoid system deadlock, so we ensure that we can always
503 handle the arrival of the next unacknowledged data packet for an
504 attached call. rxi_dataQuota gives the max # of packets that must be
505 reserved for active calls for them to be able to make progress, which is
506 essentially enough to queue up a window-full of packets (the first packet
507 may be missing, so these may not get read) + the # of packets the thread
508 may use before reading all of its input (# free must be one more than send
509 packet quota). Thus, each thread allocates rx_maxReceiveWindow+1 (max
510 queued packets) + an extra for sending data. The system also reserves
511 RX_MAX_QUOTA (must be more than RX_PACKET_QUOTA[i], which is 10), so that
512 the extra packet can be sent (must be under the system-wide send packet
513 quota to send any packets) */
514 /* # to reserve so that thread with input can still make calls (send packets)
516 EXT int rxi_dataQuota GLOBALSINIT(RX_MAX_QUOTA); /* packets to reserve for active threads */
518 EXT afs_int32 rxi_availProcs GLOBALSINIT(0); /* number of threads in the pool */
519 EXT afs_int32 rxi_totalMin GLOBALSINIT(0); /* Sum(minProcs) forall services */
520 EXT afs_int32 rxi_minDeficit GLOBALSINIT(0); /* number of procs needed to handle all minProcs */
522 EXT int rx_nextCid; /* Next connection call id */
523 EXT int rx_epoch; /* Initialization time of rx */
524 #ifdef RX_ENABLE_LOCKS
525 EXT afs_kcondvar_t rx_waitingForPackets_cv;
527 EXT char rx_waitingForPackets; /* Processes set and wait on this variable when waiting for packet buffers */
529 EXT struct rx_statistics rx_stats;
531 EXT struct rx_peer **rx_peerHashTable;
532 EXT struct rx_connection **rx_connHashTable;
533 EXT struct rx_connection *rx_connCleanup_list GLOBALSINIT(0);
534 EXT afs_uint32 rx_hashTableSize GLOBALSINIT(257); /* Prime number */
535 #ifdef RX_ENABLE_LOCKS
536 EXT afs_kmutex_t rx_peerHashTable_lock;
537 EXT afs_kmutex_t rx_connHashTable_lock;
538 #endif /* RX_ENABLE_LOCKS */
540 #define CONN_HASH(host, port, cid, epoch, type) ((((cid)>>RX_CIDSHIFT)%rx_hashTableSize))
542 #define PEER_HASH(host, port) ((host ^ port) % rx_hashTableSize)
544 /* Forward definitions of internal procedures */
545 #define rxi_ChallengeOff(conn) rxevent_Cancel((conn)->challengeEvent, (struct rx_call*)0, 0);
546 #define rxi_KeepAliveOff(call) rxevent_Cancel((call)->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE)
547 #define rxi_NatKeepAliveOff(conn) rxevent_Cancel((conn)->natKeepAliveEvent, (struct rx_call*)0, 0)
549 #define rxi_AllocSecurityObject() (struct rx_securityClass *) rxi_Alloc(sizeof(struct rx_securityClass))
550 #define rxi_FreeSecurityObject(obj) rxi_Free(obj, sizeof(struct rx_securityClass))
551 #define rxi_AllocService() (struct rx_service *) rxi_Alloc(sizeof(struct rx_service))
552 #define rxi_FreeService(obj) \
554 MUTEX_DESTROY(&(obj)->svc_data_lock); \
555 rxi_Free((obj), sizeof(struct rx_service)); \
557 #define rxi_AllocPeer() (struct rx_peer *) rxi_Alloc(sizeof(struct rx_peer))
558 #define rxi_FreePeer(peer) rxi_Free(peer, sizeof(struct rx_peer))
559 #define rxi_AllocConnection() (struct rx_connection *) rxi_Alloc(sizeof(struct rx_connection))
560 #define rxi_FreeConnection(conn) (rxi_Free(conn, sizeof(struct rx_connection)))
562 EXT afs_int32 rx_stats_active GLOBALSINIT(1); /* boolean - rx statistics gathering */
565 /* Some debugging stuff */
566 EXT FILE *rx_debugFile; /* Set by the user to a stdio file for debugging output */
567 EXT FILE *rxevent_debugFile; /* Set to an stdio descriptor for event logging to that file */
571 #define rx_Log rx_debugFile
573 EXT int rxdebug_active;
574 #define dpf(args) do { if (rxdebug_active) rxi_DebugPrint args; } while (0)
577 #include <afs/afsutil.h>
578 #define dpf(args) FSLog args
580 #define dpf(args) do { if (rx_debugFile) rxi_DebugPrint args; } while (0)
583 #define rx_Log_event rxevent_debugFile
585 EXT char *rx_packetTypes[RX_N_PACKET_TYPES] GLOBALSINIT(RX_PACKET_TYPES); /* Strings defined in rx.h */
592 * Counter used to implement connection specific data
594 EXT int rxi_keyCreate_counter GLOBALSINIT(0);
596 * Array of function pointers used to destory connection specific data
598 EXT rx_destructor_t *rxi_keyCreate_destructor GLOBALSINIT(NULL);
599 #ifdef RX_ENABLE_LOCKS
600 EXT afs_kmutex_t rxi_keyCreate_lock;
601 #endif /* RX_ENABLE_LOCKS */
605 * SERVER ONLY: Threshholds used to throttle error replies to looping
606 * clients. When consecutive calls are aborting with the same error, the
607 * server throttles the client by waiting before sending error messages.
608 * Disabled if abort thresholds are zero.
610 EXT int rxi_connAbortThreshhold GLOBALSINIT(0);
611 EXT int rxi_connAbortDelay GLOBALSINIT(3000);
612 EXT int rxi_callAbortThreshhold GLOBALSINIT(0);
613 EXT int rxi_callAbortDelay GLOBALSINIT(3000);
616 * Thread specific thread ID used to implement LWP_Index().
619 #if defined(AFS_PTHREAD_ENV)
620 EXT int rxi_fcfs_thread_num GLOBALSINIT(0);
621 EXT pthread_key_t rx_thread_id_key;
622 /* keep track of pthread numbers - protected by rx_stats_mutex,
623 * except in rx_Init() before mutex exists! */
624 EXT int rxi_pthread_hinum GLOBALSINIT(0);
626 #define rxi_fcfs_thread_num (0)
629 #if defined(RX_ENABLE_LOCKS)
630 EXT afs_kmutex_t rx_stats_mutex; /* used to protect stats gathering */
631 EXT afs_kmutex_t rx_waiting_mutex; /* used to protect waiting counters */
632 EXT afs_kmutex_t rx_quota_mutex; /* used to protect quota counters */
633 EXT afs_kmutex_t rx_pthread_mutex; /* used to protect pthread counters */
634 EXT afs_kmutex_t rx_packets_mutex; /* used to protect packet counters */
637 EXT int rx_enable_stats GLOBALSINIT(0);
640 * Set this flag to enable the listener thread to trade places with an idle
641 * worker thread to move the context switch from listener to worker out of
644 EXT int rx_enable_hot_thread GLOBALSINIT(0);
646 EXT int RX_IPUDP_SIZE GLOBALSINIT(_RX_IPUDP_SIZE);
647 #endif /* AFS_RX_GLOBALS_H */