OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 10 matching lines...) Expand all Loading... |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #include "v8.h" | 28 #include "v8.h" |
29 | 29 |
30 #include "zone-inl.h" | 30 #include "zone-inl.h" |
| 31 #include "splay-tree-inl.h" |
31 | 32 |
32 namespace v8 { | 33 namespace v8 { |
33 namespace internal { | 34 namespace internal { |
34 | 35 |
35 | 36 |
36 Address Zone::position_ = 0; | 37 Address Zone::position_ = 0; |
37 Address Zone::limit_ = 0; | 38 Address Zone::limit_ = 0; |
38 int Zone::zone_excess_limit_ = 256 * MB; | 39 int Zone::zone_excess_limit_ = 256 * MB; |
39 int Zone::segment_bytes_allocated_ = 0; | 40 int Zone::segment_bytes_allocated_ = 0; |
40 | 41 |
(...skipping 143 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
184 // Recompute 'top' and 'limit' based on the new segment. | 185 // Recompute 'top' and 'limit' based on the new segment. |
185 Address result = RoundUp(segment->start(), kAlignment); | 186 Address result = RoundUp(segment->start(), kAlignment); |
186 position_ = result + size; | 187 position_ = result + size; |
187 limit_ = segment->end(); | 188 limit_ = segment->end(); |
188 ASSERT(position_ <= limit_); | 189 ASSERT(position_ <= limit_); |
189 return result; | 190 return result; |
190 } | 191 } |
191 | 192 |
192 | 193 |
193 } } // namespace v8::internal | 194 } } // namespace v8::internal |
OLD | NEW |