Searched refs:live (Results 26 - 36 of 36) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/code/
H A DcodeCache.cpp514 assert(nm->is_in_use() && !nm->is_speculatively_disconnected(), "should only disconnect live nmethods");
915 CodeBlob_sizes live; local
922 live.add(p);
931 if (!live.is_empty()) {
932 live.print("live");
/openjdk7/hotspot/src/share/vm/services/
H A Djmm.h72 JMM_THREAD_LIVE_COUNT = 4, /* Current number of live threads */
73 JMM_THREAD_PEAK_COUNT = 5, /* Peak number of live threads */
304 jboolean live);
H A Dmanagement.cpp1264 // ids - array of thread IDs; NULL indicates all live threads
2116 JVM_ENTRY(jint, jmm_DumpHeap0(JNIEnv *env, jstring outputfile, jboolean live))
2128 HeapDumper dumper(live ? true : false);
/openjdk7/jdk/src/share/javavm/export/
H A Djmm.h72 JMM_THREAD_LIVE_COUNT = 4, /* Current number of live threads */
73 JMM_THREAD_PEAK_COUNT = 5, /* Peak number of live threads */
304 jboolean live);
/openjdk7/hotspot/src/share/vm/opto/
H A Dcoalesce.cpp49 // Make all Nodes map directly to their final live range; no need for
95 // brand new live ranges but have not told the allocator yet.
155 // Renumber the live ranges to compact them. Makes the IFG smaller.
162 // compacted live range with no further chaining. There are no chains or
168 // Ignore unallocated live ranges
237 // Combine the live ranges def'd by these 2 Nodes. N2 is an input to N1.
241 if( lr1 != lr2 && // Different live ranges already AND
253 // The misclassified raw pointer is NOT live across the slow-path call,
292 // general parallel renaming. All the copies now use "names" (live-ranges)
363 // Fix block's liveout data for compressed live range
[all...]
H A Dchaitin.hpp32 #include "opto/live.hpp"
58 double _area; // Sum of all simultaneously live values
62 Node *_def; // Check for multi-def live ranges
91 // Compute the degree between 2 live ranges
129 // Number of registers this live range uses when it colors
138 // Number of physical registers this live range uses when it colors
145 // How much 'wiggle room' does this live range have?
152 // live range must spill.
154 // Is this live range of "low-degree"? Trivially colorable?
156 // Is this live rang
[all...]
H A Difg.cpp54 // Also make empty live range structures
186 // Compute the degree between 2 live ranges. If both live ranges are
202 // Compute effective degree for this live range. If both live ranges are
305 // Interfere this register with everything currently live. Use the RegMasks
310 // Interfere with everything live.
333 IndexSet *liveout = _live->live(b);
336 // Starting with the known live-out set, we remove things that get
337 // defined and add things that become live (essentiall
[all...]
H A Dreg_split.cpp38 // definitions. During propagation, split the live range around regions of
44 // hoist the live range back up into a register, and all subsequent uses
111 // instead. Update high-pressure indices. Create a new live range.
141 // the node->live range mapping.
185 // return updated count of live ranges
209 // live range of a rematerializable value. The live range spills,
227 // and defs a new live range, which is used by this node.
241 } // End special splitting for debug info live range
247 // no use side copy is needed. This frees up the live rang
[all...]
/openjdk7/jdk/src/share/classes/sun/jvmstat/perfdata/resources/
H A Daliasmap89 alias java.threads.live // 1.5.0 b39
90 hotspot.threads.live.count // 1.4.1
92 hotspot.threads.live.peak // 1.4.1
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsParallelCompact.cpp327 // Print the 'reclaimed ratio' for regions while there is something live in
772 // If the entire Region is live, the new location is region->destination + the
785 // number of live words in the Block that are (a) to the left of addr and (b)
800 const size_t live = bitmap->live_words_in_range(search_start, oop(addr)); local
801 result += block_offset + live;
1179 // that has the lowest density of live objects 'to the right.'
1248 // based on the density of live objects in the generation to determine a limit,
1396 // computed, based on the density (amount live / capacity) of the generation;
1614 // Choose the space to split; need at least 2 regions live (or fillable).
1635 // Fill from top() to end() w/live object
1941 const size_t live = pointer_delta(_space_info[id].new_top(), local
[all...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.cpp546 // ********** Phase 2: compute local live sets separately for each block
636 // fixed intervals are never live at block boundaries, so
637 // they need not be processed in live sets.
653 // Add uses of live locals from interpreter's point of view for proper debug information generation
680 // fixed intervals are never live at block boundaries, so
681 // they need not be processed in live sets
713 // fixed intervals are never live at block boundaries, so
714 // they need not be processed in live sets
748 // ********** Phase 3: perform a backward dataflow analysis to compute global live sets
762 // Exception handlers must be processed because not all live value
1331 BitMap live = block->live_out(); local
[all...]

Completed in 265 milliseconds

12