Lines Matching refs:subs
155 struct node_list subs;
161 struct node_list subs;
819 TAILQ_INIT(&node->u.entry.subs);
844 TAILQ_INSERT_TAIL(&node->u.entry.subs, sub, link);
851 TAILQ_INIT(&node->u.tree.subs);
855 TAILQ_INSERT_TAIL(&node->u.tree.subs, sub, link);
913 oid->subs[oid->len++] = np->id;
916 TAILQ_FOREACH(sub, &np->u.tree.subs, link)
922 TAILQ_FOREACH(sub, &np->u.entry.subs, link)
937 fprintf(fp, " %u,", oid->subs[n]);
1017 TAILQ_FOREACH(sub, &np->u.tree.subs, link)
1022 TAILQ_FOREACH(sub, &np->u.entry.subs, link)
1083 memcpy(oid.subs, prefix, sizeof(prefix));
1124 if (TAILQ_EMPTY(&np->u.tree.subs)) {
1128 TAILQ_FOREACH(sp, &np->u.tree.subs, link)
1140 TAILQ_FOREACH(sp, &np->u.entry.subs, link)
1162 oid->subs[oid->len++] = np->id;
1174 fprintf(fp, " %u,", oid->subs[n]);
1176 fprintf(fp, " %u,", idx->subs[n]);
1182 TAILQ_FOREACH(sub, &np->u.tree.subs, link)
1186 TAILQ_FOREACH(sub, &np->u.entry.subs, link)
1233 idx.subs[idx.len++] = ul;
1240 memcpy(oid.subs, prefix, sizeof(prefix));
1250 check_sub_order(const struct node *np, const struct node_list *subs)
1258 TAILQ_FOREACH(sub, subs, link) {
1281 check_sub_order(np, &np->u.entry.subs);
1284 TAILQ_FOREACH(sub, &np->u.entry.subs, link) {
1291 check_sub_order(np, &np->u.tree.subs);
1293 TAILQ_FOREACH(sub, &np->u.tree.subs, link)
1320 merge_subs(&n1->u.tree.subs, &n2->u.tree.subs);
1335 merge_subs(&n1->u.entry.subs,
1336 &n2->u.entry.subs);
1365 merge_subs(&(*root)->u.tree.subs, &t->u.tree.subs);