Lines Matching defs:new
582 /* We will replace this node 'inode' with two new
584 * original children. The two new nodes will have
594 * two new keys.
606 /* populate child pointers in new nodes */
614 /* link new nodes to parent */
731 /* update stride and slen based on new value */
1110 struct fib_alias *new, t_key key)
1114 l = leaf_new(key, new);
1123 * Add a new tnode here
1146 /* Case 3: n is NULL, and will just insert a new leaf */
1147 node_push_suffix(tp, new->fa_slen);
1160 struct key_vector *l, struct fib_alias *new,
1164 return fib_insert_node(t, tp, new, key);
1167 hlist_add_before_rcu(&new->fa_list, &fa->fa_list);
1172 if (new->fa_slen < last->fa_slen)
1174 if ((new->fa_slen == last->fa_slen) &&
1175 (new->tb_id > last->tb_id))
1181 hlist_add_behind_rcu(&new->fa_list, &fa->fa_list);
1183 hlist_add_head_rcu(&new->fa_list, &l->leaf);
1187 if (l->slen < new->fa_slen) {
1188 l->slen = new->fa_slen;
1189 node_push_suffix(tp, new->fa_slen);
1249 * exists or to the node before which we will insert new one.
1251 * If fa is NULL, we will need to allocate a new one and
1253 * of the new alias.
1377 /* Insert new entry to the list. */
1828 /* Rescan start scanning in new node */
1926 /* clone fa for new local table */
2731 /* new hash chain */