similar to: [LLVMdev] Re: llvm -> array bound checking at compile time

Hi Reid, --- Reid Spencer <rspencer at reidspencer.com> wrote: > On Tue, 2006-12-19 at 17:32 -0800, Roman Levenstein wrote: > > But since the new llvm-dis cannot disassemble, I cannot use > > llvm-upgrade, since I need a way to produce an *.ll file. > > If you can't do as Bill suggested (get the latest llvm-gcc and > compile > it), you can use this approach:

On Mar 12, 2007, at 10:34 AM, Fabian Scheler wrote: > After playing around a bit with LLVM, I > decided to use LLVM, because of its great documentation, its clean and > straight-forward design and it because it seems to be easily > applicable also for beginners. A gratuitous plug for a recent research project: If you use LLVM, you can also get a compiler called SAFECode that (a)

Hello everybody, I'm developing a source code transformation system for real-time systems currently, i.e. I want to map the application (a set of event handlers) to a run-time or operating system semi-automatically (if anybody is interested in the background - see below, of course, comments are welcome there, too ;-)). Therefore, I have to be able to express dependencies between different

On Thu, Oct 20, 2011 at 2:37 AM, Shea Levy <shea at shealevy.com> wrote: >. The > (probably impossible) end-goals to this project would be a) that every > program which passes its checks would be as safe to run in kernel mode > with full memory access as it would be in user mode That would be a very useful thing to have for embedded systems. Some such as uCLinux run ports of

On 10/19/11 11:58 PM, Eli Friedman wrote: > On Wed, Oct 19, 2011 at 8:20 PM, Shea Levy<shea at shealevy.com> wrote: >> 2. Are target-specific behaviors documented for each supported target? > When anything has target-specific behavior, that fact should be > documented. Beyond that, if you have a question about what some > construct is supposed to do, please ask. What I

Dear All, Is there a simple way to print the results of the various DSA analysis passes (similar to the ones found in the Pool Allocation papers)? I'm working with a modified DSA analysis pass and would like to know DSNodes it's creating on a particular function. Thanks in advance. -- John T. -- John T. Criswell Research Programmer University of Illinois at Urbana-Champaign

(Note to self: learn to scan the full digest for later messages in a thread before replying to an earlier message.) Ed, Your reply to John answered some of my questions, but not all, and raised a new one: > Maybe I should have been a bit clearer; we're really interested in full > memory and type safety. We want to harden the system against memory > corruption vulnerabilities.

Hi, When I login to a Ubuntu 10.04 virtual machine instance running in Xen through SSH, the console''s lines are clipped at the middle section of my 15.6" screen. I''ll be glad if somebody can suggest a fix. This is turning out to be very annoying. Thanks, Kowshik _______________________________________________ Xen-users mailing list Xen-users@lists.xensource.com

On Thu, 2008-03-27 at 09:51 -0600, John Regehr wrote: > Hey, you need to be careful with this reasoning or else you'll end up > implementing a whole new language, compiler, and OS. > > Oh wait nevermind :). Don't forget prover. :-) shap

Hi Shuo, I am CCing your questions to the LLVM developers list so others can reply or correct me. >I have a few questions about LLVM: >(1) The LLVM tutorial says LLVM can be used in architecture research. If >I want to run my program on an instruction set defined by myself, is LLVM >a right tool to do that? > I don't think so. >In this aspect, is LLVM similar to

Hello all, thanks for the feedback! It sounds like you are planning to follow the approach of Joshi, Nelson and > Randall ("Denali: A Goal-directed Superoptimizer") in that you don't intend > to exhaustively enumerate all possible code sequences, and see if they are > the same as the original only better; but instead start from the original > code > sequence and

Dear LLVMers, This email is intended for those interested in path-sensitive analysis, integer overflow analysis, static analysis, and (perhaps) loop invariant computation. Traditionally, such analyses have been considered too expensive to be practical, and were mostly an academic curiosity. The core of the problem is the lack of adequate automated decision procedures which could quickly

Hello all, please tell me, is it possible (at least theoretically) to circumvent bug 622 [1] by using GRUB instead of /boot/loader to load FreeBSD kernel? Or it is silly idea: even if we bypass /boot/loader we will not be able to run FreeBSD kernel in a HVM-domain on a Intel-based host for some other reason? As far as I know, GRUB can''t load FreeBSD kernel directly, but only can

> Don't forget prover. :-) Say on that note here's something that I want to see: a formal semantics for LLVM in for example higher order logic. This would probably not be that difficult. The problem that this solves is that current verified compiler efforts appear to be highly specific to both the language and the target. Once the semantics exists, you can either prove once and

On 4/9/07, Domagoj Babic <babic.domagoj at gmail.com> wrote: > > > Traditionally, such analyses have been considered too expensive to be > practical, and were mostly an academic curiosity. The core of the > problem is the lack of adequate automated decision procedures which > could quickly determine whether a set of constraints is satisfiable or > not, and if it is

Hi, I am brand new to LLVM, or more precisely, trying to be. I'm getting stuck on compiling LLVM. - I tried installing on a Mint 18.1 VM with 6GB RAM, and the builds of some large executables were killed by the OOM killer. I finally realized that I needed to build using shared libraries, and succeeded. This was in November. - I put aside my LLVM project, and just got back to it. I got stuck

IMO super optimizer would yield less benefits on LLVM compared to other compilers. If you check the patch of the instcombine pass, you'll find out people keep dragging "correct" optimization out, not because the optimization violates the semantic of LLVM IR, but it will generate wrong code sequences when lowering to machine code. An example: %3 = fcmp %1, %2 %6 = fcmp %4, %5 %7 =

Hi there, Does LibVirt support Microsoft HyperV Server 2012? If not, what is plan to support the same? Thanks. -- Tejas Sumant -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://listman.redhat.com/archives/libvirt-users/attachments/20130329/27534b8a/attachment.htm>

Hi, Let me start a new thread for this. I contacted the Grub people, and they seem more interested in creating a native Xen port of Grub than piggybacking the Mini-OS environment usin kexec as I tried. But they need some documentation on the Xen "firmware" to assess the task at least. What could be given to them apart from hvc_xen.c and xen-blkfront.c in the Linux sources?

Hi, Let me start a new thread for this. I contacted the Grub people, and they seem more interested in creating a native Xen port of Grub than piggybacking the Mini-OS environment usin kexec as I tried. But they need some documentation on the Xen "firmware" to assess the task at least. What could be given to them apart from hvc_xen.c and xen-blkfront.c in the Linux sources?