X-Git-Url: https://git.ucc.asn.au/?a=blobdiff_plain;f=ROM2%2Fhelpers.c;h=f336ae103f20722be300430f9957b8662f8fd504;hb=a1106ee52492a26f91897578c0761d1aedf6b44c;hp=ead76da604044ce4bd7a10e869e9138eceb1717f;hpb=1e7218d1311dafb5c1c81e4c4ad64847432be0b5;p=uccvend-snackrom.git diff --git a/ROM2/helpers.c b/ROM2/helpers.c index ead76da..f336ae1 100644 --- a/ROM2/helpers.c +++ b/ROM2/helpers.c @@ -1,11 +1,63 @@ +#include "display_basic.h" #include "vend.h" -#define DELAY_MAGIC 20 /* FIXME: number of loops for ~ 1 millisecond (< 256) */ void delay(u16 ms) { + /* delay routine written in assembly so we know what we're really getting. + * each inner loop should take ~1 ms to execute. + * 15 cycles * (1/4.9152Mhz) * 327 = 0.997 ms + a little bit on the fringes. + * + * XXX - how do we know gcc isn't optimising this? it seems to optimise after + * parsing C -> asm, but before asm -> machine code. + */ + //asm volatile ("pshx\npsha\npshb\n"); /* save registers */ + asm volatile ("ldx %0\n" :: "m" (ms) : "x"); + asm volatile ( + "delay_loop:\n" + //" ldd #327\n" /* 3 */ + " ldd #150\n" /* 3 */ + "delay_inner_loop:\n" /* 15 cycles each */ + " cpd #0x0000\n" /* 5 */ + " beq delay_inner_loop_end\n" /* 3 */ + " subd #0x0001\n" /* 4 */ + " bra delay_inner_loop\n" /* 3 */ + "delay_inner_loop_end:\n" + " dex\n" /* 3 */ + " beq delay_out\n" /* 3 */ + " bra delay_loop\n" /* 3 */ + "delay_out:\n" ::: "x", "d"); + /*" pulb\n" + " pula\n" + " pulx\n");*/ +} + +u8 my_strlen(char* s) { + char *p = s; + while (*p) p++; + return p-s; +} + +void my_strncpy(char* dst, char* src, u8 max_size) { + u8 i; + for (i = 0; src[i] && i < max_size; i++) dst[i] = src[i]; + if (src[i] == 0 && i < max_size) dst[i] = 0; /* null terminator */ +} + +bool my_strncmp(char* a, char* b, u8 len) { u8 i; - for (;ms;ms--) { - for (i=0;i