mirror of
https://github.com/openjdk/jdk.git
synced 2025-09-21 19:44:41 +02:00
4d6c5d6fef
Moves the logic for determining the size of the Zero stack into the ZeroStack class. Reviewed-by: twisti
48 lines
1.8 KiB
C++
48 lines
1.8 KiB
C++
/*
|
|
* Copyright 2003-2007 Sun Microsystems, Inc. All Rights Reserved.
|
|
* Copyright 2010 Red Hat, Inc.
|
|
* 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
* CA 95054 USA or visit www.sun.com if you need additional information or
|
|
* have any questions.
|
|
*
|
|
*/
|
|
|
|
// This function should match SharkStack::CreateStackOverflowCheck
|
|
inline void ZeroStack::overflow_check(int required_words, TRAPS) {
|
|
// Check the Zero stack
|
|
if (available_words() < required_words) {
|
|
handle_overflow(THREAD);
|
|
return;
|
|
}
|
|
|
|
// Check the ABI stack
|
|
if (abi_stack_available(THREAD) < 0) {
|
|
handle_overflow(THREAD);
|
|
return;
|
|
}
|
|
}
|
|
|
|
// This method returns the amount of ABI stack available for us
|
|
// to use under normal circumstances. Note that the returned
|
|
// value can be negative.
|
|
inline int ZeroStack::abi_stack_available(Thread *thread) const {
|
|
int stack_used = thread->stack_base() - (address) &stack_used;
|
|
int stack_free = thread->stack_size() - stack_used;
|
|
return stack_free - shadow_pages_size();
|
|
}
|