search for: bb8

...um += i; for (j=0; j<3; j++) sum += 2; } return sum; } ------------------------------------------------------------- I could get the corresponding LLVM assembly with llvm-gcc and llvm-dis: ------------------------------------------------------------- int %foo() { entry: br label %bb8.outer bb8.outer: ; preds = %bb10, %entry %indvar26 = phi uint [ 0, %entry ], [ %indvar.next27, %bb10 ] ; <uint> [#uses=2] %sum.0.pn.ph = phi int [ 0, %entry ], [ %sum.1, %bb10 ] ; <int> [#uses=1] %i.0.0.ph = cast uint %indvar26 to int ; <int> [#uses=1] br label %bb8 bb3:...

Hi All, I need to write as text files 1000 ish variation of the same data frame, once I permute a row. I would like to use the function write.table() to write the files, and use a loop to do it: for (i in 1:1000){ bb8[2,] = sample(bb8[2,]) write.table(bb8, quote = F, sep = '\t', row.names = F, col.names = F, file = 'whatever?????.txt') } so all the files are called whatever1: whatever1000 Any idea? Cheers, Federico -- Federico C. F. Calboli Department of Epidemiology and Public Health Imper...

Hello. I updated my LLVM with version 2.1 from 1.9. But I am curious why I still have signed integer type. I still get LLVM IR as follows: ...... ...... bb8.outer: ; preds = %bb10, %entry %i.0.0.ph = phi uint [ 0, %entry ], [ %indvar.next26, %bb10 ] ; <uint> [#uses=2] %sum.0.pn.ph = phi uint [ 0, %entry ], [ %sum.1, %bb10 ] ; <uint> [#uses=1] br label %bb8 bb3: ; preds = %bb8 %indvar.next = add uint %j.1, 1 ; <uint> [#uses=1...

...er of Basic Blocks To: Benjamin Kramer <benny.kra at googlemail.com> This worked, though the RPO_iterator apparently wasn't what I was looking for anyways, it seems it doesn't rreally go top->down. I have a simple example code, where the block follow this path: BB0->BB1 (T), BB8 (F) BB1-> BB2 (T), BB3 (F) BB2-> BB4 BB3-> BB5 BB4-> BB6 BB5-> BB8 (T), BB5 (F) BB6-> BB7 (T), BB4 (F) BB7-> BB8 (T), BB4 (F) BB8 (end) So, this is the basic block flow graph. When I iterate using the ReversePostOrderTraversal iterator, the basic blocks vistied are in this ord...

...n Tue, 5 Feb 2008, Seung Jae Lee wrote: >> I updated my LLVM with version 2.1 from 1.9. >> But I am curious why I still have signed integer type. > >Did you update your llvm-gcc? > >-Chris > >> I still get LLVM IR as follows: >> ...... >> ...... >> bb8.outer: ; preds = %bb10, %entry >> %i.0.0.ph = phi uint [ 0, %entry ], [ %indvar.next26, %bb10 ] ; <uint> [#uses=2] >> %sum.0.pn.ph = phi uint [ 0, %entry ], [ %sum.1, %bb10 ] ; <uint> [#uses=1] >> br label %bb8 >> >> bb3: ; preds = %bb8 >> %in...

...loop-opt.bc bsloop.bc >you will get the following code for bsloop() function (llvm and >llvm-gcc-4.2 from SVN): >-------------------------------------------------------- >define void @bsloop(i32 %n, i32 %pM, %struct.Params* %ps) { >entry: > br label %bb16 > >bb1: ; preds = %bb8 > %tmp4 = call i32 (...)* @norm( i32 0, i32 1 ) > %indvar.next = add i32 %i.0, 1 > br label %bb8 > >bb8: ; preds = %bb16, %bb1 > %i.0 = phi i32 [ %indvar.next, %bb1 ], [ 0, %bb16 ] > %tmp11 = icmp slt i32 %i.0, %n > br i1 %tmp11, label %bb1, label %bb13 > >bb13: &gt...

...you had suggested upto opt -analyze -loops bsloop-opt.bc Therefore, I could get the prints you had showed me as follows: -------------------------------------------------------- Printing analysis 'Natural Loop Construction' for function 'bsloop': Loop Containing: %bb16, %bb13, %bb8, %bb1 Loop Containing: %bb8, %bb1 -------------------------------------------------------- In your reply, you could re-construct the simple 'for' from the info above like this: -------------------------------------------------------- FOR %i.0 = 0 TO %n - 1 STEP 1: %tmp4 = call i32...

Hello, guys. I am trying to construct higher-level 'for' from the low-level LLVM bitcode(ver 1.9). It's partly successful thanks to David A. Greene's advice suggested to use Control Dependence Graph(CDG). I could find which BB contributes to form which loop with CDG. For example, for this simple function: ----------------------------------------------------------- void bsloop(int

...; preds = %bb7.lr.ph, %bb11 %_tmp39 = sub i16 %_tmp35, %_tmp38 %2 = mul i16 %_tmp39, -10 %_tmp41 = add i16 %2, %subframeCount.12.014 %_tmp45 = add i16 %_tmp41, %_tmp44 %_tmp46 = inttoptr i16 %_tmp45 to i16* %_tmp47 = load i16* %_tmp46, align 1 bb8: ; preds = %bb7 %_tmp52 = add i16 %_tmp41, %_tmp51 %_tmp53 = inttoptr i16 %_tmp52 to i16* %_tmp54 = load i16* %_tmp53, align 1 ... br i1 %_tmp64, label %bb7, label %bb13.loopexit (latch) *** IR Dump After Loop Strength Reduction *** bb7:...

...at my problem >> is, but I have no good ability that I can explain it in this plain >> text space. > >Let me rephrase your question for you. You can then see the right >question, and the answer for it. > >The question is, why is, why can't I change: > > bb8: > sum_1 = i_0_pn + sum_0_pn; > br bool %exitcond, label %bb10, label %bb3 > >into > > bb8: > br bool %exitcond, label %bb10, label %bb3 > sum_1 = i_0_pn + sum_0_pn; > >? > >The answer is, because that is an invalid transform. > > A: &gt...

This is the right answer for C's alloca. The question probably referred to LLVM IR's alloca, however. On Aug 13, 2008, at 11:07 AMPDT, Mike Stump wrote: > On Aug 13, 2008, at 10:49 AM, John Criswell wrote: >> Is it legal to have an alloca in a basic block other than a >> function's entry block? > > How else could you generate code for: > > #include

...() > to label %invcont unwind label %lpad > > invcont: ; preds = %bb5 > %0 = invoke i8 @system__tasking__async_delays__enqueue_duration(i64 > undef, %struct.system__tasking__async_delays__delay_block* undef) > to label %bb8 unwind label %lpad ; <i8> [#uses=0] > > bb8: ; preds = %invcont > invoke void undef() > to label %invcont9 unwind label %lpad75 > > invcont9: ; preds = %bb8 > invoke fas...

Dear Prof.Adve and Bill, I deeply appreciate your comments and concerns. (Please forgive my late response. I've tried some more cases to make this issue) As Prof.Adve mentioned, I need to explain exactly what my problem is, but I have no good ability that I can explain it in this plain text space. For this reason, I made a .pdf file and linked it as follows:

...label %invcont unwind label %lpad >> >> invcont: ; preds = %bb5 >> %0 = invoke i8 @system__tasking__async_delays__enqueue_duration(i64 >> undef, %struct.system__tasking__async_delays__delay_block* undef) >> to label %bb8 unwind label %lpad ; <i8> [#uses=0] >> >> bb8: ; preds = %invcont >> invoke void undef() >> to label %invcont9 unwind label %lpad75 >> >> invcont9: ; preds...

...>>> >>> invcont: ; preds = %bb5 >>> %0 = invoke i8 >>> @system__tasking__async_delays__enqueue_duration(i64 undef, >>> %struct.system__tasking__async_delays__delay_block* undef) >>> to label %bb8 unwind label %lpad ; <i8> [#uses=0] >>> >>> bb8: ; preds = %invcont >>> invoke void undef() >>> to label %invcont9 unwind label %lpad75 >>> >>> invcont9:...

On Jun 8, 2009, at 2:42 PM, robert muth wrote: > On Sun, Jun 7, 2009 at 11:53 PM, Evan Cheng <evan.cheng at apple.com> > wrote: >> >> On Jun 7, 2009, at 6:59 AM, robert muth wrote: >> >>> On Sat, Jun 6, 2009 at 4:51 PM, Evan Cheng<evan.cheng at apple.com> >>> wrote: >>>> +cl::opt<std::string>

...ms 24.082 ms 23.938 ms 9 if-8-0.core2.Montreal.Teleglobe.net (207.45.204.45) 24.131 ms 28.688 ms 23.979 ms 10 if-5-0.core1.Montreal.Teleglobe.net (64.86.81.161) 31.982 ms 32.135 ms 31.871 ms 11 if-2-0.core2.NewYork.Teleglobe.net (64.86.83.226) 31.661 ms 35.130 ms 31.761 ms 12 if-4-0.bb8.NewYork.Teleglobe.net (66.110.8.130) 31.131 ms 31.034 ms 31.048 ms 13 ix-8-0-1.bb8.NewYork.Teleglobe.net (207.45.198.74) 31.546 ms 33.218 ms 31.736 ms 14 0.so-6-1-0.XL1.NYC9.ALTER.NET (152.63.22.226) 31.961 ms 31.568 ms 31.547 ms 15 0.so-4-0-0.TL1.NYC9.ALTER.NET (152.63.0.173) 31.841 m...

On Sun, Jun 7, 2009 at 11:53 PM, Evan Cheng <evan.cheng at apple.com> wrote: > > On Jun 7, 2009, at 6:59 AM, robert muth wrote: > >> On Sat, Jun 6, 2009 at 4:51 PM, Evan Cheng<evan.cheng at apple.com> >> wrote: >>> +cl::opt<std::string> FlagJumpTableSection("jumptable-section", >>> +                                          

Hi Jakub, interesting patch. I ran it over the Ada testsuite and this picked up some problems even without enabling dse-ssu. For example, "opt -inline -dse -domtree" crashes on the attached testcase. Ciao, Duncan. -------------- next part -------------- An embedded and charset-unspecified text was scrubbed... Name: dom_crash.ll URL:

Ok. Let me describe the problem again in some detail. The following is the original bitcode from a real testcase: bb7: %46 = load i32* %j, align 4 %47 = add nsw i32 %46, 1 store i32 %47, i32* %j, align 4 br label %bb8 To protect the operand of the store I duplicate the input chain of operands and insert a comparison to check whether the operand of the stores are correct. As a result of this modification the code looks as follows. Here instructions with HV in there name are extra inserted instructions and relExi...