objects.cc 29 KB
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
#include <qpdf/assert_test.h>

// This program tests miscellaneous object handle functionality

#include <qpdf/QPDF.hh>

#include <qpdf/Pl_Discard.hh>
#include <qpdf/QIntC.hh>
#include <qpdf/QPDFJob.hh>
#include <qpdf/QPDFObjectHandle_private.hh>
#include <qpdf/QUtil.hh>
#include <qpdf/global.hh>

#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>

static char const* whoami = nullptr;

void
usage()
{
    std::cerr << "Usage: " << whoami << " n filename1 [arg2]" << '\n';
    exit(2);
}

#define assert_compare_numbers(expected, expr) compare_numbers(#expr, expected, expr)

template <typename T1, typename T2>
static void
compare_numbers(char const* description, T1 const& expected, T2 const& actual)
{
    if (expected != actual) {
        std::cerr << description << ": expected = " << expected << "; actual = " << actual << '\n';
    }
}

static void
test_0(QPDF& pdf, char const* arg2)
{
    // Test int size checks. This test will fail if int and long long are the same size.
    QPDFObjectHandle t = pdf.getTrailer();
    unsigned long long q1_l = 3ULL * QIntC::to_ulonglong(INT_MAX);
    long long q1 = QIntC::to_longlong(q1_l);
    long long q2_l = 3LL * QIntC::to_longlong(INT_MIN);
    long long q2 = QIntC::to_longlong(q2_l);
    unsigned int q3_i = UINT_MAX;
    long long q3 = QIntC::to_longlong(q3_i);
    t.replaceKey("/Q1", QPDFObjectHandle::newInteger(q1));
    t.replaceKey("/Q2", QPDFObjectHandle::newInteger(q2));
    t.replaceKey("/Q3", QPDFObjectHandle::newInteger(q3));
    assert_compare_numbers(q1, t.getKey("/Q1").getIntValue());
    assert_compare_numbers(q1_l, t.getKey("/Q1").getUIntValue());
    assert_compare_numbers(INT_MAX, t.getKey("/Q1").getIntValueAsInt());
    try {
        assert_compare_numbers(0u, QPDFObjectHandle::newNull().getUIntValueAsUInt());
    } catch (QPDFExc const&) {
        std::cerr << "caught expected type error\n";
    }
    assert_compare_numbers(std::numeric_limits<int8_t>::max(), Integer(q1).value<int8_t>());
    assert_compare_numbers(std::numeric_limits<int8_t>::min(), Integer(-q1).value<int8_t>());
    try {
        [[maybe_unused]] int8_t q1_8 = Integer(q1);
    } catch (std::overflow_error const&) {
        std::cerr << "caught expected int8_t overflow error\n";
    }
    try {
        [[maybe_unused]] int8_t q1_8 = Integer(-q1);
    } catch (std::underflow_error const&) {
        std::cerr << "caught expected int8_t underflow error\n";
    }
    assert_compare_numbers(std::numeric_limits<uint8_t>::max(), Integer(q1).value<uint8_t>());
    assert_compare_numbers(0, Integer(-q1).value<uint8_t>());
    try {
        [[maybe_unused]] uint8_t q1_u8 = Integer(q1);
    } catch (std::overflow_error const&) {
        std::cerr << "caught expected uint8_t overflow error\n";
    }
    try {
        [[maybe_unused]] uint8_t q1_u8 = Integer(-q1);
    } catch (std::underflow_error const&) {
        std::cerr << "caught expected uint8_t underflow error\n";
    }
    assert_compare_numbers(UINT_MAX, t.getKey("/Q1").getUIntValueAsUInt());
    assert_compare_numbers(q2_l, t.getKey("/Q2").getIntValue());
    assert_compare_numbers(0U, t.getKey("/Q2").getUIntValue());
    assert_compare_numbers(INT_MIN, t.getKey("/Q2").getIntValueAsInt());
    assert_compare_numbers(0U, t.getKey("/Q2").getUIntValueAsUInt());
    assert_compare_numbers(INT_MAX, t.getKey("/Q3").getIntValueAsInt());
    assert_compare_numbers(UINT_MAX, t.getKey("/Q3").getUIntValueAsUInt());
}

