2 This file is part of Smoothie (http://smoothieware.org/). The motion control part is heavily based on Grbl (https://github.com/simen/grbl).
3 Smoothie is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
4 Smoothie is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
5 You should have received a copy of the GNU General Public License along with Smoothie. If not, see <http://www.gnu.org/licenses/>.
8 #include "libs/Module.h"
9 #include "libs/Kernel.h"
10 #include "libs/nuts_bolts.h"
17 #include "libs/StreamOutputPool.h"
18 #include "StepTicker.h"
25 #define STEP_TICKER_FREQUENCY THEKERNEL->step_ticker->get_frequency()
26 #define STEP_TICKER_FREQUENCY_2 (STEP_TICKER_FREQUENCY*STEP_TICKER_FREQUENCY)
28 uint8_t Block::n_actuators
= 0;
30 // A block represents a movement, it's length for each stepper motor, and the corresponding acceleration curves.
31 // It's stacked on a queue, and that queue is then executed in order, to move the motors.
32 // Most of the accel math is also done in this class
33 // And GCode objects for use in on_gcode_execute are also help in here
44 steps_event_count
= 0;
50 acceleration
= 100.0F
; // we don't want to get divide by zeroes if this is not set
55 recalculate_flag
= false;
56 nominal_length_flag
= false;
57 max_entry_speed
= 0.0F
;
62 acceleration_per_tick
= 0;
63 deceleration_per_tick
= 0;
65 if(tick_info
.size() != n_actuators
) {
66 tick_info
.resize(n_actuators
);
68 for(auto &i
: tick_info
) {
71 i
.acceleration_change
= 0;
72 i
.deceleration_change
= 0;
76 i
.next_accel_event
= 0;
80 void Block::debug() const
82 THEKERNEL
->streams
->printf("%p: steps-X:%04lu Y:%04lu Z:%04lu ", this, this->steps
[0], this->steps
[1], this->steps
[2]);
83 for (size_t i
= E_AXIS
; i
< n_actuators
; ++i
) {
84 THEKERNEL
->streams
->printf("E%d:%04lu ", i
-E_AXIS
, this->steps
[i
]);
86 THEKERNEL
->streams
->printf("(max:%4lu) nominal:r%1.4f/s%1.4f mm:%1.4f acc:%1.2f accu:%5lu decu:%5lu rates:%10.4f entry/max:%1.4f/%1.4f exit:%1.4f primary:%d ready:%d locked:%d ticking:%d recalc:%d nomlen:%d time:%f\r\n",
87 this->steps_event_count
,
92 this->accelerate_until
,
93 this->decelerate_after
,
97 this->max_entry_speed
,
102 recalculate_flag
? 1 : 0,
103 nominal_length_flag
? 1 : 0,
104 total_move_ticks
/STEP_TICKER_FREQUENCY
109 /* Calculates trapezoid parameters so that the entry- and exit-speed is compensated by the provided factors.
110 // The factors represent a factor of braking and must be in the range 0.0-1.0.
111 // +--------+ <- nominal_rate
113 // nominal_rate*entry_factor -> + \
114 // | + <- nominal_rate*exit_factor
118 void Block::calculate_trapezoid( float entryspeed
, float exitspeed
)
120 // if block is currently executing, don't touch anything!
121 if (is_ticking
) return;
123 float initial_rate
= this->nominal_rate
* (entryspeed
/ this->nominal_speed
); // steps/sec
124 float final_rate
= this->nominal_rate
* (exitspeed
/ this->nominal_speed
);
125 //printf("Initial rate: %f, final_rate: %f\n", initial_rate, final_rate);
126 // How many steps ( can be fractions of steps, we need very precise values ) to accelerate and decelerate
127 // This is a simplification to get rid of rate_delta and get the steps/s² accel directly from the mm/s² accel
128 float acceleration_per_second
= (this->acceleration
* this->steps_event_count
) / this->millimeters
;
130 float maximum_possible_rate
= sqrtf( ( this->steps_event_count
* acceleration_per_second
) + ( ( powf(initial_rate
, 2) + powf(final_rate
, 2) ) / 2.0F
) );
132 //printf("id %d: acceleration_per_second: %f, maximum_possible_rate: %f steps/sec, %f mm/sec\n", this->id, acceleration_per_second, maximum_possible_rate, maximum_possible_rate/100);
134 // Now this is the maximum rate we'll achieve this move, either because
135 // it's the higher we can achieve, or because it's the higher we are
136 // allowed to achieve
137 this->maximum_rate
= std::min(maximum_possible_rate
, this->nominal_rate
);
139 // Now figure out how long it takes to accelerate in seconds
140 float time_to_accelerate
= ( this->maximum_rate
- initial_rate
) / acceleration_per_second
;
142 // Now figure out how long it takes to decelerate
143 float time_to_decelerate
= ( final_rate
- this->maximum_rate
) / -acceleration_per_second
;
145 // Now we know how long it takes to accelerate and decelerate, but we must
146 // also know how long the entire move takes so we can figure out how long
147 // is the plateau if there is one
148 float plateau_time
= 0;
150 // Only if there is actually a plateau ( we are limited by nominal_rate )
151 if(maximum_possible_rate
> this->nominal_rate
) {
152 // Figure out the acceleration and deceleration distances ( in steps )
153 float acceleration_distance
= ( ( initial_rate
+ this->maximum_rate
) / 2.0F
) * time_to_accelerate
;
154 float deceleration_distance
= ( ( this->maximum_rate
+ final_rate
) / 2.0F
) * time_to_decelerate
;
156 // Figure out the plateau steps
157 float plateau_distance
= this->steps_event_count
- acceleration_distance
- deceleration_distance
;
159 // Figure out the plateau time in seconds
160 plateau_time
= plateau_distance
/ this->maximum_rate
;
163 // Figure out how long the move takes total ( in seconds )
164 float total_move_time
= time_to_accelerate
+ time_to_decelerate
+ plateau_time
;
165 //puts "total move time: #{total_move_time}s time to accelerate: #{time_to_accelerate}, time to decelerate: #{time_to_decelerate}"
167 // We now have the full timing for acceleration, plateau and deceleration,
168 // yay \o/ Now this is very important these are in seconds, and we need to
169 // round them into ticks. This means instead of accelerating in 100.23
170 // ticks we'll accelerate in 100 ticks. Which means to reach the exact
171 // speed we want to reach, we must figure out a new/slightly different
172 // acceleration/deceleration to be sure we accelerate and decelerate at
173 // the exact rate we want
175 // First off round total time, acceleration time and deceleration time in ticks
176 uint32_t acceleration_ticks
= floorf( time_to_accelerate
* STEP_TICKER_FREQUENCY
);
177 uint32_t deceleration_ticks
= floorf( time_to_decelerate
* STEP_TICKER_FREQUENCY
);
178 uint32_t total_move_ticks
= floorf( total_move_time
* STEP_TICKER_FREQUENCY
);
180 // Now deduce the plateau time for those new values expressed in tick
181 //uint32_t plateau_ticks = total_move_ticks - acceleration_ticks - deceleration_ticks;
183 // Now we figure out the acceleration value to reach EXACTLY maximum_rate(steps/s) in EXACTLY acceleration_ticks(ticks) amount of time in seconds
184 float acceleration_time
= acceleration_ticks
/ STEP_TICKER_FREQUENCY
; // This can be moved into the operation below, separated for clarity, note we need to do this instead of using time_to_accelerate(seconds) directly because time_to_accelerate(seconds) and acceleration_ticks(seconds) do not have the same value anymore due to the rounding
185 float deceleration_time
= deceleration_ticks
/ STEP_TICKER_FREQUENCY
;
187 float acceleration_in_steps
= (acceleration_time
> 0.0F
) ? ( this->maximum_rate
- initial_rate
) / acceleration_time
: 0;
188 float deceleration_in_steps
= (deceleration_time
> 0.0F
) ? ( this->maximum_rate
- final_rate
) / deceleration_time
: 0;
190 // we have a potential race condition here as we could get interrupted anywhere in the middle of this call, we need to lock
191 // the updates to the blocks to get around it
193 // Now figure out the two acceleration ramp change events in ticks
194 this->accelerate_until
= acceleration_ticks
;
195 this->decelerate_after
= total_move_ticks
- deceleration_ticks
;
197 // Now figure out the acceleration PER TICK, this should ideally be held as a float, even a double if possible as it's very critical to the block timing
200 this->acceleration_per_tick
= acceleration_in_steps
/ STEP_TICKER_FREQUENCY_2
;
201 this->deceleration_per_tick
= deceleration_in_steps
/ STEP_TICKER_FREQUENCY_2
;
203 // We now have everything we need for this block to call a Steppermotor->move method !!!!
204 // Theorically, if accel is done per tick, the speed curve should be perfect.
205 this->total_move_ticks
= total_move_ticks
;
207 //puts "accelerate_until: #{this->accelerate_until}, decelerate_after: #{this->decelerate_after}, acceleration_per_tick: #{this->acceleration_per_tick}, total_move_ticks: #{this->total_move_ticks}"
209 this->initial_rate
= initial_rate
;
210 this->exit_speed
= exitspeed
;
212 // prepare the block for stepticker
217 // Calculates the maximum allowable speed at this point when you must be able to reach target_velocity using the
218 // acceleration within the allotted distance.
219 float Block::max_allowable_speed(float acceleration
, float target_velocity
, float distance
)
221 return sqrtf(target_velocity
* target_velocity
- 2.0F
* acceleration
* distance
);
224 // Called by Planner::recalculate() when scanning the plan from last to first entry.
225 float Block::reverse_pass(float exit_speed
)
227 // If entry speed is already at the maximum entry speed, no need to recheck. Block is cruising.
228 // If not, block in state of acceleration or deceleration. Reset entry speed to maximum and
229 // check for maximum allowable speed reductions to ensure maximum possible planned speed.
230 if (this->entry_speed
!= this->max_entry_speed
) {
231 // If nominal length true, max junction speed is guaranteed to be reached. Only compute
232 // for max allowable speed if block is decelerating and nominal length is false.
233 if ((!this->nominal_length_flag
) && (this->max_entry_speed
> exit_speed
)) {
234 float max_entry_speed
= max_allowable_speed(-this->acceleration
, exit_speed
, this->millimeters
);
236 this->entry_speed
= min(max_entry_speed
, this->max_entry_speed
);
238 return this->entry_speed
;
240 this->entry_speed
= this->max_entry_speed
;
243 return this->entry_speed
;
247 // Called by Planner::recalculate() when scanning the plan from first to last entry.
248 // returns maximum exit speed of this block
249 float Block::forward_pass(float prev_max_exit_speed
)
251 // If the previous block is an acceleration block, but it is not long enough to complete the
252 // full speed change within the block, we need to adjust the entry speed accordingly. Entry
253 // speeds have already been reset, maximized, and reverse planned by reverse planner.
254 // If nominal length is true, max junction speed is guaranteed to be reached. No need to recheck.
256 // TODO: find out if both of these checks are necessary
257 if (prev_max_exit_speed
> nominal_speed
)
258 prev_max_exit_speed
= nominal_speed
;
259 if (prev_max_exit_speed
> max_entry_speed
)
260 prev_max_exit_speed
= max_entry_speed
;
262 if (prev_max_exit_speed
<= entry_speed
) {
264 entry_speed
= prev_max_exit_speed
;
265 // since we're now acceleration or cruise limited
266 // we don't need to recalculate our entry speed anymore
267 recalculate_flag
= false;
270 // // decel limited, do nothing
272 return max_exit_speed();
275 float Block::max_exit_speed()
277 // if block is currently executing, return cached exit speed from calculate_trapezoid
278 // this ensures that a block following a currently executing block will have correct entry speed
280 return this->exit_speed
;
282 // if nominal_length_flag is asserted
283 // we are guaranteed to reach nominal speed regardless of entry speed
284 // thus, max exit will always be nominal
285 if (nominal_length_flag
)
286 return nominal_speed
;
288 // otherwise, we have to work out max exit speed based on entry and acceleration
289 float max
= max_allowable_speed(-this->acceleration
, this->entry_speed
, this->millimeters
);
291 return min(max
, nominal_speed
);
294 // prepare block for the step ticker, called everytime the block changes
295 // this is done during planning so does not delay tick generation and step ticker can simply grab the next block during the interrupt
296 void Block::prepare()
298 float inv
= 1.0F
/ this->steps_event_count
;
299 for (uint8_t m
= 0; m
< n_actuators
; m
++) {
300 uint32_t steps
= this->steps
[m
];
301 this->tick_info
[m
].steps_to_move
= steps
;
302 if(steps
== 0) continue;
304 float aratio
= inv
* steps
;
305 this->tick_info
[m
].steps_per_tick
= STEPTICKER_TOFP((this->initial_rate
* aratio
) / STEP_TICKER_FREQUENCY
); // steps/sec / tick frequency to get steps per tick in 2.30 fixed point
306 this->tick_info
[m
].counter
= 0; // 2.30 fixed point
307 this->tick_info
[m
].step_count
= 0;
308 this->tick_info
[m
].next_accel_event
= this->total_move_ticks
+ 1;
310 float acceleration_change
= 0;
311 if(this->accelerate_until
!= 0) { // If the next accel event is the end of accel
312 this->tick_info
[m
].next_accel_event
= this->accelerate_until
;
313 acceleration_change
= this->acceleration_per_tick
;
315 } else if(this->decelerate_after
== 0 /*&& this->accelerate_until == 0*/) {
316 // we start off decelerating
317 acceleration_change
= -this->deceleration_per_tick
;
319 } else if(this->decelerate_after
!= this->total_move_ticks
/*&& this->accelerate_until == 0*/) {
320 // If the next event is the start of decel ( don't set this if the next accel event is accel end )
321 this->tick_info
[m
].next_accel_event
= this->decelerate_after
;
324 // convert to fixed point after scaling
325 this->tick_info
[m
].acceleration_change
= STEPTICKER_TOFP(acceleration_change
* aratio
);
326 this->tick_info
[m
].deceleration_change
= -STEPTICKER_TOFP(this->deceleration_per_tick
* aratio
);
327 this->tick_info
[m
].plateau_rate
= STEPTICKER_TOFP((this->maximum_rate
* aratio
) / STEP_TICKER_FREQUENCY
);