Re: [PATCH] arc: Replace lkml.org links with lore

2021-12-15 Thread Kees Cook
On Mon, Feb 15, 2021 at 09:03:54PM -0800, Vineet Gupta wrote: > On 2/10/21 3:28 PM, Kees Cook wrote: > > As started by commit 05a5f51ca566 ("Documentation: Replace lkml.org > > links with lore"), replace lkml.org links with lore to better use a > > single source that's more likely to stay available

Re: [PATCH 2/9] lib/bitmap: implement bitmap_{empty, full} with bitmap_weight_eq()

2021-12-15 Thread Yury Norov
On Wed, Dec 15, 2021 at 12:41 AM David Laight wrote: > > From: Yury Norov > > Sent: 14 December 2021 19:43 > ... > > > > I think that for long bitmaps the most time consuming operation is moving > > data to L1, and for short bitmaps the difference between approaches is > > barely measurable. > > >

Re: [PATCH v2] ARC: mm: Update ARC_REG_*C_PTAG on each cacheline operation

2021-12-15 Thread Barbaros Tokaoglu
On 12/14/21 3:42 PM, Vladimir Isaev wrote: > On Dec 14, 2021 3:18 PM, Barbaros Tokaoglu wrote: >> For 16 kB data cache with 4 ways and 32 byte cache lines we have tag LSB >> [(128 locations for each way: 7 bits) + byte offset (32 bytes: 5 bits)] >> lower than page offset (13 bits for 8 kB pages).

[PATCH v3] ARC: mm: Update ARC_REG_*C_PTAG on each cacheline operation

2021-12-15 Thread Barbaros Tokaoglu
For 16 kB data cache with 4 ways and 32 byte cache lines we have tag LSB [(128 locations for each way: 7 bits) + byte offset (32 bytes: 5 bits)] lower than page offset (13 bits for 8 kB pages). So it is possible for PTAG to change even for single page loop. Hence update ARC_REG_*C_PTAG register on

RE: [PATCH 2/9] lib/bitmap: implement bitmap_{empty,full} with bitmap_weight_eq()

2021-12-15 Thread David Laight
From: Yury Norov > Sent: 14 December 2021 19:43 ... > > I think that for long bitmaps the most time consuming operation is moving > data to L1, and for short bitmaps the difference between approaches is > barely measurable. > > But hweght_long on each iteration can't be more effective than the cu