+2015-01-13 Geoffrey Garen <ggaren@apple.com>
+
+ Renamed minimum to size in SegregatedFreeList
+ https://bugs.webkit.org/show_bug.cgi?id=140406
+
+ Reviewed by Sam Weinig.
+
+ In preparation for supporting aligned allocation.
+
+ * bmalloc/SegregatedFreeList.cpp:
+ (bmalloc::SegregatedFreeList::takeGreedy):
+ (bmalloc::SegregatedFreeList::take): Every size passed to malloc is
+ really just a minimum. Let's not imply that this value is special.
+
2015-01-11 Dan Bernstein <mitz@apple.com>
Geoff is organized, but he is not an organization.
list.push(range);
}
-Range SegregatedFreeList::takeGreedy(size_t minimum)
+Range SegregatedFreeList::takeGreedy(size_t size)
{
for (size_t i = m_lists.size(); i-- > 0; ) {
- Range range = takeGreedy(m_lists[i], minimum);
+ Range range = takeGreedy(m_lists[i], size);
if (!range)
continue;
return Range();
}
-Range SegregatedFreeList::takeGreedy(List& list, size_t minimum)
+Range SegregatedFreeList::takeGreedy(List& list, size_t size)
{
for (size_t i = list.size(); i-- > 0; ) {
Range range = list[i];
continue;
}
- if (range.size() < minimum)
+ if (range.size() < size)
continue;
list.pop(i);
return Range();
}
-Range SegregatedFreeList::take(size_t minimum)
+Range SegregatedFreeList::take(size_t size)
{
- for (auto* list = &select(minimum); list != m_lists.end(); ++list) {
- Range range = take(*list, minimum);
+ for (auto* list = &select(size); list != m_lists.end(); ++list) {
+ Range range = take(*list, size);
if (!range)
continue;
return m_lists[result];
}
-INLINE Range SegregatedFreeList::take(List& list, size_t minimum)
+INLINE Range SegregatedFreeList::take(List& list, size_t size)
{
Range first;
size_t end = list.size() > segregatedFreeListSearchDepth ? list.size() - segregatedFreeListSearchDepth : 0;
continue;
}
- if (range.size() < minimum)
+ if (range.size() < size)
continue;
if (!!first && first < range)