src/share/vm/opto/callnode.cpp

*** 1,7 ****
  /*
!  * Copyright (c) 1997, 2009, 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) 1997, 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,36 ****
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
  // Portions of code courtesy of Clifford Click
  
  // Optimization - Graph Style
  
- #include "incls/_precompiled.incl"
- #include "incls/_callnode.cpp.incl"
- 
  //=============================================================================
  uint StartNode::size_of() const { return sizeof(*this); }
  uint StartNode::cmp( const Node &n ) const
  { return _domain == ((StartNode&)n)._domain; }
  const Type *StartNode::bottom_type() const { return _domain; }
--- 20,47 ----
   * or visit www.oracle.com if you need additional information or have any
   * questions.
   *
   */
  
+ #include "precompiled.hpp"
+ #include "ci/bcEscapeAnalyzer.hpp"
+ #include "compiler/oopMap.hpp"
+ #include "opto/callnode.hpp"
+ #include "opto/escape.hpp"
+ #include "opto/locknode.hpp"
+ #include "opto/machnode.hpp"
+ #include "opto/matcher.hpp"
+ #include "opto/parse.hpp"
+ #include "opto/regalloc.hpp"
+ #include "opto/regmask.hpp"
+ #include "opto/rootnode.hpp"
+ #include "opto/runtime.hpp"
+ 
  // Portions of code courtesy of Clifford Click
  
  // Optimization - Graph Style
  
  //=============================================================================
  uint StartNode::size_of() const { return sizeof(*this); }
  uint StartNode::cmp( const Node &n ) const
  { return _domain == ((StartNode&)n)._domain; }
  const Type *StartNode::bottom_type() const { return _domain; }