aboutsummaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorIgor Sysoev <igor@sysoev.ru>2007-01-12 18:05:41 +0000
committerIgor Sysoev <igor@sysoev.ru>2007-01-12 18:05:41 +0000
commit8f6a00c3efbfedfe0792464726c08ffe2bffdcd0 (patch)
treeb293506ff763050156225fb92a093d510189a582 /src
parentb1d65e50d6d69a341a50a29cac24e8909d872929 (diff)
downloadnginx-8f6a00c3efbfedfe0792464726c08ffe2bffdcd0.tar.gz
nginx-8f6a00c3efbfedfe0792464726c08ffe2bffdcd0.zip
fix comment
Diffstat (limited to 'src')
-rw-r--r--src/core/ngx_crc32.c6
1 files changed, 3 insertions, 3 deletions
diff --git a/src/core/ngx_crc32.c b/src/core/ngx_crc32.c
index 4ad8ff3a4..64b02ac7a 100644
--- a/src/core/ngx_crc32.c
+++ b/src/core/ngx_crc32.c
@@ -13,11 +13,11 @@
* described at http://www.w3.org/TR/PNG/
*
* The 256 element lookup table takes 1024 bytes, and it may be completely
- * cached after processing about 30-60 bytes. So for short messages
+ * cached after processing about 30-60 bytes of data. So for short data
* we use the 16 element lookup table that takes only 64 bytes and align it
* to CPU cache line size. Of course, the small table adds code inside
- * CRC32 cycle, but cache misses overhead is bigger than overhead of
- * the additional code. For example, ngx_crc32_short() of 16 byte message
+ * CRC32 loop, but the cache misses overhead is bigger than overhead of
+ * the additional code. For example, ngx_crc32_short() of 16 bytes of data
* takes half as much CPU clocks than ngx_crc32_long().
*/