Mercurial > hg > graal-compiler
annotate src/share/vm/utilities/array.cpp @ 4316:b4b16e4e043f
Fix eager resolving for class constants
author | Peter Hofer <peter.hofer@jku.at> |
---|---|
date | Mon, 23 Jan 2012 14:35:29 +0100 |
parents | f08d439fab8c |
children | d2a62e0f25eb |
rev | line source |
---|---|
0 | 1 /* |
1972 | 2 * Copyright (c) 2000, 2010, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 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 | |
3960 | 37 #ifdef TARGET_OS_FAMILY_bsd |
38 # include "thread_bsd.inline.hpp" | |
39 #endif | |
0 | 40 |
41 | |
42 #ifdef ASSERT | |
43 void ResourceArray::init_nesting() { | |
44 _nesting = Thread::current()->resource_area()->nesting(); | |
45 } | |
46 #endif | |
47 | |
48 | |
49 void ResourceArray::sort(size_t esize, ftype f) { | |
50 if (!is_empty()) qsort(_data, length(), esize, f); | |
51 } | |
52 void CHeapArray::sort(size_t esize, ftype f) { | |
53 if (!is_empty()) qsort(_data, length(), esize, f); | |
54 } | |
55 | |
56 | |
57 void ResourceArray::expand(size_t esize, int i, int& size) { | |
58 // make sure we are expanding within the original resource mark | |
59 assert( | |
60 _nesting == Thread::current()->resource_area()->nesting(), | |
61 "allocating outside original resource mark" | |
62 ); | |
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 = resource_allocate_bytes(esize * size); | |
68 memcpy(data, _data, esize * length()); | |
69 _data = data; | |
70 } | |
71 | |
72 | |
73 void CHeapArray::expand(size_t esize, int i, int& size) { | |
74 // determine new size | |
75 if (size == 0) size = 4; // prevent endless loop | |
76 while (i >= size) size *= 2; | |
77 // allocate and initialize new data section | |
78 void* data = NEW_C_HEAP_ARRAY(char*, esize * size); | |
79 memcpy(data, _data, esize * length()); | |
80 FREE_C_HEAP_ARRAY(char*, _data); | |
81 _data = data; | |
82 } | |
83 | |
84 | |
85 void ResourceArray::remove_at(size_t esize, int i) { | |
86 assert(0 <= i && i < length(), "index out of bounds"); | |
87 _length--; | |
88 void* dst = (char*)_data + i*esize; | |
89 void* src = (char*)dst + esize; | |
90 size_t cnt = (length() - i)*esize; | |
91 memmove(dst, src, cnt); | |
92 } | |
93 | |
94 void CHeapArray::remove_at(size_t esize, int i) { | |
95 assert(0 <= i && i < length(), "index out of bounds"); | |
96 _length--; | |
97 void* dst = (char*)_data + i*esize; | |
98 void* src = (char*)dst + esize; | |
99 size_t cnt = (length() - i)*esize; | |
100 memmove(dst, src, cnt); | |
101 } |