Displaying 7 results from an estimated 7 matches for "getdist".
Did you mean:
getdest
2015 Jul 29
1
[LLVMdev] Loop Dependence Analysis(getDistance())
...nceAnalysis>();
AU.addPreserved<MemoryDependenceAnalysis>();
}
In runOnFunction I have used dependence =
&getAnalysis<DependenceAnalysis>();
if(L->getSubLoops().size()==0)
{ Dependence* dependence;
const SCEV* scev = dependence->getDistance(loopID);
....
................
.............
}
loopID is and unsigned int variable which I have increased after each time
after doing some other operations on loop like printing the basic block of
each loop.
Is this the correct way to do i...
2012 Nov 09
1
[LLVMdev] Loop carried dependence analysis?
...and not loop carried dependencies. Does LLVM
> support loop carried dependency analysis?
>
> In addition, the distance and direction for dependent instructions always
> have invalid values; Dependence::getDirection() returns DVEntry::ALL which
> is the default value and Dependence::getDistance 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 fol...
2012 Nov 09
0
[LLVMdev] Loop carried dependence analysis?
...nly reporting sequential and not loop carried dependencies. Does LLVM
support loop carried dependency analysis?
In addition, the distance and direction for dependent instructions always
have invalid values; Dependence::getDirection() returns DVEntry::ALL which
is the default value and Dependence::getDistance 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.
nes...
2011 Oct 20
4
Randomized Points in space/ saving model results
A bit new to R and I'm working on something a bit more challenging than I am
used to- so here's whats going on:
Data inputs: 9 different shapefiles (.shp) of different point locations
(lat, long)
shapefile bounding box (lat/long corner points (14, 1)
(15,1) (14, 2) (15,2))
1 .csv of lat/long coordinates for points
Goal: a-
2008 May 02
4
[LLVMdev] Pointer sizes, GetElementPtr, and offset sizes
...in a type-safe manner,
irrespective of pointer size. Something like this:
define i32 @main() nounwind {
entry:
%x = alloca [2 x i32*] ; <[2 x i32*]*> [#uses=2]
%tmp1 = getelementptr [2 x i32*]* %x, i32 0, i32 1 ;
<i32**> [#uses=1]
%tmp2 = getdistance i32** %x, %tmp1 ; <i32> [#uses=1]
ret i32 %tmp2
}
I'm not really a compiler person, so I'm wondering if a need for such an
instruction ever arises in more compiler-oriented situations such as
optimization or wrt. portability? Does the fact that pointer size is...
2010 Sep 16
4
help me understand how things work.
Hello I have some strange output from R and I try to understand how R works.
Could you please help me with that?
temp <- rbind (c(10,1),c(99,98))
> temp
[,1] [,2]
[1,] 10 1
[2,] 99 98
> dist(temp)
1
2 131.6435
> sqrt(dist(temp))
1
2 11.47360
so far so good.
until the nex line: when I try to do what i did before but adding the 1/(what I
did
2018 Nov 01
2
RFC: System (cache, etc.) model for LLVM
...odel.
> class TargetSoftwarePrefetcherInfo {
> /// Should we do software prefetching at all?
> ///
> bool isEnabled() const;
isEnabled sounds like something configurable at runtime.
> /// Provide a general prefetch distance hint.
> ///
> unsigned getDistance() const;
>
> /// Prefetch at least this far ahead.
> ///
> unsigned getMinDistance() const;
>
> /// Prefetch at most this far ahead.
> ///
> unsigned getMaxDistance() const;
> };
>
> ``get*Distance`` APIs provide general hints to guide...