Mercurial > jdk8-mips64-public > hotspot / file comparison
comparison: src/share/vm/utilities/array.cpp
src/share/vm/utilities/array.cpp
- changeset 0
- f90c822e73f8
- child 6876
- 710a3c8b516e
equal
deleted
inserted
replaced
| -1:000000000000 | 0:f90c822e73f8 |
|---|---|
| 1 /* | |
| 2 * Copyright (c) 2000, 2012, Oracle and/or its affiliates. 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 #include "precompiled.hpp" | |
| 26 #include "memory/resourceArea.hpp" | |
| 27 #include "runtime/thread.inline.hpp" | |
| 28 #include "utilities/array.hpp" | |
| 29 | |
| 30 | |
| 31 #ifdef ASSERT | |
| 32 void ResourceArray::init_nesting() { | |
| 33 _nesting = Thread::current()->resource_area()->nesting(); | |
| 34 } | |
| 35 #endif | |
| 36 | |
| 37 | |
| 38 void ResourceArray::sort(size_t esize, ftype f) { | |
| 39 if (!is_empty()) qsort(_data, length(), esize, f); | |
| 40 } | |
| 41 template <MEMFLAGS F> void CHeapArray<F>::sort(size_t esize, ftype f) { | |
| 42 if (!is_empty()) qsort(_data, length(), esize, f); | |
| 43 } | |
| 44 | |
| 45 | |
| 46 void ResourceArray::expand(size_t esize, int i, int& size) { | |
| 47 // make sure we are expanding within the original resource mark | |
| 48 assert( | |
| 49 _nesting == Thread::current()->resource_area()->nesting(), | |
| 50 "allocating outside original resource mark" | |
| 51 ); | |
| 52 // determine new size | |
| 53 if (size == 0) size = 4; // prevent endless loop | |
| 54 while (i >= size) size *= 2; | |
| 55 // allocate and initialize new data section | |
| 56 void* data = resource_allocate_bytes(esize * size); | |
| 57 memcpy(data, _data, esize * length()); | |
| 58 _data = data; | |
| 59 } | |
| 60 | |
| 61 | |
| 62 template <MEMFLAGS F> void CHeapArray<F>::expand(size_t esize, int i, int& size) { | |
| 63 // determine new size | |
| 64 if (size == 0) size = 4; // prevent endless loop | |
| 65 while (i >= size) size *= 2; | |
| 66 // allocate and initialize new data section | |
| 67 void* data = NEW_C_HEAP_ARRAY(char*, esize * size, F); | |
| 68 memcpy(data, _data, esize * length()); | |
| 69 FREE_C_HEAP_ARRAY(char*, _data, F); | |
| 70 _data = data; | |
| 71 } | |
| 72 | |
| 73 | |
| 74 void ResourceArray::remove_at(size_t esize, int i) { | |
| 75 assert(0 <= i && i < length(), "index out of bounds"); | |
| 76 _length--; | |
| 77 void* dst = (char*)_data + i*esize; | |
| 78 void* src = (char*)dst + esize; | |
| 79 size_t cnt = (length() - i)*esize; | |
| 80 memmove(dst, src, cnt); | |
| 81 } | |
| 82 | |
| 83 template <MEMFLAGS F> void CHeapArray<F>::remove_at(size_t esize, int i) { | |
| 84 assert(0 <= i && i < length(), "index out of bounds"); | |
| 85 _length--; | |
| 86 void* dst = (char*)_data + i*esize; | |
| 87 void* src = (char*)dst + esize; | |
| 88 size_t cnt = (length() - i)*esize; | |
| 89 memmove(dst, src, cnt); | |
| 90 } |
