1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/*
* Copyright (c) 1995 Silicon Graphics, Inc. All Rights Reserved.
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2 of the License, or (at your
* option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include "pmapi.h"
#include "impl.h"
#include "pmnsutil.h"
static FILE *outf;
/*
* breadth-first traversal
*/
void
pmns_traverse(__pmnsNode *p, int depth, char *path, void(*func)(__pmnsNode *, int, char *))
{
char *newpath;
__pmnsNode *q;
if (p != NULL) {
/* breadth */
for (q = p; q != NULL; q = q->next)
(*func)(q, depth, path);
if (depth > 0)
(*func)(NULL, -1, NULL); /* end of level */
/* descend */
for (q = p; q != NULL; q = q->next) {
if (q->first != NULL) {
newpath = (char *)malloc(strlen(path)+strlen(q->name)+2);
if (depth == 0)
*newpath = '\0';
else if (depth == 1)
strcpy(newpath, q->name);
else {
strcpy(newpath, path);
strcat(newpath, ".");
strcat(newpath, q->name);
}
pmns_traverse(q->first, depth+1, newpath, func);
free(newpath);
}
}
}
}
/*
* generate an ASCII PMNS from the internal format produced by
* pmLoadNameSpace and friends
*/
static void
output(__pmnsNode *p, int depth, char *path)
{
static int lastdepth = -1;
if (depth == 0) {
fprintf(outf, "root {\n");
lastdepth = 1;
return;
}
else if (depth < 0) {
if (lastdepth > 0)
fprintf(outf, "}\n");
lastdepth = -1;
return;
}
else if (depth != lastdepth)
fprintf(outf, "\n%s {\n", path);
lastdepth = depth;
if (p->first != NULL)
fprintf(outf, "\t%s\n", p->name);
else {
if (pmid_domain(p->pmid) == DYNAMIC_PMID && pmid_item(p->pmid) == 0)
fprintf(outf, "\t%s\t%d:*:*\n", p->name, pmid_cluster(p->pmid));
else
fprintf(outf, "\t%s\t%d:%d:%d\n", p->name, pmid_domain(p->pmid), pmid_cluster(p->pmid), pmid_item(p->pmid));
}
}
void
pmns_output(__pmnsNode *root, FILE *f)
{
outf = f;
pmns_traverse(root, 0, "", output);
output(NULL, -2, NULL); /* special hack for null PMNS */
}
|
