Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/ci/ciArrayKlass.cpp@01522ca68fc7 (annotated)
src/share/vm/ci/ciArrayKlass.cpp
Tue, 18 Jun 2013 12:31:07 -0700
- author
- johnc
- date
- Tue, 18 Jun 2013 12:31:07 -0700
- changeset 5277
- 01522ca68fc7
- parent 4142
- d8ce2825b193
- child 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
8015237: Parallelize string table scanning during strong root processing
Summary: Parallelize the scanning of the intern string table by having each GC worker claim a given number of buckets. Changes were also reviewed by Per Liden <per.liden@oracle.com>.
Reviewed-by: tschatzl, stefank, twisti
| duke@435 | 1 | /* |
| coleenp@4037 | 2 | * Copyright (c) 1999, 2012, Oracle and/or its affiliates. All rights reserved. |
| duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| duke@435 | 4 | * |
| duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
| duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| duke@435 | 7 | * published by the Free Software Foundation. |
| duke@435 | 8 | * |
| duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| duke@435 | 13 | * accompanied this code). |
| duke@435 | 14 | * |
| duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
| duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| duke@435 | 18 | * |
| trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
| trims@1907 | 21 | * questions. |
| duke@435 | 22 | * |
| duke@435 | 23 | */ |
| duke@435 | 24 | |
| stefank@2314 | 25 | #include "precompiled.hpp" |
| stefank@2314 | 26 | #include "ci/ciArrayKlass.hpp" |
| stefank@2314 | 27 | #include "ci/ciObjArrayKlass.hpp" |
| stefank@2314 | 28 | #include "ci/ciTypeArrayKlass.hpp" |
| stefank@2314 | 29 | #include "ci/ciUtilities.hpp" |
| duke@435 | 30 | |
| duke@435 | 31 | // ciArrayKlass |
| duke@435 | 32 | // |
| coleenp@4037 | 33 | // This class represents a Klass* in the HotSpot virtual machine |
| coleenp@4142 | 34 | // whose Klass part in an ArrayKlass. |
| duke@435 | 35 | |
| duke@435 | 36 | // ------------------------------------------------------------------ |
| duke@435 | 37 | // ciArrayKlass::ciArrayKlass |
| duke@435 | 38 | // |
| duke@435 | 39 | // Loaded array klass. |
| duke@435 | 40 | ciArrayKlass::ciArrayKlass(KlassHandle h_k) : ciKlass(h_k) { |
| duke@435 | 41 | assert(get_Klass()->oop_is_array(), "wrong type"); |
| coleenp@4142 | 42 | _dimension = get_ArrayKlass()->dimension(); |
| duke@435 | 43 | } |
| duke@435 | 44 | |
| duke@435 | 45 | // ------------------------------------------------------------------ |
| duke@435 | 46 | // ciArrayKlass::ciArrayKlass |
| duke@435 | 47 | // |
| duke@435 | 48 | // Unloaded array klass. |
| coleenp@4037 | 49 | ciArrayKlass::ciArrayKlass(ciSymbol* name, int dimension, BasicType bt) |
| coleenp@4037 | 50 | : ciKlass(name, bt) { |
| duke@435 | 51 | _dimension = dimension; |
| duke@435 | 52 | } |
| duke@435 | 53 | |
| duke@435 | 54 | // ------------------------------------------------------------------ |
| duke@435 | 55 | // ciArrayKlass::element_type |
| duke@435 | 56 | // |
| duke@435 | 57 | // What type is obtained when this array is indexed once? |
| duke@435 | 58 | ciType* ciArrayKlass::element_type() { |
| duke@435 | 59 | if (is_type_array_klass()) { |
| duke@435 | 60 | return ciType::make(as_type_array_klass()->element_type()); |
| duke@435 | 61 | } else { |
| duke@435 | 62 | return as_obj_array_klass()->element_klass()->as_klass(); |
| duke@435 | 63 | } |
| duke@435 | 64 | } |
| duke@435 | 65 | |
| duke@435 | 66 | |
| duke@435 | 67 | // ------------------------------------------------------------------ |
| duke@435 | 68 | // ciArrayKlass::base_element_type |
| duke@435 | 69 | // |
| duke@435 | 70 | // What type is obtained when this array is indexed as many times as possible? |
| duke@435 | 71 | ciType* ciArrayKlass::base_element_type() { |
| duke@435 | 72 | if (is_type_array_klass()) { |
| duke@435 | 73 | return ciType::make(as_type_array_klass()->element_type()); |
| duke@435 | 74 | } else { |
| duke@435 | 75 | ciKlass* ek = as_obj_array_klass()->base_element_klass(); |
| duke@435 | 76 | if (ek->is_type_array_klass()) { |
| duke@435 | 77 | return ciType::make(ek->as_type_array_klass()->element_type()); |
| duke@435 | 78 | } |
| duke@435 | 79 | return ek; |
| duke@435 | 80 | } |
| duke@435 | 81 | } |
| duke@435 | 82 | |
| duke@435 | 83 | |
| duke@435 | 84 | // ------------------------------------------------------------------ |
| duke@435 | 85 | // ciArrayKlass::is_leaf_type |
| duke@435 | 86 | bool ciArrayKlass::is_leaf_type() { |
| duke@435 | 87 | if (is_type_array_klass()) { |
| duke@435 | 88 | return true; |
| duke@435 | 89 | } else { |
| duke@435 | 90 | return as_obj_array_klass()->base_element_klass()->is_leaf_type(); |
| duke@435 | 91 | } |
| duke@435 | 92 | } |
| duke@435 | 93 | |
| duke@435 | 94 | |
| duke@435 | 95 | // ------------------------------------------------------------------ |
| duke@435 | 96 | // ciArrayKlass::base_element_type |
| duke@435 | 97 | // |
| duke@435 | 98 | // What type is obtained when this array is indexed as many times as possible? |
| duke@435 | 99 | ciArrayKlass* ciArrayKlass::make(ciType* element_type) { |
| duke@435 | 100 | if (element_type->is_primitive_type()) { |
| duke@435 | 101 | return ciTypeArrayKlass::make(element_type->basic_type()); |
| duke@435 | 102 | } else { |
| duke@435 | 103 | return ciObjArrayKlass::make(element_type->as_klass()); |
| duke@435 | 104 | } |
| duke@435 | 105 | } |
