Cross Reference: /src/sys/net/zlib.c

Lines Matching defs:EQUAL
484     /* Depth of each subtree used as tie breaker for trees of equal frequency
754 #define EQUAL 0
755 /* result of memcmp for equal strings */
1095 	     * avail_in equal to zero. There won't be anything to do,
1338  * return its length. Matches shorter or equal to prev_length are discarded,
1339  * in which case the result is equal to prev_length and match_start is
1411          * always equal when the other bytes match, given that the hash keys
1412          * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
1446          * are always equal when the other bytes match, given that
1447          * the hash keys are equal and that HASH_BITS >= 8.
1518      * are always equal when the other bytes match, given that
1519      * the hash keys are equal and that HASH_BITS >= 8.
1557                 s->window + start, length) != EQUAL) {
2539  * the subtrees have equal frequency. This minimizes the worst case length.
2643      * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
4495    the distance codes.  Subsequent tables are also less than or equal to
4638         /* compute minimum size table less than or equal to l bits */
OpenGrok
