int xdl_do_histogram_diff(xpparam_t const *xpp, xdfenv_t *env)
{
+ ptrdiff_t dend1 = env->xdf1.nrec - 1 - env->delta_end;
+ ptrdiff_t dend2 = env->xdf2.nrec - 1 - env->delta_end;
+
return histogram_diff(xpp, env,
- env->delta_start + 1, env->xdf1.dend - env->delta_start + 1,
- env->delta_start + 1, env->xdf2.dend - env->delta_start + 1);
+ env->delta_start + 1, dend1 - env->delta_start + 1,
+ env->delta_start + 1, dend2 - env->delta_start + 1);
}
int xdl_do_patience_diff(xpparam_t const *xpp, xdfenv_t *env)
{
+ ptrdiff_t dend1 = env->xdf1.nrec - 1 - env->delta_end;
+ ptrdiff_t dend2 = env->xdf2.nrec - 1 - env->delta_end;
+
return patience_diff(xpp, env,
- env->delta_start + 1, env->xdf1.dend - env->delta_start + 1,
- env->delta_start + 1, env->xdf2.dend - env->delta_start + 1);
+ env->delta_start + 1, dend1 - env->delta_start + 1,
+ env->delta_start + 1, dend2 - env->delta_start + 1);
}
xdf->changed += 1;
xdf->nreff = 0;
- xdf->dend = xdf->nrec - 1;
return 0;
uint8_t *action1 = NULL, *action2 = NULL;
bool need_min = !!(cf->flags & XDF_NEED_MINIMAL);
int ret = 0;
+ ptrdiff_t dend1 = xe->xdf1.nrec - 1 - xe->delta_end;
+ ptrdiff_t dend2 = xe->xdf2.nrec - 1 - xe->delta_end;
/*
* Create temporary arrays that will help us decide if
*/
if ((mlim = xdl_bogosqrt((long)xe->xdf1.nrec)) > XDL_MAX_EQLIMIT)
mlim = XDL_MAX_EQLIMIT;
- for (i = xe->delta_start, recs = &xe->xdf1.recs[xe->delta_start]; i <= xe->xdf1.dend; i++, recs++) {
+ for (i = xe->delta_start, recs = &xe->xdf1.recs[xe->delta_start]; i <= dend1; i++, recs++) {
rcrec = cf->rcrecs[recs->minimal_perfect_hash];
nm = rcrec ? rcrec->len2 : 0;
action1[i] = (nm == 0) ? DISCARD: (nm >= mlim && !need_min) ? INVESTIGATE: KEEP;
if ((mlim = xdl_bogosqrt((long)xe->xdf2.nrec)) > XDL_MAX_EQLIMIT)
mlim = XDL_MAX_EQLIMIT;
- for (i = xe->delta_start, recs = &xe->xdf2.recs[xe->delta_start]; i <= xe->xdf2.dend; i++, recs++) {
+ for (i = xe->delta_start, recs = &xe->xdf2.recs[xe->delta_start]; i <= dend2; i++, recs++) {
rcrec = cf->rcrecs[recs->minimal_perfect_hash];
nm = rcrec ? rcrec->len1 : 0;
action2[i] = (nm == 0) ? DISCARD: (nm >= mlim && !need_min) ? INVESTIGATE: KEEP;
*/
xe->xdf1.nreff = 0;
for (i = xe->delta_start, recs = &xe->xdf1.recs[xe->delta_start];
- i <= xe->xdf1.dend; i++, recs++) {
+ i <= dend1; i++, recs++) {
if (action1[i] == KEEP ||
- (action1[i] == INVESTIGATE && !xdl_clean_mmatch(action1, i, xe->delta_start, xe->xdf1.dend))) {
+ (action1[i] == INVESTIGATE && !xdl_clean_mmatch(action1, i, xe->delta_start, dend1))) {
xe->xdf1.reference_index[xe->xdf1.nreff++] = i;
/* changed[i] remains false, i.e. keep */
} else
xe->xdf2.nreff = 0;
for (i = xe->delta_start, recs = &xe->xdf2.recs[xe->delta_start];
- i <= xe->xdf2.dend; i++, recs++) {
+ i <= dend2; i++, recs++) {
if (action2[i] == KEEP ||
- (action2[i] == INVESTIGATE && !xdl_clean_mmatch(action2, i, xe->delta_start, xe->xdf2.dend))) {
+ (action2[i] == INVESTIGATE && !xdl_clean_mmatch(action2, i, xe->delta_start, dend2))) {
xe->xdf2.reference_index[xe->xdf2.nreff++] = i;
/* changed[i] remains false, i.e. keep */
} else
size_t mph1 = xe->xdf1.recs[xe->xdf1.nrec - 1 - i].minimal_perfect_hash;
size_t mph2 = xe->xdf2.recs[xe->xdf2.nrec - 1 - i].minimal_perfect_hash;
if (mph1 != mph2) {
- xe->xdf1.dend = xe->xdf1.nrec - 1 - i;
- xe->xdf2.dend = xe->xdf2.nrec - 1 - i;
+ xe->delta_end = i;
break;
}
}
xdlclassifier_t cf;
xe->delta_start = 0;
+ xe->delta_end = 0;
if (xdl_prepare_ctx(mf1, &xe->xdf1, xpp->flags) < 0) {