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
31 #define EXT2 __declspec(dllimport) extern
36 #endif /* !GLOBALSINIT */
38 /* Basic socket for client requests; other sockets (for receiving server requests) are in the service structures */
39 EXT osi_socket rx_socket;
41 /* The array of installed services. Null terminated. */
42 EXT struct rx_service *rx_services[RX_MAX_SERVICES + 1];
43 #ifdef RX_ENABLE_LOCKS
44 /* Protects nRequestsRunning as well as pool allocation variables. */
45 EXT afs_kmutex_t rx_serverPool_lock;
46 #endif /* RX_ENABLE_LOCKS */
48 /* Incoming calls wait on this queue when there are no available server processes */
49 EXT struct rx_queue rx_incomingCallQueue;
51 /* Server processes wait on this queue when there are no appropriate calls to process */
52 EXT struct rx_queue rx_idleServerQueue;
54 /* 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. */
55 EXT struct clock rx_lastAckDelay;
57 /* Constant delay time before sending a hard ack if the receiver consumes
58 * a packet while no delayed ack event is scheduled. Ensures that the
59 * sender is able to advance its window when the receiver consumes a packet
60 * after the sender has exhausted its transmit window.
62 EXT struct clock rx_hardAckDelay;
64 /* Constant delay time before sending a soft ack when none was requested.
65 * This is to make sure we send soft acks before the sender times out,
66 * Normally we wait and send a hard ack when the receiver consumes the packet */
67 EXT struct clock rx_softAckDelay;
69 /* Variable to allow introduction of network unreliability */
71 EXT int rx_intentionallyDroppedPacketsPer100 GLOBALSINIT(0); /* Dropped on Send */
72 EXT int rx_intentionallyDroppedOnReadPer100 GLOBALSINIT(0); /* Dropped on Read */
75 /* extra packets to add to the quota */
76 EXT int rx_extraQuota GLOBALSINIT(0);
77 /* extra packets to alloc (2 windows by deflt) */
78 EXT int rx_extraPackets GLOBALSINIT(32);
80 EXT int rx_stackSize GLOBALSINIT(RX_DEFAULT_STACK_SIZE);
82 /* Time until an unresponsive connection is declared dead */
83 EXT int rx_connDeadTime GLOBALSINIT(12);
85 /* Set rx default connection dead time; set on both services and connections at creation time */
87 void rx_SetRxDeadTime(int seconds);
89 #define rx_SetRxDeadTime(seconds) (rx_connDeadTime = (seconds))
92 /* Time until we toss an idle connection */
93 EXT int rx_idleConnectionTime GLOBALSINIT(700);
94 /* Time until we toss a peer structure, after all connections using are gone */
95 EXT int rx_idlePeerTime GLOBALSINIT(60);
97 /* The file server is temporarily salvaging */
98 EXT int rx_tranquil GLOBALSINIT(0);
100 /* UDP rcv buffer size */
101 EXT int rx_UdpBufSize GLOBALSINIT(64 * 1024);
103 int rx_GetMinUdpBufSize(void);
104 void rx_SetUdpBufSize(int x);
106 #define rx_GetMinUdpBufSize() (64*1024)
107 #define rx_SetUdpBufSize(x) (((x)>rx_GetMinUdpBufSize()) ? (rx_UdpBufSize = (x)):0)
110 * Variables to control RX overload management. When the number of calls
111 * waiting for a thread exceed the threshold, new calls are aborted
112 * with the busy error.
114 EXT int rx_BusyThreshold GLOBALSINIT(-1); /* default is disabled */
115 EXT int rx_BusyError GLOBALSINIT(-1);
117 /* These definitions should be in one place */
119 #define RX_CBUF_TIME 180 /* Check for packet deficit */
120 #define RX_REAP_TIME 90 /* Check for tossable connections every 90 seconds */
122 #define RX_CBUF_TIME 120 /* Check for packet deficit */
123 #define RX_REAP_TIME 60 /* Check for tossable connections every 60 seconds */
126 #define RX_FAST_ACK_RATE 1 /* as of 3.4, ask for an ack every
129 EXT int rx_minWindow GLOBALSINIT(1);
130 EXT int rx_initReceiveWindow GLOBALSINIT(16); /* how much to accept */
131 EXT int rx_maxReceiveWindow GLOBALSINIT(64); /* how much to accept */
132 EXT int rx_initSendWindow GLOBALSINIT(16);
133 EXT int rx_maxSendWindow GLOBALSINIT(64);
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 /* EXT int rx_maxWindow GLOBALSINIT(15); Temporary HACK: transmit/receive window */
155 /* If window sizes become very variable (in terms of #packets), be
156 * sure that the sender can get back a hard acks without having to wait for
157 * some kind of timer event first (like a keep-alive, for instance).
158 * It might be kind of tricky, so it might be better to shrink the
159 * window size by reducing the packet size below the "natural" MTU. */
161 #define ACKHACK(p,r) { if (((p)->header.seq & (rxi_SoftAckRate))==0) (p)->header.flags |= RX_REQUEST_ACK; }
163 EXT int rx_nPackets GLOBALSINIT(100); /* obsolete; use rx_extraPackets now */
166 * pthreads thread-specific rx info support
167 * the rx_ts_info_t struct is meant to support all kinds of
168 * thread-specific rx data:
170 * _FPQ member contains a thread-specific free packet queue
172 #ifdef AFS_PTHREAD_ENV
173 EXT pthread_key_t rx_ts_info_key;
174 typedef struct rx_ts_info_t {
176 struct rx_queue queue;
177 int len; /* local queue length */
178 int delta; /* number of new packets alloc'd locally since last sync w/ global queue */
194 struct rx_packet * local_special_packet;
196 struct rx_ts_info_t * rx_ts_info_init(void); /* init function for thread-specific data struct */
197 #define RX_TS_INFO_GET(ts_info_p) \
199 ts_info_p = (struct rx_ts_info_t*)pthread_getspecific(rx_ts_info_key); \
200 if (ts_info_p == NULL) { \
201 assert((ts_info_p = rx_ts_info_init()) != NULL); \
204 #endif /* AFS_PTHREAD_ENV */
207 /* List of free packets */
208 /* in pthreads rx, free packet queue is now a two-tiered queueing system
209 * in which the first tier is thread-specific, and the second tier is
210 * a global free packet queue */
211 EXT struct rx_queue rx_freePacketQueue;
212 #define RX_FPQ_MARK_FREE(p) \
214 if ((p)->flags & RX_PKTFLAG_FREE) \
215 osi_Panic("rx packet already free\n"); \
216 (p)->flags |= RX_PKTFLAG_FREE; \
217 (p)->flags &= ~(RX_PKTFLAG_TQ|RX_PKTFLAG_IOVQ|RX_PKTFLAG_RQ|RX_PKTFLAG_CP); \
221 #define RX_FPQ_MARK_USED(p) \
223 if (!((p)->flags & RX_PKTFLAG_FREE)) \
224 osi_Panic("rx packet not free\n"); \
225 (p)->flags = 0; /* clear RX_PKTFLAG_FREE, initialize the rest */ \
226 (p)->header.flags = 0; \
228 #define RX_PACKET_IOV_INIT(p) \
230 (p)->wirevec[0].iov_base = (char *)((p)->wirehead); \
231 (p)->wirevec[0].iov_len = RX_HEADER_SIZE; \
232 (p)->wirevec[1].iov_base = (char *)((p)->localdata); \
233 (p)->wirevec[1].iov_len = RX_FIRSTBUFFERSIZE; \
235 #define RX_PACKET_IOV_FULLINIT(p) \
237 (p)->wirevec[0].iov_base = (char *)((p)->wirehead); \
238 (p)->wirevec[0].iov_len = RX_HEADER_SIZE; \
239 (p)->wirevec[1].iov_base = (char *)((p)->localdata); \
240 (p)->wirevec[1].iov_len = RX_FIRSTBUFFERSIZE; \
242 (p)->length = RX_FIRSTBUFFERSIZE; \
245 #ifdef RX_ENABLE_LOCKS
246 EXT afs_kmutex_t rx_freePktQ_lock;
247 #endif /* RX_ENABLE_LOCKS */
249 #if defined(AFS_PTHREAD_ENV)
250 #define RX_ENABLE_TSFPQ
251 EXT int rx_TSFPQGlobSize GLOBALSINIT(3); /* number of packets to transfer between global and local queues in one op */
252 EXT int rx_TSFPQLocalMax GLOBALSINIT(15); /* max number of packets on local FPQ before returning a glob to the global pool */
253 EXT int rx_TSFPQMaxProcs GLOBALSINIT(0); /* max number of threads expected */
254 void rxi_MorePacketsTSFPQ(int apackets, int flush_global, int num_keep_local); /* more flexible packet alloc function */
255 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 */
256 void rxi_FlushLocalPacketsTSFPQ(void); /* flush all thread-local packets to global queue */
257 #define RX_TS_FPQ_FLUSH_GLOBAL 1
258 #define RX_TS_FPQ_PULL_GLOBAL 1
259 #define RX_TS_FPQ_ALLOW_OVERCOMMIT 1
261 * compute the localmax and globsize values from rx_TSFPQMaxProcs and rx_nPackets.
262 * arbitarily set local max so that all threads consume 90% of packets, if all local queues are full.
263 * arbitarily set transfer glob size to 20% of max local packet queue length.
264 * also set minimum values of 15 and 3. Given the algorithms, the number of buffers allocated
265 * by each call to AllocPacketBufs() will increase indefinitely without a cap on the transfer
266 * glob size. A cap of 64 is selected because that will produce an allocation of greater than
267 * three times that amount which is greater than half of ncalls * maxReceiveWindow.
269 #define RX_TS_FPQ_COMPUTE_LIMITS \
271 register int newmax, newglob; \
272 newmax = (rx_nPackets * 9) / (10 * rx_TSFPQMaxProcs); \
273 newmax = (newmax >= 15) ? newmax : 15; \
274 newglob = newmax / 5; \
275 newglob = (newglob >= 3) ? (newglob < 64 ? newglob : 64) : 3; \
276 rx_TSFPQLocalMax = newmax; \
277 rx_TSFPQGlobSize = newglob; \
279 /* record the number of packets allocated by this thread
280 * and stored in the thread local queue */
281 #define RX_TS_FPQ_LOCAL_ALLOC(rx_ts_info_p,num_alloc) \
283 (rx_ts_info_p)->_FPQ.lalloc_ops++; \
284 (rx_ts_info_p)->_FPQ.lalloc_xfer += num_alloc; \
286 /* record the number of packets allocated by this thread
287 * and stored in the global queue */
288 #define RX_TS_FPQ_GLOBAL_ALLOC(rx_ts_info_p,num_alloc) \
290 (rx_ts_info_p)->_FPQ.galloc_ops++; \
291 (rx_ts_info_p)->_FPQ.galloc_xfer += num_alloc; \
293 /* move packets from local (thread-specific) to global free packet queue.
294 rx_freePktQ_lock must be held. default is to reduce the queue size to 40% ofmax */
295 #define RX_TS_FPQ_LTOG(rx_ts_info_p) \
298 register struct rx_packet * p; \
299 register int tsize = (rx_ts_info_p)->_FPQ.len - rx_TSFPQLocalMax + 3 * rx_TSFPQGlobSize; \
300 if (tsize <= 0) break; \
301 for (i=0,p=queue_Last(&((rx_ts_info_p)->_FPQ), rx_packet); \
302 i < tsize; i++,p=queue_Prev(p, rx_packet)); \
303 queue_SplitAfterPrepend(&((rx_ts_info_p)->_FPQ),&rx_freePacketQueue,p); \
304 (rx_ts_info_p)->_FPQ.len -= tsize; \
305 rx_nFreePackets += tsize; \
306 (rx_ts_info_p)->_FPQ.ltog_ops++; \
307 (rx_ts_info_p)->_FPQ.ltog_xfer += tsize; \
308 if ((rx_ts_info_p)->_FPQ.delta) { \
309 MUTEX_ENTER(&rx_stats_mutex); \
310 RX_TS_FPQ_COMPUTE_LIMITS; \
311 MUTEX_EXIT(&rx_stats_mutex); \
312 (rx_ts_info_p)->_FPQ.delta = 0; \
315 /* same as above, except user has direct control over number to transfer */
316 #define RX_TS_FPQ_LTOG2(rx_ts_info_p,num_transfer) \
319 register struct rx_packet * p; \
320 if (num_transfer <= 0) break; \
321 for (i=0,p=queue_Last(&((rx_ts_info_p)->_FPQ), rx_packet); \
322 i < (num_transfer); i++,p=queue_Prev(p, rx_packet)); \
323 queue_SplitAfterPrepend(&((rx_ts_info_p)->_FPQ),&rx_freePacketQueue,p); \
324 (rx_ts_info_p)->_FPQ.len -= (num_transfer); \
325 rx_nFreePackets += (num_transfer); \
326 (rx_ts_info_p)->_FPQ.ltog_ops++; \
327 (rx_ts_info_p)->_FPQ.ltog_xfer += (num_transfer); \
328 if ((rx_ts_info_p)->_FPQ.delta) { \
329 MUTEX_ENTER(&rx_stats_mutex); \
330 RX_TS_FPQ_COMPUTE_LIMITS; \
331 MUTEX_EXIT(&rx_stats_mutex); \
332 (rx_ts_info_p)->_FPQ.delta = 0; \
335 /* move packets from global to local (thread-specific) free packet queue.
336 rx_freePktQ_lock must be held. */
337 #define RX_TS_FPQ_GTOL(rx_ts_info_p) \
339 register int i, tsize; \
340 register struct rx_packet * p; \
341 tsize = (rx_TSFPQGlobSize <= rx_nFreePackets) ? \
342 rx_TSFPQGlobSize : rx_nFreePackets; \
343 for (i=0,p=queue_First(&rx_freePacketQueue, rx_packet); \
344 i < tsize; i++,p=queue_Next(p, rx_packet)); \
345 queue_SplitBeforeAppend(&rx_freePacketQueue,&((rx_ts_info_p)->_FPQ),p); \
346 (rx_ts_info_p)->_FPQ.len += i; \
347 rx_nFreePackets -= i; \
348 (rx_ts_info_p)->_FPQ.gtol_ops++; \
349 (rx_ts_info_p)->_FPQ.gtol_xfer += i; \
351 /* same as above, except user has direct control over number to transfer */
352 #define RX_TS_FPQ_GTOL2(rx_ts_info_p,num_transfer) \
354 register int i, tsize; \
355 register struct rx_packet * p; \
356 tsize = (num_transfer); \
357 if (tsize > rx_nFreePackets) tsize = rx_nFreePackets; \
358 for (i=0,p=queue_First(&rx_freePacketQueue, rx_packet); \
359 i < tsize; i++,p=queue_Next(p, rx_packet)); \
360 queue_SplitBeforeAppend(&rx_freePacketQueue,&((rx_ts_info_p)->_FPQ),p); \
361 (rx_ts_info_p)->_FPQ.len += i; \
362 rx_nFreePackets -= i; \
363 (rx_ts_info_p)->_FPQ.gtol_ops++; \
364 (rx_ts_info_p)->_FPQ.gtol_xfer += i; \
366 /* checkout a packet from the thread-specific free packet queue */
367 #define RX_TS_FPQ_CHECKOUT(rx_ts_info_p,p) \
369 (p) = queue_First(&((rx_ts_info_p)->_FPQ), rx_packet); \
371 RX_FPQ_MARK_USED(p); \
372 (rx_ts_info_p)->_FPQ.len--; \
373 (rx_ts_info_p)->_FPQ.checkout_ops++; \
374 (rx_ts_info_p)->_FPQ.checkout_xfer++; \
376 /* checkout multiple packets from the thread-specific free packet queue.
377 * num_transfer must be a variable.
379 #define RX_TS_FPQ_QCHECKOUT(rx_ts_info_p,num_transfer,q) \
382 register struct rx_packet *p; \
383 if (num_transfer > (rx_ts_info_p)->_FPQ.len) num_transfer = (rx_ts_info_p)->_FPQ.len; \
384 for (i=0, p=queue_First(&((rx_ts_info_p)->_FPQ), rx_packet); \
386 i++, p=queue_Next(p, rx_packet)) { \
387 RX_FPQ_MARK_USED(p); \
389 queue_SplitBeforeAppend(&((rx_ts_info_p)->_FPQ),(q),p); \
390 (rx_ts_info_p)->_FPQ.len -= num_transfer; \
391 (rx_ts_info_p)->_FPQ.checkout_ops++; \
392 (rx_ts_info_p)->_FPQ.checkout_xfer += num_transfer; \
394 /* check a packet into the thread-specific free packet queue */
395 #define RX_TS_FPQ_CHECKIN(rx_ts_info_p,p) \
397 queue_Prepend(&((rx_ts_info_p)->_FPQ), (p)); \
398 RX_FPQ_MARK_FREE(p); \
399 (rx_ts_info_p)->_FPQ.len++; \
400 (rx_ts_info_p)->_FPQ.checkin_ops++; \
401 (rx_ts_info_p)->_FPQ.checkin_xfer++; \
403 /* check multiple packets into the thread-specific free packet queue */
404 /* num_transfer must equal length of (q); it is not a means of checking
405 * in part of (q). passing num_transfer just saves us instructions
406 * since caller already knows length of (q) for other reasons */
407 #define RX_TS_FPQ_QCHECKIN(rx_ts_info_p,num_transfer,q) \
409 register struct rx_packet *p, *np; \
410 for (queue_Scan((q), p, np, rx_packet)) { \
411 RX_FPQ_MARK_FREE(p); \
413 queue_SplicePrepend(&((rx_ts_info_p)->_FPQ),(q)); \
414 (rx_ts_info_p)->_FPQ.len += (num_transfer); \
415 (rx_ts_info_p)->_FPQ.checkin_ops++; \
416 (rx_ts_info_p)->_FPQ.checkin_xfer += (num_transfer); \
418 #endif /* AFS_PTHREAD_ENV */
420 /* Number of free packets */
421 EXT int rx_nFreePackets GLOBALSINIT(0);
422 EXT int rxi_NeedMorePackets GLOBALSINIT(0);
423 EXT int rx_nWaiting GLOBALSINIT(0);
424 EXT int rx_nWaited GLOBALSINIT(0);
425 EXT int rx_packetReclaims GLOBALSINIT(0);
427 /* largest packet which we can safely receive, initialized to AFS 3.2 value
428 * This is provided for backward compatibility with peers which may be unable
429 * to swallow anything larger. THIS MUST NEVER DECREASE WHILE AN APPLICATION
431 EXT afs_uint32 rx_maxReceiveSize GLOBALSINIT(_OLD_MAX_PACKET_SIZE * RX_MAX_FRAGS +
432 UDP_HDR_SIZE * (RX_MAX_FRAGS - 1));
434 /* this is the maximum packet size that the user wants us to receive */
435 /* this is set by rxTune if required */
436 EXT afs_uint32 rx_maxReceiveSizeUser GLOBALSINIT(0xffffffff);
438 /* rx_MyMaxSendSize is the size of the largest packet we will send,
439 * including the RX header. Just as rx_maxReceiveSize is the
440 * max we will receive, including the rx header.
442 EXT afs_uint32 rx_MyMaxSendSize GLOBALSINIT(8588);
444 /* Maximum size of a jumbo datagram we can receive */
445 EXT afs_uint32 rx_maxJumboRecvSize GLOBALSINIT(RX_MAX_PACKET_SIZE);
447 /* need this to permit progs to run on AIX systems */
448 EXT int (*rxi_syscallp) (afs_uint32 a3, afs_uint32 a4, void *a5)GLOBALSINIT(0);
450 /* List of free queue entries */
451 EXT struct rx_serverQueueEntry *rx_FreeSQEList GLOBALSINIT(0);
452 #ifdef RX_ENABLE_LOCKS
453 EXT afs_kmutex_t freeSQEList_lock;
456 /* List of free call structures */
457 EXT struct rx_queue rx_freeCallQueue;
458 #ifdef RX_ENABLE_LOCKS
459 EXT afs_kmutex_t rx_freeCallQueue_lock;
461 EXT afs_int32 rxi_nCalls GLOBALSINIT(0);
463 /* 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. */
466 #if !defined(KERNEL) && !defined(AFS_PTHREAD_ENV)
467 /* 32-bit select Mask for rx_Listener. */
468 EXT fd_set rx_selectMask;
469 EXT osi_socket rx_maxSocketNumber; /* Maximum socket number in the select mask. */
470 /* Minumum socket number in the select mask. */
471 EXT osi_socket rx_minSocketNumber GLOBALSINIT(0x7fffffff);
474 /* This is actually the minimum number of packets that must remain free,
475 overall, immediately after a packet of the requested class has been
476 allocated. *WARNING* These must be assigned with a great deal of care.
477 In order, these are receive quota, send quota, special quota, receive
478 continuation quota, and send continuation quota. */
479 #define RX_PACKET_QUOTAS {1, 10, 0, 1, 10}
480 /* value large enough to guarantee that no allocation fails due to RX_PACKET_QUOTAS.
481 Make it a little bigger, just for fun */
482 #define RX_MAX_QUOTA 15 /* part of min packet computation */
483 EXT int rx_packetQuota[RX_N_PACKET_CLASSES] GLOBALSINIT(RX_PACKET_QUOTAS);
484 EXT int meltdown_1pkt GLOBALSINIT(1); /* prefer to schedule single-packet calls */
485 EXT int rxi_doreclaim GLOBALSINIT(1); /* if discard one packet, discard all */
486 EXT int rxi_md2cnt GLOBALSINIT(0); /* counter of skipped calls */
487 EXT int rxi_2dchoice GLOBALSINIT(1); /* keep track of another call to schedule */
489 /* quota system: each attached server process must be able to make
490 progress to avoid system deadlock, so we ensure that we can always
491 handle the arrival of the next unacknowledged data packet for an
492 attached call. rxi_dataQuota gives the max # of packets that must be
493 reserved for active calls for them to be able to make progress, which is
494 essentially enough to queue up a window-full of packets (the first packet
495 may be missing, so these may not get read) + the # of packets the thread
496 may use before reading all of its input (# free must be one more than send
497 packet quota). Thus, each thread allocates rx_maxReceiveWindow+1 (max
498 queued packets) + an extra for sending data. The system also reserves
499 RX_MAX_QUOTA (must be more than RX_PACKET_QUOTA[i], which is 10), so that
500 the extra packet can be sent (must be under the system-wide send packet
501 quota to send any packets) */
502 /* # to reserve so that thread with input can still make calls (send packets)
504 EXT int rxi_dataQuota GLOBALSINIT(RX_MAX_QUOTA); /* packets to reserve for active threads */
506 EXT afs_int32 rxi_availProcs GLOBALSINIT(0); /* number of threads in the pool */
507 EXT afs_int32 rxi_totalMin GLOBALSINIT(0); /* Sum(minProcs) forall services */
508 EXT afs_int32 rxi_minDeficit GLOBALSINIT(0); /* number of procs needed to handle all minProcs */
510 EXT int rx_nextCid; /* Next connection call id */
511 EXT int rx_epoch; /* Initialization time of rx */
512 #ifdef RX_ENABLE_LOCKS
513 EXT afs_kcondvar_t rx_waitingForPackets_cv;
515 EXT char rx_waitingForPackets; /* Processes set and wait on this variable when waiting for packet buffers */
517 EXT struct rx_statistics rx_stats;
519 EXT struct rx_peer **rx_peerHashTable;
520 EXT struct rx_connection **rx_connHashTable;
521 EXT struct rx_connection *rx_connCleanup_list GLOBALSINIT(0);
522 EXT afs_uint32 rx_hashTableSize GLOBALSINIT(257); /* Prime number */
523 #ifdef RX_ENABLE_LOCKS
524 EXT afs_kmutex_t rx_peerHashTable_lock;
525 EXT afs_kmutex_t rx_connHashTable_lock;
526 #endif /* RX_ENABLE_LOCKS */
528 #define CONN_HASH(host, port, cid, epoch, type) ((((cid)>>RX_CIDSHIFT)%rx_hashTableSize))
530 #define PEER_HASH(host, port) ((host ^ port) % rx_hashTableSize)
532 /* Forward definitions of internal procedures */
533 #define rxi_ChallengeOff(conn) rxevent_Cancel((conn)->challengeEvent, (struct rx_call*)0, 0);
534 #define rxi_KeepAliveOff(call) rxevent_Cancel((call)->keepAliveEvent, call, RX_CALL_REFCOUNT_ALIVE)
536 #define rxi_AllocSecurityObject() (struct rx_securityClass *) rxi_Alloc(sizeof(struct rx_securityClass))
537 #define rxi_FreeSecurityObject(obj) rxi_Free(obj, sizeof(struct rx_securityClass))
538 #define rxi_AllocService() (struct rx_service *) rxi_Alloc(sizeof(struct rx_service))
539 #define rxi_FreeService(obj) rxi_Free(obj, sizeof(struct rx_service))
540 #define rxi_AllocPeer() (struct rx_peer *) rxi_Alloc(sizeof(struct rx_peer))
541 #define rxi_FreePeer(peer) rxi_Free(peer, sizeof(struct rx_peer))
542 #define rxi_AllocConnection() (struct rx_connection *) rxi_Alloc(sizeof(struct rx_connection))
543 #define rxi_FreeConnection(conn) (rxi_Free(conn, sizeof(struct rx_connection)))
546 /* Some debugging stuff */
547 EXT FILE *rx_debugFile; /* Set by the user to a stdio file for debugging output */
548 EXT FILE *rxevent_debugFile; /* Set to an stdio descriptor for event logging to that file */
550 #define rx_Log rx_debugFile
552 EXT int rxdebug_active;
553 #define dpf(args) do { if (rxdebug_active) rxi_DebugPrint args; } while (0)
556 #define dpf(args) FSLog args
558 #define dpf(args) do { if (rx_debugFile) rxi_DebugPrint args; } while (0)
561 #define rx_Log_event rxevent_debugFile
563 EXT char *rx_packetTypes[RX_N_PACKET_TYPES] GLOBALSINIT(RX_PACKET_TYPES); /* Strings defined in rx.h */
567 * Counter used to implement connection specific data
569 EXT int rxi_keyCreate_counter GLOBALSINIT(0);
571 * Array of function pointers used to destory connection specific data
573 EXT rx_destructor_t *rxi_keyCreate_destructor GLOBALSINIT(NULL);
574 #ifdef RX_ENABLE_LOCKS
575 EXT afs_kmutex_t rxi_keyCreate_lock;
576 #endif /* RX_ENABLE_LOCKS */
584 * SERVER ONLY: Threshholds used to throttle error replies to looping
585 * clients. When consecutive calls are aborting with the same error, the
586 * server throttles the client by waiting before sending error messages.
587 * Disabled if abort thresholds are zero.
589 EXT int rxi_connAbortThreshhold GLOBALSINIT(0);
590 EXT int rxi_connAbortDelay GLOBALSINIT(3000);
591 EXT int rxi_callAbortThreshhold GLOBALSINIT(0);
592 EXT int rxi_callAbortDelay GLOBALSINIT(3000);
595 * Thread specific thread ID used to implement LWP_Index().
598 #if defined(AFS_PTHREAD_ENV)
599 EXT int rxi_fcfs_thread_num GLOBALSINIT(0);
600 EXT pthread_key_t rx_thread_id_key;
601 /* keep track of pthread numbers - protected by rx_stats_mutex,
602 except in rx_Init() before mutex exists! */
603 EXT int rxi_pthread_hinum GLOBALSINIT(0);
605 #define rxi_fcfs_thread_num (0)
608 #if defined(RX_ENABLE_LOCKS)
609 EXT afs_kmutex_t rx_stats_mutex; /* used to activate stats gathering */
612 EXT2 int rx_enable_stats GLOBALSINIT(0);
615 * Set this flag to enable the listener thread to trade places with an idle
616 * worker thread to move the context switch from listener to worker out of
619 EXT int rx_enable_hot_thread GLOBALSINIT(0);
622 * Set rx_max_clones_per_connection to a value > 0 to enable connection clone
623 * workaround to RX_MAXCALLS limit.
626 #define RX_HARD_MAX_CLONES 10
628 EXT int rx_max_clones_per_connection GLOBALSINIT(2);
630 EXT int RX_IPUDP_SIZE GLOBALSINIT(_RX_IPUDP_SIZE);
631 #endif /* AFS_RX_GLOBALS_H */