duke@435: /*
duke@435:  * Copyright 1999-2006 Sun Microsystems, Inc.  All Rights Reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
duke@435:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435:  * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435:  * have any questions.
duke@435:  *
duke@435:  */
duke@435: 
duke@435: #include "incls/_precompiled.incl"
duke@435: #include "incls/_c1_ValueStack.cpp.incl"
duke@435: 
duke@435: 
duke@435: // Implementation of ValueStack
duke@435: 
duke@435: ValueStack::ValueStack(IRScope* scope, int locals_size, int max_stack_size)
duke@435: : _scope(scope)
duke@435: , _locals(locals_size, NULL)
duke@435: , _stack(max_stack_size)
duke@435: , _lock_stack(false)
duke@435: , _locks(1)
duke@435: {
duke@435:   assert(scope != NULL, "scope must exist");
duke@435: }
duke@435: 
duke@435: ValueStack* ValueStack::copy() {
duke@435:   ValueStack* s = new ValueStack(scope(), locals_size(), max_stack_size());
duke@435:   s->_stack.appendAll(&_stack);
duke@435:   s->_locks.appendAll(&_locks);
duke@435:   s->replace_locals(this);
duke@435:   return s;
duke@435: }
duke@435: 
duke@435: 
duke@435: ValueStack* ValueStack::copy_locks() {
duke@435:   int sz = scope()->lock_stack_size();
duke@435:   if (stack_size() == 0) {
duke@435:     sz = 0;
duke@435:   }
duke@435:   ValueStack* s = new ValueStack(scope(), locals_size(), sz);
duke@435:   s->_lock_stack = true;
duke@435:   s->_locks.appendAll(&_locks);
duke@435:   s->replace_locals(this);
duke@435:   if (sz > 0) {
duke@435:     assert(sz <= stack_size(), "lock stack underflow");
duke@435:     for (int i = 0; i < sz; i++) {
duke@435:       s->_stack.append(_stack[i]);
duke@435:     }
duke@435:   }
duke@435:   return s;
duke@435: }
duke@435: 
duke@435: bool ValueStack::is_same(ValueStack* s) {
duke@435:   assert(s != NULL, "state must exist");
duke@435:   assert(scope      () == s->scope      (), "scopes       must correspond");
duke@435:   assert(locals_size() == s->locals_size(), "locals sizes must correspond");
duke@435:   return is_same_across_scopes(s);
duke@435: }
duke@435: 
duke@435: 
duke@435: bool ValueStack::is_same_across_scopes(ValueStack* s) {
duke@435:   assert(s != NULL, "state must exist");
duke@435:   assert(stack_size () == s->stack_size (), "stack  sizes must correspond");
duke@435:   assert(locks_size () == s->locks_size (), "locks  sizes must correspond");
duke@435:   // compare each stack element with the corresponding stack element of s
duke@435:   int index;
duke@435:   Value value;
duke@435:   for_each_stack_value(this, index, value) {
duke@435:     if (value->type()->tag() != s->stack_at(index)->type()->tag()) return false;
duke@435:   }
duke@435:   for_each_lock_value(this, index, value) {
duke@435:     if (value != s->lock_at(index)) return false;
duke@435:   }
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: 
duke@435: ValueStack* ValueStack::caller_state() const {
duke@435:   return scope()->caller_state();
duke@435: }
duke@435: 
duke@435: 
duke@435: void ValueStack::clear_locals() {
duke@435:   for (int i = _locals.length() - 1; i >= 0; i--) {
duke@435:     _locals.at_put(i, NULL);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void ValueStack::replace_locals(ValueStack* with) {
duke@435:   assert(locals_size() == with->locals_size(), "number of locals must match");
duke@435:   for (int i = locals_size() - 1; i >= 0; i--) {
duke@435:     _locals.at_put(i, with->_locals.at(i));
duke@435:   }
duke@435: }
duke@435: 
duke@435: void ValueStack::pin_stack_for_linear_scan() {
duke@435:   for_each_state_value(this, v,
duke@435:     if (v->as_Constant() == NULL && v->as_Local() == NULL) {
duke@435:       v->pin(Instruction::PinStackForStateSplit);
duke@435:     }
duke@435:   );
duke@435: }
duke@435: 
duke@435: 
duke@435: // apply function to all values of a list; factored out from values_do(f)
duke@435: void ValueStack::apply(Values list, void f(Value*)) {
duke@435:   for (int i = 0; i < list.length(); i++) {
duke@435:     Value* va = list.adr_at(i);
duke@435:     Value v0 = *va;
duke@435:     if (v0 != NULL) {
duke@435:       if (!v0->type()->is_illegal()) {
duke@435:         assert(v0->as_HiWord() == NULL, "should never see HiWord during traversal");
duke@435:         f(va);
duke@435: #ifdef ASSERT
duke@435:         Value v1 = *va;
duke@435:         if (v0 != v1) {
duke@435:           assert(v1->type()->is_illegal() || v0->type()->tag() == v1->type()->tag(), "types must match");
duke@435:           if (v0->type()->is_double_word()) {
duke@435:             list.at_put(i + 1, v0->hi_word());
duke@435:           }
duke@435:         }
duke@435: #endif
duke@435:         if (v0->type()->is_double_word()) i++;
duke@435:       }
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void ValueStack::values_do(void f(Value*)) {
duke@435:   apply(_stack, f);
duke@435:   apply(_locks, f);
duke@435: 
duke@435:   ValueStack* state = this;
duke@435:   for_each_state(state) {
duke@435:     apply(state->_locals, f);
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: Values* ValueStack::pop_arguments(int argument_size) {
duke@435:   assert(stack_size() >= argument_size, "stack too small or too many arguments");
duke@435:   int base = stack_size() - argument_size;
duke@435:   Values* args = new Values(argument_size);
duke@435:   for (int i = base; i < stack_size();) args->push(stack_at_inc(i));
duke@435:   truncate_stack(base);
duke@435:   return args;
duke@435: }
duke@435: 
duke@435: 
duke@435: int ValueStack::lock(IRScope* scope, Value obj) {
duke@435:   _locks.push(obj);
duke@435:   scope->set_min_number_of_locks(locks_size());
duke@435:   return locks_size() - 1;
duke@435: }
duke@435: 
duke@435: 
duke@435: int ValueStack::unlock() {
duke@435:   _locks.pop();
duke@435:   return locks_size();
duke@435: }
duke@435: 
duke@435: 
duke@435: ValueStack* ValueStack::push_scope(IRScope* scope) {
duke@435:   assert(scope->caller() == _scope, "scopes must have caller/callee relationship");
duke@435:   ValueStack* res = new ValueStack(scope,
duke@435:                                    scope->method()->max_locals(),
duke@435:                                    max_stack_size() + scope->method()->max_stack());
duke@435:   // Preserves stack and monitors.
duke@435:   res->_stack.appendAll(&_stack);
duke@435:   res->_locks.appendAll(&_locks);
duke@435:   assert(res->_stack.size() <= res->max_stack_size(), "stack overflow");
duke@435:   return res;
duke@435: }
duke@435: 
duke@435: 
duke@435: ValueStack* ValueStack::pop_scope() {
duke@435:   assert(_scope->caller() != NULL, "scope must have caller");
duke@435:   IRScope* scope = _scope->caller();
duke@435:   int max_stack = max_stack_size() - _scope->method()->max_stack();
duke@435:   assert(max_stack >= 0, "stack underflow");
duke@435:   ValueStack* res = new ValueStack(scope,
duke@435:                                    scope->method()->max_locals(),
duke@435:                                    max_stack);
duke@435:   // Preserves stack and monitors. Restores local and store state from caller scope.
duke@435:   res->_stack.appendAll(&_stack);
duke@435:   res->_locks.appendAll(&_locks);
duke@435:   ValueStack* caller = caller_state();
duke@435:   if (caller != NULL) {
duke@435:     for (int i = 0; i < caller->_locals.length(); i++) {
duke@435:       res->_locals.at_put(i, caller->_locals.at(i));
duke@435:     }
duke@435:     assert(res->_locals.length() == res->scope()->method()->max_locals(), "just checking");
duke@435:   }
duke@435:   assert(res->_stack.size() <= res->max_stack_size(), "stack overflow");
duke@435:   return res;
duke@435: }
duke@435: 
duke@435: 
duke@435: void ValueStack::setup_phi_for_stack(BlockBegin* b, int index) {
duke@435:   assert(stack_at(index)->as_Phi() == NULL || stack_at(index)->as_Phi()->block() != b, "phi function already created");
duke@435: 
duke@435:   ValueType* t = stack_at(index)->type();
duke@435:   Value phi = new Phi(t, b, -index - 1);
duke@435:   _stack[index] = phi;
duke@435: 
duke@435: #ifdef ASSERT
duke@435:   if (t->is_double_word()) {
duke@435:     _stack[index + 1] = phi->hi_word();
duke@435:   }
duke@435: #endif
duke@435: }
duke@435: 
duke@435: void ValueStack::setup_phi_for_local(BlockBegin* b, int index) {
duke@435:   assert(local_at(index)->as_Phi() == NULL || local_at(index)->as_Phi()->block() != b, "phi function already created");
duke@435: 
duke@435:   ValueType* t = local_at(index)->type();
duke@435:   Value phi = new Phi(t, b, index);
duke@435:   store_local(index, phi);
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void ValueStack::print() {
duke@435:   if (stack_is_empty()) {
duke@435:     tty->print_cr("empty stack");
duke@435:   } else {
duke@435:     InstructionPrinter ip;
duke@435:     for (int i = 0; i < stack_size();) {
duke@435:       Value t = stack_at_inc(i);
duke@435:       tty->print("%2d  ", i);
duke@435:       ip.print_instr(t);
duke@435:       tty->cr();
duke@435:     }
duke@435:   }
duke@435:   if (!no_active_locks()) {
duke@435:     InstructionPrinter ip;
duke@435:     for (int i = 0; i < locks_size(); i--) {
duke@435:       Value t = lock_at(i);
duke@435:       tty->print("lock %2d  ", i);
duke@435:       if (t == NULL) {
duke@435:         tty->print("this");
duke@435:       } else {
duke@435:         ip.print_instr(t);
duke@435:       }
duke@435:       tty->cr();
duke@435:     }
duke@435:   }
duke@435:   if (locals_size() > 0) {
duke@435:     InstructionPrinter ip;
duke@435:     for (int i = 0; i < locals_size();) {
duke@435:       Value l = _locals[i];
duke@435:       tty->print("local %d ", i);
duke@435:       if (l == NULL) {
duke@435:         tty->print("null");
duke@435:         i ++;
duke@435:       } else {
duke@435:         ip.print_instr(l);
duke@435:         if (l->type()->is_illegal() || l->type()->is_single_word()) i ++; else i += 2;
duke@435:       }
duke@435:       tty->cr();
duke@435:     }
duke@435:   }
duke@435: }
duke@435: 
duke@435: 
duke@435: void ValueStack::verify() {
duke@435:   Unimplemented();
duke@435: }
duke@435: #endif // PRODUCT