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

/freebsd-11-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-11-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-11-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-11-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-11-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...]
H A Dtree.c2702 dag_node_t *new_node;
2753 SVN_ERR(get_dag(&new_node, to_root, to_path, pool));
2755 svn_fs_fs__dag_get_id(new_node), kind, FALSE,
2693 dag_node_t *new_node; local
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/profile/
H A DGCDAProfiling.c130 struct fn_node* new_node = malloc(sizeof(struct fn_node)); local
131 new_node->fn = fn;
132 new_node->next = NULL;
133 new_node->id = CURRENT_ID;
136 list->head = list->tail = new_node;
138 list->tail->next = new_node;
139 list->tail = new_node;
/freebsd-11-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-11-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...]
H A Dtree.c1599 dag_node_t *new_node;
1647 SVN_ERR(svn_fs_x__get_dag_node(&new_node, to_root, to_path,
1591 dag_node_t *new_node; local
/freebsd-11-stable/contrib/ldns/
H A Ddnssec_zone.c832 ldns_rbnode_t* new_node; local
847 if ((new_node = LDNS_MALLOC(ldns_rbnode_t))) {
849 new_node->key = name->hashed_name;
850 new_node->data = name;
852 if (ldns_rbtree_insert(zone->hashed_names, new_node) == NULL) {
854 LDNS_FREE(new_node);
998 ldns_rbnode_t *cur_node, *next_node, *new_node; local
1067 new_node = LDNS_MALLOC(ldns_rbnode_t);
1068 if (!new_node) {
1072 new_node
[all...]
/freebsd-11-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...]
H A Dtree.c3215 dag_node_t *new_node;
3260 SVN_ERR(get_dag(&new_node, to_root, to_path, trail, trail->pool));
3262 svn_fs_base__dag_get_id(new_node),
3204 dag_node_t *new_node; local
/freebsd-11-stable/tools/regression/geom/ConfCmp/
H A DConfCmp.c80 new_node(void) function
114 np = new_node();
182 mt->top = new_node();
/freebsd-11-stable/contrib/dtc/
H A Dlivetree.c137 struct node *merge_nodes(struct node *old_node, struct node *new_node) argument
146 for_each_label_withdel(new_node->labels, l)
151 while (new_node->proplist) {
153 new_prop = new_node->proplist;
154 new_node->proplist = new_prop->next;
185 while (new_node->children) {
187 new_child = new_node->children;
188 new_node->children = new_child->next_sibling;
214 free(new_node);
H A Ddtc.h200 struct node *merge_nodes(struct node *old_node, struct node *new_node);
/freebsd-11-stable/contrib/gcc/
H A Dipa-cp.c173 struct cgraph_node *new_node)
175 ipa_node_create (new_node);
176 ipcp_method_set_orig_node (new_node, orig_node);
177 ipa_method_formal_compute_count (new_node);
178 ipa_method_compute_tree_map (new_node);
172 ipcp_cloned_create(struct cgraph_node *orig_node, struct cgraph_node *new_node) argument
H A Dcgraph.c562 struct cgraph_node *new_node = node->next_clone; local
566 for (n = new_node; n; n = n->next_clone)
567 n->master_clone = new_node;
569 *slot = new_node;
H A Dvar-tracking.c1195 location_chain new_node; local
1198 new_node = pool_alloc (loc_chain_pool);
1199 new_node->loc = node->loc;
1200 vui[n].lc = new_node;
/freebsd-11-stable/sys/cddl/contrib/opensolaris/common/avl/
H A Davl.c632 avl_add(avl_tree_t *tree, void *new_node) argument
644 if (avl_find(tree, new_node, &where) != NULL)
651 avl_insert(tree, new_node, where);
/freebsd-11-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-11-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,
/freebsd-11-stable/contrib/binutils/binutils/
H A Dobjcopy.c1112 struct redefine_node *new_node;
1125 new_node = xmalloc (sizeof (struct redefine_node));
1127 new_node->source = strdup (source);
1128 new_node->target = strdup (target);
1129 new_node->next = NULL;
1131 *p = new_node;
1110 struct redefine_node *new_node; local
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_rar.c355 static int new_node(struct huffman_code *);
2465 if (new_node(code) < 0) {
2548 if ((repeatnode = new_node(code)) < 0) {
2553 if ((nextnode = new_node(code)) < 0) {
2573 if (new_node(code) < 0) {
2602 new_node(struct huffman_code *code) function

Completed in 223 milliseconds