• Home
  • Raw
  • Download

Lines Matching refs:k

56     int k = 0;  in periodicIdiom()  local
59 result += x[k]; in periodicIdiom()
60 k = 1 - k; in periodicIdiom()
74 int k = 0; in periodicSequence2() local
78 result += x[k]; in periodicSequence2()
80 l = k; in periodicSequence2()
81 k = t; in periodicSequence2()
98 int k = 0; in periodicSequence4() local
104 result += x[k] + x[l] + x[m] + x[n]; // all used at once in periodicSequence4()
106 n = k; in periodicSequence4()
107 k = l; in periodicSequence4()
123 for (int i = Integer.MAX_VALUE - 10, k = 0; i < Integer.MAX_VALUE; i++) { in justRightUp1()
124 result += x[k++]; in justRightUp1()
153 for (int i = Integer.MAX_VALUE - 10, k = 0; i <= Integer.MAX_VALUE - 1; i++) { in justRightUp3()
154 result += x[k++]; in justRightUp3()
171 for (int i = Integer.MAX_VALUE - 9, k = 0; i <= Integer.MAX_VALUE; i++) { in justOOBUp()
172 result += x[k++]; in justOOBUp()
186 for (int i = Integer.MIN_VALUE + 10, k = 0; i > Integer.MIN_VALUE; i--) { in justRightDown1()
187 result += x[k++]; in justRightDown1()
216 for (int i = Integer.MIN_VALUE + 10, k = 0; i >= Integer.MIN_VALUE + 1; i--) { in justRightDown3()
217 result += x[k++]; in justRightDown3()
234 for (int i = Integer.MIN_VALUE + 9, k = 0; i >= Integer.MIN_VALUE; i--) { in justOOBDown()
235 result += x[k++]; in justOOBDown()
578 int k = 0; in periodicDynamicBCE() local
581 result += x[k]; in periodicDynamicBCE()
582 k = 1 - k; in periodicDynamicBCE()
625 for (int k = 0, i = lo; i <= hi; i++) { in noDynamicBCEPossiblyInfiniteLoop()
626 result += x[k++]; in noDynamicBCEPossiblyInfiniteLoop()
644 int k = 0; in noDynamicBCEMixedInductionTypes() local
646 result += x[k++]; in noDynamicBCEMixedInductionTypes()