| commit | 4a29144591e5ae192a238da7698f760a770824dd | [log] [tgz] |
|---|---|---|
| author | Willy Tarreau <w@1wt.eu> | Thu Dec 13 23:34:18 2012 +0100 |
| committer | Willy Tarreau <w@1wt.eu> | Thu Dec 13 23:34:18 2012 +0100 |
| tree | 1549387a404ec3a2ec705e324f5751eb2199665f | |
| parent | 462c7206bce85eee93a9f94dd31897fbfaa1c3fc [diff] |
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.