Mercurial > hg > truffle
comparison src/cpu/zero/vm/stack_zero.inline.hpp @ 1383:aa9c266de52a
6944473: 6941224 misses new files
Summary: Two new files are missing in the push for 6941224.
Reviewed-by: twisti
Contributed-by: Gary Benson <gbenson@redhat.com>
author | twisti |
---|---|
date | Fri, 16 Apr 2010 05:05:53 -0700 |
parents | |
children | 348346af6676 |
comparison
equal
deleted
inserted
replaced
1382:d32d2a2f62cd | 1383:aa9c266de52a |
---|---|
1 /* | |
2 * Copyright 2003-2007 Sun Microsystems, Inc. All Rights Reserved. | |
3 * Copyright 2010 Red Hat, Inc. | |
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
5 * | |
6 * This code is free software; you can redistribute it and/or modify it | |
7 * under the terms of the GNU General Public License version 2 only, as | |
8 * published by the Free Software Foundation. | |
9 * | |
10 * This code is distributed in the hope that it will be useful, but WITHOUT | |
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
13 * version 2 for more details (a copy is included in the LICENSE file that | |
14 * accompanied this code). | |
15 * | |
16 * You should have received a copy of the GNU General Public License version | |
17 * 2 along with this work; if not, write to the Free Software Foundation, | |
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
19 * | |
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
21 * CA 95054 USA or visit www.sun.com if you need additional information or | |
22 * have any questions. | |
23 * | |
24 */ | |
25 | |
26 // This function should match SharkStack::CreateStackOverflowCheck | |
27 inline void ZeroStack::overflow_check(int required_words, TRAPS) { | |
28 JavaThread *thread = (JavaThread *) THREAD; | |
29 | |
30 // Check the Zero stack | |
31 if (required_words > available_words()) { | |
32 handle_overflow(THREAD); | |
33 return; | |
34 } | |
35 | |
36 // Check the ABI stack | |
37 address stack_top = thread->stack_base() - thread->stack_size(); | |
38 int free_stack = ((address) &stack_top) - stack_top; | |
39 if (free_stack < shadow_pages_size()) { | |
40 handle_overflow(THREAD); | |
41 return; | |
42 } | |
43 } |