Release calc version 2.11.1t0

BUGS

@@ -1,8 +1,8 @@
 If you notice something wrong, strange or broken, try rereading:
 
    README.FIRST
-   README
-   BUGS (in particular the bottom problems or mis-features section)
+   HOWTO.INSTALL
+   BUGS (this file)
 
 If that does not help, cd to the calc source directory and try:
 
@@ -10,41 +10,40 @@ If that does not help, cd to the calc source directory and try:
 
 Look at the end of the output, it should say something like:
 
-    9999: passed all tests  /\../\
+    9998: passed all tests  /\../\
+    9999: Ending regression tests
 
 If it does not, then something is really broken!
 
 If you made and modifications to calc beyond the simple Makefile
 configuration, try backing them out and see if things get better.
 
-Check to see if the version of calc you are using is current.  Calc
-distributions may be obtained from the official calc repository:
+To be sure that your version of calc is up to date, check out:
 
-    ftp://ftp.uu.net/pub/calc
+	http://reality.sgi.com/chongo/tech/comp/calc/calc-download.html
 
-If you are an alpha or beta tester, you may have a special pre-released
-version that is more advanced than what is in the ftp archive.
+The calc web site is located at:
+
+	http://reality.sgi.com/chongo/tech/comp/calc/index.html
 
 =-=
 
 If you have tried all of the above and things still are not right,
 then it may be time to send in a bug report.  You can send bug reports to:
 
-    calc-tester@postofc.corp.sgi.com
+    calc-bugs at postofc dot corp dot sgi dot com
+
+    [[ Replace 'at' with @, 'dot' is with . and remove the spaces ]]
 
 When you send your report, please include the following information:
 
     * a description of the problem
-
     * the version of calc you are using (if you cannot get calc
       it to run, then send us the 4 #define lines from version.c)
-
     * if you modified calc from an official patch, send me the mods you made
-
     * the type of system you were using
-
     * the type of compiler you were using
-
+    * any compiler warnings or errors that you saw
     * cd to the calc source directory, and type:
 
 	make debug > debug.out 2>&1		(sh, ksh, bash users)
@@ -56,40 +55,144 @@ Stack traces from core dumps are useful to send as well.
 
 =-=
 
-The official calc repository is located in:
+Send any comments, compiler warning messages, suggestions and most
+importantly, fixes (in the form of a context diff patch) to:
 
-    ftp://ftp.uu.net/pub/calc
+    calc-tester at postofc dot corp dot sgi dot com
 
-If you don't have ftp access to that site, or if your version is more
-recent than what has been released to the ftp archive, you may, as a
-last resort, send EMail to:
+    [[ Replace 'at' with @, 'dot' is with . and remove the spaces ]]
 
-    chongo@toad.com
-
-Indicate the version you have and that you would like a more up to date version.
+You should use the above calc-bugs address for bug reports, if you are
+not currently a member of the calc-tester mailing list.
 
 =-=
 
-Send any comments, suggestions and most importantly, fixes (in the form
-of a context diff patch) to:
+Known bugs:
 
-    calc-tester@postofc.corp.sgi.com
+    * On AlphaLinux with gcc-2.96, calc 2.11.1 with patches to compile
+      correctly dies in the regression:
+
+	    4408: Q == (mat[2]={5+3i,17+4i})
+	    4409: R = {M2,M3}
+	    4410: norm(R) == M4
+	    "": line 78: Function "surd_sqrt" is undefined
+	    Error in commands
+	    make: *** [chk] Error 1
+
+    We are sure some more bugs exist.  When you find them, please let
+    us know!  See the above for details on how to report and were to
+    EMail your bug reports and hopefully patches to fix them.
 
 =-=
 
-Known problems or mis-features:
+Problems with known work-a-rounds:
 
-    * In calc2.10.2t3, when scan() reads characters from stdin, they
-      are not echoed.  This also happens with fgets(files(0)) and
-      fgetline(files(0)).  Reports indicate that this did not happen in
-      calc.2.10.1t20 but did in 2.10.2t0.
+    * There is a bug in gcc-2.95 that causes calc, when compiled with -O2,
+      to fail the regression test.  The work-a-round is to compile with -O
+      or to use gcc-2.96 or later.
 
-    * Many of LIBRARY, LIMITS and SEE ALSO sections of help files
-      for builtins are either inconsistent or missing information.
+    * Solaris cc somtimes barfs while compiling zrand.c.  In particular, calc
+      barfs on on the SVAL macro.  The work-a-round is to use the Solaric cc
+      Makefile set sets -DFORCE_STDC.  I.e,:
 
-    * The functions filepos2z() and z2filepos() do not work (or
-      worse do not compile) when FILEPOS is 64 bits long.
+	    CCWARN=
+	    CCOPT= ${DEBUG} ${NO_SHARED}
+	    CCMISC= -DFORCE_STDC
+	    #
+	    CFLAGS= ${CCWARN} ${CCOPT} ${CCMISC}
+	    ICFLAGS= ${CCWARN} ${CCMISC}
+	    #
+	    LCFLAGS=
+	    LDFLAGS= ${NO_SHARED} ${LD_NO_SHARED}
+	    ILDFLAGS=
+	    #
+	    LCC= cc
+	    CC= ${PURIFY} ${LCC}
 
-    * There is some places in the source with obscure variable names
-      and not much in the way of comments.  We need some major cleanup
-      and documentation.
+    * There is a bug in some versions of the Dec/Compaq cc for the Alpha
+      where the following:
+
+	    #include <stdio.h>
+	    #define SVAL(a,b) (unsigned long)(0x ## a ## b ## ULL)
+	    main(){SVAL(b8a8aeb0,8168eadc);}
+
+      fails because it puts a space inside the concatenated hex.  Calc
+      has code that is affected by this bug.  This bug has been reported
+      to Compaq and may be fixed in the future.	 A work-a-round is to
+      compile with cc -std0 or to use a later version of their compiler.
+
+    * On a Digital UNIX V4.0F (Rev. 1229) on a 500 Mhz 21264, make check
+      dies a horrible death starting in test 600 and 622 gives 100s of
+      messages for calc version 2.11.0t9.4 using the Dec's cc with -O2:
+
+	600: Beginning test_bignums
+	601: muldivcheck 1
+	**** abc != acb: 602: muldivcheck 2
+	**** acb != bac: 602: muldivcheck 2
+	...
+	**** t4 != a4: 622: algcheck 1
+	**** t5 != a5: 622: algcheck 1
+	**** t6 != a6: 622: algcheck 1
+	**** t4 != a4: 622: algcheck 1
+	...
+
+	it finally hangs at test 2000.
+
+      The work-a-round is to compile calc without the optimizer.  If this
+      happens to you, try compiling without -O and without -O2.	 I.e., in
+      the Makefile, set:
+
+	DEBUG= -g
+
+    * There are problems compiling calc on the sparcv9 under 64 bit
+      Solaris.	On that platform, gcc-2.96 is able to compile calc, but
+      calc dumps core very early on in startup.	 It is said that sparcv9
+      support in gcc-2.96 is very unofficial and thus there is no
+      work-a-round for gcc-2-96.
+
+      There is a work-a-round for this architecture us one is using the
+      Solaris CC on the sparcv9.  It has been reported that setting the
+      following Makefile variables will produce a working version of
+      calc on the sparcv9 under 64 bit Solaris:
+
+	    LCC="cc -xarch=v9"
+	    CCWARN="-DFORCE_STDC -w"
+	    DEBUG="-fast -xarch=v9"
+
+    * Under BSDI v4, the warnings of the form:
+
+	/usr/include/ctype.h:147: warning: `__runetype' defined but not used
+	/usr/include/ctype.h:161: warning: `__isctype' defined but not used
+	/usr/include/ctype.h:170: warning: `toupper' defined but not used
+	/usr/include/ctype.h:177: warning: `tolower' defined but not used
+
+      are seen.	 These warnings are the result of mis-features in BSDI
+      include files.  They do not have an impact on the operation
+      or performance.  The work-a-round is to ignore these warnings
+      under BSDI.
+
+## Copyright (C) 1999  Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.3 $
+## @(#) $Id: BUGS,v 29.3 1999/12/14 19:41:07 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/RCS/BUGS,v $
+##
+## Under source code control:	1994/03/18 14:06:13
+## File existed as early as:	1994
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

COPYING

@@ -0,0 +1,192 @@
+		calc - arbitrary precision calculator
+
+
+This file is Copyrighted
+------------------------
+
+    This file is covered under the following Copyright:
+
+	Copyright (C) 1999  Landon Curt Noll
+	All rights reserved.
+
+	Everyone is permitted to copy and distribute verbatim copies
+	of this license document, but changing it is not allowed.
+
+    # @(#) $Revision: 29.1 $
+    # @(#) $Id: COPYING,v 29.1 1999/12/14 09:15:29 chongo Exp $
+    # @(#) $Source: /usr/local/src/cmd/calc/RCS/COPYING,v $
+
+=-=
+
+Calc is covered by the GNU Lesser General Public License
+--------------------------------------------------------
+
+    Calc is open software; you can redistribute it and/or modify it under
+    the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation version 2.1 of the License.
+
+    Calc is several binary link libraries, several modules, associated
+    interface definition files and scripts used to control its compilation
+    and installation.
+
+    Calc 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 Lesser General
+    Public License for more details.
+
+    A copy of the GNU Lesser General Public License is distributed with
+    calc under the filename:
+
+	    COPYING-LGPL
+
+    You may display this file by the calc command:	help copying
+
+    You may display the GNU Lesser General
+    Public License by the calc command:			help copying-lgpl
+
+    You should have received a copy of the version 2.1 GNU Lesser General
+    Public License with calc; if not, write to:
+
+	    Free Software Foundation, Inc.
+	    59 Temple Place
+	    Suite 330
+	    Boston, MA	02111-1307
+	    USA
+
+    The contact addresses for calc is as follows:
+
+	Web:	http://reality.sgi.com/chongo/tech/comp/calc/index.html
+		http://www.isthe.com/chongo/tech/comp/calc/index.html
+
+	EMail:	calc-tester at postofc dot corp dot sgi dot com
+		calc-tester at isthe dot com
+
+		[[ Replace 'at' with @, 'dot' is with . and remove spaces ]]
+
+    The 2nd address set is provided in case the 1st address set no
+    longer functions.
+
+=-=
+
+Calc's relationship to the GNU Lesser General Public License
+------------------------------------------------------------
+
+    In section 0 of the GNU Lesser General Public License, one finds
+    the following definition:
+
+	The "Library", below, refers to any such software library or
+	work which has been distributed under these terms.
+
+    Calc is distributed under the terms of the GNU Lesser
+    General Public License.
+
+    In the same section 0, one also find the following:
+
+	For a library, complete source code means all the source code
+	for all modules it contains, plus any associated interface
+	definition files, plus the scripts used to control compilation
+	and installation of the library.
+
+    There are at least two calc binary link libraries found in calc:
+
+	libcalc.a	libcustcalc.a
+
+    Clearly all files that go into the creation of those binary link
+    libraries are covered under the License.
+
+    The ``scripts used to control compilation and installation of the
+    of the library'' include:
+
+	* Makefiles
+	* source files created by the Makefiles
+	* source code used in the creation of intermediate source files
+
+     All of those files are covered under the License.
+
+     The ``associated interface definition files'' are those files that:
+
+	* show how the calc binary link libraries are used
+	* test the validity of the binary link libraries
+	* document routines found in the binary link libraries
+	* show how one can interactively use the binary link libraries
+
+     Calc provides an extensive set of files that perform the above
+     functions.
+
+	* files under the sample sub-directory
+	* files under the help sub-directory
+	* files under the lib sub-directory
+	* the main calc.c file
+
+     The ``complete source code'' includes ALL files shipped with calc,
+     except for the exception files explicitly listed in the ``Calc
+     copyrights and exception files'' section below.
+
+=-=
+
+Calc copyrights and exception files
+-----------------------------------
+
+    With the exception of the files listed below, Calc is covered under
+    the following Copyrights:
+
+	Copyright (C) year  David I. Bell
+	Copyright (C) year  David I. Bell and Landon Curt Noll
+	Copyright (C) year  David I. Bell and Ernest Bowen
+	Copyright (C) year  David I. Bell, Landon Curt Noll and Ernest Bowen
+	Copyright (C) year  Landon Curt Noll
+	Copyright (C) year  Ernest Bowen and Landon Curt Noll
+	Copyright (C) year  Ernest Bowen
+
+    A few files are not covered under the GNU Lesser General Public
+    License.  The source files not covered are:
+
+	    shs1.c	    shs1.h	shs.c		 shs.h
+	    md5.c	    md5.h	lib/qtime.cal	 COPYING
+	    COPYING-LGPL
+
+    The file COPYING-LGPL, which contains a copy of the version 2.1
+    GNU Lesser General Public License, is itself Copyrighted by the
+    Free Software Foundation, Inc.  Please note that the Free Software
+    Foundation, Inc. does NOT have a copyright over calc, only the
+    COPYING-LGPL that is supplied with calc.
+
+    This file, COPYING, is distributed under the Copyright found at the
+    top of this file.  It is important to note that you may distribute
+    verbatim copies of this file but you may not modify this file.
+
+=-=
+
+General Copyleft and License info
+---------------------------------
+
+    For general information on Copylefts, see:
+
+	http://www.gnu.org/copyleft/
+
+    For information on GNU Lesser General Public Licenses, see:
+
+	http://www.gnu.org/copyleft/lesser.html
+	http://www.gnu.org/copyleft/lesser.txt
+
+=-=
+
+Why calc did not use the GNU General Public License
+---------------------------------------------------
+
+    It has been suggested that one should consider using the GNU General
+    Public License instead of the GNU Lesser General Public License:
+
+	http://www.gnu.org/philosophy/why-not-lgpl.html
+
+    As you can read in the above URL, there are times where a library
+    cannot give free software any particular advantage.	 One of those
+    times is when there is significantly similar versions available
+    that are not covered under a Copyleft such as the GNU General Public
+    License.
+
+    The reason why calc was placed under the GNU Lesser General Public
+    License is because for many years (1984 thru 1999), calc was offered
+    without any form of Copyleft.  At the time calc was placed under
+    the GNU Lesser General Public License, a number of systems and
+    distributions distributed calc without a Copyleft.

COPYING-LGPL

@@ -0,0 +1,504 @@
+		  GNU LESSER GENERAL PUBLIC LICENSE
+		       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+     59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+			    Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+		  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+  
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+			    NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+		     END OF TERMS AND CONDITIONS
+
+           How to Apply These Terms to Your New Libraries
+
+  If you develop a new library, and you want it to be of the greatest
+possible use to the public, we recommend making it free software that
+everyone can redistribute and change.  You can do so by permitting
+redistribution under these terms (or, alternatively, under the terms of the
+ordinary General Public License).
+
+  To apply these terms, attach the following notices to the library.  It is
+safest to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least the
+"copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the library's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This library is free software; you can redistribute it and/or
+    modify it under the terms of the GNU Lesser General Public
+    License as published by the Free Software Foundation; either
+    version 2 of the License, or (at your option) any later version.
+
+    This library 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
+    Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public
+    License along with this library; if not, write to the Free Software
+    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+Also add information on how to contact you by electronic and paper mail.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the library, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the
+  library `Frob' (a library for tweaking knobs) written by James Random Hacker.
+
+  <signature of Ty Coon>, 1 April 1990
+  Ty Coon, President of Vice
+
+That's all there is to it!
+
+

HOWTO.INSTALL

@@ -0,0 +1,76 @@
+Installing calc in 4 easy steps:
+
+    1) Look at the makefile, and adjust it to suit your needs.
+
+       Here are some Makefile hints:
+
+	   Select a compiler set by commenting in the appropriate set
+	   of cc options.  As shipped the Makefile assumes a gcc-like
+	   environment such as Linux.  If a more appropriate cc set if
+	   found below, comment out the Linux set and comment in that
+	   set or edit the gcc set or the common cc set as needed.
+
+	   You may or may not need RANLIB when building libraries.
+	   As shipped the Makefile assumes RANLIB is needed.
+	   Comment the in/out the RANLIB value if ranlib does
+	   not work or does not exist.
+
+	   You may want to change the default pager used by calc.
+	   As shipped the Makefile assumes 'more'.  On your system
+	   you may find 'less' to be a better pager.
+
+	   Set TOPDIR to be the place under which help files, calc,
+	   include files and calc libs are to be installed.  As shipped
+	   the Makefile assumes a TOPDIR of /usr/local/lib.
+
+	   Set BINDIR to the place where calc is installed.  As shipped
+	   the Makefile assumes a BINDIR /usr/local/bin.
+
+	   Adjust other Makefile variables as needed.
+
+    2) build calc:
+
+	make all
+
+	==> We are interested in any compiler warnings (and errors) that
+	    you may find.  See the BUGS file if you find any compiler
+	    warning or errors.
+
+    3) test calc:
+
+	make check
+
+	==> If you run into problems, follow the BUGS file instructions.
+
+    4) install calc:
+
+	make install
+
+We suggest that you might want to read the README file and look at
+the calc help subsystem.  See the README file for details.
+
+## Copyright (C) 1999  Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: HOWTO.INSTALL,v 29.1 1999/12/14 09:15:29 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/RCS/HOWTO.INSTALL,v $
+##
+## Under source code control:	1999/09/27 20:48:44
+## File existed as early as:	1999
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

LIBRARY

@@ -1,22 +1,28 @@
 	USING THE ARBITRARY PRECISION ROUTINES IN A C PROGRAM
 
-Part of the calc release consists of an arbitrary precision math library.
-This library is used by the calc program to perform its own calculations.
+Part of the calc release consists of an arbitrary precision math link library.
+This link library is used by the calc program to perform its own calculations.
 If you wish, you can ignore the calc program entirely and call the arbitrary
 precision math routines from your own C programs.
 
-The library is called libcalc.a, and provides routines to handle arbitrary
+The link library is called libcalc.a, and provides routines to handle arbitrary
 precision arithmetic with integers, rational numbers, or complex numbers.
 There are also many numeric functions such as factorial and gcd, along
 with some transcendental functions such as sin and exp.
 
+Take a look at the sample sub-directory.  It contains a few simple
+examples of how to use libcalc.a that might be helpful to look at
+after you have read this file.
+
 ------------------
 FIRST THINGS FIRST
 ------------------
 
-*******************************************************************************
-* You MUST call libcalc_call_me_first() prior to using libcalc lib functions! *
-*******************************************************************************
+...............................................................................
+.									      .
+. You MUST call libcalc_call_me_first() prior to using libcalc lib functions! .
+.									      .
+...............................................................................
 
 The function libcalc_call_me_first() takes no args and returns void.  You
 need call libcalc_call_me_first() only once.
@@ -37,14 +43,13 @@ to use more than one type of arithmetic, since qmath.h automatically includes
 zmath.h, and cmath.h automatically includes qmath.h.
 
 The prototypes for the available routines are listed in the above include
-files.  Some of these routines are meant for internal use, and so aren't
+files.	Some of these routines are meant for internal use, and so aren't
 convenient for outside use.  So you should read the source for a routine
 to see if it really does what you think it does.  I won't guarantee that
 obscure internal routines won't change or disappear in future releases!
 
 When calc is installed, all of the include files needed to build
-libcalc.a along with the library itself (and the lint library
-llib-lcalc.ln, if made) are installed into ${LIBDIR}.
+libcalc.a along with the link library itself are installed into ${LIBDIR}.
 
 External programs may want to compile with:
 
@@ -54,7 +59,7 @@ External programs may want to compile with:
 ERROR HANDLING
 --------------
 
-Your program MUST provide a function called math_error.  This is called by
+Your program MUST provide a function called math_error.	 This is called by
 the math routines on an error condition, such as malloc failures or a
 division by zero.  The routine is called in the manner of printf, with a
 format string and optional arguments.  (However, none of the low level math
@@ -71,9 +76,9 @@ level in your program, and use longjmp in the math_error routine to return
 to that level and so recover from the error.  This is what the calc program
 does.
 
-For convenience, the library libcalc.a contains a math_error routine.
+For convenience, the link library libcalc.a contains a math_error routine.
 By default, this routine simply prints a message to stderr and then exits.
-By simply linking in this library, any calc errors will result in a
+By simply linking in this link library, any calc errors will result in a
 error message on stderr followed by an exit.
 
 External programs that wish to use this math_error may want to compile with:
@@ -98,7 +103,11 @@ For example:
     ...
 
     if ((error = setjmp(calc_jmp_buf)) != 0) {
-	    /* handle error */
+
+	    /* reinitialize calc after a longjmp */
+	    reinitialize();
+
+	    /* report the error */
 	    printf("Ouch: %s\n", calc_error);
     }
     calc_jmp = 1;
@@ -107,7 +116,7 @@ For example:
 OUTPUT ROUTINES
 ---------------
 
-The output from the routines in the library normally goes to stdout.  You
+The output from the routines in the link library normally goes to stdout.  You
 can divert that output to either another FILE handle, or else to a string.
 Read the routines in zio.c to see what is available.  Diversions can be
 nested.
@@ -132,7 +141,7 @@ output strings with space filling, output formatted strings like printf, and
 flush the output.  Output from these routines is diverted as described above.
 
 You can change the default output mode by calling math_setmode, and you can
-change the default number of digits printed by calling math_setdigits.  These
+change the default number of digits printed by calling math_setdigits.	These
 routines return the previous values.  The possible modes are described in
 zmath.h.
 
@@ -144,7 +153,7 @@ The arbitrary precision integer routines define a structure called a ZVALUE.
 This is defined in zmath.h.  A ZVALUE contains a pointer to an array of
 integers, the length of the array, and a sign flag.  The array is allocated
 using malloc, so you need to free this array when you are done with a
-ZVALUE.  To do this, you should call zfree with the ZVALUE as an argument
+ZVALUE.	 To do this, you should call zfree with the ZVALUE as an argument
 (or call freeh with the pointer as an argument) and never try to free the
 array yourself using free.  The reason for this is that sometimes the pointer
 points to one of two statically allocated arrays which should NOT be freed.
@@ -238,7 +247,7 @@ If the value is too large for ztofull(), ztoulong() or ztolong(), only
 the low order bits converted.
 
 There are two types of comparisons you can make on ZVALUEs.  This is whether
-or not they are equal, or the ordering on size of the numbers.  The zcmp
+or not they are equal, or the ordering on size of the numbers.	The zcmp
 function tests whether two ZVALUEs are equal, returning TRUE if they differ.
 The zrel function tests the relative sizes of two ZVALUEs, returning -1 if
 the first one is smaller, 0 if they are the same, and 1 if the first one
@@ -257,7 +266,7 @@ is always positive.  If the NUMBER is an integer, the denominator has the
 value 1.
 
 Unlike ZVALUEs, NUMBERs are passed using pointers, and pointers to them are
-returned by functions.  So the basic type for using fractions is not really
+returned by functions.	So the basic type for using fractions is not really
 (NUMBER), but is (NUMBER *).  NUMBERs are allocated using the qalloc routine.
 This returns a pointer to a number which has the value 1.  Because of the
 special property of a ZVALUE of 1, the numerator and denominator of this
@@ -273,7 +282,7 @@ A better way to create NUMBERs with particular values is to use the itoq,
 iitoq, or atoq functions.  Using itoq makes a long value into a NUMBER,
 using iitoq makes a pair of longs into the numerator and denominator of a
 NUMBER (reducing them first if needed), and atoq converts a string representing
-a number into the corresponding NUMBER.  The atoq function accepts input in
+a number into the corresponding NUMBER.	 The atoq function accepts input in
 integral, fractional, real, or exponential formats.  Examples of allocating
 numbers are:
 
@@ -284,7 +293,7 @@ numbers are:
 	q3 = atoq("456.78");
 
 Also unlike ZVALUEs, NUMBERs are quickly copied.  This is because they contain
-a link count, which is the number of pointers there are to the NUMBER.  The
+a link count, which is the number of pointers there are to the NUMBER.	The
 qlink macro is used to copy a pointer to a NUMBER, and simply increments
 the link count and returns the same pointer.  Since it is a macro, the
 argument should not be a function call, but a real pointer variable.  The
@@ -318,13 +327,13 @@ Examples of these are qnum to return the numerator, qden to return the
 denominator, qint to return the integer part of, qfrac to return the
 fractional part of, and qinv to invert a fraction.
 
-There are some transcendental functions in the library, such as sin and cos.
-These cannot be evaluated exactly as fractions.  Therefore, they accept
-another argument which tells how accurate you want the result.  This is an
-"epsilon" value, and the returned value will be within that quantity of
-the correct value.  This is usually an absolute difference, but for some
-functions (such as exp), this is a relative difference.  For example, to
-calculate sin(0.5) to 100 decimal places, you could do:
+There are some transcendental functions in the link library, such as sin
+and cos.  These cannot be evaluated exactly as fractions.  Therefore,
+they accept another argument which tells how accurate you want the result.
+This is an "epsilon" value, and the returned value will be within that
+quantity of the correct value.	This is usually an absolute difference,
+but for some functions (such as exp), this is a relative difference.
+For example, to calculate sin(0.5) to 100 decimal places, you could do:
 
 	NUMBER *q, *ans, *epsilon;
 
@@ -353,7 +362,7 @@ macros are:
 The comparisons for NUMBERs are similar to the ones for ZVALUEs.  You use the
 qcmp and qrel functions.
 
-There are four predefined values for fractions.  You should qlink them when
+There are four predefined values for fractions.	 You should qlink them when
 you want to use them.  These are _qzero_, _qone_, _qnegone_, and _qonehalf_.
 These have the values 0, 1, -1, and 1/2.  An example of using them is:
 
@@ -367,7 +376,7 @@ USING COMPLEX NUMBERS
 ---------------------
 
 The arbitrary precision complex arithmetic routines define a structure
-called COMPLEX.  This is defined in cmath.h.  This contains two NUMBERs
+called COMPLEX.	 This is defined in cmath.h.  This contains two NUMBERs
 for the real and imaginary parts of a complex number, and a count of the
 number of links there are to this COMPLEX number.
 
@@ -400,7 +409,7 @@ There is no direct routine to convert a string value into a COMPLEX value.
 But you can do this yourself by converting two strings into two NUMBERS,
 and then using the qqtoc routine.
 
-COMPLEX values are always returned from these routines.  To split out the
+COMPLEX values are always returned from these routines.	 To split out the
 real and imaginary parts into normal NUMBERs, you can simply qlink the
 two components, as shown in the following example:
 
@@ -413,7 +422,7 @@ two components, as shown in the following example:
 
 There are many macros for checking quick things about complex numbers,
 similar to the ZVALUE and NUMBER macros.  In addition, there are some
-only used for complex numbers.  Examples of macros are:
+only used for complex numbers.	Examples of macros are:
 
 	cisreal(c)	(number is real)
 	cisimag(c)	(number is pure imaginary)
@@ -431,6 +440,43 @@ only used for complex numbers.  Examples of macros are:
 There is only one comparison you can make for COMPLEX values, and that is
 for equality.  The ccmp function returns TRUE if two complex numbers differ.
 
-There are three predefined values for complex numbers.  You should clink
-them when you want to use them.  They are _czero_, _cone_, and _conei_.
+There are three predefined values for complex numbers.	You should clink
+them when you want to use them.	 They are _czero_, _cone_, and _conei_.
 These have the values 0, 1, and i.
+
+----------------
+LAST THINGS LAST
+----------------
+
+If you wish, when you are all doen you can call libcalc_call_me_last()
+to free a small amount of storage associated with the libcalc_call_me_first()
+call.  This is not required, but is does bring things to a closure.
+
+The function libcalc_call_me_last() takes no args and returns void.  You
+need call libcalc_call_me_last() only once.
+
+## Copyright (C) 1999  David I. Bell and Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: LIBRARY,v 29.1 1999/12/14 09:15:29 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/RCS/LIBRARY,v $
+##
+## Under source code control:	1993/07/30 19:44:49
+## File existed as early as:	1993
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

README

@@ -1,68 +1,127 @@
-# Copyright (c) 1994 David I. Bell
-# Permission is granted to use, distribute, or modify this source,
-# provided that this copyright notice remains intact.
-#
-# Arbitrary precision calculator.
+Dear calc user,
 
-I am allowing this calculator to be freely distributed for personal uses.
-Like all multi-precision programs, you should not depend absolutely on
-its results, since bugs in such programs can be insidious and only rarely
-show up.
+See the HOWTO.INSTALL file for information on how to build and install calc.
 
--dbell-
+To be sure that your version of calc is up to date, check out:
 
-p.s. By Landon Curt Noll:
+	http://reality.sgi.com/chongo/tech/comp/calc/calc-download.html
 
-Building calc in 3 easy steps:
+We are interested in any/all feedback on recent versions of calc.
+In particular we would like to hear about:
 
-    1) Look at the makefile, and adjust it to suit your needs.
+    * compiler warnings
+    * compile problems
+    * regression test problems (try: make check)
+    * special compile flags/options that you needed
+    * Makefile problems
+    * help file problems
+    * misc nits and typos
 
-       Here are some Makefile hints:
+We would like to offer a clean compile across a wide verity of platforms,
+so if you can test on several, so much the better!
 
-	   In the past, some people have had to adjust the VARARG or
-	   TERMCONTROL because the Makefile cannot always guess
-	   correctly for certain systems.  You may need to play with
-	   these values if you experience problems.
-
-	   The default compiler used is 'cc'.  The default compiler flag
-	   is '-O'.  If you have gcc, or gcc v2 (or better) you should use
-	   that instead.   Some compilers allow for optimization beyond
-	   just -O (gcc v2 has -O2, mips cc has -O3).  You should select
-	   the best flag for speed optimization.  Calc can be cpu intensive
-	   so selecting a quality compiler and good optimization level can
-	   really pay off.
-
-    2) build calc:
-
-	make all
-
-    3) test calc:
-
-	make check
-
- ==>>>If you run into problems, follow the instructions in the BUGS file<<<==
+If you run into problems, see the BUGS file.
 
 =-=
 
-For further reading:
+Calc is distributed with an extensive collection of help files that
+are accessible from the command line.  The following assume that you
+are running calc from the distribution directory or that you have
+installed calc.	 In these examples, the ">" is the calc prompt, not
+something that you type in.
 
-    LIBRARY
-    	explains how programs can use libcalc.a to take advantage
-	of the calc multi-precision routines.
+For list of help topics:
+
+    > help
+
+For overview of calc overview:
+
+    > help intro
+    > help overview
+    > help command
+    > help define
+    > help statement
+    > help variable
+    > help usage
+
+For list of builtin functions:
+
+    > help builtin
+
+C programmers should note some unexpected differences in the calc syntax:
+
+    > help unexpected
+
+Calc is shipped with a standard collection of calc resource files.
+For a list of calc standard resource files see:
+
+    > help resource
+
+=-=
+
+See the file:
 
     help/todo
-	current wish list for calc
+    help/wishlist
 
-    CHANGES
-	recent changes to calc
+or run:
 
-    BUGS
-	known bugs, mis-features and how to report problems
+    calc help todo
+    calc help wishlist
 
-    help/full
-	full set of calc documentation
+for a wish/todo list.  Code contributions are welcome.
 
 =-=
 
-David I. Bell    dbell@auug.org.au
-chongo@toad.com	<Landon Curt Noll -- chongo@toad.com> /\../\
+To join the calc-tester mailing list.  Send a request to:
+
+    calc-tester-request at postofc dot corp dot sgi dot com
+
+    [[ Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+
+Your message body (not the subject) should consist of:
+
+     subscribe calc-tester address
+     end
+     name your_full_name
+
+where ``address'' is your EMail address and ``your_full_name'' is
+your full name.
+
+Calc bug reports, however should be sent to:
+
+    calc-bugs at postofc dot corp dot sgi dot com
+
+    [[ Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+
+but see the BUGS file first.
+
+The calc web site is located at:
+
+	http://reality.sgi.com/chongo/tech/comp/calc/
+
+## Copyright (C) 1999  Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: README,v 29.1 1999/12/14 09:15:29 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/RCS/README,v $
+##
+## Under source code control:	1995/10/25 05:27:59
+## File existed as early as:	1995
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

README.FIRST

@@ -1,52 +0,0 @@
-Dear alpha tester,
-
-Thanks for taking the time to try out this alpha version of calc!  We are
-interested in any/all feedback that you may have on this version.  In
-particular we would like to hear about:
-
-    * compile problems
-    * regression test problems (try: make check)
-    * compiler warnings
-    * special compile flags/options that you needed
-    * Makefile problems
-    * help file problems
-    * misc nits and typos
-
-We would like to offer a clean compile across a wide verity of platforms,
-so if you can test on several, so much the better!
-
-Calc distributions may be obtained from:
-
-	ftp://ftp.uu.net/pub/calc
-
-If you don't have ftp access to that site, or if you do not find a more
-recent version (you may have a special pre-released version that is
-more advanced than what is in the ftp archive) send EMail to:
-
-	chongo@toad.com
-
-Indicate the version you have and that you would like a more up
-to date version.
-
-=-=
-
-Misc items TODO before Beta release:
-
-    * improve the coverage in the 'SEE ALSO' help file lists
-
-    * where reasonable, be sure that regress.cal tests builtin functions
-
-    * add the Blum-Blum-Shub random() generator code
-
-    * add code to allow of the reading, writing and processing of binary data
-
-    * add shs, shs-1 and md5 hashing functions.  Use align32.h.
-
-    * add mod h*2^n+/-1 function for integers
-
-    * be sure that CHANGES is up to date,
-      look over the help/todo file and update as needed,
-      revisit issues in the BUGS file and
-      change this file  :-)
-
-    * clean the source code and document it better

addop.c

@@ -1,11 +1,36 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * addop - add opcodes to a function being compiled
  *
- * Add opcodes to a function being compiled.
+ * Copyright (C) 1999  David I. Bell and Ernest Bowen
+ *
+ * Primary author:  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: addop.c,v 29.1 1999/12/14 09:15:29 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/addop.c,v $
+ *
+ * Under source code control:	1990/02/15 01:48:10
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
+#include <stdio.h>
 #include "calc.h"
 #include "opcodes.h"
 #include "string.h"
@@ -15,13 +40,15 @@
 #include "symbol.h"
 
 
-#define	FUNCALLOCSIZE	20	/* reallocate size for functions */
-#define	OPCODEALLOCSIZE	100	/* reallocate size for opcodes in functions */
+#define FUNCALLOCSIZE	20	/* reallocate size for functions */
+#define OPCODEALLOCSIZE 100	/* reallocate size for opcodes in functions */
 
 
 static long maxopcodes;		/* number of opcodes available */
 static long newindex;		/* index of new function */
+static char *newname;		/* name of new function */
 static long oldop;		/* previous opcode */
+static long oldoldop;		/* opcode before previous opcode */
 static long debugline;		/* line number of latest debug opcode */
 static long funccount;		/* number of functions */
 static long funcavail;		/* available number of functions */
@@ -59,22 +86,50 @@ initfunctions(void)
 void
 showfunctions(void)
 {
-	FUNC **fpp;		/* pointer into function table */
 	FUNC *fp;		/* current function */
+	long count;
+	long index;
 
-	if (funccount == 0) {
-		printf("No user functions defined.\n");
-		return;
+	count = 0;
+	if (funccount > 0) {
+		if (conf->resource_debug & RSCDBG_FUNC_INFO)
+			math_str("Index\tName        \tArgs\tOpcodes\n"
+				 "-----\t------     \t---- \t------\n");
+		else
+			math_str("Name\tArguments\n"
+				 "----\t---------\n");
+		for (index = 0; index < funccount; index++) {
+			fp = functions[index];
+			if (conf->resource_debug & RSCDBG_FUNC_INFO) {
+
+				math_fmt("%5ld\t%-12s\t", index,
+					namestr(&funcnames,index));
+				if (fp) {
+					count++;
+					math_fmt("%-5d\t%-5ld\n",
+					 fp->f_paramcount, fp->f_opcodecount);
+				} else {
+					math_str("null\t0\n");
+				}
+			} else {
+				if (fp == NULL)
+					continue;
+				count++;
+				math_fmt("%-12s\t%-2d\n", namestr(&funcnames,
+					index), fp->f_paramcount);
+			}
+		}
 	}
-	printf("Name Arguments\n");
-	printf("---- ---------\n");
-	for (fpp = &functions[funccount - 1]; fpp >= functions; fpp--) {
-		fp = *fpp;
-		if (fp == NULL)
-			continue;
-		printf("%-12s %-2d\n", fp->f_name, fp->f_paramcount);
+	if (conf->resource_debug & RSCDBG_FUNC_INFO) {
+		math_fmt("\nNumber non-null: %ld\n", count);
+		math_fmt("Number null: %ld\n", funccount - count);
+		math_fmt("Total number: %ld\n", funccount);
+	} else {
+		if (count > 0)
+			math_fmt("\nNumber: %ld\n", count);
+		else
+			math_str("No user functions defined\n");
 	}
-	printf("\n");
 }
 
 
@@ -107,11 +162,14 @@ beginfunc(char *name, BOOL newflag)
 	fp->f_localcount = 0;
 	fp->f_opcodecount = 0;
 	fp->f_savedvalue.v_type = V_NULL;
-	fp->f_name = namestr(&funcnames, newindex);
+	fp->f_savedvalue.v_subtype = V_NOSUBTYPE;
+	newname = namestr(&funcnames, newindex);
+	fp->f_name = newname;
 	curfunc = fp;
 	initlocals();
 	initlabels();
 	oldop = OP_NOP;
+	oldoldop = OP_NOP;
 	debugline = 0;
 	errorcount = 0;
 }
@@ -127,10 +185,17 @@ endfunc(void)
 {
 	register FUNC *fp;		/* function just finished */
 	unsigned long size;		/* size of just created function */
+	long index;
+
+	if (oldop != OP_RETURN) {
+		addop(OP_UNDEF);
+		addop(OP_RETURN);
+	}
 
 	checklabels();
+
 	if (errorcount) {
-		printf("\"%s\": %ld error%s\n", curfunc->f_name, errorcount,
+		printf("\"%s\": %ld error%s\n", newname, errorcount,
 			((errorcount == 1) ? "" : "s"));
 		return;
 	}
@@ -150,14 +215,24 @@ endfunc(void)
 			size += dumpop(&fp->f_opcodes[size]);
 		}
 	}
+	if ((inputisterminal() && conf->resource_debug & RSCDBG_STDIN_FUNC) ||
+	    (!inputisterminal() && conf->resource_debug & RSCDBG_FILE_FUNC)) {
+		printf("%s(", newname);
+		for (index = 0; index <	 fp->f_paramcount; index++) {
+			if (index)
+				putchar(',');
+			printf("%s", paramname(index));
+		}
+		printf(") ");
+		if (functions[newindex])
+			printf("re");
+		printf("defined\n");
+	}
 	if (functions[newindex]) {
+		freenumbers(functions[newindex]);
 		free(functions[newindex]);
-		fprintf(stderr, "**** %s() has been redefined\n", fp->f_name);
 	}
 	functions[newindex] = fp;
-	objuncache();
-	if (inputisterminal())
-		printf("\"%s\" defined\n", fp->f_name);
 }
 
 
@@ -195,6 +270,99 @@ adduserfunc(char *name)
 	return index;
 }
 
+/*
+ * Remove user defined function
+ */
+void
+rmuserfunc(char *name)
+{
+	long index;		/* index of function */
+
+	index = findstr(&funcnames, name);
+	if (index < 0) {
+		fprintf(stderr, "%s() has never been defined\n",
+			name);
+		return;
+	}
+	if (functions[index] == NULL)
+		return;
+	freenumbers(functions[index]);
+	free(functions[index]);
+	if ((inputisterminal() && conf->resource_debug & RSCDBG_STDIN_FUNC) ||
+	    (!inputisterminal() && conf->resource_debug & RSCDBG_FILE_FUNC))
+		printf("%s() undefined\n", name);
+	functions[index] = NULL;
+}
+
+
+/*
+ * Free memory used to store function and its constants
+ */
+void
+freefunc(FUNC *fp)
+{
+	long index;
+	long i;
+
+	if (fp == NULL)
+		return;
+	if (fp == curfunc) {
+		index = newindex;
+	} else {
+		for (index = 0; index < funccount; index++) {
+			if (functions[index] == fp)
+				break;
+		}
+		if (index == funccount) {
+			math_error("Bad call to freefunc!!!");
+			/*NOTREACHED*/
+		}
+	}
+	if (conf->traceflags & TRACE_FNCODES) {
+		printf("Freeing function \"%s\"\n",namestr(&funcnames,index));
+		dumpnames = FALSE;
+		for (i = 0; i < fp->f_opcodecount; ) {
+			printf("%ld: ", i);
+			i += dumpop(&fp->f_opcodes[i]);
+		}
+	}
+	freenumbers(fp);
+	if (fp != functemplate)
+		free(fp);
+}
+
+
+void
+rmalluserfunc(void)
+{
+	FUNC *fp;
+	long index;
+
+	for (index = 0; index < funccount; index++) {
+		fp = functions[index];
+		if (fp) {
+			freefunc(fp);
+			functions[index] = NULL;
+		}
+	}
+}
+
+
+/*
+ * get index of defined user function with specified name, or -1 if there
+ * is none or if it has been undefined
+ */
+long
+getuserfunc(char *name)
+{
+	long index;
+
+	index = findstr(&funcnames, name);
+	if (index >= 0 && functions[index] != NULL)
+		return index;
+	return -1L;
+}
+
 
 /*
  * Clear any optimization that may be done for the next opcode.
@@ -204,6 +372,7 @@ void
 clearopt(void)
 {
 	oldop = OP_NOP;
+	oldoldop = OP_NOP;
 	debugline = 0;
 }
 
@@ -253,10 +422,17 @@ void
 addop(long op)
 {
 	register FUNC *fp;		/* current function */
-	NUMBER *q;
+	NUMBER *q, *q1, *q2;
+	unsigned long count;
+	BOOL cut;
+	int diff;
 
 	fp = curfunc;
-	if ((fp->f_opcodecount + 5) >= maxopcodes) {
+	count = fp->f_opcodecount;
+	cut = TRUE;
+	diff = 2;
+	q = NULL;
+	if ((count + 5) >= maxopcodes) {
 		maxopcodes += OPCODEALLOCSIZE;
 		fp = (FUNC *) malloc(funcsize(maxopcodes));
 		if (fp == NULL) {
@@ -269,73 +445,174 @@ addop(long op)
 			free(curfunc);
 		curfunc = fp;
 	}
+
 	/*
 	 * Check the current opcode against the previous opcode and try to
 	 * slightly optimize the code depending on the various combinations.
 	 */
-	if (op == OP_GETVALUE) {
-		switch (oldop) {
+	switch (op) {
+		case OP_GETVALUE:
+			switch (oldop) {
+				case OP_NUMBER:
+				case OP_ZERO:
+				case OP_ONE:
+				case OP_IMAGINARY:
+				case OP_GETEPSILON:
+				case OP_SETEPSILON:
+				case OP_STRING:
+				case OP_UNDEF:
+				case OP_GETCONFIG:
+				case OP_SETCONFIG:
+					return;
+				case OP_DUPLICATE:
+					diff = 1;
+					oldop = OP_DUPVALUE;
+					break;
+				case OP_FIADDR:
+					diff = 1;
+					oldop = OP_FIVALUE;
+					break;
+				case OP_GLOBALADDR:
+					diff = 1 + PTR_SIZE;
+					oldop = OP_GLOBALVALUE;
+					break;
+				case OP_LOCALADDR:
+					oldop = OP_LOCALVALUE;
+					break;
+				case OP_PARAMADDR:
+					oldop = OP_PARAMVALUE;
+					break;
+				case OP_ELEMADDR:
+					oldop = OP_ELEMVALUE;
+					break;
+				default:
+					cut = FALSE;
 
-		case OP_NUMBER: case OP_ZERO: case OP_ONE: case OP_IMAGINARY:
-		case OP_GETEPSILON: case OP_SETEPSILON: case OP_STRING:
-		case OP_UNDEF: case OP_GETCONFIG: case OP_SETCONFIG:
-			return;
-		case OP_DUPLICATE:
-			fp->f_opcodes[fp->f_opcodecount - 1] = OP_DUPVALUE;
-			oldop = OP_DUPVALUE;
-			return;
-		case OP_FIADDR:
-			fp->f_opcodes[fp->f_opcodecount - 1] = OP_FIVALUE;
-			oldop = OP_FIVALUE;
-			return;
-		case OP_GLOBALADDR:
-			fp->f_opcodes[fp->f_opcodecount - 2] = OP_GLOBALVALUE;
-			oldop = OP_GLOBALVALUE;
-			return;
-		case OP_LOCALADDR:
-			fp->f_opcodes[fp->f_opcodecount - 2] = OP_LOCALVALUE;
-			oldop = OP_LOCALVALUE;
-			return;
-		case OP_PARAMADDR:
-			fp->f_opcodes[fp->f_opcodecount - 2] = OP_PARAMVALUE;
-			oldop = OP_PARAMVALUE;
-			return;
-		case OP_ELEMADDR:
-			fp->f_opcodes[fp->f_opcodecount - 2] = OP_ELEMVALUE;
-			oldop = OP_ELEMVALUE;
-			return;
-		}
+			}
+			if (cut) {
+				fp->f_opcodes[count - diff] = oldop;
+				return;
+			}
+			break;
+		case OP_POP:
+			switch (oldop) {
+			case OP_ASSIGN:
+				fp->f_opcodes[count-1] = OP_ASSIGNPOP;
+				oldop = OP_ASSIGNPOP;
+				return;
+			case OP_NUMBER:
+			case OP_IMAGINARY:
+				q = constvalue(fp->f_opcodes[count-1]);
+				qfree(q);
+				break;
+			case OP_STRING:
+				sfree(findstring((long)fp->f_opcodes[count-1]));
+				break;
+			case OP_LOCALADDR:
+			case OP_PARAMADDR:
+				break;
+			case OP_GLOBALADDR:
+				diff = 1 + PTR_SIZE;
+				break;
+			case OP_UNDEF:
+				fp->f_opcodecount -= 1;
+				oldop = OP_NOP;
+				oldoldop = OP_NOP;
+				return;
+			default:
+				cut = FALSE;
+			}
+			if (cut) {
+				fp->f_opcodecount -= diff;
+				oldop = OP_NOP;
+				oldoldop = OP_NOP;
+				fprintf(stderr,
+					"Line %ld: unused value ignored\n",
+					linenumber());
+				return;
+			}
+			break;
+		case OP_NEGATE:
+			if (oldop == OP_NUMBER) {
+				q = constvalue(fp->f_opcodes[count-1]);
+				fp->f_opcodes[count-1] = addqconstant(qneg(q));
+				qfree(q);
+				return;
+			}
 	}
-	if ((op == OP_NEGATE) && (oldop == OP_NUMBER)) {
-		q = constvalue(fp->f_opcodes[fp->f_opcodecount - 1]);
-		fp->f_opcodes[fp->f_opcodecount - 1] = addqconstant(qneg(q));
-		oldop = OP_NUMBER;
-		return;
-	}
-	if ((op == OP_POWER) && (oldop == OP_NUMBER)) {
-		if (qcmpi(constvalue(fp->f_opcodes[fp->f_opcodecount - 1]), 2L) == 0) {
-			fp->f_opcodecount--;
-			fp->f_opcodes[fp->f_opcodecount - 1] = OP_SQUARE;
-			oldop = OP_SQUARE;
-			return;
+	if (oldop == OP_NUMBER) {
+		if (oldoldop == OP_NUMBER) {
+			q1 = constvalue(fp->f_opcodes[count - 3]);
+			q2 = constvalue(fp->f_opcodes[count - 1]);
+			switch (op) {
+				case OP_DIV:
+					if (qiszero(q2)) {
+						cut = FALSE;
+						break;
+					}
+					q = qqdiv(q1,q2);
+					break;
+				case OP_MUL:
+					q = qmul(q1,q2);
+					break;
+				case OP_ADD:
+					q = qqadd(q1,q2);
+					break;
+				case OP_SUB:
+					q = qsub(q1,q2);
+					break;
+				case OP_POWER:
+					if (qisfrac(q2) || qisneg(q2))
+						cut = FALSE;
+					else
+						q = qpowi(q1,q2);
+					break;
+				default:
+					cut = FALSE;
+			}
+			if (cut) {
+				qfree(q1);
+				qfree(q2);
+				fp->f_opcodes[count - 3] = addqconstant(q);
+				fp->f_opcodecount -= 2;
+				oldoldop = OP_NOP;
+				return;
+			}
+		} else if (op != OP_NUMBER) {
+			q = constvalue(fp->f_opcodes[count - 1]);
+			if (op == OP_POWER) {
+				if (qcmpi(q, 2L) == 0) {
+					fp->f_opcodecount--;
+					fp->f_opcodes[count - 2] = OP_SQUARE;
+					qfree(q);
+					oldop = OP_SQUARE;
+					return;
+				}
+				if (qcmpi(q, 4L) == 0) {
+					fp->f_opcodes[count - 2] = OP_SQUARE;
+					fp->f_opcodes[count - 1] = OP_SQUARE;
+					qfree(q);
+					oldop = OP_SQUARE;
+					return;
+				}
+			}
+			if (qiszero(q)) {
+				qfree(q);
+				fp->f_opcodes[count - 2] = OP_ZERO;
+				fp->f_opcodecount--;
+			} else if (qisone(q)) {
+				qfree(q);
+				fp->f_opcodes[count - 2] = OP_ONE;
+				fp->f_opcodecount--;
+			}
 		}
-		if (qcmpi(constvalue(fp->f_opcodes[fp->f_opcodecount - 1]), 4L) == 0) {
-			fp->f_opcodes[fp->f_opcodecount - 2] = OP_SQUARE;
-			fp->f_opcodes[fp->f_opcodecount - 1] = OP_SQUARE;
-			oldop = OP_SQUARE;
-			return;
-		}
-	}
-	if ((op == OP_POP) && (oldop == OP_ASSIGN)) {	/* optimize */
-		fp->f_opcodes[fp->f_opcodecount - 1] = OP_ASSIGNPOP;
-		oldop = OP_ASSIGNPOP;
-		return;
 	}
 	/*
 	 * No optimization possible, so store the opcode.
 	 */
 	fp->f_opcodes[fp->f_opcodecount] = op;
 	fp->f_opcodecount++;
+	oldoldop = oldop;
 	oldop = op;
 }
 
@@ -347,24 +624,7 @@ addop(long op)
 void
 addopone(long op, long arg)
 {
-	NUMBER *q;
-
-	switch (op) {
-	case OP_NUMBER:
-		q = constvalue(arg);
-		if (q == NULL)
-			break;
-		if (qiszero(q)) {
-			addop(OP_ZERO);
-			return;
-		}
-		if (qisone(q)) {
-			addop(OP_ONE);
-			return;
-		}
-		break;
-
-	case OP_DEBUG:
+	if (op == OP_DEBUG) {
 		if ((conf->traceflags & TRACE_NODEBUG) || (arg == debugline))
 			return;
 		debugline = arg;
@@ -372,7 +632,6 @@ addopone(long op, long arg)
 			curfunc->f_opcodes[curfunc->f_opcodecount - 1] = arg;
 			return;
 		}
-		break;
 	}
 	addop(op);
 	curfunc->f_opcodes[curfunc->f_opcodecount] = arg;
@@ -444,5 +703,3 @@ addoplabel(long op, LABEL *label)
 	addop(op);
 	uselabel(label);
 }
-
-/* END CODE */

align32.c

@@ -1,23 +1,34 @@
 /*
  * align32 - determine if 32 bit accesses must be aligned
  *
- * This file was written by:
+ * Copyright (C) 1999  Landon Curt Noll
  *
- *	 Landon Curt Noll  (chongo@toad.com)	chongo <was here> /\../\
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
  *
- * This code has been placed in the public domain.  Please do not
- * copyright this code.
+ * Calc 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 Lesser General
+ * Public License for more details.
  *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH  REGARD  TO
- * THIS  SOFTWARE,  INCLUDING  ALL IMPLIED WARRANTIES OF MER-
- * CHANTABILITY AND FITNESS.  IN NO EVENT SHALL  LANDON  CURT
- * NOLL  BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
- * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM  LOSS  OF
- * USE,  DATA  OR  PROFITS, WHETHER IN AN ACTION OF CONTRACT,
- * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR  IN
- * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: align32.c,v 29.1 1999/12/14 09:15:29 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/align32.c,v $
+ *
+ * Under source code control:	1995/11/23 05:18:06
+ * File existed as early as:	1995
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 #include <stdio.h>
 #include <signal.h>
 #include "longbits.h"
@@ -30,7 +41,7 @@
 static void buserr(void);	/* catch alignment errors */
 
 
-MAIN
+int
 main(void)
 {
 	char byte[2*sizeof(USB32)];	/* mis-alignment buffer */
@@ -58,7 +69,8 @@ main(void)
 	   '/', '/');
 
 #endif
-	exit(0);
+	/* exit(0); */
+	return 0;
 }
 
 
@@ -66,7 +78,7 @@ main(void)
  * buserr - catch an alignment error
  *
  * given:
- *      arg             to keep ANSI C happy
+ *	arg		to keep ANSI C happy
  */
 /*ARGSUSED*/
 static void

alloc.h

@@ -1,21 +1,46 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * alloc - storage allocation and storage debug macros
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: alloc.h,v 29.1 1999/12/14 09:15:29 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/alloc.h,v $
+ *
+ * Under source code control:	1990/02/15 01:48:29
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
 
-#if !defined(ALLOC_H)
-#define ALLOC_H
+#if !defined(__ALLOC_H__)
+#define __ALLOC_H__
+
 
 #include "have_malloc.h"
 #include "have_newstr.h"
 #include "have_string.h"
+#include "have_memmv.h"
 
 #ifdef HAVE_MALLOC_H
 # include <malloc.h>
 #else
-# if defined(__STDC__) && __STDC__ != 0
+#if defined(FORCE_STDC) || (defined(__STDC__) && __STDC__ != 0) || defined(__cplusplus)
    extern void *malloc();
    extern void *realloc();
    extern void free();
@@ -34,10 +59,10 @@
 # if defined(HAVE_NEWSTR)
 extern void *memcpy();
 extern void *memset();
-#  if defined(__STDC__) && __STDC__ != 0
+#if defined(FORCE_STDC) || (defined(__STDC__) && __STDC__ != 0) || defined(__cplusplus)
 extern size_t strlen();
 #  else
-extern long strlen();	/* should be size_t, but old systems don't have it */
+extern long strlen();
 #  endif
 # else /* HAVE_NEWSTR */
 extern void bcopy();
@@ -61,4 +86,14 @@ extern int strcmp();
 #define strchr(s, c) index(s, c)
 #endif /* HAVE_NEWSTR */
 
-#endif /* !ALLOC_H */
+#if !defined(HAVE_MEMMOVE)
+# undef CALC_SIZE_T
+#if defined(FORCE_STDC) || (defined(__STDC__) && __STDC__ != 0) || defined(__cplusplus)
+#  define CALC_SIZE_T size_t
+# else
+#  define CALC_SIZE_T long
+# endif
+extern void *memmove(void *s1, const void *s2, CALC_SIZE_T n);
+#endif
+
+#endif /* !__ALLOC_H__ */

assocfunc.c

@@ -1,8 +1,33 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * assocfunc - association table routines
  *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: assocfunc.c,v 29.1 1999/12/14 09:15:29 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/assocfunc.c,v $
+ *
+ * Under source code control:	1993/07/20 23:04:27
+ * File existed as early as:	1993
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * Association table routines.
  * An association table is a type of value which can be "indexed" by
  * one or more arbitrary values.  Each element in the table is thus an
@@ -11,13 +36,14 @@
  * quick access.
  */
 
+
 #include "value.h"
 
 
-#define	MINHASHSIZE	31	/* minimum size of hash tables */
-#define	GROWHASHSIZE	50	/* approximate growth for hash tables */
-#define	CHAINLENGTH	10	/* desired number of elements on a hash chain */
-#define	ELEMSIZE(n)	(sizeof(ASSOCELEM) + (sizeof(VALUE) * ((n) - 1)))
+#define MINHASHSIZE	31	/* minimum size of hash tables */
+#define GROWHASHSIZE	50	/* approximate growth for hash tables */
+#define CHAINLENGTH	10	/* desired number of elements on a hash chain */
+#define ELEMSIZE(n)	(sizeof(ASSOCELEM) + (sizeof(VALUE) * ((n) - 1)))
 
 
 static ASSOCELEM *elemindex(ASSOC *ap, long index);
@@ -47,8 +73,8 @@ associndex(ASSOC *ap, BOOL create, long dim, VALUE *indices)
 	QCKHASH hash;
 	int i;
 
-	if (dim <= 0) {
-		math_error("No dimensions for indexing association");
+	if (dim < 0) {
+		math_error("Negative dimension for indexing association");
 		/*NOTREACHED*/
 	}
 
@@ -57,7 +83,7 @@ associndex(ASSOC *ap, BOOL create, long dim, VALUE *indices)
 	 * so that we can first select the correct hash chain, and
 	 * also so we can quickly compare each element for a match.
 	 */
-	hash = (QCKHASH)0;
+	hash = FNV1_32_BASIS;
 	for (i = 0; i < dim; i++)
 		hash = hashvalue(&indices[i], hash);
 
@@ -80,6 +106,7 @@ associndex(ASSOC *ap, BOOL create, long dim, VALUE *indices)
 	 */
 	if (!create) {
 		val.v_type = V_NULL;
+		val.v_subtype = V_NOSUBTYPE;
 		return &val;
 	}
 
@@ -91,6 +118,7 @@ associndex(ASSOC *ap, BOOL create, long dim, VALUE *indices)
 	ep->e_dim = dim;
 	ep->e_hash = hash;
 	ep->e_value.v_type = V_NULL;
+	ep->e_value.v_subtype = V_NOSUBTYPE;
 	for (i = 0; i < dim; i++)
 		copyvalue(&indices[i], &ep->e_indices[i]);
 	ep->e_next = *listhead;
@@ -105,47 +133,62 @@ associndex(ASSOC *ap, BOOL create, long dim, VALUE *indices)
 
 /*
  * Search an association for the specified value starting at the
- * specified index.  Returns the element number (zero based) of the
- * found value, or -1 if the value was not found.
+ * specified index.  Returns 0 and stores index if value found,
+ * otherwise returns 1.
  */
-long
-assocsearch(ASSOC *ap, VALUE *vp, long index)
+int
+assocsearch(ASSOC *ap, VALUE *vp, long i, long j, ZVALUE *index)
 {
 	ASSOCELEM *ep;
 
-	if (index < 0)
-		index = 0;
-	while (TRUE) {
-		ep = elemindex(ap, index);
-		if (ep == NULL)
-			return -1;
-		if (!comparevalue(&ep->e_value, vp))
-			return index;
-		index++;
+	if (i < 0 || j > ap->a_count) {
+		math_error("This should not happen in assocsearch");
+		/*NOTREACHED*/
 	}
+	while (i < j) {
+		ep = elemindex(ap, i);
+		if (ep == NULL) {
+			math_error("This should not happen in assocsearch");
+			/*NOTREACHED*/
+		}
+		if (acceptvalue(&ep->e_value, vp)) {
+			utoz(i, index);
+			return 0;
+		}
+		i++;
+	}
+	return 1;
 }
 
 
 /*
  * Search an association backwards for the specified value starting at the
- * specified index.  Returns the element number (zero based) of the
- * found value, or -1 if the value was not found.
+ * specified index.  Returns 0 and stores the index if the value is
+ * found; otherwise returns 1.
  */
-long
-assocrsearch(ASSOC *ap, VALUE *vp, long index)
+int
+assocrsearch(ASSOC *ap, VALUE *vp, long i, long j, ZVALUE *index)
 {
 	ASSOCELEM *ep;
 
-	if (index >= ap->a_count)
-		index = ap->a_count - 1;
-	while (TRUE) {
-		ep = elemindex(ap, index);
-		if (ep == NULL)
-			return -1;
-		if (!comparevalue(&ep->e_value, vp))
-			return index;
-		index--;
+	if (i < 0 || j > ap->a_count) {
+		math_error("This should not happen in assocsearch");
+		/*NOTREACHED*/
 	}
+	j--;
+	while (j >= i) {
+		ep = elemindex(ap, j);
+		if (ep == NULL) {
+			math_error("This should not happen in assocsearch");
+			/*NOTREACHED*/
+		}
+		if (acceptvalue(&ep->e_value, vp)) {
+			utoz(j, index);
+			return 0;
+		}
+		j--;
+	}
+	return 1;
 }
 
 
@@ -200,6 +243,27 @@ assocfindex(ASSOC *ap, long index)
 }
 
 
+/*
+ * Returns the list of indices for an association element with specified
+ * double-bracket index.
+ */
+LIST *
+associndices(ASSOC *ap, long index)
+{
+	ASSOCELEM *ep;
+	LIST *lp;
+	int i;
+
+	ep = elemindex(ap, index);
+	if (ep == NULL)
+		return NULL;
+	lp = listalloc();
+	for (i = 0; i < ep->e_dim; i++)
+		insertlistlast(lp, &ep->e_indices[i]);
+	return lp;
+}
+
+
 /*
  * Compare two associations to see if they are identical.
  * Returns TRUE if they are different.
@@ -228,8 +292,7 @@ assoccmp(ASSOC *ap1, ASSOC *ap2)
 			hash = ep1->e_hash;
 			dim = ep1->e_dim;
 			for (ep2 = ap2->a_table[hash % size2]; ;
-				ep2 = ep2->e_next)
-			{
+				ep2 = ep2->e_next) {
 				if (ep2 == NULL)
 					return TRUE;
 				if (ep2->e_hash != hash)
@@ -266,8 +329,7 @@ assoccopy(ASSOC *oldap)
 
 	for (oldhi = 0; oldhi < oldap->a_size; oldhi++) {
 		for (oldep = oldap->a_table[oldhi]; oldep;
-			oldep = oldep->e_next)
-		{
+			oldep = oldep->e_next) {
 			ep = (ASSOCELEM *) malloc(ELEMSIZE(oldep->e_dim));
 			if (ep == NULL) {
 				math_error("Cannot allocate association element");
@@ -276,6 +338,7 @@ assoccopy(ASSOC *oldap)
 			ep->e_dim = oldep->e_dim;
 			ep->e_hash = oldep->e_hash;
 			ep->e_value.v_type = V_NULL;
+			ep->e_value.v_subtype = V_NOSUBTYPE;
 			for (i = 0; i < ep->e_dim; i++)
 				copyvalue(&oldep->e_indices[i], &ep->e_indices[i]);
 			copyvalue(&oldep->e_value, &ep->e_value);
@@ -431,8 +494,7 @@ assocprint(ASSOC *ap, long max_print)
 		((ap->a_count == 1) ? "" : "s"));
 
 	for (index = 0; ((index < max_print) && (index < ap->a_count));
-		index++)
-	{
+		index++) {
 		ep = elemindex(ap, index);
 		if (ep == NULL)
 			continue;
@@ -473,5 +535,3 @@ compareindices(VALUE *v1, VALUE *v2, long dim)
 
 	return TRUE;
 }
-
-/* END CODE */

blkcpy.h

@@ -0,0 +1,62 @@
+/*
+ * blkcpy - general values and related routines used by the calculator
+ *
+ * Copyright (C) 1999  Landon Curt Noll and Ernest Bowen
+ *
+ * Primary author:  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: blkcpy.h,v 29.1 1999/12/14 09:15:29 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/blkcpy.h,v $
+ *
+ * Under source code control:	1997/04/18 20:41:25
+ * File existed as early as:	1997
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+#if !defined(__BLKCPY_H__)
+#define __BLKCPY_H__
+
+/*
+ * the main copy gateway function
+ */
+extern int copystod(VALUE *, long, long, VALUE *, long);
+
+/*
+ * specific copy functions
+ */
+extern int copyblk2blk(BLOCK *, long, long, BLOCK *, long, BOOL);
+extern int copyblk2file(BLOCK *, long, long, FILEID, long);
+extern int copyblk2mat(BLOCK *, long, long, MATRIX *, long);
+extern int copyblk2num(BLOCK *, long, long, NUMBER *, long, NUMBER **);
+extern int copyblk2str(BLOCK *, long, long, STRING *, long);
+extern int copyfile2blk(FILEID, long, long, BLOCK *, long, BOOL);
+extern int copylist2list(LIST *, long, long, LIST *, long);
+extern int copylist2mat(LIST *, long, long, MATRIX *, long);
+extern int copymat2blk(MATRIX *, long, long, BLOCK *, long, BOOL);
+extern int copymat2list(MATRIX *, long, long, LIST *, long);
+extern int copymat2mat(MATRIX *, long, long, MATRIX *, long);
+extern int copynum2blk(NUMBER *, long, long, BLOCK *, long, BOOL);
+extern int copyostr2blk(char *, long, long, BLOCK *, long, BOOL);
+extern int copyostr2str(char *, long, long, STRING *, long);
+extern int copystr2blk(STRING *, long, long, BLOCK *, long, BOOL);
+extern int copystr2file(STRING *, long, long, FILEID, long);
+extern int copystr2str(STRING *, long, long, STRING *, long);
+
+#endif /* !__BLKCPY_H__ */

block.c

@@ -0,0 +1,747 @@
+/*
+ * block - fixed, dynamic, fifo and circular memory blocks
+ *
+ * Copyright (C) 1999  Landon Curt Noll and Ernest Bowen
+ *
+ * Primary author:  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: block.c,v 29.1 1999/12/14 09:15:29 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/block.c,v $
+ *
+ * Under source code control:	1997/02/27 00:29:40
+ * File existed as early as:	1997
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+#include <stdio.h>
+#include "value.h"
+#include "zmath.h"
+#include "config.h"
+#include "block.h"
+#include "nametype.h"
+#include "string.h"
+#include "calcerr.h"
+
+#define NBLOCKCHUNK 16
+
+static long nblockcount = 0;
+static long maxnblockcount = 0;
+static STRINGHEAD nblocknames;
+static NBLOCK **nblocks;
+
+
+/* forward declarations */
+static void blkchk(BLOCK*);
+
+
+/*
+ * blkalloc - allocate a block
+ *
+ * given:
+ *	len	- initial memory length of the block
+ *	type	- BLK_TYPE_XXX
+ *	chunk	- allocation chunk size
+ *
+ * returns:
+ *	pointer to a newly allocated BLOCK
+ */
+BLOCK *
+blkalloc(int len, int chunk)
+{
+	BLOCK *nblk;	/* new block allocated */
+
+	/*
+	 * firewall
+	 */
+	if (len < 0)
+		len = 0;
+	if (chunk <= 0)
+		chunk = BLK_CHUNKSIZE;
+
+	/*
+	 * allocate BLOCK
+	 */
+	nblk = (BLOCK *)malloc(sizeof(BLOCK));
+	if (nblk == NULL) {
+		math_error("cannot allocate block");
+		/*NOTREACHED*/
+	}
+
+	/*
+	 * initialize BLOCK
+	 */
+	nblk->blkchunk = chunk;
+	nblk->maxsize = ((len+chunk)/chunk)*chunk;
+	nblk->data = (USB8*)malloc(nblk->maxsize);
+	if (nblk->data == NULL) {
+		math_error("cannot allocate block data storage");
+		/*NOTREACHED*/
+	}
+	memset(nblk->data, 0, nblk->maxsize);
+	nblk->datalen = len;
+
+	/*
+	 * return BLOCK
+	 */
+	if (conf->calc_debug & CALCDBG_BLOCK) {
+		blkchk(nblk);
+	}
+	return nblk;
+}
+
+
+/*
+ * blk_free - free a block
+ *
+ * NOTE: THIS IS NOT THE CALC blktrunc() BUILTIN FUNCTION!!  This
+ * is what is called to free block storage.
+ *
+ * given:
+ *	blk	- the block to free
+ */
+void
+blk_free(BLOCK *blk)
+{
+	/* free if non-NULL */
+	if (blk != NULL) {
+
+		/* free data storage */
+		if (blk->data != NULL) {
+			free(blk->data);
+		}
+
+		/* free the block */
+		free(blk);
+	}
+	return;
+}
+
+
+/*
+ * blkchk - check the sanity of a block
+ *
+ * These checks should never fail if calc is working correctly.	 During
+ * debug time, we plan to call this function often.  Once we are satisfied,
+ * we will normally call this code only in a few places.
+ *
+ * If "calc_debug" has the bit corresponding to CALCDBG_BLOCK set, this
+ * function is called during execution of the following builtins:
+ *
+ *	alloc(), realloc(), free()
+ *
+ * given:
+ *	blk	- the BLOCK to check
+ *
+ * returns:
+ *	if all is ok, otherwise math_error() is called and this
+ *	function does not return
+ */
+static void
+blkchk(BLOCK *blk)
+{
+
+	/*
+	 * firewall - general sanity check
+	 */
+	if ((conf->calc_debug & CALCDBG_BLOCK) == 0) {
+		/* do nothing when debugging is disabled */
+		return;
+	}
+	if (blk == NULL) {
+		math_error("internal: blk ptr is NULL");
+		/*NOTREACHED*/
+	}
+
+	/*
+	 * pointers must not be NULL
+	 */
+	if (blk->data == NULL) {
+		math_error("internal: blk->data ptr is NULL");
+		/*NOTREACHED*/
+	}
+
+	/*
+	 * check data lengths
+	 */
+	if (blk->datalen < 0) {
+		math_error("internal: blk->datalen < 0");
+		/*NOTREACHED*/
+	}
+
+	/*
+	 * check the datalen and datalen2 values
+	 */
+	if (blk->datalen < 0) {
+		math_error("internal: blk->datalen < 0");
+		/*NOTREACHED*/
+	}
+	return;
+}
+
+
+/*
+ * blkrealloc - reallocate a block
+ *
+ * Reallocation of a block can change several aspects of a block.
+ *
+ *	It can change the much data it holds or can hold.
+ *
+ *	It can change the memory footprint (in terms of
+ *	how much storage is malloced for current or future use).
+ *
+ *	It can change the chunk size used to grow malloced size
+ *	as the data size grows.
+ *
+ * Each of the len and chunksize may be kept the same.
+ *
+ * given:
+ *	blk	- old BLOCK to reallocate
+ *	newlen	- how much data the block holds
+ *	newchunk - allocation chunk size (<0 ==> no change, 0 == default)
+ */
+BLOCK *
+blkrealloc(BLOCK *blk, int newlen, int newchunk)
+{
+	USB8 *nblk;	/* realloced storage */
+	int newmax;	/* new maximum stoage size */
+
+	/*
+	 * firewall
+	 */
+	if (conf->calc_debug & CALCDBG_BLOCK) {
+		blkchk(blk);
+	}
+
+	/*
+	 * process args
+	 */
+	/* newlen < 0 means do not change the length */
+	if (newlen < 0) {
+		newlen = blk->datalen;
+	}
+	/* newchunk <= 0 means do not change the chunk size */
+	if (newchunk < 0) {
+		newchunk = blk->blkchunk;
+	} else if (newchunk == 0) {
+		newchunk = BLK_CHUNKSIZE;
+	}
+
+	/*
+	 * reallocate storage if we have a different allocation size
+	 */
+	newmax = ((newlen+newchunk)/newchunk)*newchunk;
+	if (newmax != blk->maxsize) {
+
+		/* reallocate new storage */
+		nblk = (USB8*)realloc(blk->data, newmax);
+		if (nblk == NULL) {
+			math_error("cannot reallocate block storage");
+			/*NOTREACHED*/
+		}
+
+		/* clear any new storage */
+		if (newmax > blk->maxsize) {
+			memset(nblk+blk->maxsize, 0, (newmax-blk->maxsize));
+		}
+		blk->maxsize = newmax;
+
+		/* restore the data pointers */
+		blk->data = nblk;
+	}
+
+	/*
+	 * deal the case of a newlen == 0 early and return
+	 */
+	if (newlen == 0) {
+
+		/*
+		 * setup the empty buffer
+		 *
+		 * We know that newtype is not circular since we force
+		 * newlen to be at least 1 (because circular blocks
+		 * always have at least one unused octet).
+		 */
+		if (blk->datalen < blk->maxsize) {
+			memset(blk->data, 0, blk->datalen);
+		} else {
+			memset(blk->data, 0, blk->maxsize);
+		}
+		blk->datalen = 0;
+		if (conf->calc_debug & CALCDBG_BLOCK) {
+			blkchk(blk);
+		}
+		return blk;
+	}
+
+	/*
+	 * Set the data length
+	 *
+	 * We also know that the new block is not empty since we have
+	 * already dealth with that case above.
+	 *
+	 * After this section of code, limit and datalen will be
+	 * correct in terms of the new type.
+	 */
+	if (newlen > blk->datalen) {
+
+		/* there is new storage, clear it */
+		memset(blk->data + blk->datalen, 0, newlen-blk->datalen);
+		/* growing storage for blocks grows the data */
+		blk->datalen = newlen;
+
+	} else if (newlen <= blk->datalen) {
+
+		/* the block will be full */
+		blk->datalen = newlen;
+	}
+
+	/*
+	 * return realloced type
+	 */
+	if (conf->calc_debug & CALCDBG_BLOCK) {
+		blkchk(blk);
+	}
+	return blk;
+}
+
+
+/*
+ * blktrunc - truncate a BLOCK down to a minimal fixed block
+ *
+ * NOTE: THIS IS NOT THE INTERNAL CALC FREE FUNCTION!!	This
+ * is what blktrunc() builtin calls to reduce storage of a block
+ * down to an absolute minimum.
+ *
+ * This actually forms a zero length fixed block with a chunk of 1.
+ *
+ * given:
+ *	blk	- the BLOCK to shrink
+ *
+ * returns:
+ *	pointer to a newly allocated BLOCK
+ */
+void
+blktrunc(BLOCK *blk)
+{
+	/*
+	 * firewall
+	 */
+	if (conf->calc_debug & CALCDBG_BLOCK) {
+		blkchk(blk);
+	}
+
+	/*
+	 * free the old storage
+	 */
+	free(blk->data);
+
+	/*
+	 * setup as a zero length fixed block
+	 */
+	blk->blkchunk = 1;
+	blk->maxsize = 1;
+	blk->datalen = 0;
+	blk->data = (USB8*)malloc(1);
+	if (blk->data == NULL) {
+		math_error("cannot allocate truncated block storage");
+		/*NOTREACHED*/
+	}
+	blk->data[0] = (USB8)0;
+	if (conf->calc_debug & CALCDBG_BLOCK) {
+		blkchk(blk);
+	}
+	return;
+}
+
+
+/*
+ * blk_copy - copy a block
+ *
+ * given:
+ *	blk	- the block to copy
+ *
+ * returns:
+ *	pointer to copy of blk
+ */
+BLOCK *
+blk_copy(BLOCK *blk)
+{
+	BLOCK *nblk;		/* copy of blk */
+
+	/*
+	 * malloc new block
+	 */
+	nblk = (BLOCK *)malloc(sizeof(BLOCK));
+	if (nblk == NULL) {
+		math_error("blk_copy: cannot malloc BLOCK");
+		/*NOTREACHED*/
+	}
+
+	/*
+	 * duplicate most of the block
+	 */
+	*nblk = *blk;
+
+	/*
+	 * duplicate block data
+	 */
+	nblk->data = (USB8 *)malloc(blk->maxsize);
+	if (nblk->data == NULL) {
+		math_error("blk_copy: cannot duplicate block data");
+		/*NOTREACHED*/
+	}
+	memcpy(nblk->data, blk->data, blk->maxsize);
+	return nblk;
+}
+
+
+/*
+ * blk_cmp - compare blocks
+ *
+ * given:
+ *	a	first BLOCK
+ *	b	second BLOCK
+ *
+ * returns:
+ *	TRUE => BLOCKs are different
+ *	FALSE => BLOCKs are the same
+ */
+int
+blk_cmp(BLOCK *a, BLOCK *b)
+{
+	/*
+	 * firewall and quick check
+	 */
+	if (a == b) {
+		/* pointers to the same object */
+		return FALSE;
+	}
+	if (a == NULL || b == NULL) {
+		/* one pointer is NULL, so they differ */
+		return TRUE;
+	}
+
+	/*
+	 * compare lengths
+	 */
+	if (a->datalen != b->datalen) {
+		/* different lengths are different */
+		return TRUE;
+	}
+
+	/*
+	 * compare the section
+	 *
+	 * We have the same lengths and types, so compare the data sections.
+	 */
+	if (memcmp(a->data, b->data, a->datalen) != 0) {
+		/* different sections are different */
+		return TRUE;
+	}
+
+	/*
+	 * the blocks are the same
+	 */
+	return FALSE;
+}
+
+
+/*
+ * Print chunksize, maxsize, datalen on line line and if datalen > 0,
+ * up to * 30 octets on the following line, with ... if datalen exceeds 30.
+ */
+/*ARGSUSED*/
+void
+blk_print(BLOCK *blk)
+{
+	long i;
+	BOOL havetail;
+	USB8 *ptr;
+
+	/* XXX - should use the config parameters for better print control */
+
+	printf("chunksize = %d, maxsize = %d, datalen = %d\n\t",
+		(int)blk->blkchunk, (int)blk->maxsize, (int)blk->datalen);
+	i = blk->datalen;
+	havetail = (i > 30);
+	if (havetail)
+		i = 30;
+	ptr = blk->data;
+	while (i-- > 0)
+		printf("%02x", *ptr++);
+	if (havetail)
+		printf("...");
+}
+
+
+/*
+ * Routine to print id and name of a named block and details of its
+ * block component.
+ */
+void
+nblock_print(NBLOCK *nblk)
+{
+	BLOCK *blk;
+
+	/* XXX - use the config parameters for better print control */
+
+	blk = nblk->blk;
+	printf("block %d: %s\n\t", nblk->id, nblk->name);
+	if (blk->data == NULL) {
+		printf("chunksize = %d, maxsize = %d, datalen = %d\n\t",
+		(int)blk->blkchunk, (int)blk->maxsize, (int)blk->datalen);
+		printf("NULL");
+	} else {
+		blk_print(blk);
+	}
+}
+
+
+/*
+ * realloc a named block specified by its id.  The new datalen and
+ * chunksize are specified by len >= 0 and chunk > 0.  If len < 0
+ * or chunk <= 0, these values used are the current datalen and
+ * chunksize, so there is no point in calling this unless len >= 0
+ * and/or chunk > 0.
+ * No reallocation occurs if the new maxsize is equal to the old maxsize.
+ */
+NBLOCK *
+reallocnblock(int id, int len, int chunk)
+{
+	BLOCK *blk;
+	int newsize;
+	int oldsize;
+	USB8* newdata;
+
+	/* Fire wall */
+	if (id < 0 || id >= nblockcount) {
+		math_error("Bad id in call to reallocnblock");
+		/*NOTREACHED*/
+	}
+
+	blk = nblocks[id]->blk;
+	if (len < 0)
+		len = blk->datalen;
+	if (chunk < 0)
+		chunk = blk->blkchunk;
+	else if (chunk == 0)
+		chunk = BLK_CHUNKSIZE;
+	newsize = (1 + len/chunk) * chunk;
+	oldsize = blk->maxsize;
+	newdata = blk->data;
+	if (newdata == NULL) {
+		newdata = malloc(newsize);
+		if (newdata == NULL) {
+			math_error("Allocation failed");
+			/*NOTREACHED*/
+		}
+	} else if (newsize != oldsize) {
+		newdata = realloc(blk->data, newsize);
+		if (newdata == NULL) {
+			math_error("Reallocation failed");
+			/*NOTREACHED*/
+		}
+	}
+	memset(newdata + len, 0, newsize - len);
+
+	blk->maxsize = newsize;
+	blk->datalen = len;
+	blk->blkchunk = chunk;
+	blk->data = newdata;
+	return nblocks[id];
+}
+
+
+/*
+ * Create and return a new namedblock with specified name, len and
+ * chunksize.
+ */
+NBLOCK *
+createnblock(char *name, int len, int chunk)
+{
+	NBLOCK *res;
+	char *newname;
+
+	if (nblockcount >= maxnblockcount) {
+		if (maxnblockcount <= 0) {
+			maxnblockcount = NBLOCKCHUNK;
+			nblocks = (NBLOCK **)malloc(NBLOCKCHUNK *
+						    sizeof(NBLOCK *));
+			if (nblocks == NULL) {
+				maxnblockcount = 0;
+				math_error("unable to malloc new named blocks");
+				/*NOTREACHED*/
+			}
+		} else {
+			maxnblockcount += NBLOCKCHUNK;
+			nblocks = (NBLOCK **)realloc(nblocks, maxnblockcount *
+						     sizeof(NBLOCK *));
+			if (nblocks == NULL) {
+				maxnblockcount = 0;
+				math_error("cannot malloc more named blocks");
+				/*NOTREACHED*/
+			}
+		}
+	}
+	if (nblockcount == 0)
+		initstr(&nblocknames);
+	if (findstr(&nblocknames, name) >= 0) {
+		math_error("Named block already exists!!!");
+		/*NOTREACHED*/
+	}
+	newname = addstr(&nblocknames, name);
+	if (newname == NULL) {
+		math_error("Block name allocation failed");
+		/*NOTREACHED*/
+	}
+
+	res = (NBLOCK *) malloc(sizeof(NBLOCK));
+	if (res == NULL) {
+		math_error("Named block allocation failed");
+		/*NOTREACHED*/
+	}
+
+	nblocks[nblockcount] = res;
+	res->name = newname;
+	res->subtype = V_NOSUBTYPE;
+	res->id = nblockcount++;
+	res->blk = blkalloc(len, chunk);
+	return res;
+}
+
+
+/*
+ * find a named block
+ */
+int
+findnblockid(char * name)
+{
+	return findstr(&nblocknames, name);
+}
+
+
+/*
+ * free data block for named block with specified id
+ */
+int
+removenblock(int id)
+{
+	NBLOCK *nblk;
+
+	if (id < 0 || id >= nblockcount)
+		return E_BLKFREE3;
+	nblk = nblocks[id];
+	if (nblk->blk->data == NULL)
+		return 0;
+	if (nblk->subtype & V_NOREALLOC)
+		return E_BLKFREE5;
+	free(nblk->blk->data);
+	nblk->blk->data = NULL;
+	nblk->blk->maxsize = 0;
+	nblk->blk->datalen = 0;
+	return 0;
+}
+
+
+/*
+ * count number of current unfreed named blocks
+ */
+int
+countnblocks(void)
+{
+	int n;
+	int id;
+
+	for (n = 0, id = 0; id < nblockcount; id++) {
+		if (nblocks[id]->blk->data != NULL)
+			n++;
+	}
+	return n;
+}
+
+
+/*
+ * display id and name for each unfreed named block
+ */
+void
+shownblocks(void)
+{
+	int id;
+
+	if (countnblocks() == 0) {
+		printf("No unfreed named blocks\n\n");
+		return;
+	}
+	printf(" id   name\n");
+	printf("----  -----\n");
+	for (id = 0; id < nblockcount; id++) {
+		if (nblocks[id]->blk->data != NULL)
+			printf("%3d   %s\n", id, nblocks[id]->name);
+	}
+	printf("\n");
+}
+
+
+/*
+ * Return pointer to nblock with specified id, NULL if never created.
+ * The memory for the nblock found may have been freed.
+ */
+NBLOCK *
+findnblock(int id)
+{
+	if (id < 0 || id >= nblockcount)
+		return NULL;
+	return nblocks[id];
+}
+
+
+/*
+ * Create a new block with specified newlen and new chunksize and copy
+ * min(newlen, oldlen) octets to the new block.	 The old block is
+ * not changed.
+ */
+BLOCK *
+copyrealloc(BLOCK *blk, int newlen, int newchunk)
+{
+	BLOCK * newblk;
+	int oldlen;
+
+	oldlen = blk->datalen;
+
+	if (newlen < 0)			/* retain length */
+		newlen = oldlen;
+
+	if (newchunk < 0)		/* retain chunksize */
+		newchunk = blk->blkchunk;
+	else if (newchunk == 0)		/* use default chunksize */
+		newchunk = BLK_CHUNKSIZE;
+
+
+	newblk = blkalloc(newlen, newchunk);
+
+	if (newlen < oldlen)
+		oldlen = newlen;
+
+	if (newlen > 0)
+		memcpy(newblk->data, blk->data, oldlen);
+
+	return newblk;
+}

block.h

@@ -0,0 +1,225 @@
+/*
+ * block - fixed, dynamic, fifo and circular memory blocks
+ *
+ * Copyright (C) 1999  Landon Curt Noll and Ernest Bowen
+ *
+ * Primary author:  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: block.h,v 29.1 1999/12/14 09:15:30 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/block.h,v $
+ *
+ * Under source code control:	1997/02/21 05:03:39
+ * File existed as early as:	1997
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+#if !defined(__BLOCK_H__)
+#define __BLOCK_H__
+
+
+/*
+ * block - the basic block structure
+ *
+ * A block comes is one of several types.  At the moment, only fixed
+ * types are defined.
+ *
+ ***
+ *
+ * Block functions and operations:
+ *
+ *	x[i]
+ *		(i-1)th octet
+ *
+ *	blk(len [, blkchunk])
+ *		unnamed block
+ *		len > 0
+ *		blkchunk defaults to BLK_CHUNKSIZE
+ *
+ *	blk(name, [len [, blkchunk]])
+ *		named block
+ *		len > 0
+ *		blkchunk defaults to BLK_CHUNKSIZE
+ *
+ *	blkfree(x)
+ *		Reduce storage down to 0 octetes.
+ *
+ *	size(x)
+ *		The length of data stored in the block.
+ *
+ *	sizeof(x) == blk->maxsize
+ *		Allocation size in memory
+ *
+ *	isblk(x)
+ *		returns 0 is x is not a BLOCK, 1 if x is an
+ *		unnamed block, 2 if x is a named BLOCK
+ *
+ *	blkread(x, size, count, fd [, offset])
+ *	blkwrite(x, size, count, fd [, offset])
+ *		returns number of items written
+ *		offset is restricted in value by block type
+ *
+ *	blkset(x, val, length [, offset])
+ *		only the lower octet of val is used
+ *		offset is restricted in value by block type
+ *
+ *	blkchr(x, val, length [, offset])
+ *		only the lower octet of val is used
+ *		offset is restricted in value by block type
+ *
+ *	blkcpy(dest, src, length [, dest_offset [, src_offset]])
+ *		0 <= length <= blksize(x)
+ *		offset's are restricted in value by block type
+ *		dest may not == src
+ *
+ *	blkmove(dest, src, length [, dest_offset [, src_offset]])
+ *		0 <= length <= blksize(x)
+ *		offset's are restricted in value by block type
+ *		overlapping moves are handeled correctly
+ *
+ *	blkccpy(dest, src, stopval, length [, dest_offset [, src_offset]])
+ *		0 <= length <= blksize(x)
+ *		offset's are restricted in value by block type
+ *
+ *	blkcmp(dest, src, length [, dest_offset [, src_offset]])
+ *		0 <= length <= blksize(x)
+ *		offset's are restricted in value by block type
+ *
+ *	blkswap(x, a, b)
+ *		swaps groups of 'a' octets within each 'b' octets
+ *		b == a is a noop
+ *		b = a*k for some integer k >= 1
+ *
+ *	scatter(src, dest1, dest2 [, dest3 ] ...)
+ *		copy sucessive octets from src into dest1, dest2, ...
+ *		    restarting with dest1 after end of list
+ *		stops at end of src
+ *
+ *	gather(dest, src1, src2 [, src3 ] ...)
+ *		copy first octet from src1, src2, ...
+ *		copy next octet from src1, src2, ...
+ *		...
+ *		copy last octet from src1, src2, ...
+ *		copy 0 when there is no more data from a given source
+ *
+ *	blkseek(x, offset, {"in","out"})
+ *		some seeks may not be allowed by block type
+ *
+ *	config("blkmaxprint", count)
+ *		number of octets of a block to print, 0 means all
+ *
+ *	config("blkverbose", boolean)
+ *		TRUE => print all lines, FALSE => skip dup lines
+ *
+ *	config("blkbase", "base")
+ *		output block base = { "hex", "octal", "char", "binary", "raw" }
+ *		    binary is base 2, raw is just octet values
+ *
+ *	config("blkfmt", "style")
+ *		style of output = {
+ *		    "line",	lines in blkbase with no spaces between octets
+ *		    "string",	as one long line with no spaces between octets
+ *		    "od_style", position, spaces between octets
+ *		    "hd_style"} position, spaces between octets, chars on end
+ */
+struct block {
+	LEN blkchunk;	/* allocation chunk size */
+	LEN maxsize;	/* octets actually malloced for this block */
+	LEN datalen;	/* octets of data held this block */
+	USB8 *data;	/* pointer to the 1st octet of the allocated data */
+};
+typedef struct block BLOCK;
+
+
+struct nblock {
+	char *name;
+	int subtype;
+	int id;
+	BLOCK *blk;
+};
+typedef struct nblock NBLOCK;
+
+
+/*
+ * block debug
+ */
+extern int blk_debug;	/* 0 => debug off */
+
+
+/*
+ * block defaults
+ */
+#define BLK_CHUNKSIZE 256	/* default allocation chunk size for blocks */
+
+#define BLK_DEF_MAXPRINT 256	/* default octets to print */
+
+#define BLK_BASE_HEX 0		/* output octets in a block in hex */
+#define BLK_BASE_OCT 1		/* output octets in a block in octal */
+#define BLK_BASE_CHAR 2		/* output octets in a block in characters */
+#define BLK_BASE_BINARY 3	/* output octets in a block in base 2 chars */
+#define BLK_BASE_RAW 4		/* output octets in a block in raw binary */
+
+#define BLK_FMT_HD_STYLE 0	/* output in base with chars on end of line */
+#define BLK_FMT_LINE 1		/* output is lines of up to 79 chars */
+#define BLK_FMT_STRING 2	/* output is one long string */
+#define BLK_FMT_OD_STYLE 3	/* output in base with chars */
+
+
+/*
+ * block macros
+ */
+/* length of data stored in a block */
+#define blklen(blk) ((blk)->datalen)
+
+/* block footpint in memory */
+#define blksizeof(blk) ((blk)->maxsize)
+
+/* block allocation chunk size */
+#define blkchunk(blk) ((blk)->blkchunk)
+
+
+/*
+ * OCTET - what the INDEXADDR produces from a blk[offset]
+ */
+typedef USB8 OCTET;
+
+
+/*
+ * external functions
+ */
+extern BLOCK *blkalloc(int, int);
+extern void blk_free(BLOCK*);
+extern BLOCK *blkrealloc(BLOCK*, int, int);
+extern void blktrunc(BLOCK*);
+extern BLOCK *blk_copy(BLOCK*);
+extern int blk_cmp(BLOCK*, BLOCK*);
+extern void blk_print(BLOCK*);
+extern void nblock_print(NBLOCK *);
+extern NBLOCK *createnblock(char *, int, int);
+extern NBLOCK *reallocnblock(int, int, int);
+extern int removenblock(int);
+extern int findnblockid(char *);
+extern NBLOCK *findnblock(int);
+extern BLOCK *copyrealloc(BLOCK*, int, int);
+extern int countnblocks(void);
+extern void shownblocks(void);
+
+
+#endif /* !__BLOCK_H__ */

byteswap.c

@@ -1,25 +1,34 @@
 /*
- * Copyright (c) 1995 by Landon Curt Noll.  All Rights Reserved.
+ * byteswap - byte swapping routines
  *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice and text
- * this comment, and the disclaimer below appear in all of the following:
+ * Copyright (C) 1999  Landon Curt Noll
  *
- *	supporting documentation
- *	source copies
- *	source works derived from this source
- *	binaries derived from this source or from derived source
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
  *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: byteswap.c,v 29.1 1999/12/14 09:15:30 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/byteswap.c,v $
+ *
+ * Under source code control:	1995/10/11 04:44:01
+ * File existed as early as:	1995
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 #include "cmath.h"
 #include "byteswap.h"
 
@@ -28,9 +37,9 @@
  * swap_b8_in_HALFs - swap 8 and if needed, 16 bits in an array of HALFs
  *
  * given:
- *      dest    - pointer to where the swapped src wil be put or
+ *	dest	- pointer to where the swapped src wil be put or
  *		  NULL to allocate the storage
- *	src     - pointer to a HALF array to swap
+ *	src	- pointer to a HALF array to swap
  *	len	- length of the src HALF array
  *
  * returns:
@@ -39,6 +48,7 @@
 HALF *
 swap_b8_in_HALFs(HALF *dest, HALF *src, LEN len)
 {
+	HALF *ret;
 	LEN i;
 
 	/*
@@ -47,6 +57,7 @@ swap_b8_in_HALFs(HALF *dest, HALF *src, LEN len)
 	if (dest == NULL) {
 		dest = alloc(len);
 	}
+	ret = dest;
 
 	/*
 	 * swap the array
@@ -58,7 +69,7 @@ swap_b8_in_HALFs(HALF *dest, HALF *src, LEN len)
 	/*
 	 * return the result
 	 */
-	return dest;
+	return ret;
 }
 
 
@@ -261,9 +272,9 @@ swap_b8_in_COMPLEX(COMPLEX *dest, COMPLEX *src, BOOL all)
  * swap_b16_in_HALFs - swap 16 bits in an array of HALFs
  *
  * given:
- *      dest    - pointer to where the swapped src wil be put or
+ *	dest	- pointer to where the swapped src wil be put or
  *		  NULL to allocate the storage
- *	src     - pointer to a HALF array to swap
+ *	src	- pointer to a HALF array to swap
  *	len	- length of the src HALF array
  *
  * returns:
@@ -272,6 +283,7 @@ swap_b8_in_COMPLEX(COMPLEX *dest, COMPLEX *src, BOOL all)
 HALF *
 swap_b16_in_HALFs(HALF *dest, HALF *src, LEN len)
 {
+	HALF *ret;
 	LEN i;
 
 	/*
@@ -280,6 +292,7 @@ swap_b16_in_HALFs(HALF *dest, HALF *src, LEN len)
 	if (dest == NULL) {
 		dest = alloc(len);
 	}
+	ret = dest;
 
 	/*
 	 * swap the array
@@ -291,7 +304,7 @@ swap_b16_in_HALFs(HALF *dest, HALF *src, LEN len)
 	/*
 	 * return the result
 	 */
-	return dest;
+	return ret;
 }
 
 

byteswap.h

@@ -1,27 +1,37 @@
 /*
- * Copyright (c) 1995 by Landon Curt Noll.  All Rights Reserved.
+ * byteswap - byte swapping macros
  *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice and text
- * this comment, and the disclaimer below appear in all of the following:
+ * Copyright (C) 1999  Landon Curt Noll
  *
- *	supporting documentation
- *	source copies
- *	source works derived from this source
- *	binaries derived from this source or from derived source
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
  *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: byteswap.h,v 29.1 1999/12/14 09:15:30 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/byteswap.h,v $
+ *
+ * Under source code control:	1995/10/11 04:44:01
+ * File existed as early as:	1995
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
-#if !defined(BYTESWAP_H)
-#define BYTESWAP_H
+
+#if !defined(__BYTESWAP_H__)
+#define __BYTESWAP_H__
+
 
 #include "longbits.h"
 
@@ -163,4 +173,5 @@
 
 #endif /* LONG_BITS == 64 */
 
-#endif /* !BYTESWAP_H */
+
+#endif /* !__BYTESWAP_H__ */

cal/Makefile

@@ -0,0 +1,149 @@
+#!/bin/make
+#
+# cal - makefile for calc standard resource files
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: Makefile,v 29.1 1999/12/14 09:15:30 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/Makefile,v $
+#
+# Under source code control:	1991/07/21 05:00:54
+# File existed as early as:	1991
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+#
+# calculator by David I. Bell with help/mods from others
+# Makefile by Landon Curt Noll
+
+# required vars
+#
+SHELL = /bin/sh
+MAKE_FILE = Makefile
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# where to install things
+TOPDIR= /usr/local/lib
+#TOPDIR= /usr/lib
+#TOPDIR= /usr/libdata
+
+LIBDIR= ${TOPDIR}/calc
+
+# Makefile debug
+#
+# Q=@	do not echo internal makefile actions (quiet mode)
+# Q=	echo internal makefile actions (debug / verbose mode)
+#
+#Q=
+Q=@
+
+# standard tools
+#
+CHMOD= chmod
+
+# The calc files to install
+#
+CALC_FILES= README bigprime.cal deg.cal ellip.cal lucas.cal lucas_chk.cal \
+	lucas_tbl.cal mersenne.cal mod.cal pell.cal pi.cal pix.cal \
+	pollard.cal poly.cal psqrt.cal quat.cal regress.cal solve.cal \
+	sumsq.cal surd.cal unitfrac.cal varargs.cal chrem.cal mfactor.cal \
+	bindings randmprime.cal test1700.cal randrun.cal \
+	randbitrun.cal bernoulli.cal test2300.cal test2600.cal \
+	test2700.cal test3100.cal test3300.cal test3400.cal prompt.cal \
+	test3500.cal seedrandom.cal test4000.cal test4100.cal test4600.cal \
+	beer.cal hello.cal test5100.cal test5200.cal randombitrun.cal \
+	randomrun.cal xx_print.cal natnumset.cal qtime.cal test8400.cal \
+	test8500.cal
+
+# These files are found (but not built) in the distribution
+#
+DISTLIST= ${CALC_FILES} ${MAKE_FILE}
+
+# These files are used to make (but not built) a calc .a link library
+#
+CALCLIBLIST=
+
+all: ${CALC_FILES} ${MAKE_FILE} .all
+
+# used by the upper level Makefile to determine of we have done all
+#
+.all:
+	rm -f .all
+	touch .all
+
+##
+#
+# File list generation.	 You can ignore this section.
+#
+#
+# We will form the names of source files as if they were in a
+# sub-directory called calc/cal.
+#
+# NOTE: Due to bogus shells found on one common system we must have
+#	an non-emoty else clause for every if condition.  *sigh*
+#
+##
+
+distlist: ${DISTLIST}
+	${Q}for i in ${DISTLIST}; do \
+		echo cal/$$i; \
+	done
+
+distdir:
+	${Q}echo cal
+
+calcliblist:
+	${Q}for i in ${CALCLIBLIST} /dev/null; do \
+	    if [ X"$$i" != X"/dev/null" ]; then \
+		echo cal/$$i; \
+	    fi; \
+	done
+
+clean:
+
+clobber:
+	rm -f .all
+
+install: all
+	-${Q}if [ ! -d ${TOPDIR} ]; then \
+		echo mkdir ${TOPDIR}; \
+		mkdir ${TOPDIR}; \
+	else \
+	    true; \
+	fi
+	-${Q}if [ ! -d ${LIBDIR} ]; then \
+		echo mkdir ${LIBDIR}; \
+		mkdir ${LIBDIR}; \
+	else \
+	    true; \
+	fi
+	${Q}for i in ${CALC_FILES}; do \
+		echo rm -f ${LIBDIR}/$$i; \
+		rm -f ${LIBDIR}/$$i; \
+		echo cp $$i ${LIBDIR}; \
+		cp $$i ${LIBDIR}; \
+		echo ${CHMOD} 0444 ${LIBDIR}/$$i; \
+		${CHMOD} 0444 ${LIBDIR}/$$i; \
+	done
+	${Q}echo remove files that are obsolete
+	-rm -f nextprime.cal nextprim.cal
+	-rm -f test1000.cal test2000.cal ${LIBDIR}/test2000.cal
+	-rm -f ${LIBDIR}/nextprime.cal ${LIBDIR}/nextprim.cal
+	-rm -f ${LIBDIR}/test1000.cal ${LIBDIR}/cryrand.cal

cal/README

@@ -0,0 +1,733 @@
+Calc standard resource files
+----------------------------
+
+To load a reosurce file, try:
+
+    read filename
+
+You do not need to add the .cal extension to the filename.  Calc
+will search along the $CALCPATH (see ``help environment'').
+
+Normally a resource file will simply define some functions.  By default,
+most resource files will print out a short message when they are read.
+For example:
+
+    > read lucas
+    lucas(h,n) defined
+    gen_u0(h,n,v1) defined
+    gen_v1(h,n) defined
+    ldebug(funct,str) defined
+
+will cause calc to load and execute the 'lucas.cal' resource file.
+Executing the resource file will cause several functions to be defined.
+Executing the lucas function:
+
+    > lucas(149,60)
+	    1
+    > lucas(146,61)
+	    0
+
+shows that 149*2^60-1 is prime whereas 146*2^61-1 is not.
+
+=-=
+
+Calc resource file files are provided because they serve as examples of
+how use the calc language, and/or because the authors thought them to
+be useful!
+
+If you write something that you think is useful, please send it to:
+
+    calc-tester at postofc dot corp dot sgi dot com
+
+    [[ Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+
+By convention, a resource file only defines and/or initializes functions,
+objects and variables.	(The regress.cal and testxxx.cal regression test
+suite is an exception.)	 Also by convention, an additional usage message
+regarding important object and functions is printed.
+
+If a resource file needs to load another resource file, it should use
+the -once version of read:
+
+    /* pull in needed resource files */
+    read -once "surd"
+    read -once "lucas"
+
+This will cause the needed resource files to be read once.  If these
+files have already been read, the read -once will act as a noop.
+
+The "resource_debug" parameter is intended for controlling the possible
+display of special information relating to functions, objects, and
+other structures created by instructions in calc resoure files.
+Zero value of config("resource_debug") means that no such information
+is displayed.  For other values, the non-zero bits which currently
+have meanings are as follows:
+
+    n	    Meaning of bit n of config("resource_debug")
+
+    0	When a function is defined, redefined or undefined at
+	interactive level, a message saying what has been done
+	is displayed.
+
+    1	When a function is defined, redefined or undefined during
+	the reading of a file, a message saying what has been done
+	is displayed.
+
+The value for config("resource_debug") in both oldstd and newstd is 3,
+but if calc is invoked with the -d flag, its initial value is zero.
+Thus, if calc is started without the -d flag, until config("resource_debug")
+is changed, a message will be output when a function is defined
+either interactively or during the reading of a file.
+
+Sometimes the information printed is not enough.  In addition to the
+standard information, one might want to print:
+
+	* useful obj definitions
+	* functions with optional args
+	* functions with optional args where the param() interface is used
+
+For these cases we suggest that you place at the bottom of your code
+something that prints extra information if config("resource_debug") has
+either of the bottom 2 bits set:
+
+	if (config("resource_debug") & 3) {
+		print "obj xyz defined";
+		print "funcA([val1 [, val2]]) defined";
+		print "funcB(size, mass, ...) defined";
+	}
+
+=-=
+
+The following is a brief description of some of the calc resource files
+that are shipped with calc.  See above for example of how to read in
+and execute these files.
+
+beer.cal
+
+    Calc's contribution to the 99 Bottles of Beer web page:
+
+	http://www.ionet.net/~timtroyr/funhouse/beer.html#calc
+
+
+bernoulli.cal
+
+    B(n)
+
+    Calculate the nth Bernoulli number.
+
+
+bigprime.cal
+
+    bigprime(a, m, p)
+
+    A prime test, base a, on p*2^x+1 for even x>m.
+
+
+chrem.cal
+
+    chrem(r1,m1 [,r2,m2, ...])
+    chrem(rlist, mlist)
+
+    Chinese remainder theorem/problem solver.
+
+
+deg.cal
+
+    dms(deg, min, sec)
+    dms_add(a, b)
+    dms_neg(a)
+    dms_sub(a, b)
+    dms_mul(a, b)
+    dms_print(a)
+
+    Calculate in degrees, minutes, and seconds.
+
+
+ellip.cal
+
+    efactor(iN, ia, B, force)
+
+    Attempt to factor using the elliptic functions: y^2 = x^3 + a*x + b.
+
+
+hello.cal
+
+    Calc's contribution to the Hello World! page:
+
+	http://www.latech.edu/~acm/HelloWorld.shtml
+	http://www.latech.edu/~acm/helloworld/calc.html
+
+
+lucas.cal
+
+    lucas(h, n)
+
+    Perform a primality test of h*2^n-1, with 1<=h<2*n.
+
+
+lucas_chk.cal
+
+    lucas_chk(high_n)
+
+    Test all primes of the form h*2^n-1, with 1<=h<200 and n <= high_n.
+    Requires lucas.cal to be loaded.  The highest useful high_n is 1000.
+
+    Used by regress.cal during the 2100 test set.
+
+
+lucas_tbl.cal
+
+    Lucasian criteria for primality tables.
+
+
+mersenne.cal
+
+    mersenne(p)
+
+    Perform a primality test of 2^p-1, for prime p>1.
+
+
+mfactor.cal
+
+    mfactor(n [, start_k=1 [, rept_loop=10000 [, p_elim=17]]])
+
+    Return the lowest factor of 2^n-1, for n > 0.  Starts looking for factors
+    at 2*start_k*n+1.  Skips values that are multiples of primes <= p_elim.
+    By default, start_k == 1, rept_loop = 10000 and p_elim = 17.
+
+    The p_elim == 17 overhead takes ~3 minutes on an 200 Mhz r4k CPU and
+    requires about ~13 Megs of memory.	The p_elim == 13 overhead
+    takes about 3 seconds and requires ~1.5 Megs of memory.
+
+    The value p_elim == 17 is best for long factorizations.  It is the
+    fastest even thought the initial startup overhead is larger than
+    for p_elim == 13.
+
+mod.cal
+
+    lmod(a)
+    mod_print(a)
+    mod_one()
+    mod_cmp(a, b)
+    mod_rel(a, b)
+    mod_add(a, b)
+    mod_sub(a, b)
+    mod_neg(a)
+    mod_mul(a, b)
+    mod_square(a)
+    mod_inc(a)
+    mod_dec(a)
+    mod_inv(a)
+    mod_div(a, b)
+    mod_pow(a, b)
+
+    Routines to handle numbers modulo a specified number.
+
+
+natnumset.cal
+
+    isset(a)
+    setbound(n)
+    empty()
+    full()
+    isin(a, b)
+    addmember(a, n)
+    rmmember(a, n)
+    set()
+    mkset(s)
+    primes(a, b)
+    set_max(a)
+    set_min(a)
+    set_not(a)
+    set_cmp(a, b)
+    set_rel(a, b)
+    set_or(a, b)
+    set_and(a, b)
+    set_comp(a)
+    set_setminus(a, b)
+    set_diff(a,b)
+    set_content(a)
+    set_add(a, b)
+    set_sub(a, b)
+    set_mul(a, b)
+    set_square(a)
+    set_pow(a, n)
+    set_sum(a)
+    set_plus(a)
+    interval(a, b)
+    isinterval(a)
+    set_mod(a, b)
+    randset(n, a, b)
+    polyvals(L, A)
+    polyvals2(L, A, B)
+    set_print(a)
+
+    Demonstration of how the string operators and functions may be used
+    for defining and working with sets of natural numbers not exceeding a
+    user-specified bound.
+
+
+pell.cal
+
+    pellx(D)
+    pell(D)
+
+    Solve Pell's equation; Returns the solution X to: X^2 - D * Y^2 = 1.
+    Type the solution to pells equation for a particular D.
+
+
+pi.cal
+
+    qpi(epsilon)
+    piforever()
+
+    The qpi() calculate pi within the specified epsilon using the quartic
+    convergence iteration.
+
+    The piforever() prints digits of pi, nicely formatted, for as long
+    as your free memory space and system up time allows.
+
+    The piforever() funcion (written by Klaus Alexander Seistrup
+    <klaus@seistrup.dk>) was inspired by an algorithm conceived by
+    Lambert Meertens.  See also the ABC Programmer's Handbook, by Geurts,
+    Meertens & Pemberton, published by Prentice-Hall (UK) Ltd., 1990.
+
+pix.cal
+
+    pi_of_x(x)
+
+    Calculate the number of primes < x using A(n+1)=A(n-1)+A(n-2).  This
+    is a SLOW painful method ... the builtin pix(x) is much faster.
+    Still, this method is interesting.
+
+
+pollard.cal
+
+    pfactor(N, N, ai, af)
+
+    Factor using Pollard's p-1 method.
+
+
+poly.cal
+
+    Calculate with polynomials of one variable.	 There are many functions.
+    Read the documentation in the resource file.
+
+
+prompt.cal
+
+    adder()
+    showvalues(str)
+
+    Demonstration of some uses of prompt() and eval().
+
+
+psqrt.cal
+
+    psqrt(u, p)
+
+    Calculate square roots modulo a prime
+
+
+qtime.cal
+
+    qtime(utc_hr_offset)
+
+    Print the time as English sentence given the hours offset from UTC.
+
+
+quat.cal
+
+    quat(a, b, c, d)
+    quat_print(a)
+    quat_norm(a)
+    quat_abs(a, e)
+    quat_conj(a)
+    quat_add(a, b)
+    quat_sub(a, b)
+    quat_inc(a)
+    quat_dec(a)
+    quat_neg(a)
+    quat_mul(a, b)
+    quat_div(a, b)
+    quat_inv(a)
+    quat_scale(a, b)
+    quat_shift(a, b)
+
+    Calculate using quaternions of the form: a + bi + cj + dk.	In these
+    functions, quaternians are manipulated in the form: s + v, where
+    s is a scalar and v is a vector of size 3.
+
+
+randbitrun.cal
+
+    randbitrun([run_cnt])
+
+    Using randbit(1) to generate a sequence of random bits, determine if
+    the number and length of identical bits runs match what is expected.
+    By default, run_cnt is to test the next 65536 random values.
+
+    This tests the a55 generator.
+
+
+randmprime.cal
+
+    randmprime(bits, seed [,dbg])
+
+    Find a prime of the form h*2^n-1 >= 2^bits for some given x.  The initial
+    search points for 'h' and 'n' are selected by a cryptographic pseudo-random
+    number generator.  The optional argument, dbg, if set to 1, 2 or 3
+    turn on various debugging print statements.
+
+
+randombitrun.cal
+
+    randombitrun([run_cnt])
+
+    Using randombit(1) to generate a sequence of random bits, determine if
+    the number and kength of identical bits runs match what is expected.
+    By default, run_cnt is to test the next 65536 random values.
+
+    This tests the Blum-Blum-Shub generator.
+
+
+randomrun.cal
+
+    randomrun([run_cnt])
+
+    Perform the "G. Run test" (pp. 65-68) as found in Knuth's "Art of
+    Computer Programming - 2nd edition", Volume 2, Section 3.3.2 on
+    the builtin rand() function.  This function will generate run_cnt
+    64 bit values.  By default, run_cnt is to test the next 65536
+    random values.
+
+    This tests the Blum-Blum-Shub generator.
+
+
+randrun.cal
+
+    randrun([run_cnt])
+
+    Perform the "G. Run test" (pp. 65-68) as found in Knuth's "Art of
+    Computer Programming - 2nd edition", Volume 2, Section 3.3.2 on
+    the builtin rand() function.  This function will generate run_cnt
+    64 bit values.  By default, run_cnt is to test the next 65536
+    random values.
+
+    This tests the a55 generator.
+
+
+regress.cal
+
+    Test the correct execution of the calculator by reading this resource file.
+    Errors are reported with '****' messages, or worse. :-)
+
+
+seedrandom.cal
+
+    seedrandom(seed1, seed2, bitsize [,trials])
+
+    Given:
+	seed1 - a large random value (at least 10^20 and perhaps < 10^93)
+	seed2 - a large random value (at least 10^20 and perhaps < 10^93)
+	size - min Blum modulus as a power of 2 (at least 100, perhaps > 1024)
+	trials - number of ptest() trials (default 25) (optional arg)
+
+    Returns:
+	the previous random state
+
+    Seed the cryptographically strong Blum generator.  This functions allows
+    one to use the raw srandom() without the burden of finding appropriate
+    Blum primes for the modulus.
+
+
+solve.cal
+
+    solve(low, high, epsilon)
+
+    Solve the equation f(x) = 0 to within the desired error value for x.
+    The function 'f' must be defined outside of this routine, and the low
+    and high values are guesses which must produce values with opposite signs.
+
+
+sumsq.cal
+
+    ss(p)
+
+    Determine the unique two positive integers whose squares sum to the
+    specified prime.  This is always possible for all primes of the form
+    4N+1, and always impossible for primes of the form 4N-1.
+
+
+surd.cal
+
+    surd(a, b)
+    surd_print(a)
+    surd_conj(a)
+    surd_norm(a)
+    surd_value(a, xepsilon)
+    surd_add(a, b)
+    surd_sub(a, b)
+    surd_inc(a)
+    surd_dec(a)
+    surd_neg(a)
+    surd_mul(a, b)
+    surd_square(a)
+    surd_scale(a, b)
+    surd_shift(a, b)
+    surd_div(a, b)
+    surd_inv(a)
+    surd_sgn(a)
+    surd_cmp(a, b)
+    surd_rel(a, b)
+
+    Calculate using quadratic surds of the form: a + b * sqrt(D).
+
+
+test1700.cal
+
+    value
+
+    This resoure files is used by regress.cal to test the read and use keywords.
+
+
+test2600.cal
+
+    global defaultverbose
+    global err
+    testismult(str, n, verbose)
+    testsqrt(str, n, eps, verbose)
+    testexp(str, n, eps, verbose)
+    testln(str, n, eps, verbose)
+    testpower(str, n, b, eps, verbose)
+    testgcd(str, n, verbose)
+    cpow(x, n, eps)
+    cexp(x, eps)
+    cln(x, eps)
+    mkreal()
+    mkcomplex()
+    mkbigreal()
+    mksmallreal()
+    testappr(str, n, verbose)
+    checkappr(x, y, z, verbose)
+    checkresult(x, y, z, a)
+    test2600(verbose, tnum)
+
+    This resoure files is used by regress.cal to test some of builtin functions
+    in terms of accuracy and roundoff.
+
+
+test2700.cal
+
+    global defaultverbose
+    mknonnegreal()
+    mkposreal()
+    mkreal_2700()
+    mknonzeroreal()
+    mkposfrac()
+    mkfrac()
+    mksquarereal()
+    mknonsquarereal()
+    mkcomplex_2700()
+    testcsqrt(str, n, verbose)
+    checksqrt(x, y, z, v)
+    checkavrem(A, B, X, eps)
+    checkrounding(s, n, t, u, z)
+    iscomsq(x)
+    test2700(verbose, tnum)
+
+    This resoure files is used by regress.cal to test sqrt() for real and
+    complex values.
+
+
+test3100.cal
+
+    obj res
+    global md
+    res_test(a)
+    res_sub(a, b)
+    res_mul(a, b)
+    res_neg(a)
+    res_inv(a)
+    res(x)
+
+    This resource file is used by regress.cal to test determinants of a matrix
+
+
+test3300.cal
+
+    global defaultverbose
+    global err
+    testi(str, n, N, verbose)
+    testr(str, n, N, verbose)
+    test3300(verbose, tnum)
+
+    This resource file is used by regress.cal to provide for more determinant
+    tests.
+
+test3400.cal
+
+    global defaultverbose
+    global err
+    test1(str, n, eps, verbose)
+    test2(str, n, eps, verbose)
+    test3(str, n, eps, verbose)
+    test4(str, n, eps, verbose)
+    test5(str, n, eps, verbose)
+    test6(str, n, eps, verbose)
+    test3400(verbose, tnum)
+
+    This resource file is used by regress.cal to test trig functions.
+    containing objects.
+
+test3500.cal
+
+    global defaultverbose
+    global err
+    testfrem(x, y, verbose)
+    testgcdrem(x, y, verbose)
+    testf(str, n, verbose)
+    testg(str, n, verbose)
+    testh(str, n, N, verbose)
+    test3500(verbose, n, N)
+
+    This resource file is used by regress.cal to test the functions frem,
+    fcnt, gcdrem.
+
+test4000.cal
+
+    global defaultverbose
+    global err
+    global BASEB
+    global BASE
+    global COUNT
+    global SKIP
+    global RESIDUE
+    global MODULUS
+    global K1
+    global H1
+    global K2
+    global H2
+    global K3
+    global H3
+    plen(N) defined
+    rlen(N) defined
+    clen(N) defined
+    ptimes(str, N, n, count, skip, verbose) defined
+    ctimes(str, N, n, count, skip, verbose) defined
+    crtimes(str, a, b, n, count, skip, verbose) defined
+    ntimes(str, N, n, count, skip, residue, mod, verbose) defined
+    testnextcand(str, N, n, cnt, skip, res, mod, verbose) defined
+    testnext1(x, y, count, skip, residue, modulus) defined
+    testprevcand(str, N, n, cnt, skip, res, mod, verbose) defined
+    testprev1(x, y, count, skip, residue, modulus) defined
+    test4000(verbose, tnum) defined
+
+    This resource file is used by regress.cal to test ptest, nextcand and
+    prevcand buildins.
+
+test4100.cal
+
+    global defaultverbose
+    global err
+    global K1
+    global K2
+    global BASEB
+    global BASE
+    rlen_4100(N) defined
+    olen(N) defined
+    test1(x, y, m, k, z1, z2) defined
+    testall(str, n, N, M, verbose) defined
+    times(str, N, n, verbose) defined
+    powtimes(str, N1, N2, n, verbose) defined
+    inittimes(str, N, n, verbose) defined
+    test4100(verbose, tnum) defined
+
+    This resource file is used by regress.cal to test REDC operations.
+
+test4600.cal
+
+    stest(str [, verbose]) defined
+    ttest([m, [n [,verbose]]]) defined
+    sprint(x) defined
+    findline(f,s) defined
+    findlineold(f,s) defined
+    test4600(verbose, tnum) defined
+
+    This resource file is used by regress.cal to test searching in files.
+
+test5100.cal
+
+    global a5100
+    global b5100
+    test5100(x) defined
+
+    This resource file is used by regress.cal to test the new code generator
+    declaration scope and order.
+
+test5200.cal
+
+    global a5200
+    static a5200
+    f5200(x) defined
+    g5200(x) defined
+    h5200(x) defined
+
+    This resource file is used by regress.cal to test the fix of a
+    global/static bug.
+
+unitfrac.cal
+
+    unitfrac(x)
+
+    Represent a fraction as sum of distinct unit fractions.
+
+
+varargs.cal
+
+    sc(a, b, ...)
+
+    Example program to use 'varargs'.  Program to sum the cubes of all
+    the specified numbers.
+
+xx_print.cal
+
+    is_octet(a) defined
+    list_print(a) defined
+    mat_print (a) defined
+    octet_print(a) defined
+    blk_print(a) defined
+    nblk_print (a) defined
+    strchar(a) defined
+    file_print(a) defined
+    error_print(a) defined
+
+    Demo for the xx_print object routines.
+
+## Copyright (C) 1999  David I. Bell and Landon Curt Noll
+##
+## Primary author: Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: README,v 29.1 1999/12/14 09:15:30 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/README,v $
+##
+## Under source code control:	1990/02/15 01:50:32
+## File existed as early as:	before 1990
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

cal/beer.cal

@@ -0,0 +1,50 @@
+/*
+ * beer - 99 bottles of beer
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: beer.cal,v 29.1 1999/12/14 09:15:30 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/beer.cal,v $
+ *
+ * Under source code control:	1996/11/13 13:21:05
+ * File existed as early as:	1996
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * See: http://www.ionet.net/~timtroyr/funhouse/beer.html#calc
+ */
+
+
+for (i=99; i > 0;) {
+	/* current wall state */
+	some_bottles = (i != 1) ? "bottles" : "bottle";
+	print i, some_bottles, "of beer on the wall,",;
+	print i, some_bottles, "of beer!";
+
+	/* glug, glug */
+	--i;
+	print "Take one down and pass it around,",;
+
+	/* new wall state */
+	less = (i > 0) ? i : "no";
+	bottles = (i!=1) ? "bottles" : "bottle";
+	print less, bottles, "of beer on the wall!\n";
+}

cal/bernoulli.cal

@@ -1,8 +1,33 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * bernoulli - clculate the Nth Bernoulli number B(n)
  *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: bernoulli.cal,v 29.1 1999/12/14 09:15:30 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/bernoulli.cal,v $
+ *
+ * Under source code control:	1991/09/30 11:18:41
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * Calculate the Nth Bernoulli number B(n).
  * This uses the following symbolic formula to calculate B(n):
  *
@@ -21,10 +46,11 @@
  * Since all previous B(n)'s are needed to calculate a particular B(n), all
  * values obtained are saved in an array for ease in repeated calculations.
  */
+
+
 static Bnmax;
 static mat Bn[1001];
 
-
 define B(n)
 {
 	local	nn, np1, i, sum, mulval, divval, combval;
@@ -60,8 +86,3 @@ define B(n)
 	Bnmax = n;
 	return Bn[n];
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-    print "B(n) defined";
-}

cal/bigprime.cal

@@ -0,0 +1,49 @@
+/*
+ * bigprime - a prime test, base a, on p*2^x+1 for even x>m
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: bigprime.cal,v 29.1 1999/12/14 09:15:30 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/bigprime.cal,v $
+ *
+ * Under source code control:	1991/05/22 21:56:32
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+define bigprime(a, m, p)
+{
+	local n1, n;
+
+	n1 = 2^m * p;
+	for (;;) {
+		m++;
+		n1 += n1;
+		n = n1 + 1;
+		if (isodd(m))
+			continue;
+		print m;
+		if (pmod(a, n1 / 2, n) != n1)
+			continue;
+		if (pmod(a, n1 / p, n) == 1)
+			continue;
+		print " " : n;
+	}
+}

cal/bindings

@@ -0,0 +1,75 @@
+# bindings - default key bindings for calc line editing functions
+#
+# Copyright (C) 1999  David I. Bell
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: bindings,v 29.1 1999/12/14 09:15:30 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/bindings,v $
+#
+# Under source code control:	1993/05/02 20:09:19
+# File existed as early as:	1993
+#
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+
+# NOTE: This facility is ignored if calc was compiled with GNU-readline.
+#	In that case, the standard readline mechanisms (see readline(3))
+#	are used in place of those found below.
+
+
+map	base-map
+default insert-char
+^@	set-mark
+^A	start-of-line
+^B	backward-char
+^D	delete-char
+^E	end-of-line
+^F	forward-char
+^H	backward-kill-char
+^J	new-line
+^K	kill-line
+^L	refresh-line
+^M	new-line
+^N	forward-history
+^O	save-line
+^P	backward-history
+^R	reverse-search
+^T	swap-chars
+^U	flush-input
+^V	quote-char
+^W	kill-region
+^Y	yank
+^?	backward-kill-char
+^[	ignore-char	esc-map
+
+map	esc-map
+default ignore-char	base-map
+G	start-of-line
+H	backward-history
+P	forward-history
+K	backward-char
+M	forward-char
+O	end-of-line
+S	delete-char
+g	goto-line
+s	backward-word
+t	forward-word
+d	forward-kill-word
+u	uppercase-word
+l	lowercase-word
+h	list-history
+^[	flush-input
+[	arrow-key

cal/chrem.cal

@@ -1,6 +1,35 @@
 /*
- * chrem - Chinese remainder theorem/problem solver
+ * chrem - chinese remainder theorem/problem solver
  *
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
+ *
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: chrem.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/chrem.cal,v $
+ *
+ * Under source code control:	1992/09/26 01:00:47
+ * File existed as early as:	1992
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * When possible, chrem finds solutions for x of a set of congruences
  * of the form:
  *
@@ -11,16 +40,16 @@
  * where the residues r1, r2, ... and the moduli m1, m2, ... are
  * given integers.  The Chinese remainder theorem states that if
  * m1, m2, ... are relatively prime in pairs, the above congruences
- * have a unique solution modulo  m1 * m2 * ...   If m1, m2, ...
+ * have a unique solution modulo  m1 * m2 * ...	  If m1, m2, ...
  * are not relatively prime in pairs, it is possible that no solution
  * exists.  If solutions exist, the general solution is expressible as:
  *
- *                   x = r (mod m)
+ *		     x = r (mod m)
  *
- * where m = lcm(m1,m2,...), and if m > 0, 0 <= r < m.  This
+ * where m = lcm(m1,m2,...), and if m > 0, 0 <= r < m.	This
  * solution may be interpreted as:
  *
- *                  x = r + k * m			[[NOTE 1]]
+ *		    x = r + k * m			[[NOTE 1]]
  *
  * where k is an arbitrary integer.
  *
@@ -30,15 +59,15 @@
  *
  *	chrem(r1,m1 [,r2,m2, ...])
  *
- * 	    r1, r2, ...  	remainder integers or null values
- * 	    m1, m2, ...  	moduli integers
+ *	    r1, r2, ...		remainder integers or null values
+ *	    m1, m2, ...		moduli integers
  *
  *	chrem(r_list, [m_list])
  *
  *	    r_list	list (r1,r2, ...)
  *	    m_list	list (m1,m2, ...)
  *
- * 	    If m_list is omitted, then 'defaultmlist' is used.
+ *	    If m_list is omitted, then 'defaultmlist' is used.
  *	    This default list is a global value that may be changed
  *	    by the user.  Initially it is the first 8 primes.
  *
@@ -50,13 +79,13 @@
  *
  * The moduli may be any integers, not necessarily relatively prime in
  * pairs (as required for the Chinese remainder theorem).  Any moduli
- * may be zero;  x = r (mod 0) has the meaning of x = r.
+ * may be zero;	 x = r (mod 0) has the meaning of x = r.
  *
  * returns:
  *
  *    If args were integer pairs:
  *
- *    	  r		('r' is defined above, see [[NOTE 1]])
+ *	  r		('r' is defined above, see [[NOTE 1]])
  *
  *    If 1 or 2 list args were given:
  *
@@ -84,11 +113,9 @@
  *	    chrem(list(0,1,1,1,1,1),list(7,2,3,4,5,6)) ---> (301,420)
  *
  *	i.e., any value that is 301 mod 420.
- *
- * Written by: Ernest W Bowen <ernie@neumann.une.edu.au>
- * Interface by: Landon Curt Noll <chongo@toad.com>
  */
 
+
 static defaultmlist = list(2,3,5,7,11,13,17,19); /* The first eight primes */
 
 define chrem()
@@ -96,7 +123,7 @@ define chrem()
     local argc;		/* number of args given */
     local rlist;	/* reminder list - ri */
     local mlist;	/* modulus list - mi */
-    local list_args;  	/* true => args given are lists, not r1,m1, ... */
+    local list_args;	/* true => args given are lists, not r1,m1, ... */
     local m,z,r,y,d,t,x,u,i;
 
     /*
@@ -121,7 +148,7 @@ define chrem()
 	mlist = list();
 	for (i=1; i <= argc; i+=2) {
 	    push(rlist, param(i));
-            push(mlist, param(i+1));
+	    push(mlist, param(i+1));
 	}
     }
 
@@ -174,8 +201,7 @@ define chrem()
     }
 }
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
     print "chrem(r1,m1 [,r2,m2 ...]) defined";
     print "chrem(rlist [,mlist]) defined";
 }

cal/deg.cal

@@ -1,11 +1,33 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * deg - calculate in degrees, minutes, and seconds
  *
- * Calculate in degrees, minutes, and seconds.
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: deg.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/deg.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:33
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 obj dms {deg, min, sec};
 
 define dms(deg, min, sec)
@@ -111,14 +133,6 @@ define fixdms(a)
 	a.deg %= 360;
 }
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
     print "obj dms {deg, min, sec} defined";
-    print "dms(deg, min, sec) defined";
-    print "dms_add(a, b) defined";
-    print "dms_neg(a) defined";
-    print "dms_sub(a, b) defined";
-    print "dms_mul(a, b) defined";
-    print "dms_print(a) defined";
-    print "dms_abs(a) defined";
 }

cal/ellip.cal

@@ -1,10 +1,35 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * ellip - attempt to factor numbers using elliptic functions
  *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: ellip.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/ellip.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:33
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * Attempt to factor numbers using elliptic functions.
- * 	y^2 = x^3 + a*x + b   (mod N).
+ *	y^2 = x^3 + a*x + b   (mod N).
  *
  * Many points (x,y) (mod N) are found that solve the above equation,
  * starting from a trivial solution and 'multiplying' that point together
@@ -24,7 +49,7 @@
  * only an approximation, read "A Course in Number Theory and Cryptography"
  * by Neal Koblitz for a good explanation.
  *
- * factor(iN, ia, B, force)
+ * efactor(iN, ia, B, force)
  *	iN is the number to be factored.
  *	ia is the initial value of a in the equation, and each successive
  *	value of a is an independent attempt at factoring (default 1).
@@ -55,10 +80,11 @@
  * of the powers so far.
  *
  * If a factor is found, it is returned and is also saved in the global
- * variable f.  The number being factored is also saved in the global
+ * variable f.	The number being factored is also saved in the global
  * variable N.
  */
 
+
 obj point {x, y};
 global	N;		/* number to factor */
 global	a;		/* first coefficient */
@@ -66,7 +92,7 @@ global	b;		/* second coefficient */
 global	f;		/* found factor */
 
 
-define factor(iN, ia, B, force)
+define efactor(iN, ia, B, force)
 {
 	local	C, x, p;
 
@@ -165,8 +191,3 @@ define point_pow(p, pow)
 	}
 	return r;
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-    print "factor(N, I, B, force) defined";
-}

cal/hello.cal

@@ -0,0 +1,36 @@
+/*
+ * hello - print Hello World! forever
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: hello.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/hello.cal,v $
+ *
+ * Under source code control:	1996/11/13 13:25:43
+ * File existed as early as:	1996
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * See: http://www.latech.edu/~acm/helloworld/calc.html
+ */
+
+
+while(1) print "Hello World!";

cal/lucas.cal

@@ -1,29 +1,34 @@
-/*
- * Copyright (c) 1995 Landon Curt Noll
- *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice and text
- * this comment, and the disclaimer below appear in all of the following:
- *
- *	supporting documentation
- *	source copies
- *	source works derived from this source
- *	binaries derived from this source or from derived source
- *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
- *
- * chongo was here	/\../\		chongo@toad.com
- */
 /*
  * lucas - perform a Lucas primality test on h*2^n-1
  *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: lucas.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/lucas.cal,v $
+ *
+ * Under source code control:	1990/05/03 16:49:51
+ * File existed as early as:	1990
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * HISTORICAL NOTE:
  *
  * On 6 August 1989 at 00:53 PDT, the 'Amdahl 6', a team consisting of
@@ -31,26 +36,26 @@
  * Sergio Zarantonello proved the following 65087 digit number to be prime:
  *
  *				  216193
- *			391581 * 2      -1
+ *			391581 * 2	-1
  *
  * At the time of discovery, this number was the largest known prime.
  * The primality was demonstrated by a program implementing the test
  * found in these routines.  An Amdahl 1200 takes 1987 seconds to test
  * the primality of this number.  A Cray 2 took several hours to
- * confirm this prime.  As of 28 Aug 1993, this prime was the 2nd
+ * confirm this prime.	As of 31 Dec 1995, this prime was the 3rd
  * largest known prime and the largest known non-Mersenne prime.
  *
  * The same team also discovered the following twin prime pair:
  *
  *			   11235		   11235
- *		1706595 * 2     -1	1706595 * 2     +1
+ *		1706595 * 2	-1	1706595 * 2	+1
  *
  * At the time of discovery, this was the largest known twin prime pair.
  *
  * NOTE: Both largest known and largest known twin prime records have been
- *       broken.  Rather than update this file each time, I'll just
+ *	 broken.  Rather than update this file each time, I'll just
  *	 congratulate the finders and encourage others to try for
- *	 larger finds.  Records were made to be broken afterall!
+ *	 larger finds.	Records were made to be broken afterall!
  *
  * ON GAINING A WORLD RECORD:
  *
@@ -75,7 +80,7 @@
  *
  * The Mersenne test for '2^n-1' is the fastest known primality test
  * for a given large numbers.  However, it is faster to search for
- * primes of the form 'h*2^n-1'.  When n is around 20000, one can find
+ * primes of the form 'h*2^n-1'.  When n is around 200000, one can find
  * a prime of the form 'h*2^n-1' in about 1/2 the time.
  *
  * Critical to understanding why 'h*2^n-1' is to observe that primes of
@@ -86,7 +91,7 @@
  * 'h', the time to test each number remains relatively constant.
  *
  * It is clearly a win to eliminate potential test candidates by
- * rejecting numbers that that are divisible by 'small' primes.  We
+ * rejecting numbers that that are divisible by 'small' primes.	 We
  * (the "Amdahl 6") rejected all numbers that were divisible by primes
  * less than '2^40'.  We stopped looking for small factors at '2^40'
  * when the rate of candidates being eliminated was slowed down to
@@ -121,8 +126,8 @@
  * point is beyond the scope of this program.
  */
 
+
 global pprod256;	/* product of  "primes up to 256" / "primes up to 46" */
-global lib_debug;	/* 1 => print debug statements */
 
 /*
  * lucas - lucas primality test on h*2^n-1
@@ -130,7 +135,7 @@ global lib_debug;	/* 1 => print debug statements */
  * ABOUT THE TEST:
  *
  * This routine will perform a primality test on h*2^n-1 based on
- * the mathematics of Lucas, Lehmer and Riesel.  One should read
+ * the mathematics of Lucas, Lehmer and Riesel.	 One should read
  * the following article:
  *
  * Ref1:
@@ -151,7 +156,7 @@ global lib_debug;	/* 1 => print debug statements */
  *
  * This test is performed as follows:	(see Ref1, Theorem 5)
  *
- *	a) generate u(0) 		(see the function gen_u0() below)
+ *	a) generate u(0)		(see the function gen_u0() below)
  *
  *	b) generate u(n-2) according to the rule:
  *
@@ -161,9 +166,9 @@ global lib_debug;	/* 1 => print debug statements */
  *
  * Now the following conditions must be true for the test to work:
  *
- *      n >= 2
+ *	n >= 2
  *	h >= 1
- *      h < 2^n
+ *	h < 2^n
  *	h mod 2 == 1
  *
  * A few misc notes:
@@ -172,10 +177,14 @@ global lib_debug;	/* 1 => print debug statements */
  * any number that is divisible by a prime less than 257.  Valid prime
  * candidates less than 257 are declared prime as a special case.
  *
- * The condition 'h mod 2 == 1' is not a problem.  Say one is testing
- * 'j*2^m-1', where j is even.  If we note that:
+ * In real life, you would eliminate candidates by checking for
+ * divisibility by a prime much larger than 257 (perhaps as high
+ * as 2^39).
  *
- *      j mod 2^x == 0 for x>0   implies   j*2^m-1 == ((j/2^x)*2^(m+x))-1,
+ * The condition 'h mod 2 == 1' is not a problem.  Say one is testing
+ * 'j*2^m-1', where j is even.	If we note that:
+ *
+ *	j mod 2^x == 0 for x>0	 implies   j*2^m-1 == ((j/2^x)*2^(m+x))-1,
  *
  * then we can let h=j/2^x and n=m+x and test 'h*2^n-1' which is the value.
  * We need only consider odd values of h because we can rewrite our numbers
@@ -221,7 +230,7 @@ lucas(h, n)
 	 */
 	oldh = h;
 	oldn = n;
-	shiftdown = fcnt(h,2);  /* h % 2^shiftdown == 0, max shiftdown */
+	shiftdown = fcnt(h,2);	/* h % 2^shiftdown == 0, max shiftdown */
 	if (shiftdown > 0) {
 		h >>= shiftdown;
 		n += shiftdown;
@@ -232,13 +241,13 @@ lucas(h, n)
 	 */
 	if (h <= 0 || n <= 0) {
 		print "ERROR: reduced args violate the rule: 0 < h < 2^n";
-		print "    ERROR: h=":oldh, "n=":oldn, "reduced h=":h, "n=":n;
+		print "	   ERROR: h=":oldh, "n=":oldn, "reduced h=":h, "n=":n;
 		ldebug("lucas", "unknown: h <= 0 || n <= 0");
 		return -1;
 	}
 	if (highbit(h) >= n) {
 		print "ERROR: reduced args violate the rule: h < 2^n";
-		print "    ERROR: h=":oldh, "n=":oldn, "reduced h=":h, "n=":n;
+		print "	   ERROR: h=":oldh, "n=":oldn, "reduced h=":h, "n=":n;
 		ldebug("lucas", "unknown: highbit(h) >= n");
 		return -1;
 	}
@@ -345,26 +354,27 @@ lucas(h, n)
 	 * the v(1) into u(0).
 	 *
 	 * If gen_v1() returns a negative value, then we failed to
-	 * generate a test for h*2^n-1.  This is because h mod 3 == 0
+	 * generate a test for h*2^n-1.	 This is because h mod 3 == 0
 	 * is hard to do, and in rare cases, exceed the tables found
 	 * in this program.  We will generate an message and assume
 	 * the number is not prime, even though if we had a larger
 	 * table, we might have been able to show that it is prime.
 	 */
-	v1 = gen_v1(h, n, testval);
+	v1 = gen_v1(h, n);
 	if (v1 < 0) {
 		/* failure to test number */
 		print "unable to compute v(1) for", h : "*2^" : n : "-1";
 		ldebug("lucas", "unknown: no v(1)");
 		return -1;
 	}
-	u = gen_u0(h, n, testval, v1);
+	u = gen_u0(h, n, v1);
 
 	/*
 	 * compute u(n-2)
 	 */
 	for (i=3; i <= n; ++i) {
-		u = (u^2 - 2) % testval;
+		/* u = (u^2 - 2) % testval; */
+		u = hnrmod(u^2 - 2, h, n, -1);
 	}
 
 	/*
@@ -417,7 +427,6 @@ lucas(h, n)
  * input:
  *	h	- h as in h*2^n-1	(h mod 2 != 0)
  *	n	- n as in h*2^n-1
- *	testval	- h*2^n-1
  *	v1	- gen_v1(h,n)		(see function below)
  *
  * returns:
@@ -425,7 +434,7 @@ lucas(h, n)
  *	-1	- failed to generate u(0)
  */
 define
-gen_u0(h, n, testval, v1)
+gen_u0(h, n, v1)
 {
 	local shiftdown;	/* the power of 2 that divides h */
 	local r;		/* low value: v(n) */
@@ -442,15 +451,9 @@ gen_u0(h, n, testval, v1)
 	if (!isint(n)) {
 		quit "bad args: n must be an integer";
 	}
-	if (!isint(testval)) {
-		quit "bad args: testval must be an integer";
-	}
 	if (!isint(v1)) {
 		quit "bad args: v1 must be an integer";
 	}
-	if (testval <= 0) {
-		quit "bogus arg: testval is <= 0";
-	}
 	if (v1 <= 0) {
 		quit "bogus arg: v1 is <= 0";
 	}
@@ -488,34 +491,40 @@ gen_u0(h, n, testval, v1)
 	 */
 	if (h == 1) {
 		ldebug("gen_u0", "quick h == 1 case");
-		return r%testval;
+		/* return r%(h*2^n-1); */
+		return hnrmod(r, h, n, -1);
 	}
 
 	/* cycle from second highest bit to second lowest bit of h */
 	for (i=hbits-1; i > 0; --i) {
 
 		/* bit(i) is 1 */
-		if (isset(h,i)) {
+		if (bit(h,i)) {
 
 			/* compute v(2n+1) = v(r+1)*v(r)-v1 */
-			r = (r*s - v1) % testval;
+			/* r = (r*s - v1) % (h*2^n-1); */
+			r = hnrmod((r*s - v1), h, n, -1);
 
 			/* compute v(2n+2) = v(r+1)^2-2 */
-			s = (s^2 - 2) % testval;
+			/* s = (s^2 - 2) % (h*2^n-1); */
+			s = hnrmod((s^2 - 2), h, n, -1);
 
 		/* bit(i) is 0 */
 		} else {
 
 			/* compute v(2n+1) = v(r+1)*v(r)-v1 */
-			s = (r*s - v1) % testval;
+			/* s = (r*s - v1) % (h*2^n-1); */
+			s = hnrmod((r*s - v1), h, n, -1);
 
 			/* compute v(2n) = v(r)^-2 */
-			r = (r^2 - 2) % testval;
+			/* r = (r^2 - 2) % (h*2^n-1); */
+			r = hnrmod((r^2 - 2), h, n, -1);
 		}
 	}
 
 	/* we know that h is odd, so the final bit(0) is 1 */
-	r = (r*s - v1) % testval;
+	/* r = (r*s - v1) % (h*2^n-1); */
+	r = hnrmod((r*s - v1), h, n, -1);
 
 	/* compute the final u2 return value */
 	return r;
@@ -555,14 +564,14 @@ gen_u0(h, n, testval, v1)
 quickmax = 8;
 mat d_qval[quickmax];
 mat v1_qval[quickmax];
-d_qval[0] = 5;		v1_qval[0] = 3;		/* a=1   b=1  r=4  */
-d_qval[1] = 7;		v1_qval[1] = 5;		/* a=3   b=1  r=12  D=21 */
-d_qval[2] = 13;		v1_qval[2] = 11;	/* a=3   b=1  r=4  */
-d_qval[3] = 11;		v1_qval[3] = 20;	/* a=3   b=1  r=2  */
-d_qval[4] = 29;		v1_qval[4] = 27;	/* a=5   b=1  r=4  */
-d_qval[5] = 53;		v1_qval[5] = 51;	/* a=53  b=1  r=4  */
-d_qval[6] = 17;		v1_qval[6] = 66;	/* a=17  b=1  r=1  */
-d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
+d_qval[0] = 5;		v1_qval[0] = 3;		/* a=1	 b=1  r=4  */
+d_qval[1] = 7;		v1_qval[1] = 5;		/* a=3	 b=1  r=12  D=21 */
+d_qval[2] = 13;		v1_qval[2] = 11;	/* a=3	 b=1  r=4  */
+d_qval[3] = 11;		v1_qval[3] = 20;	/* a=3	 b=1  r=2  */
+d_qval[4] = 29;		v1_qval[4] = 27;	/* a=5	 b=1  r=4  */
+d_qval[5] = 53;		v1_qval[5] = 51;	/* a=53	 b=1  r=4  */
+d_qval[6] = 17;		v1_qval[6] = 66;	/* a=17	 b=1  r=1  */
+d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38	 b=1  r=2  */
 
 /*
  * gen_v1 - compute the v(1) for a given h*2^n-1 if we can
@@ -665,7 +674,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  * are true, and return the related v(1).
  *
  * Before we address the two conditions, we need some background information
- * on two symbols, Legendre and Jacobi.  In Ref 2, pp 278, 284-285, we find
+ * on two symbols, Legendre and Jacobi.	 In Ref 2, pp 278, 284-285, we find
  * the following definitions of J(a,p) and L(a,n):
  *
  * The Legendre symbol L(a,p) takes the value:
@@ -718,7 +727,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *
  * From Ref2, table 32:
  *
- *	p mod 8 == +/-1   implies  L(2,p) == 1			{note 3}
+ *	p mod 8 == +/-1	  implies  L(2,p) == 1			{note 3}
  *	p mod 12 == +/-1  implies  L(3,p) == 1			{note 4}
  *
  * Since h*2^n-1 mod 8 == -1, for n>2, note 3 implies:
@@ -731,14 +740,14 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *
  * By use of {A3.5}, {note 2}, {note 5} and {note 6}, one can show:
  *
- *	L((2^g)*(3^l)*(z^2), h*2^n-1) == 1  (g>=0,l>=0,z>0,n>2)	{note 7}
+ *	L((2^g)*(3^l)*(z^2), h*2^n-1) == 1  (g>=0,l>=0,z>0,n>2) {note 7}
  *
  * Returning to the testing of conditions, take condition 1:
  *
  *	L(D, h*2^n-1) == -1			[condition 1]
  *
  * In order for J(D, h*2^n-1) to be defined, we must ensure that D
- * is not a factor of h*2^n-1.  This is done by pre-screening h*2^n-1 to
+ * is not a factor of h*2^n-1.	This is done by pre-screening h*2^n-1 to
  * not have small factors and selecting D less than that factor check limit.
  *
  * By use of {note 7}, we can show that when we choose D to be:
@@ -759,7 +768,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *		      == J(h*2^n-1 mod P, P)*(-1)^((h*2^n-2)*(P-1)/4)  {note 0}
  *
  * When does J(h*2^n-1 mod P, P)*(-1)^((h*2^n-2)*(P-1)/4) take the value of -1,
- * thus satisfy [condition 1]?  The answer depends on P.  Now P is a prime>2,
+ * thus satisfy [condition 1]?	The answer depends on P.  Now P is a prime>2,
  * thus P mod 4 == 1 or -1.
  *
  * Take P mod 4 == 1:
@@ -774,7 +783,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *
  * Take P mod 4 == -1:
  *
- *	P mod 4 == -1  implies  (-1)^((h*2^n-2)*(P-1)/4) == -1
+ *	P mod 4 == -1  implies	(-1)^((h*2^n-2)*(P-1)/4) == -1
  *
  * Thus:
  *
@@ -826,7 +835,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *		      == J(h*2^n-1 mod Q, Q)*(-1)^((h*2^n-2)*(Q-1)/4)  {note 0}
  *
  * When does J(h*2^n-1 mod Q, Q)*(-1)^((h*2^n-2)*(Q-1)/4) take the value of 1,
- * thus satisfy [condition 2]?  The answer depends on Q.  Now Q is a prime>2,
+ * thus satisfy [condition 2]?	The answer depends on Q.  Now Q is a prime>2,
  * thus Q mod 4 == 1 or -1.
  *
  * Take Q mod 4 == 1:
@@ -841,7 +850,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *
  * Take Q mod 4 == -1:
  *
- *	Q mod 4 == -1  implies  (-1)^((h*2^n-2)*(Q-1)/4) == -1
+ *	Q mod 4 == -1  implies	(-1)^((h*2^n-2)*(Q-1)/4) == -1
  *
  * Thus:
  *
@@ -849,7 +858,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *		      == L(h*2^n-1 mod Q, Q) * -1
  *		      == -J(h*2^n-1 mod Q, Q)
  *
- * Therefore [condition 2] is met by selecting  D = Q*(2^j)*(3^k)*(z^2),
+ * Therefore [condition 2] is met by selecting	D = Q*(2^j)*(3^k)*(z^2),
  * where Q is prime>2, j>=0, k>=0, z>0; if and only if one of the following
  * to cases are true:
  *
@@ -888,7 +897,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *
  *	   r == Q*(2^j)*(3^k)*(z^2)	(Q==1 or Q is prime>2, j>=0, k>=0, z>0)
  *
- *         one of the following is true:
+ *	   one of the following is true:
  *	       P mod 4 ==  1  and  J(h*2^n-1 mod P, P) == -1
  *	       P mod 4 == -1  and  J(h*2^n-1 mod P, P) ==  1
  *
@@ -897,7 +906,7 @@ d_qval[7] = 19;		v1_qval[7] = 74;	/* a=38  b=1  r=2  */
  *	       Q mod 4 == -1  and  J(h*2^n-1 mod Q, Q) == -1
  *
  *     If we cannot find a v(1) quickly enough, then we will give up
- *     testing h*2^n-1.  This does not happen too often, so this hack
+ *     testing h*2^n-1.	 This does not happen too often, so this hack
  *     is not too bad.
  *
  ***
@@ -965,28 +974,28 @@ gen_v1(h, n)
 	 *
 	 * We will check with:
 	 *
-	 *	v(1)=81      D=6557      a=79      b=1      r=316
+	 *	v(1)=81	     D=6557	 a=79	   b=1	    r=316
 	 *
-	 * Now, D==79*83 and r=79*2^2.  If we show that:
+	 * Now, D==79*83 and r=79*2^2.	If we show that:
 	 *
 	 *	J(h*2^n-1 mod 79, 79) == -1
 	 *	J(h*2^n-1 mod 83, 83) == 1
 	 *
-	 * then we will satisfy [condition 1].  Observe:
+	 * then we will satisfy [condition 1].	Observe:
 	 *
- 	 *	79 mod 4 == -1  implies  (-1)^((h*2^n-2)*(79-1)/4) == -1
- 	 *	83 mod 4 == -1  implies  (-1)^((h*2^n-2)*(83-1)/4) == -1
+	 *	79 mod 4 == -1	implies	 (-1)^((h*2^n-2)*(79-1)/4) == -1
+	 *	83 mod 4 == -1	implies	 (-1)^((h*2^n-2)*(83-1)/4) == -1
 	 *
 	 *	J(D, h*2^n-1) == J(83, h*2^n-1) * J(79, h*2^n-1)
 	 *		      == J(h*2^n-1, 83) * (-1)^((h*2^n-2)*(83-1)/4) *
-	 *		         J(h*2^n-1, 79) * (-1)^((h*2^n-2)*(79-1)/4)
+	 *			 J(h*2^n-1, 79) * (-1)^((h*2^n-2)*(79-1)/4)
 	 *		      == J(h*2^n-1 mod 83, 83) * -1 *
-	 *		         J(h*2^n-1 mod 79, 79) * -1
+	 *			 J(h*2^n-1 mod 79, 79) * -1
 	 *		      ==  1 * -1 *
 	 *			 -1 * -1
 	 *		      == -1
 	 *
-	 * We will also satisfy [condition 2].  Observe:
+	 * We will also satisfy [condition 2].	Observe:
 	 *
 	 *	(a^2 - b^2*D)/r == (79^2 - 1^1*6557)/316
 	 *			== -1
@@ -1021,13 +1030,8 @@ gen_v1(h, n)
 define
 ldebug(funct, str)
 {
-	if (lib_debug > 0) {
+	if (config("resource_debug") & 3) {
 		print "DEBUG:", funct:":", str;
 	}
 	return;
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-    print "lucas(h, n) defined";
-}

cal/lucas_chk.cal

@@ -1,26 +1,33 @@
 /*
- * Copyright (c) 1995 Landon Curt Noll
+ * lucas_chk - test all primes of the form h*2^n-1, 1<=h<200 and n <= high_n
  *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice and text
- * this comment, and the disclaimer below appear in all of the following:
+ * Copyright (C) 1999  Landon Curt Noll
  *
- *	supporting documentation
- *	source copies
- *	source works derived from this source
- *	binaries derived from this source or from derived source
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
  *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * Calc 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 Lesser General
+ * Public License for more details.
  *
- * chongo was here	/\../\		chongo@toad.com
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: lucas_chk.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/lucas_chk.cal,v $
+ *
+ * Under source code control:	1991/01/11 05:41:43
+ * File existed as early as:	1991
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * primes of the form h*2^n-1 for 1<=h<200 and 1<=n<1000
  *
@@ -42,6 +49,7 @@
  *		199*2^221-1 is NOT prime
  */
 
+
 static prime_cnt = 1145;	/* number of primes in the list */
 
 /* h = prime parameters */
@@ -256,7 +264,7 @@ static mat n_p[prime_cnt] = {
 	59, 75, 103, 163, 235, 375, 615, 767, 2, 18,
 	38, 62, 1, 5, 7, 9, 15, 19, 21, 35,
 	37, 39, 41, 49, 69, 111, 115, 141, 159, 181,
-	201, 217, 487, 567, 677, 765, 811, 841, 917, 2,	/* 900 */
+	201, 217, 487, 567, 677, 765, 811, 841, 917, 2, /* 900 */
 	4, 6, 8, 12, 18, 26, 32, 34, 36, 42,
 	60, 78, 82, 84, 88, 154, 174, 208, 256, 366,
 	448, 478, 746, 5, 13, 15, 31, 77, 151, 181,
@@ -296,7 +304,7 @@ read -once "lucas.cal";
  *
  * input:
  *	high_n	skip tests on n_p[i] > high_n
- *	[quiet]	if given and != 0, then do not print individual test results
+ *	[quiet] if given and != 0, then do not print individual test results
  *
  * returns:
  *	1	all is ok
@@ -328,7 +336,7 @@ lucas_chk(high_n, quiet)
 
 		/* skip primes where h>=2^n */
 		if (highbit(h_p[i]) >= n_p[i]) {
-			if (lib_debug > 0) {
+			if (config("resource_debug") & 3) {
 				print "h>=2^n skip:", h_p[i]:"*2^":n_p[i]:"-1";
 			}
 			continue;
@@ -374,8 +382,3 @@ lucas_chk(high_n, quiet)
 		return 0;
 	}
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-    print "lucas_chk(high_n) defined";
-}

cal/lucas_tbl.cal

@@ -0,0 +1,165 @@
+/*
+ * lucas_tbl - lucasian criteria for primality tables
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: lucas_tbl.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/lucas_tbl.cal,v $
+ *
+ * Under source code control:	1991/01/26 02:43:43
+ * File existed as early as:	1991
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Lucasian criteria for primality
+ *
+ * The following table is taken from:
+ *
+ *	"Lucasian Criteria for the Primality of N=h*2^n-1", by Hans Riesel,
+ *	Mathematics of Computation, Vol 23 #108, p 872.
+ *
+ * The index of the *_val[] arrays correspond to the v(1) values found
+ * in the table.  That is, for v(1) == x:
+ *
+ *	D == d_val[x]
+ *	a == a_val[x]
+ *	b == b_val[x]
+ *	r == r_val[x]		(r == abs(a^2 - b^2*D))
+ *
+ *
+ * Note that when *_val[i] is not a number, the related v(1) value
+ * is not found in Table 1.
+ */
+
+
+trymax = 100;
+mat d_val[trymax+1];
+mat a_val[trymax+1];
+mat b_val[trymax+1];
+mat r_val[trymax+1];
+/* v1= 0	    INVALID */
+/* v1= 1	    INVALID */
+/* v1= 2	    INVALID */
+d_val[ 3]=   5;	 a_val[ 3]= 1;	b_val[ 3]=1;  r_val[ 3]=4;
+d_val[ 4]=   3;	 a_val[ 4]= 1;	b_val[ 4]=1;  r_val[ 4]=2;
+d_val[ 5]=  21;	 a_val[ 5]= 3;	b_val[ 5]=1;  r_val[ 5]=12;
+d_val[ 6]=   2;	 a_val[ 6]= 1;	b_val[ 6]=1;  r_val[ 6]=1;
+/* v1= 7	    INVALID */
+d_val[ 8]=  15;	 a_val[ 8]= 3;	b_val[ 8]=1;  r_val[ 8]=6;
+d_val[ 9]=  77;	 a_val[ 9]= 7;	b_val[ 9]=1;  r_val[ 9]=28;
+d_val[10]=   6;	 a_val[10]= 2;	b_val[10]=1;  r_val[10]=2;
+d_val[11]=  13;	 a_val[11]= 3;	b_val[11]=1;  r_val[11]=4;
+d_val[12]=  35;	 a_val[12]= 5;	b_val[12]=1;  r_val[12]=10;
+d_val[13]= 165;	 a_val[13]=11;	b_val[13]=1;  r_val[13]=44;
+/* v1=14	    INVALID */
+d_val[15]= 221;	 a_val[15]=13;	b_val[15]=1;  r_val[15]=52;
+d_val[16]=   7;	 a_val[16]= 3;	b_val[16]=1;  r_val[16]=2;
+d_val[17]= 285;	 a_val[17]=15;	b_val[17]=1;  r_val[17]=60;
+/* v1=18	    INVALID */
+d_val[19]= 357;	 a_val[19]=17;	b_val[19]=1;  r_val[19]=68;
+d_val[20]=  11;	 a_val[20]= 3;	b_val[20]=1;  r_val[20]=2;
+d_val[21]= 437;	 a_val[21]=19;	b_val[21]=1;  r_val[21]=76;
+d_val[22]=  30;	 a_val[22]= 5;	b_val[22]=1;  r_val[22]=5;
+/* v1=23	    INVALID */
+d_val[24]= 143;	 a_val[24]=11;	b_val[24]=1;  r_val[24]=22;
+d_val[25]=  69;	 a_val[25]= 9;	b_val[25]=1;  r_val[25]=12;
+d_val[26]=  42;	 a_val[26]= 6;	b_val[26]=1;  r_val[26]=6;
+d_val[27]=  29;	 a_val[27]= 5;	b_val[27]=1;  r_val[27]=4;
+d_val[28]= 195;	 a_val[28]=13;	b_val[28]=1;  r_val[28]=26;
+d_val[29]=  93;	 a_val[29]= 9;	b_val[29]=1;  r_val[29]=12;
+d_val[30]=  14;	 a_val[30]= 4;	b_val[30]=1;  r_val[30]=2;
+d_val[31]= 957;	 a_val[31]=29;	b_val[31]=1;  r_val[31]=116;
+d_val[32]= 255;	 a_val[32]=15;	b_val[32]=1;  r_val[32]=30;
+d_val[33]=1085;	 a_val[33]=31;	b_val[33]=1;  r_val[33]=124;
+/* v1=34	    INVALID */
+d_val[35]=1221;	 a_val[35]=33;	b_val[35]=1;  r_val[35]=132;
+d_val[36]= 323;	 a_val[36]=17;	b_val[36]=1;  r_val[36]=34;
+d_val[37]=1365;	 a_val[37]=35;	b_val[37]=1;  r_val[37]=140;
+d_val[38]=  10;	 a_val[38]= 3;	b_val[38]=1;  r_val[38]=1;
+d_val[39]=1517;	 a_val[39]=37;	b_val[39]=1;  r_val[39]=148;
+d_val[40]= 399;	 a_val[40]=19;	b_val[40]=1;  r_val[40]=38;
+d_val[41]=1677;	 a_val[41]=39;	b_val[41]=1;  r_val[41]=156;
+d_val[42]= 110;	 a_val[42]=10;	b_val[42]=1;  r_val[42]=10;
+d_val[43]= 205;	 a_val[43]=15;	b_val[43]=1;  r_val[43]=20;
+d_val[44]= 483;	 a_val[44]=21;	b_val[44]=1;  r_val[44]=42;
+d_val[45]=2021;	 a_val[45]=43;	b_val[45]=1;  r_val[45]=172;
+d_val[46]=  33;	 a_val[46]= 6;	b_val[46]=1;  r_val[46]=3;
+/* v1=47	    INVALID */
+d_val[48]=  23;	 a_val[48]= 5;	b_val[48]=1;  r_val[48]=2;
+d_val[49]=2397;	 a_val[49]=47;	b_val[49]=1;  r_val[49]=188;
+d_val[50]=  39;	 a_val[50]= 6;	b_val[50]=1;  r_val[50]=3;
+d_val[51]=  53;	 a_val[51]= 7;	b_val[51]=1;  r_val[51]=4;
+/* v1=52	    INVALID */
+d_val[53]=2805;	 a_val[53]=51;	b_val[53]=1;  r_val[53]=204;
+d_val[54]= 182;	 a_val[54]=13;	b_val[54]=1;  r_val[54]=13;
+d_val[55]=3021;	 a_val[55]=53;	b_val[55]=1;  r_val[55]=212;
+d_val[56]=  87;	 a_val[56]= 9;	b_val[56]=1;  r_val[56]=6;
+d_val[57]=3245;	 a_val[57]=55;	b_val[57]=1;  r_val[57]=220;
+d_val[58]= 210;	 a_val[58]=14;	b_val[58]=1;  r_val[58]=14;
+d_val[59]=3477;	 a_val[59]=57;	b_val[59]=1;  r_val[59]=228;
+d_val[60]= 899;	 a_val[60]=29;	b_val[60]=1;  r_val[60]=58;
+d_val[61]= 413;	 a_val[61]=21;	b_val[61]=1;  r_val[61]=28;
+/* v1=62	    INVALID */
+d_val[63]=3965;	 a_val[63]=61;	b_val[63]=1;  r_val[63]=244;
+d_val[64]=1023;	 a_val[64]=31;	b_val[64]=1;  r_val[64]=62;
+d_val[65]= 469;	 a_val[65]=21;	b_val[65]=1;  r_val[65]=28;
+d_val[66]=  17;	 a_val[66]= 4;	b_val[66]=1;  r_val[66]=1;
+d_val[67]=4485;	 a_val[67]=65;	b_val[67]=1;  r_val[67]=260;
+d_val[68]=1155;	 a_val[68]=33;	b_val[68]=1;  r_val[68]=66;
+d_val[69]=4757;	 a_val[69]=67;	b_val[69]=1;  r_val[69]=268;
+d_val[70]=  34;	 a_val[70]= 6;	b_val[70]=1;  r_val[70]=2;
+d_val[71]=5037;	 a_val[71]=69;	b_val[71]=1;  r_val[71]=276;
+d_val[72]=1295;	 a_val[72]=35;	b_val[72]=1;  r_val[72]=70;
+d_val[73]= 213;	 a_val[73]=15;	b_val[73]=1;  r_val[73]=12;
+d_val[74]=  38;	 a_val[74]= 6;	b_val[74]=1;  r_val[74]=2;
+d_val[75]=5621;	 a_val[75]=73;	b_val[75]=1;  r_val[75]=292;
+d_val[76]=1443;	 a_val[76]=37;	b_val[76]=1;  r_val[76]=74;
+d_val[77]= 237;	 a_val[77]=15;	b_val[77]=1;  r_val[77]=12;
+d_val[78]=  95;	 a_val[78]=10;	b_val[78]=1;  r_val[78]=5;
+/* v1=79	    INVALID */
+d_val[80]=1599;	 a_val[80]=39;	b_val[80]=1;  r_val[80]=78;
+d_val[81]=6557;	 a_val[81]=79;	b_val[81]=1;  r_val[81]=316;
+d_val[82]= 105;	 a_val[82]=10;	b_val[82]=1;  r_val[82]=5;
+d_val[83]=  85;	 a_val[83]= 9;	b_val[83]=1;  r_val[83]=4;
+d_val[84]=1763;	 a_val[84]=41;	b_val[84]=1;  r_val[84]=82;
+d_val[85]=7221;	 a_val[85]=83;	b_val[85]=1;  r_val[85]=332;
+d_val[86]= 462;	 a_val[86]=21;	b_val[86]=1;  r_val[86]=21;
+d_val[87]=7565;	 a_val[87]=85;	b_val[87]=1;  r_val[87]=340;
+d_val[88]= 215;	 a_val[88]=15;	b_val[88]=1;  r_val[88]=10;
+d_val[89]=7917;	 a_val[89]=87;	b_val[89]=1;  r_val[89]=348;
+d_val[90]= 506;	 a_val[90]=22;	b_val[90]=1;  r_val[90]=22;
+d_val[91]=8277;	 a_val[91]=89;	b_val[91]=1;  r_val[91]=356;
+d_val[92]= 235;	 a_val[92]=15;	b_val[92]=1;  r_val[92]=10;
+d_val[93]=8645;	 a_val[93]=91;	b_val[93]=1;  r_val[93]=364;
+d_val[94]= 138;	 a_val[94]=12;	b_val[94]=1;  r_val[94]=6;
+d_val[95]=9021;	 a_val[95]=93;	b_val[95]=1;  r_val[95]=372;
+d_val[96]=  47;	 a_val[96]= 7;	b_val[96]=1;  r_val[96]=2;
+d_val[97]=1045;	 a_val[97]=33;	b_val[97]=1;  r_val[97]=44;
+/* v1=98	    INVALID */
+d_val[99]=9797;	 a_val[99]=97;	b_val[99]=1;  r_val[99]=388;
+d_val[100]=  51; a_val[100]= 7; b_val[100]=1; r_val[100]=2;
+
+if (config("resource_debug") & 3) {
+    print "d_val[100] defined";
+    print "a_val[100] defined";
+    print "b_val[100] defined";
+    print "r_val[100] defined";
+}

cal/mersenne.cal

@@ -0,0 +1,61 @@
+/*
+ * mersenne - perform a primality test of 2^p-1, for prime p>1
+ *
+ * Copyright (C) 1999  David I. Bell and Landon Curt Noll
+ *
+ * Primary author:  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: mersenne.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/mersenne.cal,v $
+ *
+ * Under source code control:	1991/05/22 21:56:36
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * NOTE: See lucas.cal for a more general routine.
+ */
+
+
+define mersenne(p)
+{
+	local u, i, p_mask;
+
+	/* firewall */
+	if (! isint(p))
+		quit "p is not an integer";
+
+	/* two is a special case */
+	if (p == 2)
+		return 1;
+
+	/* if p is not prime, then 2^p-1 is not prime */
+	if (! ptest(p,1))
+		return 0;
+
+	/* lltest: u(i+1) = u(i)^2 - 2 mod 2^p-1 */
+	u = 4;
+	for (i = 2; i < p; ++i) {
+		u = hnrmod(u^2 - 2, 1, p, -1);
+	}
+
+	/* 2^p-1 is prime iff u(p) = 0 mod 2^p-1 */
+	return (u == 0);
+}

cal/mfactor.cal

@@ -0,0 +1,319 @@
+/*
+ * mfactor - return the lowest factor of 2^n-1, for n > 0
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: mfactor.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/mfactor.cal,v $
+ *
+ * Under source code control:	1996/07/06 06:09:40
+ * File existed as early as:	1996
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * hset method
+ *
+ * We will assume that mfactor is called with p_elim == 17.
+ *
+ *	n = (the Mersenne exponent we are testing)
+ *	Q = 4*2*3*5*7*11*13*17 (4 * pfact(of some reasonable integer))
+ *
+ * We first determine all values of h mod Q such that:
+ *
+ *	gcd(h*n+1, Q) == 1   and   h*n+1 == +/-1 mod 8
+ *
+ * There will be 2*1*2*4*6*10*12*16 such values of h.
+ *
+ * For efficiency, we keep the difference between consecutive h values
+ * in the hset[] difference array with hset[0] being the first h value.
+ * Last, we multiply the hset[] values by n so that we only need
+ * to add sequential values of hset[] to get factor candidates.
+ *
+ * We need only test factors of the form:
+ *
+ *	(Q*g*n + hx) + 1
+ *
+ * where:
+ *
+ *	g is an integer >= 0
+ *	hx is computed from hset[] difference value described above
+ *
+ * Note that (Q*g*n + hx) is always even and that hx is a multiple
+ * of n.  Thus the typical factor form:
+ *
+ *	2*k*n + 1
+ *
+ * implies that:
+ *
+ *	k = (Q*g + hx/n)/2
+ *
+ * This allows us to quickly eliminate factor values that are divisible
+ * by 2, 3, 5, 7, 11, 13 or 17.	 (well <= p value found below)
+ *
+ * The following loop shows how test_factor is advanced to higher test
+ * values using hset[].	 Here, hcount is the number of elements in hset[].
+ * It can be shown that hset[0] == 0.  We add hset[hcount] to the hset[]
+ * array for looping control convenience.
+ *
+ *	(* increase test_factor thru other possible test values *)
+ *	test_factor = 0;
+ *	hindx = 0;
+ *	do {
+ *		while (++hindx <= hcount) {
+ *			test_factor += hset[hindx];
+ *		}
+ *		hindx = 0;
+ *	} while (test_factor < some_limit);
+ *
+ * The test, mfactor(67, 1, 10000) took on an 200 Mhz r4k (user CPU seconds):
+ *
+ *	210.83	(prior to use of hset[])
+ *	 78.35	(hset[] for p_elim = 7)
+ *	 73.87	(hset[] for p_elim = 11)
+ *	 73.92	(hset[] for p_elim = 13)
+ *	234.16	(hset[] for p_elim = 17)
+ *	p_elim == 19 requires over 190 Megs of memory
+ *
+ * Over a long period of time, the call to load_hset() becomes insignificant.
+ * If we look at the user CPU seconds from the first 10000 cycle to the
+ * end of the test we find:
+ *
+ *	205.00	(prior to use of hset[])
+ *	 75.89	(hset[] for p_elim = 7)
+ *	 73.74	(hset[] for p_elim = 11)
+ *	 70.61	(hset[] for p_elim = 13)
+ *	 57.78	(hset[] for p_elim = 17)
+ *	 p_elim == 19 rejected because of memory size
+ *
+ * The p_elim == 17 overhead takes ~3 minutes on an 200 Mhz r4k CPU and
+ * requires about ~13 Megs of memory.  The p_elim == 13 overhead
+ * takes about 3 seconds and requires ~1.5 Megs of memory.
+ *
+ * The value p_elim == 17 is best for long factorizations.  It is the
+ * fastest even thought the initial startup overhead is larger than
+ * for p_elim == 13.
+ *
+ * NOTE: The values above are prior to optimizations where hset[] was
+ *	 multiplied by n plus other optimizations.  Thus, the CPU
+ *	 times you may get will not likely match the above values.
+ */
+
+
+/*
+ * mfactor - find a factor of a Mersenne Number
+ *
+ * Mersenne numbers are numbers of the form:
+ *
+ *	2^n-1	for integer n > 0
+ *
+ * We know that factors of a Mersenne number are of the form:
+ *
+ *	2*k*n+1	  and	+/- 1 mod 8
+ *
+ * We make use of the hset[] difference array to eliminate factor
+ * candidates that would otherwise be divisible by 2, 3, 5, 7 ... p_elim.
+ *
+ * given:
+ *	n		attempt to factor M(n) = 2^n-1
+ *	start_k		the value k in 2*k*n+1 to start the search (def: 1)
+ *	rept_loop	loop cycle reporting (def: 10000)
+ *	p_elim		largest prime to eliminate from test factors (def: 17)
+ *
+ * returns:
+ *	factor of (2^n)-1
+ *
+ * NOTE: The p_elim argument is optional and defaults to 17.  A p_elim value
+ *	 of 17 is faster than 13 for even medium length runs.  However 13
+ *	 uses less memory and has a shorter startup time.
+ */
+define mfactor(n, start_k, rept_loop, p_elim)
+{
+	local Q;	/* 4*pfact(p_elim), hset[] cycle size */
+	local hcount;	/* elements in the hset[] difference array */
+	local loop;	/* report loop count */
+	local q;	/* test factor of 2^n-1 */
+	local g;	/* g as in test candidate form: (Q*g*hset[i])*n + 1 */
+	local hindx;	/* hset[] index */
+	local i;
+	local tmp;
+	local tmp2;
+
+	/*
+	 * firewall
+	 */
+	if (!isint(n) || n <= 0) {
+		quit "n must be an integer > 0";
+	}
+	if (!isint(start_k)) {
+		start_k = 1;
+	} else if (!isint(start_k) || start_k <= 0) {
+		quit "start_k must be an integer > 0";
+	}
+	if (!isint(rept_loop)) {
+		rept_loop = 10000;
+	}
+	if (rept_loop < 1) {
+		quit "rept_loop must be an integer > 0";
+	}
+	if (!isint(p_elim)) {
+		p_elim = 17;
+	}
+	if (p_elim < 3) {
+		quit "p_elim must be an integer > 2 (try 13 or 17)";
+	}
+
+	/*
+	 * declare our global values
+	 */
+	Q = 4*pfact(p_elim);
+	hcount = 2;
+	/* allocate the h difference array */
+	for (i=2; i <= p_elim; i = nextcand(i)) {
+		hcount *= (i-1);
+	}
+	local mat hset[hcount+1];
+
+	/*
+	 * load the hset[] difference array
+	 */
+	{
+		local x;	/* h*n+1 mod 8 */
+		local h;	/* potential h value */
+		local last_h;	/* previous valid h value */
+
+		last_h = 0;
+		for (i=0,h=0; h < Q; ++h) {
+			if (gcd(h*n+1,Q) == 1) {
+				x = (h*n+1) % 8;
+				if (x == 1 || x == 7) {
+					hset[i++] = (h-last_h) * n;
+					last_h = h;
+				}
+			}
+		}
+		hset[hcount] = Q*n - last_h*n;
+	}
+
+	/*
+	 * setup
+	 *
+	 * determine the next g and hset[] index (hindx) values such that:
+	 *
+	 *	2*start_k <= (Q*g + hset[hindx])
+	 *
+	 * and (Q*g + hset[hindx]) is a minimum and where:
+	 *
+	 *	Q = (4 * pfact(of some reasonable integer))
+	 *	g = (some integer) (hset[] cycle number)
+	 *
+	 * We also compute 'q', the next test candidate.
+	 */
+	g = (2*start_k) // Q;
+	tmp = 2*start_k - Q*g;
+	for (tmp2=0, hindx=0;
+	     hindx < hcount && (tmp2 += hset[hindx]/n) < tmp;
+	     ++hindx) {
+	}
+	if (hindx == hcount) {
+		/* we are beyond the end of a hset[] cycle, start at the next */
+		++g;
+		hindx = 0;
+		tmp2 = hset[0]/n;
+	}
+	q = (Q*g + tmp2)*n + 1;
+
+	/*
+	 * look for a factor
+	 *
+	 * We ignore factors that themselves are divisible by a prime <=
+	 * some small prime p.
+	 *
+	 * This process is guaranteed to find the smallest factor
+	 * of 2^n-1.  A smallest factor of 2^n-1 must be prime, otherwise
+	 * the divisors of that factor would also be factors of 2^n-1.
+	 * Thus we know that if a test factor itself is not prime, it
+	 * cannot be the smallest factor of 2^n-1.
+	 *
+	 * Eliminating all non-prime test factors would take too long.
+	 * However we can eliminate 80.81% of the test factors
+	 * by not using test factors that are divisible by a prime <= 17.
+	 */
+	if (pmod(2,n,q) == 1) {
+		return q;
+	} else {
+		/* report this loop */
+		printf("at 2*%d*%d+1, cpu: %f\n",
+			(q-1)/(2*n), n, runtime());
+		fflush(files(1));
+		loop = 0;
+	}
+	do {
+		/*
+		 * determine if we need to report
+		 *
+		 * NOTE: (q-1)/(2*n) is the k value from 2*k*n + 1.
+		 */
+		if (rept_loop <= ++loop) {
+			/* report this loop */
+			printf("at 2*%d*%d+1, cpu: %f\n",
+				(q-1)/(2*n), n, runtime());
+			fflush(files(1));
+			loop = 0;
+		}
+
+		/*
+		 * skip if divisable by a prime <= 449
+		 *
+		 * The value 281 was determined by timing loops
+		 * which found that 281 was at or near the
+		 * minimum time to factor 2^(2^127-1)-1.
+		 *
+		 * The addition of the do { ... } while (factor(q, 449)>1);
+		 * loop reduced the factoring loop time (36504 k values with
+		 * the hset[] initialization time removed) from 25.69 sec to
+		 * 15.62 sec of CPU time on a 200Mhz r4k.
+		 */
+		do {
+			/*
+			 * determine the next factor candidate
+			 */
+			q += hset[++hindx];
+			if (hindx >= hcount) {
+				hindx = 0;
+				/*
+				 * if we cared about g,
+				 * then we wound ++g here too
+				 */
+			}
+		} while (factor(q, 449) > 1);
+	} while (pmod(2,n,q) != 1);
+
+	/*
+	 * return the factor found
+	 *
+	 * q is a factor of (2^n)-1
+	 */
+	return q;
+}
+
+if (config("resource_debug") & 3) {
+	print "mfactor(n [, start_k=1 [, rept_loop=10000 [, p_elim=17]]])"
+}

cal/mod.cal

@@ -1,23 +1,44 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * mod - routines to handle numbers modulo a specified number
  *
- * Routines to handle numbers modulo a specified number.
- *	a (mod N)
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: mod.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/mod.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:34
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 obj mod {a};			/* definition of the object */
 
 global mod_value = 100;		/* modulus value (value of N) */
 
 
-define mod(a)
+define lmod(a)
 {
 	local obj mod	x;
 
 	if (!isreal(a) || !isint(a))
-		quit "Bad argument for mod function";
+		quit "Bad argument for lmod function";
 	x.a = a % mod_value;
 	return x;
 }
@@ -34,7 +55,7 @@ define mod_print(a)
 
 define mod_one()
 {
-	return mod(1);
+	return lmod(1);
 }
 
 
@@ -51,9 +72,9 @@ define mod_cmp(a, b)
 define mod_rel(a, b)
 {
 	if (isnum(a))
-		a = mod(a);
+		a = lmod(a);
 	if (isnum(b))
-		b = mod(b);
+		b = lmod(b);
 	if (a.a < b.a)
 		return -1;
 	return a.a != b.a;
@@ -159,13 +180,13 @@ define mod_inv(a)
 
 define mod_div(a, b)
 {
-	local c, x, y;
-
-	obj mod x, y;
+	local c;
+	local obj mod x;
+	local obj mod y;
 	if (isnum(a))
-		a = mod(a);
+		a = lmod(a);
 	if (isnum(b))
-		b = mod(b);
+		b = lmod(b);
 	c = gcd(a.a, b.a);
 	x.a = a.a / c;
 	y.a = b.a / c;
@@ -189,23 +210,8 @@ define mod_pow(a, b)
 }
 
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
     print "obj mod {a} defined";
-    print "mod(a) defined";
-    print "mod_print(a) defined";
-    print "mod_one(a) defined";
-    print "mod_cmp(a, b) defined";
-    print "mod_rel(a, b) defined";
-    print "mod_add(a, b) defined";
-    print "mod_sub(a, b) defined";
-    print "mod_mod(a, b) defined";
-    print "mod_square(a) defined";
-    print "mod_inc(a) defined";
-    print "mod_dec(a) defined";
-    print "mod_inv(a) defined";
-    print "mod_div(a, b) defined";
-    print "mod_pow(a, b) defined";
     print "mod_value defined";
     print "set mod_value as needed";
 }

cal/natnumset.cal

@@ -0,0 +1,616 @@
+/*
+ * natnumset - functions for sets of natural numbers not exceeding a fixed bound
+ *
+ * Copyright (C) 1999  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: natnumset.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/natnumset.cal,v $
+ *
+ * Under source code control:	1997/09/07 23:53:51
+ * File existed as early as:	1997
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Functions for sets of natural numbers not exceeding a fixed bound B.
+ *
+ * The default value for B is 100; B may be assigned another
+ * value n by setbound(n); with no argument, setbound() returns the current
+ * upper bound.
+ *
+ * A set S is stored as an object with one element with one component S.s;
+ * This component is a string of just sufficient size to include m bits,
+ * where m is the maximum integer in S.
+ *
+ * With zero or more integer arguments, set(a, b, ...) returns the set
+ * whose elements are those of a, b, ... in [0, B].  Note that arguments
+ * < 0 or > B are ignored.
+ *
+ * In an assignment of a set-valued lvalue to an lvalue, as in
+ *
+ *		A = set(1,2,3);
+ *		B = A;
+ *
+ * the sets share the same data string, so a change to either has the effect
+ * of changing both.  A set equal to A but with a different string can be
+ * created by
+ *
+ *		B = A | set()
+ *
+ * The functions empty() and full() return the empty set and the set of all
+ * integers in [0,B] respectively.
+ *
+ * isset(A) returns 1 or 0 according as A is or is not a set
+ *
+ * test(A) returns 0 or 1 according as A is or is not the empty set
+ *
+ * isin(A, n) for set A and integer n returns 1 if n is in A, 0 if
+ *	0 <= n <= B and n is not in A, the null value if n < 0 or n > B.
+ *
+ * addmember(A, n) adds n as a member of A, provided n is in [0, B];
+ *	 this is also achieved by A |= n.
+ *
+ * rmmember(A, n) removes n from A if it is a member; this is also achieved
+ *	by A \= n.
+ *
+ * The following unary and binary operations are defined for sets A, B.
+ *	For binary operations with one argument a set and the other an
+ *	integer n, the integer taken to represent set(n).
+ *
+ *	A | B = union of A and B, integers in at least one of A and B
+ *	A & B = intersection of A and B, integers in both A and B
+ *	A ~ B = symmetric difference (boolean sum) of A and Bi, integers
+ *			in exactly one of A and B
+ *	A \ B = set difference, integers in A but not in B
+ *
+ *	~A	= complement of A, integers not in A
+ *	#A	= number ofintegers in A
+ *	!A	= 1 or 0 according as A is empty or not empty
+ *	+A	= sum of the members of A
+ *
+ *	min(A)	= least member of A, -1 for empty set
+ *	max(A)	= greatest member of A, -1 for empty set
+ *	sum(A)	= sum of the members of A
+ *
+ * In the following a and b denote arbitrary members of A and B:
+ *
+ *	A + B = set of sums a + b
+ *	A - B = set of differences a - b
+ *	A * B = set of products a * b
+ *	A ^ n = set of powers a ^ n
+ *	A % m = set of integers congruent to a mod m
+ *
+ *	A == B returns 1 or not according as A and B are equal or not
+ *	A != B = !(A == B)
+ *	A <= B returns 1 if A is a subset of B, i.e. every member of A is
+ *		a member of B
+ *	A < B = ((A <= B) && (A != B))
+ *	A >= B = (B <= A)
+ *	A > B = (B < A)
+ *
+ * Expresssions may be formed from the above "arithmetic" operations in
+ * the usual way, with parentheses for variations from the usual precedence
+ * rules.  For example
+ *
+ *	A + 3 * A ^ 2 + (A - B) ^ 3
+ *
+ * returns the set of integers expressible as
+ *
+ *	a_1 + 3 * a_2 ^ 2 + (a_3 - b) ^3
+ *
+ * where a_1, a_2, a_3 are in A, and b is in B.
+ *
+ * primes(a, b) returns the set of primes between a and b inclusive.
+ *
+ * interval(a, b) returns the integers between a and b inclusive
+ *
+ * isinterval(A) returns 1 if A is a non-empty interval, 0 otherwise.
+ *
+ * randset(n, a, b) returns a random set of n integers between a and b
+ *	inclusive; a defaults to 0, b to N-1.  An error occurs if
+ *	n is too large.
+ *
+ * polyvals(L, A) for L = list(c_0, c_1, c_2, ...) returns the set of
+ * values of
+ *
+ *	c_0 + c_1 * a + c_2 * a^2 + ...
+ *
+ * for a in the set A.
+ *
+ * polyvals2(L, A, B) returns the set of values of poly(L, i, j) for i in
+ *	A and j in B.  Here L is a list whose members are integers or
+ *	lists of integers, the latter representing polynomials in the
+ *	second variable.  For example, with L = list(0, list(0, 1), 1),
+ *	polyvals2(L, A, B) will return the values of i^2 + i * j for
+ *	i in A, j in B.
+ *
+ */
+
+
+static N;		/* Number of integers in [0,B], = B + 1 */
+static M;		/* Maximum string size required, = N // 8 */
+
+obj set {s};
+
+define isset(a) = istype(a, obj set);
+
+define setbound(n)
+{
+	local v;
+
+	v = N - 1;
+	if (isnull(n))
+		return v;
+	if (!isint(n) || n < 0)
+		quit "Bad argument for setbound";
+	N = n + 1;
+	M = quo(N, 8, 1);	/* M // 8 rounded up */
+	if (v >= 0)
+		return v;
+}
+
+setbound(100);
+
+define empty() = obj set = {""};
+
+define full()
+{
+	local v;
+
+	obj set v;
+	v.s = M * char(-1);
+	if (!ismult(N, 8)) v.s[M-1] = 255 >> (8 - N & 7);
+	return v;
+}
+
+define isin(a, b)
+{
+	if (!isset(a) || !isint(b))
+		quit "Bad argument for isin";
+	return bit(a.s, b);
+}
+
+define addmember(a, n)
+{
+	if (!isset(a) || !isint(n))
+		quit "Bad argument for addmember";
+	if (n < N && n >= 0)
+		setbit(a.s, n);
+}
+
+define rmmember(a, n)
+{
+	if (n < N && n >= 0)
+		setbit(a.s, n, 0);
+}
+
+define set()
+{
+	local i, v, s;
+
+	s = M * char(0);
+	for (i = 1; i <= param(0); i++) {
+		v = param(i);
+		if (!isint(v))
+			quit "Non-integral argument for set";
+		if (v >= 0 && v < N)
+			setbit(s, v);
+	}
+	return mkset(s);
+}
+
+
+define mkset(s)
+{
+	local h, m;
+
+	if (!isstr(s))
+		quit "Non-string argument for mkset";
+	h = highbit(s);
+	if (h >= N)
+		quit "Too-long string for mkset";
+	m = quo(h + 1, 8, 1);
+	return obj set = {head(s, m)};
+}
+
+
+define primes(a,b)
+{
+	local i, s, m;
+
+	if (isnull(b)) {
+		if (isnull(a)) {
+			a = 0;
+			b = N - 1;
+		}
+		else b = 0;
+	}
+
+	if (!isint(a) || !isint(b))
+		quit "Non-integer argument for primes";
+	if (a > b)
+		swap(a,b);
+	if (b < 0 || a >= N)
+		return empty();
+	a = max(a, 0);
+	b = min(b, N-1);
+	s = M * char(0);
+	for (i = a; i <= b; i++)
+		if (isprime(i))
+			setbit(s, i);
+	return mkset(s);
+}
+
+define set_max(a) = highbit(a.s);
+
+define set_min(a) = lowbit(a.s);
+
+define set_not(a) = !a.s;
+
+define set_cmp(a,b)
+{
+	if (isset(a) && isset(b))
+		return a.s != b.s;
+	return 1;
+}
+
+define set_rel(a,b)
+{
+	local c;
+
+	if (a == b)
+		return 0;
+	if (isset(a)) {
+		if (isset(b)) {
+			c = a & b;
+			if (c == a)
+				return -1;
+			if (c == b)
+				return 1;
+			return;
+		}
+		if (!isint(b))
+			return set_rel(a, set(b));
+	}
+	if (isint(a))
+		return set_rel(set(a), b);
+}
+
+
+define set_or(a, b)
+{
+	if (isset(a)) {
+		if (isset(b))
+			return obj set = {a.s | b.s};
+		if (isint(b))
+			return a | set(b);
+	}
+	if (isint(a))
+		return set(a) | b;
+	return newerror("Bad argument for set_or");
+}
+
+define set_and(a, b)
+{
+	if (isint(a))
+		return set(a) & b;
+	if (isint(b))
+		return a & set(b);
+	if (!isset(a) || !isset(b))
+		return newerror("Bad argument for set_and");
+	return mkset(a.s & b.s);
+}
+
+
+define set_comp(a) = full() \ a;
+
+define set_setminus(a,b)
+{
+	if (isint(a))
+		return set(a) \ b;
+	if (isint(b))
+		return a \ set(b);
+	if (!isset(a) || !isset(b))
+		return newerror("Bad argument for set_setminus");
+	return mkset(a.s \ b.s);
+}
+
+
+define set_xor(a,b)
+{
+	if (isint(a))
+		return set(a) ~ b;
+	if (isint(b))
+		return a ~ set(b);
+	if (!isset(a) || !isset(b))
+		return newerror("Bad argument for set_xor");
+	return mkset(a.s ~ b.s);
+}
+
+define set_content(a) = #a.s;
+
+define set_add(a, b)
+{
+	local s, i, j, m, n;
+
+	if (isint(a))
+		return set(a) + b;
+	if (isint(b))
+		return a + set(b);
+	if (!isset(a) || !isset(b))
+		return newerror("Bad argument for set_add");
+	if (!a || !b)
+		return empty();
+	m = highbit(a.s);
+	n = highbit(b.s);
+	s = M * char(0);
+	for (i = 0; i <= m; i++)
+		if (isin(a, i))
+			for (j = 0; j <= n && i + j < N; j++)
+				if (isin(b, j))
+					setbit(s, i + j);
+	return mkset(s);
+}
+
+define set_sub(a,b)
+{
+	local s, i, j, m, n;
+
+	if (isint(b))
+		return a - set(b);
+	if (isint(a))
+		return set(a) - b;
+	if (isset(a) && isset(b)) {
+		if (!a || !b)
+			return empty();
+		m = highbit(a.s);
+		n = highbit(b.s);
+		s = M * char(0);
+		for (i = 0; i <= m; i++)
+			if (isin(a, i))
+				for (j = 0; j <= n && j <= i; j++)
+					if (isin(b, j))
+						setbit(s, i - j);
+		return mkset(s);
+	}
+	return newerror("Bad argument for set_sub");
+}
+
+define set_mul(a, b)
+{
+	local s, i, j, m, n;
+
+	if (isset(a)) {
+		s = M * char(0);
+		m = highbit(a.s);
+		if (isset(b)) {
+			if (!a || !b)
+				return empty();
+			n = highbit(b.s);
+			for (i = 0; i <= m; ++i)
+				if (isin(a, i))
+					for (j = 1; j <= n && i * j < N; ++j)
+						if (isin(b, j))
+							setbit(s, i * j);
+			return mkset(s);
+		}
+		if (isint(b)) {
+			if (b == 0) {
+				if (a)
+					return set(0);
+				return empty();
+			}
+			s = M * char(0);
+			for (i = 0; i <= m && b * i < N; ++i)
+				if (isin(a, i))
+					setbit(s, b * i);
+			return mkset(s);
+		}
+	}
+	if (isint(a))
+		return b * a;
+	return newerror("Bad argument for set_mul");
+}
+
+define set_square(a)
+{
+	local s, i, m;
+
+	s = M * char(0);
+	m = highbit(a.s);
+	for (i = 0; i <= m && i^2 < N; ++i)
+		if (bit(a.s, i))
+			setbit(s, i^2);
+	return mkset(s);
+}
+
+define set_pow(a, n)
+{
+	local s, i, m;
+
+	if (!isint(n) || n < 0)
+		quit "Bad exponent for set_power";
+	s = M * char(0);
+	m = highbit(a.s);
+	for (i = 0; i <= m && i^n < N; ++i)
+		if (bit(a.s, i))
+			setbit(s, i^n);
+	return mkset(s);
+}
+
+define set_sum(a)
+{
+	local v, m, i;
+
+	v = 0;
+	m = highbit(a.s);
+	for (i = 0; i <= m; ++i)
+		if (bit(a.s, i))
+			v += i;
+	return v;
+}
+
+define set_plus(a) = set_sum(a);
+
+define interval(a, b)
+{
+	local i, j, s;
+	static tail = str("\0\1\3\7\17\37\77\177\377");
+
+	if (!isint(a) || !isint(b))
+		quit "Non-integer argument for interval";
+	if (a > b)
+		swap(a, b);
+	if (b < 0 || a >= N)
+		return empty();
+	a = max(a, 0);
+	b = min(b, N-1);
+	i = quo(a, 8, 0);
+	j = quo(b, 8, 0);
+	s = M * char(0);
+	if (i == j) {
+		s[i] = tail[b + 1 - 8 * i] \ tail[a - 8 * i];
+		return mkset(s);
+	}
+	s[i] = ~tail[a - 8 * i];
+	while (++i < j)
+		s[i] = -1;
+	s[j] = tail[b + 1 - 8 * j];
+	return mkset(s);
+}
+
+define isinterval(a)
+{
+	local i, max, s;
+
+	if (!isset(a))
+		quit "Non-set argument for isinterval";
+
+	s = a.s;
+	if (!s)
+		return 0;
+	for (i = lowbit(s) + 1, max = highbit(s); i < max; i++)
+		if (!bit(s, i))
+			return 0;
+	return 1;
+}
+
+define set_mod(a, b)
+{
+	local s, m, i, j;
+
+	if (isset(a) && isint(b)) {
+		s = M * char(0);
+		m = highbit(a.s);
+		for (i = 0; i <= m; i++)
+			if (bit(a.s, i))
+				for (j = 0; j < N; j++)
+					if (meq(i, j, b))
+						setbit(s, j);
+		return mkset(s);
+	}
+	return newerror("Bad argument for set_mod");
+}
+
+define randset(n, a, b)
+{
+	local m, s, i;
+
+	if (isnull(a))
+		a = 0;
+	if (isnull(b))
+		b = N - 1;
+	if (!isint(n) || !isint(a) || !isint(b) || n < 0 || a < 0 || b < 0)
+		quit "Bad argument for randset";
+	if (a > b)
+		swap(a, b);
+	m = b - a + 1;
+	if (n > m)
+		return newerror("Too many numbers specified for randset");
+	if (2 * n > m)
+		return interval(a,b) \ randset(m - n, a, b);
+	++b;
+	s = M * char(0);
+	while (n-- > 0) {
+		do
+			i = rand(a, b);
+		while
+			(bit(s, i));
+		setbit(s, i);
+	}
+	return mkset(s);
+}
+
+define polyvals(L, A)
+{
+	local s, m, v, i;
+
+	if (!islist(L))
+		quit "Non-list first argument for polyvals";
+	if (!isset(A))
+		quit "Non-set second argument for polyvals";
+	m = highbit(A.s);
+	s = M * char(0);
+	for (i = 0; i <= m; i++)
+		if (bit(A.s, i)) {
+			v = poly(L,i);
+			if (v >> 0 && v < N)
+				setbit(s, v);
+		}
+	return mkset(s);
+}
+
+define polyvals2(L, A, B)
+{
+	local s1, s2, s, m, n, i, j, v;
+
+	s1 = A.s;
+	s2 = B.s;
+	m = highbit(s1);
+	n = highbit(s2);
+	s = M * char(0);
+	for (i = 0; i <= m; i++)
+		if (bit(s1, i))
+			for (j = 0; j <= n; j++)
+				if (bit(s2, j)) {
+					v = poly(L, i, j);
+					if (v >= 0 && v < N)
+						setbit(s, v);
+				}
+	return mkset(s);
+}
+
+define set_print(a)
+{
+	local i, s, m;
+
+	s = a.s;
+	i = lowbit(s);
+	print "set(":;
+	if (i >= 0) {
+		print i:;
+		m = highbit(s);
+		while (++i <= m)
+			if (bit(s, i))
+				print ",":i:;
+	}
+	print ")",;
+}
+
+local N, M;	/* End scope of static variables N, M */

cal/pell.cal

@@ -0,0 +1,94 @@
+/*
+ * pell - solve Pell's equation
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: pell.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/pell.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:34
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Solve Pell's equation; Returns the solution X to: X^2 - D * Y^2 = 1.
+ * Type the solution to pells equation for a particular D.
+ */
+
+
+define pell(D)
+{
+	local X, Y;
+
+	X = pellx(D);
+	if (isnull(X)) {
+		print "D=":D:" is square";
+		return;
+	}
+	Y = isqrt((X^2 - 1) / D);
+	print X : "^2 - " : D : "*" : Y : "^2 = " : X^2 - D*Y^2;
+}
+
+
+/*
+ * Function to solve Pell's equation
+ * Returns the solution X to:
+ *	X^2 - D * Y^2 = 1
+ */
+define pellx(D)
+{
+	local R, Rp, U, Up, V, Vp, A, T, Q1, Q2, n;
+	local mat ans[2,2];
+	local mat tmp[2,2];
+
+	R = isqrt(D);
+	Vp = D - R^2;
+	if (Vp == 0)
+		return;
+	Rp = R + R;
+	U = Rp;
+	Up = U;
+	V = 1;
+	A = 0;
+	n = 0;
+	ans[0,0] = 1;
+	ans[1,1] = 1;
+	tmp[0,1] = 1;
+	tmp[1,0] = 1;
+	do {
+		T = V;
+		V = A * (Up - U) + Vp;
+		Vp = T;
+		A = U // V;
+		Up = U;
+		U = Rp - U % V;
+		tmp[0,0] = A;
+		ans *= tmp;
+		n++;
+	} while (A != Rp);
+	Q2 = ans[[1]];
+	Q1 = isqrt(Q2^2 * D + 1);
+	if (isodd(n)) {
+		T = Q1^2 + D * Q2^2;
+		Q2 = Q1 * Q2 * 2;
+		Q1 = T;
+	}
+	return Q1;
+}

cal/pi.cal

@@ -0,0 +1,147 @@
+/*
+ * pi - various routines to calculate pi
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: pi.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/pi.cal,v $
+ *
+ * Under source code control:	1991/05/22 21:56:37
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Calculate pi within the specified epsilon using the quartic convergence
+ * iteration.
+ */
+
+
+define qpi(epsilon)
+{
+	local niter, yn, ym, tm, an, am, t, tn, sqrt2, epsilon2, count, digits;
+	local bits, bits2;
+
+	if (isnull(epsilon))
+		epsilon = epsilon();
+	digits = digits(1/epsilon);
+	if	(digits <=  8) { niter = 1; epsilon =	1e-8; }
+	else if (digits <= 40) { niter = 2; epsilon =  1e-40; }
+	else if (digits <= 170) { niter = 3; epsilon = 1e-170; }
+	else if (digits <= 693) { niter = 4; epsilon = 1e-693; }
+	else {
+		niter = 4;
+		t = 693;
+		while (t < digits) {
+			++niter;
+			t *= 4;
+		}
+	}
+	epsilon2 = epsilon/(digits/10 + 1);
+	digits = digits(1/epsilon2);
+	sqrt2 = sqrt(2, epsilon2);
+	bits = abs(ilog2(epsilon)) + 1;
+	bits2 = abs(ilog2(epsilon2)) + 1;
+	yn = sqrt2 - 1;
+	an = 6 - 4 * sqrt2;
+	tn = 2;
+	for (count = 0; count < niter; count++) {
+		ym = yn;
+		am = an;
+		tn *= 4;
+		t = sqrt(sqrt(1-ym^4, epsilon2), epsilon2);
+		yn = (1-t)/(1+t);
+		an = (1+yn)^4*am-tn*yn*(1+yn+yn^2);
+		yn = bround(yn, bits2);
+		an = bround(an, bits2);
+	}
+	return (bround(1/an, bits));
+}
+
+
+/*
+ * Print digits of PI forever, neatly formatted, using calc.
+ *
+ * Written by Klaus Alexander Seistrup <klaus@seistrup.dk>
+ * on a dull Friday evening in November 1999.
+ *
+ * Inspired by an algorithm conceived by Lambert Meertens.
+ *
+ * See also the ABC Programmer's Handbook, by Geurts, Meertens & Pemberton,
+ * published by Prentice-Hall (UK) Ltd., 1990.
+ *
+ */
+
+define piforever()
+{
+	local k = 2;
+	local a = 4;
+	local b = 1;
+	local a1 = 12;
+	local b1 = 4;
+	local a2, b2, p, q, d, d1;
+	local stdout = files(1);
+	local first = 1, row = -1, col = 0;
+
+	while (1) {
+		/*
+		* Next approximation
+		*/
+		p = k * k;
+		q = k + k++;
+
+		a2 = a;
+		b2 = b;
+
+		a = a1;
+		a1 = p * a2 + q * a1;
+		b = b1;
+		b1 = p * b2 + q * b1;
+
+		/*
+		* Print common digits
+		*/
+		d = a // b;
+		d1 = a1 // b1;
+
+		while (d == d1) {
+			if (first) {
+				printf("%d.", d);
+				first = 0;
+			} else {
+				if (!(col % 50)) {
+					printf("\n");
+					col = 0;
+					if (!(++row % 20)) {
+						printf("\n");
+						row = 0;
+					}
+				}
+				printf("%d", d);
+				if (!(++col % 10))
+					printf(" ");
+			}
+			a = 10 * (a % b);
+			a1 = 10 * (a1 % b1);
+			d = a // b;
+			d1 = a1 // b1;
+		}
+		fflush(stdout);
+	}
+}

cal/pix.cal

@@ -0,0 +1,71 @@
+/*
+ * pix - iterative method of finding the number of primes less than x
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: pix.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/pix.cal,v $
+ *
+ * Under source code control:	1996/07/09 03:14:14
+ * File existed as early as:	1996
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Here is an iterative method of finding the number of primes less than
+ * or equal to a given number.	This method is from "Computer Recreations"
+ * June 1996 issue of Scientific American.
+ *
+ * NOTE: For reasonable values of x, the builtin function pix(x) is
+ *	 much faster.  This code is provided because the method
+ *	 is interesting.
+ */
+
+
+define pi_of_x(x)
+{
+	local An;	/* A(n) */
+	local An1;	/* A(n-1) */
+	local An2;	/* A(n-2) */
+	local An3;	/* A(n-3) */
+	local primes;	/* number of primes found */
+	local n;	/* loop counter */
+
+	/*
+	 * setup
+	 */
+	An1 = 2;
+	An2 = 0;
+	An3 = 3;
+	primes = 1;
+
+	/*
+	 * main A(n+1)=A(n-1)+A(n-2) sequence loop
+	 */
+	for (n = 3; n < x; ++n) {
+		An = An2 + An3;
+		An3 = An2;
+		An2 = An1;
+		An1 = An;
+		if (An % n == 0)
+			++primes;
+	}
+	return primes;
+}

cal/pollard.cal

@@ -0,0 +1,52 @@
+/*
+ * pollard - factor using Pollard's p-1 method
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: pollard.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/pollard.cal,v $
+ *
+ * Under source code control:	1991/05/22 21:56:37
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+define pfactor(N, B, ai, af)
+{
+	local	a, k, i, d;
+
+	if (isnull(B))
+		B = 1000;
+	if (isnull(ai))
+		ai = 2;
+	if (isnull(af))
+		af = ai + 20;
+	k = lcmfact(B);
+	d = lfactor(N, B);
+	if (d > 1)
+		return d;
+	for (a = ai; a <= af; a++) {
+		i = pmod(a, k, N);
+		d = gcd(i - 1, N);
+		if ((d > 1) && (d != N))
+			return d;
+	}
+	return 1;
+}

cal/poly.cal

@@ -1,6 +1,35 @@
+/*
+ * poly - calculate with polynomials of one variable
+ *
+ * Copyright (C) 1999  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: poly.cal,v 29.1 1999/12/14 09:15:31 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/poly.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:35
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
 /*
  * A collection of functions designed for calculations involving
- * 	polynomials in one variable (by Ernest W. Bowen).
+ *	polynomials in one variable (by Ernest W. Bowen).
  *
  * On starting the program the independent variable has identifier x
  *	and name "x", i.e. the user can refer to it as x, the
@@ -24,25 +53,25 @@
  *	would assign to q a number value.  As with number expressions
  *	involving operations, the expression used to define the
  *	polynomial is usually lost; in the above example, the normal
- *	computer display for p will be  x^2 - 2x + 1.  Different
+ *	computer display for p will be	x^2 - 2x + 1.  Different
  *	identifiers may of course have the same polynomial value.
  *
  * The polynomial we think of as a_0 + a_1 * x + ... + a_n * x^n,
  *	for number coefficients a_0, a_1, ... a_n may also be
- *	constructed as pol(a_0, a_1, ..., a_n).  Note that here the
+ *	constructed as pol(a_0, a_1, ..., a_n).	 Note that here the
  *	coefficients are to be in ascending power order.  The independent
  *	variable is pol(0,1), so to use t, say, as an identifier for
  *	this, one may assign  t = pol(0,1).  To simultaneously specify
  *	an identifier and a name for the independent variable, there is
- *	the instruction var, used as in identifier = var(name).  For
+ *	the instruction var, used as in identifier = var(name).	 For
  *	example, to use "t" in the way "x" is initially, one may give
- *	the instruction  t = var("t").
+ *	the instruction	 t = var("t").
  *
  * There are four parameters pmode, order, iod and ims for controlling
  *	the format in which polynomials are displayed.
  *	The parameter pmode may have values "alg" or "list": the
  *	former gives a display as an algebraic formula, while
- *	the latter only lists the coefficients.  Whether the terms or
+ *	the latter only lists the coefficients.	 Whether the terms or
  *	coefficients are in ascending or descending power order is
  *	controlled by order being "up" or "down".  If the
  *	parameter iod (for integer-only display), the polynomial
@@ -69,7 +98,7 @@
  *	polynomial, list or matrix were a function.  For example,
  *	if a = 1 + x^2, a(2) will return the value 5, just as if
  *			define a(t) = 1 + t^2;
- *	had been used.   However, when the polynomial definition is
+ *	had been used.	 However, when the polynomial definition is
  *	used, changing the polynomial a will change a(t) to the value
  *	of the new polynomial at t.  For example,
  *	after
@@ -87,7 +116,7 @@
  * Matrices with polynomial elements may be added, subtracted and
  *	multiplied as long as the usual rules for compatibility are
  *	observed.  Also, matrices may be multiplied by polynomials,
- *	i.e. if p is a 	polynomial and A a matrix whose elements
+ *	i.e. if p is a	polynomial and A a matrix whose elements
  *	may be numbers or polynomials, p * A returns the matrix of
  *	the same shape as A with each element multiplied by p.
  *	Square matrices may also be 'substituted for the variable' in
@@ -106,7 +135,7 @@
  * Functions defined include:
  *
  *	monic(a) returns the monic multiple of a, i.e., if a != 0,
- *		the multiple of	a with leading coefficient 1
+ *		the multiple of a with leading coefficient 1
  *	conj(a) returns the complex conjugate of a
  *	ispmult(a,b) returns 1 or 0 according as a is or is not
  *		a polynomial multiple of b
@@ -119,7 +148,7 @@
  *		by Newtonian divided difference interpolation, where
  *		X is a list of x-values, Y a list of corresponding
  *		y-values.  If t is omitted, the interpolating
- *		polynomial is returned.  A y-value may be replaced by
+ *		polynomial is returned.	 A y-value may be replaced by
  *		list (y, y_1, y_2, ...), where y_1, y_2, ... are
  *		the reduced derivatives at the corresponding x;
  *		i.e. y_r is the r-th derivative divided by fact(r).
@@ -170,6 +199,7 @@
  *	should return the zero m x m matrix.
  */
 
+
 obj poly {p};
 
 define pol() {
@@ -328,7 +358,7 @@ define poly_cmp(a,b) {
 	local sa, sb;
 	sa = findlist(a);
 	sb=findlist(b);
-	return  (sa != sb);
+	return	(sa != sb);
 }
 
 define poly_mul(a,b) {
@@ -471,8 +501,9 @@ define plist(s) {
 define deg(a) = size(a.p) - 1;
 
 define polydiv(a,b) {
-	local q, r, d, u, i, m, n, sa, sb, sq;
-	obj poly q, r;
+	local d, u, i, m, n, sa, sb, sq;
+	local obj poly q;
+	local obj poly r;
 	sa=findlist(a); sb = findlist(b); sq = list();
 	m=size(sa)-1; n=size(sb)-1;
 	if (n<0) quit "Zero divisor";
@@ -547,7 +578,7 @@ define D(a, n) {
 	local i,j,v;
 	if (isnull(n)) n = 1;
 	if (!isint(n) || n < 1) quit "Bad order for derivative";
- 	if (ismat(a)) {
+	if (ismat(a)) {
 		v = a;
 		for (i = matmin(a,1); i <= matmax(a,1); i++)
 			for (j = matmin(a,2); j <= matmax(a,2); j++)
@@ -561,7 +592,7 @@ define D(a, n) {
 define Dp(a,n) {
 	local i, v;
 	if (n > 1) return Dp(Dp(a, n-1), 1);
- 	obj poly v;
+	obj poly v;
 	v.p=list();
 	for (i=1; i<size(a.p); i++) append (v.p, i*a.p[[i]]);
 	return v;
@@ -687,42 +718,6 @@ a=pol(1,4,4,2,3,1);
 b=pol(5,16,8,1);
 c=pol(1+2i,3+4i,5+6i);
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
 	print "obj poly {p} defined";
-	print "pol() defined";
-	print "poly_print(a) defined";
-	print "poly_add(a, b) defined";
-	print "poly_sub(a, b) defined";
-	print "poly_mul(a, b) defined";
-	print "poly_div(a, b) defined";
-	print "poly_quo(a,b) defined";
-	print "poly_mod(a,b) defined";
-	print "poly_neg(a) defined";
-	print "poly_conj(a) defined";
-	print "poly_cmp(a,b) defined";
-	print "iszero(a) defined";
-	print "plist(a) defined";
-	print "listmul(a,b) defined";
-	print "ev(a,t) defined";
-	print "evp(s,t) defined";
-	print "ispoly(a) defined";
-	print "isstring(a) defined";
-	print "var(name) defined";
-	print "pcoeff(a) defined";
-	print "pterm(a,n) defined";
-	print "deg(a) defined";
-	print "polydiv(a,b) defined";
-	print "D(a,n) defined";
-	print "Dp(a,n) defined";
-	print "pgcd(a,b) defined";
-	print "plcm(a,b) defined";
-	print "monic(a) defined";
-	print "pfgcd(a,b) defined";
-	print "interp(X,Y,x) defined";
-	print "makediffs(X,Y) defined";
-	print "evalfd(T,x) defined";
-	print "mdet(A) defined";
-	print "M(A,n,I,J) defined";
-	print "mprint(A) defined";
 }

cal/prompt.cal

@@ -1,10 +1,32 @@
 /*
- * Copyright (c) 1995 Ernest Bowen
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * prompt - eemonstration of some uses of prompt() and eval()
  *
- * By: Ernest Bowen <ernie@neumann.une.edu.au>
+ * Copyright (C) 1999  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: prompt.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/prompt.cal,v $
+ *
+ * Under source code control:	1995/12/18 04:43:25
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * Demonstration of some uses of prompt() and eval().
  *
@@ -36,14 +58,14 @@
  *		3; print sum^2;
  *
  * (Here the second line creates x as a global variable; the local
- * variable x in the fourth line has no effect on the global x.  In
+ * variable x in the fourth line has no effect on the global x.	 In
  * the last three lines, sum is the sum of numbers already entered, so
  * the third last line doubles the value of sum.  The value returned
  * by "print sum^2;" is the null value, so the second last line adds
  * nothing to sum.  The last line returns the value 3, i.e. the last
  * non-null value found for the expressions separated by semicolons,
  * so sum will be increased by 3 after the "print sum^2;" command
- * is executed.  xxx The terminating semicolon is essential in the
+ * is executed.	 xxx The terminating semicolon is essential in the
  * last two lines.  A command like eval("print 7;") is acceptable to
  * calc but eval("print 7") causes an exit from calc. xxx)
  *
@@ -57,10 +79,11 @@
  *	"sin(x)", "x^2 + 3*x", "exp(x, 1e-5)".
  *
  * Values of the function so defined are returned for values of x
- * entered in reponse to the ? prompt.  Operation is terminated by
+ * entered in reponse to the ? prompt.	Operation is terminated by
  * entering "end", "exit" or "quit".
  */
 
+
 define adder() {
 	global sum = 0;
 	local s, t;
@@ -94,9 +117,3 @@ define showvalues(str) {
 		print "\t":eval(str);
 	}
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-	print "adder() defined";
-	print "showvalues(str) defined";
-}

cal/psqrt.cal

@@ -0,0 +1,74 @@
+/*
+ * psqrt - calculate square roots modulo a prime
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: psqrt.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/psqrt.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:35
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Returns null if number is not prime or if there is no square root.
+ * The smaller square root is always returned.
+ */
+
+
+define psqrt(u, p)
+{
+	local	p1, q, n, y, r, v, w, t, k;
+
+	p1 = p - 1;
+	r = lowbit(p1);
+	q = p >> r;
+	t = 1 << (r - 1);
+	for (n = 2; ; n++) {
+		if (ptest(n, 1) == 0)
+			continue;
+		y = pmod(n, q, p);
+		k = pmod(y, t, p);
+		if (k == 1)
+			continue;
+		if (k != p1)
+			return;
+		break;
+	}
+	t = pmod(u, (q - 1) / 2, p);
+	v = (t * u) % p;
+	w = (t^2 * u) % p;
+	while (w != 1) {
+		k = 0;
+		t = w;
+		do {
+			k++;
+			t = t^2 % p;
+		} while (t != 1);
+		if (k == r)
+			return;
+		t = pmod(y, 1 << (r - k - 1), p);
+		y = t^2 % p;
+		v = (v * t) % p;
+		w = (w * y) % p;
+		r = k;
+	}
+	return min(v, p - v);
+}

cal/qtime.cal

@@ -0,0 +1,68 @@
+/*
+ * qtime - Display time as English sentence
+ *
+ * usage:
+ *	qtime(utc_hr_offset)
+ *
+ *	utc_hr_offset	Offset from UTC in hours.
+ *
+ * Written by: Klaus Alexander Seistrup <kseis@magnetic-ink.dk>
+ * With minor mods by: Landon Curt Noll <http://reality.sgi.com/chongo/>
+ *
+ * See:
+ *	http://www.magnetic-ink.dk/download/qtime.html
+ *
+ * for examples of qtime() written on other languages.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: qtime.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/qtime.cal,v $
+ *
+ * This file is not covered under version 2.1 of the GNU LGPL.
+ */
+
+
+/*
+ * qtime - Display time as English sentence
+ */
+define qtime(utc_hr_offset)
+{
+	static mat hr[12] = {
+	  "twelve", "one", "two", "three", "four", "five",
+	  "six", "seven", "eight", "nine", "ten", "eleven"
+	};
+	static mat mn[7] = {
+	  "", "five ", "ten ", "a quarter ", "twenty ", "twenty-five ", "half "
+	};
+	static mat ny[5] = {
+	  "nearly ", "almost ", "", "just after ", "after "
+	};
+	static mat up[3] = {
+	  "to ", "", "past "
+	};
+	local adj_mins = (((time() + utc_hr_offset*3600) % 86400) + 30)//60+27;
+	local hours = (adj_mins // 60) % 12;
+	local minutes = adj_mins % 60;
+	local almost =	minutes % 5;
+	local divisions = (minutes // 5) - 5;
+	local to_past_idx =	 divisions > 0 ? 1 : 0;
+
+	if (divisions < 0) {
+		divisions = -divisions;
+		to_past_idx = -1;
+	}
+	++to_past_idx;
+
+	/*
+	 * Print the English sentence
+	 *
+	 * We avoid forward and back quotes just to show that the char()
+	 * builtin function can be used in conjunction with a printf.
+	 */
+	printf("It%cs %s%s%s%s",
+	       char(0x27), ny[almost], mn[divisions],
+	       up[to_past_idx], hr[hours]);
+	if (divisions == 0)
+		printf(" o%cclock", char(0x27));
+	print ".";
+}

cal/quat.cal

@@ -1,8 +1,33 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * quat - alculate using quaternions of the form: a + bi + cj + dk
  *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: quat.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/quat.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:35
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * Routines to handle quaternions of the form:
  *	a + bi + cj + dk
  *
@@ -11,6 +36,7 @@
  * Where s is a scalar and v is a vector of size 3.
  */
 
+
 obj quat {s, v};		/* definition of the quaternion object */
 
 
@@ -195,22 +221,6 @@ define quat_shift(a, b)
 	return x.s;
 }
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
     print "obj quat {s, v} defined";
-    print "quat(a, b, c, d) defined";
-    print "quat_print(a) defined";
-    print "quat_norm(a) defined";
-    print "quat_abs(a, e) defined";
-    print "quat_conj(a) defined";
-    print "quat_add(a, e) defined";
-    print "quat_sub(a, e) defined";
-    print "quat_inc(a) defined";
-    print "quat_dec(a) defined";
-    print "quat_neg(a) defined";
-    print "quat_mul(a, b) defined";
-    print "quat_div(a, b) defined";
-    print "quat_inv(a) defined";
-    print "quat_scale(a, b) defined";
-    print "quat_shift(a, b) defined";
 }

cal/randbitrun.cal

@@ -1,30 +1,38 @@
 /*
- * randbitrun - check rand bit run lengths
+ * randbitrun - check rand bit run lengths of the a55 generator
  *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: randbitrun.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/randbitrun.cal,v $
+ *
+ * Under source code control:	1995/02/13 03:43:11
+ * File existed as early as:	1995
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * We will use randbit(1) to generate a stream if single bits.
  * The odds that we will have n bits the same in a row is 1/2^n.
  */
-/*
- * Copyright 1995 by Landon Curt Noll.  All Rights Reserved.
- *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice, and the
- * disclaimer below appear in all of the following:
- *
- * 	* supporting documentation
- * 	* source copies
- * 	* source works derived from this source
- * 	* binaries derived from this source or from derived source
- *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
- */
+
 
 define randbitrun(run_cnt)
 {
@@ -36,7 +44,7 @@ define randbitrun(run_cnt)
     local last;			/* last random number */
     local current;		/* current random number */
     local MAX_RUN = 18;		/* max run we will keep track of */
-    local mat tally[1:MAX_RUN];	/* tally of length of a rise run of 'x' */
+    local mat tally[1:MAX_RUN]; /* tally of length of a rise run of 'x' */
     local mat prob[1:MAX_RUN];	/* prob[x] = probability of 'x' length run */
 
     /*
@@ -77,7 +85,7 @@ define randbitrun(run_cnt)
 	/* look for a run break */
 	if (current != last) {
 
-	    /*  record the stats */
+	    /*	record the stats */
 	    if (run > max_run) {
 		max_run = run;
 	    }
@@ -112,8 +120,3 @@ define randbitrun(run_cnt)
     printf("length>%d\t\t\t\t\tcount=%d\n", MAX_RUN, long_run_cnt);
     printf("max length=%d\n", max_run);
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-    print "randbitrun([run_length]) defined";
-}

cal/randmprime.cal

@@ -1,31 +1,35 @@
 /*
  * randmprime - generate a random prime of the form h*2^n-1
  *
- * Copyright (c) 1995 by Landon Curt Noll.  All Rights Reserved.
+ * Copyright (C) 1999  Landon Curt Noll
  *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice and text
- * this comment, and the disclaimer below appear in all of the following:
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
  *
- *	supporting documentation
- *	source copies
- *	source works derived from this source
- *	binaries derived from this source or from derived source
+ * Calc 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 Lesser General
+ * Public License for more details.
  *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
  *
- * chongo was here	/\../\		chongo@toad.com
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: randmprime.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/randmprime.cal,v $
+ *
+ * Under source code control:	1994/03/14 23:11:21
+ * File existed as early as:	1994
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 /* obtain our required libs */
-read -once "cryrand.cal"
 read -once "lucas.cal"
 
 /*
@@ -33,7 +37,7 @@ read -once "lucas.cal"
  *
  * given:
  *	bits	minimum bits in prime to return
- *	seed	random seed for scryrand()
+ *	seed	random seed for srandom()
  *	[dbg]	if given, enable debugging
  *
  * returns:
@@ -62,15 +66,15 @@ randmprime(bits, seed, dbg)
 	bits = 1;
     }
     if (param(0) == 2 || dbg < 0) {
-    	dbg = 0;
+	dbg = 0;
     }
 
     /* seed generator */
-    tmp = scryrand(seed);
+    tmp = srandom(seed, 13);
 
     /* determine initial h and n values */
     n = random(bits>>1, highbit(bits)+bits>>1+1);
-    h = cryrand(n);
+    h = randombit(n);
     h += iseven(h);
     while (highbit(h) >= n) {
        ++n;
@@ -94,7 +98,7 @@ randmprime(bits, seed, dbg)
 	/* bump h, and n if needed */
 	if (dbg >= 2) {
 	    stop = runtime();
-	    print "DEBUG2: last test:", stop-start, "   total time:", stop-init;
+	    print "DEBUG2: last test:", stop-start, "	total time:", stop-init;
 	}
 	if (dbg >= 1) {
 	    print "DEBUG1: composite: (h+" : plush : ")*2^" : n : "-1";
@@ -130,8 +134,3 @@ randmprime(bits, seed, dbg)
     }
     return ret;
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-    print "randmprime(bits, seed [,dbg]) defined";
-}

cal/randombitrun.cal

@@ -0,0 +1,122 @@
+/*
+ * randombitrun - check rand bit run lengths of random()
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: randombitrun.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/randombitrun.cal,v $
+ *
+ * Under source code control:	1995/02/13 03:43:11
+ * File existed as early as:	1995
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * We will use randombit(1) to generate a stream if single bits.
+ * The odds that we will have n bits the same in a row is 1/2^n.
+ */
+
+
+define randombitrun(run_cnt)
+{
+    local i;			/* index */
+    local max_run;		/* longest run */
+    local long_run_cnt;		/* number of runs longer than MAX_RUN */
+    local run;			/* current run length */
+    local tally_sum;		/* sum of all tally values */
+    local last;			/* last random number */
+    local current;		/* current random number */
+    local MAX_RUN = 18;		/* max run we will keep track of */
+    local mat tally[1:MAX_RUN]; /* tally of length of a rise run of 'x' */
+    local mat prob[1:MAX_RUN];	/* prob[x] = probability of 'x' length run */
+
+    /*
+     * parse args
+     */
+    if (param(0) == 0) {
+	run_cnt = 65536;
+    }
+
+    /*
+     * run setup
+     */
+    max_run = 0;		/* no runs yet */
+    long_run_cnt = 0;		/* no long runs set */
+    current = randombit(1);	/* our first number */
+    run = 1;
+
+    /*
+     * compute the run length probabilities
+     *
+     * A bit run length of 'r' occurs with a probability of:
+     *
+     *			1/2^n;
+     */
+    for (i=1; i <= MAX_RUN; ++i) {
+	prob[i] = 1.0/(1<<i);
+    }
+
+    /*
+     * look at a number of random number trials
+     */
+    for (i=0; i < run_cnt; ++i) {
+
+	/* get our current number */
+	last = current;
+	current = randombit(1);
+
+	/* look for a run break */
+	if (current != last) {
+
+	    /*	record the stats */
+	    if (run > max_run) {
+		max_run = run;
+	    }
+	    if (run > MAX_RUN) {
+		++long_run_cnt;
+	    } else {
+		++tally[run];
+	    }
+
+	    /* start a new run */
+	    current = randombit(1);
+	    run = 1;
+
+	/* note the continuing run */
+	} else {
+	    ++run;
+	}
+    }
+    /* determine the number of runs found */
+    tally_sum = matsum(tally) + long_run_cnt;
+
+    /*
+     * print the stats
+     */
+    printf("random runbit test used %d values to produce %d runs\n",
+      run_cnt, tally_sum);
+    for (i=1; i <= MAX_RUN; ++i) {
+	printf("length=%d\tprob=%9.7f\texpect=%d \tcount=%d \terr=%9.7f\n",
+	  i, prob[i], round(tally_sum*prob[i]), tally[i],
+	  (tally[i] - round(tally_sum*prob[i]))/tally_sum);
+    }
+    printf("length>%d\t\t\t\t\tcount=%d\n", MAX_RUN, long_run_cnt);
+    printf("max length=%d\n", max_run);
+}

cal/randomrun.cal

@@ -0,0 +1,131 @@
+/*
+ * randomrun - perform a run test on random()
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: randomrun.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/randomrun.cal,v $
+ *
+ * Under source code control:	1997/02/19 03:35:59
+ * File existed as early as:	1997
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * If X(j) < X(j+1) < ... X(j+k) >= X(j+k+1), then we have a run of 'k'.
+ * We ignore the run breaker, X(j+k+1), and start with X(j+k+2) when
+ * considering a new run in order to make our runs chi independent.
+ *
+ * See Knuth's "Art of Computer Programming - 2nd edition",
+ * Volume 2 ("Seminumerical Algorithms"), Section 3.3.2.
+ * "G. Run test", pp. 65-68,
+ * "problem #14", pp. 74, 536.
+ *
+ * We use the suggestion in problem #14 to allow an application of the
+ * chi-square test and to make estimating the run length probs easy.
+ */
+
+
+define randomrun(run_cnt)
+{
+    local i;			/* index */
+    local max_run;		/* longest run */
+    local long_run_cnt;		/* number of runs longer than MAX_RUN */
+    local run;			/* current run length */
+    local tally_sum;		/* sum of all tally values */
+    local last;			/* last random number */
+    local current;		/* current random number */
+    local MAX_RUN = 9;		/* max run we will keep track of */
+    local mat tally[1:MAX_RUN]; /* tally of length of a rise run of 'x' */
+    local mat prob[1:MAX_RUN];	/* prob[x] = probability of 'x' length run */
+
+    /*
+     * parse args
+     */
+    if (param(0) == 0) {
+	run_cnt = 65536;
+    }
+
+    /*
+     * run setup
+     */
+    max_run = 0;		/* no runs yet */
+    long_run_cnt = 0;		/* no long runs set */
+    current = random();		/* our first number */
+    run = 1;
+
+    /*
+     * compute the run length probabilities
+     *
+     * A run length of 'r' occurs with a probability of:
+     *
+     *			1/r! - 1/(r+1)!
+     */
+    for (i=1; i <= MAX_RUN; ++i) {
+	prob[i] = 1.0/fact(i) - 1.0/fact(i+1);
+    }
+
+    /*
+     * look at a number of random number trials
+     */
+    for (i=0; i < run_cnt; ++i) {
+
+	/* get our current number */
+	last = current;
+	current = random();
+
+	/* look for a run break */
+	if (current < last) {
+
+	    /*	record the stats */
+	    if (run > max_run) {
+		max_run = run;
+	    }
+	    if (run > MAX_RUN) {
+		++long_run_cnt;
+	    } else {
+		++tally[run];
+	    }
+
+	    /* start a new run */
+	    current = random();
+	    run = 1;
+
+	/* note the continuing run */
+	} else {
+	    ++run;
+	}
+    }
+    /* determine the number of runs found */
+    tally_sum = matsum(tally) + long_run_cnt;
+
+    /*
+     * print the stats
+     */
+    printf("random run test used %d values to produce %d runs\n",
+      run_cnt, tally_sum);
+    for (i=1; i <= MAX_RUN; ++i) {
+	printf("length=%d\tprob=%9.7f\texpect=%d \tcount=%d \terr=%9.7f\n",
+	  i, prob[i], round(tally_sum*prob[i]), tally[i],
+	  (tally[i] - round(tally_sum*prob[i]))/tally_sum);
+    }
+    printf("length>%d\t\t\t\t\tcount=%d\n", MAX_RUN, long_run_cnt);
+    printf("max length=%d\n", max_run);
+}

cal/randrun.cal

@@ -1,6 +1,33 @@
 /*
  * randrun - perform a run test on rand()
  *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: randrun.cal,v 29.1 1999/12/14 09:15:32 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/randrun.cal,v $
+ *
+ * Under source code control:	1995/02/12 20:00:06
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
  * If X(j) < X(j+1) < ... X(j+k) >= X(j+k+1), then we have a run of 'k'.
  * We ignore the run breaker, X(j+k+1), and start with X(j+k+2) when
  * considering a new run in order to make our runs chi independent.
@@ -13,27 +40,7 @@
  * We use the suggestion in problem #14 to allow an application of the
  * chi-square test and to make estimating the run length probs easy.
  */
-/*
- * Copyright 1995 by Landon Curt Noll.  All Rights Reserved.
- *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice, and the
- * disclaimer below appear in all of the following:
- *
- * 	* supporting documentation
- * 	* source copies
- * 	* source works derived from this source
- * 	* binaries derived from this source or from derived source
- *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
- */
+
 
 define randrun(run_cnt)
 {
@@ -45,7 +52,7 @@ define randrun(run_cnt)
     local last;			/* last random number */
     local current;		/* current random number */
     local MAX_RUN = 9;		/* max run we will keep track of */
-    local mat tally[1:MAX_RUN];	/* tally of length of a rise run of 'x' */
+    local mat tally[1:MAX_RUN]; /* tally of length of a rise run of 'x' */
     local mat prob[1:MAX_RUN];	/* prob[x] = probability of 'x' length run */
 
     /*
@@ -86,7 +93,7 @@ define randrun(run_cnt)
 	/* look for a run break */
 	if (current < last) {
 
-	    /*  record the stats */
+	    /*	record the stats */
 	    if (run > max_run) {
 		max_run = run;
 	    }
@@ -122,7 +129,6 @@ define randrun(run_cnt)
     printf("max length=%d\n", max_run);
 }
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
     print "randrun([run_length]) defined";
 }

cal/seedrandom.cal

@@ -0,0 +1,161 @@
+/*
+ * seedrandom - seed the cryptographically strong Blum generator
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: seedrandom.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/seedrandom.cal,v $
+ *
+ * Under source code control:	1996/01/01 08:21:00
+ * File existed as early as:	1996
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * The period of Blum generators with modulus 'n=p*q' (where p and
+ * q are primes 3 mod 4) is:
+ *
+ *	lambda(n) = lcm(factors of p-1 & q-1)
+ *
+ * One can construct a generator with a maximal period when
+ * 'p' and 'q' have the fewest possible factors in common.
+ * The quickest way to select such primes is only use 'p'
+ * and 'q' when '(p-1)/2' and '(q-1)/2' are both primes.
+ * This function will seed the random() generator that uses
+ * such primes.
+ *
+ * given:
+ *	seed1 - a large random value (at least 10^20 and perhaps < 10^314)
+ *	seed2 - a large random value (at least 10^20 and perhaps < 10^314)
+ *	size - min Blum modulus as a power of 2 (at least 32, perhaps >= 512)
+ *	trials - number of ptest() trials (default 25)
+ *
+ * returns:
+ *	the previous random state
+ *
+ * NOTE: The [10^20, 10^314) range comes from the fact that the 13th internal
+ *	 modulus is ~10^315.  We want the lower bound seed to be reasonably big.
+ */
+
+
+define seedrandom(seed1, seed2, size, trials)
+{
+	local p;		/* first Blum prime */
+	local fp;		/* prime co-factor of p-1 */
+	local sp;		/* min bit size of p */
+	local q;		/* second Blum prime */
+	local fq;		/* prime co-factor of q-1 */
+	local sq;		/* min bit size of q */
+	local n;		/* Blum modulus */
+	local binsize;		/* smallest power of 2 > n=p*q */
+	local r;		/* initial quadratic residue */
+	local random_state;	/* the initial rand state */
+	local random_junk;	/* rand state that is not needed */
+	local old_state;	/* old random state to return */
+
+	/*
+	 * firewall
+	 */
+	if (!isint(seed1)) {
+		quit "1st arg (seed1) is not an int";
+	}
+	if (!isint(seed2)) {
+		quit "2nd arg (seed2) is not an int";
+	}
+	if (!isint(size)) {
+		quit "3rd arg (size) is not an int";
+	}
+	if (!isint(trials)) {
+		trials = 25;
+	}
+	if (digits(seed1) <= 20) {
+		quit "1st arg (seed1) must be > 10^20 and perhaps < 10^314";
+	}
+	if (digits(seed2) <= 20) {
+		quit "2nd arg (seed2) must be > 10^20 and perhaps < 10^314";
+	}
+	if (size < 32) {
+		quit "3rd arg (size) needs to be >= 32 (perhaps >= 512)";
+	}
+	if (trials < 1) {
+		quit "4th arg (trials) must be > 0";
+	}
+
+	/*
+	 * determine the search parameters
+	 */
+	++size;		/* convert power of 2 to bit length */
+	sp = int((size/2)-(size*0.03)+1);
+	sq = size - sp;
+
+	/*
+	 * find the first Blum prime
+	 */
+	random_state = srandom(seed1, 13);
+	do {
+		do {
+			fp = nextcand(2^sp+randombit(sp), 1, 1, 3, 4);
+			p = 2*fp+1;
+		} while (ptest(p,1,0) == 0);
+	} while(ptest(p, trials) == 0 || ptest(fp, trials) == 0);
+	if (config("resource_debug") & 3) {
+		print "/* 1st Blum prime */ p=", p;
+	}
+
+	/*
+	 * find the 2nd Blum prime
+	 */
+	random_junk = srandom(seed2, 13);
+	do {
+		do {
+			fq = nextcand(2^sq+randombit(sq), 1, 1, 3, 4);
+			q = 2*fq+1;
+		} while (ptest(q,1,0) == 0);
+	} while(ptest(q, trials) == 0 || ptest(fq, trials) == 0);
+	if (config("resource_debug") & 3) {
+		print "/* 2nd Blum prime */ q=", q;
+	}
+
+	/*
+	 * seed the Blum generator
+	 */
+	n = p*q;				/* the Blum modulus */
+	binsize = highbit(n)+1;			/* smallest power of 2 > p*q */
+	r = pmod(rand(1<<ceil(binsize*4/5), 1<<(binsize-2)), 2, n);
+	if (config("resource_debug") & 3) {
+		print "/* seed quadratic residue */ r=", r;
+		print "/* newn", binsize, "bit quadratic residue*/ newn=", n;
+	}
+	old_state = srandom(r, n);
+
+	/*
+	 * restore other states that we altered
+	 */
+	random_junk = srandom(random_state);
+
+	/*
+	 * return the previous random state
+	 */
+	return old_state;
+}
+
+if (config("resource_debug") & 3) {
+    print "seedrandom(seed1, seed2, size [, trials]) defined";
+}

cal/solve.cal

@@ -0,0 +1,69 @@
+/*
+ * solve - solve f(x) = 0 to within the desired error value for x
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: solve.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/solve.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:37
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Solve the equation f(x) = 0 to within the desired error value for x.
+ * The function 'f' must be defined outside of this routine, and the low
+ * and high values are guesses which must produce values with opposite signs.
+ */
+
+
+define solve(low, high, epsilon)
+{
+	local flow, fhigh, fmid, mid, places;
+
+	if (isnull(epsilon))
+		epsilon = epsilon();
+	if (epsilon <= 0)
+		quit "Non-positive epsilon value";
+	places = highbit(1 + int(1/epsilon)) + 1;
+	flow = f(low);
+	if (abs(flow) < epsilon)
+		return low;
+	fhigh = f(high);
+	if (abs(flow) < epsilon)
+		return high;
+	if (sgn(flow) == sgn(fhigh))
+		quit "Non-opposite signs";
+	while (1) {
+		mid = bround(high - fhigh * (high - low) / (fhigh - flow), places);
+		if ((mid == low) || (mid == high))
+			places++;
+		fmid = f(mid);
+		if (abs(fmid) < epsilon)
+			return mid;
+		if (sgn(fmid) == sgn(flow)) {
+			low = mid;
+			flow = fmid;
+		} else {
+			high = mid;
+			fhigh = fmid;
+		}
+	}
+}

cal/sumsq.cal

@@ -0,0 +1,65 @@
+/*
+ * sumsq - find unique two positive integers whose squares sum to a given prime
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: sumsq.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/sumsq.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:37
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Determine the unique two positive integers whose squares sum to the
+ * specified prime.  This is always possible for all primes of the form
+ * 4N+1, and always impossible for primes of the form 4N-1.
+ */
+
+
+define ss(p)
+{
+	local a, b, i, p4;
+
+	if (p == 2) {
+		print "1^2 + 1^2 = 2";
+		return;
+	}
+	if ((p % 4) != 1) {
+		print p, "is not of the form 4N+1";
+		return;
+	}
+	if (!ptest(p, min(p-2, 10))) {
+		print p, "is not a prime";
+		return;
+	}
+	p4 = (p - 1) / 4;
+	i = 2;
+	do {
+		a = pmod(i++, p4, p);
+	} while ((a^2 % p) == 1);
+	b = p;
+	while (b^2 > p) {
+		i = b % a;
+		b = a;
+		a = i;
+	}
+	print a : "^2 +" , b : "^2 =" , a^2 + b^2;
+}

cal/surd.cal

@@ -1,11 +1,33 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * surd - calculate using quadratic surds of the form: a + b * sqrt(D).
  *
- * Calculate using quadratic surds of the form: a + b * sqrt(D).
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: surd.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/surd.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:38
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 obj surd {a, b};		/* definition of the surd object */
 
 global surd_type = -1;		/* type of surd (value of D) */
@@ -261,28 +283,8 @@ define surd_rel(a, b)
 	return sgn(x^2 - y^2 * surd_type) * sgn(x);
 }
 
-global lib_debug;
-if (lib_debug >= 0) {
+if (config("resource_debug") & 3) {
     print "obj surd {a, b} defined";
-    print "surd(a, b) defined";
-    print "surd_print(a) defined";
-    print "surd_conj(a) defined";
-    print "surd_norm(a) defined";
-    print "surd_value(a, xepsilon) defined";
-    print "surd_add(a, b) defined";
-    print "surd_sub(a, b) defined";
-    print "surd_inc(a) defined";
-    print "surd_dec(a) defined";
-    print "surd_neg(a) defined";
-    print "surd_mul(a, b) defined";
-    print "surd_square(a) defined";
-    print "surd_scale(a, b) defined";
-    print "surd_shift(a, b) defined";
-    print "surd_div(a, b) defined";
-    print "surd_inv(a) defined";
-    print "surd_sgn(a) defined";
-    print "surd_cmp(a, b) defined";
-    print "surd_rel(a, b) defined";
     print "surd_type defined";
     print "set surd_type as needed";
 }

cal/test1700.cal

@@ -0,0 +1,32 @@
+/*
+ * test1700 - 1700 series of the regress.cal test suite
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test1700.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test1700.cal,v $
+ *
+ * Under source code control:	1994/03/14 23:12:51
+ * File existed as early as:	1994
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+++value;

cal/test2300.cal

@@ -1,12 +1,31 @@
 /*
- * Copyright (c) 1995 Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test2300 - 2300 series of the regress.cal test suite
  *
- * By: Landon Curt Noll
- *     chongo@toad.com  -or-  ...!{pyramid,sun,uunet}!hoptoad!chongo
+ * Copyright (C) 1999  Landon Curt Noll
  *
- * This library is used by the 2300 series of the regress.cal test suite.
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test2300.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test2300.cal,v $
+ *
+ * Under source code control:	1995/07/09 06:12:13
+ * File existed as early as:	1995
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
 

cal/test2600.cal

@@ -1,13 +1,34 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test2600 - 2600 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 2600 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test2600.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test2600.cal,v $
+ *
+ * Under source code control:	1995/10/13 00:13:14
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * Stringent tests of some of calc's builtin functions.
  * Most of the tests are concerned with the accuracy of the value
@@ -49,6 +70,7 @@
  * All functions return the number of errors that they detected.
  */
 
+
 global defaultverbose = 1;	/* default verbose value */
 global err;
 
@@ -480,7 +502,7 @@ define test2600(verbose, tnum)
 	for (i=0; i < 32; ++i) {
 		config("sqrt", i);
 		err += testsqrt(strcat(str(tnum++),": sqrt",str(i)), n*10,
-			        ep, verbose);
+				ep, verbose);
 	}
 	if (verbose > 1) {
 		if (err) {
@@ -491,26 +513,3 @@ define test2600(verbose, tnum)
 	}
 	return tnum;
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-	print "global defaultverbose defined";
-	print "global err defined";
-	print "testismult(str,n,verbose) defined";
-	print "testsqrt(str,n,eps,verbose) defined";
-	print "testexp(str,n,eps,verbose) defined";
-	print "testln(str,n,eps,verbose) defined";
-	print "testpower(str,n,b,eps,verbose) defined";
-	print "testgcd(str,n,verbose) defined";
-	print "cpow(x,n,eps) defined";
-	print "cexp(x,eps) defined";
-	print "cln(x,eps) defined";
-	print "mkreal() defined";
-	print "mkcomplex() defined";
-	print "mkbigreal() defined";
-	print "mksmallreal() defined";
-	print "testappr(str,n,verbose) defined";
-	print "checkappr(x,y,z,verbose) defined";
-	print "checkresult(x,y,z,a) defined";
-	print "test2600(verbose,tnum) defined";
-}

cal/test2700.cal

@@ -1,25 +1,46 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test2700 - 2700 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 2700 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test2700.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test2700.cal,v $
+ *
+ * Under source code control:	1995/11/01 22:52:25
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
- * The following script gives a severe test of sqrt(x,y,z) for
+ * The following resource file gives a severe test of sqrt(x,y,z) for
  * all 128 values of z, randomly produced real and complex x, and randomly
  * produced nonzero values for y.  After loading it, testcsqrt(n) will
  * test n combinations of x and y;  testcsqrt(str,n,2) will print 1 2 3 ...
  * indicating work in process; testcsqrt(str,n,3) will give information about
- * errors detected and will print values of x and y used.  The
- * number generators are essentially as in the script I sent yesterday.
+ * errors detected and will print values of x and y used.
  * I've also defined a function iscomsq(x) which does for complex as well
  * as real x what issq(x) currently does for real x.
  */
 
+
 global defaultverbose = 1;
 global err;
 
@@ -124,7 +145,7 @@ define testcsqrt(str, n, verbose)
 }
 
 
-define checksqrt(x,y,z,v) 	/* Returns >0 if an error is detected */
+define checksqrt(x,y,z,v)	/* Returns >0 if an error is detected */
 {
 	local A, B, X, Y, t1, t2, eps, u, n, f, s;
 
@@ -308,24 +329,3 @@ define test2700(verbose, tnum)
 	}
 	return tnum;
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-	print "global defaultverbose defined";
-	print "global err defined";
-	print "mknonnegreal() defined";
-	print "mkposreal() defined";
-	print "mkreal_2700() defined";
-	print "mknonzeroreal() defined";
-	print "mkposfrac() defined";
-	print "mkfrac() defined";
-	print "mksquarereal() defined";
-	print "mknonsquarereal() defined";
-	print "mkcomplex_2700() defined";
-	print "testcsqrt(str,n,verbose) defined";
-	print "checksqrt(x,y,z,v) defined";
-	print "checkavrem(A,B,X,eps) defined";
-	print "checkrounding(s,n,t,u,z) defined";
-	print "iscomsq(x) defined";
-	print "test2700(verbose,tnum) defined";
-}

cal/test3100.cal

@@ -0,0 +1,40 @@
+/*
+ * test3100 - 3100 series of the regress.cal test suite
+ *
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
+ *
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test3100.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test3100.cal,v $
+ *
+ * Under source code control:	1995/11/28 11:56:57
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+obj res {r};
+global md;
+define res_test(a) = !ismult(a.r, md);
+define res_sub(a,b) {local obj res v = {(a.r - b.r) % md}; return v;};
+define res_mul(a,b) {local obj res v = {(a.r * b.r) % md}; return v;};
+define res_neg(a) {local obj res v = {(-a.r) % md}; return v;};
+define res_inv(a) {local obj res v = {minv(a.r, md)}; return v;};
+define res(x) {local obj res v = {x % md}; return v;};

cal/test3300.cal

@@ -1,14 +1,35 @@
 /*
- * Copyright (c) 1995 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test3300 - 3300 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 3300 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test3300.cal,v 29.1 1999/12/14 09:15:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test3300.cal,v $
+ *
+ * Under source code control:	1995/12/02 04:27:41
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 global defaultverbose = 1;	/* default verbose value */
 global err;
 
@@ -122,13 +143,3 @@ define test3300(verbose, tnum)
 	}
 	return tnum;
 }
-
-global lib_debug;
-
-if (lib_debug >= 0) {
-	print "global defaultverbose defined";
-	print "global err defined";
-	print "testi(str, n, N, verbose) defined";
-	print "testr(str, n, N, verbose) defined";
-	print "test3300(verbose, tnum) defined";
-}

cal/test3400.cal

@@ -1,13 +1,34 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test3400 - 3400 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 3400 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test3400.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test3400.cal,v $
+ *
+ * Under source code control:	1995/12/02 05:20:11
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * tests of performance of some trigonometric functions
  *
@@ -32,6 +53,7 @@
  * that the two sides might differ by eps.  [[test changed to test eps error]]
  */
 
+
 global defaultverbose = 1;	/* default verbose value */
 global err;
 
@@ -299,17 +321,3 @@ define test3400(verbose, tnum)
 	}
 	return tnum;
 }
-
-global lib_debug;
-
-if (lib_debug >= 0) {
-	print "global defaultverbose defined";
-	print "global err defined";
-	print "test3401(str, n, eps, verbose) defined";
-	print "test3402(str, n, eps, verbose) defined";
-	print "test3403(str, n, eps, verbose) defined";
-	print "test3404(str, n, eps, verbose) defined";
-	print "test3405(str, n, eps, verbose) defined";
-	print "test3406(str, n, eps, verbose) defined";
-	print "test3400(verbose, tnum) defined";
-}

cal/test3500.cal

@@ -1,18 +1,39 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test3500 - 3500 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 3500 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test3500.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test3500.cal,v $
+ *
+ * Under source code control:	1995/12/18 22:50:46
+ * File existed as early as:	1995
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * Stringent tests of the functions frem, fcnt, gcdrem.
  *
  * testf(n) gives n tests of frem(x,y) and fcnt(x,y) with randomly
- * 	integers x and y generated so that x = f * y^k where f, y and
+ *	integers x and y generated so that x = f * y^k where f, y and
  *	k are randomly generated.
  *
  * testg(n) gives n tests of gcdrem(x,y) with x and y generated as for
@@ -22,7 +43,7 @@
  *	powers of small primes some of which are common to both x and y.
  *	This test uses f = abs(x) and iteratively f = frem(f,p) where
  *	p varies over the prime divisors of y; the final value for f
- *	should equal g.  For both x and y the primes are raised to the
+ *	should equal g.	 For both x and y the primes are raised to the
  *	power rand(N); N defaults to 10.
  *
  * If verbose is > 1, the numbers x, y and values for some of the
@@ -31,6 +52,7 @@
  *
  */
 
+
 global defaultverbose = 1;	/* default verbose value */
 global err;
 
@@ -272,15 +294,3 @@ define test3500(verbose, tnum, n, N)
 	}
 	return tnum;
 }
-
-global lib_debug;
-if (lib_debug >= 0) {
-	print "global defaultverbose defined";
-	print "global err defined";
-	print "testfrem(x, y, verbose) defined";
-	print "testgcdrem(x, y, verbose) defined";
-	print "testf(str, n, verbose) defined";
-	print "testg(str, n, verbose) defined";
-	print "testh(str, n, N, verbose) defined";
-	print "test3500(verbose, n, N) defined";
-}

cal/test4000.cal

@@ -1,13 +1,34 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test4000 - 4000 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 4000 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test4000.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test4000.cal,v $
+ *
+ * Under source code control:	1996/03/13 02:38:45
+ * File existed as early as:	1996
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * Functions for testing and timing ptest, nextcand, prevcand.
  *
@@ -53,7 +74,8 @@
  *	modulus to 1.
  */
 
-global defaultverbose = 1;      /* default verbose value */
+
+global defaultverbose = 1;	/* default verbose value */
 global err;
 
 /*
@@ -302,7 +324,7 @@ define testnextcand(str, N, n, count, skip, residue, modulus, verbose)
 	if (isnull(count))
 		count = COUNT;
 	if (isnull(n)) {
- 		n = ceil(K3/(H3 + N^3));
+		n = ceil(K3/(H3 + N^3));
 		print "n =",n;
 	}
 	if (isnull(skip))
@@ -356,7 +378,7 @@ define testprevcand(str, N, n, count, skip, residue, modulus, verbose)
 	if (isnull(count))
 		count = COUNT;
 	if (isnull(n)) {
- 		n = ceil(K3/(H3 + N^3));
+		n = ceil(K3/(H3 + N^3));
 		print "n =",n;
 	}
 	if (isnull(skip))
@@ -452,34 +474,3 @@ define test4000(v, tnum)
 	}
 	return tnum;
 }
-
-
-global lib_debug;
-
-if (lib_debug >= 0) {
-	print "global defaultverbose";
-	print "global err";
-	print "global BASEB";
-	print "global BASE";
-	print "global COUNT";
-	print "global SKIP";
-	print "global RESIDUE";
-	print "global MODULUS";
-	print "global K1";
-	print "global H1";
-	print "global K2";
-	print "global H2";
-	print "global K3";
-	print "global H3";
-	print "plen(N) defined";
-	print "clen(N) defined";
-	print "ptimes(str, N, n, count, skip, verbose) defined";
-	print "ctimes(str, N, n, count, skip, verbose) defined";
-	print "crtimes(str, a, b, n, count, skip, verbose) defined";
-	print "ntimes(str, N, n, count, skip, residue, mod, verbose) defined";
-	print "testnextcand(str, N, n, cnt, skip, res, mod, verbose) defined";
-	print "testnext1(x, y, count, skip, residue, modulus) defined";;
-	print "testprevcand(str, N, n, cnt, skip, res, mod, verbose) defined";
-	print "testprev1(x, y, count, skip, residue, modulus) defined";
-	print "test4000(verbose, tnum) defined";
-}

cal/test4100.cal

@@ -1,13 +1,34 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test4100 - 4100 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 4100 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test4100.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test4100.cal,v $
+ *
+ * Under source code control:	1996/03/13 03:53:22
+ * File existed as early as:	1996
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
+
 /*
  * Some severe tests and timing functions for REDC functions and pmod.
  *
@@ -48,7 +69,8 @@
  *
  */
 
-global defaultverbose = 1;      /* default verbose value */
+
+global defaultverbose = 1;	/* default verbose value */
 global err;
 
 /*
@@ -472,22 +494,3 @@ define test4100(v, tnum)
 	}
 	return tnum;
 }
-
-global lib_debug;
-
-if (lib_debug >= 0) {
-	print "global defaultverbose";
-	print "global err";
-	print "global K1";
-	print "global K2";
-	print "global BASEB";
-	print "global BASE";
-	print "rlen_4100(N) defined";
-	print "olen(N) defined";
-	print "test4101(x, y, m, k, z1, z2) defined";
-	print "testall(str, n, N, M, verbose) defined";
-	print "times(str, N, n, verbose) defined";
-	print "powtimes(str, N1, N2, n, verbose) defined";
-	print "inittimes(str, N, n, verbose) defined";
-	print "test4100(verbose, tnum) defined";
-}

cal/test4600.cal

@@ -1,12 +1,32 @@
 /*
- * Copyright (c) 1996 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * test4600 - 4600 series of the regress.cal test suite
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
  *
- * This library is used by the 4600 series of the regress.cal test suite.
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test4600.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test4600.cal,v $
+ *
+ * Under source code control:	1996/07/02 20:04:40
+ * File existed as early as:	1996
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
 
@@ -28,7 +48,7 @@ define stest(str, verbose)
 	if (verbose > 0) {
 		print str:":",:;
 	}
-	x = rm("junk4600");
+	x = rm("-f", "junk4600");
 
 	/*
 	 * do file operations
@@ -92,14 +112,14 @@ define stest(str, verbose)
 		print '**** rsearch(f, "and") != 109 failed';
 		return 1;
 	}
-	if (ftell(f) != 112) {
+	if (ftell(f) != 111) {
 		print 'failed';
-		print '**** ftell(f) != 112 failed';
+		print '**** ftell(f) != 111 failed';
 		return 1;
 	}
-	if (iserror(fseek(f, -1, 1))) {
+	if (iserror(fseek(f, -4, 1))) {
 		print 'failed';
-		print '**** iserror(fseek(f, -1, 1)) failed';
+		print '**** iserror(fseek(f, -4, 1)) failed';
 		return 1;
 	}
 	if (rsearch(f, "and") != 10) {
@@ -107,14 +127,14 @@ define stest(str, verbose)
 		print '**** rsearch(f, "and") != 10 failed';
 		return 1;
 	}
-	if (ftell(f) != 13) {
+	if (ftell(f) != 12) {
 		print 'failed';
-		print '**** ftell(f) != 13 failed';
+		print '**** ftell(f) != 12 failed';
 		return 1;
 	}
-	if (iserror(fseek(f, -1, 1))) {
+	if (iserror(fseek(f, -4, 1))) {
 		print 'failed';
-		print '**** iserror(fseek(f, -1, 1)) failed';
+		print '**** iserror(fseek(f, -4, 1)) failed';
 		return 1;
 	}
 	if (!isnull(rsearch(f, "and"))) {
@@ -152,7 +172,7 @@ define ttest(str, m, n, verbose)
 	if (verbose > 0) {
 		print str:":",:;
 	}
-	i = rm("junk4600");
+	i = rm("-f", "junk4600");
 	f = fopen("junk4600", "w");
 
 	if (isnull(n))
@@ -168,13 +188,14 @@ define ttest(str, m, n, verbose)
 		j = 1 + randbit(n);
 		a = "";
 		while (j-- > 0)
-			a = strcat(a, char(rand(1, 256)));
+			a = strcat(a, char(rand(32, 127)));
 		A[i] = a;
 		fputs(f, a);
 		pos[i+1] = ftell(f);
 		if (verbose > 1)
 			printf("A[%d] has length %d\n", i, strlen(a));
 	}
+	fflush(f);
 	if (verbose > 1)
 		printf("File has size %d\n", pos[i]);
 	freopen(f, "r");
@@ -216,12 +237,17 @@ define ttest(str, m, n, verbose)
 				break;
 			fseek(f, -1, 1);
 		}
-		if (ftell(f) != pos[i + 1]) {
+		if (ftell(f) != pos[i + 1] - 1) {
 			print 'failed';
 			printf("**** Failure 5 for i = %d\n", i);
 			return 1;
 		}
 	}
+	if (iserror(fclose(f))) {
+		print 'failed';
+		printf("**** Failure 6 for i = %d\n", i);
+		return 1;
+	}
 	i = rm("junk4600");
 	if (verbose > 0) {
 		printf("passed\n");
@@ -298,14 +324,3 @@ define test4600(v, tnum)
 	}
 	return tnum;
 }
-
-global lib_debug;
-
-if (lib_debug >= 0) {
-	print "stest(str [, verbose]) defined";
-	print "ttest([m, [n [,verbose]]]) defined";
-	print "sprint(x) defined";
-	print "findline(f,s) defined";
-	print "findlineold(f,s) defined";
-	print "test4600(verbose, tnum) defined";
-}

cal/test5100.cal

@@ -0,0 +1,71 @@
+/*
+ * test5100 - 5100 series of the regress.cal test suite
+ *
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
+ *
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test5100.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test5100.cal,v $
+ *
+ * Under source code control:	1996/12/02 23:57:10
+ * File existed as early as:	1996
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+global defaultverbose = 1;	/* default verbose value */
+global err;
+
+/*
+ * We test the new code generator declaration scope and order.
+ *
+ * In this function two static variables a5100 and b5100 are created,
+ * with zero value, when the definition is read.
+ *
+ * The variable a5100 is initialized with the value x if and when this
+ * function is first called with a positive even x. The varable b5100
+ * is similarly initialized if and when this function is first called positive
+ * odd x.
+ *
+ * Each time this function is called with positive integer x, a5100 or
+ * b5100 is incremented.
+ *
+ * Finally the values of the static variables are assigned to the global
+ * variables a5100 and b5100.
+ *
+ * Immediately after the last of several calls to this function
+ * a5100 = 0 if none of the x's have been positive even, otherwise
+ * a5100 = the first positive even x + the number of positive even x's,
+ * and b5100 = 0 if none of the x's have been positive odd, otherwise
+ * b5100 = the first positive odd x + the number of positive odd x's.
+ */
+define test5100(x)
+{
+	if (isint(x) && x > 0) {
+		if (iseven(x)) {
+			static a5100 = x;
+			a5100++;
+		} else {
+			static b5100 = x;
+			b5100++;
+		}
+	}
+	global a5100 = a5100, b5100 = b5100;
+}

cal/test5200.cal

@@ -0,0 +1,53 @@
+/*
+ * test5200 - 5200 series of the regress.cal test suite
+ *
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
+ *
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test5200.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test5200.cal,v $
+ *
+ * Under source code control:	1997/02/07 02:48:10
+ * File existed as early as:	1997
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+global defaultverbose = 1;	/* default verbose value */
+global err;
+
+/*
+ * test the fix of a global/static bug
+ *
+ * Given the following:
+ *
+ *	global a = 10;
+ *	static a = 20;
+ *	define f(x) = a + x;
+ *	define g(x) {global a = 30; return a + x;}
+ *	define h(x) = a + x;
+ *
+ * Older versions of
+ */
+global a5200 = 10;
+static a5200 = 20;
+define f5200(x) = a5200 + x;
+define g5200(x) {global a5200 = 30; return a5200 + x;}
+define h5200(x) = a5200 + x;

cal/test8400.cal

@@ -0,0 +1,48 @@
+/*
+ * test8400 - 8400 series of the regress.cal test suite
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test8400.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test8400.cal,v $
+ *
+ * Under source code control:	1999/10/31 01:00:03
+ * File existed as early as:	1999
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+print "8401: in test8400.cal";
+
+/*
+ * test8400 - dummy function to allow a check of quit-based memory leaks
+ */
+define test8400()
+{
+    local x8401 = 19937;    /* watch for lost memory */
+    static s8401 = 44497;   /* watch for lost memory */
+
+    return x8401+s8401;
+}
+print "8402: parsed test8400()";
+vrfy(test8400() == 64434,	    '8403: test8400() == 64434');
+
+quit;
+prob('quit did not end test8400.cal');

cal/test8500.cal

@@ -0,0 +1,264 @@
+/*
+ * test8500 - 8500 series of the regress.cal test suite
+ *
+ * Copyright (C) 1999  Ernest Bowen and Landon Curt Noll
+ *
+ * Primary author:  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: test8500.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/test8500.cal,v $
+ *
+ * Under source code control:	1999/11/12 20:59:59
+ * File existed as early as:	1999
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Tests of // and % operators
+ */
+
+
+global err_8500;	/* divmod_8500 error count */
+global L_8500;		/* list of problem values */
+global ver_8500;	/* test verbosity - see setting comment near bottom */
+global old_seed_8500;	/* old srand() seed */
+
+/*
+ * save the config state so that we can change it and restore later
+ */
+global cfg_8500 = config("all");
+
+
+/*
+ * onetest_8500 - perform one division / remainder test
+ *
+ * Returns:
+ *	0 = test was successful
+ *	>0 = test error indicator
+ */
+define onetest_8500(a,b,rnd) {
+	local q, r, s, S;
+
+	/*
+	 * set a random rounding mode
+	 */
+	config("quo", rnd), config("mod", rnd);
+
+	/*
+	 * perform the division and mod
+	 */
+	q = a // b;
+	r = a % b;
+
+	/*
+	 * verify the fundamental math
+	 */
+	if (a != q * b + r)
+		return 1;
+
+	/*
+	 * determine if the rounding worked
+	 */
+	if (b) {
+		if (rnd & 16)
+			s = sgn(abs(r) - abs(b)/2);
+		else
+			s = sgn(abs(r) - abs(b));
+
+		if (s < 0 || r == 0)
+			return 0;
+
+		if (s > 0)
+			return 2;
+
+		if (((rnd & 16) && s == 0) || !(rnd & 16)) {
+
+			S = sgn(r) * sgn(b);   /* This is sgn(a/b) - a//b */
+			switch (rnd & 15) {
+				case 0: return (S < 0) ? 3 : 0;
+				case 1: return (S > 0) ? 4 : 0;
+				case 2: return (S != sgn(a)*sgn(b)) ? 5 : 0;
+				case 3: return (S != -sgn(a)*sgn(b)) ? 6 : 0;
+					break;
+				case 4: return (S != sgn(b)) ? 7 : 0;
+				case 5: return (S != -sgn(b)) ? 8 : 0;
+				case 6: return (S != sgn(a)) ? 9 : 0;
+				case 7: return (S != -sgn(a)) ? 10 : 0;
+				case 8: return (isodd(q)) ? 11 : 0;
+				case 9: return (iseven(q)) ? 12 : 0;
+				case 10: return (iseven(q) != (a/b > 0)) ? 13:0;
+				case 11: return (isodd(q) != (a/b > 0)) ? 14:0;
+				case 12: return (iseven(q) != (b > 0)) ? 15 : 0;
+				case 13: return (isodd(q) != (b > 0)) ? 16 : 0;
+				case 14: return (iseven(q) != (a > 0)) ? 17 : 0;
+				case 15: return (isodd(q) != (a > 0)) ? 18 : 0;
+			}
+		}
+	}
+
+	/*
+	 * all is well
+	 */
+	return 0;
+}
+
+
+/*
+ * divmod_8500 - perform a bunch of pseudo-random // and % test
+ *
+ * divmod_8500(N, M1, M2) will perform N tests with randomly chosen integers
+ * a, b with abs(a) < M1, abs(b) < M2, which with 50% probability are
+ * converted to a = (2 * a + 1) * b,  b = 2 * b (to give case where
+ * a / b is an integer + 1/2).
+ *
+ * N defaults to 10, M1 to 2^128, M2 to 2^64
+ *
+ * The testnum, if > 0, is used while printing a failure or success.
+ *
+ * The rounding parameter is randomly chosen.
+ *
+ * After a run of divmod_8500 the a, b, rnd values which gave failure are
+ * stored in the list L_8500.  L_8500[0], L_8500[1], L_8500[2] are a, b, rnd for the first
+ * test, etc.
+ */
+define divmod_8500(N = 10, M1 = 2^128, M2 = 2^64, testnum = 0)
+{
+	local a, b, i, v, rnd;
+	local errmsg;		/* error message to display */
+
+	/*
+	 * firewall
+	 */
+	if (!isint(M1) || M1 < 2)
+		quit "Bad second arg for dtest";
+
+	if (!isint(M2) || M2 < 2)
+		quit "Bad third arg for dtest";
+
+	/*
+	 * test setup
+	 */
+	err_8500 = 0;
+	L_8500 = list();
+
+	/*
+	 * perform the random results
+	 */
+	for (i = 0; i < N; i++) {
+
+		/*
+		 * randomly select two values in the range controlled by M1,M2
+		 */
+		a = rand(-M1+1, M1);
+		b = rand(-M2+1, M2);
+		if (rand(2)) {
+			a = (2 * a + 1) * b;
+			b *= 2;
+		}
+
+		/*
+		 * seelect one of the 32 rounding modes at random
+		 */
+		rnd = rand(32);
+
+		/*
+		 * ver_8500 pre-test reporting
+		 */
+		if (ver_8500 > 1)
+			printf("Test %d: a = %d, b = %d, rnd = %d\n",
+					 i, a, b, rnd);
+
+		/*
+		 * perform the actual test
+		 */
+		v = onetest_8500(a, b, rnd);
+
+		/*
+		 * individual test analysis
+		 */
+		if (v != 0) {
+			err_8500++;
+			if (ver_8500 != 0) {
+				if (testnum > 0) {
+					errmsg = strprintf(
+						"Failure %d on test %d", v, i);
+					prob(errmsg);
+				} else {
+					printf("Failure %d on test %d", v, i);
+				}
+			}
+			append(L_8500, a, b, rnd);
+		}
+	}
+
+	/*
+	 * report in the results
+	 */
+	if (err_8500) {
+		if (testnum > 0) {
+			errmsg = strprintf(
+			    "%d: divmod_8500(%d,,,%d): %d failures",
+			    testnum, N, testnum, err_8500);
+			prob(errmsg);
+		} else {
+			printf("%s failure%s", err_8500,
+			       (err_8500 > 1) ? "s" : "");
+		}
+	} else {
+		if (testnum > 0) {
+			errmsg = strprintf("%d: divmod_8500(%d,,,%d)",
+			    testnum, N, testnum);
+			vrfy(err_8500 == 0, errmsg);
+		} else {
+			print "No failure";
+		}
+	}
+}
+
+/*
+ * ver_8500 != 0 displays failures; ver_8500 > 1 displays all numbers tested
+ */
+ver_8500 = 0;
+print '8501: ver_8500 = 0';
+old_seed_8500 = srand(31^61);
+print '8502: old_seed_8500 = srand(31^61)';
+
+/*
+ * do the tests
+ */
+divmod_8500(250, 2^128, 2^1, 8503);
+divmod_8500(250, 2^128, 2^64, 8504);
+divmod_8500(250, 2^256, 2^64, 8505);
+divmod_8500(250, 2^1024, 2^64, 8506);
+divmod_8500(250, 2^1024, 2^128, 8507);
+divmod_8500(250, 2^16384, 2^1024, 8508);
+divmod_8500(1000, 2^128, 2^64, 8509);
+
+/*
+ * restore state
+ */
+config("all", cfg_8500),;
+print '8510: config("all", cfg_8500),';
+srand(old_seed_8500),;
+print '8511: srand(old_seed_8500),';
+
+/*
+ * finished with 8500 tests
+ */
+print '8512: Ending test_divmod';

cal/unitfrac.cal

@@ -0,0 +1,55 @@
+/*
+ * unixfrac - represent a fraction as a sum of distince unit fractions
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: unitfrac.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/unitfrac.cal,v $
+ *
+ * Under source code control:	1990/02/15 01:50:38
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Represent a fraction as sum of distinct unit fractions.
+ * The output is the unit fractions themselves, and in square brackets,
+ * the number of digits in the numerator and denominator of the value left
+ * to be found.	 Numbers larger than 3.5 become very difficult to calculate.
+ */
+
+
+define unitfrac(x)
+{
+	local	d, di, n;
+
+	if (x <= 0)
+		quit "Non-positive argument";
+	d = 2;
+	do {
+		n = int(1 / x) + 1;
+		if (n > d)
+			d = n;
+		di = 1/d;
+		print '	 [': digits(num(x)): '/': digits(den(x)): ']',, di;
+		x -= di;
+		d++;
+	} while ((num(x) > 1) || (x == di) || (x == 1));
+	print '	 [1/1]',, x;
+}

cal/varargs.cal

@@ -0,0 +1,54 @@
+/*
+ * varargs - example of a varargs-like use
+ *
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: varargs.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/varargs.cal,v $
+ *
+ * Under source code control:	1991/05/22 21:56:34
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Example program to use 'varargs'.
+ *
+ * Program to sum the cubes of all the specified numbers.
+ */
+
+
+define sc()
+{
+	local s, i;
+
+	s = 0;
+	for (i = 1; i <= param(0); i++) {
+		if (!isnum(param(i))) {
+			print "parameter",i,"is not a number";
+			continue;
+		}
+		s += param(i)^3;
+	}
+	return s;
+}
+
+if (config("resource_debug") & 3) {
+    print "sc(a, b, ...) defined";
+}

cal/xx_print.cal

@@ -0,0 +1,289 @@
+/*
+ * xx_print - demo print object routines
+ *
+ * Copyright (C) 1999  Ernest Bowen
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: xx_print.cal,v 29.1 1999/12/14 09:15:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/xx_print.cal,v $
+ *
+ * Under source code control:	1997/04/17 00:08:50
+ * File existed as early as:	1997
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+global listmax = 3;
+global matrowmax = 3;
+global matcolmax = 3;
+print "globals listmax, matrowmax, matcolmax defined; all assigned value 3";
+print;
+
+global blkmax = 8;
+print "global blkmax defined, assigned value 8";
+print;
+
+B = blk();
+define is_octet(a) = istype(a, B[0]);
+
+define list_print(a) {
+	local i;
+	print "(":;
+	for (i = 0; i < size(a); i++) {
+		if (i > 0)
+			print ",":;
+		if (i >= listmax) {
+			print "...":;
+			break;
+		}
+		print a[[i]]:;
+	}
+	print ")":;
+}
+
+define mat_print (a) {
+	local i, j;
+
+	if (matdim(a) == 1) {
+		for (i = 0; i < size(a); i++) {
+			if (i >= matrowmax) {
+				printf("  ...");
+				break;
+			}
+			printf("%8d", a[i]);
+		}
+		return;
+	}
+	if (matdim(a) > 2)
+		quit "Dimension for mat_print greater than 2";
+
+	for (i = matmin(a,1); i <= matmax(a,1); i++) {
+		if (i >= matmin(a,1) + matcolmax) {
+			print "	    ...";
+			break;
+		}
+		for (j = matmin(a,2); j <= matmax(a,2); j++) {
+			if (j >= matmin(a,2) + matrowmax) {
+				printf("   ...");
+				break;
+			}
+			printf("%8d", a[i,j]);
+		}
+		print;
+	}
+}
+
+define octet_print(a) {
+	switch(a) {
+		case 8: print "BS":;
+			return;
+		case 9: print "HT":;
+			return;
+		case 10: print "NL":;
+			return;
+		case 12: print "FF":;
+			return;
+		case 13: print "CR":;
+			return;
+		case 27: print "ESC":;
+			return;
+	}
+	if (a > 31 && a < 127)
+		print char(a):;
+	else
+		print "Non-print":;
+}
+
+
+define blk_print(a) {
+	local i, n;
+
+	n = size(a);
+
+	printf("Unnamed block with %d bytes of data\n", n);
+	print "First few characters: ":;
+	for (i = 0; i < n; i++) {
+		if (i >= blkmax) {
+			print "...",;
+			break;
+		}
+		print a[i],;
+	}
+}
+
+
+define nblk_print (a) {
+	local n, i;
+
+	n = size(a);
+
+	printf("Block named \"%s\" with %d bytes of data\n", name(a), n);
+	print "First few characters: ":;
+	for (i = 0; i < n; i++) {
+		if (i >= blkmax) {
+			print "...",;
+			break;
+		}
+		print a[i],;
+	}
+}
+
+
+define strchar(a) {
+
+	if (isstr(a))
+		a = ord(a);
+
+	else if (is_octet(a))
+		a = a;		/* This converts octet to number */
+
+	else if (!isint(a) || a < 0 || a > 255)
+		quit "Bad argument for strchar";
+
+	switch (a) {
+		case 7: print "\\a":;
+			return;
+		case 8: print "\\b":;
+			return;
+		case 9: print "\\t":;
+			return;
+		case 10: print "\\n":;
+			return;
+		case 11: print "\\v":;
+			return;
+		case 12: print "\\f":;
+			return;
+		case 13: print "\\r":;
+			return;
+		case 27: print "\\e":;
+			return;
+		case 34: print "\\\"":;
+			return;
+		case 39: print "\\\'":;
+			return;
+		case 92: print "\\\\":;
+			return;
+	}
+	if (a > 31 && a < 127) {
+		print char(a):;
+		return;
+	}
+	print "\\":;
+	if (a >= 64) print a // 64:;
+	a = a % 64;
+	if (a >= 8) print a // 8:;
+	a = a % 8;
+	print a:;
+}
+
+
+define file_print(a) {
+	local c;
+
+	rewind(a);
+	for (;;) {
+		c = fgetc(a);
+		if (iserror(c))
+			quit "Failure when reading from file";
+		if (isnull(c))
+			break;
+		strchar(c);
+	}
+	print;
+}
+
+
+define error_print(a) {
+	local n = iserror(a);
+
+	if (n == 10001) {
+		print "1/0":;
+		return;
+	}
+	if (n == 10002) {
+		print "0/0":;
+		return;
+	}
+	print strerror(a):;
+}
+
+
+L = list(1,2,3,4,5);
+
+mat M1[5] = {1,2,3,4,5};
+
+mat M2[4,4] = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
+
+B1 = blk() = {"A", "B", "C", "D"};
+B2 = blk("sample") = {77, 102, 29, 13, 126, 8, 100, 27, 0, 1};
+
+dummy = rm("-f", "xx_print.foo");
+f = fopen("xx_print.foo", "w+");
+
+fputstr(f, "alpha\nbeta\f\"gamma\"");
+fputstr(f, "\x09delta\n");
+fputstr(f, "\1\2\3");
+fflush(f);
+
+print "Here is a list:";
+print L;
+print;
+
+print "A one-dimensional matrix:";
+print M1;
+print;
+
+print "A two-dimensional matrix:";
+print M2;
+print;
+
+print "An unnamed block:";
+print B1;
+print;
+
+print "A named block with some special octets:";
+print B2;
+print;
+
+print "A file:";
+print f;
+print;
+
+undefine mat_print;
+
+fclose(f);
+print "f closed";
+print;
+dummy = rm("-f", "xx_print.foo");
+
+mat M[7] = {1, 2, 3/0, 0/0, eval(2+3), fgetc(f), 7};
+print "Here is a matrix with some \"errors\" as elements":
+print M;
+print;
+
+define octet_print(a) {
+	local b, x;
+	x = a;
+
+	for (b = 128; b; b >>= 1)
+		print (x >= b ? (x -= b, 1) : 0):;
+}
+
+print "Here is the earlier block with a new octet_print()";
+print B1;
+print;

calc.h

@@ -1,71 +1,96 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * calc - definitions for calculator program
  *
- * Definitions for calculator program.
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.2 $
+ * @(#) $Id: calc.h,v 29.2 1999/12/14 19:37:46 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/calc.h,v $
+ *
+ * Under source code control:	1990/02/15 01:48:31
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
-#ifndef	CALC_H
-#define	CALC_H
 
+#if !defined(__CALC_H__)
+#define __CALC_H__
 
-#include <stdio.h>
 #include <setjmp.h>
+
 #include "value.h"
 
+#include "have_const.h"
+
 
 /*
  * Configuration definitions
  */
-#define	CALCPATH	"CALCPATH"	/* environment variable for files */
-#define	CALCRC		"CALCRC"	/* environment variable for startup */
-#define	CALCBINDINGS	"CALCBINDINGS"	/* environment variable for hist bindings */
-#define	HOME		"HOME"		/* environment variable for home dir */
-#define	PAGER		"PAGER"		/* environment variable for help */
-#define	SHELL		"SHELL"		/* environment variable for shell */
-#define DEFAULTCALCHELP	"help"		/* help file that -h prints */
+#define CALCPATH	"CALCPATH"	/* environment variable for files */
+#define CALCRC		"CALCRC"	/* environment variable for startup */
+#define CALCBINDINGS	"CALCBINDINGS"	/* env variable for hist bindings */
+#define HOME		"HOME"		/* environment variable for home dir */
+#define PAGER		"PAGER"		/* environment variable for help */
+#define SHELL		"SHELL"		/* environment variable for shell */
+#define DEFAULTCALCBINDINGS "bindings"	/* default calc bindings file */
+#define DEFAULTCALCHELP "help"		/* help file that -h prints */
 #define DEFAULTSHELL	"sh"		/* default shell to use */
-#define	CALCEXT		".cal"	/* extension for files read in */
-#define	PATHSIZE	1024	/* maximum length of path name */
-#define	HOMECHAR	'~'	/* char which indicates home directory */
+#define CALCEXT		".cal"	/* extension for files read in */
+#define MAX_CALCRC	1024	/* maximum length of $CALCRC */
+#define HOMECHAR	'~'	/* char which indicates home directory */
 #define DOTCHAR		'.'	/* char which indicates current directory */
-#define	PATHCHAR	'/'	/* char which separates path components */
-#define	LISTCHAR	':'	/* char which separates paths in a list */
-#define	MAXCMD		16384	/* maximum length of command invocation */
-#define	MAXERROR	512	/* maximum length of error message string */
+#define PATHCHAR	'/'	/* char which separates path components */
+#define LISTCHAR	':'	/* char which separates paths in a list */
+#define MAXCMD		16384	/* maximum length of command invocation */
+#define MAXERROR	512	/* maximum length of error message string */
 
-#define	SYMBOLSIZE	256	/* maximum symbol name size */
-#define	MAXINDICES	20	/* maximum number of indices for objects */
-#define	MAXLABELS	100	/* maximum number of user labels in function */
-#define	MAXOBJECTS	10	/* maximum number of object types */
-#define	MAXSTRING	1024	/* maximum size of string constant */
-#define	MAXSTACK	1000	/* maximum depth of evaluation stack */
-#define	MAXFILES	20	/* maximum number of opened files */
+#define SYMBOLSIZE	256	/* maximum symbol name size */
+#define MAXINDICES	20	/* maximum number of indices for objects */
+#define MAXLABELS	100	/* maximum number of user labels in function */
+#define MAXSTRING	1024	/* maximum size of string constant */
+#define MAXSTACK	1000	/* maximum depth of evaluation stack */
+#define MAXFILES	20	/* maximum number of opened files */
 #define PROMPT1		"> "	/* default normal prompt*/
 #define PROMPT2		">> "	/* default prompt inside multi-line input */
 
 
-#define	TRACE_NORMAL	0x00	/* normal trace flags */
-#define	TRACE_OPCODES	0x01	/* trace every opcode */
-#define	TRACE_NODEBUG	0x02	/* suppress debugging opcodes */
+#define TRACE_NORMAL	0x00	/* normal trace flags */
+#define TRACE_OPCODES	0x01	/* trace every opcode */
+#define TRACE_NODEBUG	0x02	/* suppress debugging opcodes */
 #define TRACE_LINKS	0x04	/* display links for real and complex numbers */
 #define TRACE_FNCODES	0x08	/* display code for newly defined function */
-#define	TRACE_MAX	0x0f	/* maximum value for trace flag */
+#define TRACE_MAX	0x0f	/* maximum value for trace flag */
 
 #define ABORT_NONE	0	/* abort not needed yet */
-#define ABORT_STATEMENT	1	/* abort on statement boundary */
+#define ABORT_STATEMENT 1	/* abort on statement boundary */
 #define ABORT_OPCODE	2	/* abort on any opcode boundary */
 #define ABORT_MATH	3	/* abort on any math operation */
 #define ABORT_NOW	4	/* abort right away */
 
+#define ERRMAX 20		/* default errmax value */
+
 /*
  * File ids corresponding to standard in, out, error, and when not in use.
  */
-#define	FILEID_STDIN	((FILEID) 0)
-#define	FILEID_STDOUT	((FILEID) 1)
-#define	FILEID_STDERR	((FILEID) 2)
-#define	FILEID_NONE	((FILEID) -1)
+#define FILEID_STDIN	((FILEID) 0)
+#define FILEID_STDOUT	((FILEID) 1)
+#define FILEID_STDERR	((FILEID) 2)
+#define FILEID_NONE	((FILEID) -1)
 
 /*
  * File I/O routines.
@@ -94,21 +119,24 @@ extern int flushall(void);
 extern int idfputstr(FILEID id, char *str);
 extern int rewindid(FILEID id);
 extern void rewindall(void);
-extern long filesize(FILEID id);
+extern ZVALUE zfilesize(FILEID id);
 extern void showfiles(void);
 extern int fscanfid(FILEID id, char *fmt, int count, VALUE **vals);
 extern int scanfstr(char *str, char *fmt, int count, VALUE **vals);
-extern long ftellid(FILEID id);
-extern long fseekid(FILEID id, long offset, int whence);
+extern int ftellid(FILEID id, ZVALUE *res);
+extern int fseekid(FILEID id, ZVALUE offset, int whence);
 extern int isattyid(FILEID id);
-long fsearch(FILEID id, char *str, long pos);
-long frsearch(FILEID id, char *str, long pos);
+extern int fsearch(FILEID id, char *str, ZVALUE start, ZVALUE end, ZVALUE *res);
+extern int frsearch(FILEID id, char *str, ZVALUE first, ZVALUE last, ZVALUE *res);
+extern void showconstants(void);
+extern void freeconstant(unsigned long);
+extern void freestringconstant(long);
+extern void trimconstants(void);
 
 /*
  * Input routines.
  */
-extern FILE *f_open(char *name, char *mode);
-extern int openstring(char *str);
+extern int openstring(char *str, long num);
 extern int openterminal(void);
 extern int opensearchfile(char *name, char *pathlist, char *exten, int reopen_ok);
 extern char *nextline(void);
@@ -117,12 +145,12 @@ extern void reread(void);
 extern void resetinput(void);
 extern void setprompt(char *);
 extern BOOL inputisterminal(void);
+extern int inputlevel(void);
+extern long calclevel(void);
 extern char *inputname(void);
 extern long linenumber(void);
 extern void runrcfiles(void);
 extern void closeinput(void);
-extern FILE *curstream(void);
-
 
 /*
  * Other routines.
@@ -131,21 +159,55 @@ extern NUMBER *constvalue(unsigned long index);
 extern long addnumber(char *str);
 extern long addqconstant(NUMBER *q);
 extern void initstack(void);
-extern void version(FILE *stream);
 extern void getcommands(BOOL toplevel);
 extern void givehelp(char *type);
-extern void hash_init(void);
 extern void libcalc_call_me_first(void);
-
+extern void libcalc_call_me_last(void);
+extern BOOL calc_tty(int fd);
+extern BOOL orig_tty(int fd);
+extern void showerrors(void);
+extern char *calc_strdup(CONST char *);
+extern void getshellfile(char *shellfile);
 
 /*
- * Global data definitions.
+ * Initialization
+ */
+extern void initialize(void);
+extern void reinitialize(void);
+extern int isatty(int tty);	/* TRUE if fd is a tty */
+extern char *version(void);	/* return version string */
+extern int post_init;		/* TRUE => setjmp for math_error is ready */
+
+/*
+ * global flags and definitions
  */
 extern int abortlevel;		/* current level of aborts */
 extern BOOL inputwait;		/* TRUE if in a terminal input wait */
-extern VALUE *stack;		/* execution stack */
 extern jmp_buf jmpbuf;		/* for errors */
-extern int start_done;		/* TRUE => start up processing finished */
+
+extern int p_flag;		/* TRUE => pipe mode */
+extern int q_flag;		/* TRUE => don't execute rc files */
+extern int u_flag;		/* TRUE => unbuffer stdin and stdout */
+extern int d_flag;		/* TRUE => disable heading, resource_debug */
+extern int c_flag;		/* TRUE => continue after error if permitted */
+extern int i_flag;		/* TRUE => try to go interactive after error */
+extern int s_flag;		/* TRUE => keep args as strings for argv() */
+extern int stoponerror;		/* >0 => stop, <0 => continue, ==0 => use -c */
+extern BOOL abort_now;		/* TRUE => try to go interactive */
+
+extern int argc_value;		/* count of argv[] strings for argv() builtin */
+extern char **argv_value;	/* argv[] strings for argv() builtin */
+
+extern char *pager;		/* $PAGER or default */
+extern int stdin_tty;		/* TRUE if stdin is a tty */
+extern int havecommands;	/* TRUE if have cmd args) */
+extern char *program;		/* our name */
+extern char *base_name;		/* basename of our name */
+extern char cmdbuf[];		/* command line expression */
+
+extern int abortlevel;		/* current level of aborts */
+extern BOOL inputwait;		/* TRUE if in a terminal input wait */
+extern VALUE *stack;		/* execution stack */
 extern int dumpnames;		/* TRUE => dump names rather than indices */
 
 extern char *calcpath;		/* $CALCPATH or default */
@@ -153,13 +215,43 @@ extern char *calcrc;		/* $CALCRC or default */
 extern char *calcbindings;	/* $CALCBINDINGS or default */
 extern char *home;		/* $HOME or default */
 extern char *shell;		/* $SHELL or default */
+extern char *program;		/* our name (argv[0]) */
+
+extern int no_env;	/* TRUE (-e) => ignore env vars on startup */
+extern int errmax;	/* if >= 0, error when errcount exceeds errmax */
+extern int new_std;	/* TRUE (-n) => use newstd configuration */
 
 extern int allow_read;	/* FALSE => may not open any files for reading */
-extern int allow_write;	/* FALSE => may not open any files for writing */
+extern int allow_write; /* FALSE => may not open any files for writing */
 extern int allow_exec;	/* FALSE => may not execute any commands */
 
-extern int post_init;	/* TRUE => setjmp for math_error is ready */
+/*
+ * calc startup and run state
+ */
+typedef enum {
+    RUN_UNKNOWN = -1,		/* unknown or unset start state */
+    RUN_BEGIN = 0,		/* calc execution starts */
+    RUN_RCFILES = 1,		/* rc files being evaluated */
+    RUN_PRE_CMD_ARGS = 2,	/* prepare to evaluate cmd args */
+    RUN_CMD_ARGS = 3,		/* cmd args being evaluated */
+    RUN_PRE_TOP_LEVEL = 4,	/* prepare to start top level activity */
+    RUN_TOP_LEVEL = 5,		/* running at top level */
+    RUN_EXIT = 6,		/* normal exit from calc */
+    RUN_EXIT_WITH_ERROR = 7	/* exit with error */
+} run;
+extern run run_state;
+extern char *run_state_name(run state);
 
-#endif
+/*
+ * calc version information
+ */
+#define CALC_TITLE "C-style arbitrary precision calculator"
+extern int calc_major_ver;
+extern int calc_minor_ver;
+extern int calc_major_patch;
+extern char *calc_minor_patch;
+extern char *Copyright;
+extern char *version(void);
 
-/* END CODE */
+
+#endif /* !__CALC_H__ */

calcerr.tbl

@@ -1,3 +1,31 @@
+#
+# calcerr - error codes and messages
+#
+# Copyright (C) 1999  Ernest Bowen
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: calcerr.tbl,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/calcerr.tbl,v $
+#
+# Under source code control:	1996/05/23 17:38:44
+# File existed as early as:	1996
+#
+# Share and enjoy!  :-)		http://reality.sgi.com/chongo/tech/comp/calc/
+
 # This file is used to build calcerr.h include file.
 #
 # Lines should be of the form:
@@ -120,16 +148,22 @@ E_UNGETC1	Non-file argument for ungetc
 E_UNGETC2	File not open for reading for ungetc
 E_UNGETC3	Bad second argument or other error for ungetc
 E_BIGEXP	Exponent too big in scanning
-E_ISATTY1	Non-file argument for isatty
-E_ISATTY2	File not open for isatty
+E_ISATTY1	E_ISATTY1 is no longer used
+E_ISATTY2	E_ISATTY2 is no longer used
 E_ACCESS1	Non-string first argument for access
 E_ACCESS2	Bad second argument for access
 E_SEARCH1	Bad first argument for search
 E_SEARCH2	Bad second argument for search
 E_SEARCH3	Bad third argument for search
+E_SEARCH4	Bad fourth argument for search
+E_SEARCH5	Cannot find fsize or fpos for search
+E_SEARCH6	File not readable for search
 E_RSEARCH1	Bad first argument for rsearch
 E_RSEARCH2	Bad second argument for rsearch
 E_RSEARCH3	Bad third argument for rsearch
+E_RSEARCH4	Bad fourth argument for rsearch
+E_RSEARCH5	Cannot find fsize or fpos for rsearch
+E_RSEARCH6	File not readable for rsearch
 E_FOPEN3	Too many open files
 E_REWIND2	Attempt to rewind a file that is not open
 E_STRERROR1	Bad argument type for strerror
@@ -148,7 +182,7 @@ E_MATFILL1	Non-variable first argument for matfill
 E_MATFILL2	Non-matrix first argument-value for matfill
 E_MATDIM	Non-matrix argument for matdim
 E_MATSUM	Non-matrix argument for matsum
-E_ISIDENT	Non-matrix argument for isident
+E_ISIDENT	E_ISIDENT is no longer used
 E_MATTRANS1	Non-matrix argument for mattrans
 E_MATTRANS2	Non-two-dimensional matrix for mattrans
 E_DET1		Non-matrix argument for det
@@ -191,3 +225,153 @@ E_RM2		Unable to remove a file
 E_RDPERM	Operation allowed because calc mode disallows read operations
 E_WRPERM	Operation allowed because calc mode disallows write operations
 E_EXPERM	Operation allowed because calc mode disallows exec operations
+E_MIN		Unordered arguments for min
+E_MAX		Unordered arguments for max
+E_LISTMIN	Unordered items for minimum of list
+E_LISTMAX	Unordered items for maximum of list
+E_SIZE		Size undefined for argument type
+E_NO_C_ARG	Calc must be run with a -C argument to use custom function
+E_NO_CUSTOM	Calc was built with custom functions disabled
+E_UNK_CUSTOM	Custom function unknown, try: show custom
+E_BLK1		Non-integral length for block
+E_BLK2		Negative or too-large length for block
+E_BLK3		Non-integral chunksize for block
+E_BLK4		Negative or too-large chunksize for block
+E_BLKFREE1	Named block does not exist for blkfree
+E_BLKFREE2	Non-integral id specification for blkfree
+E_BLKFREE3	Block with specified id does not exist
+E_BLKFREE4	Block already freed
+E_BLKFREE5	No-realloc protection prevents blkfree
+E_BLOCKS1	Non-integer argument for blocks
+E_BLOCKS2	Non-allocated index number for blocks
+E_COPY1		Non-integer or negative source index for copy
+E_COPY2		Source index too large for copy
+E_COPY3		E_COPY3 is no longer used
+E_COPY4		Non-integer or negative number for copy
+E_COPY5		Number too large for copy
+E_COPY6		Non-integer or negative destination index for copy
+E_COPY7		Destination index too large for copy
+E_COPY8		Freed block source for copy
+E_COPY9		Unsuitable source type for copy
+E_COPY10	Freed block destinction for copy
+E_COPY11	Unsuitable destination type for copy
+E_COPY12	Incompatible source and destination for copy
+E_COPY13	No-copy-from source variable
+E_COPY14	No-copy-to destination variable
+E_COPY15	No-copy-from source named block
+E_COPY16	No-copy-to destination named block
+E_COPY17	No-relocation destination for copy
+E_COPYF1	File not open for copy
+E_COPYF2	fseek or fsize failure for copy
+E_COPYF3	fwrite error for copy
+E_COPYF4	fread error for copy
+E_PROTECT1	Non-variable first argument for protect
+E_PROTECT2	Non-integer second argument for protect
+E_PROTECT3	Out-of-range second argument for protect
+E_MATFILL3	No-copy-to destination for matfill
+E_MATFILL4	No-assign-from source for matfill
+E_MATTRACE1	Non-matrix argument for mattrace
+E_MATTRACE2	Non-two-dimensional argument for mattrace
+E_MATTRACE3	Non-square argument for mattrace
+E_TAN1		Bad epsilon for tan
+E_TAN2		Bad argument for tan
+E_COT1		Bad epsilon for cot
+E_COT2		Bad argument for cot
+E_SEC1		Bad epsilon for sec
+E_SEC2		Bad argument for sec
+E_CSC1		Bad epsilon for csc
+E_CSC2		Bad argument for csc
+E_SINH1		Bad epsilon for sinh
+E_SINH2		Bad argument for sinh
+E_COSH1		Bad epsilon for cosh
+E_COSH2		Bad argument for cosh
+E_TANH1		Bad epsilon for tanh
+E_TANH2		Bad argument for tanh
+E_COTH1		Bad epsilon for coth
+E_COTH2		Bad argument for coth
+E_SECH1		Bad epsilon for sech
+E_SECH2		Bad argument for sech
+E_CSCH1		Bad epsilon for csch
+E_CSCH2		Bad argument for csch
+E_ASIN1		Bad epsilon for asin
+E_ASIN2		Bad argument for asin
+E_ACOS1		Bad epsilon for acos
+E_ACOS2		Bad argument for acos
+E_ATAN1		Bad epsilon for atan
+E_ATAN2		Bad argument for atan
+E_ACOT1		Bad epsilon for acot
+E_ACOT2		Bad argument for acot
+E_ASEC1		Bad epsilon for asec
+E_ASEC2		Bad argument for asec
+E_ACSC1		Bad epsilon for acsc
+E_ACSC2		Bad argument for acsc
+E_ASINH1	Bad epsilon for asin
+E_ASINH2	Bad argument for asinh
+E_ACOSH1	Bad epsilon for acosh
+E_ACOSH2	Bad argument for acosh
+E_ATANH1	Bad epsilon for atanh
+E_ATANH2	Bad argument for atanh
+E_ACOTH1	Bad epsilon for acoth
+E_ACOTH2	Bad argument for acoth
+E_ASECH1	Bad epsilon for asech
+E_ASECH2	Bad argument for asech
+E_ACSCH1	Bad epsilon for acsch
+E_ACSCH2	Bad argument for acsch
+E_GD1		Bad epsilon for gd
+E_GD2		Bad argument for gd
+E_AGD1		Bad epsilon for agd
+E_AGD2		Bad argument for agd
+E_LOGINF	Log of zero or infinity
+E_STRADD	String addition failure
+E_STRMUL	String multiplication failure
+E_STRNEG	String reversal failure
+E_STRSUB	String subtraction failure
+E_BIT1		Bad argument type for bit
+E_BIT2		Index too large for bit
+E_SETBIT1	Non-integer second argument for setbit
+E_SETBIT2	Out-of-range index for setbit
+E_SETBIT3	Non-string first argument for setbit
+E_OR		Bad argument for or
+E_AND		Bad argument for and
+E_STROR		Allocation failure for string or
+E_STRAND	Allocation failure for string and
+E_XOR		Bad argument for xorvalue
+E_COMP		Bad argument for comp
+E_STRDIFF	Allocation failure for string diff
+E_STRCOMP	Allocation failure for string comp
+E_SEG1		Bad first argument for segment
+E_SEG2		Bad second argument for segment
+E_SEG3		Bad third argument for segment
+E_STRSEG	Failure for string segment
+E_HIGHBIT1	Bad argument type for highbit
+E_HIGHBIT2	Non-integer argument for highbit
+E_LOWBIT1	Bad argument type for lowbit
+E_LOWBIT2	Non-integer argument for lowbit
+E_CONTENT	Bad argument type for unary hash op
+E_HASHOP	Bad argument type for binary hash op
+E_HEAD1		Bad first argument for head
+E_HEAD2		Bad second argument for head
+E_STRHEAD	Failure for strhead
+E_TAIL1		Bad first argument for tail
+E_TAIL2		Bad second argument for tail
+E_STRTAIL	Failure for strtail
+E_STRSHIFT	Failure for strshift
+E_STRCMP	Non-string argument for strcmp
+E_STRNCMP	Bad argument type for strncmp
+E_XOR1		Varying types of argument for xor
+E_XOR2		Bad argument type for xor
+E_STRCPY	Bad argument type for strcpy
+E_STRNCPY	Bad argument type for strncpy
+E_BACKSLASH	Bad argument type for unary backslash
+E_SETMINUS	Bad argument type for setminus
+E_INDICES1	Bad first argument type for indices
+E_INDICES2	Bad second argument for indices
+E_EXP3		Too-large re(argument) for exp
+E_SINH3		Too-large re(argument) for sinh
+E_COSH3		Too-large re(argument) for cosh
+E_SIN3		Too-large im(argument) for sin
+E_COS3		Too-large im(argument) for cos
+E_GD3		Infinite or too-large result for gd
+E_AGD3		Infinite or too-large result for agd
+E_POWER4	Too-large value for power
+E_ROOT4		Too-large value for root

calcerr_c.awk

@@ -1,3 +1,33 @@
+#!/usr/bin/sed
+#
+# calcerr_c - help produce calcerr.c from calcerr.tbl
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: calcerr_c.awk,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/calcerr_c.awk,v $
+#
+# Under source code control:	1996/05/24 03:15:35
+# File existed as early as:	1996
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+#
 BEGIN {
     printf("#include <stdio.h>\n");
     printf("#include \"calcerr.h\"\n\n");
@@ -6,12 +36,12 @@ BEGIN {
     printf(" * names of calc error values\n");
     printf(" */\n");
     printf("CONST char *error_table[E__COUNT+2] = {\n");
-    printf("    \"No error\",\n");
+    printf("	\"No error\",\n");
 }
 {
     print $0;
 }
 END {
-    printf("    NULL\n");
+    printf("	NULL\n");
     printf("};\n");
 }

calcerr_c.sed

@@ -1,3 +1,33 @@
+#!/usr/bin/sed
+#
+# calcerr_c - help produce calcerr.c from calcerr.tbl
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: calcerr_c.sed,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/calcerr_c.sed,v $
+#
+# Under source code control:	1996/05/24 03:15:35
+# File existed as early as:	1996
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-)		http://reality.sgi.com/chongo/tech/comp/calc/
+#
 s/#.*//
 s/[	 ][	 ]*$//
 /^$/d

calcerr_h.awk

@@ -1,3 +1,33 @@
+#!/usr/bin/awk
+#
+# calcerr_h - help produce calcerr.h from calcerr.tbl
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: calcerr_h.awk,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/calcerr_h.awk,v $
+#
+# Under source code control:	1996/05/23 17:38:44
+# File existed as early as:	1996
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+#
 BEGIN {
     ebase = 10000;
     printf("#define E__BASE %d\t/* calc errors start above here */\n\n", ebase);

calcerr_h.sed

@@ -1,3 +1,33 @@
+#!/usr/bin/sed
+#
+# calcerr_h - help produce calcerr.h from calcerr.tbl
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: calcerr_h.sed,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/calcerr_h.sed,v $
+#
+# Under source code control:	1996/05/23 17:38:44
+# File existed as early as:	1996
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-)		http://reality.sgi.com/chongo/tech/comp/calc/
+#
 s/#.*//
 s/[	 ][	 ]*$//
 /^$/d

check.awk

@@ -1,74 +1,114 @@
+#!/usr/bin/awk
+#
+# check - check the regression output for problems
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: check.awk,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/check.awk,v $
+#
+# Under source code control:	1996/05/25 22:07:58
+# File existed as early as:	1996
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-)		http://reality.sgi.com/chongo/tech/comp/calc/
+#
 # This awk script will print 3 lines before and after any non-blank line that
-# does not begin with a number.  This allows the 'make debug' rule to remove
+# does not begin with a number.	 This allows the 'make debug' rule to remove
 # all non-interest lines the the 'make check' regression output while providing
 # 3 lines of context around unexpected output.
 #
 BEGIN {
-    havebuf0=0;
-    buf0=0;
-    havebuf1=0;
-    buf1=0;
-    havebuf2=0;
-    buf2=0;
-    error = 0;
+	havebuf0=0;
+	buf0=0;
+	havebuf1=0;
+	buf1=0;
+	havebuf2=0;
+	buf2=0;
+	error = 0;
+	end_seen = 0;
 }
 
 NF == 0 {
-    if (error > 0) {
-	if (havebuf2) {
-	    print buf2;
+	if (error > 0) {
+		if (havebuf2) {
+			print buf2;
+		}
+		--error;
 	}
-	--error;
-    }
-    buf2 = buf1;
-    havebuf2 = havebuf1;
-    buf1 = buf0;
-    havebuf1 = havebuf0;
-    buf0 = $0;
-    havebuf0 = 1;
-    next;
+	buf2 = buf1;
+	havebuf2 = havebuf1;
+	buf1 = buf0;
+	havebuf1 = havebuf0;
+	buf0 = $0;
+	havebuf0 = 1;
+	next;
 }
 
-$1 ~ /^[0-9]/ {
-    if (error > 0) {
-	if (havebuf2) {
-	    print buf2;
+/: Ending regression tests$/ {
+	end_seen = 1;
+}
+
+$1 ~ /^[0-9]+:/ {
+	if (error > 0) {
+		if (havebuf2) {
+			print buf2;
+		}
+		--error;
 	}
-	--error;
-    }
-    buf2 = buf1;
-    havebuf2 = havebuf1;
-    buf1 = buf0;
-    havebuf1 = havebuf0;
-    buf0 = $0;
-    havebuf0 = 1;
-    next;
+	buf2 = buf1;
+	havebuf2 = havebuf1;
+	buf1 = buf0;
+	havebuf1 = havebuf0;
+	buf0 = $0;
+	havebuf0 = 1;
+	next;
 }
 
 {
-    error = 6;
-    if (havebuf2) {
-	print buf2;
-    }
-    buf2 = buf1;
-    havebuf2 = havebuf1;
-    buf1 = buf0;
-    havebuf1 = havebuf0;
-    buf0 = $0;
-    havebuf0 = 1;
-    next;
+	error = 6;
+	if (havebuf2) {
+		print buf2;
+	}
+	buf2 = buf1;
+	havebuf2 = havebuf1;
+	buf1 = buf0;
+	havebuf1 = havebuf0;
+	buf0 = $0;
+	havebuf0 = 1;
+	next;
 }
 
 END {
-    if (error > 0 && havebuf2) {
-	print buf2;
-	--error;
-    }
-    if (error > 0 && havebuf1) {
-	print buf1;
-	--error;
-    }
-    if (error > 0 && havebuf0) {
-	print buf0;
-    }
+	if (error > 0 && havebuf2) {
+		print buf2;
+		--error;
+	}
+	if (error > 0 && havebuf1) {
+		print buf1;
+		--error;
+	}
+	if (error > 0 && havebuf0) {
+		print buf0;
+	}
+	if (error > 0 || !end_seen) {
+		exit(1);
+	} else {
+		exit(0);
+	}
 }

cmath.h

@@ -1,13 +1,36 @@
 /*
- * Copyright (c) 1993 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * cmath - data structures for extended precision complex arithmetic
  *
- * Data structure declarations for extended precision complex arithmetic.
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: cmath.h,v 29.1 1999/12/14 09:15:35 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/cmath.h,v $
+ *
+ * Under source code control:	1993/07/30 19:42:45
+ * File existed as early as:	1993
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
-#ifndef	CMATH_H
-#define	CMATH_H
+
+#if !defined(__CMATH_H__)
+#define __CMATH_H__
+
 
 #include "qmath.h"
 
@@ -73,8 +96,25 @@ extern COMPLEX *cexp(COMPLEX *c, NUMBER *epsilon);
 extern COMPLEX *cln(COMPLEX *c, NUMBER *epsilon);
 extern COMPLEX *ccos(COMPLEX *c, NUMBER *epsilon);
 extern COMPLEX *csin(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *ccosh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *csinh(COMPLEX *c, NUMBER *epsilon);
 extern COMPLEX *cpolar(NUMBER *q1, NUMBER *q2, NUMBER *epsilon);
 extern COMPLEX *crel(COMPLEX *c1, COMPLEX *c2);
+extern COMPLEX *casin(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cacos(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *catan(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cacot(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *casec(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cacsc(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *casinh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cacosh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *catanh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cacoth(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *casech(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cacsch(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cgd(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *cagd(COMPLEX *c, NUMBER *epsilon);
+
 
 
 /*
@@ -95,7 +135,7 @@ extern COMPLEX *swap_HALF_in_COMPLEX(COMPLEX *dest, COMPLEX *src, BOOL all);
 #define cisnegone(c)	(cisreal(c) && qisnegone((c)->real))
 #define cisrunit(c)	(cisreal(c) && qisunit((c)->real))
 #define cisiunit(c)	(qiszero((c)->real) && qisunit((c)->imag))
-#define	cisunit(c)	(cisrunit(c) || cisiunit(c))
+#define cisunit(c)	(cisrunit(c) || cisiunit(c))
 #define cistwo(c)	(cisreal(c) && qistwo((c)->real))
 #define cisint(c)	(qisint((c)->real) && qisint((c)->imag))
 #define ciseven(c)	(qiseven((c)->real) && qiseven((c)->imag))
@@ -108,6 +148,5 @@ extern COMPLEX *swap_HALF_in_COMPLEX(COMPLEX *dest, COMPLEX *src, BOOL all);
  */
 extern COMPLEX _czero_, _cone_, _conei_;
 
-#endif
 
-/* END CODE */
+#endif /* !__CMATH_H__ */

comfunc.c

@@ -1,11 +1,35 @@
 /*
- * Copyright (c) 1993 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * comfunc - extended precision complex arithmetic non-primitive routines
  *
- * Extended precision complex arithmetic non-primitive routines
+ * Copyright (C) 1999  David I. Bell and Ernest Bowen
+ *
+ * Primary author:  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: comfunc.c,v 29.1 1999/12/14 09:15:35 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/comfunc.c,v $
+ *
+ * Under source code control:	1990/02/15 01:48:13
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 #include "config.h"
 #include "cmath.h"
 
@@ -125,10 +149,12 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 	if (cisreal(c)) {
 		r = comalloc();
 		if (!qisneg(c->real)) {
+			qfree(r->real);
 			r->real = qsqrt(c->real, epsilon, R);
 			return r;
 		}
 		ntmp = qneg(c->real);
+		qfree(r->imag);
 		r->imag = qsqrt(ntmp, epsilon, R);
 		qfree(ntmp);
 		return r;
@@ -136,42 +162,10 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 
 	up1 = up2 = 0;
 	sign = (R & 64) != 0;
-#if 0
-	if (qiszero(epsilon)) {
-		aes = qsquare(c->real);
-		bes = qsquare(c->imag);
-		v = qqadd(aes, bes);
-		qfree(aes);
-		qfree(bes);
-		u = qsqrt(v, epsilon, 0);
-		qfree(v);
-		if (qiszero(u)) {
-			qfree(u);
-			return clink(&_czero_);
-		}
-		aes = qqadd(u, c->real);
-		qfree(u);
-		bes = qscale(aes, -1);
-		qfree(aes);
-		u = qsqrt(bes, epsilon, R);
-		qfree(bes);
-		if (qiszero(u)) {
-			qfree(u);
-			return clink(&_czero_);
-		}
-		aes = qscale(c->imag, -1);
-		v = qdiv(aes, u);
-		qfree(aes);
-		r = comalloc();
-		r->real = u;
-		r->imag = v;
-		return r;
-	}
-#endif
 	imsign = c->imag->num.sign;
 	es = qsquare(epsilon);
-	aes = qdiv(c->real, es);
-	bes = qdiv(c->imag, es);
+	aes = qqdiv(c->real, es);
+	bes = qqdiv(c->imag, es);
 	qfree(es);
 	zgcd(aes->den, bes->den, &g);
 	zequo(bes->den, g, &tmp1);
@@ -217,18 +211,19 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 				r = comalloc();
 				qtemp = *aes;
 				qtemp.num.sign = sign;
+				qfree(r->real);
 				r->real = qmul(&qtemp, epsilon);
 				qfree(aes);
 				bes = qscale(r->real, 1);
 				qtemp = *bes;
 				qtemp.num.sign = sign ^ imsign;
-				r->imag = qdiv(c->imag, &qtemp);
+				qfree(r->imag);
+				r->imag = qqdiv(c->imag, &qtemp);
 				qfree(bes);
 				return r;
 			}
 			s3 = zquo(tmp3, d, &tmp1, s2 < 0);
-		}
-		else {
+		} else {
 			s2 = zquo(tmp1, d, &tmp3, s1 ? (s1 < 0) : 16);
 			zfree(tmp1);
 			s3 = zsqrt(tmp3,&tmp1,(s1||s2) ? (s1<0 || s2<0) : 16);
@@ -252,8 +247,7 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 			up2 = -1;
 		zfree(tmp1);
 		zfree(aa);
-	}
-	else {
+	} else {
 		s1 = zsqrt(tmp3, &cc, 0);
 		zfree(tmp3);
 		zadd(cc, a, &tmp1);
@@ -272,18 +266,19 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 				r = comalloc();
 				qtemp = *aes;
 				qtemp.num.sign = sign;
+				qfree(r->real);
 				r->real = qmul(&qtemp, epsilon);
 				qfree(aes);
 				bes = qscale(r->real, 1);
 				qtemp = *bes;
 				qtemp.num.sign = sign ^ imsign;
-				r->imag = qdiv(c->imag, &qtemp);
+				qfree(r->imag);
+				r->imag = qqdiv(c->imag, &qtemp);
 				qfree(bes);
 				return r;
 			}
 			s3 = zquo(tmp3, d, &mul1, 0);
-		}
-		else {
+		} else {
 			s2 = zquo(tmp1, d, &tmp3, 0);
 			zfree(tmp1);
 			s3 = zsqrt(tmp3, &mul1, 0);
@@ -329,9 +324,9 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 		zfree(mul2);
 		mul2 = tmp2;
 	}
-	if (ziszero(mul1))
+	if (ziszero(mul1)) {
 		u = qlink(&_qzero_);
-	else {
+	} else {
 		mul1.sign = sign ^ epsilon->num.sign;
 		u = qalloc();
 		zreduce(mul1, epsilon->den, &tmp2, &u->den);
@@ -339,9 +334,9 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 		zfree(tmp2);
 	}
 	zfree(mul1);
-	if (ziszero(mul2))
+	if (ziszero(mul2)) {
 		v = qlink(&_qzero_);
-	else {
+	} else {
 		mul2.sign = imsign ^ sign ^ epsilon->num.sign;
 		v = qalloc();
 		zreduce(mul2, epsilon->den, &tmp2, &v->den);
@@ -355,10 +350,10 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 		return clink(&_czero_);
 	}
 	r = comalloc();
-	if (!qiszero(u))
-		r->real = u;
-	if (!qiszero(v))
-		r->imag = v;
+	qfree(r->real);
+	qfree(r->imag);
+	r->real = u;
+	r->imag = v;
 	return r;
 }
 
@@ -383,8 +378,12 @@ croot(COMPLEX *c, NUMBER *q, NUMBER *epsilon)
 	if (qistwo(q))
 		return csqrt(c, epsilon, 24L);
 	if (cisreal(c) && !qisneg(c->real)) {
+		tmp1 = qroot(c->real, q, epsilon);
+		if (tmp1 == NULL)
+			return NULL;
 		r = comalloc();
-		r->real = qroot(c->real, q, epsilon);
+		qfree(r->real);
+		r->real = tmp1;
 		return r;
 	}
 	/*
@@ -403,16 +402,18 @@ croot(COMPLEX *c, NUMBER *q, NUMBER *epsilon)
 	root = qroot(a2pb2, tmp1, epsilon2);
 	qfree(a2pb2);
 	qfree(tmp1);
+	qfree(epsilon2);
+	if (root == NULL)
+		return NULL;
 	m = qilog2(root);
 	if (m < n) {
 		qfree(root);
 		return clink(&_czero_);
 	}
-	qfree(epsilon2);
 	epsilon2 = qbitvalue(n - m - 4);
 	tmp1 = qatan2(c->imag, c->real, epsilon2);
 	qfree(epsilon2);
-	tmp2 = qdiv(tmp1, q);
+	tmp2 = qqdiv(tmp1, q);
 	qfree(tmp1);
 	r = cpolar(root, tmp2, epsilon);
 	qfree(root);
@@ -437,8 +438,12 @@ cexp(COMPLEX *c, NUMBER *epsilon)
 		math_error("Zero epsilon for cexp");
 		/*NOTREACHED*/
 	}
-	r = comalloc();
 	if (cisreal(c)) {
+		tmp1 = qexp(c->real, epsilon);
+		if (tmp1 == NULL)
+			return NULL;
+		r = comalloc();
+		qfree(r->real);
 		r->real = qexp(c->real, epsilon);
 		return r;
 	}
@@ -446,6 +451,8 @@ cexp(COMPLEX *c, NUMBER *epsilon)
 	epsilon1 = qbitvalue(n - 2);
 	tmp1 = qexp(c->real, epsilon1);
 	qfree(epsilon1);
+	if (tmp1 == NULL)
+		return NULL;
 	if (qiszero(tmp1)) {
 		qfree(tmp1);
 		return clink(&_czero_);
@@ -458,11 +465,14 @@ cexp(COMPLEX *c, NUMBER *epsilon)
 	qsincos(c->imag, k - n + 2, &sin, &cos);
 	tmp2 = qmul(tmp1, cos);
 	qfree(cos);
+	r = comalloc();
+	qfree(r->real);
 	r->real = qmappr(tmp2, epsilon, 24L);
 	qfree(tmp2);
 	tmp2 = qmul(tmp1, sin);
 	qfree(tmp1);
 	qfree(sin);
+	qfree(r->imag);
 	r->imag = qmappr(tmp2, epsilon, 24L);
 	qfree(tmp2);
 	return r;
@@ -488,6 +498,7 @@ cln(COMPLEX *c, NUMBER *epsilon)
 		return clink(&_czero_);
 	r = comalloc();
 	if (cisreal(c) && !qisneg(c->real)) {
+		qfree(r->real);
 		r->real = qln(c->real, epsilon);
 		return r;
 	}
@@ -500,8 +511,10 @@ cln(COMPLEX *c, NUMBER *epsilon)
 	tmp1 = qln(a2b2, epsilon1);
 	qfree(a2b2);
 	qfree(epsilon1);
+	qfree(r->real);
 	r->real = qscale(tmp1, -1L);
 	qfree(tmp1);
+	qfree(r->imag);
 	r->imag = qatan2(c->imag, c->real, epsilon);
 	return r;
 }
@@ -526,6 +539,8 @@ ccos(COMPLEX *c, NUMBER *epsilon)
 	}
 	n = qilog2(epsilon);
 	ctmp1 = comalloc();
+	qfree(ctmp1->real);
+	qfree(ctmp1->imag);
 	neg = qisneg(c->imag);
 	ctmp1->real = neg ? qneg(c->imag) : qlink(c->imag);
 	ctmp1->imag = neg ? qlink(c->real) : qneg(c->real);
@@ -533,6 +548,8 @@ ccos(COMPLEX *c, NUMBER *epsilon)
 	ctmp2 = cexp(ctmp1, epsilon1);
 	comfree(ctmp1);
 	qfree(epsilon1);
+	if (ctmp2 == NULL)
+		return NULL;
 	if (ciszero(ctmp2)) {
 		comfree(ctmp2);
 		return clink(&_czero_);
@@ -544,7 +561,9 @@ ccos(COMPLEX *c, NUMBER *epsilon)
 	ctmp1 = cscale(ctmp3, -1);
 	comfree(ctmp3);
 	r = comalloc();
+	qfree(r->real);
 	r->real = qmappr(ctmp1->real, epsilon, 24L);
+	qfree(r->imag);
 	r->imag = qmappr(ctmp1->imag, epsilon, 24L);
 	comfree(ctmp1);
 	return r;
@@ -573,12 +592,16 @@ csin(COMPLEX *c, NUMBER *epsilon)
 	n = qilog2(epsilon);
 	ctmp1 = comalloc();
 	neg = qisneg(c->imag);
+	qfree(ctmp1->real);
+	qfree(ctmp1->imag);
 	ctmp1->real = neg ? qneg(c->imag) : qlink(c->imag);
 	ctmp1->imag = neg ? qlink(c->real) : qneg(c->real);
 	epsilon1 = qbitvalue(n - 2);
 	ctmp2 = cexp(ctmp1, epsilon1);
 	comfree(ctmp1);
 	qfree(epsilon1);
+	if (ctmp2 == NULL)
+		return NULL;
 	if (ciszero(ctmp2)) {
 		comfree(ctmp2);
 		return clink(&_czero_);
@@ -591,9 +614,11 @@ csin(COMPLEX *c, NUMBER *epsilon)
 	comfree(ctmp3);
 	r = comalloc();
 	qtmp = neg ? qlink(ctmp1->imag) : qneg(ctmp1->imag);
+	qfree(r->real);
 	r->real = qmappr(qtmp, epsilon, 24L);
 	qfree(qtmp);
 	qtmp = neg ? qneg(ctmp1->real) : qlink(ctmp1->real);
+	qfree(r->imag);
 	r->imag = qmappr(qtmp, epsilon, 24L);
 	qfree(qtmp);
 	comfree(ctmp1);
@@ -601,6 +626,374 @@ csin(COMPLEX *c, NUMBER *epsilon)
 }
 
 
+COMPLEX *
+ccosh(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+
+	tmp1 = cexp(c, epsilon);
+	if (tmp1 == NULL)
+		return NULL;
+	tmp2 = cneg(c);
+	tmp3 = cexp(tmp2, epsilon);
+	comfree(tmp2);
+	if (tmp3 == NULL)
+		return NULL;
+	tmp2 = cadd(tmp1, tmp3);
+	comfree(tmp1);
+	comfree(tmp3);
+	tmp1 = cscale(tmp2, -1);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
+COMPLEX *
+csinh(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+
+	tmp1 = cexp(c, epsilon);
+	if (tmp1 == NULL)
+		return NULL;
+	tmp2 = cneg(c);
+	tmp3 = cexp(tmp2, epsilon);
+	comfree(tmp2);
+	if (tmp3 == NULL)
+		return NULL;
+	tmp2 = csub(tmp1, tmp3);
+	comfree(tmp1);
+	comfree(tmp3);
+	tmp1 = cscale(tmp2, -1);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
+COMPLEX *
+casin(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = cmul(&_conei_, c);
+	tmp2 = casinh(tmp1, epsilon);
+	comfree(tmp1);
+	tmp1 = cdiv(tmp2, &_conei_);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
+COMPLEX *
+cacos(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = csquare(c);
+	tmp2 = csub(&_cone_, tmp1);
+	comfree(tmp1);
+	tmp1 = csqrt(tmp2, epsilon, 24);
+	comfree(tmp2);
+	tmp2 = cmul(&_conei_, tmp1);
+	comfree(tmp1);
+	tmp1 = cadd(c, tmp2);
+	comfree(tmp2);
+	tmp2 = cln(tmp1, epsilon);
+	comfree(tmp1);
+	tmp1 = cdiv(tmp2, &_conei_);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
+COMPLEX *
+casinh(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+	BOOL neg;
+
+	neg = qisneg(c->real);
+	tmp1 = neg ? cneg(c) : clink(c);
+	tmp2 = csquare(tmp1);
+	tmp3 = cadd(&_cone_, tmp2);
+	comfree(tmp2);
+	tmp2 = csqrt(tmp3, epsilon, 24);
+	comfree(tmp3);
+	tmp3 = cadd(tmp2, tmp1);
+	comfree(tmp1);
+	comfree(tmp2);
+	tmp1 = cln(tmp3, epsilon);
+	comfree(tmp3);
+	if (neg) {
+		tmp2 = cneg(tmp1);
+		comfree(tmp1);
+		return tmp2;
+	}
+	return tmp1;
+}
+
+
+COMPLEX *
+cacosh(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = csquare(c);
+	tmp2 = csub(tmp1, &_cone_);
+	comfree(tmp1);
+	tmp1 = csqrt(tmp2, epsilon, 24);
+	comfree(tmp2);
+	tmp2 = cadd(c, tmp1);
+	comfree(tmp1);
+	tmp1 = cln(tmp2, epsilon);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
+COMPLEX *
+catan(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+
+	if (qiszero(c->real) && qisunit(c->imag))
+		return NULL;
+	tmp1 = csub(&_conei_, c);
+	tmp2 = cadd(&_conei_, c);
+	tmp3 = cdiv(tmp1, tmp2);
+	comfree(tmp1);
+	comfree(tmp2);
+	tmp1 = cln(tmp3, epsilon);
+	comfree(tmp3);
+	tmp2 = cscale(tmp1, -1);
+	comfree(tmp1);
+	tmp1 = cdiv(tmp2, &_conei_);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
+COMPLEX *
+cacot(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+
+	if (qiszero(c->real) && qisunit(c->imag))
+		return NULL;
+	tmp1 = cadd(c, &_conei_);
+	tmp2 = csub(c, &_conei_);
+	tmp3 = cdiv(tmp1, tmp2);
+	comfree(tmp1);
+	comfree(tmp2);
+	tmp1 = cln(tmp3, epsilon);
+	comfree(tmp3);
+	tmp2 = cscale(tmp1, -1);
+	comfree(tmp1);
+	tmp1 = cdiv(tmp2, &_conei_);
+	comfree(tmp2);
+	return tmp1;
+}
+
+COMPLEX *
+casec(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = cinv(c);
+	tmp2 = cacos(tmp1, epsilon);
+	comfree(tmp1);
+	return tmp2;
+}
+
+COMPLEX *
+cacsc(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = cinv(c);
+	tmp2 = casin(tmp1, epsilon);
+	comfree(tmp1);
+	return tmp2;
+}
+
+
+COMPLEX *
+catanh(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+
+	if (qiszero(c->imag) && qisunit(c->real))
+		return NULL;
+	tmp1 = cadd(&_cone_, c);
+	tmp2 = csub(&_cone_, c);
+	tmp3 = cdiv(tmp1, tmp2);
+	comfree(tmp1);
+	comfree(tmp2);
+	tmp1 = cln(tmp3, epsilon);
+	comfree(tmp3);
+	tmp2 = cscale(tmp1, -1);
+	comfree(tmp1);
+	return tmp2;
+}
+
+
+COMPLEX *
+cacoth(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+
+	if (qiszero(c->imag) && qisunit(c->real))
+		return NULL;
+	tmp1 = cadd(c, &_cone_);
+	tmp2 = csub(c, &_cone_);
+	tmp3 = cdiv(tmp1, tmp2);
+	comfree(tmp1);
+	comfree(tmp2);
+	tmp1 = cln(tmp3, epsilon);
+	comfree(tmp3);
+	tmp2 = cscale(tmp1, -1);
+	comfree(tmp1);
+	return tmp2;
+}
+
+COMPLEX *
+casech(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = cinv(c);
+	tmp2 = cacosh(tmp1, epsilon);
+	comfree(tmp1);
+	return tmp2;
+}
+
+COMPLEX *
+cacsch(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = cinv(c);
+	tmp2 = casinh(tmp1, epsilon);
+	comfree(tmp1);
+	return tmp2;
+}
+
+
+COMPLEX *
+cgd(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2, *tmp3;
+	NUMBER *q1, *q2;
+	NUMBER *sin, *cos;
+	NUMBER *eps;
+	int n, n1;
+	BOOL neg;
+
+	if (cisreal(c)) {
+		q1 = qscale(c->real, -1);
+		eps = qscale(epsilon, -1);
+		q2 = qtanh(q1, eps);
+		qfree(q1);
+		q1 = qatan(q2, eps);
+		qfree(eps);
+		qfree(q2);
+		tmp1 = comalloc();
+		qfree(tmp1->real);
+		tmp1->real = qscale(q1, 1);
+		qfree(q1);
+		return tmp1;
+	}
+	if (qiszero(c->real)) {
+		n = - qilog2(epsilon);
+		qsincos(c->imag, n + 8, &sin, &cos);
+		if (qiszero(cos) || (n1 = -qilog2(cos)) > n) {
+			qfree(sin);
+			qfree(cos);
+			return NULL;
+		}
+		neg = qisneg(sin);
+		q1 = neg ? qsub(&_qone_, sin) : qqadd(&_qone_, sin);
+		qfree(sin);
+		if (n1 > 8) {
+			qfree(q1);
+			qfree(cos);
+			qsincos(c->imag, n + n1, &sin, &cos);
+			q1 = neg ? qsub(&_qone_, sin) : qqadd(&_qone_, sin);
+			qfree(sin);
+		}
+		q2 = qqdiv(q1, cos);
+		qfree(q1);
+		q1 = qln(q2, epsilon);
+		qfree(q2);
+		if (neg) {
+			q2 = qneg(q1);
+			qfree(q1);
+			q1 = q2;
+		}
+		tmp1 = comalloc();
+		qfree(tmp1->imag);
+		tmp1->imag = q1;
+		if (qisneg(cos)) {
+			qfree(tmp1->real);
+			q1 = qpi(epsilon);
+			if (qisneg(c->imag)) {
+				q2 = qneg(q1);
+				qfree(q1);
+				q1 = q2;
+			}
+			tmp1->real = q1;
+		}
+		qfree(cos);
+		return tmp1;
+	}
+	neg = qisneg(c->real);
+	tmp1 = neg ? cneg(c) : clink(c);
+	tmp2 = cexp(tmp1, epsilon);
+	comfree(tmp1);
+	if (tmp2 == NULL)
+		return NULL;
+	tmp1 = cmul(&_conei_, tmp2);
+	tmp3 = cadd(&_conei_, tmp2);
+	comfree(tmp2);
+	tmp2 = cadd(tmp1, &_cone_);
+	comfree(tmp1);
+	if (ciszero(tmp2) || ciszero(tmp3)) {
+		comfree(tmp2);
+		comfree(tmp3);
+		return NULL;
+	}
+	tmp1 = cdiv(tmp2, tmp3);
+	comfree(tmp2);
+	comfree(tmp3);
+	tmp2 = cln(tmp1, epsilon);
+	comfree(tmp1);
+	tmp1 = cdiv(tmp2, &_conei_);
+	comfree(tmp2);
+	if (neg) {
+		tmp2 = cneg(tmp1);
+		comfree(tmp1);
+		return tmp2;
+	}
+	return tmp1;
+}
+
+
+COMPLEX *
+cagd(COMPLEX *c, NUMBER *epsilon)
+{
+	COMPLEX *tmp1, *tmp2;
+
+	tmp1 = cmul(&_conei_, c);
+	tmp2 = cgd(tmp1, epsilon);
+	comfree(tmp1);
+	if (tmp2 == NULL)
+		return NULL;
+	tmp1 = cdiv(tmp2, &_conei_);
+	comfree(tmp2);
+	return tmp1;
+}
+
+
 /*
  * Convert a number from polar coordinates to normal complex number form
  * within the specified accuracy.  This produces the value:
@@ -618,23 +1011,26 @@ cpolar(NUMBER *q1, NUMBER *q2, NUMBER *epsilon)
 		/*NOTREACHED*/
 	}
 	if (qiszero(q1))
-		return qlink(&_czero_);
+		return clink(&_czero_);
 	m = qilog2(q1) + 1;
 	n = qilog2(epsilon);
 	if (m < n)
-		return qlink(&_czero_);
+		return clink(&_czero_);
 	r = comalloc();
 	if (qiszero(q2)) {
+		qfree(r->real);
 		r->real = qlink(q1);
 		return r;
 	}
 	qsincos(q2, m - n + 2, &sin, &cos);
 	tmp = qmul(q1, cos);
 	qfree(cos);
+	qfree(r->real);
 	r->real = qmappr(tmp, epsilon, 24L);
 	qfree(tmp);
 	tmp = qmul(q1, sin);
 	qfree(sin);
+	qfree(r->imag);
 	r->imag = qmappr(tmp, epsilon, 24L);
 	qfree(tmp);
 	return r;
@@ -666,12 +1062,12 @@ cpower(COMPLEX *c1, COMPLEX *c2, NUMBER *epsilon)
 	n = qilog2(epsilon);
 	m1 = m2 = -1000000;
 	k1 = k2 = 0;
-	qtmp1 = qsquare(c1->real);
-	qtmp2 = qsquare(c1->imag);
-	a2b2 = qqadd(qtmp1, qtmp2);
-	qfree(qtmp1);
-	qfree(qtmp2);
 	if (!qiszero(c2->real)) {
+		qtmp1 = qsquare(c1->real);
+		qtmp2 = qsquare(c1->imag);
+		a2b2 = qqadd(qtmp1, qtmp2);
+		qfree(qtmp1);
+		qfree(qtmp2);
 		m1 = qilog2(c2->real);
 		epsilon1 = qbitvalue(-m1 - 1);
 		qtmp1 = qln(a2b2, epsilon1);
@@ -766,5 +1162,3 @@ cprintfr(COMPLEX *c)
 		zprintval(i->den, 0L, 0L);
 	}
 }
-
-/* END CODE */

commath.c

@@ -1,11 +1,33 @@
 /*
- * Copyright (c) 1993 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * commath - extended precision complex arithmetic primitive routines
  *
- * Extended precision complex arithmetic primitive routines
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: commath.c,v 29.1 1999/12/14 09:15:35 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/commath.c,v $
+ *
+ * Under source code control:	1990/02/15 01:48:10
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
 #include "cmath.h"
 
 
@@ -29,10 +51,14 @@ cadd(COMPLEX *c1, COMPLEX *c2)
 	if (ciszero(c2))
 		return clink(c1);
 	r = comalloc();
-	if (!qiszero(c1->real) || !qiszero(c2->real))
+	if (!qiszero(c1->real) || !qiszero(c2->real)) {
+		qfree(r->real);
 		r->real = qqadd(c1->real, c2->real);
-	if (!qiszero(c1->imag) || !qiszero(c2->imag))
+	}
+	if (!qiszero(c1->imag) || !qiszero(c2->imag)) {
+		qfree(r->imag);
 		r->imag = qqadd(c1->imag, c2->imag);
+	}
 	return r;
 }
 
@@ -50,10 +76,14 @@ csub(COMPLEX *c1, COMPLEX *c2)
 	if (ciszero(c2))
 		return clink(c1);
 	r = comalloc();
-	if (!qiszero(c1->real) || !qiszero(c2->real))
+	if (!qiszero(c1->real) || !qiszero(c2->real)) {
+		qfree(r->real);
 		r->real = qsub(c1->real, c2->real);
-	if (!qiszero(c1->imag) || !qiszero(c2->imag))
+	}
+	if (!qiszero(c1->imag) || !qiszero(c2->imag)) {
+		qfree(r->imag);
 		r->imag = qsub(c1->imag, c2->imag);
+	}
 	return r;
 }
 
@@ -61,7 +91,7 @@ csub(COMPLEX *c1, COMPLEX *c2)
 /*
  * Multiply two complex numbers.
  * This saves one multiplication over the obvious algorithm by
- * trading it for several extra additions, as follows.  Let
+ * trading it for several extra additions, as follows.	Let
  *	q1 = (a + b) * (c + d)
  *	q2 = a * c
  *	q3 = b * d
@@ -95,7 +125,9 @@ cmul(COMPLEX *c1, COMPLEX *c2)
 	q2 = qmul(c1->real, c2->real);
 	q3 = qmul(c1->imag, c2->imag);
 	q4 = qqadd(q2, q3);
+	qfree(r->real);
 	r->real = qsub(q2, q3);
+	qfree(r->imag);
 	r->imag = qsub(q1, q4);
 	qfree(q1);
 	qfree(q2);
@@ -122,10 +154,12 @@ csquare(COMPLEX *c)
 		return clink(&_cnegone_);
 	r = comalloc();
 	if (cisreal(c)) {
+		qfree(r->real);
 		r->real = qsquare(c->real);
 		return r;
 	}
 	if (cisimag(c)) {
+		qfree(r->real);
 		q1 = qsquare(c->imag);
 		r->real = qneg(q1);
 		qfree(q1);
@@ -133,9 +167,11 @@ csquare(COMPLEX *c)
 	}
 	q1 = qsquare(c->real);
 	q2 = qsquare(c->imag);
+	qfree(r->real);
 	r->real = qsub(q1, q2);
 	qfree(q1);
 	qfree(q2);
+	qfree(r->imag);
 	q1 = qmul(c->real, c->imag);
 	r->imag = qscale(q1, 1L);
 	qfree(q1);
@@ -160,26 +196,32 @@ cdiv(COMPLEX *c1, COMPLEX *c2)
 		return clink(&_cone_);
 	r = comalloc();
 	if (cisreal(c1) && cisreal(c2)) {
-		r->real = qdiv(c1->real, c2->real);
+		qfree(r->real);
+		r->real = qqdiv(c1->real, c2->real);
 		return r;
 	}
 	if (cisimag(c1) && cisimag(c2)) {
-		r->real = qdiv(c1->imag, c2->imag);
+		qfree(r->real);
+		r->real = qqdiv(c1->imag, c2->imag);
 		return r;
 	}
 	if (cisimag(c1) && cisreal(c2)) {
-		r->imag = qdiv(c1->imag, c2->real);
+		qfree(r->imag);
+		r->imag = qqdiv(c1->imag, c2->real);
 		return r;
 	}
 	if (cisreal(c1) && cisimag(c2)) {
-		q1 = qdiv(c1->real, c2->imag);
+		qfree(r->imag);
+		q1 = qqdiv(c1->real, c2->imag);
 		r->imag = qneg(q1);
 		qfree(q1);
 		return r;
 	}
 	if (cisreal(c2)) {
-		r->real = qdiv(c1->real, c2->real);
-		r->imag = qdiv(c1->imag, c2->real);
+		qfree(r->real);
+		qfree(r->imag);
+		r->real = qqdiv(c1->real, c2->real);
+		r->imag = qqdiv(c1->imag, c2->real);
 		return r;
 	}
 	q1 = qsquare(c2->real);
@@ -192,14 +234,16 @@ cdiv(COMPLEX *c1, COMPLEX *c2)
 	q3 = qqadd(q1, q2);
 	qfree(q1);
 	qfree(q2);
-	r->real = qdiv(q3, den);
+	qfree(r->real);
+	r->real = qqdiv(q3, den);
 	qfree(q3);
 	q1 = qmul(c1->real, c2->imag);
 	q2 = qmul(c1->imag, c2->real);
 	q3 = qsub(q2, q1);
 	qfree(q1);
 	qfree(q2);
-	r->imag = qdiv(q3, den);
+	qfree(r->imag);
+	r->imag = qqdiv(q3, den);
 	qfree(q3);
 	qfree(den);
 	return r;
@@ -221,11 +265,13 @@ cinv(COMPLEX *c)
 	}
 	r = comalloc();
 	if (cisreal(c)) {
+		qfree(r->real);
 		r->real = qinv(c->real);
 		return r;
 	}
 	if (cisimag(c)) {
 		q1 = qinv(c->imag);
+		qfree(r->imag);
 		r->imag = qneg(q1);
 		qfree(q1);
 		return r;
@@ -235,8 +281,10 @@ cinv(COMPLEX *c)
 	den = qqadd(q1, q2);
 	qfree(q1);
 	qfree(q2);
-	r->real = qdiv(c->real, den);
-	q1 = qdiv(c->imag, den);
+	qfree(r->real);
+	r->real = qqdiv(c->real, den);
+	q1 = qqdiv(c->imag, den);
+	qfree(r->imag);
 	r->imag = qneg(q1);
 	qfree(q1);
 	qfree(den);
@@ -255,10 +303,14 @@ cneg(COMPLEX *c)
 	if (ciszero(c))
 		return clink(&_czero_);
 	r = comalloc();
-	if (!qiszero(c->real))
+	if (!qiszero(c->real)) {
+		qfree(r->real);
 		r->real = qneg(c->real);
-	if (!qiszero(c->imag))
+	}
+	if (!qiszero(c->imag)) {
+		qfree(r->imag);
 		r->imag = qneg(c->imag);
+	}
 	return r;
 }
 
@@ -275,7 +327,9 @@ cint(COMPLEX *c)
 	if (cisint(c))
 		return clink(c);
 	r = comalloc();
+	qfree(r->real);
 	r->real = qint(c->real);
+	qfree(r->imag);
 	r->imag = qint(c->imag);
 	return r;
 }
@@ -293,7 +347,9 @@ cfrac(COMPLEX *c)
 	if (cisint(c))
 		return clink(&_czero_);
 	r = comalloc();
+	qfree(r->real);
 	r->real = qfrac(c->real);
+	qfree(r->imag);
 	r->imag = qfrac(c->imag);
 	return r;
 }
@@ -311,8 +367,11 @@ cconj(COMPLEX *c)
 	if (cisreal(c))
 		return clink(c);
 	r = comalloc();
-	if (!qiszero(c->real))
+	if (!qiszero(c->real)) {
+		qfree(r->real);
 		r->real = qlink(c->real);
+	}
+	qfree(r->imag);
 	r->imag = qneg(c->imag);
 	return r;
 }
@@ -329,8 +388,10 @@ creal(COMPLEX *c)
 	if (cisreal(c))
 		return clink(c);
 	r = comalloc();
-	if (!qiszero(c->real))
+	if (!qiszero(c->real)) {
+		qfree(r->real);
 		r->real = qlink(c->real);
+	}
 	return r;
 }
 
@@ -346,6 +407,7 @@ cimag(COMPLEX *c)
 	if (cisreal(c))
 		return clink(&_czero_);
 	r = comalloc();
+	qfree(r->real);
 	r->real = qlink(c->imag);
 	return r;
 }
@@ -362,6 +424,8 @@ caddq(COMPLEX *c, NUMBER *q)
 	if (qiszero(q))
 		return clink(c);
 	r = comalloc();
+	qfree(r->real);
+	qfree(r->imag);
 	r->real = qqadd(c->real, q);
 	r->imag = qlink(c->imag);
 	return r;
@@ -379,6 +443,8 @@ csubq(COMPLEX *c, NUMBER *q)
 	if (qiszero(q))
 		return clink(c);
 	r = comalloc();
+	qfree(r->real);
+	qfree(r->imag);
 	r->real = qsub(c->real, q);
 	r->imag = qlink(c->imag);
 	return r;
@@ -397,6 +463,8 @@ cshift(COMPLEX *c, long n)
 	if (ciszero(c) || (n == 0))
 		return clink(c);
 	r = comalloc();
+	qfree(r->real);
+	qfree(r->imag);
 	r->real = qshift(c->real, n);
 	r->imag = qshift(c->imag, n);
 	return r;
@@ -414,6 +482,8 @@ cscale(COMPLEX *c, long n)
 	if (ciszero(c) || (n == 0))
 		return clink(c);
 	r = comalloc();
+	qfree(r->real);
+	qfree(r->imag);
 	r->real = qscale(c->real, n);
 	r->imag = qscale(c->imag, n);
 	return r;
@@ -435,6 +505,8 @@ cmulq(COMPLEX *c, NUMBER *q)
 	if (qisnegone(q))
 		return cneg(c);
 	r = comalloc();
+	qfree(r->real);
+	qfree(r->imag);
 	r->real = qmul(c->real, q);
 	r->imag = qmul(c->imag, q);
 	return r;
@@ -458,8 +530,10 @@ cdivq(COMPLEX *c, NUMBER *q)
 	if (qisnegone(q))
 		return cneg(c);
 	r = comalloc();
-	r->real = qdiv(c->real, q);
-	r->imag = qdiv(c->imag, q);
+	qfree(r->real);
+	qfree(r->imag);
+	r->real = qqdiv(c->real, q);
+	r->imag = qqdiv(c->imag, q);
 	return r;
 }
 
@@ -477,10 +551,10 @@ qqtoc(NUMBER *q1, NUMBER *q2)
 	if (qiszero(q1) && qiszero(q2))
 		return clink(&_czero_);
 	r = comalloc();
-	if (!qiszero(q1))
-		r->real = qlink(q1);
-	if (!qiszero(q2))
-		r->imag = qlink(q2);
+	qfree(r->real);
+	qfree(r->imag);
+	r->real = qlink(q1);
+	r->imag = qlink(q2);
 	return r;
 }
 
@@ -512,6 +586,8 @@ crel(COMPLEX *c1, COMPLEX *c2)
 	COMPLEX *c;
 
 	c = comalloc();
+	qfree(c->real);
+	qfree(c->imag);
 	c->real = itoq((long) qrel(c1->real, c2->real));
 	c->imag = itoq((long) qrel(c1->imag, c2->imag));
 
@@ -551,5 +627,3 @@ comfree(COMPLEX *c)
 	qfree(c->imag);
 	free(c);
 }
-
-/* END CODE */

config.c

@@ -1,14 +1,48 @@
 /*
- * Copyright (c) 1995 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * config - configuration routines
  *
- * Configuration routines.
+ * Copyright (C) 1999  David I. Bell and Landon Curt Noll
+ *
+ * Primary author:  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.2 $
+ * @(#) $Id: config.c,v 29.2 1999/12/14 19:37:46 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/config.c,v $
+ *
+ * Under source code control:	1991/07/20 00:21:56
+ * File existed as early as:	1991
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
+#include <stdio.h>
 #include "calc.h"
 #include "token.h"
 #include "zrand.h"
+#include "block.h"
+#include "nametype.h"
+#include "config.h"
+#include "string.h"
+
+#include "have_strdup.h"
+#if !defined(HAVE_STRDUP)
+# define strdup(x) calc_strdup((CONST char *)(x))
+#endif /* HAVE_STRDUP */
 
 
 /*
@@ -39,10 +73,24 @@ NAMETYPE configs[] = {
 	{"round",	CONFIG_ROUND},
 	{"leadzero",	CONFIG_LEADZERO},
 	{"fullzero",	CONFIG_FULLZERO},
-	{"maxerr",	CONFIG_MAXERR},
+	{"maxscan",	CONFIG_MAXSCAN},
+	    {"maxerr",	CONFIG_MAXSCAN},	/* old name for maxscan */
 	{"prompt",	CONFIG_PROMPT},
 	{"more",	CONFIG_MORE},
-	{"random",	CONFIG_RANDOM},
+	{"blkmaxprint", CONFIG_BLKMAXPRINT},
+	{"blkverbose",	CONFIG_BLKVERBOSE},
+	{"blkbase",	CONFIG_BLKBASE},
+	{"blkfmt",	CONFIG_BLKFMT},
+	{"resource_debug", CONFIG_RESOURCE_DEBUG},
+	{"lib_debug",	CONFIG_RESOURCE_DEBUG},
+	{"calc_debug",	CONFIG_CALC_DEBUG},
+	{"user_debug",	CONFIG_USER_DEBUG},
+	{"verbose_quit",CONFIG_VERBOSE_QUIT},
+	{"ctrl_d",	CONFIG_CTRL_D},
+	    {"ctrl-d",	CONFIG_CTRL_D},		/* alias for ctrl_d */
+	{"program",	CONFIG_PROGRAM},
+	{"basename",	CONFIG_BASENAME},
+	{"version",	CONFIG_VERSION},
 	{NULL,		0}
 };
 
@@ -74,10 +122,21 @@ CONFIG oldstd = {	/* backward compatible standard configuration */
 	24,			/* round()/bround() default rounding mode */
 	FALSE,			/* ok to print leading 0 before decimal pt */
 	0,			/* ok to print trailing 0's */
-	MAXERRORCOUNT,		/* max errors before abort */
+	MAXSCANCOUNT,		/* max scan errors before abort */
 	PROMPT1,		/* normal prompt */
 	PROMPT2,		/* prompt when inside multi-line input */
-	3			/* require 1 mod 4 and to pass ptest(newn,1) */
+	BLK_DEF_MAXPRINT,	/* number of octets of a block to print */
+	FALSE,			/* skip duplicate block output lines */
+	BLK_BASE_HEX,		/* block octet print base */
+	BLK_FMT_HD_STYLE,	/* block output format */
+	0,			/* internal calc debug level */
+	3,			/* calc resource file debug level */
+	0,			/* user defined debug level */
+	TRUE,			/* print Quit or abort executed messages */
+	CTRL_D_VIRGIN_EOF,	/* ^D only exits on virgin lines */
+	NULL,			/* our name */
+	NULL,			/* basename of our name */
+	NULL			/* version */
 };
 CONFIG newstd = {	/* new non-backward compatible configuration */
 	MODE_INITIAL,		/* current output mode */
@@ -103,10 +162,21 @@ CONFIG newstd = {	/* new non-backward compatible configuration */
 	24,			/* round()/bround() default rounding mode */
 	TRUE,			/* ok to print leading 0 before decimal pt */
 	1,			/* ok to print trailing 0's */
-	MAXERRORCOUNT,		/* max errors before abort */
+	MAXSCANCOUNT,		/* max scan errors before abort */
 	"; ",			/* normal prompt */
 	";; ",			/* prompt when inside multi-line input */
-	3			/* require 1 mod 4 and to pass ptest(newn,1) */
+	BLK_DEF_MAXPRINT,	/* number of octets of a block to print */
+	FALSE,			/* skip duplicate block output lines */
+	BLK_BASE_HEX,		/* block octet print base */
+	BLK_FMT_HD_STYLE,	/* block output format */
+	0,			/* internal calc debug level */
+	3,			/* calc resource file debug level */
+	0,			/* user defined debug level */
+	TRUE,			/* print Quit or abort executed messages */
+	CTRL_D_VIRGIN_EOF,	/* ^D only exits on virgin lines */
+	NULL,			/* our name */
+	NULL,			/* basename of our name */
+	NULL			/* version */
 };
 CONFIG *conf = NULL;	/* loaded in at startup - current configuration */
 
@@ -115,13 +185,17 @@ CONFIG *conf = NULL;	/* loaded in at startup - current configuration */
  * Possible output modes.
  */
 static NAMETYPE modes[] = {
+	{"fraction",	MODE_FRAC},
 	{"frac",	MODE_FRAC},
-	{"decimal",	MODE_FRAC},
-	{"dec",		MODE_FRAC},
+	{"integer",	MODE_INT},
 	{"int",		MODE_INT},
 	{"real",	MODE_REAL},
+	{"float",	MODE_REAL},
+	{"default",	MODE_INITIAL},	/* MODE_REAL */
+	{"scientific",	MODE_EXP},
+	{"sci",		MODE_EXP},
 	{"exp",		MODE_EXP},
-	{"hexadecimal",	MODE_HEX},
+	{"hexadecimal", MODE_HEX},
 	{"hex",		MODE_HEX},
 	{"octal",	MODE_OCTAL},
 	{"oct",		MODE_OCTAL},
@@ -131,23 +205,82 @@ static NAMETYPE modes[] = {
 };
 
 
+/*
+ * Possible block base output modes
+ */
+static NAMETYPE blk_base[] = {
+	{"hexadecimal", BLK_BASE_HEX},
+	{"hex",		BLK_BASE_HEX},
+	{"default",	BLK_BASE_HEX},
+	{"octal",	BLK_BASE_OCT},
+	{"oct",		BLK_BASE_OCT},
+	{"character",	BLK_BASE_CHAR},
+	{"char",	BLK_BASE_CHAR},
+	{"binary",	BLK_BASE_BINARY},
+	{"bin",		BLK_BASE_BINARY},
+	{"raw",		BLK_BASE_RAW},
+	{"none",	BLK_BASE_RAW},
+	{NULL,		0}
+};
+
+
+/*
+ * Possible block output formats
+ */
+static NAMETYPE blk_fmt[] = {
+	{"lines",	BLK_FMT_LINE},
+	{"line",	BLK_FMT_LINE},
+	{"strings",	BLK_FMT_STRING},
+	{"string",	BLK_FMT_STRING},
+	{"str",		BLK_FMT_STRING},
+	{"od_style",	BLK_FMT_OD_STYLE},
+	{"odstyle",	BLK_FMT_OD_STYLE},
+	{"od",		BLK_FMT_OD_STYLE},
+	{"hd_style",	BLK_FMT_HD_STYLE},
+	{"hdstyle",	BLK_FMT_HD_STYLE},
+	{"hd",		BLK_FMT_HD_STYLE},
+	{"default",	BLK_FMT_HD_STYLE},
+	{NULL,		0}
+};
+
+
+/*
+ * Possible ctrl_d styles
+ */
+static NAMETYPE ctrl_d[] = {
+	{"virgin_eof",	CTRL_D_VIRGIN_EOF},
+	{"virgineof",	CTRL_D_VIRGIN_EOF},
+	{"virgin",	CTRL_D_VIRGIN_EOF},
+	{"default",	CTRL_D_VIRGIN_EOF},
+	{"never_eof",	CTRL_D_NEVER_EOF},
+	{"nevereof",	CTRL_D_NEVER_EOF},
+	{"never",	CTRL_D_NEVER_EOF},
+	{"empty_eof",	CTRL_D_EMPTY_EOF},
+	{"emptyeof",	CTRL_D_EMPTY_EOF},
+	{"empty",	CTRL_D_EMPTY_EOF},
+	{NULL,		0}
+};
+
+
 /*
  * Possible binary config state values
  */
+#define TRUE_STRING	"true"
+#define FALSE_STRING	"false"
 static NAMETYPE truth[] = {
-	{"y",		TRUE},
-	{"n",		FALSE},
-	{"yes",		TRUE},
-	{"no",		FALSE},
-	{"set",		TRUE},
-	{"unset",	FALSE},
-	{"on",		TRUE},
-	{"off",		FALSE},
-	{"true",	TRUE},
-	{"false",	FALSE},
+	{TRUE_STRING,	TRUE},
 	{"t",		TRUE},
-	{"f",		FALSE},
+	{"on",		TRUE},
+	{"yes",		TRUE},
+	{"y",		TRUE},
+	{"set",		TRUE},
 	{"1",		TRUE},
+	{FALSE_STRING,	FALSE},
+	{"f",		FALSE},
+	{"off",		FALSE},
+	{"no",		FALSE},
+	{"n",		FALSE},
+	{"unset",	FALSE},
 	{"0",		FALSE},
 	{NULL,		0}
 };
@@ -156,9 +289,8 @@ static NAMETYPE truth[] = {
 /*
  * declate static functions
  */
-static int modetype(char *name);
-static int truthtype(char *name);
-static char *modename(int type);
+static long lookup_long(NAMETYPE *set, char *name);
+static char *lookup_name(NAMETYPE *set, long val);
 
 
 /*
@@ -183,18 +315,21 @@ configtype(char *name)
 
 
 /*
- * Given the name of a mode, convert it to the internal format.
- * Returns -1 if the string is unknown.
+ * lookup_long - given a name and a NAMETYPE, return the int
  *
  * given:
- *	name			mode name
+ *	set		the NAMESET array of name/int pairs
+ *	name		mode name
+ *
+ * returns:
+ *	numeric value of the name or -1 if not found
  */
-static int
-modetype(char *name)
+static long
+lookup_long(NAMETYPE *set, char *name)
 {
 	NAMETYPE *cp;		/* current config pointer */
 
-	for (cp = modes; cp->name; cp++) {
+	for (cp = set; cp->name; cp++) {
 		if (strcmp(cp->name, name) == 0)
 			return cp->type;
 	}
@@ -203,38 +338,22 @@ modetype(char *name)
 
 
 /*
- * Given the name of a truth value, convert it to a BOOL or -1.
- * Returns -1 if the string is unknown.
+ * lookup_name - given numeric value and a NAMETYPE, return the name
  *
  * given:
- *	name			mode name
- */
-static int
-truthtype(char *name)
-{
-	NAMETYPE *cp;		/* current config pointer */
-
-	for (cp = truth; cp->name; cp++) {
-		if (strcmp(cp->name, name) == 0)
-			return cp->type;
-	}
-	return -1;
-}
-
-
-/*
- * Given the mode type, convert it to a string representing that mode.
- * Where there are multiple strings representing the same mode, the first
- * one in the table is used.  Returns NULL if the node type is unknown.
- * The returned string cannot be modified.
+ *	set		the NAMESET array of name/int pairs
+ *	val		numeric value to lookup
+ *
+ * returns:
+ *	name of the value found of NULL
  */
 static char *
-modename(int type)
+lookup_name(NAMETYPE *set, long val)
 {
 	NAMETYPE *cp;		/* current config pointer */
 
-	for (cp = modes; cp->name; cp++) {
-		if (type == cp->type)
+	for (cp = set; cp->name; cp++) {
+		if (val == cp->type)
 			return cp->name;
 	}
 	return NULL;
@@ -255,11 +374,11 @@ setconfig(int type, VALUE *vp)
 
 	switch (type) {
 	case CONFIG_ALL:
-		newconf = NULL;	/* firewall */
+		newconf = NULL; /* firewall */
 		if (vp->v_type == V_STR) {
-			if (strcmp(vp->v_str, "oldstd") == 0) {
+			if (strcmp(vp->v_str->s_str, "oldstd") == 0) {
 				newconf = &oldstd;
-			} else if (strcmp(vp->v_str, "newstd") == 0) {
+			} else if (strcmp(vp->v_str->s_str, "newstd") == 0) {
 				newconf = &newstd;
 			} else {
 				math_error("CONFIG alias not oldstd or newstd");
@@ -311,7 +430,7 @@ setconfig(int type, VALUE *vp)
 			math_error("Non-string for mode");
 			/*NOTREACHED*/
 		}
-		temp = modetype(vp->v_str);
+		temp = lookup_long(modes, vp->v_str->s_str);
 		if (temp < 0) {
 			math_error("Unknown mode \"%s\"", vp->v_str);
 			/*NOTREACHED*/
@@ -415,15 +534,14 @@ setconfig(int type, VALUE *vp)
 		conf->redc2 = (int)temp;
 		break;
 
-
 	case CONFIG_TILDE:
 		if (vp->v_type == V_NUM) {
 			q = vp->v_num;
 			conf->tilde_ok = !qiszero(q);
 		} else if (vp->v_type == V_STR) {
-			temp = truthtype(vp->v_str);
+			temp = lookup_long(truth, vp->v_str->s_str);
 			if (temp < 0) {
-				math_error("Illegal truth value");
+				math_error("Illegal truth value for tilde");
 				/*NOTREACHED*/
 			}
 			conf->tilde_ok = (int)temp;
@@ -435,9 +553,9 @@ setconfig(int type, VALUE *vp)
 			q = vp->v_num;
 			conf->tab_ok = !qiszero(q);
 		} else if (vp->v_type == V_STR) {
-			temp = truthtype(vp->v_str);
+			temp = lookup_long(truth, vp->v_str->s_str);
 			if (temp < 0) {
-				math_error("Illegal truth value");
+				math_error("Illegal truth value for tab");
 				/*NOTREACHED*/
 			}
 			conf->tab_ok = (int)temp;
@@ -575,9 +693,9 @@ setconfig(int type, VALUE *vp)
 			q = vp->v_num;
 			conf->leadzero = !qiszero(q);
 		} else if (vp->v_type == V_STR) {
-			temp = truthtype(vp->v_str);
+			temp = lookup_long(truth, vp->v_str->s_str);
 			if (temp < 0) { {
-				math_error("Illegal truth value");
+				math_error("Illegal truth value for leadzero");
 				/*NOTREACHED*/
 			}
 			}
@@ -590,9 +708,9 @@ setconfig(int type, VALUE *vp)
 			q = vp->v_num;
 			conf->fullzero = !qiszero(q);
 		} else if (vp->v_type == V_STR) {
-			temp = truthtype(vp->v_str);
+			temp = lookup_long(truth, vp->v_str->s_str);
 			if (temp < 0) { {
-				math_error("Illegal truth value");
+				math_error("Illegal truth value for fullzero");
 				/*NOTREACHED*/
 			}
 			}
@@ -600,9 +718,9 @@ setconfig(int type, VALUE *vp)
 		}
 		break;
 
-	case CONFIG_MAXERR:
+	case CONFIG_MAXSCAN:
 		if (vp->v_type != V_NUM) {
-			math_error("Non-numeric for maxerr");
+			math_error("Non-numeric for maxscancount");
 			/*NOTREACHED*/
 		}
 		q = vp->v_num;
@@ -610,10 +728,10 @@ setconfig(int type, VALUE *vp)
 		if (qisfrac(q) || qisneg(q) || !zistiny(q->num))
 			temp = -1;
 		if (temp < 0) {
-			math_error("Maxerr value is out of range");
+			math_error("Maxscan value is out of range");
 			/*NOTREACHED*/
 		}
-		conf->maxerrorcount = temp;
+		conf->maxscancount = temp;
 		break;
 
 	case CONFIG_PROMPT:
@@ -621,12 +739,12 @@ setconfig(int type, VALUE *vp)
 			math_error("Non-string for prompt");
 			/*NOTREACHED*/
 		}
-		p = (char *)malloc(strlen(vp->v_str) + 1);
+		p = (char *)malloc(vp->v_str->s_len + 1);
 		if (p == NULL) {
 			math_error("Cannot duplicate new prompt");
 			/*NOTREACHED*/
 		}
-		strcpy(p, vp->v_str);
+		strcpy(p, vp->v_str->s_str);
 		free(conf->prompt1);
 		conf->prompt1 = p;
 		break;
@@ -636,32 +754,157 @@ setconfig(int type, VALUE *vp)
 			math_error("Non-string for more prompt");
 			/*NOTREACHED*/
 		}
-		p = (char *)malloc(strlen(vp->v_str) + 1);
+		p = (char *)malloc(vp->v_str->s_len + 1);
 		if (p == NULL) {
 			math_error("Cannot duplicate new more prompt");
 			/*NOTREACHED*/
 		}
-		strcpy(p, vp->v_str);
+		strcpy(p, vp->v_str->s_str);
 		free(conf->prompt2);
 		conf->prompt2 = p;
 		break;
 
-	case CONFIG_RANDOM:
+	case CONFIG_BLKMAXPRINT:
 		if (vp->v_type != V_NUM) {
-			math_error("Non-numeric for random config value");
+			math_error("Non-numeric for blkmaxprint");
 			/*NOTREACHED*/
 		}
 		q = vp->v_num;
 		temp = qtoi(q);
 		if (qisfrac(q) || qisneg(q) || !zistiny(q->num))
 			temp = -1;
-		if (temp < BLUM_CFG_MIN || temp > BLUM_CFG_MAX) {
-			math_error("Random config value is out of range");
+		if (temp < 0) {
+			math_error("Blkmaxprint value is out of range");
 			/*NOTREACHED*/
 		}
-		conf->random = temp;
+		conf->blkmaxprint = temp;
 		break;
 
+	case CONFIG_BLKVERBOSE:
+		if (vp->v_type == V_NUM) {
+			q = vp->v_num;
+			conf->blkverbose = !qiszero(q);
+		} else if (vp->v_type == V_STR) {
+			temp = lookup_long(truth, vp->v_str->s_str);
+			if (temp < 0) {
+			    math_error("Illegal truth value for blkverbose");
+			    /*NOTREACHED*/
+			}
+			conf->blkverbose = (int)temp;
+		}
+		break;
+
+	case CONFIG_BLKBASE:
+		if (vp->v_type != V_STR) {
+			math_error("Non-string for blkbase");
+			/*NOTREACHED*/
+		}
+		temp = lookup_long(blk_base, vp->v_str->s_str);
+		if (temp < 0) {
+			math_error("Unknown mode \"%s\" for blkbase",
+			    vp->v_str->s_str);
+			/*NOTREACHED*/
+		}
+		conf->blkbase = temp;
+		break;
+
+	case CONFIG_BLKFMT:
+		if (vp->v_type != V_STR) {
+			math_error("Non-string for blkfmt");
+			/*NOTREACHED*/
+		}
+		temp = lookup_long(blk_fmt, vp->v_str->s_str);
+		if (temp < 0) {
+			math_error("Unknown mode \"%s\" for blkfmt",
+			    vp->v_str->s_str);
+			/*NOTREACHED*/
+		}
+		conf->blkfmt = temp;
+		break;
+
+	case CONFIG_CALC_DEBUG:
+		if (vp->v_type != V_NUM) {
+			math_error("Non numeric for calc_debug");
+			/*NOTREACHED*/
+		}
+		q = vp->v_num;
+		temp = qtoi(q);
+		if (qisfrac(q) || !zistiny(q->num)) {
+			math_error("Illegal calc_debug parameter value");
+			/*NOTREACHED*/
+		}
+		conf->calc_debug = temp;
+		break;
+
+	case CONFIG_RESOURCE_DEBUG:
+		if (vp->v_type != V_NUM) {
+			math_error("Non numeric for resource_debug");
+			/*NOTREACHED*/
+		}
+		q = vp->v_num;
+		temp = qtoi(q);
+		if (qisfrac(q) || !zistiny(q->num)) {
+			math_error("Illegal resource_debug parameter value");
+			/*NOTREACHED*/
+		}
+		conf->resource_debug = temp;
+		break;
+
+	case CONFIG_USER_DEBUG:
+		if (vp->v_type != V_NUM) {
+			math_error("Non numeric for user_debug");
+			/*NOTREACHED*/
+		}
+		q = vp->v_num;
+		temp = qtoi(q);
+		if (qisfrac(q) || !zistiny(q->num)) {
+			math_error("Illegal user_debug parameter value");
+			/*NOTREACHED*/
+		}
+		conf->user_debug = temp;
+		break;
+
+	case CONFIG_VERBOSE_QUIT:
+		if (vp->v_type == V_NUM) {
+			q = vp->v_num;
+			conf->verbose_quit = !qiszero(q);
+		} else if (vp->v_type == V_STR) {
+			temp = lookup_long(truth, vp->v_str->s_str);
+			if (temp < 0) {
+				math_error("Illegal truth value "
+					   "for verbose_quit");
+				/*NOTREACHED*/
+			}
+			conf->verbose_quit = (int)temp;
+		}
+		break;
+
+	case CONFIG_CTRL_D:
+		if (vp->v_type != V_STR) {
+			math_error("Non-string for ctrl_d");
+			/*NOTREACHED*/
+		}
+		temp = lookup_long(ctrl_d, vp->v_str->s_str);
+		if (temp < 0) {
+			math_error("Unknown mode \"%s\" for ctrl_d",
+			    vp->v_str->s_str);
+			/*NOTREACHED*/
+		}
+		conf->ctrl_d = temp;
+		break;
+
+	case CONFIG_PROGRAM:
+		math_error("The program config parameter is read-only");
+		/*NOTREACHED*/
+
+	case CONFIG_BASENAME:
+		math_error("The program config parameter is read-only");
+		/*NOTREACHED*/
+
+	case CONFIG_VERSION:
+		math_error("The program config parameter is read-only");
+		/*NOTREACHED*/
+
 	default:
 		math_error("Setting illegal config parameter");
 		/*NOTREACHED*/
@@ -676,7 +919,7 @@ setconfig(int type, VALUE *vp)
  *	src	copy this configuration
  *
  * returns:
- *	prointer to the configuration copy
+ *	pointer to the configuration copy
  */
 CONFIG *
 config_copy(CONFIG *src)
@@ -704,24 +947,29 @@ config_copy(CONFIG *src)
 	/*
 	 * copy over the values
 	 */
-	*dest = *src;
+	memcpy((void *)dest, (void *)src, sizeof(CONFIG));
 
 	/*
 	 * clone the pointer values
 	 */
 	dest->epsilon = qlink(src->epsilon);
-	dest->prompt1 = (char *)malloc(strlen(src->prompt1)+1);
-	if (dest->prompt1 == NULL) {
-		math_error("cannot dup prompt1 for new CONFIG value");
-		/*NOTREACHED*/
+	dest->prompt1 = strdup(src->prompt1);
+	dest->prompt2 = strdup(src->prompt2);
+	if (src->program == NULL) {
+		dest->program = strdup(program);
+	} else {
+		dest->program = strdup(src->program);
 	}
-	strcpy(dest->prompt1, src->prompt1);
-	dest->prompt2 = (char *)malloc(strlen(src->prompt2)+1);
-	if (dest->prompt2 == NULL) {
-		math_error("cannot dup prompt2 for new CONFIG value");
-		/*NOTREACHED*/
+	if (src->base_name == NULL) {
+		dest->base_name = strdup(base_name);
+	} else {
+		dest->base_name = strdup(src->base_name);
+	}
+	if (src->version == NULL) {
+		dest->version = strdup(version());
+	} else {
+		dest->version = strdup(src->version);
 	}
-	strcpy(dest->prompt2, src->prompt2);
 
 	/*
 	 * return the new value
@@ -747,7 +995,7 @@ config_free(CONFIG *cfg)
 	}
 
 	/*
-	 * free prointer values
+	 * free pointer values
 	 */
 	if (cfg->epsilon != NULL) {
 		qfree(cfg->epsilon);
@@ -758,6 +1006,15 @@ config_free(CONFIG *cfg)
 	if (cfg->prompt2 != NULL) {
 		free(cfg->prompt2);
 	}
+	if (cfg->program != NULL) {
+		free(cfg->program);
+	}
+	if (cfg->base_name != NULL) {
+		free(cfg->base_name);
+	}
+	if (cfg->version != NULL) {
+		free(cfg->version);
+	}
 
 	/*
 	 * free the CONFIG value itself
@@ -782,6 +1039,7 @@ void
 config_value(CONFIG *cfg, int type, VALUE *vp)
 {
 	long i=0;
+	char *p;
 
 	/*
 	 * firewall
@@ -796,6 +1054,7 @@ config_value(CONFIG *cfg, int type, VALUE *vp)
 	 * convert element to value
 	 */
 	vp->v_type = V_NUM;
+	vp->v_subtype = V_NOSUBTYPE;
 	switch (type) {
 	case CONFIG_ALL:
 		vp->v_type = V_CONFIG;
@@ -812,8 +1071,12 @@ config_value(CONFIG *cfg, int type, VALUE *vp)
 
 	case CONFIG_MODE:
 		vp->v_type = V_STR;
-		vp->v_subtype = V_STRLITERAL;
-		vp->v_str = modename(cfg->outmode);
+		p = lookup_name(modes, cfg->outmode);
+		if (p == NULL) {
+			math_error("invalid output mode: %d", cfg->outmode);
+			/*NOTREACHED*/
+		}
+		vp->v_str = makenewstring(p);
 		return;
 
 	case CONFIG_EPSILON:
@@ -841,12 +1104,22 @@ config_value(CONFIG *cfg, int type, VALUE *vp)
 		break;
 
 	case CONFIG_TILDE:
-		i = cfg->tilde_ok;
-		break;
+		vp->v_type = V_STR;
+		if (cfg->tilde_ok) {
+			vp->v_str = makenewstring(TRUE_STRING);
+		} else {
+			vp->v_str = makenewstring(FALSE_STRING);
+		}
+		return;
 
 	case CONFIG_TAB:
-		i = cfg->tab_ok;
-		break;
+		vp->v_type = V_STR;
+		if (cfg->tab_ok) {
+			vp->v_str = makenewstring(TRUE_STRING);
+		} else {
+			vp->v_str = makenewstring(FALSE_STRING);
+		}
+		return;
 
 	case CONFIG_QUOMOD:
 		i = cfg->quomod;
@@ -885,33 +1158,128 @@ config_value(CONFIG *cfg, int type, VALUE *vp)
 		break;
 
 	case CONFIG_LEADZERO:
-		i = cfg->leadzero;
-		break;
+		vp->v_type = V_STR;
+		if (cfg->leadzero) {
+			vp->v_str = makenewstring(TRUE_STRING);
+		} else {
+			vp->v_str = makenewstring(FALSE_STRING);
+		}
+		return;
 
 	case CONFIG_FULLZERO:
-		i = cfg->fullzero;
-		break;
+		vp->v_type = V_STR;
+		if (cfg->fullzero) {
+			vp->v_str = makenewstring(TRUE_STRING);
+		} else {
+			vp->v_str = makenewstring(FALSE_STRING);
+		}
+		return;
 
-	case CONFIG_MAXERR:
-		i = cfg->maxerrorcount;
+	case CONFIG_MAXSCAN:
+		i = cfg->maxscancount;
 		break;
 
 	case CONFIG_PROMPT:
 		vp->v_type = V_STR;
-		vp->v_subtype = V_STRLITERAL;
-		vp->v_str = cfg->prompt1;
+		vp->v_str = makenewstring(cfg->prompt1);
 		return;
 
 	case CONFIG_MORE:
 		vp->v_type = V_STR;
-		vp->v_subtype = V_STRLITERAL;
-		vp->v_str = cfg->prompt2;
+		vp->v_str = makenewstring(cfg->prompt2);
 		return;
 
-	case CONFIG_RANDOM:
-		i = cfg->random;
+	case CONFIG_BLKMAXPRINT:
+		i = cfg->blkmaxprint;
 		break;
 
+	case CONFIG_BLKVERBOSE:
+		vp->v_type = V_STR;
+		if (cfg->blkverbose) {
+			vp->v_str = makenewstring(TRUE_STRING);
+		} else {
+			vp->v_str = makenewstring(FALSE_STRING);
+		}
+		return;
+
+	case CONFIG_BLKBASE:
+		vp->v_type = V_STR;
+		p = lookup_name(blk_base, cfg->blkbase);
+		if (p == NULL) {
+			math_error("invalid block base: %d", cfg->blkbase);
+			/*NOTREACHED*/
+		}
+		vp->v_str = makenewstring(p);
+		return;
+
+	case CONFIG_BLKFMT:
+		vp->v_type = V_STR;
+		p = lookup_name(blk_fmt, cfg->blkfmt);
+		if (p == NULL) {
+			math_error("invalid block format: %d", cfg->blkfmt);
+			/*NOTREACHED*/
+		}
+		vp->v_str = makenewstring(p);
+		return;
+
+	case CONFIG_CALC_DEBUG:
+		i = cfg->calc_debug;
+		break;
+
+	case CONFIG_RESOURCE_DEBUG:
+		i = cfg->resource_debug;
+		break;
+
+	case CONFIG_USER_DEBUG:
+		i = cfg->user_debug;
+		break;
+
+	case CONFIG_VERBOSE_QUIT:
+		vp->v_type = V_STR;
+		if (cfg->verbose_quit) {
+			vp->v_str = makenewstring(TRUE_STRING);
+		} else {
+			vp->v_str = makenewstring(FALSE_STRING);
+		}
+		return;
+
+	case CONFIG_CTRL_D:
+		vp->v_type = V_STR;
+		p = lookup_name(ctrl_d, cfg->ctrl_d);
+		if (p == NULL) {
+			math_error("invalid Control-D: %d", cfg->ctrl_d);
+			/*NOTREACHED*/
+		}
+		vp->v_str = makenewstring(p);
+		return;
+
+	case CONFIG_PROGRAM:
+		vp->v_type = V_STR;
+		if (cfg->base_name == NULL) {
+			vp->v_str = makestring(strdup(program));
+		} else {
+			vp->v_str = makenewstring(cfg->program);
+		}
+		return;
+
+	case CONFIG_BASENAME:
+		vp->v_type = V_STR;
+		if (cfg->base_name == NULL) {
+			vp->v_str = makestring(strdup(base_name));
+		} else {
+			vp->v_str = makenewstring(cfg->base_name);
+		}
+		return;
+
+	case CONFIG_VERSION:
+		vp->v_type = V_STR;
+		if (cfg->version == NULL) {
+			vp->v_str = makestring(strdup(version()));
+		} else {
+			vp->v_str = makenewstring(cfg->version);
+		}
+		return;
+
 	default:
 		math_error("Getting illegal CONFIG element");
 		/*NOTREACHED*/
@@ -978,8 +1346,31 @@ config_cmp(CONFIG *cfg1, CONFIG *cfg2)
 	       cfg1->round != cfg2->round ||
 	       cfg1->leadzero != cfg2->leadzero ||
 	       cfg1->fullzero != cfg2->fullzero ||
-	       cfg1->maxerrorcount != cfg2->maxerrorcount ||
+	       cfg1->maxscancount != cfg2->maxscancount ||
 	       strcmp(cfg1->prompt1, cfg2->prompt1) != 0 ||
 	       strcmp(cfg1->prompt2, cfg2->prompt2) != 0 ||
-	       cfg1->random != cfg2->random;
+	       cfg1->blkmaxprint != cfg2->blkmaxprint ||
+	       cfg1->blkverbose != cfg2->blkverbose ||
+	       cfg1->blkbase != cfg2->blkbase ||
+	       cfg1->blkfmt != cfg2->blkfmt ||
+	       cfg1->calc_debug != cfg2->calc_debug ||
+	       cfg1->resource_debug != cfg2->resource_debug ||
+	       cfg1->user_debug != cfg2->user_debug ||
+	       cfg1->verbose_quit != cfg2->verbose_quit ||
+	       cfg1->ctrl_d != cfg2->ctrl_d ||
+
+	       (cfg1->program == NULL && cfg2->program != NULL) ||
+	       (cfg1->program != NULL && cfg2->program == NULL) ||
+	       (cfg1->program != NULL && cfg2->program != NULL &&
+		strcmp(cfg1->program, cfg2->program) != 0) ||
+
+	       (cfg1->base_name == NULL && cfg2->base_name != NULL) ||
+	       (cfg1->base_name != NULL && cfg2->base_name == NULL) ||
+	       (cfg1->base_name != NULL && cfg2->base_name != NULL &&
+		strcmp(cfg1->base_name, cfg2->base_name) != 0) ||
+
+	       (cfg1->version == NULL && cfg2->version != NULL) ||
+	       (cfg1->version != NULL && cfg2->version == NULL) ||
+	       (cfg1->version != NULL && cfg2->version != NULL &&
+		strcmp(cfg1->version, cfg2->version) != 0);
 }

config.h

@@ -1,44 +1,41 @@
 /*
- * Copyright (c) 1995 by Landon Curt Noll.  All Rights Reserved.
+ * config - configuration routines
  *
- * Permission to use, copy, modify, and distribute this software and
- * its documentation for any purpose and without fee is hereby granted,
- * provided that the above copyright, this permission notice and text
- * this comment, and the disclaimer below appear in all of the following:
+ * Copyright (C) 1999  Landon Curt Noll and David I. Bell
  *
- *	supporting documentation
- *	source copies
- *	source works derived from this source
- *	binaries derived from this source or from derived source
+ * Primary author:  Landon Curt Noll
  *
- * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
- * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
- * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
- * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
- * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
- * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
- * PERFORMANCE OF THIS SOFTWARE.
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
  *
- * Prior to calc 2.9.3t9, these routines existed as a calc library called
- * cryrand.cal.  They have been rewritten in C for performance as well
- * as to make them available directly from libcalc.a.
+ * Calc 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 Lesser General
+ * Public License for more details.
  *
- * Comments, suggestions, bug fixes and questions about these routines
- * are welcome.  Send EMail to the address given below.
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
  *
- * Happy bit twiddling,
+ * @(#) $Revision: 29.2 $
+ * @(#) $Id: config.h,v 29.2 1999/12/14 19:37:46 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/config.h,v $
  *
- *			Landon Curt Noll
+ * Under source code control:	1995/11/01 22:20:17
+ * File existed as early as:	1995
  *
- *			chongo@toad.com
- *			...!{pyramid,sun,uunet}!hoptoad!chongo
- *
- * chongo was here	/\../\
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
-#if !defined(CONFIG_H)
-#define CONFIG_H
 
+#if !defined(__CONFIG_H__)
+#define __CONFIG_H__
+
+
+#include "nametype.h"
 #include "qmath.h"
 
 
@@ -51,11 +48,11 @@
 #define CONFIG_EPSILON	3
 #define CONFIG_EPSILONPREC 3	/* not a real type -- tied to CONFIG_EPSILON */
 #define CONFIG_TRACE	4
-#define CONFIG_MAXPRINT	5
-#define	CONFIG_MUL2	6
-#define	CONFIG_SQ2	7
-#define	CONFIG_POW2	8
-#define	CONFIG_REDC2	9
+#define CONFIG_MAXPRINT 5
+#define CONFIG_MUL2	6
+#define CONFIG_SQ2	7
+#define CONFIG_POW2	8
+#define CONFIG_REDC2	9
 #define CONFIG_TILDE	10
 #define CONFIG_TAB	11
 #define CONFIG_QUOMOD	12
@@ -65,30 +62,51 @@
 #define CONFIG_APPR	16
 #define CONFIG_CFAPPR	17
 #define CONFIG_CFSIM	18
-#define CONFIG_OUTROUND	19
+#define CONFIG_OUTROUND 19
 #define CONFIG_ROUND	20
-#define CONFIG_LEADZERO	21
-#define CONFIG_FULLZERO	22
-#define CONFIG_MAXERR	23
+#define CONFIG_LEADZERO 21
+#define CONFIG_FULLZERO 22
+#define CONFIG_MAXSCAN	23
 #define CONFIG_PROMPT	24
 #define CONFIG_MORE	25
-#define CONFIG_RANDOM	26
+#define CONFIG_BLKMAXPRINT 26
+#define CONFIG_BLKVERBOSE 27
+#define CONFIG_BLKBASE 28
+#define CONFIG_BLKFMT 29
+#define CONFIG_RESOURCE_DEBUG 30
+#define CONFIG_LIB_DEBUG CONFIG_RESOURCE_DEBUG
+#define CONFIG_CALC_DEBUG 31
+#define CONFIG_USER_DEBUG 32
+#define CONFIG_VERBOSE_QUIT 33
+#define CONFIG_CTRL_D 34
+#define CONFIG_PROGRAM 35
+#define CONFIG_BASENAME 36
+#define CONFIG_VERSION 37
 
 
 /*
- * config defult symbols
+ * config default symbols
  */
 #define DISPLAY_DEFAULT 20	/* default digits for float display */
-#define EPSILON_DEFAULT "1e-20"	/* allowed error for float calculations */
+#define EPSILON_DEFAULT "1e-20" /* allowed error for float calculations */
 #define EPSILONPREC_DEFAULT 67	/* 67 ==> 2^-67 <= EPSILON_DEFAULT < 2^-66 */
 #define NEW_EPSILON_DEFAULT "1e-10"	/* newstd EPSILON_DEFAULT */
 #define NEW_EPSILONPREC_DEFAULT 34	/* 34 ==> 2^-34 <= 1e-10 < 2^-33 */
 #define MAXPRINT_DEFAULT 16	/* default number of elements printed */
-#define MAXERRORCOUNT 20	/* default max errors before an abort */
+#define MAXSCANCOUNT 20		/* default max scan errors before an abort */
 
 
 /*
  * configuration object
+ *
+ * If you add elements to this structure, you need to also update:
+ *
+ *	quickhash.c	- config_hash()
+ *	hash.c		- hash_value()
+ *	config.c	- configs[], oldstd, newstd, setconfig(),
+ *			  config_value(), config_cmp(),
+ *			  and perhaps config_copy(), config_free()
+ *	config.h	- CONFIG_XYZ_SYMBOL (see above)
  */
 struct config {
 	int outmode;		/* current output mode */
@@ -101,8 +119,8 @@ struct config {
 	LEN sq2;		/* size of number to use square algorithm 2 */
 	LEN pow2;		/* size of modulus to use REDC for powers */
 	LEN redc2;		/* size of modulus to use REDC algorithm 2 */
-	int tilde_ok;		/* ok to print a tilde on aproximations */
-	int tab_ok;		/* ok to print tab before numeric values */
+	BOOL tilde_ok;		/* ok to print a tilde on aproximations */
+	BOOL tab_ok;		/* ok to print tab before numeric values */
 	long quomod;		/* quomod() default rounding mode */
 	long quo;		/* quotent // default rounding mode */
 	long mod;		/* mod % default rounding mode */
@@ -112,14 +130,53 @@ struct config {
 	long cfsim;		/* cfsim() default rounding mode */
 	long outround;		/* output default rounding mode */
 	long round;		/* round()/bround() default rounding mode */
-	int leadzero;		/* ok to print leading 0 before decimal pt */
-	int fullzero;		/* ok to print trailing 0's -- XXX ??? */
-	long maxerrorcount;	/* max errors before abort */
+	BOOL leadzero;		/* ok to print leading 0 before decimal pt */
+	BOOL fullzero;		/* ok to print trailing 0's */
+	long maxscancount;	/* max scan errors before abort */
 	char *prompt1;		/* normal prompt */
 	char *prompt2;		/* prompt when inside multi-line input */
-	int random;		/* random mode */
+	int blkmaxprint;	/* octets of a block to print, 0 => all */
+	BOOL blkverbose;	/* TRUE => print all lines if a block */
+	int blkbase;		/* block output base */
+	int blkfmt;		/* block output style */
+	long calc_debug;	/* internal debug, see CALC_DEBUG_XXX below */
+	long resource_debug;	/* resource debug, see RSCDBG_XXX below */
+	long user_debug;	/* user defined debug value: 0 default */
+	BOOL verbose_quit;	/* TRUE => print Quit or abort executed msg */
+	int ctrl_d;		/* see CTRL_D_xyz below */
+	char *program;		/* our name */
+	char *base_name;	/* basename of our name */
+	char *version;		/* calc version string */
 };
-typedef	struct config CONFIG;
+typedef struct config CONFIG;
+
+
+/*
+ * resource_debug bit masks
+ */
+#define RSCDBG_STDIN_FUNC   (0x00000001)    /* interactive func define debug */
+#define RSCDBG_FILE_FUNC    (0x00000002)    /* file read func define debug */
+#define RSCDBG_FUNC_INFO    (0x00000004)    /* print extra info for show func */
+#define RSCDBG_MASK	    (0x00000007)
+
+
+/*
+ * calc_debug bit masks
+ */
+#define CALCDBG_SYSTEM	    (0x00000001)    /* print system cmd prior to exec */
+#define CALCDBG_FUNC_QUIT   (0x00000002)    /* active functions when quit */
+#define CALCDBG_HASH_STATE  (0x00000004)    /* hash state details */
+#define CALCDBG_BLOCK	    (0x00000008)    /* block debug */
+#define CALCDBG_TTY	    (0x00000010)    /* report TTY state changes */
+#define CALCDBG_RUNSTATE    (0x00000020)    /* report run_state changes */
+#define CALCDBG_MASK	    (0x0000003f)
+
+/*
+ * ctrl-d meanings
+ */
+#define CTRL_D_VIRGIN_EOF  (0)	/* ^D only exits on virgin command lines */
+#define CTRL_D_NEVER_EOF   (1)	/* ^D never exits, emacs binding meaning only */
+#define CTRL_D_EMPTY_EOF   (2)	/* ^D always exits at start of line */
 
 
 /*
@@ -128,16 +185,20 @@ typedef	struct config CONFIG;
 extern CONFIG *conf;		/* current configuration */
 extern CONFIG oldstd;		/* backward compatible standard configuration */
 extern CONFIG newstd;		/* new non-backward compatible configuration */
+extern char *calc_debug;	/* !=NULL => value of config("calc_debug") */
+extern char *resource_debug;	/* !=NULL => config("resource_debug") value */
+extern char *user_debug;	/* !=NULL => value of config("user_debug") */
 
 
 /*
- * configuration functions
+ * configuration externals
  */
 extern CONFIG *config_copy(CONFIG *src);
 extern void config_free(CONFIG *cfg);
 extern void config_print(CONFIG *cfg);
-extern BOOL config_cmp(CONFIG *cfg1, CONFIG *cfg2);
-extern int configtype(char *name);
+extern int configtype(char*);
+extern void config_print(CONFIG*);
+extern BOOL config_cmp(CONFIG*, CONFIG*);
 
 
-#endif
+#endif /* !__CONFIG_H__ */

const.c

@@ -1,27 +1,67 @@
 /*
- * Copyright (c) 1993 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * const - constant number storage module
  *
- * Constant number storage module.
+ * Copyright (C) 1999  David I. Bell
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: const.c,v 29.1 1999/12/14 09:15:35 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/const.c,v $
+ *
+ * Under source code control:	1990/02/15 01:48:14
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
  */
 
+
+#include <stdio.h>
 #include "calc.h"
+#include "qmath.h"
 
 #define CONSTALLOCSIZE 400	/* number of constants to allocate */
 
-
 static long constcount;		/* number of constants defined */
 static long constavail;		/* number of constants available */
 static NUMBER **consttable;	/* table of constants */
 
 
+void
+initconstants(void)
+{
+	int i;
+
+	consttable = (NUMBER **) malloc(sizeof(NUMBER *) * CONSTALLOCSIZE);
+	if (consttable == NULL) {
+		math_error("Unable to allocate constant table");
+		/*NOTREACHED*/
+	}
+	for (i = 0; i < INITCONSTCOUNT; i++)
+		consttable[i] = initnumbs[i];
+	consttable[INITCONSTCOUNT] = NULL;	/* firewall */
+	constcount = INITCONSTCOUNT;
+	constavail = CONSTALLOCSIZE - INITCONSTCOUNT;
+}
+
+
 /*
- * Read in a constant number and add it to the table of constant numbers,
+ * Read in a literal real number and add it to the table of constant numbers,
  * creating a new entry if necessary.  The incoming number is a string
- * value which must have a correct format, otherwise an undefined number
- * will result.  Returns the index of the number in the constant table.
- * Returns zero if the number could not be saved.
+ * value which must have a correct format.
+ * Returns the index of the number in the constant table.
  *
  * given:
  *	str		string representation of number
@@ -32,8 +72,6 @@ addnumber(char *str)
 	NUMBER *q;
 
 	q = str2q(str);
-	if (q == NULL)
-		return 0;
 	return addqconstant(q);
 }
 
@@ -59,14 +97,53 @@ addqconstant(NUMBER *q)
 	long denlen;		/* denominator length */
 	HALF numlow;		/* bottom value of numerator */
 	HALF denlow;		/* bottom value of denominator */
+	long first;		/* first non-null position found */
+	BOOL havefirst;
 
+	if (constavail <= 0) {
+		if (consttable == NULL) {
+			initconstants();
+		} else {
+			tp = (NUMBER **) realloc((char *) consttable,
+			sizeof(NUMBER *) * (constcount + CONSTALLOCSIZE));
+			if (tp == NULL) {
+				math_error("Unable to reallocate const table");
+				/*NOTREACHED*/
+			}
+			consttable = tp;
+			constavail = CONSTALLOCSIZE;
+		}
+	}
 	numlen = q->num.len;
 	denlen = q->den.len;
 	numlow = q->num.v[0];
 	denlow = q->den.v[0];
-	tp = &consttable[1];
-	for (index = 1; index <= constcount; index++) {
-		t = *tp++;
+	first = 0;
+	havefirst = FALSE;
+	tp = consttable;
+	for (index = 0; index < constcount; index++, tp++) {
+		t = *tp;
+		if (t->links == 0) {
+			if (!havefirst) {
+				havefirst = TRUE;
+				first = index;
+			}
+			continue;
+		}
+		if (q == t) {
+			if (q->links == 1) {
+				if (havefirst) {
+					*tp = consttable[first];
+					consttable[first] = q;
+				} else {
+					havefirst = TRUE;
+					first = index;
+				}
+				continue;
+			}
+			return index;
+		}
+
 		if ((numlen != t->num.len) || (numlow != t->num.v[0]))
 			continue;
 		if ((denlen != t->den.len) || (denlow != t->den.v[0]))
@@ -74,40 +151,94 @@ addqconstant(NUMBER *q)
 		if (q->num.sign != t->num.sign)
 			continue;
 		if (qcmp(q, t) == 0) {
+			t->links++;
 			qfree(q);
 			return index;
 		}
 	}
-	if (constavail <= 0) {
-		if (consttable == NULL) {
-			tp = (NUMBER **)
-				malloc(sizeof(NUMBER *) * (CONSTALLOCSIZE + 1));
-			*tp = NULL;
-		} else
-			tp = (NUMBER **) realloc((char *) consttable,
-			sizeof(NUMBER *) * (constcount+CONSTALLOCSIZE + 1));
-		if (tp == NULL)
-			return 0;
-		consttable = tp;
-		constavail = CONSTALLOCSIZE;
+	if (havefirst) {
+		consttable[first] = q;
+		return first;
 	}
 	constavail--;
-	constcount++;
-	consttable[constcount] = q;
-	return constcount;
+	consttable[constcount++] = q;
+	return index;
 }
 
 
 /*
  * Return the value of a constant number given its index.
- * Returns address of the number, or NULL if the index is illegal.
+ * Returns address of the number, or NULL if the index is illegal
+ * or points to freed position.
  */
 NUMBER *
 constvalue(unsigned long index)
 {
-	if ((index <= 0) || (index > constcount))
-		return NULL;
+	if (index >= constcount) {
+		math_error("Bad index value for constvalue");
+		/*NOTREACHED*/
+	}
+	if (consttable[index]->links == 0) {
+		math_error("Constvalue has been freed!!!");
+		/*NOTREACHED*/
+	}
 	return consttable[index];
 }
 
+
+void
+freeconstant(unsigned long index)
+{
+	NUMBER *q;
+
+	if (index >= constcount) {
+		math_error("Bad index value for freeconst");
+		/*NOTREACHED*/
+	}
+	q = consttable[index];
+	if (q->links == 0) {
+		math_error("Attempting to free freed const location");
+		/*NOTREACHED*/
+	}
+	qfree(q);
+	if (index == constcount - 1) {
+		trimconstants();
+	}
+}
+
+
+void
+trimconstants(void)
+{
+	while (constcount > 0 &&
+	       (consttable[constcount-1] == NULL ||
+		consttable[constcount-1]->links == 0)) {
+		constcount--;
+		constavail++;
+	}
+}
+
+void
+showconstants(void)
+{
+	long index;
+	NUMBER **qp;
+	long count;
+
+	qp = consttable;
+	count = 0;
+	for (index = 0; index < constcount; index++, qp++) {
+		if ((*qp)->links) {
+			if (!count) {
+				printf("\n   Index   Links   Value\n");
+			}
+			count++;
+			printf("\n%8ld%8ld    ", index, (*qp)->links);
+			fitprint(*qp, 40);
+		}
+	}
+	printf("\n\nNumber = %ld\n", count);
+}
+
+
 /* END CODE */

cscript/Makefile

@@ -0,0 +1,247 @@
+#
+# cscript - makefile for calc shell script files
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.3 $
+# @(#) $Id: Makefile,v 29.3 1999/12/14 19:30:19 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cscript/RCS/Makefile,v $
+#
+# Under source code control:	1999/11/29 11:10:26
+# File existed as early as:	1999
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+#
+# calculator by David I. Bell with help/mods from others
+# Makefile by Landon Curt Noll
+
+
+# required vars
+#
+SHELL= /bin/sh
+MAKE_FILE = Makefile
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+BINDIR= /usr/local/bin
+#BINDIR= /usr/bin
+#BINDIR= /usr/contrib/bin
+#
+SCRIPTDIR= ${BINDIR}/cscript
+
+# Makefile debug
+#
+# Q=@	do not echo internal makefile actions (quiet mode)
+# Q=	echo internal makefile actions (debug / verbose mode)
+#
+#Q=
+Q=@
+
+# standard tools
+#
+CHMOD= chmod
+SED= sed
+SORT= sort
+FMT= fmt
+
+# The ${SCRIPT} list is the list of calc shell script files (without the .calc
+# extension) which will be installed.
+#
+# The ${SCRIPT_SRC} is built from ${SCRIPT} and has the .calc extensions.
+#
+# This list is prodiced by the detaillist rule when no WARNINGS are detected.
+# To add a script:
+#
+#	1) Name the file with a .calc filename extension
+#	2) Place that file under RCS control
+#	3) Add the name, without the .calc extension to the ${SCRIPT} below
+#	4) Write out this Makefile
+#	5) Replace the ${SCRIPT} and ${SCRIPT_SRC} lines with the output of:
+#
+#		make detaillist
+#
+SCRIPT= mersenne piforever plus simple
+
+SCRIPT_SRC= mersenne.calc piforever.calc plus.calc simple.calc
+
+# These files are found (but not built) in the distribution
+#
+DISTLIST= ${SCRIPT_SRC} ${MAKE_FILE}
+
+# These files are used to make (but not built) a calc .a library
+#
+CALCLIBLIST=
+
+# The reason for this Makefile
+#
+all: ${SCRIPT} ${SCRIPT_SRC} .all
+
+# used by the upper level Makefile to determine of we have done all
+#
+# NOTE: Due to bogus shells found on one common system we must have
+#	an non-emoty else clause for every if condition.  *sigh*
+#
+.all:
+	rm -f .all
+	touch .all
+
+##
+#
+# File list generation.	 You can ignore this section.
+#
+#
+# We will form the names of source files as if they were in a
+# sub-directory called calc/cscript.
+#
+##
+
+distlist: ${DISTLIST}
+	${Q}for i in ${DISTLIST}; do \
+		echo cscript/$$i; \
+	done | ${SORT}
+
+distdir:
+	${Q}echo cscript
+
+calcliblist:
+
+# These next rule help me form the ${DETAIL_HELP} makefile variables above.
+#
+detaillist:
+	${Q}-(echo "xxxxxxx"; \
+	   for i in ${SCRIPT}; do \
+		if [ ! -f RCS/$$i.calc,v ]; then \
+		    echo "WARNING: $$i.calc not under RCS control" 1>&2; \
+		else \
+		    echo $$i; \
+		fi; \
+	done | ${SORT}) | ${FMT} -70 | \
+	    ${SED} -e '1s/xxxxxxx/SCRIPT=/' -e '2,$$s/^/	/' \
+		   -e 's/$$/ \\/' -e '$$s/ \\$$//'
+	${Q}echo
+	${Q}-(echo "xxxxxxxxxxx"; \
+	   for i in ${SCRIPT}; do \
+		if [ ! -f RCS/$$i.calc,v ]; then \
+		    echo "WARNING: $$i.calc not under RCS control" 1>&2; \
+		else \
+		    echo $$i.calc; \
+		fi; \
+	done | ${SORT}) | ${FMT} -70 | \
+	    ${SED} -e '1s/xxxxxxxxxxx/SCRIPT_SRC=/' -e '2,$$s/^/	/' \
+		   -e 's/$$/ \\/' -e '$$s/ \\$$//'
+
+##
+#
+# Home grown make dependency rules.  Your system make not support
+# or have the needed tools.  You can ignore this section.
+#
+# We will form a skelaton tree of *.c files containing only #include "foo.h"
+# lines and .h files containing the same lines surrounded by multiple include
+# prevention lines.  This allows us to build a static depend list that will
+# satisfy all possible cpp symbol definition combinations.
+#
+##
+
+depend:
+	${Q}if [ -f Makefile.bak ]; then \
+		echo "Makefile.bak exists, remove or move it out of the way"; \
+		exit 1; \
+	else \
+	    true; \
+	fi
+	-${Q}rm -f makedep.out
+	${Q}echo forming cscript dependency list
+	${Q}echo "# DO NOT DELETE THIS LINE -- make depend depends on it." > \
+		makedep.out
+	${Q}echo "" >> makedep.out
+	${Q}for i in ${SCRIPT}; do \
+		echo "$$i: $$i.calc"; \
+		echo '	rm -f $$@'; \
+		echo '	$${SED} -e "1s:^#!/usr/local/src/cmd/calc/calc:#!$${BINDIR}/calc:" $$?>$$@'; \
+		echo '	$${CHMOD} +x $$@'; \
+	done >> makedep.out
+	${Q}echo sample dependency list formed
+	${Q}echo forming new cscript/Makefile
+	-${Q}rm -f Makefile.bak
+	${Q}mv Makefile Makefile.bak
+	${Q}${SED} -n '1,/^# DO NOT DELETE THIS LINE/p' Makefile.bak > Makefile
+	${Q}echo "" >> Makefile
+	${Q}${SED} -n '3,$$p' makedep.out >> Makefile
+	-${Q}rm -f makedep.out
+	-${Q}if cmp -s Makefile.bak Makefile; then \
+		echo 'sample Makefile was already up to date'; \
+		mv -f Makefile.bak Makefile; \
+	else \
+		rm -f Makefile.tmp; \
+		mv Makefile Makefile.tmp; \
+		if [ -d RCS ]; then \
+		    co -l Makefile; \
+		fi; \
+		mv Makefile.tmp Makefile; \
+		if [ -d RCS ]; then \
+		    echo new sample Makefile formed, you need to check it in; \
+		fi; \
+	fi
+
+clean:
+	-rm -f makedep.out
+
+clobber:
+	-rm -f ${SCRIPT}
+
+install: all
+	-${Q}if [ ! -d ${BINDIR} ]; then \
+		echo mkdir ${BINDIR}; \
+		mkdir ${BINDIR}; \
+	else \
+	    true; \
+	fi
+	-${Q}if [ ! -d ${SCRIPTDIR} ]; then \
+		echo mkdir ${SCRIPTDIR}; \
+		mkdir ${SCRIPTDIR}; \
+	else \
+	    true; \
+	fi
+	${Q}for i in ${SCRIPT}; do \
+		echo rm -f ${SCRIPTDIR}/$$i; \
+		rm -f ${SCRIPTDIR}/$$i; \
+		echo cp $$i ${SCRIPTDIR}; \
+		cp $$i ${SCRIPTDIR}; \
+		echo ${CHMOD} 0555 ${SCRIPTDIR}/$$i; \
+		${CHMOD} 0555 ${SCRIPTDIR}/$$i; \
+	done
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+mersenne: mersenne.calc
+	rm -f $@
+	${SED} -e "1s:^#!/usr/local/src/cmd/calc/calc:#!${BINDIR}/calc:" $?>$@
+	${CHMOD} +x $@
+piforever: piforever.calc
+	rm -f $@
+	${SED} -e "1s:^#!/usr/local/src/cmd/calc/calc:#!${BINDIR}/calc:" $?>$@
+	${CHMOD} +x $@
+plus: plus.calc
+	rm -f $@
+	${SED} -e "1s:^#!/usr/local/src/cmd/calc/calc:#!${BINDIR}/calc:" $?>$@
+	${CHMOD} +x $@
+simple: simple.calc
+	rm -f $@
+	${SED} -e "1s:^#!/usr/local/src/cmd/calc/calc:#!${BINDIR}/calc:" $?>$@
+	${CHMOD} +x $@

cscript/mersenne.calc

@@ -0,0 +1,47 @@
+#!/usr/local/src/cmd/calc/calc -S
+#
+# mersenne - print the value of a mersenne number
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: mersenne.calc,v 29.1 1999/12/14 09:15:35 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cscript/RCS/mersenne.calc,v $
+#
+# Under source code control:	1999/11/30 00:09:01;
+# File existed as early as:	1999
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+
+# usage:
+#	mersenne exp
+
+
+/*
+ * parse args
+ */
+if (argv() != 1) {
+	/* we include the name of this script in the error message */
+	fprintf(files(2), "usage: %s exp\n", config("program"));
+	abort "wrong number of args";
+}
+
+/*
+ * print the decimal value of 2^n-1
+ */
+print "2^": argv(0) : "-1 =", 2^eval(argv(0))-1;

cscript/piforever.calc

@@ -0,0 +1,37 @@
+#!/usr/local/src/cmd/calc/calc -S
+#
+# piforever - print digits of pi forever (or as long as your mem/cpu allow)
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: piforever.calc,v 29.1 1999/12/14 09:15:36 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cscript/RCS/piforever.calc,v $
+#
+# Under source code control:	1999/11/30 00:11:36
+# File existed as early as:	1999
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+
+# usage:
+#	piforever
+
+
+read -once pi.cal
+print "pi ~= ":;
+piforever();

cscript/plus.calc

@@ -0,0 +1,53 @@
+#!/usr/local/src/cmd/calc/calc -S
+#
+# plus - add two or more arguments together
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: plus.calc,v 29.1 1999/12/14 09:15:36 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cscript/RCS/plus.calc,v $
+#
+# Under source code control:	1999/11/29 10:22:37
+# File existed as early as:	1999
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+
+# usage:
+#	plus val ...
+
+
+/*
+ * parse args
+ */
+if (argv() < 1) {
+	/* we include the name of this script in the error message */
+	fprintf(files(2), "usage: %s value ...\n", config("program"));
+	abort "not enough args";
+}
+
+/*
+ * print the sum of the 2 args
+ *
+ * Since args are strings, we must eval them before using them numerically.
+ */
+sum = 0;
+for (i=0; i < argv(); ++i) {
+	sum += eval(argv(i));
+}
+print sum;

cscript/simple.calc

@@ -0,0 +1,35 @@
+#!/usr/local/src/cmd/calc/calc -S
+#
+# simple - an example of a simple calc shell script
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: simple.calc,v 29.1 1999/12/14 09:15:36 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/cscript/RCS/simple.calc,v $
+#
+# Under source code control:	1999/11/29 10:22:37
+# File existed as early as:	1999
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+
+
+/*
+ * This is an example of a simple calc shell script.
+ */
+print "The simple calc shell script works!"

custom.c

@@ -0,0 +1,217 @@
+/*
+ * custom - interface for custom software and hardware interfaces
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: custom.c,v 29.1 1999/12/14 09:15:36 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/custom.c,v $
+ *
+ * Under source code control:	1997/03/03 04:53:08
+ * File existed as early as:	1997
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+
+/* these include files are needed regardless of CUSTOM */
+#include "have_const.h"
+#include "value.h"
+#include "custom.h"
+
+
+#if defined(CUSTOM)
+
+#include <stdio.h>
+
+#include "calc.h"
+
+#include "have_string.h"
+#ifdef HAVE_STRING_H
+# include <string.h>
+#endif
+
+#else /* CUSTOM */
+
+#include "config.h"
+
+#endif /* CUSTOM */
+
+int allow_custom = FALSE;	 /* TRUE => custom builtins allowed */
+
+
+/*
+ * custom - custom callout function
+ */
+/*ARGSUSED*/
+VALUE
+custom(char *name, int count, VALUE **vals)
+{
+#if defined(CUSTOM)
+
+	CONST struct custom *p;		/* current function */
+
+	/*
+	 * search the custom interface table for a function
+	 */
+	for (p = cust; p->name != NULL; ++p) {
+
+		/* look for the first match */
+		if (strcmp(name, p->name) == 0) {
+
+			/* arg count check */
+			if (count < p->minargs) {
+				math_error("Too few arguments for custom "
+				    "function \"%s\"", p->name);
+				/*NOTREACHED*/
+			}
+			if (count > p->maxargs) {
+				math_error("Too many arguments for custom "
+				    "function \"%s\"", p->name);
+				/*NOTREACHED*/
+			}
+
+			/* call the custom function */
+			return p->func(name, count, vals);
+		}
+	}
+
+	/*
+	 * no such custom function
+	 */
+	return error_value(E_UNK_CUSTOM);
+
+#else /* CUSTOM */
+
+	fprintf(stderr,
+	    "%sCalc was built with custom functions disabled\n",
+	    (conf->tab_ok ? "\t" : ""));
+	return error_value(E_NO_CUSTOM);
+
+#endif /* CUSTOM */
+}
+
+
+/*
+ * showcustom - display the names and brief descriptins of custom functions
+ */
+/*ARGSUSED*/
+void
+showcustom(void)
+{
+#if defined(CUSTOM)
+
+	CONST struct custom *p; /* current function */
+
+	/*
+	 * disable custom functions unless -C was given
+	 */
+	if (!allow_custom) {
+		fprintf(stderr,
+		    "%sCalc must be run with a -C argument to "
+		    "show custom functions\n",
+		    (conf->tab_ok ? "\t" : ""));
+		return;
+	}
+
+	/*
+	 * print header
+	 */
+	printf("\nName\tArgs\tDescription\n\n");
+	for (p = cust; p->name != NULL; ++p) {
+		printf("%-9s ", p->name);
+		if (p->maxargs == MAX_CUSTOM_ARGS)
+			printf("%d+    ", p->minargs);
+		else if (p->minargs == p->maxargs)
+			printf("%-6d", p->minargs);
+		else
+			printf("%d-%-4d", p->minargs, p->maxargs);
+		printf("%s\n", p->desc);
+	}
+	printf("\n");
+
+#else /* CUSTOM */
+
+	fprintf(stderr,
+	    "%sCalc was built with custom functions disabled\n",
+	    (conf->tab_ok ? "\t" : ""));
+
+#endif /* CUSTOM */
+}
+
+
+/*
+ * customhelp - standard help interface to a custom function
+ *
+ * This function assumes that a help file with the same name as
+ * the custom function has been installed by the custom/Makefile
+ * (as listed in the CUSTOM_HELP makefile variable) under the
+ * CUSTOMHELPDIR == HELPDIR/custhelp directory.
+ *
+ * The help command first does a search in HELPDIR and later
+ * in CUSTOMHELPDIR.  If a custom help file has the same name
+ * as a file under HELPDIR then help will display the HELPDIR
+ * file and NOT the custom file.  This function will ignore
+ * and HELPDIR file and work directly with the custom help file.
+ *
+ * given:
+ *	name	name of the custom help file to directly access
+ */
+/*ARGSUSED*/
+void
+customhelp(char *name)
+{
+#if defined(CUSTOM)
+
+	char *customname;	/* a string of the form: custom/name */
+
+	/*
+	 * firewall
+	 */
+	if (name == NULL) {
+		name = "help";
+	}
+
+	/*
+	 * form the custom help name
+	 */
+	customname = (char *)malloc(sizeof("custhelp")+strlen(name)+1);
+	if (customname == NULL) {
+		math_error("bad malloc of customname");
+		/*NOTREACHED*/
+	}
+	sprintf(customname, "custhelp/%s", name);
+
+	/*
+	 * give help directly to the custom file
+	 */
+	givehelp(customname);
+
+	/*
+	 * all done
+	 */
+	free(customname);
+
+#else /* CUSTOM */
+
+	fprintf(stderr,
+	    "%sCalc was built with custom functions disabled\n",
+	    (conf->tab_ok ? "\t" : ""));
+
+#endif /* CUSTOM */
+}

custom.h

@@ -0,0 +1,80 @@
+/*
+ * custom - interface for custom software and hardware interfaces
+ *
+ * Copyright (C) 1999  Landon Curt Noll
+ *
+ * Calc is open software; you can redistribute it and/or modify it under
+ * the terms of the version 2.1 of the GNU Lesser General Public License
+ * as published by the Free Software Foundation.
+ *
+ * Calc 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 Lesser General
+ * Public License for more details.
+ *
+ * A copy of version 2.1 of the GNU Lesser General Public License is
+ * distributed with calc under the filename COPYING-LGPL.  You should have
+ * received a copy with calc; if not, write to Free Software Foundation, Inc.
+ * 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+ *
+ * @(#) $Revision: 29.1 $
+ * @(#) $Id: custom.h,v 29.1 1999/12/14 09:15:36 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/custom.h,v $
+ *
+ * Under source code control:	1997/03/03 04:53:08
+ * File existed as early as:	1997
+ *
+ * chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+ * Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Be careful what you put in this file, upper .c files include
+ * this file even when CUSTOM is not defined (ALLOW_CUSTOM is empty).
+ *
+ * Don't include anything, let the including .c file bring in:
+ *
+ *	have_const.h
+ *	value.h
+ *
+ * before they include this file.
+ *
+ * Keep this file down to a minimum.   Don't put custom builtin funcion
+ * stuff in this file!
+ */
+
+
+#if !defined(CUSTOM_H)
+#define CUSTOM_H
+
+
+/*
+ * arg count definitons
+ */
+#define MAX_CUSTOM_ARGS 100	/* maximum number of custom arguments */
+
+
+/*
+ * custom function interface
+ */
+struct custom {
+	char *name;		/* name of the custom builtin */
+	char *desc;		/* very brief description of custom builtin */
+	short minargs;		/* minimum number of arguments */
+	short maxargs;		/* maximum number of arguments */
+	VALUE (*func)(char *name, int argc, VALUE **argv);  /* custom func */
+};
+
+
+/*
+ * external declarations
+ *
+ * These are the required interfaces.  The dummy.c stubs these interfaces too.
+ */
+extern VALUE custom(char*, int, VALUE**);	/* master custom interface */
+extern int allow_custom;		/* TRUE => custom builtins allowed */
+extern void showcustom(void);		/* print custom functions */
+extern void customhelp(char *);		/* direct custom help */
+extern CONST struct custom cust[];	/* custom interface table */
+
+#endif /* !CUSTOM_H */

custom/CUSTOM_CAL

@@ -0,0 +1,68 @@
+Custom calc resource files
+--------------------------
+
+The following custom calc resource files are provided because they serve
+as examples of how use the custom interface.  The custom interface
+allows for machine dependent and/or non-portable code to be added as
+builtins to the calc program.  A few example custom functions and
+resource files are shipped with calc to provide you with examples.
+
+By default, the custom builtin returns an error.  Calc have been
+built with:
+
+	ALLOW_CUSTOM= -DCUSTOM
+
+in the top level Makefile (this is the shipped default) and calc
+must be invoked with a -C argument:
+
+	calc -C
+
+when it is run.
+
+See the ../cal/README or "help resource" for information about
+calc resource standards and guidelines.
+
+=-=
+
+argv.cal
+
+    argv(var, ...)
+
+    print information about various args
+
+halflen.cal
+
+    halflen(num)
+
+    Calculate the length of a numeric value in HALF's.
+
+pzasusb8.cal
+
+    Run custom("pzasusb8") on a standard set of data, print Endian
+    related information and print value size information.
+
+## Copyright (C) 1999  Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: CUSTOM_CAL,v 29.1 1999/12/14 09:15:36 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/custom/RCS/CUSTOM_CAL,v $
+##
+## Under source code control:	1997/03/08 20:51:32
+## File existed as early as:	1997
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

custom/HOW_TO_ADD

@@ -0,0 +1,646 @@
+Guidelines for adding custom functions
+--------------------------------------
+
+Step 0: Determine if is should it be done?
+
+    The main focus for calc is to provide a portable platform for
+    multi-precision calculations in a C-like environment.  You should
+    consider implementing algorithms in the calc language as a first
+    choice.  Sometimes an algorithm requires use of special hardware, a
+    non-portable OS or pre-compiled C library.	In these cases a custom
+    interface may be needed.
+
+    The custom function interface is intended to make is easy for
+    programmers to add functionality that would be otherwise
+    un-suitable for general distribution.  Functions that are
+    non-portable (machine, hardware or OS dependent) or highly
+    specialized are possible candidates for custom functions.
+
+    So before you go to step 1, ask yourself:
+
+	+ Can I implement this as a calc resource file or calc shell script?
+
+	    If Yes, write the shell script or resource file and be done with it.
+	    If No, continue to the next question ...
+
+	+ Does it require the use of non-portable features,
+	  OS specific support or special hardware?
+
+	    If No, write it as a regular builtin function.
+	    If Yes, continue to step 1 ...
+
+
+Step 1: Do some background work
+
+    First ... read this file ALL THE WAY THROUGH before implementing
+    anything in Steps 2 and beyond!
+
+    If you are not familiar with calc internals, we recommend that
+    you look at some examples of custom functions.  Check out
+    the following source files:
+
+	custom.c
+	custom/custom.h
+	custom/custtbl.c
+	custom/c_*.[ch]
+	help/custom		(or run:  calc help custom)
+
+    You would be well advised to look at a more recent calc source
+    such as one available in from the calc version archive.
+    See the following for more details:
+
+	help/archive		(or run:  calc help archive)
+
+
+Step 2: Name your custom function
+
+    We suggest that you pick a name that does not conflict with
+    one of the builtin names.  It makes it easier to get help
+    via the help interface and avoid confusion down the road.
+
+    You should avoid picking a name that matches a file or
+    directory name under ${HELPDIR} as well.  Not all help
+    files are associated with builtin function names.
+
+    For purposes of this file, we will use the name 'curds'
+    as our example custom function name.
+
+
+Step 3: Document your custom function
+
+    No this step is NOT out of order.  We recommend that you write the
+    help file associated with your new custom function EARLY.  By
+    experience we have found that the small amount of effort made to
+    write "how the custom function will be used" into a help file pays
+    off in a big way when it comes to coding.  Often the effort of
+    writing a help file will clarify fuzzy aspects of your design.
+    Besides, unless you write the help file first, it will likely never
+    be written later on.  :-(
+
+    OK ... we will stop preaching now ...
+
+    [[ From now on we will give filenames relative to the custom directory ]]
+
+    Take a look at one of the example custom help files:
+
+	devnull
+	argv
+	help
+	sysinfo
+
+    You can save time by using one of the custom help files
+    as a template.  Copy one of these files to your own help file:
+
+	cp sysinfo curds
+
+    and edit it accordingly.
+
+
+Step 4: Write your test code
+
+    No this step is NOT out of order either.  We recommend that you
+    write a simple calc script that will call your custom function and
+    check the results.
+
+    This script will be useful while you are debugging your code.  In
+    addition, if you wish to submit your code for distribution, this
+    test code will be an import part of your submission.  Your test
+    code will also service as additional for your custom function.
+
+    Coops ... we said we would stop preaching, sorry about that ...
+
+    You can use one of the following as a template:
+
+	argv.cal
+	halflen.cal
+
+    Copy one of these to your own file:
+
+	cp halflen.cal curds.cal
+
+    and exit it accordingly.  In particular you will want to:
+
+	remove our header disclaimer (or put your own on)
+
+	change the name from halflen() to curds()
+
+	change the comment from 'halflen - determine the length ...' to
+	'curds - brief description about ...'
+
+	change the print statement near the very bottom from:
+
+		print "halflen(num) defined";
+
+	to:
+
+		print "curds( ... args description here ...) defined";
+
+
+Step 5: Write your custom function
+
+    By convention, the files we ship that contain custom function
+    interface code in filenames of the form:
+
+	c_*.c
+
+    We suggest that you use filenames of the form:
+
+	u_*.c
+
+    to avoid filename conflicts.
+
+    We recommend that you use one of the c_*.c files as a template.
+    Copy an appropriate file to your file:
+
+	cp c_argv.c u_curds.c
+
+    Before you edit it, you should note that there are several important
+    features of this file.
+
+	a) All of the code in the file is found between #if ... #endif:
+
+		/*
+		 * only comments and blank lines at the top
+		 */
+
+		#if defined(CUSTOM)
+
+		... all code, #includes, #defines etc.
+
+		#endif /* CUSTOM */
+
+	   This allows this code to 'go away' when the upper Makefile
+	   disables the custom code (because ALLOW_CUSTOM no longer
+	   has the -DCUSTOM define).
+
+	b) The function type must be:
+
+		/*ARGSUSED*/
+		VALUE
+		u_curds(char *name, int count, VALUE **vals)
+
+	   The /*ARGSUSED*/ may be needed if you do not make use
+	   of all 3 function parameters.
+
+	   The 3 args are passed in by the custom interface
+	   and have the following meaning:
+
+		name	The name of the custom function that
+			was called.  In particular, this is the first
+			string arg that was given to the custom()
+			builtin.  This is the equivalent of argv[0] for
+			main() in C programming.
+
+			The same code can be used for multiple custom
+			functions by processing off of this value.
+
+		count	This is the number of additional args that
+			was given to the custom() builtin.  Note
+			that count does NOT include the name arg.
+			This is similar to argc except that count
+			is one less than the main() argc interface.
+
+			For example, a call of:
+
+			    custom("curds", a, b, c)
+
+			would cause count to be passed as 3.
+
+		vals	This is a pointer to an array of VALUEs.
+			This is the equivalent of argv+1 for
+			main() in C programming.  The difference
+			here is that vals[0] refers to the 1st
+			parameter AFTER the same.
+
+			For example, a call of:
+
+			    custom("curds", a, b, c)
+
+			would cause vals to point to the following array:
+
+			    vals[0]  points to	a
+			    vals[1]  points to	b
+			    vals[2]  points to	c
+
+	c) The return value is the function must be a VALUE.
+
+	   The typical way to form a VALUE to return is by declaring
+	   the following local variable:
+
+		VALUE result;	/* what we will return */
+
+	d) You will need to include:
+
+		#if defined(CUSTOM)
+
+		/* any #include <foobar.h> here */
+
+		#include "../have_const.h"
+		#include "../value.h"
+		#include "custom.h"
+
+	    Typically these will be included just below any system
+	    includes and just below the #if defined(CUSTOM) line.
+
+    To better understand the VALUE type, read:
+
+	../value.h
+
+    The VALUE is a union of major value types found inside calc.
+    The v_type VALUE element determines which union element is
+    being used.	  Assume that we have:
+
+	VALUE *vp;
+
+    Then the value is determined according to v_type:
+
+	vp->v_type	the value is	which is a	type defined in
+	----------	------------	----------	---------------
+	V_NULL		(none)		n/a		n/a
+	V_INT		vp->v_int	long		n/a
+	V_NUM		vp->v_num	NUMBER *	../qmath.h
+	V_COM		vp->v_com	COMPLEX *	../cmath.h
+	V_ADDR		vp->v_addr	VALUE *		../value.h
+	V_STR		vp->v_str	char *		n/a
+	V_MAT		vp->v_mat	MATRIX *	../value.h
+	V_LIST		vp->v_list	LIST *		../value.h
+	V_ASSOC		vp->v_assoc	ASSOC *		../value.h
+	V_OBJ		vp->v_obj	OBJECT *	../value.h
+	V_FILE		vp->v_file	FILEID		../value.h
+	V_RAND		vp->v_rand	RAND *		../zrand.h
+	V_RANDOM	vp->v_random	RANDOM *	../zrandom.h
+	V_CONFIG	vp->v_config	CONFIG *	../config.h
+	V_HASH		vp->v_hash	HASH *		../hash.h
+	V_BLOCK		vp->v_block	BLOCK *		../block.h
+
+    The V_OCTET is under review and should not be used at this time.
+
+    There are a number of macros that may be used to determine
+    information about the numerical values (ZVALUE, NUMBER and COMPLEX).
+    you might also want to read the following to understand
+    some of the numerical types of ZVALUE, NUMBER and COMPLEX:
+
+	../zmath.h
+	../qmath.h
+	../cmath.h
+
+    While we cannot go into full detail here are some cookbook
+    code for manipulating VALUEs.  For these examples assume
+    that we will manipulate the return value:
+
+	VALUE result;	/* what we will return */
+
+    To return NULL:
+
+	result.v_type = V_NULL;
+	return result;
+
+    To return a long you need to convert it to a NUMBER:
+
+	long variable;
+
+	result.v_type = V_NUM;
+	result.v_num = itoq(variable);		/* see ../qmath.c */
+	return result;
+
+    To return a FULL you need to convert it to a NUMBER:
+
+	FULL variable;
+
+	result.v_type = V_NUM;
+	result.v_num = utoq(variable);		/* see ../qmath.c */
+	return result;
+
+    To convert a ZVALUE to a NUMBER*:
+
+	ZVALUE variable;
+
+	result.v_type = V_NUM;
+	result.v_num = qalloc();		/* see ../qmath.c */
+	result.v_num->num = variable;
+	return result;
+
+    To convert a small NUMBER* into a long:
+
+	NUMBER *num;
+	long variable;
+
+	variable = qtoi(num);
+
+    To obtain a ZVALUE from a NUMBER*, extract the numerator:
+
+	NUMBER *num;
+	ZVALUE z_variable;
+
+	if (qisint(num)) {
+		z_variable = num->num;
+	}
+
+    To be sure that the value will fit, use the ZVALUE test macros:
+
+	ZVALUE z_num;
+	long variable;
+	unsigned long u_variable;
+	FULL f_variable;
+	short very_tiny_variable;
+
+	if (zgtmaxlong(z_num)) {			/* see ../zmath.h */
+		variable = ztolong(z_num);
+	}
+	if (zgtmaxulong(z_num)) {
+		u_variable = ztoulong(z_num);
+	}
+	if (zgtmaxufull(z_num)) {
+		f_variable = ztofull(z_num);
+	}
+	if (zistiny(z_num)) {
+		very_tiny_variable = z1tol(z_num);
+	}
+
+
+Step 6: Register the function in the custom interface table
+
+    To allow the custom() builtin to transfer control to your function,
+    you need to add an entry into the CONST struct custom cust table
+    found in custtbl.c:
+
+	/*
+	 * custom interface table
+	 *
+	 * The order of the elements in struct custom are:
+	 *
+	 *	{ "xyz", "brief description of the xyz custom function",
+	 *	   minimum_args, maximum_args, c_xyz },
+	 *
+	 * where:
+	 *
+	 *	minimum_args	an int >= 0
+	 *	maximum_args	an int >= minimum_args and <= MAX_CUSTOM_ARGS
+	 *
+	 * Use MAX_CUSTOM_ARGS for maximum_args is the maximum number of args
+	 * is potentially 'unlimited'.
+	 *
+	 * If the brief description cannot fit on the same line as the name
+	 * without wrapping on a 80 col window, the description is probably
+	 * too long and will not look nice in the show custom output.
+	 */
+	CONST struct custom cust[] = {
+
+	#if defined(CUSTOM)
+
+
+		/*
+		 * add your own custom functions here
+		 *
+		 * We suggest that you sort the entries below by name
+		 * so that show custom will produce a nice sorted list.
+		 */
+
+		{ "argv", "information about its args, returns arg count",
+		 0, MAX_CUSTOM_ARGS, c_argv },
+
+		{ "devnull", "does nothing",
+		 0, MAX_CUSTOM_ARGS, c_devnull },
+
+		{ "help", "help for custom functions",
+		 1, 1, c_help },
+
+		{ "sysinfo", "return a calc #define value",
+		 0, 1, c_sysinfo },
+
+
+	#endif /* CUSTOM */
+
+		/*
+		 * This must be at the end of this table!!!
+		 */
+		{NULL, NULL,
+		 0, 0, NULL}
+	};
+
+    The definition of struct custom may be found in custom.h.
+
+    It is important that your entry be placed inside the:
+
+	#if defined(CUSTOM) ... #endif /* CUSTOM */
+
+    lines so that when the custom interface is disabled by the upper
+    level Makefile, one does not have unsatisfied symbols.
+
+    The brief description should be brief so that 'show custom' looks well
+    formatted.	If the brief description cannot fit on the same line as
+    the name without wrapping on a 80 col window, the description is
+    probably too long and will not look nice in the show custom output.
+
+    The minargs places a lower bound on the number of args that
+    must be supplied to the interface.	This does NOT count
+    the name argument given to custom().  So if minargs is 2:
+
+	custom("curds")		/* call blocked at high level interface */
+	custom("curds", a)	/* call blocked at high level interface */
+	custom("curds", a, b)	/* call passed down to "curds" interface */
+
+    The maxargs sets a limit on the number of args that may be passed.
+    If minargs == maxargs, then the call requires a fixed number of
+    argument.  There is a upper limit on the number of args.  If
+    one wants an effectively unlimited upper bound, use MAX_CUSTOM_ARGS.
+
+    Note that one must have:
+
+		0 <= minargs <= maxargs <= MAX_CUSTOM_ARGS
+
+    To allow the curds function to take at least 2 args and up
+    to 5 args, one would add the following entry to cust[]:
+
+		{ "curds", "brief description about curds interface",
+		 2, 5, u_curds },
+
+    It is recommended that the cust[] remain in alphabetical order,
+    so one would place it before the "devnull" and after "argv".
+
+    Last, you must forward declare the u_curds near the top of the file:
+
+	#if defined(CUSTOM)
+
+
+	/*
+	 * add your forward custom function declarations here
+	 *
+	 * Declare custom functions as follows:
+	 *
+	 *	extern VALUE c_xyz(char*, int, VALUE**);
+	 *
+	 * We suggest that you sort the entries below by name.
+	 */
+	extern VALUE c_argv(char*, int, VALUE**);
+	extern VALUE c_devnull(char*, int, VALUE**);
+	extern VALUE c_help(char*, int, VALUE**);
+	extern VALUE c_sysinfo(char*, int, VALUE**);
+
+    For u_curds we would add the line:
+
+	extern VALUE u_curds(char*, int, VALUE**);
+
+
+Step 7: Add the required information to the Makefile
+
+    The calc test script, curds.cal, should be added to the
+    CUSTOM_CALC_FILES Makefile variable:
+
+	CUSTOM_CALC_FILES= argv.cal halflen.cal curds.cal
+
+    The help file, curds, should be added to the CUSTOM_HELP
+    Makefile variable:
+
+	CUSTOM_HELP= argv devnull help sysinfo curds
+
+    If you needed to create any .h files to support u_curds.c, these
+    files should be added to the CUSTOM_H_SRC Makefile variable:
+
+	CUSTOM_H_SRC= u_curds.h otherfile.h
+
+    Your u_curds.c file MUST be added to the CUSTOM_SRC Makefile variable:
+
+	CUSTOM_SRC= c_argv.c c_devnull.c c_help.c c_sysinfo.c u_curds.c
+
+    and so must the associated .o file:
+
+	CUSTOM_OBJ= c_argv.o c_devnull.o c_help.o c_sysinfo.o u_curds.o
+
+
+Step 8: Compile and link in your code
+
+    If your calc was not previously setup to compile custom code,
+    you should set it up now.  The upper level Makefile (and
+    the custom Makefile) should have the following Makefile
+    variable defined:
+
+	ALLOW_CUSTOM= -DCUSTOM
+
+    It is recommended that you build your code from the top level
+    Makefile.  It saves having to sync the other Makefile values.
+    To try and build the new libcustcalc.a that contains u_curds.c:
+
+	(cd ..; make custom/libcustcalc.a)
+
+    Fix any compile and syntax errors as needed.  :-)
+
+    Once libcustcalc.a successfully builds, compile calc:
+
+	cd ..
+	make calc
+
+    And check to be sure that the regression test suite still
+    works without errors:
+
+	make check
+
+
+Step 9: Add the Make dependency tools
+
+    You should probably add the dependency lines to the bottom of
+    the Makefile.  Given the required include files, you will at least
+    have the following entries placed at the bottom of the Makefile:
+
+	u_curds.o: ../alloc.h
+	u_curds.o: ../block.h
+	u_curds.o: ../byteswap.h
+	u_curds.o: ../calcerr.h
+	u_curds.o: ../cmath.h
+	u_curds.o: ../config.h
+	u_curds.o: ../endian_calc.h
+	u_curds.o: ../hash.h
+	u_curds.o: ../have_const.h
+	u_curds.o: ../have_malloc.h
+	u_curds.o: ../have_newstr.h
+	u_curds.o: ../have_stdlib.h
+	u_curds.o: ../have_string.h
+	u_curds.o: ../longbits.h
+	u_curds.o: ../nametype.h
+	u_curds.o: ../qmath.h
+	u_curds.o: ../shs.h
+	u_curds.o: ../value.h
+	u_curds.o: ../zmath.h
+	u_curds.o: u_curds.c
+	u_curds.o: ../custom.h
+
+    If you have the makedepend tool from the X11 development environment
+    (by Todd Brunhoff, Tektronix, Inc. and MIT Project Athena), you can
+    use the following to update your dependencies:
+
+	# cd to the top level calc directory if you are not there already
+
+	rm -f Makefile.bak custom/Makefile.bak
+	make depend
+
+	diff -c Makefile.bak Makefile			# look at the changes
+	diff -c custom/Makefile.bak custom/Makefile	# look at the changes
+
+	rm -f Makefile.bak custom/Makefile.bak		# cleanup
+
+Step 10: Test
+
+    Now that you have built calc with your new custom function, test it:
+
+	./calc -C		# run the new calc with the -C arg
+
+    And then try out our test suite:
+
+	C-style arbitrary precision calculator (version 2.10.3t5.1)
+	[Type "exit" to exit, or "help" for help.]
+
+	> read custom/curds.cal
+	curds(a, b, [c, d, e]) defined
+
+	> custom("curds", 2, 3, 4)
+
+
+Step 11: Install
+
+    Once you are satisfied that everything works, install the new code:
+
+	# cd to the top level calc directory if you are not there already
+
+	make install
+
+    Although calc does not run setuid, you may need to be root to install
+    the directories into which calc installs may be write protected.
+
+
+Step 12: Contribute
+
+    Your custom function may be of interest to some people and/or
+    serve as an example of what one can do with custom functions.
+
+    Read the file:
+
+	help/contrib		(or run:  calc help contrib)
+
+    and consider submitting your custom function for possible
+    inclusion in later versions of calc.
+
+## Copyright (C) 1999  Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: HOW_TO_ADD,v 29.1 1999/12/14 09:15:36 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/custom/RCS/HOW_TO_ADD,v $
+##
+## Under source code control:	1997/03/10 03:03:21
+## File existed as early as:	1997
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/

custom/Makefile

@@ -0,0 +1,695 @@
+#!/bin/make
+#
+# custom - makefile for calc custom routines
+#
+# Copyright (C) 1999  Landon Curt Noll
+#
+# Calc is open software; you can redistribute it and/or modify it under
+# the terms of the version 2.1 of the GNU Lesser General Public License
+# as published by the Free Software Foundation.
+#
+# Calc 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 Lesser General
+# Public License for more details.
+#
+# A copy of version 2.1 of the GNU Lesser General Public License is
+# distributed with calc under the filename COPYING-LGPL.  You should have
+# received a copy with calc; if not, write to Free Software Foundation, Inc.
+# 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+#
+# @(#) $Revision: 29.1 $
+# @(#) $Id: Makefile,v 29.1 1999/12/14 09:15:36 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/custom/RCS/Makefile,v $
+#
+# Under source code control:	1997/03/09 02:28:54
+# File existed as early as:	1997
+#
+# chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+# Share and enjoy!  :-) http://reality.sgi.com/chongo/tech/comp/calc/
+#
+# calculator by David I. Bell with help/mods from others
+# Makefile by Landon Curt Noll
+
+
+##############################################################################
+#-=-=-=-=-=-=-=-=- You may want to change some values below -=-=-=-=-=-=-=-=-#
+##############################################################################
+
+# The custom calc resource files to install
+#
+# Put your custom calc resource files here.
+#
+CUSTOM_CALC_FILES= argv.cal halflen.cal pzasusb8.cal
+
+# The custom help files to install
+#
+# Put your custom help files here.
+#
+CUSTOM_HELP= argv devnull help sysinfo pzasusb8
+
+# Any .h files that are needed by programs that use libcustcalc.a
+#
+# Put any .h files that you add which might be useful to other
+# programs here.
+#
+CUSTOM_H_SRC=
+
+# Any .c files that are needed to build libcustcalc.a.
+# Don't put ${REQUIRED_SRC} files in this list.
+#
+# There MUST be a .c in CUSTOM_SRC for every .o in CUSTOM_OBJ.
+#
+# Put your custom .c files here.
+#
+CUSTOM_SRC= c_argv.c c_devnull.c c_help.c c_sysinfo.c c_pzasusb8.c
+
+# Any .o files that are needed by program that use libcustcalc.a.
+# Don't put ${REQUIRED_OBJ} files in this list.
+#
+# There MUST be a .c in CUSTOM_SRC for every .o in CUSTOM_OBJ.
+#
+# Put your custom .o files here.
+#
+CUSTOM_OBJ= c_argv.o c_devnull.o c_help.o c_sysinfo.o c_pzasusb8.o
+
+##############################################################################
+#-=-=-=-=-=-=- Defaults in case you want to build from this dir -=-=-=-=-=-=-#
+##############################################################################
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# Makefile debug
+#
+# Q=@	do not echo internal makefile actions (quiet mode)
+# Q=	echo internal makefile actions (debug / verbose mode)
+#
+#Q=
+Q=@
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# where to install things
+#
+# ${TOPDIR} is the directory under which the calc directory will be placed.
+# ${LIBDIR} is where the *.cal, *.h, *.a, bindings and help dir are installed.
+# ${HELPDIR} is where the help directory is installed.
+# ${CUSTOMLIBDIR} is where custom lib files are installed.
+# ${CUSTOMHELPDIR} is where custom help files are installed.
+#
+TOPDIR= /usr/local/lib
+#TOPDIR= /usr/lib
+#TOPDIR= /usr/libdata
+#TOPDIR= /usr/contrib/lib
+#
+LIBDIR= ${TOPDIR}/calc
+HELPDIR= ${LIBDIR}/help
+CUSTOMLIBDIR= ${LIBDIR}/custom
+CUSTOMHELPDIR= ${HELPDIR}/custhelp
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# Debug/Optimize options for ${CC}
+#
+DEBUG= -O
+#DEBUG= -O -g
+#DEBUG= -O -g3
+#DEBUG= -O1
+#DEBUG= -O1 -g
+#DEBUG= -O1 -g3
+#DEBUG= -O2
+#DEBUG= -O2 -g
+#DEBUG= -O2 -g3
+#DEBUG= -O2 -ipa
+#DEBUG= -O2 -g3 -ipa
+#DEBUG= -O3
+#DEBUG= -O3 -g
+#DEBUG= -O3 -g3
+#DEBUG= -O3 -ipa
+#DEBUG= -O3 -g3 -ipa
+#DEBUG= -g
+#DEBUG= -g3
+#DEBUG= -gx
+#DEBUG= -WM,-g
+#DEBUG=
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# On systems that have dynamic shared libs, you may want want to disable them
+# for faster calc startup.
+#
+#    System type    NO_SHARED recommendation
+#
+#	BSD	    NO_SHARED=
+#	SYSV	    NO_SHARED= -dn
+#	IRIX	    NO_SHARED= -non_shared
+#	disable	    NO_SHARED=
+#
+# If in doubt, use NO_SHARED=
+#
+NO_SHARED=
+#NO_SHARED= -dn
+#NO_SHARED= -non_shared
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# Some systems require one to use ranlib to add a symbol table to
+# a *.a link library.  Set RANLIB to the utility that performs this action.
+# Set RANLIB to : if your system does not need such a utility.
+#
+#RANLIB=ranlib
+RANLIB=:
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# Normally certain files depend on the Makefile.  If the Makefile is
+# changed, then certain steps should be redone.	 If MAKE_FILE is
+# set to Makefile, then these files will depend on Makefile.  If
+# MAKE_FILE is empty, they they wont.
+#
+# If in doubt, set MAKE_FILE to Makefile
+#
+MAKE_FILE= Makefile
+#MAKE_FILE=
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# If you do not wish to use purify, leave PURIFY commented out.
+#
+# If in doubt, leave PURIFY commented out.
+#
+#PURIFY= purify -logfile=pure.out
+#PURIFY= purify
+
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# By default, custom builtin functions may only be executed if calc
+# is given the -C option.  This is because custom builtin functions
+# may invoke non-standard or non-portable code.	 One may completely
+# disable custom builtin functions by not compiling any of code
+#
+# ALLOW_CUSTOM= -DCUSTOM	# allow custom only if -C is given
+# ALLOW_CUSTOM=			# disable custom even if -C is given
+#
+# If in doubt, use ALLOW_CUSTOM= -DCUSTOM
+#
+ALLOW_CUSTOM= -DCUSTOM
+#ALLOW_CUSTOM=
+
+###
+#
+# Normally, the upper level makefile will set these values.  We provide
+# a default here just in case you want to build from this directory.
+#
+# Select your compiler type by commenting out one of the cc sets below:
+#
+# CCOPT are flags given to ${CC} for optimization
+# CCWARN are flags given to ${CC} for warning message control
+# CCMISC are misc flags given to ${CC}
+#
+# CFLAGS are all flags given to ${CC} [[often includes CCOPT, CCWARN, CCMISC]]
+# ICFLAGS are given to ${CC} for intermediate progs
+#
+# LDFLAGS are flags given to ${CC} for linking .o files
+# ILDFLAGS are flags given to ${CC} for linking .o files for intermediate progs
+#
+# CC is how the the C compiler is invoked
+#
+###
+#
+# common cc set
+#
+CCWARN=
+CCOPT= ${DEBUG} ${NO_SHARED}
+CCMISC=
+#
+CFLAGS= ${CCWARN} ${CCOPT} ${CCMISC} ${ALLOW_CUSTOM}
+ICFLAGS= ${CCWARN} ${CCMISC}
+#
+LDFLAGS= ${NO_SHARED} ${LD_NO_SHARED}
+ILDFLAGS=
+#
+CC= ${PURIFY} cc
+
+##############################################################################
+#-=-=-=-=-=-=-=-=- Be careful if you change something below -=-=-=-=-=-=-=-=-#
+##############################################################################
+
+# These .c files are required for the main custom interface and
+# for the custom support functions.
+#
+# There MUST be a .c for every .o in REQUIRED_OBJ.
+#
+REQUIRED_SRC= custtbl.c
+
+# These .o files correspond to the .c files in REQUIRED_SRC
+#
+# There MUST be a .o for every .c in REQUIRED_SRC.
+#
+REQUIRED_OBJ= custtbl.o
+
+# These .h files are installed under ${CUSTOMLIBDIR} by the install rule.
+#
+INSTALL_H_SRC= ${CUSTOM_H_SRC}
+
+# These .c files are used to form libcustcalc.a.
+#
+CUSTCALC_SRC= ${REQUIRED_SRC} ${CUSTOM_SRC}
+
+# These .o files are used to form libcustcalc.a.
+#
+CUSTCALC_OBJ= ${REQUIRED_OBJ} ${CUSTOM_OBJ}
+
+# These .c files are used to build the dependency list
+#
+C_SRC= ${REQUIRED_SRC} ${CUSTOM_SRC}
+
+# These .h files are used to build the dependecy list
+#
+H_SRC= ${CUSTOM_H_SRC}
+
+# These files are found (but not built) in the distribution
+#
+# The CUSTOM_CAL and HOW_TO_ADD are files distributed from this
+# directory but are installed as help files from the help/Makefile.
+#
+DISTLIST= ${CUSTCALC_SRC} ${CUSTOM_CALC_FILES} ${CUSTOM_HELP} \
+	${INSTALL_H_SRC} CUSTOM_CAL HOW_TO_ADD ${MAKE_FILE}
+
+# These files are used to make (but not built) a calc .a link library
+#
+CALCLIBLIST= ${CUSTCALC_SRC} ${INSTALL_H_SRC} ${MAKE_FILE} HOW_TO_ADD
+
+# complete list of targets
+#
+TARGETS= libcustcalc.a ${CUSTCALC_OBJ}
+
+# required vars
+#
+SHELL= /bin/sh
+MAKE_FILE= Makefile
+
+# standard tools
+#
+SED= sed
+MAKEDEPEND= makedepend
+CHMOD= chmod
+SORT= sort
+
+##
+#
+# Standard rules and targets
+#
+##
+
+all: ${TARGETS} ${INSTALL_H_SRC} ${CUSTOM_CALC_FILES} \
+	${CUSTOM_HELP} ${MAKE_FILE} .all
+
+libcustcalc.a: ${CUSTCALC_OBJ} ${MAKE_FILE} ../Makefile
+	-rm -f libcustcalc.a
+	ar qc libcustcalc.a ${CUSTCALC_OBJ}
+	${RANLIB} libcustcalc.a
+
+##
+#
+# Special .o files
+#
+##
+
+c_sysinfo.o: c_sysinfo.c ${MAKE_FILE}
+	${CC} ${CFLAGS} c_sysinfo.c -c
+
+##
+#
+# used by the upper level Makefile
+#
+##
+
+# to determine of we have done all
+#
+.all:
+	rm -f .all
+	touch .all
+
+##
+#
+# File list generation.	 You can ignore this section.
+#
+#
+# We will form the names of source files as if they were in a
+# sub-directory called calc/lib.
+#
+# NOTE: Due to bogus shells found on one common system we must have
+#	an non-emoty else clause for every if condition.  *sigh*
+#
+##
+
+distlist: ${DISTLIST}
+	${Q}for i in ${DISTLIST}; do \
+		echo custom/$$i; \
+	done
+
+distdir:
+	${Q}echo custom
+
+calcliblist: ${CALCLIBLIST}
+	${Q}for i in ${CALCLIBLIST} /dev/null; do \
+	    if [ X"$$i" != X"/dev/null" ]; then \
+		echo custom/$$i; \
+	    fi; \
+	done
+
+##
+#
+# Home grown make dependency rules.  Your system make not support
+# or have the needed tools.  You can ignore this section.
+#
+# We will form a skelaton tree of *.c files containing only #include "foo.h"
+# lines and .h files containing the same lines surrounded by multiple include
+# prevention lines.  This allows us to build a static depend list that will
+# satisfy all possible cpp symbol definition combinations.
+#
+##
+
+depend:
+	${Q}if [ -f Makefile.bak ]; then \
+		echo "Makefile.bak exists, remove or move it out of the way"; \
+		exit 1; \
+	else \
+	    true; \
+	fi
+	${Q}echo forming custom/skel
+	-${Q}rm -rf skel
+	${Q}mkdir skel
+	${Q}mkdir skel/custom
+	-${Q}for i in ${C_SRC}; do \
+		${SED} -n '/^#[	 ]*include[	 ]*"/p' \
+		    "$$i" > "skel/custom/$$i"; \
+	done
+	-${Q}for i in /dev/null ${H_SRC}; do \
+		if [ "$$i" = "/dev/null" ]; then \
+		    continue; \
+		fi; \
+		tag="`echo $$i | ${SED} 's/[\.+,:]/_/g'`"; \
+		echo "#if !defined($$tag)" > "skel/custom/$$i"; \
+		echo "#define $$tag" >> "skel/custom/$$i"; \
+		${SED} -n '/^#[	 ]*include[	 ]*"/p' "$$i" \
+		    >> "skel/custom/$$i"; \
+		echo '#endif /* '"$$tag"' */' >> "skel/custom/$$i"; \
+	done
+	${Q}(cd ..; ${MAKE} hsrc)
+	${Q}for i in `cd ..; ${MAKE} h_list`; do \
+		tag="`echo $$i | ${SED} 's/[\.+,:]/_/g'`"; \
+		echo "#if !defined($$tag)" > "skel/$$i"; \
+		echo "#define $$tag" >> "skel/$$i"; \
+		${SED} -n '/^#[	 ]*include[	 ]*"/p' "../$$i" \
+		    >> "skel/$$i"; \
+		echo '#endif /* '"$$tag"' */' >> "skel/$$i"; \
+	done
+	-${Q}rm -f skel/custom/makedep.out
+	${Q}echo custom/skel formed
+	${Q}echo forming custom dependency list
+	${Q}echo "# DO NOT DELETE THIS LINE -- make depend depends on it." > \
+	    skel/custom/makedep.out
+	${Q}cd skel/custom; ${MAKEDEPEND} -w 1 -m -f makedep.out ${C_SRC}
+	-${Q}for i in ${C_SRC}; do \
+		echo "$$i" | ${SED} 's/^\(.*\)\.c/\1.o: \1.c/'; \
+	done >> skel/custom/makedep.out
+	${Q}echo custom dependency list formed
+	${Q}echo forming new custom/Makefile
+	-${Q}rm -f Makefile.bak
+	${Q}mv Makefile Makefile.bak
+	${Q}${SED} -n '1,/^# DO NOT DELETE THIS LINE/p' Makefile.bak > Makefile
+	${Q}echo "" >> Makefile
+	${Q}${SED} -n '3,$$p' skel/custom/makedep.out | ${SORT} -u >> Makefile
+	-${Q}rm -rf skel
+	-${Q}if cmp -s Makefile.bak Makefile; then \
+		echo 'custom Makefile was already up to date'; \
+		mv -f Makefile.bak Makefile; \
+	else \
+		rm -f Makefile.tmp; \
+		mv Makefile Makefile.tmp; \
+		if [ -d RCS ]; then \
+		    co -l Makefile; \
+		fi ;\
+		mv Makefile.tmp Makefile; \
+		if [ -d RCS ]; then \
+		echo 'new custom Makefile formed -- you need to check it in'; \
+		fi; \
+	fi
+
+##
+#
+# Utility rules
+#
+##
+
+clean:
+	-rm -f ${CUSTCALC_OBJ}
+
+clobber:
+	-rm -f ${TARGETS}
+	rm -f .all Makefile.tmp
+
+install: all
+	-${Q}if [ ! -d ${TOPDIR} ]; then \
+		echo mkdir ${TOPDIR}; \
+		mkdir ${TOPDIR}; \
+	else \
+	    true; \
+	fi
+	-${Q}if [ ! -d ${LIBDIR} ]; then \
+		echo mkdir ${LIBDIR}; \
+		mkdir ${LIBDIR}; \
+	else \
+	    true; \
+	fi
+	-${Q}if [ ! -d ${HELPDIR} ]; then \
+		echo mkdir ${HELPDIR}; \
+		mkdir ${HELPDIR}; \
+	else \
+	    true; \
+	fi
+	-${Q}if [ ! -d ${CUSTOMLIBDIR} ]; then \
+		echo mkdir ${CUSTOMLIBDIR}; \
+		mkdir ${CUSTOMLIBDIR}; \
+	else \
+	    true; \
+	fi
+	-${Q}if [ ! -d ${CUSTOMHELPDIR} ]; then \
+		echo mkdir ${CUSTOMHELPDIR}; \
+		mkdir ${CUSTOMHELPDIR}; \
+	else \
+	    true; \
+	fi
+	${Q}for i in ${INSTALL_H_SRC} /dev/null; do \
+		if [ X$$i = X/dev/null ]; then continue; fi; \
+		echo rm -f ${CUSTOMLIBDIR}/$$i; \
+		rm -f ${CUSTOMLIBDIR}/$$i; \
+		echo cp $$i ${CUSTOMLIBDIR}; \
+		cp $$i ${CUSTOMLIBDIR}; \
+		echo ${CHMOD} 0444 ${CUSTOMLIBDIR}/$$i; \
+		${CHMOD} 0444 ${CUSTOMLIBDIR}/$$i; \
+	done
+	${Q}for i in ${CUSTOM_CALC_FILES}; do \
+		echo rm -f ${CUSTOMLIBDIR}/$$i; \
+		rm -f ${CUSTOMLIBDIR}/$$i; \
+		echo cp $$i ${CUSTOMLIBDIR}; \
+		cp $$i ${CUSTOMLIBDIR}; \
+		echo ${CHMOD} 0444 ${CUSTOMLIBDIR}/$$i; \
+		${CHMOD} 0444 ${CUSTOMLIBDIR}/$$i; \
+	done
+	${Q}for i in ${CUSTOM_HELP}; do \
+		echo rm -f ${CUSTOMHELPDIR}/$$i; \
+		rm -f ${CUSTOMHELPDIR}/$$i; \
+		echo cp $$i ${CUSTOMHELPDIR}; \
+		cp $$i ${CUSTOMHELPDIR}; \
+		echo ${CHMOD} 0444 ${CUSTOMHELPDIR}/$$i; \
+		${CHMOD} 0444 ${CUSTOMHELPDIR}/$$i; \
+	done
+	-${Q}if [ ! -z ${ALLOW_CUSTOM} ]; then \
+		echo "rm -f ${CUSTOMLIBDIR}/libcustcalc.a"; \
+		rm -f ${CUSTOMLIBDIR}/libcustcalc.a; \
+		echo "cp libcustcalc.a ${CUSTOMLIBDIR}/libcustcalc.a"; \
+		cp libcustcalc.a ${CUSTOMLIBDIR}/libcustcalc.a; \
+		echo "${CHMOD} 0644 ${CUSTOMLIBDIR}/libcustcalc.a"; \
+		${CHMOD} 0644 ${CUSTOMLIBDIR}/libcustcalc.a; \
+		echo "${RANLIB} ${CUSTOMLIBDIR}/libcustcalc.a"; \
+		${RANLIB} ${CUSTOMLIBDIR}/libcustcalc.a; \
+	fi
+
+##
+#
+# make depend stuff
+#
+##
+
+# DO NOT DELETE THIS LINE
+
+c_argv.o: ../alloc.h
+c_argv.o: ../block.h
+c_argv.o: ../byteswap.h
+c_argv.o: ../calc.h
+c_argv.o: ../calcerr.h
+c_argv.o: ../cmath.h
+c_argv.o: ../config.h
+c_argv.o: ../custom.h
+c_argv.o: ../endian_calc.h
+c_argv.o: ../hash.h
+c_argv.o: ../have_const.h
+c_argv.o: ../have_malloc.h
+c_argv.o: ../have_memmv.h
+c_argv.o: ../have_newstr.h
+c_argv.o: ../have_stdlib.h
+c_argv.o: ../have_string.h
+c_argv.o: ../longbits.h
+c_argv.o: ../md5.h
+c_argv.o: ../nametype.h
+c_argv.o: ../qmath.h
+c_argv.o: ../shs.h
+c_argv.o: ../shs1.h
+c_argv.o: ../string.h
+c_argv.o: ../value.h
+c_argv.o: ../zmath.h
+c_argv.o: c_argv.c
+c_devnull.o: ../alloc.h
+c_devnull.o: ../block.h
+c_devnull.o: ../byteswap.h
+c_devnull.o: ../calcerr.h
+c_devnull.o: ../cmath.h
+c_devnull.o: ../config.h
+c_devnull.o: ../custom.h
+c_devnull.o: ../endian_calc.h
+c_devnull.o: ../hash.h
+c_devnull.o: ../have_const.h
+c_devnull.o: ../have_malloc.h
+c_devnull.o: ../have_memmv.h
+c_devnull.o: ../have_newstr.h
+c_devnull.o: ../have_stdlib.h
+c_devnull.o: ../have_string.h
+c_devnull.o: ../longbits.h
+c_devnull.o: ../md5.h
+c_devnull.o: ../nametype.h
+c_devnull.o: ../qmath.h
+c_devnull.o: ../shs.h
+c_devnull.o: ../shs1.h
+c_devnull.o: ../string.h
+c_devnull.o: ../value.h
+c_devnull.o: ../zmath.h
+c_devnull.o: c_devnull.c
+c_help.o: ../alloc.h
+c_help.o: ../block.h
+c_help.o: ../byteswap.h
+c_help.o: ../calcerr.h
+c_help.o: ../cmath.h
+c_help.o: ../config.h
+c_help.o: ../custom.h
+c_help.o: ../endian_calc.h
+c_help.o: ../hash.h
+c_help.o: ../have_const.h
+c_help.o: ../have_malloc.h
+c_help.o: ../have_memmv.h
+c_help.o: ../have_newstr.h
+c_help.o: ../have_stdlib.h
+c_help.o: ../have_string.h
+c_help.o: ../longbits.h
+c_help.o: ../md5.h
+c_help.o: ../nametype.h
+c_help.o: ../qmath.h
+c_help.o: ../shs.h
+c_help.o: ../shs1.h
+c_help.o: ../string.h
+c_help.o: ../value.h
+c_help.o: ../zmath.h
+c_help.o: c_help.c
+c_pzasusb8.o: ../alloc.h
+c_pzasusb8.o: ../block.h
+c_pzasusb8.o: ../byteswap.h
+c_pzasusb8.o: ../calcerr.h
+c_pzasusb8.o: ../cmath.h
+c_pzasusb8.o: ../config.h
+c_pzasusb8.o: ../custom.h
+c_pzasusb8.o: ../endian_calc.h
+c_pzasusb8.o: ../hash.h
+c_pzasusb8.o: ../have_const.h
+c_pzasusb8.o: ../have_malloc.h
+c_pzasusb8.o: ../have_memmv.h
+c_pzasusb8.o: ../have_newstr.h
+c_pzasusb8.o: ../have_stdlib.h
+c_pzasusb8.o: ../have_string.h
+c_pzasusb8.o: ../longbits.h
+c_pzasusb8.o: ../md5.h
+c_pzasusb8.o: ../nametype.h
+c_pzasusb8.o: ../qmath.h
+c_pzasusb8.o: ../shs.h
+c_pzasusb8.o: ../shs1.h
+c_pzasusb8.o: ../string.h
+c_pzasusb8.o: ../value.h
+c_pzasusb8.o: ../zmath.h
+c_pzasusb8.o: c_pzasusb8.c
+c_sysinfo.o: ../alloc.h
+c_sysinfo.o: ../block.h
+c_sysinfo.o: ../byteswap.h
+c_sysinfo.o: ../calc.h
+c_sysinfo.o: ../calcerr.h
+c_sysinfo.o: ../cmath.h
+c_sysinfo.o: ../conf.h
+c_sysinfo.o: ../config.h
+c_sysinfo.o: ../custom.h
+c_sysinfo.o: ../endian_calc.h
+c_sysinfo.o: ../fposval.h
+c_sysinfo.o: ../hash.h
+c_sysinfo.o: ../have_const.h
+c_sysinfo.o: ../have_malloc.h
+c_sysinfo.o: ../have_memmv.h
+c_sysinfo.o: ../have_newstr.h
+c_sysinfo.o: ../have_stdlib.h
+c_sysinfo.o: ../have_string.h
+c_sysinfo.o: ../hist.h
+c_sysinfo.o: ../longbits.h
+c_sysinfo.o: ../longlong.h
+c_sysinfo.o: ../md5.h
+c_sysinfo.o: ../nametype.h
+c_sysinfo.o: ../prime.h
+c_sysinfo.o: ../qmath.h
+c_sysinfo.o: ../shs.h
+c_sysinfo.o: ../shs1.h
+c_sysinfo.o: ../string.h
+c_sysinfo.o: ../value.h
+c_sysinfo.o: ../zmath.h
+c_sysinfo.o: ../zrand.h
+c_sysinfo.o: ../zrandom.h
+c_sysinfo.o: c_sysinfo.c
+custtbl.o: ../alloc.h
+custtbl.o: ../block.h
+custtbl.o: ../byteswap.h
+custtbl.o: ../calcerr.h
+custtbl.o: ../cmath.h
+custtbl.o: ../config.h
+custtbl.o: ../custom.h
+custtbl.o: ../endian_calc.h
+custtbl.o: ../hash.h
+custtbl.o: ../have_const.h
+custtbl.o: ../have_malloc.h
+custtbl.o: ../have_memmv.h
+custtbl.o: ../have_newstr.h
+custtbl.o: ../have_stdlib.h
+custtbl.o: ../have_string.h
+custtbl.o: ../longbits.h
+custtbl.o: ../md5.h
+custtbl.o: ../nametype.h
+custtbl.o: ../qmath.h
+custtbl.o: ../shs.h
+custtbl.o: ../shs1.h
+custtbl.o: ../string.h
+custtbl.o: ../value.h
+custtbl.o: ../zmath.h
+custtbl.o: custtbl.c

custom/argv

@@ -0,0 +1,67 @@
+NAME
+    argv - displays information about its args
+
+SYNOPSIS
+    custom("argv" [, arg ...])
+
+TYPES
+    arg		any
+
+    return	int
+
+DESCRIPTION
+    This custom function will, for each arg given print:
+
+	arg number
+	arg type
+	number of elements (size())
+	memory size (sizeof())
+
+    The number of args passed, not counting the initial "argv" name
+    arg is returned.
+
+EXAMPLE
+    > foo=5^713; bar=17; baz=list(2,3,4);
+    > custom("argv", foo, bar, baz, 3+4.5i, pi())
+	    arg[0]  rational_value	    size=1  sizeof=272
+	    arg[1]  rational_value	    size=1  sizeof=68
+	    arg[2]  list		    size=3  sizeof=256
+	    arg[3]  complex_value	    size=1  sizeof=140
+	    arg[4]  rational_value	    size=1  sizeof=84
+	    5
+
+LIMITS
+    calc must be built with ALLOW_CUSTOM= -DCUSTOM
+    calc must be executed with a -C arg.
+
+LIBRARY
+    none
+
+SEE ALSO
+    custom
+
+## Copyright (C) 1999  Landon Curt Noll
+##
+## Calc is open software; you can redistribute it and/or modify it under
+## the terms of the version 2.1 of the GNU Lesser General Public License
+## as published by the Free Software Foundation.
+##
+## Calc 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 Lesser General
+## Public License for more details.
+##
+## A copy of version 2.1 of the GNU Lesser General Public License is
+## distributed with calc under the filename COPYING-LGPL.  You should have
+## received a copy with calc; if not, write to Free Software Foundation, Inc.
+## 59 Temple Place, Suite 330, Boston, MA  02111-1307, USA.
+##
+## @(#) $Revision: 29.1 $
+## @(#) $Id: argv,v 29.1 1999/12/14 09:15:36 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/custom/RCS/argv,v $
+##
+## Under source code control:	1997/03/09 20:28:01
+## File existed as early as:	1997
+##
+## chongo <was here> /\oo/\	http://reality.sgi.com/chongo/
+## Share and enjoy!  :-)	http://reality.sgi.com/chongo/tech/comp/calc/