Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/c1/c1_Compiler.cpp@710a3c8b516e (annotated)
src/share/vm/c1/c1_Compiler.cpp
Tue, 08 Aug 2017 15:57:29 +0800
- author
- aoqi
- date
- Tue, 08 Aug 2017 15:57:29 +0800
- changeset 6876
- 710a3c8b516e
- parent 6198
- 55fb97c4c58d
- parent 0
- f90c822e73f8
- child 7535
- 7ae4e26cb1e0
- permissions
- -rw-r--r--
merge
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved. |
| aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| aoqi@0 | 4 | * |
| aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
| aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| aoqi@0 | 7 | * published by the Free Software Foundation. |
| aoqi@0 | 8 | * |
| aoqi@0 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| aoqi@0 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| aoqi@0 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| aoqi@0 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| aoqi@0 | 13 | * accompanied this code). |
| aoqi@0 | 14 | * |
| aoqi@0 | 15 | * You should have received a copy of the GNU General Public License version |
| aoqi@0 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| aoqi@0 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| aoqi@0 | 18 | * |
| aoqi@0 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| aoqi@0 | 20 | * or visit www.oracle.com if you need additional information or have any |
| aoqi@0 | 21 | * questions. |
| aoqi@0 | 22 | * |
| aoqi@0 | 23 | */ |
| aoqi@0 | 24 | |
| aoqi@0 | 25 | #include "precompiled.hpp" |
| aoqi@0 | 26 | #include "c1/c1_Compilation.hpp" |
| aoqi@0 | 27 | #include "c1/c1_Compiler.hpp" |
| aoqi@0 | 28 | #include "c1/c1_FrameMap.hpp" |
| aoqi@0 | 29 | #include "c1/c1_GraphBuilder.hpp" |
| aoqi@0 | 30 | #include "c1/c1_LinearScan.hpp" |
| aoqi@0 | 31 | #include "c1/c1_MacroAssembler.hpp" |
| aoqi@0 | 32 | #include "c1/c1_Runtime1.hpp" |
| aoqi@0 | 33 | #include "c1/c1_ValueType.hpp" |
| aoqi@0 | 34 | #include "compiler/compileBroker.hpp" |
| aoqi@0 | 35 | #include "compiler/compilerOracle.hpp" |
| aoqi@0 | 36 | #include "interpreter/linkResolver.hpp" |
| aoqi@0 | 37 | #include "memory/allocation.hpp" |
| aoqi@0 | 38 | #include "memory/allocation.inline.hpp" |
| aoqi@0 | 39 | #include "memory/resourceArea.hpp" |
| aoqi@0 | 40 | #include "prims/nativeLookup.hpp" |
| aoqi@0 | 41 | #include "runtime/arguments.hpp" |
| aoqi@0 | 42 | #include "runtime/interfaceSupport.hpp" |
| aoqi@0 | 43 | #include "runtime/sharedRuntime.hpp" |
| aoqi@0 | 44 | |
| aoqi@0 | 45 | |
| aoqi@0 | 46 | Compiler::Compiler () {} |
| aoqi@0 | 47 | |
| aoqi@0 | 48 | void Compiler::init_c1_runtime() { |
| aoqi@0 | 49 | BufferBlob* buffer_blob = CompilerThread::current()->get_buffer_blob(); |
| aoqi@0 | 50 | Arena* arena = new (mtCompiler) Arena(); |
| aoqi@0 | 51 | Runtime1::initialize(buffer_blob); |
| aoqi@0 | 52 | FrameMap::initialize(); |
| aoqi@0 | 53 | // initialize data structures |
| aoqi@0 | 54 | ValueType::initialize(arena); |
| aoqi@0 | 55 | GraphBuilder::initialize(); |
| aoqi@0 | 56 | // note: to use more than one instance of LinearScan at a time this function call has to |
| aoqi@0 | 57 | // be moved somewhere outside of this constructor: |
| aoqi@0 | 58 | Interval::initialize(arena); |
| aoqi@0 | 59 | } |
| aoqi@0 | 60 | |
| aoqi@0 | 61 | |
| aoqi@0 | 62 | void Compiler::initialize() { |
| aoqi@0 | 63 | // Buffer blob must be allocated per C1 compiler thread at startup |
| aoqi@0 | 64 | BufferBlob* buffer_blob = init_buffer_blob(); |
| aoqi@0 | 65 | |
| aoqi@0 | 66 | if (should_perform_init()) { |
| aoqi@0 | 67 | if (buffer_blob == NULL) { |
| aoqi@0 | 68 | // When we come here we are in state 'initializing'; entire C1 compilation |
| aoqi@0 | 69 | // can be shut down. |
| aoqi@0 | 70 | set_state(failed); |
| aoqi@0 | 71 | } else { |
| aoqi@0 | 72 | init_c1_runtime(); |
| aoqi@0 | 73 | set_state(initialized); |
| aoqi@0 | 74 | } |
| aoqi@0 | 75 | } |
| aoqi@0 | 76 | } |
| aoqi@0 | 77 | |
| aoqi@0 | 78 | BufferBlob* Compiler::init_buffer_blob() { |
| aoqi@0 | 79 | // Allocate buffer blob once at startup since allocation for each |
| aoqi@0 | 80 | // compilation seems to be too expensive (at least on Intel win32). |
| aoqi@0 | 81 | assert (CompilerThread::current()->get_buffer_blob() == NULL, "Should initialize only once"); |
| aoqi@0 | 82 | |
| aoqi@0 | 83 | // setup CodeBuffer. Preallocate a BufferBlob of size |
| aoqi@0 | 84 | // NMethodSizeLimit plus some extra space for constants. |
| aoqi@0 | 85 | int code_buffer_size = Compilation::desired_max_code_buffer_size() + |
| aoqi@0 | 86 | Compilation::desired_max_constant_size(); |
| aoqi@0 | 87 | |
| aoqi@0 | 88 | BufferBlob* buffer_blob = BufferBlob::create("C1 temporary CodeBuffer", code_buffer_size); |
| aoqi@0 | 89 | if (buffer_blob != NULL) { |
| aoqi@0 | 90 | CompilerThread::current()->set_buffer_blob(buffer_blob); |
| aoqi@0 | 91 | } |
| aoqi@0 | 92 | |
| aoqi@0 | 93 | return buffer_blob; |
| aoqi@0 | 94 | } |
| aoqi@0 | 95 | |
| aoqi@0 | 96 | |
| aoqi@0 | 97 | void Compiler::compile_method(ciEnv* env, ciMethod* method, int entry_bci) { |
| aoqi@0 | 98 | BufferBlob* buffer_blob = CompilerThread::current()->get_buffer_blob(); |
| aoqi@0 | 99 | assert(buffer_blob != NULL, "Must exist"); |
| aoqi@0 | 100 | // invoke compilation |
| aoqi@0 | 101 | { |
| aoqi@0 | 102 | // We are nested here because we need for the destructor |
| aoqi@0 | 103 | // of Compilation to occur before we release the any |
| aoqi@0 | 104 | // competing compiler thread |
| aoqi@0 | 105 | ResourceMark rm; |
| aoqi@0 | 106 | Compilation c(this, env, method, entry_bci, buffer_blob); |
| aoqi@0 | 107 | } |
| aoqi@0 | 108 | } |
| aoqi@0 | 109 | |
| aoqi@0 | 110 | |
| aoqi@0 | 111 | void Compiler::print_timers() { |
| aoqi@0 | 112 | Compilation::print_timers(); |
| aoqi@0 | 113 | } |
