search for: hoult

I see. My CPU is a general Core i7 Ivy bridge CPU. On Fri, Apr 10, 2015 at 6:48 PM, Bruce Hoult <bruce at hoult.org> wrote: > I suppose that depends on your CPU. Do you even have a CPU that supports > operations on <N x i1> as packed bits in vector registers? > > > On Sat, Apr 11, 2015 at 12:43 PM, zhi chen <zchenhn at gmail.com> wrote: > >> Yes, bu...

Yes, but my point is that there would be some overhead to do cast the <N x i1> vectortype to an integerNty. Is there any good way to check not all of these N bits in the vectortype are 0s? On Fri, Apr 10, 2015 at 5:37 PM, Bruce Hoult <bruce at hoult.org> wrote: > Sure, if you actually just want an i1 saying whether or not at least one > bit is set to 1, then comparing against 0 is the right thing. > > That should end up generating a unary TST instruction on ISAs that have > one. > > On Sat, Apr 11, 2...

...e you are > > trying to run and how often you need to change it. > > > > > > > > *From:*llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] > > *On Behalf Of *Jim Grosbach > > *Sent:* Tuesday, August 19, 2014 2:12 PM > > *To:* Bruce Hoult > > *Cc:* llvmdev at cs.uiuc.edu > > *Subject:* Re: [LLVMdev] C Backend Ressurected > > > > > > > > This is part of the problem with the C backend. This is very much not > > what it’s useful for, yet it very much looks like it is. The LLVM IR is > > t...

...one (or a subset of) the full set. So it's possible that a particular slow sequence of inline instructions you are transforming would be controlled by "libm", and a different slow sequence of inline instructions would be controlled by some other flag (or flags). -Warren From: bruce.hoult at gmail.com [mailto:bruce.hoult at gmail.com] On Behalf Of Bruce Hoult Sent: Tuesday, October 3, 2017 10:05 AM To: Hal Finkel Cc: Ristow, Warren; llvm-dev at lists.llvm.org Subject: Re: [llvm-dev] Trouble when suppressing a portion of fast-math-transformations On Tue, Oct 3, 2017 at 4:03 AM, Hal...

...ip_v1’ or ‘-mcpu=chip_v2’, and the mnemonic ‘LD32’ is only valid when compiling for ‘chip_v1’, while ‘LD.32’ is only valid when compiling for ‘chip_v2’. But I will study the mnemonic aliasing carefully to see if it does provide what I need. All the best, MartinO From: bruce.hoult at gmail.com [mailto:bruce.hoult at gmail.com] On Behalf Of Bruce Hoult Sent: 08 July 2016 12:32 To: Martin J. O'Riordan <Martin.ORiordan at movidius.com> Cc: LLVM Developers <llvm-dev at lists.llvm.org> Subject: Re: [llvm-dev] Dynamic selection of assembly mnemonic strings Do i...

Thanks, Bruce. So, what is the easiest way to check if there is any bit set to 1 in a <N x i1> vector type? I used bitcast instruction to cast it into "iN" first and them compare iN to 0. Do you have a better way to do it? Thanks again. On Fri, Apr 10, 2015 at 5:22 PM, Bruce Hoult <bruce at hoult.org> wrote: > LLVM doesn't have a "logical neg" (or "not") operator. That's a C thing. > Do a compare against 0 to create an i1 result, then zero extend the i1 to > the size of integer result you want. > > > On Sat, Apr 11, 2015 a...

On Jun 18, 2014, at 3:05 PM, Bruce Hoult <bruce at hoult.org> wrote: > On Thu, Jun 19, 2014 at 8:29 AM, Owen Anderson <resistor at mac.com> wrote: > Numerical analysis is hard. Every numerics expert I have ever worked with considers trying to re-invent floating point a cardinal sin of numerical analysis. Just don’t do...

On Mon, May 14, 2018 at 5:15 PM, Carsten Mattner via llvm-dev < llvm-dev at lists.llvm.org> wrote: > On 5/14/18, Bruce Hoult <bruce at hoult.org> wrote: > > If you use svn+ssh then hopefully ssh is at least gzipping that for the > > transfer. A .tgz of the src (after moving the .git repo out of the > > directory) is 111 MB. > > I used the https url you wrote and doubt it got rewritten to ssh...

...sometimes preferable in my experience although it depends on the complexity of the code you are trying to run and how often you need to change it. From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Jim Grosbach Sent: Tuesday, August 19, 2014 2:12 PM To: Bruce Hoult Cc: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] C Backend Ressurected This is part of the problem with the C backend. This is very much not what it’s useful for, yet it very much looks like it is. The LLVM IR is target dependent, including things like structure layout, pointer size, and other AB...

