[Liboil] ORC performance for NEON

[Prateek Mathur]

Hi All,
        I am very new to ORC and wanted to use it for some optimizations over NEON.
To start with I just wrote a simple float array addition program using ORC. 
Surprisingly the normally compiled version (which uses simple addition) works much much faster than the NEON version. I am not sure if I was able to utilize ORC properly or not.

C Code:
        float a[10];
        float b[10];
        float c[10];
        int i;
        
for(i=0;i<10;i++)
        {
                a[i]=3.14159*100*(i+1);
                b[i]=5.00956*10*i;
                //a[i]=100*i;
                //b[i]=1000*(i+1);
        }
        gettimeofday (&t1, NULL) ;
        for(i=0;i<10;i++)
        {
                c[i]=a[i]+b[i];
                //printf("\n\na[%d]=%f b[%d]=%f c[%d]=%f \n",i,a[i],i,b[i],i,c[i]);
        }




      
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.freedesktop.org/archives/liboil/attachments/20110104/5a847af2/attachment.htm>