/freebsd-current/contrib/ntp/ntpd/ |
H A D | ntp_prio_q.c | 83 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-current/contrib/kyua/utils/config/ |
H A D | nodes.cpp | 76 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 D | tree.cpp | 123 _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 D | lua_module_test.cpp | 70 std::auto_ptr< custom_node > new_node(new custom_node()); 71 new_node->_value = _value; 72 return new_node.release();
|
H A D | tree_test.cpp | 79 std::auto_ptr< wrapped_int_node > new_node(new wrapped_int_node()); 80 new_node->_value = _value; 81 return new_node.release();
|
/freebsd-current/contrib/googletest/googletest/samples/ |
H A D | sample3-inl.h | 115 QueueNode<E>* new_node = new QueueNode<E>(element); local 118 head_ = last_ = new_node; 121 last_->next_ = new_node; 122 last_ = new_node;
|
/freebsd-current/sys/contrib/openzfs/include/os/linux/spl/sys/ |
H A D | list.h | 200 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-current/contrib/kyua/model/ |
H A D | metadata.cpp | 78 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-current/contrib/kyua/engine/ |
H A D | config.cpp | 133 std::auto_ptr< user_node > new_node(new user_node()); 134 new_node->_value = _value; 135 return new_node.release();
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/profile/ |
H A D | GCDAProfiling.c | 114 struct fn_node* new_node = malloc(sizeof(struct fn_node)); local 115 new_node->fn = fn; 116 new_node->next = NULL; 117 new_node->id = CURRENT_ID; 120 list->head = list->tail = new_node; 122 list->tail->next = new_node; 123 list->tail = new_node;
|
/freebsd-current/contrib/jemalloc/src/ |
H A D | prof.c | 378 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-current/contrib/ofed/libibverbs/ |
H A D | memory.c | 527 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-current/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 142 Node &new_node = nodes[s]; local 143 new_node.store(s, args, h); 144 new_node.link = s2;
|
/freebsd-current/contrib/ldns/ |
H A D | dnssec_zone.c | 633 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 1122 ldns_rbnode_t *cur_node, *next_node, *new_node; local [all...] |
/freebsd-current/tools/regression/geom/ConfCmp/ |
H A D | ConfCmp.c | 78 new_node(void) function 112 np = new_node(); 180 mt->top = new_node();
|
/freebsd-current/sys/contrib/openzfs/module/avl/ |
H A D | avl.c | 620 avl_add(avl_tree_t *tree, void *new_node) argument 624 VERIFY(avl_find(tree, new_node, &where) == NULL); 626 avl_insert(tree, new_node, where);
|
/freebsd-current/sys/contrib/openzfs/module/zfs/ |
H A D | btree.c | 615 uint32_t offset, zfs_btree_hdr_t *new_node, void *buf) 619 ASSERT3P(par_hdr, ==, new_node->bth_parent); 632 parent->btc_children[offset + 1] = new_node; 638 * Insert new_node into the parent of old_node directly after old_node, with 643 zfs_btree_hdr_t *new_node, void *buf) 645 ASSERT3P(old_node->bth_parent, ==, new_node->bth_parent); 664 old_node->bth_parent = new_node->bth_parent = new_root; 666 new_root->btc_children[1] = new_node; 677 * new_node. 694 zfs_btree_insert_core_impl(tree, parent, offset, new_node, bu 614 zfs_btree_insert_core_impl(zfs_btree_t *tree, zfs_btree_core_t *parent, uint32_t offset, zfs_btree_hdr_t *new_node, void *buf) argument 642 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-current/sys/gnu/gcov/ |
H A D | gcov_fs.c | 603 new_node(struct gcov_node *parent, struct gcov_info *info, const char *name) function 732 node = new_node(parent, NULL, curr); 739 node = new_node(parent, info, curr);
|
/freebsd-current/contrib/ofed/opensm/opensm/ |
H A D | osm_ucast_dfsssp.c | 545 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-current/contrib/ofed/infiniband-diags/src/ |
H A D | ibtracert.c | 461 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-current/sys/dev/ice/ |
H A D | ice_sched.c | 988 struct ice_sched_node *prev, *new_node; local 1044 new_node = ice_sched_find_node_by_teid(parent, teid); 1045 if (!new_node) { 1050 new_node->sibling = NULL; 1051 new_node->tc_num = tc_node->tc_num; 1056 if (prev && prev != new_node) { 1059 prev->sibling = new_node; 1064 pi->sib_head[tc_node->tc_num][layer] = new_node;
|
/freebsd-current/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_rar.c | 429 static int new_node(struct huffman_code *); 2614 if (new_node(code) < 0) { 2697 if ((repeatnode = new_node(code)) < 0) { 2702 if ((nextnode = new_node(code)) < 0) { 2722 if (new_node(code) < 0) { 2751 new_node(struct huffman_code *code) function
|
/freebsd-current/sys/amd64/amd64/ |
H A D | pmap.c | 11386 struct pmap_pkru_range *node, *new_node; local 11388 new_node = uma_zalloc(pmap_pkru_ranges_zone, M_NOWAIT); 11389 if (new_node == NULL) 11392 memcpy(new_node, node, sizeof(*node)); 11393 return (new_node);
|
/freebsd-current/sys/arm64/arm64/ |
H A D | pmap.c | 9213 struct rs_el *node, *new_node; 9215 new_node = uma_zalloc(pmap_bti_ranges_zone, M_NOWAIT); local 9216 if (new_node == NULL) 9219 memcpy(new_node, node, sizeof(*node)); 9220 return (new_node);
|