Array indexing, yes. Of course it is a lot of work.

Int casting, yes. We should have a macro or inline function for this.

Power of two, I'm not sure about that, it's one thing to profile. Dobson or 
someone made this modulo 2 wrap around for oscillator phase that is quite 
efficient, we may need to keep that.

Regards,
Mike

----- Original Message ----- 
From: "victor" 
To: "Developer discussions" 
Sent: Wednesday, April 16, 2008 4:35 AM
Subject: Re: [Cs-dev] Profiling


> But as far as I can remember many opcodes still use pointer arithmetic
> instead of array indexing? Should we not move everything to array access?
>
> Also I reckon we could try to save on int casting as that is one of the
> costly operations (esp. on windows).
>
> Another unrelated thing: is there any reason to keep the old power of two
> rule for table-access opcodes (table*, tablew, ...). I think we could
> safely move to floating-point indexing there without too many problems.
> What do you think?
>
> Victor
> ----- Original Message ----- 
> From: "jpff" 
> To: "Developer discussions" 
> Cc: 
> Sent: Wednesday, April 16, 2008 9:24 AM
> Subject: Re: [Cs-dev] Profiling
>
>
>> As far as I can remember Istvan and myself did a little profiling; it
>> was this that led to the code change from pointer arithmetic to array
>> access in the loops on ksmps.  Not much since of which I am aware.  I
>> have rarely used valgrind on it to look for memory problems.
>> ==John ffitch
>>
>> -------------------------------------------------------------------------
>> This SF.net email is sponsored by the 2008 JavaOne(SM) Conference
>> Don't miss this year's exciting event. There's still time to save $100.
>> Use priority code J8TL2D2.
>> http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone
>> _______________________________________________
>> Csound-devel mailing list
>> Csound-devel@lists.sourceforge.net
>> https://lists.sourceforge.net/lists/listinfo/csound-devel
>
>
> -------------------------------------------------------------------------
> This SF.net email is sponsored by the 2008 JavaOne(SM) Conference
> Don't miss this year's exciting event. There's still time to save $100.
> Use priority code J8TL2D2.
> http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone
> _______________________________________________
> Csound-devel mailing list
> Csound-devel@lists.sourceforge.net
> https://lists.sourceforge.net/lists/listinfo/csound-devel 


-------------------------------------------------------------------------
This SF.net email is sponsored by the 2008 JavaOne(SM) Conference 
Don't miss this year's exciting event. There's still time to save $100. 
Use priority code J8TL2D2. 
http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone
_______________________________________________
Csound-devel mailing list
Csound-devel@lists.sourceforge.net

Michael Gogins wrote:
> Array indexing, yes. Of course it is a lot of work.
> 
> Int casting, yes. We should have a macro or inline function for this.
> 
> Power of two, I'm not sure about that, it's one thing to profile. Dobson or 
> someone made this modulo 2 wrap around for oscillator phase that is quite 
> efficient, we may need to keep that.
> 


Not me, it is the original Vercoe code from way back when. The modulo 
form results in  code with no conditional tests, from which much of the 
efficiency is obtained. The difference (compared to "normal" table 
wraparound) is not trivial.

Richard Dobson


-------------------------------------------------------------------------
This SF.net email is sponsored by the 2008 JavaOne(SM) Conference 
Don't miss this year's exciting event. There's still time to save $100. 
Use priority code J8TL2D2. 
http://ad.doubleclick.net/clk;198757673;13503038;p?http://java.sun.com/javaone
_______________________________________________
Csound-devel mailing list
Csound-devel@lists.sourceforge.net