|
@ -1206,7 +1206,7 @@ void Planner::_buffer_line(const float &a, const float &b, const float &c, const |
|
|
// This leads to an enormous number of advance steps due to a huge e_acceleration.
|
|
|
// This leads to an enormous number of advance steps due to a huge e_acceleration.
|
|
|
// The math is correct, but you don't want a retract move done with advance!
|
|
|
// The math is correct, but you don't want a retract move done with advance!
|
|
|
// So this situation is filtered out here.
|
|
|
// So this situation is filtered out here.
|
|
|
if (!block->steps[E_AXIS] || (!block->steps[X_AXIS] && !block->steps[Y_AXIS] && !block->steps[Z_AXIS]) || stepper.get_advance_k() == 0 || (uint32_t) block->steps[E_AXIS] == block->step_event_count) { |
|
|
if (!block->steps[E_AXIS] || (!block->steps[X_AXIS] && !block->steps[Y_AXIS]) || stepper.get_advance_k() == 0 || (uint32_t) block->steps[E_AXIS] == block->step_event_count) { |
|
|
block->use_advance_lead = false; |
|
|
block->use_advance_lead = false; |
|
|
} |
|
|
} |
|
|
else { |
|
|
else { |
|
|