OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:CacheAddr
(Results
1 - 15
of
15
) sorted by null
/external/chromium_org/net/disk_cache/blockfile/
disk_format.h
10
// will be stored as a series of blocks on a block-file. In any case,
CacheAddr
14
// a
CacheAddr
value. Linking for a given hash bucket is handled internally
62
CacheAddr
heads[5];
63
CacheAddr
tails[5];
64
CacheAddr
transaction; // In-flight operation target.
80
CacheAddr
stats; // Storage for usage data.
92
CacheAddr
table[kIndexTablesize]; // Default size. Actual size controlled
103
CacheAddr
next; // Next entry with the same hash or bucket.
104
CacheAddr
rankings_node; // Rankings node for this entry.
110
CacheAddr
long_key; // Optional address of a long key
[
all
...]
addr.h
72
explicit Addr(
CacheAddr
address) : value_(address) {}
80
CacheAddr
value() const { return value_; }
81
void set_value(
CacheAddr
address) {
183
CacheAddr
value_;
disk_format_base.h
28
typedef uint32
CacheAddr
;
rankings.h
144
void SetContents(CacheRankingsBlock* node,
CacheAddr
address);
147
typedef std::pair<
CacheAddr
, CacheRankingsBlock*> IteratorPair;
188
bool IsHead(
CacheAddr
addr, List* list) const;
189
bool IsTail(
CacheAddr
addr, List* list) const;
disk_format_v3.h
10
// will be stored as a series of blocks on a block-file. In any case,
CacheAddr
72
CacheAddr
stats; // Storage for usage data.
220
CacheAddr
data_addr[4]; // entry.
rankings.cc
353
CacheAddr
node_value = node->address().value();
560
void Rankings::SetContents(CacheRankingsBlock* node,
CacheAddr
address) {
638
Addr node_addr(static_cast<
CacheAddr
>(control_data_->transaction));
709
CacheAddr
node_value = node->address().value();
749
CacheAddr
node_addr = node->address().value();
834
CacheAddr
next = forward ? node->Data()->next : node->Data()->prev;
835
CacheAddr
prev = forward ? node->Data()->prev : node->Data()->next;
860
bool Rankings::IsHead(
CacheAddr
addr, List* list) const {
872
bool Rankings::IsTail(
CacheAddr
addr, List* list) const {
888
CacheAddr
address = node->address().value()
[
all
...]
backend_impl.h
127
CacheAddr
GetNextAddr(Addr address);
289
typedef base::hash_map<
CacheAddr
, EntryImpl*> EntriesMap;
backend_impl_v3.h
195
typedef base::hash_map<
CacheAddr
, EntryImplV3*> EntriesMap;
block_files_unittest.cc
89
CacheAddr
entries[kNumEntries];
103
CacheAddr
temp = entries[source1];
entry_impl.h
83
CacheAddr
GetNextAddress();
backend_worker_v3.cc
60
size_t table_size = sizeof(disk_cache::
CacheAddr
) * table_len;
backend_impl.cc
74
size_t table_size = sizeof(disk_cache::
CacheAddr
) * table_len;
797
CacheAddr
child(entry->GetNextAddress());
823
CacheAddr
BackendImpl::GetNextAddr(Addr address) {
[
all
...]
backend_impl_v3.cc
134
CacheAddr
child(entry->GetNextAddress());
[
all
...]
entry_impl.cc
517
CacheAddr
EntryImpl::GetNextAddress() {
[
all
...]
/external/chromium_org/net/tools/dump_cache/
dump_files.cc
57
void DumpStats(const base::FilePath& path, disk_cache::
CacheAddr
addr) {
96
disk_cache::
CacheAddr
* stats_addr) {
169
bool LoadEntry(disk_cache::
CacheAddr
addr, disk_cache::EntryStore* entry);
170
bool LoadRankings(disk_cache::
CacheAddr
addr,
179
disk_cache::
CacheAddr
next_addr_;
180
std::set<disk_cache::
CacheAddr
> dumped_entries_;
232
bool CacheDumper::LoadEntry(disk_cache::
CacheAddr
addr,
257
bool CacheDumper::LoadRankings(disk_cache::
CacheAddr
addr,
339
disk_cache::
CacheAddr
stats_addr = 0;
Completed in 1003 milliseconds