Cross Reference: /external/chromium/net/disk_cache/entry

Lines Matching defs:stored
112   // actual file has |eof| bytes stored. Note that the number of bytes to read
574   EntryStore* stored = entry_.Data();
575   if (!stored->rankings_node || stored->key_len <= 0)
578   if (stored->reuse_count < 0 || stored->refetch_count < 0)
581   Addr rankings_addr(stored->rankings_node);
586   Addr next_addr(stored->next);
594   if (stored->state > ENTRY_DOOMED || stored->state < ENTRY_NORMAL)
597   Addr key_addr(stored->long_key);
598   if ((stored->key_len <= kMaxInternalKeyLength && key_addr.is_initialized()) ||
599       (stored->key_len > kMaxInternalKeyLength && !key_addr.is_initialized()))
606       ((stored->key_len <= kMaxBlockSize && key_addr.is_separate_file()) ||
607       (stored->key_len > kMaxBlockSize && key_addr.is_block_file())))
610   int num_blocks = NumBlocksForEntry(stored->key_len);
618   EntryStore* stored = entry_.Data();
619   Addr key_addr(stored->long_key);
622   if (!key_addr.is_initialized() && stored->key[stored->key_len])
625   if (stored->hash != Hash(GetKey()))
629     Addr data_addr(stored->data_addr[i]);
630     int data_size = stored->data_size[i];
648   EntryStore* stored = entry_.Data();
649   Addr key_addr(stored->long_key);
652     stored->key[stored->key_len] = '\0';
655     Addr data_addr(stored->data_addr[i]);
656     int data_size = stored->data_size[i];
662         stored->data_addr[i] = 0;
663         // In general, trust the stored size as it should be in sync with the
668       stored->data_size[i] = 0;
725   // The longest key that can be stored using one block.
1186 // We keep a memory buffer for everything that ends up stored on a block file
1191 // In general, a buffer may overlap data already stored on disk, and in that
1226 // We get to this function with some data already stored. If there is a
1227 // truncation that results on data stored internally, we'll explicitly