annotate src/share/vm/utilities/array.cpp @ 1721:413ad0331a0c

6977924: Changes for 6975078 produce build error with certain gcc versions Summary: The changes introduced for 6975078 assign badHeapOopVal to the _allocation field in the ResourceObj class. In 32 bit linux builds with certain versions of gcc this assignment will be flagged as an error while compiling allocation.cpp. In 32 bit builds the constant value badHeapOopVal (which is cast to an intptr_t) is negative. The _allocation field is typed as an unsigned intptr_t and gcc catches this as an error. Reviewed-by: jcoomes, ysr, phh
author johnc
date Wed, 18 Aug 2010 10:59:06 -0700
parents c18cbe5936b8
children f95d63e2154a
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1 /*
1552
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 0
diff changeset
2 * Copyright (c) 2000, 2004, Oracle and/or its affiliates. All rights reserved.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load
duke
parents:
diff changeset
4 *
a61af66fc99e Initial load
duke
parents:
diff changeset
5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load
duke
parents:
diff changeset
6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load
duke
parents:
diff changeset
7 * published by the Free Software Foundation.
a61af66fc99e Initial load
duke
parents:
diff changeset
8 *
a61af66fc99e Initial load
duke
parents:
diff changeset
9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load
duke
parents:
diff changeset
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load
duke
parents:
diff changeset
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load
duke
parents:
diff changeset
12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load
duke
parents:
diff changeset
13 * accompanied this code).
a61af66fc99e Initial load
duke
parents:
diff changeset
14 *
a61af66fc99e Initial load
duke
parents:
diff changeset
15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load
duke
parents:
diff changeset
16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load
duke
parents:
diff changeset
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load
duke
parents:
diff changeset
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
a61af66fc99e Initial load
duke
parents:
diff changeset
22 *
a61af66fc99e Initial load
duke
parents:
diff changeset
23 */
a61af66fc99e Initial load
duke
parents:
diff changeset
24
a61af66fc99e Initial load
duke
parents:
diff changeset
25 # include "incls/_precompiled.incl"
a61af66fc99e Initial load
duke
parents:
diff changeset
26 # include "incls/_array.cpp.incl"
a61af66fc99e Initial load
duke
parents:
diff changeset
27
a61af66fc99e Initial load
duke
parents:
diff changeset
28
a61af66fc99e Initial load
duke
parents:
diff changeset
29 #ifdef ASSERT
a61af66fc99e Initial load
duke
parents:
diff changeset
30 void ResourceArray::init_nesting() {
a61af66fc99e Initial load
duke
parents:
diff changeset
31 _nesting = Thread::current()->resource_area()->nesting();
a61af66fc99e Initial load
duke
parents:
diff changeset
32 }
a61af66fc99e Initial load
duke
parents:
diff changeset
33 #endif
a61af66fc99e Initial load
duke
parents:
diff changeset
34
a61af66fc99e Initial load
duke
parents:
diff changeset
35
a61af66fc99e Initial load
duke
parents:
diff changeset
36 void ResourceArray::sort(size_t esize, ftype f) {
a61af66fc99e Initial load
duke
parents:
diff changeset
37 if (!is_empty()) qsort(_data, length(), esize, f);
a61af66fc99e Initial load
duke
parents:
diff changeset
38 }
a61af66fc99e Initial load
duke
parents:
diff changeset
39 void CHeapArray::sort(size_t esize, ftype f) {
a61af66fc99e Initial load
duke
parents:
diff changeset
40 if (!is_empty()) qsort(_data, length(), esize, f);
a61af66fc99e Initial load
duke
parents:
diff changeset
41 }
a61af66fc99e Initial load
duke
parents:
diff changeset
42
a61af66fc99e Initial load
duke
parents:
diff changeset
43
a61af66fc99e Initial load
duke
parents:
diff changeset
44 void ResourceArray::expand(size_t esize, int i, int& size) {
a61af66fc99e Initial load
duke
parents:
diff changeset
45 // make sure we are expanding within the original resource mark
a61af66fc99e Initial load
duke
parents:
diff changeset
46 assert(
a61af66fc99e Initial load
duke
parents:
diff changeset
47 _nesting == Thread::current()->resource_area()->nesting(),
a61af66fc99e Initial load
duke
parents:
diff changeset
48 "allocating outside original resource mark"
a61af66fc99e Initial load
duke
parents:
diff changeset
49 );
a61af66fc99e Initial load
duke
parents:
diff changeset
50 // determine new size
a61af66fc99e Initial load
duke
parents:
diff changeset
51 if (size == 0) size = 4; // prevent endless loop
a61af66fc99e Initial load
duke
parents:
diff changeset
52 while (i >= size) size *= 2;
a61af66fc99e Initial load
duke
parents:
diff changeset
53 // allocate and initialize new data section
a61af66fc99e Initial load
duke
parents:
diff changeset
54 void* data = resource_allocate_bytes(esize * size);
a61af66fc99e Initial load
duke
parents:
diff changeset
55 memcpy(data, _data, esize * length());
a61af66fc99e Initial load
duke
parents:
diff changeset
56 _data = data;
a61af66fc99e Initial load
duke
parents:
diff changeset
57 }
a61af66fc99e Initial load
duke
parents:
diff changeset
58
a61af66fc99e Initial load
duke
parents:
diff changeset
59
a61af66fc99e Initial load
duke
parents:
diff changeset
60 void CHeapArray::expand(size_t esize, int i, int& size) {
a61af66fc99e Initial load
duke
parents:
diff changeset
61 // determine new size
a61af66fc99e Initial load
duke
parents:
diff changeset
62 if (size == 0) size = 4; // prevent endless loop
a61af66fc99e Initial load
duke
parents:
diff changeset
63 while (i >= size) size *= 2;
a61af66fc99e Initial load
duke
parents:
diff changeset
64 // allocate and initialize new data section
a61af66fc99e Initial load
duke
parents:
diff changeset
65 void* data = NEW_C_HEAP_ARRAY(char*, esize * size);
a61af66fc99e Initial load
duke
parents:
diff changeset
66 memcpy(data, _data, esize * length());
a61af66fc99e Initial load
duke
parents:
diff changeset
67 FREE_C_HEAP_ARRAY(char*, _data);
a61af66fc99e Initial load
duke
parents:
diff changeset
68 _data = data;
a61af66fc99e Initial load
duke
parents:
diff changeset
69 }
a61af66fc99e Initial load
duke
parents:
diff changeset
70
a61af66fc99e Initial load
duke
parents:
diff changeset
71
a61af66fc99e Initial load
duke
parents:
diff changeset
72 void ResourceArray::remove_at(size_t esize, int i) {
a61af66fc99e Initial load
duke
parents:
diff changeset
73 assert(0 <= i && i < length(), "index out of bounds");
a61af66fc99e Initial load
duke
parents:
diff changeset
74 _length--;
a61af66fc99e Initial load
duke
parents:
diff changeset
75 void* dst = (char*)_data + i*esize;
a61af66fc99e Initial load
duke
parents:
diff changeset
76 void* src = (char*)dst + esize;
a61af66fc99e Initial load
duke
parents:
diff changeset
77 size_t cnt = (length() - i)*esize;
a61af66fc99e Initial load
duke
parents:
diff changeset
78 memmove(dst, src, cnt);
a61af66fc99e Initial load
duke
parents:
diff changeset
79 }
a61af66fc99e Initial load
duke
parents:
diff changeset
80
a61af66fc99e Initial load
duke
parents:
diff changeset
81 void CHeapArray::remove_at(size_t esize, int i) {
a61af66fc99e Initial load
duke
parents:
diff changeset
82 assert(0 <= i && i < length(), "index out of bounds");
a61af66fc99e Initial load
duke
parents:
diff changeset
83 _length--;
a61af66fc99e Initial load
duke
parents:
diff changeset
84 void* dst = (char*)_data + i*esize;
a61af66fc99e Initial load
duke
parents:
diff changeset
85 void* src = (char*)dst + esize;
a61af66fc99e Initial load
duke
parents:
diff changeset
86 size_t cnt = (length() - i)*esize;
a61af66fc99e Initial load
duke
parents:
diff changeset
87 memmove(dst, src, cnt);
a61af66fc99e Initial load
duke
parents:
diff changeset
88 }