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
|
/*
*
* SQUID Web Proxy Cache http://www.squid-cache.org/
* ----------------------------------------------------------
*
* Squid is the result of efforts by numerous individuals from
* the Internet community; see the CONTRIBUTORS file for full
* details. Many organizations have provided support for Squid's
* development; see the SPONSORS file for full details. Squid is
* Copyrighted (C) 2001 by the Regents of the University of
* California; see the COPYRIGHT file for full details. Squid
* incorporates software developed and/or copyrighted by other
* sources; see the CREDITS file for full details.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111, USA.
*
*/
#ifndef SQUID_STOREHASHINDEX_H
#define SQUID_STOREHASHINDEX_H
#include "Store.h"
#include "StoreSearch.h"
/* A summary store that indexs all its children
* into a memory hash
*/
class StoreSearch;
class StoreHashIndex : public Store
{
public:
StoreHashIndex();
StoreHashIndex(StoreHashIndex const &); /* to cause link failures */
virtual ~StoreHashIndex();
virtual int callback();
virtual void create();
virtual StoreEntry * get
(const cache_key *);
virtual void get
(String const, STOREGETCLIENT, void * cbdata);
virtual void init();
virtual void sync();
virtual uint64_t maxSize() const;
virtual uint64_t minSize() const;
virtual uint64_t currentSize() const;
virtual uint64_t currentCount() const;
virtual int64_t maxObjectSize() const;
virtual void getStats(StoreInfoStats &stats) const;
virtual void stat(StoreEntry&) const;
virtual void reference(StoreEntry&);
virtual bool dereference(StoreEntry&, bool);
virtual void maintain();
virtual StoreSearch *search(String const url, HttpRequest *);
private:
/* migration logic */
StorePointer store(int const x) const;
SwapDir &dir(int const idx) const;
};
class StoreHashIndexEntry : public StoreEntry
{};
class StoreSearchHashIndex : public StoreSearch
{
public:
StoreSearchHashIndex(RefCount<StoreHashIndex> sd);
StoreSearchHashIndex(StoreSearchHashIndex const &);
virtual ~StoreSearchHashIndex();
/* Iterator API - garh, wrong place */
/* callback the client when a new StoreEntry is available
* or an error occurs
*/
virtual void next(void (callback)(void *cbdata), void *cbdata);
/* return true if a new StoreEntry is immediately available */
virtual bool next();
virtual bool error() const;
virtual bool isDone() const;
virtual StoreEntry *currentItem();
RefCount<StoreHashIndex> sd;
private:
void copyBucket();
void (*callback)(void *cbdata);
void *cbdata;
bool _done;
int bucket;
Vector<StoreEntry *> entries;
// keep this last. it plays with private/public
CBDATA_CLASS2(StoreSearchHashIndex);
};
#endif /* SQUID_STOREHASHINDEX_H */
|
