Home
last modified time | relevance | path

Searched refs:n (Results 1 – 5 of 5) sorted by relevance

/include/
A Drtservice.h66 l->next = n; in rt_list_insert_after()
67 n->prev = l; in rt_list_insert_after()
81 l->prev = n; in rt_list_insert_before()
82 n->next = l; in rt_list_insert_before()
91 n->next->prev = n->prev; in rt_list_remove()
92 n->prev->next = n->next; in rt_list_remove()
94 n->next = n->prev = n; in rt_list_remove()
148 pos = n, n = pos->next)
172 pos = n, n = rt_list_entry(n->member.next, rt_typeof(*n), member))
205 node->next = n; in rt_slist_append()
[all …]
A Drtcompiler.h18 #define rt_align(n) __attribute__((aligned(n))) argument
33 #define rt_align(n) PRAGMA(data_alignment=n) argument
45 #define rt_align(n) __attribute__((aligned(n))) argument
55 #define rt_align(n) __attribute__((aligned(n))) argument
65 #define rt_align(n) __declspec(align(n)) argument
85 #define rt_align(n) __attribute__((aligned(n))) argument
100 #define rt_align(n) __attribute__((__align(n))) argument
A Drtdbg.h103 #define _DBG_COLOR(n) rt_kprintf("\033["#n"m")
109 #define _DBG_COLOR(n)
A Drtatomic.h243 rt_inline void rt_ll_slist_enqueue(rt_ll_slist_t *l, rt_ll_slist_t *n) in rt_ll_slist_enqueue() argument
249 n->next = exp; in rt_ll_slist_enqueue()
250 } while (!rt_atomic_compare_exchange_strong(&l->next, &exp, (rt_base_t)n)); in rt_ll_slist_enqueue()
/include/klibc/
A Dkstring.h20 void *rt_memset(void *src, int c, rt_ubase_t n);
21 void *rt_memcpy(void *dest, const void *src, rt_ubase_t n);
22 void *rt_memmove(void *dest, const void *src, rt_size_t n);
30 char *rt_strncpy(char *dest, const char *src, rt_size_t n);

Completed in 7 milliseconds