/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 391 bool is_cmov_pack(Node_List* p); 462 void order_def_uses(Node_List* p); 483 void co_locate_pack(Node_List* p); 493 bool implemented(Node_List* p); 495 bool profitable(Node_List* p); 513 Node_List* in_pack(Node* s, Node_List* p); 519 Node* executed_last(Node_List* p); [all …]
|
H A D | postaloc.cpp | 33 Node_List& value) { in register_contains_value() 80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 130 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 338 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 487 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 491 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 496 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 546 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 394 bool is_cmov_pack(Node_List* p); 465 void order_def_uses(Node_List* p); 486 void co_locate_pack(Node_List* p); 496 bool implemented(Node_List* p); 498 bool profitable(Node_List* p); 516 Node_List* in_pack(Node* s, Node_List* p); 522 Node* executed_last(Node_List* p); [all …]
|
H A D | postaloc.cpp | 33 Node_List& value) { in register_contains_value() 80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 130 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 338 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 487 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 491 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 496 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 546 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 391 bool is_cmov_pack(Node_List* p); 462 void order_def_uses(Node_List* p); 483 void co_locate_pack(Node_List* p); 493 bool implemented(Node_List* p); 495 bool profitable(Node_List* p); 513 Node_List* in_pack(Node* s, Node_List* p); 519 Node* executed_last(Node_List* p); [all …]
|
H A D | loopnode.hpp | 492 Node_List _body; // Loop body for inner loops 556 void check_safepts(VectorSet &visited, Node_List &stack); 746 Node_List _deadlist; 1083 Node_List*& split_if_set, Node_List*& split_bool_set, 1084 Node_List*& split_cex_set, Node_List& worklist, 1088 Node_List& extra_data_nodes); 1097 void do_peeling( IdealLoopTree *loop, Node_List &old_new ); 1189 int do_range_check( IdealLoopTree *loop, Node_List &old_new ); 1204 Node_List &old_new, 1237 bool partial_peel( IdealLoopTree *loop, Node_List &old_new ); [all …]
|
H A D | postaloc.cpp | 33 Node_List& value) { in register_contains_value() 80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 130 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 338 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 487 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 491 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 496 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 546 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 410 bool is_cmov_pack(Node_List* p); 481 void order_def_uses(Node_List* p); 502 void co_locate_pack(Node_List* p); 512 bool implemented(Node_List* p); 514 bool profitable(Node_List* p); 532 Node_List* in_pack(Node* s, Node_List* p); 538 Node* executed_last(Node_List* p); [all …]
|
H A D | loopnode.hpp | 472 Node_List _body; // Loop body for inner loops 533 void check_safepts(VectorSet &visited, Node_List &stack); 708 Node_List _deadlist; 1037 Node_List*& split_if_set, Node_List*& split_bool_set, 1038 Node_List*& split_cex_set, Node_List& worklist, 1042 Node_List& extra_data_nodes); 1051 void do_peeling( IdealLoopTree *loop, Node_List &old_new ); 1143 int do_range_check( IdealLoopTree *loop, Node_List &old_new ); 1158 Node_List &old_new, 1191 bool partial_peel( IdealLoopTree *loop, Node_List &old_new ); [all …]
|
H A D | postaloc.cpp | 33 Node_List& value) { in register_contains_value() 80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 130 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 338 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 487 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 491 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 496 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 546 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 414 bool is_cmov_pack(Node_List* p); 485 void order_def_uses(Node_List* p); 506 void co_locate_pack(Node_List* p); 516 bool implemented(Node_List* p); 518 bool profitable(Node_List* p); 536 Node_List* in_pack(Node* s, Node_List* p); 542 Node* executed_last(Node_List* p); [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 414 bool is_cmov_pack(Node_List* p); 485 void order_def_uses(Node_List* p); 506 void co_locate_pack(Node_List* p); 516 bool implemented(Node_List* p); 518 bool profitable(Node_List* p); 536 Node_List* in_pack(Node* s, Node_List* p); 542 Node* executed_last(Node_List* p); [all …]
|
H A D | loopnode.hpp | 617 Node_List _body; // Loop body for inner loops 681 void check_safepts(VectorSet &visited, Node_List &stack); 868 Node_List _deadlist; 1226 Node_List*& split_if_set, Node_List*& split_bool_set, 1227 Node_List*& split_cex_set, Node_List& worklist, 1231 Node_List& extra_data_nodes); 1240 void do_peeling( IdealLoopTree *loop, Node_List &old_new ); 1343 int do_range_check( IdealLoopTree *loop, Node_List &old_new ); 1359 Node_List &old_new, 1392 bool partial_peel( IdealLoopTree *loop, Node_List &old_new ); [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 410 bool is_cmov_pack(Node_List* p); 481 void order_def_uses(Node_List* p); 502 void co_locate_pack(Node_List* p); 512 bool implemented(Node_List* p); 514 bool profitable(Node_List* p); 532 Node_List* in_pack(Node* s, Node_List* p); 538 Node* executed_last(Node_List* p); [all …]
|
H A D | loopnode.hpp | 472 Node_List _body; // Loop body for inner loops 533 void check_safepts(VectorSet &visited, Node_List &stack); 708 Node_List _deadlist; 1037 Node_List*& split_if_set, Node_List*& split_bool_set, 1038 Node_List*& split_cex_set, Node_List& worklist, 1042 Node_List& extra_data_nodes); 1051 void do_peeling( IdealLoopTree *loop, Node_List &old_new ); 1143 int do_range_check( IdealLoopTree *loop, Node_List &old_new ); 1158 Node_List &old_new, 1191 bool partial_peel( IdealLoopTree *loop, Node_List &old_new ); [all …]
|
H A D | postaloc.cpp | 33 Node_List& value) { in register_contains_value() 80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 130 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 338 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 487 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 491 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 496 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 546 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/opto/ |
H A D | superword.hpp | 215 Node_List* pack(Node* key) const { return (Node_List*)_dict->operator[](_2p(key)); } in pack() 218 Node_List* make_cmovevd_pack(Node_List* cmovd_pk); 219 bool test_cmpd_pack(Node_List* cmpd_pk, Node_List* cmovd_pk); 391 bool is_cmov_pack(Node_List* p); 462 void order_def_uses(Node_List* p); 483 void co_locate_pack(Node_List* p); 489 bool implemented(Node_List* p); 491 bool profitable(Node_List* p); 509 Node_List* in_pack(Node* s, Node_List* p); 515 Node* executed_last(Node_List* p); [all …]
|
H A D | postaloc.cpp | 33 Node_List& value) { in register_contains_value() 80 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 130 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 164 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 232 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 338 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 487 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 491 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 496 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 546 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
H A D | loopnode.hpp | 471 Node_List _body; // Loop body for inner loops 532 void check_safepts(VectorSet &visited, Node_List &stack); 709 Node_List _deadlist; 1028 Node_List*& split_if_set, Node_List*& split_bool_set, 1029 Node_List*& split_cex_set, Node_List& worklist, 1033 Node_List& extra_data_nodes); 1042 void do_peeling( IdealLoopTree *loop, Node_List &old_new ); 1150 int do_range_check( IdealLoopTree *loop, Node_List &old_new ); 1165 Node_List &old_new, 1198 bool partial_peel( IdealLoopTree *loop, Node_List &old_new ); [all …]
|
/dports/textproc/xmlada/xmlada-e5bbafe/dom/ |
H A D | dom-core.ads | 95 type Node_List is private; type 102 procedure Free (List : in out Node_List); 217 type Node_List is record type 223 Null_List : constant Node_List := (null, -1); 227 type Named_Node_Map is new Node_List; 305 Children : Node_List; 346 Doc_Children : Node_List; 353 Doc_Type_Children : Node_List; 356 Doc_Frag_Children : Node_List; 364 procedure Append (List : in out Node_List; N : Node); [all …]
|
H A D | dom-core-elements.adb | 189 return Node_List 191 procedure Get_Elements_From_Node (N : Node; List : in out Node_List); 198 procedure Get_Elements_From_Node (N : Node; List : in out Node_List) is 199 L : constant Node_List := Child_Nodes (N); 212 L : Node_List; 226 return Node_List 228 procedure Get_Elements_From_Node (N : Node; List : in out Node_List); 235 procedure Get_Elements_From_Node (N : Node; List : in out Node_List) is 236 L : constant Node_List := Child_Nodes (N); 253 L : Node_List;
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/ |
H A D | postaloc.cpp | 32 Node_List& value) { in register_contains_value() 79 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 129 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 163 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 231 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 337 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 486 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 490 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 495 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 545 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
H A D | superword.hpp | 373 bool follow_use_defs(Node_List* p); 375 bool follow_def_uses(Node_List* p); 394 void co_locate_pack(Node_List* p); 398 Node* vector_opd(Node_List* p, int opd_idx); 400 bool implemented(Node_List* p); 402 bool profitable(Node_List* p); 404 void insert_extracts(Node_List* p); 420 Node_List* in_pack(Node* s, Node_List* p); 424 Node* executed_first(Node_List* p); 426 Node* executed_last(Node_List* p); [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/ |
H A D | postaloc.cpp | 32 Node_List& value) { in register_contains_value() 79 int PhaseChaitin::yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { in yank() 129 Node_List *value, Node_List *regnd) { in yank_if_dead_recurse() 163 …_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd … in use_prior_register() 231 int PhaseChaitin::elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List &re… in elide_copy() 337 Node_List& value, Node_List& regnd, in eliminate_copy_of_constant() 486 Node_List **blk2value = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 490 Node_List **blk2regnd = NEW_RESOURCE_ARRAY( Node_List *, _cfg.number_of_blocks() + 1); in post_allocate_copy_removal() 495 GrowableArray<Node_List*> free_list = GrowableArray<Node_List*>(16); in post_allocate_copy_removal() 545 Node_List ®nd = *(free_list.is_empty() ? new Node_List() : free_list.pop()); in post_allocate_copy_removal() [all …]
|
H A D | superword.hpp | 373 bool follow_use_defs(Node_List* p); 375 bool follow_def_uses(Node_List* p); 394 void co_locate_pack(Node_List* p); 398 Node* vector_opd(Node_List* p, int opd_idx); 400 bool implemented(Node_List* p); 402 bool profitable(Node_List* p); 404 void insert_extracts(Node_List* p); 420 Node_List* in_pack(Node* s, Node_List* p); 424 Node* executed_first(Node_List* p); 426 Node* executed_last(Node_List* p); [all …]
|