mirror of
https://github.com/DarkFlippers/unleashed-firmware
synced 2024-12-16 16:02:39 +00:00
9bfb641d3e
* Makefile: unit tests pack * RFID: pulse joiner and its unit test * Move pulse protocol helpers to appropriate place * Drop pulse_joiner tests * Generic protocol, protocols dictionary, unit test * Protocol dict unit test * iButton: protocols dictionary * Lib: varint * Lib: profiler * Unit test: varint * rfid: worker mockup * LFRFID: em4100 unit test * Storage: file_exist function * rfid: fsk osc * rfid: generic fsk demodulator * rfid: protocol em4100 * rfid: protocol h10301 * rfid: protocol io prox xsf * Unit test: rfid protocols * rfid: new hal * rfid: raw worker * Unit test: fix error output * rfid: worker * rfid: plain c cli * fw: migrate to scons * lfrfid: full io prox support * unit test: io prox protocol * SubGHZ: move bit defines to source * FSK oscillator: level duration compability * libs: bit manipulation library * lfrfid: ioprox protocol, use bit library and new level duration method of FSK ocillator * bit lib: unit tests * Bit lib: parity tests, remove every nth bit, copy bits * Lfrfid: awid protocol * bit lib: uint16 and uint32 getters, unit tests * lfrfid: FDX-B read, draft version * Minunit: better memeq assert * bit lib: reverse, print, print regions * Protocol dict: get protocol features, get protocol validate count * lfrfid worker: improved read * lfrfid raw worker: psk support * Cli: rfid plain C cli * protocol AWID: render * protocol em4100: render * protocol h10301: render * protocol indala26: support every indala 26 scramble * Protocol IO Prox: render * Protocol FDX-B: advanced read * lfrfid: remove unused test function * lfrfid: fix os primitives * bit lib: crc16 and unit tests * FDX-B: save data * lfrfid worker: increase stream size. Alloc raw worker only when needed. * lfrfid: indala26 emulation * lfrfid: prepare to write * lfrfid: fdx-b emulation * lfrfid: awid, ioprox write * lfrfid: write t55xx w\o validation * lfrfid: better t55xx block0 handling * lfrfid: use new t5577 functions in worker * lfrfid: improve protocol description * lfrfid: write and verify * lfrfid: delete cpp cli * lfrfid: improve worker usage * lfrfid-app: step to new worker * lfrfid: old indala (I40134) load fallback * lfrfid: indala26, recover wrong synced data * lfrfid: remove old worker * lfrfid app: dummy read screen * lfrfid app: less dummy read screen * lfrfid: generic 96-bit HID protocol (covers up to HID 37-bit) * rename * lfrfid: improve indala26 read * lfrfid: generic 192-bit HID protocol (covers all HID extended) * lfrfid: TODO about HID render * lfrfid: new protocol FDX-A * lfrfid-app: correct worker stop on exit * misc fixes * lfrfid: FDX-A and HID distinguishability has been fixed. * lfrfid: decode HID size header and render it (#1612) * lfrfid: rename HID96 and HID192 to HIDProx and HIDExt * lfrfid: extra actions scene * lfrfid: decode generic HID Proximity size lazily (#1618) * lib: stream of data buffers concept * lfrfid: raw file helper * lfrfid: changed raw worker api * lfrfid: packed varint pair * lfrfid: read stream speedup * lfrfid app: show read mode * Documentation * lfrfid app: raw read gui * lfrfid app: storage check for raw read * memleak fix * review fixes * lfrfid app: read blink color * lfrfid app: reset key name after read * review fixes * lfrfid app: fix copypasted text * review fixes * lfrfid: disable debug gpio * lfrfid: card detection events * lfrfid: change validation color from magenta to green * Update core_defines. * lfrfid: prefix fdx-b id by zeroes * lfrfid: parse up to 43-bit HID Proximity keys (#1640) * Fbt: downgrade toolchain and fix PS1 * lfrfid: fix unit tests * lfrfid app: remove printf * lfrfid: indala26, use bit 55 as data * lfrfid: indala26, better brief format * lfrfid: indala26, loading fallback * lfrfid: read timing tuning Co-authored-by: James Ide <ide@users.noreply.github.com> Co-authored-by: あく <alleteam@gmail.com>
117 lines
No EOL
3.3 KiB
C
117 lines
No EOL
3.3 KiB
C
#include "pulse_joiner.h"
|
|
#include <furi.h>
|
|
|
|
#define PULSE_MAX_COUNT 6
|
|
|
|
typedef struct {
|
|
bool polarity;
|
|
uint16_t time;
|
|
} Pulse;
|
|
|
|
struct PulseJoiner {
|
|
size_t pulse_index;
|
|
Pulse pulses[PULSE_MAX_COUNT];
|
|
};
|
|
|
|
PulseJoiner* pulse_joiner_alloc() {
|
|
PulseJoiner* pulse_joiner = malloc(sizeof(PulseJoiner));
|
|
|
|
pulse_joiner->pulse_index = 0;
|
|
for(uint8_t i = 0; i < PULSE_MAX_COUNT; i++) {
|
|
pulse_joiner->pulses[i].polarity = false;
|
|
pulse_joiner->pulses[i].time = 0;
|
|
}
|
|
|
|
return pulse_joiner;
|
|
}
|
|
|
|
void pulse_joiner_free(PulseJoiner* pulse_joiner) {
|
|
free(pulse_joiner);
|
|
}
|
|
|
|
bool pulse_joiner_push_pulse(PulseJoiner* pulse_joiner, bool polarity, size_t period, size_t pulse) {
|
|
bool result = false;
|
|
furi_check((pulse_joiner->pulse_index + 1) < PULSE_MAX_COUNT);
|
|
|
|
if(polarity == false && pulse_joiner->pulse_index == 0) {
|
|
// first negative pulse is omitted
|
|
|
|
} else {
|
|
pulse_joiner->pulses[pulse_joiner->pulse_index].polarity = polarity;
|
|
pulse_joiner->pulses[pulse_joiner->pulse_index].time = pulse;
|
|
pulse_joiner->pulse_index++;
|
|
}
|
|
|
|
if(period > pulse) {
|
|
pulse_joiner->pulses[pulse_joiner->pulse_index].polarity = !polarity;
|
|
pulse_joiner->pulses[pulse_joiner->pulse_index].time = period - pulse;
|
|
pulse_joiner->pulse_index++;
|
|
}
|
|
|
|
if(pulse_joiner->pulse_index >= 4) {
|
|
// we know that first pulse is always high
|
|
// so we wait 2 edges, hi2low and next low2hi
|
|
|
|
uint8_t edges_count = 0;
|
|
bool last_polarity = pulse_joiner->pulses[0].polarity;
|
|
|
|
for(uint8_t i = 1; i < pulse_joiner->pulse_index; i++) {
|
|
if(pulse_joiner->pulses[i].polarity != last_polarity) {
|
|
edges_count++;
|
|
last_polarity = pulse_joiner->pulses[i].polarity;
|
|
}
|
|
}
|
|
|
|
if(edges_count >= 2) {
|
|
result = true;
|
|
}
|
|
}
|
|
|
|
return result;
|
|
}
|
|
|
|
void pulse_joiner_pop_pulse(PulseJoiner* pulse_joiner, size_t* period, size_t* pulse) {
|
|
furi_check(pulse_joiner->pulse_index <= (PULSE_MAX_COUNT + 1));
|
|
|
|
uint16_t tmp_period = 0;
|
|
uint16_t tmp_pulse = 0;
|
|
uint8_t edges_count = 0;
|
|
bool last_polarity = pulse_joiner->pulses[0].polarity;
|
|
uint8_t next_fist_pulse = 0;
|
|
|
|
for(uint8_t i = 0; i < PULSE_MAX_COUNT; i++) {
|
|
// count edges
|
|
if(pulse_joiner->pulses[i].polarity != last_polarity) {
|
|
edges_count++;
|
|
last_polarity = pulse_joiner->pulses[i].polarity;
|
|
}
|
|
|
|
// wait for 2 edges
|
|
if(edges_count == 2) {
|
|
next_fist_pulse = i;
|
|
break;
|
|
}
|
|
|
|
// sum pulse time
|
|
if(pulse_joiner->pulses[i].polarity) {
|
|
tmp_period += pulse_joiner->pulses[i].time;
|
|
tmp_pulse += pulse_joiner->pulses[i].time;
|
|
} else {
|
|
tmp_period += pulse_joiner->pulses[i].time;
|
|
}
|
|
pulse_joiner->pulse_index--;
|
|
}
|
|
|
|
*period = tmp_period;
|
|
*pulse = tmp_pulse;
|
|
|
|
// remove counted periods and shift data
|
|
for(uint8_t i = 0; i < PULSE_MAX_COUNT; i++) {
|
|
if((next_fist_pulse + i) < PULSE_MAX_COUNT) {
|
|
pulse_joiner->pulses[i].polarity = pulse_joiner->pulses[next_fist_pulse + i].polarity;
|
|
pulse_joiner->pulses[i].time = pulse_joiner->pulses[next_fist_pulse + i].time;
|
|
} else {
|
|
break;
|
|
}
|
|
}
|
|
} |