2 # $Id: MKtermsort.sh,v 1.17 2022/02/05 20:39:41 tom Exp $
4 # MKtermsort.sh -- generate indirection vectors for the various sort methods
6 ##############################################################################
7 # Copyright 2020-2021,2022 Thomas E. Dickey #
8 # Copyright 1998-2015,2017 Free Software Foundation, Inc. #
10 # Permission is hereby granted, free of charge, to any person obtaining a #
11 # copy of this software and associated documentation files (the "Software"), #
12 # to deal in the Software without restriction, including without limitation #
13 # the rights to use, copy, modify, merge, publish, distribute, distribute #
14 # with modifications, sublicense, and/or sell copies of the Software, and to #
15 # permit persons to whom the Software is furnished to do so, subject to the #
16 # following conditions: #
18 # The above copyright notice and this permission notice shall be included in #
19 # all copies or substantial portions of the Software. #
21 # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR #
22 # IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, #
23 # FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL #
24 # THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER #
25 # LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING #
26 # FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER #
27 # DEALINGS IN THE SOFTWARE. #
29 # Except as contained in this notice, the name(s) of the above copyright #
30 # holders shall not be used in advertising or otherwise to promote the sale, #
31 # use or other dealings in this Software without prior written #
33 ##############################################################################
35 # The output of this script is C source for nine arrays that list three sort
36 # orders for each of the three different classes of terminfo capabilities.
38 # keep the order independent of locale:
39 if test "${LANGUAGE+set}" = set; then LANGUAGE=C; export LANGUAGE; fi
40 if test "${LANG+set}" = set; then LANG=C; export LANG; fi
41 if test "${LC_ALL+set}" = set; then LC_ALL=C; export LC_ALL; fi
42 if test "${LC_MESSAGES+set}" = set; then LC_MESSAGES=C; export LC_MESSAGES; fi
43 if test "${LC_CTYPE+set}" = set; then LC_CTYPE=C; export LC_CTYPE; fi
44 if test "${LC_COLLATE+set}" = set; then LC_COLLATE=C; export LC_COLLATE; fi
47 DATA=${2-../include/Caps}
50 trap 'rm -f $data; exit 1' 1 2 3 15
51 sed -e 's/[ ][ ]*/ /g' < "$DATA" >$data
56 * termsort.h --- sort order arrays for use by infocmp.
58 * Note: this file is generated using MKtermsort.sh, do not edit by hand.
65 typedef unsigned PredType;
66 typedef unsigned PredIdx;
71 echo "static const PredIdx bool_terminfo_sort[] = {";
75 $3 == "bool" {printf("%s\t%d\n", $2, i++);}
76 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
80 echo "static const PredIdx num_terminfo_sort[] = {";
84 $3 == "num" {printf("%s\t%d\n", $2, i++);}
85 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
89 echo "static const PredIdx str_terminfo_sort[] = {";
93 $3 == "str" {printf("%s\t%d\n", $2, i++);}
94 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
98 echo "static const PredIdx bool_variable_sort[] = {";
102 $3 == "bool" {printf("%s\t%d\n", $1, i++);}
103 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
107 echo "static const PredIdx num_variable_sort[] = {";
111 $3 == "num" {printf("%s\t%d\n", $1, i++);}
112 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
116 echo "static const PredIdx str_variable_sort[] = {";
120 $3 == "str" {printf("%s\t%d\n", $1, i++);}
121 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
125 echo "static const PredIdx bool_termcap_sort[] = {";
129 $3 == "bool" {printf("%s\t%d\n", $4, i++);}
130 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
134 echo "static const PredIdx num_termcap_sort[] = {";
138 $3 == "num" {printf("%s\t%d\n", $4, i++);}
139 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
143 echo "static const PredIdx str_termcap_sort[] = {";
147 $3 == "str" {printf("%s\t%d\n", $4, i++);}
148 ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
152 echo "static const bool bool_from_termcap[] = {";
154 BEGIN { count = 0; valid = 0; }
155 $3 == "bool" && substr($7, 1, 1) == "-" {print "\tFALSE,\t/* ", $2, " */"; count++; }
156 $3 == "bool" && substr($7, 1, 1) == "Y" {print "\tTRUE,\t/* ", $2, " */"; valid = count++; }
157 END { printf "#define OK_bool_from_termcap %d\n", valid; }
162 echo "static const bool num_from_termcap[] = {";
164 BEGIN { count = 0; valid = 0; }
165 $3 == "num" && substr($7, 1, 1) == "-" {print "\tFALSE,\t/* ", $2, " */"; count++; }
166 $3 == "num" && substr($7, 1, 1) == "Y" {print "\tTRUE,\t/* ", $2, " */"; valid = count++; }
167 END { printf "#define OK_num_from_termcap %d\n", valid; }
172 echo "static const bool str_from_termcap[] = {";
174 BEGIN { count = 0; valid = 0; }
175 $3 == "str" && substr($7, 1, 1) == "-" {print "\tFALSE,\t/* ", $2, " */"; count++; }
176 $3 == "str" && substr($7, 1, 1) == "Y" {print "\tTRUE,\t/* ", $2, " */"; valid = count++; }
177 END { printf "#define OK_str_from_termcap %d\n", valid; }
183 #endif /* _TERMSORT_H */