3diy
/
klipper
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

stepcompress: Encourage add=0 in compress_bisect_add() 

Only use a non-zero 'add' if it actually extends the number of steps
the command covers.

Signed-off-by: Kevin O'Connor <kevin@koconnor.net>
This commit is contained in:
Kevin O'Connor 2016-12-06 19:01:00 -05:00
parent 12d4888321
commit 83f7d702e7
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
klippy/stepcompress.c
View File

@ -130,7 +130,7 @@ compress_bisect_add(struct stepcompress *sc)
struct points point = minmax_point(sc, sc->queue_pos); struct points point = minmax_point(sc, sc->queue_pos);
int32_t outer_mininterval = point.minp, outer_maxinterval = point.maxp; int32_t outer_mininterval = point.minp, outer_maxinterval = point.maxp;
int32_t add = 0, minadd = -0x8001, maxadd = 0x8000; int32_t add = 0, minadd = -0x8001, maxadd = 0x8000;
int32_t bestinterval = 0, bestcount = 1, bestadd = 0, bestreach = INT32_MIN; int32_t bestinterval = 0, bestcount = 1, bestadd = 1, bestreach = INT32_MIN;
int32_t checked_count = 0; int32_t checked_count = 0;
for (;;) { for (;;) {
@ -162,7 +162,7 @@ compress_bisect_add(struct stepcompress *sc)
// Check if this is the best sequence found so far // Check if this is the best sequence found so far
int32_t reach = add*(addfactor-count) + maxinterval*count; int32_t reach = add*(addfactor-count) + maxinterval*count;
if (reach > bestreach) { if (reach > bestreach && (bestadd || count > bestcount + bestcount/16)) {
bestinterval = maxinterval; bestinterval = maxinterval;
bestcount = count; bestcount = count;
bestadd = add; bestadd = add;