| /external/chromium_org/net/disk_cache/ |
| 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 | 60 explicit Addr(CacheAddr address) : value_(address) {}
68 CacheAddr value() const { return value_; }
69 void set_value(CacheAddr address) {
179 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;
|
| rankings.cc | 348 CacheAddr node_value = node->address().value();
555 void Rankings::SetContents(CacheRankingsBlock* node, CacheAddr address) {
633 Addr node_addr(static_cast<CacheAddr>(control_data_->transaction));
704 CacheAddr node_value = node->address().value();
744 CacheAddr node_addr = node->address().value();
829 CacheAddr next = forward ? node->Data()->next : node->Data()->prev;
830 CacheAddr prev = forward ? node->Data()->prev : node->Data()->next;
855 bool Rankings::IsHead(CacheAddr addr, List* list) const {
867 bool Rankings::IsTail(CacheAddr addr, List* list) const {
883 CacheAddr address = node->address().value()
[all...] |
| backend_impl.h | 125 CacheAddr GetNextAddr(Addr address);
278 typedef base::hash_map<CacheAddr, EntryImpl*> EntriesMap;
|
| block_files_unittest.cc | 89 CacheAddr entries[kNumEntries];
103 CacheAddr temp = entries[source1];
|
| entry_impl.h | 83 CacheAddr GetNextAddress();
|
| backend_impl.cc | 72 size_t table_size = sizeof(disk_cache::CacheAddr) * table_len;
770 CacheAddr child(entry->GetNextAddress());
796 CacheAddr BackendImpl::GetNextAddr(Addr address) {
[all...] |
| /external/chromium/net/disk_cache/ |
| disk_format.h | 10 // 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
63 typedef uint32 CacheAddr;
73 CacheAddr heads[5];
74 CacheAddr tails[5];
75 CacheAddr transaction; // In-flight operation target.
91 CacheAddr stats; // Storage for usage data.
103 CacheAddr table[kIndexTablesize]; // Default size. Actual size controlled
114 CacheAddr next; // Next entry with the same hash or bucket.
115 CacheAddr rankings_node; // Rankings node for this entry
[all...] |
| addr.h | 53 explicit Addr(CacheAddr address) : value_(address) {}
61 CacheAddr value() const { return value_; }
62 void set_value(CacheAddr address) {
136 CacheAddr value_;
|
| rankings.h | 143 void SetContents(CacheRankingsBlock* node, CacheAddr address);
146 typedef std::pair<CacheAddr, CacheRankingsBlock*> IteratorPair;
185 bool IsHead(CacheAddr addr, List* list) const;
186 bool IsTail(CacheAddr addr, List* list) const;
|
| rankings.cc | 335 CacheAddr node_value = node->address().value();
535 void Rankings::SetContents(CacheRankingsBlock* node, CacheAddr address) {
611 Addr node_addr(static_cast<CacheAddr>(control_data_->transaction));
683 CacheAddr node_value = node->address().value();
730 CacheAddr node_addr = node->address().value();
821 bool Rankings::IsHead(CacheAddr addr, List* list) const {
833 bool Rankings::IsTail(CacheAddr addr, List* list) const {
849 CacheAddr address = node->address().value();
860 CacheAddr address = node->address().value();
|
| block_files_unittest.cc | 90 CacheAddr entries[kNumEntries];
104 CacheAddr temp = entries[source1];
|
| backend_impl.h | 268 typedef base::hash_map<CacheAddr, EntryImpl*> EntriesMap;
|
| entry_impl.h | 76 CacheAddr GetNextAddress();
|
| backend_impl.cc | 69 size_t table_size = sizeof(disk_cache::CacheAddr) * table_len;
918 CacheAddr child(entry->GetNextAddress());
[all...] |
| entry_impl.cc | 512 CacheAddr EntryImpl::GetNextAddress() {
[all...] |
| /external/chromium_org/net/tools/dump_cache/ |
| dump_files.cc | 58 void DumpStats(const base::FilePath& path, disk_cache::CacheAddr addr) {
97 disk_cache::CacheAddr* stats_addr) {
170 bool LoadEntry(disk_cache::CacheAddr addr, disk_cache::EntryStore* entry);
171 bool LoadRankings(disk_cache::CacheAddr addr,
180 disk_cache::CacheAddr next_addr_;
181 std::set<disk_cache::CacheAddr> dumped_entries_;
233 bool CacheDumper::LoadEntry(disk_cache::CacheAddr addr,
258 bool CacheDumper::LoadRankings(disk_cache::CacheAddr addr,
340 disk_cache::CacheAddr stats_addr = 0;
|
| /external/chromium/net/tools/dump_cache/ |
| dump_files.cc | 125 bool LoadEntry(disk_cache::CacheAddr addr, disk_cache::EntryStore* entry);
126 bool LoadRankings(disk_cache::CacheAddr addr,
135 disk_cache::CacheAddr next_addr_;
136 std::set<disk_cache::CacheAddr> dumped_entries_;
189 bool CacheDumper::LoadEntry(disk_cache::CacheAddr addr,
214 bool CacheDumper::LoadRankings(disk_cache::CacheAddr addr,
|
| /external/chromium_org/net/disk_cache/v3/ |
| disk_format_v3.h | 10 // will be stored as a series of blocks on a block-file. In any case, CacheAddr
67 CacheAddr stats; // Storage for usage data.
164 CacheAddr data_addr[4]; // entry.
|
| backend_impl_v3.h | 198 typedef base::hash_map<CacheAddr, EntryImpl*> EntriesMap;
|
| block_bitmaps_unittest.cc | 89 CacheAddr entries[kNumEntries];
103 CacheAddr temp = entries[source1];
|
| backend_worker.cc | 71 size_t table_size = sizeof(disk_cache::CacheAddr) * table_len;
|
| backend_impl_v3.cc | 71 size_t table_size = sizeof(disk_cache::CacheAddr) * table_len;
209 CacheAddr child(entry->GetNextAddress());
[all...] |
