Lines Matching defs:mach

389         MachNode *mach = nj->as_Mach();
390 blk_size += (mach->alignment_required() - 1) * relocInfo::addr_unit(); // assume worst case padding
391 reloc_size += mach->reloc();
392 if( mach->is_MachCall() ) {
393 MachCallNode *mcall = mach->as_MachCall();
402 } else if (mach->is_MachSafePoint()) {
411 if (mach->avoid_back_to_back()) {
419 if (mach->may_be_short_branch()) {
481 MachNode* mach = (idx == -1) ? NULL: b->_nodes[idx]->as_Mach();
482 if (mach != NULL && mach->may_be_short_branch()) {
484 assert(jmp_size[i] > 0 && mach->is_MachBranch(), "sanity");
492 assert(j >= 0 && j == idx && b->_nodes[j] == (Node*)mach, "sanity");
509 if (_matcher->is_short_branch_offset(mach->rule(), br_size, offset)) {
511 MachNode* replacement = mach->as_MachBranch()->short_branch_version(this);
527 mach->subsume_by(replacement, C);
528 mach = replacement;
533 DEBUG_ONLY( jmp_rule[i] = mach->rule(); );
538 } // (mach->may_be_short_branch())
539 if (mach != NULL && (mach->may_be_short_branch() ||
540 mach->avoid_back_to_back())) {
812 void Compile::Process_OopMap_Node(MachNode *mach, int current_offset) {
815 MachSafePointNode *sfn = mach->as_MachSafePoint();
819 assert( is_node_getting_a_safepoint(mach), "logic does not match; false negative");
827 if( !mach->is_MachCall() ) {
831 mcall = mach->as_MachCall();
1298 MachNode *mach = n->as_Mach();
1303 if (is_sfn || is_mcall || mach->alignment_required() != 1) {
1312 int padding = mach->compute_padding(current_offset);
1318 if (padding == 0 && mach->avoid_back_to_back() &&
1338 MachCallNode *mcall = mach->as_MachCall();
1357 MachSafePointNode *sfn = mach->as_MachSafePoint();
1368 non_safepoints.observe_safepoint(mach->as_MachSafePoint()->jvms(),
1370 Process_OopMap_Node(mach, current_offset);
1374 else if( mach->is_MachNullCheck() ) {
1379 else if (mach->is_MachBranch()) {
1388 if (!delay_slot_is_used && mach->may_be_short_branch()) {
1404 if (_matcher->is_short_branch_offset(mach->rule(), br_size, offset)) {
1406 MachNode* replacement = mach->as_MachBranch()->short_branch_version(this);
1425 jmp_rule[i] = mach->rule();
1428 mach->subsume_by(replacement, C);
1430 mach = replacement;
1433 mach->as_MachBranch()->label_set( &blk_labels[block_num], block_num );
1434 } else if (mach->ideal_Opcode() == Op_Jump) {
1439 if (jpn->is_JumpProj() && jpn->in(0) == mach) {
1442 mach->add_case_label(jpn->as_JumpProj()->proj_no(), blkLabel);
1450 else if (mach->ideal_Opcode() == Op_StoreCM) {
1453 for (uint prec = mach->req(); prec < mach->len(); prec++) {
1454 Node *oop_store = mach->in(prec); // Precedence edge
1498 assert(false, "wrong size of mach node");
1534 MachNode *mach = delay_slot->as_Mach();
1536 if (!mach->is_MachCall() && mach->as_MachSafePoint()->jvms()->method() == NULL) {
1539 assert( !is_node_getting_a_safepoint(mach), "logic does not match; false positive");
1546 non_safepoints.observe_safepoint(mach->as_MachSafePoint()->jvms(),
1549 Process_OopMap_Node(mach, adjusted_offset);
2458 MachNode *mach = n->as_Mach();
2459 int iop = mach->ideal_Opcode();
2463 mach->pipeline() == MachNode::pipeline_class() &&
2866 Node *mach = b->_nodes[j];
2867 if( mach->is_Mach() && mach->as_Mach()->ideal_Opcode() == Op_AddP )
2868 mach->add_prec( n );