My Marlin configs for Fabrikator Mini and CTC i3 Pro B
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

planner.cpp 42KB

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