mirror of
https://github.com/cc65/cc65.git
synced 2024-06-01 13:41:34 +00:00
Remove dangling spaces
This commit is contained in:
parent
892d021207
commit
9c00f6628b
|
@ -114,4 +114,4 @@ clean:
|
|||
@$(DEL) kimGFX.hex 2>$(NULLDEV)
|
||||
@$(DEL) ramfont.c 2>$(NULLDEV)
|
||||
|
||||
|
||||
|
||||
|
|
|
@ -35,7 +35,7 @@ int CursorY = 0;
|
|||
#define CHARSPERROW (SCREEN_WIDTH / CHARWIDTH)
|
||||
#define ROWSPERCOLUMN (SCREEN_HEIGHT / CHARHEIGHT)
|
||||
|
||||
// SETPIXEL
|
||||
// SETPIXEL
|
||||
//
|
||||
// 0 <= x < 320
|
||||
// 0 <= y < 200
|
||||
|
@ -47,7 +47,7 @@ void SETPIXEL(int x, int y, byte b)
|
|||
byte * pb = screen;
|
||||
pb += x >> 3;
|
||||
pb += y * BYTESPERROW;
|
||||
|
||||
|
||||
if (b)
|
||||
*(pb) |= (0b10000000 >> (x & 7));
|
||||
else
|
||||
|
@ -131,7 +131,7 @@ void DrawChar(int x, int y, char petscii)
|
|||
|
||||
if (x < 0 || y < 0 || x >= CHARSPERROW || y >= ROWSPERCOLUMN)
|
||||
return;
|
||||
|
||||
|
||||
pb += y * BYTESPERCHARROW;
|
||||
pb += x;
|
||||
|
||||
|
@ -198,7 +198,7 @@ void DrawLine(int x0, int y0, int x1, int y1, byte val)
|
|||
break;
|
||||
|
||||
e2 = err;
|
||||
|
||||
|
||||
if (e2 > -dx)
|
||||
{
|
||||
err -= dy;
|
||||
|
@ -296,7 +296,7 @@ void DrawScreenMoire(int left, int top, int right, int bottom)
|
|||
int main (void)
|
||||
{
|
||||
int i;
|
||||
|
||||
|
||||
// Clear the screen memory
|
||||
ClearScreen();
|
||||
|
||||
|
|
|
@ -131,7 +131,7 @@ int main (void)
|
|||
printf("\r\nStarting Conway's Game of Life: Randomizing World...\r\n");
|
||||
RandomFillWorld();
|
||||
printf("World Ready, Running!\r\n");
|
||||
|
||||
|
||||
for (;;)
|
||||
{
|
||||
UpdateWorld();
|
||||
|
|
|
@ -33,7 +33,7 @@ void RepeatChar(char c, size_t count)
|
|||
* within that region. The address (and hence the
|
||||
* memory region) is selected by the caller.
|
||||
*
|
||||
* Returns: 0 if the test succeeds.
|
||||
* Returns: 0 if the test succeeds.
|
||||
* A non-zero result is the first pattern that failed.
|
||||
*
|
||||
**********************************************************************/
|
||||
|
@ -43,7 +43,7 @@ byte memTestDataBus(volatile byte * address)
|
|||
byte pattern;
|
||||
|
||||
// Perform a walking 1's test at the given address.
|
||||
|
||||
|
||||
for (pattern = 1; pattern != 0; pattern <<= 1)
|
||||
{
|
||||
// Write the test pattern.
|
||||
|
@ -78,7 +78,7 @@ byte memTestDataBus(volatile byte * address)
|
|||
* select the region size as a power-of-two--if at all
|
||||
* possible.
|
||||
*
|
||||
* Returns: NULL if the test succeeds.
|
||||
* Returns: NULL if the test succeeds.
|
||||
* A non-zero result is the first address at which an
|
||||
* aliasing problem was uncovered. By examining the
|
||||
* contents of memory, it may be possible to gather
|
||||
|
@ -97,14 +97,14 @@ byte * memTestAddressBus(volatile byte * baseAddress, unsigned long nBytes)
|
|||
|
||||
|
||||
//Write the default pattern at each of the power-of-two offsets.
|
||||
|
||||
|
||||
for (offset = 1; (offset & addressMask) != 0; offset <<= 1)
|
||||
{
|
||||
baseAddress[offset] = pattern;
|
||||
}
|
||||
|
||||
// Check for address bits stuck high.
|
||||
|
||||
|
||||
testOffset = 0;
|
||||
baseAddress[testOffset] = antipattern;
|
||||
|
||||
|
@ -121,9 +121,9 @@ byte * memTestAddressBus(volatile byte * baseAddress, unsigned long nBytes)
|
|||
|
||||
baseAddress[testOffset] = pattern;
|
||||
|
||||
|
||||
|
||||
// Check for address bits stuck low or shorted.
|
||||
|
||||
|
||||
for (testOffset = 1; (testOffset & addressMask) != 0; testOffset <<= 1)
|
||||
{
|
||||
baseAddress[testOffset] = antipattern;
|
||||
|
@ -144,7 +144,7 @@ byte * memTestAddressBus(volatile byte * baseAddress, unsigned long nBytes)
|
|||
baseAddress[testOffset] = pattern;
|
||||
}
|
||||
return (NULL);
|
||||
}
|
||||
}
|
||||
|
||||
/**********************************************************************
|
||||
*
|
||||
|
@ -185,7 +185,7 @@ byte * memTestDevice(volatile byte * baseAddress, unsigned long nBytes)
|
|||
for (pattern = 1, offset = 0; offset < nWords; pattern++, offset++)
|
||||
{
|
||||
if (offset % 1024 == 0)
|
||||
printf("%04X ", (int) &baseAddress[offset]);
|
||||
printf("%04X ", (int) &baseAddress[offset]);
|
||||
|
||||
if (baseAddress[offset] != pattern)
|
||||
{
|
||||
|
@ -203,7 +203,7 @@ byte * memTestDevice(volatile byte * baseAddress, unsigned long nBytes)
|
|||
for (pattern = 1, offset = 0; offset < nWords; pattern++, offset++)
|
||||
{
|
||||
if (offset % 1024 == 0)
|
||||
printf("%04X ", (int) &baseAddress[offset]);
|
||||
printf("%04X ", (int) &baseAddress[offset]);
|
||||
|
||||
antipattern = ~pattern;
|
||||
if (baseAddress[offset] != antipattern)
|
||||
|
@ -214,7 +214,7 @@ byte * memTestDevice(volatile byte * baseAddress, unsigned long nBytes)
|
|||
}
|
||||
|
||||
return (NULL);
|
||||
}
|
||||
}
|
||||
|
||||
// TestMemory
|
||||
//
|
||||
|
@ -231,7 +231,7 @@ byte TestMemory(byte * startAddress, unsigned long size)
|
|||
else
|
||||
{
|
||||
return (0);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main (void)
|
||||
|
|
|
@ -28,7 +28,7 @@ src_hi = src+1
|
|||
_ClearScreen:
|
||||
lda #$00
|
||||
|
||||
ldx #<SCREEN
|
||||
ldx #<SCREEN
|
||||
stx dest_lo
|
||||
ldx #>SCREEN
|
||||
stx dest_hi
|
||||
|
@ -56,7 +56,7 @@ _ScrollScreen:
|
|||
sta src_hi
|
||||
lda #<SCREEN
|
||||
sta dest_lo
|
||||
lda #>SCREEN
|
||||
lda #>SCREEN
|
||||
sta dest_hi
|
||||
|
||||
ldy #$00
|
||||
|
@ -74,7 +74,7 @@ _ScrollScreen:
|
|||
|
||||
lda #$00 ; Clear the last line (320 bytes, or A0 twice)
|
||||
ldy #$A0
|
||||
: sta SCREEN+$1EA0, y
|
||||
: sta SCREEN+$1EA0, y
|
||||
sta SCREEN+$1E00, y
|
||||
dey
|
||||
bne :-
|
||||
|
|
Loading…
Reference in New Issue
Block a user