darlinghq/darling-libkqueue
1
0
Fork 0
mirror of https://github.com/darlinghq/darling-libkqueue.git synced 2024-10-07 09:13:21 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Use a lock-free static array for kqueue descriptors < 512

Browse Source 
git-svn-id: svn://svn.code.sf.net/p/libkqueue/code/trunk@410 fb4e3144-bc1c-4b72-a658-5bcd248dd7f7
This commit is contained in:
mheily 2011-02-02 03:13:24 +00:00
parent b3d0b26c5a
commit 23dafe1f21
1 changed files with 33 additions and 28 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

61
src/common/kqueue.c
View File

@ -27,6 +27,15 @@
int KQUEUE_DEBUG = 0;
/*
* Fast path (lock-free) for kqueue descriptors < KQLIST_MAX
*/
#define KQLIST_MAX 512
static struct kqueue *kqlist[KQLIST_MAX];
/*
* Slow path for kqueue descriptors > KQLIST_MAX
*/
static RB_HEAD(kqt, kqueue) kqtree = RB_INITIALIZER(&kqtree);
static pthread_rwlock_t kqtree_mtx;
@ -66,26 +75,23 @@ kqueue_free(struct kqueue *kq)
free(kq);
}
void
kqueue_put(struct kqueue *kq)
{
atomic_dec(&kq->kq_ref);
/* TODO: free() object when refcount == 0 */
}
struct kqueue *
kqueue_get(int kq)
kqueue_lookup(int kq)
{
struct kqueue query;
struct kqueue *ent = NULL;
query.kq_id = kq;
pthread_rwlock_rdlock(&kqtree_mtx);
ent = RB_FIND(kqt, &kqtree, &query);
pthread_rwlock_unlock(&kqtree_mtx);
if (ent != NULL)
atomic_inc(&ent->kq_ref);
if (slowpath(kq < 0)) {
return (NULL);
}
if (fastpath(kq < KQLIST_MAX)) {
ent = kqlist[kq];
} else {
query.kq_id = kq;
pthread_rwlock_rdlock(&kqtree_mtx);
ent = RB_FIND(kqt, &kqtree, &query);
pthread_rwlock_unlock(&kqtree_mtx);
}
return (ent);
}
@ -98,21 +104,20 @@ kqueue(void)
kq = calloc(1, sizeof(*kq));
if (kq == NULL)
return (-1);
kq->kq_ref = 1;
pthread_mutex_init(&kq->kq_mtx, NULL);
pthread_rwlock_wrlock(&kqtree_mtx);
if (kqops.kqueue_init(kq) < 0)
goto errout;
RB_INSERT(kqt, &kqtree, kq);
pthread_rwlock_unlock(&kqtree_mtx);
if (kqops.kqueue_init(kq) < 0) {
free(kq);
return (-1);
}
if (kq->kq_id < KQLIST_MAX) {
kqlist[kq->kq_id] = kq;
} else {
pthread_rwlock_wrlock(&kqtree_mtx);
RB_INSERT(kqt, &kqtree, kq);
pthread_rwlock_unlock(&kqtree_mtx);
}
dbg_printf("created kqueue, fd=%d", kq->kq_id);
return (kq->kq_id);
errout:
pthread_rwlock_unlock(&kqtree_mtx);
kqops.kqueue_free(kq);
free(kq);
return (-1);
}