mirror of
https://github.com/RevCurtisP/C02.git
synced 2024-11-18 21:07:28 +00:00
210 lines
5.1 KiB
Plaintext
210 lines
5.1 KiB
Plaintext
/***********************************************
|
|
* TESTSTK - Test Stack Manipulation Functions *
|
|
* Assumes free RAM from $7FFF to $807E *
|
|
***********************************************/
|
|
|
|
//use -h option on command line when compiling
|
|
|
|
#include <stddef.h02>
|
|
#include <stdlib.h02>
|
|
#include <stdio.h02>
|
|
#include <stdiox.h02>
|
|
#include <string.h02>
|
|
#include <memory.h02>
|
|
#include <stack.h02>
|
|
|
|
char c,f,g,i;
|
|
char aa,xx,yy;
|
|
char zz,lo,hi;
|
|
const char r={6,7,8,9};
|
|
const char s="Test String";
|
|
char t[255];
|
|
|
|
main:
|
|
|
|
for (i=0;i<$20;i++) srclo[i]=0; //Initialize Pointers
|
|
|
|
puts("Setting Stack Start Address\t");
|
|
puts("stkbgn($7FFF)\t");
|
|
stkbgn(&$7FFF); lo=stkslo; hi=stkshi;
|
|
setdst("stks"); cklohi(&$7FFF);
|
|
|
|
puts("Setting Stack End Address\t");
|
|
puts("stkend($807E)\t");
|
|
stkend(&$807E); lo=stkelo; hi=stkehi;
|
|
setdst("stke"); cklohi(&$807E);
|
|
|
|
puts("Setting Stack Pointer Address\t");
|
|
puts("stkset($7765)\t");
|
|
stkset(&$7765); lo=stklo; hi=stkhi;
|
|
setdst("stk"); cklohi(0,&$7765);
|
|
chksiz(#FALSE, &$F766);
|
|
|
|
puts("Resetting Stack Pointer\t\t");
|
|
puts("stkrst()\t");
|
|
stkrst(); lo=stklo; hi=stkhi;
|
|
setdst("stk"); cklohi(0,&$7FFF);
|
|
chksiz(#FALSE, &0);
|
|
|
|
puts("Getting Stack Pointer Address\t");
|
|
puts("stkptr()\t");
|
|
aa, hi, lo = stkptr();
|
|
setdst(""); cklohi(0,&$7FFF);
|
|
|
|
puts("Setting Source to Stack Pointer\t");
|
|
puts("stksrc()\t");
|
|
stksrc(); lo=srclo; hi=srchi;
|
|
setdst("src"); cklohi(0,&$7FFF);
|
|
|
|
puts("Setting Dest. to Stack Pointer\t");
|
|
puts("stkdst()\t");
|
|
stkdst(); lo=dstlo; hi=dsthi;
|
|
setdst("src"); cklohi(0,&$7FFF);
|
|
|
|
puts("Incrementing Stack Pointer\t");
|
|
puts("stkinc()\t");
|
|
stkinc(); lo=stklo; hi=stkhi;
|
|
setdst("stk"); cklohi(0,&$8000);
|
|
chksiz(#TRUE, &1);
|
|
|
|
puts("Decrementing Stack Pointer\t");
|
|
puts("stkdec()\t");
|
|
stkdec(); lo=stklo; hi=stkhi;
|
|
setdst("stk"); cklohi(0,&$7FFF);
|
|
chksiz(#FALSE, &0);
|
|
|
|
c = anykey(); if (c == #esckey) goto exit;
|
|
|
|
puts("Pushing Array onto Stack\t");
|
|
puts("stkpsh(@r,$r)\t");
|
|
aa,hi,lo=stkptr(); //Save Stack Pointer
|
|
f=stkpsh(@r,&r); printf(f,"bytes=%d:");
|
|
setdst(?,hi,lo); g=(memcmp(@r, &r)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g); chksiz(#TRUE, &5); chkptr(&$8004);
|
|
|
|
puts("Duplicating Top of Stack\t");
|
|
puts("stkdup()\t");
|
|
aa,hi,lo=stkptr(); //Save Stack Pointer
|
|
f=stkdup(); printf(f,"bytes=%d:");
|
|
setdst(?,hi,lo); g=(memcmp(@r, &r)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g); chksiz(#TRUE, &10); chkptr(&$8009);
|
|
|
|
puts("Pushing String onto Stack\t");
|
|
puts("stkstr(&s)\t");
|
|
aa,hi,lo=stkptr(); //Save Stack Pointer
|
|
f=stkstr(&s); printf(f,"bytes=%d:");
|
|
setdst(?,hi,lo); g=(strcmp(&s)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g); chksiz(#TRUE, &23); chkptr(&$8016);
|
|
|
|
puts("Duplicating Second Stack Entry\t");
|
|
puts("stkovr()\t");
|
|
aa,hi,lo=stkptr(); //Save Stack Pointer
|
|
f=stkovr(); printf(f,"bytes=%d:");
|
|
setdst(?,hi,lo); g=(memcmp(@r, &r)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g); chksiz(#TRUE, &28); chkptr(&$801B);
|
|
|
|
c = anykey(); if (c == #esckey) goto exit;
|
|
|
|
puts("Dropping Duplicate off Stack\t");
|
|
puts("stkdrp()\t");
|
|
f=stkdrp(); printf(f,"bytes=%d:");
|
|
g=(f==4) ? #TRUE : #FALSE;
|
|
psorfl(f & g); chksiz(#TRUE, &23); chkptr(&$8016);
|
|
|
|
puts("Copying String from Stack\t");
|
|
puts("stktop(&t)\t");
|
|
f=stktop(&t); setdst(&t); printf("\"%s\":");
|
|
g=(strcmp(&s)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g);
|
|
chkptr(&$8016);
|
|
|
|
puts("Popping String off Stack\t");
|
|
puts("stkpop(&t)\t");
|
|
f=stkpop(&t); setdst(&t); printf("\"%s\":");
|
|
g=(strcmp(&s)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g);
|
|
chkptr(&$8009);
|
|
|
|
puts("Dropping Duplicate off Stack\t");
|
|
puts("stkdrp()\t");
|
|
f=stkdrp(); printf(f,"bytes=%d:");
|
|
g=(f==4) ? #TRUE : #FALSE;
|
|
psorfl(f & g);
|
|
chkptr(&$8004);
|
|
|
|
puts("Popping Array off Stack\t\t");
|
|
puts("stkpop(&t)\t");
|
|
f=stkpop(&t); prtary(f); puts(": ");
|
|
g=(memcmp(f,&r)==0) ? #TRUE : #FALSE;
|
|
psorfl(f & g);
|
|
chkptr(&$7FFF);
|
|
|
|
puts("Popping off Empty Stack\t\t");
|
|
puts("stkpop(&t)\t");
|
|
f=stkpop(&t); printf(f,"bytes=%d:");
|
|
if (f) fail(); else pass();
|
|
chkptr(&$7FFF);
|
|
|
|
puts("Overflowing Stack\t\t");
|
|
puts("stkpsh(255,&t)\t");
|
|
f=stkpsh(255,&t); printf(f,"bytes=%d:");
|
|
if (f) fail(); else pass();
|
|
chkptr(&$7FFF);
|
|
|
|
putln("Tests Complete");
|
|
|
|
goto exit;
|
|
|
|
void chkptr(aa,yy,xx) {
|
|
puts("\tChecking Stack Pointer\t\t\t");
|
|
puts("address=$"); prbyte(stkhi); prbyte(stklo); putc(':');
|
|
xx = (stklo == xx) ? #TRUE : #FALSE;
|
|
yy = (stkhi == yy) ? #TRUE : #FALSE;
|
|
psorfl(xx & yy);
|
|
}
|
|
|
|
void prtary(aa) {
|
|
putc('{');
|
|
for (i=0;i<aa;i++) {
|
|
if (i) putc(',');
|
|
putdec(t[i]);
|
|
}
|
|
putc('}');
|
|
}
|
|
|
|
void cklohi(aa,yy,xx) {
|
|
putdst(); puts("lo=$"); prbyte(lo); putc(' ');
|
|
putdst(); puts("hi=$"); prbyte(hi); putc(':');
|
|
xx = (lo == xx) ? #TRUE : #FALSE;
|
|
yy = (hi == yy) ? #TRUE : #FALSE;
|
|
psorfl(xx & yy);
|
|
}
|
|
|
|
void chksiz(aa,yy,xx) {
|
|
puts("\tChecking Stack Size\t");
|
|
puts("stksiz()\t");
|
|
zz, dsthi, dstlo = stksiz();
|
|
printf(zz, "Sts=$%x Size=$%w:");
|
|
if (zz == aa and dsthi == yy and dstlo == xx ) pass();
|
|
else {fail(); goto exit;}
|
|
}
|
|
|
|
void psorfl(aa) {if (aa) pass(); else {fail(); goto exit;}}
|
|
void pass() {putln(" Pass");}
|
|
void fail() {putln(" Fail");}
|
|
|
|
puts("Swapping Top and Second Entry\t");
|
|
puts("stkswp()\t");
|
|
f=stkswp(); printf(f,"bytes=%d:");
|
|
g=(f==12) ? #TRUE : #FALSE;
|
|
psorfl(f & g);
|
|
chkptr(&$801B);
|
|
|
|
puts("Dropping Swapped Entry off Stack\t");
|
|
puts("stkdrp()\t");
|
|
f=stkdrp(); printf(f,"bytes=%d:");
|
|
g=(f==4) ? #TRUE : #FALSE;
|
|
psorfl(f & g);
|
|
chkptr(&$8016);
|
|
|