Jeśli chcesz wziąć udział w dyskusjach na forum - zaloguj się. Jeżeli nie masz loginu - poproś o członkostwo.
Vanilla 1.1.4 jest produktem Lussumo. Więcej informacji: Dokumentacja, Forum.
RCDATA 'apl_data\map_forest1.apl' MAP_FOREST1 0 0 0 0 0 0 0 0
resource.asm (453) ERROR: Overlap memory
Writing listing file...
.macro RCDATA (nam, lab)
len = .filesize(%%1)
ift main.%%lab+len >= $c000
ift main.%%lab>=CODEORIGIN && main.%%lab<PROGRAMSTACK
ert 'Overlap memory'
eif
org RESORIGIN
mcpy jsr sys.off
memcpy #data #main.%%lab #len
jmp sys.on
data ins %%1
.print '$R RCDATA ',main.%%lab,'..',main.%%lab+len-1," %%1"
ini mcpy
els
ift main.%%lab>=CODEORIGIN && main.%%lab<PROGRAMSTACK
ert 'Overlap memory'
eif
org main.%%lab
ins %%1
.print '$R RCDATA ',main.%%lab,'..',*-1," %%1"
eif
.endm
ZPAGE: $0080..$00D7
RTLIB: $22D0..$2397
SYSTEM: $23D8..$2433
B_SYSTEM: $2434..$24FD
APLIB: $24FE..$262D
MISC: $262E..$265D
RMT: $265E..$2798
CODE: $2000..$4B6B
DATA: $4BE0..$7311
Writing listing file...
Writing object file...
18424 lines of source assembled in 9 pass
29590 bytes written to the object file
ZPAGE: $0080..$00D7
RTLIB: $22D0..$23B4
SYSTEM: $23F5..$248D
B_SYSTEM: $248E..$2573
APLIB: $2574..$26B9
RMT: $26BA..$27ED
CODE: $2000..$4B8B
DATA: $4B8C..$4FBC
Writing listing file...
Writing object file...
17804 lines of source assembled in 10 pass
20489 bytes written to the object file
infoTxt : array[0..3] of ^string = (
'Dom Czarownika'~,
'Stary pien'~,
'Zlamane drzewo'~,
'Jaskinia pajakow'~
);
dialogTxt : array [0..0] of ^string;
dialogTxt : array [0..0] of string;
const
scradr = $E000;
var
tablicaA : array [0..3] of byte;
tablicaB : array [0..3] of byte;
tablicaA[1]:=0;
tablicaB[tablicaA[1]]:=Peek(scradr);
tablicaB[tablicaA[1]]:=tablicaB[tablicaA[1]] and %10000000 or %01100010;
tablicaB[tablicaA[1]]:=Peek(scradr) and %10000000 or %01100010;
tab_sin: array [0..255] of byte;
a := tab_sin[x+32];
a := tab_sin[byte(x+32)];
h:=tab[i];
h:=tab[i and 7];
a:=tab[byte(i+32)];
a:=tab[(i+32) and 255];
unsigned char index;
unsigned char array_small[128];
unsigned char array_big[512];
void main() {
// small array, index by byte
for (index=0;index<sizeof(array_small);++index)
{
array_small[index] = 1;
}
// big array, index by byte
for (index=0;index<sizeof(array_big);++index)
{
array_big[index] = 2;
}
}
main: {
ldx #0
// small array, index by byte
__b1:
cpx #$80*SIZEOF_BYTE
bcc __b2
ldx #0
// big array, index by byte
__b4:
lda #2
sta array_big,x
inx
jmp __b4
__b2:
lda #1
sta array_small,x
inx
jmp __b1
}
unsigned char index;
unsigned char array[128];
void main() {
// big array, index by byte
for (index=0;index<sizeof(array);++index)
{
array[((unsigned int)index)+1024] = 1;
}
}
main: {
.label __2 = $80
.label __4 = $80
ldx #0
// big array, index by byte
__b1:
cpx #$80*SIZEOF_BYTE
bcc __b2
rts
__b2:
txa
sta.z __2
lda #0
sta.z __2+1
clc
lda.z __4
adc #<array+$400
sta.z __4
lda.z __4+1
adc #>array+$400
sta.z __4+1
lda #1
ldy #0
sta (__4),y
inx
jmp __b1
}
ldy I
lda #$01
sta adr.AR+$64,y
unsigned char index;
unsigned char array[128];
void main() {
// fill second part of the array
for (index=0;index<64;++index)
{
array[index+64] = 1;
}
}
.segment Code
main: {
ldx #0
// fill second part of the array
__b1:
cpx #$40
bcc __b2
rts
__b2:
lda #1
sta array+$40,x
inx
jmp __b1
}
const
scradr = $E000;
var
tablicaA : array [0..3] of byte;
tablicaB : array [0..3] of byte;
tablicaA[1]:=0;
tablicaB[tablicaA[1]]:=Peek(scradr);
tablicaB[tablicaA[1]]:=tablicaB[tablicaA[1]] and %10000000 or %01100010;
kski:
Nie da się robić tylu optymalizacji i zmian ile wykonuje Tebe ustrzegając się jednocześnie jakichkolwiek problemów.Od 1 do 40 z 40
