|
34 | 34 | #include "absl/random/random.h" |
35 | 35 | #include "./fuzztest/domain_core.h" |
36 | 36 | #include "./domain_tests/domain_testing.h" |
| 37 | +#include "./fuzztest/internal/domains/traversal_context.h" |
37 | 38 | #include "./fuzztest/internal/table_of_recent_compares.h" |
38 | 39 |
|
39 | 40 | namespace fuzztest { |
@@ -369,5 +370,94 @@ TEST(Container, ValidatesMemoryDictionaryMutationForInnerDomain) { |
369 | 370 | EXPECT_THAT(mutants, Not(Contains(std::vector<uint8_t>{129, 129, 129, 129}))); |
370 | 371 | } |
371 | 372 |
|
| 373 | +TEST(ContainerTest, |
| 374 | + SequenceInitWithTrackerDepthExhaustedWithMinSizeReturnsEmptyAndFails) { |
| 375 | + auto domain = VectorOf(Arbitrary<int>()).WithMinSize(3); |
| 376 | + |
| 377 | + absl::BitGen prng; |
| 378 | + internal::TraversalState state; |
| 379 | + state.depth = 0; |
| 380 | + |
| 381 | + Value val(domain, prng, state); |
| 382 | + |
| 383 | + EXPECT_TRUE(val.user_value.empty()); |
| 384 | + EXPECT_FALSE(state.status.ok()); |
| 385 | + EXPECT_THAT(state.status.ToString(), |
| 386 | + testing::HasSubstr("Traversal budget exceeded")); |
| 387 | +} |
| 388 | + |
| 389 | +TEST(ContainerTest, |
| 390 | + SequenceInitWithTrackerDepthExhaustedNoMinSizeReturnsEmptyAndSucceeds) { |
| 391 | + auto domain = VectorOf(Arbitrary<int>()); |
| 392 | + |
| 393 | + absl::BitGen prng; |
| 394 | + internal::TraversalState state; |
| 395 | + state.depth = 0; |
| 396 | + |
| 397 | + Value val(domain, prng, state); |
| 398 | + |
| 399 | + EXPECT_TRUE(val.user_value.empty()); |
| 400 | + EXPECT_TRUE(state.status.ok()); |
| 401 | +} |
| 402 | + |
| 403 | +TEST(ContainerTest, SequenceInitWithTrackerUpdatesCount) { |
| 404 | + auto domain = VectorOf(Arbitrary<int>()).WithSize(3); |
| 405 | + |
| 406 | + absl::BitGen prng; |
| 407 | + internal::TraversalState state; |
| 408 | + state.count = 10; |
| 409 | + |
| 410 | + Value val(domain, prng, state); |
| 411 | + |
| 412 | + EXPECT_EQ(val.user_value.size(), 3); |
| 413 | + // 1 (root) + 3 (elements) = 4 decrements |
| 414 | + EXPECT_EQ(*state.count, 6); |
| 415 | +} |
| 416 | + |
| 417 | +TEST(ContainerTest, SequenceInitWithTrackerCountExhaustedWithMinSizeFails) { |
| 418 | + auto domain = VectorOf(Arbitrary<int>()).WithMinSize(3); |
| 419 | + |
| 420 | + absl::BitGen prng; |
| 421 | + internal::TraversalState state; |
| 422 | + state.count = 0; // Enter() will decrement to -1 |
| 423 | + |
| 424 | + Value val(domain, prng, state); |
| 425 | + |
| 426 | + EXPECT_TRUE(val.user_value.empty()); |
| 427 | + EXPECT_FALSE(state.status.ok()); |
| 428 | +} |
| 429 | + |
| 430 | +TEST(ContainerTest, |
| 431 | + SequenceInitWithTrackerCountExhaustedNoMinSizeReturnsEmptyAndSucceeds) { |
| 432 | + auto domain = VectorOf(Arbitrary<int>()); |
| 433 | + |
| 434 | + absl::BitGen prng; |
| 435 | + internal::TraversalState state; |
| 436 | + state.count = 0; |
| 437 | + |
| 438 | + Value val(domain, prng, state); |
| 439 | + |
| 440 | + EXPECT_TRUE(val.user_value.empty()); |
| 441 | + EXPECT_TRUE(state.status.ok()); |
| 442 | +} |
| 443 | + |
| 444 | +TEST(ContainerTest, |
| 445 | + SequenceInitWithTrackerPropagatesFailureFromInnerExhaustion) { |
| 446 | + // Inner vector must have size >= 1. |
| 447 | + auto domain = |
| 448 | + VectorOf(VectorOf(Arbitrary<int>()).WithMinSize(1)).WithMinSize(2); |
| 449 | + |
| 450 | + absl::BitGen prng; |
| 451 | + internal::TraversalState state; |
| 452 | + // Exhausts during 2nd inner vector init, failing due to its min_size = 1. |
| 453 | + state.count = 3; |
| 454 | + |
| 455 | + Value val(domain, prng, state); |
| 456 | + |
| 457 | + EXPECT_FALSE(state.status.ok()); |
| 458 | + EXPECT_THAT(state.status.ToString(), |
| 459 | + testing::HasSubstr("Traversal budget exceeded")); |
| 460 | +} |
| 461 | + |
372 | 462 | } // namespace |
373 | 463 | } // namespace fuzztest |
0 commit comments