2362N/A * Copyright (c) 2002, 2007, Oracle and/or its affiliates. All rights reserved. 0N/A * Redistribution and use in source and binary forms, with or without 0N/A * modification, are permitted provided that the following conditions 0N/A * - Redistributions of source code must retain the above copyright 0N/A * notice, this list of conditions and the following disclaimer. 0N/A * - Redistributions in binary form must reproduce the above copyright 0N/A * notice, this list of conditions and the following disclaimer in the 0N/A * documentation and/or other materials provided with the distribution. 2362N/A * - Neither the name of Oracle nor the names of its 0N/A * contributors may be used to endorse or promote products derived 0N/A * from this software without specific prior written permission. 0N/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 0N/A * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 0N/A * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 0N/A * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 0N/A * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 0N/A * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 0N/A * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 0N/A * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 0N/A * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 0N/A * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 0N/A * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 4378N/A * This source code is provided to illustrate the usage of a given feature 4378N/A * or technique and has been deliberately simplified. Additional steps 4378N/A * required for a production-quality application, such as security checks, 4378N/A * input validation and proper error handling, might not be present in 0N/A // Skip recording results if we were interrupted before 0N/A // anything interesting happened... 0N/A env.
idle();
// Also done after this method returns... 0N/A // Determine the number of reps 0N/A // First do one at a time until we get to 1 second elapsed 0N/A // But, if we get to 1000 reps we'll start ramping up our 0N/A // reps per cycle and throwing sync() calls in to make sure 0N/A // we aren't spinning our gears queueing up graphics calls 0N/A // Time to shift gears into an exponential number of tests 0N/A // sync() each time in case batching at a lower level is 0N/A // causing us to spin our gears 0N/A // Now keep estimating how many reps it takes to hit our target 0N/A // time exactly, trying it out, and guessing again. 0N/A // Now make one last estimate of how many reps it takes to 0N/A // hit the target exactly in case we overshot. 0N/A * Finds a new width (w2) such that 0N/A * and w2 is not a multiple of 3 (the X step size) 0N/A * and GCD(w2, h) is as small as possible 0N/A for (
int i =
0; i <
3; i++) {
0N/A if (u < v) {
int t = u; u = v; v = t; }
0N/A ", gcd(w, h) = "+v);
0N/A env.
idle();
// One more time outside of runOneTest()