Lines Matching refs:at
124 Node* n = ideal_nodes.at(next);
183 PointsToNode* ptn = ptnodes_worklist.at(next);
208 JavaObjectNode* ptn = non_escaped_worklist.at(next);
252 Node* n = alloc_worklist.at(next);
710 const Type* at = _igvn->type(adr);
711 if (!adr->is_top() && at->isa_ptr()) {
712 assert(at == Type::TOP || at == TypePtr::NULL_PTR ||
713 at->isa_ptr() != NULL, "expecting a pointer");
805 // it's fields will be marked as NoEscape at least.
856 const Type* at = d->field_at(i);
859 if (arg->is_top() || !at->isa_ptr() || !aat->isa_ptr())
950 const Type* at = d->field_at(i);
954 if (at->isa_ptr() != NULL &&
963 if (at->isa_oopptr() != NULL &&
994 const Type* at = d->field_at(i);
995 if (at->isa_oopptr() != NULL) {
1048 JavaObjectNode* ptn = java_objects_worklist.at(next);
1065 FieldNode* field = oop_fields_worklist.at(next);
1106 JavaObjectNode* ptn = non_escaped_worklist.at(next);
1137 PointsToNode* ptn = ptnodes_worklist.at(next);
1196 JavaObjectNode* ptn = non_escaped_worklist.at(next);
1621 JavaObjectNode* ptn = java_objects_worklist.at(next);
1635 Node* n = addp_worklist.at(next);
1818 // at least one set has only not escaping allocations.
1835 PointsToNode* ptadr = _nodes.at(n->_idx);
1846 PointsToNode* ptadr = _nodes.at(n->_idx);
1857 PointsToNode* ptadr = _nodes.at(n->_idx);
1876 PointsToNode* ptadr = _nodes.at(n->_idx);
2242 // Or the type 't' could be not related to 'base_t' at all.
2285 // Put on IGVN worklist since at least addp's type was changed above.
2519 const Type *at = igvn->type(result->in(MemNode::Address));
2520 if (at == Type::TOP)
2522 assert (at->isa_ptr() != NULL, "pointer type required.");
2523 int idx = C->get_alias_index(at->is_ptr());
2526 if (!is_instance && (at->isa_oopptr() == NULL ||
2527 !at->is_oopptr()->is_known_instance())) {
2584 const Type *at = igvn->type(result->in(0)->in(MemNode::Address));
2585 if (at != Type::TOP) {
2586 assert (at->isa_ptr() != NULL, "pointer type required.");
2587 int idx = C->get_alias_index(at->is_ptr());
3033 MergeMemNode* nmm = _mergemem_worklist.at(next);
3036 // scan inputs which exist at the start, not ones we add during processing.
3049 const Type *at = igvn->type(mem->in(MemNode::Address));
3050 if (at != Type::TOP) {
3051 assert (at->isa_ptr() != NULL, "pointer type required.");
3052 uint idx = (uint)_compile->get_alias_index(at->is_ptr());
3106 PhiNode *phi = orig_phis.at(j);
3132 Node* n = ideal_nodes.at(i);
3233 PointsToNode *ptn = ptnodes_worklist.at(i);