My Marlin configs for Fabrikator Mini and CTC i3 Pro B
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

planner.cpp 43KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051
  1. /**
  2. * planner.cpp - Buffer movement commands and manage the acceleration profile plan
  3. * Part of Grbl
  4. *
  5. * Copyright (c) 2009-2011 Simen Svale Skogsrud
  6. *
  7. * Grbl is free software: you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation, either version 3 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * Grbl is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with Grbl. If not, see <http://www.gnu.org/licenses/>.
  19. *
  20. *
  21. * The ring buffer implementation gleaned from the wiring_serial library by David A. Mellis.
  22. *
  23. *
  24. * Reasoning behind the mathematics in this module (in the key of 'Mathematica'):
  25. *
  26. * s == speed, a == acceleration, t == time, d == distance
  27. *
  28. * Basic definitions:
  29. * Speed[s_, a_, t_] := s + (a*t)
  30. * Travel[s_, a_, t_] := Integrate[Speed[s, a, t], t]
  31. *
  32. * Distance to reach a specific speed with a constant acceleration:
  33. * Solve[{Speed[s, a, t] == m, Travel[s, a, t] == d}, d, t]
  34. * d -> (m^2 - s^2)/(2 a) --> estimate_acceleration_distance()
  35. *
  36. * Speed after a given distance of travel with constant acceleration:
  37. * Solve[{Speed[s, a, t] == m, Travel[s, a, t] == d}, m, t]
  38. * m -> Sqrt[2 a d + s^2]
  39. *
  40. * DestinationSpeed[s_, a_, d_] := Sqrt[2 a d + s^2]
  41. *
  42. * When to start braking (di) to reach a specified destination speed (s2) after accelerating
  43. * from initial speed s1 without ever stopping at a plateau:
  44. * Solve[{DestinationSpeed[s1, a, di] == DestinationSpeed[s2, a, d - di]}, di]
  45. * di -> (2 a d - s1^2 + s2^2)/(4 a) --> intersection_distance()
  46. *
  47. * IntersectionDistance[s1_, s2_, a_, d_] := (2 a d - s1^2 + s2^2)/(4 a)
  48. *
  49. */
  50. #include "Marlin.h"
  51. #include "planner.h"
  52. #include "stepper.h"
  53. #include "temperature.h"
  54. #include "ultralcd.h"
  55. #include "language.h"
  56. #if ENABLED(MESH_BED_LEVELING)
  57. #include "mesh_bed_leveling.h"
  58. #endif
  59. //===========================================================================
  60. //============================= public variables ============================
  61. //===========================================================================
  62. millis_t minsegmenttime;
  63. float max_feedrate[NUM_AXIS]; // Max speeds in mm per minute
  64. float axis_steps_per_unit[NUM_AXIS];
  65. unsigned long max_acceleration_units_per_sq_second[NUM_AXIS]; // Use M201 to override by software
  66. float minimumfeedrate;
  67. float acceleration; // Normal acceleration mm/s^2 DEFAULT ACCELERATION for all printing moves. M204 SXXXX
  68. float retract_acceleration; // Retract acceleration mm/s^2 filament pull-back and push-forward while standing still in the other axes M204 TXXXX
  69. float travel_acceleration; // Travel acceleration mm/s^2 DEFAULT ACCELERATION for all NON printing moves. M204 MXXXX
  70. float max_xy_jerk; // The largest speed change requiring no acceleration
  71. float max_z_jerk;
  72. float max_e_jerk;
  73. float mintravelfeedrate;
  74. unsigned long axis_steps_per_sqr_second[NUM_AXIS];
  75. #if ENABLED(AUTO_BED_LEVELING_FEATURE)
  76. // Transform required to compensate for bed level
  77. matrix_3x3 plan_bed_level_matrix = {
  78. 1.0, 0.0, 0.0,
  79. 0.0, 1.0, 0.0,
  80. 0.0, 0.0, 1.0
  81. };
  82. #endif // AUTO_BED_LEVELING_FEATURE
  83. #if ENABLED(AUTOTEMP)
  84. float autotemp_max = 250;
  85. float autotemp_min = 210;
  86. float autotemp_factor = 0.1;
  87. bool autotemp_enabled = false;
  88. #endif
  89. //===========================================================================
  90. //============ semi-private variables, used in inline functions =============
  91. //===========================================================================
  92. block_t block_buffer[BLOCK_BUFFER_SIZE]; // A ring buffer for motion instfructions
  93. volatile unsigned char block_buffer_head; // Index of the next block to be pushed
  94. volatile unsigned char block_buffer_tail; // Index of the block to process now
  95. //===========================================================================
  96. //============================ private variables ============================
  97. //===========================================================================
  98. // The current position of the tool in absolute steps
  99. long position[NUM_AXIS]; // Rescaled from extern when axis_steps_per_unit are changed by gcode
  100. static float previous_speed[NUM_AXIS]; // Speed of previous path line segment
  101. static float previous_nominal_speed; // Nominal speed of previous path line segment
  102. uint8_t g_uc_extruder_last_move[EXTRUDERS] = { 0 };
  103. #ifdef XY_FREQUENCY_LIMIT
  104. // Used for the frequency limit
  105. #define MAX_FREQ_TIME (1000000.0/XY_FREQUENCY_LIMIT)
  106. // Old direction bits. Used for speed calculations
  107. static unsigned char old_direction_bits = 0;
  108. // Segment times (in µs). Used for speed calculations
  109. static long axis_segment_time[2][3] = { {MAX_FREQ_TIME + 1, 0, 0}, {MAX_FREQ_TIME + 1, 0, 0} };
  110. #endif
  111. #if ENABLED(FILAMENT_SENSOR)
  112. static char meas_sample; //temporary variable to hold filament measurement sample
  113. #endif
  114. #if ENABLED(DUAL_X_CARRIAGE)
  115. extern bool extruder_duplication_enabled;
  116. #endif
  117. //===========================================================================
  118. //================================ functions ================================
  119. //===========================================================================
  120. // Get the next / previous index of the next block in the ring buffer
  121. // NOTE: Using & here (not %) because BLOCK_BUFFER_SIZE is always a power of 2
  122. FORCE_INLINE int8_t next_block_index(int8_t block_index) { return BLOCK_MOD(block_index + 1); }
  123. FORCE_INLINE int8_t prev_block_index(int8_t block_index) { return BLOCK_MOD(block_index - 1); }
  124. // Calculates the distance (not time) it takes to accelerate from initial_rate to target_rate using the
  125. // given acceleration:
  126. FORCE_INLINE float estimate_acceleration_distance(float initial_rate, float target_rate, float acceleration) {
  127. if (acceleration == 0) return 0; // acceleration was 0, set acceleration distance to 0
  128. return (target_rate * target_rate - initial_rate * initial_rate) / (acceleration * 2);
  129. }
  130. // This function gives you the point at which you must start braking (at the rate of -acceleration) if
  131. // you started at speed initial_rate and accelerated until this point and want to end at the final_rate after
  132. // a total travel of distance. This can be used to compute the intersection point between acceleration and
  133. // deceleration in the cases where the trapezoid has no plateau (i.e. never reaches maximum speed)
  134. FORCE_INLINE float intersection_distance(float initial_rate, float final_rate, float acceleration, float distance) {
  135. if (acceleration == 0) return 0; // acceleration was 0, set intersection distance to 0
  136. return (acceleration * 2 * distance - initial_rate * initial_rate + final_rate * final_rate) / (acceleration * 4);
  137. }
  138. // Calculates trapezoid parameters so that the entry- and exit-speed is compensated by the provided factors.
  139. void calculate_trapezoid_for_block(block_t* block, float entry_factor, float exit_factor) {
  140. unsigned long initial_rate = ceil(block->nominal_rate * entry_factor); // (step/min)
  141. unsigned long final_rate = ceil(block->nominal_rate * exit_factor); // (step/min)
  142. // Limit minimal step rate (Otherwise the timer will overflow.)
  143. NOLESS(initial_rate, 120);
  144. NOLESS(final_rate, 120);
  145. long acceleration = block->acceleration_st;
  146. int32_t accelerate_steps = ceil(estimate_acceleration_distance(initial_rate, block->nominal_rate, acceleration));
  147. int32_t decelerate_steps = floor(estimate_acceleration_distance(block->nominal_rate, final_rate, -acceleration));
  148. // Calculate the size of Plateau of Nominal Rate.
  149. int32_t plateau_steps = block->step_event_count - accelerate_steps - decelerate_steps;
  150. // Is the Plateau of Nominal Rate smaller than nothing? That means no cruising, and we will
  151. // have to use intersection_distance() to calculate when to abort acceleration and start braking
  152. // in order to reach the final_rate exactly at the end of this block.
  153. if (plateau_steps < 0) {
  154. accelerate_steps = ceil(intersection_distance(initial_rate, final_rate, acceleration, block->step_event_count));
  155. accelerate_steps = max(accelerate_steps, 0); // Check limits due to numerical round-off
  156. accelerate_steps = min((uint32_t)accelerate_steps, block->step_event_count);//(We can cast here to unsigned, because the above line ensures that we are above zero)
  157. plateau_steps = 0;
  158. }
  159. #if ENABLED(ADVANCE)
  160. volatile long initial_advance = block->advance * entry_factor * entry_factor;
  161. volatile long final_advance = block->advance * exit_factor * exit_factor;
  162. #endif // ADVANCE
  163. // block->accelerate_until = accelerate_steps;
  164. // block->decelerate_after = accelerate_steps+plateau_steps;
  165. CRITICAL_SECTION_START; // Fill variables used by the stepper in a critical section
  166. if (!block->busy) { // Don't update variables if block is busy.
  167. block->accelerate_until = accelerate_steps;
  168. block->decelerate_after = accelerate_steps + plateau_steps;
  169. block->initial_rate = initial_rate;
  170. block->final_rate = final_rate;
  171. #if ENABLED(ADVANCE)
  172. block->initial_advance = initial_advance;
  173. block->final_advance = final_advance;
  174. #endif
  175. }
  176. CRITICAL_SECTION_END;
  177. }
  178. // Calculates the maximum allowable speed at this point when you must be able to reach target_velocity using the
  179. // acceleration within the allotted distance.
  180. FORCE_INLINE float max_allowable_speed(float acceleration, float target_velocity, float distance) {
  181. return sqrt(target_velocity * target_velocity - 2 * acceleration * distance);
  182. }
  183. // "Junction jerk" in this context is the immediate change in speed at the junction of two blocks.
  184. // This method will calculate the junction jerk as the euclidean distance between the nominal
  185. // velocities of the respective blocks.
  186. //inline float junction_jerk(block_t *before, block_t *after) {
  187. // return sqrt(
  188. // pow((before->speed_x-after->speed_x), 2)+pow((before->speed_y-after->speed_y), 2));
  189. //}
  190. // The kernel called by planner_recalculate() when scanning the plan from last to first entry.
  191. void planner_reverse_pass_kernel(block_t* previous, block_t* current, block_t* next) {
  192. if (!current) return;
  193. UNUSED(previous);
  194. if (next) {
  195. // If entry speed is already at the maximum entry speed, no need to recheck. Block is cruising.
  196. // If not, block in state of acceleration or deceleration. Reset entry speed to maximum and
  197. // check for maximum allowable speed reductions to ensure maximum possible planned speed.
  198. if (current->entry_speed != current->max_entry_speed) {
  199. // If nominal length true, max junction speed is guaranteed to be reached. Only compute
  200. // for max allowable speed if block is decelerating and nominal length is false.
  201. if (!current->nominal_length_flag && current->max_entry_speed > next->entry_speed) {
  202. current->entry_speed = min(current->max_entry_speed,
  203. max_allowable_speed(-current->acceleration, next->entry_speed, current->millimeters));
  204. }
  205. else {
  206. current->entry_speed = current->max_entry_speed;
  207. }
  208. current->recalculate_flag = true;
  209. }
  210. } // Skip last block. Already initialized and set for recalculation.
  211. }
  212. // planner_recalculate() needs to go over the current plan twice. Once in reverse and once forward. This
  213. // implements the reverse pass.
  214. void planner_reverse_pass() {
  215. uint8_t block_index = block_buffer_head;
  216. //Make a local copy of block_buffer_tail, because the interrupt can alter it
  217. CRITICAL_SECTION_START;
  218. unsigned char tail = block_buffer_tail;
  219. CRITICAL_SECTION_END
  220. if (BLOCK_MOD(block_buffer_head - tail + BLOCK_BUFFER_SIZE) > 3) { // moves queued
  221. block_index = BLOCK_MOD(block_buffer_head - 3);
  222. block_t* block[3] = { NULL, NULL, NULL };
  223. while (block_index != tail) {
  224. block_index = prev_block_index(block_index);
  225. block[2] = block[1];
  226. block[1] = block[0];
  227. block[0] = &block_buffer[block_index];
  228. planner_reverse_pass_kernel(block[0], block[1], block[2]);
  229. }
  230. }
  231. }
  232. // The kernel called by planner_recalculate() when scanning the plan from first to last entry.
  233. void planner_forward_pass_kernel(block_t* previous, block_t* current, block_t* next) {
  234. if (!previous) return;
  235. UNUSED(next);
  236. // If the previous block is an acceleration block, but it is not long enough to complete the
  237. // full speed change within the block, we need to adjust the entry speed accordingly. Entry
  238. // speeds have already been reset, maximized, and reverse planned by reverse planner.
  239. // If nominal length is true, max junction speed is guaranteed to be reached. No need to recheck.
  240. if (!previous->nominal_length_flag) {
  241. if (previous->entry_speed < current->entry_speed) {
  242. double entry_speed = min(current->entry_speed,
  243. max_allowable_speed(-previous->acceleration, previous->entry_speed, previous->millimeters));
  244. // Check for junction speed change
  245. if (current->entry_speed != entry_speed) {
  246. current->entry_speed = entry_speed;
  247. current->recalculate_flag = true;
  248. }
  249. }
  250. }
  251. }
  252. // planner_recalculate() needs to go over the current plan twice. Once in reverse and once forward. This
  253. // implements the forward pass.
  254. void planner_forward_pass() {
  255. uint8_t block_index = block_buffer_tail;
  256. block_t* block[3] = { NULL, NULL, NULL };
  257. while (block_index != block_buffer_head) {
  258. block[0] = block[1];
  259. block[1] = block[2];
  260. block[2] = &block_buffer[block_index];
  261. planner_forward_pass_kernel(block[0], block[1], block[2]);
  262. block_index = next_block_index(block_index);
  263. }
  264. planner_forward_pass_kernel(block[1], block[2], NULL);
  265. }
  266. // Recalculates the trapezoid speed profiles for all blocks in the plan according to the
  267. // entry_factor for each junction. Must be called by planner_recalculate() after
  268. // updating the blocks.
  269. void planner_recalculate_trapezoids() {
  270. int8_t block_index = block_buffer_tail;
  271. block_t* current;
  272. block_t* next = NULL;
  273. while (block_index != block_buffer_head) {
  274. current = next;
  275. next = &block_buffer[block_index];
  276. if (current) {
  277. // Recalculate if current block entry or exit junction speed has changed.
  278. if (current->recalculate_flag || next->recalculate_flag) {
  279. // NOTE: Entry and exit factors always > 0 by all previous logic operations.
  280. float nom = current->nominal_speed;
  281. calculate_trapezoid_for_block(current, current->entry_speed / nom, next->entry_speed / nom);
  282. current->recalculate_flag = false; // Reset current only to ensure next trapezoid is computed
  283. }
  284. }
  285. block_index = next_block_index(block_index);
  286. }
  287. // Last/newest block in buffer. Exit speed is set with MINIMUM_PLANNER_SPEED. Always recalculated.
  288. if (next) {
  289. float nom = next->nominal_speed;
  290. calculate_trapezoid_for_block(next, next->entry_speed / nom, MINIMUM_PLANNER_SPEED / nom);
  291. next->recalculate_flag = false;
  292. }
  293. }
  294. // Recalculates the motion plan according to the following algorithm:
  295. //
  296. // 1. Go over every block in reverse order and calculate a junction speed reduction (i.e. block_t.entry_factor)
  297. // so that:
  298. // a. The junction jerk is within the set limit
  299. // b. No speed reduction within one block requires faster deceleration than the one, true constant
  300. // acceleration.
  301. // 2. Go over every block in chronological order and dial down junction speed reduction values if
  302. // a. The speed increase within one block would require faster acceleration than the one, true
  303. // constant acceleration.
  304. //
  305. // When these stages are complete all blocks have an entry_factor that will allow all speed changes to
  306. // be performed using only the one, true constant acceleration, and where no junction jerk is jerkier than
  307. // the set limit. Finally it will:
  308. //
  309. // 3. Recalculate trapezoids for all blocks.
  310. void planner_recalculate() {
  311. planner_reverse_pass();
  312. planner_forward_pass();
  313. planner_recalculate_trapezoids();
  314. }
  315. void plan_init() {
  316. block_buffer_head = block_buffer_tail = 0;
  317. memset(position, 0, sizeof(position)); // clear position
  318. for (int i = 0; i < NUM_AXIS; i++) previous_speed[i] = 0.0;
  319. previous_nominal_speed = 0.0;
  320. }
  321. #if ENABLED(AUTOTEMP)
  322. void getHighESpeed() {
  323. static float oldt = 0;
  324. if (!autotemp_enabled) return;
  325. if (degTargetHotend0() + 2 < autotemp_min) return; // probably temperature set to zero.
  326. float high = 0.0;
  327. uint8_t block_index = block_buffer_tail;
  328. while (block_index != block_buffer_head) {
  329. block_t* block = &block_buffer[block_index];
  330. if (block->steps[X_AXIS] || block->steps[Y_AXIS] || block->steps[Z_AXIS]) {
  331. float se = (float)block->steps[E_AXIS] / block->step_event_count * block->nominal_speed; // mm/sec;
  332. if (se > high) high = se;
  333. }
  334. block_index = next_block_index(block_index);
  335. }
  336. float t = autotemp_min + high * autotemp_factor;
  337. t = constrain(t, autotemp_min, autotemp_max);
  338. if (oldt > t) {
  339. t *= (1 - AUTOTEMP_OLDWEIGHT);
  340. t += AUTOTEMP_OLDWEIGHT * oldt;
  341. }
  342. oldt = t;
  343. setTargetHotend0(t);
  344. }
  345. #endif //AUTOTEMP
  346. void check_axes_activity() {
  347. unsigned char axis_active[NUM_AXIS] = { 0 },
  348. tail_fan_speed = fanSpeed;
  349. #if ENABLED(BARICUDA)
  350. unsigned char tail_valve_pressure = ValvePressure,
  351. tail_e_to_p_pressure = EtoPPressure;
  352. #endif
  353. block_t* block;
  354. if (blocks_queued()) {
  355. uint8_t block_index = block_buffer_tail;
  356. tail_fan_speed = block_buffer[block_index].fan_speed;
  357. #if ENABLED(BARICUDA)
  358. block = &block_buffer[block_index];
  359. tail_valve_pressure = block->valve_pressure;
  360. tail_e_to_p_pressure = block->e_to_p_pressure;
  361. #endif
  362. while (block_index != block_buffer_head) {
  363. block = &block_buffer[block_index];
  364. for (int i = 0; i < NUM_AXIS; i++) if (block->steps[i]) axis_active[i]++;
  365. block_index = next_block_index(block_index);
  366. }
  367. }
  368. if (DISABLE_X && !axis_active[X_AXIS]) disable_x();
  369. if (DISABLE_Y && !axis_active[Y_AXIS]) disable_y();
  370. if (DISABLE_Z && !axis_active[Z_AXIS]) disable_z();
  371. if (DISABLE_E && !axis_active[E_AXIS]) {
  372. disable_e0();
  373. disable_e1();
  374. disable_e2();
  375. disable_e3();
  376. }
  377. #if HAS_FAN
  378. #ifdef FAN_KICKSTART_TIME
  379. static millis_t fan_kick_end;
  380. if (tail_fan_speed) {
  381. millis_t ms = millis();
  382. if (fan_kick_end == 0) {
  383. // Just starting up fan - run at full power.
  384. fan_kick_end = ms + FAN_KICKSTART_TIME;
  385. tail_fan_speed = 255;
  386. }
  387. else if (fan_kick_end > ms)
  388. // Fan still spinning up.
  389. tail_fan_speed = 255;
  390. }
  391. else {
  392. fan_kick_end = 0;
  393. }
  394. #endif //FAN_KICKSTART_TIME
  395. #if ENABLED(FAN_MIN_PWM)
  396. #define CALC_FAN_SPEED (tail_fan_speed ? ( FAN_MIN_PWM + (tail_fan_speed * (255 - FAN_MIN_PWM)) / 255 ) : 0)
  397. #else
  398. #define CALC_FAN_SPEED tail_fan_speed
  399. #endif // FAN_MIN_PWM
  400. #if ENABLED(FAN_SOFT_PWM)
  401. fanSpeedSoftPwm = CALC_FAN_SPEED;
  402. #else
  403. analogWrite(FAN_PIN, CALC_FAN_SPEED);
  404. #endif // FAN_SOFT_PWM
  405. #endif // HAS_FAN
  406. #if ENABLED(AUTOTEMP)
  407. getHighESpeed();
  408. #endif
  409. #if ENABLED(BARICUDA)
  410. #if HAS_HEATER_1
  411. analogWrite(HEATER_1_PIN, tail_valve_pressure);
  412. #endif
  413. #if HAS_HEATER_2
  414. analogWrite(HEATER_2_PIN, tail_e_to_p_pressure);
  415. #endif
  416. #endif
  417. }
  418. float junction_deviation = 0.1;
  419. // Add a new linear movement to the buffer. steps[X_AXIS], _y and _z is the absolute position in
  420. // mm. Microseconds specify how many microseconds the move should take to perform. To aid acceleration
  421. // calculation the caller must also provide the physical length of the line in millimeters.
  422. #if ENABLED(AUTO_BED_LEVELING_FEATURE) || ENABLED(MESH_BED_LEVELING)
  423. void plan_buffer_line(float x, float y, float z, const float& e, float feed_rate, const uint8_t extruder)
  424. #else
  425. void plan_buffer_line(const float& x, const float& y, const float& z, const float& e, float feed_rate, const uint8_t extruder)
  426. #endif // AUTO_BED_LEVELING_FEATURE
  427. {
  428. // Calculate the buffer head after we push this byte
  429. int next_buffer_head = next_block_index(block_buffer_head);
  430. // If the buffer is full: good! That means we are well ahead of the robot.
  431. // Rest here until there is room in the buffer.
  432. while (block_buffer_tail == next_buffer_head) idle();
  433. #if ENABLED(MESH_BED_LEVELING)
  434. if (mbl.active) z += mbl.get_z(x, y);
  435. #elif ENABLED(AUTO_BED_LEVELING_FEATURE)
  436. apply_rotation_xyz(plan_bed_level_matrix, x, y, z);
  437. #endif
  438. // The target position of the tool in absolute steps
  439. // Calculate target position in absolute steps
  440. //this should be done after the wait, because otherwise a M92 code within the gcode disrupts this calculation somehow
  441. long target[NUM_AXIS];
  442. target[X_AXIS] = lround(x * axis_steps_per_unit[X_AXIS]);
  443. target[Y_AXIS] = lround(y * axis_steps_per_unit[Y_AXIS]);
  444. target[Z_AXIS] = lround(z * axis_steps_per_unit[Z_AXIS]);
  445. target[E_AXIS] = lround(e * axis_steps_per_unit[E_AXIS]);
  446. float dx = target[X_AXIS] - position[X_AXIS],
  447. dy = target[Y_AXIS] - position[Y_AXIS],
  448. dz = target[Z_AXIS] - position[Z_AXIS];
  449. // DRYRUN ignores all temperature constraints and assures that the extruder is instantly satisfied
  450. if (marlin_debug_flags & DEBUG_DRYRUN)
  451. position[E_AXIS] = target[E_AXIS];
  452. float de = target[E_AXIS] - position[E_AXIS];
  453. #if ENABLED(PREVENT_DANGEROUS_EXTRUDE)
  454. if (de) {
  455. if (degHotend(extruder) < extrude_min_temp) {
  456. position[E_AXIS] = target[E_AXIS]; // Behave as if the move really took place, but ignore E part
  457. de = 0; // no difference
  458. SERIAL_ECHO_START;
  459. SERIAL_ECHOLNPGM(MSG_ERR_COLD_EXTRUDE_STOP);
  460. }
  461. #if ENABLED(PREVENT_LENGTHY_EXTRUDE)
  462. if (labs(de) > axis_steps_per_unit[E_AXIS] * EXTRUDE_MAXLENGTH) {
  463. position[E_AXIS] = target[E_AXIS]; // Behave as if the move really took place, but ignore E part
  464. de = 0; // no difference
  465. SERIAL_ECHO_START;
  466. SERIAL_ECHOLNPGM(MSG_ERR_LONG_EXTRUDE_STOP);
  467. }
  468. #endif
  469. }
  470. #endif
  471. // Prepare to set up new block
  472. block_t* block = &block_buffer[block_buffer_head];
  473. // Mark block as not busy (Not executed by the stepper interrupt)
  474. block->busy = false;
  475. // Number of steps for each axis
  476. #if ENABLED(COREXY)
  477. // corexy planning
  478. // these equations follow the form of the dA and dB equations on http://www.corexy.com/theory.html
  479. block->steps[A_AXIS] = labs(dx + dy);
  480. block->steps[B_AXIS] = labs(dx - dy);
  481. block->steps[Z_AXIS] = labs(dz);
  482. #elif ENABLED(COREXZ)
  483. // corexz planning
  484. block->steps[A_AXIS] = labs(dx + dz);
  485. block->steps[Y_AXIS] = labs(dy);
  486. block->steps[C_AXIS] = labs(dx - dz);
  487. #else
  488. // default non-h-bot planning
  489. block->steps[X_AXIS] = labs(dx);
  490. block->steps[Y_AXIS] = labs(dy);
  491. block->steps[Z_AXIS] = labs(dz);
  492. #endif
  493. block->steps[E_AXIS] = labs(de);
  494. block->steps[E_AXIS] *= volumetric_multiplier[extruder];
  495. block->steps[E_AXIS] *= extruder_multiplier[extruder];
  496. block->steps[E_AXIS] /= 100;
  497. block->step_event_count = max(block->steps[X_AXIS], max(block->steps[Y_AXIS], max(block->steps[Z_AXIS], block->steps[E_AXIS])));
  498. // Bail if this is a zero-length block
  499. if (block->step_event_count <= dropsegments) return;
  500. block->fan_speed = fanSpeed;
  501. #if ENABLED(BARICUDA)
  502. block->valve_pressure = ValvePressure;
  503. block->e_to_p_pressure = EtoPPressure;
  504. #endif
  505. // Compute direction bits for this block
  506. uint8_t db = 0;
  507. #if ENABLED(COREXY)
  508. if (dx < 0) db |= BIT(X_HEAD); // Save the real Extruder (head) direction in X Axis
  509. if (dy < 0) db |= BIT(Y_HEAD); // ...and Y
  510. if (dz < 0) db |= BIT(Z_AXIS);
  511. if (dx + dy < 0) db |= BIT(A_AXIS); // Motor A direction
  512. if (dx - dy < 0) db |= BIT(B_AXIS); // Motor B direction
  513. #elif ENABLED(COREXZ)
  514. if (dx < 0) db |= BIT(X_HEAD); // Save the real Extruder (head) direction in X Axis
  515. if (dy < 0) db |= BIT(Y_AXIS);
  516. if (dz < 0) db |= BIT(Z_HEAD); // ...and Z
  517. if (dx + dz < 0) db |= BIT(A_AXIS); // Motor A direction
  518. if (dx - dz < 0) db |= BIT(C_AXIS); // Motor B direction
  519. #else
  520. if (dx < 0) db |= BIT(X_AXIS);
  521. if (dy < 0) db |= BIT(Y_AXIS);
  522. if (dz < 0) db |= BIT(Z_AXIS);
  523. #endif
  524. if (de < 0) db |= BIT(E_AXIS);
  525. block->direction_bits = db;
  526. block->active_extruder = extruder;
  527. //enable active axes
  528. #if ENABLED(COREXY)
  529. if (block->steps[A_AXIS] || block->steps[B_AXIS]) {
  530. enable_x();
  531. enable_y();
  532. }
  533. #if DISABLED(Z_LATE_ENABLE)
  534. if (block->steps[Z_AXIS]) enable_z();
  535. #endif
  536. #elif ENABLED(COREXZ)
  537. if (block->steps[A_AXIS] || block->steps[C_AXIS]) {
  538. enable_x();
  539. enable_z();
  540. }
  541. if (block->steps[Y_AXIS]) enable_y();
  542. #else
  543. if (block->steps[X_AXIS]) enable_x();
  544. if (block->steps[Y_AXIS]) enable_y();
  545. #if DISABLED(Z_LATE_ENABLE)
  546. if (block->steps[Z_AXIS]) enable_z();
  547. #endif
  548. #endif
  549. // Enable extruder(s)
  550. if (block->steps[E_AXIS]) {
  551. if (DISABLE_INACTIVE_EXTRUDER) { //enable only selected extruder
  552. for (int i = 0; i < EXTRUDERS; i++)
  553. if (g_uc_extruder_last_move[i] > 0) g_uc_extruder_last_move[i]--;
  554. switch(extruder) {
  555. case 0:
  556. enable_e0();
  557. #if ENABLED(DUAL_X_CARRIAGE)
  558. if (extruder_duplication_enabled) {
  559. enable_e1();
  560. g_uc_extruder_last_move[1] = BLOCK_BUFFER_SIZE * 2;
  561. }
  562. #endif
  563. g_uc_extruder_last_move[0] = BLOCK_BUFFER_SIZE * 2;
  564. #if EXTRUDERS > 1
  565. if (g_uc_extruder_last_move[1] == 0) disable_e1();
  566. #if EXTRUDERS > 2
  567. if (g_uc_extruder_last_move[2] == 0) disable_e2();
  568. #if EXTRUDERS > 3
  569. if (g_uc_extruder_last_move[3] == 0) disable_e3();
  570. #endif
  571. #endif
  572. #endif
  573. break;
  574. #if EXTRUDERS > 1
  575. case 1:
  576. enable_e1();
  577. g_uc_extruder_last_move[1] = BLOCK_BUFFER_SIZE * 2;
  578. if (g_uc_extruder_last_move[0] == 0) disable_e0();
  579. #if EXTRUDERS > 2
  580. if (g_uc_extruder_last_move[2] == 0) disable_e2();
  581. #if EXTRUDERS > 3
  582. if (g_uc_extruder_last_move[3] == 0) disable_e3();
  583. #endif
  584. #endif
  585. break;
  586. #if EXTRUDERS > 2
  587. case 2:
  588. enable_e2();
  589. g_uc_extruder_last_move[2] = BLOCK_BUFFER_SIZE * 2;
  590. if (g_uc_extruder_last_move[0] == 0) disable_e0();
  591. if (g_uc_extruder_last_move[1] == 0) disable_e1();
  592. #if EXTRUDERS > 3
  593. if (g_uc_extruder_last_move[3] == 0) disable_e3();
  594. #endif
  595. break;
  596. #if EXTRUDERS > 3
  597. case 3:
  598. enable_e3();
  599. g_uc_extruder_last_move[3] = BLOCK_BUFFER_SIZE * 2;
  600. if (g_uc_extruder_last_move[0] == 0) disable_e0();
  601. if (g_uc_extruder_last_move[1] == 0) disable_e1();
  602. if (g_uc_extruder_last_move[2] == 0) disable_e2();
  603. break;
  604. #endif // EXTRUDERS > 3
  605. #endif // EXTRUDERS > 2
  606. #endif // EXTRUDERS > 1
  607. }
  608. }
  609. else { // enable all
  610. enable_e0();
  611. enable_e1();
  612. enable_e2();
  613. enable_e3();
  614. }
  615. }
  616. if (block->steps[E_AXIS])
  617. NOLESS(feed_rate, minimumfeedrate);
  618. else
  619. NOLESS(feed_rate, mintravelfeedrate);
  620. /**
  621. * This part of the code calculates the total length of the movement.
  622. * For cartesian bots, the X_AXIS is the real X movement and same for Y_AXIS.
  623. * But for corexy bots, that is not true. The "X_AXIS" and "Y_AXIS" motors (that should be named to A_AXIS
  624. * and B_AXIS) cannot be used for X and Y length, because A=X+Y and B=X-Y.
  625. * So we need to create other 2 "AXIS", named X_HEAD and Y_HEAD, meaning the real displacement of the Head.
  626. * Having the real displacement of the head, we can calculate the total movement length and apply the desired speed.
  627. */
  628. #if ENABLED(COREXY)
  629. float delta_mm[6];
  630. delta_mm[X_HEAD] = dx / axis_steps_per_unit[A_AXIS];
  631. delta_mm[Y_HEAD] = dy / axis_steps_per_unit[B_AXIS];
  632. delta_mm[Z_AXIS] = dz / axis_steps_per_unit[Z_AXIS];
  633. delta_mm[A_AXIS] = (dx + dy) / axis_steps_per_unit[A_AXIS];
  634. delta_mm[B_AXIS] = (dx - dy) / axis_steps_per_unit[B_AXIS];
  635. #elif ENABLED(COREXZ)
  636. float delta_mm[6];
  637. delta_mm[X_HEAD] = dx / axis_steps_per_unit[A_AXIS];
  638. delta_mm[Y_AXIS] = dy / axis_steps_per_unit[Y_AXIS];
  639. delta_mm[Z_HEAD] = dz / axis_steps_per_unit[C_AXIS];
  640. delta_mm[A_AXIS] = (dx + dz) / axis_steps_per_unit[A_AXIS];
  641. delta_mm[C_AXIS] = (dx - dz) / axis_steps_per_unit[C_AXIS];
  642. #else
  643. float delta_mm[4];
  644. delta_mm[X_AXIS] = dx / axis_steps_per_unit[X_AXIS];
  645. delta_mm[Y_AXIS] = dy / axis_steps_per_unit[Y_AXIS];
  646. delta_mm[Z_AXIS] = dz / axis_steps_per_unit[Z_AXIS];
  647. #endif
  648. delta_mm[E_AXIS] = (de / axis_steps_per_unit[E_AXIS]) * volumetric_multiplier[extruder] * extruder_multiplier[extruder] / 100.0;
  649. if (block->steps[X_AXIS] <= dropsegments && block->steps[Y_AXIS] <= dropsegments && block->steps[Z_AXIS] <= dropsegments) {
  650. block->millimeters = fabs(delta_mm[E_AXIS]);
  651. }
  652. else {
  653. block->millimeters = sqrt(
  654. #if ENABLED(COREXY)
  655. square(delta_mm[X_HEAD]) + square(delta_mm[Y_HEAD]) + square(delta_mm[Z_AXIS])
  656. #elif ENABLED(COREXZ)
  657. square(delta_mm[X_HEAD]) + square(delta_mm[Y_AXIS]) + square(delta_mm[Z_HEAD])
  658. #else
  659. square(delta_mm[X_AXIS]) + square(delta_mm[Y_AXIS]) + square(delta_mm[Z_AXIS])
  660. #endif
  661. );
  662. }
  663. float inverse_millimeters = 1.0 / block->millimeters; // Inverse millimeters to remove multiple divides
  664. // Calculate speed in mm/second for each axis. No divide by zero due to previous checks.
  665. float inverse_second = feed_rate * inverse_millimeters;
  666. int moves_queued = movesplanned();
  667. // Slow down when the buffer starts to empty, rather than wait at the corner for a buffer refill
  668. #if ENABLED(OLD_SLOWDOWN) || ENABLED(SLOWDOWN)
  669. bool mq = moves_queued > 1 && moves_queued < BLOCK_BUFFER_SIZE / 2;
  670. #if ENABLED(OLD_SLOWDOWN)
  671. if (mq) feed_rate *= 2.0 * moves_queued / BLOCK_BUFFER_SIZE;
  672. #endif
  673. #if ENABLED(SLOWDOWN)
  674. // segment time im micro seconds
  675. unsigned long segment_time = lround(1000000.0/inverse_second);
  676. if (mq) {
  677. if (segment_time < minsegmenttime) {
  678. // buffer is draining, add extra time. The amount of time added increases if the buffer is still emptied more.
  679. inverse_second = 1000000.0 / (segment_time + lround(2 * (minsegmenttime - segment_time) / moves_queued));
  680. #ifdef XY_FREQUENCY_LIMIT
  681. segment_time = lround(1000000.0 / inverse_second);
  682. #endif
  683. }
  684. }
  685. #endif
  686. #endif
  687. block->nominal_speed = block->millimeters * inverse_second; // (mm/sec) Always > 0
  688. block->nominal_rate = ceil(block->step_event_count * inverse_second); // (step/sec) Always > 0
  689. #if ENABLED(FILAMENT_SENSOR)
  690. //FMM update ring buffer used for delay with filament measurements
  691. if (extruder == FILAMENT_SENSOR_EXTRUDER_NUM && delay_index2 > -1) { //only for extruder with filament sensor and if ring buffer is initialized
  692. const int MMD = MAX_MEASUREMENT_DELAY + 1, MMD10 = MMD * 10;
  693. delay_dist += delta_mm[E_AXIS]; // increment counter with next move in e axis
  694. while (delay_dist >= MMD10) delay_dist -= MMD10; // loop around the buffer
  695. while (delay_dist < 0) delay_dist += MMD10;
  696. delay_index1 = delay_dist / 10.0; // calculate index
  697. delay_index1 = constrain(delay_index1, 0, MAX_MEASUREMENT_DELAY); // (already constrained above)
  698. if (delay_index1 != delay_index2) { // moved index
  699. meas_sample = widthFil_to_size_ratio() - 100; // Subtract 100 to reduce magnitude - to store in a signed char
  700. while (delay_index1 != delay_index2) {
  701. // Increment and loop around buffer
  702. if (++delay_index2 >= MMD) delay_index2 -= MMD;
  703. delay_index2 = constrain(delay_index2, 0, MAX_MEASUREMENT_DELAY);
  704. measurement_delay[delay_index2] = meas_sample;
  705. }
  706. }
  707. }
  708. #endif
  709. // Calculate and limit speed in mm/sec for each axis
  710. float current_speed[NUM_AXIS];
  711. float speed_factor = 1.0; //factor <=1 do decrease speed
  712. for (int i = 0; i < NUM_AXIS; i++) {
  713. current_speed[i] = delta_mm[i] * inverse_second;
  714. float cs = fabs(current_speed[i]), mf = max_feedrate[i];
  715. if (cs > mf) speed_factor = min(speed_factor, mf / cs);
  716. }
  717. // Max segement time in us.
  718. #ifdef XY_FREQUENCY_LIMIT
  719. // Check and limit the xy direction change frequency
  720. unsigned char direction_change = block->direction_bits ^ old_direction_bits;
  721. old_direction_bits = block->direction_bits;
  722. segment_time = lround((float)segment_time / speed_factor);
  723. long xs0 = axis_segment_time[X_AXIS][0],
  724. xs1 = axis_segment_time[X_AXIS][1],
  725. xs2 = axis_segment_time[X_AXIS][2],
  726. ys0 = axis_segment_time[Y_AXIS][0],
  727. ys1 = axis_segment_time[Y_AXIS][1],
  728. ys2 = axis_segment_time[Y_AXIS][2];
  729. if ((direction_change & BIT(X_AXIS)) != 0) {
  730. xs2 = axis_segment_time[X_AXIS][2] = xs1;
  731. xs1 = axis_segment_time[X_AXIS][1] = xs0;
  732. xs0 = 0;
  733. }
  734. xs0 = axis_segment_time[X_AXIS][0] = xs0 + segment_time;
  735. if ((direction_change & BIT(Y_AXIS)) != 0) {
  736. ys2 = axis_segment_time[Y_AXIS][2] = axis_segment_time[Y_AXIS][1];
  737. ys1 = axis_segment_time[Y_AXIS][1] = axis_segment_time[Y_AXIS][0];
  738. ys0 = 0;
  739. }
  740. ys0 = axis_segment_time[Y_AXIS][0] = ys0 + segment_time;
  741. long max_x_segment_time = max(xs0, max(xs1, xs2)),
  742. max_y_segment_time = max(ys0, max(ys1, ys2)),
  743. min_xy_segment_time = min(max_x_segment_time, max_y_segment_time);
  744. if (min_xy_segment_time < MAX_FREQ_TIME) {
  745. float low_sf = speed_factor * min_xy_segment_time / MAX_FREQ_TIME;
  746. speed_factor = min(speed_factor, low_sf);
  747. }
  748. #endif // XY_FREQUENCY_LIMIT
  749. // Correct the speed
  750. if (speed_factor < 1.0) {
  751. for (unsigned char i = 0; i < NUM_AXIS; i++) current_speed[i] *= speed_factor;
  752. block->nominal_speed *= speed_factor;
  753. block->nominal_rate *= speed_factor;
  754. }
  755. // Compute and limit the acceleration rate for the trapezoid generator.
  756. float steps_per_mm = block->step_event_count / block->millimeters;
  757. long bsx = block->steps[X_AXIS], bsy = block->steps[Y_AXIS], bsz = block->steps[Z_AXIS], bse = block->steps[E_AXIS];
  758. if (bsx == 0 && bsy == 0 && bsz == 0) {
  759. block->acceleration_st = ceil(retract_acceleration * steps_per_mm); // convert to: acceleration steps/sec^2
  760. }
  761. else if (bse == 0) {
  762. block->acceleration_st = ceil(travel_acceleration * steps_per_mm); // convert to: acceleration steps/sec^2
  763. }
  764. else {
  765. block->acceleration_st = ceil(acceleration * steps_per_mm); // convert to: acceleration steps/sec^2
  766. }
  767. // Limit acceleration per axis
  768. unsigned long acc_st = block->acceleration_st,
  769. xsteps = axis_steps_per_sqr_second[X_AXIS],
  770. ysteps = axis_steps_per_sqr_second[Y_AXIS],
  771. zsteps = axis_steps_per_sqr_second[Z_AXIS],
  772. esteps = axis_steps_per_sqr_second[E_AXIS];
  773. if ((float)acc_st * bsx / block->step_event_count > xsteps) acc_st = xsteps;
  774. if ((float)acc_st * bsy / block->step_event_count > ysteps) acc_st = ysteps;
  775. if ((float)acc_st * bsz / block->step_event_count > zsteps) acc_st = zsteps;
  776. if ((float)acc_st * bse / block->step_event_count > esteps) acc_st = esteps;
  777. block->acceleration_st = acc_st;
  778. block->acceleration = acc_st / steps_per_mm;
  779. block->acceleration_rate = (long)(acc_st * 16777216.0 / (F_CPU / 8.0));
  780. #if 0 // Use old jerk for now
  781. // Compute path unit vector
  782. double unit_vec[3];
  783. unit_vec[X_AXIS] = delta_mm[X_AXIS] * inverse_millimeters;
  784. unit_vec[Y_AXIS] = delta_mm[Y_AXIS] * inverse_millimeters;
  785. unit_vec[Z_AXIS] = delta_mm[Z_AXIS] * inverse_millimeters;
  786. // Compute maximum allowable entry speed at junction by centripetal acceleration approximation.
  787. // Let a circle be tangent to both previous and current path line segments, where the junction
  788. // deviation is defined as the distance from the junction to the closest edge of the circle,
  789. // colinear with the circle center. The circular segment joining the two paths represents the
  790. // path of centripetal acceleration. Solve for max velocity based on max acceleration about the
  791. // radius of the circle, defined indirectly by junction deviation. This may be also viewed as
  792. // path width or max_jerk in the previous grbl version. This approach does not actually deviate
  793. // from path, but used as a robust way to compute cornering speeds, as it takes into account the
  794. // nonlinearities of both the junction angle and junction velocity.
  795. double vmax_junction = MINIMUM_PLANNER_SPEED; // Set default max junction speed
  796. // Skip first block or when previous_nominal_speed is used as a flag for homing and offset cycles.
  797. if ((block_buffer_head != block_buffer_tail) && (previous_nominal_speed > 0.0)) {
  798. // Compute cosine of angle between previous and current path. (prev_unit_vec is negative)
  799. // NOTE: Max junction velocity is computed without sin() or acos() by trig half angle identity.
  800. double cos_theta = - previous_unit_vec[X_AXIS] * unit_vec[X_AXIS]
  801. - previous_unit_vec[Y_AXIS] * unit_vec[Y_AXIS]
  802. - previous_unit_vec[Z_AXIS] * unit_vec[Z_AXIS] ;
  803. // Skip and use default max junction speed for 0 degree acute junction.
  804. if (cos_theta < 0.95) {
  805. vmax_junction = min(previous_nominal_speed, block->nominal_speed);
  806. // Skip and avoid divide by zero for straight junctions at 180 degrees. Limit to min() of nominal speeds.
  807. if (cos_theta > -0.95) {
  808. // Compute maximum junction velocity based on maximum acceleration and junction deviation
  809. double sin_theta_d2 = sqrt(0.5 * (1.0 - cos_theta)); // Trig half angle identity. Always positive.
  810. vmax_junction = min(vmax_junction,
  811. sqrt(block->acceleration * junction_deviation * sin_theta_d2 / (1.0 - sin_theta_d2)));
  812. }
  813. }
  814. }
  815. #endif
  816. // Start with a safe speed
  817. float vmax_junction = max_xy_jerk / 2;
  818. float vmax_junction_factor = 1.0;
  819. float mz2 = max_z_jerk / 2, me2 = max_e_jerk / 2;
  820. float csz = current_speed[Z_AXIS], cse = current_speed[E_AXIS];
  821. if (fabs(csz) > mz2) vmax_junction = min(vmax_junction, mz2);
  822. if (fabs(cse) > me2) vmax_junction = min(vmax_junction, me2);
  823. vmax_junction = min(vmax_junction, block->nominal_speed);
  824. float safe_speed = vmax_junction;
  825. if ((moves_queued > 1) && (previous_nominal_speed > 0.0001)) {
  826. float dx = current_speed[X_AXIS] - previous_speed[X_AXIS],
  827. dy = current_speed[Y_AXIS] - previous_speed[Y_AXIS],
  828. dz = fabs(csz - previous_speed[Z_AXIS]),
  829. de = fabs(cse - previous_speed[E_AXIS]),
  830. jerk = sqrt(dx * dx + dy * dy);
  831. // if ((fabs(previous_speed[X_AXIS]) > 0.0001) || (fabs(previous_speed[Y_AXIS]) > 0.0001)) {
  832. vmax_junction = block->nominal_speed;
  833. // }
  834. if (jerk > max_xy_jerk) vmax_junction_factor = max_xy_jerk / jerk;
  835. if (dz > max_z_jerk) vmax_junction_factor = min(vmax_junction_factor, max_z_jerk / dz);
  836. if (de > max_e_jerk) vmax_junction_factor = min(vmax_junction_factor, max_e_jerk / de);
  837. vmax_junction = min(previous_nominal_speed, vmax_junction * vmax_junction_factor); // Limit speed to max previous speed
  838. }
  839. block->max_entry_speed = vmax_junction;
  840. // Initialize block entry speed. Compute based on deceleration to user-defined MINIMUM_PLANNER_SPEED.
  841. double v_allowable = max_allowable_speed(-block->acceleration, MINIMUM_PLANNER_SPEED, block->millimeters);
  842. block->entry_speed = min(vmax_junction, v_allowable);
  843. // Initialize planner efficiency flags
  844. // Set flag if block will always reach maximum junction speed regardless of entry/exit speeds.
  845. // If a block can de/ac-celerate from nominal speed to zero within the length of the block, then
  846. // the current block and next block junction speeds are guaranteed to always be at their maximum
  847. // junction speeds in deceleration and acceleration, respectively. This is due to how the current
  848. // block nominal speed limits both the current and next maximum junction speeds. Hence, in both
  849. // the reverse and forward planners, the corresponding block junction speed will always be at the
  850. // the maximum junction speed and may always be ignored for any speed reduction checks.
  851. block->nominal_length_flag = (block->nominal_speed <= v_allowable);
  852. block->recalculate_flag = true; // Always calculate trapezoid for new block
  853. // Update previous path unit_vector and nominal speed
  854. for (int i = 0; i < NUM_AXIS; i++) previous_speed[i] = current_speed[i];
  855. previous_nominal_speed = block->nominal_speed;
  856. #if ENABLED(ADVANCE)
  857. // Calculate advance rate
  858. if (!bse || (!bsx && !bsy && !bsz)) {
  859. block->advance_rate = 0;
  860. block->advance = 0;
  861. }
  862. else {
  863. long acc_dist = estimate_acceleration_distance(0, block->nominal_rate, block->acceleration_st);
  864. float advance = (STEPS_PER_CUBIC_MM_E * EXTRUDER_ADVANCE_K) * (cse * cse * EXTRUSION_AREA * EXTRUSION_AREA) * 256;
  865. block->advance = advance;
  866. block->advance_rate = acc_dist ? advance / (float)acc_dist : 0;
  867. }
  868. /*
  869. SERIAL_ECHO_START;
  870. SERIAL_ECHOPGM("advance :");
  871. SERIAL_ECHO(block->advance/256.0);
  872. SERIAL_ECHOPGM("advance rate :");
  873. SERIAL_ECHOLN(block->advance_rate/256.0);
  874. */
  875. #endif // ADVANCE
  876. calculate_trapezoid_for_block(block, block->entry_speed / block->nominal_speed, safe_speed / block->nominal_speed);
  877. // Move buffer head
  878. block_buffer_head = next_buffer_head;
  879. // Update position
  880. for (int i = 0; i < NUM_AXIS; i++) position[i] = target[i];
  881. planner_recalculate();
  882. st_wake_up();
  883. } // plan_buffer_line()
  884. #if ENABLED(AUTO_BED_LEVELING_FEATURE) && DISABLED(DELTA)
  885. vector_3 plan_get_position() {
  886. vector_3 position = vector_3(st_get_position_mm(X_AXIS), st_get_position_mm(Y_AXIS), st_get_position_mm(Z_AXIS));
  887. //position.debug("in plan_get position");
  888. //plan_bed_level_matrix.debug("in plan_get_position");
  889. matrix_3x3 inverse = matrix_3x3::transpose(plan_bed_level_matrix);
  890. //inverse.debug("in plan_get inverse");
  891. position.apply_rotation(inverse);
  892. //position.debug("after rotation");
  893. return position;
  894. }
  895. #endif // AUTO_BED_LEVELING_FEATURE && !DELTA
  896. #if ENABLED(AUTO_BED_LEVELING_FEATURE) || ENABLED(MESH_BED_LEVELING)
  897. void plan_set_position(float x, float y, float z, const float& e)
  898. #else
  899. void plan_set_position(const float& x, const float& y, const float& z, const float& e)
  900. #endif // AUTO_BED_LEVELING_FEATURE || MESH_BED_LEVELING
  901. {
  902. #if ENABLED(MESH_BED_LEVELING)
  903. if (mbl.active) z += mbl.get_z(x, y);
  904. #elif ENABLED(AUTO_BED_LEVELING_FEATURE)
  905. apply_rotation_xyz(plan_bed_level_matrix, x, y, z);
  906. #endif
  907. float nx = position[X_AXIS] = lround(x * axis_steps_per_unit[X_AXIS]),
  908. ny = position[Y_AXIS] = lround(y * axis_steps_per_unit[Y_AXIS]),
  909. nz = position[Z_AXIS] = lround(z * axis_steps_per_unit[Z_AXIS]),
  910. ne = position[E_AXIS] = lround(e * axis_steps_per_unit[E_AXIS]);
  911. st_set_position(nx, ny, nz, ne);
  912. previous_nominal_speed = 0.0; // Resets planner junction speeds. Assumes start from rest.
  913. for (int i = 0; i < NUM_AXIS; i++) previous_speed[i] = 0.0;
  914. }
  915. void plan_set_e_position(const float& e) {
  916. position[E_AXIS] = lround(e * axis_steps_per_unit[E_AXIS]);
  917. st_set_e_position(position[E_AXIS]);
  918. }
  919. // Calculate the steps/s^2 acceleration rates, based on the mm/s^s
  920. void reset_acceleration_rates() {
  921. for (int i = 0; i < NUM_AXIS; i++)
  922. axis_steps_per_sqr_second[i] = max_acceleration_units_per_sq_second[i] * axis_steps_per_unit[i];
  923. }