How are you doing DT? I can't find sources for DT anywhere.. even though
I downloaded Plex86, I'm new to CVS, and I can't get DocBook or whatever
to work...... if you're not too busy, would you tell me where I can
learn about what you're doing with DT? I can help with the theory. I'd
like to give you a program I wrote: it takes in a script file that is
about 140 lines or so, and it expands from that all possible binary
encodings for all Pentium instructions (minux MMX and FPU and anything
later than the Pentium) along with the coresponding instruction names,
and assembly language operands. It is extremely easy to use (as I have
done) the resulting binary tables for disassembling, and with work,
assembling. If we could devise up a pseudo-code language that models
exactly what each systems-level x86 instruction does, in terms of
certain 'axiom instructions' that we will make up, then, theoretically,
we could write a program that uses that data to, automatically, generate
C source code for a program that serves as a DT. Wouldn't that be nifty?

Question: does LOADALL exist on the Pentium MMX? On my machine, I seem
to be getting an INT6. But I heard it exists for a Pentium 60 MHz
machine, and I heard it only takes 15 cycles to complete. ???!


Kevin Lawton wrote:
> 
> Some notes from dt-testbed/proto2/README.  I haven't committed
> changes yet:
> 
> For a second effort at dynamic branches, I handcoded an assembly
> handler which performs the target address hash function and then
> searches each of four entries in the set.  If no match is found,
> the C handler code is then called.
> 
>                                         (DT/native) (for reference)
>                                            effort1  effort0
>   workload      microloops  native    DT   factor   factor
>   ----------------------------------------------------------------
>   NOP                         .52    5.90   11.3    [18.6]
>   add cascade     5          1.87    7.29    3.9    [ 5.9]
>   add cascade    10          3.59    9.16    2.6    [ 3.6]
>   add cascade   100         27.24   32.71    1.2    [ 1.3]
> 
> These numbers show a little better performance for dynamic branches.
> It took only about 5 loops through the add cascade to average out
> the slow-down factor to a similar level as 10 loops in the previous
> table.
> 
> I'll have a further into other possible enhancements.
> 
> -Kevin
> 
> --
> =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-
> Kevin Lawton                        [EMAIL PROTECTED]
> MandrakeSoft, Inc.                  Plex86 developer
> http://www.linux-mandrake.com/      http://www.plex86.org/

Reply via email to