planner.cpp 55 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535
  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 "planner.h"
  60. #include "stepper.h"
  61. #include "temperature.h"
  62. #include "ultralcd.h"
  63. #include "language.h"
  64. #include "ubl.h"
  65. #include "gcode.h"
  66. #include "Marlin.h"
  67. #if ENABLED(MESH_BED_LEVELING)
  68. #include "mesh_bed_leveling.h"
  69. #endif
  70. Planner planner;
  71. // public:
  72. /**
  73. * A ring buffer of moves described in steps
  74. */
  75. block_t Planner::block_buffer[BLOCK_BUFFER_SIZE];
  76. volatile uint8_t Planner::block_buffer_head = 0, // Index of the next block to be pushed
  77. Planner::block_buffer_tail = 0;
  78. float Planner::max_feedrate_mm_s[XYZE_N], // Max speeds in mm per second
  79. Planner::axis_steps_per_mm[XYZE_N],
  80. Planner::steps_to_mm[XYZE_N];
  81. #if ENABLED(DISTINCT_E_FACTORS)
  82. uint8_t Planner::last_extruder = 0; // Respond to extruder change
  83. #endif
  84. uint32_t Planner::max_acceleration_steps_per_s2[XYZE_N],
  85. Planner::max_acceleration_mm_per_s2[XYZE_N]; // Use M201 to override by software
  86. millis_t Planner::min_segment_time;
  87. // Initialized by settings.load()
  88. float Planner::min_feedrate_mm_s,
  89. Planner::acceleration, // Normal acceleration mm/s^2 DEFAULT ACCELERATION for all printing moves. M204 SXXXX
  90. Planner::retract_acceleration, // Retract acceleration mm/s^2 filament pull-back and push-forward while standing still in the other axes M204 TXXXX
  91. Planner::travel_acceleration, // Travel acceleration mm/s^2 DEFAULT ACCELERATION for all NON printing moves. M204 MXXXX
  92. Planner::max_jerk[XYZE], // The largest speed change requiring no acceleration
  93. Planner::min_travel_feedrate_mm_s;
  94. #if HAS_ABL
  95. bool Planner::abl_enabled = false; // Flag that auto bed leveling is enabled
  96. #endif
  97. #if ABL_PLANAR
  98. matrix_3x3 Planner::bed_level_matrix; // Transform to compensate for bed level
  99. #endif
  100. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  101. float Planner::z_fade_height, // Initialized by settings.load()
  102. Planner::inverse_z_fade_height;
  103. #endif
  104. #if ENABLED(AUTOTEMP)
  105. float Planner::autotemp_max = 250,
  106. Planner::autotemp_min = 210,
  107. Planner::autotemp_factor = 0.1;
  108. bool Planner::autotemp_enabled = false;
  109. #endif
  110. // private:
  111. long Planner::position[NUM_AXIS] = { 0 };
  112. uint32_t Planner::cutoff_long;
  113. float Planner::previous_speed[NUM_AXIS],
  114. Planner::previous_nominal_speed;
  115. #if ENABLED(DISABLE_INACTIVE_EXTRUDER)
  116. uint8_t Planner::g_uc_extruder_last_move[EXTRUDERS] = { 0 };
  117. #endif
  118. #ifdef XY_FREQUENCY_LIMIT
  119. // Old direction bits. Used for speed calculations
  120. unsigned char Planner::old_direction_bits = 0;
  121. // Segment times (in µs). Used for speed calculations
  122. long Planner::axis_segment_time[2][3] = { {MAX_FREQ_TIME + 1, 0, 0}, {MAX_FREQ_TIME + 1, 0, 0} };
  123. #endif
  124. #if ENABLED(LIN_ADVANCE)
  125. float Planner::extruder_advance_k, // Initialized by settings.load()
  126. Planner::advance_ed_ratio, // Initialized by settings.load()
  127. Planner::position_float[NUM_AXIS] = { 0 };
  128. #endif
  129. #if ENABLED(ULTRA_LCD)
  130. volatile uint32_t Planner::block_buffer_runtime_us = 0;
  131. #endif
  132. /**
  133. * Class and Instance Methods
  134. */
  135. Planner::Planner() { init(); }
  136. void Planner::init() {
  137. block_buffer_head = block_buffer_tail = 0;
  138. ZERO(position);
  139. #if ENABLED(LIN_ADVANCE)
  140. ZERO(position_float);
  141. #endif
  142. ZERO(previous_speed);
  143. previous_nominal_speed = 0.0;
  144. #if ABL_PLANAR
  145. bed_level_matrix.set_to_identity();
  146. #endif
  147. }
  148. #define MINIMAL_STEP_RATE 120
  149. /**
  150. * Calculate trapezoid parameters, multiplying the entry- and exit-speeds
  151. * by the provided factors.
  152. */
  153. void Planner::calculate_trapezoid_for_block(block_t* const block, const float &entry_factor, const float &exit_factor) {
  154. uint32_t initial_rate = CEIL(block->nominal_rate * entry_factor),
  155. final_rate = CEIL(block->nominal_rate * exit_factor); // (steps per second)
  156. // Limit minimal step rate (Otherwise the timer will overflow.)
  157. NOLESS(initial_rate, MINIMAL_STEP_RATE);
  158. NOLESS(final_rate, MINIMAL_STEP_RATE);
  159. int32_t accel = block->acceleration_steps_per_s2,
  160. accelerate_steps = CEIL(estimate_acceleration_distance(initial_rate, block->nominal_rate, accel)),
  161. decelerate_steps = FLOOR(estimate_acceleration_distance(block->nominal_rate, final_rate, -accel)),
  162. plateau_steps = block->step_event_count - accelerate_steps - decelerate_steps;
  163. // Is the Plateau of Nominal Rate smaller than nothing? That means no cruising, and we will
  164. // have to use intersection_distance() to calculate when to abort accel and start braking
  165. // in order to reach the final_rate exactly at the end of this block.
  166. if (plateau_steps < 0) {
  167. accelerate_steps = CEIL(intersection_distance(initial_rate, final_rate, accel, block->step_event_count));
  168. NOLESS(accelerate_steps, 0); // Check limits due to numerical round-off
  169. 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)
  170. plateau_steps = 0;
  171. }
  172. // block->accelerate_until = accelerate_steps;
  173. // block->decelerate_after = accelerate_steps+plateau_steps;
  174. CRITICAL_SECTION_START; // Fill variables used by the stepper in a critical section
  175. if (!TEST(block->flag, BLOCK_BIT_BUSY)) { // Don't update variables if block is busy.
  176. block->accelerate_until = accelerate_steps;
  177. block->decelerate_after = accelerate_steps + plateau_steps;
  178. block->initial_rate = initial_rate;
  179. block->final_rate = final_rate;
  180. }
  181. CRITICAL_SECTION_END;
  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 recalculate() when scanning the plan from last to first entry.
  191. void Planner::reverse_pass_kernel(block_t* const current, const block_t *next) {
  192. if (!current || !next) return;
  193. // If entry speed is already at the maximum entry speed, no need to recheck. Block is cruising.
  194. // If not, block in state of acceleration or deceleration. Reset entry speed to maximum and
  195. // check for maximum allowable speed reductions to ensure maximum possible planned speed.
  196. float max_entry_speed = current->max_entry_speed;
  197. if (current->entry_speed != max_entry_speed) {
  198. // If nominal length true, max junction speed is guaranteed to be reached. Only compute
  199. // for max allowable speed if block is decelerating and nominal length is false.
  200. current->entry_speed = (TEST(current->flag, BLOCK_BIT_NOMINAL_LENGTH) || max_entry_speed <= next->entry_speed)
  201. ? max_entry_speed
  202. : min(max_entry_speed, max_allowable_speed(-current->acceleration, next->entry_speed, current->millimeters));
  203. SBI(current->flag, BLOCK_BIT_RECALCULATE);
  204. }
  205. }
  206. /**
  207. * recalculate() needs to go over the current plan twice.
  208. * Once in reverse and once forward. This implements the reverse pass.
  209. */
  210. void Planner::reverse_pass() {
  211. if (movesplanned() > 3) {
  212. block_t* block[3] = { NULL, NULL, NULL };
  213. // Make a local copy of block_buffer_tail, because the interrupt can alter it
  214. // Is a critical section REALLY needed for a single byte change?
  215. //CRITICAL_SECTION_START;
  216. uint8_t tail = block_buffer_tail;
  217. //CRITICAL_SECTION_END
  218. uint8_t b = BLOCK_MOD(block_buffer_head - 3);
  219. while (b != tail) {
  220. if (block[0] && TEST(block[0]->flag, BLOCK_BIT_START_FROM_FULL_HALT)) break;
  221. b = prev_block_index(b);
  222. block[2] = block[1];
  223. block[1] = block[0];
  224. block[0] = &block_buffer[b];
  225. reverse_pass_kernel(block[1], block[2]);
  226. }
  227. }
  228. }
  229. // The kernel called by recalculate() when scanning the plan from first to last entry.
  230. void Planner::forward_pass_kernel(const block_t* previous, block_t* const current) {
  231. if (!previous) return;
  232. // If the previous block is an acceleration block, but it is not long enough to complete the
  233. // full speed change within the block, we need to adjust the entry speed accordingly. Entry
  234. // speeds have already been reset, maximized, and reverse planned by reverse planner.
  235. // If nominal length is true, max junction speed is guaranteed to be reached. No need to recheck.
  236. if (!TEST(previous->flag, BLOCK_BIT_NOMINAL_LENGTH)) {
  237. if (previous->entry_speed < current->entry_speed) {
  238. float entry_speed = min(current->entry_speed,
  239. max_allowable_speed(-previous->acceleration, previous->entry_speed, previous->millimeters));
  240. // Check for junction speed change
  241. if (current->entry_speed != entry_speed) {
  242. current->entry_speed = entry_speed;
  243. SBI(current->flag, BLOCK_BIT_RECALCULATE);
  244. }
  245. }
  246. }
  247. }
  248. /**
  249. * recalculate() needs to go over the current plan twice.
  250. * Once in reverse and once forward. This implements the forward pass.
  251. */
  252. void Planner::forward_pass() {
  253. block_t* block[3] = { NULL, NULL, NULL };
  254. for (uint8_t b = block_buffer_tail; b != block_buffer_head; b = next_block_index(b)) {
  255. block[0] = block[1];
  256. block[1] = block[2];
  257. block[2] = &block_buffer[b];
  258. forward_pass_kernel(block[0], block[1]);
  259. }
  260. forward_pass_kernel(block[1], block[2]);
  261. }
  262. /**
  263. * Recalculate the trapezoid speed profiles for all blocks in the plan
  264. * according to the entry_factor for each junction. Must be called by
  265. * recalculate() after updating the blocks.
  266. */
  267. void Planner::recalculate_trapezoids() {
  268. int8_t block_index = block_buffer_tail;
  269. block_t *current, *next = NULL;
  270. while (block_index != block_buffer_head) {
  271. current = next;
  272. next = &block_buffer[block_index];
  273. if (current) {
  274. // Recalculate if current block entry or exit junction speed has changed.
  275. if (TEST(current->flag, BLOCK_BIT_RECALCULATE) || TEST(next->flag, BLOCK_BIT_RECALCULATE)) {
  276. // NOTE: Entry and exit factors always > 0 by all previous logic operations.
  277. float nom = current->nominal_speed;
  278. calculate_trapezoid_for_block(current, current->entry_speed / nom, next->entry_speed / nom);
  279. CBI(current->flag, BLOCK_BIT_RECALCULATE); // Reset current only to ensure next trapezoid is computed
  280. }
  281. }
  282. block_index = next_block_index(block_index);
  283. }
  284. // Last/newest block in buffer. Exit speed is set with MINIMUM_PLANNER_SPEED. Always recalculated.
  285. if (next) {
  286. float nom = next->nominal_speed;
  287. calculate_trapezoid_for_block(next, next->entry_speed / nom, (MINIMUM_PLANNER_SPEED) / nom);
  288. CBI(next->flag, BLOCK_BIT_RECALCULATE);
  289. }
  290. }
  291. /*
  292. * Recalculate the motion plan according to the following algorithm:
  293. *
  294. * 1. Go over every block in reverse order...
  295. *
  296. * Calculate a junction speed reduction (block_t.entry_factor) so:
  297. *
  298. * a. The junction jerk is within the set limit, and
  299. *
  300. * b. No speed reduction within one block requires faster
  301. * deceleration than the one, true constant acceleration.
  302. *
  303. * 2. Go over every block in chronological order...
  304. *
  305. * Dial down junction speed reduction values if:
  306. * a. The speed increase within one block would require faster
  307. * acceleration than the one, true constant acceleration.
  308. *
  309. * After that, all blocks will have an entry_factor allowing all speed changes to
  310. * be performed using only the one, true constant acceleration, and where no junction
  311. * jerk is jerkier than the set limit, Jerky. Finally it will:
  312. *
  313. * 3. Recalculate "trapezoids" for all blocks.
  314. */
  315. void Planner::recalculate() {
  316. reverse_pass();
  317. forward_pass();
  318. recalculate_trapezoids();
  319. }
  320. #if ENABLED(AUTOTEMP)
  321. void Planner::getHighESpeed() {
  322. static float oldt = 0;
  323. if (!autotemp_enabled) return;
  324. if (thermalManager.degTargetHotend(0) + 2 < autotemp_min) return; // probably temperature set to zero.
  325. float high = 0.0;
  326. for (uint8_t b = block_buffer_tail; b != block_buffer_head; b = next_block_index(b)) {
  327. block_t* block = &block_buffer[b];
  328. if (block->steps[X_AXIS] || block->steps[Y_AXIS] || block->steps[Z_AXIS]) {
  329. float se = (float)block->steps[E_AXIS] / block->step_event_count * block->nominal_speed; // mm/sec;
  330. NOLESS(high, se);
  331. }
  332. }
  333. float t = autotemp_min + high * autotemp_factor;
  334. t = constrain(t, autotemp_min, autotemp_max);
  335. if (t < oldt) t = t * (1 - (AUTOTEMP_OLDWEIGHT)) + oldt * (AUTOTEMP_OLDWEIGHT);
  336. oldt = t;
  337. thermalManager.setTargetHotend(t, 0);
  338. }
  339. #endif // AUTOTEMP
  340. /**
  341. * Maintain fans, paste extruder pressure,
  342. */
  343. void Planner::check_axes_activity() {
  344. unsigned char axis_active[NUM_AXIS] = { 0 },
  345. tail_fan_speed[FAN_COUNT];
  346. #if FAN_COUNT > 0
  347. for (uint8_t i = 0; i < FAN_COUNT; i++) tail_fan_speed[i] = fanSpeeds[i];
  348. #endif
  349. #if ENABLED(BARICUDA)
  350. #if HAS_HEATER_1
  351. uint8_t tail_valve_pressure = baricuda_valve_pressure;
  352. #endif
  353. #if HAS_HEATER_2
  354. uint8_t tail_e_to_p_pressure = baricuda_e_to_p_pressure;
  355. #endif
  356. #endif
  357. if (blocks_queued()) {
  358. #if FAN_COUNT > 0
  359. for (uint8_t i = 0; i < FAN_COUNT; i++) tail_fan_speed[i] = block_buffer[block_buffer_tail].fan_speed[i];
  360. #endif
  361. block_t* block;
  362. #if ENABLED(BARICUDA)
  363. block = &block_buffer[block_buffer_tail];
  364. #if HAS_HEATER_1
  365. tail_valve_pressure = block->valve_pressure;
  366. #endif
  367. #if HAS_HEATER_2
  368. tail_e_to_p_pressure = block->e_to_p_pressure;
  369. #endif
  370. #endif
  371. for (uint8_t b = block_buffer_tail; b != block_buffer_head; b = next_block_index(b)) {
  372. block = &block_buffer[b];
  373. LOOP_XYZE(i) if (block->steps[i]) axis_active[i]++;
  374. }
  375. }
  376. #if ENABLED(DISABLE_X)
  377. if (!axis_active[X_AXIS]) disable_X();
  378. #endif
  379. #if ENABLED(DISABLE_Y)
  380. if (!axis_active[Y_AXIS]) disable_Y();
  381. #endif
  382. #if ENABLED(DISABLE_Z)
  383. if (!axis_active[Z_AXIS]) disable_Z();
  384. #endif
  385. #if ENABLED(DISABLE_E)
  386. if (!axis_active[E_AXIS]) disable_e_steppers();
  387. #endif
  388. #if FAN_COUNT > 0
  389. #ifdef FAN_MIN_PWM
  390. #define CALC_FAN_SPEED(f) (tail_fan_speed[f] ? ( FAN_MIN_PWM + (tail_fan_speed[f] * (255 - FAN_MIN_PWM)) / 255 ) : 0)
  391. #else
  392. #define CALC_FAN_SPEED(f) tail_fan_speed[f]
  393. #endif
  394. #ifdef FAN_KICKSTART_TIME
  395. static millis_t fan_kick_end[FAN_COUNT] = { 0 };
  396. #define KICKSTART_FAN(f) \
  397. if (tail_fan_speed[f]) { \
  398. millis_t ms = millis(); \
  399. if (fan_kick_end[f] == 0) { \
  400. fan_kick_end[f] = ms + FAN_KICKSTART_TIME; \
  401. tail_fan_speed[f] = 255; \
  402. } else if (PENDING(ms, fan_kick_end[f])) \
  403. tail_fan_speed[f] = 255; \
  404. } else fan_kick_end[f] = 0
  405. #if HAS_FAN0
  406. KICKSTART_FAN(0);
  407. #endif
  408. #if HAS_FAN1
  409. KICKSTART_FAN(1);
  410. #endif
  411. #if HAS_FAN2
  412. KICKSTART_FAN(2);
  413. #endif
  414. #endif // FAN_KICKSTART_TIME
  415. #if ENABLED(FAN_SOFT_PWM)
  416. #if HAS_FAN0
  417. thermalManager.soft_pwm_amount_fan[0] = CALC_FAN_SPEED(0);
  418. #endif
  419. #if HAS_FAN1
  420. thermalManager.soft_pwm_amount_fan[1] = CALC_FAN_SPEED(1);
  421. #endif
  422. #if HAS_FAN2
  423. thermalManager.soft_pwm_amount_fan[2] = CALC_FAN_SPEED(2);
  424. #endif
  425. #else
  426. #if HAS_FAN0
  427. analogWrite(FAN_PIN, CALC_FAN_SPEED(0));
  428. #endif
  429. #if HAS_FAN1
  430. analogWrite(FAN1_PIN, CALC_FAN_SPEED(1));
  431. #endif
  432. #if HAS_FAN2
  433. analogWrite(FAN2_PIN, CALC_FAN_SPEED(2));
  434. #endif
  435. #endif
  436. #endif // FAN_COUNT > 0
  437. #if ENABLED(AUTOTEMP)
  438. getHighESpeed();
  439. #endif
  440. #if ENABLED(BARICUDA)
  441. #if HAS_HEATER_1
  442. analogWrite(HEATER_1_PIN, tail_valve_pressure);
  443. #endif
  444. #if HAS_HEATER_2
  445. analogWrite(HEATER_2_PIN, tail_e_to_p_pressure);
  446. #endif
  447. #endif
  448. }
  449. #if PLANNER_LEVELING
  450. /**
  451. * lx, ly, lz - logical (cartesian, not delta) positions in mm
  452. */
  453. void Planner::apply_leveling(float &lx, float &ly, float &lz) {
  454. #if ENABLED(AUTO_BED_LEVELING_UBL)
  455. if (!ubl.state.active) return;
  456. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  457. // if z_fade_height enabled (nonzero) and raw_z above it, no leveling required
  458. if (planner.z_fade_height && planner.z_fade_height <= RAW_Z_POSITION(lz)) return;
  459. lz += ubl.state.z_offset + ubl.get_z_correction(lx, ly) * ubl.fade_scaling_factor_for_z(lz);
  460. #else // no fade
  461. lz += ubl.state.z_offset + ubl.get_z_correction(lx, ly);
  462. #endif // FADE
  463. #endif // UBL
  464. #if HAS_ABL
  465. if (!abl_enabled) return;
  466. #endif
  467. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT) && DISABLED(AUTO_BED_LEVELING_UBL)
  468. static float z_fade_factor = 1.0, last_raw_lz = -999.0;
  469. if (z_fade_height) {
  470. const float raw_lz = RAW_Z_POSITION(lz);
  471. if (raw_lz >= z_fade_height) return;
  472. if (last_raw_lz != raw_lz) {
  473. last_raw_lz = raw_lz;
  474. z_fade_factor = 1.0 - raw_lz * inverse_z_fade_height;
  475. }
  476. }
  477. else
  478. z_fade_factor = 1.0;
  479. #endif
  480. #if ENABLED(MESH_BED_LEVELING)
  481. if (mbl.active())
  482. lz += mbl.get_z(RAW_X_POSITION(lx), RAW_Y_POSITION(ly)
  483. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  484. , z_fade_factor
  485. #endif
  486. );
  487. #elif ABL_PLANAR
  488. float dx = RAW_X_POSITION(lx) - (X_TILT_FULCRUM),
  489. dy = RAW_Y_POSITION(ly) - (Y_TILT_FULCRUM),
  490. dz = RAW_Z_POSITION(lz);
  491. apply_rotation_xyz(bed_level_matrix, dx, dy, dz);
  492. lx = LOGICAL_X_POSITION(dx + X_TILT_FULCRUM);
  493. ly = LOGICAL_Y_POSITION(dy + Y_TILT_FULCRUM);
  494. lz = LOGICAL_Z_POSITION(dz);
  495. #elif ENABLED(AUTO_BED_LEVELING_BILINEAR)
  496. float tmp[XYZ] = { lx, ly, 0 };
  497. lz += bilinear_z_offset(tmp)
  498. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  499. * z_fade_factor
  500. #endif
  501. ;
  502. #endif
  503. }
  504. void Planner::unapply_leveling(float logical[XYZ]) {
  505. #if ENABLED(AUTO_BED_LEVELING_UBL)
  506. if (ubl.state.active) {
  507. const float z_physical = RAW_Z_POSITION(logical[Z_AXIS]),
  508. z_correct = ubl.get_z_correction(logical[X_AXIS], logical[Y_AXIS]),
  509. z_virtual = z_physical - ubl.state.z_offset - z_correct;
  510. float z_logical = LOGICAL_Z_POSITION(z_virtual);
  511. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  512. // for P=physical_z, L=logical_z, M=mesh_z, O=z_offset, H=fade_height,
  513. // Given P=L+O+M(1-L/H) (faded mesh correction formula for L<H)
  514. // then L=P-O-M(1-L/H)
  515. // so L=P-O-M+ML/H
  516. // so L-ML/H=P-O-M
  517. // so L(1-M/H)=P-O-M
  518. // so L=(P-O-M)/(1-M/H) for L<H
  519. if (planner.z_fade_height) {
  520. if (z_logical >= planner.z_fade_height)
  521. z_logical = LOGICAL_Z_POSITION(z_physical - ubl.state.z_offset);
  522. else
  523. z_logical /= 1.0 - z_correct * planner.inverse_z_fade_height;
  524. }
  525. #endif // ENABLE_LEVELING_FADE_HEIGHT
  526. logical[Z_AXIS] = z_logical;
  527. }
  528. return; // don't fall thru to other ENABLE_LEVELING_FADE_HEIGHT logic
  529. #endif
  530. #if HAS_ABL
  531. if (!abl_enabled) return;
  532. #endif
  533. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  534. if (z_fade_height && RAW_Z_POSITION(logical[Z_AXIS]) >= z_fade_height) return;
  535. #endif
  536. #if ENABLED(MESH_BED_LEVELING)
  537. if (mbl.active()) {
  538. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  539. const float c = mbl.get_z(RAW_X_POSITION(logical[X_AXIS]), RAW_Y_POSITION(logical[Y_AXIS]), 1.0);
  540. logical[Z_AXIS] = (z_fade_height * (RAW_Z_POSITION(logical[Z_AXIS]) - c)) / (z_fade_height - c);
  541. #else
  542. logical[Z_AXIS] -= mbl.get_z(RAW_X_POSITION(logical[X_AXIS]), RAW_Y_POSITION(logical[Y_AXIS]));
  543. #endif
  544. }
  545. #elif ABL_PLANAR
  546. matrix_3x3 inverse = matrix_3x3::transpose(bed_level_matrix);
  547. float dx = RAW_X_POSITION(logical[X_AXIS]) - (X_TILT_FULCRUM),
  548. dy = RAW_Y_POSITION(logical[Y_AXIS]) - (Y_TILT_FULCRUM),
  549. dz = RAW_Z_POSITION(logical[Z_AXIS]);
  550. apply_rotation_xyz(inverse, dx, dy, dz);
  551. logical[X_AXIS] = LOGICAL_X_POSITION(dx + X_TILT_FULCRUM);
  552. logical[Y_AXIS] = LOGICAL_Y_POSITION(dy + Y_TILT_FULCRUM);
  553. logical[Z_AXIS] = LOGICAL_Z_POSITION(dz);
  554. #elif ENABLED(AUTO_BED_LEVELING_BILINEAR)
  555. #if ENABLED(ENABLE_LEVELING_FADE_HEIGHT)
  556. const float c = bilinear_z_offset(logical);
  557. logical[Z_AXIS] = (z_fade_height * (RAW_Z_POSITION(logical[Z_AXIS]) - c)) / (z_fade_height - c);
  558. #else
  559. logical[Z_AXIS] -= bilinear_z_offset(logical);
  560. #endif
  561. #endif
  562. }
  563. #endif // PLANNER_LEVELING
  564. /**
  565. * Planner::_buffer_line
  566. *
  567. * Add a new linear movement to the buffer.
  568. *
  569. * Leveling and kinematics should be applied ahead of calling this.
  570. *
  571. * a,b,c,e - target positions in mm or degrees
  572. * fr_mm_s - (target) speed of the move
  573. * extruder - target extruder
  574. */
  575. void Planner::_buffer_line(const float &a, const float &b, const float &c, const float &e, float fr_mm_s, const uint8_t extruder) {
  576. // The target position of the tool in absolute steps
  577. // Calculate target position in absolute steps
  578. //this should be done after the wait, because otherwise a M92 code within the gcode disrupts this calculation somehow
  579. const long target[XYZE] = {
  580. LROUND(a * axis_steps_per_mm[X_AXIS]),
  581. LROUND(b * axis_steps_per_mm[Y_AXIS]),
  582. LROUND(c * axis_steps_per_mm[Z_AXIS]),
  583. LROUND(e * axis_steps_per_mm[E_AXIS_N])
  584. };
  585. // When changing extruders recalculate steps corresponding to the E position
  586. #if ENABLED(DISTINCT_E_FACTORS)
  587. if (last_extruder != extruder && axis_steps_per_mm[E_AXIS_N] != axis_steps_per_mm[E_AXIS + last_extruder]) {
  588. position[E_AXIS] = LROUND(position[E_AXIS] * axis_steps_per_mm[E_AXIS_N] * steps_to_mm[E_AXIS + last_extruder]);
  589. last_extruder = extruder;
  590. }
  591. #endif
  592. #if ENABLED(LIN_ADVANCE)
  593. const float mm_D_float = SQRT(sq(a - position_float[X_AXIS]) + sq(b - position_float[Y_AXIS]));
  594. #endif
  595. const long da = target[X_AXIS] - position[X_AXIS],
  596. db = target[Y_AXIS] - position[Y_AXIS],
  597. dc = target[Z_AXIS] - position[Z_AXIS];
  598. /*
  599. SERIAL_ECHOPAIR(" Planner FR:", fr_mm_s);
  600. SERIAL_CHAR(' ');
  601. #if IS_KINEMATIC
  602. SERIAL_ECHOPAIR("A:", a);
  603. SERIAL_ECHOPAIR(" (", da);
  604. SERIAL_ECHOPAIR(") B:", b);
  605. #else
  606. SERIAL_ECHOPAIR("X:", a);
  607. SERIAL_ECHOPAIR(" (", da);
  608. SERIAL_ECHOPAIR(") Y:", b);
  609. #endif
  610. SERIAL_ECHOPAIR(" (", db);
  611. #if ENABLED(DELTA)
  612. SERIAL_ECHOPAIR(") C:", c);
  613. #else
  614. SERIAL_ECHOPAIR(") Z:", c);
  615. #endif
  616. SERIAL_ECHOPAIR(" (", dc);
  617. SERIAL_CHAR(')');
  618. SERIAL_EOL();
  619. //*/
  620. // DRYRUN ignores all temperature constraints and assures that the extruder is instantly satisfied
  621. if (DEBUGGING(DRYRUN)) {
  622. position[E_AXIS] = target[E_AXIS];
  623. #if ENABLED(LIN_ADVANCE)
  624. position_float[E_AXIS] = e;
  625. #endif
  626. }
  627. long de = target[E_AXIS] - position[E_AXIS];
  628. #if ENABLED(LIN_ADVANCE)
  629. float de_float = e - position_float[E_AXIS];
  630. #endif
  631. #if ENABLED(PREVENT_COLD_EXTRUSION)
  632. if (de) {
  633. if (thermalManager.tooColdToExtrude(extruder)) {
  634. position[E_AXIS] = target[E_AXIS]; // Behave as if the move really took place, but ignore E part
  635. de = 0; // no difference
  636. #if ENABLED(LIN_ADVANCE)
  637. position_float[E_AXIS] = e;
  638. de_float = 0;
  639. #endif
  640. SERIAL_ECHO_START();
  641. SERIAL_ECHOLNPGM(MSG_ERR_COLD_EXTRUDE_STOP);
  642. }
  643. #if ENABLED(PREVENT_LENGTHY_EXTRUDE)
  644. if (labs(de) > (int32_t)axis_steps_per_mm[E_AXIS_N] * (EXTRUDE_MAXLENGTH)) { // It's not important to get max. extrusion length in a precision < 1mm, so save some cycles and cast to int
  645. position[E_AXIS] = target[E_AXIS]; // Behave as if the move really took place, but ignore E part
  646. de = 0; // no difference
  647. #if ENABLED(LIN_ADVANCE)
  648. position_float[E_AXIS] = e;
  649. de_float = 0;
  650. #endif
  651. SERIAL_ECHO_START();
  652. SERIAL_ECHOLNPGM(MSG_ERR_LONG_EXTRUDE_STOP);
  653. }
  654. #endif
  655. }
  656. #endif
  657. // Compute direction bit-mask for this block
  658. uint8_t dm = 0;
  659. #if CORE_IS_XY
  660. if (da < 0) SBI(dm, X_HEAD); // Save the real Extruder (head) direction in X Axis
  661. if (db < 0) SBI(dm, Y_HEAD); // ...and Y
  662. if (dc < 0) SBI(dm, Z_AXIS);
  663. if (da + db < 0) SBI(dm, A_AXIS); // Motor A direction
  664. if (CORESIGN(da - db) < 0) SBI(dm, B_AXIS); // Motor B direction
  665. #elif CORE_IS_XZ
  666. if (da < 0) SBI(dm, X_HEAD); // Save the real Extruder (head) direction in X Axis
  667. if (db < 0) SBI(dm, Y_AXIS);
  668. if (dc < 0) SBI(dm, Z_HEAD); // ...and Z
  669. if (da + dc < 0) SBI(dm, A_AXIS); // Motor A direction
  670. if (CORESIGN(da - dc) < 0) SBI(dm, C_AXIS); // Motor C direction
  671. #elif CORE_IS_YZ
  672. if (da < 0) SBI(dm, X_AXIS);
  673. if (db < 0) SBI(dm, Y_HEAD); // Save the real Extruder (head) direction in Y Axis
  674. if (dc < 0) SBI(dm, Z_HEAD); // ...and Z
  675. if (db + dc < 0) SBI(dm, B_AXIS); // Motor B direction
  676. if (CORESIGN(db - dc) < 0) SBI(dm, C_AXIS); // Motor C direction
  677. #else
  678. if (da < 0) SBI(dm, X_AXIS);
  679. if (db < 0) SBI(dm, Y_AXIS);
  680. if (dc < 0) SBI(dm, Z_AXIS);
  681. #endif
  682. if (de < 0) SBI(dm, E_AXIS);
  683. const float esteps_float = de * volumetric_multiplier[extruder] * flow_percentage[extruder] * 0.01;
  684. const int32_t esteps = abs(esteps_float) + 0.5;
  685. // Calculate the buffer head after we push this byte
  686. const uint8_t next_buffer_head = next_block_index(block_buffer_head);
  687. // If the buffer is full: good! That means we are well ahead of the robot.
  688. // Rest here until there is room in the buffer.
  689. while (block_buffer_tail == next_buffer_head) idle();
  690. // Prepare to set up new block
  691. block_t* block = &block_buffer[block_buffer_head];
  692. // Clear all flags, including the "busy" bit
  693. block->flag = 0;
  694. // Set direction bits
  695. block->direction_bits = dm;
  696. // Number of steps for each axis
  697. // See http://www.corexy.com/theory.html
  698. #if CORE_IS_XY
  699. block->steps[A_AXIS] = labs(da + db);
  700. block->steps[B_AXIS] = labs(da - db);
  701. block->steps[Z_AXIS] = labs(dc);
  702. #elif CORE_IS_XZ
  703. block->steps[A_AXIS] = labs(da + dc);
  704. block->steps[Y_AXIS] = labs(db);
  705. block->steps[C_AXIS] = labs(da - dc);
  706. #elif CORE_IS_YZ
  707. block->steps[X_AXIS] = labs(da);
  708. block->steps[B_AXIS] = labs(db + dc);
  709. block->steps[C_AXIS] = labs(db - dc);
  710. #else
  711. // default non-h-bot planning
  712. block->steps[X_AXIS] = labs(da);
  713. block->steps[Y_AXIS] = labs(db);
  714. block->steps[Z_AXIS] = labs(dc);
  715. #endif
  716. block->steps[E_AXIS] = esteps;
  717. block->step_event_count = MAX4(block->steps[X_AXIS], block->steps[Y_AXIS], block->steps[Z_AXIS], esteps);
  718. // Bail if this is a zero-length block
  719. if (block->step_event_count < MIN_STEPS_PER_SEGMENT) return;
  720. // For a mixing extruder, get a magnified step_event_count for each
  721. #if ENABLED(MIXING_EXTRUDER)
  722. for (uint8_t i = 0; i < MIXING_STEPPERS; i++)
  723. block->mix_event_count[i] = mixing_factor[i] * block->step_event_count;
  724. #endif
  725. #if FAN_COUNT > 0
  726. for (uint8_t i = 0; i < FAN_COUNT; i++) block->fan_speed[i] = fanSpeeds[i];
  727. #endif
  728. #if ENABLED(BARICUDA)
  729. block->valve_pressure = baricuda_valve_pressure;
  730. block->e_to_p_pressure = baricuda_e_to_p_pressure;
  731. #endif
  732. block->active_extruder = extruder;
  733. //enable active axes
  734. #if CORE_IS_XY
  735. if (block->steps[A_AXIS] || block->steps[B_AXIS]) {
  736. enable_X();
  737. enable_Y();
  738. }
  739. #if DISABLED(Z_LATE_ENABLE)
  740. if (block->steps[Z_AXIS]) enable_Z();
  741. #endif
  742. #elif CORE_IS_XZ
  743. if (block->steps[A_AXIS] || block->steps[C_AXIS]) {
  744. enable_X();
  745. enable_Z();
  746. }
  747. if (block->steps[Y_AXIS]) enable_Y();
  748. #elif CORE_IS_YZ
  749. if (block->steps[B_AXIS] || block->steps[C_AXIS]) {
  750. enable_Y();
  751. enable_Z();
  752. }
  753. if (block->steps[X_AXIS]) enable_X();
  754. #else
  755. if (block->steps[X_AXIS]) enable_X();
  756. if (block->steps[Y_AXIS]) enable_Y();
  757. #if DISABLED(Z_LATE_ENABLE)
  758. if (block->steps[Z_AXIS]) enable_Z();
  759. #endif
  760. #endif
  761. // Enable extruder(s)
  762. if (esteps) {
  763. #if ENABLED(DISABLE_INACTIVE_EXTRUDER) // Enable only the selected extruder
  764. #define DISABLE_IDLE_E(N) if (!g_uc_extruder_last_move[N]) disable_E##N();
  765. for (uint8_t i = 0; i < EXTRUDERS; i++)
  766. if (g_uc_extruder_last_move[i] > 0) g_uc_extruder_last_move[i]--;
  767. switch(extruder) {
  768. case 0:
  769. enable_E0();
  770. g_uc_extruder_last_move[0] = (BLOCK_BUFFER_SIZE) * 2;
  771. #if ENABLED(DUAL_X_CARRIAGE) || ENABLED(DUAL_NOZZLE_DUPLICATION_MODE)
  772. if (extruder_duplication_enabled) {
  773. enable_E1();
  774. g_uc_extruder_last_move[1] = (BLOCK_BUFFER_SIZE) * 2;
  775. }
  776. #endif
  777. #if EXTRUDERS > 1
  778. DISABLE_IDLE_E(1);
  779. #if EXTRUDERS > 2
  780. DISABLE_IDLE_E(2);
  781. #if EXTRUDERS > 3
  782. DISABLE_IDLE_E(3);
  783. #if EXTRUDERS > 4
  784. DISABLE_IDLE_E(4);
  785. #endif // EXTRUDERS > 4
  786. #endif // EXTRUDERS > 3
  787. #endif // EXTRUDERS > 2
  788. #endif // EXTRUDERS > 1
  789. break;
  790. #if EXTRUDERS > 1
  791. case 1:
  792. enable_E1();
  793. g_uc_extruder_last_move[1] = (BLOCK_BUFFER_SIZE) * 2;
  794. DISABLE_IDLE_E(0);
  795. #if EXTRUDERS > 2
  796. DISABLE_IDLE_E(2);
  797. #if EXTRUDERS > 3
  798. DISABLE_IDLE_E(3);
  799. #if EXTRUDERS > 4
  800. DISABLE_IDLE_E(4);
  801. #endif // EXTRUDERS > 4
  802. #endif // EXTRUDERS > 3
  803. #endif // EXTRUDERS > 2
  804. break;
  805. #if EXTRUDERS > 2
  806. case 2:
  807. enable_E2();
  808. g_uc_extruder_last_move[2] = (BLOCK_BUFFER_SIZE) * 2;
  809. DISABLE_IDLE_E(0);
  810. DISABLE_IDLE_E(1);
  811. #if EXTRUDERS > 3
  812. DISABLE_IDLE_E(3);
  813. #if EXTRUDERS > 4
  814. DISABLE_IDLE_E(4);
  815. #endif
  816. #endif
  817. break;
  818. #if EXTRUDERS > 3
  819. case 3:
  820. enable_E3();
  821. g_uc_extruder_last_move[3] = (BLOCK_BUFFER_SIZE) * 2;
  822. DISABLE_IDLE_E(0);
  823. DISABLE_IDLE_E(1);
  824. DISABLE_IDLE_E(2);
  825. #if EXTRUDERS > 4
  826. DISABLE_IDLE_E(4);
  827. #endif
  828. break;
  829. #if EXTRUDERS > 4
  830. case 4:
  831. enable_E4();
  832. g_uc_extruder_last_move[4] = (BLOCK_BUFFER_SIZE) * 2;
  833. DISABLE_IDLE_E(0);
  834. DISABLE_IDLE_E(1);
  835. DISABLE_IDLE_E(2);
  836. DISABLE_IDLE_E(3);
  837. break;
  838. #endif // EXTRUDERS > 4
  839. #endif // EXTRUDERS > 3
  840. #endif // EXTRUDERS > 2
  841. #endif // EXTRUDERS > 1
  842. }
  843. #else
  844. enable_E0();
  845. enable_E1();
  846. enable_E2();
  847. enable_E3();
  848. enable_E4();
  849. #endif
  850. }
  851. if (esteps)
  852. NOLESS(fr_mm_s, min_feedrate_mm_s);
  853. else
  854. NOLESS(fr_mm_s, min_travel_feedrate_mm_s);
  855. /**
  856. * This part of the code calculates the total length of the movement.
  857. * For cartesian bots, the X_AXIS is the real X movement and same for Y_AXIS.
  858. * But for corexy bots, that is not true. The "X_AXIS" and "Y_AXIS" motors (that should be named to A_AXIS
  859. * and B_AXIS) cannot be used for X and Y length, because A=X+Y and B=X-Y.
  860. * So we need to create other 2 "AXIS", named X_HEAD and Y_HEAD, meaning the real displacement of the Head.
  861. * Having the real displacement of the head, we can calculate the total movement length and apply the desired speed.
  862. */
  863. #if IS_CORE
  864. float delta_mm[Z_HEAD + 1];
  865. #if CORE_IS_XY
  866. delta_mm[X_HEAD] = da * steps_to_mm[A_AXIS];
  867. delta_mm[Y_HEAD] = db * steps_to_mm[B_AXIS];
  868. delta_mm[Z_AXIS] = dc * steps_to_mm[Z_AXIS];
  869. delta_mm[A_AXIS] = (da + db) * steps_to_mm[A_AXIS];
  870. delta_mm[B_AXIS] = CORESIGN(da - db) * steps_to_mm[B_AXIS];
  871. #elif CORE_IS_XZ
  872. delta_mm[X_HEAD] = da * steps_to_mm[A_AXIS];
  873. delta_mm[Y_AXIS] = db * steps_to_mm[Y_AXIS];
  874. delta_mm[Z_HEAD] = dc * steps_to_mm[C_AXIS];
  875. delta_mm[A_AXIS] = (da + dc) * steps_to_mm[A_AXIS];
  876. delta_mm[C_AXIS] = CORESIGN(da - dc) * steps_to_mm[C_AXIS];
  877. #elif CORE_IS_YZ
  878. delta_mm[X_AXIS] = da * steps_to_mm[X_AXIS];
  879. delta_mm[Y_HEAD] = db * steps_to_mm[B_AXIS];
  880. delta_mm[Z_HEAD] = dc * steps_to_mm[C_AXIS];
  881. delta_mm[B_AXIS] = (db + dc) * steps_to_mm[B_AXIS];
  882. delta_mm[C_AXIS] = CORESIGN(db - dc) * steps_to_mm[C_AXIS];
  883. #endif
  884. #else
  885. float delta_mm[XYZE];
  886. delta_mm[X_AXIS] = da * steps_to_mm[X_AXIS];
  887. delta_mm[Y_AXIS] = db * steps_to_mm[Y_AXIS];
  888. delta_mm[Z_AXIS] = dc * steps_to_mm[Z_AXIS];
  889. #endif
  890. delta_mm[E_AXIS] = esteps_float * steps_to_mm[E_AXIS_N];
  891. if (block->steps[X_AXIS] < MIN_STEPS_PER_SEGMENT && block->steps[Y_AXIS] < MIN_STEPS_PER_SEGMENT && block->steps[Z_AXIS] < MIN_STEPS_PER_SEGMENT) {
  892. block->millimeters = FABS(delta_mm[E_AXIS]);
  893. }
  894. else {
  895. block->millimeters = SQRT(
  896. #if CORE_IS_XY
  897. sq(delta_mm[X_HEAD]) + sq(delta_mm[Y_HEAD]) + sq(delta_mm[Z_AXIS])
  898. #elif CORE_IS_XZ
  899. sq(delta_mm[X_HEAD]) + sq(delta_mm[Y_AXIS]) + sq(delta_mm[Z_HEAD])
  900. #elif CORE_IS_YZ
  901. sq(delta_mm[X_AXIS]) + sq(delta_mm[Y_HEAD]) + sq(delta_mm[Z_HEAD])
  902. #else
  903. sq(delta_mm[X_AXIS]) + sq(delta_mm[Y_AXIS]) + sq(delta_mm[Z_AXIS])
  904. #endif
  905. );
  906. }
  907. float inverse_millimeters = 1.0 / block->millimeters; // Inverse millimeters to remove multiple divides
  908. // Calculate moves/second for this move. No divide by zero due to previous checks.
  909. float inverse_mm_s = fr_mm_s * inverse_millimeters;
  910. const uint8_t moves_queued = movesplanned();
  911. // Slow down when the buffer starts to empty, rather than wait at the corner for a buffer refill
  912. #if ENABLED(SLOWDOWN) || ENABLED(ULTRA_LCD) || defined(XY_FREQUENCY_LIMIT)
  913. // Segment time im micro seconds
  914. unsigned long segment_time = LROUND(1000000.0 / inverse_mm_s);
  915. #endif
  916. #if ENABLED(SLOWDOWN)
  917. if (WITHIN(moves_queued, 2, (BLOCK_BUFFER_SIZE) / 2 - 1)) {
  918. if (segment_time < min_segment_time) {
  919. // buffer is draining, add extra time. The amount of time added increases if the buffer is still emptied more.
  920. inverse_mm_s = 1000000.0 / (segment_time + LROUND(2 * (min_segment_time - segment_time) / moves_queued));
  921. #if defined(XY_FREQUENCY_LIMIT) || ENABLED(ULTRA_LCD)
  922. segment_time = LROUND(1000000.0 / inverse_mm_s);
  923. #endif
  924. }
  925. }
  926. #endif
  927. #if ENABLED(ULTRA_LCD)
  928. CRITICAL_SECTION_START
  929. block_buffer_runtime_us += segment_time;
  930. CRITICAL_SECTION_END
  931. #endif
  932. block->nominal_speed = block->millimeters * inverse_mm_s; // (mm/sec) Always > 0
  933. block->nominal_rate = CEIL(block->step_event_count * inverse_mm_s); // (step/sec) Always > 0
  934. #if ENABLED(FILAMENT_WIDTH_SENSOR)
  935. static float filwidth_e_count = 0, filwidth_delay_dist = 0;
  936. //FMM update ring buffer used for delay with filament measurements
  937. if (extruder == FILAMENT_SENSOR_EXTRUDER_NUM && filwidth_delay_index[1] >= 0) { //only for extruder with filament sensor and if ring buffer is initialized
  938. const int MMD_CM = MAX_MEASUREMENT_DELAY + 1, MMD_MM = MMD_CM * 10;
  939. // increment counters with next move in e axis
  940. filwidth_e_count += delta_mm[E_AXIS];
  941. filwidth_delay_dist += delta_mm[E_AXIS];
  942. // Only get new measurements on forward E movement
  943. if (filwidth_e_count > 0.0001) {
  944. // Loop the delay distance counter (modulus by the mm length)
  945. while (filwidth_delay_dist >= MMD_MM) filwidth_delay_dist -= MMD_MM;
  946. // Convert into an index into the measurement array
  947. filwidth_delay_index[0] = int8_t(filwidth_delay_dist * 0.1);
  948. // If the index has changed (must have gone forward)...
  949. if (filwidth_delay_index[0] != filwidth_delay_index[1]) {
  950. filwidth_e_count = 0; // Reset the E movement counter
  951. const uint8_t meas_sample = thermalManager.widthFil_to_size_ratio() - 100; // Subtract 100 to reduce magnitude - to store in a signed char
  952. do {
  953. filwidth_delay_index[1] = (filwidth_delay_index[1] + 1) % MMD_CM; // The next unused slot
  954. measurement_delay[filwidth_delay_index[1]] = meas_sample; // Store the measurement
  955. } while (filwidth_delay_index[0] != filwidth_delay_index[1]); // More slots to fill?
  956. }
  957. }
  958. }
  959. #endif
  960. // Calculate and limit speed in mm/sec for each axis
  961. float current_speed[NUM_AXIS], speed_factor = 1.0; // factor <1 decreases speed
  962. LOOP_XYZE(i) {
  963. const float cs = FABS(current_speed[i] = delta_mm[i] * inverse_mm_s);
  964. #if ENABLED(DISTINCT_E_FACTORS)
  965. if (i == E_AXIS) i += extruder;
  966. #endif
  967. if (cs > max_feedrate_mm_s[i]) NOMORE(speed_factor, max_feedrate_mm_s[i] / cs);
  968. }
  969. // Max segment time in µs.
  970. #ifdef XY_FREQUENCY_LIMIT
  971. // Check and limit the xy direction change frequency
  972. const unsigned char direction_change = block->direction_bits ^ old_direction_bits;
  973. old_direction_bits = block->direction_bits;
  974. segment_time = LROUND((float)segment_time / speed_factor);
  975. long xs0 = axis_segment_time[X_AXIS][0],
  976. xs1 = axis_segment_time[X_AXIS][1],
  977. xs2 = axis_segment_time[X_AXIS][2],
  978. ys0 = axis_segment_time[Y_AXIS][0],
  979. ys1 = axis_segment_time[Y_AXIS][1],
  980. ys2 = axis_segment_time[Y_AXIS][2];
  981. if (TEST(direction_change, X_AXIS)) {
  982. xs2 = axis_segment_time[X_AXIS][2] = xs1;
  983. xs1 = axis_segment_time[X_AXIS][1] = xs0;
  984. xs0 = 0;
  985. }
  986. xs0 = axis_segment_time[X_AXIS][0] = xs0 + segment_time;
  987. if (TEST(direction_change, Y_AXIS)) {
  988. ys2 = axis_segment_time[Y_AXIS][2] = axis_segment_time[Y_AXIS][1];
  989. ys1 = axis_segment_time[Y_AXIS][1] = axis_segment_time[Y_AXIS][0];
  990. ys0 = 0;
  991. }
  992. ys0 = axis_segment_time[Y_AXIS][0] = ys0 + segment_time;
  993. const long max_x_segment_time = MAX3(xs0, xs1, xs2),
  994. max_y_segment_time = MAX3(ys0, ys1, ys2),
  995. min_xy_segment_time = min(max_x_segment_time, max_y_segment_time);
  996. if (min_xy_segment_time < MAX_FREQ_TIME) {
  997. const float low_sf = speed_factor * min_xy_segment_time / (MAX_FREQ_TIME);
  998. NOMORE(speed_factor, low_sf);
  999. }
  1000. #endif // XY_FREQUENCY_LIMIT
  1001. // Correct the speed
  1002. if (speed_factor < 1.0) {
  1003. LOOP_XYZE(i) current_speed[i] *= speed_factor;
  1004. block->nominal_speed *= speed_factor;
  1005. block->nominal_rate *= speed_factor;
  1006. }
  1007. // Compute and limit the acceleration rate for the trapezoid generator.
  1008. const float steps_per_mm = block->step_event_count * inverse_millimeters;
  1009. uint32_t accel;
  1010. if (!block->steps[X_AXIS] && !block->steps[Y_AXIS] && !block->steps[Z_AXIS]) {
  1011. // convert to: acceleration steps/sec^2
  1012. accel = CEIL(retract_acceleration * steps_per_mm);
  1013. }
  1014. else {
  1015. #define LIMIT_ACCEL_LONG(AXIS,INDX) do{ \
  1016. if (block->steps[AXIS] && max_acceleration_steps_per_s2[AXIS+INDX] < accel) { \
  1017. const uint32_t comp = max_acceleration_steps_per_s2[AXIS+INDX] * block->step_event_count; \
  1018. if (accel * block->steps[AXIS] > comp) accel = comp / block->steps[AXIS]; \
  1019. } \
  1020. }while(0)
  1021. #define LIMIT_ACCEL_FLOAT(AXIS,INDX) do{ \
  1022. if (block->steps[AXIS] && max_acceleration_steps_per_s2[AXIS+INDX] < accel) { \
  1023. const float comp = (float)max_acceleration_steps_per_s2[AXIS+INDX] * (float)block->step_event_count; \
  1024. if ((float)accel * (float)block->steps[AXIS] > comp) accel = comp / (float)block->steps[AXIS]; \
  1025. } \
  1026. }while(0)
  1027. // Start with print or travel acceleration
  1028. accel = CEIL((esteps ? acceleration : travel_acceleration) * steps_per_mm);
  1029. #if ENABLED(DISTINCT_E_FACTORS)
  1030. #define ACCEL_IDX extruder
  1031. #else
  1032. #define ACCEL_IDX 0
  1033. #endif
  1034. // Limit acceleration per axis
  1035. if (block->step_event_count <= cutoff_long) {
  1036. LIMIT_ACCEL_LONG(X_AXIS, 0);
  1037. LIMIT_ACCEL_LONG(Y_AXIS, 0);
  1038. LIMIT_ACCEL_LONG(Z_AXIS, 0);
  1039. LIMIT_ACCEL_LONG(E_AXIS, ACCEL_IDX);
  1040. }
  1041. else {
  1042. LIMIT_ACCEL_FLOAT(X_AXIS, 0);
  1043. LIMIT_ACCEL_FLOAT(Y_AXIS, 0);
  1044. LIMIT_ACCEL_FLOAT(Z_AXIS, 0);
  1045. LIMIT_ACCEL_FLOAT(E_AXIS, ACCEL_IDX);
  1046. }
  1047. }
  1048. block->acceleration_steps_per_s2 = accel;
  1049. block->acceleration = accel / steps_per_mm;
  1050. block->acceleration_rate = (long)(accel * 16777216.0 / ((F_CPU) * 0.125)); // * 8.388608
  1051. // Initial limit on the segment entry velocity
  1052. float vmax_junction;
  1053. #if 0 // Use old jerk for now
  1054. float junction_deviation = 0.1;
  1055. // Compute path unit vector
  1056. double unit_vec[XYZ] = {
  1057. delta_mm[X_AXIS] * inverse_millimeters,
  1058. delta_mm[Y_AXIS] * inverse_millimeters,
  1059. delta_mm[Z_AXIS] * inverse_millimeters
  1060. };
  1061. /*
  1062. Compute maximum allowable entry speed at junction by centripetal acceleration approximation.
  1063. Let a circle be tangent to both previous and current path line segments, where the junction
  1064. deviation is defined as the distance from the junction to the closest edge of the circle,
  1065. collinear with the circle center.
  1066. The circular segment joining the two paths represents the path of centripetal acceleration.
  1067. Solve for max velocity based on max acceleration about the radius of the circle, defined
  1068. indirectly by junction deviation.
  1069. This may be also viewed as path width or max_jerk in the previous grbl version. This approach
  1070. does not actually deviate from path, but used as a robust way to compute cornering speeds, as
  1071. it takes into account the nonlinearities of both the junction angle and junction velocity.
  1072. */
  1073. vmax_junction = MINIMUM_PLANNER_SPEED; // Set default max junction speed
  1074. // Skip first block or when previous_nominal_speed is used as a flag for homing and offset cycles.
  1075. if (block_buffer_head != block_buffer_tail && previous_nominal_speed > 0.0) {
  1076. // Compute cosine of angle between previous and current path. (prev_unit_vec is negative)
  1077. // NOTE: Max junction velocity is computed without sin() or acos() by trig half angle identity.
  1078. float cos_theta = - previous_unit_vec[X_AXIS] * unit_vec[X_AXIS]
  1079. - previous_unit_vec[Y_AXIS] * unit_vec[Y_AXIS]
  1080. - previous_unit_vec[Z_AXIS] * unit_vec[Z_AXIS] ;
  1081. // Skip and use default max junction speed for 0 degree acute junction.
  1082. if (cos_theta < 0.95) {
  1083. vmax_junction = min(previous_nominal_speed, block->nominal_speed);
  1084. // Skip and avoid divide by zero for straight junctions at 180 degrees. Limit to min() of nominal speeds.
  1085. if (cos_theta > -0.95) {
  1086. // Compute maximum junction velocity based on maximum acceleration and junction deviation
  1087. float sin_theta_d2 = SQRT(0.5 * (1.0 - cos_theta)); // Trig half angle identity. Always positive.
  1088. NOMORE(vmax_junction, SQRT(block->acceleration * junction_deviation * sin_theta_d2 / (1.0 - sin_theta_d2)));
  1089. }
  1090. }
  1091. }
  1092. #endif
  1093. /**
  1094. * Adapted from Průša MKS firmware
  1095. * https://github.com/prusa3d/Prusa-Firmware
  1096. *
  1097. * Start with a safe speed (from which the machine may halt to stop immediately).
  1098. */
  1099. // Exit speed limited by a jerk to full halt of a previous last segment
  1100. static float previous_safe_speed;
  1101. float safe_speed = block->nominal_speed;
  1102. uint8_t limited = 0;
  1103. LOOP_XYZE(i) {
  1104. const float jerk = FABS(current_speed[i]), maxj = max_jerk[i];
  1105. if (jerk > maxj) {
  1106. if (limited) {
  1107. const float mjerk = maxj * block->nominal_speed;
  1108. if (jerk * safe_speed > mjerk) safe_speed = mjerk / jerk;
  1109. }
  1110. else {
  1111. ++limited;
  1112. safe_speed = maxj;
  1113. }
  1114. }
  1115. }
  1116. if (moves_queued > 1 && previous_nominal_speed > 0.0001) {
  1117. // Estimate a maximum velocity allowed at a joint of two successive segments.
  1118. // If this maximum velocity allowed is lower than the minimum of the entry / exit safe velocities,
  1119. // then the machine is not coasting anymore and the safe entry / exit velocities shall be used.
  1120. // The junction velocity will be shared between successive segments. Limit the junction velocity to their minimum.
  1121. bool prev_speed_larger = previous_nominal_speed > block->nominal_speed;
  1122. float smaller_speed_factor = prev_speed_larger ? (block->nominal_speed / previous_nominal_speed) : (previous_nominal_speed / block->nominal_speed);
  1123. // Pick the smaller of the nominal speeds. Higher speed shall not be achieved at the junction during coasting.
  1124. vmax_junction = prev_speed_larger ? block->nominal_speed : previous_nominal_speed;
  1125. // Factor to multiply the previous / current nominal velocities to get componentwise limited velocities.
  1126. float v_factor = 1.f;
  1127. limited = 0;
  1128. // Now limit the jerk in all axes.
  1129. LOOP_XYZE(axis) {
  1130. // Limit an axis. We have to differentiate: coasting, reversal of an axis, full stop.
  1131. float v_exit = previous_speed[axis], v_entry = current_speed[axis];
  1132. if (prev_speed_larger) v_exit *= smaller_speed_factor;
  1133. if (limited) {
  1134. v_exit *= v_factor;
  1135. v_entry *= v_factor;
  1136. }
  1137. // Calculate jerk depending on whether the axis is coasting in the same direction or reversing.
  1138. const float jerk = (v_exit > v_entry)
  1139. ? // coasting axis reversal
  1140. ( (v_entry > 0.f || v_exit < 0.f) ? (v_exit - v_entry) : max(v_exit, -v_entry) )
  1141. : // v_exit <= v_entry coasting axis reversal
  1142. ( (v_entry < 0.f || v_exit > 0.f) ? (v_entry - v_exit) : max(-v_exit, v_entry) );
  1143. if (jerk > max_jerk[axis]) {
  1144. v_factor *= max_jerk[axis] / jerk;
  1145. ++limited;
  1146. }
  1147. }
  1148. if (limited) vmax_junction *= v_factor;
  1149. // Now the transition velocity is known, which maximizes the shared exit / entry velocity while
  1150. // respecting the jerk factors, it may be possible, that applying separate safe exit / entry velocities will achieve faster prints.
  1151. const float vmax_junction_threshold = vmax_junction * 0.99f;
  1152. if (previous_safe_speed > vmax_junction_threshold && safe_speed > vmax_junction_threshold) {
  1153. // Not coasting. The machine will stop and start the movements anyway,
  1154. // better to start the segment from start.
  1155. SBI(block->flag, BLOCK_BIT_START_FROM_FULL_HALT);
  1156. vmax_junction = safe_speed;
  1157. }
  1158. }
  1159. else {
  1160. SBI(block->flag, BLOCK_BIT_START_FROM_FULL_HALT);
  1161. vmax_junction = safe_speed;
  1162. }
  1163. // Max entry speed of this block equals the max exit speed of the previous block.
  1164. block->max_entry_speed = vmax_junction;
  1165. // Initialize block entry speed. Compute based on deceleration to user-defined MINIMUM_PLANNER_SPEED.
  1166. const float v_allowable = max_allowable_speed(-block->acceleration, MINIMUM_PLANNER_SPEED, block->millimeters);
  1167. block->entry_speed = min(vmax_junction, v_allowable);
  1168. // Initialize planner efficiency flags
  1169. // Set flag if block will always reach maximum junction speed regardless of entry/exit speeds.
  1170. // If a block can de/ac-celerate from nominal speed to zero within the length of the block, then
  1171. // the current block and next block junction speeds are guaranteed to always be at their maximum
  1172. // junction speeds in deceleration and acceleration, respectively. This is due to how the current
  1173. // block nominal speed limits both the current and next maximum junction speeds. Hence, in both
  1174. // the reverse and forward planners, the corresponding block junction speed will always be at the
  1175. // the maximum junction speed and may always be ignored for any speed reduction checks.
  1176. block->flag |= BLOCK_FLAG_RECALCULATE | (block->nominal_speed <= v_allowable ? BLOCK_FLAG_NOMINAL_LENGTH : 0);
  1177. // Update previous path unit_vector and nominal speed
  1178. COPY(previous_speed, current_speed);
  1179. previous_nominal_speed = block->nominal_speed;
  1180. previous_safe_speed = safe_speed;
  1181. #if ENABLED(LIN_ADVANCE)
  1182. //
  1183. // Use LIN_ADVANCE for blocks if all these are true:
  1184. //
  1185. // esteps : We have E steps todo (a printing move)
  1186. //
  1187. // block->steps[X_AXIS] || block->steps[Y_AXIS] : We have a movement in XY direction (i.e., not retract / prime).
  1188. //
  1189. // extruder_advance_k : There is an advance factor set.
  1190. //
  1191. // block->steps[E_AXIS] != block->step_event_count : A problem occurs if the move before a retract is too small.
  1192. // In that case, the retract and move will be executed together.
  1193. // This leads to too many advance steps due to a huge e_acceleration.
  1194. // The math is good, but we must avoid retract moves with advance!
  1195. // de_float > 0.0 : Extruder is running forward (e.g., for "Wipe while retracting" (Slic3r) or "Combing" (Cura) moves)
  1196. //
  1197. block->use_advance_lead = esteps
  1198. && (block->steps[X_AXIS] || block->steps[Y_AXIS])
  1199. && extruder_advance_k
  1200. && (uint32_t)esteps != block->step_event_count
  1201. && de_float > 0.0;
  1202. if (block->use_advance_lead)
  1203. block->abs_adv_steps_multiplier8 = LROUND(
  1204. extruder_advance_k
  1205. * (UNEAR_ZERO(advance_ed_ratio) ? de_float / mm_D_float : advance_ed_ratio) // Use the fixed ratio, if set
  1206. * (block->nominal_speed / (float)block->nominal_rate)
  1207. * axis_steps_per_mm[E_AXIS_N] * 256.0
  1208. );
  1209. #endif // LIN_ADVANCE
  1210. calculate_trapezoid_for_block(block, block->entry_speed / block->nominal_speed, safe_speed / block->nominal_speed);
  1211. // Move buffer head
  1212. block_buffer_head = next_buffer_head;
  1213. // Update the position (only when a move was queued)
  1214. COPY(position, target);
  1215. #if ENABLED(LIN_ADVANCE)
  1216. position_float[X_AXIS] = a;
  1217. position_float[Y_AXIS] = b;
  1218. position_float[Z_AXIS] = c;
  1219. position_float[E_AXIS] = e;
  1220. #endif
  1221. recalculate();
  1222. stepper.wake_up();
  1223. } // buffer_line()
  1224. /**
  1225. * Directly set the planner XYZ position (and stepper positions)
  1226. * converting mm (or angles for SCARA) into steps.
  1227. *
  1228. * On CORE machines stepper ABC will be translated from the given XYZ.
  1229. */
  1230. void Planner::_set_position_mm(const float &a, const float &b, const float &c, const float &e) {
  1231. #if ENABLED(DISTINCT_E_FACTORS)
  1232. #define _EINDEX (E_AXIS + active_extruder)
  1233. last_extruder = active_extruder;
  1234. #else
  1235. #define _EINDEX E_AXIS
  1236. #endif
  1237. long na = position[X_AXIS] = LROUND(a * axis_steps_per_mm[X_AXIS]),
  1238. nb = position[Y_AXIS] = LROUND(b * axis_steps_per_mm[Y_AXIS]),
  1239. nc = position[Z_AXIS] = LROUND(c * axis_steps_per_mm[Z_AXIS]),
  1240. ne = position[E_AXIS] = LROUND(e * axis_steps_per_mm[_EINDEX]);
  1241. #if ENABLED(LIN_ADVANCE)
  1242. position_float[X_AXIS] = a;
  1243. position_float[Y_AXIS] = b;
  1244. position_float[Z_AXIS] = c;
  1245. position_float[E_AXIS] = e;
  1246. #endif
  1247. stepper.set_position(na, nb, nc, ne);
  1248. previous_nominal_speed = 0.0; // Resets planner junction speeds. Assumes start from rest.
  1249. ZERO(previous_speed);
  1250. }
  1251. void Planner::set_position_mm_kinematic(const float position[NUM_AXIS]) {
  1252. #if PLANNER_LEVELING
  1253. float lpos[XYZ] = { position[X_AXIS], position[Y_AXIS], position[Z_AXIS] };
  1254. apply_leveling(lpos);
  1255. #else
  1256. const float * const lpos = position;
  1257. #endif
  1258. #if IS_KINEMATIC
  1259. inverse_kinematics(lpos);
  1260. _set_position_mm(delta[A_AXIS], delta[B_AXIS], delta[C_AXIS], position[E_AXIS]);
  1261. #else
  1262. _set_position_mm(lpos[X_AXIS], lpos[Y_AXIS], lpos[Z_AXIS], position[E_AXIS]);
  1263. #endif
  1264. }
  1265. /**
  1266. * Sync from the stepper positions. (e.g., after an interrupted move)
  1267. */
  1268. void Planner::sync_from_steppers() {
  1269. LOOP_XYZE(i) {
  1270. position[i] = stepper.position((AxisEnum)i);
  1271. #if ENABLED(LIN_ADVANCE)
  1272. position_float[i] = position[i] * steps_to_mm[i
  1273. #if ENABLED(DISTINCT_E_FACTORS)
  1274. + (i == E_AXIS ? active_extruder : 0)
  1275. #endif
  1276. ];
  1277. #endif
  1278. }
  1279. }
  1280. /**
  1281. * Setters for planner position (also setting stepper position).
  1282. */
  1283. void Planner::set_position_mm(const AxisEnum axis, const float &v) {
  1284. #if ENABLED(DISTINCT_E_FACTORS)
  1285. const uint8_t axis_index = axis + (axis == E_AXIS ? active_extruder : 0);
  1286. last_extruder = active_extruder;
  1287. #else
  1288. const uint8_t axis_index = axis;
  1289. #endif
  1290. position[axis] = LROUND(v * axis_steps_per_mm[axis_index]);
  1291. #if ENABLED(LIN_ADVANCE)
  1292. position_float[axis] = v;
  1293. #endif
  1294. stepper.set_position(axis, v);
  1295. previous_speed[axis] = 0.0;
  1296. }
  1297. // Recalculate the steps/s^2 acceleration rates, based on the mm/s^2
  1298. void Planner::reset_acceleration_rates() {
  1299. #if ENABLED(DISTINCT_E_FACTORS)
  1300. #define HIGHEST_CONDITION (i < E_AXIS || i == E_AXIS + active_extruder)
  1301. #else
  1302. #define HIGHEST_CONDITION true
  1303. #endif
  1304. uint32_t highest_rate = 1;
  1305. LOOP_XYZE_N(i) {
  1306. max_acceleration_steps_per_s2[i] = max_acceleration_mm_per_s2[i] * axis_steps_per_mm[i];
  1307. if (HIGHEST_CONDITION) NOLESS(highest_rate, max_acceleration_steps_per_s2[i]);
  1308. }
  1309. cutoff_long = 4294967295UL / highest_rate;
  1310. }
  1311. // Recalculate position, steps_to_mm if axis_steps_per_mm changes!
  1312. void Planner::refresh_positioning() {
  1313. LOOP_XYZE_N(i) steps_to_mm[i] = 1.0 / axis_steps_per_mm[i];
  1314. set_position_mm_kinematic(current_position);
  1315. reset_acceleration_rates();
  1316. }
  1317. #if ENABLED(AUTOTEMP)
  1318. void Planner::autotemp_M104_M109() {
  1319. autotemp_enabled = parser.seen('F');
  1320. if (autotemp_enabled) autotemp_factor = parser.value_celsius_diff();
  1321. if (parser.seen('S')) autotemp_min = parser.value_celsius();
  1322. if (parser.seen('B')) autotemp_max = parser.value_celsius();
  1323. }
  1324. #endif