Home
last modified time | relevance | path

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

12345678910>>...72

/openbmc/openbmc/poky/bitbake/lib/
H A Dcodegen.py58 def to_source(node, indent_with=' ' * 4, add_line_information=False): argument
59 """This function can convert a node tree back into python sourcecode.
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)
[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 …]
/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/include/dm/
H A Dofnode.h20 * ofnode - reference to a device tree node
34 * There is no ambiguity as to whether ofnode holds an offset or a node
35 * pointer: when the live tree is active it holds a node pointer, otherwise it
37 * the same value could point to a valid device node or a valid offset. We
46 * @np: Pointer to device node, used for live tree
48 * is not a really a pointer to a node: it is an offset value. See above.
56 ofnode node; member
62 * _ofnode_to_np() - convert an ofnode to a live DT node pointer
66 * @node: Reference containing struct device_node * (possibly invalid)
67 * @return pointer to device node (can be NULL)
[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/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()
45 debug("%s: Cannot find FSP node\n", __func__); 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()
[all …]
/openbmc/qemu/util/
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 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 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 …]
/openbmc/openbmc/meta-ibm/recipes-phosphor/logging/phosphor-logging/p10bmc/
H A Dcom.ibm.Hardware.Chassis.Model.Rainier2U_dev_callouts.json7 "MRU":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0/BMC-0",
8 "Name":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0",
13 "MRU":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0/power10",
14 "Name":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0",
19 "Name":"/sys-0/node-0/nisqually-0",
23 "Dest":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0/power10-0",
24 "Source":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0/bmc-0"
30 "MRU":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0/power10",
31 "Name":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0",
36 "MRU":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0/BMC-0",
[all …]
H A Dcom.ibm.Hardware.Chassis.Model.Bonnell_dev_callouts.json7 "Name":"/sys-0/node-0/pennybacker-0/proc_socket-0/godel-0/power10-0",
12 "Name":"/sys-0/node-0/pennybacker-0/bmc-0",
16 "Dest":"/sys-0/node-0/pennybacker-0/proc_socket-0/godel-0/power10-0",
17 "Source":"/sys-0/node-0/pennybacker-0/bmc-0"
23 "Name":"/sys-0/node-0/pennybacker-0/proc_socket-0/godel-0/power10-0",
28 "Name":"/sys-0/node-0/pennybacker-0",
32 "Dest":"/sys-0/node-0/pennybacker-0/proc_socket-0/godel-0/power10-1",
33 "Source":"/sys-0/node-0/pennybacker-0/bmc-0"
43 "Name":"/sys-0/node-0/pennybacker-0/proc_socket-0/godel-0",
48 "Name":"/sys-0/node-0/pennybacker-0",
[all …]
H A Dcom.ibm.Hardware.Chassis.Model.Everest_dev_callouts.json7 "MRU":"/sys-0/node-0/bellavista-0/eBMC-card-conn-0/Tola-0/bmc-0",
8 "Name":"/sys-0/node-0/bellavista-0/eBMC-card-conn-0/Tola-0",
13 "MRU":"/sys-0/node-0/bellavista-0/proc_socket-0/godel-0/power10",
14 "Name":"/sys-0/node-0/bellavista-0/proc_socket-0/godel-0",
19 "Name":"/sys-0/node-0/bellavista-0",
23 "Dest":"/sys-0/node-0/bellavista-0/proc_socket-0/godel-0/power10-0",
24 "Source":"/sys-0/node-0/bellavista-0/eBMC-card-conn-0/Tola-0/bmc-0"
30 "MRU":"/sys-0/node-0/bellavista-0/proc_socket-0/godel-0/power10",
31 "Name":"/sys-0/node-0/bellavista-0/proc_socket-0/godel-0",
36 "MRU":"/sys-0/node-0/bellavista-0/eBMC-card-conn-0/Tola-0/bmc-0",
[all …]
H A Dcom.ibm.Hardware.Chassis.Model.Rainier4U_dev_callouts.json7 "MRU":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0/BMC-0",
8 "Name":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0",
13 "MRU":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0/power10",
14 "Name":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0",
19 "Name":"/sys-0/node-0/nisqually-0",
23 "Dest":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0/power10-0",
24 "Source":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0/bmc-0"
30 "MRU":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0/power10",
31 "Name":"/sys-0/node-0/nisqually-0/proc_socket-0/godel-0",
36 "MRU":"/sys-0/node-0/nisqually-0/ebmc-card-connector-0/ingraham-0/BMC-0",
[all …]
/openbmc/openbmc/poky/bitbake/lib/toaster/toastergui/static/js/
H A Djquery.treetable.js9 var $, Node, Tree, methods; variable
13 Node = (function() {
14 function Node(row, tree, settings) { class in Node
38 Node.prototype.addChild = function(child) { class
42 Node.prototype.ancestors = function() {
43 var ancestors, node;
44 node = this;
46 while (node = node.parentNode()) {
47 ancestors.push(node);
52 Node.prototype.collapse = function() {
[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 …]
/openbmc/libbej/src/
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 …]
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_metadata.c53 * @brief Get the dictionary for the provided node.
56 * @param[in] parentDictionary - dictionary used for the parent of this node.
57 * @param[in] nodeName - name of the interested node. Can be NULL if the node
65 // If the node name is NULL, we have to use parent dictionary. in bejGetRelatedDictionary()
72 // annotation. Therefore the child (this node) should be an annotation too in bejGetRelatedDictionary()
74 // for this node as well. in bejGetRelatedDictionary()
84 * @brief Get dictionary data for the given node.
87 * @param[in] parentDictionary - the dictionary used by the provided node's
89 * @param[in] node - node that caller is interested in.
90 * @param[in] nodeIndex - index of this node within its parent.
[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()
59 debug("%s: Cannot find FSP node\n", __func__); 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()
66 debug("%s: Cannot find FSP memory node\n", __func__); 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()
[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()
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 …]
/openbmc/libbej/include/libbej/
H A Dbej_tree.h33 // Points to the next node which is need to process.
101 * @brief bejNull type property node.
109 * @brief bejInteger type property node.
118 * @brief bejEnum type property node.
130 * @brief bejString type property node.
139 * @brief bejReal type property node.
150 * @brief bejBoolean type property node.
159 * @brief Initialize a bejSet type node.
161 * @param[in] node - pointer to a RedfishPropertyParent struct.
162 * @param[in] name - name of the node.
[all …]
/openbmc/openbmc-test-automation/lib/xcat/
H A Dxcat_utils.robot27 ... ${node}=${OPENBMC_HOST}
32 # node Name of the node(e.g. "node1").
35 ... ${XCAT_DIR_PATH}/${command} ${node} ${command_option}
60 [Arguments] ${node} ${username}=${OPENBMC_USERNAME}
64 # node Name of the node to be added.
68 ${cmd_buf}= Catenate ${XCAT_DIR_PATH}/mkdef ${node} bmc=${node}
73 Validate Added Node
74 [Documentation] Validate added node.
75 [Arguments] ${node}
78 # node Name of the node.
[all …]
/openbmc/u-boot/lib/
H A Drbtree.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
63 __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()
70 * Loop invariant: node is red 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()
[all …]

12345678910>>...72