/seL4-refos-master/libs/libmuslc/src/thread/ |
H A D | pthread_cond_timedwait.c | 31 struct waiter *prev, *next; member in struct:waiter 92 node.next = c->_c_head; 95 else node.next->prev = &node; 130 if (c->_c_head == &node) c->_c_head = node.next; 131 else if (node.prev) node.prev->next = node.next; 133 else if (node.next) node.next->prev = node.prev; 154 if (!node.next) a_inc(&m->_m_waiters); 156 /* Unlock the barrier that's holding back the next waite [all...] |
H A D | pthread_mutex_trylock.c | 34 volatile void *next = self->robust_list.head; local 35 m->_m_next = next; 37 if (next != &self->robust_list.head) *(volatile void *volatile *) 38 ((char *)next - sizeof(void *)) = &m->_m_next;
|
H A D | synccall.c | 12 struct chain *next; member in struct:chain 33 do ch.next = head; 34 while (a_cas_p(&head, ch.next, &ch) != ch.next); 54 struct chain *cp, *next; local 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) { 167 next = cp->next; [all...] |
H A D | pthread_atfork.c | 8 struct atfork_funcs *prev, *next; member in struct:atfork_funcs 19 for (p=funcs; p; p = p->next) { 39 new->next = funcs;
|
/seL4-refos-master/kernel/include/benchmark/ |
H A D | benchmark_utilisation.h | 24 static inline void benchmark_utilisation_switch(tcb_t *heir, tcb_t *next) argument 41 /* Reset next thread utilisation */ 42 next->benchmark.schedule_start_time = ksEnter; 43 next->benchmark.number_schedules++;
|
/seL4-refos-master/libs/libmuslc/src/process/ |
H A D | posix_spawn_file_actions_addopen.c | 16 if ((op->next = fa->__actions)) op->next->prev = op;
|
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/ |
H A D | timeout.h | 35 struct fe *next; /* next item in chain */ member in struct:fe
|
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/ |
H A D | timeout.h | 35 struct fe *next; /* next item in chain */ member in struct:fe
|
/seL4-refos-master/libs/libmuslc/src/malloc/ |
H A D | malloc_usable_size.c | 7 struct chunk *next, *prev; member in struct:chunk
|
H A D | malloc.c | 23 struct chunk *next, *prev; member in struct:chunk 236 if (c->prev == c->next) 238 c->prev->next = c->next; 239 c->next->prev = c->prev; 285 struct chunk *next, *split; local 298 next = NEXT_CHUNK(self); 302 split->next = self->next; 303 split->prev->next 315 struct chunk *next, *split; local 392 struct chunk *self, *next; local 463 struct chunk *next; local [all...] |
/seL4-refos-master/libs/libcpio/src/ |
H A D | cpio.c | 23 struct cpio_header *next; member in struct:cpio_header_info 95 static unsigned long cpio_len_next(unsigned long len, void *prev, void *next) { argument 96 unsigned long diff = (unsigned long) (next - prev); 115 struct cpio_header *next; local 151 next = (struct cpio_header *) align_up((unsigned long) data + filesize, CPIO_ALIGNMENT); 157 info->next = next; 182 len = cpio_len_next(len, header, header_info.next); 183 header = header_info.next; 217 len = cpio_len_next(len, header, header_info.next); [all...] |
/seL4-refos-master/projects/util_libs/libcpio/src/ |
H A D | cpio.c | 23 struct cpio_header *next; member in struct:cpio_header_info 95 static unsigned long cpio_len_next(unsigned long len, void *prev, void *next) { argument 96 unsigned long diff = (unsigned long) (next - prev); 115 struct cpio_header *next; local 151 next = (struct cpio_header *) align_up((unsigned long) data + filesize, CPIO_ALIGNMENT); 157 info->next = next; 182 len = cpio_len_next(len, header, header_info.next); 183 header = header_info.next; 217 len = cpio_len_next(len, header, header_info.next); [all...] |
/seL4-refos-master/libs/libplatsupport/plat_include/pc99/platsupport/plat/acpi/tables/ |
H A D | asf.h | 140 char* next = (char*)cur + h->element_length; local 142 if (next < end) { 143 return (acpi_asf_dev_array_t*)next; 162 char* next = (char*)cur + h->element_length; local 164 if (next < end) { 165 return (acpi_asf_ctl_array_t*)next; 186 char* next = (char*)(cur + 1); local 188 if (next < end) { 189 return (acpi_asf_addr_smb_t*)next;
|
H A D | madt.h | 179 /* Retrieve the next DMAR sub header */ 184 void* next = (uint8_t*)hdr + hdr->length; local 186 if (next < end) { 187 return (acpi_madt_ics_hdr_t*)next; 197 acpi_madt_ics_hdr_t* next = acpi_madt_first_ics(tbl); local 198 while (next != NULL && index-- > 0) { 199 next = acpi_madt_next_ics(tbl, next); 201 return next; 204 /* Retrieve the next DMA [all...] |
/seL4-refos-master/projects/util_libs/libplatsupport/plat_include/pc99/platsupport/plat/acpi/tables/ |
H A D | asf.h | 140 char* next = (char*)cur + h->element_length; local 142 if (next < end) { 143 return (acpi_asf_dev_array_t*)next; 162 char* next = (char*)cur + h->element_length; local 164 if (next < end) { 165 return (acpi_asf_ctl_array_t*)next; 186 char* next = (char*)(cur + 1); local 188 if (next < end) { 189 return (acpi_asf_addr_smb_t*)next;
|
H A D | madt.h | 179 /* Retrieve the next DMAR sub header */ 184 void* next = (uint8_t*)hdr + hdr->length; local 186 if (next < end) { 187 return (acpi_madt_ics_hdr_t*)next; 197 acpi_madt_ics_hdr_t* next = acpi_madt_first_ics(tbl); local 198 while (next != NULL && index-- > 0) { 199 next = acpi_madt_next_ics(tbl, next); 201 return next; 204 /* Retrieve the next DMA [all...] |
/seL4-refos-master/libs/libmuslc/src/network/ |
H A D | res_msend.c | 44 int next; local 108 next = 0; 128 while ((rlen = recvfrom(fd, answers[next], asize, 0, 139 for (i=next; i<nqueries && ( 140 answers[next][0] != queries[i][0] || 141 answers[next][1] != queries[i][1] ); i++); 148 switch (answers[next][3] & 15) { 161 /* Store answer in the right slot, or update next 164 if (i == next) 165 for (; next<nquerie [all...] |
/seL4-refos-master/libs/libmuslc/src/regex/ |
H A D | glob.c | 14 struct match *next; member in struct:match 43 (*tail)->next = new; 44 new->next = NULL; 145 struct match *match, *next; local 146 for (match=head->next; match; match=next) { 147 next = match->next; 160 struct match head = { .next = NULL }, *tail = &head; 188 for (cnt=0, tail=head.next; tai [all...] |
H A D | tre-mem.c | 78 tmp = l->next; 134 l->next = NULL; 136 mem->current->next = l; 145 /* Make sure the next pointer will be aligned. */
|
/seL4-refos-master/libs/libmuslc/src/exit/ |
H A D | atexit.c | 10 struct fl *next; member in struct:fl 22 for (; head; head=head->next, slot=COUNT) while(slot-->0) { 49 new_fl->next = head;
|
/seL4-refos-master/projects/util_libs/libethdrivers/src/ |
H A D | lwip.c | 134 unsigned int next = MIN(q->len - pbuf_done, lens[buf] - buf_done); local 135 memcpy(q->payload + pbuf_done, ((dma_addr_t *)cookies[buf])->virt + buf_done, next); 136 buf_done += next; 137 pbuf_done += next; 138 copied += next; 144 q = q->next; 209 for (q = p; q != NULL; q = q->next) { 251 if (p->next) { 276 for (; p; p = p->next) { 280 uintptr_t next local 369 uintptr_t next = ROUND_UP(loc + 1, PAGE_SIZE_4K); local [all...] |
/seL4-refos-master/libs/libutils/include/utils/ |
H A D | sglib.h | 330 #define SGLIB_LIST_ADD(type, list, elem, next) {\ 331 (elem)->next = (list);\ 335 #define SGLIB_LIST_CONCAT(type, first, second, next) {\ 340 for(_p_ = (first); _p_->next!=NULL; _p_=_p_->next) ;\ 341 _p_->next = (second);\ 345 #define SGLIB_LIST_DELETE(type, list, elem, next) {\ 347 for(_p_ = &(list); *_p_!=NULL && *_p_!=(elem); _p_= &(*_p_)->next) ;\ 349 *_p_ = (*_p_)->next;\ 352 #define SGLIB_LIST_ADD_IF_NOT_MEMBER(type, list, elem, comparator, next, membe [all...] |
/seL4-refos-master/projects/util_libs/libutils/include/utils/ |
H A D | sglib.h | 330 #define SGLIB_LIST_ADD(type, list, elem, next) {\ 331 (elem)->next = (list);\ 335 #define SGLIB_LIST_CONCAT(type, first, second, next) {\ 340 for(_p_ = (first); _p_->next!=NULL; _p_=_p_->next) ;\ 341 _p_->next = (second);\ 345 #define SGLIB_LIST_DELETE(type, list, elem, next) {\ 347 for(_p_ = &(list); *_p_!=NULL && *_p_!=(elem); _p_= &(*_p_)->next) ;\ 349 *_p_ = (*_p_)->next;\ 352 #define SGLIB_LIST_ADD_IF_NOT_MEMBER(type, list, elem, comparator, next, membe [all...] |
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/ |
H A D | light.c | 73 ls->next = light_base; 109 for (prev = 0, curr = light_base; curr; prev = curr, curr = curr->next) { 113 prev->next = curr->next; 115 light_base = curr->next; 136 for (ls = light_base; ls; ls = ls->next) { 267 *prev = curr->next; 270 prev = &(*prev)->next; 293 ls->next = light_base; 307 for (ls = light_base; ls; ls = ls->next) { [all...] |
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/ |
H A D | light.c | 73 ls->next = light_base; 109 for (prev = 0, curr = light_base; curr; prev = curr, curr = curr->next) { 113 prev->next = curr->next; 115 light_base = curr->next; 136 for (ls = light_base; ls; ls = ls->next) { 267 *prev = curr->next; 270 prev = &(*prev)->next; 293 ls->next = light_base; 307 for (ls = light_base; ls; ls = ls->next) { [all...] |