1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
|
/*
* Copyright (C) 2012 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef LayerPool_h
#define LayerPool_h
#include "IntSize.h"
#include "IntSizeHash.h"
#include "Timer.h"
#include <wtf/Deque.h>
#include <wtf/HashMap.h>
#include <wtf/OwnPtr.h>
#include <wtf/RetainPtr.h>
#include <wtf/Vector.h>
@class WebTileLayer;
namespace WebCore {
class LayerPool {
WTF_MAKE_NONCOPYABLE(LayerPool);
public:
static LayerPool* sharedPool();
void addLayer(const RetainPtr<WebTileLayer>&);
RetainPtr<WebTileLayer> takeLayerWithSize(const IntSize&);
void drain();
// The maximum size of all queued layers in bytes.
unsigned capacity() const { return m_maxBytesForPool; }
private:
LayerPool();
typedef Deque<RetainPtr<WebTileLayer> > LayerList;
unsigned decayedCapacity() const;
bool canReuseLayerWithSize(const IntSize& size) const { return m_maxBytesForPool && !size.isEmpty(); }
void schedulePrune();
void pruneTimerFired(Timer<LayerPool>*);
typedef enum { LeaveUnchanged, MarkAsUsed } AccessType;
LayerList& listOfLayersWithSize(const IntSize&, AccessType = LeaveUnchanged);
static unsigned backingStoreBytesForSize(const IntSize&);
HashMap<IntSize, LayerList> m_reuseLists;
// Ordered by recent use. The last size is the most recently used.
Vector<IntSize> m_sizesInPruneOrder;
unsigned m_totalBytes;
unsigned m_maxBytesForPool;
Timer<LayerPool> m_pruneTimer;
double m_lastAddTime;
};
}
#endif
|
