search for: inexactly

Dear all, I tried to install gstat package and add the following compilation error : ------------------------> * Installing *source* package 'gstat' ... creating cache ./config.cache checking for gcc... gcc checking whether the C compiler (gcc ) works... yes checking whether the C compiler (gcc ) is a cross-compiler... no checking whether we are using GNU C... yes checking whether

Changing the list from cfe-dev to llvm-dev > On 20 Apr 2017, at 4:52 AM, Michael Clark <michaeljclark at mac.com> wrote: > > I’m getting close. I think it may be an issue with an individual intrinsic. I’m looking for the X86 lowering of Instruction::FPToUI. > > I found a comment around the rationale for using a conditional move versus a branch. I believe the predicate logic

Thanks, Andy. I'm not sure how to solve that or my case given the DAG's basic-block limit. Probably CodeGenPrepare or SelectionDAGBuilder...or we wait until after isel and try to split it up in a machine instruction pass. I filed my example here: https://bugs.llvm.org/show_bug.cgi?id=33013 Feel free to comment there and/or open a new bug for the FP_TO_UINT case. On Thu, May 11, 2017 at

I have a simple cdr configured with the default tables, here is a row of a good cdr report calldate | clid | src | dst | dcontext | channel | ect ..... ect .... 2008-08-29 10:16:49 | "C. BOUTON" <40> | 40 | XXXXXXXXXXX | phonesystems | SIP/40-08776938 | ect ..... ect .... I have replaced the number by

Dear all, I did post a message about problems on installing a package (gstat) which ends with a compilation error: ** libs gcc -I/usr/lib/R/include -mieee-with-inexact -fPIC -g -O2 -c block.c -o block.o gcc -I/usr/lib/R/include -mieee-with-inexact -fPIC -g -O2 -c chfactor.c -o chfactor.o gcc -I/usr/lib/R/include -mieee-with-inexact -fPIC -g -O2 -c copy.c -o copy.o gcc

Hello, by checking the precision of a convolution algorithm, we found the following "inexactness": We work with R Version 1.8.1 (2003-11-21) on Windows systems (NT, 2000, XP). Try the code: ## Kolmogorov distance between two methods to ## determine P(Poisson(lambda)<=x) Kolm.dist <- function(lam, eps){ x <- seq(0,qpois(1-eps, lambda=lam), by=1) max(abs(ppois(x,

Hello R-Community, I have the following matching problem: I have two data.frames, one with an observation every month (per company ID), and one with an observation every quarter (per company ID; note that quarter means fiscal quarter; therefore 1Q = Jan, Feb, Mar is not necessarily correct and also, a fiscal quarter is not necessarily 3 month long). For every month and company, I want to get the

Thanks for expanding, Chris. Responses inline. > On Mar 2, 2018, at 12:32 AM, Chris Lattner via llvm-dev <llvm-dev at lists.llvm.org> wrote: <snip> > - Because LLVM reorders and speculates the instruction forms, and because IEEE defines the corresponding IEEE operations as trapping on SNaNs, it is clear that SNaNs are outside of the domain of these LLVM operations. Either

Some clarification after getting feedback from Craig Topper…. It’s probably best to say in the documentation that the llvm.nearbyint and llvm.rint functions “assume the default rounding mode, roundToNearest”. This will allow the optimizer to transform them as if they were rounding to nearest without requiring backends to use an encoding that enforces roundToNearest as the rounding mode for these

I am running 2.6.18-1.2693.fc6xen and I am receiving this message powernow-k8: Processor cpuid 681 not supported anyone know if xen works on processor : 0 vendor_id : AuthenticAMD cpu family : 6 model : 8 model name : AMD Athlon(tm) Prosussor stepping : 1 cpu MHz : 1994.985 cache size : 256 KB fdiv_bug : no hlt_bug : no

I am running 2.6.18-1.2693.fc6xen and I am receiving this message powernow-k8: Processor cpuid 681 not supported anyone know if xen works on processor : 0 vendor_id : AuthenticAMD cpu family : 6 model : 8 model name : AMD Athlon(tm) Prosussor stepping : 1 cpu MHz : 1994.985 cache size : 256 KB fdiv_bug : no hlt_bug : no

Hi Petr, The following is different line of thought which is posted in different form, maybe you have some wise input on it. "I need to find Efficient(tracktable) deterministic algorithm for Matching Weighted Graphs with bounded degree. Now we all know Graph matching is non-tractable but when degree of vertex has upper bound are there any tractable algorithm? Does this special case comes

This email is just to summarize a bit of digging I did last night into our attribute inference.  Unfortunately, I'm not going to have time to implement any of the gaps I noticed, but I figured someone else out there might be interested. *Missing Attributes* argmemonly - influences AA, particularly relevant for libraries which wrap build in functions which are annotated, but don't

> > The only issue I see is that since we also assume FP operations have no > side effects by default there is no difference between llvm.rint and > llvm.nearbyint. I wouldn’t have a problem with dropping llvm.rint > completely. The forthcoming C standard ( http://www.open-std.org/jtc1/sc22/wg14/www/docs/n2454.pdf, 7.12.9.8) defines new function, `roundeven`, which implements

> This seems like it was done for perf reason (mispredict). Conditional-to-cmov transformation should keep > from introducing additional observable side-effects, and it's clear that whatever did this did not account > for floating point exception. That’s a very reasonable statement, but I’m not sure it corresponds to the way we have typically approached this sort of problem. In

> > One concern with replacing llvm.rint and llvm.nearbyint with > llvm.roundeven makes it difficult to turn back into a libcall if the > backend doesn't have an instruction for it. You can't just call the > roundeven library function since that wouldn't exist in older libm > implementations. So ideally you would know which function was originally > used in the

> > I'm not sure why this is an issue. Yes, these two intrinsics depend > on the current rounding mode according to the C standard, and yes, > LLVM in default mode assumes that the current rounding mode is the > default rounding mode. But the same holds true for many other > intrinsics and even the arithmetic IR operations like add. Any other intrinsic, like `floor`,

On Tue, Oct 2, 2018 at 12:09 PM Kevin Neal <Kevin.Neal at sas.com> wrote: > If we don’t have constrained intrinsics for some of the fp math > instructions then aren’t we risking non-strict optimizations? > So far we've only added constrained FP intrinsics for operations that have side effects (i.e. can trap). The quiet-computational sign-bit operations are special. They never

Hi, I've installed a program made for windows that is developed by our company. I installed the system on Ubuntu (Dapper Drake) using Wine. All other functions work fine, but when I tried to view the reports that were made by Crystal Reports the program displays the message "Application-defined or object-defined error." Any advice on how to get this work??? Thanks! Here is a copy

Per https://buildd.debian.org/build.php?pkg=r-base, we see the Alpha platform having trouble with deriv.c : gcc -I. -I../../src/include -I../../src/include -DHAVE_CONFIG_H -mieee-with-inexact -fpic -std=gnu99 -O3 -pipe -g -c deriv.c -o deriv.o deriv.c: In function 'simplify': deriv.c:267: error: unrecognizable insn: (insn 2103 64 65 9 ../../src/include/Rinlinedfuns.h:86 (set