/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* This file is available under and governed by the GNU General Public
* License version 2 only, as published by the Free Software Foundation.
* However, the following notice accompanied the original version of this
* file:
*
* Written by Doug Lea with assistance from members of JCP JSR-166
* Expert Group and released to the public domain, as explained at
*/
/*
* @test
* @bug 4965960
* @compile -source 1.5 ExecutorCompletionServiceLoops.java
* @summary Exercise ExecutorCompletionServiceLoops
*/
public class ExecutorCompletionServiceLoops {
static boolean print = false;
int max = 8;
int base = 10000;
print = true;
}
throw new Error();
}
int s = 0;
int l = System.identityHashCode(this);
for (int i = 0; i < 5; ++i) {
l = LoopHelpers.compute2(l);
s += LoopHelpers.compute1(l);
}
return new Integer(s);
}
}
final int iters;
iters = i;
}
public void run() {
for (int i = 0; i < iters; ++i)
}
}
int r = 0;
for (int i = 0; i < iters; ++i)
if (print)
if (r == 0) // avoid overoptimization
}
}