Mercurial > hg > truffle

comparison src/share/vm/opto/graphKit.hpp @ 570:dca06e7f503d

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge
author kvn
date Tue, 17 Feb 2009 14:30:24 -0800
parents 1b9fc6e3171b
children 0fbdb4381b99
comparison
equal deleted inserted replaced
549:fe3d7c11b4b7 570:dca06e7f503d
81 Node* longcon(jlong con) const { return _gvn.longcon(con); } 81 Node* longcon(jlong con) const { return _gvn.longcon(con); }
82 Node* makecon(const Type *t) const { return _gvn.makecon(t); } 82 Node* makecon(const Type *t) const { return _gvn.makecon(t); }
83 Node* zerocon(BasicType bt) const { return _gvn.zerocon(bt); } 83 Node* zerocon(BasicType bt) const { return _gvn.zerocon(bt); }
84 // (See also macro MakeConX in type.hpp, which uses intcon or longcon.) 84 // (See also macro MakeConX in type.hpp, which uses intcon or longcon.)
85 85
86 // Helper for byte_map_base
87 Node* byte_map_base_node() {
88 // Get base of card map
89 CardTableModRefBS* ct = (CardTableModRefBS*)(Universe::heap()->barrier_set());
90 assert(sizeof(*ct->byte_map_base) == sizeof(jbyte), "adjust users of this code");
91 if (ct->byte_map_base != NULL) {
92 return makecon(TypeRawPtr::make((address)ct->byte_map_base));
93 } else {
94 return null();
95 }
96 }
97
86 jint find_int_con(Node* n, jint value_if_unknown) { 98 jint find_int_con(Node* n, jint value_if_unknown) {
87 return _gvn.find_int_con(n, value_if_unknown); 99 return _gvn.find_int_con(n, value_if_unknown);
88 } 100 }
89 jlong find_long_con(Node* n, jlong value_if_unknown) { 101 jlong find_long_con(Node* n, jlong value_if_unknown) {
90 return _gvn.find_long_con(n, value_if_unknown); 102 return _gvn.find_long_con(n, value_if_unknown);