Searched refs:n (Results 1 – 10 of 10) sorted by relevance
| /src/ |
| A D | slab.c | 272 RT_ASSERT(b > n || b + b->page <= n); in rt_slab_page_free()
297 n->next = b; in rt_slab_page_free()
298 *prev = n; in rt_slab_page_free()
418 *bytes = n = (n + 7) & ~7; in zoneindex()
425 *bytes = n = (n + 15) & ~15; in zoneindex()
433 *bytes = n = (n + 31) & ~31; in zoneindex()
439 *bytes = n = (n + 63) & ~63; in zoneindex()
445 *bytes = n = (n + 127) & ~127; in zoneindex()
451 *bytes = n = (n + 255) & ~255; in zoneindex()
455 *bytes = n = (n + 511) & ~511; in zoneindex()
[all …]
|
| A D | Kconfig | 15 default n
24 default n
31 default n
56 default n
72 default n
142 default n
198 default n
244 default n
406 default n
410 default n
[all …]
|
| A D | memheap.c | 688 struct rt_memheap_item *n = heap->free_list->next_free; in rt_memheap_free() local
691 for (;n != heap->free_list; n = n->next_free) in rt_memheap_free()
693 rt_size_t m = MEMITEM_SIZE(n); in rt_memheap_free()
701 header_ptr->next_free = n; in rt_memheap_free()
702 header_ptr->prev_free = n->prev_free; in rt_memheap_free()
703 n->prev_free->next_free = header_ptr; in rt_memheap_free()
704 n->prev_free = header_ptr; in rt_memheap_free()
|
| A D | ipc.c | 253 struct rt_list_node *n; in rt_susp_list_enqueue() local
257 for (n = susp_list->next; n != susp_list; n = n->next) in rt_susp_list_enqueue()
259 sthread = RT_THREAD_LIST_NODE_ENTRY(n); in rt_susp_list_enqueue()
274 if (n == susp_list) in rt_susp_list_enqueue()
1966 struct rt_list_node *n; in rt_event_send() local
1994 n = event->parent.suspend_thread.next; in rt_event_send()
1995 while (n != &(event->parent.suspend_thread)) in rt_event_send()
1998 thread = RT_THREAD_LIST_NODE_ENTRY(n); in rt_event_send()
2029 n = n->next; in rt_event_send()
|
| /src/klibc/ |
| A D | Kconfig | 5 default n
10 default n
18 default n
108 default n
114 default n
131 default n
148 default n
160 default n
172 default n
184 default n
[all …]
|
| A D | rt_vsscanf.c | 50 int c, n, v; in __sccl() local
70 n = *fmt++; in __sccl()
71 switch (n) { in __sccl()
77 n = *fmt; in __sccl()
78 if ((n == ']') || (n < c)) { in __sccl()
87 } while (c < n); in __sccl()
88 c = n; in __sccl()
95 c = n; in __sccl()
381 n = 0; in scanf_parse()
383 n++; in scanf_parse()
[all …]
|
| A D | kstdio.c | 30 rt_int32_t n = 0; in rt_snprintf() local
34 n = rt_vsnprintf(buf, size, fmt, args); in rt_snprintf()
37 return n; in rt_snprintf()
69 rt_int32_t n = 0; in rt_sprintf() local
73 n = rt_vsprintf(buf, format, arg_ptr); in rt_sprintf()
76 return n; in rt_sprintf()
|
| A D | kstring.c | 217 return memmove(dest, src, n); in rt_memmove()
221 if (s < tmp && tmp < s + n) in rt_memmove()
223 tmp += n; in rt_memmove()
224 s += n; in rt_memmove()
226 while (n--) in rt_memmove()
231 while (n--) in rt_memmove()
361 char *rt_strncpy(char *dst, const char *src, rt_size_t n) in rt_strncpy() argument
364 return strncpy(dst, src, n); in rt_strncpy()
366 if (n != 0) in rt_strncpy()
376 while (--n != 0) in rt_strncpy()
[all …]
|
| A D | rt_vsnprintf_tiny.c | 25 rt_inline int divide(unsigned long long *n, int base) in divide() argument
27 rt_inline int divide(unsigned long *n, int base) in divide()
34 res = (int)((*n) % base); in divide()
35 *n = (long long)((*n) / base); in divide()
37 res = (int)((*n) % base); in divide()
38 *n = (long)((*n) / base); in divide()
|
| A D | rt_vsnprintf_std.c | 767 int n = (int) x; in bastardized_floor() local
768 return ( ((double) n) == x ) ? n : n-1; in bastardized_floor()
|
Completed in 31 milliseconds