< prev index next >

src/share/vm/opto/regmask.hpp

Print this page

        

@@ -24,10 +24,11 @@
 
 #ifndef SHARE_VM_OPTO_REGMASK_HPP
 #define SHARE_VM_OPTO_REGMASK_HPP
 
 #include "code/vmreg.hpp"
+#include "opto/opcodes.hpp"
 #include "opto/optoreg.hpp"
 
 // Some fun naming (textual) substitutions:
 //
 // RegMask::get_low_elem() ==> RegMask::find_first_elem()

@@ -192,11 +193,11 @@
   // Test for single register
   int is_bound1() const;
   // Test for a single adjacent pair
   int is_bound_pair() const;
   // Test for a single adjacent set of ideal register's size.
-  int is_bound(uint ireg) const {
+  int is_bound(Opcodes ireg) const {
     if (is_vector(ireg)) {
       if (is_bound_set(num_registers(ireg)))
         return true;
     } else if (is_bound1() || is_bound_pair()) {
       return true;

@@ -222,12 +223,12 @@
   bool is_misaligned_set(int size) const { return (int)Size()==size && !is_aligned_sets(size);}
 
   // Test for a single adjacent set
   int is_bound_set(const int size) const;
 
-  static bool is_vector(uint ireg);
-  static int num_registers(uint ireg);
+  static bool is_vector(Opcodes ireg);
+  static int num_registers(Opcodes ireg);
 
   // Fast overlap test.  Non-zero if any registers in common.
   int overlap( const RegMask &rm ) const {
     return
 #   define BODY(I) (_A[I] & rm._A[I]) |
< prev index next >