summaryrefslogtreecommitdiffstats
path: root/sys/dev/hatm/if_hatm_intr.c
diff options
context:
space:
mode:
authorharti <harti@FreeBSD.org>2003-11-05 10:32:21 +0000
committerharti <harti@FreeBSD.org>2003-11-05 10:32:21 +0000
commit61d4a5e43e667ce669fddb3aebbf34e29eab69d5 (patch)
tree11487643c675c5cd5d15a6051b3db2206228534e /sys/dev/hatm/if_hatm_intr.c
parent8d2743b3bb7bd896062367bb697f4c6968104c51 (diff)
downloadFreeBSD-src-61d4a5e43e667ce669fddb3aebbf34e29eab69d5.zip
FreeBSD-src-61d4a5e43e667ce669fddb3aebbf34e29eab69d5.tar.gz
Replace the lock-less algorithm for the free item list with a more
conservative lock. The problem with the lock-less algorithm is that it suffers from the ABA problem. Running an application with funnels a couple of 100kpkts/s through the netgraph system on a dual CPU system with MPSAFE drivers will panic almost immediatly with the old algorithm. It may be possible to eliminate the contention between threads that insert free items into the list and those that get free items by using the Michael/Scott queue algorithm that has two locks.
Diffstat (limited to 'sys/dev/hatm/if_hatm_intr.c')
0 files changed, 0 insertions, 0 deletions
OpenPOWER on IntegriCloud