2716
TI Z80 / Re: asmdream is waking up...
« on: December 13, 2011, 07:20:46 pm »
On calc or computer or manually?
This section allows you to view all posts made by this member. Note that you can only see posts made in areas you currently have access to. 2716
TI Z80 / Re: asmdream is waking up...« on: December 13, 2011, 07:20:46 pm »
On calc or computer or manually?
2717
TI Z80 / Re: asmdream is waking up...« on: December 13, 2011, 07:19:46 pm »
Wait, ASCII to tokens or tokens to ASCII?
2718
TI Z80 / Re: ASMComp« on: December 13, 2011, 04:08:16 pm »![]() ![]() 2719
TI Z80 / Re: asmdream is waking up...« on: December 13, 2011, 07:36:04 am »
I know I just took all of what I considered the most common equates and put it into one file and had the user define their own equates if they needed (and they could create their own). If you split it up into 5 files or whatever, will they be by some category?
2720
TI Z80 / Re: polygon-based 3D engine (with textures)« on: December 12, 2011, 06:57:04 pm »Now, I'll just use this threat as a project thread.Oh dear, there is no need to threaten ![]() Freudian slip? ![]() 2721
ASM / Re: ASM Optimized routines« on: December 12, 2011, 03:50:27 pm »
Yes, this was truly awesome getting to witness live amazingness while I also tried to create the same routine
![]() ![]() 2722
ASM / Re: 24 bit multiplication« on: December 12, 2011, 02:48:12 pm »
16-bit subtraction
Code: [Select] or a ;to make sure the c flag is reset. Not always necessary if you know the c flag will be reset 32-bit addition (you mean two 32-bit inputs?)Code: [Select] ;Inputs: Squaring and square rooting... I will think on it ![]() Also, I am working on a mini math library that will include RAM based math (so all the values will be in RAM). It seems like a few of these commands will need to rely on some memory. If they do, I suggest using the OP registers (11 bytes of RAM each). 2723
Casio Calculators / Re: Interesting discoveries in the updater (fxASPI/OSpdateDLL)« on: December 12, 2011, 02:12:17 pm »
Cool, that looks like it will be useful, though I don't know anything computer-wise
![]() Also, your grammar and syntax are great ![]() 2724
Grammer / Re: Grammer 2-The APP« on: December 12, 2011, 12:23:23 pm »
Oh, the LD was just purely data. I used the inString( command to search the data for a match. So if you abuse this, you could make a compiler!
![]() 2725
Grammer / Re: Grammer 2-The APP« on: December 12, 2011, 09:57:50 am »
fwahahaha
![]() ![]() 2726
TI Z80 / Re: [discontinued] polygon-based 3D engine (with textures)« on: December 11, 2011, 08:57:53 pm »
I think there is a reason why jacobly has an average of more than 1 uprate per 2 posts
![]() 2727
TI Z80 / Re: asmdream is waking up...« on: December 11, 2011, 05:59:26 pm »
It is one of the Lovely Sequences
![]() (I call them Lovely Sequences, I don't think anybody else does...) But yeah, Kerm seems to have made a decent job of accessing the Goto option without making the user go through the OS menu. Though, of course, that could be a hook, now that I think about it ![]() 2728
TI Z80 / Re: asmdream is waking up...« on: December 11, 2011, 03:05:32 pm »
That's okay, I have been looking at the code that is run when you actually press "Goto" and I am trying to see if there is a bcall that matches it. Maybe ask ThePenguin77 or KermM? I know DoorsCS has its own custom error routine and then lets you jump to the offending error.
2729
ASM / Re: 24 bit multiplication« on: December 11, 2011, 02:30:16 pm »
So with two-byte multiplication, you can take advantage of the fact that add hl,hl is the same as shifting hl left. It even gives you the carry! So in this case:
Code: [Select] ld hl,0 That will multiply DE times BC and return the result in DEHL. I will see if I can port a square root routine for 32-bit...EDIT: changed inc e to inc de 2730
ASM / Re: 24 bit multiplication« on: December 11, 2011, 01:07:43 pm »
Yes
![]() ![]() The rla at the beginning works because a starts at 0 so 0*0=0. |
|