search for: refine

On Wednesday 12 November 2008 19:13, Chris Lattner wrote: > You shouldn't be refining the pointer, you should use: > > t1->refineAbstractType(t2) Ok, I tried this and I get further. But the type system seems to have trouble when refining multiple types and those types resolve to the same thing. I turned on DEBUG_MERGE_TYPES to illustrate: *** First function type *** TypeMap<>::add table contents: 1. 0x3a4e6a0 i32 *...

On Nov 12, 2008, at 5:07 PM, David Greene wrote: > On Wednesday 12 November 2008 18:58, Chris Lattner wrote: >> On Nov 12, 2008, at 3:37 PM, David Greene wrote: >>>>> Unfortunately, calling FunctionType::refineAbstractType(opaque, >>>>> void >>>>> (...)) >>>>> doesn't work because RefineAbstractType doesn't recurse down into >>>>> the >>>>> pointee types. >>>> >>>> What types are you starting out w...

On Wednesday 12 November 2008 18:58, Chris Lattner wrote: > On Nov 12, 2008, at 3:37 PM, David Greene wrote: > >>> Unfortunately, calling FunctionType::refineAbstractType(opaque, void > >>> (...)) > >>> doesn't work because RefineAbstractType doesn't recurse down into > >>> the > >>> pointee types. > >> > >> What types are you starting out with? If you had the equivalent of: >...

...t implementing the Ullmann¹s algorithm for searching subgraph isomorphisms in graphNEL objects. The algorithm is running with smaller graphs, but when I¹m calling it i get an R error message saying that functions are nested too deeply in source code. I found out that the problem is in the so called refinement procedure of the algorithm which consists of 10 different functions, returning an adjacency matrix. I¹m calling the refinement procedure with M <- refine1(M, A, B, p_A, p_B, FAIL) (note that all parameters in call refine1 have been defined previosly) Then the following steps look like this...

...y understand how it ought to work, so maybe I'm way off base. ------------- #include "Core.h" int main() { LLVMTypeRef a = LLVMPointerType(LLVMOpaqueType(), 0); LLVMTypeHandleRef ha = LLVMCreateTypeHandle(a); LLVMTypeRef atypes[1] = { LLVMResolveTypeHandle(ha) }; LLVMRefineType(LLVMResolveTypeHandle(ha), LLVMStructType(atypes, 1, 0)); LLVMTypeRef b = LLVMPointerType(LLVMOpaqueType(), 0); // assert here .... } ------------- The assertion text is: Assertion failed: isa<X>(Val) && "cast<Ty>() argument of incompatible type!", fi...

On Mon, Sep 8, 2008 at 2:45 PM, Scott Graham <scott.llvm at h4ck3r.net> wrote: > LLVMTypeRef a = LLVMPointerType(LLVMOpaqueType(), 0); > LLVMTypeHandleRef ha = LLVMCreateTypeHandle(a); > LLVMTypeRef atypes[1] = { LLVMResolveTypeHandle(ha) }; > LLVMRefineType(LLVMResolveTypeHandle(ha), LLVMStructType(atypes, 1, 0)); > > Can anyone explain what I'm doing wrong here? It looks like a bug; the type map is somehow holding onto a stale pointer to an opaque type. That said, refining a pointer type is a very unusual operation; I'd suggest st...

...the first 15 seconds of Supervixen by Garbage) in about 11.1 seconds. Faster than real time, at least :) -tim #if defined(__ppc__) // Vanilla PPC code, but since PPC has a reciprocal square root estimate instruction, // runs *much* faster than calling sqrt(). We'll use two Newton-Raphson // refinement steps to get bunch more precision in the 1/sqrt() value for very little cost. // We'll then invert using the PPC reciprocal estimate instruction and also refine that // (although we should only need a single refinement step there). // This is about 8.8 times faster than sqrt() and according...

...sourcecode/relator/relatorlist.html> Two things to notice: 1. That is a massively long list. 2. It doesn't appear to do what we want. But it is there. However, no such scheme can reasonably provide support for one-of-roles such as 'Othello', this suggests that beyond simple role-refinement there are a number of mini-metadata specs required here. You've said elsewhere in reference to describing all media types: > There are drafts for including still images in Ogg streams? Surely they > would have to be described as well. What camera was used and who made it? > Who ow...

