2009-07-03 06:48:23 +08:00
|
|
|
/*
|
2023-04-25 12:36:39 +08:00
|
|
|
* Copyright (c) 2006-2023, RT-Thread Development Team
|
2013-06-24 17:06:09 +08:00
|
|
|
*
|
2018-09-14 22:37:43 +08:00
|
|
|
* SPDX-License-Identifier: Apache-2.0
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
|
|
|
* Change Logs:
|
|
|
|
* Date Author Notes
|
|
|
|
* 2006-03-16 Bernard the first version
|
|
|
|
* 2006-05-25 Bernard rewrite vsprintf
|
|
|
|
* 2006-08-10 Bernard add rt_show_version
|
2010-03-17 12:19:17 +08:00
|
|
|
* 2010-03-17 Bernard remove rt_strlcpy function
|
|
|
|
* fix gcc compiling issue.
|
2010-04-15 10:51:20 +08:00
|
|
|
* 2010-04-15 Bernard remove weak definition on ICCM16C compiler
|
2012-07-18 21:38:50 +08:00
|
|
|
* 2012-07-18 Arda add the alignment display for signed integer
|
2013-06-24 17:06:09 +08:00
|
|
|
* 2012-11-23 Bernard fix IAR compiler error.
|
2012-12-22 16:57:26 +08:00
|
|
|
* 2012-12-22 Bernard fix rt_kprintf issue, which found by Grissiom.
|
2013-06-24 00:09:52 +08:00
|
|
|
* 2013-06-24 Bernard remove rt_kprintf if RT_USING_CONSOLE is not defined.
|
2013-09-24 15:25:24 +08:00
|
|
|
* 2013-09-24 aozima make sure the device is in STREAM mode when used by rt_kprintf.
|
2015-08-03 16:07:30 +08:00
|
|
|
* 2015-07-06 Bernard Add rt_assert_handler routine.
|
2021-03-01 23:58:04 +08:00
|
|
|
* 2021-02-28 Meco Man add RT_KSERVICE_USING_STDLIB
|
2021-12-21 02:33:44 +08:00
|
|
|
* 2021-12-20 Meco Man implement rt_strcpy()
|
2022-01-08 07:35:44 +08:00
|
|
|
* 2022-01-07 Gabriel add __on_rt_assert_hook
|
2022-06-05 09:52:21 +08:00
|
|
|
* 2022-06-04 Meco Man remove strnlen
|
2022-08-25 05:12:11 +08:00
|
|
|
* 2022-08-24 Yunjie make rt_memset word-independent to adapt to ti c28x (16bit word)
|
2022-09-01 03:30:59 +08:00
|
|
|
* 2022-08-30 Yunjie make rt_vsnprintf adapt to ti c28x (16bit int)
|
2023-02-02 16:36:55 +08:00
|
|
|
* 2023-02-02 Bernard add Smart ID for logo version show
|
2023-12-22 15:44:45 +08:00
|
|
|
* 2023-10-16 Shell Add hook point for rt_malloc services
|
2023-12-30 15:46:54 +08:00
|
|
|
* 2023-12-10 xqyjlj perf rt_hw_interrupt_disable/enable, fix memheap lock
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <rtthread.h>
|
|
|
|
#include <rthw.h>
|
|
|
|
|
2023-10-21 20:14:45 +08:00
|
|
|
#define DBG_TAG "kernel.service"
|
2023-06-29 23:24:25 +08:00
|
|
|
#ifdef RT_DEBUG_DEVICE
|
|
|
|
#define DBG_LVL DBG_LOG
|
|
|
|
#else
|
|
|
|
#define DBG_LVL DBG_WARNING
|
|
|
|
#endif /* defined (RT_DEBUG_DEVICE) */
|
|
|
|
#include <rtdbg.h>
|
|
|
|
|
2018-08-30 20:27:45 +08:00
|
|
|
#ifdef RT_USING_MODULE
|
|
|
|
#include <dlmodule.h>
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_MODULE */
|
2018-08-30 20:27:45 +08:00
|
|
|
|
2022-12-16 18:38:28 +08:00
|
|
|
#ifdef RT_USING_SMART
|
2022-12-03 12:07:44 +08:00
|
|
|
#include <lwp.h>
|
|
|
|
#include <lwp_user_mm.h>
|
|
|
|
#include <console.h>
|
|
|
|
#endif
|
|
|
|
|
2012-03-22 13:57:54 +08:00
|
|
|
/* use precision */
|
|
|
|
#define RT_PRINTF_PRECISION
|
2023-02-20 18:14:34 +08:00
|
|
|
#define RT_PRINTF_SPECIAL
|
2012-03-22 13:57:54 +08:00
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
|
|
|
* @addtogroup KernelService
|
2023-02-03 10:00:58 +08:00
|
|
|
* @{
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2011-09-21 11:56:42 +08:00
|
|
|
/* global errno in RT-Thread */
|
2017-11-30 23:56:52 +08:00
|
|
|
static volatile int __rt_errno;
|
2011-09-25 10:33:51 +08:00
|
|
|
|
2011-03-12 08:08:47 +08:00
|
|
|
#if defined(RT_USING_DEVICE) && defined(RT_USING_CONSOLE)
|
2010-03-17 12:19:17 +08:00
|
|
|
static rt_device_t _console_device = RT_NULL;
|
2011-01-24 21:40:42 +08:00
|
|
|
#endif
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void rt_hw_us_delay(rt_uint32_t us)
|
2022-04-15 06:12:56 +08:00
|
|
|
{
|
|
|
|
(void) us;
|
2023-08-08 00:30:43 +08:00
|
|
|
LOG_W("rt_hw_us_delay() doesn't support for this board."
|
2023-06-29 23:24:25 +08:00
|
|
|
"Please consider implementing rt_hw_us_delay() in another file.");
|
2022-04-15 06:12:56 +08:00
|
|
|
}
|
|
|
|
|
2023-08-08 00:30:43 +08:00
|
|
|
rt_weak void rt_hw_cpu_reset(void)
|
2023-03-27 17:09:37 +08:00
|
|
|
{
|
2023-08-08 00:30:43 +08:00
|
|
|
LOG_W("rt_hw_cpu_reset() doesn't support for this board."
|
|
|
|
"Please consider implementing rt_hw_cpu_reset() in another file.");
|
|
|
|
return;
|
2023-03-27 17:09:37 +08:00
|
|
|
}
|
|
|
|
|
2023-08-08 00:42:10 +08:00
|
|
|
rt_weak void rt_hw_cpu_shutdown(void)
|
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
LOG_I("CPU shutdown...");
|
|
|
|
LOG_W("Using default rt_hw_cpu_shutdown()."
|
|
|
|
"Please consider implementing rt_hw_cpu_reset() in another file.");
|
|
|
|
level = rt_hw_interrupt_disable();
|
|
|
|
while (level)
|
|
|
|
{
|
|
|
|
RT_ASSERT(RT_NULL);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2023-10-21 20:14:45 +08:00
|
|
|
rt_weak rt_err_t rt_hw_backtrace_frame_get(rt_thread_t thread, struct rt_hw_backtrace_frame *frame)
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
LOG_W("%s is not implemented", __func__);
|
2023-10-21 20:14:45 +08:00
|
|
|
return -RT_ENOSYS;
|
|
|
|
}
|
|
|
|
|
|
|
|
rt_weak rt_err_t rt_hw_backtrace_frame_unwind(rt_thread_t thread, struct rt_hw_backtrace_frame *frame)
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
LOG_W("%s is not implemented", __func__);
|
2023-10-21 20:14:45 +08:00
|
|
|
return -RT_ENOSYS;
|
|
|
|
}
|
|
|
|
|
2023-08-08 00:30:43 +08:00
|
|
|
rt_weak const char *rt_hw_cpu_arch(void)
|
2023-08-08 00:22:14 +08:00
|
|
|
{
|
2023-08-08 00:30:43 +08:00
|
|
|
return "unknown";
|
2023-08-08 00:22:14 +08:00
|
|
|
}
|
|
|
|
|
2023-09-20 11:30:10 +08:00
|
|
|
struct _errno_str_t
|
2022-06-29 14:21:21 +08:00
|
|
|
{
|
2023-09-20 11:30:10 +08:00
|
|
|
rt_err_t error;
|
|
|
|
const char *str;
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct _errno_str_t rt_errno_strs[] =
|
|
|
|
{
|
|
|
|
{RT_EOK , "OK "},
|
|
|
|
{RT_ERROR , "ERROR "},
|
|
|
|
{RT_ETIMEOUT, "ETIMOUT"},
|
|
|
|
{RT_EFULL , "ERSFULL"},
|
|
|
|
{RT_EEMPTY , "ERSEPTY"},
|
|
|
|
{RT_ENOMEM , "ENOMEM "},
|
|
|
|
{RT_ENOSYS , "ENOSYS "},
|
|
|
|
{RT_EBUSY , "EBUSY "},
|
|
|
|
{RT_EIO , "EIO "},
|
|
|
|
{RT_EINTR , "EINTRPT"},
|
|
|
|
{RT_EINVAL , "EINVAL "},
|
|
|
|
{RT_ENOENT , "ENOENT "},
|
|
|
|
{RT_ENOSPC , "ENOSPC "},
|
|
|
|
{RT_EPERM , "EPERM "},
|
2023-09-20 12:42:13 +08:00
|
|
|
{RT_ETRAP , "ETRAP "},
|
2022-06-29 14:21:21 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function return a pointer to a string that contains the
|
2022-06-29 14:21:21 +08:00
|
|
|
* message of error.
|
|
|
|
*
|
|
|
|
* @param error the errorno code
|
|
|
|
* @return a point to error message string
|
|
|
|
*/
|
|
|
|
const char *rt_strerror(rt_err_t error)
|
|
|
|
{
|
2023-10-22 23:54:54 +08:00
|
|
|
int i = 0;
|
|
|
|
|
2022-06-29 14:21:21 +08:00
|
|
|
if (error < 0)
|
|
|
|
error = -error;
|
|
|
|
|
2023-10-22 23:54:54 +08:00
|
|
|
for (i = 0; i < sizeof(rt_errno_strs) / sizeof(rt_errno_strs[0]); i++)
|
2023-09-20 11:30:10 +08:00
|
|
|
{
|
|
|
|
if (rt_errno_strs[i].error == error)
|
|
|
|
return rt_errno_strs[i].str;
|
|
|
|
}
|
|
|
|
|
|
|
|
return "EUNKNOW";
|
2022-06-29 14:21:21 +08:00
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_strerror);
|
|
|
|
|
2021-09-10 18:34:14 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function gets the global errno for the current thread.
|
2009-12-25 20:18:53 +08:00
|
|
|
*
|
2009-07-03 06:48:23 +08:00
|
|
|
* @return errno
|
|
|
|
*/
|
|
|
|
rt_err_t rt_get_errno(void)
|
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
rt_thread_t tid = RT_NULL;
|
2009-12-25 20:18:53 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
if (rt_interrupt_get_nest() != 0)
|
|
|
|
{
|
|
|
|
/* it's in interrupt context */
|
2017-11-30 23:56:52 +08:00
|
|
|
return __rt_errno;
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
2011-06-12 18:01:48 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
tid = rt_thread_self();
|
|
|
|
if (tid == RT_NULL)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2017-11-30 23:56:52 +08:00
|
|
|
return __rt_errno;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
2009-12-25 20:18:53 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return tid->error;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_get_errno);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2021-09-10 18:34:14 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function sets the global errno for the current thread.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param error is the errno shall be set.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
|
|
|
void rt_set_errno(rt_err_t error)
|
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
rt_thread_t tid = RT_NULL;
|
2009-12-25 20:18:53 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
if (rt_interrupt_get_nest() != 0)
|
|
|
|
{
|
|
|
|
/* it's in interrupt context */
|
2017-11-30 23:56:52 +08:00
|
|
|
__rt_errno = error;
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return;
|
|
|
|
}
|
2011-06-12 18:01:48 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
tid = rt_thread_self();
|
|
|
|
if (tid == RT_NULL)
|
|
|
|
{
|
2017-11-30 23:56:52 +08:00
|
|
|
__rt_errno = error;
|
2013-06-24 17:06:09 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return;
|
|
|
|
}
|
2009-12-25 20:18:53 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
tid->error = error;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_set_errno);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2011-08-28 23:57:10 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function returns the address of the current thread errno.
|
2011-08-28 23:57:10 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return The errno address.
|
2011-08-28 23:57:10 +08:00
|
|
|
*/
|
|
|
|
int *_rt_errno(void)
|
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
rt_thread_t tid = RT_NULL;
|
2013-06-24 17:06:09 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
if (rt_interrupt_get_nest() != 0)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2017-11-30 23:56:52 +08:00
|
|
|
return (int *)&__rt_errno;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
2011-08-28 23:57:10 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
tid = rt_thread_self();
|
|
|
|
if (tid != RT_NULL)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
return (int *) & (tid->error);
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
2011-08-28 23:57:10 +08:00
|
|
|
|
2017-11-30 23:56:52 +08:00
|
|
|
return (int *)&__rt_errno;
|
2011-08-28 23:57:10 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(_rt_errno);
|
2011-08-28 23:57:10 +08:00
|
|
|
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifndef RT_KSERVICE_USING_STDLIB_MEMORY
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will set the content of memory to specified value.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @param s is the address of source memory, point to the memory block to be filled.
|
|
|
|
*
|
|
|
|
* @param c is the value to be set. The value is passed in int form, but the function
|
|
|
|
* uses the unsigned character form of the value when filling the memory block.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param count number of bytes to be set.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return The address of source memory.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void *rt_memset(void *s, int c, rt_ubase_t count)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2021-04-09 13:37:55 +08:00
|
|
|
#ifdef RT_KSERVICE_USING_TINY_SIZE
|
2012-12-25 16:23:12 +08:00
|
|
|
char *xs = (char *)s;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
while (count--)
|
|
|
|
*xs++ = c;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return s;
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2022-08-25 05:12:11 +08:00
|
|
|
#define LBLOCKSIZE (sizeof(rt_ubase_t))
|
2018-10-31 21:32:34 +08:00
|
|
|
#define UNALIGNED(X) ((long)X & (LBLOCKSIZE - 1))
|
2011-09-21 11:56:42 +08:00
|
|
|
#define TOO_SMALL(LEN) ((LEN) < LBLOCKSIZE)
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2022-12-03 12:07:44 +08:00
|
|
|
unsigned int i = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
char *m = (char *)s;
|
2022-12-03 12:07:44 +08:00
|
|
|
unsigned long buffer = 0;
|
|
|
|
unsigned long *aligned_addr = RT_NULL;
|
2022-08-25 05:12:11 +08:00
|
|
|
unsigned char d = (unsigned int)c & (unsigned char)(-1); /* To avoid sign extension, copy C to an
|
|
|
|
unsigned variable. (unsigned)((char)(-1))=0xFF for 8bit and =0xFFFF for 16bit: word independent */
|
|
|
|
|
|
|
|
RT_ASSERT(LBLOCKSIZE == 2 || LBLOCKSIZE == 4 || LBLOCKSIZE == 8);
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
if (!TOO_SMALL(count) && !UNALIGNED(s))
|
|
|
|
{
|
2021-03-17 23:55:27 +08:00
|
|
|
/* If we get this far, we know that count is large and s is word-aligned. */
|
2018-11-01 09:09:54 +08:00
|
|
|
aligned_addr = (unsigned long *)s;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
2021-03-17 23:55:27 +08:00
|
|
|
/* Store d into each char sized location in buffer so that
|
2012-12-25 16:23:12 +08:00
|
|
|
* we can set large blocks quickly.
|
|
|
|
*/
|
2022-08-25 05:12:11 +08:00
|
|
|
for (i = 0; i < LBLOCKSIZE; i++)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2022-08-25 05:12:11 +08:00
|
|
|
*(((unsigned char *)&buffer)+i) = d;
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
while (count >= LBLOCKSIZE * 4)
|
|
|
|
{
|
|
|
|
*aligned_addr++ = buffer;
|
|
|
|
*aligned_addr++ = buffer;
|
|
|
|
*aligned_addr++ = buffer;
|
|
|
|
*aligned_addr++ = buffer;
|
|
|
|
count -= 4 * LBLOCKSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (count >= LBLOCKSIZE)
|
|
|
|
{
|
|
|
|
*aligned_addr++ = buffer;
|
|
|
|
count -= LBLOCKSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Pick up the remainder with a bytewise loop. */
|
|
|
|
m = (char *)aligned_addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (count--)
|
|
|
|
{
|
|
|
|
*m++ = (char)d;
|
|
|
|
}
|
|
|
|
|
|
|
|
return s;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#undef LBLOCKSIZE
|
|
|
|
#undef UNALIGNED
|
|
|
|
#undef TOO_SMALL
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_KSERVICE_USING_TINY_SIZE */
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_memset);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will copy memory content from source address to destination address.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param dst is the address of destination memory, points to the copied content.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param src is the address of source memory, pointing to the data source to be copied.
|
|
|
|
*
|
|
|
|
* @param count is the copied length.
|
|
|
|
*
|
|
|
|
* @return The address of destination memory
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void *rt_memcpy(void *dst, const void *src, rt_ubase_t count)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2021-04-09 13:37:55 +08:00
|
|
|
#ifdef RT_KSERVICE_USING_TINY_SIZE
|
2012-12-25 16:23:12 +08:00
|
|
|
char *tmp = (char *)dst, *s = (char *)src;
|
2022-12-03 12:07:44 +08:00
|
|
|
rt_ubase_t len = 0;
|
2018-02-24 16:10:44 +08:00
|
|
|
|
|
|
|
if (tmp <= s || tmp > (s + count))
|
2017-11-02 11:12:55 +08:00
|
|
|
{
|
|
|
|
while (count--)
|
|
|
|
*tmp ++ = *s ++;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2018-02-24 16:10:44 +08:00
|
|
|
for (len = count; len > 0; len --)
|
|
|
|
tmp[len - 1] = s[len - 1];
|
2017-11-02 11:12:55 +08:00
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2018-02-24 16:10:44 +08:00
|
|
|
return dst;
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
|
|
|
|
2018-10-31 21:32:34 +08:00
|
|
|
#define UNALIGNED(X, Y) \
|
|
|
|
(((long)X & (sizeof (long) - 1)) | ((long)Y & (sizeof (long) - 1)))
|
|
|
|
#define BIGBLOCKSIZE (sizeof (long) << 2)
|
|
|
|
#define LITTLEBLOCKSIZE (sizeof (long))
|
2009-07-03 06:48:23 +08:00
|
|
|
#define TOO_SMALL(LEN) ((LEN) < BIGBLOCKSIZE)
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
char *dst_ptr = (char *)dst;
|
|
|
|
char *src_ptr = (char *)src;
|
2022-12-03 12:07:44 +08:00
|
|
|
long *aligned_dst = RT_NULL;
|
|
|
|
long *aligned_src = RT_NULL;
|
2022-08-03 00:09:49 +08:00
|
|
|
rt_ubase_t len = count;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* If the size is small, or either SRC or DST is unaligned,
|
|
|
|
then punt into the byte copy loop. This should be rare. */
|
|
|
|
if (!TOO_SMALL(len) && !UNALIGNED(src_ptr, dst_ptr))
|
|
|
|
{
|
2018-11-01 09:09:54 +08:00
|
|
|
aligned_dst = (long *)dst_ptr;
|
|
|
|
aligned_src = (long *)src_ptr;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* Copy 4X long words at a time if possible. */
|
|
|
|
while (len >= BIGBLOCKSIZE)
|
|
|
|
{
|
|
|
|
*aligned_dst++ = *aligned_src++;
|
|
|
|
*aligned_dst++ = *aligned_src++;
|
|
|
|
*aligned_dst++ = *aligned_src++;
|
|
|
|
*aligned_dst++ = *aligned_src++;
|
|
|
|
len -= BIGBLOCKSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Copy one long word at a time if possible. */
|
|
|
|
while (len >= LITTLEBLOCKSIZE)
|
|
|
|
{
|
|
|
|
*aligned_dst++ = *aligned_src++;
|
|
|
|
len -= LITTLEBLOCKSIZE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Pick up any residual with a byte copier. */
|
|
|
|
dst_ptr = (char *)aligned_dst;
|
|
|
|
src_ptr = (char *)aligned_src;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (len--)
|
|
|
|
*dst_ptr++ = *src_ptr++;
|
|
|
|
|
|
|
|
return dst;
|
2009-07-03 06:48:23 +08:00
|
|
|
#undef UNALIGNED
|
|
|
|
#undef BIGBLOCKSIZE
|
|
|
|
#undef LITTLEBLOCKSIZE
|
|
|
|
#undef TOO_SMALL
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_KSERVICE_USING_TINY_SIZE */
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_memcpy);
|
2021-02-28 05:07:02 +08:00
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will move memory content from source address to destination
|
2021-09-10 18:34:14 +08:00
|
|
|
* address. If the destination memory does not overlap with the source memory,
|
|
|
|
* the function is the same as memcpy().
|
|
|
|
*
|
2021-09-18 16:23:50 +08:00
|
|
|
* @param dest is the address of destination memory, points to the copied content.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param src is the address of source memory, point to the data source to be copied.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-18 16:23:50 +08:00
|
|
|
* @param n is the copied length.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @return The address of destination memory.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-12-21 02:33:44 +08:00
|
|
|
void *rt_memmove(void *dest, const void *src, rt_size_t n)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
char *tmp = (char *)dest, *s = (char *)src;
|
|
|
|
|
|
|
|
if (s < tmp && tmp < s + n)
|
|
|
|
{
|
|
|
|
tmp += n;
|
|
|
|
s += n;
|
|
|
|
|
|
|
|
while (n--)
|
|
|
|
*(--tmp) = *(--s);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
while (n--)
|
|
|
|
*tmp++ = *s++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return dest;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_memmove);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will compare two areas of memory.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @param cs is a block of memory.
|
|
|
|
*
|
|
|
|
* @param ct is another block of memory.
|
2011-09-21 11:56:42 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param count is the size of the area.
|
2011-09-21 11:56:42 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return Compare the results:
|
|
|
|
* If the result < 0, cs is smaller than ct.
|
|
|
|
* If the result > 0, cs is greater than ct.
|
|
|
|
* If the result = 0, cs is equal to ct.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-12-21 02:33:44 +08:00
|
|
|
rt_int32_t rt_memcmp(const void *cs, const void *ct, rt_size_t count)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
const unsigned char *su1 = RT_NULL, *su2 = RT_NULL;
|
2012-12-25 16:23:12 +08:00
|
|
|
int res = 0;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2019-06-18 20:09:19 +08:00
|
|
|
for (su1 = (const unsigned char *)cs, su2 = (const unsigned char *)ct; 0 < count; ++su1, ++su2, count--)
|
2012-12-25 16:23:12 +08:00
|
|
|
if ((res = *su1 - *su2) != 0)
|
|
|
|
break;
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return res;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_memcmp);
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KSERVICE_USING_STDLIB_MEMORY*/
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifndef RT_KSERVICE_USING_STDLIB
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will return the first occurrence of a string, without the
|
2021-09-10 18:34:14 +08:00
|
|
|
* terminator '\0'.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param s1 is the source string.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param s2 is the find string.
|
|
|
|
*
|
|
|
|
* @return The first occurrence of a s2 in s1, or RT_NULL if no found.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
char *rt_strstr(const char *s1, const char *s2)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
int l1 = 0, l2 = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
l2 = rt_strlen(s2);
|
|
|
|
if (!l2)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2022-12-16 18:38:28 +08:00
|
|
|
return (char *)s1;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
l1 = rt_strlen(s1);
|
|
|
|
while (l1 >= l2)
|
|
|
|
{
|
|
|
|
l1 --;
|
|
|
|
if (!rt_memcmp(s1, s2, l2))
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2022-12-16 18:38:28 +08:00
|
|
|
return (char *)s1;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
s1 ++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return RT_NULL;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strstr);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will compare two strings while ignoring differences in case
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param a is the string to be compared.
|
|
|
|
*
|
|
|
|
* @param b is the string to be compared.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return Compare the results:
|
|
|
|
* If the result < 0, a is smaller than a.
|
|
|
|
* If the result > 0, a is greater than a.
|
|
|
|
* If the result = 0, a is equal to a.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2020-03-24 18:59:31 +08:00
|
|
|
rt_int32_t rt_strcasecmp(const char *a, const char *b)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
int ca = 0, cb = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
ca = *a++ & 0xff;
|
|
|
|
cb = *b++ & 0xff;
|
|
|
|
if (ca >= 'A' && ca <= 'Z')
|
|
|
|
ca += 'a' - 'A';
|
|
|
|
if (cb >= 'A' && cb <= 'Z')
|
|
|
|
cb += 'a' - 'A';
|
|
|
|
}
|
|
|
|
while (ca == cb && ca != '\0');
|
|
|
|
|
|
|
|
return ca - cb;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strcasecmp);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will copy string no more than n bytes.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param dst points to the address used to store the copied content.
|
|
|
|
*
|
|
|
|
* @param src is the string to be copied.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param n is the maximum copied length.
|
|
|
|
*
|
|
|
|
* @return The address where the copied content is stored.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-12-21 02:33:44 +08:00
|
|
|
char *rt_strncpy(char *dst, const char *src, rt_size_t n)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
if (n != 0)
|
|
|
|
{
|
|
|
|
char *d = dst;
|
|
|
|
const char *s = src;
|
|
|
|
|
|
|
|
do
|
|
|
|
{
|
|
|
|
if ((*d++ = *s++) == 0)
|
|
|
|
{
|
|
|
|
/* NUL pad the remaining n-1 bytes */
|
|
|
|
while (--n != 0)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2022-12-16 18:38:28 +08:00
|
|
|
*d++ = 0;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
} while (--n != 0);
|
|
|
|
}
|
|
|
|
|
|
|
|
return (dst);
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strncpy);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2021-12-21 02:33:44 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will copy string.
|
2021-12-21 02:33:44 +08:00
|
|
|
*
|
|
|
|
* @param dst points to the address used to store the copied content.
|
|
|
|
*
|
|
|
|
* @param src is the string to be copied.
|
|
|
|
*
|
|
|
|
* @return The address where the copied content is stored.
|
|
|
|
*/
|
|
|
|
char *rt_strcpy(char *dst, const char *src)
|
|
|
|
{
|
2022-01-09 06:55:46 +08:00
|
|
|
char *dest = dst;
|
|
|
|
|
|
|
|
while (*src != '\0')
|
|
|
|
{
|
|
|
|
*dst = *src;
|
|
|
|
dst++;
|
|
|
|
src++;
|
|
|
|
}
|
|
|
|
|
|
|
|
*dst = '\0';
|
|
|
|
return dest;
|
2021-12-21 02:33:44 +08:00
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_strcpy);
|
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will compare two strings with specified maximum length.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @param cs is the string to be compared.
|
|
|
|
*
|
|
|
|
* @param ct is the string to be compared.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param count is the maximum compare length.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return Compare the results:
|
|
|
|
* If the result < 0, cs is smaller than ct.
|
|
|
|
* If the result > 0, cs is greater than ct.
|
|
|
|
* If the result = 0, cs is equal to ct.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-12-21 02:33:44 +08:00
|
|
|
rt_int32_t rt_strncmp(const char *cs, const char *ct, rt_size_t count)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2022-04-29 06:34:42 +08:00
|
|
|
signed char __res = 0;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
while (count)
|
|
|
|
{
|
|
|
|
if ((__res = *cs - *ct++) != 0 || !*cs++)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2022-12-16 18:38:28 +08:00
|
|
|
break;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
count --;
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return __res;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strncmp);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2010-10-19 17:25:00 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will compare two strings without specified length.
|
2010-10-19 17:25:00 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param cs is the string to be compared.
|
2010-10-19 17:25:00 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param ct is the string to be compared.
|
|
|
|
*
|
|
|
|
* @return Compare the results:
|
|
|
|
* If the result < 0, cs is smaller than ct.
|
|
|
|
* If the result > 0, cs is greater than ct.
|
|
|
|
* If the result = 0, cs is equal to ct.
|
2010-10-19 17:25:00 +08:00
|
|
|
*/
|
2015-05-20 20:37:40 +08:00
|
|
|
rt_int32_t rt_strcmp(const char *cs, const char *ct)
|
2010-10-19 17:25:00 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
while (*cs && *cs == *ct)
|
2021-03-08 11:25:38 +08:00
|
|
|
{
|
2020-07-27 14:18:16 +08:00
|
|
|
cs++;
|
|
|
|
ct++;
|
|
|
|
}
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return (*cs - *ct);
|
2010-10-19 17:25:00 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strcmp);
|
2019-03-09 15:46:56 +08:00
|
|
|
|
2016-08-12 22:14:07 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will return the length of a string, which terminate will
|
2021-10-12 04:02:46 +08:00
|
|
|
* null character.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
2021-10-12 04:02:46 +08:00
|
|
|
* @param s is the string
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @return The length of string.
|
2016-08-12 22:14:07 +08:00
|
|
|
*/
|
2021-10-12 04:02:46 +08:00
|
|
|
rt_size_t rt_strlen(const char *s)
|
2016-08-12 22:14:07 +08:00
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
const char *sc = RT_NULL;
|
2016-08-12 22:14:07 +08:00
|
|
|
|
2021-10-12 04:02:46 +08:00
|
|
|
for (sc = s; *sc != '\0'; ++sc) /* nothing */
|
2016-08-12 22:14:07 +08:00
|
|
|
;
|
2010-10-19 17:25:00 +08:00
|
|
|
|
2016-08-12 22:14:07 +08:00
|
|
|
return sc - s;
|
|
|
|
}
|
2021-10-12 04:02:46 +08:00
|
|
|
RTM_EXPORT(rt_strlen);
|
2019-03-09 15:46:56 +08:00
|
|
|
|
2021-10-12 04:02:46 +08:00
|
|
|
#endif /* RT_KSERVICE_USING_STDLIB */
|
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief The strnlen() function returns the number of characters in the
|
2021-10-12 04:02:46 +08:00
|
|
|
* string pointed to by s, excluding the terminating null byte ('\0'),
|
|
|
|
* but at most maxlen. In doing this, strnlen() looks only at the
|
|
|
|
* first maxlen characters in the string pointed to by s and never
|
|
|
|
* beyond s+maxlen.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-10-12 04:02:46 +08:00
|
|
|
* @param s is the string.
|
|
|
|
*
|
|
|
|
* @param maxlen is the max size.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return The length of string.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-10-12 04:02:46 +08:00
|
|
|
rt_size_t rt_strnlen(const char *s, rt_ubase_t maxlen)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
const char *sc;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2021-10-12 04:02:46 +08:00
|
|
|
for (sc = s; *sc != '\0' && (rt_ubase_t)(sc - s) < maxlen; ++sc) /* nothing */
|
2012-12-25 16:23:12 +08:00
|
|
|
;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return sc - s;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2021-10-12 04:02:46 +08:00
|
|
|
RTM_EXPORT(rt_strnlen);
|
2021-02-28 05:07:02 +08:00
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_USING_HEAP
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will duplicate a string.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param s is the string to be duplicated.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return The string address of the copy.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
|
|
|
char *rt_strdup(const char *s)
|
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_size_t len = rt_strlen(s) + 1;
|
|
|
|
char *tmp = (char *)rt_malloc(len);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
if (!tmp)
|
2022-12-03 12:07:44 +08:00
|
|
|
{
|
2022-12-16 18:38:28 +08:00
|
|
|
return RT_NULL;
|
2022-12-03 12:07:44 +08:00
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_memcpy(tmp, s, len);
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return tmp;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strdup);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_HEAP */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will show the version of rt-thread rtos
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void rt_show_version(void)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_kprintf("\n \\ | /\n");
|
2023-12-06 20:26:05 +08:00
|
|
|
#if defined(RT_USING_SMART)
|
2023-02-02 16:36:55 +08:00
|
|
|
rt_kprintf("- RT - Thread Smart Operating System\n");
|
2023-12-06 20:26:05 +08:00
|
|
|
#elif defined(RT_USING_NANO)
|
|
|
|
rt_kprintf("- RT - Thread Nano Operating System\n");
|
2023-02-02 16:36:55 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_kprintf("- RT - Thread Operating System\n");
|
2023-02-02 16:36:55 +08:00
|
|
|
#endif
|
2021-10-10 15:41:03 +08:00
|
|
|
rt_kprintf(" / | \\ %d.%d.%d build %s %s\n",
|
2022-08-29 01:25:47 +08:00
|
|
|
(rt_int32_t)RT_VERSION_MAJOR, (rt_int32_t)RT_VERSION_MINOR, (rt_int32_t)RT_VERSION_PATCH, __DATE__, __TIME__);
|
2022-01-24 14:20:09 +08:00
|
|
|
rt_kprintf(" 2006 - 2022 Copyright by RT-Thread team\n");
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_show_version);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/* private function */
|
2020-07-24 11:53:57 +08:00
|
|
|
#define _ISDIGIT(c) ((unsigned)((c) - '0') < 10)
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2021-09-10 18:34:14 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will duplicate a string.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
2021-09-18 16:23:50 +08:00
|
|
|
* @param n is the string to be duplicated.
|
|
|
|
*
|
|
|
|
* @param base is support divide instructions value.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
2021-09-18 16:23:50 +08:00
|
|
|
* @return the duplicated string pointer.
|
2021-09-10 18:34:14 +08:00
|
|
|
*/
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2023-02-20 18:14:34 +08:00
|
|
|
rt_inline int divide(unsigned long long *n, int base)
|
2021-11-28 07:25:33 +08:00
|
|
|
#else
|
2023-02-20 18:14:34 +08:00
|
|
|
rt_inline int divide(unsigned long *n, int base)
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2019-05-16 10:24:54 +08:00
|
|
|
{
|
|
|
|
int res;
|
|
|
|
|
|
|
|
/* optimized for processor which does not support divide instructions. */
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2023-02-20 18:14:34 +08:00
|
|
|
res = (int)((*n) % base);
|
|
|
|
*n = (long long)((*n) / base);
|
2021-11-28 07:25:33 +08:00
|
|
|
#else
|
2023-02-20 18:14:34 +08:00
|
|
|
res = (int)((*n) % base);
|
|
|
|
*n = (long)((*n) / base);
|
2021-11-28 07:25:33 +08:00
|
|
|
#endif
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
return res;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
rt_inline int skip_atoi(const char **s)
|
|
|
|
{
|
2022-04-29 06:34:42 +08:00
|
|
|
int i = 0;
|
2020-07-24 11:53:57 +08:00
|
|
|
while (_ISDIGIT(**s))
|
2012-12-25 16:23:12 +08:00
|
|
|
i = i * 10 + *((*s)++) - '0';
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return i;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
#define ZEROPAD (1 << 0) /* pad with zero */
|
|
|
|
#define SIGN (1 << 1) /* unsigned/signed long */
|
|
|
|
#define PLUS (1 << 2) /* show plus */
|
|
|
|
#define SPACE (1 << 3) /* space if plus */
|
|
|
|
#define LEFT (1 << 4) /* left justified */
|
|
|
|
#define SPECIAL (1 << 5) /* 0x */
|
|
|
|
#define LARGE (1 << 6) /* use 'ABCDEF' instead of 'abcdef' */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
static char *print_number(char *buf,
|
|
|
|
char *end,
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2023-02-20 18:14:34 +08:00
|
|
|
unsigned long long num,
|
2019-05-16 10:24:54 +08:00
|
|
|
#else
|
2023-02-20 18:14:34 +08:00
|
|
|
unsigned long num,
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
int base,
|
2023-02-20 18:14:34 +08:00
|
|
|
int qualifier,
|
2012-12-25 16:23:12 +08:00
|
|
|
int s,
|
2021-11-28 08:40:52 +08:00
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
int precision,
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2021-11-28 08:40:52 +08:00
|
|
|
int type)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
char c = 0, sign = 0;
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2023-02-20 18:14:34 +08:00
|
|
|
char tmp[64] = {0};
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2023-02-20 18:14:34 +08:00
|
|
|
char tmp[32] = {0};
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2019-01-21 18:35:13 +08:00
|
|
|
int precision_bak = precision;
|
2023-02-20 18:14:34 +08:00
|
|
|
const char *digits = RT_NULL;
|
2012-12-25 16:23:12 +08:00
|
|
|
static const char small_digits[] = "0123456789abcdef";
|
|
|
|
static const char large_digits[] = "0123456789ABCDEF";
|
2023-02-20 18:14:34 +08:00
|
|
|
int i = 0;
|
|
|
|
int size = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
size = s;
|
|
|
|
|
|
|
|
digits = (type & LARGE) ? large_digits : small_digits;
|
|
|
|
if (type & LEFT)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
type &= ~ZEROPAD;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
c = (type & ZEROPAD) ? '0' : ' ';
|
|
|
|
|
|
|
|
/* get sign */
|
|
|
|
sign = 0;
|
|
|
|
if (type & SIGN)
|
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
switch (qualifier)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
case 'h':
|
|
|
|
if ((rt_int16_t)num < 0)
|
|
|
|
{
|
|
|
|
sign = '-';
|
|
|
|
num = (rt_uint16_t)-num;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 'L':
|
|
|
|
case 'l':
|
|
|
|
if ((long)num < 0)
|
|
|
|
{
|
|
|
|
sign = '-';
|
|
|
|
num = (unsigned long)-num;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case 0:
|
|
|
|
default:
|
|
|
|
if ((rt_int32_t)num < 0)
|
|
|
|
{
|
|
|
|
sign = '-';
|
|
|
|
num = (rt_uint32_t)-num;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (sign != '-')
|
|
|
|
{
|
|
|
|
if (type & PLUS)
|
|
|
|
{
|
|
|
|
sign = '+';
|
|
|
|
}
|
|
|
|
else if (type & SPACE)
|
|
|
|
{
|
|
|
|
sign = ' ';
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_SPECIAL
|
2012-12-25 16:23:12 +08:00
|
|
|
if (type & SPECIAL)
|
|
|
|
{
|
2022-09-02 10:00:28 +08:00
|
|
|
if (base == 2 || base == 16)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
size -= 2;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
else if (base == 8)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
size--;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_SPECIAL */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
i = 0;
|
|
|
|
if (num == 0)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
tmp[i++] = '0';
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
else
|
|
|
|
{
|
|
|
|
while (num != 0)
|
|
|
|
tmp[i++] = digits[divide(&num, base)];
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
if (i > precision)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
precision = i;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
size -= precision;
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
size -= i;
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2017-09-15 11:02:24 +08:00
|
|
|
if (!(type & (ZEROPAD | LEFT)))
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
if ((sign) && (size > 0))
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
size--;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
|
2017-09-15 11:02:24 +08:00
|
|
|
while (size-- > 0)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = ' ';
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (sign)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
|
|
|
*buf = sign;
|
|
|
|
}
|
2019-03-23 16:36:54 +08:00
|
|
|
-- size;
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_SPECIAL
|
2012-12-25 16:23:12 +08:00
|
|
|
if (type & SPECIAL)
|
|
|
|
{
|
2022-09-02 10:00:28 +08:00
|
|
|
if (base == 2)
|
|
|
|
{
|
|
|
|
if (buf < end)
|
|
|
|
*buf = '0';
|
|
|
|
++ buf;
|
|
|
|
if (buf < end)
|
|
|
|
*buf = 'b';
|
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
else if (base == 8)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = '0';
|
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
else if (base == 16)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = '0';
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
*buf = type & LARGE ? 'X' : 'x';
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_SPECIAL */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
/* no align to the left */
|
|
|
|
if (!(type & LEFT))
|
|
|
|
{
|
|
|
|
while (size-- > 0)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = c;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
while (i < precision--)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = '0';
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
/* put number in the temporary buffer */
|
2019-01-21 18:35:13 +08:00
|
|
|
while (i-- > 0 && (precision_bak != 0))
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = tmp[i];
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (size-- > 0)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = ' ';
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
return buf;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
|
|
|
|
2021-09-10 18:34:14 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will fill a formatted string to buffer.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @param buf is the buffer to save formatted string.
|
|
|
|
*
|
|
|
|
* @param size is the size of buffer.
|
|
|
|
*
|
|
|
|
* @param fmt is the format parameters.
|
|
|
|
*
|
|
|
|
* @param args is a list of variable parameters.
|
|
|
|
*
|
|
|
|
* @return The number of characters actually written to buffer.
|
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak int rt_vsnprintf(char *buf, rt_size_t size, const char *fmt, va_list args)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2023-02-20 18:14:34 +08:00
|
|
|
unsigned long long num = 0;
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2023-02-20 18:14:34 +08:00
|
|
|
unsigned long num = 0;
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2023-02-20 18:14:34 +08:00
|
|
|
int i = 0, len = 0;
|
|
|
|
char *str = RT_NULL, *end = RT_NULL, c = 0;
|
|
|
|
const char *s = RT_NULL;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2023-02-20 18:14:34 +08:00
|
|
|
rt_uint8_t base = 0; /* the base of number */
|
|
|
|
rt_uint8_t flags = 0; /* flags to print number */
|
|
|
|
rt_uint8_t qualifier = 0; /* 'h', 'l', or 'L' for integer fields */
|
|
|
|
rt_int32_t field_width = 0; /* width of output field */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2023-02-20 18:14:34 +08:00
|
|
|
int precision = 0; /* min. # of digits for integers and max for a string */
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
str = buf;
|
2019-03-23 16:36:54 +08:00
|
|
|
end = buf + size;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* Make sure end is always >= buf */
|
|
|
|
if (end < buf)
|
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
end = ((char *) - 1);
|
2012-12-25 16:23:12 +08:00
|
|
|
size = end - buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (; *fmt ; ++fmt)
|
|
|
|
{
|
|
|
|
if (*fmt != '%')
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
*str = *fmt;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* process flags */
|
|
|
|
flags = 0;
|
|
|
|
|
|
|
|
while (1)
|
|
|
|
{
|
|
|
|
/* skips the first '%' also */
|
|
|
|
++ fmt;
|
|
|
|
if (*fmt == '-') flags |= LEFT;
|
|
|
|
else if (*fmt == '+') flags |= PLUS;
|
|
|
|
else if (*fmt == ' ') flags |= SPACE;
|
|
|
|
else if (*fmt == '#') flags |= SPECIAL;
|
|
|
|
else if (*fmt == '0') flags |= ZEROPAD;
|
|
|
|
else break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get field width */
|
|
|
|
field_width = -1;
|
2023-02-20 18:14:34 +08:00
|
|
|
if (_ISDIGIT(*fmt))
|
|
|
|
{
|
|
|
|
field_width = skip_atoi(&fmt);
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
else if (*fmt == '*')
|
|
|
|
{
|
|
|
|
++ fmt;
|
|
|
|
/* it's the next argument */
|
|
|
|
field_width = va_arg(args, int);
|
|
|
|
if (field_width < 0)
|
|
|
|
{
|
|
|
|
field_width = -field_width;
|
|
|
|
flags |= LEFT;
|
|
|
|
}
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
/* get the precision */
|
|
|
|
precision = -1;
|
|
|
|
if (*fmt == '.')
|
|
|
|
{
|
|
|
|
++ fmt;
|
2023-02-20 18:14:34 +08:00
|
|
|
if (_ISDIGIT(*fmt))
|
|
|
|
{
|
|
|
|
precision = skip_atoi(&fmt);
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
else if (*fmt == '*')
|
|
|
|
{
|
|
|
|
++ fmt;
|
|
|
|
/* it's the next argument */
|
|
|
|
precision = va_arg(args, int);
|
|
|
|
}
|
2023-02-20 18:14:34 +08:00
|
|
|
if (precision < 0)
|
|
|
|
{
|
|
|
|
precision = 0;
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2012-12-25 16:23:12 +08:00
|
|
|
/* get the conversion qualifier */
|
|
|
|
qualifier = 0;
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2012-12-25 16:23:12 +08:00
|
|
|
if (*fmt == 'h' || *fmt == 'l' || *fmt == 'L')
|
2012-03-22 13:57:54 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
if (*fmt == 'h' || *fmt == 'l')
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
|
|
|
qualifier = *fmt;
|
|
|
|
++ fmt;
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2012-12-25 16:23:12 +08:00
|
|
|
if (qualifier == 'l' && *fmt == 'l')
|
|
|
|
{
|
|
|
|
qualifier = 'L';
|
|
|
|
++ fmt;
|
|
|
|
}
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* the default base */
|
|
|
|
base = 10;
|
|
|
|
|
|
|
|
switch (*fmt)
|
|
|
|
{
|
|
|
|
case 'c':
|
|
|
|
if (!(flags & LEFT))
|
|
|
|
{
|
|
|
|
while (--field_width > 0)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end) *str = ' ';
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get character */
|
|
|
|
c = (rt_uint8_t)va_arg(args, int);
|
2023-02-20 18:14:34 +08:00
|
|
|
if (str < end)
|
|
|
|
{
|
|
|
|
*str = c;
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
|
|
|
|
/* put width */
|
|
|
|
while (--field_width > 0)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end) *str = ' ';
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
|
|
|
|
case 's':
|
|
|
|
s = va_arg(args, char *);
|
2023-02-20 18:14:34 +08:00
|
|
|
if (!s)
|
|
|
|
{
|
|
|
|
s = "(NULL)";
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
|
2021-05-07 14:53:48 +08:00
|
|
|
for (len = 0; (len != field_width) && (s[len] != '\0'); len++);
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2023-02-20 18:14:34 +08:00
|
|
|
if (precision > 0 && len > precision)
|
|
|
|
{
|
|
|
|
len = precision;
|
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
if (!(flags & LEFT))
|
|
|
|
{
|
|
|
|
while (len < field_width--)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end) *str = ' ';
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i = 0; i < len; ++i)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end) *str = *s;
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
++ s;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (len < field_width--)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end) *str = ' ';
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
|
|
|
|
case 'p':
|
|
|
|
if (field_width == -1)
|
|
|
|
{
|
|
|
|
field_width = sizeof(void *) << 1;
|
2023-02-20 18:14:34 +08:00
|
|
|
#ifdef RT_PRINTF_SPECIAL
|
|
|
|
field_width += 2; /* `0x` prefix */
|
|
|
|
flags |= SPECIAL;
|
|
|
|
#endif
|
2012-12-25 16:23:12 +08:00
|
|
|
flags |= ZEROPAD;
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
str = print_number(str, end,
|
2023-02-20 18:14:34 +08:00
|
|
|
(unsigned long)va_arg(args, void *),
|
|
|
|
16, qualifier, field_width, precision, flags);
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
str = print_number(str, end,
|
2023-02-20 18:14:34 +08:00
|
|
|
(unsigned long)va_arg(args, void *),
|
|
|
|
16, qualifier, field_width, flags);
|
|
|
|
#endif
|
2012-12-25 16:23:12 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
case '%':
|
2023-02-20 18:14:34 +08:00
|
|
|
if (str < end)
|
|
|
|
{
|
|
|
|
*str = '%';
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
continue;
|
|
|
|
|
2017-09-15 11:02:24 +08:00
|
|
|
/* integer number formats - set up the flags and "break" */
|
2022-09-02 10:00:28 +08:00
|
|
|
case 'b':
|
|
|
|
base = 2;
|
|
|
|
break;
|
2012-12-25 16:23:12 +08:00
|
|
|
case 'o':
|
|
|
|
base = 8;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'X':
|
|
|
|
flags |= LARGE;
|
|
|
|
case 'x':
|
|
|
|
base = 16;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case 'd':
|
|
|
|
case 'i':
|
|
|
|
flags |= SIGN;
|
|
|
|
case 'u':
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2023-02-20 18:14:34 +08:00
|
|
|
if (str < end)
|
|
|
|
{
|
|
|
|
*str = '%';
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
|
|
|
|
if (*fmt)
|
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
if (str < end)
|
|
|
|
{
|
|
|
|
*str = *fmt;
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
-- fmt;
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2022-04-09 00:40:36 +08:00
|
|
|
#ifdef RT_KPRINTF_USING_LONGLONG
|
2023-02-20 18:14:34 +08:00
|
|
|
if (qualifier == 'L')
|
|
|
|
{
|
|
|
|
num = va_arg(args, unsigned long long);
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
else if (qualifier == 'l')
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
if (qualifier == 'l')
|
2022-04-09 00:40:36 +08:00
|
|
|
#endif /* RT_KPRINTF_USING_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
num = va_arg(args, unsigned long);
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
else if (qualifier == 'h')
|
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
num = (rt_uint16_t)va_arg(args, rt_int32_t);
|
|
|
|
if (flags & SIGN)
|
|
|
|
{
|
|
|
|
num = (rt_int16_t)num;
|
|
|
|
}
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
num = (rt_uint32_t)va_arg(args, unsigned long);
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2023-02-20 18:14:34 +08:00
|
|
|
str = print_number(str, end, num, base, qualifier, field_width, precision, flags);
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2023-02-20 18:14:34 +08:00
|
|
|
str = print_number(str, end, num, base, qualifier, field_width, flags);
|
|
|
|
#endif
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2019-03-23 16:36:54 +08:00
|
|
|
if (size > 0)
|
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
if (str < end)
|
|
|
|
{
|
|
|
|
*str = '\0';
|
|
|
|
}
|
2019-03-23 16:36:54 +08:00
|
|
|
else
|
|
|
|
{
|
|
|
|
end[-1] = '\0';
|
|
|
|
}
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
/* the trailing null byte doesn't count towards the total
|
|
|
|
* ++str;
|
|
|
|
*/
|
|
|
|
return str - buf;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2013-09-23 11:27:48 +08:00
|
|
|
RTM_EXPORT(rt_vsnprintf);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will fill a formatted string to buffer.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param buf is the buffer to save formatted string.
|
|
|
|
*
|
|
|
|
* @param size is the size of buffer.
|
|
|
|
*
|
|
|
|
* @param fmt is the format parameters.
|
|
|
|
*
|
|
|
|
* @return The number of characters actually written to buffer.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-11-16 16:41:26 +08:00
|
|
|
int rt_snprintf(char *buf, rt_size_t size, const char *fmt, ...)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
rt_int32_t n = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
va_list args;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
va_start(args, fmt);
|
2013-09-23 11:27:48 +08:00
|
|
|
n = rt_vsnprintf(buf, size, fmt, args);
|
2012-12-25 16:23:12 +08:00
|
|
|
va_end(args);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return n;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_snprintf);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will fill a formatted string to buffer.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @param buf is the buffer to save formatted string.
|
|
|
|
*
|
|
|
|
* @param format is the format parameters.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param arg_ptr is a list of variable parameters.
|
|
|
|
*
|
|
|
|
* @return The number of characters actually written to buffer.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-11-16 16:41:26 +08:00
|
|
|
int rt_vsprintf(char *buf, const char *format, va_list arg_ptr)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
return rt_vsnprintf(buf, (rt_size_t) - 1, format, arg_ptr);
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_vsprintf);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will fill a formatted string to buffer
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param buf the buffer to save formatted string.
|
|
|
|
*
|
|
|
|
* @param format is the format parameters.
|
|
|
|
*
|
|
|
|
* @return The number of characters actually written to buffer.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-11-16 16:41:26 +08:00
|
|
|
int rt_sprintf(char *buf, const char *format, ...)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
rt_int32_t n = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
va_list arg_ptr;
|
2009-12-25 20:18:53 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
va_start(arg_ptr, format);
|
2017-09-15 11:02:24 +08:00
|
|
|
n = rt_vsprintf(buf, format, arg_ptr);
|
2012-12-25 16:23:12 +08:00
|
|
|
va_end(arg_ptr);
|
2009-12-25 20:18:53 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
return n;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_sprintf);
|
2010-03-17 12:19:17 +08:00
|
|
|
|
2011-06-09 18:48:59 +08:00
|
|
|
#ifdef RT_USING_CONSOLE
|
|
|
|
|
2011-01-24 21:40:42 +08:00
|
|
|
#ifdef RT_USING_DEVICE
|
2011-09-25 10:28:07 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function returns the device using in console.
|
2011-09-25 10:28:07 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return Returns the console device pointer or RT_NULL.
|
2011-09-25 10:28:07 +08:00
|
|
|
*/
|
|
|
|
rt_device_t rt_console_get_device(void)
|
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
return _console_device;
|
2011-09-25 10:28:07 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_console_get_device);
|
2011-09-25 10:28:07 +08:00
|
|
|
|
2010-03-09 07:09:40 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will set a device as console device.
|
2010-03-09 07:09:40 +08:00
|
|
|
* After set a device to console, all output of rt_kprintf will be
|
2010-11-29 08:04:55 +08:00
|
|
|
* redirected to this new device.
|
2010-03-09 07:09:40 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param name is the name of new console device.
|
2010-03-09 07:09:40 +08:00
|
|
|
*
|
2020-10-30 10:32:44 +08:00
|
|
|
* @return the old console device handler on successful, or RT_NULL on failure.
|
2010-03-09 07:09:40 +08:00
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
rt_device_t rt_console_set_device(const char *name)
|
2010-03-09 07:09:40 +08:00
|
|
|
{
|
2022-12-16 18:38:28 +08:00
|
|
|
#ifdef RT_USING_SMART
|
2022-12-03 12:07:44 +08:00
|
|
|
rt_device_t new_iodev = RT_NULL, old_iodev = RT_NULL;
|
2023-05-05 08:19:09 +08:00
|
|
|
|
2022-12-03 12:07:44 +08:00
|
|
|
/* find new console device */
|
|
|
|
new_iodev = rt_device_find(name);
|
|
|
|
if (new_iodev != RT_NULL)
|
|
|
|
{
|
|
|
|
if (_console_device != RT_NULL)
|
|
|
|
{
|
|
|
|
old_iodev = console_set_iodev(new_iodev);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
console_register("console", new_iodev);
|
|
|
|
_console_device = rt_device_find("console");
|
|
|
|
rt_device_open(_console_device, RT_DEVICE_OFLAG_RDWR | RT_DEVICE_FLAG_STREAM);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return old_iodev;
|
|
|
|
#else
|
2019-06-18 20:09:19 +08:00
|
|
|
rt_device_t new_device, old_device;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* save old device */
|
2019-06-18 20:09:19 +08:00
|
|
|
old_device = _console_device;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* find new console device */
|
2019-06-18 20:09:19 +08:00
|
|
|
new_device = rt_device_find(name);
|
2021-03-08 11:25:38 +08:00
|
|
|
|
2020-10-30 10:32:44 +08:00
|
|
|
/* check whether it's a same device */
|
|
|
|
if (new_device == old_device) return RT_NULL;
|
2021-03-08 11:25:38 +08:00
|
|
|
|
2019-06-18 20:09:19 +08:00
|
|
|
if (new_device != RT_NULL)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
|
|
|
if (_console_device != RT_NULL)
|
|
|
|
{
|
|
|
|
/* close old console device */
|
|
|
|
rt_device_close(_console_device);
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set new console device */
|
2019-06-18 20:09:19 +08:00
|
|
|
rt_device_open(new_device, RT_DEVICE_OFLAG_RDWR | RT_DEVICE_FLAG_STREAM);
|
|
|
|
_console_device = new_device;
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
|
2019-06-18 20:09:19 +08:00
|
|
|
return old_device;
|
2022-12-03 12:07:44 +08:00
|
|
|
#endif
|
2010-03-17 12:19:17 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_console_set_device);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_DEVICE */
|
2010-03-09 07:09:40 +08:00
|
|
|
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void rt_hw_console_output(const char *str)
|
2010-03-09 07:09:40 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
/* empty console output */
|
2010-03-09 07:09:40 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_hw_console_output);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2024-01-09 20:37:47 +08:00
|
|
|
#ifdef RT_USING_THREDSAFE_PRINTF
|
|
|
|
|
|
|
|
static struct rt_spinlock _pr_lock = RT_SPINLOCK_INIT;
|
|
|
|
static struct rt_spinlock _prf_lock = RT_SPINLOCK_INIT;
|
|
|
|
/* current user of system console */
|
|
|
|
static rt_thread_t _pr_curr_user;
|
|
|
|
/* nested level of current user */
|
|
|
|
static int _pr_curr_user_nested;
|
|
|
|
|
|
|
|
rt_thread_t rt_console_current_user(void)
|
|
|
|
{
|
|
|
|
return _pr_curr_user;
|
|
|
|
}
|
|
|
|
|
2024-01-11 13:02:24 +08:00
|
|
|
static void _console_take(void)
|
2024-01-09 20:37:47 +08:00
|
|
|
{
|
|
|
|
rt_ubase_t level = rt_spin_lock_irqsave(&_pr_lock);
|
|
|
|
rt_thread_t self_thread = rt_thread_self();
|
|
|
|
|
|
|
|
while (_pr_curr_user != self_thread)
|
|
|
|
{
|
|
|
|
if (_pr_curr_user == RT_NULL)
|
|
|
|
{
|
|
|
|
/* no preemption is allowed to avoid dead lock */
|
|
|
|
rt_enter_critical();
|
|
|
|
_pr_curr_user = self_thread;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
rt_spin_unlock_irqrestore(&_pr_lock, level);
|
|
|
|
rt_thread_yield();
|
|
|
|
level = rt_spin_lock_irqsave(&_pr_lock);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
_pr_curr_user_nested++;
|
|
|
|
|
|
|
|
rt_spin_unlock_irqrestore(&_pr_lock, level);
|
|
|
|
}
|
|
|
|
|
2024-01-11 13:02:24 +08:00
|
|
|
static void _console_release(void)
|
2024-01-09 20:37:47 +08:00
|
|
|
{
|
|
|
|
rt_ubase_t level = rt_spin_lock_irqsave(&_pr_lock);
|
|
|
|
rt_thread_t self_thread = rt_thread_self();
|
|
|
|
|
|
|
|
RT_ASSERT(_pr_curr_user == self_thread);
|
|
|
|
|
|
|
|
_pr_curr_user_nested--;
|
|
|
|
if (!_pr_curr_user_nested)
|
|
|
|
{
|
|
|
|
_pr_curr_user = RT_NULL;
|
|
|
|
rt_exit_critical();
|
|
|
|
}
|
|
|
|
rt_spin_unlock_irqrestore(&_pr_lock, level);
|
|
|
|
}
|
|
|
|
|
2024-01-11 13:02:24 +08:00
|
|
|
#define CONSOLE_TAKE _console_take()
|
|
|
|
#define CONSOLE_RELEASE _console_release()
|
|
|
|
#define PRINTF_BUFFER_TAKE rt_ubase_t level = rt_spin_lock_irqsave(&_prf_lock)
|
|
|
|
#define PRINTF_BUFFER_RELEASE rt_spin_unlock_irqrestore(&_prf_lock, level)
|
2024-01-09 20:37:47 +08:00
|
|
|
#else
|
|
|
|
|
2024-01-11 13:02:24 +08:00
|
|
|
#define CONSOLE_TAKE
|
|
|
|
#define CONSOLE_RELEASE
|
|
|
|
#define PRINTF_BUFFER_TAKE
|
|
|
|
#define PRINTF_BUFFER_RELEASE
|
2024-01-09 20:37:47 +08:00
|
|
|
#endif /* RT_USING_THREDSAFE_PRINTF */
|
|
|
|
|
2017-01-31 13:18:20 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will put string to the console.
|
2017-01-31 13:18:20 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param str is the string output to the console.
|
2017-01-31 13:18:20 +08:00
|
|
|
*/
|
2024-01-09 20:37:47 +08:00
|
|
|
static void _kputs(const char *str, long len)
|
2017-01-31 13:18:20 +08:00
|
|
|
{
|
2024-01-11 13:02:24 +08:00
|
|
|
CONSOLE_TAKE;
|
2017-10-15 22:31:53 +08:00
|
|
|
|
2017-01-31 13:18:20 +08:00
|
|
|
#ifdef RT_USING_DEVICE
|
|
|
|
if (_console_device == RT_NULL)
|
|
|
|
{
|
|
|
|
rt_hw_console_output(str);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2024-01-09 20:37:47 +08:00
|
|
|
rt_device_write(_console_device, 0, str, len);
|
2017-01-31 13:18:20 +08:00
|
|
|
}
|
|
|
|
#else
|
|
|
|
rt_hw_console_output(str);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_DEVICE */
|
2024-01-09 20:37:47 +08:00
|
|
|
|
2024-01-11 13:02:24 +08:00
|
|
|
CONSOLE_RELEASE;
|
2024-01-09 20:37:47 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will put string to the console.
|
|
|
|
*
|
|
|
|
* @param str is the string output to the console.
|
|
|
|
*/
|
|
|
|
void rt_kputs(const char *str)
|
|
|
|
{
|
|
|
|
if (!str)
|
|
|
|
{
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
_kputs(str, rt_strlen(str));
|
2017-01-31 13:18:20 +08:00
|
|
|
}
|
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function will print a formatted string on system console.
|
2009-07-03 06:48:23 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param fmt is the format parameters.
|
2021-11-17 05:37:34 +08:00
|
|
|
*
|
|
|
|
* @return The number of characters actually written to buffer.
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak int rt_kprintf(const char *fmt, ...)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
va_list args;
|
2023-02-20 18:14:34 +08:00
|
|
|
rt_size_t length = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
static char rt_log_buf[RT_CONSOLEBUF_SIZE];
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
2024-01-11 13:02:24 +08:00
|
|
|
PRINTF_BUFFER_TAKE;
|
2024-01-09 20:37:47 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
/* the return value of vsnprintf is the number of bytes that would be
|
|
|
|
* written to buffer had if the size of the buffer been sufficiently
|
|
|
|
* large excluding the terminating null byte. If the output string
|
|
|
|
* would be larger than the rt_log_buf, we have to adjust the output
|
|
|
|
* length. */
|
2013-09-23 11:27:48 +08:00
|
|
|
length = rt_vsnprintf(rt_log_buf, sizeof(rt_log_buf) - 1, fmt, args);
|
2012-12-25 16:23:12 +08:00
|
|
|
if (length > RT_CONSOLEBUF_SIZE - 1)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
length = RT_CONSOLEBUF_SIZE - 1;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
|
|
|
|
2024-01-09 20:37:47 +08:00
|
|
|
_kputs(rt_log_buf, length);
|
|
|
|
|
2024-01-11 13:02:24 +08:00
|
|
|
PRINTF_BUFFER_RELEASE;
|
2012-12-25 16:23:12 +08:00
|
|
|
va_end(args);
|
2021-11-16 16:41:26 +08:00
|
|
|
|
2021-11-17 05:37:34 +08:00
|
|
|
return length;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_kprintf);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_CONSOLE */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2023-10-21 20:14:45 +08:00
|
|
|
#ifdef __GNUC__
|
|
|
|
rt_weak rt_err_t rt_backtrace(void)
|
|
|
|
{
|
|
|
|
struct rt_hw_backtrace_frame frame = {
|
|
|
|
.fp = (rt_base_t)__builtin_frame_address(0U),
|
|
|
|
.pc = ({__label__ pc; pc: (rt_base_t)&&pc;})
|
|
|
|
};
|
|
|
|
rt_hw_backtrace_frame_unwind(rt_thread_self(), &frame);
|
|
|
|
return rt_backtrace_frame(&frame);
|
|
|
|
}
|
|
|
|
|
|
|
|
#else /* otherwise not implemented */
|
|
|
|
rt_weak rt_err_t rt_backtrace(void)
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
/* LOG_W cannot work under this environment */
|
|
|
|
rt_kprintf("%s is not implemented\n", __func__);
|
2023-10-21 20:14:45 +08:00
|
|
|
return -RT_ENOSYS;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
rt_err_t rt_backtrace_frame(struct rt_hw_backtrace_frame *frame)
|
|
|
|
{
|
|
|
|
long nesting = 0;
|
2023-11-08 19:11:10 +08:00
|
|
|
|
2023-12-23 17:59:18 +08:00
|
|
|
rt_kprintf("please use: addr2line -e rtthread.elf -a -f");
|
2023-10-21 20:14:45 +08:00
|
|
|
|
|
|
|
while (nesting < RT_BACKTRACE_LEVEL_MAX_NR)
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf(" 0x%lx", (rt_ubase_t)frame->pc);
|
2023-10-21 20:14:45 +08:00
|
|
|
if (rt_hw_backtrace_frame_unwind(rt_thread_self(), frame))
|
|
|
|
{
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
nesting++;
|
|
|
|
}
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf("\n");
|
2023-10-21 20:14:45 +08:00
|
|
|
return RT_EOK;
|
|
|
|
}
|
|
|
|
|
|
|
|
rt_err_t rt_backtrace_thread(rt_thread_t thread)
|
|
|
|
{
|
|
|
|
rt_err_t rc;
|
|
|
|
struct rt_hw_backtrace_frame frame;
|
|
|
|
if (thread)
|
|
|
|
{
|
|
|
|
rc = rt_hw_backtrace_frame_get(thread, &frame);
|
|
|
|
if (rc == RT_EOK)
|
|
|
|
{
|
|
|
|
rc = rt_backtrace_frame(&frame);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
rc = -RT_EINVAL;
|
|
|
|
}
|
|
|
|
return rc;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef RT_USING_LIBC
|
|
|
|
#include <stdlib.h> /* for string service */
|
|
|
|
|
|
|
|
static void cmd_backtrace(int argc, char** argv)
|
|
|
|
{
|
|
|
|
rt_ubase_t pid;
|
|
|
|
char *end_ptr;
|
|
|
|
|
|
|
|
if (argc != 2)
|
|
|
|
{
|
|
|
|
if (argc == 1)
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf("[INFO] No thread specified\n"
|
2023-10-21 20:14:45 +08:00
|
|
|
"[HELP] You can use commands like: backtrace %p\n"
|
|
|
|
"Printing backtrace of calling stack...\n",
|
|
|
|
rt_thread_self());
|
|
|
|
rt_backtrace();
|
|
|
|
return ;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf("please use: backtrace [thread_address]\n");
|
2023-10-21 20:14:45 +08:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-11-07 12:25:13 +08:00
|
|
|
pid = strtoul(argv[1], &end_ptr, 0);
|
2023-10-21 20:14:45 +08:00
|
|
|
if (end_ptr == argv[1])
|
|
|
|
{
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf("Invalid input: %s\n", argv[1]);
|
2023-10-21 20:14:45 +08:00
|
|
|
return ;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (pid && rt_object_get_type((void *)pid) == RT_Object_Class_Thread)
|
|
|
|
{
|
|
|
|
rt_thread_t target = (rt_thread_t)pid;
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf("backtrace %s(0x%lx), from %s\n", target->parent.name, pid, argv[1]);
|
2023-10-21 20:14:45 +08:00
|
|
|
rt_backtrace_thread(target);
|
|
|
|
}
|
|
|
|
else
|
2023-11-08 19:11:10 +08:00
|
|
|
rt_kprintf("Invalid pid: %ld\n", pid);
|
2023-10-21 20:14:45 +08:00
|
|
|
}
|
|
|
|
MSH_CMD_EXPORT_ALIAS(cmd_backtrace, backtrace, print backtrace of a thread);
|
|
|
|
|
|
|
|
#endif /* RT_USING_LIBC */
|
|
|
|
|
2021-12-16 16:23:58 +08:00
|
|
|
#if defined(RT_USING_HEAP) && !defined(RT_USING_USERHEAP)
|
|
|
|
#ifdef RT_USING_HOOK
|
2023-12-22 15:44:45 +08:00
|
|
|
static void (*rt_malloc_hook)(void **ptr, rt_size_t size);
|
|
|
|
static void (*rt_realloc_entry_hook)(void **ptr, rt_size_t size);
|
|
|
|
static void (*rt_realloc_exit_hook)(void **ptr, rt_size_t size);
|
|
|
|
static void (*rt_free_hook)(void **ptr);
|
2021-12-16 16:23:58 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @addtogroup Hook
|
2023-02-03 10:00:58 +08:00
|
|
|
* @{
|
2021-12-16 16:23:58 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will set a hook function, which will be invoked when a memory
|
|
|
|
* block is allocated from heap memory.
|
|
|
|
*
|
|
|
|
* @param hook the hook function.
|
|
|
|
*/
|
2023-12-22 15:44:45 +08:00
|
|
|
void rt_malloc_sethook(void (*hook)(void **ptr, rt_size_t size))
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_malloc_hook = hook;
|
|
|
|
}
|
|
|
|
|
2023-12-22 15:44:45 +08:00
|
|
|
/**
|
|
|
|
* @brief This function will set a hook function, which will be invoked when a memory
|
|
|
|
* block is allocated from heap memory.
|
|
|
|
*
|
|
|
|
* @param hook the hook function.
|
|
|
|
*/
|
|
|
|
void rt_realloc_set_entry_hook(void (*hook)(void **ptr, rt_size_t size))
|
|
|
|
{
|
|
|
|
rt_realloc_entry_hook = hook;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will set a hook function, which will be invoked when a memory
|
|
|
|
* block is allocated from heap memory.
|
|
|
|
*
|
|
|
|
* @param hook the hook function.
|
|
|
|
*/
|
|
|
|
void rt_realloc_set_exit_hook(void (*hook)(void **ptr, rt_size_t size))
|
|
|
|
{
|
|
|
|
rt_realloc_exit_hook = hook;
|
|
|
|
}
|
|
|
|
|
2021-12-16 16:23:58 +08:00
|
|
|
/**
|
|
|
|
* @brief This function will set a hook function, which will be invoked when a memory
|
|
|
|
* block is released to heap memory.
|
|
|
|
*
|
|
|
|
* @param hook the hook function
|
|
|
|
*/
|
2023-12-22 15:44:45 +08:00
|
|
|
void rt_free_sethook(void (*hook)(void **ptr))
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_free_hook = hook;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**@}*/
|
|
|
|
|
|
|
|
#endif /* RT_USING_HOOK */
|
|
|
|
|
|
|
|
#if defined(RT_USING_HEAP_ISR)
|
2023-12-30 15:46:54 +08:00
|
|
|
static struct rt_spinlock _heap_spinlock;
|
2021-12-16 16:23:58 +08:00
|
|
|
#elif defined(RT_USING_MUTEX)
|
|
|
|
static struct rt_mutex _lock;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
rt_inline void _heap_lock_init(void)
|
|
|
|
{
|
|
|
|
#if defined(RT_USING_HEAP_ISR)
|
2023-12-30 15:46:54 +08:00
|
|
|
rt_spin_lock_init(&_heap_spinlock);
|
2021-12-16 16:23:58 +08:00
|
|
|
#elif defined(RT_USING_MUTEX)
|
|
|
|
rt_mutex_init(&_lock, "heap", RT_IPC_FLAG_PRIO);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
rt_inline rt_base_t _heap_lock(void)
|
|
|
|
{
|
|
|
|
#if defined(RT_USING_HEAP_ISR)
|
2023-12-30 15:46:54 +08:00
|
|
|
return rt_spin_lock_irqsave(&_heap_spinlock);
|
2021-12-16 16:23:58 +08:00
|
|
|
#elif defined(RT_USING_MUTEX)
|
|
|
|
if (rt_thread_self())
|
|
|
|
return rt_mutex_take(&_lock, RT_WAITING_FOREVER);
|
|
|
|
else
|
|
|
|
return RT_EOK;
|
|
|
|
#else
|
|
|
|
rt_enter_critical();
|
|
|
|
return RT_EOK;
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
|
|
|
rt_inline void _heap_unlock(rt_base_t level)
|
|
|
|
{
|
|
|
|
#if defined(RT_USING_HEAP_ISR)
|
2023-12-30 15:46:54 +08:00
|
|
|
rt_spin_unlock_irqrestore(&_heap_spinlock, level);
|
2021-12-16 16:23:58 +08:00
|
|
|
#elif defined(RT_USING_MUTEX)
|
|
|
|
RT_ASSERT(level == RT_EOK);
|
|
|
|
if (rt_thread_self())
|
|
|
|
rt_mutex_release(&_lock);
|
|
|
|
#else
|
|
|
|
rt_exit_critical();
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2023-03-30 08:25:15 +08:00
|
|
|
#ifdef RT_USING_UTESTCASES
|
|
|
|
/* export to utest to observe the inner statements */
|
2023-06-10 12:32:34 +08:00
|
|
|
#ifdef _MSC_VER
|
|
|
|
#define rt_heap_lock() _heap_lock()
|
|
|
|
#define rt_heap_unlock() _heap_unlock()
|
|
|
|
#else
|
2023-03-30 08:25:15 +08:00
|
|
|
rt_base_t rt_heap_lock(void) __attribute__((alias("_heap_lock")));
|
|
|
|
void rt_heap_unlock(rt_base_t level) __attribute__((alias("_heap_unlock")));
|
2023-06-10 12:32:34 +08:00
|
|
|
#endif /* _MSC_VER */
|
2023-03-30 08:25:15 +08:00
|
|
|
#endif
|
|
|
|
|
2021-12-16 16:23:58 +08:00
|
|
|
#if defined(RT_USING_SMALL_MEM_AS_HEAP)
|
|
|
|
static rt_smem_t system_heap;
|
2022-03-21 14:07:04 +08:00
|
|
|
rt_inline void _smem_info(rt_size_t *total,
|
|
|
|
rt_size_t *used, rt_size_t *max_used)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
if (total)
|
|
|
|
*total = system_heap->total;
|
|
|
|
if (used)
|
|
|
|
*used = system_heap->used;
|
|
|
|
if (max_used)
|
|
|
|
*max_used = system_heap->max;
|
|
|
|
}
|
|
|
|
#define _MEM_INIT(_name, _start, _size) \
|
|
|
|
system_heap = rt_smem_init(_name, _start, _size)
|
|
|
|
#define _MEM_MALLOC(_size) \
|
|
|
|
rt_smem_alloc(system_heap, _size)
|
|
|
|
#define _MEM_REALLOC(_ptr, _newsize)\
|
|
|
|
rt_smem_realloc(system_heap, _ptr, _newsize)
|
|
|
|
#define _MEM_FREE(_ptr) \
|
|
|
|
rt_smem_free(_ptr)
|
|
|
|
#define _MEM_INFO(_total, _used, _max) \
|
|
|
|
_smem_info(_total, _used, _max)
|
|
|
|
#elif defined(RT_USING_MEMHEAP_AS_HEAP)
|
|
|
|
static struct rt_memheap system_heap;
|
|
|
|
void *_memheap_alloc(struct rt_memheap *heap, rt_size_t size);
|
|
|
|
void _memheap_free(void *rmem);
|
|
|
|
void *_memheap_realloc(struct rt_memheap *heap, void *rmem, rt_size_t newsize);
|
|
|
|
#define _MEM_INIT(_name, _start, _size) \
|
2023-12-30 15:46:54 +08:00
|
|
|
do {\
|
|
|
|
rt_memheap_init(&system_heap, _name, _start, _size); \
|
|
|
|
system_heap.locked = RT_TRUE; \
|
|
|
|
} while(0)
|
2021-12-16 16:23:58 +08:00
|
|
|
#define _MEM_MALLOC(_size) \
|
|
|
|
_memheap_alloc(&system_heap, _size)
|
|
|
|
#define _MEM_REALLOC(_ptr, _newsize) \
|
|
|
|
_memheap_realloc(&system_heap, _ptr, _newsize)
|
|
|
|
#define _MEM_FREE(_ptr) \
|
|
|
|
_memheap_free(_ptr)
|
|
|
|
#define _MEM_INFO(_total, _used, _max) \
|
|
|
|
rt_memheap_info(&system_heap, _total, _used, _max)
|
|
|
|
#elif defined(RT_USING_SLAB_AS_HEAP)
|
|
|
|
static rt_slab_t system_heap;
|
2022-03-21 14:07:04 +08:00
|
|
|
rt_inline void _slab_info(rt_size_t *total,
|
|
|
|
rt_size_t *used, rt_size_t *max_used)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
if (total)
|
|
|
|
*total = system_heap->total;
|
|
|
|
if (used)
|
|
|
|
*used = system_heap->used;
|
|
|
|
if (max_used)
|
|
|
|
*max_used = system_heap->max;
|
|
|
|
}
|
|
|
|
#define _MEM_INIT(_name, _start, _size) \
|
|
|
|
system_heap = rt_slab_init(_name, _start, _size)
|
|
|
|
#define _MEM_MALLOC(_size) \
|
|
|
|
rt_slab_alloc(system_heap, _size)
|
|
|
|
#define _MEM_REALLOC(_ptr, _newsize) \
|
|
|
|
rt_slab_realloc(system_heap, _ptr, _newsize)
|
|
|
|
#define _MEM_FREE(_ptr) \
|
|
|
|
rt_slab_free(system_heap, _ptr)
|
|
|
|
#define _MEM_INFO _slab_info
|
|
|
|
#else
|
|
|
|
#define _MEM_INIT(...)
|
|
|
|
#define _MEM_MALLOC(...) RT_NULL
|
|
|
|
#define _MEM_REALLOC(...) RT_NULL
|
|
|
|
#define _MEM_FREE(...)
|
|
|
|
#define _MEM_INFO(...)
|
|
|
|
#endif
|
|
|
|
|
2023-12-22 15:44:45 +08:00
|
|
|
void _rt_system_heap_init(void *begin_addr, void *end_addr)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_ubase_t begin_align = RT_ALIGN((rt_ubase_t)begin_addr, RT_ALIGN_SIZE);
|
|
|
|
rt_ubase_t end_align = RT_ALIGN_DOWN((rt_ubase_t)end_addr, RT_ALIGN_SIZE);
|
|
|
|
|
|
|
|
RT_ASSERT(end_align > begin_align);
|
|
|
|
|
|
|
|
/* Initialize system memory heap */
|
2023-10-26 20:16:43 +08:00
|
|
|
_MEM_INIT("heap", (void *)begin_align, end_align - begin_align);
|
2021-12-16 16:23:58 +08:00
|
|
|
/* Initialize multi thread contention lock */
|
|
|
|
_heap_lock_init();
|
|
|
|
}
|
|
|
|
|
2023-12-22 15:44:45 +08:00
|
|
|
/**
|
|
|
|
* @brief This function will init system heap.
|
|
|
|
*
|
|
|
|
* @param begin_addr the beginning address of system page.
|
|
|
|
*
|
|
|
|
* @param end_addr the end address of system page.
|
|
|
|
*/
|
|
|
|
rt_weak void rt_system_heap_init(void *begin_addr, void *end_addr)
|
|
|
|
{
|
|
|
|
_rt_system_heap_init(begin_addr, end_addr);
|
|
|
|
}
|
|
|
|
|
2021-12-16 16:23:58 +08:00
|
|
|
/**
|
|
|
|
* @brief Allocate a block of memory with a minimum of 'size' bytes.
|
|
|
|
*
|
|
|
|
* @param size is the minimum size of the requested block in bytes.
|
|
|
|
*
|
|
|
|
* @return the pointer to allocated memory or NULL if no free memory was found.
|
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void *rt_malloc(rt_size_t size)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
/* Enter critical zone */
|
|
|
|
level = _heap_lock();
|
|
|
|
/* allocate memory block from system heap */
|
|
|
|
ptr = _MEM_MALLOC(size);
|
|
|
|
/* Exit critical zone */
|
|
|
|
_heap_unlock(level);
|
|
|
|
/* call 'rt_malloc' hook */
|
2023-12-22 15:44:45 +08:00
|
|
|
RT_OBJECT_HOOK_CALL(rt_malloc_hook, (&ptr, size));
|
2021-12-16 16:23:58 +08:00
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_malloc);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will change the size of previously allocated memory block.
|
|
|
|
*
|
2023-05-01 07:35:03 +08:00
|
|
|
* @param ptr is the pointer to memory allocated by rt_malloc.
|
2021-12-16 16:23:58 +08:00
|
|
|
*
|
|
|
|
* @param newsize is the required new size.
|
|
|
|
*
|
|
|
|
* @return the changed memory block address.
|
|
|
|
*/
|
2023-05-01 07:35:03 +08:00
|
|
|
rt_weak void *rt_realloc(void *ptr, rt_size_t newsize)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
void *nptr;
|
|
|
|
|
2023-12-22 15:44:45 +08:00
|
|
|
/* Entry hook */
|
|
|
|
RT_OBJECT_HOOK_CALL(rt_realloc_entry_hook, (&ptr, newsize));
|
2021-12-16 16:23:58 +08:00
|
|
|
/* Enter critical zone */
|
|
|
|
level = _heap_lock();
|
|
|
|
/* Change the size of previously allocated memory block */
|
2023-05-01 07:35:03 +08:00
|
|
|
nptr = _MEM_REALLOC(ptr, newsize);
|
2021-12-16 16:23:58 +08:00
|
|
|
/* Exit critical zone */
|
|
|
|
_heap_unlock(level);
|
2023-12-22 15:44:45 +08:00
|
|
|
/* Exit hook */
|
|
|
|
RT_OBJECT_HOOK_CALL(rt_realloc_exit_hook, (&nptr, newsize));
|
2021-12-16 16:23:58 +08:00
|
|
|
return nptr;
|
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_realloc);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will contiguously allocate enough space for count objects
|
|
|
|
* that are size bytes of memory each and returns a pointer to the allocated
|
|
|
|
* memory.
|
|
|
|
*
|
|
|
|
* @note The allocated memory is filled with bytes of value zero.
|
|
|
|
*
|
|
|
|
* @param count is the number of objects to allocate.
|
|
|
|
*
|
|
|
|
* @param size is the size of one object to allocate.
|
|
|
|
*
|
|
|
|
* @return pointer to allocated memory / NULL pointer if there is an error.
|
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void *rt_calloc(rt_size_t count, rt_size_t size)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
void *p;
|
|
|
|
|
|
|
|
/* allocate 'count' objects of size 'size' */
|
|
|
|
p = rt_malloc(count * size);
|
|
|
|
/* zero the memory */
|
|
|
|
if (p)
|
|
|
|
{
|
|
|
|
rt_memset(p, 0, count * size);
|
|
|
|
}
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_calloc);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will release the previously allocated memory block by
|
|
|
|
* rt_malloc. The released memory block is taken back to system heap.
|
|
|
|
*
|
2023-05-01 07:35:03 +08:00
|
|
|
* @param ptr the address of memory which will be released.
|
2021-12-16 16:23:58 +08:00
|
|
|
*/
|
2023-05-01 07:35:03 +08:00
|
|
|
rt_weak void rt_free(void *ptr)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
|
|
|
|
/* call 'rt_free' hook */
|
2023-12-22 15:44:45 +08:00
|
|
|
RT_OBJECT_HOOK_CALL(rt_free_hook, (&ptr));
|
2022-06-10 12:26:01 +08:00
|
|
|
/* NULL check */
|
2023-05-01 07:35:03 +08:00
|
|
|
if (ptr == RT_NULL) return;
|
2021-12-16 16:23:58 +08:00
|
|
|
/* Enter critical zone */
|
|
|
|
level = _heap_lock();
|
2023-05-01 07:35:03 +08:00
|
|
|
_MEM_FREE(ptr);
|
2021-12-16 16:23:58 +08:00
|
|
|
/* Exit critical zone */
|
|
|
|
_heap_unlock(level);
|
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_free);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief This function will caculate the total memory, the used memory, and
|
|
|
|
* the max used memory.
|
|
|
|
*
|
|
|
|
* @param total is a pointer to get the total size of the memory.
|
|
|
|
*
|
|
|
|
* @param used is a pointer to get the size of memory used.
|
|
|
|
*
|
|
|
|
* @param max_used is a pointer to get the maximum memory used.
|
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void rt_memory_info(rt_size_t *total,
|
2022-01-01 19:13:13 +08:00
|
|
|
rt_size_t *used,
|
|
|
|
rt_size_t *max_used)
|
2021-12-16 16:23:58 +08:00
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
|
|
|
|
/* Enter critical zone */
|
|
|
|
level = _heap_lock();
|
|
|
|
_MEM_INFO(total, used, max_used);
|
|
|
|
/* Exit critical zone */
|
|
|
|
_heap_unlock(level);
|
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_memory_info);
|
|
|
|
|
|
|
|
#if defined(RT_USING_SLAB) && defined(RT_USING_SLAB_AS_HEAP)
|
|
|
|
void *rt_page_alloc(rt_size_t npages)
|
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
void *ptr;
|
|
|
|
|
|
|
|
/* Enter critical zone */
|
|
|
|
level = _heap_lock();
|
|
|
|
/* alloc page */
|
|
|
|
ptr = rt_slab_page_alloc(system_heap, npages);
|
|
|
|
/* Exit critical zone */
|
|
|
|
_heap_unlock(level);
|
|
|
|
return ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
void rt_page_free(void *addr, rt_size_t npages)
|
|
|
|
{
|
|
|
|
rt_base_t level;
|
|
|
|
|
|
|
|
/* Enter critical zone */
|
|
|
|
level = _heap_lock();
|
|
|
|
/* free page */
|
|
|
|
rt_slab_page_free(system_heap, addr, npages);
|
|
|
|
/* Exit critical zone */
|
|
|
|
_heap_unlock(level);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2012-01-30 20:22:57 +08:00
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function allocates a memory block, which address is aligned to the
|
2012-01-30 20:22:57 +08:00
|
|
|
* specified alignment size.
|
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param size is the allocated memory block size.
|
2012-01-30 20:22:57 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param align is the alignment size.
|
|
|
|
*
|
|
|
|
* @return The memory block address was returned successfully, otherwise it was
|
|
|
|
* returned empty RT_NULL.
|
2012-01-30 20:22:57 +08:00
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void *rt_malloc_align(rt_size_t size, rt_size_t align)
|
2012-01-30 20:22:57 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
void *ptr = RT_NULL;
|
|
|
|
void *align_ptr = RT_NULL;
|
|
|
|
int uintptr_size = 0;
|
|
|
|
rt_size_t align_size = 0;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
2018-10-26 06:35:42 +08:00
|
|
|
/* sizeof pointer */
|
|
|
|
uintptr_size = sizeof(void*);
|
|
|
|
uintptr_size -= 1;
|
|
|
|
|
|
|
|
/* align the alignment size to uintptr size byte */
|
|
|
|
align = ((align + uintptr_size) & ~uintptr_size);
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* get total aligned size */
|
2018-10-26 06:35:42 +08:00
|
|
|
align_size = ((size + uintptr_size) & ~uintptr_size) + align;
|
2012-12-25 16:23:12 +08:00
|
|
|
/* allocate memory block from heap */
|
|
|
|
ptr = rt_malloc(align_size);
|
|
|
|
if (ptr != RT_NULL)
|
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
/* the allocated memory block is aligned */
|
2018-10-26 06:35:42 +08:00
|
|
|
if (((rt_ubase_t)ptr & (align - 1)) == 0)
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
2018-10-26 06:35:42 +08:00
|
|
|
align_ptr = (void *)((rt_ubase_t)ptr + align);
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2018-10-26 06:35:42 +08:00
|
|
|
align_ptr = (void *)(((rt_ubase_t)ptr + (align - 1)) & ~(align - 1));
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/* set the pointer before alignment pointer to the real pointer */
|
2018-10-26 06:35:42 +08:00
|
|
|
*((rt_ubase_t *)((rt_ubase_t)align_ptr - sizeof(void *))) = (rt_ubase_t)ptr;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
ptr = align_ptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ptr;
|
2012-01-30 20:22:57 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_malloc_align);
|
2012-01-30 20:22:57 +08:00
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function release the memory block, which is allocated by
|
2012-12-25 16:23:12 +08:00
|
|
|
* rt_malloc_align function and address is aligned.
|
2012-01-30 20:22:57 +08:00
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param ptr is the memory block pointer.
|
2012-01-30 20:22:57 +08:00
|
|
|
*/
|
2022-12-12 02:12:03 +08:00
|
|
|
rt_weak void rt_free_align(void *ptr)
|
2012-01-30 20:22:57 +08:00
|
|
|
{
|
2022-12-03 12:07:44 +08:00
|
|
|
void *real_ptr = RT_NULL;
|
2012-01-30 20:22:57 +08:00
|
|
|
|
2022-06-10 12:26:01 +08:00
|
|
|
/* NULL check */
|
|
|
|
if (ptr == RT_NULL) return;
|
2018-10-26 06:35:42 +08:00
|
|
|
real_ptr = (void *) * (rt_ubase_t *)((rt_ubase_t)ptr - sizeof(void *));
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_free(real_ptr);
|
2012-01-30 20:22:57 +08:00
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_free_align);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_HEAP */
|
2012-01-30 20:22:57 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
#ifndef RT_USING_CPU_FFS
|
2021-11-09 23:32:51 +08:00
|
|
|
#ifdef RT_USING_TINY_FFS
|
2021-09-15 00:07:24 +08:00
|
|
|
const rt_uint8_t __lowest_bit_bitmap[] =
|
|
|
|
{
|
|
|
|
/* 0 - 7 */ 0, 1, 2, 27, 3, 24, 28, 32,
|
|
|
|
/* 8 - 15 */ 4, 17, 25, 31, 29, 12, 32, 14,
|
|
|
|
/* 16 - 23 */ 5, 8, 18, 32, 26, 23, 32, 16,
|
|
|
|
/* 24 - 31 */ 30, 11, 13, 7, 32, 22, 15, 10,
|
|
|
|
/* 32 - 36 */ 6, 21, 9, 20, 19
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function finds the first bit set (beginning with the least significant bit)
|
2021-09-15 00:07:24 +08:00
|
|
|
* in value and return the index of that bit.
|
|
|
|
*
|
|
|
|
* Bits are numbered starting at 1 (the least significant bit). A return value of
|
|
|
|
* zero from any of these functions means that the argument was zero.
|
|
|
|
*
|
2023-04-15 00:33:43 +08:00
|
|
|
* @param value is the value to find the first bit set in.
|
|
|
|
*
|
2021-09-15 00:07:24 +08:00
|
|
|
* @return return the index of the first bit set. If value is 0, then this function
|
|
|
|
* shall return 0.
|
|
|
|
*/
|
|
|
|
int __rt_ffs(int value)
|
|
|
|
{
|
2021-11-07 15:51:24 +08:00
|
|
|
return __lowest_bit_bitmap[(rt_uint32_t)(value & (value - 1) ^ value) % 37];
|
2021-09-15 00:07:24 +08:00
|
|
|
}
|
|
|
|
#else
|
2013-03-23 11:27:29 +08:00
|
|
|
const rt_uint8_t __lowest_bit_bitmap[] =
|
|
|
|
{
|
|
|
|
/* 00 */ 0, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 10 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 20 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 30 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 40 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 50 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 60 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 70 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 80 */ 7, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* 90 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* A0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* B0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* C0 */ 6, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* D0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* E0 */ 5, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0,
|
|
|
|
/* F0 */ 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2023-04-25 12:36:39 +08:00
|
|
|
* @brief This function finds the first bit set (beginning with the least significant bit)
|
2013-03-23 11:27:29 +08:00
|
|
|
* in value and return the index of that bit.
|
|
|
|
*
|
2013-06-24 17:06:09 +08:00
|
|
|
* Bits are numbered starting at 1 (the least significant bit). A return value of
|
2013-03-23 11:27:29 +08:00
|
|
|
* zero from any of these functions means that the argument was zero.
|
2013-06-24 17:06:09 +08:00
|
|
|
*
|
2023-04-15 00:33:43 +08:00
|
|
|
* @param value is the value to find the first bit set in.
|
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @return Return the index of the first bit set. If value is 0, then this function
|
|
|
|
* shall return 0.
|
2013-03-23 11:27:29 +08:00
|
|
|
*/
|
2017-10-15 22:31:53 +08:00
|
|
|
int __rt_ffs(int value)
|
2013-03-23 11:27:29 +08:00
|
|
|
{
|
2023-02-20 18:14:34 +08:00
|
|
|
if (value == 0)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
2013-03-23 11:27:29 +08:00
|
|
|
|
|
|
|
if (value & 0xff)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2013-03-23 11:27:29 +08:00
|
|
|
return __lowest_bit_bitmap[value & 0xff] + 1;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2013-03-23 11:27:29 +08:00
|
|
|
|
|
|
|
if (value & 0xff00)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2013-03-23 11:27:29 +08:00
|
|
|
return __lowest_bit_bitmap[(value & 0xff00) >> 8] + 9;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2013-06-24 17:06:09 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
if (value & 0xff0000)
|
2023-02-20 18:14:34 +08:00
|
|
|
{
|
2013-03-23 11:27:29 +08:00
|
|
|
return __lowest_bit_bitmap[(value & 0xff0000) >> 16] + 17;
|
2023-02-20 18:14:34 +08:00
|
|
|
}
|
2013-06-24 17:06:09 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
return __lowest_bit_bitmap[(value & 0xff000000) >> 24] + 25;
|
|
|
|
}
|
2021-11-09 23:32:51 +08:00
|
|
|
#endif /* RT_USING_TINY_FFS */
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_CPU_FFS */
|
2013-03-23 11:27:29 +08:00
|
|
|
|
2023-07-22 10:36:42 +08:00
|
|
|
#ifdef RT_USING_DEBUG
|
2015-06-11 10:59:25 +08:00
|
|
|
/* RT_ASSERT(EX)'s hook */
|
2019-06-18 20:09:19 +08:00
|
|
|
|
2017-09-15 11:02:24 +08:00
|
|
|
void (*rt_assert_hook)(const char *ex, const char *func, rt_size_t line);
|
2019-06-18 20:09:19 +08:00
|
|
|
|
2015-06-11 10:59:25 +08:00
|
|
|
/**
|
|
|
|
* This function will set a hook function to RT_ASSERT(EX). It will run when the expression is false.
|
|
|
|
*
|
2021-09-10 18:34:14 +08:00
|
|
|
* @param hook is the hook function.
|
2015-06-11 10:59:25 +08:00
|
|
|
*/
|
2017-09-15 11:02:24 +08:00
|
|
|
void rt_assert_set_hook(void (*hook)(const char *ex, const char *func, rt_size_t line))
|
|
|
|
{
|
2015-06-11 10:59:25 +08:00
|
|
|
rt_assert_hook = hook;
|
|
|
|
}
|
2015-08-03 16:07:30 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* The RT_ASSERT function.
|
|
|
|
*
|
2021-09-18 16:23:50 +08:00
|
|
|
* @param ex_string is the assertion condition string.
|
2021-09-10 18:34:14 +08:00
|
|
|
*
|
|
|
|
* @param func is the function name when assertion.
|
|
|
|
*
|
|
|
|
* @param line is the file line number when assertion.
|
2015-08-03 16:07:30 +08:00
|
|
|
*/
|
2017-09-15 11:02:24 +08:00
|
|
|
void rt_assert_handler(const char *ex_string, const char *func, rt_size_t line)
|
2015-08-03 16:07:30 +08:00
|
|
|
{
|
|
|
|
volatile char dummy = 0;
|
|
|
|
|
|
|
|
if (rt_assert_hook == RT_NULL)
|
|
|
|
{
|
|
|
|
#ifdef RT_USING_MODULE
|
2018-08-30 20:27:45 +08:00
|
|
|
if (dlmodule_self())
|
2017-09-15 11:02:24 +08:00
|
|
|
{
|
2018-08-30 20:27:45 +08:00
|
|
|
/* close assertion module */
|
|
|
|
dlmodule_exit(-1);
|
2017-09-15 11:02:24 +08:00
|
|
|
}
|
|
|
|
else
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /*RT_USING_MODULE*/
|
2017-09-15 11:02:24 +08:00
|
|
|
{
|
|
|
|
rt_kprintf("(%s) assertion failed at function:%s, line number:%d \n", ex_string, func, line);
|
2023-10-21 20:14:45 +08:00
|
|
|
rt_backtrace();
|
2017-09-15 11:02:24 +08:00
|
|
|
while (dummy == 0);
|
|
|
|
}
|
2015-08-03 16:07:30 +08:00
|
|
|
}
|
2017-09-15 11:02:24 +08:00
|
|
|
else
|
|
|
|
{
|
2015-08-03 16:07:30 +08:00
|
|
|
rt_assert_hook(ex_string, func, line);
|
2016-08-01 19:06:34 +08:00
|
|
|
}
|
2015-08-03 16:07:30 +08:00
|
|
|
}
|
|
|
|
RTM_EXPORT(rt_assert_handler);
|
2023-07-22 10:36:42 +08:00
|
|
|
#endif /* RT_USING_DEBUG */
|
2015-06-11 10:59:25 +08:00
|
|
|
|
2016-08-19 10:10:26 +08:00
|
|
|
/**@}*/
|