...ht be clearer, instead of using 'libm', to use something like 'trans' (for transcendental functions). That does seem clearer. ‘trans’ is definitely good with me. -Warren From: Hal Finkel [mailto:hfinkel at anl.gov] Sent: Tuesday, October 3, 2017 5:13 PM To: Ristow, Warren; Bruce Hoult Cc: llvm-dev at lists.llvm.org Subject: Re: [llvm-dev] Trouble when suppressing a portion of fast-math-transformations On 10/03/2017 05:02 AM, Ristow, Warren wrote: >>> I'd like to emphasise in the latter one: "This option also relaxes the precision of >>> commonly use...

If I understand correctly, LLVM is a *typed* assembly language. Could I just look for a pointer type plus an integer type followed by a dereference? That would catch both a[n] and *(a+n). Gry On Tue, Apr 7, 2015 at 10:46 PM, Bruce Hoult <bruce at hoult.org> wrote: > Far too late. That would need to be in Clang. > > On Wed, Apr 8, 2015 at 5:36 PM, Gry Gunvor <gry.gunvor at gmail.com> wrote: >> >> Normally for int n unknown at static time, "a[n]" and "*(a+n)" results >> in a...

I never thought I’d see the day when someone proposed treating the 6502 like a GPU… —escha > On Feb 12, 2016, at 6:30 AM, Bruce Hoult via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > I think it would be sufficient to pick 8 or 16 pairs of zero page locations as the "registers". Who needs 128 registers, unless you're also doing inter-procedural register allocation? True, that would be a good idea, so...

...ouble) { entry: call void @FooBar() %tmp = fadd double %0, %1 ret double %tmp } ; ModuleID = 'My_Module' define double @sum(double, double) { entry: call void @FooBar() %tmp = fadd double %0, %1 ret double %tmp } declare void @FooBar() On Tue, Feb 17, 2015 at 9:07 PM, Bruce Hoult <bruce at hoult.org> wrote: > Naturally you can, since C can. As usual, it's instructive to see what > Clang generates e.g. > > typedef int fn(int); > > int test(fn f, int val){ > return f(val); > } > > ----------- > > Compiled with: clang callfuncpt...

...not got interesting findings. It requires some knowledge of LLVM backend to fully understand the *.td files. I will get some background and keep searching. Of course I appreciate if anyone with such experience can point the concrete locations. Regards, Hu Hong On 17 October 2016 at 22:20, Bruce Hoult <bruce at hoult.org> wrote: > For experimental purposes, you should be able to just go > into lib/Target/X86 and remove the patterns in .td files (or maybe some > .cpp .. I'm not familiar with the X86 mechanisms) that map to base+index > addressing modes. > > Then the c...

...ead support using LLVM style in LLD. I also had an offline discussion and many people wanted to have one coding style in all LLVM projects. So I'm convinced that we should do that. I'm going to create a patch to rename all variables if no one objects. On Mon, Oct 6, 2014 at 3:10 PM, Bruce Hoult <bruce at hoult.org> wrote: > On Tue, Oct 7, 2014 at 8:54 AM, Rui Ueyama <ruiu at google.com> wrote: > >> would touch all the lines. Diff is not powerful enough to trace the >> history beyond variable renaming. svn blame would become useless. >> > > "...

On Sat, Mar 4, 2017 at 1:19 PM, Bruce Hoult <bruce at hoult.org> wrote: > If your target does not have SHL then why don't you simply disable > converting MUL to SHL? > > MUL is converted to SHL by target independent passes when second operand is power of 2. -Vivek > > On Sat, Mar 4, 2017 at 8:22 AM, vivek pandy...

On Thu, Sep 29, 2016 at 9:02 PM, Jonas Wagner via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Hi, > > I am going to use LLVM for my Thesis. Is there any LLVM Virtual Machine to >> download. I have some problem with installing and configuring the LLVM, >> please let me have the virtual machine link to download if there is any. >> > > I don't know of

On Mon, May 14, 2018 at 3:02 AM, Carsten Mattner via llvm-dev < llvm-dev at lists.llvm.org> wrote: > On 5/13/18, Bruce Hoult via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Yes, it's not bad. You can actually reduce the size of the .git > > directory to 597 MB by running "git repack -a -d -f --depth=250 > > --window=250". This takes less than 5 minutes on a 16 core Xeon. > &g...

...t; ------------------------------ >> >> *From: *"David Blaikie via llvm-dev" <llvm-dev at lists.llvm.org> >> *To: *"Rafael Espíndola" <rafael.espindola at gmail.com> >> *Cc: *"llvm-dev" <llvm-dev at lists.llvm.org>, "Bruce Hoult" < >> bruce at hoult.org> >> *Sent: *Tuesday, March 22, 2016 10:18:03 AM >> *Subject: *Re: [llvm-dev] Need help with code generation >> >> >> >> On Tue, Mar 22, 2016 at 4:27 AM, Rafael Espíndola < >> llvm-dev at lists.llvm.org> wrote:...

On 5/14/18, Bruce Hoult <bruce at hoult.org> wrote: > On Mon, May 14, 2018 at 3:02 AM, Carsten Mattner via llvm-dev < > llvm-dev at lists.llvm.org> wrote: > >> On 5/13/18, Bruce Hoult via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> > Yes, it's not bad. You can actually red...