Release calc version 2.12.0.3

BUGS

@@ -20,34 +20,38 @@ configuration, try backing them out and see if things get better.
 
 To be sure that your version of calc is up to date, check out:
 
-	http://reality.sgi.com/chongo/calc/calc-download.html
+	http://www.isthe.com/chongo/tech/comp/calc/calc-download.html
 
 The calc web site is located at:
 
-	http://reality.sgi.com/chongo/calc
+	http://www.isthe.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:
+then it may be time to send in a bug report.  You can send bug
+and bug fixes reports to:
 
-    calc-tester@postofc.corp.sgi.com
+    calc-bugs at asthe dot com
+
+    [[ NOTE: Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+    [[ NOTE: The EMail address uses 'asthe', the web site URL uses 'isthe' ]]
+
+Your subject must contain the words:
+
+       calc bug report
+
+You may have additional words in your subject line.
 
 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)
-
+      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 erros that you saw
-
+    * 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)
@@ -57,35 +61,141 @@ When you send your report, please include the following information:
 
 Stack traces from core dumps are useful to send as well.
 
-=-=
-
-Send any comments, compiler warning messages, suggestions and most
-importantly, fixes (in the form of a context diff patch) to:
-
-    calc-tester@postofc.corp.sgi.com
+Fell free to use the above address to send in big fixes (in the form
+of a context diff patch).
 
 =-=
 
-Known problems or mis-features:
+Known bugs:
 
-    * Many of and SEE ALSO sections of help files
-      for builtins are either inconsistent or missing information.
+    The stoponerror() facility does not seem to work, or perhaps
+    the stoponerror help file is incorrect.  The stoponerror help file
+    lacks examples because of this problem.
 
-    * Many of the LIBRARY sections are incorrect now that libcalc.a
-      contains most of the calc system.
+    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.
 
-    * 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.
+=-=
 
-    * On a Dec Alpha, using the Dec Alpha cc (not gcc) make check for
-      version 2.11.0t5.1 fails in the regression test:
+mis-features in calc:
 
-	From vandermj@molbio.sbphrd.com  Tue Oct  5 04:06:52 1999
-	Subject: Re: oops, try calc version 2.10.0t5.1
-	Date: Tue, 05 Oct 1999 07:06:30 -0400
+    Some problems are not bugs but rarther mis-features / things that could
+    work better.  The following is a list of mis-features that should be
+    addressed and improved someday.
 
-	Regular cc on Dec alpha, 'make check' dies with:
+    * The chi.cal resource file does not work well with odd degrees
+      of freedom.  Can someone improve this algorithm?
 
-	1804: surd_value(a) == 2+3i
-	"": line 1706: Calling qfreenum with nozero links!!!
+    * The intfile.cal resource file reads and writes big or little Endian
+      integers to/from files the hard way.  It does NOT use blkcpy.  The
+      following code:
+
+	i = (ord("\n") << 16) | (ord("i") << 8) | ord("H")
+	b = blk()
+	copy(i, b)
+	fd = fopen("file", "w")
+	copy(b, fd);
+	fclose(fd)
+
+      will write an extra NUL octet to the file.  Where as:
+
+	read intfile
+	i = (ord("\n") << 16) | (ord("i") << 8) | ord("H")
+	be2file(i, "file2")
+
+      will not.
+
+=-=
+
+Problems with old systems that have known work-a-rounds:
+
+    * 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.
+
+      This bug has been observed on the Sparc and the PowerPC machine.
+
+      On the PowerPC with gcc-2.95 when compiled with -O2, the following
+      patch seems to help:
+
+*** zfunc.c.orig        Fri Feb 23 18:18:39 2001
+--- zfunc.c     Fri Feb 23 18:39:33 2001
+***************
+*** 1481,1487 ****
+  {
+        HALF *a, *A, *b, *a0, u;
+        int i, j, j1, j2, k, k1, m, m0, m1, n, n0, o;
+!       FULL d, e, f, g, h, s, t, x, topbit;
+        int remsign;
+        BOOL up, onebit;
+        ZVALUE sqrt;
+--- 1481,1488 ----
+  {
+        HALF *a, *A, *b, *a0, u;
+        int i, j, j1, j2, k, k1, m, m0, m1, n, n0, o;
+!       volatile FULL d;
+!       FULL e, f, g, h, s, t, x, topbit;
+        int remsign;
+        BOOL up, onebit;
+        ZVALUE sqrt;
+*** zmath.c	2000/06/07 14:02:13	29.2
+--- zmath.c	2001/03/13 19:47:03
+***************
+*** 1608,1614 ****
+  void
+  zbitvalue(long n, ZVALUE *res)
+  {
+! 	ZVALUE z;
+
+  	if (n < 0) n = 0;
+  	z.sign = 0;
+--- 1608,1614 ----
+  void
+  zbitvalue(long n, ZVALUE *res)
+  {
+! 	volatile ZVALUE z;
+
+  	if (n < 0) n = 0;
+  	z.sign = 0;
+
+    * 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"
+
+## Copyright (C) 1999-2006  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.24 $
+## @(#) $Id: BUGS,v 29.24 2006/05/21 07:54:13 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://www.isthe.com/chongo/
+## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/

COPYING

@@ -0,0 +1,227 @@
+		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.8 $
+    # @(#) $Id: COPYING,v 29.8 2006/05/01 19:16:57 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://www.isthe.com/chongo/tech/comp/calc/email.html
+
+    To join the low volume calc mailing list.  Send a EMail message to:
+
+	calc-tester-request at asthe dot com
+
+    Your subject must contain the words:
+
+	calc mailing list subscription
+
+    You may have additional words in your subject line.
+
+    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.
+
+    Feel free to follow the name line with additional EMail text as desired.
+
+=-=
+
+    Calc bug reports and calc bug fixes should be sent to:
+
+	calc-bugs at asthe dot com
+
+    [[ NOTE: Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+    [[ NOTE: The EMail address uses 'asthe' and the web site URL uses 'isthe' ]]
+
+    Your subject must contain the words:
+
+	   calc bug report
+
+    You may have additional words in your subject line.
+
+=-=
+
+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 GNU Lesser General Public License 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
+	Copyright (C) year  Petteri Kettunen and Landon Curt Noll
+
+    These files are not covered under one of the Copyrights listed above:
+
+	    shs1.c	    shs1.h	 shs.c		shs.h
+	    md5.c	    md5.h	 COPYING	COPYING-LGPL
+	    cal/qtime.cal   cal/screen.cal
+
+    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.
+
+    Some of these exception files are in the public domain.  Other
+    exception files have non-LGPL Copyrights.  Other files are under a
+    LGPL Copyright but have different authors.
+
+    In all cases one may use and distribute these exception files freely.
+    And because one may freely distribute the LGPL covered files, the
+    entire calc source may be freely used and distributed.
+
+=-=
+
+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

@@ -1,39 +1,130 @@
-Installing calc in 4 easy steps:
+Installing calc from the gziped tarball in 4 easy steps:
 
-    1) Look at the makefile, and adjust it to suit your needs.
+    0)  If your platform supports i686 RPMs, you may want to go to:
 
-       Here are some Makefile hints:
+	    http://www.isthe.com/chongo/src/calc/
 
-	   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.
+	and use these RPMs:
 
-	   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.
+	    * calc*.i686.rpm
+		- all that is needed if you just want to use calc
 
-	   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.
+	    * calc-devel-*.i686.rpm
+	        - calc *.h header and *.a lib files for use in other programs
 
-	   The CALCBINDINGS is matter of personal taste.  As shipped
-	   the Makefile assumes a default quasi-emacs-like command
-	   line editor.  Changing CALCBINDINGS= altbind will cause ^D
-	   to end calc in a fashion similar to that of the bc(1) command.
+	    * calc.*.src.rpm
+	        - calc source in RPM package form
 
-	   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.
+	The following 4 steps apply to calc source tree that comes from either:
 
-	   Set BINDIR to the place where calc is installed.  As shipped
-	   the Makefile assumes a BINDIR /usr/local/bin.
+		gunzip -c calc-*.tar.gz | tar -xvf -
+
+	or from:
+
+		rpm -ivh calc-*.src.rpm
+		cd /var/tmp
+		gunzip -c /usr/src/redhat/SOURCES/calc-*.tar.gz | tar -xvf -
+
+    1)	Look at the makefile, and adjust it to suit your needs.
+
+	The Makefile, as shipped, is suitable for installation under
+	Linux and Un*x-like environments.  For the most part, the default
+	values should work.  If in doubt, follow the 'When in doubt'
+	suggestion.
+
+	!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
+	! If you are building under Windoz or a Windoz-like environment !
+	! (such as Cygwin or DJGPP), read the README.WINDOWS file.      !
+	!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
+
+	You should determine if these Makefile variables are reasonable:
+
+	    INCDIR		Where the system include (.h) files are kept.
+	    BINDIR		Where to install calc binary files.
+	    LIBDIR		Where to install calc link library (*.a) files.
+	    CALC_SHAREDIR	Where to install calc help, .cal, startup, and
+	    			config files.
+
+	You may want to change the default installation locations for
+	these values, which are based on the 4 values listed above:
+
+	    HELPDIR            where the help directory is installed
+	    CALC_INCDIR        where the calc include files are installed
+	    CUSTOMCALDIR       where custom *.cal files are installed
+	    CUSTOMHELPDIR      where custom help files are installed
+	    CUSTOMINCPDIR      where custom .h files are installed
+	    SCRIPTDIR          where calc shell scripts are installed
+
+	If you want to install calc files under a top level directory,
+	then set the T value:
+
+	    The calc install is performed under $T, the calc build is
+	    performed under /.	The purpose for $T is to allow someone
+	    to install calc somewhere other than into the system area.
+
+	    For example, if:
+
+	    	BINDIR= /usr/bin
+		LIBDIR= /usr/lib
+		CALC_SHAREDIR= /usr/share/calc
+
+	    and if:
+
+	    	T= /var/tmp/testing
+
+	    Then the installation locations will be:
+
+		calc binary files:	/var/tmp/testing/usr/bin
+		calc link library:	/var/tmp/testing/usr/lib
+		calc help, .cal ...:	/var/tmp/testing/usr/share/calc
+		... etc ...		/var/tmp/testing/...
+
+	    If $T is empty, calc is installed under /, which is the same
+	    top of tree for which it was built.  If $T is non-empty, then
+	    calc is installed under $T, as if one had to chroot under
+	    $T for calc to operate.
+
+	Look for the section that starts:
+
+	    ################
+	    # compiler set #
+	    ################
+
+	    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 want to change these Makrfile variables from their defaults:
+
+	    RANLIB
+
+		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.
+
+	    CALCPAGER
+
+		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.
+
+	    DEBUG
+
+	       Some compilers (to put it mildly) have bugs.  Sometimes the
+	       DEBUG Makefile variable causes the compiler / optimizer to
+	       produce bad code.  Other compilers do just fine.
+
+	       If possible try to use DEBUG=-O3 -g3 (maximum optimization
+	       and debug symbols).  If the calc test fails (see step 3),
+	       try lowering either the -O value and/or the -g3.  Also try
+	       using -Osomething without -g.
 
 	   Adjust other Makefile variables as needed.
 
-    2) build calc:
+    2)	build calc:
 
 	make all
 
@@ -41,12 +132,42 @@ Installing calc in 4 easy steps:
 	    you may find.  See the BUGS file if you find any compiler
 	    warning or errors.
 
-    3) test calc:
+    3)	test calc:
 
 	make check
 
-	==> If you run into problems, follow the BUGS file instructions.
+	==> If you run into problems, read the BUGS file and follow
+	    the instructions found in there.
 
-    4) install calc:
+    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.7 $
+## @(#) $Id: HOWTO.INSTALL,v 29.7 2003/04/15 03:38:34 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://www.isthe.com/chongo/
+## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/

LIBRARY

@@ -1,11 +1,11 @@
 	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.
@@ -43,24 +43,41 @@ 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}.
+When calc is installed, all of libraries are installed into ${LIBDIR}.
+All of the calc header files are installed under ${INCDIRCALC}.
+
+If CALC_SRC is defined, then the calc header files will assume that
+they are in or under the current directory.  However, most external
+programs most likely will not be located under calc'c source tree.
+External programs most likely want to use the installed calc header
+files under ${INCDIRCALC}.  External programs most likely NOT want
+to define CALC_SRC.
 
 External programs may want to compile with:
 
-	-I${LIBDIR} -L${LIBDIR} -lcalc
+	-L${LIBDIR} -lcalc
+
+If custom functions are also used, they may want to compile with:
+
+	-L${LIBDIR} -lcalc -lcustcalc
+
+The CALC_SRC symbol should NOT be defined by default.  However if you are
+feeling pedantic you may want to force CALC_SRC to be undefined:
+
+	-UCALC_SRC
+
+as well.
 
 --------------
 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
@@ -77,9 +94,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:
@@ -117,7 +134,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.
@@ -142,7 +159,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.
 
@@ -154,7 +171,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.
@@ -248,7 +265,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
@@ -267,7 +284,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
@@ -283,7 +300,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:
 
@@ -294,7 +311,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
@@ -328,13 +345,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;
 
@@ -363,7 +380,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:
 
@@ -377,7 +394,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.
 
@@ -410,7 +427,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:
 
@@ -423,7 +440,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)
@@ -441,8 +458,8 @@ 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.
 
 ----------------
@@ -455,3 +472,29 @@ 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.5 $
+## @(#) $Id: LIBRARY,v 29.5 2001/06/08 22:57:35 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://www.isthe.com/chongo/
+## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/

README

@@ -4,7 +4,7 @@ See the HOWTO.INSTALL file for information on how to build and install calc.
 
 To be sure that your version of calc is up to date, check out:
 
-	http://reality.sgi.com/chongo/calc/calc-download.html
+	http://www.isthe.com/chongo/tech/comp/calc/calc-download.html
 
 We are interested in any/all feedback on recent versions of calc.
 In particular we would like to hear about:
@@ -24,21 +24,67 @@ If you run into problems, see the BUGS file.
 
 =-=
 
+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.
+
+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
+    help/wishlist
 
 or run:
 
-    calc 'help todo'
+    calc help todo
+    calc help wishlist
 
 for a wish/todo list.  Code contributions are welcome.
 
 =-=
 
-To join the calc-tester mailing list.  Send a request to:
+To join the calc-tester mailing list.  Send an EMail message to:
 
