Support for MIPS in architecture independent files....

src/spaces-inl.h

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 265 matching lines @@
 }
 
 
 // Try linear allocation in the page of alloc_info's allocation top.  Does
 // not contain slow case logic (eg, move to the next page or try free list
 // allocation) so it can be used by all the allocation functions and for all
 // the paged spaces.
 HeapObject* PagedSpace::AllocateLinearly(AllocationInfo* alloc_info,
                                          int size_in_bytes) {
   Address current_top = alloc_info->top;
+//// TODO(MIPS.6)
+//#ifdef V8_TARGET_ARCH_MIPS
+//  Address new_top = current_top + RoundUp(size_in_bytes,8);
+//#else
   Address new_top = current_top + size_in_bytes;
+//#endif
+
   if (new_top > alloc_info->limit) return NULL;
 
   alloc_info->top = new_top;
   ASSERT(alloc_info->VerifyPagedAllocation());
   accounting_stats_.AllocateBytes(size_in_bytes);
   return HeapObject::FromAddress(current_top);
 }
 
 
 // Raw allocation.
@@ skipping 41 matching lines @@
 int LargeObjectSpace::ExtraRSetBytesFor(int object_size) {
   int extra_rset_bits =
       RoundUp((object_size - Page::kObjectAreaSize) / kPointerSize,
               kBitsPerInt);
   return extra_rset_bits / kBitsPerByte;
 }
 
 
 Object* NewSpace::AllocateRawInternal(int size_in_bytes,
                                       AllocationInfo* alloc_info) {
-  Address new_top = alloc_info->top + size_in_bytes;
+
+  Address current_top = alloc_info->top;
+//// TODO(MIPS.6)
+//#ifdef V8_TARGET_ARCH_MIPS
+//  Address new_top = current_top + RoundUp(size_in_bytes,8);
+//#else
+  Address new_top = current_top + size_in_bytes;
+//#endif
+
   if (new_top > alloc_info->limit) return Failure::RetryAfterGC(size_in_bytes);
 
   Object* obj = HeapObject::FromAddress(alloc_info->top);
   alloc_info->top = new_top;
 #ifdef DEBUG
   SemiSpace* space =
       (alloc_info == &allocation_info_) ? &to_space_ : &from_space_;
   ASSERT(space->low() <= alloc_info->top
          && alloc_info->top <= space->high()
          && alloc_info->limit == space->high());
 #endif
   return obj;
 }
 
 
 bool FreeListNode::IsFreeListNode(HeapObject* object) {
   return object->map() == Heap::raw_unchecked_byte_array_map()
       || object->map() == Heap::raw_unchecked_one_pointer_filler_map()
       || object->map() == Heap::raw_unchecked_two_pointer_filler_map();
 }
 
 } }  // namespace v8::internal
 
 #endif  // V8_SPACES_INL_H_