search for: strided

Hello, I understand the need for a proper stride setting when formatting a filesystem on a RAID device. However, is there any problem in using a stride setting when formatting a filesystem on a regular non-RAID, non-SSD, just plain-vanilla-single-disk block device? I'm sure there isn't any benefit to it, but I'm curious if there is any harm. The reason I ask is I'm looking at

...e Subject properly. Resending with the correct Subject so that the thread is captured properly. -----Original Message----- From: Saito, Hideki Sent: Wednesday, June 15, 2016 1:39 PM To: 'llvm-dev at lists.llvm.org' <llvm-dev at lists.llvm.org> Subject: RE: [llvm-dev] [Proposal][RFC] Strided Memory Access Ashutosh, First, I'm all for enabling general stride load/store support for all targets --- should be just a matter of proper cost modeling. For that matter, we should enable general gather/scatter support for all targets. About the specific approach taken by this RFC: 1) It...

Dear all, In our compiler we use a modified version LLVM Polly, which is very sensitive to proper code generation. Among the number of limitations, the loop region (enclosed by phi node on induction variable and branch) is required to be free of additional memory-dependent branches. In other words, there must be no conditional "br" instructions below phi nodes. The problem we are facing

...r that Ashutosh is considering that. Thanks for reading. Hideki -----Original Message----- From: Saito, Hideki Sent: Friday, June 17, 2016 4:40 PM To: 'Nema, Ashutosh' <Ashutosh.Nema at amd.com> Cc: llvm-dev <llvm-dev at lists.llvm.org> Subject: RE: [llvm-dev] [Proposal][RFC] Strided Memory Access Vectorization >I agree this can be done with Gather/Scatter intrinsic as well, once we enable these we need to place right costing. During costing we have to estimate the cost of load[s], >store[s] and shuffle[s] and in CG prepare we have to lower them. In the proposed approac...

...Ashutosh > -----Original Message----- > From: Saito, Hideki [mailto:hideki.saito at intel.com] > Sent: Saturday, June 18, 2016 6:00 AM > To: Nema, Ashutosh <Ashutosh.Nema at amd.com> > Cc: llvm-dev <llvm-dev at lists.llvm.org> > Subject: RE: [llvm-dev] [Proposal][RFC] Strided Memory Access Vectorization > > > >Vectorizer's output should be as clean as vector code can be so that analyses > and optimizers downstream can > >do a great job optimizing. > > Guess I should clarify this philosophical position of mine. In terms of vector > co...

On Mon, Dec 11, 2017 at 6:14 PM, Roland McGrath <roland at hack.frob.com> wrote: > > On Mon, Dec 11, 2017 at 3:50 PM Rahul Chaudhry via gnu-gabi <gnu-gabi at sourceware.org> wrote: >> >> A simple combination of delta-encoding and run_length-encoding is one of the >> first schemes we experimented with (32-bit entries with 24-bit 'delta' and an >>

...ogle.com; renato.golin at linaro.org; mssimpso at codeaurora.org; kv.bhat at samsung.com; Shahid, Asghar-ahmad <Asghar-ahmad.Shahid at amd.com>; sanjoy at playingwithpointers.com; mzolotukhin at apple.com; Michael Kuperstein <mkuper at google.com> Subject: RE: [llvm-dev] [Proposal][RFC] Strided Memory Access Vectorization One common concern raised for cases where Loop Vectorizer generate bigger types than target supported: Based on VF currently we check the cost and generate the expected set of instruction[s] for bigger type. It has two challenges for bigger types cost is not always cor...

The driver doesn't consider framebuffer pitch and offset, leading to a wrong display in case offset != 0 or pitch != width * bpp. Fix it. Signed-off-by: Gerd Hoffmann <kraxel at redhat.com> --- drivers/gpu/drm/bochs/bochs.h | 2 +- drivers/gpu/drm/bochs/bochs_hw.c | 14 ++++++++++---- drivers/gpu/drm/bochs/bochs_kms.c | 3 ++- 3 files changed, 13 insertions(+), 6 deletions(-)

I'm seeing the following failures with "make check" (x86-32 linux): FAIL: test/CodeGen/X86/fold-mul-lohi.ll Failed with exit(1) at line 2 while running: llvm-as < test/CodeGen/X86/fold-mul-lohi.ll | llc -march=x86-64 | not grep lea leaq B, %rsi leaq A, %r8 leaq P, %rsi child process exited abnormally FAIL:

Hi, is there any place where the possible values for the strides in the yuv_buffer structure is specified? or just in the source code? ;) I could compress a video with, lets say, yuvbuf.y_stride = yuvbuf.y_width, so the yuvbuf.y[0] really started in the start of the y channel data. I watched the video in several players, and everythings' ok. But, when programming the decompress process, the

