Displaying 7 results from an estimated 7 matches for "branch_cond".
2019 Jun 01
2
Question about a AA result and its use in Dependence Analysis
...preds = %for.body
ret float undef
for.body: ; preds = %for.body, %entry
%p = phi float* [ %g, %entry ], [ %q, %for.body ]
%q = phi float* [ %h, %entry ], [ %p, %for.body ]
%0 = load float, float* %p, align 4
store float undef, float* %q, align 4
%branch_cond = fcmp ugt float %0, 0.0
br i1 %branch_cond, label %for.cond.cleanup, label %for.body
}
Alias Set Tracker: 2 alias sets for 2 pointer values.
AliasSet[0x83e1fe0, 1] must alias, Ref Pointers: (float* %p, LocationSize::precise(4))
AliasSet[0x83e3390, 1] must alias, Mod Pointers: (f...
2019 Jun 03
2
Question about a AA result and its use in Dependence Analysis
...>
> for.body: ; preds = %for.body, %entry
> %p = phi float* [ %g, %entry ], [ %q, %for.body ]
> %q = phi float* [ %h, %entry ], [ %p, %for.body ]
> %0 = load float, float* %p, align 4
> store float undef, float* %q, align 4
> %branch_cond = fcmp ugt float %0, 0.0
> br i1 %branch_cond, label %for.cond.cleanup, label %for.body }
>
> Alias Set Tracker: 2 alias sets for 2 pointer values.
> AliasSet[0x83e1fe0, 1] must alias, Ref Pointers: (float* %p, LocationSize::precise(4))
> AliasSet[0x83e3390, 1] must alia...
2019 Jun 03
2
Question about a AA result and its use in Dependence Analysis
...; preds = %for.body, %entry
> > %p = phi float* [ %g, %entry ], [ %q, %for.body ]
> > %q = phi float* [ %h, %entry ], [ %p, %for.body ]
> > %0 = load float, float* %p, align 4
> > store float undef, float* %q, align 4
> > %branch_cond = fcmp ugt float %0, 0.0
> > br i1 %branch_cond, label %for.cond.cleanup, label %for.body }
> >
> > Alias Set Tracker: 2 alias sets for 2 pointer values.
> > AliasSet[0x83e1fe0, 1] must alias, Ref Pointers: (float* %p,
> LocationSize::precise(4))
> > Ali...
2019 May 31
2
Question about a AA result and its use in Dependence Analysis
Hello llvm-dev,
I would appreciate your feedback on the following problem. We're trying to determine whether this is a bug in LLVM or not.
In the IR snippet below, we have two pointers (p and q) which initially point to two completely non-overlapping locations. Then, on every iteration of a loop, we swap the pointers and load from the first, followed by a store to the second.
1) AA says the
2019 Jun 05
2
Question about a AA result and its use in Dependence Analysis
...preds = %for.body
ret float undef
for.body: ; preds = %for.body, %entry
%p = phi float* [ %g, %entry ], [ %q, %for.body ]
%q = phi float* [ %h, %entry ], [ %p, %for.body ]
%0 = load float, float* %p, align 4
store float undef, float* %q, align 4
%branch_cond = fcmp ugt float %0, 0.0
br i1 %branch_cond, label %for.cond.cleanup, label %for.body }
Alias Set Tracker: 2 alias sets for 2 pointer values.
AliasSet[0x83e1fe0, 1] must alias, Ref Pointers: (float* %p,
LocationSize::precise(4))
AliasSet[0x83e3390, 1] must alias, Mod Pointers:...
2011 Oct 15
2
[LLVMdev] Live code elimination problem in code generation
...:
:
----------
After that, pseudo code expansion stage expands SELECT_CC by slicing the
machine basic clock.
----------
loop:
:
:
set P0 <- xxx ( P0: a physical register for a parameter of function F )
set P1 <- yyy ( P1: a physical register for a parameter of function F )
:
branch_cond B2, B3
B2:
mov v1, v2, v3
B3:
call F
:
:
----------
At first,
the dead code elimination stage misthinks P0 and P1 is not alive
since the live variable analysis (actually it seems as a live physical
register analysis)
in DCE stage is somewhat wrong (to my thinking).
Therefore, set Px statem...
2008 Nov 18
1
[LLVMdev] 32 bit boolean results
You can tell LLVM that you have "sign extended" setCC results (all
ones).
Dan
On Nov 18, 2008, at 5:33 PM, Eli Friedman wrote:
> On Tue, Nov 18, 2008 at 1:56 PM, Villmow, Micah
> <Micah.Villmow at amd.com> wrote:
>> The IR produces correct results, but my backend does not and the
>> only thing
>> I can think of is that the IR is treating the