Home | History | Annotate | Line # | Download | only in pcmcia
devlist2h.awk revision 1.5
      1 #! /usr/bin/awk -f
      2 #	$NetBSD: devlist2h.awk,v 1.5 2003/10/22 00:12:36 christos Exp $
      3 #
      4 # Copyright (c) 1998 The NetBSD Foundation, Inc.
      5 # All rights reserved.
      6 #
      7 # This code is derived from software contributed to The NetBSD Foundation
      8 # by Christos Zoulas.
      9 #
     10 # Redistribution and use in source and binary forms, with or without
     11 # modification, are permitted provided that the following conditions
     12 # are met:
     13 # 1. Redistributions of source code must retain the above copyright
     14 #    notice, this list of conditions and the following disclaimer.
     15 # 2. Redistributions in binary form must reproduce the above copyright
     16 #    notice, this list of conditions and the following disclaimer in the
     17 #    documentation and/or other materials provided with the distribution.
     18 # 3. All advertising materials mentioning features or use of this software
     19 #    must display the following acknowledgement:
     20 #        This product includes software developed by the NetBSD
     21 #        Foundation, Inc. and its contributors.
     22 # 4. Neither the name of The NetBSD Foundation nor the names of its
     23 #    contributors may be used to endorse or promote products derived
     24 #    from this software without specific prior written permission.
     25 #
     26 # THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     27 # ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     28 # TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     29 # PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     30 # BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     31 # CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     32 # SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     33 # INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     34 # CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     35 # ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     36 # POSSIBILITY OF SUCH DAMAGE.
     37 #
     38 # Copyright (c) 1995, 1996 Christopher G. Demetriou
     39 # All rights reserved.
     40 #
     41 # Redistribution and use in source and binary forms, with or without
     42 # modification, are permitted provided that the following conditions
     43 # are met:
     44 # 1. Redistributions of source code must retain the above copyright
     45 #    notice, this list of conditions and the following disclaimer.
     46 # 2. Redistributions in binary form must reproduce the above copyright
     47 #    notice, this list of conditions and the following disclaimer in the
     48 #    documentation and/or other materials provided with the distribution.
     49 # 3. All advertising materials mentioning features or use of this software
     50 #    must display the following acknowledgement:
     51 #      This product includes software developed by Christopher G. Demetriou.
     52 #      This product includes software developed by Christos Zoulas
     53 # 4. The name of the author(s) may not be used to endorse or promote products
     54 #    derived from this software without specific prior written permission
     55 #
     56 # THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
     57 # IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
     58 # OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
     59 # IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
     60 # INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
     61 # NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
     62 # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
     63 # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
     64 # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
     65 # THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
     66 #
     67 function collectline(f, line) {
     68 	oparen = 0
     69 	line = ""
     70 	while (f <= NF) {
     71 		if ($f == "#") {
     72 			line = line "("
     73 			oparen = 1
     74 			f++
     75 			continue
     76 		}
     77 		if (oparen) {
     78 			line = line $f
     79 			if (f < NF)
     80 				line = line " "
     81 			f++
     82 			continue
     83 		}
     84 		line = line $f
     85 		if (f < NF)
     86 			line = line " "
     87 		f++
     88 	}
     89 	if (oparen)
     90 		line = line ")"
     91 	return line
     92 }
     93 BEGIN {
     94 	nproducts = nvendors = 0
     95 	dfile="pcmciadevs_data.h"
     96 	hfile="pcmciadevs.h"
     97 	line=""
     98 }
     99 NR == 1 {
    100 	VERSION = $0
    101 	gsub("\\$", "", VERSION)
    102 
    103 	printf("/*\t\$NetBSD\$\t*/\n\n") > dfile
    104 	printf("/*\n") > dfile
    105 	printf(" * THIS FILE AUTOMATICALLY GENERATED.  DO NOT EDIT.\n") \
    106 	    > dfile
    107 	printf(" *\n") > dfile
    108 	printf(" * generated from:\n") > dfile
    109 	printf(" *\t%s\n", VERSION) > dfile
    110 	printf(" */\n") > dfile
    111 
    112 	printf("/*\t\$NetBSD\$\t*/\n\n") > hfile
    113 	printf("/*\n") > hfile
    114 	printf(" * THIS FILE AUTOMATICALLY GENERATED.  DO NOT EDIT.\n") \
    115 	    > hfile
    116 	printf(" *\n") > hfile
    117 	printf(" * generated from:\n") > hfile
    118 	printf(" *\t%s\n", VERSION) > hfile
    119 	printf(" */\n") > hfile
    120 
    121 	next
    122 }
    123 $1 == "vendor" {
    124 	nvendors++
    125 
    126 	vendorindex[$2] = nvendors;		# record index for this name, for later.
    127 	vendors[nvendors, 1] = $2;		# name
    128 	vendors[nvendors, 2] = $3;		# id
    129 	printf("#define\tPCMCIA_VENDOR_%s\t%s\t", vendors[nvendors, 1],
    130 	    vendors[nvendors, 2]) > hfile
    131 	vendors[nvendors, 3] = collectline(4, line)
    132 	printf("/* %s */\n", vendors[nvendors, 3]) > hfile
    133 	next
    134 }
    135 $1 == "product" {
    136 	nproducts++
    137 
    138 	products[nproducts, 1] = $2;		# vendor name
    139 	products[nproducts, 2] = $3;		# product id
    140 	products[nproducts, 3] = $4;		# id
    141 
    142 	f = 5;
    143 
    144 	if ($4 == "{") {
    145 		products[nproducts, 3] = -1
    146 		z = "{ "
    147 		for (i = 0; i < 4; i++) {
    148 			if (f <= NF) {
    149 				gsub("&sp", " ", $f)
    150 				gsub("&tab", "\t", $f)
    151 				gsub("&nl", "\n", $f)
    152 				z = z $f " "
    153 				f++
    154 			}
    155 			else {
    156 				if (i == 3)
    157 					z = z "NULL "
    158 				else
    159 					z = z "NULL, "
    160 			}
    161 		}
    162 		products[nproducts, 4] = z $f
    163 		f++
    164 	}
    165 	else {
    166 		products[nproducts, 4] = "{ NULL, NULL, NULL, NULL }"
    167 	}
    168 	printf("#define\tPCMCIA_CIS_%s_%s\t%s\n",
    169 	    products[nproducts, 1], products[nproducts, 2],
    170 	    products[nproducts, 4]) > hfile
    171 	printf("#define\tPCMCIA_PRODUCT_%s_%s\t%s\n", products[nproducts, 1],
    172 	    products[nproducts, 2], products[nproducts, 3]) > hfile
    173 
    174 	products[nproducts, 5] = collectline(f, line)
    175 
    176 	printf("#define\tPCMCIA_STR_%s_%s\t\"%s\"\n",
    177 	    products[nproducts, 1], products[nproducts, 2],
    178 	    products[nproducts, 5]) > hfile
    179 
    180 	next
    181 }
    182 {
    183 	if ($0 == "")
    184 		blanklines++
    185 	print $0 > hfile
    186 	if (blanklines < 2)
    187 		print $0 > dfile
    188 }
    189 END {
    190 	# print out the match tables
    191 
    192 	printf("\n") > dfile
    193 
    194 	printf("struct pcmcia_knowndev {\n") > dfile
    195 	printf("\tint vendorid;\n") > dfile
    196 	printf("\tint productid;\n") > dfile
    197 	printf("\tstruct pcmcia_knowndev_cis {\n") > dfile
    198 	printf("\t\tchar *vendor;\n") > dfile
    199 	printf("\t\tchar *product;\n") > dfile
    200 	printf("\t\tchar *version;\n") > dfile
    201 	printf("\t\tchar *revision;\n") > dfile
    202 	printf("\t}cis;\n") > dfile
    203 	printf("\tint flags;\n") > dfile
    204 	printf("\tchar *vendorname;\n") > dfile
    205 	printf("\tchar *devicename;\n") > dfile
    206 	printf("\tint reserve;\n") > dfile
    207 	printf("};\n\n") > dfile
    208 	printf("#define	PCMCIA_CIS_INVALID\t\t{ NULL, NULL, NULL, NULL }\n") > dfile
    209 	printf("#define	PCMCIA_KNOWNDEV_NOPROD\t\t0\n\n") > dfile
    210 	printf("struct pcmcia_knowndev pcmcia_knowndevs[] = {\n") > dfile
    211 	for (i = 1; i <= nproducts; i++) {
    212 		printf("\t{\n") > dfile
    213 		if (products[i, 3] == -1) {
    214 			printf("\t    PCMCIA_VENDOR_UNKNOWN, PCMCIA_PRODUCT_%s_%s,\n",
    215 			    products[i, 1], products[i, 2]) > dfile
    216 		} else {
    217 			printf("\t    PCMCIA_VENDOR_%s, PCMCIA_PRODUCT_%s_%s,\n",
    218 			    products[i, 1], products[i, 1], products[i, 2]) > dfile
    219 		}
    220 		printf("\t    PCMCIA_CIS_%s_%s,\n", 
    221 		    products[i, 1], products[i, 2]) > dfile
    222 		printf("\t    ") > dfile
    223 		printf("0") > dfile
    224 		printf(",\n") > dfile
    225 
    226 		vendi = vendorindex[products[i, 1]];
    227 		printf("\t    \"%s\",\n", vendors[vendi, 3]) > dfile
    228 		printf("\t    \"%s\",\t}\n", products[i, 5]) > dfile
    229 		printf("\t,\n") > dfile
    230 	}
    231 	for (i = 1; i <= nvendors; i++) {
    232 		printf("\t{\n") > dfile
    233 		printf("\t    PCMCIA_VENDOR_%s,\n", vendors[i, 1]) > dfile
    234 		printf("\t    PCMCIA_KNOWNDEV_NOPROD,\n") > dfile
    235 		printf("\t    PCMCIA_CIS_INVALID,\n") > dfile
    236 		printf("\t    0,\n") > dfile
    237 		printf("\t    \"%s\",\n", vendors[i, 3]) > dfile
    238 		printf("\t    NULL,\n") > dfile
    239 		printf("\t},\n") > dfile
    240 	}
    241 	printf("\t{ 0, 0, { NULL, NULL, NULL, NULL }, 0, NULL, NULL, }\n") > dfile
    242 	printf("};\n") > dfile
    243 }
    244