blob: 9fe96989ecb10176f3bde5a064982bce9670f0c8 (
plain)
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
|
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
#ifndef CacheIndexIterator__h__
#define CacheIndexIterator__h__
#include "nsTArray.h"
#include "nsCOMPtr.h"
#include "nsAutoPtr.h"
#include "mozilla/SHA1.h"
namespace mozilla {
namespace net {
class CacheIndex;
struct CacheIndexRecord;
class CacheIndexIterator
{
public:
NS_INLINE_DECL_THREADSAFE_REFCOUNTING(CacheIndexIterator)
CacheIndexIterator(CacheIndex *aIndex, bool aAddNew);
protected:
virtual ~CacheIndexIterator();
public:
// Returns a hash of a next entry. If there is no entry NS_ERROR_NOT_AVAILABLE
// is returned and the iterator is closed. Other error is returned when the
// iterator is closed for other reason, e.g. shutdown.
nsresult GetNextHash(SHA1Sum::Hash *aHash);
// Closes the iterator. This means the iterator is removed from the list of
// iterators in CacheIndex.
nsresult Close();
protected:
friend class CacheIndex;
nsresult CloseInternal(nsresult aStatus);
bool ShouldBeNewAdded() { return mAddNew; }
virtual void AddRecord(CacheIndexRecord *aRecord);
bool RemoveRecord(CacheIndexRecord *aRecord);
bool ReplaceRecord(CacheIndexRecord *aOldRecord,
CacheIndexRecord *aNewRecord);
nsresult mStatus;
RefPtr<CacheIndex> mIndex;
nsTArray<CacheIndexRecord *> mRecords;
bool mAddNew;
};
} // namespace net
} // namespace mozilla
#endif
|
