aboutsummaryrefslogtreecommitdiffstats
path: root/Makefile
diff options
context:
space:
mode:
authorLoïc Hoguin <[email protected]>2011-03-27 01:16:11 +0100
committerLoïc Hoguin <[email protected]>2011-03-27 01:16:11 +0100
commitd0d9b0e8b363b456bd0b9e5fbdebc90f055546c3 (patch)
treef6692301fa8f811ad3e8c042875bd576aba290f1 /Makefile
parent5726aa3d85c0b8642b90d698b15fee8e5a0281fb (diff)
downloadcowboy-d0d9b0e8b363b456bd0b9e5fbdebc90f055546c3.tar.gz
cowboy-d0d9b0e8b363b456bd0b9e5fbdebc90f055546c3.tar.bz2
cowboy-d0d9b0e8b363b456bd0b9e5fbdebc90f055546c3.zip
Use a more efficient variant of string:to_lower to improve performance.
After much testing and experimentation of all kinds I find lists to be both faster and using less memory than binaries for request-line and headers handling. This is more than likely due to the fact that headers are very short and thus do not benefit from the advantages of refc binaries, meaning they're copied, just like lists. The memory usage discrepancy is still a mystery for the most part, although the hoops needed to perform operations on the binaries are probably responsible for the extra memory use. I'm thus giving up on trying to use binaries for request-line and headers. Instead, this commit improves performances even more to the lists code, making lists 5% faster than binaries. Lists are easier to work with too, so I guess it's all a big win for everyone. Of course the request body is still read as a binary, we're using the binary type where it performs best.
Diffstat (limited to 'Makefile')
0 files changed, 0 insertions, 0 deletions