20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "c1/c1_IR.hpp"
27 #include "c1/c1_InstructionPrinter.hpp"
28 #include "c1/c1_ValueStack.hpp"
29
30
31 // Implementation of ValueStack
32
33 ValueStack::ValueStack(IRScope* scope, ValueStack* caller_state)
34 : _scope(scope)
35 , _caller_state(caller_state)
36 , _bci(-99)
37 , _kind(Parsing)
38 , _locals(scope->method()->max_locals(), scope->method()->max_locals(), NULL)
39 , _stack(scope->method()->max_stack())
40 , _locks()
41 {
42 verify();
43 }
44
45
46 ValueStack::ValueStack(ValueStack* copy_from, Kind kind, int bci)
47 : _scope(copy_from->scope())
48 , _caller_state(copy_from->caller_state())
49 , _bci(bci)
50 , _kind(kind)
51 , _locals()
52 , _stack()
53 , _locks(copy_from->locks_size())
54 {
55 assert(kind != EmptyExceptionState || !Compilation::current()->env()->should_retain_local_variables(), "need locals");
56 if (kind != EmptyExceptionState) {
57 // only allocate space if we need to copy the locals-array
58 _locals = Values(copy_from->locals_size());
59 _locals.appendAll(©_from->_locals);
60 }
61
62 if (kind != ExceptionState && kind != EmptyExceptionState) {
63 if (kind == Parsing) {
64 // stack will be modified, so reserve enough space to avoid resizing
65 _stack = Values(scope()->method()->max_stack());
66 } else {
67 // stack will not be modified, so do not waste space
68 _stack = Values(copy_from->stack_size());
69 }
70 _stack.appendAll(©_from->_stack);
71 }
72
73 _locks.appendAll(©_from->_locks);
74
75 verify();
76 }
77
78
79 bool ValueStack::is_same(ValueStack* s) {
80 if (scope() != s->scope()) return false;
81 if (caller_state() != s->caller_state()) return false;
82
83 if (locals_size() != s->locals_size()) return false;
84 if (stack_size() != s->stack_size()) return false;
85 if (locks_size() != s->locks_size()) return false;
86
87 // compare each stack element with the corresponding stack element of s
88 int index;
89 Value value;
90 for_each_stack_value(this, index, value) {
91 if (value->type()->tag() != s->stack_at(index)->type()->tag()) return false;
92 }
93 for_each_lock_value(this, index, value) {
94 if (value != s->lock_at(index)) return false;
95 }
96 return true;
97 }
98
99 void ValueStack::clear_locals() {
100 for (int i = _locals.length() - 1; i >= 0; i--) {
101 _locals.at_put(i, NULL);
102 }
103 }
104
105
106 void ValueStack::pin_stack_for_linear_scan() {
107 for_each_state_value(this, v,
108 if (v->as_Constant() == NULL && v->as_Local() == NULL) {
109 v->pin(Instruction::PinStackForStateSplit);
110 }
111 );
112 }
113
114
115 // apply function to all values of a list; factored out from values_do(f)
116 void ValueStack::apply(Values list, ValueVisitor* f) {
117 for (int i = 0; i < list.length(); i++) {
118 Value* va = list.adr_at(i);
119 Value v0 = *va;
120 if (v0 != NULL && !v0->type()->is_illegal()) {
121 f->visit(va);
122 #ifdef ASSERT
123 Value v1 = *va;
124 assert(v1->type()->is_illegal() || v0->type()->tag() == v1->type()->tag(), "types must match");
125 assert(!v1->type()->is_double_word() || list.at(i + 1) == NULL, "hi-word of doubleword value must be NULL");
126 #endif
127 if (v0->type()->is_double_word()) i++;
128 }
129 }
130 }
131
132
133 void ValueStack::values_do(ValueVisitor* f) {
134 ValueStack* state = this;
135 for_each_state(state) {
136 apply(state->_locals, f);
137 apply(state->_stack, f);
138 apply(state->_locks, f);
139 }
140 }
141
142
143 Values* ValueStack::pop_arguments(int argument_size) {
144 assert(stack_size() >= argument_size, "stack too small or too many arguments");
145 int base = stack_size() - argument_size;
146 Values* args = new Values(argument_size);
147 for (int i = base; i < stack_size();) args->push(stack_at_inc(i));
148 truncate_stack(base);
149 return args;
150 }
151
152
153 int ValueStack::total_locks_size() const {
154 int num_locks = 0;
155 const ValueStack* state = this;
156 for_each_state(state) {
157 num_locks += state->locks_size();
158 }
159 return num_locks;
160 }
161
162 int ValueStack::lock(Value obj) {
163 _locks.push(obj);
164 int num_locks = total_locks_size();
165 scope()->set_min_number_of_locks(num_locks);
166 return num_locks - 1;
167 }
168
169
170 int ValueStack::unlock() {
171 _locks.pop();
172 return total_locks_size();
173 }
174
175
176 void ValueStack::setup_phi_for_stack(BlockBegin* b, int index) {
177 assert(stack_at(index)->as_Phi() == NULL || stack_at(index)->as_Phi()->block() != b, "phi function already created");
178
179 ValueType* t = stack_at(index)->type();
180 Value phi = new Phi(t, b, -index - 1);
181 _stack.at_put(index, phi);
182
183 assert(!t->is_double_word() || _stack.at(index + 1) == NULL, "hi-word of doubleword value must be NULL");
184 }
185
186 void ValueStack::setup_phi_for_local(BlockBegin* b, int index) {
187 assert(local_at(index)->as_Phi() == NULL || local_at(index)->as_Phi()->block() != b, "phi function already created");
188
189 ValueType* t = local_at(index)->type();
190 Value phi = new Phi(t, b, index);
191 store_local(index, phi);
|
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "c1/c1_IR.hpp"
27 #include "c1/c1_InstructionPrinter.hpp"
28 #include "c1/c1_ValueStack.hpp"
29
30
31 // Implementation of ValueStack
32
33 ValueStack::ValueStack(IRScope* scope, ValueStack* caller_state)
34 : _scope(scope)
35 , _caller_state(caller_state)
36 , _bci(-99)
37 , _kind(Parsing)
38 , _locals(scope->method()->max_locals(), scope->method()->max_locals(), NULL)
39 , _stack(scope->method()->max_stack())
40 , _locks(NULL)
41 {
42 verify();
43 }
44
45
46 ValueStack::ValueStack(ValueStack* copy_from, Kind kind, int bci)
47 : _scope(copy_from->scope())
48 , _caller_state(copy_from->caller_state())
49 , _bci(bci)
50 , _kind(kind)
51 , _locals()
52 , _stack()
53 , _locks(copy_from->locks_size() == 0 ? NULL : new Values(copy_from->locks_size()))
54 {
55 assert(kind != EmptyExceptionState || !Compilation::current()->env()->should_retain_local_variables(), "need locals");
56 if (kind != EmptyExceptionState) {
57 // only allocate space if we need to copy the locals-array
58 _locals = Values(copy_from->locals_size());
59 _locals.appendAll(©_from->_locals);
60 }
61
62 if (kind != ExceptionState && kind != EmptyExceptionState) {
63 if (kind == Parsing) {
64 // stack will be modified, so reserve enough space to avoid resizing
65 _stack = Values(scope()->method()->max_stack());
66 } else {
67 // stack will not be modified, so do not waste space
68 _stack = Values(copy_from->stack_size());
69 }
70 _stack.appendAll(©_from->_stack);
71 }
72
73 if (copy_from->locks_size() > 0) {
74 _locks->appendAll(copy_from->_locks);
75 }
76
77 verify();
78 }
79
80
81 bool ValueStack::is_same(ValueStack* s) {
82 if (scope() != s->scope()) return false;
83 if (caller_state() != s->caller_state()) return false;
84
85 if (locals_size() != s->locals_size()) return false;
86 if (stack_size() != s->stack_size()) return false;
87 if (locks_size() != s->locks_size()) return false;
88
89 // compare each stack element with the corresponding stack element of s
90 int index;
91 Value value;
92 for_each_stack_value(this, index, value) {
93 if (value->type()->tag() != s->stack_at(index)->type()->tag()) return false;
94 }
95 for (int i = 0; i < locks_size(); i++) {
96 value = lock_at(i);
97 if (value != NULL && value != s->lock_at(i)) {
98 return false;
99 }
100 }
101 return true;
102 }
103
104 void ValueStack::clear_locals() {
105 for (int i = _locals.length() - 1; i >= 0; i--) {
106 _locals.at_put(i, NULL);
107 }
108 }
109
110
111 void ValueStack::pin_stack_for_linear_scan() {
112 for_each_state_value(this, v,
113 if (v->as_Constant() == NULL && v->as_Local() == NULL) {
114 v->pin(Instruction::PinStackForStateSplit);
115 }
116 );
117 }
118
119
120 // apply function to all values of a list; factored out from values_do(f)
121 void ValueStack::apply(const Values& list, ValueVisitor* f) {
122 for (int i = 0; i < list.length(); i++) {
123 Value* va = list.adr_at(i);
124 Value v0 = *va;
125 if (v0 != NULL && !v0->type()->is_illegal()) {
126 f->visit(va);
127 #ifdef ASSERT
128 Value v1 = *va;
129 assert(v1->type()->is_illegal() || v0->type()->tag() == v1->type()->tag(), "types must match");
130 assert(!v1->type()->is_double_word() || list.at(i + 1) == NULL, "hi-word of doubleword value must be NULL");
131 #endif
132 if (v0->type()->is_double_word()) i++;
133 }
134 }
135 }
136
137
138 void ValueStack::values_do(ValueVisitor* f) {
139 ValueStack* state = this;
140 for_each_state(state) {
141 apply(state->_locals, f);
142 apply(state->_stack, f);
143 if (state->_locks != NULL) {
144 apply(*state->_locks, f);
145 }
146 }
147 }
148
149
150 Values* ValueStack::pop_arguments(int argument_size) {
151 assert(stack_size() >= argument_size, "stack too small or too many arguments");
152 int base = stack_size() - argument_size;
153 Values* args = new Values(argument_size);
154 for (int i = base; i < stack_size();) args->push(stack_at_inc(i));
155 truncate_stack(base);
156 return args;
157 }
158
159
160 int ValueStack::total_locks_size() const {
161 int num_locks = 0;
162 const ValueStack* state = this;
163 for_each_state(state) {
164 num_locks += state->locks_size();
165 }
166 return num_locks;
167 }
168
169 int ValueStack::lock(Value obj) {
170 if (_locks == NULL) {
171 _locks = new Values();
172 }
173 _locks->push(obj);
174 int num_locks = total_locks_size();
175 scope()->set_min_number_of_locks(num_locks);
176 return num_locks - 1;
177 }
178
179
180 int ValueStack::unlock() {
181 assert(locks_size() > 0, "sanity");
182 _locks->pop();
183 return total_locks_size();
184 }
185
186
187 void ValueStack::setup_phi_for_stack(BlockBegin* b, int index) {
188 assert(stack_at(index)->as_Phi() == NULL || stack_at(index)->as_Phi()->block() != b, "phi function already created");
189
190 ValueType* t = stack_at(index)->type();
191 Value phi = new Phi(t, b, -index - 1);
192 _stack.at_put(index, phi);
193
194 assert(!t->is_double_word() || _stack.at(index + 1) == NULL, "hi-word of doubleword value must be NULL");
195 }
196
197 void ValueStack::setup_phi_for_local(BlockBegin* b, int index) {
198 assert(local_at(index)->as_Phi() == NULL || local_at(index)->as_Phi()->block() != b, "phi function already created");
199
200 ValueType* t = local_at(index)->type();
201 Value phi = new Phi(t, b, index);
202 store_local(index, phi);
|