Lines Matching defs:nodes
450 * This routine initializes the relevant fields of the nodes, so that
451 * the leaf is the left child of the parent node, and both nodes have
457 rn_newpair(v, b, nodes)
460 struct radix_node nodes[2];
462 struct radix_node *tt = nodes, *t = tt + 1;
482 rn_insert(v_arg, head, dupentry, nodes)
486 struct radix_node nodes[2];
541 t = rn_newpair(v_arg, b, nodes);
706 * nodes and possibly save time in calculating indices.
1180 * Allocate and initialize an empty tree. This has 3 nodes, which are