aboutsummaryrefslogtreecommitdiff
path: root/src/common/di_ops.c
diff options
context:
space:
mode:
authorNick Mathewson <nickm@torproject.org>2011-05-15 19:56:05 -0400
committerNick Mathewson <nickm@torproject.org>2011-05-15 19:56:05 -0400
commit10d670674aa49ee6764cf93fe7d3f485a3f9ffd8 (patch)
tree05d049c119638c54570f4edd35623b3a2dafe4e8 /src/common/di_ops.c
parentb48f83ab8c27b6a26d4afe5177238a99637a1dc1 (diff)
downloadtor-10d670674aa49ee6764cf93fe7d3f485a3f9ffd8.tar
tor-10d670674aa49ee6764cf93fe7d3f485a3f9ffd8.tar.gz
Another doc tweak on tor_memcmp: <b>b</b>, not <b>.
Diffstat (limited to 'src/common/di_ops.c')
-rw-r--r--src/common/di_ops.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/common/di_ops.c b/src/common/di_ops.c
index 3da033cf6..b22a58d1b 100644
--- a/src/common/di_ops.c
+++ b/src/common/di_ops.c
@@ -10,11 +10,11 @@
#include "di_ops.h"
/**
- * Timing-safe version of memcmp. As memcmp, compare the <b>sz</b> bytes
- * at <b>a</b> with the <b>sz</b> bytes at <b>, and return less than 0 if the
- * bytes at <b>a</b> lexically precede those at <b>b</b>, 0 if the byte ranges
- * are equal, and greater than zero if the bytes at <b>a</b> lexically follow
- * those at <b>.
+ * Timing-safe version of memcmp. As memcmp, compare the <b>sz</b> bytes at
+ * <b>a</b> with the <b>sz</b> bytes at <b>b</b>, and return less than 0 if
+ * the bytes at <b>a</b> lexically precede those at <b>b</b>, 0 if the byte
+ * ranges are equal, and greater than zero if the bytes at <b>a</b> lexically
+ * follow those at <b>b</b>.
*
* This implementation differs from memcmp in that its timing behavior is not
* data-dependent: it should return in the same amount of time regardless of
@@ -85,7 +85,7 @@ tor_memcmp(const void *a, const void *b, size_t len)
/**
* Timing-safe memory comparison. Return true if the <b>sz</b> bytes at
- * <b>a</b> are the same as the <b>sz</b> bytes at <b>, and 0 otherwise.
+ * <b>a</b> are the same as the <b>sz</b> bytes at <b>b</b>, and 0 otherwise.
*
* This implementation differs from !memcmp(a,b,sz) in that its timing
* behavior is not data-dependent: it should return in the same amount of time