2013-08-29 02:34:34 -03:00
|
|
|
/*
|
|
|
|
This program 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.
|
|
|
|
|
|
|
|
This program 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 this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
2010-09-07 01:20:34 -03:00
|
|
|
//
|
|
|
|
// SiRF Binary GPS driver for ArduPilot and ArduPilotMega.
|
|
|
|
// Code by Michael Smith.
|
|
|
|
//
|
|
|
|
|
|
|
|
#include "AP_GPS_SIRF.h"
|
2010-12-24 02:35:09 -04:00
|
|
|
#include <stdint.h>
|
2010-09-07 01:20:34 -03:00
|
|
|
|
|
|
|
// Initialisation messages
|
|
|
|
//
|
|
|
|
// Turn off all messages except for 0x29.
|
|
|
|
//
|
|
|
|
// XXX the bytes show up on the wire, but at least my test unit (EM-411) seems to ignore them.
|
|
|
|
//
|
2015-10-25 14:03:46 -03:00
|
|
|
const uint8_t AP_GPS_SIRF::_initialisation_blob[] = {
|
2011-10-28 15:52:50 -03:00
|
|
|
0xa0, 0xa2, 0x00, 0x08, 0xa6, 0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xa8, 0xb0, 0xb3,
|
2014-03-31 06:48:22 -03:00
|
|
|
0xa0, 0xa2, 0x00, 0x08, 0xa6, 0x00, 0x29, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0xd0, 0xb0, 0xb3
|
2010-09-07 01:20:34 -03:00
|
|
|
};
|
|
|
|
|
2014-03-28 16:52:27 -03:00
|
|
|
AP_GPS_SIRF::AP_GPS_SIRF(AP_GPS &_gps, AP_GPS::GPS_State &_state, AP_HAL::UARTDriver *_port) :
|
2018-05-16 04:26:53 -03:00
|
|
|
AP_GPS_Backend(_gps, _state, _port)
|
2011-10-28 15:52:50 -03:00
|
|
|
{
|
2015-10-26 08:25:44 -03:00
|
|
|
gps.send_blob_start(state.instance, (const char *)_initialisation_blob, sizeof(_initialisation_blob));
|
2010-09-07 01:20:34 -03:00
|
|
|
}
|
|
|
|
|
2014-03-28 16:52:27 -03:00
|
|
|
|
2010-09-07 01:20:34 -03:00
|
|
|
// Process bytes available from the stream
|
|
|
|
//
|
|
|
|
// The stream is assumed to contain only messages we recognise. If it
|
|
|
|
// contains other messages, and those messages contain the preamble
|
|
|
|
// bytes, it is possible for this code to fail to synchronise to the
|
|
|
|
// stream immediately. Without buffering the entire message and
|
|
|
|
// re-processing it from the top, this is unavoidable. The parser
|
|
|
|
// attempts to avoid this when possible.
|
|
|
|
//
|
2010-12-24 02:35:09 -04:00
|
|
|
bool
|
|
|
|
AP_GPS_SIRF::read(void)
|
2010-09-07 01:20:34 -03:00
|
|
|
{
|
2012-08-21 23:19:51 -03:00
|
|
|
uint8_t data;
|
|
|
|
int16_t numc;
|
|
|
|
bool parsed = false;
|
2011-10-28 15:52:50 -03:00
|
|
|
|
2014-03-28 16:52:27 -03:00
|
|
|
numc = port->available();
|
2011-10-28 15:52:50 -03:00
|
|
|
while(numc--) {
|
|
|
|
|
|
|
|
// read the next byte
|
2014-03-28 16:52:27 -03:00
|
|
|
data = port->read();
|
2011-10-28 15:52:50 -03:00
|
|
|
|
|
|
|
switch(_step) {
|
|
|
|
|
2012-08-21 23:19:51 -03:00
|
|
|
// Message preamble detection
|
|
|
|
//
|
|
|
|
// If we fail to match any of the expected bytes, we reset
|
|
|
|
// the state machine and re-consider the failed byte as
|
|
|
|
// the first byte of the preamble. This improves our
|
|
|
|
// chances of recovering from a mismatch and makes it less
|
|
|
|
// likely that we will be fooled by the preamble appearing
|
|
|
|
// as data in some other message.
|
|
|
|
//
|
2011-10-28 15:52:50 -03:00
|
|
|
case 1:
|
|
|
|
if (PREAMBLE2 == data) {
|
|
|
|
_step++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
_step = 0;
|
2017-08-22 14:28:10 -03:00
|
|
|
FALLTHROUGH;
|
2011-10-28 15:52:50 -03:00
|
|
|
case 0:
|
|
|
|
if(PREAMBLE1 == data)
|
|
|
|
_step++;
|
|
|
|
break;
|
|
|
|
|
2012-08-21 23:19:51 -03:00
|
|
|
// Message length
|
|
|
|
//
|
|
|
|
// We always collect the length so that we can avoid being
|
|
|
|
// fooled by preamble bytes in messages.
|
|
|
|
//
|
2011-10-28 15:52:50 -03:00
|
|
|
case 2:
|
|
|
|
_step++;
|
|
|
|
_payload_length = (uint16_t)data << 8;
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
_step++;
|
|
|
|
_payload_length |= data;
|
|
|
|
_payload_counter = 0;
|
|
|
|
_checksum = 0;
|
|
|
|
break;
|
|
|
|
|
2012-08-21 23:19:51 -03:00
|
|
|
// Message header processing
|
|
|
|
//
|
|
|
|
// We sniff the message ID to determine whether we are going
|
|
|
|
// to gather the message bytes or just discard them.
|
|
|
|
//
|
2011-10-28 15:52:50 -03:00
|
|
|
case 4:
|
|
|
|
_step++;
|
|
|
|
_accumulate(data);
|
|
|
|
_payload_length--;
|
|
|
|
_gather = false;
|
|
|
|
switch(data) {
|
|
|
|
case MSG_GEONAV:
|
|
|
|
if (_payload_length == sizeof(sirf_geonav)) {
|
|
|
|
_gather = true;
|
|
|
|
_msg_id = data;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2012-08-21 23:19:51 -03:00
|
|
|
// Receive message data
|
|
|
|
//
|
|
|
|
// Note that we are effectively guaranteed by the protocol
|
|
|
|
// that the checksum and postamble cannot be mistaken for
|
|
|
|
// the preamble, so if we are discarding bytes in this
|
|
|
|
// message when the payload is done we return directly
|
|
|
|
// to the preamble detector rather than bothering with
|
|
|
|
// the checksum logic.
|
|
|
|
//
|
2011-10-28 15:52:50 -03:00
|
|
|
case 5:
|
2012-08-21 23:19:51 -03:00
|
|
|
if (_gather) { // gather data if requested
|
2011-10-28 15:52:50 -03:00
|
|
|
_accumulate(data);
|
2016-06-06 10:49:46 -03:00
|
|
|
_buffer[_payload_counter] = data;
|
2011-10-28 15:52:50 -03:00
|
|
|
if (++_payload_counter == _payload_length)
|
|
|
|
_step++;
|
|
|
|
} else {
|
|
|
|
if (++_payload_counter == _payload_length)
|
|
|
|
_step = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
2012-08-21 23:19:51 -03:00
|
|
|
// Checksum and message processing
|
|
|
|
//
|
2011-10-28 15:52:50 -03:00
|
|
|
case 6:
|
|
|
|
_step++;
|
|
|
|
if ((_checksum >> 8) != data) {
|
|
|
|
_step = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 7:
|
|
|
|
_step = 0;
|
|
|
|
if ((_checksum & 0xff) != data) {
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (_gather) {
|
2012-08-21 23:19:51 -03:00
|
|
|
parsed = _parse_gps(); // Parse the new GPS packet
|
2011-10-28 15:52:50 -03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return(parsed);
|
2010-09-07 01:20:34 -03:00
|
|
|
}
|
|
|
|
|
2010-12-24 02:35:09 -04:00
|
|
|
bool
|
2010-09-07 01:20:34 -03:00
|
|
|
AP_GPS_SIRF::_parse_gps(void)
|
|
|
|
{
|
2011-10-28 15:52:50 -03:00
|
|
|
switch(_msg_id) {
|
|
|
|
case MSG_GEONAV:
|
2013-10-23 08:13:48 -03:00
|
|
|
//time = _swapl(&_buffer.nav.time);
|
2013-03-25 04:24:14 -03:00
|
|
|
// parse fix type
|
|
|
|
if (_buffer.nav.fix_invalid) {
|
2014-03-28 16:52:27 -03:00
|
|
|
state.status = AP_GPS::NO_FIX;
|
2013-03-25 07:08:47 -03:00
|
|
|
}else if ((_buffer.nav.fix_type & FIX_MASK) == FIX_3D) {
|
2014-03-28 16:52:27 -03:00
|
|
|
state.status = AP_GPS::GPS_OK_FIX_3D;
|
2013-03-25 04:24:14 -03:00
|
|
|
}else{
|
2014-03-28 16:52:27 -03:00
|
|
|
state.status = AP_GPS::GPS_OK_FIX_2D;
|
2013-03-25 04:24:14 -03:00
|
|
|
}
|
2014-03-28 16:52:27 -03:00
|
|
|
state.location.lat = swap_int32(_buffer.nav.latitude);
|
|
|
|
state.location.lng = swap_int32(_buffer.nav.longitude);
|
|
|
|
state.location.alt = swap_int32(_buffer.nav.altitude_msl);
|
|
|
|
state.ground_speed = swap_int32(_buffer.nav.ground_speed)*0.01f;
|
2016-05-04 22:28:35 -03:00
|
|
|
state.ground_course = wrap_360(swap_int16(_buffer.nav.ground_course)*0.01f);
|
2014-03-28 16:52:27 -03:00
|
|
|
state.num_sats = _buffer.nav.satellites;
|
|
|
|
fill_3d_velocity();
|
2011-10-28 15:52:50 -03:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
2010-09-07 01:20:34 -03:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
AP_GPS_SIRF::_accumulate(uint8_t val)
|
|
|
|
{
|
2011-10-28 15:52:50 -03:00
|
|
|
_checksum = (_checksum + val) & 0x7fff;
|
2010-09-07 01:20:34 -03:00
|
|
|
}
|
2012-09-17 01:43:07 -03:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
detect a SIRF GPS
|
|
|
|
*/
|
2017-08-22 14:30:00 -03:00
|
|
|
bool AP_GPS_SIRF::_detect(struct SIRF_detect_state &state, uint8_t data)
|
2012-09-17 01:43:07 -03:00
|
|
|
{
|
2017-08-22 14:30:00 -03:00
|
|
|
switch (state.step) {
|
|
|
|
case 1:
|
|
|
|
if (PREAMBLE2 == data) {
|
|
|
|
state.step++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
state.step = 0;
|
2017-08-28 18:14:29 -03:00
|
|
|
FALLTHROUGH;
|
2017-08-22 14:30:00 -03:00
|
|
|
case 0:
|
|
|
|
state.payload_length = state.payload_counter = state.checksum = 0;
|
|
|
|
if (PREAMBLE1 == data)
|
|
|
|
state.step++;
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
state.step++;
|
|
|
|
if (data != 0) {
|
|
|
|
// only look for short messages
|
|
|
|
state.step = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 3:
|
|
|
|
state.step++;
|
|
|
|
state.payload_length = data;
|
|
|
|
break;
|
|
|
|
case 4:
|
|
|
|
state.checksum = (state.checksum + data) & 0x7fff;
|
|
|
|
if (++state.payload_counter == state.payload_length) {
|
|
|
|
state.step++;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 5:
|
|
|
|
state.step++;
|
|
|
|
if ((state.checksum >> 8) != data) {
|
|
|
|
state.step = 0;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 6:
|
|
|
|
state.step = 0;
|
|
|
|
if ((state.checksum & 0xff) == data) {
|
|
|
|
return true;
|
|
|
|
}
|
2012-09-17 01:43:07 -03:00
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|