similar to: [LLVMdev] Is this a bug with loop unrolling and TargetTransformInfo ?

Hi Hal, I did opt.exe -S -debug -loop-unroll -unroll-runtime=true -unroll-count=4 csShader.ll and it prints out: Args: opt.exe -S -debug -loop-unroll -unroll-runtime=true -unroll-count=4 csShader.ll Loop Unroll: F[build_cs_5_0] Loop %loop_entry Loop Size = 82 partially unrolling with count: 1 Thanks, Frances On Thu, Oct 15, 2015 at 9:35 PM, Hal Finkel <hfinkel at anl.gov>

Hi, I am trying to do loop unrolling with loops that don't have constant loop counter. It is highly appreciated if anyone can help me on this. What I want to do is to turn loop (n) { <loop body> } into loop (n/4) { <loop body> <loop body> <loop body> <loop body> } loop (n%4) { <loop

Hi all - I know this must be really easy to do, but I can''t for the life of me figure it out. I have about 100,000 rows I need to migrate over into rails using a migration. Right now, I select all of them out of the old database and do a series of: ... new.col = old.col ... new.save ... Problem is each one is it''s own transaction. And it''s slow. I''d

On Tue, 26 Jul 2016 16:21:00 +0100 (BST) John Hodrien <J.H.Hodrien at leeds.ac.uk> wrote: > On Tue, 26 Jul 2016, Gabriele Pohl wrote: > > > on all of my CentOS7 VMs on different hypervisors > > the config file e2fsck.conf contains the line > > > > broken_system_clock = 1 > > > > Do you see similiar /default/ settings on > > your machines? Is

I am looking for a function (or package) to plot histograms of directional data such as wind direction. I believe these are called rose diagrams. Is there an R script for this? If not, can it be constructed in a function calling primitive graphic calls (lines, circles, boxes or polygons)? The stars function is not quite right. -- David Finlayson Geomorphogist and GIS Specialist NearPRISM -

Per the Posting Guide, why didn't you post the reproducible R code example? On April 24, 2018 8:22:15 PM PDT, Donald Macnaughton <donmac at matstat.com> wrote: >I'm drawing a paneled histogram using the lattice package. I've >succeeded in >adding minor tick marks to the vertical axis, but I can't get the >desired >number of minor tick marks between the major

I'm drawing a paneled histogram using the lattice package. I've succeeded in adding minor tick marks to the vertical axis, but I can't get the desired number of minor tick marks between the major tick marks. I've attached a self-contained program to illustrate the problem. Thanks for your help, Don Macnaughton Here's my sessionInfo: R version 3.4.3 (2017-11-30) Platform:

Thanks Jeff, I attached a file with the program to my earlier email because the posting guide seemed to imply that non-binary attachments would work. But I see that the file was stripped off. I installed the program file on a web site, but when I downloaded it, the line breaks were stripped out. So I've included the program below: ------------------------------------------------------- #

Curious to know if anyone's created something similar to the following, if so and you'd care to share an AGI or dialplan, much appreciated. I will be eventually write a script to answer the nTH call. (if I can't find it (why reinvent wheels). Looking to do some testing sending anywhere between 50-200 calls to a machine. I'd like a Snom/Polycom/whatever to pick up after the nTh

Hi, on all of my CentOS7 VMs on different hypervisors the config file e2fsck.conf contains the line broken_system_clock = 1 I found this because on all of them, the root partition was not checked triggered by interval setting with tune2fs. Do you see similiar /default/ settings on your machines? Is it an issue only on VMs? I have no CentOS7 host on bare metal to compare. Thanks and cheers,

On Fri, Apr 24, 2020 at 4:35 PM Peter Crowther <peter.crowther@melandra.com> wrote: > > On Fri, 24 Apr 2020 at 21:10, Mauricio Tavares <raubvogel@gmail.com> wrote: >> >> Let's say I have libvirt >> >> [root@vmhost2 ~]# virsh version >> [...] >> >> Running hypervisor: QEMU 2.12.0 >> [root@vmhost2 ~]# >> [...] > > When

Hmnnn... This is the third version of R I have installed and I am stumped on this one. There is some unresolved external I cannot find... /opt/SUNWspro/bin/cc -v -o R.bin CConverters.o Rdynload.o RNG.o apply.o arithmetic.o array.o attrib.o bind.o builtin.o character.o coerce.o colors.o complex.o connections.o context.o cov.o cum.o dcf.o datetime.o debug.o devPS.o devPicTeX.o deparse.o

Let's say I have libvirt [root@vmhost2 ~]# virsh version Compiled against library: libvirt 4.5.0 Using library: libvirt 4.5.0 Using API: QEMU 4.5.0 Running hypervisor: QEMU 2.12.0 [root@vmhost2 ~]# running on centos 8 and then I have this card [root@vmhost2 ~]# virsh nodedev-dumpxml pci_0000_01_00_0 <device> <name>pci_0000_01_00_0</name>

> On Dec 14, 2017, at 20:28, Hal Finkel via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Would that address your use case? Or can you have null dereferenceable pointers in that address space, just not ones from alloca? I would like to clarify what “null” means exactly. One related thing I would like in the future is for the DataLayout to specify what numeric value is the

Some optimizations depend on whether alloca instruction always has non-zero value. Currently, this checking is done by isKnownNonZero() in ValueTracking, and it assumes alloca in address space 0 always has non-zero value but alloca in non-zero address spaces does not always have non-zero value. However, this assumption is incorrect for certain targets. For example, amdgcn---amdgiz target has

Hi all, Currently in the llvm middle-end, we disable some optimizations because we worry about the register pressure, (e.g. GVNHoist and ArgumentPromotion). However, in the architecture that are register-rich, e.g. FPGAs, we do not need to worry about the register pressure at all. For these architecures, we may want to optimization the LLVM IR without worrying about the register pressure. I

I know, I said a bad word -- analysis group. But it works pretty much the way I think we want here. We *always* want a TargetTransformInfo, and we have reasonable (conservative) stubs in place. We would just like the option of providing one from the target that has very clever implementations. I would propose that we make TargetTransformInfo be an analysis group, and provide

There seems to be a lot of interest recently in LTO. How do you see the situation of splitting the IR passes between per-TU processing and multi-TU ("link time") processing? -- Sean Silva -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130717/f5310a6e/attachment.html>

On Mon, Jul 29, 2013 at 4:24 PM, Hal Finkel <hfinkel at anl.gov> wrote: > > Out of curiosity, has anyone tried to optimize the pass ordering in some > (quasi-)automated way? Naively, a genetic algorithm seems like a perfect > fit for this. > This is the closest I've seen: http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/ However, it

I personally strong abhor this kind of thing:-) I guess I should be more open-minded. For pre-ipo phase, some passes should not invoke, say, any loop nest-opt, loop version, aggressive loop unrolling, vectorization, aggressive inling. The reasons are they will hinder the downstream optimizers if they kick in early. > Out of curiosity, has anyone tried to optimize the pass ordering in some