projects / dragonfly.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 31ae001) | patch
Replace the linear search in file descriptor allocation with an O(log N)
authorJeffrey Hsu <hsu@dragonflybsd.org>
Tue, 21 Jun 2005 23:58:53 +0000 (23:58 +0000)
committerJeffrey Hsu <hsu@dragonflybsd.org>
Tue, 21 Jun 2005 23:58:53 +0000 (23:58 +0000)
commit6990831969dfb27b4450d9696f7f9676d0697b54
tree0140f52c0515787687700320bb389f42ab8b0d18tree | snapshot
parent31ae001b6a8ec19b6aed5b362c6b7a15da6b9f5bcommit | diff
Replace the linear search in file descriptor allocation with an O(log N)
algorithm based on full in-place binary search trees augmented with
subtree free file descriptor counts.

Idea from: Solaris
sys/dev/misc/streams/streams.c diff | blob | blame | history
sys/kern/init_main.c diff | blob | blame | history
sys/kern/kern_descrip.c diff | blob | blame | history
sys/kern/sys_pipe.c diff | blob | blame | history
sys/kern/uipc_syscalls.c diff | blob | blame | history
sys/kern/vfs_syscalls.c diff | blob | blame | history
sys/sys/filedesc.h diff | blob | blame | history
DragonFly Project Source