search for: bb2

So my best bet is to try and work in reg2mem mode and then go back to mem2reg? I'm curious, it seems though when you split a block that the phis get updated, right? On Thu, Feb 2, 2012 at 5:05 PM, Eric Christopher <echristo at apple.com> wrote: > Not that I'm aware of. > > -eric > > On Feb 2, 2012, at 3:47 PM, Ryan Taylor wrote: > > So essentially I'm

...ck to do this. It should just take a >> little bit of work to get what you want done. >> >> -eric >> > > Yes, the first DOES sound painful (I want to avoid it) and the second is > not an option. I'm adding a second path in a loop. > > The old path: BB1->BB2/BB3, BB2->BB1/BB3, BB3->n/a > > The new path: BB1->H/BB2, BB2->F/K, H->F, K->F, F->BB1/G, G->BB3 > > There are PHI nodes in BB1 that come in from BB2 for values defined in > BB2. With the new possible path: BB1->H->F, BB2. Without adding new PHIs or &gt...

...; Function Attrs: ssp uwtable define i32 @test1(%struct2* %dm, i1 %tmp4, i64 %tmp9, i64 %tmp19) { bb: br i1 %tmp4, label %bb1, label %bb2 bb1: ; preds = %bb5 %tmp10 = getelementptr inbounds %struct2* %dm, i64 %tmp9, i32 0 br label %bb3...

...>>> little bit of work to get what you want done. >>> >>> -eric >>> >> >> Yes, the first DOES sound painful (I want to avoid it) and the second is >> not an option. I'm adding a second path in a loop. >> >> The old path: BB1->BB2/BB3, BB2->BB1/BB3, BB3->n/a >> >> The new path: BB1->H/BB2, BB2->F/K, H->F, K->F, F->BB1/G, G->BB3 >> >> There are PHI nodes in BB1 that come in from BB2 for values defined in >> BB2. With the new possible path: BB1->H->F, BB2. Without ad...

...39;s code in splitBasicBlock to do this. It should just take a little bit of work to get what you want done. > > -eric > > Yes, the first DOES sound painful (I want to avoid it) and the second is not an option. I'm adding a second path in a loop. > > The old path: BB1->BB2/BB3, BB2->BB1/BB3, BB3->n/a > > The new path: BB1->H/BB2, BB2->F/K, H->F, K->F, F->BB1/G, G->BB3 > > There are PHI nodes in BB1 that come in from BB2 for values defined in BB2. With the new possible path: BB1->H->F, BB2. Without adding new PHIs or Valu...

Hi, I'm new to R having recently migrated from Splus 2000. I'm having trouble using help.start(). When I launch R help using help.start(), the index.html page comes up with the various manuals, etc. If I click on one of the links, e.g. Search Engine and Keywords, the next page (Keywords by Topic) comes up. However, if I click on any item, e.g. attributes, nothing at all happens.

I guess I didn't have a clear question. Suppose we have BB1 and BB2 both point to BB3. BB1 has variable x. BB2 also as variable x. BB3 will have PHINode for x with 2 value from BB1 and BB2. BB1 BB2 \ / BB3 Now if BB1 and BB2 is extracted into a function (using ExtractCodeRegion), they will be replaced by a basic block called codeRepl (which has a c...

Dear All, Is there a pass (or set of passes) that will replace a phi whose input operands all compute the same value with an instruction that computes that value? In other words, something that will convert: define internal i32 @function(i32 %x) { ... bb1: %y = add %x, 10 ... bb2: %z = add %x, 10 ... bb3: %phi = [bb1, %y], [bb2, %z] into define internal i32 @function(i32 %x) { ... bb1: ... bb2: ... bb3: %phi = add %x, 10 -- John T.

...has 6 levels, B has 2 levels, > levels(dd$A)=c("A1", "A2", "A3", "A4", "A5", "A6") > levels(dd$B)=c("b1", "b2") My question is how to interpret the resultant coefficients. What are the bases of "dd$AA2:dd$Bb2" and "dd$AA3:dd$Bb2", etc. ? I am having a hard time to understand the result and making sense out of the numbers... Please help me ! Thank you! > zz=lm(formula = (dd$Y) ~ dd$A * dd$B) > summary(zz) Call: lm(formula = dd$Y~ dd$A * dd$B) Residuals: Min 1Q Media...

On 01/26/2011 07:50 PM, Vu Le wrote: > I guess I didn't have a clear question. > > Suppose we have BB1 and BB2 both point to BB3. > BB1 has variable x. BB2 also as variable x. > BB3 will have PHINode for x with 2 value from BB1 and BB2. > BB1 BB2 > \ / > BB3 > > Now if BB1 and BB2 is extracted into a function > (using ExtractCodeRegion), they will be replaced by &gt...

Hi all, I have problem with ExtractCodeRegion (CodeExtractor.cpp). My original program is as follows. bb: ... %tmp.15 = load %struct.MYSQL_ROWS** %3, align 4 ... bb1: ... %tmp.1 = load %struct.MYSQL_ROWS** %6, align 4 ... bb4: ; preds = %bb1, %bb, %entry %tmp.0 = phi %struct.MYSQL_ROWS* [ null, %entry ], [ %tmp.15, %bb ], [ %tmp.1, %bb1 ]

...ocedures: 1. Get the BasicBlock containing the BranchInst which has 2 successors(in order to keep consistent with the source code I am using the llvm ir without any optimizations, so SelectInst/SwitchInst/PHINode is absent), one of which should be pruned; let's name these 2 branches bb1 and bb2 and bb2 is to be pruned. 2. Find their nearest common post dominator, bb_join 3. Create a new branInst bb_new whose successors are bb1 and bb_join; replace the original BranchInst with bb_new 4. For bb2, dropAllReferences && eraseFromParent However since bb2 also has several succe...

...this bytecode: ; ModuleID = 'main.bc' target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:6 4-v64:64:64-v128:128:128-a0:0:64-f80:32:32" target triple = "i386-pc-linux-gnu" define i32 @FnVarArgs(i32 %a, ...) nounwind { bb2.thread: %ptArgument = alloca i8*, align 4 ; <i8**> [#uses=3] %ptArgument1 = bitcast i8** %ptArgument to i8* ; <i8*> [#uses=1] call void @llvm.va_start(i8* %ptArgument1) br label %bb2 bb2: ; pred...

On Feb 2, 2012, at 5:13 PM, Ryan Taylor wrote: > So my best bet is to try and work in reg2mem mode and then go back to mem2reg? > I wouldn't. That sounds painful. > I'm curious, it seems though when you split a block that the phis get updated, right? Sure. There's code in splitBasicBlock to do this. It should just take a little bit of work to get what you want done.

...can be handled by inserting the code to extract that value in the goto-target block: bb1: ... %x.bb1 = callbr i32 asm sideeffect "...", "=r,X"(i32 *%x*, i8* blockaddress(@bar, %goto.target)) to label %fallthrough1 [label %goto.target] fallthrough1: ... bb2: ... %y.bb2 = callbr i32 asm sideeffect "...", "=r,X"(i32 *%y*, i8* blockaddress(@bar, %goto.target)) to label %fallthrough2 [label %goto.target] fallthrough2: ... goto.target: %x.goto = <extract value from %x.bb1> %y.goto = <extract value...

...ss (or set of passes) that will replace a phi whose input operands > all compute the same value with an instruction that computes that value? In > other words, something that will convert: > > define internal i32 @function(i32 %x) { > ... > bb1: > %y = add %x, 10 > ... > bb2: > %z = add %x, 10 > ... > bb3: > %phi = [bb1, %y], [bb2, %z] > > into > > define internal i32 @function(i32 %x) { > ... > bb1: > ... > bb2: > ... > bb3: > %phi = add %x, 10 yes, GVN should replace %y and %z with the same register, giving something like...

...;> input operands >> all compute the same value with an instruction that computes that >> value? In >> other words, something that will convert: >> >> define internal i32 @function(i32 %x) { >> ... >> bb1: >> %y = add %x, 10 >> ... >> bb2: >> %z = add %x, 10 >> ... >> bb3: >> %phi = [bb1, %y], [bb2, %z] >> >> into >> >> define internal i32 @function(i32 %x) { >> ... >> bb1: >> ... >> bb2: >> ... >> bb3: >> %phi = add %x, 10 > > yes, GVN s...

...es always dominated by their unreachable defs? I think the comment is just just missing an "otherwise" at the start. If we were to define dominance rules as you suggest, we would still accept define void @f() { bb0: ret void bb1: %a = getelementptr inbounds i8* %b, i64 1 ret void bb2: %b = getelementptr inbounds i8* %a, i64 1 ret void } Since bb1 dominates bb2 and bb2 dominates bb1, no? It looks like a case where we would just be getting a bigger rug to swipe dirt under. I think the definition we have is sound. It creates odd cases, but, as you point out, it looks like we...

...lock: > > > bb1: > > ... > > %x.bb1 = callbr i32 asm sideeffect "...", "=r,X"(i32 *%x*, i8* > blockaddress(@bar, %goto.target)) > > to label %fallthrough1 [label %goto.target] > > > fallthrough1: > > ... > > > bb2: > > ... > > %y.bb2 = callbr i32 asm sideeffect "...", "=r,X"(i32 *%y*, i8* > blockaddress(@bar, %goto.target)) > > to label %fallthrough2 [label %goto.target] > > > fallthrough2: > > ... > > > goto.target: > >...

...int j = 0; for (; j < 8; j++) { printf("%c\n", argv[i][j]); } } } It prints the following info, where all the trip counts are zero. What am I doing wrong? Hello: main Loop at depth 1 containing: %bb4<header><exiting>,%bb3<latch>,%bb2,%bb,%bb1 Loop at depth 2 containing: %bb2<header><exiting>,%bb1<latch> BB: bb Is simplifyed loop? 1 Tripcount 0 Induction variable: printing a <null> value Loop at depth 2 containing: %bb2<header><exiting>,%bb1<latch> BB: bb1 Is simplifyed loo...