in this situation, is assembly faster? or same speed?

TI-BASIC
2->kTheta
or
Assembly
B_CALL OP1Set2
B_CALL StoTheta
RET
 if ASM's faster, that means TI BASIC games/program will be faster if i use some ASM prgm to store and add/sub/multiply/divide the floating point variables?(A~Z and kTheta)?

Asm should be a bit faster, as basic is interpreted. But basic should be a lot smaller in a large program.

well, maybe. A handwritten routine that is well optimized (and there are people here very good at that ) would definitely be faster. And it would probably be worth it, especially for larger calculations.

You won't ever be going over 32768, right? I think that's the 84's bit limit for integers without some complications

that should be fine, I think. very optimized as compared to bcalls, but you might have some trouble getting it back without using the stotheta bcall.

lol, so after i do all the math, store HL to the OP1, and then use StoTheta?

Quote from: TiAddict on June 27, 2011, 05:05:42 pm

Oh i see.

and no, so i should use HL to do the math?

Yep, that'll probably make it a couple thousand times faster. Literally.

so creating Real Variable is faster than storing?

so just make sure you delete it if necessary, by hand. That way the program doesn't have to check.

I think I should just point out that bcalls aren't as slow as what people think. Yes, if you are using bcall(_multAbyE) inside a djnz loop, then you are wasting some time. But the time wasted is relative.

The whole bcall process takes about 1000 t-states. In 6.5MHz mode, that's .00015 sec. If you do 100 bcalls, that's only .01 sec.

In this case, since you are making a basic library, there's no reason why you shouldn't use bcalls. The bcalls aren't slow compared to basic. However, floating point numbers vs. HL makes a big difference. If you don't need decimals, then HL is definitely the way to go.