1 /*

     2  * Copyright 2001-2007 Sun Microsystems, Inc.  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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,

    20  * CA 95054 USA or visit www.sun.com if you need additional information or

    21  * have any questions.

    22  *

    23  */

    24 

    25 inline HeapRegion* HeapRegionSeq::addr_to_region(const void* addr) {

    26   assert(_seq_bottom != NULL, "bad _seq_bottom in addr_to_region");

    27   if ((char*) addr >= _seq_bottom) {

    28     size_t diff = (size_t) pointer_delta((HeapWord*) addr,

    29                                          (HeapWord*) _seq_bottom);

    30     int index = (int) (diff >> HeapRegion::LogOfHRGrainWords);

    31     assert(index >= 0, "invariant / paranoia");

    32     if (index < _regions.length()) {

    33       HeapRegion* hr = _regions.at(index);

    34       assert(hr->is_in_reserved(addr),

    35              "addr_to_region is wrong...");

    36       return hr;

    37     }

    38   }

    39   return NULL;

    40 }