Displaying 2 results from an estimated 2 matches for "nestinglevel".
2012 Nov 09
1
[LLVMdev] Loop carried dependence analysis?
...p:
> for (int i = 1; i < 100; i++)
> {
> arr[i] = arr[i-1];
> }
>
> This dependence is reported:
> %1 = load i32* %arrayidx.i, align 4 ---> store i32 %1, i32*
> %arrayidx2.i, align 4
>
> And the following is the code to output distance and directions.
> nestingLevel is the innermost loop depth, 1 in this case.
>
> Dependence* dependence = dependenceAnalysis->depends(instructions[src],
> instructions[dst], true);
> if (dependence)
> {
> unsigned direction = dependence->getDirection(nestingLevel); //
> Returns DVEntry::ALL
>...
2012 Nov 09
0
[LLVMdev] Loop carried dependence analysis?
...istance always returns null.
E.g, for this input loop:
for (int i = 1; i < 100; i++)
{
arr[i] = arr[i-1];
}
This dependence is reported:
%1 = load i32* %arrayidx.i, align 4 ---> store i32 %1, i32*
%arrayidx2.i, align 4
And the following is the code to output distance and directions.
nestingLevel is the innermost loop depth, 1 in this case.
Dependence* dependence = dependenceAnalysis->depends(instructions[src],
instructions[dst], true);
if (dependence)
{
unsigned direction = dependence->getDirection(nestingLevel); // Returns
DVEntry::ALL
if (const SCEV* scev = dependence->...