/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/stackslotalloc/ |
H A D | StackIntervalDumper.java | 31 private final StackInterval[] intervals; field in class:StackIntervalDumper 33 StackIntervalDumper(StackInterval[] intervals) { argument 34 this.intervals = intervals; 39 for (StackInterval interval : intervals) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/ |
H A D | LinearScanIntervalDumper.java | 34 private final Interval[] intervals; field in class:LinearScanIntervalDumper 36 LinearScanIntervalDumper(Interval[] intervals) { argument 37 this.intervals = intervals; 42 for (Interval interval : intervals) {
|
H A D | LinearScan.java | 136 * @see #intervals() 138 private Interval[] intervals; field in class:LinearScan 141 * The number of valid entries in {@link #intervals}. 146 * The index of the first entry in {@link #intervals} for a 309 * Map from {@linkplain #operandNumber(Value) operand numbers} to intervals. 311 public Interval[] intervals() { method in class:LinearScan 312 return intervals; 317 intervals = new Interval[intervalsSize + (intervalsSize >> SPLIT_INTERVALS_CAPACITY_RIGHT_SHIFT)]; 331 assert intervals[operandNumber] == null; 332 intervals[operandNumbe 485 isSorted(Interval[] intervals) argument [all...] |
H A D | LinearScanOptimizeSpillPositionPhase.java | 65 for (Interval interval : allocator.intervals()) {
|
H A D | LinearScanLifetimeAnalysisPhase.java | 214 * Fixed intervals are never live at block boundaries, so they need not be 256 * Fixed intervals are never live at block boundaries, so they need not be processed in live 268 * Fixed intervals are never live at block boundaries, so they need not be processed in live 469 * Check that fixed intervals are not live at block boundaries (live set must be empty at 470 * fixed intervals). 542 * Dead value - make vacuous interval also add register priority for dead intervals 631 assert defPos <= interval.spillDefinitionPos() : "positions are processed in reverse order when intervals are created"; 688 try (Indent indent = Debug.logAndIndent("build intervals")) { 747 // Update intervals for operands live at the end of this block; 770 * intervals ar [all...] |
/openjdk9/hotspot/src/share/vm/c1/ |
H A D | c1_CFGPrinter.hpp | 51 static void print_intervals(IntervalList* intervals, const char* name);
|
H A D | c1_CFGPrinter.cpp | 66 void print_intervals(IntervalList* intervals, const char* name); 102 void CFGPrinter::print_intervals(IntervalList* intervals, const char* name) { argument 103 output()->print_intervals(intervals, name); 371 void CFGPrinterOutput::print_intervals(IntervalList* intervals, const char* name) { argument 372 print_begin("intervals"); 375 for (int i = 0; i < intervals->length(); i++) { 376 if (intervals->at(i) != NULL) { 377 intervals->at(i)->print(output()); 381 print_end("intervals");
|
H A D | c1_LinearScan.cpp | 167 // ********** functions for classification of intervals 202 // fixed intervals not needed for FPU stack allocation 207 // fixed intervals never contain oops 271 // (only used for parent intervals that are created during the building phase) 278 // assign register number for precolored intervals 285 // assign a new reg_num to the interval and append it to the list of intervals 286 // (only used for child intervals that are created during register allocation) 303 // intervals (only the very beginning of the interval must be in memory) 310 // called during building of intervals 322 assert(def_pos <= interval->spill_definition_pos(), "positions are processed in reverse order when intervals ar 1440 find_interval(Interval* interval, IntervalArray* intervals) argument 1474 is_sorted(IntervalArray* intervals) argument [all...] |
H A D | c1_LinearScan.hpp | 131 int _num_virtual_regs; // number of virtual registers (without new registers introduced because of splitting intervals) 134 int _max_spills; // number of stack slots used for intervals allocated to memory 138 IntervalList* _new_intervals_from_allocation; // list with all intervals created during allocation when an existing interval is split 139 IntervalArray* _sorted_intervals; // intervals sorted by Interval::from() 211 // functions for classification of intervals 262 // Phase 4: build intervals 292 // helper functions for building a sorted list of intervals 293 NOT_PRODUCT(bool is_sorted(IntervalArray* intervals);) 304 // (insert moves at edges between blocks if intervals have been split) 377 // (check that all intervals hav [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/trace/lsra/ |
H A D | TraceLinearScanPhase.java | 182 private static <T extends IntervalHint> boolean isSortedByFrom(T[] intervals) { argument 184 for (T interval : intervals) { 192 private static boolean isSortedBySpillPos(TraceInterval[] intervals) { argument 194 for (TraceInterval interval : intervals) { 202 private static <T extends IntervalHint> T[] sortIntervalsBeforeAllocation(T[] intervals, T[] sortedList) { argument 207 // only some intervals are swapped. So this is much faster than a complete QuickSort 208 for (T interval : intervals) { 216 // the assumption that the intervals are already sorted failed, 238 * Fixed intervals sorted by {@link FixedInterval#from()}. 480 for (TraceInterval interval : intervals()) { 842 private TraceInterval[] intervals; field in class:TraceLinearScanPhase.TraceLinearScan 866 TraceInterval[] intervals() { method in class:TraceLinearScanPhase.TraceLinearScan [all...] |
H A D | TraceLinearScanLifetimeAnalysisPhase.java | 254 * Dead value - make vacuous interval also add register priority for dead intervals 273 * Dead value - make vacuous interval also add register priority for dead intervals 360 assert defPos <= interval.spillDefinitionPos() : "positions are processed in reverse order when intervals are created"; 476 try (Indent indent = Debug.logAndIndent("build intervals")) { 491 * intervals are processed before uses. 541 // fix spill state for phi/sigma intervals 542 for (TraceInterval interval : allocator.intervals()) { 571 // set hints for phi/sigma intervals 671 * (priority == ShouldHaveRegister). Rematerialization of such intervals can
|
/openjdk9/jdk/src/java.desktop/share/classes/java/awt/geom/ |
H A D | CubicCurve2D.java | 1183 double[] intervals = {eqn[1], 2*eqn[2], 3*eqn[3]}; 1184 int critCount = QuadCurve2D.solveQuadratic(intervals, intervals); 1185 if (critCount == 2 && intervals[0] == intervals[1]) { 1188 if (critCount == 2 && intervals[0] > intervals[1]) { 1189 double tmp = intervals[0]; 1190 intervals[0] = intervals[ [all...] |
/openjdk9/jdk/test/tools/jlink/plugins/ |
H A D | CompressIndexesTest.java | 67 int[] intervals = {4, 7, 10, data.length}; 71 for (int interval : intervals) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.printer/src/org/graalvm/compiler/printer/ |
H A D | CFGPrinter.java | 594 public void printIntervals(String label, IntervalDumper intervals) { argument 595 begin("intervals"); 598 intervals.visitIntervals(intervalVisitor); 600 end("intervals");
|