src/share/vm/utilities/hashtable.hpp

*** 299,310 ****
      : Hashtable<T, F>(table_size, entry_size, buckets, number_of_entries) { }
  
  
    // Function to move these elements into the new table.
    void move_to(RehashableHashtable<T, F>* new_table);
!   static bool use_alternate_hashcode()  { return _seed != 0; }
!   static juint seed()                    { return _seed; }
  
    static int literal_size(Symbol *symbol);
    static int literal_size(oop oop);
  
    // The following two are currently not used, but are needed anyway because some
--- 299,310 ----
      : Hashtable<T, F>(table_size, entry_size, buckets, number_of_entries) { }
  
  
    // Function to move these elements into the new table.
    void move_to(RehashableHashtable<T, F>* new_table);
!   static bool use_alternate_hashcode();
!   static juint seed();
  
    static int literal_size(Symbol *symbol);
    static int literal_size(oop oop);
  
    // The following two are currently not used, but are needed anyway because some
*** 318,327 ****
--- 318,330 ----
  
   private:
    static juint _seed;
  };
  
+ template <class T, MEMFLAGS F> juint RehashableHashtable<T, F>::_seed = 0;
+ template <class T, MEMFLAGS F> juint RehashableHashtable<T, F>::seed() { return _seed; };
+ template <class T, MEMFLAGS F> bool  RehashableHashtable<T, F>::use_alternate_hashcode() { return _seed != 0; };
  
  // Versions of hashtable where two handles are used to compute the index.
  
  template <class T, MEMFLAGS F> class TwoOopHashtable : public Hashtable<T, F> {
    friend class VMStructs;