similar to: [LLVMdev] Question about analysis at compile time

I've pretty much finished exposing all I wanted to llvm-c and the ocaml bindings for the soon to be released 2.7. Does anyone need any other functions exposed before the code freeze on the 7th?

On Fri, Mar 5, 2010 at 5:53 AM, George Giorgidze <giorgidze at gmail.com> wrote: > > Hi Erick, > > Can you make the following functions available in llvm-c. > > createStandardFunctionPasses > createStandardModulePasses > createStandardLTOPasses > > Thanks in advance, George This is a little tricky, so I need some advice from the community. First off, I'm

Erick Tryzelaar <erick.tryzelaar <at> gmail.com> writes: > > I've pretty much finished exposing all I wanted to llvm-c and the > ocaml bindings for the soon to be released 2.7. Does anyone need any > other functions exposed before the code freeze on the 7th? > Hi Erick, Can you make the following functions available in llvm-c. createStandardFunctionPasses

Hi, Can you add the following two publications from our group to the LLVM publications page. - *Alive-FP: Automated Verification of Floating Point Based Peephole Optimizations in LLVM [pdf] <http://www.cs.rutgers.edu/~santosh.nagarakatte/papers/alive-fp-sas16.pdf> *David Menendez, Santosh Nagarakatte, and Aarti Gupta *To Appear in the Proceedings of the 23rd Static Analysis

On Wed, Jul 21, 2010 at 9:50 AM, Jeffrey Yasskin <jyasskin at google.com> wrote: >> This (Unknown constant! in bitcode writer when -g is used) is a known >> bug in CloneModule, because it is not cloning MDNodes appropriately. > > What's the link to the bug report? Are you fixing it? PR 7689. Fixed in r109117. - Devang

Hi - I am not familiar with R. Could I ask you a quick question? When I read a file like this, I get an error. Not sure what I am doing wrong. I use a MAC. How do I specify a full path name for a file in R? Or do files have to reside locally? > KoreaAuto <- read.table(""/Users/ raviramaswamy/Documents/Rutgers/STT 586/HW1 Data.txt"") Error: unexpected numeric

I run large piece of code in JIT and it runs only marginallty faster with optimization levels 1,2,3. I think differences are within the margin or error. level user time 0 17339ms 1 16913ms 2 16891ms 3 16898ms Level is set with builder->setOptLevel(olev); Compilation time is excluded by taking the only top-level function address before the run

Quick question. How important are these? Are the errors recoverable and not a big deal, or are they actually a problem? I see a few of these randomly over the course of the day. Jan 15 10:04:04 gehenna13.rutgers.edu dovecot: IMAP(user): unlink(/rci/nqu/rci/u8/user/dovecot/.such and such maildir/.nfs00000000001e951000002b8d) failed: Device or resource busy Jan 15 10:04:04 gehenna13.rutgers.edu

In Unladen Swallow we (intend to) compile each function as we determine it's hot. To "compile" a function means to translate it from CPython bytecode to LLVM IR, optimize the IR using a FunctionPassManager, and JIT the IR to machine code. We'd like to include inlining among our optimizations. Currently the Inliner is a CallGraphSCCPass, which can only be run by the

Devang's work on debug info prompted this, thoughts welcome: http://nondot.org/sabre/LLVMNotes/ExtensibleMetadata.txt -Chris

https://bugzilla.mindrot.org/show_bug.cgi?id=2775 Bug ID: 2775 Summary: Improve kerberos credential forwarding support Product: Portable OpenSSH Version: 7.5p1 Hardware: Other OS: Linux Status: NEW Severity: enhancement Priority: P5 Component: Kerberos support Assignee:

Dear R-users, I am trying to develop a function that takes another function as an argument, changes its default values and returns a list of things, among which the initial function with its default arguments changed. An example of what i will like to obtain below: ## initial function myfun <- function(x, a=19, b=21){ return(a * x + b) } ## this is the function i will like to create ##

While using 1.1.13 and squat with local pine imap on Solaris 9 I had a random core dump today. I was doing a search in a maildir folder with about 2000 emails. Unfortunately, I haven't been able to reproduce it yet, but I wanted to send along the info anyways. Environment: # uname -a SunOS 5.9 Generic_122300-39 sun4u sparc SUNW,Sun-Blade-100 Backtrace: http://pastebin.com/f7aa8bb5 ~#

Hello, I am trying to modify my LLVM-based compiler to perform an initial, no-optimization compilation synchronously on startup and then perform an asynchronous, optimized recompilation in the background, and I am getting in one of the optimization passes. - I am using the official release of LLVM 2.8 - I have compiled LLVM with threading enabled; I am running llvm::llvm_start_multithreaded() on

I've got a suggestion for a refinement: Right now, we have classes like DILocation that wrap an MDNode* to provide more convenient access to it. It would be more convenient for users if instead of MDNode *DbgInfo = Inst->getMD(MDKind::DbgTag); Inst2->setMD(MDKind::DbgTag, DbgInfo); they could write: DILocation DbgInfo = Inst->getMD<DILocation>();

Hi all, I was just wondering when this update will trickle down into the Centos repo: http://rhn.redhat.com/errata/RHBA-2008-0611.html Obviously, it just came out yesterday, so I'm not expecting it to suddenly appear. ;) Just curious what the turn around time usually is for RHEL bug fixes that get released and when we should expect it. As a side note, does anyone know if there is a way

Hello everyone! My data is composed of 277 individuals measured on 8 binary variables (1=yes, 2=no). I did two similar cluster analyses, one on SPSS 18.0 and one on R 2.9.2. The objective is to have the means for each variable per retained cluster. 1) the R analysis ran as followed: > call data > dist=dist(data,method="euclidean") >

I am interested in type-based verification of LLVM IR in the areas of certified compilation and software verification. It seems to me that the LLVM IR type system is rather informal in the sense that there is no paper with a proper formalization of the type rules, and for example, a proof of soundness for well-formedness of the code. I would like to know if you are aware of any work in this

> Date: Wed, 26 Oct 2011 11:52:50 -0700 > From: Tanya Lattner <lattner at apple.com> > Subject: [LLVMdev] Release Notes: Volunteers needed > We need some volunteers to help with the 3.0 release notes. Traditionally, Chris has been the one to go > through all the commits (6 months worth!) and come up with a concrete list of things that have changed in 3.0. > Ideally,

We are doing a power analysis by generating noisy data sets according to a model, fitting the model to the data, and extracting a p-value. What is the best way to do this many times? We are just using for loops and it is too slow because we are repeating the analysis for many parameterizations. I can think of several ways to do this: for loop sapply using the plyr package using the lme4 package