Add missing file.

src/spaces.cc

 // Copyright 2006-2010 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 781 matching lines @@
     } else {
       Address top = current_page->AllocationTop();
       if (current_page == top_page) {
         ASSERT(top == allocation_info_.top);
         // The next page will be above the allocation top.
         above_allocation_top = true;
       }
 
       HeapObjectIterator it(current_page, NULL);
       Address end_of_previous_object = current_page->ObjectAreaStart();
-      for(HeapObject* object = it.next(); object != NULL; object = it.next()) {
+      for (HeapObject* object = it.next(); object != NULL; object = it.next()) {
         ASSERT(end_of_previous_object <= object->address());
 
         // The first word should be a map, and we expect all map pointers to
         // be in map space.
         Map* map = object->map();
         ASSERT(map->IsMap());
         ASSERT(Heap::map_space()->Contains(map));
 
         // Perform space-specific object verification.
         VerifyObject(object);
 
-        if (object->IsCodeCache() && ((uint32_t*)object->address())[2] == 0x2) {
-          current_page->PrintMarkbits();
-        }
-
         // The object itself should look OK.
         object->Verify();
 
         // All the interior pointers should be contained in the heap and
         // have page regions covering intergenerational references should be
         // marked dirty.
         int size = object->Size();
         object->IterateBody(map->instance_type(), size, visitor);
 
         ASSERT(object->address() + size <= top);
@@ skipping 1660 matching lines @@
   for (HeapObject* obj = obj_it.next(); obj != NULL; obj = obj_it.next()) {
     if (obj->IsCode()) {
       Code* code = Code::cast(obj);
       code_kind_statistics[code->kind()] += code->Size();
     }
   }
 }
 #endif  // DEBUG
 
 } }  // namespace v8::internal