OLD | NEW |
1 // Copyright (c) 2005, Google Inc. | 1 // Copyright (c) 2005, Google Inc. |
2 // All rights reserved. | 2 // All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions are | 5 // modification, are permitted provided that the following conditions are |
6 // met: | 6 // met: |
7 // | 7 // |
8 // * Redistributions of source code must retain the above copyright | 8 // * Redistributions of source code must retain the above copyright |
9 // notice, this list of conditions and the following disclaimer. | 9 // notice, this list of conditions and the following disclaimer. |
10 // * Redistributions in binary form must reproduce the above | 10 // * Redistributions in binary form must reproduce the above |
(...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
64 // contained in the specified range of memory will not be used for a | 64 // contained in the specified range of memory will not be used for a |
65 // while, and can be released for use by other processes or the OS. | 65 // while, and can be released for use by other processes or the OS. |
66 // Pages which are released in this way may be destroyed (zeroed) by | 66 // Pages which are released in this way may be destroyed (zeroed) by |
67 // the OS. The benefit of this function is that it frees memory for | 67 // the OS. The benefit of this function is that it frees memory for |
68 // use by the system, the cost is that the pages are faulted back into | 68 // use by the system, the cost is that the pages are faulted back into |
69 // the address space next time they are touched, which can impact | 69 // the address space next time they are touched, which can impact |
70 // performance. (Only pages fully covered by the memory region will | 70 // performance. (Only pages fully covered by the memory region will |
71 // be released, partial pages will not.) | 71 // be released, partial pages will not.) |
72 extern void TCMalloc_SystemRelease(void* start, size_t length); | 72 extern void TCMalloc_SystemRelease(void* start, size_t length); |
73 | 73 |
74 // Called to ressurect memory which has been previously released | |
75 // to the system via TCMalloc_SystemRelease. An attempt to | |
76 // commit a page that is already committed does not cause this | |
77 // function to fail. | |
78 extern void TCMalloc_SystemCommit(void* start, size_t length); | |
79 | |
80 // Guards the first page in the supplied range of memory and returns the size | |
81 // of the guard page. Will return 0 if a guard cannot be added to the page | |
82 // (e.g. start is not aligned or size is not large enough). | |
83 extern size_t TCMalloc_SystemAddGuard(void* start, size_t size); | |
84 | |
85 // The current system allocator. | 74 // The current system allocator. |
86 extern PERFTOOLS_DLL_DECL SysAllocator* sys_alloc; | 75 extern PERFTOOLS_DLL_DECL SysAllocator* sys_alloc; |
87 | 76 |
88 #endif /* TCMALLOC_SYSTEM_ALLOC_H_ */ | 77 #endif /* TCMALLOC_SYSTEM_ALLOC_H_ */ |
OLD | NEW |