Willy Tarreau 4a29144591 OPTIM: poll: optimize fd management functions for low register count CPUs ...

Looking at the assembly code that updt_fd() and alloc/release_spec_entry
produce in the polling loops, it's clear that gcc has to recompute pointers
several times in a row because of limited spare registers. By better
grouping adjacent structure updates, we improve the code size by around
60 bytes in the fast path on x86.

2012-12-13 23:34:18 +01:00

..

common

MINOR: standard: add a simple popcount function

2012-11-19 12:12:24 +01:00

import

[MAJOR] replace ultree with ebtree in wait-queues

2008-06-24 08:17:16 +02:00

proto

OPTIM: poll: optimize fd management functions for low register count CPUs

2012-12-13 23:34:18 +01:00

types

CLEANUP: session: use an array for the stick counters

2012-12-09 15:57:16 +01:00