newnode
void newnode(struct entry *);
newnode(ep);
newnode(ep);
newnode(ip);
newnode(ep);
newnode(ep);
struct compress_tree_node* newnode;
if(!(newnode = compress_tree_newnode(dname, labs, offset,
newnode->right = prevnode;
prevnode->parent = newnode;
prevnode = newnode;
symbol_node_t *newnode;
newnode = (symbol_node_t *)malloc(sizeof(symbol_node_t));
if (newnode == NULL) {
newnode->symbol = symbol;
&& (curnode->symbol->type > newnode->symbol->type
|| (curnode->symbol->type == newnode->symbol->type
newnode->symbol->info.finfo->value))))
newnode->symbol->info.rinfo->address))) {
SLIST_INSERT_HEAD(symlist, newnode, links);
SLIST_INSERT_AFTER(curnode, newnode,
SLIST_INSERT_AFTER(curnode, newnode,
SLIST_INSERT_HEAD(symlist, newnode, links);
cd9660_translate_node_common(iso9660_disk *diskStructure, cd9660node *newnode)
(void)cd9660_convert_filename(diskStructure, newnode->node->name,
temp, sizeof temp, !(S_ISDIR(newnode->node->type)));
if (S_ISDIR(newnode->node->type))
cd9660_populate_iso_dir_record(newnode->isoDirRecord, 0,
cd9660_time_915(newnode->isoDirRecord->date, tstamp);
cd9660_bothendian_dword(newnode->fileDataLength,
newnode->isoDirRecord->size);
if (S_ISLNK(newnode->node->type))
newnode->fileDataLength = 0;
cd9660node *newnode)
newnode->isoDirRecord = emalloc(sizeof(*newnode->isoDirRecord));
newnode->node = node;
newnode->fileDataLength = node->inode->st.st_size;
if (cd9660_translate_node_common(diskStructure, newnode) == 0)
cd9660_time_915(newnode->isoDirRecord->date,
struct addrnode *newnode, *node;
newnode = node_create(tree, elem, scope, ttl);
if (!newnode) return;
if (!edge_create(newnode, addr, sourcemask, node,
clean_node(tree, newnode);
free(newnode);
tree->size_bytes += node_size(tree, newnode);
lru_push(tree, newnode);
if (!(newnode = node_create(tree, NULL, 0, 0)))
if (!edge_create(newnode, addr, common, node, index)) {
clean_node(tree, newnode);
free(newnode);
lru_push(tree, newnode);
newnode->edge[index] = edge;
edge->parent_node = newnode;
newnode->elem = elem;
newnode->scope = scope;
newnode->ttl = ttl;
newnode->only_match_scope_zero = only_match_scope_zero;
tree->size_bytes += node_size(tree, newnode);
node = newnode;
newnode = node_create(tree, elem, scope, ttl);
if (!edge_create(newnode, addr, sourcemask, node,
clean_node(tree, newnode);
free(newnode);
tree->size_bytes += node_size(tree, newnode);
lru_push(tree, newnode);
struct compress_tree_node* newnode;
if(!(newnode = compress_tree_newnode(dname, labs, offset,
newnode->right = prevnode;
prevnode->parent = newnode;
prevnode = newnode;