OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 !heap_->old_data_space()->Contains(addr) && | 60 !heap_->old_data_space()->Contains(addr) && |
61 !heap_->new_space()->Contains(addr)); | 61 !heap_->new_space()->Contains(addr)); |
62 Address* top = old_top_; | 62 Address* top = old_top_; |
63 *top++ = addr; | 63 *top++ = addr; |
64 old_top_ = top; | 64 old_top_ = top; |
65 old_buffer_is_sorted_ = false; | 65 old_buffer_is_sorted_ = false; |
66 old_buffer_is_filtered_ = false; | 66 old_buffer_is_filtered_ = false; |
67 if (top >= old_limit_) { | 67 if (top >= old_limit_) { |
68 ASSERT(callback_ != NULL); | 68 ASSERT(callback_ != NULL); |
69 (*callback_)(heap_, | 69 (*callback_)(heap_, |
70 MemoryChunk::FromAnyPointerAddress(addr), | 70 MemoryChunk::FromAnyPointerAddress(heap_, addr), |
71 kStoreBufferFullEvent); | 71 kStoreBufferFullEvent); |
72 } | 72 } |
73 } | 73 } |
74 } | 74 } |
75 | 75 |
76 | 76 |
77 void StoreBuffer::ClearDeadObject(HeapObject* object) { | 77 void StoreBuffer::ClearDeadObject(HeapObject* object) { |
78 Address& map_field = Memory::Address_at(object->address()); | 78 Address& map_field = Memory::Address_at(object->address()); |
79 if (heap_->map_space()->Contains(map_field)) { | 79 if (heap_->map_space()->Contains(map_field)) { |
80 map_field = NULL; | 80 map_field = NULL; |
81 } | 81 } |
82 } | 82 } |
83 | 83 |
84 | 84 |
85 } } // namespace v8::internal | 85 } } // namespace v8::internal |
86 | 86 |
87 #endif // V8_STORE_BUFFER_INL_H_ | 87 #endif // V8_STORE_BUFFER_INL_H_ |
OLD | NEW |