OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. 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 241 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
252 uint16_t numUnprovisionedSlots; | 252 uint16_t numUnprovisionedSlots; |
253 uint16_t pageOffset; | 253 uint16_t pageOffset; |
254 int16_t emptyCacheIndex; // -1 if not in the empty cache. | 254 int16_t emptyCacheIndex; // -1 if not in the empty cache. |
255 }; | 255 }; |
256 | 256 |
257 struct PartitionBucket { | 257 struct PartitionBucket { |
258 PartitionPage* activePagesHead; // Accessed most in hot path => goes first. | 258 PartitionPage* activePagesHead; // Accessed most in hot path => goes first. |
259 PartitionPage* emptyPagesHead; | 259 PartitionPage* emptyPagesHead; |
260 PartitionPage* decommittedPagesHead; | 260 PartitionPage* decommittedPagesHead; |
261 uint32_t slotSize; | 261 uint32_t slotSize; |
262 uint16_t numSystemPagesPerSlotSpan; | 262 unsigned numSystemPagesPerSlotSpan : 8; |
bashi
2016/01/26 23:52:37
uint32_t ?
haraken
2016/01/27 01:19:32
The style checker asks us to use unsigned for a bi
| |
263 uint16_t numFullPages; | 263 unsigned numFullPages : 24; |
bashi
2016/01/26 23:52:37
ditto.
| |
264 }; | 264 }; |
265 | 265 |
266 // An "extent" is a span of consecutive superpages. We link to the partition's | 266 // An "extent" is a span of consecutive superpages. We link to the partition's |
267 // next extent (if there is one) at the very start of a superpage's metadata | 267 // next extent (if there is one) at the very start of a superpage's metadata |
268 // area. | 268 // area. |
269 struct PartitionSuperPageExtentEntry { | 269 struct PartitionSuperPageExtentEntry { |
270 PartitionRootBase* root; | 270 PartitionRootBase* root; |
271 char* superPageBase; | 271 char* superPageBase; |
272 char* superPagesEnd; | 272 char* superPagesEnd; |
273 PartitionSuperPageExtentEntry* next; | 273 PartitionSuperPageExtentEntry* next; |
(...skipping 595 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
869 using WTF::partitionAlloc; | 869 using WTF::partitionAlloc; |
870 using WTF::partitionFree; | 870 using WTF::partitionFree; |
871 using WTF::partitionAllocGeneric; | 871 using WTF::partitionAllocGeneric; |
872 using WTF::partitionFreeGeneric; | 872 using WTF::partitionFreeGeneric; |
873 using WTF::partitionReallocGeneric; | 873 using WTF::partitionReallocGeneric; |
874 using WTF::partitionAllocActualSize; | 874 using WTF::partitionAllocActualSize; |
875 using WTF::partitionAllocSupportsGetSize; | 875 using WTF::partitionAllocSupportsGetSize; |
876 using WTF::partitionAllocGetSize; | 876 using WTF::partitionAllocGetSize; |
877 | 877 |
878 #endif // WTF_PartitionAlloc_h | 878 #endif // WTF_PartitionAlloc_h |
OLD | NEW |