Lines Matching refs:root
24 t->root = tn_new (t, "root");
34 * starting at root. This also handles the nodes/leaves lists.
38 tn_delete (t->root);
55 tn_structure (t->root, 0);
68 int root = -1;
124 /* Iterate to locate the definition of root. Fails if there is none,
132 for (i = 0, j = 0, root = -1;
143 if (root >= 0) {
145 "error in serialization: multiple root nodes.",
150 root = j;
154 if (root < 0) {
156 "error in serialization: no root specified.",
163 * are ok. We use the information we have about root to skip
174 ASSERT_BOUNDS (root, nodes);
175 parent [root] = -1; /* Sensible, unused */
185 if (j == root)
225 * root. A tag means that the depth of the node can be computed, and
241 ASSERT_BOUNDS (root, nodes);
242 tag [root] = 1;
310 * into the proper structure per the root and parent
320 tn_delete (dst->root);
333 dst->root = nv [root];
343 if (j == root) {
373 tn_delete (dst->root);
374 dst->root = tn_dup (dst, src->root);