Fri, 29 Apr 2016 00:06:10 +0800
Added MIPS 64-bit port.
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. |
aoqi@0 | 8 | * |
aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 13 | * accompanied this code). |
aoqi@0 | 14 | * |
aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 18 | * |
aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 21 | * questions. |
aoqi@0 | 22 | * |
aoqi@0 | 23 | */ |
aoqi@0 | 24 | |
aoqi@0 | 25 | #include "precompiled.hpp" |
aoqi@0 | 26 | #include "memory/resourceArea.hpp" |
aoqi@0 | 27 | #include "runtime/thread.inline.hpp" |
aoqi@0 | 28 | #include "utilities/array.hpp" |
aoqi@0 | 29 | |
aoqi@0 | 30 | |
aoqi@0 | 31 | #ifdef ASSERT |
aoqi@0 | 32 | void ResourceArray::init_nesting() { |
aoqi@0 | 33 | _nesting = Thread::current()->resource_area()->nesting(); |
aoqi@0 | 34 | } |
aoqi@0 | 35 | #endif |
aoqi@0 | 36 | |
aoqi@0 | 37 | |
aoqi@0 | 38 | void ResourceArray::sort(size_t esize, ftype f) { |
aoqi@0 | 39 | if (!is_empty()) qsort(_data, length(), esize, f); |
aoqi@0 | 40 | } |
aoqi@0 | 41 | template <MEMFLAGS F> void CHeapArray<F>::sort(size_t esize, ftype f) { |
aoqi@0 | 42 | if (!is_empty()) qsort(_data, length(), esize, f); |
aoqi@0 | 43 | } |
aoqi@0 | 44 | |
aoqi@0 | 45 | |
aoqi@0 | 46 | void ResourceArray::expand(size_t esize, int i, int& size) { |
aoqi@0 | 47 | // make sure we are expanding within the original resource mark |
aoqi@0 | 48 | assert( |
aoqi@0 | 49 | _nesting == Thread::current()->resource_area()->nesting(), |
aoqi@0 | 50 | "allocating outside original resource mark" |
aoqi@0 | 51 | ); |
aoqi@0 | 52 | // determine new size |
aoqi@0 | 53 | if (size == 0) size = 4; // prevent endless loop |
aoqi@0 | 54 | while (i >= size) size *= 2; |
aoqi@0 | 55 | // allocate and initialize new data section |
aoqi@0 | 56 | void* data = resource_allocate_bytes(esize * size); |
aoqi@0 | 57 | memcpy(data, _data, esize * length()); |
aoqi@0 | 58 | _data = data; |
aoqi@0 | 59 | } |
aoqi@0 | 60 | |
aoqi@0 | 61 | |
aoqi@0 | 62 | template <MEMFLAGS F> void CHeapArray<F>::expand(size_t esize, int i, int& size) { |
aoqi@0 | 63 | // determine new size |
aoqi@0 | 64 | if (size == 0) size = 4; // prevent endless loop |
aoqi@0 | 65 | while (i >= size) size *= 2; |
aoqi@0 | 66 | // allocate and initialize new data section |
aoqi@0 | 67 | void* data = NEW_C_HEAP_ARRAY(char*, esize * size, F); |
aoqi@0 | 68 | memcpy(data, _data, esize * length()); |
aoqi@0 | 69 | FREE_C_HEAP_ARRAY(char*, _data, F); |
aoqi@0 | 70 | _data = data; |
aoqi@0 | 71 | } |
aoqi@0 | 72 | |
aoqi@0 | 73 | |
aoqi@0 | 74 | void ResourceArray::remove_at(size_t esize, int i) { |
aoqi@0 | 75 | assert(0 <= i && i < length(), "index out of bounds"); |
aoqi@0 | 76 | _length--; |
aoqi@0 | 77 | void* dst = (char*)_data + i*esize; |
aoqi@0 | 78 | void* src = (char*)dst + esize; |
aoqi@0 | 79 | size_t cnt = (length() - i)*esize; |
aoqi@0 | 80 | memmove(dst, src, cnt); |
aoqi@0 | 81 | } |
aoqi@0 | 82 | |
aoqi@0 | 83 | template <MEMFLAGS F> void CHeapArray<F>::remove_at(size_t esize, int i) { |
aoqi@0 | 84 | assert(0 <= i && i < length(), "index out of bounds"); |
aoqi@0 | 85 | _length--; |
aoqi@0 | 86 | void* dst = (char*)_data + i*esize; |
aoqi@0 | 87 | void* src = (char*)dst + esize; |
aoqi@0 | 88 | size_t cnt = (length() - i)*esize; |
aoqi@0 | 89 | memmove(dst, src, cnt); |
aoqi@0 | 90 | } |