RMMemoryCache.m
5.47 KB
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
//
// RMMemoryCache.m
//
// Copyright (c) 2008-2009, Route-Me Contributors
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
// * 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 THE COPYRIGHT HOLDERS AND 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 THE COPYRIGHT OWNER OR 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.
#import "RMMemoryCache.h"
#import "RMTileImage.h"
@implementation RMMemoryCache
{
NSMutableDictionary *_memoryCache;
dispatch_queue_t _memoryCacheQueue;
NSUInteger _memoryCacheCapacity;
}
- (id)initWithCapacity:(NSUInteger)aCapacity
{
if (!(self = [super init]))
return nil;
RMLog(@"initializing memory cache %@ with capacity %d", self, aCapacity);
_memoryCache = [[NSMutableDictionary alloc] initWithCapacity:aCapacity];
_memoryCacheQueue = dispatch_queue_create("routeme.memoryCacheQueue", DISPATCH_QUEUE_CONCURRENT);
if (aCapacity < 1)
aCapacity = 1;
_memoryCacheCapacity = aCapacity;
return self;
}
- (id)init
{
return [self initWithCapacity:32];
}
- (void)dealloc
{
dispatch_barrier_sync(_memoryCacheQueue, ^{
[_memoryCache removeAllObjects];
[_memoryCache release]; _memoryCache = nil;
});
[super dealloc];
}
- (void)didReceiveMemoryWarning
{
LogMethod();
dispatch_barrier_async(_memoryCacheQueue, ^{
[_memoryCache removeAllObjects];
});
}
- (void)removeTile:(RMTile)tile
{
dispatch_barrier_async(_memoryCacheQueue, ^{
[_memoryCache removeObjectForKey:[RMTileCache tileHash:tile]];
});
}
- (UIImage *)cachedImage:(RMTile)tile withCacheKey:(NSString *)aCacheKey
{
// RMLog(@"Memory cache check tile %d %d %d (%@)", tile.x, tile.y, tile.zoom, [RMTileCache tileHash:tile]);
__block RMCacheObject *cachedObject = nil;
NSNumber *tileHash = [RMTileCache tileHash:tile];
dispatch_sync(_memoryCacheQueue, ^{
cachedObject = [[_memoryCache objectForKey:tileHash] retain];
if (cachedObject)
{
if ([[cachedObject cacheKey] isEqualToString:aCacheKey])
{
[cachedObject touch];
}
else
{
dispatch_barrier_async(_memoryCacheQueue, ^{
[_memoryCache removeObjectForKey:tileHash];
});
[cachedObject release]; cachedObject = nil;
}
}
});
// RMLog(@"Memory cache hit tile %d %d %d (%@)", tile.x, tile.y, tile.zoom, [RMTileCache tileHash:tile]);
[cachedObject autorelease];
return [cachedObject cachedObject];
}
/// Remove the least-recently used image from cache, if cache is at or over capacity. Removes only 1 image.
- (void)makeSpaceInCache
{
dispatch_barrier_async(_memoryCacheQueue, ^{
while ([_memoryCache count] >= _memoryCacheCapacity)
{
// Rather than scanning I would really like to be using a priority queue
// backed by a heap here.
// Maybe deleting one random element would work as well.
NSEnumerator *enumerator = [_memoryCache objectEnumerator];
RMCacheObject *image;
NSDate *oldestDate = nil;
RMCacheObject *oldestImage = nil;
while ((image = (RMCacheObject *)[enumerator nextObject]))
{
if (oldestDate == nil || ([oldestDate timeIntervalSinceReferenceDate] > [[image timestamp] timeIntervalSinceReferenceDate]))
{
oldestDate = [image timestamp];
oldestImage = image;
}
}
if (oldestImage)
{
// RMLog(@"Memory cache delete tile %d %d %d (%@)", oldestImage.tile.x, oldestImage.tile.y, oldestImage.tile.zoom, [RMTileCache tileHash:oldestImage.tile]);
[_memoryCache removeObjectForKey:[RMTileCache tileHash:oldestImage.tile]];
}
}
});
}
- (void)addImage:(UIImage *)image forTile:(RMTile)tile withCacheKey:(NSString *)aCacheKey
{
// RMLog(@"Memory cache insert tile %d %d %d (%@)", tile.x, tile.y, tile.zoom, [RMTileCache tileHash:tile]);
[self makeSpaceInCache];
dispatch_barrier_async(_memoryCacheQueue, ^{
[_memoryCache setObject:[RMCacheObject cacheObject:image forTile:tile withCacheKey:aCacheKey] forKey:[RMTileCache tileHash:tile]];
});
}
- (void)removeAllCachedImages
{
LogMethod();
dispatch_barrier_async(_memoryCacheQueue, ^{
[_memoryCache removeAllObjects];
});
}
@end