Export of internal Abseil changes
-- 2dd5008c7b4176859e320c7c337078adb173b662 by Tom Manshreck <shreck@google.com>: Internal change PiperOrigin-RevId: 304022549 -- 6442abd78697b03cfe698b0d0dac7f1eb4b5cb38 by Andy Getzendanner <durandal@google.com>: Internal change PiperOrigin-RevId: 303890410 -- eb8b37b468b0f23da09d3de714272928ef61f942 by Gennadiy Rozental <rogeeff@google.com>: Roll changes forward with ChunkIterator templatized. This should facilitate usage of "small" chunk iterator for a regular usage and proper "big" iterator internally in Cord implementation. This way Cord users are not exposed to stack size overhead if they have a lot of chunk iterators or recursive implementation which relies on chunk iterators. PiperOrigin-RevId: 303877118 -- 9623c569e7c55b45254e95f2d14c5badf9c901aa by Gennadiy Rozental <rogeeff@google.com>: Switch Flags implementation of fast type id to use absl/base/internal/fast_type_id.h PiperOrigin-RevId: 303861019 -- e2931e8d53c86d0816da6bbc8ba58cf5a3a443bb by Matthew Brown <matthewbr@google.com>: Internal Change PiperOrigin-RevId: 303832407 -- b549ed6e441e920b8ad6f02a80b9fd543820ef86 by Tom Manshreck <shreck@google.com>: Update Cord header file comments to Abseil standards PiperOrigin-RevId: 303823232 -- fc633d4f31a2d058f2b6a7029fc7c9820cd71c92 by Evan Brown <ezb@google.com>: Remove top-level const from K/V in map_slot_type::mutable_value and map_slot_type::key. This allows us to move between `map_slot_type::mutable_value`s internally even when the key_type and/or mapped_type specified by the user are const. PiperOrigin-RevId: 303811694 -- 909b3ce7cb3583ee9c374d36ff5f82bba02a1b64 by Derek Mauro <dmauro@google.com>: Add hardening assertions to the preconditions of absl::Cord PiperOrigin-RevId: 303419537 -- 9d32f79eabd54e6cb17bcc28b53e9bcfeb3cf6f4 by Greg Falcon <gfalcon@google.com>: Don't use MSVC-specific bit manipulations when using Clang on Windows. This fixes a compiler warning. Note that we do not have continuous testing for this configuration; this CL is best-effort support. PiperOrigin-RevId: 303322582 -- f6e0a35a2b9081d2a9eef73789b7bc1b5e46e5ad by Gennadiy Rozental <rogeeff@google.com>: Introduce standlone FastTypeId utility to represent compile time unique type id. PiperOrigin-RevId: 303180545 -- 99120e9fbdb5b2d327139ab8f617533d7bc3345b by Abseil Team <absl-team@google.com>: Changed absl's import of std::string_view to using string_view = std::string_view. This should help tools (e.g. include-what-you-use) discover where absl::string_view is defined. PiperOrigin-RevId: 303169095 GitOrigin-RevId: 2dd5008c7b4176859e320c7c337078adb173b662 Change-Id: I1e18ae08e23686ac963e7ea5e5bd499e18d51048
This commit is contained in:
parent
79e0dc1151
commit
fba8a316c3
24 changed files with 1068 additions and 486 deletions
|
|
@ -18,6 +18,7 @@
|
|||
#include "absl/base/config.h"
|
||||
#include "absl/base/internal/endian.h"
|
||||
#include "absl/base/internal/raw_logging.h"
|
||||
#include "absl/base/macros.h"
|
||||
#include "absl/container/fixed_array.h"
|
||||
#include "absl/strings/cord_test_helpers.h"
|
||||
#include "absl/strings/str_cat.h"
|
||||
|
|
@ -1402,6 +1403,53 @@ TEST(CordChunkIterator, Operations) {
|
|||
VerifyChunkIterator(subcords, 128);
|
||||
}
|
||||
|
||||
TEST(CordChunkIterator, MaxLengthFullTree) {
|
||||
// Start with a 1-byte cord, and then double its length in a loop. We should
|
||||
// be able to do this until the point where we would overflow size_t.
|
||||
|
||||
absl::Cord cord;
|
||||
size_t size = 1;
|
||||
AddExternalMemory("x", &cord);
|
||||
EXPECT_EQ(cord.size(), size);
|
||||
|
||||
const int kCordLengthDoublingLimit = std::numeric_limits<size_t>::digits - 1;
|
||||
for (int i = 0; i < kCordLengthDoublingLimit; ++i) {
|
||||
cord.Prepend(absl::Cord(cord));
|
||||
size <<= 1;
|
||||
|
||||
EXPECT_EQ(cord.size(), size);
|
||||
|
||||
auto chunk_it = cord.chunk_begin();
|
||||
EXPECT_EQ(*chunk_it, "x");
|
||||
}
|
||||
|
||||
EXPECT_DEATH_IF_SUPPORTED(
|
||||
(cord.Prepend(absl::Cord(cord)), *cord.chunk_begin()),
|
||||
"Cord is too long");
|
||||
}
|
||||
|
||||
TEST(CordChunkIterator, MaxDepth) {
|
||||
// By reusing nodes, it's possible in pathological cases to build a Cord that
|
||||
// exceeds both the maximum permissible length and depth. In this case, the
|
||||
// violation of the maximum depth is reported.
|
||||
absl::Cord left_child;
|
||||
AddExternalMemory("x", &left_child);
|
||||
absl::Cord root = left_child;
|
||||
|
||||
for (int i = 0; i < absl::cord_internal::MaxCordDepth() - 2; ++i) {
|
||||
size_t new_size = left_child.size() + root.size();
|
||||
root.Prepend(left_child);
|
||||
EXPECT_EQ(root.size(), new_size);
|
||||
|
||||
auto chunk_it = root.chunk_begin();
|
||||
EXPECT_EQ(*chunk_it, "x");
|
||||
|
||||
std::swap(left_child, root);
|
||||
}
|
||||
|
||||
EXPECT_DEATH_IF_SUPPORTED(root.Prepend(left_child), "Cord is too long");
|
||||
}
|
||||
|
||||
TEST(CordCharIterator, Traits) {
|
||||
static_assert(std::is_copy_constructible<absl::Cord::CharIterator>::value,
|
||||
"");
|
||||
|
|
@ -1580,3 +1628,23 @@ TEST(Cord, SmallBufferAssignFromOwnData) {
|
|||
}
|
||||
}
|
||||
}
|
||||
|
||||
TEST(CordDeathTest, Hardening) {
|
||||
absl::Cord cord("hello");
|
||||
// These statement should abort the program in all builds modes.
|
||||
EXPECT_DEATH_IF_SUPPORTED(cord.RemovePrefix(6), "");
|
||||
EXPECT_DEATH_IF_SUPPORTED(cord.RemoveSuffix(6), "");
|
||||
|
||||
bool test_hardening = false;
|
||||
ABSL_HARDENING_ASSERT([&]() {
|
||||
// This only runs when ABSL_HARDENING_ASSERT is active.
|
||||
test_hardening = true;
|
||||
return true;
|
||||
}());
|
||||
if (!test_hardening) return;
|
||||
|
||||
EXPECT_DEATH_IF_SUPPORTED(cord[5], "");
|
||||
EXPECT_DEATH_IF_SUPPORTED(*cord.chunk_end(), "");
|
||||
EXPECT_DEATH_IF_SUPPORTED(static_cast<void>(cord.chunk_end()->empty()), "");
|
||||
EXPECT_DEATH_IF_SUPPORTED(++cord.chunk_end(), "");
|
||||
}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue