Lines Matching refs:use

262     // Now use the escape information to create unique types for
1214 PointsToNode* use = i.get();
1215 if (use->is_Arraycopy())
1217 add_uses_to_worklist(use);
1218 if (use->is_Field() && use->as_Field()->is_oop()) {
1221 add_field_uses_to_worklist(use->as_Field());
1226 PointsToNode* use = _worklist.pop();
1227 if (PointsToNode::is_base_use(use)) {
1229 use = PointsToNode::get_use_node(use)->as_Field();
1230 if (add_base(use->as_Field(), jobj)) {
1235 assert(!use->is_JavaObject(), "sanity");
1236 if (use->is_Arraycopy()) {
1240 if (add_edge(use, jobj)) {
1247 if (!add_edge(use, jobj))
1250 if (use->is_LocalVar()) {
1251 add_uses_to_worklist(use);
1252 if (use->arraycopy_dst()) {
1253 for (EdgeIterator i(use); i.has_next(); i.next()) {
1270 add_field_uses_to_worklist(use->as_Field());
1530 PointsToNode* use = i.get();
1531 assert(!use->is_Arraycopy(), "sanity");
1532 if (use->is_Field()) {
1533 FieldNode* field = use->as_Field();
1541 assert(use->is_Field() || use->is_LocalVar(), "sanity");
1543 for (EdgeIterator j(use); j.has_next(); j.next()) {
2389 // Otherwise use old phi.
2438 Node* use = n->fast_out(i);
2439 if (use->is_MergeMem()) {
2440 MergeMemNode* mmem = use->as_MergeMem();
2452 } else if (use->is_MemBar()) {
2453 assert(!use->is_Initialize(), "initializing stores should not be moved");
2454 if (use->req() > MemBarNode::Precedent &&
2455 use->in(MemBarNode::Precedent) == n) {
2457 record_for_optimizer(use);
2460 tp = use->as_MemBar()->adr_type()->isa_ptr();
2469 igvn->hash_delete(use);
2470 imax -= use->replace_edge(n, m);
2471 igvn->hash_insert(use);
2472 record_for_optimizer(use);
2475 } else if (use->is_Mem()) {
2476 if (use->Opcode() == Op_StoreCM && use->in(MemNode::OopStore) == n) {
2481 tp = igvn->type(use->in(MemNode::Address))->isa_ptr();
2484 assert(get_map(use->_idx) != NULL || idx == alias_idx,
2486 } else if (use->is_Phi()) {
2488 tp = use->as_Phi()->adr_type()->isa_ptr();
2493 use->dump();
2707 ideal_nodes.clear(); // Reset for use with set_map/get_map.
2746 // object. Detect this case and use the second cast.
2755 Node *use = n->fast_out(i);
2756 if (use->is_CheckCastPP()) {
2757 cast2 = use;
2798 Node* use = tgt->ideal_node();
2799 assert(tgt->is_Field() && use->is_AddP(),
2801 if (use->outcnt() > 0) { // Don't process dead nodes
2802 Node* addp2 = find_second_addp(use, use->in(AddPNode::Base));
2807 alloc_worklist.append_if_missing(use);
2817 Node *use = raw_result->fast_out(i);
2818 if (use->is_AddP() && use->outcnt() > 0) { // Don't process dead nodes
2819 Node* addp2 = find_second_addp(use, raw_result);
2824 alloc_worklist.append_if_missing(use);
2825 } else if (use->is_MemBar()) {
2826 memnode_worklist.append_if_missing(use);
2899 Node *use = n->fast_out(i);
2900 if(use->is_Mem() && use->in(MemNode::Address) == n) {
2902 memnode_worklist.append_if_missing(use);
2903 } else if (use->is_MemBar()) {
2904 memnode_worklist.append_if_missing(use);
2905 } else if (use->is_AddP() && use->outcnt() > 0) { // No dead nodes
2906 Node* addp2 = find_second_addp(use, n);
2910 alloc_worklist.append_if_missing(use);
2911 } else if (use->is_Phi() ||
2912 use->is_CheckCastPP() ||
2913 use->is_EncodeP() ||
2914 use->is_DecodeN() ||
2915 (use->is_ConstraintCast() && use->Opcode() == Op_CastPP)) {
2916 alloc_worklist.append_if_missing(use);
2918 } else if (use->is_Mem()) {
2919 assert(use->in(MemNode::Address) != n, "EA: missing allocation reference path");
2920 } else if (use->is_MergeMem()) {
2921 assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist");
2922 } else if (use->is_SafePoint()) {
2925 Node* m = use->in(TypeFunc::Memory);
2930 uint op = use->Opcode();
2936 use->dump();
2987 Node *use = n->fast_out(i);
2988 if (use->Opcode() == Op_SCMemProj) {
2989 n = use;
2998 Node *use = n->fast_out(i);
2999 if (use->is_Phi() || use->is_ClearArray()) {
3000 memnode_worklist.append_if_missing(use);
3001 } else if(use->is_Mem() && use->in(MemNode::Memory) == n) {
3002 if (use->Opcode() == Op_StoreCM) // Ignore cardmark stores
3004 memnode_worklist.append_if_missing(use);
3005 } else if (use->is_MemBar()) {
3006 memnode_worklist.append_if_missing(use);
3008 } else if(use->is_Mem()) {
3009 assert(use->in(MemNode::Memory) != n, "EA: missing memory path");
3010 } else if (use->is_MergeMem()) {
3011 assert(_mergemem_worklist.contains(use->as_MergeMem()), "EA: missing MergeMem node in the worklist");
3013 uint op = use->Opcode();
3015 (op == Op_CallLeaf && use->as_CallLeaf()->_name != NULL &&
3016 strcmp(use->as_CallLeaf()->_name, "g1_wb_pre") == 0) ||
3020 use->dump();
3035 // Note: we don't want to use MergeMemStream here because we only want to
3248 PointsToNode* use = j.get();
3249 if (use->is_LocalVar()) {
3250 use->dump(Verbose);
3252 use->dump();