Mercurial > hg > truffle

comparison src/share/vm/memory/padded.inline.hpp @ 12029:9766f73e770d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
8022880: False sharing between PSPromotionManager instances Summary: Pad the PSPromotionManager instances in the manager array. Reviewed-by: brutisso, jmasa
author stefank
date Fri, 31 May 2013 14:32:44 +0200
parents
children d7070f371770
comparison
equal deleted inserted replaced
12009:39127bb12d32 12029:9766f73e770d
1 /*
2 * Copyright (c) 2013, 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 "memory/allocation.inline.hpp"
26 #include "memory/padded.hpp"
27 #include "utilities/debug.hpp"
28 #include "utilities/globalDefinitions.hpp"
29
30 // Creates an aligned padded array.
31 // The memory can't be deleted since the raw memory chunk is not returned.
32 template <class T, MEMFLAGS flags, size_t alignment>
33 PaddedEnd<T>* PaddedArray<T, flags, alignment>::create_unfreeable(uint length) {
34 // Check that the PaddedEnd class works as intended.
35 STATIC_ASSERT(is_size_aligned_(sizeof(PaddedEnd<T>), alignment));
36
37 // Allocate a chunk of memory large enough to allow for some alignment.
38 void* chunk = AllocateHeap(length * sizeof(PaddedEnd<T, alignment>) + alignment, flags);
39
40 // Make the initial alignment.
41 PaddedEnd<T>* aligned_padded_array = (PaddedEnd<T>*)align_pointer_up(chunk, alignment);
42
43 // Call the default constructor for each element.
44 for (uint i = 0; i < length; i++) {
45 ::new (&aligned_padded_array[i]) T();
46 }
47
48 return aligned_padded_array;
49 }