Searched refs:newnode (Results 1 – 3 of 3) sorted by relevance
40 struct hashtab_node *prev, *cur, *newnode; in hashtab_insert() local57 newnode = xzalloc(struct hashtab_node); in hashtab_insert()58 if ( newnode == NULL ) in hashtab_insert()60 newnode->key = key; in hashtab_insert()61 newnode->datum = datum; in hashtab_insert()64 newnode->next = prev->next; in hashtab_insert()65 prev->next = newnode; in hashtab_insert()69 newnode->next = h->htable[hvalue]; in hashtab_insert()70 h->htable[hvalue] = newnode; in hashtab_insert()
42 struct sidtab_node *prev, *cur, *newnode; in sidtab_insert() local65 newnode = xmalloc(struct sidtab_node); in sidtab_insert()66 if ( newnode == NULL ) in sidtab_insert()71 newnode->sid = sid; in sidtab_insert()72 if ( context_cpy(&newnode->context, context) ) in sidtab_insert()74 xfree(newnode); in sidtab_insert()81 newnode->next = prev->next; in sidtab_insert()83 prev->next = newnode; in sidtab_insert()87 newnode->next = s->htable[hvalue]; in sidtab_insert()89 s->htable[hvalue] = newnode; in sidtab_insert()
43 if ( newnode == NULL ) in avtab_insert_node()45 newnode->key = *key; in avtab_insert_node()46 newnode->datum = *datum; in avtab_insert_node()49 newnode->next = prev->next; in avtab_insert_node()50 prev->next = newnode; in avtab_insert_node()54 newnode->next = h->htable[hvalue]; in avtab_insert_node()55 h->htable[hvalue] = newnode; in avtab_insert_node()59 return newnode; in avtab_insert_node()66 struct avtab_node *prev, *cur, *newnode; in avtab_insert() local93 if( !newnode ) in avtab_insert()[all …]
Completed in 5 milliseconds