search for: next1

Hi, I have the following IR code </snippet> %prev = getelementptr inbounds %struct.myStruct* %node, i32 0, i32 1 %1 = load %struct.myStruct** %prev, align 4, !tbaa !0 %next1 = getelementptr inbounds %struct.myStruct* %1, i32 0, i32 0 store %struct.myStruct* %0, %struct.myStruct** %next1, align 4, !tbaa !0 %2 = load %struct.myStruct** %prev, align 4, !tbaa ! </snippet> myStruct is defined as struct myStruct { struct myStruct *next; struct myStruct *prev; }...

..., Oct 25, 2012 at 3:15 PM, Pranav Bhandarkar <pranavb at codeaurora.org>wrote: > Hi, > > I have the following IR code > > </snippet> > %prev = getelementptr inbounds %struct.myStruct* %node, i32 0, i32 1 > %1 = load %struct.myStruct** %prev, align 4, !tbaa !0 > %next1 = getelementptr inbounds %struct.myStruct* %1, i32 0, i32 0 > store %struct.myStruct* %0, %struct.myStruct** %next1, align 4, !tbaa !0 > %2 = load %struct.myStruct** %prev, align 4, !tbaa ! > </snippet> > > myStruct is defined as > > struct myStruct { > struct myStr...

...4 = 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: > %indvar.next1 = add i32 %sim.0, 1 > br label %bb16 > >bb16: > %sim.0 = phi i32 [ 0, %entry ], [ %indvar.next1, %bb13 ] > %tmp19 = icmp slt i32 %sim.0, %pM > br i1 %tmp19, label %bb8, label %return > >return: > ret void >} >--------------------------------------------------------...

..., "crtend" ] %i = external global int ; <int*> [#uses=2] %j = external global int ; <int*> [#uses=3] implementation ; Functions: int %_Z3fooi(int %k) { entry: %tmp.24 = setgt int %k, 0 ; <bool> [#uses=1] %tmp.35 = load int* %i ; <int> [#uses=2] br label %next1 ; br bool %tmp.24, label %no_exit.preheader, label %loopexit next1: br bool %tmp.24, label %next2, label %next3 next2: %tmp.100 = add int %tmp.35, 1 store int %tmp.100, int* %j br label %next3 next3: br bool %tmp.24, label %next4, label %next5 next4: %tmp.102 = add int %tmp.35, 4 store in...

...unwind > %tmp5 = icmp eq i32 %sel, %tmp4 > br i1 %tmp5, label %invoke.cont7, label %eh.next > > eh.next: > %tmp6 = tail call i32 @llvm.eh.typeid.for(i8* bitcast (i8** @_ZTId to i8*)) nounwind > %tmp7 = icmp eq i32 %sel, %tmp6 > br i1 %tmp7, label %invoke.cont20, label %eh.next1 > > eh.next1: > %ehspec.fails = icmp slt i32 %sel, 0 > br i1 %ehspec.fails, label %ehspec.unexpected, label %eh.resume > > eh.resume: > resume { i8*, i32 } %exn.val > > ehspec.unexpected: > tail call void @__cxa_call_unexpected(i8* %exn) noreturn > unreachab...

The linker is going off in the weeds trying to parse the dwarf unwind info. The CIE has: Leh_frame_common_begin0: .long 0 ## CIE Identifier Tag .byte 1 ## DW_CIE_VERSION .asciz "zLR" ## CIE Augmentation .byte 1 ## CIE Code Alignment Factor .byte 120 ## CIE Data Alignment

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

Hi, If I type define i32 @main() gc "shadow-stack" { entry: %0 = alloca i8* %1 = call i8* @malloc(i64 1) store i8* %1, i8** %0 call void @llvm.gcroot(i8** %0, i8* null) ret i32 0 } declare i8* @malloc(i64) declare void @llvm.gcroot(i8**, i8*) nounwind in test.ll and then do > llc test.ll > gcc test.s I get the error ld: in

...4 = 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: > %indvar.next1 = add i32 %sim.0, 1 > br label %bb16 > >bb16: > %sim.0 = phi i32 [ 0, %entry ], [ %indvar.next1, %bb13 ] > %tmp19 = icmp slt i32 %sim.0, %pM > br i1 %tmp19, label %bb8, label %return > >return: > ret void >} >--------------------------------------------------------...

...tcast (i8** @_ZTIi to i8*)) nounwind %tmp5 = icmp eq i32 %sel, %tmp4 br i1 %tmp5, label %invoke.cont7, label %eh.next eh.next: %tmp6 = tail call i32 @llvm.eh.typeid.for(i8* bitcast (i8** @_ZTId to i8*)) nounwind %tmp7 = icmp eq i32 %sel, %tmp6 br i1 %tmp7, label %invoke.cont20, label %eh.next1 eh.next1: %ehspec.fails = icmp slt i32 %sel, 0 br i1 %ehspec.fails, label %ehspec.unexpected, label %eh.resume eh.resume: resume { i8*, i32 } %exn.val ehspec.unexpected: tail call void @__cxa_call_unexpected(i8* %exn) noreturn unreachable } 2) An example of inlining: void qux(); vo...

...%gc_stackentry** %gc_frame.next store %gc_stackentry* %gc_newhead, %gc_stackentry** @llvm_gc_root_chain %1 = invoke i8* @malloc(i64 1) to label %entry.cont unwind label %gc_cleanup entry.cont: ; preds = %entry store i8* %1, i8** %0 %gc_frame.next1 = getelementptr %gc_stackentry.main* %gc_frame, i32 0, i32 0, i32 0 %gc_savedhead = load %gc_stackentry** %gc_frame.next1 store %gc_stackentry* %gc_savedhead, %gc_stackentry** @llvm_gc_root_chain ret i32 0 gc_cleanup: ; preds = %entry %gc_frame.next2 =...

The kernel side for rescan, which is needed if you want to enable qgroup tracking on a non-empty volume. The first patch splits btrfs_qgroup_account_ref into readable ans reusable units. The second patch adds the rescan implementation (refer to its commit message for a description of the algorithm). The third patch starts an automatic rescan when qgroups are enabled. It is only separated to

This series adds an initial implementation for scrub. It works quite straightforward. The usermode issues an ioctl for each device in the fs. For each device, it enumerates the allocated device chunks. For each chunk, the contained extents are enumerated and the data checksums fetched. The extents are read sequentially and the checksums verified. If an error occurs (checksum or EIO), a good copy

This is a first draft of a subvolume quota implementation. It is possible to limit subvolumes and any group of subvolumes and also to track the amount of space that will get freed when deleting snapshots. The current version is functionally incomplete, with the main missing feature being the initial scan and rescan of an existing filesystem. I put some effort into writing an introduction into