similar to: [LLVMdev] Problem of running data structure analysis (DSA) on Linux kernel

On 9/13/07, Haifeng He <hehaifeng2nd at gmail.com> wrote: > Hi, > > I ran into a problem when running DSA on Linux kernel (the Kernel > version I used is > 2.4.31). The analysis was aborted when it tried to do > DSNode::mergeTypeInfo on some data structure in the kernel. I have > filed a bug report at http://llvm.org/bugs/show_bug.cgi?id=1656. It is possible there was a

Hi, I am curious about if the current LLVM implementation can handle Linux kernel (or any particular version of Linux kernel). The first question I have is that, how to create LLVM bytecode of Linux kernel using LLVM gcc frontend. What changes should I make to the compiling process Linux kernel? Secondly, is it possible to compile the assembly code in Linux kernel into LLVM bytecode? I noticed

Hi, I have a question about memory page tables in Xen. As far as I understood, every modification to page table will go through Xen(hypervisor). Is it so that all page tables are actually allocated in Xen(hypervisor) instead of guest OS(domain)? Also, is it the case that Xen(hypervisor) needs to maintain a page table for each process running in every domain? Thanks Haifeng

I can say that it does not for me,running x86_64, I have been generating errors for submission by testing on a number of gnu utilities starting with binutils. Patrick On Aug 31, 2007, at 6:11 PM, "Haifeng He" <hehaifeng2nd at gmail.com> wrote: Hi, I am curious about if the current LLVM implementation can handle Linux kernel (or any particular version of Linux kernel). The

Hi All, can anyone tell me where I can find the sources for the llva-emu project? I've tried to contact  Michael Brukman or Brian Gaeke but no reply. thank you for any help, dacian -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130719/94fcf74b/attachment.html>

On Apr 3, 2007, at 10:55 AM, Andrew Lenharth wrote: > On 4/2/07, Fabian Scheler <fabian.scheler at gmail.com> wrote: >> Hello everybody, >> >> I'm curious whether there have been any attempts to perform >> performance analysis on the LLVA level. I am interested in the >> derivation of flow-facts (loop bounds etc. - what about the >>

On Fri, 31 Aug 2007, Patrick Flannery wrote: > I can say that it does not for me,running x86_64, I have been generating > errors for submission by testing on a number of gnu utilities starting > with binutils. If you run into problems, please file bugs. -Chris > On Aug 31, 2007, at 6:11 PM, "Haifeng He" <hehaifeng2nd at gmail.com> wrote: > > Hi, > > I

Hi Konstantin, good point. but I my intention is to have something like the llva project. Basically I would like to define a machine that looks as if it has processors running natively llvm code. And when that runs enhance the llvm byte code with some specific instructions. Besides this if I make my measurements on the running of llvm bytecode I can test several platforms simultaneously because I

A following question about how to install "poolalloc". I checked out poolalloc from svn. But I had a problem of installing it. When I tried to run "configure" with options "--with-llvmsrc" and "--with--llvmobj" pointing to where the source of my llvm and objs dir are (/home/usr/Tools/llvm, e.g.), "configure" complained error message

On 7/19/13 3:20 AM, Herbei Dacian wrote: > > > Hi All, > can anyone tell me where I can find the sources for the llva-emu project? The llva-emu code is extremely old and, as I recall, not very feature-filled. It was also done for a class project (I don't think it was used for the original LLVA publication, and it wasn't used for any of the subsequent LLVA/SVA publications

Hello everybody, I'm curious whether there have been any attempts to perform performance analysis on the LLVA level. I am interested in the derivation of flow-facts (loop bounds etc. - what about the value-range-propagation pass I read about on this list some time ago) but even more I am interested in exec-time modeling (how long does it take to execute a bunch of LLVA instructions on

> > LLVA specifically is refering to a research project offshoot of llvm. > > LLVM instructions do not have 1:1 mappings to native instructions > > (sometimes multiple llvm instructions map to fewer native insts, > > sometimes the other way around). > > That's correct, and furthermore, LLVA (now called SVA = Secure > Virtual Architecture) uses essentially the

On 9/19/13 9:53 AM, Herbei Dacian wrote: > > Hi Konstantin, > good point. > but I my intention is to have something like the llva project. If you want something like the LLVA project for user-space applications, then you basically want to use LLVM as-is. The only things missing are the instructions that replace certain in-line assembly sequences that cannot be represented by

On 4/2/07, Fabian Scheler <fabian.scheler at gmail.com> wrote: > Hello everybody, > > I'm curious whether there have been any attempts to perform > performance analysis on the LLVA level. I am interested in the > derivation of flow-facts (loop bounds etc. - what about the > value-range-propagation pass I read about on this list some time ago) > but even more I am

Hi all, If it's not the right place to ask, please forgive me. Currently I'm working on a new operating system concept, called "Om". The first feature would be Android-like apps, coming in *.opk files that would contain all needed resources and source-code expressed in LLVM-IR assembly language. http://sett.com/openminded-os/uid/88508 How does it sound ? Julien

Chris Lattner wrote: > On Fri, 18 May 2007, Keith Whitwell wrote: >> I'm interested in understanding the extent of the assumptions which llvm >> makes about the types of hardware it is capable of targeting. > > Different pieces of the compiler make different assumptions. In > particular, the code generator we ship is good for targetting certain > classes of

On Mon, 15 May 2006, Nai Xia wrote: > In other words, if I only use -steens-aa and the data_XXXs are all > external global variables( and so inComplete ), Sounds right! > the call to printf will > make the same effect, which I have tested it. > > Am I right ? :) If you've tested it then, yes you're right :). I haven't played with this stuff for a long time,

Andrew Lenharth wrote: > On Fri, Aug 7, 2009 at 4:45 PM, Patrick Alexander > Simmons<simmon12 at cs.uiuc.edu> wrote: > >> I'm iterating over all LoadInst and StoreInst-type Instructions in a >> Function, and getNodeForValue() is sometimes returning NULL. Why is >> this happening? Shouldn't every load from or store to memory correspond >> to some

Hello, everyone! I'm writing an automatic memory leak fixing tool recently. For my task, I'm using the DSA (Data Structure Analysis) for alias analysis. In my task, when I detect a memory leak, I need to find a pointer (in C) 'must-alias' with the corresponding resource. In DSA, I think if two Value* point to the same DSNode, they 'may-alias'. If two Value* point to

All, We are considering removing some branches and tags in the conversion process from CVS to SVN. We don't want to do this in a vaccuum, so please read carefully. A deficiency in the cvs2svn script causes it to bloat the Subversion repository (significantly, as in 10x) in the conversion of branches and tags. We can minimize the impact of this by only keeping branches and tags that we really