2015-07-27 00:35:07 +00:00
|
|
|
// This file is part of Dire Wolf, an amateur radio packet TNC.
|
|
|
|
//
|
2015-07-27 01:17:23 +00:00
|
|
|
// Copyright (C) 2011, 2012, 2013, 2014, 2015 John Langner, WB2OSZ
|
2015-07-27 00:35:07 +00: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 2 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/>.
|
|
|
|
//
|
|
|
|
|
|
|
|
|
2020-04-19 04:50:18 +00:00
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
/********************************************************************************
|
|
|
|
*
|
|
|
|
* File: hdlc_rec2.c
|
|
|
|
*
|
|
|
|
* Purpose: Extract HDLC frame from a block of bits after someone
|
|
|
|
* else has done the work of pulling it out from between
|
|
|
|
* the special "flag" sequences.
|
|
|
|
*
|
2015-07-27 01:05:48 +00:00
|
|
|
*
|
|
|
|
* New in version 1.1:
|
|
|
|
*
|
|
|
|
* Several enhancements provided by Fabrice FAURE:
|
|
|
|
*
|
|
|
|
* - Additional types of attempts to fix a bad CRC.
|
|
|
|
* - Optimized code to reduce execution time.
|
|
|
|
* - Improved detection of duplicate packets from different fixup attempts.
|
|
|
|
* - Set limit on number of packets in fix up later queue.
|
|
|
|
*
|
|
|
|
* One of the new recovery attempt cases recovers three additional
|
|
|
|
* packets that were lost before. The one thing I disagree with is
|
|
|
|
* use of the word "swap" because that sounds like two things
|
|
|
|
* are being exchanged for each other. I would prefer "flip"
|
|
|
|
* or "invert" to describe changing a bit to the opposite state.
|
|
|
|
* I took "swap" out of the user-visible messages but left the
|
|
|
|
* rest of the source code as provided.
|
|
|
|
*
|
2015-07-27 01:17:23 +00:00
|
|
|
* Test results: We intentionally use the worst demodulator so there
|
|
|
|
* is more opportunity to try to fix the frames.
|
|
|
|
*
|
|
|
|
* atest -P A -F n 02_Track_2.wav
|
|
|
|
*
|
|
|
|
* n description frames sec
|
|
|
|
* -- ----------- ------ ---
|
|
|
|
* 0 no attempt 963 40 error-free frames
|
|
|
|
* 1 invert 1 979 41 16 more
|
|
|
|
* 2 invert 2 982 42 3 more
|
|
|
|
* 3 invert 3 982 42 no change
|
|
|
|
* 4 remove 1 982 43 no change
|
|
|
|
* 5 remove 2 982 43 no change
|
|
|
|
* 6 remove 3 982 43 no change
|
|
|
|
* 7 insert 1 982 45 no change
|
|
|
|
* 8 insert 2 982 47 no change
|
|
|
|
* 9 invert two sep 993 178 11 more, some visually obvious errors.
|
|
|
|
* 10 invert many? 993 190 no change
|
|
|
|
* 11 remove many 995 190 2 more, need to investigate in detail.
|
|
|
|
* 12 remove two sep 995 201 no change
|
|
|
|
*
|
|
|
|
* Observations: The "insert" and "remove" techniques had no benefit. I would not expect them to.
|
|
|
|
* We have a phase locked loop that attempts to track any slight variations in the
|
|
|
|
* timing so we sample near the middle of the bit interval. Bits can get corrupted
|
|
|
|
* by noise but not disappear or just appear. That would be a gap in the timing.
|
|
|
|
* These should probably be removed in a future version.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Version 1.2: Now works for 9600 baud.
|
|
|
|
* This was more complicated due to the data scrambling.
|
|
|
|
* It was necessary to retain more initial state information after
|
|
|
|
* the start flag octet.
|
|
|
|
*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Version 1.3: Took out all of the "insert" and "remove" cases because they
|
|
|
|
* offer no benenfit.
|
|
|
|
*
|
|
|
|
* Took out the delayed processing and just do it realtime.
|
|
|
|
* Changed SWAP to INVERT because it is more descriptive.
|
|
|
|
*
|
2015-07-27 00:35:07 +00:00
|
|
|
*******************************************************************************/
|
|
|
|
|
2016-07-03 22:09:34 +00:00
|
|
|
#include "direwolf.h"
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <assert.h>
|
|
|
|
#include <ctype.h>
|
2016-07-03 22:09:34 +00:00
|
|
|
#include <string.h>
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
//Optimize processing by accessing directly to decoded bits
|
|
|
|
#define RRBB_C 1
|
2015-07-27 00:35:07 +00:00
|
|
|
#include "hdlc_rec2.h"
|
|
|
|
#include "fcs_calc.h"
|
|
|
|
#include "textcolor.h"
|
|
|
|
#include "ax25_pad.h"
|
|
|
|
#include "rrbb.h"
|
|
|
|
#include "multi_modem.h"
|
2015-07-27 01:17:23 +00:00
|
|
|
#include "dtime_now.h"
|
|
|
|
#include "demod_9600.h" /* for descramble() */
|
|
|
|
#include "audio.h" /* for struct audio_s */
|
|
|
|
//#include "ax25_pad.h" /* for AX25_MAX_ADDR_LEN */
|
2020-04-25 11:59:06 +00:00
|
|
|
#include "ais.h"
|
2015-07-27 01:17:23 +00:00
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
//#define DEBUG 1
|
|
|
|
//#define DEBUGx 1
|
|
|
|
//#define DEBUG_LATER 1
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
/* Audio configuration. */
|
|
|
|
|
|
|
|
static struct audio_s *save_audio_config_p;
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Minimum & maximum sizes of an AX.25 frame including the 2 octet FCS.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#define MIN_FRAME_LEN ((AX25_MIN_PACKET_LEN) + 2)
|
|
|
|
|
|
|
|
#define MAX_FRAME_LEN ((AX25_MAX_PACKET_LEN) + 2)
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is the current state of the HDLC decoder.
|
|
|
|
*
|
|
|
|
* It is possible to run multiple decoders concurrently by
|
|
|
|
* having a separate set of state variables for each.
|
|
|
|
*
|
|
|
|
* Should have a reset function instead of initializations here.
|
|
|
|
*/
|
|
|
|
|
|
|
|
struct hdlc_state_s {
|
|
|
|
|
|
|
|
int prev_raw; /* Keep track of previous bit so */
|
|
|
|
/* we can look for transitions. */
|
|
|
|
/* Should be only 0 or 1. */
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
int is_scrambled; /* Set for 9600 baud. */
|
|
|
|
int lfsr; /* Descrambler shift register for 9600 baud. */
|
|
|
|
int prev_descram; /* Previous unscrambled for 9600 baud. */
|
|
|
|
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
unsigned char pat_det; /* 8 bit pattern detector shift register. */
|
|
|
|
/* See below for more details. */
|
|
|
|
|
|
|
|
unsigned char oacc; /* Accumulator for building up an octet. */
|
|
|
|
|
|
|
|
int olen; /* Number of bits in oacc. */
|
|
|
|
/* When this reaches 8, oacc is copied */
|
|
|
|
/* to the frame buffer and olen is zeroed. */
|
|
|
|
|
|
|
|
unsigned char frame_buf[MAX_FRAME_LEN];
|
|
|
|
/* One frame is kept here. */
|
|
|
|
|
|
|
|
int frame_len; /* Number of octets in frame_buf. */
|
|
|
|
/* Should be in range of 0 .. MAX_FRAME_LEN. */
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
static int try_decode (rrbb_t block, int chan, int subchan, int slice, alevel_t alevel, retry_conf_t retry_conf, int passall);
|
|
|
|
|
|
|
|
static int try_to_fix_quick_now (rrbb_t block, int chan, int subchan, int slice, alevel_t alevel);
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
static int sanity_check (unsigned char *buf, int blen, retry_t bits_flipped, enum sanity_e sanity_test);
|
|
|
|
|
|
|
|
|
|
|
|
/***********************************************************************************
|
|
|
|
*
|
|
|
|
* Name: hdlc_rec2_init
|
|
|
|
*
|
|
|
|
* Purpose: Initialization.
|
|
|
|
*
|
|
|
|
* Inputs: p_audio_config - Pointer to configuration settings.
|
|
|
|
* This is what we care about for each channel.
|
|
|
|
*
|
|
|
|
* enum retry_e fix_bits;
|
|
|
|
* Level of effort to recover from
|
|
|
|
* a bad FCS on the frame.
|
|
|
|
* 0 = no effort
|
2015-11-29 15:44:30 +00:00
|
|
|
* 1 = try inverting a single bit
|
2015-07-27 01:17:23 +00:00
|
|
|
* 2... = more techniques...
|
|
|
|
*
|
|
|
|
* enum sanity_e sanity_test;
|
|
|
|
* Sanity test to apply when finding a good
|
|
|
|
* CRC after changing one or more bits.
|
|
|
|
* Must look like APRS, AX.25, or anything.
|
|
|
|
*
|
|
|
|
* int passall;
|
|
|
|
* Allow thru even with bad CRC after exhausting
|
|
|
|
* all fixup attempts.
|
|
|
|
*
|
|
|
|
* Description: Save pointer to configuration for later use.
|
|
|
|
*
|
|
|
|
***********************************************************************************/
|
|
|
|
|
|
|
|
void hdlc_rec2_init (struct audio_s *p_audio_config)
|
|
|
|
{
|
|
|
|
save_audio_config_p = p_audio_config;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
/***********************************************************************************
|
|
|
|
*
|
|
|
|
* Name: hdlc_rec2_block
|
|
|
|
*
|
|
|
|
* Purpose: Extract HDLC frame from a stream of bits.
|
|
|
|
*
|
|
|
|
* Inputs: block - Handle for bit array.
|
|
|
|
*
|
|
|
|
* Description: The other (original) hdlc decoder took one bit at a time
|
|
|
|
* right out of the demodulator.
|
|
|
|
*
|
|
|
|
* This is different in that it processes a block of bits
|
|
|
|
* previously extracted from between two "flag" patterns.
|
|
|
|
*
|
|
|
|
* This allows us to try decoding the same received data more
|
|
|
|
* than once.
|
|
|
|
*
|
2015-07-27 01:17:23 +00:00
|
|
|
* Version 1.2: Now works properly for G3RUH type scrambling.
|
2015-07-27 00:35:07 +00:00
|
|
|
*
|
|
|
|
***********************************************************************************/
|
|
|
|
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
void hdlc_rec2_block (rrbb_t block)
|
2015-07-27 00:35:07 +00:00
|
|
|
{
|
|
|
|
int chan = rrbb_get_chan(block);
|
|
|
|
int subchan = rrbb_get_subchan(block);
|
2015-11-29 15:44:30 +00:00
|
|
|
int slice = rrbb_get_slice(block);
|
2015-07-27 01:17:23 +00:00
|
|
|
alevel_t alevel = rrbb_get_audio_level(block);
|
|
|
|
retry_t fix_bits = save_audio_config_p->achan[chan].fix_bits;
|
|
|
|
int passall = save_audio_config_p->achan[chan].passall;
|
2015-07-27 00:35:07 +00:00
|
|
|
int ok;
|
|
|
|
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_DEBUG);
|
|
|
|
dw_printf ("\n--- try to decode ---\n");
|
|
|
|
#endif
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Create an empty retry configuration */
|
|
|
|
retry_conf_t retry_cfg;
|
|
|
|
|
2016-07-03 22:09:34 +00:00
|
|
|
memset (&retry_cfg, 0, sizeof(retry_cfg));
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
/*
|
|
|
|
* For our first attempt we don't try to alter any bits.
|
|
|
|
* Still let it thru if passall AND no retries are desired.
|
|
|
|
*/
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.type = RETRY_TYPE_NONE;
|
|
|
|
retry_cfg.mode = RETRY_MODE_CONTIGUOUS;
|
|
|
|
retry_cfg.retry = RETRY_NONE;
|
|
|
|
retry_cfg.u_bits.contig.nr_bits = 0;
|
|
|
|
retry_cfg.u_bits.contig.bit_idx = 0;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, passall & (fix_bits == RETRY_NONE));
|
2015-07-27 00:35:07 +00:00
|
|
|
if (ok) {
|
|
|
|
#if DEBUG
|
|
|
|
text_color_set(DW_COLOR_INFO);
|
|
|
|
dw_printf ("Got it the first time.\n");
|
|
|
|
#endif
|
|
|
|
rrbb_delete (block);
|
|
|
|
return;
|
|
|
|
}
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Not successful with frame in orginal form.
|
2015-11-29 15:44:30 +00:00
|
|
|
* See if we can "fix" it.
|
|
|
|
*/
|
|
|
|
if (try_to_fix_quick_now (block, chan, subchan, slice, alevel)) {
|
2015-07-27 00:35:07 +00:00
|
|
|
rrbb_delete (block);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
if (passall) {
|
2015-07-27 01:17:23 +00:00
|
|
|
/* Exhausted all desired fix up attempts. */
|
|
|
|
/* Let thru even with bad CRC. Of course, it still */
|
|
|
|
/* needs to be a minimum number of whole octets. */
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, 1);
|
2015-07-27 01:17:23 +00:00
|
|
|
rrbb_delete (block);
|
|
|
|
}
|
|
|
|
else {
|
2015-07-27 00:35:07 +00:00
|
|
|
rrbb_delete (block);
|
|
|
|
}
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
} /* end hdlc_rec2_block */
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
/***********************************************************************************
|
|
|
|
*
|
|
|
|
* Name: try_to_fix_quick_now
|
|
|
|
*
|
|
|
|
* Purpose: Attempt some quick fixups that don't take very long.
|
|
|
|
*
|
|
|
|
* Inputs: block - Stream of bits that might be a frame.
|
|
|
|
* chan - Radio channel from which it was received.
|
|
|
|
* subchan - Which demodulator when more than one per channel.
|
|
|
|
* alevel - Audio level for later reporting.
|
|
|
|
*
|
|
|
|
* Global In: configuration fix_bits - Maximum level of fix up to attempt.
|
|
|
|
*
|
|
|
|
* RETRY_NONE (0) - Don't try any.
|
2015-11-29 15:44:30 +00:00
|
|
|
* RETRY_INVERT_SINGLE (1) - Try inverting single bits.
|
2015-07-27 01:17:23 +00:00
|
|
|
* etc.
|
|
|
|
*
|
|
|
|
* configuration passall - Let it thru with bad CRC after exhausting
|
|
|
|
* all fixup attempts.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* Returns: 1 for success. "try_decode" has passed the result along to the
|
|
|
|
* processing step.
|
|
|
|
* 0 for failure. Caller might continue with more aggressive attempts.
|
|
|
|
*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Original: Some of the attempted fix up techniques are quick.
|
2015-07-27 01:17:23 +00:00
|
|
|
* We will attempt them immediately after receiving the frame.
|
|
|
|
* Others, that take time order N**2, will be done in a later section.
|
|
|
|
*
|
|
|
|
* Version 1.2: Now works properly for G3RUH type scrambling.
|
|
|
|
*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Version 1.3: Removed the extra cases that didn't help.
|
|
|
|
* The separated bit case is now handled immediately instead of
|
|
|
|
* being thrown in a queue for later processing.
|
|
|
|
*
|
2015-07-27 01:17:23 +00:00
|
|
|
***********************************************************************************/
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
static int try_to_fix_quick_now (rrbb_t block, int chan, int subchan, int slice, alevel_t alevel)
|
2015-07-27 00:35:07 +00:00
|
|
|
{
|
|
|
|
int ok;
|
2016-07-03 22:09:34 +00:00
|
|
|
int len, i;
|
2015-07-27 01:17:23 +00:00
|
|
|
retry_t fix_bits = save_audio_config_p->achan[chan].fix_bits;
|
2015-11-08 01:57:02 +00:00
|
|
|
//int passall = save_audio_config_p->achan[chan].passall;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
|
|
|
|
len = rrbb_get_len(block);
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Prepare the retry configuration */
|
|
|
|
retry_conf_t retry_cfg;
|
2016-07-03 22:09:34 +00:00
|
|
|
|
|
|
|
memset (&retry_cfg, 0, sizeof(retry_cfg));
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Will modify only contiguous bits*/
|
|
|
|
retry_cfg.mode = RETRY_MODE_CONTIGUOUS;
|
2015-07-27 00:35:07 +00:00
|
|
|
/*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Try inverting one bit.
|
2015-07-27 00:35:07 +00:00
|
|
|
*/
|
2015-11-29 15:44:30 +00:00
|
|
|
if (fix_bits < RETRY_INVERT_SINGLE) {
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
/* Stop before single bit fix up. */
|
|
|
|
|
|
|
|
return 0; /* failure. */
|
2015-07-27 00:35:07 +00:00
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Try to swap one bit */
|
|
|
|
retry_cfg.type = RETRY_TYPE_SWAP;
|
2015-11-29 15:44:30 +00:00
|
|
|
retry_cfg.retry = RETRY_INVERT_SINGLE;
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.contig.nr_bits = 1;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
for (i=0; i<len; i++) {
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Set the index of the bit to swap */
|
|
|
|
retry_cfg.u_bits.contig.bit_idx = i;
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, 0);
|
2015-07-27 00:35:07 +00:00
|
|
|
if (ok) {
|
|
|
|
#if DEBUG
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("*** Success by flipping SINGLE bit %d of %d ***\n", i, len);
|
|
|
|
#endif
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Try inverting two adjacent bits.
|
2015-07-27 00:35:07 +00:00
|
|
|
*/
|
2015-11-29 15:44:30 +00:00
|
|
|
if (fix_bits < RETRY_INVERT_DOUBLE) {
|
2015-07-27 00:35:07 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Try to swap two contiguous bits */
|
2015-11-29 15:44:30 +00:00
|
|
|
retry_cfg.retry = RETRY_INVERT_DOUBLE;
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.contig.nr_bits = 2;
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
for (i=0; i<len-1; i++) {
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.contig.bit_idx = i;
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, 0);
|
2015-07-27 00:35:07 +00:00
|
|
|
if (ok) {
|
|
|
|
#if DEBUG
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("*** Success by flipping DOUBLE bit %d of %d ***\n", i, len);
|
|
|
|
#endif
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Try inverting adjacent three bits.
|
2015-07-27 00:35:07 +00:00
|
|
|
*/
|
2015-11-29 15:44:30 +00:00
|
|
|
if (fix_bits < RETRY_INVERT_TRIPLE) {
|
2015-07-27 00:35:07 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Try to swap three contiguous bits */
|
2015-11-29 15:44:30 +00:00
|
|
|
retry_cfg.retry = RETRY_INVERT_TRIPLE;
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.contig.nr_bits = 3;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
for (i=0; i<len-2; i++) {
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.contig.bit_idx = i;
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, 0);
|
2015-07-27 00:35:07 +00:00
|
|
|
if (ok) {
|
|
|
|
#if DEBUG
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("*** Success by flipping TRIPLE bit %d of %d ***\n", i, len);
|
|
|
|
#endif
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
/*
|
|
|
|
* Two non-adjacent ("separated") single bits.
|
2015-11-29 15:44:30 +00:00
|
|
|
* It chews up a lot of CPU time. Usual test takes 4 times longer to run.
|
2015-07-27 00:35:07 +00:00
|
|
|
*
|
|
|
|
* Processing time is order N squared so time goes up rapidly with larger frames.
|
|
|
|
*/
|
2015-11-29 15:44:30 +00:00
|
|
|
if (fix_bits < RETRY_INVERT_TWO_SEP) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
retry_cfg.mode = RETRY_MODE_SEPARATED;
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.type = RETRY_TYPE_SWAP;
|
2015-11-29 15:44:30 +00:00
|
|
|
retry_cfg.retry = RETRY_INVERT_TWO_SEP;
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.sep.bit_idx_c = -1;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
#ifdef DEBUG_LATER
|
2015-07-27 00:35:07 +00:00
|
|
|
tstart = dtime_now();
|
2015-07-27 01:05:48 +00:00
|
|
|
dw_printf ("*** Try flipping TWO SEPARATED BITS %d bits\n", len);
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
|
|
|
len = rrbb_get_len(block);
|
|
|
|
for (i=0; i<len-2; i++) {
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.sep.bit_idx_a = i;
|
2015-07-27 00:35:07 +00:00
|
|
|
int j;
|
|
|
|
|
|
|
|
ok = 0;
|
|
|
|
for (j=i+2; j<len; j++) {
|
2015-07-27 01:05:48 +00:00
|
|
|
retry_cfg.u_bits.sep.bit_idx_b = j;
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, 0);
|
2015-07-27 01:05:48 +00:00
|
|
|
if (ok) {
|
2015-07-27 00:35:07 +00:00
|
|
|
break;
|
2015-07-27 01:05:48 +00:00
|
|
|
}
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
}
|
|
|
|
if (ok) {
|
|
|
|
#if DEBUG
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
2015-07-27 01:05:48 +00:00
|
|
|
dw_printf ("*** Success by flipping TWO SEPARATED bits %d and %d of %d \n", i, j, len);
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
2015-07-27 01:17:23 +00:00
|
|
|
return (1);
|
2015-07-27 00:35:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
|
|
|
|
|
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
// TODO: Remove this. but first figure out what to do in atest.c
|
2015-07-27 01:05:48 +00:00
|
|
|
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
int hdlc_rec2_try_to_fix_later (rrbb_t block, int chan, int subchan, int slice, alevel_t alevel)
|
|
|
|
{
|
|
|
|
int ok;
|
2016-07-03 22:09:34 +00:00
|
|
|
//int len;
|
|
|
|
//retry_t fix_bits = save_audio_config_p->achan[chan].fix_bits;
|
2015-11-29 15:44:30 +00:00
|
|
|
int passall = save_audio_config_p->achan[chan].passall;
|
2015-07-27 01:05:48 +00:00
|
|
|
#if DEBUG_LATER
|
2015-11-29 15:44:30 +00:00
|
|
|
double tstart, tend;
|
2015-07-27 01:05:48 +00:00
|
|
|
#endif
|
2015-11-29 15:44:30 +00:00
|
|
|
retry_conf_t retry_cfg;
|
2016-07-03 22:09:34 +00:00
|
|
|
|
|
|
|
memset (&retry_cfg, 0, sizeof(retry_cfg));
|
|
|
|
|
|
|
|
//len = rrbb_get_len(block);
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
* All fix up attempts have failed.
|
|
|
|
* Should we pass it along anyhow with a bad CRC?
|
|
|
|
* Note that we still need a minimum number of whole octets.
|
|
|
|
*/
|
|
|
|
if (passall) {
|
|
|
|
|
|
|
|
retry_cfg.type = RETRY_TYPE_NONE;
|
|
|
|
retry_cfg.mode = RETRY_MODE_CONTIGUOUS;
|
2015-11-29 15:44:30 +00:00
|
|
|
retry_cfg.retry = RETRY_NONE;
|
2015-07-27 01:17:23 +00:00
|
|
|
retry_cfg.u_bits.contig.nr_bits = 0;
|
|
|
|
retry_cfg.u_bits.contig.bit_idx = 0;
|
2015-11-29 15:44:30 +00:00
|
|
|
ok = try_decode (block, chan, subchan, slice, alevel, retry_cfg, passall);
|
2015-07-27 01:17:23 +00:00
|
|
|
return (ok);
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
} /* end hdlc_rec2_try_to_fix_later */
|
|
|
|
|
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
/*
|
|
|
|
* Check if the specified index of bit has been modified with the current type of configuration
|
|
|
|
* Provide a specific implementation for contiguous mode to optimize number of tests done in the loop
|
|
|
|
*/
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
inline static char is_contig_bit_modified(int bit_idx, retry_conf_t retry_conf) {
|
|
|
|
int cont_bit_idx = retry_conf.u_bits.contig.bit_idx;
|
|
|
|
int cont_nr_bits = retry_conf.u_bits.contig.nr_bits;
|
|
|
|
|
|
|
|
if (bit_idx >= cont_bit_idx && (bit_idx < cont_bit_idx + cont_nr_bits ))
|
|
|
|
return 1;
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if the specified index of bit has been modified with the current type of configuration in separated bit index mode
|
|
|
|
* Provide a specific implementation for separated mode to optimize number of tests done in the loop
|
|
|
|
*/
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
inline static char is_sep_bit_modified(int bit_idx, retry_conf_t retry_conf) {
|
|
|
|
if (bit_idx == retry_conf.u_bits.sep.bit_idx_a ||
|
|
|
|
bit_idx == retry_conf.u_bits.sep.bit_idx_b ||
|
|
|
|
bit_idx == retry_conf.u_bits.sep.bit_idx_c)
|
|
|
|
return 1;
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
/***********************************************************************************
|
|
|
|
*
|
|
|
|
* Name: try_decode
|
|
|
|
*
|
|
|
|
* Purpose:
|
|
|
|
*
|
|
|
|
* Inputs: block - Bit string that was collected between "flag" patterns.
|
|
|
|
*
|
|
|
|
* chan, subchan - where it came from.
|
|
|
|
*
|
|
|
|
* alevel - audio level for later reporting.
|
|
|
|
*
|
|
|
|
* retry_conf - Controls changes that will be attempted to get a good CRC.
|
|
|
|
*
|
|
|
|
* retry:
|
2015-11-29 15:44:30 +00:00
|
|
|
* Level of effort to recover from a bad FCS on the frame.
|
|
|
|
* RETRY_NONE = 0
|
|
|
|
* RETRY_INVERT_SINGLE = 1
|
|
|
|
* RETRY_INVERT_DOUBLE = 2
|
|
|
|
* RETRY_INVERT_TRIPLE = 3
|
|
|
|
* RETRY_INVERT_TWO_SEP = 4
|
2015-07-27 01:17:23 +00:00
|
|
|
*
|
|
|
|
* mode: RETRY_MODE_CONTIGUOUS - change adjacent bits.
|
|
|
|
* contig.bit_idx - first bit position
|
|
|
|
* contig.nr_bits - number of bits
|
|
|
|
*
|
|
|
|
* RETRY_MODE_SEPARATED - change bits not next to each other.
|
|
|
|
* sep.bit_idx_a - bit positions
|
|
|
|
* sep.bit_idx_b - bit positions
|
|
|
|
* sep.bit_idx_c - bit positions
|
|
|
|
*
|
|
|
|
* type: RETRY_TYPE_NONE - Make no changes.
|
|
|
|
* RETRY_TYPE_SWAP - Try inverting.
|
|
|
|
*
|
|
|
|
* passall - All it thru even with bad CRC.
|
|
|
|
* Valid only when no changes make. i.e.
|
|
|
|
* retry == RETRY_NONE, type == RETRY_TYPE_NONE
|
|
|
|
*
|
|
|
|
* Returns: 1 = successfully extracted something.
|
|
|
|
* 0 = failure.
|
|
|
|
*
|
|
|
|
***********************************************************************************/
|
|
|
|
|
2015-11-29 15:44:30 +00:00
|
|
|
static int try_decode (rrbb_t block, int chan, int subchan, int slice, alevel_t alevel, retry_conf_t retry_conf, int passall)
|
2015-07-27 00:35:07 +00:00
|
|
|
{
|
|
|
|
struct hdlc_state_s H;
|
|
|
|
int blen; /* Block length in bits. */
|
|
|
|
int i;
|
2016-12-23 16:28:39 +00:00
|
|
|
int raw; /* From demodulator. Should be 0 or 1. */
|
2015-11-08 01:57:02 +00:00
|
|
|
#if DEBUGx
|
2015-07-27 01:05:48 +00:00
|
|
|
int crc_failed = 1;
|
2015-11-08 01:57:02 +00:00
|
|
|
#endif
|
2015-07-27 01:05:48 +00:00
|
|
|
int retry_conf_mode = retry_conf.mode;
|
|
|
|
int retry_conf_type = retry_conf.type;
|
|
|
|
int retry_conf_retry = retry_conf.retry;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
H.is_scrambled = rrbb_get_is_scrambled (block);
|
|
|
|
H.prev_descram = rrbb_get_prev_descram (block);
|
|
|
|
H.lfsr = rrbb_get_descram_state (block);
|
2015-11-29 15:44:30 +00:00
|
|
|
H.prev_raw = rrbb_get_bit (block, 0); /* Actually last bit of the */
|
2015-07-27 00:35:07 +00:00
|
|
|
/* opening flag so we can derive the */
|
|
|
|
/* first data bit. */
|
|
|
|
|
|
|
|
/* Does this make sense? */
|
|
|
|
/* This is the last bit of the "flag" pattern. */
|
|
|
|
/* If it was corrupted we wouldn't have detected */
|
|
|
|
/* the start of frame. */
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
if ((retry_conf.mode == RETRY_MODE_CONTIGUOUS && is_contig_bit_modified(0, retry_conf)) ||
|
|
|
|
(retry_conf.mode == RETRY_MODE_SEPARATED && is_sep_bit_modified(0, retry_conf))) {
|
2015-07-27 00:35:07 +00:00
|
|
|
H.prev_raw = ! H.prev_raw;
|
|
|
|
}
|
|
|
|
|
|
|
|
H.pat_det = 0;
|
|
|
|
H.oacc = 0;
|
|
|
|
H.olen = 0;
|
|
|
|
H.frame_len = 0;
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
blen = rrbb_get_len(block);
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_DEBUG);
|
2015-07-27 01:05:48 +00:00
|
|
|
if (retry_conf.type == RETRY_TYPE_NONE)
|
|
|
|
dw_printf ("try_decode: blen=%d\n", blen);
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
|
|
|
for (i=1; i<blen; i++) {
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Get the value for the current bit */
|
2015-11-29 15:44:30 +00:00
|
|
|
raw = rrbb_get_bit (block, i);
|
2015-07-27 01:05:48 +00:00
|
|
|
/* If swap two sep mode , swap the bit if needed */
|
2015-11-29 15:44:30 +00:00
|
|
|
if (retry_conf_retry == RETRY_INVERT_TWO_SEP) {
|
2015-07-27 01:05:48 +00:00
|
|
|
if (is_sep_bit_modified(i, retry_conf))
|
|
|
|
raw = ! raw;
|
2015-11-29 15:44:30 +00:00
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
/* Else handle all the others contiguous modes */
|
|
|
|
else if (retry_conf_mode == RETRY_MODE_CONTIGUOUS) {
|
2015-11-29 15:44:30 +00:00
|
|
|
|
|
|
|
if (retry_conf_type == RETRY_TYPE_SWAP) {
|
2015-07-27 01:05:48 +00:00
|
|
|
/* If this is the bit to swap */
|
|
|
|
if (is_contig_bit_modified(i, retry_conf))
|
|
|
|
raw = ! raw;
|
|
|
|
}
|
2015-07-27 00:35:07 +00:00
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
} else {
|
2015-07-27 00:35:07 +00:00
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
/*
|
|
|
|
* Octets are sent LSB first.
|
|
|
|
* Shift the most recent 8 bits thru the pattern detector.
|
|
|
|
*/
|
|
|
|
H.pat_det >>= 1;
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Using NRZI encoding,
|
|
|
|
* A '0' bit is represented by an inversion since previous bit.
|
|
|
|
* A '1' bit is represented by no change.
|
2015-07-27 01:05:48 +00:00
|
|
|
* Note: this code can be factorized with the raw != H.prev_raw code at the cost of processing time
|
2015-07-27 00:35:07 +00:00
|
|
|
*/
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
int dbit ;
|
|
|
|
|
|
|
|
if (H.is_scrambled) {
|
|
|
|
int descram;
|
|
|
|
|
|
|
|
descram = descramble(raw, &(H.lfsr));
|
|
|
|
|
|
|
|
dbit = (descram == H.prev_descram);
|
|
|
|
H.prev_descram = descram;
|
|
|
|
H.prev_raw = raw;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
|
|
|
|
dbit = (raw == H.prev_raw);
|
|
|
|
H.prev_raw = raw;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dbit) {
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
H.pat_det |= 0x80;
|
|
|
|
/* Valid data will never have 7 one bits in a row: exit. */
|
|
|
|
if (H.pat_det == 0xfe) {
|
2015-07-27 00:35:07 +00:00
|
|
|
#if DEBUGx
|
2015-07-27 01:05:48 +00:00
|
|
|
text_color_set(DW_COLOR_DEBUG);
|
|
|
|
dw_printf ("try_decode: found abort, i=%d\n", i);
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
2015-07-27 01:05:48 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
H.oacc >>= 1;
|
|
|
|
H.oacc |= 0x80;
|
|
|
|
} else {
|
2015-07-27 01:17:23 +00:00
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
/* The special pattern 01111110 indicates beginning and ending of a frame: exit. */
|
|
|
|
if (H.pat_det == 0x7e) {
|
2015-07-27 00:35:07 +00:00
|
|
|
#if DEBUGx
|
2015-07-27 01:05:48 +00:00
|
|
|
text_color_set(DW_COLOR_DEBUG);
|
|
|
|
dw_printf ("try_decode: found flag, i=%d\n", i);
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
2015-07-27 01:05:48 +00:00
|
|
|
return 0;
|
2015-07-27 00:35:07 +00:00
|
|
|
/*
|
|
|
|
* If we have five '1' bits in a row, followed by a '0' bit,
|
|
|
|
*
|
2015-07-27 01:05:48 +00:00
|
|
|
* 011111xx
|
2015-07-27 00:35:07 +00:00
|
|
|
*
|
|
|
|
* the current '0' bit should be discarded because it was added for
|
|
|
|
* "bit stuffing."
|
|
|
|
*/
|
2015-07-27 01:05:48 +00:00
|
|
|
|
|
|
|
} else if ( (H.pat_det >> 2) == 0x1f ) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
H.oacc >>= 1;
|
|
|
|
}
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
/*
|
2015-07-27 01:05:48 +00:00
|
|
|
* Now accumulate bits into octets, and complete octets
|
2015-07-27 00:35:07 +00:00
|
|
|
* into the frame buffer.
|
|
|
|
*/
|
|
|
|
|
|
|
|
H.olen++;
|
|
|
|
|
2015-07-27 01:05:48 +00:00
|
|
|
if (H.olen & 8) {
|
2015-07-27 00:35:07 +00:00
|
|
|
H.olen = 0;
|
|
|
|
|
|
|
|
if (H.frame_len < MAX_FRAME_LEN) {
|
2015-07-27 01:05:48 +00:00
|
|
|
H.frame_buf[H.frame_len] = H.oacc;
|
2015-07-27 00:35:07 +00:00
|
|
|
H.frame_len++;
|
2015-07-27 01:05:48 +00:00
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
}
|
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
} /* end of loop on all bits in block */
|
2015-07-27 00:35:07 +00:00
|
|
|
/*
|
|
|
|
* Do we have a minimum number of complete bytes?
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_DEBUG);
|
|
|
|
dw_printf ("try_decode: olen=%d, frame_len=%d\n", H.olen, H.frame_len);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (H.olen == 0 && H.frame_len >= MIN_FRAME_LEN) {
|
|
|
|
|
|
|
|
unsigned short actual_fcs, expected_fcs;
|
|
|
|
|
|
|
|
#if DEBUGx
|
2015-07-27 01:05:48 +00:00
|
|
|
if (retry_conf.type == RETRY_TYPE_NONE) {
|
2015-07-27 00:35:07 +00:00
|
|
|
int j;
|
|
|
|
text_color_set(DW_COLOR_DEBUG);
|
|
|
|
dw_printf ("NEW WAY: frame len = %d\n", H.frame_len);
|
|
|
|
for (j=0; j<H.frame_len; j++) {
|
|
|
|
dw_printf (" %02x", H.frame_buf[j]);
|
|
|
|
}
|
|
|
|
dw_printf ("\n");
|
2015-07-27 01:05:48 +00:00
|
|
|
|
|
|
|
}
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
|
|
|
/* Check FCS, low byte first, and process... */
|
|
|
|
|
|
|
|
/* Alternatively, it is possible to include the two FCS bytes */
|
|
|
|
/* in the CRC calculation and look for a magic constant. */
|
|
|
|
/* That would be easier in the case where the CRC is being */
|
|
|
|
/* accumulated along the way as the octets are received. */
|
|
|
|
/* I think making a second pass over it and comparing is */
|
|
|
|
/* easier to understand. */
|
|
|
|
|
|
|
|
actual_fcs = H.frame_buf[H.frame_len-2] | (H.frame_buf[H.frame_len-1] << 8);
|
|
|
|
|
|
|
|
expected_fcs = fcs_calc (H.frame_buf, H.frame_len - 2);
|
|
|
|
|
2020-04-19 04:50:18 +00:00
|
|
|
if (actual_fcs == expected_fcs && save_audio_config_p->achan[chan].modem_type == MODEM_AIS) {
|
|
|
|
|
2020-04-25 11:59:06 +00:00
|
|
|
// Sanity check for AIS.
|
|
|
|
if (ais_check_length((H.frame_buf[0] >> 2) & 0x3f, H.frame_len - 2) == 0) {
|
|
|
|
multi_modem_process_rec_frame (chan, subchan, slice, H.frame_buf, H.frame_len - 2, alevel, retry_conf.retry, 0); /* len-2 to remove FCS. */
|
|
|
|
return 1; /* success */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
return 0; /* did not pass sanity check */
|
|
|
|
}
|
2020-04-19 04:50:18 +00:00
|
|
|
}
|
|
|
|
else if (actual_fcs == expected_fcs &&
|
2015-07-27 01:17:23 +00:00
|
|
|
sanity_check (H.frame_buf, H.frame_len - 2, retry_conf.retry, save_audio_config_p->achan[chan].sanity_test)) {
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
// TODO: Shouldn't be necessary to pass chan, subchan, alevel into
|
|
|
|
// try_decode because we can obtain them from block.
|
|
|
|
// Let's make sure that assumption is good...
|
|
|
|
|
|
|
|
assert (rrbb_get_chan(block) == chan);
|
|
|
|
assert (rrbb_get_subchan(block) == subchan);
|
2020-01-06 01:08:22 +00:00
|
|
|
multi_modem_process_rec_frame (chan, subchan, slice, H.frame_buf, H.frame_len - 2, alevel, retry_conf.retry, 0); /* len-2 to remove FCS. */
|
2015-07-27 00:35:07 +00:00
|
|
|
return 1; /* success */
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
} else if (passall) {
|
|
|
|
if (retry_conf_retry == RETRY_NONE && retry_conf_type == RETRY_TYPE_NONE) {
|
|
|
|
|
|
|
|
//text_color_set(DW_COLOR_ERROR);
|
|
|
|
//dw_printf ("ATTEMPTING PASSALL PROCESSING\n");
|
|
|
|
|
2020-01-06 01:08:22 +00:00
|
|
|
multi_modem_process_rec_frame (chan, subchan, slice, H.frame_buf, H.frame_len - 2, alevel, RETRY_MAX, 0); /* len-2 to remove FCS. */
|
2015-07-27 01:17:23 +00:00
|
|
|
return 1; /* success */
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("try_decode: internal error passall = %d, retry_conf_retry = %d, retry_conf_type = %d\n",
|
|
|
|
passall, retry_conf_retry, retry_conf_type);
|
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
} else {
|
|
|
|
|
|
|
|
goto failure;
|
|
|
|
}
|
|
|
|
} else {
|
2015-11-08 01:57:02 +00:00
|
|
|
#if DEBUGx
|
2015-07-27 01:05:48 +00:00
|
|
|
crc_failed = 0;
|
2015-11-08 01:57:02 +00:00
|
|
|
#endif
|
2015-07-27 01:05:48 +00:00
|
|
|
goto failure;
|
2015-07-27 00:35:07 +00:00
|
|
|
}
|
2015-07-27 01:05:48 +00:00
|
|
|
failure:
|
|
|
|
#if DEBUGx
|
|
|
|
if (retry_conf.type == RETRY_TYPE_NONE ) {
|
|
|
|
int j;
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
if (crc_failed)
|
|
|
|
dw_printf ("CRC failed\n");
|
|
|
|
if (H.olen != 0)
|
|
|
|
dw_printf ("Bad olen: %d \n", H.olen);
|
|
|
|
else if (H.frame_len < MIN_FRAME_LEN) {
|
|
|
|
dw_printf ("Frame too small\n");
|
|
|
|
goto end;
|
|
|
|
}
|
|
|
|
|
|
|
|
dw_printf ("FAILURE with frame: frame len = %d\n", H.frame_len);
|
|
|
|
dw_printf ("\n");
|
|
|
|
for (j=0; j<H.frame_len; j++) {
|
|
|
|
dw_printf (" %02x", H.frame_buf[j]);
|
|
|
|
}
|
|
|
|
dw_printf ("\nDEC\n");
|
|
|
|
for (j=0; j<H.frame_len; j++) {
|
|
|
|
dw_printf ("%c", H.frame_buf[j]>>1);
|
|
|
|
}
|
|
|
|
dw_printf ("\nORIG\n");
|
|
|
|
for (j=0; j<H.frame_len; j++) {
|
|
|
|
dw_printf ("%c", H.frame_buf[j]);
|
|
|
|
}
|
|
|
|
dw_printf ("\n");
|
|
|
|
}
|
|
|
|
end:
|
2015-11-08 01:57:02 +00:00
|
|
|
#endif
|
2015-07-27 00:35:07 +00:00
|
|
|
return 0; /* failure. */
|
|
|
|
|
|
|
|
} /* end try_decode */
|
|
|
|
|
|
|
|
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
/***********************************************************************************
|
|
|
|
*
|
|
|
|
* Name: sanity_check
|
|
|
|
*
|
|
|
|
* Purpose: Try to weed out bogus packets from initially failed FCS matches.
|
|
|
|
*
|
|
|
|
* Inputs: buf
|
|
|
|
*
|
|
|
|
* blen
|
|
|
|
*
|
|
|
|
* bits_flipped
|
|
|
|
*
|
|
|
|
* sanity How much sanity checking to perform:
|
|
|
|
* SANITY_APRS - Looks like APRS. See User Guide,
|
|
|
|
* section that discusses bad apples.
|
|
|
|
* SANITY_AX25 - Has valid AX.25 address part.
|
|
|
|
* No checking of the rest. Useful for
|
|
|
|
* connected mode packet.
|
|
|
|
* SANITY_NONE - No checking. Would be suitable
|
|
|
|
* only if using frames that don't conform
|
|
|
|
* to AX.25 standard.
|
|
|
|
*
|
|
|
|
* Returns: 1 if it passes the sanity test.
|
|
|
|
*
|
2015-11-29 15:44:30 +00:00
|
|
|
* Description: This is NOT a validity check.
|
|
|
|
* We don't know if modifying the frame fixed the problem or made it worse.
|
|
|
|
* We can only test if it looks reasonable.
|
2015-07-27 01:17:23 +00:00
|
|
|
*
|
|
|
|
***********************************************************************************/
|
|
|
|
|
|
|
|
|
|
|
|
static int sanity_check (unsigned char *buf, int blen, retry_t bits_flipped, enum sanity_e sanity_test)
|
2015-07-27 00:35:07 +00:00
|
|
|
{
|
|
|
|
int alen; /* Length of address part. */
|
|
|
|
int j;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* No sanity check if we didn't try fixing the data.
|
|
|
|
* Should we have different levels of checking depending on
|
|
|
|
* how much we try changing the raw data?
|
|
|
|
*/
|
|
|
|
if (bits_flipped == RETRY_NONE) {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* If using frames that do not conform to AX.25, it might be
|
|
|
|
* desirable to skip the sanity check entirely.
|
|
|
|
*/
|
|
|
|
if (sanity_test == SANITY_NONE) {
|
|
|
|
return (1);
|
|
|
|
}
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Address part must be a multiple of 7.
|
|
|
|
*/
|
|
|
|
|
|
|
|
alen = 0;
|
|
|
|
for (j=0; j<blen && alen==0; j++) {
|
|
|
|
if (buf[j] & 0x01) {
|
|
|
|
alen = j + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (alen % 7 != 0) {
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
2015-07-27 01:17:23 +00:00
|
|
|
dw_printf ("sanity_check: FAILED. Address part length %d not multiple of 7.\n", alen);
|
2015-07-27 00:35:07 +00:00
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Need at least 2 addresses and maximum of 8 digipeaters.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (alen/7 < 2 || alen/7 > 10) {
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("sanity_check: FAILED. Too few or many addresses.\n");
|
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Addresses can contain only upper case letters, digits, and space.
|
|
|
|
*/
|
|
|
|
|
|
|
|
for (j=0; j<alen; j+=7) {
|
|
|
|
|
|
|
|
char addr[7];
|
|
|
|
|
|
|
|
addr[0] = buf[j+0] >> 1;
|
|
|
|
addr[1] = buf[j+1] >> 1;
|
|
|
|
addr[2] = buf[j+2] >> 1;
|
|
|
|
addr[3] = buf[j+3] >> 1;
|
|
|
|
addr[4] = buf[j+4] >> 1;
|
|
|
|
addr[5] = buf[j+5] >> 1;
|
|
|
|
addr[6] = '\0';
|
|
|
|
|
|
|
|
|
|
|
|
if ( (! isupper(addr[0]) && ! isdigit(addr[0])) ||
|
|
|
|
(! isupper(addr[1]) && ! isdigit(addr[1]) && addr[1] != ' ') ||
|
|
|
|
(! isupper(addr[2]) && ! isdigit(addr[2]) && addr[2] != ' ') ||
|
|
|
|
(! isupper(addr[3]) && ! isdigit(addr[3]) && addr[3] != ' ') ||
|
|
|
|
(! isupper(addr[4]) && ! isdigit(addr[4]) && addr[4] != ' ') ||
|
|
|
|
(! isupper(addr[5]) && ! isdigit(addr[5]) && addr[5] != ' ')) {
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("sanity_check: FAILED. Invalid characters in addresses \"%s\"\n", addr);
|
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* That's good enough for the AX.25 sanity check.
|
|
|
|
* Continue below for additional APRS checking.
|
|
|
|
*/
|
|
|
|
if (sanity_test == SANITY_AX25) {
|
|
|
|
return (1);
|
|
|
|
}
|
|
|
|
|
2015-07-27 00:35:07 +00:00
|
|
|
/*
|
|
|
|
* The next two bytes should be 0x03 and 0xf0 for APRS.
|
|
|
|
*/
|
|
|
|
|
2015-07-27 01:17:23 +00:00
|
|
|
if (buf[alen] != 0x03 || buf[alen+1] != 0xf0) {
|
|
|
|
return (0);
|
|
|
|
}
|
2015-07-27 00:35:07 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Finally, look for bogus characters in the information part.
|
|
|
|
* In theory, the bytes could have any values.
|
|
|
|
* In practice, we find only printable ASCII characters and:
|
|
|
|
*
|
|
|
|
* 0x0a line feed
|
|
|
|
* 0x0d carriage return
|
|
|
|
* 0x1c MIC-E
|
|
|
|
* 0x1d MIC-E
|
|
|
|
* 0x1e MIC-E
|
|
|
|
* 0x1f MIC-E
|
|
|
|
* 0x7f MIC-E
|
|
|
|
* 0x80 "{UIV32N}<0x0d><0x9f><0x80>"
|
|
|
|
* 0x9f "{UIV32N}<0x0d><0x9f><0x80>"
|
|
|
|
* 0xb0 degree symbol, ISO LATIN1
|
|
|
|
* (Note: UTF-8 uses two byte sequence 0xc2 0xb0.)
|
|
|
|
* 0xbe invalid MIC-E encoding.
|
|
|
|
* 0xf8 degree symbol, Microsoft code page 437
|
|
|
|
*
|
|
|
|
* So, if we have something other than these (in English speaking countries!),
|
|
|
|
* chances are that we have bogus data from twiddling the wrong bits.
|
|
|
|
*
|
|
|
|
* Notice that we shouldn't get here for good packets. This extra level
|
|
|
|
* of checking happens only if we twiddled a couple of bits, possibly
|
|
|
|
* creating bad data. We want to be very fussy.
|
|
|
|
*/
|
|
|
|
|
|
|
|
for (j=alen+2; j<blen; j++) {
|
|
|
|
int ch = buf[j];
|
|
|
|
|
|
|
|
if ( ! (( ch >= 0x1c && ch <= 0x7f)
|
|
|
|
|| ch == 0x0a
|
|
|
|
|| ch == 0x0d
|
|
|
|
|| ch == 0x80
|
|
|
|
|| ch == 0x9f
|
2015-07-27 01:17:23 +00:00
|
|
|
|| ch == 0xc2
|
2015-07-27 00:35:07 +00:00
|
|
|
|| ch == 0xb0
|
|
|
|
|| ch == 0xf8) ) {
|
|
|
|
#if DEBUGx
|
|
|
|
text_color_set(DW_COLOR_ERROR);
|
|
|
|
dw_printf ("sanity_check: FAILED. Probably bogus info char 0x%02x\n", ch);
|
|
|
|
#endif
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* end hdlc_rec2.c */
|
|
|
|
|
|
|
|
|