Cross Reference: /openjdk7/hotspot/src/share/vm/opto/memnode.cpp

Lines Matching defs:make
644       // (We make an exception for TypeRawPtr::BOTTOM, which is a bit bucket.)
709 // going away in this pass and we need to make this memory op depend on the
891 //----------------------------LoadNode::make-----------------------------------
893 Node *LoadNode::make( PhaseGVN& gvn, Node *ctl, Node *mem, Node *adr, const TypePtr* adr_type, const Type *rt, BasicType bt ) {
949 // This routine exists to make sure this set of tests is done the same
950 // everywhere.  We need to make a coordinated change: first LoadNode::Ideal
1482   // Check for prior store with a different base or offset; make Load
1519     return TypeInt::make(klass->modifier_flags());
1525     return TypeInt::make(klass->access_flags());
1530     return TypeInt::make(klass->layout_helper());
1624             return TypeInt::make(constant.as_int());
1683         return TypeInt::make(klass->super_check_offset());
1693         return ss ? TypeKlassPtr::make(ss) : TypePtr::NULL_PTR;
1702         return TypeInstPtr::make(klass->as_array_klass()->component_mirror());
1708         return TypeInstPtr::make(klass->java_mirror());
1730           return ss ? TypeKlassPtr::make(ss) : TypePtr::NULL_PTR;
1750       return TypeInt::make(min_size, max_jint, Type::WidenMin);
1813     return TypeInt::make((con << 24) >> 24);
1843     return TypeInt::make(con & 0xFF);
1873     return TypeInt::make(con & 0xFFFF);
1905     return TypeInt::make((con << 16) >> 16);
1911 //----------------------------LoadKlassNode::make------------------------------
1913 Node *LoadKlassNode::make( PhaseGVN& gvn, Node *mem, Node *adr, const TypePtr* at, const TypeKlassPtr *tk ) {
1960           return TypeKlassPtr::make(ciArrayKlass::make(t));
1967         return TypeKlassPtr::make(t->as_klass());
1975         return TypeKlassPtr::make(ik);
1987         return TypeKlassPtr::make(ik);
1991       return TypeKlassPtr::make(TypePtr::NotNull, ik, 0/*offset*/);
2002         return TypeKlassPtr::make(tary_klass);
2020             return TypeKlassPtr::make(ak);
2023         return TypeKlassPtr::make(TypePtr::NotNull, ak, 0/*offset*/);
2027         return TypeKlassPtr::make(ak); // These are always precise
2043       // return TypeKlassPtr::make(TypePtr::Constant, elem, 0);
2047       return TypeKlassPtr::make(tkls->ptr(), elem, 0/*offset*/);
2054       return sup ? TypeKlassPtr::make(sup) : TypePtr::NULL_PTR;
2233 //---------------------------StoreNode::make-----------------------------------
2235 StoreNode* StoreNode::make( PhaseGVN& gvn, Node* ctl, Node* mem, Node* adr, const TypePtr* adr_type, Node* val, BasicType bt ) {
2343         mem = MergeMemNode::make(phase->C, mem);
2711     mem = StoreNode::make(*phase, ctl, mem, adr, atp, phase->zerocon(T_INT), T_INT);
2772     mem = StoreNode::make(*phase, ctl, mem, adr, atp, phase->zerocon(T_INT), T_INT);
2833 //------------------------------make-------------------------------------------
2834 MemBarNode* MemBarNode::make(Compile* C, int opcode, int atp, Node* pn) {
3178     // the allocation to make sure nothing reads the memory that the
3613       st[nst++] = StoreNode::make(*phase, ctl, zmem, adr, atp,
3620         st[nst++] = StoreNode::make(*phase, ctl, zmem, adr, atp,
3628         st[nst++] = StoreNode::make(*phase, ctl, zmem, adr, atp,
3717 // Linearize the stores by ascending offset, to make memory
4028 MergeMemNode* MergeMemNode::make(Compile* C, Node* mem) {
4340     // make sure the stored slice is sane