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