Re: Dynamic Typing Efficiency

> Thanks everyone. I am going to try to implement a static analysis
> algorithm along with static versions of all of my opcodes so that they
> can be used when possible.
>
> For now I am using an nxn matrix lookup table. Like so:
>
> enum { INT, BOOL, REAL, STRING }
> enum { II, IB, IR, IS, BI, BB, BR, BS, RI, RB, RR, ... }
>
> char typelook[][] =
>
> INT BOOL REAL STRING
> INT II IB IR IS
> BOOL BI BB BR BS
> REAL RI RB RR RS
> STRING SI SR SR SS
>
> This way the comparison is simpler.
>
> switch (typelook[type1][type2])
> {
> case II:
>
> case IB:
>
> case IR:
>
> .
> .
> .
> }


That's probably the right approach. switch and case probably wins out
over arrays of pointers to functions for modern cpu and
caches. Although if you look at the assembly code you will probably
find a chained list of comparisons and jumps ! So I would put your
most common cases first !


It would be good to see some analysis of switch and case verses array
of pointers to functions on GCC and MS VC++. Maybe I will have a hack
at it at some point in the future.


Most if not all VM's that I have looked at use switch and case.


Aaron

Return to the comp.compilers page.
Search the comp.compilers archives again.