static void
test_1(QPDF& pdf, char const* arg2)
{
    // Test new dictionary methods.
    using namespace qpdf;
    auto d = Dictionary({{"/A", {}}, {"/B", Null()}, {"/C", Dictionary::empty()}});

    // contains
    assert(!d.contains("/A"));
    assert(!d.contains("/B"));
    assert(d.contains("/C"));

    auto i = Integer(42);
    assert(!i.contains("/A"));

    // at
    assert(!d.at("/A"));
    assert(d.at("/B"));
    assert(d.at("/B").null());
    assert(d.at("/C"));
    assert(!d.at("/C").null());
    d.at("/C") = Integer(42);
    assert(d.at("/C") == 42);
    assert(!d.at("/D"));
    assert(d.at("/D").null());
    assert(QPDFObjectHandle(d).getDictAsMap().contains("/D"));
    assert(QPDFObjectHandle(d).getDictAsMap().size() == 4);

    bool thrown = false;
    try {
        i.at("/A");
    } catch (std::runtime_error const&) {
        thrown = true;
    }
    assert(thrown);

    // find
    assert(!d.find("/A"));
    assert(d.find("/B"));
    assert(d.find("/B").null());
    assert(d.find("/C"));
    assert(Integer(d.find("/C")) == 42);
    d.find("/C") = Name("/DontPanic");
    assert(Name(d.find("/C")) == "/DontPanic");
    assert(!d.find("/E"));
    assert(!QPDFObjectHandle(d).getDictAsMap().contains("/E"));
    assert(QPDFObjectHandle(d).getDictAsMap().size() == 4);

    // replace
    assert(!i.replace("/A", Name("/DontPanic")));
    Dictionary di = i.oh();
    thrown = false;
    try {
        di.replace("/A", Name("/DontPanic"));
    } catch (std::runtime_error const&) {
        thrown = true;
    }
    assert(thrown);
    d.replace("/C", Integer(42));
    assert(Integer(d["/C"]) == 42);
    assert(QPDFObjectHandle(d).getDictAsMap().size() == 4);
}

