mirror of
https://github.com/hathach/tinyusb.git
synced 2026-03-01 13:12:32 +00:00
fix more alerts
This commit is contained in:
@ -10,6 +10,7 @@
|
||||
//-V::2520 [MISRA-C-16.3] Every switch-clause should be terminated by an unconditional 'break' statement
|
||||
//-V:memcpy:2547 [MISRA-C-17.7] The return value of non-void function 'memcpy' should be used.
|
||||
//-V:memmove:2547 [MISRA-C-17.7] The return value of non-void function 'memmove' should be used.
|
||||
//-V:printf:2547 [MISRA-C-17.7]
|
||||
//-V::2584::{gintsts} dwc2
|
||||
//-V::2600 [MISRA-C-21.6] The function with the 'printf' name should not be used.
|
||||
//+V2614 DISABLE_LENGHT_LIMIT_CHECK:YES
|
||||
|
||||
@ -87,5 +87,6 @@ SpacesInAngles: false
|
||||
SpacesInConditionalStatement: false
|
||||
SpacesInCStyleCastParentheses: false
|
||||
SpacesInParentheses: false
|
||||
SortIncludes: false
|
||||
TabWidth: 2
|
||||
...
|
||||
|
||||
3
.github/workflows/static_analysis.yml
vendored
3
.github/workflows/static_analysis.yml
vendored
@ -118,13 +118,14 @@ jobs:
|
||||
sudo apt update
|
||||
sudo apt install pvs-studio
|
||||
pvs-studio-analyzer credentials ${{ secrets.PVS_STUDIO_CREDENTIALS }}
|
||||
pvs-studio-analyzer --version
|
||||
|
||||
- name: Analyze
|
||||
run: |
|
||||
mkdir -p build
|
||||
cmake examples -B build -G Ninja -DBOARD=${{ matrix.board }} -DCMAKE_BUILD_TYPE=MinSizeRel
|
||||
cmake --build build
|
||||
pvs-studio-analyzer analyze -R .PVS-Studio/.pvsconfig -f build/compile_commands.json --exclude-path hw/mcu/ --exclude-path lib/ -j
|
||||
pvs-studio-analyzer analyze -f build/compile_commands.json -R .PVS-Studio/.pvsconfig -j4 --security-related-issues --misra-cpp-version 2008 --misra-c-version 2023 --use-old-parser -e lib/ -e hw/mcu/ -e */iar/cxarm/ -e pico-sdk/
|
||||
plog-converter -t sarif -o pvs-studio-${{ matrix.board }}.sarif PVS-Studio.log
|
||||
|
||||
- name: Upload SARIF
|
||||
|
||||
@ -48,7 +48,7 @@ void tud_cdc_rx_cb(uint8_t itf) {
|
||||
// connected() check for DTR bit
|
||||
// Most but not all terminal client set this when making connection
|
||||
if (tud_cdc_connected()) {
|
||||
if (tud_cdc_available()) {
|
||||
if (tud_cdc_available() > 0) {
|
||||
count = tud_cdc_n_read(itf, buf, sizeof(buf));
|
||||
(void) count;
|
||||
|
||||
|
||||
@ -29,8 +29,8 @@
|
||||
* Author: Adam Dunkels <adam@sics.se>
|
||||
*
|
||||
*/
|
||||
#ifndef __CC_H__
|
||||
#define __CC_H__
|
||||
#ifndef CC_H__
|
||||
#define CC_H__
|
||||
|
||||
//#include "cpu.h"
|
||||
|
||||
@ -72,4 +72,4 @@ typedef int sys_prot_t;
|
||||
|
||||
#define LWIP_PLATFORM_ASSERT(x) do { if(!(x)) while(1); } while(0)
|
||||
|
||||
#endif /* __CC_H__ */
|
||||
#endif /* CC_H__ */
|
||||
|
||||
@ -51,7 +51,7 @@ void cdc_app_task(void) {
|
||||
for (uint8_t idx = 0; idx < CFG_TUH_CDC; idx++) {
|
||||
if (tuh_cdc_mounted(idx)) {
|
||||
// console --> cdc interfaces
|
||||
if (count) {
|
||||
if (count > 0) {
|
||||
tuh_cdc_write(idx, buf, count);
|
||||
tuh_cdc_write_flush(idx);
|
||||
}
|
||||
|
||||
@ -503,7 +503,7 @@ static bool audiod_rx_xfer_isr(uint8_t rhport, audiod_function_t* audio, uint16_
|
||||
|
||||
#if USE_LINEAR_BUFFER_RX
|
||||
// Data currently is in linear buffer, copy into EP OUT FIFO
|
||||
TU_VERIFY(tu_fifo_write_n(&audio->ep_out_ff, audio->lin_buf_out, n_bytes_received));
|
||||
TU_VERIFY(0 < tu_fifo_write_n(&audio->ep_out_ff, audio->lin_buf_out, n_bytes_received));
|
||||
|
||||
// Schedule for next receive
|
||||
TU_VERIFY(usbd_edpt_xfer(rhport, audio->ep_out, audio->lin_buf_out, audio->ep_out_sz), false);
|
||||
@ -672,8 +672,12 @@ uint32_t tud_audio_feedback_update(uint8_t func_id, uint32_t cycles) {
|
||||
// The size of isochronous packets created by the device must be within the limits specified in FMT-2.0 section 2.3.1.1.
|
||||
// This means that the deviation of actual packet size from nominal size must not exceed +/- one audio slot
|
||||
// (audio slot = channel count samples).
|
||||
if (feedback > audio->feedback.max_value) feedback = audio->feedback.max_value;
|
||||
if (feedback < audio->feedback.min_value) feedback = audio->feedback.min_value;
|
||||
if (feedback > audio->feedback.max_value) {
|
||||
feedback = audio->feedback.max_value;
|
||||
}
|
||||
if (feedback < audio->feedback.min_value) {
|
||||
feedback = audio->feedback.min_value;
|
||||
}
|
||||
|
||||
tud_audio_n_fb_set(func_id, feedback);
|
||||
|
||||
@ -714,7 +718,6 @@ void audiod_init(void) {
|
||||
|
||||
// Initialize IN EP FIFO if required
|
||||
#if CFG_TUD_AUDIO_ENABLE_EP_IN
|
||||
|
||||
switch (i) {
|
||||
#if CFG_TUD_AUDIO_FUNC_1_EP_IN_SW_BUF_SZ > 0
|
||||
case 0:
|
||||
@ -883,9 +886,11 @@ uint16_t audiod_open(uint8_t rhport, tusb_desc_interface_t const *itf_desc, uint
|
||||
|| tu_desc_type(p_desc) == TUSB_DESC_INTERFACE_ASSOCIATION) {
|
||||
break;
|
||||
} else if (tu_desc_type(p_desc) == TUSB_DESC_INTERFACE && ((tusb_desc_interface_t const *) p_desc)->bInterfaceSubClass == AUDIO_SUBCLASS_STREAMING) {
|
||||
if (_audiod_fct[i].p_desc_as == 0) {
|
||||
if (_audiod_fct[i].p_desc_as == NULL) {
|
||||
_audiod_fct[i].p_desc_as = p_desc;
|
||||
}
|
||||
} else {
|
||||
// nothing to do
|
||||
}
|
||||
total_len += p_desc[0];
|
||||
p_desc = tu_desc_next(p_desc);
|
||||
@ -957,19 +962,19 @@ uint16_t audiod_open(uint8_t rhport, tusb_desc_interface_t const *itf_desc, uint
|
||||
}
|
||||
|
||||
#if CFG_TUD_AUDIO_ENABLE_EP_IN
|
||||
if (ep_in) {
|
||||
if (ep_in != 0) {
|
||||
usbd_edpt_iso_alloc(rhport, ep_in, ep_in_size);
|
||||
}
|
||||
#endif
|
||||
|
||||
#if CFG_TUD_AUDIO_ENABLE_EP_OUT
|
||||
if (ep_out) {
|
||||
if (ep_out != 0) {
|
||||
usbd_edpt_iso_alloc(rhport, ep_out, ep_out_size);
|
||||
}
|
||||
#endif
|
||||
|
||||
#if CFG_TUD_AUDIO_ENABLE_FEEDBACK_EP
|
||||
if (ep_fb) {
|
||||
if (ep_fb != 0) {
|
||||
usbd_edpt_iso_alloc(rhport, ep_fb, 4);
|
||||
}
|
||||
#endif
|
||||
@ -998,6 +1003,8 @@ uint16_t audiod_open(uint8_t rhport, tusb_desc_interface_t const *itf_desc, uint
|
||||
if (tu_unaligned_read16(p_desc + 4) == AUDIO_TERM_TYPE_USB_STREAMING) {
|
||||
_audiod_fct[i].bclock_id_tx = p_desc[8];
|
||||
}
|
||||
} else {
|
||||
// nothing to do
|
||||
}
|
||||
p_desc = tu_desc_next(p_desc);
|
||||
}
|
||||
@ -1458,6 +1465,8 @@ bool audiod_control_xfer_cb(uint8_t rhport, uint8_t stage, tusb_control_request_
|
||||
return audiod_control_request(rhport, request);
|
||||
} else if (stage == CONTROL_STAGE_DATA) {
|
||||
return audiod_control_complete(rhport, request);
|
||||
} else {
|
||||
// nothing to do
|
||||
}
|
||||
|
||||
return true;
|
||||
@ -1633,8 +1642,12 @@ static void audiod_fb_fifo_count_update(audiod_function_t *audio, uint16_t lvl_n
|
||||
feedback = audio->feedback.compute.fifo_count.nom_value - (ff_lvl - ff_thr) * rate[1];
|
||||
}
|
||||
|
||||
if (feedback > audio->feedback.max_value) feedback = audio->feedback.max_value;
|
||||
if (feedback < audio->feedback.min_value) feedback = audio->feedback.min_value;
|
||||
if (feedback > audio->feedback.max_value) {
|
||||
feedback = audio->feedback.max_value;
|
||||
}
|
||||
if (feedback < audio->feedback.min_value) {
|
||||
feedback = audio->feedback.min_value;
|
||||
}
|
||||
audio->feedback.value = feedback;
|
||||
}
|
||||
|
||||
@ -1754,7 +1767,7 @@ static bool audiod_verify_entity_exists(uint8_t itf, uint8_t entityID, uint8_t *
|
||||
static bool audiod_verify_itf_exists(uint8_t itf, uint8_t *func_id) {
|
||||
uint8_t i;
|
||||
for (i = 0; i < CFG_TUD_AUDIO; i++) {
|
||||
if (_audiod_fct[i].p_desc) {
|
||||
if (_audiod_fct[i].p_desc != NULL) {
|
||||
// Get pointer at beginning and end
|
||||
uint8_t const *p_desc = _audiod_fct[i].p_desc;
|
||||
uint8_t const *p_desc_end = _audiod_fct[i].p_desc + _audiod_fct[i].desc_length;
|
||||
|
||||
@ -602,7 +602,7 @@ bool tuh_cdc_set_line_coding(uint8_t idx, cdc_line_coding_t const *line_coding,
|
||||
p_cdc->requested_line.coding = *line_coding;
|
||||
p_cdc->user_complete_cb = complete_cb;
|
||||
|
||||
if (driver->set_line_coding) {
|
||||
if (driver->set_line_coding != NULL) {
|
||||
// driver support set_line_coding request
|
||||
TU_VERIFY(driver->set_line_coding(p_cdc, complete_cb ? cdch_internal_control_complete : NULL, user_data));
|
||||
|
||||
@ -611,7 +611,7 @@ bool tuh_cdc_set_line_coding(uint8_t idx, cdc_line_coding_t const *line_coding,
|
||||
}
|
||||
} else {
|
||||
// driver does not support set_line_coding and need 2 stage to set baudrate and data format separately
|
||||
if (complete_cb) {
|
||||
if (complete_cb != NULL) {
|
||||
// non-blocking
|
||||
TU_VERIFY(driver->set_baudrate(p_cdc, cdch_set_line_coding_stage1_baudrate_complete, user_data));
|
||||
} else {
|
||||
@ -619,7 +619,7 @@ bool tuh_cdc_set_line_coding(uint8_t idx, cdc_line_coding_t const *line_coding,
|
||||
xfer_result_t result = XFER_RESULT_INVALID;
|
||||
|
||||
TU_VERIFY(driver->set_baudrate(p_cdc, NULL, (uintptr_t) &result));
|
||||
if (user_data) {
|
||||
if (user_data != 0) {
|
||||
*((xfer_result_t *) user_data) = result;
|
||||
}
|
||||
TU_VERIFY(result == XFER_RESULT_SUCCESS);
|
||||
@ -627,7 +627,7 @@ bool tuh_cdc_set_line_coding(uint8_t idx, cdc_line_coding_t const *line_coding,
|
||||
|
||||
result = XFER_RESULT_INVALID;
|
||||
TU_VERIFY(driver->set_data_format(p_cdc, NULL, (uintptr_t) &result));
|
||||
if (user_data) {
|
||||
if (user_data != 0) {
|
||||
*((xfer_result_t *) user_data) = result;
|
||||
}
|
||||
TU_VERIFY(result == XFER_RESULT_SUCCESS);
|
||||
@ -777,6 +777,8 @@ bool cdch_open(uint8_t rhport, uint8_t daddr, tusb_desc_interface_t const *itf_d
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
// not supported class
|
||||
}
|
||||
|
||||
return false;
|
||||
@ -894,7 +896,7 @@ static void cdch_internal_control_complete(tuh_xfer_t *xfer) {
|
||||
|
||||
// Invoke application callback
|
||||
xfer->complete_cb = p_cdc->user_complete_cb;
|
||||
if (xfer->complete_cb) {
|
||||
if (xfer->complete_cb != NULL) {
|
||||
xfer->complete_cb(xfer);
|
||||
}
|
||||
}
|
||||
@ -910,7 +912,7 @@ static void cdch_set_line_coding_stage1_baudrate_complete(tuh_xfer_t *xfer) {
|
||||
TU_ASSERT(driver->set_data_format(p_cdc, cdch_set_line_coding_stage2_data_format_complete, xfer->user_data),);
|
||||
} else {
|
||||
xfer->complete_cb = p_cdc->user_complete_cb;
|
||||
if (xfer->complete_cb) {
|
||||
if (xfer->complete_cb != NULL) {
|
||||
xfer->complete_cb(xfer);
|
||||
}
|
||||
}
|
||||
@ -926,7 +928,7 @@ static void cdch_set_line_coding_stage2_data_format_complete(tuh_xfer_t *xfer) {
|
||||
}
|
||||
|
||||
xfer->complete_cb = p_cdc->user_complete_cb;
|
||||
if (xfer->complete_cb) {
|
||||
if (xfer->complete_cb != NULL) {
|
||||
xfer->complete_cb(xfer);
|
||||
}
|
||||
}
|
||||
@ -950,12 +952,12 @@ static void acm_internal_control_complete(cdch_interface_t *p_cdc, tuh_xfer_t *x
|
||||
break;
|
||||
|
||||
default:
|
||||
break;
|
||||
break; // unknown request
|
||||
}
|
||||
}
|
||||
|
||||
static bool acm_set_control_line_state(cdch_interface_t *p_cdc, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
TU_VERIFY(p_cdc->acm.capability.support_line_request);
|
||||
TU_VERIFY(p_cdc->acm.capability.support_line_request != 0);
|
||||
|
||||
const tusb_control_request_t request = {
|
||||
.bmRequestType_bit = {
|
||||
@ -982,7 +984,7 @@ static bool acm_set_control_line_state(cdch_interface_t *p_cdc, tuh_xfer_cb_t co
|
||||
}
|
||||
|
||||
static bool acm_set_line_coding(cdch_interface_t *p_cdc, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
TU_VERIFY(p_cdc->acm.capability.support_line_request);
|
||||
TU_VERIFY(p_cdc->acm.capability.support_line_request != 0);
|
||||
TU_VERIFY((p_cdc->requested_line.coding.data_bits >= 5 && p_cdc->requested_line.coding.data_bits <= 8) ||
|
||||
p_cdc->requested_line.coding.data_bits == 16);
|
||||
|
||||
@ -1167,10 +1169,10 @@ static bool ftdi_set_data_format(cdch_interface_t *p_cdc, tuh_xfer_cb_t complete
|
||||
|
||||
static bool ftdi_set_baudrate(cdch_interface_t *p_cdc, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
uint32_t index_value = ftdi_get_divisor(p_cdc);
|
||||
TU_VERIFY(index_value);
|
||||
TU_VERIFY(index_value != 0);
|
||||
uint16_t value = (uint16_t) index_value;
|
||||
uint16_t index = (uint16_t) (index_value >> 16);
|
||||
if (p_cdc->ftdi.channel) {
|
||||
if (p_cdc->ftdi.channel != 0) {
|
||||
index = (uint16_t) ((index << 8) | p_cdc->ftdi.channel);
|
||||
}
|
||||
|
||||
@ -1372,6 +1374,8 @@ static uint32_t ftdi_232bm_baud_base_to_divisor(uint32_t baud, uint32_t base) {
|
||||
divisor = 0;
|
||||
} else if (divisor == 0x4001) /* 1.5 */ {
|
||||
divisor = 1;
|
||||
} else {
|
||||
// nothing to do
|
||||
}
|
||||
return divisor;
|
||||
}
|
||||
@ -1395,12 +1399,13 @@ static uint32_t ftdi_2232h_baud_base_to_divisor(uint32_t baud, uint32_t base) {
|
||||
divisor = 0;
|
||||
} else if (divisor == 0x4001) /* 1.5 */ {
|
||||
divisor = 1;
|
||||
} else {
|
||||
// nothing to do
|
||||
}
|
||||
/*
|
||||
* Set this bit to turn off a divide by 2.5 on baud rate generator
|
||||
|
||||
/* Set this bit to turn off a divide by 2.5 on baud rate generator
|
||||
* This enables baud rates up to 12Mbaud but cannot reach below 1200
|
||||
* baud with this bit set
|
||||
*/
|
||||
* baud with this bit set */
|
||||
divisor |= 0x00020000;
|
||||
return divisor;
|
||||
}
|
||||
@ -1412,7 +1417,7 @@ static inline uint32_t ftdi_2232h_baud_to_divisor(uint32_t baud) {
|
||||
static inline uint32_t ftdi_get_divisor(cdch_interface_t *p_cdc) {
|
||||
uint32_t baud = p_cdc->requested_line.coding.bit_rate;
|
||||
uint32_t div_value = 0;
|
||||
TU_VERIFY(baud);
|
||||
TU_VERIFY(baud != 0);
|
||||
|
||||
switch (p_cdc->ftdi.chip_type) {
|
||||
case FTDI_UNKNOWN:
|
||||
@ -1552,7 +1557,8 @@ static void cp210x_internal_control_complete(cdch_interface_t *p_cdc, tuh_xfer_t
|
||||
p_cdc->line.coding.bit_rate = p_cdc->requested_line.coding.bit_rate;
|
||||
break;
|
||||
|
||||
default: break;
|
||||
default:
|
||||
break; // unsupported request
|
||||
}
|
||||
}
|
||||
|
||||
@ -1713,7 +1719,8 @@ static void ch34x_internal_control_complete(cdch_interface_t *p_cdc, tuh_xfer_t
|
||||
p_cdc->line.coding.data_bits = p_cdc->requested_line.coding.data_bits;
|
||||
break;
|
||||
|
||||
default: break;
|
||||
default:
|
||||
break; // unsupported
|
||||
}
|
||||
break;
|
||||
|
||||
@ -1721,19 +1728,20 @@ static void ch34x_internal_control_complete(cdch_interface_t *p_cdc, tuh_xfer_t
|
||||
p_cdc->line.control_state = p_cdc->requested_line.control_state;
|
||||
break;
|
||||
|
||||
default: break;
|
||||
default:
|
||||
break; // unsupported request
|
||||
}
|
||||
}
|
||||
|
||||
static bool ch34x_set_data_format(cdch_interface_t *p_cdc, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
const uint8_t lcr = ch34x_get_lcr(p_cdc);
|
||||
TU_VERIFY(lcr);
|
||||
TU_VERIFY(lcr > 0);
|
||||
return ch34x_write_reg(p_cdc, CH32X_REG16_LCR2_LCR, lcr, complete_cb, user_data);
|
||||
}
|
||||
|
||||
static bool ch34x_set_baudrate(cdch_interface_t *p_cdc, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
const uint16_t div_ps = ch34x_get_divisor_prescaler(p_cdc);
|
||||
TU_VERIFY(div_ps);
|
||||
TU_VERIFY(div_ps > 0);
|
||||
return ch34x_write_reg(p_cdc, CH34X_REG16_DIVISOR_PRESCALER, div_ps, complete_cb, user_data);
|
||||
}
|
||||
|
||||
@ -1916,7 +1924,8 @@ static uint8_t ch34x_get_lcr(cdch_interface_t *p_cdc) {
|
||||
lcr |= CH34X_LCR_ENABLE_PAR | CH34X_LCR_MARK_SPACE | CH34X_LCR_PAR_EVEN;
|
||||
break;
|
||||
|
||||
default: break;
|
||||
default:
|
||||
break; // invalid parity
|
||||
}
|
||||
|
||||
// 1.5 stop bits not supported
|
||||
@ -1999,13 +2008,15 @@ static inline bool pl2303_supports_hx_status(cdch_interface_t *p_cdc, tuh_xfer_c
|
||||
// return pl2303_set_request(p_cdc, PL2303_BREAK_REQUEST, PL2303_BREAK_REQUEST_TYPE, state, 0, NULL, 0);
|
||||
//}
|
||||
|
||||
static inline int pl2303_clear_halt(cdch_interface_t *p_cdc, uint8_t endp, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
static inline bool
|
||||
pl2303_clear_halt(cdch_interface_t *p_cdc, uint8_t endp, tuh_xfer_cb_t complete_cb, uintptr_t user_data) {
|
||||
/* we don't care if it wasn't halted first. in fact some devices
|
||||
* (like some ibmcam model 1 units) seem to expect hosts to make
|
||||
* this request for iso endpoints, which can't halt!
|
||||
*/
|
||||
return pl2303_set_request(p_cdc, TUSB_REQ_CLEAR_FEATURE, PL2303_CLEAR_HALT_REQUEST_TYPE, TUSB_REQ_FEATURE_EDPT_HALT, endp,
|
||||
NULL, 0, complete_cb, user_data);
|
||||
return pl2303_set_request(
|
||||
p_cdc, TUSB_REQ_CLEAR_FEATURE, PL2303_CLEAR_HALT_REQUEST_TYPE, TUSB_REQ_FEATURE_EDPT_HALT, endp, NULL, 0,
|
||||
complete_cb, user_data);
|
||||
}
|
||||
|
||||
//------------- Driver API -------------//
|
||||
@ -2130,10 +2141,9 @@ static bool pl2303_process_set_config(cdch_interface_t *p_cdc, tuh_xfer_t *xfer)
|
||||
if (type == PL2303_TYPE_NEED_SUPPORTS_HX_STATUS) {
|
||||
TU_ASSERT(pl2303_supports_hx_status(p_cdc, cdch_process_set_config, CONFIG_PL2303_READ1));
|
||||
break;
|
||||
} else {
|
||||
// no transfer triggered and continue with CONFIG_PL2303_READ1
|
||||
TU_ATTR_FALLTHROUGH;
|
||||
}
|
||||
// no transfer triggered and continue with CONFIG_PL2303_READ1
|
||||
TU_ATTR_FALLTHROUGH;
|
||||
|
||||
case CONFIG_PL2303_READ1:
|
||||
// get supports_hx_status, type and quirks (step 2), do special read
|
||||
@ -2378,10 +2388,12 @@ static pl2303_type_t pl2303_detect_type(cdch_interface_t *p_cdc, uint8_t step) {
|
||||
return PL2303_TYPE_HXN;
|
||||
|
||||
default:
|
||||
break;
|
||||
break; // unknown device
|
||||
}
|
||||
break;
|
||||
default: break;
|
||||
|
||||
default:
|
||||
break; // unknown device
|
||||
}
|
||||
|
||||
TU_LOG_CDC(p_cdc, "unknown device type bcdUSB = 0x%04x", desc_dev.bcdUSB);
|
||||
@ -2443,8 +2455,9 @@ static uint32_t pl2303_encode_baud_rate_divisor(uint8_t buf[PL2303_LINE_CODING_B
|
||||
*/
|
||||
baseline = 12000000 * 32;
|
||||
mantissa = baseline / baud;
|
||||
if (mantissa == 0)
|
||||
if (mantissa == 0) {
|
||||
mantissa = 1; /* Avoid dividing by zero if baud > 32 * 12M. */
|
||||
}
|
||||
exponent = 0;
|
||||
while (mantissa >= 512) {
|
||||
if (exponent < 7) {
|
||||
@ -2516,7 +2529,7 @@ static bool pl2303_encode_baud_rate(cdch_interface_t *p_cdc, uint8_t buf[PL2303_
|
||||
* Use direct method for supported baud rates, otherwise use divisors.
|
||||
* Newer chip types do not support divisor encoding.
|
||||
*/
|
||||
if (type_data->no_divisors) {
|
||||
if (type_data->no_divisors != 0) {
|
||||
baud_sup = baud;
|
||||
} else {
|
||||
baud_sup = pl2303_get_supported_baud_rate(baud);
|
||||
@ -2524,7 +2537,7 @@ static bool pl2303_encode_baud_rate(cdch_interface_t *p_cdc, uint8_t buf[PL2303_
|
||||
|
||||
if (baud == baud_sup) {
|
||||
baud = pl2303_encode_baud_rate_direct(buf, baud);
|
||||
} else if (type_data->alt_divisors) {
|
||||
} else if (type_data->alt_divisors != 0) {
|
||||
baud = pl2303_encode_baud_rate_divisor_alt(buf, baud);
|
||||
} else {
|
||||
baud = pl2303_encode_baud_rate_divisor(buf, baud);
|
||||
|
||||
@ -123,7 +123,10 @@ bool tuh_msc_mounted(uint8_t dev_addr) {
|
||||
|
||||
bool tuh_msc_ready(uint8_t dev_addr) {
|
||||
msch_interface_t* p_msc = get_itf(dev_addr);
|
||||
return p_msc->mounted && !usbh_edpt_busy(dev_addr, p_msc->ep_in) && !usbh_edpt_busy(dev_addr, p_msc->ep_out);
|
||||
TU_VERIFY(p_msc->mounted);
|
||||
const bool epin_busy = usbh_edpt_busy(dev_addr, p_msc->ep_in);
|
||||
const bool epout_busy = usbh_edpt_busy(dev_addr, p_msc->ep_out);
|
||||
return !epin_busy && !epout_busy;
|
||||
}
|
||||
|
||||
//--------------------------------------------------------------------+
|
||||
|
||||
@ -56,14 +56,14 @@ void tu_print_mem(void const *buf, uint32_t count, uint8_t indent);
|
||||
#define tu_printf CFG_TUSB_DEBUG_PRINTF
|
||||
#else
|
||||
#include <stdio.h>
|
||||
#define tu_printf printf
|
||||
#define tu_printf(...) (void) printf(__VA_ARGS__)
|
||||
#endif
|
||||
|
||||
TU_ATTR_ALWAYS_INLINE static inline void tu_print_buf(uint8_t const* buf, uint32_t bufsize) {
|
||||
for(uint32_t i=0; i<bufsize; i++) {
|
||||
(void) tu_printf("%02X ", buf[i]);
|
||||
tu_printf("%02X ", buf[i]);
|
||||
}
|
||||
(void) tu_printf("\r\n");
|
||||
tu_printf("\r\n");
|
||||
}
|
||||
|
||||
// Log with Level
|
||||
@ -72,15 +72,15 @@ TU_ATTR_ALWAYS_INLINE static inline void tu_print_buf(uint8_t const* buf, uint32
|
||||
#define TU_LOG_BUF(n, ...) TU_XSTRCAT3(TU_LOG, n, _BUF)(__VA_ARGS__)
|
||||
#define TU_LOG_INT(n, ...) TU_XSTRCAT3(TU_LOG, n, _INT)(__VA_ARGS__)
|
||||
#define TU_LOG_HEX(n, ...) TU_XSTRCAT3(TU_LOG, n, _HEX)(__VA_ARGS__)
|
||||
#define TU_LOG_LOCATION() (void) tu_printf("%s: %d:\r\n", __PRETTY_FUNCTION__, __LINE__)
|
||||
#define TU_LOG_FAILED() (void) tu_printf("%s: %d: Failed\r\n", __PRETTY_FUNCTION__, __LINE__)
|
||||
#define TU_LOG_LOCATION() tu_printf("%s: %d:\r\n", __PRETTY_FUNCTION__, __LINE__)
|
||||
#define TU_LOG_FAILED() tu_printf("%s: %d: Failed\r\n", __PRETTY_FUNCTION__, __LINE__)
|
||||
|
||||
// Log Level 1: Error
|
||||
#define TU_LOG1(...) (void) tu_printf(__VA_ARGS__)
|
||||
#define TU_LOG1 tu_printf
|
||||
#define TU_LOG1_MEM tu_print_mem
|
||||
#define TU_LOG1_BUF(_x, _n) tu_print_buf((uint8_t const*)(_x), _n)
|
||||
#define TU_LOG1_INT(_x) (void) tu_printf(#_x " = %ld\r\n", (unsigned long) (_x) )
|
||||
#define TU_LOG1_HEX(_x) (void) tu_printf(#_x " = 0x%lX\r\n", (unsigned long) (_x) )
|
||||
#define TU_LOG1_INT(_x) tu_printf(#_x " = %ld\r\n", (unsigned long) (_x) )
|
||||
#define TU_LOG1_HEX(_x) tu_printf(#_x " = 0x%lX\r\n", (unsigned long) (_x) )
|
||||
|
||||
// Log Level 2: Warn
|
||||
#if CFG_TUSB_DEBUG >= 2
|
||||
|
||||
@ -28,7 +28,7 @@
|
||||
#include "osal/osal.h"
|
||||
#include "tusb_fifo.h"
|
||||
|
||||
#define TU_FIFO_DBG 0
|
||||
#define TU_FIFO_DBG 0
|
||||
|
||||
// Suppress IAR warning
|
||||
// Warning[Pa082]: undefined behavior: the order of volatile accesses is undefined in this statement
|
||||
@ -39,13 +39,13 @@
|
||||
#if OSAL_MUTEX_REQUIRED
|
||||
|
||||
TU_ATTR_ALWAYS_INLINE static inline void _ff_lock(osal_mutex_t mutex) {
|
||||
if (mutex) {
|
||||
if (mutex != NULL) {
|
||||
osal_mutex_lock(mutex, OSAL_TIMEOUT_WAIT_FOREVER);
|
||||
}
|
||||
}
|
||||
|
||||
TU_ATTR_ALWAYS_INLINE static inline void _ff_unlock(osal_mutex_t mutex) {
|
||||
if (mutex) {
|
||||
if (mutex != NULL) {
|
||||
osal_mutex_unlock(mutex);
|
||||
}
|
||||
}
|
||||
@ -62,14 +62,13 @@ TU_ATTR_ALWAYS_INLINE static inline void _ff_unlock(osal_mutex_t mutex) {
|
||||
* copy data to and from USB hardware FIFOs as needed for e.g. STM32s and others
|
||||
*/
|
||||
typedef enum {
|
||||
TU_FIFO_COPY_INC, ///< Copy from/to an increasing source/destination address - default mode
|
||||
TU_FIFO_COPY_INC, ///< Copy from/to an increasing source/destination address - default mode
|
||||
#ifdef TUP_MEM_CONST_ADDR
|
||||
TU_FIFO_COPY_CST_FULL_WORDS, ///< Copy from/to a constant source/destination address - required for e.g. STM32 to write into USB hardware FIFO
|
||||
#endif
|
||||
} tu_fifo_copy_mode_t;
|
||||
|
||||
bool tu_fifo_config(tu_fifo_t *f, void* buffer, uint16_t depth, uint16_t item_size, bool overwritable)
|
||||
{
|
||||
bool tu_fifo_config(tu_fifo_t *f, void *buffer, uint16_t depth, uint16_t item_size, bool overwritable) {
|
||||
// Limit index space to 2*depth - this allows for a fast "modulo" calculation
|
||||
// but limits the maximum depth to 2^16/2 = 2^15 and buffer overflows are detectable
|
||||
// only if overflow happens once (important for unsupervised DMA applications)
|
||||
@ -80,9 +79,9 @@ bool tu_fifo_config(tu_fifo_t *f, void* buffer, uint16_t depth, uint16_t item_si
|
||||
_ff_lock(f->mutex_wr);
|
||||
_ff_lock(f->mutex_rd);
|
||||
|
||||
f->buffer = (uint8_t*) buffer;
|
||||
f->buffer = (uint8_t *)buffer;
|
||||
f->depth = depth;
|
||||
f->item_size = (uint16_t) (item_size & 0x7FFF);
|
||||
f->item_size = (uint16_t)(item_size & 0x7FFF);
|
||||
f->overwritable = overwritable;
|
||||
f->rd_idx = 0;
|
||||
f->wr_idx = 0;
|
||||
@ -101,18 +100,18 @@ bool tu_fifo_config(tu_fifo_t *f, void* buffer, uint16_t depth, uint16_t item_si
|
||||
// Intended to be used to read from hardware USB FIFO in e.g. STM32 where all data is read from a constant address
|
||||
// Code adapted from dcd_synopsys.c
|
||||
// TODO generalize with configurable 1 byte or 4 byte each read
|
||||
static void _ff_push_const_addr(uint8_t * ff_buf, const void * app_buf, uint16_t len) {
|
||||
volatile const uint32_t * reg_rx = (volatile const uint32_t *) app_buf;
|
||||
static void _ff_push_const_addr(uint8_t *ff_buf, const void *app_buf, uint16_t len) {
|
||||
const volatile uint32_t *reg_rx = (volatile const uint32_t *)app_buf;
|
||||
|
||||
// Reading full available 32 bit words from const app address
|
||||
uint16_t full_words = len >> 2;
|
||||
while(full_words--) {
|
||||
while (full_words--) {
|
||||
tu_unaligned_write32(ff_buf, *reg_rx);
|
||||
ff_buf += 4;
|
||||
}
|
||||
|
||||
// Read the remaining 1-3 bytes from const app address
|
||||
uint8_t const bytes_rem = len & 0x03;
|
||||
const uint8_t bytes_rem = len & 0x03;
|
||||
if (bytes_rem) {
|
||||
uint32_t tmp32 = *reg_rx;
|
||||
memcpy(ff_buf, &tmp32, bytes_rem);
|
||||
@ -121,18 +120,18 @@ static void _ff_push_const_addr(uint8_t * ff_buf, const void * app_buf, uint16_t
|
||||
|
||||
// Intended to be used to write to hardware USB FIFO in e.g. STM32
|
||||
// where all data is written to a constant address in full word copies
|
||||
static void _ff_pull_const_addr(void * app_buf, const uint8_t * ff_buf, uint16_t len) {
|
||||
volatile uint32_t * reg_tx = (volatile uint32_t *) app_buf;
|
||||
static void _ff_pull_const_addr(void *app_buf, const uint8_t *ff_buf, uint16_t len) {
|
||||
volatile uint32_t *reg_tx = (volatile uint32_t *)app_buf;
|
||||
|
||||
// Write full available 32 bit words to const address
|
||||
uint16_t full_words = len >> 2;
|
||||
while(full_words--) {
|
||||
while (full_words--) {
|
||||
*reg_tx = tu_unaligned_read32(ff_buf);
|
||||
ff_buf += 4;
|
||||
}
|
||||
|
||||
// Write the remaining 1-3 bytes into const address
|
||||
uint8_t const bytes_rem = len & 0x03;
|
||||
const uint8_t bytes_rem = len & 0x03;
|
||||
if (bytes_rem) {
|
||||
uint32_t tmp32 = 0;
|
||||
memcpy(&tmp32, ff_buf, bytes_rem);
|
||||
@ -143,32 +142,27 @@ static void _ff_pull_const_addr(void * app_buf, const uint8_t * ff_buf, uint16_t
|
||||
#endif
|
||||
|
||||
// send one item to fifo WITHOUT updating write pointer
|
||||
static inline void _ff_push(tu_fifo_t* f, void const * app_buf, uint16_t rel) {
|
||||
static inline void _ff_push(tu_fifo_t *f, const void *app_buf, uint16_t rel) {
|
||||
memcpy(f->buffer + (rel * f->item_size), app_buf, f->item_size);
|
||||
}
|
||||
|
||||
// send n items to fifo WITHOUT updating write pointer
|
||||
static void _ff_push_n(tu_fifo_t* f, void const * app_buf, uint16_t n, uint16_t wr_ptr, tu_fifo_copy_mode_t copy_mode)
|
||||
{
|
||||
uint16_t const lin_count = f->depth - wr_ptr;
|
||||
uint16_t const wrap_count = n - lin_count;
|
||||
static void _ff_push_n(tu_fifo_t *f, const void *app_buf, uint16_t n, uint16_t wr_ptr, tu_fifo_copy_mode_t copy_mode) {
|
||||
const uint16_t lin_count = f->depth - wr_ptr;
|
||||
const uint16_t wrap_count = n - lin_count;
|
||||
|
||||
uint16_t lin_bytes = lin_count * f->item_size;
|
||||
uint16_t lin_bytes = lin_count * f->item_size;
|
||||
uint16_t wrap_bytes = wrap_count * f->item_size;
|
||||
|
||||
// current buffer of fifo
|
||||
uint8_t* ff_buf = f->buffer + (wr_ptr * f->item_size);
|
||||
uint8_t *ff_buf = f->buffer + (wr_ptr * f->item_size);
|
||||
|
||||
switch (copy_mode)
|
||||
{
|
||||
switch (copy_mode) {
|
||||
case TU_FIFO_COPY_INC:
|
||||
if(n <= lin_count)
|
||||
{
|
||||
if (n <= lin_count) {
|
||||
// Linear only
|
||||
memcpy(ff_buf, app_buf, n*f->item_size);
|
||||
}
|
||||
else
|
||||
{
|
||||
memcpy(ff_buf, app_buf, n * f->item_size);
|
||||
} else {
|
||||
// Wrap around
|
||||
|
||||
// Write data to linear part of buffer
|
||||
@ -176,19 +170,17 @@ static void _ff_push_n(tu_fifo_t* f, void const * app_buf, uint16_t n, uint16_t
|
||||
|
||||
// Write data wrapped around
|
||||
// TU_ASSERT(nWrap_bytes <= f->depth, );
|
||||
memcpy(f->buffer, ((uint8_t const*) app_buf) + lin_bytes, wrap_bytes);
|
||||
memcpy(f->buffer, ((const uint8_t *)app_buf) + lin_bytes, wrap_bytes);
|
||||
}
|
||||
break;
|
||||
|
||||
#ifdef TUP_MEM_CONST_ADDR
|
||||
case TU_FIFO_COPY_CST_FULL_WORDS:
|
||||
// Intended for hardware buffers from which it can be read word by word only
|
||||
if(n <= lin_count)
|
||||
{
|
||||
if (n <= lin_count) {
|
||||
// Linear only
|
||||
_ff_push_const_addr(ff_buf, app_buf, n*f->item_size);
|
||||
}
|
||||
else
|
||||
{
|
||||
_ff_push_const_addr(ff_buf, app_buf, n * f->item_size);
|
||||
} else {
|
||||
// Wrap around case
|
||||
|
||||
// Write full words to linear part of buffer
|
||||
@ -198,83 +190,80 @@ static void _ff_push_n(tu_fifo_t* f, void const * app_buf, uint16_t n, uint16_t
|
||||
|
||||
// There could be odd 1-3 bytes before the wrap-around boundary
|
||||
uint8_t rem = lin_bytes & 0x03;
|
||||
if (rem > 0)
|
||||
{
|
||||
volatile const uint32_t * rx_fifo = (volatile const uint32_t *) app_buf;
|
||||
if (rem > 0) {
|
||||
const volatile uint32_t *rx_fifo = (volatile const uint32_t *)app_buf;
|
||||
|
||||
uint8_t remrem = (uint8_t) tu_min16(wrap_bytes, 4-rem);
|
||||
uint8_t remrem = (uint8_t)tu_min16(wrap_bytes, 4 - rem);
|
||||
wrap_bytes -= remrem;
|
||||
|
||||
uint32_t tmp32 = *rx_fifo;
|
||||
uint8_t * src_u8 = ((uint8_t *) &tmp32);
|
||||
uint32_t tmp32 = *rx_fifo;
|
||||
uint8_t *src_u8 = ((uint8_t *)&tmp32);
|
||||
|
||||
// Write 1-3 bytes before wrapped boundary
|
||||
while(rem--) *ff_buf++ = *src_u8++;
|
||||
while (rem--) {
|
||||
*ff_buf++ = *src_u8++;
|
||||
}
|
||||
|
||||
// Read more bytes to beginning to complete a word
|
||||
ff_buf = f->buffer;
|
||||
while(remrem--) *ff_buf++ = *src_u8++;
|
||||
}
|
||||
else
|
||||
{
|
||||
while (remrem--) {
|
||||
*ff_buf++ = *src_u8++;
|
||||
}
|
||||
} else {
|
||||
ff_buf = f->buffer; // wrap around to beginning
|
||||
}
|
||||
|
||||
// Write data wrapped part
|
||||
if (wrap_bytes > 0) _ff_push_const_addr(ff_buf, app_buf, wrap_bytes);
|
||||
if (wrap_bytes > 0) {
|
||||
_ff_push_const_addr(ff_buf, app_buf, wrap_bytes);
|
||||
}
|
||||
}
|
||||
break;
|
||||
#endif
|
||||
default: break;
|
||||
|
||||
default:
|
||||
break; // unknown mode
|
||||
}
|
||||
}
|
||||
|
||||
// get one item from fifo WITHOUT updating read pointer
|
||||
static inline void _ff_pull(tu_fifo_t* f, void * app_buf, uint16_t rel)
|
||||
{
|
||||
static inline void _ff_pull(tu_fifo_t *f, void *app_buf, uint16_t rel) {
|
||||
memcpy(app_buf, f->buffer + (rel * f->item_size), f->item_size);
|
||||
}
|
||||
|
||||
// get n items from fifo WITHOUT updating read pointer
|
||||
static void _ff_pull_n(tu_fifo_t* f, void* app_buf, uint16_t n, uint16_t rd_ptr, tu_fifo_copy_mode_t copy_mode)
|
||||
{
|
||||
uint16_t const lin_count = f->depth - rd_ptr;
|
||||
uint16_t const wrap_count = n - lin_count; // only used if wrapped
|
||||
static void _ff_pull_n(tu_fifo_t *f, void *app_buf, uint16_t n, uint16_t rd_ptr, tu_fifo_copy_mode_t copy_mode) {
|
||||
const uint16_t lin_count = f->depth - rd_ptr;
|
||||
const uint16_t wrap_count = n - lin_count; // only used if wrapped
|
||||
|
||||
uint16_t lin_bytes = lin_count * f->item_size;
|
||||
uint16_t lin_bytes = lin_count * f->item_size;
|
||||
uint16_t wrap_bytes = wrap_count * f->item_size;
|
||||
|
||||
// current buffer of fifo
|
||||
uint8_t* ff_buf = f->buffer + (rd_ptr * f->item_size);
|
||||
uint8_t *ff_buf = f->buffer + (rd_ptr * f->item_size);
|
||||
|
||||
switch (copy_mode)
|
||||
{
|
||||
switch (copy_mode) {
|
||||
case TU_FIFO_COPY_INC:
|
||||
if ( n <= lin_count )
|
||||
{
|
||||
if (n <= lin_count) {
|
||||
// Linear only
|
||||
memcpy(app_buf, ff_buf, n*f->item_size);
|
||||
}
|
||||
else
|
||||
{
|
||||
memcpy(app_buf, ff_buf, n * f->item_size);
|
||||
} else {
|
||||
// Wrap around
|
||||
|
||||
// Read data from linear part of buffer
|
||||
memcpy(app_buf, ff_buf, lin_bytes);
|
||||
|
||||
// Read data wrapped part
|
||||
memcpy((uint8_t*) app_buf + lin_bytes, f->buffer, wrap_bytes);
|
||||
memcpy((uint8_t *)app_buf + lin_bytes, f->buffer, wrap_bytes);
|
||||
}
|
||||
break;
|
||||
break;
|
||||
|
||||
#ifdef TUP_MEM_CONST_ADDR
|
||||
case TU_FIFO_COPY_CST_FULL_WORDS:
|
||||
if ( n <= lin_count )
|
||||
{
|
||||
if (n <= lin_count) {
|
||||
// Linear only
|
||||
_ff_pull_const_addr(app_buf, ff_buf, n*f->item_size);
|
||||
}
|
||||
else
|
||||
{
|
||||
_ff_pull_const_addr(app_buf, ff_buf, n * f->item_size);
|
||||
} else {
|
||||
// Wrap around case
|
||||
|
||||
// Read full words from linear part of buffer
|
||||
@ -284,36 +273,41 @@ static void _ff_pull_n(tu_fifo_t* f, void* app_buf, uint16_t n, uint16_t rd_ptr,
|
||||
|
||||
// There could be odd 1-3 bytes before the wrap-around boundary
|
||||
uint8_t rem = lin_bytes & 0x03;
|
||||
if (rem > 0)
|
||||
{
|
||||
volatile uint32_t * reg_tx = (volatile uint32_t *) app_buf;
|
||||
if (rem > 0) {
|
||||
volatile uint32_t *reg_tx = (volatile uint32_t *)app_buf;
|
||||
|
||||
uint8_t remrem = (uint8_t) tu_min16(wrap_bytes, 4-rem);
|
||||
uint8_t remrem = (uint8_t)tu_min16(wrap_bytes, 4 - rem);
|
||||
wrap_bytes -= remrem;
|
||||
|
||||
uint32_t tmp32=0;
|
||||
uint8_t * dst_u8 = (uint8_t *)&tmp32;
|
||||
uint32_t tmp32 = 0;
|
||||
uint8_t *dst_u8 = (uint8_t *)&tmp32;
|
||||
|
||||
// Read 1-3 bytes before wrapped boundary
|
||||
while(rem--) *dst_u8++ = *ff_buf++;
|
||||
while (rem--) {
|
||||
*dst_u8++ = *ff_buf++;
|
||||
}
|
||||
|
||||
// Read more bytes from beginning to complete a word
|
||||
ff_buf = f->buffer;
|
||||
while(remrem--) *dst_u8++ = *ff_buf++;
|
||||
while (remrem--) {
|
||||
*dst_u8++ = *ff_buf++;
|
||||
}
|
||||
|
||||
*reg_tx = tmp32;
|
||||
}
|
||||
else
|
||||
{
|
||||
} else {
|
||||
ff_buf = f->buffer; // wrap around to beginning
|
||||
}
|
||||
|
||||
// Read data wrapped part
|
||||
if (wrap_bytes > 0) _ff_pull_const_addr(app_buf, ff_buf, wrap_bytes);
|
||||
if (wrap_bytes > 0) {
|
||||
_ff_pull_const_addr(app_buf, ff_buf, wrap_bytes);
|
||||
}
|
||||
}
|
||||
break;
|
||||
break;
|
||||
#endif
|
||||
default: break;
|
||||
|
||||
default:
|
||||
break; // unknown mode
|
||||
}
|
||||
}
|
||||
|
||||
@ -322,24 +316,18 @@ static void _ff_pull_n(tu_fifo_t* f, void* app_buf, uint16_t n, uint16_t rd_ptr,
|
||||
//--------------------------------------------------------------------+
|
||||
|
||||
// return only the index difference and as such can be used to determine an overflow i.e overflowable count
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
uint16_t _ff_count(uint16_t depth, uint16_t wr_idx, uint16_t rd_idx)
|
||||
{
|
||||
TU_ATTR_ALWAYS_INLINE static inline uint16_t _ff_count(uint16_t depth, uint16_t wr_idx, uint16_t rd_idx) {
|
||||
// In case we have non-power of two depth we need a further modification
|
||||
if (wr_idx >= rd_idx)
|
||||
{
|
||||
return (uint16_t) (wr_idx - rd_idx);
|
||||
} else
|
||||
{
|
||||
return (uint16_t) (2*depth - (rd_idx - wr_idx));
|
||||
if (wr_idx >= rd_idx) {
|
||||
return (uint16_t)(wr_idx - rd_idx);
|
||||
} else {
|
||||
return (uint16_t)(2 * depth - (rd_idx - wr_idx));
|
||||
}
|
||||
}
|
||||
|
||||
// return remaining slot in fifo
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
uint16_t _ff_remaining(uint16_t depth, uint16_t wr_idx, uint16_t rd_idx)
|
||||
{
|
||||
uint16_t const count = _ff_count(depth, wr_idx, rd_idx);
|
||||
TU_ATTR_ALWAYS_INLINE static inline uint16_t _ff_remaining(uint16_t depth, uint16_t wr_idx, uint16_t rd_idx) {
|
||||
const uint16_t count = _ff_count(depth, wr_idx, rd_idx);
|
||||
return (depth > count) ? (depth - count) : 0;
|
||||
}
|
||||
|
||||
@ -349,16 +337,14 @@ uint16_t _ff_remaining(uint16_t depth, uint16_t wr_idx, uint16_t rd_idx)
|
||||
|
||||
// Advance an absolute index
|
||||
// "absolute" index is only in the range of [0..2*depth)
|
||||
static uint16_t advance_index(uint16_t depth, uint16_t idx, uint16_t offset)
|
||||
{
|
||||
static uint16_t advance_index(uint16_t depth, uint16_t idx, uint16_t offset) {
|
||||
// We limit the index space of p such that a correct wrap around happens
|
||||
// Check for a wrap around or if we are in unused index space - This has to be checked first!!
|
||||
// We are exploiting the wrap around to the correct index
|
||||
uint16_t new_idx = (uint16_t) (idx + offset);
|
||||
if ( (idx > new_idx) || (new_idx >= 2*depth) )
|
||||
{
|
||||
uint16_t const non_used_index_space = (uint16_t) (UINT16_MAX - (2*depth-1));
|
||||
new_idx = (uint16_t) (new_idx + non_used_index_space);
|
||||
uint16_t new_idx = (uint16_t)(idx + offset);
|
||||
if ((idx > new_idx) || (new_idx >= 2 * depth)) {
|
||||
const uint16_t non_used_index_space = (uint16_t)(UINT16_MAX - (2 * depth - 1));
|
||||
new_idx = (uint16_t)(new_idx + non_used_index_space);
|
||||
}
|
||||
|
||||
return new_idx;
|
||||
@ -366,14 +352,12 @@ static uint16_t advance_index(uint16_t depth, uint16_t idx, uint16_t offset)
|
||||
|
||||
#if 0 // not used but
|
||||
// Backward an absolute index
|
||||
static uint16_t backward_index(uint16_t depth, uint16_t idx, uint16_t offset)
|
||||
{
|
||||
static uint16_t backward_index(uint16_t depth, uint16_t idx, uint16_t offset) {
|
||||
// We limit the index space of p such that a correct wrap around happens
|
||||
// Check for a wrap around or if we are in unused index space - This has to be checked first!!
|
||||
// We are exploiting the wrap around to the correct index
|
||||
uint16_t new_idx = (uint16_t) (idx - offset);
|
||||
if ( (idx < new_idx) || (new_idx >= 2*depth) )
|
||||
{
|
||||
if ( (idx < new_idx) || (new_idx >= 2*depth) ) {
|
||||
uint16_t const non_used_index_space = (uint16_t) (UINT16_MAX - (2*depth-1));
|
||||
new_idx = (uint16_t) (new_idx - non_used_index_space);
|
||||
}
|
||||
@ -383,26 +367,22 @@ static uint16_t backward_index(uint16_t depth, uint16_t idx, uint16_t offset)
|
||||
#endif
|
||||
|
||||
// index to pointer, simply an modulo with minus.
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
uint16_t idx2ptr(uint16_t depth, uint16_t idx)
|
||||
{
|
||||
TU_ATTR_ALWAYS_INLINE static inline uint16_t idx2ptr(uint16_t depth, uint16_t idx) {
|
||||
// Only run at most 3 times since index is limit in the range of [0..2*depth)
|
||||
while ( idx >= depth ) idx -= depth;
|
||||
while (idx >= depth) {
|
||||
idx -= depth;
|
||||
}
|
||||
return idx;
|
||||
}
|
||||
|
||||
// Works on local copies of w
|
||||
// When an overwritable fifo is overflowed, rd_idx will be re-index so that it forms
|
||||
// an full fifo i.e _ff_count() = depth
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
uint16_t _ff_correct_read_index(tu_fifo_t* f, uint16_t wr_idx)
|
||||
{
|
||||
TU_ATTR_ALWAYS_INLINE static inline uint16_t _ff_correct_read_index(tu_fifo_t *f, uint16_t wr_idx) {
|
||||
uint16_t rd_idx;
|
||||
if ( wr_idx >= f->depth )
|
||||
{
|
||||
if (wr_idx >= f->depth) {
|
||||
rd_idx = wr_idx - f->depth;
|
||||
}else
|
||||
{
|
||||
} else {
|
||||
rd_idx = wr_idx + f->depth;
|
||||
}
|
||||
|
||||
@ -413,16 +393,16 @@ uint16_t _ff_correct_read_index(tu_fifo_t* f, uint16_t wr_idx)
|
||||
|
||||
// Works on local copies of w and r
|
||||
// Must be protected by mutexes since in case of an overflow read pointer gets modified
|
||||
static bool _tu_fifo_peek(tu_fifo_t* f, void * p_buffer, uint16_t wr_idx, uint16_t rd_idx)
|
||||
{
|
||||
static bool _tu_fifo_peek(tu_fifo_t *f, void *p_buffer, uint16_t wr_idx, uint16_t rd_idx) {
|
||||
uint16_t cnt = _ff_count(f->depth, wr_idx, rd_idx);
|
||||
|
||||
// nothing to peek
|
||||
if ( cnt == 0 ) return false;
|
||||
if (cnt == 0) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// Check overflow and correct if required
|
||||
if ( cnt > f->depth )
|
||||
{
|
||||
if (cnt > f->depth) {
|
||||
rd_idx = _ff_correct_read_index(f, wr_idx);
|
||||
}
|
||||
|
||||
@ -436,22 +416,25 @@ static bool _tu_fifo_peek(tu_fifo_t* f, void * p_buffer, uint16_t wr_idx, uint16
|
||||
|
||||
// Works on local copies of w and r
|
||||
// Must be protected by mutexes since in case of an overflow read pointer gets modified
|
||||
static uint16_t _tu_fifo_peek_n(tu_fifo_t* f, void * p_buffer, uint16_t n, uint16_t wr_idx, uint16_t rd_idx, tu_fifo_copy_mode_t copy_mode)
|
||||
{
|
||||
static uint16_t _tu_fifo_peek_n(
|
||||
tu_fifo_t *f, void *p_buffer, uint16_t n, uint16_t wr_idx, uint16_t rd_idx, tu_fifo_copy_mode_t copy_mode) {
|
||||
uint16_t cnt = _ff_count(f->depth, wr_idx, rd_idx);
|
||||
|
||||
// nothing to peek
|
||||
if ( cnt == 0 ) return 0;
|
||||
if (cnt == 0) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
// Check overflow and correct if required
|
||||
if ( cnt > f->depth )
|
||||
{
|
||||
if (cnt > f->depth) {
|
||||
rd_idx = _ff_correct_read_index(f, wr_idx);
|
||||
cnt = f->depth;
|
||||
cnt = f->depth;
|
||||
}
|
||||
|
||||
// Check if we can read something at and after offset - if too less is available we read what remains
|
||||
if ( cnt < n ) n = cnt;
|
||||
if (cnt < n) {
|
||||
n = cnt;
|
||||
}
|
||||
|
||||
uint16_t rd_ptr = idx2ptr(f->depth, rd_idx);
|
||||
|
||||
@ -461,40 +444,36 @@ static uint16_t _tu_fifo_peek_n(tu_fifo_t* f, void * p_buffer, uint16_t n, uint1
|
||||
return n;
|
||||
}
|
||||
|
||||
static uint16_t _tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n, tu_fifo_copy_mode_t copy_mode)
|
||||
{
|
||||
if ( n == 0 ) return 0;
|
||||
static uint16_t _tu_fifo_write_n(tu_fifo_t *f, const void *data, uint16_t n, tu_fifo_copy_mode_t copy_mode) {
|
||||
if (n == 0) {
|
||||
return 0;
|
||||
}
|
||||
|
||||
_ff_lock(f->mutex_wr);
|
||||
|
||||
uint16_t wr_idx = f->wr_idx;
|
||||
uint16_t rd_idx = f->rd_idx;
|
||||
|
||||
uint8_t const* buf8 = (uint8_t const*) data;
|
||||
const uint8_t *buf8 = (const uint8_t *)data;
|
||||
|
||||
TU_LOG(TU_FIFO_DBG, "rd = %3u, wr = %3u, count = %3u, remain = %3u, n = %3u: ",
|
||||
rd_idx, wr_idx, _ff_count(f->depth, wr_idx, rd_idx), _ff_remaining(f->depth, wr_idx, rd_idx), n);
|
||||
TU_LOG(
|
||||
TU_FIFO_DBG, "rd = %3u, wr = %3u, count = %3u, remain = %3u, n = %3u: ", rd_idx, wr_idx,
|
||||
_ff_count(f->depth, wr_idx, rd_idx), _ff_remaining(f->depth, wr_idx, rd_idx), n);
|
||||
|
||||
if ( !f->overwritable )
|
||||
{
|
||||
if (!f->overwritable) {
|
||||
// limit up to full
|
||||
uint16_t const remain = _ff_remaining(f->depth, wr_idx, rd_idx);
|
||||
n = tu_min16(n, remain);
|
||||
}
|
||||
else
|
||||
{
|
||||
const uint16_t remain = _ff_remaining(f->depth, wr_idx, rd_idx);
|
||||
n = tu_min16(n, remain);
|
||||
} else {
|
||||
// In over-writable mode, fifo_write() is allowed even when fifo is full. In such case,
|
||||
// oldest data in fifo i.e at read pointer data will be overwritten
|
||||
// Note: we can modify read buffer contents but we must not modify the read index itself within a write function!
|
||||
// Since it would end up in a race condition with read functions!
|
||||
if ( n >= f->depth )
|
||||
{
|
||||
if (n >= f->depth) {
|
||||
// Only copy last part
|
||||
if ( copy_mode == TU_FIFO_COPY_INC )
|
||||
{
|
||||
if (copy_mode == TU_FIFO_COPY_INC) {
|
||||
buf8 += (n - f->depth) * f->item_size;
|
||||
}else
|
||||
{
|
||||
} else {
|
||||
// TODO should read from hw fifo to discard data, however reading an odd number could
|
||||
// accidentally discard data.
|
||||
}
|
||||
@ -503,12 +482,9 @@ static uint16_t _tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n, tu
|
||||
|
||||
// We start writing at the read pointer's position since we fill the whole buffer
|
||||
wr_idx = rd_idx;
|
||||
}
|
||||
else
|
||||
{
|
||||
uint16_t const overflowable_count = _ff_count(f->depth, wr_idx, rd_idx);
|
||||
if (overflowable_count + n >= 2*f->depth)
|
||||
{
|
||||
} else {
|
||||
const uint16_t overflowable_count = _ff_count(f->depth, wr_idx, rd_idx);
|
||||
if (overflowable_count + n >= 2 * f->depth) {
|
||||
// Double overflowed
|
||||
// Index is bigger than the allowed range [0,2*depth)
|
||||
// re-position write index to have a full fifo after pushed
|
||||
@ -518,8 +494,7 @@ static uint16_t _tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n, tu
|
||||
// However memmove() is expensive due to actual copying + wrapping consideration.
|
||||
// Also race condition could happen anyway if read() is invoke while moving result in corrupted memory
|
||||
// currently deliberately not implemented --> result in incorrect data read back
|
||||
}else
|
||||
{
|
||||
} else {
|
||||
// normal + single overflowed:
|
||||
// Index is in the range of [0,2*depth) and thus detect and recoverable. Recovering is handled in read()
|
||||
// Therefore we just increase write index
|
||||
@ -528,16 +503,11 @@ static uint16_t _tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n, tu
|
||||
}
|
||||
}
|
||||
|
||||
if (n)
|
||||
{
|
||||
if (n) {
|
||||
uint16_t wr_ptr = idx2ptr(f->depth, wr_idx);
|
||||
|
||||
TU_LOG(TU_FIFO_DBG, "actual_n = %u, wr_ptr = %u", n, wr_ptr);
|
||||
|
||||
// Write data
|
||||
_ff_push_n(f, buf8, n, wr_ptr, copy_mode);
|
||||
|
||||
// Advance index
|
||||
f->wr_idx = advance_index(f->depth, wr_idx, n);
|
||||
|
||||
TU_LOG(TU_FIFO_DBG, "\tnew_wr = %u\r\n", f->wr_idx);
|
||||
@ -548,8 +518,7 @@ static uint16_t _tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n, tu
|
||||
return n;
|
||||
}
|
||||
|
||||
static uint16_t _tu_fifo_read_n(tu_fifo_t* f, void * buffer, uint16_t n, tu_fifo_copy_mode_t copy_mode)
|
||||
{
|
||||
static uint16_t _tu_fifo_read_n(tu_fifo_t *f, void *buffer, uint16_t n, tu_fifo_copy_mode_t copy_mode) {
|
||||
_ff_lock(f->mutex_rd);
|
||||
|
||||
// Peek the data
|
||||
@ -582,8 +551,7 @@ static uint16_t _tu_fifo_read_n(tu_fifo_t* f, void * buffer, uint16_t n, tu_fifo
|
||||
@returns Number of items in FIFO
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_count(tu_fifo_t* f)
|
||||
{
|
||||
uint16_t tu_fifo_count(tu_fifo_t *f) {
|
||||
return tu_min16(_ff_count(f->depth, f->wr_idx, f->rd_idx), f->depth);
|
||||
}
|
||||
|
||||
@ -600,8 +568,7 @@ uint16_t tu_fifo_count(tu_fifo_t* f)
|
||||
@returns Number of items in FIFO
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_empty(tu_fifo_t* f)
|
||||
{
|
||||
bool tu_fifo_empty(tu_fifo_t *f) {
|
||||
return f->wr_idx == f->rd_idx;
|
||||
}
|
||||
|
||||
@ -618,8 +585,7 @@ bool tu_fifo_empty(tu_fifo_t* f)
|
||||
@returns Number of items in FIFO
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_full(tu_fifo_t* f)
|
||||
{
|
||||
bool tu_fifo_full(tu_fifo_t *f) {
|
||||
return _ff_count(f->depth, f->wr_idx, f->rd_idx) >= f->depth;
|
||||
}
|
||||
|
||||
@ -636,8 +602,7 @@ bool tu_fifo_full(tu_fifo_t* f)
|
||||
@returns Number of items in FIFO
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_remaining(tu_fifo_t* f)
|
||||
{
|
||||
uint16_t tu_fifo_remaining(tu_fifo_t *f) {
|
||||
return _ff_remaining(f->depth, f->wr_idx, f->rd_idx);
|
||||
}
|
||||
|
||||
@ -662,14 +627,12 @@ uint16_t tu_fifo_remaining(tu_fifo_t* f)
|
||||
@returns True if overflow happened
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_overflowed(tu_fifo_t* f)
|
||||
{
|
||||
bool tu_fifo_overflowed(tu_fifo_t *f) {
|
||||
return _ff_count(f->depth, f->wr_idx, f->rd_idx) > f->depth;
|
||||
}
|
||||
|
||||
// Only use in case tu_fifo_overflow() returned true!
|
||||
void tu_fifo_correct_read_pointer(tu_fifo_t* f)
|
||||
{
|
||||
void tu_fifo_correct_read_pointer(tu_fifo_t *f) {
|
||||
_ff_lock(f->mutex_rd);
|
||||
_ff_correct_read_index(f, f->wr_idx);
|
||||
_ff_unlock(f->mutex_rd);
|
||||
@ -691,8 +654,7 @@ void tu_fifo_correct_read_pointer(tu_fifo_t* f)
|
||||
@returns TRUE if the queue is not empty
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_read(tu_fifo_t* f, void * buffer)
|
||||
{
|
||||
bool tu_fifo_read(tu_fifo_t *f, void *buffer) {
|
||||
_ff_lock(f->mutex_rd);
|
||||
|
||||
// Peek the data
|
||||
@ -722,8 +684,7 @@ bool tu_fifo_read(tu_fifo_t* f, void * buffer)
|
||||
@returns number of items read from the FIFO
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_read_n(tu_fifo_t* f, void * buffer, uint16_t n)
|
||||
{
|
||||
uint16_t tu_fifo_read_n(tu_fifo_t *f, void *buffer, uint16_t n) {
|
||||
return _tu_fifo_read_n(f, buffer, n, TU_FIFO_COPY_INC);
|
||||
}
|
||||
|
||||
@ -745,8 +706,7 @@ uint16_t tu_fifo_read_n(tu_fifo_t* f, void * buffer, uint16_t n)
|
||||
@returns number of items read from the FIFO
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_read_n_const_addr_full_words(tu_fifo_t* f, void * buffer, uint16_t n)
|
||||
{
|
||||
uint16_t tu_fifo_read_n_const_addr_full_words(tu_fifo_t *f, void *buffer, uint16_t n) {
|
||||
return _tu_fifo_read_n(f, buffer, n, TU_FIFO_COPY_CST_FULL_WORDS);
|
||||
}
|
||||
#endif
|
||||
@ -764,8 +724,7 @@ uint16_t tu_fifo_read_n_const_addr_full_words(tu_fifo_t* f, void * buffer, uint1
|
||||
@returns TRUE if the queue is not empty
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_peek(tu_fifo_t* f, void * p_buffer)
|
||||
{
|
||||
bool tu_fifo_peek(tu_fifo_t *f, void *p_buffer) {
|
||||
_ff_lock(f->mutex_rd);
|
||||
bool ret = _tu_fifo_peek(f, p_buffer, f->wr_idx, f->rd_idx);
|
||||
_ff_unlock(f->mutex_rd);
|
||||
@ -787,8 +746,7 @@ bool tu_fifo_peek(tu_fifo_t* f, void * p_buffer)
|
||||
@returns Number of bytes written to p_buffer
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_peek_n(tu_fifo_t* f, void * p_buffer, uint16_t n)
|
||||
{
|
||||
uint16_t tu_fifo_peek_n(tu_fifo_t *f, void *p_buffer, uint16_t n) {
|
||||
_ff_lock(f->mutex_rd);
|
||||
uint16_t ret = _tu_fifo_peek_n(f, p_buffer, n, f->wr_idx, f->rd_idx, TU_FIFO_COPY_INC);
|
||||
_ff_unlock(f->mutex_rd);
|
||||
@ -811,27 +769,19 @@ uint16_t tu_fifo_peek_n(tu_fifo_t* f, void * p_buffer, uint16_t n)
|
||||
FIFO will always return TRUE)
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_write(tu_fifo_t* f, const void * data)
|
||||
{
|
||||
bool tu_fifo_write(tu_fifo_t *f, const void *data) {
|
||||
_ff_lock(f->mutex_wr);
|
||||
|
||||
bool ret;
|
||||
uint16_t const wr_idx = f->wr_idx;
|
||||
bool ret;
|
||||
const uint16_t wr_idx = f->wr_idx;
|
||||
|
||||
if ( tu_fifo_full(f) && !f->overwritable )
|
||||
{
|
||||
if (tu_fifo_full(f) && !f->overwritable) {
|
||||
ret = false;
|
||||
}else
|
||||
{
|
||||
} else {
|
||||
uint16_t wr_ptr = idx2ptr(f->depth, wr_idx);
|
||||
|
||||
// Write data
|
||||
_ff_push(f, data, wr_ptr);
|
||||
|
||||
// Advance pointer
|
||||
f->wr_idx = advance_index(f->depth, wr_idx, 1);
|
||||
|
||||
ret = true;
|
||||
ret = true;
|
||||
}
|
||||
|
||||
_ff_unlock(f->mutex_wr);
|
||||
@ -853,8 +803,7 @@ bool tu_fifo_write(tu_fifo_t* f, const void * data)
|
||||
@return Number of written elements
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n)
|
||||
{
|
||||
uint16_t tu_fifo_write_n(tu_fifo_t *f, const void *data, uint16_t n) {
|
||||
return _tu_fifo_write_n(f, data, n, TU_FIFO_COPY_INC);
|
||||
}
|
||||
|
||||
@ -874,8 +823,7 @@ uint16_t tu_fifo_write_n(tu_fifo_t* f, const void * data, uint16_t n)
|
||||
@return Number of written elements
|
||||
*/
|
||||
/******************************************************************************/
|
||||
uint16_t tu_fifo_write_n_const_addr_full_words(tu_fifo_t* f, const void * data, uint16_t n)
|
||||
{
|
||||
uint16_t tu_fifo_write_n_const_addr_full_words(tu_fifo_t *f, const void *data, uint16_t n) {
|
||||
return _tu_fifo_write_n(f, data, n, TU_FIFO_COPY_CST_FULL_WORDS);
|
||||
}
|
||||
#endif
|
||||
@ -888,8 +836,7 @@ uint16_t tu_fifo_write_n_const_addr_full_words(tu_fifo_t* f, const void * data,
|
||||
Pointer to the FIFO buffer to manipulate
|
||||
*/
|
||||
/******************************************************************************/
|
||||
bool tu_fifo_clear(tu_fifo_t *f)
|
||||
{
|
||||
bool tu_fifo_clear(tu_fifo_t *f) {
|
||||
_ff_lock(f->mutex_wr);
|
||||
_ff_lock(f->mutex_rd);
|
||||
|
||||
@ -943,8 +890,7 @@ bool tu_fifo_set_overwritable(tu_fifo_t *f, bool overwritable) {
|
||||
Number of items the write pointer moves forward
|
||||
*/
|
||||
/******************************************************************************/
|
||||
void tu_fifo_advance_write_pointer(tu_fifo_t *f, uint16_t n)
|
||||
{
|
||||
void tu_fifo_advance_write_pointer(tu_fifo_t *f, uint16_t n) {
|
||||
f->wr_idx = advance_index(f->depth, f->wr_idx, n);
|
||||
}
|
||||
|
||||
@ -964,8 +910,7 @@ void tu_fifo_advance_write_pointer(tu_fifo_t *f, uint16_t n)
|
||||
Number of items the read pointer moves forward
|
||||
*/
|
||||
/******************************************************************************/
|
||||
void tu_fifo_advance_read_pointer(tu_fifo_t *f, uint16_t n)
|
||||
{
|
||||
void tu_fifo_advance_read_pointer(tu_fifo_t *f, uint16_t n) {
|
||||
f->rd_idx = advance_index(f->depth, f->rd_idx, n);
|
||||
}
|
||||
|
||||
@ -984,8 +929,7 @@ void tu_fifo_advance_read_pointer(tu_fifo_t *f, uint16_t n)
|
||||
Pointer to struct which holds the desired infos
|
||||
*/
|
||||
/******************************************************************************/
|
||||
void tu_fifo_get_read_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
{
|
||||
void tu_fifo_get_read_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info) {
|
||||
// Operate on temporary values in case they change in between
|
||||
uint16_t wr_idx = f->wr_idx;
|
||||
uint16_t rd_idx = f->rd_idx;
|
||||
@ -993,8 +937,7 @@ void tu_fifo_get_read_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
uint16_t cnt = _ff_count(f->depth, wr_idx, rd_idx);
|
||||
|
||||
// Check overflow and correct if required - may happen in case a DMA wrote too fast
|
||||
if (cnt > f->depth)
|
||||
{
|
||||
if (cnt > f->depth) {
|
||||
_ff_lock(f->mutex_rd);
|
||||
rd_idx = _ff_correct_read_index(f, wr_idx);
|
||||
_ff_unlock(f->mutex_rd);
|
||||
@ -1003,8 +946,7 @@ void tu_fifo_get_read_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
}
|
||||
|
||||
// Check if fifo is empty
|
||||
if (cnt == 0)
|
||||
{
|
||||
if (cnt == 0) {
|
||||
info->len_lin = 0;
|
||||
info->len_wrap = 0;
|
||||
info->ptr_lin = NULL;
|
||||
@ -1020,17 +962,14 @@ void tu_fifo_get_read_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
info->ptr_lin = &f->buffer[rd_ptr];
|
||||
|
||||
// Check if there is a wrap around necessary
|
||||
if (wr_ptr > rd_ptr)
|
||||
{
|
||||
if (wr_ptr > rd_ptr) {
|
||||
// Non wrapping case
|
||||
info->len_lin = cnt;
|
||||
info->len_lin = cnt;
|
||||
|
||||
info->len_wrap = 0;
|
||||
info->ptr_wrap = NULL;
|
||||
}
|
||||
else
|
||||
{
|
||||
info->len_lin = f->depth - rd_ptr; // Also the case if FIFO was full
|
||||
} else {
|
||||
info->len_lin = f->depth - rd_ptr; // Also the case if FIFO was full
|
||||
|
||||
info->len_wrap = cnt - info->len_lin;
|
||||
info->ptr_wrap = f->buffer;
|
||||
@ -1052,14 +991,12 @@ void tu_fifo_get_read_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
Pointer to struct which holds the desired infos
|
||||
*/
|
||||
/******************************************************************************/
|
||||
void tu_fifo_get_write_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
{
|
||||
void tu_fifo_get_write_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info) {
|
||||
uint16_t wr_idx = f->wr_idx;
|
||||
uint16_t rd_idx = f->rd_idx;
|
||||
uint16_t remain = _ff_remaining(f->depth, wr_idx, rd_idx);
|
||||
|
||||
if (remain == 0)
|
||||
{
|
||||
if (remain == 0) {
|
||||
info->len_lin = 0;
|
||||
info->len_wrap = 0;
|
||||
info->ptr_lin = NULL;
|
||||
@ -1074,15 +1011,12 @@ void tu_fifo_get_write_info(tu_fifo_t *f, tu_fifo_buffer_info_t *info)
|
||||
// Copy pointer to buffer to start writing to
|
||||
info->ptr_lin = &f->buffer[wr_ptr];
|
||||
|
||||
if (wr_ptr < rd_ptr)
|
||||
{
|
||||
if (wr_ptr < rd_ptr) {
|
||||
// Non wrapping case
|
||||
info->len_lin = rd_ptr-wr_ptr;
|
||||
info->len_lin = rd_ptr - wr_ptr;
|
||||
info->len_wrap = 0;
|
||||
info->ptr_wrap = NULL;
|
||||
}
|
||||
else
|
||||
{
|
||||
} else {
|
||||
info->len_lin = f->depth - wr_ptr;
|
||||
info->len_wrap = remain - info->len_lin; // Remaining length - n already was limited to remain or FIFO depth
|
||||
info->ptr_wrap = f->buffer; // Always start of buffer
|
||||
|
||||
@ -104,16 +104,16 @@ extern "C" {
|
||||
* | R | 1 | 2 | W | 4 | 5 |
|
||||
*/
|
||||
typedef struct {
|
||||
uint8_t* buffer ; // buffer pointer
|
||||
uint16_t depth ; // max items
|
||||
uint8_t *buffer; // buffer pointer
|
||||
uint16_t depth; // max items
|
||||
|
||||
struct TU_ATTR_PACKED {
|
||||
uint16_t item_size : 15; // size of each item
|
||||
bool overwritable : 1 ; // ovwerwritable when full
|
||||
uint16_t item_size : 15; // size of each item
|
||||
bool overwritable : 1; // ovwerwritable when full
|
||||
};
|
||||
|
||||
volatile uint16_t wr_idx ; // write index
|
||||
volatile uint16_t rd_idx ; // read index
|
||||
volatile uint16_t wr_idx; // write index
|
||||
volatile uint16_t rd_idx; // read index
|
||||
|
||||
#if OSAL_MUTEX_REQUIRED
|
||||
osal_mutex_t mutex_wr;
|
||||
@ -129,12 +129,13 @@ typedef struct {
|
||||
void * ptr_wrap ; ///< wrapped part start pointer
|
||||
} tu_fifo_buffer_info_t;
|
||||
|
||||
#define TU_FIFO_INIT(_buffer, _depth, _type, _overwritable){\
|
||||
.buffer = _buffer, \
|
||||
.depth = _depth, \
|
||||
.item_size = sizeof(_type), \
|
||||
.overwritable = _overwritable, \
|
||||
}
|
||||
#define TU_FIFO_INIT(_buffer, _depth, _type, _overwritable) \
|
||||
{ \
|
||||
.buffer = _buffer, \
|
||||
.depth = _depth, \
|
||||
.item_size = sizeof(_type), \
|
||||
.overwritable = _overwritable, \
|
||||
}
|
||||
|
||||
#define TU_FIFO_DEF(_name, _depth, _type, _overwritable) \
|
||||
uint8_t _name##_buf[_depth*sizeof(_type)]; \
|
||||
|
||||
@ -40,6 +40,12 @@ extern tusb_role_t _tusb_rhport_role[TUP_USBIP_CONTROLLER_NUM];
|
||||
// Endpoint
|
||||
//--------------------------------------------------------------------+
|
||||
|
||||
enum {
|
||||
TU_EDPT_STATE_BUSY = 0x01,
|
||||
TU_EDPT_STATE_STALLED = 0x02,
|
||||
TU_EDPT_STATE_CLAIMED = 0x04,
|
||||
};
|
||||
|
||||
typedef struct TU_ATTR_PACKED {
|
||||
volatile uint8_t busy : 1;
|
||||
volatile uint8_t stalled : 1;
|
||||
@ -48,8 +54,8 @@ typedef struct TU_ATTR_PACKED {
|
||||
|
||||
typedef struct {
|
||||
struct TU_ATTR_PACKED {
|
||||
uint8_t is_host : 1; // 1: host, 0: device
|
||||
uint8_t is_mps512 : 1; // 1: 512, 0: 64 since stream is used for Bulk only
|
||||
bool is_host : 1; // 1: host, 0: device
|
||||
bool is_mps512 : 1; // 1: 512, 0: 64 since stream is used for Bulk only
|
||||
};
|
||||
uint8_t ep_addr;
|
||||
uint16_t ep_bufsize;
|
||||
@ -93,21 +99,18 @@ bool tu_edpt_stream_init(tu_edpt_stream_t* s, bool is_host, bool is_tx, bool ove
|
||||
bool tu_edpt_stream_deinit(tu_edpt_stream_t* s);
|
||||
|
||||
// Open an stream for an endpoint
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
void tu_edpt_stream_open(tu_edpt_stream_t* s, tusb_desc_endpoint_t const *desc_ep) {
|
||||
TU_ATTR_ALWAYS_INLINE static inline void tu_edpt_stream_open(tu_edpt_stream_t* s, tusb_desc_endpoint_t const *desc_ep) {
|
||||
tu_fifo_clear(&s->ff);
|
||||
s->ep_addr = desc_ep->bEndpointAddress;
|
||||
s->is_mps512 = (tu_edpt_packet_size(desc_ep) == 512) ? 1 : 0;
|
||||
s->is_mps512 = tu_edpt_packet_size(desc_ep) == 512;
|
||||
}
|
||||
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
void tu_edpt_stream_close(tu_edpt_stream_t* s) {
|
||||
TU_ATTR_ALWAYS_INLINE static inline void tu_edpt_stream_close(tu_edpt_stream_t* s) {
|
||||
s->ep_addr = 0;
|
||||
}
|
||||
|
||||
// Clear fifo
|
||||
TU_ATTR_ALWAYS_INLINE static inline
|
||||
bool tu_edpt_stream_clear(tu_edpt_stream_t* s) {
|
||||
TU_ATTR_ALWAYS_INLINE static inline bool tu_edpt_stream_clear(tu_edpt_stream_t* s) {
|
||||
return tu_fifo_clear(&s->ff);
|
||||
}
|
||||
|
||||
|
||||
38
src/tusb.c
38
src/tusb.c
@ -117,11 +117,15 @@ bool tusb_inited(void) {
|
||||
bool ret = false;
|
||||
|
||||
#if CFG_TUD_ENABLED
|
||||
ret = ret || tud_inited();
|
||||
if (tud_inited()) {
|
||||
ret = true;
|
||||
}
|
||||
#endif
|
||||
|
||||
#if CFG_TUH_ENABLED
|
||||
ret = ret || tuh_inited();
|
||||
if (tuh_inited()) {
|
||||
ret = true;
|
||||
}
|
||||
#endif
|
||||
|
||||
return ret;
|
||||
@ -209,7 +213,8 @@ bool tu_edpt_claim(tu_edpt_state_t* ep_state, osal_mutex_t mutex) {
|
||||
(void) mutex;
|
||||
|
||||
// pre-check to help reducing mutex lock
|
||||
TU_VERIFY((ep_state->busy == 0) && (ep_state->claimed == 0));
|
||||
TU_VERIFY(ep_state->busy == 0);
|
||||
TU_VERIFY(ep_state->claimed == 0);
|
||||
(void) osal_mutex_lock(mutex, OSAL_TIMEOUT_WAIT_FOREVER);
|
||||
|
||||
// can only claim the endpoint if it is not busy and not claimed yet.
|
||||
@ -298,7 +303,7 @@ uint16_t tu_desc_get_interface_total_len(tusb_desc_interface_t const* desc_itf,
|
||||
uint8_t const* p_desc = (uint8_t const*) desc_itf;
|
||||
uint16_t len = 0;
|
||||
|
||||
while (itf_count--) {
|
||||
while ((itf_count--) > 0) {
|
||||
// Next on interface desc
|
||||
len += tu_desc_len(desc_itf);
|
||||
p_desc = tu_desc_next(p_desc);
|
||||
@ -337,7 +342,7 @@ bool tu_edpt_stream_init(tu_edpt_stream_t* s, bool is_host, bool is_tx, bool ove
|
||||
tu_fifo_config(&s->ff, ff_buf, ff_bufsize, 1, overwritable);
|
||||
|
||||
#if OSAL_MUTEX_REQUIRED
|
||||
if (ff_buf && ff_bufsize) {
|
||||
if (ff_buf != NULL && ff_bufsize > 0) {
|
||||
osal_mutex_t new_mutex = osal_mutex_create(&s->ff_mutexdef);
|
||||
tu_fifo_config_mutex(&s->ff, is_tx ? new_mutex : NULL, is_tx ? NULL : new_mutex);
|
||||
}
|
||||
@ -352,9 +357,13 @@ bool tu_edpt_stream_init(tu_edpt_stream_t* s, bool is_host, bool is_tx, bool ove
|
||||
bool tu_edpt_stream_deinit(tu_edpt_stream_t* s) {
|
||||
(void) s;
|
||||
#if OSAL_MUTEX_REQUIRED
|
||||
if (s->ff.mutex_wr) osal_mutex_delete(s->ff.mutex_wr);
|
||||
if (s->ff.mutex_rd) osal_mutex_delete(s->ff.mutex_rd);
|
||||
#endif
|
||||
if (s->ff.mutex_wr) {
|
||||
osal_mutex_delete(s->ff.mutex_wr);
|
||||
}
|
||||
if (s->ff.mutex_rd) {
|
||||
osal_mutex_delete(s->ff.mutex_rd);
|
||||
}
|
||||
#endif
|
||||
return true;
|
||||
}
|
||||
|
||||
@ -403,7 +412,7 @@ TU_ATTR_ALWAYS_INLINE static inline bool stream_release(uint8_t hwid, tu_edpt_st
|
||||
bool tu_edpt_stream_write_zlp_if_needed(uint8_t hwid, tu_edpt_stream_t* s, uint32_t last_xferred_bytes) {
|
||||
// ZLP condition: no pending data, last transferred bytes is multiple of packet size
|
||||
const uint16_t mps = s->is_mps512 ? TUSB_EPSIZE_BULK_HS : TUSB_EPSIZE_BULK_FS;
|
||||
TU_VERIFY(!tu_fifo_count(&s->ff) && last_xferred_bytes && (0 == (last_xferred_bytes & (mps - 1))));
|
||||
TU_VERIFY(!tu_fifo_count(&s->ff) && last_xferred_bytes > 0 && (0 == (last_xferred_bytes & (mps - 1))));
|
||||
TU_VERIFY(stream_claim(hwid, s));
|
||||
TU_ASSERT(stream_xfer(hwid, s, 0));
|
||||
return true;
|
||||
@ -411,14 +420,13 @@ bool tu_edpt_stream_write_zlp_if_needed(uint8_t hwid, tu_edpt_stream_t* s, uint3
|
||||
|
||||
uint32_t tu_edpt_stream_write_xfer(uint8_t hwid, tu_edpt_stream_t* s) {
|
||||
// skip if no data
|
||||
TU_VERIFY(tu_fifo_count(&s->ff), 0);
|
||||
|
||||
TU_VERIFY(tu_fifo_count(&s->ff) > 0, 0);
|
||||
TU_VERIFY(stream_claim(hwid, s), 0);
|
||||
|
||||
// Pull data from FIFO -> EP buf
|
||||
uint16_t const count = tu_fifo_read_n(&s->ff, s->ep_buf, s->ep_bufsize);
|
||||
|
||||
if (count) {
|
||||
if (count > 0) {
|
||||
TU_ASSERT(stream_xfer(hwid, s, count), 0);
|
||||
return count;
|
||||
} else {
|
||||
@ -430,7 +438,7 @@ uint32_t tu_edpt_stream_write_xfer(uint8_t hwid, tu_edpt_stream_t* s) {
|
||||
}
|
||||
|
||||
uint32_t tu_edpt_stream_write(uint8_t hwid, tu_edpt_stream_t* s, void const* buffer, uint32_t bufsize) {
|
||||
TU_VERIFY(bufsize); // TODO support ZLP
|
||||
TU_VERIFY(bufsize > 0); // TODO support ZLP
|
||||
|
||||
if (0 == tu_fifo_depth(&s->ff)) {
|
||||
// no fifo for buffered
|
||||
@ -453,7 +461,7 @@ uint32_t tu_edpt_stream_write(uint8_t hwid, tu_edpt_stream_t* s, void const* buf
|
||||
}
|
||||
|
||||
uint32_t tu_edpt_stream_write_available(uint8_t hwid, tu_edpt_stream_t* s) {
|
||||
if (tu_fifo_depth(&s->ff)) {
|
||||
if (tu_fifo_depth(&s->ff) > 0) {
|
||||
return (uint32_t) tu_fifo_remaining(&s->ff);
|
||||
} else {
|
||||
bool is_busy = true;
|
||||
@ -596,7 +604,7 @@ void tu_print_mem(void const* buf, uint32_t count, uint8_t indent) {
|
||||
// fill up last row to 16 for printing ascii
|
||||
const uint32_t remain = count % 16;
|
||||
uint8_t nback = (uint8_t) (remain ? remain : 16);
|
||||
if (remain) {
|
||||
if (remain > 0) {
|
||||
for (uint32_t i = 0; i < 16 - remain; i++) {
|
||||
tu_printf(" ");
|
||||
for (int j = 0; j < 2 * size; j++) {
|
||||
|
||||
Reference in New Issue
Block a user