/openjdk9/jaxws/src/jdk.xml.bind/share/classes/com/sun/xml/internal/xsom/impl/scd/ |
H A D | SCDImpl.java | 40 * SCD is fundamentally a list of steps. 42 private final Step[] steps; field in class:SCDImpl 49 public SCDImpl(String text, Step[] steps) { argument 51 this.steps = steps; 57 int len = steps.length; 59 if(i!=0 && i!=len-1 && !steps[i-1].axis.isModelGroup() && steps[i].axis.isModelGroup()) { 75 nodeSet = steps[i].evaluate(nodeSet);
|
H A D | SCDParser.java | 92 List steps = new ArrayList(); 100 steps.add(new Step.Any(Axis.ROOT)); 104 steps.add(new Step.Any(Axis.DESCENDANTS)); 117 steps.add(s); 135 steps.add(new Step.Any(Axis.DESCENDANTS)); 143 steps.add(s); 145 {if (true) return steps;}
|
/openjdk9/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/xs/identity/ |
H A D | XPathMatcher.java | 235 // consume self::node() steps 236 XPath.Step[] steps = fLocationPaths[i].steps; 237 while (fCurrentStep[i] < steps.length && 238 steps[fCurrentStep[i]].axis.type == XPath.Axis.SELF) { 240 XPath.Step step = steps[fCurrentStep[i]]; 245 if (fCurrentStep[i] == steps.length) { 258 while(fCurrentStep[i] < steps.length && steps[fCurrentStep[i]].axis.type == XPath.Axis.DESCENDANT) { 260 XPath.Step step = steps[fCurrentSte [all...] |
H A D | Selector.java | 124 fLocationPaths[i].steps[fLocationPaths[i].steps.length-1].axis;
|
H A D | Field.java | 119 for(int j=0; j<fLocationPaths[i].steps.length; j++) { 121 fLocationPaths[i].steps[j].axis; 123 (j < fLocationPaths[i].steps.length-1)) {
|
/openjdk9/jdk/src/java.desktop/unix/classes/sun/java2d/xr/ |
H A D | XRDrawLine.java | 54 int steps; 92 steps = x2 - x1; 97 steps = y2 - y1; 100 if ((steps = (Math.abs(steps) + 1)) == 0) { 135 lineToRects(rectBuffer, steps, error, errmajor, errminor, xStep, 138 lineToPoints(rectBuffer, steps, error, errmajor, errminor, xStep, 143 private void lineToPoints(GrowableRectArray rectBuffer, int steps, argument 161 } while (--steps > 0); 164 private void lineToRects(GrowableRectArray rectBuffer, int steps, argument [all...] |
/openjdk9/jdk/src/java.desktop/unix/native/libawt/java2d/loops/ |
H A D | vis_DrawLine.c | 47 ADD_SUFF(AnyInt##FUNC)(pRasInfo, x1, y1, r_pixel, steps, error, \ 65 jint steps, \ 101 } while (--steps > 0); \ 110 } while (--steps > 0); \
|
/openjdk9/hotspot/test/gc/stress/ |
H A D | TestGCOld.java | 53 fewer steps per second implies fewer bytes promoted per second.) 57 steps: number of steps to do. 64 private static int size, workUnits, promoteRate, ptrMutRate, steps; field in class:TestGCOld 78 = "Usage: java TestGCOld <size> <work> <ratio> <mutation> <steps>"; 88 = " <steps> is the number of steps"; 368 steps = Integer.parseInt(args[4]); 374 System.out.println(steps + " steps"); [all...] |
/openjdk9/jdk/src/java.desktop/share/native/libawt/java2d/loops/ |
H A D | LineUtils.h | 85 jint steps; \ 92 &steps, &error, \ 96 (*pLine)((pRasInfo), tx1, ty1, pixel, steps, error, \
|
H A D | DrawLine.c | 102 jint steps; \ 219 steps = X2 - X1; \ 229 steps = Y2 - Y1; \ 234 if ((steps = ((steps >= 0) ? steps : -steps) + 1 - SHORTEN) == 0) { \ 255 *pSteps = steps; \
|
H A D | AnyByteBinary.h | 344 jint steps, jint error, \ 364 } while (--steps > 0); \ 377 } while (--steps > 0); \ 450 jint steps, jint error, \ 474 } while (--steps > 0); \ 488 } while (--steps > 0); \
|
H A D | LoopMacros.h | 1381 jint steps, jint error, \ 1401 } while (--steps > 0); \ 1412 } while (--steps > 0); \ 1509 jint steps, jint error, \ 1537 } while (--steps > 0); \ 1549 } while (--steps > 0); \
|
H A D | GraphicsPrimitiveMgr.h | 250 jint steps, jint error,
|
/openjdk9/jaxp/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/xpath/ |
H A D | XPath.java | 138 Step[] steps = new Step[size]; 139 steps = stepsVector.toArray(steps); 142 return new LocationPath(steps); 377 /** List of steps. */ 378 public final Step[] steps; field in class:XPath.LocationPath 384 /** Creates a location path from a series of steps. */ 385 public LocationPath(Step[] steps) { argument 386 this.steps = steps; [all...] |
/openjdk9/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/ |
H A D | InferenceContext.java | 512 * Apply a set of inference steps 514 private List<Type> solveBasic(EnumSet<InferenceStep> steps) { argument 515 return solveBasic(inferencevars, steps); 518 List<Type> solveBasic(List<Type> varsToSolve, EnumSet<InferenceStep> steps) { argument 522 for (InferenceStep step : steps) { 540 public void solveLegacy(boolean partial, Warner warn, EnumSet<InferenceStep> steps) { argument 542 List<Type> solvedVars = solveBasic(steps);
|
H A D | Infer.java | 226 inferenceContext.solveLegacy(true, warn, LegacyInferenceSteps.EQ_LOWER.steps); //minimizeInst 236 inferenceContext.solveLegacy(false, warn, LegacyInferenceSteps.EQ_UPPER.steps); //maximizeInst 1429 * The inference process can be thought of as a sequence of steps. Each step 1432 * steps are applied, or which steps are to be applied are left to the inference engine. 1578 * This enumeration defines the sequence of steps to be applied when the 1579 * solver works in legacy mode. The steps in this enumeration reflect 1587 final EnumSet<InferenceStep> steps; field in class:Infer.LegacyInferenceSteps 1589 LegacyInferenceSteps(EnumSet<InferenceStep> steps) { argument 1590 this.steps 1605 final EnumSet<InferenceStep> steps; field in class:Infer.GraphInferenceSteps 1607 GraphInferenceSteps(EnumSet<InferenceStep> steps) argument [all...] |
/openjdk9/jdk/src/java.base/share/classes/com/sun/java/util/jar/pack/ |
H A D | NativeUnpack.java | 122 int steps = 0; 124 steps++; 137 Utils.log.fine("readInputFn("+minlen+","+maxlen+") => "+numread+" steps="+steps);
|
/openjdk9/jdk/src/java.base/share/classes/java/time/ |
H A D | LocalDate.java | 1281 * This method adds the specified amount to the years field in three steps: 1309 * This method adds the specified amount to the months field in three steps: 1455 * This method subtracts the specified amount from the years field in three steps: 1479 * This method subtracts the specified amount from the months field in three steps: 1779 long steps = (until - sign) / days; // non-negative 1780 return LongStream.rangeClosed(0, steps).mapToObj( 1784 long steps = until * 1600 / (months * 48699 + days * 1600) + 1; 1785 long addMonths = months * steps; 1786 long addDays = days * steps; 1789 // adjust steps estimatio [all...] |
/openjdk9/jdk/src/java.desktop/share/classes/sun/java2d/loops/ |
H A D | GeneralRenderer.java | 252 int steps; 268 steps = x2 - x1; 277 steps = y2 - y1; 294 if (steps < 0) { 295 steps = -steps; 306 } while (--steps >= 0); 316 } while (--steps >= 0);
|
/openjdk9/hotspot/src/share/vm/runtime/ |
H A D | safepoint.cpp | 213 int steps = 0 ; local 222 // consider adjusting steps downward: 223 // steps = 0 224 // steps -= NNN 225 // steps >>= 1 226 // steps = MIN(steps, 2000-100) 227 // if (iterations != 0) steps -= NNN 310 ++steps ; 311 if (ncpus > 1 && steps < SafepointSpinBeforeYiel [all...] |
/openjdk9/jdk/src/java.desktop/share/native/libawt/java2d/pipe/ |
H A D | ShapeSpanIterator.c | 1370 jlong steps = loy; local 1371 steps -= y0 - 1; 1373 x0 += (jint) (steps * seg->bumpx); 1374 steps = err + (steps * seg->bumperr); 1375 x0 += (jint) (steps >> 31); 1376 err = ((jint) steps) & ERRSTEP_MAX;
|
/openjdk9/jdk/test/java/lang/invoke/ |
H A D | MethodHandlesTest.java | 2678 // Local state types, start values, predicates, and steps: 2719 final MethodHandle[] steps = new MethodHandle[] {his, hds, hss}; 2723 MethodHandle[] useSteps = Arrays.copyOf(steps, nargs, MethodHandle[].class); 2733 void testGenericLoopCombinator(int nargs, Class<?>[] argTypes, MethodHandle[] preds, MethodHandle[] steps, argument 2766 steps[i] = MethodHandles.dropArguments( 2767 MethodHandles.dropArguments(steps[i], i + 1, additionalLocalStateArgTypes), nargs, lArgTypes); 2793 System.arraycopy(steps, 0, preSteps, 1, nargs); 2799 toClauseMajor(postClauses, inits, steps, usePreds, finis);
|
/openjdk9/jdk/src/java.base/share/classes/java/util/concurrent/ |
H A D | ForkJoinPool.java | 395 * Upon any exception across these steps, or null return from 1499 * saturate. Most of these steps can fail due to interference, in 1639 for (int steps = 0;;) { 1652 else if ((++steps & 1) == 0) 1820 origin = (r & ~1) & m; // even indices and steps 2000 * use zero, allowing unbounded steps (external calls trap
|
/openjdk9/jdk/src/java.base/share/classes/java/lang/invoke/ |
H A D | InvokerBytecodeGenerator.java | 1325 * // a1: LoopClauses (containing an array of arrays: inits, steps, preds, finis) 1374 * AALOAD // load the steps array 1430 final int steps = 2; 1464 emitLoopHandleInvoke(invoker, steps, c, args, true, stepType, loopLocalStateTypes, clauseDataIndex,
|
/openjdk9/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/parser/ |
H A D | JavacParser.java | 2512 List<JCExpressionStatement> steps = token.kind == RPAREN ? List.nil() : forUpdate(); 2515 return F.at(pos).ForLoop(inits, cond, steps, body);
|