/*

 * Copyright (c) 1999, 2006, Oracle and/or its affiliates. All rights reserved.

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 *

 */

#include "incls/_precompiled.incl"

#include "incls/_c1_ValueStack.cpp.incl"

// Implementation of ValueStack

: _scope(scope)

{

}

  }

    }

  }

}

  // compare each stack element with the corresponding stack element of s

  int index;

  Value value;

  for_each_stack_value(this, index, value) {

    if (value->type()->tag() != s->stack_at(index)->type()->tag()) return false;

  }

  for_each_lock_value(this, index, value) {

    if (value != s->lock_at(index)) return false;

  }

  return true;

}

void ValueStack::clear_locals() {

  for (int i = _locals.length() - 1; i >= 0; i--) {

    _locals.at_put(i, NULL);

  }

}

void ValueStack::pin_stack_for_linear_scan() {

  for_each_state_value(this, v,

    if (v->as_Constant() == NULL && v->as_Local() == NULL) {

      v->pin(Instruction::PinStackForStateSplit);

    }

  );

}

// apply function to all values of a list; factored out from values_do(f)

void ValueStack::apply(Values list, ValueVisitor* f) {

  for (int i = 0; i < list.length(); i++) {

    Value* va = list.adr_at(i);

    Value v0 = *va;

#ifdef ASSERT

#endif

    }

  }

}

void ValueStack::values_do(ValueVisitor* f) {

  ValueStack* state = this;

  for_each_state(state) {

    apply(state->_locals, f);

  }

}

Values* ValueStack::pop_arguments(int argument_size) {

  assert(stack_size() >= argument_size, "stack too small or too many arguments");

  int base = stack_size() - argument_size;

  Values* args = new Values(argument_size);

  for (int i = base; i < stack_size();) args->push(stack_at_inc(i));

  truncate_stack(base);

  return args;

}

  _locks.push(obj);

}

int ValueStack::unlock() {

  _locks.pop();

}

void ValueStack::setup_phi_for_stack(BlockBegin* b, int index) {

  assert(stack_at(index)->as_Phi() == NULL || stack_at(index)->as_Phi()->block() != b, "phi function already created");

  ValueType* t = stack_at(index)->type();

  Value phi = new Phi(t, b, -index - 1);

  _stack[index] = phi;

}

void ValueStack::setup_phi_for_local(BlockBegin* b, int index) {

  assert(local_at(index)->as_Phi() == NULL || local_at(index)->as_Phi()->block() != b, "phi function already created");

  ValueType* t = local_at(index)->type();

  Value phi = new Phi(t, b, index);

  store_local(index, phi);

}

#ifndef PRODUCT

void ValueStack::print() {

  if (stack_is_empty()) {

    tty->print_cr("empty stack");

  } else {

    InstructionPrinter ip;

    for (int i = 0; i < stack_size();) {

      Value t = stack_at_inc(i);

      tty->print("%2d  ", i);

      ip.print_instr(t);

      tty->cr();

    }

  }

  if (!no_active_locks()) {

    InstructionPrinter ip;

      Value t = lock_at(i);

      tty->print("lock %2d  ", i);

      if (t == NULL) {

        tty->print("this");

      } else {

        ip.print_instr(t);

      }

      tty->cr();

    }

  }

  if (locals_size() > 0) {

    InstructionPrinter ip;

    for (int i = 0; i < locals_size();) {

      Value l = _locals[i];

      tty->print("local %d ", i);

      if (l == NULL) {

        tty->print("null");

        i ++;

      } else {

        ip.print_instr(l);

        if (l->type()->is_illegal() || l->type()->is_single_word()) i ++; else i += 2;

      }

      tty->cr();

    }

  }

}

void ValueStack::verify() {

}

#endif // PRODUCT