hotspot/src/share/vm/opto/graphKit.hpp
changeset 29081 c61eb4914428
parent 27921 4b932655e504
child 29083 5e7bce2712ac
equal deleted inserted replaced
29080:a16b0d9a08f5 29081:c61eb4914428
     1 /*
     1 /*
     2  * Copyright (c) 2001, 2013, Oracle and/or its affiliates. All rights reserved.
     2  * Copyright (c) 2001, 2015, Oracle and/or its affiliates. All rights reserved.
     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     4  *
     4  *
     5  * This code is free software; you can redistribute it and/or modify it
     5  * This code is free software; you can redistribute it and/or modify it
     6  * under the terms of the GNU General Public License version 2 only, as
     6  * under the terms of the GNU General Public License version 2 only, as
     7  * published by the Free Software Foundation.
     7  * published by the Free Software Foundation.
   102   Node* makecon(const Type *t)  const { return _gvn.makecon(t); }
   102   Node* makecon(const Type *t)  const { return _gvn.makecon(t); }
   103   Node* zerocon(BasicType bt)   const { return _gvn.zerocon(bt); }
   103   Node* zerocon(BasicType bt)   const { return _gvn.zerocon(bt); }
   104   // (See also macro MakeConX in type.hpp, which uses intcon or longcon.)
   104   // (See also macro MakeConX in type.hpp, which uses intcon or longcon.)
   105 
   105 
   106   // Helper for byte_map_base
   106   // Helper for byte_map_base
   107   Node* byte_map_base_node() {
   107   Node* byte_map_base_node();
   108     // Get base of card map
       
   109     CardTableModRefBS* ct = (CardTableModRefBS*)(Universe::heap()->barrier_set());
       
   110     assert(sizeof(*ct->byte_map_base) == sizeof(jbyte), "adjust users of this code");
       
   111     if (ct->byte_map_base != NULL) {
       
   112       return makecon(TypeRawPtr::make((address)ct->byte_map_base));
       
   113     } else {
       
   114       return null();
       
   115     }
       
   116   }
       
   117 
   108 
   118   jint  find_int_con(Node* n, jint value_if_unknown) {
   109   jint  find_int_con(Node* n, jint value_if_unknown) {
   119     return _gvn.find_int_con(n, value_if_unknown);
   110     return _gvn.find_int_con(n, value_if_unknown);
   120   }
   111   }
   121   jlong find_long_con(Node* n, jlong value_if_unknown) {
   112   jlong find_long_con(Node* n, jlong value_if_unknown) {