| 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 36 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 47 // Used to implement the write barrier by collecting addresses of pointers | 47 // Used to implement the write barrier by collecting addresses of pointers |
| 48 // between spaces. | 48 // between spaces. |
| 49 class StoreBuffer { | 49 class StoreBuffer { |
| 50 public: | 50 public: |
| 51 explicit StoreBuffer(Heap* heap); | 51 explicit StoreBuffer(Heap* heap); |
| 52 | 52 |
| 53 static void StoreBufferOverflow(Isolate* isolate); | 53 static void StoreBufferOverflow(Isolate* isolate); |
| 54 | 54 |
| 55 inline Address TopAddress(); | 55 inline Address TopAddress(); |
| 56 | 56 |
| 57 void Setup(); | 57 void SetUp(); |
| 58 void TearDown(); | 58 void TearDown(); |
| 59 | 59 |
| 60 // This is used by the mutator to enter addresses into the store buffer. | 60 // This is used by the mutator to enter addresses into the store buffer. |
| 61 inline void Mark(Address addr); | 61 inline void Mark(Address addr); |
| 62 | 62 |
| 63 // This is used by the heap traversal to enter the addresses into the store | 63 // This is used by the heap traversal to enter the addresses into the store |
| 64 // buffer that should still be in the store buffer after GC. It enters | 64 // buffer that should still be in the store buffer after GC. It enters |
| 65 // addresses directly into the old buffer because the GC starts by wiping the | 65 // addresses directly into the old buffer because the GC starts by wiping the |
| 66 // old buffer and thereafter only visits each cell once so there is no need | 66 // old buffer and thereafter only visits each cell once so there is no need |
| 67 // to attempt to remove any dupes. During the first part of a GC we | 67 // to attempt to remove any dupes. During the first part of a GC we |
| (...skipping 178 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 246 } | 246 } |
| 247 | 247 |
| 248 private: | 248 private: |
| 249 StoreBuffer* store_buffer_; | 249 StoreBuffer* store_buffer_; |
| 250 bool stored_state_; | 250 bool stored_state_; |
| 251 }; | 251 }; |
| 252 | 252 |
| 253 } } // namespace v8::internal | 253 } } // namespace v8::internal |
| 254 | 254 |
| 255 #endif // V8_STORE_BUFFER_H_ | 255 #endif // V8_STORE_BUFFER_H_ |
| OLD | NEW |