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

Lines Matching refs:data_
272   if (data_->header.experiment != 0 && cache_type_ != net::DISK_CACHE) {
279     if (!InitExperiment(&data_->header.experiment))
294   data_->header.this_id++;
295   if (!data_->header.this_id)
296     data_->header.this_id++;
298   if (data_->header.crash) {
302     data_->header.crash = 1;
310   if (!stats_.Init(this, &data_->header.stats))
328   if (data_)
329     data_->header.crash = 0;
343   int32 not_deleted = data_->header.num_entries -
344                       data_->header.lru.sizes[Rankings::DELETED];
402   Addr entry_address(data_->table[hash & mask_]);
463     data_->table[hash & mask_] = entry_address.value();
629   item.second = StringPrintf("%d", data_->header.num_entries);
641   item.second = StringPrintf("%d", data_->header.num_bytes);
689   int file_number = data_->header.last_file + 1;
715   data_->header.last_file = file_number;
730   return &data_->header.lru;
750   if (data_->table[hash & mask_])
753   data_->table[hash & mask_] = address.value();
771     data_->table[hash & mask_] = child;
814   return data_->header.this_id;
856   int group = data_->header.num_bytes / (50 * 1024 * 1024);
880   DCHECK(data_->header.create_time);
882   Time create_time = Time::FromInternalValue(data_->header.create_time);
889   int avg_size = data_->header.num_bytes / GetEntryCount();
893   int large_ratio = large_entries_bytes * 100 / data_->header.num_bytes;
899               data_->header.lru.sizes[0] * 100 / data_->header.num_entries);
901               data_->header.lru.sizes[1] * 100 / data_->header.num_entries);
903               data_->header.lru.sizes[2] * 100 / data_->header.num_entries);
919   data_->header.table_len = 1;
955   if (!data_)
1011   if (num_entries != data_->header.num_entries) {
1069   data_ = reinterpret_cast<Index*>(index_->Init(index_name, 0));
1070   if (!data_) {
1084   DCHECK(!table_len || data_->header.magic);
1094     available += data_->header.num_bytes;
1138   data_->header.crash = 0;
1140   data_ = NULL;
1197   Addr address(data_->table[hash & mask_]);
1227         data_->table[hash & mask_] = child.value();
1240       address.set_value(data_->table[hash & mask_]);
1467   data_->header.num_bytes += bytes;
1468   DCHECK(data_->header.num_bytes >= 0);
1470   if (data_->header.num_bytes > max_size_)
1475   data_->header.num_bytes -= bytes;
1476   DCHECK(data_->header.num_bytes >= 0);
1495   data_->header.num_entries++;
1496   DCHECK(data_->header.num_entries > 0);
1500   data_->header.num_entries--;
1501   if (data_->header.num_entries < 0) {
1503     data_->header.num_entries = 0;
1517   CACHE_UMA(COUNTS, "Entries", 0, data_->header.num_entries);
1518   CACHE_UMA(COUNTS, "Size", 0, data_->header.num_bytes / (1024 * 1024));
1527   if (!data_->header.create_time || !data_->header.lru.filled)
1544   if (!use_hours || !GetEntryCount() || !data_->header.num_bytes)
1553   int avg_size = data_->header.num_bytes / GetEntryCount();
1557   int large_ratio = large_entries_bytes * 100 / data_->header.num_bytes;
1563               data_->header.lru.sizes[0] * 100 / data_->header.num_entries);
1565               data_->header.lru.sizes[1] * 100 / data_->header.num_entries);
1567               data_->header.lru.sizes[2] * 100 / data_->header.num_entries);
1569               data_->header.lru.sizes[4] * 100 / data_->header.num_entries);
1579   DCHECK(0x20000 == data_->header.version);
1580   data_->header.version = 0x20001;
1581   data_->header.lru.sizes[Rankings::NO_USE] = data_->header.num_entries;
1585   DCHECK(data_);
1595     if (kIndexMagic != data_->header.magic ||
1596         kCurrentVersion >> 16 != data_->header.version >> 16) {
1600     if (kCurrentVersion == data_->header.version) {
1605     if (kIndexMagic != data_->header.magic ||
1606         kCurrentVersion != data_->header.version) {
1612   if (!data_->header.table_len) {
1617   if (current_size < GetIndexSize(data_->header.table_len) ||
1618       data_->header.table_len & (kBaseTableLen - 1)) {
1623   AdjustMaxCacheSize(data_->header.table_len);
1625   if (data_->header.num_bytes < 0) {
1630   if (data_->header.num_entries < 0) {
1636     mask_ = data_->header.table_len - 1;
1646     Addr address(data_->table[i]);
1671   if (num_entries + num_dirty != data_->header.num_entries) {