thukumar, Aravindan <aravindan.muthuku...@intel.com>; mesa-
> > >>> d...@lists.freedesktop.org
> > >>> Cc: J Karanje, Kedar <kedar.j.kara...@intel.com>; Tamminen, Eero T
> > >>> <eero.t.tammi...@intel.com>
> > >>> Subject: Re: [
sts.freedesktop.org
>> Cc: J Karanje, Kedar <kedar.j.kara...@intel.com>; Tamminen, Eero T
>> <eero.t.tammi...@intel.com>
>> Subject: Re: [Mesa-dev] [PATCH v2] i965 : optimized bucket index calculation
>>
>> On 09/13/2017 11:43 PM, aravindan.muthuku...@i
ntel.com>; Tamminen, Eero T
> <eero.t.tammi...@intel.com>
> Subject: Re: [Mesa-dev] [PATCH v2] i965 : optimized bucket index calculation
>
> On 09/13/2017 11:43 PM, aravindan.muthuku...@intel.com wrote:
> > From: Aravindan Muthukumar <aravindan.muthuku...@intel.com>
>
Ian,
Rest all review comments noted, we'll get back, Thanks.
>-Original Message-
>From: mesa-dev [mailto:mesa-dev-boun...@lists.freedesktop.org] On Behalf Of
>Ian Romanick
>Sent: Friday, October 20, 2017 9:51 AM
>To: Muthukumar, Aravindan ; mesa-
>>
On 09/13/2017 11:43 PM, aravindan.muthuku...@intel.com wrote:
> From: Aravindan Muthukumar
>
> Avoiding the loop which was running with O(n) complexity.
> Now the complexity has been reduced to O(1)
>
> Algorithm calculates the index using matrix method.
> Matrix
ranje, Kedar <kedar.j.kara...@intel.com>; mesa-
> d...@lists.freedesktop.org
> Subject: RE: [Mesa-dev] [PATCH v2] i965 : optimized bucket index calculation
>
> Hi Reviewers,
> Please review and provide the comments on the second version of the
> patch.
>
> Thanks,
> Ar
.@intel.com
> >Sent: Thursday, September 14, 2017 12:13 PM
> >To: mesa-dev@lists.freedesktop.org
> >Cc: Muthukumar, Aravindan <aravindan.muthuku...@intel.com>; J Karanje,
> >Kedar <kedar.j.kara...@intel.com>
> >Subject: [Mesa-dev] [PATCH v2] i965 : optimized
hukumar, Aravindan <aravindan.muthuku...@intel.com>; J Karanje,
>Kedar <kedar.j.kara...@intel.com>
>Subject: [Mesa-dev] [PATCH v2] i965 : optimized bucket index calculation
>
>From: Aravindan Muthukumar <aravindan.muthuku...@intel.com>
>
>Avoiding the loop which was
From: Aravindan Muthukumar
Avoiding the loop which was running with O(n) complexity.
Now the complexity has been reduced to O(1)
Algorithm calculates the index using matrix method.
Matrix arrangement is as below:
Assuming PAGE_SIZE is 4096.
1*4096