similar to: Andresen Algorithm

> > Date: Mon, 14 May 2018 14:26:13 -0400 > From: Kenneth Adam Miller via llvm-dev <llvm-dev at lists.llvm.org> > To: llvm-dev <llvm-dev at lists.llvm.org> > Subject: [llvm-dev] Andresen Algorithm > Message-ID: > <CAK7rcp_yXA79UuLvcD6LPMQBvi9tTpOGAcuWZ > Ux1tFKTyvuh2Q at mail.gmail.com> > Content-Type: text/plain; charset="utf-8" >

Actually I figured out that it is: opt -cfl-anders-aa *.ll But now I noticed that I need the graph that it computes, and it doesn't seem to emit that. On Wed, May 16, 2018 at 5:19 PM, Kenneth Adam Miller < kennethadammiller at gmail.com> wrote: > Is there a particular way to run a specific alias analysis that is already > implemented on a .ll file produced by clang -S

Is there a particular way to run a specific alias analysis that is already implemented on a .ll file produced by clang -S -emit-llvm? On Mon, May 14, 2018 at 7:36 PM, Soham Sinha via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Date: Mon, 14 May 2018 14:26:13 -0400 >> From: Kenneth Adam Miller via llvm-dev <llvm-dev at lists.llvm.org> >> To: llvm-dev <llvm-dev at

Usually you need to add the -analyze option, to dump the analysis results. On Wed, May 16, 2018 at 9:09 PM, Kenneth Adam Miller via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Actually I figured out that it is: > > opt -cfl-anders-aa *.ll > > But now I noticed that I need the graph that it computes, and it doesn't > seem to emit that. > > On Wed, May 16,

Got this error: Printing analysis 'Inclusion-Based CFL Alias Analysis': Pass::print not implemented for pass: 'Inclusion-Based CFL Alias Analysis'! On Thu, May 17, 2018 at 12:14 AM, Alexandre Isoard < alexandre.isoard at gmail.com> wrote: > Usually you need to add the -analyze option, to dump the analysis results. > > On Wed, May 16, 2018 at 9:09 PM, Kenneth Adam

Hello all, I'm having trouble getting this analysis to print out it's graph of aliases. I am processing an example C file into llvm ir, like this: int main(void) { int x=1, y=2, z=3; int *p; int **p1, **p2; if (x==z) { //0x100000f40 p=&x; p1=&p; x*=2; *p1+=z; } } clang -S -emit-llvm example.c -o example.ll Then, I am trying to run the Andersen alias

On Thu, May 17, 2018 at 3:09 PM, Friedman, Eli <efriedma at codeaurora.org> wrote: > On 5/17/2018 10:10 AM, Kenneth Adam Miller via llvm-dev wrote: > >> Hello, >> >> >> I've looked around in the documentation, and I can't see anywhere where >> there is a backend plugin capability for LLVM. I'd like to be able to get >> the output of the

I read a lot of white papers, but is there not any open source implementation of SFI or artificial diversity? I google around, but I can't find anywhere anything regarding what I could openly download. In the same respect, I would also like to make an innovation proposal to create such an endeavor if there is not one already. -------------- next part -------------- An HTML attachment was

Awesome! Thanks so so much! I'm very interested in doing some work with compilers. Yeah, I'm considering writing a research proposal where I work for JIT-SFI, SFI Evasion Technique and Mitigation, and a few other things. Considering your experience working on modifying llvm, what would you say would be a topic where I could start out doing some good work on, either in a new direction or

Program counter - EIP, RIP for x86/64. I need to obtain it and pass it as an argument to the function that calculates an ordinal from it. I think that there must be some way to use the bitcode language to place byte values at a designated offset. Or use the command line to specify the section and offset for the data. On Sun, Apr 1, 2018 at 6:00 PM, Brenda So <sogun3 at gmail.com> wrote:

On 5/17/2018 12:22 PM, Kenneth Adam Miller wrote: > > On Thu, May 17, 2018 at 3:09 PM, Friedman, Eli > <efriedma at codeaurora.org <mailto:efriedma at codeaurora.org>> wrote: > > On 5/17/2018 10:10 AM, Kenneth Adam Miller via llvm-dev wrote: > > Hello, > > > I've looked around in the documentation, and I can't see >

On Thu, 11 Oct 2018, Damien Miller wrote: > On Thu, 11 Oct 2018, Adam Eijdenberg wrote: > > > Thanks for looking into. I wasn't able to get the patch to apply > > cleanly to the portable source for whatever reason, so I manually made > > the changes and got a little further. I now get past the "no mutual > > signature algorithm" client message, and get

On Thu, May 17, 2018, 3:31 PM Friedman, Eli <efriedma at codeaurora.org> wrote: > On 5/17/2018 12:22 PM, Kenneth Adam Miller wrote: > > > On Thu, May 17, 2018 at 3:09 PM, Friedman, Eli <efriedma at codeaurora.org> > wrote: > >> On 5/17/2018 10:10 AM, Kenneth Adam Miller via llvm-dev wrote: >> >>> Hello, >>> >>> >>>

Hello, I've looked around in the documentation, and I can't see anywhere where there is a backend plugin capability for LLVM. I'd like to be able to get the output of the instruction selector along with the LLVM IR, or perhaps instrument that. Is there any capability to have a backend plugin in LLVM at all? Perhaps what is necessary is to manually drive the backend from the

Thank you so much! What about discovering the instruction pointer value? Also, does anybody know how to embed an artifact as a resource in a binary? I'd like to have two text sections, and have one copied in from another binary. On Sun, Apr 1, 2018 at 2:15 PM, Brenda So <sogun3 at gmail.com> wrote: > Hi, > > You can write it as if you are writing an optimization pass: >

If you can write what you want to output in C with asm statements, clang can show you what the IR should look like. On Mon, Apr 2, 2018 at 7:35 AM, Kenneth Adam Miller via llvm-dev < llvm-dev at lists.llvm.org> wrote: > Program counter - EIP, RIP for x86/64. I need to obtain it and pass it as > an argument to the function that calculates an ordinal from it. > > I think that

On Fri, Jun 3, 2016 at 11:53 AM, Ahmed Bougacha <ahmed.bougacha at gmail.com> wrote: > -llvmdev at cs.uiuc.edu, that list isn't in use anymore. > > On Wed, Jun 1, 2016 at 4:48 PM, Kenneth Adam Miller via llvm-dev > <llvm-dev at lists.llvm.org> wrote: > > Hello all, > > > > I would like to restrain the compiler that I build on my local box from >

On Thu, Oct 11, 2018 at 10:41 AM Damien Miller <djm at mindrot.org> wrote: > On Wed, 10 Oct 2018, Adam Eijdenberg wrote: > > We see this error on the client side: > > > > debug1: kex_input_ext_info: server-sig-algs=<rsa-sha2-256,rsa-sha2-512> > > ... > > debug1: Offering public key: RSA-CERT SHA256:xxx /path/to/key > > debug1: send_pubkey_test: no

The bitcode is only a representation of the IR, which is in SSA form. And SSA form assumes an infinite amount of registers, which is not offered by x86. When bitcode gets assembled/compiled to machine language, it breaks down the SSA form into non-SSA format. Personally I don't know how to use bitcode language to achieve what you want to do. The closest thing I can think of is the llvm-MC

Is there an easy straightforward way to concatenate to types into a single larger type? Such as from i8 i8 to i16? -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20180605/5d370c40/attachment.html>