Import coco-planes 0.1.0 upstream source snapshot
Original author: Pierre Sarrazin. Preserve upstream GPLv3-or-later and file-specific notices. Source: http://sarrazip.com/dev/coco-planes-0.1.0.tar.gz Archive SHA-256: 29191e6ba225965caa637ee726e1189639dc7fcdf2b68310fb93fbffd56c9c52
This commit is contained in:
commit
7939132267
78 files changed
+6990
No files matched your search
+171
@@ -0,0 +1,171 @@
|
||||
#include "BiplaneMover.h"
|
||||
|
||||
#include "Sprite.h"
|
||||
#include "PreShiftedBitmap.h"
|
||||
#include "util.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
void
|
||||
BiplaneMover_init(BiplaneMover *self,
|
||||
Sprite *biplane,
|
||||
const PreShiftedBitmap *biplaneBitmapArray[],
|
||||
byte climbIncr,
|
||||
byte diveIncr,
|
||||
BiplaneDirectionFunctor directionFunctor)
|
||||
{
|
||||
self->biplane = biplane;
|
||||
self->speed = 0;
|
||||
self->numFramesBeforeSpawn = 0;
|
||||
self->hasStarted = FALSE;
|
||||
self->isStalled = FALSE;
|
||||
self->biplaneBitmapArray = biplaneBitmapArray;
|
||||
self->climbIncr = climbIncr;
|
||||
self->diveIncr = diveIncr;
|
||||
self->directionFunctor = directionFunctor;
|
||||
}
|
||||
|
||||
|
||||
// Table that represents the gravity that is applied to a plane
|
||||
// that is pointing up 45, 67.5, 90, 112.5 or 135 degrees from
|
||||
// the positive x axis.
|
||||
// The constants are 256 * sin(angle) * 0.075.
|
||||
//
|
||||
static const sword gravityTable[5] =
|
||||
{
|
||||
16, 21, 23, 21, 16,
|
||||
};
|
||||
|
||||
|
||||
// Returns the contribution of gravity to the speed, in 256ths of a pixel.
|
||||
// The angle of the plane is given by biplane->bitmapIndex.
|
||||
//
|
||||
static sword
|
||||
BiplaneMover_computeGravity(Sprite *biplane)
|
||||
{
|
||||
byte bi = biplane->bitmapIndex;
|
||||
if (bi < 2 || bi > 6) // if not 45..135 degrees
|
||||
return 0;
|
||||
return gravityTable[bi - 2];
|
||||
}
|
||||
|
||||
|
||||
static sword
|
||||
patchHorizSpeed(sword dx)
|
||||
{
|
||||
if (dx > 0 && (byte) dx & 1)
|
||||
return dx + 1;
|
||||
if (dx < 0 && (byte) dx & 1)
|
||||
return dx - 1;
|
||||
return dx;
|
||||
}
|
||||
|
||||
|
||||
BOOL
|
||||
BiplaneMover_move(BiplaneMover *self)
|
||||
{
|
||||
assert(self);
|
||||
if (!self->hasStarted)
|
||||
return FALSE;
|
||||
|
||||
Sprite *biplane = self->biplane;
|
||||
assert(biplane);
|
||||
if (!biplane->active)
|
||||
return FALSE;
|
||||
|
||||
BOOL explosionRequested = FALSE;
|
||||
byte *bitmapIndex = &biplane->bitmapIndex;
|
||||
assert(*bitmapIndex < NUM_BIPLANE_BITMAPS);
|
||||
|
||||
byte direction = (*self->directionFunctor)();
|
||||
|
||||
assert(direction == DIR_FORWARD || direction == DIR_CLIMB || direction == DIR_DIVE);
|
||||
if (direction == DIR_CLIMB)
|
||||
{
|
||||
*bitmapIndex = (*bitmapIndex + self->climbIncr) % NUM_BIPLANE_BITMAPS;
|
||||
biplane->bm = self->biplaneBitmapArray[*bitmapIndex];
|
||||
}
|
||||
else if (direction == DIR_DIVE)
|
||||
{
|
||||
*bitmapIndex = (*bitmapIndex + self->diveIncr) % NUM_BIPLANE_BITMAPS;
|
||||
biplane->bm = self->biplaneBitmapArray[*bitmapIndex];
|
||||
}
|
||||
assert(*bitmapIndex < NUM_BIPLANE_BITMAPS);
|
||||
assert(biplane->bm);
|
||||
assert(biplane->bm->height == BIPLANE_HEIGHT);
|
||||
|
||||
// *bitmapIndex gives the orientation of the plane.
|
||||
// Get a speed vector from it.
|
||||
// Add the speed to the sprite position, with edge detection, clamping
|
||||
// and horizontal wraparound.
|
||||
|
||||
sword dx, dy; // change of position to be applied to plane, in whole pixels
|
||||
|
||||
if (! self->isStalled)
|
||||
{
|
||||
sword g = BiplaneMover_computeGravity(biplane);
|
||||
assert(g >= 0);
|
||||
self->speed -= g;
|
||||
self->speed += ACCELERATION_256THS;
|
||||
if (self->speed > MAX_SPEED_256THS)
|
||||
self->speed = MAX_SPEED_256THS;
|
||||
else if (self->speed < MIN_SPEED_256THS)
|
||||
{
|
||||
// Stall b/c speed dropped too low from climbing.
|
||||
self->speed = MIN_SPEED_256THS;
|
||||
self->isStalled = TRUE;
|
||||
}
|
||||
|
||||
sword c, s;
|
||||
cosSin256ths(*bitmapIndex, &c, &s);
|
||||
dx = mul256thsToByte(self->speed, c);
|
||||
dx = patchHorizSpeed(dx);
|
||||
dy = - mul256thsToByte(self->speed, s); // negation b/c y axis points down
|
||||
}
|
||||
else // stalled:
|
||||
{
|
||||
// Plane must nose-dive to recover.
|
||||
|
||||
if (*bitmapIndex >= 10 && *bitmapIndex <= 14) // if 45..135 deg. down from pos. x axis
|
||||
{
|
||||
self->speed += 100; // build momentum in the dive
|
||||
|
||||
if (self->speed >= MIN_SPEED_256THS)
|
||||
self->isStalled = FALSE; // airflow restored over wings
|
||||
}
|
||||
else
|
||||
self->speed = 2 * 256; // heavy drag while tumbling stall
|
||||
|
||||
sword c = cos256ths(*bitmapIndex);
|
||||
dx = mul256thsToByte(self->speed, c);
|
||||
dx = patchHorizSpeed(dx);
|
||||
|
||||
dy = 3; // plane drops heavily due to loss of lift
|
||||
}
|
||||
assert(dx >= -20 && dx <= 20); // sanity check
|
||||
assert(dy >= -20 && dy <= 20); // sanity check
|
||||
|
||||
// Change the position of 'biplane' by (dx, dy).
|
||||
//
|
||||
sword newX = biplane->x + dx;
|
||||
if (newX > COLS_PER_SCREEN - 2 - SPRITE_WIDTH) // if past rightmost allowed pos
|
||||
newX = 2; // reposition at leftmost allowed pos
|
||||
else if (newX < 2)
|
||||
newX = COLS_PER_SCREEN - 2 - SPRITE_WIDTH;
|
||||
biplane->x = (byte) newX;
|
||||
|
||||
if (dy < 0 && biplane->y < (byte) - dy) // if too high
|
||||
biplane->y = 0;
|
||||
else if (dy > 0 // if too low
|
||||
&& biplane->y + BIPLANE_HEIGHT + (byte) dy > ROWS_PER_SCREEN)
|
||||
{
|
||||
biplane->y = ROWS_PER_SCREEN - BIPLANE_HEIGHT;
|
||||
biplane->active = FALSE;
|
||||
explosionRequested = TRUE;
|
||||
}
|
||||
else
|
||||
biplane->y += (sbyte) dy;
|
||||
|
||||
return explosionRequested;
|
||||
}
|
||||
@@ -0,0 +1,60 @@
|
||||
#ifndef _H_BiplaneMover
|
||||
#define _H_BiplaneMover
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
enum
|
||||
{
|
||||
NUM_BIPLANE_BITMAPS = 16, // number of bitmaps per player (16 red, 16 blue)
|
||||
BIPLANE_HEIGHT = 16, // height of a biplane bounding square, in pixels
|
||||
MAX_SPEED_256THS = 5 * 256, // in 256ths of a pixel
|
||||
MIN_SPEED_256THS = 900,
|
||||
ACCELERATION_256THS = 6, // about 0.025 * 256; see BiplaneMover_computeGravity() re: gravity
|
||||
|
||||
// Directions that a "direction functor" can decide to take.
|
||||
// See BiplaneDirectionFunctor.
|
||||
//
|
||||
DIR_FORWARD = 0,
|
||||
DIR_CLIMB = 1,
|
||||
DIR_DIVE = 2,
|
||||
};
|
||||
|
||||
|
||||
|
||||
// Must return a direction to be taken by the biplane, i.e.,
|
||||
// one of the DIR_* values above.
|
||||
//
|
||||
typedef byte (*BiplaneDirectionFunctor)(void);
|
||||
|
||||
|
||||
typedef struct BiplaneMover
|
||||
{
|
||||
struct Sprite *biplane;
|
||||
sword speed; // in 256ths of a pixel
|
||||
byte numFramesBeforeSpawn;
|
||||
BOOL hasStarted; // has launched (is not waiting for take off)
|
||||
BOOL isStalled;
|
||||
const struct PreShiftedBitmap **biplaneBitmapArray;
|
||||
byte climbIncr; // to be added to biplane->sprite to make plane climb up
|
||||
byte diveIncr; // ditto, for diving
|
||||
BiplaneDirectionFunctor directionFunctor;
|
||||
} BiplaneMover;
|
||||
|
||||
|
||||
void BiplaneMover_init(BiplaneMover *self,
|
||||
struct Sprite *biplane,
|
||||
const struct PreShiftedBitmap *biplaneBitmapArray[],
|
||||
byte climbIncr,
|
||||
byte diveIncr,
|
||||
BiplaneDirectionFunctor directionFunctor);
|
||||
|
||||
|
||||
// Returns TRUE if the plane has crashed and an explosion must be started
|
||||
// at the position of self->biplane.
|
||||
// In that case, the biplane has already been marked as inactive.
|
||||
//
|
||||
BOOL BiplaneMover_move(BiplaneMover *self);
|
||||
|
||||
|
||||
#endif /* _H_BiplaneMover */
|
||||
@@ -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,52 @@
|
||||
#include "Controller.h"
|
||||
|
||||
#include "BiplaneMover.h"
|
||||
#include "util.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
// Choose the delay (in frames) before this controller decides to
|
||||
// launch the plane.
|
||||
//
|
||||
static word
|
||||
Controller_chooseNumFramesBeforeLaunch(void)
|
||||
{
|
||||
return rnd(1 * 20, 10 * 20);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
Controller_init(Controller *self,
|
||||
byte controlType,
|
||||
BiplaneMover *mover,
|
||||
byte probeBit,
|
||||
byte testBit,
|
||||
byte joyButtonMask)
|
||||
{
|
||||
assert(mover);
|
||||
|
||||
self->controlType = controlType;
|
||||
|
||||
self->mover = mover;
|
||||
|
||||
KeyState_init(&self->fireKeyState, probeBit, testBit);
|
||||
|
||||
self->joyButtonMask = joyButtonMask;
|
||||
|
||||
// Only used with AUTOMATIC_CONTROLLER:
|
||||
self->state = STATE_READY_FOR_TAKE_OFF;
|
||||
self->numFramesBeforeStateChange = Controller_chooseNumFramesBeforeLaunch();
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
Controller_onBiplaneExplosion(Controller *self)
|
||||
{
|
||||
// The plane has just started exploding.
|
||||
// Put it back to "ready for take off" state.
|
||||
// Choose the wait time before taking off.
|
||||
//
|
||||
self->state = STATE_READY_FOR_TAKE_OFF;
|
||||
self->numFramesBeforeStateChange = Controller_chooseNumFramesBeforeLaunch();
|
||||
}
|
||||
@@ -0,0 +1,61 @@
|
||||
#ifndef _H_Controller
|
||||
#define _H_Controller
|
||||
|
||||
#include "KeyState.h"
|
||||
|
||||
|
||||
enum { KEYBOARD_CONTROLLER, JOYSTICK_CONTROLLER, AUTOMATIC_CONTROLLER };
|
||||
|
||||
|
||||
// Use for the state machine that is used with AUTOMATIC_CONTROLLER.
|
||||
//
|
||||
enum
|
||||
{
|
||||
STATE_READY_FOR_TAKE_OFF,
|
||||
STATE_ON_RUNWAY,
|
||||
STATE_FIRST_CLIMB,
|
||||
STATE_IN_FLIGHT,
|
||||
STATE_LOOPING_CLIMB,
|
||||
STATE_LOOPING_DIVE,
|
||||
STATE_ATTACK_CLIMB,
|
||||
STATE_ATTACK_DIVE,
|
||||
};
|
||||
|
||||
|
||||
typedef struct Controller
|
||||
{
|
||||
byte controlType; // *_CONTROLLER enum value
|
||||
|
||||
struct BiplaneMover *mover;
|
||||
|
||||
// For KEYBOARD_CONTROLLER case:
|
||||
KeyState fireKeyState;
|
||||
|
||||
// For JOYSTICK_CONTROLLER case:
|
||||
byte joyButtonMask;
|
||||
|
||||
// For AUTOMATIC_CONTROLLER case:
|
||||
byte state; // STATE_* value
|
||||
word numFramesBeforeStateChange;
|
||||
|
||||
} Controller;
|
||||
|
||||
|
||||
// probeBit: KEY_PROBE_*.
|
||||
// testBit: KEY_BIT_*.
|
||||
// joyButtonMask: JOY_BUTTON_*_MASK.
|
||||
//
|
||||
void Controller_init(Controller *self,
|
||||
byte controlType,
|
||||
struct BiplaneMover *mover,
|
||||
byte probeBit,
|
||||
byte testBit,
|
||||
byte joyButtonMask);
|
||||
|
||||
|
||||
// Must be called at each point where the plane starts exploding.
|
||||
//
|
||||
void Controller_onBiplaneExplosion(Controller *self);
|
||||
|
||||
|
||||
#endif /* _H_Controller */
|
||||
+51
@@ -0,0 +1,51 @@
|
||||
/* DirtyRect.c
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#include "DirtyRect.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
__gcccall void asm
|
||||
DirtyRect_clean(const DirtyRect *dr)
|
||||
{
|
||||
#if 0 /* Original C code. */
|
||||
byte *dest = dr->addr;
|
||||
//printf("[DRCLEAN %p %u]", dest, dr->numRows);
|
||||
assert(dr->numRows > 0 && dr->numRows <= 192);
|
||||
for (byte n = dr->numRows, i = 0; i < n; ++i, dest += DirtyRect_BYTES_PER_ROW)
|
||||
{
|
||||
memset(dest, '\0', DirtyRect_WIDTH);
|
||||
}
|
||||
#else
|
||||
asm
|
||||
{
|
||||
; 'dr' received in X as per __gcccall.
|
||||
ldb 2,x ; B = dr->numRows: height in pixels of rectangle
|
||||
ldx ,x ; X = dr->addr: 1st screen byte of top row of dirty rect
|
||||
clra ; byte to clear with
|
||||
@nextRow
|
||||
sta ,x ; a dirty rect is already 3 bytes wide (cf DirtyRect_WIDTH)
|
||||
sta 1,x
|
||||
sta 2,x
|
||||
@cond
|
||||
leax DirtyRect_BYTES_PER_ROW,x ; point to next screen row
|
||||
decb ; rows left?
|
||||
bne @nextRow ; if yes
|
||||
}
|
||||
#endif
|
||||
}
|
||||
+44
@@ -0,0 +1,44 @@
|
||||
/* DirtyRect.h
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#ifndef _H_DirtyRect
|
||||
#define _H_DirtyRect
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
enum
|
||||
{
|
||||
DirtyRect_BYTES_PER_ROW = 32,
|
||||
DirtyRect_WIDTH = 3, // in bytes
|
||||
};
|
||||
|
||||
|
||||
typedef struct DirtyRect
|
||||
{
|
||||
byte *addr; // first screen byte of top row of dirty rectangle
|
||||
byte numRows; // height in pixels of rectangle
|
||||
} DirtyRect;
|
||||
|
||||
|
||||
// Cleans the screen area described by the DirtyRect.
|
||||
// Uses DirtyRect_BYTES_PER_ROW.
|
||||
//
|
||||
__gcccall void DirtyRect_clean(const DirtyRect *dr);
|
||||
|
||||
|
||||
#endif /* _H_DirtyRect */
|
||||
@@ -0,0 +1,62 @@
|
||||
/* DirtyRectList.c
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#include "DirtyRectList.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
void
|
||||
DirtyRectList_init(DirtyRectList *self)
|
||||
{
|
||||
self->count = 0;
|
||||
self->peak = 0;
|
||||
}
|
||||
|
||||
|
||||
BOOL
|
||||
DirtyRectList_add(DirtyRectList *self, byte *addr, byte numRows)
|
||||
{
|
||||
assert(self);
|
||||
assert(addr);
|
||||
assert(numRows > 0);
|
||||
|
||||
byte *count = &self->count;
|
||||
if (*count >= DirtyRectList_MAX_DIRTY_RECTS)
|
||||
return FALSE;
|
||||
|
||||
DirtyRect *dr = &self->rects[(*count)++]; // next DirtyRect field to fill
|
||||
dr->addr = addr;
|
||||
dr->numRows = numRows;
|
||||
#ifndef NDEBUG
|
||||
if (*count > self->peak)
|
||||
self->peak = *count;
|
||||
#endif
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
DirtyRectList_clean(DirtyRectList *self)
|
||||
{
|
||||
const DirtyRect *dr = self->rects;
|
||||
//printf("[DRLCLEAN(%p):DR=%p,C=%u]", self, dr, self->count);
|
||||
for (byte i = self->count; i--; ++dr)
|
||||
DirtyRect_clean(dr);
|
||||
//printf("[DRLCLEAN:END]");
|
||||
self->count = 0;
|
||||
}
|
||||
@@ -0,0 +1,64 @@
|
||||
/* DirtyRectList.h
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#ifndef _H_DirtyRectList
|
||||
#define _H_DirtyRectList
|
||||
|
||||
#include "DirtyRect.h"
|
||||
|
||||
|
||||
enum
|
||||
{
|
||||
DirtyRectList_MAX_DIRTY_RECTS = 24, // must be <= 255
|
||||
};
|
||||
|
||||
|
||||
typedef struct DirtyRectList
|
||||
{
|
||||
byte count;
|
||||
byte peak;
|
||||
DirtyRect rects[DirtyRectList_MAX_DIRTY_RECTS];
|
||||
} DirtyRectList;
|
||||
|
||||
|
||||
void DirtyRectList_init(DirtyRectList *self);
|
||||
|
||||
|
||||
// Remembers that the rectangle whose top-left byte is 'addr'
|
||||
// is now "dirty" in the given "dirty list", which is supposed to
|
||||
// correspond with the current screen page.
|
||||
//
|
||||
// Each dirty rectangle is DirtyRect_WIDTH bytes wide.
|
||||
//
|
||||
// numRows: Number of pixel rows of the dirty rectangle (must NOT be zero).
|
||||
//
|
||||
// Returns FALSE if there is no room for the new dirty rectangle
|
||||
// in 'dirtyList' (re: DirtyRectList_MAX_DIRTY_RECTS).
|
||||
//
|
||||
// Increments the count field in the given dirty list.
|
||||
// Updates self->peak if NDEBUG is not defined.
|
||||
//
|
||||
BOOL DirtyRectList_add(DirtyRectList *self, byte *addr, byte numRows);
|
||||
|
||||
|
||||
// Calls DirtyRect_clean() for every dirty rectangle in the list,
|
||||
// then clears that list.
|
||||
//
|
||||
void DirtyRectList_clean(DirtyRectList *self);
|
||||
|
||||
|
||||
#endif /* _H_DirtyRectList */
|
||||
+20
@@ -0,0 +1,20 @@
|
||||
#include "KeyState.h"
|
||||
|
||||
|
||||
void
|
||||
KeyState_init(KeyState *self, byte probeBit, BOOL testBit)
|
||||
{
|
||||
self->probeBit = probeBit;
|
||||
self->testBit = testBit;
|
||||
self->pressedPreviously = FALSE;
|
||||
}
|
||||
|
||||
|
||||
BOOL
|
||||
KeyState_update(KeyState *self)
|
||||
{
|
||||
BOOL pressedNow = isKeyPressed(self->probeBit, self->testBit);
|
||||
BOOL justPressed = (!self->pressedPreviously && pressedNow);
|
||||
self->pressedPreviously = pressedNow;
|
||||
return justPressed;
|
||||
}
|
||||
+28
@@ -0,0 +1,28 @@
|
||||
#ifndef _H_KeyState
|
||||
#define _H_KeyState
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
typedef struct KeyState
|
||||
{
|
||||
byte probeBit; // KEY_PROBE_*
|
||||
byte testBit; // KEY_BIT_*
|
||||
BOOL pressedPreviously;
|
||||
} KeyState;
|
||||
|
||||
|
||||
// probeBit: KEY_PROBE_* enum value.
|
||||
// testBit: KEY_BIT_* enum value.
|
||||
//
|
||||
void KeyState_init(KeyState *self, byte probeBit, byte testBit);
|
||||
|
||||
|
||||
// Must be called at each frame.
|
||||
// Returns TRUE if the key has just been pressed (since the last time
|
||||
// that this function was called on this KeyState).
|
||||
//
|
||||
BOOL KeyState_update(KeyState *self);
|
||||
|
||||
|
||||
#endif /* _H_KeyState */
|
||||
@@ -0,0 +1,331 @@
|
||||
PACKAGE = coco-planes
|
||||
VERSION = 0.1.0
|
||||
COPYRIGHT_YEARS = 2026
|
||||
|
||||
DISPLAY_NAME = COCO PLANES
|
||||
PROG = coco-planes
|
||||
PROGRAM_ALL_CAPS_8_CHAR = CCPLANES
|
||||
|
||||
TARGET = coco
|
||||
|
||||
# Directories of required libraries (typically symlinks).
|
||||
# These libraries are available on the CMOC home page.
|
||||
#
|
||||
DECBFILE_LIB_DIR = decbfile
|
||||
CARDGAME_LIB_DIR = cardgame
|
||||
BCONTROL_LIB_DIR = bcontrol
|
||||
|
||||
CMOC = cmoc
|
||||
PERL = perl
|
||||
TAR = tar
|
||||
TOUCH = touch
|
||||
GREP = grep
|
||||
WRITECOCOFILE = writecocofile
|
||||
INSTALL_LOADER = install-coco-boot-loader
|
||||
|
||||
NDEBUG = -DNDEBUG
|
||||
WERROR = -Werror
|
||||
INTERMEDIATE = #-i
|
||||
OPTIM = -fomit-frame-pointer #-O0
|
||||
WARNINGS = -Wno-inline-asm-array-indexes -Wno-unknown-first-dim -Wno-too-many-elements
|
||||
|
||||
# Should be 1 to let the user type in an RNG seed, 0 otherwise.
|
||||
SEED_FROM_USER = 0
|
||||
|
||||
DEFINES = \
|
||||
-DVERSION=\"$(VERSION)\" \
|
||||
-DCOPYRIGHT_YEARS=\"$(COPYRIGHT_YEARS)\" \
|
||||
-DDISPLAY_NAME='"$(DISPLAY_NAME)"' \
|
||||
-DAPP_ENTRY=0x$(APP_ENTRY) \
|
||||
-DSEED_FROM_USER=$(SEED_FROM_USER)
|
||||
|
||||
CFLAGS = --no-relocate $(NDEBUG) $(WERROR) $(WARNINGS) $(INTERMEDIATE) $(OPTIM) $(DEFINES) \
|
||||
$(DECBFILE_CFLAGS) $(CARDGAME_CFLAGS) $(BCONTROL_CFLAGS)
|
||||
#CFLAGS += -Wno-uncalled-static
|
||||
|
||||
# See HACKING.md for a memory map.
|
||||
#
|
||||
APP_ENTRY = 4000
|
||||
APP_MAX_END = FEEE
|
||||
ORG = --org=$(APP_ENTRY)
|
||||
LDFLAGS = $(INTERMEDIATE)
|
||||
|
||||
# Bitmap filenames must only use [a-z0-9_], plus a dot for the extension.
|
||||
# The corresponding C struct name will be the filename with the dot
|
||||
# replaced with an underscore, e.g., shooter_bm.
|
||||
|
||||
BIPLANE_BITMAPS = \
|
||||
biplane_red_00.bm \
|
||||
biplane_red_01.bm \
|
||||
biplane_red_02.bm \
|
||||
biplane_red_03.bm \
|
||||
biplane_red_04.bm \
|
||||
biplane_red_05.bm \
|
||||
biplane_red_06.bm \
|
||||
biplane_red_07.bm \
|
||||
biplane_red_08.bm \
|
||||
biplane_red_09.bm \
|
||||
biplane_red_10.bm \
|
||||
biplane_red_11.bm \
|
||||
biplane_red_12.bm \
|
||||
biplane_red_13.bm \
|
||||
biplane_red_14.bm \
|
||||
biplane_red_15.bm \
|
||||
biplane_blue_00.bm \
|
||||
biplane_blue_01.bm \
|
||||
biplane_blue_02.bm \
|
||||
biplane_blue_03.bm \
|
||||
biplane_blue_04.bm \
|
||||
biplane_blue_05.bm \
|
||||
biplane_blue_06.bm \
|
||||
biplane_blue_07.bm \
|
||||
biplane_blue_08.bm \
|
||||
biplane_blue_09.bm \
|
||||
biplane_blue_10.bm \
|
||||
biplane_blue_11.bm \
|
||||
biplane_blue_12.bm \
|
||||
biplane_blue_13.bm \
|
||||
biplane_blue_14.bm \
|
||||
biplane_blue_15.bm
|
||||
|
||||
WIDE_BITMAPS = \
|
||||
$(BIPLANE_BITMAPS) \
|
||||
bullet.bm \
|
||||
explosion0.bm \
|
||||
explosion1.bm \
|
||||
balloon.bm \
|
||||
cloud_left.bm \
|
||||
cloud_right.bm
|
||||
|
||||
# The C struct name of a .sbm file ends with _bm, not _sbm.
|
||||
|
||||
SCORE_BITMAPS = \
|
||||
space.sbm minus.sbm \
|
||||
digit0.sbm digit1.sbm digit2.sbm digit3.sbm digit4.sbm \
|
||||
digit5.sbm digit6.sbm digit7.sbm digit8.sbm digit9.sbm
|
||||
|
||||
# Non-generated source files, except $(PROG).c.
|
||||
# The latter is excluded because it contains a main() function.
|
||||
# The other C files listed here are also meant to be linked with
|
||||
# unittsts.bin, which is a unit testing program, which comes with
|
||||
# its own main() function.
|
||||
#
|
||||
NON_GEN_SRC = \
|
||||
Sprite.c \
|
||||
BiplaneMover.c \
|
||||
util.c \
|
||||
DirtyRect.c \
|
||||
DirtyRectList.c \
|
||||
KeyState.c \
|
||||
Score.c \
|
||||
Controller.c
|
||||
|
||||
NON_GEN_HEADERS = \
|
||||
PreShiftedBitmap.h \
|
||||
ThinBitmap.h \
|
||||
Sprite.h \
|
||||
BiplaneMover.h \
|
||||
util.h \
|
||||
constants.h \
|
||||
DirtyRect.h \
|
||||
DirtyRectList.h \
|
||||
KeyState.h \
|
||||
Score.h \
|
||||
Controller.h
|
||||
|
||||
GEN_SRC = $(WIDE_BITMAPS:.bm=.bm.c) $(SCORE_BITMAPS:.sbm=.sbm.c) title.c
|
||||
SRC = $(NON_GEN_SRC) $(GEN_SRC)
|
||||
|
||||
GEN_HEADERS =
|
||||
|
||||
ifeq "$(TARGET)" "coco"
|
||||
DECBFILE_CFLAGS = -I $(DECBFILE_LIB_DIR)
|
||||
DECBFILE_LDFLAGS = -L $(DECBFILE_LIB_DIR) -ldecbfile
|
||||
endif
|
||||
|
||||
CARDGAME_CFLAGS = -I $(CARDGAME_LIB_DIR)
|
||||
CARDGAME_LDFLAGS = -L $(CARDGAME_LIB_DIR) -lcardgame
|
||||
|
||||
BCONTROL_CFLAGS = -I $(BCONTROL_LIB_DIR)
|
||||
BCONTROL_LDFLAGS = -L $(BCONTROL_LIB_DIR) -lbcontrol
|
||||
|
||||
LIBS = $(DECBFILE_LDFLAGS) $(CARDGAME_LDFLAGS) $(BCONTROL_LDFLAGS)
|
||||
|
||||
NON_GEN_OBJ = $(NON_GEN_SRC:.c=.o)
|
||||
GEN_OBJ = $(GEN_SRC:.c=.o)
|
||||
OBJ = $(NON_GEN_OBJ) $(GEN_OBJ)
|
||||
|
||||
DSK = $(PACKAGE)-$(VERSION)-$(TARGET).dsk
|
||||
|
||||
all: $(DSK)
|
||||
|
||||
# title.xpm must be generated from title.xcf (typically with the GIMP,
|
||||
# by exporting in XPM format, with alpha threshold 127).
|
||||
#
|
||||
title.c: convert-title-image.pl title.xpm
|
||||
$(PERL) convert-title-image.pl title.xpm > $@
|
||||
|
||||
INSTALL_LOADER = install-coco-boot-loader
|
||||
|
||||
# --allocate-after-dir is passed to writecocofile so that the .app file
|
||||
# is close to the directory track.
|
||||
# --allocate-after-dir requires the version of writecocofile that ships
|
||||
# with CMOC 0.1.100 or later.
|
||||
#
|
||||
$(DSK): $(PROG).app loader.bin
|
||||
ifeq "$(TARGET)" "coco"
|
||||
$(PERL) -e 'print chr(255) x (35*18*256)' > $@
|
||||
$(INSTALL_LOADER) --force $@ loader.bin # code loaded and executed by DOS command
|
||||
$(WRITECOCOFILE) --allocate-after-dir --decb-name="$(PROGRAM_ALL_CAPS_8_CHAR)" --decb-ext=APP $@ $(PROG).app
|
||||
$(PERL) -e 'print "\r10 DOS\r"' > ,basic-loader.bas
|
||||
$(WRITECOCOFILE) --ascii --allocate-after-dir --decb-name="$(PROGRAM_ALL_CAPS_8_CHAR)" --decb-ext=BAS $@ ,basic-loader.bas
|
||||
rm ,basic-loader.bas
|
||||
else
|
||||
@echo "ERROR: Distribution floppy not supported for target '$(TARGET)'."
|
||||
@false
|
||||
endif
|
||||
|
||||
# Main application, in raw format, to be loaded by loader.c, which is executable by DOS command.
|
||||
#
|
||||
$(PROG).app: $(PROG).o $(OBJ) $(CARDGAME_LIB_DIR)/libcardgame.a $(BCONTROL_LIB_DIR)/libbcontrol.a
|
||||
$(CMOC) --raw --$(TARGET) $(ORG) --limit=$(APP_MAX_END) $(LDFLAGS) -o $(PROG).app $(PROG).o $(OBJ) $(LIBS)
|
||||
|
||||
|
||||
# Check that the floppy image contains the expected directory entries.
|
||||
#
|
||||
.PHONY: check-floppy
|
||||
check-floppy: $(DSK)
|
||||
$(WRITECOCOFILE) -d $(DSK) | $(GREP) -q -E "$(PROGRAM_ALL_CAPS_8_CHAR)\.APP.*data.*binary"
|
||||
|
||||
# Builds .BIN unit testing program to be run on a CoCo.
|
||||
# TARGET must be "coco".
|
||||
# 'NDEBUG=' should be passed to make, to get asserts.
|
||||
#
|
||||
UNITTSTS_OBJ = util.o Score.o
|
||||
unittsts.bin: unittsts.o $(UNITTSTS_OBJ)
|
||||
$(CMOC) --coco $(CFLAGS) --org=2800 --limit=7C00 $(LDFLAGS) -o $@ unittsts.o $(UNITTSTS_OBJ) $(LIBS)
|
||||
|
||||
check: unittsts.bin check-floppy
|
||||
|
||||
|
||||
# Pattern rules.
|
||||
|
||||
%.o: %.c $(GEN_HEADERS)
|
||||
$(CMOC) -c --$(TARGET) $(CFLAGS) -o $@ $<
|
||||
|
||||
%.bm.o: %.bm
|
||||
$(PERL) compile-bitmap.pl --format=shiftedc $< > $<.c
|
||||
$(CMOC) -c --$(TARGET) $(CFLAGS) -o $@ $<.c
|
||||
|
||||
# Needed to keep GNU Make from saying "Circular xxx.bm <- xxx.bm.o dependency dropped."
|
||||
*.bm: ;
|
||||
|
||||
%.sbm.o: %.sbm
|
||||
$(PERL) compile-bitmap.pl --format=c $< > $<.c
|
||||
$(CMOC) -c --$(TARGET) $(CFLAGS) -o $@ $<.c
|
||||
|
||||
# Needed to keep GNU Make from saying "Circular xxx.sbm <- xxx.sbm.o dependency dropped."
|
||||
*.sbm: ;
|
||||
|
||||
|
||||
ifeq "$(TARGET)" "coco"
|
||||
LOADER_FLAGS = --dos
|
||||
else # dragon:
|
||||
LOADER_FLAGS = --dragon
|
||||
endif
|
||||
|
||||
# Loader program to be loaded (from track 34) and run by the DOS command.
|
||||
# This loader program MUST be relocatable, so we do not pass --no-relocate.
|
||||
# It loads a file whose 11-character name must be consistent with $(EXE).
|
||||
#
|
||||
loader.bin: loader.c $(DECBFILE_LIB_DIR)/libdecbfile.a
|
||||
$(CMOC) $(LOADER_FLAGS) -o $@ \
|
||||
'-DEXECUTABLE_FILENAME="$(PROGRAM_ALL_CAPS_8_CHAR)APP"' \
|
||||
-DCLIENT_PROGRAM_START=0x$(APP_ENTRY) \
|
||||
--limit=0x3780 \
|
||||
$(WARNINGS) $(WERROR) $(INTERMEDIATE) $(OPTIM) \
|
||||
$(DECBFILE_CFLAGS) \
|
||||
loader.c \
|
||||
$(DECBFILE_LDFLAGS)
|
||||
|
||||
# Runs make with arguments $(RECURSION) in the library projects used by this package.
|
||||
# Supports the -n (dry run) option.
|
||||
# Example: make recurse RECURSION=clean
|
||||
#
|
||||
export TARGET
|
||||
.PHONY: recurse
|
||||
recurse:
|
||||
ifeq "$(TARGET)" "coco"
|
||||
$(MAKE) -C $(DECBFILE_LIB_DIR) $(RECURSION)
|
||||
endif
|
||||
$(MAKE) -C $(CARDGAME_LIB_DIR) $(RECURSION)
|
||||
$(MAKE) -C $(BCONTROL_LIB_DIR) $(RECURSION)
|
||||
|
||||
clean:
|
||||
rm -f loader.bin $(PROG).app $(PROG).o $(OBJ) \
|
||||
$(WIDE_BITMAPS:.bm=.bm.c) \
|
||||
$(SCORE_BITMAPS:.sbm=.sbm.c) \
|
||||
$(GEN_HEADERS) $(GEN_SRC) \
|
||||
unittsts.bin unittsts.o
|
||||
|
||||
distclean: clean
|
||||
rm -f $(SRC:.c=.d)
|
||||
|
||||
.PHONY: dist distcheck
|
||||
dist:
|
||||
$(TAR) -czf $(PACKAGE)-$(VERSION).tar.gz --transform 's,^,$(PACKAGE)-$(VERSION)/,' $(DISTFILES)
|
||||
|
||||
ifeq "$(TARGET)" "coco"
|
||||
|
||||
distcheck: dist
|
||||
mkdir ,distcheck
|
||||
$(TAR) -C ,distcheck -xzf $(PACKAGE)-$(VERSION).tar.gz
|
||||
for x in decbfile cardgame bcontrol; do ln -s ../../../$$x ,distcheck/$(PACKAGE)-$(VERSION)/$$x; done
|
||||
$(MAKE) -C ,distcheck/$(PACKAGE)-$(VERSION) all check
|
||||
rm -fr ,distcheck
|
||||
@echo "SUCCESS: $(PACKAGE)-$(VERSION).tar.gz ready for distribution"
|
||||
|
||||
endif
|
||||
|
||||
DISTFILES = \
|
||||
COPYING \
|
||||
Makefile \
|
||||
loader.c \
|
||||
$(PROG).c \
|
||||
$(NON_GEN_SRC) \
|
||||
$(NON_GEN_HEADERS) \
|
||||
$(WIDE_BITMAPS) \
|
||||
$(SCORE_BITMAPS) \
|
||||
compile-bitmap.pl \
|
||||
convert-title-image.pl \
|
||||
title.xcf \
|
||||
title.xpm \
|
||||
unittsts.c
|
||||
|
||||
.PHONY: sizes
|
||||
sizes: $(PROG).app
|
||||
@$(PERL) -e '$$sz=-s "$(PROG).app"; printf("$(PROG).app loads %u B in \$$%X..\$$%X.\n", $$sz, 0x$(APP_ENTRY), 0x$(APP_ENTRY) + $$sz - 1);'
|
||||
|
||||
# Prerequisites.
|
||||
|
||||
$(CARDGAME_LIB_DIR)/pmode4game.h:
|
||||
@test -f $@ || echo "ERROR: Symlink '$(dir $@)' missing from current directory." && false
|
||||
|
||||
$(BCONTROL_LIB_DIR)/Joystick.h:
|
||||
@test -f $@ || echo "ERROR: Symlink '$(dir $@)' missing from current directory." && false
|
||||
|
||||
$(DECBFILE_LIB_DIR)/runDOSLoader.h:
|
||||
@test -f $@ || echo "ERROR: Symlink '$(dir $@)' missing from current directory." && false
|
||||
|
||||
DEPENDENCY_HEADERS = \
|
||||
$(NON_GEN_HEADERS) $(GEN_HEADERS) \
|
||||
$(CARDGAME_LIB_DIR)/pmode4game.h \
|
||||
$(BCONTROL_LIB_DIR)/Joystick.h
|
||||
|
||||
ifeq "$(TARGET)" "coco"
|
||||
DEPENDENCY_HEADERS += \
|
||||
$(DECBFILE_LIB_DIR)/runDOSLoader.h
|
||||
endif
|
||||
|
||||
$(NON_GEN_OBJ): $(DEPENDENCY_HEADERS)
|
||||
$(GEN_OBJ): $(DEPENDENCY_HEADERS)
|
||||
@@ -0,0 +1,28 @@
|
||||
#ifndef _H_PreShiftedBitmap
|
||||
#define _H_PreShiftedBitmap
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
// A PreShiftedBitmap is always 16 pixels wide.
|
||||
//
|
||||
typedef struct PreShiftedBitmap
|
||||
{
|
||||
byte height; // in pixel rows, non zero
|
||||
|
||||
// Offsets in bytes[].
|
||||
// A PreShiftedBitmap can be only be written horizontal pixel positions
|
||||
// that are even, and less than 240.
|
||||
// This horiz. position is thus equal to {0, 2, 4, 6} modulo 8.
|
||||
// That modulo 8 value is the index into preShiftOffsets[].
|
||||
// The offset obtained this way is an index in bytes[].
|
||||
// At that offset in bytes[], there are six bytes for each row of the bitmap.
|
||||
// The first 3 bytes are mask bytes. The last 3 are image bytes.
|
||||
//
|
||||
word preShiftOffsets[4];
|
||||
|
||||
byte bytes[];
|
||||
} PreShiftedBitmap;
|
||||
|
||||
|
||||
#endif /* _H_PreShiftedBitmap */
|
||||
@@ -0,0 +1,51 @@
|
||||
#include "Score.h"
|
||||
|
||||
#include "util.h"
|
||||
|
||||
|
||||
void
|
||||
Score_init(Score *self)
|
||||
{
|
||||
* (word *) self->digits = 0;
|
||||
}
|
||||
|
||||
|
||||
__gcccall void
|
||||
Score_addPoint(Score *self)
|
||||
{
|
||||
if (Score_isWinningScore(self))
|
||||
return;
|
||||
byte *p = self->digits;
|
||||
if (p[1] == 9)
|
||||
{
|
||||
p[1] = 0;
|
||||
++p[0];
|
||||
}
|
||||
else
|
||||
++p[1];
|
||||
}
|
||||
|
||||
|
||||
__gcccall BOOL asm
|
||||
Score_isWinningScore(const Score *self)
|
||||
{
|
||||
#if 0 /* Original C code. */
|
||||
const byte *p = self->digits;
|
||||
return p[0] == WINNING_SCORE / 10 && p[1] == WINNING_SCORE % 10;
|
||||
#else
|
||||
asm
|
||||
{
|
||||
; X is 'self' b/c __gcccall.
|
||||
ldb ,x ; digits[0], i.e., tens
|
||||
cmpb #WINNING_SCORE/10
|
||||
bne @no
|
||||
ldb 1,x ; digits[1], i.e., units
|
||||
cmpb #WINNING_SCORE%10
|
||||
bne @no
|
||||
ldb #1 ; return TRUE
|
||||
rts
|
||||
@no
|
||||
clrb ; return FALSE
|
||||
}
|
||||
#endif
|
||||
}
|
||||
@@ -0,0 +1,27 @@
|
||||
#ifndef _H_Score
|
||||
#define _H_Score
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
typedef struct Score
|
||||
{
|
||||
byte digits[2];
|
||||
} Score;
|
||||
|
||||
|
||||
void Score_init(Score *self);
|
||||
|
||||
|
||||
// Adds a point to the given Score, unless it has already reached WINNING_SCORE.
|
||||
//
|
||||
__gcccall void Score_addPoint(Score *self);
|
||||
|
||||
|
||||
// Returns TRUE iff this Score is equal to WINNING_SCORE.
|
||||
//
|
||||
__gcccall BOOL Score_isWinningScore(const Score *self);
|
||||
|
||||
|
||||
|
||||
#endif /* _H_Score */
|
||||
@@ -0,0 +1,25 @@
|
||||
#include "Sprite.h"
|
||||
|
||||
#include "PreShiftedBitmap.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
void
|
||||
Sprite_init(Sprite *s, const struct PreShiftedBitmap *bitmap)
|
||||
{
|
||||
assert(s);
|
||||
assert(bitmap);
|
||||
assert(bitmap->height > 0);
|
||||
assert(bitmap->height <= MAX_BITMAP_HEIGHT);
|
||||
|
||||
s->active = TRUE;
|
||||
s->x = 0;
|
||||
s->y = 0;
|
||||
s->dx = 0;
|
||||
s->dy = 0;
|
||||
s->bm = bitmap;
|
||||
s->h = bitmap->height;
|
||||
s->bitmapIndex = 0;
|
||||
s->timeToLive = 0;
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
#ifndef _H_Sprite
|
||||
#define _H_Sprite
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
enum
|
||||
{
|
||||
SPRITE_WIDTH = 16, // in pixels
|
||||
BYTES_PER_BITMAP_ROW = 6,
|
||||
MAX_BITMAP_HEIGHT = 42, // 43*BYTES_PER_BITMAP_ROW would be > 255 and would require MUL168
|
||||
};
|
||||
|
||||
|
||||
typedef struct Sprite
|
||||
{
|
||||
BOOL active;
|
||||
byte x; // horiz. pos. in pixels
|
||||
byte y; // vert. pos. in pixels
|
||||
byte h; // height in pixels (1..MAX_BITMAP_HEIGHT)
|
||||
sbyte dx; // horiz. speed in pixels per frame
|
||||
sbyte dy; // vert. speed in pixels per frame
|
||||
const struct PreShiftedBitmap *bm; // pointer to _bm bitmap def
|
||||
byte bitmapIndex; // useful for animation and to update 'bm'
|
||||
byte timeToLive; // number of frames before this sprite dies
|
||||
} Sprite;
|
||||
|
||||
|
||||
// Initializes the sprite at 's' at position (0, 0),
|
||||
// with speed (0, 0) and makes it use the specified bitmap.
|
||||
// Sets the active field to true.
|
||||
// bitmap: Must NOT be null.
|
||||
//
|
||||
void Sprite_init(Sprite *s, const struct PreShiftedBitmap *bitmap);
|
||||
|
||||
|
||||
#endif /* _H_Sprite */
|
||||
@@ -0,0 +1,16 @@
|
||||
#ifndef _H_ThinBitmap
|
||||
#define _H_ThinBitmap
|
||||
|
||||
#include <coco.h>
|
||||
|
||||
|
||||
// A ThinBitmap is always 8 pixels wide.
|
||||
//
|
||||
typedef struct ThinBitmap
|
||||
{
|
||||
byte height; // in pixel rows
|
||||
byte bytes[]; // only pixel bytes, no mask bytes
|
||||
} ThinBitmap;
|
||||
|
||||
|
||||
#endif /* _H_ThinBitmap */
|
||||
+14
@@ -0,0 +1,14 @@
|
||||
....11111111....
|
||||
....11111111....
|
||||
..111111111111..
|
||||
..111111111111..
|
||||
..111111111111..
|
||||
..111111111111..
|
||||
....11111111....
|
||||
....11111111....
|
||||
......1111......
|
||||
......1111......
|
||||
................
|
||||
......1111......
|
||||
......1111......
|
||||
......1111......
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
....010101......
|
||||
....010101......
|
||||
....010101......
|
||||
..............01
|
||||
0101010101010101
|
||||
0101010101010101
|
||||
0101010101010101
|
||||
................
|
||||
....01..........
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
......01........
|
||||
........01......
|
||||
........01......
|
||||
..0101....01....
|
||||
..010101........
|
||||
..010101........
|
||||
....010101......
|
||||
..01..010101..01
|
||||
........01010101
|
||||
..........0101..
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
........01......
|
||||
........01......
|
||||
....0101..01....
|
||||
....0101..01....
|
||||
......0101..01..
|
||||
......0101..01..
|
||||
....01..0101....
|
||||
....01..0101....
|
||||
..........010101
|
||||
..........010101
|
||||
............01..
|
||||
............01..
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
....01....01....
|
||||
....0101..01....
|
||||
....0101..01....
|
||||
....0101....01..
|
||||
..01..0101..01..
|
||||
......0101..01..
|
||||
......0101..01..
|
||||
......0101......
|
||||
........01......
|
||||
........0101....
|
||||
........0101....
|
||||
........0101....
|
||||
..........010101
|
||||
..........0101..
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
..........01....
|
||||
..........01....
|
||||
......01..01..01
|
||||
......01..01..01
|
||||
..........01..01
|
||||
..........01..01
|
||||
..........01..01
|
||||
..........01..01
|
||||
..........01..01
|
||||
..........01..01
|
||||
..........01....
|
||||
..........01....
|
||||
..........01....
|
||||
..........01....
|
||||
..........0101..
|
||||
..........0101..
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
..........01....
|
||||
........0101....
|
||||
........0101....
|
||||
........0101..01
|
||||
....01..0101..01
|
||||
......0101..01..
|
||||
......0101..01..
|
||||
......01....01..
|
||||
....0101........
|
||||
....0101........
|
||||
..01010101......
|
||||
..01010101......
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
........01..01..
|
||||
........01..01..
|
||||
..........0101..
|
||||
..........0101..
|
||||
........0101..01
|
||||
........0101..01
|
||||
......0101..01..
|
||||
......0101..01..
|
||||
......0101..01..
|
||||
....0101..01....
|
||||
....0101..01....
|
||||
......01........
|
||||
......01........
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
....01..0101....
|
||||
......010101....
|
||||
....010101....01
|
||||
..010101....01..
|
||||
010101....01....
|
||||
0101............
|
||||
..0101..........
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
..........01....
|
||||
................
|
||||
0101010101010101
|
||||
0101010101010101
|
||||
0101010101010101
|
||||
01..............
|
||||
......010101....
|
||||
......010101....
|
||||
......010101....
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
....0101........
|
||||
..01010101......
|
||||
..01..010101..01
|
||||
........010101..
|
||||
..........010101
|
||||
..........010101
|
||||
......01....0101
|
||||
........01......
|
||||
..........01....
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
......01........
|
||||
......01........
|
||||
....010101......
|
||||
....010101......
|
||||
........0101..01
|
||||
........0101..01
|
||||
......01..0101..
|
||||
......01..0101..
|
||||
........01..0101
|
||||
........01..0101
|
||||
..........01....
|
||||
..........01....
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
....0101........
|
||||
..010101........
|
||||
......0101......
|
||||
......0101......
|
||||
........01......
|
||||
........0101....
|
||||
....01..0101....
|
||||
....01..0101..01
|
||||
....01....0101..
|
||||
......01..0101..
|
||||
......01..0101..
|
||||
......01....01..
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
........0101....
|
||||
........0101....
|
||||
..........01....
|
||||
..........01....
|
||||
..........01....
|
||||
..........01....
|
||||
......01..01....
|
||||
......01..01....
|
||||
......01..01....
|
||||
......01..01....
|
||||
......01..01....
|
||||
......01..01....
|
||||
......01..01..01
|
||||
......01..01..01
|
||||
..........01....
|
||||
..........01....
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
........01010101
|
||||
........01010101
|
||||
..........0101..
|
||||
..........0101..
|
||||
....01....01....
|
||||
....01..0101....
|
||||
....01..0101....
|
||||
..01..0101..01..
|
||||
..01..0101......
|
||||
......0101......
|
||||
......01........
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
............01..
|
||||
............01..
|
||||
........01..0101
|
||||
........01..0101
|
||||
......01..0101..
|
||||
......01..0101..
|
||||
....01..0101....
|
||||
....01..0101....
|
||||
......0101......
|
||||
......0101......
|
||||
......01..01....
|
||||
......01..01....
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
..........0101..
|
||||
............0101
|
||||
....01....010101
|
||||
..01....010101..
|
||||
01....010101....
|
||||
....010101......
|
||||
....0101..01....
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
......101010....
|
||||
......101010....
|
||||
......101010....
|
||||
10..............
|
||||
1010101010101010
|
||||
1010101010101010
|
||||
1010101010101010
|
||||
................
|
||||
..........10....
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
........10......
|
||||
......10........
|
||||
......10........
|
||||
....10....1010..
|
||||
........101010..
|
||||
........101010..
|
||||
......101010....
|
||||
10..101010..10..
|
||||
10101010........
|
||||
..1010..........
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
......10........
|
||||
......10........
|
||||
....10..1010....
|
||||
....10..1010....
|
||||
..10..1010......
|
||||
..10..1010......
|
||||
....1010..10....
|
||||
....1010..10....
|
||||
101010..........
|
||||
101010..........
|
||||
..10............
|
||||
..10............
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
....10....10....
|
||||
....10..1010....
|
||||
....10..1010....
|
||||
..10....1010....
|
||||
..10..1010..10..
|
||||
..10..1010......
|
||||
..10..1010......
|
||||
......1010......
|
||||
......10........
|
||||
....1010........
|
||||
....1010........
|
||||
....1010........
|
||||
101010..........
|
||||
..1010..........
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
....10..........
|
||||
....10..........
|
||||
10..10..10......
|
||||
10..10..10......
|
||||
10..10..........
|
||||
10..10..........
|
||||
10..10..........
|
||||
10..10..........
|
||||
10..10..........
|
||||
10..10..........
|
||||
....10..........
|
||||
....10..........
|
||||
....10..........
|
||||
....10..........
|
||||
..1010..........
|
||||
..1010..........
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
....10..........
|
||||
....1010........
|
||||
....1010........
|
||||
10..1010........
|
||||
10..1010..10....
|
||||
..10..1010......
|
||||
..10..1010......
|
||||
..10....10......
|
||||
........1010....
|
||||
........1010....
|
||||
......10101010..
|
||||
......10101010..
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
..10..10........
|
||||
..10..10........
|
||||
..1010..........
|
||||
..1010..........
|
||||
10..1010........
|
||||
10..1010........
|
||||
..10..1010......
|
||||
..10..1010......
|
||||
..10..1010......
|
||||
....10..1010....
|
||||
....10..1010....
|
||||
........10......
|
||||
........10......
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
....1010..10....
|
||||
....101010......
|
||||
10....101010....
|
||||
..10....101010..
|
||||
....10....101010
|
||||
............1010
|
||||
..........1010..
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
....10..........
|
||||
................
|
||||
1010101010101010
|
||||
1010101010101010
|
||||
1010101010101010
|
||||
..............10
|
||||
....101010......
|
||||
....101010......
|
||||
....101010......
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
........1010....
|
||||
......10101010..
|
||||
10..101010..10..
|
||||
..101010........
|
||||
101010..........
|
||||
101010..........
|
||||
1010....10......
|
||||
......10........
|
||||
....10..........
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
........10......
|
||||
........10......
|
||||
......101010....
|
||||
......101010....
|
||||
10..1010........
|
||||
10..1010........
|
||||
..1010..10......
|
||||
..1010..10......
|
||||
1010..10........
|
||||
1010..10........
|
||||
....10..........
|
||||
....10..........
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
........1010....
|
||||
........101010..
|
||||
......1010......
|
||||
......1010......
|
||||
......10........
|
||||
....1010........
|
||||
....1010..10....
|
||||
10..1010..10....
|
||||
..1010....10....
|
||||
..1010..10......
|
||||
..1010..10......
|
||||
..10....10......
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
....1010........
|
||||
....1010........
|
||||
....10..........
|
||||
....10..........
|
||||
....10..........
|
||||
....10..........
|
||||
....10..10......
|
||||
....10..10......
|
||||
....10..10......
|
||||
....10..10......
|
||||
....10..10......
|
||||
....10..10......
|
||||
10..10..10......
|
||||
10..10..10......
|
||||
....10..........
|
||||
....10..........
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
10101010........
|
||||
10101010........
|
||||
..1010..........
|
||||
..1010..........
|
||||
....10....10....
|
||||
....1010..10....
|
||||
....1010..10....
|
||||
..10..1010..10..
|
||||
......1010..10..
|
||||
......1010......
|
||||
........10......
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
..10............
|
||||
..10............
|
||||
1010..10........
|
||||
1010..10........
|
||||
..1010..10......
|
||||
..1010..10......
|
||||
....1010..10....
|
||||
....1010..10....
|
||||
......1010......
|
||||
......1010......
|
||||
....10..10......
|
||||
....10..10......
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,16 @@
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
..1010..........
|
||||
1010............
|
||||
101010....10....
|
||||
..101010....10..
|
||||
....101010....10
|
||||
......101010....
|
||||
....10..1010....
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
................
|
||||
@@ -0,0 +1,13 @@
|
||||
............1111
|
||||
....1111..111111
|
||||
..11111111111111
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
..11111111111111
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
..11111111111111
|
||||
....1111..111111
|
||||
............1111
|
||||
@@ -0,0 +1,13 @@
|
||||
1111............
|
||||
111111..1111....
|
||||
11111111111111..
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
11111111111111..
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
1111111111111111
|
||||
11111111111111..
|
||||
111111..1111....
|
||||
1111............
|
||||
+2698
File diff suppressed because it is too large.
Load diff
Executable
+314
@@ -0,0 +1,314 @@
|
||||
#!/usr/bin/perl -w
|
||||
#
|
||||
# .bm file format:
|
||||
# Leading spaces on a line are ignored.
|
||||
# Lines that start with '#' are ignored.
|
||||
# Pixel lines must contain '.', '0' or '1' characters.
|
||||
# Those lines must have a length that is a multiple of 8.
|
||||
# All pixel lines must have the same length.
|
||||
# '.' means a transparent pixel.
|
||||
# '0' and '1' mean a black or white pixel.
|
||||
|
||||
|
||||
use strict;
|
||||
use Getopt::Long;
|
||||
use File::Basename;
|
||||
|
||||
|
||||
my $program = basename($0);
|
||||
my $version = "0.0.0";
|
||||
my $numErrors = 0;
|
||||
my $numWarnings = 0;
|
||||
my $dryRun = 0;
|
||||
my $verbose = 0;
|
||||
my $format = "c"; # or "raw"
|
||||
|
||||
|
||||
sub usage
|
||||
{
|
||||
my ($exitStatus) = @_;
|
||||
|
||||
print <<__EOF__;
|
||||
$program $version
|
||||
Copyright (C) 2013 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
Usage: $program [OPTIONS] foo.bm > foo.bm.c
|
||||
|
||||
Options:
|
||||
--help Print this help page.
|
||||
--version Print this program's name and version number.
|
||||
--not-really Only show what would happen, do not do it for real.
|
||||
--verbose Print more details of what is happening.
|
||||
--format=F Use the F format (c or raw; default is c).
|
||||
|
||||
__EOF__
|
||||
|
||||
exit($exitStatus);
|
||||
}
|
||||
|
||||
|
||||
sub errmsg
|
||||
{
|
||||
print STDERR "$program: ERROR: ";
|
||||
printf STDERR @_;
|
||||
print STDERR "\n";
|
||||
|
||||
++$numErrors;
|
||||
}
|
||||
|
||||
|
||||
sub warnmsg
|
||||
{
|
||||
print STDERR "$program: Warning: ";
|
||||
printf STDERR @_;
|
||||
print STDERR "\n";
|
||||
|
||||
++$numWarnings;
|
||||
}
|
||||
|
||||
|
||||
# Receives a string of 8 characters in {'.', '0', '1'}.
|
||||
# Returns ($mask, $image), where $mask is the numerical value
|
||||
# of the mask byte, and $image is the numerical value of the
|
||||
# image bits to be put on the screen.
|
||||
#
|
||||
sub processByte($)
|
||||
{
|
||||
my ($bits) = @_;
|
||||
die unless length($bits) == 8;
|
||||
|
||||
my $image = 0;
|
||||
my $mask = 0;
|
||||
|
||||
for (my $i = 0; $i < 8; ++$i)
|
||||
{
|
||||
my $ch = substr($bits, $i, 1);
|
||||
#print "$ch ";
|
||||
my ($imageBit, $maskBit);
|
||||
if ($ch eq '0')
|
||||
{
|
||||
$imageBit = 0;
|
||||
$maskBit = 0;
|
||||
}
|
||||
elsif ($ch eq '1')
|
||||
{
|
||||
$imageBit = 1;
|
||||
$maskBit = 0;
|
||||
}
|
||||
elsif ($ch eq '.') # transparent
|
||||
{
|
||||
$imageBit = 0;
|
||||
$maskBit = 1; # keep bit from screen
|
||||
}
|
||||
|
||||
$image = ($image << 1) | $imageBit;
|
||||
$mask = ($mask << 1) | $maskBit;
|
||||
}
|
||||
|
||||
#printf(" image=0x%02x, mask=0x%02x\n", $image, $mask);
|
||||
|
||||
return ($mask, $image);
|
||||
}
|
||||
|
||||
|
||||
# Converts a numerical values into a string of zeroes and ones.
|
||||
# $sizeInBytes indicates the width in bytes of $numValue.
|
||||
#
|
||||
sub toBits($$)
|
||||
{
|
||||
my ($numValue, $sizeInBytes) = @_;
|
||||
|
||||
my $str = "";
|
||||
while ($sizeInBytes--)
|
||||
{
|
||||
for (my $i = 8; $i--; $numValue >>= 1)
|
||||
{
|
||||
$str = chr(48 + ($numValue & 1)) . $str;
|
||||
}
|
||||
}
|
||||
|
||||
return $str;
|
||||
}
|
||||
|
||||
|
||||
#die unless toBits(42, 1) eq "00101010";
|
||||
#die unless toBits(513, 2) eq "0000001000000001";
|
||||
|
||||
|
||||
sub generateShiftedCFormat($$$$)
|
||||
{
|
||||
my ($bitmapName, $widthInBits, $height, $raBytes) = @_;
|
||||
|
||||
die "max supported height is 42" unless $height <= 42;
|
||||
|
||||
my $cFile = \*STDOUT;
|
||||
|
||||
print $cFile "/* $bitmapName */\n";
|
||||
|
||||
if ($widthInBits == 16)
|
||||
{
|
||||
printf $cFile qq{#include "PreShiftedBitmap.h"\n};
|
||||
printf $cFile qq{#include "util.h"\n};
|
||||
#printf $cFile "enum { PIXMAP_HEIGHT_%s = %u };\n", $bitmapName, $height;
|
||||
#printf $cFile "/* Size in bytes: %u. */\n", 4 * $height * 6;
|
||||
print $cFile "const PreShiftedBitmap $bitmapName =\n{\n";
|
||||
print $cFile " $height, /* height in pixels rows */\n";
|
||||
print $cFile " { ", join(", ", 0, $height * 6, $height * 6 * 2, $height * 6 * 3,), " }, /* preShiftOffsets */\n";
|
||||
print $cFile " {\n";
|
||||
#print $cFile "{ /* array of 4 pre-shifted bitmaps: */\n";
|
||||
for (my $shift = 0; $shift <= 6; $shift += 2)
|
||||
{
|
||||
print $cFile " /* [", $shift / 2 , "]: pre-shifted right by $shift bit(s): */\n";
|
||||
print $cFile " /* ------------- Masks -------------- ------------- Images ------------- */\n";
|
||||
#print $cFile " /* array of $height pixel rows: */\n";
|
||||
#
|
||||
# Usage on 6809:
|
||||
# ldd ,x ; load word from screen
|
||||
# anda ,u ; AND with high byte of mask word
|
||||
# andb 1,u ; AND with middle byte of mask word
|
||||
# ora 3,u ; OR in the high byte of the image word
|
||||
# orb 4,u ; OR in the middle byte of the image word
|
||||
# std ,x ; store word to screen
|
||||
# lda 2,x ; load folloing byte from screen
|
||||
# anda 2,u ; AND with low byte of mask word
|
||||
# ora 5,u ; OR in the low byte of the image word
|
||||
# sta 2,x ; store byte to screen
|
||||
#
|
||||
my $pixelRow = 0;
|
||||
for (my $i = 0; $i < @$raBytes; $i += 4, ++$pixelRow)
|
||||
{
|
||||
printf $cFile " /* \$raBytes->[%u..%u] = (0x%02x, 0x%02x, 0x%02x, 0x%02x) */\n",
|
||||
$i, $i + 3,
|
||||
$raBytes->[$i], $raBytes->[$i + 1], $raBytes->[$i + 2], $raBytes->[$i + 3];
|
||||
my $mask = ($raBytes->[$i ] << 8) | $raBytes->[$i + 2];
|
||||
my $image = ($raBytes->[$i + 1] << 8) | $raBytes->[$i + 3];
|
||||
$mask <<= 8 - $shift;
|
||||
$mask |= ~(0xFF >> $shift) << 16; # transparency at left of 16-bit image
|
||||
$mask |= 0xFF >> $shift; # transparency at right of 16-bit image
|
||||
$image <<= 8 - $shift;
|
||||
printf $cFile " /* row %2u: 0x%06x, 0x%06x */ 0b%s, 0b%s, 0b%s, 0b%s, 0b%s, 0b%s,\n",
|
||||
$pixelRow, $mask, $image,
|
||||
toBits($mask >> 16, 1),
|
||||
toBits(($mask >> 8) & 0xFF, 1),
|
||||
toBits($mask & 0xFF, 1),
|
||||
toBits($image >> 16, 1),
|
||||
toBits(($image >> 8) & 0xFF, 1),
|
||||
toBits($image & 0xFF, 1);
|
||||
}
|
||||
die unless $pixelRow == $height;
|
||||
#print $cFile " /* end of array of $height pixel rows */\n";
|
||||
}
|
||||
#print $cFile "/* end of array of 4 pre-shifted bitmaps */\n";
|
||||
print $cFile " }\n";
|
||||
print $cFile "};\n";
|
||||
}
|
||||
else
|
||||
{
|
||||
die "unsupported width $widthInBits";
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
sub work
|
||||
{
|
||||
my ($bitmapName) = @_;
|
||||
|
||||
my $width; # in pixels
|
||||
my $height = 0;
|
||||
my @bytes;
|
||||
|
||||
while (<>) # for each line in the .bm format
|
||||
{
|
||||
s/\R$//;
|
||||
next if /^\s*#/; # ignore comment line
|
||||
|
||||
if (length($_) % 8 != 0)
|
||||
{
|
||||
errmsg("length of line $. is not a multiple of 8");
|
||||
next;
|
||||
}
|
||||
|
||||
if (! /^[01\.]+$/)
|
||||
{
|
||||
errmsg("illegal characters in line $.");
|
||||
next;
|
||||
}
|
||||
|
||||
if (!defined $width)
|
||||
{
|
||||
$width = length($_);
|
||||
}
|
||||
elsif (length($_) != $width)
|
||||
{
|
||||
errmsg("line $. is not the same length as the first line");
|
||||
}
|
||||
|
||||
#print "line: $_\n";
|
||||
while (s/^(.{8})//) # for each 8 chars
|
||||
{
|
||||
push @bytes, processByte($1);
|
||||
}
|
||||
|
||||
++$height;
|
||||
}
|
||||
|
||||
return if $numErrors;
|
||||
|
||||
#print "\tfcb\t$width,$height\n";
|
||||
#my @hex = map { sprintf("\$%02X", $_) } @bytes;
|
||||
#my $fcb = join(",", @hex);
|
||||
#print "\tfcb\t$fcb\n";
|
||||
|
||||
if ($format eq "raw")
|
||||
{
|
||||
print pack("C*", $width / 8, $height, @bytes);
|
||||
}
|
||||
elsif ($format eq "c")
|
||||
{
|
||||
print qq!#include "ThinBitmap.h"\n!;
|
||||
print qq!const ThinBitmap $bitmapName = !;
|
||||
printf("{ %u, {\n", $height);
|
||||
my $i = 0;
|
||||
for my $b (@bytes)
|
||||
{
|
||||
printf(" 0x%02x,", $b) if $i % 2 == 1; # mask bytes not needed
|
||||
++$i;
|
||||
printf("\n") if $i % 8 == 0;
|
||||
}
|
||||
printf("}};\n");
|
||||
}
|
||||
elsif ($format eq "shiftedc")
|
||||
{
|
||||
generateShiftedCFormat($bitmapName, $width, $height, \@bytes);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
###############################################################################
|
||||
|
||||
|
||||
my $showUsage = 0;
|
||||
|
||||
if (!GetOptions(
|
||||
"help" => \$showUsage,
|
||||
"version" => \$showUsage,
|
||||
"not-really" => \$dryRun,
|
||||
"verbose" => \$verbose,
|
||||
"format=s" => \$format,
|
||||
))
|
||||
{
|
||||
exit 1;
|
||||
}
|
||||
|
||||
usage(0) if $showUsage;
|
||||
die unless @ARGV == 1;
|
||||
|
||||
my $bitmapName = $ARGV[0];
|
||||
$bitmapName =~ s/\.s?bm$/_bm/;
|
||||
|
||||
$| = 1; # no buffering on STDOUT
|
||||
|
||||
work($bitmapName);
|
||||
|
||||
#print "$program: $numErrors error(s), $numWarnings warnings(s).\n";
|
||||
exit($numErrors > 0);
|
||||
+89
@@ -0,0 +1,89 @@
|
||||
/* constants.h
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#ifndef _H_constants
|
||||
#define _H_constants
|
||||
|
||||
|
||||
enum
|
||||
{
|
||||
// PMODE 4 constants.
|
||||
PMODE = 4,
|
||||
PMODE4_SAMV_VALUE = 6, // value for the 3-bit SAM V register (display mode control register)
|
||||
page0 = 7, // first PMODE 4 screen (for 7-bit SAM F register value, i.e., buffer address / 512)
|
||||
page1 = 19, // second PMODE 4 screen
|
||||
grbuf0 = page0 * 512, // address of 1st screen
|
||||
grbuf1 = page1 * 512, // address of 2nd screen
|
||||
PIXELS_PER_BYTE = 8,
|
||||
BYTES_PER_ROW = 32,
|
||||
COLS_PER_SCREEN = 256,
|
||||
ROWS_PER_SCREEN = 192,
|
||||
VIDRAM = 0x0400, // location of Basic's 32x16 text screen
|
||||
TEXT_SCREEN_SIZE_IN_BYTES = 512, // 32x16 screen
|
||||
PALETREG = 0xFFB0, // CoCo 3 color palette register (16 bytes)
|
||||
|
||||
STACK_BOTTOM = grbuf0,
|
||||
RSTFLG = 0x0071, // reset flag used by Color Basic upon warm start
|
||||
RSTVEC = 0x0072, // where Color Basic jumps upon warm start
|
||||
WARM_START_ENTRY_POINT = 0x0074, // this game's warm start routine
|
||||
COCO12_INTR_VECTORS = 0x0100, // 18-byte region containing CoCo 1/2 interrupt vectors
|
||||
RAM_END = 0xFEEE, // first byte NOT part of usable RAM (interrupt vectors on CoCo 3)
|
||||
COCO3_FIRST_CODE_MMU_BLOCK = 0x30, // up to 6 blocks from this one receive .app file
|
||||
|
||||
// Version of BYTES_PER_SCREEN that can be used in an EQU directive
|
||||
// in an inline asm block. BYTES_PER_SCREEN is a #define, which the
|
||||
// C preprocessor expands with an additional trailing space, which causes
|
||||
// the EQU expression to become incomplete and get the wrong numerical value.
|
||||
//
|
||||
BYTES_PER_SCREEN_ = 6144,
|
||||
|
||||
// Game constants.
|
||||
VSYNCS_PER_FLIP = 3,
|
||||
START_PROMPT_COL = (32 - 20) / 2, // column (0..31) in the 32x24 cardgame text screen
|
||||
START_PROMPT_ROW = 17, // row (0..23) in the 32x24 cardgame text screen
|
||||
WRAPPED_TEXT_LEFT_MARGIN = 1,
|
||||
DIGIT_WIDTH = 8, // width in pixels of the digit pixmaps (digit0_bm, etc.)
|
||||
DIGIT_HEIGHT = 5, // height in pixels
|
||||
THIN_BITMAP_Y_POS = ROWS_PER_SCREEN - 1 - DIGIT_HEIGHT,
|
||||
SCORE_WIDTH = 9,
|
||||
TOWER_WIDTH = 16,
|
||||
TOWER_HEIGHT = 17,
|
||||
TOWER_LEFT_X = (COLS_PER_SCREEN - TOWER_WIDTH) / 2,
|
||||
TOWER_TOP_Y = ROWS_PER_SCREEN - TOWER_HEIGHT,
|
||||
MAX_EXPLOSIONS = 3,
|
||||
FRAMES_PER_EXPLOSION = 40, // duration of an explosion animation
|
||||
MAX_BULLETS_PER_PLANE = 2,
|
||||
FRAMES_PER_SHORT_RANGE_BULLET = 10,
|
||||
FRAMES_PER_LONG_RANGE_BULLET = 20,
|
||||
BULLET_MARGIN = 6,
|
||||
BULLET_WIDTH = 4,
|
||||
BALLOON_HEIGHT = 14, // see balloon.bm
|
||||
MIN_BALLOON_TAKE_OFF_TIME = 5 * 20, // min number of frames
|
||||
MAX_BALLOON_TAKE_OFF_TIME = 45 * 20, // max number of frames
|
||||
FRAMES_PER_BALLON_DIR_CHANGE = 1,
|
||||
WINNING_SCORE = 15,
|
||||
MAX_CLOUDS = 2,
|
||||
|
||||
// Speeds in pixels per frame. Horizontal speeds must all be even numbers.
|
||||
|
||||
// Misc.
|
||||
BREAK_KEY = 3, // ASCII code of Break key
|
||||
INVERTED_COLOR_TOGGLE_CHAR = '^', // re: printWrapped()
|
||||
};
|
||||
|
||||
|
||||
#endif /* _H_constants */
|
||||
Executable
+51
@@ -0,0 +1,51 @@
|
||||
#!/usr/bin/perl -w
|
||||
#
|
||||
# Converts a 128x14 2-color XPM to a C file containing an array
|
||||
# of 32-bit values.
|
||||
|
||||
use strict;
|
||||
|
||||
|
||||
my $blackColorCode;
|
||||
my $whiteColorCode;
|
||||
my $numPixelRows = 0;
|
||||
|
||||
|
||||
print "#include <coco.h>\n";
|
||||
print "const uint32_t titleBitmap[14][8] =\n{\n";
|
||||
|
||||
|
||||
while (<>)
|
||||
{
|
||||
if (/"(.)\s+c\s+#000000"/i) # if black color code line
|
||||
{
|
||||
$blackColorCode = $1;
|
||||
}
|
||||
elsif (/"(.)\s+c\s+#FFFFFF"/i) # if white color code line
|
||||
{
|
||||
$whiteColorCode = $1;
|
||||
}
|
||||
elsif (defined $blackColorCode && defined $whiteColorCode && /"(.*?)"/) # if pixel row
|
||||
{
|
||||
# Only keep the pixels.
|
||||
$_ = $1;
|
||||
die unless length($_) == 128;
|
||||
++$numPixelRows;
|
||||
|
||||
# Change the two codes to 0 and 1.
|
||||
s/\Q$blackColorCode\E/0/g;
|
||||
s/\Q$whiteColorCode\E/1/g;
|
||||
|
||||
# Double each pixel horizontally.
|
||||
s/([01])/$1$1/g;
|
||||
|
||||
# Group strings of 32 bits into a hex value.
|
||||
s/([01]{32})/ sprintf("0x%08x, ", eval "0b$1") /ge;
|
||||
|
||||
print " { $_},\n";
|
||||
}
|
||||
}
|
||||
|
||||
print "};\n";
|
||||
|
||||
die unless $numPixelRows == 14;
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00110011
|
||||
00110011
|
||||
00110011
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00111100
|
||||
00001100
|
||||
00001100
|
||||
00001100
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00000011
|
||||
00111111
|
||||
00110000
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00000011
|
||||
00111111
|
||||
00000011
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00110011
|
||||
00110011
|
||||
00111111
|
||||
00000011
|
||||
00000011
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00110000
|
||||
00111111
|
||||
00000011
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00110000
|
||||
00111111
|
||||
00110011
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00000011
|
||||
00000011
|
||||
00000011
|
||||
00000011
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00110011
|
||||
00111111
|
||||
00110011
|
||||
00111111
|
||||
@@ -0,0 +1,5 @@
|
||||
00111111
|
||||
00110011
|
||||
00111111
|
||||
00000011
|
||||
00111111
|
||||
@@ -0,0 +1,16 @@
|
||||
# 0 = black
|
||||
# 1 = white
|
||||
# . = transparent
|
||||
#
|
||||
....11001100....
|
||||
..110011001100..
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
..001100110011..
|
||||
....00110011....
|
||||
@@ -0,0 +1,16 @@
|
||||
# 0 = black
|
||||
# 1 = white
|
||||
# . = transparent
|
||||
#
|
||||
....00110011....
|
||||
..001100110011..
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
0011001100110011
|
||||
1100110011001100
|
||||
..110011001100..
|
||||
....11001100....
|
||||
@@ -0,0 +1,275 @@
|
||||
/* loader.c - DOS-loaded tool that loads a program in CoCo memory and executes it.
|
||||
By Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
This file is in the public domain.
|
||||
|
||||
This loader calls decbfile's decbfile_runDOSLoader() to load EXECUTABLE_FILENAME
|
||||
from drive 0 to address CLIENT_PROGRAM_START, then jumps to that address.
|
||||
See decbfile_runDOSLoader() for details.
|
||||
*/
|
||||
|
||||
#ifdef _COCO_BASIC_
|
||||
#include "runDOSLoader.h" /* decbfile */
|
||||
#else
|
||||
#include <coco.h>
|
||||
#endif
|
||||
|
||||
#include "constants.h"
|
||||
|
||||
|
||||
byte *textScreenCursor = VIDRAM;
|
||||
|
||||
|
||||
// 32x16 character output routine.
|
||||
// Called with a ASCII code in A. Can be used by printf(), putchar() and putstr().
|
||||
// A newline is expected to be represented in A with character 13.
|
||||
// Does not support other control characters, inclding backspace.
|
||||
// Does not scroll the screen when the writing position reaches the end.
|
||||
// Preserves U, X and B. Trashes A.
|
||||
//
|
||||
static asm __norts__ void
|
||||
consoleOutHook(void)
|
||||
{
|
||||
asm
|
||||
{
|
||||
pshs x ; preserve registers used by this routine, except A
|
||||
cmpa #13
|
||||
beq @newline
|
||||
; Convert A from ASCII to 6847.
|
||||
cmpa #$20
|
||||
blo @converted
|
||||
cmpa #$40
|
||||
blo @add0x40
|
||||
cmpa #$60
|
||||
blo @converted
|
||||
cmpa #$80
|
||||
bhs @converted ; graphics code
|
||||
suba #$60 ; 0x60..0x7F: lower-case letters
|
||||
bra @converted
|
||||
@add0x40
|
||||
adda #$40
|
||||
@converted
|
||||
sta [:textScreenCursor]
|
||||
; Advance cursor.
|
||||
ldx :textScreenCursor
|
||||
cmpx #VIDRAM+TEXT_SCREEN_SIZE_IN_BYTES-1
|
||||
bhs @noAdvance
|
||||
leax 1,x
|
||||
stx :textScreenCursor
|
||||
@noAdvance
|
||||
puls x,pc
|
||||
;
|
||||
@newline
|
||||
pshs b
|
||||
ldb :textScreenCursor[1] ; LSB of pointer
|
||||
andb #$1F ; modulo 32
|
||||
subb #32
|
||||
negb ; number of spaces to write
|
||||
beq @newlineDone
|
||||
lda #$60 ; space char on 6847
|
||||
ldx :textScreenCursor
|
||||
@newlineLoop
|
||||
sta ,x+
|
||||
decb
|
||||
bne @newlineLoop
|
||||
cmpx #VIDRAM+TEXT_SCREEN_SIZE_IN_BYTES ; beyond end of screen?
|
||||
blo @storeX
|
||||
leax -32,x ; back to start of last row
|
||||
@storeX
|
||||
stx :textScreenCursor
|
||||
@newlineDone
|
||||
puls b,x,pc
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
asm __norts__ void
|
||||
printChar(char c)
|
||||
{
|
||||
asm
|
||||
{
|
||||
lda 3,s ; c
|
||||
lbra consoleOutHook
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
// str: C string.
|
||||
//
|
||||
void
|
||||
printStr(const char *str)
|
||||
{
|
||||
asm
|
||||
{
|
||||
ldx :str
|
||||
bra @cond
|
||||
@loop
|
||||
cmpa #10
|
||||
bne @putchar
|
||||
lda #13
|
||||
@putchar
|
||||
lbsr consoleOutHook
|
||||
@cond
|
||||
lda ,x+
|
||||
bne @loop
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
// Calls printStr() to print an alternating sequence of strings and integers
|
||||
// of type 'unsigned'.
|
||||
// The first argument must be the number of integers passed (NOT the total
|
||||
// number of arguments).
|
||||
// The last argument must be a character pointer.
|
||||
// The integers are printed in decimal.
|
||||
// Example: printStrUInts(2, "GOT ", x, " APPLE(S) AND ", y, " ORANGE(S).");
|
||||
//
|
||||
void
|
||||
printStrUInts(byte numIntegers, const char *firstString, ...)
|
||||
{
|
||||
va_list ap;
|
||||
va_start(ap, firstString);
|
||||
|
||||
printStr(firstString);
|
||||
|
||||
for (byte i = numIntegers; i--; )
|
||||
{
|
||||
unsigned n = va_arg(ap, unsigned);
|
||||
const char *s = va_arg(ap, const char *);
|
||||
char temp[11];
|
||||
utoa(n, temp, 10);
|
||||
printStr(temp);
|
||||
printStr(s);
|
||||
}
|
||||
|
||||
va_end(ap);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
printStrNoTrailingSpaces(const char *src, byte size)
|
||||
{
|
||||
while (size > 0 && src[size - 1] == ' ')
|
||||
--size;
|
||||
while (size--)
|
||||
printChar(*src++);
|
||||
}
|
||||
|
||||
|
||||
#ifndef CLIENT_PROGRAM_START /* where this loader loads the .BIN file (see doc) */
|
||||
#error Makefile must define CLIENT_PROGRAM_START
|
||||
#endif
|
||||
|
||||
#ifndef EXECUTABLE_FILENAME
|
||||
#error EXECUTABLE_FILENAME not defined
|
||||
#endif
|
||||
|
||||
|
||||
static void
|
||||
printExecutableFilename(void)
|
||||
{
|
||||
printStrNoTrailingSpaces(EXECUTABLE_FILENAME, 8);
|
||||
printStr(".");
|
||||
printStrNoTrailingSpaces(EXECUTABLE_FILENAME + 8, 3);
|
||||
}
|
||||
|
||||
|
||||
static void
|
||||
loadStartCallback(size_t numSteps)
|
||||
{
|
||||
printStr("LOADING ");
|
||||
printExecutableFilename();
|
||||
printStr("...\n");
|
||||
|
||||
// Print a char for each sector to load. Will serve as a progress indicator.
|
||||
byte *cursorBeforeProgressBar = textScreenCursor;
|
||||
for ( ; numSteps--; )
|
||||
printChar('.');
|
||||
textScreenCursor = cursorBeforeProgressBar; // back to start of progress bar
|
||||
}
|
||||
|
||||
|
||||
static void
|
||||
progressCallback(void)
|
||||
{
|
||||
printChar('+');
|
||||
}
|
||||
|
||||
|
||||
enum
|
||||
{
|
||||
BLK = COCO3_FIRST_CODE_MMU_BLOCK, // abbreviation
|
||||
};
|
||||
|
||||
|
||||
// The stack is assumed to be at or below $03D7, the LINE INPUT buffer.
|
||||
// On a CoCo 3, that allows this function to tune in alternate MMU blocks
|
||||
// at $6000..$7FFF, where register S pointed into when main() was jumped into
|
||||
// by the DOS command.
|
||||
//
|
||||
// Interrupts are assumed to be masked.
|
||||
//
|
||||
int
|
||||
mainWithNewStackSpace(void)
|
||||
{
|
||||
width(32); // uses Color Basic routine
|
||||
cls(255); // uses Color Basic routine
|
||||
rgb();
|
||||
|
||||
// On a CoCo 3, tune in alternate MMU blocks from $4000 to $FFEF.
|
||||
// (This does nothing on a CoCo 1 or 2.)
|
||||
// decbfile_runDOSLoader() will load the .app file into blocks 48..53.
|
||||
// Without this, the code would be loaded to blocks 58..63, and when
|
||||
// the user will press Reset, SECB will copy itself from ROM to those
|
||||
// pages, thereby overwriting and corrupting the .app code.
|
||||
//
|
||||
// Instead, we load the code to alternate pages, and the warm start
|
||||
// routine in warmStartRoutine[] (see coco-planes.c) will tune in
|
||||
// those pages when Reset is pressed.
|
||||
//
|
||||
* (word *) 0xFFA2 = ((BLK + 0) << 8) | (BLK + 1);
|
||||
* (word *) 0xFFA4 = ((BLK + 2) << 8) | (BLK + 3);
|
||||
* (word *) 0xFFA6 = ((BLK + 4) << 8) | (BLK + 5);
|
||||
|
||||
printStr("ACCESSING DRIVE 0...\n");
|
||||
byte errorCode =
|
||||
#ifdef _COCO_BASIC_
|
||||
decbfile_runDOSLoader( // this call puts CoCo in all-RAM mode
|
||||
(void *) 0x0600, // DECB work space, right after 32x16 screen
|
||||
(void *) 0x2600, // track 34 loaded by DOS command
|
||||
RAM_END, // new stack bottom
|
||||
EXECUTABLE_FILENAME, // client program binary file to be loaded
|
||||
CLIENT_PROGRAM_START, // client program entry point
|
||||
loadStartCallback,
|
||||
progressCallback);
|
||||
#else
|
||||
3;
|
||||
#endif
|
||||
switch (errorCode)
|
||||
{
|
||||
case 1:
|
||||
printStr("\n""PROGRAM NOT FOUND:\n");
|
||||
printExecutableFilename();
|
||||
break;
|
||||
case 2:
|
||||
printStr("\n""FAILED TO LOAD PROGRAM:\n");
|
||||
printExecutableFilename();
|
||||
break;
|
||||
default: // unexpected error code
|
||||
printStr("\n???");
|
||||
}
|
||||
for (;;) // freeze
|
||||
;
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
||||
int main()
|
||||
{
|
||||
disableInterrupts();
|
||||
asm
|
||||
{
|
||||
lds #$03D7 ; use top of LINE INPUT buffer as temp stack
|
||||
}
|
||||
return mainWithNewStackSpace();
|
||||
}
|
||||
@@ -0,0 +1,20 @@
|
||||
/* XPM */
|
||||
static char * title_xpm[] = {
|
||||
"128 14 3 1",
|
||||
" c None",
|
||||
". c #000000",
|
||||
"+ c #FFFFFF",
|
||||
".........................................................................+++....................................................",
|
||||
".......++++++...................++++++......................++++++++.....+++....................................................",
|
||||
".....+++++++++................+++++++++.....................+++++++++....+++....................................................",
|
||||
"....++++....++...............++++....++.....................+++...++++...+++....................................................",
|
||||
"....+++......+.....+++++.....+++......+.....+++++...........+++....+++...+++...+++++++.....+++.+++++......+++++......+++++++....",
|
||||
"...+++...........++++++++...+++...........++++++++..........+++....+++...+++...++++++++....++++++++++...++++++++....++++++++....",
|
||||
"...+++...........+++..+++...+++...........+++..+++..........+++....+++...+++...+....++++...+++....+++...+++...+++..+++.....+....",
|
||||
"...+++..........+++....+++..+++..........+++....+++.........+++...+++....+++.........+++...+++....+++..+++....+++..++++.........",
|
||||
"...+++..........+++....+++..+++..........+++....+++.........+++++++++....+++.....+++++++...+++....+++..++++++++++..++++++++.....",
|
||||
"...+++..........+++....+++..+++..........+++....+++.........+++++++......+++...+++++++++...+++....+++..++++++++++...++++++++....",
|
||||
"....+++......+..+++....+++...+++......+..+++....+++.........+++..........+++..+++....+++...+++....+++..+++..............++++....",
|
||||
"....++++....++...+++..+++....++++....++...+++..+++..........+++..........+++..+++....+++...+++....+++...+++.....+..+.....+++....",
|
||||
".....+++++++++...++++++++.....+++++++++...++++++++..........+++..........+++..++++++++++...+++....+++...+++++++++..++++++++.....",
|
||||
".......++++++.....++++++........++++++.....++++++...........+++..........+++...+++++.+++...+++....+++.....++++++....++++++......"};
|
||||
+146
@@ -0,0 +1,146 @@
|
||||
// Unit testing program.
|
||||
|
||||
#include "Score.h"
|
||||
#include "util.h"
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
|
||||
#define utAssert(cond) \
|
||||
do { \
|
||||
if (!(cond)) \
|
||||
_utFailAssert(#cond, __FILE__, __LINE__, NULL, 0); \
|
||||
} while (0)
|
||||
|
||||
|
||||
#define utAssertF(cond, fmt, ...) \
|
||||
do { \
|
||||
if (!(cond)) \
|
||||
_utFailAssert(#cond, __FILE__, __LINE__, (fmt), __VA_ARGS__); \
|
||||
} while (0)
|
||||
|
||||
|
||||
size_t numFailedAsserts = 0;
|
||||
|
||||
|
||||
void
|
||||
_utFailAssert(const char *cond, const char *filename, int lineno, const char *fmt, ...)
|
||||
{
|
||||
printf("*** ASSERT FAILED: %s:%d: %s: ", filename, lineno, cond);
|
||||
if (fmt)
|
||||
{
|
||||
va_list ap;
|
||||
va_start(ap, fmt);
|
||||
vprintf(fmt, ap);
|
||||
va_end(ap);
|
||||
}
|
||||
putchar('\n');
|
||||
++numFailedAsserts;
|
||||
exit(1);
|
||||
}
|
||||
|
||||
|
||||
uint16_t
|
||||
bradToDeg(uint8_t brads)
|
||||
{
|
||||
return (uint16_t) brads * 180 / 128;
|
||||
}
|
||||
|
||||
|
||||
//////////
|
||||
|
||||
|
||||
void
|
||||
test_Score(void)
|
||||
{
|
||||
Score s;
|
||||
Score_init(&s);
|
||||
utAssert(!Score_isWinningScore(&s));
|
||||
for (byte i = 0; i < WINNING_SCORE; ++i)
|
||||
{
|
||||
Score_addPoint(&s);
|
||||
//printf("%u,%u.\n", s.digits[0], s.digits[1]);
|
||||
BOOL isWinningScore = Score_isWinningScore(&s);
|
||||
utAssertF((isWinningScore != 0) == (i + 1 == WINNING_SCORE),
|
||||
"i=%u, isWinningScore=%u, WINNING_SCORE=%u", i, isWinningScore, WINNING_SCORE);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
test_approxAtan2Signed8(void)
|
||||
{
|
||||
int8_t brads;
|
||||
|
||||
brads = approxAtan2Signed8(0, +100); // right
|
||||
utAssertF(brads == 0, "brads=%d", brads);
|
||||
brads = approxAtan2Signed8(0, -100); // left
|
||||
utAssertF(brads == -128, "brads=%d", brads);
|
||||
brads = approxAtan2Signed8(+100, 0); // down, b/c y axis points down
|
||||
utAssertF(brads == -64, "brads=%d", brads);
|
||||
brads = approxAtan2Signed8(-100, 0); // up
|
||||
utAssertF(brads == +64, "brads=%d", brads);
|
||||
|
||||
brads = approxAtan2Signed8(-100, +100); // up and right
|
||||
utAssertF(brads == +32, "brads=%d", brads);
|
||||
brads = approxAtan2Signed8(-100, -100); // up and left
|
||||
utAssertF(brads == +96, "brads=%d", brads);
|
||||
brads = approxAtan2Signed8(+100, +100); // down and right
|
||||
utAssertF(brads == -32, "brads=%d", brads);
|
||||
brads = approxAtan2Signed8(+100, -100); // down and left
|
||||
utAssertF(brads == -96, "brads=%d", brads);
|
||||
|
||||
// Check that no asserts fail when computing various angles.
|
||||
//
|
||||
for (int16_t y = -8; y <= 8; ++y)
|
||||
for (int16_t x = -127; x <= 127; ++x)
|
||||
approxAtan2Signed8((int8_t) y, (int8_t) x);
|
||||
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
test_computeAngleIfNotTooFar(void)
|
||||
{
|
||||
int8_t angleInBrads = 0;
|
||||
BOOL success = FALSE;
|
||||
|
||||
// Target is up and to the right of the shooter.
|
||||
success = computeAngleIfNotTooFar(128, 96, 0, 160, 80, 64, 64 * 64, &angleInBrads);
|
||||
utAssert(success);
|
||||
//printf("angleInBrads=%d (%u deg)\n", angleInBrads, bradToDeg(angleInBrads));
|
||||
utAssertF(angleInBrads == +16, "angleInBrads=%d", angleInBrads);
|
||||
|
||||
// Target is down and to the right of the shooter.
|
||||
success = computeAngleIfNotTooFar(128, 96, 0, 160, 112, 64, 64 * 64, &angleInBrads);
|
||||
utAssert(success);
|
||||
//printf("angleInBrads=%d (%u deg)\n", angleInBrads, bradToDeg(angleInBrads));
|
||||
utAssertF(angleInBrads == -16, "angleInBrads=%d", angleInBrads);
|
||||
}
|
||||
|
||||
|
||||
int main()
|
||||
{
|
||||
enable6847T1TrueLowerCase();
|
||||
* (char *) 0x0167 = 57; /* write RTS instruction */
|
||||
|
||||
if (* (unsigned short *) 0xFFF8 == 0xFEF7) // if CoCo 3
|
||||
{
|
||||
rgb();
|
||||
width(80);
|
||||
cls(255);
|
||||
palette(8, 63);
|
||||
palette(0, 0);
|
||||
setBorderColor(0);
|
||||
}
|
||||
|
||||
test_Score();
|
||||
test_approxAtan2Signed8();
|
||||
test_computeAngleIfNotTooFar();
|
||||
|
||||
if (numFailedAsserts == 0)
|
||||
printf("SUCCESS.\n");
|
||||
else
|
||||
printf("%u FAILED ASSERTS.\n", numFailedAsserts);
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,703 @@
|
||||
/* util.c
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#include "util.h"
|
||||
|
||||
#include "pmode4game.h" /* cardgame library */
|
||||
|
||||
|
||||
word timer;
|
||||
|
||||
byte numVSyncsBeforeScreenFlip = 0;
|
||||
|
||||
//BOOL enableTraces;
|
||||
|
||||
static interrupt void
|
||||
irqService(void)
|
||||
{
|
||||
asm
|
||||
{
|
||||
tst $ff03 ; do nothing if 63.5 us interrupt
|
||||
bpl @done
|
||||
; 60 Hz interrupt:
|
||||
lda $ff02 ; reset PIA0, port B interrupt flag
|
||||
; Decrement numVSyncsBeforeScreenFlip if not already zero.
|
||||
;
|
||||
; Useful to get stats on IRQs per flip. See also showGraphicsPage().
|
||||
; tst :enableTraces
|
||||
; beq @noTraces
|
||||
; lda #'I'
|
||||
; sta $FF42 ; write to Becker port, to server that collects these chars
|
||||
; lda #10
|
||||
; sta $FF42
|
||||
;@noTraces
|
||||
;
|
||||
tst _numVSyncsBeforeScreenFlip
|
||||
beq @flipDecDone
|
||||
dec _numVSyncsBeforeScreenFlip
|
||||
@flipDecDone
|
||||
ldd _timer
|
||||
addd #1
|
||||
std _timer
|
||||
@done
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
setupIRQService(void)
|
||||
{
|
||||
asm
|
||||
{
|
||||
ldx $FFF8 ; 6809 IRQ vector address
|
||||
lda #$7E ; JMP instruction
|
||||
sta ,x
|
||||
leay irqService ; new routine
|
||||
sty 1,x
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
coldBoot(void)
|
||||
{
|
||||
disableInterrupts();
|
||||
memset16((void *) VIDRAM, 0x8080, 512 / 2); // clear 32x16 screen at location used by Basic
|
||||
|
||||
// Copy a small routine to low RAM, then jump to the routine, which:
|
||||
// - goes back to RAM-ROM mode to bring back Basic (CLR >$FFDE);
|
||||
// - pokes 0 at 113 (CLR >$0071);
|
||||
// - jumps at 40999 to cold boot Basic (JMP >$A027).
|
||||
//
|
||||
memcpy(0, "\x7F\xFF\xDE" "\x7F\x00\x71" "\x7E\xA0\x27", 9);
|
||||
asm { jmp >0 }
|
||||
}
|
||||
|
||||
|
||||
__gcccall asm void
|
||||
setCoCo12ColorSet(byte colorSet)
|
||||
{
|
||||
asm
|
||||
{
|
||||
lda $FF22
|
||||
tstb ; B contains colorSet (re: __gcccall)
|
||||
bne @colorSet1
|
||||
anda #$F7
|
||||
bra @store
|
||||
@colorSet1
|
||||
ora #$08
|
||||
@store
|
||||
sta $FF22
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
__gcccall void asm
|
||||
setCoCo3ColorSet(byte colorSet)
|
||||
{
|
||||
// Palette slots 0..3 for color set 0: black, dark green, middle green, light green.
|
||||
// Palette slots 0..3 for color set 1: black, blue, orange, white.
|
||||
//
|
||||
asm
|
||||
{
|
||||
tstb ; B contains colorSet, b/c __gcccall
|
||||
bne @colorSet1
|
||||
; Color set 0:
|
||||
ldd #$0002 ; black, dark green
|
||||
ldx #$1412 ; middle green, light green
|
||||
bra @store
|
||||
@colorSet1
|
||||
ldd #$000B ; black, blue
|
||||
ldx #$34FF ; orange, white
|
||||
@store
|
||||
std PALETREG
|
||||
stx PALETREG+2
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
word
|
||||
rnd(word lowerLimit, word upperLimit)
|
||||
{
|
||||
return (word) rand() % (upperLimit - lowerLimit + 1) + lowerLimit;
|
||||
}
|
||||
|
||||
|
||||
#if 0
|
||||
|
||||
|
||||
asm sword
|
||||
makeEven(sword n)
|
||||
{
|
||||
/* Original C code:
|
||||
if (n >= 0)
|
||||
return n & 0xFFFE;
|
||||
return -((-n) & 0xFFFE);
|
||||
*/
|
||||
asm
|
||||
{
|
||||
ldd 2,s ; load 'n', changes N and Z, resets V
|
||||
blt @negative
|
||||
andb #$FE
|
||||
bra @done
|
||||
@negative
|
||||
coma
|
||||
comb
|
||||
addd #1
|
||||
andb #$FE
|
||||
coma
|
||||
comb
|
||||
addd #1
|
||||
@done
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
__gcccall byte
|
||||
ceilDiv(byte num, byte den)
|
||||
{
|
||||
return (num + den - 1) / den;
|
||||
}
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
__gcccall asm sword
|
||||
signExtendYPos(byte screenRow)
|
||||
{
|
||||
#if 0 /* Original C code. */
|
||||
if (screenRow < ROWS_PER_SCREEN)
|
||||
return (sword) screenRow;
|
||||
return (sbyte) screenRow; // -64..-1
|
||||
#else
|
||||
asm
|
||||
{
|
||||
; screenRow is received in B.
|
||||
cmpb #ROWS_PER_SCREEN
|
||||
bhs @negative
|
||||
; B is 0..191; return this value as a word.
|
||||
clra
|
||||
bra @returnInX
|
||||
@negative ; B is -64..-1; sign extend this value to return it as a word.
|
||||
sex
|
||||
@returnInX
|
||||
tfr d,x ; a __gcccall function returns a word in X
|
||||
}
|
||||
#endif
|
||||
}
|
||||
|
||||
|
||||
static const struct { sword c, s; } cosSin256thsTable[16] =
|
||||
{
|
||||
/* 0 0.0 deg */ { 256, 0 },
|
||||
/* 1 22.5 deg */ { 237, 98 },
|
||||
/* 2 45.0 deg */ { 181, 181 },
|
||||
/* 3 67.5 deg */ { 98, 237 },
|
||||
/* 4 90.0 deg */ { 0, 256 },
|
||||
/* 5 112.5 deg */ { -98, 237 },
|
||||
/* 6 135.0 deg */ { -181, 181 },
|
||||
/* 7 157.5 deg */ { -237, 98 },
|
||||
/* 8 180.0 deg */ { -256, 0 },
|
||||
/* 9 202.5 deg */ { -237, -98 },
|
||||
/* 10 225.0 deg */ { -181, -181 },
|
||||
/* 11 247.5 deg */ { -98, -237 },
|
||||
/* 12 270.0 deg */ { 0, -256 },
|
||||
/* 13 292.5 deg */ { 98, -237 },
|
||||
/* 14 315.0 deg */ { 181, -181 },
|
||||
/* 15 337.5 deg */ { 237, -98 },
|
||||
};
|
||||
|
||||
|
||||
// angle: 0..15.
|
||||
// Returns (256 * cos(a * 22.5 deg), 256 * sin(a * 22.5 deg)).
|
||||
//
|
||||
void
|
||||
cosSin256ths(byte angle, sword *cosine, sword *sine)
|
||||
{
|
||||
assert(angle < ARRAY_SIZE(cosSin256thsTable));
|
||||
|
||||
*cosine = cosSin256thsTable[angle].c;
|
||||
*sine = cosSin256thsTable[angle].s;
|
||||
}
|
||||
|
||||
|
||||
sword
|
||||
cos256ths(byte angle)
|
||||
{
|
||||
assert(angle < ARRAY_SIZE(cosSin256thsTable));
|
||||
|
||||
return cosSin256thsTable[angle].c;
|
||||
}
|
||||
|
||||
|
||||
sword
|
||||
mul256thsToByte(sword a256, sword b256)
|
||||
{
|
||||
signed long product = (signed long) a256 * (signed long) b256;
|
||||
if (product >= 0) // to round to nearest multiple of 2**16:
|
||||
product += 0x8000u;
|
||||
else
|
||||
product -= 0x8000u;
|
||||
return * (sword *) &product; // product / 2**16; assumes big endian
|
||||
}
|
||||
|
||||
|
||||
#if 0
|
||||
|
||||
|
||||
void
|
||||
addToDecimalDigit(byte valueToAdd, sbyte digitIndex, byte digitArray[SCORE_WIDTH])
|
||||
{
|
||||
byte *digitInArray = digitArray + digitIndex;
|
||||
for (;;)
|
||||
{
|
||||
byte sum = valueToAdd + *digitInArray; // result in 0..18
|
||||
if (sum < 10) // if no carry
|
||||
{
|
||||
*digitInArray = sum;
|
||||
return;
|
||||
}
|
||||
*digitInArray-- = sum - 10;
|
||||
if (digitIndex == 0)
|
||||
return; // out of digits in array
|
||||
--digitIndex;
|
||||
valueToAdd = 1; // next iteration will add carry to previous digit
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
static byte leftMargin, logicalLineLength;
|
||||
|
||||
|
||||
void
|
||||
setWrappedPrinting(byte _leftMargin, byte _logicalLineLength)
|
||||
{
|
||||
leftMargin = _leftMargin;
|
||||
logicalLineLength = _logicalLineLength;
|
||||
}
|
||||
|
||||
|
||||
// Prints the given character, while also managing a boolean that
|
||||
// is used to invert the leftmost column of the next character
|
||||
// to be printed. This boolean is true at the closing of a ^...^
|
||||
// sequence that inverts the characters between the carets.
|
||||
//
|
||||
// ch: Character to write. No character gets written if ch is '\0'.
|
||||
//
|
||||
static __gcccall void
|
||||
putcharAndMung(char ch, BOOL *nextCharToHaveLeftColumnInverted)
|
||||
{
|
||||
if (*nextCharToHaveLeftColumnInverted)
|
||||
setColorInversionMask(0b11000000);
|
||||
|
||||
if (ch)
|
||||
putchar(ch);
|
||||
|
||||
if (*nextCharToHaveLeftColumnInverted)
|
||||
{
|
||||
setColorInversionMask(0);
|
||||
*nextCharToHaveLeftColumnInverted = FALSE;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
printWrapped(const char *text)
|
||||
{
|
||||
assert(logicalLineLength > 0); // setWrappedPrinting() must have been called
|
||||
|
||||
const byte logicalLineEnd = leftMargin + logicalLineLength;
|
||||
byte hPos, vPos;
|
||||
getCursor(&hPos, &vPos); // call to cardgame library
|
||||
if (hPos < leftMargin)
|
||||
{
|
||||
moveCursor(leftMargin, vPos);
|
||||
hPos = leftMargin;
|
||||
}
|
||||
byte separator = !!isspace(text[0]); // 1 means next word must be preceded by a space
|
||||
BOOL invColorEnabled = FALSE;
|
||||
BOOL nextCharToHaveLeftColumnInverted = FALSE;
|
||||
|
||||
for (const char *p = text; ; )
|
||||
{
|
||||
// Skip white space, but do newlines.
|
||||
while (isspace(*p))
|
||||
{
|
||||
if (*p == '\n')
|
||||
{
|
||||
putcharAndMung('\0', &nextCharToHaveLeftColumnInverted);
|
||||
moveCursor(leftMargin, textPosY + 1);
|
||||
hPos = leftMargin;
|
||||
separator = 0;
|
||||
}
|
||||
++p;
|
||||
}
|
||||
// Find end of current word.
|
||||
const char *wordStart = p;
|
||||
while (*p && !isspace(*p))
|
||||
++p;
|
||||
// If not enough space for word on current line, newline.
|
||||
size_t wordLen = p - wordStart;
|
||||
if (wordLen == 0)
|
||||
break; // end of 'text'
|
||||
|
||||
// If current word would go over limit, newline before.
|
||||
if (hPos + separator + wordLen > logicalLineEnd)
|
||||
{
|
||||
putcharAndMung('\0', &nextCharToHaveLeftColumnInverted);
|
||||
moveCursor(leftMargin, textPosY + 1);
|
||||
hPos = leftMargin;
|
||||
separator = 0;
|
||||
}
|
||||
else if (separator)
|
||||
{
|
||||
putcharAndMung(' ', &nextCharToHaveLeftColumnInverted);
|
||||
++hPos;
|
||||
}
|
||||
|
||||
// Print the word at (wordStart, wordLen), with support
|
||||
// for color inversion. Advance hPos.
|
||||
//
|
||||
for (byte j = 0; j < wordLen; ++j)
|
||||
{
|
||||
char ch = wordStart[j];
|
||||
if (ch == INVERTED_COLOR_TOGGLE_CHAR)
|
||||
{
|
||||
invColorEnabled = !invColorEnabled;
|
||||
enableInvertedColorText(invColorEnabled);
|
||||
|
||||
if (!invColorEnabled)
|
||||
{
|
||||
// This boolean is used to patch the rendering of the
|
||||
// character that follows a sequence of inverted characters.
|
||||
// With this patch, we ensure that the rightmost column of
|
||||
// the last inverted character is white instead of black.
|
||||
//
|
||||
nextCharToHaveLeftColumnInverted = TRUE;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
putcharAndMung(ch, &nextCharToHaveLeftColumnInverted);
|
||||
++hPos;
|
||||
}
|
||||
}
|
||||
|
||||
if (hPos != logicalLineEnd)
|
||||
separator = 1;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
copyDoubleRowBitmap(byte *screenPtr, const uint32_t bitmapRows[][8], byte numRows)
|
||||
{
|
||||
for (byte row = 0; row < numRows; ++row)
|
||||
{
|
||||
memcpy(screenPtr, bitmapRows[row], BYTES_PER_ROW); screenPtr += BYTES_PER_ROW;
|
||||
memcpy(screenPtr, bitmapRows[row], BYTES_PER_ROW); screenPtr += BYTES_PER_ROW;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
xorRegion(byte *screenPtr, byte numRows, byte xorArg)
|
||||
{
|
||||
size_t numBytes = (size_t) numRows * BYTES_PER_ROW;
|
||||
for (size_t i = 0; i < numBytes; ++i)
|
||||
screenPtr[i] ^= xorArg;
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
enableSound(void)
|
||||
{
|
||||
// Based on Color Basic code at $9A2B.
|
||||
byte *pia0 = (byte *) 0xFF00;
|
||||
pia0[1] &= 0xF7;
|
||||
pia0[3] &= 0xF7;
|
||||
byte *pia1 = (byte *) 0xFF20;
|
||||
pia1[3] |= 0x08;
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
playSoundSample(const void *sampleArray, const void *sampleArrayEnd, word delayLength)
|
||||
{
|
||||
asm
|
||||
{
|
||||
ldx :sampleArray
|
||||
//
|
||||
// Assuming that the playing rate is 4000 Hz, as an example.
|
||||
// The following sampling loop must write out a 6-bit sample 4000 times per second.
|
||||
// The CoCo 6809 CPU, for example, executes 894886 cycles per second.
|
||||
// Each iteration must last 894886 / 4000 cycles (about 224).
|
||||
// Each iteration lasts 5+4+6+N*(3+3)+6+3 cycles (see asm code below),
|
||||
// where N is the number of iterations of the between-samples delay loop.
|
||||
// We have 6*N + 24 = 224, so N is about 33.
|
||||
// Total formula: N = (224 - 24) / 6 = (894886 / 4000 - 24) / 6
|
||||
// = (cpuCyclesPerSecond / playBackFrequencyInHz - 24) / 6
|
||||
// This number can be computed by Player_getSamplePlayDelayLength().
|
||||
//
|
||||
@samplingLoop
|
||||
lda ,x+ ; (5 cycles)
|
||||
sta $FF20 ; (4) Write to PIA1
|
||||
ldd :delayLength ; (6)
|
||||
@delayLoop
|
||||
subd #1 ; (3)
|
||||
bhi @delayLoop ; (3)
|
||||
cmpx :sampleArrayEnd ; (6)
|
||||
blo @samplingLoop ; (3)
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
#if 0
|
||||
|
||||
|
||||
__gcccall void asm
|
||||
memzero(char *dest, byte numBytes)
|
||||
{
|
||||
asm
|
||||
{
|
||||
; X is dest b/c of __gcccall
|
||||
tstb ; B is numBytes b/c of __gcccall
|
||||
beq @done
|
||||
clra
|
||||
@loop
|
||||
sta ,x+
|
||||
decb
|
||||
bne @loop
|
||||
@done
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
static word randomWord = 0; // 0..$3FFF
|
||||
static byte numTaystesLeft = 0;
|
||||
|
||||
|
||||
byte
|
||||
generateRandomTayste(void)
|
||||
{
|
||||
if (numTaystesLeft == 0)
|
||||
{
|
||||
randomWord = (word) rand() % 0x3FFF; // keep 14 low bits
|
||||
numTaystesLeft = 7;
|
||||
}
|
||||
|
||||
byte direction = (byte) (randomWord & 3);
|
||||
randomWord >>= 2;
|
||||
--numTaystesLeft;
|
||||
return direction;
|
||||
}
|
||||
|
||||
|
||||
int8_t
|
||||
approxAtan2Signed8(int8_t y, int8_t x)
|
||||
{
|
||||
//printf("approxAtan2Signed8(%d,%d)\n", y, x);
|
||||
assert(y >= -127 && y <= 127);
|
||||
assert(x >= -127 && x <= 127);
|
||||
|
||||
if (y == 0)
|
||||
{
|
||||
if (x == 0)
|
||||
return 0;
|
||||
return x < 0 ? -128 : 0;
|
||||
}
|
||||
if (x == 0)
|
||||
return y < 0 ? 64 : -64;
|
||||
|
||||
// Convert to y axis that points up.
|
||||
//
|
||||
y = -y;
|
||||
|
||||
uint8_t abs_y = (uint8_t) (y < 0 ? -y : y);
|
||||
uint8_t abs_x = (uint8_t) (x < 0 ? -x : x);
|
||||
int16_t angle;
|
||||
|
||||
// Linear approximation ratio scaled to 32 (to fit comfortably in 16-bit).
|
||||
// Octant N, where N is in 1..8, goes from 45(N-1) to 45N degrees.
|
||||
//
|
||||
if (abs_x >= abs_y)
|
||||
{
|
||||
// Octants 1, 4, 5, 8: ratio = (32 * abs_y) / abs_x.
|
||||
angle = (int16_t) (((uint16_t) abs_y * 32u) / abs_x);
|
||||
}
|
||||
else
|
||||
{
|
||||
// Octants 2, 3, 6, 7. Invert across 45-deg. diagonal.
|
||||
angle = 64 - (int16_t) (((uint16_t) abs_x * 32u) / abs_y);
|
||||
}
|
||||
|
||||
// Mirror to correct quadrant based on original signs of x and y.
|
||||
//
|
||||
if (x < 0)
|
||||
angle = 128 - angle;
|
||||
if (y < 0)
|
||||
angle = -angle;
|
||||
if (angle == 128) // 128 does not fit a signed byte
|
||||
angle = -128;
|
||||
|
||||
BOOL angleValid = (angle >= -128 && angle <= 127);
|
||||
//if (!angleValid)
|
||||
// printf("x=%d, y=%d, angle=%d\n", x, y, angle);
|
||||
assert(angleValid);
|
||||
return (int8_t) angle;
|
||||
}
|
||||
|
||||
|
||||
BOOL
|
||||
computeAngleIfNotTooFar(byte shooterX, byte shooterY, byte shooterOrientation,
|
||||
byte targetX, byte targetY,
|
||||
word maxDistance, word maxDistanceSquared,
|
||||
int8_t *angleInBrads)
|
||||
{
|
||||
//printf("# computeAngleIfNotTooFar(%u, %u, %u, %u, %u)\n",
|
||||
// shooterX, shooterY, shooterOrientation, targetX, targetY);
|
||||
|
||||
// Compute the distance between the two sprites.
|
||||
//
|
||||
sword dx = (sword) targetX - (sword) shooterX;
|
||||
word dxAbs = (word) abs(dx);
|
||||
if (dxAbs >= maxDistance)
|
||||
return FALSE; // too far horizontally, avoid calculating distance
|
||||
sword dy = (sword) targetY - (sword) shooterY; // positive x axis points down
|
||||
word dyAbs = (word) abs(dy);
|
||||
if (dyAbs >= maxDistance)
|
||||
return FALSE; // too far vertically, avoid calculating distance
|
||||
word sqDist = dxAbs * dxAbs + dyAbs * dyAbs; // not expecting overflow b/c large dx, dy values already excluded
|
||||
if (sqDist >= maxDistanceSquared)
|
||||
return FALSE; // too far
|
||||
|
||||
//printf("# computeAngleIfNotTooFar: dx=%d, dy=%d, sqDist=%u\n", dx, dy, sqDist);
|
||||
|
||||
// Check if the shooter is pointing in direction of the target.
|
||||
// bitmapIndex is in 0..15.
|
||||
// The nose of the plane points in a direction given by an angle that is bitmapIndex * 22.5 degrees.
|
||||
// (Standard trig circle assumed, with 0 deg to the right, and +90 up.)
|
||||
// The direction from the shooter to the target is given by the couple (dx, -dy) (standard Cartesian plane).
|
||||
// (The minus sign is because the y axis used by Sprite points down.)
|
||||
// The angle of the shooter-to-target arrow is atan(-dy / dx).
|
||||
//
|
||||
int8_t bradsToTarget = approxAtan2Signed8((sbyte) dy, (sbyte) dx); // angle in binary radians: -128..127
|
||||
|
||||
//printf("# computeAngleIfNotTooFar: bradsToTarget=%d\n", bradsToTarget);
|
||||
|
||||
byte noseBrads = shooterOrientation << 4; // convert 0..15 to brads (0..255)
|
||||
|
||||
//printf("# computeAngleIfNotTooFar: noseBrads=%u\n", noseBrads);
|
||||
|
||||
*angleInBrads = bradsToTarget - (int8_t) noseBrads;
|
||||
|
||||
//printf("# computeAngleIfNotTooFar: angleInBrads=%d\n", *angleInBrads);
|
||||
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
|
||||
#if DEBUG /* Useful for debugging. */
|
||||
|
||||
|
||||
void
|
||||
beckPrintStr(const char *s)
|
||||
{
|
||||
for (; *s; ++s)
|
||||
beckputchar(*s);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
beckPrintInt(int n)
|
||||
{
|
||||
char tmp[16];
|
||||
itoa10(n, tmp);
|
||||
beckPrintStr(tmp);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
beckPrintLineNo(int lineNo)
|
||||
{
|
||||
beckputchar('[');
|
||||
beckputchar('L');
|
||||
beckPrintInt(lineNo);
|
||||
beckputchar(']');
|
||||
beckputchar('\n');
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
beckPrintInts(int a, int b)
|
||||
{
|
||||
beckPrintInt(a);
|
||||
beckputchar(';');
|
||||
beckPrintInt(b);
|
||||
beckputchar('\n');
|
||||
}
|
||||
|
||||
|
||||
asm void
|
||||
beckerPortConsoleOutHook(void)
|
||||
{
|
||||
asm
|
||||
{
|
||||
sta $FF42
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
beckPrintf(const char *fmt, ...)
|
||||
{
|
||||
ConsoleOutHook oldHook = setConsoleOutHook(beckerPortConsoleOutHook);
|
||||
va_list ap;
|
||||
va_start(ap, fmt);
|
||||
vprintf(fmt, ap);
|
||||
va_end(ap);
|
||||
setConsoleOutHook(oldHook);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
printDecimalArray(const byte array[], byte numDigits)
|
||||
{
|
||||
for ( ; numDigits--; ++array)
|
||||
putchar('0' + *array);
|
||||
}
|
||||
|
||||
|
||||
void
|
||||
breakpoint(void)
|
||||
{
|
||||
printf("*** STOPPED AT BREAKPOINT ***\n");
|
||||
while (! isKeyPressed(KEY_PROBE_1, KEY_BIT_1))
|
||||
;
|
||||
while (isKeyPressed(KEY_PROBE_1, KEY_BIT_1))
|
||||
;
|
||||
}
|
||||
|
||||
|
||||
#endif /* DEBUG */
|
||||
@@ -0,0 +1,246 @@
|
||||
/* util.h
|
||||
Copyright (C) 2026 Pierre Sarrazin <http://sarrazip.com/>
|
||||
|
||||
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/>.
|
||||
*/
|
||||
|
||||
#ifndef _H_util
|
||||
#define _H_util
|
||||
|
||||
#include "constants.h"
|
||||
|
||||
#include <coco.h>
|
||||
#include <assert.h>
|
||||
|
||||
#if _CMOC_VERSION_ < 1100
|
||||
#error "This project requires version 0.1.100 or later of CMOC."
|
||||
#endif
|
||||
|
||||
|
||||
// Gives a number of elements, not a number of bytes.
|
||||
//
|
||||
#define ARRAY_SIZE(array) (sizeof(array) / sizeof((array)[0]))
|
||||
|
||||
|
||||
#define ARRAY_END(array) ((array) + ARRAY_SIZE(array))
|
||||
|
||||
|
||||
// Counter that is incremented 60 times per second.
|
||||
//
|
||||
extern word timer;
|
||||
|
||||
|
||||
// Counts down to zero from VSYNCS_PER_FLIP.
|
||||
//
|
||||
extern byte numVSyncsBeforeScreenFlip;
|
||||
|
||||
|
||||
// Sets up the IRQ service that updates 'numVSyncsBeforeScreenFlip' and 'timer'
|
||||
// on the V-Sync interrupt.
|
||||
//
|
||||
void setupIRQService(void);
|
||||
|
||||
|
||||
void coldBoot(void);
|
||||
|
||||
|
||||
// Equivalent to SCREEN 1,colorSet.
|
||||
//
|
||||
__gcccall void setCoCo12ColorSet(byte colorSet);
|
||||
|
||||
|
||||
// Emulates setCoCo12ColorSet() with palette changes.
|
||||
//
|
||||
__gcccall void setCoCo3ColorSet(byte colorSet);
|
||||
|
||||
|
||||
// Returns a random integer between the two limits, inclusively.
|
||||
//
|
||||
word rnd(word lowerLimit, word upperLimit);
|
||||
|
||||
|
||||
#if 0
|
||||
|
||||
|
||||
// Makes the absolute value of 'n' even.
|
||||
//
|
||||
sword makeEven(sword n);
|
||||
|
||||
|
||||
// Returns ⌈num / den⌉.
|
||||
//
|
||||
__gcccall byte ceilDiv(byte num, byte den);
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
// screenRow: Considered negative if in -64..-1, non-negative if 0..191.
|
||||
// Returns this value as a signed word.
|
||||
//
|
||||
__gcccall asm sword signExtendYPos(byte screenRow);
|
||||
|
||||
|
||||
// angle: 0..NUM_BIPLANE_BITMAPS-1.
|
||||
// Returns (256 * cos(a * 22.5 deg), 256 * sin(a * 22.5 deg)).
|
||||
//
|
||||
void cosSin256ths(byte angle, sword *cosine, sword *sine);
|
||||
|
||||
|
||||
sword cos256ths(byte angle);
|
||||
|
||||
|
||||
// Takes two values in 256ths of a pixel.
|
||||
// Returns a256 * b256 * 2**16, i.e., in whole pixels.
|
||||
//
|
||||
sword mul256thsToByte(sword a256, sword b256);
|
||||
|
||||
|
||||
#if 0
|
||||
|
||||
|
||||
// valueToAdd: 0..9.
|
||||
// digitIndex: Index in decimalScore[].
|
||||
//
|
||||
void addToDecimalDigit(byte valueToAdd, sbyte digitIndex, byte digitArray[SCORE_WIDTH]);
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
// Sets parameters used by printWrapped().
|
||||
// MUST be called at least once before calling printWrapped().
|
||||
// leftMargin: Column where logical lines start.
|
||||
// logicalLineLength: leftMargin + logicalLineLength must be less than screen width.
|
||||
//
|
||||
void setWrappedPrinting(byte leftMargin, byte logicalLineLength);
|
||||
|
||||
|
||||
// setWrappedPrinting() MUST have been called at least once before
|
||||
// calling this function.
|
||||
// Newlines must be specified with '\n'.
|
||||
// Character INVERTED_COLOR_TOGGLE_CHAR toggles color inversion.
|
||||
//
|
||||
void printWrapped(const char *text);
|
||||
|
||||
|
||||
// Copies 'numRows' of bitmapRows[] twice each to screenPtr.
|
||||
//
|
||||
void copyDoubleRowBitmap(byte *screenPtr, const uint32_t bitmapRows[][8], byte numRows);
|
||||
|
||||
|
||||
// XORs every byte of the region at screenPtr with xorArg.
|
||||
// The region size is numRows * BYTES_PER_ROW.
|
||||
//
|
||||
void xorRegion(byte *screenPtr, byte numRows, byte xorArg);
|
||||
|
||||
|
||||
// Must be called before calling playSoundSample().
|
||||
//
|
||||
void enableSound(void);
|
||||
|
||||
|
||||
// enableSound() must be called before calling this function.
|
||||
// The array bytes must contain sample values in { 0, 4, 8, ... , 252 },
|
||||
// bits 0 and 1 must be zero.
|
||||
// delayLength: Longer values put more time between writing each
|
||||
// sample byte to the sound port. A unit represents 6 cycles
|
||||
// on a CoCo 6809 CPU.
|
||||
//
|
||||
void playSoundSample(const void *sampleArray,
|
||||
const void *sampleArrayEnd,
|
||||
word delayLength);
|
||||
|
||||
|
||||
#if 0
|
||||
|
||||
|
||||
__gcccall void memzero(char *dest, byte numBytes);
|
||||
|
||||
|
||||
#endif
|
||||
|
||||
|
||||
// Returns a random value between 0..3.
|
||||
// Optimizes the number of calls to rand().
|
||||
//
|
||||
byte generateRandomTayste(void);
|
||||
|
||||
|
||||
// x: -127..+127. Positive axis points right.
|
||||
// y: -127..+127. Positive axis points down.
|
||||
// Returns an angle from -128 to 127, representing -180 to +179 degrees,
|
||||
// where 0 is right, 64 is up, -128 is left, -64 is down.
|
||||
//
|
||||
int8_t approxAtan2Signed8(int8_t y, int8_t x);
|
||||
|
||||
|
||||
// shooterOrientation: 0..15 (0 is right, 4 is up, 8 is left, etc.).
|
||||
// maxDistance: Distance beyond which the objects are considered too far.
|
||||
// maxDistanceSquared: Must be maxDistance * maxDistance.
|
||||
//
|
||||
// If the distance between 'shooter' and 'target' is not too long,
|
||||
// stores the angle between the shooter's nose and the shooter-to-target
|
||||
// line in *angleInBrads (-128 to 127), and returns TRUE.
|
||||
// (See approxAtan2Signed8().)
|
||||
//
|
||||
// Otherwise, returns FALSE.
|
||||
//
|
||||
// Example: S----N
|
||||
//
|
||||
// T
|
||||
//
|
||||
// Point S is the back of 'shooter', N is its nose, and T is the target.
|
||||
// The returned angle is the N-S-T angle.
|
||||
//
|
||||
BOOL computeAngleIfNotTooFar(byte shooterX, byte shooterY, byte shooterOrientation,
|
||||
byte targetX, byte targetY,
|
||||
word maxDistance, word maxDistanceSquared,
|
||||
int8_t *angleInBrads);
|
||||
|
||||
|
||||
#if DEBUG /* Useful for debugging. */
|
||||
|
||||
|
||||
#define beckputchar(ch) (* (byte *) 0xFF42 = (byte) (ch))
|
||||
|
||||
|
||||
void beckPrintStr(const char *s);
|
||||
|
||||
|
||||
void beckPrintInt(int n);
|
||||
|
||||
|
||||
void beckPrintLineNo(int lineNo);
|
||||
|
||||
|
||||
void beckPrintInts(int a, int b);
|
||||
|
||||
|
||||
void beckerPortConsoleOutHook(void);
|
||||
|
||||
|
||||
void beckPrintf(const char *fmt, ...);
|
||||
|
||||
|
||||
void printDecimalArray(const byte array[], byte numDigits);
|
||||
|
||||
|
||||
void breakpoint(void);
|
||||
|
||||
|
||||
#endif /* DEBUG */
|
||||
|
||||
|
||||
#endif /* _H_util */
|
||||
Reference in new issue
Block a user