2009-07-03 06:48:23 +08:00
|
|
|
/*
|
2021-03-08 11:25:38 +08:00
|
|
|
* Copyright (c) 2006-2021, 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
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include <rtthread.h>
|
|
|
|
#include <rthw.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
|
|
|
|
2012-03-22 13:57:54 +08:00
|
|
|
/* use precision */
|
|
|
|
#define RT_PRINTF_PRECISION
|
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
|
|
|
* @addtogroup KernelService
|
|
|
|
*/
|
2012-03-17 14:43:49 +08:00
|
|
|
|
2016-08-19 10:10:26 +08:00
|
|
|
/**@{*/
|
2009-07-03 06:48:23 +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
|
|
|
|
|
|
|
/*
|
|
|
|
* This function will get errno
|
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)
|
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_thread_t tid;
|
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)
|
2017-11-30 23:56:52 +08:00
|
|
|
return __rt_errno;
|
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
|
|
|
|
|
|
|
/*
|
|
|
|
* This function will set errno
|
|
|
|
*
|
|
|
|
* @param error the errno shall be set
|
|
|
|
*/
|
|
|
|
void rt_set_errno(rt_err_t error)
|
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_thread_t tid;
|
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
|
|
|
/**
|
|
|
|
* This function returns errno.
|
|
|
|
*
|
|
|
|
* @return the errno in the system
|
|
|
|
*/
|
|
|
|
int *_rt_errno(void)
|
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_thread_t tid;
|
2013-06-24 17:06:09 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
if (rt_interrupt_get_nest() != 0)
|
2017-11-30 23:56:52 +08:00
|
|
|
return (int *)&__rt_errno;
|
2011-08-28 23:57:10 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
tid = rt_thread_self();
|
|
|
|
if (tid != RT_NULL)
|
2017-09-15 11:02:24 +08:00
|
|
|
return (int *) & (tid->error);
|
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
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
|
|
|
* This function will set the content of memory to specified value
|
|
|
|
*
|
|
|
|
* @param s the address of source memory
|
|
|
|
* @param c the value shall be set in content
|
|
|
|
* @param count the copied length
|
|
|
|
*
|
|
|
|
* @return the address of source memory
|
|
|
|
*/
|
2021-01-22 11:02:14 +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
|
2018-10-31 21:32:34 +08:00
|
|
|
#define LBLOCKSIZE (sizeof(long))
|
|
|
|
#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
|
|
|
|
2018-11-01 09:09:54 +08:00
|
|
|
unsigned int i;
|
2012-12-25 16:23:12 +08:00
|
|
|
char *m = (char *)s;
|
2018-11-01 09:09:54 +08:00
|
|
|
unsigned long buffer;
|
|
|
|
unsigned long *aligned_addr;
|
|
|
|
unsigned int d = c & 0xff; /* To avoid sign extension, copy C to an
|
|
|
|
unsigned variable. */
|
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.
|
|
|
|
*/
|
|
|
|
if (LBLOCKSIZE == 4)
|
|
|
|
{
|
|
|
|
buffer = (d << 8) | d;
|
|
|
|
buffer |= (buffer << 16);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
buffer = 0;
|
|
|
|
for (i = 0; i < LBLOCKSIZE; i ++)
|
|
|
|
buffer = (buffer << 8) | d;
|
|
|
|
}
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will copy memory content from source address to destination
|
|
|
|
* address.
|
|
|
|
*
|
|
|
|
* @param dst the address of destination memory
|
|
|
|
* @param src the address of source memory
|
|
|
|
* @param count the copied length
|
|
|
|
*
|
|
|
|
* @return the address of destination memory
|
|
|
|
*/
|
2021-01-22 11:02:14 +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;
|
2017-11-02 11:12:55 +08:00
|
|
|
rt_ubase_t len;
|
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;
|
2018-11-01 09:09:54 +08:00
|
|
|
long *aligned_dst;
|
|
|
|
long *aligned_src;
|
2012-12-25 16:23:12 +08:00
|
|
|
int len = count;
|
|
|
|
|
|
|
|
/* 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);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2021-03-01 23:58:04 +08:00
|
|
|
#ifndef RT_KSERVICE_USING_STDLIB
|
2021-02-28 05:07:02 +08:00
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
|
|
|
* This function will move memory content from source address to destination
|
|
|
|
* address.
|
|
|
|
*
|
|
|
|
* @param dest the address of destination memory
|
|
|
|
* @param src the address of source memory
|
|
|
|
* @param n the copied length
|
|
|
|
*
|
|
|
|
* @return the address of destination memory
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
void *rt_memmove(void *dest, const void *src, rt_ubase_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
|
|
|
|
|
|
|
/**
|
2011-09-21 11:56:42 +08:00
|
|
|
* This function will compare two areas of memory
|
|
|
|
*
|
|
|
|
* @param cs one area of memory
|
2019-12-16 13:59:46 +08:00
|
|
|
* @param ct another area of memory
|
2011-09-21 11:56:42 +08:00
|
|
|
* @param count the size of the area
|
|
|
|
*
|
|
|
|
* @return the result
|
2009-07-03 06:48:23 +08:00
|
|
|
*/
|
2021-01-22 11:02:14 +08:00
|
|
|
RT_WEAK rt_int32_t rt_memcmp(const void *cs, const void *ct, rt_ubase_t count)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
const unsigned char *su1, *su2;
|
|
|
|
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);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will return the first occurrence of a string.
|
|
|
|
*
|
|
|
|
* @param s1 the source string
|
|
|
|
* @param s2 the find string
|
|
|
|
*
|
|
|
|
* @return the first occurrence of a s2 in s1, or RT_NULL if no found.
|
|
|
|
*/
|
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
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
int l1, l2;
|
|
|
|
|
|
|
|
l2 = rt_strlen(s2);
|
|
|
|
if (!l2)
|
|
|
|
return (char *)s1;
|
|
|
|
l1 = rt_strlen(s1);
|
|
|
|
while (l1 >= l2)
|
|
|
|
{
|
|
|
|
l1 --;
|
|
|
|
if (!rt_memcmp(s1, s2, l2))
|
|
|
|
return (char *)s1;
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will compare two strings while ignoring differences in case
|
|
|
|
*
|
|
|
|
* @param a the string to be compared
|
|
|
|
* @param b the string to be compared
|
|
|
|
*
|
|
|
|
* @return the result
|
|
|
|
*/
|
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
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
int ca, cb;
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will copy string no more than n bytes.
|
|
|
|
*
|
2011-11-08 12:06:12 +08:00
|
|
|
* @param dst the string to copy
|
2009-07-03 06:48:23 +08:00
|
|
|
* @param src the string to be copied
|
|
|
|
* @param n the maximum copied length
|
|
|
|
*
|
|
|
|
* @return the result
|
|
|
|
*/
|
2011-11-08 12:06:12 +08:00
|
|
|
char *rt_strncpy(char *dst, const char *src, rt_ubase_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)
|
|
|
|
*d++ = 0;
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will compare two strings with specified maximum length
|
|
|
|
*
|
|
|
|
* @param cs the string to be compared
|
|
|
|
* @param ct the string to be compared
|
|
|
|
* @param count the maximum compare length
|
|
|
|
*
|
|
|
|
* @return the result
|
|
|
|
*/
|
2015-05-20 20:37:40 +08:00
|
|
|
rt_int32_t rt_strncmp(const char *cs, const char *ct, rt_ubase_t count)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
register 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++)
|
|
|
|
break;
|
|
|
|
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
|
|
|
/**
|
|
|
|
* This function will compare two strings without specified length
|
|
|
|
*
|
|
|
|
* @param cs the string to be compared
|
|
|
|
* @param ct the string to be compared
|
|
|
|
*
|
|
|
|
* @return the result
|
|
|
|
*/
|
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
|
|
|
/**
|
|
|
|
* The strnlen() function returns the number of characters in the
|
2017-09-15 11:02:24 +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
|
2016-08-12 22:14:07 +08:00
|
|
|
* beyond s+maxlen.
|
|
|
|
*
|
|
|
|
* @param s the string
|
|
|
|
* @param maxlen the max size
|
|
|
|
* @return the length of string
|
|
|
|
*/
|
|
|
|
rt_size_t rt_strnlen(const char *s, rt_ubase_t maxlen)
|
|
|
|
{
|
|
|
|
const char *sc;
|
|
|
|
|
2019-03-09 15:46:56 +08:00
|
|
|
for (sc = s; *sc != '\0' && (rt_ubase_t)(sc - s) < maxlen; ++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;
|
|
|
|
}
|
2019-03-09 15:46:56 +08:00
|
|
|
RTM_EXPORT(rt_strnlen);
|
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
|
|
|
* This function will return the length of a string, which terminate will
|
|
|
|
* null character.
|
|
|
|
*
|
|
|
|
* @param s the string
|
|
|
|
*
|
|
|
|
* @return the length of string
|
|
|
|
*/
|
2015-05-20 20:37:40 +08:00
|
|
|
rt_size_t rt_strlen(const char *s)
|
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
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
for (sc = s; *sc != '\0'; ++sc) /* nothing */
|
|
|
|
;
|
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
|
|
|
}
|
2012-08-27 09:21:57 +08:00
|
|
|
RTM_EXPORT(rt_strlen);
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_KSERVICE_USING_STDLIB */
|
2021-02-28 05:07:02 +08:00
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_USING_HEAP
|
|
|
|
/**
|
|
|
|
* This function will duplicate a string.
|
|
|
|
*
|
|
|
|
* @param s the string to be duplicated
|
|
|
|
*
|
|
|
|
* @return the duplicated string pointer
|
|
|
|
*/
|
|
|
|
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)
|
|
|
|
return RT_NULL;
|
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-13 17:36:42 +08:00
|
|
|
#ifdef __ARMCC_VERSION
|
2018-07-15 16:03:40 +08:00
|
|
|
char *strdup(const char *s) __attribute__((alias("rt_strdup")));
|
|
|
|
#endif
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_HEAP */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will show the version of rt-thread rtos
|
|
|
|
*/
|
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");
|
|
|
|
rt_kprintf("- RT - Thread Operating System\n");
|
|
|
|
rt_kprintf(" / | \\ %d.%d.%d build %s\n",
|
|
|
|
RT_VERSION, RT_SUBVERSION, RT_REVISION, __DATE__);
|
2021-01-04 14:22:58 +08:00
|
|
|
rt_kprintf(" 2006 - 2021 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
|
|
|
|
2019-05-16 10:24:54 +08:00
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
|
|
|
rt_inline int divide(long long *n, int base)
|
|
|
|
{
|
|
|
|
int res;
|
|
|
|
|
|
|
|
/* optimized for processor which does not support divide instructions. */
|
|
|
|
if (base == 10)
|
|
|
|
{
|
|
|
|
res = (int)(((unsigned long long)*n) % 10U);
|
|
|
|
*n = (long long)(((unsigned long long)*n) / 10U);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
res = (int)(((unsigned long long)*n) % 16U);
|
|
|
|
*n = (long long)(((unsigned long long)*n) / 16U);
|
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
#else
|
2018-10-31 21:32:34 +08:00
|
|
|
rt_inline int divide(long *n, int base)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2018-10-31 21:32:34 +08:00
|
|
|
int res;
|
2012-12-25 16:23:12 +08:00
|
|
|
|
|
|
|
/* optimized for processor which does not support divide instructions. */
|
|
|
|
if (base == 10)
|
|
|
|
{
|
2018-10-31 21:32:34 +08:00
|
|
|
res = (int)(((unsigned long)*n) % 10U);
|
|
|
|
*n = (long)(((unsigned long)*n) / 10U);
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2018-10-31 21:32:34 +08:00
|
|
|
res = (int)(((unsigned long)*n) % 16U);
|
|
|
|
*n = (long)(((unsigned long)*n) / 16U);
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return res;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
rt_inline int skip_atoi(const char **s)
|
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
register 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
|
|
|
|
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
static char *print_number(char *buf,
|
|
|
|
char *end,
|
2019-05-16 10:24:54 +08:00
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
|
|
|
long long num,
|
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
long num,
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
int base,
|
|
|
|
int s,
|
|
|
|
int precision,
|
|
|
|
int type)
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
static char *print_number(char *buf,
|
|
|
|
char *end,
|
2019-05-16 10:24:54 +08:00
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
|
|
|
long long num,
|
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
long num,
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
int base,
|
|
|
|
int s,
|
|
|
|
int type)
|
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
|
|
|
char c, sign;
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
2012-12-25 16:23:12 +08:00
|
|
|
char tmp[32];
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
char tmp[16];
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2019-01-21 18:35:13 +08:00
|
|
|
int precision_bak = precision;
|
2012-12-25 16:23:12 +08:00
|
|
|
const char *digits;
|
|
|
|
static const char small_digits[] = "0123456789abcdef";
|
|
|
|
static const char large_digits[] = "0123456789ABCDEF";
|
|
|
|
register int i;
|
|
|
|
register int size;
|
|
|
|
|
|
|
|
size = s;
|
|
|
|
|
|
|
|
digits = (type & LARGE) ? large_digits : small_digits;
|
|
|
|
if (type & LEFT)
|
|
|
|
type &= ~ZEROPAD;
|
|
|
|
|
|
|
|
c = (type & ZEROPAD) ? '0' : ' ';
|
|
|
|
|
|
|
|
/* get sign */
|
|
|
|
sign = 0;
|
|
|
|
if (type & SIGN)
|
|
|
|
{
|
|
|
|
if (num < 0)
|
|
|
|
{
|
|
|
|
sign = '-';
|
|
|
|
num = -num;
|
|
|
|
}
|
|
|
|
else if (type & PLUS)
|
|
|
|
sign = '+';
|
|
|
|
else if (type & SPACE)
|
|
|
|
sign = ' ';
|
|
|
|
}
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_SPECIAL
|
2012-12-25 16:23:12 +08:00
|
|
|
if (type & SPECIAL)
|
|
|
|
{
|
|
|
|
if (base == 16)
|
|
|
|
size -= 2;
|
|
|
|
else if (base == 8)
|
|
|
|
size--;
|
|
|
|
}
|
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)
|
2017-09-15 11:02:24 +08:00
|
|
|
tmp[i++] = '0';
|
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)
|
|
|
|
precision = i;
|
|
|
|
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))
|
2012-12-25 16:23:12 +08:00
|
|
|
size--;
|
|
|
|
|
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)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = ' ';
|
|
|
|
++ 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)
|
|
|
|
{
|
2017-09-15 11:02:24 +08:00
|
|
|
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)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = '0';
|
|
|
|
++ 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)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = c;
|
|
|
|
++ 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)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = '0';
|
|
|
|
++ 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)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = tmp[i];
|
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (size-- > 0)
|
|
|
|
{
|
2019-03-23 16:36:54 +08:00
|
|
|
if (buf < end)
|
2012-12-25 16:23:12 +08:00
|
|
|
*buf = ' ';
|
|
|
|
++ buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
return buf;
|
2009-07-03 06:48:23 +08:00
|
|
|
}
|
|
|
|
|
2013-09-23 11:27:48 +08:00
|
|
|
rt_int32_t rt_vsnprintf(char *buf,
|
|
|
|
rt_size_t size,
|
|
|
|
const char *fmt,
|
|
|
|
va_list args)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
2012-12-25 16:23:12 +08:00
|
|
|
unsigned long long num;
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_uint32_t num;
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
int i, len;
|
|
|
|
char *str, *end, c;
|
|
|
|
const char *s;
|
2009-07-03 06:48:23 +08:00
|
|
|
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_uint8_t base; /* the base of number */
|
|
|
|
rt_uint8_t flags; /* flags to print number */
|
|
|
|
rt_uint8_t qualifier; /* 'h', 'l', or 'L' for integer fields */
|
|
|
|
rt_int32_t field_width; /* width of output field */
|
2009-07-03 06:48:23 +08:00
|
|
|
|
|
|
|
#ifdef RT_PRINTF_PRECISION
|
2012-12-25 16:23:12 +08:00
|
|
|
int precision; /* 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)
|
2012-12-25 16:23:12 +08:00
|
|
|
*str = *fmt;
|
|
|
|
++ 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;
|
2020-07-24 11:53:57 +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;
|
2020-07-24 11:53:57 +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);
|
|
|
|
}
|
|
|
|
if (precision < 0) precision = 0;
|
|
|
|
}
|
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;
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_PRINTF_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')
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
|
|
|
qualifier = *fmt;
|
|
|
|
++ fmt;
|
2009-07-03 06:48:23 +08:00
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
2012-12-25 16:23:12 +08:00
|
|
|
if (qualifier == 'l' && *fmt == 'l')
|
|
|
|
{
|
|
|
|
qualifier = 'L';
|
|
|
|
++ fmt;
|
|
|
|
}
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_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);
|
2019-03-23 16:36:54 +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 *);
|
|
|
|
if (!s) s = "(NULL)";
|
|
|
|
|
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
|
2012-12-25 16:23:12 +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;
|
|
|
|
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,
|
|
|
|
(long)va_arg(args, void *),
|
|
|
|
16, 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,
|
|
|
|
(long)va_arg(args, void *),
|
|
|
|
16, field_width, flags);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
2012-12-25 16:23:12 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
case '%':
|
2019-03-23 16:36:54 +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" */
|
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:
|
2019-03-23 16:36:54 +08:00
|
|
|
if (str < end) *str = '%';
|
2012-12-25 16:23:12 +08:00
|
|
|
++ str;
|
|
|
|
|
|
|
|
if (*fmt)
|
|
|
|
{
|
2019-03-23 16:36:54 +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
|
|
|
|
|
|
|
#ifdef RT_PRINTF_LONGLONG
|
2012-12-25 16:23:12 +08:00
|
|
|
if (qualifier == 'L') num = va_arg(args, long long);
|
|
|
|
else if (qualifier == 'l')
|
2009-07-03 06:48:23 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
if (qualifier == 'l')
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_LONGLONG */
|
2012-12-25 16:23:12 +08:00
|
|
|
{
|
|
|
|
num = va_arg(args, rt_uint32_t);
|
|
|
|
if (flags & SIGN) num = (rt_int32_t)num;
|
|
|
|
}
|
|
|
|
else if (qualifier == 'h')
|
|
|
|
{
|
|
|
|
num = (rt_uint16_t)va_arg(args, rt_int32_t);
|
|
|
|
if (flags & SIGN) num = (rt_int16_t)num;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
num = va_arg(args, rt_uint32_t);
|
|
|
|
if (flags & SIGN) num = (rt_int32_t)num;
|
|
|
|
}
|
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, num, base, 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, num, base, field_width, flags);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_PRINTF_PRECISION */
|
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)
|
|
|
|
{
|
|
|
|
if (str < end) *str = '\0';
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will fill a formatted string to buffer
|
|
|
|
*
|
|
|
|
* @param buf the buffer to save formatted string
|
|
|
|
* @param size the size of buffer
|
|
|
|
* @param fmt the format
|
|
|
|
*/
|
|
|
|
rt_int32_t rt_snprintf(char *buf, rt_size_t size, const char *fmt, ...)
|
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_int32_t n;
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will fill a formatted string to buffer
|
|
|
|
*
|
|
|
|
* @param buf the buffer to save formatted string
|
2009-12-25 20:18:53 +08:00
|
|
|
* @param arg_ptr the arg_ptr
|
2009-07-03 06:48:23 +08:00
|
|
|
* @param format the format
|
|
|
|
*/
|
|
|
|
rt_int32_t rt_vsprintf(char *buf, const char *format, va_list arg_ptr)
|
|
|
|
{
|
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
|
|
|
|
|
|
|
/**
|
|
|
|
* This function will fill a formatted string to buffer
|
|
|
|
*
|
|
|
|
* @param buf the buffer to save formatted string
|
|
|
|
* @param format the format
|
|
|
|
*/
|
2011-09-21 11:56:42 +08:00
|
|
|
rt_int32_t rt_sprintf(char *buf, const char *format, ...)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_int32_t n;
|
|
|
|
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
|
|
|
/**
|
|
|
|
* This function returns the device using in console.
|
|
|
|
*
|
|
|
|
* @return the device using in console or RT_NULL
|
|
|
|
*/
|
|
|
|
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
|
|
|
/**
|
2010-11-29 08:04:55 +08:00
|
|
|
* 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
|
|
|
*
|
2010-11-29 08:04:55 +08:00
|
|
|
* @param name 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
|
|
|
{
|
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;
|
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
|
|
|
|
2017-09-18 11:32:13 +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
|
|
|
|
2017-01-31 13:18:20 +08:00
|
|
|
/**
|
|
|
|
* This function will put string to the console.
|
|
|
|
*
|
|
|
|
* @param str the string output to the console.
|
|
|
|
*/
|
|
|
|
void rt_kputs(const char *str)
|
|
|
|
{
|
2017-10-15 22:31:53 +08:00
|
|
|
if (!str) return;
|
|
|
|
|
2017-01-31 13:18:20 +08:00
|
|
|
#ifdef RT_USING_DEVICE
|
|
|
|
if (_console_device == RT_NULL)
|
|
|
|
{
|
|
|
|
rt_hw_console_output(str);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
rt_uint16_t old_flag = _console_device->open_flag;
|
|
|
|
|
|
|
|
_console_device->open_flag |= RT_DEVICE_FLAG_STREAM;
|
|
|
|
rt_device_write(_console_device, 0, str, rt_strlen(str));
|
|
|
|
_console_device->open_flag = old_flag;
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
rt_hw_console_output(str);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_DEVICE */
|
2017-01-31 13:18:20 +08:00
|
|
|
}
|
|
|
|
|
2009-07-03 06:48:23 +08:00
|
|
|
/**
|
|
|
|
* This function will print a formatted string on system console
|
|
|
|
*
|
|
|
|
* @param fmt the format
|
|
|
|
*/
|
2021-01-22 11:02:14 +08:00
|
|
|
RT_WEAK void rt_kprintf(const char *fmt, ...)
|
2009-07-03 06:48:23 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
va_list args;
|
|
|
|
rt_size_t length;
|
|
|
|
static char rt_log_buf[RT_CONSOLEBUF_SIZE];
|
|
|
|
|
|
|
|
va_start(args, fmt);
|
|
|
|
/* 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)
|
|
|
|
length = RT_CONSOLEBUF_SIZE - 1;
|
2011-01-24 21:40:42 +08:00
|
|
|
#ifdef RT_USING_DEVICE
|
2012-12-25 16:23:12 +08:00
|
|
|
if (_console_device == RT_NULL)
|
|
|
|
{
|
|
|
|
rt_hw_console_output(rt_log_buf);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2015-01-04 19:43:33 +08:00
|
|
|
rt_uint16_t old_flag = _console_device->open_flag;
|
2013-09-24 15:25:24 +08:00
|
|
|
|
2015-01-04 19:43:33 +08:00
|
|
|
_console_device->open_flag |= RT_DEVICE_FLAG_STREAM;
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_device_write(_console_device, 0, rt_log_buf, length);
|
2015-01-04 19:43:33 +08:00
|
|
|
_console_device->open_flag = old_flag;
|
2012-12-25 16:23:12 +08:00
|
|
|
}
|
2011-01-24 21:40:42 +08:00
|
|
|
#else
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_hw_console_output(rt_log_buf);
|
2021-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_DEVICE */
|
2012-12-25 16:23:12 +08:00
|
|
|
va_end(args);
|
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
|
|
|
|
2012-01-30 20:22:57 +08:00
|
|
|
#ifdef RT_USING_HEAP
|
|
|
|
/**
|
|
|
|
* This function allocates a memory block, which address is aligned to the
|
|
|
|
* specified alignment size.
|
|
|
|
*
|
|
|
|
* @param size the allocated memory block size
|
|
|
|
* @param align the alignment size
|
|
|
|
*
|
|
|
|
* @return the allocated memory block on successful, otherwise returns RT_NULL
|
|
|
|
*/
|
2021-06-11 10:00:23 +08:00
|
|
|
RT_WEAK void *rt_malloc_align(rt_size_t size, rt_size_t align)
|
2012-01-30 20:22:57 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
void *ptr;
|
2018-10-26 06:35:42 +08:00
|
|
|
void *align_ptr;
|
|
|
|
int uintptr_size;
|
2012-12-25 16:23:12 +08:00
|
|
|
rt_size_t align_size;
|
|
|
|
|
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
|
|
|
|
|
|
|
/**
|
2012-12-25 16:23:12 +08:00
|
|
|
* This function release the memory block, which is allocated by
|
|
|
|
* rt_malloc_align function and address is aligned.
|
2012-01-30 20:22:57 +08:00
|
|
|
*
|
|
|
|
* @param ptr the memory block pointer
|
|
|
|
*/
|
2021-06-11 10:00:23 +08:00
|
|
|
RT_WEAK void rt_free_align(void *ptr)
|
2012-01-30 20:22:57 +08:00
|
|
|
{
|
2012-12-25 16:23:12 +08:00
|
|
|
void *real_ptr;
|
2012-01-30 20:22:57 +08:00
|
|
|
|
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
|
|
|
|
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
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2013-06-24 17:06:09 +08:00
|
|
|
* 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
|
|
|
*
|
|
|
|
* @return return the index of the first bit set. If value is 0, then this function
|
2013-03-23 11:27:29 +08:00
|
|
|
* shall return 0.
|
|
|
|
*/
|
2017-10-15 22:31:53 +08:00
|
|
|
int __rt_ffs(int value)
|
2013-03-23 11:27:29 +08:00
|
|
|
{
|
|
|
|
if (value == 0) return 0;
|
|
|
|
|
|
|
|
if (value & 0xff)
|
|
|
|
return __lowest_bit_bitmap[value & 0xff] + 1;
|
|
|
|
|
|
|
|
if (value & 0xff00)
|
|
|
|
return __lowest_bit_bitmap[(value & 0xff00) >> 8] + 9;
|
2013-06-24 17:06:09 +08:00
|
|
|
|
2013-03-23 11:27:29 +08:00
|
|
|
if (value & 0xff0000)
|
|
|
|
return __lowest_bit_bitmap[(value & 0xff0000) >> 16] + 17;
|
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-06-10 17:58:31 +08:00
|
|
|
#endif /* RT_USING_CPU_FFS */
|
2013-03-23 11:27:29 +08:00
|
|
|
|
2015-06-11 10:59:25 +08:00
|
|
|
#ifdef RT_DEBUG
|
|
|
|
/* 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.
|
|
|
|
*
|
|
|
|
* @param hook the hook function
|
|
|
|
*/
|
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.
|
|
|
|
*
|
|
|
|
* @param ex the assertion condition string
|
|
|
|
* @param func the function name when assertion.
|
|
|
|
* @param line the file line number when assertion.
|
|
|
|
*/
|
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);
|
|
|
|
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);
|
2015-06-11 10:59:25 +08:00
|
|
|
#endif /* RT_DEBUG */
|
|
|
|
|
2016-08-19 10:10:26 +08:00
|
|
|
/**@}*/
|