mirror of
https://github.com/DarkFlippers/unleashed-firmware
synced 2024-11-23 13:03:13 +00:00
0154018363
* FBT: cdefines to env, libs order * API: strtod, modf, itoa, calloc * Apps: elk js * Apps: mjs * JS: scripts as assets * mjs: composite resolver * mjs: stack trace * ELK JS example removed * MJS thread, MJS lib modified to support script interruption * JS console UI * Module system, BadUSB bindings rework * JS notifications, simple dialog, BadUSB demo * Custom dialogs, dialog demo * MJS as system library, some dirty hacks to make it compile * Plugin-based js modules * js_uart(BadUART) module * js_uart: support for byte array arguments * Script icon and various fixes * File browser: multiple extensions filter, running js scripts from app loader * Running js scripts from archive browser * JS Runner as system app * Example scripts moved to /ext/apps/Scripts * JS bytecode listing generation * MJS builtin printf cleanup * JS examples cleanup * mbedtls version fix * Unused lib cleanup * Making PVS happy & TODOs cleanup * TODOs cleanup #2 * MJS: initial typed arrays support * JS: fix mem leak in uart destructor Co-authored-by: SG <who.just.the.doctor@gmail.com> Co-authored-by: Aleksandr Kutuzov <alleteam@gmail.com>
151 lines
4.1 KiB
C
151 lines
4.1 KiB
C
/*
|
|
* Copyright (c) 2014-2018 Cesanta Software Limited
|
|
* All rights reserved
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the ""License"");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an ""AS IS"" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef EXCLUDE_COMMON
|
|
|
|
#include <assert.h>
|
|
#include <string.h>
|
|
#include "mbuf.h"
|
|
|
|
#ifndef MBUF_REALLOC
|
|
#define MBUF_REALLOC realloc
|
|
#endif
|
|
|
|
#ifndef MBUF_FREE
|
|
#define MBUF_FREE free
|
|
#endif
|
|
|
|
void mbuf_init(struct mbuf *mbuf, size_t initial_size) WEAK;
|
|
void mbuf_init(struct mbuf *mbuf, size_t initial_size) {
|
|
mbuf->len = mbuf->size = 0;
|
|
mbuf->buf = NULL;
|
|
mbuf_resize(mbuf, initial_size);
|
|
}
|
|
|
|
void mbuf_free(struct mbuf *mbuf) WEAK;
|
|
void mbuf_free(struct mbuf *mbuf) {
|
|
if (mbuf->buf != NULL) {
|
|
MBUF_FREE(mbuf->buf);
|
|
mbuf_init(mbuf, 0);
|
|
}
|
|
}
|
|
|
|
void mbuf_resize(struct mbuf *a, size_t new_size) WEAK;
|
|
void mbuf_resize(struct mbuf *a, size_t new_size) {
|
|
if (new_size > a->size || (new_size < a->size && new_size >= a->len)) {
|
|
char *buf = (char *) MBUF_REALLOC(a->buf, new_size);
|
|
/*
|
|
* In case realloc fails, there's not much we can do, except keep things as
|
|
* they are. Note that NULL is a valid return value from realloc when
|
|
* size == 0, but that is covered too.
|
|
*/
|
|
if (buf == NULL && new_size != 0) return;
|
|
a->buf = buf;
|
|
a->size = new_size;
|
|
}
|
|
}
|
|
|
|
void mbuf_trim(struct mbuf *mbuf) WEAK;
|
|
void mbuf_trim(struct mbuf *mbuf) {
|
|
mbuf_resize(mbuf, mbuf->len);
|
|
}
|
|
|
|
size_t mbuf_insert(struct mbuf *a, size_t off, const void *buf, size_t) WEAK;
|
|
size_t mbuf_insert(struct mbuf *a, size_t off, const void *buf, size_t len) {
|
|
char *p = NULL;
|
|
|
|
assert(a != NULL);
|
|
assert(a->len <= a->size);
|
|
assert(off <= a->len);
|
|
|
|
/* check overflow */
|
|
if (~(size_t) 0 - (size_t) a->buf < len) return 0;
|
|
|
|
if (a->len + len <= a->size) {
|
|
memmove(a->buf + off + len, a->buf + off, a->len - off);
|
|
if (buf != NULL) {
|
|
memcpy(a->buf + off, buf, len);
|
|
}
|
|
a->len += len;
|
|
} else {
|
|
size_t min_size = (a->len + len);
|
|
size_t new_size = (size_t)(min_size * MBUF_SIZE_MULTIPLIER);
|
|
if (new_size - min_size > MBUF_SIZE_MAX_HEADROOM) {
|
|
new_size = min_size + MBUF_SIZE_MAX_HEADROOM;
|
|
}
|
|
p = (char *) MBUF_REALLOC(a->buf, new_size);
|
|
if (p == NULL && new_size != min_size) {
|
|
new_size = min_size;
|
|
p = (char *) MBUF_REALLOC(a->buf, new_size);
|
|
}
|
|
if (p != NULL) {
|
|
a->buf = p;
|
|
if (off != a->len) {
|
|
memmove(a->buf + off + len, a->buf + off, a->len - off);
|
|
}
|
|
if (buf != NULL) memcpy(a->buf + off, buf, len);
|
|
a->len += len;
|
|
a->size = new_size;
|
|
} else {
|
|
len = 0;
|
|
}
|
|
}
|
|
|
|
return len;
|
|
}
|
|
|
|
size_t mbuf_append(struct mbuf *a, const void *buf, size_t len) WEAK;
|
|
size_t mbuf_append(struct mbuf *a, const void *buf, size_t len) {
|
|
return mbuf_insert(a, a->len, buf, len);
|
|
}
|
|
|
|
size_t mbuf_append_and_free(struct mbuf *a, void *buf, size_t len) WEAK;
|
|
size_t mbuf_append_and_free(struct mbuf *a, void *data, size_t len) {
|
|
size_t ret;
|
|
/* Optimization: if the buffer is currently empty,
|
|
* take over the user-provided buffer. */
|
|
if (a->len == 0) {
|
|
if (a->buf != NULL) free(a->buf);
|
|
a->buf = (char *) data;
|
|
a->len = a->size = len;
|
|
return len;
|
|
}
|
|
ret = mbuf_insert(a, a->len, data, len);
|
|
free(data);
|
|
return ret;
|
|
}
|
|
|
|
void mbuf_remove(struct mbuf *mb, size_t n) WEAK;
|
|
void mbuf_remove(struct mbuf *mb, size_t n) {
|
|
if (n > 0 && n <= mb->len) {
|
|
memmove(mb->buf, mb->buf + n, mb->len - n);
|
|
mb->len -= n;
|
|
}
|
|
}
|
|
|
|
void mbuf_clear(struct mbuf *mb) WEAK;
|
|
void mbuf_clear(struct mbuf *mb) {
|
|
mb->len = 0;
|
|
}
|
|
|
|
void mbuf_move(struct mbuf *from, struct mbuf *to) WEAK;
|
|
void mbuf_move(struct mbuf *from, struct mbuf *to) {
|
|
memcpy(to, from, sizeof(*to));
|
|
memset(from, 0, sizeof(*from));
|
|
}
|
|
|
|
#endif /* EXCLUDE_COMMON */
|