search for: conveys

On Mon, Jun 15, 2015 at 3:29 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > On Mon, Jun 15, 2015 at 10:33 AM, Christian Convey > <christian.convey at gmail.com> wrote: > > On Mon, Jun 15, 2015 at 11:02 AM, Daniel Berlin <dberlin at dberlin.org> > wrote: > Which paper are you using? > I'm mostly going from Robert Wilson's 1997 phd thesis,

Hi I read on LLVM blog that meta-data has been implemented to coney debug information to run-time system. Can one use meta-data to convey developer specifc hints to run-time system (e.g. JIT compiler)? Keen to know your thoughts on this. Thanks Javed -- my homepage: http://www.javedabsar.com -------------- next part -------------- An HTML attachment was scrubbed... URL:

Javed Absar wrote: > Hi > > I read on LLVM blog that meta-data has been implemented to coney debug > information to run-time system. > Can one use meta-data to convey developer specifc hints to run-time > system (e.g. JIT compiler)? > Keen to know your thoughts on this. I don't see why not. I've used LLVM metadata to record type-inference information and to

...ly distributed continuous response variables with categorical explanatory variables be given by 1/2 of the least significant difference, where the least significant difference is defines as qt(0.975,degrees_of_freedom)*standard_error_of_the_difference. The idea is that the above quantity visually conveys whether or not the means are different more realistically than do standard errors. I have analyzed proportions with categorical variables using the glm function with a binomial error model. I wish to plot a bar graph with the height of the bars the proportions. Is there a way to define error bars...

On Oct 7, 2013, at 3:49 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > > > > On Wed, Sep 25, 2013 at 5:50 PM, Filip Pizlo <fpizlo at apple.com> wrote: > Hi all, > > TBAA on loads and stores is super useful for conveying high-level type knowledge to LLVM transformations. But often translating a high-level language into LLVM IR will result in runtime calls

On Jan 27, 2012, at 5:00 PM, Dan Gohman wrote: > Not all of these are miscompiles, None I'd say, may be TBAA. > but the point is that valid but > naive optimizations can cause them to be actively misleading ... but not cause mis-compilation. Note, optimization passes are free to update info conveyed through MDNodes, if they want to. The "optional to update" while still

On Wed, Sep 25, 2013 at 5:50 PM, Filip Pizlo <fpizlo at apple.com> wrote: > Hi all, > > TBAA on loads and stores is super useful for conveying high-level type > knowledge to LLVM transformations. But often translating a high-level > language into LLVM IR will result in runtime calls that are known at the > high level to only affect (either by reading or by writing) some

...ion equation is now this: m1 <- lm(y ~ x1 + x2 + x3) I also regress on m2 <- lm(y ~ x1 + x2 + x3 + x4) The thing is, that I want to study the effect of "information" x4. I would hypothesize, that the coefficient estimate for x1 goes down as I introduce x4, as x4 conveys some of the information conveyed by x1 (but not only). Of course x1 and x4 are correlated, however multicollinearity does not appear to be a problem, the variance inflation factors are rather low (around 1.5 or so). I want to basically study, how the interplay between x1 and x4 is, when introdu...

I'm pretty sure poolalloc is unmaintained at this point. John Criswell would know more. On Thu, May 28, 2015 at 11:57 AM, Christian Convey < christian.convey at gmail.com> wrote: > I'm starting to play around with poolalloc for the first time. I tried to > build it as follows: > 1) Clone llvm's git repo, and build it with cmake + ninja. > 2) cd .../llvm/projects

Hi guys, Suppose I have an IR file on disk, and I access it via a Module pass. Also suppose that the bitcode file hasn't changed, and no transformation passes have run. Then can I safely assume that every time my Module pass executes code like the following, it will always visit the Module's Functions, BasicBlocks, and Instructions in the same order? for (auto const & Fn : Module)

I think we’re talking cross-purposes at this point. Let me try to step back and concisely restate what I’m trying to do: - I am writing a frontend for a high-level language and I emit LLVM IR. - I control the TBAA tree. I don’t use it to express the high-level language’s types, since that would make absolutely no sense. JavaScript doesn’t have types. But by the time my compiler is generating

Nick Lewycky <nicholas at mxc.ca> writes: > Why should the backends know about the frontend language? It seems > sensible to me that if I create a new language and a new ABI for my > language then I can expect to need to teach the backend about my new > ABI. And so the backend has to be taught about the language. To me, it is about conveying the necessary information in a more

TBAA MDNodes should describe the type hierarchy (with struct-path aware TBAA, it is a type DAG). It sounds okay to me to add !tbaa.call to function calls to describe which fields of the type system the call is touching. One example can be !tbaa.call {read a list of tag nodes, write a list of tag nodes}. Thanks, Manman On Mon, Oct 7, 2013 at 11:49 PM, Daniel Berlin <dberlin at dberlin.org>

a) What is so difficult about the idea that this list is about R, not theory? There do exist forums about control theory (e.g. engineering.stackexchange.com) b) Using [-pi,+pi) is not "wrong"... it is numerically more precise, though it may not convey what you would prefer to convey. c) The general case with poles and zeroes is more complicated than just adding the order of your

On Mon, Oct 7, 2013 at 7:34 PM, Filip Pizlo <fpizlo at apple.com> wrote: > I think we’re talking cross-purposes at this point. Let me try to step > back and concisely restate what I’m trying to do: > > - I am writing a frontend for a high-level language and I emit LLVM IR. > - I control the TBAA tree. I don’t use it to express the high-level > language’s types, since

Hi all, TBAA on loads and stores is super useful for conveying high-level type knowledge to LLVM transformations. But often translating a high-level language into LLVM IR will result in runtime calls that are known at the high level to only affect (either by reading or by writing) some restricted subset of the heap. These aren't read-only calls; that is often too strong of a guarantee. A

On Tue, Oct 8, 2013 at 12:45 PM, Manman Ren <manman.ren at gmail.com> wrote: > > TBAA MDNodes should describe the type hierarchy (with struct-path aware > TBAA, it is a type DAG). > It sounds okay to me to add !tbaa.call to function calls to describe which > fields of the type system the call is touching. > I agree wholeheartedly :). However, that's not what is being

David A. Greene wrote: > Nick Lewycky<nicholas at mxc.ca> writes: > >> Why should the backends know about the frontend language? It seems >> sensible to me that if I create a new language and a new ABI for my >> language then I can expect to need to teach the backend about my new >> ABI. > > And so the backend has to be taught about the language. Only if

Hi I want to write a little function that takes a vector of arbitrary length "n" and returns a matrix of size n+1 by n+1. I can't easily describe it, but the following function that works for n=3 should convey what I'm trying to do: f <- function(x){ matrix(c( 1 , 0 , 0 , 0, x[1] , 1 , 0 , 0, x[1]*x[2] , x[2] , 1 , 0,

On Mon, Oct 7, 2013 at 4:22 PM, Filip Pizlo <fpizlo at apple.com> wrote: > > > On Oct 7, 2013, at 3:49 PM, Daniel Berlin <dberlin at dberlin.org> wrote: > > > > > On Wed, Sep 25, 2013 at 5:50 PM, Filip Pizlo <fpizlo at apple.com> wrote: >> >> Hi all, >> >> TBAA on loads and stores is super useful for conveying high-level type