Searched refs:head (Results 1 - 25 of 59) sorted by relevance

123

/seL4-refos-master/libs/libmuslc/src/stdio/
H A Dofl_add.c5 FILE **head = __ofl_lock(); local
6 f->next = *head;
7 if (*head) (*head)->prev = f;
8 *head = f;
H A Dfclose.c17 FILE **head = __ofl_lock(); local
20 if (*head == f) *head = f->next;
/seL4-refos-master/libs/libmuslc/src/exit/
H A Datexit.c13 } builtin, *head; variable in typeref:struct:fl
22 for (; head; head=head->next, slot=COUNT) while(slot-->0) {
23 func = head->f[slot];
24 arg = head->a[slot];
39 /* Defer initialization of head so it can be in BSS */
40 if (!head) head = &builtin;
49 new_fl->next = head;
[all...]
/seL4-refos-master/projects/util_libs/libutils/include/utils/
H A Duthash.h149 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
153 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \
154 (head)->hh.tbl->buckets[_hd_bkt].count++; \
164 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
167 if (head) { \
169 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
170 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
171 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \
176 #define HASH_FIND(hh,head,keypt
[all...]
H A Dcircular_buffer.h33 off_t head; member in struct:circ_buf
60 cb->head = 0;
75 return _next_pos(cb, cb->tail) == cb->head;
86 return cb->tail == cb->head;
108 uint8_t c = cb->buf[cb->head];
109 cb->head = _next_pos(cb, cb->head);
/seL4-refos-master/libs/libutils/include/utils/
H A Duthash.h149 #define HASH_ROLLBACK_BKT(hh, head, itemptrhh) \
153 HASH_TO_BKT(_hd_hh_item->hashv, (head)->hh.tbl->num_buckets, _hd_bkt); \
154 (head)->hh.tbl->buckets[_hd_bkt].count++; \
164 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
167 if (head) { \
169 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
170 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
171 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \
176 #define HASH_FIND(hh,head,keypt
[all...]
H A Dcircular_buffer.h33 off_t head; member in struct:circ_buf
60 cb->head = 0;
75 return _next_pos(cb, cb->tail) == cb->head;
86 return cb->tail == cb->head;
108 uint8_t c = cb->buf[cb->head];
109 cb->head = _next_pos(cb, cb->head);
H A Dlist.h21 struct list_node *head; member in struct:__anon2
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/imx6/uboot/
H A Dlist.h56 * @head: list head to add it after
58 * Insert a new entry after the specified head.
61 static inline void list_add(struct list_head *new, struct list_head *head) argument
63 __list_add(new, head, head->next);
69 * @head: list head to add it before
71 * Insert a new entry before the specified head.
74 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
143 list_move(struct list_head *list, struct list_head *head) argument
154 list_move_tail(struct list_head *list, struct list_head *head) argument
166 list_is_last(const struct list_head *list, const struct list_head *head) argument
176 list_empty(const struct list_head *head) argument
194 list_empty_careful(const struct list_head *head) argument
204 list_is_singular(const struct list_head *head) argument
209 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
235 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
268 list_splice(const struct list_head *list, struct list_head *head) argument
280 list_splice_tail(struct list_head *list, struct list_head *head) argument
294 list_splice_init(struct list_head *list, struct list_head *head) argument
311 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/zynq7000/uboot/
H A Dlist.h58 * @head: list head to add it after
60 * Insert a new entry after the specified head.
63 static inline void list_add(struct list_head *new, struct list_head *head) argument
65 __list_add(new, head, head->next);
71 * @head: list head to add it before
73 * Insert a new entry before the specified head.
76 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
145 list_move(struct list_head *list, struct list_head *head) argument
156 list_move_tail(struct list_head *list, struct list_head *head) argument
168 list_is_last(const struct list_head *list, const struct list_head *head) argument
178 list_empty(const struct list_head *head) argument
196 list_empty_careful(const struct list_head *head) argument
206 list_is_singular(const struct list_head *head) argument
211 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
237 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
270 list_splice(const struct list_head *list, struct list_head *head) argument
282 list_splice_tail(struct list_head *list, struct list_head *head) argument
296 list_splice_init(struct list_head *list, struct list_head *head) argument
313 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/tx2/uboot/
H A Dlist.h58 * @head: list head to add it after
60 * Insert a new entry after the specified head.
63 static inline void list_add(struct list_head *new, struct list_head *head) argument
65 __list_add(new, head, head->next);
71 * @head: list head to add it before
73 * Insert a new entry before the specified head.
76 static inline void list_add_tail(struct list_head *new, struct list_head *head) argument
145 list_move(struct list_head *list, struct list_head *head) argument
156 list_move_tail(struct list_head *list, struct list_head *head) argument
168 list_is_last(const struct list_head *list, const struct list_head *head) argument
178 list_empty(const struct list_head *head) argument
196 list_empty_careful(const struct list_head *head) argument
206 list_is_singular(const struct list_head *head) argument
211 __list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
237 list_cut_position(struct list_head *list, struct list_head *head, struct list_head *entry) argument
273 list_splice(const struct list_head *list, struct list_head *head) argument
286 list_splice_tail(struct list_head *list, struct list_head *head) argument
301 list_splice_init(struct list_head *list, struct list_head *head) argument
318 list_splice_tail_init(struct list_head *list, struct list_head *head) argument
[all...]
/seL4-refos-master/libs/libmuslc/src/stdlib/
H A Dqsort.c88 static void sift(unsigned char *head, size_t width, cmpfun cmp, int pshift, size_t lp[]) argument
94 ar[0] = head;
96 rt = head - width;
97 lf = head - width - lp[pshift - 2];
104 head = lf;
108 head = rt;
115 static void trinkle(unsigned char *head, size_t width, cmpfun cmp, size_t pp[2], int pshift, int trusty, size_t lp[]) argument
127 ar[0] = head;
129 stepson = head - lp[pshift];
134 rt = head
158 unsigned char *head, *high; local
[all...]
/seL4-refos-master/libs/libutils/src/
H A Dlist.c23 l->head = NULL;
58 return l->head == NULL;
64 for (node_t *n = l->head; n != NULL; n = n->next) {
76 for (node_t *n = l->head; n != NULL; n = n->next) {
86 for (node_t *n = l->head; n != NULL; n = n->next, i++) {
97 for (node_t *n = l->head; n != NULL; n = n->next) {
110 for (node_t *prev = NULL, *n = l->head; n != NULL; prev = n, n = n->next) {
113 /* Removing the list head. */
114 l->head = n->next;
135 for (node_t *n = l->head;
[all...]
/seL4-refos-master/projects/util_libs/libutils/src/
H A Dlist.c23 l->head = NULL;
58 return l->head == NULL;
64 for (node_t *n = l->head; n != NULL; n = n->next) {
76 for (node_t *n = l->head; n != NULL; n = n->next) {
86 for (node_t *n = l->head; n != NULL; n = n->next, i++) {
97 for (node_t *n = l->head; n != NULL; n = n->next) {
110 for (node_t *prev = NULL, *n = l->head; n != NULL; prev = n, n = n->next) {
113 /* Removing the list head. */
114 l->head = n->next;
135 for (node_t *n = l->head;
[all...]
/seL4-refos-master/libs/libsel4allocman/src/utspace/
H A Dsplit.c22 static void _remove_node(struct utspace_split_node **head, struct utspace_split_node *node) argument
27 assert(*head == node);
28 *head = node->next;
33 node->head = head;
36 static void _insert_node(struct utspace_split_node **head, struct utspace_split_node *node) argument
38 node->next = *head;
40 if (*head) {
41 (*head)->prev = node;
43 *head
73 _insert_new_node(allocman_t *alloc, struct utspace_split_node **head, cspacepath_t ut, uintptr_t paddr) argument
225 find_head_for_paddr(struct utspace_split_node **head, uintptr_t paddr, size_t size_bits) argument
257 struct utspace_split_node **head = NULL; local
[all...]
/seL4-refos-master/projects/seL4_libs/libsel4allocman/src/utspace/
H A Dsplit.c22 static void _remove_node(struct utspace_split_node **head, struct utspace_split_node *node) argument
27 assert(*head == node);
28 *head = node->next;
33 node->head = head;
36 static void _insert_node(struct utspace_split_node **head, struct utspace_split_node *node) argument
38 node->next = *head;
40 if (*head) {
41 (*head)->prev = node;
43 *head
73 _insert_new_node(allocman_t *alloc, struct utspace_split_node **head, cspacepath_t ut, uintptr_t paddr) argument
225 find_head_for_paddr(struct utspace_split_node **head, uintptr_t paddr, size_t size_bits) argument
257 struct utspace_split_node **head = NULL; local
[all...]
/seL4-refos-master/libs/libmuslc/src/thread/
H A Dpthread_mutex_trylock.c34 volatile void *next = self->robust_list.head;
36 m->_m_prev = &self->robust_list.head;
37 if (next != &self->robust_list.head) *(volatile void *volatile *)
39 self->robust_list.head = &m->_m_next;
H A Dsynccall.c15 } *volatile head; variable
33 do ch.next = head;
34 while (a_cas_p(&head, ch.next, &ch) != ch.next);
68 head = 0;
119 for (cp = head; cp && cp->tid != tid; cp=cp->next);
153 for (cp=head; cp; cp=cp->next) {
166 for (cp=head; cp; cp=next) {
H A Dpthread_mutex_unlock.c24 if (next != &self->robust_list.head) *(volatile void *volatile *)
/seL4-refos-master/kernel/src/smp/
H A Dlock.c20 /* Initialize the CLH head */
22 big_kernel_lock.head = &big_kernel_lock.nodes[CONFIG_MAX_NUM_NODES];
/seL4-refos-master/libs/libmuslc/src/regex/
H A Dglob.c143 static void freelist(struct match *head) argument
146 for (match=head->next; match; match=next) {
160 struct match head = { .next = NULL }, *tail = &head; local
184 freelist(&head);
188 for (cnt=0, tail=head.next; tail; tail=tail->next, cnt++);
191 tail = &head;
202 freelist(&head);
210 freelist(&head);
216 for (i=0, tail=head
[all...]
/seL4-refos-master/seL4_tools/cmake-tool/helpers/
H A Dplatform_sift.py135 head = '''{comment_begin}
155 report = '{head}{body}{tail}'.format(head=head, body=body, tail=tail)
157 head = 'number of memory regions: {}\n'.format(n) variable
166 report = '{head}{body}'.format(head=head, body='\n'.join(regions))
/seL4-refos-master/libs/libmuslc/arch/aarch64/bits/
H A Dsignal.h32 struct _aarch64_ctx head; member in struct:fpsimd_context
38 struct _aarch64_ctx head; member in struct:esr_context
/seL4-refos-master/libs/libmuslc/arch/aarch64_sel4/bits/
H A Dsignal.h32 struct _aarch64_ctx head; member in struct:fpsimd_context
38 struct _aarch64_ctx head; member in struct:esr_context
/seL4-refos-master/kernel/include/smp/
H A Dlock.h48 clh_qnode_t *head; member in struct:clh_lock
71 while (!try_arch_atomic_exchange_rlx(&big_kernel_lock.head,
98 prev = sel4_atomic_exchange(&big_kernel_lock.head, irqPath, cpu, __ATOMIC_ACQ_REL);

Completed in 107 milliseconds

123