Lines Matching refs:step

10   //   (upper - lower + step - 1) / step
11   // where step is known to be %c1.
20   // New outer step (original is %c1).
21   // COMMON-NEXT:      %[[step:.*]] = muli %c1, %[[size]]
24   //   (upper - lower + step - 1) / step
25   // where step is known to be %c2.
34   // New inner step (original is %c2).
38   // COMMON: scf.for %[[i:.*]] = %c2 to %c44 step %[[step]]
39   // TILE_74:scf.for %[[j:.*]] = %c1 to %c44 step %[[step2]]
40  scf.for %i = %c2 to %c44 step %c1 {
41     // Upper bound for the inner loop min(%i + %step, %c44).
42     // COMMON:      %[[stepped:.*]] = addi %[[i]], %[[step]]
51     // COMMON:scf.for %[[ii:.*]] = %[[i]] to %[[ub:.*]] step %c1
54     // TILE_7: scf.for %[[j:.*]] = %c1 to %c44 step %c2
57     // TILE_74:scf.for %[[jj:.*]] = %[[j]] to %[[ub2]] step %c2
58    scf.for %j = %c1 to %c44 step %c2 {
74   //   (upper - lower + step - 1) / step
75   // where step is known to be %c1.
84   // New outer step (original is %c1).
85   // COMMON-NEXT:  %[[step:.*]] = muli %c1, %[[size]]
91   // COMMON: scf.for %[[i:.*]] = %c2 to %c44 step %[[step]]
94   //   (upper - lower + step - 1) / step
95   // where step is known to be %c2.
103   // New inner step (original is %c2).
107   // TILE_74:scf.for %[[j:.*]] = %c1 to %[[i]] step %[[step2]]
108  scf.for %i = %c2 to %c44 step %c1 {
109     // Upper bound for the inner loop min(%i + %step, %c44).
110     // COMMON:      %[[stepped:.*]] = addi %[[i]], %[[step]]
118     // COMMON:scf.for %[[ii:.*]] = %[[i]] to %[[ub:.*]] step %c1
121     // TILE_7: scf.for %[[j:.*]] = %c1 to %[[ii]] step %c2
124     // TILE_74:scf.for %[[jj:.*]] = %[[j]] to %[[ub2]] step %c2
125    scf.for %j = %c1 to %i step %c2 {