similar to: [LLVMdev] basic block tracing

Displaying 20 results from an estimated 6000 matches similar to: "[LLVMdev] basic block tracing"

2003 Sep 25
0
FW: [LLVMdev] basic block tracing
Rahul, Were you talking about tracing in the sense of "profiling" (which Anand did), or tracing of values as they are computed for debugging generated code (which I did)? For tracing of values for debugging, the answer is yes: we insert code in each BB and print out the values computed in that BB that are live at the end of the BB (so we don't print out temporaries computed and
2003 Aug 04
3
Breusch-Godfrey Test
> Dear R Helpers! > > bgtest{lmtest} performs the Breusch-Godfrey test for higher > order serial > correlation. > > Is the Higher Order Correlation function already programmed in > R I couldn't find it? > > Sergei Petrov > ?acf ?pacf HTH, Bernhard ---------------------------------------------------------------------- If you have received this e-mail
2003 Aug 31
1
broken link in documentation
hello, i'm reading the doc at http://xiph.org/ogg/vorbis/doc/Vorbis_I_spec.html and the link to the paper http://www.iocon.com/resource/docs/ps/eusipco_corrected.ps doesn't work. Could anyone correct the link and/or mirror this paper ? Thanks, YG --- >8 ---- List archives: http://www.xiph.org/archives/ Ogg project homepage: http://www.xiph.org/ogg/ To unsubscribe from this list,
2002 Oct 04
1
MDCT document
Hi On http://www.xiph.org/ogg/vorbis/doc/vorbis-spec-intro.html there is a link to a document titled 'The use of multirate filter banks for coding of high quality digital audio' that explains window functions for iMDCT. I would very much like to read that document, but the link is broken. If someone would send me the document or a working link to it, I would be very happy. Thanks in
2003 Dec 30
1
Accuracy: Correct sums in rowSums(), colSums() (PR#6196)
Full_Name: Nick Efthymiou Version: R1.5.0 and above OS: Red Hat Linux Submission from: (NULL) (162.93.14.73) With the introduction of the functions rowSums(), colSums(), rowMeans() and colMeans() in R1.5.0, function "SEXP do_colsum(SEXP call, SEXP op, SEXP args, SEXP rho)" was added to perform the fast summations. We have an excellent opportunity to improve the accuracy by
2002 Jun 09
1
S or R used in natural language processing (NLP)?
Dear All, Does anyone use S or R for statistical natural language processing (NLP)? All I have found so far is a package called EMU (http://www.shlrc.mq.edu.au/emu/emu-splus.shtml) which is a speech wave-form processing package. What I'm looking for are routines to support text processing, text categorization, word sense disambiguation, text understanding etc. In particular, I would
2003 Nov 03
4
[LLVMdev] large linking time
Hello, I have observed that the LLVM build takes pretty long time to link executables (i.e. tools). Is that a normal behavior? Thanks, Rahul
2002 Oct 10
4
Correspondence analysis/optimal scaling with ordinal variable
Dear R specialists, I have a multivariate statistics question that I want to submit to the R community (which conveys a very good statistical knowledge). I need to perform an optimal scaling based on a discrete variable and an ordinal variable. The discrete variable, Area, defines a geographical area. The ordinal variable, EducationLevel, describes the education level of individuals (the
2005 Jan 04
4
Scheduler Mechnisms!
Hello, Normally, in addition to such qdisc scheduler mechanisms as FIFO, PQ, WRR, WFQ, are there any more? Then, there is a confusion on scheduler in Linux enviroment: Assume there is a qdisc, such as RED as a leaf qdisc in a router, we know, if there is packet which want to enqueue the packet, the Function red_enqueue is called, but when the packet leave the queue(when the Function red_dequeue
2004 Feb 23
2
[LLVMdev] linking time
Hi LLVMdev, The stuff I am working on requires linking 9-10 LLVM libraries, along with a few libs of my own. The linker is taking a long time to do that, about 6 mins (on a P4 with 512 MB mem). I tried the latest (2.14) release of binutils, but that didn't help. Is anyone aware of any solution to this? Thanks, Rahul
2003 Nov 09
0
[LLVMdev] LLVM namespac'ification
Yes, pretty much. There are a few things that will go in the std namespace because its the way it is and a more natural fit. The other two namespaces already in use (cl and DOT) will be placed under the llvm namespace. The goal is to get everything that is currently at top level and put it in llvm. This means that in your programs, you wouldn't use: cl::XYZ anymore but: llvm::cl::XYZ. Or,
2003 Dec 14
0
[LLVMdev] An assembly level interface for LLVM
Oops .. pardon my last incomplete posting, pushed Ctrl-Enter by accident! As I was saying .. Rahul's idea is interesting and would make some aspects of LLVM programming easier, but I wouldn't use it in my source language for the following reasons: 1. Of necessity the "snippet parser" would need to be based on the same language/grammar as AsmParser. Allowing parsing and
2002 Oct 02
2
R vs Fortran
Dear R experts I work in computational fluid dynamics in 2D: I have a 200-by-200 array of fluid properties such as density and velocity and these evolve in time (the precise equations depend on the problem). Up to now, I've been using Fortran and the code is very very messy. It works, but a professional programmer friend of mine saw the source code once, and had to be strapped down for his
2007 Jul 16
1
[LLVMdev] not to break 'for' statement into basic blocks
Thank you so much but could you tell me a little bit more in detail about that you suggested? Sorry, I'm just a greenhorn. Thanks, Seung J. Lee ---- Original message ---- >Date: Sat, 14 Jul 2007 21:26:14 -0500 >From: "David A. Greene" <greened at obbligato.org> >Subject: Re: [LLVMdev] not to break 'for' statement into basic blocks >To: llvmdev at
2015 Jun 25
2
[LLVMdev] Any known-reliable numbering scheme for basic blocks?
Hi all, Does anyone know of a good solution to the following? I'm trying to find a good way to stably associate distinct ID numbers with different BB in a module. As long as the module's IR hasn't changed in any way whatsoever, I'd like to be guaranteed to always generate the same ID <--> BB mapping. Or if the mapping is ambiguous, because two or more mappings between
2007 Jul 14
1
[LLVMdev] not to break 'for' statement into basic blocks
Hello, Seung J. Lee > LLVM optimization and other tools are really fantastic. > However I don't want LLVM breaks my 'for' statement in C code into > basic blocks during compiling. > I'm sure this sounds really strange but there is a reason for me. LLVM is 'low-level'. It doesn't contain any special instruction for loops at all. > Furthermore, this
2003 Oct 27
14
Answering Machine Detection
Does anyone have any recommendations on implementing Answering Machine detection for call generation programs? What I would like is * to determine what picks up the other line (Answering Machine, Voicemail, or Human) to determine which action to take. For example: If * detects Answering Machine or Voicemail, hangup call & the AGI will log (ANSWERING MACHINE DETECTED) and at that point,
2003 Nov 09
4
[LLVMdev] LLVM namespac'ification
Coming back to the issues that I had integrating LLVM with MSSP, will the code in include/Support also be put in the llvm namespace? That will solve many problems and help prevent others. Rahul ---- Original message ---- >Date: Sun, 9 Nov 2003 10:13:03 -0600 (CST) >From: Chris Lattner <sabre at nondot.org> >Subject: [LLVMdev] LLVM namespac'ification >To: LLVMdev List
2006 Jan 27
1
Classifying Intertwined Spirals
I'm using an SVM as I've seen a paper that reported extremely good results. I'm not having such luck. I'm also interested in ideas for other approaches to the problem that can also be applied to general problems (no assuming that we're looking for spirals). Here is my code: library(mlbench) library(e1071) raw <- mlbench.spirals(194, 2) spiral <-
2003 Aug 13
1
[LLVMdev] Running a pass
Hi, I want to run the Mem2Reg pass on a function without using the the LLVM opt utility. I wrote some code, which I am not sure is correct: TS_ASSERT(!verifyFunction(*function)); // find the dominance frontier of the CFG DominanceFrontier DF; DF.runOnFunction(*function); // try to promote stack allocated variables PromoteMemToReg(function->getRegAllocas(), DF, *tgt_data);