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

12

/seL4-test-master/projects/musllibc/src/unistd/
H A Dgetgroups.c4 int getgroups(int count, gid_t list[]) argument
6 return syscall(SYS_getgroups, count, list);
/seL4-test-master/projects/musllibc/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-test-master/projects/sel4_projects_libs/libsel4vmmplatsupport/src/
H A Ddevice.c13 int device_list_init(device_list_t *list) argument
15 list->num_devices = 0;
16 list->devices = NULL;
25 int add_device(device_list_t *list, const struct device *d) argument
27 if (!list || !d) {
31 struct device *updated_devices = realloc(list->devices, sizeof(struct device) * (list->num_devices + 1));
35 list->devices = updated_devices;
36 memcpy(&list->devices[list
[all...]
/seL4-test-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...]
H A Dphy.c292 /* We want a list of states supported by
422 drv->list.next = &drv->list;
423 drv->list.prev = &drv->list;
424 list_add_tail(&drv->list, &phy_drivers);
460 drv = list_entry(entry, struct phy_driver, list);
/seL4-test-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-test-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-test-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-test-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-test-master/projects/musllibc/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-test-master/projects/sel4_projects_libs/libsel4vmmplatsupport/include/sel4vmmplatsupport/
H A Ddevice.h37 * Management for a list of devices
47 * @function device_list_init(list)
48 * Initialise an empty device list
49 * @param {device_list_t *} list device list to initialise
52 int device_list_init(device_list_t *list);
56 * Add a generic device to a given device list without performing any initialisation of the device
57 * @param {device_list_t *} dev_list A handle to the device list that the device should be installed into
65 * Find a device by a given addr within a device list
66 * @param {device_list_t *} dev_list Device list t
[all...]
/seL4-test-master/tools/riscv-pk/scripts/
H A Dvcs-version.sh96 ver_commits=`git rev-list --all | wc -l | tr -d " "`
/seL4-test-master/tools/seL4/cmake-tool/helpers/
H A Dcmakerepl19 list(GET tids 0 tid_path)
/seL4-test-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-test-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)
H A Dc_header.py115 Groups is a list of 'KernelRegionGroups', each of which represents a single contiguous region of memory that is associated with a device.
156 ret = list(ret.values())
/seL4-test-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-test-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
/seL4-test-master/projects/util_libs/libplatsupport/src/
H A Dtqueue.c35 static tqueue_node_t *head(tqueue_node_t *list) argument
38 return sglib_tqueue_node_t_it_init(&it, list);
130 /* iterate through the list until we find that id */
190 /* initialise the list */
/seL4-test-master/tools/seL4/misc/
H A Dstyle.py44 # construct a list of files to pass to each tool
52 filemap.get(k, list()).append(fname)
/seL4-test-master/projects/seL4_libs/libsel4allocman/src/utspace/
H A Dsplit.c106 struct utspace_split_node **list; local
109 list = split->heads;
112 list = split->dev_heads;
115 list = split->dev_mem_heads;
121 error = _insert_new_node(alloc, &list[size_bits[i]], uts[i], paddr ? paddr[i] : ALLOCMAN_NO_PADDR);
334 /* remove sibling from free list */

Completed in 137 milliseconds

12