Searched defs:mach (Results 1 - 9 of 9) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Difg.cpp378 const MachNode *mach = n->as_Mach(); local
382 uint op = mach->ideal_Opcode();
383 // Check that mach->num_opnds() == 3 to ensure instruction is
389 if( (op == Op_AddI && mach->req() == 3 && mach->num_opnds() == 3) &&
H A Dcoalesce.cpp587 MachNode *mach = n->as_Mach(); local
588 combine_these_two( mach, mach->in(idx) );
H A Dreg_split.cpp913 MachNode *mach = n->is_Mach() ? n->as_Mach() : NULL; local
916 (mach && mach->ideal_Opcode() == Op_AddP && inpidx == AddPNode::Base)) {
940 mach && mach->ideal_Opcode() != Op_Halt &&
H A Dlcm.cpp137 MachNode *mach = m->as_Mach(); local
139 int iop = mach->ideal_Opcode();
156 assert(mach->in(2) == val, "should be address");
171 if( mach->in(2) != val ) continue;
181 if( !mach->needs_anti_dependence_check() )
194 const MachOper* oper = mach->memory_inputs(base, index);
211 const Node* base = mach->get_base_and_disp(offset, adr_type);
237 Block *cb = cfg->_bbs[mach->_idx];
255 for( j = mach->req()-1; j > 0; j-- ) {
256 if( mach
[all...]
H A Dchaitin.cpp1471 MachNode *mach = n->as_Mach(); local
1472 inp = mach->operand_index(inp);
1491 MachNode *cisc = mach->cisc_version(stk_offset, C)->as_Mach();
1493 if( cisc->oper_input_base() > 1 && mach->oper_input_base() <= 1 ) {
H A Dgcm.cpp1030 MachNode* mach = self->is_Mach() ? self->as_Mach() : NULL; local
1031 if (mach && mach->out_RegMask().is_bound1() && mach->out_RegMask().is_NotEmpty())
1061 if (mach && LCA == root_block)
1148 MachNode* mach = self->is_Mach() ? self->as_Mach() : NULL; local
1149 if (mach) {
1150 switch (mach->ideal_Opcode()) {
1184 if (mach != NULL && mach
[all...]
H A Dmatcher.cpp126 debug_only(_mem_node = NULL;) // Ideal memory node consumed by mach node
323 // to avoid false sharing if the corresponding mach node is not used.
324 // The corresponding mach node is only used in rare cases for derived
370 // Generate new mach node for ConP #NULL
1638 MachNode *mach = s->MachNodeGenerator( rule, C ); local
1639 mach->_opnds[0] = s->MachOperGenerator( _reduceOp[rule], C );
1640 assert( mach->_opnds[0] != NULL, "Missing result operand" );
1647 mach->add_req( leaf->in(0) ); // Set initial control
1649 ReduceInst_Interior( s, rule, mem, mach, 1 );
1652 mach
1766 ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) argument
[all...]
H A Dnode.cpp511 MachNode *mach = n->as_Mach(); local
516 MachOper **to = (MachOper **)((size_t)(&mach->_opnds) +
519 mach->_opnds = to;
H A Doutput.cpp389 MachNode *mach = nj->as_Mach(); local
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(); local
482 if (mach !
812 Process_OopMap_Node(MachNode *mach, int current_offset) argument
1298 MachNode *mach = n->as_Mach(); local
1534 MachNode *mach = delay_slot->as_Mach(); local
2458 MachNode *mach = n->as_Mach(); local
2866 Node *mach = b->_nodes[j]; local
[all...]

Completed in 74 milliseconds