mirror of
https://github.com/espressif/esp-idf.git
synced 2025-08-10 04:43:33 +00:00
console: argtable3: upgrade to v3.2.1
Source code taken from release archives in https://github.com/argtable/argtable3/releases/tag/v3.2.1.52f24e5 Applied dos2unix to all files. Removed trailing whitespace with the pre-commit hook. Resolves some of the static analysis issues reported in https://github.com/espressif/esp-idf/issues/6440 (mallocs are replaced by xmalloc wrapper which panics on failed allocations)
This commit is contained in:
178
components/console/argtable3/arg_utils.c
Normal file
178
components/console/argtable3/arg_utils.c
Normal file
@@ -0,0 +1,178 @@
|
||||
/*******************************************************************************
|
||||
* arg_utils: Implements memory, panic, and other utility functions
|
||||
*
|
||||
* This file is part of the argtable3 library.
|
||||
*
|
||||
* Copyright (C) 2013-2019 Tom G. Huang
|
||||
* <tomghuang@gmail.com>
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted 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 STEWART HEITMANN nor the names of its contributors
|
||||
* may be used to endorse or promote products derived from this software
|
||||
* without specific prior written permission.
|
||||
*
|
||||
* 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 STEWART HEITMANN 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 "argtable3.h"
|
||||
|
||||
#ifndef ARG_AMALGAMATION
|
||||
#include "argtable3_private.h"
|
||||
#endif
|
||||
|
||||
#include <stdarg.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
static void panic(const char* fmt, ...);
|
||||
static arg_panicfn* s_panic = panic;
|
||||
|
||||
void dbg_printf(const char* fmt, ...) {
|
||||
va_list args;
|
||||
va_start(args, fmt);
|
||||
vfprintf(stderr, fmt, args);
|
||||
va_end(args);
|
||||
}
|
||||
|
||||
static void panic(const char* fmt, ...) {
|
||||
va_list args;
|
||||
char* s;
|
||||
|
||||
va_start(args, fmt);
|
||||
vfprintf(stderr, fmt, args);
|
||||
va_end(args);
|
||||
|
||||
#if defined(_MSC_VER)
|
||||
#pragma warning(push)
|
||||
#pragma warning(disable : 4996)
|
||||
#endif
|
||||
s = getenv("EF_DUMPCORE");
|
||||
#if defined(_MSC_VER)
|
||||
#pragma warning(pop)
|
||||
#endif
|
||||
|
||||
if (s != NULL && *s != '\0') {
|
||||
abort();
|
||||
} else {
|
||||
exit(EXIT_FAILURE);
|
||||
}
|
||||
}
|
||||
|
||||
void arg_set_panic(arg_panicfn* proc) {
|
||||
s_panic = proc;
|
||||
}
|
||||
|
||||
void* xmalloc(size_t size) {
|
||||
void* ret = malloc(size);
|
||||
if (!ret) {
|
||||
s_panic("Out of memory!\n");
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
void* xcalloc(size_t count, size_t size) {
|
||||
size_t allocated_count = count && size ? count : 1;
|
||||
size_t allocated_size = count && size ? size : 1;
|
||||
void* ret = calloc(allocated_count, allocated_size);
|
||||
if (!ret) {
|
||||
s_panic("Out of memory!\n");
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
void* xrealloc(void* ptr, size_t size) {
|
||||
size_t allocated_size = size ? size : 1;
|
||||
void* ret = realloc(ptr, allocated_size);
|
||||
if (!ret) {
|
||||
s_panic("Out of memory!\n");
|
||||
}
|
||||
return ret;
|
||||
}
|
||||
|
||||
void xfree(void* ptr) {
|
||||
free(ptr);
|
||||
}
|
||||
|
||||
static void merge(void* data, int esize, int i, int j, int k, arg_comparefn* comparefn) {
|
||||
char* a = (char*)data;
|
||||
char* m;
|
||||
int ipos, jpos, mpos;
|
||||
|
||||
/* Initialize the counters used in merging. */
|
||||
ipos = i;
|
||||
jpos = j + 1;
|
||||
mpos = 0;
|
||||
|
||||
/* Allocate storage for the merged elements. */
|
||||
m = (char*)xmalloc((size_t)(esize * ((k - i) + 1)));
|
||||
|
||||
/* Continue while either division has elements to merge. */
|
||||
while (ipos <= j || jpos <= k) {
|
||||
if (ipos > j) {
|
||||
/* The left division has no more elements to merge. */
|
||||
while (jpos <= k) {
|
||||
memcpy(&m[mpos * esize], &a[jpos * esize], (size_t)esize);
|
||||
jpos++;
|
||||
mpos++;
|
||||
}
|
||||
|
||||
continue;
|
||||
} else if (jpos > k) {
|
||||
/* The right division has no more elements to merge. */
|
||||
while (ipos <= j) {
|
||||
memcpy(&m[mpos * esize], &a[ipos * esize], (size_t)esize);
|
||||
ipos++;
|
||||
mpos++;
|
||||
}
|
||||
|
||||
continue;
|
||||
}
|
||||
|
||||
/* Append the next ordered element to the merged elements. */
|
||||
if (comparefn(&a[ipos * esize], &a[jpos * esize]) < 0) {
|
||||
memcpy(&m[mpos * esize], &a[ipos * esize], (size_t)esize);
|
||||
ipos++;
|
||||
mpos++;
|
||||
} else {
|
||||
memcpy(&m[mpos * esize], &a[jpos * esize], (size_t)esize);
|
||||
jpos++;
|
||||
mpos++;
|
||||
}
|
||||
}
|
||||
|
||||
/* Prepare to pass back the merged data. */
|
||||
memcpy(&a[i * esize], m, (size_t)(esize * ((k - i) + 1)));
|
||||
xfree(m);
|
||||
}
|
||||
|
||||
void arg_mgsort(void* data, int size, int esize, int i, int k, arg_comparefn* comparefn) {
|
||||
int j;
|
||||
|
||||
/* Stop the recursion when no more divisions can be made. */
|
||||
if (i < k) {
|
||||
/* Determine where to divide the elements. */
|
||||
j = (int)(((i + k - 1)) / 2);
|
||||
|
||||
/* Recursively sort the two divisions. */
|
||||
arg_mgsort(data, size, esize, i, j, comparefn);
|
||||
arg_mgsort(data, size, esize, j + 1, k, comparefn);
|
||||
merge(data, esize, i, j, k, comparefn);
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user