/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5083 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5086 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5127 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5229 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5233 if (min_split_pos == it->from()) { in split_for_spilling() 5239 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5299 int min_split_pos = current_position() + 1; in split_stack_interval() local 5302 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5309 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5328 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 742 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 743 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5045 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5048 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5089 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5191 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5195 if (min_split_pos == it->from()) { in split_for_spilling() 5201 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5261 int min_split_pos = current_position() + 1; in split_stack_interval() local 5264 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5271 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5290 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 740 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 741 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5083 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5086 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5127 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5229 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5233 if (min_split_pos == it->from()) { in split_for_spilling() 5239 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5299 int min_split_pos = current_position() + 1; in split_stack_interval() local 5302 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5309 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5328 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 742 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 743 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5109 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5112 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5153 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5255 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5259 if (min_split_pos == it->from()) { in split_for_spilling() 5265 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5325 int min_split_pos = current_position() + 1; in split_stack_interval() local 5328 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5335 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5354 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 759 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 760 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5136 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5139 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5180 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5282 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5286 if (min_split_pos == it->from()) { in split_for_spilling() 5292 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5352 int min_split_pos = current_position() + 1; in split_stack_interval() local 5355 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5362 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5381 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 761 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 762 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5089 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5092 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5133 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5235 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5239 if (min_split_pos == it->from()) { in split_for_spilling() 5245 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5305 int min_split_pos = current_position() + 1; in split_stack_interval() local 5308 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5315 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5334 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 745 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 746 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5041 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5044 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5085 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5187 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5191 if (min_split_pos == it->from()) { in split_for_spilling() 5197 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5257 int min_split_pos = current_position() + 1; in split_stack_interval() local 5260 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5267 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5286 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 740 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 741 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/c1/ |
H A D | c1_LinearScan.cpp | 5045 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5048 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5089 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5191 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5195 if (min_split_pos == it->from()) { in split_for_spilling() 5201 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5261 int min_split_pos = current_position() + 1; in split_stack_interval() local 5264 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5271 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5290 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 740 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 741 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/c1/ |
H A D | c1_LinearScan.cpp | 5039 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5042 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5083 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5185 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5189 if (min_split_pos == it->from()) { in split_for_spilling() 5195 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5255 int min_split_pos = current_position() + 1; in split_stack_interval() local 5258 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5265 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5284 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 755 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 756 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/c1/ |
H A D | c1_LinearScan.cpp | 5039 if (min_split_pos == max_split_pos) { in find_optimal_split_pos() 5042 optimal_split_pos = min_split_pos; in find_optimal_split_pos() 5083 assert(loop_end_pos > min_split_pos, "invalid order"); in find_optimal_split_pos() 5185 assert(min_split_pos <= max_split_pos, "invalid order"); in split_for_spilling() 5189 if (min_split_pos == it->from()) { in split_for_spilling() 5195 allocator()->change_spill_state(it, min_split_pos); in split_for_spilling() 5255 int min_split_pos = current_position() + 1; in split_stack_interval() local 5258 split_before_usage(it, min_split_pos, max_split_pos); in split_stack_interval() 5265 split_before_usage(it, min_split_pos, max_split_pos); in split_when_partial_register_available() 5284 int min_split_pos = current_pos + 1; in split_and_spill_interval() local [all …]
|
H A D | c1_LinearScan.hpp | 755 …int find_optimal_split_pos(Interval* it, int min_split_pos, int max_split_pos, bool do_loop_optim… 756 void split_before_usage(Interval* it, int min_split_pos, int max_split_pos);
|