similar to: [LLVMdev] call for suggestions

On Sun, 2010-04-11 at 10:54 +0800, lucefe wrote: > Hi, Dear LLVMers > > I just touch llvm source code for several days, and I didn't know the > interfaces of the analysises and transformations of LLVM. For exampe, > how to backtrace CFG, and whether exits a backtracking interator to do > such work? > > For a novice, I also seek for suggestions about how to become

Hi, I want to compile gnu utility 'find' to get an executed *.bc file, so I use the following commands: ./configure CC=/path/to/llvm-gcc LD=/path/to/llvm-ld make make install However, at the end I did not get any *.bc file, and the generated file 'find' is said to "Invalid bitcode signature". where is the error, and what should I do? Thank you all. noviceup

Hi, all I want to use the alias analysises in project poolalloc, but I encounter some problem during installing it. I install poolalloc as follow: 1) cd llvm/projects svn co http://llvm.org/svn/llvm-project/poolalloc/branches/release_32 poolalloc 3) cd LLVM-object-directory make tools-only cd projects/poolalloc make When I carried out "make", I get the next error

dear list! i have run several glm analysises to estimate a mean rate of dung decay for independent trials. i would like to compare these results statistically but can't find any solution. the glm calls are: dung.glm1<-glm(STATE~DAYS, data=o_cov, family="binomial(link="logit")) dung.glm2<-glm(STATE~DAYS, data=o_cov_T12, family="binomial(link="logit")) as

Thank you. But now I am using LLVM 2.9, so which version of poolalloc I should use ? -------------------------------------------- Qiuping Yi Institute Of Software Chinese Academy of Sciences On Fri, Jan 30, 2015 at 11:12 PM, John Criswell <jtcriswel at gmail.com> wrote: > Dear Qiuping, > > If you use the release_32 branch of poolalloc, then you need to use LLVM > 3.2. >

Dear Qiuping, If you use the release_32 branch of poolalloc, then you need to use LLVM 3.2. For directions on compiling poolalloc with LLVM 3.2, please the SAFECode build directions at http://safecode.cs.illinois.edu/docs/Install.html. You can just skip the steps in the directions that compile SAFECode. Regards, John Criswell On 1/30/15 10:05 AM, Qiuping Yi wrote: > Hi, all > > I

I am just not upgrade my LLVM. So I must use some higer LLVM version, right? -------------------------------------------- Qiuping Yi Institute Of Software Chinese Academy of Sciences On Fri, Jan 30, 2015 at 11:21 PM, John Criswell <jtcriswel at gmail.com> wrote: > On 1/30/15 10:17 AM, Qiuping Yi wrote: > > Thank you. But now I am using LLVM 2.9, so which version of poolalloc I

I did a simple test just now, but I alse failed. I delete several ordered instructions from end to begin, but after deleting the first instruction(the last instruction of F), the program crashed. My test code is below (F is a function only containing several sequential instructions): for (inst_iterator inst == --inst_end(F); inst != inst_begin(F); --inst) { Instruction * i = &*inst;

Dear everyone, I want to traverse call graph, but I have some trouble . In my pass MyPass which need to traverse call graph, I firstly added the CallGraph analysis to the pass requirements by *AU.addRequired<CallGraph>();* My pass MyPass then will be added to a pass manager by *manager.add(new MyPass());* and then I want to traverse the call graph such as: CallGraph CG =

Hello! my data set has many variables. Unfortuantely, many of those variables contain spaces in their names. I need advice on: how to refer to variable names in the formula for "aggregate". See example below: ### Generating example data set: mydate = rep(seq(as.Date("2008-12-01"), length = 3, by = "month"),4) value1=c(1,10,100,2,20,200,3,30,300,4,40,400)

Hi, I have what I think is a simple question/issue but I have unable to find the answer for it either in the R-manual or by browsing the web. I would like to know if there is a "mode" function in R, such that from a vector or matrix the function returns the most common value. In other programs I use (such as Matlab) I can have for exampe a 3X3 matrix A, A=[1 2 3; 1 3 2; 3 3 2] and I

On 1/30/15 10:17 AM, Qiuping Yi wrote: > Thank you. But now I am using LLVM 2.9, so which version of > poolalloc I should use ? Why are you using LLVM 2.9? That's an old version of LLVM (even by my standards). Is there some other LLVM-based tool that requires that you use LLVM 2.9? Regards, John Criswell > > > -------------------------------------------- > Qiuping Yi

Sanjiv Gupta wrote: > Sanjiv Gupta wrote: > >> Duncan Sands wrote: >> >> >>> Hi Sanjiv, I think a lot of the softening code assumes you are dealing >>> with float (32 bits). So it's not just a matter of changing the libcall >>> return type. >>> >>> >>> >> Yes, we are dealing with 32-bits

Hi All, We are observing frequently issue that Puppet agent intermittently stops without doing any thing when lot of puppet agent hitting puppet master . In our environment , we have configured puppet master over Apache-passenger and we have used LDAP as node classifier. - puppet 5.5 - Apache-passenger 3.0.17 - CentOS 6.3 / 5.5 - OpenLDAP 2.4 Sometimes restarting Apache solves

Mikhail Glushenkov wrote: > Hi Sanjiv, > > 2009/6/18 Sanjiv Gupta <sanjiv.gupta at microchip.com>: > >> Hi Mikhail, >> Thanks for your wonderful help so far. I have few more questions to ask: >> >> How do I modify the driver to pick tools from where the driver itself >> resides, rather than from the PATH? >> Do I need to write some C++ code

On Wed, 2009-07-15 at 10:37 -0700, Devang Patel wrote: > On Wed, Jul 15, 2009 at 9:32 AM, sanjiv gupta<sanjiv.gupta at microchip.com> wrote: > > Consider the example command line below > > > > $ llvm-ld -disable-opt hello.bc -l std -o hello.out > > > > Why does -disable-opt links in all the bitcode from the libstd.so into > > hello.out? > > ...

hi, i''ve just started use prototype.js et al, i am currently creating a sortable list with: Sortable.create(''id'', { onChange: myFunc }); but what i really want is an event that occurs after the li''s have been reordered and settled into the new list order. how would i do that? i know i can do for exampe: Event.observe(''id'',

On Mon, 2009-10-05 at 16:54 -0700, Eli Friedman wrote: > On Mon, Oct 5, 2009 at 11:11 AM, Sanjiv Gupta > <sanjiv.gupta at microchip.com> wrote: > > Sanjiv Gupta wrote: > >> Sanjiv Gupta wrote: > >> > >>> Duncan Sands wrote: > >>> > >>> > >>>> Hi Sanjiv, I think a lot of the softening code assumes you are

Duncan Sands wrote: > Hi Sanjiv, I think a lot of the softening code assumes you are dealing > with float (32 bits). So it's not just a matter of changing the libcall > return type. > Yes, we are dealing with 32-bits only. But why the cmp libcalls have to return a 32-bit value. e.g. Our libcall for comparing two floats is char _eq_f32 (float a, float b); rather than long

Hi, John Criswell Thank you very much. I am installing LLVM-3.2, but I encounter the next error when carrying out "make": llvm[3]: Compiling ClangASTNodesEmitter.cpp for Release+Asserts build ClangASTNodesEmitter.cpp: In member function ‘std::pair<llvm::Record*, llvm::Record*><unnamed>::ClangASTNodesEmitter::EmitNode(const std::multimap<llvm::Record*, llvm::Record*,