Mercurial > hg > truffle
annotate src/share/vm/opto/macro.hpp @ 196:d1605aabd0a1 jdk7-b30
6719955: Update copyright year
Summary: Update copyright year for files that have been modified in 2008
Reviewed-by: ohair, tbell
| author | xdono |
|---|---|
| date | Wed, 02 Jul 2008 12:55:16 -0700 |
| parents | ba764ed4b6f2 |
| children | 02a35ad4adf8 |
| rev | line source |
|---|---|
| 0 | 1 /* |
| 196 | 2 * Copyright 2005-2008 Sun Microsystems, Inc. All Rights Reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
| 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
| 20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
| 21 * have any questions. | |
| 22 * | |
| 23 */ | |
| 24 | |
| 25 class AllocateNode; | |
| 26 class AllocateArrayNode; | |
| 27 class CallNode; | |
| 28 class Node; | |
| 29 class PhaseIterGVN; | |
| 30 | |
| 31 class PhaseMacroExpand : public Phase { | |
| 32 private: | |
| 33 PhaseIterGVN &_igvn; | |
| 34 | |
| 35 // Helper methods roughly modelled after GraphKit: | |
| 36 Node* top() const { return C->top(); } | |
| 37 Node* intcon(jint con) const { return _igvn.intcon(con); } | |
| 38 Node* longcon(jlong con) const { return _igvn.longcon(con); } | |
| 39 Node* makecon(const Type *t) const { return _igvn.makecon(t); } | |
| 40 Node* basic_plus_adr(Node* base, int offset) { | |
| 41 return (offset == 0)? base: basic_plus_adr(base, MakeConX(offset)); | |
| 42 } | |
| 43 Node* basic_plus_adr(Node* base, Node* ptr, int offset) { | |
| 44 return (offset == 0)? ptr: basic_plus_adr(base, ptr, MakeConX(offset)); | |
| 45 } | |
| 46 Node* basic_plus_adr(Node* base, Node* offset) { | |
| 47 return basic_plus_adr(base, base, offset); | |
| 48 } | |
| 49 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) { | |
| 50 Node* adr = new (C, 4) AddPNode(base, ptr, offset); | |
| 51 return transform_later(adr); | |
| 52 } | |
| 53 Node* transform_later(Node* n) { | |
| 54 // equivalent to _gvn.transform in GraphKit, Ideal, etc. | |
| 55 _igvn.register_new_node_with_optimizer(n); | |
| 56 return n; | |
| 57 } | |
| 58 void set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr); | |
| 59 Node* make_load( Node* ctl, Node* mem, Node* base, int offset, | |
| 60 const Type* value_type, BasicType bt); | |
| 61 Node* make_store(Node* ctl, Node* mem, Node* base, int offset, | |
| 62 Node* value, BasicType bt); | |
| 63 | |
| 64 // projections extracted from a call node | |
| 65 ProjNode *_fallthroughproj; | |
| 66 ProjNode *_fallthroughcatchproj; | |
| 67 ProjNode *_ioproj_fallthrough; | |
| 68 ProjNode *_ioproj_catchall; | |
| 69 ProjNode *_catchallcatchproj; | |
| 70 ProjNode *_memproj_fallthrough; | |
| 71 ProjNode *_memproj_catchall; | |
| 72 ProjNode *_resproj; | |
| 73 | |
| 74 | |
| 75 void expand_allocate(AllocateNode *alloc); | |
| 76 void expand_allocate_array(AllocateArrayNode *alloc); | |
| 77 void expand_allocate_common(AllocateNode* alloc, | |
| 78 Node* length, | |
| 79 const TypeFunc* slow_call_type, | |
| 80 address slow_call_address); | |
|
73
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
81 Node *value_from_mem(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc); |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
82 Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, int level); |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
83 |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
84 bool eliminate_allocate_node(AllocateNode *alloc); |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
85 bool can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints); |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
86 bool scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints_done); |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
87 void process_users_of_allocation(AllocateNode *alloc); |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
88 |
|
a8880a78d355
6259129: (Escape Analysis) scalar replacement for not escaping objects
kvn
parents:
66
diff
changeset
|
89 void eliminate_card_mark(Node *cm); |
|
66
6dbf1a175d6b
6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents:
0
diff
changeset
|
90 bool eliminate_locking_node(AbstractLockNode *alock); |
| 0 | 91 void expand_lock_node(LockNode *lock); |
| 92 void expand_unlock_node(UnlockNode *unlock); | |
| 93 | |
| 94 int replace_input(Node *use, Node *oldref, Node *newref); | |
| 95 void copy_call_debug_info(CallNode *oldcall, CallNode * newcall); | |
| 96 Node* opt_iff(Node* region, Node* iff); | |
| 97 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call); | |
| 98 CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call, | |
| 99 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1); | |
| 100 void extract_call_projections(CallNode *call); | |
| 101 | |
| 102 Node* initialize_object(AllocateNode* alloc, | |
| 103 Node* control, Node* rawmem, Node* object, | |
| 104 Node* klass_node, Node* length, | |
| 105 Node* size_in_bytes); | |
| 106 | |
| 107 Node* prefetch_allocation(Node* i_o, | |
| 108 Node*& needgc_false, Node*& contended_phi_rawmem, | |
| 109 Node* old_eden_top, Node* new_eden_top, | |
| 110 Node* length); | |
| 111 | |
| 112 public: | |
|
113
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
73
diff
changeset
|
113 PhaseMacroExpand(PhaseIterGVN &igvn) : Phase(Macro_Expand), _igvn(igvn) { |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
73
diff
changeset
|
114 _igvn.set_delay_transform(true); |
|
ba764ed4b6f2
6420645: Create a vm that uses compressed oops for up to 32gb heapsizes
coleenp
parents:
73
diff
changeset
|
115 } |
| 0 | 116 bool expand_macro_nodes(); |
| 117 | |
| 118 }; |