1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121
|
// Copyright 2013 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "net/disk_cache/simple/simple_synchronous_entry.h"
#include <algorithm>
#include <cstring>
#include <functional>
#include <limits>
#include <optional>
#include "base/compiler_specific.h"
#include "base/containers/span.h"
#include "base/files/file_util.h"
#include "base/hash/hash.h"
#include "base/location.h"
#include "base/memory/ptr_util.h"
#include "base/memory/raw_ptr.h"
#include "base/metrics/field_trial_params.h"
#include "base/metrics/histogram_macros.h"
#include "base/metrics/histogram_macros_local.h"
#include "base/numerics/checked_math.h"
#include "base/numerics/safe_conversions.h"
#include "base/strings/string_view_util.h"
#include "base/task/sequenced_task_runner.h"
#include "base/timer/elapsed_timer.h"
#include "crypto/hash.h"
#include "net/base/hash_value.h"
#include "net/base/io_buffer.h"
#include "net/base/net_errors.h"
#include "net/disk_cache/cache_util.h"
#include "net/disk_cache/simple/simple_backend_version.h"
#include "net/disk_cache/simple/simple_histogram_enums.h"
#include "net/disk_cache/simple/simple_histogram_macros.h"
#include "net/disk_cache/simple/simple_util.h"
#include "third_party/abseil-cpp/absl/container/inlined_vector.h"
#include "third_party/zlib/zlib.h"
using base::FilePath;
using base::Time;
namespace disk_cache {
namespace {
void RecordSyncOpenResult(net::CacheType cache_type, OpenEntryResult result) {
DCHECK_LT(result, OPEN_ENTRY_MAX);
SIMPLE_CACHE_LOCAL(ENUMERATION, "SyncOpenResult", cache_type, result,
OPEN_ENTRY_MAX);
}
void RecordWriteResult(net::CacheType cache_type, SyncWriteResult result) {
SIMPLE_CACHE_LOCAL(ENUMERATION, "SyncWriteResult", cache_type, result,
SYNC_WRITE_RESULT_MAX);
}
void RecordCheckEOFResult(net::CacheType cache_type, CheckEOFResult result) {
SIMPLE_CACHE_LOCAL(ENUMERATION, "SyncCheckEOFResult", cache_type, result,
CHECK_EOF_RESULT_MAX);
}
void RecordCloseResult(net::CacheType cache_type, CloseResult result) {
SIMPLE_CACHE_LOCAL(ENUMERATION, "SyncCloseResult", cache_type, result,
CLOSE_RESULT_MAX);
}
void RecordOpenPrefetchMode(net::CacheType cache_type, OpenPrefetchMode mode) {
SIMPLE_CACHE_UMA(ENUMERATION, "SyncOpenPrefetchMode", cache_type, mode,
OPEN_PREFETCH_MAX);
}
void RecordDiskCreateLatency(net::CacheType cache_type, base::TimeDelta delay) {
SIMPLE_CACHE_LOCAL(TIMES, "DiskCreateLatency", cache_type, delay);
}
bool CanOmitEmptyFile(int file_index) {
DCHECK_GE(file_index, 0);
DCHECK_LT(file_index, kSimpleEntryNormalFileCount);
return file_index == simple_util::GetFileIndexFromStreamIndex(2);
}
bool TruncatePath(const FilePath& filename_to_truncate,
BackendFileOperations* file_operations) {
int flags = base::File::FLAG_OPEN | base::File::FLAG_READ |
base::File::FLAG_WRITE | base::File::FLAG_WIN_SHARE_DELETE;
base::File file_to_truncate =
file_operations->OpenFile(filename_to_truncate, flags);
if (!file_to_truncate.IsValid())
return false;
if (!file_to_truncate.SetLength(0))
return false;
return true;
}
SimpleFileTracker::SubFile SubFileForFileIndex(int file_index) {
DCHECK_GT(kSimpleEntryNormalFileCount, file_index);
return file_index == 0 ? SimpleFileTracker::SubFile::FILE_0
: SimpleFileTracker::SubFile::FILE_1;
}
int FileIndexForSubFile(SimpleFileTracker::SubFile sub_file) {
DCHECK_NE(SimpleFileTracker::SubFile::FILE_SPARSE, sub_file);
return sub_file == SimpleFileTracker::SubFile::FILE_0 ? 0 : 1;
}
} // namespace
// Helper class to track a range of data prefetched from a file.
class SimpleSynchronousEntry::PrefetchData final {
public:
explicit PrefetchData(size_t file_size)
: file_size_(file_size), earliest_requested_offset_(file_size) {}
// Returns true if the specified range within the file has been completely
// prefetched. Returns false if any part of the range has not been
// prefetched.
bool HasData(size_t offset, size_t length) {
size_t end = 0;
if (!base::CheckAdd(offset, length).AssignIfValid(&end))
return false;
UpdateEarliestOffset(offset);
return offset >= offset_in_file_ &&
end <= (offset_in_file_ + buffer_.size());
}
// Read the given range out of the prefetch buffer into the target
// destination buffer. If the range is not wholely contained within
// the prefetch buffer than no data will be written to the target
// buffer. Returns true if the range has been copied.
bool ReadData(size_t offset, size_t length, base::span<uint8_t> dest) {
if (!length)
return true;
if (!HasData(offset, length))
return false;
DCHECK(offset >= offset_in_file_);
size_t buffer_offset = offset - offset_in_file_;
dest.copy_prefix_from(
base::as_byte_span(buffer_).subspan(buffer_offset, length));
return true;
}
// Populate the prefetch buffer from the given file and range. Returns
// true if the data is successfully read.
bool PrefetchFromFile(SimpleFileTracker::FileHandle* file,
size_t offset,
size_t length) {
DCHECK(file);
if (!buffer_.empty()) {
return false;
}
buffer_.resize(length);
if (!file->get()->ReadAndCheck(offset,
base::as_writable_byte_span(buffer_))) {
buffer_.resize(0);
return false;
}
offset_in_file_ = offset;
return true;
}
// Return how much trailing data has been requested via HasData() or
// ReadData(). The intent is that this value can be used to tune
// future prefetching behavior.
size_t GetDesiredTrailerPrefetchSize() const {
return file_size_ - earliest_requested_offset_;
}
private:
// Track the earliest offset requested in order to return an optimal trailer
// prefetch amount in GetDesiredTrailerPrefetchSize().
void UpdateEarliestOffset(size_t offset) {
DCHECK_LE(earliest_requested_offset_, file_size_);
earliest_requested_offset_ = std::min(earliest_requested_offset_, offset);
}
const size_t file_size_;
// Prefer to read the prefetch data into a stack buffer to minimize
// memory pressure on the OS disk cache.
absl::InlinedVector<char, 1024> buffer_;
size_t offset_in_file_ = 0;
size_t earliest_requested_offset_;
};
class SimpleSynchronousEntry::ScopedFileOperationsBinding final {
public:
ScopedFileOperationsBinding(SimpleSynchronousEntry* owner,
BackendFileOperations** file_operations)
: owner_(owner),
file_operations_(owner->unbound_file_operations_->Bind(
base::SequencedTaskRunner::GetCurrentDefault())) {
*file_operations = file_operations_.get();
}
~ScopedFileOperationsBinding() {
owner_->unbound_file_operations_ = file_operations_->Unbind();
}
private:
const raw_ptr<SimpleSynchronousEntry> owner_;
std::unique_ptr<BackendFileOperations> file_operations_;
};
using simple_util::GetEntryHashKey;
using simple_util::GetFilenameFromEntryFileKeyAndFileIndex;
using simple_util::GetSparseFilenameFromEntryFileKey;
using simple_util::GetHeaderSize;
using simple_util::GetDataSizeFromFileSize;
using simple_util::GetFileSizeFromDataSize;
using simple_util::GetFileIndexFromStreamIndex;
BASE_FEATURE(kSimpleCachePrefetchExperiment,
"SimpleCachePrefetchExperiment2",
base::FEATURE_DISABLED_BY_DEFAULT);
const char kSimpleCacheFullPrefetchBytesParam[] = "FullPrefetchBytes";
constexpr base::FeatureParam<int> kSimpleCacheFullPrefetchSize{
&kSimpleCachePrefetchExperiment, kSimpleCacheFullPrefetchBytesParam, 0};
const char kSimpleCacheTrailerPrefetchSpeculativeBytesParam[] =
"TrailerPrefetchSpeculativeBytes";
constexpr base::FeatureParam<int> kSimpleCacheTrailerPrefetchSpeculativeBytes{
&kSimpleCachePrefetchExperiment,
kSimpleCacheTrailerPrefetchSpeculativeBytesParam, 0};
int GetSimpleCacheFullPrefetchSize() {
return kSimpleCacheFullPrefetchSize.Get();
}
int GetSimpleCacheTrailerPrefetchSize(int hint_size) {
if (hint_size > 0)
return hint_size;
return kSimpleCacheTrailerPrefetchSpeculativeBytes.Get();
}
SimpleEntryStat::SimpleEntryStat(
base::Time last_used,
const std::array<int32_t, kSimpleEntryStreamCount>& data_size,
const uint64_t sparse_data_size)
: last_used_(last_used),
data_size_(data_size),
sparse_data_size_(sparse_data_size) {}
// These size methods all assume the presence of the SHA256 on stream zero,
// since this version of the cache always writes it. In the read case, it may
// not be present and these methods can't be relied upon.
int SimpleEntryStat::GetOffsetInFile(size_t key_length,
int offset,
int stream_index) const {
const size_t headers_size = sizeof(SimpleFileHeader) + key_length;
const size_t additional_offset =
stream_index == 0 ? data_size_[1] + sizeof(SimpleFileEOF) : 0;
return headers_size + offset + additional_offset;
}
int SimpleEntryStat::GetEOFOffsetInFile(size_t key_length,
int stream_index) const {
size_t additional_offset;
if (stream_index != 0)
additional_offset = 0;
else
additional_offset = sizeof(net::SHA256HashValue);
return additional_offset +
GetOffsetInFile(key_length, data_size_[stream_index], stream_index);
}
int SimpleEntryStat::GetLastEOFOffsetInFile(size_t key_length,
int stream_index) const {
if (stream_index == 1)
return GetEOFOffsetInFile(key_length, 0);
return GetEOFOffsetInFile(key_length, stream_index);
}
int64_t SimpleEntryStat::GetFileSize(size_t key_length, int file_index) const {
int32_t total_data_size;
if (file_index == 0) {
total_data_size = data_size_[0] + data_size_[1] +
sizeof(net::SHA256HashValue) + sizeof(SimpleFileEOF);
} else {
total_data_size = data_size_[2];
}
return GetFileSizeFromDataSize(key_length, total_data_size);
}
SimpleStreamPrefetchData::SimpleStreamPrefetchData()
: stream_crc32(crc32(0, Z_NULL, 0)) {}
SimpleStreamPrefetchData::~SimpleStreamPrefetchData() = default;
SimpleEntryCreationResults::SimpleEntryCreationResults(
SimpleEntryStat entry_stat)
: sync_entry(nullptr), entry_stat(entry_stat) {}
SimpleEntryCreationResults::~SimpleEntryCreationResults() = default;
SimpleSynchronousEntry::CRCRecord::CRCRecord() : index(-1),
has_crc32(false),
data_crc32(0) {
}
SimpleSynchronousEntry::CRCRecord::CRCRecord(int index_p,
bool has_crc32_p,
uint32_t data_crc32_p)
: index(index_p), has_crc32(has_crc32_p), data_crc32(data_crc32_p) {}
SimpleSynchronousEntry::ReadRequest::ReadRequest(int index_p,
int offset_p,
int buf_len_p)
: index(index_p), offset(offset_p), buf_len(buf_len_p) {}
SimpleSynchronousEntry::WriteRequest::WriteRequest(int index_p,
int offset_p,
int buf_len_p,
uint32_t previous_crc32_p,
bool truncate_p,
bool doomed_p,
bool request_update_crc_p)
: index(index_p),
offset(offset_p),
buf_len(buf_len_p),
previous_crc32(previous_crc32_p),
truncate(truncate_p),
doomed(doomed_p),
request_update_crc(request_update_crc_p) {}
SimpleSynchronousEntry::SparseRequest::SparseRequest(uint64_t sparse_offset_p,
size_t buf_len_p)
: sparse_offset(sparse_offset_p), buf_len(buf_len_p) {}
// static
void SimpleSynchronousEntry::OpenEntry(
net::CacheType cache_type,
const FilePath& path,
const std::optional<std::string>& key,
const uint64_t entry_hash,
SimpleFileTracker* file_tracker,
std::unique_ptr<UnboundBackendFileOperations> file_operations,
int32_t trailer_prefetch_size,
SimpleEntryCreationResults* out_results) {
base::TimeTicks start_sync_open_entry = base::TimeTicks::Now();
auto sync_entry = std::make_unique<SimpleSynchronousEntry>(
cache_type, path, key, entry_hash, file_tracker,
std::move(file_operations), trailer_prefetch_size);
{
BackendFileOperations* bound_file_operations = nullptr;
ScopedFileOperationsBinding binding(sync_entry.get(),
&bound_file_operations);
out_results->result = sync_entry->InitializeForOpen(
bound_file_operations, &out_results->entry_stat,
out_results->stream_prefetch_data);
}
if (out_results->result != net::OK) {
sync_entry->Doom();
sync_entry->CloseFiles();
out_results->sync_entry = nullptr;
out_results->unbound_file_operations =
std::move(sync_entry->unbound_file_operations_);
out_results->stream_prefetch_data[0].data = nullptr;
out_results->stream_prefetch_data[1].data = nullptr;
return;
}
SIMPLE_CACHE_UMA(TIMES, "DiskOpenLatency", cache_type,
base::TimeTicks::Now() - start_sync_open_entry);
out_results->sync_entry = sync_entry.release();
out_results->computed_trailer_prefetch_size =
out_results->sync_entry->computed_trailer_prefetch_size();
}
// static
void SimpleSynchronousEntry::CreateEntry(
net::CacheType cache_type,
const FilePath& path,
const std::string& key,
const uint64_t entry_hash,
SimpleFileTracker* file_tracker,
std::unique_ptr<UnboundBackendFileOperations> file_operations,
SimpleEntryCreationResults* out_results) {
DCHECK_EQ(entry_hash, GetEntryHashKey(key));
base::TimeTicks start_sync_create_entry = base::TimeTicks::Now();
auto sync_entry = std::make_unique<SimpleSynchronousEntry>(
cache_type, path, key, entry_hash, file_tracker,
std::move(file_operations), -1);
{
BackendFileOperations* bound_file_operations = nullptr;
ScopedFileOperationsBinding binding(sync_entry.get(),
&bound_file_operations);
out_results->result = sync_entry->InitializeForCreate(
bound_file_operations, &out_results->entry_stat);
}
if (out_results->result != net::OK) {
if (out_results->result != net::ERR_FILE_EXISTS)
sync_entry->Doom();
sync_entry->CloseFiles();
out_results->unbound_file_operations =
std::move(sync_entry->unbound_file_operations_);
out_results->sync_entry = nullptr;
return;
}
out_results->sync_entry = sync_entry.release();
out_results->created = true;
RecordDiskCreateLatency(cache_type,
base::TimeTicks::Now() - start_sync_create_entry);
}
// static
void SimpleSynchronousEntry::OpenOrCreateEntry(
net::CacheType cache_type,
const FilePath& path,
const std::string& key,
const uint64_t entry_hash,
OpenEntryIndexEnum index_state,
bool optimistic_create,
SimpleFileTracker* file_tracker,
std::unique_ptr<UnboundBackendFileOperations> file_operations,
int32_t trailer_prefetch_size,
SimpleEntryCreationResults* out_results) {
base::TimeTicks start = base::TimeTicks::Now();
if (index_state == INDEX_MISS) {
// Try to just create.
auto sync_entry = std::make_unique<SimpleSynchronousEntry>(
cache_type, path, key, entry_hash, file_tracker,
std::move(file_operations), trailer_prefetch_size);
{
BackendFileOperations* bound_file_operations = nullptr;
ScopedFileOperationsBinding binding(sync_entry.get(),
&bound_file_operations);
out_results->result = sync_entry->InitializeForCreate(
bound_file_operations, &out_results->entry_stat);
}
switch (out_results->result) {
case net::OK:
out_results->sync_entry = sync_entry.release();
out_results->created = true;
RecordDiskCreateLatency(cache_type, base::TimeTicks::Now() - start);
return;
case net::ERR_FILE_EXISTS:
// Our index was messed up.
if (optimistic_create) {
// In this case, ::OpenOrCreateEntry already returned claiming it made
// a new entry. Try extra-hard to make that the actual case.
sync_entry->Doom();
sync_entry->CloseFiles();
file_operations = std::move(sync_entry->unbound_file_operations_);
sync_entry = nullptr;
CreateEntry(cache_type, path, key, entry_hash, file_tracker,
std::move(file_operations), out_results);
return;
}
// Otherwise can just try opening.
break;
default:
// Trouble. Fail this time.
sync_entry->Doom();
sync_entry->CloseFiles();
out_results->unbound_file_operations =
std::move(sync_entry->unbound_file_operations_);
return;
}
file_operations = std::move(sync_entry->unbound_file_operations_);
}
DCHECK(file_operations);
// Try open, then if that fails create.
OpenEntry(cache_type, path, key, entry_hash, file_tracker,
std::move(file_operations), trailer_prefetch_size, out_results);
if (out_results->sync_entry)
return;
file_operations = std::move(out_results->unbound_file_operations);
DCHECK(file_operations);
CreateEntry(cache_type, path, key, entry_hash, file_tracker,
std::move(file_operations), out_results);
}
// static
int SimpleSynchronousEntry::DeleteEntryFiles(
const FilePath& path,
net::CacheType cache_type,
uint64_t entry_hash,
std::unique_ptr<UnboundBackendFileOperations> unbound_file_operations) {
auto file_operations = unbound_file_operations->Bind(
base::SequencedTaskRunner::GetCurrentDefault());
return DeleteEntryFilesInternal(path, cache_type, entry_hash,
file_operations.get());
}
// static
int SimpleSynchronousEntry::DeleteEntryFilesInternal(
const FilePath& path,
net::CacheType cache_type,
uint64_t entry_hash,
BackendFileOperations* file_operations) {
base::TimeTicks start = base::TimeTicks::Now();
const bool deleted_well =
DeleteFilesForEntryHash(path, entry_hash, file_operations);
SIMPLE_CACHE_UMA(TIMES, "DiskDoomLatency", cache_type,
base::TimeTicks::Now() - start);
return deleted_well ? net::OK : net::ERR_FAILED;
}
int SimpleSynchronousEntry::Doom() {
BackendFileOperations* file_operations = nullptr;
ScopedFileOperationsBinding binding(this, &file_operations);
return DoomInternal(file_operations);
}
int SimpleSynchronousEntry::DoomInternal(
BackendFileOperations* file_operations) {
if (entry_file_key_.doom_generation != 0u) {
// Already doomed.
return true;
}
if (have_open_files_) {
base::TimeTicks start = base::TimeTicks::Now();
bool ok = true;
SimpleFileTracker::EntryFileKey orig_key = entry_file_key_;
file_tracker_->Doom(this, &entry_file_key_);
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
if (!empty_file_omitted_[i]) {
base::File::Error out_error;
FilePath old_name = path_.AppendASCII(
GetFilenameFromEntryFileKeyAndFileIndex(orig_key, i));
FilePath new_name = path_.AppendASCII(
GetFilenameFromEntryFileKeyAndFileIndex(entry_file_key_, i));
ok = file_operations->ReplaceFile(old_name, new_name, &out_error) && ok;
}
}
if (sparse_file_open()) {
base::File::Error out_error;
FilePath old_name =
path_.AppendASCII(GetSparseFilenameFromEntryFileKey(orig_key));
FilePath new_name =
path_.AppendASCII(GetSparseFilenameFromEntryFileKey(entry_file_key_));
ok = file_operations->ReplaceFile(old_name, new_name, &out_error) && ok;
}
SIMPLE_CACHE_UMA(TIMES, "DiskDoomLatency", cache_type_,
base::TimeTicks::Now() - start);
return ok ? net::OK : net::ERR_FAILED;
} else {
// No one has ever called Create or Open on us, so we don't have to worry
// about being accessible to other ops after doom.
return DeleteEntryFilesInternal(
path_, cache_type_, entry_file_key_.entry_hash, file_operations);
}
}
// static
int SimpleSynchronousEntry::TruncateEntryFiles(
const base::FilePath& path,
uint64_t entry_hash,
std::unique_ptr<UnboundBackendFileOperations> unbound_file_operations) {
auto file_operations = unbound_file_operations->Bind(
base::SequencedTaskRunner::GetCurrentDefault());
const bool deleted_well =
TruncateFilesForEntryHash(path, entry_hash, file_operations.get());
return deleted_well ? net::OK : net::ERR_FAILED;
}
// static
int SimpleSynchronousEntry::DeleteEntrySetFiles(
const std::vector<uint64_t>* key_hashes,
const FilePath& path,
std::unique_ptr<UnboundBackendFileOperations> unbound_file_operations) {
auto file_operations = unbound_file_operations->Bind(
base::SequencedTaskRunner::GetCurrentDefault());
const size_t did_delete_count = std::ranges::count_if(
*key_hashes, [&path, &file_operations](const uint64_t& key_hash) {
return SimpleSynchronousEntry::DeleteFilesForEntryHash(
path, key_hash, file_operations.get());
});
return (did_delete_count == key_hashes->size()) ? net::OK : net::ERR_FAILED;
}
void SimpleSynchronousEntry::ReadData(const ReadRequest& in_entry_op,
SimpleEntryStat* entry_stat,
net::IOBuffer* out_buf,
ReadResult* out_result) {
DCHECK(initialized_);
DCHECK_NE(0, in_entry_op.index);
BackendFileOperations* file_operations = nullptr;
ScopedFileOperationsBinding binding(this, &file_operations);
int file_index = GetFileIndexFromStreamIndex(in_entry_op.index);
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations, this, SubFileForFileIndex(file_index));
out_result->crc_updated = false;
if (!file.IsOK() || (header_and_key_check_needed_[file_index] &&
!CheckHeaderAndKey(file.get(), file_index))) {
out_result->result = net::ERR_FAILED;
DoomInternal(file_operations);
return;
}
const int64_t file_offset = entry_stat->GetOffsetInFile(
key_->size(), in_entry_op.offset, in_entry_op.index);
// Zero-length reads and reads to the empty streams of omitted files should
// be handled in the SimpleEntryImpl.
DCHECK_GT(in_entry_op.buf_len, 0);
DCHECK(!empty_file_omitted_[file_index]);
std::optional<size_t> bytes_read = file->Read(
file_offset,
out_buf->first(base::checked_cast<size_t>(in_entry_op.buf_len)));
if (bytes_read.value_or(0) > 0) {
entry_stat->set_last_used(Time::Now());
if (in_entry_op.request_update_crc) {
out_result->updated_crc32 = simple_util::IncrementalCrc32(
in_entry_op.previous_crc32, out_buf->data(), *bytes_read);
out_result->crc_updated = true;
// Verify checksum after last read, if we've been asked to.
if (in_entry_op.request_verify_crc &&
in_entry_op.offset + base::checked_cast<int64_t>(*bytes_read) ==
entry_stat->data_size(in_entry_op.index)) {
int checksum_result =
CheckEOFRecord(file_operations, file.get(), in_entry_op.index,
*entry_stat, out_result->updated_crc32);
if (checksum_result < 0) {
out_result->result = checksum_result;
return;
}
}
}
}
if (bytes_read.has_value()) {
out_result->result = *bytes_read;
} else {
out_result->result = net::ERR_CACHE_READ_FAILURE;
DoomInternal(file_operations);
}
}
void SimpleSynchronousEntry::WriteData(const WriteRequest& in_entry_op,
net::IOBuffer* in_buf,
SimpleEntryStat* out_entry_stat,
WriteResult* out_write_result) {
BackendFileOperations* file_operations = nullptr;
ScopedFileOperationsBinding binding(this, &file_operations);
base::ElapsedTimer write_time;
DCHECK(initialized_);
DCHECK_NE(0, in_entry_op.index);
int index = in_entry_op.index;
int file_index = GetFileIndexFromStreamIndex(index);
if (header_and_key_check_needed_[file_index] &&
!empty_file_omitted_[file_index]) {
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations, this, SubFileForFileIndex(file_index));
if (!file.IsOK() || !CheckHeaderAndKey(file.get(), file_index)) {
out_write_result->result = net::ERR_FAILED;
DoomInternal(file_operations);
return;
}
}
int offset = in_entry_op.offset;
int buf_len = in_entry_op.buf_len;
bool truncate = in_entry_op.truncate;
bool doomed = in_entry_op.doomed;
size_t key_size = key_->size();
const int64_t file_offset = out_entry_stat->GetOffsetInFile(
key_size, in_entry_op.offset, in_entry_op.index);
bool extending_by_write = offset + buf_len > out_entry_stat->data_size(index);
if (empty_file_omitted_[file_index]) {
// Don't create a new file if the entry has been doomed, to avoid it being
// mixed up with a newly-created entry with the same key.
if (doomed) {
DLOG(WARNING) << "Rejecting write to lazily omitted stream "
<< in_entry_op.index << " of doomed cache entry.";
RecordWriteResult(cache_type_,
SYNC_WRITE_RESULT_LAZY_STREAM_ENTRY_DOOMED);
out_write_result->result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
base::File::Error error;
if (!MaybeCreateFile(file_operations, file_index, FILE_REQUIRED, &error)) {
RecordWriteResult(cache_type_, SYNC_WRITE_RESULT_LAZY_CREATE_FAILURE);
DoomInternal(file_operations);
out_write_result->result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
if (!InitializeCreatedFile(file_operations, file_index)) {
RecordWriteResult(cache_type_, SYNC_WRITE_RESULT_LAZY_INITIALIZE_FAILURE);
DoomInternal(file_operations);
out_write_result->result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
}
DCHECK(!empty_file_omitted_[file_index]);
// This needs to be grabbed after the above block, since that's what may
// create the file (for stream 2/file 1).
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations, this, SubFileForFileIndex(file_index));
if (!file.IsOK()) {
out_write_result->result = net::ERR_FAILED;
DoomInternal(file_operations);
return;
}
if (extending_by_write) {
// The EOF record and the eventual stream afterward need to be zeroed out.
const int64_t file_eof_offset =
out_entry_stat->GetEOFOffsetInFile(key_size, index);
if (!file->SetLength(file_eof_offset)) {
RecordWriteResult(cache_type_, SYNC_WRITE_RESULT_PRETRUNCATE_FAILURE);
DoomInternal(file_operations);
out_write_result->result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
}
if (buf_len > 0) {
if (!file->WriteAndCheck(
file_offset, in_buf->first(base::checked_cast<size_t>(buf_len)))) {
RecordWriteResult(cache_type_, SYNC_WRITE_RESULT_WRITE_FAILURE);
DoomInternal(file_operations);
out_write_result->result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
}
if (!truncate && (buf_len > 0 || !extending_by_write)) {
out_entry_stat->set_data_size(
index, std::max(out_entry_stat->data_size(index), offset + buf_len));
} else {
out_entry_stat->set_data_size(index, offset + buf_len);
int file_eof_offset =
out_entry_stat->GetLastEOFOffsetInFile(key_size, index);
if (!file->SetLength(file_eof_offset)) {
RecordWriteResult(cache_type_, SYNC_WRITE_RESULT_TRUNCATE_FAILURE);
DoomInternal(file_operations);
out_write_result->result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
}
if (in_entry_op.request_update_crc && buf_len > 0) {
out_write_result->updated_crc32 = simple_util::IncrementalCrc32(
in_entry_op.previous_crc32, in_buf->data(), buf_len);
out_write_result->crc_updated = true;
}
SIMPLE_CACHE_UMA(TIMES, "DiskWriteLatency", cache_type_,
write_time.Elapsed());
RecordWriteResult(cache_type_, SYNC_WRITE_RESULT_SUCCESS);
base::Time modification_time = Time::Now();
out_entry_stat->set_last_used(modification_time);
out_write_result->result = buf_len;
}
void SimpleSynchronousEntry::ReadSparseData(const SparseRequest& in_entry_op,
net::IOBuffer* out_buf,
base::Time* out_last_used,
int* out_result) {
DCHECK(initialized_);
BackendFileOperations* file_operations = nullptr;
ScopedFileOperationsBinding binding(this, &file_operations);
uint64_t offset = in_entry_op.sparse_offset;
size_t buf_len = in_entry_op.buf_len;
base::span<uint8_t> buf = out_buf->span();
if (!sparse_file_open() || !buf_len) {
*out_result = 0;
return;
}
SimpleFileTracker::FileHandle sparse_file = file_tracker_->Acquire(
file_operations, this, SimpleFileTracker::SubFile::FILE_SPARSE);
if (!sparse_file.IsOK()) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_READ_FAILURE;
return;
}
size_t read_so_far = 0;
// Find the first sparse range at or after the requested offset.
auto it = sparse_ranges_.lower_bound(offset);
if (it != sparse_ranges_.begin()) {
// Hop back one range and read the one overlapping with the start.
--it;
SparseRange* found_range = &it->second;
CHECK_EQ(it->first, found_range->offset);
CHECK(base::CheckAdd(found_range->offset, found_range->length).IsValid());
if (found_range->offset + found_range->length > offset) {
CHECK_LE(offset - found_range->offset,
std::numeric_limits<size_t>::max());
size_t offset_in_range =
base::checked_cast<size_t>(offset - found_range->offset);
size_t range_len_after_offset = found_range->length - offset_in_range;
size_t len_to_read = std::min(buf_len, range_len_after_offset);
if (!ReadSparseRange(sparse_file.get(), found_range, offset_in_range,
len_to_read, buf)) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_READ_FAILURE;
return;
}
read_so_far += len_to_read;
}
++it;
}
// Keep reading until the buffer is full or there is not another contiguous
// range.
while (read_so_far < buf_len && it != sparse_ranges_.end() &&
it->second.offset == offset + read_so_far) {
SparseRange* found_range = &it->second;
CHECK_EQ(it->first, found_range->offset);
size_t range_len = found_range->length;
size_t len_to_read = std::min(buf_len - read_so_far, range_len);
if (!ReadSparseRange(sparse_file.get(), found_range, 0, len_to_read,
buf.subspan(read_so_far))) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_READ_FAILURE;
return;
}
read_so_far += len_to_read;
++it;
}
// The length to read is limited to each sparse data which is far smaller than
// int max.
*out_result = base::checked_cast<int>(read_so_far);
}
void SimpleSynchronousEntry::WriteSparseData(const SparseRequest& in_entry_op,
net::IOBuffer* in_buf,
uint64_t max_sparse_data_size,
SimpleEntryStat* out_entry_stat,
int* out_result) {
DCHECK(initialized_);
BackendFileOperations* file_operations = nullptr;
ScopedFileOperationsBinding binding(this, &file_operations);
uint64_t offset = in_entry_op.sparse_offset;
size_t buf_len = in_entry_op.buf_len;
base::span<const uint8_t> buf = in_buf->span();
if (!sparse_file_open() && !CreateSparseFile(file_operations)) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
SimpleFileTracker::FileHandle sparse_file = file_tracker_->Acquire(
file_operations, this, SimpleFileTracker::SubFile::FILE_SPARSE);
if (!sparse_file.IsOK()) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
uint64_t sparse_data_size = out_entry_stat->sparse_data_size();
uint64_t future_sparse_data_size;
if (!base::CheckAdd(sparse_data_size, buf_len)
.AssignIfValid(&future_sparse_data_size)) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
// This is a pessimistic estimate; it assumes the entire buffer is going to
// be appended as a new range, not written over existing ranges.
if (future_sparse_data_size > max_sparse_data_size) {
DVLOG(1) << "Truncating sparse data file (" << sparse_data_size << " + "
<< buf_len << " > " << max_sparse_data_size << ")";
TruncateSparseFile(sparse_file.get());
out_entry_stat->set_sparse_data_size(0u);
}
size_t written_so_far = 0;
size_t appended_so_far = 0;
auto it = sparse_ranges_.lower_bound(offset);
if (it != sparse_ranges_.begin()) {
--it;
SparseRange* found_range = &it->second;
CHECK(base::CheckAdd(found_range->offset, found_range->length).IsValid());
if (found_range->offset + found_range->length > offset) {
CHECK_LE(offset - found_range->offset,
std::numeric_limits<size_t>::max());
size_t offset_in_range =
static_cast<size_t>(offset - found_range->offset);
size_t range_len_after_offset = found_range->length - offset_in_range;
size_t len_to_write = std::min(buf_len, range_len_after_offset);
if (!WriteSparseRange(sparse_file.get(), found_range, offset_in_range,
len_to_write, buf)) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
written_so_far += len_to_write;
}
++it;
}
while (written_so_far < buf_len && it != sparse_ranges_.end() &&
it->second.offset < offset + buf_len) {
SparseRange* found_range = &it->second;
if (offset + written_so_far < found_range->offset) {
size_t len_to_append =
static_cast<size_t>(found_range->offset - (offset + written_so_far));
if (!AppendSparseRange(sparse_file.get(), offset + written_so_far,
len_to_append, buf.subspan(written_so_far))) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
written_so_far += len_to_append;
appended_so_far += len_to_append;
}
size_t len_to_write =
std::min(buf_len - written_so_far, found_range->length);
if (!WriteSparseRange(sparse_file.get(), found_range, 0, len_to_write,
buf.subspan(written_so_far))) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
written_so_far += len_to_write;
++it;
}
if (written_so_far < buf_len) {
size_t len_to_append = buf_len - written_so_far;
if (!AppendSparseRange(sparse_file.get(), offset + written_so_far,
len_to_append, buf.subspan(written_so_far))) {
DoomInternal(file_operations);
*out_result = net::ERR_CACHE_WRITE_FAILURE;
return;
}
written_so_far += len_to_append;
appended_so_far += len_to_append;
}
CHECK_EQ(buf_len, written_so_far);
base::Time modification_time = Time::Now();
out_entry_stat->set_last_used(modification_time);
uint64_t old_sparse_data_size = out_entry_stat->sparse_data_size();
out_entry_stat->set_sparse_data_size(old_sparse_data_size + appended_so_far);
// The length to read is limited to each sparse data which is far smaller than
// int max.
*out_result = base::checked_cast<int>(written_so_far);
}
void SimpleSynchronousEntry::GetAvailableRange(const SparseRequest& in_entry_op,
RangeResult* out_result) {
DCHECK(initialized_);
uint64_t offset = in_entry_op.sparse_offset;
size_t len = in_entry_op.buf_len;
auto it = sparse_ranges_.lower_bound(offset);
uint64_t start = offset;
uint64_t avail_so_far = 0;
if (it != sparse_ranges_.end() && it->second.offset < offset + len) {
start = it->second.offset;
}
if ((it == sparse_ranges_.end() || it->second.offset > offset) &&
it != sparse_ranges_.begin()) {
--it;
if (it->second.offset + it->second.length > offset) {
start = offset;
avail_so_far = (it->second.offset + it->second.length) - offset;
}
++it;
}
while (start + avail_so_far < offset + len &&
it != sparse_ranges_.end() &&
it->second.offset == start + avail_so_far) {
avail_so_far += it->second.length;
++it;
}
// `range_len` must fit in size_t since it's guaranteed to be same or smaller
// than `len - (start - offset)` where `len` is within size_t range and
// `start` is same or larger than `offset`.
size_t range_len = base::checked_cast<size_t>(
std::min(avail_so_far, len - (start - offset)));
*out_result = RangeResult(start, range_len);
}
int SimpleSynchronousEntry::CheckEOFRecord(
BackendFileOperations* file_operations,
base::File* file,
int stream_index,
const SimpleEntryStat& entry_stat,
uint32_t expected_crc32) {
DCHECK(initialized_);
SimpleFileEOF eof_record;
int file_offset = entry_stat.GetEOFOffsetInFile(key_->size(), stream_index);
int file_index = GetFileIndexFromStreamIndex(stream_index);
int rv =
GetEOFRecordData(file, nullptr, file_index, file_offset, &eof_record);
if (rv != net::OK) {
DoomInternal(file_operations);
return rv;
}
if ((eof_record.flags & SimpleFileEOF::FLAG_HAS_CRC32) &&
eof_record.data_crc32 != expected_crc32) {
DVLOG(1) << "EOF record had bad crc.";
RecordCheckEOFResult(cache_type_, CHECK_EOF_RESULT_CRC_MISMATCH);
DoomInternal(file_operations);
return net::ERR_CACHE_CHECKSUM_MISMATCH;
}
RecordCheckEOFResult(cache_type_, CHECK_EOF_RESULT_SUCCESS);
return net::OK;
}
int SimpleSynchronousEntry::PreReadStreamPayload(
base::File* file,
PrefetchData* prefetch_data,
int stream_index,
int extra_size,
const SimpleEntryStat& entry_stat,
const SimpleFileEOF& eof_record,
SimpleStreamPrefetchData* out) {
DCHECK(stream_index == 0 || stream_index == 1);
int stream_size = entry_stat.data_size(stream_index);
int read_size = stream_size + extra_size;
out->data = base::MakeRefCounted<net::GrowableIOBuffer>();
out->data->SetCapacity(read_size);
int file_offset = entry_stat.GetOffsetInFile(key_->size(), 0, stream_index);
if (!ReadFromFileOrPrefetched(file, prefetch_data, 0, file_offset, read_size,
out->data->span())) {
return net::ERR_FAILED;
}
// Check the CRC32.
uint32_t expected_crc32 = simple_util::Crc32(out->data->data(), stream_size);
if ((eof_record.flags & SimpleFileEOF::FLAG_HAS_CRC32) &&
eof_record.data_crc32 != expected_crc32) {
DVLOG(1) << "EOF record had bad crc.";
RecordCheckEOFResult(cache_type_, CHECK_EOF_RESULT_CRC_MISMATCH);
return net::ERR_CACHE_CHECKSUM_MISMATCH;
}
out->stream_crc32 = expected_crc32;
RecordCheckEOFResult(cache_type_, CHECK_EOF_RESULT_SUCCESS);
return net::OK;
}
void SimpleSynchronousEntry::Close(
const SimpleEntryStat& entry_stat,
std::unique_ptr<std::vector<CRCRecord>> crc32s_to_write,
net::GrowableIOBuffer* stream_0_data,
SimpleEntryCloseResults* out_results) {
// As we delete `this`, we cannot use ScopedFileOperationsBinding here.
std::unique_ptr<BackendFileOperations> file_operations =
unbound_file_operations_->Bind(
base::SequencedTaskRunner::GetCurrentDefault());
unbound_file_operations_ = nullptr;
base::ElapsedTimer close_time;
DCHECK(stream_0_data);
const std::string& key = *key_;
for (auto& crc_record : *crc32s_to_write) {
const int stream_index = crc_record.index;
const int file_index = GetFileIndexFromStreamIndex(stream_index);
if (empty_file_omitted_[file_index])
continue;
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations.get(), this, SubFileForFileIndex(file_index));
if (!file.IsOK()) {
RecordCloseResult(cache_type_, CLOSE_RESULT_WRITE_FAILURE);
DoomInternal(file_operations.get());
break;
}
if (stream_index == 0) {
// Write stream 0 data.
int stream_0_offset = entry_stat.GetOffsetInFile(key.size(), 0, 0);
if (!file->WriteAndCheck(stream_0_offset,
stream_0_data->first(base::checked_cast<size_t>(
entry_stat.data_size(0))))) {
RecordCloseResult(cache_type_, CLOSE_RESULT_WRITE_FAILURE);
DVLOG(1) << "Could not write stream 0 data.";
DoomInternal(file_operations.get());
}
auto hash_value = crypto::hash::Sha256(key);
if (!file->WriteAndCheck(stream_0_offset + entry_stat.data_size(0),
hash_value)) {
RecordCloseResult(cache_type_, CLOSE_RESULT_WRITE_FAILURE);
DVLOG(1) << "Could not write stream 0 data.";
DoomInternal(file_operations.get());
}
// Re-compute stream 0 CRC if the data got changed (we may be here even
// if it didn't change if stream 0's position on disk got changed due to
// stream 1 write).
if (!crc_record.has_crc32) {
crc_record.data_crc32 =
simple_util::Crc32(stream_0_data->data(), entry_stat.data_size(0));
crc_record.has_crc32 = true;
}
out_results->estimated_trailer_prefetch_size =
entry_stat.data_size(0) + sizeof(hash_value) + sizeof(SimpleFileEOF);
}
SimpleFileEOF eof_record;
eof_record.stream_size = entry_stat.data_size(stream_index);
eof_record.final_magic_number = kSimpleFinalMagicNumber;
eof_record.flags = 0;
if (crc_record.has_crc32)
eof_record.flags |= SimpleFileEOF::FLAG_HAS_CRC32;
if (stream_index == 0)
eof_record.flags |= SimpleFileEOF::FLAG_HAS_KEY_SHA256;
eof_record.data_crc32 = crc_record.data_crc32;
int eof_offset = entry_stat.GetEOFOffsetInFile(key.size(), stream_index);
// If stream 0 changed size, the file needs to be resized, otherwise the
// next open will yield wrong stream sizes. On stream 1 and stream 2 proper
// resizing of the file is handled in SimpleSynchronousEntry::WriteData().
if (stream_index == 0 && !file->SetLength(eof_offset)) {
RecordCloseResult(cache_type_, CLOSE_RESULT_WRITE_FAILURE);
DVLOG(1) << "Could not truncate stream 0 file.";
DoomInternal(file_operations.get());
break;
}
if (!file->WriteAndCheck(eof_offset,
base::byte_span_from_ref(eof_record))) {
RecordCloseResult(cache_type_, CLOSE_RESULT_WRITE_FAILURE);
DVLOG(1) << "Could not write eof record.";
DoomInternal(file_operations.get());
break;
}
}
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
if (empty_file_omitted_[i])
continue;
if (header_and_key_check_needed_[i]) {
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations.get(), this, SubFileForFileIndex(i));
if (!file.IsOK() || !CheckHeaderAndKey(file.get(), i))
DoomInternal(file_operations.get());
}
CloseFile(file_operations.get(), i);
}
if (sparse_file_open()) {
CloseSparseFile(file_operations.get());
}
SIMPLE_CACHE_UMA(TIMES, "DiskCloseLatency", cache_type_,
close_time.Elapsed());
RecordCloseResult(cache_type_, CLOSE_RESULT_SUCCESS);
have_open_files_ = false;
delete this;
}
SimpleSynchronousEntry::SimpleSynchronousEntry(
net::CacheType cache_type,
const FilePath& path,
const std::optional<std::string>& key,
const uint64_t entry_hash,
SimpleFileTracker* file_tracker,
std::unique_ptr<UnboundBackendFileOperations> unbound_file_operations,
int32_t trailer_prefetch_size)
: cache_type_(cache_type),
path_(path),
entry_file_key_(entry_hash),
key_(key),
file_tracker_(file_tracker),
unbound_file_operations_(std::move(unbound_file_operations)),
trailer_prefetch_size_(trailer_prefetch_size) {
for (bool& empty_file_omitted : empty_file_omitted_) {
empty_file_omitted = false;
}
}
SimpleSynchronousEntry::~SimpleSynchronousEntry() {
DCHECK(!have_open_files_);
}
bool SimpleSynchronousEntry::MaybeOpenFile(
BackendFileOperations* file_operations,
int file_index,
base::File::Error* out_error) {
DCHECK(out_error);
FilePath filename = GetFilenameFromFileIndex(file_index);
int flags = base::File::FLAG_OPEN | base::File::FLAG_READ |
base::File::FLAG_WRITE | base::File::FLAG_WIN_SHARE_DELETE;
auto file = std::make_unique<base::File>();
*file = file_operations->OpenFile(filename, flags);
*out_error = file->error_details();
if (CanOmitEmptyFile(file_index) && !file->IsValid() &&
*out_error == base::File::FILE_ERROR_NOT_FOUND) {
empty_file_omitted_[file_index] = true;
return true;
}
if (file->IsValid()) {
file_tracker_->Register(this, SubFileForFileIndex(file_index),
std::move(file));
return true;
}
return false;
}
bool SimpleSynchronousEntry::MaybeCreateFile(
BackendFileOperations* file_operations,
int file_index,
FileRequired file_required,
base::File::Error* out_error) {
DCHECK(out_error);
if (CanOmitEmptyFile(file_index) && file_required == FILE_NOT_REQUIRED) {
empty_file_omitted_[file_index] = true;
return true;
}
FilePath filename = GetFilenameFromFileIndex(file_index);
int flags = base::File::FLAG_CREATE | base::File::FLAG_READ |
base::File::FLAG_WRITE | base::File::FLAG_WIN_SHARE_DELETE;
auto file =
std::make_unique<base::File>(file_operations->OpenFile(filename, flags));
// It's possible that the creation failed because someone deleted the
// directory (e.g. because someone pressed "clear cache" on Android).
// If so, we would keep failing for a while until periodic index snapshot
// re-creates the cache dir, so try to recover from it quickly here.
//
// This previously also checked whether the directory was missing, but that
// races against other entry creations attempting the same recovery.
if (!file->IsValid() &&
file->error_details() == base::File::FILE_ERROR_NOT_FOUND) {
file_operations->CreateDirectory(path_);
*file = file_operations->OpenFile(filename, flags);
}
*out_error = file->error_details();
if (file->IsValid()) {
file_tracker_->Register(this, SubFileForFileIndex(file_index),
std::move(file));
empty_file_omitted_[file_index] = false;
return true;
}
return false;
}
bool SimpleSynchronousEntry::OpenFiles(BackendFileOperations* file_operations,
SimpleEntryStat* out_entry_stat) {
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
base::File::Error error;
if (!MaybeOpenFile(file_operations, i, &error)) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_PLATFORM_FILE_ERROR);
SIMPLE_CACHE_LOCAL(ENUMERATION, "SyncOpenPlatformFileError", cache_type_,
-error, -base::File::FILE_ERROR_MAX);
while (--i >= 0)
CloseFile(file_operations, i);
return false;
}
}
have_open_files_ = true;
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
if (empty_file_omitted_[i]) {
out_entry_stat->set_data_size(i + 1, 0);
continue;
}
base::File::Info file_info;
SimpleFileTracker::FileHandle file =
file_tracker_->Acquire(file_operations, this, SubFileForFileIndex(i));
bool success = file.IsOK() && file->GetInfo(&file_info);
if (!success) {
DLOG(WARNING) << "Could not get platform file info.";
continue;
}
out_entry_stat->set_last_used(file_info.last_accessed);
// Two things prevent from knowing the right values for |data_size|:
// 1) The key might not be known, hence its length might be unknown.
// 2) Stream 0 and stream 1 are in the same file, and the exact size for
// each will only be known when reading the EOF record for stream 0.
//
// The size for file 0 and 1 is temporarily kept in
// |data_size(1)| and |data_size(2)| respectively. Reading the key in
// InitializeForOpen yields the data size for each file. In the case of
// file hash_1, this is the total size of stream 2, and is assigned to
// data_size(2). In the case of file 0, it is the combined size of stream
// 0, stream 1 and one EOF record. The exact distribution of sizes between
// stream 1 and stream 0 is only determined after reading the EOF record
// for stream 0 in ReadAndValidateStream0AndMaybe1.
if (!base::IsValueInRangeForNumericType<int>(file_info.size)) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_INVALID_FILE_LENGTH);
return false;
}
out_entry_stat->set_data_size(i + 1, static_cast<int>(file_info.size));
}
return true;
}
bool SimpleSynchronousEntry::CreateFiles(BackendFileOperations* file_operations,
SimpleEntryStat* out_entry_stat) {
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
base::File::Error error;
if (!MaybeCreateFile(file_operations, i, FILE_NOT_REQUIRED, &error)) {
SIMPLE_CACHE_LOCAL(ENUMERATION, "SyncCreatePlatformFileError",
cache_type_, -error, -base::File::FILE_ERROR_MAX);
while (--i >= 0)
CloseFile(file_operations, i);
return false;
}
}
have_open_files_ = true;
base::Time creation_time = Time::Now();
out_entry_stat->set_last_used(creation_time);
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i)
out_entry_stat->set_data_size(i, 0);
return true;
}
void SimpleSynchronousEntry::CloseFile(BackendFileOperations* file_operations,
int index) {
if (empty_file_omitted_[index]) {
empty_file_omitted_[index] = false;
} else {
// We want to delete files that were renamed for doom here; and we should do
// this before calling SimpleFileTracker::Close, since that would make the
// name available to other threads.
if (entry_file_key_.doom_generation != 0u) {
file_operations->DeleteFile(path_.AppendASCII(
GetFilenameFromEntryFileKeyAndFileIndex(entry_file_key_, index)));
}
file_tracker_->Close(this, SubFileForFileIndex(index));
}
}
void SimpleSynchronousEntry::CloseFiles() {
if (!have_open_files_) {
return;
}
BackendFileOperations* file_operations = nullptr;
ScopedFileOperationsBinding binding(this, &file_operations);
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i)
CloseFile(file_operations, i);
if (sparse_file_open())
CloseSparseFile(file_operations);
have_open_files_ = false;
}
bool SimpleSynchronousEntry::CheckHeaderAndKey(base::File* file,
int file_index) {
std::vector<char> header_data(
!key_.has_value() ? kInitialHeaderRead : GetHeaderSize(key_->size()));
std::optional<size_t> maybe_bytes_read =
file->Read(0, base::as_writable_byte_span(header_data));
if (maybe_bytes_read.value_or(0) < sizeof(SimpleFileHeader)) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_CANT_READ_HEADER);
return false;
}
size_t bytes_read = *maybe_bytes_read;
// SAFETY: Above check ensured that we've read at least SimpleFileHeader
// bytes, and as its a base of an array it should also be aligned properly.
const SimpleFileHeader* header = UNSAFE_BUFFERS(
reinterpret_cast<const SimpleFileHeader*>(header_data.data()));
// This resize will not invalidate iterators since it does not enlarge the
// header_data.
DCHECK_LE(bytes_read, header_data.size());
header_data.resize(bytes_read);
if (header->initial_magic_number != kSimpleInitialMagicNumber) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_BAD_MAGIC_NUMBER);
return false;
}
if (header->version != kSimpleEntryVersionOnDisk) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_BAD_VERSION);
return false;
}
size_t expected_header_size = GetHeaderSize(header->key_length);
if (header_data.size() < expected_header_size) {
size_t old_size = header_data.size();
size_t bytes_to_read = expected_header_size - old_size;
// This resize will invalidate iterators, since it is enlarging header_data.
header_data.resize(expected_header_size);
if (!file->ReadAndCheck(old_size, base::as_writable_byte_span(header_data)
.subspan(old_size, bytes_to_read))) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_CANT_READ_KEY);
return false;
}
// SAFETY: `header_data` has enough data and right alignment since the
// first read.
header = UNSAFE_BUFFERS(
reinterpret_cast<const SimpleFileHeader*>(header_data.data()));
}
base::span key_span(base::as_byte_span(header_data)
.subspan(sizeof(*header), header->key_length));
if (base::PersistentHash(key_span) != header->key_hash) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_KEY_HASH_MISMATCH);
return false;
}
std::string key_from_header(base::as_string_view(key_span));
if (!key_.has_value()) {
key_.emplace(std::move(key_from_header));
} else {
if (*key_ != key_from_header) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_KEY_MISMATCH);
return false;
}
}
header_and_key_check_needed_[file_index] = false;
return true;
}
int SimpleSynchronousEntry::InitializeForOpen(
BackendFileOperations* file_operations,
SimpleEntryStat* out_entry_stat,
std::array<SimpleStreamPrefetchData, 2>& stream_prefetch_data) {
DCHECK(!initialized_);
if (!OpenFiles(file_operations, out_entry_stat)) {
DLOG(WARNING) << "Could not open platform files for entry.";
return net::ERR_FAILED;
}
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
if (empty_file_omitted_[i])
continue;
if (!key_.has_value()) {
SimpleFileTracker::FileHandle file =
file_tracker_->Acquire(file_operations, this, SubFileForFileIndex(i));
// If |key_| is empty, we were opened via the iterator interface, without
// knowing what our key is. We must therefore read the header immediately
// to discover it, so SimpleEntryImpl can make it available to
// disk_cache::Entry::GetKey().
if (!file.IsOK() || !CheckHeaderAndKey(file.get(), i))
return net::ERR_FAILED;
} else {
// If we do know which key were are looking for, we still need to
// check that the file actually has it (rather than just being a hash
// collision or some sort of file system accident), but that can be put
// off until opportune time: either the read of the footer, or when we
// start reading in the data, depending on stream # and format revision.
header_and_key_check_needed_[i] = true;
}
size_t key_size = key_->size();
if (i == 0) {
// File size for stream 0 has been stored temporarily in data_size[1].
int ret_value_stream_0 = ReadAndValidateStream0AndMaybe1(
file_operations, out_entry_stat->data_size(1), out_entry_stat,
stream_prefetch_data);
if (ret_value_stream_0 != net::OK)
return ret_value_stream_0;
} else {
out_entry_stat->set_data_size(
2, GetDataSizeFromFileSize(key_size, out_entry_stat->data_size(2)));
const int32_t data_size_2 = out_entry_stat->data_size(2);
int ret_value_stream_2 = net::OK;
if (data_size_2 < 0) {
DLOG(WARNING) << "Stream 2 file is too small.";
ret_value_stream_2 = net::ERR_FAILED;
} else if (data_size_2 > 0) {
// Validate non empty stream 2.
SimpleFileEOF eof_record;
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations, this, SubFileForFileIndex(i));
int file_offset =
out_entry_stat->GetEOFOffsetInFile(key_size, 2 /*stream index*/);
ret_value_stream_2 =
GetEOFRecordData(file.get(), nullptr, i, file_offset, &eof_record);
}
if (ret_value_stream_2 != net::OK) {
DCHECK_EQ(i, GetFileIndexFromStreamIndex(2));
DCHECK(CanOmitEmptyFile(GetFileIndexFromStreamIndex(2)));
// Stream 2 is broken, set its size to zero to have it automatically
// deleted further down in this function. For V8 this preserves the
// cached source when only the code cache was corrupted.
out_entry_stat->set_data_size(2, 0);
}
}
}
uint64_t sparse_data_size = 0u;
if (!OpenSparseFileIfExists(file_operations, &sparse_data_size)) {
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_SPARSE_OPEN_FAILED);
return net::ERR_FAILED;
}
out_entry_stat->set_sparse_data_size(sparse_data_size);
const int stream2_file_index = GetFileIndexFromStreamIndex(2);
DCHECK(CanOmitEmptyFile(stream2_file_index));
if (!empty_file_omitted_[stream2_file_index] &&
out_entry_stat->data_size(2) == 0) {
CloseFile(file_operations, stream2_file_index);
DeleteFileForEntryHash(path_, entry_file_key_.entry_hash,
stream2_file_index, file_operations);
empty_file_omitted_[stream2_file_index] = true;
}
RecordSyncOpenResult(cache_type_, OPEN_ENTRY_SUCCESS);
initialized_ = true;
return net::OK;
}
bool SimpleSynchronousEntry::InitializeCreatedFile(
BackendFileOperations* file_operations,
int file_index) {
SimpleFileTracker::FileHandle file = file_tracker_->Acquire(
file_operations, this, SubFileForFileIndex(file_index));
if (!file.IsOK())
return false;
const std::string& key = *key_;
SimpleFileHeader header;
header.initial_magic_number = kSimpleInitialMagicNumber;
header.version = kSimpleEntryVersionOnDisk;
header.key_length = key.size();
header.key_hash = base::PersistentHash(key);
if (!file->WriteAndCheck(0, base::byte_span_from_ref(header))) {
return false;
}
if (!file->WriteAndCheck(sizeof(header), base::as_byte_span(key))) {
return false;
}
return true;
}
int SimpleSynchronousEntry::InitializeForCreate(
BackendFileOperations* file_operations,
SimpleEntryStat* out_entry_stat) {
DCHECK(!initialized_);
if (!CreateFiles(file_operations, out_entry_stat)) {
DLOG(WARNING) << "Could not create platform files.";
return net::ERR_FILE_EXISTS;
}
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
if (empty_file_omitted_[i])
continue;
if (!InitializeCreatedFile(file_operations, i))
return net::ERR_FAILED;
}
initialized_ = true;
return net::OK;
}
int SimpleSynchronousEntry::ReadAndValidateStream0AndMaybe1(
BackendFileOperations* file_operations,
int file_size,
SimpleEntryStat* out_entry_stat,
std::array<SimpleStreamPrefetchData, 2>& stream_prefetch_data) {
SimpleFileTracker::FileHandle file =
file_tracker_->Acquire(file_operations, this, SubFileForFileIndex(0));
if (!file.IsOK())
return net::ERR_FAILED;
// We may prefetch data from file in a couple cases:
// 1) If the file is small enough we may prefetch it entirely.
// 2) We may also prefetch a block of trailer bytes from the end of
// the file.
// In these cases the PrefetchData object is used to store the
// bytes read from the file. The PrefetchData object also keeps track
// of what range within the file has been prefetched. It will only
// allow reads wholely within this range to be accessed via its
// ReadData() method.
PrefetchData prefetch_data(file_size);
// Determine a threshold for fully prefetching the entire entry file. If
// the entry file is less than or equal to this number of bytes it will
// be fully prefetched.
int full_prefetch_size = GetSimpleCacheFullPrefetchSize();
// Determine how much trailer data to prefetch. If the full file prefetch
// does not trigger then this is the number of bytes to read from the end
// of the file in a single file operation. Ideally the trailer prefetch
// will contain at least stream 0 and its EOF record.
int trailer_prefetch_size =
GetSimpleCacheTrailerPrefetchSize(trailer_prefetch_size_);
OpenPrefetchMode prefetch_mode = OPEN_PREFETCH_NONE;
if (file_size <= full_prefetch_size || file_size <= trailer_prefetch_size) {
// Prefetch the entire file.
prefetch_mode = OPEN_PREFETCH_FULL;
RecordOpenPrefetchMode(cache_type_, prefetch_mode);
if (!prefetch_data.PrefetchFromFile(&file, 0, file_size))
return net::ERR_FAILED;
} else if (trailer_prefetch_size > 0) {
// Prefetch trailer data from the end of the file.
prefetch_mode = OPEN_PREFETCH_TRAILER;
RecordOpenPrefetchMode(cache_type_, prefetch_mode);
size_t length = std::min(trailer_prefetch_size, file_size);
size_t offset = file_size - length;
if (!prefetch_data.PrefetchFromFile(&file, offset, length))
return net::ERR_FAILED;
} else {
// Do no prefetching.
RecordOpenPrefetchMode(cache_type_, prefetch_mode);
}
// Read stream 0 footer first --- it has size/feature info required to figure
// out file 0's layout.
SimpleFileEOF stream_0_eof;
int rv = GetEOFRecordData(
file.get(), &prefetch_data, /* file_index = */ 0,
/* file_offset = */ file_size - sizeof(SimpleFileEOF), &stream_0_eof);
if (rv != net::OK)
return rv;
int32_t stream_0_size = stream_0_eof.stream_size;
if (stream_0_size < 0 || stream_0_size > file_size)
return net::ERR_FAILED;
out_entry_stat->set_data_size(0, stream_0_size);
// Calculate size for stream 1, now we know stream 0's.
// See comments in simple_entry_format.h for background.
bool has_key_sha256 =
(stream_0_eof.flags & SimpleFileEOF::FLAG_HAS_KEY_SHA256) ==
SimpleFileEOF::FLAG_HAS_KEY_SHA256;
int extra_post_stream_0_read = 0;
if (has_key_sha256)
extra_post_stream_0_read += sizeof(net::SHA256HashValue);
const std::string& key = *key_;
int32_t stream1_size = file_size - 2 * sizeof(SimpleFileEOF) - stream_0_size -
sizeof(SimpleFileHeader) - key.size() -
extra_post_stream_0_read;
if (stream1_size < 0 || stream1_size > file_size)
return net::ERR_FAILED;
out_entry_stat->set_data_size(1, stream1_size);
// Put stream 0 data in memory --- plus maybe the sha256(key) footer.
rv = PreReadStreamPayload(file.get(), &prefetch_data, /* stream_index = */ 0,
extra_post_stream_0_read, *out_entry_stat,
stream_0_eof, &stream_prefetch_data[0]);
if (rv != net::OK)
return rv;
// Note the exact range needed in order to read the EOF record and stream 0.
// In APP_CACHE mode this will be stored directly in the index so we can
// know exactly how much to read next time.
computed_trailer_prefetch_size_ =
prefetch_data.GetDesiredTrailerPrefetchSize();
// If prefetch buffer is available, and we have sha256(key) (so we don't need
// to look at the header), extract out stream 1 info as well.
int stream_1_offset = out_entry_stat->GetOffsetInFile(
key.size(), /* offset= */ 0, /* stream_index = */ 1);
int stream_1_read_size =
sizeof(SimpleFileEOF) + out_entry_stat->data_size(/* stream_index = */ 1);
if (has_key_sha256 &&
prefetch_data.HasData(stream_1_offset, stream_1_read_size)) {
SimpleFileEOF stream_1_eof;
int stream_1_eof_offset =
out_entry_stat->GetEOFOffsetInFile(key.size(), /* stream_index = */ 1);
rv = GetEOFRecordData(file.get(), &prefetch_data, /* file_index = */ 0,
stream_1_eof_offset, &stream_1_eof);
if (rv != net::OK)
return rv;
rv = PreReadStreamPayload(file.get(), &prefetch_data,
/* stream_index = */ 1,
/* extra_size = */ 0, *out_entry_stat,
stream_1_eof, &stream_prefetch_data[1]);
if (rv != net::OK)
return rv;
}
// If present, check the key SHA256.
if (has_key_sha256) {
auto hash_value = crypto::hash::Sha256(key);
if (base::byte_span_from_ref(hash_value) !=
stream_prefetch_data[0].data->span().subspan(
static_cast<uint32_t>(stream_0_size), sizeof(hash_value))) {
return net::ERR_FAILED;
}
// Elide header check if we verified sha256(key) via footer.
header_and_key_check_needed_[0] = false;
}
// Ensure the key is validated before completion.
if (!has_key_sha256 && header_and_key_check_needed_[0] &&
!CheckHeaderAndKey(file.get(), 0)) {
return net::ERR_FAILED;
}
return net::OK;
}
bool SimpleSynchronousEntry::ReadFromFileOrPrefetched(
base::File* file,
PrefetchData* prefetch_data,
int file_index,
int offset,
int size,
base::span<uint8_t> dest) {
if (offset < 0 || size < 0)
return false;
if (size == 0)
return true;
base::CheckedNumeric<size_t> start(offset);
size_t start_numeric;
if (!start.AssignIfValid(&start_numeric))
return false;
base::CheckedNumeric<size_t> length(size);
size_t length_numeric;
if (!length.AssignIfValid(&length_numeric))
return false;
// First try to extract the desired range from the PrefetchData.
if (file_index == 0 && prefetch_data &&
prefetch_data->ReadData(start_numeric, length_numeric, dest)) {
return true;
}
// If we have not prefetched the range then we must read it from disk.
return file->ReadAndCheck(start_numeric, dest.first(length_numeric));
}
int SimpleSynchronousEntry::GetEOFRecordData(base::File* file,
PrefetchData* prefetch_data,
int file_index,
int file_offset,
SimpleFileEOF* eof_record) {
if (!ReadFromFileOrPrefetched(file, prefetch_data, file_index, file_offset,
sizeof(SimpleFileEOF),
base::byte_span_from_ref(*eof_record))) {
RecordCheckEOFResult(cache_type_, CHECK_EOF_RESULT_READ_FAILURE);
return net::ERR_CACHE_CHECKSUM_READ_FAILURE;
}
if (eof_record->final_magic_number != kSimpleFinalMagicNumber) {
RecordCheckEOFResult(cache_type_, CHECK_EOF_RESULT_MAGIC_NUMBER_MISMATCH);
DVLOG(1) << "EOF record had bad magic number.";
return net::ERR_CACHE_CHECKSUM_READ_FAILURE;
}
if (!base::IsValueInRangeForNumericType<int32_t>(eof_record->stream_size))
return net::ERR_FAILED;
return net::OK;
}
// static
bool SimpleSynchronousEntry::DeleteFileForEntryHash(
const FilePath& path,
const uint64_t entry_hash,
const int file_index,
BackendFileOperations* file_operations) {
FilePath to_delete = path.AppendASCII(GetFilenameFromEntryFileKeyAndFileIndex(
SimpleFileTracker::EntryFileKey(entry_hash), file_index));
return file_operations->DeleteFile(to_delete);
}
// static
bool SimpleSynchronousEntry::DeleteFilesForEntryHash(
const FilePath& path,
const uint64_t entry_hash,
BackendFileOperations* file_operations) {
bool result = true;
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
if (!DeleteFileForEntryHash(path, entry_hash, i, file_operations) &&
!CanOmitEmptyFile(i)) {
result = false;
}
}
FilePath to_delete = path.AppendASCII(GetSparseFilenameFromEntryFileKey(
SimpleFileTracker::EntryFileKey(entry_hash)));
file_operations->DeleteFile(
to_delete,
BackendFileOperations::DeleteFileMode::kEnsureImmediateAvailability);
return result;
}
// static
bool SimpleSynchronousEntry::TruncateFilesForEntryHash(
const FilePath& path,
const uint64_t entry_hash,
BackendFileOperations* file_operations) {
SimpleFileTracker::EntryFileKey file_key(entry_hash);
bool result = true;
for (int i = 0; i < kSimpleEntryNormalFileCount; ++i) {
FilePath filename_to_truncate =
path.AppendASCII(GetFilenameFromEntryFileKeyAndFileIndex(file_key, i));
if (!TruncatePath(filename_to_truncate, file_operations))
result = false;
}
FilePath to_delete =
path.AppendASCII(GetSparseFilenameFromEntryFileKey(file_key));
TruncatePath(to_delete, file_operations);
return result;
}
FilePath SimpleSynchronousEntry::GetFilenameFromFileIndex(
int file_index) const {
return path_.AppendASCII(
GetFilenameFromEntryFileKeyAndFileIndex(entry_file_key_, file_index));
}
base::FilePath SimpleSynchronousEntry::GetFilenameForSubfile(
SimpleFileTracker::SubFile sub_file) const {
if (sub_file == SimpleFileTracker::SubFile::FILE_SPARSE)
return path_.AppendASCII(
GetSparseFilenameFromEntryFileKey(entry_file_key_));
else
return GetFilenameFromFileIndex(FileIndexForSubFile(sub_file));
}
bool SimpleSynchronousEntry::OpenSparseFileIfExists(
BackendFileOperations* file_operations,
uint64_t* out_sparse_data_size) {
DCHECK(!sparse_file_open());
FilePath filename =
path_.AppendASCII(GetSparseFilenameFromEntryFileKey(entry_file_key_));
int flags = base::File::FLAG_OPEN | base::File::FLAG_READ |
base::File::FLAG_WRITE | base::File::FLAG_WIN_SHARE_DELETE;
auto sparse_file =
std::make_unique<base::File>(file_operations->OpenFile(filename, flags));
if (!sparse_file->IsValid()) {
// No file -> OK, file open error -> 'trouble.
return sparse_file->error_details() == base::File::FILE_ERROR_NOT_FOUND;
}
if (!ScanSparseFile(sparse_file.get(), out_sparse_data_size))
return false;
file_tracker_->Register(this, SimpleFileTracker::SubFile::FILE_SPARSE,
std::move(sparse_file));
sparse_file_open_ = true;
return true;
}
bool SimpleSynchronousEntry::CreateSparseFile(
BackendFileOperations* file_operations) {
DCHECK(!sparse_file_open());
FilePath filename =
path_.AppendASCII(GetSparseFilenameFromEntryFileKey(entry_file_key_));
int flags = base::File::FLAG_CREATE | base::File::FLAG_READ |
base::File::FLAG_WRITE | base::File::FLAG_WIN_SHARE_DELETE;
std::unique_ptr<base::File> sparse_file =
std::make_unique<base::File>(file_operations->OpenFile(filename, flags));
if (!sparse_file->IsValid())
return false;
if (!InitializeSparseFile(sparse_file.get()))
return false;
file_tracker_->Register(this, SimpleFileTracker::SubFile::FILE_SPARSE,
std::move(sparse_file));
sparse_file_open_ = true;
return true;
}
void SimpleSynchronousEntry::CloseSparseFile(
BackendFileOperations* file_operations) {
DCHECK(sparse_file_open());
if (entry_file_key_.doom_generation != 0u) {
file_operations->DeleteFile(
path_.AppendASCII(GetSparseFilenameFromEntryFileKey(entry_file_key_)));
}
file_tracker_->Close(this, SimpleFileTracker::SubFile::FILE_SPARSE);
sparse_file_open_ = false;
}
bool SimpleSynchronousEntry::TruncateSparseFile(base::File* sparse_file) {
DCHECK(sparse_file_open());
uint64_t header_and_key_length = sizeof(SimpleFileHeader) + key_->size();
if (!sparse_file->SetLength(header_and_key_length)) {
DLOG(WARNING) << "Could not truncate sparse file";
return false;
}
sparse_ranges_.clear();
sparse_tail_offset_ = header_and_key_length;
return true;
}
bool SimpleSynchronousEntry::InitializeSparseFile(base::File* sparse_file) {
SimpleFileHeader header;
header.initial_magic_number = kSimpleInitialMagicNumber;
header.version = kSimpleSparseEntryVersion;
const std::string& key = *key_;
header.key_length = key.size();
header.key_hash = base::PersistentHash(key);
if (!sparse_file->WriteAndCheck(0, base::byte_span_from_ref(header))) {
DLOG(WARNING) << "Could not write sparse file header";
return false;
}
if (!sparse_file->WriteAndCheck(sizeof(header), base::as_byte_span(key))) {
DLOG(WARNING) << "Could not write sparse file key";
return false;
}
sparse_ranges_.clear();
sparse_tail_offset_ = sizeof(header) + key.size();
return true;
}
bool SimpleSynchronousEntry::ScanSparseFile(base::File* sparse_file,
uint64_t* out_sparse_data_size) {
uint64_t sparse_data_size = 0;
SimpleFileHeader header;
if (!sparse_file->ReadAndCheck(0, base::byte_span_from_ref(header))) {
DLOG(WARNING) << "Could not read header from sparse file.";
return false;
}
if (header.initial_magic_number != kSimpleInitialMagicNumber) {
DLOG(WARNING) << "Sparse file magic number did not match.";
return false;
}
if (header.version != kSimpleSparseEntryVersion) {
DLOG(WARNING) << "Sparse file unreadable version.";
return false;
}
sparse_ranges_.clear();
uint64_t range_header_offset = sizeof(header) + key_->size();
while (true) {
SimpleFileSparseRangeHeader range_header;
std::optional<size_t> range_header_read_result = sparse_file->Read(
range_header_offset, base::byte_span_from_ref(range_header));
if (range_header_read_result.has_value() &&
*range_header_read_result == 0) {
break;
}
if (range_header_read_result.value_or(0) != sizeof(range_header)) {
DLOG(WARNING) << "Could not read sparse range header.";
return false;
}
if (range_header.sparse_range_magic_number !=
kSimpleSparseRangeMagicNumber) {
DLOG(WARNING) << "Invalid sparse range header magic number.";
return false;
}
if (range_header.length > std::numeric_limits<size_t>::max()) {
DLOG(WARNING) << "Too long sparse range length.";
return false;
}
if (!base::CheckAdd(range_header.offset, range_header.length).IsValid()) {
DLOG(WARNING) << "Too large sparse range tail.";
return false;
}
SparseRange range;
range.offset = range_header.offset;
range.length = static_cast<size_t>(range_header.length);
range.data_crc32 = range_header.data_crc32;
range.file_offset = range_header_offset + sizeof(range_header);
sparse_ranges_.emplace(range.offset, range);
range_header_offset += sizeof(range_header) + range.length;
sparse_data_size += range.length;
}
*out_sparse_data_size = sparse_data_size;
sparse_tail_offset_ = range_header_offset;
return true;
}
bool SimpleSynchronousEntry::ReadSparseRange(base::File* sparse_file,
const SparseRange* range,
size_t offset_in_range,
size_t len,
base::span<uint8_t> buf) {
CHECK(range);
CHECK_LE(offset_in_range, range->length);
CHECK_LE(offset_in_range + len, range->length);
bool bytes_read_ok =
sparse_file->ReadAndCheck(range->file_offset + offset_in_range,
buf.first(base::checked_cast<size_t>(len)));
if (!bytes_read_ok) {
DLOG(WARNING) << "Could not read sparse range.";
return false;
}
// If we read the whole range and we have a crc32, check it.
if (offset_in_range == 0 && len == range->length && range->data_crc32 != 0) {
if (simple_util::Crc32(buf.first(len)) != range->data_crc32) {
DLOG(WARNING) << "Sparse range crc32 mismatch.";
return false;
}
}
// TODO(morlovich): Incremental crc32 calculation?
return true;
}
bool SimpleSynchronousEntry::WriteSparseRange(base::File* sparse_file,
SparseRange* range,
size_t offset_in_range,
size_t len,
base::span<const uint8_t> buf) {
CHECK(range);
CHECK_LE(offset_in_range, range->length);
CHECK_LE(offset_in_range + len, range->length);
uint32_t new_crc32 = 0;
if (offset_in_range == 0 && len == range->length) {
new_crc32 = simple_util::Crc32(buf.first(len));
}
if (new_crc32 != range->data_crc32) {
range->data_crc32 = new_crc32;
SimpleFileSparseRangeHeader header;
header.sparse_range_magic_number = kSimpleSparseRangeMagicNumber;
header.offset = range->offset;
header.length = range->length;
header.data_crc32 = range->data_crc32;
bool bytes_written_ok = sparse_file->WriteAndCheck(
range->file_offset - sizeof(header), base::byte_span_from_ref(header));
if (!bytes_written_ok) {
DLOG(WARNING) << "Could not rewrite sparse range header.";
return false;
}
}
bool bytes_written_ok = sparse_file->WriteAndCheck(
range->file_offset + offset_in_range, buf.first(len));
if (!bytes_written_ok) {
DLOG(WARNING) << "Could not write sparse range.";
return false;
}
return true;
}
bool SimpleSynchronousEntry::AppendSparseRange(base::File* sparse_file,
uint64_t offset,
size_t len,
base::span<const uint8_t> buf) {
DCHECK_NE(len, 0u);
uint32_t data_crc32 = simple_util::Crc32(buf.first(len));
SimpleFileSparseRangeHeader header;
header.sparse_range_magic_number = kSimpleSparseRangeMagicNumber;
header.offset = offset;
header.length = len;
header.data_crc32 = data_crc32;
std::optional<size_t> bytes_written =
sparse_file->Write(sparse_tail_offset_, base::byte_span_from_ref(header));
if (!bytes_written.has_value()) {
DLOG(WARNING) << "Could not append sparse range header.";
return false;
}
sparse_tail_offset_ += *bytes_written;
bytes_written = sparse_file->Write(sparse_tail_offset_, buf.first(len));
if (!bytes_written.has_value()) {
DLOG(WARNING) << "Could not append sparse range data.";
return false;
}
uint64_t data_file_offset = sparse_tail_offset_;
sparse_tail_offset_ += *bytes_written;
SparseRange range;
range.offset = offset;
range.length = len;
range.data_crc32 = data_crc32;
range.file_offset = data_file_offset;
sparse_ranges_.emplace(offset, range);
return true;
}
} // namespace disk_cache
|