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.

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