static void
test_2(QPDF& pdf, char const* arg2)
{
    // Test global limits.
    using namespace qpdf::global::options;
    using namespace qpdf::global::limits;

    // Check default values
    assert(parser_max_nesting() == 499);
    assert(parser_max_errors() == 15);
    assert(parser_max_container_size() == std::numeric_limits<uint32_t>::max());
    assert(parser_max_container_size_damaged() == 5'000);
    assert(max_stream_filters() == 25);
    assert(default_limits());

    // Test disabling optional default limits
    default_limits(false);
    assert(parser_max_nesting() == 499);
    assert(parser_max_errors() == 0);
    assert(parser_max_container_size() == std::numeric_limits<uint32_t>::max());
    assert(parser_max_container_size_damaged() == std::numeric_limits<uint32_t>::max());
    assert(max_stream_filters() == std::numeric_limits<uint32_t>::max());
    assert(!default_limits());

    // Check disabling default limits is irreversible
    default_limits(true);
    assert(!default_limits());

    // Test setting limits
    parser_max_nesting(11);
    parser_max_errors(12);
    parser_max_container_size(13);
    parser_max_container_size_damaged(14);
    max_stream_filters(15);

    assert(parser_max_nesting() == 11);
    assert(parser_max_errors() == 12);
    assert(parser_max_container_size() == 13);
    assert(parser_max_container_size_damaged() == 14);
    assert(max_stream_filters() == 15);

    // Check disabling default limits does not override explicit limits
    default_limits(false);
    assert(parser_max_nesting() == 11);
    assert(parser_max_errors() == 12);
    assert(parser_max_container_size() == 13);
    assert(parser_max_container_size_damaged() == 14);
    assert(max_stream_filters() == 15);

    // Test parameter checking
    QUtil::handle_result_code(qpdf_r_ok, "");
    bool thrown = false;
    try {
        qpdf::global::handle_result(qpdf_r_success_mask);
    } catch (std::logic_error const&) {
        thrown = true;
    }
    assert(thrown);
    thrown = false;
    try {
        qpdf::global::get_uint32(qpdf_param_e(42));
    } catch (std::logic_error const&) {
        thrown = true;
    }
    assert(thrown);
    thrown = false;
    try {
        qpdf::global::set_uint32(qpdf_param_e(42), 42);
    } catch (std::logic_error const&) {
        thrown = true;
    }
    assert(thrown);

    /* Test limit errors */
    assert(qpdf::global::limit_errors() == 0);
    QPDFObjectHandle::parse("[[[[]]]]");
    assert(qpdf::global::limit_errors() == 0);
    parser_max_nesting(3);
    try {
        QPDFObjectHandle::parse("[[[[[]]]]]");
    } catch (std::exception&) {
    }
    assert(qpdf::global::limit_errors() == 1);
    try {
        QPDFObjectHandle::parse("[[[[[]]]]]");
    } catch (std::exception&) {
    }
    assert(qpdf::global::limit_errors() == 2);

    // Test max_stream_filters
    QPDF qpdf;
    qpdf.emptyPDF();
    auto s = qpdf.newStream("\x01\x01\x01A");
    s.getDict().replace("/Filter", Array({Name("/RL"), Name("/RL"), Name("/RL")}));
    Pl_Discard p;
    auto x = s.pipeStreamData(&p, 0, qpdf_dl_all, true);
    assert(x);
    max_stream_filters(2);
    assert(!s.pipeStreamData(&p, 0, qpdf_dl_all, true));
    max_stream_filters(3);
    assert(s.pipeStreamData(&p, 0, qpdf_dl_all, true));

    // Test global settings using the QPDFJob interface
    QPDFJob j;
    j.config()
        ->inputFile("minimal.pdf")
        ->global()
        ->parserMaxNesting("111")
        ->parserMaxErrors("112")
        ->parserMaxContainerSize("113")
        ->parserMaxContainerSizeDamaged("114")
        ->maxStreamFilters("115")
        ->noDefaultLimits()
        ->endGlobal()
        ->outputFile("a.pdf");
    auto qpdf_uptr = j.createQPDF();
    assert(parser_max_nesting() == 111);
    assert(parser_max_errors() == 112);
    assert(parser_max_container_size() == 113);
    assert(parser_max_container_size_damaged() == 114);
    assert(max_stream_filters() == 115);
    assert(!default_limits());

    // Test global settings using the JobJSON
    QPDFJob jj;
    jj.initializeFromJson(R"(
        {
            "inputFile": "minimal.pdf",
            "global": {
                "parserMaxNesting": "211",
                "parserMaxErrors": "212",
                "parserMaxContainerSize": "213",
                "parserMaxContainerSizeDamaged": "214",
                "maxStreamFilters": "215",
                "noDefaultLimits": ""
            },
            "outputFile": "a.pdf"
        }
    )");
    qpdf_uptr = jj.createQPDF();
    assert(parser_max_nesting() == 211);
    assert(parser_max_errors() == 212);
    assert(parser_max_container_size() == 213);
    assert(parser_max_container_size_damaged() == 214);
    assert(max_stream_filters() == 215);
    assert(!default_limits());
}

// test equivalent_to
static void
test_3(QPDF& pdf, char const* arg2)
{
    // Scenario 1: Basic Equality: Name, Scalars
    {
        auto name = "/Test"_qpdf;
        auto integer = Integer(42);
        assert(name.equivalent_to("/Test"_qpdf));
        assert(!name.equivalent_to(integer));
    }
    // Scenario 2: Numeric Types (Int vs Real)
    {
        auto integer = Integer(1);
        auto real = QPDFObjectHandle::newReal("1.0");
        assert(real.equivalent_to(integer));
        assert(integer.equivalent_to(real));
    }
    // Scenario 3: Array Order Sensitivity
    {
        auto a1 = "[1 2]"_qpdf;
        auto a2 = "[2 1]"_qpdf;
        assert(!a1.equivalent_to(a2));
        assert(!a2.equivalent_to(a1));
    }
    // Scenario 4: Dictionary Key Order Insensitivity
    {
        auto d1 = "<< /A 1 >>"_qpdf;
        d1.replaceKey("/B", Integer(2));
        auto d2 = "<< /B 2 >>"_qpdf;
        d2.replaceKey("/A", Integer(1));
        assert(d1.equivalent_to(d2));
        assert(d2.equivalent_to(d1));
    }
    // Scenario 5: Direct vs Indirect Equality
    {
        auto obj = Integer(100);
        auto indirect = pdf.makeIndirectObject(Integer(100));
        assert(obj.equivalent_to(indirect));
        assert(indirect.equivalent_to(obj));
    }
    // Scenario 6: Diamond Graph Isomorphism
    {
        auto d = pdf.makeIndirectObject(Integer(99));
        auto b = pdf.makeIndirectObject(QPDFObjectHandle::newArray({d}));
        auto c = pdf.makeIndirectObject(QPDFObjectHandle::newArray({d}));
        assert(Array({b, c}).equivalent_to(Array({b, c})));
    }
    // Scenario 7: Circular References (Self-Loop): Compares as False
    {
        auto a1 = pdf.makeIndirectObject("[]"_qpdf);
        a1.appendItem(a1);
        auto a2 = pdf.makeIndirectObject("[]"_qpdf);
        a2.appendItem(a2);
        // The implementation rejects if there is any cycle, for performance reasons
        assert(!a1.equivalent_to(a2));
    }
    // Scenario 8: Cross-Document Comparison (Objects from Different QPDF Instances)
    {
        QPDF pdf2;
        pdf2.emptyPDF();
        auto a1 = pdf.makeIndirectObject("[1]"_qpdf);
        auto a2 = pdf2.makeIndirectObject("[1]"_qpdf);
        auto a3 = pdf2.makeIndirectObject("[2]"_qpdf);
        assert(a1.equivalent_to(a2));  // Same content, different documents
        assert(a2.equivalent_to(a1));  // Same content, different documents
        assert(!a1.equivalent_to(a3)); // Different content, different documents
        assert(!a3.equivalent_to(a1)); // Different content, different documents
    }
    // Scenario 9: Stream Content: Match
    {
        assert(pdf.newStream("Stream data").equivalent_to(pdf.newStream("Stream data")));
    }
    // Scenario 10: Stream Content: Mismatch
    {
        auto s1 = pdf.newStream("Data A");
        auto s2 = pdf.newStream("Data B");
        assert(!s1.equivalent_to(s2));
        assert(!s2.equivalent_to(s1));
    }
    // Scenario 11: Stream Dictionary Differences
    {
        auto s1 = pdf.newStream("same");
        auto s2 = pdf.newStream("same");
        s2.getDict().replaceKey("/Extra", QPDFObjectHandle::newName("/Value"));
        assert(!s1.equivalent_to(s2));
        assert(!s2.equivalent_to(s1));
    }
    // Scenario 12: J.3.6: Absent Keys vs Null
    {
        auto d0 = Dictionary::empty();
        auto d1 = "<</Present null>>"_qpdf;
        auto d2 = "<</Present << >> >>"_qpdf;
        auto d3 = "<</Present [] >>"_qpdf;
        assert(d0.equivalent_to(d1));
        assert(d1.equivalent_to(d0));
        assert(!d0.equivalent_to(d2));
        assert(!d2.equivalent_to(d0));
        assert(!d0.equivalent_to(d3));
        assert(!d3.equivalent_to(d0));
        assert(!d1.equivalent_to(d2));
        assert(!d2.equivalent_to(d1));
        assert(!d1.equivalent_to(d3));
        assert(!d3.equivalent_to(d1));
    }
    // Scenario 13: String Syntax: Hex vs Literal (Annex J)
    {
        auto literal = "(A)"_qpdf;
        auto hex = "<41>"_qpdf;
        assert(literal.equivalent_to(hex));
        assert(hex.equivalent_to(literal));
    }
    // Scenario 14: Name Syntax (Parser) vs Distinct Names (Model)
    {
        auto name1 = "/Name"_qpdf;
        auto name2 = "/Na#6d#65"_qpdf;
        assert(name1.equivalent_to(name2));
        assert(name2.equivalent_to(name1));
    }
    // Scenario 15: Annex J Oddities: Keys, Octals, and Zeros
    {
        auto key1 = "<< /Key 1 >>"_qpdf;
        auto key2 = "<< /K#65#79 1 >>"_qpdf;
        auto lit_A = "(A)"_qpdf;
        auto oct_A = "(\\101)"_qpdf;
        auto zero_i = Integer(0);
        auto zero_r = QPDFObjectHandle::newReal("-0.0");
        auto r1 = QPDFObjectHandle::newReal("12.345");
        auto r2 = QPDFObjectHandle::newReal("12.345000000000000");
        auto i12 = Integer(12);
        // note: we rely on double rounding here
        auto r_lo = QPDFObjectHandle::newReal("11.99999999999999999999999999999999");
        auto i12b = Integer(12);
        auto r_hi = QPDFObjectHandle::newReal("12.00000000000000000000000000000000");
        auto i1 = Integer(1);
        auto r_1 = QPDFObjectHandle::newReal("1.");
        assert(key1.equivalent_to(key2));
        assert(key2.equivalent_to(key1));
        assert(lit_A.equivalent_to(oct_A));
        assert(oct_A.equivalent_to(lit_A));
        assert(zero_i.equivalent_to(zero_r));
        assert(zero_r.equivalent_to(zero_i));
        assert(r1.equivalent_to(r2));
        assert(r2.equivalent_to(r1));
        assert(i12.equivalent_to(r_lo));
        assert(r_lo.equivalent_to(i12));
        assert(i12b.equivalent_to(r_hi));
        assert(r_hi.equivalent_to(i12b));
        assert(i1.equivalent_to(r_1));
        assert(r_1.equivalent_to(i1));
    }
    // Scenario 16: Nested Containers
    {
        assert(Dictionary({{"/K", "[5]"_qpdf}}).equivalent_to(Dictionary({{"/K", "[5]"_qpdf}})));
    }
    // Scenario 17: Boolean and Null mismatch
    {
        auto b_true = QPDFObjectHandle::newBool(true);
        auto b_false = QPDFObjectHandle::newBool(false);
        auto null = QPDFObjectHandle::newNull();
        auto null2 = QPDFObjectHandle::newNull();
        auto one = Integer(1);
        auto zero = Integer(0);
        assert(null.equivalent_to(null));
        assert(null.equivalent_to(null2));
        assert(!b_true.equivalent_to(b_false));
        assert(!b_true.equivalent_to(null));
        assert(!b_true.equivalent_to(one));
        assert(!b_true.equivalent_to(zero));
        assert(!b_false.equivalent_to(null));
        assert(!b_false.equivalent_to(one));
        assert(!b_false.equivalent_to(zero));
        assert(!null.equivalent_to(one));
        assert(!null.equivalent_to(zero));
        assert(!one.equivalent_to(zero));
    }
    // Scenario 18: Stream Semantics (J.3.7) - Strictness Check
    {
        auto s1 = pdf.newStream("test stream");
        auto s2 = pdf.newStream("DIFFERENT_RAW_BYTES");
        auto s3 = pdf.newStream("test stream");
        s2.getDict().replaceKey("/Filter", QPDFObjectHandle::newName("/FlateDecode"));
        s3.getDict().replaceKey("/Filter", QPDFObjectHandle::newName("/FlateDecode"));
        assert(!s1.equivalent_to(s2));
        assert(!s2.equivalent_to(s1));
        assert(!s1.equivalent_to(s3));
        assert(!s3.equivalent_to(s1));
        assert(!s2.equivalent_to(s3));
        assert(!s3.equivalent_to(s2));
    }
    // Scenario 19: Dictionary Value Type Mismatch
    {
        auto d1 = "<< /Key 1 >>"_qpdf;
        auto d2 = "<< /Key (1) >>"_qpdf;
        assert(!d1.equivalent_to(d2));
        assert(!d2.equivalent_to(d1));
    }
    // Scenario 20: Mixed Direct vs Indirect Nesting
    {
        assert(
            QPDFObjectHandle::newArray({Integer(7)})
                .equivalent_to(QPDFObjectHandle::newArray({pdf.makeIndirectObject(Integer(7))})));
    }
    // Scenario 21: Dictionary Subset vs Superset
    {
        auto d1 = "<< /A 1 /B 2 >>"_qpdf;
        auto d2 = "<< /A 1 >>"_qpdf;
        assert(!d1.equivalent_to(d2));
        assert(!d2.equivalent_to(d1));
    }
    // Scenario 22: Stream Semantic Decode Equivalence
    {
        auto s1 = pdf.newStream("Hello World");
        auto s2 = pdf.newStream("HELLO WORLD RAW");
        s2.getDict().replaceKey("/Filter", "/FlateDecode"_qpdf);
        s2.getDict().replaceKey("/DecodeParms", Dictionary::empty());
        assert(!s1.equivalent_to(s2));
        assert(!s2.equivalent_to(s1));
    }
    // Scenario 23: Indirect Object Identity Independence
    {
        auto i1 = pdf.makeIndirectObject(Integer(123));
        auto i2 = Integer(123);
        assert(i1.equivalent_to(pdf.makeIndirectObject(Integer(123))));
        assert(i1.equivalent_to(i2));
        assert(i2.equivalent_to(i1));
    }
    // Scenario 24: Deep Recursive Structure (Stack Safety)
    {
        QPDFObjectHandle a1 = "[]"_qpdf;
        QPDFObjectHandle a2 = "[]"_qpdf;
        QPDFObjectHandle cur1 = a1;
        QPDFObjectHandle cur2 = a2;
        for (int i = 0; i < 200; ++i) {
            auto n1 = "[]"_qpdf;
            auto n2 = "[]"_qpdf;
            cur1.appendItem(n1);
            cur2.appendItem(n2);
            cur1 = n1;
            cur2 = n2;
        }
        assert(!a1.equivalent_to(a2));     // Default depth = 10 -> fails
        assert(a1.equivalent_to(a2, 500)); // Explicit depth -> passes
    }
    // Scenario 25: Wide Graph Fan-out
    {
        auto a1 = "[]"_qpdf;
        auto a2 = "[]"_qpdf;
        auto a3 = "[]"_qpdf;
        for (int i = 0; i < 200; ++i) {
            a1.appendItem(Integer(i));
            a2.appendItem(Integer(i));
            a3.appendItem(Integer(i));
        }
        a3.appendItem(Integer(200));
        assert(a1.equivalent_to(a2));
        assert(!a1.equivalent_to(a3));
        assert(!a3.equivalent_to(a1));
    }
    // Scenario 26: Two Self-Referential Arrays
    {
        auto a1 = pdf.makeIndirectObject("[]"_qpdf);
        auto a2 = pdf.makeIndirectObject("[]"_qpdf);
        a1.appendItem(a1);
        a2.appendItem(a2);
        assert(!a1.equivalent_to(a2));
        assert(!a1.equivalent_to(a2)); // Check idempotency
    }
    // Scenario 27: Nested Dictionary Reuse / Shared Indirect Objects
    {
        auto shared_array = pdf.makeIndirectObject("[42 99]"_qpdf);
        auto dict1 = "<< /Unique1 /A >>"_qpdf;
        dict1.replaceKey("/Shared", shared_array);
        auto dict2 = "<< /Unique1 /A >>"_qpdf;
        dict2.replaceKey("/Shared", shared_array);
        auto dict3 = "<< /Unique1 /B >>"_qpdf;
        dict3.replaceKey("/Shared", shared_array);
        assert(dict1.equivalent_to(dict2));
        assert(!dict1.equivalent_to(dict3));
        assert(!dict3.equivalent_to(dict1));
    }
    // Scenario 28: Shared Indirect Leaves Reached via Two Paths
    {
        auto leaf1 = pdf.makeIndirectObject("[1]"_qpdf);
        auto leaf2 = pdf.makeIndirectObject("[2]"_qpdf);
        auto mid1 = pdf.makeIndirectObject(Dictionary::empty());
        mid1.replaceKey("/Leaf1", leaf1);
        mid1.replaceKey("/Leaf2", leaf2);
        auto mid2 = pdf.makeIndirectObject(Dictionary::empty());
        mid2.replaceKey("/Leaf1", leaf1);
        mid2.replaceKey("/Leaf2", leaf2);
        assert(
            QPDFObjectHandle::newArray({mid1, mid2})
                .equivalent_to(QPDFObjectHandle::newArray({mid1, mid2})));
    }
    // Scenario 29: Direct vs Indirect Integer
    {
        assert(Integer(42).equivalent_to(pdf.makeIndirectObject(Integer(42))));
    }
    // Scenario 30: Nested Diamond with Direct & Indirect Objects
    {
        assert(
            QPDFObjectHandle::newArray(
                {pdf.makeIndirectObject("[42]"_qpdf), pdf.makeIndirectObject("[42]"_qpdf)})
                .equivalent_to(
                    QPDFObjectHandle::newArray(
                        {pdf.makeIndirectObject("[42]"_qpdf),
                         pdf.makeIndirectObject("[42]"_qpdf)})));
    }
    // Scenario 31: Image XObjects sharing an SMask
    {
        auto smask = pdf.newStream();
        smask.replaceStreamData(
            "mask data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        auto img1 = pdf.makeIndirectObject(pdf.newStream());
        img1.replaceStreamData(
            "image1 data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        img1.getDict().replaceKey("/SMask", smask);
        auto img2 = pdf.makeIndirectObject(pdf.newStream());
        img2.replaceStreamData(
            "image1 data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        img2.getDict().replaceKey("/SMask", smask);
        assert(img1.equivalent_to(img2));
    }
    // Scenario 32: Image XObjects with two distinct but identical SMasks
    {
        auto smask1 = pdf.newStream();
        smask1.replaceStreamData(
            "mask data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        auto smask2 = pdf.makeIndirectObject(pdf.newStream());
        smask2.replaceStreamData(
            "mask data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        auto img1 = pdf.newStream();
        img1.replaceStreamData(
            "image1 data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        img1.getDict().replaceKey("/SMask", smask1);
        auto img2 = pdf.makeIndirectObject(pdf.newStream());
        img2.replaceStreamData(
            "image1 data", QPDFObjectHandle::newNull(), QPDFObjectHandle::newNull());
        img2.getDict().replaceKey("/SMask", smask2);
        assert(img1.equivalent_to(img2));
    }
    // Scenario 33: Dictionary Key Equivalence with Value Mismatch (Annex J)
    {
        assert(!"<< /Key 1 >>"_qpdf.equivalent_to("<< /K#65#79 2 >>"_qpdf));
    }
    // Scenario 34: Uninitialized vs. Uninitialized (!obj)
    {
        assert(QPDFObjectHandle().equivalent_to(QPDFObjectHandle()));
    }
    // Scenario 35: Uninitialized vs. PDF Null
    {
        assert(QPDFObjectHandle().equivalent_to(QPDFObjectHandle::newNull()));
    }
    // Scenario 36: Distinct Direct Null Objects
    {
        assert(QPDFObjectHandle::newNull().equivalent_to(QPDFObjectHandle::newNull()));
    }
    // Scenario 37: Distinct Indirect Nulls (Different IDs)
    {
        assert(pdf.newIndirectNull().equivalent_to(pdf.newIndirectNull()));
    }
    // Scenario 38: Broken References to Different Missing Objects
    {
        // Both missing objects resolve to null, so we expect equivalence
        assert(pdf.getObject(999999, 0).equivalent_to(pdf.getObject(888888, 0)));
    }
    // Scenario 39: Uninitialized Handle vs PDF Null
    {
        auto h_valid_null = QPDFObjectHandle::newNull();
        QPDFObjectHandle h_uninit;
        assert(h_uninit.equivalent_to(h_valid_null));
        assert(h_valid_null.equivalent_to(h_uninit));
    }
    // Scenario 40: Recursion Depth Limit (The Stack Protector)
    {
        auto make_deep_array = [](int levels) {
            QPDFObjectHandle root = Integer(1);
            for (int i = 0; i < levels; ++i) {
                QPDFObjectHandle arr = "[]"_qpdf;
                arr.appendItem(root);
                root = arr;
            }
            return root;
        };
        auto h_pass_1 = make_deep_array(500);
        auto h_pass_2 = make_deep_array(500);
        assert(h_pass_1.equivalent_to(h_pass_1));
        assert(!h_pass_1.equivalent_to(h_pass_2));
        assert(h_pass_1.equivalent_to(h_pass_1, 499));
        assert(!h_pass_1.equivalent_to(h_pass_2, 499));
        assert(h_pass_1.equivalent_to(h_pass_1, 500));
        assert(h_pass_1.equivalent_to(h_pass_2, 500));
        assert(h_pass_1.equivalent_to(h_pass_1, 501));
        assert(h_pass_1.equivalent_to(h_pass_2, 501));
        auto h_fail_1 = make_deep_array(501);
        auto h_fail_2 = make_deep_array(501);
        assert(h_fail_1.equivalent_to(h_fail_1, 499));
        assert(!h_fail_1.equivalent_to(h_fail_2, 499));
        assert(h_fail_1.equivalent_to(h_fail_1, 500));
        assert(!h_fail_1.equivalent_to(h_fail_2, 500));
        assert(h_fail_1.equivalent_to(h_fail_1, 501));
        assert(h_fail_1.equivalent_to(h_fail_2, 501));
    }
    // Scenario 41: Sparse Arrays (null_count > 100 triggers sparse representation)
    {
        auto dense1 = "[]"_qpdf;
        auto null = "null"_qpdf;
        // Build a parse string with 101 nulls to trigger the sparse path
        std::string sparse_str = "[";
        for (int i = 0; i < 101; ++i) {
            sparse_str += "null ";
            dense1.appendItem(null);
        }
        sparse_str += "]";
        auto sparse1 = QPDFObjectHandle::parse(sparse_str);
        assert(sparse1.equivalent_to(QPDFObjectHandle::parse(sparse_str)));
        assert(dense1.equivalent_to(sparse1));
        assert(sparse1.equivalent_to(dense1));
        // Mismatch: replace one null with an integer
        std::string sparse_diff = "[";
        for (int i = 0; i < 100; ++i) {
            sparse_diff += "null ";
        }
        sparse_diff += "42]";
        auto sparse3 = QPDFObjectHandle::parse(sparse_diff);
        assert(!sparse1.equivalent_to(sparse3));
        assert(!sparse3.equivalent_to(sparse1));
        assert(!dense1.equivalent_to(sparse3));
        assert(!sparse3.equivalent_to(dense1));
        std::string sparse_with_value = "[";
        for (int i = 0; i < 101; ++i) {
            sparse_with_value += "null ";
        }
        sparse_with_value += "42 ]"; // one non-null element at index 100
        assert(
            QPDFObjectHandle::parse(sparse_with_value)
                .equivalent_to(QPDFObjectHandle::parse(sparse_with_value)));
    }
    // Scenario 42: equivalent_to on ot_reference (post-replaceObject)
    {
        auto obj = pdf.makeIndirectObject(Integer(42));
        auto replacement = Integer(42);
        // Hold a handle to replacement before it becomes ot_reference
        auto stale = replacement;
        pdf.replaceObject(obj.getObjGen(), replacement);
        // stale's underlying QPDFObject is now ot_reference
        assert(stale.raw_type_code() == ::ot_reference);
        assert(!stale.equivalent_to(Integer(42)));
    }
}

void
runtest(int n, char const* filename1, char const* arg2)
{
    // Most tests here are crafted to work on specific files.  Look at
    // the test suite to see how the test is invoked to find the file
    // that the test is supposed to operate on.

    std::set<int> ignore_filename = {1, 2, 3};

    QPDF pdf;
    std::shared_ptr<char> file_buf;
    FILE* filep = nullptr;
    if (ignore_filename.contains(n)) {
        // Ignore filename argument entirely
    } else {
        size_t size = 0;
        QUtil::read_file_into_memory(filename1, file_buf, size);
        pdf.processMemoryFile(filename1, file_buf.get(), size);
    }

    std::map<int, void (*)(QPDF&, char const*)> test_functions = {
        {0, test_0}, {1, test_1}, {2, test_2}, {3, test_3}};

    auto fn = test_functions.find(n);
    if (fn == test_functions.end()) {
        throw std::runtime_error(std::string("invalid test ") + QUtil::int_to_string(n));
    }
    (fn->second)(pdf, arg2);

    if (filep) {
        fclose(filep);
    }
    std::cout << "test " << n << " done" << '\n';
}

int
main(int argc, char* argv[])
{
    QUtil::setLineBuf(stdout);
    if ((whoami = strrchr(argv[0], '/')) == nullptr) {
        whoami = argv[0];
    } else {
        ++whoami;
    }

    if ((argc < 3) || (argc > 4)) {
        usage();
    }

    try {
        int n = QUtil::string_to_int(argv[1]);
        char const* filename1 = argv[2];
        char const* arg2 = (argc >= 4) ? argv[3] : "";
        runtest(n, filename1, arg2);
    } catch (std::exception& e) {
        std::cerr << e.what() << '\n';
        exit(2);
    }

    return 0;
}