summaryrefslogtreecommitdiffstats
path: root/lkm
diff options
context:
space:
mode:
authorpst <pst@FreeBSD.org>1996-09-20 21:25:18 +0000
committerpst <pst@FreeBSD.org>1996-09-20 21:25:18 +0000
commitdd5375bf7c0c606b2a6c6e73255d88eb6e1edfd6 (patch)
tree11f85b992773b9cda81b9ca3502b35400e3e4a5f /lkm
parent6b0658e42a8a02e0a434e3dcf148253d1087ff57 (diff)
downloadFreeBSD-src-dd5375bf7c0c606b2a6c6e73255d88eb6e1edfd6.zip
FreeBSD-src-dd5375bf7c0c606b2a6c6e73255d88eb6e1edfd6.tar.gz
If the incomplete listen queue for a given socket is full,
drop the oldest entry in the queue. There was a fair bit of discussion as to whether or not the proper action is to drop a random entry in the queue. It's my conclusion that a random drop is better than a head drop, however profiling this section of code (done by John Capo) shows that a head-drop results in a significant performance increase. There are scenarios where a random drop is more appropriate. If I find one in reality, I'll add the random drop code under a conditional. Obtained from: discussions and code done by Vernon Schryver (vjs@sgi.com).
Diffstat (limited to 'lkm')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud