src/share/vm/gc/shared/taskqueue.inline.hpp

rev 10387 : 8151436: Leaner ArrayAllocator and BitMaps
Reviewed-by: tschatzl, pliden, kbarrett

*** 42,57 ****
    }
  }
  
  template<class E, MEMFLAGS F, unsigned int N>
  inline void GenericTaskQueue<E, F, N>::initialize() {
!   _elems = _array_allocator.allocate(N);
  }
  
  template<class E, MEMFLAGS F, unsigned int N>
  inline GenericTaskQueue<E, F, N>::~GenericTaskQueue() {
!   FREE_C_HEAP_ARRAY(E, _elems);
  }
  
  template<class E, MEMFLAGS F, unsigned int N>
  bool GenericTaskQueue<E, F, N>::push_slow(E t, uint dirty_n_elems) {
    if (dirty_n_elems == N - 1) {
--- 42,58 ----
    }
  }
  
  template<class E, MEMFLAGS F, unsigned int N>
  inline void GenericTaskQueue<E, F, N>::initialize() {
!   _elems = ArrayAllocator<E, F>::allocate(N);
  }
  
  template<class E, MEMFLAGS F, unsigned int N>
  inline GenericTaskQueue<E, F, N>::~GenericTaskQueue() {
!   assert(false, "This code is currently never called");
!   ArrayAllocator<E, F>::free(const_cast<E*>(_elems), N);
  }
  
  template<class E, MEMFLAGS F, unsigned int N>
  bool GenericTaskQueue<E, F, N>::push_slow(E t, uint dirty_n_elems) {
    if (dirty_n_elems == N - 1) {