Mercurial > jdk8-mips64-public > hotspot / annotate
src/share/vm/opto/multnode.cpp@82a980778b92 (annotated)
src/share/vm/opto/multnode.cpp
Thu, 05 Feb 2009 11:42:10 -0800
- author
- never
- date
- Thu, 05 Feb 2009 11:42:10 -0800
- changeset 979
- 82a980778b92
- parent 435
- a61af66fc99e
- child 1907
- c18cbe5936b8
- permissions
- -rw-r--r--
6793828: G1: invariant: queues are empty when activated
Reviewed-by: jrose, kvn
| duke@435 | 1 | /* |
| duke@435 | 2 | * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. |
| duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| duke@435 | 4 | * |
| duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
| duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
| duke@435 | 7 | * published by the Free Software Foundation. |
| duke@435 | 8 | * |
| duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
| duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
| duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
| duke@435 | 13 | * accompanied this code). |
| duke@435 | 14 | * |
| duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
| duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
| duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| duke@435 | 18 | * |
| duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
| duke@435 | 21 | * have any questions. |
| duke@435 | 22 | * |
| duke@435 | 23 | */ |
| duke@435 | 24 | |
| duke@435 | 25 | #include "incls/_precompiled.incl" |
| duke@435 | 26 | #include "incls/_multnode.cpp.incl" |
| duke@435 | 27 | |
| duke@435 | 28 | //============================================================================= |
| duke@435 | 29 | //------------------------------MultiNode-------------------------------------- |
| duke@435 | 30 | const RegMask &MultiNode::out_RegMask() const { |
| duke@435 | 31 | return RegMask::Empty; |
| duke@435 | 32 | } |
| duke@435 | 33 | |
| duke@435 | 34 | Node *MultiNode::match( const ProjNode *proj, const Matcher *m ) { return proj->clone(); } |
| duke@435 | 35 | |
| duke@435 | 36 | //------------------------------proj_out--------------------------------------- |
| duke@435 | 37 | // Get a named projection |
| duke@435 | 38 | ProjNode* MultiNode::proj_out(uint which_proj) const { |
| duke@435 | 39 | assert(Opcode() != Op_If || which_proj == (uint)true || which_proj == (uint)false, "must be 1 or 0"); |
| duke@435 | 40 | assert(Opcode() != Op_If || outcnt() == 2, "bad if #1"); |
| duke@435 | 41 | for( DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++ ) { |
| duke@435 | 42 | Node *p = fast_out(i); |
| duke@435 | 43 | if( !p->is_Proj() ) { |
| duke@435 | 44 | assert(p == this && this->is_Start(), "else must be proj"); |
| duke@435 | 45 | continue; |
| duke@435 | 46 | } |
| duke@435 | 47 | ProjNode *proj = p->as_Proj(); |
| duke@435 | 48 | if( proj->_con == which_proj ) { |
| duke@435 | 49 | assert(Opcode() != Op_If || proj->Opcode() == (which_proj?Op_IfTrue:Op_IfFalse), "bad if #2"); |
| duke@435 | 50 | return proj; |
| duke@435 | 51 | } |
| duke@435 | 52 | } |
| duke@435 | 53 | return NULL; |
| duke@435 | 54 | } |
| duke@435 | 55 | |
| duke@435 | 56 | //============================================================================= |
| duke@435 | 57 | //------------------------------ProjNode--------------------------------------- |
| duke@435 | 58 | uint ProjNode::hash() const { |
| duke@435 | 59 | // only one input |
| duke@435 | 60 | return (uintptr_t)in(TypeFunc::Control) + (_con << 1) + (_is_io_use ? 1 : 0); |
| duke@435 | 61 | } |
| duke@435 | 62 | uint ProjNode::cmp( const Node &n ) const { return _con == ((ProjNode&)n)._con && ((ProjNode&)n)._is_io_use == _is_io_use; } |
| duke@435 | 63 | uint ProjNode::size_of() const { return sizeof(ProjNode); } |
| duke@435 | 64 | |
| duke@435 | 65 | // Test if we propagate interesting control along this projection |
| duke@435 | 66 | bool ProjNode::is_CFG() const { |
| duke@435 | 67 | Node *def = in(0); |
| duke@435 | 68 | return (_con == TypeFunc::Control && def->is_CFG()); |
| duke@435 | 69 | } |
| duke@435 | 70 | |
| duke@435 | 71 | const Type *ProjNode::bottom_type() const { |
| duke@435 | 72 | if (in(0) == NULL) return Type::TOP; |
| duke@435 | 73 | const Type *tb = in(0)->bottom_type(); |
| duke@435 | 74 | if( tb == Type::TOP ) return Type::TOP; |
| duke@435 | 75 | if( tb == Type::BOTTOM ) return Type::BOTTOM; |
| duke@435 | 76 | const TypeTuple *t = tb->is_tuple(); |
| duke@435 | 77 | return t->field_at(_con); |
| duke@435 | 78 | } |
| duke@435 | 79 | |
| duke@435 | 80 | const TypePtr *ProjNode::adr_type() const { |
| duke@435 | 81 | if (bottom_type() == Type::MEMORY) { |
| duke@435 | 82 | // in(0) might be a narrow MemBar; otherwise we will report TypePtr::BOTTOM |
| duke@435 | 83 | const TypePtr* adr_type = in(0)->adr_type(); |
| duke@435 | 84 | #ifdef ASSERT |
| duke@435 | 85 | if (!is_error_reported() && !Node::in_dump()) |
| duke@435 | 86 | assert(adr_type != NULL, "source must have adr_type"); |
| duke@435 | 87 | #endif |
| duke@435 | 88 | return adr_type; |
| duke@435 | 89 | } |
| duke@435 | 90 | assert(bottom_type()->base() != Type::Memory, "no other memories?"); |
| duke@435 | 91 | return NULL; |
| duke@435 | 92 | } |
| duke@435 | 93 | |
| duke@435 | 94 | bool ProjNode::pinned() const { return in(0)->pinned(); } |
| duke@435 | 95 | #ifndef PRODUCT |
| duke@435 | 96 | void ProjNode::dump_spec(outputStream *st) const { st->print("#%d",_con); if(_is_io_use) st->print(" (i_o_use)");} |
| duke@435 | 97 | #endif |
| duke@435 | 98 | |
| duke@435 | 99 | //----------------------------check_con---------------------------------------- |
| duke@435 | 100 | void ProjNode::check_con() const { |
| duke@435 | 101 | Node* n = in(0); |
| duke@435 | 102 | if (n == NULL) return; // should be assert, but NodeHash makes bogons |
| duke@435 | 103 | if (n->is_Mach()) return; // mach. projs. are not type-safe |
| duke@435 | 104 | if (n->is_Start()) return; // alas, starts can have mach. projs. also |
| duke@435 | 105 | if (_con == SCMemProjNode::SCMEMPROJCON ) return; |
| duke@435 | 106 | const Type* t = n->bottom_type(); |
| duke@435 | 107 | if (t == Type::TOP) return; // multi is dead |
| duke@435 | 108 | assert(_con < t->is_tuple()->cnt(), "ProjNode::_con must be in range"); |
| duke@435 | 109 | } |
| duke@435 | 110 | |
| duke@435 | 111 | //------------------------------Value------------------------------------------ |
| duke@435 | 112 | const Type *ProjNode::Value( PhaseTransform *phase ) const { |
| duke@435 | 113 | if( !in(0) ) return Type::TOP; |
| duke@435 | 114 | const Type *t = phase->type(in(0)); |
| duke@435 | 115 | if( t == Type::TOP ) return t; |
| duke@435 | 116 | if( t == Type::BOTTOM ) return t; |
| duke@435 | 117 | return t->is_tuple()->field_at(_con); |
| duke@435 | 118 | } |
| duke@435 | 119 | |
| duke@435 | 120 | //------------------------------out_RegMask------------------------------------ |
| duke@435 | 121 | // Pass the buck uphill |
| duke@435 | 122 | const RegMask &ProjNode::out_RegMask() const { |
| duke@435 | 123 | return RegMask::Empty; |
| duke@435 | 124 | } |
| duke@435 | 125 | |
| duke@435 | 126 | //------------------------------ideal_reg-------------------------------------- |
| duke@435 | 127 | uint ProjNode::ideal_reg() const { |
| duke@435 | 128 | return Matcher::base2reg[bottom_type()->base()]; |
| duke@435 | 129 | } |
