Lines Matching refs:indx
37 /* Test for the bug of transforming indx >= MININT to indx > MININT-1 */
39 int indx;
41 for (indx = 500; indx >= limit; indx -= 2) {
42 sum += 2000 / indx;
48 /* Test for the bug of transforming indx <= MAXINT to indx < MAXINT+1 */
50 int indx;
52 for (indx = -500; indx <= limit; indx += 2)
54 sum += 3000 / indx;
66 int indx;
68 for (indx = 0xffffffff; indx < limit; indx += 0x20000000)
80 int indx;
83 for (indx = 0x80000000; indx < limit; ++indx)
85 if (indx > 0x80000000)
88 // trick rce into thinking expression is false when indx >= 0
89 // in fact it is false when indx==0x80000001
90 if (indx - 9 < -9)
92 sum += indx;
94 sum ^= b[indx & 7];
102 sum += b[indx & 3];
114 int indx;
117 for (indx = 0x80000000; indx < limit; ++indx)
119 if (indx > 0x80000000)
122 if (indx < 0)
130 // trick rce into thinking expression is false when indx >= 0
131 // in fact it is false when indx==0x80000001
133 if (indx * 28 + 1 < 0)
135 sum += indx;
137 sum ^= b[indx & 7];
145 sum += b[indx & 3];
156 int indx;
160 for (indx = 0; indx < b.length; ++indx)
162 if (indx <= max)
164 sum += (indx ^ 15) + ((result != 0) ? 0 : sum);
170 for (indx = -7; indx < b.length; ++indx)
172 if (indx <= 9)
187 int indx;
191 for (indx = b.length-1; indx >= 0; --indx)
193 if (indx >= min)