/barrelfish-master/lib/libc/stdlib/ |
H A D | tdelete.c | 41 if ((*leaf)->balance == 0 || \ 42 ((*leaf)->balance < 0 && (*leaf)->rlink->balance == 0)) { \ 51 base = leaf; \ 55 leaf = &(*leaf)->llink; \ 60 if ((*leaf)->balance == 0 || \ 61 ((*leaf)->balance > 0 && (*leaf)->llink->balance == 0)) { \ 62 base = leaf; \ 74 node_t *root, **base, **leaf, *old, **n, *x, *y, *z; local [all...] |
H A D | tsearch.c | 40 node_t *root, **base, **leaf, *result, *n, *x, *y, *z; local 49 * Find the leaf where the new key needs to be inserted. Return 56 leaf = &root; 57 while (*leaf != NULL) { 58 if ((*leaf)->balance != 0) { 67 base = leaf; 70 cmp = compar(key, (*leaf)->key); 73 leaf = &(*leaf)->llink; 76 leaf [all...] |
H A D | twalk.c | 35 (*action)(root, leaf, level);
|
/barrelfish-master/usr/eclipseclp/Kernel/src/ |
H A D | scheduler.c | 178 #define SMSG_INIT_LODGE 0 /* root, leaf, wm_port */ 179 #define SMSG_BACKTRACK 1 /* parent, leaf */ 180 #define SMSG_STRAIGHTEN 2 /* parent, child, leaf, parent0, nxtcls */ 181 #define SMSG_CUT 3 /* (a) parent, leaf */ 182 #define SMSG_CUT_OK 4 /* leaf, parent, info */ 185 #define SMSG_LODGE 7 /* (a) parent, leaf */ 186 #define SMSG_LODGED 8 /* leaf, parent */ 188 #define SMSG_JS_PROLOGUE 10 /* parent, child, leaf */ 189 #define SMSG_JS_TRAV_UP 11 /* parent, child, leaf, coma */ 190 #define SMSG_JS_TRAV_DN 12 /* child, parent, leaf, com 1100 st_id_t *leaf = (st_id_t *)leaf_hdl; local 1164 st_id_t *leaf = (st_id_t *) leaf_hdl; local 1244 st_id_t * leaf = (st_id_t *)leaf_hdl; local 2360 sch_msg_snd_js_install(SubTree(&twig),&twig,self,coma,leaf); local 2847 st_id_t *leaf = SiteLeaf(site); local 2863 st_id_t *leaf = (st_id_t *)leaf_hdl; local [all...] |
H A D | wm.h | 61 extern st_handle_t * get_root_id(st_handle_t * leaf);
|
H A D | sch_types.h | 91 unsigned tip:1; /* leaf or subtree: Y/N */ 99 struct st_id_ds leaf; /* a suspended leaf */ member in struct:st_susp_ds 122 struct st_id_ds leaf; member in struct:install_req_ds 129 struct st_handle_ds leaf; member in struct:scheduler_ds
|
H A D | sch_macros.h | 122 #define LeafEngine(leaf) (Scheduler(Site(leaf))->engine) 123 #define SiteLeaf(site) ((st_id_t *)&(Scheduler(site)->leaf)) 124 #define NewSiteLeaf(leaf) { \ 125 Scheduler(Site(leaf))->lmp = 0; \ 126 *SiteLeaf(Site(leaf)) = *(leaf); \ 205 /* The super tree area for an incarnated leaf is overloaded to 269 /* Create an alive twig, leading to a leaf 273 #define Add_Alive_Twig_Next(twig,leaf,kno [all...] |
H A D | sch_util.c | 159 ** struct st_handle_ds leaf; 500 /* [leaf, v] */ 506 Make_String(cur_head,"leaf") 511 Make_Integer(cur_head, scheduler_data->leaf.site) 516 Make_Integer(cur_head, scheduler_data->leaf.edge) 521 Make_Integer(cur_head, scheduler_data->leaf.knot)
|
H A D | worker.c | 1507 get_root_id(leaf) 1508 st_handle_t * leaf; 1513 /* Now send first worker my leaf id */ 1514 send_node_msg((get_worker(1))->wm_aport_id, GET_ROOT, leaf);
|
H A D | types.h | 503 st_handle_t *leaf; /* scheduler node associated with this engine */ member in struct:machine
|
H A D | sepia.h | 1329 #define LEAF g_emu_.leaf
|
/barrelfish-master/include/ |
H A D | search.h | 33 leaf enumerator in enum:__anon280
|
/barrelfish-master/lib/lwip2/src/apps/snmp/ |
H A D | snmp_threadsync.c | 142 const struct snmp_leaf_node *leaf = (const struct snmp_leaf_node*)(const void*)call_data->proxy_instance.node; local 144 call_data->retval.err = leaf->get_instance(call_data->arg1.root_oid, call_data->arg2.root_oid_len, &call_data->proxy_instance); 153 const struct snmp_leaf_node *leaf = (const struct snmp_leaf_node*)(const void*)call_data->proxy_instance.node; local 155 call_data->retval.err = leaf->get_next_instance(call_data->arg1.root_oid, call_data->arg2.root_oid_len, &call_data->proxy_instance);
|
/barrelfish-master/usr/eclipseclp/Contrib/ |
H A D | flat.pl | 35 The <operator>_to_list predicates take a binary tree (where leaf
|
/barrelfish-master/lib/openssl-1.0.0d/crypto/ |
H A D | sparccpuid.S | 146 be 1f ! could have been a leaf function...
|
/barrelfish-master/usr/eclipseclp/documents/tutorial/ |
H A D | search.tex | 780 subtrees can be explored, i.e. only one leaf in the subtree can be visited. 811 leaf of the search tree is reached. The leftmost alternative should 816 number of leaf nodes that will be reached. 817 The number of leaf nodes grows exponentially with the number of
|
/barrelfish-master/doc/021-cpudriver/ |
H A D | cpudriver.tex | 156 into leaf VNodes to perform mappings.
|
/barrelfish-master/usr/eclipseclp/documents/search/ |
H A D | search.tex | 703 subtrees can be explored, i.e. only one leaf in the subtree can be visited. 734 leaf of the search tree is reached. The leftmost alternative should 739 number of leaf nodes that will be reached. 740 The number of leaf nodes grows exponentially with the number of
|
/barrelfish-master/doc/013-capability-mgmt/ |
H A D | type_system.tex | 68 the root or L1 CNode (which can be dynamically enlarged), and L2 or leaf
|
/barrelfish-master/usr/eclipseclp/Kernel/lib/ |
H A D | kernel.pl | 6896 ( arity(Arr, I) -> % last in this leaf array
|