/*

 * Copyright (c) 2001, 2012, Oracle and/or its affiliates. All rights reserved.

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 *

 */

#ifndef SHARE_VM_GC_IMPLEMENTATION_G1_COLLECTIONSETCHOOSER_HPP

#define SHARE_VM_GC_IMPLEMENTATION_G1_COLLECTIONSETCHOOSER_HPP

#include "gc_implementation/g1/heapRegion.hpp"

#include "utilities/growableArray.hpp"

class CollectionSetChooser: public CHeapObj {

  // The index of the next candidate old region to be considered for

  // addition to the CSet.

  // The number of candidate old regions added to the CSet chooser.

  // If a region has more live bytes than this threshold, it will not

  // be added to the CSet chooser and will not be a candidate for

  // collection.

  // The sum of reclaimable bytes over all the regions in the CSet chooser.

public:

  // Return the current candidate region to be considered for

  // collection without removing it from the CSet chooser.

  HeapRegion* peek() {

    HeapRegion* res = NULL;

    if (_curr_index < _length) {

      assert(res != NULL,

                     _curr_index));

    }

    return res;

  }

  // Remove the given region from the CSet chooser and move to the

  // next one. The given region should be the current candidate region

  // in the CSet chooser.

  void remove_and_move_to_next(HeapRegion* hr) {

    assert(hr != NULL, "pre-condition");

    assert(_curr_index < _length, "pre-condition");

           err_msg("remaining reclaimable bytes inconsistent "

                   "from region: "SIZE_FORMAT" remaining: "SIZE_FORMAT,

    _curr_index += 1;

  }

  CollectionSetChooser();

  // Determine whether to add the given region to the CSet chooser or

  // not. Currently, we skip humongous regions (we never add them to

  // the CSet, we only reclaim them during cleanup) and regions whose

  // live bytes are over the threshold.

    assert(hr->is_marked(), "pre-condition");

    assert(!hr->is_young(), "should never consider young regions");

    return !hr->isHumongous() &&

  }

  // Calculate the minimum number of old regions we'll add to the CSet

  // during a mixed GC.

  // Calculate the maximum number of old regions we'll add to the CSet

  // during a mixed GC.

  // Serial version.

  // that the calling thread has reserved.  These must be set by the

  // Set the marked array entry at index to hr.  Careful to claim the index

  // first if in parallel.

  // Atomically increment the number of added regions by region_num

  // and the amount of reclaimable bytes by reclaimable_bytes.

  // Return the number of candidate regions that remain to be collected.

  // Determine whether the CSet chooser has more candidate regions or not.

  // Return the reclaimable bytes that remain to be collected on

  // all the candidate regions in the CSet chooser.

  // sorted, otherwise asserts false.

};

#endif // SHARE_VM_GC_IMPLEMENTATION_G1_COLLECTIONSETCHOOSER_HPP