similar to: [LLVMdev] Waterloo Region LLVM Social!

Displaying 20 results from an estimated 2000 matches similar to: "[LLVMdev] Waterloo Region LLVM Social!"

2013 Aug 19
1
[LLVMdev] Waterloo Region LLVM Social - date and location announced!
We're having the first LLVM Social for those in or nearby the Kitchener/Waterloo/Cambridge area of Ontario! WHERE: Huether Hotel Barley Works in Uptown Waterloo [1] WHEN: Thursday, August 27, 7:00 PM I've reserved an area of the bar for the event under "LLVM Social". If you need any help, call me at 519-496-4224. Thanks to everyone who participated in the Doodle poll. We
2013 Aug 28
0
[LLVMdev] Reminder: Waterloo Region LLVM Social tomorrow night!
As a reminder, we're holding the first ever Waterloo Region LLVM Social tomorrow night. WHERE: Huether Hotel Barley Works in Uptown Waterloo [1] WHEN: Thursday, August 29, 7:00 PM I've reserved an area of the bar for the event under "LLVM Social". If you need any help, call me at 519-496-4224. See you tomorrow! Stefanus -- Stefanus Du Toit <stefanus.du.toit at
2012 Nov 15
2
[LLVMdev] Code ownership proposal
I'd like to propose that Michael Liao become the code owner for the x86 backend. Michael has been a very frequent contributor to the x86 backend for the last few months, and is working on the x86 backend full-time. Note that Michael is out of the office until Nov 29 with very limited email/internet access. Thanks, Stefanus -- Stefanus Du Toit <stefanus.du.toit at intel.com> Intel
2008 Nov 10
0
[LLVMdev] LLVM-related compiler position at RapidMind
Hot on the heels of our LLVM product announcement earlier today, we have just announced a new compiler development position at RapidMind. This position will involve working directly with and on LLVM and other compiler technologies. If you're interested, please email us your resume at jobs at rapidmind.com. If you have specific experience working with, or contributing to, LLVM, please
2009 Apr 03
0
[LLVMdev] Shuffle combine
Hi Nicolas, On 2-Apr-09, at 6:04 PM, Nicolas Capens wrote: > Thanks for verifying this. Could you patch this or should I open a > new bug report and find a generic solution first? I don't have write access so the best I could do would be to submit a patch, and I'm crazy busy at the moment. I actually think the check I described below is fine and would fix this bug (but
2009 Apr 02
2
[LLVMdev] Shuffle combine
Hi Stefanus, Thanks for verifying this. Could you patch this or should I open a new bug report and find a generic solution first? Cheers, Nicolas From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Stefanus Du Toit Sent: woensdag 1 april 2009 18:59 To: LLVM Developers Mailing List Subject: Re: [LLVMdev] Shuffle combine On 1-Apr-09, at 12:42
2009 Apr 01
0
[LLVMdev] Shuffle combine
On 1-Apr-09, at 12:42 PM, Nicolas Capens wrote: > Hi Stefanus, > > Thanks for the info. I still think it’s a bug though. Take for > example a case where the vectors each have four elements. The values > in Mask[] can range from 0 to 7, while HLSMask only has 4 elements. > So LHSMask[Mask[i]] can go out of bounds, no? Good point! One easy way to fix this would be to use:
2009 Mar 12
0
[LLVMdev] List archives not updating
Stefanus Du Toit wrote: > The llvm-dev archives (and other llvm/clang mailing list archives) on > the web don't seem to have any new messages since some time Monday > night. > It seems to be working for me. Does it work for you now? -- John T. > Stefanus > > -- > Stefanus Du Toit <stefanus.dutoit at rapidmind.com> > RapidMind Inc. > phone: +1
2008 Aug 01
1
[LLVMdev] Generating movq2dq using IRBuilder
Hi Stefanus, I'm not if using MMX instructions when doing operations on 64-bit vectors is so terrible? With x86-64 you have double the registers, but it comes at the cost of longer instruction encodings. So there's probably no benefit using SSE. Or am I missing something? Cheers, Nicolas -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at
2008 Nov 10
0
[LLVMdev] RapidMind/LLVM Announcement
On Nov 10, 2008, at 12:01 PM, Stefanus Du Toit wrote: > For those curious about uses of LLVM, we just officially announced our > adoption of LLVM in our products: > > http://www.rapidmind.com/News-Nov10-08-LLVM-OpenCL.php I'm thrilled to read an official announcement of that! Do you use LLVM only for static code generation or are you also doing any late (e.g.,
2008 Jul 22
2
[LLVMdev] Extending vector operations
On 21-Jul-08, at 7:33 PM, Eli Friedman wrote: > On Mon, Jul 21, 2008 at 1:21 PM, Stefanus Du Toit > <stefanus.dutoit at rapidmind.com> wrote: >> 1) Vector shl, lshr, ashr >> > I have a rough draft of a patch for this that works reasonably well > for simple cases... I don't think I really have the time to finish it > properly, but I'll clean it up a bit and
2009 Apr 01
2
[LLVMdev] Shuffle combine
Hi Stefanus, Thanks for the info. I still think it's a bug though. Take for example a case where the vectors each have four elements. The values in Mask[] can range from 0 to 7, while HLSMask only has 4 elements. So LHSMask[Mask[i]] can go out of bounds, no? Cheers, Nicolas From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of Stefanus Du
2009 Oct 15
1
[LLVMdev] [cfe-dev] Developer meeting videos up
Hi Chris, > From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] > On Behalf Of Chris Lattner > Sent: Thursday, October 15, 2009 11:45 AM > To: Anton Korobeynikov > Cc: clang-dev Developers; LLVM Developers Mailing List > Subject: Re: [LLVMdev] [cfe-dev] Developer meeting videos up > > Unfortunately, we found out at the last minute that Apple has a
2009 Mar 12
2
[LLVMdev] List archives not updating
The llvm-dev archives (and other llvm/clang mailing list archives) on the web don't seem to have any new messages since some time Monday night. Stefanus -- Stefanus Du Toit <stefanus.dutoit at rapidmind.com> RapidMind Inc. phone: +1 519 885 5455 x116 -- fax: +1 519 885 1463
2012 Nov 15
0
[LLVMdev] Code ownership proposal
On Nov 15, 2012, at 7:45 AM, "Du Toit, Stefanus" <stefanus.du.toit at intel.com> wrote: > I'd like to propose that Michael Liao become the code owner for the x86 backend. > > Michael has been a very frequent contributor to the x86 backend for the last few months, and is working on the x86 backend full-time. > > Note that Michael is out of the office until Nov
2009 Feb 25
4
[LLVMdev] Reassociating expressions involving GEPs
On 30-Jan-09, at 6:14 PM, Eli Friedman wrote: > On Fri, Jan 30, 2009 at 3:03 PM, Stefanus Du Toit > <stefanus.dutoit at rapidmind.com> wrote: >> The computation of %base then becomes loop-invariant and can be >> lifted out. >> >> What's the best way to add this optimization to LLVM? > > Probably the best place is LICM itself... only loop
2008 Sep 30
2
[LLVMdev] Generalizing shuffle vector
I agree further generalization seems like a very good idea. But I'd like to see what Mon Ping proposed implemented first so we have a better idea of the implementation cost. Thanks, Evan On Sep 30, 2008, at 6:44 AM, Stefanus Du Toit wrote: > Hi Mon Ping, > > Generalizing shufflevector would be great. I have an additional > suggestion below. > > On 29-Sep-08, at 11:11
2012 Nov 15
3
[LLVMdev] Code ownership proposal
I would like to nominate Nadav Rotem for the x86 backend. Michael On Nov 15, 2012, at 10:51 AM, Chris Lattner <clattner at apple.com> wrote: > > On Nov 15, 2012, at 7:45 AM, "Du Toit, Stefanus" <stefanus.du.toit at intel.com> wrote: > >> I'd like to propose that Michael Liao become the code owner for the x86 backend. >> >> Michael has been
2008 Nov 10
3
[LLVMdev] RapidMind/LLVM Announcement
For those curious about uses of LLVM, we just officially announced our adoption of LLVM in our products: http://www.rapidmind.com/News-Nov10-08-LLVM-OpenCL.php Thanks for all the support so far on here, we look forward to continuing to work with LLVM! -- Stefanus Du Toit <stefanus.dutoit at rapidmind.com> RapidMind Inc. phone: +1 519 885 5455 x116 -- fax: +1 519 885 1463
2009 Jan 30
2
[LLVMdev] Reassociating expressions involving GEPs
Hello, We've run across the following missed optimization: in the attached loop (addind.c/addind-opt.ll) there's a lookup into an array (V) using an indirect index (coming from another array, WI[k]) offset by a loop- invariant base (l). The full addressing expression can be reassociated so that we add the offset l to V's base first, and then add the indirect part. This makes