Displaying 2 results from an estimated 2 matches for "match_length".
2011 May 04
2
[LLVMdev] identifying all dependent instructions through multi-levels of def-use relationship
...before itself can.
The back-trace of dependent instructions go to: [1] and [0]. Thus both
[1] and [2] need to be cloned in order before replicate [2].
A more interesting example is given below (IR Segment):
bb1: ; preds = %bb29,
%bb30.preheader
%match_length.354 = phi i32 [ %match_length.2.ph, %bb29 ], [ 2,
%bb30.preheader ]
%match_available.153 = phi i32 [ %match_available.0.ph, %bb29 ], [ 0,
%bb30.preheader ]
tail call void @start_ckpt() nounwind noinline
%88 = load i32* @ins_h, align 4 ; [0]
%89 = shl i32 %88, 5...
2011 May 05
0
[LLVMdev] identifying all dependent instructions through multi-levels of def-use relationship
...f dependent instructions go to: [1] and [0]. Thus both
> [1] and [2] need to be cloned in order before replicate [2].
>
>
> A more interesting example is given below (IR Segment):
>
> bb1: ; preds = %bb29,
> %bb30.preheader
> %match_length.354 = phi i32 [ %match_length.2.ph, %bb29 ], [ 2,
> %bb30.preheader ]
> %match_available.153 = phi i32 [ %match_available.0.ph, %bb29 ], [
> 0, %bb30.preheader ]
> tail call void @start_ckpt() nounwind noinline
> %88 = load i32* @ins_h, align 4 ; [0]
> %89...