Home
last modified time | relevance | path

Searched full:node (Results 1 – 25 of 582) sorted by relevance

12345678910>>...24

/qemu/util/
H A Dqtree.c61 * To traverse a #QTree, calling a function for each node visited in
87 gpointer key; /* key for this node */
88 gpointer value; /* value stored at this node */
106 static QTreeNode *q_tree_node_balance(QTreeNode *node);
109 static QTreeNode *q_tree_node_search(QTreeNode *node,
112 static QTreeNode *q_tree_node_rotate_left(QTreeNode *node);
113 static QTreeNode *q_tree_node_rotate_right(QTreeNode *node);
115 static void q_tree_node_check(QTreeNode *node);
122 QTreeNode *node = g_new(QTreeNode, 1); in q_tree_node_new() local
124 node->balance = 0; in q_tree_node_new()
[all …]
H A Daio-win32.c36 QLIST_ENTRY(AioHandler) node;
39 static void aio_remove_fd_handler(AioContext *ctx, AioHandler *node) in aio_remove_fd_handler() argument
48 g_source_remove_poll(&ctx->source, &node->pfd); in aio_remove_fd_handler()
51 /* If aio_poll is in progress, just mark the node as deleted */ in aio_remove_fd_handler()
53 node->deleted = 1; in aio_remove_fd_handler()
54 node->pfd.revents = 0; in aio_remove_fd_handler()
60 QLIST_REMOVE(node, node); in aio_remove_fd_handler()
61 g_free(node); in aio_remove_fd_handler()
74 AioHandler *node = NULL; in aio_set_fd_handler() local
85 QLIST_FOREACH(old_node, &ctx->aio_handlers, node) { in aio_set_fd_handler()
[all …]
H A Dinterval-tree.c20 * 1) A node is either red or black
23 * 4) Both children of every red node are black
28 * consecutive red nodes in a path and every red node is therefore followed by
60 void (*propagate)(RBNode *node, RBNode *stop);
135 static inline void rb_link_node(RBNode *node, RBNode *parent, RBNode **rb_link) in rb_link_node() argument
137 node->rb_parent_color = (uintptr_t)parent; in rb_link_node()
138 node->rb_left = node->rb_right = NULL; in rb_link_node()
141 * Ensure that node is initialized before insertion, in rb_link_node()
144 qatomic_set_mb(rb_link, node); in rb_link_node()
147 static RBNode *rb_next(RBNode *node) in rb_next() argument
[all …]
H A Daio-posix.c40 AioHandler *node, in aio_add_ready_handler() argument
43 QLIST_SAFE_REMOVE(node, node_ready); /* remove from nested parent's list */ in aio_add_ready_handler()
44 node->pfd.revents = revents; in aio_add_ready_handler()
45 QLIST_INSERT_HEAD(ready_list, node, node_ready); in aio_add_ready_handler()
49 AioHandler *node) in aio_add_poll_ready_handler() argument
51 QLIST_SAFE_REMOVE(node, node_ready); /* remove from nested parent's list */ in aio_add_poll_ready_handler()
52 node->poll_ready = true; in aio_add_poll_ready_handler()
53 QLIST_INSERT_HEAD(ready_list, node, node_ready); in aio_add_poll_ready_handler()
58 AioHandler *node; in find_aio_handler() local
60 QLIST_FOREACH(node, &ctx->aio_handlers, node) { in find_aio_handler()
[all …]
H A Drcu.c86 QLIST_FOREACH(index, &registry, node) { in wait_for_readers()
100 QLIST_FOREACH_SAFE(index, &registry, node, tmp) { in wait_for_readers()
102 QLIST_REMOVE(index, node); in wait_for_readers()
103 QLIST_INSERT_HEAD(&qsreaders, index, node); in wait_for_readers()
131 * the node then will not be added back to &registry by QLIST_SWAP in wait_for_readers()
132 * below. The invariant is that the node is part of one list when in wait_for_readers()
141 QLIST_SWAP(&registry, &qsreaders, node); in wait_for_readers()
187 static void enqueue(struct rcu_head *node) in enqueue() argument
191 node->next = NULL; in enqueue()
194 * Make this node the tail of the list. The node will be in enqueue()
[all …]
/qemu/tests/qtest/libqos/
H A Dlibqos-malloc.c25 static void mlist_delete(MemList *list, MemBlock *node) in mlist_delete() argument
27 g_assert(list && node); in mlist_delete()
28 QTAILQ_REMOVE(list, node, MLIST_ENTNAME); in mlist_delete()
29 g_free(node); in mlist_delete()
34 MemBlock *node; in mlist_find_key() local
35 QTAILQ_FOREACH(node, head, MLIST_ENTNAME) { in mlist_find_key()
36 if (node->addr == addr) { in mlist_find_key()
37 return node; in mlist_find_key()
45 MemBlock *node; in mlist_find_space() local
47 QTAILQ_FOREACH(node, head, MLIST_ENTNAME) { in mlist_find_space()
[all …]
H A Dqgraph.c38 char *before_cmd_line; /* added before node cmd_line */
51 QOSGraphNode *node; member
57 /* Each entry in these hash table will consist of <string, node/edge> pair. */
67 * from @source to @dest node, and inserts it in the
129 * create_node(): creates a node @name of type @type
131 * By default, node is not available.
136 g_printerr("Node %s already created\n", name); in create_node()
140 QOSGraphNode *node = g_new0(QOSGraphNode, 1); in create_node() local
141 node->type = type; in create_node()
142 node->available = false; in create_node()
[all …]
H A Dqgraph_internal.h45 /* node types*/
53 /* Graph Node */
58 char *name; /* used to identify the node */
84 * qos_graph_get_node(): returns the node mapped to that @key.
93 * qos_graph_has_node(): returns #TRUE if the node
94 * has map has a node mapped to that @key.
96 bool qos_graph_has_node(const char *node);
100 * of the node @node.
105 QOSNodeType qos_graph_get_node_type(const char *node);
109 * of the node @node.
[all …]
H A Dqgraph.h57 * *after* the node command line, the
62 * *before* the node command line, usually
63 * other non-node represented commands,
68 * command line that depend on current node.
71 * devices with same node name
116 * previous node, the framework will call
119 * node to be taken and getting from them the corresponding
120 * pointer to the actual structure of the next node to
126 * @destructor: Opposite to the node constructor, destroys the object.
128 * performs a complete cleanup of each node allocated field.
[all …]
/qemu/hw/hyperv/
H A Dhv-balloon-page_range_tree.c55 GTreeNode *node; in hvb_page_range_tree_insert() local
65 node = g_tree_upper_bound(tree.t, &start); in hvb_page_range_tree_insert()
66 if (node) { in hvb_page_range_tree_insert()
67 node = g_tree_node_previous(node); in hvb_page_range_tree_insert()
69 node = g_tree_node_last(tree.t); in hvb_page_range_tree_insert()
72 if (node) { in hvb_page_range_tree_insert()
73 range = g_tree_node_value(node); in hvb_page_range_tree_insert()
79 if (!node || in hvb_page_range_tree_insert()
82 * !node case: the tree is empty or the very first node in the tree in hvb_page_range_tree_insert()
88 node = page_range_tree_insert_new(tree, start, count); in hvb_page_range_tree_insert()
[all …]
/qemu/hw/core/
H A Dnuma.c58 static int max_numa_nodeid; /* Highest specified NUMA node ID, plus one.
62 static void parse_numa_node(MachineState *ms, NumaNodeOptions *node, in parse_numa_node() argument
72 if (node->has_nodeid) { in parse_numa_node()
73 nodenr = node->nodeid; in parse_numa_node()
91 * HMAT is enabled and this node has no cpus, QEMU will raise error. in parse_numa_node()
94 if (node->has_initiator) { in parse_numa_node()
102 if (node->initiator >= MAX_NODES) { in parse_numa_node()
104 "between 0 and %d", node->initiator, in parse_numa_node()
109 numa_info[nodenr].initiator = node->initiator; in parse_numa_node()
112 for (cpus = node->cpus; cpus; cpus = cpus->next) { in parse_numa_node()
[all …]
/qemu/tests/qemu-iotests/
H A D3006 # Tests for dirty bitmaps migration with node aliases
43 self.vm_a.add_blockdev(f'node-name={self.src_node_name},'
48 self.vm_b.add_blockdev(f'node-name={self.dst_node_name},'
54 node=self.src_node_name,
63 node=self.src_node_name,
83 node=self.dst_node_name,
125 'node-name': node_name,
163 for node in mapping:
164 result += f" '{node['node-name']}' -> '{node['alias']}'\n"
166 assert isinstance(node['bitmaps'], list)
[all …]
H A D13945 def checkBlockDriverState(self, node, must_exist = True): argument
47 nodes = [x for x in result['return'] if x['node-name'] == node]
52 def addBlockDriverState(self, node): argument
53 file_node = '%s_file' % node
54 self.checkBlockDriverState(node, False)
57 'node-name': node,
59 'node-name': file_node,
62 self.checkBlockDriverState(node)
66 def addBlockDriverStateOverlay(self, node): argument
67 self.checkBlockDriverState(node, False)
[all …]
H A D142.out74 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
77 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
80 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
150 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
153 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
156 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
226 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
229 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
232 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
302 …e.filename=TEST_DIR/t.qcow2.base,node-name=image,backing.node-name=backing,backing.file.node-name=…
[all …]
H A D254.out1 {"execute": "block-dirty-bitmap-add", "arguments": {"name": "bitmap0", "node": "drive0"}}
3 {"execute": "block-dirty-bitmap-add", "arguments": {"name": "bitmap1", "node": "drive0", "persisten…
5 {"execute": "block-dirty-bitmap-add", "arguments": {"name": "bitmap2", "node": "drive0", "persisten…
15 "snapshot-node-name": "snap"
22 "node": "snap"
31 "node": "base"
34 "node": "snap",
42 "node": "snap",
52 "node": "base"
55 "node": "snap",
[all …]
H A D308.out11 'node-name': 'node-protocol',
18 'node-name': 'node-format',
19 'file': 'node-protocol'
28 'node-name': 'node-format',
38 'node-name': 'node-format',
48 'node-name': 'node-format',
63 'node-name': 'node-format',
74 'node-name': 'node-format',
94 'node-name': 'node-format',
119 'node-name': 'node-format'
[all …]
H A D25433 vm = iotests.VM().add_drive(disk, opts='node-name=base')
36 vm.qmp_log('block-dirty-bitmap-add', node='drive0', name='bitmap0')
37 vm.qmp_log('block-dirty-bitmap-add', node='drive0', name='bitmap1',
39 vm.qmp_log('block-dirty-bitmap-add', node='drive0', name='bitmap2',
47 'snapshot-node-name': 'snap'}},
51 'data': {'node': 'snap', 'name': 'bitmap0'}},
53 'data': {'node': 'snap', 'target': 'bitmap0',
54 'bitmaps': [{'node': 'base', 'name': 'bitmap0'}]}},
58 'data': {'node': 'snap', 'name': 'bitmap1', 'persistent': True}},
60 'data': {'node': 'snap', 'target': 'bitmap1',
[all …]
/qemu/tests/qtest/
H A Dnuma-test.c28 cli = make_cli(data, "-machine smp.cpus=8 -numa node,nodeid=0,memdev=ram,cpus=0-3 " in test_mon_explicit()
29 "-numa node,nodeid=1,cpus=4-7"); in test_mon_explicit()
33 g_assert(strstr(s, "node 0 cpus: 0 1 2 3")); in test_mon_explicit()
34 g_assert(strstr(s, "node 1 cpus: 4 5 6 7")); in test_mon_explicit()
46 "-numa node,memdev=ram -numa node"); in test_def_cpu_split()
50 g_assert(strstr(s, "node 0 cpus: 0 2 4 6")); in test_def_cpu_split()
51 g_assert(strstr(s, "node 1 cpus: 1 3 5 7")); in test_def_cpu_split()
63 "-numa node,nodeid=0,memdev=ram,cpus=0-1 " in test_mon_partial()
64 "-numa node,nodeid=1,cpus=4-5 "); in test_mon_partial()
68 g_assert(strstr(s, "node 0 cpus: 0 1 2 3 6 7")); in test_mon_partial()
[all …]
/qemu/hw/9pfs/
H A D9p-synth.c29 /* Root node for synth file system */
48 V9fsSynthNode *node; in v9fs_add_dir_node() local
52 node = g_new0(V9fsSynthNode, 1); in v9fs_add_dir_node()
55 node->attr = attr; in v9fs_add_dir_node()
56 node->attr->nlink++; in v9fs_add_dir_node()
58 node->attr = &node->actual_attr; in v9fs_add_dir_node()
59 node->attr->inode = inode; in v9fs_add_dir_node()
60 node->attr->nlink = 1; in v9fs_add_dir_node()
62 node->attr->mode = mode; in v9fs_add_dir_node()
63 node->attr->write = NULL; in v9fs_add_dir_node()
[all …]
/qemu/tests/qemu-iotests/tests/
H A Dinactive-node-nbd.out6 === Creating export of inactive node ===
10 {"execute": "block-export-add", "arguments": {"id": "exp0", "node-name": "disk-fmt", "type": "nbd",…
14 {"return": [{"id": "exp0", "node-name": "disk-fmt", "shutting-down": false, "type": "nbd"}]}
21 {"execute": "blockdev-set-active", "arguments": {"active": false, "node-name": "disk-fmt"}}
24 {"execute": "block-export-add", "arguments": {"allow-inactive": false, "id": "exp0", "node-name": "…
28 {"return": [{"id": "exp0", "node-name": "disk-fmt", "shutting-down": false, "type": "nbd"}]}
35 {"execute": "blockdev-set-active", "arguments": {"active": false, "node-name": "disk-fmt"}}
38 {"execute": "block-export-add", "arguments": {"allow-inactive": true, "id": "exp0", "node-name": "d…
42 {"return": [{"id": "exp0", "node-name": "disk-fmt", "shutting-down": false, "type": "nbd"}]}
48 === Inactivating node with existing export ===
[all …]
/qemu/hw/virtio/
H A Diothread-vq-mapping.c21 for (IOThreadVirtQueueMappingList *node = list; node; node = node->next) { in iothread_vq_mapping_validate() local
22 const char *name = node->value->iothread; 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()
45 for (vq = node->value->vqs; vq; vq = vq->next) { in iothread_vq_mapping_validate()
81 IOThreadVirtQueueMappingList *node; in iothread_vq_mapping_apply() local
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()
94 IOThread *iothread = iothread_by_id(node->value->iothread); in iothread_vq_mapping_apply()
100 if (node->value->vqs) { in iothread_vq_mapping_apply()
[all …]
/qemu/hw/xen/
H A Dxen-bus-helper.c51 const char *node, unsigned int owner, unsigned int domid, in xs_node_create() argument
54 trace_xs_node_create(node); in xs_node_create()
56 if (!qemu_xen_xs_create(h, tid, owner, domid, perms, node)) { in xs_node_create()
57 error_setg_errno(errp, errno, "failed to create node '%s'", node); in xs_node_create()
62 const char *node, Error **errp) in xs_node_destroy() argument
64 trace_xs_node_destroy(node); in xs_node_destroy()
66 if (!qemu_xen_xs_destroy(h, tid, node)) { in xs_node_destroy()
67 error_setg_errno(errp, errno, "failed to destroy node '%s'", node); in xs_node_destroy()
72 const char *node, const char *key, Error **errp, in xs_node_vprintf() argument
78 path = (strlen(node) != 0) ? g_strdup_printf("%s/%s", node, key) : in xs_node_vprintf()
[all …]
/qemu/hw/i2c/
H A Dcore.c125 I2CNode *node; in i2c_do_start_transfer() local
154 QLIST_FOREACH(node, &bus->current_devs, next) { in i2c_do_start_transfer()
155 I2CSlave *s = node->elt; in i2c_do_start_transfer()
187 I2CPendingMaster *node = g_new(struct I2CPendingMaster, 1); in i2c_bus_master() local
188 node->bh = bh; in i2c_bus_master()
190 QSIMPLEQ_INSERT_TAIL(&bus->pending_masters, node, entry); in i2c_bus_master()
195 I2CPendingMaster *node; in i2c_schedule_pending_master() local
206 node = QSIMPLEQ_FIRST(&bus->pending_masters); in i2c_schedule_pending_master()
207 bus->bh = node->bh; in i2c_schedule_pending_master()
210 g_free(node); in i2c_schedule_pending_master()
[all …]
/qemu/include/hw/xen/
H A Dxen-bus-helper.h16 const char *node, unsigned int owner, unsigned int domid,
19 const char *node, Error **errp);
21 /* Write to node/key unless node is empty, in which case write to key */
23 const char *node, const char *key, Error **errp,
27 const char *node, const char *key, Error **errp,
31 /* Read from node/key unless node is empty, in which case read from key */
33 const char *node, const char *key, Error **errp,
37 const char *node, const char *key, Error **errp,
43 * the XenStore path, not the contents of the node.
50 /* Watch node/key unless node is empty, in which case watch key */
[all …]
/qemu/block/monitor/
H A Dbitmap-qmp-cmds.c44 * the node reference and bitmap names.
46 * @node: The name of the BDS node to search for bitmaps
53 BdrvDirtyBitmap *block_dirty_bitmap_lookup(const char *node, in block_dirty_bitmap_lookup() argument
63 if (!node) { in block_dirty_bitmap_lookup()
64 error_setg(errp, "Node cannot be NULL"); in block_dirty_bitmap_lookup()
71 bs = bdrv_lookup_bs(node, node, NULL); in block_dirty_bitmap_lookup()
73 error_setg(errp, "Node '%s' not found", node); in block_dirty_bitmap_lookup()
90 void qmp_block_dirty_bitmap_add(const char *node, const char *name, in qmp_block_dirty_bitmap_add() argument
104 bs = bdrv_lookup_bs(node, node, errp); in qmp_block_dirty_bitmap_add()
146 BdrvDirtyBitmap *block_dirty_bitmap_remove(const char *node, const char *name, in block_dirty_bitmap_remove() argument
[all …]

12345678910>>...24