src/cpu/zero/vm/stack_zero.inline.hpp

changeset 1818
aa9c266de52a
child 1866
348346af6676
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/cpu/zero/vm/stack_zero.inline.hpp	Fri Apr 16 05:05:53 2010 -0700
     1.3 @@ -0,0 +1,43 @@
     1.4 +/*
     1.5 + * Copyright 2003-2007 Sun Microsystems, Inc.  All Rights Reserved.
     1.6 + * Copyright 2010 Red Hat, Inc.
     1.7 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.8 + *
     1.9 + * This code is free software; you can redistribute it and/or modify it
    1.10 + * under the terms of the GNU General Public License version 2 only, as
    1.11 + * published by the Free Software Foundation.
    1.12 + *
    1.13 + * This code is distributed in the hope that it will be useful, but WITHOUT
    1.14 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.15 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.16 + * version 2 for more details (a copy is included in the LICENSE file that
    1.17 + * accompanied this code).
    1.18 + *
    1.19 + * You should have received a copy of the GNU General Public License version
    1.20 + * 2 along with this work; if not, write to the Free Software Foundation,
    1.21 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.22 + *
    1.23 + * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
    1.24 + * CA 95054 USA or visit www.sun.com if you need additional information or
    1.25 + * have any questions.
    1.26 + *
    1.27 + */
    1.28 +
    1.29 +// This function should match SharkStack::CreateStackOverflowCheck
    1.30 +inline void ZeroStack::overflow_check(int required_words, TRAPS) {
    1.31 +  JavaThread *thread = (JavaThread *) THREAD;
    1.32 +
    1.33 +  // Check the Zero stack
    1.34 +  if (required_words > available_words()) {
    1.35 +    handle_overflow(THREAD);
    1.36 +    return;
    1.37 +  }
    1.38 +
    1.39 +  // Check the ABI stack
    1.40 +  address stack_top = thread->stack_base() - thread->stack_size();
    1.41 +  int free_stack = ((address) &stack_top) - stack_top;
    1.42 +  if (free_stack < shadow_pages_size()) {
    1.43 +    handle_overflow(THREAD);
    1.44 +    return;
    1.45 +  }
    1.46 +}

mercurial