Partial ia32 implementation of optimized try/catch (by Kevin Millikin)

src/heap.cc

 // Copyright 2012 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 6569 matching lines @@
     List<HeapObject*> marking_stack_;
   };
 
   void MarkReachableObjects() {
     Heap* heap = Isolate::Current()->heap();
     MarkingVisitor visitor;
     heap->IterateRoots(&visitor, VISIT_ALL);
     visitor.TransitiveClosure();
   }
 
-  AssertNoAllocation no_alloc;
+  AssertNoAllocation no_alloc_;
 };
 
 
 HeapIterator::HeapIterator()
     : filtering_(HeapIterator::kNoFiltering),
       filter_(NULL) {
   Init();
 }
 
 
@@ skipping 720 matching lines @@
       static_cast<int>(object_sizes_last_time_[index]));
   FIXED_ARRAY_SUB_INSTANCE_TYPE_LIST(ADJUST_LAST_TIME_OBJECT_COUNT)
 #undef ADJUST_LAST_TIME_OBJECT_COUNT
 
   memcpy(object_counts_last_time_, object_counts_, sizeof(object_counts_));
   memcpy(object_sizes_last_time_, object_sizes_, sizeof(object_sizes_));
   ClearObjectStats();
 }
 
 } }  // namespace v8::internal