equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 2001, 2017, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2001, 2018, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
244 // Expand the stack, typically in response to an overflow condition. |
244 // Expand the stack, typically in response to an overflow condition. |
245 void expand(); |
245 void expand(); |
246 |
246 |
247 // Compute the least valued stack element. |
247 // Compute the least valued stack element. |
248 oop least_value(HeapWord* low) { |
248 oop least_value(HeapWord* low) { |
249 oop least = (oop)low; |
249 HeapWord* least = low; |
250 for (size_t i = 0; i < _index; i++) { |
250 for (size_t i = 0; i < _index; i++) { |
251 least = MIN2(least, _base[i]); |
251 least = MIN2(least, (HeapWord*)_base[i]); |
252 } |
252 } |
253 return least; |
253 return (oop)least; |
254 } |
254 } |
255 |
255 |
256 // Exposed here to allow stack expansion in || case. |
256 // Exposed here to allow stack expansion in || case. |
257 Mutex* par_lock() { return &_par_lock; } |
257 Mutex* par_lock() { return &_par_lock; } |
258 }; |
258 }; |