|
@@ -962,7 +962,7 @@ void Planner::reverse_pass() {
|
962
|
962
|
}
|
963
|
963
|
|
964
|
964
|
// The kernel called by recalculate() when scanning the plan from first to last entry.
|
965
|
|
-void Planner::forward_pass_kernel(const block_t * const previous, block_t* const current, uint8_t block_index) {
|
|
965
|
+void Planner::forward_pass_kernel(const block_t* const previous, block_t* const current, const uint8_t block_index) {
|
966
|
966
|
if (previous) {
|
967
|
967
|
// If the previous block is an acceleration block, too short to complete the full speed
|
968
|
968
|
// change, adjust the entry speed accordingly. Entry speeds have already been reset,
|
|
@@ -1586,7 +1586,7 @@ bool Planner::_buffer_steps(const int32_t (&target)[XYZE]
|
1586
|
1586
|
* Returns true is movement is acceptable, false otherwise
|
1587
|
1587
|
*/
|
1588
|
1588
|
bool Planner::_populate_block(block_t * const block, bool split_move,
|
1589
|
|
- const int32_t (&target)[XYZE]
|
|
1589
|
+ const int32_t (&target)[XYZE]
|
1590
|
1590
|
#if HAS_POSITION_FLOAT
|
1591
|
1591
|
, const float (&target_float)[XYZE]
|
1592
|
1592
|
#endif
|
|
@@ -2234,7 +2234,7 @@ bool Planner::_populate_block(block_t * const block, bool split_move,
|
2234
|
2234
|
if (block->millimeters < 1.0) {
|
2235
|
2235
|
|
2236
|
2236
|
// Fast acos approximation, minus the error bar to be safe
|
2237
|
|
- float junction_theta = (RADIANS(-40) * sq(junction_cos_theta) - RADIANS(50)) * junction_cos_theta + RADIANS(90) - 0.18;
|
|
2237
|
+ const float junction_theta = (RADIANS(-40) * sq(junction_cos_theta) - RADIANS(50)) * junction_cos_theta + RADIANS(90) - 0.18;
|
2238
|
2238
|
|
2239
|
2239
|
// If angle is greater than 135 degrees (octagon), find speed for approximate arc
|
2240
|
2240
|
if (junction_theta > RADIANS(135)) {
|