1 /*
   2  * Copyright (c) 2000, 2010, 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 "utilities/array.hpp"
  28 #ifdef TARGET_OS_FAMILY_linux
  29 # include "thread_linux.inline.hpp"
  30 #endif
  31 #ifdef TARGET_OS_FAMILY_solaris
  32 # include "thread_solaris.inline.hpp"
  33 #endif
  34 #ifdef TARGET_OS_FAMILY_windows
  35 # include "thread_windows.inline.hpp"
  36 #endif
  37 
  38 
  39 #ifdef ASSERT
  40 void ResourceArray::init_nesting() {
  41   _nesting = Thread::current()->resource_area()->nesting();
  42 }
  43 #endif
  44 
  45 
  46 void ResourceArray::sort(size_t esize, ftype f) {
  47   if (!is_empty()) qsort(_data, length(), esize, f);
  48 }
  49 void CHeapArray::sort(size_t esize, ftype f) {
  50   if (!is_empty()) qsort(_data, length(), esize, f);
  51 }
  52 
  53 
  54 void ResourceArray::expand(size_t esize, int i, int& size) {
  55   // make sure we are expanding within the original resource mark
  56   assert(
  57     _nesting == Thread::current()->resource_area()->nesting(),
  58     "allocating outside original resource mark"
  59   );
  60   // determine new size
  61   if (size == 0) size = 4; // prevent endless loop
  62   while (i >= size) size *= 2;
  63   // allocate and initialize new data section
  64   void* data = resource_allocate_bytes(esize * size);
  65   memcpy(data, _data, esize * length());
  66   _data = data;
  67 }
  68 
  69 
  70 void CHeapArray::expand(size_t esize, int i, int& size) {
  71   // determine new size
  72   if (size == 0) size = 4; // prevent endless loop
  73   while (i >= size) size *= 2;
  74   // allocate and initialize new data section
  75   void* data = NEW_C_HEAP_ARRAY(char*, esize * size);
  76   memcpy(data, _data, esize * length());
  77   FREE_C_HEAP_ARRAY(char*, _data);
  78   _data = data;
  79 }
  80 
  81 
  82 void ResourceArray::remove_at(size_t esize, int i) {
  83   assert(0 <= i && i < length(), "index out of bounds");
  84   _length--;
  85   void* dst = (char*)_data + i*esize;
  86   void* src = (char*)dst + esize;
  87   size_t cnt = (length() - i)*esize;
  88   memmove(dst, src, cnt);
  89 }
  90 
  91 void CHeapArray::remove_at(size_t esize, int i) {
  92   assert(0 <= i && i < length(), "index out of bounds");
  93   _length--;
  94   void* dst = (char*)_data + i*esize;
  95   void* src = (char*)dst + esize;
  96   size_t cnt = (length() - i)*esize;
  97   memmove(dst, src, cnt);
  98 }