Displaying 3 results from an estimated 3 matches for "loopinvariantbackedgetakencount".
2012 Jun 20
2
[LLVMdev] another SCEV surprise
When compile the following case and look at the SCEV analysis, I notice
that the first two loops don't have a LoopInvariantBackedgeTakenCount
(surprising) and the last one does (not surprising, except in the context
of the first two examples).
*void p4(int *A, int *B, long int n) {*
* for (char i = 0; i < n; i++) {*
* A[i + 2] = i;*
* *B++ = A[i];*
* }*
*}*
*
*
*void p5(int *A, int *B, long int n) {*
* for (short i = 0; i &l...
2012 Jun 20
0
[LLVMdev] another SCEV surprise
On Tue, Jun 19, 2012 at 10:21 PM, Preston Briggs
<preston.briggs at gmail.com> wrote:
> When compile the following case and look at the SCEV analysis, I notice that
> the first two loops don't have a LoopInvariantBackedgeTakenCount
> (surprising) and the last one does (not surprising, except in the context of
> the first two examples).
>
> void p4(int *A, int *B, long int n) {
> for (char i = 0; i < n; i++) {
> A[i + 2] = i;
> *B++ = A[i];
> }
> }
>
> void p5(int *A, int *B, lon...
2012 Jun 20
1
[LLVMdev] another SCEV surprise
...li Friedman <eli.friedman at gmail.com> wrote:
> On Tue, Jun 19, 2012 at 10:21 PM, Preston Briggs
> <preston.briggs at gmail.com> wrote:
> > When compile the following case and look at the SCEV analysis, I
> > notice that the first two loops don't have a
> > LoopInvariantBackedgeTakenCount (surprising) and the last one does
> > (not surprising, except in the context of the first two examples).
> >
> > void p4(int *A, int *B, long int n) {
> > for (char i = 0; i < n; i++) {
> > A[i + 2] = i;
> > *B++ = A[i];
> > }
> > }
&g...