File size: 5,118 Bytes
25ade36 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 | /* The Clear BSD License
*
* Copyright (c) 2025 EdgeImpulse Inc.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted (subject to the limitations in the disclaimer
* below) provided that the following conditions are met:
*
* * Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* * Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* NO EXPRESS OR IMPLIED LICENSES TO ANY PARTY'S PATENT RIGHTS ARE GRANTED BY
* THIS LICENSE. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
* BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
* IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
#include "../ei_classifier_porting.h"
#if EI_PORTING_HIMAX_WE2 == 1
/* Include ----------------------------------------------------------------- */
#include <stdarg.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "xprintf.h"
extern "C" {
#include "timer_interface.h"
};
__attribute__((weak)) EI_IMPULSE_ERROR ei_run_impulse_check_canceled() {
return EI_IMPULSE_OK;
}
/**
* Cancelable sleep, can be triggered with signal from other thread
*/
__attribute__((weak)) EI_IMPULSE_ERROR ei_sleep(int32_t time_ms) {
hx_drv_timer_cm55x_delay_ms(time_ms, TIMER_STATE_DC);
return EI_IMPULSE_OK;
}
// Should be called at least once every ~10.7 seconds
uint64_t ei_read_timer_ms()
{
uint32_t tick, loop_cnt;
SystemGetTick(&tick, &loop_cnt);
// tick is counting down, so we need to add elapsed ticks to the total tick count
uint64_t elapsed_ms = (uint64_t)loop_cnt * (uint64_t)(SysTick_LOAD_RELOAD_Msk+1) + (SysTick_LOAD_RELOAD_Msk + 1 - tick);
// convert ticks to ms knowing the CPU frequency
elapsed_ms = elapsed_ms / (SystemCoreClock / 1000);
return elapsed_ms;
}
uint64_t ei_read_timer_us()
{
uint32_t tick, loop_cnt;
SystemGetTick(&tick, &loop_cnt);
// tick is counting down, so we need to add elapsed ticks to the total tick count
uint64_t elapsed_us = (uint64_t)loop_cnt * (uint64_t)(SysTick_LOAD_RELOAD_Msk+1) + (SysTick_LOAD_RELOAD_Msk + 1 - tick);
// convert ticks to ms knowing the CPU frequency
elapsed_us = elapsed_us / (SystemCoreClock / 1000000);
return elapsed_us;
}
void ei_serial_set_baudrate(int baudrate)
{
// hx_drv_uart_initial((HX_DRV_UART_BAUDRATE_E)baudrate);
}
void ei_putchar(char c)
{
/* Send char to serial output */
xputc(c);
}
__attribute__((weak)) void ei_printf(const char *format, ...) {
va_list args;
va_start(args, format);
xvprintf(format, args);
va_end(args);
}
__attribute__((weak)) void ei_printf_float(float f) {
float n = f;
static double PRECISION = 0.00001;
static int MAX_NUMBER_STRING_SIZE = 32;
char s[MAX_NUMBER_STRING_SIZE];
if (n == 0.0) {
ei_printf("0.00000");
} else {
int digit, m; //, m1;
char *c = s;
int neg = (n < 0);
if (neg) {
n = -n;
}
// calculate magnitude
m = log10(n);
if (neg) {
*(c++) = '-';
}
if (m < 1.0) {
m = 0;
}
// convert the number
while (n > PRECISION || m >= 0) {
double weight = pow(10.0, m);
if (weight > 0 && !isinf(weight)) {
digit = floor(n / weight);
n -= (digit * weight);
*(c++) = '0' + digit;
}
if (m == 0 && n > 0) {
*(c++) = '.';
}
m--;
}
*(c) = '\0';
ei_printf("%s", s);
}
}
__attribute__((weak)) void *ei_malloc(size_t size) {
return malloc(size);
}
__attribute__((weak)) void *ei_calloc(size_t nitems, size_t size) {
return calloc(nitems, size);
}
__attribute__((weak)) void ei_free(void *ptr) {
free(ptr);
}
#if defined(__cplusplus) && EI_C_LINKAGE == 1
extern "C"
#endif
__attribute__((weak)) void DebugLog(const char* s) {
ei_printf("%s", s);
}
#endif // #if EI_PORTING_HIMAX_WE2 == 1
|