| 1 | /* |
| 2 | * Copyright (c) 2016, 2019, Red Hat, Inc. All rights reserved. |
| 3 | * |
| 4 | * This code is free software; you can redistribute it and/or modify it |
| 5 | * under the terms of the GNU General Public License version 2 only, as |
| 6 | * published by the Free Software Foundation. |
| 7 | * |
| 8 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| 9 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| 10 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 11 | * version 2 for more details (a copy is included in the LICENSE file that |
| 12 | * accompanied this code). |
| 13 | * |
| 14 | * You should have received a copy of the GNU General Public License version |
| 15 | * 2 along with this work; if not, write to the Free Software Foundation, |
| 16 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 17 | * |
| 18 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 19 | * or visit www.oracle.com if you need additional information or have any |
| 20 | * questions. |
| 21 | * |
| 22 | */ |
| 23 | |
| 24 | #ifndef SHARE_GC_SHENANDOAH_SHENANDOAHTASKQUEUE_INLINE_HPP |
| 25 | #define SHARE_GC_SHENANDOAH_SHENANDOAHTASKQUEUE_INLINE_HPP |
| 26 | |
| 27 | #include "gc/shared/taskqueue.inline.hpp" |
| 28 | #include "gc/shenandoah/shenandoahTaskqueue.hpp" |
| 29 | #include "utilities/stack.inline.hpp" |
| 30 | |
| 31 | template <class E, MEMFLAGS F, unsigned int N> |
| 32 | bool BufferedOverflowTaskQueue<E, F, N>::pop(E &t) { |
| 33 | if (!_buf_empty) { |
| 34 | t = _elem; |
| 35 | _buf_empty = true; |
| 36 | return true; |
| 37 | } |
| 38 | |
| 39 | if (taskqueue_t::pop_local(t)) { |
| 40 | return true; |
| 41 | } |
| 42 | |
| 43 | return taskqueue_t::pop_overflow(t); |
| 44 | } |
| 45 | |
| 46 | template <class E, MEMFLAGS F, unsigned int N> |
| 47 | inline bool BufferedOverflowTaskQueue<E, F, N>::push(E t) { |
| 48 | if (_buf_empty) { |
| 49 | _elem = t; |
| 50 | _buf_empty = false; |
| 51 | } else { |
| 52 | bool pushed = taskqueue_t::push(_elem); |
| 53 | assert(pushed, "overflow queue should always succeed pushing" ); |
| 54 | _elem = t; |
| 55 | } |
| 56 | return true; |
| 57 | } |
| 58 | |
| 59 | template <class E, MEMFLAGS F, unsigned int N> |
| 60 | void BufferedOverflowTaskQueue<E, F, N>::clear() { |
| 61 | _buf_empty = true; |
| 62 | taskqueue_t::set_empty(); |
| 63 | taskqueue_t::overflow_stack()->clear(); |
| 64 | } |
| 65 | |
| 66 | |
| 67 | #endif // SHARE_GC_SHENANDOAH_SHENANDOAHTASKQUEUE_INLINE_HPP |
| 68 | |