< prev index next >

src/share/vm/memory/padded.inline.hpp

Print this page

        

@@ -33,17 +33,17 @@
 // Creates an aligned padded array.
 // The memory can't be deleted since the raw memory chunk is not returned.
 template <class T, MEMFLAGS flags, size_t alignment>
 PaddedEnd<T>* PaddedArray<T, flags, alignment>::create_unfreeable(uint length) {
   // Check that the PaddedEnd class works as intended.
-  STATIC_ASSERT(is_size_aligned_(sizeof(PaddedEnd<T>), alignment));
+  STATIC_ASSERT(is_aligned_(sizeof(PaddedEnd<T>), alignment));
 
   // Allocate a chunk of memory large enough to allow for some alignment.
   void* chunk = AllocateHeap(length * sizeof(PaddedEnd<T, alignment>) + alignment, flags);
 
   // Make the initial alignment.
-  PaddedEnd<T>* aligned_padded_array = (PaddedEnd<T>*)align_ptr_up(chunk, alignment);
+  PaddedEnd<T>* aligned_padded_array = (PaddedEnd<T>*)align_up(chunk, alignment);
 
   // Call the default constructor for each element.
   for (uint i = 0; i < length; i++) {
     ::new (&aligned_padded_array[i]) T();
   }

@@ -52,22 +52,22 @@
 }
 
 template <class T, MEMFLAGS flags, size_t alignment>
 T** Padded2DArray<T, flags, alignment>::create_unfreeable(uint rows, uint columns, size_t* allocation_size) {
   // Calculate and align the size of the first dimension's table.
-  size_t table_size = align_size_up_(rows * sizeof(T*), alignment);
+  size_t table_size = align_up_(rows * sizeof(T*), alignment);
   // The size of the separate rows.
-  size_t row_size = align_size_up_(columns * sizeof(T), alignment);
+  size_t row_size = align_up_(columns * sizeof(T), alignment);
   // Total size consists of the indirection table plus the rows.
   size_t total_size = table_size + rows * row_size + alignment;
 
   // Allocate a chunk of memory large enough to allow alignment of the chunk.
   void* chunk = AllocateHeap(total_size, flags);
   // Clear the allocated memory.
   memset(chunk, 0, total_size);
   // Align the chunk of memory.
-  T** result = (T**)align_ptr_up(chunk, alignment);
+  T** result = (T**)align_up(chunk, alignment);
   void* data_start = (void*)((uintptr_t)result + table_size);
 
   // Fill in the row table.
   for (size_t i = 0; i < rows; i++) {
     result[i] = (T*)((uintptr_t)data_start + i * row_size);

@@ -85,9 +85,9 @@
   // Allocate a chunk of memory large enough to allow for some alignment.
   void* chunk = AllocateHeap(length * sizeof(T) + alignment, flags);
 
   memset(chunk, 0, length * sizeof(T) + alignment);
 
-  return (T*)align_ptr_up(chunk, alignment);
+  return (T*)align_up(chunk, alignment);
 }
 
 #endif // SHARE_VM_MEMORY_PADDED_INLINE_HPP
< prev index next >