Lines Matching defs:base
48 // May need to lookup the base register, as done in int_ and ext_format
49 int MachOper::base (PhaseRegAlloc *ra_, const Node *node, int idx) const { return 0x00; }
54 int MachOper::base_position() const { return -1; } // no base input
192 assert( ideal_Opcode() == Op_AddP, "expected base ptr here" );
193 assert( idx == 1, "expected base ptr here" );
214 const MachOper* MachNode::memory_inputs(Node* &base, Node* &index) const {
218 base = NodeSentinel;
221 base = NULL;
232 base = _in[oper_pos+base_pos];
248 Node* base;
250 const MachOper* oper = memory_inputs(base, index);
265 // See if it adds up to a base + offset.
270 // funny base so grab the type from the index:
272 assert(base == NULL, "Memory references through narrow oops have no base");
289 // In i486.ad, indOffset32X uses base==RegI and disp==RegP,
292 // Add the offset determined by the "base", or use Type::OffsetBot.
297 const Type* t_base = base->bottom_type();
305 } else if( base == NULL && offset != 0 && offset != Type::OffsetBot ) {
315 return base;
323 const Node *base = get_base_and_disp(offset, adr_type);
328 // Direct addressing modes have no base node, simply an indirect
333 if (base == NULL) {
334 // NULL base, zero offset means no memory at all (a null pointer!)
338 // NULL base, any offset means any pointer whatever
347 // base of -1 with no particular offset means all of memory
348 if (base == NodeSentinel) return TypePtr::BOTTOM;
350 const Type* t = base->bottom_type();
352 // 32-bit unscaled narrow oop can be the base of any address expression
357 // Depending on the heap layout the cardmark base could land
359 // The sum of cardmark-base plus shift-by-9-oop lands outside
371 assert(tp->base() != Type::AnyPtr, "not a bare pointer");
489 // NOTE: If the AD file does some table base offset optimizations
528 if( t->base() == Type::Tuple ) {
548 assert(bottom_type()->base() != Type::Memory, "no other memories?");