Searched refs:root (Results 76 - 100 of 139) sorted by relevance

123456

/barrelfish-2018-10-04/include/arch/aarch64/barrelfish/
H A Dinvocations_arch.h111 * \param root Capability of the source cspace root CNode to invoke
128 invoke_cnode_retype(struct capref root, capaddr_t src_cspace, capaddr_t cap,
139 return cap_invoke10(root, CNodeCmd_Retype, src_cspace, cap, offset,
/barrelfish-2018-10-04/include/arch/arm/barrelfish/
H A Dinvocations_arch.h110 * \param root Capability of the Root CNode to invoke
124 invoke_cnode_retype(struct capref root, capaddr_t src_cspace, capaddr_t cap,
137 return cap_invoke10(root, CNodeCmd_Retype, src_cspace, cap, offset,
/barrelfish-2018-10-04/include/arch/x86_64/barrelfish/
H A Dinvocations_arch.h70 * \param root Capability of the source cspace root CNode to invoke
85 static inline errval_t invoke_cnode_retype(struct capref root, capaddr_t src_cspace, argument
93 return cap_invoke9(root, CNodeCmd_Retype,
/barrelfish-2018-10-04/lib/bulk_transfer/backends/sm/
H A Dchannel.c316 data->root = NULL;
417 data->root = NULL;
/barrelfish-2018-10-04/usr/replay/
H A Dmaster.c498 __print_taskgraph(struct pid_entry *root, int level) argument
500 if (root == NULL)
504 printf("%d (completed:%d)\n", root->pid, root->completed);
506 for (int i=0; i<root->children_nr; i++) {
507 __print_taskgraph(root->children[i], level+1);
/barrelfish-2018-10-04/usr/skb/programs/
H A Dbridge_page.pl37 % find all the root bridges
38 findall(root(Addr,Child,mem(LP,HP)),
92 % create an assignment for all PCI buses (all root bridges and their children)
121 % the main part of the allocation. Called once per root bridge
125 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
143 % pseudo-root of both trees
H A Dbridge_postorder.pl43 findall(root(Addr,Child,mem(LP,HP)),
85 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
101 %% pseudo-root of both trees
H A Droute_tree_radix.pl96 % root has to be partd of the CoreList
H A Dbridge_postorder_sorted.pl47 findall(root(Addr,Child,mem(LP,HP)),
89 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
104 %% pseudo-root of both trees
H A Dbridge_postorder_sorted_ascending.pl47 findall(root(Addr,Child,mem(LP,HP)),
89 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
105 %% pseudo-root of both trees
H A Dbridge_postorder_sorted_sum.pl48 findall(root(Addr,Child,mem(LP,HP)),
90 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
109 %% pseudo-root of both trees
H A Dbridge_postorder_sorted_sum_ascending.pl47 findall(root(Addr,Child,mem(LP,HP)),
89 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
105 %% pseudo-root of both trees
H A Dbridge.pl39 findall(root(Addr,Child,Mem),rootbridge(Addr,Child,Mem),Roots),
51 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
/barrelfish-2018-10-04/include/sys/
H A Dtree.h41 * node to the root of the tree and partly rebalances it.
53 * - every search path from the root to a leaf consists of the
55 * - each red node (except for the root) has a black parent,
64 struct type *sph_root; /* root of the tree */ \
67 #define SPLAY_INITIALIZER(root) \
70 #define SPLAY_INIT(root) do { \
71 (root)->sph_root = NULL; \
298 struct type *rbh_root; /* root of the tree */ \
301 #define RB_INITIALIZER(root) \
304 #define RB_INIT(root) d
[all...]
/barrelfish-2018-10-04/lib/tommath/
H A Dmakefile.shared31 USER=root
/barrelfish-2018-10-04/doc/013-capability-mgmt/
H A Dtype_system.tex68 the root or L1 CNode (which can be dynamically enlarged), and L2 or leaf
137 \arg Capability of the source cspace root CNode to invoke
156 \arg Capability of the source cspace root CNode to invoke
157 \arg Capability address of destination root cnode relative to our cspace
160 \arg Capability address of source root cnode relative to our cspace
171 \arg Capability of the source cspace root CNode to invoke
493 \arg CSpace address of the root (L1) CNode of the capability to map
499 \arg CSpace address of the root (L1) CNode of the capability slot in which
824 \arg Number of valid bits for the root CNode to associate with the Dispatcher capability
825 \arg CSpace address of the root CNod
[all...]
/barrelfish-2018-10-04/kernel/include/
H A Dcapabilities.h56 struct mdbnode mdbnode; ///< MDB "root" node for the cap
118 errval_t caps_create_from_existing(struct capability *root, capaddr_t cnode_cptr,
/barrelfish-2018-10-04/tools/aarch64_gem5/
H A Dgem5script.py188 root = Root(full_system=True, system=system) variable
/barrelfish-2018-10-04/usr/bench/rcce/bt/
H A Dverify.c51 if (node != root) return;
/barrelfish-2018-10-04/doc/015-disk-driver-arch/
H A Dfat.tex27 FAT16 (and FAT12) have the particularity that the root directory is not like
30 the root directory is fixed when formatting. FAT32 removes this limitation, and
H A Dblockdevfs.tex7 filenames from different backends are combined to form the root directory of
17 enumerating the contents of the blockdevfs root directory will yield the files
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/src/
H A Dworker.c1388 the root node. This can cause workers not to exit if the system
1510 /* wait until first worker has initialised the root */
1516 /* wait until I have received my root id */
1522 Send req_wid the root.
1525 void wm_init_lodged(req_wid, root)
1527 st_handle_t *root;
1529 send_node_msg((get_worker(req_wid))->wm_aport_id,SET_ROOT, root);
1533 Inform wm that root node has been initialised
1535 void root_node_register(aport, root)
1537 st_handle_t *root;
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/
H A Dinstall.com8 $! P1 root of the directory tree
/barrelfish-2018-10-04/lib/libc/nameser/
H A Dns_print.c131 goto root;
136 /* Origin not used or not root, and no trailing dot? */
140 root:
1184 goto root;
1196 root:
/barrelfish-2018-10-04/include/vm/
H A Dvm_map.h189 vm_map_entry_t root; /* Root of a binary search tree */ member in struct:vm_map

Completed in 805 milliseconds

123456