Searched refs:new_node (Results 1 - 25 of 31) sorted by relevance

12

/freebsd-13-stable/contrib/ntp/ntpd/
H A Dntp_prio_q.c83 node *new_node; local
86 new_node = emalloc(sizeof(*new_node) + size);
88 new_node = debug_erealloc(NULL, sizeof(*new_node) + size,
91 new_node->node_next = NULL;
93 return new_node + 1;
154 node *new_node = (node *)my_node - 1; local
159 (*my_queue->get_order)(new_node + 1, j + 1) > 0) {
165 new_node
[all...]
/freebsd-13-stable/contrib/subversion/subversion/libsvn_diff/
H A Dtoken.c89 svn_diff__node_t *new_node; local
131 new_node = apr_palloc(tree->pool, sizeof(*new_node));
132 new_node->parent = parent;
133 new_node->left = NULL;
134 new_node->right = NULL;
135 new_node->hash = hash;
136 new_node->token = token;
137 new_node->index = tree->node_count++;
139 *node = *node_ref = new_node;
[all...]
/freebsd-13-stable/contrib/kyua/utils/config/
H A Dnodes.cpp76 base_node* new_node = (*iter).second->deep_copy(); local
78 node->_children[(*iter).first] = new_node;
80 delete new_node;
113 std::auto_ptr< base_node > new_node; local
117 new_node.reset((*iter1).second->deep_copy());
121 new_node.reset((*iter1).second->combine(child_key,
125 node->_children[name] = new_node.release();
210 /// \param new_node A function that returns a new leaf node of the desired
222 new_node_hook new_node)
230 static_cast< base_node* >(new_node())
[all...]
H A Dtree.cpp123 _root->define(key, 0, detail::new_node< detail::dynamic_inner_node >);
195 key, 0, detail::new_node< string_node >);
250 key, 0, detail::new_node< string_node >);
H A Dlua_module_test.cpp70 std::auto_ptr< custom_node > new_node(new custom_node());
71 new_node->_value = _value;
72 return new_node.release();
H A Dtree_test.cpp79 std::auto_ptr< wrapped_int_node > new_node(new wrapped_int_node());
80 new_node->_value = _value;
81 return new_node.release();
/freebsd-13-stable/contrib/subversion/subversion/libsvn_subr/
H A Dprefix_string.c180 node_t *new_node; local
241 new_node = apr_pcalloc(tree->pool, sizeof(*new_node));
242 new_node->key = sub_node->key;
243 new_node->length = node->length + match;
244 new_node->key.data[7] = '\xff'; /* This is not a leaf. See is_leaf(). */
245 new_node->sub_node_count = 1;
246 new_node->sub_nodes = apr_palloc(tree->pool, sizeof(node_t *));
247 new_node->sub_nodes[0] = sub_node;
252 sub_node->key.prefix = new_node;
[all...]
/freebsd-13-stable/contrib/ntp/lib/isc/
H A Dradix.c305 isc_radix_node_t *node, *new_node, *parent, *glue = NULL; local
497 new_node = isc_mem_get(radix->mctx, sizeof(isc_radix_node_t));
498 if (new_node == NULL)
503 isc_mem_put(radix->mctx, new_node,
508 new_node->bit = bitlen;
509 new_node->prefix = NULL;
510 result = _ref_prefix(radix->mctx, &new_node->prefix, prefix);
512 isc_mem_put(radix->mctx, new_node, sizeof(isc_radix_node_t));
518 new_node->parent = NULL;
519 new_node
[all...]
/freebsd-13-stable/contrib/googletest/googletest/samples/
H A Dsample3-inl.h115 QueueNode<E>* new_node = new QueueNode<E>(element); local
118 head_ = last_ = new_node;
121 last_->next_ = new_node;
122 last_ = new_node;
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_fs/
H A Ddag.c192 dag_node_t *new_node;
196 new_node = apr_pcalloc(pool, sizeof(*new_node));
197 new_node->fs = fs;
198 new_node->id = svn_fs_fs__id_copy(id, pool);
201 new_node->node_pool = pool;
202 SVN_ERR(get_node_revision(&noderev, new_node));
205 new_node->kind = noderev->kind;
206 new_node->created_path = apr_pstrdup(pool, noderev->created_path);
209 new_node
190 dag_node_t *new_node; local
649 dag_node_t *new_node; local
1120 dag_node_t *new_node = apr_pcalloc(pool, sizeof(*new_node)); local
[all...]
/freebsd-13-stable/sys/contrib/openzfs/include/os/linux/spl/sys/
H A Dlist.h200 list_link_replace(list_node_t *old_node, list_node_t *new_node) argument
202 new_node->next = old_node->next;
203 new_node->prev = old_node->prev;
204 old_node->prev->next = new_node;
205 old_node->next->prev = new_node;
/freebsd-13-stable/contrib/kyua/model/
H A Dmetadata.cpp78 std::auto_ptr< bytes_node > new_node(new bytes_node());
79 new_node->_value = _value;
80 return new_node.release();
108 std::auto_ptr< delta_node > new_node(new delta_node());
109 new_node->_value = _value;
110 return new_node.release();
168 std::auto_ptr< user_node > new_node(new user_node());
169 new_node->_value = _value;
170 return new_node.release();
199 std::auto_ptr< paths_set_node > new_node(ne
[all...]
/freebsd-13-stable/contrib/kyua/engine/
H A Dconfig.cpp133 std::auto_ptr< user_node > new_node(new user_node());
134 new_node->_value = _value;
135 return new_node.release();
/freebsd-13-stable/contrib/ldns/
H A Ddnssec_zone.c631 ldns_rbnode_t *new_node; local
722 if (!(new_node = LDNS_MALLOC(ldns_rbnode_t))) {
726 new_node->key = ldns_dname_label(ldns_rr_owner(cur_rr), 0);
727 new_node->data = cur_rr;
728 if (!ldns_rbtree_insert(&todo_nsec3_ents, new_node)) {
729 LDNS_FREE(new_node);
879 ldns_rbnode_t* new_node; local
894 if ((new_node = LDNS_MALLOC(ldns_rbnode_t))) {
896 new_node->key = name->hashed_name;
897 new_node
1046 ldns_rbnode_t *cur_node, *next_node, *new_node; local
[all...]
/freebsd-13-stable/contrib/llvm-project/compiler-rt/lib/profile/
H A DGCDAProfiling.c141 struct fn_node* new_node = malloc(sizeof(struct fn_node)); local
142 new_node->fn = fn;
143 new_node->next = NULL;
144 new_node->id = CURRENT_ID;
147 list->head = list->tail = new_node;
149 list->tail->next = new_node;
150 list->tail = new_node;
/freebsd-13-stable/contrib/jemalloc/src/
H A Dprof.c378 prof_bt_node_t *new_node = (prof_bt_node_t *) local
382 log_bt_first = new_node;
383 log_bt_last = new_node;
385 log_bt_last->next = new_node;
386 log_bt_last = new_node;
389 new_node->next = NULL;
390 new_node->index = log_bt_index;
395 new_node->bt.len = bt->len;
396 memcpy(new_node->vec, bt->vec, bt->len * sizeof(void *));
397 new_node
419 prof_thr_node_t *new_node = (prof_thr_node_t *) local
480 prof_alloc_node_t *new_node = (prof_alloc_node_t *) local
[all...]
/freebsd-13-stable/contrib/ofed/libibverbs/
H A Dmemory.c527 struct ibv_mem_node *new_node = NULL; local
529 new_node = malloc(sizeof *new_node);
530 if (!new_node)
532 new_node->start = cut_line;
533 new_node->end = node->end;
534 new_node->refcnt = node->refcnt;
536 __mm_add(new_node);
538 return new_node;
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Ddag.c172 dag_node_t *new_node;
176 new_node = apr_pcalloc(result_pool, sizeof(*new_node));
177 new_node->fs = fs;
178 new_node->hint = APR_SIZE_MAX;
183 new_node->node_pool = result_pool;
184 new_node->node_revision = noderev;
187 *node = new_node;
923 dag_node_t *new_node = apr_pmemdup(result_pool, node, sizeof(*new_node));
170 dag_node_t *new_node; local
918 dag_node_t *new_node = apr_pmemdup(result_pool, node, sizeof(*new_node)); local
[all...]
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Ddag.c139 dag_node_t *new_node;
143 new_node = apr_pcalloc(pool, sizeof(*new_node));
144 new_node->fs = fs;
145 new_node->id = svn_fs_base__id_copy(id, pool);
151 new_node->kind = noderev->kind;
152 new_node->created_path = noderev->created_path;
155 *node = new_node;
1356 dag_node_t *new_node = apr_pcalloc(pool, sizeof(*new_node));
137 dag_node_t *new_node; local
1351 dag_node_t *new_node = apr_pcalloc(pool, sizeof(*new_node)); local
[all...]
/freebsd-13-stable/tools/regression/geom/ConfCmp/
H A DConfCmp.c80 new_node(void) function
114 np = new_node();
182 mt->top = new_node();
/freebsd-13-stable/sys/contrib/openzfs/module/zfs/
H A Dbtree.c506 uint64_t offset, zfs_btree_hdr_t *new_node, void *buf)
510 ASSERT3P(par_hdr, ==, new_node->bth_parent);
523 parent->btc_children[offset + 1] = new_node;
529 * Insert new_node into the parent of old_node directly after old_node, with
534 zfs_btree_hdr_t *new_node, void *buf)
536 ASSERT3P(old_node->bth_parent, ==, new_node->bth_parent);
556 old_node->bth_parent = new_node->bth_parent = new_root;
558 new_root->btc_children[1] = new_node;
569 * new_node.
585 zfs_btree_insert_core_impl(tree, parent, offset, new_node, bu
505 zfs_btree_insert_core_impl(zfs_btree_t *tree, zfs_btree_core_t *parent, uint64_t offset, zfs_btree_hdr_t *new_node, void *buf) argument
533 zfs_btree_insert_into_parent(zfs_btree_t *tree, zfs_btree_hdr_t *old_node, zfs_btree_hdr_t *new_node, void *buf) argument
[all...]
/freebsd-13-stable/sys/contrib/openzfs/module/avl/
H A Davl.c636 avl_add(avl_tree_t *tree, void *new_node) argument
640 VERIFY(avl_find(tree, new_node, &where) == NULL);
642 avl_insert(tree, new_node, where);
/freebsd-13-stable/sys/gnu/gcov/
H A Dgcov_fs.c607 new_node(struct gcov_node *parent, struct gcov_info *info, const char *name) function
736 node = new_node(parent, NULL, curr);
743 node = new_node(parent, info, curr);
/freebsd-13-stable/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dfsssp.c545 static void cdg_insert(cdg_node_t ** root, cdg_node_t * new_node) argument
550 current = new_node;
556 if (new_node->channelID < current->channelID) {
560 current->left = new_node;
561 new_node->parent = current;
564 } else if (new_node->channelID > current->channelID) {
568 current->right = new_node;
569 new_node->parent = current;
572 } else if (new_node->channelID == current->channelID) {
/freebsd-13-stable/contrib/ofed/infiniband-diags/src/
H A Dibtracert.c461 static int new_node(Node * node, Port * port, ib_portid_t * path, int dist) function
560 if ((r = new_node(node, port, from, 0)) > 0) {
659 if ((r = new_node(remotenode, remoteport, path,

Completed in 328 milliseconds

12