< prev index next >

src/hotspot/share/gc/shared/preservedMarks.cpp

Print this page
rev 49289 : 8199735: Mark word updates need to use Access API
   1 /*
   2  * Copyright (c) 2016, 2017, 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/shared/preservedMarks.inline.hpp"
  27 #include "gc/shared/workgroup.hpp"
  28 #include "memory/allocation.inline.hpp"
  29 #include "memory/resourceArea.hpp"

  30 #include "utilities/macros.hpp"
  31 
  32 void PreservedMarks::restore() {
  33   while (!_stack.is_empty()) {
  34     const OopAndMarkOop elem = _stack.pop();
  35     elem.set_mark();
  36   }
  37   assert_empty();
  38 }
  39 
  40 void PreservedMarks::adjust_during_full_gc() {
  41   StackIterator<OopAndMarkOop, mtGC> iter(_stack);
  42   while (!iter.is_empty()) {
  43     OopAndMarkOop* elem = iter.next_addr();
  44 
  45     oop obj = elem->get_oop();
  46     if (obj->is_forwarded()) {
  47       elem->set_oop(obj->forwardee());
  48     }
  49   }


   1 /*
   2  * Copyright (c) 2016, 2018, 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/shared/preservedMarks.inline.hpp"
  27 #include "gc/shared/workgroup.hpp"
  28 #include "memory/allocation.inline.hpp"
  29 #include "memory/resourceArea.hpp"
  30 #include "oops/oop.inline.hpp"
  31 #include "utilities/macros.hpp"
  32 
  33 void PreservedMarks::restore() {
  34   while (!_stack.is_empty()) {
  35     const OopAndMarkOop elem = _stack.pop();
  36     elem.set_mark();
  37   }
  38   assert_empty();
  39 }
  40 
  41 void PreservedMarks::adjust_during_full_gc() {
  42   StackIterator<OopAndMarkOop, mtGC> iter(_stack);
  43   while (!iter.is_empty()) {
  44     OopAndMarkOop* elem = iter.next_addr();
  45 
  46     oop obj = elem->get_oop();
  47     if (obj->is_forwarded()) {
  48       elem->set_oop(obj->forwardee());
  49     }
  50   }


< prev index next >