| /dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
656 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
745 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
800 if (cur->number_of_sux() == 1) { in compute_weight()
949 int num_sux = cur->number_of_sux(); in compute_order()
1080 if (cur->number_of_sux() > 0) { in print_blocks()
1082 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1120 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 533 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
565 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
585 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
592 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
709 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
719 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
947 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
948 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
656 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
745 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
800 if (cur->number_of_sux() == 1) { in compute_weight()
949 int num_sux = cur->number_of_sux(); in compute_order()
1080 if (cur->number_of_sux() > 0) { in print_blocks()
1082 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1120 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 533 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
565 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
585 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
592 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
709 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
719 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
947 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
948 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1129 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 540 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
572 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
592 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
599 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
716 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
726 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
963 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
964 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1129 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 540 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
572 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
592 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
599 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
716 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
726 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
963 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
964 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1129 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 540 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
572 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
592 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
599 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
716 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
726 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
963 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
964 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1127 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 541 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
573 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
593 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
600 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
717 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
727 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
964 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
965 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 324 int nos = be->number_of_sux(); in block_do()
596 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
617 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
656 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
745 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
810 if (cur->number_of_sux() == 1) { in compute_weight()
959 int num_sux = cur->number_of_sux(); in compute_order()
1090 if (cur->number_of_sux() > 0) { in print_blocks()
1092 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1128 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 539 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
571 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
591 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
598 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
715 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
725 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
962 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
963 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1129 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 540 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
572 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
592 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
599 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
716 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
726 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
956 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
957 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1129 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 541 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
573 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
593 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
600 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
717 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
727 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
964 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
965 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/c1/ |
| H A D | c1_IR.cpp | 323 int nos = be->number_of_sux(); in block_do()
595 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur, in count_edges()
616 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in count_edges()
655 assert(loop_end->number_of_sux() == 1, "incorrect number of successors"); in mark_loops()
744 for (i = cur->number_of_sux() - 1; i >= 0; i--) { in assign_loop_depth()
809 if (cur->number_of_sux() == 1) { in compute_weight()
958 int num_sux = cur->number_of_sux(); in compute_order()
1089 if (cur->number_of_sux() > 0) { in print_blocks()
1091 for (int j = 0; j < cur->number_of_sux(); j++) { in print_blocks()
1129 for (j = cur->number_of_sux() - 1; j >= 0; j--) { in verify()
[all …]
|
| H A D | c1_Instruction.cpp | 541 for (int i = 0; i < end->number_of_sux(); i++) { in set_end()
573 for (int s = 0; s < from->number_of_sux();) { in disconnect_edge()
593 for (int s = 0; s < number_of_sux(); s++) { in disconnect_from_graph()
600 for (int i = 0; i < number_of_sux(); i++) { in substitute_sux()
717 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_preorder()
727 …{ for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_p… in iterate_postorder()
964 BlockList* sux = new BlockList(this->begin()->number_of_sux()); in set_begin()
965 for (int i = 0; i < this->begin()->number_of_sux(); i++) { in set_begin()
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/cpu/x86/ |
| H A D | c1_LinearScan_x86.cpp | 1035 int number_of_sux = block->number_of_sux(); in merge_fpu_stack_with_successors() local
1037 if (number_of_sux == 1 && block->sux_at(0)->number_of_preds() > 1) { in merge_fpu_stack_with_successors()
1083 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
1114 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/cpu/x86/ |
| H A D | c1_LinearScan_x86.cpp | 1034 int number_of_sux = block->number_of_sux(); in merge_fpu_stack_with_successors() local
1036 if (number_of_sux == 1 && block->sux_at(0)->number_of_preds() > 1) { in merge_fpu_stack_with_successors()
1082 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
1113 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
|
| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/cpu/x86/ |
| H A D | c1_LinearScan_x86.cpp | 1034 int number_of_sux = block->number_of_sux(); in merge_fpu_stack_with_successors() local
1036 if (number_of_sux == 1 && block->sux_at(0)->number_of_preds() > 1) { in merge_fpu_stack_with_successors()
1082 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
1113 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/cpu/x86/ |
| H A D | c1_LinearScan_x86.cpp | 1035 int number_of_sux = block->number_of_sux(); in merge_fpu_stack_with_successors() local
1037 if (number_of_sux == 1 && block->sux_at(0)->number_of_preds() > 1) { in merge_fpu_stack_with_successors()
1083 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
1114 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/cpu/x86/ |
| H A D | c1_LinearScan_x86.cpp | 1049 int number_of_sux = block->number_of_sux(); in merge_fpu_stack_with_successors() local
1051 if (number_of_sux == 1 && block->sux_at(0)->number_of_preds() > 1) { in merge_fpu_stack_with_successors()
1097 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
1128 for (int i = 0; i < number_of_sux; i++) { in merge_fpu_stack_with_successors()
|