Displaying 20 results from an estimated 5000 matches similar to: "complexity of "mem2reg"?"
2013 May 08
5
[LLVMdev] Shared library support of llvm
According to http://llvm.org/docs/CMake.html, "Shared libraries are not
supported on Windows and not recommended in the other OSes".
The problem is that static libraries have some limitations, especially when
linked into multiple shared libraries, the global data of llvm could have
multiple copies leading to undefined behaviors. This has caused much pains
during my usage of llvm.
My
2012 Aug 06
2
[LLVMdev] Question about llvm JIT
I have a function in llvm ir as follows:
def [2 x [3 x double]] @fun()
{
return [ ... ]; // a [2 x [3 x double]] constant
}
I would like to JIT this function in C.
I first get the void pointer using:
void *FPtr = TheExecutionEngine->getPointerToFunction( func );
Then I need to conver this void pointer to the corresponding C function
pointer
type, and then call the function
2013 Jan 30
1
[LLVMdev] x86 code emitter ebp and esp conflicts
Bug is reported with test cases. see
http://llvm.org/bugs/show_bug.cgi?id=15124 .
Thanks,
-Peng
On Wed, Jan 30, 2013 at 12:14 PM, Anton Korobeynikov <
anton at korobeynikov.info> wrote:
> > Has anyone seen this problem before? and is there any fix or work around
> > for that?
> Please provide a testcase and fill LLVM problem report into bugzilla.
>
> Thanks!
>
2012 Aug 06
0
[LLVMdev] Question about llvm JIT
On Mon, Aug 6, 2012 at 9:35 AM, Peng Cheng <gm4cheng at gmail.com> wrote:
> I have a function in llvm ir as follows:
>
> def [2 x [3 x double]] @fun()
> {
> return [ ... ]; // a [2 x [3 x double]] constant
> }
>
> I would like to JIT this function in C.
>
> I first get the void pointer using:
>
> void *FPtr =
2013 Feb 26
1
[LLVMdev] llvm header fixes
Hi All,
In my recent work using llvm to build a jit engine for a language, I saw
some warnings and bug in the llvm headers. I made the fix locally and it
works well. I am wondering how I could submit the fix back to llvm?
Thanks,
-Peng
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
2013 Feb 08
2
[LLVMdev] help with X86 DAG->DAG Instruction Selection
I have an llvm ir, which generates the following machine code using llc
(llvm 3.0 on win32) after # *** IR Dump After X86 DAG->DAG Instruction
Selection ***:
The first three lines and the last two lines alone together are used to
compute "sin" for some double number.
- line 1: move the stack pointer down 8
- line 2: copy the updated stack pointer to a base register
- line 3: copy a
2013 Feb 08
0
[LLVMdev] help with X86 DAG->DAG Instruction Selection
Hi Peng,
Can you please open a bugzilla and attache the LL file ? Can you please reproduce it on ToT ?
Thanks,
Nadav
On Feb 7, 2013, at 9:08 PM, Peng Cheng <gm4cheng at gmail.com> wrote:
> I have an llvm ir, which generates the following machine code using llc (llvm 3.0 on win32) after # *** IR Dump After X86 DAG->DAG Instruction Selection ***:
>
> The first three lines
2013 Oct 10
1
[LLVMdev] assertion when -sse2 on x86-64
Hi,
I have an ir at the end of this email. Run it with:
llc -mcpu=i386 -march=x86-64 -mattr=-sse2
and get assertion below. Changing cpu does not help.
I am using llc from the latest svn repository.
Any suggestions to work around this? I need to disable sse2 instructions
for x86-64.
Thanks,
-Peng
-----error message------
llc: X86FloatingPoint.cpp:332: unsigned int getFPReg(const
2013 Oct 20
3
Errore : requires numeric/complex matrix/vector arguments
Dear R users,I'm a new user of R. I'm trying to do a LM test an there is this type of error: Error in t(mX) %*% mX : requires numeric/complex matrix/vector arguments.
To be clear I write down the code in which mY ( 126,1 ) mX (126,1) mZ(126,1) are matrix.
LMTEST <- function(mY, mX, mZ)#mY, mX, mZ must be matrices!#returns the LM test statistic and the degree of freedom{iT =
2009 Sep 17
2
What is the time complexity of 'match()'?
Hi,
Suppose 'x' is a vector of length n and 'y' is a vector of length m, I
am wondering what the time complexity of 'match(x,y)' is. Is it n
times m?
Regards,
Peng
2020 Apr 29
2
[Posible SPAM] Re: Stopwords: Topic modelling con LDA
Hola,
Acabo de calcular tf-idf y me surge una duda. ¿Habría un valor de idf o
tf-idf que se considerara como umbral para establecer que una palabra es
muy común o no? Los valores de idf en mis datos van entre 0 y 3.78 y los
de tf-idf ente 0 y 0.07.
Un saludo
El Mar, 28 de Abril de 2020, 12:53, Carlos Ortega escribió:
> Hola,
> Yo de primeras los quitaría para qué otros topics aparecen.
2014 Sep 10
3
[LLVMdev] failed folding with constant array with opt -O3
I came in to an email this morning that said basically the same thing
for the reduced example we were looking at. However, the original IR it
came from (before hand reduction) had the data layout set correctly, so
there's probably still *something* going on. It's just not what I
thought at first. :)
Philip
On 09/10/2014 02:26 AM, Roel Jordans wrote:
> Looking at the -debug
2006 Sep 20
8
Understanding boost ?
Hi,
I''m confused about managing field boosting ...
I have set the :boost for the :name field in my docs to 10, via :boost
=> 10
Then I performed a search for ''keith'' over all fields via with
*:(keith*), expecting a doc with Keith in the :name field to come out on
top. But another doc with Keith mentioned in other fields (:comments,
:address) scored higher.
I
2020 Apr 28
3
Stopwords: Topic modelling con LDA
Buenos días,
Estoy realizando un análisis de topic models con el método LDA. En
principio, he quitado del análisis las palabras "stopwords" universales. A
la hora de ver los topics y sus palabras más frecuentes encuentro que son
muy similares y hay palabras que aparecen en todos los topics. Los textos
que estoy analizando son opiniones de consumidores sobre una categoría
concreta de
2016 Mar 10
2
Introduction and Doubts
Tf-idf is most used used weighting scheme is easy to understand and has
been used in other frameworks like lucene and many other places.
okapi bm25(implemented in xapian) is theoretically better/improved measure
than tf-idf and
i am looking into various other weighting scheme which are there in xapian
or can be implemented like TF-ICF(term frequecy inverse corpus
frequency),TF-RF(term
2011 Jul 17
1
How to speed up interpolation
df is a very large data frame with arrival estimates for many flights
(DF$flightfact) at random times (df$PredTime). The error of the estimate
is df$dt.
My problem is that I want to know the prediction error at each minute
before landing. This code works, but is very slow, and dominates
everything. I tried using split(), but that rapidly ate up my 12 GB of
memory. So, is there a better R way of
2013 Feb 19
2
Implementing tf-idf weighting scheme in Xapian
Hello guys.I just read up about tf-idf schemes and want to implement it in
Xapian (with some frequently used normalizations) as it will also give me a
good hang of implementing a weighting scheme before I start working on
implementing DFR schemes.
I read the following as references and I think Ive understood it well and
can write the hack :-
1.)
2008 Nov 12
1
Two problems with Samba in AD realm
Hello list.
I recently moved to an AD environment. I'm still keeping a samba servers
to make my cups-managed printers available to windows users, rather than
duplicating configuration with a Windows print service. But I'm facing
two problems, probably due to the way we manage AD.
First, all my host belong to a Unix-managed DNS domain
(msr-inria.inria.fr), not to the windows-managed
2017 Mar 05
3
GSoc 2017 Introduction(Weighting Schemes)
Hello Everyone,
I am a second year graduate student at IIIT-Bangalore and my interest is in
the field of Information Retrieval. I have successfully compiled Xapian
from source and have implemented some examples. While going through the
project list Weighting Schemes project is the one I was looking to
contribute to. So i went through the xapian-core/weight where most of the
schemes are already
2017 Mar 16
2
GSoC-2017 Introduction and Project Discussion
Hello,
I'm Shivang Bansal, a 3rd year Computer Science Engineering undergraduate
at Institute of Engineering & Technology in Lucknow, India. This mail is an
expression of my interest for Google Summer of Code program of this year. I
want to apologize for getting in so late. Actually I would have contacted
earlier, but sudden demise of my Grandfather disabled me in doing so.
I am