Home
last modified time | relevance | path

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

12

/freebsd-12.1/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 …]
/freebsd-12.1/contrib/subversion/subversion/libsvn_subr/
H A Dprefix_string.c180 node_t *new_node; in svn_prefix_string__create() local
241 new_node = apr_pcalloc(tree->pool, sizeof(*new_node)); in svn_prefix_string__create()
242 new_node->key = sub_node->key; in svn_prefix_string__create()
245 new_node->sub_node_count = 1; in svn_prefix_string__create()
252 sub_node->key.prefix = new_node; in svn_prefix_string__create()
253 node->sub_nodes[idx] = new_node; in svn_prefix_string__create()
254 node = new_node; in svn_prefix_string__create()
260 new_node = apr_pcalloc(tree->pool, sizeof(*new_node)); in svn_prefix_string__create()
261 new_node->key.prefix = node; in svn_prefix_string__create()
270 node->sub_nodes[idx] = new_node; in svn_prefix_string__create()
[all …]
/freebsd-12.1/contrib/ntp/lib/isc/
H A Dradix.c498 if (new_node == NULL) in isc_radix_insert()
519 new_node->l = new_node->r = NULL; in isc_radix_insert()
520 new_node->node_num[0] = new_node->node_num[1] = -1; in isc_radix_insert()
536 new_node->node_num[0] = new_node->node_num[1] = in isc_radix_insert()
553 node->r = new_node; in isc_radix_insert()
556 node->l = new_node; in isc_radix_insert()
558 *target = new_node; in isc_radix_insert()
566 new_node->r = node; in isc_radix_insert()
568 new_node->l = node; in isc_radix_insert()
590 glue->r = new_node; in isc_radix_insert()
[all …]
/freebsd-12.1/contrib/subversion/subversion/libsvn_diff/
H A Dtoken.c89 svn_diff__node_t *new_node; in tree_insert_token() local
131 new_node = apr_palloc(tree->pool, sizeof(*new_node)); in tree_insert_token()
132 new_node->parent = parent; in tree_insert_token()
133 new_node->left = NULL; in tree_insert_token()
134 new_node->right = NULL; in tree_insert_token()
135 new_node->hash = hash; in tree_insert_token()
136 new_node->token = token; in tree_insert_token()
137 new_node->index = tree->node_count++; in tree_insert_token()
139 *node = *node_ref = new_node; in tree_insert_token()
/freebsd-12.1/contrib/subversion/subversion/libsvn_fs_fs/
H A Ddag.c190 dag_node_t *new_node; in svn_fs_fs__dag_get_node() local
194 new_node = apr_pcalloc(pool, sizeof(*new_node)); in svn_fs_fs__dag_get_node()
195 new_node->fs = fs; in svn_fs_fs__dag_get_node()
212 *node = new_node; in svn_fs_fs__dag_get_node()
649 dag_node_t *new_node; in svn_fs_fs__dag_revision_root() local
652 new_node = apr_pcalloc(pool, sizeof(*new_node)); in svn_fs_fs__dag_revision_root()
653 new_node->fs = fs; in svn_fs_fs__dag_revision_root()
665 *node_p = new_node; in svn_fs_fs__dag_revision_root()
1120 dag_node_t *new_node = apr_pcalloc(pool, sizeof(*new_node)); in svn_fs_fs__dag_dup() local
1122 new_node->fs = node->fs; in svn_fs_fs__dag_dup()
[all …]
H A Dtree.c2668 dag_node_t *new_node; in copy_helper() local
2719 SVN_ERR(get_dag(&new_node, to_root, to_path, pool)); in copy_helper()
2721 svn_fs_fs__dag_get_id(new_node), kind, FALSE, in copy_helper()
/freebsd-12.1/contrib/ldns/
H A Ddnssec_zone.c631 ldns_rbnode_t *new_node; local
727 new_node->data = cur_rr;
729 LDNS_FREE(new_node);
879 ldns_rbnode_t* new_node; local
896 new_node->key = name->hashed_name;
897 new_node->data = name;
901 LDNS_FREE(new_node);
1137 new_node = LDNS_MALLOC(ldns_rbnode_t);
1138 if (!new_node) {
1142 new_node->key = new_name->name;
[all …]
/freebsd-12.1/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()
/freebsd-12.1/contrib/subversion/subversion/libsvn_fs_x/
H A Ddag.c170 dag_node_t *new_node; in svn_fs_x__dag_get_node() local
174 new_node = apr_pcalloc(result_pool, sizeof(*new_node)); in svn_fs_x__dag_get_node()
175 new_node->fs = fs; in svn_fs_x__dag_get_node()
176 new_node->hint = APR_SIZE_MAX; in svn_fs_x__dag_get_node()
181 new_node->node_pool = result_pool; in svn_fs_x__dag_get_node()
182 new_node->node_revision = noderev; in svn_fs_x__dag_get_node()
185 *node = new_node; in svn_fs_x__dag_get_node()
918 dag_node_t *new_node = apr_pmemdup(result_pool, node, sizeof(*new_node)); in svn_fs_x__dag_dup() local
921 new_node->node_revision = copy_node_revision(node->node_revision, in svn_fs_x__dag_dup()
923 new_node->node_pool = result_pool; in svn_fs_x__dag_dup()
[all …]
H A Dtree.c1591 dag_node_t *new_node; in copy_helper() local
1639 SVN_ERR(svn_fs_x__get_dag_node(&new_node, to_root, to_path, in copy_helper()
/freebsd-12.1/contrib/compiler-rt/lib/profile/
H A DGCDAProfiling.c124 struct fn_node* new_node = malloc(sizeof(struct fn_node)); in fn_list_insert() local
125 new_node->fn = fn; in fn_list_insert()
126 new_node->next = NULL; in fn_list_insert()
127 new_node->id = CURRENT_ID; in fn_list_insert()
130 list->head = list->tail = new_node; in fn_list_insert()
132 list->tail->next = new_node; in fn_list_insert()
133 list->tail = new_node; in fn_list_insert()
/freebsd-12.1/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()
/freebsd-12.1/contrib/dtc/
H A Dlivetree.c137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes() argument
146 for_each_label_withdel(new_node->labels, l) in merge_nodes()
151 while (new_node->proplist) { in merge_nodes()
153 new_prop = new_node->proplist; in merge_nodes()
154 new_node->proplist = new_prop->next; in merge_nodes()
185 while (new_node->children) { in merge_nodes()
187 new_child = new_node->children; in merge_nodes()
188 new_node->children = new_child->next_sibling; in merge_nodes()
214 free(new_node); in merge_nodes()
H A Ddtc.h200 struct node *merge_nodes(struct node *old_node, struct node *new_node);
/freebsd-12.1/contrib/subversion/subversion/libsvn_fs_base/
H A Ddag.c137 dag_node_t *new_node; in svn_fs_base__dag_get_node() local
141 new_node = apr_pcalloc(pool, sizeof(*new_node)); in svn_fs_base__dag_get_node()
142 new_node->fs = fs; in svn_fs_base__dag_get_node()
143 new_node->id = svn_fs_base__id_copy(id, pool); in svn_fs_base__dag_get_node()
149 new_node->kind = noderev->kind; in svn_fs_base__dag_get_node()
150 new_node->created_path = noderev->created_path; in svn_fs_base__dag_get_node()
153 *node = new_node; in svn_fs_base__dag_get_node()
1351 dag_node_t *new_node = apr_pcalloc(pool, sizeof(*new_node)); in svn_fs_base__dag_dup() local
1353 new_node->fs = node->fs; in svn_fs_base__dag_dup()
1355 new_node->kind = node->kind; in svn_fs_base__dag_dup()
[all …]
H A Dtree.c3204 dag_node_t *new_node; in txn_body_copy() local
3249 SVN_ERR(get_dag(&new_node, to_root, to_path, trail, trail->pool)); in txn_body_copy()
3251 svn_fs_base__dag_get_id(new_node), in txn_body_copy()
/freebsd-12.1/tools/regression/geom/ConfCmp/
H A DConfCmp.c80 new_node(void) in new_node() function
114 np = new_node(); in StartElement()
182 mt->top = new_node(); in dofile()
/freebsd-12.1/contrib/gcc/
H A Dipa-cp.c173 struct cgraph_node *new_node) in ipcp_cloned_create() argument
175 ipa_node_create (new_node); in ipcp_cloned_create()
176 ipcp_method_set_orig_node (new_node, orig_node); in ipcp_cloned_create()
177 ipa_method_formal_compute_count (new_node); in ipcp_cloned_create()
178 ipa_method_compute_tree_map (new_node); in ipcp_cloned_create()
H A Dcgraph.c562 struct cgraph_node *new_node = node->next_clone; in cgraph_remove_node() local
566 for (n = new_node; n; n = n->next_clone) in cgraph_remove_node()
567 n->master_clone = new_node; in cgraph_remove_node()
569 *slot = new_node; in cgraph_remove_node()
H A Dvar-tracking.c1195 location_chain new_node; in variable_union() local
1198 new_node = pool_alloc (loc_chain_pool); in variable_union()
1199 new_node->loc = node->loc; in variable_union()
1200 vui[n].lc = new_node; in variable_union()
/freebsd-12.1/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c632 avl_add(avl_tree_t *tree, void *new_node) in avl_add() argument
644 if (avl_find(tree, new_node, &where) != NULL) in avl_add()
651 avl_insert(tree, new_node, where); in avl_add()
/freebsd-12.1/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()
/freebsd-12.1/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()
/freebsd-12.1/contrib/binutils/binutils/
H A Dobjcopy.c1110 struct redefine_node *new_node; in redefine_list_append() local
1123 new_node = xmalloc (sizeof (struct redefine_node)); in redefine_list_append()
1125 new_node->source = strdup (source); in redefine_list_append()
1126 new_node->target = strdup (target); in redefine_list_append()
1127 new_node->next = NULL; in redefine_list_append()
1129 *p = new_node; in redefine_list_append()
/freebsd-12.1/contrib/libarchive/libarchive/
H A Darchive_read_support_format_rar.c349 static int new_node(struct huffman_code *);
2438 if (new_node(code) < 0) { in create_code()
2510 if ((repeatnode = new_node(code)) < 0) { in add_value()
2515 if ((nextnode = new_node(code)) < 0) { in add_value()
2534 if (new_node(code) < 0) { in add_value()
2563 new_node(struct huffman_code *code) in new_node() function

12