...list: > > <http://www.loc.gov/marc/sourcecode/relator/relatorlist.html> > > > > > > > > But it is there. However, no such scheme can reasonably provide > > support for one-of-roles such as 'Othello', this suggests that beyond > > simple role-refinement there are a number of mini-metadata specs > > required here. > > Okay, I'm not sure if this is a revelatory inspiration or a crazy idea, > but this morning it occurred to me that what might work is three > degrees of refinement for a role: > > 1. General. This would...

Hi, I am trying to refine models of a continuous response variable and a number of categorical predictor variables. I know of some model refinement tools available in R that help in the selection of model terms like dropterm and addterm from MASS etc. However, I would also like to try to refine the model by 'coalescing&...

> On Wednesday, May 20, 2020, 7:00:09 AM EDT, peter dalgaard <pdalgd at gmail.com> wrote: > > Expected, see FAQ 7.31. > > You just can't trust == on FP operations. Notice also Additionally, since you're implementing a "mean" function you are testing against R's mean, you might want to consider that R uses a two-pass calculation[1] to reduce floating

Hello all, I wanted to announce a new R search engine I made that covers all the major R mailing lists, CRAN, r-project.org, and more. Results are tabbed, so you can refine the search. Current refinements include searching just the mailing lists, searching just introductions, and searching the web for source files ending in .R. Please send comments and suggestions. If you want to add sites to the search, there is no need to contact me. Just hit the volunteer link at...

On Thursday 13 November 2008 18:27, David Greene wrote: > On Wednesday 12 November 2008 19:13, Chris Lattner wrote: > > You shouldn't be refining the pointer, you should use: > > > > t1->refineAbstractType(t2) > > Ok, I tried this and I get further. But the type system seems to have > trouble when refining multiple types and those types resolve to the same > thing. I turned on DEBUG_MERGE_TYPES to illustrate: Attached is some code that illustrates what I think is the problem...

Hi, Keir, The following patches refines Xen support for CPU Xsave/Xrestore support. There are four patches included. Patch 1/4: Cleaning up existing Xsave code in Xen. Replace xfeature_low and xfeature_high with a u64 variable xfeature_mask. In structure hvm_vcpu, rename xfeature_mask to xcr0 Provide EDX:EAX with...

...r = c(3, 0, 0)) Coefficients: ar1 ar2 ar3 intercept 0.1052 -0.0102 -0.1203 0.0099 s.e. 0.0337 0.0339 0.0338 0.0018 sigma^2 estimated as 0.002934: log likelihood = 1293.16, aic = -2576.33 Now, ar2 is not significantly different from zero. I would like to refine the model considering ar1 and ar3 only so I fit a model x[t]=c+m*x[t-1] + n*x[t-3]. Anyone could help me and tell me how to do it? Thank you very much. Chuse

> Nope, types are immutable once created. The only thing you can do is "refine" opaque types to other types. There is a section in the programmer's manual on this: > http://llvm.org/docs/ProgrammersManual.html#TypeResolve > > -Chris So I succeeded in using a "PATypeHolder" for the "opaque" type, define a Type* with PointerType::getUn...

...st time I looked, used the MARC relator list: > <http://www.loc.gov/marc/sourcecode/relator/relatorlist.html> > > > But it is there. However, no such scheme can reasonably provide > support for one-of-roles such as 'Othello', this suggests that beyond > simple role-refinement there are a number of mini-metadata specs > required here. > Okay, I'm not sure if this is a revelatory inspiration or a crazy idea, but this morning it occurred to me that what might work is three degrees of refinement for a role: 1. General. This would be like the MARC relator li...

...not inline @foo(), and instead re-link the call site in @main to some non-optimized copy (or differently optimized copy) of @foo, then it is possible for the program to have the behavior {print("Y"); print ("X")}, which was disallowed in the earlier program. In other words, opt refined the semantics of @foo() (i.e. reduced the set of behaviors it may have) in ways that would make later optimizations invalid if we de-refine the implementation of @foo(). The above example is clearly fabricated, but such cases can come up even if everything is optimized to the same level. E.g. on...

Crontab offers many refined facilities for Western calendaring, but none for traditional Eastern-- lunar-- designations. So for example, if one wants specify regular occurring events on full moons or on new moons, there is no way to do this. Emacs (a text processor!?) accomplishes this. The math for calculating lunar...

Hello, I am hoping someone can advise me regarding an error message I received and if needed, refine some syntax. I am wanting to calculate the word count for each row of a dataframe. Below, I have 3 variables ("V3.PD", "V3.HD", "V3.LP") which I want to obtain a word count for, by each row which contains these variables. Any assistance is much appreciated, Bob Gr...