/usr.bin/tic/MKtermsort.sh
https://bitbucket.org/kmv/aeriebsd-src · Shell · 127 lines · 104 code · 13 blank · 10 comment · 1 complexity · c794a56ea763ffab6572f9409957f9b4 MD5 · raw file
- #!/bin/sh
- # $From: MKtermsort.sh,v 1.6 2000/01/25 11:35:36 tom Exp $
- #
- # MKtermsort.sh -- generate indirection vectors for the various sort methods
- #
- # The output of this script is C source for nine arrays that list three sort
- # orders for each of the three different classes of terminfo capabilities.
- #
- # keep the order independent of locale:
- LANGUAGE=C
- LC_ALL=C
- export LANGUAGE
- export LC_ALL
- #
- AWK=${1-awk}
- DATA=${2-../include/Caps}
- echo "/*";
- echo " * termsort.c --- sort order arrays for use by infocmp.";
- echo " *";
- echo " * Note: this file is generated using MKtermsort.sh, do not edit by hand.";
- echo " */";
- echo "static const int bool_terminfo_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "bool" {printf("%s\t%d\n", $2, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int num_terminfo_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "num" {printf("%s\t%d\n", $2, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int str_terminfo_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "str" {printf("%s\t%d\n", $2, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int bool_variable_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "bool" {printf("%s\t%d\n", $1, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int num_variable_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "num" {printf("%s\t%d\n", $1, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int str_variable_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "str" {printf("%s\t%d\n", $1, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int bool_termcap_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "bool" {printf("%s\t%d\n", $4, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int num_termcap_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "num" {printf("%s\t%d\n", $4, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const int str_termcap_sort[] = {";
- $AWK <$DATA '
- BEGIN {i = 0;}
- /^#/ {next;}
- $3 == "str" {printf("%s\t%d\n", $4, i++);}
- ' | sort | $AWK '{print "\t", $2, ",\t/* ", $1, " */";}';
- echo "};";
- echo "";
- echo "static const bool bool_from_termcap[] = {";
- $AWK <$DATA '
- $3 == "bool" && substr($5, 1, 1) == "-" {print "\tFALSE,\t/* ", $2, " */";}
- $3 == "bool" && substr($5, 1, 1) == "Y" {print "\tTRUE,\t/* ", $2, " */";}
- '
- echo "};";
- echo "";
- echo "static const bool num_from_termcap[] = {";
- $AWK <$DATA '
- $3 == "num" && substr($5, 1, 1) == "-" {print "\tFALSE,\t/* ", $2, " */";}
- $3 == "num" && substr($5, 1, 1) == "Y" {print "\tTRUE,\t/* ", $2, " */";}
- '
- echo "};";
- echo "";
- echo "static const bool str_from_termcap[] = {";
- $AWK <$DATA '
- $3 == "str" && substr($5, 1, 1) == "-" {print "\tFALSE,\t/* ", $2, " */";}
- $3 == "str" && substr($5, 1, 1) == "Y" {print "\tTRUE,\t/* ", $2, " */";}
- '
- echo "};";
- echo "";