diff --git a/lib/dns/name.c b/lib/dns/name.c index 371c5d60a8..7fe7d39fc7 100644 --- a/lib/dns/name.c +++ b/lib/dns/name.c @@ -595,6 +595,7 @@ dns_name_fullcompare(const dns_name_t *name1, const dns_name_t *name2, else count = count2; + /* Loop unrolled for performance */ while (count > 3) { chdiff = (int)maptolower[label1[0]] - (int)maptolower[label2[0]]; @@ -625,7 +626,8 @@ dns_name_fullcompare(const dns_name_t *name1, const dns_name_t *name2, label2 += 4; } while (count-- > 0) { - chdiff = (int)maptolower[*label1++] - (int)maptolower[*label2++]; + chdiff = (int)maptolower[*label1++] - + (int)maptolower[*label2++]; if (chdiff != 0) { *orderp = chdiff; goto done; @@ -719,6 +721,7 @@ dns_name_equal(const dns_name_t *name1, const dns_name_t *name2) { INSIST(count <= 63); /* no bitstring support */ + /* Loop unrolled for performance */ while (count > 3) { c = maptolower[label1[0]]; if (c != maptolower[label2[0]]) diff --git a/lib/dns/rbt.c b/lib/dns/rbt.c index 8b83276290..a2ec3bc70d 100644 --- a/lib/dns/rbt.c +++ b/lib/dns/rbt.c @@ -181,7 +181,8 @@ Name(dns_rbtnode_t *node) { #ifdef DNS_RBT_USEHASH -/* Upper node is the parent of the root of the passed node's +/* + * Upper node is the parent of the root of the passed node's * subtree. The passed node must not be NULL. */ static inline dns_rbtnode_t * diff --git a/lib/isc/include/isc/hash.h b/lib/isc/include/isc/hash.h index c9eb1da24e..6f96ea7588 100644 --- a/lib/isc/include/isc/hash.h +++ b/lib/isc/include/isc/hash.h @@ -200,7 +200,8 @@ isc_hash_function_reverse(const void *data, size_t length, * isc_hash_function() calculates the hash from start to end over the * input data. isc_hash_function_reverse() calculates the hash from the * end to the start over the input data. The difference in order is - * useful in incremental hashing. + * useful in incremental hashing; for example, a previously hashed + * value for 'com' can be used as input when hashing 'example.com'. * * This is a new variant of isc_hash_calc() and will supercede * isc_hash_calc() eventually.