Home
last modified time | relevance | path

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

12

/src/contrib/kyua/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()
113 std::unique_ptr< base_node > new_node; in combine_children_into() local
117 new_node.reset((*iter1).second->deep_copy()); in combine_children_into()
121 new_node.reset((*iter1).second->combine(child_key, in combine_children_into()
125 node->_children[name] = new_node.release(); in combine_children_into()
222 new_node_hook new_node) in lookup_rw() argument
230 static_cast< base_node* >(new_node()) : in lookup_rw()
252 return child.lookup_rw(key, key_pos + 1, new_node); in lookup_rw()
[all …]
H A Dtree.cpp123 _root->define(key, 0, detail::new_node< detail::dynamic_inner_node >); in define_dynamic()
195 key, 0, detail::new_node< string_node >); in set_lua()
250 key, 0, detail::new_node< string_node >); in set_string()
H A Dlua_module_test.cpp70 std::unique_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.ipp60 _root->define(key, 0, detail::new_node< LeafType >);
110 key, 0, detail::new_node< LeafType >);
140 detail::new_node< LeafType >);
H A Dtree_test.cpp79 std::unique_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)
/src/contrib/jemalloc/src/
H A Dprof_log.c137 prof_bt_node_t *new_node = (prof_bt_node_t *) in prof_log_bt_index() local
141 log_bt_first = new_node; in prof_log_bt_index()
142 log_bt_last = new_node; in prof_log_bt_index()
144 log_bt_last->next = new_node; in prof_log_bt_index()
145 log_bt_last = new_node; in prof_log_bt_index()
148 new_node->next = NULL; in prof_log_bt_index()
149 new_node->index = log_bt_index; in prof_log_bt_index()
154 new_node->bt.len = bt->len; in prof_log_bt_index()
155 memcpy(new_node->vec, bt->vec, bt->len * sizeof(void *)); in prof_log_bt_index()
156 new_node->bt.vec = new_node->vec; in prof_log_bt_index()
[all …]
/src/contrib/ntp/ntpd/
H A Dntp_prio_q.c83 node *new_node; in debug_get_node() local
86 new_node = emalloc(sizeof(*new_node) + size); in debug_get_node()
88 new_node = debug_erealloc(NULL, sizeof(*new_node) + size, in debug_get_node()
91 new_node->node_next = NULL; in debug_get_node()
93 return new_node + 1; in debug_get_node()
154 node *new_node = (node *)my_node - 1; in enqueue() local
159 (*my_queue->get_order)(new_node + 1, j + 1) > 0) { in enqueue()
165 new_node->node_next = my_queue->front; in enqueue()
166 my_queue->front = new_node; in enqueue()
168 new_node->node_next = i->node_next; in enqueue()
[all …]
/src/sys/contrib/openzfs/include/os/linux/spl/sys/
H A Dlist.h201 list_link_replace(list_node_t *old_node, list_node_t *new_node) in list_link_replace() argument
203 new_node->next = old_node->next; in list_link_replace()
204 new_node->prev = old_node->prev; in list_link_replace()
205 old_node->prev->next = new_node; in list_link_replace()
206 old_node->next->prev = new_node; in list_link_replace()
/src/contrib/googletest/googletest/samples/
H A Dsample3-inl.h115 QueueNode<E>* new_node = new QueueNode<E>(element); in Enqueue() local
118 head_ = last_ = new_node; in Enqueue()
121 last_->next_ = new_node; in Enqueue()
122 last_ = new_node; in Enqueue()
/src/contrib/kyua/model/
H A Dmetadata.cpp79 std::unique_ptr< bytes_node > new_node(new bytes_node()); in deep_copy() local
80 new_node->_value = _value; in deep_copy()
81 return new_node.release(); in deep_copy()
109 std::unique_ptr< delta_node > new_node(new delta_node()); in deep_copy() local
110 new_node->_value = _value; in deep_copy()
111 return new_node.release(); in deep_copy()
169 std::unique_ptr< user_node > new_node(new user_node()); in deep_copy() local
170 new_node->_value = _value; in deep_copy()
171 return new_node.release(); in deep_copy()
200 std::unique_ptr< paths_set_node > new_node(new paths_set_node()); in deep_copy() local
[all …]
/src/contrib/llvm-project/compiler-rt/lib/profile/
H A DGCDAProfiling.c114 struct fn_node* new_node = malloc(sizeof(struct fn_node)); in fn_list_insert() local
115 new_node->fn = fn; in fn_list_insert()
116 new_node->next = NULL; in fn_list_insert()
117 new_node->id = CURRENT_ID; in fn_list_insert()
120 list->head = list->tail = new_node; in fn_list_insert()
122 list->tail->next = new_node; in fn_list_insert()
123 list->tail = new_node; in fn_list_insert()
/src/contrib/ofed/libibverbs/
H A Dmemory.c527 struct ibv_mem_node *new_node = NULL; in split_range() local
529 new_node = malloc(sizeof *new_node); in split_range()
530 if (!new_node) in split_range()
532 new_node->start = cut_line; in split_range()
533 new_node->end = node->end; in split_range()
534 new_node->refcnt = node->refcnt; in split_range()
536 __mm_add(new_node); in split_range()
538 return new_node; in split_range()
/src/crypto/krb5/src/lib/krb5/ccache/
H A Dcc_memory.c190 krb5_mcc_link *new_node; in store_cred() local
192 new_node = malloc(sizeof(*new_node)); in store_cred()
193 if (new_node == NULL) in store_cred()
195 new_node->next = NULL; in store_cred()
196 ret = krb5_copy_creds(context, cred, &new_node->creds); in store_cred()
198 free(new_node); in store_cred()
203 *d->tail = new_node; in store_cred()
204 d->tail = &new_node->next; in store_cred()
/src/contrib/ldns/
H A Ddnssec_zone.c633 ldns_rbnode_t *new_node; local
785 if (!(new_node = LDNS_MALLOC(ldns_rbnode_t))) {
789 new_node->key = ldns_dname_label(ldns_rr_owner(cur_rr), 0);
790 new_node->data = cur_rr;
791 if (!ldns_rbtree_insert(&todo_nsec3_ents, new_node)) {
792 LDNS_FREE(new_node);
953 ldns_rbnode_t* new_node; local
968 if ((new_node = LDNS_MALLOC(ldns_rbnode_t))) {
970 new_node->key = name->hashed_name;
971 new_node->data = name;
[all …]
/src/contrib/kyua/engine/
H A Dconfig.cpp144 std::unique_ptr< user_node > new_node(new user_node()); in deep_copy() local
145 new_node->_value = _value; in deep_copy()
146 return new_node.release(); in deep_copy()
/src/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_stackdepotbase.h142 Node &new_node = nodes[s]; in Put() local
143 new_node.store(s, args, h); in Put()
144 new_node.link = s2; in Put()
/src/tools/regression/geom/ConfCmp/
H A DConfCmp.c78 new_node(void) in new_node() function
112 np = new_node(); in StartElement()
180 mt->top = new_node(); in dofile()
/src/sys/contrib/openzfs/module/zfs/
H A Dbtree.c629 uint32_t offset, zfs_btree_hdr_t *new_node, void *buf) in zfs_btree_insert_core_impl() argument
633 ASSERT3P(par_hdr, ==, new_node->bth_parent); in zfs_btree_insert_core_impl()
646 parent->btc_children[offset + 1] = new_node; in zfs_btree_insert_core_impl()
657 zfs_btree_hdr_t *new_node, void *buf) in zfs_btree_insert_into_parent() argument
659 ASSERT3P(old_node->bth_parent, ==, new_node->bth_parent); in zfs_btree_insert_into_parent()
678 old_node->bth_parent = new_node->bth_parent = new_root; in zfs_btree_insert_into_parent()
680 new_root->btc_children[1] = new_node; in zfs_btree_insert_into_parent()
708 zfs_btree_insert_core_impl(tree, parent, offset, new_node, buf); in zfs_btree_insert_into_parent()
756 zfs_btree_insert_core_impl(tree, parent, offset, new_node, in zfs_btree_insert_into_parent()
765 new_node->bth_parent = new_parent; in zfs_btree_insert_into_parent()
[all …]
/src/sys/gnu/gcov/
H A Dgcov_fs.c603 new_node(struct gcov_node *parent, struct gcov_info *info, const char *name) in new_node() function
732 node = new_node(parent, NULL, curr); in add_node()
739 node = new_node(parent, info, curr); in add_node()
/src/sys/contrib/openzfs/module/avl/
H A Davl.c621 avl_add(avl_tree_t *tree, void *new_node) in avl_add() argument
625 VERIFY(avl_find(tree, new_node, &where) == NULL); in avl_add()
627 avl_insert(tree, new_node, where); in avl_add()
/src/contrib/ofed/infiniband-diags/src/
H A Dibtracert.c461 static int new_node(Node * node, Port * port, ib_portid_t * path, int dist) in new_node() function
560 if ((r = new_node(node, port, from, 0)) > 0) { in find_mcpath()
659 if ((r = new_node(remotenode, remoteport, path, in find_mcpath()
/src/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dfsssp.c545 static void cdg_insert(cdg_node_t ** root, cdg_node_t * new_node) in cdg_insert() argument
550 current = new_node; in cdg_insert()
556 if (new_node->channelID < current->channelID) { in cdg_insert()
560 current->left = new_node; in cdg_insert()
561 new_node->parent = current; in cdg_insert()
564 } else if (new_node->channelID > current->channelID) { in cdg_insert()
568 current->right = new_node; in cdg_insert()
569 new_node->parent = current; in cdg_insert()
572 } else if (new_node->channelID == current->channelID) { in cdg_insert()
/src/sys/dev/ice/
H A Dice_sched.c991 struct ice_sched_node *prev, *new_node; in ice_sched_add_elems() local
1047 new_node = ice_sched_find_node_by_teid(parent, teid); in ice_sched_add_elems()
1048 if (!new_node) { in ice_sched_add_elems()
1053 new_node->sibling = NULL; in ice_sched_add_elems()
1054 new_node->tc_num = tc_node->tc_num; in ice_sched_add_elems()
1059 if (prev && prev != new_node) { in ice_sched_add_elems()
1062 prev->sibling = new_node; in ice_sched_add_elems()
1067 pi->sib_head[tc_node->tc_num][layer] = new_node; in ice_sched_add_elems()
/src/contrib/libarchive/libarchive/
H A Darchive_read_support_format_rar.c429 static int new_node(struct huffman_code *);
2687 if (new_node(code) < 0) { in create_code()
2795 if (new_node(code) < 0) { in add_value()
2824 new_node(struct huffman_code *code) in new_node() function

12