Changed size of pointers stored as numbers to intptr_t in spaces.h.

src/spaces.cc

 // 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 793 matching lines @@
   }
   if (!from_space_.Setup(start + maximum_capacity_,
                          capacity_,
                          maximum_capacity_)) {
     return false;
   }
 
   start_ = start;
   address_mask_ = ~(size - 1);
   object_mask_ = address_mask_ | kHeapObjectTag;
-  object_expected_ = reinterpret_cast<uint32_t>(start) | kHeapObjectTag;
+  object_expected_ = reinterpret_cast<uintptr_t>(start) | kHeapObjectTag;
 
   allocation_info_.top = to_space_.low();
   allocation_info_.limit = to_space_.high();
   mc_forwarding_info_.top = NULL;
   mc_forwarding_info_.limit = NULL;
 
   ASSERT_SEMISPACE_ALLOCATION_INFO(allocation_info_, to_space_);
   return true;
 }
 
@@ skipping 138 matching lines @@
   capacity_ = initial_capacity;
   maximum_capacity_ = maximum_capacity;
 
   if (!MemoryAllocator::CommitBlock(start, capacity_, executable())) {
     return false;
   }
 
   start_ = start;
   address_mask_ = ~(maximum_capacity - 1);
   object_mask_ = address_mask_ | kHeapObjectTag;
-  object_expected_ = reinterpret_cast<uint32_t>(start) | kHeapObjectTag;
+  object_expected_ = reinterpret_cast<uintptr_t>(start) | kHeapObjectTag;
 
   age_mark_ = start_;
   return true;
 }
 
 
 void SemiSpace::TearDown() {
   start_ = NULL;
   capacity_ = 0;
 }
@@ skipping 899 matching lines @@
 // to the pointers starting at object_p.  The allocation_top is an object
 // pointer which should not be read past.  This is important for large object
 // pages, where some bits in the remembered set range do not correspond to
 // allocated addresses.
 static void PrintRSetRange(Address start, Address end, Object** object_p,
                            Address allocation_top) {
   Address rset_address = start;
 
   // If the range starts on on odd numbered word (eg, for large object extra
   // remembered set ranges), print some spaces.
-  if ((reinterpret_cast<uint32_t>(start) / kIntSize) % 2 == 1) {
+  if ((reinterpret_cast<uintptr_t>(start) / kIntSize) % 2 == 1) {
     PrintF("                                    ");
   }
 
   // Loop over all the words in the range.
   while (rset_address < end) {
     uint32_t rset_word = Memory::uint32_at(rset_address);
     int bit_position = 0;
 
     // Loop over all the bits in the word.
     while (bit_position < kBitsPerInt) {
@@ skipping 18 matching lines @@
       if (bit_position % 8 == 7 && bit_position != (kBitsPerInt - 1)) {
         PrintF(" ");
       }
 
       // Advance to next bit.
       bit_position++;
       object_p++;
     }
 
     // Print a newline after every odd numbered word, otherwise a space.
-    if ((reinterpret_cast<uint32_t>(rset_address) / kIntSize) % 2 == 1) {
+    if ((reinterpret_cast<uintptr_t>(rset_address) / kIntSize) % 2 == 1) {
       PrintF("\n");
     } else {
       PrintF(" ");
     }
 
     // Advance to next remembered set word.
     rset_address += kIntSize;
   }
 }
 
@@ skipping 647 matching lines @@
                      reinterpret_cast<Object**>(object->address()
                                                 + Page::kObjectAreaSize),
                      allocation_top);
       PrintF("\n");
     }
   }
 }
 #endif  // DEBUG
 
 } }  // namespace v8::internal