Tue, 18 Jun 2013 12:31:07 -0700
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 | /* |
stefank@2314 | 2 | * Copyright (c) 2001, 2010, 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 | #ifndef SHARE_VM_C1_C1_VALUESET_HPP |
stefank@2314 | 26 | #define SHARE_VM_C1_C1_VALUESET_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "c1/c1_Instruction.hpp" |
stefank@2314 | 29 | #include "memory/allocation.hpp" |
stefank@2314 | 30 | #include "utilities/bitMap.inline.hpp" |
stefank@2314 | 31 | |
duke@435 | 32 | // A ValueSet is a simple abstraction on top of a BitMap representing |
duke@435 | 33 | // a set of Instructions. Currently it assumes that the number of |
duke@435 | 34 | // instructions is fixed during its lifetime; should make it |
duke@435 | 35 | // automatically resizable. |
duke@435 | 36 | |
duke@435 | 37 | class ValueSet: public CompilationResourceObj { |
duke@435 | 38 | private: |
duke@435 | 39 | BitMap _map; |
duke@435 | 40 | |
duke@435 | 41 | public: |
duke@435 | 42 | ValueSet(); |
duke@435 | 43 | |
duke@435 | 44 | ValueSet* copy(); |
duke@435 | 45 | bool contains(Value x); |
duke@435 | 46 | void put (Value x); |
duke@435 | 47 | void remove (Value x); |
duke@435 | 48 | bool set_intersect(ValueSet* other); |
duke@435 | 49 | void set_union(ValueSet* other); |
duke@435 | 50 | void clear (); |
duke@435 | 51 | void set_from(ValueSet* other); |
duke@435 | 52 | bool equals (ValueSet* other); |
duke@435 | 53 | }; |
duke@435 | 54 | |
duke@435 | 55 | inline ValueSet::ValueSet() : _map(Instruction::number_of_instructions()) { |
duke@435 | 56 | _map.clear(); |
duke@435 | 57 | } |
duke@435 | 58 | |
duke@435 | 59 | |
duke@435 | 60 | inline ValueSet* ValueSet::copy() { |
duke@435 | 61 | ValueSet* res = new ValueSet(); |
duke@435 | 62 | res->_map.set_from(_map); |
duke@435 | 63 | return res; |
duke@435 | 64 | } |
duke@435 | 65 | |
duke@435 | 66 | |
duke@435 | 67 | inline bool ValueSet::contains(Value x) { |
duke@435 | 68 | return _map.at(x->id()); |
duke@435 | 69 | } |
duke@435 | 70 | |
duke@435 | 71 | |
duke@435 | 72 | inline void ValueSet::put(Value x) { |
duke@435 | 73 | _map.set_bit(x->id()); |
duke@435 | 74 | } |
duke@435 | 75 | |
duke@435 | 76 | |
duke@435 | 77 | inline void ValueSet::remove(Value x) { |
duke@435 | 78 | _map.clear_bit(x->id()); |
duke@435 | 79 | } |
duke@435 | 80 | |
duke@435 | 81 | |
duke@435 | 82 | inline bool ValueSet::set_intersect(ValueSet* other) { |
duke@435 | 83 | return _map.set_intersection_with_result(other->_map); |
duke@435 | 84 | } |
duke@435 | 85 | |
duke@435 | 86 | |
duke@435 | 87 | inline void ValueSet::set_union(ValueSet* other) { |
duke@435 | 88 | _map.set_union(other->_map); |
duke@435 | 89 | } |
duke@435 | 90 | |
duke@435 | 91 | |
duke@435 | 92 | inline void ValueSet::clear() { |
duke@435 | 93 | _map.clear(); |
duke@435 | 94 | } |
duke@435 | 95 | |
duke@435 | 96 | inline void ValueSet::set_from(ValueSet* other) { |
duke@435 | 97 | _map.set_from(other->_map); |
duke@435 | 98 | } |
duke@435 | 99 | |
duke@435 | 100 | inline bool ValueSet::equals(ValueSet* other) { |
duke@435 | 101 | return _map.is_same(other->_map); |
duke@435 | 102 | } |
stefank@2314 | 103 | |
stefank@2314 | 104 | #endif // SHARE_VM_C1_C1_VALUESET_HPP |