Searched refs:children (Results 1 – 13 of 13) sorted by relevance
| /xen/tools/ocaml/xenstored/ |
| A D | trie.ml | 21 children: ('a,'b) t list; RecordField
27 children = [];
33 children = []
46 let set_children node children =
47 { node with children = children }
50 { node with children = child :: node.children }
82 iter f node.Node.children
93 { node with Node.value = value; Node.children = map f node.Node.children }
148 let children = set node.Node.children path value in
149 Node.set_children node children
[all …]
|
| A D | store.ml | 25 children: t list; RecordField
32 let get_children node = node.children
45 { node with children = child :: node.children }
49 List.exists (fun n -> n.name = childname) node.children
53 List.find (fun n -> n.name = childname) node.children
63 { node with children = (replace_one_in_list node.children) }
73 { node with children = (delete_one_in_list node.children) }
76 { node with children = [] }
95 f { node with children = List.rev_map walk node.children |> List.rev }
329 let children =
[all …]
|
| /xen/tools/xl/ |
| A D | xl.c | 66 xlchild children[child_max]; variable
253 xlchild *ch = &children[child]; in xl_fork()
269 children[i].pid = 0; in xl_fork()
277 xlchild *ch = &children[child]; in xl_waitpid()
298 xlchild *ch = &children[child]; in xl_child_pid()
305 libxl_report_child_exitstatus(ctx, level, children[child].description, in xl_report_child_exitstatus()
314 xlchild *ch = &children[i]; in xl_reaped_callback()
444 children[child].description, strerror(errno)); in child_report()
|
| A D | xl.h | 247 extern xlchild children[child_max];
|
| /xen/tools/xenstore/ |
| A D | xenstored_core.c | 864 child = node->children + off; in send_directory_part()
945 if (!children) in construct_node()
947 memcpy(children, parent->children, parent->childlen); in construct_node()
949 parent->children = children; in construct_node()
970 node->children = node->data = NULL; in construct_node()
1144 node->children); in delete_node()
1604 node->children = (char *)child; in manual_node()
1719 struct hashtable * children = in check_store_() local
1723 hashtable_destroy(children, 0); in check_store_()
1732 node->children + i); in check_store_()
[all …]
|
| A D | xenstored_core.h | 139 char *children; member
|
| A D | talloc_guide.txt | 89 children. You can call talloc_free() on any pointer returned by
105 talloc_free() operates recursively on its children.
111 The talloc_free_children() walks along the list of all children of a
112 talloc context and talloc_free()s only the children, not the context
|
| /xen/tools/libxl/ |
| A D | libxl_fork.c | 424 return creating || !LIBXL_LIST_EMPTY(&ctx->children); in chldmode_ours()
465 LIBXL_LIST_FOREACH(ch, &CTX->children, entry) in childproc_reaped()
500 LIBXL_LIST_FOREACH(ch, &CTX->children, entry) { in childproc_checkall()
628 LIBXL_LIST_INSERT_HEAD(&CTX->children, ch, entry); in libxl__ev_child_fork()
643 assert(LIBXL_LIST_EMPTY(&CTX->children)); in libxl_childproc_setmode()
701 LIBXL_LIST_INSERT_HEAD(&CTX->children, &new_ch->ch, entry); in libxl__ev_child_kill_deregister()
|
| A D | libxl_internal.h | 727 LIBXL_LIST_HEAD(, libxl__ev_child) children;
|
| /xen/docs/misc/ |
| A D | xenstore.txt | 33 or more immediate children. There is thus no particular distinction
35 to store nonempty values at nodes which also have children.
146 it and all of its children. It is not an error if <path> does
151 Gives a list of the immediate children of <path>, as only the
152 leafnames. The resulting children are each named
156 Same as DIRECTORY, but to be used for children lists longer than
158 the list of children to return. Return values are the generation
161 reads guarantees the node hasn't changed) and the list of children
|
| /xen/docs/man/ |
| A D | xenstore-chmod.1.pod | 47 Apply the permissions to the key and all its I<children>.
|
| /xen/xen/tools/kconfig/ |
| A D | qconf.h | 90 return (ConfigItem *)children().first(); in firstChild()
|
| /xen/tools/firmware/vgabios/ |
| A D | vgabios.c | 462 ;; Just for the first int10 find its children
|
Completed in 36 milliseconds