forked from mathstuf/gdal-svn
-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathcpl_vsil_cache.cpp
517 lines (397 loc) · 16.5 KB
/
cpl_vsil_cache.cpp
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
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
/******************************************************************************
* $Id$
*
* Project: VSI Virtual File System
* Purpose: Implementation of caching IO layer.
* Author: Frank Warmerdam, [email protected]
*
******************************************************************************
* Copyright (c) 2011, Frank Warmerdam <[email protected]>
* Copyright (c) 2011-2014, Even Rouault <even dot rouault at mines-paris dot org>
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
* OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
* DEALINGS IN THE SOFTWARE.
****************************************************************************/
#include "cpl_vsi_virtual.h"
CPL_CVSID("$Id$");
/************************************************************************/
/* ==================================================================== */
/* VSICacheChunk */
/* ==================================================================== */
/************************************************************************/
class VSICacheChunk
{
public:
VSICacheChunk()
{
poLRUPrev = poLRUNext = NULL;
nDataFilled = 0;
bDirty = FALSE;
pabyData = NULL;
}
virtual ~VSICacheChunk()
{
VSIFree( pabyData );
}
bool Allocate( size_t nChunkSize )
{
CPLAssert( pabyData == NULL );
pabyData = (GByte *)VSIMalloc( nChunkSize );
return (pabyData != NULL);
}
int bDirty;
vsi_l_offset iBlock;
VSICacheChunk *poLRUPrev;
VSICacheChunk *poLRUNext;
vsi_l_offset nDataFilled;
GByte *pabyData;
};
/************************************************************************/
/* ==================================================================== */
/* VSICachedFile */
/* ==================================================================== */
/************************************************************************/
class VSICachedFile : public VSIVirtualHandle
{
public:
VSICachedFile( VSIVirtualHandle *poBaseHandle,
size_t nChunkSize,
size_t nCacheSize );
~VSICachedFile() { Close(); }
void FlushLRU();
int LoadBlocks( vsi_l_offset nStartBlock, size_t nBlockCount,
void *pBuffer, size_t nBufferSize );
void Demote( VSICacheChunk * );
VSIVirtualHandle *poBase;
vsi_l_offset nOffset;
vsi_l_offset nFileSize;
GUIntBig nCacheUsed;
GUIntBig nCacheMax;
size_t nChunkSize;
VSICacheChunk *poLRUStart;
VSICacheChunk *poLRUEnd;
std::vector<VSICacheChunk*> apoCache;
int bEOF;
virtual int Seek( vsi_l_offset nOffset, int nWhence );
virtual vsi_l_offset Tell();
virtual size_t Read( void *pBuffer, size_t nSize, size_t nMemb );
virtual size_t Write( const void *pBuffer, size_t nSize, size_t nMemb );
virtual int Eof();
virtual int Flush();
virtual int Close();
virtual void *GetNativeFileDescriptor() { return poBase->GetNativeFileDescriptor(); }
};
/************************************************************************/
/* VSICachedFile() */
/************************************************************************/
VSICachedFile::VSICachedFile( VSIVirtualHandle *poBaseHandle, size_t nChunkSize, size_t nCacheSize )
{
poBase = poBaseHandle;
this->nChunkSize = nChunkSize;
nCacheUsed = 0;
if ( nCacheSize == 0 )
nCacheMax = CPLScanUIntBig(
CPLGetConfigOption( "VSI_CACHE_SIZE", "25000000" ), 40 );
else
nCacheMax = nCacheSize;
poLRUStart = NULL;
poLRUEnd = NULL;
poBase->Seek( 0, SEEK_END );
nFileSize = poBase->Tell();
nOffset = 0;
bEOF = FALSE;
}
/************************************************************************/
/* Close() */
/************************************************************************/
int VSICachedFile::Close()
{
size_t i;
for( i = 0; i < apoCache.size(); i++ )
delete apoCache[i];
apoCache.resize( 0 );
poLRUStart = NULL;
poLRUEnd = NULL;
nCacheUsed = 0;
if( poBase )
{
poBase->Close();
delete poBase;
poBase = NULL;
}
return 0;
}
/************************************************************************/
/* Seek() */
/************************************************************************/
int VSICachedFile::Seek( vsi_l_offset nReqOffset, int nWhence )
{
bEOF = FALSE;
if( nWhence == SEEK_SET )
{
// use offset directly.
}
else if( nWhence == SEEK_CUR )
{
nReqOffset += nOffset;
}
else if( nWhence == SEEK_END )
{
nReqOffset += nFileSize;
}
nOffset = nReqOffset;
return 0;
}
/************************************************************************/
/* Tell() */
/************************************************************************/
vsi_l_offset VSICachedFile::Tell()
{
return nOffset;
}
/************************************************************************/
/* FlushLRU() */
/************************************************************************/
void VSICachedFile::FlushLRU()
{
CPLAssert( poLRUStart != NULL );
VSICacheChunk *poBlock = poLRUStart;
CPLAssert( nCacheUsed >= poBlock->nDataFilled );
nCacheUsed -= poBlock->nDataFilled;
poLRUStart = poBlock->poLRUNext;
if( poLRUEnd == poBlock )
poLRUEnd = NULL;
if( poBlock->poLRUNext != NULL )
poBlock->poLRUNext->poLRUPrev = NULL;
CPLAssert( !poBlock->bDirty );
apoCache[poBlock->iBlock] = NULL;
delete poBlock;
}
/************************************************************************/
/* Demote() */
/* */
/* Demote the indicated block to the end of the LRU list. */
/* Potentially integrate the link into the list if it is not */
/* already there. */
/************************************************************************/
void VSICachedFile::Demote( VSICacheChunk *poBlock )
{
// already at end?
if( poLRUEnd == poBlock )
return;
if( poLRUStart == poBlock )
poLRUStart = poBlock->poLRUNext;
if( poBlock->poLRUPrev != NULL )
poBlock->poLRUPrev->poLRUNext = poBlock->poLRUNext;
if( poBlock->poLRUNext != NULL )
poBlock->poLRUNext->poLRUPrev = poBlock->poLRUPrev;
poBlock->poLRUNext = NULL;
poBlock->poLRUPrev = NULL;
if( poLRUEnd != NULL )
poLRUEnd->poLRUNext = poBlock;
poLRUEnd = poBlock;
if( poLRUStart == NULL )
poLRUStart = poBlock;
}
/************************************************************************/
/* LoadBlocks() */
/* */
/* Load the desired set of blocks. Use pBuffer as a temporary */
/* buffer if it would be helpful. */
/************************************************************************/
int VSICachedFile::LoadBlocks( vsi_l_offset nStartBlock, size_t nBlockCount,
void *pBuffer, size_t nBufferSize )
{
if( nBlockCount == 0 )
return 1;
if( apoCache.size() < nStartBlock + nBlockCount )
apoCache.resize( nStartBlock + nBlockCount );
/* -------------------------------------------------------------------- */
/* When we want to load only one block, we can directly load it */
/* into the target buffer with no concern about intermediaries. */
/* -------------------------------------------------------------------- */
if( nBlockCount == 1 )
{
poBase->Seek( (vsi_l_offset)nStartBlock * nChunkSize, SEEK_SET );
VSICacheChunk *poBlock = new VSICacheChunk();
if ( !poBlock || !poBlock->Allocate( nChunkSize ) )
{
delete poBlock;
return 0;
}
apoCache[nStartBlock] = poBlock;
poBlock->iBlock = nStartBlock;
poBlock->nDataFilled = poBase->Read( poBlock->pabyData, 1, nChunkSize );
nCacheUsed += poBlock->nDataFilled;
// Merges into the LRU list.
Demote( poBlock );
return 1;
}
/* -------------------------------------------------------------------- */
/* If the buffer is quite large but not quite large enough to */
/* hold all the blocks we will take the pain of splitting the */
/* io request in two in order to avoid allocating a large */
/* temporary buffer. */
/* -------------------------------------------------------------------- */
if( nBufferSize > nChunkSize * 20
&& nBufferSize < nBlockCount * nChunkSize )
{
if( !LoadBlocks( nStartBlock, 2, pBuffer, nBufferSize ) )
return 0;
return LoadBlocks( nStartBlock+2, nBlockCount-2, pBuffer, nBufferSize );
}
/* -------------------------------------------------------------------- */
/* Do we need to allocate our own buffer? */
/* -------------------------------------------------------------------- */
GByte *pabyWorkBuffer = (GByte *) pBuffer;
if( nBufferSize < nChunkSize * nBlockCount )
pabyWorkBuffer = (GByte *) CPLMalloc(nChunkSize * nBlockCount);
/* -------------------------------------------------------------------- */
/* Read the whole request into the working buffer. */
/* -------------------------------------------------------------------- */
if( poBase->Seek( (vsi_l_offset)nStartBlock * nChunkSize, SEEK_SET ) != 0 )
return 0;
size_t nDataRead = poBase->Read( pabyWorkBuffer, 1, nBlockCount*nChunkSize);
if( nBlockCount * nChunkSize > nDataRead + nChunkSize - 1 )
nBlockCount = (nDataRead + nChunkSize - 1) / nChunkSize;
for( size_t i = 0; i < nBlockCount; i++ )
{
VSICacheChunk *poBlock = new VSICacheChunk();
if ( !poBlock || !poBlock->Allocate( nChunkSize ) )
{
delete poBlock;
return 0;
}
poBlock->iBlock = nStartBlock + i;
CPLAssert( apoCache[i+nStartBlock] == NULL );
apoCache[i + nStartBlock] = poBlock;
if( nDataRead >= (i+1) * nChunkSize )
poBlock->nDataFilled = nChunkSize;
else
poBlock->nDataFilled = nDataRead - i*nChunkSize;
memcpy( poBlock->pabyData, pabyWorkBuffer + i*nChunkSize,
(size_t) poBlock->nDataFilled );
nCacheUsed += poBlock->nDataFilled;
// Merges into the LRU list.
Demote( poBlock );
}
if( pabyWorkBuffer != pBuffer )
CPLFree( pabyWorkBuffer );
return 1;
}
/************************************************************************/
/* Read() */
/************************************************************************/
size_t VSICachedFile::Read( void * pBuffer, size_t nSize, size_t nCount )
{
if( nOffset >= nFileSize )
{
bEOF = TRUE;
return 0;
}
/* ==================================================================== */
/* Make sure the cache is loaded for the whole request region. */
/* ==================================================================== */
vsi_l_offset nStartBlock = nOffset / nChunkSize;
vsi_l_offset nEndBlock = (nOffset + nSize * nCount - 1) / nChunkSize;
for( vsi_l_offset iBlock = nStartBlock; iBlock <= nEndBlock; iBlock++ )
{
if( apoCache.size() <= iBlock || apoCache[iBlock] == NULL )
{
size_t nBlocksToLoad = 1;
while( iBlock + nBlocksToLoad <= nEndBlock
&& (apoCache.size() <= iBlock+nBlocksToLoad
|| apoCache[iBlock+nBlocksToLoad] == NULL) )
nBlocksToLoad++;
LoadBlocks( iBlock, nBlocksToLoad, pBuffer, nSize * nCount );
}
}
/* ==================================================================== */
/* Copy data into the target buffer to the extent possible. */
/* ==================================================================== */
size_t nAmountCopied = 0;
while( nAmountCopied < nSize * nCount )
{
vsi_l_offset iBlock = (nOffset + nAmountCopied) / nChunkSize;
size_t nThisCopy;
VSICacheChunk *poBlock = apoCache[iBlock];
if( poBlock == NULL )
{
/* We can reach that point when the amount to read exceeds */
/* the cache size */
LoadBlocks( iBlock, 1, ((GByte *) pBuffer) + nAmountCopied,
MIN(nSize * nCount - nAmountCopied, nChunkSize) );
poBlock = apoCache[iBlock];
CPLAssert(poBlock != NULL);
}
vsi_l_offset nStartOffset = (vsi_l_offset)iBlock * nChunkSize;
nThisCopy = (size_t)
((nStartOffset + poBlock->nDataFilled)
- nAmountCopied - nOffset);
if( nThisCopy > nSize * nCount - nAmountCopied )
nThisCopy = nSize * nCount - nAmountCopied;
if( nThisCopy == 0 )
break;
memcpy( ((GByte *) pBuffer) + nAmountCopied,
poBlock->pabyData
+ (nOffset + nAmountCopied) - nStartOffset,
nThisCopy );
nAmountCopied += nThisCopy;
}
nOffset += nAmountCopied;
/* -------------------------------------------------------------------- */
/* Ensure the cache is reduced to our limit. */
/* -------------------------------------------------------------------- */
while( nCacheUsed > nCacheMax )
FlushLRU();
size_t nRet = nAmountCopied / nSize;
if (nRet != nCount)
bEOF = TRUE;
return nRet;
}
/************************************************************************/
/* Write() */
/************************************************************************/
size_t VSICachedFile::Write( CPL_UNUSED const void * pBuffer,
CPL_UNUSED size_t nSize,
CPL_UNUSED size_t nCount )
{
return 0;
}
/************************************************************************/
/* Eof() */
/************************************************************************/
int VSICachedFile::Eof()
{
return bEOF;
}
/************************************************************************/
/* Flush() */
/************************************************************************/
int VSICachedFile::Flush()
{
return 0;
}
/************************************************************************/
/* VSICreateCachedFile() */
/************************************************************************/
VSIVirtualHandle *
VSICreateCachedFile( VSIVirtualHandle *poBaseHandle, size_t nChunkSize, size_t nCacheSize )
{
return new VSICachedFile( poBaseHandle, nChunkSize, nCacheSize );
}