search for: notions

...ments points to, but may access an unspecified amount. The // reads and writes may be volatile, but except for this it has no other side // effects. def IntrReadWriteArgMem : IntrinsicProperty; I did point out in the review that I think the notion of ReadsArgMem is redundant given the existing notions of ReadWriteArgMem and ReadOnly, but that's somewhat orthogonal. It's true of the existing implementation, not just Igor's patch. It may be worth settling on this to clarify naming (i.e. are we ever going to need an attribute like reads_arg_mem? Or can we be more generic and use...

I'm running NoScript because otherwise Firefox freezes up a lot. Recently I've had difficulty accessing a site. I suspect the reason is that it uses redirection in a way that frustrates my efforts to give it permission. To test the notion, I'm considering temporarily allowing script globally. How hard is it to reverse? Will I need to redo previous permissions one at a time? --

Dear LLVMdev, We have a question regarding the semantics of the undefined value in LLVM IR. As far as we understand, in order to give a semantics to the undefined value, the semantics of LLVM IR is generalized to a rather unusual set-based semantics. More specifically, the notion of value in LLVM IR is generalized to a set of values, rather than a single value. Then the undefined value is simply

On 11/13/2014 05:02 PM, Chandler Carruth wrote: > > This intrinsic needs to carry control dependencies (it cannot be > hoisted out of a loop, for example) -- in this sense it is very > much like @llvm.assume. And like @llvm.assume, we'll need to add > logic to various passes to ignore it as appropriate so that it > does not block optimizations

I am trying to convert a matlab code to R. Most of the conversion statements are simple, but problem is with return. Since it's a recursive function it's a bit complicated. Anyway in matlab we can have return statment like [price, notional] = functionname() and also for the same function... notional(1) = functionname() how to do this in R? i have tried using data frame but still

On Fri, Jan 15, 2016 at 09:39:12AM -0800, Paul E. McKenney wrote: > Should we start putting litmus tests for the various examples > somewhere, perhaps in a litmus-tests directory within each participating > architecture? I have a pile of powerpc-related litmus tests on my laptop, > but they probably aren't doing all that much good there. Yeah, or a version of them in C that we

On Fri, Jan 15, 2016 at 09:39:12AM -0800, Paul E. McKenney wrote: > Should we start putting litmus tests for the various examples > somewhere, perhaps in a litmus-tests directory within each participating > architecture? I have a pile of powerpc-related litmus tests on my laptop, > but they probably aren't doing all that much good there. Yeah, or a version of them in C that we

On Tue, Jan 27, 2015 at 8:58 PM, Sanjoy Das <sanjoy at playingwithpointers.com> wrote: > > Ah, yes. You are right, we cannot always assume that %y would be zero in > > the second case. > > This wouldn't be the first time we've lost information that we could use > to > > optimize a program by transforming it. > > > > Do you think this result

On 05/20/2015 11:04 AM, Renato Golin wrote: > On 20 May 2015 at 18:47, Philip Reames <listmail at philipreames.com> wrote: >> One particular irritant is getting emails 12-24 hours later about someone else's >> breakage that has *already been fixed*. The long cycling bots are really >> irritating in that respect. > That's not that easy to fix, and I think

In another thread on this list, various wild allegations have been made, relating to the New York Times article on R. I object both to the subject line and to the content of several of the messages, and will not repeat or quote any of that content. It smacks to me of mischief making. Discussion has centered around the following quote from the NY Times article: ?According to them, the

...invariant.start with no uses gives us a notion of an invariant region with no end. (Since the result doesn't escape, there can be no end hidden inside a function call.) This seems like a simple notion to exploit and is strict step forward from where we are, without a new intrinsic. The notions of "invariant over some range" and "safe to speculate over some range" are related, but distinct. However, to get the most power out of the former, you often need the later. Andy seems to be arguing in favour of data flow mostly because it's easier for the optimizer. U...

On Thu, 2008-09-25 at 10:28 -0400, Luke Dalessandro wrote: > When I request a write-before-read memory barrier on x86 I would expect > to get an assembly instruction that would enforce this ordering (mfence, > xchg, cas), but it just turns into a nop. In its usual configuration, an x86 family CPU implements a strong memory ordering constraint for all loads and stores, so as long as the

On 17 May 2016 at 20:04, Justin Bogner via llvm-dev <llvm-dev at lists.llvm.org> wrote: >> Note that this would also fire when a commit referring to a PR gets >> reverted (assuming the reverting commit doesn't botch the commit >> message), etc., which is super useful for those following along on the >> bug's cc list. > > +1. This would be a very useful

I have two CSV files (exported from Excel), say file1 and file2. The have the same number of rows, and each has several columns, with names on the first line; and some of the columns in file1 are repeated in file2. Using the "foreign" package, I can read these in separately to dataframes say d1 and d2 with > d1<-read.csv("file1") >

Hi Does anyone know how I might pick out diagonal elements of a matrix using a vector? If I create a matrix a: a <- matrix(c(1:16), 4, byrow=TRUE) and I want to pick out the elements (1,1),(2,2),(3,3), or another arbitrary diagonal (upper or lower), is there any way I can use a vector to do this? So if I want a diagonal of size 3, I could create a vector like x <- c(0:2) and then pick

On Tue, Mar 22, 2016 at 5:30 PM, Pete Cooper via llvm-dev <llvm-dev at lists.llvm.org> wrote: > Hi all > > (No idea if I have the correct audience. Please CC more people as needed). > > I have an UBSan failure in BumpPtrAllocatorImpl.Allocate. > > The problem is that lld requests that we StringRef::copy an empty string. > This passes a length of 0 to a

I am interested in putting together a tool which can verify that an external declaration conforms with the actual definition. A.c: extern int32_t foo(); Int bar() { return foo(); } B.c: int64_t foo() { ... } I had thought that I could use the debug information but the debug information in A.o does not include the type of the declaration "foo", just the type of bar. Is there a way to

On 06/12/2015 07:28 AM, g wrote: > > On 06/10/2015 03:56 AM, Always Learning wrote: >> I displayed, as a web page, a list of search results created in PHP, >> from MySQL. > i am still using 24.8.0 and do not have to contend with all the > bugs introduced by moz dev and their 'bells and whistles' when > they started try to get ahead of gaagle chrome web browser.

Dear R users, I'm new to both R and to this list and would like to get advice on how to build generalized additive models in R. Based on the description of gam, which I found on the R website, I specified the following model: model1<-gam(ST~s(MOWST1),family=binomial,data=strikes.S), in which ST is my binary response variable and MOWST1 is a categorical independent variable. I get the

<<< I may misunderstand, but it seems to me that this solves only query for aliasing with a pointer known to be pointing only to globals defined in the current compilation unit. For any pointer which "may point somewhere else”, you won’t be able to resolve the non-aliasing with the “internal state” for malloc/free, right? To take the original example in this thread: int *x =