search for: nonlocally

Hi, I have a question about the memory dependence analysis. I am trying to use it to selectively enumerate a set of pairs of (load, store) instructions for every function by calling getNonLocalDependency() on the MemoryDependenceAnalysis. This populates a DenseMap<BasicBlock*, Value*>. I just looked up an usage of this in GVN.cpp: MD->getNonLocalDependency(C, deps); for

Hi, MemDep caches results for local queries and provides means to invalidate them by keeping reverse maps. Unfortunately, it also caches results that represent non-local dependencies, for which there are no reverse map entries, and thus those entries can not be invalidated. This is a problem when an optimization turns a non-local dependency into a local one.

On Jul 28, 2008, at 3:47 PM, Prakash Prabhu wrote: > Hi, > > I have a question about the memory dependence analysis. I am trying > to use it to selectively enumerate a set of pairs of (load, store) > instructions for every function by calling getNonLocalDependency() > on the MemoryDependenceAnalysis. This populates a > DenseMap<BasicBlock*, Value*>. I just

On Sun, 04 May 2008 16:05:44 +0000, Hendrik Boom wrote: > The languages I'm faced with compiling in the near future have nonlocal > go to statements and nested procedures. > > A procedure gets implemented as a structure containing its entry point > and an environment pointer. It is easy enough to call its entry point > and pass the environment pointer as an extra argument

On May 4, 2008, at 9:05 AM, Hendrik Boom wrote: > The languages I'm faced with compiling in the near future have > nonlocal goto statements and nested procedures. You want to return to a previous activation record (pascal speak) or stack frame? If yes, then yes, EH will do that for you. You'll want to understand what EH is in detail and how to map the semantics you want

The languages I'm faced with compiling in the near future have nonlocal go to statements and nested procedures. A procedure gets implemented as a structure containing its entry point and an environment pointer. It is easy enough to call its entry point and pass the environment pointer as an extra argument (rather like the pointer to this or self in object-oriented code). It's no

On Mon, 05 May 2008 09:56:26 +0200, Duncan Sands wrote: > Hi, > >> The problem is with the go to statement. Again, local go to's, that go >> somewhere within the same function are no particular problem -- though >> I haven't studied the interaction with alloca yet; that might offer a >> few surprises. The questions I have are about goto's that exit

Hi, > The problem is with the go to statement. Again, local go to's, that go > somewhere within the same function are no particular problem -- though I > haven't studied the interaction with alloca yet; that might offer a few > surprises. The questions I have are about goto's that exit from a > function. The traditional mechanism is to implement a label as an

Thanks for the quick reply, Owen. I went through the code in MemoryDependenceAnalysis.cpp again. Since DenseMap<BasicBlock*, Value*> maps a BasicBlock to a single Value (Instruction) and it is populated by a DFS on the reverse Control Flow Graph starting at the query instruction's block, is it correct to say that the last dependent instruction in each visited basic block is what is

On Jul 22, 2013, at 12:56 AM, Duncan Sands <baldrick at free.fr> wrote: > my understanding is different. I'm pretty sure that what I'm about to say is > the traditional way these things have been viewed in LLVM. That doesn't mean > that it's the best way to view these things. > >> - nounwind means no dwarf EH. Absence > > I guess you mean

Hi Andrew, On 22/07/13 10:23, Andrew Trick wrote: > > On Jul 22, 2013, at 12:56 AM, Duncan Sands <baldrick at free.fr > <mailto:baldrick at free.fr>> wrote: > >> my understanding is different. I'm pretty sure that what I'm about to say is >> the traditional way these things have been viewed in LLVM. That doesn't mean >> that it's the

Thank you so much David, here is correction: d1=suppressWarnings(read.csv("/Users/anamaria/Downloads/B1.csv", stringsAsFactors=FALSE, header=TRUE)) d1$X <- NULL d2=as.matrix(sapply(d1, as.numeric)) pdf("~/graph.pdf") b<-barplot(d2, legend= c("SYCL", "CUDA"), beside= TRUE,las=2,cex.axis=0.7,cex.names=0.7,ylim=c(0,80), col=c("#9e9ac8",

...code that leads me to believe this is to prevent counting spoofed packets and a DOS. My problem is that the update occurs after the netfilter hooks which may = do weird things to change the course of the packet so that it does not = get counted. (in my case, redirecting, queueing to userspace, nonlocally bound = sockets, etc). For me this causes packets to go spewing out on the wrong interface when = the timer expires. I used the attached patch to revert back to the old method. -Dirk -------------- next part -------------- A non-text attachment was scrubbed... Name: bridge-mac-ageing-fix.patch...

Hi, Does anyone have iFolder server going on Centos 5? I'd like to secure and try it from another nonlocal machine, and was wondering any problems? Thanks. Dave.

Hi, I would like to set up access to Internet via two providers. When they both works OK I use ip route add default scope global nexthop via x.x.x.x dev eth0 weight 1 nexthop via y.y.y.y.y dev eth1 weight 1 Next, I use script that regularly pings their upper providers for see if some of providers are down. If one is down I want to guide all communications via other interface. If second one

Hi everyone, I am in the process of adding some new code for th ARM/MC ELF emission, but noticed a curious linkage between th AsmPrinter and the MC. It looks like the MC code (on X86 at least) calls out to the (misnamed?) AsmPrinter to dump out ELF bits (in X86AsmPrinter.cpp) in the same routine, using conditional branching.... As JimG and I are working both on ARM emission stuff, I want to

Hello, I have a data frame like this: d11=suppressWarnings(read.csv("/Users/anamaria/Downloads/B1.csv", stringsAsFactors=FALSE, header=TRUE)) > d11 X Domain.decomp. DD.com..load Neighbor.search Launch.PP.GPU.ops. Comm..coord. 1 SYCL 2. 1 0 3.7 0. 1 1 .6 2 CUDA 2 0 3. 1 0 1 .0

Howdy, I'm working on writing a dependence analyzer (rather like what LoopDependenceAnalysis wants to be, except a bit more general). While this is a problem of many parts, I'm currently focusing on finding pairs of memory references to test for dependence. Consider this contrived C code: double test2(int n, double *restrict A, double *restrict B, bool flag) { if (flag) { A[0] =

--- plugins/python/nbdkit-python-plugin.pod | 19 ++++++- plugins/python/python.c | 75 +++++++++++++++++++++++++ tests/test-python-plugin.py | 8 ++- tests/test_python.py | 73 +++++++++++++++++++++++- 4 files changed, 169 insertions(+), 6 deletions(-) diff --git a/plugins/python/nbdkit-python-plugin.pod b/plugins/python/nbdkit-python-plugin.pod

On Sep 2, 2009, at 1:07 AM, Jakub Staszak wrote: > Hello, > > I fixed my patch as you asked. Sorry for the delay, I'd been working > on my SSU patch (http://lists.cs.uiuc.edu/pipermail/llvmdev/2009-August/025347.html > ) > > I hope that everything is fine now. Hey Jakub, Thanks for working on this again, one more round :) Please merge the three testcases into one