/openjdk7/hotspot/src/share/vm/code/ |
H A D | scopeDesc.hpp | 88 bool is_top() const;
|
H A D | scopeDesc.cpp | 146 bool ScopeDesc::is_top() const { function in class:ScopeDesc 151 if (is_top()) return NULL; 226 if (DoEscapeAnalysis && is_top() && _objects != NULL) {
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | vframe_hp.hpp | 45 bool is_top() const;
|
H A D | vframe_hp.cpp | 258 bool compiledVFrame::is_top() const { function in class:compiledVFrame 261 return scope()->is_top(); 315 return scope()->is_top()
|
H A D | vframe.cpp | 89 assert(is_top(), "just checking"); 98 while (!vf->is_top()) vf = vf->sender();
|
H A D | vframe.hpp | 87 virtual bool is_top() const { return true; } function in class:vframe 89 // Returns top vframe within same frame (see is_top())
|
H A D | deoptimization.cpp | 203 while (!vf->is_top()) { 1083 while (!cvf->is_top()) { 1113 while (!cvf->is_top()) { 1352 if (sd->is_top()) break;
|
H A D | simpleThresholdPolicy.cpp | 180 if (sd->is_top()) break;
|
H A D | compilationPolicy.cpp | 264 for (; !sd->is_top(); sd = sd->sender()) {
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | node.cpp | 534 // required by Node::is_top. See Compile::set_cached_top_node. 540 assert(is_top(), "must be top"); 543 assert(!is_top(), "must not be top"); 662 assert(!is_top(), "cannot grow a top node's out array"); 687 if( is_top() || is_Mach() || (Opcode() == Op_Node && _outcnt > 0) ) 701 return outcnt() == 0 || igvn.type(this) == Type::TOP || in(0)->is_top(); 756 if (n != NULL && !n->is_top()) { 1078 if (ctrl != NULL && !ctrl->is_top()) 1114 if (sub->is_top()) break; // Conservative answer for dead code. 1182 if (in != NULL && !in->is_top() [all...] |
H A D | memnode.hpp | 1120 bool is_empty_memory(Node* n) const { assert((n == empty_memory()) == n->is_top(), "sanity"); return n->is_top(); } 1171 else if ((uint)_idx < _mm->req() && !_mm->in(_idx)->is_top()) 1242 assert(_mem->is_top() == (_mem==_mm->empty_memory()), "correct sentinel"); 1243 return _mem->is_top(); 1247 assert(_mem2->is_top() == (_mem2==_mm2->empty_memory()), "correct sentinel"); 1248 return _mem2->is_top(); 1259 Node *mem = _mem->is_top() ? _mm_base : _mem; 1311 if (have_mm2 && _mem2->is_top()) _mem2 = _mm2->base_memory();
|
H A D | divnode.cpp | 467 if( in(0) && in(0)->is_top() ) return NULL; 566 if( in(0) && in(0)->is_top() ) return NULL; 709 if( in(0) && in(0)->is_top() ) return NULL; 803 if( in(0) && in(0)->is_top() ) return NULL; 841 if( in(0) && in(0)->is_top() ) return NULL; 1012 if( in(0) && in(0)->is_top() ) return NULL;
|
H A D | ifnode.cpp | 466 if (l->is_top()) return 0; // Top input means dead test 504 if (l->is_top()) { 535 if( bol->is_top() ) return; // In case a partially dead range check appears 832 if (in(0)->is_top()) return NULL; 834 if (in(1)->is_top()) return NULL;
|
H A D | loopnode.cpp | 277 if (init_control->is_top() || back_control->is_top()) 1952 !loop->tail()->is_top()) { 3204 if (_verify_only && use->is_top()) continue; 3259 if (sctrl != NULL && !sctrl->is_top() && is_dominator(early, sctrl)) { 3392 if( _nodes[use->_idx] != NULL || use->is_top() ) { // Not dead? 3439 if( n->in(0)->is_top() ) return; // Dead? 3504 assert(LCA != NULL && !LCA->is_top(), "no dead nodes"); 3567 if (n->in(0) != NULL && !n->in(0)->is_top() && 3573 if (in1 != NULL && in1 != n && !in1->is_top()) { [all...] |
H A D | callnode.cpp | 918 if (in(loc)->is_top() && idx > 0 && !c->is_top() ) { 1172 if (in(0) && in(0)->is_top()) return NULL; 1435 if (ctrl->is_top()) break; // dead control path 1554 if (in(0) && in(0)->is_top()) return NULL; 1692 if (in(0) && in(0)->is_top()) return NULL;
|
H A D | phaseX.cpp | 798 if( n->is_top() ) continue; 960 } else if (!n->is_top()) { 1069 assert((i->_idx >= k->_idx) || i->is_top(), "Idealize should return new nodes, use Identity to return old nodes"); 1164 assert(!dead->is_top(), "add check for top when pushing"); 1724 if (!old->is_top()) 1754 assert(!is_top(), "top node has no DU info");
|
H A D | memnode.cpp | 241 if (ctl && ctl->is_top()) return NodeSentinel; 362 if (dom == NULL || dom->is_top() || sub == NULL || sub->is_top()) 367 if (dom == NULL || dom->is_top()) 391 if (sub == NULL || sub->is_top()) 420 if (n == NULL || n->is_top()) 435 if (m->is_top()) 443 if (m == NULL || m->is_top()) 884 return (adr->is_AddP() && adr->in(AddPNode::Base)->is_top() && 2792 if (in(0) && in(0)->is_top()) retur [all...] |
H A D | callGenerator.cpp | 308 call_node()->in(0) == NULL || call_node()->in(0)->is_top()) { 314 if (call_node()->in(TypeFunc::Parms + i1)->is_top() && r->field_at(TypeFunc::Parms + i1) != Type::HALF) { 320 if (call_node()->in(TypeFunc::Memory)->is_top()) {
|
H A D | node.hpp | 414 bool is_top() const { 418 // Reaffirm invariants for is_top. (Only from Compile::set_cached_top_node.) 433 if (is_top()) return; 439 if (is_top()) return;
|
H A D | phaseX.hpp | 457 assert(dead->outcnt() == 0 && !dead->is_top(), "node must be dead");
|
H A D | escape.cpp | 589 if (uncast_in->is_top() || uncast_in == n) 620 if (uncast_in->is_top() || uncast_in == n) 711 if (!adr->is_top() && at->isa_ptr()) { 859 if (arg->is_top() || !at->isa_ptr() || !aat->isa_ptr()) 2154 if (base->uncast()->is_top()) { // The AddP case #3 and #6. 2158 assert(base->in(AddPNode::Base)->uncast()->is_top(), "expected unsafe access address only"); 2268 assert(!abase->is_top(), "sanity"); // AddP case #3 3044 if (mem == NULL || mem->is_top())
|
H A D | cfgnode.cpp | 1673 if (ident != uin && !ident->is_top()) { 1681 assert(ident == uin || ident->is_top(), "Identity must clean this up"); 1770 if (base2 != NULL && !base2->is_top()) { 2195 if (!in(0) || in(0)->is_top()) return Type::TOP;
|
H A D | loopTransform.cpp | 281 if (ctrl->is_top()) 1138 if (n_c->is_top()) return false; 2352 !tail()->is_top()) { 2360 !tail()->is_top()) { // Also ignore the occasional dead backedge
|
H A D | split_if.cpp | 256 if (use_blk->is_top()) // Handle dead uses
|
/openjdk7/hotspot/src/share/vm/prims/ |
H A D | jvmtiCodeBlobEvents.cpp | 256 while( !sd->is_top() ) { sd = sd->sender(); }
|