/openjdk7/hotspot/src/share/vm/opto/ |
H A D | divnode.cpp | 90 static Node *transform_int_divide( PhaseGVN *phase, Node *dividend, jint divisor ) { argument 107 q = new (phase->C) SubINode(phase->intcon(0), dividend); 114 const Type *dt = phase->type(dividend); 122 const TypeInt *andconi_t = phase->type( dividend->in(2) )->isa_int(); 144 Node *sign = phase->transform(new (phase->C) RShiftINode(dividend, phase->intcon(N - 1))); 146 Node *round = phase->transform(new (phase 257 long_by_long_mulhi(PhaseGVN* phase, Node* dividend, jlong magic_const) argument 342 transform_long_divide( PhaseGVN *phase, Node *dividend, jlong divisor ) argument 464 Ideal(PhaseGVN *phase, bool can_reshape) argument 563 Ideal( PhaseGVN *phase, bool can_reshape) argument 706 Ideal(PhaseGVN *phase, bool can_reshape) argument 800 Ideal(PhaseGVN *phase, bool can_reshape) argument 837 Ideal(PhaseGVN *phase, bool can_reshape) argument 1008 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | rootnode.hpp | 45 virtual Node *Identity( PhaseTransform *phase ) { return this; } 46 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 47 virtual const Type *Value( PhaseTransform *phase ) const { return Type::BOTTOM; } 57 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 58 virtual const Type *Value( PhaseTransform *phase ) const;
|
H A D | addnode.cpp | 54 Node *AddNode::Identity( PhaseTransform *phase ) { 56 if( phase->type( in(1) )->higher_equal( zero ) ) return in(2); 57 if( phase->type( in(2) )->higher_equal( zero ) ) return in(1); 109 Node *AddNode::Ideal(PhaseGVN *phase, bool can_reshape) { argument 110 const Type *t1 = phase->type( in(1) ); 111 const Type *t2 = phase->type( in(2) ); 131 const Type *t12 = phase->type( add1->in(2) ); 145 Node *x2 = phase->makecon( add1->as_Add()->add_ring( t2, t12 )); 146 PhaseIterGVN *igvn = phase->is_IterGVN(); 163 const Type *t12 = phase 239 Ideal(PhaseGVN *phase, bool can_reshape) argument 371 Ideal(PhaseGVN *phase, bool can_reshape) argument 513 Ideal(PhaseGVN *phase, bool can_reshape) argument 550 Ideal(PhaseGVN *phase, bool can_reshape) argument 570 Ideal(PhaseGVN *phase, bool can_reshape) argument 686 Ideal_base_and_offset(Node* ptr, PhaseTransform* phase, intptr_t& offset) argument 851 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | mulnode.cpp | 48 Node *MulNode::Identity( PhaseTransform *phase ) { 50 if( phase->type( in(1) )->higher_equal( one ) ) return in(2); 51 if( phase->type( in(2) )->higher_equal( one ) ) return in(1); 59 Node *MulNode::Ideal(PhaseGVN *phase, bool can_reshape) { argument 60 const Type *t1 = phase->type( in(1) ); 61 const Type *t2 = phase->type( in(2) ); 89 if( phase->eqv( mul1, this ) || phase->eqv( in(2), this ) || 91 ( phase->eqv( mul1->in(1), this ) || phase 176 Ideal(PhaseGVN *phase, bool can_reshape) argument 272 Ideal(PhaseGVN *phase, bool can_reshape) argument 468 Ideal(PhaseGVN *phase, bool can_reshape) argument 596 Ideal(PhaseGVN *phase, bool can_reshape) argument 646 Ideal(PhaseGVN *phase, bool can_reshape) argument 758 Ideal(PhaseGVN *phase, bool can_reshape) argument 886 Ideal(PhaseGVN *phase, bool can_reshape) argument 1100 Ideal(PhaseGVN *phase, bool can_reshape) argument 1246 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | subnode.cpp | 49 Node *SubNode::Identity( PhaseTransform *phase ) { 55 if( phase->type( in(1) )->higher_equal( zero ) && 57 phase->type( in(2)->in(1) )->higher_equal( zero ) ) { 63 if( phase->eqv(in(1)->in(2),in(2)) ) 65 if (phase->eqv(in(1)->in(1),in(2))) 74 phase->eqv(in(1)->in(2)->in(1),in(2)) ) 78 return ( phase->type( in(2) )->higher_equal( zero ) ) ? in(1) : this; 83 const Type *SubNode::Value( PhaseTransform *phase ) const { 87 const Type* t1 = (in1 == this) ? Type::TOP : phase->type(in1); 89 const Type* t2 = (in2 == this) ? Type::TOP : phase 131 Ideal(PhaseGVN *phase, bool can_reshape) argument 261 Ideal(PhaseGVN *phase, bool can_reshape) argument 398 Ideal(PhaseGVN *phase, bool can_reshape) argument 441 Ideal(PhaseGVN *phase, bool can_reshape) argument 580 Ideal( PhaseGVN *phase, bool can_reshape ) argument 707 isa_java_mirror_load(PhaseGVN* phase, Node* n) argument 727 isa_const_java_mirror(PhaseGVN* phase, Node* n) argument 758 Ideal( PhaseGVN *phase, bool can_reshape ) argument 936 Ideal( PhaseGVN *phase, bool can_reshape ) argument 1000 Ideal(PhaseGVN *phase, bool can_reshape) argument 1097 make_predicate(Node* test_value, PhaseGVN* phase) argument 1121 as_int_value(PhaseGVN* phase) argument 1130 negate(PhaseGVN* phase) argument 1137 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | connode.cpp | 111 Node *CMoveNode::Ideal(PhaseGVN *phase, bool can_reshape) { argument 112 if( in(0) && remove_dead_region(phase, can_reshape) ) return this; 115 assert( !phase->eqv(in(Condition), this) && 116 !phase->eqv(in(IfFalse), this) && 117 !phase->eqv(in(IfTrue), this), "dead loop in CMoveNode::Ideal" ); 118 if( phase->type(in(Condition)) == Type::TOP ) 124 BoolNode* b2 = b->negate(phase); 125 return make( phase->C, in(Control), phase->transform(b2), in(IfTrue), in(IfFalse), _type ); 133 Node *CMoveNode::is_cmove_id( PhaseTransform *phase, Nod argument 214 Ideal(PhaseGVN *phase, bool can_reshape) argument 281 Ideal(PhaseGVN *phase, bool can_reshape) argument 337 Ideal(PhaseGVN *phase, bool can_reshape) argument 428 Ideal(PhaseGVN *phase, bool can_reshape) argument 471 can_cause_alias(Node *n, PhaseTransform *phase) argument 568 Ideal(PhaseGVN *phase, bool can_reshape) argument 573 Identity(PhaseTransform* phase) argument 593 Identity(PhaseTransform* phase) argument 663 Identity(PhaseTransform *phase) argument 679 Ideal(PhaseGVN *phase, bool can_reshape) argument 688 Identity(PhaseTransform *phase) argument 703 Identity(PhaseTransform *phase) argument 713 Ideal(PhaseGVN *phase, bool can_reshape) argument 740 Identity(PhaseTransform *phase) argument 750 Ideal(PhaseGVN *phase, bool can_reshape) argument 767 Identity(PhaseTransform *phase) argument 777 Ideal(PhaseGVN *phase, bool can_reshape) argument 804 Identity(PhaseTransform *phase) argument 833 Ideal(PhaseGVN *phase, bool can_reshape) argument 1018 Ideal(PhaseGVN *phase, bool can_reshape) argument 1075 addP_of_X2P(PhaseGVN *phase, Node* base, Node* dispX, bool negate = false) argument 1087 Ideal(PhaseGVN *phase, bool can_reshape) argument 1135 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | mulnode.hpp | 50 virtual Node *Identity( PhaseTransform *phase ); 54 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 58 virtual const Type *Value( PhaseTransform *phase ) const; 86 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 102 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 149 virtual const Type *Value( PhaseTransform *phase ) const; 161 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 162 virtual Node *Identity( PhaseTransform *phase ); 178 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 179 virtual Node *Identity( PhaseTransform *phase ); [all...] |
H A D | connode.hpp | 164 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 165 virtual const Type *Value( PhaseTransform *phase ) const; 166 virtual Node *Identity( PhaseTransform *phase ); 169 static Node *is_cmove_id( PhaseTransform *phase, Node *cmp, Node *t, Node *f, BoolNode *b ); 177 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 185 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 193 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 225 virtual Node *Identity( PhaseTransform *phase ); 226 virtual const Type *Value( PhaseTransform *phase ) const; 227 virtual Node *Ideal(PhaseGVN *phase, boo [all...] |
H A D | rootnode.cpp | 37 Node *RootNode::Ideal(PhaseGVN *phase, bool can_reshape) { argument 40 if( phase->type(in(i)) == Type::TOP ) { 75 Node *HaltNode::Ideal(PhaseGVN *phase, bool can_reshape) { argument 76 return remove_dead_region(phase, can_reshape) ? this : NULL; 80 const Type *HaltNode::Value( PhaseTransform *phase ) const { 81 return ( phase->type(in(TypeFunc::Control)) == Type::TOP)
|
H A D | divnode.hpp | 47 virtual Node *Identity( PhaseTransform *phase ); 48 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 49 virtual const Type *Value( PhaseTransform *phase ) const; 60 virtual Node *Identity( PhaseTransform *phase ); 61 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 62 virtual const Type *Value( PhaseTransform *phase ) const; 73 virtual Node *Identity( PhaseTransform *phase ); 74 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 75 virtual const Type *Value( PhaseTransform *phase ) const; 86 virtual Node *Identity( PhaseTransform *phase ); 151 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | addnode.hpp | 50 virtual Node *Identity( PhaseTransform *phase ); 54 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 58 virtual const Type *Value( PhaseTransform *phase ) const; 82 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 83 virtual Node *Identity( PhaseTransform *phase ); 96 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 97 virtual Node *Identity( PhaseTransform *phase ); 107 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 112 virtual Node *Identity( PhaseTransform *phase ) { return this; } 122 virtual Node *Ideal(PhaseGVN *phase, boo [all...] |
H A D | memnode.cpp | 46 static Node *step_through_mergemem(PhaseGVN *phase, MergeMemNode *mmem, const TypePtr *tp, const TypePtr *adr_check, outputStream *st); 106 Node *MemNode::optimize_simple_memory_chain(Node *mchain, const TypePtr *t_adr, PhaseGVN *phase) { argument 111 Node *start_mem = phase->C->start()->proj_out(TypeFunc::Memory); 125 if (!call->may_modify(t_adr, phase)) { 141 if (!ClearArrayNode::step_through(&result, instance_id, phase)) { 148 result = step_through_mergemem(phase, result->as_MergeMem(), t_adr, NULL, tty); 154 Node *MemNode::optimize_memory_chain(Node *mchain, const TypePtr *t_adr, PhaseGVN *phase) { argument 157 PhaseIterGVN *igvn = phase->is_IterGVN(); 159 result = optimize_simple_memory_chain(result, t_adr, phase); 172 assert(phase 178 step_through_mergemem(PhaseGVN *phase, MergeMemNode *mmem, const TypePtr *tp, const TypePtr *adr_check, outputStream *st) argument 234 Ideal_common(PhaseGVN *phase, bool can_reshape) argument 458 detect_ptr_independence(Node* p1, AllocateNode* a1, Node* p2, AllocateNode* a2, PhaseTransform* phase) argument 492 find_previous_store(PhaseTransform* phase) argument 1184 eliminate_autobox(PhaseGVN* phase) argument 1295 split_through_phi(PhaseGVN *phase) argument 1419 Ideal(PhaseGVN *phase, bool can_reshape) argument 1793 Ideal(PhaseGVN *phase, bool can_reshape) argument 1825 Ideal(PhaseGVN* phase, bool can_reshape) argument 1855 Ideal(PhaseGVN *phase, bool can_reshape) argument 1885 Ideal(PhaseGVN *phase, bool can_reshape) argument 2168 Ideal(PhaseGVN *phase, bool can_reshape) argument 2291 Ideal(PhaseGVN *phase, bool can_reshape) argument 2432 Ideal_masked_input(PhaseGVN *phase, uint mask) argument 2450 Ideal_sign_extended_input(PhaseGVN *phase, int num_bits) argument 2495 Ideal(PhaseGVN *phase, bool can_reshape) argument 2510 Ideal(PhaseGVN *phase, bool can_reshape) argument 2537 Ideal(PhaseGVN *phase, bool can_reshape) argument 2632 Ideal(PhaseGVN *phase, bool can_reshape) argument 2675 step_through(Node** np, uint instance_id, PhaseTransform* phase) argument 2699 clear_memory(Node* ctl, Node* mem, Node* dest, intptr_t start_offset, Node* end_offset, PhaseGVN* phase) argument 2721 clear_memory(Node* ctl, Node* mem, Node* dest, Node* start_offset, Node* end_offset, PhaseGVN* phase) argument 2749 clear_memory(Node* ctl, Node* mem, Node* dest, intptr_t start_offset, intptr_t end_offset, PhaseGVN* phase) argument 2789 Ideal(PhaseGVN *phase, bool can_reshape) argument 2851 Ideal(PhaseGVN *phase, bool can_reshape) argument 3046 set_complete(PhaseGVN* phase) argument 3061 maybe_set_complete(PhaseGVN* phase) argument 3088 get_store_offset(Node* st, PhaseTransform* phase) argument 3148 can_capture_store(StoreNode* st, PhaseTransform* phase, bool can_reshape) argument 3265 captured_store_insertion_point(intptr_t start, int size_in_bytes, PhaseTransform* phase) argument 3319 find_captured_store(intptr_t start, int size_in_bytes, PhaseTransform* phase) argument 3335 make_raw_address(intptr_t offset, PhaseTransform* phase) argument 3364 capture_store(StoreNode* st, intptr_t start, PhaseTransform* phase, bool can_reshape) argument 3441 coalesce_subword_stores(intptr_t header_size, Node* size_in_bytes, PhaseGVN* phase) argument 3668 find_next_fullword_store(uint start, PhaseGVN* phase) argument 3719 complete_stores(Node* rawctl, Node* rawmem, Node* rawptr, intptr_t header_size, Node* size_in_bytes, PhaseGVN* phase) argument 3873 stores_are_sane(PhaseTransform* phase) argument 4039 Identity(PhaseTransform *phase) argument 4057 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | cfgnode.hpp | 87 bool is_unreachable_region(PhaseGVN *phase) const; 94 virtual const Type *Value( PhaseTransform *phase ) const; 95 virtual Node *Identity( PhaseTransform *phase ); 96 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 98 bool try_clean_mem_phi(PhaseGVN *phase); 132 Node* is_cmove_id(PhaseTransform* phase, int true_path); 178 Node* unique_input(PhaseTransform *phase); 201 virtual const Type *Value( PhaseTransform *phase ) const; 202 virtual Node *Identity( PhaseTransform *phase ); 203 virtual Node *Ideal(PhaseGVN *phase, boo [all...] |
H A D | cfgnode.cpp | 47 const Type *RegionNode::Value( PhaseTransform *phase ) const { 51 if( phase->type(n) == Type::CONTROL ) 59 Node *RegionNode::Identity( PhaseTransform *phase ) { 69 static Node *merge_region(RegionNode *region, PhaseGVN *phase) { argument 73 PhaseIterGVN *igvn = phase->is_IterGVN(); 97 r->set_req(j, phase->C->top()); 109 region->set_req(i, phase->C->top()); 309 bool RegionNode::is_unreachable_region(PhaseGVN *phase) const { 319 assert(phase->eqv(phi->in(0), this) && phi->req() == 2, ""); 345 Node *n = (Node*)phase 366 try_clean_mem_phi(PhaseGVN *phase) argument 412 Ideal(PhaseGVN *phase, bool can_reshape) argument 1095 is_cmove_id(PhaseTransform* phase, int true_path) argument 1151 unique_input(PhaseTransform* phase) argument 1214 is_x2logic( PhaseGVN *phase, PhiNode *phi, int true_path ) argument 1273 is_cond_add(PhaseGVN *phase, PhiNode *phi, int true_path) argument 1327 is_absolute( PhaseGVN *phase, PhiNode *phi_root, int true_path) argument 1427 split_flow_path(PhaseGVN *phase, PhiNode *phi) argument 1589 Ideal(PhaseGVN *phase, bool can_reshape) argument 2066 Ideal(PhaseGVN *phase, bool can_reshape) argument 2201 Ideal(PhaseGVN *phase, bool can_reshape) argument [all...] |
H A D | memnode.hpp | 75 PhaseTransform* phase); 78 static Node *optimize_simple_memory_chain(Node *mchain, const TypePtr *t_adr, PhaseGVN *phase); 79 static Node *optimize_memory_chain(Node *mchain, const TypePtr *t_adr, PhaseGVN *phase); 80 // This one should probably be a phase-specific function: 90 Node *Ideal_common(PhaseGVN *phase, bool can_reshape); // Return -1 for short-circuit NULL. 122 Node* find_previous_store(PhaseTransform* phase); 126 Node* can_see_stored_value(Node* st, PhaseTransform* phase) const; 156 virtual Node *Identity( PhaseTransform *phase ); 160 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 163 Node* split_through_phi(PhaseGVN *phase); [all...] |
H A D | ifnode.cpp | 45 const Type *IfNode::Value( PhaseTransform *phase ) const { 47 if( phase->type(in(0)) == Type::TOP ) 49 const Type *t = phase->type(in(1)); 222 PhaseGVN *phase = igvn; 278 phi_x = phase->transform( phi_x ); 281 Node *cmp_c = phase->makecon(t); 285 cmp_x = phase->transform(cmp_x); 287 Node *b_c = phase->transform(new (igvn->C) BoolNode(cmp_c,b->_test._test)); 288 Node *b_x = phase->transform(new (igvn->C) BoolNode(cmp_x,b->_test._test)); 301 Node *iff_c_t = phase 675 fold_compares(PhaseGVN* phase) argument 757 remove_useless_bool(IfNode *iff, PhaseGVN *phase) argument 825 Ideal(PhaseGVN *phase, bool can_reshape) argument 1081 idealize_test(PhaseGVN* phase, IfNode* iff) argument [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | Phaser.java | 66 * generation of a phaser has an associated phase number. The phase 69 * Integer.MAX_VALUE}. The use of phase numbers enables independent 78 * do not block, but return an associated <em>arrival phase 79 * number</em>; that is, the phase number of the phaser to which 80 * the arrival applied. When the final party for a given phase 81 * arrives, an optional action is performed and the phase 83 * triggering a phase advance, and are arranged by overriding 90 * argument indicating an arrival phase number, and returns when 91 * the phaser advances to (or is already at) a different phase 350 queueFor(int phase) argument 713 awaitAdvance(int phase) argument 739 awaitAdvanceInterruptibly(int phase) argument 775 awaitAdvanceInterruptibly(int phase, long timeout, TimeUnit unit) argument 931 onAdvance(int phase, int registeredParties) argument 963 releaseWaiters(int phase) argument 986 abortWait(int phase) argument 1026 internalAwaitAdvance(int phase, QNode node) argument 1080 final int phase; field in class:Phaser.QNode 1089 QNode(Phaser phaser, int phase, boolean interruptible, boolean timed, long nanos) argument [all...] |
/openjdk7/jdk/test/java/util/concurrent/Phaser/ |
H A D | TieredArriveLoops.java | 58 int phase = p.awaitAdvance(p.arrive()); 59 if (phase < 0) 61 equal(phase, (prevPhase + 1) & Integer.MAX_VALUE); 63 check(ph < 0 || ph == phase); 64 prevPhase = phase; 79 for (int prevPhase = 0, phase; ; prevPhase = phase) { 80 phase = child2.getPhase(); 81 check(phase >= prevPhase); 83 System.err.printf("phase [all...] |
H A D | Basic.java | 55 int phase = phaser.getPhase(); 56 check(phase < 0); 57 equal(phase, phaser.arrive()); 58 equal(phase, phaser.arriveAndDeregister()); 59 equal(phase, phaser.arriveAndAwaitAdvance()); 60 equal(phase, phaser.bulkRegister(10)); 61 equal(phase, phaser.register()); 63 equal(phase, phaser.awaitAdvanceInterruptibly(0)); 64 equal(phase, phaser.awaitAdvanceInterruptibly(0, 10, SECONDS)); 96 int phase 127 private volatile int phase; field in class:Basic.Arriver 130 phase(int phase) argument 131 public int phase() { return this.phase; } method in class:Basic.Arriver [all...] |
H A D | FickleRegister.java | 65 int phase = p.register(); 66 if (phase < 0) break; 67 check(phase > prevPhase); 68 prevPhase = phase; 69 equal(phase, p.arriveAndDeregister()); 70 check(phase < p.awaitAdvance(phase)); 82 protected boolean onAdvance(int phase, int parties) {
|
/openjdk7/langtools/test/tools/javac/processing/filer/ |
H A D | TestGetResource.java | 53 @SupportedOptions("phase") 63 String phase = options.get("phase"); 65 if (phase.equals("write")) { 70 } else if (phase.equals("read")) { 83 throw new RuntimeException("Unexpected phase: " + phase);
|
/openjdk7/hotspot/src/share/vm/gc_implementation/shared/ |
H A D | gcTimer.hpp | 40 virtual void visit(GCPhase* phase) = 0; 41 virtual void visit(PausePhase* phase) { visit((GCPhase*)phase); } argument 42 virtual void visit(ConcurrentPhase* phase) { visit((GCPhase*)phase); } argument 124 void update_statistics(GCPhase* phase);
|
H A D | gcTimer.cpp | 123 PausePhase phase; local 124 phase.set_level(level); 125 phase.set_name(name); 126 phase.set_start(time); 128 int index = _phases->append(phase); 133 void TimePartitions::update_statistics(GCPhase* phase) { argument 135 if (phase->level() == 0) { 136 jlong pause = phase->end() - phase->start(); 144 GCPhase* phase local 197 validate_pause_phase(GCPhase* phase, int level, const char* name, jlong start, jlong end) argument [all...] |
/openjdk7/hotspot/src/share/tools/LogCompilation/src/com/sun/hotspot/tools/compiler/ |
H A D | LogCompilation.java | 128 for (Phase phase : c.getPhases()) { 129 Double v = phaseTime.get(phase.getName()); 133 phaseTime.put(phase.getName(), Double.valueOf(v.doubleValue() + phase.getElapsedTime())); 135 Integer v2 = phaseNodes.get(phase.getName()); 139 phaseNodes.put(phase.getName(), Integer.valueOf(v2.intValue() + phase.getNodes())); 140 /* Print phase name, elapsed time, nodes at the start of the phase, 141 nodes created in the phase, liv [all...] |
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | g1HRPrinter.cpp | 63 const char* G1HRPrinter::phase_name(PhaseType phase) { argument 64 switch (phase) { 109 void G1HRPrinter::print(PhaseType phase, size_t phase_num) { argument 110 const char* phase_str = phase_name(phase);
|