15821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Copyright (c) 2011, Google Inc. 25821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// All rights reserved. 35821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 45821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Redistribution and use in source and binary forms, with or without 55821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// modification, are permitted provided that the following conditions are 65821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// met: 75821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 85821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Redistributions of source code must retain the above copyright 95821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// notice, this list of conditions and the following disclaimer. 105821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Redistributions in binary form must reproduce the above 115821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// copyright notice, this list of conditions and the following disclaimer 125821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// in the documentation and/or other materials provided with the 135821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// distribution. 145821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// * Neither the name of Google Inc. nor the names of its 155821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// contributors may be used to endorse or promote products derived from 165821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// this software without specific prior written permission. 175821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 185821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 195821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 205821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 215821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 225821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 235821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 245821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 255821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 265821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 275821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 285821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 295821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 305821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// --- 315821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Author: Rebecca Shapiro <bxx@google.com> 325821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// 335821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// This file contains declarations of functions that implement doubly 345821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// linked lists and definitions of functions that implement singly 355821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// linked lists. It also contains macros to tell the SizeMap class 365821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// how much space a node in the freelist needs so that SizeMap can 375821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// create large enough size classes. 385821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 395821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#ifndef TCMALLOC_FREE_LIST_H_ 405821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#define TCMALLOC_FREE_LIST_H_ 415821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 425821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include <stddef.h> 435821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "internal_logging.h" 445821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#include "linked_list.h" 452a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)#include "system-alloc.h" 465821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 475821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Remove to enable singly linked lists (the default for open source tcmalloc). 485821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#define TCMALLOC_USE_DOUBLYLINKED_FREELIST 495821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 505821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)namespace tcmalloc { 515821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 525821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#if defined(TCMALLOC_USE_DOUBLYLINKED_FREELIST) 535821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 545821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// size class information for common.h. 555821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static const bool kSupportsDoublyLinkedList = true; 565821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 575821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)void FL_PopRange(void **head, int n, void **start, void **end); 585821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)void FL_PushRange(void **head, void *start, void *end); 595821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)size_t FL_Size(void *head); 605821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 612a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)template <typename T> inline void FL_EqualityCheck(const T& v0, 622a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) const T& v1, 632a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) const char* file, 642a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) int line) { 652a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) if (v0 != v1) Log(kCrash, file, line, "Memory corruption detected."); 662a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 672a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 682a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void EnsureNonLoop(void* node, void* next) { 692a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) // We only have time to do minimal checking. We don't traverse the list, but 702a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) // only look for an immediate loop (cycle back to ourself). 712a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) if (node != next) return; 722a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) Log(kCrash, __FILE__, __LINE__, "Circular loop in list detected: ", next); 732a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 742a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 752a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void* MaskPtr(void* p) { 762a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) // Maximize ASLR entropy and guarantee the result is an invalid address. 772a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) const uintptr_t mask = ~(reinterpret_cast<uintptr_t>(TCMalloc_SystemAlloc) 782a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) >> 13); 792a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(p) ^ mask); 802a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 812a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 822a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void* UnmaskPtr(void* p) { 832a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return MaskPtr(p); 842a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 852a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 862a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// Returns value of the |previous| pointer w/out running a sanity 872a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// check. 882a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void *FL_Previous_No_Check(void *t) { 892a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return UnmaskPtr(reinterpret_cast<void**>(t)[1]); 902a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 912a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 922a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// Returns value of the |next| pointer w/out running a sanity check. 932a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void *FL_Next_No_Check(void *t) { 942a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return UnmaskPtr(reinterpret_cast<void**>(t)[0]); 952a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 962a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 972a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void *FL_Previous(void *t) { 982a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) void *previous = FL_Previous_No_Check(t); 992a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) if (previous) { 1002a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_EqualityCheck(FL_Next_No_Check(previous), t, __FILE__, __LINE__); 1012a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) } 1022a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return previous; 1032a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1042a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1052a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void FL_SetPrevious(void *t, void *n) { 1062a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) EnsureNonLoop(t, n); 1072a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) reinterpret_cast<void**>(t)[1] = MaskPtr(n); 1082a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1092a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1102a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void FL_SetNext(void *t, void *n) { 1112a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) EnsureNonLoop(t, n); 1122a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) reinterpret_cast<void**>(t)[0] = MaskPtr(n); 1132a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1142a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1152a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void *FL_Next(void *t) { 1162a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) void *next = FL_Next_No_Check(t); 1172a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) if (next) { 1182a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_EqualityCheck(FL_Previous_No_Check(next), t, __FILE__, __LINE__); 1192a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) } 1202a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return next; 1212a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1222a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1232a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// Pops the top element off the linked list whose first element is at 1242a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// |*list|, and updates |*list| to point to the next element in the 1252a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// list. Returns the address of the element that was removed from the 1262a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// linked list. |list| must not be NULL. 1272a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void *FL_Pop(void **list) { 1282a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) void *result = *list; 1292a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) ASSERT(FL_Previous_No_Check(result) == NULL); 1302a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) *list = FL_Next(result); 1312a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) if (*list != NULL) { 1322a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_SetPrevious(*list, NULL); 1332a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) } 1342a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) return result; 1352a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1362a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1372a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// Makes the element at |t| a singleton doubly linked list. 1382a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void FL_Init(void *t) { 1392a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_SetPrevious(t, NULL); 1402a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_SetNext(t, NULL); 1412a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1422a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1432a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// Pushes element to a linked list whose first element is at 1442a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// |*list|. When this call returns, |list| will point to the new head 1452a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)// of the linked list. 1462a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)inline void FL_Push(void **list, void *element) { 1472a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) void *old = *list; 1482a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) if (old == NULL) { // Builds singleton list. 1492a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_Init(element); 1502a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) } else { 1512a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) ASSERT(FL_Previous_No_Check(old) == NULL); 1522a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_SetNext(element, old); 1532a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_SetPrevious(old, element); 1542a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) FL_SetPrevious(element, NULL); 1552a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) } 1562a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) *list = element; 1572a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles)} 1582a99a7e74a7f215066514fe81d2bfa6639d9edddTorne (Richard Coles) 1595821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#else // TCMALLOC_USE_DOUBLYLINKED_FREELIST not defined 1605821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)static const bool kSupportsDoublyLinkedList = false; 1615821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1625821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline void *FL_Next(void *t) { 1635821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return SLL_Next(t); 1645821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1655821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1665821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline void FL_Init(void *t) { 1675821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) SLL_SetNext(t, NULL); 1685821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1695821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1705821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline void FL_Push(void **list, void *element) { 1715821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) if(*list != element) { 1725821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) SLL_Push(list,element); 1735821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return; 1745821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) } 1755821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) Log(kCrash, __FILE__, __LINE__, "Double Free of %p detected", element); 1765821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1775821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1785821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline void *FL_Pop(void **list) { 1795821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return SLL_Pop(list); 1805821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1815821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1825821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// Removes |N| elements from a linked list to which |head| points. 1835821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// |head| will be modified to point to the new |head|. |start| and 1845821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// |end| will point to the first and last nodes of the range. Note 1855821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)// that |end| will point to NULL after this function is called. 1865821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline void FL_PopRange(void **head, int n, void **start, void **end) { 1875821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) SLL_PopRange(head, n, start, end); 1885821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1895821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1905821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline void FL_PushRange(void **head, void *start, void *end) { 1915821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) SLL_PushRange(head,start,end); 1925821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1935821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1945821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)inline size_t FL_Size(void *head) { 1955821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) return SLL_Size(head); 1965821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} 1975821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 1985821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#endif // TCMALLOC_USE_DOUBLYLINKED_FREELIST 1995821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 2005821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)} // namespace tcmalloc 2015821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles) 2025821806d5e7f356e8fa4b058a389a808ea183019Torne (Richard Coles)#endif // TCMALLOC_FREE_LIST_H_ 203