Mercurial > hg > truffle
changeset 1025:1ee412f7fec9
6866190: Remove SIMPLE_STACK code from TaskQueue
Summary: What the title says. We don't use SIMPLE_STACK any more.
Reviewed-by: ysr
author | tonyp |
---|---|
date | Wed, 07 Oct 2009 19:01:55 -0400 |
parents | 2c03ce058f55 |
children | f99f695bb8ef 39b01ab7035a |
files | src/share/vm/utilities/taskqueue.hpp |
diffstat | 1 files changed, 0 insertions(+), 22 deletions(-) [+] |
line wrap: on
line diff
--- a/src/share/vm/utilities/taskqueue.hpp Wed Oct 07 09:48:42 2009 -0400 +++ b/src/share/vm/utilities/taskqueue.hpp Wed Oct 07 19:01:55 2009 -0400 @@ -465,19 +465,7 @@ #endif }; -#define SIMPLE_STACK 0 - template<class E> inline bool GenericTaskQueue<E>::push(E t) { -#if SIMPLE_STACK - uint localBot = _bottom; - if (_bottom < max_elems()) { - _elems[localBot] = t; - _bottom = localBot + 1; - return true; - } else { - return false; - } -#else uint localBot = _bottom; assert((localBot >= 0) && (localBot < N), "_bottom out of range."); idx_t top = _age.top(); @@ -490,18 +478,9 @@ } else { return push_slow(t, dirty_n_elems); } -#endif } template<class E> inline bool GenericTaskQueue<E>::pop_local(E& t) { -#if SIMPLE_STACK - uint localBot = _bottom; - assert(localBot > 0, "precondition."); - localBot--; - t = _elems[localBot]; - _bottom = localBot; - return true; -#else uint localBot = _bottom; // This value cannot be N-1. That can only occur as a result of // the assignment to bottom in this method. If it does, this method @@ -529,7 +508,6 @@ // path. return pop_local_slow(localBot, _age.get()); } -#endif } typedef oop Task;