Searched refs:list (Results 1 - 25 of 68) sorted by relevance

123

/seL4-refos-master/libs/libmuslc/src/unistd/
H A Dgetgroups.c4 int getgroups(int count, gid_t list[]) argument
6 return syscall(SYS_getgroups, count, list);
/seL4-refos-master/libs/libmuslc/src/linux/
H A Dsetgroups.c5 int setgroups(size_t count, const gid_t list[]) argument
7 return syscall(SYS_setgroups, count, list);
H A Dxattr.c19 ssize_t listxattr(const char *path, char *list, size_t size) argument
21 return syscall(SYS_listxattr, path, list, size);
24 ssize_t llistxattr(const char *path, char *list, size_t size) argument
26 return syscall(SYS_llistxattr, path, list, size);
29 ssize_t flistxattr(int filedes, char *list, size_t size) argument
31 return syscall(SYS_flistxattr, filedes, list, size);
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/sys/unix/
H A Ddepend.awk5 # cd src ; nawk -f depend.awk ../include/*.h list-of-.c/.cpp-files
89 # write a target and its dependency list in pretty-printed format;
92 function format_dep(target, source, n, i, list)
99 n = split(source, list, " +")
101 if (col + length(list[i]) >= (i < n ? 78 : 80)) {
106 printf("%s", list[i]); col += length(list[i])
110 source = list[2]
125 function depend(inout, name, skip, n, i, list)
135 #- n = split(deps[name], list, "
[all...]
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/sys/unix/
H A Ddepend.awk5 # cd src ; nawk -f depend.awk ../include/*.h list-of-.c/.cpp-files
89 # write a target and its dependency list in pretty-printed format;
92 function format_dep(target, source, n, i, list)
99 n = split(source, list, " +")
101 if (col + length(list[i]) >= (i < n ? 78 : 80)) {
106 printf("%s", list[i]); col += length(list[i])
110 source = list[2]
125 function depend(inout, name, skip, n, i, list)
135 #- n = split(deps[name], list, "
[all...]
/seL4-refos-master/projects/util_libs/libethdrivers/src/plat/imx6/uboot/
H A Dlist.h18 * Simple doubly linked list implementation.
31 static inline void INIT_LIST_HEAD(struct list_head *list) argument
33 list->next = list;
34 list->prev = list;
40 * This is only for internal list manipulation where we know
56 * @head: list head to add it after
69 * @head: list head to add it before
80 * Delete a list entr
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
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
249 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) 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.h15 * Simple doubly linked list implementation.
33 static inline void INIT_LIST_HEAD(struct list_head *list) argument
35 list->next = list;
36 list->prev = list;
42 * This is only for internal list manipulation where we know
58 * @head: list head to add it after
71 * @head: list head to add it before
82 * Delete a list entr
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
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
251 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) 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.h15 * Simple doubly linked list implementation.
33 static inline void INIT_LIST_HEAD(struct list_head *list) argument
35 list->next = list;
36 list->prev = list;
42 * This is only for internal list manipulation where we know
58 * @head: list head to add it after
71 * @head: list head to add it before
82 * Delete a list entr
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
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
254 __list_splice(const struct list_head *list, struct list_head *prev, struct list_head *next) 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/libutils/include/utils/
H A Dsglib.h330 #define SGLIB_LIST_ADD(type, list, elem, next) {\
331 (elem)->next = (list);\
332 (list) = (elem);\
345 #define SGLIB_LIST_DELETE(type, list, elem, next) {\
347 for(_p_ = &(list); *_p_!=NULL && *_p_!=(elem); _p_= &(*_p_)->next) ;\
352 #define SGLIB_LIST_ADD_IF_NOT_MEMBER(type, list, elem, comparator, next, member) {\
354 for(_p_ = (list); _p_!=NULL && comparator(_p_, (elem)) != 0; _p_= _p_->next) ;\
357 SGLIB_LIST_ADD(type, list, elem, next);\
361 #define SGLIB_LIST_DELETE_IF_MEMBER(type, list, elem, comparator, next, member) {\
363 for(_p_ = &(list); *_p
[all...]
H A Dutil.h33 #include <utils/list.h>
/seL4-refos-master/projects/util_libs/libutils/include/utils/
H A Dsglib.h330 #define SGLIB_LIST_ADD(type, list, elem, next) {\
331 (elem)->next = (list);\
332 (list) = (elem);\
345 #define SGLIB_LIST_DELETE(type, list, elem, next) {\
347 for(_p_ = &(list); *_p_!=NULL && *_p_!=(elem); _p_= &(*_p_)->next) ;\
352 #define SGLIB_LIST_ADD_IF_NOT_MEMBER(type, list, elem, comparator, next, member) {\
354 for(_p_ = (list); _p_!=NULL && comparator(_p_, (elem)) != 0; _p_= _p_->next) ;\
357 SGLIB_LIST_ADD(type, list, elem, next);\
361 #define SGLIB_LIST_DELETE_IF_MEMBER(type, list, elem, comparator, next, member) {\
363 for(_p_ = &(list); *_p
[all...]
H A Dutil.h33 #include <utils/list.h>
/seL4-refos-master/projects/util_libs/libfdt/
H A Dfdt_ro.c30 * copyright notice, this list of conditions and the following
33 * copyright notice, this list of conditions and the following
725 const char *list, *end; local
728 list = fdt_getprop(fdt, nodeoffset, property, &length);
729 if (!list)
732 end = list + length;
734 while (list < end) {
735 length = strnlen(list, end - list) + 1;
738 if (list
752 const char *list, *end; local
782 const char *list, *end; local
[all...]
/seL4-refos-master/libs/libmuslc/src/network/
H A Dif_nameindex.c21 struct ifnamemap *list; member in struct:ifnameindexctx
54 map = &ctx->list[i-1];
65 map = realloc(ctx->list, a * sizeof *map);
67 ctx->list = map;
70 map = &ctx->list[ctx->num];
100 for (i = ctx->num, d = ifs, s = ctx->list; i; i--, s++, d++) {
111 free(ctx->list);
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/include/
H A Dlev.h23 genericptr_t list; member in struct:container
35 struct bubble *prev, *next; /* need to traverse the list up and down */
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/include/
H A Dlev.h23 genericptr_t list; member in struct:container
35 struct bubble *prev, *next; /* need to traverse the list up and down */
/seL4-refos-master/projects/refos/impl/apps/nethack/src/nethack-3.4.3/src/
H A Dend.c25 static struct val_list { struct valuable_data *list; int size; } valuables[] = { member in struct:val_list
438 * Get valuables from the given list. Revised code: the list always remains
442 get_valuables(list)
443 struct obj *list; /* inventory or container contents */
449 for (obj = list; obj; obj = obj->nobj)
475 sort_valuables(list, size)
476 struct valuable_data list[];
482 /* move greater quantities to the front of the list */
484 if (list[
[all...]
/seL4-refos-master/apps/nethack/src/nethack-3.4.3/src/
H A Dend.c25 static struct val_list { struct valuable_data *list; int size; } valuables[] = { member in struct:val_list
438 * Get valuables from the given list. Revised code: the list always remains
442 get_valuables(list)
443 struct obj *list; /* inventory or container contents */
449 for (obj = list; obj; obj = obj->nobj)
475 sort_valuables(list, size)
476 struct valuable_data list[];
482 /* move greater quantities to the front of the list */
484 if (list[
[all...]
/seL4-refos-master/seL4_tools/cmake-tool/helpers/
H A Dcmakerepl19 list(GET tids 0 tid_path)
/seL4-refos-master/kernel/tools/hardware/
H A Ddevice.py105 prop = list(self.props['reg'].words)
119 data = list(self.props['interrupts-extended'].words)
125 data = list(self.props['interrupts'].words)
134 return list(self.get_prop('interrupt-affinity').words)
176 data = list(ranges_prop.words)
182 # ranges is a list of tuples with the following format:
H A Dirq.py16 ''' Given a node and a list of 32-bit integers representing
17 that node's interrupt specifier list, parse one interrupt and return
48 # interrupt-map is a list of the following:
57 nexus_data = list(self.node.get_prop('interrupt-map').words)
66 addr = Utils.make_number(child_addr_cells, list(child.get_prop('reg').words))
77 masks = list(self.node.get_prop('interrupt-map-mask').words)
/seL4-refos-master/kernel/tools/hardware/outputs/
H A Delfloader.py121 cpuid = cpu_node.parse_address(list(cpu_node.get_prop('reg').words))
128 device.Utils.make_number(2, list(cpu_node.get_prop('cpu-release-addr').words)))
H A Dyaml.py33 dev_mem = memory.get_addrspace_exclude(list(reserved) + phys_mem + kernel_devs, config)
/seL4-refos-master/projects/seL4_libs/libsel4test/tools/
H A Dextract_results.py56 'attrs': ' '.join(['%s="%s"' % (x[0], x[1]) for x in list(tag.attrs.items())]),
60 list(map(functools.partial(print_tag, f),
/seL4-refos-master/kernel/include/arch/x86/arch/kernel/
H A Dboot.h17 p_region_t list[MAX_NUM_FREEMEM_REG]; member in struct:mem_p_regs

Completed in 136 milliseconds

123