podulelist2h.awk revision 1.2
1 #! /usr/bin/awk -f 2 # $NetBSD: podulelist2h.awk,v 1.2 2002/05/22 22:43:15 bjh21 Exp $ 3 # from: devlist2h.awk,v 1.2 1996/01/22 21:08:09 cgd Exp 4 # 5 # Copyright (c) 1996 Mark Brinicombe 6 # Copyright (c) 1995, 1996 Christopher G. Demetriou 7 # All rights reserved. 8 # 9 # Redistribution and use in source and binary forms, with or without 10 # modification, are permitted provided that the following conditions 11 # are met: 12 # 1. Redistributions of source code must retain the above copyright 13 # notice, this list of conditions and the following disclaimer. 14 # 2. Redistributions in binary form must reproduce the above copyright 15 # notice, this list of conditions and the following disclaimer in the 16 # documentation and/or other materials provided with the distribution. 17 # 3. All advertising materials mentioning features or use of this software 18 # must display the following acknowledgement: 19 # This product includes software developed by Mark Brinicombe 20 # 4. The name of the author may not be used to endorse or promote products 21 # derived from this software without specific prior written permission 22 # 23 # THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 24 # IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 25 # OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 26 # IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 27 # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 28 # NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 29 # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 30 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 31 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 32 # THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 33 # 34 BEGIN { 35 npodules = nvendors = 0 36 dfile="podule_data.h" 37 hfile="podules.h" 38 } 39 NR == 1 { 40 VERSION = $0 41 gsub("\\$", "", VERSION) 42 43 printf("/*\t\$NetBSD\$\t*/\n\n") > dfile 44 printf("/*\n") > dfile 45 printf(" * THIS FILE AUTOMATICALLY GENERATED. DO NOT EDIT.\n") \ 46 > dfile 47 printf(" *\n") > dfile 48 printf(" * generated from:\n") > dfile 49 printf(" *\t%s\n", VERSION) > dfile 50 printf(" */\n") > dfile 51 52 printf("/*\t\$NetBSD\$\t*/\n\n") > hfile 53 printf("/*\n") > hfile 54 printf(" * THIS FILE AUTOMATICALLY GENERATED. DO NOT EDIT.\n") \ 55 > hfile 56 printf(" *\n") > hfile 57 printf(" * generated from:\n") > hfile 58 printf(" *\t%s\n", VERSION) > hfile 59 printf(" */\n") > hfile 60 61 next 62 } 63 $1 == "manufacturer" { 64 nvendors++ 65 66 vendorindex[$2] = nvendors; # record index for this name, for later. 67 vendors[nvendors, 1] = $2; # name 68 vendors[nvendors, 2] = $3; # id 69 printf("#define\tMANUFACTURER_%s\t%s\t", vendors[nvendors, 1], 70 vendors[nvendors, 2]) > hfile 71 i = 3; f = 4; 72 73 # comments 74 ocomment = oparen = 0 75 if (f <= NF) { 76 printf("\t/* ") > hfile 77 ocomment = 1; 78 } 79 while (f <= NF) { 80 if ($f == "#") { 81 printf("(") > hfile 82 oparen = 1 83 f++ 84 continue 85 } 86 if (oparen) { 87 printf("%s", $f) > hfile 88 if (f < NF) 89 printf(" ") > hfile 90 f++ 91 continue 92 } 93 vendors[nvendors, i] = $f 94 printf("%s", vendors[nvendors, i]) > hfile 95 if (f < NF) 96 printf(" ") > hfile 97 i++; f++; 98 } 99 if (oparen) 100 printf(")") > hfile 101 if (ocomment) 102 printf(" */") > hfile 103 printf("\n") > hfile 104 105 next 106 } 107 $1 == "podule" { 108 npodules++ 109 110 podules[npodules, 1] = $2; # podule id 111 podules[npodules, 2] = $3; # id 112 printf("#define\tPODULE_%s\t%s\t", 113 podules[npodules, 1], podules[npodules, 2]) > hfile 114 115 i=3; f = 4; 116 117 # comments 118 ocomment = oparen = 0 119 if (f <= NF) { 120 printf("\t/* ") > hfile 121 ocomment = 1; 122 } 123 while (f <= NF) { 124 if ($f == "#") { 125 printf("(") > hfile 126 oparen = 1 127 f++ 128 continue 129 } 130 if (oparen) { 131 printf("%s", $f) > hfile 132 if (f < NF) 133 printf(" ") > hfile 134 f++ 135 continue 136 } 137 podules[npodules, i] = $f 138 printf("%s", podules[npodules, i]) > hfile 139 if (f < NF) 140 printf(" ") > hfile 141 i++; f++; 142 } 143 if (oparen) 144 printf(")") > hfile 145 if (ocomment) 146 printf(" */") > hfile 147 printf("\n") > hfile 148 149 next 150 } 151 { 152 if ($0 == "") 153 blanklines++ 154 print $0 > hfile 155 if (blanklines < 2) 156 print $0 > dfile 157 } 158 END { 159 # print out the match tables 160 161 printf("\n") > dfile 162 163 printf("static struct podule_description known_podules[] = {\n") > dfile 164 for (j = 1; j <= npodules; j++) { 165 printf("\t{ PODULE_%s,", podules[j, 1]) > dfile 166 printf("\t\"") > dfile 167 k = 3; 168 needspace = 0; 169 while (podules[j, k] != "") { 170 if (needspace) 171 printf(" ") > dfile 172 printf("%s", podules[j, k]) > dfile 173 needspace = 1 174 k++ 175 } 176 printf("\" },\n") > dfile 177 } 178 printf("\t{ 0x0000, NULL }\n") > dfile 179 printf("};\n\n") > dfile 180 181 printf("\n") > dfile 182 183 printf("struct manufacturer_description known_manufacturers[] = {\n") > dfile 184 for (i = 1; i <= nvendors; i++) { 185 printf("\t{ MANUFACTURER_%s, \t", vendors[i, 1]) > dfile 186 if (length(vendors[i, 1]) < 7) 187 printf("\t") > dfile 188 printf("\"") > dfile 189 j = 3; 190 needspace = 0; 191 while (vendors[i, j] != "") { 192 if (needspace) 193 printf(" ") > dfile 194 printf("%s", vendors[i, j]) > dfile 195 needspace = 1 196 j++ 197 } 198 printf("\" },\n") > dfile 199 } 200 printf("\t{ 0, NULL }\n") > dfile 201 printf("};\n") > dfile 202 } 203
Indexes created Sun Sep 28 16:09:52 GMT 2025