search for: outermost

Hello, I want to insert a control-block before every outermost loop. My current solution is: 1) find each outermost loop in some function; 2) find the loop header with Loop->getHeader() APIs, and then insert the controller block before the header block of current loop. But I encounters problems when there multi subsequent loops in the following example, wh...

...quot;tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>>>>>>> >>>>>>> >>>>>>> This can get quite deep quite quickly. >>>>>>> Are there actually cases where knowing the outermost aggregate type + >>>>>>> {byte offset, size} of field access does not give you the exact same >>>>>>> disambiguation capability? >>>>>> The answer is no. We should be able to deduce the access path from {byte offset, size}. >>>&gt...

...t;>>> !C::b2.a.x := [ "tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>>>>> >>>>> >>>>> This can get quite deep quite quickly. >>>>> Are there actually cases where knowing the outermost aggregate type + >>>>> {byte offset, size} of field access does not give you the exact same >>>>> disambiguation capability? >>>> The answer is no. We should be able to deduce the access path from {byte offset, size}. >>>> However, I don't k...

...!C::b2.a.x := [ "tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>>>>>> >>>>>> >>>>>> This can get quite deep quite quickly. >>>>>> Are there actually cases where knowing the outermost aggregate type + >>>>>> {byte offset, size} of field access does not give you the exact same >>>>>> disambiguation capability? >>>>> The answer is no. We should be able to deduce the access path from {byte offset, size}. >>>>> Howeve...

...where !3 is the struct node for "B" The type DAG for the example: int <- 0 <- A int <- 4 <- A <- 0 <- B <- 0 <- C <- 0 <- D int <-------------- 8 <- B <- 12 <- C any pointer <--------------- 24 <- C B> The tag will be (outermost struct type node, offset, size, the last type node) For example, the tag for C::b2.a.x will be !7 = [ "tbaa.offset", !C, 12, 4, !int] ;C::b2.a.x The last field of the tag is to handle alias(D::c, A::x), the tags will be [!D, 0, 32, !C] and [!A, 0, 4, !int], we only need to che...

Leroy Tennison writes: > I am going to take a really wild guess and say "Try replacing the outermost quotes with single quotes or escape the double quotes around the numeral 1". Your second example has double quotes within double quotes and I'm wondering if that's getting rendered as "yum --debuglevel=" 1 " install ..." (extra space added for emphasis)....

...", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>>>>>>>> >>>>>>>> >>>>>>>> This can get quite deep quite quickly. >>>>>>>> Are there actually cases where knowing the outermost aggregate type + >>>>>>>> {byte offset, size} of field access does not give you the exact same >>>>>>>> disambiguation capability? >>>>>>> The answer is no. We should be able to deduce the access path from {byte offset, size}. &gt...

...C::b2", !B, "B::a", !A, "A::x", !int ] >>>>>>>>>> >>>>>>>>> >>>>>>>>> This can get quite deep quite quickly. >>>>>>>>> Are there actually cases where knowing the outermost aggregate type + >>>>>>>>> {byte offset, size} of field access does not give you the exact same >>>>>>>>> disambiguation capability? >>>>>>>> The answer is no. We should be able to deduce the access path from {byte offset...

...B, "B::a", !A, "A::x", !int ] >>>>>>>>>>> >>>>>>>>>> >>>>>>>>>> This can get quite deep quite quickly. >>>>>>>>>> Are there actually cases where knowing the outermost aggregate type + >>>>>>>>>> {byte offset, size} of field access does not give you the exact same >>>>>>>>>> disambiguation capability? >>>>>>>>> The answer is no. We should be able to deduce the access path from...

Hi, My pass heavily relies on llvm::Loop's getSmallConstantTripCount method. However, I found that it doesn't work for some simple cases. In the following example, I can get the constant trip count of the outermost loop if statement "a[l] = a[l] + 1" is there. After commenting out this line, the returned constant trip count for that loop is 0. In my pass, I traverse the nested loops starting from statement "a[i] = b[i] * b[i+1]; ", and use a for loop to traverse each parent loop. void f(i...

...nce of nodes in the type DAG. >>>> !C::b2.a.x := [ "tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>>> >>> >>> This can get quite deep quite quickly. >>> Are there actually cases where knowing the outermost aggregate type + >>> {byte offset, size} of field access does not give you the exact same >>> disambiguation capability? >> The answer is no. We should be able to deduce the access path from {byte offset, size}. >> However, I don't know an easy way to check alias(x...

wwp writes: > Hello isdtor, > > > On Fri, 24 May 2019 09:33:55 +0100 isdtor <isdtor at gmail.com> wrote: > > > Leroy Tennison writes: > > > I am going to take a really wild guess and say "Try replacing the outermost quotes with single quotes or escape the double quotes around the numeral 1". Your second example has double quotes within double quotes and I'm wondering if that's getting rendered as "yum --debuglevel=" 1 " install ..." (extra space added for emphasis)....

...to catch an exception that is "passed through" an LLVM ExecutionEngine but I am unable to do so. Specifically, in C++ code, inside a try/catch block, I call a JITted function, which in turn calls back into my code. Everything works fine unless an exception is thrown; I would except the outermost try/catch(...) block to catch the exception thrown in my innermost C++ code, but instead I get the abort "terminate called after throwing an instance of 'MyException'". I am compiling the system with g++ (on Linux and OSX); I haven't tried MSVC++. Is there something that I n...

...e type DAG. >>>>> !C::b2.a.x := [ "tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>>>> >>>> >>>> This can get quite deep quite quickly. >>>> Are there actually cases where knowing the outermost aggregate type + >>>> {byte offset, size} of field access does not give you the exact same >>>> disambiguation capability? >>> The answer is no. We should be able to deduce the access path from {byte offset, size}. >>> However, I don't know an easy way...

...;, !A, "A::x", !int ] >>>>>>>>>>>> >>>>>>>>>>> >>>>>>>>>>> This can get quite deep quite quickly. >>>>>>>>>>> Are there actually cases where knowing the outermost aggregate type + >>>>>>>>>>> {byte offset, size} of field access does not give you the exact same >>>>>>>>>>> disambiguation capability? >>>>>>>>>> The answer is no. We should be able to deduce the acces...

I have data for several rings of a left heart chamber, and which I would like to display in concentric rings, with color-encoding of the values. Each ring corresponds to one slice through the heart, and the rings correspond to positions from the base to the apex of the heart as you move from the outermost ring to the innermost one. The data have a circular pattern. These types of displays are referred to as bullseye displays in the nuclear medicine literature. Does any reader of these messages know of a R function/package that offers this functionality? Also I noticed that in some contexts you can...

...ach tag can be a sequence of nodes in the type DAG. >>> !C::b2.a.x := [ "tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >>> >> >> This can get quite deep quite quickly. >> Are there actually cases where knowing the outermost aggregate type + >> {byte offset, size} of field access does not give you the exact same >> disambiguation capability? > The answer is no. We should be able to deduce the access path from {byte offset, size}. > However, I don't know an easy way to check alias(x,y) given {byte...

...e tags. >> Each tag can be a sequence of nodes in the type DAG. >> !C::b2.a.x := [ "tbaa.path", !C, "C::b2", !B, "B::a", !A, "A::x", !int ] >> > > This can get quite deep quite quickly. > Are there actually cases where knowing the outermost aggregate type + > {byte offset, size} of field access does not give you the exact same > disambiguation capability? The answer is no. We should be able to deduce the access path from {byte offset, size}. However, I don't know an easy way to check alias(x,y) given {byte offset, size} for...

There was a thread about C7 bash completion back in August last year, but it doesn't have answers for this problem. Example: "yum install /path/to/local/package" works fine with tab completion to fill in the path and package bits. However, "yum --debuglevel="1" install ..." just gets stuck and doesn't offer anything. The only option is to type everything

...to catch an exception that is "passed through" an LLVM ExecutionEngine but I am unable to do so. Specifically, in C++ code, inside a try/catch block, I call a JITted function, which in turn calls back into my code. Everything works fine unless an exception is thrown; I would except the outermost try/catch(...) block to catch the exception thrown in my innermost C++ code, but instead I get the abort "terminate called after throwing an instance of 'MyException'". I am compiling the system with g++ (on Linux and OSX); I haven't tried MSVC++. >> >> Is there...