similar to: Dependence analysis - missing loop-carried dependencies?

Hi all. We have a win32 application linked to Far Point's Spread32 library; the application crashes when referencing a NULL pointer returned by GlobalLock, but obviously it runs perfectly under win98SE (see previous post about GetWindowLongA) . The behaviour of SCROLL_GetPtrScrollInfo, with nBar parameter = SB_CTL, is to return wndPtr->wExtra as it were a pointer. Actually we found that,

Hi Philip, Thanks for checking! I'm running my own Foo pass that registers DependenceAnalysisWrapperPass as a prerequisite and then I run it like so: opt -load libfoo.so -foo example.bc This is LLVM 3.9. Cheers, - Stan On Wed, Jun 21, 2017 at 5:40 PM, Philip Pfaffe <philip.pfaffe at gmail.com> wrote: > Hi Stan, > > in both cases I get a consistent anti result. Can you

I currently use following approach but its failing Find Max memory using following API         vdgiRet = virDomainGetInfo(domPtr, infoPtr);         memTotal = infoPtr->memory; Find current utilization using following API                 rVal = virDomainMemoryStats (domPtr, memStats, VIR_DOMAIN_MEMORY_STAT_NR, 0) ;         for (i = 0; i < rVal; i++)         {             if

Hello llvm-dev, I'm running a pass that uses the result of llvm::DependenceAnalysisWrapperPass to compute the dependencies between all instructions of a loop. I have the following two examples of code I wish to analyse: example A: ``` void move_one(int *A, unsigned n) { for (unsigned i = 0; i < n-1; ++i) { A[i] = A[i + 1]; } } ``` and example B: ``` void move_one_alt(int *A,

Hi Philip, I forgot to mention that I was ignoring loop-independent dependences. If I don't I get an inconsistent, ordered, anti, loop-independent dependence and an inconsistent, ordered, flow, loop-carried dependence for example A. At the same time I get just a consistent, ordered, anti, loop-independent dependence for example B. Here's the .ll code for example A: *; Function Attrs:

Why am i always getting this crash ?? I dont understand how can I make this work wine: Unhandled page fault on read access to 0x00000064 at address 0x7e72d7a6 (thread 0009), starting debugger... Unhandled exception: page fault on read access to 0x00000064 in 32-bit code (0x7e72d7a6). Register dump: CS:0073 SS:007b DS:007b ES:007b FS:0033 GS:003b EIP:7e72d7a6 ESP:00334b7c EBP:00334b94

Hi, Thanks for the tips. I tried with winetricks but gave me a problem to get this installed, I finally did it semi-manual. As you said I could open an sample set but nothing more. I then upgraded to wine 1.3.8 today. Will this overwrite the winetricks dll's or not? I could start the application open and save a dataset although they seem to be empty!?. I started to move deeper into the

Hi, Earlier this year I "upgraded" from wine 20010510 to 20011226 in order to see if some kind of resource leak was fixed which caused screen redraws to get progressively slower and slower and slower and slower, .... That was fixed but there seemed to be a significant number of graphics and UI regressions. I've just upgraded to 20020228 to see if things were any better and within

Hi Wenhao Jia, On Wed May 13 16:30:36 +0200 2009, Wenhao Jia wrote: > Does anyone know if there is any existing code I can use to do a > loop-carried dependence analysis for LLVM IR programs? I searched the > mailing-list archive and it seems like someone planned to implement a > loop dependence analysis pass in March. I'm just wondering if this > project is ongoing/finished or

Hello everyone, I intend to build a pass to profile some benchmarks for loop carried dependencies. At first I tried looking at LoopDependenceAnalysis.{h,cpp} but the files were removed for some reason. So I continued with the DependenceAnalysis pass. But the flow, anti dependence, etc methods are only reporting sequential and not loop carried dependencies. Does LLVM support loop carried

I have set up asterisk with an ISDN card using i4l. When I place a call from ISDN to a SIP client, there is about a one-second delay from a word is spoken to it is heard at the other end. The funny thing, is that the last second or so of each call is saved somewhere in the depths of Asterisk and then played back at the beginning of the next call. I have read it is a known problem, can

I've looked around and not found details on the expected frequency range the Speex codec can be expected to carry. Is there any documentation available or a table of some sort that has been compiled which would give an indication of the frequency range based on the various compression options in speex? Best regards, Baldvin Hansson Reykjavik, Iceland baldvin@baldvin.com -------------- next

Hi R-helpers I'm looking for a vectorised function which does missing value replacement as in last observation carried forward in the zoo package but instead of a locf, I would like the locf function to add +1 to each time a missing value occurred. See below for an example. > require(zoo) > x <- 5:15 > x[4:7] <- NA > coredata(na.locf(zoo(x))) [1] 5 6 7 7 7 7 7 12 13

Hi, Does anyone know if there is any existing code I can use to do a loop-carried dependence analysis for LLVM IR programs? I searched the mailing-list archive and it seems like someone planned to implement a loop dependence analysis pass in March. I'm just wondering if this project is ongoing/finished or if there is other projects that may have the code I'm interested in. Thanks!

I have a dataset. Initially, it has 25 levels for a certain factor, Description. However, I then subset it, because I am only interested in 2 of the 25 factors. When I subset it, I get the following. The vector lists only the two factors, yet there remain 25 levels: > Quadrats.df$Description [1] Emergent 25x75 Emergent 25x75 Emergent 25x75 Emergent 25x75 Emergent 25x75 Emergent 25x75

Hi Michael, Thanks for your answer. Checking the indexes looks as an another straightforward approach to identify the actual loop-carried dependencies. What is not clear to me still is how it looks like the code to extract the ScopArrayInfo pointer from the user part. Miguel On 08/05/2016 02:32 PM, Michael Kruse wrote: > I just realized this is a crossposting llvm-dev/polly-dev. It has

Hmm writing a blog post about TNTC is beyond the time I have right now. Here is some high level documentation of the layout of Heap objects in GHC: http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts/Storage/HeapObjects#InfoTables With TNTC enabled we generate code for closures of this form: .text .align 8 .long Main_main1_srt-(Main_main1_info)+0 .long 0 .quad 4294967299 .quad 0

I am trying to create unit tests for my users model but when I add a test that destroys a user, that user is not available in any of the other test. If I remove the test that destroys the user all my other tests work again. All the fixtures are suppose be reloaded between tests right? Here is my testcase : require File.dirname(__FILE__) + ''/../test_helper'' class UserTest

Preston, thanks for the explanation and patch. Now it's printing the direction and distance values. On Tue, Nov 13, 2012 at 12:22 PM, Preston Briggs <preston.briggs at gmail.com>wrote: > Erkan, you're right. Sorry about that. > Attached is the most recent version. > > Preston > > > > Hi Preston, >> I am trying to use DA as well. I used your example

Hi, I have a series of id's with multiple visits and questionnaire scores. This is a clinical trial that will be analyzed using the last observation carried forward method. In other words, in order to comply with intent to treat analysis when many subjects withdraw, data points for the last visit must be generated and filled in with the last observation. The ultimate goal is to tabulate the