Home
last modified time | relevance | path

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

12

/utopia/UTPA2-700.0.x/projects/build/scripts/dtc/
H A Dchecks.c49 typedef void (*tree_check_fn)(struct check *c, struct node *dt);
50 typedef void (*node_check_fn)(struct check *c, struct node *dt, struct node *node);
51 typedef void (*prop_check_fn)(struct check *c, struct node *dt,
52 struct node *node, struct property *prop);
114 static void check_nodes_props(struct check *c, struct node *dt, struct node *node) in check_nodes_props() argument
116 struct node *child; in check_nodes_props()
119 TRACE(c, "%s", node->fullpath); in check_nodes_props()
121 c->node_fn(c, dt, node); in check_nodes_props()
124 for_each_property(node, prop) { in check_nodes_props()
125 TRACE(c, "%s\t'%s'", node->fullpath, prop->name); in check_nodes_props()
[all …]
H A Dlivetree.c77 struct node *build_node(struct property *proplist, struct node *children) in build_node()
79 struct node *new = xmalloc(sizeof(*new)); in build_node()
80 struct node *child; in build_node()
94 struct node *name_node(struct node *node, char *name) in name_node() argument
96 assert(node->name == NULL); in name_node()
98 node->name = name; in name_node()
100 return node; in name_node()
103 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes()
106 struct node *new_child, *old_child; in merge_nodes()
170 struct node *chain_node(struct node *first, struct node *list) in chain_node()
[all …]
H A Ddtc.h142 struct node { struct
145 struct node *children; argument
147 struct node *parent; argument
148 struct node *next_sibling; argument
174 struct node *build_node(struct property *proplist, struct node *children); argument
175 struct node *name_node(struct node *node, char *name);
176 struct node *chain_node(struct node *first, struct node *list);
177 struct node *merge_nodes(struct node *old_node, struct node *new_node);
179 void add_property(struct node *node, struct property *prop);
180 void add_child(struct node *parent, struct node *child);
[all …]
H A Dflattree.c258 static void flatten_tree(struct node *tree, struct emitter *emit, in flatten_tree()
263 struct node *child; in flatten_tree()
742 static struct node *unflatten_tree(struct inbuf *dtbuf, in unflatten_tree()
746 struct node *node; in unflatten_tree() local
750 node = build_node(NULL, NULL); in unflatten_tree()
755 node->name = nodename_from_path(parent_flatname, flatname); in unflatten_tree()
757 node->name = flatname; in unflatten_tree()
761 struct node *child; in unflatten_tree()
766 if (node->children) in unflatten_tree()
770 add_property(node, prop); in unflatten_tree()
[all …]
H A Ddtc-parser.y51 struct node *node; member
52 struct node *nodelist;
78 %type <node> devicetree
79 %type <node> nodedef
80 %type <node> subnode
134 struct node *target = get_node_by_ref($1, $2);
H A Ddtc-parser.tab.c_shipped151 struct node *node;
152 struct node *nodelist;
1411 the_boot_info = build_boot_info((yyvsp[(3) - (4)].re), (yyvsp[(4) - (4)].node),
1412 guess_boot_cpuid((yyvsp[(4) - (4)].node)));
1467 (yyval.node) = name_node((yyvsp[(2) - (2)].node), "");
1476 (yyval.node) = merge_nodes((yyvsp[(1) - (3)].node), (yyvsp[(3) - (3)].node));
1485 struct node *target = get_node_by_ref((yyvsp[(1) - (3)].node), (yyvsp[(2) - (3)].labelref));
1488 merge_nodes(target, (yyvsp[(3) - (3)].node));
1491 (yyval.node) = (yyvsp[(1) - (3)].node);
1500 (yyval.node) = build_node((yyvsp[(2) - (5)].proplist), (yyvsp[(3) - (5)].nodelist));
[all …]
H A Dfstree.c26 static struct node *read_fstree(const char *dirname) in read_fstree()
31 struct node *tree; in read_fstree()
68 struct node *newchild; in read_fstree()
84 struct node *tree; in dt_from_fs()
H A Ddtc-parser.tab.h_shipped75 struct node *node;
76 struct node *nodelist;
H A Ddtc.c35 static void fill_fullpaths(struct node *tree, const char *prefix) in fill_fullpaths()
37 struct node *child; in fill_fullpaths()
H A Dtreesource.c234 static void write_tree_source_node(FILE *f, struct node *tree, int level) in write_tree_source_node()
237 struct node *child; in write_tree_source_node()
/utopia/UTPA2-700.0.x/projects/build/scripts/genksyms/
H A Dgenksyms.c335 void free_node(struct string_list *node) in free_node() argument
337 free(node->string); in free_node()
338 free(node); in free_node()
379 struct string_list *copy_node(struct string_list *node) in copy_node() argument
384 newnode->string = xstrdup(node->string); in copy_node()
385 newnode->tag = node->tag; in copy_node()
423 struct string_list node = { in read_node() local
430 if (node.string == buffer) in read_node()
434 if (node.string == buffer) in read_node()
439 if (node.string >= buffer + sizeof(buffer) - 1) { in read_node()
[all …]
H A Dparse.y41 struct string_list *node = *p; in remove_node() local
42 *p = node->next; in remove_node()
43 free_node(node); in remove_node()
H A Dparse.c_shipped89 struct string_list *node = *p;
90 *p = node->next;
91 free_node(node);
/utopia/UTPA2-700.0.x/projects/build/scripts/kconfig/lxdialog/
H A Dutil.c563 vsnprintf(item_cur->node.str, sizeof(item_cur->node.str), fmt, ap); in item_make()
572 avail = sizeof(item_cur->node.str) - strlen(item_cur->node.str); in item_add_str()
575 vsnprintf(item_cur->node.str + strlen(item_cur->node.str), in item_add_str()
577 item_cur->node.str[sizeof(item_cur->node.str) - 1] = '\0'; in item_add_str()
583 item_cur->node.tag = tag; in item_set_tag()
587 item_cur->node.data = ptr; in item_set_data()
592 item_cur->node.selected = val; in item_set_selected()
605 return item_cur->node.data; in item_data()
610 return item_cur->node.tag; in item_tag()
646 return item_cur->node.str; in item_str()
[all …]
H A Ddialog.h174 struct dialog_item node; member
/utopia/UTPA2-700.0.x/modules/hsl/api/hsl/
H A Dfrhsl_ringbuffer.c240 void listRemoveNode(stHslController *_hsl, stListNode *node) in listRemoveNode() argument
247 if(node == _hsl->pendingWriteHead) in listRemoveNode()
249 _hsl->pendingWriteHead = node->next; in listRemoveNode()
252 if(node->prev) in listRemoveNode()
254 node->prev->next = node->next; in listRemoveNode()
256 if(node->next) in listRemoveNode()
258 node->next->prev = node->prev; in listRemoveNode()
260 node->u32bufferIndex = 0; in listRemoveNode()
261 node->u32timestamp = 0; in listRemoveNode()
262 node->prev = 0; in listRemoveNode()
[all …]
/utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/usbhost/
H A DdrvCore.c91 INIT_LIST_HEAD(&dev->node); in device_initialize()
111 list_add_tail(&dev->node,&parent->children); in device_add()
125 list_del_init(&dev->node); in device_del()
/utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/newhost/
H A DdrvCore.c96 ms_list_init(&ms_gdev->node); in ms_device_initialize()
123 ms_insert_list_before(&ms_gdev->node,&parent->children); in ms_device_add()
143 ms_list_remove_and_init(&ms_gdev->node); in ms_device_del()
/utopia/UTPA2-700.0.x/projects/tools/lint/mips-linux-gnu_include/linux/
H A Dtipc.h48 __u32 node; member
64 unsigned int node) in tipc_addr() argument
66 return (zone << 24) | (cluster << 12) | node; in tipc_addr()
/utopia/UTPA2-700.0.x/projects/build/scripts/kconfig/
H A Dgconf.c76 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row);
1219 static void set_node(GtkTreeIter * node, struct menu *menu, gchar ** row) in set_node() argument
1232 gtk_tree_store_set(tree, node, in set_node()
1258 GtkTreeIter *node = parents[indent]; in place_node() local
1260 gtk_tree_store_append(tree, node, parent); in place_node()
1261 set_node(node, menu, row); in place_node()
/utopia/UTPA2-700.0.x/projects/tools/lint/aeon_include/
H A Dsearch.h33 typedef struct node { struct
35 struct node *llink, *rlink; argument
/utopia/UTPA2-700.0.x/modules/msos/msos/linux/
H A DMsOSmm.c732 list_t *node; in MSOS_MMPool_MapVA() local
841 list_t *node; in MSOS_MMPool_UnmapVA() local
1047 list_t *node; in MSOS_MMPool_MapVA() local
1150 list_t *node; in MSOS_MMPool_UnmapVA() local
/utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/newhost/include/
H A DdrvDevice.h107 struct list_head node; // node in device's parent's children list member
/utopia/UTPA2-700.0.x/modules/usb/drv/usb_ecos/usbhost/include/
H A DdrvDevice.h115 struct list_head node; // node in device's parent's children list member
/utopia/UTPA2-700.0.x/projects/build/Ksym/
H A D.Ksym.o.cmd640 $(wildcard include/config/have/memblock/node/map.h) \
642 $(wildcard include/config/flat/node/mem/map.h) \
647 $(wildcard include/config/need/node/memmap/size.h) \
659 $(wildcard include/config/movable/node.h) \
694 $(wildcard include/config/have/bootmem/info/node.h) \
715 $(wildcard include/config/use/percpu/numa/node/id.h) \

12