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 1436 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1447 delete mutex_; | 1447 delete mutex_; |
1448 } | 1448 } |
1449 | 1449 |
1450 intptr_t Concatenate(FreeListCategory* category); | 1450 intptr_t Concatenate(FreeListCategory* category); |
1451 | 1451 |
1452 void Reset(); | 1452 void Reset(); |
1453 | 1453 |
1454 void Free(FreeListNode* node, int size_in_bytes); | 1454 void Free(FreeListNode* node, int size_in_bytes); |
1455 | 1455 |
1456 FreeListNode* PickNodeFromList(int *node_size); | 1456 FreeListNode* PickNodeFromList(int *node_size); |
1457 FreeListNode* PickNodeFromList(int size_in_bytes, int *node_size); | |
1458 | 1457 |
1459 intptr_t EvictFreeListItemsInList(Page* p); | 1458 intptr_t EvictFreeListItemsInList(Page* p); |
1460 | 1459 |
1461 void RepairFreeList(Heap* heap); | 1460 void RepairFreeList(Heap* heap); |
1462 | 1461 |
1463 FreeListNode** GetTopAddress() { return &top_; } | 1462 FreeListNode** GetTopAddress() { return &top_; } |
1464 FreeListNode* top() const { return top_; } | 1463 FreeListNode* top() const { return top_; } |
1465 void set_top(FreeListNode* top) { top_ = top; } | 1464 void set_top(FreeListNode* top) { top_ = top; } |
1466 | 1465 |
1467 FreeListNode** GetEndAddress() { return &end_; } | 1466 FreeListNode** GetEndAddress() { return &end_; } |
(...skipping 1405 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2873 } | 2872 } |
2874 // Must be small, since an iteration is used for lookup. | 2873 // Must be small, since an iteration is used for lookup. |
2875 static const int kMaxComments = 64; | 2874 static const int kMaxComments = 64; |
2876 }; | 2875 }; |
2877 #endif | 2876 #endif |
2878 | 2877 |
2879 | 2878 |
2880 } } // namespace v8::internal | 2879 } } // namespace v8::internal |
2881 | 2880 |
2882 #endif // V8_SPACES_H_ | 2881 #endif // V8_SPACES_H_ |
OLD | NEW |