Sat, 28 Mar 2009 15:47:29 -0700
6819891: ParNew: Fix work queue overflow code to deal correctly with +UseCompressedOops
Summary: When using compressed oops, rather than chaining the overflowed grey objects' pre-images through their klass words, we use GC-worker thread-local overflow stacks.
Reviewed-by: jcoomes, jmasa
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 2000-2006 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // The CompilationPolicy selects which method (if any) should be compiled. |
duke@435 | 26 | // It also decides which methods must always be compiled (i.e., are never |
duke@435 | 27 | // interpreted). |
duke@435 | 28 | |
duke@435 | 29 | class CompilationPolicy : public CHeapObj { |
duke@435 | 30 | private: |
duke@435 | 31 | static CompilationPolicy* _policy; |
duke@435 | 32 | // Accumulated time |
duke@435 | 33 | static elapsedTimer _accumulated_time; |
duke@435 | 34 | |
duke@435 | 35 | static bool _in_vm_startup; |
duke@435 | 36 | |
duke@435 | 37 | public: |
duke@435 | 38 | virtual void method_invocation_event(methodHandle m, TRAPS) = 0; |
duke@435 | 39 | virtual void method_back_branch_event(methodHandle m, int branch_bci, int loop_top_bci, TRAPS) = 0; |
duke@435 | 40 | virtual int compilation_level(methodHandle m, int branch_bci) = 0; |
duke@435 | 41 | |
duke@435 | 42 | void reset_counter_for_invocation_event(methodHandle method); |
duke@435 | 43 | void reset_counter_for_back_branch_event(methodHandle method); |
duke@435 | 44 | |
duke@435 | 45 | static void set_in_vm_startup(bool in_vm_startup) { _in_vm_startup = in_vm_startup; } |
duke@435 | 46 | static void completed_vm_startup(); |
duke@435 | 47 | static bool delayCompilationDuringStartup() { return _in_vm_startup; } |
duke@435 | 48 | |
duke@435 | 49 | static bool mustBeCompiled(methodHandle m); // m must be compiled before executing it |
duke@435 | 50 | static bool canBeCompiled(methodHandle m); // m is allowed to be compiled |
duke@435 | 51 | |
duke@435 | 52 | static void set_policy(CompilationPolicy* policy) { _policy = policy; } |
duke@435 | 53 | static CompilationPolicy* policy() { return _policy; } |
duke@435 | 54 | |
duke@435 | 55 | // Profiling |
duke@435 | 56 | elapsedTimer* accumulated_time() { return &_accumulated_time; } |
duke@435 | 57 | void print_time() PRODUCT_RETURN; |
duke@435 | 58 | }; |
duke@435 | 59 | |
duke@435 | 60 | class SimpleCompPolicy : public CompilationPolicy { |
duke@435 | 61 | public: |
duke@435 | 62 | void method_invocation_event( methodHandle m, TRAPS); |
duke@435 | 63 | void method_back_branch_event(methodHandle m, int branch_bci, int loop_top_bci, TRAPS); |
duke@435 | 64 | int compilation_level(methodHandle m, int branch_bci); |
duke@435 | 65 | }; |
duke@435 | 66 | |
duke@435 | 67 | // StackWalkCompPolicy - existing C2 policy |
duke@435 | 68 | |
duke@435 | 69 | #ifdef COMPILER2 |
duke@435 | 70 | class StackWalkCompPolicy : public CompilationPolicy { |
duke@435 | 71 | public: |
duke@435 | 72 | void method_invocation_event(methodHandle m, TRAPS); |
duke@435 | 73 | void method_back_branch_event(methodHandle m, int branch_bci, int loop_top_bci, TRAPS); |
duke@435 | 74 | int compilation_level(methodHandle m, int branch_bci); |
duke@435 | 75 | |
duke@435 | 76 | private: |
duke@435 | 77 | RFrame* findTopInlinableFrame(GrowableArray<RFrame*>* stack); |
duke@435 | 78 | RFrame* senderOf(RFrame* rf, GrowableArray<RFrame*>* stack); |
duke@435 | 79 | |
duke@435 | 80 | // the following variables hold values computed by the last inlining decision |
duke@435 | 81 | // they are used for performance debugging only (print better messages) |
duke@435 | 82 | static const char* _msg; // reason for not inlining |
duke@435 | 83 | |
duke@435 | 84 | static const char* shouldInline (methodHandle callee, float frequency, int cnt); |
duke@435 | 85 | // positive filter: should send be inlined? returns NULL (--> yes) or rejection msg |
duke@435 | 86 | static const char* shouldNotInline(methodHandle callee); |
duke@435 | 87 | // negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg |
duke@435 | 88 | |
duke@435 | 89 | }; |
duke@435 | 90 | #endif |