2011-01-14 16:45:18 +01:00
|
|
|
/*
|
2011-02-11 00:34:53 +01:00
|
|
|
planner.h - buffers movement commands and manages the acceleration profile plan
|
2011-01-14 16:45:18 +01:00
|
|
|
Part of Grbl
|
|
|
|
|
2013-12-31 06:02:05 +01:00
|
|
|
Copyright (c) 2011-2014 Sungeun K. Jeon
|
2011-01-14 16:45:18 +01:00
|
|
|
Copyright (c) 2009-2011 Simen Svale Skogsrud
|
|
|
|
|
|
|
|
Grbl is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
Grbl is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with Grbl. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2011-02-11 00:34:53 +01:00
|
|
|
#ifndef planner_h
|
|
|
|
#define planner_h
|
2014-01-11 04:22:10 +01:00
|
|
|
|
|
|
|
#include "system.h"
|
2013-10-30 02:10:39 +01:00
|
|
|
|
New startup script setting. New dry run, check gcode switches. New system state variable. Lots of reorganizing.
(All v0.8 features installed. Still likely buggy, but now thourough
testing will need to start to squash them all. As soon as we're done,
this will be pushed to master and v0.9 development will be started.
Please report ANY issues to us so we can get this rolled out ASAP.)
- User startup script! A user can now save one (up to 5 as compile-time
option) block of g-code in EEPROM memory. This will be run everytime
Grbl resets. Mainly to be used as a way to set your preferences, like
G21, G54, etc.
- New dry run and check g-code switches. Dry run moves ALL motions at
rapids rate ignoring spindle, coolant, and dwell commands. For rapid
physical proofing of your code. The check g-code switch ignores all
motion and provides the user a way to check if there are any errors in
their program that Grbl may not like.
- Program restart! (sort of). Program restart is typically an advanced
feature that allows users to restart a program mid-stream. The check
g-code switch can perform this feature by enabling the switch at the
start of the program, and disabling it at the desired point with some
minimal changes.
- New system state variable. This state variable tracks all of the
different state processes that Grbl performs, i.e. cycle start, feed
hold, homing, etc. This is mainly for making managing of these task
easier and more clear.
- Position lost state variable. Only when homing is enabled, Grbl will
refuse to move until homing is completed and position is known. This is
mainly for safety. Otherwise, it will let users fend for themselves.
- Moved the default settings defines into config.h. The plan is to
eventually create a set of config.h's for particular as-built machines
to help users from doing it themselves.
- Moved around misc defines into .h files. And lots of other little
things.
2012-11-03 18:32:23 +01:00
|
|
|
// The number of linear motions that can be in the plan at any give time
|
2012-11-09 03:23:47 +01:00
|
|
|
#ifndef BLOCK_BUFFER_SIZE
|
2014-02-07 00:19:30 +01:00
|
|
|
#ifdef USE_LINE_NUMBERS
|
|
|
|
#define BLOCK_BUFFER_SIZE 16
|
|
|
|
#else
|
|
|
|
#define BLOCK_BUFFER_SIZE 18
|
|
|
|
#endif
|
2012-11-09 03:23:47 +01:00
|
|
|
#endif
|
2011-01-14 16:45:18 +01:00
|
|
|
|
2013-12-07 16:40:25 +01:00
|
|
|
// This struct stores a linear movement of a g-code block motion with its critical "nominal" values
|
|
|
|
// are as specified in the source g-code.
|
2011-01-25 22:51:37 +01:00
|
|
|
typedef struct {
|
2011-01-15 00:27:08 +01:00
|
|
|
// Fields used by the bresenham algorithm for tracing the line
|
2013-12-07 16:40:25 +01:00
|
|
|
// NOTE: Used by stepper algorithm to execute the block correctly. Do not alter these values.
|
|
|
|
uint8_t direction_bits; // The direction bit set for this block (refers to *_DIRECTION_BIT in config.h)
|
2013-12-30 04:34:51 +01:00
|
|
|
uint32_t steps[N_AXIS]; // Step count along each axis
|
|
|
|
uint32_t step_event_count; // The maximum step axis count and number of steps required to complete this block.
|
2011-12-09 02:47:48 +01:00
|
|
|
|
2011-01-15 00:27:08 +01:00
|
|
|
// Fields used by the motion planner to manage acceleration
|
2013-12-07 16:40:25 +01:00
|
|
|
float entry_speed_sqr; // The current planned entry speed at block junction in (mm/min)^2
|
|
|
|
float max_entry_speed_sqr; // Maximum allowable entry speed based on the minimum of junction limit and
|
|
|
|
// neighboring nominal speeds with overrides in (mm/min)^2
|
|
|
|
float max_junction_speed_sqr; // Junction entry speed limit based on direction vectors in (mm/min)^2
|
|
|
|
float nominal_speed_sqr; // Axis-limit adjusted nominal speed for this block in (mm/min)^2
|
|
|
|
float acceleration; // Axis-limit adjusted line acceleration in (mm/min^2)
|
|
|
|
float millimeters; // The remaining distance for this block to be executed in (mm)
|
|
|
|
// uint8_t max_override; // Maximum override value based on axis speed limits
|
2014-02-07 00:19:30 +01:00
|
|
|
#ifdef USE_LINE_NUMBERS
|
2014-02-07 00:10:27 +01:00
|
|
|
uint32_t line_number;
|
2014-02-07 00:19:30 +01:00
|
|
|
#endif
|
2013-10-30 02:10:39 +01:00
|
|
|
} plan_block_t;
|
2013-11-23 01:35:58 +01:00
|
|
|
|
2011-01-14 16:45:18 +01:00
|
|
|
|
2013-12-30 04:34:51 +01:00
|
|
|
// Initialize and reset the motion plan subsystem
|
|
|
|
void plan_reset();
|
2011-01-14 17:13:33 +01:00
|
|
|
|
2013-10-30 02:10:39 +01:00
|
|
|
// Add a new linear movement to the buffer. target[N_AXIS] is the signed, absolute target position
|
|
|
|
// in millimeters. Feed rate specifies the speed of the motion. If feed rate is inverted, the feed
|
2011-02-11 00:34:53 +01:00
|
|
|
// rate is taken to mean "frequency" and would complete the operation in 1/feed_rate minutes.
|
2014-02-07 00:10:27 +01:00
|
|
|
void plan_buffer_line(float *target, float feed_rate, uint8_t invert_feed_rate, uint32_t line_number);
|
2011-01-14 16:45:18 +01:00
|
|
|
|
2011-02-11 00:44:18 +01:00
|
|
|
// Called when the current block is no longer needed. Discards the block and makes the memory
|
2011-02-06 23:52:12 +01:00
|
|
|
// availible for new blocks.
|
2011-02-17 23:59:10 +01:00
|
|
|
void plan_discard_current_block();
|
2011-02-06 23:52:12 +01:00
|
|
|
|
|
|
|
// Gets the current block. Returns NULL if buffer empty
|
2013-10-30 02:10:39 +01:00
|
|
|
plan_block_t *plan_get_current_block();
|
|
|
|
|
2013-11-23 01:35:58 +01:00
|
|
|
// Called periodically by step segment buffer. Mostly used internally by planner.
|
2013-10-30 02:10:39 +01:00
|
|
|
uint8_t plan_next_block_index(uint8_t block_index);
|
|
|
|
|
2013-11-23 01:35:58 +01:00
|
|
|
// Called by step segment buffer when computing executing block velocity profile.
|
|
|
|
float plan_get_exec_block_exit_speed();
|
2011-02-06 23:52:12 +01:00
|
|
|
|
2012-01-29 04:41:08 +01:00
|
|
|
// Reset the planner position vector (in steps)
|
2013-10-30 02:10:39 +01:00
|
|
|
void plan_sync_position();
|
2012-01-29 04:41:08 +01:00
|
|
|
|
2011-12-09 02:47:48 +01:00
|
|
|
// Reinitialize plan with a partially completed block
|
Reinstated feed holds into new stepper algorithm and planner. Rough draft, but working.
- Reinstated the feed hold feature with the new stepper algorithm and
new optimized planner. It works, but will be re-factored a bit soon to
clean up the code.
- At this point, feedrate overrides may need to be installed in the
v1.0 version of grbl, while this version will likely be pushed to the
edge branch soon and pushed to master after the bugs have been squashed.
- Measured the overall performance of the new planner and stepper
algorithm on an oscilloscope. The new planner is about 4x faster than
before, where it is completing a plan in around 1ms. The stepper
algorithm itself is minutely faster, as it is a little lighter. The
trade-off in the increased planner performance comes from the new step
segment buffer. However, even in the worse case scenario, the step
segment buffer generates a new segment with a typical 0.2 ms, and the
worse case is 1ms upon a new block or replanning the active block.
Added altogether, it’s argubly still twice as efficient as the old one.
2013-12-05 05:49:24 +01:00
|
|
|
void plan_cycle_reinitialize();
|
2011-01-14 17:13:33 +01:00
|
|
|
|
2011-12-09 02:47:48 +01:00
|
|
|
// Returns the status of the block ring buffer. True, if buffer is full.
|
|
|
|
uint8_t plan_check_full_buffer();
|
|
|
|
|
2011-10-12 04:51:04 +02:00
|
|
|
#endif
|