Perform TODO(gc) cleanup for TODO-lockdown.

src/heap.h

 // Copyright 2011 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 885 matching lines @@
   // Returns whether there is a chance that another major GC could
   // collect more garbage.
   bool CollectGarbage(AllocationSpace space, GarbageCollector collector);
 
   // Performs garbage collection operation.
   // Returns whether there is a chance that another major GC could
   // collect more garbage.
   inline bool CollectGarbage(AllocationSpace space);
 
   static const int kNoGCFlags = 0;
-  // TODO(gc) we are ignoring this flag
   static const int kForceCompactionMask = 1;
   static const int kMakeHeapIterableMask = 2;
 
   // Performs a full garbage collection.  If (flags & kForceCompactionMask) is
   // non-zero then force compaction.  If (flags & kMakeHeapIterableMask) is non-
   // zero, then the slower precise sweeper is used, which leaves the heap in a
   // state where we can iterate over the heap visiting all objects.
   void CollectAllGarbage(int flags);
 
   // Ensure that we have swept all spaces in such a way that we can iterate
@@ skipping 43 matching lines @@
     ASSERT((callback == NULL) ^ (global_gc_prologue_callback_ == NULL));
     global_gc_prologue_callback_ = callback;
   }
   void SetGlobalGCEpilogueCallback(GCCallback callback) {
     ASSERT((callback == NULL) ^ (global_gc_epilogue_callback_ == NULL));
     global_gc_epilogue_callback_ = callback;
   }
 
   // Heap root getters.  We have versions with and without type::cast() here.
   // You can't use type::cast during GC because the assert fails.
-  // TODO(gc): Try removing the unchecked accessors, now that GC marking does
+  // TODO(1490): Try removing the unchecked accessors, now that GC marking does
   // not corrupt the stack.
 #define ROOT_ACCESSOR(type, name, camel_name)                                  \
   type* name() {                                                               \
     return type::cast(roots_[k##camel_name##RootIndex]);                       \
   }                                                                            \
   type* raw_unchecked_##name() {                                               \
     return reinterpret_cast<type*>(roots_[k##camel_name##RootIndex]);          \
   }
   ROOT_LIST(ROOT_ACCESSOR)
 #undef ROOT_ACCESSOR
@@ skipping 374 matching lines @@
   }
 
   StoreBuffer* store_buffer() {
     return &store_buffer_;
   }
 
   Marking* marking() {
     return &marking_;
   }
 
-  // TODO(gc) Rename to IncrementalMarker after merge.
   IncrementalMarking* incremental_marking() {
     return &incremental_marking_;
   }
 
   ExternalStringTable* external_string_table() {
     return &external_string_table_;
   }
 
   // Returns the current sweep generation.
   int sweep_generation() {
@@ skipping 1047 matching lines @@
 
   DISALLOW_IMPLICIT_CONSTRUCTORS(PathTracer);
 };
 #endif  // DEBUG || LIVE_OBJECT_LIST
 
 } }  // namespace v8::internal
 
 #undef HEAP
 
 #endif  // V8_HEAP_H_