/openjdk9/jdk/src/jdk.management/share/native/libmanagement_ext/ |
H A D | HotSpotDiagnostic.c | 33 (JNIEnv *env, jobject dummy, jstring outputfile, jboolean live) 35 jmm_interface->DumpHeap0(env, outputfile, live); 32 Java_com_sun_management_internal_HotSpotDiagnostic_dumpHeap0(JNIEnv *env, jobject dummy, jstring outputfile, jboolean live) argument
|
/openjdk9/hotspot/test/native/gc/parallel/ |
H A D | test_psAdaptiveSizePolicy.cpp | 35 size_t live; member in struct:TestCase 54 test_cases[i].live, test_cases[i].ratio), 57 << " - Test case " << i << ": live = " << test_cases[i].live
|
/openjdk9/jdk/src/jdk.management/share/classes/com/sun/management/ |
H A D | HotSpotDiagnosticMXBean.java | 62 * @param live if {@code true} dump only <i>live</i> objects 75 public void dumpHeap(String outputFile, boolean live) throws java.io.IOException; argument
|
/openjdk9/jdk/test/java/lang/management/ThreadMXBean/ |
H A D | ResetPeakThreadCount.java | 65 private static final boolean live[] = new boolean[ALL_THREADS]; field in class:ResetPeakThreadCount 139 synchronized(live) { 141 live[i] = true; 177 synchronized(live) { 179 live[i] = false; 181 live.notifyAll(); 245 // The MyThread thread lives as long as correspondent live[i] value is true 256 synchronized(live) { 257 while (live[id]) { 259 live [all...] |
H A D | ThreadCounts.java | 44 private static volatile boolean live[] = new boolean[ALL_THREADS]; field in class:ThreadCounts 58 live[i] = true; 80 live[i] = true; 101 live[i] = false; 118 live[i] = true; 139 live[i] = false; 157 live[i] = false; 186 "Minimal number of live threads is " + 237 // The MyThread thread lives as long as correspondent live[i] value is true 248 while (live[i [all...] |
H A D | AllThreadIds.java | 62 private static final boolean live[] = new boolean[ALL_THREADS]; field in class:AllThreadIds 82 " die = " + live[i] + 221 "Unexpected number of live threads: " + 222 " Prev live = %1$d Current live = ${provided} Threads added = %2$d" + 342 synchronized(live) { 343 live[i] = val; 348 synchronized(live) { 349 return live[i]; 353 // The MyThread thread lives as long as correspondent live[ [all...] |
/openjdk9/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/ |
H A D | Phase.java | 45 * The number of live nodes in the compilation at the beginning of this 51 * The number of live nodes in the compilation at the end of this phase. 55 Phase(String n, double s, int nodes, int live) { argument 58 startLiveNodes = live; 82 * The number of live nodes added by this phase.
|
/openjdk9/hotspot/src/share/vm/opto/ |
H A D | buildOopMap.cpp | 105 OopMap *build_oop_map( Node *n, int max_reg, PhaseRegAlloc *regalloc, int* live ); 118 int *live = (int*) (*safehash)[n]; local 119 assert( live, "must find live" ); 120 n->as_MachSafePoint()->set_oop_map( build_oop_map(n,max_reg,regalloc, live) ); 200 static int get_live_bit( int *live, int reg ) { argument 201 return live[reg>>LogBitsPerInt] & (1<<(reg&(BitsPerInt-1))); } 202 static void set_live_bit( int *live, int reg ) { argument 203 live[reg>>LogBitsPerInt] |= (1<<(reg&(BitsPerInt-1))); } 204 static void clr_live_bit( int *live, in argument 397 int* live = NEW_ARENA_ARRAY(A, int, (cfg->number_of_blocks() + 1) * max_reg_ints); local [all...] |
H A D | live.hpp | 45 // Compute live-in/live-out 47 // Array of Sets of values live at the start of a block. 49 IndexSet *_live; // live out 50 IndexSet *_livein; // live in 63 const LRG_List &_names; // Mapping from Nodes to live ranges 64 uint _maxlrg; // Largest live-range number 66 bool _keep_deltas; // Retain live in information 83 // Return the live-out set for this block 84 IndexSet *live( cons function in class:PhaseLive [all...] |
H A D | live.cpp | 30 #include "opto/live.hpp" 34 // Compute live-in/live-out. We use a totally incremental algorithm. The LIVE 37 // live-in from the block. Push these to the live-out sets of all predecessor 38 // blocks. At each predecessor, the new live-out values are ANDed with what is 39 // already live-out (extra stuff is added to the live-out sets). Then the 40 // remaining new live-out values are ANDed with what is locally defined. 41 // Leftover bits become the new live 234 IndexSet *live = &_live[p->_pre_order-1]; local 249 IndexSet *live = &_live[p->_pre_order-1]; local [all...] |
H A D | chaitin.cpp | 104 // Bigger area lowers score, encourages spilling this live range. 105 // Bigger cost raise score, prevents spilling this live range. 160 // Make all Nodes map directly to their final live range; no need for 181 // brand new live ranges but have not told the allocator yet. 302 // Renumber the live ranges to compact them. Makes the IFG smaller. 311 // compacted live range with no further chaining. There are no chains or 317 // Ignore unallocated live ranges 354 // Need live-ness for the IFG; need the IFG for coalescing. If the 356 // all copy-related live ranges low and then using the max copy-related 357 // live rang 2046 IndexSet *live = _live->live(b); local [all...] |
H A D | chaitin.hpp | 31 #include "opto/live.hpp" 57 double _area; // Sum of all simultaneously live values 61 Node *_def; // Check for multi-def live ranges 97 // Compute the degree between 2 live ranges 142 // Number of registers this live range uses when it colors 151 // Number of physical registers this live range uses when it colors 158 // How much 'wiggle room' does this live range have? 165 // live range must spill. 167 // Is this live range of "low-degree"? Trivially colorable? 169 // Is this live rang 482 set_live(PhaseLive &live) argument [all...] |
H A D | ifg.cpp | 49 // Also make empty live range structures 171 // Compute the degree between 2 live ranges. If both live ranges are 186 // Compute effective degree for this live range. If both live ranges are 285 * Interfere this register with everything currently live. 315 IndexSet* liveout = _live->live(block); 318 // Starting with the known live-out set, we remove things that get 319 // defined and add things that become live (essentially executing one 321 // (and removes it from the live [all...] |
H A D | coalesce.cpp | 85 // Combine the live ranges def'd by these 2 Nodes. N2 is an input to N1. 89 if( lr1 != lr2 && // Different live ranges already AND 101 // The misclassified raw pointer is NOT live across the slow-path call, 137 // general parallel renaming. All the copies now use "names" (live-ranges) 216 // Fix block's liveout data for compressed live ranges. 221 IndexSet *liveout = _phc._live->live(_phc._cfg.get_block(bidx)); 286 // because that will unsafely extend the live range of the constant table base. 327 // At this point it is unsafe to extend live ranges (6550579). 375 // If the live range is also live ou [all...] |
/openjdk9/jdk/src/jdk.management/share/classes/com/sun/management/internal/ |
H A D | HotSpotDiagnostic.java | 46 public void dumpHeap(String outputFile, boolean live) throws IOException { argument 61 dumpHeap0(outputFile, live); 64 private native void dumpHeap0(String outputFile, boolean live) throws IOException; argument
|
/openjdk9/jdk/src/demo/share/jfc/Metalworks/ |
H A D | MetalworksFrame.java | 235 JRadioButtonMenuItem live = new JRadioButtonMenuItem("Live"); 242 group.add(live); 246 live.setSelected(true); 259 live.addActionListener(new ActionListener() { 274 speed.add(live);
|
/openjdk9/jdk/test/sun/tools/jmap/ |
H A D | BasicJMapTest.java | 67 OutputAnalyzer output = jmap("-histo:live"); 89 private static void dump(boolean live) throws Exception { argument 95 if (live) { 96 output = jmap("-dump:live,format=b,file=" + dump.getName());
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/ssi/ |
H A D | FastSSIBuilder.java | 49 * Bit map specifying which operands are live upon entry to this block. These are values used in 56 * Bit map specifying which operands are live upon exit from this block. These are values used 57 * in a successor block that are either defined in this block or were live upon entry to this 111 * Computes live sets for each block. 118 try (Indent indent = Debug.logAndIndent(LOG_LEVEL, "compute local live sets for block %s", block)) { 167 * All variables live at the beginning of a loop are live throughout the loop. 169 private void handleLoopHeader(Loop<?> loop, BitSet live) { argument 171 getLiveIn(block).or(live); 172 getLiveOut(block).or(live); [all...] |
/openjdk9/hotspot/src/share/vm/gc/parallel/ |
H A D | psAdaptiveSizePolicy.cpp | 80 size_t PSAdaptiveSizePolicy::calculate_free_based_on_live(size_t live, uintx ratio_as_percentage) { argument 82 // amount of live data currently in the old gen. Using the formula: 83 // ratio * (free + live) = free 85 // free = (live * ratio) / (1 - ratio) 89 const double tmp = live * ratio; 97 size_t live = ParallelScavengeHeap::heap()->old_gen()->used_in_bytes(); local 100 size_t min_free = calculate_free_based_on_live(live, MinHeapFreeRatio); 105 size_t max_free = calculate_free_based_on_live(live, MaxHeapFreeRatio); 173 // Update the amount live at the end of a full GC 284 // the survivor sizes compatible with the live dat [all...] |
H A D | psAdaptiveSizePolicy.hpp | 98 // The amount of live data in the heap at the last full GC, used 128 // boundary over live data. 246 static size_t calculate_free_based_on_live(size_t live, uintx ratio_as_percentage); 332 // Given the amount of live data in the heap, should we
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir/src/org/graalvm/compiler/lir/alloc/lsra/ |
H A D | LinearScanLifetimeAnalysisPhase.java | 152 * Computes local live sets (i.e. {@link BlockData#liveGen} and {@link BlockData#liveKill}) 163 try (Indent indent = Debug.logAndIndent("compute local live sets for block %s", block)) { 214 * Fixed intervals are never live at block boundaries, so they need not be 215 * processed in live sets. Process them only in debug mode so that this can 230 * Add uses of live locals from interpreter's point of view for proper debug 256 * Fixed intervals are never live at block boundaries, so they need not be processed in live 268 * Fixed intervals are never live at block boundaries, so they need not be processed in live 280 * Performs a backward dataflow analysis to compute global live set [all...] |
/openjdk9/hotspot/src/share/vm/services/ |
H A D | jmm.h | 73 JMM_THREAD_LIVE_COUNT = 4, /* Current number of live threads */ 74 JMM_THREAD_PEAK_COUNT = 5, /* Peak number of live threads */ 308 jboolean live);
|
/openjdk9/jdk/src/java.management/share/native/include/ |
H A D | jmm.h | 73 JMM_THREAD_LIVE_COUNT = 4, /* Current number of live threads */ 74 JMM_THREAD_PEAK_COUNT = 5, /* Peak number of live threads */ 308 jboolean live);
|
/openjdk9/hotspot/src/share/vm/code/ |
H A D | codeCache.cpp | 714 // expect any live non-scavengable nmethods on the list. 1503 CodeBlob_sizes live; 1511 live.add(cb); 1519 if (!live.is_empty()) { 1520 live.print("live");
|
/openjdk9/langtools/src/jdk.jshell/share/classes/jdk/internal/jshell/tool/ |
H A D | JShellTool.java | 186 private boolean live = false; field in class:JShellTool 926 if (!live) { 1037 live = false; 1041 live = true; 1105 live = false; 1124 while (live) { 1185 live = false; // Make double sure 2117 live = false; 2597 live = false; 2950 if (isActive && live) { [all...] |