-     calc-tester-request@postofc.corp.sgi.com
+    calc-tester-request at asthe dot com
+
+    [[ NOTE: Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+    [[ NOTE: The EMail address uses 'asthe' and the web site URL uses 'isthe' ]]
+
+Your subject must contain the words:
+
+    calc mailing list subscription
+
+You may have additional words in your subject line.
 
 Your message body (not the subject) should consist of:
 
@@ -49,6 +95,51 @@ Your message body (not the subject) should consist of:
 where ``address'' is your EMail address and ``your_full_name'' is
 your full name.
 
+Feel free to follow the name line with additional EMail text as desired.
+
+=-=
+
+Send Calc bug and bug fixes to:
+
+    calc-bugs at asthe dot com
+
+    [[ NOTE: Replace 'at' with @, 'dot' is with . and remove the spaces ]]
+    [[ NOTE: The EMail address uses 'asthe' and the web site URL uses 'isthe' ]]
+
+but see the BUGS file first.
+
+Your subject must contain the words:
+
+       calc bug report
+
+You may have additional words in your subject line.
+
 The calc web site is located at:
 
-	http://reality.sgi.com/chongo/calc
+	http://www.isthe.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.3 $
+## @(#) $Id: README,v 29.3 2001/06/01 11:26:53 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://www.isthe.com/chongo/
+## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/

README.OLD

@@ -1,73 +0,0 @@
-# Copyright (c) 1997 David I. Bell
-# Permission is granted to use, distribute, or modify this source,
-# provided that this copyright notice remains intact.
-#
-# Arbitrary precision calculator.
-
-  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-    NOTE: This is an old historic README.  We recommend that
-	  you read README and HOWTO.INSTALL for more info.
-  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-
-I am allowing this calculator to be freely distributed for your enjoyment.
-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.
-
--dbell-
-
-p.s. By Landon Curt Noll:
-
-Building calc in 3 easy steps:
-
-    1) Look at the makefile, and adjust it to suit your needs.
-
-       Here are some Makefile hints:
-
-	   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<<<==
-
-=-=
-
-For further reading:
-
-    LIBRARY
-    	explains how programs can use libcalc.a to take advantage
-	of the calc multi-precision routines.
-
-    help/todo
-	current wish list for calc
-
-    CHANGES
-	recent changes to calc
-
-    BUGS
-	known bugs, mis-features and how to report problems
-
-    help/full
-	full set of calc documentation
-
-=-=
-
-David I. Bell    dbell@auug.org.au
-chongo <Landon Curt Noll> /\../\

README.WINDOWS

@@ -0,0 +1,169 @@
+Dear calc user on a Windoz based system,
+
+See the HOWTO.INSTALL file for information on how to build and install calc.
+See also the README file.
+
+NOTE: The main developers do not have access to a Windoz based platform.
+      While we will make an effort to not break calc Windoz based system,
+      our lack of a Windoz test environment will mean we will make mistakes
+      from time to time.  Hopefully Windowz users can overcome these mistakes.
+      Of course you are welcome to send us any patches that fix your
+      Windoz build environment.
+
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+=-= compiling under DJGPP =-=
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+
+You might want to try using the DJGPP system to compile calc.  See:
+
+	http://www.delorie.com/djgpp/
+
+for DJGPP details and availability.
+
+To compile with DJGPP, one needs to select a number of Makefile
+variable changes.  Eli Zaretskii <eliz at is dot elta dot co dot il>
+recommends the following settings:
+
+	TERMCONTROL= -DUSE_TERMIOS
+	BYTE_ORDER= -DLITTLE_ENDIAN
+	LONG_BITS= 32
+	HAVE_FPOS_POS= -DHAVE_NO_FPOS_POS
+	FPOS_BITS= 32
+	OFF_T_BITS= 32
+	DEV_BITS= 32
+	INODE_BITS= 32
+	HAVE_USTAT= -DHAVE_NO_USTAT
+	HAVE_GETSID= -DHAVE_NO_GETSID
+	HAVE_GETPGID= -DHAVE_NO_GETPGID
+	HAVE_GETTIME= -DHAVE_NO_GETTIME
+	HAVE_GETPRID= -DHAVE_NO_GETPRID
+	HAVE_URANDOM_H= NO
+	ALIGN32= -UMUST_ALIGN32
+	HAVE_MALLOC_H= YES
+	HAVE_STDLIB_H= YES
+	HAVE_STRING_H= YES
+	HAVE_TIMES_H= NO
+	HAVE_SYS_TIMES_H= YES
+	HAVE_TIME_H= YES
+	HAVE_SYS_TIME_H= YES
+	HAVE_UNISTD_H= YES
+	BINDIR= /dev/env/DJDIR/bin
+	INCDIR= /dev/env/DJDIR/include
+	LIBDIR= /dev/env/DJDIR/lib
+	MANDIR= /dev/env/DJDIR/man/man1
+	CATDIR= /dev/env/DJDIR/man/cat1
+	NROFF= groff
+	CALCPATH= .;./cal;~/.cal;${CALC_SHAREDIR};${CUSTOMCALDIR}
+	CALCRC= ${CALC_SHAREDIR}/startup;~/.calcrc;./.calcinit
+	CALCPAGER= less.exe -ci
+	DEBUG= -O2 -gstabs+
+
+The 'Linux set' or 'gcc set' (see the Select your compiler type section)
+should work for DJGPP systems if you set the above Makefile variables.
+
+Look for Makefile comments of the form:
+
+	# Select ...something... for DJGPP.
+
+Follow those recommendations.  In cases where they conflict with
+the above Makefile list, follow the recommendation in the Makefile.
+
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+=-= compiling with Cygwin =-=
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+
+An effort is being made to allow windows users to compile calc using the
+Cygwin project (http://sources.redhat.com/cygwin/) with the GCC compiler
+and Un*x tools for Windows.
+
+The major porting work was performed by Thomas Jones-Low
+(tjoneslo at softstart dot com).  He said:
+
+    I had previous stated to this group that I have successfully managed
+    to port a version of Calc to Windows, and promised some point to
+    post what was required, so here it is.
+
+    One obvious manner of doing this port is to get the latest version
+    of the Cygwin project (http://sources.redhat.com/cygwin/) with the
+    GCC compiler and Un*x tools for Windows and recompile.
+
+    I built my working version using Calc ... I am using Visual C++
+    version 7.0, which is an older version of the Microsoft development
+    tools. The make file provided with Calc is not compatible with
+    NMAKE, so I used the Visual Studio tools to generate another one
+    (not included). Calc is built in two parts, calc.dll, which is the
+    library, and calc.exe which is the command line interface.
+
+He recommended that you generate by hand all of the header files that
+by the Makefile.  This has been done for you via the makefile rule:
+
+	make win32_hsrc
+
+which uses the Makefile variables in win32.mkdef to form these header
+files under win32 directory.
+
+You will find generated versions of these files located in the win32
+sub-directory.  These files may be appropriate for your Cygwin building
+needs.
+
+In particular:
+
+	Just copy the win32/*.[ch] files up into the top level calc
+	source directory, edit them (if needed) and build using the
+	Cygwin GCC compiler and Cygwin build environment.
+
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+=-=-= calc maintenance folk =-=-=
+=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+
+People who maintain calc need to keep in mind the following:
+
+The following was added to opcodes.h, config.h, zmath.h and value.h:
+
+	#if defined(_WIN32)
+	#ifdef _EXPORTING
+	  #define DLL	__declspec(dllexport)
+	#else
+	  #define DLL	__declspec(dllimport)
+	#endif
+
+	#else /* Windoz free systems */
+
+	  #define DLL
+
+	#endif /* Windoz free systems */
+
+Then DLL was added in front of all the exported functions.  For example:
+
+    extern int configtype(char*);
+
+was changed to:
+
+    DLL extern int configtype(char*);
+
+
+## Copyright (C) 2002  Landon Curt Noll and Thomas Jones-Low
+##
+## 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.12 $
+## @(#) $Id: README.WINDOWS,v 29.12 2004/07/28 12:52:01 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/RCS/README.WINDOWS,v $
+##
+## Under source code control:	2001/02/25 14:00:05
+## File existed as early as:	2001
+##
+## chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/

addop.c

@@ -1,11 +1,35 @@
 /*
- * Copyright (c) 1997 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-2006  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.12 $
+ * @(#) $Id: addop.c,v 29.12 2006/06/03 22:47:28 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 #include <stdio.h>
 #include "calc.h"
 #include "opcodes.h"
@@ -16,12 +40,13 @@
 #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 unsigned 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 */
@@ -61,26 +86,49 @@ initfunctions(void)
 void
 showfunctions(void)
 {
-	FUNC **fpp;		/* pointer into function table */
 	FUNC *fp;		/* current function */
 	long count;
+	long index;
 
 	count = 0;
 	if (funccount > 0) {
-		for (fpp = &functions[funccount - 1]; fpp >= functions; fpp--) {
-			fp = *fpp;
-			if (fp == NULL)
-				continue;
-			if (count++ == 0) {
-				printf("Name Arguments\n---- ---------\n");
+		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("%-12s %-2d\n", fp->f_name, fp->f_paramcount);
 		}
 	}
-	if (count > 0) {
-		printf("\nNumber: %ld\n", count);
+	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 {
-		printf("No user functions defined\n");
+		if (count > 0)
+			math_fmt("\nNumber: %ld\n", count);
+		else
+			math_str("No user functions defined\n");
 	}
 }
 
@@ -114,7 +162,9 @@ 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();
@@ -134,18 +184,19 @@ void
 endfunc(void)
 {
 	register FUNC *fp;		/* function just finished */
-	unsigned long size;		/* size of just created function */
-	long index;
+	size_t size;			/* size of just created function */
+	unsigned long index;
 
 	if (oldop != OP_RETURN) {
 		addop(OP_UNDEF);
 		addop(OP_RETURN);
 	}
+
 	checklabels();
+
 	if (errorcount) {
-		freefunc(curfunc);
-		printf("\"%s\": %ld error%s\n", curfunc->f_name, errorcount,
-			((errorcount == 1) ? "" : "s"));
+		scanerror(T_NULL,"Compilation of \"%s\" failed: %ld error(s)",
+			 newname, errorcount);
 		return;
 	}
 	size = funcsize(curfunc->f_opcodecount);
@@ -157,17 +208,17 @@ endfunc(void)
 	memcpy((char *) fp, (char *) curfunc, size);
 	if (curfunc != functemplate)
 		free(curfunc);
-	if (conf->traceflags & TRACE_FNCODES) {
+	if (newname[0] != '*' && (conf->traceflags & TRACE_FNCODES)) {
 		dumpnames = TRUE;
 		for (size = 0; size < fp->f_opcodecount; ) {
-			printf("%ld: ", (long)size);
+			printf("%ld: ", (unsigned long)size);
 			size += dumpop(&fp->f_opcodes[size]);
 		}
 	}
-	if ((inputisterminal() && conf->lib_debug & 1) ||
-		(!inputisterminal() && conf->lib_debug & 2)) {
-		printf("%s(", fp->f_name);
-		for (index = 0; index <  fp->f_paramcount; index++) {
+	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));
@@ -182,7 +233,6 @@ endfunc(void)
 		free(functions[newindex]);
 	}
 	functions[newindex] = fp;
-	objuncache();
 }
 
 
@@ -230,16 +280,17 @@ rmuserfunc(char *name)
 
 	index = findstr(&funcnames, name);
 	if (index < 0) {
-		printf("%s() has never been defined\n",
-			name);
+		errorcount--;
+		scanerror(T_NULL,
+		"Attempt to undefine an undefined function\n\t\"%s\"", name);
 		return;
 	}
 	if (functions[index] == NULL)
 		return;
 	freenumbers(functions[index]);
 	free(functions[index]);
-	if ((inputisterminal() && conf->lib_debug & 1) ||
-			(!inputisterminal() && conf->lib_debug & 2))
+	if ((inputisterminal() && conf->resource_debug & RSCDBG_STDIN_FUNC) ||
+	    (!inputisterminal() && conf->resource_debug & RSCDBG_FILE_FUNC))
 		printf("%s() undefined\n", name);
 	functions[index] = NULL;
 }
@@ -251,12 +302,25 @@ rmuserfunc(char *name)
 void
 freefunc(FUNC *fp)
 {
-	long i;
+	long index;
+	unsigned long i;
 
 	if (fp == NULL)
 		return;
-	if (conf->traceflags & TRACE_FNCODES) {
-		printf("Freeing function \"%s\"\n", fp->f_name);
+	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 (newname[0] != '*' && (conf->traceflags & TRACE_FNCODES)) {
+		printf("Freeing function \"%s\"\n",namestr(&funcnames,index));
 		dumpnames = FALSE;
 		for (i = 0; i < fp->f_opcodecount; ) {
 			printf("%ld: ", i);
@@ -272,12 +336,14 @@ freefunc(FUNC *fp)
 void
 rmalluserfunc(void)
 {
-	FUNC **fpp;
+	FUNC *fp;
+	long index;
 
-	for (fpp = functions; fpp < &functions[funccount]; fpp++) {
-		if (*fpp) {
-			freefunc(*fpp);
-			*fpp = NULL;
+	for (index = 0; index < funccount; index++) {
+		fp = functions[index];
+		if (fp) {
+			freefunc(fp);
+			functions[index] = NULL;
 		}
 	}
 }
@@ -290,12 +356,12 @@ rmalluserfunc(void)
 long
 getuserfunc(char *name)
 {
- 	long index;
+	long index;
 
- 	index = findstr(&funcnames, name);
- 	if (index >= 0 && functions[index] != NULL)
- 		return index;
- 	return -1L;
+	index = findstr(&funcnames, name);
+	if (index >= 0 && functions[index] != NULL)
+		return index;
+	return -1L;
 }
 
 
@@ -318,7 +384,7 @@ clearopt(void)
 FUNC *
 findfunc(long index)
 {
-	if ((unsigned long) index >= funccount) {
+	if (index >= funccount) {
 		math_error("Undefined function");
 		/*NOTREACHED*/
 	}
@@ -386,118 +452,123 @@ addop(long op)
 	 * slightly optimize the code depending on the various combinations.
 	 */
 	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_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;
 
-			}
-			if (cut) {
-				fp->f_opcodes[count - diff] = oldop;
-				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_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;
-			default:
-				cut = FALSE;
-			}
-			if (cut) {
-				fp->f_opcodecount -= diff;
-				oldop = OP_NOP;
-				oldoldop = OP_NOP;
-				fprintf(stderr, "%ld: unused value ignored\n",
-					linenumber());
-				return;
-			}
+		case OP_STRING:
+			sfree(findstring((long)fp->f_opcodes[count-1]));
 			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;
-			}
+		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;
+			errorcount--;
+			scanerror(T_NULL, "Constant before comma operator");
+			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 (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:
+			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);
@@ -529,8 +600,7 @@ addop(long op)
 				qfree(q);
 				fp->f_opcodes[count - 2] = OP_ZERO;
 				fp->f_opcodecount--;
-			}
-			else if (qisone(q)) {
+			} else if (qisone(q)) {
 				qfree(q);
 				fp->f_opcodes[count - 2] = OP_ONE;
 				fp->f_opcodecount--;
@@ -633,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.2 $
+ * @(#) $Id: align32.c,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 #include <stdio.h>
 #include <signal.h>
 #include "longbits.h"
@@ -67,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,7 +1,30 @@
 /*
- * Copyright (c) 1997 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.4 $
+ * @(#) $Id: alloc.h,v 29.4 2001/06/08 21:00:58 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
@@ -9,10 +32,17 @@
 #define __ALLOC_H__
 
 
-#include "have_malloc.h"
-#include "have_newstr.h"
-#include "have_string.h"
-#include "have_memmv.h"
+#if defined(CALC_SRC)	/* if we are building from the calc source tree */
+# include "have_malloc.h"
+# include "have_newstr.h"
+# include "have_string.h"
+# include "have_memmv.h"
+#else
+# include <calc/have_malloc.h>
+# include <calc/have_newstr.h>
+# include <calc/have_string.h>
+# include <calc/have_memmv.h>
+#endif
 
 #ifdef HAVE_MALLOC_H
 # include <malloc.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.2 $
+ * @(#) $Id: assocfunc.c,v 29.2 2000/06/07 14:02:13 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://www.isthe.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;
 	}
 
@@ -216,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.
@@ -244,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)
@@ -282,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");
@@ -292,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);
@@ -447,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;
@@ -489,5 +535,3 @@ compareindices(VALUE *v1, VALUE *v2, long dim)
 
 	return TRUE;
 }
-
-/* END CODE */

blkcpy.c

@@ -1,12 +1,35 @@
 /*
- * Copyright (c) 1997 Ernest Bowen and Landon Curt Noll
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * blkcpy - general values and related routines used by the calculator
  *
- * By: Ernest Bowen and Landon Curt Noll
- *     ernie@neumann.une.edu.au and chongo@toad.com
+ * Copyright (C) 1999-2006  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.9 $
+ * @(#) $Id: blkcpy.c,v 29.9 2006/05/20 08:43:55 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/blkcpy.c,v $
+ *
+ * Under source code control:	1997/04/18 20:41:26
+ * File existed as early as:	1997
+ *
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 #include <stdio.h>
 #include <sys/types.h>
 #include "calc.h"
@@ -50,51 +73,51 @@ copystod(VALUE *svp, long ssi, long num, VALUE *dvp, long dsi)
 	 * determine/check source type
 	 */
 	switch(svp->v_type) {
-		case V_NBLOCK:
-			if (svp->v_nblock->subtype & V_NOCOPYFROM)
-				return E_COPY15;
-			sblk = svp->v_nblock->blk;
-			if (sblk->data == NULL)
-				return E_COPY8;
-			break;
-		case V_BLOCK:
-			sblk = svp->v_block;
-			break;
-		case V_STR:
-		case V_OCTET:
-		case V_NUM:
-		case V_FILE:
-		case V_MAT:
-		case V_LIST:
-			break;
-		default:
-			return E_COPY9;
+	case V_NBLOCK:
+		if (svp->v_nblock->subtype & V_NOCOPYFROM)
+			return E_COPY15;
+		sblk = svp->v_nblock->blk;
+		if (sblk->data == NULL)
+			return E_COPY8;
+		break;
+	case V_BLOCK:
+		sblk = svp->v_block;
+		break;
+	case V_STR:
+	case V_OCTET:
+	case V_NUM:
+	case V_FILE:
+	case V_MAT:
+	case V_LIST:
+		break;
+	default:
+		return E_COPY9;
 	}
 
 	/*
 	 * determine/check destination type
 	 */
 	switch(dvp->v_type) {
-		case V_NBLOCK:
-			if (dvp->v_nblock->subtype & V_NOCOPYTO)
-				return E_COPY16;
-			noreloc |=((dvp->v_nblock->subtype & V_NOREALLOC) != 0);
-			dblk = dvp->v_nblock->blk;
-			if (dblk->data == NULL)
-				return E_COPY10;
-			break;
-		case V_BLOCK:
-			noreloc = ((dvp->v_subtype & V_NOREALLOC) != 0);
-			dblk = dvp->v_block;
-			break;
-		case V_STR:
-		case V_NUM:
-		case V_FILE:
-		case V_MAT:
-		case V_LIST:
-			break;
-		default:
-			return E_COPY11;
+	case V_NBLOCK:
+		if (dvp->v_nblock->subtype & V_NOCOPYTO)
+			return E_COPY16;
+		noreloc |=((dvp->v_nblock->subtype & V_NOREALLOC) != 0);
+		dblk = dvp->v_nblock->blk;
+		if (dblk->data == NULL)
+			return E_COPY10;
+		break;
+	case V_BLOCK:
+		noreloc = ((dvp->v_subtype & V_NOREALLOC) != 0);
+		dblk = dvp->v_block;
+		break;
+	case V_STR:
+	case V_NUM:
+	case V_FILE:
+	case V_MAT:
+	case V_LIST:
+		break;
+	default:
+		return E_COPY11;
 	}
 
 	/*
@@ -257,20 +280,20 @@ copymat2mat(MATRIX *smat, long ssi, long num, MATRIX *dmat, long dsi)
 	VALUE *vp;
 	VALUE *vq;
 	VALUE *vtemp;
-	short subtype;
+	unsigned short subtype;
 
 	if (ssi > smat->m_size)
 		return E_COPY2;
 
 	if (num < 0)
 		num = smat->m_size - ssi;
-	if ((USB32) ssi + num > smat->m_size)
+	if (ssi + num > smat->m_size)
 		return E_COPY5;
 	if (num == 0)
 		return 0;
 	if (dsi < 0)
 		dsi = 0;
-	if ((USB32) dsi + num > dmat->m_size)
+	if (dsi + num > dmat->m_size)
 		return E_COPY7;
 	vtemp = (VALUE *) malloc(num * sizeof(VALUE));
 	if (vtemp == NULL) {
@@ -288,7 +311,7 @@ copymat2mat(MATRIX *smat, long ssi, long num, MATRIX *dmat, long dsi)
 		subtype = vq->v_subtype;
 		freevalue(vq);
 		*vq = *vp;
-		vq->v_subtype = subtype;
+		vq->v_subtype |= subtype;
 	}
 	free(vtemp);
 	return 0;
@@ -306,19 +329,19 @@ copyblk2mat(BLOCK *blk, long ssi, long num, MATRIX *dmat, long dsi)
 	VALUE *vq;
 	VALUE *vtemp;
 	long i;
-	short subtype;
+	unsigned short subtype;
 
 	if (ssi > blk->datalen)
 		return E_COPY2;
 	if (num < 0)
 		num = blk->datalen - ssi;
-	if ((USB32) ssi + num > blk->datalen)
+	if (ssi + num > blk->datalen)
 		return E_COPY5;
 	if (num == 0)
 		return 0;
 	if (dsi < 0)
 		dsi = 0;
-	if ((USB32) dsi + num > dmat->m_size)
+	if (dsi + num > dmat->m_size)
 		return E_COPY7;
 	op = blk->data + ssi;
 	vtemp = (VALUE *) malloc(num * sizeof(VALUE));
@@ -330,6 +353,7 @@ copyblk2mat(BLOCK *blk, long ssi, long num, MATRIX *dmat, long dsi)
 	i = num;
 	while (i-- > 0) {
 		vp->v_type = V_NUM;
+		vp->v_subtype = V_NOSUBTYPE;
 		vp->v_num = itoq((long) *op++);
 		vp++;
 	}
@@ -339,7 +363,7 @@ copyblk2mat(BLOCK *blk, long ssi, long num, MATRIX *dmat, long dsi)
 		subtype = vq->v_subtype;
 		freevalue(vq);
 		*vq = *vp;
-		vq->v_subtype = subtype;
+		vq->v_subtype |= subtype;
 	}
 	free(vtemp);
 	return 0;
@@ -365,7 +389,7 @@ copymat2blk(MATRIX *smat, long ssi, long num, BLOCK *dblk, long dsi, BOOL norelo
 		num = smat->m_size - ssi;
 	if (num == 0)
 		return 0;
-	if ((USB32) ssi + num > smat->m_size)
+	if (ssi + num > smat->m_size)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = dblk->datalen;
@@ -405,6 +429,7 @@ copymat2list(MATRIX *smat, long ssi, long num, LIST *lp, long dsi)
 	LISTELEM *ep;
 	VALUE *vtemp;
 	long i;
+	unsigned short subtype;
 
 	if (ssi > smat->m_size)
 		return E_COPY2;
@@ -412,11 +437,11 @@ copymat2list(MATRIX *smat, long ssi, long num, LIST *lp, long dsi)
 		num = smat->m_size - ssi;
 	if (num == 0)
 		return 0;
-	if ((USB32) ssi + num > smat->m_size)
+	if (ssi + num > smat->m_size)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = 0;
-	if ((USB32) dsi + num > lp->l_count)
+	if (dsi + num > lp->l_count)
 		return E_COPY7;
 	vtemp = (VALUE *) malloc(num * sizeof(VALUE));
 	if (vtemp == NULL) {
@@ -432,8 +457,10 @@ copymat2list(MATRIX *smat, long ssi, long num, LIST *lp, long dsi)
 	ep = listelement(lp, (long) dsi);
 	i = num;
 	while (i-- > 0) {
+		subtype = ep->e_value.v_subtype;
 		freevalue(&ep->e_value);
 		ep->e_value = *vq++;
+		ep->e_value.v_subtype |= subtype;
 		ep = ep->e_next;
 	}
 	free(vtemp);
@@ -452,7 +479,7 @@ copylist2mat(LIST *lp, long ssi, long num, MATRIX *dmat, long dsi)
 	LISTELEM *ep;
 	VALUE *vtemp;
 	long i;
-	short subtype;
+	unsigned short subtype;
 
 	if (ssi > lp->l_count)
 		return E_COPY2;
@@ -460,11 +487,11 @@ copylist2mat(LIST *lp, long ssi, long num, MATRIX *dmat, long dsi)
 		num = lp->l_count - ssi;
 	if (num == 0)
 		return 0;
-	if ((USB32) ssi + num > lp->l_count)
+	if (ssi + num > lp->l_count)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = 0;
-	if ((USB32) dsi + num > dmat->m_size)
+	if (dsi + num > dmat->m_size)
 		return E_COPY7;
 	vtemp = (VALUE *) malloc(num * sizeof(VALUE));
 	if (vtemp == NULL) {
@@ -484,7 +511,7 @@ copylist2mat(LIST *lp, long ssi, long num, MATRIX *dmat, long dsi)
 		subtype = vq->v_subtype;
 		freevalue(vq);
 		*vq = *vp;
-		vq->v_subtype = subtype;
+		vq->v_subtype |= subtype;
 	}
 	free(vtemp);
 	return 0;
@@ -502,6 +529,7 @@ copylist2list(LIST *slp, long ssi, long num, LIST *dlp, long dsi)
 	LISTELEM *dep;
 	VALUE *vtemp;
 	VALUE *vp;
+	unsigned short subtype;
 
 	if (ssi > slp->l_count)
 		return E_COPY2;
@@ -509,11 +537,11 @@ copylist2list(LIST *slp, long ssi, long num, LIST *dlp, long dsi)
 		num = slp->l_count - ssi;
 	if (num == 0)
 		return 0;
-	if ((USB32) ssi + num > slp->l_count)
+	if (ssi + num > slp->l_count)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = 0;
-	if ((USB32) dsi + num > dlp->l_count)
+	if (dsi + num > dlp->l_count)
 		return E_COPY7;
 	vtemp = (VALUE *) malloc(num * sizeof(VALUE));
 	if (vtemp == NULL) {
@@ -531,8 +559,10 @@ copylist2list(LIST *slp, long ssi, long num, LIST *dlp, long dsi)
 	vp = vtemp;
 	i = num;
 	while (i-- > 0) {
+		subtype = dep->e_value.v_subtype;
 		freevalue(&dep->e_value);
 		dep->e_value = *vp++;
+		dep->e_value.v_subtype |= subtype;
 		dep = dep->e_next;
 	}
 	free(vtemp);
@@ -546,9 +576,9 @@ copylist2list(LIST *slp, long ssi, long num, LIST *dlp, long dsi)
 int
 copyblk2file(BLOCK *sblk, long ssi, long num, FILEID id, long dsi)
 {
-	FILEIO 	*fiop;
+	FILEIO	*fiop;
 	FILE	*fp;
-	unsigned int	numw;
+	long	numw;
 
 	if (ssi > sblk->datalen)
 		return E_COPY2;
@@ -557,12 +587,12 @@ copyblk2file(BLOCK *sblk, long ssi, long num, FILEID id, long dsi)
 	if (num == 0)
 		return 0;
 
-	fiop = findid(id, 'w');
+	fiop = findid(id, TRUE);
 	if (fiop == NULL)
 		return E_COPYF1;
 	fp = fiop->fp;
 	if (id == 1 || id == 2) {
-		numw = idfputstr(id, (char *)sblk->data + ssi);  /* XXX */
+		numw = idfputstr(id, (char *)sblk->data + ssi);	 /* XXX */
 		return 0;
 	}
 	if (dsi >= 0) {
@@ -583,9 +613,9 @@ copyblk2file(BLOCK *sblk, long ssi, long num, FILEID id, long dsi)
 int
 copyfile2blk(FILEID id, long ssi, long num, BLOCK *dblk, long dsi, BOOL noreloc)
 {
-	FILEIO 	*fiop;
+	FILEIO	*fiop;
 	FILE	*fp;
-	unsigned int	numw;
+	long	numw;
 	ZVALUE	fsize;
 	long	filelen;
 	long	newlen;
@@ -594,7 +624,7 @@ copyfile2blk(FILEID id, long ssi, long num, BLOCK *dblk, long dsi, BOOL noreloc)
 
 	if (id < 3)			/* excludes copying from stdin */
 		return E_COPYF1;
-	fiop = findid(id, 'r');
+	fiop = findid(id, FALSE);
 	if (fiop == NULL)
 		return E_COPYF1;
 
@@ -615,7 +645,7 @@ copyfile2blk(FILEID id, long ssi, long num, BLOCK *dblk, long dsi, BOOL noreloc)
 		num = filelen - ssi;
 	if (num == 0)
 		return 0;
-	if ((USB32) ssi + num > filelen)
+	if (ssi + num > filelen)
 		return E_COPY5;
 	if (fseek(fp, ssi, 0))		/* using system fseek  XXX */
 		return E_COPYF2;
@@ -653,7 +683,7 @@ copystr2file(STRING *str, long ssi, long num, FILEID id, long dsi)
 {
 	long len;
 	FILEIO *fiop;
-	unsigned int numw;
+	long numw;
 	FILE *fp;
 
 	len = str->s_len;
@@ -664,14 +694,14 @@ copystr2file(STRING *str, long ssi, long num, FILEID id, long dsi)
 		num = len - ssi;
 	if (num <= 0)			/* Nothing to be copied */
 		return 0;
-	if ((USB32) ssi + num > len)
+	if (ssi + num > len)
 		return E_COPY5;		/* Insufficient memory in str */
-	fiop = findid(id, 'w');
+	fiop = findid(id, TRUE);
 	if (fiop == NULL)
 		return E_COPYF1;
 	fp = fiop->fp;
 	if (id == 1 || id == 2) {
-		numw = idfputstr(id, str->s_str + ssi);  /* XXX */
+		numw = idfputstr(id, str->s_str + ssi);	 /* XXX */
 		return 0;
 	}
 	if (dsi >= 0) {
@@ -702,7 +732,7 @@ copyblk2blk(BLOCK *sblk, long ssi, long num, BLOCK *dblk, long dsi, BOOL noreloc
 		num = sblk->datalen - ssi;
 	if (num == 0)			/* Nothing to be copied */
 		return 0;
-	if ((unsigned int) ssi + num > sblk->datalen)
+	if (ssi + num > sblk->datalen)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = dblk->datalen;
@@ -782,13 +812,13 @@ copystr2str(STRING *sstr, long ssi, long num, STRING *dstr, long dsi)
 {
 	char *c, *c1;
 
-	if (num < 0 || ssi + num > sstr->s_len)
+	if (num < 0 || (size_t)(ssi + num) > sstr->s_len)
 		num = sstr->s_len - ssi;
 	if (num <= 0)
 		return 0;		/* Nothing to be copied */
 	if (dsi < 0)			/* default destination index */
 		dsi = 0;
-	if (dsi + num > dstr->s_len)
+	if ((size_t)(dsi + num) > dstr->s_len)
 		num = dstr->s_len - dsi;
 	c1 = sstr->s_str + ssi;
 	c = dstr->s_str + dsi;
@@ -814,7 +844,7 @@ copyblk2str(BLOCK *sblk, long ssi, long num, STRING *dstr, long dsi)
 		return 0;		/* Nothing to be copied */
 	if (dsi < 0)			/* default destination index */
 		dsi = 0;
-	if (dsi + num > dstr->s_len)
+	if ((size_t)(dsi + num) > dstr->s_len)
 		num = dstr->s_len - dsi;
 	c1 = sblk->data + ssi;
 	c = (USB8 *)dstr->s_str + dsi;
@@ -828,18 +858,18 @@ copyblk2str(BLOCK *sblk, long ssi, long num, STRING *dstr, long dsi)
 int
 copyostr2str(char *sstr, long ssi, long num, STRING *dstr, long dsi)
 {
-	long len;
-	char 	*c, *c1;
+	size_t len;
+	char	*c, *c1;
 
-	len = (long)strlen(sstr);
+	len = strlen(sstr);
 
-	if (num < 0 || ssi + num > len)
+	if (num < 0 || (size_t)(ssi + num) > len)
 		num = len - ssi;
 	if (num <= 0)			/* Nothing to be copied */
 		return 0;
 	if (dsi < 0)
 		dsi = 0;		/* Default destination index */
-	if (dsi + num > dstr->s_len)
+	if ((size_t)(dsi + num) > dstr->s_len)
 		num = dstr->s_len - dsi;
 	c1 = sstr + ssi;
 	c = dstr->s_str + dsi;
@@ -855,16 +885,16 @@ copyostr2str(char *sstr, long ssi, long num, STRING *dstr, long dsi)
 int
 copyostr2blk(char *str,long ssi,long num,BLOCK *dblk,long dsi,BOOL noreloc)
 {
-	int	len;
-	int	newlen;
-	int	newsize;
+	size_t	len;
+	size_t	newlen;
+	size_t	newsize;
 	USB8	*newdata;
 
 	len = strlen(str) + 1;
 
-	if (ssi > len)
+	if (ssi > 0 && (size_t)ssi > len)
 		return E_COPY2;
-	if (num < 0 || (unsigned long) ssi + num > len)
+	if (num < 0 || (size_t)(ssi + num) > len)
 		num = len - ssi;
 	if (num <= 0)			/* Nothing to be copied */
 		return 0;
@@ -873,7 +903,7 @@ copyostr2blk(char *str,long ssi,long num,BLOCK *dblk,long dsi,BOOL noreloc)
 	newlen = dsi + num;
 	if (newlen <= 0)
 		return E_COPY7;
-	if (newlen >= dblk->maxsize) {
+	if (newlen >= (size_t)dblk->maxsize) {
 		if (noreloc)
 			return E_COPY17;
 		newsize = (1 + newlen/dblk->blkchunk) * dblk->blkchunk;
@@ -886,7 +916,7 @@ copyostr2blk(char *str,long ssi,long num,BLOCK *dblk,long dsi,BOOL noreloc)
 		dblk->maxsize = newsize;
 	}
 	memmove(dblk->data + dsi, str + ssi, num);
-	if (newlen > dblk->datalen)
+	if (newlen > (size_t)dblk->datalen)
 		dblk->datalen = newlen;
 	return 0;
 }
@@ -897,8 +927,8 @@ copyostr2blk(char *str,long ssi,long num,BLOCK *dblk,long dsi,BOOL noreloc)
  * Copying between objects that overlap will take place correctly.
  *
  * given:
- *	s1 	destination
- *	s2 	source
+ *	s1	destination
+ *	s2	source
  *	n	octet count
  *
  * returns:
@@ -954,11 +984,11 @@ memmove(void *s1, const void *s2, CALC_SIZE_T n)
 int
 copynum2blk(NUMBER *snum, long ssi, long num, BLOCK *dblk, long dsi, BOOL noreloc)
 {
-	long	newlen;
-	long	newsize;
+	size_t	newlen;
+	size_t	newsize;
 	USB8	*newdata;
 #if CALC_BYTE_ORDER == BIG_ENDIAN
-	ZVALUE	*swnum;	/* byte swapped numerator */
+	ZVALUE	*swnum; /* byte swapped numerator */
 #endif
 
 	if (ssi > snum->num.len)
@@ -967,14 +997,14 @@ copynum2blk(NUMBER *snum, long ssi, long num, BLOCK *dblk, long dsi, BOOL norelo
 		num = snum->num.len - ssi;
 	if (num == 0)			/* Nothing to be copied */
 		return 0;
-	if ((unsigned long) ssi + num > snum->num.len)
+	if (ssi + num > snum->num.len)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = dblk->datalen;
-	newlen = dsi + (long)(num*sizeof(HALF));
+	newlen = dsi + (num*sizeof(HALF));
 	if (newlen <= 0)
 		return E_COPY7;
-	if (newlen >= dblk->maxsize) {
+	if (newlen >= (size_t)dblk->maxsize) {
 		if (noreloc)
 			return E_COPY17;
 		newsize = (1 + newlen/dblk->blkchunk) * dblk->blkchunk;
@@ -993,7 +1023,7 @@ copynum2blk(NUMBER *snum, long ssi, long num, BLOCK *dblk, long dsi, BOOL norelo
 	memmove(dblk->data+dsi, (char *)(swnum->v+ssi), num*sizeof(HALF));
 	zfree(*swnum);
 #endif
-	if (newlen > dblk->datalen)
+	if (newlen > (size_t)dblk->datalen)
 		dblk->datalen = newlen;
 	return 0;
 }
@@ -1005,7 +1035,7 @@ copynum2blk(NUMBER *snum, long ssi, long num, BLOCK *dblk, long dsi, BOOL norelo
 int
 copyblk2num(BLOCK *sblk, long ssi, long num, NUMBER *dnum, long dsi, NUMBER **res)
 {
-	long	newlen;
+	size_t	newlen;
 	NUMBER *ret;		/* cloned and modified numerator */
 #if CALC_BYTE_ORDER == BIG_ENDIAN
 	HALF *swapped;		/* byte swapped input data */
@@ -1020,11 +1050,11 @@ copyblk2num(BLOCK *sblk, long ssi, long num, NUMBER *dnum, long dsi, NUMBER **re
 		num = sblk->datalen - ssi;
 	if (num == 0)			/* Nothing to be copied */
 		return 0;
-	if ((unsigned long) ssi + num > sblk->datalen)
+	if (ssi + num > sblk->datalen)
 		return E_COPY5;
 	if (dsi < 0)
 		dsi = dnum->num.len;
-	newlen = dsi + (long)((num+sizeof(HALF)-1)/sizeof(HALF));
+	newlen = dsi + ((num+sizeof(HALF)-1)/sizeof(HALF));
 	if (newlen <= 0)
 		return E_COPY7;
 

blkcpy.h

@@ -1,14 +1,37 @@
 /*
- * Copyright (c) 1997 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * blkcpy - general values and related routines used by the calculator
  *
- * Definitions of 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.2 $
+ * @(#) $Id: blkcpy.h,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
 #if !defined(__BLKCPY_H__)
-#define	__BLKCPY_H__
+#define __BLKCPY_H__
 
 /*
  * the main copy gateway function

block.c

@@ -1,38 +1,33 @@
 /*
  * block - fixed, dynamic, fifo and circular memory blocks
- */
-/*
- * Copyright (c) 1997 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 text
- * this comment, and the disclaimer below appear in all of the following:
+ * Copyright (C) 1999  Landon Curt Noll and Ernest Bowen
  *
- *	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.
  *
- * Comments, suggestions, bug fixes and questions about these routines
- * are welcome.  Send EMail to the address given below.
+ * 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.
  *
- * Happy bit twiddling,
+ * 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.
  *
- *			Landon Curt Noll
+ * @(#) $Revision: 29.3 $
+ * @(#) $Id: block.c,v 29.3 2006/05/01 19:16:57 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/block.c,v $
  *
- *			chongo@toad.com
- *			...!{pyramid,sun,uunet}!hoptoad!chongo
+ * Under source code control:	1997/02/27 00:29:40
+ * File existed as early as:	1997
  *
- * chongo was here	/\../\
+ * chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
@@ -62,7 +57,7 @@ static void blkchk(BLOCK*);
  *
  * given:
  *	len	- initial memory length of the block
- *	type	- BLK_TYPE_XXX
+ *	type	- BLK_TYPE_XYZ
  *	chunk	- allocation chunk size
  *
  * returns:
@@ -106,7 +101,7 @@ blkalloc(int len, int chunk)
 	/*
 	 * return BLOCK
 	 */
-	if (conf->calc_debug > 0) {
+	if (conf->calc_debug & CALCDBG_BLOCK) {
 		blkchk(nblk);
 	}
 	return nblk;
@@ -143,17 +138,15 @@ blk_free(BLOCK *blk)
 /*
  * blkchk - check the sanity of a block
  *
- * These checks should never fail if calc is working correctly.  During
+ * 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.
  *
- * This function is normally called whenever the following builtins are called:
+ * If "calc_debug" has the bit corresponding to CALCDBG_BLOCK set, this
+ * function is called during execution of the following builtins:
  *
  *	alloc(), realloc(), free()
  *
- * unless the "calc_debug" is set to -1.  If "calc_debug" is > 0, then
- * most blk builtins will call this function.
- *
  * given:
  *	blk	- the BLOCK to check
  *
@@ -168,7 +161,7 @@ blkchk(BLOCK *blk)
 	/*
 	 * firewall - general sanity check
 	 */
-	if (conf->calc_debug == -1) {
+	if ((conf->calc_debug & CALCDBG_BLOCK) == 0) {
 		/* do nothing when debugging is disabled */
 		return;
 	}
@@ -209,13 +202,13 @@ blkchk(BLOCK *blk)
  *
  * 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 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 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.
+ *	as the data size grows.
  *
  * Each of the len and chunksize may be kept the same.
  *
@@ -233,7 +226,7 @@ blkrealloc(BLOCK *blk, int newlen, int newchunk)
 	/*
 	 * firewall
 	 */
-	if (conf->calc_debug != -1) {
+	if (conf->calc_debug & CALCDBG_BLOCK) {
 		blkchk(blk);
 	}
 
@@ -292,7 +285,7 @@ blkrealloc(BLOCK *blk, int newlen, int newchunk)
 			memset(blk->data, 0, blk->maxsize);
 		}
 		blk->datalen = 0;
-		if (conf->calc_debug > 0) {
+		if (conf->calc_debug & CALCDBG_BLOCK) {
 			blkchk(blk);
 		}
 		return blk;
@@ -323,7 +316,7 @@ blkrealloc(BLOCK *blk, int newlen, int newchunk)
 	/*
 	 * return realloced type
 	 */
-	if (conf->calc_debug > 0) {
+	if (conf->calc_debug & CALCDBG_BLOCK) {
 		blkchk(blk);
 	}
 	return blk;
@@ -333,7 +326,7 @@ blkrealloc(BLOCK *blk, int newlen, int newchunk)
 /*
  * blktrunc - truncate a BLOCK down to a minimal fixed block
  *
- * NOTE: THIS IS NOT THE INTERNAL CALC FREE FUNCTION!!  This
+ * 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.
  *
@@ -351,7 +344,7 @@ blktrunc(BLOCK *blk)
 	/*
 	 * firewall
 	 */
-	if (conf->calc_debug != -1) {
+	if (conf->calc_debug & CALCDBG_BLOCK) {
 		blkchk(blk);
 	}
 
@@ -372,7 +365,7 @@ blktrunc(BLOCK *blk)
 		/*NOTREACHED*/
 	}
 	blk->data[0] = (USB8)0;
-	if (conf->calc_debug > 0) {
+	if (conf->calc_debug & CALCDBG_BLOCK) {
 		blkchk(blk);
 	}
 	return;
@@ -483,7 +476,7 @@ blk_print(BLOCK *blk)
 	BOOL havetail;
 	USB8 *ptr;
 
-	/* XXX - use the config parameters for better print control */
+	/* 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);
@@ -516,9 +509,9 @@ nblock_print(NBLOCK *nblk)
 		printf("chunksize = %d, maxsize = %d, datalen = %d\n\t",
 		(int)blk->blkchunk, (int)blk->maxsize, (int)blk->datalen);
 		printf("NULL");
-	}
-	else
+	} else {
 		blk_print(blk);
+	}
 }
 
 
@@ -560,8 +553,7 @@ reallocnblock(int id, int len, int chunk)
 			math_error("Allocation failed");
 			/*NOTREACHED*/
 		}
-	}
-	else if (newsize != oldsize) {
+	} else if (newsize != oldsize) {
 		newdata = realloc(blk->data, newsize);
 		if (newdata == NULL) {
 			math_error("Reallocation failed");
@@ -723,7 +715,7 @@ findnblock(int 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
+ * min(newlen, oldlen) octets to the new block.	 The old block is
  * not changed.
  */
 BLOCK *
@@ -734,7 +726,7 @@ copyrealloc(BLOCK *blk, int newlen, int newchunk)
 
 	oldlen = blk->datalen;
 
-	if (newlen < 0) 		/* retain length */
+	if (newlen < 0)			/* retain length */
 		newlen = oldlen;
 
 	if (newchunk < 0)		/* retain chunksize */

block.h

@@ -1,43 +1,38 @@
 /*
  * block - fixed, dynamic, fifo and circular memory blocks
- */
-/*
- * Copyright (c) 1997 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 text
- * this comment, and the disclaimer below appear in all of the following:
+ * Copyright (C) 1999  Landon Curt Noll and Ernest Bowen
  *
- *	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.
  *
- * Comments, suggestions, bug fixes and questions about these routines
- * are welcome.  Send EMail to the address given below.
+ * 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.
  *
- * Happy bit twiddling,
+ * 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.
  *
- *			Landon Curt Noll
+ * @(#) $Revision: 29.2 $
+ * @(#) $Id: block.h,v 29.2 2000/06/07 14:02:13 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/block.h,v $
  *
- *			chongo@toad.com
- *			...!{pyramid,sun,uunet}!hoptoad!chongo
+ * Under source code control:	1997/02/21 05:03:39
+ * File existed as early as:	1997
  *
- * chongo was here	/\../\
+ * chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
 #if !defined(__BLOCK_H__)
-#define	__BLOCK_H__
+#define __BLOCK_H__
 
 
 /*
@@ -141,8 +136,8 @@
  *		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
+ *		    "od_style", position, spaces between octets
+ *		    "hd_style"} position, spaces between octets, chars on end
  */
 struct block {
 	LEN blkchunk;	/* allocation chunk size */

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.2 $
+ * @(#) $Id: byteswap.c,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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:
@@ -263,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:

byteswap.h

@@ -1,23 +1,31 @@
 /*
- * Copyright (c) 1997 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.4 $
+ * @(#) $Id: byteswap.h,v 29.4 2001/06/08 21:00:58 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
@@ -25,7 +33,11 @@
 #define __BYTESWAP_H__
 
 
-#include "longbits.h"
+#if defined(CALC_SRC)	/* if we are building from the calc source tree */
+# include "longbits.h"
+#else
+# include <calc/longbits.h>
+#endif
 
 
 /*

cal/Makefile

@@ -0,0 +1,278 @@
+#!/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.19 $
+# @(#) $Id: Makefile,v 29.19 2006/06/10 13:01:34 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://www.isthe.com/chongo/
+# Share and enjoy!  :-) http://www.isthe.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 the system include (.h) files are kept
+#
+# For DJGPP, select:
+#
+#	INCDIR= /dev/env/DJDIR/include
+#
+# If in doubt, set:
+#
+#	INCDIR= /usr/include
+#
+
+#INCDIR= /usr/local/include
+#INCDIR= /dev/env/DJDIR/include
+INCDIR= /usr/include
+
+# where to install calc realted things
+#
+# ${BINDIR}		where to install calc binary files
+# ${LIBDIR}		where calc link library (*.a) files are installed
+# ${CALC_SHAREDIR}	where to install calc help, .cal, startup, config files
+#
+# NOTE: The install rule prepends installation paths with $T, which
+#	by default is empty.  If $T is non-empty, then installation
+#	locations will be relative to the $T directory.
+#
+# For DJGPP, select:
+#
+#	BINDIR= /dev/env/DJDIR/bin
+#	LIBDIR= /dev/env/DJDIR/lib
+#	CALC_SHAREDIR= /dev/env/DJDIR/share/calc
+#
+# If in doubt, set:
+#
+#	BINDIR= /usr/bin
+#	LIBDIR= /usr/lib
+#	CALC_SHAREDIR= /usr/share/calc
+#
+#BINDIR= /usr/local/bin
+#BINDIR= /dev/env/DJDIR/bin
+BINDIR= /usr/bin
+
+#LIBDIR= /usr/local/lib
+#LIBDIR= /dev/env/DJDIR/lib
+LIBDIR= /usr/lib
+
+#CALC_SHAREDIR= /usr/local/lib/calc
+#CALC_SHAREDIR= /dev/env/DJDIR/share/calc
+CALC_SHAREDIR= /usr/share/calc
+
+# By default, these values are based CALC_SHAREDIR, INCDIR, BINDIR
+# ---------------------------------------------------------------
+# ${HELPDIR}		where the help directory is installed
+# ${CALC_INCDIR}	where the calc include files are installed
+# ${CUSTOMCALDIR}	where custom *.cal files are installed
+# ${CUSTOMHELPDIR}	where custom help files are installed
+# ${CUSTOMINCPDIR}	where custom .h files are installed
+# ${SCRIPTDIR}		where calc shell scripts are installed
+#
+# NOTE: The install rule prepends installation paths with $T, which
+#	by default is empty.  If $T is non-empty, then installation
+#	locations will be relative to the $T directory.
+#
+# If in doubt, set:
+#
+#	HELPDIR= ${CALC_SHAREDIR}/help
+#	CALC_INCDIR= ${INCDIR}/calc
+#	CUSTOMCALDIR= ${CALC_SHAREDIR}/custom
+#	CUSTOMHELPDIR= ${CALC_SHAREDIR}/custhelp
+#	CUSTOMINCDIR= ${CALC_INCDIR}/custom
+#	SCRIPTDIR= ${BINDIR}/cscript
+#
+HELPDIR= ${CALC_SHAREDIR}/help
+CALC_INCDIR= ${INCDIR}/calc
+CUSTOMCALDIR= ${CALC_SHAREDIR}/custom
+CUSTOMHELPDIR= ${CALC_SHAREDIR}/custhelp
+CUSTOMINCDIR= ${CALC_INCDIR}/custom
+SCRIPTDIR= ${BINDIR}/cscript
+
+# T - top level directory under which calc will be installed
+#
+# The calc install is performed under $T, the calc build is
+# performed under /.	The purpose for $T is to allow someone
+# to install calc somewhere other than into the system area.
+#
+# For example, if:
+#
+#     BINDIR= /usr/bin
+#     LIBDIR= /usr/lib
+#     CALC_SHAREDIR= /usr/share/calc
+#
+# and if:
+#
+#     T= /var/tmp/testing
+#
+# Then the installation locations will be:
+#
+#     calc binary files:	/var/tmp/testing/usr/bin
+#     calc link library:	/var/tmp/testing/usr/lib
+#     calc help, .cal ...:	/var/tmp/testing/usr/share/calc
+#     ... etc ...		/var/tmp/testing/...
+#
+# If $T is empty, calc is installed under /, which is the same
+# top of tree for which it was built.  If $T is non-empty, then
+# calc is installed under $T, as if one had to chroot under
+# $T for calc to operate.
+#
+# If in doubt, use T=
+#
+T=
+
+# 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
+CMP= cmp
+
+# 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 linear.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 repeat.cal xx_print.cal natnumset.cal qtime.cal \
+	test8400.cal test8500.cal test8600.cal chi.cal intfile.cal screen.cal \
+	dotest.cal set8700.cal set8700.line alg_config.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} /dev/null; do \
+	    if [ X"$$i" != X"/dev/null" ]; then \
+		echo cal/$$i; \
+	    fi; \
+	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
+
+##
+#
+# rpm rules
+#
+##
+
+echo_inst_files:
+	${Q}for i in ${CALC_FILES} /dev/null; do \
+	    if [ X"$$i" != X"/dev/null" ]; then \
+		echo __file__ ${CALC_SHAREDIR}/$$i; \
+	    fi; \
+	done
+
+##
+#
+# Utility rules
+#
+##
+
+clean:
+
+clobber:
+	rm -f .all
+
+install: all
+	-${Q}if [ ! -d $T${CALC_SHAREDIR} ]; then \
+	    echo mkdir $T${CALC_SHAREDIR}; \
+	    mkdir $T${CALC_SHAREDIR}; \
+	    if [ ! -d "$T${CALC_SHAREDIR}" ]; then \
+		echo mkdir -p "$T${CALC_SHAREDIR}"; \
+		mkdir -p "$T${CALC_SHAREDIR}"; \
+	    fi; \
+	    echo ${CHMOD} 0755 $T${CALC_SHAREDIR}; \
+	    ${CHMOD} 0755 $T${CALC_SHAREDIR}; \
+	else \
+	    true; \
+	fi
+	${Q}for i in ${CALC_FILES} /dev/null; do \
+	    if [ "$$i" = "/dev/null" ]; then \
+		continue; \
+	    fi; \
+	    if ${CMP} -s $$i $T${CALC_SHAREDIR}/$$i; then \
+		true; \
+	    else \
+		rm -f $T${CALC_SHAREDIR}/$$i.new; \
+		cp -f $$i $T${CALC_SHAREDIR}/$$i.new; \
+		${CHMOD} 0444 $T${CALC_SHAREDIR}/$$i.new; \
+		mv -f $T${CALC_SHAREDIR}/$$i.new $T${CALC_SHAREDIR}/$$i; \
+		echo "installed $T${CALC_SHAREDIR}/$$i"; \
+	    fi; \
+	done

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.2 $
+ * @(#) $Id: beer.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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

@@ -0,0 +1,97 @@
+/*
+ * bernoulli - clculate the Nth Bernoulli number B(n)
+ *
+ * Copyright (C) 2000  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.3 $
+ * @(#) $Id: bernoulli.cal,v 29.3 2000/12/17 12:26:04 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://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * Calculate the Nth Bernoulli number B(n).
+ *
+ * NOTE: This is now a bulitin function.
+ *
+ * The non-buildin code used the following symbolic formula to calculate B(n):
+ *
+ *	(b+1)^(n+1) - b^(n+1) = 0
+ *
+ * where b is a dummy value, and each power b^i gets replaced by B(i).
+ * For example, for n = 3:
+ *
+ *	(b+1)^4 - b^4 = 0
+ *	b^4 + 4*b^3 + 6*b^2 + 4*b + 1 - b^4 = 0
+ *	4*b^3 + 6*b^2 + 4*b + 1 = 0
+ *	4*B(3) + 6*B(2) + 4*B(1) + 1 = 0
+ *	B(3) = -(6*B(2) + 4*B(1) + 1) / 4
+ *
+ * The combinatorial factors in the expansion of the above formula are
+ * calculated interatively, and we use the fact that B(2i+1) = 0 if i > 0.
+ * 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;
+
+	if (!isint(n) || (n < 0))
+		quit "Non-negative integer required for Bernoulli";
+
+	if (n == 0)
+		return 1;
+	if (n == 1)
+		return -1/2;
+	if (isodd(n))
+		return 0;
+	if (n > 1000)
+		quit "Very large Bernoulli";
+
+	if (n <= Bnmax)
+		return Bn[n];
+
+	for (nn = Bnmax + 2; nn <= n; nn+=2) {
+		np1 = nn + 1;
+		mulval = np1;
+		divval = 1;
+		combval = 1;
+		sum = 1 - np1 / 2;
+		for (i = 2; i < np1; i+=2) {
+			combval = combval * mulval-- / divval++;
+			combval = combval * mulval-- / divval++;
+			sum += combval * Bn[i];
+		}
+		Bn[nn] = -sum / np1;
+	}
+	Bnmax = n;
+	return Bn[n];
+*/
+	return bernoulli(n);
+}

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.2 $
+ * @(#) $Id: bigprime.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+# @(#) $Id: bindings,v 29.2 2000/06/07 14:02:25 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://www.isthe.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/chi.cal

@@ -0,0 +1,251 @@
+/*
+ * chi - chi^2 probabilities with degrees of freedom for null hypothesis
+ *
+ * Copyright (C) 2001  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.2 $
+ * @(#) $Id: chi.cal,v 29.2 2001/04/08 10:21:23 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/chi.cal,v $
+ *
+ * Under source code control:	2001/03/27 14:10:11
+ * File existed as early as:	2001
+ *
+ * chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+
+/*
+ * Z(x)
+ *
+ * From Handbook of Mathematical Functions
+ *	10th printing, Dec 1972 with corrections
+ *	National Bureau of Standards
+ *
+ * Section 26.2.1, p931.
+ */
+define Z(x, eps_term)
+{
+    local eps;		/* error term */
+
+    /* obtain the error term */
+    if (isnull(eps_term)) {
+    	eps = epsilon();
+    } else {
+	eps = eps_term;
+    }
+
+    /* compute Z(x) value */
+    return exp(-x*x/2, eps) / sqrt(2*pi(eps), eps);
+}
+
+
+/*
+ * P(x[, eps]) asymtotic P(x) expansion for x>0 to an given epsilon error term
+ *
+ * NOTE: If eps is omitted, the stored epsilon value is used.
+ *
+ * From Handbook of Mathematical Functions
+ *	10th printing, Dec 1972 with corrections
+ *	National Bureau of Standards
+ *
+ * 26.2.11, p932:
+ *
+ *	P(x) = 1/2 + Z(x) * sum(n=0; n < infinity){x^(2*n+1)/(1*3*5*...(2*n+1)};
+ *
+ * We continue the fraction until it is less than epsilon error term.
+ *
+ * Also note 26.2.5:
+ *
+ *	P(x) + Q(x) = 1
+ */
+define P(x, eps_term)
+{
+    local eps;		/* error term */
+    local s;		/* sum */
+    local x2;		/* x^2 */
+    local x_term;	/* x^(2*r+1) */
+    local odd_prod;	/* 1*3*5* ... */
+    local odd_term;	/* next odd value to multiply into odd_prod */
+    local term;		/* the recent term added to the sum */
+
+    /* obtain the error term */
+    if (isnull(eps_term)) {
+    	eps = epsilon();
+    } else {
+	eps = eps_term;
+    }
+
+    /* firewall */
+    if (x <= 0) {
+	if (x == 0) {
+	    return 0;	/* hack */
+	} else {
+	    quit "Q(x[,eps]) 1st argument must be >= 0";
+	}
+    }
+    if (eps <= 0) {
+	quit "Q(x[,eps]) 2nd argument must be > 0";
+    }
+
+    /*
+     * aproximate sum(n=0; n < infinity){x^(2*n+1)/(1*3*5*...(2*n+1)}
+     */
+    x2 = x*x;
+    x_term = x;
+    s = x_term;	/* 1st term */
+    odd_term = 1;
+    odd_prod = 1;
+    do {
+
+	/* compute the term */
+	odd_term += 2;
+	odd_prod *= odd_term;
+	x_term *= x2;
+	term = x_term / odd_prod;
+	s += term;
+
+    } while (term >= eps);
+
+    /* apply term and factor */
+    return 0.5 + Z(x,eps)*s;
+}
+
+
+/*
+ * chi_prob(chi_sq, v[, eps]) -  Prob of >= chi^2 with v degrees of freedom
+ *
+ *    Computes the Probability, given the Null Hypothesis, that a given
+ *    Chi squared values >= chi_sq with v degrees of freedom.
+ *
+ *    The chi_prob() function does not work well with odd degrees of freedom.
+ *    It is reasonable with even degrees of freedom, although one must give
+ *    a sifficently small error term as the degress gets large (>100).
+ *
+ * NOTE: This function does not work well with odd degrees of freedom.
+ *	 Can somebody help / find a bug / provide a better method of
+ *	 this odd degrees of freedom case?
+ *
+ * NOTE: This function works well with even degrees of freedom.  However
+ *	 when the even degrees gets large (say, as you approach 100), you
+ *	 need to increase your error term.
+ *
+ * From Handbook of Mathematical Functions
+ *	10th printing, Dec 1972 with corrections
+ *	National Bureau of Standards
+ *
+ * Section 26.4.4, p941:
+ *
+ *   For odd v:
+ *
+ *	Q(chi_sq, v) = 2*Q(chi) + 2*Z(chi) * (
+ *		     sum(r=1, r<=(r-1)/2) {(chi_sq^r/chi) / (1*3*5*...(2*r-1)});
+ *
+ *	chi = sqrt(chi_sq)
+ *
+ *	NOTE: Q(x) = 1-P(x)
+ *
+ * Section 26.4.5, p941.
+ *
+ *   For even v:
+ *
+ *	Q(chi_sq, v) = sqrt(2*pi()) * Z(chi) * ( 1 +
+ *		       sum(r=1, r=((v-2)/2)) { chi_sq^r / (2*4*...*(2r)) } );
+ *
+ *	chi = sqrt(chi_sq)
+ *
+ * Observe that:
+ *
+ *	Z(x) = exp(-x*x/2) / sqrt(2*pi());	(Section 26.2.1, p931)
+ *
+ * and thus:
+ *
+ *	sqrt(2*pi()) * Z(chi) =
+ *	sqrt(2*pi()) * Z(sqrt(chi_sq)) =
+ *	sqrt(2*pi()) * exp(-sqrt(chi_sq)*sqrt(chi_sq)/2) / sqrt(2*pi()) =
+ *	exp(-sqrt(chi_sq)*sqrt(chi_sq)/2) =
+ *	exp(-sqrt(-chi_sq/2)
+ *
+ * So:
+ *
+ *	Q(chi_sq, v) = exp(-sqrt(-chi_sq/2) * ( 1 + sum(....){...} );
+ */
+define chi_prob(chi_sq, v, eps_term)
+{
+    local eps;		/* error term */
+    local r;		/* index in finite sum */
+    local r_lim;	/* limit value for r */
+    local s;		/* sum */
+    local d;		/* demoninator (2*4*6*... or 1*3*5...) */
+    local chi_term;	/* chi_sq^r */
+    local ret;		/* return value */
+
+    /* obtain the error term */
+    if (isnull(eps_term)) {
+	eps = epsilon();
+    } else {
+	eps = eps_term;
+    }
+
+    /*
+     * odd degrees of freedom
+     */
+    if (isodd(v)) {
+
+	local chi;		/* sqrt(chi_sq) */
+
+	/* setup for sum */
+	s = 1;
+	d = 1;
+	chi = sqrt(abs(chi_sq), eps);
+	chi_term = chi;
+	r_lim = (v-1)/2;
+
+	/* compute sum(r=1, r=((v-1)/2)) {(chi_sq^r/chi) / (1*3*5...*(2r-1))} */
+	for (r=2; r <= r_lim; ++r) {
+	    chi_term *= chi_sq;
+	    d *= (2*r)-1;
+	    s += chi_term/d;
+	}
+
+	/* apply term and factor, Q(x) = 1-P(x) */
+	ret = 2*(1-P(chi)) + 2*Z(chi)*s;
+
+    /*
+     * even degrees of freedom
+     */
+    } else {
+
+	/* setup for sum */
+	s =1;
+	d = 1;
+	chi_term = 1;
+	r_lim = (v-2)/2;
+
+	/* compute sum(r=1, r=((v-2)/2)) { chi_sq^r / (2*4*...*(2r)) } */
+	for (r=1; r <= r_lim; ++r) {
+	    chi_term *= chi_sq;
+	    d *= r*2;
+	    s += chi_term/d;
+	}
+
+	/* apply factor - see observation in the main comment above */
+	ret = exp(-chi_sq/2, eps) * s;
+    }
+
+    return ret;
+}

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.2 $
+ * @(#) $Id: chrem.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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,7 +201,7 @@ define chrem()
     }
 }
 
-if (config("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.4 $
+ * @(#) $Id: deg.cal,v 29.4 2003/01/26 19:32:41 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 obj dms {deg, min, sec};
 
 define dms(deg, min, sec)
@@ -20,7 +42,7 @@ define dms(deg, min, sec)
 	ans.deg = deg;
 	ans.min = min;
 	ans.sec = sec;
-	fixdms(&ans);
+	fixdms(ans);
 	return ans;
 }
 
@@ -44,7 +66,7 @@ define dms_add(a, b)
 		ans.sec += b.sec;
 	} else
 		ans.deg += b;
-	fixdms(&ans);
+	fixdms(ans);
 	return ans;
 }
 
@@ -53,9 +75,9 @@ define dms_neg(a)
 {
 	local obj dms	ans;
 
-	ans.deg = -ans.deg;
-	ans.min = -ans.min;
-	ans.sec = -ans.sec;
+	ans.deg = -a.deg;
+	ans.min = -a.min;
+	ans.sec = -a.sec;
 	return ans;
 }
 
@@ -81,7 +103,7 @@ define dms_mul(a, b)
 		ans.min = b.min * a;
 		ans.sec = b.sec * a;
 	}
-	fixdms(&ans);
+	fixdms(ans);
 	return ans;
 }
 
@@ -111,6 +133,6 @@ define fixdms(a)
 	a.deg %= 360;
 }
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
     print "obj dms {deg, min, sec} defined";
 }

cal/dotest.cal

@@ -0,0 +1,193 @@
+/*
+ * dotest - test truth statements found in line tests of dotest_testline file
+ *
+ * This file was created by Ernest Bowen <ebowen at une dot edu dot au>
+ * and modified by Landon Curt Noll.
+ *
+ * This dotest_code has been placed in the public domain.  Please do not
+ * copyright this dotest_code.
+ *
+ * ERNEST BOWEN AND 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.
+ *
+ * @(#) $Revision: 29.2 $
+ * @(#) $Id: dotest.cal,v 29.2 2006/05/21 00:55:27 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/dotest.cal,v $
+ *
+ * This file is not covered under version 2.1 of the GNU LGPL.
+ *
+ * Under source dotest_code control:	2006/03/08 05:54:09
+ * File existed as early as:	2006
+ */
+
+
+/*
+ * dotest - perform tests from dotest_testline file
+ *
+ * given:
+ *	dotest_file	filename containing single test lines
+ *	dotest_code	regress.cal test number to use (def: 0)
+ *	dotest_maxcond	max error conditions allowed (def: <0 ==> 2^31-1)
+ *
+ * returns:
+ *	number of line test failures
+ *
+ * NOTE: All variables used by the dotest() function start with "dotest_".
+ *	 The dotest_file and dotest_read should not use any variable
+ *	 that starts with "dotest_".
+ */
+define dotest(dotest_file, dotest_code = 0, dotest_maxcond = -1)
+{
+    local dotest_f_file;	/* open file containing test lines */
+    local dotest_testline;	/* test line */
+    local dotest_testeval;	/* eval value from dotest_testline test line */
+    local dotest_tmperrcnt;	/* temp error count after line test */
+    local dotest_errcnt;	/* total number of errors */
+    local dotest_failcnt;	/* number of line tests failed */
+    local dotest_testnum;	/* number of test lines evaluated */
+    local dotest_linenum;	/* test line number */
+    local dotest_old_errmax;	/* value of errmax() prior to calling */
+    local dotest_old_errcount;	/* value of errcount() prior to calling */
+
+    /*
+     * preserve calling stats
+     */
+    dotest_old_errmax = errmax();
+    dotest_old_errcount = errcount(0);
+
+    /*
+     * initialize test accounting
+     */
+    dotest_errcnt = errcount();
+    dotest_failcnt = 0;
+    dotest_testnum = 0;
+    dotest_linenum = 0;
+
+    /*
+     * setup error accounting for dotest
+     */
+    if (dotest_maxcond >= 0 && dotest_maxcond < 2147483647) {
+	    errmax(dotest_maxcond + dotest_old_errcount + 1),;
+    } else {
+	    errmax(2147483647),;
+    }
+
+    /*
+     * open the test line file
+     */
+    printf("%d-: opening line file: %d", dotest_code, dotest_file);
+    dotest_f_file = fpathopen(dotest_file, "r");
+    if (!isfile(dotest_f_file)) {
+	printf("**** Unable to file or open file \"%s\"\n",
+		dotest_file);
+	quit;
+    }
+    printf('%d: testing "%s"\n', dotest_code, dotest_file);
+
+    /*
+     * perform dotest_testline test on each line of the file
+     */
+    for (;;) {
+
+	/* get the next test line */
+	dotest_testline = fgets(dotest_f_file);
+	++dotest_linenum;
+	if (iserror(dotest_testline)) {
+	    quit "**** Error while reading file";
+	} else if (isnull(dotest_testline)) {
+	    /* EOF - end of test file */
+	    break;
+	}
+
+	/* skip empty lines */
+	if (dotest_testline == "\n") {
+	    continue;
+	}
+
+	/* evaluate the test line */
+	dotest_testeval = eval(dotest_testline);
+
+	/* ignore white space or comment lines */
+	if (isnull(dotest_testeval)) {
+	    continue;
+	}
+
+	/* look for test line parse errors */
+	if (iserror(dotest_testeval)) {
+	    printf("**** evaluation error: ");
+	    ++dotest_failcnt;
+
+	/* look for test line dotest_failcnt */
+	} else if (dotest_testeval != 1) {
+	    printf("**** did not return 1: ");
+	    ++dotest_failcnt;
+	}
+
+	/* show the test line we just performed */
+	printf("%d-%d: %s", dotest_code, dotest_linenum, dotest_testline);
+
+	/* error accounting */
+	dotest_tmperrcnt = errcount() - dotest_errcnt;
+	if (dotest_tmperrcnt > 0) {
+
+	    /* report any other errors */
+	    if (dotest_tmperrcnt > 1) {
+		printf("%d-%d: NOTE: %d error conditions(s): %s\n",
+		    dotest_code, dotest_linenum, dotest_tmperrcnt);
+	    }
+
+	    /* report the calc error string */
+	    printf("%d-%d: NOTE: last error string: %s\n",
+	        dotest_code, dotest_linenum, strerror());
+
+	    /* new error count level */
+	    dotest_errcnt = errcount();
+	    if (dotest_maxcond >= 0 &&
+	        dotest_old_errcount-dotest_errcnt > dotest_maxcond) {
+		printf("%d-%d: total error conditions: %d > %d\n",
+		       dotest_code, dotest_linenum,
+		       dotest_maxcond, dotest_old_errcount-dotest_errcnt);
+	    }
+	}
+    }
+
+    /*
+     * test the close of the line file
+     */
+    printf("%d-: detected %d error condition(s), many of which may be OK\n",
+    	   dotest_code, dotest_old_errcount-dotest_errcnt);
+    printf("%d-: closing line file: %d\n", dotest_code, dotest_file);
+    fclose(dotest_f_file);
+
+    /*
+     * test line file accounting
+     */
+    if (dotest_failcnt > 0) {
+	printf("**** %d-: %d test failure(s) in %d line(s)\n",
+	    dotest_code, dotest_failcnt, dotest_linenum);
+    } else {
+	printf("%d-: no failure(s) in %d line(s)\n",
+	    dotest_code, dotest_linenum);
+    }
+
+    /*
+     * preppare to return to the caller environment
+     *
+     * We increase the caller's error count by the number
+     * of line tests that failed, not the number of internal
+     * errors that were noted.
+     */
+    errmax(dotest_old_errmax),;
+    errcount(dotest_old_errcount + dotest_failcnt),;
+
+    /*
+     * All Done!!! -- Jessica Noll, Age 2
+     */
+    return dotest_failcnt;
+}

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.3 $
+ * @(#) $Id: ellip.cal,v 29.3 2006/03/07 22:16:25 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://www.isthe.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
@@ -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 */
@@ -115,7 +141,7 @@ define point_mul(p1, p2)
 	if (p2 == 1)
 		return p1;
 	if (p1 == p2)
-		return point_square(&p1);
+		return point_square(`p1);
 	obj point r;
 	m = (minv(p2.x - p1.x, N) * (p2.y - p1.y)) % N;
 	if (m == 0) {
@@ -159,9 +185,9 @@ define point_pow(p, pow)
 		r = p;
 	t = p;
 	for (bit = 2; ((bit <= pow) && (f == 0)); bit <<= 1) {
-		t = point_square(&t);
+		t = point_square(`t);
 		if (bit & pow)
-			r = point_mul(&t, &r);
+			r = point_mul(`t, `r);
 	}
 	return r;
 }

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.2 $
+ * @(#) $Id: hello.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * See: http://www.latech.edu/~acm/helloworld/calc.html
+ */
+
+
+while(1) print "Hello World!";

cal/intfile.cal

@@ -0,0 +1,222 @@
+/*
+ * intfile - integer to file and file to integer conversion
+ *
+ * Copyright (C) 2001  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.5 $
+ * @(#) $Id: intfile.cal,v 29.5 2001/04/10 22:09:34 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/intfile.cal,v $
+ *
+ * Under source code control:   2001/03/31 08:13:11
+ * File existed as early as:    2001
+ *
+ * chongo <was here> /\oo/\     http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)        http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+
+/*
+ * NOTE: Because leading HALF values are trimmed from integer, a file
+ *	 that begins with lots of 0 bits (in the case of big endian)
+ *	 or that ends with lots of 0 bits (in the case of little endian)
+ *	 will be changed when the subsequent integer is written back.
+ */
+
+
+/*
+ * file2be - convert a file into an big endian integer
+ *
+ * given:
+ *	filename	filename to read
+ *
+ * returns:
+ *	integer read from its contents on big endian order
+ */
+define file2be(filename)
+{
+    local fd;	/* open file */
+    local ret;	/* integer to return */
+    local c;	/* character read from the file */
+    local i;
+
+    /*
+     * open the file for reading
+     */
+    fd = fopen(filename, "rb");
+    if (!isfile(fd)) quit "file2be: cannot open file for reading";
+
+    /*
+     * read the contents of the file
+     *
+     * The first octets become the most significant bits of the integer.
+     */
+    ret = 0;
+    while (! isnull(c = fgetc(fd))) {
+	ret <<= 8;
+	ret += ord(c);
+    }
+
+    /*
+     * cleanup and return the integer
+     */
+    fclose(fd);
+    return ret;
+}
+
+
+/*
+ * file2le - convert a file into an little endian integer
+ *
+ * given:
+ *	filename	filename to read
+ *
+ * returns:
+ *	integer read from its contents on little endian order
+ */
+define file2le(filename)
+{
+    local fd;	/* open file */
+    local ret;	/* integer to return */
+    local c;	/* character read from the file */
+    local shft;	/* bit shift for the c value */
+    local i;
+
+    /*
+     * open the file for reading
+     */
+    fd = fopen(filename, "rb");
+    if (!isfile(fd)) quit "file2le: cannot open file for reading";
+
+    /*
+     * read the contents of the file into a string
+     *
+     * The first octets become are the least significant bits of the integer.
+     */
+    ret = 0;
+    shft = 0;
+    while (! isnull(c = fgetc(fd))) {
+	ret |= (ord(c) << shft);
+	shft += 8;
+    }
+
+    /*
+     * cleanup and return the integer
+     */
+    fclose(fd);
+    return ret;
+}
+
+
+/*
+ * be2file - convert a big endian integer into a file
+ *
+ * given:
+ *	v		integer to write to the file
+ *	filename	filename to write
+ *
+ * returns:
+ *	The number of octets written to the file.
+ *
+ * NOTE: The absolute value of the integer is written to the file.
+ */
+define be2file(v, filename)
+{
+    local fd;		/* open file */
+    local octlen;	/* length of v in octets */
+    local i;
+
+    /*
+     * firewall
+     */
+    if (!isint(v)) {
+	quit "be2file: 1st arg not an integer";
+    }
+    v = abs(v);
+
+    /*
+     * open the file for writing
+     */
+    fd = fopen(filename, "wb");
+    if (!isfile(fd)) quit "be2file: cannot open file for writing";
+
+    /*
+     * write the octets to the file
+     *
+     * The most significant bits of the integer become the first file octets.
+     */
+    octlen = int((highbit(v)+8) / 8);
+    for (i=octlen-1; i >= 0; --i) {
+    	fputc(fd, char(v >> (i*8)));
+    }
+
+    /*
+     * cleanup
+     */
+    fclose(fd);
+    return octlen;
+}
+
+
+/*
+ * le2file - convert a little endian integer into a file
+ *
+ * given:
+ *	v		integer to write to the file
+ *	filename	filename to write
+ *
+ * returns:
+ *	The number of octets written to the file.
+ *
+ * NOTE: The absolute value of the integer is written to the file.
+ */
+define le2file(v, filename)
+{
+    local fd;	/* open file */
+    local cnt;	/* octets written */
+
+    /*
+     * firewall
+     */
+    if (!isint(v)) {
+	quit "be2file: 1st arg not an integer";
+    }
+    v = abs(v);
+
+    /*
+     * open the file for writing
+     */
+    fd = fopen(filename, "wb");
+    if (!isfile(fd)) quit "le2file: cannot open file for writing";
+
+    /*
+     * Write the octets to the file.
+     *
+     * The least significant bits of the integer become the first file octets.
+     */
+    cnt = 0;
+    while (v > 0) {
+	fputc(fd, char(v));
+	v >>= 8;
+	++cnt;
+    }
+
+    /*
+     * cleanup
+     */
+    fclose(fd);
+    return cnt;
+}

cal/linear.cal

@@ -0,0 +1,26 @@
+/*
+ * linear - perform a simple two point 2D linear interpolation
+ *
+ * given:
+ *	x0, y0		first known point on the line
+ *	x1, y1		second knonw point on the line
+ *	x		a given point to interpolate on
+ *
+ * returns:
+ *	y such that (x,y) is on the line defined by (x0,y0) and (x1,y1)
+ *
+ * NOTE: The line cannot be vertical.  So x0 != y0.
+ */
+define linear(x0, y0, x1, y1, x)
+{
+    /* firewall */
+    if (!isnum(x0) || ! isnum(y0) || !isnum(x1) || ! isnum(y1) || !isnum(x)) {
+	quit "non-numeric argument passed to linear";
+    }
+    if (x0 == x1) {
+	quit "linear given a line with an infinite slope";
+    }
+
+    /* return y = y0 + (delta_Y/delta_X) * (x - x0) */
+    return y0 + (((y1-y0)/(x1-x0)) * (x - x0));
+}

cal/lucas.cal

@@ -1,29 +1,44 @@
-/*
- * 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.6 $
+ * @(#) $Id: lucas.cal,v 29.6 2002/07/10 09:43:46 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * NOTE: This is a standard calc resource file.  For information on calc see:
+ *
+ *	http://www.isthe.com/chongo/tech/comp/calc/index.html
+ *
+ * To obtain your own copy of calc, see:
+ *
+ *	http://www.isthe.com/chongo/tech/comp/calc/calc-download.html
+ */
+
+/*
  * HISTORICAL NOTE:
  *
  * On 6 August 1989 at 00:53 PDT, the 'Amdahl 6', a team consisting of
@@ -31,28 +46,35 @@
  * 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 31 Dec 1995, this prime was the 3rd
+ * 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
- *	 congratulate the finders and encourage others to try for
- *	 larger finds.  Records were made to be broken afterall!
+ * See:
  *
- * ON GAINING A WORLD RECORD:
+ *	http://www.isthe.com/chongo/tech/math/prime/amdahl6.html
+ *
+ * for more information on the Amdahl 6 group.
+ *
+ * NOTE: Both largest known and largest known twin prime records have been
+ *	 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!
+ */
+
+/* ON GAINING A WORLD RECORD:
  *
  * The routines in calc were designed to be portable, and to work on
  * numbers of 'sane' size.  The Amdahl 6 team used a 'ultra-high speed
@@ -68,7 +90,7 @@
  *
  *	test numbers of the form h*2^n-1
  *	fix a value of n and vary the value h
- *	n mod 128 == 0
+ *	n mod 2^x == 0  for some value of x, say > 7 or more
  *	h*2^n-1 is not divisible by any small prime < 2^40
  *	0 < h < 2^39
  *	h*2^n+1 is not divisible by any small prime < 2^40
@@ -86,7 +108,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,6 +143,7 @@
  * point is beyond the scope of this program.
  */
 
+
 global pprod256;	/* product of  "primes up to 256" / "primes up to 46" */
 
 /*
@@ -129,7 +152,7 @@ global pprod256;	/* product of  "primes up to 256" / "primes up to 46" */
  * 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:
@@ -150,7 +173,7 @@ global pprod256;	/* product of  "primes up to 256" / "primes up to 46" */
  *
  * 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:
  *
@@ -160,9 +183,9 @@ global pprod256;	/* product of  "primes up to 256" / "primes up to 46" */
  *
  * 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:
@@ -176,9 +199,9 @@ global pprod256;	/* product of  "primes up to 256" / "primes up to 46" */
  * as 2^39).
  *
  * 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*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,
+ *	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
@@ -224,7 +247,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;
@@ -235,13 +258,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;
 	}
@@ -348,7 +371,7 @@ 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
@@ -558,14 +581,14 @@ gen_u0(h, n, 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
@@ -668,7 +691,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:
@@ -721,7 +744,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:
@@ -734,14 +757,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:
@@ -762,7 +785,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:
@@ -777,7 +800,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:
  *
@@ -829,7 +852,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:
@@ -844,7 +867,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:
  *
@@ -852,7 +875,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:
  *
@@ -891,7 +914,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
  *
@@ -900,7 +923,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.
  *
  ***
@@ -968,28 +991,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
@@ -1024,7 +1047,7 @@ gen_v1(h, n)
 define
 ldebug(funct, str)
 {
-	if (config("lib_debug") > 0) {
+	if (config("resource_debug") & 8) {
 		print "DEBUG:", funct:":", str;
 	}
 	return;

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.3 $
+ * @(#) $Id: lucas_chk.cal,v 29.3 2001/03/31 13:31:34 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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 (config("lib_debug") > 0) {
+			if (config("resource_debug") & 8) {
 				print "h>=2^n skip:", h_p[i]:"*2^":n_p[i]:"-1";
 			}
 			continue;

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.2 $
+ * @(#) $Id: lucas_tbl.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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.2 $
+ * @(#) $Id: mersenne.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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

@@ -1,28 +1,33 @@
 /*
- * Copyright (c) 1997 Landon Curt Noll
+ * mfactor - return the lowest factor of 2^n-1, for n > 0
  *
- * 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.2 $
+ * @(#) $Id: mfactor.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
-
 /*
  * hset method
  *
@@ -61,10 +66,10 @@
  *	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)
+ * 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[].
+ * 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.
  *
@@ -80,22 +85,22 @@
  *
  * 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)
+ *	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)
+ *	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
@@ -121,7 +126,7 @@
  *
  * We know that factors of a Mersenne number are of the form:
  *
- *	2*k*n+1   and   +/- 1 mod 8
+ *	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.
@@ -137,7 +142,7 @@
  *
  * 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.
+ *	 uses less memory and has a shorter startup time.
  */
 define mfactor(n, start_k, rept_loop, p_elim)
 {
@@ -309,6 +314,6 @@ define mfactor(n, start_k, rept_loop, p_elim)
 	return q;
 }
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
 	print "mfactor(n [, start_k=1 [, rept_loop=10000 [, p_elim=17]]])"
 }

cal/mod.cal

@@ -1,12 +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.
+ * 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.2 $
+ * @(#) $Id: mod.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 obj mod {a};			/* definition of the object */
 
 global mod_value = 100;		/* modulus value (value of N) */
@@ -159,9 +180,9 @@ 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 = lmod(a);
 	if (isnum(b))
@@ -189,7 +210,7 @@ define mod_pow(a, b)
 }
 
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
     print "obj mod {a} defined";
     print "mod_value defined";
     print "set mod_value as needed";

cal/natnumset.cal

@@ -1,10 +1,32 @@
 /*
- * Copyright (c) 1997 Ernest Bowen
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * natnumset - functions for sets of natural numbers not exceeding a fixed bound
  *
- * 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.3 $
+ * @(#) $Id: natnumset.cal,v 29.3 2006/05/01 19:19:46 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://www.isthe.com/chongo/tech/comp/calc/
  */
+
 /*
  * Functions for sets of natural numbers not exceeding a fixed bound B.
  *
@@ -62,9 +84,9 @@
  *	!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
+ *	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:
  *
@@ -449,7 +471,7 @@ 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");
+	static tail = "\0\1\3\7\17\37\77\177\377";
 
 	if (!isint(a) || !isint(b))
 		quit "Non-integer argument for interval";

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.2 $
+ * @(#) $Id: pell.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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-2004  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.5 $
+ * @(#) $Id: pi.cal,v 29.5 2004/02/23 14:04:01 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://www.isthe.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.2 $
+ * @(#) $Id: pix.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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.2 $
+ * @(#) $Id: pollard.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: poly.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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,6 +718,6 @@ a=pol(1,4,4,2,3,1);
 b=pol(5,16,8,1);
 c=pol(1+2i,3+4i,5+6i);
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
 	print "obj poly {p} 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.2 $
+ * @(#) $Id: prompt.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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;

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.2 $
+ * @(#) $Id: psqrt.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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,90 @@
+/*
+ * qtime - Display time as English sentence
+ *
+ * Copyright (C) 1999  Klaus Alexander Seistrup and Landon Curt Noll
+ *
+ * Written by: Klaus Alexander Seistrup <kseis@magnetic-ink.dk>
+ * With mods by: Landon Curt Noll <http://www.isthe.com/chongo/>
+ *
+ * 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.4 $
+ * @(#) $Id: qtime.cal,v 29.4 2000/12/18 10:18:40 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/qtime.cal,v $
+ *
+ * Under source code control:	1999/10/13 04:10:33
+ * File existed as early as:	1999
+ *
+ * chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+/*
+ * usage:
+ *	qtime(utc_hr_offset)
+ *
+ *	utc_hr_offset	Offset from UTC in hours.
+ *
+ * See:
+ *	http://www.magnetic-ink.dk/download/qtime.html
+ *
+ * for examples of qtime() written on other languages.
+ */
+
+
+/*
+ * 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.2 $
+ * @(#) $Id: quat.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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,6 +221,6 @@ define quat_shift(a, b)
 	return x.s;
 }
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
     print "obj quat {s, v} defined";
 }

cal/randbitrun.cal

@@ -1,30 +1,38 @@
 /*
  * 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.2 $
+ * @(#) $Id: randbitrun.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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;
 	    }

cal/randmprime.cal

@@ -1,29 +1,34 @@
 /*
  * randmprime - generate a random prime of the form h*2^n-1
  *
- * Copyright (c) 1997 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.2 $
+ * @(#) $Id: randmprime.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 /* obtain our required libs */
 read -once "lucas.cal"
 
@@ -61,7 +66,7 @@ randmprime(bits, seed, dbg)
 	bits = 1;
     }
     if (param(0) == 2 || dbg < 0) {
-    	dbg = 0;
+	dbg = 0;
     }
 
     /* seed generator */
@@ -93,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";

cal/randombitrun.cal

@@ -1,30 +1,38 @@
 /*
  * 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.2 $
+ * @(#) $Id: randombitrun.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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.
  */
-/*
- * Copyright 1997 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 randombitrun(run_cnt)
 {
@@ -36,7 +44,7 @@ define randombitrun(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 randombitrun(run_cnt)
 	/* look for a run break */
 	if (current != last) {
 
-	    /*  record the stats */
+	    /*	record the stats */
 	    if (run > max_run) {
 		max_run = run;
 	    }

cal/randomrun.cal

@@ -1,6 +1,34 @@
 /*
  * 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.2 $
+ * @(#) $Id: randomrun.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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 +41,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 1997 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 randomrun(run_cnt)
 {
@@ -45,7 +53,7 @@ define randomrun(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 +94,7 @@ define randomrun(run_cnt)
 	/* look for a run break */
 	if (current < last) {
 
-	    /*  record the stats */
+	    /*	record the stats */
 	    if (run > max_run) {
 		max_run = 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.2 $
+ * @(#) $Id: randrun.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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,6 +129,6 @@ define randrun(run_cnt)
     printf("max length=%d\n", max_run);
 }
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
     print "randrun([run_length]) defined";
 }

cal/repeat.cal

@@ -0,0 +1,53 @@
+/*
+ * repeat - return the value of a repeated set of digits
+ *
+ * Copyright (C) 2003  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.4 $
+ * @(#) $Id: repeat.cal,v 29.4 2003/01/26 19:42:03 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/repeat.cal,v $
+ *
+ * Under source code control:	2003/01/05 00:00:01
+ * File existed as early as:	2003
+ *
+ * chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+
+/*
+ * repeat - return the value of a repeated set of digits
+ *
+ * usage:
+ *	repeat(digit_set, repeat_count)
+ */
+define repeat(digit_set, repeat_count)
+{
+    local digit_count;	/* digits in the digit_set */
+
+    /* firewall */
+    if (!isint(digit_set) || digit_set <= 0) {
+	quit "digit set must be an integer > 0";
+    }
+    if (!isint(repeat_count) || repeat_count <= 0) {
+	quit "repeat count must be an integer > 0";
+    }
+
+    /* return repeated set of digits */
+    digit_count = digits(digit_set);
+    return digit_set * (10^(digit_count*repeat_count)-1) / (10^digit_count-1);
+}

cal/screen.cal

@@ -0,0 +1,61 @@
+/*
+ * screen - ANSI control sequences
+ *
+ * This file was created by Ernest Bowen <ebowen at une dot edu dot au>.
+ *
+ * This code has been placed in the public domain.  Please do not
+ * copyright this code.
+ *
+ * ERNEST BOWEN 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.
+ *
+ * @(#) $Revision: 29.2 $
+ * @(#) $Id: screen.cal,v 29.2 2006/05/01 19:21:18 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/screen.cal,v $
+ *
+ * This file is not covered under version 2.1 of the GNU LGPL.
+ *
+ * Under source code control:	2006/03/08 05:54:09
+ * File existed as early as:	2006
+ */
+
+up = CUU ="\e[A";
+down = CUD = "\e[B}";
+forward = CUF = "\e[C";
+back = CUB = "\e[D";
+save = SCP = "\e[s";
+restore = RCP = "\e[u";
+cls = "\e[2J";
+home = "\e[F";
+eraseline = "\e[K";
+off = "\e[0m";
+bold = "\e[1m";
+faint = "\e[2m";
+italic = "\e[3m";
+blink = "\e[5m";
+rapidblink = "\e[6m";
+reverse = "\e[7m";
+concealed = "\e[8m";
+/* Lowercase indicates foreground, uppercase background" */
+black = "\e[30m";
+red = "\e[31m";
+green = "\e[32m";
+yellow = "\e[33m";
+blue = "\e[34m";
+magenta = "\e[35m";
+cyan = "\e[36m";
+white = "\e[37m";
+Black = "\e[40m";
+Red = "\e[41m";
+Green = "\e[42m";
+Yellow = "\e[43m";
+Blue = "\e[44m";
+Magenta = "\e[45m";
+Cyan = "\e[46m";
+White = "\e[47m";

cal/seedrandom.cal

@@ -1,32 +1,35 @@
-/*
- * Copyright (c) 1996 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
- */
-
 /*
  * seedrandom - seed the cryptographically strong Blum generator
  *
+ * Copyright (C) 1999  Landon Curt Noll
  *
- * The period of a  Blum generators with modulus 'n=p*q' (where p and
+ * 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: seedrandom.cal,v 29.3 2001/03/31 13:31:34 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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)
@@ -50,14 +53,16 @@
  * 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 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 sq;		/* min bit size of q */
 	local n;		/* Blum modulus */
 	local binsize;		/* smallest power of 2 > n=p*q */
 	local r;		/* initial quadratic residue */
@@ -110,7 +115,7 @@ define seedrandom(seed1, seed2, size, trials)
 			p = 2*fp+1;
 		} while (ptest(p,1,0) == 0);
 	} while(ptest(p, trials) == 0 || ptest(fp, trials) == 0);
-	if (config("lib_debug") > 0) {
+	if (config("resource_debug") & 8) {
 		print "/* 1st Blum prime */ p=", p;
 	}
 
@@ -124,7 +129,7 @@ define seedrandom(seed1, seed2, size, trials)
 			q = 2*fq+1;
 		} while (ptest(q,1,0) == 0);
 	} while(ptest(q, trials) == 0 || ptest(fq, trials) == 0);
-	if (config("lib_debug") > 0) {
+	if (config("resource_debug") & 8) {
 		print "/* 2nd Blum prime */ q=", q;
 	}
 
@@ -132,9 +137,9 @@ define seedrandom(seed1, seed2, size, trials)
 	 * seed the Blum generator
 	 */
 	n = p*q;				/* the Blum modulus */
- 	binsize = highbit(n)+1;			/* smallest power of 2 > p*q */
+	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("lib_debug") >= 0) {
+	if (config("resource_debug") & 8) {
 		print "/* seed quadratic residue */ r=", r;
 		print "/* newn", binsize, "bit quadratic residue*/ newn=", n;
 	}
@@ -151,6 +156,6 @@ define seedrandom(seed1, seed2, size, trials)
 	return old_state;
 }
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
     print "seedrandom(seed1, seed2, size [, trials]) defined";
 }

cal/set8700.cal

@@ -0,0 +1,72 @@
+/*
+ * set8700 - environment for dotest line tests for the 8700 set of regress.cal
+ *
+ * Copyright (C) 2006  Ernest Bowen 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: set8700.cal,v 29.1 2006/05/20 19:35:33 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/set8700.cal,v $
+ *
+ * Under source code control:	2006/05/20 14:10:11
+ * File existed as early as:	2006
+ *
+ * chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+ */
+
+
+/*
+ * setup global variables for dotest() to use with set8700.set
+ */
+
+global set8700_A;
+global set8700_B;
+global set8700_M;
+global set8700_M1;
+global set8700_M2;
+global set8700_L;
+global set8700_L1;
+global set8700_L2;
+global set8700_O;
+global set8700_P;
+global set8700_P1;
+global set8700_P2;
+global set8700_Q;
+global set8700_R;
+global set8700_S;
+global set8700_X;
+global set8700_Y;
+global set8700_x;
+global set8700_y;
+
+define set8700_getA1() = set8700_A;
+
+define set8700_getA2() { return set8700_A; }
+
+define set8700_getvar() {local a = 42; protect(a,256); return a;}
+
+define set8700_f(set8700_x) = set8700_x^2;
+
+define set8700_g(set8700_x)
+{
+    if (isodd(set8700_x)) protect(set8700_x, 256);
+    return set8700_x;
+}
+
+obj set8700_point {
+	set8700_x, set8700_y, set8700_z
+}

cal/set8700.line

@@ -0,0 +1,405 @@
+##
+## set8700 - dotest line tests for the 8700 set of regress.cal
+##
+## Copyright (C) 2006  Ernest Bowen 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: set8700.line,v 29.1 2006/05/20 19:35:33 chongo Exp $
+## @(#) $Source: /usr/local/src/cmd/calc/cal/RCS/set8700.line,v $
+##
+## Under source code control:	2006/05/20 14:10:11
+## File existed as early as:	2006
+##
+## chongo <was here> /\oo/\	http://www.isthe.com/chongo/
+## Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
+
+
+strcpy("", "") == ""
+strcpy("", "xyz") == ""
+strcpy("a", "xyz") == "x"
+strcpy("ab", "xyz") == "xy"
+strcpy("abc", "xyz") == "xyz"
+strcpy("abcd", "xyz") == "xyz\0"  ## Result will print as "xyz"
+strcpy("abcde", "xyz") == "xyz\0e"
+strcpy("abcdef", "xyz") == "xyz\0ef"
+strcpy("abcdef", "x\0z") == "x\0z\0ef" ## Note z is copied
+strcpy("abc", "") == "\0bc"
+
+strncpy("abcdef", "xyz", 0) == "abcdef" ## No characters copied
+strncpy("abcdef", "xyz", 1) == "xbcdef" ## One character copied, no '\0'
+strncpy("abcdef", "xyz", 2) == "xycdef"
+strncpy("abcdef", "xyz", 3) == "xyzdef"
+strncpy("abcdef", "xyz", 4) == "xyz\0ef"
+strncpy("abcdef", "xyz", 5) == "xyz\0\0f" ## Two nulls as in C
+strncpy("abcdef", "xyz", 6) == "xyz\0\0\0"
+strncpy("abcdef", "xyz", 7) == "xyz\0\0\0" ## Size of first string unchanged
+strncpy("a\0cdef", "\0yz", 4) == "\0yz\0ef"
+strncpy("ab", "xyz", 3) == "xy"
+
+strcmp("", "") == 0
+strcmp("", "a") == -1
+strcmp("\n", "\n") == 0
+strcmp("\0", "") == 1		## '\0' treated like other characters
+strcmp("ab", "") == 1
+strcmp("ab", "a") == 1
+strcmp("ab", "ab") == 0
+strcmp("ab", "abc") == -1
+strcmp("abc", "abb") == 1
+strcmp("abc", "abc") == 0
+strcmp("abc", "abd") == -1
+strcmp("abc\0", "abc") == 1
+
+strncmp("abc", "xyz", 0) == 0
+strncmp("abc", "xyz", 1) == -1
+strncmp("abc", "", 1) == 1
+strncmp("abc", "a", 1) == 0
+strncmp("", "", 2) == 0
+strncmp("a", "a", 2) == 0
+strncmp("a", "b", 2) == -1
+strncmp("ab", "ab", 2) == 0
+strncmp("ab", "ac", 2) == -1
+strncmp("\0ac", "\0b", 2) == -1
+strncmp("ab", "abc", 2) == 0
+strncmp("abc", "abd", 2) == 0
+strncmp("a", "a\0", 2) == -1
+strncmp("a", "a", 3) == 0
+strncmp("abc", "abd", 3) == -1
+strncmp("\0\0\n", "\0\0\t", 3) == 1
+
+str("abc") == "abc"
+str("ab\0") == "ab"
+str("a\0c") == "a"
+str("\0bc") == ""
+
+size("") == 0
+size("a") == 1
+size("\0") == 1
+size("a\0") == 2
+size("a\0b") == 3
+
+strlen("\0") == 0
+strlen("a\0") == 1
+strlen("a\0b") == 1
+
+0 * "abc" == ""
+1 * "abc" == "abc"
+2 * "abc" == "abcabc"
+3 * "abc" == "abcabcabc"
+1 * "" == ""
+-1 * "abc" == "cba"
+-2 * "abc" == "cbacba"
+"abc" + "xyz" == "abcxyz"
+"abc" - "xyz" == "abczyx"
+
+
+substr("abcd",0,0) == ""
+substr("abcd",0,1) == "a"
+substr("abcd",0,2) == "ab"
+substr("abcd",1,0) == ""
+substr("abcd",1,1) == "a"
+substr("abcd",1,2) == "ab"
+substr("abcd",2,0) == ""
+substr("abcd",2,1) == "b"
+substr("abcd",2,2) == "bc";
+substr("abcd",2,3) == "bcd";
+substr("abcd",2,4) == "bcd";
+substr("abcd",2,5) == "bcd"; ## substr stops at end of string
+substr("abcd",4,0) == ""
+substr("abcd",4,1) == "d"
+substr("abcd",4,2) == "d"
+substr("abcd",4,3) == "d"
+substr("abcd",5,0) == ""
+substr("abcd",5,1) == ""
+substr("a\0c\0",2,2) == "\0c"  ## '\0' treated like other characters
+substr("a\0c\0",2,3) == "\0c\0"
+
+#"" == 0	## # operator counts number of bits
+#"\0" == 0
+# "a" == 3
+   #	  "ab" == 6	## white space ignored
+# "abc" == 10
+# 27 == 4
+# 0b1010111011 == 7
+
+7 # 9 == 2		## 7 # 9 = abs(7 - 9)
+3/4 # 2/3 == 1/12
+
+a = 5, a #= 2, a == 3
+a #= 4, a == 1
+
+## Binary # operator not defined for strings
+
+global set8700_A; protect(set8700_A) == 0
+## Testing with one lvalue
+isnull(protect(set8700_A,65))
+protect(set8700_A) == 65
+isnull(protect(set8700_A, -1))
+protect(set8700_A) == 64
+protect(set8700_A,-2), protect(set8700_A) == 64
+protect(set8700_A,5), protect(set8700_A) == 69
+protect(set8700_A,-4), protect(set8700_A) == 65
+protect(set8700_A,0), protect(set8700_A) == 0
+protect(set8700_A,1234), protect(set8700_A) == 1234
+protect(set8700_A,-1234), protect(set8700_A) == 0
+protect(set8700_A,65535), protect(set8700_A) == 65535
+protect(set8700_A,-65535), protect(set8700_A) == 0
+
+## Simple assignments
+set8700_A = 42, protect(set8700_A,1024), set8700_B = set8700_A, protect(set8700_B) == 1024
+set8700_A = 6 * 7, protect(set8700_A) == 1024
+set8700_A == set8700_B
+
+## Testing matrix protectioon
+set8700_A = mat [3] = {1, 2, list(3,4)}; 1
+protect(set8700_A, 65, 1), protect(set8700_A) == 1089
+protect(set8700_A[0]) == 65
+protect(set8700_A[2]) == 65
+protect(set8700_A[2][1]) == 0
+protect(set8700_A, 65, 2), protect(set8700_A[2][1]) == 65
+protect(set8700_A,-1024), protect(set8700_A) == 65
+protect(set8700_A, -1, 1), protect(set8700_A) == 64
+protect(set8700_A[1]) == 64
+protect(set8700_A[2]) == 64
+protect(set8700_A[2][0]) == 65
+protect(set8700_A,0), protect(set8700_A) == 0
+protect(set8700_A[1]) == 64
+protect(set8700_A, 0, 2), protect(set8700_A) == 0
+protect(set8700_A[1]) == 0
+protect(set8700_A[2][1]) == 0
+protect(set8700_A,1024, 2), protect(set8700_A) == 1024
+protect(set8700_A[2]) == 1024
+protect(set8700_A[2][0], 512), protect(set8700_A[2][0]) == 1536
+
+## Testing simple assignment of matrix
+set8700_B = set8700_A, protect(set8700_B) == 1024	## protect(set8700_A) copied
+protect(set8700_B[2]) == 1024		## protect(set8700_A[2]) copied
+protect(set8700_B[2][0]) == 1536	## protect(set8700_A[2][0]) copied
+
+## copying matrix to list
+set8700_B = list(5,6,7), protect(set8700_B) == 1024
+protect(set8700_B[0]) == 0
+protect(set8700_B[2]) == 0
+protect(set8700_A,0), protect(set8700_A) == 0
+copy(set8700_A,set8700_B), set8700_B[0] == 1 && set8700_B[1] == 2
+set8700_B[2] == list(3,4)
+protect(set8700_B) == 1024		## protect(set8700_A) not copied
+protect(set8700_B[0]) == 1024		## protect(set8700_A[0]) copied
+protect(set8700_B[2][0]) == 1536	## protect(set8700_A[2][0]) copied
+
+## copying matrix to matrix
+set8700_B = mat[3], protect(set8700_B) == 1024
+protect(set8700_B[2]) == 0
+copy(set8700_A,set8700_B), set8700_B[0] == 1 && set8700_B[1] == 2
+set8700_B[2] == list(3,4)
+protect(set8700_B) == 1024		## protect(set8700_A) not copied
+protect(set8700_B[0]) == 1024		## protect(set8700_A[0]) copied
+protect(set8700_B[2][0]) == 1536	## protect(set8700_A[2][0]) copied
+
+## Testing list protection
+set8700_A = list(1, 2, list(3,4)), 1
+protect(set8700_A,1024, 2), protect(set8700_A) == 1024
+protect(set8700_A[2]) == 1024
+protect(set8700_A[2][0], 512), protect(set8700_A[2][0]) == 1536
+
+## Simple assignment of list
+set8700_B = set8700_A, protect(set8700_B) == 1024	## protect(set8700_A) copied
+protect(set8700_B[2]) == 1024		## protect(set8700_A[2]) copied
+protect(set8700_B[2][0]) == 1536	## protect(set8700_A[2][0]) copied
+
+## Copying list to list
+set8700_B = list(5,6,7), protect(set8700_B) == 1024
+protect(set8700_B[2]) == 0
+copy(set8700_A,set8700_B), set8700_B[0] == 1 && set8700_B[1] == 2
+set8700_B[2] == list(3,4)
+protect(set8700_B) == 1024		## protect(set8700_A) not copied
+protect(set8700_B[0]) == 1024		## protect(set8700_A[0]) copied
+protect(set8700_B[2][0]) == 1536	## protect(set8700_A[2][0]) copied
+
+## Copying list to matrix
+set8700_B = mat[3], protect(set8700_B) == 1024
+protect(set8700_B[2]) == 0
+copy(set8700_A,set8700_B), set8700_B[0] == 1 && set8700_B[1] == 2
+set8700_B[2] == list(3,4)
+protect(set8700_B) == 1024
+protect(set8700_B[0]) == 1024		## protect(set8700_A[0]) copied
+protect(set8700_B[2][0]) == 1536	## protect(set8700_A[2][0]) copied
+
+## Protecting one element of a list
+set8700_A = list(1,4,3,2), protect(set8700_A[1]) == 0
+protect(set8700_A[1], 1024), protect(set8700_A[1]) == 1024
+
+## Testing sort
+set8700_A = sort(set8700_A), set8700_A == list(1,2,3,4)
+protect(set8700_A[1]) == 0
+protect(set8700_A[3]) == 1024		## status of 4
+
+## Testings reverse
+set8700_A = reverse(set8700_A), set8700_A == list(4,3,2,1)
+protect(set8700_A[0]) == 1024		## status of 4
+
+## Testing swap
+swap(set8700_A[0], set8700_A[1]), set8700_A == list(3,4,2,1)
+protect(set8700_A[0]) == 0		## status moved
+protect(set8700_A[1]) == 1024		## 4 retains protection
+
+## Testing list with protected list argument
+protect(set8700_A, 0), protect(set8700_A) == 0
+protect(set8700_A, 512), protect(set8700_A) == 512
+protect(set8700_A[1]) == 1024
+set8700_L = list(1,set8700_A,3), protect(set8700_L) == 0
+protect(set8700_L[0]) == 0
+protect(set8700_L[1]) == 512		## protect(set8700_A) copied
+protect(set8700_L[1][1]) == 1024	## protect(set8700_A[1]) copied
+
+## Testing list with "intialization"
+set8700_L = list(1,2,3), protect(set8700_L) == 0
+protect(set8700_L[0]) | protect(set8700_L[1]) | protect(set8700_L[2]) == 0	## All zero
+set8700_L = {1,set8700_A}, set8700_L[1] == set8700_A
+protect(set8700_L[1]) == 512		## protect(set8700_A) copied
+protect(set8700_L[1][1]) == 1024	## protect(set8700_A[1]) copied
+set8700_L[1] = 2, protect(set8700_L[1]) == 512	## Not changed
+
+## Testing matrix with "initialization"
+set8700_M = mat[3] = {1,set8700_A}, protect(set8700_M) == 0
+protect(set8700_M[0]) == 0
+protect(set8700_M[1]) == 512		## protect(set8700_A) copied
+protect(set8700_M[2]) == 0
+protect(set8700_M[1][1]) == 1024	## protect(set8700_A[1]) copied
+
+## Testing push, pop, append, remove
+set8700_A = list(1,2), protect(set8700_A,0,1), protect(set8700_A[0]) == 0
+protect(set8700_A[0], 256), protect(set8700_A[0]) == 256
+protect(set8700_A[1]) == 0
+append(set8700_A, pop(set8700_A)), protect(set8700_A[0]) ==  0
+protect(set8700_A[1]) == 256
+push(set8700_A, remove(set8700_A)), protect(set8700_A[0]) == 256
+protect(set8700_A[1]) == 0
+
+## Testing operation-assignments
+set8700_A = 5, protect(set8700_A,1024), protect(set8700_A) == 1024
+protect(set8700_A, 1024), set8700_A = 7, protect(set8700_A) == 1024
+protect(set8700_A,1024), set8700_A += 2, protect(set8700_A) == 1024
+protect(set8700_A,1024), set8700_A *= 2, protect(set8700_A) == 1024
+protect(set8700_A,1024), set8700_A |= 2, protect(set8700_A) == 1024
+protect(set8700_A,1024), set8700_A &= 2, protect(set8700_A) == 1024
+protect(set8700_A,1024), set8700_A ^= 2, protect(set8700_A) == 1024
+
+protect(set8700_B,0), set8700_B = set8700_getA1(), protect(set8700_B) == 1024
+protect(set8700_B,0), set8700_B = set8700_getA2(), protect(set8700_B) == 1024
+set8700_B = set8700_getvar(), protect(set8700_B) == 1024 + 256
+
+global set8700_x, set8700_y; set8700_x = 7,  protect(set8700_x) == 0
+protect(7,2) == error(10234)
+protect(set8700_x,2.5) == error(10235)
+protect(set8700_x,"abc") == error(10235)
+protect(set8700_x, 1e6) == error(10235)
+protect(set8700_x,1), (set8700_x = 2) == error(10366)
+(set8700_x = 3 + 4) == error(10366)
+
+protect(set8700_x,2), protect(set8700_x) == 3
+protect(set8700_x,-1), protect(set8700_x) == 2
+(set8700_x = 2) == error(10368)
+(set8700_x = 3 + 4) == 7
+protect(set8700_x,2), ++set8700_x == error(10379)
+set8700_x == 7
+--set8700_x == error(10382)
+set8700_x == 7
+set8700_x++ == error(10385)
+set8700_x == 7
+set8700_x-- == error(10388)
+
+global set8700_A, set8700_B; 1
+protect(set8700_A,0), protect(set8700_A,16), 1
+set8700_A = "abcdef", protect(set8700_A) == 16		## No copy to set8700_A
+protect(set8700_B,0), set8700_B = "xyz", protect(set8700_B) == 0
+copy(set8700_B, set8700_A) == error(10226)
+set8700_A == "abcdef"				## set8700_A not changed
+protect(set8700_A,0), copy(set8700_B,set8700_A), set8700_A == "xyzdef"
+protect(set8700_B,128), protect(set8700_B) == 128	## No copy from set8700_B
+copy(set8700_B,set8700_A,,,3) == error(10225)
+set8700_A == "xyzdef"
+protect(set8700_B,0), copy(set8700_B,set8700_A,,,3), set8700_A == "xyzxyz"
+
+set8700_A = "abcdef", protect(set8700_A, 16), swap(set8700_A[0], set8700_A[5]) == error(10371)
+set8700_A == "abcdef"
+protect(set8700_A,0), isnull(swap(set8700_A[0], set8700_A[5]))
+set8700_A == "fbcdea"
+protect(set8700_A,2), ++set8700_A[0] == error(10377)
+--set8700_A[1] == error(10380)
+set8700_A[2]++ == error(10383)
+set8700_A[3]-- == error(10386)
+set8700_A == "fbcdea"
+protect(set8700_A,0), ++set8700_A[0] == 'g'
+--set8700_A[1] == 'a'
+set8700_A[2]++ == ord('c')
+set8700_A[3]-- == ord('d')
+set8700_A == "gadcea"
+
+protect(set8700_x,0), protect(set8700_y,0), protect(set8700_x,256), protect(set8700_y,512),1
+quomod(11,4,set8700_x,set8700_y), set8700_x == 2 && set8700_y == 3
+protect(set8700_x) == 256
+protect(set8700_y) == 512
+
+set8700_A = mat[3]; protect(set8700_A[0], 1024); protect(set8700_A[0]) == 1024
+set8700_x = 7, protect(set8700_x,0), protect(set8700_x, 512), 1
+set8700_A = {set8700_x,,set8700_x}, protect(set8700_A[0]) == 1536
+protect(set8700_A[1]) == 0
+protect(set8700_A[2]) == 512
+protect(set8700_A,16), protect(set8700_A) == 16		## No copy to
+set8700_A == (mat[3] = {7,0,7})
+set8700_A = {1,2,3}, errno() == 10390;
+set8700_A == (mat[3] = {7,0,7})
+
+protect(set8700_A,0), set8700_A = {1,2,3}, set8700_A == (mat[3] = {1,2,3})
+protect(set8700_A[1],1), protect(set8700_A[1]) == 1
+set8700_A = {4,5,6}, errno() == 10394
+set8700_A == (mat[3] = {4,2,6})
+modify(7, "set8700_f") == error(10405)
+set8700_A = list(2,3,5), modify(set8700_A, 7) == error(10406)
+protect(set8700_A,2), modify(set8700_A, "set8700_f") == error(10407)
+protect(set8700_A,0), modify(set8700_A, "h") == error(10408)
+set8700_B = 42, protect(set8700_B,0), modify(set8700_B, "set8700_f") == error(10409)
+set8700_A == list(2,3,5)		## set8700_A not affected by failures
+protect(set8700_A,0,1), modify(set8700_A, "set8700_f") == null()
+set8700_A == list(4,9,25)
+modify(set8700_A,"set8700_g") == null()
+protect(set8700_A[0]) == 0
+protect(set8700_A[1]) == 256 && protect(set8700_A[2]) == 256
+
+set8700_A = 0, protect(set8700_A,0), set8700_A = pop(2), set8700_A == error(10181)
+set8700_A = pop(list(1,2,3)), set8700_A == error(10181)
+set8700_B = set8700_A = pop(2), set8700_B == error(10181)
+set8700_A = 32, protect(set8700_A,8), (set8700_A = pop(2)) == error(10370)
+set8700_A == 32
+set8700_B = set8700_A = pop(2), set8700_B == error(10370)
+## Testing copying of protected elements and initialization
+set8700_M1 = mat[3], protect(set8700_M1,0), protect(set8700_M1[1],1), protect(set8700_M1[1]) == 1
+set8700_M2 = mat[3], protect(set8700_M2,0), protect(set8700_M2[2],4), protect(set8700_M2[2]) == 4
+set8700_L = list(set8700_M1, set8700_M2), protect(set8700_L[0][1]) == 1 && protect(set8700_L[1][2]) == 4
+set8700_L = {{1,2,3},{'a','b','c'}}, set8700_L[0] == (mat[3] = {1,0,3})
+set8700_L[1] == (mat[3] = {'a','b',0})
+set8700_M = mat[2], protect(set8700_M,0), set8700_M = {1,2,3,4}, set8700_M == (mat[2] = {1,2})
+set8700_x = 5, set8700_M = {set8700_x++, set8700_x++, set8700_x++, set8700_x++, set8700_x++}, set8700_M == (mat[2] = {5,6})
+set8700_x == 10		## All initialization terms evaluated
+set8700_S = "   ", set8700_S = {'a','b','c','d'}, set8700_S == "abc"
+
+set8700_P = obj set8700_point = {1,2,3,4}, set8700_P.set8700_x == 1 && set8700_P.set8700_y == 2 && set8700_P.set8700_z == 3
+protect(set8700_P,16), set8700_Q = set8700_P, set8700_Q = {5,6,7}, set8700_Q == set8700_P
+set8700_P == (obj set8700_point = {1,2,3})
+set8700_L = list(mat[1] = {set8700_P}), protect(set8700_L[0][0]) == 16
+set8700_L = {{{4,5,6}}}, set8700_L[0][0] == set8700_P
+protect(set8700_L,0,2), set8700_L = {{{4,5,6}}}, set8700_L[0][0] == (obj set8700_point = {4,5,6})

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.2 $
+ * @(#) $Id: solve.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: sumsq.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: surd.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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,7 +283,7 @@ define surd_rel(a, b)
 	return sgn(x^2 - y^2 * surd_type) * sgn(x);
 }
 
-if (config("lib_debug") >= 0) {
+if (config("resource_debug") & 3) {
     print "obj surd {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.2 $
+ * @(#) $Id: test1700.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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.2 $
+ * @(#) $Id: test2300.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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.2 $
+ * @(#) $Id: test2600.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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) {

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.2 $
+ * @(#) $Id: test2700.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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;
 

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.2 $
+ * @(#) $Id: test3100.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: test3300.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 global defaultverbose = 1;	/* default verbose value */
 global err;
 

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.2 $
+ * @(#) $Id: test3400.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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;
 

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.2 $
+ * @(#) $Id: test3500.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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;
 

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.2 $
+ * @(#) $Id: test4000.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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))

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.3 $
+ * @(#) $Id: test4100.cal,v 29.3 2006/06/10 20:19:20 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://www.isthe.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;
 
 /*
@@ -294,8 +316,8 @@ define powtimes(str, N1, N2, n, verbose)
 	mat B[n];
 	v = olen(N1);
 
-	cp = config("pow2", 1);
-	crc = config("redc2", 1);
+	cp = config("pow2", 2);
+	crc = config("redc2", 2);
 
 	/* initialize redc and lastmod info */
 
@@ -324,7 +346,7 @@ define powtimes(str, N1, N2, n, verbose)
 	for (i = 0; i < n; i++)
 		z4 += rcpow(Ar[i], B[i], v);
 	trcsmall = round(runtime() - t, 4);
-	config("redc2", 1);
+	config("redc2", 2);
 	t = runtime();
 	for (i = 0; i < n; i++)
 		z5 += rcpow(Ar[i], B[i], v);

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.4 $
+ * @(#) $Id: test4600.cal,v 29.4 2001/04/10 22:09:02 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
@@ -33,10 +53,10 @@ define stest(str, verbose)
 	/*
 	 * do file operations
 	 */
-	f = fopen("junk4600", "w");
+	f = fopen("junk4600", "wb");
 	if (iserror(f)) {
 		print 'failed';
-		print '**** fopen("junk4600", "w") failed';
+		print '**** fopen("junk4600", "wb") failed';
 		return 1;
 	}
 	if (iserror(fputs(f,
@@ -47,9 +67,9 @@ define stest(str, verbose)
 		print '**** fputs(f, "Fourscore ... failed';
 		return 1;
 	}
-	if (iserror(freopen(f, "r"))) {
+	if (iserror(freopen(f, "rb"))) {
 		print 'failed';
-		print '**** iserror(freopen(f, "r")) failed';
+		print '**** iserror(freopen(f, "rb")) failed';
 		return 1;
 	}
 	if (iserror(rewind(f))) {
@@ -153,7 +173,7 @@ define ttest(str, m, n, verbose)
 		print str:":",:;
 	}
 	i = rm("-f", "junk4600");
-	f = fopen("junk4600", "w");
+	f = fopen("junk4600", "wb");
 
 	if (isnull(n))
 		n = 4;
@@ -178,7 +198,7 @@ define ttest(str, m, n, verbose)
 	fflush(f);
 	if (verbose > 1)
 		printf("File has size %d\n", pos[i]);
-	freopen(f, "r");
+	freopen(f, "rb");
 	if (size(f) != pos[i]) {
 		print 'failed';
 		printf("**** Failure 1 for file size\n");

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.2 $
+ * @(#) $Id: test5100.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: test5200.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: test8400.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/
+ * Share and enjoy!  :-)	http://www.isthe.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.2 $
+ * @(#) $Id: test8500.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: unitfrac.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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.2 $
+ * @(#) $Id: varargs.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.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

@@ -1,12 +1,30 @@
-/*
- * Copyright (c) 1997 Ernest Bowen
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
- *
- * By: Ernest Bowen <ernie@neumann.une.edu.au>
- */
 /*
  * 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.2 $
+ * @(#) $Id: xx_print.cal,v 29.2 2000/06/07 14:02:25 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
@@ -56,7 +74,7 @@ define mat_print (a) {
 
 	for (i = matmin(a,1); i <= matmax(a,1); i++) {
 		if (i >= matmin(a,1) + matcolmax) {
-			print "     ...";
+			print "	    ...";
 			break;
 		}
 		for (j = matmin(a,2); j <= matmax(a,2); j++) {

calc.c

@@ -1,17 +1,57 @@
 /*
- * Copyright (c) 1997 David I. Bell
- * Permission is granted to use, distribute, or modify this source,
- * provided that this copyright notice remains intact.
+ * calc - arbitrary precision calculator
  *
- * Arbitrary precision calculator.
+ * Copyright (C) 1999-2006  David I. Bell, Landon Curt Noll 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.13 $
+ * @(#) $Id: calc.c,v 29.13 2006/05/19 15:26:10 chongo Exp $
+ * @(#) $Source: /usr/local/src/cmd/calc/RCS/calc.c,v $
+ *
+ * Under source code control:	1990/02/15 01:48:11
+ * File existed as early as:	before 1990
+ *
+ * Share and enjoy!  :-)	http://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 #include <stdio.h>
 #include <signal.h>
-#include <pwd.h>
+
+#if !defined (_WIN32)
+# include <pwd.h>
+#endif
+
 #include <sys/types.h>
 #include <ctype.h>
-#include <setjmp.h>
+
+#if defined(_WIN32)
+# include <io.h>
+/*
+ * getopt.h file is from the Cygwin GNU library
+ *
+ * See:
+ *	http://sources.redhat.com/cygwin/
+ */
+# include "../getopt/getopt.h"
+# define strdup _strdup
+# define isatty _isatty
+#endif /* Windoz */
 
 #define CALC_C
 #include "calc.h"
@@ -26,6 +66,7 @@
 #include "custom.h"
 #include "math_error.h"
 #include "args.h"
+#include "zmath.h"
 
 #include "have_unistd.h"
 #if defined(HAVE_UNISTD_H)
@@ -37,35 +78,20 @@
 #include <stdlib.h>
 #endif
 
+#include "have_strdup.h"
+#if !defined(HAVE_STRDUP)
+# define strdup(x) calc_strdup((CONST char *)(x))
+#endif /* HAVE_STRDUP */
 
-/*
- * external definitions and functions
- */
-extern int abortlevel;		/* current level of aborts */
-extern BOOL inputwait;		/* TRUE if in a terminal input wait */
-extern jmp_buf jmpbuf;		/* for errors */
-extern int isatty(int tty);	/* TRUE if fd is a tty */
-
-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 char *pager;		/* $PAGER or default */
-extern int stdin_tty;		/* TRUE if stdin is a tty */
-extern int interactive;		/* TRUE if interactive session (no cmd args) */
-extern char *program;		/* our name */
-extern char cmdbuf[];		/* command line expression */
-
-extern char *version(void);	/* return version string */
+#include "have_unused.h"
 
 
 /*
  * static definitions and functions
  */
-static char *usage = "usage: %s [-C] [-e] [-h] [-i] [-m mode] [-n] [-p]\n"
-		     "\t[-q] [-u] [[--] calc_cmd ...]\n";
 static void intint(int arg);	/* interrupt routine */
-
+static int nextcp(char **cpp, int *ip, int argc, char **argv, BOOL haveendstr);
+static void set_run_state(run state);
 
 /*
  * Top level calculator routine.
@@ -75,120 +101,386 @@ main(int argc, char **argv)
 {
 	int want_defhelp = 0;	/* 1=> we only want the default help */
 	int cmdlen;		/* length of the command string */
-	extern char *optarg;	/* option argument */
-	extern int optind;	/* option index */
+	int newcmdlen;
 	int c;			/* option */
-	long i;
+	int index;
+	int maxindex;
+	char *cp;
+	char *endcp;
+	char *bp;
+	BOOL done = FALSE;
+	BOOL havearg;
+	BOOL haveendstr;
+	size_t len;
 
 	/*
 	 * parse args
 	 */
 	program = argv[0];
-	while ((c = getopt(argc, argv, "Cehim:npquv")) != -1) {
-		switch (c) {
-		case 'C':
-#if defined(CUSTOM)
-			allow_custom = TRUE;
-			break;
-#else /* CUSTOM */
-			/*
-			 * we are too early in processing to call
-			 * libcalc_call_me_last() - nothing to cleanup
-			 */
-			fprintf(stderr,
-			    "%s: calc was built with custom functions "
-			    "disabled, -C usage is disallowed\n", program);
-			exit(1);
-#endif /* CUSTOM */
-		case 'e':
-			no_env = TRUE;
-			break;
-		case 'h':
-			want_defhelp = 1;
-			break;
-		case 'i':
-			ign_errmax = TRUE;
-			break;
-		case 'm':
-			if (optarg[1] == '\0' || *optarg<'0' || *optarg>'7') {
-				/*
-				 * we are too early in processing to
-				 * call libcalc_call_me_last()
-				 * nothing to cleanup
-				 */
-				fprintf(stderr,
-					"%s: unknown -m arg\n", program);
-				exit(1);
-			}
-			allow_read = (((*optarg-'0') & 04) > 0);
-			allow_write = (((*optarg-'0') & 02) > 0);
-			allow_exec = (((*optarg-'0') & 01) > 0);
-			break;
-		case 'n':
-			new_std = TRUE;
-			break;
-		case 'p':
-			p_flag = TRUE;
-			break;
-		case 'q':
-			q_flag = TRUE;
-			break;
-		case 'u':
-			u_flag = TRUE;
-			break;
-		case 'v':
-			/*
-			 * we are too early in processing to call
-			 * libcalc_call_me_last() - nothing to cleanup
-			 */
-			printf("%s (version %s)\n", CALC_TITLE, version());
-			exit(0);
-		default:
-			/*
-			 * we are too early in processing to call
-			 * libcalc_call_me_last() - nothing to cleanup
-			 */
-			fprintf(stderr, usage, program);
-			exit(1);
-		}
-	}
-	interactive = (optind >= argc);
 
-	/*
-	 * look at the length of any trailing command args
-	 *
-	 * We make room for the trailing '\0\n' as well as an extra guard byte.
-	 */
-	for (cmdlen=0, i=optind; i < argc; ++i) {
-		/* argument + space separator */
-		cmdlen += strlen(argv[i]) + 1;
-	}
-	if (i > MAXCMD) {
-		/*
-		 * we are too early in processing to call
-		 * libcalc_call_me_last() - nothing to cleanup
-		 */
-		fprintf(stderr,
-			"%s: command in arg list is too long\n", program);
-		exit(1);
-	}
-
-	/*
-	 * We will form a command the remaining args separated by spaces.
-	 */
 	cmdbuf[0] = '\0';
-	if (optind < argc) {
-		strcpy(cmdbuf, argv[optind]);
-		cmdlen = strlen(argv[optind]);
-		for (i=optind+1; i < argc; ++i) {
-			cmdbuf[cmdlen++] = ' ';
-			strcpy(cmdbuf+cmdlen, argv[i]);
-			cmdlen += strlen(argv[i]);
+	cmdlen = 0;
+
+	/* process command line options */
+
+	index = 1;
+	cp = endcp = NULL;
+	maxindex = argc;
+	havecommands = FALSE;
+	while (index < maxindex && !done) {
+		cp = argv[index];
+		if (*cp == '\0') {
+			index++;
+			continue;
 		}
+		for (;;) {
+			havearg = FALSE;
+			if (*cp != '-') {
+				done = TRUE;
+				break;
+			}
+			++cp;
+			if (*cp == '-') {
+				cp++;
+				while (*cp == ' ')
+					++cp;
+				done = TRUE;
+				break;
+			}
+
+			for (;;) {
+				c = *cp;
+				if (c == '\0' || c == ' ')
+					break;
+				switch (c) {
+				case 'C':
+#if defined(CUSTOM)
+					allow_custom = TRUE;
+					break;
+#else /* CUSTOM */
+					/*
+					 * we are too early in processing to
+					 * call libcalc_call_me_last() -
+					 * nothing to cleanup
+					 */
+					fprintf(stderr,
+					    "%s: calc was built with custom"
+					    " functions disabled, -C usage is"
+					    " disallowed\n", program);
+					exit(1);
+#endif /* CUSTOM */
+				case 'e':
+					no_env = TRUE;
+					break;
+				case 'h':
+					want_defhelp = 1;
+					break;
+				case 'i':
+					i_flag = TRUE;
+					break;
+				case 'm':
+					cp++;
+					while (*cp == ' ' || *cp == '\t')
+						cp++;
+					if (*cp == '\0') {
+						index++;
+						if (index >= argc) {
+							fprintf(stderr,
+								"-m expects"
+								" argument");
+							exit (1);
+						}
+						cp = argv[index];
+					}
+
+					if (*cp < '0' || *cp > '7') {
+						/*
+						 * we are too early in
+						 * processing to call
+						 * libcalc_call_me_last()
+						 * nothing to cleanup
+						 */
+						fprintf(stderr,
+							"%s: unknown -m arg\n",
+							program);
+						exit(1);
+					}
+					allow_read = (((*cp-'0') & 04) > 0);
+					allow_write = (((*cp-'0') & 02) > 0);
+					allow_exec = (((*cp-'0') & 01) > 0);
+					cp++;
+					if (*cp != ' ' && *cp != '\0') {
+						fprintf(stderr, "??? m-arg");
+						exit(1);
+					}
+					havearg = TRUE;
+					break;
+				case 'n':
+					/*
+					 * -n is deprecated and may be reused
+					 * for another purpose in the future
+					 */
+					break;
+				case 'O':
+					use_old_std = TRUE;
+					break;
+				case 'p':
+					p_flag = TRUE;
+					break;
+				case 'q':
+					q_flag = TRUE;
+					break;
+				case 'u':
+					u_flag = TRUE;
+					break;
+				case 'c':
+					c_flag = TRUE;
+					break;
+				case 'd':
+					d_flag = TRUE;
+					break;
+				case 'v':
+					/*
+					 * we are too early in processing to
+					 * call libcalc_call_me_last() -
+					 * nothing to cleanup
+					 */
+					printf("%s (version %s)\n",
+					       CALC_TITLE, version());
+					exit(0);
+				case 'D':
+					/*
+					 * parse the -D arg
+					 *
+					 * Could be:
+					 *
+					 * calc_debug
+					 * calc_debug:resource_debug
+					 * calc_debug:resource_debug:user_debug
+					 */
+					if (nextcp(&cp, &index, argc, argv,
+						   FALSE)) {
+					    fprintf(stderr,
+					    	    "-D expects argument\n");
+					    exit (1);
+					}
+					havearg = TRUE;
+					if (*cp != ':') {
+						if (*cp < '0' || *cp > '9') {
+						    fprintf(stderr,
+						    	    "-D expects"
+							    " integer\n");
+						    exit (1);
+						}
+						calc_debug = cp;
+						(void) strtol(cp, &endcp, 10);
+						cp = endcp;
+						if (*cp != '\0' &&
+						    *cp != ' ' && *cp != ':') {
+						    fprintf(stderr,
+						    	    "Bad syntax im -D"
+							    " arg\n");
+						    exit (1);
+						}
+						if (*cp != ':') {
+						    if (nextcp(&cp, &index,
+						    	       argc, argv,
+							       FALSE)
+								|| *cp != ':')
+							break;
+						}
+					}
+					if (nextcp(&cp, &index, argc, argv,
+						   FALSE)) {
+						fprintf(stderr,
+							"-D : expects"
+							" argument\n");
+						exit (1);
+					}
+					if (*cp != ':') {
+						if (*cp < '0' || *cp > '9') {
+						    fprintf(stderr,
+						    	    "-D : expects"
+							    " integer\n");
+						    exit (1);
+						}
+						resource_debug = cp;
+						(void) strtol(cp, &endcp, 10);
+						cp = endcp;
+						if (*cp != '\0' &&
+						    *cp != ' ' && *cp != ':') {
+						    fprintf(stderr,
+						    	    "Bad syntax im -D"
+							    " : arg\n");
+						    exit (1);
+						}
+						if (*cp != ':') {
+							if (nextcp(&cp, &index,
+						    	           argc, argv,
+							           FALSE)
+							    || *cp != ':') {
+								break;
+							}
+						}
+					}
+					if (nextcp(&cp, &index, argc, argv,
+						   FALSE)) {
+					    fprintf(stderr, "-D : : expects"
+					    	    " argument\n");
+					    exit (1);
+					}
+					if (*cp < '0' || *cp > '9') {
+					    fprintf(stderr, "-D :: expects"
+					    	    " integer\n");
+					    exit (1);
+					}
+					user_debug = cp;
+					(void) strtol(cp, &endcp, 10);
+					cp = endcp;
+					if (*cp != '\0' && *cp != ' ') {
+						fprintf(stderr, "Bad syntax in"
+							" -D : : arg\n");
+						exit (1);
+					}
+					break;
+				case 'f':
+					haveendstr = (cp[1] == '\0');
+					if (nextcp(&cp, &index, argc, argv,
+						   haveendstr)) {
+					    fprintf(stderr, "-f expects"
+						    " filename\n");
+					    exit (1);
+					}
+					if (*cp == ';') {
+						fprintf(stderr,
+							"-f expects"
+							" filename\n");
+						exit (1);
+					}
+					havearg = TRUE;
+					if (cmdlen > 0)
+						cmdbuf[cmdlen++] = ' ';
+					strcpy(cmdbuf + cmdlen, "read ");
+					cmdlen += 5;
+					if (strncmp(cp, "-once", 5) == 0 &&
+					    (cp[5] == '\0' || cp[5] == ' ')) {
+						cp += 5;
+						haveendstr = (*cp == '\0');
+						strcpy(cmdbuf+cmdlen, "-once ");
+						cmdlen += 6;
+						if (nextcp(&cp, &index, argc,
+							   argv, haveendstr)) {
+						    fprintf(stderr, "-f -once"
+						    	    " expects"
+							    " filename\n");
+						    exit (1);
+						}
+					}
+					bp = cmdbuf + cmdlen;
+					if (haveendstr) {
+						len = strlen(cp);
+						if (len == 0) {
+							fprintf(stderr,
+								"Null"
+								" filename!");
+							exit (1);
+						}
+						if (cmdlen + len + 2 > MAXCMD) {
+							fprintf(stderr,
+								"Commands too"
+								" long");
+							exit (1);
+						}
+						/* XXX What if *cp = '\''? */
+						*bp++ = '\'';
+						strncpy(bp, cp, len+1);
+						bp += len;
+						*bp++ = '\'';
+						cp += len;
+						cmdlen += len + 2;
+					} else {
+						do {
+							if (cmdlen > MAXCMD) {
+								fprintf(stderr,
+								   "Commands"
+								   " too long");
+								exit (1);
+							}
+							*bp++ =  *cp++;
+							cmdlen++;
+						} while (*cp != '\0' &&
+							 *cp != ';' &&
+							 *cp != ' ');
+					}
+					if (*cp == ';')
+						cp++;
+					*bp++ = ';';
+					cmdlen++;
+					break;
+
+				case 's':
+					s_flag = TRUE;
+					maxindex = index + 1;
+					break;
+				default:
+					/*
+					 * we are too early in processing to
+					 * call libcalc_call_me_last() -
+					 * nothing to cleanup
+					 */
+					fprintf(stderr, "Illegal option -%c\n",
+							c);
+					fprintf(stderr,
+		"usage: %s [-a] [-c] [-C] [-d] [-e] [-h] [-i] [-m mode]\n"
+		"\t[-D calc_debug[:resource_debug[:user_debug]]]\n"
+		"\t[-O] [-p] [-q] [-u] [-v] "
+		"[--] [calc_cmd ...]\n",
+		program);
+					exit(1);
+			}
+			if (havearg)
+				break;
+			cp++;
+			}
+			while (*cp == ' ')
+				cp++;
+			if (*cp == '\0') {
+				index++;
+				break;
+			}
+		}
+	}
+
+	while (index < maxindex) {
+		size_t cplen;
+
+		if (cmdlen > 0)
+			cmdbuf[cmdlen++] = ' ';
+		cplen = strlen(cp);
+		newcmdlen = cmdlen + cplen;
+		if (newcmdlen > MAXCMD) {
+			fprintf(stderr,
+				"%s: commands too long\n",
+				program);
+			exit(1);
+		}
+		strncpy(cmdbuf + cmdlen, cp, cplen+1);
+		cmdlen = newcmdlen;
+		index++;
+		if (index < maxindex)
+			cp = argv[index];
+	}
+
+	havecommands = (cmdlen > 0);
+
+	if (havecommands) {
 		cmdbuf[cmdlen++] = '\n';
 		cmdbuf[cmdlen] = '\0';
 	}
 
+	argc_value = argc - maxindex;
+	argv_value = argv + maxindex;
+
 	/*
 	 * unbuffered mode
 	 */
@@ -197,12 +489,14 @@ main(int argc, char **argv)
 		setbuf(stdout, NULL);
 	}
 
+
 	/*
 	 * initialize
 	 */
 	libcalc_call_me_first();
-	stdin_tty = TRUE;	/* assume internactive default */
-	conf->tab_ok = TRUE;	/* assume internactive default */
+	stdin_tty = isatty(0);		/* assume stdin is on fd 0 */
+	if (conf->calc_debug & CALCDBG_TTY)
+		printf("main: stdin_tty is %d\n", stdin_tty);
 	if (want_defhelp) {
 		givehelp(DEFAULTCALCHELP);
 		libcalc_call_me_last();
@@ -212,35 +506,27 @@ main(int argc, char **argv)
 	/*
 	 * if allowed or needed, print version and setup bindings
 	 */
-	if (interactive) {
-		/*
-		 * check for pipe mode and/or non-tty stdin
-		 */
-		if (!p_flag) {
-			stdin_tty = isatty(0);	/* assume stdin is on fd 0 */
-		}
-
-		/*
-		 * if tty, setup bindings
-		 */
-		if (stdin_tty) {
+	if (!havecommands && stdin_tty) {
+		if (!d_flag) {
 			printf("%s (version %s)\n", CALC_TITLE, version());
+			printf("Calc is open software. For license details "
+			       "type:  help copyright\n");
 			printf("[%s]\n\n",
 			    "Type \"exit\" to exit, or \"help\" for help.");
-			switch (hist_init(calcbindings)) {
-			case HIST_NOFILE:
-				fprintf(stderr,
-				    "%s: Cannot open bindings file \"%s\", "
-				    "fancy editing disabled.\n",
-				     program, calcbindings);
-				break;
+		}
+		switch (hist_init(calcbindings)) {
+		case HIST_NOFILE:
+			fprintf(stderr,
+			    "%s: Cannot open bindings file \"%s\", "
+			    "fancy editing disabled.\n",
+			     program, calcbindings);
+			break;
 
-			case HIST_NOTTY:
-				fprintf(stderr,
-					"%s: Cannot set terminal modes, "
-					"fancy editing disabled\n", program);
-				break;
-			}
+		case HIST_NOTTY:
+			fprintf(stderr,
+				"%s: Cannot set terminal modes, "
+				"fancy editing disabled\n", program);
+			break;
 		}
 	}
 
@@ -252,53 +538,168 @@ main(int argc, char **argv)
 		/*
 		 * reset/initialize the computing environment
 		 */
-		if (post_init) {
+		if (post_init)
 			initialize();
-		} else {
-			/* initialize already done, jmpbuf is ready */
-			post_init = TRUE;
-		}
-
-		/*
-		 * if arg mode or non-tty mode, just do the work and be gone
-		 */
-		if (!interactive || !stdin_tty) {
-			if (q_flag == FALSE && allow_read) {
-				runrcfiles();
-				q_flag = TRUE;
-			}
-			if (interactive)
-				(void) openterminal();
-			else
-				(void) openstring(cmdbuf);
-			start_done = TRUE;
-			getcommands(FALSE);
-			libcalc_call_me_last();
-			exit(0);
-		}
-	}
-	/* if in arg mode, we should not get here */
-	if (!interactive) {
-		libcalc_call_me_last();
-		exit(1);
+		post_init = TRUE;
 	}
 
 	/*
-	 * process commands
+	 * (re)establish the interrupt handler
 	 */
-	if (!start_done) {
-		reinitialize();
-	}
 	(void) signal(SIGINT, intint);
-	start_done = TRUE;
-	getcommands(TRUE);
+
+	/*
+	 * execute calc code based on the run state
+	 */
+	if (run_state == RUN_BEGIN) {
+		if (!q_flag && allow_read) {
+			set_run_state(RUN_RCFILES);
+			runrcfiles();
+		}
+		set_run_state(RUN_PRE_CMD_ARGS);
+	}
+
+	while (run_state == RUN_RCFILES) {
+		fprintf(stderr, "Error in rcfiles\n");
+		if ((c_flag && !stoponerror) || stoponerror < 0) {
+			getcommands(FALSE);
+			if (inputlevel() == 0) {
+				closeinput();
+				runrcfiles();
+				set_run_state(RUN_PRE_CMD_ARGS);
+			} else {
+				closeinput();
+			}
+		} else {
+			if ((havecommands && !i_flag) || !stdin_tty) {
+				set_run_state(RUN_EXIT_WITH_ERROR);
+			} else {
+				set_run_state(RUN_PRE_CMD_ARGS);
+			}
+		}
+	}
+
+	if (run_state == RUN_PRE_CMD_ARGS) {
+		if (havecommands) {
+			set_run_state(RUN_CMD_ARGS);
+			(void) openstring(cmdbuf, strlen(cmdbuf));
+			getcommands(FALSE);
+			closeinput();
+		}
+		set_run_state(RUN_PRE_TOP_LEVEL);
+	}
+
+	while (run_state == RUN_CMD_ARGS) {
+		fprintf(stderr, "Error in commands\n");
+		if ((c_flag && !stoponerror) || stoponerror < 0) {
+			getcommands(FALSE);
+			if (inputlevel() == 0)
+				set_run_state(RUN_PRE_TOP_LEVEL);
+			closeinput();
+		} else {
+			closeinput();
+			if (!stdin_tty || !i_flag || p_flag) {
+				set_run_state(RUN_EXIT_WITH_ERROR);
+			} else {
+				set_run_state(RUN_PRE_TOP_LEVEL);
+			}
+		}
+	}
+
+	if (run_state == RUN_PRE_TOP_LEVEL) {
+		if (stdin_tty &&
+		    (((havecommands) && !i_flag) || p_flag)) {
+			set_run_state(RUN_EXIT);
+		} else {
+			if (stdin_tty) {
+				reinitialize();
+			} else {
+				resetinput();
+				openterminal();
+			}
+			set_run_state(RUN_TOP_LEVEL);
+			getcommands(TRUE);
+		}
+		if (p_flag || (!i_flag && havecommands))
+			set_run_state(RUN_EXIT);
+	}
+
+	while (run_state == RUN_TOP_LEVEL) {
+		if (conf->calc_debug & CALCDBG_RUNSTATE)
+			printf("main: run_state = TOP_LEVEL\n");
+		if ((c_flag && !stoponerror) || stoponerror < 0) {
+			getcommands(TRUE);
+			if (!inputisterminal()) {
+				closeinput();
+				continue;
+			}
+			if (!p_flag && i_flag && !stdin_tty) {
+				closeinput();
+				if(!freopen("/dev/tty", "r", stdin)) {
+#if defined (_WIN32)
+					fprintf(stderr,
+						"/dev/tty does not exist on "
+						"this operating system.  "
+						"Change operating systems\n"
+						"or don't use this calc mode "
+						"in the future, sorry!\n");
+#else /* Windoz free systems */
+					fprintf(stderr,
+						"Unable to associate stdin"
+						" with /dev/tty");
+#endif /* Windoz free systems */
+					set_run_state(RUN_EXIT_WITH_ERROR);
+					break;
+				}
+
+				stdin_tty = TRUE;
+				if (conf->calc_debug & CALCDBG_TTY)
+					printf("main: stdin_tty is %d\n",
+					       stdin_tty);
+				reinitialize();
+			}
+		} else {
+			if (stdin_tty) {
+				reinitialize();
+				getcommands(TRUE);
+			} else if (inputisterminal() &&
+					!p_flag && (!havecommands||i_flag)) {
+				closeinput();
+				if(!freopen("/dev/tty", "r", stdin)) {
+#if defined (_WIN32)
+					fprintf(stderr,
+						"/dev/tty does not exist on "
+						"this operating system.  "
+						"Change operating systems\n"
+						"or don't use this calc mode "
+						"in the future, sorry!\n");
+#else /* Windoz free systems */
+					fprintf(stderr,
+						"Unable to associate stdin"
+						" with /dev/tty");
+#endif /* Windoz free systems */
+					set_run_state(RUN_EXIT_WITH_ERROR);
+					break;
+				}
+				stdin_tty = TRUE;
+				if (conf->calc_debug & CALCDBG_TTY)
+					printf("main: stdin_tty is %d\n",
+					       stdin_tty);
+				reinitialize();
+			} else {
+				set_run_state(RUN_EXIT_WITH_ERROR);
+			}
+		}
+	}
+	if (conf->calc_debug & CALCDBG_RUNSTATE)
+		printf("main: run_state = %s\n", run_state_name(run_state));
 
 	/*
 	 * all done
 	 */
 	libcalc_call_me_last();
-	/* exit(0); */
-	return 0;
+	return (run_state == RUN_EXIT_WITH_ERROR ||
+		run_state == RUN_ZERO) ? 1 : 0;
 }
 
 
@@ -310,7 +711,7 @@ main(int argc, char **argv)
  */
 /*ARGSUSED*/
 static void
-intint(int arg)
+intint(int UNUSED arg)
 {
 	(void) signal(SIGINT, intint);
 	if (inputwait || (++abortlevel >= ABORT_NOW)) {
@@ -355,3 +756,53 @@ math_error(char *fmt, ...)
 		exit(3);
 	}
 }
+
+static int
+nextcp(char **cpp, int *ip, int argc, char **argv, BOOL haveendstr)
+{
+	char *cp;
+	int index;
+
+	cp = *cpp;
+	index = *ip;
+
+
+	if (haveendstr) {
+		index++;
+		*ip = index;
+		if (index >= argc)
+			return 1;
+		*cpp = argv[index];
+		return 0;
+	}
+
+	if (*cp != '\0')
+		cp++;
+	for (;;) {
+		if (*cp == '\0') {
+			index++;
+			*ip = index;
+			if (index >= argc)
+				return 1;
+			cp = argv[index];
+		}
+		while (*cp == ' ')
+			cp++;
+		if (*cp != '\0')
+			break;
+	}
+	*cpp = cp;
+	return 0;
+}
+
+
+static void
+set_run_state(run state)
+{
+	if (conf->calc_debug & CALCDBG_RUNSTATE)
+		printf("main: run_state from %s to %s\n",
+			    run_state_name(run_state),
+			    run_state_name(state));
+	run_state = state;
+}
+

calc.h

@@ -1,177 +1,260 @@
 /*
- * Copyright (c) 1997 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-2006  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.18 $
+ * @(#) $Id: calc.h,v 29.18 2006/05/21 07:28:54 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
 #if !defined(__CALC_H__)
-#define	__CALC_H__
+#define __CALC_H__
 
-
-#include "value.h"
+#include <setjmp.h>
+#if defined(CALC_SRC)	/* if we are building from the calc source tree */
+# include "win32dll.h"
+# include "value.h"
+# include "have_const.h"
+#else
+# include <calc/win32dll.h>
+# include <calc/value.h>
+# include <calc/have_const.h>
+#endif
 
 
 /*
  * 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	MAX_CALCRC	1024	/* maximum length of $CALCRC */
-#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 */
+#if defined(__MSDOS__) || defined(__WIN32)
+#define LISTCHAR	';'	/* char which separates paths in a list */
+#else
+#define LISTCHAR	':'	/* char which separates paths in a list */
+#endif
+#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	128	/* 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 MAXLABELS	100	/* maximum number of user labels in function */
+#define MAXSTRING	1024	/* maximum size of string constant */
+#define MAXSTACK	2048	/* 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)	/* must be < 0 */
 
 /*
  * File I/O routines.
  */
-extern FILEID openid(char *name, char *mode);
-extern FILEID indexid(long index);
-extern BOOL validid(FILEID id);
-extern BOOL errorid(FILEID id);
-extern BOOL eofid(FILEID id);
-extern int closeid(FILEID id);
-extern int getcharid(FILEID id);
-extern int idprintf(FILEID id, char *fmt, int count, VALUE **vals);
-extern int idfputc(FILEID id, int ch);
-extern int idfputs(FILEID id, char *str);
-extern int printid(FILEID id, int flags);
-extern int flushid(FILEID id);
-extern int readid(FILEID id, int flags, char **retptr);
-extern int getloc(FILEID id, ZVALUE *loc);
-extern int setloc(FILEID id, ZVALUE zpos);
-extern int getsize(FILEID id, ZVALUE *size);
-extern int get_device(FILEID id, ZVALUE *dev);
-extern int get_inode(FILEID id, ZVALUE *ino);
-extern FILEID reopenid(FILEID id, char *mode, char *name);
-extern int closeall(void);
-extern int flushall(void);
-extern int idfputstr(FILEID id, char *str);
-extern int rewindid(FILEID id);
-extern void rewindall(void);
-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 int ftellid(FILEID id, ZVALUE *res);
-extern int fseekid(FILEID id, ZVALUE offset, int whence);
-extern int isattyid(FILEID id);
-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);
+extern DLL FILEID openid(char *name, char *mode);
+extern DLL FILEID openpathid(char *name, char *mode, char *pathlist);
+extern DLL FILEID indexid(long index);
+extern DLL BOOL validid(FILEID id);
+extern DLL BOOL errorid(FILEID id);
+extern DLL BOOL eofid(FILEID id);
+extern DLL int closeid(FILEID id);
+extern DLL int getcharid(FILEID id);
+extern DLL int idprintf(FILEID id, char *fmt, int count, VALUE **vals);
+extern DLL int idfputc(FILEID id, int ch);
+extern DLL int idfputs(FILEID id, char *str);
+extern DLL int printid(FILEID id, int flags);
+extern DLL int flushid(FILEID id);
+extern DLL int readid(FILEID id, int flags, char **retptr);
+extern DLL int getloc(FILEID id, ZVALUE *loc);
+extern DLL int setloc(FILEID id, ZVALUE zpos);
+extern DLL int getsize(FILEID id, ZVALUE *size);
+extern DLL int get_device(FILEID id, ZVALUE *dev);
+extern DLL int get_inode(FILEID id, ZVALUE *ino);
+extern DLL FILEID reopenid(FILEID id, char *mode, char *name);
+extern DLL int closeall(void);
+
+#if !defined(_WIN32)
+extern DLL int flushall(void);
+#endif
+
+extern DLL int idfputstr(FILEID id, char *str);
+extern DLL int rewindid(FILEID id);
+extern DLL void rewindall(void);
+extern DLL ZVALUE zfilesize(FILEID id);
+extern DLL void showfiles(void);
+extern DLL int fscanfid(FILEID id, char *fmt, int count, VALUE **vals);
+extern DLL int scanfstr(char *str, char *fmt, int count, VALUE **vals);
+extern DLL int ftellid(FILEID id, ZVALUE *res);
+extern DLL int fseekid(FILEID id, ZVALUE offset, int whence);
+extern DLL int isattyid(FILEID id);
+extern DLL int fsearch(FILEID id, char *str, ZVALUE start, ZVALUE end, ZVALUE *res);
+extern DLL int frsearch(FILEID id, char *str, ZVALUE first, ZVALUE last, ZVALUE *res);
+extern DLL void showconstants(void);
+extern DLL void freeconstant(unsigned long);
+extern DLL void freestringconstant(long);
+extern DLL void trimconstants(void);
 
 /*
  * Input routines.
  */
-extern int openstring(char *str);
-extern int openterminal(void);
-extern int opensearchfile(char *name, char *pathlist, char *exten, int reopen_ok);
-extern char *nextline(void);
-extern int nextchar(void);
-extern void reread(void);
-extern void resetinput(void);
-extern void setprompt(char *);
-extern BOOL inputisterminal(void);
-extern char *inputname(void);
-extern long linenumber(void);
-extern void runrcfiles(void);
-extern void closeinput(void);
-
+extern DLL int openstring(char *str, size_t num);
+extern DLL int openterminal(void);
+extern DLL int opensearchfile(char *name, char *pathlist, char *exten, int reopen_ok);
+extern DLL char *nextline(void);
+extern DLL int nextchar(void);
+extern DLL void reread(void);
+extern DLL void resetinput(void);
+extern DLL void setprompt(char *);
+extern DLL BOOL inputisterminal(void);
+extern DLL int inputlevel(void);
+extern DLL long calclevel(void);
+extern DLL char *inputname(void);
+extern DLL long linenumber(void);
+extern DLL void runrcfiles(void);
+extern DLL void closeinput(void);
 
 /*
  * Other routines.
  */
-extern NUMBER *constvalue(unsigned long index);
-extern long addnumber(char *str);
-extern long addqconstant(NUMBER *q);
-extern void initstack(void);
-extern void getcommands(BOOL toplevel);
-extern void givehelp(char *type);
-extern void libcalc_call_me_first(void);
-extern void libcalc_call_me_last(void);
-extern void showerrors(void);
-
+extern DLL NUMBER *constvalue(unsigned long index);
+extern DLL long addnumber(char *str);
+extern DLL long addqconstant(NUMBER *q);
+extern DLL void initstack(void);
+extern DLL void getcommands(BOOL toplevel);
+extern DLL void givehelp(char *type);
+extern DLL void libcalc_call_me_first(void);
+extern DLL void libcalc_call_me_last(void);
+extern DLL BOOL calc_tty(int fd);
+extern DLL BOOL orig_tty(int fd);
+extern DLL void showerrors(void);
+extern DLL char *calc_strdup(CONST char *);
 
 /*
  * Initialization
  */
-extern void initialize(void);
-extern void reinitialize(void);
-
+extern DLL void initialize(void);
+extern DLL void reinitialize(void);
+#if !defined (_WIN32)
+extern DLL int isatty(int tty);	/* TRUE if fd is a tty */
+#endif
+extern DLL char *version(void);	/* return version string */
+extern DLL int post_init;	/* TRUE => math_error setjmp is ready */
 
 /*
- * Global data definitions.
+ * 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 int start_done;		/* TRUE => start up processing finished */
-extern int dumpnames;		/* TRUE => dump names rather than indices */
+extern DLL int abortlevel;	/* current level of aborts */
+extern DLL BOOL inputwait;	/* TRUE if in a terminal input wait */
+extern DLL jmp_buf jmpbuf;	/* for errors */
 
-extern char *calcpath;		/* $CALCPATH or default */
-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 DLL int p_flag;		/* TRUE => pipe mode */
+extern DLL int q_flag;		/* TRUE => don't execute rc files */
+extern DLL int u_flag;		/* TRUE => unbuffer stdin and stdout */
+extern DLL int d_flag;		/* TRUE => disable heading, resource_debug */
+extern DLL int c_flag;		/* TRUE => continue after error if permitted */
+extern DLL int i_flag;		/* TRUE => try to go interactive after error */
+extern DLL int s_flag;		/* TRUE => keep args as strings for argv() */
+extern DLL long stoponerror;	/* >0 => stop, <0 => continue, ==0 => use -c */
+extern DLL BOOL abort_now;	/* TRUE => try to go interactive */
 
-extern int no_env;	/* TRUE (-e) => ignore env vars on startup */
-extern int ign_errmax;	/* TRUE (-i) => ignore when errcount exceeds errmax */
-extern int new_std;	/* TRUE (-n) => use newstd configuration */
+extern DLL int argc_value;	/* count of argv[] strings for argv() builtin */
+extern DLL char **argv_value;	/* argv[] strings for argv() builtin */
 
-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_exec;	/* FALSE => may not execute any commands */
+extern DLL char *pager;		/* $PAGER or default */
+extern DLL int stdin_tty;	/* TRUE if stdin is a tty */
+extern DLL int havecommands;	/* TRUE if have cmd args) */
+extern DLL char *program;	/* our name */
+extern DLL char *base_name;	/* basename of our name */
+extern DLL char cmdbuf[];	/* command line expression */
 
-extern int post_init;	/* TRUE => setjmp for math_error is ready */
+extern DLL int abortlevel;	/* current level of aborts */
+extern DLL BOOL inputwait;	/* TRUE if in a terminal input wait */
+extern DLL VALUE *stack;	/* execution stack */
+extern DLL int dumpnames;	/* TRUE => dump names rather than indices */
 
+extern DLL char *calcpath;	/* $CALCPATH or default */
+extern DLL char *calcrc;	/* $CALCRC or default */
+extern DLL char *calcbindings;	/* $CALCBINDINGS or default */
+extern DLL char *home;		/* $HOME or default */
+extern DLL char *shell;		/* $SHELL or default */
+extern DLL char *program;	/* our name (argv[0]) */
+
+extern DLL int no_env;		/* TRUE (-e) => ignore env vars on startup */
+extern DLL long errmax;	/* if >= 0, error when errcount exceeds errmax */
+extern DLL int use_old_std;	/* TRUE (-O) => use classic configuration */
+
+extern DLL int allow_read;	/* FALSE => dont open any files for reading */
+extern DLL int allow_write; 	/* FALSE => dont open any files for writing */
+extern DLL int allow_exec;	/* FALSE => may not execute any commands */
+
+/*
+ * calc startup and run state
+ */
+typedef enum {
+    RUN_ZERO,			/* unknown or unset start state */
+    RUN_BEGIN,			/* calc execution starts */
+    RUN_RCFILES,		/* rc files being evaluated */
+    RUN_PRE_CMD_ARGS,		/* prepare to evaluate cmd args */
+    RUN_CMD_ARGS,		/* cmd args being evaluated */
+    RUN_PRE_TOP_LEVEL,		/* prepare to start top level activity */
+    RUN_TOP_LEVEL,		/* running at top level */
+    RUN_EXIT,			/* normal exit from calc */
+    RUN_EXIT_WITH_ERROR		/* exit with error */
+} run;
+extern DLL run run_state;
+extern DLL char *run_state_name(run state);
 
 /*
  * calc version information
@@ -180,8 +263,9 @@ extern int post_init;	/* TRUE => setjmp for math_error is ready */
 extern int calc_major_ver;
 extern int calc_minor_ver;
 extern int calc_major_patch;
-extern char *calc_minor_patch;
-extern char *version(void);	/* return version string */
+extern int calc_minor_patch;
+extern char *Copyright;
+extern DLL char *version(void);
 
 
 #endif /* !__CALC_H__ */

calc.spec.in

@@ -0,0 +1,123 @@
+#****h* calc/calc.spec.in
+#
+# calc.spec.in - template specfile for calc
+#
+# Copyright (C) 2003-2005  Petteri Kettunen 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.15 $
+# @(#) $Id: calc.spec.in,v 29.15 2006/05/21 06:26:00 chongo Exp $
+# @(#) $Source: /usr/local/src/cmd/calc/RCS/calc.spec.in,v $
+#
+# Under source code control:	2003/02/16 20:21:39
+# File existed as early as:	2003
+#
+# calculator by David I. Bell with help/mods from others
+# Makefile by Petteri Kettunen with modifications from Landon Curt Noll
+
+# BUGS
+#  - Uninstalling calc and calc-devel leaves empty dirs /usr/include/calc
+#    and /usr/share/calc and its subdirs. In case e.g. %{_includedir}/calc
+#    is defined in `%files devel' section, then rpmbuild complains that
+#    header files are defined twice - rpmbuild bug or bug in specfile conf???
+
+Summary: Arbitrary precision calculator.
+Name: calc
+Version: <<<PROJECT_VERSION>>>
+Release: 0
+Copyright: LGPL
+Group: Applications/Engineering
+Source: %{name}-%{version}.tar.gz
+URL: http://www.isthe.com/chongo/tech/comp/calc/index.html
+Requires: ncurses >= 5.2-26, readline >= 4.2, less >= 358
+BuildRequires: ncurses-devel >= 5.2-26, readline-devel >= 4.2
+BuildRoot: %{_tmppath}/%{name}-root
+
+%description
+Calc is arbitrary precision C-like arithmetic system that is a
+calculator, an algorithm prototype and mathematical research
+tool. Calc comes with a rich set of builtin mathematical and
+programmatic functions.
+
+For the latest calc release, see the calc project home page:
+
+    http://www.isthe.com/chongo/tech/comp/calc/index.html
+
+%package devel
+Summary: Development files and documentation for calc.
+Group: Development/Libraries
+PreReq: %{name} = %{version}-%{release}
+
+%description devel
+This package contains the header files and static libraries for developing
+calc (arbitrary precision calculator).
+
+For the latest calc release, see the project home page:
+
+    http://www.isthe.com/chongo/tech/comp/calc/index.html
+
+%prep
+%setup -q
+
+%build
+make %{?_smp_mflags} T=%{buildroot} BINDIR=%{_bindir} LIBDIR=%{_libdir} CALC_SHAREDIR=%{_datadir}/%{name} CALC_INCDIR=%{_includedir}/calc MANDIR=%{_mandir}/man1 all chk
+
+%install
+rm -rf %{buildroot}
+mkdir -p %{buildroot}
+make T=%{buildroot} BINDIR=%{_bindir} LIBDIR=%{_libdir} CALC_SHAREDIR=%{_datadir}/%{name} CALC_INCDIR=%{_includedir}/calc MANDIR=%{_mandir}/man1 install
+
+%clean
+rm -rf %{buildroot}
+
+%files
+%defattr(-, root, root)
+%doc BUGS CHANGES COPYING COPYING-LGPL
+%{_bindir}/*
+%{_mandir}/man1/*
+%{_datadir}/%{name}/*/*
+%{_datadir}/%{name}/bindings
+%{_datadir}/%{name}/README
+%{_datadir}/%{name}/*.cal
+%{_datadir}/%{name}/*.line
+
+%files devel
+%defattr(-, root, root)
+%doc BUGS COPYING COPYING-LGPL LIBRARY
+%attr(644, root, root) %{_includedir}/calc/*
+%attr(644, root, root) %{_libdir}/*.a
+
+%changelog
+* Sun May 20 2006 Landon Curt Noll http://www.isthe.com/chongo
+- Release of calc-2.12.0
+- Added *.line set files to the list of packaged files
+* Sun Dec 11 2005 Landon Curt Noll http://www.isthe.com/chongo
+- Release of calc-2.11.11
+- Fixed description in spec file
+* Wed Feb 26 2003 Landon Curt Noll http://www.isthe.com/chongo
+- Release of calc-2.11.7-2
+- Fixed attributes on include and lib calc-devel files
+- Added BUGS to calc-devel as well as calc
+* Tue Feb 25 2003 Landon Curt Noll http://www.isthe.com/chongo
+- Release of calc-2.11.7-1
+- Require ncurses, readline and less to install.
+- Require ncurses-devel and readline-devel to build.
+* Tue Feb 18 2003 Landon Curt Noll http://www.isthe.com/chongo
+- Misc changes to fit local directory setup
+* Sun Feb 16 2003 Petteri Kettunen <petterik@users.sourceforge.net>
+- initial RPM build
+
+#****

calc_errno.c

@@ -1,123 +0,0 @@
-/*
- * errno - Determine how to declare errno, sys_errlist and sys_nerr
- *
- * On most machines: errno sys_errlist and sys_nerr are declared
- * by either <stdio.h> and/or <errno.h>.  But some systems declare
- * them somewhere else or do not declare them at all!
- *
- * If the system were doing a proper job in headers, this should declare them:
- *
- *	#include <stdio.h>
- *	#include <errno.h>
- *
- * But one some systems one must explicitly declare them as:
- *
- *	extern int errno;
- *	extern const char *const sys_errlist[];
- *	extern int sys_nerr;
- *
- * and on some old systems they must be explicitly and incorrectly declared as:
- *
- *	extern int errno;
- *	extern char *sys_errlist[];
- *	extern int sys_nerr;
- *
- * The purpose of this utility is try and find the right way to declare
- * them and to output the middle of a header file called calc_errno.h.
- */
-
-/*
- * Copyright (c) 1999 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 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	/\../\
- */
-
-#include <stdio.h>
-#if defined(TRY_ERRNO_NO_DECL)
-#  include <errno.h>
-#endif /* TRY_ERRNO_NO_DECL */
-
-int
-main(void)
-{
-
-#if defined(TRY_ERRNO_NO_DECL)
-	printf("/*\n");
-	printf(" * The following comments were produced by calc_errno\n");
-	printf(" * in an effort to see if these values were correctly\n");
-	printf(" * declared when calc_errno.c was compiled.\n");
-	printf(" */\n\n");
-	printf("/* Initially errno is %d */\n", errno);
-	printf("/* There are %d entries in sys_errlist[] */\n", sys_nerr);
-	printf("/* The 2nd sys_errlist entry is \"%s\" */\n\n", sys_errlist[1]);
-	printf("/*\n");
-	printf(" * Based on the above, calc_errno now knows\n");
-	printf(" * how to declare errno and friends.\n");
-	printf(" */\n\n");
-	printf("#include <stdio.h>\n");
-	printf("#include <errno.h>\n");
-#elif defined(TRY_ERRNO_OLD_DECL)
-	extern int errno;		/* last system error */
-	extern char *sys_errlist[];	/* system error messages */
-	extern int sys_nerr;		/* number of system errors*/
-
-	printf("/*\n");
-	printf(" * The following comments were produced by calc_errno\n");
-	printf(" * in an effort to see if these values were correctly\n");
-	printf(" * declared when calc_errno.c was compiled.\n");
-	printf(" */\n\n");
-	printf("/* Initially errno is %d */\n", errno);
-	printf("/* There are %d entries in sys_errlist[] */\n", sys_nerr);
-	printf("/* The 2nd sys_errlist entry is \"%s\" */\n\n", sys_errlist[1]);
-	printf("/*\n");
-	printf(" * Based on the above, calc_errno now knows\n");
-	printf(" * how to declare errno and friends.\n");
-	printf(" */\n\n");
-	printf("extern int errno;\t\t/* last system error */\n");
-	printf("extern char *sys_errlist[];\t"
-	       "/* system error messages */\n");
-	printf("extern int sys_nerr;\t\t/* number of system errors*/\n");
-#else	/* assume defined(TRY_ERRNO_STD_DECL) */
-	extern int errno;			/* last system error */
-	extern const char *const sys_errlist[];	/* system error messages */
-	extern int sys_nerr;			/* number of system errors*/
-
-	printf("/*\n");
-	printf(" * The following comments were produced by calc_errno\n");
-	printf(" * in an effort to see if these values were correctly\n");
-	printf(" * declared when calc_errno.c was compiled.\n");
-	printf(" */\n\n");
-	printf("/* Initially errno is %d */\n", errno);
-	printf("/* There are %d entries in sys_errlist[] */\n", sys_nerr);
-	printf("/* The 2nd sys_errlist entry is \"%s\" */\n\n", sys_errlist[1]);
-	printf("/*\n");
-	printf(" * Based on the above, calc_errno now knows\n");
-	printf(" * how to declare errno and friends.\n");
-	printf(" */\n\n");
-	printf("extern int errno;\t\t\t/* last system error */\n");
-	printf("extern const char *const sys_errlist[];\t"
-	       "/* system error messages */\n");
-	printf("extern int sys_nerr;\t\t\t/* number of system errors*/\n");
-#endif
-
-	/* exit(0); */
-	return 0;
-}

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.8 $
+# @(#) $Id: calcerr.tbl,v 29.8 2006/05/19 15:12:57 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://www.isthe.com/chongo/tech/comp/calc/
+
 # This file is used to build calcerr.h include file.
 #
 # Lines should be of the form:
@@ -80,8 +108,8 @@ E_FGETSTR1	Non-file first argument for fgetstr
 E_FGETSTR2	File not open for reading for fgetstr
 E_FGETLINE1	Non-file  argument for fgetline
 E_FGETLINE2	File not open for reading for fgetline
-E_FGETWORD1	Non-file argument for fgetword
-E_FGETWORD2	File not open for reading for fgetword
+E_FGETFIELD1	Non-file argument for fgetfield
+E_FGETFIELD2	File not open for reading for fgetfield
 E_REWIND1	Non-file argument for rewind
 E_FILES		Non-integer argument for files
 E_PRINTF1	Non-string fmt argument for fprint
@@ -136,7 +164,7 @@ 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_MANYOPEN	Too many open files
 E_REWIND2	Attempt to rewind a file that is not open
 E_STRERROR1	Bad argument type for strerror
 E_STRERROR2	Index out of range for strerror
@@ -232,14 +260,14 @@ 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_COPY17	No-relocate 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_PROTECT2	Bad second argument for protect
+E_PROTECT3	Bad third 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
@@ -336,3 +364,84 @@ 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
+E_DGT1		Non-real first arg for digit
+E_DGT2		Non-integral second arg for digit
+E_DGT3		Bad third arg for digit
+E_PLCS1		Bad first argument for places
+E_PLCS2		Bad second argument for places
+E_DGTS1		Bad first argument for digits
+E_DGTS2		Bad second argument for digits
+E_ILOG		Bad first argument for ilog
+E_ILOGB		Bad second argument for ilog
+E_ILOG10	Bad argument for ilog10
+E_ILOG2		Bad argument for ilog2
+E_COMB1		Non-integer second arg for comb
+E_COMB2		Too-large second arg for comb
+E_CTLN		Bad argument for catalan
+E_BERN		Bad argument for bern
+E_EULER		Bad argument for euler
+E_SLEEP		Bad argument for sleep
+E_TTY		calc_tty failure
+E_ASSIGN1	No-copy-to destination for octet assign
+E_ASSIGN2	No-copy-from source for octet assign
+E_ASSIGN3	No-change destination for octet assign
+E_ASSIGN4	Non-variable destination for assign
+E_ASSIGN5	No-assign-to destination for assign
+E_ASSIGN6	No-assign-from source for assign
+E_ASSIGN7	No-change destination for assign
+E_ASSIGN8	No-type-change destination for assign
+E_ASSIGN9	No-error-value destination for assign
+E_SWAP1		No-copy argument for octet swap
+E_SWAP2		No-assign-to-or-from argument for swap
+E_SWAP3		Non-variable argument for swap
+E_QUOMOD1	Non-variable argument 4 or 4 for quomod
+E_QUOMOD2	Non-real-number argument 1 or 2 for quomod
+E_QUOMOD3	No-assign-to argument 3 or 4 for quomod
+E_PREINC1	No-copy-to or no-change argument for octet preinc
+E_PREINC2	Non-variable argument for preinc
+E_PREINC3	No-assign-to or no-change argument for preinc
+E_PREDEC1	No-copy-to or no-change argument for octet predec
+E_PREDEC2	Non-variable argument for predec
+E_PREDEC3	No-assign-to or no-change argument for predec
+E_POSTINC1	No-copy-to or no-change argument for octet postinc
+E_POSTINC2	Non-variable argument for postinc
+E_POSTINC3	No-assign-to or no-change argument for postinc
+E_POSTDEC1	No-copy-to or no-change argument for octet postdec
+E_POSTDEC2	Non-variable argument for postdec
+E_POSTDEC3	No-assign-to or no-change argument for postdec
+E_INIT1		Error-type structure for initialization
+E_INIT2		No-copy-to structure for initialization
+E_INIT3		Too many initializer values
+E_INIT4		Attempt to initialize freed named block
+E_INIT5		Bad structure type for initialization
+E_INIT6		No-assign-to element for initialization
+E_INIT7		No-change element for initialization
+E_INIT8		No-type-change element for initialization
+E_INIT9		No-error-value element for initialization
+E_INIT10	No-assign-or-copy-from source for initialization
+E_LIST1		No-relocate for list insert
+E_LIST2		No-relocate for list delete
+E_LIST3		No-relocate for list push
+E_LIST4		No-relocate for list append
+E_LIST5		No-relocate for list pop
+E_LIST6		No-relocate for list remove
+E_MODIFY1	Non-variable first argument for modify
+E_MODIFY2	Non-string second argument for modify
+E_MODIFY3	No-change first argument for modify
+E_MODIFY4	Undefined function for modify
+E_MODIFY5	Unacceptable type first argument for modify
+E_FPATHOPEN1	Non-string arguments for fpathopen
+E_FPATHOPEN2	Unrecognized mode for fpathopen
+E_LOG1		Bad epsilon argument for log
+E_LOG2		Non-numeric first argument for log

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.2 $
+# @(#) $Id: calcerr_c.awk,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/
+# Share and enjoy!  :-) http://www.isthe.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.2 $
+# @(#) $Id: calcerr_c.sed,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/
+# Share and enjoy!  :-)		http://www.isthe.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.2 $
+# @(#) $Id: calcerr_h.awk,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/
+# Share and enjoy!  :-) http://www.isthe.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.2 $
+# @(#) $Id: calcerr_h.sed,v 29.2 2000/06/07 14:02:13 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://www.isthe.com/chongo/
+# Share and enjoy!  :-)		http://www.isthe.com/chongo/tech/comp/calc/
+#
 s/#.*//
 s/[	 ][	 ]*$//
 /^$/d

check.awk

@@ -1,79 +1,114 @@
+#!/usr/bin/awk
+#
+# check - check the regression output for problems
+#
+# Copyright (C) 1999-2006  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: check.awk,v 29.3 2006/05/20 19:43:39 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://www.isthe.com/chongo/
+# Share and enjoy!  :-)		http://www.isthe.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]+:/ || $1 ~ /^[0-9]+-[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) {
-	exit(1);
-    } else {
-	exit(0);
-    }
+	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,17 +1,42 @@
 /*
- * Copyright (c) 1997 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.7 $
+ * @(#) $Id: cmath.h,v 29.7 2005/10/18 10:43:49 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
 
 #if !defined(__CMATH_H__)
-#define	__CMATH_H__
+#define __CMATH_H__
 
 
-#include "qmath.h"
+#if defined(CALC_SRC)	/* if we are building from the calc source tree */
+# include "qmath.h"
+#else
+# include <calc/qmath.h>
+#endif
 
 
 /*
@@ -37,62 +62,65 @@ extern void cprintfr(COMPLEX *c);
 /*
  * Basic numeric routines.
  */
-extern COMPLEX *cadd(COMPLEX *c1, COMPLEX *c2);
-extern COMPLEX *csub(COMPLEX *c1, COMPLEX *c2);
-extern COMPLEX *cmul(COMPLEX *c1, COMPLEX *c2);
-extern COMPLEX *cdiv(COMPLEX *c1, COMPLEX *c2);
-extern COMPLEX *caddq(COMPLEX *c, NUMBER *q);
-extern COMPLEX *csubq(COMPLEX *c, NUMBER *q);
-extern COMPLEX *cmulq(COMPLEX *c, NUMBER *q);
-extern COMPLEX *cdivq(COMPLEX *c, NUMBER *q);
-extern COMPLEX *cscale(COMPLEX *c, long i);
-extern COMPLEX *cshift(COMPLEX *c, long i);
-extern COMPLEX *csquare(COMPLEX *c);
-extern COMPLEX *cconj(COMPLEX *c);
-extern COMPLEX *creal(COMPLEX *c);
-extern COMPLEX *cimag(COMPLEX *c);
-extern COMPLEX *cneg(COMPLEX *c);
-extern COMPLEX *cinv(COMPLEX *c);
-extern COMPLEX *cint(COMPLEX *c);
-extern COMPLEX *cfrac(COMPLEX *c);
-extern BOOL ccmp(COMPLEX *c1, COMPLEX *c2);
+
+extern COMPLEX *c_add(COMPLEX *c1, COMPLEX *c2);
+extern COMPLEX *c_sub(COMPLEX *c1, COMPLEX *c2);
+extern COMPLEX *c_mul(COMPLEX *c1, COMPLEX *c2);
+extern COMPLEX *c_div(COMPLEX *c1, COMPLEX *c2);
+extern COMPLEX *c_addq(COMPLEX *c, NUMBER *q);
+extern COMPLEX *c_subq(COMPLEX *c, NUMBER *q);
+extern COMPLEX *c_mulq(COMPLEX *c, NUMBER *q);
+extern COMPLEX *c_divq(COMPLEX *c, NUMBER *q);
+extern COMPLEX *c_scale(COMPLEX *c, long i);
+extern COMPLEX *c_shift(COMPLEX *c, long i);
+extern COMPLEX *c_square(COMPLEX *c);
+extern COMPLEX *c_conj(COMPLEX *c);
+extern COMPLEX *c_real(COMPLEX *c);
+extern COMPLEX *c_imag(COMPLEX *c);
+extern COMPLEX *c_neg(COMPLEX *c);
+extern COMPLEX *c_inv(COMPLEX *c);
+extern COMPLEX *c_int(COMPLEX *c);
+extern COMPLEX *c_frac(COMPLEX *c);
+extern BOOL c_cmp(COMPLEX *c1, COMPLEX *c2);
 
 
 /*
  * More complicated functions.
  */
-extern COMPLEX *cpowi(COMPLEX *c, NUMBER *q);
+extern COMPLEX *c_powi(COMPLEX *c, NUMBER *q);
+extern NUMBER *c_ilog(COMPLEX *c, ZVALUE base);
 
 
 /*
  * Transcendental routines.  These all take an epsilon argument to
  * specify how accurately these are to be calculated.
  */
-extern COMPLEX *cpower(COMPLEX *c1, COMPLEX *c2, NUMBER *epsilon);
-extern COMPLEX *csqrt(COMPLEX *c, NUMBER *epsilon, long R);
-extern COMPLEX *croot(COMPLEX *c, NUMBER *q, NUMBER *epsilon);
-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);
+extern COMPLEX *c_power(COMPLEX *c1, COMPLEX *c2, NUMBER *epsilon);
+extern COMPLEX *c_sqrt(COMPLEX *c, NUMBER *epsilon, long R);
+extern COMPLEX *c_root(COMPLEX *c, NUMBER *q, NUMBER *epsilon);
+extern COMPLEX *c_exp(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_ln(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_log(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_cos(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_sin(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_cosh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_sinh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_polar(NUMBER *q1, NUMBER *q2, NUMBER *epsilon);
+extern COMPLEX *c_rel(COMPLEX *c1, COMPLEX *c2);
+extern COMPLEX *c_asin(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_acos(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_atan(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_acot(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_asec(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_acsc(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_asinh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_acosh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_atanh(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_acoth(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_asech(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_acsch(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_gd(COMPLEX *c, NUMBER *epsilon);
+extern COMPLEX *c_agd(COMPLEX *c, NUMBER *epsilon);
 
 
 
@@ -114,7 +142,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))

comfunc.c

@@ -1,14 +1,48 @@
 /*
- * 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.6 $
+ * @(#) $Id: comfunc.c,v 29.6 2006/05/20 08:43:55 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 #include "config.h"
 #include "cmath.h"
 
+/*
+ * cache the natural logarithm of 10
+ */
+static COMPLEX *cln_10 = NULL;
+static NUMBER *cln_10_epsilon = NULL;
+static NUMBER _q10_ = { { _tenval_, 1, 0 }, { _oneval_, 1, 0 }, 1, NULL };
+static NUMBER _q0_ = { { _zeroval_, 1, 0 }, { _oneval_, 1, 0 }, 1, NULL };
+COMPLEX _cten_ = { &_q10_, &_q0_, 1 };
+
+
 /*
  * Compute the result of raising a complex number to an integer power.
  *
@@ -17,7 +51,7 @@
  *	q		power to raise it to
  */
 COMPLEX *
-cpowi(COMPLEX *c, NUMBER *q)
+c_powi(COMPLEX *c, NUMBER *q)
 {
 	COMPLEX *tmp, *res;	/* temporary values */
 	long power;		/* power to raise to */
@@ -45,29 +79,29 @@ cpowi(COMPLEX *c, NUMBER *q)
 	 */
 	if (power <= 4) {
 		switch ((int) (power * sign)) {
-			case 0:
-				return clink(&_cone_);
-			case 1:
-				return clink(c);
-			case -1:
-				return cinv(c);
-			case 2:
-				return csquare(c);
-			case -2:
-				tmp = csquare(c);
-				res = cinv(tmp);
-				comfree(tmp);
-				return res;
-			case 3:
-				tmp = csquare(c);
-				res = cmul(c, tmp);
-				comfree(tmp);
-				return res;
-			case 4:
-				tmp = csquare(c);
-				res = csquare(tmp);
-				comfree(tmp);
-				return res;
+		case 0:
+			return clink(&_cone_);
+		case 1:
+			return clink(c);
+		case -1:
+			return c_inv(c);
+		case 2:
+			return c_square(c);
+		case -2:
+			tmp = c_square(c);
+			res = c_inv(tmp);
+			comfree(tmp);
+			return res;
+		case 3:
+			tmp = c_square(c);
+			res = c_mul(c, tmp);
+			comfree(tmp);
+			return res;
+		case 4:
+			tmp = c_square(c);
+			res = c_square(tmp);
+			comfree(tmp);
+			return res;
 		}
 	}
 	/*
@@ -78,26 +112,26 @@ cpowi(COMPLEX *c, NUMBER *q)
 	while ((bit & power) == 0)
 		bit >>= 1L;
 	bit >>= 1L;
-	res = csquare(c);
+	res = c_square(c);
 	if (bit & power) {
-		tmp = cmul(res, c);
+		tmp = c_mul(res, c);
 		comfree(res);
 		res = tmp;
 	}
 	bit >>= 1L;
 	while (bit) {
-		tmp = csquare(res);
+		tmp = c_square(res);
 		comfree(res);
 		res = tmp;
 		if (bit & power) {
-			tmp = cmul(res, c);
+			tmp = c_mul(res, c);
 			comfree(res);
 			res = tmp;
 		}
 		bit >>= 1L;
 	}
 	if (sign < 0) {
-		tmp = cinv(res);
+		tmp = c_inv(res);
 		comfree(res);
 		res = tmp;
 	}
@@ -110,7 +144,7 @@ cpowi(COMPLEX *c, NUMBER *q)
  * Type of rounding of each component specified by R as for qsqrt().
  */
 COMPLEX *
-csqrt(COMPLEX *c, NUMBER *epsilon, long R)
+c_sqrt(COMPLEX *c, NUMBER *epsilon, long R)
 {
 	COMPLEX *r;
 	NUMBER *es, *aes, *bes, *u, *v, qtemp;
@@ -138,38 +172,6 @@ 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 = qqdiv(aes, u);
-		qfree(aes);
-		r = comalloc();
-		r->real = u;
-		r->imag = v;
-		return r;
-	}
-#endif
 	imsign = c->imag->num.sign;
 	es = qsquare(epsilon);
 	aes = qqdiv(c->real, es);
@@ -231,8 +233,7 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 				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);
@@ -256,8 +257,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);
@@ -288,8 +288,7 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
 				return r;
 			}
 			s3 = zquo(tmp3, d, &mul1, 0);
-		}
-		else {
+		} else {
 			s2 = zquo(tmp1, d, &tmp3, 0);
 			zfree(tmp1);
 			s3 = zsqrt(tmp3, &mul1, 0);
@@ -335,9 +334,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);
@@ -345,9 +344,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);
@@ -374,7 +373,7 @@ csqrt(COMPLEX *c, NUMBER *epsilon, long R)
  * Each component of the result is within the specified error.
  */
 COMPLEX *
-croot(COMPLEX *c, NUMBER *q, NUMBER *epsilon)
+c_root(COMPLEX *c, NUMBER *q, NUMBER *epsilon)
 {
 	COMPLEX *r;
 	NUMBER *a2pb2, *root, *tmp1, *tmp2, *epsilon2;
@@ -387,17 +386,20 @@ croot(COMPLEX *c, NUMBER *q, NUMBER *epsilon)
 	if (cisone(c) || qisone(q))
 		return clink(c);
 	if (qistwo(q))
-		return csqrt(c, epsilon, 24L);
+		return c_sqrt(c, epsilon, 24L);
 	if (cisreal(c) && !qisneg(c->real)) {
+		tmp1 = qroot(c->real, q, epsilon);
+		if (tmp1 == NULL)
+			return NULL;
 		r = comalloc();
 		qfree(r->real);
-		r->real = qroot(c->real, q, epsilon);
+		r->real = tmp1;
 		return r;
 	}
 	/*
 	 * Calculate the root using the formula:
-	 *	croot(a + bi, n) =
-	 *		cpolar(qroot(a^2 + b^2, 2 * n), qatan2(b, a) / n).
+	 *	c_root(a + bi, n) =
+	 *		c_polar(qroot(a^2 + b^2, 2 * n), qatan2(b, a) / n).
 	 */
 	n = qilog2(epsilon);
 	epsilon2 = qbitvalue(n - 4);
@@ -410,18 +412,20 @@ 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 = qqdiv(tmp1, q);
 	qfree(tmp1);
-	r = cpolar(root, tmp2, epsilon);
+	r = c_polar(root, tmp2, epsilon);
 	qfree(root);
 	qfree(tmp2);
 	return r;
@@ -434,7 +438,7 @@ croot(COMPLEX *c, NUMBER *q, NUMBER *epsilon)
  *	exp(a + bi) = exp(a) * (cos(b) + i * sin(b)).
  */
 COMPLEX *
-cexp(COMPLEX *c, NUMBER *epsilon)
+c_exp(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *r;
 	NUMBER *sin, *cos, *tmp1, *tmp2, *epsilon1;
@@ -445,6 +449,9 @@ cexp(COMPLEX *c, NUMBER *epsilon)
 		/*NOTREACHED*/
 	}
 	if (cisreal(c)) {
+		tmp1 = qexp(c->real, epsilon);
+		if (tmp1 == NULL)
+			return NULL;
 		r = comalloc();
 		qfree(r->real);
 		r->real = qexp(c->real, epsilon);
@@ -454,6 +461,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_);
@@ -486,13 +495,13 @@ cexp(COMPLEX *c, NUMBER *epsilon)
  *	ln(a + bi) = ln(a^2 + b^2) / 2 + i * atan2(b, a).
  */
 COMPLEX *
-cln(COMPLEX *c, NUMBER *epsilon)
+c_ln(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *r;
 	NUMBER *a2b2, *tmp1, *tmp2, *epsilon1;
 
 	if (ciszero(c)) {
-		math_error("Logarithm of zero");
+		math_error("logarithm of zero");
 		/*NOTREACHED*/
 	}
 	if (cisone(c))
@@ -520,6 +529,60 @@ cln(COMPLEX *c, NUMBER *epsilon)
 	return r;
 }
 
+/*
+ * Calculate base 10 logarithm by:
+ *
+ *	log(c) = ln(c) / ln(10)
+ */
+COMPLEX *
+c_log(COMPLEX *c, NUMBER *epsilon)
+{
+	int need_new_cln_10 = TRUE;	/* FALSE => use cached cln_10 value */
+	COMPLEX *ln_c;			/* ln(x) */
+	COMPLEX *ret;			/* base 10 logarithm of x */
+
+	/*
+	 * compute ln(c) first
+	 */
+	ln_c = c_ln(c, epsilon);
+	/* log(1) == 0 */
+	if (ciszero(ln_c)) {
+		return ln_c;
+	}
+
+	/*
+	 * save epsilon for ln(10) if needed
+	 */
+	if (cln_10_epsilon == NULL) {
+		/* first time call */
+		cln_10_epsilon = qcopy(epsilon);
+	} else if (qcmp(cln_10_epsilon, epsilon) == FALSE) {
+		/* replaced cacheed value with epsilon arg */
+		qfree(cln_10_epsilon);
+		cln_10_epsilon = qcopy(epsilon);
+	} else if (cln_10 != NULL) {
+		/* the previously computed ln(2) is OK to use */
+		need_new_cln_10 = FALSE;
+	}
+
+	/*
+	 * compute ln(10) if needed
+	 */
+	if (need_new_cln_10 == TRUE) {
+		if (cln_10 != NULL) {
+			comfree(cln_10);
+		}
+		cln_10 = c_ln(&_cten_, cln_10_epsilon);
+	}
+
+	/*
+	 * return ln(c) / ln(10)
+	 */
+	ret = c_div(ln_c, cln_10);
+	comfree(ln_c);
+	return ret;
+}
+
 
 /*
  * Calculate the complex cosine within the specified accuracy.
@@ -527,7 +590,7 @@ cln(COMPLEX *c, NUMBER *epsilon)
  *	cos(x) = (exp(1i * x) + exp(-1i * x))/2;
  */
 COMPLEX *
-ccos(COMPLEX *c, NUMBER *epsilon)
+c_cos(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *r, *ctmp1, *ctmp2, *ctmp3;
 	NUMBER *epsilon1;
@@ -546,18 +609,20 @@ ccos(COMPLEX *c, NUMBER *epsilon)
 	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);
+	ctmp2 = c_exp(ctmp1, epsilon1);
 	comfree(ctmp1);
 	qfree(epsilon1);
+	if (ctmp2 == NULL)
+		return NULL;
 	if (ciszero(ctmp2)) {
 		comfree(ctmp2);
 		return clink(&_czero_);
 	}
-	ctmp1 = cinv(ctmp2);
-	ctmp3 = cadd(ctmp2, ctmp1);
+	ctmp1 = c_inv(ctmp2);
+	ctmp3 = c_add(ctmp2, ctmp1);
 	comfree(ctmp1);
 	comfree(ctmp2);
-	ctmp1 = cscale(ctmp3, -1);
+	ctmp1 = c_scale(ctmp3, -1);
 	comfree(ctmp3);
 	r = comalloc();
 	qfree(r->real);
@@ -575,7 +640,7 @@ ccos(COMPLEX *c, NUMBER *epsilon)
  *	sin(x) = (exp(1i * x) - exp(-i1*x))/(2i).
  */
 COMPLEX *
-csin(COMPLEX *c, NUMBER *epsilon)
+c_sin(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *r, *ctmp1, *ctmp2, *ctmp3;
 	NUMBER *qtmp, *epsilon1;
@@ -596,18 +661,20 @@ csin(COMPLEX *c, NUMBER *epsilon)
 	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);
+	ctmp2 = c_exp(ctmp1, epsilon1);
 	comfree(ctmp1);
 	qfree(epsilon1);
+	if (ctmp2 == NULL)
+		return NULL;
 	if (ciszero(ctmp2)) {
 		comfree(ctmp2);
 		return clink(&_czero_);
 	}
-	ctmp1 = cinv(ctmp2);
-	ctmp3 = csub(ctmp2, ctmp1);
+	ctmp1 = c_inv(ctmp2);
+	ctmp3 = c_sub(ctmp2, ctmp1);
 	comfree(ctmp1);
 	comfree(ctmp2);
-	ctmp1 = cscale(ctmp3, -1);
+	ctmp1 = c_scale(ctmp3, -1);
 	comfree(ctmp3);
 	r = comalloc();
 	qtmp = neg ? qlink(ctmp1->imag) : qneg(ctmp1->imag);
@@ -624,97 +691,105 @@ csin(COMPLEX *c, NUMBER *epsilon)
 
 
 COMPLEX *
-ccosh(COMPLEX *c, NUMBER *epsilon)
+c_cosh(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2, *tmp3;
 
-	tmp1 = cexp(c, epsilon);
-	tmp2 = cneg(c);
-	tmp3 = cexp(tmp2, epsilon);
+	tmp1 = c_exp(c, epsilon);
+	if (tmp1 == NULL)
+		return NULL;
+	tmp2 = c_neg(c);
+	tmp3 = c_exp(tmp2, epsilon);
 	comfree(tmp2);
-	tmp2 = cadd(tmp1, tmp3);
+	if (tmp3 == NULL)
+		return NULL;
+	tmp2 = c_add(tmp1, tmp3);
 	comfree(tmp1);
 	comfree(tmp3);
-	tmp1 = cscale(tmp2, -1);
+	tmp1 = c_scale(tmp2, -1);
 	comfree(tmp2);
 	return tmp1;
 }
 
 
 COMPLEX *
-csinh(COMPLEX *c, NUMBER *epsilon)
+c_sinh(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2, *tmp3;
 
-	tmp1 = cexp(c, epsilon);
-	tmp2 = cneg(c);
-	tmp3 = cexp(tmp2, epsilon);
+	tmp1 = c_exp(c, epsilon);
+	if (tmp1 == NULL)
+		return NULL;
+	tmp2 = c_neg(c);
+	tmp3 = c_exp(tmp2, epsilon);
 	comfree(tmp2);
-	tmp2 = csub(tmp1, tmp3);
+	if (tmp3 == NULL)
+		return NULL;
+	tmp2 = c_sub(tmp1, tmp3);
 	comfree(tmp1);
 	comfree(tmp3);
-	tmp1 = cscale(tmp2, -1);
+	tmp1 = c_scale(tmp2, -1);
 	comfree(tmp2);
 	return tmp1;
 }
 
 
 COMPLEX *
-casin(COMPLEX *c, NUMBER *epsilon)
+c_asin(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = cmul(&_conei_, c);
-	tmp2 = casinh(tmp1, epsilon);
+	tmp1 = c_mul(&_conei_, c);
+	tmp2 = c_asinh(tmp1, epsilon);
 	comfree(tmp1);
-	tmp1 = cdiv(tmp2, &_conei_);
+	tmp1 = c_div(tmp2, &_conei_);
 	comfree(tmp2);
 	return tmp1;
 }
 
 
 COMPLEX *
-cacos(COMPLEX *c, NUMBER *epsilon)
+c_acos(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = csquare(c);
-	tmp2 = csub(&_cone_, tmp1);
+	tmp1 = c_square(c);
+	tmp2 = c_sub(&_cone_, tmp1);
 	comfree(tmp1);
-	tmp1 = csqrt(tmp2, epsilon, 24);
+	tmp1 = c_sqrt(tmp2, epsilon, 24);
 	comfree(tmp2);
-	tmp2 = cmul(&_conei_, tmp1);
+	tmp2 = c_mul(&_conei_, tmp1);
 	comfree(tmp1);
-	tmp1 = cadd(c, tmp2);
+	tmp1 = c_add(c, tmp2);
 	comfree(tmp2);
-	tmp2 = cln(tmp1, epsilon);
+	tmp2 = c_ln(tmp1, epsilon);
 	comfree(tmp1);
-	tmp1 = cdiv(tmp2, &_conei_);
+	tmp1 = c_div(tmp2, &_conei_);
 	comfree(tmp2);
 	return tmp1;
 }
 
 
 COMPLEX *
-casinh(COMPLEX *c, NUMBER *epsilon)
+c_asinh(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);
+	tmp1 = neg ? c_neg(c) : clink(c);
+	tmp2 = c_square(tmp1);
+	tmp3 = c_add(&_cone_, tmp2);
 	comfree(tmp2);
-	tmp2 = csqrt(tmp3, epsilon, 24);
+	tmp2 = c_sqrt(tmp3, epsilon, 24);
 	comfree(tmp3);
-	tmp3 = cadd(tmp2, tmp1);
+	tmp3 = c_add(tmp2, tmp1);
 	comfree(tmp1);
 	comfree(tmp2);
-	tmp1 = cln(tmp3, epsilon);
+	tmp1 = c_ln(tmp3, epsilon);
 	comfree(tmp3);
 	if (neg) {
-		tmp2 = cneg(tmp1);
+		tmp2 = c_neg(tmp1);
 		comfree(tmp1);
 		return tmp2;
 	}
@@ -723,153 +798,153 @@ casinh(COMPLEX *c, NUMBER *epsilon)
 
 
 COMPLEX *
-cacosh(COMPLEX *c, NUMBER *epsilon)
+c_acosh(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = csquare(c);
-	tmp2 = csub(tmp1, &_cone_);
+	tmp1 = c_square(c);
+	tmp2 = c_sub(tmp1, &_cone_);
 	comfree(tmp1);
-	tmp1 = csqrt(tmp2, epsilon, 24);
+	tmp1 = c_sqrt(tmp2, epsilon, 24);
 	comfree(tmp2);
-	tmp2 = cadd(c, tmp1);
+	tmp2 = c_add(c, tmp1);
 	comfree(tmp1);
-	tmp1 = cln(tmp2, epsilon);
+	tmp1 = c_ln(tmp2, epsilon);
 	comfree(tmp2);
 	return tmp1;
 }
 
 
 COMPLEX *
-catan(COMPLEX *c, NUMBER *epsilon)
+c_atan(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);
+	tmp1 = c_sub(&_conei_, c);
+	tmp2 = c_add(&_conei_, c);
+	tmp3 = c_div(tmp1, tmp2);
 	comfree(tmp1);
 	comfree(tmp2);
-	tmp1 = cln(tmp3, epsilon);
+	tmp1 = c_ln(tmp3, epsilon);
 	comfree(tmp3);
-	tmp2 = cscale(tmp1, -1);
+	tmp2 = c_scale(tmp1, -1);
 	comfree(tmp1);
-	tmp1 = cdiv(tmp2, &_conei_);
+	tmp1 = c_div(tmp2, &_conei_);
 	comfree(tmp2);
 	return tmp1;
 }
 
 
 COMPLEX *
-cacot(COMPLEX *c, NUMBER *epsilon)
+c_acot(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);
+	tmp1 = c_add(c, &_conei_);
+	tmp2 = c_sub(c, &_conei_);
+	tmp3 = c_div(tmp1, tmp2);
 	comfree(tmp1);
 	comfree(tmp2);
-	tmp1 = cln(tmp3, epsilon);
+	tmp1 = c_ln(tmp3, epsilon);
 	comfree(tmp3);
-	tmp2 = cscale(tmp1, -1);
+	tmp2 = c_scale(tmp1, -1);
 	comfree(tmp1);
-	tmp1 = cdiv(tmp2, &_conei_);
+	tmp1 = c_div(tmp2, &_conei_);
 	comfree(tmp2);
 	return tmp1;
 }
 
 COMPLEX *
-casec(COMPLEX *c, NUMBER *epsilon)
+c_asec(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = cinv(c);
-	tmp2 = cacos(tmp1, epsilon);
+	tmp1 = c_inv(c);
+	tmp2 = c_acos(tmp1, epsilon);
 	comfree(tmp1);
 	return tmp2;
 }
 
 COMPLEX *
-cacsc(COMPLEX *c, NUMBER *epsilon)
+c_acsc(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = cinv(c);
-	tmp2 = casin(tmp1, epsilon);
+	tmp1 = c_inv(c);
+	tmp2 = c_asin(tmp1, epsilon);
 	comfree(tmp1);
 	return tmp2;
 }
 
 
 COMPLEX *
-catanh(COMPLEX *c, NUMBER *epsilon)
+c_atanh(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);
+	tmp1 = c_add(&_cone_, c);
+	tmp2 = c_sub(&_cone_, c);
+	tmp3 = c_div(tmp1, tmp2);
 	comfree(tmp1);
 	comfree(tmp2);
-	tmp1 = cln(tmp3, epsilon);
+	tmp1 = c_ln(tmp3, epsilon);
 	comfree(tmp3);
-	tmp2 = cscale(tmp1, -1);
+	tmp2 = c_scale(tmp1, -1);
 	comfree(tmp1);
 	return tmp2;
 }
 
 
 COMPLEX *
-cacoth(COMPLEX *c, NUMBER *epsilon)
+c_acoth(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);
+	tmp1 = c_add(c, &_cone_);
+	tmp2 = c_sub(c, &_cone_);
+	tmp3 = c_div(tmp1, tmp2);
 	comfree(tmp1);
 	comfree(tmp2);
-	tmp1 = cln(tmp3, epsilon);
+	tmp1 = c_ln(tmp3, epsilon);
 	comfree(tmp3);
-	tmp2 = cscale(tmp1, -1);
+	tmp2 = c_scale(tmp1, -1);
 	comfree(tmp1);
 	return tmp2;
 }
 
 COMPLEX *
-casech(COMPLEX *c, NUMBER *epsilon)
+c_asech(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = cinv(c);
-	tmp2 = cacosh(tmp1, epsilon);
+	tmp1 = c_inv(c);
+	tmp2 = c_acosh(tmp1, epsilon);
 	comfree(tmp1);
 	return tmp2;
 }
 
 COMPLEX *
-cacsch(COMPLEX *c, NUMBER *epsilon)
+c_acsch(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = cinv(c);
-	tmp2 = casinh(tmp1, epsilon);
+	tmp1 = c_inv(c);
+	tmp2 = c_asinh(tmp1, epsilon);
 	comfree(tmp1);
 	return tmp2;
 }
 
 
 COMPLEX *
-cgd(COMPLEX *c, NUMBER *epsilon)
+c_gd(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2, *tmp3;
 	NUMBER *q1, *q2;
@@ -936,28 +1011,30 @@ cgd(COMPLEX *c, NUMBER *epsilon)
 		return tmp1;
 	}
 	neg = qisneg(c->real);
-	tmp1 = neg ? cneg(c) : clink(c);
-	tmp2 = cexp(tmp1, epsilon);
+	tmp1 = neg ? c_neg(c) : clink(c);
+	tmp2 = c_exp(tmp1, epsilon);
 	comfree(tmp1);
-	tmp1 = cmul(&_conei_, tmp2);
-	tmp3 = cadd(&_conei_, tmp2);
+	if (tmp2 == NULL)
+		return NULL;
+	tmp1 = c_mul(&_conei_, tmp2);
+	tmp3 = c_add(&_conei_, tmp2);
 	comfree(tmp2);
-	tmp2 = cadd(tmp1, &_cone_);
+	tmp2 = c_add(tmp1, &_cone_);
 	comfree(tmp1);
 	if (ciszero(tmp2) || ciszero(tmp3)) {
 		comfree(tmp2);
 		comfree(tmp3);
 		return NULL;
 	}
-	tmp1 = cdiv(tmp2, tmp3);
+	tmp1 = c_div(tmp2, tmp3);
 	comfree(tmp2);
 	comfree(tmp3);
-	tmp2 = cln(tmp1, epsilon);
+	tmp2 = c_ln(tmp1, epsilon);
 	comfree(tmp1);
-	tmp1 = cdiv(tmp2, &_conei_);
+	tmp1 = c_div(tmp2, &_conei_);
 	comfree(tmp2);
 	if (neg) {
-		tmp2 = cneg(tmp1);
+		tmp2 = c_neg(tmp1);
 		comfree(tmp1);
 		return tmp2;
 	}
@@ -966,16 +1043,16 @@ cgd(COMPLEX *c, NUMBER *epsilon)
 
 
 COMPLEX *
-cagd(COMPLEX *c, NUMBER *epsilon)
+c_agd(COMPLEX *c, NUMBER *epsilon)
 {
 	COMPLEX *tmp1, *tmp2;
 
-	tmp1 = cmul(&_conei_, c);
-	tmp2 = cgd(tmp1, epsilon);
+	tmp1 = c_mul(&_conei_, c);
+	tmp2 = c_gd(tmp1, epsilon);
 	comfree(tmp1);
 	if (tmp2 == NULL)
 		return NULL;
-	tmp1 = cdiv(tmp2, &_conei_);
+	tmp1 = c_div(tmp2, &_conei_);
 	comfree(tmp2);
 	return tmp1;
 }
@@ -987,22 +1064,22 @@ cagd(COMPLEX *c, NUMBER *epsilon)
  *	q1 * cos(q2) + q1 * sin(q2) * i.
  */
 COMPLEX *
-cpolar(NUMBER *q1, NUMBER *q2, NUMBER *epsilon)
+c_polar(NUMBER *q1, NUMBER *q2, NUMBER *epsilon)
 {
 	COMPLEX *r;
 	NUMBER *tmp, *cos, *sin;
 	long m, n;
 
 	if (qiszero(epsilon)) {
-		math_error("Zero epsilson for cpolar");
+		math_error("Zero epsilon for cpolar");
 		/*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);
@@ -1029,7 +1106,7 @@ cpolar(NUMBER *q1, NUMBER *q2, NUMBER *epsilon)
  * specified error.
  */
 COMPLEX *
-cpower(COMPLEX *c1, COMPLEX *c2, NUMBER *epsilon)
+c_power(COMPLEX *c1, COMPLEX *c2, NUMBER *epsilon)
 {
 	COMPLEX *ctmp1, *ctmp2;
 	long k1, k2, k, m1, m2, m, n;
@@ -1086,11 +1163,11 @@ cpower(COMPLEX *c1, COMPLEX *c2, NUMBER *epsilon)
 	if (k < n)
 		return clink(&_czero_);
 	epsilon1 = qbitvalue(n - k - m - 2);
-	ctmp1 = cln(c1, epsilon1);
+	ctmp1 = c_ln(c1, epsilon1);
 	qfree(epsilon1);
-	ctmp2 = cmul(ctmp1, c2);
+	ctmp2 = c_mul(ctmp1, c2);
 	comfree(ctmp1);
-	ctmp1 = cexp(ctmp2, epsilon);
+	ctmp1 = c_exp(ctmp2, epsilon);
 	comfree(ctmp2);
 	return ctmp1;
 }
@@ -1150,4 +1227,26 @@ cprintfr(COMPLEX *c)
 	}
 }
 
-/* END CODE */
+
+NUMBER *
+c_ilog(COMPLEX *c, ZVALUE base)
+{
+	NUMBER *qr, *qi;
+
+	qr = qilog(c->real, base);
+	qi = qilog(c->imag, base);
+
+	if (qr == NULL) {
+		if (qi == NULL)
+			return NULL;
+		return qi;
+	}
+	if (qi == NULL)
+		return qr;
+	if (qrel(qr, qi) >= 0) {
+		qfree(qi);
+		return qr;
+	}
+	qfree(qr);
+	return qi;
+}

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.4 $
+ * @(#) $Id: commath.c,v 29.4 2005/10/18 10:43:49 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://www.isthe.com/chongo/tech/comp/calc/
  */
 
+
 #include "cmath.h"
 
 
@@ -20,7 +42,7 @@ static COMPLEX _cnegone_ =	{ &_qnegone_, &_qzero_, 1 };
  * Add two complex numbers.
  */
 COMPLEX *
-cadd(COMPLEX *c1, COMPLEX *c2)
+c_add(COMPLEX *c1, COMPLEX *c2)
 {
 	COMPLEX *r;
 
@@ -45,7 +67,7 @@ cadd(COMPLEX *c1, COMPLEX *c2)
  * Subtract two complex numbers.
  */
 COMPLEX *
-csub(COMPLEX *c1, COMPLEX *c2)
+c_sub(COMPLEX *c1, COMPLEX *c2)
 {
 	COMPLEX *r;
 
@@ -69,14 +91,14 @@ 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
  * Then (a+bi) * (c+di) = (q2 - q3) + (q1 - q2 - q3)i.
  */
 COMPLEX *
-cmul(COMPLEX *c1, COMPLEX *c2)
+c_mul(COMPLEX *c1, COMPLEX *c2)
 {
 	COMPLEX *r;
 	NUMBER *q1, *q2, *q3, *q4;
@@ -88,9 +110,9 @@ cmul(COMPLEX *c1, COMPLEX *c2)
 	if (cisone(c2))
 		return clink(c1);
 	if (cisreal(c2))
-		return cmulq(c1, c2->real);
+		return c_mulq(c1, c2->real);
 	if (cisreal(c1))
-		return cmulq(c2, c1->real);
+		return c_mulq(c2, c1->real);
 	/*
 	 * Need to do the full calculation.
 	 */
@@ -119,7 +141,7 @@ cmul(COMPLEX *c1, COMPLEX *c2)
  * Square a complex number.
  */
 COMPLEX *
-csquare(COMPLEX *c)
+c_square(COMPLEX *c)
 {
 	COMPLEX *r;
 	NUMBER *q1, *q2;
@@ -161,7 +183,7 @@ csquare(COMPLEX *c)
  * Divide two complex numbers.
  */
 COMPLEX *
-cdiv(COMPLEX *c1, COMPLEX *c2)
+c_div(COMPLEX *c1, COMPLEX *c2)
 {
 	COMPLEX *r;
 	NUMBER *q1, *q2, *q3, *den;
@@ -232,7 +254,7 @@ cdiv(COMPLEX *c1, COMPLEX *c2)
  * Invert a complex number.
  */
 COMPLEX *
-cinv(COMPLEX *c)
+c_inv(COMPLEX *c)
 {
 	COMPLEX *r;
 	NUMBER *q1, *q2, *den;
@@ -274,7 +296,7 @@ cinv(COMPLEX *c)
  * Negate a complex number.
  */
 COMPLEX *
-cneg(COMPLEX *c)
+c_neg(COMPLEX *c)
 {
 	COMPLEX *r;
 
@@ -298,7 +320,7 @@ cneg(COMPLEX *c)
  * This means take the integer part of both components.
  */
 COMPLEX *
-cint(COMPLEX *c)
+c_int(COMPLEX *c)
 {
 	COMPLEX *r;
 
@@ -318,7 +340,7 @@ cint(COMPLEX *c)
  * This means take the fractional part of both components.
  */
 COMPLEX *
-cfrac(COMPLEX *c)
+c_frac(COMPLEX *c)
 {
 	COMPLEX *r;
 
@@ -338,7 +360,7 @@ cfrac(COMPLEX *c)
  * This negates the complex part.
  */
 COMPLEX *
-cconj(COMPLEX *c)
+c_conj(COMPLEX *c)
 {
 	COMPLEX *r;
 
@@ -359,7 +381,7 @@ cconj(COMPLEX *c)
  * Return the real part of a complex number.
  */
 COMPLEX *
-creal(COMPLEX *c)
+c_real(COMPLEX *c)
 {
 	COMPLEX *r;
 
@@ -378,7 +400,7 @@ creal(COMPLEX *c)
  * Return the imaginary part of a complex number as a real.
  */
 COMPLEX *
-cimag(COMPLEX *c)
+c_imag(COMPLEX *c)
 {
 	COMPLEX *r;
 
@@ -395,7 +417,7 @@ cimag(COMPLEX *c)
  * Add a real number to a complex number.
  */
 COMPLEX *
-caddq(COMPLEX *c, NUMBER *q)
+c_addq(COMPLEX *c, NUMBER *q)
 {
 	COMPLEX *r;
 
@@ -414,7 +436,7 @@ caddq(COMPLEX *c, NUMBER *q)
  * Subtract a real number from a complex number.
  */
 COMPLEX *
-csubq(COMPLEX *c, NUMBER *q)
+c_subq(COMPLEX *c, NUMBER *q)
 {
 	COMPLEX *r;
 
@@ -434,7 +456,7 @@ csubq(COMPLEX *c, NUMBER *q)
  * number of bits.  Negative values shift to the right.
  */
 COMPLEX *
-cshift(COMPLEX *c, long n)
+c_shift(COMPLEX *c, long n)
 {
 	COMPLEX *r;
 
@@ -453,7 +475,7 @@ cshift(COMPLEX *c, long n)
  * Scale a complex number by a power of two.
  */
 COMPLEX *
-cscale(COMPLEX *c, long n)
+c_scale(COMPLEX *c, long n)
 {
 	COMPLEX *r;
 
@@ -472,7 +494,7 @@ cscale(COMPLEX *c, long n)
  * Multiply a complex number by a real number.
  */
 COMPLEX *
-cmulq(COMPLEX *c, NUMBER *q)
+c_mulq(COMPLEX *c, NUMBER *q)
 {
 	COMPLEX *r;
 
@@ -481,7 +503,7 @@ cmulq(COMPLEX *c, NUMBER *q)
 	if (qisone(q))
 		return clink(c);
 	if (qisnegone(q))
-		return cneg(c);
+		return c_neg(c);
 	r = comalloc();
 	qfree(r->real);
 	qfree(r->imag);
@@ -495,7 +517,7 @@ cmulq(COMPLEX *c, NUMBER *q)
  * Divide a complex number by a real number.
  */
 COMPLEX *
-cdivq(COMPLEX *c, NUMBER *q)
+c_divq(COMPLEX *c, NUMBER *q)
 {
 	COMPLEX *r;
 
@@ -506,7 +528,7 @@ cdivq(COMPLEX *c, NUMBER *q)
 	if (qisone(q))
 		return clink(c);
 	if (qisnegone(q))
-		return cneg(c);
+		return c_neg(c);
 	r = comalloc();
 	qfree(r->real);
 	qfree(r->imag);
@@ -542,7 +564,7 @@ qqtoc(NUMBER *q1, NUMBER *q2)
  * and TRUE if they differ.
  */
 BOOL
-ccmp(COMPLEX *c1, COMPLEX *c2)
+c_cmp(COMPLEX *c1, COMPLEX *c2)
 {
 	BOOL i;
 
@@ -559,7 +581,7 @@ ccmp(COMPLEX *c1, COMPLEX *c2)
  * imaginary parts of the two numbers.
  */
 COMPLEX *
-crel(COMPLEX *c1, COMPLEX *c2)
+c_rel(COMPLEX *c1, COMPLEX *c2)
 {
 	COMPLEX *c;
 
@@ -605,5 +627,3 @@ comfree(COMPLEX *c)
 	qfree(c->imag);
 	free(c);
 }
-
-/* END CODE */