equal
deleted
inserted
replaced
142 virtual uint ideal_reg() const { return Op_RegP; } |
142 virtual uint ideal_reg() const { return Op_RegP; } |
143 Node *base_node() { assert( req() > Base, "Missing base"); return in(Base); } |
143 Node *base_node() { assert( req() > Base, "Missing base"); return in(Base); } |
144 static Node* Ideal_base_and_offset(Node* ptr, PhaseTransform* phase, |
144 static Node* Ideal_base_and_offset(Node* ptr, PhaseTransform* phase, |
145 // second return value: |
145 // second return value: |
146 intptr_t& offset); |
146 intptr_t& offset); |
|
147 |
|
148 // Collect the AddP offset values into the elements array, giving up |
|
149 // if there are more than length. |
|
150 int unpack_offsets(Node* elements[], int length); |
|
151 |
147 // Do not match base-ptr edge |
152 // Do not match base-ptr edge |
148 virtual uint match_edge(uint idx) const; |
153 virtual uint match_edge(uint idx) const; |
149 static const Type *mach_bottom_type(const MachNode* n); // used by ad_<arch>.hpp |
154 static const Type *mach_bottom_type(const MachNode* n); // used by ad_<arch>.hpp |
150 }; |
155 }; |
151 |
156 |