Searched defs:live (Results 1 - 16 of 16) sorted by relevance

/openjdk7/jdk/src/share/native/sun/management/
H A DHotSpotDiagnostic.c33 (JNIEnv *env, jobject dummy, jstring outputfile, jboolean live)
35 jmm_interface->DumpHeap0(env, outputfile, live);
32 Java_sun_management_HotSpotDiagnostic_dumpHeap(JNIEnv *env, jobject dummy, jstring outputfile, jboolean live) argument
/openjdk7/hotspot/src/share/vm/opto/
H A Dlive.hpp42 // Compute live-in/live-out
44 // Array of Sets of values live at the start of a block.
59 LRG_List &_names; // Mapping from Nodes to live ranges
60 uint _maxlrg; // Largest live-range number
77 // Return the live-out set for this block
78 IndexSet *live( const Block * b ) { return &_live[b->_pre_order-1]; } function in class:PhaseLive
H A Dlive.cpp29 #include "opto/live.hpp"
36 // Compute live-in/live-out. We use a totally incremental algorithm. The LIVE
39 // live-in from the block. Push these to the live-out sets of all predecessor
40 // blocks. At each predecessor, the new live-out values are ANDed with what is
41 // already live-out (extra stuff is added to the live-out sets). Then the
42 // remaining new live-out values are ANDed with what is locally defined.
43 // Leftover bits become the new live
221 IndexSet *live = &_live[p->_pre_order-1]; local
238 IndexSet *live = &_live[p->_pre_order-1]; local
[all...]
H A DbuildOopMap.cpp119 OopMap *build_oop_map( Node *n, int max_reg, PhaseRegAlloc *regalloc, int* live );
133 int *live = (int*) (*safehash)[n]; local
134 assert( live, "must find live" );
135 n->as_MachSafePoint()->set_oop_map( build_oop_map(n,max_reg,regalloc, live) );
219 static int get_live_bit( int *live, int reg ) { argument
220 return live[reg>>LogBitsPerInt] & (1<<(reg&(BitsPerInt-1))); }
221 static void set_live_bit( int *live, int reg ) { argument
222 live[reg>>LogBitsPerInt] |= (1<<(reg&(BitsPerInt-1))); }
223 static void clr_live_bit( int *live, in argument
418 int *live = NEW_ARENA_ARRAY(A, int, (cfg->_num_blocks+1) * max_reg_ints); local
[all...]
H A Dchaitin.cpp105 // Bigger area lowers score, encourages spilling this live range.
106 // Bigger cost raise score, prevents spilling this live range.
229 // Need live-ness for the IFG; need the IFG for coalescing. If the
231 // all copy-related live ranges low and then using the max copy-related
232 // live range as a cut-off for LIVE and the IFG. In other words, I can
234 PhaseLive live(_cfg,_names,&live_arena);
244 // - effectively ending SSA form. This requires either coalescing live
258 _live = NULL; // Mark live as being not available
263 live.compute( _maxlrg ); // Compute liveness
264 _live = &live; // Mar
1837 IndexSet *live = _live->live(b); local
[all...]
/openjdk7/jdk/src/share/classes/com/sun/management/
H A DHotSpotDiagnosticMXBean.java63 * @param live if <tt>true</tt> dump only <i>live</i> objects
70 public void dumpHeap(String outputFile, boolean live) throws java.io.IOException; argument
/openjdk7/jdk/src/share/classes/sun/management/
H A DHotSpotDiagnostic.java43 public native void dumpHeap(String outputFile, boolean live) throws IOException; argument
/openjdk7/jdk/test/java/lang/management/ThreadMXBean/
H A DThreadCounts.java44 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 DAllThreadIds.java41 private static volatile boolean live[] = new boolean[ALL_THREADS]; field in class:AllThreadIds
68 " die = " + live[i] +
91 fail("Unexpected number of live threads: " +
92 " Prev live = " + prevLiveThreadCount +
93 " Current live = " + curLiveThreadCount +
131 live[i] = true;
178 live[i] = false;
193 boolean live = (i >= DAEMON_THREADS);
197 (live ? " expected alive." : " expected terminated."));
206 if (live !
[all...]
H A DResetPeakThreadCount.java62 private static volatile boolean live[] = new boolean[ALL_THREADS]; field in class:ResetPeakThreadCount
126 live[i] = true;
169 live[i] = false;
234 // The MyThread thread lives as long as correspondent live[i] value is true
245 while (live[id]) {
/openjdk7/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/
H A DPhase.java36 Phase(String n, double s, int nodes, int live) { argument
39 startLiveNodes = live;
61 /* Number of live nodes added by the phase */
/openjdk7/jdk/src/share/classes/sun/tools/jmap/
H A DJMap.java48 private static String LIVE_HISTO_OPTION = "-histo:live";
215 private static final String LIVE_OBJECTS_OPTION = "-live";
217 private static void histo(String pid, boolean live) throws IOException { argument
220 heapHisto(live ? LIVE_OBJECTS_OPTION : ALL_OBJECTS_OPTION);
237 // dump live objects only or not
238 boolean live = isDumpLiveObjects(options);
244 (live ? LIVE_OBJECTS_OPTION : ALL_OBJECTS_OPTION));
264 } else if (option.equals("live")) {
286 if (suboption.equals("live")) {
357 System.out.println(" -histo[:live] t
[all...]
/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/cpu/x86/vm/
H A DsharedRuntime_x86_64.cpp462 // rax isn't live so capture return address while we easily can
2435 // native result if any is live
2456 // Must save rax if if it is live now because cmpxchg must use it
2889 bool live[ConcreteRegisterImpl::number_of_registers]; local
2891 live[j_rarg0->as_VMReg()->value()] = false;
2892 live[j_rarg1->as_VMReg()->value()] = false;
2893 live[j_rarg2->as_VMReg()->value()] = false;
2894 live[j_rarg3->as_VMReg()->value()] = false;
2895 live[j_rarg4->as_VMReg()->value()] = false;
2896 live[j_rarg
[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...]
/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...]

Completed in 191 milliseconds