Home
last modified time | relevance | path

Searched refs:ReplacedNodes (Results 1 – 25 of 82) sorted by relevance

1234

/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
191 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
H A Dcallnode.hpp342ReplacedNodes _replaced_nodes; // During parsing: list of pair of nodes from calls to GraphKit::…
435 ReplacedNodes replaced_nodes() const { in replaced_nodes()
439 void set_replaced_nodes(ReplacedNodes replaced_nodes) { in set_replaced_nodes()
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
191 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
H A Dcallnode.hpp342ReplacedNodes _replaced_nodes; // During parsing: list of pair of nodes from calls to GraphKit::…
435 ReplacedNodes replaced_nodes() const { in replaced_nodes()
439 void set_replaced_nodes(ReplacedNodes replaced_nodes) { in set_replaced_nodes()
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
191 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
H A Dcallnode.hpp342ReplacedNodes _replaced_nodes; // During parsing: list of pair of nodes from calls to GraphKit::…
435 ReplacedNodes replaced_nodes() const { in replaced_nodes()
439 void set_replaced_nodes(ReplacedNodes replaced_nodes) { in set_replaced_nodes()
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
193 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
193 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
191 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
191 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/opto/
H A Dreplacednodes.cpp31 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
37 bool ReplacedNodes::is_empty() const { in is_empty()
41 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
45 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
66 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
80 void ReplacedNodes::clone() { in clone()
88 void ReplacedNodes::reset() { in reset()
95 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
124 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
191 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes { class
67 ReplacedNodes() in ReplacedNodes() function in ReplacedNodes
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/
H A Dreplacednodes.cpp30 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
36 bool ReplacedNodes::is_empty() const { in is_empty()
40 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
44 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
65 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
79 void ReplacedNodes::clone() { in clone()
87 void ReplacedNodes::reset() { in reset()
94 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
123 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
190 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes VALUE_OBJ_CLASS_SPEC {
67 ReplacedNodes() in ReplacedNodes() function in VALUE_OBJ_CLASS_SPEC
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
H A Dcallnode.hpp339ReplacedNodes _replaced_nodes; // During parsing: list of pair of nodes from calls to GraphKit::…
432 ReplacedNodes replaced_nodes() const { in replaced_nodes()
436 void set_replaced_nodes(ReplacedNodes replaced_nodes) { in set_replaced_nodes()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/
H A Dreplacednodes.cpp30 void ReplacedNodes::allocate_if_necessary() { in allocate_if_necessary()
36 bool ReplacedNodes::is_empty() const { in is_empty()
40 bool ReplacedNodes::has_node(const ReplacedNode& r) const { in has_node()
44 bool ReplacedNodes::has_target_node(Node* n) const { in has_target_node()
65 void ReplacedNodes::transfer_from(const ReplacedNodes& other, uint idx) { in transfer_from()
79 void ReplacedNodes::clone() { in clone()
87 void ReplacedNodes::reset() { in reset()
94 void ReplacedNodes::apply(Node* n, uint idx) { in apply()
123 void ReplacedNodes::apply(Compile* C, Node* ctl) { in apply()
190 void ReplacedNodes::dump(outputStream *st) const { in dump()
[all …]
H A Dreplacednodes.hpp44 class ReplacedNodes VALUE_OBJ_CLASS_SPEC {
67 ReplacedNodes() in ReplacedNodes() function in VALUE_OBJ_CLASS_SPEC
72 void transfer_from(const ReplacedNodes& other, uint idx);
75 void merge_with(const ReplacedNodes& other);
H A Dcallnode.hpp339ReplacedNodes _replaced_nodes; // During parsing: list of pair of nodes from calls to GraphKit::…
432 ReplacedNodes replaced_nodes() const { in replaced_nodes()
436 void set_replaced_nodes(ReplacedNodes replaced_nodes) { in set_replaced_nodes()

1234