OLD | NEW |
---|---|
1 # PartitionAlloc Design | 1 # PartitionAlloc Design |
Primiano Tucci (use gerrit)
2016/11/22 14:28:32
since you are moving this, can you also update doc
palmer
2016/11/24 01:05:55
Done.
| |
2 | 2 |
3 This document explains a high-level design of PartitionAlloc. | 3 This document explains a high-level design of PartitionAlloc. |
4 If you're interested in its in-depth implementation, see comments | 4 If you're interested in its in-depth implementation, see comments |
5 in PartitionAlloc.h. | 5 in PartitionAlloc.h. |
6 | 6 |
7 [TOC] | 7 [TOC] |
8 | 8 |
9 ## Overview | 9 ## Overview |
10 | 10 |
11 PartitionAlloc is a memory allocator optimized for performance and security | 11 PartitionAlloc is a memory allocator optimized for performance and security |
(...skipping 76 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
88 Linear overflow or underflow cannot corrupt the metadata. | 88 Linear overflow or underflow cannot corrupt the metadata. |
89 | 89 |
90 * Buckets are helpful to allocate different-sized objects on different addresses . | 90 * Buckets are helpful to allocate different-sized objects on different addresses . |
91 One page can contain only similar-sized objects. | 91 One page can contain only similar-sized objects. |
92 | 92 |
93 * Dereference of a freelist pointer should fault. | 93 * Dereference of a freelist pointer should fault. |
94 | 94 |
95 * Partial pointer overwrite of freelist pointer should fault. | 95 * Partial pointer overwrite of freelist pointer should fault. |
96 | 96 |
97 * Large allocations are guard-paged at the beginning and end. | 97 * Large allocations are guard-paged at the beginning and end. |
OLD | NEW |