mirror of https://github.com/wwarthen/RomWBW.git
Wayne Warthen
7 years ago
committed by
GitHub
GitHub
19 changed files with 3695 additions and 271 deletions
@ -1,4 +1,9 @@ |
|||||
@echo off |
@echo off |
||||
|
|
||||
|
set TOOLS=../../Tools |
||||
|
|
||||
|
setlocal & cd .\Forth && call Build || exit /b 1 & endlocal |
||||
|
|
||||
setlocal |
setlocal |
||||
|
|
||||
PowerShell .\Build.ps1 %* |
PowerShell .\Build.ps1 %* |
||||
|
|||||
@ -0,0 +1,19 @@ |
|||||
|
@echo off |
||||
|
setlocal |
||||
|
|
||||
|
set TOOLS=../../../Tools |
||||
|
|
||||
|
set PATH=%TOOLS%\tasm32;%TOOLS%\zx;%PATH% |
||||
|
|
||||
|
set TASMTABS=%TOOLS%\tasm32 |
||||
|
|
||||
|
set ZXBINDIR=%TOOLS%/cpm/bin/ |
||||
|
set ZXLIBDIR=%TOOLS%/cpm/lib/ |
||||
|
set ZXINCDIR=%TOOLS%/cpm/include/ |
||||
|
|
||||
|
zx z80mr camel80 |
||||
|
zx MLOAD25 -camel80.bin=camel80.hex |
||||
|
|
||||
|
copy camel80.bin ..\ |
||||
|
|
||||
|
goto :eof |
||||
@ -0,0 +1,7 @@ |
|||||
|
@echo off |
||||
|
setlocal |
||||
|
|
||||
|
if exist *.bin del *.bin |
||||
|
if exist *.lst del *.lst |
||||
|
if exist *.prn del *.prn |
||||
|
if exist *.hex del *.hex |
||||
File diff suppressed because it is too large
@ -0,0 +1,154 @@ |
|||||
|
; LISTING 3. |
||||
|
; |
||||
|
; =============================================== |
||||
|
; CamelForth for the Zilog Z80 |
||||
|
; Copyright (c) 1994,1995 Bradford J. Rodriguez |
||||
|
; |
||||
|
; This program is free software; you can redistribute it and/or modify |
||||
|
; it under the terms of the GNU General Public License as published by |
||||
|
; the Free Software Foundation; either version 3 of the License, or |
||||
|
; (at your option) any later version. |
||||
|
; |
||||
|
; This program is distributed in the hope that it will be useful, |
||||
|
; but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
|
; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
|
; GNU General Public License for more details. |
||||
|
; |
||||
|
; You should have received a copy of the GNU General Public License |
||||
|
; along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
|
|
||||
|
; Commercial inquiries should be directed to the author at |
||||
|
; 115 First St., #105, Collingwood, Ontario L9Y 4W3 Canada |
||||
|
; or via email to bj@camelforth.com |
||||
|
; |
||||
|
; =============================================== |
||||
|
; CAMEL80D.AZM: CPU and Model Dependencies |
||||
|
; Source code is for the Z80MR macro assembler. |
||||
|
; Forth words are documented as follows: |
||||
|
;* NAME stack -- stack description |
||||
|
; Word names in upper case are from the ANS |
||||
|
; Forth Core word set. Names in lower case are |
||||
|
; "internal" implementation words & extensions. |
||||
|
; |
||||
|
; Direct-Threaded Forth model for Zilog Z80 |
||||
|
; cell size is 16 bits (2 bytes) |
||||
|
; char size is 8 bits (1 byte) |
||||
|
; address unit is 8 bits (1 byte), i.e., |
||||
|
; addresses are byte-aligned. |
||||
|
; =============================================== |
||||
|
|
||||
|
; ALIGNMENT AND PORTABILITY OPERATORS =========== |
||||
|
; Many of these are synonyms for other words, |
||||
|
; and so are defined as CODE words. |
||||
|
|
||||
|
;C ALIGN -- align HERE |
||||
|
head ALIGN,5,ALIGN,docode |
||||
|
noop: next |
||||
|
|
||||
|
;C ALIGNED addr -- a-addr align given addr |
||||
|
head ALIGNED,7,ALIGNED,docode |
||||
|
jr noop |
||||
|
|
||||
|
;Z CELL -- n size of one cell |
||||
|
head CELL,4,CELL,docon |
||||
|
dw 2 |
||||
|
|
||||
|
;C CELL+ a-addr1 -- a-addr2 add cell size |
||||
|
; 2 + ; |
||||
|
head CELLPLUS,5,CELL+,docode |
||||
|
inc bc |
||||
|
inc bc |
||||
|
next |
||||
|
|
||||
|
;C CELLS n1 -- n2 cells->adrs units |
||||
|
head CELLS,5,CELLS,docode |
||||
|
jp twostar |
||||
|
|
||||
|
;C CHAR+ c-addr1 -- c-addr2 add char size |
||||
|
head CHARPLUS,5,CHAR+,docode |
||||
|
jp oneplus |
||||
|
|
||||
|
;C CHARS n1 -- n2 chars->adrs units |
||||
|
head CHARS,5,CHARS,docode |
||||
|
jr noop |
||||
|
|
||||
|
;C >BODY xt -- a-addr adrs of param field |
||||
|
; 3 + ; Z80 (3 byte CALL) |
||||
|
head TOBODY,5,>BODY,docolon |
||||
|
DW LIT,3,PLUS,EXIT |
||||
|
|
||||
|
;X COMPILE, xt -- append execution token |
||||
|
; I called this word ,XT before I discovered that |
||||
|
; it is defined in the ANSI standard as COMPILE,. |
||||
|
; On a DTC Forth this simply appends xt (like , ) |
||||
|
; but on an STC Forth this must append 'CALL xt'. |
||||
|
head COMMAXT,8,'COMPILE,',docode |
||||
|
jp COMMA |
||||
|
|
||||
|
;Z !CF adrs cfa -- set code action of a word |
||||
|
; 0CD OVER C! store 'CALL adrs' instr |
||||
|
; 1+ ! ; Z80 VERSION |
||||
|
; Depending on the implementation this could |
||||
|
; append CALL adrs or JUMP adrs. |
||||
|
head STORECF,3,!CF,docolon |
||||
|
DW LIT,0CDH,OVER,CSTORE |
||||
|
DW ONEPLUS,STORE,EXIT |
||||
|
|
||||
|
;Z ,CF adrs -- append a code field |
||||
|
; HERE !CF 3 ALLOT ; Z80 VERSION (3 bytes) |
||||
|
head COMMACF,3,',CF',docolon |
||||
|
DW HERE,STORECF,LIT,3,ALLOT,EXIT |
||||
|
|
||||
|
;Z !COLON -- change code field to docolon |
||||
|
; -3 ALLOT docolon-adrs ,CF ; |
||||
|
; This should be used immediately after CREATE. |
||||
|
; This is made a distinct word, because on an STC |
||||
|
; Forth, colon definitions have no code field. |
||||
|
head STORCOLON,6,'!COLON',docolon |
||||
|
DW LIT,-3,ALLOT |
||||
|
DW LIT,docolon,COMMACF,EXIT |
||||
|
|
||||
|
;Z ,EXIT -- append hi-level EXIT action |
||||
|
; ['] EXIT ,XT ; |
||||
|
; This is made a distinct word, because on an STC |
||||
|
; Forth, it appends a RET instruction, not an xt. |
||||
|
head CEXIT,5,',EXIT',docolon |
||||
|
DW LIT,EXIT,COMMAXT,EXIT |
||||
|
|
||||
|
; CONTROL STRUCTURES ============================ |
||||
|
; These words allow Forth control structure words |
||||
|
; to be defined portably. |
||||
|
|
||||
|
;Z ,BRANCH xt -- append a branch instruction |
||||
|
; xt is the branch operator to use, e.g. qbranch |
||||
|
; or (loop). It does NOT append the destination |
||||
|
; address. On the Z80 this is equivalent to ,XT. |
||||
|
head COMMABRANCH,7,',BRANCH',docode |
||||
|
jp COMMA |
||||
|
|
||||
|
;Z ,DEST dest -- append a branch address |
||||
|
; This appends the given destination address to |
||||
|
; the branch instruction. On the Z80 this is ',' |
||||
|
; ...other CPUs may use relative addressing. |
||||
|
head COMMADEST,5,',DEST',docode |
||||
|
jp COMMA |
||||
|
|
||||
|
;Z !DEST dest adrs -- change a branch dest'n |
||||
|
; Changes the destination address found at 'adrs' |
||||
|
; to the given 'dest'. On the Z80 this is '!' |
||||
|
; ...other CPUs may need relative addressing. |
||||
|
head STOREDEST,5,'!DEST',docode |
||||
|
jp STORE |
||||
|
|
||||
|
; HEADER STRUCTURE ============================== |
||||
|
; The structure of the Forth dictionary headers |
||||
|
; (name, link, immediate flag, and "smudge" bit) |
||||
|
; does not necessarily differ across CPUs. This |
||||
|
; structure is not easily factored into distinct |
||||
|
; "portable" words; instead, it is implicit in |
||||
|
; the definitions of FIND and CREATE, and also in |
||||
|
; NFA>LFA, NFA>CFA, IMMED?, IMMEDIATE, HIDE, and |
||||
|
; REVEAL. These words must be (substantially) |
||||
|
; rewritten if either the header structure or its |
||||
|
; inherent assumptions are changed. |
||||
|
|
||||
File diff suppressed because it is too large
@ -0,0 +1,93 @@ |
|||||
|
; Listing 1. |
||||
|
; =============================================== |
||||
|
; CamelForth for the Zilog Z80 |
||||
|
; Primitive testing code |
||||
|
; |
||||
|
; This is the "minimal" test of the CamelForth |
||||
|
; kernel. It verifies the threading and nesting |
||||
|
; mechanisms, the stacks, and the primitives |
||||
|
; DUP EMIT EXIT lit branch ONEPLUS. |
||||
|
; It is particularly useful because it does not |
||||
|
; use the DO..LOOP, multiply, or divide words, |
||||
|
; and because it can be used on embedded CPUs. |
||||
|
; The numeric display word .A is also useful |
||||
|
; for testing the rest of the Core wordset. |
||||
|
; |
||||
|
; The required macros and CPU initialization |
||||
|
; are in file CAMEL80.AZM. |
||||
|
; =============================================== |
||||
|
|
||||
|
;Z >< u1 -- u2 swap the bytes of TOS |
||||
|
head SWAB,2,><,docode |
||||
|
ld a,b |
||||
|
ld b,c |
||||
|
ld c,a |
||||
|
next |
||||
|
|
||||
|
;Z LO c1 -- c2 return low nybble of TOS |
||||
|
head LO,2,LO,docode |
||||
|
ld a,c |
||||
|
and 0fh |
||||
|
ld c,a |
||||
|
ld b,0 |
||||
|
next |
||||
|
|
||||
|
;Z HI c1 -- c2 return high nybble of TOS |
||||
|
head HI,2,HI,docode |
||||
|
ld a,c |
||||
|
and 0f0h |
||||
|
rrca |
||||
|
rrca |
||||
|
rrca |
||||
|
rrca |
||||
|
ld c,a |
||||
|
ld b,0 |
||||
|
next |
||||
|
|
||||
|
;Z >HEX c1 -- c2 convert nybble to hex char |
||||
|
head TOHEX,4,>HEX,docode |
||||
|
ld a,c |
||||
|
sub 0ah |
||||
|
jr c,numeric |
||||
|
add a,7 |
||||
|
numeric: add a,3ah |
||||
|
ld c,a |
||||
|
next |
||||
|
|
||||
|
;Z .HH c -- print byte as 2 hex digits |
||||
|
; DUP HI >HEX EMIT LO >HEX EMIT ; |
||||
|
head DOTHH,3,.HH,docolon |
||||
|
DW DUP,HI,TOHEX,EMIT,LO,TOHEX,EMIT,EXIT |
||||
|
|
||||
|
;Z .B a -- a+1 fetch & print byte, advancing |
||||
|
; DUP C@ .HH 20 EMIT 1+ ; |
||||
|
head DOTB,2,.B,docolon |
||||
|
DW DUP,CFETCH,DOTHH,lit,20h,EMIT,ONEPLUS,EXIT |
||||
|
|
||||
|
;Z .A u -- print unsigned as 4 hex digits |
||||
|
; DUP >< .HH .HH 20 EMIT ; |
||||
|
head DOTA,2,.A,docolon |
||||
|
DW DUP,SWAB,DOTHH,DOTHH,lit,20h,EMIT,EXIT |
||||
|
|
||||
|
;X DUMP addr u -- dump u locations at addr |
||||
|
; 0 DO |
||||
|
; I 15 AND 0= IF CR DUP .A THEN |
||||
|
; .B |
||||
|
; LOOP DROP ; |
||||
|
head DUMP,4,DUMP,docolon |
||||
|
DW LIT,0,XDO |
||||
|
DUMP2: DW II,LIT,15,AND,ZEROEQUAL,qbranch,DUMP1 |
||||
|
DW CR,DUP,DOTA |
||||
|
DUMP1: DW DOTB,XLOOP,DUMP2,DROP,EXIT |
||||
|
|
||||
|
;Z ZQUIT -- endless dump for testing |
||||
|
; 0 BEGIN 0D EMIT 0A EMIT DUP .A |
||||
|
; .B .B .B .B .B .B .B .B |
||||
|
; .B .B .B .B .B .B .B .B |
||||
|
; AGAIN ; |
||||
|
head ZQUIT,5,ZQUIT,docolon |
||||
|
DW lit,0 |
||||
|
zquit1: DW lit,0dh,EMIT,lit,0ah,EMIT,DUP,DOTA |
||||
|
DW DOTB,DOTB,DOTB,DOTB,DOTB,DOTB,DOTB,DOTB |
||||
|
DW DOTB,DOTB,DOTB,DOTB,DOTB,DOTB,DOTB,DOTB |
||||
|
DW branch,zquit1 |
||||
@ -0,0 +1,7 @@ |
|||||
|
;Z DUMP adr n -- +++TEMP+++ |
||||
|
; 1 UMAX 0 DO .B LOOP DROP ; |
||||
|
head DUMP,4,DUMP,docolon |
||||
|
DW LIT,1,UMAX,LIT,0,XDO |
||||
|
DUMP1: DW DOTB,XLOOP,DUMP1 |
||||
|
DW DROP,EXIT |
||||
|
|
||||
@ -0,0 +1,674 @@ |
|||||
|
GNU GENERAL PUBLIC LICENSE |
||||
|
Version 3, 29 June 2007 |
||||
|
|
||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/> |
||||
|
Everyone is permitted to copy and distribute verbatim copies |
||||
|
of this license document, but changing it is not allowed. |
||||
|
|
||||
|
Preamble |
||||
|
|
||||
|
The GNU General Public License is a free, copyleft license for |
||||
|
software and other kinds of works. |
||||
|
|
||||
|
The licenses for most software and other practical works are designed |
||||
|
to take away your freedom to share and change the works. By contrast, |
||||
|
the GNU General Public License is intended to guarantee your freedom to |
||||
|
share and change all versions of a program--to make sure it remains free |
||||
|
software for all its users. We, the Free Software Foundation, use the |
||||
|
GNU General Public License for most of our software; it applies also to |
||||
|
any other work released this way by its authors. You can apply it to |
||||
|
your programs, too. |
||||
|
|
||||
|
When we speak of free software, we are referring to freedom, 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 |
||||
|
them if you wish), that you receive source code or can get it if you |
||||
|
want it, that you can change the software or use pieces of it in new |
||||
|
free programs, and that you know you can do these things. |
||||
|
|
||||
|
To protect your rights, we need to prevent others from denying you |
||||
|
these rights or asking you to surrender the rights. Therefore, you have |
||||
|
certain responsibilities if you distribute copies of the software, or if |
||||
|
you modify it: responsibilities to respect the freedom of others. |
||||
|
|
||||
|
For example, if you distribute copies of such a program, whether |
||||
|
gratis or for a fee, you must pass on to the recipients the same |
||||
|
freedoms that you received. You must make sure that they, too, receive |
||||
|
or can get the source code. And you must show them these terms so they |
||||
|
know their rights. |
||||
|
|
||||
|
Developers that use the GNU GPL protect your rights with two steps: |
||||
|
(1) assert copyright on the software, and (2) offer you this License |
||||
|
giving you legal permission to copy, distribute and/or modify it. |
||||
|
|
||||
|
For the developers' and authors' protection, the GPL clearly explains |
||||
|
that there is no warranty for this free software. For both users' and |
||||
|
authors' sake, the GPL requires that modified versions be marked as |
||||
|
changed, so that their problems will not be attributed erroneously to |
||||
|
authors of previous versions. |
||||
|
|
||||
|
Some devices are designed to deny users access to install or run |
||||
|
modified versions of the software inside them, although the manufacturer |
||||
|
can do so. This is fundamentally incompatible with the aim of |
||||
|
protecting users' freedom to change the software. The systematic |
||||
|
pattern of such abuse occurs in the area of products for individuals to |
||||
|
use, which is precisely where it is most unacceptable. Therefore, we |
||||
|
have designed this version of the GPL to prohibit the practice for those |
||||
|
products. If such problems arise substantially in other domains, we |
||||
|
stand ready to extend this provision to those domains in future versions |
||||
|
of the GPL, as needed to protect the freedom of users. |
||||
|
|
||||
|
Finally, every program is threatened constantly by software patents. |
||||
|
States should not allow patents to restrict development and use of |
||||
|
software on general-purpose computers, but in those that do, we wish to |
||||
|
avoid the special danger that patents applied to a free program could |
||||
|
make it effectively proprietary. To prevent this, the GPL assures that |
||||
|
patents cannot be used to render the program non-free. |
||||
|
|
||||
|
The precise terms and conditions for copying, distribution and |
||||
|
modification follow. |
||||
|
|
||||
|
TERMS AND CONDITIONS |
||||
|
|
||||
|
0. Definitions. |
||||
|
|
||||
|
"This License" refers to version 3 of the GNU General Public License. |
||||
|
|
||||
|
"Copyright" also means copyright-like laws that apply to other kinds of |
||||
|
works, such as semiconductor masks. |
||||
|
|
||||
|
"The Program" refers to any copyrightable work licensed under this |
||||
|
License. Each licensee is addressed as "you". "Licensees" and |
||||
|
"recipients" may be individuals or organizations. |
||||
|
|
||||
|
To "modify" a work means to copy from or adapt all or part of the work |
||||
|
in a fashion requiring copyright permission, other than the making of an |
||||
|
exact copy. The resulting work is called a "modified version" of the |
||||
|
earlier work or a work "based on" the earlier work. |
||||
|
|
||||
|
A "covered work" means either the unmodified Program or a work based |
||||
|
on the Program. |
||||
|
|
||||
|
To "propagate" a work means to do anything with it that, without |
||||
|
permission, would make you directly or secondarily liable for |
||||
|
infringement under applicable copyright law, except executing it on a |
||||
|
computer or modifying a private copy. Propagation includes copying, |
||||
|
distribution (with or without modification), making available to the |
||||
|
public, and in some countries other activities as well. |
||||
|
|
||||
|
To "convey" a work means any kind of propagation that enables other |
||||
|
parties to make or receive copies. Mere interaction with a user through |
||||
|
a computer network, with no transfer of a copy, is not conveying. |
||||
|
|
||||
|
An interactive user interface displays "Appropriate Legal Notices" |
||||
|
to the extent that it includes a convenient and prominently visible |
||||
|
feature that (1) displays an appropriate copyright notice, and (2) |
||||
|
tells the user that there is no warranty for the work (except to the |
||||
|
extent that warranties are provided), that licensees may convey the |
||||
|
work under this License, and how to view a copy of this License. If |
||||
|
the interface presents a list of user commands or options, such as a |
||||
|
menu, a prominent item in the list meets this criterion. |
||||
|
|
||||
|
1. Source Code. |
||||
|
|
||||
|
The "source code" for a work means the preferred form of the work |
||||
|
for making modifications to it. "Object code" means any non-source |
||||
|
form of a work. |
||||
|
|
||||
|
A "Standard Interface" means an interface that either is an official |
||||
|
standard defined by a recognized standards body, or, in the case of |
||||
|
interfaces specified for a particular programming language, one that |
||||
|
is widely used among developers working in that language. |
||||
|
|
||||
|
The "System Libraries" of an executable work include anything, other |
||||
|
than the work as a whole, that (a) is included in the normal form of |
||||
|
packaging a Major Component, but which is not part of that Major |
||||
|
Component, and (b) serves only to enable use of the work with that |
||||
|
Major Component, or to implement a Standard Interface for which an |
||||
|
implementation is available to the public in source code form. A |
||||
|
"Major Component", in this context, means a major essential component |
||||
|
(kernel, window system, and so on) of the specific operating system |
||||
|
(if any) on which the executable work runs, or a compiler used to |
||||
|
produce the work, or an object code interpreter used to run it. |
||||
|
|
||||
|
The "Corresponding Source" for a work in object code form means all |
||||
|
the source code needed to generate, install, and (for an executable |
||||
|
work) run the object code and to modify the work, including scripts to |
||||
|
control those activities. However, it does not include the work's |
||||
|
System Libraries, or general-purpose tools or generally available free |
||||
|
programs which are used unmodified in performing those activities but |
||||
|
which are not part of the work. For example, Corresponding Source |
||||
|
includes interface definition files associated with source files for |
||||
|
the work, and the source code for shared libraries and dynamically |
||||
|
linked subprograms that the work is specifically designed to require, |
||||
|
such as by intimate data communication or control flow between those |
||||
|
subprograms and other parts of the work. |
||||
|
|
||||
|
The Corresponding Source need not include anything that users |
||||
|
can regenerate automatically from other parts of the Corresponding |
||||
|
Source. |
||||
|
|
||||
|
The Corresponding Source for a work in source code form is that |
||||
|
same work. |
||||
|
|
||||
|
2. Basic Permissions. |
||||
|
|
||||
|
All rights granted under this License are granted for the term of |
||||
|
copyright on the Program, and are irrevocable provided the stated |
||||
|
conditions are met. This License explicitly affirms your unlimited |
||||
|
permission to run the unmodified Program. The output from running a |
||||
|
covered work is covered by this License only if the output, given its |
||||
|
content, constitutes a covered work. This License acknowledges your |
||||
|
rights of fair use or other equivalent, as provided by copyright law. |
||||
|
|
||||
|
You may make, run and propagate covered works that you do not |
||||
|
convey, without conditions so long as your license otherwise remains |
||||
|
in force. You may convey covered works to others for the sole purpose |
||||
|
of having them make modifications exclusively for you, or provide you |
||||
|
with facilities for running those works, provided that you comply with |
||||
|
the terms of this License in conveying all material for which you do |
||||
|
not control copyright. Those thus making or running the covered works |
||||
|
for you must do so exclusively on your behalf, under your direction |
||||
|
and control, on terms that prohibit them from making any copies of |
||||
|
your copyrighted material outside their relationship with you. |
||||
|
|
||||
|
Conveying under any other circumstances is permitted solely under |
||||
|
the conditions stated below. Sublicensing is not allowed; section 10 |
||||
|
makes it unnecessary. |
||||
|
|
||||
|
3. Protecting Users' Legal Rights From Anti-Circumvention Law. |
||||
|
|
||||
|
No covered work shall be deemed part of an effective technological |
||||
|
measure under any applicable law fulfilling obligations under article |
||||
|
11 of the WIPO copyright treaty adopted on 20 December 1996, or |
||||
|
similar laws prohibiting or restricting circumvention of such |
||||
|
measures. |
||||
|
|
||||
|
When you convey a covered work, you waive any legal power to forbid |
||||
|
circumvention of technological measures to the extent such circumvention |
||||
|
is effected by exercising rights under this License with respect to |
||||
|
the covered work, and you disclaim any intention to limit operation or |
||||
|
modification of the work as a means of enforcing, against the work's |
||||
|
users, your or third parties' legal rights to forbid circumvention of |
||||
|
technological measures. |
||||
|
|
||||
|
4. Conveying Verbatim Copies. |
||||
|
|
||||
|
You may convey verbatim copies of the Program's source code as you |
||||
|
receive it, in any medium, provided that you conspicuously and |
||||
|
appropriately publish on each copy an appropriate copyright notice; |
||||
|
keep intact all notices stating that this License and any |
||||
|
non-permissive terms added in accord with section 7 apply to the code; |
||||
|
keep intact all notices of the absence of any warranty; and give all |
||||
|
recipients a copy of this License along with the Program. |
||||
|
|
||||
|
You may charge any price or no price for each copy that you convey, |
||||
|
and you may offer support or warranty protection for a fee. |
||||
|
|
||||
|
5. Conveying Modified Source Versions. |
||||
|
|
||||
|
You may convey a work based on the Program, or the modifications to |
||||
|
produce it from the Program, in the form of source code under the |
||||
|
terms of section 4, provided that you also meet all of these conditions: |
||||
|
|
||||
|
a) The work must carry prominent notices stating that you modified |
||||
|
it, and giving a relevant date. |
||||
|
|
||||
|
b) The work must carry prominent notices stating that it is |
||||
|
released under this License and any conditions added under section |
||||
|
7. This requirement modifies the requirement in section 4 to |
||||
|
"keep intact all notices". |
||||
|
|
||||
|
c) You must license the entire work, as a whole, under this |
||||
|
License to anyone who comes into possession of a copy. This |
||||
|
License will therefore apply, along with any applicable section 7 |
||||
|
additional terms, to the whole of the work, and all its parts, |
||||
|
regardless of how they are packaged. This License gives no |
||||
|
permission to license the work in any other way, but it does not |
||||
|
invalidate such permission if you have separately received it. |
||||
|
|
||||
|
d) If the work has interactive user interfaces, each must display |
||||
|
Appropriate Legal Notices; however, if the Program has interactive |
||||
|
interfaces that do not display Appropriate Legal Notices, your |
||||
|
work need not make them do so. |
||||
|
|
||||
|
A compilation of a covered work with other separate and independent |
||||
|
works, which are not by their nature extensions of the covered work, |
||||
|
and which are not combined with it such as to form a larger program, |
||||
|
in or on a volume of a storage or distribution medium, is called an |
||||
|
"aggregate" if the compilation and its resulting copyright are not |
||||
|
used to limit the access or legal rights of the compilation's users |
||||
|
beyond what the individual works permit. Inclusion of a covered work |
||||
|
in an aggregate does not cause this License to apply to the other |
||||
|
parts of the aggregate. |
||||
|
|
||||
|
6. Conveying Non-Source Forms. |
||||
|
|
||||
|
You may convey a covered work in object code form under the terms |
||||
|
of sections 4 and 5, provided that you also convey the |
||||
|
machine-readable Corresponding Source under the terms of this License, |
||||
|
in one of these ways: |
||||
|
|
||||
|
a) Convey the object code in, or embodied in, a physical product |
||||
|
(including a physical distribution medium), accompanied by the |
||||
|
Corresponding Source fixed on a durable physical medium |
||||
|
customarily used for software interchange. |
||||
|
|
||||
|
b) Convey the object code in, or embodied in, a physical product |
||||
|
(including a physical distribution medium), accompanied by a |
||||
|
written offer, valid for at least three years and valid for as |
||||
|
long as you offer spare parts or customer support for that product |
||||
|
model, to give anyone who possesses the object code either (1) a |
||||
|
copy of the Corresponding Source for all the software in the |
||||
|
product that is covered by this License, on a durable physical |
||||
|
medium customarily used for software interchange, for a price no |
||||
|
more than your reasonable cost of physically performing this |
||||
|
conveying of source, or (2) access to copy the |
||||
|
Corresponding Source from a network server at no charge. |
||||
|
|
||||
|
c) Convey individual copies of the object code with a copy of the |
||||
|
written offer to provide the Corresponding Source. This |
||||
|
alternative is allowed only occasionally and noncommercially, and |
||||
|
only if you received the object code with such an offer, in accord |
||||
|
with subsection 6b. |
||||
|
|
||||
|
d) Convey the object code by offering access from a designated |
||||
|
place (gratis or for a charge), and offer equivalent access to the |
||||
|
Corresponding Source in the same way through the same place at no |
||||
|
further charge. You need not require recipients to copy the |
||||
|
Corresponding Source along with the object code. If the place to |
||||
|
copy the object code is a network server, the Corresponding Source |
||||
|
may be on a different server (operated by you or a third party) |
||||
|
that supports equivalent copying facilities, provided you maintain |
||||
|
clear directions next to the object code saying where to find the |
||||
|
Corresponding Source. Regardless of what server hosts the |
||||
|
Corresponding Source, you remain obligated to ensure that it is |
||||
|
available for as long as needed to satisfy these requirements. |
||||
|
|
||||
|
e) Convey the object code using peer-to-peer transmission, provided |
||||
|
you inform other peers where the object code and Corresponding |
||||
|
Source of the work are being offered to the general public at no |
||||
|
charge under subsection 6d. |
||||
|
|
||||
|
A separable portion of the object code, whose source code is excluded |
||||
|
from the Corresponding Source as a System Library, need not be |
||||
|
included in conveying the object code work. |
||||
|
|
||||
|
A "User Product" is either (1) a "consumer product", which means any |
||||
|
tangible personal property which is normally used for personal, family, |
||||
|
or household purposes, or (2) anything designed or sold for incorporation |
||||
|
into a dwelling. In determining whether a product is a consumer product, |
||||
|
doubtful cases shall be resolved in favor of coverage. For a particular |
||||
|
product received by a particular user, "normally used" refers to a |
||||
|
typical or common use of that class of product, regardless of the status |
||||
|
of the particular user or of the way in which the particular user |
||||
|
actually uses, or expects or is expected to use, the product. A product |
||||
|
is a consumer product regardless of whether the product has substantial |
||||
|
commercial, industrial or non-consumer uses, unless such uses represent |
||||
|
the only significant mode of use of the product. |
||||
|
|
||||
|
"Installation Information" for a User Product means any methods, |
||||
|
procedures, authorization keys, or other information required to install |
||||
|
and execute modified versions of a covered work in that User Product from |
||||
|
a modified version of its Corresponding Source. The information must |
||||
|
suffice to ensure that the continued functioning of the modified object |
||||
|
code is in no case prevented or interfered with solely because |
||||
|
modification has been made. |
||||
|
|
||||
|
If you convey an object code work under this section in, or with, or |
||||
|
specifically for use in, a User Product, and the conveying occurs as |
||||
|
part of a transaction in which the right of possession and use of the |
||||
|
User Product is transferred to the recipient in perpetuity or for a |
||||
|
fixed term (regardless of how the transaction is characterized), the |
||||
|
Corresponding Source conveyed under this section must be accompanied |
||||
|
by the Installation Information. But this requirement does not apply |
||||
|
if neither you nor any third party retains the ability to install |
||||
|
modified object code on the User Product (for example, the work has |
||||
|
been installed in ROM). |
||||
|
|
||||
|
The requirement to provide Installation Information does not include a |
||||
|
requirement to continue to provide support service, warranty, or updates |
||||
|
for a work that has been modified or installed by the recipient, or for |
||||
|
the User Product in which it has been modified or installed. Access to a |
||||
|
network may be denied when the modification itself materially and |
||||
|
adversely affects the operation of the network or violates the rules and |
||||
|
protocols for communication across the network. |
||||
|
|
||||
|
Corresponding Source conveyed, and Installation Information provided, |
||||
|
in accord with this section must be in a format that is publicly |
||||
|
documented (and with an implementation available to the public in |
||||
|
source code form), and must require no special password or key for |
||||
|
unpacking, reading or copying. |
||||
|
|
||||
|
7. Additional Terms. |
||||
|
|
||||
|
"Additional permissions" are terms that supplement the terms of this |
||||
|
License by making exceptions from one or more of its conditions. |
||||
|
Additional permissions that are applicable to the entire Program shall |
||||
|
be treated as though they were included in this License, to the extent |
||||
|
that they are valid under applicable law. If additional permissions |
||||
|
apply only to part of the Program, that part may be used separately |
||||
|
under those permissions, but the entire Program remains governed by |
||||
|
this License without regard to the additional permissions. |
||||
|
|
||||
|
When you convey a copy of a covered work, you may at your option |
||||
|
remove any additional permissions from that copy, or from any part of |
||||
|
it. (Additional permissions may be written to require their own |
||||
|
removal in certain cases when you modify the work.) You may place |
||||
|
additional permissions on material, added by you to a covered work, |
||||
|
for which you have or can give appropriate copyright permission. |
||||
|
|
||||
|
Notwithstanding any other provision of this License, for material you |
||||
|
add to a covered work, you may (if authorized by the copyright holders of |
||||
|
that material) supplement the terms of this License with terms: |
||||
|
|
||||
|
a) Disclaiming warranty or limiting liability differently from the |
||||
|
terms of sections 15 and 16 of this License; or |
||||
|
|
||||
|
b) Requiring preservation of specified reasonable legal notices or |
||||
|
author attributions in that material or in the Appropriate Legal |
||||
|
Notices displayed by works containing it; or |
||||
|
|
||||
|
c) Prohibiting misrepresentation of the origin of that material, or |
||||
|
requiring that modified versions of such material be marked in |
||||
|
reasonable ways as different from the original version; or |
||||
|
|
||||
|
d) Limiting the use for publicity purposes of names of licensors or |
||||
|
authors of the material; or |
||||
|
|
||||
|
e) Declining to grant rights under trademark law for use of some |
||||
|
trade names, trademarks, or service marks; or |
||||
|
|
||||
|
f) Requiring indemnification of licensors and authors of that |
||||
|
material by anyone who conveys the material (or modified versions of |
||||
|
it) with contractual assumptions of liability to the recipient, for |
||||
|
any liability that these contractual assumptions directly impose on |
||||
|
those licensors and authors. |
||||
|
|
||||
|
All other non-permissive additional terms are considered "further |
||||
|
restrictions" within the meaning of section 10. If the Program as you |
||||
|
received it, or any part of it, contains a notice stating that it is |
||||
|
governed by this License along with a term that is a further |
||||
|
restriction, you may remove that term. If a license document contains |
||||
|
a further restriction but permits relicensing or conveying under this |
||||
|
License, you may add to a covered work material governed by the terms |
||||
|
of that license document, provided that the further restriction does |
||||
|
not survive such relicensing or conveying. |
||||
|
|
||||
|
If you add terms to a covered work in accord with this section, you |
||||
|
must place, in the relevant source files, a statement of the |
||||
|
additional terms that apply to those files, or a notice indicating |
||||
|
where to find the applicable terms. |
||||
|
|
||||
|
Additional terms, permissive or non-permissive, may be stated in the |
||||
|
form of a separately written license, or stated as exceptions; |
||||
|
the above requirements apply either way. |
||||
|
|
||||
|
8. Termination. |
||||
|
|
||||
|
You may not propagate or modify a covered work except as expressly |
||||
|
provided under this License. Any attempt otherwise to propagate or |
||||
|
modify it is void, and will automatically terminate your rights under |
||||
|
this License (including any patent licenses granted under the third |
||||
|
paragraph of section 11). |
||||
|
|
||||
|
However, if you cease all violation of this License, then your |
||||
|
license from a particular copyright holder is reinstated (a) |
||||
|
provisionally, unless and until the copyright holder explicitly and |
||||
|
finally terminates your license, and (b) permanently, if the copyright |
||||
|
holder fails to notify you of the violation by some reasonable means |
||||
|
prior to 60 days after the cessation. |
||||
|
|
||||
|
Moreover, your license from a particular copyright holder is |
||||
|
reinstated permanently if the copyright holder notifies you of the |
||||
|
violation by some reasonable means, this is the first time you have |
||||
|
received notice of violation of this License (for any work) from that |
||||
|
copyright holder, and you cure the violation prior to 30 days after |
||||
|
your receipt of the notice. |
||||
|
|
||||
|
Termination of your rights under this section does not terminate the |
||||
|
licenses of parties who have received copies or rights from you under |
||||
|
this License. If your rights have been terminated and not permanently |
||||
|
reinstated, you do not qualify to receive new licenses for the same |
||||
|
material under section 10. |
||||
|
|
||||
|
9. Acceptance Not Required for Having Copies. |
||||
|
|
||||
|
You are not required to accept this License in order to receive or |
||||
|
run a copy of the Program. Ancillary propagation of a covered work |
||||
|
occurring solely as a consequence of using peer-to-peer transmission |
||||
|
to receive a copy likewise does not require acceptance. However, |
||||
|
nothing other than this License grants you permission to propagate or |
||||
|
modify any covered work. These actions infringe copyright if you do |
||||
|
not accept this License. Therefore, by modifying or propagating a |
||||
|
covered work, you indicate your acceptance of this License to do so. |
||||
|
|
||||
|
10. Automatic Licensing of Downstream Recipients. |
||||
|
|
||||
|
Each time you convey a covered work, the recipient automatically |
||||
|
receives a license from the original licensors, to run, modify and |
||||
|
propagate that work, subject to this License. You are not responsible |
||||
|
for enforcing compliance by third parties with this License. |
||||
|
|
||||
|
An "entity transaction" is a transaction transferring control of an |
||||
|
organization, or substantially all assets of one, or subdividing an |
||||
|
organization, or merging organizations. If propagation of a covered |
||||
|
work results from an entity transaction, each party to that |
||||
|
transaction who receives a copy of the work also receives whatever |
||||
|
licenses to the work the party's predecessor in interest had or could |
||||
|
give under the previous paragraph, plus a right to possession of the |
||||
|
Corresponding Source of the work from the predecessor in interest, if |
||||
|
the predecessor has it or can get it with reasonable efforts. |
||||
|
|
||||
|
You may not impose any further restrictions on the exercise of the |
||||
|
rights granted or affirmed under this License. For example, you may |
||||
|
not impose a license fee, royalty, or other charge for exercise of |
||||
|
rights granted under this License, and you may not initiate litigation |
||||
|
(including a cross-claim or counterclaim in a lawsuit) alleging that |
||||
|
any patent claim is infringed by making, using, selling, offering for |
||||
|
sale, or importing the Program or any portion of it. |
||||
|
|
||||
|
11. Patents. |
||||
|
|
||||
|
A "contributor" is a copyright holder who authorizes use under this |
||||
|
License of the Program or a work on which the Program is based. The |
||||
|
work thus licensed is called the contributor's "contributor version". |
||||
|
|
||||
|
A contributor's "essential patent claims" are all patent claims |
||||
|
owned or controlled by the contributor, whether already acquired or |
||||
|
hereafter acquired, that would be infringed by some manner, permitted |
||||
|
by this License, of making, using, or selling its contributor version, |
||||
|
but do not include claims that would be infringed only as a |
||||
|
consequence of further modification of the contributor version. For |
||||
|
purposes of this definition, "control" includes the right to grant |
||||
|
patent sublicenses in a manner consistent with the requirements of |
||||
|
this License. |
||||
|
|
||||
|
Each contributor grants you a non-exclusive, worldwide, royalty-free |
||||
|
patent license under the contributor's essential patent claims, to |
||||
|
make, use, sell, offer for sale, import and otherwise run, modify and |
||||
|
propagate the contents of its contributor version. |
||||
|
|
||||
|
In the following three paragraphs, a "patent license" is any express |
||||
|
agreement or commitment, however denominated, not to enforce a patent |
||||
|
(such as an express permission to practice a patent or covenant not to |
||||
|
sue for patent infringement). To "grant" such a patent license to a |
||||
|
party means to make such an agreement or commitment not to enforce a |
||||
|
patent against the party. |
||||
|
|
||||
|
If you convey a covered work, knowingly relying on a patent license, |
||||
|
and the Corresponding Source of the work is not available for anyone |
||||
|
to copy, free of charge and under the terms of this License, through a |
||||
|
publicly available network server or other readily accessible means, |
||||
|
then you must either (1) cause the Corresponding Source to be so |
||||
|
available, or (2) arrange to deprive yourself of the benefit of the |
||||
|
patent license for this particular work, or (3) arrange, in a manner |
||||
|
consistent with the requirements of this License, to extend the patent |
||||
|
license to downstream recipients. "Knowingly relying" means you have |
||||
|
actual knowledge that, but for the patent license, your conveying the |
||||
|
covered work in a country, or your recipient's use of the covered work |
||||
|
in a country, would infringe one or more identifiable patents in that |
||||
|
country that you have reason to believe are valid. |
||||
|
|
||||
|
If, pursuant to or in connection with a single transaction or |
||||
|
arrangement, you convey, or propagate by procuring conveyance of, a |
||||
|
covered work, and grant a patent license to some of the parties |
||||
|
receiving the covered work authorizing them to use, propagate, modify |
||||
|
or convey a specific copy of the covered work, then the patent license |
||||
|
you grant is automatically extended to all recipients of the covered |
||||
|
work and works based on it. |
||||
|
|
||||
|
A patent license is "discriminatory" if it does not include within |
||||
|
the scope of its coverage, prohibits the exercise of, or is |
||||
|
conditioned on the non-exercise of one or more of the rights that are |
||||
|
specifically granted under this License. You may not convey a covered |
||||
|
work if you are a party to an arrangement with a third party that is |
||||
|
in the business of distributing software, under which you make payment |
||||
|
to the third party based on the extent of your activity of conveying |
||||
|
the work, and under which the third party grants, to any of the |
||||
|
parties who would receive the covered work from you, a discriminatory |
||||
|
patent license (a) in connection with copies of the covered work |
||||
|
conveyed by you (or copies made from those copies), or (b) primarily |
||||
|
for and in connection with specific products or compilations that |
||||
|
contain the covered work, unless you entered into that arrangement, |
||||
|
or that patent license was granted, prior to 28 March 2007. |
||||
|
|
||||
|
Nothing in this License shall be construed as excluding or limiting |
||||
|
any implied license or other defenses to infringement that may |
||||
|
otherwise be available to you under applicable patent law. |
||||
|
|
||||
|
12. No Surrender of Others' Freedom. |
||||
|
|
||||
|
If 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 convey a |
||||
|
covered work so as to satisfy simultaneously your obligations under this |
||||
|
License and any other pertinent obligations, then as a consequence you may |
||||
|
not convey it at all. For example, if you agree to terms that obligate you |
||||
|
to collect a royalty for further conveying from those to whom you convey |
||||
|
the Program, the only way you could satisfy both those terms and this |
||||
|
License would be to refrain entirely from conveying the Program. |
||||
|
|
||||
|
13. Use with the GNU Affero General Public License. |
||||
|
|
||||
|
Notwithstanding any other provision of this License, you have |
||||
|
permission to link or combine any covered work with a work licensed |
||||
|
under version 3 of the GNU Affero General Public License into a single |
||||
|
combined work, and to convey the resulting work. The terms of this |
||||
|
License will continue to apply to the part which is the covered work, |
||||
|
but the special requirements of the GNU Affero General Public License, |
||||
|
section 13, concerning interaction through a network will apply to the |
||||
|
combination as such. |
||||
|
|
||||
|
14. Revised Versions of this License. |
||||
|
|
||||
|
The Free Software Foundation may publish revised and/or new versions of |
||||
|
the GNU 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 |
||||
|
Program specifies that a certain numbered version of the GNU General |
||||
|
Public License "or any later version" applies to it, you have the |
||||
|
option of following the terms and conditions either of that numbered |
||||
|
version or of any later version published by the Free Software |
||||
|
Foundation. If the Program does not specify a version number of the |
||||
|
GNU General Public License, you may choose any version ever published |
||||
|
by the Free Software Foundation. |
||||
|
|
||||
|
If the Program specifies that a proxy can decide which future |
||||
|
versions of the GNU General Public License can be used, that proxy's |
||||
|
public statement of acceptance of a version permanently authorizes you |
||||
|
to choose that version for the Program. |
||||
|
|
||||
|
Later license versions may give you additional or different |
||||
|
permissions. However, no additional obligations are imposed on any |
||||
|
author or copyright holder as a result of your choosing to follow a |
||||
|
later version. |
||||
|
|
||||
|
15. Disclaimer of Warranty. |
||||
|
|
||||
|
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY |
||||
|
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT |
||||
|
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "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 PROGRAM |
||||
|
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF |
||||
|
ALL NECESSARY SERVICING, REPAIR OR CORRECTION. |
||||
|
|
||||
|
16. Limitation of Liability. |
||||
|
|
||||
|
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING |
||||
|
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS |
||||
|
THE PROGRAM 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 PROGRAM (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 PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), |
||||
|
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF |
||||
|
SUCH DAMAGES. |
||||
|
|
||||
|
17. Interpretation of Sections 15 and 16. |
||||
|
|
||||
|
If the disclaimer of warranty and limitation of liability provided |
||||
|
above cannot be given local legal effect according to their terms, |
||||
|
reviewing courts shall apply local law that most closely approximates |
||||
|
an absolute waiver of all civil liability in connection with the |
||||
|
Program, unless a warranty or assumption of liability accompanies a |
||||
|
copy of the Program in return for a fee. |
||||
|
|
||||
|
END OF TERMS AND CONDITIONS |
||||
|
|
||||
|
How to Apply These Terms to Your New Programs |
||||
|
|
||||
|
If you develop a new program, and you want it to be of the greatest |
||||
|
possible use to the public, the best way to achieve this is to make it |
||||
|
free software which everyone can redistribute and change under these terms. |
||||
|
|
||||
|
To do so, attach the following notices to the program. It is safest |
||||
|
to attach them to the start of each source file to most effectively |
||||
|
state 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 program's name and a brief idea of what it does.> |
||||
|
Copyright (C) <year> <name of author> |
||||
|
|
||||
|
This program is free software: you can redistribute it and/or modify |
||||
|
it under the terms of the GNU General Public License as published by |
||||
|
the Free Software Foundation, either version 3 of the License, or |
||||
|
(at your option) any later version. |
||||
|
|
||||
|
This program is distributed in the hope that it will be useful, |
||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
|
GNU General Public License for more details. |
||||
|
|
||||
|
You should have received a copy of the GNU General Public License |
||||
|
along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
|
|
||||
|
Also add information on how to contact you by electronic and paper mail. |
||||
|
|
||||
|
If the program does terminal interaction, make it output a short |
||||
|
notice like this when it starts in an interactive mode: |
||||
|
|
||||
|
<program> Copyright (C) <year> <name of author> |
||||
|
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. |
||||
|
This is free software, and you are welcome to redistribute it |
||||
|
under certain conditions; type `show c' for details. |
||||
|
|
||||
|
The hypothetical commands `show w' and `show c' should show the appropriate |
||||
|
parts of the General Public License. Of course, your program's commands |
||||
|
might be different; for a GUI interface, you would use an "about box". |
||||
|
|
||||
|
You should also get your employer (if you work as a programmer) or school, |
||||
|
if any, to sign a "copyright disclaimer" for the program, if necessary. |
||||
|
For more information on this, and how to apply and follow the GNU GPL, see |
||||
|
<http://www.gnu.org/licenses/>. |
||||
|
|
||||
|
The GNU General Public License does not permit incorporating your program |
||||
|
into proprietary programs. If your program is a subroutine library, you |
||||
|
may consider it more useful to permit linking proprietary applications with |
||||
|
the library. If this is what you want to do, use the GNU Lesser General |
||||
|
Public License instead of this License. But first, please read |
||||
|
<http://www.gnu.org/philosophy/why-not-lgpl.html>. |
||||
@ -0,0 +1,184 @@ |
|||||
|
TABLE 1. GLOSSARY OF "HIGH LEVEL" WORDS |
||||
|
(files CAMEL80D.AZM and CAMEL80H.AZM) |
||||
|
|
||||
|
NAME stack in -- stack out description |
||||
|
|
||||
|
Guide to stack diagrams: R: = return stack, |
||||
|
c = 8-bit character, flag = boolean (0 or -1), |
||||
|
n = signed 16-bit, u = unsigned 16-bit, |
||||
|
d = signed 32-bit, ud = unsigned 32-bit, |
||||
|
+n = unsigned 15-bit, x = any cell value, |
||||
|
i*x j*x = any number of cell values, |
||||
|
a-addr = aligned adrs, c-addr = character adrs |
||||
|
p-addr = I/O port adrs, sys = system-specific. |
||||
|
Refer to ANS Forth document for more details. |
||||
|
|
||||
|
ANS Forth Core words |
||||
|
These are required words whose definitions are |
||||
|
specified by the ANS Forth document. |
||||
|
|
||||
|
# ud1 -- ud2 convert 1 digit of output |
||||
|
#S ud1 -- ud2 convert remaining digits |
||||
|
#> ud1 -- c-addr u end conv., get string |
||||
|
' -- xt find word in dictionary |
||||
|
( -- skip input until ) |
||||
|
* n1 n2 -- n3 signed multiply |
||||
|
*/ n1 n2 n3 -- n4 n1*n2/n3 |
||||
|
*/MOD n1 n2 n3 -- n4 n5 n1*n2/n3, rem & quot |
||||
|
+LOOP adrs -- L: 0 a1 a2 .. aN -- |
||||
|
, x -- append cell to dict |
||||
|
/ n1 n2 -- n3 signed divide |
||||
|
/MOD n1 n2 -- n3 n4 signed divide, rem & quot |
||||
|
: -- begin a colon definition |
||||
|
; end a colon definition |
||||
|
<# -- begin numeric conversion |
||||
|
>BODY xt -- a-addr adrs of param field |
||||
|
>IN -- a-addr holds offset into TIB |
||||
|
>NUMBER ud adr u -- ud' adr' u' |
||||
|
convert string to number |
||||
|
2DROP x1 x2 -- drop 2 cells |
||||
|
2DUP x1 x2 -- x1 x2 x1 x2 dup top 2 cells |
||||
|
2OVER x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2 per diag |
||||
|
2SWAP x1 x2 x3 x4 -- x3 x4 x1 x2 per diagram |
||||
|
2! x1 x2 a-addr -- store 2 cells |
||||
|
2@ a-addr -- x1 x2 fetch 2 cells |
||||
|
ABORT i*x -- R: j*x -- clear stack & QUIT |
||||
|
ABORT" i*x 0 -- i*x R: j*x -- j*x print msg & |
||||
|
i*x x1 -- R: j*x -- abort,x1<>0 |
||||
|
ABS n1 -- +n2 absolute value |
||||
|
ACCEPT c-addr +n -- +n' get line from terminal |
||||
|
ALIGN -- align HERE |
||||
|
ALIGNED addr -- a-addr align given addr |
||||
|
ALLOT n -- allocate n bytes in dict |
||||
|
BASE -- a-addr holds conversion radix |
||||
|
BEGIN -- adrs target for backward branch |
||||
|
BL -- char an ASCII space |
||||
|
C, char -- append char to dict |
||||
|
CELLS n1 -- n2 cells->adrs units |
||||
|
CELL+ a-addr1 -- a-addr2 add cell size to adrs |
||||
|
CHAR -- char parse ASCII character |
||||
|
CHARS n1 -- n2 chars->adrs units |
||||
|
CHAR+ c-addr1 -- c-addr2 add char size to adrs |
||||
|
COUNT c-addr1 -- c-addr2 u counted->adr/len |
||||
|
CR -- output newline |
||||
|
CREATE -- create an empty definition |
||||
|
DECIMAL -- set number base to decimal |
||||
|
DEPTH -- +n number of items on stack |
||||
|
DO -- adrs L: -- 0 start of DO..LOOP |
||||
|
DOES> -- change action of latest def'n |
||||
|
ELSE adrs1 -- adrs2 branch for IF..ELSE |
||||
|
ENVIRONMENT? c-addr u -- false system query |
||||
|
EVALUATE i*x c-addr u -- j*x interpret string |
||||
|
FIND c-addr -- c-addr 0 ..if name not found |
||||
|
xt 1 ..if immediate |
||||
|
xt -1 ..if "normal" |
||||
|
FM/MOD d1 n1 -- n2 n3 floored signed division |
||||
|
HERE -- addr returns dictionary pointer |
||||
|
HOLD char -- add char to output string |
||||
|
IF -- adrs conditional forward branch |
||||
|
IMMEDIATE -- make last def'n immediate |
||||
|
LEAVE -- L: -- adrs exit DO..LOOP |
||||
|
LITERAL x -- append numeric literal to dict. |
||||
|
LOOP adrs -- L: 0 a1 a2 .. aN -- |
||||
|
MAX n1 n2 -- n3 signed maximum |
||||
|
MIN n1 n2 -- n3 signed minimum |
||||
|
MOD n1 n2 -- n3 signed remainder |
||||
|
MOVE addr1 addr2 u -- smart move |
||||
|
M* n1 n2 -- d signed 16*16->32 multiply |
||||
|
POSTPONE -- postpone compile action of word |
||||
|
QUIT -- R: i*x -- interpret from keyboard |
||||
|
RECURSE -- recurse current definition |
||||
|
REPEAT adrs1 adrs2 -- resolve WHILE loop |
||||
|
SIGN n -- add minus sign if n<0 |
||||
|
SM/REM d1 n1 -- n2 n3 symmetric signed division |
||||
|
SOURCE -- adr n current input buffer |
||||
|
SPACE -- output a space |
||||
|
SPACES n -- output n spaces |
||||
|
STATE -- a-addr holds compiler state |
||||
|
S" -- compile in-line string |
||||
|
." -- compile string to print |
||||
|
S>D n -- d single -> double precision |
||||
|
THEN adrs -- resolve forward branch |
||||
|
TYPE c-addr +n -- type line to terminal |
||||
|
UNTIL adrs -- conditional backward branch |
||||
|
U. u -- display u unsigned |
||||
|
. n -- display n signed |
||||
|
WHILE -- adrs branch for WHILE loop |
||||
|
WORD char -- c-addr n parse word delim by char |
||||
|
[ -- enter interpretive state |
||||
|
[CHAR] -- compile character literal |
||||
|
['] -- find word & compile as literal |
||||
|
] -- enter compiling state |
||||
|
|
||||
|
ANS Forth Extensions |
||||
|
These are optional words whose definitions are |
||||
|
specified by the ANS Forth document. |
||||
|
|
||||
|
.S -- print stack contents |
||||
|
/STRING a u n -- a+n u-n trim string |
||||
|
AGAIN adrs -- uncond'l backward branch |
||||
|
COMPILE, xt -- append execution token |
||||
|
DABS d1 -- +d2 absolute value, dbl.prec. |
||||
|
DNEGATE d1 -- d2 negate, double precision |
||||
|
HEX -- set number base to hex |
||||
|
PAD -- a-addr user PAD buffer |
||||
|
TIB -- a-addr Terminal Input Buffer |
||||
|
WITHIN n1|u1 n2|u2 n3|u3 -- f test n2<=n1<n3? |
||||
|
WORDS -- list all words in dict. |
||||
|
|
||||
|
Private Extensions |
||||
|
These are words which are unique to CamelForth. |
||||
|
Many of these are necessary to implement ANS |
||||
|
Forth words, but are not specified by the ANS |
||||
|
document. Others are functions I find useful. |
||||
|
|
||||
|
!CF adrs cfa -- set code action of a word |
||||
|
!COLON -- change code field to docolon |
||||
|
!DEST dest adrs -- change a branch dest'n |
||||
|
#INIT -- n #bytes of user area init data |
||||
|
'SOURCE -- a-addr two cells: len, adrs |
||||
|
(DOES>) -- run-time action of DOES> |
||||
|
(S") -- c-addr u run-time code for S" |
||||
|
,BRANCH xt -- append a branch instruction |
||||
|
,CF adrs -- append a code field |
||||
|
,DEST dest -- append a branch address |
||||
|
,EXIT -- append hi-level EXIT action |
||||
|
>COUNTED src n dst -- copy to counted str |
||||
|
>DIGIT n -- c convert to 0..9A..Z |
||||
|
>L x -- L: -- x move to Leave stack |
||||
|
?ABORT f c-addr u -- abort & print msg |
||||
|
?DNEGATE d1 n -- d2 negate d1 if n negative |
||||
|
?NEGATE n1 n2 -- n3 negate n1 if n2 negative |
||||
|
?NUMBER c-addr -- n -1 convert string->number |
||||
|
-- c-addr 0 if convert error |
||||
|
?SIGN adr n -- adr' n' f get optional sign |
||||
|
advance adr/n if sign; return NZ if negative |
||||
|
CELL -- n size of one cell |
||||
|
COLD -- cold start Forth system |
||||
|
COMPILE -- append inline execution token |
||||
|
DIGIT? c -- n -1 ..if c is a valid digit |
||||
|
-- x 0 ..otherwise |
||||
|
DP -- a-addr holds dictionary ptr |
||||
|
ENDLOOP adrs xt -- L: 0 a1 a2 .. aN -- |
||||
|
HIDE -- "hide" latest definition |
||||
|
HP -- a-addr HOLD pointer |
||||
|
IMMED? nfa -- f fetch immediate flag |
||||
|
INTERPRET i*x c-addr u -- j*x |
||||
|
interpret given buffer |
||||
|
L0 -- a-addr bottom of Leave stack |
||||
|
LATEST -- a-addr last word in dictionary |
||||
|
LP -- a-addr Leave-stack pointer |
||||
|
L> -- x L: x -- move from Leave stack |
||||
|
NFA>CFA nfa -- cfa name adr -> code field |
||||
|
NFA>LFA nfa -- lfa name adr -> link field |
||||
|
R0 -- a-addr end of return stack |
||||
|
REVEAL -- "reveal" latest definition |
||||
|
S0 -- a-addr end of parameter stack |
||||
|
TIBSIZE -- n size of TIB |
||||
|
U0 -- a-addr current user area adrs |
||||
|
UD* ud1 d2 -- ud3 32*16->32 multiply |
||||
|
UD/MOD ud1 u2 -- u3 ud4 32/16->32 divide |
||||
|
UINIT -- addr initial values for user area |
||||
|
UMAX u1 u2 -- u unsigned maximum |
||||
|
UMIN u1 u2 -- u unsigned minimum |
||||
|
|
||||
@ -0,0 +1,112 @@ |
|||||
|
TABLE 1. GLOSSARY OF WORDS IN CAMEL80.AZM |
||||
|
Words which are (usually) written in CODE. |
||||
|
|
||||
|
NAME stack in -- stack out description |
||||
|
|
||||
|
Guide to stack diagrams: R: = return stack, |
||||
|
c = 8-bit character, flag = boolean (0 or -1), |
||||
|
n = signed 16-bit, u = unsigned 16-bit, |
||||
|
d = signed 32-bit, ud = unsigned 32-bit, |
||||
|
+n = unsigned 15-bit, x = any cell value, |
||||
|
i*x j*x = any number of cell values, |
||||
|
a-addr = aligned adrs, c-addr = character adrs |
||||
|
p-addr = I/O port adrs, sys = system-specific. |
||||
|
Refer to ANS Forth document for more details. |
||||
|
|
||||
|
ANS Forth Core words |
||||
|
These are required words whose definitions are |
||||
|
specified by the ANS Forth document. |
||||
|
|
||||
|
! x a-addr -- store cell in memory |
||||
|
+ n1/u1 n2/u2 -- n3/u3 add n1+n2 |
||||
|
+! n/u a-addr -- add cell to memory |
||||
|
- n1/u1 n2/u2 -- n3/u3 subtract n1-n2 |
||||
|
< n1 n2 -- flag test n1<n2, signed |
||||
|
= x1 x2 -- flag test x1=x2 |
||||
|
> n1 n2 -- flag test n1>n2, signed |
||||
|
>R x -- R: -- x push to return stack |
||||
|
?DUP x -- 0 | x x DUP if nonzero |
||||
|
@ a-addr -- x fetch cell from memory |
||||
|
0< n -- flag true if TOS negative |
||||
|
0= n/u -- flag return true if TOS=0 |
||||
|
1+ n1/u1 -- n2/u2 add 1 to TOS |
||||
|
1- n1/u1 -- n2/u2 subtract 1 from TOS |
||||
|
2* x1 -- x2 arithmetic left shift |
||||
|
2/ x1 -- x2 arithmetic right shift |
||||
|
AND x1 x2 -- x3 logical AND |
||||
|
CONSTANT n -- define a Forth constant |
||||
|
C! c c-addr -- store char in memory |
||||
|
C@ c-addr -- c fetch char from memory |
||||
|
DROP x -- drop top of stack |
||||
|
DUP x -- x x duplicate top of stack |
||||
|
EMIT c -- output character to console |
||||
|
EXECUTE i*x xt -- j*x execute Forth word 'xt' |
||||
|
EXIT -- exit a colon definition |
||||
|
FILL c-addr u c -- fill memory with char |
||||
|
I -- n R: sys1 sys2 -- sys1 sys2 |
||||
|
get the innermost loop index |
||||
|
INVERT x1 -- x2 bitwise inversion |
||||
|
J -- n R: 4*sys -- 4*sys |
||||
|
get the second loop index |
||||
|
KEY -- c get character from keyboard |
||||
|
LSHIFT x1 u -- x2 logical L shift u places |
||||
|
NEGATE x1 -- x2 two's complement |
||||
|
OR x1 x2 -- x3 logical OR |
||||
|
OVER x1 x2 -- x1 x2 x1 per stack diagram |
||||
|
ROT x1 x2 x3 -- x2 x3 x1 per stack diagram |
||||
|
RSHIFT x1 u -- x2 logical R shift u places |
||||
|
R> -- x R: x -- pop from return stack |
||||
|
R@ -- x R: x -- x fetch from rtn stk |
||||
|
SWAP x1 x2 -- x2 x1 swap top two items |
||||
|
UM* u1 u2 -- ud unsigned 16x16->32 mult. |
||||
|
UM/MOD ud u1 -- u2 u3 unsigned 32/16->16 div. |
||||
|
UNLOOP -- R: sys1 sys2 -- drop loop parms |
||||
|
U< u1 u2 -- flag test u1<n2, unsigned |
||||
|
VARIABLE -- define a Forth variable |
||||
|
XOR x1 x2 -- x3 logical XOR |
||||
|
|
||||
|
ANS Forth Extensions |
||||
|
These are optional words whose definitions are |
||||
|
specified by the ANS Forth document. |
||||
|
|
||||
|
<> x1 x2 -- flag test not equal |
||||
|
BYE i*x -- return to CP/M |
||||
|
CMOVE c-addr1 c-addr2 u -- move from bottom |
||||
|
CMOVE> c-addr1 c-addr2 u -- move from top |
||||
|
KEY? -- flag return true if char waiting |
||||
|
M+ d1 n -- d2 add single to double |
||||
|
NIP x1 x2 -- x2 per stack diagram |
||||
|
TUCK x1 x2 -- x2 x1 x2 per stack diagram |
||||
|
U> u1 u2 -- flag test u1>u2, unsigned |
||||
|
|
||||
|
Private Extensions |
||||
|
These are words which are unique to CamelForth. |
||||
|
Many of these are necessary to implement ANS |
||||
|
Forth words, but are not specified by the ANS |
||||
|
document. Others are functions I find useful. |
||||
|
|
||||
|
(do) n1|u1 n2|u2 -- R: -- sys1 sys2 |
||||
|
run-time code for DO |
||||
|
(loop) R: sys1 sys2 -- | sys1 sys2 |
||||
|
run-time code for LOOP |
||||
|
(+loop) n -- R: sys1 sys2 -- | sys1 sys2 |
||||
|
run-time code for +LOOP |
||||
|
>< x1 -- x2 swap bytes |
||||
|
?branch x -- branch if TOS zero |
||||
|
BDOS DE C -- A call CP/M BDOS |
||||
|
branch -- branch always |
||||
|
lit -- x fetch inline literal to stack |
||||
|
PC! c p-addr -- output char to port |
||||
|
PC@ p-addr -- c input char from port |
||||
|
RP! a-addr -- set return stack pointer |
||||
|
RP@ -- a-addr get return stack pointer |
||||
|
SCAN c-addr1 u1 c -- c-addr2 u2 |
||||
|
find matching char |
||||
|
SKIP c-addr1 u1 c -- c-addr2 u2 |
||||
|
skip matching chars |
||||
|
SP! a-addr -- set data stack pointer |
||||
|
SP@ -- a-addr get data stack pointer |
||||
|
S= c-addr1 c-addr2 u -- n string compare |
||||
|
n<0: s1<s2, n=0: s1=s2, n>0: s1>s2 |
||||
|
USER n -- define user variable 'n' |
||||
|
|
||||
@ -0,0 +1,166 @@ |
|||||
|
CAMELFORTH FOR THE Z80 - BETA TEST VERSION - 16 APRIL 1995 |
||||
|
========================================================== |
||||
|
|
||||
|
This is a BETA TEST version of CamelForth/80, an ANSI Standard Forth for |
||||
|
the Zilog Z80 microprocessor and the CP/M operating system. This means |
||||
|
that, although I have tested the bulk of this code for correct |
||||
|
functioning, and have fixed several bugs, you may discover new bugs. |
||||
|
I'd appreciate hearing of any such, either |
||||
|
|
||||
|
by Internet: bj@camelforth.com |
||||
|
|
||||
|
I'll also answer questions and try to solve problems. |
||||
|
|
||||
|
* * * |
||||
|
|
||||
|
As distributed, CamelForth will assemble to run under CP/M 2.x. It |
||||
|
determines the highest available RAM location from CP/M, and places its |
||||
|
data areas (stacks, user area, etc.) immediately below that. The |
||||
|
CamelForth program resides in the bottom of the CP/M program area |
||||
|
(100h), and any user definitions are added immediately after. CP/M's |
||||
|
default command buffer at 80h is used for the Terminal Input Buffer. |
||||
|
|
||||
|
To start CamelForth under CP/M, type the command |
||||
|
|
||||
|
CAMEL80 ...any Forth commands... |
||||
|
|
||||
|
CamelForth will execute the rest of the CP/M command line as a Forth |
||||
|
statement, and then enter the Forth interpreter. To return to CP/M, use |
||||
|
the command |
||||
|
|
||||
|
BYE |
||||
|
|
||||
|
Note that CamelForth is CASE SENSITIVE, and all Forth words are in UPPER |
||||
|
CASE. |
||||
|
|
||||
|
MODIFICATION FOR STANDALONE USE |
||||
|
|
||||
|
CamelForth can be easily assembled for a standalone or embedded Z80. |
||||
|
About 6K of PROM and 640 bytes of RAM are used by CamelForth, plus |
||||
|
whatever additional PROM and RAM is needed by your program. You will |
||||
|
probably need to provide the Z80 reset vector, e.g. |
||||
|
|
||||
|
org 0 |
||||
|
jp reset |
||||
|
|
||||
|
You must also add any required hardware initialization, and the Forth |
||||
|
words KEY KEY? and EMIT for your hardware. You should modify the |
||||
|
'reset' routine to use an equate for end of RAM, e.g. |
||||
|
|
||||
|
reset: ld hl,ramend ; end of available memory (EM) |
||||
|
dec h ; EM-100h |
||||
|
ld sp,hl ; = top of param stack |
||||
|
inc h ; EM |
||||
|
etc. |
||||
|
|
||||
|
If you are putting CamelForth in PROM, but want to have a Forth |
||||
|
dictionary in RAM (so you can add new definitions), you'll have to |
||||
|
change the 'enddict' equate (at the end of camel80.azm) to the your |
||||
|
starting RAM address. Do NOT change the 'lastword' equate. |
||||
|
|
||||
|
The Terminal Input Buffer must be moved to a new location in RAM. The |
||||
|
usual CamelForth usage is 80h bytes below the user area. TIB can be |
||||
|
redefined as |
||||
|
|
||||
|
;X tib -- a-addr Terminal Input Buffer |
||||
|
; HEX -80 USER TIB below user area |
||||
|
head TIB,3,TIB,douser |
||||
|
dw -80h |
||||
|
|
||||
|
You should also delete the line |
||||
|
|
||||
|
DW LIT,80h,COUNT,INTERPRET |
||||
|
|
||||
|
from the routine COLD. This line causes the CP/M command "tail" to be |
||||
|
executed as a Forth command...inapplicable in a standalone system. |
||||
|
|
||||
|
* * * |
||||
|
|
||||
|
This program was written using the Z80MR macro assembler under CP/M. |
||||
|
Z80MR is a freeware assembler, available from GEnie and several other |
||||
|
CP/M archives. Assemble the CamelForth source files with the commands |
||||
|
|
||||
|
z80mr camel80 |
||||
|
load camel80 |
||||
|
|
||||
|
Z80MR produces an Intel hex file camel80.hex, and LOAD generates the |
||||
|
file camel80.com. (Note: do NOT use the version of Z80MR that directly |
||||
|
outputs a .COM file; that version of the assembler has bugs.) For |
||||
|
embedded applications you probably can skip the LOAD, since most PROM |
||||
|
programmers, PROM emulators, and debug programs will accept Intel hex |
||||
|
files. |
||||
|
|
||||
|
If you don't have CP/M, you can use the MYZ80 emulator on an IBM PC, or |
||||
|
you can rewrite the source code for your Z80 macro assembler. |
||||
|
|
||||
|
There are TWO WAYS to write embedded programs in CamelForth: |
||||
|
|
||||
|
1. If you have CamelForth running on an embedded Z80, you can download |
||||
|
Forth code directly to CamelForth. This lets you type new words from |
||||
|
the keyboard, test them as they are defined, and re-define them to make |
||||
|
changes. Or you can edit an ASCII text file, and use a program such as |
||||
|
Procomm to send this file over the serial port to your Z80. It can take |
||||
|
a few seconds to compile each line, so be sure to leave plenty of delay |
||||
|
after the line. (I'm working on handshaking to improve this.) Also be |
||||
|
sure that no line exceeds 80 characters. |
||||
|
|
||||
|
2. If you you want to burn your program into PROM, you can add your code |
||||
|
to the file CAMEL80.ASM. (I recommend creating a separate file and |
||||
|
using the *INCLUDE directive.) This requires you to convert your Forth |
||||
|
code to assembler code. To show how this is done, every high-level |
||||
|
Forth word in the file is shown with its equivalent Forth code in a |
||||
|
comment. Be especially careful with control structures (IF..ELSE..THEN, |
||||
|
BEGIN..UNTIL, DO..LOOP, and the like), and with the Forth word headers. |
||||
|
Reassemble CAMEL80.AZM and burn a PROM (or download to a PROM emulator |
||||
|
or debug monitor), then test. This is a much slower process, and is |
||||
|
best saved for the final stage when you have a tested & debugged program |
||||
|
that you want to put in PROM. |
||||
|
|
||||
|
Disk I/O is not yet supported under CP/M. However, CamelForth v1.2 will |
||||
|
accept commands from a CP/M SUBMIT file using the XSUB utility. The |
||||
|
SUBMIT file should contain the commands |
||||
|
|
||||
|
XSUB |
||||
|
CAMEL80 |
||||
|
...Forth source code... |
||||
|
|
||||
|
This will run CamelForth/80 under XSUB, which will feed the rest of the |
||||
|
file to CamelForth as terminal input. You can automatically return to |
||||
|
CP/M by putting the CamelForth BYE command in the file. Then you can |
||||
|
save the modified CamelForth image with the CP/M command |
||||
|
|
||||
|
SAVE nn CAMELNEW.COM |
||||
|
|
||||
|
'nn' is the decimal number of pages occupied by the CamelForth |
||||
|
dictionary. You can determine this value while in CamelForth with the |
||||
|
statement |
||||
|
|
||||
|
DECIMAL HERE 0 256 UM/MOD NIP . |
||||
|
|
||||
|
Unfortunately, at the moment there's no way to totally automate this as |
||||
|
part of the SUBMIT file. And I'm reluctant to add SAVE to CamelForth |
||||
|
when CP/M has a perfectly good SAVE command. |
||||
|
|
||||
|
* * * |
||||
|
|
||||
|
--------------------------- LICENSE TERMS ------------------------------ |
||||
|
CamelForth for the Zilog Z80 Copyright 1994,1995 Bradford J. Rodriguez. |
||||
|
|
||||
|
This program is free software; you can redistribute it and/or modify |
||||
|
it under the terms of the GNU General Public License as published by |
||||
|
the Free Software Foundation; either version 3 of the License, or |
||||
|
(at your option) any later version. |
||||
|
|
||||
|
This program is distributed in the hope that it will be useful, |
||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
||||
|
GNU General Public License for more details. |
||||
|
|
||||
|
You should have received a copy of the GNU General Public License |
||||
|
along with this program. If not, see <http://www.gnu.org/licenses/>. |
||||
|
|
||||
|
Commercial inquiries should be directed to the author at |
||||
|
115 First St., #105, Collingwood, Ontario L9Y 4W3 Canada |
||||
|
or via email to bj@camelforth.com |
||||
|
------------------------------------------------------------------------ |
||||
|
|
||||
Binary file not shown.
Loading…
Reference in new issue