similar to: [LLVMdev] POSIX thread library support

> Hi chenwj, > If it use system pthread library, then it should find it in the stand search path. I also added the option "-L/usr/lib -L/usr/lib64" but it still failed. Don't know if the link below helps or not, http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-November/027274.html Regards, chenwj -- Wei-Ren Chen (陳韋任) Computer Systems Lab, Institute of Information

Hi chenwj, According to the link, I found that during the compiling process, the option "-emit-llvm" must be added to generate immediate object *.o. [hanfeng at os-wstation02 fft]llvm-gcc -c fft.c -emit-llvm Then using llvm-ld will generate two files - a shell excutable and a llvm bytecode data both of which would run perfect. [hanfeng at os-wstation02 fft]llvm-ld -o FFT fft.o [hanfeng

> According to the link, I found that during the compiling process, the option "-emit-llvm" must be added to generate immediate object *.o. > [hanfeng at os-wstation02 fft]llvm-gcc -c fft.c -emit-llvm "-emit-llvm" emits object file which contains LLVM bitcode (IR). Default file name suffix is .o, but you might want to use "-o fft.bc" to make the suffix

Hi chenwj, For the first question, even if I did not specify "-o fft.bc", it still generated fft.o which is also a llvm bitcode file. For the second question, I intended to generate a native executable "FFT". However, it only generate a llvm bitcode file fft.bc and a native POSIX shell excuatable named fft. Howerver, the contents of the shell executable fft is a wrapper to call

Hi all, I am doing loop exit condition analysis. As the following sample code segments demonstrated, .... int *c = &a; while (*c == 0); .... I want to decide which variables are related to ending this spin-loop. E.g., in above sample, c is the direct variable while a is an indirect one. Does LLVM provide any existing analysis tools or APIs I can leverage? I am new to compiler

On Mon, Dec 19, 2011 at 10:13 PM, Hanfeng Qin <hanfengtsin at gmail.com> wrote: > Hi all, > I am doing loop exit condition analysis. As the following sample code > segments demonstrated, > > .... > int *c = &a; > while (*c == 0); > .... > > I want to decide which variables are related to ending this spin-loop. E.g., > in above sample, c is the direct

Hi all, I got a question on loop exit condition identification based on LLVM. I made an assumption first that loop exit conditions are located in exiting basic blocks. Then I use loop->getExitingBlocks() to get all BBs. However, this policy seemed not work for combinational exit conditions, e.g. compounding conditions consists of conditions with logical predicates. *The problem is that

Hi, I am working on DSP module of Ne10. I see there are fixed-point and floating-point FFT inside Opus. Is fixed-point FFT only a fall back for CPU without VFP? On ARMv7-A and ARMv8-A, benchmark result shows that fixed-point (int32) and floating-point (float32) FFT have similar performance. I guess fixed-point version is not often used on these platforms. Is it worth the effort to NEON-optimize

Hi Jean-Marc and list, Is the spx_fft function in fftwrap.c a standard fft function? void spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) When I say standard, I mean the input "in" is 128 point short data for example and the output "out" is 128 short complex value which is stored in 256 short array with real and image part. Looks like the function did some

Hi, I'm in dire need of a fast fourier transformation for me stupid biologist, i.e. I have a heartbeat signal and would like to decompose it into pure sin waves, getting three vectors, one containing the frequencies of the sin waves, one the magnitudes and one the phases (that's what I get from my data acquisition software's FFT function). I'd be very much obliged, if someone

Dear R helpers,   Following is a R script I am using to run the Fast Fourier Transform. The csv files has 10 columns with titles m1, m2, m3 .....m10.     When I use the following commands, I am getting the required results. The probelm is if there are 100 columns, it is not wise to define 100 commands as fk <- ONS$mk and so on. Thus, I need some guidance to write the loop for the STEP A and

Hi R-users: I want to know if there is an easy way to obtain a Fourier Transform form a vector or an array (just like fft does), but with a more density base. I mean, if I have a vector of 512 of length, I want the Fourier Transform to be 1024, or 2048, etc, in length (de u domain). Or should I modify the fft C code to do that? If I want to modify the precision of the fft function, which

A new pixman release 0.33.2 is now available. This is a release candidate for a stable 0.34.0 release. This release comes after little more than 1 year since the previous release (0.32.6). Therefore, the git log is quite long and there are multiple changes, fixes and enhancements. The main changes are: - ARMv6 - Many fast paths implementations were added - PPC64/PPC64LE - Fix all outstanding

Hi! I am using the fft() function the base package to transform some 1d signal. If I use this standar fucntion I get a very huge first fourier coeficient. I think this dues to the handling of the borders of the signal. Usually in fft especially in image processing the signal is simulated to be continuous by adding the signal several times periodically. My question is, is there some function

A new pixman release 0.34.0 is now available. This is a major release, following three development releases in the past six months. It contains all the changes detailed in the last three development releases in the 0.33 series. Please note that this release doesn't contain any changes since the previous development version (0.33.6) was released. For those who didn't follow the

I am in the process of dropping the TI DSP lib fft routines into the AEC. Currently, FFTWrap.c uses the USE_SMALLFT and USE_KISS_FFT to select between two packages of FFT routines. ] #ifdef USE_SMALLFT ... #elif defined(USE_KISS_FFT) ... #else #error No other FFT implemented #endif My guess is that every DSP and many other processors will have their own specific FFT and iFFT. What method

On 29 April 2015 at 17:22, Timothy B. Terriberry <tterribe at xiph.org> wrote: > > Viswanath Puttagunta wrote: >> >> This patch series is follow up on work I posted on [1]. >> In addition to what was posted on [1], this patch series mainly >> integrates Fixed point FFT implementations in NE10 library into opus. >> You can view my opus wip code at [2]. >

Jean-Marc Valin wrote: > There is definitely some use for a Neon fixed-point FFT. How much > exactly I'm not sure. Fixed-point is a bit more than just a fall-back Well, we use fixed-point mode by default in Firefox for both Firefox OS and Fennec (Firefox on Android). The reason is that, although there is some NEON-class hardware where float does finally appear to be a little bit

Hello: I modified benchmark used in http://www.informatik.uni-frankfurt.de/~stst/benchspl.txt now the attached code will work with R, except for last test for some reason (Sorry ran out of time to play with this). Immediate problem is that R does not show fraction of seconds. So, that kinda makes comparison some what hard. I also looked at memory and CPU usage on NT console. R seems to go

Hi Jing, I am cc ing to LLVMdev (LLVM developer's mailing list). You get more accurate and faster responses that way. <snip> > Actually LLVM is well documented and the coding style is very friendly. We have rarely had problems since we started one month ago. Unfortunately, here comes something I am not very clear, but it is critical to our evaluation. I appreciate if you could