src/share/vm/memory/memRegion.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 2000, 2004, 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.
--- 1,7 ----
  /*
!  * Copyright (c) 2000, 2010, 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.
*** 20,35 ****
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
  // A very simple data structure representing a contigous word-aligned
  // region of address space.
  
- #include "incls/_precompiled.incl"
- #include "incls/_memRegion.cpp.incl"
- 
  MemRegion MemRegion::intersection(const MemRegion mr2) const {
    MemRegion res;
    HeapWord* res_start = MAX2(start(), mr2.start());
    HeapWord* res_end   = MIN2(end(),   mr2.end());
    if (res_start < res_end) {
--- 20,36 ----
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
+ #include "precompiled.hpp"
+ #include "memory/memRegion.hpp"
+ #include "runtime/globals.hpp"
+ 
  // A very simple data structure representing a contigous word-aligned
  // region of address space.
  
  MemRegion MemRegion::intersection(const MemRegion mr2) const {
    MemRegion res;
    HeapWord* res_start = MAX2(start(), mr2.start());
    HeapWord* res_end   = MIN2(end(),   mr2.end());
    if (res_start < res_end) {