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
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
|
#
# Copyright (C) 2006 Daniel M. Eischen. All rights reserved.
#
# Redistribution and use in source and binary forms, with or without
# modification, are permitted provided that the following conditions
# are met:
# 1. Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# 2. Redistributions in binary form must reproduce the above copyright
# notice, this list of conditions and the following disclaimer in the
# documentation and/or other materials provided with the distribution.
#
# THIS SOFTWARE IS PROVIDED BY AUTHOR AND CONTRIBUTORS ``AS IS'' AND
# ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
# IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
# ARE DISCLAIMED. IN NO EVENT SHALL AUTHOR OR CONTRIBUTORS BE LIABLE
# FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
# DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
# OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
# HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
# LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
# OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
# SUCH DAMAGE.
#
# $FreeBSD$
#
#
# Make a list of all the library versions listed in the master file.
#
# versions[] - array indexed by version name, contains number
# of symbols (+ 1) found for each version.
# successors[] - array index by version name, contains successor
# version name.
# symbols[][] - array index by [version name, symbol index], contains
# names of symbols defined for each version.
# names[] - array index is symbol name and value is its first version seen,
# used to check for duplicate symbols and warn about them.
#
BEGIN {
brackets = 0;
errors = warns = 0;
version_count = 0;
current_version = "";
stderr = "/dev/stderr";
while (getline < vfile) {
# Strip comments.
sub("#.*$", "", $0);
# Strip leading and trailing whitespace.
sub("^[ \t]+", "", $0);
sub("[ \t]+$", "", $0);
if (/^[a-zA-Z0-9._]+[ \t]*{$/) {
# Strip brace.
sub("{", "", $1);
brackets++;
symver = $1;
versions[symver] = 1;
successors[symver] = "";
generated[symver] = 0;
version_count++;
}
else if (/^}[ \t]*[a-zA-Z0-9._]+[ \t]*;$/) {
v = $1 != "}" ? $1 : $2;
# Strip brace.
sub("}", "", v);
# Strip semicolon.
sub(";", "", v);
if (symver == "") {
printf("File %s: Unmatched bracket.\n",
vfile) > stderr;
errors++;
}
else if (versions[v] != 1) {
printf("File %s: `%s' has unknown " \
"successor `%s'.\n",
vfile, symver, v) > stderr;
errors++;
}
else
successors[symver] = v;
brackets--;
}
else if (/^}[ \t]*;$/) {
if (symver == "") {
printf("File %s: Unmatched bracket.\n",
vfile) > stderr;
errors++;
}
# No successor
brackets--;
}
else if (/^}$/) {
printf("File %s: Missing final semicolon.\n",
vfile) > stderr;
errors++;
}
else if (/^$/)
; # Ignore blank lines.
else {
printf("File %s: Unknown directive: `%s'.\n",
vfile, $0) > stderr;
errors++;
}
}
brackets = 0;
}
{
# Set meaningful filename for diagnostics.
filename = FILENAME != "" ? FILENAME : "<stdin>";
# Delete comments, preceding and trailing whitespace, then
# consume blank lines.
sub("#.*$", "", $0);
sub("^[ \t]+", "", $0);
sub("[ \t]+$", "", $0);
if ($0 == "")
next;
}
/^[a-zA-Z0-9._]+[ \t]*{$/ {
# Strip bracket from version name.
sub("{", "", $1);
if (current_version != "") {
printf("File %s, line %d: Illegal nesting detected.\n",
filename, FNR) > stderr;
errors++;
}
else if (versions[$1] == 0) {
printf("File %s, line %d: Undefined " \
"library version `%s'.\n", filename, FNR, $1) > stderr;
errors++;
# Remove this entry from the versions.
delete versions[$1];
}
else
current_version = $1;
brackets++;
next;
}
/^[a-zA-Z0-9._]+[ \t]*;$/ {
# Strip semicolon.
sub(";", "", $1);
if (current_version != "") {
count = versions[current_version];
versions[current_version]++;
symbols[current_version, count] = $1;
if ($1 in names && names[$1] != current_version) {
#
# A graver case when a dup symbol appears under
# different versions in the map. That can result
# in subtle problems with the library later.
#
printf("File %s, line %d: Duplicated symbol `%s' " \
"in version `%s', first seen in `%s'. " \
"Did you forget to move it to ObsoleteVersions?\n",
filename, FNR, $1,
current_version, names[$1]) > stderr;
errors++;
}
else if (names[$1] == current_version) {
#
# A harmless case: a dup symbol with the same version.
#
printf("File %s, line %d: warning: " \
"Duplicated symbol `%s' in version `%s'.\n",
filename, FNR, $1, current_version) > stderr;
warns++;
}
else
names[$1] = current_version;
}
else {
printf("File %s, line %d: Symbol `%s' outside version scope.\n",
filename, FNR, $1) > stderr;
errors++;
}
next;
}
/^}[ \t]*;$/ {
brackets--;
if (brackets < 0) {
printf("File %s, line %d: Unmatched bracket.\n",
filename, FNR, $1) > stderr;
errors++;
brackets = 0; # Reset
}
current_version = "";
next;
}
{
printf("File %s, line %d: Unknown directive: `%s'.\n",
filename, FNR, $0) > stderr;
errors++;
}
function print_version(v)
{
# This function is recursive, so return if this version
# has already been printed. Otherwise, if there is an
# ancestral version, recursively print its symbols before
# printing the symbols for this version.
#
if (generated[v] == 1)
return;
if (successors[v] != "")
print_version(successors[v]);
printf("%s {\n", v);
# The version count is always one more that actual,
# so the loop ranges from 1 to n-1.
#
for (i = 1; i < versions[v]; i++) {
if (i == 1)
printf("global:\n");
printf("\t%s;\n", symbols[v, i]);
}
version_count--;
if (version_count == 0) {
printf("local:\n");
printf("\t*;\n");
}
if (successors[v] == "")
printf("};\n");
else
printf("} %s;\n", successors[v]);
printf("\n");
generated[v] = 1;
}
END {
if (errors) {
printf("%d error(s) total.\n", errors) > stderr;
exit(1);
}
# OK, no errors.
for (v in versions) {
print_version(v);
}
}
|
