1 /*
2 * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved.
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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
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(), 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());
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[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);
192 }
193
194 #ifndef PRODUCT
195
196 void ValueStack::print() {
197 scope()->method()->print_name();
198 tty->cr();
199 if (stack_is_empty()) {
200 tty->print_cr("empty stack");
201 } else {
208 tty->cr();
209 }
210 }
211 if (!no_active_locks()) {
212 InstructionPrinter ip;
213 for (int i = 0; i < locks_size(); i++) {
214 Value t = lock_at(i);
215 tty->print("lock %2d ", i);
216 if (t == NULL) {
217 tty->print("this");
218 } else {
219 tty->print("%c%d ", t->type()->tchar(), t->id());
220 ip.print_instr(t);
221 }
222 tty->cr();
223 }
224 }
225 if (locals_size() > 0) {
226 InstructionPrinter ip;
227 for (int i = 0; i < locals_size();) {
228 Value l = _locals[i];
229 tty->print("local %d ", i);
230 if (l == NULL) {
231 tty->print("null");
232 i ++;
233 } else {
234 tty->print("%c%d ", l->type()->tchar(), l->id());
235 ip.print_instr(l);
236 if (l->type()->is_illegal() || l->type()->is_single_word()) i ++; else i += 2;
237 }
238 tty->cr();
239 }
240 }
241
242 if (caller_state() != NULL) {
243 caller_state()->print();
244 }
245 }
246
247
248 void ValueStack::verify() {
|
1 /*
2 * Copyright (c) 1999, 2016, Oracle and/or its affiliates. All rights reserved.
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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
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());
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);
192 }
193
194 #ifndef PRODUCT
195
196 void ValueStack::print() {
197 scope()->method()->print_name();
198 tty->cr();
199 if (stack_is_empty()) {
200 tty->print_cr("empty stack");
201 } else {
208 tty->cr();
209 }
210 }
211 if (!no_active_locks()) {
212 InstructionPrinter ip;
213 for (int i = 0; i < locks_size(); i++) {
214 Value t = lock_at(i);
215 tty->print("lock %2d ", i);
216 if (t == NULL) {
217 tty->print("this");
218 } else {
219 tty->print("%c%d ", t->type()->tchar(), t->id());
220 ip.print_instr(t);
221 }
222 tty->cr();
223 }
224 }
225 if (locals_size() > 0) {
226 InstructionPrinter ip;
227 for (int i = 0; i < locals_size();) {
228 Value l = _locals.at(i);
229 tty->print("local %d ", i);
230 if (l == NULL) {
231 tty->print("null");
232 i ++;
233 } else {
234 tty->print("%c%d ", l->type()->tchar(), l->id());
235 ip.print_instr(l);
236 if (l->type()->is_illegal() || l->type()->is_single_word()) i ++; else i += 2;
237 }
238 tty->cr();
239 }
240 }
241
242 if (caller_state() != NULL) {
243 caller_state()->print();
244 }
245 }
246
247
248 void ValueStack::verify() {
|