Searched refs:root (Results 51 - 75 of 153) sorted by relevance

1234567

/barrelfish-master/include/lwip/lwip/
H A Dsnmp_msg.h289 void snmp_varbind_list_free(struct snmp_varbind_root *root);
290 void snmp_varbind_tail_add(struct snmp_varbind_root *root,
293 *root);
/barrelfish-master/kernel/
H A Dmonitor.c119 struct sysret sys_monitor_identify_cap(struct capability *root, argument
124 errval_t err = caps_lookup_cap(root, cptr, level, &cap, CAPRIGHTS_READ);
139 struct capability *root = &dcb_current->cspace.cap; local
141 errval_t err = caps_lookup_slot(root, cptr, level, &cte,
159 struct capability *root = &dcb_current->cspace.cap; local
162 errval_t err = caps_lookup_cap(root, cptr, CPTR_BITS, &disp,
179 struct capability *root; local
181 &root, CAPRIGHTS_READ);
186 err = caps_lookup_slot(root, tptr, tlevel, cte, CAPRIGHTS_READ);
304 struct capability *root; local
[all...]
/barrelfish-master/lib/barrelfish/arch/x86_32/
H A Dpmap.c95 struct vnode *root = &pmap->root; local
96 assert(root != NULL);
99 if((*pdir = find_vnode(root, X86_32_PDPTE_BASE(base))) == NULL) {
100 errval_t err = alloc_vnode(pmap, root, ObjType_VNode_x86_32_pdir,
107 *pdir = &pmap->root;
140 struct vnode *root = &pmap->root; local
141 assert(root != NULL);
145 return find_vnode(root, X86_32_PDPTE_BAS
[all...]
/barrelfish-master/usr/ramfsd/
H A Dramfs.h40 errval_t start_service(struct dirent *root);
H A Dservice.c43 struct dirent *root; member in struct:client_state
53 static void client_state_init(struct client_state *st, struct dirent *root) argument
55 st->root = root;
158 *rootfh = fh_set(st, st->root);
534 errval_t start_service(struct dirent *root) argument
537 return trivfs_export(root, export_cb, connect_cb, get_default_waitset(),
/barrelfish-master/usr/eclipseclp/lib_tcl/widget/
H A Dhierarchy.tcl48 ## form a path to the node from the root. Thus the first
49 ## element of this list will always be the root node.
75 ## node-names which form a path to the node from the root.
77 ## root node. Also appended is a
110 ## -root rootname DEFAULT: {}
111 ## The name of the root node of the tree. Each node
128 ## string which will reset the root node to its parent.
161 ## root - specifies the root item.
312 {-root roo
[all...]
H A DTOUR.tcl159 set TOUR(Hierarchy,w) [hierarchy_widget $f.p.w -root .]
160 set TOUR(Hierarchy,d) [hierarchy_dir $f.p.d -root [file dirname [pwd]] \
H A Dwidget.tcl139 ;proc _find_class {CLASS {root .}} {
140 if {[string match $CLASS [winfo class $root]]} {
141 return $root
143 foreach w [winfo children $root] {
477 ![info exists widnames([file root $wid])]} {
479 ## have created all the parents first. [file root $wid] is
/barrelfish-master/usr/eclipseclp/Kernel/src/
H A Dsch_types.h76 unsigned jroot:1; /* job-search tree root: Y/N */
77 unsigned proot:1; /* a pseudo-root node/dummy node
130 struct st_handle_ds root; member in struct:scheduler_ds
H A Dscheduler.c178 #define SMSG_INIT_LODGE 0 /* root, leaf, wm_port */
726 #define sch_msg_snd_init_lodge(root, leaf, wm) \
727 smsg_snd01((root),SMSG_INIT_LODGE,(leaf),(wm))
1084 st_id_t *root = (st_id_t *)root_hdl; local
1085 Sch_Alloc_Knot(site,root);
1086 Knot(root)->tip = 0;
1087 Knot(root)->jroot = 1;
1088 *SupTree(root) = *(root);
1089 SetAlive(Trunk(root));
1099 st_id_t *root = (st_id_t *)root_hdl; local
1128 st_id_t *root = (st_id_t *)&Scheduler(site)->root; local
[all...]
/barrelfish-master/include/vm/
H A Dvm_map.c700 return (msleep(&map->root, &map_sleep_mtx, PDROP | PVM, "vmmaps",
721 wakeup(&map->root);
798 map->root = NULL;
882 * The new root is the vm_map_entry containing "addr", or else an
887 * Returns: the new root.
890 vm_map_entry_splay(vm_offset_t addr, vm_map_entry_t root) argument
897 if (root == NULL)
898 return (root);
911 /* root is never NULL in here. */
912 if (addr < root
1036 vm_map_entry_t next, prev, root; local
[all...]
H A Dvm_radix.c157 * Get the root node for a radix tree.
167 * Set the root node for a radix tree.
347 * The owner of record for root is not really important because it
777 struct vm_radix_node *root; local
782 root = vm_radix_getroot(rtree);
783 if (root == NULL)
786 if (!vm_radix_isleaf(root))
787 vm_radix_reclaim_allnodes_int(root);
809 panic("%s: original replacing root key not found",
/barrelfish-master/lib/lwip/src/core/snmp/
H A Dmsg_in.c1272 void snmp_varbind_list_free(struct snmp_varbind_root *root) argument
1276 vb = root->tail;
1282 root->count = 0;
1283 root->head = NULL;
1284 root->tail = NULL;
1288 snmp_varbind_tail_add(struct snmp_varbind_root *root, struct snmp_varbind *vb) argument
1290 if (root->count == 0) {
1292 root->head = vb;
1293 root->tail = vb;
1296 root
1303 snmp_varbind_tail_remove(struct snmp_varbind_root *root) argument
[all...]
H A Dmsg_out.c68 static u16_t snmp_varbind_list_sum(struct snmp_varbind_root *root);
73 static u16_t snmp_varbind_list_enc(struct snmp_varbind_root *root,
394 * @param root points to the root of the variable binding list
397 static u16_t snmp_varbind_list_sum(struct snmp_varbind_root *root) argument
405 vb = root->tail;
451 root->seqlen = tot_len;
452 snmp_asn1_enc_length_cnt(root->seqlen, &root->seqlenlen);
453 tot_len += 1 + root
610 snmp_varbind_list_enc(struct snmp_varbind_root *root, struct pbuf *p, u16_t ofs) argument
[all...]
/barrelfish-master/lib/mm/
H A Dmm.c398 // convolutes the root cause of the error. I'm assuming here
511 mm->root = NULL;
556 /* construct root node if we need one */
557 if (mm->root == NULL) {
560 mm->root = new_node(mm, NodeType_Free, FLAGBITS);
561 if (mm->root == NULL) {
564 mm->root->cap = cap;
567 mm->root = new_node(mm, NodeType_Dummy, FLAGBITS);
568 if (mm->root == NULL) {
576 err = add_node(mm, base, sizebits, mm->root, m
[all...]
/barrelfish-master/tools/harness/
H A Dbarrelfish.py96 def get_menu_data(self, path, root="(nd)"):
101 r += "root %s\n" % root
/barrelfish-master/lib/libc/tests/sys/
H A DMakefile80 truncate_test_FILESOWNER= root
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/core/
H A Dlocal_sa.c205 static void remove_attr(struct rb_root *root, struct ib_sa_attr_list *attr_list) argument
207 rb_erase(&attr_list->node, root);
212 static void remove_all_attrs(struct rb_root *root) argument
218 for (node = rb_first(root); node; node = next_node) {
221 remove_attr(root, attr_list);
226 static void remove_old_attrs(struct rb_root *root, unsigned long update_id) argument
232 for (node = rb_first(root); node; node = next_node) {
236 remove_attr(root, attr_list);
241 static struct ib_sa_attr_list *insert_attr_list(struct rb_root *root, argument
244 struct rb_node **link = &root
266 find_attr_list(struct rb_root *root, u8 *gid) argument
285 insert_attr(struct rb_root *root, unsigned long update_id, void *key, struct ib_sa_iterator *iter) argument
[all...]
/barrelfish-master/include/bulk_transfer/
H A Dbulk_sm.h46 struct bulk_sm_pending_msg *root; member in struct:bulk_sm_impl_data
/barrelfish-master/include/mdb/
H A Dmdb_tree.h75 // create mini kcb that can be used to set root node in user space mdb
81 // Restore mdb state by passing in the address of the root node
119 // @param root indicates which type tree root to search through (usually
132 errval_t mdb_find_range(mdb_root_t root, genpaddr_t address, gensize_t size,
153 * user-provided data. This function starts at the root of the tree.
/barrelfish-master/include/barrelfish/
H A Ddebug.h33 void debug_cspace(struct capref root);
/barrelfish-master/usr/skb/programs/
H A Dbridge_page_orig_naturally_aligned.pl28 % find all the root bridges
29 findall(root(Addr,Child,mem(LP,HP)),
71 % create an assignment for all PCI buses (all root bridges and their children)
99 % the main part of the allocation. Called once per root bridge
103 root(Addr,childbus(MinBus,MaxBus),mem(LMem,HMem)) = Root,
121 % pseudo-root of both trees
/barrelfish-master/include/mm/
H A Dmm.h56 struct mmnode *root; ///< Root node member in struct:mm
57 genpaddr_t base; ///< Base address of root node
59 uint8_t sizebits; ///< Size of root node (in bits)
/barrelfish-master/lib/openssl-1.0.0d/VMS/
H A Dinstall.com6 $! P1 root of the directory tree
/barrelfish-master/lib/openssl-1.0.0d/apps/
H A Dinstall.com6 $! P1 root of the directory tree

Completed in 193 milliseconds

1234567