| Index: src/heap/spaces.h
|
| diff --git a/src/heap/spaces.h b/src/heap/spaces.h
|
| index 5103cbf11ef5c5d27836200c0feac34bc7ecbe48..d7f718c62b786541f29d23ee34b1e8ae574448e4 100644
|
| --- a/src/heap/spaces.h
|
| +++ b/src/heap/spaces.h
|
| @@ -1914,12 +1914,6 @@ class PagedSpace : public Space {
|
| inline bool Contains(Object* o);
|
| bool ContainsSlow(Address addr);
|
|
|
| - // Given an address occupied by a live object, return that object if it is
|
| - // in this space, or a Smi if it is not. The implementation iterates over
|
| - // objects in the page containing the address, the cost is linear in the
|
| - // number of objects in the page. It may be slow.
|
| - Object* FindObject(Address addr);
|
| -
|
| // During boot the free_space_map is created, and afterwards we may need
|
| // to write it into the free list nodes that were already created.
|
| void RepairFreeListsAfterDeserialization();
|
|
|