1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/utilities/chunkedList.hpp Thu Oct 02 10:55:36 2014 +0200
1.3 @@ -0,0 +1,81 @@
1.4 +/*
1.5 + * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
1.7 + *
1.8 + * This code is free software; you can redistribute it and/or modify it
1.9 + * under the terms of the GNU General Public License version 2 only, as
1.10 + * published by the Free Software Foundation.
1.11 + *
1.12 + * This code is distributed in the hope that it will be useful, but WITHOUT
1.13 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
1.14 + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
1.15 + * version 2 for more details (a copy is included in the LICENSE file that
1.16 + * accompanied this code).
1.17 + *
1.18 + * You should have received a copy of the GNU General Public License version
1.19 + * 2 along with this work; if not, write to the Free Software Foundation,
1.20 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
1.21 + *
1.22 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
1.23 + * or visit www.oracle.com if you need additional information or have any
1.24 + * questions.
1.25 + *
1.26 + */
1.27 +
1.28 +#ifndef SHARE_VM_UTILITIES_CHUNKED_LIST_HPP
1.29 +#define SHARE_VM_UTILITIES_CHUNKED_LIST_HPP
1.30 +
1.31 +#include "memory/allocation.hpp"
1.32 +#include "utilities/debug.hpp"
1.33 +
1.34 +template <class T, MEMFLAGS F> class ChunkedList : public CHeapObj<F> {
1.35 + template <class U> friend class TestChunkedList;
1.36 +
1.37 + static const size_t BufferSize = 64;
1.38 +
1.39 + T _values[BufferSize];
1.40 + T* _top;
1.41 +
1.42 + ChunkedList<T, F>* _next_used;
1.43 + ChunkedList<T, F>* _next_free;
1.44 +
1.45 + T const * end() const {
1.46 + return &_values[BufferSize];
1.47 + }
1.48 +
1.49 + public:
1.50 + ChunkedList<T, F>() : _top(_values), _next_used(NULL), _next_free(NULL) {}
1.51 +
1.52 + bool is_full() const {
1.53 + return _top == end();
1.54 + }
1.55 +
1.56 + void clear() {
1.57 + _top = _values;
1.58 + // Don't clear the next pointers since that would interfere
1.59 + // with other threads trying to iterate through the lists.
1.60 + }
1.61 +
1.62 + void push(T m) {
1.63 + assert(!is_full(), "Buffer is full");
1.64 + *_top = m;
1.65 + _top++;
1.66 + }
1.67 +
1.68 + void set_next_used(ChunkedList<T, F>* buffer) { _next_used = buffer; }
1.69 + void set_next_free(ChunkedList<T, F>* buffer) { _next_free = buffer; }
1.70 +
1.71 + ChunkedList<T, F>* next_used() const { return _next_used; }
1.72 + ChunkedList<T, F>* next_free() const { return _next_free; }
1.73 +
1.74 + size_t size() const {
1.75 + return pointer_delta(_top, _values, sizeof(T));
1.76 + }
1.77 +
1.78 + T at(size_t i) {
1.79 + assert(i < size(), err_msg("IOOBE i: " SIZE_FORMAT " size(): " SIZE_FORMAT, i, size()));
1.80 + return _values[i];
1.81 + }
1.82 +};
1.83 +
1.84 +#endif // SHARE_VM_UTILITIES_CHUNKED_LIST_HPP
