duke@435: /*
mikael@4153:  * Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
trims@1907:  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907:  * or visit www.oracle.com if you need additional information or have any
trims@1907:  * questions.
duke@435:  *
duke@435:  */
duke@435: 
stefank@2314: #include "precompiled.hpp"
stefank@2314: #include "memory/resourceArea.hpp"
stefank@4299: #include "runtime/thread.inline.hpp"
stefank@2314: #include "utilities/array.hpp"
duke@435: 
duke@435: 
duke@435: #ifdef ASSERT
duke@435: void ResourceArray::init_nesting() {
duke@435:   _nesting = Thread::current()->resource_area()->nesting();
duke@435: }
duke@435: #endif
duke@435: 
duke@435: 
duke@435: void ResourceArray::sort(size_t esize, ftype f) {
duke@435:   if (!is_empty()) qsort(_data, length(), esize, f);
duke@435: }
zgu@3900: template <MEMFLAGS F> void CHeapArray<F>::sort(size_t esize, ftype f) {
duke@435:   if (!is_empty()) qsort(_data, length(), esize, f);
duke@435: }
duke@435: 
duke@435: 
duke@435: void ResourceArray::expand(size_t esize, int i, int& size) {
duke@435:   // make sure we are expanding within the original resource mark
duke@435:   assert(
duke@435:     _nesting == Thread::current()->resource_area()->nesting(),
duke@435:     "allocating outside original resource mark"
duke@435:   );
duke@435:   // determine new size
duke@435:   if (size == 0) size = 4; // prevent endless loop
duke@435:   while (i >= size) size *= 2;
duke@435:   // allocate and initialize new data section
duke@435:   void* data = resource_allocate_bytes(esize * size);
duke@435:   memcpy(data, _data, esize * length());
duke@435:   _data = data;
duke@435: }
duke@435: 
duke@435: 
zgu@3900: template <MEMFLAGS F> void CHeapArray<F>::expand(size_t esize, int i, int& size) {
duke@435:   // determine new size
duke@435:   if (size == 0) size = 4; // prevent endless loop
duke@435:   while (i >= size) size *= 2;
duke@435:   // allocate and initialize new data section
zgu@3900:   void* data = NEW_C_HEAP_ARRAY(char*, esize * size, F);
duke@435:   memcpy(data, _data, esize * length());
zgu@3900:   FREE_C_HEAP_ARRAY(char*, _data, F);
duke@435:   _data = data;
duke@435: }
duke@435: 
duke@435: 
duke@435: void ResourceArray::remove_at(size_t esize, int i) {
duke@435:   assert(0 <= i && i < length(), "index out of bounds");
duke@435:   _length--;
duke@435:   void* dst = (char*)_data + i*esize;
duke@435:   void* src = (char*)dst + esize;
duke@435:   size_t cnt = (length() - i)*esize;
duke@435:   memmove(dst, src, cnt);
duke@435: }
duke@435: 
zgu@3900: template <MEMFLAGS F> void CHeapArray<F>::remove_at(size_t esize, int i) {
duke@435:   assert(0 <= i && i < length(), "index out of bounds");
duke@435:   _length--;
duke@435:   void* dst = (char*)_data + i*esize;
duke@435:   void* src = (char*)dst + esize;
duke@435:   size_t cnt = (length() - i)*esize;
duke@435:   memmove(dst, src, cnt);
duke@435: }