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
|
#!/usr/bin/awk -f
#
# $FreeBSD$
#-
# Copyright (c) 2004 Mark Santcroos <marks@ripe.net>
# 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 THE 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 THE 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.
#
BEGIN {
OUTPUT="acpi_quirks.h"
}
# Print header and id
NR == 1 {
VERSION = $0;
gsub("\^# ", "", VERSION)
gsub("\\$", "", VERSION)
printf("/*\n") > OUTPUT;
printf(" * THIS FILE IS AUTOMAGICALLY GENERATED. DO NOT EDIT.\n") \
> OUTPUT;
printf(" *\n") > OUTPUT;
printf(" * Generated from:\n") > OUTPUT;
printf(" * %s\n", VERSION) > OUTPUT;
printf(" */\n\n") > OUTPUT;
}
# Ignore comments and empty lines
/^#/, NF == 0 {
}
#
# NAME field: this is the first line of every entry
#
$1 == "name:" {
ENTRY_NAME = $2;
printf("const struct acpi_q_rule %s[] = {\n", ENTRY_NAME) > OUTPUT;
}
#
# OEM field
#
$1 == "oem:" {
LENGTH = length();
# Parse table type to match
TABLE = $2;
# Parse OEM ID
M = match ($0, /\"[^\"]*\"/);
OEM_ID = substr($0, M, RLENGTH);
# Parse OEM Table ID
ANCHOR = LENGTH - (M + RLENGTH - 1);
REMAINDER = substr($0, M + RLENGTH, ANCHOR);
M = match (REMAINDER, /\"[^\"]*\"/);
OEM_TABLE_ID = substr(REMAINDER, M, RLENGTH);
printf("\t{ \"%s\", OEM, {%s}, {%s} },\n",
TABLE, OEM_ID, OEM_TABLE_ID) > OUTPUT;
}
#
# CREATOR field
#
$1 == "creator:" {
# Parse table type to match
TABLE = $2;
M = match ($0, /\"[^\"]*\"/);
CREATOR = substr($0, M, RLENGTH);
printf("\t{ \"%s\", CREATOR, {%s} },\n",
TABLE, CREATOR) > OUTPUT;
}
#
# OEM REVISION field
#
$1 == "oem_rev:" {
TABLE = $2;
SIGN = $3;
VALUE = $4;
# Parse operand
OPERAND = trans_sign(SIGN);
printf("\t{ \"%s\", OEM_REV, {.op = %s}, {.rev = %s} },\n",
TABLE, OPERAND, VALUE) > OUTPUT;
}
#
# CREATOR REVISION field
#
$1 == "creator_rev:" {
TABLE = $2;
SIGN = $3;
VALUE = $4;
# Parse operand
OPERAND = trans_sign(SIGN);
printf("\t{ \"%s\", CREATOR_REV, {.op = %s}, {.rev = %s} },\n",
TABLE, OPERAND, VALUE) > OUTPUT;
}
#
# QUIRKS field: This is the last line of every entry
#
$1 == "quirks:" {
printf("\t{ \"\" }\n};\n\n") > OUTPUT;
QUIRKS = $0;
sub(/^quirks:[ ]*/ , "", QUIRKS);
QUIRK_COUNT++;
QUIRK_LIST[QUIRK_COUNT] = QUIRKS;
QUIRK_NAME[QUIRK_COUNT] = ENTRY_NAME;
}
#
# All information is gathered, now create acpi_quirks_table
#
END {
# Header
printf("const struct acpi_q_entry acpi_quirks_table[] = {\n") \
> OUTPUT;
# Array of all quirks
for (i = 1; i <= QUIRK_COUNT; i++) {
printf("\t{ %s, %s },\n", QUIRK_NAME[i], QUIRK_LIST[i]) \
> OUTPUT;
}
# Footer
printf("\t{ NULL, 0 }\n") > OUTPUT;
printf("};\n") > OUTPUT;
exit(0);
}
#
# Translate math SIGN into verbal OPERAND
#
function trans_sign(TMP_SIGN)
{
if (TMP_SIGN == "=")
TMP_OPERAND = "OP_EQL";
else if (TMP_SIGN == "!=")
TMP_OPERAND = "OP_NEQ";
else if (TMP_SIGN == "<=")
TMP_OPERAND = "OP_LEQ";
else if (TMP_SIGN == ">=")
TMP_OPERAND = "OP_GEQ";
else if (TMP_SIGN == ">")
TMP_OPERAND = "OP_GTR";
else if (TMP_SIGN == "<")
TMP_OPERAND = "OP_LES";
else {
printf("error: unknown sign: " TMP_SIGN "\n");
exit(1);
}
return (TMP_OPERAND);
}
|
