| /lib/libc/minimal/source/string/ |
| A D | string.c | 50 n--; in strncpy()
56 n--; in strncpy()
113 n++; in strlen()
148 n--; in strncmp()
256 n--; in memmove()
257 dest[n] = src[n]; in memmove()
265 n--; in memmove()
298 n--; in memcpy()
320 n--; in memcpy()
346 n--; in memset()
[all …]
|
| A D | strncasecmp.c | 11 strncasecmp(const char *s1, const char *s2, size_t n) in strncasecmp() argument
15 for (; c && n != 0; n--) { in strncasecmp()
|
| /lib/utils/ |
| A D | base64.c | 63 size_t i, n; in base64_encode() local
79 n *= 4; in base64_encode()
82 *olen = n + 1; in base64_encode()
127 size_t i, n; in base64_decode() local
170 n++; in base64_decode()
173 if (n == 0) { in base64_decode()
182 n = (6 * (n >> 3)) + ((6 * (n & 0x7) + 7) >> 3); in base64_decode()
183 n -= j; in base64_decode()
186 *olen = n; in base64_decode()
199 if (++n == 4) { in base64_decode()
[all …]
|
| A D | rb.c | 12 #define CHECK(n) /**/ argument
23 CHECK(n); in get_child()
36 CHECK(n); in set_child()
49 CHECK(n); in get_color()
65 CHECK(n); in set_color()
106 for (n = tree->root; (n != NULL) && (get_child(n, side) != NULL); in z_rb_get_minmax()
107 n = get_child(n, side)) { in z_rb_get_minmax()
110 return n; in z_rb_get_minmax()
528 while ((n != NULL) && (n != node)) { in rb_contains()
529 n = get_child(n, tree->lessthan_fn(n, node)); in rb_contains()
[all …]
|
| A D | utf8.c | 69 char *utf8_lcpy(char *dst, const char *src, size_t n) in utf8_lcpy() argument
71 if (n > 0) { in utf8_lcpy()
72 strncpy(dst, src, n - 1); in utf8_lcpy()
73 dst[n - 1] = '\0'; in utf8_lcpy()
75 if (n != 1) { in utf8_lcpy()
|
| A D | winstream.c | 13 # define MEMCPY(dst, src, n) \ argument
14 do { for (int i = 0; i < (n); i++) { (dst)[i] = (src)[i]; } } while (0)
|
| A D | bitarray.c | 563 int sys_bitarray_find_nth_set(sys_bitarray_t *bitarray, size_t n, size_t num_bits, size_t offset, in sys_bitarray_find_nth_set() argument
577 if (n == 0 || num_bits == 0 || offset + num_bits > bitarray->num_bits) { in sys_bitarray_find_nth_set()
588 if (count >= n) { in sys_bitarray_find_nth_set()
596 n -= count; in sys_bitarray_find_nth_set()
602 if (count >= n) { in sys_bitarray_find_nth_set()
606 n -= count; in sys_bitarray_find_nth_set()
610 if (count >= n) { in sys_bitarray_find_nth_set()
625 if (--n <= 0) { in sys_bitarray_find_nth_set()
|
| /lib/libc/minimal/source/stdlib/ |
| A D | atoi.c | 33 int n = 0; in atoi() local
56 n = 10 * n - (*s++ - '0'); in atoi()
58 return neg ? n : -n; in atoi()
|
| /lib/libc/common/source/string/ |
| A D | strnlen.c | 23 size_t n = 0; in strnlen() local
25 while (*s != '\0' && n < maxlen) { in strnlen()
27 n++; in strnlen()
30 return n; in strnlen()
|
| /lib/libc/minimal/include/ |
| A D | string.h | 23 size_t n);
29 extern int strncmp(const char *s1, const char *s2, size_t n);
34 size_t n);
40 extern int memcmp(const void *m1, const void *m2, size_t n);
41 extern void *memmove(void *d, const void *s, size_t n);
43 size_t n);
44 extern void *memset(void *buf, int c, size_t n);
45 extern void *memchr(const void *s, int c, size_t n);
|
| A D | strings.h | 18 extern int strncasecmp(const char *s1, const char *s2, size_t n);
|
| /lib/hash/ |
| A D | hash_func32_murmur3.c | 22 for (; n >= sizeof(uint32_t); n -= sizeof(uint32_t), str += sizeof(uint32_t)) { \
29 uint32_t sys_hash32_murmur3(const char *str, size_t n) in sys_hash32_murmur3() argument
34 const size_t len = n; in sys_hash32_murmur3()
42 for (k = 0; n != 0; --n, ++str) { in sys_hash32_murmur3()
|
| A D | hash_func32_djb2.c | 35 uint32_t sys_hash32_djb2(const void *str, size_t n) in sys_hash32_djb2() argument
41 for (hash = 5381, d = str; n > 0; --n, ++d) { in sys_hash32_djb2()
|
| /lib/heap/ |
| A D | heap_validate.c | 112 uint32_t n = 0; in sys_heap_validate() local
116 for (c = c0; c != 0 && (n == 0 || c != c0); in sys_heap_validate()
117 n++, c = next_free_chunk(h, c)) { in sys_heap_validate()
125 bool zero = n == 0; in sys_heap_validate()
165 int n = 0; in sys_heap_validate() local
171 for (c = c0; n == 0 || c != c0; n++, c = next_free_chunk(h, c)) { in sys_heap_validate()
|
| /lib/os/ |
| A D | printk.c | 146 void z_impl_k_str_out(char *c, size_t n) in z_impl_k_str_out() argument
153 for (i = 0; i < n; i++) { in z_impl_k_str_out()
163 static inline void z_vrfy_k_str_out(char *c, size_t n) in z_vrfy_k_str_out() argument
165 K_OOPS(K_SYSCALL_MEMORY_READ(c, n)); in z_vrfy_k_str_out()
166 z_impl_k_str_out((char *)c, n); in z_vrfy_k_str_out()
|
| A D | Kconfig.cbprintf | 104 bool "Support %n specifications"
109 If selected %n can be used to determine the number of characters
|
| A D | cbprintf_packaged.c | 886 bool is_ptr(const char *fmt, int n) in is_ptr() argument
894 if (cnt == n) { in is_ptr()
|
| /lib/libc/common/source/time/ |
| A D | asctime.c | 32 unsigned int n = (unsigned int)snprintf( in asctime_impl() local
37 if (n >= DATE_STRING_BUF_SZ) { in asctime_impl()
|
| /lib/posix/options/ |
| A D | net.c | 114 size_t n; in if_freenameindex() local
120 NET_IFACE_COUNT(&n); in if_freenameindex()
122 for (size_t i = 0; i < n; ++i) { in if_freenameindex()
133 size_t n; in if_nameindex() local
138 NET_IFACE_COUNT(&n); in if_nameindex()
139 ni = malloc((n + 1) * sizeof(*ni)); in if_nameindex()
144 for (size_t i = 0; i < n; ++i) { in if_nameindex()
156 ni[n].if_index = 0; in if_nameindex()
157 ni[n].if_name = NULL; in if_nameindex()
|
| A D | shm.c | 39 static inline uint32_t hash32(const char *str, size_t n) in hash32() argument
42 return sys_hash32_djb2(str, n); in hash32()
|
| /lib/min_heap/ |
| A D | Kconfig | 11 insertion and removal of the minimum element in O(log n) time,
|
| /lib/libc/common/ |
| A D | Kconfig | 87 default n if MINIMAL_LIBC
96 default n if MINIMAL_LIBC
|
| /lib/libc/ |
| A D | Kconfig | 65 default n
|