similar to: Calculating the power of a negative number

Dear R users, I had a research question which involves a simultaneous equation system, one is the common continuous dependent variable, y1, say wage, or log wage, another one is a latent variable, y*, which I only observe up to a ordinal scale, say attitudes toward a problem, taking values as y2= 1, 2, 3 or 4. Both of them have other exogeneious variables. I have been search on internet for

I'm testing some different formulations of pairwise interaction point processes in Spatstat (version 1.11-6) using R 2.5.0 on a Windows platform and I wish to simulate them using the Metropolis-Hastings algorithm implemented with Spatstat. Spatstat utilizes Fortran77 code with the preprocessor RatFor to do the Metropolis-Hastings MCMC, but the Makefile is more complicated than any I have

I thought about saying this in v1.2.beta1 release annoouncement, but looks like it'll take a few more days. So I've moved to Blacksburg, Virginia and I'm now working for Mailtrust the rest of this year. Here's some talk about it: http://mailtrust.com/blog (A bit stupid looking picture, but then again all my pictures seem to be that way so I didn't bother getting a new one

I thought about saying this in v1.2.beta1 release annoouncement, but looks like it'll take a few more days. So I've moved to Blacksburg, Virginia and I'm now working for Mailtrust the rest of this year. Here's some talk about it: http://mailtrust.com/blog (A bit stupid looking picture, but then again all my pictures seem to be that way so I didn't bother getting a new one

Hi Xin, Thank you for your reply! I have tried the 3 alias analyses you have mentioned on LLVM 3.5: 1) $ opt -globalsmodref-aa -aa-eval < xxx.bc > /dev/null (May-alias response 100%) 2) $ opt -tbaa -aa-eval < xxx.bc > /dev/null (May-alias response 100%) 3) $ opt -cfl-aa -aa-eval < xxx.bc> /dev/null (Unknown command line argument '-cfl-aa') It seems that they are not

Dear all, I was wondering if there are some reliable alias analyses build on top of LLVM other than basicaa. Thank you! Zhiyuan -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20150407/db07dba3/attachment.html>

Hi, I am learning R by reading R source code. Here is one question I have about the optim function in R. The context : In the optim.R, after all the prep steps, the main function call call is made via : .External2(C_optim, par, fn1, gr1, method, con, lower, upper). So, it seems to me, to follow what is going on from here, that I should read the optim function in \src\library\stats\src\optim.c

Dear all, I am trying to reproduce the "Percent May Alias" result described in PLDI 07's paper "Making Context-Sensitive Points-to Analysis with Heap Cloning Practical For The Real World" (http://llvm.org/pubs/2007-06-10-PLDI-DSA.html ). However, my "Percent May Alias" for all the benchmarks is much greater, especially "bzip2". The DSA code I use is

Hi, I am writing a loop pass to replace the backedge with an edge from latch to exit. Now I just replace the terminator of latch with another BranchInst, and the loop will not be a loop after my pass. However, it turns out a failure of loopverify after executing my pass: opt: ~/llvm/llvm-trunk/include/llvm/Analysis/LoopInfoImpl.h:297: void llvm::LoopBase<N, M>::verifyLoop() const [with

Dear John, I intend to implement the improvements on DSA. After running DSA on SPEC, I found DSA gives low precision for mcf and bzip2. I have checked the most imprecise c files in mcf an found that the code seems to be a mixture of "PHI" and "GEP" instructions. Could you please give me some hints about what the big picture of the improvement should be and how to start? Thank

Sorry for forgetting to reply all... It works! Thank you very much! But I also wonder how do you know this function will work while there are no documents noticing that. I try learning LLVM by reading its code, but soon feel lost in so many functions. Just like I have many tools, but don't know which to use and what difference it could make. Is there some better ways to learn LLVM? On Wed,

I have two related variables, each with 16 points (x and Y). I am given variance and the y-intercept. I know how to create a regression line and find the residuals, but here is my problem. I have to make a loop that uses the seq() function, so that it changes the slope value of the y=mx + B equation ranging from 0-5 in increments of 0.01. The loop also needs to calculate the negative log

Duncan, here is part of the assembly around the problem area. I used gcc -S -flto to generate the .s file, llvm-as on the .s fiile will show error: invalid cast opcode for cast from 'i40' to 'float' %638 = trunc i40 %637 to float %633 = bitcast i8* %632 to float* %634 = bitcast float* %633 to i40* %635 = load i40* %634, align 1 %636 = shl i40 %635, 7 %637 = ashr i40

On May 7, 2013, at 8:26 PM, zhiyuan yang <sjtu.yzy at gmail.com> wrote: > Hi, > > I am writing a loop pass to replace the backedge with an edge from latch to exit. > Now I just replace the terminator of latch with another BranchInst, and the loop will not be a loop after my pass. However, it turns out a failure of loopverify after executing my pass: > > opt:

Hi ZY, On 11/05/13 22:21, Zhiyuan Ren wrote: > Duncan, > > here is part of the assembly around the problem area. I used gcc -S -flto to > generate the .s file, llvm-as on the .s fiile will show error: invalid cast > opcode for cast from 'i40' to 'float' %638 = trunc i40 %637 to float > > %633 = bitcast i8* %632 to float* > %634 = bitcast float* %633 to

This does not use reshape/reshape2, but it is pretty straightforward. Assuming X is your example data: > Y <- split(X[, 2], X[, 1]) > vals <- sapply(Y, length) > pad <- max(vals) - vals > Y2 <- lapply(seq_along(Y), function(x) c(Y[[x]], rep(NA, pad[x]))) > names(Y2) <- names(Y) > X2 <- do.call(cbind, Y2) > X2[, 1:6] 1957 1958 1959

Duncan, Thanks for getting back to me. I am not sure how to find the original bitcode (and related Ada source code) that causes the truncate. This is the error message that gcc gave me when I tried to compile an Ada source file using dragonegg plugin (gcc -c -fplugin...). ZY ps, sorry for multiple emails, trying to find out how to reply to a thread in the mailing list On Sat, May 11, 2013 at

Duncan, Is there a way (switch) for embedding original source code in the generated .s file? thanks, ZY On Sun, May 12, 2013 at 4:12 AM, Duncan Sands <baldrick at free.fr> wrote: > Hi ZY, > > > On 11/05/13 22:21, Zhiyuan Ren wrote: > >> Duncan, >> >> here is part of the assembly around the problem area. I used gcc -S -flto >> to >> generate

Hello everyone, Sorry to bother you. I'm an undergraduate, and I'm trying to finish my graduation project using LLVM. In this project, I hope to transform all loop in program to condition statement. For example, Before transformation: for (int i = 0; i < 5; i++) a++; After transformation: int i = 0; if (i < 5) a++; i++; The idea is very clear, however, I'm a newbie to LLVM.

Hi ZY, On 11/05/13 20:37, Zhiyuan Ren wrote: > Duncan, > > Thanks for getting back to me. I am not sure how to find the original bitcode > (and related Ada source code) that causes the truncate. This is the error > message that gcc gave me when I tried to compile an Ada source file using > dragonegg plugin (gcc -c -fplugin...). use -S instead of -c and add -flto The resulting