Home
last modified time | relevance | path

Searched refs:node (Results 1 – 25 of 1138) sorted by relevance

12345678910>>...46

/openbmc/openbmc/poky/bitbake/lib/
H A Dcodegen.py58 def to_source(node, indent_with=' ' * 4, add_line_information=False): argument
77 generator.visit(node)
102 def newline(self, node=None, extra=0): argument
104 if node is not None and self.add_line_information:
105 self.write('# line: %s' % node.lineno)
115 def body_or_else(self, node): argument
116 self.body(node.body)
117 if node.orelse:
120 self.body(node.orelse)
122 def signature(self, node): argument
[all …]
/openbmc/qemu/util/
H A Dqtree.c106 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()
125 node->left = NULL; in q_tree_node_new()
126 node->right = NULL; in q_tree_node_new()
127 node->left_child = FALSE; 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()
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()
96 node = g_new0(AioHandler, 1); in aio_set_fd_handler()
[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 Dinterval-tree.c60 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()
144 qatomic_set_mb(rb_link, node); in rb_link_node()
147 static RBNode *rb_next(RBNode *node) in rb_next() argument
156 if (node->rb_right) { in rb_next()
157 node = node->rb_right; in rb_next()
158 while (node->rb_left) { in rb_next()
159 node = node->rb_left; in rb_next()
[all …]
/openbmc/u-boot/include/dm/
H A Dofnode.h56 ofnode node; member
69 static inline const struct device_node *ofnode_to_np(ofnode node) in ofnode_to_np() argument
75 return node.np; in ofnode_to_np()
86 static inline int ofnode_to_offset(ofnode node) in ofnode_to_offset() argument
92 return node.of_offset; in ofnode_to_offset()
100 static inline bool ofnode_valid(ofnode node) in ofnode_valid() argument
103 return node.np != NULL; in ofnode_valid()
105 return node.of_offset != -1; in ofnode_valid()
116 ofnode node; in offset_to_ofnode() local
119 node.np = NULL; in offset_to_ofnode()
[all …]
/openbmc/u-boot/drivers/core/
H A Dofnode.c18 int ofnode_read_u32(ofnode node, const char *propname, u32 *outp) in ofnode_read_u32() argument
20 assert(ofnode_valid(node)); in ofnode_read_u32()
23 if (ofnode_is_np(node)) { in ofnode_read_u32()
24 return of_read_u32(ofnode_to_np(node), propname, outp); in ofnode_read_u32()
29 cell = fdt_getprop(gd->fdt_blob, ofnode_to_offset(node), in ofnode_read_u32()
42 int ofnode_read_u32_default(ofnode node, const char *propname, u32 def) in ofnode_read_u32_default() argument
44 assert(ofnode_valid(node)); in ofnode_read_u32_default()
45 ofnode_read_u32(node, propname, &def); in ofnode_read_u32_default()
50 int ofnode_read_s32_default(ofnode node, const char *propname, s32 def) in ofnode_read_s32_default() argument
52 assert(ofnode_valid(node)); in ofnode_read_s32_default()
[all …]
/openbmc/u-boot/arch/x86/cpu/baytrail/
H A Dfsp_configs.c36 int node; in update_fsp_configs() local
43 node = fdtdec_next_compatible(blob, 0, COMPAT_INTEL_BAYTRAIL_FSP); in update_fsp_configs()
44 if (node < 0) { in update_fsp_configs()
49 fsp_upd->mrc_init_tseg_size = fdtdec_get_int(blob, node, in update_fsp_configs()
52 fsp_upd->mrc_init_mmio_size = fdtdec_get_int(blob, node, in update_fsp_configs()
55 fsp_upd->mrc_init_spd_addr1 = fdtdec_get_int(blob, node, in update_fsp_configs()
58 fsp_upd->mrc_init_spd_addr2 = fdtdec_get_int(blob, node, in update_fsp_configs()
61 fsp_upd->emmc_boot_mode = fdtdec_get_int(blob, node, in update_fsp_configs()
64 fsp_upd->enable_sdio = fdtdec_get_bool(blob, node, "fsp,enable-sdio"); in update_fsp_configs()
65 fsp_upd->enable_sdcard = fdtdec_get_bool(blob, node, in update_fsp_configs()
[all …]
/openbmc/u-boot/drivers/block/
H A Dblkcache.c35 struct block_cache_node *node; in cache_find() local
37 list_for_each_entry(node, &block_cache, lh) in cache_find()
38 if ((node->iftype == iftype) && in cache_find()
39 (node->devnum == devnum) && in cache_find()
40 (node->blksz == blksz) && in cache_find()
41 (node->start <= start) && in cache_find()
42 (node->start + node->blkcnt >= start + blkcnt)) { in cache_find()
43 if (block_cache.next != &node->lh) { in cache_find()
45 list_del(&node->lh); in cache_find()
46 list_add(&node->lh, &block_cache); in cache_find()
[all …]
/openbmc/u-boot/scripts/dtc/
H A Dlivetree.c100 struct node *build_node(struct property *proplist, struct node *children) in build_node()
102 struct node *new = xmalloc(sizeof(*new)); in build_node()
103 struct node *child; in build_node()
117 struct node *build_node_delete(void) in build_node_delete()
119 struct node *new = xmalloc(sizeof(*new)); in build_node_delete()
128 struct node *name_node(struct node *node, char *name) in name_node() argument
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
134 return node; in name_node()
137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
[all …]
H A Dchecks.c43 typedef void (*check_fn)(struct check *c, struct dt_info *dti, struct node *node);
76 struct node *node, in check_msg() argument
88 if (node) { in check_msg()
89 fprintf(stderr, "%s", node->fullpath); in check_msg()
100 #define FAIL(c, dti, node, ...) \ argument
104 check_msg((c), dti, node, NULL, __VA_ARGS__); \
107 #define FAIL_PROP(c, dti, node, prop, ...) \ argument
111 check_msg((c), dti, node, prop, __VA_ARGS__); \
115 static void check_nodes_props(struct check *c, struct dt_info *dti, struct node *node) in check_nodes_props() argument
117 struct node *child; in check_nodes_props()
[all …]
H A Ddtc.h154 struct node { struct
158 struct node *children; argument
160 struct node *parent; argument
161 struct node *next_sibling; argument
202 struct node *build_node(struct property *proplist, struct node *children);
203 struct node *build_node_delete(void);
204 struct node *name_node(struct node *node, char *name);
205 struct node *chain_node(struct node *first, struct node *list);
206 struct node *merge_nodes(struct node *old_node, struct node *new_node);
207 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
[all …]
/openbmc/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.c51 QOSGraphNode *node; member
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()
143 node->name = g_strdup(name); in create_node()
144 g_hash_table_insert(node_table, node->name, node); in create_node()
145 return node; in create_node()
155 QOSGraphNode *node = val; in destroy_node() local
156 g_free(node->qemu_name); in destroy_node()
157 g_free(node->command_line); in destroy_node()
[all …]
/openbmc/u-boot/arch/x86/cpu/braswell/
H A Dfsp_configs.c50 int node; in update_fsp_configs() local
57 node = fdt_node_offset_by_compatible(blob, 0, "intel,braswell-fsp"); in update_fsp_configs()
58 if (node < 0) { in update_fsp_configs()
63 node = fdt_node_offset_by_compatible(blob, node, in update_fsp_configs()
65 if (node < 0) { in update_fsp_configs()
71 memory_upd->mrc_init_tseg_size = fdtdec_get_int(blob, node, in update_fsp_configs()
73 memory_upd->mrc_init_mmio_size = fdtdec_get_int(blob, node, in update_fsp_configs()
75 memory_upd->mrc_init_spd_addr1 = fdtdec_get_int(blob, node, in update_fsp_configs()
77 memory_upd->mrc_init_spd_addr2 = fdtdec_get_int(blob, node, in update_fsp_configs()
79 memory_upd->igd_dvmt50_pre_alloc = fdtdec_get_int(blob, node, in update_fsp_configs()
[all …]
/openbmc/libbej/src/
H A Dbej_encoder_metadata.c104 struct RedfishPropertyNode* node, uint16_t nodeIndex, in bejFindSeqNumAndChildDictOffset() argument
110 if (node->name == NULL || node->name[0] == '\0') in bejFindSeqNumAndChildDictOffset()
134 bejGetRelatedDictionary(dictionaries, parentDictionary, node->name); in bejFindSeqNumAndChildDictOffset()
149 node->name); in bejFindSeqNumAndChildDictOffset()
157 node->name, &property, NULL); in bejFindSeqNumAndChildDictOffset()
163 node->name, dictStartingOffset, ret); in bejFindSeqNumAndChildDictOffset()
187 struct RedfishPropertyLeafInt* node, in bejUpdateIntMetaData() argument
192 dictionaries, parentDictionary, &node->leaf.nodeAttr, nodeIndex, in bejUpdateIntMetaData()
194 node->leaf.metaData.sequenceNumber = sequenceNumber; in bejUpdateIntMetaData()
198 node->leaf.metaData.sflSize = bejNnintEncodingSizeOfUInt(sequenceNumber); in bejUpdateIntMetaData()
[all …]
H A Dbej_tree.c3 static void bejTreeInitParent(struct RedfishPropertyParent* node, in bejTreeInitParent() argument
6 node->nodeAttr.name = name; in bejTreeInitParent()
7 node->nodeAttr.format.principalDataType = type; in bejTreeInitParent()
8 node->nodeAttr.format.deferredBinding = 0; in bejTreeInitParent()
9 node->nodeAttr.format.readOnlyProperty = 0; in bejTreeInitParent()
10 node->nodeAttr.format.nullableProperty = 0; in bejTreeInitParent()
11 node->nodeAttr.format.reserved = 0; in bejTreeInitParent()
12 node->nodeAttr.sibling = NULL; in bejTreeInitParent()
13 node->nChildren = 0; in bejTreeInitParent()
14 node->firstChild = NULL; in bejTreeInitParent()
[all …]
H A Dbej_encoder_core.c36 static int bejEncodeBejSetOrArray(struct RedfishPropertyParent* node, in bejEncodeBejSetOrArray() argument
40 RETURN_IF_IERROR(bejEncodeNnint(node->metaData.sequenceNumber, output)); in bejEncodeBejSetOrArray()
42 RETURN_IF_IERROR(bejEncodeFormat(&node->nodeAttr.format, output)); in bejEncodeBejSetOrArray()
44 RETURN_IF_IERROR(bejEncodeNnint(node->metaData.vSize, output)); in bejEncodeBejSetOrArray()
46 return bejEncodeNnint(node->nChildren, output); in bejEncodeBejSetOrArray()
62 int bejEncodeBejInteger(struct RedfishPropertyLeafInt* node, in bejEncodeBejInteger() argument
67 bejEncodeNnint(node->leaf.metaData.sequenceNumber, output)); in bejEncodeBejInteger()
69 RETURN_IF_IERROR(bejEncodeFormat(&node->leaf.nodeAttr.format, output)); in bejEncodeBejInteger()
71 RETURN_IF_IERROR(bejEncodeNnint(node->leaf.metaData.vSize, output)); in bejEncodeBejInteger()
73 return bejEncodeInteger(node->value, output); in bejEncodeBejInteger()
[all …]
/openbmc/u-boot/lib/
H A Drbtree.c63 __rb_insert(struct rb_node *node, struct rb_root *root, in __rb_insert() argument
66 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; in __rb_insert()
77 rb_set_parent_color(node, NULL, RB_BLACK); in __rb_insert()
102 node = gparent; in __rb_insert()
103 parent = rb_parent(node); in __rb_insert()
104 rb_set_parent_color(node, parent, RB_RED); in __rb_insert()
109 if (node == tmp) { in __rb_insert()
122 parent->rb_right = tmp = node->rb_left; in __rb_insert()
123 node->rb_left = parent; in __rb_insert()
127 rb_set_parent_color(parent, node, RB_RED); in __rb_insert()
[all …]
/openbmc/openbmc/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js43 var ancestors, node;
44 node = this;
46 while (node = node.parentNode()) {
47 ancestors.push(node);
170 Node.prototype.setParent = function(node) {
174 this.parentId = node.id;
175 this.row.data(this.settings.parentIdAttr, node.id);
176 return node.addChild(this);
254 var node, _i, _len, _ref, _results;
258 node = _ref[_i];
[all …]
/openbmc/u-boot/fs/jffs2/
H A Djffs2_private.h18 int (*listCompare)(struct b_node *new, struct b_node *node);
42 hdr_crc(struct jffs2_unknown_node *node) in hdr_crc() argument
45 u32 crc = crc32_no_comp(0, (unsigned char *)node, sizeof(struct jffs2_unknown_node) - 4); in hdr_crc()
48 u32 crc = crc32_no_comp(~0, (unsigned char *)node, sizeof(struct jffs2_unknown_node) - 4); in hdr_crc()
52 if (node->hdr_crc != crc) { in hdr_crc()
60 dirent_crc(struct jffs2_raw_dirent *node) in dirent_crc() argument
62 …if (node->node_crc != crc32_no_comp(0, (unsigned char *)node, sizeof(struct jffs2_raw_dirent) - 8)… in dirent_crc()
70 dirent_name_crc(struct jffs2_raw_dirent *node) in dirent_name_crc() argument
72 if (node->name_crc != crc32_no_comp(0, (unsigned char *)&(node->name), node->nsize)) { in dirent_name_crc()
80 inode_crc(struct jffs2_raw_inode *node) in inode_crc() argument
[all …]
/openbmc/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()
88 node = page_range_tree_insert_new(tree, start, count); in hvb_page_range_tree_insert()
89 assert(node); in hvb_page_range_tree_insert()
[all …]
/openbmc/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 …]
/openbmc/qemu/hw/core/
H A Dnuma.c62 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()
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()
131 have_memdevs = have_memdevs || node->memdev; in parse_numa_node()
132 have_mem = have_mem || node->has_mem; in parse_numa_node()
[all …]
/openbmc/qemu/hw/9pfs/
H A D9p-synth.c48 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()
64 node->attr->read = NULL; in v9fs_add_dir_node()
[all …]

12345678910>>...46