Cross Reference: /external/chromium_org/net/disk_cache/blockfile/entry_impl

Lines Matching defs:stored
65   // actual file has |eof| bytes stored. Note that the number of bytes to read
338   EntryStore* stored = entry_.Data();
339   if (!stored->rankings_node || stored->key_len <= 0)
342   if (stored->reuse_count < 0 || stored->refetch_count < 0)
345   Addr rankings_addr(stored->rankings_node);
349   Addr next_addr(stored->next);
356   if (stored->state > ENTRY_DOOMED || stored->state < ENTRY_NORMAL)
359   Addr key_addr(stored->long_key);
360   if ((stored->key_len <= kMaxInternalKeyLength && key_addr.is_initialized()) ||
361       (stored->key_len > kMaxInternalKeyLength && !key_addr.is_initialized()))
368       ((stored->key_len < kMaxBlockSize && key_addr.is_separate_file()) ||
369        (stored->key_len >= kMaxBlockSize && key_addr.is_block_file())))
372   int num_blocks = NumBlocksForEntry(stored->key_len);
380   EntryStore* stored = entry_.Data();
381   Addr key_addr(stored->long_key);
384   if (!key_addr.is_initialized() && stored->key[stored->key_len])
387   if (stored->hash != base::Hash(GetKey()))
391     Addr data_addr(stored->data_addr[i]);
392     int data_size = stored->data_size[i];
410   EntryStore* stored = entry_.Data();
411   Addr key_addr(stored->long_key);
414     stored->key[stored->key_len] = '\0';
417     Addr data_addr(stored->data_addr[i]);
418     int data_size = stored->data_size[i];
425         stored->data_addr[i] = 0;
426         // In general, trust the stored size as it should be in sync with the
431       stored->data_size[i] = 0;
1082 // We keep a memory buffer for everything that ends up stored on a block file
1087 // In general, a buffer may overlap data already stored on disk, and in that
1122 // We get to this function with some data already stored. If there is a
1123 // truncation that results on data stored internally, we'll explicitly