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
|
# awk script to merge a config-specific .symlist file with others.
# The input files should be existing .abilist files, and a .symlist
# file. This must be run with awk -v config=REGEXP to specify a
# regexp matching configuration tuples for which the .symlist input
# defines an ABI. The result merges all duplicate occurrences of any
# symbol into a stanza listing the regexps matching configurations
# that contain it and giving associated versions.
# The merged file contains stanzas in the form:
# GLIBC_x.y regexp...
# | GLIBC_x.y.z regexp...
# | GLIBC_m.n regexp...
# function F
# variable D 0x4
/^[^| ]/ {
if (NF < 2 && config == "") {
print "BAD LINE:", $0 > "/dev/stderr";
exit 2;
}
if (NF < 2) {
current = $1 ":" config;
}
else {
# Filter out the old stanzas from the config we are merging in.
# That way, if a set disappears from the .symlist file for this
# config, the old stanza doesn't stay in the merged output tagged
# for this config. (Disappearing sets might happen during development,
# and between releases could happen on a soname change).
nc = 0;
for (i = 2; i <= NF; ++i)
if ($i != config)
c[nc++] = $i;
if (nc == 0)
current = "";
else {
current = $1 ":" c[0];
for (i = 1; i < nc; ++i)
current = current "," $1 ":" c[i];
}
}
next;
}
/^\| / {
if (NF < 3) {
print "BAD LINE:", $0 > "/dev/stderr";
exit 2;
}
nc = 0;
for (i = 3; i <= NF; ++i)
if ($i != config)
c[nc++] = $i;
for (i = 0; i < nc; ++i)
current = current "," $2 ":" c[i];
next;
}
{
if (current == "") next;
ns = split(seen[$0], s, ",");
nc = split(current, c, ",");
for (i = 1; i <= nc; ++i) {
# Sorted insert.
for (j = 1; j <= ns; ++j) {
if (c[i] < s[j]) {
for (k = ns; k >= j; --k)
s[k + 1] = s[k];
s[j] = c[i];
++ns;
break;
}
}
if (j >= ns)
s[++ns] = c[i];
}
seen[$0] = s[1];
for (i = 2; i <= ns; ++i)
seen[$0] = seen[$0] "," s[i];
next;
}
END {
for (line in seen) {
if (seen[line] in stanzas)
stanzas[seen[line]] = stanzas[seen[line]] "\n" line;
else
stanzas[seen[line]] = line;
}
ns = split("", s);
for (configs in stanzas) {
# Sorted insert.
for (j = 1; j <= ns; ++j)
if (configs < s[j]) {
for (k = ns; k >= j; --k)
s[k + 1] = s[k];
s[j] = configs;
++ns;
break;
}
if (j >= ns)
s[++ns] = configs;
}
# S[1..NS] is now a sorted list of stanza identifiers.
# STANZAS[ID] contains the lines for that stanza.
# All we have to do is pretty-print the stanza ID,
# and then print the sorted list.
for (i = 1; i <= ns; ++i) {
# S[I] is a sorted, comma-separated list of SET:CONFIG pairs.
# All we have to do is pretty-print them.
nc = split(s[i], c, ",");
lastvers = "";
for (j = 1; j <= nc; ++j) {
split(c[j], temp, ":");
version = temp[1];
conf = temp[2];
if (version != lastvers)
printf "%s%s", (lastvers != "" ? "\n| " : ""), version;
printf " %s", conf;
lastvers = version;
}
print "";
outpipe = "sort";
print stanzas[s[i]] | outpipe;
close(outpipe);
}
}
|
