/barrelfish-master/lib/libc/stdlib/ |
H A D | twalk.c | 30 trecurse(const node_t *root, /* Root of the tree to be walked */ argument 34 if (root->llink == NULL && root->rlink == NULL) 35 (*action)(root, leaf, level); 37 (*action)(root, preorder, level); 38 if (root->llink != NULL) 39 trecurse(root->llink, action, level + 1); 40 (*action)(root, postorder, level); 41 if (root->rlink != NULL) 42 trecurse(root [all...] |
H A D | tsearch.c | 40 node_t *root, **base, **leaf, *result, *n, *x, *y, *z; local 46 root = *rootp; 55 base = &root; 56 leaf = &root; 198 *rootp = root;
|
/barrelfish-master/lib/barrelfish/include/pmap_array/ |
H A D | pmap_ds.h | 25 * `root`. 28 static inline int pmap_next_child(struct vnode *root, int i, struct vnode **n) argument 34 tmp = root->v.u.vnode.children[i]; 43 * through the non-null children of the vnode `root`. 46 * Note: this macro requires both root and iter to be 'struct vnode *'. 48 #define pmap_foreach_child(root, iter) \ 49 for (int i = pmap_next_child(root, 0, &iter); i < PTABLE_ENTRIES; i = pmap_next_child(root, i, &iter))
|
/barrelfish-master/lib/barrelfish/include/pmap_ll/ |
H A D | pmap_ds.h | 21 * through the non-null children of the vnode `root`. 23 * Note: this macro requires both root and iter to be 'struct vnode *'. 25 #define pmap_foreach_child(root, iter) \ 26 for (iter = (root)->v.u.vnode.children; iter; iter = iter->v.meta.next)
|
/barrelfish-master/usr/bench/rcce/bt/ |
H A D | mpinpb.h | 8 int node, no_nodes, total_nodes, root; variable 11 extern int node, no_nodes, total_nodes, root; 16 #pragma omp threadprivate (node, no_nodes, total_nodes, root, active)
|
H A D | setup_mpi.c | 25 // compute square root; add small number to allow for roundoff 39 // let node 0 be the root for the group (there is only one) 41 root = 0;
|
H A D | bt.c | 85 if (node == root) { 96 if (node == root) { 152 if (node == root) { 166 RCCE_reduce((char*)(&t), (char*)(&tmax), 1, RCCE_DOUBLE, RCCE_MAX, root, RCCE_COMM_WORLD); 168 if( node == root ) {
|
/barrelfish-master/lib/devif/backends/net/mlx4/include/linux/ |
H A D | linux_radix.c | 48 static inline int radix_max(struct radix_tree_root *root) { argument 49 return (1 << (root->height * RADIX_TREE_MAP_SHIFT)) - 1; 57 radix_tree_lookup(struct radix_tree_root *root, unsigned long index) { argument 63 node = root->rnode; 64 height = root->height - 1; 65 if (index > radix_max(root)) 76 radix_tree_delete(struct radix_tree_root *root, unsigned long index) { argument 84 node = root->rnode; 85 height = root->height - 1; 86 if (index > radix_max(root)) 120 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) argument [all...] |
H A D | radix-tree.h | 56 #define INIT_RADIX_TREE(root/*, mask*/) \ 57 { (root)->rnode = NULL; /*(root)->gfp_mask = mask;*/ (root)->height = 0; }
|
H A D | rbtree.h | 67 #define RB_EMPTY_ROOT(root) RB_EMPTY((struct linux_root *)root) 71 #define rb_insert_color(node, root) \ 72 linux_root_RB_INSERT_COLOR((struct linux_root *)(root), (node)) 73 #define rb_erase(node, root) \ 74 linux_root_RB_REMOVE((struct linux_root *)(root), (node)) 77 #define rb_first(root) RB_MIN(linux_root, (struct linux_root *)(root)) 78 #define rb_last(root) RB_MAX(linux_root, (struct linux_root *)(root)) 88 rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root) argument [all...] |
/barrelfish-master/lib/libc/tests/stdlib/ |
H A D | tsearch_test.c | 82 void *root = NULL; local 89 ATF_CHECK(tdelete(&key, &root, compar) != NULL); 93 tdelete(&key, &root, compar)); 99 *(int **)tfind(&key, &root, compar)); 101 ATF_CHECK_EQ(NULL, tfind(&key, &root, compar)); 107 *(int **)tsearch(&key, &root, compar)); 110 &keys[key], &root, compar)); 115 tnode_assert(root); 121 ATF_CHECK(tdelete(&key, &root, compar) != NULL); 122 ATF_CHECK_EQ(NULL, root); [all...] |
/barrelfish-master/lib/barrelfish/include/target/x86/ |
H A D | pmap_x86.h | 28 * \brief check whether vnode `root` has children in [entry .. entry+len). 29 * \return * true iff `root` has children in [entry .. entry+len) and 31 * * true iff `root` has valid page mappings in [entry .. entry+len) 34 bool has_vnode(struct vnode *root, uint32_t entry, size_t len, 37 * \return vnode at `entry` in `root`. NULL if no vnode there. 39 struct vnode *find_vnode(struct vnode *root, uint16_t entry); 42 * \return true iff [entry..entry+npages) inside a child of `root`. 44 bool inside_region(struct vnode *root, uint32_t entry, uint32_t npages); 47 * \brief remove vnode `item` from list of children of `root`. 49 void remove_vnode(struct vnode *root, struc [all...] |
/barrelfish-master/lib/barrelfish/ |
H A D | pmap_ll.c | 23 * \brief Starting at a given root, return the vnode with entry equal to #entry 25 struct vnode *pmap_find_vnode(struct vnode *root, uint16_t entry) argument 27 assert(root != NULL); 28 assert(root->v.is_vnode); 32 for(n = root->v.u.vnode.children; n != NULL; n = n->v.meta.next) { 51 bool pmap_inside_region(struct vnode *root, uint16_t entry, uint16_t npages) argument 53 assert(root != NULL); 54 assert(root->v.is_vnode); 58 for (n = root->v.u.vnode.children; n; n = n->v.meta.next) { 70 void pmap_remove_vnode(struct vnode *root, struc argument 117 pmap_vnode_insert_child(struct vnode *root, struct vnode *newvnode) argument [all...] |
H A D | pmap_array.c | 23 * \brief Starting at a given root, return the vnode with entry equal to #entry 25 struct vnode *pmap_find_vnode(struct vnode *root, uint16_t entry) argument 27 assert(root != NULL); 28 assert(root->v.is_vnode); 31 if (root->v.u.vnode.children) { 32 return root->v.u.vnode.children[entry]; 38 bool pmap_inside_region(struct vnode *root, uint16_t entry, uint16_t npages) argument 40 assert(root != NULL); 41 assert(root->v.is_vnode); 43 struct vnode *n = root 58 pmap_remove_vnode(struct vnode *root, struct vnode *item) argument 109 pmap_vnode_insert_child(struct vnode *root, struct vnode *newvnode) argument [all...] |
/barrelfish-master/usr/bench/rcce/lu/ |
H A D | read_input.c | 6 int root; local 9 //c only root does initializtion, it uses defaults 18 root = 0; 34 if (id == root) {
|
/barrelfish-master/tools/ |
H A D | create_mdb_dot.py | 118 root = None 121 root = cap 123 return root 125 def write_tree(root, outfh): 126 mynodeid = root.nodeid 127 if root.leftcap is not None: 128 leftid = root.leftcap.nodeid 130 write_tree(root.leftcap, outfh) 131 if root.rightcap is not None: 132 rightid= root [all...] |
/barrelfish-master/lib/openssl-1.0.0d/ |
H A D | openssl.spec | 20 BuildRoot: /var/tmp/%{name}-%{version}-root 118 %defattr(0644,root,root,0755) 121 %attr(0755,root,root) /usr/bin/* 122 %attr(0755,root,root) /usr/lib/*.so* 123 %attr(0755,root,root) %{openssldir}/misc/* 124 %attr(0644,root,roo [all...] |
/barrelfish-master/lib/bulk_transfer/backends/sm/ |
H A D | pending_msg.c | 31 struct bulk_sm_pending_msg *node = CHANNEL_DATA(channel)->root; 71 struct bulk_sm_pending_msg *node = CHANNEL_DATA(channel)->root; 74 CHANNEL_DATA(channel)->root = p; 103 //become new root 104 CHANNEL_DATA(channel)->root = p; 116 // node = CHANNEL_DATA(channel)->root; // XXX WRONG. root could be NULL -- jb 142 struct bulk_sm_pending_msg *p = CHANNEL_DATA(channel)->root; 164 CHANNEL_DATA(channel)->root = p->next;
|
/barrelfish-master/usr/ramfsd/ |
H A D | main.c | 30 static errval_t write_directory(struct dirent *root, const char *path); 31 static errval_t write_file(struct dirent *root, const char *path, uint8_t *data, 38 struct dirent *root = arg; local 42 err = write_file(root, h->name, (void *)h->data, h->datasize); 44 err = write_directory(root, h->name); 56 static errval_t unpack_cpio(struct dirent *root, void *data, size_t len) argument 63 cpio_visit(data, len, cpio_entry_handler, &h, root); 67 static errval_t unpack_cpiogz(struct dirent *root, void *data, size_t len) argument 114 err = unpack_cpio(root, outbuf, outbufpos); 121 static errval_t write_directory(struct dirent *root, cons argument 184 write_file(struct dirent *root, const char *path, uint8_t *data, size_t len) argument 335 populate_multiboot(struct dirent *root, struct bootinfo *bi) argument 479 struct dirent *root = ramfs_init(); local [all...] |
/barrelfish-master/lib/zlib/ |
H A D | inftrees.c | 28 requested root table index bits, and on return it is the actual root 43 unsigned root; /* number of index bits for root table */ local 51 unsigned low; /* low bits for current root entry */ 52 unsigned mask; /* mask for low root bits */ 112 /* bound code lengths, force root to be within code lengths */ 113 root = *bits; 116 if (root > max) root [all...] |
/barrelfish-master/lib/rcce/ |
H A D | RCCE_reduce.c | 52 int root, // root of reduction tree, used for all reductions 92 if (RCCE_IAM != comm.member[root]) { 93 // non-root UEs send their source buffers to the root 94 if (ierr=RCCE_send(inbuf, num*type_size, comm.member[root])) 97 if (all) if (ierr=RCCE_recv(outbuf, num*type_size, comm.member[root])) 101 // the root can copy directly from source to target buffer 103 for (ue=0; ue<comm.size; ue++) if (ue != root) { 132 // in case of allreduce the root send 46 RCCE_reduce_general( char *inbuf, char *outbuf, int num, int type, int op, int root, int all, RCCE_COMM comm ) argument 155 int root = 0, all = 1; local 165 RCCE_reduce( char *inbuf, char *outbuf, int num, int type, int op, int root, RCCE_COMM comm ) argument [all...] |
/barrelfish-master/lib/barrelfish/include/ |
H A D | pmap_priv.h | 34 struct vnode *root, uint16_t entry) 36 assert(root->v.is_vnode); 39 vnode->v.mapping.cnode = root->u.vnode.mcnode[entry / L2_CNODE_SLOTS]; 33 set_mapping_cap(struct pmap *pmap, struct vnode *vnode, struct vnode *root, uint16_t entry) argument
|
/barrelfish-master/lib/dma/ |
H A D | dma_mem_mgr.c | 29 struct dma_mem_node *root; member in struct:dma_mem_tree 64 tree->root = NULL; 79 struct dma_mem_node *node = tree->root; 80 struct dma_mem_node *ret = tree->root; 97 if (tree->root == NULL) { 118 if (tree->root == NULL) { 122 tree->root = entry; 132 entry->next = tree->root; 133 tree->root->prev = entry; 159 if (tree->root [all...] |
/barrelfish-master/lib/libc/db/btree/ |
H A D | bt_open.c | 306 /* Create a root page if new tree. */ 339 * NROOT -- Create the root of a new tree. 350 PAGE *meta, *root; local 353 if ((root = mpool_get(t->bt_mp, 1, 0)) != NULL) { 354 if (root->lower == 0 && 355 root->pgno == 0 && 356 root->linp[0] == 0) { 357 mpool_delete(t->bt_mp, root); 360 mpool_put(t->bt_mp, root, 0); 371 if ((root [all...] |
/barrelfish-master/kernel/ |
H A D | syscall.c | 86 /* 1. set cspace root */ 87 struct cte *root; local 89 &root, CAPRIGHTS_READ); 94 if (root->cap.type != ObjType_L1CNode) { 97 err = caps_copy_to_cte(&dcb->cspace, root, false, 0, 0); 103 /* 2. set vspace root */ 105 err = caps_lookup_cap(&root->cap, vptr, CNODE_TYPE_COUNT, &vroot, CAPRIGHTS_WRITE); 111 // Insert as dispatcher's VSpace root 119 err = caps_lookup_slot(&root->cap, dptr, CNODE_TYPE_COUNT, &dispcte, 222 * \param root Sourc 236 sys_retype(struct capability *root, capaddr_t source_croot, capaddr_t source_cptr, gensize_t offset, enum objtype type, gensize_t objsize, size_t count, capaddr_t dest_cspace_cptr, capaddr_t dest_cnode_cptr, uint8_t dest_cnode_level, cslot_t dest_slot, bool from_monitor) argument 296 sys_create(struct capability *root, enum objtype type, size_t objsize, capaddr_t dest_cnode_cptr, uint8_t dest_level, cslot_t dest_slot) argument 353 sys_copy_or_mint(struct capability *root, capaddr_t dest_cspace_cptr, capaddr_t destcn_cptr, cslot_t dest_slot, capaddr_t source_croot_ptr, capaddr_t source_cptr, uint8_t destcn_level, uint8_t source_level, uintptr_t param1, uintptr_t param2, bool mint) argument 433 struct capability *root = &dcb_current->cspace.cap; local 501 struct capability *root = &dcb_current->cspace.cap; local 534 sys_delete(struct capability *root, capaddr_t cptr, uint8_t level) argument 547 sys_revoke(struct capability *root, capaddr_t cptr, uint8_t level) argument 560 sys_get_state(struct capability *root, capaddr_t cptr, uint8_t level) argument 573 sys_get_size_l1cnode(struct capability *root) argument 582 sys_resize_l1cnode(struct capability *root, capaddr_t newroot_cptr, capaddr_t retcn_cptr, cslot_t retslot) argument 673 sys_identify_cap(struct capability *root, capaddr_t cptr, uint8_t level, struct capability *out) argument [all...] |