Lines Matching defs:result
436 // we are only interested in the oop result projection from a call
631 // we are only interested in the oop result projection from a call
957 if (call_ptn != NULL) { // Is call's result used?
1579 // the false positive result (set not scalar replaceable)
2097 // Proj #5 ( oop result )
2113 // Proj #5 ( oop result )
2130 // Proj #5 ( oop result )
2180 // as result process an array's element offset first (pushed second)
2224 assert(addp->in(AddPNode::Address)->is_Proj(), "base of raw address must be result projection from allocation");
2234 // As result t->offset() could be large then base_t's size and it will
2305 PhiNode *result = get_map_phi(orig_phi->_idx);
2306 if (result != NULL && C->get_alias_index(result->adr_type()) == alias_idx) {
2307 return result;
2311 if (result != NULL) {
2333 result = PhiNode::make(orig_phi->in(0), NULL, Type::MEMORY, atype);
2334 C->copy_node_notes_to(result, orig_phi);
2335 igvn->set_type(result, result->bottom_type());
2336 record_for_optimizer(result);
2337 set_map(orig_phi, result);
2339 return result;
2351 PhiNode *result = create_split_phi(orig_phi, alias_idx, orig_phi_worklist, new_phi_created);
2353 return result;
2371 result = newphi;
2381 result->set_req(idx++, mem);
2385 assert( phi->req() == result->req(), "must have same number of inputs.");
2386 assert( result->in(0) != NULL && result->in(0) == phi->in(0), "regions must match");
2391 Node* in = result->in(i);
2400 prev_result->set_req(idx++, result);
2401 result = prev_result;
2404 return result;
2513 Node *result = orig_mem;
2514 while (prev != result) {
2515 prev = result;
2516 if (result == start_mem)
2518 if (result->is_Mem()) {
2519 const Type *at = igvn->type(result->in(MemNode::Address));
2530 result = result->in(MemNode::Memory);
2535 if (result->is_Proj() && result->as_Proj()->_con == TypeFunc::Memory) {
2536 Node *proj_in = result->in(0);
2542 result = call->in(TypeFunc::Memory);
2549 result = proj_in->in(TypeFunc::Memory);
2552 result = proj_in->in(TypeFunc::Memory);
2554 } else if (result->is_MergeMem()) {
2555 MergeMemNode *mmem = result->as_MergeMem();
2556 result = step_through_mergemem(mmem, alias_idx, toop);
2557 if (result == mmem->base_memory()) {
2559 result = mmem->memory_at(C->get_general_index(alias_idx));
2560 result = find_inst_mem(result, alias_idx, orig_phis);
2564 mmem->set_memory_at(alias_idx, result);
2566 } else if (result->is_Phi() &&
2567 C->get_alias_index(result->as_Phi()->adr_type()) != alias_idx) {
2568 Node *un = result->as_Phi()->unique_input(igvn);
2570 orig_phis.append_if_missing(result->as_Phi());
2571 result = un;
2575 } else if (result->is_ClearArray()) {
2576 if (!ClearArrayNode::step_through(&result, (uint)toop->instance_id(), igvn)) {
2581 // Otherwise skip it (the call updated 'result' value).
2582 } else if (result->Opcode() == Op_SCMemProj) {
2583 assert(result->in(0)->is_LoadStore(), "sanity");
2584 const Type *at = igvn->type(result->in(0)->in(MemNode::Address));
2591 result = result->in(0)->in(MemNode::Memory);
2594 if (result->is_Phi()) {
2595 PhiNode *mphi = result->as_Phi();
2604 result = split_memory_phi(mphi, alias_idx, orig_phis);
2607 // the result is either MemNode, PhiNode, InitializeNode.
2608 return result;
2744 // The inline code for Object.clone() casts the allocation result to
2748 // the allocation result is cast to java.lang.Object and then
2812 // the users of the raw allocation result and push AddP users
2815 assert (raw_result != NULL, "must have an allocation result");
3071 Node* result = find_inst_mem(mem, ni, orig_phis);
3075 nmm->set_memory_at(ni, result);
3083 Node* result = step_through_mergemem(nmm, ni, tinst);
3084 if (result == nmm->base_memory()) {
3086 result = nmm->memory_at(_compile->get_general_index(ni));
3087 result = find_inst_mem(result, ni, orig_phis);
3091 nmm->set_memory_at(ni, result);