Re: speed of octave symbol table code

[David Bateman]

John W. Eaton wrote:
> On 23-Oct-2007, David Bateman wrote:
>
> | It really depends on the real life code and the number of symbol table
> | lookups per function, and as you say how many symbols per function. What
> | is the average number of symbols per function with your code for "make
> | check".
>
> The numbers are not necessarily unique for each function because
> different paths through the code may result in different numbers of
> symbols being stored in the table and distribution of chains.  In any
> case, the average for unique calls is around 38 symbols, but if we
> weight the average by the number of calls made for a given number of
> symbols/distribution of chains, the average drops to around 17.  So
> there are many calls to functions with just a few symbols.  So maybe
> we could at least cut the table size down to 64.
>
> jwe
>
>   
That will already help significantly..

D.

-- 
David Bateman                                address@hidden
Motorola Labs - Paris                        +33 1 69 35 48 04 (Ph) 
Parc Les Algorithmes, Commune de St Aubin    +33 6 72 01 06 33 (Mob) 
91193 Gif-Sur-Yvette FRANCE                  +33 1 69 35 77 01 (Fax) 

The information contained in this communication has been classified as: 

[x] General Business Information 
[ ] Motorola Internal Use Only 
[ ] Motorola Confidential Proprietary