I agree that a single vector index is sufficient for many cases. Matt Pharr (from the ISPC compiler), showed me an interesting case where there is a single pointer into an array. In this case we need to have two indices, where the first index is zero. Once the basic patch is in, we can start looking at adding support for arrays and multiple indices. Nadav -----Original Message----- From: David

Fixed. Thanks. Evan On Feb 11, 2008, at 2:35 AM, Duncan Sands wrote: > I'm seeing the following failures with "make check" (x86-32 linux): > > FAIL: test/CodeGen/X86/fold-mul-lohi.ll > Failed with exit(1) at line 2 > while running: llvm-as < test/CodeGen/X86/fold-mul-lohi.ll | llc - > march=x86-64 | not grep lea > leaq B, %rsi > leaq

Hi, I am trying to educate myself on prefetching/readahead algorithm for Lustre''s read. For a starter I only have two simple questions. 1 - Does Lustre detect linear or random I/O pattern or it always triggers readahead? 2 - If readahead is triggered, how many pages are read in addition to what is necessary? Thanks, Arifa.

Fixes FDO#55294. --- src/gallium/drivers/nv30/nv30_miptree.c | 3 +-- src/gallium/drivers/nv50/nv50_miptree.c | 3 +-- 2 files changed, 2 insertions(+), 4 deletions(-) diff --git a/src/gallium/drivers/nv30/nv30_miptree.c b/src/gallium/drivers/nv30/nv30_miptree.c index 5a9a63b..9700fa8 100644 --- a/src/gallium/drivers/nv30/nv30_miptree.c +++ b/src/gallium/drivers/nv30/nv30_miptree.c @@ -56,8

All, I have a question about calculating the value for the -E stride option to mke2fs. The mke2fs man page says stride=stripe-size Configure the filesystem for a RAID array with stripe-size filesystem blocks per stripe. So stride = size of stripe/blocksize. The size of a stripe is the RAID chunk size * the number of drives in the RAID. My question: are parity disks

Hi Evan, In -relocation-model=static mode, those tests are now getting code like this leaq A, %rsi movss %xmm0, (%rsi,%rdx,4) instead of this: movss %xmm0, A(,%rdx,4) This is specifically what these tests were written to catch :-). Running them with -relocation-model=pic is hiding the real bug. Dan On Feb 11, 2008, at 11:22 PM, Evan Cheng wrote: > Fixed.

On 23 October 2013 23:05, Arnold Schwaighofer <aschwaighofer at apple.com>wrote: > A reduction is something like: > > for (i= …) { > r+= a[i]; > } > return r; > Ok, so "reduction" is just a reduction in the map-reduce sense, and nothing else. You don’t need to transform them in the legality phase. Believe me ;). Look > at how we handle stride one

Fixed. However, I wonder if we are doing the right / smart codegen for static codegen. AMD64 ABI document seems to indicate rip relative addressing should be used even in this case (see page 38). You know about about Linux addressing mode than I do. Please check. Thanks, Evan On Feb 12, 2008, at 10:10 AM, Dan Gohman wrote: > Hi Evan, > > In -relocation-model=static mode, those

I''ve looked long and hard for an answer to this and am stuck. I have setup a Windows XP DomU on Xen 3.2-1 running on Debian and I can connect fine to the instance via VNC but I get no networking within the windows instance as it says the IP address conflicts with another on the network. All my linux instances network fine, and I''m confused as to the issue. Can anybody provide

On 23 October 2013 16:05, Arnold Schwaighofer <aschwaighofer at apple.com>wrote: > In the examples you gave there are no reduction variables in the loop > vectorizer’s sense. But, they all have memory accesses that are strided. > This is what I don't get. As far as I understood, a reduction variable is the one that aggregates the computation done by the loop, and is used outside the loop. In my example, I'm aggregating a computation in an array and returning this array for later use, what am I missing here?...