 9bfb641d3e
			
		
	
	
		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>
		
			
				
	
	
		
			145 lines
		
	
	
		
			4.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			145 lines
		
	
	
		
			4.1 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
| #include "buffer_stream.h"
 | |
| #include <stream_buffer.h>
 | |
| 
 | |
| struct Buffer {
 | |
|     volatile bool occupied;
 | |
|     volatile size_t size;
 | |
|     uint8_t* data;
 | |
|     size_t max_data_size;
 | |
| };
 | |
| 
 | |
| struct BufferStream {
 | |
|     size_t stream_overrun_count;
 | |
|     StreamBufferHandle_t stream;
 | |
| 
 | |
|     size_t index;
 | |
|     Buffer* buffers;
 | |
|     size_t max_buffers_count;
 | |
| };
 | |
| 
 | |
| bool buffer_write(Buffer* buffer, const uint8_t* data, size_t size) {
 | |
|     if(buffer->occupied) {
 | |
|         return false;
 | |
|     }
 | |
|     if((buffer->size + size) > buffer->max_data_size) {
 | |
|         return false;
 | |
|     }
 | |
|     memcpy(buffer->data + buffer->size, data, size);
 | |
|     buffer->size += size;
 | |
|     return true;
 | |
| }
 | |
| 
 | |
| uint8_t* buffer_get_data(Buffer* buffer) {
 | |
|     return buffer->data;
 | |
| }
 | |
| 
 | |
| size_t buffer_get_size(Buffer* buffer) {
 | |
|     return buffer->size;
 | |
| }
 | |
| 
 | |
| void buffer_reset(Buffer* buffer) {
 | |
|     buffer->occupied = false;
 | |
|     buffer->size = 0;
 | |
| }
 | |
| 
 | |
| BufferStream* buffer_stream_alloc(size_t buffer_size, size_t buffers_count) {
 | |
|     furi_assert(buffer_size > 0);
 | |
|     furi_assert(buffers_count > 0);
 | |
|     BufferStream* buffer_stream = malloc(sizeof(BufferStream));
 | |
|     buffer_stream->max_buffers_count = buffers_count;
 | |
|     buffer_stream->buffers = malloc(sizeof(Buffer) * buffer_stream->max_buffers_count);
 | |
|     for(size_t i = 0; i < buffer_stream->max_buffers_count; i++) {
 | |
|         buffer_stream->buffers[i].occupied = false;
 | |
|         buffer_stream->buffers[i].size = 0;
 | |
|         buffer_stream->buffers[i].data = malloc(buffer_size);
 | |
|         buffer_stream->buffers[i].max_data_size = buffer_size;
 | |
|     }
 | |
|     buffer_stream->stream = xStreamBufferCreate(
 | |
|         sizeof(BufferStream*) * buffer_stream->max_buffers_count, sizeof(BufferStream*));
 | |
|     buffer_stream->stream_overrun_count = 0;
 | |
|     buffer_stream->index = 0;
 | |
| 
 | |
|     return buffer_stream;
 | |
| }
 | |
| 
 | |
| void buffer_stream_free(BufferStream* buffer_stream) {
 | |
|     for(size_t i = 0; i < buffer_stream->max_buffers_count; i++) {
 | |
|         free(buffer_stream->buffers[i].data);
 | |
|     }
 | |
|     vStreamBufferDelete(buffer_stream->stream);
 | |
|     free(buffer_stream->buffers);
 | |
|     free(buffer_stream);
 | |
| }
 | |
| 
 | |
| static inline int8_t buffer_stream_get_free_buffer(BufferStream* buffer_stream) {
 | |
|     int8_t id = -1;
 | |
|     for(size_t i = 0; i < buffer_stream->max_buffers_count; i++) {
 | |
|         if(buffer_stream->buffers[i].occupied == false) {
 | |
|             id = i;
 | |
|             break;
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     return id;
 | |
| }
 | |
| 
 | |
| bool buffer_stream_send_from_isr(
 | |
|     BufferStream* buffer_stream,
 | |
|     const uint8_t* data,
 | |
|     size_t size,
 | |
|     BaseType_t* const task_woken) {
 | |
|     Buffer* buffer = &buffer_stream->buffers[buffer_stream->index];
 | |
|     bool result = true;
 | |
| 
 | |
|     // write to buffer
 | |
|     if(!buffer_write(buffer, data, size)) {
 | |
|         // if buffer is full - send it
 | |
|         buffer->occupied = true;
 | |
|         // we always have space for buffer in stream
 | |
|         xStreamBufferSendFromISR(buffer_stream->stream, &buffer, sizeof(Buffer*), task_woken);
 | |
| 
 | |
|         // get new buffer from the pool
 | |
|         int8_t index = buffer_stream_get_free_buffer(buffer_stream);
 | |
| 
 | |
|         // check that we have valid buffer
 | |
|         if(index == -1) {
 | |
|             // no free buffer
 | |
|             buffer_stream->stream_overrun_count++;
 | |
|             result = false;
 | |
|         } else {
 | |
|             // write to new buffer
 | |
|             buffer_stream->index = index;
 | |
|             buffer = &buffer_stream->buffers[buffer_stream->index];
 | |
|             buffer_write(buffer, data, size);
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     return result;
 | |
| }
 | |
| 
 | |
| Buffer* buffer_stream_receive(BufferStream* buffer_stream, TickType_t timeout) {
 | |
|     Buffer* buffer;
 | |
|     size_t size = xStreamBufferReceive(buffer_stream->stream, &buffer, sizeof(Buffer*), timeout);
 | |
| 
 | |
|     if(size == sizeof(Buffer*)) {
 | |
|         return buffer;
 | |
|     } else {
 | |
|         return NULL;
 | |
|     }
 | |
| }
 | |
| 
 | |
| size_t buffer_stream_get_overrun_count(BufferStream* buffer_stream) {
 | |
|     return buffer_stream->stream_overrun_count;
 | |
| }
 | |
| 
 | |
| void buffer_stream_reset(BufferStream* buffer_stream) {
 | |
|     FURI_CRITICAL_ENTER();
 | |
|     BaseType_t xReturn = xStreamBufferReset(buffer_stream->stream);
 | |
|     furi_assert(xReturn == pdPASS);
 | |
|     UNUSED(xReturn);
 | |
|     buffer_stream->stream_overrun_count = 0;
 | |
|     for(size_t i = 0; i < buffer_stream->max_buffers_count; i++) {
 | |
|         buffer_reset(&buffer_stream->buffers[i]);
 | |
|     }
 | |
|     FURI_CRITICAL_EXIT();
 | |
| } |