0
|
1 /*
|
|
2 * Copyright 2000-2004 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or
|
|
21 * have any questions.
|
|
22 *
|
|
23 */
|
|
24
|
|
25 # include "incls/_precompiled.incl"
|
|
26 # include "incls/_array.cpp.incl"
|
|
27
|
|
28
|
|
29 #ifdef ASSERT
|
|
30 void ResourceArray::init_nesting() {
|
|
31 _nesting = Thread::current()->resource_area()->nesting();
|
|
32 }
|
|
33 #endif
|
|
34
|
|
35
|
|
36 void ResourceArray::sort(size_t esize, ftype f) {
|
|
37 if (!is_empty()) qsort(_data, length(), esize, f);
|
|
38 }
|
|
39 void CHeapArray::sort(size_t esize, ftype f) {
|
|
40 if (!is_empty()) qsort(_data, length(), esize, f);
|
|
41 }
|
|
42
|
|
43
|
|
44 void ResourceArray::expand(size_t esize, int i, int& size) {
|
|
45 // make sure we are expanding within the original resource mark
|
|
46 assert(
|
|
47 _nesting == Thread::current()->resource_area()->nesting(),
|
|
48 "allocating outside original resource mark"
|
|
49 );
|
|
50 // determine new size
|
|
51 if (size == 0) size = 4; // prevent endless loop
|
|
52 while (i >= size) size *= 2;
|
|
53 // allocate and initialize new data section
|
|
54 void* data = resource_allocate_bytes(esize * size);
|
|
55 memcpy(data, _data, esize * length());
|
|
56 _data = data;
|
|
57 }
|
|
58
|
|
59
|
|
60 void CHeapArray::expand(size_t esize, int i, int& size) {
|
|
61 // determine new size
|
|
62 if (size == 0) size = 4; // prevent endless loop
|
|
63 while (i >= size) size *= 2;
|
|
64 // allocate and initialize new data section
|
|
65 void* data = NEW_C_HEAP_ARRAY(char*, esize * size);
|
|
66 memcpy(data, _data, esize * length());
|
|
67 FREE_C_HEAP_ARRAY(char*, _data);
|
|
68 _data = data;
|
|
69 }
|
|
70
|
|
71
|
|
72 void ResourceArray::remove_at(size_t esize, int i) {
|
|
73 assert(0 <= i && i < length(), "index out of bounds");
|
|
74 _length--;
|
|
75 void* dst = (char*)_data + i*esize;
|
|
76 void* src = (char*)dst + esize;
|
|
77 size_t cnt = (length() - i)*esize;
|
|
78 memmove(dst, src, cnt);
|
|
79 }
|
|
80
|
|
81 void CHeapArray::remove_at(size_t esize, int i) {
|
|
82 assert(0 <= i && i < length(), "index out of bounds");
|
|
83 _length--;
|
|
84 void* dst = (char*)_data + i*esize;
|
|
85 void* src = (char*)dst + esize;
|
|
86 size_t cnt = (length() - i)*esize;
|
|
87 memmove(dst, src, cnt);
|
|
88 }
|