1.1 --- /dev/null Thu Jan 01 00:00:00 1970 +0000
1.2 +++ b/src/share/vm/utilities/array.cpp Sat Dec 01 00:00:00 2007 +0000
1.3 @@ -0,0 +1,88 @@
1.4 +/*
1.5 + * Copyright 2000-2004 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
1.23 + * CA 95054 USA or visit www.sun.com if you need additional information or
1.24 + * have any questions.
1.25 + *
1.26 + */
1.27 +
1.28 +# include "incls/_precompiled.incl"
1.29 +# include "incls/_array.cpp.incl"
1.30 +
1.31 +
1.32 +#ifdef ASSERT
1.33 +void ResourceArray::init_nesting() {
1.34 + _nesting = Thread::current()->resource_area()->nesting();
1.35 +}
1.36 +#endif
1.37 +
1.38 +
1.39 +void ResourceArray::sort(size_t esize, ftype f) {
1.40 + if (!is_empty()) qsort(_data, length(), esize, f);
1.41 +}
1.42 +void CHeapArray::sort(size_t esize, ftype f) {
1.43 + if (!is_empty()) qsort(_data, length(), esize, f);
1.44 +}
1.45 +
1.46 +
1.47 +void ResourceArray::expand(size_t esize, int i, int& size) {
1.48 + // make sure we are expanding within the original resource mark
1.49 + assert(
1.50 + _nesting == Thread::current()->resource_area()->nesting(),
1.51 + "allocating outside original resource mark"
1.52 + );
1.53 + // determine new size
1.54 + if (size == 0) size = 4; // prevent endless loop
1.55 + while (i >= size) size *= 2;
1.56 + // allocate and initialize new data section
1.57 + void* data = resource_allocate_bytes(esize * size);
1.58 + memcpy(data, _data, esize * length());
1.59 + _data = data;
1.60 +}
1.61 +
1.62 +
1.63 +void CHeapArray::expand(size_t esize, int i, int& size) {
1.64 + // determine new size
1.65 + if (size == 0) size = 4; // prevent endless loop
1.66 + while (i >= size) size *= 2;
1.67 + // allocate and initialize new data section
1.68 + void* data = NEW_C_HEAP_ARRAY(char*, esize * size);
1.69 + memcpy(data, _data, esize * length());
1.70 + FREE_C_HEAP_ARRAY(char*, _data);
1.71 + _data = data;
1.72 +}
1.73 +
1.74 +
1.75 +void ResourceArray::remove_at(size_t esize, int i) {
1.76 + assert(0 <= i && i < length(), "index out of bounds");
1.77 + _length--;
1.78 + void* dst = (char*)_data + i*esize;
1.79 + void* src = (char*)dst + esize;
1.80 + size_t cnt = (length() - i)*esize;
1.81 + memmove(dst, src, cnt);
1.82 +}
1.83 +
1.84 +void CHeapArray::remove_at(size_t esize, int i) {
1.85 + assert(0 <= i && i < length(), "index out of bounds");
1.86 + _length--;
1.87 + void* dst = (char*)_data + i*esize;
1.88 + void* src = (char*)dst + esize;
1.89 + size_t cnt = (length() - i)*esize;
1.90 + memmove(dst, src, cnt);
1.91 +}
