Deleted Added
full compact
lz_encoder_mf.c (207842) lz_encoder_mf.c (213700)
1///////////////////////////////////////////////////////////////////////////////
2//
3/// \file lz_encoder_mf.c
4/// \brief Match finders
5///
6// Authors: Igor Pavlov
7// Lasse Collin
8//

--- 467 unchanged lines hidden (view full) ---

476 return matches;
477 }
478
479 uint32_t *const pair = son + ((cyclic_pos - delta
480 + (delta > cyclic_pos ? cyclic_size : 0))
481 << 1);
482
483 const uint8_t *const pb = cur - delta;
1///////////////////////////////////////////////////////////////////////////////
2//
3/// \file lz_encoder_mf.c
4/// \brief Match finders
5///
6// Authors: Igor Pavlov
7// Lasse Collin
8//

--- 467 unchanged lines hidden (view full) ---

476 return matches;
477 }
478
479 uint32_t *const pair = son + ((cyclic_pos - delta
480 + (delta > cyclic_pos ? cyclic_size : 0))
481 << 1);
482
483 const uint8_t *const pb = cur - delta;
484 uint32_t len = MIN(len0, len1);
484 uint32_t len = my_min(len0, len1);
485
486 if (pb[len] == cur[len]) {
487 while (++len != len_limit)
488 if (pb[len] != cur[len])
489 break;
490
491 if (len_best < len) {
492 len_best = len;

--- 48 unchanged lines hidden (view full) ---

541 *ptr1 = EMPTY_HASH_VALUE;
542 return;
543 }
544
545 uint32_t *pair = son + ((cyclic_pos - delta
546 + (delta > cyclic_pos ? cyclic_size : 0))
547 << 1);
548 const uint8_t *pb = cur - delta;
485
486 if (pb[len] == cur[len]) {
487 while (++len != len_limit)
488 if (pb[len] != cur[len])
489 break;
490
491 if (len_best < len) {
492 len_best = len;

--- 48 unchanged lines hidden (view full) ---

541 *ptr1 = EMPTY_HASH_VALUE;
542 return;
543 }
544
545 uint32_t *pair = son + ((cyclic_pos - delta
546 + (delta > cyclic_pos ? cyclic_size : 0))
547 << 1);
548 const uint8_t *pb = cur - delta;
549 uint32_t len = MIN(len0, len1);
549 uint32_t len = my_min(len0, len1);
550
551 if (pb[len] == cur[len]) {
552 while (++len != len_limit)
553 if (pb[len] != cur[len])
554 break;
555
556 if (len == len_limit) {
557 *ptr1 = pair[0];

--- 196 unchanged lines hidden ---
550
551 if (pb[len] == cur[len]) {
552 while (++len != len_limit)
553 if (pb[len] != cur[len])
554 break;
555
556 if (len == len_limit) {
557 *ptr1 = pair[0];

--- 196 unchanged lines hidden ---