similar to: [Job Ad] Open positions @ Graphcore

Hi Jon, Job postings are ok on the llvm mailing list if and only if they are related to LLVM somehow. Please clarify if this is the case - or if not, please refrain from future posts. Thanks! -Chris > On Apr 12, 2018, at 3:11 AM, Jon Chesterfield via llvm-dev <llvm-dev at lists.llvm.org> wrote: > > Graphcore is a well funded startup that is developing a new processor

Dear all, From what I can gather, there is currently no way for loop strength reduction to target pre- and post-increment addressing modes. This is because the target hook `isLegalAddressingMode` in TargetTransformInfo.h doesn’t allow for pre- and post-increment. There is in fact a comment to that effect on the function prototype: “TODO: handle pre/postinc as well” (see

Hi, I'm looking for some feedback on pain points people have with FileCheck in terms of missing features to help people interested in working on FileCheck to prioritize the work accordingly. I am personally interested in improving FileCheck on 2 issues whenever time permits it: * being able to test for consecutive lines in arbitrary order, i.e. something akin to CHECK-DAG blocks where

Thanks for the suggestions. I think the naming the whole line idea is okay, but it feels a bit clunky. Either we'd have to have a syntax that FileCheck would recognise without caring about the prefix (which seems to be against the ethos of FileCheck, and also makes it less flexible), or in the case I'm referring to, we'd have to have an extra line that does nothing other than define

Any kind of variable definition on a CHECK-NOT line would seem like it would be asking for trouble. Do we allow text variable definitions on a NOT? False fails are better than false matches. Given that it will fail on a line where you'd expect a match, or possibly for the line to be skipped, it's a matter of refining the match expression, which is something that you have to do sometimes

​Hi all, > I feel it might be confusing to have a CHECK becomes effectively a CHECK-NOT, > especially if the RUN line is far from the CHECK line (which is often the case when > a single RUN line drives several groups of CHECK directives (e.g. code generation > tested for several functions for a specific feature, like PIC). You also loose control > on where the NOT should be:

Before addressing the CHECK-NOT case, I’m still unclear about the DAG case. What should the first DAG line match? The regex matching would first attempt to match “10 12” but the expression evaluation would fail; so the DAG candidate wouldn’t match; does this mean the DAG matching does not continue searching, and the test fails? Or would we restart the search…. where? With “0 12” (skipping only

Hi all, There have been a few cases recently where I've noticed two test cases in the same lit test that do the same thing except invert the CHECK, to show that something is NOT present. I'm talking about something like the following: # RUN: llvm-sometool --print-string | FileCheck %s --check-prefix=STRING # RUN: llvm-sometool --no-print-string | FileCheck %s --check-prefix=NO-STRING #

I ran into an LLVM/Clang crash when attempting to do the following: 1. Build Clang from the release/9.x branch source. 2. Use the Clang from (1) to build clangd on the release/9.x branch, with LLVM_ENABLE_MODULES=On. I wrote a script to reproduce the crash: https://gist.github.com/modocache/ac366ca9673b93bb21e75d3e72162608 At the above URL, you'll find a script `repro.sh` that reproduces

Howdy, folks. I'm having a problem finding a way to auto-record calls (both incoming and outgoing). I know how to make it so either party can initiate recording, but I want it done as soon as both ends are connected (or prior to that if that's what it takes). It's probably right in front of me and I'm just missing it. Any help would be much appreciated. Thanks, Jay

When I run lighttpd 1.4.10 [on Mac OS X] the socket file is called ''fcgi.socket-'', versus ''fcgi.socket-0'' that I get under 1.4.8. Further, when the FCGI daemon quits, the file does not get deleted, and I cannot restart my Rails app until I manually remove it. Can anyone confirm before I raise a bug at lighttpd.net?

Hi, I am a new user of Wine, and I am having trouble running the programme 'Accu-Chek Compass'. It is a programme for diabetics, that downloads data from a meter, and then graphs it in all sorts of ways. The Programme installs correctly, but when I try to run it, it just flashes on the screen for a split second, and exits. Any help would be nice.... Plod.

Hi everyone! I have 2 hosts + 1 ISCSI device. I want to create a shared storage repository and both hosts use together. I wont use NFS. prepared sr: xe sr-create host-uuid=xxx content-type=user name-label=NAS1 shared=true type=iscsi device-config:target=xxxx device-config:targetIQN=xxxx hosts see the iscsi device: scsi4 : iSCSI Initiator over TCP/IP scsi 4:0:0:0: Direct-Access NAS

Hi, Hexagon has a MIR pass for detecting loops that map onto hardware support. I think a similar approach would be viable for my target but am put off by the complexity of determining whether a given loop is legal to transform. Instead, I would like to pass the responsibility for determining legality onto the C programmer who is assumed sufficiently familiar with the architecture. I think this

Greetings, list! My boss would like some statistics on how many calls are answered out of specific queues during a given time period, and I'm not sure how exactly to obtain those stats. Here's how our queue system works. 1) Call comes in and enters our 'ring' queue where the phones ring for 15 seconds (caller hears the standard ring tone). 2) After 15 seconds, the caller

What should a well behaved back end do with a load or store with alignment less than the natural alignment of the type? I believe C++ considers such access to be UB. I'm not sure what the IR semantics are. I think my options are: - Delete the operation / use undef - Lower as if it is naturally aligned - Lower via inefficient code that assumes align 1 Thanks, Jon -------------- next part

Hi all, Many of our lit tests use FileCheck and a tool like llvm-readobj to check properties of a section header/symbol/etc. A typical (pseudoised for brevity) output to match against might be something like the following: Symbols [ Symbol { Name: foo Value: 0 Type: Function Section: .foo (1) } Symbol { Name: bar Value: 1 Type: Object Section: .foo (1) } ]

There was talk a few weeks ago about the possibility of a Tk-based user management tool that never happened. I'm planning on trying to do this myself. What features were to be in the one that never materialized? What features might people want in it? To begin, the program will only be able to do things that can be done straight through the existing command line tools (net, smbpasswd,

Taking the address of a function inhibits optimisations for that function. Essentially any ABI changes are unavailable if we can't adjust the call site to match. The case of interest here is when a given function is called directly and indirectly, and we don't want the latter to impose a cost on the former. One approach to avoid the ABI constraint cost is to extract/outline the body of an

Video of the Chicago RailsConf keynotes are now online. At least two of them, anyway. So far Martin Fowler''s (Chief Scientist from ThoughWorks) and Dave Thomas'' (author of Pragmattic Programmer and Programming Ruby among others) can be found at blog.scribestudio.com . You can find the general release schedule of the other speakers here: