| /src/sbin/restore/ |
| utilities.c | 78 newnode(ep);
141 newnode(struct entry *np) function
146 badentry(np, "newnode: not a node");
|
| /src/external/bsd/unbound/dist/edns-subnet/ |
| addrtree.c | 365 struct addrnode *newnode, *node; local
404 newnode = node_create(tree, elem, scope, ttl);
405 if (!newnode) return;
406 if (!edge_create(newnode, addr, sourcemask, node,
408 clean_node(tree, newnode);
410 free(newnode);
413 tree->size_bytes += node_size(tree, newnode);
414 lru_push(tree, newnode);
431 if (!(newnode = node_create(tree, NULL, 0, 0)))
434 if (!edge_create(newnode, addr, common, node, index))
[all...] |
| /src/external/mpl/bind/dist/lib/dns/ |
| nametree.c | 123 newnode(isc_mem_t *mctx, const dns_name_t *name) { function
162 new = newnode(nametree->mctx, name);
167 new = newnode(nametree->mctx, name);
188 new = newnode(nametree->mctx, name);
235 dns_ntnode_t *new = newnode(nametree->mctx, name);
|
| keytable.c | 235 dns_keynode_t *newnode = NULL; local
277 newnode = new_keynode(&knode->name, NULL, keytable, knode->managed,
286 add_ds(newnode, &ds0, keytable->mctx);
294 result = dns_qp_insert(qp, newnode, 0);
352 dns_keynode_t *newnode = NULL; local
368 newnode = new_keynode(keyname, ds, keytable, managed, initial);
369 result = dns_qp_insert(qp, newnode, 0);
|
| nsec3.c | 533 dns_dbnode_t *newnode = NULL; local
594 result = dns_db_findnsec3node(db, hashname, false, &newnode);
614 * Seek the iterator to the 'newnode'.
619 result = dns_db_findrdataset(db, newnode, version, dns_rdatatype_nsec3,
745 if (newnode == NULL) {
746 CHECK(dns_db_findnsec3node(db, hashname, true, &newnode));
767 dns_db_detachnode(db, &newnode);
793 CHECK(dns_db_findnsec3node(db, hashname, true, &newnode));
794 result = dns_db_findrdataset(db, newnode, version,
801 dns_db_detachnode(db, &newnode);
[all...] |
| /src/sys/dev/microcode/aic7xxx/ |
| aicasm_symbol.c | 225 symbol_node_t *newnode; local
227 newnode = (symbol_node_t *)malloc(sizeof(symbol_node_t));
228 if (newnode == NULL) {
232 newnode->symbol = symbol;
258 && (curnode->symbol->type > newnode->symbol->type
259 || (curnode->symbol->type == newnode->symbol->type
261 newnode->symbol->info.finfo->value))))
263 newnode->symbol->info.rinfo->address))) {
264 SLIST_INSERT_HEAD(symlist, newnode, links);
270 SLIST_INSERT_AFTER(curnode, newnode,
[all...] |
| /src/external/gpl2/xcvs/dist/src/ |
| fileattr.c | 112 Node *newnode; local
120 newnode = getnode ();
121 newnode->type = FILEATTR;
122 newnode->delproc = fileattr_delproc;
123 newnode->key = xstrdup (line + 1);
124 newnode->data = xstrdup (p);
125 if (addnode (attrlist, newnode) != 0)
130 freenode (newnode);
|
| /src/sys/fs/v7fs/ |
| v7fs_vnops.c | 244 struct v7fs_node *newnode = (*a->a_vpp)->v_data; local
245 newnode->update_ctime = true;
246 newnode->update_mtime = true;
247 newnode->update_atime = true;
297 struct v7fs_node *newnode = (*a->a_vpp)->v_data; local
298 newnode->update_ctime = true;
299 newnode->update_mtime = true;
300 newnode->update_atime = true;
871 struct v7fs_node *newnode = (*a->a_vpp)->v_data; local
872 newnode->update_ctime = true
1312 struct v7fs_node *newnode = (*a->a_vpp)->v_data; local
[all...] |
| /src/usr.sbin/ofctl/ |
| ofctl.c | 143 struct of_node *newnode; local
144 newnode = malloc(sizeof(*newnode));
145 if (newnode == NULL)
146 err(1, "malloc(%zu)", sizeof(*newnode));
150 memset(newnode, 0, sizeof(*newnode));
151 TAILQ_INIT(&newnode->of_children);
152 TAILQ_INIT(&newnode->of_properties);
153 newnode->of_parent = parent
[all...] |
| /src/external/bsd/unbound/dist/util/data/ |
| msgencode.c | 215 struct compress_tree_node* newnode; local
226 if(!(newnode = compress_tree_newnode(dname, labs, offset,
234 * so is larger than newnode, thus goes right. */
235 newnode->right = prevnode;
236 prevnode->parent = newnode;
243 prevnode = newnode;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-vect-slp-patterns.cc | 1160 slp_tree newnode local
1171 SLP_TREE_CHILDREN (*this->m_node)[1] = newnode;
1178 slp_tree newnode local
1189 SLP_TREE_CHILDREN (*this->m_node)[1] = newnode;
1363 slp_tree newnode = local
1376 SLP_TREE_CHILDREN (*this->m_node).quick_push (newnode);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-vect-slp-patterns.cc | 1152 slp_tree newnode local
1163 SLP_TREE_CHILDREN (*this->m_node)[1] = newnode;
1170 slp_tree newnode local
1181 SLP_TREE_CHILDREN (*this->m_node)[1] = newnode;
1347 slp_tree newnode = local
1360 SLP_TREE_CHILDREN (*this->m_node).quick_push (newnode);
|
| /src/sys/net80211/ |
| ieee80211_node.c | 1290 int newnode = 0; local
1312 newnode = 1;
1317 dump_probe_beacon(subtype, newnode, wh->i_addr2, sp);
1366 if (!newnode)
|
| /src/external/mpl/dhcp/bind/dist/lib/dns/ |
| nsec3.c | 548 dns_dbnode_t *newnode = NULL; local
609 CHECK(dns_db_findnsec3node(db, hashname, true, &newnode));
612 * Seek the iterator to the 'newnode'.
617 result = dns_db_findrdataset(db, newnode, version, dns_rdatatype_nsec3,
762 dns_db_detachnode(db, &newnode);
788 CHECK(dns_db_findnsec3node(db, hashname, true, &newnode));
789 result = dns_db_findrdataset(db, newnode, version,
796 dns_db_detachnode(db, &newnode);
885 dns_db_detachnode(db, &newnode);
901 if (newnode != NULL)
[all...] |
| /src/sys/arch/sparc64/dev/ |
| lom.c | 269 const struct sysctlnode *node = NULL, *newnode; local
365 sysctl_createv(NULL, 0, NULL, &newnode,
370 if (newnode != NULL)
371 sc->sc_sysctl_num[i] = newnode->sysctl_num;
|
| /src/external/cddl/osnet/dist/uts/common/fs/zfs/ |
| zfs_acl.c | 1326 zfs_acl_node_t *newnode; local
1338 newnode = zfs_acl_node_alloc((abstract_size * 6) + aclp->z_acl_bytes);
1340 zacep = newnode->z_acldata;
1431 newnode->z_ace_count = new_count;
1432 newnode->z_size = new_bytes;
1433 list_insert_tail(&aclp->z_acl, newnode);
|
| /src/external/bsd/zstd/dist/tests/ |
| paramgrill.c | 789 winner_ll_node* newnode = malloc(sizeof(winner_ll_node)); local
790 if(newnode == NULL) {
793 newnode->res = cur_node->res;
795 newnode->next = cur_node->next;
796 cur_node->next = newnode;
816 winner_ll_node* newnode = malloc(sizeof(winner_ll_node)); local
817 if(newnode == NULL) {
820 newnode->res = w;
821 newnode->next = NULL;
822 cur_node->next = newnode;
827 winner_ll_node* newnode = malloc(sizeof(winner_ll_node)); local
[all...] |
