# Copyright (C) 2003,2004 Free Software Foundation, Inc. # Contributed by Kelley Cook, June 2004. # Original code from Neil Booth, May 2003. # # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU General Public License as published by the # Free Software Foundation; either version 2, or (at your option) any # later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. # This Awk script reads in the option records generated from # opt-gather.awk, combines the flags of duplicat options and generates a # C file. # # This program uses functions from opt-functions.awk # # Usage: awk -f opt-functions.awk -f optc-gen.awk \ # [-v header_name=header.h] < inputfile > options.c BEGIN { n_opts = 0 n_langs = 0 quote = "\042" comma = "," FS=SUBSEP # Default the name of header created from opth-gen.awk to options.h if (header_name == "") header_name="options.h" } # Collect the text and flags of each option into an array { if ($1 == "Language") { langs[n_langs] = $2 n_langs++; } else { opts[n_opts] = $1 flags[n_opts] = $2 help[n_opts] = $3 n_opts++; } } # Dump that array of options into a C file. END { # APPLE LOCAL begin optimization pragmas 3124235/3420242 print "/* This file is auto-generated by optc-gen.awk. */" print "" print "#include " quote "config.h" quote print "#include " quote "system.h" quote print "#include " quote "coretypes.h" quote print "#include " quote "hwint.h" quote # APPLE LOCAL end optimization pragmas 3124235/3420242 print "#include " print "#include " quote header_name quote print "#include " quote "opts.h" quote print "" for (i = 0; i < n_opts; i++) { name = var_name(flags[i]); if (name == "") continue; # APPLE LOCAL begin optimization pragmas 3124235/3420242 if (flag_set_p("VarExists", flags[i])) continue; if (flag_set_p("PerFunc", flags[i])) continue; # APPLE LOCAL end optimization pragmas 3124235/3420242 if (flags[i] ~ "Init\\(") { init = flags[i]; sub(".*Init\\(","",init); sub("\\).*","",init); # APPLE LOCAL begin optimization pragmas 3124235/3420242 # APPLE LOCAL end optimization pragmas 3124235/3420242 } else # APPLE LOCAL optimization pragmas 3124235/3420242 init = "0"; # APPLE LOCAL optimization pragmas 3124235/3420242 printf ("/* Set by -%s.\n %s */\nint %s = %s;\n\n", opts[i], help[i], name,init) } # APPLE LOCAL begin optimization pragmas 3124235/3420242 print "struct cl_perfunc_opts cl_pf_opts = {\n" # Per-function bitfield initializers. for (i = 0; i < n_opts; i++) { name = var_name(flags[i]); if (name == "") continue; if (flag_set_p("VarExists", flags[i])) continue; if (!flag_set_p("PerFunc", flags[i])) continue; if (flag_set_p("VarUint", flags[i])) continue; if (flags[i] ~ "Init\\(") { init = flags[i]; sub(".*Init\\(","",init); sub("\\).*","",init); } else init = "0"; print init ", /* fld_" name " */ " } print "0, /* fld_optimize_size */" # Padding, see comments in opth-gen.awk. print "0, /* padding */" # Per-function non-bitfield initializers. for (i = 0; i < n_opts; i++) { name = var_name(flags[i]); if (name == "") continue; if (flag_set_p("VarExists", flags[i])) continue; if (!flag_set_p("PerFunc", flags[i])) continue; if (!flag_set_p("VarUint", flags[i])) continue; if (flags[i] ~ "Init\\(") { init = flags[i]; sub(".*Init\\(","",init); sub("\\).*","",init); } else init = "0"; print init ", /* fld_" name " */ " } print "0 /* fld_optimize */" print "};" print "struct cl_perfunc_opts cl_pf_opts_raw;" print "struct cl_perfunc_opts cl_pf_opts_cooked;" # APPLE LOCAL end optimization pragmas 3124235/3420242 print "const char * const lang_names[] =\n{" for (i = 0; i < n_langs; i++) { macros[i] = "CL_" langs[i] gsub( "[^A-Za-z0-9_]", "X", macros[i] ) s = substr(" ", length (macros[i])) print " " quote langs[i] quote "," } print " 0\n};\n" print "const unsigned int cl_options_count = N_OPTS;\n" # APPLE LOCAL begin optimization pragmas 3124235/3420242 # Access functions for per-function bitfields. for (i = 0; i < n_opts; i++) { name = var_name(flags[i]); if (name == "") continue; if (flag_set_p("VarExists", flags[i])) continue; if (!flag_set_p("PerFunc", flags[i])) continue; if (!flag_set_p("VarUint", flags[i])) { print "int cl_opt_access_func_" name " (int value, unsigned int rw)" print "{" print " if (rw == 1)" print " {" printf (" cl_pf_opts.fld_%s = value;\n", name) print " }" printf (" return cl_pf_opts.fld_%s;\n", name) print "}" } } # APPLE LOCAL end optimization pragmas 3124235/3420242 print "const struct cl_option cl_options[] =\n{" for (i = 0; i < n_opts; i++) back_chain[i] = "N_OPTS"; for (i = 0; i < n_opts; i++) { # Combine the flags of identical switches. Switches # appear many times if they are handled by many front # ends, for example. while( i + 1 != n_opts && opts[i] == opts[i + 1] ) { flags[i + 1] = flags[i] " " flags[i + 1]; i++; } len = length (opts[i]); enum = "OPT_" opts[i] if (opts[i] == "finline-limit=") enum = enum "eq" gsub ("[^A-Za-z0-9]", "_", enum) # If this switch takes joined arguments, back-chain all # subsequent switches to it for which it is a prefix. If # a later switch S is a longer prefix of a switch T, T # will be back-chained to S in a later iteration of this # for() loop, which is what we want. if (flags[i] ~ "Joined") { for (j = i + 1; j < n_opts; j++) { if (substr (opts[j], 1, len) != opts[i]) break; back_chain[j] = enum; } } s = substr(" ", length (opts[i])) if (i + 1 == n_opts) comma = "" if (help[i] == "") hlp = "0" else hlp = "N_(" quote help[i] quote ")"; # APPLE LOCAL begin optimization pragmas 3124235/3420242 printf(" { %c-%s%c,\n %s,\n %s, %u, %s, %s, %s, %s }%s\n", quote, opts[i], quote, hlp, back_chain[i], len, switch_flags(flags[i]), var_ref(flags[i]), access_ref(flags[i]), var_set(flags[i]), comma) # APPLE LOCAL end optimization pragmas 3124235/3420242 } print "};" }