Home
last modified time | relevance | path

Searched refs:new_node (Results 1 – 18 of 18) sorted by relevance

/minix3/external/bsd/kyua-cli/dist/utils/config/
H A Dnodes.cpp76 base_node* new_node = (*iter).second->deep_copy(); in copy_into() local
78 node->_children[(*iter).first] = new_node; in copy_into()
80 delete new_node; in copy_into()
148 new_node_hook new_node) in lookup_rw() argument
156 static_cast< base_node* >(new_node()) : in lookup_rw()
179 return child.lookup_rw(key, key_pos + 1, new_node); in lookup_rw()
226 std::auto_ptr< inner_node > new_node(new static_inner_node()); in deep_copy() local
227 copy_into(new_node.get()); in deep_copy()
228 return new_node.release(); in deep_copy()
246 new_node_hook new_node) in define() argument
[all …]
H A Dtree.cpp90 _root->define(key, 0, detail::new_node< detail::dynamic_inner_node >); in define_dynamic()
161 key, 0, detail::new_node< string_node >); in set_lua()
212 key, 0, detail::new_node< string_node >); in set_string()
H A Dlua_module_test.cpp70 std::auto_ptr< custom_node > new_node(new custom_node()); in deep_copy() local
71 new_node->_value = _value; in deep_copy()
72 return new_node.release(); in deep_copy()
H A Dtree.ipp59 _root->define(key, 0, detail::new_node< LeafType >);
109 key, 0, detail::new_node< LeafType >);
138 detail::new_node< LeafType >);
H A Dtree_test.cpp79 std::auto_ptr< wrapped_int_node > new_node(new wrapped_int_node()); in deep_copy() local
80 new_node->_value = _value; in deep_copy()
81 return new_node.release(); in deep_copy()
H A Dnodes.ipp52 /// Type of the new_node() family of functions.
63 new_node(void)
90 void copy_into(inner_node* new_node) const;
/minix3/external/bsd/bind/dist/lib/isc/
H A Dradix.c311 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; in isc_radix_insert() local
503 new_node = isc_mem_get(radix->mctx, sizeof(isc_radix_node_t)); in isc_radix_insert()
504 if (new_node == NULL) in isc_radix_insert()
509 isc_mem_put(radix->mctx, new_node, in isc_radix_insert()
514 new_node->bit = bitlen; in isc_radix_insert()
515 new_node->prefix = NULL; in isc_radix_insert()
516 result = _ref_prefix(radix->mctx, &new_node->prefix, prefix); in isc_radix_insert()
518 isc_mem_put(radix->mctx, new_node, sizeof(isc_radix_node_t)); in isc_radix_insert()
524 new_node->parent = NULL; in isc_radix_insert()
525 new_node->l = new_node->r = NULL; in isc_radix_insert()
[all …]
/minix3/sys/external/bsd/compiler_rt/dist/lib/profile/
H A DPGOProfiling.c46 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); in llvm_pgo_register_writeout_function() local
47 new_node->fn = fn; in llvm_pgo_register_writeout_function()
48 new_node->next = NULL; in llvm_pgo_register_writeout_function()
51 writeout_fn_head = writeout_fn_tail = new_node; in llvm_pgo_register_writeout_function()
53 writeout_fn_tail->next = new_node; in llvm_pgo_register_writeout_function()
54 writeout_fn_tail = new_node; in llvm_pgo_register_writeout_function()
H A DGCDAProfiling.c501 struct writeout_fn_node *new_node = malloc(sizeof(struct writeout_fn_node)); in llvm_register_writeout_function() local
502 new_node->fn = fn; in llvm_register_writeout_function()
503 new_node->next = NULL; in llvm_register_writeout_function()
506 writeout_fn_head = writeout_fn_tail = new_node; in llvm_register_writeout_function()
508 writeout_fn_tail->next = new_node; in llvm_register_writeout_function()
509 writeout_fn_tail = new_node; in llvm_register_writeout_function()
533 struct flush_fn_node *new_node = malloc(sizeof(struct flush_fn_node)); in llvm_register_flush_function() local
534 new_node->fn = fn; in llvm_register_flush_function()
535 new_node->next = NULL; in llvm_register_flush_function()
538 flush_fn_head = flush_fn_tail = new_node; in llvm_register_flush_function()
[all …]
/minix3/external/bsd/bind/dist/lib/dns/
H A Diptable.c122 isc_radix_node_t *node, *new_node; in dns_iptable_merge() local
126 new_node = NULL; in dns_iptable_merge()
127 result = isc_radix_insert (tab->radix, &new_node, node, NULL); in dns_iptable_merge()
143 new_node->data[0] = &dns_iptable_neg; in dns_iptable_merge()
147 new_node->data[1] = &dns_iptable_neg; in dns_iptable_merge()
H A Drpz.c620 new_node(dns_rpz_zones_t *rpzs, in new_node() function
1094 child = new_node(rpzs, tgt_ip, tgt_prefix, NULL); in search()
1170 new_parent = new_node(rpzs, tgt_ip, tgt_prefix, cur); in search()
1222 sibling = new_node(rpzs, tgt_ip, tgt_prefix, NULL); in search()
1225 new_parent = new_node(rpzs, tgt_ip, dbit, cur); in search()
/minix3/minix/fs/mfs/
H A Dopen.c8 static struct inode *new_node(struct inode *ldirp, char *string, mode_t
28 rip = new_node(ldirp, name, mode, uid, gid, NO_ZONE); in fs_create()
66 ip = new_node(ldirp, name, mode, uid, gid, (zone_t) dev); in fs_mknod()
88 rip = new_node(ldirp, name, mode, uid, gid, (zone_t) 0); in fs_mkdir()
141 sip = new_node(ldirp, name, (I_SYMBOLIC_LINK | RWX_MODES), uid, gid, 0); in fs_slink()
192 static struct inode *new_node(struct inode *ldirp, in new_node() function
/minix3/minix/fs/ext2/
H A Dopen.c13 static struct inode *new_node(struct inode *ldirp, char *string, mode_t
34 rip = new_node(ldirp, name, mode, uid, gid, NO_BLOCK); in fs_create()
72 ip = new_node(ldirp, name, mode, uid, gid, (block_t) dev); in fs_mknod()
94 rip = new_node(ldirp, name, mode, uid, gid, (block_t) 0); in fs_mkdir()
150 sip = new_node(ldirp, name, (I_SYMBOLIC_LINK | RWX_MODES), uid, gid, 0); in fs_slink()
207 static struct inode *new_node(struct inode *ldirp, in new_node() function
/minix3/external/bsd/kyua-cli/dist/engine/
H A Dmetadata.cpp75 std::auto_ptr< bytes_node > new_node(new bytes_node()); in deep_copy() local
76 new_node->_value = _value; in deep_copy()
77 return new_node.release(); in deep_copy()
111 std::auto_ptr< delta_node > new_node(new delta_node()); in deep_copy() local
112 new_node->_value = _value; in deep_copy()
113 return new_node.release(); in deep_copy()
177 std::auto_ptr< user_node > new_node(new user_node()); in deep_copy() local
178 new_node->_value = _value; in deep_copy()
179 return new_node.release(); in deep_copy()
208 std::auto_ptr< paths_set_node > new_node(new paths_set_node()); in deep_copy() local
[all …]
H A Dconfig.cpp128 std::auto_ptr< user_node > new_node(new user_node()); in deep_copy() local
129 new_node->_value = _value; in deep_copy()
130 return new_node.release(); in deep_copy()
/minix3/minix/servers/vm/
H A Dcavl_impl.h762 L__SC AVL_HANDLE L__(subst)(L__(avl) *L__tree, AVL_HANDLE new_node) in L__()
774 cmp = AVL_COMPARE_NODE_NODE(new_node, h); in L__()
785 AVL_SET_LESS(new_node, AVL_GET_LESS(h, 0)) in L__()
786 AVL_SET_GREATER(new_node, AVL_GET_GREATER(h, 0)) in L__()
787 AVL_SET_BALANCE_FACTOR(new_node, AVL_GET_BALANCE_FACTOR(h)) in L__()
792 AVL_SET_ROOT(L__tree, new_node); in L__()
798 AVL_SET_LESS(parent, new_node) in L__()
800 AVL_SET_GREATER(parent, new_node) in L__()
H A Dcavl_if.h97 L__SC AVL_HANDLE L__(subst)(L__(avl) *tree, AVL_HANDLE new_node);
/minix3/minix/servers/vfs/
H A Dopen.c31 static struct vnode *new_node(struct lookup *resolve, int oflags,
110 vp = new_node(&resolve, oflags, omode); in common_open()
299 static struct vnode *new_node(struct lookup *resolve, int oflags, mode_t bits) in new_node() function
346 return new_node(resolve, oflags, bits); in new_node()
418 vp = new_node(resolve, oflags, bits); in new_node()