mirrors/haproxy
1
0
Fork 0
mirror of https://git.haproxy.org/git/haproxy.git/ synced 2025-11-26 21:31:01 +01:00
Code Issues Projects Releases Wiki Activity

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

Browse Source 
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.
This commit is contained in:
Willy Tarreau 2012-12-13 23:34:18 +01:00
parent 462c7206bc
commit 4a29144591
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
include/proto/fd.h
View File

@ -89,8 +89,8 @@ static inline void updt_fd(const int fd)
if (fdtab[fd].updated)
/* already scheduled for update */
return;
fd_updt[fd_nbupdt++] = fd;
fdtab[fd].updated = 1;
fd_updt[fd_nbupdt++] = fd;
}
@ -100,8 +100,9 @@ static inline void alloc_spec_entry(const int fd)
if (fdtab[fd].spec_p)
/* FD already in speculative I/O list */
return;
fd_spec[fd_nbspec++] = fd;
fd_nbspec++;
fdtab[fd].spec_p = fd_nbspec;
fd_spec[fd_nbspec-1] = fd;
}
/* Removes entry used by fd <fd> from the spec list and replaces it with the
@ -117,7 +118,7 @@ static inline void release_spec_entry(int fd)
return;
fdtab[fd].spec_p = 0;
fd_nbspec--;
if (pos <= fd_nbspec) {
if (likely(pos <= fd_nbspec)) {
/* was not the last entry */
fd = fd_spec[fd_nbspec];
fd_spec[pos - 1] = fd;