Index: vis_dev/vis-2.3/INSTALL =================================================================== --- vis_dev/vis-2.3/INSTALL (revision 14) +++ vis_dev/vis-2.3/INSTALL (revision 14) @@ -0,0 +1,176 @@ +Basic Installation +================== + + These are generic installation instructions. + + The `configure' shell script attempts to guess correct values for +various system-dependent variables used during compilation. It uses +those values to create a `Makefile' in each directory of the package. +It may also create one or more `.h' files containing system-dependent +definitions. Finally, it creates a shell script `config.status' that +you can run in the future to recreate the current configuration, a file +`config.cache' that saves the results of its tests to speed up +reconfiguring, and a file `config.log' containing compiler output +(useful mainly for debugging `configure'). + + If you need to do unusual things to compile the package, please try +to figure out how `configure' could check whether to do them, and mail +diffs or instructions to the address given in the `README' so they can +be considered for the next release. If at some point `config.cache' +contains results you don't want to keep, you may remove or edit it. + + The file `configure.in' is used to create `configure' by a program +called `autoconf'. You only need `configure.in' if you want to change +it or regenerate `configure' using a newer version of `autoconf'. + +The simplest way to compile this package is: + + 1. `cd' to the directory containing the package's source code and type + `./configure' to configure the package for your system. If you're + using `csh' on an old version of System V, you might need to type + `sh ./configure' instead to prevent `csh' from trying to execute + `configure' itself. + + Running `configure' takes awhile. While running, it prints some + messages telling which features it is checking for. + + 2. Type `make' to compile the package. + + 3. Optionally, type `make check' to run any self-tests that come with + the package. + + 4. Type `make install' to install the programs and any data files and + documentation. + + 5. You can remove the program binaries and object files from the + source code directory by typing `make clean'. To also remove the + files that `configure' created (so you can compile the package for + a different kind of computer), type `make distclean'. There is + also a `make maintainer-clean' target, but that is intended mainly + for the package's developers. If you use it, you may have to get + all sorts of other programs in order to regenerate files that came + with the distribution. + +Compilers and Options +===================== + + Some systems require unusual options for compilation or linking that +the `configure' script does not know about. You can give `configure' +initial values for variables by setting them in the environment. Using +a Bourne-compatible shell, you can do that on the command line like +this: + CC=c89 CFLAGS=-O2 LIBS=-lposix ./configure + +Or on systems that have the `env' program, you can do it like this: + env CPPFLAGS=-I/usr/local/include LDFLAGS=-s ./configure + +Compiling For Multiple Architectures +==================================== + + You can compile the package for more than one kind of computer at the +same time, by placing the object files for each architecture in their +own directory. To do this, you must use a version of `make' that +supports the `VPATH' variable, such as GNU `make'. `cd' to the +directory where you want the object files and executables to go and run +the `configure' script. `configure' automatically checks for the +source code in the directory that `configure' is in and in `..'. + + If you have to use a `make' that does not supports the `VPATH' +variable, you have to compile the package for one architecture at a time +in the source code directory. After you have installed the package for +one architecture, use `make distclean' before reconfiguring for another +architecture. + +Installation Names +================== + + By default, `make install' will install the package's files in +`/usr/local/bin', `/usr/local/man', etc. You can specify an +installation prefix other than `/usr/local' by giving `configure' the +option `--prefix=PATH'. + + You can specify separate installation prefixes for +architecture-specific files and architecture-independent files. If you +give `configure' the option `--exec-prefix=PATH', the package will use +PATH as the prefix for installing programs and libraries. +Documentation and other data files will still use the regular prefix. + + If the package supports it, you can cause programs to be installed +with an extra prefix or suffix on their names by giving `configure' the +option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. + +Optional Features +================= + + Some packages pay attention to `--enable-FEATURE' options to +`configure', where FEATURE indicates an optional part of the package. +They may also pay attention to `--with-PACKAGE' options, where PACKAGE +is something like `gnu-as' or `x' (for the X Window System). The +`README' should mention any `--enable-' and `--with-' options that the +package recognizes. + + For packages that use the X Window System, `configure' can usually +find the X include and library files automatically, but if it doesn't, +you can use the `configure' options `--x-includes=DIR' and +`--x-libraries=DIR' to specify their locations. + +Specifying the System Type +========================== + + There may be some features `configure' can not figure out +automatically, but needs to determine by the type of host the package +will run on. Usually `configure' can figure that out, but if it prints +a message saying it can not guess the host type, give it the +`--host=TYPE' option. TYPE can either be a short name for the system +type, such as `sun4', or a canonical name with three fields: + CPU-COMPANY-SYSTEM + +See the file `config.sub' for the possible values of each field. If +`config.sub' isn't included in this package, then this package doesn't +need to know the host type. + + If you are building compiler tools for cross-compiling, you can also +use the `--target=TYPE' option to select the type of system they will +produce code for and the `--build=TYPE' option to select the type of +system on which you are compiling the package. + +Sharing Defaults +================ + + If you want to set default values for `configure' scripts to share, +you can create a site shell script called `config.site' that gives +default values for variables like `CC', `cache_file', and `prefix'. +`configure' looks for `PREFIX/share/config.site' if it exists, then +`PREFIX/etc/config.site' if it exists. Or, you can set the +`CONFIG_SITE' environment variable to the location of the site script. +A warning: not all `configure' scripts look for a site script. + +Operation Controls +================== + + `configure' recognizes the following options to control how it +operates. + +`--cache-file=FILE' + Use and save the results of the tests in FILE instead of + `./config.cache'. Set FILE to `/dev/null' to disable caching, for + debugging `configure'. + +`--help' + Print a summary of the options to `configure', and exit. + +`--quiet' +`--silent' +`-q' + Do not print messages saying which checks are being made. + +`--srcdir=DIR' + Look for the package's source code in directory DIR. Usually + `configure' can determine that directory automatically. + +`--version' + Print the version of Autoconf used to generate the `configure' + script, and exit. + +`configure' also accepts some other, not widely useful, options. + Index: vis_dev/vis-2.3/Makefile.in =================================================================== --- vis_dev/vis-2.3/Makefile.in (revision 14) +++ vis_dev/vis-2.3/Makefile.in (revision 14) @@ -0,0 +1,1164 @@ +# FileName [ Makefile.in ] +# +# PackageName [ vis ] +# +# Synopsis [ Package-wide Makefile ] +# +# Description [ This file requires GNU's make program. +# Run "configure" to generate the Makefile, or use +# "config.status" (created by configure) to regenerate the +# Makefile after modifying this file. +# +# Type "gmake help" for help about valid targets. +# ] +# +# SeeAlso [ configure.in ] +# +# Author [ Stephen Edwards +# Tom Shiple ] +# +# Copyright [ +# Copyright (c) 1994-1996 The Regents of the Univ. of California. +# All rights reserved. +# +# Permission is hereby granted, without written agreement and without license +# or royalty fees, to use, copy, modify, and distribute this software and its +# documentation for any purpose, provided that the above copyright notice and +# the following two paragraphs appear in all copies of this software. +# +# IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR +# DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT +# OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF +# CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +# +# THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES, +# INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND +# FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN +# "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION TO PROVIDE +# MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. +# ] +# +# Revision [$Id: Makefile.in,v 1.127 2010/04/09 23:06:15 hsv Exp $] + +# Default target: + +.PHONY : default + +default : all + +#---------------------------------------------------------------------- +# The list of packages to compile. Change this if you are only compiling +# part of VIS +#---------------------------------------------------------------------- + +#PKGS = tst +PKGS = $(ALL_PKGS) + +# The name of the BDD package to use + +BDDPKG = @BDDLIB@ + +#---------------------------------------------------------------------- +# This Makefile is designed for three different situations: +# +# 1. Single platform build (the default) +# +# All packages listed in the PKGS variable +# local_srcdir = master_srcdir = . +# +# 2. Multi-platform build +# +# All packages listed in the PKGS variable +# local_srcdir = master_srcdir = /where/source/files/reside +# +# 3. Multi-platform development (used at Berkeley) +# +# Packages under development listed in the PKGS variable +# local_srcdir = ../common +# master_srcdir = /projects/vis/vis-devel/common +# +# User has a directory structure that looks like +# +# vis/common/src/ Subdirectory with package source files +# under development. +# +# vis/$PLATFORM/ Subdirectory with this Makefile. +# Compilation is invoked here. +# +# $PLATFORM is something like "alpha-g" (DEC Alpha, debug version) +# +#---------------------------------------------------------------------- + +#---------------------------------------------------------------------- +# Information about all the packages +#---------------------------------------------------------------------- + +ALL_PKGS = abs amc baig bmc cmd ctlp ctlsp eqv fsm grab hrc imc img io ltl \ + maig mark mc mvf mvfaig ntk ntm ntmaig ord part puresat rst res restr \ + rt sat sim spfd synth tbl truesim tst var vm +# Generate the list of all packages NOT in the PKGS list + +MISSING_PKGS = $(filter-out $(PKGS), $(ALL_PKGS)) + +# All the BDD packages +BDDPKGS = cu cmu cal + +#---------------------------------------------------------------------- +# For safety +#---------------------------------------------------------------------- + +SHELL = /bin/sh +.SUFFIXES: + +#---------------------------------------------------------------------- +# The name of the product and its version +#---------------------------------------------------------------------- + +PRODUCT = vis +VERSION = 2.3 + +# Compile and version information +# +# CUR_DATE and CUR_VER are strings surrounded by double quotes that contain +# spaces, e.g., "vis release 2.0" + +VERDATE := -DCUR_DATE="\"$(shell date)\"" -DCUR_VER="\"$(PRODUCT) release $(VERSION)\"" + +#---------------------------------------------------------------------- +# Source directories +#---------------------------------------------------------------------- + +# Directory containing master source files. This directory is searched +# for packages NOT listed in the PKGS variable. Defaults to "." +# Override with ./configure --srcdir= +master_srcdir = @srcdir@ + +# Directory containing local source files. This directory is searched +# for packages listed in the PKGS variable. Defaults to the master source +# directory (see above). +# Override with ./configure --with-local-srcdir= +local_srcdir = @local_srcdir@ + +#---------------------------------------------------------------------- +# Directories used while building +#---------------------------------------------------------------------- + +# Directories to search for glu .h files (space-separated) +gluincdir1 = @gluincdir@ + +# Directories to search for libglu.a (space-separated) +glulibdir1 = @glulibdir@ + +# Directory where object files will be placed during the build +objectdir = obj + +# Directory where links to header files will be placed during the build +headerdir = $(local_srcdir)/include + +# Directories where documentation will be placed during the build +docdir = $(master_srcdir)/doc +htmldocdir = $(docdir)/html +txtdocdir = $(docdir)/txt +helpdir = $(master_srcdir)/share/help + +# Directories to search for VIS library files +# Set by ./configure --with-vis-libdir= +vislibdir = @vislibdir@ + +# Full path of platform-independent library files during the build. +# Using this variable as an environment variable allows VIS to work +# before it is installed. +# +# Note: This is NOT where they will be installed + +VIS_LIBRARY_PATH = $(shell cd $(master_srcdir)/share ; pwd) + +#---------------------------------------------------------------------- +# Defaults for GLU library and header files +#---------------------------------------------------------------------- + +ifndef gluincdir1 + gluincdir = ../glu-$(VERSION)/include ../../glu-$(VERSION)/include +else + gluincdir = $(gluincdir1) $(gluincdir1)/../src/cudd +endif + +ifndef glulibdir1 + glulibdir = ../glu-$(VERSION) ../../glu-$(VERSION) +else + glulibdir = $(glulibdir1) +endif + +#---------------------------------------------------------------------- +# Installation names and directories +#---------------------------------------------------------------------- + +# Name of the library to create +LIBRARY = lib$(PRODUCT).a + +# Name of the man page +MANPAGE = vis.1 + +# Directory in which to install architecture-independent files +# Set by ./configure --prefix=... +prefix = @prefix@ + +# Directory in which to install architecture-dependent files +# Set by ./configure --exec-prefix=... +exec_prefix = @exec_prefix@ + +# Directory in which to install binaries +bindir = $(exec_prefix)/bin + +# Directory in which to install libraries +libdir = $(exec_prefix)/lib + +# Directory in which to install headers +includedir = $(prefix)/include + +# Directory in which to install architecture-independent library files +datadir = $(prefix)/share/vis + +# Directory for the man page +mandir = $(prefix)/man/man1 + +#---------------------------------------------------------------------- +# The following are set by the configure script +#---------------------------------------------------------------------- + +AC_FLAGS = @DEFS@ +LIBDIRS = @LIBDIRS@ +RANLIB = @RANLIB@ +CC = @CC@ +LINKER = @LINKER@ +LDFLAGS = @LDFLAGS@ +# +# Define the linker for the executable with "memory_profile" activated +# +PLINKER = @PLINKER@ +CFLAGS = @CFLAGS@ +OTHERLIBS = -lm @LIBS@ @LEXLIB@ +YACC = @YACC@ +LEX = @LEX@ +NAWK = @AWK@ +INSTALL = @INSTALL@ +INSTALL_PROGRAM = @INSTALL_PROGRAM@ +INSTALL_DATA = @INSTALL_DATA@ +AR = @AR@ +ZCHAFF= @ZCHAFF@ +#---------------------------------------------------------------------- +# Examples included in the distribution +#---------------------------------------------------------------------- + +# Each example is declared only once. If some checking through is done +# make check, then it is declared in one of CHECK_COMMON_EXAMPLES, +# CHECK_EXAMPLES_cu, CHECK_EXAMPLES_cmu or CHECK_EXAMPLES_cu. If the example +# is just being added to the examples directory in VIS, then add it here. + +EXAMPLES = $(CHECK_COMMON_EXAMPLES) $(CHECK_EXAMPLES_cu) \ + $(CHECK_EXAMPLES_cmu) $(CHECK_EXAMPLES_cal) \ + bpb eight_queens minmax ping_pong_new rcnum + +# The "interesting" example files are anything in the examples subdirectories +# except the RCS subdirectories +# +# This is a rather messy way to look for filenames in the local_srcdir, +# then remove the local_srcdir prefix + +EXAMPLEFILES = $(patsubst $(local_srcdir)/%, %, \ + $(filter-out %RCS, $(foreach example, $(EXAMPLES), \ + $(wildcard $(local_srcdir)/examples/$(example)/*)))) + +# $(pathsubst $(local_srcdir)/%, %, \ +# $(filter-out %/RCS, $(foreach example, $(EXAMPLES), \ + + +#---------------------------------------------------------------------- +# Distributed files in the doc directory +#---------------------------------------------------------------------- + +DOCUMENTATION = blifmv.ps ctl.ps vis_user.ps two_phase.ps + +#---------------------------------------------------------------------- +# Files in the share directory +#---------------------------------------------------------------------- + +SHAREFILES = master.visrc ioBlifToMv.nawk ioBlifToMvForIncremental.nawk\ + script_compute_reach.simple script_compute_reach.robust\ + script_model_check.simple script_model_check.robust\ + script_fair_model_check.simple script_fair_model_check.robust\ + script_lang_empty_check.simple script_lang_empty_check.robust\ + script_generic.simple script_generic.robust\ + sislib.mv createfunctionmap memoryaccount visdbgpp + +HELPFILES = $(notdir $(wildcard $(helpdir)/*.txt)) + +#---------------------------------------------------------------------- +# Include the make templates from all the packages +# +# Each of these templates (e.g., array/array.make) should contains lines +# of the form +# +# CSRC += source1.c source2.c +# HEADERS += header1.h header2.h +# LEXSRC += file1.l +# YACCSRC += file2.y +# GENERATEDCSRC += ctlpLex.c ctlpRead.c +#---------------------------------------------------------------------- + +MAKEINCLUDES = $(foreach package, $(PKGS), \ + $(local_srcdir)/src/$(package)/$(package).make) + +include $(MAKEINCLUDES) + +OBJECTS = $(addprefix $(objectdir)/,$(GENERATEDCSRC:.c=.o) $(CSRC:.c=.o)) + +#---------------------------------------------------------------------- +# Include the dependency files from each package directory. +# A missing dependency file does not produce an error. +#---------------------------------------------------------------------- + +DEPENDENCIES = $(foreach package, $(PKGS), \ + $(local_srcdir)/src/$(package)/$(package).d) + +-include $(DEPENDENCIES) + +#---------------------------------------------------------------------- +# Header files and library search paths and names +# +# INCLUDEDIRS looks like "-I/projects/glu/ -I/projects/vis/ ..." +# LIBRARYDIRS looks like "-L/projects/glu/ -L/projects/vis/ ..." +# LIBS looks like "-lm -lglu -lvis" +#---------------------------------------------------------------------- + +INCLUDEDIRS = $(addprefix -I,$(gluincdir)) \ + $(foreach package, $(PKGS), -I$(local_srcdir)/src/$(package)) \ + $(foreach package, $(MISSING_PKGS), \ + -I$(master_srcdir)/src/$(package)) \ + -I$(objectdir) + +LIBRARYDIRS = $(addprefix -L,$(vislibdir)) $(addprefix -L,$(glulibdir)) \ + $(LIBDIRS) + +# Link against the VIS library only if some packages are missing +# (i.e., we are compiling only a few packages locally) + +ifneq ($(strip $(MISSING_PKGS)),) + VISLIBS = -l$(PRODUCT) +else + VISLIBS = +endif + +GLULIBS = -l$(BDDPKG) -lglu + +# g++ on Linux RH requires -lstdc++ +ifeq ($(CC),g++) +OTHERLIBS += -lstdc++ +endif + +LIBS = $(VISLIBS) $(GLULIBS) $(OTHERLIBS) + +#---------------------------------------------------------------------- +# Form the the list of directories to search for header files. +# +# VPATH looks like /projects/vis:/projects/glu/: ... +#---------------------------------------------------------------------- + +VPATH = $(local_srcdir): \ + $(master_srcdir): \ + $(addprefix :$(local_srcdir)/src/,$(PKGS)): \ + $(addprefix :$(master_srcdir)/src/,$(MISSING_PKGS)): \ + $(objectdir): \ + $(local_srcdir)/share + +#---------------------------------------------------------------------- +# Definitions for the distribution file +#---------------------------------------------------------------------- + +DISTRIBUTION = $(PRODUCT)-$(VERSION) + +# Directories to include in the distribution file + +DISTDIRS = src helpers share share/help obj doc examples \ + $(addprefix examples/,$(EXAMPLES)) $(addprefix src/,$(PKGS)) + +# Build/install helper files + +HELPERS = $(addprefix helpers/, \ + install-sh mkinstalldirs config.guess config.sub dependency.make) + +# Files to include in the distribution file + +DISTFILES = \ + README INSTALL NEWS \ + configure configure.in Makefile.in $(HELPERS) \ + vis.1 \ + xsimv \ + $(CSRC) $(HEADERS) $(LEXSRC) $(YACCSRC) $(MAKEINCLUDES) \ + $(EXAMPLEFILES) \ + $(addprefix doc/,$(DOCUMENTATION)) \ + $(addprefix share/,$(SHAREFILES)) \ + $(addprefix share/help/,$(HELPFILES)) + +#---------------------------------------------------------------------- +# Variables used by for Revision Control +#---------------------------------------------------------------------- + +# The root RCS directory +rcs_rootdir = /projects/vis/rcsRoot/common + +RCSFILES = $(CSRC) $(HEADERS) $(LEXSRC) $(YACCSRC) $(MAKEINCLUDES) + +RCSMISCFILES = Makefile.in configure.in localconfigure \ + masterconfigure README INSTALL NEWS xsimv $(addprefix helpers/, mkinstalldirs install-sh \ + config.guess config.sub dependency.make ) + +RCSSHAREFILES = $(SHAREFILES) + +#---------------------------------------------------------------------- +# Implicit rules +#---------------------------------------------------------------------- + +ALLCFLAGS = $(CFLAGS) $(AC_FLAGS) $(VERDATE) \ + -DNAWK=\"$(NAWK)\" -DLIBRARY=\"$(datadir)\" + +# For compiling a source file into the object directory + +$(objectdir)/%.o : %.c + umask 2 ; $(CC) -c $(ALLCFLAGS) $(INCLUDEDIRS) -o $@ $< + +# Place object files into an archive + +%.a : + rm -f $@ + umask 2; $(AR) cq $@ $^ + $(RANLIB) $@ + +###################################################################### +# RULES # +###################################################################### + +#: +#: Useful targets: +#: + +#---------------------------------------------------------------------- +# Rule for getting help +#---------------------------------------------------------------------- + +.PHONY : help + +#: help -- Print a list of targets + +# This prints all lines in this Makefile that begin with #: + +help : + @sed -n "s/^#://p" Makefile + +#---------------------------------------------------------------------- +# Always executed once when the Makefile is run +#---------------------------------------------------------------------- + +# Make sure the directory in which to place the objects exists + +ignored := $(shell umask 2; test -d $(objectdir) || mkdir $(objectdir)) + +#---------------------------------------------------------------------- +# Rules to compile and build libraries and executables +#---------------------------------------------------------------------- + +.PHONY : all allprods library allprods-mp exe-mp compile-version delete-version + +#: +#: all (the default) -- Compile the main executable +# (force the version to be recompiled) + +all : ALLCFLAGS += -DBDD$(BDDPKG) + +all : compile-version $(PRODUCT) + +# Create the main executable +$(PRODUCT) : $(OBJECTS) $(glulibdir)/libglu.a $(glulibdir)/lib$(BDDPKG).a + umask 2 ; $(LINKER) -o $(PRODUCT) $(LDFLAGS) \ + $(OBJECTS) $(LIBRARYDIRS) $(LIBS) + +#: allprods -- Compile an executable linked with each BDD package + +allprods : $(OBJECTS) $(glulibdir)/libglu.a $(foreach bddpkg, $(BDDPKGS), \ + $(glulibdir)/lib$(bddpkg).a) + @for bddpkg in $(BDDPKGS) ; \ + do \ + rm -f $(objectdir)/satBDD.o; \ + umask 2 ; $(CC) -c $(ALLCFLAGS) -DBDD$$bddpkg $(INCLUDEDIRS) -o $(objectdir)/satBDD.o $(master_srcdir)/src/sat/satBDD.c; \ + echo "Creating vis-$$bddpkg";\ + umask 2 ; $(LINKER) -o $(PRODUCT)-$$bddpkg $(LDFLAGS) $(OBJECTS) \ + $(LIBRARYDIRS) $(VISLIBS) -l$$bddpkg -lglu $(OTHERLIBS); \ + done + +# Force the "version" information to be recompiled + +compile-version : delete-version $(objectdir)/vmVers.o $(objectdir)/satBDD.o + +# Delete the object file related to the version + +delete-version : + rm -f $(objectdir)/vmVers.o $(objectdir)/satBDD.o + +# Build a library containing all the objects + +#: library -- Create a library of all the objects (useful in a central area) + +library : $(LIBRARY) + +$(LIBRARY) : $(OBJECTS) + +ifdef PLINKER +$(PRODUCT)-mp : $(LIBRARY) $(glulibdir)/libglu.a \ + $(foreach bddpkg, $(BDDPKGS), \ + $(glulibdir)/lib$(bddpkg).a) + umask 2 ; $(PLINKER) -o $(PRODUCT)-mp $(OBJECTS) \ + `purify -printhomedir`/libpurify_stubs.a \ + $(LIBRARYDIRS) $(LIBS) + +allprods-mp : $(LIBRARY) $(glulibdir)/libglu.a \ + $(foreach bddpkg, $(BDDPKGS), \ + $(glulibdir)/lib$(bddpkg).a) + @for bddpkg in $(BDDPKGS) ; \ + do \ + echo "Creating vis-$$bddpkg";\ + umask 2 ; $(PLINKER) -o $(PRODUCT)-$$bddpkg-mp $(OBJECTS) \ + `purify -printhomedir`/libpurify_stubs.a \ + $(LIBRARYDIRS) $(VISLIBS) -l$$bddpkg -lglu $(OTHERLIBS) ; \ + done + +exe-mp : $(OBJECTS) + $(PLINKER) -o $(PRODUCT)-mp $(OBJECTS) \ + `purify -printhomedir`/libpurify_stubs.a \ + $(LIBRARYDIRS) $(LIBS) +endif + +#---------------------------------------------------------------------- +# Rule to produce the function map for the memory_profile command +#---------------------------------------------------------------------- + +.PHONY : functionmap + +FMAPFILE = .fmap +functionmap: $(CSRC) + $(VIS)/common/share/createfunctionmap $^ >$(FMAPFILE) + +#---------------------------------------------------------------------- +# Rules for installation +#---------------------------------------------------------------------- + +.PHONY : install uninstall installdirs + +#: +#: install -- Install the product and libraries in bindir, libdir, +#: datadir, etc. + +install : $(PRODUCT) $(LIBRARY) installdirs + @echo "Installing $(bindir)/$(PRODUCT)" + @$(INSTALL_PROGRAM) $(PRODUCT) $(bindir)/$(PRODUCT) + @echo "Installing $(libdir)/$(LIBRARY)" + @$(INSTALL_DATA) $(LIBRARY) $(libdir)/$(LIBRARY) + @for file in $(SHAREFILES) ; do \ + echo "Installing $(datadir)/$$file"; \ + $(INSTALL_DATA) $(master_srcdir)/share/$$file \ + $(datadir)/$$file; \ + done + @for file in $(HELPFILES) ; do \ + echo "Installing $(datadir)/help/$$file"; \ + $(INSTALL_DATA) $(master_srcdir)/share/help/$$file \ + $(datadir)/help/$$file; \ + done + @echo "Installing $(mandir)/vis.1" + @$(INSTALL_DATA) vis.1 $(mandir)/vis.1 + @for header in $(HEADERS); do \ + echo "Installing $(includedir)/$$header"; \ + $(INSTALL_DATA) $(master_srcdir)/src/*/$$header \ + $(includedir)/$$header; \ + done + +#: uninstall -- Reverse the effects of "install" + +uninstall : + rm -f $(bindir)/$(PRODUCT) + rm -f $(libdir)/$(LIBRARY) + @for file in $(SHAREFILES) ; \ + do \ + echo "Removing $(datadir)/$$file"; \ + rm -f $(datadir)/$$file; \ + done + @for file in $(HELPFILES) ; \ + do \ + echo "Removing $(datadir)/help/$$file"; \ + rm -f $(datadir)/help/$$file; \ + done + @for header in $(HEADERS); \ + do \ + echo "Removing $(includedir)/$$header"; \ + rm -f $(includedir)/$$header; \ + done + +installdirs : + $(master_srcdir)/helpers/mkinstalldirs \ + $(bindir) $(libdir) $(includedir) $(datadir) $(datadir)/help \ + $(mandir) + +#---------------------------------------------------------------------- +# Rules for checking the build +#---------------------------------------------------------------------- + +.PHONY : check check-examples + +# This is a lengthy sed command used to filter out the irrelevant VIS +# output that appears when the examples are running. +# +# Sed does not permit space between the trailing p ("print matching +# lines") and the semicolon (end of command). Hashes are escaped -- +# otherwise they are Makefile comments. This was once a long egrep +# expression, but the string was too long for Ultrix's egrep. + +SED_CMD = \ + /^FSM depth/p; \ + /^computation depth/p; \ + /^reachable states =/p; \ + /^\# MC: formula passed/p; \ + /^\# MC: formula failed/p; \ + /^\# MC: the number of non-trivial forced segments/p; \ + /^\# MC: Vacuous/p; \ + /^\# MC: No vacuous/p; \ + /[sS]tates covered/p; \ + /covered states/p; \ + /Percentage of coverage/p; \ + /^\# LTL_MC: formula passed/p; \ + /^\# LTL_MC: formula failed/p; \ + /^\# INV: formula passed/p; \ + /^\# INV: formula failed/p; \ + /^\# LE: language is not empty/p; \ + /^\# LE: language emptiness check passes/p; \ + /^\# ABS: formula passed/p; \ + /^\# ABS: formula failed/p; \ + /^\# BMC: formula failed/p;\ + /^\# BMC: no counterexample found/p; \ + /Residue/p; \ + /^\# AMC: Verified formula TRUE/p; \ + /^\# AMC: Verified formula FALSE/p; \ + /Equivalence Classes/p; \ + /Total number of literals/p; \ + /Networks are combinationally equivalent\./p; \ + /Networks are sequentially equivalent\./p; \ + /;.*;/p; + +CHECK_EXAMPLES_cu = daio_receiver mult6x6 s1269 fpmpy restruct synthesis \ + production_cell +CHECK_EXAMPLES_cmu = +CHECK_EXAMPLES_cal = + +# List of all examples to check (A subset of EXAMPLES) + +CHECK_COMMON_EXAMPLES = abp amp arbiter bakery coherence counter crd ctlp3 \ + dcnew eisenberg elevator ethernet exampleS gcd gigamax ping_pong \ + scheduler short slider tbl_one_bug tcp tlc treearbiter + +CHECK_EXAMPLES = $(CHECK_COMMON_EXAMPLES) $(CHECK_EXAMPLES_$(BDDPKG)) + +# Determine the absolute executable path +# +# Starting from the current directory, change directory to the directory +# part of the product name, then tack on the filename part of EXECUTABLE + +EXECUTABLE = $(PRODUCT) + +EXECUTABLEPATH := \ + $(shell cd $(dir $(EXECUTABLE)) ; pwd)/$(notdir $(EXECUTABLE)) + +# Determine the rootname of the examples +# + +EXAMPLEPATH = $(master_srcdir)/examples + +FULLEXAMPLEPATH := $(shell cd $(EXAMPLEPATH) ; pwd) + +#: +#: check -- Test the locally-built executable (runs check-examples) + +check : check-examples + +# Run check on each of the bdd versions (named e.g., vis-cmu) + +#: check-allprods -- Test each of the BDD executables (see allprods) + +check-allprods : + @for bddpkg in $(BDDPKGS) ; \ + do \ + echo "Checking $(PRODUCT)-$$bddpkg";\ + $(MAKE) PRODUCT=$(PRODUCT)-$$bddpkg BDDPKG=$$bddpkg check ; \ + done + +#: check-examples -- Test each of the examples listed in CHECK_EXAMPLES +#: You may want to invoke this with +#: gmake "CHECK_EXAMPLES=abp bakery" check-examples +#: gmake EXECUTABLE=vis-cmu check-examples +#: gmake EXECUTABLE=/projects/vis/vis-devel/alpha-g/vis \ +#: check-examples +#: gmake EXAMPLEPATH=/projects/vis/vis-devel/common/examples \ +#: check-examples +#: gmake EXAMPLEPATH=../common/examples check-examples +#: gmake VIS_LIBRARY_PATH=/projects/vis/vis-devel/share + +# For each example, +# +# 1) create the directory checkresults/ +# 2) enter that directory +# 3) create "check_script" by prepending a "set open_path" command +# to the example's check_script in the master source directory. This +# makes VIS look in the master source directory for example files +# 4) run VIS on that script, producing "result.raw" +# 5) filter out relevant lines in the result, producing "result.filtered" +# and compare this with the "check_result" file in the master source +# directory. Differences are written to "result.differences" + +check-examples : + @test -d checkresults || mkdir checkresults + @echo "Checking examples. Results will be in checkresults//result.raw" + @echo "Running executable $(EXECUTABLEPATH)" + @echo " (change with EXECUTABLE=...)" + @echo "Taking examples from $(FULLEXAMPLEPATH)" + @echo " (change with EXAMPLEPATH=...)" + @cwd=`pwd` ; \ + VIS_LIBRARY_PATH=$(VIS_LIBRARY_PATH) ; \ + export VIS_LIBRARY_PATH ; \ + for example in $(CHECK_EXAMPLES) ; \ + do \ + echo -n "Checking $$example ... " ; \ + cd $$cwd ; \ + test -d checkresults/$$example || \ + mkdir checkresults/$$example ; \ + cd checkresults/$$example ; \ + rm -f check_script ; \ + echo "set open_path $(FULLEXAMPLEPATH)/$$example" > check_script ; \ + cat $(FULLEXAMPLEPATH)/$$example/check_script >> check_script ; \ + $(EXECUTABLEPATH) -f check_script -x > result.raw 2> result.stderr ; \ + sed -n '$(SED_CMD)' result.raw > result.filtered ; \ + if diff result.filtered \ + $(FULLEXAMPLEPATH)/$$example/check_result > result.differences ; \ + then \ + echo "passed" ; \ + rm result.differences ; \ + else \ + echo "failed (more checkresults/$$example/result.differences)" ; \ + fi ; \ + done + +# egrep '$(KEY_WORDS)' result.raw > result.filtered ; \ + +#---------------------------------------------------------------------- +# Rules that produce/delete the dependency file for every package +#---------------------------------------------------------------------- + +.PHONY : dependencies cleandependencies + +#: +#: dependencies -- Create a list of dependency files. +#: Useful when modifying header files. + +# Invoke the "dependency.make" Makefile on each package subdirectory, +# passing the path, etc. to it. +# +# There's a strange feature in autoconf where lines of the form " VPATH=" +# are removed from the Makefile. Thus, a flag is placed before the +# VPATH= argument below. + +dependencies: +ifneq ($(findstring <$(CC)>, ),) + for pkg in $(PKGS) ; \ + do \ + $(MAKE) --no-print-directory \ + -f $(master_srcdir)/helpers/dependency.make \ + CC="$(CC)" \ + CFLAGS="$(CFLAGS)" VPATH="$(local_srcdir)/src/$$pkg" \ + AC_FLAGS="$(AC_FLAGS)" \ + INCLUDEDIRS="$(INCLUDEDIRS)" objectdir=$(objectdir) \ + PKGNAME=$(local_srcdir)/src/$$pkg/$$pkg \ + $(local_srcdir)/src/$$pkg/$$pkg.d ; \ + done +else + @echo "dependency requires gcc, g++, icc, or icpc" + @echo "Reconfigure with gcc, g++, icc, or icpc" +endif + +cleandependencies: + rm -f $(local_srcdir)/src/*/*.d + +#---------------------------------------------------------------------- +# Rules for making a distribution file +#---------------------------------------------------------------------- + +.PHONY : dist + +#: +#: dist -- Create a tarred, gzipped distribution file + +# Warning: "tar" under Digital Unix (on DEC Alphas) writes directories +# that don't work under SunOS tar + +dist : $(DISTRIBUTION).tar.gz + +$(DISTRIBUTION).tar.gz : $(DISTFILES) +ifeq ($(strip $(FULL_MISSING_PKGS)),) + rm -rf $(DISTRIBUTION) + umask 022; mkdir $(DISTRIBUTION) + for dir in $(DISTDIRS); \ + do \ + umask 022; mkdir $(DISTRIBUTION)/$$dir; \ + done + @echo "Copying distribution files" + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + echo " $$file"; \ + cp -p $(local_srcdir)/$$file $(DISTRIBUTION)/$$file; \ + done + - chmod -R a+r $(DISTRIBUTION) + - chmod -R u+w $(DISTRIBUTION) + tar cf - $(DISTRIBUTION) | gzip -9 > $(DISTRIBUTION).tar.gz + rm -rf $(DISTRIBUTION) +else + @echo "Missing packages: $(FULL_MISSING_PKGS)" + @echo "Make sure PKGS lists all the packages" + @exit 1 +endif + +#---------------------------------------------------------------------- +# Rules for rebuilding the configure file and Makefile +#---------------------------------------------------------------------- + +${master_srcdir}/configure : configure.in + cd ${master_srcdir} && autoconf + chmod 0775 ${master_srcdir}/config* + +config.status : configure + ./config.status --recheck + +Makefile : Makefile.in config.status + @echo "The master Makefile.in has been changed:" + @echo "run config.status" + @echo "Warning: This will overwrite any local Makefile modifications" + @exit 1 + +#---------------------------------------------------------------------- +# Rules for cleaning +#---------------------------------------------------------------------- + +.PHONY : clean mostlyclean distclean + +#: +#: clean -- Remove every file created by building + +clean mostlyclean : + rm -rf $(objectdir)/* $(LIBRARY) $(PRODUCT) \ + $(foreach bddpkg, $(BDDPKGS), $(PRODUCT)-$(bddpkg)) \ + checkresults include + +#: distclean -- Remove every file created by building or configuring + +distclean : clean cleandependencies + rm -f Makefile config.status config.cache config.log + +#---------------------------------------------------------------------- +# Rule for performing a lint-like check on the source code +# +# Note: This requires gcc or g++ +#---------------------------------------------------------------------- + +.PHONY : check-code + +#: +#: check-code -- Run a lint-like check on the source code. +#: (useful for development) + +CHECK_FLAGS := -Wall -pedantic -DBDD$(BDDPKG) +ifeq ($(CC),gcc) + CHECK_FLAGS += -Wstrict-prototypes -Wmissing-prototypes -Wmissing-declarations +endif + +check-code : $(CSRC) $(BDD_CSRC) $(MDD_CSRC) +ifneq ($(findstring <$(CC)>, ),) + @rm -f *.o_checkcode + @for file in $^; \ + do \ + echo "------------------------ Checking $$file"; \ + $(CC) -c $(CFLAGS) $(AC_FLAGS) $(CHECK_FLAGS) \ + $(VERDATE) $(INCLUDEDIRS) \ + -o $(objectdir)/checkcode_output.o $$file; \ + rm -f $(objectdir)/checkcode_output.o; \ + done + @rm -f *.o_checkcode +else + @echo "check-code requires gcc or g++" + @echo "Reconfigure with gcc or g++" +endif + +#---------------------------------------------------------------------- +# Rule for generating function prototypes for all the +# source and header files in all the PKGS +# +# Note: This requires "extproto," part of the ext package available from +# ftp://ic.eecs.berkeley.edu/pub/Ext +#---------------------------------------------------------------------- + +.PHONY : proto + +#: +#: proto -- Regenerate all the function prototypes in the packages +#: Useful during development. You may want to invoke it with +#: gmake "PKGS=tst tbl" proto + +proto : + @cd $(local_srcdir)/src ; \ + for pkg in $(PKGS); \ + do \ + cd $$pkg ; \ + extproto *.h *.c ; \ + cd .. ; \ + done + +#---------------------------------------------------------------------- +# Rules for generating the documentation and command help files +# for all the packages +# +# Note: This requires "extdoc," part of the ext package, and +# lynx, a textual WWW browser +#---------------------------------------------------------------------- + +.PHONY : allDoc doc indices helpfiles cleandoc + +#: +#: allDoc -- Extract all the documentation (runs doc, indices, and helpfiles) + +allDoc : cleandoc doc indices helpfiles + +#: doc -- Extract HTML and text documentation on all the functions + +doc : $(htmldocdir) $(txtdocdir) + for pkg in $(PKGS); \ + do \ + umask 2 ; extdoc --html=$(htmldocdir) --text=$(txtdocdir) \ + $(local_srcdir)/src/$$pkg/$$pkg; \ + done + +#: indices -- Generate function and command indices for the HTML documentation + +indices : $(htmldocdir) + umask 2 ; extindex $(htmldocdir) + +#: helpfiles -- Generate the help files from the HTML documentation + +helpfiles : $(helpdir) + for file in $(htmldocdir)/*Cmd.html ; \ + do \ + echo Converting $$file ; \ + umask 2 ; lynx -dump $$file > $(helpdir)/`basename $$file .html`.txt ; \ + done + +#: cleandoc -- Remove all the documentation generated by "allDoc" + +cleandoc : + -rm -f $(htmldocdir)/*.html + -rm -f $(txtdocdir)/*.txt + -rm -f $(helpdir)/*Cmd.txt + +$(htmldocdir) : + - umask 2 ; mkdir $(htmldocdir) + +$(txtdocdir) : + - umask 2 ; mkdir $(txtdocdir) + +$(helpdir) : + - umask 2 ; mkdir $(helpdir) + + +#---------------------------------------------------------------------- +# Revision control rules +# +# May be invoked with command-line overrides, e.g., +# gmake RCSFILES=foo.c rcs_co +# gmake PKGS=array rcs_ci +#---------------------------------------------------------------------- + +.PHONY: rcs_ci rcs_co rcs_diff rcs_ident rcs_status + +#: +#: You may want to invoke the RCS rules with +#: gmake "PKGS=tst tbl" rcs_ci +#: gmake "RCSFILES=tstMain.c" rcs_co +#: +#: rcs_ci -- check in user-modified files and put an updated copy +#: in the central area + +rcs_ci: $(RCSFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + ci -u $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + co -u $(RCSFLAGS) $(master_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_co -- check out files for modification + +rcs_co: $(RCSFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + co -l $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_diff -- Report differences between local files and checked-in versions + +rcs_diff: $(RCSFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + rcsdiff $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_ident -- Print the RCS identifier in each file + +rcs_ident: $(RCSFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + ident $(RCSFLAGS) $(local_srcdir)/$$file; \ + done + +#: rcs_status -- Report who has checked out files + +rcs_status: $(RCSFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + rlog -L -h $(RCSFLAGS) $(rcs_rootdir)/$$file,v; \ + done + +#---------------------------------------------------------------------- +# RCS rules for common/{Makefile.in, configure.in, localconfigure, +# masterconfigure, mkinstalldirs, install-sh} +#---------------------------------------------------------------------- + +.PHONY : rcs_ci_misc rcs_co_misc rcs_diff_misc + +#: rcs_ci_misc -- Check in miscellaneous files, updating central area + +rcs_ci_misc: $(RCSMISCFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + ci -u $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + co -u $(RCSFLAGS) $(master_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_co_misc -- Check out miscellaneous files + +rcs_co_misc: $(RCSMISCFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + co -l $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_diff_misc -- Report differences in miscellaneous files + +rcs_diff_misc: $(RCSMISCFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + rcsdiff $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_ident_misc -- Report RCS identifiers + +rcs_ident_misc: $(RCSMISCFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + ident $(RCSFLAGS) $(local_srcdir)/$$file; \ + done + +#: rcs_status_misc -- Report checked in/out status, ownership + +rcs_status_misc: $(RCSMISCFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + rlog -L -h $(RCSFLAGS) $(rcs_rootdir)/$$file,v; \ + done + +#---------------------------------------------------------------------- +# RCS rules for files in common/share +#---------------------------------------------------------------------- + +.PHONY : rcs_ci_share rcs_co_share rcs_diff_share + +#: rcs_ci_share -- Check in files in the share/ directory + +rcs_ci_share: $(RCSSHAREFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + ci -u $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + co -u $(RCSFLAGS) $(master_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_co_share -- Check out share files + +rcs_co_share: $(RCSSHAREFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + co -l $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_diff_share -- Report differences in share files + +rcs_diff_share: $(RCSSHAREFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + rcsdiff $(RCSFLAGS) $(local_srcdir)/$$file $(rcs_rootdir)/$$file,v; \ + done + +#: rcs_ident_share -- Report RCS identifiers + +rcs_ident_share: $(RCSSHAREFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + ident $(RCSFLAGS) $(local_srcdir)/$$file; \ + done + +#: rcs_status_share -- Report checked in/out status, ownership + +rcs_status_share: $(RCSSHAREFILES) + @for file in $(patsubst $(local_srcdir)/%, %, $^); \ + do \ + rlog -L -h $(RCSFLAGS) $(rcs_rootdir)/$$file,v; \ + done + +#---------------------------------------------------------------------- +# Rules for debugging the Makefile +#---------------------------------------------------------------------- + +.PHONY : debug-make + +DEBUG_VARS = ALL_PKGS \ + PKGS \ + MISSING_PKGS \ + VPATH \ + INCLUDEDIRS \ + CSRC \ + OBJECTS \ + HEADERS \ + MAKEINCLUDES \ + CFLAGS \ + AC_FLAGS \ + master_srcdir \ + local_srcdir \ + RCSFILES \ + RCSDIR \ + LIBS \ + VISLIBS \ + DISTFILES \ + EXAMPLEFILES + +#: +#: debug-make -- Print a list of Makefile variables + +debug-make: + @$(foreach var, $(DEBUG_VARS), echo $(var)=$($(var)) ; ) Index: vis_dev/vis-2.3/NEWS =================================================================== --- vis_dev/vis-2.3/NEWS (revision 14) +++ vis_dev/vis-2.3/NEWS (revision 14) @@ -0,0 +1,1676 @@ +VIS NEWS -*-indented-text-*- + History of user-visible changes. + +Please sent bug reports to vis-users@colorado.edu. Please let us know what +version of VIS you are running and what architecture you are running it on. + +====================================================================== +Version 2.3 + +Release 2.3 of VIS improves VIS 2.2 in the following areas: + +* Builds with bison 2.4.1 and gcc 4.4.1 + +* Supports cusp-1.1 as external SAT solver for bounded model checking + instead of zchaff + +* Bug fixes + +====================================================================== + +Version 2.2 + +Release 2.2 of VIS improves VIS 2.1 in the following areas: + +* Compiles with gcc 4.3 and bison 2.3 +* Supports both 64-bit and 32-bit compilation on x86_64 machines +* Allows the use of up to 4 GB of memory with 32-bit pointers + (previously 2 GB) +* improved vl2mv produces smaller blif-MV files +* vl2mv 2.2 drops support of obsolete output formats (e.g., Shift) +* Support for weak until operator in both CTL and LTL +* Improved node matching for combinational equivalence (comb_verify) +* Fixed bug in the translation of LTL properties to Buechi automata +* New command write_network_blif_mv +* faster flatten_hierarchy +* new functions mdd_array_dump_dot mdd_array_print_cover make + debugging easier +* CUDD 2.4.2 +* vis-verilog-models-1.2 + +====================================================================== + +Version 2.1 + +Release 2.1 of VIS improves VIS 2.0 in the following areas: + +1. Revamped Bounded Model Checker with efficient termination criteria +2. Grab and Puresat algorithms for invariant checking based on + abstraction refinement +3. DnC algorithm for language emptiness check based on abstraction + refinement +4. CirCUs SAT solver. +5. Fate and Free Will algorithm for the analysis of counterexamples +6. Vacuity detection for CTL +7. Coverage estimation for CTL +8. Far Side algorithm for image computation +9. CUDD 2.4.1 +10. Miscellaneous + + +Bounded Model Checking +---------------------- + +BMC in VIS 2.1 is much faster than it was in VIS 2.0. The +construction of the circuit data structure, the encoding of the +property, the use of a faster SAT solver all have contributed to this +improvement. + +BMC in VIS 2.1 can prove properties rather than just falsifying them. +The following sequence of commands is used to perform bounded model +checking with termination check: + + read_blif_mv model.mv + flatten_hierarchy + build_partition_maigs + bounded_model_check -k 10 -r 2 model.ltl + +The termination check will be performed every other step. The +construction of the MDDs is not needed if termination check is needed +for invariant properties only. For details on the stopping criteria, +see + +M. Awedh and F. Somenzi, "Proving More Properties with Bounded Model +Checking," CAV 2004, pp. 96-108, LNCS 3114. + +Other new options to the bounded_model_check command allow one to +control the formula encoding, the solver to be applied (CirCUs or +zChaff) and, for the former, the incremental solving algorithm. + +A new command ltl2snf allows one to translate an LTL formula to +separation normal form. + + +Abstraction Refinement for Invariants +------------------------------------- + +The check_invariant command allows the user the choice of one of two +abstraction refinement algorithms for invariants. The Grab algorithm +uses BDD-based model checking on the abstract model and SAT for +counterexample concretization check. Its refinement strategy is +game-theoretic. It is run as follows: + + read_blif_mv model.mv + flatten_hierarchy + build_partition_maigs + check_invariant -A3 model.inv + +By default, grab enables dynamic variable reordering for the abstract +model. One can override this behavior by explicitly building +partition MDDs. For details of the algorithm, see + +C. Wang, B. Li, H. Jin, G. D. Hachtel, and F. Somenzi, "Improving +Ariadne's Bundle by Following Multiple Threads in Abstraction +Refinement," ICCAD 2003, pp. 408-415. + +The puresat algorithm uses SAT as the only decision procedure for both +abstract and concrete model. It analyzes the proofs of +unsatisfiability to produce refinements. It is invoked as follows: + + read_blif_mv model.mv + flatten_hierarchy + build_partition_maigs + check_invariant -A4 model.inv + +The algorithm is described in + +B. Li, C. Wang, and F. Somenzi, "Abstraction Refinement in Symbolic +Model Checking Using Satisfiability as the Only Decision Procedure," +STTT, vol.7, n. 2, pp. 143-155. + + +Abstraction Refinement for Language Emptiness +-------------------------------------------- + +The lang_empty command has a new option that runs the "Divide and +Compose" (DnC) algorithm described in + +C. Wang, R. Bloem, G. D. Hachtel, K. Ravi, and F. Somenzi, "Divide and +Compose: SCC Refinement for Language Emptiness", CONCUR 2001, +pp. 456-471, LNCS 2154. + +The algorithm, which is based on refinement of the strongly connected +components of the model, is invoked as follows: + + read_blif_mv model.mv + init_verify + lang_empty -A 1 + + +CirCUs SAT solver +----------------- + +VIS 2.1 includes the SAT solver CirCUs, a short description of which +can be found in + +H. Jin, M. Awedh, and F. Somenzi, "CirCUs: A Satisfiability Solver +Geared Towards Bounded Model Checking," CAV 2004, pp. 519-522, LNCS +3114. + +CirCUs is an incremental SAT solver that accepts input in either +circuit or CNF form. It is the default solver for bounded model +checking and abstraction refinement algorithms. It can also be +invoked from the VIS prompt as a stand-alone CNF SAT solver on a set +of clauses described in DIMACS format: + + cnf_sat input.cnf + + +Fate and Free Will Algorithm +---------------------------- + +The counterexamples produced by model_check and check_invariant can be +optionally generated with the Fate and Free Will algorithm of + +H. Jin, K. Ravi, and F. Somenzi, "Fate and Free Will in Error Traces," +STTT, vol. 6, n. 2, pp. 102-116. + +This algorithm is only available when vis is linked with the cu BDD +package. It assumes a partition of the inputs into variables +controlled by the environment and variables controlled by the system, +and divides a counterexample into fated and free segments. In a fated +segment, the values of the variables controlled by the environment +suffice to impose progress toward violation of the property. In a +free segment, the other variables are also required. + +To run the Fate and Free Will algorithm, one prepares a file with the +inputs that the system controls. For a failing invariant, the +invocation is like this: + + read_blif_mv model.mv + init_verify + check_invariant -d1 -i -w system_inputs + +The last command is replaced by + + model_check -d2 -i -w system_inputs + +for a CTL property. The -W option can be used to assign all inputs to +the system, while the -G option invokes a variant of the algorithm. + + +Vacuity Detection for CTL +------------------------- + +VIS 2.1 implements two algorithms for the detection of vacuity in CTL +model checking. A formula passes vacuously if it can be strengthened +by replacement of one of its subformulae with "bottom" and still pass. +Likewise, a formula fails vacuously if it can be weakened by +replacement of one of its subformulae with "top" and still fail. + +The algorithm of Beer et al. (CAV 97) is invoked with the -B option as +follows: + + read_blif_mv model.mv + init_verify + model_check -B model.ctl + +This algorithm applies to a subset of ACTL and considers only passing +properties. If an error trace is requested with -d, in case of +vacuous pass, an interesting witness is produced. + +The second algorithm for vacuity detection is an extension of the one +describe in + +M. Purandare and F. Somenzi, "Vacuum Cleaning CTL Formulae," CAV 2002, +pp. 485-499, LNCS 2404. + +This algorithm applies a thorough vacuity detection to all of CTL and +to both passing and failing properties. With -d, it produces +interesting witnesses for passing properties and interesting +counterexamples for failing ones. + +The current implementation is limited in its treatment of the +operators <-> (equivalence) and ^ (exclusive or). + + +Coverage Estimation for CTL +--------------------------- + +VIS 2.1 provides two algorithms for coverage estimation in CTL model +checking. Both are invoked with options passed to the model_check +command. + +The first algorithm is the one of Hoskote et al. (DAC 1999). It +applies to a subset of ACTL. The option is -C. The second algorithm +is an improved version of the same described in + +N. Jayakumar, M. Purandare, and F. Somenzi, "Dos and Don'ts of CTL +State Coverage Estimation," DAC 2003, pp. 292-295. + +To invoke the improved coverage estimation algorithm one writes: + + read_blif_mv model.mv + init_verify + model_check -I model.ctl + + +Far Side Algorithm for Image Computation +---------------------------------------- + +By setting image_farside_method to 1, a user of VIS 2.1 can invoke the +Far Side approach to image computation which applies a compositional +method based on don't cares to speed up reachability analysis. The +algorithm is described in + +C. Wang, G. D. Hachtel, and F. Somenzi, "The Compositional Far Side of +Image Computation," ICCAD 2003, pp. 334-340. + +See the documentation of the "set" command for the details. + + +CUDD 2.4.1 +---------- + +VIS-2.0 includes CUDD 2.4.1. Compared to the version that was +included in VIS-2.0, the new version has faster grabage collection, +provides improved support for C++ compilation, contains a number of +bug fixes and several new functions, including functions for the +manipulation of prime implicants of a function. + + +Miscellaneous +------------- + +* Glu and vis can be built using g++ as compiler by configuring as + follows: + + ./configure --enable-gcc=g++ + +* The code in glu has gone through another round of rejuvenation. + This process allows vis to be built with recent versions of gcc (3.3 + and later) without producing any type-punning warning. + +* Two bugs have been fixed in early termination detection in CTL model + checking. + +* A bug has been fixed in the treatment of multi-valued inputs. + +* Vis no longer crashes when compute_reach is invoked with the -i + option. + +* Timeout values for model_check, check_invariant, and lang_empty are + now in CPU time instead of elapsed time. This is beneficial when + running regression tests in the presence of other processes. + +* The ctime command is no longer supported. + + +====================================================================== + +Version 2.0 + +Release 2.0 of VIS improves VIS 1.4 in the following areas: + +1. LTL model checking +2. SAT-based Bounded Model Checking (BMC) +3. Minimum Lifetime Permutation (MLP) algorithm for conjuction scheduling +4. Generalized SCC Hull (GSH) algorithm for greatest fixpoint + computation +5. Lockstep algorithm for language emptiness +6. Built-in regression test facility +7. CUDD 2.3.2 +8. Miscellaneous + + +LTL model checking +------------------ + +VIS-2.0 has a new command ltl_model_check that model checks LTL +formulae. The syntax for LTL is quite similar to that used for CTL. +Another new command, ltl_to_aut, translates LTL formulae into Buechi +automata. + + +SAT-Based Bounded Model Checking +-------------------------------- + +VIS-2.0 has a new command bounded_model_check for bounded LTL model +checking. The SAT solver zchaff (http://www.ee.princeton.edu/~chaff/) +must be in the executable path for this command to work. The following +sequence of commands is used to perform bounded model checking: + + read_blif_mv model.mv + flatten_hierarchy + build_partition_maigs + bounded_model_check -k 10 model.ltl + +where "-k 10" specifies the bound on the length of the counterexample. + + +Minimum Lifetime Permutation (MLP) Algorithm for Conjuction Scheduling +---------------------------------------------------------------------- + +The MLP algorithm can considerably speed up image computations. It is +selected by typing + + set image_method mlp + +For details on the algorithm, see + +I-H. Moon, G. D. Hachtel, and F. Somenzi, "Border-Block Triangular +Form and Conjunction Schedule in Image Computation," FMCAD 2000, +pp. 73-90, LNCS 1954. + + +Generalized SCC Hull (GSH) Algorithm for Greatest Fixpoint Computation +---------------------------------------------------------------------- + +The commands model_check, ltl_model_check, and lang_empty use a new +algorithm for greatest fixpoint computations. This algorithm has +different "schedules" that can be controlled with the -S option. For +details on the algorithm, see + +K. Ravi, R. Bloem, and F. Somenzi, "A Comparative Study of Symbolic +Algorithms for the Computation of Fair Cycles," FMCAD 2000, +pp. 143-160, LNCS 1954. + +F. Somenzi, K. Ravi, and R. Bloem, "Analysis of Symbolic {SCC} Hull +Algorithms," FMCAD 2002, To appear. + + +Lockstep Algorithm for Language Emptiness +----------------------------------------- + +In VIS-2.0, the commands ltl_model_check and lang_empty can use the +lockstep algorithm to perform the language emptiness check. The use +of the lockstep algorithm as an alternative to the GSH algorithm is +controlled by the -L option. For details of Lockstep, see + +R. Bloem, H. N. Gabow, and F. Somenzi, "An Algorithm for Strongly +Connected Component Analysis in n log n Symbolic Steps," FMCAD 2000, +pp. 37-54, LNCS 1954. + + +Built-in Regression Test Facility +--------------------------------- + +VIS-2.0 has a new command regression_test which allows users to +compare runs of two different versions of vis, or runs with different +options. + + +CUDD 2.3.2 +---------- + +VIS-2.0 includes CUDD 2.3.2. Compared to the version that was +included in VIS-1.4, the new version contains a number of bug fixes +and several new functions. + +In particular, there is a new function that will compute the AND of +two BDDs only if the result does not require the creation of too many +nodes. This function is used by VIS-2.0 to make clustering of the +transition relation more robust. + + +Miscellaneous +------------- + +* Improved counterexample generation in model_check with -d3 and -d4. + +* Changes in verbosity level (-v option) of model_check. The new + verbosity levels are: + -v0: unchanged (minimum verbosity) + -v1: essential statistics (new) + -v2: equivalent to the old -v1 + -v3: equivalent to the old -v2 + +* Fixed bug and extended early termination detection in CTL model + checking. + +* Fixed bug in guided search for CTL model checking which affected + counterexample generation with global hints. + +* Vis no longer crashes when a directory name is specified in a + command line instead of a regular file name. + +* Fixed several bugs in approximate_model_check, + incremental_ctl_verification, and iterative_model_check. + +* The code in glu has been substantially rejuvenated. + +====================================================================== + +Version 1.4 + +Release 1.4 of VIS improves VIS 1.3 in the following areas: + + 1. Hybrid Image Computation + 2. Guided Search for Reachability Analysis and Invariant Checking + 3. Guided Search for CTL Model Checking + 4. Least Fix-point Machine-By-Machine Approximate FSM Traversal (LMBM) + 5. Iterative Abstraction-based Model Checking (IMC) + 6. Lazy Sifting + 7. SPFD-based Placement and Logic Optimization + 8. Truesim + 9. Arithmetic Functions with Extended Double Precision (EPD) +10. CUDD 2.3.1 +11. Miscellaneous + + +1. Hybrid Image Computation +--------------------------- +Image computation is the key step in fix-point computation. +Traditionally two techniques have been used: The transition relation +method is based on conjunction of a partitioned transition relation, +whereas the transition function method is based on splitting on an +input or output variable recursively. + +The hybrid method chooses either splitting or conjunction at each +recursion dynamically using the dependence matrix. This hybrid +approach combines, in a unified framework, conjunction, input and +output splitting, and a host of auxiliary techniques that can +significantly speed up the computation. See: I.-H. Moon, J.H. Kukula, +K. Ravi, F. Somenzi, "To Split or to Conjoin: The Question in Image +Computation", Proceedings of the Design Automation Conference (DAC), +pages 73-90, 2000. + +Also, the transition function method is implemented as a part of the +hybrid computation. The transition function method itself can be used +as an independent image method. However, we do not recommend to use +this method in general cases, even though it may work well for +approximate reachability analysis. The implementation of the +transition function method is basically for experimental purposes. + +** Usage: + set image_method hybrid + set image_method tfm + +Also refer to: print_hybrid_options and print_tfm_options + + +2. Guided Search for Reachability Analysis +------------------------------------------ +VIS-1.4 introduces the use of hints to guide the exploration of the +state space. This may result in orders-of-magnitude reductions in +time and space requirements. Good hints can often be found with the +help of simple heuristics by someone who understands the circuit well +enough to devise simulation stimuli or verification properties for it. +Hints are applied by constraining the transition relation of the +system to be verified. They specify possible values for (subsets of) +the primary inputs and state variables. The constrained traversal of +the state space may proceed much faster than the standard +breadth-first search, because the traversal with hints is designed to +produce smaller BDDs. Once all states reachable following the hints +have been visited, the system is unconstrained and reachability +analysis proceeds on the original system. Given enough resources, the +algorithm will therefore search all reachable states, unless a state +that violates the invariant is found. See: K. Ravi, F. Somenzi, +"Hints to accelerate Symbolic Traversal", Correct Hardware Design and +Verification Methods (CHARME), pages 250-264, 1999. + +** Usage: + compute_reach -g : guided symbolic state space + traverse + check_invariant -g : guided search for invariant + checking + +The file HintsFileName contains a series of hints. A hint is a +formula that does not contain any temporal operators, so hints_file +has the same syntax as a file of invariants used for check_invariant. + +Also refer to: model_check -g + + +3. Guided Search for CTL Model Checking +--------------------------------------- +Guided Search for CTL is an extension of Guided Search for +reachability. It works much along the same lines, and has the same +benefits. There are a few differences. First, for greatest fixpoints +(EG, AU, and AF), it uses overapproximations of the transition +relation, instead of underapproximations. Second, there is a +distinction between local and global hints. Local hints are the +default. They can be used for any kind of CTL formula, and will apply +all hints to a subformula before moving up in the parse tree. Global +hints are only applicable to ACTL and ECTL formulae, and evaluate the +entire formula once for every hint. See: R. Bloem, K. Ravi, and +F. Somenzi, "Symbolic Guided Search for CTL Model Checking", +Proceedings of the Design Automation Conference (DAC), pages 29-34, +2000. + +** usage: + model_check -g HintsFileName : perform model check guided by the + hints specified in HintsFileName + +Also refer to: compute_reach -g + check_invariant -g + + +4. Least Fix-point Machine-By-Machine Approximate FSM Traversal (LMBM) +---------------------------------------------------------------------- +The knowledge of the reachable states of a sequential circuit can +dramatically speed up optimization and model checking. Since exact +reachability may be intractable, approximate techniques are often +preferable. Least Fix-point MBM (LMBM) method is such a technique. +It is as efficient as MBM, but provably more accurate. LMBM can +compute RFBF-quality approximations for all the large ISCAS-89 +benchmark circuit in a total of less than 9000 seconds. For more +information, see: I.-H. Moon, J. Kukula, T. Shiple, F. Somenzi, "Least +Fixpoint Approximation for Reachability Analysis," International +Conference on Computer-Aided Design (ICCAD), pages 41-44, 1999. + +** Usage: + set ardc_traversal_method 4: LMBM(least fix-point MBM, default) + is selected for ARDC + set ardc_traversal_method 5: TLMBM(combination of LMBM and TFBF) + is selected for ARDC + model_check -D 3 : model checking with ARDCs + compute_reach -A 2 : compute over-approximate reachable + states + compute_reach -D : compute exact reachable states with + the help of ARDCs + check_invariant -D : check invariants with the help of + ARDCs + synthesize_network -r 3 : synthesize sequential network + with ARDCs + +Also refer to: print_ardc_options + + +5. Iterative Abstraction-Based Model Checking (IMC) +--------------------------------------------------- +VIS-1.4 introduces an automatic abstraction/refinement algorithm for +symbolic CTL model checking. This algorithm supports full CTL +language without fairness constraints. The algorithm begins with +initial upper- and/or lower-bound approximations that include some +exact sub-transition relations of a determined set of latches for a +given CTL formula. As long as a conclusive verification decision +can't be reached due to potentially false positives and negatives, the +system is refined. Two refinement methods are implemented: Latch Name +Sorting and Latch Affinity Scheduling. For more information, See: +J.-Y. Jang, I.-H. Moon, G.D. Hachtel, "Iterative Abstraction-based CTL +Model Checking," Design Automation and Test in Europe (DATE), pages +502-507, 2000. IMC supersedes the AMC package, which may disappear in +future releases. + +** Usage: + iterative_model_check -i 8 : iterative model checking with + incremental refinement step set + to 8 latches + iterative_model_check -r 0 : iterative model checking using + Latch Name Sorting refinement + scheduling + iterative_model_check -g 1 : iterative model checking using + Positive Operational Graph only + +Also refer to: model_check, approximate_model_check, +incremental_ctl_verification + + +6. Lazy Sifting +--------------- +Lazy sifting is a new variable reordering option that is specifically +designed for sequential verification with the transition relation +method (i.e., IWLS95 in VIS). Lazy sifting groups together +corresponding present state and next state variables only when it +expects the grouping to be beneficial. See: H. Higuchi and +F. Somenzi, "Lazy Group Sifting for Efficient Symbolic State Traversal +of FSMs," Proceedings of the International Conference on +Computer-Aided Design (ICCAD), pages 45-49, 1999. + +** Usage: + dynamic_var_ordering -e lazy_sift + + +7. SPFD-based placement and logic optimization +---------------------------------------------- +This is an algorithm based on Sets of Pairs of Functions to be +Distinguished (SPFDs) that combines logic and placement optimization +of combinational circuits mapped to LUT-based Field-Programmable Gate +Arrays to improve circuit area and speed. The flexibilities in the +circuit are represented by SPFDs. The package contains two commands: +spfd_pilo - perform SPFD-based placement-independent logic optimization; +and spfd_pdlo - simultaneous placement and logic optimization. + +spfd_pilo performs SPFD-based wire and node removal/replacement and +reprogramming of combinational circuits mapped to LUT-based FPGAs to +reduce the number of wires and nodes in the circuit. Instead of +computing the flexibilities for every node in the network at once, the +algorithm computes the flexibilities for one `cluster' at a time. +Working with clusters allows us to avoid the BDD explosion problem and +hence handle large circuits. The SPFDs are computed for the cluster +and the cluster nodes are reprogrammed based on the flexibility +derived. Switching activity (computed via simulation of user specified bit +vectors or randomly generated bit vectors) is used to drive the choice +of alternate function to be implemented at the node, in such a way that +the total switching activity in the circuit is minimized. In the absence +of bit vectors, an arbitrary implementation for a node is chosen from +the bounds represented by SPFDs. + +The command spfd_pdlo implements a technique that tightly links the +logic and placement optimization steps. The algorithm is based on +simulated annealing. Two types of moves (directed towards global +reduction in the cost function of total wire length), are performed: +(1) wire removal/replacement, and (2) swapping of a pair of blocks in +the FPGA. Feedback from placement is valuable in making informed +choice of a target wire during logic optimization moves. This command +produces a placement file which is used by VPR for routing. spfd_pdlo +can be used only if VIS is linked with VPR 4.22, an +FPGA place and route tool from the University of Toronto +(http://www.eecg.toronto.edu/~vaughn/vpr/vpr.html). VPack, a tool to +convert circuits (mapped to FPGA blocks) in .BLIF format to the .net +format (used by VPR), is also needed. + +Please contact Balakrishna Kumthekar (kumtheka@avanticorp.com) for details +on integrating VPR with VIS. + +See: B. Kumthekar and F. Somenzi, "Power and Delay Reduction via +Simultaneous Logic and Placement Optimization in FPGAs," Design +Automation and Test in Europe (DATE), pages 202-207, 2000. + +** usage: + spfd_pilo -D : sets the cluster depth for SPFD + computation. + spfd_pilo -f : use simulation vectors from specified + file. These vectors are used to compute + switching activity of nodes in the circuit. + spfd_pilo -S : selects one of several methods to + choose the node to be optimized. + spfd_pilo -m : selects the heuristic to use in + optimizing a selected node. + + See 'help spfd_pilo' and 'help spfd_pdlo' for various options. + +8. Truesim +---------- +Simulates a network with a set of input vectors. Before calling this +command, the user should create a partition (using the command +build_partition_mdds). The simulation vectors can be provided by the +user (using -f vectors_file), or generated randomly. When -d option is +used, it performs event-driven true delay simulation. The fanout count +of the nodes is used as an estimate for the node delay. Primary inputs +are assumed to have arrival times of zero. + +9. Arithmetic Functions with extended double precision (EPD) +------------------------------------------------------------ +This is an arithmetic function package for extended double precision +format floating-point numbers. It supports the IEEE-754 double +(64-bit) precision floating-point number format: both the big_endian +and the little_endian. The range is from 2.2631E-4932 to +1.1897E+4932. This package is used internally to provide fast and +accurate counting of the states in large FSMs like those encountered +in approximate reachability analysis. + +10. New version of the CUDD package. +----------------------------------- +VIS-1.4 includes CUDD 2.3.1. Compared to the version that was +included in VIS-1.3, the new version contains a number of bug fixes +and several new functions. + +* Miscellaneous +--------------- + +** One bug in the CAL package has been fixed. It affected platforms without +the valloc function. + +** Changes in supported platforms. Support for SunOS 5.8 (Solaris +2.8) on the Intel x86 platform has been added. Ultrix and SunOs 4 are +no longer supported. + +** Change of Verbosity level for debugging in model_check +Debugging refers to the printing of an error-trace when a formula +fails. The new debug levels are: +-d0: no debugging (the old -d0) +-d1: minimal debugging, with less verbosity than the old -d1 had +-d2: minimal debugging with more verbosity (the old -d1) +-d3: recursive debugging (the old -d2) +-d4: interactive debugging (the old -d3) + +** Early termination in Model Checking. In limited cases, VIS will +terminate a model checking run before reaching a fixpoint. This may +lead to a speedup. + +** The set of fair states is not computed of there are no fairness +constraints. This may lead to a speedup of the model_check command. + +** Perl Script for pretty printing counter-examples. The Perl script +visdbgpp, contributed by Toshi Isogai, can be run on counterexamples +produced by vis to improve their readability. In particular, the +script collects the bits of vectors and displays them on a single +line. + +** Counterexample generation. The states on an error trace now lie +closer together, which means that, on average, fewer signal +transitions will occur. + +** Variable reordering. In flatten_hierarchy In VIS-1.4, variable +reordering is invoked automatically during flatten_hierarchy. + +** Changes of passing BDD cube arguments in VIS to CUDD. Some +arguments in the CUDD functions are BDD cubes that are generated by +the conjunctions of BDD variables on demand. VIS-1.4 pre-builds some +BDD cubes that do not change, such as for present state variables, +next state variables, and primary input variables. This speeds up +significantly large runs, especially for approximate reachability +analysis. + + +============================================================ + +Version 1.3 + +* Introduction + +Release 1.3 of VIS improves VIS 1.2 in the following areas: + +** Approximate Reachability Don't Cares (ARDCs) +** High Density Reachability Analysis. +** On-the-Fly Invariant Checking. +** Seeding Reachability Analysis via Simulation +** Forward Model Checking +** Abstraction-refinement based Incremental CTL Verification +** Synthesis +** State Transition Graph Restructuring for Low Power +** Miscellaneous + +* Approximate Reachability Don't Cares (ARDCs) + +VIS-1.3 includes the use of ARDCs in model checking and reachability +analysis. The power of using reachable states as a care set (RDCs) is +well known; however, computing reachable states exactly is intractable +in many large designs. ARDCs are an overapproximation of the +reachable states, which are then used as the care set. Computing +ARDCs is much cheaper than computing RDCs while their effectiveness in +speeding up model checking is comparable to that of RDCs. Therefore, +ARDCs are good for large designs, especially those in which exact +reachability analysis is intractable. See: I.-H. Moon, J.-Y. Jang, +G. D. Hachtel, F. Somenzi, "Approximate reachability don't cares for +CTL model checking", ICCAD'98. + +** Usage: + model_check -D 3 : model checking with ARDCs + compute_reach -A 2 : compute over-approximate reachable + states + compute_reach -D : compute exact reachable states with + the help of ARDCs + check_invariant -D : check invariants with the help of + ARDCs + synthesize_network -r 3 : synthesize sequential network + with ARDCs + +Also refer to: print_ardc_options + + +* High Density Reachability Analysis (HD) + +HD is an alternate approach to performing exact reachability +analysis. Using BDD subsetting techniques, the HD method tries to keep +the sizes of the BDDs small during the traversal. This is intended to +keep the memory occupation under control as well as make the traversal +more efficient by manipulating smaller BDDs. + +On large circuits, for which the default (breadth-first search) method +does not complete, HD is likely to find many more reachable states. +This is useful in invariant checking. +For mid-size circuits, HD is sometimes faster in completing +reachability analysis, but for smaller circuits, HD may result in too +much overhead. It is recommended to use this option when the default +method for reachability analysis fails (runs out of memory or takes +very long). Refer to Ravi and Somenzi, "High-density reachability +analysis", ICCAD'95. + +HD analysis only works with the CUDD package. + +** Usage: + compute_reach -A 1: reachability analysis with HD approach. + +Also refer to: print_hd_options + + +* On-the-Fly Invariant Checking + +Checking invariants is done by performing reachability analysis and +checking if all invariants hold in the reachable states. VIS-1.3 +does invariant checking during reachability computation (on-the-fly +verification). Invariants that fail are reported early, along with the +counter examples if requested. + +Since reachability analysis can be expensive, one may use HD in +invariant checking. For circuits on which the default reachability +analysis runs out of resources, HD will typically explore more +reachable states, and more invariants may prove false. However, the +counter examples provided by using HD may not be of shortest length. + +HD invariant checking only works with the CUDD package. + +** Usage: + check_invariant -A 1 : check_invariant where HD is used for + reachability analysis + +One may also start with an overapproximation of the reachable +states. In this case, if all invariants hold on the overapproximation, +verification is successfully completed. If not, the algorithm will +compute the exact reachable states as before, and check the +invariants that failed with the overapproximation. + +** Usage: + check_invariant -A 2 : check_invariant where over + approximation is used for reachability + analysis. + +* Seeding Reachability Analysis via Simulation + +A new option rch_simulate can be used to use simulation to augment the +set of initial states for reachability analysis. The value of the +variable is the number of random input vectors that are simulated. The +states reached in this way are considered as initial +states. Augmenting the set of initial states may sometimes lead to +faster reachability analysis, or may sometimes lead to better +underapproximations, when reachability analysis is not carried out to +completion. The commands affected by this option are compute_reach and +check_invariant. + +** Usage: + set rch_simulate n : simulate n vectors prior to + reachability analysis + + +* Forward Model Checking + +VIS-1.3 includes the capability of forward model checking based on +H. Iwashita, T. Nakata, F. Hirose, "CTL model checking based on +forward state traversal", ICCAD'96. Standard "backward" CTL model +checking uses only preimage computations. Forward model checking tries +to use image computations in place of preimage computations as much as +possible, because they are typically faster. +According to our experiments, forward model checking gives drastic +performance improvement in many designs, but we have also seen many +cases in which forward model checking does much worse. Performance +depends on the design. + +** Usage: + model_check -F : model checking based on forward traversal + + +* Incremental CTL Verification + +The command "incremental_ctl_verification" (aliased to "icv") +performs verification of CTL formulas following the incremental +paradigm described in A. Pardo, G. Hachtel, "Incremental CTL model +checking using BDD subsetting", DAC'98. The algorithm starts with an +initial simple approximation of the verification and then proceeds at +refining the different evaluations until the formula can be proved +conclusively. The approximation technique currently adopted makes use +of BDD approximation techniques. As implemented in release 1.3, +incremental_ctl_verification supports fairness constraints, but tends +to be less efficient than model_check when they are specified. + +Incremental verification works only with the CUDD package. + +** Usage: + incremental_ctl_verification [options] ctl_file + + +* Synthesis + +VIS 1.3 includes a new command "synthesize_network" (aliased to +"synth") to transform both combinational and sequential circuits into +multi-level boolean networks using symbolic factorization based on +Zero-suppressed BDDs (ZDDs). In the case of sequential circuits, only +the combinational part of the circuit is synthesized: state encoding +is not altered. The emphasis of this algorithm is on the reduction of +the number of literals in the factored form of the network. The final +multi-level circuit can be obtained in either the BLIF format or the +equation format. Designs described in BLIF or BLIF-MV format can be +used as an input to this command. However, multiple valued variables +are not supported. Hence, signals in the designs described in BLIF-MV +need to be restricted to binary values. + +Synthesis can be used only when VIS is linked with the CUDD package. + +** Usage: + synthesize_network [options] + +* STG Restructuring for Low Power + +VIS-1.3 includes a new command "restruct_fsm". This command +implements a State Transition Graph (STG) restructuring algorithm +that exploits the existence of equivalent states to decrease power +dissipation, not necessarily by collapsing the equivalence states, but +by redirecting transitions in the graph. This algorithm is based on +the monolithic transition relation. The complexity of the algorithm +in general increases with an increase in the size of the state +transition graph, which depends on the number of state variables and +primary inputs. The algorithm can handle circuits described in both +BLIF and BLIF-MV formats. However, multi-valued variables are not +supported. Also, the final synthesized circuit (network implementation +of the restructured STG) is available only in BLIF format. The +sequential circuit should have a single initial state. For more +details see, B. Kumthekar, I.-H. Moon, F. Somenzi, "A Symbolic +Algorithm for Low-Power Sequential Synthesis", ISLPED 97. + +STG restructuring works only with the CUDD package. + +** Usage: + restruct_fsm [options] + +* Miscellaneous + +** New versions of CUDD and CAL packages. +VIS-1.3 includes CUDD 2.3.0 and CAL 2.0.1. Compared to the versions +that were included in VIS-1.2, the new packages have better +performance and improved statistics reporting. + +** Changes in configure +Configure now defaults to using 32-bit pointers on DEC Alpha machines. +To use 64-bit pointers, invoke "configure" with "--enable-64." + +** gmake check +"gmake check" now consistently runs the local executable using the +examples in the master source directory. Previously, there were +different versions for local-area and central-area checks. + +** Native Compiler. +The configuration scripts now try to use the native C compiler (cc) by +default. The use of gcc can be forced by running configure with the +option --enable-gcc. On AIX and SunOS, however, only gcc is +supported. + +As a result, the following configuration options have been removed + + --with-comp-mode=solaris + --with-comp-mode=mips + --with-comp-mode=alpha32 + --with-comp-mode=alpha64 + +Configure now defaults to using 32-bit pointers on DEC Alpha machines. +To use 64-bit pointers, invoke "configure" with "--enable-64." + +** Changes in supported platforms. +VIS-1.3 has been tested under IRIX 5.3 with both cc and gcc. +VIS-1.3 has been tested under HP-UX with cc. (Previously only gcc was +supported.) +VIS-1.3 linked with the CAL BDD package currently does not work under +CYGWIN32. When the problems are fixed, we shall issue a patch. + +** Uniformity across platforms. +VIS-1.3 provides enhanced architecture independence. For the commands +model_check, approximate_model_check, compute_reach, +incremental_ctl_verification, check_invariant, and lang_empty, the runs +will be exactly the same on every platform with the same memory limits. +Previously, invocations of reordering, and hence BDD sizes could differ +from platform to platform. + +** Changes to static_order. +The static_order command has changed substantially. For combinational +circuits, VIS-1.2 and earlier releases effectively generated random +orders regardless of the method specified by the user. (Sequential +circuits did not have this problem.) The randomness of the orders was +due to a bug that has been fixed in VIS-1.3. For all +circuits---combinational and sequential---the default ordering method +is a new algorithm called "interleave." The new default method is +substantially more memory efficient than the previous default method +(merge_left). The quality of the resulting orders is comparable. + +** New -v option for dynamic_var_ordering. +The option -v 1 can be specified to cause VIS to write a one-line +message whenever dynamic reordering is executed. The message reports +the reduction in BDD or ZDD size, and on the time taken by reordering. +This option is only effective with CUDD. + +** New -i option for comb_verify and seq_verify. +It is now possible to print statistics on BDD usage and performance +when running combinational or sequential verification. This is done +by specifying the -i option for comb_verify and seq_verify. It is +important to notice that these two commands use a local BDD manager, +which is destroyed before control is returned to the user. It is not +therefore possible to use print_bdd_stats to inspect the statistics of +the BDD package when invoking either of the two commands. + +** Default method for build_partition_mdds changed to inout. +The default method has been changed to inout, because this has been +found to produce better results than frontier in many cases. The +frontier method can build the partition MDDs in more cases than the +inout method; the latter, however, tends to give better performance +during model checking. + +** set ctl_change_bracket [yes/no] +VIS-1.3 includes this set command option for the CTL parser. VL2MV +automatically converts "[]" to "<>" in node names, therefore the CTL +parser does the same thing. However, in some cases a user does not +want to change bracket type in the CTL formulas. This can be +accomplished by setting this set command option to "no." The default +is "yes". The commands affected are check_invariant, model_check, +approximate_model_check, and incremental_ctl_verification. + +** Printing time for model checking +VIS-1.3 includes printing time for model checking. If verbosity is set on, +then the model checking time for both each formula and total will be printed +out. + +** Incremental reachability analysis and invariant checking. +In VIS-1.3 it is possible to perform reachability analysis +incrementally. The -d option of compute_reach specifies how many +steps (image computations) should be performed at most before +returning control to the user. If compute_reach is invoked more than +once with the -d option, each time reachability analysis starts from +the previous result. If check_invariant is invoked after +compute_reach has been invoked with the -d option, the partial +reachability results are used to speed up verification. + +** Completeness and determinism check in flatten_hierarchy +The check for completeness and determinism performed by +flatten_hierarchy that was previously optional is now always +performed. The -b option to flatten_hierarchy and init_verify has no +effect in VIS-1.3 and is retained for compatibility with existing +scripts. It may disappear in future releases. Users of VIS-1.3 will +observe modest increases in the time taken to flatten the +hierarchy. + + + +Version 1.2 + +* Introduction + +** Improvements + +*** Over 10x performance improvement in model checking for many examples +*** extended CTL syntax +*** better access to the BDD parameters and statistics +*** enhanced user interface +*** improved portability and flexibility of configuration + +** New verification algorithms + +*** approximate_model_check: model checking of ACTL formulae for systems + that are too large for model_check +*** res_verify: residue based verification of arithmetic circuits + +* Performance improvement in model checking + +** We have changed image computation (the underlying operation of + model checking) to make the best use of don't care sets. The don't + cares arise from unreachable states, and using them appropriately + reduces the BDD sizes significantly, leading to improved + performance of model checking. In addition, we have fixed a + performance bug that caused repeated computation of simplified + transition relations. We performed a performance comparison with + VIS 1.1 on a set of examples, and on some cases we observed more + than 30x performance improvement. In fact, on some examples VIS 1.2 + could finish model checking in about 26 secs whereas VIS 1.1 took + about 2400 secs. + +** The model checking runs that use don't cares (-D option different + from 0) are those that benefit the most from the changes in VIS + 1.2. In general it is not trivial to tell whether -D 1 or -D 0 will + produce the faster CPU time. An empirical approach consists of + running "compute_reach -t 300" (reachability for 5 + minutes). Depending upon the progress in reachable state + computation, one can then invoke model checking with -D 0 or -D 1. + +* Approximate Model Checking + +** VIS 1.2 includes a new command approximate_model_check, a model + checker that performs ACTL model checking on an abstracted and + flattened network. The command is designed to tackle the state + explosion problem we encounter when dealing with large and complex + circuits. Based on the initial size of the group (of latches), the + command constructs an over- or under-approximation of the + transition relation of the system. These approximations may not + contain every detail of the exact system. However they may contain + enough information to determine whether the formula is positive or + negative. Starting from an initial coarse approximation, the + command makes its effort to prove whether the given ACTL formula is + true or false. When the procedure fails to prove correctness of the + formula with initial approximations, it automatically refines the + approximations. It repeats the process until the algorithm produces + a reliable result or the available resources are exhausted. For + detailed description, refer to the relevant manual page ("help + approximate_model_check from" the VIS shell). + +** approximate_model_check is faster than model_check for some of the + VIS 1.2 distribution examples. However, significant improvements + over the exact computation can be seen for even larger examples + such as s15850. The current version of the code does not perform + any refinements. The refinement techniques similar to the "machine + by machine" and "frame by frame" may be implemented in future + version. Furthermore, more aggressive reduction of the initial + states can be performed while proving whether the ACTL formula is + positive. The reduction of the initial states are made for each + level of the lattice of approximations in this version. + +** The current version includes two distinct "grouping method". More + experiments are required to determine better grouping method(s). + +** The current version only supports ACTL formulae. + +* Residue Based Verification + +** VIS 1.2 includes a new command "res_verify" for combinational + verification based on residue arithmetic. Residue-based + verification is especially suited to multipliers and other + arithmetic circuits. See below, however, for a discussion of the + application of "res_verify" to other circuits. This command is only + available if VIS has been linked with the cu library (default). + +** The command res_verify takes two circuits (specification and + implementation) whose equivalence is to be established, and an + order for the outputs. The order for the outputs allows res_verify + to interpret the output vectors as integers. Based on this + interpretation, res_verify applies the Chinese remainder theorem to + the equivalence verification: the specification and the + implementation are equivalent if, for a suitable set of relatively + prime numbers, the residues of their outputs are equivalent. The + residues are computed by composing the two circuits into a function + representing the residue computation. + +** res_verify allows the user to specify what pairs of outputs of the + circuits should be compared directly by building their BDDs, + instead of computing residues for them. The -d option controls + this feature; n pairs of outputs, starting from the least + significant bits of the output vectors, are verified directly if -d + n is specified. + +** As a special case, the user can specify -d all. This causes + res_verify to directly verify all the output pairs, effectively + foregoing residue verification. This can be useful for + non-arithmetic circuits that are not suited to residue + verification. In this case res_verify works similarly to + comb_verify, with a significant exception: res_verify verifies one + output at the time. This often translates into reduced memory + requirements and CPU times. + +** res_verify can be applied to pairs of sequential circuits with the + same state encoding. Several options and VIS variables control the + detailed behavior of the command. Refer to the on-line + documentation for the details (help res_verify). + + +* Extended CTL Syntax + +** Users can now write CTL fomulae using vector notation. Vector + variables have the form of var[i:j] and each bit can be written as + either var or var[i]. For instance, the following formulae are + valid. + + counter[3:0] = 10 + counter[3:0] = b1010 + counter[3:0] = {1,2,10} + + The formula in the last line is true if counter has one of the listed + values. + +** Macros can be defined and used in CTL formulae to stand for subformulae. + For instance: + + \define VALID_INPUT (a[3:0]=0 -> b=1) + + defines the macro VALID_INPUT, which can be later used in a formula + like this: + + AG(start=1 * \VALID_INPUT -> AF(res[7:0]=b10101010)); + +** The CTL parser allows users to write the following formulae: + + var1 == var2 + var1[i:j] == var2[k:l] + + The first formula is equivalent to (var1=1) * (var2=1) + (var1=0) * + (var2=0) and currently is allowed only in the boolean domain. (It + cannot be used for variables of enumerated types.) The second formula + can be used if the lengths of two vectors match. + +** AX:n(f) is allowed as a shorthand for AX(AX(...AX(f)...)), where n + is the number of invocations of AX. EX:n(f) is defined similarly. + + +* BDD manipulation + +** VIS 1.2 incorporates Release 2.1.1 of CUDD and an improved version of + CAL. Improvements specific to CUDD and relevant to VIS are: + +** All reordering methods preserve variable groups. Variable groups are + created by VIS to keep corresponding present and next state variables + adjacent. In VIS 1.1 only method "sift" retained the variable groups. + +** CUDD determines the maximum size of the computed table based on the + amount of main memory available. On systems where getrlimit is + available, the datasize limit is used to determine how much memory + is available. CUDD allows the computed table to grow up to one + fourth of that amount. This feature allows VIS to self-calibrate + for optimum performance. The computed table will not necessarily + grow to its maximum value, and VIS is not guaranteed to stay within + the memory bound returned by getrlimit. If the datasize limit is + not set, if getrlimit is not available, or if it is available but + does not know about datasize, then a suitable default value is used + instead. The default value is normally 16MB. This value can be + changed at configuration time. Even a value as low as 16MB gives a + reasonably sized computed table for small-medium runs. However, for + large runs--hundreds of MB--the ability to set the memory limit may + produce much faster execution. The maximum computed table size can + be set also from within VIS with set_bdd_parameters. + +** CUDD now provides access to the package parameters and statistics + via the commands bdd_print_stats and set_bdd_parameters. The + parameters that can be set control the sizing of CUDD's main data + structures (unique table and computed table) and many aspects of + the variable reordering algorithms. The parameters reported refer + to memory occupation, computed table (cache) performance, and + variable reordering. + +** It is now possible to impose a limit on the number of variable + swaps performed during reordering. + + +* User Interface + +** New VIS command "set_bdd_parameters". + + The command "print_bdd_stats" prints two sets of data from the + underlying BDD package, parameters and statistics. The parameters + can be modified as follows. By using the "set" command, set the + value of a variable whose prefix is "BDD." and whose suffix is + exactly the name seen in the output of the command + "print_bdd_stats", for example: + + vis> set "BDD.Garbage collection enabled" no + + Then, the command "set_bdd_parameters" reprograms the underlying BDD + core based on the values of the variables of this type. + +** Readline Library. + + The Readline library is a GNU package that provides command line + editing, command history, and file name completion capabilities. If + the system where VIS is built has this library and it is installed + so that the linker can use it, the configure script will detect + this situation and the executable will be linked with + libreadline.a. + +** Variable Interpolation. + + The VIS shell now allows variable interpolation. For instance, typing + + vis> echo $open_path + + causes vis to echo the current value of open_path. Typing + + vis> set open_path $open_path:/some/path + + will append /some/path to open_path. Variable interpolation can be + used also to exchange parameters with scripts. This allows reliable + parameter passing even when "source" is called with options. + +** PAGER + + If the PAGER environment variable is set, VIS uses it to choose the + program used to display the help pages. If PAGER is not set, VIS + uses 'more.' + +** File Buffering. + + The output of VIS when run in batch mode is now line buffered on + systems that provide setvbuf. This makes it more convenient to + observe the evolution of long-running jobs. + +* Portability and Configuration + +** VIS 1.2 runs on two new platforms: IBM RS6000 running AIX and Intel + Pentium running Windows95 with Gnu-Win32. The Gnu-Win32 environment + (http://www.cygnus.com/misc/gnu-win32/) is a freely available GNU + environment for Windows 95 and Windows NT. + +** This release of VIS has been tested with some native compilers + (Ultrix, Solaris, Digital Unix). In particular, when building with + the native compiler on a DEC Alpha running Digital Unix, the option + is provided to compile with 32 bit pointers. Please see the README + file for specific instructions on how to compile with the different + native compilers. + +** The GLU library now provides portable functions for random number + generation and sorting that help make results reproducible across + different platforms. + +** The GLU library now provides a function to read the available + memory (based on getrlimit). This function is currently used by the + CUDD package to choose the optimal size of data structures. For + systems without getrlimit a suitable default is provided and can be + changed at configuration time. + + + +Version 1.1 + +* Introduction + +** Improvements over 1.0 + +*** multiple BDD packages +*** more synthesis capability +*** hierarchy restructuring +*** new methods for partitioning +*** automatic reduction during model checking +*** support for multi-phase clocking and transparent latches +*** support for invoking standard scripts +*** support for graphically viewing simulation output + + These significantly improve VIS's performance in terms of computer + time, memory usage, and ability to complete on larger designs. + Further, additional capability for synthesis is provided. + + One particular example of the improved performance of VIS 1.1 is the + first (to our knowledge) reported exact state space traversal of + benchmark s5378. It was run with the cu BDD package on an Alpha + 300MHz (using 32 bit pointers). The datasize limit was set at + 1GB. The process grew to about 440MB. Dynamic reordering was enabled + all the time and occurred more than 50 times. The orginal ISCAS89 + circuit was used, which has 179 latches. + +*** Multiple BDD packages + + We have added the capability to run VIS with three different BDD + packages, cu - from University of Colorado, cal - from UC Berkeley + and cmu - from Carnegie Mellon University. Further details are in + the section "BDD Packages" below. + +*** Synthesis + + VIS synthesis is represented by a number of commands, write_blif, + read_blif, collapse_child, and decompose_child. These allow the + user to manipulate the hierarchy and to write blif files to SIS + and then later read in an optimized file. Each of these commands + can be executed on sub-nodes or sub-trees of the + hierarchy. Details about these commands are in the section + "Collapsing and decomposing a hierarchy" and "Reading and writing + blif files" below. + +*** Partitioning + + Partitioning in VIS is used in a number of places: simulation, + model checking, computing the set of reached states, etc. Recall + that the VIS data structure is simply a set of tables with outputs + (signals) which can be inputs to other tables. There are also + primary input signals and inputs from latches. Some signals are + primary outputs and/or inputs to latches. A partition is simply a + subset of nodes (signals) which are to be preserved, the remaining + are to be eliminated. Of course, primary outputs and inputs to + latches cannot be eliminated. We provide some new partitioning + methods as described below (in the section "Creating partitions of + the network"). + + In many cases, a formula to be model checked does not depend on + all of the signals in the design. In such cases, the design can be + reduced to include only signals in the transitive fan-in of the + latches mentioned in the CTL formula plus the fairness + constraints. This reduction can result in vastly more efficient + model checking. + +*** Multi-phase clocking + + One question that is asked frequently is how does VIS support + multi-phase clocking and transparent latches in Verilog. We + provide this capability in our Verilog compiler "vl2mv" and detail + this in a document that describes exactly the steps to be + taken. This document is in the vis-1.1/doc directory and is called + two_phase.ps. + +*** Standard scripts + + Standard scripts have been provided which should help the new user + select certain options that we have determined to be good choices + on a variety of examples. The scripts are divided into two + categories: simple - which are recommended for small/medium + examples, and robust - recommended for large examples where + completion rather than compute time is the most important + concern. The 10 scripts provided are summarized below in the + section "Standard scripts". + +*** xsimv + + Finally, we have included "xsimv", which provides a graphical + method for viewing simulation output. This is detailed in the + section "Using Xsimv". + +* Multiple BDD packages + + We have added the capability to run VIS with three different BDD + packages, cu - from University of Colorado, cal - from UC Berkeley + and cmu - from Carnegie Mellon University. The commands for these + respectively are vis-cu, vis-cal, and vis-cmu. The cmu package is + the same as in VIS 1.0. The cu package is very strong in having a + fast dynamic variable reordering capability. In addition, cu has + been upgraded for the DEC alpha machines so that it uses 32 bit + pointers, instead of 64 bit pointers; hence it realizes a factor of + 2 in memory savings on such machines. The other two packages remain + to be upgraded for 32 bit pointers on the DEC alphas. The cal + package uses the BFS BDD technique and is particularly good at + avoiding paging on large designs. For most problems, we recommend + the cu package. + +* Reading and writing BLIF files + + The "write_blif" command in vis-1.0 only wrote out the combinational + part of an hnode (a node of the hierarchy). Now this functionality + is performed by the "write_blif -c" command. Other options have been + added as well. The options are: + + (1) write_blif -l + + writes out the latches of the hnode as well. Additionally, all + latch IOs are made into POs in the blif file that is + created. This ensures that the these nodes do not get optimized + away by SIS, so that mv-latches can be re-inserted by the + read_blif command in VIS. + + (2) write_blif -c + + same as "write_blif" of vis-1.0 + + (3) write_blif + + writes out latches of the hnode, but does not make latch IOs + into POs in the blif file. The .blif and .enc files that are + generated by this command currently cannot be guaranteed to read + back into VIS correctly using the read_blif command. + + (4) write_blif -R + + recursively writes out the entire hnode hierarchy rooted at the + current hnode, to a blif file. This command opens up a direct + path from Verilog to pure blif files and hence to synthesis in + the SIS framework. For this command to work, 1) all variables + in the hnode hierarchy rooted at the current hnode must be + binary, 2) all tables should be deterministic, and 3) there must + be a unique initial state. + +* Collapsing and decomposing a hierarchy + + If the user travels (via "cd" commands) to a particular node in the + hierarchy and does a "write_blif", only the logic in the *current* + node gets written out. The user might want to collapse some of the + child nodes together and do synthesis in the "collapsed" node. The + "collapse_child" command does just that. The usage is: + + collapse_child + + and the effect is that the child node is absorbed by the parent. By + successive invocations of this command, multiple nodes can be + collapsed into a single node. + + "decompose_child" is a command that effects the inverse operation of + collapse_child. The user can specify components of the current node + to be grouped as a separate newly created child node. The user must + also specify the name of the new child. Successive invocations of + "decompose_child" can be used to effect multiple + decompositions. "decompose_child" provides the infra-structure for + implementing and testing FSM decomposition algorithms (to appear + later). + + Together, collapse_child and decompose_child provide powerful + primitives that can be used to restructure the design hierarchy. + +* Creating a flattened network for verification + + The important change to note is the "-b" option in the + "flatten_hierarchy" command. By default this option is off, + implying that the system is not checked for complete and + deterministic specification. However, if the given design does not + meet this criteria, model checking may produce wrong results. (Note: + In VIS nondeterminism is handled by providing pseudo-inputs. + Internally all the tables are deterministic and completely + specified.) Invoking this "-b" option forces the necessary + checking. However this can be computationally expensive. The best + strategy is to invoke "flatten_hierarchy" with "-b" option the first + time and if the check passes, use it without "-b" option in + subsequent runs. + +* Creating partitions of the network + + Three new methods for creating partitions for the "build_partition_mdds" + command have been added. + + - partial + + This can be used to perform partitioning while forcing a + user-specified set of signals (nodes) in the partition. The + set of nodes to be included can either be supplied in a file, + or on the command line. + + - boundary + + In this method, all nodes that are sub-circuit IOs are + included in the partition. + + - frontier + + In this method (the default method), the user specifies a + parameter "partition_threshold" which is used to include an + intermediate variable whenever the BDD size for a node in the + network increases beyond the threshold value. This method is + very useful when it is not possible to create the next state + functions in terms of primary inputs because of large BDD + sizes. This method encompasses both "in_out" and "total" + partitioning methods (corresponds to very large and 0 value of + "partition_threshold", respectively). The parameter can be set + by invoking the following from the VIS commandline: "set + partition_threshold ". + +* Reachability computation + + A few new options to reachability computation have been added + (command: compute_reach). + + + -d depthValue + + Used to perform reachability up to a certain number of + steps. + + -r threshold_value + + Invokes dynamic reordering of variables ONCE, after the + size of the reached state set crosses the threshold_value. + +* CTL Syntax + + For Verilog compatibility, && and || are supported in addition to * + (Boolean AND) and + (Boolean OR) respectively. + +* Model checking + + The mc command, by default, now reduces the model FSM with respect + to the union of all the formulas in the CTL file and uses the + reachability don't cares (thus reachablilty is done first before any + model checking). Also, -d 0 is the default now, i.e. no error trace + is computed. The -r option has been modified and a new capability + for sharing sub-formulas has been added. + + -r + + (This option has been modified). If this option is used, each + formula is model checked individually on an FSM reduced with + respect to the formula. + + -c + + This disables the default that sub-formulas of the formulas given + in the CTL file are shared. The sharing of sub-formulas makes sure + that a sub-formula in the set of all sub-formulas of the formulas + in the CTL file is evaluated only once. If both -r (formula + dependent FSM reduction) or "-D 1" (use reachability don't cares) + are enabled, this facility is automatically disabled. (Note that + currently if the same sub-formula occurs more than once within a + single formula, it may be checked twice.) + +* Standard scripts + + There are 10 standard scripts provided (in the "share" directory), + divided into two categories, simple and robust. The simple scripts + work best on small/medium size examples. The robust scripts are + recommended for large problems where the objective is to complete + the computation without too much concern for computation time. Below + are the scripts with their required arguments. All scripts assume + that a BLIV-MV file has already been read in. + + script_generic.simple + script_compute_reach.simple + script_model_check.simple foo.ctl + script_fair_model_check.simple foo.fair foo.ctl + script_lang_empty_check.simple foo.fair + + script_generic.robust + script_compute_reach.robust + script_model_check.robust foo.ctl + script_fair_model_check.robust foo.fair foo.ctl + script_lang_empty_check.robust foo.fair + + In all cases, "script_generic" is a preample to the other scripts. + Generally, we recommend trying a "simple" script first, since it + should be the fastest. + +* Using "xsimv" + + Before invoking xsimv, please modify the first line of the file + "xsimv" and put the complete path name for "expectk". + + xsimv is invoked by the command + + xsimv + + where is a file produced by the vis command + + simulate -n -o + + When xsimv executes, it comes up with a window with 4 buttons in it, + GO, ReDraw, Save and Quit. At the same time it produces a file, + "strk.simv", with the signal names in it. For example + + sensor.rand_choice + timer.rand_choice + car_present + farm_light + hwy_light + timer.state + + If only a subset of these names are required the user can edit this + file and comment out a line using "#". For example, + + #sensor.rand_choice + #timer.rand_choice + car_present + farm_light + hwy_light + timer.state + + will cause the first two signals' simulation to be not displayed. + + Pushing GO or ReDraw then produces a new window with the simulation + results shown where time increases from left to right. The signal + value names not commented out are shown vertically, one for each + row. The "edit strk.simv" and REDRAW sequence can be iterated. + + +Version 1.0 + +* Initial release Index: vis_dev/vis-2.3/README =================================================================== --- vis_dev/vis-2.3/README (revision 14) +++ vis_dev/vis-2.3/README (revision 14) @@ -0,0 +1,477 @@ +This is release 2.3 of VIS, a system for verifying and synthesizing +finite-state systems. VIS builds on GLU, a collection of BDD packages +and low-level utilities. + +To build VIS and GLU, you will need + + * An ANSI C compiler (gcc will do, as will several versions of cc) + * GNU Flex version 2.5 or greater + * GNU Bison version 1.22 or greater + * GNU's make utility + * GNU's gzip utility + * Approximately 90 MB of free disk space for the build of both + vis and glu + * Approximately 60 MB of free disk space for the installation + +--------------------------------------------------------------------------- +* Useful Addresses + +The most recent version of vl2mv, the Verilog compiler designed to work +with VIS: + + ftp://vlsi.colorado.edu/pub/vis/vl2mv-2.3.tar.gz + +The most recent versions of VIS and GLU: + + ftp://vlsi.colorado.edu/pub/vis/{glu-2.3.tar.gz,vis-2.3.tar.gz} + +The VIS home page, which includes additional documentation: + + http://vlsi.colorado.edu/~vis + +The most recent version of the GNU tools: + + http://www.gnu.org + +The most recent version of perl, which is required to run 'visdbgpp': + + http://www.cpan.org + +The most recent version of expectk, which is required to run 'xsimv': + + http://expect.nist.gov + +The most recent version of Tcl/Tk, which is required to run 'expectk': + + http://www.scriptics.com/ + +Optionally, the most recent version of cusp, the SAT solver which +can be used instead of CirCUs 1.0 (included in VIS) to execute the +bounded_model_check command: + + ftp://vlsi.colorado.edu/pub/CUSP/cusp-1.1.tar.gz + +--------------------------------------------------------------------------- +* Platforms + +This is the list of architecture/operating system/compiler +combinations we have tested. (For installation with compilers marked +with (*) please refer to the Platform Specific Instructions.) + + * Intel ia32 / Linux / gcc, g++ + * Intel x86_64 / Linux / gcc, g++, icc(*) + * Intel ia32/x86_64 / Windows XP with Cygwin 1.5.16-1 / gcc, g++(*) + * Intel ia32 / Mac OS X / gcc(*) + +The following platforms are no longer supported, but should still work. + + * IBM RISC System/6000 / AIX Version 4.3.3 / gcc(*) + * Intel ia64 / Linux / gcc + * Sun Sparc/ Solaris 2.8 / gcc, g++, cc(*) + +The following instructions are for the generic build process. Before +building the tool please refer to the section "Platform Specific +Instructions". + +--------------------------------------------------------------------------- +* Building VIS + +To build a VIS executable for a single operating system: + +1. Download the most recent versions of VIS and GLU from the address + above into a convenient directory, (e.g., /tmp). + +2. Move to where you would like to build VIS and GLU and unpack the + distributions: + + % cd /home/vis # for example + % gzip -dc /tmp/glu-2.3.tar.gz | tar xf - + % gzip -dc /tmp/vis-2.3.tar.gz | tar xf - + +3. Move into the glu-2.3 directory and run configure, which will + determine some system-specific parameters and create the Makefile: + + % cd glu-2.3 + % ./configure + + By default, this will use your system's native compiler. To use gcc, + + % ./configure --enable-gcc + + (You may want to do this because you don't have the native compiler + installed or because it is not ANSI.) + + Note: For platforms where VIS is not supported for the native compiler, + the default compiler is set to gcc. + + Note: Not all checks in ./configure will return "yes." This is + normal and should not affect compilation. However, do be concerned + with any warnings "configure" produces. + + Note: Occasionally, configure will make a bad guess or will choose + a default you do not want. In this case, simply edit the Makefile + after configure finishes. + + Note: You may want to specify parameters to configure -- see the + "Installing" sections below. + + Note: To parallelize the installation procedure, you can begin steps + 5 and 6 at this point, as long as step 4 completes before step 6 + (since VIS must link against the GLU library). + + Note: The Makefile by default uses the "-g" option for + compilation. The resultant "vis" executable may be much larger than + the executable generated without using the "-g" option. Using the + "-g" option however, provides debugging capabilities. + + Note: The following is of interest only to people developing code + within vis. For full debugging support, specify + --with-comp-mode=debug. This will turn off optimization, and turn + on the assertions (sanity checks) in the code. Similarly, + --with-comp-mode=purify and --with-comp-mode=quantify will link vis + with IBM Rational's Purify or Quantify tool, if it is installed. + +4. Build the GLU system by running GNU's gmake utility: + + % gmake + + You may not have GNU make installed on your system under the name + 'gmake' -- try make. If this fails, you probably need the latest + version of GNU's make program -- download it from the address + above. + +5. Move into the vis-2.3 directory and run configure: + + % cd ../vis-2.3 + % ./configure + + By default, this will use your system's native compiler. To use gcc, + + % ./configure --enable-gcc + + (You may wish to do this because you don't have the native compiler + installed or because it is not ANSI.) + + Note: For platforms where VIS is not supported for the native compiler, + the default compiler is set to gcc. + + Note: If you supplied compilation-option flags (e.g., --enable-64) + to the GLU configure, provide the same to the VIS configure. + + Note: Not all checks in ./configure will return "yes." This is + normal and should not affect compilation. However, do be concerned + with any warnings "configure" produces. + + Note: Occasionally, configure will make a bad guess or will choose + a default you do not want. In this case, simply edit the Makefile + after configure finishes. + + Note: You may want to specify parameters to configure -- see the + "Installing" sections below. + + Note: You may want to remove the "-g" flag from the make file. See + under 3. + +6. Build the VIS system by running GNU's gmake utility: + + % gmake + + This builds an executable "vis" in the current directory. + + WARNING: If you are not successful in building a VIS executable, + double check that you are using Flex version 2.5 or greater (check + using "flex -V") and GNU Bison version 1.22 or greater (check with + "bison -V"). Having out-of-date versions of these programs can + lead to obscure compilation and linking errors. You can download + the new versions from the GNU FTP address above. + + VIS expects to find master.visrc, two .nawk files, and a directory + of help files in the directory given by the environment variable + VIS_LIBRARY_PATH. Set this to the "share" directory in the source + tree: + + % setenv VIS_LIBRARY_PATH $cwd/share + +7. OPTIONAL: Verify VIS works by running it on some of the examples + included in the distribution: + + % gmake check + + This step finishes in less than five minutes on most machines + and requires approximately 32 MB of RAM. + +--------------------------------------------------------------------------- +* Installing GLU: + +Developers will want to install the GLU library and its associated header +files in a central area: + +To install the GLU library and its header files, type, while in the +glu-2.3 directory, + + % gmake install + +By default, this will put libraries and headers in /usr/local/lib +and /usr/local/include respectively. To choose a different +location, provide a default prefix when you invoke configure, e.g., +to install in /projects/glu/bin, etc., use + + % ./configure --prefix=/projects/glu + +when configuring GLU. Note that "tilde expansion" doesn't work for the +prefix (i.e., don't specify --prefix=~smith/glu). + +--------------------------------------------------------------------------- +* Installing VIS: + +Administrators and people who want to discard the source files after +building VIS may install VIS in a central area: + +To install the VIS executable, library, headers, and help files, type, +while in the vis-2.3 directory, + + % gmake install + +By default, this will put binaries, libraries, headers, and help files +in /usr/local/bin, /usr/local/lib, /usr/local/include, and +/usr/local/share respectively. To choose a different location, +provide a default prefix when you invoke configure, e.g., to install +in /projects/vis/bin, etc., use + + % ./configure --prefix=/projects/vis + +when configuring VIS. + +"gmake clean" removes all the files generated during "gmake." This is +useful when you want to rebuild VIS with a different prefix, +different compiler options, etc. + +During configure if --prefix option is used, files found in the +"share" directory will be installed in $prefix/share/vis; otherwise +they will be installed in /usr/local/share/vis by default. Set the +environment variable "VIS_LIBRARY_PATH" to the appropriate directory so +that VIS can find master.visrc, the two .nawk files and the "help" +directory. The above mentioned files can also be present in a +different directory, but "VIS_LIBRARY_PATH" should be set to that +directory. For example, + + % setenv VIS_LIBRARY_PATH /projects/vis/common + +--------------------------------------------------------------------------- +* Installation for multiple platforms + +To install VIS on multiple operating systems depending on the same +source tree, see the file "INSTALL" included in the distribution. + +In this case, when the build directory is different from the source +directory, it's necessary to configure VIS to look elsewhere for the +GLU libraries and headers, e.g., + + % ./configure --with-glu-libdir=/tmp/glu-2.2/alpha \ + --with-glu-incdir=/tmp/glu-2.1/include + +Also, make sure that there is an obj/ directory in the directory in +which you are compiling. See ./configure --help for more information. + +--------------------------------------------------------------------------- +* Selecting a different BDD package + +To create VIS with a different BDD library (say cal) than the default +one (cu), use the following command: + + %./configure --with-bdd=cal + +The same can be achieved by changing the "BDDPKG" definition in the +Makefile from "cu" to "cal". + +VIS can work with three different BDD packages (cmu, cal, cu), all of +which are supplied with glu-2.3. However, some commands in VIS are +available only with the cu BDD package. Please refer to the NEWS file +for more details. + +--------------------------------------------------------------------------- +To create three versions of VIS, each with different BDD libraries, +run 'gmake allprods'. This will create vis-cal, vis-cu, and +vis-cmu. To verify whether all these executables are compiled +correctly, use 'gmake check-allprods' at the end. +--------------------------------------------------------------------------- + +* Files in the VIS distribution: + +README This file. + +INSTALL Generic installation instructions for use with configure, + including instructions for simultaneous multi-platform + builds. These are not specific to VIS nor GLU, so don't + follow them word for word. + +NEWS Changes since the last version/release. + +configure An executable shell script that creates "Makefile" from + Makefile.in after determining system-specific parameters. + +configure.in Autoconf source for generating the configure file. + Only needed if you want to modify the configure script. + +Makefile.in The template Makefile. + +vis.1 Unix-style man page documenting vis invocation + parameters. + +xsimv An expectk script to visualize VIS simulation traces. + +helpers/ Programs useful during configuration and building + install-sh Shell scripts used by "gmake install." + mkinstalldirs + config.guess + config.sub + dependency.make + +doc/vis_user.ps + A user's manual for the VIS system, describing our approach + to formal verification and how to use the tool. + +doc/blifmv.ps Documentation on the BLIF-MV file format, a low-level + language for specifying designs. + +doc/ctl.ps Documentation on the CTL file format, a language + for specifying properties. + +examples/*/ A collection of small systems and properties to be + verified. Used by "gmake check." + +share/master.visrc + A VIS script designed to be run automatically at + start-up: contains aliases for commonly used commands + and some default parameter settings. + +share/*.nawk nawk scripts for converting BLIF files to BLIF-MV, + used by the "read_blif" command. + +share/script* Sample scripts. + +share/sislib.mv Library of gates used by models translated by vl2mv + from gate-level Verilog descriptions. + +share/visdbgpp A perl script to pretty-print counterexamples produced + by the model_check and check_invariant commands. + +share/help/ ASCII documentation for each VIS command, accessible + through the "help" command within VIS. + +src/*/ Source code and headers for the VIS system. + +obj/ Directory where .o files and generated .c files are + placed during a build. + +checkresults/ Directory where tests (i.e., gmake check) are run. + Results of the tests are placed here. The directory + is only created when 'gmake check' is run. + +--------------------------------------------------------------------------- +* Platform Specific Instructions + +Note: some instructions apply to platforms we no longer support. + +** Little-endian machines: + + vis-cal will occasionally fail when compiled with + --with-comp-mode=debug on little-endian machines like the Alphas and + the Intel ix86 CPUs. + +** x86_64 machines: + + Compilation is possible in both 64 and 32-bit modes. + + For 32-bit compilation with gcc, make sure the appropriate libraries + are installed. On Ubuntu, for instance, you need the multilib-g++ + package. Configure both glu and vis with --enable-gcc="gcc -m32". + + With the Intel compiler (icc), the choice between 64 and 32-bit + modes is made when the compiler variables are initialized. Once + that is done, configure both glu and vis with --enable-gcc=icc. + +** Mac OS X: + + For correct operation of vis-cmu, uncomment the definition + of USE_MALLOC_FREE at line 126 of src/mem/memint.h before building glu. + +** Solaris (Sparc and ix86): + + If Sun's C compiler is not installed on your system, use gcc + (./configure --enable-gcc). + + Warnings about redefined symbol are harmless, so are the warnings + that say "end-of-loop code not reached". + + The sun cc compiler (Workshop 6 update 1) on ix86 appears to have a + bug in the optimization routines. The -xO4 an -xO5 compiler options + will make vis crash in some runs. As a safety precaution, we have + changed the optimization flag to be -xO3 for all Sun platforms that + use the cc compiler. You can try higher optimization flags on your + machine. In general, it is hard to determine cc options that will + give optimal results on every platform, so it may pay off to play + atound with the optimization options. + +** MS Windows with Cygwin: + + You need Red Hat's Cygwin environment (freely available from + http://www.cygwin.com) to build GLU and VIS. + + With Cygwin the configuration script automatically selects gcc. + +** HP-UX: + + Some operating systems on HP machines have a built-in command called + "vis" under /usr/ucb. In light of this, be careful about the + definition of your path. + +** AIX: + + The configuration script automatically selects gcc. vis-cal + occasionally produces incorrect results when optimization is turned + on. If you plan to use vis-cal with AIX, you should configure glu + and vis with --with-comp-mode=debug. + +** Intel A64: + + vis-cal compiled with gcc 3.2.3 crashes when sifting is invoked. + +** DEC Alpha: + + Warnings about MIN and MAX are harmless. + Warnings about Olimit are harmless. They can be gotten rid of by + increasing the number following Olimit under CFLAGS. + + By default, configure uses 32-bit pointers when using DEC's OSF/1 C + compiler for the Alpha, which is more efficient if your processes + use less than 2GB. To use 64-bit pointers, invoke configure as follows: + + % ./configure --enable-64 + + The gcc compiler always compiles with 64-bit pointers. + + Note that you must also specify this flag when configuring GLU. + + Some machines do not have the program 'om'. In this case, simply + removing the om flag from LDFLAGS is sufficient to complete + compilation. + +** IRIX + + When compiling VIS with gcc, you may get the error message + + gcc.x: cannot specify -o with -c or -S and multiple compilations + + If this happens, edit Makefile, and replace the definition of + VERDATE with the following: + + VERDATE := -DCUR_DATE="\"N/A\"" -DCUR_VER="\"$(PRODUCT)-$(VERSION)\"" + +--------------------------------------------------------------------------- +* Verilog front-end + +vl2mv, written by Szu-Tsung Cheng, allows one to translate a subset of +Verilog into blif-MV, the input format of VIS. The most recent +version of vl2mv can be found in ftp://vlsi.colorado.edu/pub/vl2mv-2.3.tar.gz. +This version requires glu-2.3 to compile and link. Index: vis_dev/vis-2.3/configure =================================================================== --- vis_dev/vis-2.3/configure (revision 14) +++ vis_dev/vis-2.3/configure (revision 14) @@ -0,0 +1,6391 @@ +#! /bin/sh +# Guess values for system-dependent variables and create Makefiles. +# Generated by GNU Autoconf 2.57. +# +# Copyright 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002 +# Free Software Foundation, Inc. +# This configure script is free software; the Free Software Foundation +# gives unlimited permission to copy, distribute and modify it. +## --------------------- ## +## M4sh Initialization. ## +## --------------------- ## + +# Be Bourne compatible +if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then + emulate sh + NULLCMD=: + # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which + # is contrary to our usage. Disable this feature. + alias -g '${1+"$@"}'='"$@"' +elif test -n "${BASH_VERSION+set}" && (set -o posix) >/dev/null 2>&1; then + set -o posix +fi + +# Support unset when possible. +if (FOO=FOO; unset FOO) >/dev/null 2>&1; then + as_unset=unset +else + as_unset=false +fi + + +# Work around bugs in pre-3.0 UWIN ksh. +$as_unset ENV MAIL MAILPATH +PS1='$ ' +PS2='> ' +PS4='+ ' + +# NLS nuisances. +for as_var in \ + LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ + LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ + LC_TELEPHONE LC_TIME +do + if (set +x; test -n "`(eval $as_var=C; export $as_var) 2>&1`"); then + eval $as_var=C; export $as_var + else + $as_unset $as_var + fi +done + +# Required to use basename. +if expr a : '\(a\)' >/dev/null 2>&1; then + as_expr=expr +else + as_expr=false +fi + +if (basename /) >/dev/null 2>&1 && test "X`basename / 2>&1`" = "X/"; then + as_basename=basename +else + as_basename=false +fi + + +# Name of the executable. +as_me=`$as_basename "$0" || +$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ + X"$0" : 'X\(//\)$' \| \ + X"$0" : 'X\(/\)$' \| \ + . : '\(.\)' 2>/dev/null || +echo X/"$0" | + sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/; q; } + /^X\/\(\/\/\)$/{ s//\1/; q; } + /^X\/\(\/\).*/{ s//\1/; q; } + s/.*/./; q'` + + +# PATH needs CR, and LINENO needs CR and PATH. +# Avoid depending upon Character Ranges. +as_cr_letters='abcdefghijklmnopqrstuvwxyz' +as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' +as_cr_Letters=$as_cr_letters$as_cr_LETTERS +as_cr_digits='0123456789' +as_cr_alnum=$as_cr_Letters$as_cr_digits + +# The user is always right. +if test "${PATH_SEPARATOR+set}" != set; then + echo "#! /bin/sh" >conf$$.sh + echo "exit 0" >>conf$$.sh + chmod +x conf$$.sh + if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then + PATH_SEPARATOR=';' + else + PATH_SEPARATOR=: + fi + rm -f conf$$.sh +fi + + + as_lineno_1=$LINENO + as_lineno_2=$LINENO + as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` + test "x$as_lineno_1" != "x$as_lineno_2" && + test "x$as_lineno_3" = "x$as_lineno_2" || { + # Find who we are. Look in the path if we contain no path at all + # relative or not. + case $0 in + *[\\/]* ) as_myself=$0 ;; + *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break +done + + ;; + esac + # We did not find ourselves, most probably we were run as `sh COMMAND' + # in which case we are not to be found in the path. + if test "x$as_myself" = x; then + as_myself=$0 + fi + if test ! -f "$as_myself"; then + { echo "$as_me: error: cannot find myself; rerun with an absolute path" >&2 + { (exit 1); exit 1; }; } + fi + case $CONFIG_SHELL in + '') + as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for as_base in sh bash ksh sh5; do + case $as_dir in + /*) + if ("$as_dir/$as_base" -c ' + as_lineno_1=$LINENO + as_lineno_2=$LINENO + as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` + test "x$as_lineno_1" != "x$as_lineno_2" && + test "x$as_lineno_3" = "x$as_lineno_2" ') 2>/dev/null; then + $as_unset BASH_ENV || test "${BASH_ENV+set}" != set || { BASH_ENV=; export BASH_ENV; } + $as_unset ENV || test "${ENV+set}" != set || { ENV=; export ENV; } + CONFIG_SHELL=$as_dir/$as_base + export CONFIG_SHELL + exec "$CONFIG_SHELL" "$0" ${1+"$@"} + fi;; + esac + done +done +;; + esac + + # Create $as_me.lineno as a copy of $as_myself, but with $LINENO + # uniformly replaced by the line number. The first 'sed' inserts a + # line-number line before each line; the second 'sed' does the real + # work. The second script uses 'N' to pair each line-number line + # with the numbered line, and appends trailing '-' during + # substitution so that $LINENO is not a special case at line end. + # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the + # second 'sed' script. Blame Lee E. McMahon for sed's syntax. :-) + sed '=' <$as_myself | + sed ' + N + s,$,-, + : loop + s,^\(['$as_cr_digits']*\)\(.*\)[$]LINENO\([^'$as_cr_alnum'_]\),\1\2\1\3, + t loop + s,-$,, + s,^['$as_cr_digits']*\n,, + ' >$as_me.lineno && + chmod +x $as_me.lineno || + { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2 + { (exit 1); exit 1; }; } + + # Don't try to exec as it changes $[0], causing all sort of problems + # (the dirname of $[0] is not the place where we might find the + # original and so on. Autoconf is especially sensible to this). + . ./$as_me.lineno + # Exit status is that of the last command. + exit +} + + +case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in + *c*,-n*) ECHO_N= ECHO_C=' +' ECHO_T=' ' ;; + *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; + *) ECHO_N= ECHO_C='\c' ECHO_T= ;; +esac + +if expr a : '\(a\)' >/dev/null 2>&1; then + as_expr=expr +else + as_expr=false +fi + +rm -f conf$$ conf$$.exe conf$$.file +echo >conf$$.file +if ln -s conf$$.file conf$$ 2>/dev/null; then + # We could just check for DJGPP; but this test a) works b) is more generic + # and c) will remain valid once DJGPP supports symlinks (DJGPP 2.04). + if test -f conf$$.exe; then + # Don't use ln at all; we don't have any links + as_ln_s='cp -p' + else + as_ln_s='ln -s' + fi +elif ln conf$$.file conf$$ 2>/dev/null; then + as_ln_s=ln +else + as_ln_s='cp -p' +fi +rm -f conf$$ conf$$.exe conf$$.file + +if mkdir -p . 2>/dev/null; then + as_mkdir_p=: +else + as_mkdir_p=false +fi + +as_executable_p="test -f" + +# Sed expression to map a string onto a valid CPP name. +as_tr_cpp="sed y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g" + +# Sed expression to map a string onto a valid variable name. +as_tr_sh="sed y%*+%pp%;s%[^_$as_cr_alnum]%_%g" + + +# IFS +# We need space, tab and new line, in precisely that order. +as_nl=' +' +IFS=" $as_nl" + +# CDPATH. +$as_unset CDPATH + + +# Name of the host. +# hostname on some systems (SVR3.2, Linux) returns a bogus exit status, +# so uname gets run too. +ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q` + +exec 6>&1 + +# +# Initializations. +# +ac_default_prefix=/usr/local +ac_config_libobj_dir=. +cross_compiling=no +subdirs= +MFLAGS= +MAKEFLAGS= +SHELL=${CONFIG_SHELL-/bin/sh} + +# Maximum number of lines to put in a shell here document. +# This variable seems obsolete. It should probably be removed, and +# only ac_max_sed_lines should be used. +: ${ac_max_here_lines=38} + +# Identity of this package. +PACKAGE_NAME= +PACKAGE_TARNAME= +PACKAGE_VERSION= +PACKAGE_STRING= +PACKAGE_BUGREPORT= + +ac_unique_file="src/cmd/cmd.h" +# Factoring default headers for most tests. +ac_includes_default="\ +#include +#if HAVE_SYS_TYPES_H +# include +#endif +#if HAVE_SYS_STAT_H +# include +#endif +#if STDC_HEADERS +# include +# include +#else +# if HAVE_STDLIB_H +# include +# endif +#endif +#if HAVE_STRING_H +# if !STDC_HEADERS && HAVE_MEMORY_H +# include +# endif +# include +#endif +#if HAVE_STRINGS_H +# include +#endif +#if HAVE_INTTYPES_H +# include +#else +# if HAVE_STDINT_H +# include +# endif +#endif +#if HAVE_UNISTD_H +# include +#endif" + +ac_subst_vars='SHELL PATH_SEPARATOR PACKAGE_NAME PACKAGE_TARNAME PACKAGE_VERSION PACKAGE_STRING PACKAGE_BUGREPORT exec_prefix prefix program_transform_name bindir sbindir libexecdir datadir sysconfdir sharedstatedir localstatedir libdir includedir oldincludedir infodir mandir build_alias host_alias target_alias DEFS ECHO_C ECHO_N ECHO_T LIBS glulibdir gluincdir vislibdir local_srcdir BDDLIB ZCHAFF AR RANLIB ac_ct_RANLIB build build_cpu build_vendor build_os host host_cpu host_vendor host_os target target_cpu target_vendor target_os CC CFLAGS LDFLAGS CPPFLAGS ac_ct_CC EXEEXT OBJEXT INSTALL_PROGRAM INSTALL_SCRIPT INSTALL_DATA LINKER PLINKER LEX LEXLIB LEX_OUTPUT_ROOT YACC CPP EGREP LIBDIRS LIBOBJS AWK LTLIBOBJS' +ac_subst_files='' + +# Initialize some variables set by options. +ac_init_help= +ac_init_version=false +# The variables have the same names as the options, with +# dashes changed to underlines. +cache_file=/dev/null +exec_prefix=NONE +no_create= +no_recursion= +prefix=NONE +program_prefix=NONE +program_suffix=NONE +program_transform_name=s,x,x, +silent= +site= +srcdir= +verbose= +x_includes=NONE +x_libraries=NONE + +# Installation directory options. +# These are left unexpanded so users can "make install exec_prefix=/foo" +# and all the variables that are supposed to be based on exec_prefix +# by default will actually change. +# Use braces instead of parens because sh, perl, etc. also accept them. +bindir='${exec_prefix}/bin' +sbindir='${exec_prefix}/sbin' +libexecdir='${exec_prefix}/libexec' +datadir='${prefix}/share' +sysconfdir='${prefix}/etc' +sharedstatedir='${prefix}/com' +localstatedir='${prefix}/var' +libdir='${exec_prefix}/lib' +includedir='${prefix}/include' +oldincludedir='/usr/include' +infodir='${prefix}/info' +mandir='${prefix}/man' + +ac_prev= +for ac_option +do + # If the previous option needs an argument, assign it. + if test -n "$ac_prev"; then + eval "$ac_prev=\$ac_option" + ac_prev= + continue + fi + + ac_optarg=`expr "x$ac_option" : 'x[^=]*=\(.*\)'` + + # Accept the important Cygnus configure options, so we can diagnose typos. + + case $ac_option in + + -bindir | --bindir | --bindi | --bind | --bin | --bi) + ac_prev=bindir ;; + -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*) + bindir=$ac_optarg ;; + + -build | --build | --buil | --bui | --bu) + ac_prev=build_alias ;; + -build=* | --build=* | --buil=* | --bui=* | --bu=*) + build_alias=$ac_optarg ;; + + -cache-file | --cache-file | --cache-fil | --cache-fi \ + | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c) + ac_prev=cache_file ;; + -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \ + | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*) + cache_file=$ac_optarg ;; + + --config-cache | -C) + cache_file=config.cache ;; + + -datadir | --datadir | --datadi | --datad | --data | --dat | --da) + ac_prev=datadir ;; + -datadir=* | --datadir=* | --datadi=* | --datad=* | --data=* | --dat=* \ + | --da=*) + datadir=$ac_optarg ;; + + -disable-* | --disable-*) + ac_feature=`expr "x$ac_option" : 'x-*disable-\(.*\)'` + # Reject names that are not valid shell variable names. + expr "x$ac_feature" : ".*[^-_$as_cr_alnum]" >/dev/null && + { echo "$as_me: error: invalid feature name: $ac_feature" >&2 + { (exit 1); exit 1; }; } + ac_feature=`echo $ac_feature | sed 's/-/_/g'` + eval "enable_$ac_feature=no" ;; + + -enable-* | --enable-*) + ac_feature=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'` + # Reject names that are not valid shell variable names. + expr "x$ac_feature" : ".*[^-_$as_cr_alnum]" >/dev/null && + { echo "$as_me: error: invalid feature name: $ac_feature" >&2 + { (exit 1); exit 1; }; } + ac_feature=`echo $ac_feature | sed 's/-/_/g'` + case $ac_option in + *=*) ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"`;; + *) ac_optarg=yes ;; + esac + eval "enable_$ac_feature='$ac_optarg'" ;; + + -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \ + | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \ + | --exec | --exe | --ex) + ac_prev=exec_prefix ;; + -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \ + | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \ + | --exec=* | --exe=* | --ex=*) + exec_prefix=$ac_optarg ;; + + -gas | --gas | --ga | --g) + # Obsolete; use --with-gas. + with_gas=yes ;; + + -help | --help | --hel | --he | -h) + ac_init_help=long ;; + -help=r* | --help=r* | --hel=r* | --he=r* | -hr*) + ac_init_help=recursive ;; + -help=s* | --help=s* | --hel=s* | --he=s* | -hs*) + ac_init_help=short ;; + + -host | --host | --hos | --ho) + ac_prev=host_alias ;; + -host=* | --host=* | --hos=* | --ho=*) + host_alias=$ac_optarg ;; + + -includedir | --includedir | --includedi | --included | --include \ + | --includ | --inclu | --incl | --inc) + ac_prev=includedir ;; + -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \ + | --includ=* | --inclu=* | --incl=* | --inc=*) + includedir=$ac_optarg ;; + + -infodir | --infodir | --infodi | --infod | --info | --inf) + ac_prev=infodir ;; + -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*) + infodir=$ac_optarg ;; + + -libdir | --libdir | --libdi | --libd) + ac_prev=libdir ;; + -libdir=* | --libdir=* | --libdi=* | --libd=*) + libdir=$ac_optarg ;; + + -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \ + | --libexe | --libex | --libe) + ac_prev=libexecdir ;; + -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \ + | --libexe=* | --libex=* | --libe=*) + libexecdir=$ac_optarg ;; + + -localstatedir | --localstatedir | --localstatedi | --localstated \ + | --localstate | --localstat | --localsta | --localst \ + | --locals | --local | --loca | --loc | --lo) + ac_prev=localstatedir ;; + -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \ + | --localstate=* | --localstat=* | --localsta=* | --localst=* \ + | --locals=* | --local=* | --loca=* | --loc=* | --lo=*) + localstatedir=$ac_optarg ;; + + -mandir | --mandir | --mandi | --mand | --man | --ma | --m) + ac_prev=mandir ;; + -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*) + mandir=$ac_optarg ;; + + -nfp | --nfp | --nf) + # Obsolete; use --without-fp. + with_fp=no ;; + + -no-create | --no-create | --no-creat | --no-crea | --no-cre \ + | --no-cr | --no-c | -n) + no_create=yes ;; + + -no-recursion | --no-recursion | --no-recursio | --no-recursi \ + | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r) + no_recursion=yes ;; + + -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \ + | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \ + | --oldin | --oldi | --old | --ol | --o) + ac_prev=oldincludedir ;; + -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \ + | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \ + | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*) + oldincludedir=$ac_optarg ;; + + -prefix | --prefix | --prefi | --pref | --pre | --pr | --p) + ac_prev=prefix ;; + -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*) + prefix=$ac_optarg ;; + + -program-prefix | --program-prefix | --program-prefi | --program-pref \ + | --program-pre | --program-pr | --program-p) + ac_prev=program_prefix ;; + -program-prefix=* | --program-prefix=* | --program-prefi=* \ + | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*) + program_prefix=$ac_optarg ;; + + -program-suffix | --program-suffix | --program-suffi | --program-suff \ + | --program-suf | --program-su | --program-s) + ac_prev=program_suffix ;; + -program-suffix=* | --program-suffix=* | --program-suffi=* \ + | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*) + program_suffix=$ac_optarg ;; + + -program-transform-name | --program-transform-name \ + | --program-transform-nam | --program-transform-na \ + | --program-transform-n | --program-transform- \ + | --program-transform | --program-transfor \ + | --program-transfo | --program-transf \ + | --program-trans | --program-tran \ + | --progr-tra | --program-tr | --program-t) + ac_prev=program_transform_name ;; + -program-transform-name=* | --program-transform-name=* \ + | --program-transform-nam=* | --program-transform-na=* \ + | --program-transform-n=* | --program-transform-=* \ + | --program-transform=* | --program-transfor=* \ + | --program-transfo=* | --program-transf=* \ + | --program-trans=* | --program-tran=* \ + | --progr-tra=* | --program-tr=* | --program-t=*) + program_transform_name=$ac_optarg ;; + + -q | -quiet | --quiet | --quie | --qui | --qu | --q \ + | -silent | --silent | --silen | --sile | --sil) + silent=yes ;; + + -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb) + ac_prev=sbindir ;; + -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \ + | --sbi=* | --sb=*) + sbindir=$ac_optarg ;; + + -sharedstatedir | --sharedstatedir | --sharedstatedi \ + | --sharedstated | --sharedstate | --sharedstat | --sharedsta \ + | --sharedst | --shareds | --shared | --share | --shar \ + | --sha | --sh) + ac_prev=sharedstatedir ;; + -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \ + | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \ + | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \ + | --sha=* | --sh=*) + sharedstatedir=$ac_optarg ;; + + -site | --site | --sit) + ac_prev=site ;; + -site=* | --site=* | --sit=*) + site=$ac_optarg ;; + + -srcdir | --srcdir | --srcdi | --srcd | --src | --sr) + ac_prev=srcdir ;; + -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*) + srcdir=$ac_optarg ;; + + -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \ + | --syscon | --sysco | --sysc | --sys | --sy) + ac_prev=sysconfdir ;; + -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \ + | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*) + sysconfdir=$ac_optarg ;; + + -target | --target | --targe | --targ | --tar | --ta | --t) + ac_prev=target_alias ;; + -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*) + target_alias=$ac_optarg ;; + + -v | -verbose | --verbose | --verbos | --verbo | --verb) + verbose=yes ;; + + -version | --version | --versio | --versi | --vers | -V) + ac_init_version=: ;; + + -with-* | --with-*) + ac_package=`expr "x$ac_option" : 'x-*with-\([^=]*\)'` + # Reject names that are not valid shell variable names. + expr "x$ac_package" : ".*[^-_$as_cr_alnum]" >/dev/null && + { echo "$as_me: error: invalid package name: $ac_package" >&2 + { (exit 1); exit 1; }; } + ac_package=`echo $ac_package| sed 's/-/_/g'` + case $ac_option in + *=*) ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"`;; + *) ac_optarg=yes ;; + esac + eval "with_$ac_package='$ac_optarg'" ;; + + -without-* | --without-*) + ac_package=`expr "x$ac_option" : 'x-*without-\(.*\)'` + # Reject names that are not valid shell variable names. + expr "x$ac_package" : ".*[^-_$as_cr_alnum]" >/dev/null && + { echo "$as_me: error: invalid package name: $ac_package" >&2 + { (exit 1); exit 1; }; } + ac_package=`echo $ac_package | sed 's/-/_/g'` + eval "with_$ac_package=no" ;; + + --x) + # Obsolete; use --with-x. + with_x=yes ;; + + -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \ + | --x-incl | --x-inc | --x-in | --x-i) + ac_prev=x_includes ;; + -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \ + | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*) + x_includes=$ac_optarg ;; + + -x-libraries | --x-libraries | --x-librarie | --x-librari \ + | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l) + ac_prev=x_libraries ;; + -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \ + | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*) + x_libraries=$ac_optarg ;; + + -*) { echo "$as_me: error: unrecognized option: $ac_option +Try \`$0 --help' for more information." >&2 + { (exit 1); exit 1; }; } + ;; + + *=*) + ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='` + # Reject names that are not valid shell variable names. + expr "x$ac_envvar" : ".*[^_$as_cr_alnum]" >/dev/null && + { echo "$as_me: error: invalid variable name: $ac_envvar" >&2 + { (exit 1); exit 1; }; } + ac_optarg=`echo "$ac_optarg" | sed "s/'/'\\\\\\\\''/g"` + eval "$ac_envvar='$ac_optarg'" + export $ac_envvar ;; + + *) + # FIXME: should be removed in autoconf 3.0. + echo "$as_me: WARNING: you should use --build, --host, --target" >&2 + expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null && + echo "$as_me: WARNING: invalid host type: $ac_option" >&2 + : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option} + ;; + + esac +done + +if test -n "$ac_prev"; then + ac_option=--`echo $ac_prev | sed 's/_/-/g'` + { echo "$as_me: error: missing argument to $ac_option" >&2 + { (exit 1); exit 1; }; } +fi + +# Be sure to have absolute paths. +for ac_var in exec_prefix prefix +do + eval ac_val=$`echo $ac_var` + case $ac_val in + [\\/$]* | ?:[\\/]* | NONE | '' ) ;; + *) { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 + { (exit 1); exit 1; }; };; + esac +done + +# Be sure to have absolute paths. +for ac_var in bindir sbindir libexecdir datadir sysconfdir sharedstatedir \ + localstatedir libdir includedir oldincludedir infodir mandir +do + eval ac_val=$`echo $ac_var` + case $ac_val in + [\\/$]* | ?:[\\/]* ) ;; + *) { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2 + { (exit 1); exit 1; }; };; + esac +done + +# There might be people who depend on the old broken behavior: `$host' +# used to hold the argument of --host etc. +# FIXME: To remove some day. +build=$build_alias +host=$host_alias +target=$target_alias + +# FIXME: To remove some day. +if test "x$host_alias" != x; then + if test "x$build_alias" = x; then + cross_compiling=maybe + echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host. + If a cross compiler is detected then cross compile mode will be used." >&2 + elif test "x$build_alias" != "x$host_alias"; then + cross_compiling=yes + fi +fi + +ac_tool_prefix= +test -n "$host_alias" && ac_tool_prefix=$host_alias- + +test "$silent" = yes && exec 6>/dev/null + + +# Find the source files, if location was not specified. +if test -z "$srcdir"; then + ac_srcdir_defaulted=yes + # Try the directory containing this script, then its parent. + ac_confdir=`(dirname "$0") 2>/dev/null || +$as_expr X"$0" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ + X"$0" : 'X\(//\)[^/]' \| \ + X"$0" : 'X\(//\)$' \| \ + X"$0" : 'X\(/\)' \| \ + . : '\(.\)' 2>/dev/null || +echo X"$0" | + sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } + /^X\(\/\/\)[^/].*/{ s//\1/; q; } + /^X\(\/\/\)$/{ s//\1/; q; } + /^X\(\/\).*/{ s//\1/; q; } + s/.*/./; q'` + srcdir=$ac_confdir + if test ! -r $srcdir/$ac_unique_file; then + srcdir=.. + fi +else + ac_srcdir_defaulted=no +fi +if test ! -r $srcdir/$ac_unique_file; then + if test "$ac_srcdir_defaulted" = yes; then + { echo "$as_me: error: cannot find sources ($ac_unique_file) in $ac_confdir or .." >&2 + { (exit 1); exit 1; }; } + else + { echo "$as_me: error: cannot find sources ($ac_unique_file) in $srcdir" >&2 + { (exit 1); exit 1; }; } + fi +fi +(cd $srcdir && test -r ./$ac_unique_file) 2>/dev/null || + { echo "$as_me: error: sources are in $srcdir, but \`cd $srcdir' does not work" >&2 + { (exit 1); exit 1; }; } +srcdir=`echo "$srcdir" | sed 's%\([^\\/]\)[\\/]*$%\1%'` +ac_env_build_alias_set=${build_alias+set} +ac_env_build_alias_value=$build_alias +ac_cv_env_build_alias_set=${build_alias+set} +ac_cv_env_build_alias_value=$build_alias +ac_env_host_alias_set=${host_alias+set} +ac_env_host_alias_value=$host_alias +ac_cv_env_host_alias_set=${host_alias+set} +ac_cv_env_host_alias_value=$host_alias +ac_env_target_alias_set=${target_alias+set} +ac_env_target_alias_value=$target_alias +ac_cv_env_target_alias_set=${target_alias+set} +ac_cv_env_target_alias_value=$target_alias +ac_env_CC_set=${CC+set} +ac_env_CC_value=$CC +ac_cv_env_CC_set=${CC+set} +ac_cv_env_CC_value=$CC +ac_env_CFLAGS_set=${CFLAGS+set} +ac_env_CFLAGS_value=$CFLAGS +ac_cv_env_CFLAGS_set=${CFLAGS+set} +ac_cv_env_CFLAGS_value=$CFLAGS +ac_env_LDFLAGS_set=${LDFLAGS+set} +ac_env_LDFLAGS_value=$LDFLAGS +ac_cv_env_LDFLAGS_set=${LDFLAGS+set} +ac_cv_env_LDFLAGS_value=$LDFLAGS +ac_env_CPPFLAGS_set=${CPPFLAGS+set} +ac_env_CPPFLAGS_value=$CPPFLAGS +ac_cv_env_CPPFLAGS_set=${CPPFLAGS+set} +ac_cv_env_CPPFLAGS_value=$CPPFLAGS +ac_env_CPP_set=${CPP+set} +ac_env_CPP_value=$CPP +ac_cv_env_CPP_set=${CPP+set} +ac_cv_env_CPP_value=$CPP + +# +# Report the --help message. +# +if test "$ac_init_help" = "long"; then + # Omit some internal or obsolete options to make the list less imposing. + # This message is too long to be a string in the A/UX 3.1 sh. + cat <<_ACEOF +\`configure' configures this package to adapt to many kinds of systems. + +Usage: $0 [OPTION]... [VAR=VALUE]... + +To assign environment variables (e.g., CC, CFLAGS...), specify them as +VAR=VALUE. See below for descriptions of some of the useful variables. + +Defaults for the options are specified in brackets. + +Configuration: + -h, --help display this help and exit + --help=short display options specific to this package + --help=recursive display the short help of all the included packages + -V, --version display version information and exit + -q, --quiet, --silent do not print \`checking...' messages + --cache-file=FILE cache test results in FILE [disabled] + -C, --config-cache alias for \`--cache-file=config.cache' + -n, --no-create do not create output files + --srcdir=DIR find the sources in DIR [configure dir or \`..'] + +_ACEOF + + cat <<_ACEOF +Installation directories: + --prefix=PREFIX install architecture-independent files in PREFIX + [$ac_default_prefix] + --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX + [PREFIX] + +By default, \`make install' will install all the files in +\`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify +an installation prefix other than \`$ac_default_prefix' using \`--prefix', +for instance \`--prefix=\$HOME'. + +For better control, use the options below. + +Fine tuning of the installation directories: + --bindir=DIR user executables [EPREFIX/bin] + --sbindir=DIR system admin executables [EPREFIX/sbin] + --libexecdir=DIR program executables [EPREFIX/libexec] + --datadir=DIR read-only architecture-independent data [PREFIX/share] + --sysconfdir=DIR read-only single-machine data [PREFIX/etc] + --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com] + --localstatedir=DIR modifiable single-machine data [PREFIX/var] + --libdir=DIR object code libraries [EPREFIX/lib] + --includedir=DIR C header files [PREFIX/include] + --oldincludedir=DIR C header files for non-gcc [/usr/include] + --infodir=DIR info documentation [PREFIX/info] + --mandir=DIR man documentation [PREFIX/man] +_ACEOF + + cat <<\_ACEOF + +System types: + --build=BUILD configure for building on BUILD [guessed] + --host=HOST cross-compile to build programs to run on HOST [BUILD] + --target=TARGET configure for building compilers for TARGET [HOST] +_ACEOF +fi + +if test -n "$ac_init_help"; then + + cat <<\_ACEOF + +Optional Features: + --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no) + --enable-FEATURE[=ARG] include FEATURE [ARG=yes] + --enable-gcc Allow use of gcc if available + --enable-64 Use 64-bit pointers on 64-bit Alpha machines + +Optional Packages: + --with-PACKAGE[=ARG] use PACKAGE [ARG=yes] + --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no) + --with-glu-libdir= Specify directories to search for the GLU library. + Expects to find /libglu.a + --with-glu-incdir= Specify directories to search for the GLU headers + --with-vis-libdir= Specify directories to search for the VIS + and headers. Defaults to \".\". + Expects to find /libvis.a + --with-local-srcdir= Specify the root directory to search for + source for packages (the PKGS list). + Expects to find, e.g., /tbl/tbl.c + --with-bdd= Specify the BDD library to link against. + Defaults to --with-bdd=cu. + --with-comp-mode= Specify a special compilation mode: + optimize (the default): Produce optimized + code, with symbol table information + if supported on the platform/compiler, + and without asserts. + debug: Produce unoptimized code with symbol table + information and asserts enabled + purify: Unoptimized code linked with purify + quantify: Optimized code without asserts + linked with quantify + +Some influential environment variables: + CC C compiler command + CFLAGS C compiler flags + LDFLAGS linker flags, e.g. -L if you have libraries in a + nonstandard directory + CPPFLAGS C/C++ preprocessor flags, e.g. -I if you have + headers in a nonstandard directory + CPP C preprocessor + +Use these variables to override the choices made by `configure' or to help +it to find libraries and programs with nonstandard names/locations. + +_ACEOF +fi + +if test "$ac_init_help" = "recursive"; then + # If there are subdirs, report their specific --help. + ac_popdir=`pwd` + for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue + test -d $ac_dir || continue + ac_builddir=. + +if test "$ac_dir" != .; then + ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` + # A "../" for each directory in $ac_dir_suffix. + ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` +else + ac_dir_suffix= ac_top_builddir= +fi + +case $srcdir in + .) # No --srcdir option. We are building in place. + ac_srcdir=. + if test -z "$ac_top_builddir"; then + ac_top_srcdir=. + else + ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` + fi ;; + [\\/]* | ?:[\\/]* ) # Absolute path. + ac_srcdir=$srcdir$ac_dir_suffix; + ac_top_srcdir=$srcdir ;; + *) # Relative path. + ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix + ac_top_srcdir=$ac_top_builddir$srcdir ;; +esac +# Don't blindly perform a `cd "$ac_dir"/$ac_foo && pwd` since $ac_foo can be +# absolute. +ac_abs_builddir=`cd "$ac_dir" && cd $ac_builddir && pwd` +ac_abs_top_builddir=`cd "$ac_dir" && cd ${ac_top_builddir}. && pwd` +ac_abs_srcdir=`cd "$ac_dir" && cd $ac_srcdir && pwd` +ac_abs_top_srcdir=`cd "$ac_dir" && cd $ac_top_srcdir && pwd` + + cd $ac_dir + # Check for guested configure; otherwise get Cygnus style configure. + if test -f $ac_srcdir/configure.gnu; then + echo + $SHELL $ac_srcdir/configure.gnu --help=recursive + elif test -f $ac_srcdir/configure; then + echo + $SHELL $ac_srcdir/configure --help=recursive + elif test -f $ac_srcdir/configure.ac || + test -f $ac_srcdir/configure.in; then + echo + $ac_configure --help + else + echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2 + fi + cd $ac_popdir + done +fi + +test -n "$ac_init_help" && exit 0 +if $ac_init_version; then + cat <<\_ACEOF + +Copyright 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002 +Free Software Foundation, Inc. +This configure script is free software; the Free Software Foundation +gives unlimited permission to copy, distribute and modify it. +_ACEOF + exit 0 +fi +exec 5>config.log +cat >&5 <<_ACEOF +This file contains any messages produced by compilers while +running configure, to aid debugging if configure makes a mistake. + +It was created by $as_me, which was +generated by GNU Autoconf 2.57. Invocation command line was + + $ $0 $@ + +_ACEOF +{ +cat <<_ASUNAME +## --------- ## +## Platform. ## +## --------- ## + +hostname = `(hostname || uname -n) 2>/dev/null | sed 1q` +uname -m = `(uname -m) 2>/dev/null || echo unknown` +uname -r = `(uname -r) 2>/dev/null || echo unknown` +uname -s = `(uname -s) 2>/dev/null || echo unknown` +uname -v = `(uname -v) 2>/dev/null || echo unknown` + +/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown` +/bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown` + +/bin/arch = `(/bin/arch) 2>/dev/null || echo unknown` +/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown` +/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown` +hostinfo = `(hostinfo) 2>/dev/null || echo unknown` +/bin/machine = `(/bin/machine) 2>/dev/null || echo unknown` +/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown` +/bin/universe = `(/bin/universe) 2>/dev/null || echo unknown` + +_ASUNAME + +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + echo "PATH: $as_dir" +done + +} >&5 + +cat >&5 <<_ACEOF + + +## ----------- ## +## Core tests. ## +## ----------- ## + +_ACEOF + + +# Keep a trace of the command line. +# Strip out --no-create and --no-recursion so they do not pile up. +# Strip out --silent because we don't want to record it for future runs. +# Also quote any args containing shell meta-characters. +# Make two passes to allow for proper duplicate-argument suppression. +ac_configure_args= +ac_configure_args0= +ac_configure_args1= +ac_sep= +ac_must_keep_next=false +for ac_pass in 1 2 +do + for ac_arg + do + case $ac_arg in + -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;; + -q | -quiet | --quiet | --quie | --qui | --qu | --q \ + | -silent | --silent | --silen | --sile | --sil) + continue ;; + *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?\"\']*) + ac_arg=`echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;; + esac + case $ac_pass in + 1) ac_configure_args0="$ac_configure_args0 '$ac_arg'" ;; + 2) + ac_configure_args1="$ac_configure_args1 '$ac_arg'" + if test $ac_must_keep_next = true; then + ac_must_keep_next=false # Got value, back to normal. + else + case $ac_arg in + *=* | --config-cache | -C | -disable-* | --disable-* \ + | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \ + | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \ + | -with-* | --with-* | -without-* | --without-* | --x) + case "$ac_configure_args0 " in + "$ac_configure_args1"*" '$ac_arg' "* ) continue ;; + esac + ;; + -* ) ac_must_keep_next=true ;; + esac + fi + ac_configure_args="$ac_configure_args$ac_sep'$ac_arg'" + # Get rid of the leading space. + ac_sep=" " + ;; + esac + done +done +$as_unset ac_configure_args0 || test "${ac_configure_args0+set}" != set || { ac_configure_args0=; export ac_configure_args0; } +$as_unset ac_configure_args1 || test "${ac_configure_args1+set}" != set || { ac_configure_args1=; export ac_configure_args1; } + +# When interrupted or exit'd, cleanup temporary files, and complete +# config.log. We remove comments because anyway the quotes in there +# would cause problems or look ugly. +# WARNING: Be sure not to use single quotes in there, as some shells, +# such as our DU 5.0 friend, will then `close' the trap. +trap 'exit_status=$? + # Save into config.log some information that might help in debugging. + { + echo + + cat <<\_ASBOX +## ---------------- ## +## Cache variables. ## +## ---------------- ## +_ASBOX + echo + # The following way of writing the cache mishandles newlines in values, +{ + (set) 2>&1 | + case `(ac_space='"'"' '"'"'; set | grep ac_space) 2>&1` in + *ac_space=\ *) + sed -n \ + "s/'"'"'/'"'"'\\\\'"'"''"'"'/g; + s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='"'"'\\2'"'"'/p" + ;; + *) + sed -n \ + "s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1=\\2/p" + ;; + esac; +} + echo + + cat <<\_ASBOX +## ----------------- ## +## Output variables. ## +## ----------------- ## +_ASBOX + echo + for ac_var in $ac_subst_vars + do + eval ac_val=$`echo $ac_var` + echo "$ac_var='"'"'$ac_val'"'"'" + done | sort + echo + + if test -n "$ac_subst_files"; then + cat <<\_ASBOX +## ------------- ## +## Output files. ## +## ------------- ## +_ASBOX + echo + for ac_var in $ac_subst_files + do + eval ac_val=$`echo $ac_var` + echo "$ac_var='"'"'$ac_val'"'"'" + done | sort + echo + fi + + if test -s confdefs.h; then + cat <<\_ASBOX +## ----------- ## +## confdefs.h. ## +## ----------- ## +_ASBOX + echo + sed "/^$/d" confdefs.h | sort + echo + fi + test "$ac_signal" != 0 && + echo "$as_me: caught signal $ac_signal" + echo "$as_me: exit $exit_status" + } >&5 + rm -f core core.* *.core && + rm -rf conftest* confdefs* conf$$* $ac_clean_files && + exit $exit_status + ' 0 +for ac_signal in 1 2 13 15; do + trap 'ac_signal='$ac_signal'; { (exit 1); exit 1; }' $ac_signal +done +ac_signal=0 + +# confdefs.h avoids OS command line length limits that DEFS can exceed. +rm -rf conftest* confdefs.h +# AIX cpp loses on an empty file, so make sure it contains at least a newline. +echo >confdefs.h + +# Predefined preprocessor variables. + +cat >>confdefs.h <<_ACEOF +#define PACKAGE_NAME "$PACKAGE_NAME" +_ACEOF + + +cat >>confdefs.h <<_ACEOF +#define PACKAGE_TARNAME "$PACKAGE_TARNAME" +_ACEOF + + +cat >>confdefs.h <<_ACEOF +#define PACKAGE_VERSION "$PACKAGE_VERSION" +_ACEOF + + +cat >>confdefs.h <<_ACEOF +#define PACKAGE_STRING "$PACKAGE_STRING" +_ACEOF + + +cat >>confdefs.h <<_ACEOF +#define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT" +_ACEOF + + +# Let the site file select an alternate cache file if it wants to. +# Prefer explicitly selected file to automatically selected ones. +if test -z "$CONFIG_SITE"; then + if test "x$prefix" != xNONE; then + CONFIG_SITE="$prefix/share/config.site $prefix/etc/config.site" + else + CONFIG_SITE="$ac_default_prefix/share/config.site $ac_default_prefix/etc/config.site" + fi +fi +for ac_site_file in $CONFIG_SITE; do + if test -r "$ac_site_file"; then + { echo "$as_me:$LINENO: loading site script $ac_site_file" >&5 +echo "$as_me: loading site script $ac_site_file" >&6;} + sed 's/^/| /' "$ac_site_file" >&5 + . "$ac_site_file" + fi +done + +if test -r "$cache_file"; then + # Some versions of bash will fail to source /dev/null (special + # files actually), so we avoid doing that. + if test -f "$cache_file"; then + { echo "$as_me:$LINENO: loading cache $cache_file" >&5 +echo "$as_me: loading cache $cache_file" >&6;} + case $cache_file in + [\\/]* | ?:[\\/]* ) . $cache_file;; + *) . ./$cache_file;; + esac + fi +else + { echo "$as_me:$LINENO: creating cache $cache_file" >&5 +echo "$as_me: creating cache $cache_file" >&6;} + >$cache_file +fi + +# Check that the precious variables saved in the cache have kept the same +# value. +ac_cache_corrupted=false +for ac_var in `(set) 2>&1 | + sed -n 's/^ac_env_\([a-zA-Z_0-9]*\)_set=.*/\1/p'`; do + eval ac_old_set=\$ac_cv_env_${ac_var}_set + eval ac_new_set=\$ac_env_${ac_var}_set + eval ac_old_val="\$ac_cv_env_${ac_var}_value" + eval ac_new_val="\$ac_env_${ac_var}_value" + case $ac_old_set,$ac_new_set in + set,) + { echo "$as_me:$LINENO: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5 +echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;} + ac_cache_corrupted=: ;; + ,set) + { echo "$as_me:$LINENO: error: \`$ac_var' was not set in the previous run" >&5 +echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;} + ac_cache_corrupted=: ;; + ,);; + *) + if test "x$ac_old_val" != "x$ac_new_val"; then + { echo "$as_me:$LINENO: error: \`$ac_var' has changed since the previous run:" >&5 +echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;} + { echo "$as_me:$LINENO: former value: $ac_old_val" >&5 +echo "$as_me: former value: $ac_old_val" >&2;} + { echo "$as_me:$LINENO: current value: $ac_new_val" >&5 +echo "$as_me: current value: $ac_new_val" >&2;} + ac_cache_corrupted=: + fi;; + esac + # Pass precious variables to config.status. + if test "$ac_new_set" = set; then + case $ac_new_val in + *" "*|*" "*|*[\[\]\~\#\$\^\&\*\(\)\{\}\\\|\;\<\>\?\"\']*) + ac_arg=$ac_var=`echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;; + *) ac_arg=$ac_var=$ac_new_val ;; + esac + case " $ac_configure_args " in + *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy. + *) ac_configure_args="$ac_configure_args '$ac_arg'" ;; + esac + fi +done +if $ac_cache_corrupted; then + { echo "$as_me:$LINENO: error: changes in the environment can compromise the build" >&5 +echo "$as_me: error: changes in the environment can compromise the build" >&2;} + { { echo "$as_me:$LINENO: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&5 +echo "$as_me: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&2;} + { (exit 1); exit 1; }; } +fi + +ac_ext=c +ac_cpp='$CPP $CPPFLAGS' +ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' +ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' +ac_compiler_gnu=$ac_cv_c_compiler_gnu + + + + + + + + + + + + + + + + + + + + +# Look for install.sh, config.guess, and config.sub in the "helpers" dir +ac_aux_dir= +for ac_dir in helpers $srcdir/helpers; do + if test -f $ac_dir/install-sh; then + ac_aux_dir=$ac_dir + ac_install_sh="$ac_aux_dir/install-sh -c" + break + elif test -f $ac_dir/install.sh; then + ac_aux_dir=$ac_dir + ac_install_sh="$ac_aux_dir/install.sh -c" + break + elif test -f $ac_dir/shtool; then + ac_aux_dir=$ac_dir + ac_install_sh="$ac_aux_dir/shtool install -c" + break + fi +done +if test -z "$ac_aux_dir"; then + { { echo "$as_me:$LINENO: error: cannot find install-sh or install.sh in helpers $srcdir/helpers" >&5 +echo "$as_me: error: cannot find install-sh or install.sh in helpers $srcdir/helpers" >&2;} + { (exit 1); exit 1; }; } +fi +ac_config_guess="$SHELL $ac_aux_dir/config.guess" +ac_config_sub="$SHELL $ac_aux_dir/config.sub" +ac_configure="$SHELL $ac_aux_dir/configure" # This should be Cygnus configure. + + +#---------------------------------------------------------------------- +# Configuration options +#---------------------------------------------------------------------- + +# Give the configurer a chance to set the location of the GLU tree + + + +# Check whether --with-glu-libdir or --without-glu-libdir was given. +if test "${with_glu_libdir+set}" = set; then + withval="$with_glu_libdir" + glulibdir=$withval +else + glulibdir="" +fi; + + + +# Check whether --with-glu-incdir or --without-glu-incdir was given. +if test "${with_glu_incdir+set}" = set; then + withval="$with_glu_incdir" + gluincdir=$withval +else + gluincdir="" +fi; + +# Give the configurer a chance to set a different location for the VIS +# headers and library + + + +# Check whether --with-vis-libdir or --without-vis-libdir was given. +if test "${with_vis_libdir+set}" = set; then + withval="$with_vis_libdir" + vislibdir=$withval +else + vislibdir="." +fi; + +# Give the configurer a chance to set a different location for the VIS +# source. When specified, "srcdir" points to "master" source, and +# "local_srcdir" points to the source under local development. + + + +# Check whether --with-local-srcdir or --without-local-srcdir was given. +if test "${with_local_srcdir+set}" = set; then + withval="$with_local_srcdir" + local_srcdir=$withval +else + local_srcdir=$srcdir +fi; + +# Give the configurer a chance to set the BDD library + + + +# Check whether --with-bdd or --without-bdd was given. +if test "${with_bdd+set}" = set; then + withval="$with_bdd" + BDDLIB=$withval +else + BDDLIB=cu +fi; + +#---------------------------------------------------------------------- +# Checks for programs we need +#---------------------------------------------------------------------- +# Extract the first word of "zchaff", so it can be a program name with args. +set dummy zchaff; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_path_ZCHAFF+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + case $ZCHAFF in + [\\/]* | ?:[\\/]*) + ac_cv_path_ZCHAFF="$ZCHAFF" # Let the user override the test with a path. + ;; + *) + as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_path_ZCHAFF="$as_dir/$ac_word$ac_exec_ext" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + + ;; +esac +fi +ZCHAFF=$ac_cv_path_ZCHAFF + +if test -n "$ZCHAFF"; then + echo "$as_me:$LINENO: result: $ZCHAFF" >&5 +echo "${ECHO_T}$ZCHAFF" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +# Extract the first word of "ar", so it can be a program name with args. +set dummy ar; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_path_AR+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + case $AR in + [\\/]* | ?:[\\/]*) + ac_cv_path_AR="$AR" # Let the user override the test with a path. + ;; + *) + as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_path_AR="$as_dir/$ac_word$ac_exec_ext" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + + test -z "$ac_cv_path_AR" && ac_cv_path_AR="ar" + ;; +esac +fi +AR=$ac_cv_path_AR + +if test -n "$AR"; then + echo "$as_me:$LINENO: result: $AR" >&5 +echo "${ECHO_T}$AR" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +if test -n "$ac_tool_prefix"; then + # Extract the first word of "${ac_tool_prefix}ranlib", so it can be a program name with args. +set dummy ${ac_tool_prefix}ranlib; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_RANLIB+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$RANLIB"; then + ac_cv_prog_RANLIB="$RANLIB" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_RANLIB="${ac_tool_prefix}ranlib" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +RANLIB=$ac_cv_prog_RANLIB +if test -n "$RANLIB"; then + echo "$as_me:$LINENO: result: $RANLIB" >&5 +echo "${ECHO_T}$RANLIB" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +fi +if test -z "$ac_cv_prog_RANLIB"; then + ac_ct_RANLIB=$RANLIB + # Extract the first word of "ranlib", so it can be a program name with args. +set dummy ranlib; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_ac_ct_RANLIB+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$ac_ct_RANLIB"; then + ac_cv_prog_ac_ct_RANLIB="$ac_ct_RANLIB" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_ac_ct_RANLIB="ranlib" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + + test -z "$ac_cv_prog_ac_ct_RANLIB" && ac_cv_prog_ac_ct_RANLIB=":" +fi +fi +ac_ct_RANLIB=$ac_cv_prog_ac_ct_RANLIB +if test -n "$ac_ct_RANLIB"; then + echo "$as_me:$LINENO: result: $ac_ct_RANLIB" >&5 +echo "${ECHO_T}$ac_ct_RANLIB" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + RANLIB=$ac_ct_RANLIB +else + RANLIB="$ac_cv_prog_RANLIB" +fi + + +# Make sure we can run config.sub. +$ac_config_sub sun4 >/dev/null 2>&1 || + { { echo "$as_me:$LINENO: error: cannot run $ac_config_sub" >&5 +echo "$as_me: error: cannot run $ac_config_sub" >&2;} + { (exit 1); exit 1; }; } + +echo "$as_me:$LINENO: checking build system type" >&5 +echo $ECHO_N "checking build system type... $ECHO_C" >&6 +if test "${ac_cv_build+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_cv_build_alias=$build_alias +test -z "$ac_cv_build_alias" && + ac_cv_build_alias=`$ac_config_guess` +test -z "$ac_cv_build_alias" && + { { echo "$as_me:$LINENO: error: cannot guess build type; you must specify one" >&5 +echo "$as_me: error: cannot guess build type; you must specify one" >&2;} + { (exit 1); exit 1; }; } +ac_cv_build=`$ac_config_sub $ac_cv_build_alias` || + { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_build_alias failed" >&5 +echo "$as_me: error: $ac_config_sub $ac_cv_build_alias failed" >&2;} + { (exit 1); exit 1; }; } + +fi +echo "$as_me:$LINENO: result: $ac_cv_build" >&5 +echo "${ECHO_T}$ac_cv_build" >&6 +build=$ac_cv_build +build_cpu=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` +build_vendor=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` +build_os=`echo $ac_cv_build | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` + + +echo "$as_me:$LINENO: checking host system type" >&5 +echo $ECHO_N "checking host system type... $ECHO_C" >&6 +if test "${ac_cv_host+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_cv_host_alias=$host_alias +test -z "$ac_cv_host_alias" && + ac_cv_host_alias=$ac_cv_build_alias +ac_cv_host=`$ac_config_sub $ac_cv_host_alias` || + { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_host_alias failed" >&5 +echo "$as_me: error: $ac_config_sub $ac_cv_host_alias failed" >&2;} + { (exit 1); exit 1; }; } + +fi +echo "$as_me:$LINENO: result: $ac_cv_host" >&5 +echo "${ECHO_T}$ac_cv_host" >&6 +host=$ac_cv_host +host_cpu=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` +host_vendor=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` +host_os=`echo $ac_cv_host | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` + + +echo "$as_me:$LINENO: checking target system type" >&5 +echo $ECHO_N "checking target system type... $ECHO_C" >&6 +if test "${ac_cv_target+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_cv_target_alias=$target_alias +test "x$ac_cv_target_alias" = "x" && + ac_cv_target_alias=$ac_cv_host_alias +ac_cv_target=`$ac_config_sub $ac_cv_target_alias` || + { { echo "$as_me:$LINENO: error: $ac_config_sub $ac_cv_target_alias failed" >&5 +echo "$as_me: error: $ac_config_sub $ac_cv_target_alias failed" >&2;} + { (exit 1); exit 1; }; } + +fi +echo "$as_me:$LINENO: result: $ac_cv_target" >&5 +echo "${ECHO_T}$ac_cv_target" >&6 +target=$ac_cv_target +target_cpu=`echo $ac_cv_target | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\1/'` +target_vendor=`echo $ac_cv_target | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\2/'` +target_os=`echo $ac_cv_target | sed 's/^\([^-]*\)-\([^-]*\)-\(.*\)$/\3/'` + + +# The aliases save the names the user supplied, while $host etc. +# will get canonicalized. +test -n "$target_alias" && + test "$program_prefix$program_suffix$program_transform_name" = \ + NONENONEs,x,x, && + program_prefix=${target_alias}- + + +# Determine the name of the C compiler we're going to use + +# Check whether --enable-gcc or --disable-gcc was given. +if test "${enable_gcc+set}" = set; then + enableval="$enable_gcc" + gcc_ok=$enableval +else + gcc_ok=no +fi; + +# We cannot set CC=g++ directly because many configuration test programs +# do not compile with g++. Hence, when the user specifies --enable-gcc=g++, +# we set CC=gcc during configuration, and then CC=g++ at the end. +# The same applies to icpc and icc. +if test "$gcc_ok" != no; then + case "$gcc_ok" in + yes | g++) + CC=gcc ;; + icpc) + CC=icc ;; + *) + CC=$gcc_ok + esac +else + if test -z "$CC" ; then + # Balakrishna Kumthekar + # As we do not support cc on RS6000, Cygwin and SunOS. + case "$target" in + rs6000-ibm-aix* | *-pc-cygwin32 | sparc-sun-sunos*) + CC=gcc ;; + *) + CC=cc ;; + esac + fi +fi +ac_ext=c +ac_cpp='$CPP $CPPFLAGS' +ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' +ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' +ac_compiler_gnu=$ac_cv_c_compiler_gnu +if test -n "$ac_tool_prefix"; then + # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args. +set dummy ${ac_tool_prefix}gcc; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$CC"; then + ac_cv_prog_CC="$CC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_CC="${ac_tool_prefix}gcc" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +CC=$ac_cv_prog_CC +if test -n "$CC"; then + echo "$as_me:$LINENO: result: $CC" >&5 +echo "${ECHO_T}$CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +fi +if test -z "$ac_cv_prog_CC"; then + ac_ct_CC=$CC + # Extract the first word of "gcc", so it can be a program name with args. +set dummy gcc; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_ac_ct_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$ac_ct_CC"; then + ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_ac_ct_CC="gcc" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +ac_ct_CC=$ac_cv_prog_ac_ct_CC +if test -n "$ac_ct_CC"; then + echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 +echo "${ECHO_T}$ac_ct_CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + CC=$ac_ct_CC +else + CC="$ac_cv_prog_CC" +fi + +if test -z "$CC"; then + if test -n "$ac_tool_prefix"; then + # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args. +set dummy ${ac_tool_prefix}cc; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$CC"; then + ac_cv_prog_CC="$CC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_CC="${ac_tool_prefix}cc" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +CC=$ac_cv_prog_CC +if test -n "$CC"; then + echo "$as_me:$LINENO: result: $CC" >&5 +echo "${ECHO_T}$CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +fi +if test -z "$ac_cv_prog_CC"; then + ac_ct_CC=$CC + # Extract the first word of "cc", so it can be a program name with args. +set dummy cc; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_ac_ct_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$ac_ct_CC"; then + ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_ac_ct_CC="cc" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +ac_ct_CC=$ac_cv_prog_ac_ct_CC +if test -n "$ac_ct_CC"; then + echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 +echo "${ECHO_T}$ac_ct_CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + CC=$ac_ct_CC +else + CC="$ac_cv_prog_CC" +fi + +fi +if test -z "$CC"; then + # Extract the first word of "cc", so it can be a program name with args. +set dummy cc; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$CC"; then + ac_cv_prog_CC="$CC" # Let the user override the test. +else + ac_prog_rejected=no +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then + ac_prog_rejected=yes + continue + fi + ac_cv_prog_CC="cc" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +if test $ac_prog_rejected = yes; then + # We found a bogon in the path, so make sure we never use it. + set dummy $ac_cv_prog_CC + shift + if test $# != 0; then + # We chose a different compiler from the bogus one. + # However, it has the same basename, so the bogon will be chosen + # first if we set CC to just the basename; use the full file name. + shift + ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@" + fi +fi +fi +fi +CC=$ac_cv_prog_CC +if test -n "$CC"; then + echo "$as_me:$LINENO: result: $CC" >&5 +echo "${ECHO_T}$CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +fi +if test -z "$CC"; then + if test -n "$ac_tool_prefix"; then + for ac_prog in cl + do + # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args. +set dummy $ac_tool_prefix$ac_prog; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$CC"; then + ac_cv_prog_CC="$CC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_CC="$ac_tool_prefix$ac_prog" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +CC=$ac_cv_prog_CC +if test -n "$CC"; then + echo "$as_me:$LINENO: result: $CC" >&5 +echo "${ECHO_T}$CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + test -n "$CC" && break + done +fi +if test -z "$CC"; then + ac_ct_CC=$CC + for ac_prog in cl +do + # Extract the first word of "$ac_prog", so it can be a program name with args. +set dummy $ac_prog; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_ac_ct_CC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$ac_ct_CC"; then + ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_ac_ct_CC="$ac_prog" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +ac_ct_CC=$ac_cv_prog_ac_ct_CC +if test -n "$ac_ct_CC"; then + echo "$as_me:$LINENO: result: $ac_ct_CC" >&5 +echo "${ECHO_T}$ac_ct_CC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + test -n "$ac_ct_CC" && break +done + + CC=$ac_ct_CC +fi + +fi + + +test -z "$CC" && { { echo "$as_me:$LINENO: error: no acceptable C compiler found in \$PATH +See \`config.log' for more details." >&5 +echo "$as_me: error: no acceptable C compiler found in \$PATH +See \`config.log' for more details." >&2;} + { (exit 1); exit 1; }; } + +# Provide some information about the compiler. +echo "$as_me:$LINENO:" \ + "checking for C compiler version" >&5 +ac_compiler=`set X $ac_compile; echo $2` +{ (eval echo "$as_me:$LINENO: \"$ac_compiler --version &5\"") >&5 + (eval $ac_compiler --version &5) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } +{ (eval echo "$as_me:$LINENO: \"$ac_compiler -v &5\"") >&5 + (eval $ac_compiler -v &5) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } +{ (eval echo "$as_me:$LINENO: \"$ac_compiler -V &5\"") >&5 + (eval $ac_compiler -V &5) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } + +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ + + ; + return 0; +} +_ACEOF +ac_clean_files_save=$ac_clean_files +ac_clean_files="$ac_clean_files a.out a.exe b.out" +# Try to create an executable without -o first, disregard a.out. +# It will help us diagnose broken compilers, and finding out an intuition +# of exeext. +echo "$as_me:$LINENO: checking for C compiler default output" >&5 +echo $ECHO_N "checking for C compiler default output... $ECHO_C" >&6 +ac_link_default=`echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'` +if { (eval echo "$as_me:$LINENO: \"$ac_link_default\"") >&5 + (eval $ac_link_default) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; then + # Find the output, starting from the most likely. This scheme is +# not robust to junk in `.', hence go to wildcards (a.*) only as a last +# resort. + +# Be careful to initialize this variable, since it used to be cached. +# Otherwise an old cache value of `no' led to `EXEEXT = no' in a Makefile. +ac_cv_exeext= +# b.out is created by i960 compilers. +for ac_file in a_out.exe a.exe conftest.exe a.out conftest a.* conftest.* b.out +do + test -f "$ac_file" || continue + case $ac_file in + *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.o | *.obj ) + ;; + conftest.$ac_ext ) + # This is the source file. + ;; + [ab].out ) + # We found the default executable, but exeext='' is most + # certainly right. + break;; + *.* ) + ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` + # FIXME: I believe we export ac_cv_exeext for Libtool, + # but it would be cool to find out if it's true. Does anybody + # maintain Libtool? --akim. + export ac_cv_exeext + break;; + * ) + break;; + esac +done +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +{ { echo "$as_me:$LINENO: error: C compiler cannot create executables +See \`config.log' for more details." >&5 +echo "$as_me: error: C compiler cannot create executables +See \`config.log' for more details." >&2;} + { (exit 77); exit 77; }; } +fi + +ac_exeext=$ac_cv_exeext +echo "$as_me:$LINENO: result: $ac_file" >&5 +echo "${ECHO_T}$ac_file" >&6 + +# Check the compiler produces executables we can run. If not, either +# the compiler is broken, or we cross compile. +echo "$as_me:$LINENO: checking whether the C compiler works" >&5 +echo $ECHO_N "checking whether the C compiler works... $ECHO_C" >&6 +# FIXME: These cross compiler hacks should be removed for Autoconf 3.0 +# If not cross compiling, check that we can run a simple program. +if test "$cross_compiling" != yes; then + if { ac_try='./$ac_file' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + cross_compiling=no + else + if test "$cross_compiling" = maybe; then + cross_compiling=yes + else + { { echo "$as_me:$LINENO: error: cannot run C compiled programs. +If you meant to cross compile, use \`--host'. +See \`config.log' for more details." >&5 +echo "$as_me: error: cannot run C compiled programs. +If you meant to cross compile, use \`--host'. +See \`config.log' for more details." >&2;} + { (exit 1); exit 1; }; } + fi + fi +fi +echo "$as_me:$LINENO: result: yes" >&5 +echo "${ECHO_T}yes" >&6 + +rm -f a.out a.exe conftest$ac_cv_exeext b.out +ac_clean_files=$ac_clean_files_save +# Check the compiler produces executables we can run. If not, either +# the compiler is broken, or we cross compile. +echo "$as_me:$LINENO: checking whether we are cross compiling" >&5 +echo $ECHO_N "checking whether we are cross compiling... $ECHO_C" >&6 +echo "$as_me:$LINENO: result: $cross_compiling" >&5 +echo "${ECHO_T}$cross_compiling" >&6 + +echo "$as_me:$LINENO: checking for suffix of executables" >&5 +echo $ECHO_N "checking for suffix of executables... $ECHO_C" >&6 +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; then + # If both `conftest.exe' and `conftest' are `present' (well, observable) +# catch `conftest.exe'. For instance with Cygwin, `ls conftest' will +# work properly (i.e., refer to `conftest.exe'), while it won't with +# `rm'. +for ac_file in conftest.exe conftest conftest.*; do + test -f "$ac_file" || continue + case $ac_file in + *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.o | *.obj ) ;; + *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'` + export ac_cv_exeext + break;; + * ) break;; + esac +done +else + { { echo "$as_me:$LINENO: error: cannot compute suffix of executables: cannot compile and link +See \`config.log' for more details." >&5 +echo "$as_me: error: cannot compute suffix of executables: cannot compile and link +See \`config.log' for more details." >&2;} + { (exit 1); exit 1; }; } +fi + +rm -f conftest$ac_cv_exeext +echo "$as_me:$LINENO: result: $ac_cv_exeext" >&5 +echo "${ECHO_T}$ac_cv_exeext" >&6 + +rm -f conftest.$ac_ext +EXEEXT=$ac_cv_exeext +ac_exeext=$EXEEXT +echo "$as_me:$LINENO: checking for suffix of object files" >&5 +echo $ECHO_N "checking for suffix of object files... $ECHO_C" >&6 +if test "${ac_cv_objext+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ + + ; + return 0; +} +_ACEOF +rm -f conftest.o conftest.obj +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; then + for ac_file in `(ls conftest.o conftest.obj; ls conftest.*) 2>/dev/null`; do + case $ac_file in + *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg ) ;; + *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'` + break;; + esac +done +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +{ { echo "$as_me:$LINENO: error: cannot compute suffix of object files: cannot compile +See \`config.log' for more details." >&5 +echo "$as_me: error: cannot compute suffix of object files: cannot compile +See \`config.log' for more details." >&2;} + { (exit 1); exit 1; }; } +fi + +rm -f conftest.$ac_cv_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_objext" >&5 +echo "${ECHO_T}$ac_cv_objext" >&6 +OBJEXT=$ac_cv_objext +ac_objext=$OBJEXT +echo "$as_me:$LINENO: checking whether we are using the GNU C compiler" >&5 +echo $ECHO_N "checking whether we are using the GNU C compiler... $ECHO_C" >&6 +if test "${ac_cv_c_compiler_gnu+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ +#ifndef __GNUC__ + choke me +#endif + + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_compiler_gnu=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_compiler_gnu=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext +ac_cv_c_compiler_gnu=$ac_compiler_gnu + +fi +echo "$as_me:$LINENO: result: $ac_cv_c_compiler_gnu" >&5 +echo "${ECHO_T}$ac_cv_c_compiler_gnu" >&6 +GCC=`test $ac_compiler_gnu = yes && echo yes` +ac_test_CFLAGS=${CFLAGS+set} +ac_save_CFLAGS=$CFLAGS +CFLAGS="-g" +echo "$as_me:$LINENO: checking whether $CC accepts -g" >&5 +echo $ECHO_N "checking whether $CC accepts -g... $ECHO_C" >&6 +if test "${ac_cv_prog_cc_g+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ + + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_prog_cc_g=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_prog_cc_g=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_prog_cc_g" >&5 +echo "${ECHO_T}$ac_cv_prog_cc_g" >&6 +if test "$ac_test_CFLAGS" = set; then + CFLAGS=$ac_save_CFLAGS +elif test $ac_cv_prog_cc_g = yes; then + if test "$GCC" = yes; then + CFLAGS="-g -O2" + else + CFLAGS="-g" + fi +else + if test "$GCC" = yes; then + CFLAGS="-O2" + else + CFLAGS= + fi +fi +echo "$as_me:$LINENO: checking for $CC option to accept ANSI C" >&5 +echo $ECHO_N "checking for $CC option to accept ANSI C... $ECHO_C" >&6 +if test "${ac_cv_prog_cc_stdc+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_cv_prog_cc_stdc=no +ac_save_CC=$CC +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include +#include +#include +/* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */ +struct buf { int x; }; +FILE * (*rcsopen) (struct buf *, struct stat *, int); +static char *e (p, i) + char **p; + int i; +{ + return p[i]; +} +static char *f (char * (*g) (char **, int), char **p, ...) +{ + char *s; + va_list v; + va_start (v,p); + s = g (p, va_arg (v,int)); + va_end (v); + return s; +} +int test (int i, double x); +struct s1 {int (*f) (int a);}; +struct s2 {int (*f) (double a);}; +int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int); +int argc; +char **argv; +int +main () +{ +return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1]; + ; + return 0; +} +_ACEOF +# Don't try gcc -ansi; that turns off useful extensions and +# breaks some systems' header files. +# AIX -qlanglvl=ansi +# Ultrix and OSF/1 -std1 +# HP-UX 10.20 and later -Ae +# HP-UX older versions -Aa -D_HPUX_SOURCE +# SVR4 -Xc -D__EXTENSIONS__ +for ac_arg in "" -qlanglvl=ansi -std1 -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__" +do + CC="$ac_save_CC $ac_arg" + rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_prog_cc_stdc=$ac_arg +break +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext +done +rm -f conftest.$ac_ext conftest.$ac_objext +CC=$ac_save_CC + +fi + +case "x$ac_cv_prog_cc_stdc" in + x|xno) + echo "$as_me:$LINENO: result: none needed" >&5 +echo "${ECHO_T}none needed" >&6 ;; + *) + echo "$as_me:$LINENO: result: $ac_cv_prog_cc_stdc" >&5 +echo "${ECHO_T}$ac_cv_prog_cc_stdc" >&6 + CC="$CC $ac_cv_prog_cc_stdc" ;; +esac + +# Some people use a C++ compiler to compile C. Since we use `exit', +# in C++ we need to declare it. In case someone uses the same compiler +# for both compiling C and C++ we need to have the C++ compiler decide +# the declaration of exit, since it's the most demanding environment. +cat >conftest.$ac_ext <<_ACEOF +#ifndef __cplusplus + choke me +#endif +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + for ac_declaration in \ + ''\ + '#include ' \ + 'extern "C" void std::exit (int) throw (); using std::exit;' \ + 'extern "C" void std::exit (int); using std::exit;' \ + 'extern "C" void exit (int) throw ();' \ + 'extern "C" void exit (int);' \ + 'void exit (int);' +do + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +$ac_declaration +int +main () +{ +exit (42); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + : +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +continue +fi +rm -f conftest.$ac_objext conftest.$ac_ext + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +$ac_declaration +int +main () +{ +exit (42); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + break +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest.$ac_ext +done +rm -f conftest* +if test -n "$ac_declaration"; then + echo '#ifdef __cplusplus' >>confdefs.h + echo $ac_declaration >>confdefs.h + echo '#endif' >>confdefs.h +fi + +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest.$ac_ext +ac_ext=c +ac_cpp='$CPP $CPPFLAGS' +ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' +ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' +ac_compiler_gnu=$ac_cv_c_compiler_gnu + + +# Check whether --enable-64 or --disable-64 was given. +if test "${enable_64+set}" = set; then + enableval="$enable_64" + use_sixty_four=$enableval +else + use_sixty_four=no +fi; + +# Gcc does not support 32-bit pointers on the Alphas. +if test "$gcc_ok" != no; then + use_sixty_four=yes +fi + + +# Roderick Bloem (rbloem@colorado.edu): making a special case for +# ultrix install, since it's annoying about setting groupids. +case "$target" in + mips-dec-ultrix*) + INSTALL="helpers/install-sh -c" + INSTALL_PROGRAM="\${INSTALL}" + INSTALL_DATA="\${INSTALL} -m 644";; + + *) + # Find a good install program. We prefer a C program (faster), +# so one script is as good as another. But avoid the broken or +# incompatible versions: +# SysV /etc/install, /usr/sbin/install +# SunOS /usr/etc/install +# IRIX /sbin/install +# AIX /bin/install +# AmigaOS /C/install, which installs bootblocks on floppy discs +# AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag +# AFS /usr/afsws/bin/install, which mishandles nonexistent args +# SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff" +# ./install, which can be erroneously created by make from ./install.sh. +echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5 +echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6 +if test -z "$INSTALL"; then +if test "${ac_cv_path_install+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + # Account for people who put trailing slashes in PATH elements. +case $as_dir/ in + ./ | .// | /cC/* | \ + /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \ + /usr/ucb/* ) ;; + *) + # OSF1 and SCO ODT 3.0 have their own names for install. + # Don't use installbsd from OSF since it installs stuff as root + # by default. + for ac_prog in ginstall scoinst install; do + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_prog$ac_exec_ext"; then + if test $ac_prog = install && + grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then + # AIX install. It has an incompatible calling convention. + : + elif test $ac_prog = install && + grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then + # program-specific install script used by HP pwplus--don't use. + : + else + ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c" + break 3 + fi + fi + done + done + ;; +esac +done + + +fi + if test "${ac_cv_path_install+set}" = set; then + INSTALL=$ac_cv_path_install + else + # As a last resort, use the slow shell script. We don't cache a + # path for INSTALL within a source directory, because that will + # break other packages using the cache if that directory is + # removed, or if the path is relative. + INSTALL=$ac_install_sh + fi +fi +echo "$as_me:$LINENO: result: $INSTALL" >&5 +echo "${ECHO_T}$INSTALL" >&6 + +# Use test -z because SunOS4 sh mishandles braces in ${var-val}. +# It thinks the first close brace ends the variable substitution. +test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}' + +test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}' + +test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644' + ;; +esac + +# Determine the compiler flags to use + +DEBUG_CFLAGS="-g" +DEBUG_LDFLAGS="" + +case "$target" in + + i686-pc-linux-gnu) + # Linux with Intel compiler + # -ansi: ANSI C conformance + # -ip: inter-procedural optimization + OPTIMIZE_CFLAGS="-g -O3 -ansi -ip" + ;; + + sparc-sun-solaris* | i386-pc-solaris*) + # Sparc and X86 Solaris: + # -xO3: Highest safe level of optimization + # -native: Optimize for the native processor (if supported) + # -dalign: Generate double-word load/store for performance + # (only for SPARC) + # and other arcane compilation flags. + if test "$GCC" = yes; then + OPTIMIZE_CFLAGS="-O" + else + case "$target" in + sparc-sun-solaris*) + ALIGN=" -dalign" ;; + *) + ALIGN="" ;; + esac + echo "$as_me:$LINENO: checking for -native" >&5 +echo $ECHO_N "checking for -native... $ECHO_C" >&6 + CFLAGS="-xO3 -native$ALIGN" + +if test "${ac_cv_have_native+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test "$cross_compiling" = yes; then + ac_cv_have_native=no +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + + main(){exit(0);} + +_ACEOF +rm -f conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && { ac_try='./conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_have_native=yes +else + echo "$as_me: program exited with status $ac_status" >&5 +echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +( exit $ac_status ) +ac_cv_have_native=no +fi +rm -f core core.* *.core gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext +fi +fi + + if test $ac_cv_have_native = yes ; then + echo "$as_me:$LINENO: result: working" >&5 +echo "${ECHO_T}working" >&6 + OPTIMIZE_CFLAGS="-xO3 -native$ALIGN" + else + echo "$as_me:$LINENO: result: broken" >&5 +echo "${ECHO_T}broken" >&6 + echo "$as_me:$LINENO: checking for fallback optimization flags" >&5 +echo $ECHO_N "checking for fallback optimization flags... $ECHO_C" >&6 + CFLAGS="-xO3 -fns -fsimple=2$ALIGN -ftrap=%none -xlibmil" + if test "${ac_cv_have_fallback+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test "$cross_compiling" = yes; then + ac_cv_have_fallback=no +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + + main(){exit(0);} + +_ACEOF +rm -f conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && { ac_try='./conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_have_fallback=yes +else + echo "$as_me: program exited with status $ac_status" >&5 +echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +( exit $ac_status ) +ac_cv_have_fallback=no +fi +rm -f core core.* *.core gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext +fi +fi + + if test $ac_cv_have_fallback = yes ; then + echo "$as_me:$LINENO: result: working" >&5 +echo "${ECHO_T}working" >&6 + OPTIMIZE_CFLAGS="-xO3 -fns -fsimple=2$ALIGN -ftrap=%none -xlibmil" + else + echo "$as_me:$LINENO: result: broken" >&5 +echo "${ECHO_T}broken" >&6 + OPTIMIZE_CFLAGS="-O" + fi + fi + fi + ;; + + mips-dec-ultrix*) + # MIPS-based DECstations running Ultrix: + # -std1: Produce non-ANSI code warnings, and define __STDC__ + # -O: Use the global "ucode" optimizer + # -Olimit 5000: Don't optimize routines bigger than 5000 basic blocks + OPTIMIZE_CFLAGS="-std1 -O -Olimit 5000" ;; + + alpha-dec-osf*) + # DEC Alpha running OSF: + + # 64-bit mode: + # -g3: Produce symbol table information for optimized code + # -O4: Enable every optimization + # -std: Enforce the ANSI standard with extensions, define __STDC__ + # -ieee_with_no_inexact: Disable (potentially slow) signaling + # for inexact floating-point results + # -tune host: Tune instructions for the compilation host machine + OPTIMIZE_CFLAGS="-g3 -O4 -std -ieee_with_no_inexact -tune host" + DEBUG_CFLAGS="-g -std -ieee_with_no_inexact" + + # -non_shared: Do not use shared libraries + # -om: Generate an OMAGIC file for the om optimizer + OPTIMIZE_LDFLAGS="-non_shared" + + if test "$use_sixty_four" = "no"; then + # 32-bit mode: + # -xtaso: Make the compiler respond to #pragma pointer_size directives + OPTIMIZE_CFLAGS="$OPTIMIZE_CFLAGS -xtaso" + DEBUG_CFLAGS="$DEBUG_CFLAGS -xtaso" + + # -taso: Load the executable into the lower 31-bit address space + OPTIMIZE_LDFLAGS="$OPTIMIZE_LDFLAGS -om -taso" + DEBUG_LDFLAGS="$DEBUG_LDFLAGS -taso" + + cat >>confdefs.h <<\_ACEOF +#define SIZEOF_VOID_P 4 +_ACEOF + + ac_sizeof_voidp=4 + fi + ;; + + hppa*-*-hpux*) + # HP running HPUX + # -Aa: Behave as an ANSI compiler + # -D_HPUX_SOURCE: Include "HP-specific" symbols in the header + # files (e.g., this means sys/resource.h has struct rusage) + # +Onolimit: removes resource restrictions for optimization + OPTIMIZE_CFLAGS="-O -Aa +Onolimit -D_HPUX_SOURCE" + DEBUG_CFLAGS="-g -Aa -D_HPUX_SOURCE" ;; + + *) + # Other systems: + OPTIMIZE_CFLAGS="-O" ;; + +esac + +if test "$GCC" = yes; then + case "$target" in + i686-pc-linux-gnu | i386-pc-solaris* | i386-pc-cygwin32 | i386-*-freebsd*) + echo "$as_me:$LINENO: checking for -mcpu and -malign compiler options" >&5 +echo $ECHO_N "checking for -mcpu and -malign compiler options... $ECHO_C" >&6 + CFLAGS="-g -O6 -mcpu=pentiumpro -malign-double" + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ + + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_have_mcpu=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_have_mcpu=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext + if test "$ac_have_mcpu" = yes; then + echo "$as_me:$LINENO: result: working" >&5 +echo "${ECHO_T}working" >&6 + OPTIMIZE_CFLAGS="-g -O6 -mcpu=pentiumpro -malign-double" + else + echo "$as_me:$LINENO: result: broken" >&5 +echo "${ECHO_T}broken" >&6 + OPTIMIZE_CFLAGS="-g -O3" + fi + ;; + sparc-sun-solaris*) + echo "$as_me:$LINENO: checking for -mtune compiler option" >&5 +echo $ECHO_N "checking for -mtune compiler option... $ECHO_C" >&6 + CFLAGS="-g -O6 -mtune=ultrasparc" + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ + + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_have_mtune=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_have_mtune=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext + if test "$ac_have_mtune" = yes; then + echo "$as_me:$LINENO: result: working" >&5 +echo "${ECHO_T}working" >&6 + OPTIMIZE_CFLAGS="-g -O6 -mtune=ultrasparc" + else + echo "$as_me:$LINENO: result: not working" >&5 +echo "${ECHO_T}not working" >&6 + OPTIMIZE_CFLAGS="-g -O3" + fi + ;; + *) + OPTIMIZE_CFLAGS="-g -O3" + ;; + esac + OPTIMIZE_LDFLAGS="" + DEBUG_CFLAGS="-g" + DEBUG_LDFLAGS="" +fi + + +# Check whether --with-comp-mode or --without-comp-mode was given. +if test "${with_comp_mode+set}" = set; then + withval="$with_comp_mode" + comp_mode=$withval +else + comp_mode=optimize +fi; + + + +LINKER="$CC" + +case "$comp_mode" in + debug) + CFLAGS="$DEBUG_CFLAGS" + LDFLAGS="$DEBUG_LDFLAGS" ;; + purify) + CFLAGS="$DEBUG_CFLAGS" + LDFLAGS="$DEBUG_LDFLAGS" + cat >>confdefs.h <<\_ACEOF +#define PURIFY 1 +_ACEOF + + LINKER="purify -cache-dir=/tmp $CC" + PLINKER="purify -log-file=./purify.log -cachedir=/tmp $CC" ;; + quantify) + CFLAGS="$OPTIMIZE_CFLAGS" + LDFLAGS="$OPTIMIZE_LDFLAGS" + cat >>confdefs.h <<\_ACEOF +#define QUANTIFY 1 +_ACEOF + + cat >>confdefs.h <<\_ACEOF +#define NDEBUG 1 +_ACEOF + + LINKER="quantify $CC" ;; + optimize | *) + CFLAGS="$OPTIMIZE_CFLAGS" + LDFLAGS="$OPTIMIZE_LDFLAGS" + cat >>confdefs.h <<\_ACEOF +#define NDEBUG 1 +_ACEOF + ;; +esac + +for ac_prog in flex lex +do + # Extract the first word of "$ac_prog", so it can be a program name with args. +set dummy $ac_prog; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_LEX+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$LEX"; then + ac_cv_prog_LEX="$LEX" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_LEX="$ac_prog" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +LEX=$ac_cv_prog_LEX +if test -n "$LEX"; then + echo "$as_me:$LINENO: result: $LEX" >&5 +echo "${ECHO_T}$LEX" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + test -n "$LEX" && break +done +test -n "$LEX" || LEX=":" + +if test -z "$LEXLIB" +then + echo "$as_me:$LINENO: checking for yywrap in -lfl" >&5 +echo $ECHO_N "checking for yywrap in -lfl... $ECHO_C" >&6 +if test "${ac_cv_lib_fl_yywrap+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-lfl $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char yywrap (); +int +main () +{ +yywrap (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_fl_yywrap=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_fl_yywrap=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_fl_yywrap" >&5 +echo "${ECHO_T}$ac_cv_lib_fl_yywrap" >&6 +if test $ac_cv_lib_fl_yywrap = yes; then + LEXLIB="-lfl" +else + echo "$as_me:$LINENO: checking for yywrap in -ll" >&5 +echo $ECHO_N "checking for yywrap in -ll... $ECHO_C" >&6 +if test "${ac_cv_lib_l_yywrap+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-ll $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char yywrap (); +int +main () +{ +yywrap (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_l_yywrap=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_l_yywrap=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_l_yywrap" >&5 +echo "${ECHO_T}$ac_cv_lib_l_yywrap" >&6 +if test $ac_cv_lib_l_yywrap = yes; then + LEXLIB="-ll" +fi + +fi + +fi + +if test "x$LEX" != "x:"; then + echo "$as_me:$LINENO: checking lex output file root" >&5 +echo $ECHO_N "checking lex output file root... $ECHO_C" >&6 +if test "${ac_cv_prog_lex_root+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + # The minimal lex program is just a single line: %%. But some broken lexes +# (Solaris, I think it was) want two %% lines, so accommodate them. +cat >conftest.l <<_ACEOF +%% +%% +_ACEOF +{ (eval echo "$as_me:$LINENO: \"$LEX conftest.l\"") >&5 + (eval $LEX conftest.l) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } +if test -f lex.yy.c; then + ac_cv_prog_lex_root=lex.yy +elif test -f lexyy.c; then + ac_cv_prog_lex_root=lexyy +else + { { echo "$as_me:$LINENO: error: cannot find output from $LEX; giving up" >&5 +echo "$as_me: error: cannot find output from $LEX; giving up" >&2;} + { (exit 1); exit 1; }; } +fi +fi +echo "$as_me:$LINENO: result: $ac_cv_prog_lex_root" >&5 +echo "${ECHO_T}$ac_cv_prog_lex_root" >&6 +rm -f conftest.l +LEX_OUTPUT_ROOT=$ac_cv_prog_lex_root + +echo "$as_me:$LINENO: checking whether yytext is a pointer" >&5 +echo $ECHO_N "checking whether yytext is a pointer... $ECHO_C" >&6 +if test "${ac_cv_prog_lex_yytext_pointer+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + # POSIX says lex can declare yytext either as a pointer or an array; the +# default is implementation-dependent. Figure out which it is, since +# not all implementations provide the %pointer and %array declarations. +ac_cv_prog_lex_yytext_pointer=no +echo 'extern char *yytext;' >>$LEX_OUTPUT_ROOT.c +ac_save_LIBS=$LIBS +LIBS="$LIBS $LEXLIB" +cat >conftest.$ac_ext <<_ACEOF +`cat $LEX_OUTPUT_ROOT.c` +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_prog_lex_yytext_pointer=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_save_LIBS +rm -f "${LEX_OUTPUT_ROOT}.c" + +fi +echo "$as_me:$LINENO: result: $ac_cv_prog_lex_yytext_pointer" >&5 +echo "${ECHO_T}$ac_cv_prog_lex_yytext_pointer" >&6 +if test $ac_cv_prog_lex_yytext_pointer = yes; then + +cat >>confdefs.h <<\_ACEOF +#define YYTEXT_POINTER 1 +_ACEOF + +fi + +fi +echo "$as_me:$LINENO: checking if $LEX accepts the -o and -P options" >&5 +echo $ECHO_N "checking if $LEX accepts the -o and -P options... $ECHO_C" >&6 + +if test "${ac_cv_flex_accepts_op+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_cv_flex_accepts_op=yes ; +echo "%%\ +%%" | $LEX -Ptest -o/dev/null >/dev/null 2>&1 || ac_cv_flex_accepts_op=no +fi + +if test $ac_cv_flex_accepts_op = yes ; then + echo "$as_me:$LINENO: result: yes" >&5 +echo "${ECHO_T}yes" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 + { echo "$as_me:$LINENO: WARNING: You either need a newer version of flex, or need to modify +the defintion of LEX in the Makefile to point to a version that does +accept -p -t and -o." >&5 +echo "$as_me: WARNING: You either need a newer version of flex, or need to modify +the defintion of LEX in the Makefile to point to a version that does +accept -p -t and -o." >&2;} +fi + +for ac_prog in 'bison -y' byacc +do + # Extract the first word of "$ac_prog", so it can be a program name with args. +set dummy $ac_prog; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_YACC+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$YACC"; then + ac_cv_prog_YACC="$YACC" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_YACC="$ac_prog" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +YACC=$ac_cv_prog_YACC +if test -n "$YACC"; then + echo "$as_me:$LINENO: result: $YACC" >&5 +echo "${ECHO_T}$YACC" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + test -n "$YACC" && break +done +test -n "$YACC" || YACC="yacc" + +echo "$as_me:$LINENO: checking if $YACC accepts the -p, -t, and -o options" >&5 +echo $ECHO_N "checking if $YACC accepts the -p, -t, and -o options... $ECHO_C" >&6 +if test "${ac_cv_yacc_accepts_pto+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_cv_yacc_accepts_pto=yes ; +echo "%token terminal\ +%%\ +nonterminal: terminal\ +%%" > config.in +$YACC -ptest -o /dev/null config.in >/dev/null 2>&1 || ac_cv_yacc_accepts_pto=no +rm -f config.in +fi + +if test $ac_cv_yacc_accepts_pto = yes ; then + echo "$as_me:$LINENO: result: yes" >&5 +echo "${ECHO_T}yes" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 + { echo "$as_me:$LINENO: WARNING: You either need a newer version of bison, or need to modify +the defintion of YACC in the Makefile to point to a version that does +accept -p -t and -o." >&5 +echo "$as_me: WARNING: You either need a newer version of bison, or need to modify +the defintion of YACC in the Makefile to point to a version that does +accept -p -t and -o." >&2;} +fi + +#---------------------------------------------------------------------- +# Checks for headers and libraries +#---------------------------------------------------------------------- +ac_ext=c +ac_cpp='$CPP $CPPFLAGS' +ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' +ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' +ac_compiler_gnu=$ac_cv_c_compiler_gnu +echo "$as_me:$LINENO: checking how to run the C preprocessor" >&5 +echo $ECHO_N "checking how to run the C preprocessor... $ECHO_C" >&6 +# On Suns, sometimes $CPP names a directory. +if test -n "$CPP" && test -d "$CPP"; then + CPP= +fi +if test -z "$CPP"; then + if test "${ac_cv_prog_CPP+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + # Double quotes because CPP needs to be expanded + for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp" + do + ac_preproc_ok=false +for ac_c_preproc_warn_flag in '' yes +do + # Use a header file that comes with gcc, so configuring glibc + # with a fresh cross-compiler works. + # Prefer to if __STDC__ is defined, since + # exists even on freestanding compilers. + # On the NeXT, cc -E runs the code through the compiler's parser, + # not just through cpp. "Syntax error" is here to catch this case. + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#ifdef __STDC__ +# include +#else +# include +#endif + Syntax error +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + : +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + # Broken: fails on valid input. +continue +fi +rm -f conftest.err conftest.$ac_ext + + # OK, works on sane cases. Now check whether non-existent headers + # can be detected and how. + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + # Broken: success on invalid input. +continue +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + # Passes both tests. +ac_preproc_ok=: +break +fi +rm -f conftest.err conftest.$ac_ext + +done +# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. +rm -f conftest.err conftest.$ac_ext +if $ac_preproc_ok; then + break +fi + + done + ac_cv_prog_CPP=$CPP + +fi + CPP=$ac_cv_prog_CPP +else + ac_cv_prog_CPP=$CPP +fi +echo "$as_me:$LINENO: result: $CPP" >&5 +echo "${ECHO_T}$CPP" >&6 +ac_preproc_ok=false +for ac_c_preproc_warn_flag in '' yes +do + # Use a header file that comes with gcc, so configuring glibc + # with a fresh cross-compiler works. + # Prefer to if __STDC__ is defined, since + # exists even on freestanding compilers. + # On the NeXT, cc -E runs the code through the compiler's parser, + # not just through cpp. "Syntax error" is here to catch this case. + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#ifdef __STDC__ +# include +#else +# include +#endif + Syntax error +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + : +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + # Broken: fails on valid input. +continue +fi +rm -f conftest.err conftest.$ac_ext + + # OK, works on sane cases. Now check whether non-existent headers + # can be detected and how. + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + # Broken: success on invalid input. +continue +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + # Passes both tests. +ac_preproc_ok=: +break +fi +rm -f conftest.err conftest.$ac_ext + +done +# Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped. +rm -f conftest.err conftest.$ac_ext +if $ac_preproc_ok; then + : +else + { { echo "$as_me:$LINENO: error: C preprocessor \"$CPP\" fails sanity check +See \`config.log' for more details." >&5 +echo "$as_me: error: C preprocessor \"$CPP\" fails sanity check +See \`config.log' for more details." >&2;} + { (exit 1); exit 1; }; } +fi + +ac_ext=c +ac_cpp='$CPP $CPPFLAGS' +ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5' +ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5' +ac_compiler_gnu=$ac_cv_c_compiler_gnu + + +echo "$as_me:$LINENO: checking for egrep" >&5 +echo $ECHO_N "checking for egrep... $ECHO_C" >&6 +if test "${ac_cv_prog_egrep+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if echo a | (grep -E '(a|b)') >/dev/null 2>&1 + then ac_cv_prog_egrep='grep -E' + else ac_cv_prog_egrep='egrep' + fi +fi +echo "$as_me:$LINENO: result: $ac_cv_prog_egrep" >&5 +echo "${ECHO_T}$ac_cv_prog_egrep" >&6 + EGREP=$ac_cv_prog_egrep + + +echo "$as_me:$LINENO: checking for ANSI C header files" >&5 +echo $ECHO_N "checking for ANSI C header files... $ECHO_C" >&6 +if test "${ac_cv_header_stdc+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include +#include +#include + +int +main () +{ + + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_header_stdc=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_header_stdc=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext + +if test $ac_cv_header_stdc = yes; then + # SunOS 4.x string.h does not declare mem*, contrary to ANSI. + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include + +_ACEOF +if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | + $EGREP "memchr" >/dev/null 2>&1; then + : +else + ac_cv_header_stdc=no +fi +rm -f conftest* + +fi + +if test $ac_cv_header_stdc = yes; then + # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI. + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include + +_ACEOF +if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | + $EGREP "free" >/dev/null 2>&1; then + : +else + ac_cv_header_stdc=no +fi +rm -f conftest* + +fi + +if test $ac_cv_header_stdc = yes; then + # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi. + if test "$cross_compiling" = yes; then + : +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#if ((' ' & 0x0FF) == 0x020) +# define ISLOWER(c) ('a' <= (c) && (c) <= 'z') +# define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c)) +#else +# define ISLOWER(c) \ + (('a' <= (c) && (c) <= 'i') \ + || ('j' <= (c) && (c) <= 'r') \ + || ('s' <= (c) && (c) <= 'z')) +# define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c)) +#endif + +#define XOR(e, f) (((e) && !(f)) || (!(e) && (f))) +int +main () +{ + int i; + for (i = 0; i < 256; i++) + if (XOR (islower (i), ISLOWER (i)) + || toupper (i) != TOUPPER (i)) + exit(2); + exit (0); +} +_ACEOF +rm -f conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && { ac_try='./conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + : +else + echo "$as_me: program exited with status $ac_status" >&5 +echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +( exit $ac_status ) +ac_cv_header_stdc=no +fi +rm -f core core.* *.core gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext +fi +fi +fi +echo "$as_me:$LINENO: result: $ac_cv_header_stdc" >&5 +echo "${ECHO_T}$ac_cv_header_stdc" >&6 +if test $ac_cv_header_stdc = yes; then + +cat >>confdefs.h <<\_ACEOF +#define STDC_HEADERS 1 +_ACEOF + +fi + + + + +# add -lucb to LIBS and -L/usr/ucblib to LIBDIRS +# if there's a libucb.a available +# (Solaris needs this for signals) + +ac_save_ldflags="$LDFLAGS" +LDFLAGS=-L/usr/ucblib +echo "$as_me:$LINENO: checking for main in -lucb" >&5 +echo $ECHO_N "checking for main in -lucb... $ECHO_C" >&6 +if test "${ac_cv_lib_ucb_main+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-lucb $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + + +int +main () +{ +main (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_ucb_main=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_ucb_main=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_ucb_main" >&5 +echo "${ECHO_T}$ac_cv_lib_ucb_main" >&6 +if test $ac_cv_lib_ucb_main = yes; then + LIBDIRS="$LIBDIRS -L/usr/ucblib" +fi + +LDFLAGS="$ac_save_ldflags" + +# add -lbsd if there's a libbsd.a available +# (e.g., Linux needs this for bsd_ioctl) + +echo "$as_me:$LINENO: checking for main in -lbsd" >&5 +echo $ECHO_N "checking for main in -lbsd... $ECHO_C" >&6 +if test "${ac_cv_lib_bsd_main+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-lbsd $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + + +int +main () +{ +main (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_bsd_main=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_bsd_main=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_bsd_main" >&5 +echo "${ECHO_T}$ac_cv_lib_bsd_main" >&6 +if test $ac_cv_lib_bsd_main = yes; then + cat >>confdefs.h <<_ACEOF +#define HAVE_LIBBSD 1 +_ACEOF + + LIBS="-lbsd $LIBS" + +fi + + +# Check if libreadline exists and the function readline can be used. +# This implies checking for the availability of libtermcap or of a +# suitable replacement. (We only look for libncurses.) +if test "${vis_cv_termcap_lib+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + echo "$as_me:$LINENO: checking for tgetent in -ltermcap" >&5 +echo $ECHO_N "checking for tgetent in -ltermcap... $ECHO_C" >&6 +if test "${ac_cv_lib_termcap_tgetent+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-ltermcap $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char tgetent (); +int +main () +{ +tgetent (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_termcap_tgetent=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_termcap_tgetent=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_termcap_tgetent" >&5 +echo "${ECHO_T}$ac_cv_lib_termcap_tgetent" >&6 +if test $ac_cv_lib_termcap_tgetent = yes; then + vis_cv_termcap_lib=-ltermcap +else + echo "$as_me:$LINENO: checking for tgetent in -lncurses" >&5 +echo $ECHO_N "checking for tgetent in -lncurses... $ECHO_C" >&6 +if test "${ac_cv_lib_ncurses_tgetent+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-lncurses $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char tgetent (); +int +main () +{ +tgetent (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_ncurses_tgetent=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_ncurses_tgetent=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_ncurses_tgetent" >&5 +echo "${ECHO_T}$ac_cv_lib_ncurses_tgetent" >&6 +if test $ac_cv_lib_ncurses_tgetent = yes; then + vis_cv_termcap_lib=-lncurses +else + bash_cv_termcap_lib=none +fi + +fi + +fi + +if test "$vis_cv_termcap_lib" != none; then + echo "$as_me:$LINENO: checking for readline in -lreadline" >&5 +echo $ECHO_N "checking for readline in -lreadline... $ECHO_C" >&6 +if test "${ac_cv_lib_readline_readline+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_check_lib_save_LIBS=$LIBS +LIBS="-lreadline $vis_cv_termcap_lib $LIBS" +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char readline (); +int +main () +{ +readline (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_lib_readline_readline=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_lib_readline_readline=no +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +LIBS=$ac_check_lib_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_lib_readline_readline" >&5 +echo "${ECHO_T}$ac_cv_lib_readline_readline" >&6 +if test $ac_cv_lib_readline_readline = yes; then + ac_readline_flag=1 +else + ac_readline_flag=0 +fi + + if test $ac_readline_flag = 1 ; then + LIBS="$LIBS -lreadline $vis_cv_termcap_lib" ; cat >>confdefs.h <<\_ACEOF +#define HAVE_LIBREADLINE 1 +_ACEOF + + fi +fi + +# Check for the dirent header file, which is quite a mess + + + + + +ac_header_dirent=no +for ac_hdr in dirent.h sys/ndir.h sys/dir.h ndir.h; do + as_ac_Header=`echo "ac_cv_header_dirent_$ac_hdr" | $as_tr_sh` +echo "$as_me:$LINENO: checking for $ac_hdr that defines DIR" >&5 +echo $ECHO_N "checking for $ac_hdr that defines DIR... $ECHO_C" >&6 +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include <$ac_hdr> + +int +main () +{ +if ((DIR *) 0) +return 0; + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + eval "$as_ac_Header=yes" +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +eval "$as_ac_Header=no" +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 +if test `eval echo '${'$as_ac_Header'}'` = yes; then + cat >>confdefs.h <<_ACEOF +#define `echo "HAVE_$ac_hdr" | $as_tr_cpp` 1 +_ACEOF + +ac_header_dirent=$ac_hdr; break +fi + +done +# Two versions of opendir et al. are in -ldir and -lx on SCO Xenix. +if test $ac_header_dirent = dirent.h; then + echo "$as_me:$LINENO: checking for library containing opendir" >&5 +echo $ECHO_N "checking for library containing opendir... $ECHO_C" >&6 +if test "${ac_cv_search_opendir+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_func_search_save_LIBS=$LIBS +ac_cv_search_opendir=no +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char opendir (); +int +main () +{ +opendir (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_search_opendir="none required" +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +if test "$ac_cv_search_opendir" = no; then + for ac_lib in dir; do + LIBS="-l$ac_lib $ac_func_search_save_LIBS" + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char opendir (); +int +main () +{ +opendir (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_search_opendir="-l$ac_lib" +break +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext + done +fi +LIBS=$ac_func_search_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_search_opendir" >&5 +echo "${ECHO_T}$ac_cv_search_opendir" >&6 +if test "$ac_cv_search_opendir" != no; then + test "$ac_cv_search_opendir" = "none required" || LIBS="$ac_cv_search_opendir $LIBS" + +fi + +else + echo "$as_me:$LINENO: checking for library containing opendir" >&5 +echo $ECHO_N "checking for library containing opendir... $ECHO_C" >&6 +if test "${ac_cv_search_opendir+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_func_search_save_LIBS=$LIBS +ac_cv_search_opendir=no +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char opendir (); +int +main () +{ +opendir (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_search_opendir="none required" +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +if test "$ac_cv_search_opendir" = no; then + for ac_lib in x; do + LIBS="-l$ac_lib $ac_func_search_save_LIBS" + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char opendir (); +int +main () +{ +opendir (); + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_search_opendir="-l$ac_lib" +break +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext + done +fi +LIBS=$ac_func_search_save_LIBS +fi +echo "$as_me:$LINENO: result: $ac_cv_search_opendir" >&5 +echo "${ECHO_T}$ac_cv_search_opendir" >&6 +if test "$ac_cv_search_opendir" != no; then + test "$ac_cv_search_opendir" = "none required" || LIBS="$ac_cv_search_opendir $LIBS" + +fi + +fi + + +# Check for these system header files +# On IRIX 5.3, sys/types and inttypes.h are conflicting. + + + + + + + + + +for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \ + inttypes.h stdint.h unistd.h +do +as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` +echo "$as_me:$LINENO: checking for $ac_header" >&5 +echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +$ac_includes_default + +#include <$ac_header> +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + eval "$as_ac_Header=yes" +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +eval "$as_ac_Header=no" +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 +if test `eval echo '${'$as_ac_Header'}'` = yes; then + cat >>confdefs.h <<_ACEOF +#define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 +_ACEOF + +fi + +done + + + + + + + + + +for ac_header in sys/termios.h sys/ioctl.h sys/time.h signal.h sys/signal.h readline/readline.h readline/history.h +do +as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo "$as_me:$LINENO: checking for $ac_header" >&5 +echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 +else + # Is the header compilable? +echo "$as_me:$LINENO: checking $ac_header usability" >&5 +echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6 +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +$ac_includes_default +#include <$ac_header> +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_header_compiler=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_header_compiler=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext +echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 +echo "${ECHO_T}$ac_header_compiler" >&6 + +# Is the header present? +echo "$as_me:$LINENO: checking $ac_header presence" >&5 +echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6 +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include <$ac_header> +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + ac_header_preproc=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + ac_header_preproc=no +fi +rm -f conftest.err conftest.$ac_ext +echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 +echo "${ECHO_T}$ac_header_preproc" >&6 + +# So? What about this header? +case $ac_header_compiler:$ac_header_preproc in + yes:no ) + { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 +echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 +echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} + ( + cat <<\_ASBOX +## ------------------------------------ ## +## Report this to bug-autoconf@gnu.org. ## +## ------------------------------------ ## +_ASBOX + ) | + sed "s/^/$as_me: WARNING: /" >&2 + ;; + no:yes ) + { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 +echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 +echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 +echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} + ( + cat <<\_ASBOX +## ------------------------------------ ## +## Report this to bug-autoconf@gnu.org. ## +## ------------------------------------ ## +_ASBOX + ) | + sed "s/^/$as_me: WARNING: /" >&2 + ;; +esac +echo "$as_me:$LINENO: checking for $ac_header" >&5 +echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + eval "$as_ac_Header=$ac_header_preproc" +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 + +fi +if test `eval echo '${'$as_ac_Header'}'` = yes; then + cat >>confdefs.h <<_ACEOF +#define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 +_ACEOF + +fi + +done + + +# This is for Linux + +for ac_header in bsd/sgtty.h +do +as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh` +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo "$as_me:$LINENO: checking for $ac_header" >&5 +echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 +else + # Is the header compilable? +echo "$as_me:$LINENO: checking $ac_header usability" >&5 +echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6 +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +$ac_includes_default +#include <$ac_header> +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_header_compiler=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_header_compiler=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext +echo "$as_me:$LINENO: result: $ac_header_compiler" >&5 +echo "${ECHO_T}$ac_header_compiler" >&6 + +# Is the header present? +echo "$as_me:$LINENO: checking $ac_header presence" >&5 +echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6 +cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include <$ac_header> +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + ac_header_preproc=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + ac_header_preproc=no +fi +rm -f conftest.err conftest.$ac_ext +echo "$as_me:$LINENO: result: $ac_header_preproc" >&5 +echo "${ECHO_T}$ac_header_preproc" >&6 + +# So? What about this header? +case $ac_header_compiler:$ac_header_preproc in + yes:no ) + { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5 +echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 +echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} + ( + cat <<\_ASBOX +## ------------------------------------ ## +## Report this to bug-autoconf@gnu.org. ## +## ------------------------------------ ## +_ASBOX + ) | + sed "s/^/$as_me: WARNING: /" >&2 + ;; + no:yes ) + { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5 +echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5 +echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;} + { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5 +echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;} + ( + cat <<\_ASBOX +## ------------------------------------ ## +## Report this to bug-autoconf@gnu.org. ## +## ------------------------------------ ## +_ASBOX + ) | + sed "s/^/$as_me: WARNING: /" >&2 + ;; +esac +echo "$as_me:$LINENO: checking for $ac_header" >&5 +echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6 +if eval "test \"\${$as_ac_Header+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + eval "$as_ac_Header=$ac_header_preproc" +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_Header'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_Header'}'`" >&6 + +fi +if test `eval echo '${'$as_ac_Header'}'` = yes; then + cat >>confdefs.h <<_ACEOF +#define `echo "HAVE_$ac_header" | $as_tr_cpp` 1 +_ACEOF + +fi + +done + + +# Some systems want both sys/ioctl.h and sys/termios.h, but others can +# only have one -- check for that + +echo "$as_me:$LINENO: checking whether sys/termios.h and sys/ioctl.h should both be included" >&5 +echo $ECHO_N "checking whether sys/termios.h and sys/ioctl.h should both be included... $ECHO_C" >&6 + +if test "${ac_cv_ioctl_with_termios+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +#include +#include + +_ACEOF +if { (eval echo "$as_me:$LINENO: \"$ac_cpp conftest.$ac_ext\"") >&5 + (eval $ac_cpp conftest.$ac_ext) 2>conftest.er1 + ac_status=$? + grep -v '^ *+' conftest.er1 >conftest.err + rm -f conftest.er1 + cat conftest.err >&5 + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } >/dev/null; then + if test -s conftest.err; then + ac_cpp_err=$ac_c_preproc_warn_flag + else + ac_cpp_err= + fi +else + ac_cpp_err=yes +fi +if test -z "$ac_cpp_err"; then + ac_cv_ioctl_with_termios=1 +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + + ac_cv_ioctl_with_termios=0 +fi +rm -f conftest.err conftest.$ac_ext +fi + +if test $ac_cv_ioctl_with_termios = 1 ; then + echo "$as_me:$LINENO: result: yes" >&5 +echo "${ECHO_T}yes" >&6 ; cat >>confdefs.h <<\_ACEOF +#define IOCTL_WITH_TERMIOS 1 +_ACEOF + +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +# cmdFile.c wants to be able to use TIOCGETC to do file completion, +# but some systems (e.g., HPUX) don't have this +# + +echo "$as_me:$LINENO: checking for TIOCGETC" >&5 +echo $ECHO_N "checking for TIOCGETC... $ECHO_C" >&6 + +if test "${ac_cv_have_ioctl_with_tiocgetc+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test $ac_cv_ioctl_with_termios = 1 ; then + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include +#ifdef TIOCGETC + yes +#endif +_ACEOF +if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | + $EGREP "yes" >/dev/null 2>&1; then + ac_cv_have_ioctl_with_tiocgetc=yes +else + ac_cv_have_ioctl_with_tiocgetc=no +fi +rm -f conftest* + +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#ifdef TIOCGETC + yes +#endif +_ACEOF +if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | + $EGREP "yes" >/dev/null 2>&1; then + ac_cv_have_ioctl_with_tiocgetc=yes +else + ac_cv_have_ioctl_with_tiocgetc=no +fi +rm -f conftest* + +fi +fi + +if test $ac_cv_have_ioctl_with_tiocgetc = "yes" ; then + echo "$as_me:$LINENO: result: yes" >&5 +echo "${ECHO_T}yes" >&6 ; cat >>confdefs.h <<\_ACEOF +#define HAVE_IOCTL_WITH_TIOCGETC 1 +_ACEOF + +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + +# # cmdFile.c wants to turn off interrupts, but some systems don't +# # seem to know how to do that using TIOCLBIS +# # +# # This is probably fairly fragile, and it's probably cmdFile.c that should +# # be fixed +# # +# # This has been very unreliable (e.g., on Solaris), so the facility has +# # been turned off +# +# if test $ac_cv_have_ioctl_with_tiocgetc = "yes" ; then +# +# AC_MSG_CHECKING(for TIOCLBIS) +# +# AC_CACHE_VAL(ac_cv_have_term_interrupts, +# [AC_EGREP_CPP(yes, +# [#include +# #include +# #ifdef TIOCLBIS +# yes +# #endif +# ], ac_cv_have_term_interrupts=1, +# ac_cv_have_term_interrupts=0 )]) +# +# if test $ac_cv_have_term_interrupts = 1 ; then +# AC_MSG_RESULT(yes) ; AC_DEFINE(HAVE_TERM_INTERRUPTS) +# else +# AC_MSG_RESULT(no) +# fi +# +# fi # ac_cv_have_ioctl_with_tiocgetc + +#---------------------------------------------------------------------- +# Checks for typedefs, structures, and compiler characteristics. +#---------------------------------------------------------------------- + +# Check to see if the compiler understands "const" +# #define it empty otherwise +echo "$as_me:$LINENO: checking for an ANSI C-conforming const" >&5 +echo $ECHO_N "checking for an ANSI C-conforming const... $ECHO_C" >&6 +if test "${ac_cv_c_const+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ +/* FIXME: Include the comments suggested by Paul. */ +#ifndef __cplusplus + /* Ultrix mips cc rejects this. */ + typedef int charset[2]; + const charset x; + /* SunOS 4.1.1 cc rejects this. */ + char const *const *ccp; + char **p; + /* NEC SVR4.0.2 mips cc rejects this. */ + struct point {int x, y;}; + static struct point const zero = {0,0}; + /* AIX XL C 1.02.0.0 rejects this. + It does not let you subtract one const X* pointer from another in + an arm of an if-expression whose if-part is not a constant + expression */ + const char *g = "string"; + ccp = &g + (g ? g-g : 0); + /* HPUX 7.0 cc rejects these. */ + ++ccp; + p = (char**) ccp; + ccp = (char const *const *) p; + { /* SCO 3.2v4 cc rejects this. */ + char *t; + char const *s = 0 ? (char *) 0 : (char const *) 0; + + *t++ = 0; + } + { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */ + int x[] = {25, 17}; + const int *foo = &x[0]; + ++foo; + } + { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */ + typedef const int *iptr; + iptr p = 0; + ++p; + } + { /* AIX XL C 1.02.0.0 rejects this saying + "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */ + struct s { int j; const int *ap[3]; }; + struct s *b; b->j = 5; + } + { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */ + const int foo = 10; + } +#endif + + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_c_const=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_c_const=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_c_const" >&5 +echo "${ECHO_T}$ac_cv_c_const" >&6 +if test $ac_cv_c_const = no; then + +cat >>confdefs.h <<\_ACEOF +#define const +_ACEOF + +fi + + +# Sort out "time.h" nonsense +echo "$as_me:$LINENO: checking whether time.h and sys/time.h may both be included" >&5 +echo $ECHO_N "checking whether time.h and sys/time.h may both be included... $ECHO_C" >&6 +if test "${ac_cv_header_time+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include +#include + +int +main () +{ +if ((struct tm *) 0) +return 0; + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_header_time=yes +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_header_time=no +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_header_time" >&5 +echo "${ECHO_T}$ac_cv_header_time" >&6 +if test $ac_cv_header_time = yes; then + +cat >>confdefs.h <<\_ACEOF +#define TIME_WITH_SYS_TIME 1 +_ACEOF + +fi + + +echo "$as_me:$LINENO: checking whether struct tm is in sys/time.h or time.h" >&5 +echo $ECHO_N "checking whether struct tm is in sys/time.h or time.h... $ECHO_C" >&6 +if test "${ac_cv_struct_tm+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include + +int +main () +{ +struct tm *tp; tp->tm_sec; + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_struct_tm=time.h +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_struct_tm=sys/time.h +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_struct_tm" >&5 +echo "${ECHO_T}$ac_cv_struct_tm" >&6 +if test $ac_cv_struct_tm = sys/time.h; then + +cat >>confdefs.h <<\_ACEOF +#define TM_IN_SYS_TIME 1 +_ACEOF + +fi + + +# Set RETSIGTYPE to the proper return type for a signal handler (void or int) +echo "$as_me:$LINENO: checking return type of signal handlers" >&5 +echo $ECHO_N "checking return type of signal handlers... $ECHO_C" >&6 +if test "${ac_cv_type_signal+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include +#ifdef signal +# undef signal +#endif +#ifdef __cplusplus +extern "C" void (*signal (int, void (*)(int)))(int); +#else +void (*signal ()) (); +#endif + +int +main () +{ +int i; + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_type_signal=void +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_type_signal=int +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_type_signal" >&5 +echo "${ECHO_T}$ac_cv_type_signal" >&6 + +cat >>confdefs.h <<_ACEOF +#define RETSIGTYPE $ac_cv_type_signal +_ACEOF + + + +# Roderick Bloem (rbloem@colorado.edu) : On Irix we need ttold +case "$target" in + mips-sgi-irix*) + cat >>confdefs.h <<\_ACEOF +#define NEED_TTOLD 1 +_ACEOF +;; +esac + +#---------------------------------------------------------------------- +# Checks for library functions. +#---------------------------------------------------------------------- + +if test $ac_cv_c_compiler_gnu = yes; then + echo "$as_me:$LINENO: checking whether $CC needs -traditional" >&5 +echo $ECHO_N "checking whether $CC needs -traditional... $ECHO_C" >&6 +if test "${ac_cv_prog_gcc_traditional+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + ac_pattern="Autoconf.*'x'" + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +Autoconf TIOCGETP +_ACEOF +if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | + $EGREP "$ac_pattern" >/dev/null 2>&1; then + ac_cv_prog_gcc_traditional=yes +else + ac_cv_prog_gcc_traditional=no +fi +rm -f conftest* + + + if test $ac_cv_prog_gcc_traditional = no; then + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +Autoconf TCGETA +_ACEOF +if (eval "$ac_cpp conftest.$ac_ext") 2>&5 | + $EGREP "$ac_pattern" >/dev/null 2>&1; then + ac_cv_prog_gcc_traditional=yes +fi +rm -f conftest* + + fi +fi +echo "$as_me:$LINENO: result: $ac_cv_prog_gcc_traditional" >&5 +echo "${ECHO_T}$ac_cv_prog_gcc_traditional" >&6 + if test $ac_cv_prog_gcc_traditional = yes; then + CC="$CC -traditional" + fi +fi + +echo "$as_me:$LINENO: checking for working memcmp" >&5 +echo $ECHO_N "checking for working memcmp... $ECHO_C" >&6 +if test "${ac_cv_func_memcmp_working+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test "$cross_compiling" = yes; then + ac_cv_func_memcmp_working=no +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ + +int +main () +{ + + /* Some versions of memcmp are not 8-bit clean. */ + char c0 = 0x40, c1 = 0x80, c2 = 0x81; + if (memcmp(&c0, &c2, 1) >= 0 || memcmp(&c1, &c2, 1) >= 0) + exit (1); + + /* The Next x86 OpenStep bug shows up only when comparing 16 bytes + or more and with at least one buffer not starting on a 4-byte boundary. + William Lewis provided this test program. */ + { + char foo[21]; + char bar[21]; + int i; + for (i = 0; i < 4; i++) + { + char *a = foo + i; + char *b = bar + i; + strcpy (a, "--------01111111"); + strcpy (b, "--------10000000"); + if (memcmp (a, b, 16) >= 0) + exit (1); + } + exit (0); + } + + ; + return 0; +} +_ACEOF +rm -f conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && { ac_try='./conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_func_memcmp_working=yes +else + echo "$as_me: program exited with status $ac_status" >&5 +echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +( exit $ac_status ) +ac_cv_func_memcmp_working=no +fi +rm -f core core.* *.core gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext +fi +fi +echo "$as_me:$LINENO: result: $ac_cv_func_memcmp_working" >&5 +echo "${ECHO_T}$ac_cv_func_memcmp_working" >&6 +test $ac_cv_func_memcmp_working = no && LIBOBJS="$LIBOBJS memcmp.$ac_objext" + +echo "$as_me:$LINENO: checking return type of signal handlers" >&5 +echo $ECHO_N "checking return type of signal handlers... $ECHO_C" >&6 +if test "${ac_cv_type_signal+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +#include +#include +#ifdef signal +# undef signal +#endif +#ifdef __cplusplus +extern "C" void (*signal (int, void (*)(int)))(int); +#else +void (*signal ()) (); +#endif + +int +main () +{ +int i; + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext +if { (eval echo "$as_me:$LINENO: \"$ac_compile\"") >&5 + (eval $ac_compile) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest.$ac_objext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + ac_cv_type_signal=void +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +ac_cv_type_signal=int +fi +rm -f conftest.$ac_objext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: $ac_cv_type_signal" >&5 +echo "${ECHO_T}$ac_cv_type_signal" >&6 + +cat >>confdefs.h <<_ACEOF +#define RETSIGTYPE $ac_cv_type_signal +_ACEOF + + + + + + + + + + +for ac_func in gettimeofday strchr strstr setvbuf getenv unlink mkstemp close +do +as_ac_var=`echo "ac_cv_func_$ac_func" | $as_tr_sh` +echo "$as_me:$LINENO: checking for $ac_func" >&5 +echo $ECHO_N "checking for $ac_func... $ECHO_C" >&6 +if eval "test \"\${$as_ac_var+set}\" = set"; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + cat >conftest.$ac_ext <<_ACEOF +#line $LINENO "configure" +/* confdefs.h. */ +_ACEOF +cat confdefs.h >>conftest.$ac_ext +cat >>conftest.$ac_ext <<_ACEOF +/* end confdefs.h. */ +/* System header to define __stub macros and hopefully few prototypes, + which can conflict with char $ac_func (); below. + Prefer to if __STDC__ is defined, since + exists even on freestanding compilers. */ +#ifdef __STDC__ +# include +#else +# include +#endif +/* Override any gcc2 internal prototype to avoid an error. */ +#ifdef __cplusplus +extern "C" +{ +#endif +/* We use char because int might match the return type of a gcc2 + builtin and then its argument prototype would still apply. */ +char $ac_func (); +/* The GNU C library defines this for functions which it implements + to always fail with ENOSYS. Some functions are actually named + something starting with __ and the normal name is an alias. */ +#if defined (__stub_$ac_func) || defined (__stub___$ac_func) +choke me +#else +char (*f) () = $ac_func; +#endif +#ifdef __cplusplus +} +#endif + +int +main () +{ +return f != $ac_func; + ; + return 0; +} +_ACEOF +rm -f conftest.$ac_objext conftest$ac_exeext +if { (eval echo "$as_me:$LINENO: \"$ac_link\"") >&5 + (eval $ac_link) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); } && + { ac_try='test -s conftest$ac_exeext' + { (eval echo "$as_me:$LINENO: \"$ac_try\"") >&5 + (eval $ac_try) 2>&5 + ac_status=$? + echo "$as_me:$LINENO: \$? = $ac_status" >&5 + (exit $ac_status); }; }; then + eval "$as_ac_var=yes" +else + echo "$as_me: failed program was:" >&5 +sed 's/^/| /' conftest.$ac_ext >&5 + +eval "$as_ac_var=no" +fi +rm -f conftest.$ac_objext conftest$ac_exeext conftest.$ac_ext +fi +echo "$as_me:$LINENO: result: `eval echo '${'$as_ac_var'}'`" >&5 +echo "${ECHO_T}`eval echo '${'$as_ac_var'}'`" >&6 +if test `eval echo '${'$as_ac_var'}'` = yes; then + cat >>confdefs.h <<_ACEOF +#define `echo "HAVE_$ac_func" | $as_tr_cpp` 1 +_ACEOF + +fi +done + + +#----------------------------------------------------------------------- +# Check for mawk, gawk, nawk, awk in that order +#----------------------------------------------------------------------- +for ac_prog in gawk mawk nawk awk +do + # Extract the first word of "$ac_prog", so it can be a program name with args. +set dummy $ac_prog; ac_word=$2 +echo "$as_me:$LINENO: checking for $ac_word" >&5 +echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6 +if test "${ac_cv_prog_AWK+set}" = set; then + echo $ECHO_N "(cached) $ECHO_C" >&6 +else + if test -n "$AWK"; then + ac_cv_prog_AWK="$AWK" # Let the user override the test. +else +as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for ac_exec_ext in '' $ac_executable_extensions; do + if $as_executable_p "$as_dir/$ac_word$ac_exec_ext"; then + ac_cv_prog_AWK="$ac_prog" + echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5 + break 2 + fi +done +done + +fi +fi +AWK=$ac_cv_prog_AWK +if test -n "$AWK"; then + echo "$as_me:$LINENO: result: $AWK" >&5 +echo "${ECHO_T}$AWK" >&6 +else + echo "$as_me:$LINENO: result: no" >&5 +echo "${ECHO_T}no" >&6 +fi + + test -n "$AWK" && break +done + + +#---------------------------------------------------------------------- +# Create the Makefile from Makefile.in +#---------------------------------------------------------------------- +if test "$gcc_ok" = "g++"; then + CC=$gcc_ok +fi + ac_config_files="$ac_config_files Makefile" +cat >confcache <<\_ACEOF +# This file is a shell script that caches the results of configure +# tests run on this system so they can be shared between configure +# scripts and configure runs, see configure's option --config-cache. +# It is not useful on other systems. If it contains results you don't +# want to keep, you may remove or edit it. +# +# config.status only pays attention to the cache file if you give it +# the --recheck option to rerun configure. +# +# `ac_cv_env_foo' variables (set or unset) will be overridden when +# loading this file, other *unset* `ac_cv_foo' will be assigned the +# following values. + +_ACEOF + +# The following way of writing the cache mishandles newlines in values, +# but we know of no workaround that is simple, portable, and efficient. +# So, don't put newlines in cache variables' values. +# Ultrix sh set writes to stderr and can't be redirected directly, +# and sets the high bit in the cache file unless we assign to the vars. +{ + (set) 2>&1 | + case `(ac_space=' '; set | grep ac_space) 2>&1` in + *ac_space=\ *) + # `set' does not quote correctly, so add quotes (double-quote + # substitution turns \\\\ into \\, and sed turns \\ into \). + sed -n \ + "s/'/'\\\\''/g; + s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p" + ;; + *) + # `set' quotes correctly as required by POSIX, so do not add quotes. + sed -n \ + "s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1=\\2/p" + ;; + esac; +} | + sed ' + t clear + : clear + s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/ + t end + /^ac_cv_env/!s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/ + : end' >>confcache +if diff $cache_file confcache >/dev/null 2>&1; then :; else + if test -w $cache_file; then + test "x$cache_file" != "x/dev/null" && echo "updating cache $cache_file" + cat confcache >$cache_file + else + echo "not updating unwritable cache $cache_file" + fi +fi +rm -f confcache + +test "x$prefix" = xNONE && prefix=$ac_default_prefix +# Let make expand exec_prefix. +test "x$exec_prefix" = xNONE && exec_prefix='${prefix}' + +# VPATH may cause trouble with some makes, so we remove $(srcdir), +# ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and +# trailing colons and then remove the whole line if VPATH becomes empty +# (actually we leave an empty line to preserve line numbers). +if test "x$srcdir" = x.; then + ac_vpsub='/^[ ]*VPATH[ ]*=/{ +s/:*\$(srcdir):*/:/; +s/:*\${srcdir}:*/:/; +s/:*@srcdir@:*/:/; +s/^\([^=]*=[ ]*\):*/\1/; +s/:*$//; +s/^[^=]*=[ ]*$//; +}' +fi + +# Transform confdefs.h into DEFS. +# Protect against shell expansion while executing Makefile rules. +# Protect against Makefile macro expansion. +# +# If the first sed substitution is executed (which looks for macros that +# take arguments), then we branch to the quote section. Otherwise, +# look for a macro that doesn't take arguments. +cat >confdef2opt.sed <<\_ACEOF +t clear +: clear +s,^[ ]*#[ ]*define[ ][ ]*\([^ (][^ (]*([^)]*)\)[ ]*\(.*\),-D\1=\2,g +t quote +s,^[ ]*#[ ]*define[ ][ ]*\([^ ][^ ]*\)[ ]*\(.*\),-D\1=\2,g +t quote +d +: quote +s,[ `~#$^&*(){}\\|;'"<>?],\\&,g +s,\[,\\&,g +s,\],\\&,g +s,\$,$$,g +p +_ACEOF +# We use echo to avoid assuming a particular line-breaking character. +# The extra dot is to prevent the shell from consuming trailing +# line-breaks from the sub-command output. A line-break within +# single-quotes doesn't work because, if this script is created in a +# platform that uses two characters for line-breaks (e.g., DOS), tr +# would break. +ac_LF_and_DOT=`echo; echo .` +DEFS=`sed -n -f confdef2opt.sed confdefs.h | tr "$ac_LF_and_DOT" ' .'` +rm -f confdef2opt.sed + + +ac_libobjs= +ac_ltlibobjs= +for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue + # 1. Remove the extension, and $U if already installed. + ac_i=`echo "$ac_i" | + sed 's/\$U\././;s/\.o$//;s/\.obj$//'` + # 2. Add them. + ac_libobjs="$ac_libobjs $ac_i\$U.$ac_objext" + ac_ltlibobjs="$ac_ltlibobjs $ac_i"'$U.lo' +done +LIBOBJS=$ac_libobjs + +LTLIBOBJS=$ac_ltlibobjs + + + +: ${CONFIG_STATUS=./config.status} +ac_clean_files_save=$ac_clean_files +ac_clean_files="$ac_clean_files $CONFIG_STATUS" +{ echo "$as_me:$LINENO: creating $CONFIG_STATUS" >&5 +echo "$as_me: creating $CONFIG_STATUS" >&6;} +cat >$CONFIG_STATUS <<_ACEOF +#! $SHELL +# Generated by $as_me. +# Run this file to recreate the current configuration. +# Compiler output produced by configure, useful for debugging +# configure, is in config.log if it exists. + +debug=false +ac_cs_recheck=false +ac_cs_silent=false +SHELL=\${CONFIG_SHELL-$SHELL} +_ACEOF + +cat >>$CONFIG_STATUS <<\_ACEOF +## --------------------- ## +## M4sh Initialization. ## +## --------------------- ## + +# Be Bourne compatible +if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then + emulate sh + NULLCMD=: + # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which + # is contrary to our usage. Disable this feature. + alias -g '${1+"$@"}'='"$@"' +elif test -n "${BASH_VERSION+set}" && (set -o posix) >/dev/null 2>&1; then + set -o posix +fi + +# Support unset when possible. +if (FOO=FOO; unset FOO) >/dev/null 2>&1; then + as_unset=unset +else + as_unset=false +fi + + +# Work around bugs in pre-3.0 UWIN ksh. +$as_unset ENV MAIL MAILPATH +PS1='$ ' +PS2='> ' +PS4='+ ' + +# NLS nuisances. +for as_var in \ + LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \ + LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \ + LC_TELEPHONE LC_TIME +do + if (set +x; test -n "`(eval $as_var=C; export $as_var) 2>&1`"); then + eval $as_var=C; export $as_var + else + $as_unset $as_var + fi +done + +# Required to use basename. +if expr a : '\(a\)' >/dev/null 2>&1; then + as_expr=expr +else + as_expr=false +fi + +if (basename /) >/dev/null 2>&1 && test "X`basename / 2>&1`" = "X/"; then + as_basename=basename +else + as_basename=false +fi + + +# Name of the executable. +as_me=`$as_basename "$0" || +$as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \ + X"$0" : 'X\(//\)$' \| \ + X"$0" : 'X\(/\)$' \| \ + . : '\(.\)' 2>/dev/null || +echo X/"$0" | + sed '/^.*\/\([^/][^/]*\)\/*$/{ s//\1/; q; } + /^X\/\(\/\/\)$/{ s//\1/; q; } + /^X\/\(\/\).*/{ s//\1/; q; } + s/.*/./; q'` + + +# PATH needs CR, and LINENO needs CR and PATH. +# Avoid depending upon Character Ranges. +as_cr_letters='abcdefghijklmnopqrstuvwxyz' +as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ' +as_cr_Letters=$as_cr_letters$as_cr_LETTERS +as_cr_digits='0123456789' +as_cr_alnum=$as_cr_Letters$as_cr_digits + +# The user is always right. +if test "${PATH_SEPARATOR+set}" != set; then + echo "#! /bin/sh" >conf$$.sh + echo "exit 0" >>conf$$.sh + chmod +x conf$$.sh + if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then + PATH_SEPARATOR=';' + else + PATH_SEPARATOR=: + fi + rm -f conf$$.sh +fi + + + as_lineno_1=$LINENO + as_lineno_2=$LINENO + as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` + test "x$as_lineno_1" != "x$as_lineno_2" && + test "x$as_lineno_3" = "x$as_lineno_2" || { + # Find who we are. Look in the path if we contain no path at all + # relative or not. + case $0 in + *[\\/]* ) as_myself=$0 ;; + *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in $PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break +done + + ;; + esac + # We did not find ourselves, most probably we were run as `sh COMMAND' + # in which case we are not to be found in the path. + if test "x$as_myself" = x; then + as_myself=$0 + fi + if test ! -f "$as_myself"; then + { { echo "$as_me:$LINENO: error: cannot find myself; rerun with an absolute path" >&5 +echo "$as_me: error: cannot find myself; rerun with an absolute path" >&2;} + { (exit 1); exit 1; }; } + fi + case $CONFIG_SHELL in + '') + as_save_IFS=$IFS; IFS=$PATH_SEPARATOR +for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH +do + IFS=$as_save_IFS + test -z "$as_dir" && as_dir=. + for as_base in sh bash ksh sh5; do + case $as_dir in + /*) + if ("$as_dir/$as_base" -c ' + as_lineno_1=$LINENO + as_lineno_2=$LINENO + as_lineno_3=`(expr $as_lineno_1 + 1) 2>/dev/null` + test "x$as_lineno_1" != "x$as_lineno_2" && + test "x$as_lineno_3" = "x$as_lineno_2" ') 2>/dev/null; then + $as_unset BASH_ENV || test "${BASH_ENV+set}" != set || { BASH_ENV=; export BASH_ENV; } + $as_unset ENV || test "${ENV+set}" != set || { ENV=; export ENV; } + CONFIG_SHELL=$as_dir/$as_base + export CONFIG_SHELL + exec "$CONFIG_SHELL" "$0" ${1+"$@"} + fi;; + esac + done +done +;; + esac + + # Create $as_me.lineno as a copy of $as_myself, but with $LINENO + # uniformly replaced by the line number. The first 'sed' inserts a + # line-number line before each line; the second 'sed' does the real + # work. The second script uses 'N' to pair each line-number line + # with the numbered line, and appends trailing '-' during + # substitution so that $LINENO is not a special case at line end. + # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the + # second 'sed' script. Blame Lee E. McMahon for sed's syntax. :-) + sed '=' <$as_myself | + sed ' + N + s,$,-, + : loop + s,^\(['$as_cr_digits']*\)\(.*\)[$]LINENO\([^'$as_cr_alnum'_]\),\1\2\1\3, + t loop + s,-$,, + s,^['$as_cr_digits']*\n,, + ' >$as_me.lineno && + chmod +x $as_me.lineno || + { { echo "$as_me:$LINENO: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&5 +echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2;} + { (exit 1); exit 1; }; } + + # Don't try to exec as it changes $[0], causing all sort of problems + # (the dirname of $[0] is not the place where we might find the + # original and so on. Autoconf is especially sensible to this). + . ./$as_me.lineno + # Exit status is that of the last command. + exit +} + + +case `echo "testing\c"; echo 1,2,3`,`echo -n testing; echo 1,2,3` in + *c*,-n*) ECHO_N= ECHO_C=' +' ECHO_T=' ' ;; + *c*,* ) ECHO_N=-n ECHO_C= ECHO_T= ;; + *) ECHO_N= ECHO_C='\c' ECHO_T= ;; +esac + +if expr a : '\(a\)' >/dev/null 2>&1; then + as_expr=expr +else + as_expr=false +fi + +rm -f conf$$ conf$$.exe conf$$.file +echo >conf$$.file +if ln -s conf$$.file conf$$ 2>/dev/null; then + # We could just check for DJGPP; but this test a) works b) is more generic + # and c) will remain valid once DJGPP supports symlinks (DJGPP 2.04). + if test -f conf$$.exe; then + # Don't use ln at all; we don't have any links + as_ln_s='cp -p' + else + as_ln_s='ln -s' + fi +elif ln conf$$.file conf$$ 2>/dev/null; then + as_ln_s=ln +else + as_ln_s='cp -p' +fi +rm -f conf$$ conf$$.exe conf$$.file + +if mkdir -p . 2>/dev/null; then + as_mkdir_p=: +else + as_mkdir_p=false +fi + +as_executable_p="test -f" + +# Sed expression to map a string onto a valid CPP name. +as_tr_cpp="sed y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g" + +# Sed expression to map a string onto a valid variable name. +as_tr_sh="sed y%*+%pp%;s%[^_$as_cr_alnum]%_%g" + + +# IFS +# We need space, tab and new line, in precisely that order. +as_nl=' +' +IFS=" $as_nl" + +# CDPATH. +$as_unset CDPATH + +exec 6>&1 + +# Open the log real soon, to keep \$[0] and so on meaningful, and to +# report actual input values of CONFIG_FILES etc. instead of their +# values after options handling. Logging --version etc. is OK. +exec 5>>config.log +{ + echo + sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX +## Running $as_me. ## +_ASBOX +} >&5 +cat >&5 <<_CSEOF + +This file was extended by $as_me, which was +generated by GNU Autoconf 2.57. Invocation command line was + + CONFIG_FILES = $CONFIG_FILES + CONFIG_HEADERS = $CONFIG_HEADERS + CONFIG_LINKS = $CONFIG_LINKS + CONFIG_COMMANDS = $CONFIG_COMMANDS + $ $0 $@ + +_CSEOF +echo "on `(hostname || uname -n) 2>/dev/null | sed 1q`" >&5 +echo >&5 +_ACEOF + +# Files that config.status was made for. +if test -n "$ac_config_files"; then + echo "config_files=\"$ac_config_files\"" >>$CONFIG_STATUS +fi + +if test -n "$ac_config_headers"; then + echo "config_headers=\"$ac_config_headers\"" >>$CONFIG_STATUS +fi + +if test -n "$ac_config_links"; then + echo "config_links=\"$ac_config_links\"" >>$CONFIG_STATUS +fi + +if test -n "$ac_config_commands"; then + echo "config_commands=\"$ac_config_commands\"" >>$CONFIG_STATUS +fi + +cat >>$CONFIG_STATUS <<\_ACEOF + +ac_cs_usage="\ +\`$as_me' instantiates files from templates according to the +current configuration. + +Usage: $0 [OPTIONS] [FILE]... + + -h, --help print this help, then exit + -V, --version print version number, then exit + -q, --quiet do not print progress messages + -d, --debug don't remove temporary files + --recheck update $as_me by reconfiguring in the same conditions + --file=FILE[:TEMPLATE] + instantiate the configuration file FILE + +Configuration files: +$config_files + +Report bugs to ." +_ACEOF + +cat >>$CONFIG_STATUS <<_ACEOF +ac_cs_version="\\ +config.status +configured by $0, generated by GNU Autoconf 2.57, + with options \\"`echo "$ac_configure_args" | sed 's/[\\""\`\$]/\\\\&/g'`\\" + +Copyright 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001 +Free Software Foundation, Inc. +This config.status script is free software; the Free Software Foundation +gives unlimited permission to copy, distribute and modify it." +srcdir=$srcdir +INSTALL="$INSTALL" +_ACEOF + +cat >>$CONFIG_STATUS <<\_ACEOF +# If no file are specified by the user, then we need to provide default +# value. By we need to know if files were specified by the user. +ac_need_defaults=: +while test $# != 0 +do + case $1 in + --*=*) + ac_option=`expr "x$1" : 'x\([^=]*\)='` + ac_optarg=`expr "x$1" : 'x[^=]*=\(.*\)'` + ac_shift=: + ;; + -*) + ac_option=$1 + ac_optarg=$2 + ac_shift=shift + ;; + *) # This is not an option, so the user has probably given explicit + # arguments. + ac_option=$1 + ac_need_defaults=false;; + esac + + case $ac_option in + # Handling of the options. +_ACEOF +cat >>$CONFIG_STATUS <<\_ACEOF + -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r) + ac_cs_recheck=: ;; + --version | --vers* | -V ) + echo "$ac_cs_version"; exit 0 ;; + --he | --h) + # Conflict between --help and --header + { { echo "$as_me:$LINENO: error: ambiguous option: $1 +Try \`$0 --help' for more information." >&5 +echo "$as_me: error: ambiguous option: $1 +Try \`$0 --help' for more information." >&2;} + { (exit 1); exit 1; }; };; + --help | --hel | -h ) + echo "$ac_cs_usage"; exit 0 ;; + --debug | --d* | -d ) + debug=: ;; + --file | --fil | --fi | --f ) + $ac_shift + CONFIG_FILES="$CONFIG_FILES $ac_optarg" + ac_need_defaults=false;; + --header | --heade | --head | --hea ) + $ac_shift + CONFIG_HEADERS="$CONFIG_HEADERS $ac_optarg" + ac_need_defaults=false;; + -q | -quiet | --quiet | --quie | --qui | --qu | --q \ + | -silent | --silent | --silen | --sile | --sil | --si | --s) + ac_cs_silent=: ;; + + # This is an error. + -*) { { echo "$as_me:$LINENO: error: unrecognized option: $1 +Try \`$0 --help' for more information." >&5 +echo "$as_me: error: unrecognized option: $1 +Try \`$0 --help' for more information." >&2;} + { (exit 1); exit 1; }; } ;; + + *) ac_config_targets="$ac_config_targets $1" ;; + + esac + shift +done + +ac_configure_extra_args= + +if $ac_cs_silent; then + exec 6>/dev/null + ac_configure_extra_args="$ac_configure_extra_args --silent" +fi + +_ACEOF +cat >>$CONFIG_STATUS <<_ACEOF +if \$ac_cs_recheck; then + echo "running $SHELL $0 " $ac_configure_args \$ac_configure_extra_args " --no-create --no-recursion" >&6 + exec $SHELL $0 $ac_configure_args \$ac_configure_extra_args --no-create --no-recursion +fi + +_ACEOF + + + + + +cat >>$CONFIG_STATUS <<\_ACEOF +for ac_config_target in $ac_config_targets +do + case "$ac_config_target" in + # Handling of arguments. + "Makefile" ) CONFIG_FILES="$CONFIG_FILES Makefile" ;; + *) { { echo "$as_me:$LINENO: error: invalid argument: $ac_config_target" >&5 +echo "$as_me: error: invalid argument: $ac_config_target" >&2;} + { (exit 1); exit 1; }; };; + esac +done + +# If the user did not use the arguments to specify the items to instantiate, +# then the envvar interface is used. Set only those that are not. +# We use the long form for the default assignment because of an extremely +# bizarre bug on SunOS 4.1.3. +if $ac_need_defaults; then + test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files +fi + +# Have a temporary directory for convenience. Make it in the build tree +# simply because there is no reason to put it here, and in addition, +# creating and moving files from /tmp can sometimes cause problems. +# Create a temporary directory, and hook for its removal unless debugging. +$debug || +{ + trap 'exit_status=$?; rm -rf $tmp && exit $exit_status' 0 + trap '{ (exit 1); exit 1; }' 1 2 13 15 +} + +# Create a (secure) tmp directory for tmp files. + +{ + tmp=`(umask 077 && mktemp -d -q "./confstatXXXXXX") 2>/dev/null` && + test -n "$tmp" && test -d "$tmp" +} || +{ + tmp=./confstat$$-$RANDOM + (umask 077 && mkdir $tmp) +} || +{ + echo "$me: cannot create a temporary directory in ." >&2 + { (exit 1); exit 1; } +} + +_ACEOF + +cat >>$CONFIG_STATUS <<_ACEOF + +# +# CONFIG_FILES section. +# + +# No need to generate the scripts if there are no CONFIG_FILES. +# This happens for instance when ./config.status config.h +if test -n "\$CONFIG_FILES"; then + # Protect against being on the right side of a sed subst in config.status. + sed 's/,@/@@/; s/@,/@@/; s/,;t t\$/@;t t/; /@;t t\$/s/[\\\\&,]/\\\\&/g; + s/@@/,@/; s/@@/@,/; s/@;t t\$/,;t t/' >\$tmp/subs.sed <<\\CEOF +s,@SHELL@,$SHELL,;t t +s,@PATH_SEPARATOR@,$PATH_SEPARATOR,;t t +s,@PACKAGE_NAME@,$PACKAGE_NAME,;t t +s,@PACKAGE_TARNAME@,$PACKAGE_TARNAME,;t t +s,@PACKAGE_VERSION@,$PACKAGE_VERSION,;t t +s,@PACKAGE_STRING@,$PACKAGE_STRING,;t t +s,@PACKAGE_BUGREPORT@,$PACKAGE_BUGREPORT,;t t +s,@exec_prefix@,$exec_prefix,;t t +s,@prefix@,$prefix,;t t +s,@program_transform_name@,$program_transform_name,;t t +s,@bindir@,$bindir,;t t +s,@sbindir@,$sbindir,;t t +s,@libexecdir@,$libexecdir,;t t +s,@datadir@,$datadir,;t t +s,@sysconfdir@,$sysconfdir,;t t +s,@sharedstatedir@,$sharedstatedir,;t t +s,@localstatedir@,$localstatedir,;t t +s,@libdir@,$libdir,;t t +s,@includedir@,$includedir,;t t +s,@oldincludedir@,$oldincludedir,;t t +s,@infodir@,$infodir,;t t +s,@mandir@,$mandir,;t t +s,@build_alias@,$build_alias,;t t +s,@host_alias@,$host_alias,;t t +s,@target_alias@,$target_alias,;t t +s,@DEFS@,$DEFS,;t t +s,@ECHO_C@,$ECHO_C,;t t +s,@ECHO_N@,$ECHO_N,;t t +s,@ECHO_T@,$ECHO_T,;t t +s,@LIBS@,$LIBS,;t t +s,@glulibdir@,$glulibdir,;t t +s,@gluincdir@,$gluincdir,;t t +s,@vislibdir@,$vislibdir,;t t +s,@local_srcdir@,$local_srcdir,;t t +s,@BDDLIB@,$BDDLIB,;t t +s,@ZCHAFF@,$ZCHAFF,;t t +s,@AR@,$AR,;t t +s,@RANLIB@,$RANLIB,;t t +s,@ac_ct_RANLIB@,$ac_ct_RANLIB,;t t +s,@build@,$build,;t t +s,@build_cpu@,$build_cpu,;t t +s,@build_vendor@,$build_vendor,;t t +s,@build_os@,$build_os,;t t +s,@host@,$host,;t t +s,@host_cpu@,$host_cpu,;t t +s,@host_vendor@,$host_vendor,;t t +s,@host_os@,$host_os,;t t +s,@target@,$target,;t t +s,@target_cpu@,$target_cpu,;t t +s,@target_vendor@,$target_vendor,;t t +s,@target_os@,$target_os,;t t +s,@CC@,$CC,;t t +s,@CFLAGS@,$CFLAGS,;t t +s,@LDFLAGS@,$LDFLAGS,;t t +s,@CPPFLAGS@,$CPPFLAGS,;t t +s,@ac_ct_CC@,$ac_ct_CC,;t t +s,@EXEEXT@,$EXEEXT,;t t +s,@OBJEXT@,$OBJEXT,;t t +s,@INSTALL_PROGRAM@,$INSTALL_PROGRAM,;t t +s,@INSTALL_SCRIPT@,$INSTALL_SCRIPT,;t t +s,@INSTALL_DATA@,$INSTALL_DATA,;t t +s,@LINKER@,$LINKER,;t t +s,@PLINKER@,$PLINKER,;t t +s,@LEX@,$LEX,;t t +s,@LEXLIB@,$LEXLIB,;t t +s,@LEX_OUTPUT_ROOT@,$LEX_OUTPUT_ROOT,;t t +s,@YACC@,$YACC,;t t +s,@CPP@,$CPP,;t t +s,@EGREP@,$EGREP,;t t +s,@LIBDIRS@,$LIBDIRS,;t t +s,@LIBOBJS@,$LIBOBJS,;t t +s,@AWK@,$AWK,;t t +s,@LTLIBOBJS@,$LTLIBOBJS,;t t +CEOF + +_ACEOF + + cat >>$CONFIG_STATUS <<\_ACEOF + # Split the substitutions into bite-sized pieces for seds with + # small command number limits, like on Digital OSF/1 and HP-UX. + ac_max_sed_lines=48 + ac_sed_frag=1 # Number of current file. + ac_beg=1 # First line for current file. + ac_end=$ac_max_sed_lines # Line after last line for current file. + ac_more_lines=: + ac_sed_cmds= + while $ac_more_lines; do + if test $ac_beg -gt 1; then + sed "1,${ac_beg}d; ${ac_end}q" $tmp/subs.sed >$tmp/subs.frag + else + sed "${ac_end}q" $tmp/subs.sed >$tmp/subs.frag + fi + if test ! -s $tmp/subs.frag; then + ac_more_lines=false + else + # The purpose of the label and of the branching condition is to + # speed up the sed processing (if there are no `@' at all, there + # is no need to browse any of the substitutions). + # These are the two extra sed commands mentioned above. + (echo ':t + /@[a-zA-Z_][a-zA-Z_0-9]*@/!b' && cat $tmp/subs.frag) >$tmp/subs-$ac_sed_frag.sed + if test -z "$ac_sed_cmds"; then + ac_sed_cmds="sed -f $tmp/subs-$ac_sed_frag.sed" + else + ac_sed_cmds="$ac_sed_cmds | sed -f $tmp/subs-$ac_sed_frag.sed" + fi + ac_sed_frag=`expr $ac_sed_frag + 1` + ac_beg=$ac_end + ac_end=`expr $ac_end + $ac_max_sed_lines` + fi + done + if test -z "$ac_sed_cmds"; then + ac_sed_cmds=cat + fi +fi # test -n "$CONFIG_FILES" + +_ACEOF +cat >>$CONFIG_STATUS <<\_ACEOF +for ac_file in : $CONFIG_FILES; do test "x$ac_file" = x: && continue + # Support "outfile[:infile[:infile...]]", defaulting infile="outfile.in". + case $ac_file in + - | *:- | *:-:* ) # input from stdin + cat >$tmp/stdin + ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` + ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; + *:* ) ac_file_in=`echo "$ac_file" | sed 's,[^:]*:,,'` + ac_file=`echo "$ac_file" | sed 's,:.*,,'` ;; + * ) ac_file_in=$ac_file.in ;; + esac + + # Compute @srcdir@, @top_srcdir@, and @INSTALL@ for subdirectories. + ac_dir=`(dirname "$ac_file") 2>/dev/null || +$as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ + X"$ac_file" : 'X\(//\)[^/]' \| \ + X"$ac_file" : 'X\(//\)$' \| \ + X"$ac_file" : 'X\(/\)' \| \ + . : '\(.\)' 2>/dev/null || +echo X"$ac_file" | + sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } + /^X\(\/\/\)[^/].*/{ s//\1/; q; } + /^X\(\/\/\)$/{ s//\1/; q; } + /^X\(\/\).*/{ s//\1/; q; } + s/.*/./; q'` + { if $as_mkdir_p; then + mkdir -p "$ac_dir" + else + as_dir="$ac_dir" + as_dirs= + while test ! -d "$as_dir"; do + as_dirs="$as_dir $as_dirs" + as_dir=`(dirname "$as_dir") 2>/dev/null || +$as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \ + X"$as_dir" : 'X\(//\)[^/]' \| \ + X"$as_dir" : 'X\(//\)$' \| \ + X"$as_dir" : 'X\(/\)' \| \ + . : '\(.\)' 2>/dev/null || +echo X"$as_dir" | + sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{ s//\1/; q; } + /^X\(\/\/\)[^/].*/{ s//\1/; q; } + /^X\(\/\/\)$/{ s//\1/; q; } + /^X\(\/\).*/{ s//\1/; q; } + s/.*/./; q'` + done + test ! -n "$as_dirs" || mkdir $as_dirs + fi || { { echo "$as_me:$LINENO: error: cannot create directory \"$ac_dir\"" >&5 +echo "$as_me: error: cannot create directory \"$ac_dir\"" >&2;} + { (exit 1); exit 1; }; }; } + + ac_builddir=. + +if test "$ac_dir" != .; then + ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'` + # A "../" for each directory in $ac_dir_suffix. + ac_top_builddir=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,../,g'` +else + ac_dir_suffix= ac_top_builddir= +fi + +case $srcdir in + .) # No --srcdir option. We are building in place. + ac_srcdir=. + if test -z "$ac_top_builddir"; then + ac_top_srcdir=. + else + ac_top_srcdir=`echo $ac_top_builddir | sed 's,/$,,'` + fi ;; + [\\/]* | ?:[\\/]* ) # Absolute path. + ac_srcdir=$srcdir$ac_dir_suffix; + ac_top_srcdir=$srcdir ;; + *) # Relative path. + ac_srcdir=$ac_top_builddir$srcdir$ac_dir_suffix + ac_top_srcdir=$ac_top_builddir$srcdir ;; +esac +# Don't blindly perform a `cd "$ac_dir"/$ac_foo && pwd` since $ac_foo can be +# absolute. +ac_abs_builddir=`cd "$ac_dir" && cd $ac_builddir && pwd` +ac_abs_top_builddir=`cd "$ac_dir" && cd ${ac_top_builddir}. && pwd` +ac_abs_srcdir=`cd "$ac_dir" && cd $ac_srcdir && pwd` +ac_abs_top_srcdir=`cd "$ac_dir" && cd $ac_top_srcdir && pwd` + + + case $INSTALL in + [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;; + *) ac_INSTALL=$ac_top_builddir$INSTALL ;; + esac + + if test x"$ac_file" != x-; then + { echo "$as_me:$LINENO: creating $ac_file" >&5 +echo "$as_me: creating $ac_file" >&6;} + rm -f "$ac_file" + fi + # Let's still pretend it is `configure' which instantiates (i.e., don't + # use $as_me), people would be surprised to read: + # /* config.h. Generated by config.status. */ + if test x"$ac_file" = x-; then + configure_input= + else + configure_input="$ac_file. " + fi + configure_input=$configure_input"Generated from `echo $ac_file_in | + sed 's,.*/,,'` by configure." + + # First look for the input files in the build tree, otherwise in the + # src tree. + ac_file_inputs=`IFS=: + for f in $ac_file_in; do + case $f in + -) echo $tmp/stdin ;; + [\\/$]*) + # Absolute (can't be DOS-style, as IFS=:) + test -f "$f" || { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 +echo "$as_me: error: cannot find input file: $f" >&2;} + { (exit 1); exit 1; }; } + echo $f;; + *) # Relative + if test -f "$f"; then + # Build tree + echo $f + elif test -f "$srcdir/$f"; then + # Source tree + echo $srcdir/$f + else + # /dev/null tree + { { echo "$as_me:$LINENO: error: cannot find input file: $f" >&5 +echo "$as_me: error: cannot find input file: $f" >&2;} + { (exit 1); exit 1; }; } + fi;; + esac + done` || { (exit 1); exit 1; } +_ACEOF +cat >>$CONFIG_STATUS <<_ACEOF + sed "$ac_vpsub +$extrasub +_ACEOF +cat >>$CONFIG_STATUS <<\_ACEOF +:t +/@[a-zA-Z_][a-zA-Z_0-9]*@/!b +s,@configure_input@,$configure_input,;t t +s,@srcdir@,$ac_srcdir,;t t +s,@abs_srcdir@,$ac_abs_srcdir,;t t +s,@top_srcdir@,$ac_top_srcdir,;t t +s,@abs_top_srcdir@,$ac_abs_top_srcdir,;t t +s,@builddir@,$ac_builddir,;t t +s,@abs_builddir@,$ac_abs_builddir,;t t +s,@top_builddir@,$ac_top_builddir,;t t +s,@abs_top_builddir@,$ac_abs_top_builddir,;t t +s,@INSTALL@,$ac_INSTALL,;t t +" $ac_file_inputs | (eval "$ac_sed_cmds") >$tmp/out + rm -f $tmp/stdin + if test x"$ac_file" != x-; then + mv $tmp/out $ac_file + else + cat $tmp/out + rm -f $tmp/out + fi + +done +_ACEOF + +cat >>$CONFIG_STATUS <<\_ACEOF + +{ (exit 0); exit 0; } +_ACEOF +chmod +x $CONFIG_STATUS +ac_clean_files=$ac_clean_files_save + + +# configure is writing to config.log, and then calls config.status. +# config.status does its own redirection, appending to config.log. +# Unfortunately, on DOS this fails, as config.log is still kept open +# by configure, so config.status won't be able to write to it; its +# output is simply discarded. So we exec the FD to /dev/null, +# effectively closing config.log, so it can be properly (re)opened and +# appended to by config.status. When coming back to configure, we +# need to make the FD available again. +if test "$no_create" != yes; then + ac_cs_success=: + ac_config_status_args= + test "$silent" = yes && + ac_config_status_args="$ac_config_status_args --quiet" + exec 5>/dev/null + $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false + exec 5>>config.log + # Use ||, not &&, to avoid exiting from the if with $? = 1, which + # would make configure fail if this is the last instruction. + $ac_cs_success || { (exit 1); exit 1; } +fi + Index: vis_dev/vis-2.3/configure.in =================================================================== --- vis_dev/vis-2.3/configure.in (revision 14) +++ vis_dev/vis-2.3/configure.in (revision 14) @@ -0,0 +1,547 @@ +dnl Run autoconf on this file to produce the system configuration +dnl script "configure" + +# FileName [ configure.in ] +# +# PackageName [ vis ] +# +# Synopsis [ System configuration script for autoconf ] +# +# SeeAlso [ Makefile.in ] +# +# Author [ Stephen Edwards ] +# +# Copyright [ +# Copyright (c) 1994-1996 The Regents of the Univ. of California. +# All rights reserved. +# +# Permission is hereby granted, without written agreement and without license +# or royalty fees, to use, copy, modify, and distribute this software and its +# documentation for any purpose, provided that the above copyright notice and +# the following two paragraphs appear in all copies of this software. +# +# IN NO EVENT SHALL THE UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR +# DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT +# OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE UNIVERSITY OF +# CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. +# +# THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY WARRANTIES, +# INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND +# FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN +# "AS IS" BASIS, AND THE UNIVERSITY OF CALIFORNIA HAS NO OBLIGATION TO PROVIDE +# MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. +# ] +# +# Revision [$Id: configure.in,v 1.62 2004/08/20 18:31:32 fabio Exp $] + +# Require autoconf version 2.11 or above -- it checks to see if the C +# compiler actually works! + +AC_PREREQ(2.11) + +AC_INIT(src/cmd/cmd.h) + +# Look for install.sh, config.guess, and config.sub in the "helpers" dir +AC_CONFIG_AUX_DIR(helpers) + +#---------------------------------------------------------------------- +# Configuration options +#---------------------------------------------------------------------- + +# Give the configurer a chance to set the location of the GLU tree + +AC_SUBST(glulibdir) +AC_ARG_WITH(glu-libdir, +[ --with-glu-libdir= Specify directories to search for the GLU library. + Expects to find /libglu.a], +[glulibdir=$withval], [glulibdir=""]) + +AC_SUBST(gluincdir) +AC_ARG_WITH(glu-incdir, +[ --with-glu-incdir= Specify directories to search for the GLU headers], +[gluincdir=$withval], [gluincdir=""]) + +# Give the configurer a chance to set a different location for the VIS +# headers and library + +AC_SUBST(vislibdir) +AC_ARG_WITH(vis-libdir, +[ --with-vis-libdir= Specify directories to search for the VIS + and headers. Defaults to \".\". + Expects to find /libvis.a], +[vislibdir=$withval], +[vislibdir="."]) + +# Give the configurer a chance to set a different location for the VIS +# source. When specified, "srcdir" points to "master" source, and +# "local_srcdir" points to the source under local development. + +AC_SUBST(local_srcdir) +AC_ARG_WITH(local-srcdir, +[ --with-local-srcdir= Specify the root directory to search for + source for packages (the PKGS list). + Expects to find, e.g., /tbl/tbl.c], +[local_srcdir=$withval], +[local_srcdir=$srcdir]) + +# Give the configurer a chance to set the BDD library + +AC_SUBST(BDDLIB) +AC_ARG_WITH(bdd, +[ --with-bdd= Specify the BDD library to link against. + Defaults to --with-bdd=cu.], +[BDDLIB=$withval], +[BDDLIB=cu]) + +#---------------------------------------------------------------------- +# Checks for programs we need +#---------------------------------------------------------------------- +AC_PATH_PROG(ZCHAFF,zchaff) +AC_PATH_PROG(AR, ar, ar) +AC_PROG_RANLIB + +AC_CANONICAL_SYSTEM +AC_SUBST(target) + +# Determine the name of the C compiler we're going to use + +AC_ARG_ENABLE(gcc, + [ --enable-gcc Allow use of gcc if available], + [gcc_ok=$enableval], [gcc_ok=no]) + +# We cannot set CC=g++ directly because many configuration test programs +# do not compile with g++. Hence, when the user specifies --enable-gcc=g++, +# we set CC=gcc during configuration, and then CC=g++ at the end. +# The same applies to icpc and icc. +if test "$gcc_ok" != no; then + case "$gcc_ok" in + yes | g++) + CC=gcc ;; + icpc) + CC=icc ;; + *) + CC=$gcc_ok + esac +else + if test -z "$CC" ; then + # Balakrishna Kumthekar + # As we do not support cc on RS6000, Cygwin and SunOS. + case "$target" in + rs6000-ibm-aix* | *-pc-cygwin32 | sparc-sun-sunos*) + CC=gcc ;; + *) + CC=cc ;; + esac + fi +fi +AC_PROG_CC + +AC_ARG_ENABLE(64, + [ --enable-64 Use 64-bit pointers on 64-bit Alpha machines], + [use_sixty_four=$enableval], [use_sixty_four=no]) + +# Gcc does not support 32-bit pointers on the Alphas. +if test "$gcc_ok" != no; then + use_sixty_four=yes +fi + + +# Roderick Bloem (rbloem@colorado.edu): making a special case for +# ultrix install, since it's annoying about setting groupids. +case "$target" in + mips-dec-ultrix*) + INSTALL="helpers/install-sh -c" + INSTALL_PROGRAM="\${INSTALL}" + INSTALL_DATA="\${INSTALL} -m 644";; + + *) + AC_PROG_INSTALL ;; +esac + +# Determine the compiler flags to use + +DEBUG_CFLAGS="-g" +DEBUG_LDFLAGS="" + +case "$target" in + + i686-pc-linux-gnu) + # Linux with Intel compiler + # -ansi: ANSI C conformance + # -ip: inter-procedural optimization + OPTIMIZE_CFLAGS="-g -O3 -ansi -ip" + ;; + + sparc-sun-solaris* | i386-pc-solaris*) + # Sparc and X86 Solaris: + # -xO3: Highest safe level of optimization + # -native: Optimize for the native processor (if supported) + # -dalign: Generate double-word load/store for performance + # (only for SPARC) + # and other arcane compilation flags. + if test "$GCC" = yes; then + OPTIMIZE_CFLAGS="-O" + else + case "$target" in + sparc-sun-solaris*) + ALIGN=" -dalign" ;; + *) + ALIGN="" ;; + esac + AC_MSG_CHECKING([for -native]) + CFLAGS="-xO3 -native$ALIGN" + AC_CACHE_VAL(ac_cv_have_native, + [ AC_TRY_RUN([ + main(){exit(0);} + ],ac_cv_have_native=yes,ac_cv_have_native=no,ac_cv_have_native=no)]) + if test $ac_cv_have_native = yes ; then + AC_MSG_RESULT(working) + OPTIMIZE_CFLAGS="-xO3 -native$ALIGN" + else + AC_MSG_RESULT(broken) + AC_MSG_CHECKING([for fallback optimization flags]) + CFLAGS="-xO3 -fns -fsimple=2$ALIGN -ftrap=%none -xlibmil" + AC_CACHE_VAL(ac_cv_have_fallback, + [ AC_TRY_RUN([ + main(){exit(0);} + ],ac_cv_have_fallback=yes,ac_cv_have_fallback=no,ac_cv_have_fallback=no)]) + if test $ac_cv_have_fallback = yes ; then + AC_MSG_RESULT(working) + OPTIMIZE_CFLAGS="-xO3 -fns -fsimple=2$ALIGN -ftrap=%none -xlibmil" + else + AC_MSG_RESULT(broken) + OPTIMIZE_CFLAGS="-O" + fi + fi + fi + ;; + + mips-dec-ultrix*) + # MIPS-based DECstations running Ultrix: + # -std1: Produce non-ANSI code warnings, and define __STDC__ + # -O: Use the global "ucode" optimizer + # -Olimit 5000: Don't optimize routines bigger than 5000 basic blocks + OPTIMIZE_CFLAGS="-std1 -O -Olimit 5000" ;; + + alpha-dec-osf*) + # DEC Alpha running OSF: + + # 64-bit mode: + # -g3: Produce symbol table information for optimized code + # -O4: Enable every optimization + # -std: Enforce the ANSI standard with extensions, define __STDC__ + # -ieee_with_no_inexact: Disable (potentially slow) signaling + # for inexact floating-point results + # -tune host: Tune instructions for the compilation host machine + OPTIMIZE_CFLAGS="-g3 -O4 -std -ieee_with_no_inexact -tune host" + DEBUG_CFLAGS="-g -std -ieee_with_no_inexact" + + # -non_shared: Do not use shared libraries + # -om: Generate an OMAGIC file for the om optimizer + OPTIMIZE_LDFLAGS="-non_shared" + + if test "$use_sixty_four" = "no"; then + # 32-bit mode: + # -xtaso: Make the compiler respond to #pragma pointer_size directives + OPTIMIZE_CFLAGS="$OPTIMIZE_CFLAGS -xtaso" + DEBUG_CFLAGS="$DEBUG_CFLAGS -xtaso" + + # -taso: Load the executable into the lower 31-bit address space + OPTIMIZE_LDFLAGS="$OPTIMIZE_LDFLAGS -om -taso" + DEBUG_LDFLAGS="$DEBUG_LDFLAGS -taso" + + AC_DEFINE(SIZEOF_VOID_P, 4) + ac_sizeof_voidp=4 + fi + ;; + + hppa*-*-hpux*) + # HP running HPUX + # -Aa: Behave as an ANSI compiler + # -D_HPUX_SOURCE: Include "HP-specific" symbols in the header + # files (e.g., this means sys/resource.h has struct rusage) + # +Onolimit: removes resource restrictions for optimization + OPTIMIZE_CFLAGS="-O -Aa +Onolimit -D_HPUX_SOURCE" + DEBUG_CFLAGS="-g -Aa -D_HPUX_SOURCE" ;; + + *) + # Other systems: + OPTIMIZE_CFLAGS="-O" ;; + +esac + +if test "$GCC" = yes; then + case "$target" in + i686-pc-linux-gnu | i386-pc-solaris* | i386-pc-cygwin32 | i386-*-freebsd*) + AC_MSG_CHECKING([for -mcpu and -malign compiler options]) + CFLAGS="-g -O6 -mcpu=pentiumpro -malign-double" + AC_TRY_COMPILE(,,ac_have_mcpu=yes,ac_have_mcpu=no) + if test "$ac_have_mcpu" = yes; then + AC_MSG_RESULT(working) + OPTIMIZE_CFLAGS="-g -O6 -mcpu=pentiumpro -malign-double" + else + AC_MSG_RESULT(broken) + OPTIMIZE_CFLAGS="-g -O3" + fi + ;; + sparc-sun-solaris*) + AC_MSG_CHECKING([for -mtune compiler option]) + CFLAGS="-g -O6 -mtune=ultrasparc" + AC_TRY_COMPILE(,,ac_have_mtune=yes,ac_have_mtune=no) + if test "$ac_have_mtune" = yes; then + AC_MSG_RESULT(working) + OPTIMIZE_CFLAGS="-g -O6 -mtune=ultrasparc" + else + AC_MSG_RESULT(not working) + OPTIMIZE_CFLAGS="-g -O3" + fi + ;; + *) + OPTIMIZE_CFLAGS="-g -O3" + ;; + esac + OPTIMIZE_LDFLAGS="" + DEBUG_CFLAGS="-g" + DEBUG_LDFLAGS="" +fi + +AC_ARG_WITH(comp-mode, +[ --with-comp-mode= Specify a special compilation mode: + optimize (the default): Produce optimized + code, with symbol table information + if supported on the platform/compiler, + and without asserts. + debug: Produce unoptimized code with symbol table + information and asserts enabled + purify: Unoptimized code linked with purify + quantify: Optimized code without asserts + linked with quantify], +[comp_mode=$withval], +[comp_mode=optimize]) +AC_SUBST(LINKER) +AC_SUBST(PLINKER) + +LINKER="$CC" + +case "$comp_mode" in + debug) + CFLAGS="$DEBUG_CFLAGS" + LDFLAGS="$DEBUG_LDFLAGS" ;; + purify) + CFLAGS="$DEBUG_CFLAGS" + LDFLAGS="$DEBUG_LDFLAGS" + AC_DEFINE(PURIFY) + LINKER="purify -cache-dir=/tmp $CC" + PLINKER="purify -log-file=./purify.log -cachedir=/tmp $CC" ;; + quantify) + CFLAGS="$OPTIMIZE_CFLAGS" + LDFLAGS="$OPTIMIZE_LDFLAGS" + AC_DEFINE(QUANTIFY) + AC_DEFINE(NDEBUG) + LINKER="quantify $CC" ;; + optimize | *) + CFLAGS="$OPTIMIZE_CFLAGS" + LDFLAGS="$OPTIMIZE_LDFLAGS" + AC_DEFINE(NDEBUG) ;; +esac + +AC_PROG_LEX +AC_MSG_CHECKING(if $LEX accepts the -o and -P options) + +AC_CACHE_VAL(ac_cv_flex_accepts_op, +[ ac_cv_flex_accepts_op=yes ; +echo "%%\ +%%" | $LEX -Ptest -o/dev/null >/dev/null 2>&1 || ac_cv_flex_accepts_op=no ]) +if test $ac_cv_flex_accepts_op = yes ; then + AC_MSG_RESULT(yes) +else + AC_MSG_RESULT(no) + AC_MSG_WARN([You either need a newer version of flex, or need to modify +the defintion of LEX in the Makefile to point to a version that does +accept -p -t and -o.]) +fi + +AC_PROG_YACC +AC_MSG_CHECKING([if $YACC accepts the -p, -t, and -o options]) +AC_CACHE_VAL(ac_cv_yacc_accepts_pto, +[ ac_cv_yacc_accepts_pto=yes ; +echo "%token terminal\ +%%\ +nonterminal: terminal\ +%%" > config.in +$YACC -ptest -o /dev/null config.in >/dev/null 2>&1 || ac_cv_yacc_accepts_pto=no +rm -f config.in ]) +if test $ac_cv_yacc_accepts_pto = yes ; then + AC_MSG_RESULT(yes) +else + AC_MSG_RESULT(no) + AC_MSG_WARN([You either need a newer version of bison, or need to modify +the defintion of YACC in the Makefile to point to a version that does +accept -p -t and -o.]) +fi + +#---------------------------------------------------------------------- +# Checks for headers and libraries +#---------------------------------------------------------------------- +AC_HEADER_STDC + +AC_SUBST(LIBDIRS) + +# add -lucb to LIBS and -L/usr/ucblib to LIBDIRS +# if there's a libucb.a available +# (Solaris needs this for signals) + +ac_save_ldflags="$LDFLAGS" +LDFLAGS=-L/usr/ucblib +AC_CHECK_LIB(ucb,main,LIBDIRS="$LIBDIRS -L/usr/ucblib") +LDFLAGS="$ac_save_ldflags" + +# add -lbsd if there's a libbsd.a available +# (e.g., Linux needs this for bsd_ioctl) +AC_CHECK_LIB(bsd,main) + +# Check if libreadline exists and the function readline can be used. +# This implies checking for the availability of libtermcap or of a +# suitable replacement. (We only look for libncurses.) +AC_CACHE_VAL(vis_cv_termcap_lib, +[AC_CHECK_LIB(termcap, tgetent, vis_cv_termcap_lib=-ltermcap, + [AC_CHECK_LIB(ncurses, tgetent, vis_cv_termcap_lib=-lncurses, + bash_cv_termcap_lib=none)])]) +if test "$vis_cv_termcap_lib" != none; then + AC_CHECK_LIB(readline, readline, ac_readline_flag=1, + ac_readline_flag=0, $vis_cv_termcap_lib) + if test $ac_readline_flag = 1 ; then + LIBS="$LIBS -lreadline $vis_cv_termcap_lib" ; AC_DEFINE(HAVE_LIBREADLINE) + fi +fi + +# Check for the dirent header file, which is quite a mess +AC_HEADER_DIRENT + +# Check for these system header files +AC_CHECK_HEADERS(sys/termios.h sys/ioctl.h sys/time.h signal.h sys/signal.h readline/readline.h readline/history.h) + +# This is for Linux +AC_CHECK_HEADERS(bsd/sgtty.h) + +# Some systems want both sys/ioctl.h and sys/termios.h, but others can +# only have one -- check for that + +AC_MSG_CHECKING(whether sys/termios.h and sys/ioctl.h should both be included) + +AC_CACHE_VAL(ac_cv_ioctl_with_termios, +[AC_TRY_CPP([ +#include +#include +], ac_cv_ioctl_with_termios=1, ac_cv_ioctl_with_termios=0 )]) +if test $ac_cv_ioctl_with_termios = 1 ; then + AC_MSG_RESULT(yes) ; AC_DEFINE(IOCTL_WITH_TERMIOS) +else + AC_MSG_RESULT(no) +fi + +# cmdFile.c wants to be able to use TIOCGETC to do file completion, +# but some systems (e.g., HPUX) don't have this +# + +AC_MSG_CHECKING(for TIOCGETC) + +AC_CACHE_VAL(ac_cv_have_ioctl_with_tiocgetc, +[if test $ac_cv_ioctl_with_termios = 1 ; then + AC_EGREP_CPP(yes, +[#include +#include +#ifdef TIOCGETC + yes +#endif], + ac_cv_have_ioctl_with_tiocgetc=yes, + ac_cv_have_ioctl_with_tiocgetc=no) +else + AC_EGREP_CPP(yes, +[#include +#ifdef TIOCGETC + yes +#endif], + ac_cv_have_ioctl_with_tiocgetc=yes, + ac_cv_have_ioctl_with_tiocgetc=no) +fi]) +if test $ac_cv_have_ioctl_with_tiocgetc = "yes" ; then + AC_MSG_RESULT(yes) ; AC_DEFINE(HAVE_IOCTL_WITH_TIOCGETC) +else + AC_MSG_RESULT(no) +fi + +# # cmdFile.c wants to turn off interrupts, but some systems don't +# # seem to know how to do that using TIOCLBIS +# # +# # This is probably fairly fragile, and it's probably cmdFile.c that should +# # be fixed +# # +# # This has been very unreliable (e.g., on Solaris), so the facility has +# # been turned off +# +# if test $ac_cv_have_ioctl_with_tiocgetc = "yes" ; then +# +# AC_MSG_CHECKING(for TIOCLBIS) +# +# AC_CACHE_VAL(ac_cv_have_term_interrupts, +# [AC_EGREP_CPP(yes, +# [#include +# #include +# #ifdef TIOCLBIS +# yes +# #endif +# ], ac_cv_have_term_interrupts=1, +# ac_cv_have_term_interrupts=0 )]) +# +# if test $ac_cv_have_term_interrupts = 1 ; then +# AC_MSG_RESULT(yes) ; AC_DEFINE(HAVE_TERM_INTERRUPTS) +# else +# AC_MSG_RESULT(no) +# fi +# +# fi # ac_cv_have_ioctl_with_tiocgetc + +#---------------------------------------------------------------------- +# Checks for typedefs, structures, and compiler characteristics. +#---------------------------------------------------------------------- + +# Check to see if the compiler understands "const" +# #define it empty otherwise +AC_C_CONST + +# Sort out "time.h" nonsense +AC_HEADER_TIME + +AC_STRUCT_TM + +# Set RETSIGTYPE to the proper return type for a signal handler (void or int) +AC_TYPE_SIGNAL + +# Roderick Bloem (rbloem@colorado.edu) : On Irix we need ttold +case "$target" in + mips-sgi-irix*) + AC_DEFINE(NEED_TTOLD);; +esac + +#---------------------------------------------------------------------- +# Checks for library functions. +#---------------------------------------------------------------------- + +AC_PROG_GCC_TRADITIONAL +AC_FUNC_MEMCMP +AC_TYPE_SIGNAL +AC_CHECK_FUNCS(gettimeofday strchr strstr setvbuf getenv unlink mkstemp close) + +#----------------------------------------------------------------------- +# Check for mawk, gawk, nawk, awk in that order +#----------------------------------------------------------------------- +AC_PROG_AWK + +#---------------------------------------------------------------------- +# Create the Makefile from Makefile.in +#---------------------------------------------------------------------- +if test "$gcc_ok" = "g++"; then + CC=$gcc_ok +fi +AC_OUTPUT(Makefile) Index: vis_dev/vis-2.3/helpers/config.guess =================================================================== --- vis_dev/vis-2.3/helpers/config.guess (revision 14) +++ vis_dev/vis-2.3/helpers/config.guess (revision 14) @@ -0,0 +1,1526 @@ +#! /bin/sh +# Attempt to guess a canonical system name. +# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, +# 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 +# Free Software Foundation, Inc. + +timestamp='2008-01-23' + +# This file 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 of the License, 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, Inc., 51 Franklin Street - Fifth Floor, Boston, MA +# 02110-1301, USA. +# +# As a special exception to the GNU General Public License, if you +# distribute this file as part of a program that contains a +# configuration script generated by Autoconf, you may include it under +# the same distribution terms that you use for the rest of that program. + + +# Originally written by Per Bothner . +# Please send patches to . Submit a context +# diff and a properly formatted ChangeLog entry. +# +# This script attempts to guess a canonical system name similar to +# config.sub. If it succeeds, it prints the system name on stdout, and +# exits with 0. Otherwise, it exits with 1. +# +# The plan is that this can be called by configure scripts if you +# don't specify an explicit build system type. + +me=`echo "$0" | sed -e 's,.*/,,'` + +usage="\ +Usage: $0 [OPTION] + +Output the configuration name of the system \`$me' is run on. + +Operation modes: + -h, --help print this help, then exit + -t, --time-stamp print date of last modification, then exit + -v, --version print version number, then exit + +Report bugs and patches to ." + +version="\ +GNU config.guess ($timestamp) + +Originally written by Per Bothner. +Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, +2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. + +This is free software; see the source for copying conditions. There is NO +warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." + +help=" +Try \`$me --help' for more information." + +# Parse command line +while test $# -gt 0 ; do + case $1 in + --time-stamp | --time* | -t ) + echo "$timestamp" ; exit ;; + --version | -v ) + echo "$version" ; exit ;; + --help | --h* | -h ) + echo "$usage"; exit ;; + -- ) # Stop option processing + shift; break ;; + - ) # Use stdin as input. + break ;; + -* ) + echo "$me: invalid option $1$help" >&2 + exit 1 ;; + * ) + break ;; + esac +done + +if test $# != 0; then + echo "$me: too many arguments$help" >&2 + exit 1 +fi + +trap 'exit 1' 1 2 15 + +# CC_FOR_BUILD -- compiler used by this script. Note that the use of a +# compiler to aid in system detection is discouraged as it requires +# temporary files to be created and, as you can see below, it is a +# headache to deal with in a portable fashion. + +# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still +# use `HOST_CC' if defined, but it is deprecated. + +# Portable tmp directory creation inspired by the Autoconf team. + +set_cc_for_build=' +trap "exitcode=\$?; (rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null) && exit \$exitcode" 0 ; +trap "rm -f \$tmpfiles 2>/dev/null; rmdir \$tmp 2>/dev/null; exit 1" 1 2 13 15 ; +: ${TMPDIR=/tmp} ; + { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } || + { test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir $tmp) ; } || + { tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir $tmp) && echo "Warning: creating insecure temp directory" >&2 ; } || + { echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; } ; +dummy=$tmp/dummy ; +tmpfiles="$dummy.c $dummy.o $dummy.rel $dummy" ; +case $CC_FOR_BUILD,$HOST_CC,$CC in + ,,) echo "int x;" > $dummy.c ; + for c in cc gcc c89 c99 ; do + if ($c -c -o $dummy.o $dummy.c) >/dev/null 2>&1 ; then + CC_FOR_BUILD="$c"; break ; + fi ; + done ; + if test x"$CC_FOR_BUILD" = x ; then + CC_FOR_BUILD=no_compiler_found ; + fi + ;; + ,,*) CC_FOR_BUILD=$CC ;; + ,*,*) CC_FOR_BUILD=$HOST_CC ;; +esac ; set_cc_for_build= ;' + +# This is needed to find uname on a Pyramid OSx when run in the BSD universe. +# (ghazi@noc.rutgers.edu 1994-08-24) +if (test -f /.attbin/uname) >/dev/null 2>&1 ; then + PATH=$PATH:/.attbin ; export PATH +fi + +UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown +UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown +UNAME_SYSTEM=`(uname -s) 2>/dev/null` || UNAME_SYSTEM=unknown +UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown + +# Note: order is significant - the case branches are not exclusive. + +case "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" in + *:NetBSD:*:*) + # NetBSD (nbsd) targets should (where applicable) match one or + # more of the tupples: *-*-netbsdelf*, *-*-netbsdaout*, + # *-*-netbsdecoff* and *-*-netbsd*. For targets that recently + # switched to ELF, *-*-netbsd* would select the old + # object file format. This provides both forward + # compatibility and a consistent mechanism for selecting the + # object file format. + # + # Note: NetBSD doesn't particularly care about the vendor + # portion of the name. We always set it to "unknown". + sysctl="sysctl -n hw.machine_arch" + UNAME_MACHINE_ARCH=`(/sbin/$sysctl 2>/dev/null || \ + /usr/sbin/$sysctl 2>/dev/null || echo unknown)` + case "${UNAME_MACHINE_ARCH}" in + armeb) machine=armeb-unknown ;; + arm*) machine=arm-unknown ;; + sh3el) machine=shl-unknown ;; + sh3eb) machine=sh-unknown ;; + sh5el) machine=sh5le-unknown ;; + *) machine=${UNAME_MACHINE_ARCH}-unknown ;; + esac + # The Operating System including object format, if it has switched + # to ELF recently, or will in the future. + case "${UNAME_MACHINE_ARCH}" in + arm*|i386|m68k|ns32k|sh3*|sparc|vax) + eval $set_cc_for_build + if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \ + | grep __ELF__ >/dev/null + then + # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout). + # Return netbsd for either. FIX? + os=netbsd + else + os=netbsdelf + fi + ;; + *) + os=netbsd + ;; + esac + # The OS release + # Debian GNU/NetBSD machines have a different userland, and + # thus, need a distinct triplet. However, they do not need + # kernel version information, so it can be replaced with a + # suitable tag, in the style of linux-gnu. + case "${UNAME_VERSION}" in + Debian*) + release='-gnu' + ;; + *) + release=`echo ${UNAME_RELEASE}|sed -e 's/[-_].*/\./'` + ;; + esac + # Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM: + # contains redundant information, the shorter form: + # CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used. + echo "${machine}-${os}${release}" + exit ;; + *:OpenBSD:*:*) + UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'` + echo ${UNAME_MACHINE_ARCH}-unknown-openbsd${UNAME_RELEASE} + exit ;; + *:ekkoBSD:*:*) + echo ${UNAME_MACHINE}-unknown-ekkobsd${UNAME_RELEASE} + exit ;; + *:SolidBSD:*:*) + echo ${UNAME_MACHINE}-unknown-solidbsd${UNAME_RELEASE} + exit ;; + macppc:MirBSD:*:*) + echo powerpc-unknown-mirbsd${UNAME_RELEASE} + exit ;; + *:MirBSD:*:*) + echo ${UNAME_MACHINE}-unknown-mirbsd${UNAME_RELEASE} + exit ;; + alpha:OSF1:*:*) + case $UNAME_RELEASE in + *4.0) + UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'` + ;; + *5.*) + UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'` + ;; + esac + # According to Compaq, /usr/sbin/psrinfo has been available on + # OSF/1 and Tru64 systems produced since 1995. I hope that + # covers most systems running today. This code pipes the CPU + # types through head -n 1, so we only detect the type of CPU 0. + ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^ The alpha \(.*\) processor.*$/\1/p' | head -n 1` + case "$ALPHA_CPU_TYPE" in + "EV4 (21064)") + UNAME_MACHINE="alpha" ;; + "EV4.5 (21064)") + UNAME_MACHINE="alpha" ;; + "LCA4 (21066/21068)") + UNAME_MACHINE="alpha" ;; + "EV5 (21164)") + UNAME_MACHINE="alphaev5" ;; + "EV5.6 (21164A)") + UNAME_MACHINE="alphaev56" ;; + "EV5.6 (21164PC)") + UNAME_MACHINE="alphapca56" ;; + "EV5.7 (21164PC)") + UNAME_MACHINE="alphapca57" ;; + "EV6 (21264)") + UNAME_MACHINE="alphaev6" ;; + "EV6.7 (21264A)") + UNAME_MACHINE="alphaev67" ;; + "EV6.8CB (21264C)") + UNAME_MACHINE="alphaev68" ;; + "EV6.8AL (21264B)") + UNAME_MACHINE="alphaev68" ;; + "EV6.8CX (21264D)") + UNAME_MACHINE="alphaev68" ;; + "EV6.9A (21264/EV69A)") + UNAME_MACHINE="alphaev69" ;; + "EV7 (21364)") + UNAME_MACHINE="alphaev7" ;; + "EV7.9 (21364A)") + UNAME_MACHINE="alphaev79" ;; + esac + # A Pn.n version is a patched version. + # A Vn.n version is a released version. + # A Tn.n version is a released field test version. + # A Xn.n version is an unreleased experimental baselevel. + # 1.2 uses "1.2" for uname -r. + echo ${UNAME_MACHINE}-dec-osf`echo ${UNAME_RELEASE} | sed -e 's/^[PVTX]//' | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` + exit ;; + Alpha\ *:Windows_NT*:*) + # How do we know it's Interix rather than the generic POSIX subsystem? + # Should we change UNAME_MACHINE based on the output of uname instead + # of the specific Alpha model? + echo alpha-pc-interix + exit ;; + 21064:Windows_NT:50:3) + echo alpha-dec-winnt3.5 + exit ;; + Amiga*:UNIX_System_V:4.0:*) + echo m68k-unknown-sysv4 + exit ;; + *:[Aa]miga[Oo][Ss]:*:*) + echo ${UNAME_MACHINE}-unknown-amigaos + exit ;; + *:[Mm]orph[Oo][Ss]:*:*) + echo ${UNAME_MACHINE}-unknown-morphos + exit ;; + *:OS/390:*:*) + echo i370-ibm-openedition + exit ;; + *:z/VM:*:*) + echo s390-ibm-zvmoe + exit ;; + *:OS400:*:*) + echo powerpc-ibm-os400 + exit ;; + arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*) + echo arm-acorn-riscix${UNAME_RELEASE} + exit ;; + arm:riscos:*:*|arm:RISCOS:*:*) + echo arm-unknown-riscos + exit ;; + SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*) + echo hppa1.1-hitachi-hiuxmpp + exit ;; + Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*) + # akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE. + if test "`(/bin/universe) 2>/dev/null`" = att ; then + echo pyramid-pyramid-sysv3 + else + echo pyramid-pyramid-bsd + fi + exit ;; + NILE*:*:*:dcosx) + echo pyramid-pyramid-svr4 + exit ;; + DRS?6000:unix:4.0:6*) + echo sparc-icl-nx6 + exit ;; + DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*) + case `/usr/bin/uname -p` in + sparc) echo sparc-icl-nx7; exit ;; + esac ;; + sun4H:SunOS:5.*:*) + echo sparc-hal-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` + exit ;; + sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*) + echo sparc-sun-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` + exit ;; + i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*) + echo i386-pc-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` + exit ;; + sun4*:SunOS:6*:*) + # According to config.sub, this is the proper way to canonicalize + # SunOS6. Hard to guess exactly what SunOS6 will be like, but + # it's likely to be more like Solaris than SunOS4. + echo sparc-sun-solaris3`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` + exit ;; + sun4*:SunOS:*:*) + case "`/usr/bin/arch -k`" in + Series*|S4*) + UNAME_RELEASE=`uname -v` + ;; + esac + # Japanese Language versions have a version number like `4.1.3-JL'. + echo sparc-sun-sunos`echo ${UNAME_RELEASE}|sed -e 's/-/_/'` + exit ;; + sun3*:SunOS:*:*) + echo m68k-sun-sunos${UNAME_RELEASE} + exit ;; + sun*:*:4.2BSD:*) + UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null` + test "x${UNAME_RELEASE}" = "x" && UNAME_RELEASE=3 + case "`/bin/arch`" in + sun3) + echo m68k-sun-sunos${UNAME_RELEASE} + ;; + sun4) + echo sparc-sun-sunos${UNAME_RELEASE} + ;; + esac + exit ;; + aushp:SunOS:*:*) + echo sparc-auspex-sunos${UNAME_RELEASE} + exit ;; + # The situation for MiNT is a little confusing. The machine name + # can be virtually everything (everything which is not + # "atarist" or "atariste" at least should have a processor + # > m68000). The system name ranges from "MiNT" over "FreeMiNT" + # to the lowercase version "mint" (or "freemint"). Finally + # the system name "TOS" denotes a system which is actually not + # MiNT. But MiNT is downward compatible to TOS, so this should + # be no problem. + atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*) + echo m68k-atari-mint${UNAME_RELEASE} + exit ;; + atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*) + echo m68k-atari-mint${UNAME_RELEASE} + exit ;; + *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*) + echo m68k-atari-mint${UNAME_RELEASE} + exit ;; + milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*) + echo m68k-milan-mint${UNAME_RELEASE} + exit ;; + hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*) + echo m68k-hades-mint${UNAME_RELEASE} + exit ;; + *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*) + echo m68k-unknown-mint${UNAME_RELEASE} + exit ;; + m68k:machten:*:*) + echo m68k-apple-machten${UNAME_RELEASE} + exit ;; + powerpc:machten:*:*) + echo powerpc-apple-machten${UNAME_RELEASE} + exit ;; + RISC*:Mach:*:*) + echo mips-dec-mach_bsd4.3 + exit ;; + RISC*:ULTRIX:*:*) + echo mips-dec-ultrix${UNAME_RELEASE} + exit ;; + VAX*:ULTRIX*:*:*) + echo vax-dec-ultrix${UNAME_RELEASE} + exit ;; + 2020:CLIX:*:* | 2430:CLIX:*:*) + echo clipper-intergraph-clix${UNAME_RELEASE} + exit ;; + mips:*:*:UMIPS | mips:*:*:RISCos) + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c +#ifdef __cplusplus +#include /* for printf() prototype */ + int main (int argc, char *argv[]) { +#else + int main (argc, argv) int argc; char *argv[]; { +#endif + #if defined (host_mips) && defined (MIPSEB) + #if defined (SYSTYPE_SYSV) + printf ("mips-mips-riscos%ssysv\n", argv[1]); exit (0); + #endif + #if defined (SYSTYPE_SVR4) + printf ("mips-mips-riscos%ssvr4\n", argv[1]); exit (0); + #endif + #if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD) + printf ("mips-mips-riscos%sbsd\n", argv[1]); exit (0); + #endif + #endif + exit (-1); + } +EOF + $CC_FOR_BUILD -o $dummy $dummy.c && + dummyarg=`echo "${UNAME_RELEASE}" | sed -n 's/\([0-9]*\).*/\1/p'` && + SYSTEM_NAME=`$dummy $dummyarg` && + { echo "$SYSTEM_NAME"; exit; } + echo mips-mips-riscos${UNAME_RELEASE} + exit ;; + Motorola:PowerMAX_OS:*:*) + echo powerpc-motorola-powermax + exit ;; + Motorola:*:4.3:PL8-*) + echo powerpc-harris-powermax + exit ;; + Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*) + echo powerpc-harris-powermax + exit ;; + Night_Hawk:Power_UNIX:*:*) + echo powerpc-harris-powerunix + exit ;; + m88k:CX/UX:7*:*) + echo m88k-harris-cxux7 + exit ;; + m88k:*:4*:R4*) + echo m88k-motorola-sysv4 + exit ;; + m88k:*:3*:R3*) + echo m88k-motorola-sysv3 + exit ;; + AViiON:dgux:*:*) + # DG/UX returns AViiON for all architectures + UNAME_PROCESSOR=`/usr/bin/uname -p` + if [ $UNAME_PROCESSOR = mc88100 ] || [ $UNAME_PROCESSOR = mc88110 ] + then + if [ ${TARGET_BINARY_INTERFACE}x = m88kdguxelfx ] || \ + [ ${TARGET_BINARY_INTERFACE}x = x ] + then + echo m88k-dg-dgux${UNAME_RELEASE} + else + echo m88k-dg-dguxbcs${UNAME_RELEASE} + fi + else + echo i586-dg-dgux${UNAME_RELEASE} + fi + exit ;; + M88*:DolphinOS:*:*) # DolphinOS (SVR3) + echo m88k-dolphin-sysv3 + exit ;; + M88*:*:R3*:*) + # Delta 88k system running SVR3 + echo m88k-motorola-sysv3 + exit ;; + XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3) + echo m88k-tektronix-sysv3 + exit ;; + Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD) + echo m68k-tektronix-bsd + exit ;; + *:IRIX*:*:*) + echo mips-sgi-irix`echo ${UNAME_RELEASE}|sed -e 's/-/_/g'` + exit ;; + ????????:AIX?:[12].1:2) # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX. + echo romp-ibm-aix # uname -m gives an 8 hex-code CPU id + exit ;; # Note that: echo "'`uname -s`'" gives 'AIX ' + i*86:AIX:*:*) + echo i386-ibm-aix + exit ;; + ia64:AIX:*:*) + if [ -x /usr/bin/oslevel ] ; then + IBM_REV=`/usr/bin/oslevel` + else + IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} + fi + echo ${UNAME_MACHINE}-ibm-aix${IBM_REV} + exit ;; + *:AIX:2:3) + if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c + #include + + main() + { + if (!__power_pc()) + exit(1); + puts("powerpc-ibm-aix3.2.5"); + exit(0); + } +EOF + if $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` + then + echo "$SYSTEM_NAME" + else + echo rs6000-ibm-aix3.2.5 + fi + elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then + echo rs6000-ibm-aix3.2.4 + else + echo rs6000-ibm-aix3.2 + fi + exit ;; + *:AIX:*:[456]) + IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'` + if /usr/sbin/lsattr -El ${IBM_CPU_ID} | grep ' POWER' >/dev/null 2>&1; then + IBM_ARCH=rs6000 + else + IBM_ARCH=powerpc + fi + if [ -x /usr/bin/oslevel ] ; then + IBM_REV=`/usr/bin/oslevel` + else + IBM_REV=${UNAME_VERSION}.${UNAME_RELEASE} + fi + echo ${IBM_ARCH}-ibm-aix${IBM_REV} + exit ;; + *:AIX:*:*) + echo rs6000-ibm-aix + exit ;; + ibmrt:4.4BSD:*|romp-ibm:BSD:*) + echo romp-ibm-bsd4.4 + exit ;; + ibmrt:*BSD:*|romp-ibm:BSD:*) # covers RT/PC BSD and + echo romp-ibm-bsd${UNAME_RELEASE} # 4.3 with uname added to + exit ;; # report: romp-ibm BSD 4.3 + *:BOSX:*:*) + echo rs6000-bull-bosx + exit ;; + DPX/2?00:B.O.S.:*:*) + echo m68k-bull-sysv3 + exit ;; + 9000/[34]??:4.3bsd:1.*:*) + echo m68k-hp-bsd + exit ;; + hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*) + echo m68k-hp-bsd4.4 + exit ;; + 9000/[34678]??:HP-UX:*:*) + HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` + case "${UNAME_MACHINE}" in + 9000/31? ) HP_ARCH=m68000 ;; + 9000/[34]?? ) HP_ARCH=m68k ;; + 9000/[678][0-9][0-9]) + if [ -x /usr/bin/getconf ]; then + sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null` + sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null` + case "${sc_cpu_version}" in + 523) HP_ARCH="hppa1.0" ;; # CPU_PA_RISC1_0 + 528) HP_ARCH="hppa1.1" ;; # CPU_PA_RISC1_1 + 532) # CPU_PA_RISC2_0 + case "${sc_kernel_bits}" in + 32) HP_ARCH="hppa2.0n" ;; + 64) HP_ARCH="hppa2.0w" ;; + '') HP_ARCH="hppa2.0" ;; # HP-UX 10.20 + esac ;; + esac + fi + if [ "${HP_ARCH}" = "" ]; then + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c + + #define _HPUX_SOURCE + #include + #include + + int main () + { + #if defined(_SC_KERNEL_BITS) + long bits = sysconf(_SC_KERNEL_BITS); + #endif + long cpu = sysconf (_SC_CPU_VERSION); + + switch (cpu) + { + case CPU_PA_RISC1_0: puts ("hppa1.0"); break; + case CPU_PA_RISC1_1: puts ("hppa1.1"); break; + case CPU_PA_RISC2_0: + #if defined(_SC_KERNEL_BITS) + switch (bits) + { + case 64: puts ("hppa2.0w"); break; + case 32: puts ("hppa2.0n"); break; + default: puts ("hppa2.0"); break; + } break; + #else /* !defined(_SC_KERNEL_BITS) */ + puts ("hppa2.0"); break; + #endif + default: puts ("hppa1.0"); break; + } + exit (0); + } +EOF + (CCOPTS= $CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null) && HP_ARCH=`$dummy` + test -z "$HP_ARCH" && HP_ARCH=hppa + fi ;; + esac + if [ ${HP_ARCH} = "hppa2.0w" ] + then + eval $set_cc_for_build + + # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating + # 32-bit code. hppa64-hp-hpux* has the same kernel and a compiler + # generating 64-bit code. GNU and HP use different nomenclature: + # + # $ CC_FOR_BUILD=cc ./config.guess + # => hppa2.0w-hp-hpux11.23 + # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess + # => hppa64-hp-hpux11.23 + + if echo __LP64__ | (CCOPTS= $CC_FOR_BUILD -E - 2>/dev/null) | + grep __LP64__ >/dev/null + then + HP_ARCH="hppa2.0w" + else + HP_ARCH="hppa64" + fi + fi + echo ${HP_ARCH}-hp-hpux${HPUX_REV} + exit ;; + ia64:HP-UX:*:*) + HPUX_REV=`echo ${UNAME_RELEASE}|sed -e 's/[^.]*.[0B]*//'` + echo ia64-hp-hpux${HPUX_REV} + exit ;; + 3050*:HI-UX:*:*) + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c + #include + int + main () + { + long cpu = sysconf (_SC_CPU_VERSION); + /* The order matters, because CPU_IS_HP_MC68K erroneously returns + true for CPU_PA_RISC1_0. CPU_IS_PA_RISC returns correct + results, however. */ + if (CPU_IS_PA_RISC (cpu)) + { + switch (cpu) + { + case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break; + case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break; + case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break; + default: puts ("hppa-hitachi-hiuxwe2"); break; + } + } + else if (CPU_IS_HP_MC68K (cpu)) + puts ("m68k-hitachi-hiuxwe2"); + else puts ("unknown-hitachi-hiuxwe2"); + exit (0); + } +EOF + $CC_FOR_BUILD -o $dummy $dummy.c && SYSTEM_NAME=`$dummy` && + { echo "$SYSTEM_NAME"; exit; } + echo unknown-hitachi-hiuxwe2 + exit ;; + 9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:* ) + echo hppa1.1-hp-bsd + exit ;; + 9000/8??:4.3bsd:*:*) + echo hppa1.0-hp-bsd + exit ;; + *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*) + echo hppa1.0-hp-mpeix + exit ;; + hp7??:OSF1:*:* | hp8?[79]:OSF1:*:* ) + echo hppa1.1-hp-osf + exit ;; + hp8??:OSF1:*:*) + echo hppa1.0-hp-osf + exit ;; + i*86:OSF1:*:*) + if [ -x /usr/sbin/sysversion ] ; then + echo ${UNAME_MACHINE}-unknown-osf1mk + else + echo ${UNAME_MACHINE}-unknown-osf1 + fi + exit ;; + parisc*:Lites*:*:*) + echo hppa1.1-hp-lites + exit ;; + C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*) + echo c1-convex-bsd + exit ;; + C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*) + if getsysinfo -f scalar_acc + then echo c32-convex-bsd + else echo c2-convex-bsd + fi + exit ;; + C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*) + echo c34-convex-bsd + exit ;; + C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*) + echo c38-convex-bsd + exit ;; + C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*) + echo c4-convex-bsd + exit ;; + CRAY*Y-MP:*:*:*) + echo ymp-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' + exit ;; + CRAY*[A-Z]90:*:*:*) + echo ${UNAME_MACHINE}-cray-unicos${UNAME_RELEASE} \ + | sed -e 's/CRAY.*\([A-Z]90\)/\1/' \ + -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \ + -e 's/\.[^.]*$/.X/' + exit ;; + CRAY*TS:*:*:*) + echo t90-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' + exit ;; + CRAY*T3E:*:*:*) + echo alphaev5-cray-unicosmk${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' + exit ;; + CRAY*SV1:*:*:*) + echo sv1-cray-unicos${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' + exit ;; + *:UNICOS/mp:*:*) + echo craynv-cray-unicosmp${UNAME_RELEASE} | sed -e 's/\.[^.]*$/.X/' + exit ;; + F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*) + FUJITSU_PROC=`uname -m | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz'` + FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` + FUJITSU_REL=`echo ${UNAME_RELEASE} | sed -e 's/ /_/'` + echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" + exit ;; + 5000:UNIX_System_V:4.*:*) + FUJITSU_SYS=`uname -p | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/\///'` + FUJITSU_REL=`echo ${UNAME_RELEASE} | tr 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' 'abcdefghijklmnopqrstuvwxyz' | sed -e 's/ /_/'` + echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}" + exit ;; + i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*) + echo ${UNAME_MACHINE}-pc-bsdi${UNAME_RELEASE} + exit ;; + sparc*:BSD/OS:*:*) + echo sparc-unknown-bsdi${UNAME_RELEASE} + exit ;; + *:BSD/OS:*:*) + echo ${UNAME_MACHINE}-unknown-bsdi${UNAME_RELEASE} + exit ;; + *:FreeBSD:*:*) + case ${UNAME_MACHINE} in + pc98) + echo i386-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; + amd64) + echo x86_64-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; + *) + echo ${UNAME_MACHINE}-unknown-freebsd`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` ;; + esac + exit ;; + i*:CYGWIN*:*) + echo ${UNAME_MACHINE}-pc-cygwin + exit ;; + *:MINGW*:*) + echo ${UNAME_MACHINE}-pc-mingw32 + exit ;; + i*:windows32*:*) + # uname -m includes "-pc" on this system. + echo ${UNAME_MACHINE}-mingw32 + exit ;; + i*:PW*:*) + echo ${UNAME_MACHINE}-pc-pw32 + exit ;; + *:Interix*:[3456]*) + case ${UNAME_MACHINE} in + x86) + echo i586-pc-interix${UNAME_RELEASE} + exit ;; + EM64T | authenticamd) + echo x86_64-unknown-interix${UNAME_RELEASE} + exit ;; + IA64) + echo ia64-unknown-interix${UNAME_RELEASE} + exit ;; + esac ;; + [345]86:Windows_95:* | [345]86:Windows_98:* | [345]86:Windows_NT:*) + echo i${UNAME_MACHINE}-pc-mks + exit ;; + i*:Windows_NT*:* | Pentium*:Windows_NT*:*) + # How do we know it's Interix rather than the generic POSIX subsystem? + # It also conflicts with pre-2.0 versions of AT&T UWIN. Should we + # UNAME_MACHINE based on the output of uname instead of i386? + echo i586-pc-interix + exit ;; + i*:UWIN*:*) + echo ${UNAME_MACHINE}-pc-uwin + exit ;; + amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*) + echo x86_64-unknown-cygwin + exit ;; + p*:CYGWIN*:*) + echo powerpcle-unknown-cygwin + exit ;; + prep*:SunOS:5.*:*) + echo powerpcle-unknown-solaris2`echo ${UNAME_RELEASE}|sed -e 's/[^.]*//'` + exit ;; + *:GNU:*:*) + # the GNU system + echo `echo ${UNAME_MACHINE}|sed -e 's,[-/].*$,,'`-unknown-gnu`echo ${UNAME_RELEASE}|sed -e 's,/.*$,,'` + exit ;; + *:GNU/*:*:*) + # other systems with GNU libc and userland + echo ${UNAME_MACHINE}-unknown-`echo ${UNAME_SYSTEM} | sed 's,^[^/]*/,,' | tr '[A-Z]' '[a-z]'``echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`-gnu + exit ;; + i*86:Minix:*:*) + echo ${UNAME_MACHINE}-pc-minix + exit ;; + arm*:Linux:*:*) + eval $set_cc_for_build + if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \ + | grep -q __ARM_EABI__ + then + echo ${UNAME_MACHINE}-unknown-linux-gnu + else + echo ${UNAME_MACHINE}-unknown-linux-gnueabi + fi + exit ;; + avr32*:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + cris:Linux:*:*) + echo cris-axis-linux-gnu + exit ;; + crisv32:Linux:*:*) + echo crisv32-axis-linux-gnu + exit ;; + frv:Linux:*:*) + echo frv-unknown-linux-gnu + exit ;; + ia64:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + m32r*:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + m68*:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + mips:Linux:*:*) + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c + #undef CPU + #undef mips + #undef mipsel + #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) + CPU=mipsel + #else + #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) + CPU=mips + #else + CPU= + #endif + #endif +EOF + eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' + /^CPU/{ + s: ::g + p + }'`" + test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } + ;; + mips64:Linux:*:*) + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c + #undef CPU + #undef mips64 + #undef mips64el + #if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) + CPU=mips64el + #else + #if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) + CPU=mips64 + #else + CPU= + #endif + #endif +EOF + eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' + /^CPU/{ + s: ::g + p + }'`" + test x"${CPU}" != x && { echo "${CPU}-unknown-linux-gnu"; exit; } + ;; + or32:Linux:*:*) + echo or32-unknown-linux-gnu + exit ;; + ppc:Linux:*:*) + echo powerpc-unknown-linux-gnu + exit ;; + ppc64:Linux:*:*) + echo powerpc64-unknown-linux-gnu + exit ;; + alpha:Linux:*:*) + case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' < /proc/cpuinfo` in + EV5) UNAME_MACHINE=alphaev5 ;; + EV56) UNAME_MACHINE=alphaev56 ;; + PCA56) UNAME_MACHINE=alphapca56 ;; + PCA57) UNAME_MACHINE=alphapca56 ;; + EV6) UNAME_MACHINE=alphaev6 ;; + EV67) UNAME_MACHINE=alphaev67 ;; + EV68*) UNAME_MACHINE=alphaev68 ;; + esac + objdump --private-headers /bin/sh | grep ld.so.1 >/dev/null + if test "$?" = 0 ; then LIBC="libc1" ; else LIBC="" ; fi + echo ${UNAME_MACHINE}-unknown-linux-gnu${LIBC} + exit ;; + parisc:Linux:*:* | hppa:Linux:*:*) + # Look for CPU level + case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in + PA7*) echo hppa1.1-unknown-linux-gnu ;; + PA8*) echo hppa2.0-unknown-linux-gnu ;; + *) echo hppa-unknown-linux-gnu ;; + esac + exit ;; + parisc64:Linux:*:* | hppa64:Linux:*:*) + echo hppa64-unknown-linux-gnu + exit ;; + s390:Linux:*:* | s390x:Linux:*:*) + echo ${UNAME_MACHINE}-ibm-linux + exit ;; + sh64*:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + sh*:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + sparc:Linux:*:* | sparc64:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + vax:Linux:*:*) + echo ${UNAME_MACHINE}-dec-linux-gnu + exit ;; + x86_64:Linux:*:*) + echo x86_64-unknown-linux-gnu + exit ;; + xtensa*:Linux:*:*) + echo ${UNAME_MACHINE}-unknown-linux-gnu + exit ;; + i*86:Linux:*:*) + # The BFD linker knows what the default object file format is, so + # first see if it will tell us. cd to the root directory to prevent + # problems with other programs or directories called `ld' in the path. + # Set LC_ALL=C to ensure ld outputs messages in English. + ld_supported_targets=`cd /; LC_ALL=C ld --help 2>&1 \ + | sed -ne '/supported targets:/!d + s/[ ][ ]*/ /g + s/.*supported targets: *// + s/ .*// + p'` + case "$ld_supported_targets" in + elf32-i386) + TENTATIVE="${UNAME_MACHINE}-pc-linux-gnu" + ;; + a.out-i386-linux) + echo "${UNAME_MACHINE}-pc-linux-gnuaout" + exit ;; + coff-i386) + echo "${UNAME_MACHINE}-pc-linux-gnucoff" + exit ;; + "") + # Either a pre-BFD a.out linker (linux-gnuoldld) or + # one that does not give us useful --help. + echo "${UNAME_MACHINE}-pc-linux-gnuoldld" + exit ;; + esac + # Determine whether the default compiler is a.out or elf + eval $set_cc_for_build + sed 's/^ //' << EOF >$dummy.c + #include + #ifdef __ELF__ + # ifdef __GLIBC__ + # if __GLIBC__ >= 2 + LIBC=gnu + # else + LIBC=gnulibc1 + # endif + # else + LIBC=gnulibc1 + # endif + #else + #if defined(__INTEL_COMPILER) || defined(__PGI) || defined(__SUNPRO_C) || defined(__SUNPRO_CC) + LIBC=gnu + #else + LIBC=gnuaout + #endif + #endif + #ifdef __dietlibc__ + LIBC=dietlibc + #endif +EOF + eval "`$CC_FOR_BUILD -E $dummy.c 2>/dev/null | sed -n ' + /^LIBC/{ + s: ::g + p + }'`" + test x"${LIBC}" != x && { + echo "${UNAME_MACHINE}-pc-linux-${LIBC}" + exit + } + test x"${TENTATIVE}" != x && { echo "${TENTATIVE}"; exit; } + ;; + i*86:DYNIX/ptx:4*:*) + # ptx 4.0 does uname -s correctly, with DYNIX/ptx in there. + # earlier versions are messed up and put the nodename in both + # sysname and nodename. + echo i386-sequent-sysv4 + exit ;; + i*86:UNIX_SV:4.2MP:2.*) + # Unixware is an offshoot of SVR4, but it has its own version + # number series starting with 2... + # I am not positive that other SVR4 systems won't match this, + # I just have to hope. -- rms. + # Use sysv4.2uw... so that sysv4* matches it. + echo ${UNAME_MACHINE}-pc-sysv4.2uw${UNAME_VERSION} + exit ;; + i*86:OS/2:*:*) + # If we were able to find `uname', then EMX Unix compatibility + # is probably installed. + echo ${UNAME_MACHINE}-pc-os2-emx + exit ;; + i*86:XTS-300:*:STOP) + echo ${UNAME_MACHINE}-unknown-stop + exit ;; + i*86:atheos:*:*) + echo ${UNAME_MACHINE}-unknown-atheos + exit ;; + i*86:syllable:*:*) + echo ${UNAME_MACHINE}-pc-syllable + exit ;; + i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.0*:*) + echo i386-unknown-lynxos${UNAME_RELEASE} + exit ;; + i*86:*DOS:*:*) + echo ${UNAME_MACHINE}-pc-msdosdjgpp + exit ;; + i*86:*:4.*:* | i*86:SYSTEM_V:4.*:*) + UNAME_REL=`echo ${UNAME_RELEASE} | sed 's/\/MP$//'` + if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then + echo ${UNAME_MACHINE}-univel-sysv${UNAME_REL} + else + echo ${UNAME_MACHINE}-pc-sysv${UNAME_REL} + fi + exit ;; + i*86:*:5:[678]*) + # UnixWare 7.x, OpenUNIX and OpenServer 6. + case `/bin/uname -X | grep "^Machine"` in + *486*) UNAME_MACHINE=i486 ;; + *Pentium) UNAME_MACHINE=i586 ;; + *Pent*|*Celeron) UNAME_MACHINE=i686 ;; + esac + echo ${UNAME_MACHINE}-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION} + exit ;; + i*86:*:3.2:*) + if test -f /usr/options/cb.name; then + UNAME_REL=`sed -n 's/.*Version //p' /dev/null >/dev/null ; then + UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')` + (/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486 + (/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \ + && UNAME_MACHINE=i586 + (/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \ + && UNAME_MACHINE=i686 + (/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \ + && UNAME_MACHINE=i686 + echo ${UNAME_MACHINE}-pc-sco$UNAME_REL + else + echo ${UNAME_MACHINE}-pc-sysv32 + fi + exit ;; + pc:*:*:*) + # Left here for compatibility: + # uname -m prints for DJGPP always 'pc', but it prints nothing about + # the processor, so we play safe by assuming i386. + echo i386-pc-msdosdjgpp + exit ;; + Intel:Mach:3*:*) + echo i386-pc-mach3 + exit ;; + paragon:*:*:*) + echo i860-intel-osf1 + exit ;; + i860:*:4.*:*) # i860-SVR4 + if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then + echo i860-stardent-sysv${UNAME_RELEASE} # Stardent Vistra i860-SVR4 + else # Add other i860-SVR4 vendors below as they are discovered. + echo i860-unknown-sysv${UNAME_RELEASE} # Unknown i860-SVR4 + fi + exit ;; + mini*:CTIX:SYS*5:*) + # "miniframe" + echo m68010-convergent-sysv + exit ;; + mc68k:UNIX:SYSTEM5:3.51m) + echo m68k-convergent-sysv + exit ;; + M680?0:D-NIX:5.3:*) + echo m68k-diab-dnix + exit ;; + M68*:*:R3V[5678]*:*) + test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;; + 3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0) + OS_REL='' + test -r /etc/.relid \ + && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid` + /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ + && { echo i486-ncr-sysv4.3${OS_REL}; exit; } + /bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \ + && { echo i586-ncr-sysv4.3${OS_REL}; exit; } ;; + 3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*) + /bin/uname -p 2>/dev/null | grep 86 >/dev/null \ + && { echo i486-ncr-sysv4; exit; } ;; + m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*) + echo m68k-unknown-lynxos${UNAME_RELEASE} + exit ;; + mc68030:UNIX_System_V:4.*:*) + echo m68k-atari-sysv4 + exit ;; + TSUNAMI:LynxOS:2.*:*) + echo sparc-unknown-lynxos${UNAME_RELEASE} + exit ;; + rs6000:LynxOS:2.*:*) + echo rs6000-unknown-lynxos${UNAME_RELEASE} + exit ;; + PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.0*:*) + echo powerpc-unknown-lynxos${UNAME_RELEASE} + exit ;; + SM[BE]S:UNIX_SV:*:*) + echo mips-dde-sysv${UNAME_RELEASE} + exit ;; + RM*:ReliantUNIX-*:*:*) + echo mips-sni-sysv4 + exit ;; + RM*:SINIX-*:*:*) + echo mips-sni-sysv4 + exit ;; + *:SINIX-*:*:*) + if uname -p 2>/dev/null >/dev/null ; then + UNAME_MACHINE=`(uname -p) 2>/dev/null` + echo ${UNAME_MACHINE}-sni-sysv4 + else + echo ns32k-sni-sysv + fi + exit ;; + PENTIUM:*:4.0*:*) # Unisys `ClearPath HMP IX 4000' SVR4/MP effort + # says + echo i586-unisys-sysv4 + exit ;; + *:UNIX_System_V:4*:FTX*) + # From Gerald Hewes . + # How about differentiating between stratus architectures? -djm + echo hppa1.1-stratus-sysv4 + exit ;; + *:*:*:FTX*) + # From seanf@swdc.stratus.com. + echo i860-stratus-sysv4 + exit ;; + i*86:VOS:*:*) + # From Paul.Green@stratus.com. + echo ${UNAME_MACHINE}-stratus-vos + exit ;; + *:VOS:*:*) + # From Paul.Green@stratus.com. + echo hppa1.1-stratus-vos + exit ;; + mc68*:A/UX:*:*) + echo m68k-apple-aux${UNAME_RELEASE} + exit ;; + news*:NEWS-OS:6*:*) + echo mips-sony-newsos6 + exit ;; + R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*) + if [ -d /usr/nec ]; then + echo mips-nec-sysv${UNAME_RELEASE} + else + echo mips-unknown-sysv${UNAME_RELEASE} + fi + exit ;; + BeBox:BeOS:*:*) # BeOS running on hardware made by Be, PPC only. + echo powerpc-be-beos + exit ;; + BeMac:BeOS:*:*) # BeOS running on Mac or Mac clone, PPC only. + echo powerpc-apple-beos + exit ;; + BePC:BeOS:*:*) # BeOS running on Intel PC compatible. + echo i586-pc-beos + exit ;; + SX-4:SUPER-UX:*:*) + echo sx4-nec-superux${UNAME_RELEASE} + exit ;; + SX-5:SUPER-UX:*:*) + echo sx5-nec-superux${UNAME_RELEASE} + exit ;; + SX-6:SUPER-UX:*:*) + echo sx6-nec-superux${UNAME_RELEASE} + exit ;; + SX-7:SUPER-UX:*:*) + echo sx7-nec-superux${UNAME_RELEASE} + exit ;; + SX-8:SUPER-UX:*:*) + echo sx8-nec-superux${UNAME_RELEASE} + exit ;; + SX-8R:SUPER-UX:*:*) + echo sx8r-nec-superux${UNAME_RELEASE} + exit ;; + Power*:Rhapsody:*:*) + echo powerpc-apple-rhapsody${UNAME_RELEASE} + exit ;; + *:Rhapsody:*:*) + echo ${UNAME_MACHINE}-apple-rhapsody${UNAME_RELEASE} + exit ;; + *:Darwin:*:*) + UNAME_PROCESSOR=`uname -p` || UNAME_PROCESSOR=unknown + case $UNAME_PROCESSOR in + unknown) UNAME_PROCESSOR=powerpc ;; + esac + echo ${UNAME_PROCESSOR}-apple-darwin${UNAME_RELEASE} + exit ;; + *:procnto*:*:* | *:QNX:[0123456789]*:*) + UNAME_PROCESSOR=`uname -p` + if test "$UNAME_PROCESSOR" = "x86"; then + UNAME_PROCESSOR=i386 + UNAME_MACHINE=pc + fi + echo ${UNAME_PROCESSOR}-${UNAME_MACHINE}-nto-qnx${UNAME_RELEASE} + exit ;; + *:QNX:*:4*) + echo i386-pc-qnx + exit ;; + NSE-?:NONSTOP_KERNEL:*:*) + echo nse-tandem-nsk${UNAME_RELEASE} + exit ;; + NSR-?:NONSTOP_KERNEL:*:*) + echo nsr-tandem-nsk${UNAME_RELEASE} + exit ;; + *:NonStop-UX:*:*) + echo mips-compaq-nonstopux + exit ;; + BS2000:POSIX*:*:*) + echo bs2000-siemens-sysv + exit ;; + DS/*:UNIX_System_V:*:*) + echo ${UNAME_MACHINE}-${UNAME_SYSTEM}-${UNAME_RELEASE} + exit ;; + *:Plan9:*:*) + # "uname -m" is not consistent, so use $cputype instead. 386 + # is converted to i386 for consistency with other x86 + # operating systems. + if test "$cputype" = "386"; then + UNAME_MACHINE=i386 + else + UNAME_MACHINE="$cputype" + fi + echo ${UNAME_MACHINE}-unknown-plan9 + exit ;; + *:TOPS-10:*:*) + echo pdp10-unknown-tops10 + exit ;; + *:TENEX:*:*) + echo pdp10-unknown-tenex + exit ;; + KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*) + echo pdp10-dec-tops20 + exit ;; + XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*) + echo pdp10-xkl-tops20 + exit ;; + *:TOPS-20:*:*) + echo pdp10-unknown-tops20 + exit ;; + *:ITS:*:*) + echo pdp10-unknown-its + exit ;; + SEI:*:*:SEIUX) + echo mips-sei-seiux${UNAME_RELEASE} + exit ;; + *:DragonFly:*:*) + echo ${UNAME_MACHINE}-unknown-dragonfly`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'` + exit ;; + *:*VMS:*:*) + UNAME_MACHINE=`(uname -p) 2>/dev/null` + case "${UNAME_MACHINE}" in + A*) echo alpha-dec-vms ; exit ;; + I*) echo ia64-dec-vms ; exit ;; + V*) echo vax-dec-vms ; exit ;; + esac ;; + *:XENIX:*:SysV) + echo i386-pc-xenix + exit ;; + i*86:skyos:*:*) + echo ${UNAME_MACHINE}-pc-skyos`echo ${UNAME_RELEASE}` | sed -e 's/ .*$//' + exit ;; + i*86:rdos:*:*) + echo ${UNAME_MACHINE}-pc-rdos + exit ;; +esac + +#echo '(No uname command or uname output not recognized.)' 1>&2 +#echo "${UNAME_MACHINE}:${UNAME_SYSTEM}:${UNAME_RELEASE}:${UNAME_VERSION}" 1>&2 + +eval $set_cc_for_build +cat >$dummy.c < +# include +#endif +main () +{ +#if defined (sony) +#if defined (MIPSEB) + /* BFD wants "bsd" instead of "newsos". Perhaps BFD should be changed, + I don't know.... */ + printf ("mips-sony-bsd\n"); exit (0); +#else +#include + printf ("m68k-sony-newsos%s\n", +#ifdef NEWSOS4 + "4" +#else + "" +#endif + ); exit (0); +#endif +#endif + +#if defined (__arm) && defined (__acorn) && defined (__unix) + printf ("arm-acorn-riscix\n"); exit (0); +#endif + +#if defined (hp300) && !defined (hpux) + printf ("m68k-hp-bsd\n"); exit (0); +#endif + +#if defined (NeXT) +#if !defined (__ARCHITECTURE__) +#define __ARCHITECTURE__ "m68k" +#endif + int version; + version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`; + if (version < 4) + printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version); + else + printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version); + exit (0); +#endif + +#if defined (MULTIMAX) || defined (n16) +#if defined (UMAXV) + printf ("ns32k-encore-sysv\n"); exit (0); +#else +#if defined (CMU) + printf ("ns32k-encore-mach\n"); exit (0); +#else + printf ("ns32k-encore-bsd\n"); exit (0); +#endif +#endif +#endif + +#if defined (__386BSD__) + printf ("i386-pc-bsd\n"); exit (0); +#endif + +#if defined (sequent) +#if defined (i386) + printf ("i386-sequent-dynix\n"); exit (0); +#endif +#if defined (ns32000) + printf ("ns32k-sequent-dynix\n"); exit (0); +#endif +#endif + +#if defined (_SEQUENT_) + struct utsname un; + + uname(&un); + + if (strncmp(un.version, "V2", 2) == 0) { + printf ("i386-sequent-ptx2\n"); exit (0); + } + if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */ + printf ("i386-sequent-ptx1\n"); exit (0); + } + printf ("i386-sequent-ptx\n"); exit (0); + +#endif + +#if defined (vax) +# if !defined (ultrix) +# include +# if defined (BSD) +# if BSD == 43 + printf ("vax-dec-bsd4.3\n"); exit (0); +# else +# if BSD == 199006 + printf ("vax-dec-bsd4.3reno\n"); exit (0); +# else + printf ("vax-dec-bsd\n"); exit (0); +# endif +# endif +# else + printf ("vax-dec-bsd\n"); exit (0); +# endif +# else + printf ("vax-dec-ultrix\n"); exit (0); +# endif +#endif + +#if defined (alliant) && defined (i860) + printf ("i860-alliant-bsd\n"); exit (0); +#endif + + exit (1); +} +EOF + +$CC_FOR_BUILD -o $dummy $dummy.c 2>/dev/null && SYSTEM_NAME=`$dummy` && + { echo "$SYSTEM_NAME"; exit; } + +# Apollos put the system type in the environment. + +test -d /usr/apollo && { echo ${ISP}-apollo-${SYSTYPE}; exit; } + +# Convex versions that predate uname can use getsysinfo(1) + +if [ -x /usr/convex/getsysinfo ] +then + case `getsysinfo -f cpu_type` in + c1*) + echo c1-convex-bsd + exit ;; + c2*) + if getsysinfo -f scalar_acc + then echo c32-convex-bsd + else echo c2-convex-bsd + fi + exit ;; + c34*) + echo c34-convex-bsd + exit ;; + c38*) + echo c38-convex-bsd + exit ;; + c4*) + echo c4-convex-bsd + exit ;; + esac +fi + +cat >&2 < in order to provide the needed +information to handle your system. + +config.guess timestamp = $timestamp + +uname -m = `(uname -m) 2>/dev/null || echo unknown` +uname -r = `(uname -r) 2>/dev/null || echo unknown` +uname -s = `(uname -s) 2>/dev/null || echo unknown` +uname -v = `(uname -v) 2>/dev/null || echo unknown` + +/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null` +/bin/uname -X = `(/bin/uname -X) 2>/dev/null` + +hostinfo = `(hostinfo) 2>/dev/null` +/bin/universe = `(/bin/universe) 2>/dev/null` +/usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null` +/bin/arch = `(/bin/arch) 2>/dev/null` +/usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null` +/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null` + +UNAME_MACHINE = ${UNAME_MACHINE} +UNAME_RELEASE = ${UNAME_RELEASE} +UNAME_SYSTEM = ${UNAME_SYSTEM} +UNAME_VERSION = ${UNAME_VERSION} +EOF + +exit 1 + +# Local variables: +# eval: (add-hook 'write-file-hooks 'time-stamp) +# time-stamp-start: "timestamp='" +# time-stamp-format: "%:y-%02m-%02d" +# time-stamp-end: "'" +# End: Index: vis_dev/vis-2.3/helpers/config.sub =================================================================== --- vis_dev/vis-2.3/helpers/config.sub (revision 14) +++ vis_dev/vis-2.3/helpers/config.sub (revision 14) @@ -0,0 +1,1658 @@ +#! /bin/sh +# Configuration validation subroutine script. +# Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, +# 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 +# Free Software Foundation, Inc. + +timestamp='2008-01-16' + +# This file is (in principle) common to ALL GNU software. +# The presence of a machine in this file suggests that SOME GNU software +# can handle that machine. It does not imply ALL GNU software can. +# +# This file 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 of the License, 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, Inc., 51 Franklin Street - Fifth Floor, Boston, MA +# 02110-1301, USA. +# +# As a special exception to the GNU General Public License, if you +# distribute this file as part of a program that contains a +# configuration script generated by Autoconf, you may include it under +# the same distribution terms that you use for the rest of that program. + + +# Please send patches to . Submit a context +# diff and a properly formatted ChangeLog entry. +# +# Configuration subroutine to validate and canonicalize a configuration type. +# Supply the specified configuration type as an argument. +# If it is invalid, we print an error message on stderr and exit with code 1. +# Otherwise, we print the canonical config type on stdout and succeed. + +# This file is supposed to be the same for all GNU packages +# and recognize all the CPU types, system types and aliases +# that are meaningful with *any* GNU software. +# Each package is responsible for reporting which valid configurations +# it does not support. The user should be able to distinguish +# a failure to support a valid configuration from a meaningless +# configuration. + +# The goal of this file is to map all the various variations of a given +# machine specification into a single specification in the form: +# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM +# or in some cases, the newer four-part form: +# CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM +# It is wrong to echo any other type of specification. + +me=`echo "$0" | sed -e 's,.*/,,'` + +usage="\ +Usage: $0 [OPTION] CPU-MFR-OPSYS + $0 [OPTION] ALIAS + +Canonicalize a configuration name. + +Operation modes: + -h, --help print this help, then exit + -t, --time-stamp print date of last modification, then exit + -v, --version print version number, then exit + +Report bugs and patches to ." + +version="\ +GNU config.sub ($timestamp) + +Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, +2002, 2003, 2004, 2005, 2006, 2007, 2008 Free Software Foundation, Inc. + +This is free software; see the source for copying conditions. There is NO +warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE." + +help=" +Try \`$me --help' for more information." + +# Parse command line +while test $# -gt 0 ; do + case $1 in + --time-stamp | --time* | -t ) + echo "$timestamp" ; exit ;; + --version | -v ) + echo "$version" ; exit ;; + --help | --h* | -h ) + echo "$usage"; exit ;; + -- ) # Stop option processing + shift; break ;; + - ) # Use stdin as input. + break ;; + -* ) + echo "$me: invalid option $1$help" + exit 1 ;; + + *local*) + # First pass through any local machine types. + echo $1 + exit ;; + + * ) + break ;; + esac +done + +case $# in + 0) echo "$me: missing argument$help" >&2 + exit 1;; + 1) ;; + *) echo "$me: too many arguments$help" >&2 + exit 1;; +esac + +# Separate what the user gave into CPU-COMPANY and OS or KERNEL-OS (if any). +# Here we must recognize all the valid KERNEL-OS combinations. +maybe_os=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\2/'` +case $maybe_os in + nto-qnx* | linux-gnu* | linux-dietlibc | linux-newlib* | linux-uclibc* | \ + uclinux-uclibc* | uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* | \ + storm-chaos* | os2-emx* | rtmk-nova*) + os=-$maybe_os + basic_machine=`echo $1 | sed 's/^\(.*\)-\([^-]*-[^-]*\)$/\1/'` + ;; + *) + basic_machine=`echo $1 | sed 's/-[^-]*$//'` + if [ $basic_machine != $1 ] + then os=`echo $1 | sed 's/.*-/-/'` + else os=; fi + ;; +esac + +### Let's recognize common machines as not being operating systems so +### that things like config.sub decstation-3100 work. We also +### recognize some manufacturers as not being operating systems, so we +### can provide default operating systems below. +case $os in + -sun*os*) + # Prevent following clause from handling this invalid input. + ;; + -dec* | -mips* | -sequent* | -encore* | -pc532* | -sgi* | -sony* | \ + -att* | -7300* | -3300* | -delta* | -motorola* | -sun[234]* | \ + -unicom* | -ibm* | -next | -hp | -isi* | -apollo | -altos* | \ + -convergent* | -ncr* | -news | -32* | -3600* | -3100* | -hitachi* |\ + -c[123]* | -convex* | -sun | -crds | -omron* | -dg | -ultra | -tti* | \ + -harris | -dolphin | -highlevel | -gould | -cbm | -ns | -masscomp | \ + -apple | -axis | -knuth | -cray) + os= + basic_machine=$1 + ;; + -sim | -cisco | -oki | -wec | -winbond) + os= + basic_machine=$1 + ;; + -scout) + ;; + -wrs) + os=-vxworks + basic_machine=$1 + ;; + -chorusos*) + os=-chorusos + basic_machine=$1 + ;; + -chorusrdb) + os=-chorusrdb + basic_machine=$1 + ;; + -hiux*) + os=-hiuxwe2 + ;; + -sco6) + os=-sco5v6 + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -sco5) + os=-sco3.2v5 + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -sco4) + os=-sco3.2v4 + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -sco3.2.[4-9]*) + os=`echo $os | sed -e 's/sco3.2./sco3.2v/'` + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -sco3.2v[4-9]*) + # Don't forget version if it is 3.2v4 or newer. + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -sco5v6*) + # Don't forget version if it is 3.2v4 or newer. + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -sco*) + os=-sco3.2v2 + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -udk*) + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -isc) + os=-isc2.2 + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -clix*) + basic_machine=clipper-intergraph + ;; + -isc*) + basic_machine=`echo $1 | sed -e 's/86-.*/86-pc/'` + ;; + -lynx*) + os=-lynxos + ;; + -ptx*) + basic_machine=`echo $1 | sed -e 's/86-.*/86-sequent/'` + ;; + -windowsnt*) + os=`echo $os | sed -e 's/windowsnt/winnt/'` + ;; + -psos*) + os=-psos + ;; + -mint | -mint[0-9]*) + basic_machine=m68k-atari + os=-mint + ;; +esac + +# Decode aliases for certain CPU-COMPANY combinations. +case $basic_machine in + # Recognize the basic CPU types without company name. + # Some are omitted here because they have special meanings below. + 1750a | 580 \ + | a29k \ + | alpha | alphaev[4-8] | alphaev56 | alphaev6[78] | alphapca5[67] \ + | alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] | alpha64pca5[67] \ + | am33_2.0 \ + | arc | arm | arm[bl]e | arme[lb] | armv[2345] | armv[345][lb] | avr | avr32 \ + | bfin \ + | c4x | clipper \ + | d10v | d30v | dlx | dsp16xx \ + | fido | fr30 | frv \ + | h8300 | h8500 | hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \ + | i370 | i860 | i960 | ia64 \ + | ip2k | iq2000 \ + | m32c | m32r | m32rle | m68000 | m68k | m88k \ + | maxq | mb | microblaze | mcore | mep \ + | mips | mipsbe | mipseb | mipsel | mipsle \ + | mips16 \ + | mips64 | mips64el \ + | mips64vr | mips64vrel \ + | mips64orion | mips64orionel \ + | mips64vr4100 | mips64vr4100el \ + | mips64vr4300 | mips64vr4300el \ + | mips64vr5000 | mips64vr5000el \ + | mips64vr5900 | mips64vr5900el \ + | mipsisa32 | mipsisa32el \ + | mipsisa32r2 | mipsisa32r2el \ + | mipsisa64 | mipsisa64el \ + | mipsisa64r2 | mipsisa64r2el \ + | mipsisa64sb1 | mipsisa64sb1el \ + | mipsisa64sr71k | mipsisa64sr71kel \ + | mipstx39 | mipstx39el \ + | mn10200 | mn10300 \ + | mt \ + | msp430 \ + | nios | nios2 \ + | ns16k | ns32k \ + | or32 \ + | pdp10 | pdp11 | pj | pjl \ + | powerpc | powerpc64 | powerpc64le | powerpcle | ppcbe \ + | pyramid \ + | score \ + | sh | sh[1234] | sh[24]a | sh[23]e | sh[34]eb | sheb | shbe | shle | sh[1234]le | sh3ele \ + | sh64 | sh64le \ + | sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet | sparclite \ + | sparcv8 | sparcv9 | sparcv9b | sparcv9v \ + | spu | strongarm \ + | tahoe | thumb | tic4x | tic80 | tron \ + | v850 | v850e \ + | we32k \ + | x86 | xc16x | xscale | xscalee[bl] | xstormy16 | xtensa \ + | z8k) + basic_machine=$basic_machine-unknown + ;; + m6811 | m68hc11 | m6812 | m68hc12) + # Motorola 68HC11/12. + basic_machine=$basic_machine-unknown + os=-none + ;; + m88110 | m680[12346]0 | m683?2 | m68360 | m5200 | v70 | w65 | z8k) + ;; + ms1) + basic_machine=mt-unknown + ;; + + # We use `pc' rather than `unknown' + # because (1) that's what they normally are, and + # (2) the word "unknown" tends to confuse beginning users. + i*86 | x86_64) + basic_machine=$basic_machine-pc + ;; + # Object if more than one company name word. + *-*-*) + echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 + exit 1 + ;; + # Recognize the basic CPU types with company name. + 580-* \ + | a29k-* \ + | alpha-* | alphaev[4-8]-* | alphaev56-* | alphaev6[78]-* \ + | alpha64-* | alpha64ev[4-8]-* | alpha64ev56-* | alpha64ev6[78]-* \ + | alphapca5[67]-* | alpha64pca5[67]-* | arc-* \ + | arm-* | armbe-* | armle-* | armeb-* | armv*-* \ + | avr-* | avr32-* \ + | bfin-* | bs2000-* \ + | c[123]* | c30-* | [cjt]90-* | c4x-* | c54x-* | c55x-* | c6x-* \ + | clipper-* | craynv-* | cydra-* \ + | d10v-* | d30v-* | dlx-* \ + | elxsi-* \ + | f30[01]-* | f700-* | fido-* | fr30-* | frv-* | fx80-* \ + | h8300-* | h8500-* \ + | hppa-* | hppa1.[01]-* | hppa2.0-* | hppa2.0[nw]-* | hppa64-* \ + | i*86-* | i860-* | i960-* | ia64-* \ + | ip2k-* | iq2000-* \ + | m32c-* | m32r-* | m32rle-* \ + | m68000-* | m680[012346]0-* | m68360-* | m683?2-* | m68k-* \ + | m88110-* | m88k-* | maxq-* | mcore-* \ + | mips-* | mipsbe-* | mipseb-* | mipsel-* | mipsle-* \ + | mips16-* \ + | mips64-* | mips64el-* \ + | mips64vr-* | mips64vrel-* \ + | mips64orion-* | mips64orionel-* \ + | mips64vr4100-* | mips64vr4100el-* \ + | mips64vr4300-* | mips64vr4300el-* \ + | mips64vr5000-* | mips64vr5000el-* \ + | mips64vr5900-* | mips64vr5900el-* \ + | mipsisa32-* | mipsisa32el-* \ + | mipsisa32r2-* | mipsisa32r2el-* \ + | mipsisa64-* | mipsisa64el-* \ + | mipsisa64r2-* | mipsisa64r2el-* \ + | mipsisa64sb1-* | mipsisa64sb1el-* \ + | mipsisa64sr71k-* | mipsisa64sr71kel-* \ + | mipstx39-* | mipstx39el-* \ + | mmix-* \ + | mt-* \ + | msp430-* \ + | nios-* | nios2-* \ + | none-* | np1-* | ns16k-* | ns32k-* \ + | orion-* \ + | pdp10-* | pdp11-* | pj-* | pjl-* | pn-* | power-* \ + | powerpc-* | powerpc64-* | powerpc64le-* | powerpcle-* | ppcbe-* \ + | pyramid-* \ + | romp-* | rs6000-* \ + | sh-* | sh[1234]-* | sh[24]a-* | sh[23]e-* | sh[34]eb-* | sheb-* | shbe-* \ + | shle-* | sh[1234]le-* | sh3ele-* | sh64-* | sh64le-* \ + | sparc-* | sparc64-* | sparc64b-* | sparc64v-* | sparc86x-* | sparclet-* \ + | sparclite-* \ + | sparcv8-* | sparcv9-* | sparcv9b-* | sparcv9v-* | strongarm-* | sv1-* | sx?-* \ + | tahoe-* | thumb-* \ + | tic30-* | tic4x-* | tic54x-* | tic55x-* | tic6x-* | tic80-* \ + | tron-* \ + | v850-* | v850e-* | vax-* \ + | we32k-* \ + | x86-* | x86_64-* | xc16x-* | xps100-* | xscale-* | xscalee[bl]-* \ + | xstormy16-* | xtensa*-* \ + | ymp-* \ + | z8k-*) + ;; + # Recognize the basic CPU types without company name, with glob match. + xtensa*) + basic_machine=$basic_machine-unknown + ;; + # Recognize the various machine names and aliases which stand + # for a CPU type and a company and sometimes even an OS. + 386bsd) + basic_machine=i386-unknown + os=-bsd + ;; + 3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc) + basic_machine=m68000-att + ;; + 3b*) + basic_machine=we32k-att + ;; + a29khif) + basic_machine=a29k-amd + os=-udi + ;; + abacus) + basic_machine=abacus-unknown + ;; + adobe68k) + basic_machine=m68010-adobe + os=-scout + ;; + alliant | fx80) + basic_machine=fx80-alliant + ;; + altos | altos3068) + basic_machine=m68k-altos + ;; + am29k) + basic_machine=a29k-none + os=-bsd + ;; + amd64) + basic_machine=x86_64-pc + ;; + amd64-*) + basic_machine=x86_64-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + amdahl) + basic_machine=580-amdahl + os=-sysv + ;; + amiga | amiga-*) + basic_machine=m68k-unknown + ;; + amigaos | amigados) + basic_machine=m68k-unknown + os=-amigaos + ;; + amigaunix | amix) + basic_machine=m68k-unknown + os=-sysv4 + ;; + apollo68) + basic_machine=m68k-apollo + os=-sysv + ;; + apollo68bsd) + basic_machine=m68k-apollo + os=-bsd + ;; + aux) + basic_machine=m68k-apple + os=-aux + ;; + balance) + basic_machine=ns32k-sequent + os=-dynix + ;; + blackfin) + basic_machine=bfin-unknown + os=-linux + ;; + blackfin-*) + basic_machine=bfin-`echo $basic_machine | sed 's/^[^-]*-//'` + os=-linux + ;; + c90) + basic_machine=c90-cray + os=-unicos + ;; + convex-c1) + basic_machine=c1-convex + os=-bsd + ;; + convex-c2) + basic_machine=c2-convex + os=-bsd + ;; + convex-c32) + basic_machine=c32-convex + os=-bsd + ;; + convex-c34) + basic_machine=c34-convex + os=-bsd + ;; + convex-c38) + basic_machine=c38-convex + os=-bsd + ;; + cray | j90) + basic_machine=j90-cray + os=-unicos + ;; + craynv) + basic_machine=craynv-cray + os=-unicosmp + ;; + cr16) + basic_machine=cr16-unknown + os=-elf + ;; + crds | unos) + basic_machine=m68k-crds + ;; + crisv32 | crisv32-* | etraxfs*) + basic_machine=crisv32-axis + ;; + cris | cris-* | etrax*) + basic_machine=cris-axis + ;; + crx) + basic_machine=crx-unknown + os=-elf + ;; + da30 | da30-*) + basic_machine=m68k-da30 + ;; + decstation | decstation-3100 | pmax | pmax-* | pmin | dec3100 | decstatn) + basic_machine=mips-dec + ;; + decsystem10* | dec10*) + basic_machine=pdp10-dec + os=-tops10 + ;; + decsystem20* | dec20*) + basic_machine=pdp10-dec + os=-tops20 + ;; + delta | 3300 | motorola-3300 | motorola-delta \ + | 3300-motorola | delta-motorola) + basic_machine=m68k-motorola + ;; + delta88) + basic_machine=m88k-motorola + os=-sysv3 + ;; + djgpp) + basic_machine=i586-pc + os=-msdosdjgpp + ;; + dpx20 | dpx20-*) + basic_machine=rs6000-bull + os=-bosx + ;; + dpx2* | dpx2*-bull) + basic_machine=m68k-bull + os=-sysv3 + ;; + ebmon29k) + basic_machine=a29k-amd + os=-ebmon + ;; + elxsi) + basic_machine=elxsi-elxsi + os=-bsd + ;; + encore | umax | mmax) + basic_machine=ns32k-encore + ;; + es1800 | OSE68k | ose68k | ose | OSE) + basic_machine=m68k-ericsson + os=-ose + ;; + fx2800) + basic_machine=i860-alliant + ;; + genix) + basic_machine=ns32k-ns + ;; + gmicro) + basic_machine=tron-gmicro + os=-sysv + ;; + go32) + basic_machine=i386-pc + os=-go32 + ;; + h3050r* | hiux*) + basic_machine=hppa1.1-hitachi + os=-hiuxwe2 + ;; + h8300hms) + basic_machine=h8300-hitachi + os=-hms + ;; + h8300xray) + basic_machine=h8300-hitachi + os=-xray + ;; + h8500hms) + basic_machine=h8500-hitachi + os=-hms + ;; + harris) + basic_machine=m88k-harris + os=-sysv3 + ;; + hp300-*) + basic_machine=m68k-hp + ;; + hp300bsd) + basic_machine=m68k-hp + os=-bsd + ;; + hp300hpux) + basic_machine=m68k-hp + os=-hpux + ;; + hp3k9[0-9][0-9] | hp9[0-9][0-9]) + basic_machine=hppa1.0-hp + ;; + hp9k2[0-9][0-9] | hp9k31[0-9]) + basic_machine=m68000-hp + ;; + hp9k3[2-9][0-9]) + basic_machine=m68k-hp + ;; + hp9k6[0-9][0-9] | hp6[0-9][0-9]) + basic_machine=hppa1.0-hp + ;; + hp9k7[0-79][0-9] | hp7[0-79][0-9]) + basic_machine=hppa1.1-hp + ;; + hp9k78[0-9] | hp78[0-9]) + # FIXME: really hppa2.0-hp + basic_machine=hppa1.1-hp + ;; + hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893) + # FIXME: really hppa2.0-hp + basic_machine=hppa1.1-hp + ;; + hp9k8[0-9][13679] | hp8[0-9][13679]) + basic_machine=hppa1.1-hp + ;; + hp9k8[0-9][0-9] | hp8[0-9][0-9]) + basic_machine=hppa1.0-hp + ;; + hppa-next) + os=-nextstep3 + ;; + hppaosf) + basic_machine=hppa1.1-hp + os=-osf + ;; + hppro) + basic_machine=hppa1.1-hp + os=-proelf + ;; + i370-ibm* | ibm*) + basic_machine=i370-ibm + ;; +# I'm not sure what "Sysv32" means. Should this be sysv3.2? + i*86v32) + basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` + os=-sysv32 + ;; + i*86v4*) + basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` + os=-sysv4 + ;; + i*86v) + basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` + os=-sysv + ;; + i*86sol2) + basic_machine=`echo $1 | sed -e 's/86.*/86-pc/'` + os=-solaris2 + ;; + i386mach) + basic_machine=i386-mach + os=-mach + ;; + i386-vsta | vsta) + basic_machine=i386-unknown + os=-vsta + ;; + iris | iris4d) + basic_machine=mips-sgi + case $os in + -irix*) + ;; + *) + os=-irix4 + ;; + esac + ;; + isi68 | isi) + basic_machine=m68k-isi + os=-sysv + ;; + m68knommu) + basic_machine=m68k-unknown + os=-linux + ;; + m68knommu-*) + basic_machine=m68k-`echo $basic_machine | sed 's/^[^-]*-//'` + os=-linux + ;; + m88k-omron*) + basic_machine=m88k-omron + ;; + magnum | m3230) + basic_machine=mips-mips + os=-sysv + ;; + merlin) + basic_machine=ns32k-utek + os=-sysv + ;; + mingw32) + basic_machine=i386-pc + os=-mingw32 + ;; + mingw32ce) + basic_machine=arm-unknown + os=-mingw32ce + ;; + miniframe) + basic_machine=m68000-convergent + ;; + *mint | -mint[0-9]* | *MiNT | *MiNT[0-9]*) + basic_machine=m68k-atari + os=-mint + ;; + mips3*-*) + basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'` + ;; + mips3*) + basic_machine=`echo $basic_machine | sed -e 's/mips3/mips64/'`-unknown + ;; + monitor) + basic_machine=m68k-rom68k + os=-coff + ;; + morphos) + basic_machine=powerpc-unknown + os=-morphos + ;; + msdos) + basic_machine=i386-pc + os=-msdos + ;; + ms1-*) + basic_machine=`echo $basic_machine | sed -e 's/ms1-/mt-/'` + ;; + mvs) + basic_machine=i370-ibm + os=-mvs + ;; + ncr3000) + basic_machine=i486-ncr + os=-sysv4 + ;; + netbsd386) + basic_machine=i386-unknown + os=-netbsd + ;; + netwinder) + basic_machine=armv4l-rebel + os=-linux + ;; + news | news700 | news800 | news900) + basic_machine=m68k-sony + os=-newsos + ;; + news1000) + basic_machine=m68030-sony + os=-newsos + ;; + news-3600 | risc-news) + basic_machine=mips-sony + os=-newsos + ;; + necv70) + basic_machine=v70-nec + os=-sysv + ;; + next | m*-next ) + basic_machine=m68k-next + case $os in + -nextstep* ) + ;; + -ns2*) + os=-nextstep2 + ;; + *) + os=-nextstep3 + ;; + esac + ;; + nh3000) + basic_machine=m68k-harris + os=-cxux + ;; + nh[45]000) + basic_machine=m88k-harris + os=-cxux + ;; + nindy960) + basic_machine=i960-intel + os=-nindy + ;; + mon960) + basic_machine=i960-intel + os=-mon960 + ;; + nonstopux) + basic_machine=mips-compaq + os=-nonstopux + ;; + np1) + basic_machine=np1-gould + ;; + nsr-tandem) + basic_machine=nsr-tandem + ;; + op50n-* | op60c-*) + basic_machine=hppa1.1-oki + os=-proelf + ;; + openrisc | openrisc-*) + basic_machine=or32-unknown + ;; + os400) + basic_machine=powerpc-ibm + os=-os400 + ;; + OSE68000 | ose68000) + basic_machine=m68000-ericsson + os=-ose + ;; + os68k) + basic_machine=m68k-none + os=-os68k + ;; + pa-hitachi) + basic_machine=hppa1.1-hitachi + os=-hiuxwe2 + ;; + paragon) + basic_machine=i860-intel + os=-osf + ;; + parisc) + basic_machine=hppa-unknown + os=-linux + ;; + parisc-*) + basic_machine=hppa-`echo $basic_machine | sed 's/^[^-]*-//'` + os=-linux + ;; + pbd) + basic_machine=sparc-tti + ;; + pbb) + basic_machine=m68k-tti + ;; + pc532 | pc532-*) + basic_machine=ns32k-pc532 + ;; + pc98) + basic_machine=i386-pc + ;; + pc98-*) + basic_machine=i386-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + pentium | p5 | k5 | k6 | nexgen | viac3) + basic_machine=i586-pc + ;; + pentiumpro | p6 | 6x86 | athlon | athlon_*) + basic_machine=i686-pc + ;; + pentiumii | pentium2 | pentiumiii | pentium3) + basic_machine=i686-pc + ;; + pentium4) + basic_machine=i786-pc + ;; + pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*) + basic_machine=i586-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + pentiumpro-* | p6-* | 6x86-* | athlon-*) + basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*) + basic_machine=i686-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + pentium4-*) + basic_machine=i786-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + pn) + basic_machine=pn-gould + ;; + power) basic_machine=power-ibm + ;; + ppc) basic_machine=powerpc-unknown + ;; + ppc-*) basic_machine=powerpc-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + ppcle | powerpclittle | ppc-le | powerpc-little) + basic_machine=powerpcle-unknown + ;; + ppcle-* | powerpclittle-*) + basic_machine=powerpcle-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + ppc64) basic_machine=powerpc64-unknown + ;; + ppc64-*) basic_machine=powerpc64-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + ppc64le | powerpc64little | ppc64-le | powerpc64-little) + basic_machine=powerpc64le-unknown + ;; + ppc64le-* | powerpc64little-*) + basic_machine=powerpc64le-`echo $basic_machine | sed 's/^[^-]*-//'` + ;; + ps2) + basic_machine=i386-ibm + ;; + pw32) + basic_machine=i586-unknown + os=-pw32 + ;; + rdos) + basic_machine=i386-pc + os=-rdos + ;; + rom68k) + basic_machine=m68k-rom68k + os=-coff + ;; + rm[46]00) + basic_machine=mips-siemens + ;; + rtpc | rtpc-*) + basic_machine=romp-ibm + ;; + s390 | s390-*) + basic_machine=s390-ibm + ;; + s390x | s390x-*) + basic_machine=s390x-ibm + ;; + sa29200) + basic_machine=a29k-amd + os=-udi + ;; + sb1) + basic_machine=mipsisa64sb1-unknown + ;; + sb1el) + basic_machine=mipsisa64sb1el-unknown + ;; + sde) + basic_machine=mipsisa32-sde + os=-elf + ;; + sei) + basic_machine=mips-sei + os=-seiux + ;; + sequent) + basic_machine=i386-sequent + ;; + sh) + basic_machine=sh-hitachi + os=-hms + ;; + sh5el) + basic_machine=sh5le-unknown + ;; + sh64) + basic_machine=sh64-unknown + ;; + sparclite-wrs | simso-wrs) + basic_machine=sparclite-wrs + os=-vxworks + ;; + sps7) + basic_machine=m68k-bull + os=-sysv2 + ;; + spur) + basic_machine=spur-unknown + ;; + st2000) + basic_machine=m68k-tandem + ;; + stratus) + basic_machine=i860-stratus + os=-sysv4 + ;; + sun2) + basic_machine=m68000-sun + ;; + sun2os3) + basic_machine=m68000-sun + os=-sunos3 + ;; + sun2os4) + basic_machine=m68000-sun + os=-sunos4 + ;; + sun3os3) + basic_machine=m68k-sun + os=-sunos3 + ;; + sun3os4) + basic_machine=m68k-sun + os=-sunos4 + ;; + sun4os3) + basic_machine=sparc-sun + os=-sunos3 + ;; + sun4os4) + basic_machine=sparc-sun + os=-sunos4 + ;; + sun4sol2) + basic_machine=sparc-sun + os=-solaris2 + ;; + sun3 | sun3-*) + basic_machine=m68k-sun + ;; + sun4) + basic_machine=sparc-sun + ;; + sun386 | sun386i | roadrunner) + basic_machine=i386-sun + ;; + sv1) + basic_machine=sv1-cray + os=-unicos + ;; + symmetry) + basic_machine=i386-sequent + os=-dynix + ;; + t3e) + basic_machine=alphaev5-cray + os=-unicos + ;; + t90) + basic_machine=t90-cray + os=-unicos + ;; + tic54x | c54x*) + basic_machine=tic54x-unknown + os=-coff + ;; + tic55x | c55x*) + basic_machine=tic55x-unknown + os=-coff + ;; + tic6x | c6x*) + basic_machine=tic6x-unknown + os=-coff + ;; + tile*) + basic_machine=tile-unknown + os=-linux-gnu + ;; + tx39) + basic_machine=mipstx39-unknown + ;; + tx39el) + basic_machine=mipstx39el-unknown + ;; + toad1) + basic_machine=pdp10-xkl + os=-tops20 + ;; + tower | tower-32) + basic_machine=m68k-ncr + ;; + tpf) + basic_machine=s390x-ibm + os=-tpf + ;; + udi29k) + basic_machine=a29k-amd + os=-udi + ;; + ultra3) + basic_machine=a29k-nyu + os=-sym1 + ;; + v810 | necv810) + basic_machine=v810-nec + os=-none + ;; + vaxv) + basic_machine=vax-dec + os=-sysv + ;; + vms) + basic_machine=vax-dec + os=-vms + ;; + vpp*|vx|vx-*) + basic_machine=f301-fujitsu + ;; + vxworks960) + basic_machine=i960-wrs + os=-vxworks + ;; + vxworks68) + basic_machine=m68k-wrs + os=-vxworks + ;; + vxworks29k) + basic_machine=a29k-wrs + os=-vxworks + ;; + w65*) + basic_machine=w65-wdc + os=-none + ;; + w89k-*) + basic_machine=hppa1.1-winbond + os=-proelf + ;; + xbox) + basic_machine=i686-pc + os=-mingw32 + ;; + xps | xps100) + basic_machine=xps100-honeywell + ;; + ymp) + basic_machine=ymp-cray + os=-unicos + ;; + z8k-*-coff) + basic_machine=z8k-unknown + os=-sim + ;; + none) + basic_machine=none-none + os=-none + ;; + +# Here we handle the default manufacturer of certain CPU types. It is in +# some cases the only manufacturer, in others, it is the most popular. + w89k) + basic_machine=hppa1.1-winbond + ;; + op50n) + basic_machine=hppa1.1-oki + ;; + op60c) + basic_machine=hppa1.1-oki + ;; + romp) + basic_machine=romp-ibm + ;; + mmix) + basic_machine=mmix-knuth + ;; + rs6000) + basic_machine=rs6000-ibm + ;; + vax) + basic_machine=vax-dec + ;; + pdp10) + # there are many clones, so DEC is not a safe bet + basic_machine=pdp10-unknown + ;; + pdp11) + basic_machine=pdp11-dec + ;; + we32k) + basic_machine=we32k-att + ;; + sh[1234] | sh[24]a | sh[34]eb | sh[1234]le | sh[23]ele) + basic_machine=sh-unknown + ;; + sparc | sparcv8 | sparcv9 | sparcv9b | sparcv9v) + basic_machine=sparc-sun + ;; + cydra) + basic_machine=cydra-cydrome + ;; + orion) + basic_machine=orion-highlevel + ;; + orion105) + basic_machine=clipper-highlevel + ;; + mac | mpw | mac-mpw) + basic_machine=m68k-apple + ;; + pmac | pmac-mpw) + basic_machine=powerpc-apple + ;; + *-unknown) + # Make sure to match an already-canonicalized machine name. + ;; + *) + echo Invalid configuration \`$1\': machine \`$basic_machine\' not recognized 1>&2 + exit 1 + ;; +esac + +# Here we canonicalize certain aliases for manufacturers. +case $basic_machine in + *-digital*) + basic_machine=`echo $basic_machine | sed 's/digital.*/dec/'` + ;; + *-commodore*) + basic_machine=`echo $basic_machine | sed 's/commodore.*/cbm/'` + ;; + *) + ;; +esac + +# Decode manufacturer-specific aliases for certain operating systems. + +if [ x"$os" != x"" ] +then +case $os in + # First match some system type aliases + # that might get confused with valid system types. + # -solaris* is a basic system type, with this one exception. + -solaris1 | -solaris1.*) + os=`echo $os | sed -e 's|solaris1|sunos4|'` + ;; + -solaris) + os=-solaris2 + ;; + -svr4*) + os=-sysv4 + ;; + -unixware*) + os=-sysv4.2uw + ;; + -gnu/linux*) + os=`echo $os | sed -e 's|gnu/linux|linux-gnu|'` + ;; + # First accept the basic system types. + # The portable systems comes first. + # Each alternative MUST END IN A *, to match a version number. + # -sysv* is not here because it comes later, after sysvr4. + -gnu* | -bsd* | -mach* | -minix* | -genix* | -ultrix* | -irix* \ + | -*vms* | -sco* | -esix* | -isc* | -aix* | -sunos | -sunos[34]*\ + | -hpux* | -unos* | -osf* | -luna* | -dgux* | -solaris* | -sym* \ + | -amigaos* | -amigados* | -msdos* | -newsos* | -unicos* | -aof* \ + | -aos* \ + | -nindy* | -vxsim* | -vxworks* | -ebmon* | -hms* | -mvs* \ + | -clix* | -riscos* | -uniplus* | -iris* | -rtu* | -xenix* \ + | -hiux* | -386bsd* | -knetbsd* | -mirbsd* | -netbsd* \ + | -openbsd* | -solidbsd* \ + | -ekkobsd* | -kfreebsd* | -freebsd* | -riscix* | -lynxos* \ + | -bosx* | -nextstep* | -cxux* | -aout* | -elf* | -oabi* \ + | -ptx* | -coff* | -ecoff* | -winnt* | -domain* | -vsta* \ + | -udi* | -eabi* | -lites* | -ieee* | -go32* | -aux* \ + | -chorusos* | -chorusrdb* \ + | -cygwin* | -pe* | -psos* | -moss* | -proelf* | -rtems* \ + | -mingw32* | -linux-gnu* | -linux-newlib* | -linux-uclibc* \ + | -uxpv* | -beos* | -mpeix* | -udk* \ + | -interix* | -uwin* | -mks* | -rhapsody* | -darwin* | -opened* \ + | -openstep* | -oskit* | -conix* | -pw32* | -nonstopux* \ + | -storm-chaos* | -tops10* | -tenex* | -tops20* | -its* \ + | -os2* | -vos* | -palmos* | -uclinux* | -nucleus* \ + | -morphos* | -superux* | -rtmk* | -rtmk-nova* | -windiss* \ + | -powermax* | -dnix* | -nx6 | -nx7 | -sei* | -dragonfly* \ + | -skyos* | -haiku* | -rdos* | -toppers* | -drops*) + # Remember, each alternative MUST END IN *, to match a version number. + ;; + -qnx*) + case $basic_machine in + x86-* | i*86-*) + ;; + *) + os=-nto$os + ;; + esac + ;; + -nto-qnx*) + ;; + -nto*) + os=`echo $os | sed -e 's|nto|nto-qnx|'` + ;; + -sim | -es1800* | -hms* | -xray | -os68k* | -none* | -v88r* \ + | -windows* | -osx | -abug | -netware* | -os9* | -beos* | -haiku* \ + | -macos* | -mpw* | -magic* | -mmixware* | -mon960* | -lnews*) + ;; + -mac*) + os=`echo $os | sed -e 's|mac|macos|'` + ;; + -linux-dietlibc) + os=-linux-dietlibc + ;; + -linux*) + os=`echo $os | sed -e 's|linux|linux-gnu|'` + ;; + -sunos5*) + os=`echo $os | sed -e 's|sunos5|solaris2|'` + ;; + -sunos6*) + os=`echo $os | sed -e 's|sunos6|solaris3|'` + ;; + -opened*) + os=-openedition + ;; + -os400*) + os=-os400 + ;; + -wince*) + os=-wince + ;; + -osfrose*) + os=-osfrose + ;; + -osf*) + os=-osf + ;; + -utek*) + os=-bsd + ;; + -dynix*) + os=-bsd + ;; + -acis*) + os=-aos + ;; + -atheos*) + os=-atheos + ;; + -syllable*) + os=-syllable + ;; + -386bsd) + os=-bsd + ;; + -ctix* | -uts*) + os=-sysv + ;; + -nova*) + os=-rtmk-nova + ;; + -ns2 ) + os=-nextstep2 + ;; + -nsk*) + os=-nsk + ;; + # Preserve the version number of sinix5. + -sinix5.*) + os=`echo $os | sed -e 's|sinix|sysv|'` + ;; + -sinix*) + os=-sysv4 + ;; + -tpf*) + os=-tpf + ;; + -triton*) + os=-sysv3 + ;; + -oss*) + os=-sysv3 + ;; + -svr4) + os=-sysv4 + ;; + -svr3) + os=-sysv3 + ;; + -sysvr4) + os=-sysv4 + ;; + # This must come after -sysvr4. + -sysv*) + ;; + -ose*) + os=-ose + ;; + -es1800*) + os=-ose + ;; + -xenix) + os=-xenix + ;; + -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) + os=-mint + ;; + -aros*) + os=-aros + ;; + -kaos*) + os=-kaos + ;; + -zvmoe) + os=-zvmoe + ;; + -none) + ;; + *) + # Get rid of the `-' at the beginning of $os. + os=`echo $os | sed 's/[^-]*-//'` + echo Invalid configuration \`$1\': system \`$os\' not recognized 1>&2 + exit 1 + ;; +esac +else + +# Here we handle the default operating systems that come with various machines. +# The value should be what the vendor currently ships out the door with their +# machine or put another way, the most popular os provided with the machine. + +# Note that if you're going to try to match "-MANUFACTURER" here (say, +# "-sun"), then you have to tell the case statement up towards the top +# that MANUFACTURER isn't an operating system. Otherwise, code above +# will signal an error saying that MANUFACTURER isn't an operating +# system, and we'll never get to this point. + +case $basic_machine in + score-*) + os=-elf + ;; + spu-*) + os=-elf + ;; + *-acorn) + os=-riscix1.2 + ;; + arm*-rebel) + os=-linux + ;; + arm*-semi) + os=-aout + ;; + c4x-* | tic4x-*) + os=-coff + ;; + # This must come before the *-dec entry. + pdp10-*) + os=-tops20 + ;; + pdp11-*) + os=-none + ;; + *-dec | vax-*) + os=-ultrix4.2 + ;; + m68*-apollo) + os=-domain + ;; + i386-sun) + os=-sunos4.0.2 + ;; + m68000-sun) + os=-sunos3 + # This also exists in the configure program, but was not the + # default. + # os=-sunos4 + ;; + m68*-cisco) + os=-aout + ;; + mep-*) + os=-elf + ;; + mips*-cisco) + os=-elf + ;; + mips*-*) + os=-elf + ;; + or32-*) + os=-coff + ;; + *-tti) # must be before sparc entry or we get the wrong os. + os=-sysv3 + ;; + sparc-* | *-sun) + os=-sunos4.1.1 + ;; + *-be) + os=-beos + ;; + *-haiku) + os=-haiku + ;; + *-ibm) + os=-aix + ;; + *-knuth) + os=-mmixware + ;; + *-wec) + os=-proelf + ;; + *-winbond) + os=-proelf + ;; + *-oki) + os=-proelf + ;; + *-hp) + os=-hpux + ;; + *-hitachi) + os=-hiux + ;; + i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent) + os=-sysv + ;; + *-cbm) + os=-amigaos + ;; + *-dg) + os=-dgux + ;; + *-dolphin) + os=-sysv3 + ;; + m68k-ccur) + os=-rtu + ;; + m88k-omron*) + os=-luna + ;; + *-next ) + os=-nextstep + ;; + *-sequent) + os=-ptx + ;; + *-crds) + os=-unos + ;; + *-ns) + os=-genix + ;; + i370-*) + os=-mvs + ;; + *-next) + os=-nextstep3 + ;; + *-gould) + os=-sysv + ;; + *-highlevel) + os=-bsd + ;; + *-encore) + os=-bsd + ;; + *-sgi) + os=-irix + ;; + *-siemens) + os=-sysv4 + ;; + *-masscomp) + os=-rtu + ;; + f30[01]-fujitsu | f700-fujitsu) + os=-uxpv + ;; + *-rom68k) + os=-coff + ;; + *-*bug) + os=-coff + ;; + *-apple) + os=-macos + ;; + *-atari*) + os=-mint + ;; + *) + os=-none + ;; +esac +fi + +# Here we handle the case where we know the os, and the CPU type, but not the +# manufacturer. We pick the logical manufacturer. +vendor=unknown +case $basic_machine in + *-unknown) + case $os in + -riscix*) + vendor=acorn + ;; + -sunos*) + vendor=sun + ;; + -aix*) + vendor=ibm + ;; + -beos*) + vendor=be + ;; + -hpux*) + vendor=hp + ;; + -mpeix*) + vendor=hp + ;; + -hiux*) + vendor=hitachi + ;; + -unos*) + vendor=crds + ;; + -dgux*) + vendor=dg + ;; + -luna*) + vendor=omron + ;; + -genix*) + vendor=ns + ;; + -mvs* | -opened*) + vendor=ibm + ;; + -os400*) + vendor=ibm + ;; + -ptx*) + vendor=sequent + ;; + -tpf*) + vendor=ibm + ;; + -vxsim* | -vxworks* | -windiss*) + vendor=wrs + ;; + -aux*) + vendor=apple + ;; + -hms*) + vendor=hitachi + ;; + -mpw* | -macos*) + vendor=apple + ;; + -*mint | -mint[0-9]* | -*MiNT | -MiNT[0-9]*) + vendor=atari + ;; + -vos*) + vendor=stratus + ;; + esac + basic_machine=`echo $basic_machine | sed "s/unknown/$vendor/"` + ;; +esac + +echo $basic_machine$os +exit + +# Local variables: +# eval: (add-hook 'write-file-hooks 'time-stamp) +# time-stamp-start: "timestamp='" +# time-stamp-format: "%:y-%02m-%02d" +# time-stamp-end: "'" +# End: Index: vis_dev/vis-2.3/helpers/dependency.make =================================================================== --- vis_dev/vis-2.3/helpers/dependency.make (revision 14) +++ vis_dev/vis-2.3/helpers/dependency.make (revision 14) @@ -0,0 +1,32 @@ +# FileName [dependency.make] +# +# PackageName [vis] +# +# Synopsis [Makefile to automatically create the dependency files.] +# +# Description [This file is called from the main Makefile.] +# +# SeeAlso [Makefile.in] +# +# Author [Abelardo Pardo ] +# +# Copyright [This file was created at the University of Colorado at Boulder. +# The University of Colorado at Boulder makes no warranty about the suitability +# of this software for any purpose. It is presented on an AS IS basis.] +# +# Revision [$Id: dependency.make,v 1.3 1998/09/18 18:30:23 hsv Exp $] + +include $(PKGNAME).make + +ifdef DEPENDENCYFILES +$(PKGNAME).d : $(DEPENDENCYFILES) $(HEADERS) $(PKGNAME).make + @echo -n "Dependency file $(PKGNAME).d->" + @$(CC) -MM $(CFLAGS) $(AC_FLAGS) $(INCLUDEDIRS) \ + $(filter %.c, $^) | \ + sed 's/^[a-zA-Z0-9_]*\.o[ :]*/$(objectdir)\/&/g' > $@ + @echo "Created." +else +$(PKGNAME).d : + @echo "No dependency files given in $(PKGNAME).make" + @echo "Define the variable DEPENDENCYFILES to create the dependencies" +endif Index: vis_dev/vis-2.3/helpers/install-sh =================================================================== --- vis_dev/vis-2.3/helpers/install-sh (revision 14) +++ vis_dev/vis-2.3/helpers/install-sh (revision 14) @@ -0,0 +1,276 @@ +#!/bin/sh +# +# install - install a program, script, or datafile +# This comes from X11R5 (mit/util/scripts/install.sh). +# +# Copyright 1991 by the Massachusetts Institute of Technology +# +# Permission to use, copy, modify, distribute, and sell this software and its +# documentation for any purpose is hereby granted without fee, provided that +# the above copyright notice appear in all copies and that both that +# copyright notice and this permission notice appear in supporting +# documentation, and that the name of M.I.T. not be used in advertising or +# publicity pertaining to distribution of the software without specific, +# written prior permission. M.I.T. makes no representations about the +# suitability of this software for any purpose. It is provided "as is" +# without express or implied warranty. +# +# Calling this script install-sh is preferred over install.sh, to prevent +# `make' implicit rules from creating a file called install from it +# when there is no Makefile. +# +# This script is compatible with the BSD install script, but was written +# from scratch. It can only install one file at a time, a restriction +# shared with many OS's install programs. + + +# set DOITPROG to echo to test this script + +# Don't use :- since 4.3BSD and earlier shells don't like it. +doit="${DOITPROG-}" + + +# put in absolute paths if you don't have them in your path; or use env. vars. + +mvprog="${MVPROG-mv}" +cpprog="${CPPROG-cp}" +chmodprog="${CHMODPROG-chmod}" +chownprog="${CHOWNPROG-chown}" +chgrpprog="${CHGRPPROG-chgrp}" +stripprog="${STRIPPROG-strip}" +rmprog="${RMPROG-rm}" +mkdirprog="${MKDIRPROG-mkdir}" + +transformbasename="" +transform_arg="" +instcmd="$mvprog" +chmodcmd="$chmodprog 0755" +chowncmd="" +chgrpcmd="" +stripcmd="" +rmcmd="$rmprog -f" +mvcmd="$mvprog" +src="" +dst="" +dir_arg="" + +while [ x"$1" != x ]; do + case $1 in + -c) instcmd=$cpprog + shift + continue;; + + -d) dir_arg=true + shift + continue;; + + -m) chmodcmd="$chmodprog $2" + shift + shift + continue;; + + -o) chowncmd="$chownprog $2" + shift + shift + continue;; + + -g) chgrpcmd="$chgrpprog $2" + shift + shift + continue;; + + -s) stripcmd=$stripprog + shift + continue;; + + -t=*) transformarg=`echo $1 | sed 's/-t=//'` + shift + continue;; + + -b=*) transformbasename=`echo $1 | sed 's/-b=//'` + shift + continue;; + + *) if [ x"$src" = x ] + then + src=$1 + else + # this colon is to work around a 386BSD /bin/sh bug + : + dst=$1 + fi + shift + continue;; + esac +done + +if [ x"$src" = x ] +then + echo "$0: no input file specified" >&2 + exit 1 +else + : +fi + +if [ x"$dir_arg" != x ]; then + dst=$src + src="" + + if [ -d "$dst" ]; then + instcmd=: + chmodcmd="" + else + instcmd=$mkdirprog + fi +else + +# Waiting for this to be detected by the "$instcmd $src $dsttmp" command +# might cause directories to be created, which would be especially bad +# if $src (and thus $dsttmp) contains '*'. + + if [ -f "$src" ] || [ -d "$src" ] + then + : + else + echo "$0: $src does not exist" >&2 + exit 1 + fi + + if [ x"$dst" = x ] + then + echo "$0: no destination specified" >&2 + exit 1 + else + : + fi + +# If destination is a directory, append the input filename; if your system +# does not like double slashes in filenames, you may need to add some logic + + if [ -d "$dst" ] + then + dst=$dst/`basename "$src"` + else + : + fi +fi + +## this sed command emulates the dirname command +dstdir=`echo "$dst" | sed -e 's,[^/]*$,,;s,/$,,;s,^$,.,'` + +# Make sure that the destination directory exists. +# this part is taken from Noah Friedman's mkinstalldirs script + +# Skip lots of stat calls in the usual case. +if [ ! -d "$dstdir" ]; then +defaultIFS=' + ' +IFS="${IFS-$defaultIFS}" + +oIFS=$IFS +# Some sh's can't handle IFS=/ for some reason. +IFS='%' +set - `echo "$dstdir" | sed -e 's@/@%@g' -e 's@^%@/@'` +IFS=$oIFS + +pathcomp='' + +while [ $# -ne 0 ] ; do + pathcomp=$pathcomp$1 + shift + + if [ ! -d "$pathcomp" ] ; + then + $mkdirprog "$pathcomp" + else + : + fi + + pathcomp=$pathcomp/ +done +fi + +if [ x"$dir_arg" != x ] +then + $doit $instcmd "$dst" && + + if [ x"$chowncmd" != x ]; then $doit $chowncmd "$dst"; else : ; fi && + if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd "$dst"; else : ; fi && + if [ x"$stripcmd" != x ]; then $doit $stripcmd "$dst"; else : ; fi && + if [ x"$chmodcmd" != x ]; then $doit $chmodcmd "$dst"; else : ; fi +else + +# If we're going to rename the final executable, determine the name now. + + if [ x"$transformarg" = x ] + then + dstfile=`basename "$dst"` + else + dstfile=`basename "$dst" $transformbasename | + sed $transformarg`$transformbasename + fi + +# don't allow the sed command to completely eliminate the filename + + if [ x"$dstfile" = x ] + then + dstfile=`basename "$dst"` + else + : + fi + +# Make a couple of temp file names in the proper directory. + + dsttmp=$dstdir/#inst.$$# + rmtmp=$dstdir/#rm.$$# + +# Trap to clean up temp files at exit. + + trap 'status=$?; rm -f "$dsttmp" "$rmtmp" && exit $status' 0 + trap '(exit $?); exit' 1 2 13 15 + +# Move or copy the file name to the temp name + + $doit $instcmd "$src" "$dsttmp" && + +# and set any options; do chmod last to preserve setuid bits + +# If any of these fail, we abort the whole thing. If we want to +# ignore errors from any of these, just make sure not to ignore +# errors from the above "$doit $instcmd $src $dsttmp" command. + + if [ x"$chowncmd" != x ]; then $doit $chowncmd "$dsttmp"; else :;fi && + if [ x"$chgrpcmd" != x ]; then $doit $chgrpcmd "$dsttmp"; else :;fi && + if [ x"$stripcmd" != x ]; then $doit $stripcmd "$dsttmp"; else :;fi && + if [ x"$chmodcmd" != x ]; then $doit $chmodcmd "$dsttmp"; else :;fi && + +# Now remove or move aside any old file at destination location. We try this +# two ways since rm can't unlink itself on some systems and the destination +# file might be busy for other reasons. In this case, the final cleanup +# might fail but the new file should still install successfully. + +{ + if [ -f "$dstdir/$dstfile" ] + then + $doit $rmcmd -f "$dstdir/$dstfile" 2>/dev/null || + $doit $mvcmd -f "$dstdir/$dstfile" "$rmtmp" 2>/dev/null || + { + echo "$0: cannot unlink or rename $dstdir/$dstfile" >&2 + (exit 1); exit + } + else + : + fi +} && + +# Now rename the file to the real destination. + + $doit $mvcmd "$dsttmp" "$dstdir/$dstfile" + +fi && + +# The final little trick to "correctly" pass the exit status to the exit trap. + +{ + (exit 0); exit +} Index: vis_dev/vis-2.3/helpers/mkinstalldirs =================================================================== --- vis_dev/vis-2.3/helpers/mkinstalldirs (revision 14) +++ vis_dev/vis-2.3/helpers/mkinstalldirs (revision 14) @@ -0,0 +1,111 @@ +#! /bin/sh +# mkinstalldirs --- make directory hierarchy +# Author: Noah Friedman +# Created: 1993-05-16 +# Public domain + +errstatus=0 +dirmode="" + +usage="\ +Usage: mkinstalldirs [-h] [--help] [-m mode] dir ..." + +# process command line arguments +while test $# -gt 0 ; do + case $1 in + -h | --help | --h*) # -h for help + echo "$usage" 1>&2 + exit 0 + ;; + -m) # -m PERM arg + shift + test $# -eq 0 && { echo "$usage" 1>&2; exit 1; } + dirmode=$1 + shift + ;; + --) # stop option processing + shift + break + ;; + -*) # unknown option + echo "$usage" 1>&2 + exit 1 + ;; + *) # first non-opt arg + break + ;; + esac +done + +for file +do + if test -d "$file"; then + shift + else + break + fi +done + +case $# in + 0) exit 0 ;; +esac + +case $dirmode in + '') + if mkdir -p -- . 2>/dev/null; then + echo "mkdir -p -- $*" + exec mkdir -p -- "$@" + fi + ;; + *) + if mkdir -m "$dirmode" -p -- . 2>/dev/null; then + echo "mkdir -m $dirmode -p -- $*" + exec mkdir -m "$dirmode" -p -- "$@" + fi + ;; +esac + +for file +do + set fnord `echo ":$file" | sed -ne 's/^:\//#/;s/^://;s/\// /g;s/^#/\//;p'` + shift + + pathcomp= + for d + do + pathcomp="$pathcomp$d" + case $pathcomp in + -*) pathcomp=./$pathcomp ;; + esac + + if test ! -d "$pathcomp"; then + echo "mkdir $pathcomp" + + mkdir "$pathcomp" || lasterr=$? + + if test ! -d "$pathcomp"; then + errstatus=$lasterr + else + if test ! -z "$dirmode"; then + echo "chmod $dirmode $pathcomp" + lasterr="" + chmod "$dirmode" "$pathcomp" || lasterr=$? + + if test ! -z "$lasterr"; then + errstatus=$lasterr + fi + fi + fi + fi + + pathcomp="$pathcomp/" + done +done + +exit $errstatus + +# Local Variables: +# mode: shell-script +# sh-indentation: 2 +# End: +# mkinstalldirs ends here Index: vis_dev/vis-2.3/share/createfunctionmap =================================================================== --- vis_dev/vis-2.3/share/createfunctionmap (revision 14) +++ vis_dev/vis-2.3/share/createfunctionmap (revision 14) @@ -0,0 +1,98 @@ +#!/usr/local/bin/perl +# +# Script to process the output of purify in terms of memory use. +# +# Abelardo Pardo +# +# Revision [$Id: createfunctionmap,v 1.4 1996/12/18 23:43:46 hsv Exp $] + +require 5.001; +use Getopt::Long; + +# Define default variables +# +$version = 1.3; + +# Initialize the different options +# +$opt_h = 0; +$opt_v = 0; + +# Read the options +# +$optionResult = GetOptions("h","v"); + +# Print the version if required +# +if ($opt_v) { + print < +ENDOFMESSAGE + exit; +} + +# Print the help message if required +# +if ($opt_h || !$optionResult) { + print < + +Options: + -h Print this message + -v Print the version + +Author: Abelardo Pardo + +ENDOFMESSAGE + exit; +} + +# Open the input files +# +foreach $filename (@ARGV) { + + if (open(INPUT, $filename)) { + + $indefinition = 0; + while() { + chop; + + if (/FileName\s+\[\s*(.+)\s*\]/) { + $cfilename = $1; + } + if (/PackageName\s+\[\s*(.+)\s*\]/) { + $pkgname = $1; + } + if (/^\/\*\*AutomaticStart\*+\/$/) { + $indefinition = 1; + } + if (/^\/\*\*AutomaticEnd\*+\/$/) { + $indefinition = 0; + } + + if ($indefinition == 1) { + if (/static\s*.*\s+([a-zA-Z0-9_]+\(.*\))/) { + $function = $1; + $function =~ /([a-zA-Z0-9_]+)\(.*\)/; + print "$pkgname $cfilename $1\n"; + } + } + } + close(INPUT); + } + else { + print "Unable to open $filename. Ignoring it.\n"; + } +} + +exit; Index: vis_dev/vis-2.3/share/help/Cmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/Cmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/Cmd.txt (revision 14) @@ -0,0 +1,6 @@ + + - + _________________________________________________________________ + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/_ctlp_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_ctlp_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_ctlp_testCmd.txt (revision 14) @@ -0,0 +1,29 @@ + + _ctlp_test - test the CTL parser + _________________________________________________________________ + + _ctlp_test [-h] + + Test the CTL parser. If the entire file of CTL formulas is successfully + parsed, then each formula is printed to stdout, followed by the equivalent + existential normal form formula. The formulas read are not stored. For the + input file containing: + AG(foo=bar); + + the following is produced: + original + formula: AG(foo=bar) => equivalent existential formula: !(E(TRUE U + !(foo=bar))) + + For the syntax of CTL formulas, refer to [1]the VIS CTL and LTL syntax + manual. Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html Index: vis_dev/vis-2.3/share/help/_ctlsp_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_ctlsp_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_ctlsp_testCmd.txt (revision 14) @@ -0,0 +1,29 @@ + + _ctlsp_test - test the CTL* parser + _________________________________________________________________ + + _ctlsp_test [-h] + + Test the CTL* parser. If the entire file of CTL* formulas is successfully + parsed, then each formula is printed to stdout, followed by the equivalent + existential normal form formula. The formulas read are not stored. For the + input file containing: + AG(foo=bar); + + the following is produced: + original + formula: AG(foo=bar) => equivalent existential formula: !(E(TRUE U + !(foo=bar))) + + For the syntax of CTL formulas, refer to [1]the VIS CTL and LTL syntax + manual. Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html Index: vis_dev/vis-2.3/share/help/_grab_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_grab_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_grab_testCmd.txt (revision 14) @@ -0,0 +1,115 @@ + + _grab_test - Performs invairant checking on a flattened network with the GRAB + abstraction refinement algorithm. + _________________________________________________________________ + + _grab_test [-a ] [-c ] [-d ] [-F] + [-M] [-i] [-m] [-t ] [-v ] [-f ] + [-h] + + Performs invairant checking on a flattened network with the GRAB abstraction + refinement algorithm. Before calling this command, the user should have + created the flattened netowrk by calling the commands [1]flatten_hierarchy + and [2]build_partition_maigs. The default BDD manager and network partition + are not mandatory for calling this command, though they will be used if + available. (In other words, the user doesn't have to run the commands + [3]static_order and [4]build_partition_mdds before calling this command.) + Regardless of the options, no 'false positive' or 'false negatives' will + occurs: the result is correct for the given model. Properties to be verified + should be provided as invariant formulae in the file inv_file. Node that the + support of any wire referred to in a formula should consist only of latches. + For the precise syntax of CTL and LTL formulas, see the [5]VIS CTL and LTL + syntax manual. + + If a formula does not pass, a proof of failure (referred to as a + counter-example) is demonstrated. Whether demostrate the proof or not can be + specified (see option -d). + + Command options: + + -a + Specify the refinement variable selection algorithm. + + refine_algorithm must be one of the following: + + GRAB: the GRAB refinement method (Default). + + -c + Specify the type of abstract counter-examples used in the analysis. + + cex_type must be one of the following: + + 0: minterm state counter-example. + + 1: cube state counter-example. + + 2: synchronous onion rings (Default). + + -d + Specify whether to demonstrate a counter-example when the system + fails a formula being checked. + + dbg_level must be one of the following: + + 0: No debugging performed. dbg_level=0 is the default. + + 1: Generate a counter-example (a path to a fair cycle). + + -F + Enable or disable the use of fine-grain abstraction. + + finegrain_flag must be one of the following: + + 0: disable fine-grain abstraction. + + 1: enable fine-grain abstraction (Default). + + -M + Enable or disable the use of greedy refinement minimization. + + refinemin_flag must be one of the following: + + 0: disable greedy refinement minimization. + + 1: enable greedy refinement minimization (Default). + + -i + Print input values causing transitions between states during + debugging. Both primary and pseudo inputs are printed. + + -m + Pipe debugger output through the UNIX utility more. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + verbosity_level must be one of the following: + + 0: No feedback provided. This is the default. + + 1: Feedback on code location. + + 2: Feedback on code location and CPU usage. + + -f + Specify the name of the file ot which error trace is written. + + -h + Print the command usage. + + See also commands : model_check, check_invariant + __________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/flatten_hierarchyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_maigsCmd.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/static_orderCmd.html + 4. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_mddsCmd.html + 5. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html Index: vis_dev/vis-2.3/share/help/_init_state_formulaCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_init_state_formulaCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_init_state_formulaCmd.txt (revision 14) @@ -0,0 +1,11 @@ + + _init_state_formula - write resettability condition as a CTL formula + _________________________________________________________________ + + _init_state_formula [-h] [] + + Write resettability condition as a CTL formula. Writes to init_file is + specified, else stdout. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/_mAig_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_mAig_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_mAig_testCmd.txt (revision 14) @@ -0,0 +1,8 @@ + + _mAig_test - + _________________________________________________________________ + + _mAig_test + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/_memory_profileCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_memory_profileCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_memory_profileCmd.txt (revision 14) @@ -0,0 +1,57 @@ + + _memory_profile - It shows the amount of memory used by every pacakge. + _________________________________________________________________ + + _memory_profile [-f ] [-h] [-p] [-u ] + + This command intregrates the output from purify with a function map + generated by a perlscript plus another perlscript to generate a memory + profile of vis. + + This command relies on the output of purify to a file to call the script + "memoryaccount" and produce a summary of how much memory has been allocated + by each package. Although this command may appear simple it requires the + interaction of two scripts and three files, so special care should be taken + when attempting to modify it. + + Here is the way it works. The code in this command is conditionally compiled + depending on the definition of the symbol PURIFY. If the symbol is not + defined, the program prints a message notifying that the command is not + operative in this executable. If PURIFY has been defined, there are certain + things that are assumed. The executable has been linked with purify. The + output of purify is being redirected to a file with name purify.log. The + perl script memoryaccount is in $VIS/common/share and it is executable. + There exists a file mapping function names to packages in the same place + whose name is .fmap. + + The command then calls purify_all_inuse() to force purify to dump to the + file purify.log the information about the memory that is currently visible + to the program. This memory is not the total memory allocated by the program + since there may be leaked memory that is no longer accessible. A temporary + file is created and the script memoryaccount is called to analyze the file + purify.log and write in the temporary file the memory profile obtained from + it. Once the script is done, the temporary file is dumped to vis_stdout and + deleted. + + Since most of the computation in this command is done by the pearlscript + memoryaccount, for more information please refer to the message printed when + the script is invoked with the option -h. Command options: + + -f + File to read the dump from. The default is purify.log. This option + should be used if and only if the option -log-file has been used at + the linking stage when building the executable. + + -h + Print the command usage. + + -p + Print also the packages that did not allocated any visible memory + + -u + Units to print the memory usage in. It may be "b" for bytes, "k" for + kilobytes, "m" for megabytes and "g" for gigabytes. The default is + bytes. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/_ntm_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_ntm_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_ntm_testCmd.txt (revision 14) @@ -0,0 +1,22 @@ + + _ntm_test - test the ntm package + _________________________________________________________________ + + _ntm_test [-h] [-v] + + Test the ntm package. This package is responsible for building the + multi-valued functions (represented as MDDs) of the flattened network. This + command builds the multi-valued functions of the combinational outputs in + terms of the combinational inputs. The multi-valued functions are then + deleted. + + Command options: + + -h + Print the command usage. + + -v + Print the sizes of the MDDs built. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/_tbl_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_tbl_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_tbl_testCmd.txt (revision 14) @@ -0,0 +1,18 @@ + + _tbl_test - test the functionality of the tbl package. + _________________________________________________________________ + + _tbl_test [-h] [-v] + + Tests the functionality of the tbl package. + + Command options: + + -h + Print the command usage. + + -v + Verbose mode. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/_tst_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/_tst_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/_tst_testCmd.txt (revision 14) @@ -0,0 +1,19 @@ + + _tst_test - template for implementing commands + _________________________________________________________________ + + _tst_test [-h] [-v] + + This command does nothing useful. It merely serves as a template for the + implementation of new commands. + + Command options: + + -h + Print the command usage. + + -v + Verbose mode. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/aliasCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/aliasCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/aliasCmd.txt (revision 14) @@ -0,0 +1,61 @@ + + alias - provide an alias for a command + _________________________________________________________________ + + alias [-h] [ []] + + The "alias" command, if given no arguments, will print the definition of all + current aliases. + + Given a single argument, it will print the definition of that alias (if + any). Given two arguments, the keyword "name" becomes an alias for the + command string "string", replacing any other alias with the same name. + + Command options: + + -h + Print the command usage. + + + Alias + + + Command string + + It is possible to create aliases that take arguments by using the history + substitution mechanism. To protect the history substitution character `%' + from immediate expansion, it must be preceded by a `\' when entering the + alias. + + For example: + + vis> alias read read_\%:1 \%:2.\%:1 + vis> read blif lion + + + will create an alias `read', execute "read_blif lion.blif". + + And... + + vis> alias echo2 "echo Hi ; echo \%* !" + vis> echo2 happy birthday + + + will print: + + Hi + happy birthday ! + + + CAVEAT: Currently there is no check to see if there is a circular dependency + in the alias definition. e.g. + + vis> alias foo "print_network_stats; print_network; foo" + + + creates an alias which refers to itself. Executing the command "foo" will + result an infinite loop during which the commands "print_network_stats" and + "print_network" will be executed. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/approximate_model_checkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/approximate_model_checkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/approximate_model_checkCmd.txt (revision 14) @@ -0,0 +1,178 @@ + + approximate_model_check - perform ACTL model checking on an abstracted and + flattened network + _________________________________________________________________ + + approximate_model_check [-h] [-v ] + + Performs ACTL model checking on an abstracted and flattened network. + Predefined abstractions are performed prior to model checking. Before + calling this command, the user should have initialized the design by calling + the command [1]init_verify. + + The command includes two dual algorithms. The user should set appropriate + environment parameters associated with the command to execute proper + algorithm. By default, the command makes its effort to prove whether given + ACTL formula is positive. To check whether the ACTL formula is negative, + user should set the environment parameter amc_prove_false prior to executing + the command. See [2]below for the environment parameters associated with + this command. + + Properties to be verified should be provided as ACTL formulas in the file + . The command only accepts ACTL formulas. Mixed, ECTL expressions + are not supported. ACTL formulas are those in which all quantifiers are + universal and negation is only allowed at the level of atomic propositions. + For the precise syntax of CTL formulas, see the [3]VIS CTL and LTL syntax + manual. + + The command is designed to tackle the state explosion problem we encounter + when dealing with large and complex circuits. Based on the initial size of + the group, the command constructs over- or under-approximation of the + transition relation of the system. A group (subsystem) is a portion of the + original circuit containing a subset of the latches and their next state + functions. The initial size of a group can be set with the + [4]amc_sizeof_group environment variable. These initial approximations may + not contain every detail of the exact system. However they may contain + enough information to determine whether the formula is positive or negative. + Starting from an initial coarse approximation, the command makes its effort + to prove whether given ACTL formula is positive or negative. When the + procedure fails to prove correctness of the formula with initial + approximations, it automatically refines the approximations. It repeats the + process until the algorithm produces a reliable result or the available + resources are exhausted. + + Due to the overhead procedures, for some circuits, the exact [5]model_check + method may evaluate formulas faster with less resources. If any formula + evaluates to false, a debug trace is reported. + + The command does not use fairness constraints even if they have been read + with the [6]read_fairness command. + + Command options: + + -h + Print the command usage. + + -v + Specify verbosity level. verbosity_level must be one of the + following: + + 0 : No feedback provided. This is the default. + 1 : Some feedback. + 2 : Lots of feedback. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + + File containing ACTL formulas to be model checked. + + Environment Parameters: + + Environment parameters should be set using the set command from the VIS + shell + (e.g. vis> set amc_prove_false). + + amc_prove_false + When the parameter is set, the command makes its effort to prove + whether given ACTL formula is negative. The command constructs a set + of under-approximations of the transition relations of the system. + When the formula evaluates to false, a debug trace is reported by + default. + + amc_grouping_method + Specifies grouping method. Grouping method is a method for grouping + number of latches into single subsystem. Two methods are supported. + + Grouping based on hierarchy(default) : The method groups latches + based on the hierarchy of the system. Normally, complex circuits are + designed in multiple processes. Furthermore, processes form a + hierarchy. The method uses this information provided by the original + design. When a design described in high level description language is + transformed into low level BLIF format, the processes are transformed + into subcircuits. The method groups those latches that are within + same subcircuit. + + Grouping based on latch dependencies(latch_dependency): The method + groups those latches that are closely related. Closely related + latches are those who has many (transitive) connections between them. + + When the parameter is not specified, the command by default uses + hierarchical grouping method. + + amc_sizeof_group + Determines the number of latches in each group(subsystem). The + default value is 8. The initial size of the subsystem determines the + initial degree of approximations of the transition relations. There's + no proven rule of setting the value. Some experimental results show + that setting the value to about 5-20% of overall number of latches is + reasonable(e.g. if the system contains 100 latches set the value to + 5-20). However, the suggested range may not work well with some + examples. + + amc_DC_level + Specifies don't care levels. Default level is 0. Absence of the + parameter sets the amc_DC_level to 0. + amc_DC_level must be one of the following: + + 0: No don't cares are used. This is the default. + + 1: Use unreachable states as don't cares. + + 2: Aggressively use DC's to simplify MDD's in model checking. + + Using don't cares may take more time for some examples since the + approximate model checker computes the reachable states for each + subsystem. For some large circuits it is undesirable to set don't + care level. + + Related "set" options: + + ctl_change_bracket + Vl2mv automatically converts "[]" to "<>" in node names, therefore + CTL parser does the same thing. However, in some cases a user does + not want to change node names in CTL parsing. Then, use this set + option by giving "no". Default is "yes". + + See also commands : model_check, incremental_ctl_verification + + Examples: + Here are some example sequences of the VIS executions using the approximate + model checker. + + read_blif_mv abp/abp.mv + flatten_hierarchy + static_order + build_partition_mdds + set amc_sizeof_group 4 + approximate_model_check abp/abpt.ctl + time + quit + + read_blif_mv coherence/coherence.mv + flatten_hierarchy + static_order + build_partition_mdds + set amc_sizeof_group 8 + set amc_prove_false + set amc_DC_level 0 + approximate_model_check coherence/coherence2.ctl + time + quit + + The algorithm used by approximate_model_check is described in detail in + [7]ftp://vlsi.colorado.edu/pub/iccad96.ps + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/init_verifyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/approximate_model_checkCmd.html#environment + 3. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html + 4. file://localhost/projects/development/hsv/vis/common/doc/html/approximate_model_checkCmd.html#sizeofgroup + 5. file://localhost/projects/development/hsv/vis/common/doc/html/model_checkCmd.html + 6. file://localhost/projects/development/hsv/vis/common/doc/html/read_fairnessCmd.html + 7. ftp://vlsi.colorado.edu/pub/iccad96.ps Index: vis_dev/vis-2.3/share/help/bdd_sat_bounded_model_checkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/bdd_sat_bounded_model_checkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/bdd_sat_bounded_model_checkCmd.txt (revision 14) @@ -0,0 +1,91 @@ + + bdd_sat_bounded_model_check - performs an LTL bounded model checking on a + flattened network + _________________________________________________________________ + + bdd_sat_bounded_model_check [-h] [-v ] [-d ] + [-i] -m -k -s -o + + + Performs an LTL bounded model checking on a flattened network. This command + looks for a counterexample of length ≥ minimum_length and ≀ maximum_length. + It increments the length by step_value. Before calling this command, the + user should have initialized the design by calling the command + [1]flatten_hierarchy, and then calling the command [2]build_partition_maigs. + + The value of maximum length must be >= minimum length. + + Command options: + + -h + Print the command usage. + + -m + Minimum length of counterexample to be checked (default is 0). + + -k + Maximum length of counterexample to be checked (default is 1). + + -s + Incrementing value of counterexample length (default is 1). + + -r + Use inductive proof at each step_value to check if the property + passes (default is 0). 0 means don't use the inductive proof. BMC + will check using the indcution if the property passes if the current + length of the counterexample is a multiple of inductive_Step. + + -F + Read fairness constraints from . Each formula in the + file is a condition that must hold infinitely often on a fair path. + + -o Save the CNF formula in + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + verbosity_level must be one of the following: + + 0: No feedback provided. This is the default. + + 1: Feedback on code location. + + 2: Feedback on code location and CPU usage. + + -d + Specify the amount of debugging performed when the BMC models check + the LTL formula. + + dbg_level must be one of the following: + + 0: No debugging performed. dbg_level=0 is the default. + + 1: Debugging with minimal output: generate counter-example if the LTL + formula fails and the counterexample length. + + -h + Print the command usage. + + -i + Print input values causing transitions between states during + debugging. + + -o ; + File containing CNF of the counterexample if exist. If specifies, the + user can exam this file looking for information about the generated + path. This file will be the input to the SAT solver. The contents of + this file is in dimacs format. + + + File containing LTL formulas to be model checked. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/flatten_hierarchyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_maigsCmd.html Index: vis_dev/vis-2.3/share/help/bounded_model_checkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/bounded_model_checkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/bounded_model_checkCmd.txt (revision 14) @@ -0,0 +1,140 @@ + + bounded_model_check - Performs a SAT-based LTL model checking on a flattened + network + _________________________________________________________________ + + bounded_model_check [-h] [-v ] [-m ] [-k + ] [-s ] [-r ] [-e] [-F + ] [-S ] [-E ] [-C ] [-I + ] [-d ] [-t ] [-o ] [-i] [-O + ] + + Performs a SAT-based LTL bounded model checking (BMC) on a flattened + network. This command looks for a counterexample of length k ( + minimum_length ≀ k ≀ maximum_length). If -r is specified, this command + performs check for termination after each termination_check_step . If no + counterexample is found, this command increases k by step_value (specifies + by the -s option) until a counterexample is found, the search becomes + intractable (timed out), or k reaches a bound (determine by the check for + termination), and then we conclude that the LTL property passes. This + command implements the basic encoding of Bounded Model Checking (BMC) as + descibed in the paper "Symbolic Model Checking without BDDs". However, the + -E option can be used to select other encoding scheme. We also applied some + of the improvements in the BMC encoding described in the paper "Improving + the Encoding of LTL Model Checking into SAT". To prove that an LTL property + passes, we implement the termination methods that are descirebed in the + papers "Checking Safety Properties Using Induction and a SAT-Solver" and + "Proving More Properties with Bounded Model Checking". Before calling this + command, the user should have initialized the design by calling the command + [1]flatten_hierarchy. If the user uses the -r option and the LTL property is + a general LTL property, the command [2]build_partition_maigs must be called. + The aig graph must be built by calling the command [3]build_partition_mdds + + Command options: + + -h + Print the command usage. + + -m + Minimum length of counterexample to be checked (default is 0). + + -k + Maximum length of counterexample to be checked (default is 1). + + -s + Incrementing value of counterexample length (default is 1). + + -r + Check for termination for each termination_check_step (default is 0). + 0 means don't check for termination. + + -e + Activate early termination check. Check if there is no simple path + starts from an initial state. Valid only for general LTL and safety + properties. Must be used with -r option. + + -S + Specify SAT solver + sat_solver must be one of the following: + + 0: CirCUs (Default) + + 1: zChaff + + -E + Specify encoding scheme + encoding must be one of the following: + + 0: The original BMC encoding (Default) + + 1: SNF encoding + + 2: Fixpoint encoding + + -C + Specify clause type + encoding must be one of the following: + + 0: Apply CirCUs SAT solver on circuit (Default) + + 1: Apply SAT solver on CNF generated form circuit + + 2: Apply SAT solver on CNF + + -I + Specify increment sat solver type + encoding must be one of the following: + + 1: Trace Objective (Default) + + 2: Distill + + 3: Trace Objective + Distill + + -F + Read fairness constraints from . Each formula in the + file is a condition that must hold infinitely often on a fair path. + + -o Save CNF formula in + -O Save counterexample to + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + verbosity_level must be one of the following: + + 0: No feedback provided. This is the default. + + 1: Feedback on code location. + + 2: Feedback on code location and CPU usage. + + -d + Specify the amount of debugging performed when the BMC models check + the LTL formula. + + dbg_level must be one of the following: + + 0: No debugging performed. dbg_level=0 is the default. + + 1: Debugging with minimal output: generate counter-example if the LTL + formula fails and the counterexample length. + + -i + Print input values causing transitions between states during + debugging. + + + File containing LTL formulae to be checked. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/flatten_hierarchyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_maigsCmd.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_mddsCmd.html Index: vis_dev/vis-2.3/share/help/build_partition_maigsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/build_partition_maigsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/build_partition_maigsCmd.txt (revision 14) @@ -0,0 +1,23 @@ + + build_partition_maigs - build a partition of MAIGs for the flattened network + _________________________________________________________________ + + build_partition_maigs [-h] [-d] [-n] + + Build the multi-valued AND/INVERTER graph (MAIG) of a flattened network. It + builds the MAIG for the combinational outputs (COs) in terms of the + combinational inputs (CIs). The pointer to this graph is stored in the + network to be used by other commands, such as bounded_model_check. This + command must be preceded by the commands flatten_hierarchy. This command + will remove any previous build to this graph. + + Command options: + + -n + Disable BDD sweeping. + + -d + Build aig structure in depth first manner. + __________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/build_partition_mddsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/build_partition_mddsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/build_partition_mddsCmd.txt (revision 14) @@ -0,0 +1,84 @@ + + build_partition_mdds - build a partition of MDDs for the flattened network + _________________________________________________________________ + + build_partition_mdds [-h] [-i] [-n ] [-s ] [-t ] [-v] + [] + + Build the MDDs of a flattened network. Depending on the method selected, the + MDDs for the combinational outputs (COs) are built in terms of either the + combinational inputs (CIs) or in terms of some subset of intermediate nodes + of the network. The MDDs built are stored in a DAG called a "partition". The + vertices of a partition correspond to the CIs, COs, and any intermediate + nodes used. Each vertex has a multi-valued function (represented by MDDs) + expressing the function of the corresponding network node in terms of the + partition vertices in its transitive fanin. Hence, the MDDs of the partition + represent a partial collapsing of the network. + + This command must be preceded by the commands flatten_hierarchy and + static_order. The partition built is stored with the network for use by + other commands, such as simulate, compute_reach, model_check, etc. This + command has no affect when invoked on a network that already has a + partition. To remove the existing partition of a network, reinvoke + flatten_hierarchy. + + The choice of method determines which intermediate nodes are used. The inout + method represents one extreme where no intermediate nodes are used, and + total represents the other extreme where every node in the network has a + corresponding vertex in the partition. If no method is specified on the + command line, then the value of the flag partition_method is used (this flag + is set by the command set partition_method), unless it does not have a + value, in which case the forntier method is used. The different methods + available are: + + inout Expresses the combinational outputs in terms of the combinational + inputs. + + total The partition built is isomorphic to the combinational part of the + network. The function of each node is expressed in terms of its + immediate fanins. If the -i is used the function attached to each + vertex is computed as a function of the combinational inputs. + + partial Builds a partition using the intermediate nodes specified with the + -n option or the -f option. + + frontier (default) Builds a partition creating vertices for the + intermediate nodes as needed in order to control the BDD size. The + threshold value for the BDD size can be set by the parameter + "partition_threshold". This method encompasses both "inout" (set + partition_threshold parameter to infinity) and "total" (set + partition_threshold parameter to 0). + + boundary Builds a partition in a fashion that preserves all nodes that are + Input/Output nodes of any hnode in the hierarchy rooted at the + current hnode. + + Command options: + + -h + Print the command usage. + + -i + Build the multi-valued functions of each partition vertex in terms of + the combinational inputs, rather than in terms of its transitive + fanin vertices. + + -n + Used in conjunction with the partial method. List is a comma + separated list of network nodes to use as intermediate nodes in the + partition. + + -s + Level of severity of a post-computation check applied to the + partition data structure (0 by default, meaning no check). + + -t + Time in seconds allowed to build the partition. If the computation + time goes above that limit, the process of building the partition is + aborted. The default is no limit. + + -v + Turn on the verbosity. + __________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/cdCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/cdCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/cdCmd.txt (revision 14) @@ -0,0 +1,17 @@ + + cd - change the current node + _________________________________________________________________ + + cd [-h] or <..> + + Changes the current node in the existing hierarchy. The argument should be + either the name of a child node or .. meaning the parent node. Note that cd + ../foo is not allowed. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/check_invariantCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/check_invariantCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/check_invariantCmd.txt (revision 14) @@ -0,0 +1,262 @@ + + check_invariant - check all states reachable in flattened network satisfy + specified invariants + _________________________________________________________________ + + check_invariant [-c] [-d ] [-g ] [-f] [-h] [-i] [-m] + [-r] [-t ] [-v ] [-A + ] [-D] + + Performs invariant checking on a flattened network. Before calling this + command, the user should have initialized the design by calling the command + [1]init_verify. + + If the option -A3 (abstraction refinement method GRAB) is used, the command + [2]build_partition_maigs should also have been executed. However, in this + case, the default BDD manager and network partition are not mandatory, + though they will be used if available. (In other words, the user must run + the commands [3]flatten_hierarchy and [4]build_partition_maigs, but doesn't + have to run the commands [5]static_order and [6]build_partition_mdds before + calling this command.) For extremely large networks, it is actually + favorable not to build them for the entire concrete model, but let this + procedure assign bdd ids and construct the partition incrementally. + + Option -A4 means abstraction refinement approach using puresat algorithm, + which is entirely based on SAT solver. + + An invariant is a set of states. Checking the invariant is the process of + determining that all states reachable from the initial states lie in the + invariant. + + One way of defining an invariant is through a CTL formula which has no path + operators. Such formulas should be specified in the file invar_file. Note + that the support of any wire referred to in a formula should consist only of + latches. For the precise syntax of CTL formulas, see the [7]VIS CTL and LTL + syntax manual. + + check_invariant ignores all fairness conditions associated with the FSM. + + check_invariant involves reachability analysis where at every step of the + reachability computation all the specified invariants are checked in the + reachable states computed thus far. If some invariant does not hold, a proof + of failure is demonstrated. This consists of a path starting from an initial + state to a state lying outside the invariant. This path is made as short as + possible. For the -A 0 option or default -A option, it is the shortest path + leading to a state outside the invariant. If a set of invariants is + specified, the failed formulas are reported as soon as they are detected. + The check is continued with the remaining invariants. + + Command options: + + -d + Specify the amount of debugging performed when the system fails a + formula being checked. + + dbg_level must be one of the following: + + 0 : No debugging performed. This is the default. + + 1 : Generate a path from an initial state to a state lying outside + the invariant. This option stores the onion rings just as specifying + -f would have. Therefore, it may take more time and memory if the + formula passes. This option is incompatible with -A 2 option. + + -f + Store the set of new states (onion rings) reached at each step of + invariant. This option is likely to use more memory but possibly + faster results for invariants that fail. Therefore, the debug + information for a failed invariant, if requested, may be provided + faster. This option is not compatible with -A 2 options. + + -g + Use guided search. The file hints_file contains a series of hints. A + hint is a formula that does not contain any temporal operators, so + hints_file has the same syntax as a file of invariants used for + check_invariant. The hints are used in the order given to change the + transition relation. The transition relation is conjoined with the + hint to yield an underapproximation of the transition relation. If + the hints are cleverly chosen, this may speed up the computation + considerably, because a search with the changed transition relation + may be much simpler than one with the original transition relation, + and results obtained can be reused, so that we may never have to do + an expensive search with the original relation. See also: Ravi and + Somenzi, Hints to accelerate symbolic traversal. CHARME'99; Bloem, + Ravi, and Somenzi, Efficient Decision Procedures for Model Checking + of Linear Time Logic Properties, CAV'99; Bloem, Ravi, and Somenzi, + Symbolic Guided Search for CTL Model Checking, DAC'00. This option is + not compatible with -A 2 option. The description of some options for + guided search can be found in the help page for + print_guided_search_options. + + -h + Print the command usage. + + -c + Use the formula tree so that subformulae are not shared among the CTL + formulae in the input file. This option is useful in the following + scenario - formulae A, B and C are being checked in order and there + is sub-formula sharing between A and C. If the BDDs corresponding to + the shared sub-formula is huge then computation for B might not be + able to finish without using this option. + + -i + Print input values causing transitions between states during + debugging. Both primary and pseudo inputs are printed. + + -m + Pipe debugger output through the UNIX utility more. + + -r + Reduce the FSM derived from the flattened network with respect to + each of the invariants in the input file. By default, the FSM is + reduced with respect to the conjunction of the invariants in the + input file. If this option is used and don't cares are being used for + simplification, then subformula sharing is disabled (result might be + incorrect otherwise). + + The truth of an invariant may be independant of parts of the network + (such as when wires have been abstracted; see [8]flatten_hierarchy). + These parts are effectively removed when this option is invoked; this + may result in more efficient invariant checking. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + + verbosity_level must be one of the following: + + 0 : No feedback provided. This is the default. + + 1 : Feedback on code location. + + 2 : Feedback on code location and CPU usage. + + -A + This option allows specification of the type of reachability + computation. + + 0: (default) Breadth First Search. No approximate reachability + computation. + + 1: High Density Reachability Analysis (HD). Computes reachable states + in a manner that keeps BDD sizes under control. May be faster than + BFS in some cases. For larger circuits, this option could compute + more reachable states than the -A 0 option for the same memory + constraints, consequently may prove more invariants false. For help + on controlling options for HD, look up help on the command: + print_hd_options [9]print_hd_options. Refer Ravi & Somenzi, ICCAD95. + The path generated for a failed invariant using this method may not + be the shortest path. This option is available only when compiled + with the CUDD package. + + 2. Approximate Reachability Don't Cares(ARDC). Computes + over-approximated reachable states in the reachability analysis step. + This may be faster than the -A 0 option . The invariants are checked + in the over-approximation. This may produce false negatives, but + these are resolved internally using the exact reachable states. The + final results produced are the same as those for exact reachable + states. For help on controlling options for ARDC, look up help on the + command: print_ardc_options. [10]print_ardc_options Refer 2 papers in + TCAD96 Dec. Cho et al, one is for State Space Decomposition and the + other is for Approximate FSM Traversal. This option is incompatible + with -d 1 and -g options. + + 3. The GRAB Abstraction Refinement Method. Conducts the reachability + analysis on an abstract model. If the invariants are true in the + abstract model, they are also true in the original model. If the + invariants are false, the abstract counter-examples are used to + refine the abstract model (since it is still inconclusive). This + procedure iterates until a conclusive result is reached. Note that, + with this option, "build_partitioned_mdds" and "static_order" does + not have to be executed before calling "check_invariants," though the + default BDD partition and order will be reused if available. (When + checking extremely large models, skipping either or both + "static_order" and "build_partitioned_mdds" can often make the + verification much faster.) The grainularity of abstraction refinement + also depends on the parameter "partition_threshold", which by default + is 5000; one can use the VIS command "set partition_threshold 1000" + to change its value. For experienced users who want to fine-tune the + different parameters of GRAB, please try the test command + "_grab_test" ("_grab_test -h" prints out its usage information). + Refer to Wang et al., ICCAD2003 and ICCD2004 for more information + about the GRAB algorithm. Note that this option is incompatible with + the "-d 1" and "-g" options. + + 4. Abstraction refinement approach using puresat algorithm, which is + entirely based on SAT solver. It has several parts: * Localization + base Abstraction * K-induction to prove the truth of a property * + Bounded Model Checking to find bugs * Incremental concretization + based methods to verify abstract bugs * UNSAT proof based method to + obtain refinement * Refinement minization to guarrantee a minimal + refinement For more information, please check the BMC'03 and STTT'05 + paper of Li et al., "A satisfiability-based appraoch to abstraction + refinement in model checking", and " Abstraction in symbolic model + checking using satisfiability as the only decision procedure" + + -D + First compute an overapproximation to the reachable states. Minimize + the transition relation using this approximation, and then compute + the set of reachable states exactly. This may accelerate reachability + analysis. Refer to the paper by Moon et al, ICCAD98. The BDD + minimizing method can be chosen by using "set image_minimize_method " + [11]set. This option is incompatible with -g. + + -F + Write the debugger output to dbg_file. + + -w This option invokes the algorithm to generate an error trace + divided into fated and free segements. Fate represents the + inevitability and free is asserted when there is no inevitability. + This can be formulated as a two-player concurrent reachability game. + The two players are the environment and the system. The node_file is + given to specify the variables the are controlled by the system. + + -W + This option represents the case that all input variables are controlled by + system. + + -G + We proposed two algorithms to generate segmented counterexamples: general + and restricted. By default we use the restricted algorithm. We can + invoke the general algorithm with -G option. For more information, + please read the STTT'04 paper by Jin et al., "Fate and Free Will in + Error Traces" + + + File containing invariants to be checked. + + Related "set" options: + + rch_simulate <#> + The set option can be used to set this flag rch_simulate to specify the + number of random vectors to be simulated. Default value for this number is + 0. + + ctl_change_bracket + Vl2mv automatically converts "[]" to "<>" in node names, therefore CTL + parser does the same thing. However, in some cases a user does not want to + change node names in CTL parsing. Then, use this set option by giving "no". + Default is "yes". + + See also command : compute_reach + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/init_verifyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_maigsCmd.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/flatten_hierarchyCmd.html + 4. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_maigsCmd.html + 5. file://localhost/projects/development/hsv/vis/common/doc/html/static_orderCmd.html + 6. file://localhost/projects/development/hsv/vis/common/doc/html/build_partition_mddsCmd.html + 7. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html + 8. file://localhost/projects/development/hsv/vis/common/doc/html/flatten_hierarchyCmd.html + 9. file://localhost/projects/development/hsv/vis/common/doc/html/print_hd_optionsCmd.html + 10. file://localhost/projects/development/hsv/vis/common/doc/html/print_ardc_optionsCmd.html + 11. file://localhost/projects/development/hsv/vis/common/doc/html/setCmd.html Index: vis_dev/vis-2.3/share/help/check_invariant_satCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/check_invariant_satCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/check_invariant_satCmd.txt (revision 14) @@ -0,0 +1,34 @@ + + check_invariant_sat - Check invariant property using sat based unmounded + model checking + _________________________________________________________________ + + check_invariant_sat [-h] [-d] [-t ] [-m ] [-v + ] + + Perform SAT-based unbounded model checking on And-Inverter-Graph. The + command compute fixed point of AG using AX operation. AX is implemented + using AllSAT enumeration algorithm. Command options: + + -d + Disable inclusion test on initial states. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -m + Specify the method for AllSAT algorithm. + + -h + Print the command usage. + + + File containing Invariant formulae to be checked. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/cnf_satCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/cnf_satCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/cnf_satCmd.txt (revision 14) @@ -0,0 +1,24 @@ + + cnf_sat - Perform SAT solving with CNF input + _________________________________________________________________ + + cnf_sat [-h] [-a ] [-f ] [-t ] + [-v ] [-b] + + Perform SAT solving with CirCUs after reading CNF file + + -b + If the given CNF has small number of variables and clause then the BDD is + built from the CNF clauses. If the monolithic BDD is built then we can + conclude SAT or UNSAT, otherwise the normal SAT algorithm is invoked. + + -t + Specify the time out period (in seconds) after which the command aborts. By + default this option is set to infinity. + + -f + Specify the output filename to save the satisfying assignments and the + statistics of SAT solving. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/collapse_childCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/collapse_childCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/collapse_childCmd.txt (revision 14) @@ -0,0 +1,41 @@ + + collapse_child - Collapses a parent (which is the current node) and a given + child node into the parent + _________________________________________________________________ + + collapse_child [-h] [-v] + + This command collapses the given child into the current node. After this + command, the number of children of the current node will decrease by one. + The variables in the child node will be renamed to reflect their original + name. For example, if the current node is named "foo" and it has two + children, "bar1" and "bar2", then after + + collapse_child bar1 + + is executed, the name of any variable occuring in bar1, say "xvar" will be + renamed "bar1$xvar". The new parent will have only the single child "bar2" + (which can be seen by typing "ls"). + + The user can use "cd" to traverse a hierarchy, go to a particular node. When + the user uses "write_blif" from a particular node, vis will write the + circuit in this node out. However, the user might want to do synthesis on + the entire circuit in the hierarchy. In that case, the hierarchy can be + collapsed into a single node, by repeatedly using this command. + + Examples: + + collapse_child P1 + + Collapse P1 into the current node. + + Command options: + + -h + Print the command usage. + + -v + Verbose mode. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/comb_verifyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/comb_verifyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/comb_verifyCmd.txt (revision 14) @@ -0,0 +1,98 @@ + + comb_verify - verify the combinational equivalence of two flattened networks + _________________________________________________________________ + + comb_verify [-b] [-f ] [-h] [-o ] [-t ] + [-1 ] [-2 ] [-i] + [] + + This command verifies the combinational equivalence of two flattened + networks. In particular, any set of functions (the roots), defined over any + set of intermediate variables (the leaves), can be checked for equivalence + between the two networks. Roots and leaves are subsets of the nodes of a + network, with the restriction that the leaves should form a complete support + for the roots. The correspondence between the roots and the leaves in the + two networks is specified in a file given by the option -f . The default + option assumes that the roots are the combinational outputs and the leaves + are the combinational inputs. + + When there is a pseudo input in the set of leaves, the range of values it + can take should be the same as that of the multi-valued variable + corresponding to it, for comb_verify to function correctly. This restriction + will be removed in future. + + There are two ways to do combinational verification. In the first mode, two + BLIF-MV files are given as arguments to the command, e.g. + + vis> comb_verify foo.mv bar.mv + + + Verification is done for the flattened networks at the root nodes of the two + BLIF-MV hierarchies. In any error messages printed, "network1" refers to the + first file, and "network2" refers to the second. Both of these networks are + freed at the end of the command. This mode is totally independent from any + existing hierarchy previously read in. In the second mode, it is assumed + that a hierarchy has already been read in. Then, comb_verify can be called + with a single BLIF-MV file, and this will do the comparison between the + network present at the current node ("network1") and the network + corresponding to the root node of the hierarchy in the BLIF-MV + file("network2"). A typical sequence of commands is: + + vis> read_blifmv foo.mv + vis> init_verify + vis> comb_verify bar.mv + + + If a hierarchy has been read in but a flattened network does not exist at + the current node (flatten_hierarchy has not been invoked), the command does + nothing. If a network exists at the current node, but the variables haven't + been ordered, then the variables are ordered and a partition created. This + partition is freed at the end. A side-effect is that the variables are + ordered. If a partition exists, then it is used if the vertices + corresponding to the roots specified are present in it, otherwise a new + partition is created with the current ordering. The partition created for + the new network read in is always freed at the end. + + Command options: + + -b + Specifies that the files are BLIF files and not BLIF-MV files. + + -f + Provides the correspondence between the leaves and roots of network1 + and network2. If this option is not used, it is assumed that the + correspondence is by name, except that two latch inputs match if + either they have the same name or the corresponding latch outputs + have the same name. Leaves are the combinational inputs, and roots + are the combinational outputs. + + -h + Print the command usage. + + -t + Time in seconds allowed to perform equivalence checking. The default + is infinity. + + -o + Specifies the ordering method to be used for assigning a common + ordering to the leaves of network1 and network2. If this option is + not used, ordering is done using a default method. Currently, only + the default method is available. + + -1 + Specifies the partitioning method to be used for network1. Supported + methods are "total", "partial", and "inout" (see the command + build_partition_mdds for more information). If this option is not + specified, then the default method "inout" is used. + + -2 + Specifies the partitioning method to be used for network2. Supported + methods are "total", "partial", and "inout" (see the command + build_partition_mdds for more information). If this option is not + specified, then default method "inout" is used. + + -i + Print Bdd statistics. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/compute_reachCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/compute_reachCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/compute_reachCmd.txt (revision 14) @@ -0,0 +1,154 @@ + + compute_reach - compute the set of reachable states of the FSM + _________________________________________________________________ + + compute_reach [-d ] [-f] [-g ] [-h] [-i] [-r + ] [-s ] [-t ] [-v #] [-A #] [-D] [-F] + + Compute the set of reachable states of the FSM associated with the flattened + network. The command build_partition_mdds (or init_verify) must have already + been invoked on the flattened network, before this command is called. On + subsequent calls to compute_reach, the reachable states will not be + recomputed, but statistics can be printed using -v. To force recomputation + with a different set of options, for example a depth value with -d, use -F + option. + + The method used for image computation is displayed by the option -v 1. To + change the image computation method, use the command set image_method, and + then start again with the command flatten_hierarchy. The reachability + computation makes extensive use of image computation. There are several + user-settable options that can be used to affect the performance of image + computation. See the documentation for the set command for these options. + + Command options: + + -d + Perform reachability for depthValue steps only - this option + specifies the number of unit operations (image computations) to be + performed in the reachability computation. The depthValue used in + successive calls proceeds from the previous state. For example, + compute_reach -d 3; compute_reach -d 4; will perform 7 steps of + reachability in total, the second call to compute_reach proceeding + from the result of the first. While using only -A 0 option (default), + this additionally corresponds to the depth in the state graph, + starting from the initial state. For the -A 1 option, the above may + not be true. This option is not compatible with -A 2. + + -f + Store the set of new states (onion rings) reached at each step of + reachability. If this flag is specified, then the computation + proceeds with the previously set of onion rings, if any exist (not + any prior computation without onion rings). This option is likely to + use more memory during reachability analysis. This is not compatible + with -A 2. + + -g + Use guided search. The file hints_file contains a series of hints. A + hint is a formula that does not contain any temporal operators, so + hints_file has the same syntax as a file of invariants used for + check_invariant. The hints are used in the order given to change the + transition relation. The transition relation is conjoined with the + hint to yield an underapproximation of the transition relation. If + the hints are cleverly chosen, this may speed up the computation + considerably, because a search with the changed transition relation + may be much simpler than one with the original transition relation, + and results obtained can be reused, so that we may never have to do + an expensive search with the original relation. See also: Ravi and + Somenzi, Hints to accelerate symbolic traversal. CHARME'99; Bloem, + Ravi, and Somenzi, Efficient Decision Procedures for Model Checking + of Linear Time Logic Properties, CAV'99; Bloem, Ravi, and Somenzi, + Symbolic Guided Search for CTL Model Checking, DAC'00. Not allowed + with -A 2 or -i, and will only work with iwls95 or monolithic image + methods. The description of some options for guided search can be + found in the help page for print_guided_search_options. + + -h + Print the command usage. + + -i + This option is useful when it's not possible to build the complete + transition relation. Using this option, the transition relation is + rebuilt at every itereation using the current reached set of states + as the care set. This option is not compatible with the -A > 0 + options, the -D option and the -g option. + + -r + Dynamic reordering (with method sift) is invoked once when the size + of the reachable state set reaches the threshold value. + + -s + At every printStep of the reachability computation, print the total + number of states reached thus far, and the size of the MDD + representing this set. + + -t + Time allowed to perform reachability (in seconds). Default is + infinity. + + -v # + Print debug information. + 0: (default) Nothing is printed out. + + 1: Print a summary of reachability analysis and some information + about the image computation method (see print_img_info) and + summarizes results of reachability: + + FSM depth: the farthest reachable state + reachable states: the number of reachable states + MDD size: the size of the MDD representing the reachable states + analysis time: number of CPU seconds taken to compute the reachable + states + + 2: Prints the detailed information about reachability analysis. For + each printStep, it prints the MDD size of the reachable state set and + the number of states in the set. + + -A # + This option allows specification of approximate reachability + computation. + + 0: (default) Breadth First Search. No approximate reachability + computation. + + 1: High Density Reachability Analysis (HD). Computes reachable states + in a manner that keeps BDD sizes under control. May be faster than + BFS in some cases. For larger circuits, this option should compute + more reachable states. For help on controlling options for HD, look + up help on the command: print_hd_options [1]print_hd_options. Refer + to Ravi and Somenzi, ICCAD95. This option is available only when VIS + is linked with the CUDD package. + + 2. Approximate Reachability Don't Cares(ARDC). Computes + over-approximate reachable states. For help on controlling options + for ARDC, look up help on the command: print_ardc_options + [2]print_ardc_options. Refer Moon's paper, ICCAD98 and 2 papers by + Cho et al, December TCAD96: one is for State Space Decomposition and + the other is for Approximate FSM Traversal. The options -d, -g and -f + are not compatible with this option. + + -D + First compute an overapproximation to the reachable states. Minimize + transition relation using this approximation, and then compute the + set of reachable states exactly. This may accelerate reachability + analysis. Refer to the paper by Moon et al, ICCAD98. The BDD + minimizing method can be chosen by using "set image_minimize_method " + [3]set. This option is incompatible with -i. + + -F + Force to recompute reachable states. + + Related "set" options: + + rch_simulate <#> + The set option can be used to set this flag rch_simulate to specify + the number of random vectors to be simulated. Default value for this + number is 0. + __________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/print_hd_optionsCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/print_ardc_optionsCmd.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/setCmd.html Index: vis_dev/vis-2.3/share/help/decompose_childCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/decompose_childCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/decompose_childCmd.txt (revision 14) @@ -0,0 +1,54 @@ + + decompose_child - Partitions Node components into child nodes. + _________________________________________________________________ + + decompose_child -n [-f ] [-c] [-v] [-t] [-l] + [] + + This command partitions the current Node into several new children nodes + according to user-specified groups. The user may specify several groups by + name [-n] sequentially on the command line. Within each group a list of + components (either variables or child nodes) can be placed. The flags [-c] + [-v] toggle whether element names are interpreted as child instances or + variables (default is instances [-c]). Element names can be loaded from a + file as well using the [-f] flag. + + By specifying a variable to be grouped, any object (e.g., Table, Latch, + Child) that PRODUCES that variable is included in the newly created child + node for that group. + + Command options: + + -n + Define new group + + -f + Load names from file + + -c + Interpret names that follow as child instances to group + + -v + Interpret names that follow as variables + + -l + Include all latch output nodes (and therefore latches) in group + + -t + Include all combinational tables in group. Examples: + + decompose_child -n c1 -v G1 G2 -n c2 IA IB + + Place variables G1 and G2 into a new child node c1 and child nodes IA and IB + into a new child node c2. + + Example: + + decompose_child -n ckt_inst child1 -f myinstances -v var1 -n latch_inst -l + + This groups the subckts child1 and those listed in the file myinstances, as + well as the variable var1 into a subckt called 'ckt_inst'. It also groups + all the latches into a subckt called 'latch_inst'. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/dynamic_var_orderingCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/dynamic_var_orderingCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/dynamic_var_orderingCmd.txt (revision 14) @@ -0,0 +1,126 @@ + + dynamic_var_ordering - control the application of dynamic variable ordering + _________________________________________________________________ + + dynamic_var_ordering [-d] [-e ] [-f ] [-h] + + Control the application of dynamic variable ordering to the flattened + network. Dynamic ordering is a technique to reorder the MDD variables to + reduce the size of the existing MDDs. When no options are specified, the + current status of dynamic ordering is displayed. At most one of the options + -e, -f, and -d should be specified. The commands flatten_hierarchy and + static_order must be invoked before this command. + + Dynamic ordering may be time consuming, but can often reduce the size of the + MDDs dramatically. The good points to invoke dynamic ordering explicitly + (using the -f option) are after the commands build_partition_mdds and + print_img_info. If dynamic ordering finds a good ordering, then you may wish + to save this ordering (using write_order) and reuse it (using static_order + -s) in the future. A common sequence used to get a good ordering is the + following: + + init_verify + print_img_info + dynamic_var_ordering -f sift + write_order + flatten_hierarchy + static_order -s input_and_latch -f + build_partition_mdds + print_img_info + dynamic_var_ordering -f sift + + + For many large examples, there is no single best variable order, or that + order is hard to find. For example, the best ordering during partitioning of + the network may be different from the best ordering during a model check. In + that case you can use automatic reordering, using the -e option. This will + trigger reordering whenever the total size of the MDD increases by a certain + factor. Often, the init command is replaced by the following sequence: + flatten_hierarchy + static_order + dynamic_var_ordering -e sift + build_partition_mdds + + + Command options: + + -d + Disable dynamic ordering from triggering automatically. + + -e + Enable dynamic ordering to trigger automatically whenever a certain + threshold on the overall MDD size is reached. "Method" must be one of + the following: + + window: Permutes the variables within windows of three adjacent + variables so as to minimize the overall MDD size. This process is + repeated until no more reduction in size occurs. + + sift: Moves each variable throughout the order to find an optimal + position for that variable (assuming all other variables are fixed). + This generally achieves greater size reductions than the window + method, but is slower. + + The following methods are only available if VIS has been linked with + the Bdd package from the University of Colorado (cuBdd). + + random: Pairs of variables are randomly chosen, and swapped in the + order. The swap is performed by a series of swaps of adjacent + variables. The best order among those obtained by the series of swaps + is retained. The number of pairs chosen for swapping equals the + number of variables in the diagram. + + random_pivot: Same as random, but the two variables are chosen so + that the first is above the variable with the largest number of + nodes, and the second is below that variable. In case there are + several variables tied for the maximum number of nodes, the one + closest to the root is used. + + sift_converge: The sift method is iterated until no further + improvement is obtained. + + symmetry_sift: This method is an implementation of symmetric sifting. + It is similar to sifting, with one addition: Variables that become + adjacent during sifting are tested for symmetry. If they are + symmetric, they are linked in a group. Sifting then continues with a + group being moved, instead of a single variable. + + symmetry_sift_converge: The symmetry_sift method is iterated until no + further improvement is obtained. + + window{2,3,4}: Permutes the variables within windows of n adjacent + variables, where "n" can be either 2, 3 or 4, so as to minimize the + overall MDD size. + + window{2,3,4}_converge: The window{2,3,4} method is iterated until no + further improvement is obtained. + + group_sift: This method is similar to symmetry_sift, but uses more + general criteria to create groups. + + group_sift_converge: The group_sift method is iterated until no + further improvement is obtained. + + lazy_sift: This method is similar to group_sift, but the creation of + groups takes into account the pairing of present and next state + variables. + + annealing: This method is an implementation of simulated annealing + for variable ordering. This method is potentially very slow. + + genetic: This method is an implementation of a genetic algorithm for + variable ordering. This method is potentially very slow. + + -f + Force dynamic ordering to be invoked immediately. The values for + method are the same as in option -e. + + -h + Print the command usage. + + -v <#> + Verbosity level. Default is 0. For values greater than 0, statistics + pertaining to reordering will be printed whenever reordering occurs. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/echoCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/echoCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/echoCmd.txt (revision 14) @@ -0,0 +1,15 @@ + + echo - merely echo the arguments + _________________________________________________________________ + + echo [-h] + + Echoes the arguments to standard output. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/flatten_hierarchyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/flatten_hierarchyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/flatten_hierarchyCmd.txt (revision 14) @@ -0,0 +1,87 @@ + + flatten_hierarchy - create a flattened network + _________________________________________________________________ + + flatten_hierarchy [-a ] [-b] [-h] [-s] [-v #] + + Creates a flattened network from a hierarchical description. The flattened + network encompasses everything from the current node of the hierarchy + (reached by the command cd), down to and including the leaves. It creates a + view with the hierarchy removed, but retains the multi-level logic + structure. The resulting flattened network is stored with the current node. + Every table in the flattened network is checked whether it is completely + specified and deterministic. This is the starting point for verification + related commands. + + A limited form of abstraction can be done by providing a list of variables + to treat as primary inputs. See the information under below. + + The verification part of VIS requires the functions specified by the BLIF-MV + tables to be completely specified and deterministic. These conditions are + checked during the flattening process; if a table is found that is + incompletely specified or is nondeterministic, then an error message is + written and a flattened network is not created. The exception to this rule + is tables specifying "pseudo inputs"; these are tables with no inputs, and a + single output that can take more than one value. Such tables are generated + by vl2mv to model the "$ND" construct in Verilog. + + If this command is invoked a second time from the same point in the + hierarchy, the previous network is deleted and a new one is created. This is + the tactic to follow if you want to change some aspect of the current + network, such as MDD variable ordering or image_method. + + Command options: + + -a + A file containing names of variables, used to specify which variables + to abstract. The name of a variable is the full hierarchical path + name, starting from just after the current hierarchy node (i.e., if + the current node is foo, and you want to refer to variable x in foo, + then just use x). A variable should appear at most once in the file. + Each variable name should appear at the beginning of a new line, with + no white space preceding it. The end of a variable name is marked by + white space, and any other text on the rest of the line is ignored. + Any line starting with "#" or white space is ignored. A sample file + is shown here. + + # variables to abstract to model check liveness property + choosing0 + p0.pc + + + For each variable x appearing in the file, a new primary input node + named x$ABS is created to drive all the nodes that were previously + driven by x. Hence, the node x will not have any fanouts; however, x + and its transitive fanins will remain in the network. + + Abstracting a net effectively allows it to take any value in its + range, at every clock cycle. This mechanism can be used to perform + manual abstractions. The variables to abstract should not affect the + correctness of the property being checked. This usually simplifies + the network, and permits some verification tasks to complete that + would not otherwise. Note, however, that by increasing the behavior + of the system, false negatives are possible when checking universal + properties, and false positives are possible when checking + existential properties. + + A convenient way of generating the hierarchical variable names is by + using the write_order command. Note that abstracting next state + variables has no effect. + + -b + This option has no effect any longer. + + -h + Print the command usage. + + -s + Do not perform a sweep. + + -v # + Print debug information. + 0: (default) Nothing is printed out. + + >= 2: Prints the variables read from the input file. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/helpCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/helpCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/helpCmd.txt (revision 14) @@ -0,0 +1,21 @@ + + help - provide on-line information on commands + _________________________________________________________________ + + help [-a] [-h] [] + + Given no arguments, "help" prints a list of all commands known to the + command interpreter. If a command name is given, detailed information for + that command will be provided. + + Command options: + + -a + Provides a list of all internal commands, which by convention begin + with an underscore. + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/historyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/historyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/historyCmd.txt (revision 14) @@ -0,0 +1,70 @@ + + history - list previous commands and their event numbers + _________________________________________________________________ + + history [-h] [] + + Lists previous commands and their event numbers. This is a UNIX-like history + mechanism inside the VIS shell. + + Command options: + + -h + Print the command usage. + + + Lists the last events. Lists the last 30 events if is not + specified. + + History Substitution: + + The history substitution mechanism is a simpler version of the csh history + substitution mechanism. It enables you to reuse words from previously typed + commands. + + The default history substitution character is the `%' (`!' is default for + shell escapes, and `#' marks the beginning of a comment). This can be + changed using the "set" command. In this description '%' is used as the + history_char. The `%' can appear anywhere in a line. A line containing a + history substitution is echoed to the screen after the substitution takes + place. `%' can be preceded by a `\' in order to escape the substitution, for + example, to enter a `%' into an alias or to set the prompt. + + Each valid line typed at the prompt is saved. If the "history" variable is + set (see help page for "set"), each line is also echoed to the history file. + You can use the "history" command to list the previously typed commands. + + Substitutions: + + At any point in a line these history substitutions are available. + + %:0 + Initial word of last command. + + %:n + n-th argument of last command. + + %$ + Last argument of last command. + + %* + All but initial word of last command. + + %% + Last command. + + %stuf + Last command beginning with "stuf". + + %n + Repeat the n-th command. + + %-n + Repeat the n-th previous command. + + ^old^new + Replace "old" with "new" in previous command. Trailing spaces are + significant during substitution. Initial spaces are not significant. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/incremental_ctl_verificationCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/incremental_ctl_verificationCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/incremental_ctl_verificationCmd.txt (revision 14) @@ -0,0 +1,163 @@ + + incremental_ctl_verification - Verify a set of CTL formulas by means of an + incremental model checking algorithm. + _________________________________________________________________ + + incremental_ctl_verification [-D ] [-e] [-h] [-n] \ [-s] [-t + ] [-v ] [-V ] [-x] + + Like model_check, incremental_ctl_verification verifies a set of CTL + formulas. It uses a system of abstraction and incremental refinement that + works for all of (fair)CTL, using over and underapproximations as + appropriate. See [1,2] for details. + + Incremental_ctl_verification (also known as Abs or Trasgo) works especially + well on large systems on which mc is too slow or runs out of memory. Unlike + amc, it can handle full CTL, not just the universal or existential subsets + of it. Also, fairness is supported with this command, although it tends to + be inefficient. Support for the mu-calculus is not yet implemented. + + Before using incremental_ctl_verification, a flattened hierarchy should be + present. See `help init`. Using dynamic variable reordering may be + beneficial on large systems. See `help dynamic_var_ordering`. + + Fairness constraints can be applied using `read_fairness', as with mc. When + using incremental verification with fairness, there is no check for unfair + initial states. Please be aware that if there are no fair initial states, + all formulas starting with "A" will be trivially true. Mc will tell you + whether you have fair initial states. + + A typical use would be + incremental_ctl_verification -D2 + + For every formula, incremental verification will report whether it is valid + or invalid, or it returns an inconclusive result. A formula is valid iff it + holds for all initial states. An error trace is not provided. For the people + who are used to mc: The -r option is not supported, incremental verification + always reduces the fsm with respect to individual formulas. The -c option is + not supported either. There is no sharing of subformulas between different + formulas. + + Command options: + + -D + Specify extent to which don't cares are used to simplify the MDDs. + + + 0: No Don't Cares used. + + 1: Use reachability information to compute the don't-care set. + Reachability is performed by formula. This is different from mc, + where reachability is performed only once. + + 2: Use reachability information, and minimize the transition + relation with respect to the `frontier set' (aggresive + minimization). + + The equivalent of mc -D3 is not implemented. + + -e + Compute the set of fair states (those satisfying the formula EGfair + TRUE) before the verification process and use the result as care set. + In certain cases this will speed up computation when fairness + constraints are present. In other cases it will slow it down. + + -h + Print the command usage. + + -n + Try to prove the negation of every formula. In some cases it may be + easier to prove the negation of a formula than the formula itself. + For systems with only one initial state, a formula is true iff its + negation is false. Note that for systems with multiple initial states + a formula and its negation can both be false. + + -s + Print a summary of statistics after the verification. + + -t + Time in seconds allowed to spend in the verification. The default is + infinity. + + -v + Specify verbosity level. Use 0 for no feedback (default), 1 for more + and 2 for maximum feedback. This option can not be used in + conjunction with -V. + + -V + Mask specifying type of information to be printed out while verifying + the formulas. This allows for a finer control than -v. -V and -v + cannot be used simultaneously. The mask is given as a binary number, + by taking the logical or of the following binary values. One does not + have to convert these numbers to decimal. + + 1 number of primary inputs and flip-flops + + 10 labeled operational graph of the formulas + + 100 cpu-time for the computation in each vertex + + 1000 cubes of the function sat for each vertex + + 10000 cubes of the function goalSet for each vertex + + 100000 vertex data structure contents after evaluation + + 1000000 cubes in the care set for every evaluation + + 10000000 size of care set for every evaluation + + 100000000 number of states that satisfy every sub-formula + + 1000000000 number of overall reachable states + + 10000000000 cubes for every iteration of a fixed point + + 100000000000 size of the BDD in each iteration in a fix-point + + 1000000000000 labeled operational graph in dot format + + 10000000000000 number of envelope states + + 100000000000000 number of states to be refined + + 1000000000000000 size of the refinement operands + + 10000000000000000 cubes of the refinement operands + + 100000000000000000 Number of latches before and after simplification + + 1000000000000000000 report partial progress (i.e. reach, + EG(true),...) + + 10000000000000000000 Begin/End refinement process + + 100000000000000000000 Size of goal set + + 1000000000000000000000 cubes of the goal set + + 10000000000000000000000 Contents of vertex after refinement + + -x + Perform the verification exactly. No approximation is done. + + + File containing the CTL formulas to be verified. + + Related "set" options: + + ctl_change_bracket + Vl2mv automatically converts "[]" to "<>" in node names, therefore + CTL parser does the same thing. However, in some cases a user does + not want to change node names in CTL parsing. Then, use this set + option by giving "no". Default is "yes". + + See also commands : model_check, incremental_ctl_verification + + 1. A. Pardo and G. Hachtel. Automatic abstraction techniques for + propositional mu-calculus model checking. In 9th Conference on Computer + Aided Verification (CAV'97). Springer-Verlag. Pages 12-23, 1997. + + 2. A. Pardo and G. Hachtel. Incremental CTL model checking using BDD + subsetting. In 35th Design Automation Conference (DAC'98). pages 457-462, + 1998. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/init_verifyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/init_verifyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/init_verifyCmd.txt (revision 14) @@ -0,0 +1,28 @@ + + init_verify - create and initialize a flattened network for verification + _________________________________________________________________ + + init_verify [-b] [-h] + + This command initializes the system for verification, and is equivalent to + the command sequence flatten_hierarchy; static_order; build_partition_mdds. + If a command returns an error condition, then the sequence is aborted. After + init_verify has successfully executed, various commands can be invoked, like + model_check, compute_reach, simulate, print_network_stats, and seq_verify. + + Please note that init_verify does not enable dynamic variable reordering. + Sometimes, though, this is needed to complete building the partitions, and + one has to initialize the verification by hand. Similarly, it may be wise to + turn on dynamic variable reordering after init, so that further commands + complete more easily. See the help page for dynamic_var_ordering. + + Command options: + + -b + This option has no effect any longer. + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/iterative_model_checkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/iterative_model_checkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/iterative_model_checkCmd.txt (revision 14) @@ -0,0 +1,94 @@ + + iterative_model_check - Perform CTL model checking on an abstracted system + with automatic refinement algorithm. + _________________________________________________________________ + + iterative_model_check [-h] [-x] [-t ] [-v ]\ [-D ] + [-r ] [-i ] \ [-p ] [-g ] + + Command options: + + -h + Print the command usage. + + -x + Perform the verification exactly. No approximation is done. + + -t + Time in seconds allowed for verification. The default is no limit. + + -v + Specify verbosity level. Use 0 for no feedback (default), 1 for more, + and 2 for maximum feedback. + + -D + Specify extent to which don't cares are used to simplify the MDDs. + + + 0: No don't cares used. This is the default. + + 1: Use reachability information to compute the don't-care set. + + 2: Use reachability information, and minimize the transition + relation with respect to the `frontier set' (aggresive + minimization). + + 3: Use approximate reachability information. + + -r + Specify refinement method. + + + 0: Static scheduling by name sorting. Fast, easy, but less + accurate. + + 1: Static scheduling by latch affinity. Slow, but more accurate. + This is the default. + + -i + The number of state variables to be added for exact computation at + each iteration. The default is 4. + + -l + Type of lower-bound approximation method. + + + 0: Take a subset of each transition sub-relation by BDD subsetting. + + 1: Take a subset by universal quantification. This is the default. + + -p + Type of partition method. If 'build_partition_mdds' is already + invoked, this option is ignored. Notice that some next state + functions might not be available after iterative_model_checking + command is performed because of this option. + + + 0: Build all next state functions. Same as 'build_partition_mdds'. + This is the default. + + 1: Build the next state functions related to the formulas. Build + all next state functions that are necessary to prove all formulas. + + 2: Build the next state functions incrementally. None of next state + functions are removed. + + -g + Type of operational graph. + + + 0: Negative Operational Graph. Good to prove a formula true. + + 1: Positive Operational Graph. Good to prove a formula false. + + 2: Mixed Operational Graph. Good to prove any formula, but it may + be slower. This is the default. + + + File containing the CTL formulas to be verified. + + Related "set" options: + + ctl_change_bracket + Vl2mv automatically converts "[]" to "<>" in node names, therefore + CTL parser does the same thing. However, in some cases a user does + not want to change node names in CTL parsing. Then, use this set + option by giving "no". Default is "yes". + + See also commands : model_check, incremental_ctl_verification + + 1. Jae-Young Jang, In-Ho Moon, and Gary D. Hachtel. Iterative + Abstraction-based CTL Model Checking. Design, Automation and Test in Europe + (DATE), 2000 + + 2. Jae-Young Jang. Iterative Abstraction-based CTL Model Checking. Ph. D. + Thesis. University of Colorado, 1999. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/lang_emptyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/lang_emptyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/lang_emptyCmd.txt (revision 14) @@ -0,0 +1,150 @@ + + lang_empty - perform language emptiness check on a flattened network + _________________________________________________________________ + + lang_empty [-b] [-d ] [-f ] [-h] [-i] [-s] [-t + ] [-v ] [-A ] [-D ] + [-S ] [-L ] + + Performs language emptiness check on a flattened network. The language is + not empty when there is a fair path starting at an initial state. Before + calling this command, the user should have initialized the design by calling + the command [1]init_verify. + + A fairness constraint can be read in by calling the [2]read_fairness + command; if none is specified, all paths are taken to be fair. + + The system is reduced automatically with respect to the set of fairness + constraints. If the language is not empty, a proof of this fact is + generated. A proof is a fair path starting at an initial state. This is + represented by a finite sequence of states starting at an initial state (the + stem) leading to a fair cycle, i.e., a cycle on which there lies a state + from each fairness condition. + + Command options: + + -b + Use backward analysis when performing debugging; the default is to + use forward analysis. This should be tried when the debugger spends a + large amount of time when creating a path to a fair cycle. + + -d + Specify whether to demonstrate a proof of the language non-emptiness + + dbg_level must be one of the following: + + 0 : No debugging performed. This is the default. + + 1 : Generate a path to a fair cycle. + + -f + Write the debugger output to dbg_file. + + -h + Print the command usage. + + -m + Pipe debugger output through the UNIX utility more. + + -i + Print input values causing transitions between states during + debugging. Both primary and pseudo inputs are printed. + + -s + Print debug output in the format accepted by the [3]simulate command. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + + verbosity_level must be one of the following: + + 0 : No feedback provided. This is the default. + + 1 : Feedback on code location. + + 2 : Feedback on code location and CPU usage. + + -A + Specify whether the compositional SCC analysis algorithm, Divide and + Compose (DnC), is enabled for language emptiness checking. The DnC + algorithm first enumerates fair SCCs in an over-approximated abstract + model, and then successively refines them in the more concrete + models. Since non-fair SCCs can be ignored in the more concrete + models, a potentially large part of the state space are pruned away + early on when the computations are cheap. + + le_method must be one of the following: + + 0 : no use of Divide and Compose (Default). + + 1 : use Divide and Compose. + + -D + Specify extent to which don't cares are used to simplify MDDs. Don't + cares are minterms on which the value taken by functions does not + affect the computation; potentially, these minterms can be used to + simplify MDDs and reduce time taken to perform MDD computations. + + dc_level must be one of the following: + + 0 : No don't cares are used. + + 1 : Use unreachable states as don't cares. This is the default. + + -S + Specify schedule for GSH algorithm, which generalizes the Emerson-Lei + algorithm and is used to compute greatest fixpoints. The choice of + schedule affects the sequence in which EX and EU operators are + applied. It makes a difference only when fairness constraints are + specified. + must be one of the following: + + EL : EU and EX operators strictly alternate. This is the default. + + EL1 : EX is applied once for every application of all EUs. + + EL2 : EX is applied repeatedly after each application of all EUs. + + budget : a hybrid of EL and EL2. + + random : enabled operators are applied in (pseudo-)random order. + + off : GSH is disabled, and the old algorithm is used instead. The old + algorithm uses the EL , but the termination checks are less + sophisticated than in GSH. + + -F + Use forward analysis in the computation of the greatest fixpoint. + This option is incompatible with -d 1 or higher and can only be used + with -D 1. + + -L + Use the lockstep algorithm, which is based on fair SCC enumeration. + must be one of the following: + + off : Lockstep is disabled. This is the default. Language emptiness + is checked by computing a hull of the fair SCCs. + + on : Lockstep is enabled. + + all : Lockstep is enabled; all fair SCCs are enumerated instead of + terminating as soon as one is found. This can be used to study the + SCCs of a graph, but it is slower than the default option. + + n : (n is a positive integer). Lockstep is enabled and up to n fair + SCCs are enumerated. This is less expensive than all , but still less + efficient than on , even when n = 1 . + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/init_verifyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/html/read_fairnessCmd.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/simulateCmd.html Index: vis_dev/vis-2.3/share/help/lsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/lsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/lsCmd.txt (revision 14) @@ -0,0 +1,18 @@ + + ls - list all the child nodes at the current node + _________________________________________________________________ + + ls [-h] [-R] + + Lists all the child nodes at the current node. + + Command options: + + -h + Print the command usage. + + -R + Call ls recursively all the way down to leaves. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/ltl2snfCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/ltl2snfCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/ltl2snfCmd.txt (revision 14) @@ -0,0 +1,19 @@ + + ltl2snf - Trnalate LTL formula into Separated Normal Form. + _________________________________________________________________ + + ltl2snf [-h] + + Command options: + + -f + The input file containing LTL formulae. + + -n + Negate the formulae. + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/ltl_model_checkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/ltl_model_checkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/ltl_model_checkCmd.txt (revision 14) @@ -0,0 +1,215 @@ + + ltl_model_check - perform LTL model checking on a flattened network + _________________________________________________________________ + + ltl_model_check [-a ] [-b] [-d ] [-f + ] [-h] [-i] [-m] [-s] [-t ][-v ] + [-A ] [-D ] [-L ] [-S ] [-F] + [-X] [-Y] [-M] + + Performs LTL model checking on a flattened network. Before calling this + command, the user should have initialized the design by calling the command + [1]init_verify. Regardless of the options, no 'false positives' or 'false + negatives' will occur: the result is correct for the given circuit. + + Properties to be verified should be provided as LTL formulae in the file + ltl_file. Note that the support of any wire referred to in a formula should + consist only of latches. For the precise syntax of LTL formulas, see the + [2]VIS CTL and LTL syntax manual. + + A formula passes iff it is true for all initial states of the system. + Therefore, in the presence of multiple initial states, if a formula fails, + the negation of the formula may also fail. + + If a formula does not pass, a (potentially partial) proof of failure + (referred to as a debug trace) is demonstrated. Fair paths are represented + by a finite sequence of states (the stem) leading to a fair cycle, i.e. a + cycle on which there is a state from each fairness condition. Whether + demostrate the proof or not can be specified (see option -d). + + Command options: + + -a + Specify the algorithm used in LTL formula -> Buechi automaton + translation. + + ltl2aut_algorithm must be one of the following: + + 0: GPVW. + + 1: GPVW+. + + 2: LTL2AUT. + + 3: WRING (default). + + -b + Use boolean minimization during the LTL to Automaton translation. + + -d + Specify whether to demonstrate a counter-example when the system + fails a formula being checked. + + dbg_level must be one of the following: + + 0: No debugging performed. dbg_level=0 is the default. + + 1: Generate a counter-example (a path to a fair cycle). + + -f + Write the debugger output to dbg_file. + + -h + Print the command usage. + + -i + Print input values causing transitions between states during + debugging. Both primary and pseudo inputs are printed. + + -m + Pipe debugger output through the UNIX utility more. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -s + Print debug output in the format accepted by the [3]simulate command. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + verbosity_level must be one of the following: + + 0: No feedback provided. This is the default. + + 1: Feedback on code location. + + 2: Feedback on code location and CPU usage. + + -A + Specify whether the compositional SCC analysis algorithm, Divide and + Compose (DnC), is enabled for language emptiness checking. The DnC + algorithm first enumerates fair SCCs in an over-approximated abstract + model, and then successively refines them in the more concrete + models. Since non-fair SCCs can be ignored in the more concrete + models, a potentially large part of the state space are pruned away + early on when the computations are cheap. + + le_method must be one of the following: + + 0 : no use of Divide and Compose (Default). + + 1 : use Divide and Compose. + + -D + Specify extent to which don't cares are used to simplify MDDs in + model checking. Don't cares are minterms on which the value taken by + functions does not affect the computation; potentially, these + minterms can be used to simplify MDDs and reduce the time taken to + perform model checking. + dc_level must be one of the following: + + 0 : No don't cares are used. + + 1 : Use unreachable states as don't cares. This is the default. + + 2 : Use unreachable states as don't cares and in the EU computation, + use 'frontiers' for image computation. + + 3 : First compute an overapproximation of the reachable states + (ARDC), and use that as the cares set. Use `frontiers' for image + computation. For help on controlling options for ARDC, look up help + on the command: [4]print_ardc_options. Refer to Moon, Jang, Somenzi, + Pixley, Yuan, "Approximate Reachability Don't Cares for {CTL} Model + Checking", ICCAD98, and to two papers by Cho et al, IEEE TCAD + December 1996: one is for State Space Decomposition and the other is + for Approximate FSM Traversal. + + -S + Specify schedule for GSH algorithm, which generalizes the Emerson-Lei + algorithm and is used to compute greatest fixpoints. The choice of + schedule affects the sequence in which EX and EU operators are + applied. It makes a difference only when fairness constraints are + specified. + must be one of the following: + + EL : EU and EX operators strictly alternate. This is the default. + + EL1 : EX is applied once for every application of all EUs. + + EL2 : EX is applied repeatedly after each application of all EUs. + + budget : a hybrid of EL and EL2 + + random : enabled operators are applied in (pseudo-)random order. + + off : GSH is disabled, and the old algorithm is used instead. The old + algorithm uses the EL , but the termination checks are less + sophisticated than in GSH. + + -F + Use forward analysis in the computation of the greatest fixpoint. + This option is incompatible with -d 1 or higher and can only be used + with -D 1. + + -L + Use the lockstep algorithm, which is based on fair SCC enumeration. + must be one of the following: + + off : Lockstep is disabled. This is the default. Language emptiness + is checked by computing a hull of the fair SCCs. + + on : Lockstep is enabled. + + all : Lockstep is enabled; all fair SCCs are enumerated instead of + terminating as soon as one is found. This can be used to study the + SCCs of a graph, but it is slower than the default option. + + n : (n is a positive integer). Lockstep is enabled and up to n fair + SCCs are enumerated. This is less expensive than all , but still less + efficient than on , even when n = 1 . + + -X + Disable strength reduction (use different decision procedures for + strong, weak, and terminal automaton). Strength reduction is the + default. Refer to Bloem, Ravi, Somenzi, "Efficient Decision + Procedures for LTL Model Checking," CAV99. + + -Y + Disable incremental construction of the partition for (MxA). Instead, + build a new partition from the scratch. Incremental construction of + the partition is the default. + + -Z + Add arcs into the Buechi automaton by direct simulation relation, to + heuristically reduce the length of shortest counter-example in model + checking. Refer to Awedh and Somenze, "Proving More Properties with + Bounded Model Checking," CAV04. + + -M + Maximize (adding arcs to) Buechi automaton using Direct Simulation. + + + File containing LTL formulas to be model checked. + + Related "set" options: + + ltl_change_bracket + Vl2mv automatically converts "[]" to "<>" in node names, therefore + CTL* parser does the same thing. However, in some cases a user does + not want to change node names in CTL* parsing. Then, use this set + option by giving "no". Default is "yes". + + See also commands : model_check, approximate_model_check, + incremental_ctl_verification + __________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/init_verifyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/simulateCmd.html + 4. file://localhost/projects/development/hsv/vis/common/doc/html/print_ardc_optionsCmd.html Index: vis_dev/vis-2.3/share/help/ltl_to_autCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/ltl_to_autCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/ltl_to_autCmd.txt (revision 14) @@ -0,0 +1,85 @@ + + ltl_to_aut - translate LTL formulae into Buechi automata + _________________________________________________________________ + + ltl_to_aut [-f ] [-m ] [-o ] [-t + ] [-w] [-b] [-p] [-d] [-r] [-i] [-M] [-v ] [-h] + + Translate the given LTL formulae into Buechi automata, and output the + automaton into a file. + + The translation algorithms are the same as the one used in + [1]ltl_model_check . However, more flexible combination of the options can + be used with this command. + + The automaton can be displayed on the screen and written into a file. The + format of the output can be dot, blifmv, verilog and smv. + + Command options: + + -f + The input file containing LTL formulae. + + -m + Specify the algorithm used in LTL formula -> Buechi automaton + translation algorithm. + + algorithm must be one of the following: + + 0: GPVW. + + 1: GPVW+. + + 2: LTL2AUT. + + 3: WRING (default). + + -o + Write the automata into this file. + + -t + Specify the output format of the automata. + + output_format must be one of the following: + + 0: dot. + + 1: blif_mv. + + 2: verilog. + + 3: all of the formats above (default). + + -w + Rewriting the formula before translation. + + -b + Boolean minimization during the translation. + + -p + Pruning the fair states in the Buechi automaton. + + -d + Direct-simulation minimization of the Buechi automaton. + + -r + Reverse-simulation minimization of the Buechi automaton. + + -i + Minimization based ont the I/O structural information. + + -M + Maximize (adding arcs to) Buechi automaton using Direct Simulation. + + -v + Specify verbosity level. It must be one of the following: 0,1,2,3. + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/ltl_model_checkCmd.html Index: vis_dev/vis-2.3/share/help/model_checkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/model_checkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/model_checkCmd.txt (revision 14) @@ -0,0 +1,319 @@ + + model_check - perform fair CTL model checking on a flattened network + _________________________________________________________________ + + model_check [-b] [-c] [-d ] [-f ] [-g ] + [-h] [-i] [-m] [-r] [-t ][-v ] [-D + ] [-F] [-S ] [-V] [-B] [-I] [-C] [-w ] [-W] + [-G] + + Performs fair CTL model checking on a flattened network. Before calling this + command, the user should have initialized the design by calling the command + [1]init_verify. Regardless of the options, no 'false positives' or 'false + negatives' will occur: the result is correct for the given circuit. + + Properties to be verified should be provided as CTL formulas in the file + ctl_file. Note that the support of any wire referred to in a formula should + consist only of latches. For the precise syntax of CTL formulas, see the + [2]VIS CTL and LTL syntax manual. + + Properties of the form AG f, where f is a formula not involving path + quantifiers are referred to as invariants; for such properties it may be + substantially faster to use the [3]check_invariant command. + + A fairness constraint can be specified by invoking the [4]read_fairness + command; if none is specified, all paths are taken to be fair. If some + initial states do not lie on a fair path, the model checker prints a message + to this effect. + + A formula passes iff it is true for all initial states of the system. + Therefore, in the presence of multiple initial states, if a formula fails, + the negation of the formula may also fail. + + If a formula does not pass, a (potentially partial) proof of failure + (referred to as a debug trace) is demonstrated. Fair paths are represented + by a finite sequence of states (the stem) leading to a fair cycle, i.e. a + cycle on which there is a state from each fairness condition. The level of + detail of the proof can be specified (see option -d). + + Both backward (future tense CTL formulas) and forward (past tense CTL + formulas) model checking can be performed. Forward model checking is based + on Iwashita's ICCAD96 paper. Future tense CTL formulas are automatically + converted to past tense ones as much as possible in forward model checking. + + Command options: + + -b + Use backward analysis when performing debugging; the default is to + use forward analysis. This should be tried when the debugger spends a + large amount of time when creating a path to a fair cycle. This + option is not compatible with forward model checking option (-F). + + -c + Use the formula tree so that there is no sharing of sub-formulae + among the formulae in the input file. This option is useful in the + following scenario - formulae A, B and C are being checked in order + and there is sub-formula sharing between A and C. If the BDDs + corresponding to the shared sub-formula is huge then computation for + B might not be able to finish without using this option. + + -d + Specify the amount of debugging performed when the system fails a + formula being checked. Note that it may not always be possible to + give a simple counter-example to show that a formula is false, since + this may require enumerating all paths from a state. In such a case + the model checker will print a message to this effect. This option is + incompatible with -F. + + dbg_level must be one of the following: + + 0: No debugging performed. dbg_level=0 is the default. + + 1: Debugging with minimal output: generate counter-examples for + universal formulas (formulas of the form AX|AF|AU|AG) and witnesses + for existential formulas (formulas of the form EX|EF|EU|EG). States + on a path are not further analyzed. + + 2: Same as dbg_level=1, but more verbose. (The subformulas are + printed, too.) + + 3: Maximal automatic debugging: as for level 1, except that states + occurring on paths will be recursively analyzed. + + 4: Manual debugging: at each state, the user is queried if more + feedback is desired. + + -f + Write the debugger output to dbg_file. This option is incompatible + with -F. Notes: when you use -d4 (interactive mode), -f is not + recommended, since you can't see the output of vis on stdout. + + -g + Use guided search. The file hints_file contains a series of hints. A + hint is a formula that does not contain any temporal operators, so + hints_file has the same syntax as a file of invariants used for + check_invariant. The hints are used in the order given to change the + transition relation. In the case of least fixpoints (EF, EU), the + transition relation is conjoined with the hint, whereas for greatest + fixpoints the transition relation is disjoined with the negation of + the hint. If the hints are cleverly chosen, this may speed up the + computation considerably, because a search with the changed + transition relation may be much simpler than one with the original + transition relation, and results obtained can be reused, so that we + may never have to do a complicated search with the original relation. + Note: hints in terms of primary inputs are not useful for greatest + fixpoints. See also: Ravi and Somenzi, Hints to accelerate symbolic + traversal. CHARME'99; Bloem, Ravi, and Somenzi, Efficient Decision + Procedures for Model Checking of Linear Time Logic Properties, + CAV'99; Bloem, Ravi, and Somenzi, Symbolic Guided Search for CTL + Model Checking, DAC'00. + + For formulae that contain both least and greatest fixpoints, the + behavior depends on the flag guided_search_hint_type. If it is set to + local (default) then every subformula is evaluated to completion, + using all hints in order, before the next subformula is started. For + pure ACTL or pure ECTL formulae, we can also set + guided_search_hint_type to global, in which case the entire formula + is evaluated for one hint before moving on to the next hint, using + underapproximations. The description of the options for guided search + can be found in the help page for print_guided_search_options. + + model_check will call reachability without any guided search, even if + -g is used. If you want to perform reachability with guided search, + call rch directly. + + Incompatible with -F. + + -h + Print the command usage. + + -i + Print input values causing transitions between states during + debugging. Both primary and pseudo inputs are printed. This option is + incompatible with -F. + + -m + Pipe debugger output through the UNIX utility more. This option is + incompatible with -F. + + -r + Reduce the FSM derived from the flattened network with respect to + each formula being checked. By default, the FSM is reduced with + respect to the conjunction of the formulae in the input file. If this + option is used and don't cares are being used for simplification, + then subformula sharing is disabled (result might be incorrect + otherwise). + + The truth of a formula may be independent of parts of the network + (such as when wires have been abstracted; see [5]flatten_hierarchy). + These parts are effectively removed when this option is invoked; this + may result in more efficient model checking. + + -t + Specify the time out period (in seconds) after which the command + aborts. By default this option is set to infinity. + + -v + Specify verbosity level. This sets the amount of feedback on CPU + usage and code status. + verbosity_level must be one of the following: + + 0: No feedback provided. This is the default. + + 1: Feedback on code location. + + 2: Feedback on code location and CPU usage. + + -B + Check for vacuously passing formulae using the algorithm of Beer et + al. (CAV97). The algorithm applies to a subset of ACTL (w-ACTL) and + replaces the smallest important subformula of a passing property with + either FALSE or TRUE depending on its negation parity. It then + applies model checking to the resulting witness formula. If the + witness formula also passes, then the original formula is deemed to + pass vacuously. If the witness formula fails, a counterexample to it + provides an interesting witness to the original passing formula. See + the CAV97 paper for the definitions of w-ACTL, important subformula, + and interesting witness. In short, one of the operands of a binary + operator in a w-ACTL formula must be a propositional formula. See + also the -V option. + + -C + Compute coverage of all observable signals in a set of CTL formulae + using the algorithm of Hoskote, Kam, Ho, Zhao (DAC'99). If the + verbosity level (-v option) is equal to 0, only the coverage stats + are printed. If verbosity level is greater than zero, then detailed + information of the computation at each step of the algorithm is also + provided. Debug information is provided in the form of states not + covered for each observable signal if the dbg_level (-d option) is + greater than 0. The number of states printed is set by the vis + environment variable 'nr_uncoveredstates'. By default the number of + states printed is 1. The value of nr_uncoveredstates can be set using + the set command. See also the -I option. + + -D + Specify extent to which don't cares are used to simplify MDDs in + model checking. Don't cares are minterms on which the values taken by + functions do not affect the computation; potentially, these minterms + can be used to simplify MDDs and reduce the time taken to perform + model checking. The -g flag for guided search does not affect the way + in which the don't-care conditions are computed. + dc_level must be one of the following: + + 0 : No don't cares are used. + + 1 : Use unreachable states as don't cares. This is the default. + + 2 : Use unreachable states as don't cares and in the EU computation, + use 'frontiers' for image computation. + + 3 : First compute an overapproximation of the reachable states + (ARDC), and use that as the cares set. Use `frontiers' for image + computation. For help on controlling options for ARDC, look up help + on the command: [6]print_ardc_options. Refer to Moon, Jang, Somenzi, + Pixley, Yuan, "Approximate Reachability Don't Cares for {CTL} Model + Checking", ICCAD98, and to two papers by Cho et al, IEEE TCAD + December 1996: one is for State Space Decomposition and the other is + for Approximate FSM Traversal. + + -F + Use forward model checking based on Iwashita's method in ICCAD96. + Future tense CTL formulas are automatically converted to past tense + ones as much as possible. Converted forward formulas are printed when + verbosity is greater than 0. Debug options (-b, -d, -f, -i, and -m) + are ignored with this option. We have seen that forward model + checking was much faster than backward in many cases, also forward + was much slower than backward in many cases. + + -I + Compute coverage of all observable signals in a set of CTL formulae + using an improved algorithm of Jayakumar, Purandare, Somenzi + (DAC'03). If the verbosity level (-v option) is equal to 0, only the + coverage stats are printed. If verbosity level is greater than zero, + then detailed information of the computation at each step of the + algorithm is also provided. Debug information is provided in the form + of states not covered for each observable signal if the dbg_level (-d + option) is greater than 0. The number of states printed is set by the + vis environment variable 'nr_uncoveredstates'. By default the number + of states printed is 1. The value of nr_uncoveredstates can be set + using the set command. Compared to the -C option, this one produces + more accurate results and deals with a larger subset of CTL. + + -S + Specify schedule for GSH algorithm, which generalizes the Emerson-Lei + algorithm and is used to compute greatest fixpoints. The choice of + schedule affects the sequence in which EX and EU operators are + applied. It makes a difference only when fairness constraints are + specified. + must be one of the following: + + EL : EU and EX operators strictly alternate. This is the default. + + EL1 : EX is applied once for every application of all EUs. + + EL2 : EX is applied repeatedly after each application of all EUs. + + budget : a hybrid of EL and EL2. + + random : enabled operators are applied in (pseudo-)random order. + + off : GSH is disabled, and the old algorithm is used instead. The old + algorithm uses the EL schedule, but the termination checks are less + sophisticated than in GSH. + + -V + Check for vacuously passing formulae with the algorithm of Purandare + and Somenzi (CAV2002). The algorithm applies to all of CTL, and to + both passing and failing properties. It says whether a passing + formula may be strengthened and still pass, and whether a failing + formula may be weakened and still fail. It considers all leaves of a + formula that are under one negation parity (e.g., not descendants of + a XOR or EQ node) for replacement by either TRUE or FALSE. See also + the -B option. + + -w This option invoked the algorithm to generate an error trace + divided into fated and free segements. Fate represents the + inevitability and free is asserted when there is no inevitability. + This can be formulated as a two-player concurrent reachability game. + The two players are the environment and the system. The node_file is + given to specify the variables the are controlled by the system. + + -W + This option represents the case that all input variables are controlled by + system. + + -G + We proposed two algorithm to generate segemented counter example. They are + general and restrcited algorithm. Bu default we use restricted + algorithm. We can invoke general algorithm with -G option. For more + information, please check the STTT'04 paper of Jin et al., "Fate and + Free Will in Error Traces" + + + File containing CTL formulas to be model checked. + + Related "set" options: + + ctl_change_bracket + Vl2mv automatically converts "[]" to "<>" in node names, therefore + CTL parser does the same thing. However, in some cases a user does + not want to change node names in CTL parsing. Then, use this set + option by giving "no". Default is "yes". + + guided_search_hint_type + Switches between local and global hints (see the -g option, or the + help page for set). + + See also commands : approximate_model_check, incremental_ctl_verification + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/init_verifyCmd.html + 2. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html + 3. file://localhost/projects/development/hsv/vis/common/doc/html/check_invariantCmd.html + 4. file://localhost/projects/development/hsv/vis/common/doc/html/read_fairnessCmd.html + 5. file://localhost/projects/development/hsv/vis/common/doc/html/flatten_hierarchyCmd.html + 6. file://localhost/projects/development/hsv/vis/common/doc/html/print_ardc_optionsCmd.html Index: vis_dev/vis-2.3/share/help/network_sweepCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/network_sweepCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/network_sweepCmd.txt (revision 14) @@ -0,0 +1,19 @@ + + network_sweep - sweeps the network to ensure that deterministic constants are + removed + _________________________________________________________________ + + network_sweep [-h][-v] + + This function performs a sweep on the given Ntk_Network_t. It propagates all + the deterministic constant nodes, and removes all buffer nodes. It modifies + the network. Command options: + + -h + Print the command usage. + + -v + Print debug information. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_aig_statsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_aig_statsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_aig_statsCmd.txt (revision 14) @@ -0,0 +1,26 @@ + + print_aig_stats - print statistics about the AND/INVERTER graph. + _________________________________________________________________ + + print_aig_stats [-h] [-n] + + Print the following statistics about the AND/INVERTER graph: + + Maximum number of nodes: the maximum number of nodes in the AND/ INVERTER + graph. + + Current number of nodes: the number of nodes in the AND/INVERTER graph + that are used. + + Note that build_partition_maigs must be called before this command. + + Command options: + + -n + Print the name of the nodes. + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_ardc_optionsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_ardc_optionsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_ardc_optionsCmd.txt (revision 14) @@ -0,0 +1,233 @@ + + print_ardc_options - print information about the ARDC options currently in + use + _________________________________________________________________ + + print_ardc_options [-h] [-H] + + Prints information about the current ARDC options. + + Command options: + + -h + Print the command usage. + + -H + Print the ARDC set command usage. + + Set parameters: The ARDC options are specified with the set command. + + ardc_traversal_method + Specify a method for approximate FSM traversal. + + method must be one of the following: + + 0 : MBM (machine by machine). + + 1 : RFBF(reached frame by frame). + + 2 : TFBF(to frame by frame). + + 3 : TMBM(combination of MBM and TFBF). + + 4 : LMBM(least fixpoint MBM, default). + + 5 : TLMBM(combination of LMBM and TFBF). + + ardc_group_size + Specify the number of latches per group for ARDCS. + + size must be a positive integer (default = 8). + + ardc_affinity_factor + Specify affinity factor to make a group for ARDCs. The available + factor is from 0.0(use only correlation) to 1.0(use only dependency). + + affinity must be a positive real (default = 0.5). + + ardc_max_iteration + Specify the maximum iteration count during approximate FSM traversal. + Default is 0 which means infinite. + + iteration must be a positive integer or zero. + + ardc_constrain_target + Specify where image constraining will be applied to. + + target must be one of the following: + + 0 : constrain transition relation (default). + + 1 : constrain initial states. + + 2 : constrain both. + + ardc_constrain_method + Specify an image constraining method to compute ARDCs. + + method must be one of the following: + + 0 : restrict (default). + + 1 : constrain + + 2 : compact (currently supported by only CUDD) + + 3 : squeeze (currently supported by only CUDD) + + ardc_constrain_reorder + Specify whether to enable variable reorderings during consecutive + image constraining operations. + + method must be one of the following: + + yes : allow variable reorderings during consecutive image + constraining operations (default) + + no : don't allow variable reorderings during consecutive image + constraining operations + + ardc_abstract_pseudo_input + Specify when to abstract pseudo primary input variables out from + transition relation. + + method must be one of the following: + + 0 : do not abstract pseudo input variables + + 1 : abstract pseudo inputs before image computation (default) + + 2 : abstract pseudo inputs at every end of image computation + + 3 : abstract pseudo inputs at the end of approximate traversal + + ardc_decompose_flag + Specify whether to use decomposed approximate reachable states or + single conjuncted reachable states. + + method must be one of the following: + + yes : keep decomposed reachable stateses (default) + + no : make a conjunction of reachable states of all submachines + + ardc_projected_initial_flag + Specify which initial states is going to be used. + + method must be one of the following: + + yes : use projected initial states for submachine (default) + + no : use original initial states for submachine + + ardc_image_method + Specify image_mathod during computing reachable states of + submachines. + + method must be one of the following: + + monolithic : use monolithic image computation + + iwls95 : use iwls95 image computation (default) + + mlp : use mlp image computation + + tfm : use tfm image computation + + hybrid : use hybrid image computation + + ardc_use_high_density + Specify whether to use high density in computing reachable states of + submachines. + + method must be one of the following: + + yes : use High Density for reachable states of submachines + + no : use BFS for reachable states of submachines (default) + + ardc_reorder_ptr + Specify whether to reorder partitioned transition relation after + constraining fanin submachines. + + method must be one of the following: + + yes : whenever partitioned transition relation changes, reorders + partitioned transition relation + + no : no reordering of partitioned transition relation (default) + + ardc_fanin_constrain_mode + Specify which method will be used in constraining fanin submachines. + + method must be one of the following: + + 0 : constrain w.r.t. the reachable states of fanin submachines + (default) + + 1 : constrain w.r.t. the reachable states of both fanin submachines + and itself + + ardc_create_pseudo_var_mode + Specify which method will be used to create pseudo input variables of + submachines. + + method must be one of the following: + + 0 : makes pseudo input variables with exact support (default) + + 1 : makes pseudo input variables from all state variables of the + other submachines + + 2 : makes pseudo input variables from all state variables of fanin + submachines + + ardc_lmbm_initial_mode + Specify which method will be used as initial states in LMBM + computation. + + method must be one of the following: + + 0 : use given initial states all the time + + 1 : use current reached states as initial states (default) + + 2 : use current frontier as initial states + + set ardc_mbm_reuse_tr + Specify whether to reuse already constrained transition relation for + next iteratrion in MBM. + + method must be one of the following: + + yes : use constrained transition relation for next iteration + + no : use original transition relation for next iteration (default) + + ardc_read_group + Specify a filename containing grouping information + + filename containing grouping information + + ardc_write_group + Specify a filename to write grouping information + + filename to write grouping information + + ardc_verbosity + Specify the level of printing information during computing ARDCs. + + verbosity must be 0 - 3 (default = 0). + + The default settings correspond to the fast variants of LMBM and MBM. MBM + never produces a more accurate approximation than LMBM for the same + state-space decomposition. However, the corresponding statement does not + hold for the fast versions. (That is, FastMBM will occasionally outperform + FastLMBM.) To get the slower, but more accurate versions of LMBM and MBM use + the following settings: + * set ardc_constrain_method 1 + * set ardc_constrain_reorder no + * set ardc_abstract_pseudo_input 0 + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_bdd_statsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_bdd_statsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_bdd_statsCmd.txt (revision 14) @@ -0,0 +1,21 @@ + + print_bdd_stats - print the BDD statistics for the flattened network + _________________________________________________________________ + + print_bdd_stats [-h] + + Print the BDD statistics for the flattened network. The MDDs representing + the functions of the network are themselves represented by BDDs via an + encoding of the multi-valued variables into binary valued variables. The + statistics given by this command depend on the underlying BDD package with + which VIS was linked. To get more information about the statistics, consult + the documentation for the given BDD package. The commands flatten_hierarchy + and static_order must be invoked before this command. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_fairnessCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_fairnessCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_fairnessCmd.txt (revision 14) @@ -0,0 +1,17 @@ + + print_fairness - print the fairness constraint of the flattened network + _________________________________________________________________ + + print_fairness [-h] + + Print the fairness constraint (i.e the set of Buchi conditions) associated + with the FSM of the flattened network. By default, the flattened network has + the single constraint TRUE, indicating that all paths are fair. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_guided_search_optionsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_guided_search_optionsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_guided_search_optionsCmd.txt (revision 14) @@ -0,0 +1,61 @@ + + print_guided_search_options - print information about guided_search_options + in use + _________________________________________________________________ + + print_guided_search_options [-h] + + Prints information about current Guided Search options. Guided search is an + alternate method to compute fixpoints by modifying the fixpoint computation + with restrictions. It is applicable to the compute_reach, check_invariant + and model_check commands (refer to their help pages on the use of guided + search). See also for details: Ravi and Somenzi, Hints to accelerate + symbolic traversal. CHARME'99; Bloem, Ravi, and Somenzi, Efficient Decision + Procedures for Model Checking of Linear Time Logic Properties, CAV'99; + Bloem, Ravi, and Somenzi, Symbolic Guided Search for CTL Model Checking, + DAC'00. Not allowed with -A 2 or -i, and will only work with iwls95 or + monolithic image methods. The description of some options can be found in + the help page for set. + + Command options: + + guided_search_hint_type + Choose from local (default) or global. If this flag is set to local, + then every subformula is evaluated to completion, using all hints in + order, before the next subformula is started. For pure ACTL or pure + ECTL formulae, we can also set guided_search_hint_type to global, in + which case the entire formula is evaluated for one hint before moving + on to the next hint, using underapproximations. + + guided_search_underapprox_minimize_method + Choose from "constrain" and "and" (default). Sets the method with + which the transition relation is minimized when underapproximations + are used. The option constrain is incompatible with hints that use + signals other than inputs. + + guided_search_overapprox_minimize_method + Choose from "squeeze" and "ornot" (default). Sets the method with + which the transition relation is minimized when underapproximations + are used. The option squeeze is incompatible with hints that use + signals other than inputs. Ornot implies that the transition relation + will be disjoined with the negation of the hint: T' = T + ~h, whereas + squeeze will find a small BDD between T and T'. + + guided_search_sequence + For compute_reach and check_invariant only. Set this flag to a list + of comma-separated integers i1,i2,...,in, with n at most the number + of hints that you specify . The k'th hint will be used for ik + iterations (images). A value of 0 causes the hint to be applied to + convergence. Not setting this option is like setting it to 0,0,...,0. + If length of the specified sequence is less than the number of hints, + the sequence is padded with zeroes. + + Guided search also uses the High Density traversal options that are germane + to dead-ends. The relevant flags are hd_dead_end, hd_dead_end_approx_method, + hd_frontier_approx_threshold,hd_approx_quality,hd_approx_bias_quality.Use + help on the print_hd_options command for explanation of these flags. If + guided search is used with HD using the -A 1 options in compute_reach and + check_invariant, the HD options are used by both HD and guided search. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_hd_optionsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_hd_optionsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_hd_optionsCmd.txt (revision 14) @@ -0,0 +1,168 @@ + + print_hd_options - print information about the HD options currently in use + _________________________________________________________________ + + print_hd_options [-h] + + Prints information about the current HD options. The HD method is an + alternate method to compute a least fixpoint and is provided with the + compute_reach and check_invariant commands. The method is described in Ravi + and Somenzi, ICCAD95. The command can be used only when compiled with the + CUDD package. + + Command options: + + -h + Print the command usage. + + Set parameters: The HD options are specified with the set command. + + hd_frontier_approx_method + This option specifes the method to approximate the frontier set. + + Methods: + + remap_ua : (Default) The BDD approximation method of DAC98 Ravi, + Shiple, McMillan, Somenzi. + + biased_rua : Approximation method similar to remap_ua, but uses a + bias function. The bias function is set appropriate to the context. + + under_approx : The BDD approximation method of Shiple's thesis. + + heavy_branch : The BDD approximation method of ICCAD95 Ravi, Somenzi. + + short_paths : The BDD approximation method of ICCAD95 Ravi, Somenzi. + + compress : An approximation method that runs short_paths first and + then remap_ua. + + hd_frontier_approx_threshold + This option specifes the size of the frontier to be used for image + computation. The threshold for the various methods is approximate + (not strictly adhered to). For the remap_ua and biased_rua method, + this threshold is a lower bound and the default is 3500. For the + short_paths and heavy_branch methods, this threshold is an upper + bound. Therefore, a default of 2000 is set to obtain a meaningful + result. Any value lower than 2000 is corrected to this default. This + value is also relevant for dead-end computations. In a dead-end, the + threshold for each image computation (of a disjunct of Reached) is + five times the frontier approximation threshold. When the frontier + approximation threshold is 0, the threshold for each dead-end image + computation is 5000. + + hd_approx_quality + This option specifies the quality factor for the under_approx and + remap_ua methods. Default value is 1.0. The range is any double value + greater than 0. Smaller quality factors produce smaller results. + Meaningful values are between 1 and 2. + + hd_approx_bias_quality + This option specifies the quality factor for the biased_rua method. + Default value is 0.5. The range is any double value greater than 0. + Smaller quality factors produce smaller results. Meaningful values + are between 0 and 1. + + hd_dead_end + This option specifies the method used for dead-end computation. A + "dead-end" is characterized by an empty frontier. A dead-end + computation involves generating new states from the reached set. + + Methods: + + brute_force : Computes the image of the entire reached set. May be + fatal if the reached set is very large. + + conjuncts : (Default) Computes the image of reached by decomposing + into parts. + + hybrid : Computes the image of a subset of reached. If no new states, + then the reaminder is decomposed in parts. + + hd_dead_end_approx_method + This option allows the specification of the approximation method to + use to compute the subset of Reached at the dead-end. The threshold + used is the same as hd_frontier_approx_threshold. + + For methods, refer hd_frontier_approx_method methods. Default is + remap_ua. + + hd_no_scrap_states + This allows the option of not adding the "scrap" states. Scrap states + are residues from the approximation of the frontier set. Default is + to add the scrap states. + + hd_new_only + This allows the option of adding considering only new states of each + iteration for image computation. The default is to take a set in the + interval of the new states and the reached set. + + hd_only_partial_image + This allows the option of HD with partial image computation only (no + approximation of the frontier set). Default is to allow both partial + images and approximation of the frontier set. + + Partial Image options: + + hd_partial_image_method + This option allows the image computation to approximate the image + with the specified method. + + Methods: + + approx : (Default) Computes a partial image by under-approximating + the intermediate products of image computation. + + clipping : Computes a partial image by "clipping" the depth of + recursion of the and-abstract computations during image computation. + + hd_partial_image_threshold + This options allows the specification of a threshold (in terms of bdd + node size of the intermediate product) that will trigger + approximation of the intermediate product. Default is 200000. This + option has to be used in conjunction with hd_partial_image_size. If + the value of hd_partial_image_size is larger than this option, then + the approximation of the intermediate size will be as large as the + hd_partial_image_size number. + + hd_partial_image_size + This options allows the specification of a size (in terms of bdd node + size of the intermediate product) that is the target size of the + approximated intermediate product. Default is 100000. For the + short_paths and heavy_branch methods, the size of the approximation + is corrected to 10000 if the size specified is lower. This is because + the short_paths and heavy_branch methods consider this size as an + upper bound on the approximation. This option has to be used in + conjunction with hd_partial_image_threshold. If the value of + hd_partial_image_threshold is much larger than this option, then the + desired size will not be obtained as approximation may not be + triggered. + + hd_partial_image_approx + This options allows the specification of the method to be used to + approximate the intermediate product. + + For methods, refer hd_frontier_approx_method methods. Default is + remap_ua. + + hd_partial_image_approx_quality + This option specifies the quality factor for the under_approx and + remap_ua methods for partial image computation. Default value is 1.0. + Range of values is any double greater than 0. Smaller quality factors + produce smaller results. Meaningful values are between 1 and 2. + + hd_partial_image_approx_bias_quality + This option specifies the quality factor for the biased_rua method + for partial image computation. Default value is 0.5. Range of values + is any double greater than 0. Smaller quality factors produce smaller + results. Meaningful values are between 0 and 1. + + hd_partial_image_clipping_depth + This option allows the specification of the depth at which the + recursion can be clipped when _hd_partial_image_method_ is clipping. + Range of values is between 0 and 1. The clipping depth is then + calculated as the specified fraction of the number of variables. + Default is 0.4. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_hierarchy_statsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_hierarchy_statsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_hierarchy_statsCmd.txt (revision 14) @@ -0,0 +1,19 @@ + + print_hierarchy_stats - print the statistics of the current node + _________________________________________________________________ + + print_hierarchy_stats [-h] [-R] + + Prints the statistics of the current node. Note that it is not necessary to + invoke flatten_hierarchy first to create a network. + + Command options: + + -h + Print the command usage + + -R + Print statistics for nodes recursively all the way down to leaves. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_hybrid_optionsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_hybrid_optionsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_hybrid_optionsCmd.txt (revision 14) @@ -0,0 +1,283 @@ + + print_hybrid_options - print information about the hybrid image computation + options currently in use + _________________________________________________________________ + + print_hybrid_options [-h] [-H] + + Prints information about the current hybrid image computation options. + + Command options: + + -h + Print the command usage. + + -H + Print the hybrid image computation set command usage. + + Set parameters: The hybrid image computation options are specified with the + set command. + + hybrid_mode + Specify a mode how to start hybrid computation. + + mode must be one of the following: + + 0 : start with only transition function and build transition relation + on demand + + 1 : start with both transition function and relation (default) + + 2 : start with only transition relation. Only this mode can deal with + nondeterminism. + + hybrid_tr_split_method + Specify a method to choose a splitting variable in hybrid mode = 2. + + method must be one of the following: + + 0 : use support (default) + + 1 : use estimate BDD size + + hybrid_build_partial_tr + Specify whether to build full or partial transition relation in + hybrid mode = 2. This option is used to use less memory. When we use + partial transition relation, for the variables excluded in the + transition relation, we build each bit transition relation on demand. + When nondeterminism exists in the circuit, this can not be used. + method must be one of the following: + + yes : build partial transition relation + + no : build full transition relation (default) + + hybrid_partial_num_vars + Specify how many variables are going to be excluded in building + partial transition relation. The default is 8. + + hybrid_partial_method + Specify a method to choose variables to be excluded in building + partial transition relation. + + method must be one of the following: + + 0 : use BDD size (default) + + 1 : use support + + hybrid_delayed_split + Specify a method whether to split transition relation immediately or + just all at once before AndExist. + + method must be one of the following: + + yes : apply splitting to transition relation at once + + no : do not apply (default) + + hybrid_split_min_depth + Specify the minimum depth to apply dynamic hybrid method. If a depth + is smaller than this minimum depth, just split. The default is 1. + + hybrid_split_max_depth + Specify the maximum depth to apply dynamic hybrid method. If a depth + is bigger than this maximum depth, just conjoin. The default is 5. + + hybrid_pre_split_min_depth + Specify the minimum depth to apply dynamic hybrid method in preimage + computation. If a depth is smaller than this minimum depth, just + split. The default is 0. + + hybrid_pre_split_max_depth + Specify the maximum depth to apply dynamic hybrid method in preimage + computation. If a depth is bigger than this maximum depth, just + conjoin. The default is 4. + + hybrid_lambda_threshold + Specify a threshold in floating between 0.0 and 1.0 to determine to + split or to conjoin after computing variable lifetime lambda for + image computation. If lambda is equal or smaller than this threshold, + we conjoin. Otherwise we split. The default is 0.6 + + hybrid_pre_lambda_threshold + Specify a threshold in floating between 0.0 and 1.0 to determine to + split or to conjoin after computing variable lifetime lambda for + preimage computation. If lambda is equal or smaller than this + threshold, we conjoin. Otherwise we split. The default is 0.65 + + hybrid_conjoin_vector_size + If the number of components in transition function vector is equal or + smaller than this threshold, we just conjoin. This check is performed + before computing lambda. The default is 10. + + hybrid_conjoin_relation_size + If the number of clusters in transition relation is equal or smaller + than this threshold, we just conjoin. This check is performed before + computing lambda. The default is 2. + + hybrid_conjoin_relation_bdd_size + If the shared BDD size of transition relation is equal or smaller + than this threshold, we conjoin. This check is performed before + computing lambda. The default is 200. + + hybrid_improve_lambda + When variable lifetime lambda is bigger than lambda threshold, if the + difference between previous and current lambda is equal or smaller + than this threshold, then we conjoin. The default is 0.1. + + hybrid_improve_vector_size + When variable lifetime lambda is bigger than lambda threshold, if the + difference between the previous and current number of components in + transition function vector is equal or smaller than this threshold, + then we conjoin. The default is 3. + + hybrid_improve_vector_bdd_size + When variable lifetime lambda is bigger than lambda threshold, if the + difference between the previous and current shared BDD size of + transition function vector is equal or smaller than this threshold, + then we conjoin. The default is 30.0. + + hybrid_decide_mode + Specify a method to decide whether to split or to conjoin. + + method must be one of the following: + + 0 : use only lambda + + 1 : use lambda and also special checks to conjoin + + 2 : use lambda and also improvement + + 3 : use all (default) + + hybrid_reorder_with_from + Specify a method to reorder transition relation to conjoin in image + computation, whether to include from set in the computation. + + method must be one of the following: + + yes : reorder relation array with from to conjoin (default) + + no : reorder relation array without from to conjoin + + hybrid_pre_reorder_with_from + Specify a method to reorder transition relation to conjoin in + preimage computation, whether to include from set in the computation. + + method must be one of the following: + + yes : reorder relation array with from to conjoin + + no : reorder relation array without from to conjoin (default) + + hybrid_lambda_mode + Specify a method to decide which variable lifetime to be used for + image computation. + + method must be one of the following: + + 0 : total lifetime with ps/pi variables (default) + + 1 : active lifetime with ps/pi variables + + 2 : total lifetime with ps/ns/pi variables + + hybrid_pre_lambda_mode + Specify a method to decide which variable lifetime to be used for + preimage computation. + + method must be one of the following: + + 0 : total lifetime with ns/pi variables + + 1 : active lifetime with ps/pi variables + + 2 : total lifetime with ps/ns/pi variables (default) + + 3 : total lifetime with ps/pi variables + + hybrid_lambda_with_from + Specify a method to compute variable lifetime lambda, whether to + include from set in the computation. + + method must be one of the following: + + yes : include from set in lambda computation (default) + + no : do not include + + hybrid_lambda_with_tr + Specify a method to compute variable lifetime lambda, whether to use + transition relation or transition function vector, when both exist. + + method must be one of the following: + + yes : use transition relation (default) + + no : use transition function vector + + hybrid_lambda_with_clustering + Specify a method whether to include clustering to compute variable + lifetime lambda. + + method must be one of the following: + + yes : compute lambda after clustering + + no : do not cluster (default) + + hybrid_synchronize_tr + Specify a method to keep transition relation. This option is only for + when hybrid mode is 1. + + method must be one of the following: + + yes : rebuild transition relation from function vector whenever the + function vector changes + + no : do not rebuild (default) + + hybrid_img_keep_pi + Specify a method to build forward transition relation. + + method must be one of the following: + + yes : keep all primary input variables in forward transition + relation. + + no : quantify out local primary input variables from the transition + relation. (default) + + hybrid_pre_keep_pi + Specify a method to build backward transition relation. + + method must be one of the following: + + yes : keep all primary input variables in backward transition + relation and preimages. + + no : quantify out local primary input variables from the transition + relation. (default) + + hybrid_pre_canonical + Specify a method whether to canonicalize the function vector for + preimage computation. + + method must be one of the following: + + yes : canonicalize the function vector + + no : do not canonicalize (default) + + hybrid_tr_method lt;methodgt; + Specify an image method for AndExist operation in hybrid method. + + method must be one of the following: + + iwls95 (default) + + mlp + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_img_infoCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_img_infoCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_img_infoCmd.txt (revision 14) @@ -0,0 +1,27 @@ + + print_img_info - print information about the image method currently in use + _________________________________________________________________ + + print_img_info [-b] [-f] [-h] + + Prints information about the image computation method currently being used + by the FSM. This includes the particular values of parameters used by the + method for initialization. If the image information does not exist, then + this command forces the information to be computed. If none of the flags (-b + or -f) is set, forward transition relation is computed. + + Command options: + + -b + Compute the transition relation for backward image computation (if + needed). + + -f + Compute the transition relation for forward image computation (if + needed). + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_ioCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_ioCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_ioCmd.txt (revision 14) @@ -0,0 +1,15 @@ + + print_io - print the names of inputs/outputs in the current node + _________________________________________________________________ + + print_io [-h] + + Prints the names of inputs/outputs in the current node. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_latchesCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_latchesCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_latchesCmd.txt (revision 14) @@ -0,0 +1,15 @@ + + print_latches - print the names of latches in the current node + _________________________________________________________________ + + print_latches [-h] + + Prints the names of latches in the current node. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_mlp_optionsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_mlp_optionsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_mlp_optionsCmd.txt (revision 14) @@ -0,0 +1,72 @@ + + print_mlp_options - print information about the MLP image computation options + currently in use + _________________________________________________________________ + + print_mlp_options [-h] [-H] + + Prints information about the current MLP image computation options. + + Command options: + + -h + Print the command usage. + + -H + Print the MLP image computation set command usage. + + Set parameters: The MLP image computation options are specified with the set + command. + + mlp_cluster + Specify a method for clustering. + + method must be one of the following: + + 0 : linear clustering + + 1 : affinity based tree clustering (default) + + mlp_reorder + Specify a method for reordering after clustering for image + computation. + + method must be one of the following: + + 0 : no reordering after clustering (default) + + 1 : reorder using MLP after clustering (inside) + + 2 : reorder using MLP after clustering (outside) + + 3 : reorder using IWLS95 after clustering + + mlp_pre_reorder + Specify a method for reordering after clustering for preimage + computation. + + method must be one of the following: + + 0 : no reordering after clustering (default) + + 1 : reorder using MLP after clustering (inside) + + 2 : reorder using MLP after clustering (outside) + + 3 : reorder using IWLS95 after clustering + + mlp_postprocess + Specify when to do postprocessing. + + method must be one of the following: + + 0 : no postprocessing (default) + + 1 : do postprocesing after ordering + + 2 : do postprocesing after clustering or reordering + + 3 : do both 1 and 2 + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_modelsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_modelsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_modelsCmd.txt (revision 14) @@ -0,0 +1,16 @@ + + print_models - list all the models and their statistics + _________________________________________________________________ + + print_models [-h] + + Lists all the models and prints information about the number of variables, + tables, latches etc. in them. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_networkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_networkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_networkCmd.txt (revision 14) @@ -0,0 +1,39 @@ + + print_network - print information about the flattened network + _________________________________________________________________ + + print_network [-f] [-h] [-t] + + Prints the name of the flattened network, and information about each node. + For each node, prints the following: + + name: the name of the node + + mdd: MDD id (-1 is uninitialized) + + type: one of combinational, primary-input, pseudo-input, latch, or shadow + + derived attributes: list of derived attributes of the node + + See the ntk documentation for more information on types and attributes. The + following is an example describing information associated with a node. + small.latch_in: mdd=2, combinational; data-input comb-output + + + The flattened name of the node is "small.latch_in", its MDD id is 2, it is + of type combinational, and it is both a data input to a latch, and a + combinational output. + + Command options: + + -f + Print the fanins and fanouts of each node. + + -h + Print the command usage. + + -t + Print table statistics for those nodes having tables. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_network_dotCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_network_dotCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_network_dotCmd.txt (revision 14) @@ -0,0 +1,27 @@ + + print_network_dot - print a dot description of the flattened network + _________________________________________________________________ + + print_network_dot [-h] + + Write a file in the format taken by the tool dot depicting the topology of + the network. Dot is a tool that given a description of a graph in a certain + format it produces a postscript print of the graph. For more information + about dot look in [1]http://www.research.att.com/orgs/ssr/book/reuse. Once a + dot file is produced with this command, the shell command dot -Tps >.ps will + produce the postscript file depicting the network. + + If no argument is specified on the command line, the description is written + to the standard output. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. http://www.research.att.com/orgs/ssr/book/reuse Index: vis_dev/vis-2.3/share/help/print_network_statsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_network_statsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_network_statsCmd.txt (revision 14) @@ -0,0 +1,41 @@ + + print_network_stats - print statistics about the flattened network + _________________________________________________________________ + + print_network_stats [-h] + + Prints the following statistics about the flattened network: + + name: the name of the flattened network + + combinational: the number of nodes which have a table defining the + function of the node (excludes pseudo inputs) + + primary inputs: the number of primary input nodes of the flattened network + + primary outputs: the number of primary output nodes of the flattened + network + + latches: the number of (multi-valued) latches + + pseudo inputs: the number of pseudo input nodes of the flattened network + + constants: the number of combinational nodes that implement a multi-valued + constant + + edges: the number of fanouts in the network (e.g. if the output of a node + is used in two places, this contributes two to the sum) + + Note that flatten_hierarchy must be called before this command. + + Example output: + small combinational=2 pi=2 po=0 latches=1 pseudo=0 const=1 edges=4 + + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_partitionCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_partitionCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_partitionCmd.txt (revision 14) @@ -0,0 +1,28 @@ + + print_partition - print the "dot" format describing the partition graph + _________________________________________________________________ + + print_partition [-h] + + Write a file in the format taken by the tool dot. Dot is a tool that, given + a description of a graph in a certain format, produces a postscript print of + the graph. For more information about dot look in + [1]http://www.research.att.com/sw/tools/graphviz. + + If no argument is specified on the command line, the output is written to + the standard output. + + Command options: + + -h + Print the command usage. + + + Name of file where the partition is to be written in "dot" format. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. http://www.research.att.com/sw/tools/graphviz Index: vis_dev/vis-2.3/share/help/print_partition_aig_dotCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_partition_aig_dotCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_partition_aig_dotCmd.txt (revision 14) @@ -0,0 +1,29 @@ + + print_partition_aig_dot - Print a dot description of the AND/INVERTER graph + that was built for the flattened network + _________________________________________________________________ + + print_partition_aig_dot [-h] + + Write a file in the format taken by the tool dot depicting the topology of + the AND/INVERTER graph. Dot is a tool that given a description of a graph in + a certain format it produces a postscript print of the graph. For more + information about dot look in + [1]http://www.research.att.com/orgs/ssr/book/reuse. Once a dot file is + produced with this command, the shell command dot -Tps >.ps will produce the + postscript file depicting the network. + + If no argument is specified on the command line, the description is written + to the standard output. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. http://www.research.att.com/orgs/ssr/book/reuse Index: vis_dev/vis-2.3/share/help/print_partition_statsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_partition_statsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_partition_statsCmd.txt (revision 14) @@ -0,0 +1,30 @@ + + print_partition_stats - print statistics about the partition graph + _________________________________________________________________ + + print_partition_stats [-h] [-n] + + Print statistics about the partition currently attached to the network, such + as: + + Method used to build the partition. + + Number of sink vertices. + + Number of source vertices. + + Total number of vertices. + + Number of shared MDD nodes used to represent the functions. + + Command options: + + -h + Print the command usage. + + -n + Print the name of the network nodes represented by vertices in the + partition. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/print_tfm_optionsCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/print_tfm_optionsCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/print_tfm_optionsCmd.txt (revision 14) @@ -0,0 +1,318 @@ + + print_tfm_options - print information about the transition function based + image computation options currently in use + _________________________________________________________________ + + print_tfm_options [-h] [-H] + + Prints information about the current transition function based image + computation options. + + Command options: + + -h + Print the command usage. + + -H + Print the transition function based image computation set command + usage. + + Set parameters: The transition function based image computation options are + specified with the set command. + + tfm_split_method + Specify a splitting method. + + method must be one of the following: + + 0 : input splitting (default) + + 1 : output splitting + + 2 : mixed (input split + output split) + + tfm_input_split + Specify an input splitting method. + + method must be one of the following: + + 0 : support before splitting (default) + + 1 : support after splitting + + 2 : estimate BDD size after splitting + + 3 : top variable + + tfm_pi_split_flag + Specify whether to allow primary input variables to be chosen as a + splitting variable. + + method must be one of the following: + + yes : choose either state or input variable as splitting variable + (default) + + no : choose only state variable as splitting variable + + tfm_range_comp + Specify a method whether to convert image to range computataion. + + method must be one of the following: + + 0 : do not convert to range computation + + 1 : convert image to range computation (default) + + 2 : use a threshold (tfm_range_threshold, default for hybrid) + + tfm_range_threshold + This option is valid only when the tfm_range_comp is set to 2. This + threshold is used to determine whether to convert to range + computation by comparing the shared BDD size of function vector after + constraining w.r.t. from set to its original size. If the size is + less than the origianl size * , then we convert to range computation. + The default value is 10. + + tfm_range_try_threshold + This option is valid only when the tfm_range_comp is set to 2. This + option is used to disable checking the condition if it fails to + convert consecutively times. The default value is 2. + + tfm_range_check_reorder + Specify whether to force to call variable reordering after + constraining function vector w.r.t. from set and before checking the + condition. + + method must be one of the following: + + yes : force to reorder before checking tfm_range_threshold + + no : do not reorder (default) + + tfm_tie_break_mode + Specify a tie breaking method when we have a tie in choosing a + splitting variable in input and output splitting method. + + method must be one of the following: + + 0 : the closest variable to top (default) + + 1 : the smallest BDD size after splitting + + tfm_output_split + Specify an output splitting method. + + method must be one of the following: + + 0 : smallest BDD size (default) + + 1 : largest BDD size + + 2 : top variable + + tfm_turn_depth + This option is valid only when mixed or hybrid method is chosen. This + is used to determine when to switch to the other method at which + depth of recursion. The default is 5 for tfm and -1 for hybrid + method. + + tfm_find_decomp_var + Specify a method whether to try to find a decomposable variable + (meaning articulation point) first if any. + + method must be one of the following: + + yes : try to find a decomposable variable (articulation point) + + no : do not try (default) + + tfm_sort_vector_flag + Specify a method whether to sort function vectors to increase cache + performance. + + method must be one of the following: + + yes : sort function vectors (default for tfm) + + no : do not sort (default for hybrid) + + tfm_print_stats + Specify a method whether to print statistics for cache and recursions + at the end of job. + + method must be one of the following: + + yes : print statistics + + no : do not print (default) + + tfm_print_bdd_size + Specify a method whether to print the BDD size of all intermediate + product. + + method must be one of the following: + + yes : print BDD size + + no : do not print (default) + + tfm_split_cube_func + Specify a method whether to try to find a cube in function vector in + input splitting, then perform output splitting once w.r.t. the cube. + + method must be one of the following: + + yes : try cube splitting + + no : do not try (default) + + tfm_find_essential + Specify a method whether to try to find essential variables in from + set. If a variable occurs in all cubes of a BDD, the variable is + called essential. If exists, minimize both function vector and the + from set with the essential cube. + + method must be one of the following: + + 0 : do not try (default) + + 1 : try to find essential variables + + 2 : on and off dynamically + + tfm_print_essential + Specify a method whether to print information about essential + variables. + + method must be one of the following: + + 0 : do not print (default) + + 1 : print only at end + + 2 : print at every image computation + + tfm_use_cache + Specify whether to use an image cache. + + method must be one of the following: + + 0 : do not use cache (default for hybrid) + + 1 : use cache (default) + + 2 : store all intermediate results + + tfm_global_cache + Specify a method whether to use one global image cache, or one image + cache per each machine. + + method must be one of the following: + + yes : use only one global cache (default) + + no : use one cache per machine + + tfm_max_chain_length + This option is used to set the maximum number of items in a slot for + conflict. The default is 2. + + tfm_init_cache_size + This option is used to set the initial cache size. The number is + recommended to be a prime number. Currently, we do not resize the + cache size, but for the future extension, we named initial. The + default is 1001. + + tfm_auto_flush_cache + Specify a method to flush image cache. + + method must be one of the following: + + 0 : flush cache only when requested + + 1 : flush cache at the end of image computation (default) + + 2 : flush cache before reordering + + tfm_compose_intermediate_vars + Specify a method whether to compose all intermediate variables. + + method must be one of the following: + + yes : compose all + + no : do not compose (default) + + tfm_pre_split_method + Specify a splitting method for preimage computation. + + method must be one of the following: + + 0 : input splitting (domain cofactoring, default) + + 1 : output splitting (constraint cofactoring) + + 2 : mixed (input split + output split) + + 3 : substitution + + tfm_pre_input_split + Specify an input splitting method for preimage computation. + + method must be one of the following: + + 0 : support before splitting (default) + + 1 : support after splitting + + 2 : estimate BDD size after splitting + + 3 : top variable + + tfm_pre_output_split + Specify an output splitting method for preimage computation. + + method must be one of the following: + + 0 : smallest BDD size (default) + + 1 : largest BDD size + + 2 : top variable + + tfm_pre_dc_leaf_method + Specify a method to switch to another method to complete preimage + computation in domain cofactoring method when no more splitting + variable exist. + + method must be one of the following: + + 0 : substitution (default) + + 1 : constraint cofactoring + + 2 : hybrid + + tfm_pre_minimize + Specify a method whether to minimize transition function vector w.r.t + a chosen function in constraint cofactoring method. This option is + recommended to use when image cache is disabled, because even though + this option can minimize the BDD size of function vector, this may + degrade cache performance. + + method must be one of the following: + + yes : minimize function vector w.r.t. a chosen function in constraint + cofactoring + + no : do not minimize (default) + + tfm_verbosity + Specify the level of printing information related with transition + function method. + + verbosity must be 0 - 2 (default = 0). + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/pwdCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/pwdCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/pwdCmd.txt (revision 14) @@ -0,0 +1,15 @@ + + pwd - print out the full path of the current node from the root node + _________________________________________________________________ + + pwd [-h] + + Prints out the full path of the current node from the root node. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/quitCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/quitCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/quitCmd.txt (revision 14) @@ -0,0 +1,19 @@ + + quit - exit VIS + _________________________________________________________________ + + quit [-h] [-s] + + Stops the program. Does not save the current network before exiting. + + Command options: + + -h + Print the command usage. + + -s + Free all the memory before quitting. This is slower, and is used for + finding memory leaks. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/read_blifCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/read_blifCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/read_blifCmd.txt (revision 14) @@ -0,0 +1,44 @@ + + read_blif - read a blif file + _________________________________________________________________ + + read_blif [-c] [-e ] [-h] [-v] + + Reads a file in blif format into VIS. All the synthesis-specific constructs + of blif are ignored. Internally the blif file is automatically translated + into an equivalent blif-mv file, which is then read in with read_blif_mv. + Note that, currently this command cannot read blif files which describe + mapped circuits. To get around this problem, please use SIS synthesis tool + to generate an ordinary blif file. Command options: + + -c + Semi-canonicalize all the tables in each model. See the documentation + of [1]read_blif_mv for details. + + -e + If set, the program reads in a blif file using the encoding + information specified in the encoding_file_name. Only the current + hnode is altered in the process, and hence the read is incremental. + Typically the encoding file is written out by a write_blif operation. + Note that this option cannot be used if no file has been read in. + Internally, the encoding file is used in combination with the blif + file to create a blif-mv file which is compatible with the I/O + interface of the current node. + + -h + Print the command usage. + + -v + If set, the program prints out all the unused variables in the blif + file. + + + Name of a blif file to be read in. This can be the output written by + SIS. in the blif file. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/html/read_blif_mvCmd.html Index: vis_dev/vis-2.3/share/help/read_blif_mvCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/read_blif_mvCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/read_blif_mvCmd.txt (revision 14) @@ -0,0 +1,50 @@ + + read_blif_mv - read a blif-mv file + _________________________________________________________________ + + read_blif_mv [-c] [-h] [-r] [-v] + + Reads a blif-mv file into VIS. The existing hierarchy for the blif-mv file + previously read in is overwritten upon a successful read. If an error is + detected while reading a file, the previous hierarchy is preserved. + + Command options: + + -c + Semi-canonicalize all the tables in each model. The canonicalization + process, assigns a linear order to the table rows and columns, based + on the value of their entries. For a table with binary valued + entries, this value is exactly the number of 1's in the row or + column. Once this linear order is assigned, the rows and columns of + the table are swapped so as to order rows and columns with higher + value at the beginning of the corresponding row or column order. It + is called semi-canonicalization because two tables representing the + same logic function need not have the same canonical form. + + -h + Print the command usage. + + -r + If set, the program replaces the subhierarchy rooted at the current + node with a new hierarchy specified by a blif-mv file. The file to be + read in has to be compatible with the i/o interface of the current + hnode (the same i/o names with the same domains). Otherwise, the + current hierarchy is kept intact. If -r is not specified, the entire + hierarchy is replaced, not just the subhierarchy at the current node. + + -v + If set, the program prints out all the unused variables in the + blif-mv file. Otherwise, only a warning is printed that some + variables are not used. + + + blif-mv file to be read in. + + For more information on blif-mv, refer to the [1]blif-mv manual. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. http://www-cad.eecs.berkeley.edu/Respep/Research/vis/doc/blifmv/blifmv/blifmv.html Index: vis_dev/vis-2.3/share/help/read_fairnessCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/read_fairnessCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/read_fairnessCmd.txt (revision 14) @@ -0,0 +1,51 @@ + + read_fairness - read a fairness constraint + _________________________________________________________________ + + read_fairness [-h] + + Read a fairness constraint, and associate this constraint with the FSM of + the flattened network. An existing constraint associated with the FSM is + lost. Subsequent verification procedures are performed relative to the new + constraint. Note that, by default, the flattened network has the constraint + TRUE, indicating that all paths are fair. The command build_partition_mdds + (or init_verify) must have already been invoked on the flattened network, + before this command is called. + + Currently, only Buchi constraints are supported. A Buchi fairness constraint + is given by a list of individual Buchi conditions, B1, B2, ..., Bk, where Bi + is a set of FSM states. A state is fair if there exists an infinite path + from that state that intersects each Bi infinitely often. + + The conditions are specified by a file containing at least one CTL formula + (see the [1]VIS CTL and LTL syntax manual). In particular, Bi is defined by + a CTL formula, which represents the set of states that makes the formula + true (in the absence of any fairness constraint). References to signal names + in the network should be made using the full hierarchical names. Note that + the support of any wire referred to in a formula should consist only of + latches. Each CTL formula is terminated by a semicolon. + + Example: In the three conditions below, B1 contains those states that have a + next state where cntr.out is RED, B2 contains those where timer.active is 1, + and B3 contains those states for which every path from the state has + tlc.request=1 until tlc.acknowledge=1. + + EX(cntr.out=RED); + (timer.active=1); + A(tlc.request=1 U tlc.acknowledge=1); + + + Command options: + + -h + Print the command usage. + + + File containing the set of Buchi conditions. + _________________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. file://localhost/projects/development/hsv/vis/common/doc/ctl/ctl/ctl.html Index: vis_dev/vis-2.3/share/help/read_orderCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/read_orderCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/read_orderCmd.txt (revision 14) @@ -0,0 +1,40 @@ + + read_order - Read and reorder variable order from a file. + _________________________________________________________________ + + read_order [-h] [-v] [] + + This command reads variable order from a file and reorder variable order + according to the order. This command can be used any time after static_order + command. However, the users should notice that there is a possibility to get + BDD blowups during this command. + + Command options: + + -h + Print the command usage. + + -g + Specify whether to group present and next state variables or not. + + 0: Do not group. + + 1: Do group (default). + + -v + Print debug information. + + + A file containing names of network nodes, used to specify a variable + ordering. The name of a node is the full hierarchical path name, + starting from the current hierarchical node. A node should appear at + most once in the file. Each node name should appear at the beginning + of a new line, with no white space preceeding it. The end of a node + name is marked by white space, and any other text on the rest of the + line is ignored. Any line starting with "#" or white space is + ignored. See write_order for a sample file. Note that the variable + ordering cannot be specified at the bit-level; it can only be + specified at the multi-valued variable level. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/read_verilogCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/read_verilogCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/read_verilogCmd.txt (revision 14) @@ -0,0 +1,31 @@ + + read_verilog - read a verilog file + _________________________________________________________________ + + read_verilog [-c] [-h] [-u] [-F] + + Reads a verilog file into VIS. Internally the file is transformed into an + equivalent blif-mv file, which is then read into VIS. The existing hierarchy + for the blif-mv file previously read in is overwritten upon a successful + read. If an error is detected while reading a file, the previous hierarchy + is preserved. + + Command options: + + -c + Use explicit clocking. + + -h + Print the command usage. + + -u + Turn off loop unroling. + + -F + Ignore all timing. + + + Verilog file to be read in. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/regression_testCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/regression_testCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/regression_testCmd.txt (revision 14) @@ -0,0 +1,345 @@ + + regression_test - perform regression test with the information given in + arguments file + _________________________________________________________________ + + regression_test [-s ] + + Invokes two set of execution of vis to compare the performance and to check + sanity of each execution. Then make a set of tables summarizing results, + such as CPU sec, memoty usage and fail/pass of model_check, etc.. This + command will read a description of the regression test to be performed from + the argument file, which is configuartion file. Besides the configuration + file, one needs to prepare two template files and a design list. We now + describe these in turn. As running example we shall use a regression test + that compares check_invariant with and without guided search. + + The configuration file for our example is shown below, delimited by lines of + dashes (which are not part of the file). The order in which the lines appear + in the file is immaterial. A line beginning with '#' is a comment, and is + ignored by regression_test. + ---------------------------------------------------------------------- + DesignDirectory : /projects/development/hsv/vis/Regression + DesignList : ./DesignListInv + ReferenceVis : /usr/local/vis/i686-o/vis-cu + ReferenceVisNickName : BFS + ReferenceOutputDir : ./result_inv_bfs + RefCommandTemplate : ./TemplateRefInv + bRefRun : FALSE + NewVis : /usr/local/vis/i686-o/vis-cu + NewVisNickName : GS + NewOutputDir : ./result_inv_gs + bNewRun : FALSE + NewCommandTemplate : ./TemplateNewInv + bCompareCounterExample : TRUE + bDefaultInitCommand : FALSE + ResultForPerformance : ./BFSvsGS.tex + CompareItem : cpu : elapse: + CompareItem : mem : Memory in use: + CompareItem : bdd : Peak number of live nodes: + ---------------------------------------------------------------------- + + Each line defines a parameter of the regression test. + + * DesignDirectory gives the path to the directory where the input files are + stored. In this case, we are using the central repository under + ~hsv/vis/Regression. It's typically a good idea to store the results of + regression tests in a separate place from the input files. In our examples, + the results are stored in the current directory. + + * DesignList gives the name of the file containing the list of test cases + to run. Each line consists of several white space-separated fields + describing the files making up the test case. The first field is a path to + the files relative to DesignDirectory. The second field is the test case + name. The remaining fields are file names. More on this later, when we talk + about the design list file in detail. + + * ReferenceVis and NewVis give paths to the two versions of vis to be + compared in the regression test. They can be the same, as in this case in + which both are the "nightly build." + + * ReferenceVisNickName and NewVisNickName are two identifiers that are used + in the LaTeX tables to refer to the two versions that are compared. Short + mnemonics are preferable. Avoid using underscores, because they currently + cause trouble with LaTeX. + + * ReferenceOutputDir and NewOutputDir give the names of the directories in + which the results of the runs will be stored. In each of these directories, + vis_reg will create a directory for each test case. The names of these + directories are the test case names taken from the design list. Therefore, + these names must be unique. + + * RefCommandTemplate and NewCommandTemplate are the templates from which + vis_reg produces the scripts used to run the test cases. The mechanism used + to derive the scripts from the templates and the design list is described in + detail when we talk about the template files. The two templates can be the + same file. + + * bRefRun and bNewRun are flags that tell vis_reg which of the two sets of + experiments should be run (if any). If one set of results has been already + computed, the corresponding flag should be set to FALSE. If both flags are + FALSE, vis_reg simply regenerates the summary table. + + * bCompareCounterExample is a flag that instructs vis_reg to scan the + output files for counterexamples and record their lengths. For each + counterexample, stem and cycle length are found. If this flag is set to + FALSE, counterexamples are not analyzed and the corresponding table is not + produced. + + * bDefaultInitCommand is a flag that, if set to TRUE, instructs vis_reg to + generate a default set of commands to initialize each vis run. This option + allows one to save some time in preparing the templates, at the expense of + some flexibility. + + * ResultForPerformance is the name of the LaTeX file to which vis_reg + writes the summary of the experiments. Its format is described in detail + later. + + * CompareItem specifies one item to be monitored in the experiments. + Multiple CompareItem lines may appear in the configuration file. Each one + consists of two items: an identifier, and a pattern. The identifier is used + in the table to denote the item, whereas the pattern is used to extract from + the output files the information to be put in the tables. + + In our example, we declare + + CompareItem : mem : Memory in use: + + We instruct regression_test to search for a line beginning with "Memory in + use:" in each section of the output file. The token immediately following + the occurrence of the pattern is the data item to be put in the table under + "mem." so that the resulting LaTeX table contains data on the memmory usage. + + Since the output file is divided into sections delimited by strings + "CommandBegin" and "CommandEnd." (See below.), each section is searched for + the patterns specified by the CompareItem declarations. If the pattern is + matched, the item appears in the table for that section. + + To run the regression_test we need configuration file, template file and + design list. In case of template file, we need a two template files, since + we want to compare two different run of vis. The syntax of the two templates + is identical. We describe the template for "new," but all we say applies to + "ref" as well. The "new" template for our example is shown below. + ---------------------------------------------------------------------- + + echo CommandBegin init + read_model + flt + order_vars + part + time + print_bdd_stats + echo CommandEnd init + echo CommandBegin ci + set hd_frontier_approx_threshold 3500 + ci -t 3600 -g $HintFile $InvFile + time + print_bdd_stats + echo CommandEnd ci + echo CommandBegin ci_cex + ci -d 1 -i -t 3600 -g $HintFile $InvFile + time + print_bdd_stats + echo CommandEnd ci_cex + ---------------------------------------------------------------------- + + Before proceeding to its discussion, it is instructive to examine the script + that regression_test produces from it for one test case. regression_test + relies on vis's shell variables and aliases to customize the script. The + script consists of a preamble in which variables and aliases are defined, + followed by one or more sections, each corresponding to a major step in the + experiment. Statistics will be collected for each step separately. Our + example has three sections, whose names are "init," "ci," and "ci_cex." The + names of the sections are arbitrary, except that the automatically generated + initialization section is always called "init." + ---------------------------------------------------------------------- + + set vis_stdout ./result_inv_gs/am2901/am2901.out + set vis_stderr ./result_inv_gs/am2901/am2901.err + set BlifFile /projects/development/hsv/vis/Regression/Am2901/am2901.mv + set OrdFile /projects/development/hsv/vis/Regression/Am2901/am2901.ord + set InvFile /projects/development/hsv/vis/Regression/Am2901/am2901.inv + set HintFile /projects/development/hsv/vis/Regression/Am2901/am2901.hint + alias read_model "rlmv $BlifFile" + alias set_fairness " " + alias order_vars "so -s input_and_latch $OrdFile" + echo CommandBegin init + read_model + flt + order_vars + part + time + print_bdd_stats + echo CommandEnd init + echo CommandBegin ci + set hd_frontier_approx_threshold 3500 + ci -t 3600 -g $HintFile $InvFile + time + print_bdd_stats + echo CommandEnd ci + echo CommandBegin ci_cex + ci -d 1 -i -t 3600 -g $HintFile $InvFile + time + print_bdd_stats + echo CommandEnd ci_cex + quit + ---------------------------------------------------------------------- + + The variables and the aliases are defined by vis_reg by examining the fields + of the test case description in the design file. regression_test uses file + extensions to identify file types. (E.g., .ord indicates an order file in + "input_and_latch" format.) A full list of extensions is given below. + + regression_test defines variables for all the file types actually available + for the experiment, and only for those. It also defines three aliases that + provide some flexibility in mixing different experiments in the same batch. + + For instance, "read_model" is defined as either + + read_blif_mv $BlifFile + + or + + read_blif $BlifFile + + depending on whether the design list specifies a .mv file or a .blif file as + model file. + + The definition of "order_vars" takes into account whether an order file is + available or not. Finally, the definition of "set_fairness" depends on + whether a .fair file is available. This allows one to mix model checking + experiments for which no fairness condition is specified to experiments that + do require fairness conditions. + + When bDefaultInitCommand is FALSE, the script is simply the preamble, + followed by the unchanged template, follows by the "quit" command, which is + always automatically added. + + When bDefaultInitCommand is TRUE, regression_test also adds an automatically + generated "init" section between the preamble and the template. This default + section is equivalent to + + echo CommandBegin init + read_model + flt + order_vars + part + time + print_bdd_stats + echo CommandEnd init + + Notice that one has no control over dynamic reordering during the + initialization phase if bDefaultInitCommand is TRUE. + + The template should refer to the defined aliases and variables to tailor + itself to each test case. Notice, however, that one is not forced to use + "order_vars." If one wants to always use vis's static ordering algorithm, + (s)he can simply use "so" instead of "order_vars." Likewise, one can decide + to always ignore fairness constraints by not including "set_fairness." + + On the other hand, it is usually a bad idea to explicitly include commands + like + + read_blif_mv + read_blif + so -s input_and_latch + read_fairness + + in the templates, because they limit the range of test cases to which they + can be applied. + + As we said, the templates, and hence the scripts, are divided in sections. + Each section begins and ends with an "echo" command. These commands write + delimiters to the output file, which are used by vis_reg to define the scope + of the pattern searches. It is important that the tag specified in + corresponding pairs of CommandBegin and CommandEnd be the same. + + The calls to "print_bdd_stats" are typically used to add to the output files + the information requested by the CompareItem declarations. It is a good idea + to specify timeouts for potentially expensive steps. + + The design list file has one line for each test case. A master design list + is in ~hsv/vis/Regression/DesignList. Specific design lists can be obtained + by commenting out or deleting lines from this master list. One can also + create an entirely new list according to the following rules. + + Lines starting with '#' are interpreted as comments and are skipped, as in + all files read by vis_reg. + + A test case is a named collection of related files that can be used to run + one or more experiments. As mentioned before, each line consists of white + space-separated fields. The first is a (relative) path, while the second is + the collection name. The remaining fields specify the files in the + collection. + + The smallest collection will specify one .mv or one .blif file. This file is + called the "model file," and should always appear in the third field of the + line. If the model file is the only file specified, one can run reachability + analysis, but not much more. Vis_reg understands the file extensions shown + in the following table. For each extension, the variable bound to the file + name and a short explanation are given. + + .mv $BlifFile model file to be read with rlmv + .blif $BlifFile model file to be read with rl + .ord $OrdFIle order file to be read with so -s input_and_latch + .inv $InvFile invariant file to be read with ci + .ctl $CtlFile property file to be read with mc + .fair $FairFile fairness file to be read with rf + .hint $HintFile hint file to be read with the -g option of mc, ci, and rch + + Only one file of each type can appear in the collection defining one test + case. If multiple property files, or different order files are available for + one model file, one has to create two test cases for that model. Different + models, on the other hand, can share property files, order files, and so on. + The master design list provides examples for both these situations. + + It is not possible to specify both a .mv file and a .blif file for one test + case. There must be exactly one model file per test case. + + As was mentioned before, it is important that the name of a test case be + unique in the entire batch used for a regression test. On the other hand, + several test cases may share the same directory, and often do when they have + some files in common. + + The result summary created by regression_test is a LaTeX file consisting of + several tables. There is one table with performance stats for each section + of the output file. In addition, there is an optional counterexample + comparison table that summarizes PASS/FAIL information for the properties + and the length of counterexamples. For each failing property, the length of + the stem and the length of the cycle (if applicable) are reported. + + Each performance table consists of one column for the test case name, + followed by as many groups of three columns as there are CompareItem + declarations applicable to the section that the table summarizes. + + Each group of three columns gives the data for the reference run, the data + for the new run, and the improvement. Vis_reg regards smaller as better. + Hence, the improvement is positive if the CPU time, memory occupation, and + so on, have decreased from the reference run to the new run. The improvement + is computed as + + (value(ref) - value(new)) / value(ref) * 100. + + Notice that this formula tends to make "new" look bad. for instance, if new + is twice as fast as ref, the improvement is 50%. If ref is twice as fast, + however, the "improvement" is -100%. + + The results of each test case are stored in a separate directory, whose name + is obtained by concatenating ReferenceOutputDir (or NewOutputDir) with the + test case name. Each directory stores three files, whose names are given by + the test case name concatenated with .src, .out, and .err. + + * test_case_name.src stores the script used to run vis. + * test_case_name.out stores what vis writes to vis_stdout. + * test_case_name.err stores what vis writes to vis_stderr. + + One has to be careful, because vis_reg will overwrite these results + directories without warning if run twice with the same ReferenceOutputDir or + NewOutputDir and bRefRun or bNewRun set to TRUE. + + With '-s' option, you can create c-shell script file to be able to run + experiments in shell. We add this option to solve the problem that are + happened when your template file contains child-process by system call. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/res_verifyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/res_verifyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/res_verifyCmd.txt (revision 14) @@ -0,0 +1,234 @@ + + res_verify - Verifies a combinational circuit using residue arithmetic. + _________________________________________________________________ + + res_verify [-b] [-d ] [-h] -i [-m ] [-n ] + {-o | -O} [-s ] [-t ] + + This command performs residue verification between two networks. The method + used is based on residue arithmetic and the Chinese Remainder theorem; it is + described in [1] ftp://vlsi.colorado.edu/pub/fmcad96.ps. Verification is + performed by interpreting the outputs of the circuits as integers and + verifying the residues of the outputs with respect to a set of moduli. The + choice of moduli is directed by the Chinese Remainder Theorem in order to + prove equivalence of the two circuits. This method works well with + multipliers and possibly other arithmetic circuits (due to its dependence on + residue arithmetic). For the same reason, it is necessary to specify an + output order which determines how the outputs are interpreted as integers. + Discretion should be exercised in applying this method to general + combinational circuits. + + Residue verification is available only if vis is linked with the cu BDD + package. (This is the default.) It reads both blif and blif-mv files. + However, it does NOT support multi-valued variables. Residue verification is + primarily for combinational verification, but may be applied to sequential + circuits with the same state encoding. The latch outputs are then considered + to be combinational inputs of the circuits and the latch inputs and reset + are considered to be combinational outputs of the circuits. + + There are two ways to perform residue verification in this package. As a + first option, two files describing two networks, the specification and the + implementation, (in the same format, blif or blif-mv, see option -b) are + given in the command line; the procedure tries to verify the equivalence of + the combinational outputs as functions of the combinational inputs. + + vis> res_verify -o network.order -i network1.blif -s network2.blif + + In this case both networks are read in, flattened and the verification is + performed between the combinational outputs of both networks. The -i option + denotes the implementation file and the -s option denotes the specification + file. The -o option specifies the order of outputs for the circuits (See + Command Options below for detailed explanation). + + A second way to perform the verification is as follows. The specification + network is taken from a hierarchy already read into VIS. Then the res_verify + command compares that specification against an implementation network + obtained from the file in the command line. Any previous verification, + performed with the specification, can be used towards the next verification + task only if the same implementation circuit is being verified against and + the same number of outputs have been directly verified with sucess in the + previous attempt. The typical sequence of commands given to perform such + task would be: + + vis> read_blifmv network1.mv + vis> flatten_hierarchy + vis> res_verify -o network.order -i network2.mv + + If the hierarchy has been read but no flattened network exists at the + current node, the command will return without doing anything. If one of the + networks used is the one in the current node in the hierarchy, then the + information regarding the verification process will be stored in that + network. + + Note: It is important to keep the specification distinct from the + implementation because most parameters specified for the res_verify command + are with respect to the specification. For example, the output order is + specified with respect to the specification. The file that is read in first + in the second format, is considered to be the specification. + + There is an option to directly verify some outputs by building the BDDs for + the corresponding outputs of the 2 circuits. In that case, if the user wants + to use an initial ordering, the only way to do it is the second method and + reading in the network, one may specify the initial order using static + order. + + The command does not repeat residue verification if the same + specification-implementation pair have been verified with success and the + same number of directly verified outputs have been verified in the previous + attempt. + + Relevant flags to be set using the set command: + + residue_verbosity + Default is 0, turns on verbosity to the desired level between 0 and + 5. + + residue_ignore_direct_verified_outputs + Default 0 (FALSE). If 1, then ignores directly verified outputs + during residue verification. + + residue_top_var + Default "msb". The 2 possible values are "msb" and lsb"; this puts + the most/least significant bit near the top or bottom of the residue + decision diagram. + + residue_autodyn_residue_verif + Default 0 (FALSE). If 1, turns on dynamic reordering during residue + verification. + + residue_residue_dyn_method + Default "groupsift". Specifies the method for dynamic reordering + during residue verification. Other methods supported are "same" (same + as before), "none", "random", "randompivot", "sift", "siftconverge", + "symmsiftconverge", "symmsift", "window2", "window3", "window4", + "window2converge","window3converge","window4converge","groupsift", + "groupsiftconverge", "anneal", "genetic", "linear", "linearconverge", + "exact". + + residue_autodyn_direct_verif + Default 0 (FALSE). If 1, turns on dynamic reordering during direct + verification. + + residue_direct_dyn_method + Default "groupsift". Specifies the method for dynamic reordering + during direct verification. Other methods supported are "same" (same + as before), "none", "random", "randompivot", "sift", "siftconverge", + "symmsiftconverge", "symmsift", "window2", "window3", "window4", + "window2converge","window3converge","window4converge","groupsift", + "groupsiftconverge", "anneal", "genetic", "linear", "linearconverge", + "exact". + + residue_layer_schedule + Default "alap". This is a flag to specify the layering strategy of + the networks. The 2 options are "asap" (as soon as possible) and + "alap" (as late as possible). + + residue_layer_size + Default largest layer size in network. Specifies the maximum layer + size that can be composed in (relevant for vector composition only). + + residue_composition_method + Default "vector". Specifies the composition method to be used in + composing the network into the residue ADD. The options are "vector", + "onegate", "preimage" and "superG". + + Command Options: + + -b + If this option is specified, the specification and the implementation + files read are considered to be in blif-mv format. Default is blif + format. + + -d n + This option specifies the number of outputs to be directly verified. + That is, for n least significant outputs of the circuit, this command + performs like comb_verify. The actual outputs are read off the output + order array. Since the output order array is specified starting with + the MSB, the number of directly verified outputs will be a chunk of + the bottom part of the output order array. The option "-d all" sets + the number of directly verified outputs to the number of + combinational outputs in the circuit i.e., all outputs are directly + verified. The direct verification for small BDD sizes is faster and + overall reduces the number of primes to be used in residue + verification. In general, one output is checked at a time against the + corresponding output of the other network and consequently , this + method may be fast and use less memory resources. + IMPORTANT: It is possible to specify an initial order for the direct + verification. This is done by reading in the specification file and + using static_order to specify the initial order. The implementation + will get the same order as the specification. When specifying the + initial order, one must be careful not to specify the -s option in + the res_verify command. The -s option reads in the specification file + again and the initial order is lost. + + -h + Print the command usage. + + -i + Implementation network to perform verification against. The file must + be in blif format unless -b is specified, in which case the file is + taken to be in blif-mv format. The blif format is the default. + + -m + Optional file name specifying the matching pair of output names + between the two networks. If not specified, it is assumed that all + outputs have identical names. This option is useful when verifying + two circuits whose output names do not match. The file will give + pairs of the form name1 name2 to be considered as corresponding + outputs in the verification process. In each pair, name1 may belong + to the specification and name2 to the implementation or vice-versa. + The matching procedure is not capable of dealing with some special + situations. For example, when two outputs, one of each network have + the same name, they must correspond to the same output. Partial + orders may not be specified. + + -n + Optional file name specifying the matching pair of input names + between the two networks. If not specified, it is assumed that all + inputs have identical names. This option is useful when verifying two + circuits whose input names do not match. The file will give pairs of + the form name1 name2 to be considered as corresponding inputs in the + verification process. In each pair, name1 may belong to the + specification and name2 to the implementation or vice-versa. The + matching procedure is not capable of dealing with some special + situations. For example, when two inputs, one of each network have + the same name, they must correspond to the same input. Partial orders + may not be specified. + + -o + Required file specifying output order, starting with the MSB. The + file must be a list of output names separated by spaces. The list + must belong to the specification network and must contain a full + order i.e., must contain all the combinational output names. It is + advisable to use the -o option as far as possible to specify the + order of the outputs.See also -O option. + + -O + This option specifies whether the res_verify command should generate + a default order for the outputs. If the -o option is not used, this + option must be specified. The default order generated is random and + is NOT the same as the input files. The set of outputs for the output + order may be generated by using the print_network command to write + the network into a file and extract the node name from the lines + containing the word "comb-output". The set of outputs can then be + ordered as required. + It is advisable to use the -o option as far as possible to specify + the order of the outputs. The -o option overrides the -O option. See + also -o option. + + -s + Specification network. This network will be taken as the + specification of the circuit. The result of the computation will be + stored in this network. If this network is not provided, the current + node of the hierarchy will be taken. The file must contain a blif + description of a circuit unless the option -b is specified, in which + case the file is considered in blif-mv format. If two networks are + specified in the command line, both of them must have the same + format, either blif or blif-mv. The blif format is the default. + + -t + Execution time in seconds allowed for verification before aborting. + The default is no limit. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/reset_fairnessCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/reset_fairnessCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/reset_fairnessCmd.txt (revision 14) @@ -0,0 +1,17 @@ + + reset_fairness - reset the fairness constraint + _________________________________________________________________ + + reset_fairness [-h] + + Remove any existing fairness constraint associated with the FSM of the + flattened network, and impose a single constraint, TRUE, indicating that all + states are "accepting". + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/restruct_fsmCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/restruct_fsmCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/restruct_fsmCmd.txt (revision 14) @@ -0,0 +1,135 @@ + + restruct_fsm - Restructre the STG of a finite state machine to reduce power + dissipation. + _________________________________________________________________ + + restruct_fsm [-D ] [-d ] [-E] [-F ] [-f + ] [-h] [-N] [-o ] [-p ] [-s ] [-t + ] [-v] + + This command implements an STG restructuring algorithm that exploits the + existence of equivalent states to decrease power dissipation, not + necessarily by collapsing the equivalence states, but by redirecting + transitions in the state transition graph (STG). This algorithm is based on + monolithic transition relation. The complexity of the algorithm in general + increases with an increase in the size of the STG. The number of states and + edges in the STG are exponential in the number of state variables and + primary inputs. The memory utilization is not necessarily exponential due to + symbolic representation of the STG. For more details see, "A Symbolic + Algorithm for Low-Power Sequential Synthesis", ISLPED 97. This command works + only if VIS is compiled with CUDD package. The algorithm can handle circuits + described in both BLIF and BLIF-MV format. However, multi-valued variables + are not supported. Also, the final synthesized circuit (network + implementation of the restructured STG) is available only in BLIF format. + The sequential circuit should have a single initial state. A network should + have been created for the circuit and its primary inputs and state variables + assigned BDD ids prior to the invocation of this command. A network can be + created by the command flatten_hierarchy and command static_order assigns + BDD ids to the input and state variables. The command proceeds by creating + BDDs for the outputs and next state functions. An FSM data structure is then + created on which subsequent operations are performed. After the STG is + restructured a new circuit is synthesized by symbolic factorization based on + Zero-Suppressed Decision Diagrams (ZDDs). The final synthesized circuit is a + file in BLIF format with ".ml.blif" as the extension. + + The typical command flow in vis is the following: + vis> read_blif foo.blif + vis> flatten_hierarchy + vis> static_order + vis> dynamic_var_ordering -e sift + vis> restruct_fsm + + In the above case example, the final synthesized circuit is MODEL.ml.blif if + the name of the design in foo.blif is MODEL. + Command options: + + -A + Allow realignment (during symbolic factorization) of ZDDs after BDD + reordering and vice versa. This option is effective when only one of + the BDD or ZDD variable reordering is enabled. + + -D + Specify the output file name for synthesized circuit. File extension + is not necessary. By default, the model name of the circuit is used. + For example, -D foobar, will result in foobar.ml.blif + + -d + Choose a divisor. See synthesize_network for more details. + + -E + Print the number of equivalence classes in the FSM. + + -F + File with primary input probabilities, one per line. input_name + + + -f + Choose a method for factorization. See synthesize_network for more + details. + + -h + Print command usage. + + -i + Specify the prefix to be used to generate names for internal nodes + during synthesis. By default, the prefix is "_n". + + -N + Expand the reachable set R to include those states which are + equivalent to R but not reachable. The default is not to include such + states. + + -o + File to output BDD variable ordering after the restructured circuit + is synthesized. + + -R + Allow reordering in BDD and/or ZDD variables during symbolic + factorization stage. + + 0 : (default) No reordering neither in BDD nor in ZDD. + + 1 : Allows reordering only in BDD, not in ZDD. + + 2 : Allows reordering only in ZDD, not in BDD. + + 3 : Allows reordering both in BDD and in ZDD. + + -s + Heuristic to perform restructuring. Consider a fragment of an STG + containing states A,B and C and an edge from A to B. Let B and C be + equivalent. Since B and C are equivalent, it is possible to change + the transition between A and B to A and C. In the more general case, + the choice can be driven by different cost constraints. The following + are the heuristics: + ham : Hamming distance based heuristic. An edge is chosen that + reduces the Hamming distance (or state bit transitions) between the + states. + fanin : Fanin oriented heuristic. A representative from the + equivalence class is chosen that reduces the total average state bit + switching on the incoming edges. + faninout : Fanin-Fanout oriented heuristic. A representative from the + equivalence class is chosen that reduces the total average state bit + switching on the incoming as well as outgoing edges. + cproj : A simple C-Projection. A representative from the equivalence + class is chosen which is closest to the initial state. The distance + d(x,y) is defined as: + sum_{i=0}^{N-1}(|x_i - y_i| cdot 2^{N-i-1}). + + -T + Try to share more nodes during symbolic factorization. Existing + divisors are checked for potential reuse before extracting divisors + from the current boolean function. + + -t + Time in seconds allowed to complete the command. If the computation + time goes above that limit, the process is aborted. The default is no + limit. + + -v + Turn on verbosity. + + See also command : synthesize_network + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/seq_verifyCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/seq_verifyCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/seq_verifyCmd.txt (revision 14) @@ -0,0 +1,79 @@ + + seq_verify - verify the sequential equivalence of two flattened networks + _________________________________________________________________ + + seq_verify [-b] [-f ] [-h] [-p ] [-t ] + [-B] [-i] [-r] [] + + Please read the documentation for the command comb_verify before reading on. + The concepts of roots and leaves in this command are the same as for + comb_verify, except for an added constraint: the set of leaves has to be the + set of all primary inputs. This obviously produces the constraint that both + networks have the same number of primary inputs. Moreover, no pseudo inputs + should be present in the two networks being compared. The set of roots can + be an arbitrary subset of nodes. + + The command verifies whether any state, where the values of two + corresponding roots differ, can be reached from the set of initial states of + the product machine. If this happens, a debug trace is provided. + + The sequential verification is done by building the product finite state + machine. + + The command has two execution modes, just as for comb_verify. In the first + mode, two BLIF-MV files are given as arguments to the command: + + vis> seq_verify foo.mv bar.mv + + + In the second mode, a single BLIF-MV file is taken. This is network2. It is + assumed that network1 is from a hierarchy that has already been read in. If + a network is present at the current node (i.e. flatten_hierarchy has been + executed), it is used for verification; otherwise the command does nothing. + + vis> read_blifmv foo.mv + vis> flatten_hierarchy + vis> seq_verify bar.mv + + + Command options: + + -b + Specifies that the input files are BLIF files. + + -f + Provides the correspondence between the leaves and roots of network1 + and network2. leaves has to be the set of primary inputs of the + networks. roots can be any subset of nodes. If this option is not + used, it is assumed that the correspondence is by name, and that the + roots are the combinational outputs. + + -h + Print the command usage. + + -p + Specifies the partitioning method for the product machine. Supported + methods are "total", "partial", and "inout" (see the command + build_partition_mdds for more information). If this option is not + specified, then the default method "inout" is used. + + -t + Time in seconds allowed to perform equivalence checking. The default + is infinity. + + -B + Use backward image computation to traverse the state space of the + product machine. By default, forward image computaion is used. + + -i + Print BDD statistics. This is the only way to see BDD stastics during + this command. print_bdd_stats after this command doesn't show + information related to this command. + + -r + Enable BDD reordering during the equivalence check. Note that + dynamic_var_ordering has no effect on whether reordering is enabled + during the execution of seq_verify. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/setCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/setCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/setCmd.txt (revision 14) @@ -0,0 +1,215 @@ + + set - set an environment variable + _________________________________________________________________ + + set [-h] [] [] + + A variable environment is maintained by the command interpreter. The "set" + command sets a variable to a particular value, and the "unset" command + removes the definition of a variable. If "set" is given no arguments, it + prints the current value of all variables. + + Command options: + + -h + Print the command usage. + + + Variable name + + + Value to be assigned to the variable. + + Interpolation of variables is allowed when using the set command. The + variables are referred to with the prefix of '$'. So for example, the + following can be done to check the value of a set variable: + vis> set foo bar + vis> echo $foo + bar + The last line "bar" will the output produced by vis. + + Variables can be extended by using the character ':' to concatenate values. + For example : + vis> set foo bar + vis> set foo $foo:foobar + vis> echo $foo + bar:foobar + The variable foo is extended with the value foobar . + + Whitespace characters may be present within quotes. However, variable + interpolation lays the restriction that the characters ':' and '/' may not + be used within quotes. This is to allow for recursive interpolation. So for + example, the following is allowed + vis> set "foo bar" this + vis> echo $"foo bar" + this + The last line will be the output produced by vis. + But in the following, the value of the variable foo/bar will not be + interpreted correctly: + + vis> set "foo/bar" this + vis> echo $"foo/bar" + foo/bar + If a variable is not set by the "set" command, then the variable is returned + unchanged. + + Different commands use environment information for different purposes. The + command interpreter makes use of the following parameters: + + autoexec + Defines a command string to be automatically executed after every + command processed by the command interpreter. This is useful for + things like timing commands, or tracing the progress of optimization. + + open_path + "open_path" (in analogy to the shell-variable PATH) is a list of + colon-separated strings giving directories to be searched whenever a + file is opened for read. Typically the current directory (.) is first + in this list. The standard system library (typically + $VIS_LIBRARY_PATH) is always implicitly appended to the current path. + This provides a convenient short-hand mechanism for reaching standard + library files. + + vis_stderr + Standard error (normally stderr) can be re-directed to a file by + setting the variable vis_stderr. + + vis_stdout + Standard output (normally stdout) can be re-directed to a file by + setting the variable vis_stdout. + + Building MDDs for the network makes use of following setting: + + partition_method + This parameter is used to select the method for creating the + partition. The vertices of a partition correspond to the + combinational inputs, combinational outputs, and any intermediate + nodes used. Each vertex has a multi-valued function (represented by + MDDs) expressing the function of the corresponding network node in + terms of the partition vertices in its transitive fanin. Hence, the + MDDs of the partition represent a partial collapsing of the network. + The possible values of partition_method are: + + inout + Expresses the combinational outputs in terms of the + combinational inputs. This is the default partitioning method. + + total + The partition built is isomorphic to the combinational part of + the network. The function of each node is expressed in terms of + its immediate fanins. + + frontier + The partition built contains the combinational part of the + network as well as vertices corresponding to some intermediate + nodes. These vertices are generated to control the MDD sizes of + the combinational outputs. The number of intermediate variables + can be controlled by the parameter "partition_threshold". The + method "inout" and "total" are special cases of this method + (corresponding to a partition_threshold of infinity and 0 + respectively). + + partition_threshold + This parameter is used in conjuction with the selection of "frontier" + as partition method. This determines the threshold at which a new MDD + variable is created in the partition. + + Image computation makes use of following settings: + + image_method + The "image_method" parameter is used to control the image method used + in various symbolic analysis techniques. Currently, two image methods + are implemented. Use "set image_method " to choose the + appropriate method. + + monolithic + This is the most naive approach possible. However, this method + is not suitable for circuits with more than 20 latches. + + tfm + This is the pure transition function method. This method is + supposed not to be used in general fixpoint computations. + Approximate traversal is an application of this method. + Basically this method is made as a part of hybrid method. For + more detailed options, see the help of print_tfm_options + command. + + hybrid + This is a hybrid method combining transition relation and + function methods. Transition relation method is based on + conjunction of partitioned transition relation, whereas + transition function method is based on splitting on an input or + output variable recursively. The hybrid method choose either + splitting or conjunction at each recursion dynamically using + the dependence matrix. For details, refer to the paper "To + split or to Conjoin: The Question in Image Computation" by + In-Ho Moon, James Kukula, Kavita Ravi, and Fabio Somenzi, + DAC'00. Also for more detailed options, see the help of + print_hybrid_options command. + + iwls95 + This technique is based on the early variable quantification + and related heuristics of Ranjan, et al. "Efficient BDD + Algorithms for FSM Synthesis and Verification", IWLS 1995. + First, from the given multivalued functions, bit level + relations are created. These relations are then clustered based + on the value of threshold value controlled by + image_cluster_size parameter. Next the relations are ordered + for early variable quantification. This ordering is controlled + by the parameters image_W1, image_W2, image_W3, and image_W4. + + mlp + This technique is based on minimizing the variable lifetime in + the conjunctions of the partitioned transition relation. The + method is called MLP (Minimal Lifetime Permutation). For + details, refer to the paper "Border-Block Triangular Form and + Conjunction Schedule in Image Computation" by In-Ho Moon, Gary + Hachtel, and Fabio Somenzi, FMCAD'00. Also for more detailed + options, see the help of print_mlp_options command. + + image_farside_method + This parameter is used in conjunction with the selection of iwls95, + mlp, or linear as the image_method. When the value is 1, the + compositional far side image computation approach is enabled; when + the value is 0, this feature is disabled (default). + + image_cluster_size + This parameter is used in conjunction with the selection of iwls95 as + the image_method. The value of this parameter is used as threshold + value for creating clusters. The default value of this parameter is + 5000 which has been empirically proved to be an optimal value. + + image_W1, image_W2, image_W3, image_W4 + These parameters are used in conjunction with the selection of iwls95 + as the image_method. They control the weights associated with various + factors in ordering the clusters. The default values are 6, 1, 1, and + 2 respectively. For a detailed description of these parameters, + please refer to the paper in IWLS'95 proceedings. + + image_verbosity + Sets the verbosity mode (0 minimum to 4 maximum), for the image + method iwls95. + + image_minimize_method + Sets a minimization method to minimize the transition relation or an + image/preimage computaion with a set of dont-care states. + + Methods: 0 : restrict (default). + + 1 : constrain + + 2 : compact (currently supported by only CUDD) + + 3 : squeeze (currently supported by only CUDD) + + scc_method + Sets the symbolic method to enumerate strongly connected components + (SCCs). Symbolic SCC enumeration is the core computation in LTL and + fair-CTL model checking. + + Methods: lockstep : the O(nlogn) time LockStep algorithm (default). + + Methods: linearstep : the linear time symbolic algorithm (default). + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/set_bdd_parametersCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/set_bdd_parametersCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/set_bdd_parametersCmd.txt (revision 14) @@ -0,0 +1,31 @@ + + set_bdd_parameters - Creates a table with the value of all the flags + currently active in VIS and calls the function bdd_set_parameters with the + manager of the current place in the hierarchy and the table. + _________________________________________________________________ + + set_bdd_parameters [-h][-s] + + The command obtains the bdd manager of the current point in the hierarchy. + Given this manager and the set of pairs (variable,value) of the VIS + environment, the function sets specific BDD parameters to the given values. + This command works in conjunction with print_bdd_stats. + + Print_bdd_stats first prints a report of the parameters and statistics of + the current bdd_manager. By using the command "set", the user may modify the + value of any of the parameters of the underlying bdd package. The way to do + it is by setting a value in the variable BDD.parameter name where parameter + name is the name of the parameter exactly as printed by the print_bdd_stats + command. In order to "re-program" the underlying bdd package this command + must be invoked. + + Command options: + + -h + Print the command usage. + + -s + Print the bdd parameter and statistics after the modification. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/simulateCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/simulateCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/simulateCmd.txt (revision 14) @@ -0,0 +1,132 @@ + + simulate - simulate the flattened network + _________________________________________________________________ + + simulate [ -I <0/1> ] [ -O <0/1> ] [ -P <0/1> ] [ -S <0/1> ] [ -h ] [ -i + ] [ -n ] [ -o ] [ -p <0|1> ] [ + -v ] + + Simulates a network with a set of input vectors. Before calling this + command, the user should create a partition (using the command + build_partition_mdds). The simulation vectors can be provided by the user + (using -i vectors_file), or generated randomly. + + Command options: + + -I <0/1> + This option controls the printing the primary input variables. 0 + implies printing is disabled, enabled otherwise. The default value is + 1. The output file generated with this flag set to 0 may not be used + as input file for simulation (if there are some primary inputs to the + system). + + -O <0/1> + This option controls the printing the primary output variables. 0 + implies printing is disabled, enabled otherwise. The default value is + 1. + + -P <0/1> + This option controls the printing the pseudo input variables. 0 + implies printing is disabled, enabled otherwise. The default value is + 1. The output file generated with this flag set to 0 may not be used + as input file for simulation (if there are some pseudo-inputs to the + system). + + -S <0/1> + This option controls the printing the state variables. 0 implies + printing is disabled, enabled otherwise. The default value is 1. + + -h + Print a help message that details all options. + + -i + Give the simulation vector file name. If this option is not used, + vectors are generated randomly. + + -n + Simulate N vectors. This option should be used if vectors_file is not + specified. If a vectors_file is given, and if there are more than N + vectors in the file, only the first N vectors are simulated. + + -o + Give the name of a file where the simulation result should be + written. If this option is not used, the simulation result is + directed to standard output. + + -p <0|1|2> + This option is available only with random vector generation mode, and + affects how values for pseudo-inputs (non-deterministic constants) + are generated. 0: pseudo-inputs are treated by user. 1: pseudo-inputs + are treated randomly. 2: pseudo-inputs are treated by choosing the + first possibility. + + -v + Enable verbose mode. Prints CPU time usage. + + The vectors_file has two main parts: + + Declarations: + + Inputs list: + Gives an ordering of the primary and pseudo inputs. Every input + must be reported in this field. + + Latches list: + Gives an ordering of the latches. Every latch must be reported + in this field. + + Outputs list: + Gives an ordering of the outputs. This list may be incomplete. + Simulation is performed only on outputs present in this list. + + Initial state: + Value of an initial state. This value is given with respect to + the latch ordering. + + Simulation Vectors: + One vector per line according to the given order of inputs. + + Final State: + Prints the value of state variables after the last simulation vector + is applied. + + An example of a simulation vectors file is: + # ----> Declarations + .inputs X1 X2 + .latches L1 L2 + .outputs O + .initial green 0 + .start_vectors + # ----> Vectors + 0 1 + 1 0 + 1 1 + + Note the keywords: .inputs, .latches, .outputs, .initial, .start_vectors. A + line started by a '#' is a comment line. + + The simulation result is printed either in a file (using -o output_file) or + to standard output. It has the same format as vectors_file with additional + fields for latches and outputs. Here is the result of simulation on last + vectors_file example: + .inputs X1 X2 + .latches L1 L2 + .outputs O + .initial green 0 + .start_vectors + #input; current_state; output + 0 1 ; green 0 ; 0 + 1 0 ; blue 0 ; 1 + 1 1 ; red 1 ; 1 + #Final State : green 1 + + Note that each input line has been extended by its simulation result with + current states and outputs listed in order. The output_file can be read by + simulate as vectors_file (latches and outputs values are ignored). When + starting simulation a good trick is to run simulate with random vectors + generation mode; the resulting can be used as a template to write a + vectors_file. For example, executing "simulate -n 1 -o foo.output" will + generate a representative file. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/sourceCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/sourceCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/sourceCmd.txt (revision 14) @@ -0,0 +1,72 @@ + + source - execute commands from a file + _________________________________________________________________ + + source [-h] [-p] [-s] [-x] [] + + Reads and executes commands from a file. + + Command options: + + -h + Print the command usage. + + -p + Print a prompt before reading each command. + + -s + Silently ignore an attempt to execute commands from a nonexistent + file. + + -x + Echo each command before it is executed. + + + File name + + Arguments on the command line after the filename are remembered but not + evaluated. Commands in the script file can then refer to these arguments + using the history substitution mechanism. + + EXAMPLE: + + Contents of test.scr: + + read_blif_mv %:2 + init_verify + simulate -n 10 + + + Typing "source test.scr lion.mv" on the command line will execute the + sequence + + read_blif_mv lion.mv + init_verify + simulate -n 10 + + + (In this case %:0 gets "source", %:1 gets "test.scr", and %:2 gets + "lion.mv".) If you type "alias st source test.scr" and then type "st + lion.blif bozo", you will execute + + read_blif_mv bozo + init_verify + simulate -n 10 + + + because "bozo" was the second argument on the last command line typed. In + other words, command substitution in a script file depends on how the script + file was invoked. Switches passed to a command are also counted as + positional parameters. Therefore, if you type "st -x lion.mv bozo", you will + execute + read_blif_mv lion.mv + init_verify + simulate -n 10 + + + To pass the "-x" switch (or any other switch) to "source" when the script + uses positional parameters, you can define an alias. For instance, "alias + srcx source -x". + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/spfd_pdloCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/spfd_pdloCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/spfd_pdloCmd.txt (revision 14) @@ -0,0 +1,162 @@ + + spfd_pdlo - Perform SPFD-based simultaneous placement and logic optimization. + _________________________________________________________________ + + spfd_pdlo [-D ] [-h] [-n ] [-r] [-t ] [-v ] [-w ] + net_file arch_file place_file route_file + + This command performs SPFD-based combined logic and placement optimization + of combinational circuits mapped to LUT-based FPGAs to improve circuit area + and speed. The flexibilities in the circuit are represented by SPFDs. The + following references explain in detail the theory behind SPFDs. + + S. Yamashita, H. Sawada, and A. Nagoya. A new method to express functional + permissibilities for LUT based FPGAs and its applications. In International + Conference on Computer Aided Design, pages 254-261, 1996. + + Subarnarekha Sinha and Robert K. Brayton. Implementation and use of SPFDs in + optimizaing Boolean networks. In International Conference on Computer Aided + Design, 1998. + + The command implements a technique that tightly links the logic and + placement optimization steps. The algorithm is based on simulated annealing. + Two types of moves, directed towards global reduction in the cost function + (total wire length), are accepted by the simulated annealing algorithm: (1) + wire removal/replacement, and (2) swapping of a pair of blocks in the FPGA. + Feedback from placement is valuable in making an informed choice of a target + wire during logic optimization moves. The logic optimization steps performed + are similar to those of spfd_pilo, except that the placement information is + now used instead of the fanout count. More information on this technique can + be found in : + + Balakrishna Kumthekar and Fabio Somenzi. Power and delay reduction via + simultaneous logic and placement optimization in FPGAs. In Design, + Automation and Test in Europe, 2000. + + The command produces a placement file which is used by VPR for routing. + + This command can be used only if VIS is linked with VPR 4.22 (Versatile + Place and Route), the FPGA place and route tool [1]VPR, from the University + of Toronto. Please follow the instructions provided in the release notes to + use VPR with VIS. You can also contact kumtheka@avanticorp.com if you need + more help. + + Before calling this command a network should be created for the design (use + flatten_hierarchy) and MDD ids for every node in the network should be + created (static_order -o all -n append). Dynamic variable ordering (dvo -e + sift) can be enabled to reduce BDD sizes. + + Command options: + + -D + A cluster is computed which includes nodes within the specified + 'depth'. The default value is 1. + + -n + File to output the optimized circuit in VPR's .net format. + + -r + Do not reprogram LUTs if no structural changes have been performed + with in the cluster, i.e., if no nodes or wires have been removed do + not change the local implementation of LUTs even if alternate + implementations are availabe from SPFD information. The default is to + reprogram. + + -t + Time in seconds allowed to complete the command. If the computation + time goes above that limit, the process is is aborted. The default is + no limit. + + -v + Verbosity level. + + -w + File to output final optimized circuit. + + The following is needed by VPR: + + net_file + The description of the circuit in the .net format. Logic optimization + uses the circuit described in .BLIF format whereas VPR needs the same + circuit described in .net format. VPack (which comes with VPR) + converts a .BLIF format into a .net format. + + arch_file + Architecture description file for FPGAs. More information can be + found in VPR's manual. + + place_file + File to dump placement information. + + route_file + File to dump routing information. + + Relevant flags to be set by the set command: + + spfd_pdlo_logic_move_freq "r1 m1 r2 m2 ..." + Perform m1 logic moves whenever the rate of acceptance during + simulated annealing is greater than or equal to r1, and so on. + r1, r2, r3 ... should be monotonically decreasing, else the + results would be unpredictable. 0 <= ri <= 1.0. For example: + + set spfd_pdlo_logic_move_freq "0.8 0 0.5 5 0.2 10" + + In the above logic schedule, zero logic moves per temperature + will be performed when the rate of acceptance is above 0.8, 5 + logic moves between 0.8 and 0.5, 10 moves between 0.5 and 0.2. + As no value is specified for acceptance rate close to 0.0, by + default, 1 logic move per temperature will be performed. In + this example it will be 1 logic move between 0.2 and 0.0. The + quotes around the schedule are necessary. + + spfd_repl_rem + If no, the logic optimization performs only wire removal. If + yes, both wire replacement and removal are performed. + + spfd_pdlo_timing + If set, use timing driven method to remove or replace wires on + the critical path. If not set, use bounding box of the wires as + the cost function. + + spfd_pdlo_timing_nodeorwire + Remove/replace all the wires belonging to the most critical + net. If not set, attempt to remove/replace only the most + critical wire. + + spfd_pdlo_out_crit_nets_first + Output the circuit in VPR's .net format with the nets appearing + in the increasing order of their slack. If not set, the initial + net order specified in the original circuit's .net file is + used. The file is specified with -n option. This variable is + valid only if spfd_pdlo_timing is set. + + spfd_pdlo_remap_clb_array + During logic optimization, due to the removal of nodes in the + network, the current size of FPGA might be bigger than it is + necessary. In such cases, if this variable is set, the size of + the FPGA is reduced to fit the current logic network. + + Relevant flags that are options to VPR: + + For detailed information on the following options please refer to the + manual that accompanies VPR source distribution. + + vpr_nodisp + vpr_fix_pins + vpr_nx + vpr_ny + vpr_fast + vpr_init_t + vpr_alpha_t + vpr_exit_t + vpr_inner_num + vpr_seet + vpr_place_cost_exp + vpr_place_chan_width + __________________________________________________________ + + Last updated on 20100410 00h02 + +References + + 1. http://www.eecg.toronto.edu/~vaughn/vpr/vpr.html Index: vis_dev/vis-2.3/share/help/spfd_piloCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/spfd_piloCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/spfd_piloCmd.txt (revision 14) @@ -0,0 +1,117 @@ + + spfd_pilo - Perform SPFD-based placement independent logic optimization. + _________________________________________________________________ + + spfd_pilo [-a <[0,1]>] [-D ] [-f ] [-h] [-i ] [-p + ] [-r] [-S ] [-t ] [-v ] [-w ] + + This command performs SPFD-based wire removal/replacement and reprogramming + of combinational circuits mapped to LUT-based FPGAs to reduce the number of + wires and nodes in the circuit. The flexibilities in the circuit are + represented by SPFDs. The following references explain in detail the theory + behind SPFDs. + + S. Yamashita, H. Sawada, and A. Nagoya. A new method to express functional + permissibilities for LUT based FPGAs and its applications. In International + Conference on Computer Aided Design, pages 254-261, 1996. + + Subarnarekha Sinha and Robert K. Brayton. Implementation and use of SPFDs in + optimizaing Boolean networks. In International Conference on Computer Aided + Design, 1998. + + Instead of computing the flexibilities for every node in the network at + once, the algorithm computes the flexibilities for one cluster at a time. + Working with clusters allows us to avoid the BDD explosion problem and + hence, handle large circuits. The SPFDs are computed for the cluster and the + cluster nodes are reprogrammed based on the flexibility derived. Switching + activity is used to drive the choice of alternate function to be implemented + at the node. In the absence of switching activity information, the function + that can reduce support of the node can be chosen (not implemented). + Currently, an arbitrary choice is made from the flexibilities provided by + SPFDs. (-S 0, -S 2, and -S 4) + + Before calling this command a network should be created for the design (use + flatten_hierarchy) and MDD ids for every node in the network should be + created (static_order -o all -n append, for example). Dynamic variable + ordering (dvo -e sift) can be enabled to reduce BDD sizes. + + Command options: + + -a + A convex combination of switched capacitance (switching activity * + fanout count, SWC) and topological depth is used to sort the fanin + nodes during SPFD computation. alpha is between 0 and 1.0. The cost + function is alpha*SWC + (1.0-alpha)*topDepth. The default value is + 0.5. + + -D + A cluster is computed which includes nodes within the specified + 'depth'. The default value is 1. + + -f + File with simulation vectors. The file format is as below. The format + is simple but strict and hence, few checks are made. + + .i c n d o e p f q g r h s i t j u k a l b m + .s + 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 1 1 1 ; + 0 1 1 0 0 0 0 1 0 1 1 0 1 1 1 1 0 0 0 0 1 ; + 0 0 1 0 0 0 0 1 0 1 0 0 0 1 0 1 0 0 0 0 1 ; + 0 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 0 1 0 0 1 ; + The .i statement specifies the primary inputs of the network. The + patterns start after .s key word. Each vector is a space separated + list of bits and ends in a semi-colon. The length of any vector + should be equal to the number of signals specified in the .i + statement. A line starting with # is a comment. + + -h + Print usage. + + -i + Number of iterations after which to update node switching activity. + This is valid only if patterns are provided in a file using -f + option. The default value is every 5 iterations. + + -m + Heuristics to optimize a selected node. + 0: Reduce the selected node's support. + 1: Reprogram the selected node. + 2: Reprogram the selected node's fanin nodes. (default) + 3: Reduce the selected node's fanout wires. + + -p + The percentage of vectors, specified via -f option, used to perform + simulation (to update switching activity) during logic optimization. + The default value is 10%. + + -r + Do not reprogram LUTs if no structural changes have been performed + with in the cluster, i.e., if no nodes or wires have been removed do + not change the local implementation of LUTs even if alternate + implementations are availabe from SPFD information. The default is to + reprogram. + + -S + Method used to sort nodes. The nodes are then optimized in that + order. + 0: Random node is chosen. (default) + 1: If switching activity is available, node with maximum SWC is + chosen. + 2: Node with maximum fanout is chosen. + 3: If switching activity is available, node with minimum SWC is + chosen. + 4: Node with minimum fanout is chosen. + + -t + Time in seconds allowed to complete the command. If the computation + time goes above that limit, the process is aborted. The default is no + limit. + + -v + Verbosity level. Default value is 0. + + -w + File to output final optimized circuit. + __________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/static_orderCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/static_orderCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/static_orderCmd.txt (revision 14) @@ -0,0 +1,178 @@ + + static_order - order the MDD variables of the flattened network + _________________________________________________________________ + + static_order [-a] [-h] [-n ] [-o ] [-r ] -s [-t + ] [-v #] + + Order the MDD variables of the flattened network. MDD variables must be + created before MDDs can be built. Networks with combinational cycles cannot + be ordered. If the MDD variables have already been ordered, then this + command does nothing. To undo the current ordering, reinvoke the command + flatten_hierarchy. + + Command options: + + -a + Order each next state variable immediately following the variables in + the support of the corresponding next state function. By default, + each next state variable is placed immeadiately following the + corresponding present state variable. It has been observed + experimentally that ordering the NS variable after the PS variable is + almost always better; however, as a last b resort, you might want to + try this option. + + Unless the -a flag is set, the PS and NS variables corresponding to + latches are grouped together and cannot be separated by dynamic + reordering. (This is done even when the ordering is read from a file + - adjacent PS/NS vars in the file are grouped). + + -h + Print the command usage. + + -n + Specify which node ordering method to use. Node ordering is the + process of computing a total ordering on all the network nodes. This + ordering is then projected onto the set of nodes specified by -o + type. In the complexity measures below, n is the number of network + nodes, E is the number of network edges, and k is the number of + latches. "Method" must be one of the following: + + interleave: (default) Uses Algorithm 2 of Fujii et al., "Interleaving + Based Variable Ordering Methods for OBDDs", ICCAD 1993. The + complexity is O(E+nlog(n)). + + append: Uses the algorithm of Malik, et al. "Logic Verification using + Binary Decision Diagrams in a Logic Synthesis Environment," ICCAD, + 1988. Nodes are visited in DFS order, and appended to a global order + list in the order they are visited. The fanins of a node are visited + in order of decreasing depth. The roots of the DFS are visited in the + order determined by the -r method. The complexity is O(E+nlog(n)). + + merge_left: Uses an algorithm alluded to in Fujii et al., + "Interleaving Based Variable Ordering Methods for OBDDs", ICCAD 1993. + Nodes are visited in DFS order. At a given node g, its fanins are + visited in order of decreasing depth. For each fanin fi, a total + order is computed for all the nodes in the transitive fanin (TFI) of + fi, including fi itself. This ordering is merged into the combined + ordering from fanins of higher priority. After processing all of the + fanins, the result is a total ordering on all TFI nodes of g. + Finally, g is appended to the end of this ordering, yielding a + topological ordering. For example if the ordering for f1 is list1 = + (a,b,d,f1) and for f2 is list2=(c,d,e,f2), and f1 has greater depth + than f2, then the ordering for g is (c,a,b,d,e,f2,f1,g). The merge is + done by inserting into list1 those nodes in list2 not already in + list1, in such a way that the inserted nodes remain as close as + possible to their left neighbors in list2 ("insert as far left as + possible"). The roots of the DFS are merged in the order determined + by -r method. The complexity is O(n^2) (currently, there is a bug + which causes more memory to be consumed than necessary). + + merge_right: Same as merge_left, except that the merge is done in + such a way that the inserted nodes remain as close as possible to + their right neighbors in list2 ("insert as far right as possible"). + For the example above, the ordering for g is (a,b,c,d,f1,e,f2,g). It + has been observed experimentally that neither merge_left nor + merge_right is superior to the other; there are cases where + verification times out with merge_left but not merge_right, and vice + versa. + + -o + Specify the network nodes for which MDD variables should be created. + Type can be one of the following: + + all: Order all the nodes of the network. This is normally not used. + + input_and_latch: (default) Order the primary inputs, pseudo inputs, + latches, and next state variables. This is the minimum set of nodes + that need to be ordered to perform operations on FSMs (e.g. model + checking, reachability). For purely combinational circuits, just the + primary and pseudo inputs are ordered. + + -r + Specify which root ordering method to use. The "roots" of a network + refer to the roots of the cones of logic driving the combinational + outputs (data latch inputs, initial state latch inputs, and primary + outputs) of a network. Root ordering is used to determine in which + order to visit the roots of the network for the DFS carried out in + node ordering (see -n). "Method" must be one of the following: + + depth: (default for 30 or more latches) Roots are ordered based on + logic depth (i.e. longest path to a combinational input). Greater + depth roots appear earlier in the ordering. All data latch inputs + appear before all other combinational outputs. The complexity is + O(E+nlog(n)). It has been observed experimentally that mincomm + produces superior orderings to depth. However, the complexity of the + mincomm algorithm is such that it cannot produce orderings for + designs with more than a hundred or so latches. Hence, for big + designs, use depth, followed optionally by dynamic_var_ordering. + + mincomm: (default for less than 30 latches) Uses the algorithm of + Aziz, et al. "BDD Variable Ordering for Interacting Finite State + Machines," DAC, 1994. First, the latches are ordered to decrease a + communication complexity bound (where backward edges are more + expensive than forward edges) on the latch communication graph. This + directly gives an ordering for the data latch inputs. The remaining + combinational outputs are ordered after the data latch inputs, in + decreasing order of their depth. The total complexity is + O(nlog(n)+E+k^3). + + -s + Used in conjunction with to specify which nodes are supplied + in the ordering file. Type can be one of the following (there is no + default): + + all: The ordering file supplies all the nodes of the network. The + ordering generated is the supplied order, projected onto the set of + nodes specified by -o. + + input_and_latch: The ordering file supplies the primary inputs, + pseudo inputs, latches, and next state variables. The ordering + generated is exactly what is supplied (in the case of -o + input_and_latch). -o all is incompatible with -s input_and_latch. + + next_state_node: The ordering file supplies next state variables. + During the ordering algorithm, the next state functions are visited + in the order in which their corresponding next state variables appear + in the file. The order of the next state variables in the ordering + generated is not necessarily maintained. + + partial: The ordering file supplies an arbitrary subset of nodes of + the network. The ordering algorithm works by finding a total ordering + on all the nodes (independent of the ordering supplied), then merging + the computed order into the supplied order (maintaining the relative + order of the supplied order), and then projecting the resulting + ordering onto the set of nodes specified by -o. + + -t + Time in seconds allowed to perform static ordering. If the flattened + network has more than a couple hundred latches and you are using + option -r mincomm, then you might want to set a timeOut to limit the + allowed time. The default is no limit. + + -v # + Print debug information. + 0 Nothing is printed out. This is the default. + + >= 1 Prints the nodes read from the input file (satisfying the + supplied order type); prints the root order used for exploring the + network. + + >= 2 Prints the depth of nodes. + + >= 3 Prints the ordering computed at each node. + + + A file containing names of network nodes, used to specify a variable + ordering. The name of a node is the full hierarchical path name, + starting from the current hierarchical node. A node should appear at + most once in the file. Each node name should appear at the beginning + of a new line, with no white space preceeding it. The end of a node + name is marked by white space, and any other text on the rest of the + line is ignored. Any line starting with "#" or white space is + ignored. See write_order for a sample file. Note that the variable + ordering cannot be specified at the bit-level; it can only be + specified at the multi-valued variable level. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/synthesize_networkCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/synthesize_networkCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/synthesize_networkCmd.txt (revision 14) @@ -0,0 +1,124 @@ + + synthesize_network - Synthesizes a network using ZDD factorization method. + _________________________________________________________________ + + synthesize_network [-d ] [-e] [-f ] [-h] [-i + ] [-o ] [-r ] [-t ] [-v] [-A] [-O + ] [-R ] [-T] + + This command synthesizes a network to have as few literals as possible and + outputs a blif file and an equation file. Those files are the results of the + synthesis. By default, the names of the files are model_name.ml.blif and + model_name.eq unless users specify the model_name explicitly using -o + option. But, when the output blif file is read in sis, it may have slightly + different number of literals. This problem will be fixed in the later + version. Currently, this command can be used only with CUDD package. Designs + described in BLIF or BLIF-MV format can be synthesized by this command. + However, multiple valued variables are not supported. Hence, signals in the + designs described in BLIF-MV need to be restricted to binary values. There + are 4 divisor functions to find a good divisor of a function. Neither of + them consistently generates the best result. And, there are 2 factoring + methods: simple factoring and generic factoring. Also, neither of two always + does better than the other. + + Command options: + + -d + Choose a divisor. + + 0 : Fast divisor. We find a divisor on a ZDD graph. As soon as any + shared node(variable) is found, the variable is returned as a + divisor. + + 1 : (default) Least occuring literal divisor. If a variable occurs + the least frequently(but, should be more than one) in cubes, it + returns the variable as a divisor. + + 2 : Most occuring literal divisor. If a variable occurs the most + frequently in cubes, it returns the variable as a divisor. + + 3 : Level-0 divisor. It finds a divisor that is a level-0 cokernel. + + -e + Dump the synthesized circuit in equation format also. Default is not + to. + + -f + Choose a factoring method. + + 0 : (default) Simple factoring. This method uses a simple recursion. + First, it finds a proper divisor of a function, then divide the + function by the divisor, then it gets a quotient and a remainder. + And, it does the same thing recursively for each divisor, quotient, + and remainder. + + 1 : Generic factoring. This method is quite similar to the simple + factoring, but it does more in terms of considering cube-free and + common divisor and literal factoring. But, it does not always + generate better results than the simple factoring does. + + -h + Print the command usage. + + -i + Specify the prefix of internal node names. By default, the prefix is + "_n". + + -o + Specify the output file name (without extension). By default, the + model name in a blif file is used. + + -r + If the network is sequential, then use unreachable states as dont + cares in the optimization. By default no reachability analysis is + performed. See -A option of command compute_reach for more details. + The various options are: + + 0 : Do not use dont cares (default). + + 1 : Use normal breadth first search method for reachability analysis. + + 2 : Use high density traversal method for reachablity analysis. + + 3 : Use approximate unreachable states(a subset of actual unreachable + states) as dont cares. + + -t + Time in seconds allowed to perform synthesize_network. The default is + no limit. + + -v + Print debug information. + + -A + Allow realignment to ZDD/BDD after BDD/ZDD reordering, respectively. + This option is effective when only one reordering in BDD or ZDD is + enabled. + + -O + Choose an output ordering method. + + 0 : No ordering. + + 1 : (default) Use support variable set of output functions. + + 2 : Use BDD size of output functions. + + -R + Allow reordering in BDD and/or ZDD. + + 0 or n : (default) No reordering neither in BDD nor in ZDD. + + 1 or b : Allows reordering only in BDD, not in ZDD. + + 2 or z : Allows reordering only in ZDD, not in BDD. + + 3 or a : Allows reordering both in BDD and in ZDD. + + -T + Try to share more nodes during symbolic factorization. Existing + divisors are checked for potential reuse before extracting divisors + from the current boolean function. + ____________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/test_network_acyclicCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/test_network_acyclicCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/test_network_acyclicCmd.txt (revision 14) @@ -0,0 +1,17 @@ + + test_network_acyclic - determine whether the network is acyclic + _________________________________________________________________ + + test_network_acyclic [-h] + + If the flattened network has a combinational cycle, then prints information + about one of the cycles. If no cycles are present, then it prints a message + to this effect. + + Command options: + + -h + Print the command usage. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/timeCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/timeCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/timeCmd.txt (revision 14) @@ -0,0 +1,23 @@ + + time - provide a simple elapsed time value + _________________________________________________________________ + + time [-h][-u] + + Prints the processor time used since the last time command, and the total + processor time used since VIS was started. + + By default, the time reported is the CPU time spent executing instructions + of the calling process and the time this process waited for children that + terminated. + + Command options: + + -h + Print the command usage. + + -u + Exclude child process time. + _________________________________________________________________ + + Last updated on 20100410 00h02 Index: vis_dev/vis-2.3/share/help/truesimCmd.txt =================================================================== --- vis_dev/vis-2.3/share/help/truesimCmd.txt (revision 14) +++ vis_dev/vis-2.3/share/help/truesimCmd.txt (revision 14) @@ -0,0 +1,81 @@ + + truesim - Simulate the flattened network + _________________________________________________________________ + + truesim [ -D ] [ -d ] [ -f ] [ -g ] [ -h ] + [ -n ] [ -p ] [ -r ] [ -t