/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/ |
H A D | ossl_typ.h | 189 typedef int CRYPTO_EX_new(void *parent, void *ptr, CRYPTO_EX_DATA *ad, 191 typedef void CRYPTO_EX_free(void *parent, void *ptr, CRYPTO_EX_DATA *ad,
|
H A D | crypto.h | 160 typedef int CRYPTO_EX_new(void *parent, void *ptr, CRYPTO_EX_DATA *ad, 163 typedef void CRYPTO_EX_free(void *parent, void *ptr, CRYPTO_EX_DATA *ad,
|
/barrelfish-2018-10-04/include/openssl/ |
H A D | ossl_typ.h | 189 typedef int CRYPTO_EX_new(void *parent, void *ptr, CRYPTO_EX_DATA *ad, 191 typedef void CRYPTO_EX_free(void *parent, void *ptr, CRYPTO_EX_DATA *ad,
|
H A D | crypto.h | 160 typedef int CRYPTO_EX_new(void *parent, void *ptr, CRYPTO_EX_DATA *ad, 163 typedef void CRYPTO_EX_free(void *parent, void *ptr, CRYPTO_EX_DATA *ad,
|
/barrelfish-2018-10-04/usr/eclipseclp/Kernel/lib/ |
H A D | tracer.pl | 72 struct(tf(invoc,goal,depth,chp,parent,proc,prio,path,line,from,to,module)), 113 ( NewStack = tf{parent:Parent} -> % call port 185 Current = tf{depth:Depth,parent:Parent}, 199 % get_fail_info/2 does not fill in depth and parent 200 FakeStack = tf{depth:Depth1,parent:Stack}, 252 Stack = tf{depth:Depth,parent:Parent}, 270 ( TD = tf{parent:Parent} -> % call port 362 true % no parent to exit 378 current_td(Stack), % use parent frame 383 true % no parent [all...] |
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/ |
H A D | prolog.tex | 499 uncle(X,Z) :- brother(X,Y), parent(Y,Z). 503 $uncle(X,Z) \longleftarrow brother(X,Y) \wedge parent(Y,Z)$ 507 $\forall X \forall Z: uncle(X,Z) \longleftarrow \exists Y: brother(X,Y) \wedge parent(Y,Z)$ 509 stating that uncle(X,Z) is true if brother(X,Y) and parent(Y,Z) are true. 521 parent(abe, homer). 522 parent(abe, herbert). 523 parent(homer, bart). 524 parent(marge, bart). 529 ancestor(X,Y) :- parent(X,Y). 530 ancestor(X,Y) :- parent( [all...] |
/barrelfish-2018-10-04/include/vm/ |
H A D | vm_kern.c | 272 * parent Map to take range from 278 kmem_suballoc(vm_map_t parent, vm_offset_t *min, vm_offset_t *max, argument 286 *min = vm_map_min(parent); 287 ret = vm_map_find(parent, NULL, 0, min, size, 0, superpage_align ? 293 result = vm_map_create(vm_map_pmap(parent), *min, *max); 296 if (vm_map_submap(parent, *min, *max, result) != KERN_SUCCESS)
|
H A D | vm_radix.c | 579 ("vm_radix_lookup_ge: pushing leaf's parent")); 692 ("vm_radix_lookup_le: pushing leaf's parent")); 707 struct vm_radix_node *rnode, *parent; local 733 parent = NULL; 751 if (parent == NULL) 754 slot = vm_radix_slot(index, parent->rn_clev); 755 KASSERT(parent->rn_child[slot] == rnode, 757 parent->rn_child[slot] = rnode->rn_child[i]; 764 parent = rnode;
|
H A D | vm_meter.c | 254 #define VM_STATS(parent, var, descr) \ 255 SYSCTL_PROC(parent, OID_AUTO, var, \
|
/barrelfish-2018-10-04/lib/phoenix/ |
H A D | taskQ.c | 47 mr_lock_t parent; member in struct:__anon1386 176 lock_free (tq->locks[idx].parent); 198 tq->locks[idx].parent = lock_alloc(); 207 per_thread = lock_alloc_per_thread(tq->locks[idx].parent); 215 lock_free(tq->locks[idx].parent);
|
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/x509v3/ |
H A D | pcy_tree.c | 336 * link any data from CertificatePolicies onto matching parent 353 * no match with the parent valid_policy_set. So we create 370 * Create new data for any unmatched policies in the parent and link 518 node->parent->nchild--; 533 node->parent->nchild--; 540 if (curr->anyPolicy->parent) 541 curr->anyPolicy->parent->nchild--; 618 if ((node->parent == anyptr) 680 node = level_add_node(NULL, extra, anyPolicy->parent,
|
H A D | v3_asid.c | 637 * Figure out whether parent contains child. 639 static int asid_contains(ASIdOrRanges *parent, ASIdOrRanges *child) argument 644 if (child == NULL || parent == child) 646 if (parent == NULL) 653 if (p >= sk_ASIdOrRange_num(parent)) 655 extract_min_max(sk_ASIdOrRange_value(parent, p), &p_min, &p_max); 755 * cert may list resources that its parent doesn't list.
|
H A D | v3_addr.c | 1088 * Figure out whether parent contains child. 1090 static int addr_contains(IPAddressOrRanges *parent, argument 1098 if (child == NULL || parent == child) 1100 if (parent == NULL) 1108 if (p >= sk_IPAddressOrRange_num(parent)) 1110 extract_min_max(sk_IPAddressOrRange_value(parent, p), 1207 * parent doesn't list.
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/ |
H A D | tkeclipse.tcl | 415 # center the child over the parent window 417 proc tkecl:center_over {child parent} { 420 set x [expr {max(0,[winfo x $parent]+([winfo width $parent]-[winfo width $child])/2)}] 421 set y [expr {max(0,[winfo y $parent]+([winfo height $parent]-[winfo height $child])/2)}] 423 wm transient $child $parent
|
H A D | tkinspect.tcl | 398 balloonhelp $cf.left "Move to the parent term" 787 # center the child over the parent window 789 proc tkinspect:center_over {child parent} { 792 set x [expr {max(0,[winfo x $parent]+([winfo width $parent]-[winfo width $child])/2)}] 793 set y [expr {max(0,[winfo y $parent]+([winfo height $parent]-[winfo height $child])/2)}] 795 wm transient $child $parent
|
/barrelfish-2018-10-04/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mlx4/ |
H A D | cm.c | 173 struct rb_node **link = &sl_id_map->rb_node, *parent = NULL; local 189 parent = *link; 190 ent = rb_entry(parent, struct id_map_entry, node); 198 rb_link_node(&new->node, parent, link);
|
/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/ |
H A D | Viz.java | 250 return getInteger("parent",attributes);
308 int parent=getParent(attributes);
316 id,parent,name,size,value);
321 id,parent,name,size,value);
326 id,parent,name,size,choice);
331 id,parent,name,size,choice);
|
/barrelfish-2018-10-04/usr/eclipseclp/lib_tcl/widget/ |
H A D | tabnotebook.tcl | 187 resize [winfo parent %W] [winfo width %W] 281 } elseif {[string comp $w [winfo parent $val]] && \ 282 [string comp $data(hold) [winfo parent $val]]} { 456 } elseif {[string comp $w [winfo parent $val]] && \ 457 [string comp $data(hold) [winfo parent $val]]} {
|
H A D | hierarchy.tcl | 128 ## string which will reset the root node to its parent. 814 set w [winfo parent $w] 1212 set w [winfo parent %W] 1220 [list BeginSelect [winfo parent %W] @%x,%y] 1226 namespace eval ::Widget::Hierarchy [list Motion [winfo parent %W] @%x,%y] 1230 { BeginExtend [winfo parent %W] @%x,%y }] 1232 { BeginToggle [winfo parent %W] @%x,%y }] 1236 namespace eval ::Widget::Hierarchy [list AutoScan [winfo parent %W]] 1263 { SelectAll [winfo parent %W] }] 1265 { [winfo parent [all...] |
/barrelfish-2018-10-04/usr/replay/ |
H A D | master.c | 120 * W is parent, R is child 174 // build stack, and fill it with ready nodes (i.e., no parent nodes) 314 pentry_add_dependency(struct pid_entry *parent, struct pid_entry *child) argument 317 for (int i=0; i<parent->children_nr; i++) 318 if (parent->children[i]->pid == child->pid) 321 //printf("%d -> %d;\n", parent->pid, child->pid); 323 idx = parent->children_nr; 325 parent->children[idx] = child; 326 parent->children_nr++; 330 child->parents[idx] = parent; [all...] |
/barrelfish-2018-10-04/lib/vfs/ |
H A D | vfs.c | 114 struct vfs_mount *parent = find_mount(mp, NULL); local 115 assert(parent != NULL); // root should always have matched 116 if (strcmp(parent->mountpoint, mp) == 0) { 483 * This call fails if the parent directory does not exist, or if the given
|
H A D | vfs_fat.c | 218 dirsearch_initialize(struct fat_dirsearch *search, fat_direntry_t *parent) argument 221 search->parent_direntry = parent; 550 fat_direntry_t *parent = NULL; local 569 dirsearch_initialize(&search, parent); 631 parent = &parent_entry; 632 fat_direntry_initialize(parent, (char*)direntry);
|
H A D | vfs_nfs.c | 1120 char *parent = malloc(dirname - path + 1); local 1121 assert(parent != NULL); 1122 memcpy(parent, path, dirname - path); 1123 parent[dirname - path] = '\0'; 1135 initiate_resolve(nfs, parent, mkdir_resolve_cont, &state); 1139 free(parent);
|
/barrelfish-2018-10-04/lib/barrelfish/arch/x86/ |
H A D | pmap.c | 357 size_t *inlen, int depth, struct vnode *parent) 377 // populate it and append to parent's list of children 384 n->next = parent->u.vnode.children; 385 parent->u.vnode.children = n; 356 deserialise_tree(struct pmap *pmap, struct serial_entry **in, size_t *inlen, int depth, struct vnode *parent) argument
|
/barrelfish-2018-10-04/lib/libc/db/btree/ |
H A D | bt_split.c | 83 EPGNO *parent; local 122 * Now we walk the parent page stack -- a LIFO stack of the pages that 126 * have to insert a new key into the parent page. 128 * If the insert into the parent page causes it to split, may have to 138 * and right pages pinned while working on the parent. The 5 are the 139 * two children, left parent and right parent (when the parent splits) 144 while ((parent = BT_POP(t)) != NULL) { 148 /* Get the parent pag [all...] |