Lines Matching refs:at
356 // Already assumes that 'dom' is available at 'sub', and that 'sub'
414 Node* n = dom_list.at(next);
575 // (b) at this point, if we are not looking at a store initializing
718 // the regular oop, some are the CastPP of the oop, all merge at Phi's which
951 // will change the graph shape in a way which makes memory alive twice at the
1148 // Fetch the box object at the base of the array and get its value
1575 // Different array types begin at slightly different offsets (12 vs. 16).
1677 // is known at compile time (the type is "exact" or "precise").
1712 // We can still check if we are loading from the primary_supers array at a
1913 Node *LoadKlassNode::make( PhaseGVN& gvn, Node *mem, Node *adr, const TypePtr* at, const TypeKlassPtr *tk ) {
1921 Node* load_klass = gvn.transform(new (C) LoadNKlassNode(ctl, mem, adr, at, tk->make_narrowoop()));
1926 return new (C) LoadKlassNode(ctl, mem, adr, at, tk);
1999 if (tary_klass != NULL // can be NULL when at BOTTOM or TOP
2304 // Looking at a dead closed cycle of memory?
2314 // For example, 'mem' might be the final state at a conditional return.
2315 // Or, 'mem' might be used by some node which is live at the same time
2577 LoadStoreNode::LoadStoreNode( Node *c, Node *mem, Node *adr, Node *val, const TypePtr* at, const Type* rt, uint required )
2580 _adr_type(at)
2650 const Type* at = phase->type(adr);
2651 if( at==Type::TOP ) return NULL;
2652 const TypePtr* atp = at->isa_ptr();
2864 // if the Precedent is a decodeN and its input (a Load) is used at more than one place,
2960 // The first one is at in(RawStores), the last at in(req()-1).
2970 // may also be created at that point to represent any required zeroing.
3177 // We are going to look at each use of the memory state following
3187 Node *m = mems.at(next);
3315 // Look for a captured store which initializes at the offset 'start'
3328 Node* st = in(i); // here is the store at this position
3334 // Create, as a raw pointer, an address within my new object at 'offset'.
3395 // at the same offset, or perhaps new_st might have disappeared,
3793 // Or, don't zero at all, if we are already in that word.
3875 return true; // stores could be anything at this point
3883 tty->print_cr("*** bad store offset at %d: %d > %d", i, last_off, st_off);
3923 // the wide input. That is, wide memory states arriving at narrow merge inputs
3957 // a MergeMem is variable, and may be extended at any time to accommodate new
3958 // memory states at larger alias indexes. When merges grow, they are of course
3972 // the memory state for alias type <N>, or (if there is no particular slice at <N>,
3977 // %%%% We may get rid of base_memory as a separate accessor at some point; it isn't
4061 // relative to the "in(Bot)". Since we are patching both at the same time,
4085 // Look carefully at the base node if it is a phi.
4101 // incomplete phi; do not look at it yet!
4115 // Look at each slice.
4139 // a mergemem can be left looking at itself. This simply means