WIP cryptographic design
This commit is contained in:
parent
b0a5232487
commit
6880468862
9 changed files with 292 additions and 6 deletions
|
|
@ -248,7 +248,6 @@ void group_received(struct dsss_demod_state *st) {
|
|||
|
||||
/* If we found empty entries, replace one by a new decoding starting at this group */
|
||||
if (empty_idx >= 0) {
|
||||
DEBUG_PRINT("Writing to %zd", empty_idx);
|
||||
assert(0 <= empty_idx && empty_idx < DSSS_MATCHER_CACHE_SIZE);
|
||||
st->matcher_cache[empty_idx].last_phase = group_phase;
|
||||
st->matcher_cache[empty_idx].candidate_score = base_score;
|
||||
|
|
@ -261,7 +260,6 @@ void group_received(struct dsss_demod_state *st) {
|
|||
|
||||
/* If the weakest decoding in cache is weaker than a new decoding starting here, replace it */
|
||||
} else if (min_score < base_score && min_idx >= 0) {
|
||||
DEBUG_PRINT("Writing to %zd", min_idx);
|
||||
assert(0 <= min_idx && min_idx < DSSS_MATCHER_CACHE_SIZE);
|
||||
st->matcher_cache[min_idx].last_phase = group_phase;
|
||||
st->matcher_cache[min_idx].candidate_score = base_score;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue