Home
last modified time | relevance | path

Searched refs:list (Results 1 – 25 of 1936) sorted by relevance

12345678910>>...78

/openbmc/qemu/system/
H A Dmemory_mapping.c25 static void memory_mapping_list_add_mapping_sorted(MemoryMappingList *list, in memory_mapping_list_add_mapping_sorted() argument
30 QTAILQ_FOREACH(p, &list->head, next) { in memory_mapping_list_add_mapping_sorted()
36 QTAILQ_INSERT_TAIL(&list->head, mapping, next); in memory_mapping_list_add_mapping_sorted()
39 static void create_new_memory_mapping(MemoryMappingList *list, in create_new_memory_mapping() argument
50 list->last_mapping = memory_mapping; in create_new_memory_mapping()
51 list->num++; in create_new_memory_mapping()
52 memory_mapping_list_add_mapping_sorted(list, memory_mapping); in create_new_memory_mapping()
107 void memory_mapping_list_add_merge_sorted(MemoryMappingList *list, in memory_mapping_list_add_merge_sorted() argument
114 if (QTAILQ_EMPTY(&list->head)) { in memory_mapping_list_add_merge_sorted()
115 create_new_memory_mapping(list, phys_addr, virt_addr, length); in memory_mapping_list_add_merge_sorted()
[all …]
/openbmc/qemu/util/
H A Dnotify.c19 void notifier_list_init(NotifierList *list) in notifier_list_init() argument
21 QLIST_INIT(&list->notifiers); in notifier_list_init()
24 void notifier_list_add(NotifierList *list, Notifier *notifier) in notifier_list_add() argument
26 QLIST_INSERT_HEAD(&list->notifiers, notifier, node); in notifier_list_add()
34 void notifier_list_notify(NotifierList *list, void *data) in notifier_list_notify() argument
38 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) { in notifier_list_notify()
43 bool notifier_list_empty(NotifierList *list) in notifier_list_empty() argument
45 return QLIST_EMPTY(&list->notifiers); in notifier_list_empty()
48 void notifier_with_return_list_init(NotifierWithReturnList *list) in notifier_with_return_list_init() argument
50 QLIST_INIT(&list->notifiers); in notifier_with_return_list_init()
[all …]
H A Dreserved-region.c24 GList *resv_region_list_insert(GList *list, ReservedRegion *reg) in resv_region_list_insert() argument
31 for (l = list; l ; ) { in resv_region_list_insert()
39 return g_list_insert_before(list, l, reg); in resv_region_list_insert()
45 list = g_list_delete_link(list, l); in resv_region_list_insert()
49 l = list; in resv_region_list_insert()
57 return g_list_insert_before(list, l, reg); in resv_region_list_insert()
75 list = g_list_insert_before(list, l, new_reg); in resv_region_list_insert()
76 return g_list_insert_before(list, l, reg); in resv_region_list_insert()
81 return g_list_insert_before(list, l, reg); in resv_region_list_insert()
89 return g_list_append(list, reg); in resv_region_list_insert()
H A Dqemu-option.c127 const QemuOptDesc *desc = find_desc_by_name(opts->list->desc, name); in find_default_by_name()
179 void qemu_opts_print_help(QemuOptsList *list, bool print_caption) in qemu_opts_print_help() argument
185 assert(list); in qemu_opts_print_help()
186 desc = list->desc; in qemu_opts_print_help()
203 if (list->name) { in qemu_opts_print_help()
204 printf("%s options:\n", list->name); in qemu_opts_print_help()
209 if (list->name) { in qemu_opts_print_help()
210 printf("There are no options for %s.\n", list->name); in qemu_opts_print_help()
463 static bool opts_accepts_any(const QemuOptsList *list) in opts_accepts_any() argument
465 return list->desc[0].name == NULL; in opts_accepts_any()
[all …]
H A Dnvdimm-utils.c7 GSList **list = opaque; in nvdimm_device_list() local
10 *list = g_slist_append(*list, DEVICE(obj)); in nvdimm_device_list()
26 GSList *list = NULL; in nvdimm_get_device_list() local
28 object_child_foreach(qdev_get_machine(), nvdimm_device_list, &list); in nvdimm_get_device_list()
29 return list; in nvdimm_get_device_list()
H A Dqemu-config.c44 QemuOptsList *list; in qemu_find_opts_singleton() local
47 list = qemu_find_opts(group); in qemu_find_opts_singleton()
48 assert(list); in qemu_find_opts_singleton()
49 opts = qemu_opts_find(list, NULL); in qemu_find_opts_singleton()
51 opts = qemu_opts_create(list, NULL, 0, &error_abort); in qemu_find_opts_singleton()
61 void qemu_add_drive_opts(QemuOptsList *list) in qemu_add_drive_opts() argument
69 drive_config_groups[i] = list; in qemu_add_drive_opts()
77 void qemu_add_opts(QemuOptsList *list) in qemu_add_opts() argument
85 vm_config_groups[i] = list; in qemu_add_opts()
171 QemuOptsList *list; in qemu_config_do_parse() local
[all …]
/openbmc/qemu/monitor/
H A Dqmp-cmds-control.c42 static bool qmp_caps_accept(MonitorQMP *mon, QMPCapabilityList *list, in qmp_caps_accept() argument
50 for (; list; list = list->next) { in qmp_caps_accept()
51 if (!mon->capab_offered[list->value]) { in qmp_caps_accept()
53 unavailable = g_string_new(QMPCapability_str(list->value)); in qmp_caps_accept()
56 QMPCapability_str(list->value)); in qmp_caps_accept()
59 capab[list->value] = true; in qmp_caps_accept()
111 CommandInfoList **list = opaque; in query_commands_cb() local
119 QAPI_LIST_PREPEND(*list, info); in query_commands_cb()
124 CommandInfoList *list = NULL; in qmp_query_commands() local
131 qmp_for_each_command(mon->commands, query_commands_cb, &list); in qmp_query_commands()
[all …]
/openbmc/qemu/include/system/
H A Dmemory_mapping.h61 void memory_mapping_list_add_merge_sorted(MemoryMappingList *list,
66 void memory_mapping_list_free(MemoryMappingList *list);
68 void memory_mapping_list_init(MemoryMappingList *list);
70 void guest_phys_blocks_free(GuestPhysBlockList *list);
71 void guest_phys_blocks_init(GuestPhysBlockList *list);
72 void guest_phys_blocks_append(GuestPhysBlockList *list);
74 bool qemu_get_guest_memory_mapping(MemoryMappingList *list,
79 void qemu_get_guest_simple_memory_mapping(MemoryMappingList *list,
82 void memory_mapping_filter(MemoryMappingList *list, int64_t begin,
/openbmc/openbmc-test-automation/lib/
H A Dlist_utils.robot2 Documentation This module contains keywords for list manipulation.
9 [Documentation] Combine all valid list arguments and return the result.
13 # lists A list of lists to be combined. Any item in this list which is
14 # NOT a list will be removed.
21 IF '${type_arg}' != 'list'
34 [Documentation] Intersects the two lists passed in. Returns a list of
39 # list1 The first list to intersect.
40 # list2 The second list to intersect.
63 [Documentation] Subtract list
[all...]
/openbmc/qemu/target/i386/
H A Darch_memory_mapping.c20 static void walk_pte(MemoryMappingList *list, AddressSpace *as, in walk_pte() argument
44 memory_mapping_list_add_merge_sorted(list, start_paddr, in walk_pte()
50 static void walk_pte2(MemoryMappingList *list, AddressSpace *as, in walk_pte2() argument
74 memory_mapping_list_add_merge_sorted(list, start_paddr, in walk_pte2()
82 static void walk_pde(MemoryMappingList *list, AddressSpace *as, in walk_pde() argument
108 memory_mapping_list_add_merge_sorted(list, start_paddr, in walk_pde()
114 walk_pte(list, as, pte_start_addr, a20_mask, line_addr); in walk_pde()
119 static void walk_pde2(MemoryMappingList *list, AddressSpace *as, in walk_pde2() argument
150 memory_mapping_list_add_merge_sorted(list, start_paddr, in walk_pde2()
156 walk_pte2(list, as, pte_start_addr, a20_mask, line_addr); in walk_pde2()
[all …]
/openbmc/u-boot/include/linux/
H A Dlist.h31 static inline void INIT_LIST_HEAD(struct list_head *list) in INIT_LIST_HEAD() argument
33 list->next = list; in INIT_LIST_HEAD()
34 list->prev = list; in INIT_LIST_HEAD()
143 static inline void list_move(struct list_head *list, struct list_head *head) in list_move() argument
145 __list_del(list->prev, list->next); in list_move()
146 list_add(list, head); in list_move()
154 static inline void list_move_tail(struct list_head *list, in list_move_tail() argument
157 __list_del(list->prev, list->next); in list_move_tail()
158 list_add_tail(list, head); in list_move_tail()
166 static inline int list_is_last(const struct list_head *list, in list_is_last() argument
[all …]
/openbmc/u-boot/Documentation/
H A Dlinker_lists.rst6 A linker list is constructed by grouping together linker input
7 sections, each containing one entry of the list. Each input section
9 content. Linker list input sections are constructed from the list
11 together. Assuming _list and _entry are the list and entry names,
39 single list.
42 allows putting a start and end symbols around a list, by mapping
45 Start and end symbols for a list can generally be defined as
60 Here is an example of the sorted sections which result from a list
73 part of a list), one can simply give the list a name of the form
74 'outer_2_inner', where 'outer' is the global list name and 'inner'
[all …]
/openbmc/qemu/include/qapi/
H A Dutil.h39 #define QAPI_LIST_PREPEND(list, element) do { \ argument
40 typeof(list) _tmp = g_malloc(sizeof(*(list))); \
42 _tmp->next = (list); \
43 (list) = _tmp; \
62 #define QAPI_LIST_LENGTH(list) \ argument
65 typeof_strip_qual(list) _tail; \
66 for (_tail = list; _tail != NULL; _tail = _tail->next) { \
/openbmc/qemu/chardev/
H A Dchar-hmp-cmds.c148 ChardevBackendInfoList *list, *start; in chardev_add_completion() local
156 start = list = qmp_query_chardev_backends(NULL); in chardev_add_completion()
157 while (list) { in chardev_add_completion()
158 const char *chr_name = list->value->name; in chardev_add_completion()
163 list = list->next; in chardev_add_completion()
171 ChardevInfoList *list, *start; in chardev_remove_completion() local
179 start = list = qmp_query_chardev(NULL); in chardev_remove_completion()
180 while (list) { in chardev_remove_completion()
181 ChardevInfo *chr = list->value; in chardev_remove_completion()
186 list = list->next; in chardev_remove_completion()
[all …]
/openbmc/qemu/tests/unit/
H A Dtest-qemu-opts.c110 QemuOptsList *list; in test_find_unknown_opts() local
114 list = qemu_find_opts_err("unknown", &err); in test_find_unknown_opts()
115 g_assert(list == NULL); in test_find_unknown_opts()
121 QemuOptsList *list; in test_qemu_find_opts() local
124 list = qemu_find_opts("opts_list_01"); in test_qemu_find_opts()
125 g_assert(list != NULL); in test_qemu_find_opts()
126 g_assert_cmpstr(list->name, ==, "opts_list_01"); in test_qemu_find_opts()
131 QemuOptsList *list; in test_qemu_opts_create() local
134 list = qemu_find_opts("opts_list_01"); in test_qemu_opts_create()
135 g_assert(list != NULL); in test_qemu_opts_create()
[all …]
/openbmc/u-boot/scripts/kconfig/lxdialog/
H A Dchecklist.c109 WINDOW *dialog, *list; in dialog_checklist() local
157 list = subwin(dialog, list_height, list_width, y + box_y + 1, in dialog_checklist()
160 keypad(list, TRUE); in dialog_checklist()
183 print_item(list, i, i == choice); in dialog_checklist()
192 wnoutrefresh(list); in dialog_checklist()
214 print_item(list, 0, FALSE); in dialog_checklist()
215 scrollok(list, TRUE); in dialog_checklist()
216 wscrl(list, -1); in dialog_checklist()
217 scrollok(list, FALSE); in dialog_checklist()
221 print_item(list, 0, TRUE); in dialog_checklist()
[all …]
/openbmc/qemu/hw/virtio/
H A Diothread-vq-mapping.c14 iothread_vq_mapping_validate(IOThreadVirtQueueMappingList *list, uint16_t in iothread_vq_mapping_validate() argument
21 for (IOThreadVirtQueueMappingList *node = list; node; node = node->next) { in iothread_vq_mapping_validate()
37 if (node != list) { in iothread_vq_mapping_validate()
38 if (!!node->value->vqs != !!list->value->vqs) { in iothread_vq_mapping_validate()
61 if (list->value->vqs) { in iothread_vq_mapping_validate()
76 IOThreadVirtQueueMappingList *list, in iothread_vq_mapping_apply() argument
85 if (!iothread_vq_mapping_validate(list, num_queues, errp)) { in iothread_vq_mapping_apply()
89 for (node = list; node; node = node->next) { in iothread_vq_mapping_apply()
93 for (node = list; node; node = node->next) { in iothread_vq_mapping_apply()
122 void iothread_vq_mapping_cleanup(IOThreadVirtQueueMappingList *list) in iothread_vq_mapping_cleanup() argument
[all …]
H A Dvirtio-hmp-cmds.c64 strList *list = features->dev_features; in hmp_virtio_dump_features() local
65 if (list) { in hmp_virtio_dump_features()
66 while (list) { in hmp_virtio_dump_features()
67 monitor_printf(mon, "\t%s", list->value); in hmp_virtio_dump_features()
68 list = list->next; in hmp_virtio_dump_features()
69 if (list != NULL) { in hmp_virtio_dump_features()
85 VirtioInfoList *list = qmp_x_query_virtio(&err); in hmp_virtio_query() local
93 if (list == NULL) { in hmp_virtio_query()
98 node = list; in hmp_virtio_query()
104 qapi_free_VirtioInfoList(list); in hmp_virtio_query()
[all …]
/openbmc/qemu/qom/
H A Dqom-hmp-cmds.c23 ObjectPropertyInfoList *list; in hmp_qom_list() local
31 list = qmp_qom_list(path, &err); in hmp_qom_list()
33 ObjectPropertyInfoList *start = list; in hmp_qom_list()
34 while (list != NULL) { in hmp_qom_list()
35 ObjectPropertyInfo *value = list->value; in hmp_qom_list()
39 list = list->next; in hmp_qom_list()
176 GSList *list, *elt; in object_add_completion() local
185 list = elt = object_class_get_list(TYPE_USER_CREATABLE, false); in object_add_completion()
195 g_slist_free(list); in object_add_completion()
200 ObjectPropertyInfoList *list, *start; in object_del_completion() local
[all …]
/openbmc/openbmc/poky/meta/lib/oeqa/selftest/cases/
H A Dpkgdata.py132 self.assertIn('zlib-dev', list(files.keys()), "listed pkgs. files: %s" %result.output)
133 self.assertIn('zlib-doc', list(files.keys()), "listed pkgs. files: %s" %result.output)
139 self.assertIn('libz1', list(files.keys()), "listed pkgs. files: %s" %result.output)
140 self.assertIn('libz-dev', list(files.keys()), "listed pkgs. files: %s" %result.output)
153 self.assertIn('zlib-dbg', list(files.keys()), "listed pkgs. files: %s" %result.output)
154 self.assertIn('zlib-doc', list(files.keys()), "listed pkgs. files: %s" %result.output)
155 self.assertIn('zlib-dev', list(files.keys()), "listed pkgs. files: %s" %result.output)
156 self.assertIn('zlib-staticdev', list(files.keys()), "listed pkgs. files: %s" %result.output)
157 self.assertIn('zlib', list(files.keys()), "listed pkgs. files: %s" %result.output)
158 self.assertNotIn('zlib-locale', list(files.keys()), "listed pkgs. files: %s" %result.output)
[all …]
/openbmc/qemu/include/qemu/
H A Dnotify.h35 void notifier_list_init(NotifierList *list);
37 void notifier_list_add(NotifierList *list, Notifier *notifier);
41 void notifier_list_notify(NotifierList *list, void *data);
43 bool notifier_list_empty(NotifierList *list);
68 void notifier_with_return_list_init(NotifierWithReturnList *list);
70 void notifier_with_return_list_add(NotifierWithReturnList *list,
75 int notifier_with_return_list_notify(NotifierWithReturnList *list,
/openbmc/u-boot/lib/libfdt/
H A Dfdt_ro.c548 const char *list, *end; in fdt_stringlist_count() local
551 list = fdt_getprop(fdt, nodeoffset, property, &length); in fdt_stringlist_count()
552 if (!list) in fdt_stringlist_count()
555 end = list + length; in fdt_stringlist_count()
557 while (list < end) { in fdt_stringlist_count()
558 length = strnlen(list, end - list) + 1; in fdt_stringlist_count()
561 if (list + length > end) in fdt_stringlist_count()
564 list += length; in fdt_stringlist_count()
575 const char *list, *end; in fdt_stringlist_search() local
577 list = fdt_getprop(fdt, nodeoffset, property, &length); in fdt_stringlist_search()
[all …]
/openbmc/u-boot/fs/jffs2/
H A Dmergesort.c13 int sort_list(struct b_list *list) in sort_list() argument
18 if (!list->listHead) in sort_list()
21 for (k = 1; k < list->listCount; k *= 2) { in sort_list()
22 tail = &list->listHead; in sort_list()
23 for (p = q = list->listHead; p; p = q) { in sort_list()
34 list->listCompare(p, q))) { in sort_list()
/openbmc/u-boot/lib/
H A Dlist_sort.c111 struct list_head *list; in list_sort() local
119 list = head->next; in list_sort()
121 while (list) { in list_sort()
122 struct list_head *cur = list; in list_sort()
123 list = list->next; in list_sort()
144 list = merge(priv, cmp, part[lev], list); in list_sort()
146 merge_and_restore_back_links(priv, cmp, head, part[max_lev], list); in list_sort()
165 struct list_head list; member
207 ela = container_of(a, struct debug_el, list); in cmp()
208 elb = container_of(b, struct debug_el, list); in cmp()
[all …]
/openbmc/u-boot/scripts/dtc/libfdt/
H A Dfdt_ro.c639 const char *list, *end; in fdt_stringlist_count() local
642 list = fdt_getprop(fdt, nodeoffset, property, &length); in fdt_stringlist_count()
643 if (!list) in fdt_stringlist_count()
646 end = list + length; in fdt_stringlist_count()
648 while (list < end) { in fdt_stringlist_count()
649 length = strnlen(list, end - list) + 1; in fdt_stringlist_count()
652 if (list + length > end) in fdt_stringlist_count()
655 list += length; in fdt_stringlist_count()
666 const char *list, *end; in fdt_stringlist_search() local
668 list = fdt_getprop(fdt, nodeoffset, property, &length); in fdt_stringlist_search()
[all …]

12345678910>>...78