1 /*
2 * Copyright (c) 2010, 2014, 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 "precompiled.hpp"
26 #include "memory/genOopClosures.hpp"
27 #include "gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.hpp"
28 #include "gc_implementation/concurrentMarkSweep/promotionInfo.hpp"
29 #include "oops/markOop.inline.hpp"
30 #include "oops/oop.inline.hpp"
31
32 /////////////////////////////////////////////////////////////////////////
33 //// PromotionInfo
34 /////////////////////////////////////////////////////////////////////////
35
36
37 //////////////////////////////////////////////////////////////////////////////
38 // We go over the list of promoted objects, removing each from the list,
39 // and applying the closure (this may, in turn, add more elements to
40 // the tail of the promoted list, and these newly added objects will
41 // also be processed) until the list is empty.
42 // To aid verification and debugging, in the non-product builds
43 // we actually forward _promoHead each time we process a promoted oop.
44 // Note that this is not necessary in general (i.e. when we don't need to
45 // call PromotionInfo::verify()) because oop_iterate can only add to the
46 // end of _promoTail, and never needs to look at _promoHead.
47
48 #define PROMOTED_OOPS_ITERATE_DEFN(OopClosureType, nv_suffix) \
|
1 /*
2 * Copyright (c) 2010, 2015, 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 "precompiled.hpp"
26 #include "gc/cms/compactibleFreeListSpace.hpp"
27 #include "gc/cms/promotionInfo.hpp"
28 #include "gc/shared/genOopClosures.hpp"
29 #include "oops/markOop.inline.hpp"
30 #include "oops/oop.inline.hpp"
31
32 /////////////////////////////////////////////////////////////////////////
33 //// PromotionInfo
34 /////////////////////////////////////////////////////////////////////////
35
36
37 //////////////////////////////////////////////////////////////////////////////
38 // We go over the list of promoted objects, removing each from the list,
39 // and applying the closure (this may, in turn, add more elements to
40 // the tail of the promoted list, and these newly added objects will
41 // also be processed) until the list is empty.
42 // To aid verification and debugging, in the non-product builds
43 // we actually forward _promoHead each time we process a promoted oop.
44 // Note that this is not necessary in general (i.e. when we don't need to
45 // call PromotionInfo::verify()) because oop_iterate can only add to the
46 // end of _promoTail, and never needs to look at _promoHead.
47
48 #define PROMOTED_OOPS_ITERATE_DEFN(OopClosureType, nv_suffix) \
|