Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/runtime/task.hpp@2a33b32dd03c (annotated)
src/share/vm/runtime/task.hpp
Thu, 24 May 2018 19:24:53 +0800
- author
- aoqi
- date
- Thu, 24 May 2018 19:24:53 +0800
- changeset 8861
- 2a33b32dd03c
- parent 6876
- 710a3c8b516e
- permissions
- -rw-r--r--
#7046 Disable the compilation when branch offset is beyond short branch
Contributed-by: fujie, aoqi
| aoqi@0 | 1 | /* |
| aoqi@0 | 2 | * Copyright (c) 1997, 2012, 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 | #ifndef SHARE_VM_RUNTIME_TASK_HPP |
| aoqi@0 | 26 | #define SHARE_VM_RUNTIME_TASK_HPP |
| aoqi@0 | 27 | |
| aoqi@0 | 28 | #include "utilities/top.hpp" |
| aoqi@0 | 29 | |
| aoqi@0 | 30 | // A PeriodicTask has the sole purpose of executing its task |
| aoqi@0 | 31 | // function with regular intervals. |
| aoqi@0 | 32 | // Usage: |
| aoqi@0 | 33 | // PeriodicTask pf(10); |
| aoqi@0 | 34 | // pf.enroll(); |
| aoqi@0 | 35 | // ... |
| aoqi@0 | 36 | // pf.disenroll(); |
| aoqi@0 | 37 | |
| aoqi@0 | 38 | class PeriodicTask: public CHeapObj<mtInternal> { |
| aoqi@0 | 39 | public: |
| aoqi@0 | 40 | // Useful constants. |
| aoqi@0 | 41 | // The interval constants are used to ensure the declared interval |
| aoqi@0 | 42 | // is appropriate; it must be between min_interval and max_interval, |
| aoqi@0 | 43 | // and have a granularity of interval_gran (all in millis). |
| aoqi@0 | 44 | enum { max_tasks = 10, // Max number of periodic tasks in system |
| aoqi@0 | 45 | interval_gran = 10, |
| aoqi@0 | 46 | min_interval = 10, |
| aoqi@0 | 47 | max_interval = 10000 }; |
| aoqi@0 | 48 | |
| aoqi@0 | 49 | static int num_tasks() { return _num_tasks; } |
| aoqi@0 | 50 | |
| aoqi@0 | 51 | private: |
| aoqi@0 | 52 | int _counter; |
| aoqi@0 | 53 | const int _interval; |
| aoqi@0 | 54 | |
| aoqi@0 | 55 | static int _num_tasks; |
| aoqi@0 | 56 | static PeriodicTask* _tasks[PeriodicTask::max_tasks]; |
| aoqi@0 | 57 | static void real_time_tick(int delay_time); |
| aoqi@0 | 58 | |
| aoqi@0 | 59 | #ifndef PRODUCT |
| aoqi@0 | 60 | static elapsedTimer _timer; // measures time between ticks |
| aoqi@0 | 61 | static int _ticks; // total number of ticks |
| aoqi@0 | 62 | static int _intervalHistogram[max_interval]; // to check spacing of timer interrupts |
| aoqi@0 | 63 | public: |
| aoqi@0 | 64 | static void print_intervals(); |
| aoqi@0 | 65 | #endif |
| aoqi@0 | 66 | // Only the WatcherThread can cause us to execute PeriodicTasks |
| aoqi@0 | 67 | friend class WatcherThread; |
| aoqi@0 | 68 | public: |
| aoqi@0 | 69 | PeriodicTask(size_t interval_time); // interval is in milliseconds of elapsed time |
| aoqi@0 | 70 | ~PeriodicTask(); |
| aoqi@0 | 71 | |
| aoqi@0 | 72 | // Make the task active |
| aoqi@0 | 73 | // For dynamic enrollment at the time T, the task will execute somewhere |
| aoqi@0 | 74 | // between T and T + interval_time. |
| aoqi@0 | 75 | void enroll(); |
| aoqi@0 | 76 | |
| aoqi@0 | 77 | // Make the task deactive |
| aoqi@0 | 78 | void disenroll(); |
| aoqi@0 | 79 | |
| aoqi@0 | 80 | void execute_if_pending(int delay_time) { |
| aoqi@0 | 81 | // make sure we don't overflow |
| aoqi@0 | 82 | jlong tmp = (jlong) _counter + (jlong) delay_time; |
| aoqi@0 | 83 | |
| aoqi@0 | 84 | if (tmp >= (jlong) _interval) { |
| aoqi@0 | 85 | _counter = 0; |
| aoqi@0 | 86 | task(); |
| aoqi@0 | 87 | } else { |
| aoqi@0 | 88 | _counter += delay_time; |
| aoqi@0 | 89 | } |
| aoqi@0 | 90 | } |
| aoqi@0 | 91 | |
| aoqi@0 | 92 | // Returns how long (time in milliseconds) before the next time we should |
| aoqi@0 | 93 | // execute this task. |
| aoqi@0 | 94 | int time_to_next_interval() const { |
| aoqi@0 | 95 | assert(_interval > _counter, "task counter greater than interval?"); |
| aoqi@0 | 96 | return _interval - _counter; |
| aoqi@0 | 97 | } |
| aoqi@0 | 98 | |
| aoqi@0 | 99 | // Calculate when the next periodic task will fire. |
| aoqi@0 | 100 | // Called by the WatcherThread's run method. |
| aoqi@0 | 101 | static int time_to_wait(); |
| aoqi@0 | 102 | |
| aoqi@0 | 103 | // The task to perform at each period |
| aoqi@0 | 104 | virtual void task() = 0; |
| aoqi@0 | 105 | }; |
| aoqi@0 | 106 | |
| aoqi@0 | 107 | #endif // SHARE_VM_RUNTIME_TASK_HPP |
