LLVMFuzzerInitialize:
   34|      1|extern "C" int LLVMFuzzerInitialize(int *argc, char ***argv) {
   35|      1|  g_processor = std::make_unique<sentencepiece::SentencePieceProcessor>();
   36|       |
   37|       |  // Load the model from the embedded byte array
   38|      1|  std::string model_data(
   39|      1|      reinterpret_cast<const char *>(kEmbeddedModelData),
   40|      1|      kEmbeddedModelSize);
   41|      1|  auto status = g_processor->LoadFromSerializedProto(model_data);
   42|      1|  if (!status.ok()) {
  ------------------
  |  Branch (42:7): [True: 0, False: 1]
  ------------------
   43|      0|    fprintf(stderr, "Failed to load embedded model: %s\n",
   44|      0|            status.ToString().c_str());
   45|      0|    abort();
   46|      0|  }
   47|       |
   48|      1|  return 0;
   49|      1|}

_ZN13sentencepiece29TrainerSpec_ModelType_IsValidEi:
  129|      1|bool TrainerSpec_ModelType_IsValid(int value) {
  130|      1|  switch (value) {
  131|      1|    case 1:
  ------------------
  |  Branch (131:5): [True: 1, False: 0]
  ------------------
  132|      1|    case 2:
  ------------------
  |  Branch (132:5): [True: 0, False: 1]
  ------------------
  133|      1|    case 3:
  ------------------
  |  Branch (133:5): [True: 0, False: 1]
  ------------------
  134|      1|    case 4:
  ------------------
  |  Branch (134:5): [True: 0, False: 1]
  ------------------
  135|      1|      return true;
  136|      0|    default:
  ------------------
  |  Branch (136:5): [True: 0, False: 1]
  ------------------
  137|      0|      return false;
  138|      1|  }
  139|      1|}
_ZN13sentencepiece37ModelProto_SentencePiece_Type_IsValidEi:
  197|    259|bool ModelProto_SentencePiece_Type_IsValid(int value) {
  198|    259|  switch (value) {
  199|      0|    case 1:
  ------------------
  |  Branch (199:5): [True: 0, False: 259]
  ------------------
  200|      1|    case 2:
  ------------------
  |  Branch (200:5): [True: 1, False: 258]
  ------------------
  201|      3|    case 3:
  ------------------
  |  Branch (201:5): [True: 2, False: 257]
  ------------------
  202|      3|    case 4:
  ------------------
  |  Branch (202:5): [True: 0, False: 259]
  ------------------
  203|      3|    case 5:
  ------------------
  |  Branch (203:5): [True: 0, False: 259]
  ------------------
  204|    259|    case 6:
  ------------------
  |  Branch (204:5): [True: 256, False: 3]
  ------------------
  205|    259|      return true;
  206|      0|    default:
  ------------------
  |  Branch (206:5): [True: 0, False: 259]
  ------------------
  207|      0|      return false;
  208|    259|  }
  209|    259|}
_ZN13sentencepiece11TrainerSpecC2EPN6google8protobuf5ArenaE:
  415|      2|  : ::PROTOBUF_NAMESPACE_ID::MessageLite(arena),
  416|      2|  _extensions_(arena),
  417|      2|  input_(arena),
  418|      2|  accept_language_(arena),
  419|      2|  control_symbols_(arena),
  420|      2|  user_defined_symbols_(arena) {
  421|      2|  SharedCtor();
  422|      2|  RegisterArenaDtor(arena);
  423|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.TrainerSpec)
  424|      2|}
_ZN13sentencepiece11TrainerSpec14_InternalParseEPKcPN6google8protobuf8internal12ParseContextE:
  646|      1|const char* TrainerSpec::_InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) {
  647|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  648|      4|  while (!ctx->Done(&ptr)) {
  ------------------
  |  Branch (648:10): [True: 3, False: 1]
  ------------------
  649|      3|    ::PROTOBUF_NAMESPACE_ID::uint32 tag;
  650|      3|    ptr = ::PROTOBUF_NAMESPACE_ID::internal::ReadTag(ptr, &tag);
  651|      3|    CHK_(ptr);
  ------------------
  |  |  647|      3|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      3|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 3]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  652|      3|    switch (tag >> 3) {
  653|       |      // repeated string input = 1;
  654|      0|      case 1:
  ------------------
  |  Branch (654:7): [True: 0, False: 3]
  ------------------
  655|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 10)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  656|      0|          ptr -= 1;
  657|      0|          do {
  658|      0|            ptr += 1;
  659|      0|            auto str = _internal_add_input();
  660|      0|            ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  661|      0|            CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  662|      0|            if (!ctx->DataAvailable(ptr)) break;
  ------------------
  |  Branch (662:17): [True: 0, False: 0]
  ------------------
  663|      0|          } while (::PROTOBUF_NAMESPACE_ID::internal::ExpectTag<10>(ptr));
  ------------------
  |  Branch (663:20): [True: 0, False: 0]
  ------------------
  664|      0|        } else goto handle_unusual;
  665|      0|        continue;
  666|       |      // optional string model_prefix = 2;
  667|      0|      case 2:
  ------------------
  |  Branch (667:7): [True: 0, False: 3]
  ------------------
  668|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 18)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  669|      0|          auto str = _internal_mutable_model_prefix();
  670|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  671|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  672|      0|        } else goto handle_unusual;
  673|      0|        continue;
  674|       |      // optional .sentencepiece.TrainerSpec.ModelType model_type = 3 [default = UNIGRAM];
  675|      1|      case 3:
  ------------------
  |  Branch (675:7): [True: 1, False: 2]
  ------------------
  676|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 24)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  677|      1|          ::PROTOBUF_NAMESPACE_ID::uint64 val = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  678|      1|          CHK_(ptr);
  ------------------
  |  |  647|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  679|      1|          if (PROTOBUF_PREDICT_TRUE(::sentencepiece::TrainerSpec_ModelType_IsValid(val))) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  680|      1|            _internal_set_model_type(static_cast<::sentencepiece::TrainerSpec_ModelType>(val));
  681|      1|          } else {
  682|      0|            ::PROTOBUF_NAMESPACE_ID::internal::WriteVarint(3, val, mutable_unknown_fields());
  683|      0|          }
  684|      1|        } else goto handle_unusual;
  685|      1|        continue;
  686|       |      // optional int32 vocab_size = 4 [default = 8000];
  687|      1|      case 4:
  ------------------
  |  Branch (687:7): [True: 1, False: 2]
  ------------------
  688|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 32)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  689|      1|          _Internal::set_has_vocab_size(&_has_bits_);
  690|      1|          vocab_size_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  691|      1|          CHK_(ptr);
  ------------------
  |  |  647|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  692|      1|        } else goto handle_unusual;
  693|      1|        continue;
  694|       |      // repeated string accept_language = 5;
  695|      1|      case 5:
  ------------------
  |  Branch (695:7): [True: 0, False: 3]
  ------------------
  696|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 42)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  697|      0|          ptr -= 1;
  698|      0|          do {
  699|      0|            ptr += 1;
  700|      0|            auto str = _internal_add_accept_language();
  701|      0|            ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  702|      0|            CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  703|      0|            if (!ctx->DataAvailable(ptr)) break;
  ------------------
  |  Branch (703:17): [True: 0, False: 0]
  ------------------
  704|      0|          } while (::PROTOBUF_NAMESPACE_ID::internal::ExpectTag<42>(ptr));
  ------------------
  |  Branch (704:20): [True: 0, False: 0]
  ------------------
  705|      0|        } else goto handle_unusual;
  706|      0|        continue;
  707|       |      // optional int32 self_test_sample_size = 6 [default = 0];
  708|      0|      case 6:
  ------------------
  |  Branch (708:7): [True: 0, False: 3]
  ------------------
  709|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 48)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  710|      0|          _Internal::set_has_self_test_sample_size(&_has_bits_);
  711|      0|          self_test_sample_size_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  712|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  713|      0|        } else goto handle_unusual;
  714|      0|        continue;
  715|       |      // optional string input_format = 7;
  716|      0|      case 7:
  ------------------
  |  Branch (716:7): [True: 0, False: 3]
  ------------------
  717|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 58)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  718|      0|          auto str = _internal_mutable_input_format();
  719|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  720|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  721|      0|        } else goto handle_unusual;
  722|      0|        continue;
  723|       |      // optional float character_coverage = 10 [default = 0.9995];
  724|      0|      case 10:
  ------------------
  |  Branch (724:7): [True: 0, False: 3]
  ------------------
  725|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 85)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  726|      0|          _Internal::set_has_character_coverage(&_has_bits_);
  727|      0|          character_coverage_ = ::PROTOBUF_NAMESPACE_ID::internal::UnalignedLoad<float>(ptr);
  728|      0|          ptr += sizeof(float);
  729|      0|        } else goto handle_unusual;
  730|      0|        continue;
  731|       |      // optional uint64 input_sentence_size = 11 [default = 0];
  732|      0|      case 11:
  ------------------
  |  Branch (732:7): [True: 0, False: 3]
  ------------------
  733|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 88)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  734|      0|          _Internal::set_has_input_sentence_size(&_has_bits_);
  735|      0|          input_sentence_size_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  736|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  737|      0|        } else goto handle_unusual;
  738|      0|        continue;
  739|       |      // optional int32 mining_sentence_size = 12 [deprecated = true];
  740|      0|      case 12:
  ------------------
  |  Branch (740:7): [True: 0, False: 3]
  ------------------
  741|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 96)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  742|      0|          _Internal::set_has_mining_sentence_size(&_has_bits_);
  743|      0|          mining_sentence_size_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  744|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  745|      0|        } else goto handle_unusual;
  746|      0|        continue;
  747|       |      // optional int32 training_sentence_size = 13 [deprecated = true];
  748|      0|      case 13:
  ------------------
  |  Branch (748:7): [True: 0, False: 3]
  ------------------
  749|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 104)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  750|      0|          _Internal::set_has_training_sentence_size(&_has_bits_);
  751|      0|          training_sentence_size_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  752|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  753|      0|        } else goto handle_unusual;
  754|      0|        continue;
  755|       |      // optional int32 seed_sentencepiece_size = 14 [default = 1000000];
  756|      0|      case 14:
  ------------------
  |  Branch (756:7): [True: 0, False: 3]
  ------------------
  757|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 112)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  758|      0|          _Internal::set_has_seed_sentencepiece_size(&_has_bits_);
  759|      0|          seed_sentencepiece_size_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  760|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  761|      0|        } else goto handle_unusual;
  762|      0|        continue;
  763|       |      // optional float shrinking_factor = 15 [default = 0.75];
  764|      0|      case 15:
  ------------------
  |  Branch (764:7): [True: 0, False: 3]
  ------------------
  765|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 125)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  766|      0|          _Internal::set_has_shrinking_factor(&_has_bits_);
  767|      0|          shrinking_factor_ = ::PROTOBUF_NAMESPACE_ID::internal::UnalignedLoad<float>(ptr);
  768|      0|          ptr += sizeof(float);
  769|      0|        } else goto handle_unusual;
  770|      0|        continue;
  771|       |      // optional int32 num_threads = 16 [default = 16];
  772|      0|      case 16:
  ------------------
  |  Branch (772:7): [True: 0, False: 3]
  ------------------
  773|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 128)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  774|      0|          _Internal::set_has_num_threads(&_has_bits_);
  775|      0|          num_threads_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  776|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  777|      0|        } else goto handle_unusual;
  778|      0|        continue;
  779|       |      // optional int32 num_sub_iterations = 17 [default = 2];
  780|      0|      case 17:
  ------------------
  |  Branch (780:7): [True: 0, False: 3]
  ------------------
  781|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 136)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  782|      0|          _Internal::set_has_num_sub_iterations(&_has_bits_);
  783|      0|          num_sub_iterations_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  784|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  785|      0|        } else goto handle_unusual;
  786|      0|        continue;
  787|       |      // optional int32 max_sentence_length = 18 [default = 4192];
  788|      0|      case 18:
  ------------------
  |  Branch (788:7): [True: 0, False: 3]
  ------------------
  789|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 144)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  790|      0|          _Internal::set_has_max_sentence_length(&_has_bits_);
  791|      0|          max_sentence_length_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  792|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  793|      0|        } else goto handle_unusual;
  794|      0|        continue;
  795|       |      // optional bool shuffle_input_sentence = 19 [default = true];
  796|      0|      case 19:
  ------------------
  |  Branch (796:7): [True: 0, False: 3]
  ------------------
  797|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 152)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  798|      0|          _Internal::set_has_shuffle_input_sentence(&_has_bits_);
  799|      0|          shuffle_input_sentence_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  800|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  801|      0|        } else goto handle_unusual;
  802|      0|        continue;
  803|       |      // optional int32 max_sentencepiece_length = 20 [default = 16];
  804|      0|      case 20:
  ------------------
  |  Branch (804:7): [True: 0, False: 3]
  ------------------
  805|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 160)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  806|      0|          _Internal::set_has_max_sentencepiece_length(&_has_bits_);
  807|      0|          max_sentencepiece_length_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  808|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  809|      0|        } else goto handle_unusual;
  810|      0|        continue;
  811|       |      // optional bool split_by_unicode_script = 21 [default = true];
  812|      0|      case 21:
  ------------------
  |  Branch (812:7): [True: 0, False: 3]
  ------------------
  813|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 168)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  814|      0|          _Internal::set_has_split_by_unicode_script(&_has_bits_);
  815|      0|          split_by_unicode_script_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  816|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  817|      0|        } else goto handle_unusual;
  818|      0|        continue;
  819|       |      // optional bool split_by_whitespace = 22 [default = true];
  820|      0|      case 22:
  ------------------
  |  Branch (820:7): [True: 0, False: 3]
  ------------------
  821|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 176)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  822|      0|          _Internal::set_has_split_by_whitespace(&_has_bits_);
  823|      0|          split_by_whitespace_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  824|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  825|      0|        } else goto handle_unusual;
  826|      0|        continue;
  827|       |      // optional bool split_by_number = 23 [default = true];
  828|      0|      case 23:
  ------------------
  |  Branch (828:7): [True: 0, False: 3]
  ------------------
  829|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 184)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  830|      0|          _Internal::set_has_split_by_number(&_has_bits_);
  831|      0|          split_by_number_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  832|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  833|      0|        } else goto handle_unusual;
  834|      0|        continue;
  835|       |      // optional bool treat_whitespace_as_suffix = 24 [default = false];
  836|      0|      case 24:
  ------------------
  |  Branch (836:7): [True: 0, False: 3]
  ------------------
  837|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 192)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  838|      0|          _Internal::set_has_treat_whitespace_as_suffix(&_has_bits_);
  839|      0|          treat_whitespace_as_suffix_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  840|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  841|      0|        } else goto handle_unusual;
  842|      0|        continue;
  843|       |      // optional bool split_digits = 25 [default = false];
  844|      0|      case 25:
  ------------------
  |  Branch (844:7): [True: 0, False: 3]
  ------------------
  845|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 200)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  846|      0|          _Internal::set_has_split_digits(&_has_bits_);
  847|      0|          split_digits_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  848|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  849|      0|        } else goto handle_unusual;
  850|      0|        continue;
  851|       |      // optional bool allow_whitespace_only_pieces = 26 [default = false];
  852|      0|      case 26:
  ------------------
  |  Branch (852:7): [True: 0, False: 3]
  ------------------
  853|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 208)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  854|      0|          _Internal::set_has_allow_whitespace_only_pieces(&_has_bits_);
  855|      0|          allow_whitespace_only_pieces_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  856|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  857|      0|        } else goto handle_unusual;
  858|      0|        continue;
  859|       |      // repeated string control_symbols = 30;
  860|      0|      case 30:
  ------------------
  |  Branch (860:7): [True: 0, False: 3]
  ------------------
  861|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 242)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  862|      0|          ptr -= 2;
  863|      0|          do {
  864|      0|            ptr += 2;
  865|      0|            auto str = _internal_add_control_symbols();
  866|      0|            ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  867|      0|            CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  868|      0|            if (!ctx->DataAvailable(ptr)) break;
  ------------------
  |  Branch (868:17): [True: 0, False: 0]
  ------------------
  869|      0|          } while (::PROTOBUF_NAMESPACE_ID::internal::ExpectTag<242>(ptr));
  ------------------
  |  Branch (869:20): [True: 0, False: 0]
  ------------------
  870|      0|        } else goto handle_unusual;
  871|      0|        continue;
  872|       |      // repeated string user_defined_symbols = 31;
  873|      0|      case 31:
  ------------------
  |  Branch (873:7): [True: 0, False: 3]
  ------------------
  874|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 250)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  875|      0|          ptr -= 2;
  876|      0|          do {
  877|      0|            ptr += 2;
  878|      0|            auto str = _internal_add_user_defined_symbols();
  879|      0|            ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  880|      0|            CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  881|      0|            if (!ctx->DataAvailable(ptr)) break;
  ------------------
  |  Branch (881:17): [True: 0, False: 0]
  ------------------
  882|      0|          } while (::PROTOBUF_NAMESPACE_ID::internal::ExpectTag<250>(ptr));
  ------------------
  |  Branch (882:20): [True: 0, False: 0]
  ------------------
  883|      0|        } else goto handle_unusual;
  884|      0|        continue;
  885|       |      // optional bool vocabulary_output_piece_score = 32 [default = true];
  886|      0|      case 32:
  ------------------
  |  Branch (886:7): [True: 0, False: 3]
  ------------------
  887|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 0)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  888|      0|          _Internal::set_has_vocabulary_output_piece_score(&_has_bits_);
  889|      0|          vocabulary_output_piece_score_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  890|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  891|      0|        } else goto handle_unusual;
  892|      0|        continue;
  893|       |      // optional bool hard_vocab_limit = 33 [default = true];
  894|      0|      case 33:
  ------------------
  |  Branch (894:7): [True: 0, False: 3]
  ------------------
  895|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 8)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  896|      0|          _Internal::set_has_hard_vocab_limit(&_has_bits_);
  897|      0|          hard_vocab_limit_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  898|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  899|      0|        } else goto handle_unusual;
  900|      0|        continue;
  901|       |      // optional bool use_all_vocab = 34 [default = false];
  902|      0|      case 34:
  ------------------
  |  Branch (902:7): [True: 0, False: 3]
  ------------------
  903|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 16)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  904|      0|          _Internal::set_has_use_all_vocab(&_has_bits_);
  905|      0|          use_all_vocab_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  906|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  907|      0|        } else goto handle_unusual;
  908|      0|        continue;
  909|       |      // optional bool byte_fallback = 35 [default = false];
  910|      1|      case 35:
  ------------------
  |  Branch (910:7): [True: 1, False: 2]
  ------------------
  911|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 24)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  912|      1|          _Internal::set_has_byte_fallback(&_has_bits_);
  913|      1|          byte_fallback_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  914|      1|          CHK_(ptr);
  ------------------
  |  |  647|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  915|      1|        } else goto handle_unusual;
  916|      1|        continue;
  917|       |      // optional string required_chars = 36;
  918|      1|      case 36:
  ------------------
  |  Branch (918:7): [True: 0, False: 3]
  ------------------
  919|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 34)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  920|      0|          auto str = _internal_mutable_required_chars();
  921|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  922|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  923|      0|        } else goto handle_unusual;
  924|      0|        continue;
  925|       |      // optional int32 unk_id = 40 [default = 0];
  926|      0|      case 40:
  ------------------
  |  Branch (926:7): [True: 0, False: 3]
  ------------------
  927|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 64)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  928|      0|          _Internal::set_has_unk_id(&_has_bits_);
  929|      0|          unk_id_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  930|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  931|      0|        } else goto handle_unusual;
  932|      0|        continue;
  933|       |      // optional int32 bos_id = 41 [default = 1];
  934|      0|      case 41:
  ------------------
  |  Branch (934:7): [True: 0, False: 3]
  ------------------
  935|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 72)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  936|      0|          _Internal::set_has_bos_id(&_has_bits_);
  937|      0|          bos_id_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  938|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  939|      0|        } else goto handle_unusual;
  940|      0|        continue;
  941|       |      // optional int32 eos_id = 42 [default = 2];
  942|      0|      case 42:
  ------------------
  |  Branch (942:7): [True: 0, False: 3]
  ------------------
  943|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 80)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  944|      0|          _Internal::set_has_eos_id(&_has_bits_);
  945|      0|          eos_id_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  946|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  947|      0|        } else goto handle_unusual;
  948|      0|        continue;
  949|       |      // optional int32 pad_id = 43 [default = -1];
  950|      0|      case 43:
  ------------------
  |  Branch (950:7): [True: 0, False: 3]
  ------------------
  951|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 88)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  952|      0|          _Internal::set_has_pad_id(&_has_bits_);
  953|      0|          pad_id_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
  954|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  955|      0|        } else goto handle_unusual;
  956|      0|        continue;
  957|       |      // optional string unk_surface = 44 [default = " \342\201\207 "];
  958|      0|      case 44:
  ------------------
  |  Branch (958:7): [True: 0, False: 3]
  ------------------
  959|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 98)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  960|      0|          auto str = _internal_mutable_unk_surface();
  961|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  962|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  963|      0|        } else goto handle_unusual;
  964|      0|        continue;
  965|       |      // optional string unk_piece = 45 [default = "<unk>"];
  966|      0|      case 45:
  ------------------
  |  Branch (966:7): [True: 0, False: 3]
  ------------------
  967|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 106)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  968|      0|          auto str = _internal_mutable_unk_piece();
  969|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  970|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  971|      0|        } else goto handle_unusual;
  972|      0|        continue;
  973|       |      // optional string bos_piece = 46 [default = "<s>"];
  974|      0|      case 46:
  ------------------
  |  Branch (974:7): [True: 0, False: 3]
  ------------------
  975|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 114)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  976|      0|          auto str = _internal_mutable_bos_piece();
  977|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  978|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  979|      0|        } else goto handle_unusual;
  980|      0|        continue;
  981|       |      // optional string eos_piece = 47 [default = "</s>"];
  982|      0|      case 47:
  ------------------
  |  Branch (982:7): [True: 0, False: 3]
  ------------------
  983|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 122)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  984|      0|          auto str = _internal_mutable_eos_piece();
  985|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  986|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  987|      0|        } else goto handle_unusual;
  988|      0|        continue;
  989|       |      // optional string pad_piece = 48 [default = "<pad>"];
  990|      0|      case 48:
  ------------------
  |  Branch (990:7): [True: 0, False: 3]
  ------------------
  991|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 130)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  992|      0|          auto str = _internal_mutable_pad_piece();
  993|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
  994|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  995|      0|        } else goto handle_unusual;
  996|      0|        continue;
  997|       |      // optional bool train_extremely_large_corpus = 49 [default = false];
  998|      0|      case 49:
  ------------------
  |  Branch (998:7): [True: 0, False: 3]
  ------------------
  999|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 136)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1000|      0|          _Internal::set_has_train_extremely_large_corpus(&_has_bits_);
 1001|      0|          train_extremely_large_corpus_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 1002|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1003|      0|        } else goto handle_unusual;
 1004|      0|        continue;
 1005|       |      // optional bool enable_differential_privacy = 50 [default = false];
 1006|      0|      case 50:
  ------------------
  |  Branch (1006:7): [True: 0, False: 3]
  ------------------
 1007|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 144)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1008|      0|          _Internal::set_has_enable_differential_privacy(&_has_bits_);
 1009|      0|          enable_differential_privacy_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 1010|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1011|      0|        } else goto handle_unusual;
 1012|      0|        continue;
 1013|       |      // optional float differential_privacy_noise_level = 51 [default = 0];
 1014|      0|      case 51:
  ------------------
  |  Branch (1014:7): [True: 0, False: 3]
  ------------------
 1015|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 157)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1016|      0|          _Internal::set_has_differential_privacy_noise_level(&_has_bits_);
 1017|      0|          differential_privacy_noise_level_ = ::PROTOBUF_NAMESPACE_ID::internal::UnalignedLoad<float>(ptr);
 1018|      0|          ptr += sizeof(float);
 1019|      0|        } else goto handle_unusual;
 1020|      0|        continue;
 1021|       |      // optional uint64 differential_privacy_clipping_threshold = 52 [default = 0];
 1022|      0|      case 52:
  ------------------
  |  Branch (1022:7): [True: 0, False: 3]
  ------------------
 1023|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 160)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1024|      0|          _Internal::set_has_differential_privacy_clipping_threshold(&_has_bits_);
 1025|      0|          differential_privacy_clipping_threshold_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 1026|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1027|      0|        } else goto handle_unusual;
 1028|      0|        continue;
 1029|       |      // optional string pretokenization_delimiter = 53 [default = ""];
 1030|      0|      case 53:
  ------------------
  |  Branch (1030:7): [True: 0, False: 3]
  ------------------
 1031|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 170)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1032|      0|          auto str = _internal_mutable_pretokenization_delimiter();
 1033|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
 1034|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1035|      0|        } else goto handle_unusual;
 1036|      0|        continue;
 1037|       |      // optional string seed_sentencepieces_file = 54 [default = ""];
 1038|      0|      case 54:
  ------------------
  |  Branch (1038:7): [True: 0, False: 3]
  ------------------
 1039|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 178)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1040|      0|          auto str = _internal_mutable_seed_sentencepieces_file();
 1041|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
 1042|      0|          CHK_(ptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1043|      0|        } else goto handle_unusual;
 1044|      0|        continue;
 1045|      0|      default: {
  ------------------
  |  Branch (1045:7): [True: 0, False: 3]
  ------------------
 1046|      0|      handle_unusual:
 1047|      0|        if ((tag & 7) == 4 || tag == 0) {
  ------------------
  |  Branch (1047:13): [True: 0, False: 0]
  |  Branch (1047:31): [True: 0, False: 0]
  ------------------
 1048|      0|          ctx->SetLastTag(tag);
 1049|      0|          goto success;
 1050|      0|        }
 1051|      0|      if ((1600u <= tag)) {
  ------------------
  |  Branch (1051:11): [True: 0, False: 0]
  ------------------
 1052|      0|        ptr = _extensions_.ParseField(tag, ptr,
 1053|      0|            internal_default_instance(), &_internal_metadata_, ctx);
 1054|      0|        CHK_(ptr != nullptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1055|      0|        continue;
 1056|      0|      }
 1057|      0|        ptr = UnknownFieldParse(tag,
 1058|      0|            _internal_metadata_.mutable_unknown_fields<std::string>(),
 1059|      0|            ptr, ctx);
 1060|      0|        CHK_(ptr != nullptr);
  ------------------
  |  |  647|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1061|      0|        continue;
 1062|      0|      }
 1063|      3|    }  // switch
 1064|      3|  }  // while
 1065|      1|success:
 1066|      1|  return ptr;
 1067|      0|failure:
 1068|      0|  ptr = nullptr;
 1069|      0|  goto success;
 1070|      1|#undef CHK_
 1071|      1|}
_ZNK13sentencepiece11TrainerSpec13IsInitializedEv:
 1872|      1|bool TrainerSpec::IsInitialized() const {
 1873|      1|  if (!_extensions_.IsInitialized()) {
  ------------------
  |  Branch (1873:7): [True: 0, False: 1]
  ------------------
 1874|      0|    return false;
 1875|      0|  }
 1876|       |
 1877|      1|  return true;
 1878|      1|}
_ZN13sentencepiece14NormalizerSpecC2EPN6google8protobuf5ArenaE:
 1957|      2|  : ::PROTOBUF_NAMESPACE_ID::MessageLite(arena),
 1958|      2|  _extensions_(arena) {
 1959|      2|  SharedCtor();
 1960|      2|  RegisterArenaDtor(arena);
 1961|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.NormalizerSpec)
 1962|      2|}
_ZN13sentencepiece14NormalizerSpec14_InternalParseEPKcPN6google8protobuf8internal12ParseContextE:
 2053|      1|const char* NormalizerSpec::_InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) {
 2054|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
 2055|      1|  _Internal::HasBits has_bits{};
 2056|      4|  while (!ctx->Done(&ptr)) {
  ------------------
  |  Branch (2056:10): [True: 3, False: 1]
  ------------------
 2057|      3|    ::PROTOBUF_NAMESPACE_ID::uint32 tag;
 2058|      3|    ptr = ::PROTOBUF_NAMESPACE_ID::internal::ReadTag(ptr, &tag);
 2059|      3|    CHK_(ptr);
  ------------------
  |  | 2054|      3|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      3|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 3]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2060|      3|    switch (tag >> 3) {
 2061|       |      // optional string name = 1;
 2062|      0|      case 1:
  ------------------
  |  Branch (2062:7): [True: 0, False: 3]
  ------------------
 2063|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 10)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 2064|      0|          auto str = _internal_mutable_name();
 2065|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
 2066|      0|          CHK_(ptr);
  ------------------
  |  | 2054|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2067|      0|        } else goto handle_unusual;
 2068|      0|        continue;
 2069|       |      // optional bytes precompiled_charsmap = 2;
 2070|      0|      case 2:
  ------------------
  |  Branch (2070:7): [True: 0, False: 3]
  ------------------
 2071|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 18)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 2072|      0|          auto str = _internal_mutable_precompiled_charsmap();
 2073|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
 2074|      0|          CHK_(ptr);
  ------------------
  |  | 2054|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2075|      0|        } else goto handle_unusual;
 2076|      0|        continue;
 2077|       |      // optional bool add_dummy_prefix = 3 [default = true];
 2078|      1|      case 3:
  ------------------
  |  Branch (2078:7): [True: 1, False: 2]
  ------------------
 2079|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 24)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 2080|      1|          _Internal::set_has_add_dummy_prefix(&has_bits);
 2081|      1|          add_dummy_prefix_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 2082|      1|          CHK_(ptr);
  ------------------
  |  | 2054|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2083|      1|        } else goto handle_unusual;
 2084|      1|        continue;
 2085|       |      // optional bool remove_extra_whitespaces = 4 [default = true];
 2086|      1|      case 4:
  ------------------
  |  Branch (2086:7): [True: 1, False: 2]
  ------------------
 2087|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 32)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 2088|      1|          _Internal::set_has_remove_extra_whitespaces(&has_bits);
 2089|      1|          remove_extra_whitespaces_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 2090|      1|          CHK_(ptr);
  ------------------
  |  | 2054|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2091|      1|        } else goto handle_unusual;
 2092|      1|        continue;
 2093|       |      // optional bool escape_whitespaces = 5 [default = true];
 2094|      1|      case 5:
  ------------------
  |  Branch (2094:7): [True: 1, False: 2]
  ------------------
 2095|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 40)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 2096|      1|          _Internal::set_has_escape_whitespaces(&has_bits);
 2097|      1|          escape_whitespaces_ = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 2098|      1|          CHK_(ptr);
  ------------------
  |  | 2054|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2099|      1|        } else goto handle_unusual;
 2100|      1|        continue;
 2101|       |      // optional string normalization_rule_tsv = 6;
 2102|      1|      case 6:
  ------------------
  |  Branch (2102:7): [True: 0, False: 3]
  ------------------
 2103|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 50)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 2104|      0|          auto str = _internal_mutable_normalization_rule_tsv();
 2105|      0|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
 2106|      0|          CHK_(ptr);
  ------------------
  |  | 2054|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2107|      0|        } else goto handle_unusual;
 2108|      0|        continue;
 2109|      0|      default: {
  ------------------
  |  Branch (2109:7): [True: 0, False: 3]
  ------------------
 2110|      0|      handle_unusual:
 2111|      0|        if ((tag & 7) == 4 || tag == 0) {
  ------------------
  |  Branch (2111:13): [True: 0, False: 0]
  |  Branch (2111:31): [True: 0, False: 0]
  ------------------
 2112|      0|          ctx->SetLastTag(tag);
 2113|      0|          goto success;
 2114|      0|        }
 2115|      0|      if ((1600u <= tag)) {
  ------------------
  |  Branch (2115:11): [True: 0, False: 0]
  ------------------
 2116|      0|        ptr = _extensions_.ParseField(tag, ptr,
 2117|      0|            internal_default_instance(), &_internal_metadata_, ctx);
 2118|      0|        CHK_(ptr != nullptr);
  ------------------
  |  | 2054|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2119|      0|        continue;
 2120|      0|      }
 2121|      0|        ptr = UnknownFieldParse(tag,
 2122|      0|            _internal_metadata_.mutable_unknown_fields<std::string>(),
 2123|      0|            ptr, ctx);
 2124|      0|        CHK_(ptr != nullptr);
  ------------------
  |  | 2054|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2125|      0|        continue;
 2126|      0|      }
 2127|      3|    }  // switch
 2128|      3|  }  // while
 2129|      1|success:
 2130|      1|  _has_bits_.Or(has_bits);
 2131|      1|  return ptr;
 2132|      0|failure:
 2133|      0|  ptr = nullptr;
 2134|      0|  goto success;
 2135|      1|#undef CHK_
 2136|      1|}
_ZNK13sentencepiece14NormalizerSpec13IsInitializedEv:
 2295|      1|bool NormalizerSpec::IsInitialized() const {
 2296|      1|  if (!_extensions_.IsInitialized()) {
  ------------------
  |  Branch (2296:7): [True: 0, False: 1]
  ------------------
 2297|      0|    return false;
 2298|      0|  }
 2299|       |
 2300|      1|  return true;
 2301|      1|}
_ZN13sentencepiece19SelfTestData_SampleC2EPN6google8protobuf5ArenaE:
 2335|      1|  : ::PROTOBUF_NAMESPACE_ID::MessageLite(arena) {
 2336|      1|  SharedCtor();
 2337|      1|  RegisterArenaDtor(arena);
 2338|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.SelfTestData.Sample)
 2339|      1|}
_ZN13sentencepiece12SelfTestDataC2EPN6google8protobuf5ArenaE:
 2571|      1|  : ::PROTOBUF_NAMESPACE_ID::MessageLite(arena),
 2572|      1|  _extensions_(arena),
 2573|      1|  samples_(arena) {
 2574|      1|  SharedCtor();
 2575|      1|  RegisterArenaDtor(arena);
 2576|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.SelfTestData)
 2577|      1|}
_ZN13sentencepiece24ModelProto_SentencePieceC2EPN6google8protobuf5ArenaE:
 2785|    299|  : ::PROTOBUF_NAMESPACE_ID::MessageLite(arena),
 2786|    299|  _extensions_(arena) {
 2787|    299|  SharedCtor();
 2788|    299|  RegisterArenaDtor(arena);
 2789|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.ModelProto.SentencePiece)
 2790|    299|}
_ZN13sentencepiece24ModelProto_SentencePiece14_InternalParseEPKcPN6google8protobuf8internal12ParseContextE:
 2859|    298|const char* ModelProto_SentencePiece::_InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) {
 2860|    298|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
 2861|    298|  _Internal::HasBits has_bits{};
 2862|  1.15k|  while (!ctx->Done(&ptr)) {
  ------------------
  |  Branch (2862:10): [True: 855, False: 298]
  ------------------
 2863|    855|    ::PROTOBUF_NAMESPACE_ID::uint32 tag;
 2864|    855|    ptr = ::PROTOBUF_NAMESPACE_ID::internal::ReadTag(ptr, &tag);
 2865|    855|    CHK_(ptr);
  ------------------
  |  | 2860|    855|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|    855|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 855]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2866|    855|    switch (tag >> 3) {
 2867|       |      // optional string piece = 1;
 2868|    298|      case 1:
  ------------------
  |  Branch (2868:7): [True: 298, False: 557]
  ------------------
 2869|    298|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 10)) {
  ------------------
  |  |  236|    298|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 298, False: 0]
  |  |  ------------------
  ------------------
 2870|    298|          auto str = _internal_mutable_piece();
 2871|    298|          ptr = ::PROTOBUF_NAMESPACE_ID::internal::InlineGreedyStringParser(str, ptr, ctx);
 2872|    298|          CHK_(ptr);
  ------------------
  |  | 2860|    298|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|    298|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 298]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2873|    298|        } else goto handle_unusual;
 2874|    298|        continue;
 2875|       |      // optional float score = 2;
 2876|    298|      case 2:
  ------------------
  |  Branch (2876:7): [True: 298, False: 557]
  ------------------
 2877|    298|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 21)) {
  ------------------
  |  |  236|    298|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 298, False: 0]
  |  |  ------------------
  ------------------
 2878|    298|          _Internal::set_has_score(&has_bits);
 2879|    298|          score_ = ::PROTOBUF_NAMESPACE_ID::internal::UnalignedLoad<float>(ptr);
 2880|    298|          ptr += sizeof(float);
 2881|    298|        } else goto handle_unusual;
 2882|    298|        continue;
 2883|       |      // optional .sentencepiece.ModelProto.SentencePiece.Type type = 3 [default = NORMAL];
 2884|    298|      case 3:
  ------------------
  |  Branch (2884:7): [True: 259, False: 596]
  ------------------
 2885|    259|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 24)) {
  ------------------
  |  |  236|    259|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 259, False: 0]
  |  |  ------------------
  ------------------
 2886|    259|          ::PROTOBUF_NAMESPACE_ID::uint64 val = ::PROTOBUF_NAMESPACE_ID::internal::ReadVarint64(&ptr);
 2887|    259|          CHK_(ptr);
  ------------------
  |  | 2860|    259|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|    259|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 259]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2888|    259|          if (PROTOBUF_PREDICT_TRUE(::sentencepiece::ModelProto_SentencePiece_Type_IsValid(val))) {
  ------------------
  |  |  236|    259|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 259, False: 0]
  |  |  ------------------
  ------------------
 2889|    259|            _internal_set_type(static_cast<::sentencepiece::ModelProto_SentencePiece_Type>(val));
 2890|    259|          } else {
 2891|      0|            ::PROTOBUF_NAMESPACE_ID::internal::WriteVarint(3, val, mutable_unknown_fields());
 2892|      0|          }
 2893|    259|        } else goto handle_unusual;
 2894|    259|        continue;
 2895|    259|      default: {
  ------------------
  |  Branch (2895:7): [True: 0, False: 855]
  ------------------
 2896|      0|      handle_unusual:
 2897|      0|        if ((tag & 7) == 4 || tag == 0) {
  ------------------
  |  Branch (2897:13): [True: 0, False: 0]
  |  Branch (2897:31): [True: 0, False: 0]
  ------------------
 2898|      0|          ctx->SetLastTag(tag);
 2899|      0|          goto success;
 2900|      0|        }
 2901|      0|      if ((1600u <= tag)) {
  ------------------
  |  Branch (2901:11): [True: 0, False: 0]
  ------------------
 2902|      0|        ptr = _extensions_.ParseField(tag, ptr,
 2903|      0|            internal_default_instance(), &_internal_metadata_, ctx);
 2904|      0|        CHK_(ptr != nullptr);
  ------------------
  |  | 2860|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2905|      0|        continue;
 2906|      0|      }
 2907|      0|        ptr = UnknownFieldParse(tag,
 2908|      0|            _internal_metadata_.mutable_unknown_fields<std::string>(),
 2909|      0|            ptr, ctx);
 2910|      0|        CHK_(ptr != nullptr);
  ------------------
  |  | 2860|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2911|      0|        continue;
 2912|      0|      }
 2913|    855|    }  // switch
 2914|    855|  }  // while
 2915|    298|success:
 2916|    298|  _has_bits_.Or(has_bits);
 2917|    298|  return ptr;
 2918|      0|failure:
 2919|      0|  ptr = nullptr;
 2920|      0|  goto success;
 2921|    298|#undef CHK_
 2922|    298|}
_ZNK13sentencepiece24ModelProto_SentencePiece13IsInitializedEv:
 3037|    298|bool ModelProto_SentencePiece::IsInitialized() const {
 3038|    298|  if (!_extensions_.IsInitialized()) {
  ------------------
  |  Branch (3038:7): [True: 0, False: 298]
  ------------------
 3039|      0|    return false;
 3040|      0|  }
 3041|       |
 3042|    298|  return true;
 3043|    298|}
_ZN13sentencepiece10ModelProtoC2EPN6google8protobuf5ArenaE:
 3100|      2|  : ::PROTOBUF_NAMESPACE_ID::MessageLite(arena),
 3101|      2|  _extensions_(arena),
 3102|      2|  pieces_(arena) {
 3103|      2|  SharedCtor();
 3104|      2|  RegisterArenaDtor(arena);
 3105|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.ModelProto)
 3106|      2|}
_ZN13sentencepiece10ModelProto5ClearEv:
 3173|      1|void ModelProto::Clear() {
 3174|       |// @@protoc_insertion_point(message_clear_start:sentencepiece.ModelProto)
 3175|      1|  ::PROTOBUF_NAMESPACE_ID::uint32 cached_has_bits = 0;
 3176|       |  // Prevent compiler warnings about cached_has_bits being unused
 3177|      1|  (void) cached_has_bits;
 3178|       |
 3179|      1|  _extensions_.Clear();
 3180|      1|  pieces_.Clear();
 3181|      1|  cached_has_bits = _has_bits_[0];
 3182|      1|  if (cached_has_bits & 0x0000000fu) {
  ------------------
  |  Branch (3182:7): [True: 0, False: 1]
  ------------------
 3183|      0|    if (cached_has_bits & 0x00000001u) {
  ------------------
  |  Branch (3183:9): [True: 0, False: 0]
  ------------------
 3184|      0|      GOOGLE_DCHECK(trainer_spec_ != nullptr);
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3185|      0|      trainer_spec_->Clear();
 3186|      0|    }
 3187|      0|    if (cached_has_bits & 0x00000002u) {
  ------------------
  |  Branch (3187:9): [True: 0, False: 0]
  ------------------
 3188|      0|      GOOGLE_DCHECK(normalizer_spec_ != nullptr);
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3189|      0|      normalizer_spec_->Clear();
 3190|      0|    }
 3191|      0|    if (cached_has_bits & 0x00000004u) {
  ------------------
  |  Branch (3191:9): [True: 0, False: 0]
  ------------------
 3192|      0|      GOOGLE_DCHECK(self_test_data_ != nullptr);
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3193|      0|      self_test_data_->Clear();
 3194|      0|    }
 3195|      0|    if (cached_has_bits & 0x00000008u) {
  ------------------
  |  Branch (3195:9): [True: 0, False: 0]
  ------------------
 3196|      0|      GOOGLE_DCHECK(denormalizer_spec_ != nullptr);
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3197|      0|      denormalizer_spec_->Clear();
 3198|      0|    }
 3199|      0|  }
 3200|      1|  _has_bits_.Clear();
 3201|      1|  _internal_metadata_.Clear<std::string>();
 3202|      1|}
_ZN13sentencepiece10ModelProto14_InternalParseEPKcPN6google8protobuf8internal12ParseContextE:
 3204|      1|const char* ModelProto::_InternalParse(const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx) {
 3205|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
 3206|      1|  _Internal::HasBits has_bits{};
 3207|      4|  while (!ctx->Done(&ptr)) {
  ------------------
  |  Branch (3207:10): [True: 3, False: 1]
  ------------------
 3208|      3|    ::PROTOBUF_NAMESPACE_ID::uint32 tag;
 3209|      3|    ptr = ::PROTOBUF_NAMESPACE_ID::internal::ReadTag(ptr, &tag);
 3210|      3|    CHK_(ptr);
  ------------------
  |  | 3205|      3|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      3|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 3]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3211|      3|    switch (tag >> 3) {
 3212|       |      // repeated .sentencepiece.ModelProto.SentencePiece pieces = 1;
 3213|      1|      case 1:
  ------------------
  |  Branch (3213:7): [True: 1, False: 2]
  ------------------
 3214|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 10)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 3215|      1|          ptr -= 1;
 3216|    298|          do {
 3217|    298|            ptr += 1;
 3218|    298|            ptr = ctx->ParseMessage(_internal_add_pieces(), ptr);
 3219|    298|            CHK_(ptr);
  ------------------
  |  | 3205|    298|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|    298|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 298]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3220|    298|            if (!ctx->DataAvailable(ptr)) break;
  ------------------
  |  Branch (3220:17): [True: 0, False: 298]
  ------------------
 3221|    298|          } while (::PROTOBUF_NAMESPACE_ID::internal::ExpectTag<10>(ptr));
  ------------------
  |  Branch (3221:20): [True: 297, False: 1]
  ------------------
 3222|      1|        } else goto handle_unusual;
 3223|      1|        continue;
 3224|       |      // optional .sentencepiece.TrainerSpec trainer_spec = 2;
 3225|      1|      case 2:
  ------------------
  |  Branch (3225:7): [True: 1, False: 2]
  ------------------
 3226|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 18)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 3227|      1|          ptr = ctx->ParseMessage(_internal_mutable_trainer_spec(), ptr);
 3228|      1|          CHK_(ptr);
  ------------------
  |  | 3205|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3229|      1|        } else goto handle_unusual;
 3230|      1|        continue;
 3231|       |      // optional .sentencepiece.NormalizerSpec normalizer_spec = 3;
 3232|      1|      case 3:
  ------------------
  |  Branch (3232:7): [True: 1, False: 2]
  ------------------
 3233|      1|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 26)) {
  ------------------
  |  |  236|      1|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 3234|      1|          ptr = ctx->ParseMessage(_internal_mutable_normalizer_spec(), ptr);
 3235|      1|          CHK_(ptr);
  ------------------
  |  | 3205|      1|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3236|      1|        } else goto handle_unusual;
 3237|      1|        continue;
 3238|       |      // optional .sentencepiece.SelfTestData self_test_data = 4;
 3239|      1|      case 4:
  ------------------
  |  Branch (3239:7): [True: 0, False: 3]
  ------------------
 3240|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 34)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3241|      0|          ptr = ctx->ParseMessage(_internal_mutable_self_test_data(), ptr);
 3242|      0|          CHK_(ptr);
  ------------------
  |  | 3205|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3243|      0|        } else goto handle_unusual;
 3244|      0|        continue;
 3245|       |      // optional .sentencepiece.NormalizerSpec denormalizer_spec = 5;
 3246|      0|      case 5:
  ------------------
  |  Branch (3246:7): [True: 0, False: 3]
  ------------------
 3247|      0|        if (PROTOBUF_PREDICT_TRUE(static_cast<::PROTOBUF_NAMESPACE_ID::uint8>(tag) == 42)) {
  ------------------
  |  |  236|      0|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3248|      0|          ptr = ctx->ParseMessage(_internal_mutable_denormalizer_spec(), ptr);
 3249|      0|          CHK_(ptr);
  ------------------
  |  | 3205|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3250|      0|        } else goto handle_unusual;
 3251|      0|        continue;
 3252|      0|      default: {
  ------------------
  |  Branch (3252:7): [True: 0, False: 3]
  ------------------
 3253|      0|      handle_unusual:
 3254|      0|        if ((tag & 7) == 4 || tag == 0) {
  ------------------
  |  Branch (3254:13): [True: 0, False: 0]
  |  Branch (3254:31): [True: 0, False: 0]
  ------------------
 3255|      0|          ctx->SetLastTag(tag);
 3256|      0|          goto success;
 3257|      0|        }
 3258|      0|      if ((1600u <= tag)) {
  ------------------
  |  Branch (3258:11): [True: 0, False: 0]
  ------------------
 3259|      0|        ptr = _extensions_.ParseField(tag, ptr,
 3260|      0|            internal_default_instance(), &_internal_metadata_, ctx);
 3261|      0|        CHK_(ptr != nullptr);
  ------------------
  |  | 3205|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3262|      0|        continue;
 3263|      0|      }
 3264|      0|        ptr = UnknownFieldParse(tag,
 3265|      0|            _internal_metadata_.mutable_unknown_fields<std::string>(),
 3266|      0|            ptr, ctx);
 3267|      0|        CHK_(ptr != nullptr);
  ------------------
  |  | 3205|      0|#define CHK_(x) if (PROTOBUF_PREDICT_FALSE(!(x))) goto failure
  |  |  ------------------
  |  |  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 3268|      0|        continue;
 3269|      0|      }
 3270|      3|    }  // switch
 3271|      3|  }  // while
 3272|      1|success:
 3273|      1|  _has_bits_.Or(has_bits);
 3274|      1|  return ptr;
 3275|      0|failure:
 3276|      0|  ptr = nullptr;
 3277|      0|  goto success;
 3278|      1|#undef CHK_
 3279|      1|}
_ZNK13sentencepiece10ModelProto13IsInitializedEv:
 3435|      1|bool ModelProto::IsInitialized() const {
 3436|      1|  if (!_extensions_.IsInitialized()) {
  ------------------
  |  Branch (3436:7): [True: 0, False: 1]
  ------------------
 3437|      0|    return false;
 3438|      0|  }
 3439|       |
 3440|      1|  if (!::PROTOBUF_NAMESPACE_ID::internal::AllAreInitialized(pieces_)) return false;
  ------------------
  |  Branch (3440:7): [True: 0, False: 1]
  ------------------
 3441|      1|  if (_internal_has_trainer_spec()) {
  ------------------
  |  Branch (3441:7): [True: 1, False: 0]
  ------------------
 3442|      1|    if (!trainer_spec_->IsInitialized()) return false;
  ------------------
  |  Branch (3442:9): [True: 0, False: 1]
  ------------------
 3443|      1|  }
 3444|      1|  if (_internal_has_normalizer_spec()) {
  ------------------
  |  Branch (3444:7): [True: 1, False: 0]
  ------------------
 3445|      1|    if (!normalizer_spec_->IsInitialized()) return false;
  ------------------
  |  Branch (3445:9): [True: 0, False: 1]
  ------------------
 3446|      1|  }
 3447|      1|  if (_internal_has_self_test_data()) {
  ------------------
  |  Branch (3447:7): [True: 0, False: 1]
  ------------------
 3448|      0|    if (!self_test_data_->IsInitialized()) return false;
  ------------------
  |  Branch (3448:9): [True: 0, False: 0]
  ------------------
 3449|      0|  }
 3450|      1|  if (_internal_has_denormalizer_spec()) {
  ------------------
  |  Branch (3450:7): [True: 0, False: 1]
  ------------------
 3451|      0|    if (!denormalizer_spec_->IsInitialized()) return false;
  ------------------
  |  Branch (3451:9): [True: 0, False: 0]
  ------------------
 3452|      0|  }
 3453|      1|  return true;
 3454|      1|}
_ZN6google8protobuf5Arena18CreateMaybeMessageIN13sentencepiece11TrainerSpecEJEEEPT_PS1_DpOT0_:
 3478|      1|template<> PROTOBUF_NOINLINE ::sentencepiece::TrainerSpec* Arena::CreateMaybeMessage< ::sentencepiece::TrainerSpec >(Arena* arena) {
 3479|      1|  return Arena::CreateMessageInternal< ::sentencepiece::TrainerSpec >(arena);
 3480|      1|}
_ZN6google8protobuf5Arena18CreateMaybeMessageIN13sentencepiece14NormalizerSpecEJEEEPT_PS1_DpOT0_:
 3481|      1|template<> PROTOBUF_NOINLINE ::sentencepiece::NormalizerSpec* Arena::CreateMaybeMessage< ::sentencepiece::NormalizerSpec >(Arena* arena) {
 3482|      1|  return Arena::CreateMessageInternal< ::sentencepiece::NormalizerSpec >(arena);
 3483|      1|}
_ZN6google8protobuf5Arena18CreateMaybeMessageIN13sentencepiece24ModelProto_SentencePieceEJEEEPT_PS1_DpOT0_:
 3490|    298|template<> PROTOBUF_NOINLINE ::sentencepiece::ModelProto_SentencePiece* Arena::CreateMaybeMessage< ::sentencepiece::ModelProto_SentencePiece >(Arena* arena) {
 3491|    298|  return Arena::CreateMessageInternal< ::sentencepiece::ModelProto_SentencePiece >(arena);
 3492|    298|}
sentencepiece_model.pb.cc:_ZL61InitDefaultsscc_info_ModelProto_sentencepiece_5fmodel_2eprotov:
   45|      1|static void InitDefaultsscc_info_ModelProto_sentencepiece_5fmodel_2eproto() {
   46|      1|  GOOGLE_PROTOBUF_VERIFY_VERSION;
  ------------------
  |  |  118|      1|  ::google::protobuf::internal::VerifyVersion(                            \
  |  |  119|      1|    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |   85|      1|#define GOOGLE_PROTOBUF_VERSION 3014000
  |  |  ------------------
  |  |                   GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |  328|      1|#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 3014000
  |  |  ------------------
  |  |  120|       |    __FILE__)
  ------------------
   47|       |
   48|      1|  {
   49|      1|    void* ptr = &::sentencepiece::_ModelProto_default_instance_;
   50|      1|    new (ptr) ::sentencepiece::ModelProto();
   51|      1|    ::PROTOBUF_NAMESPACE_ID::internal::OnShutdownDestroyMessage(ptr);
   52|      1|  }
   53|      1|}
sentencepiece_model.pb.cc:_ZL75InitDefaultsscc_info_ModelProto_SentencePiece_sentencepiece_5fmodel_2eprotov:
   62|      1|static void InitDefaultsscc_info_ModelProto_SentencePiece_sentencepiece_5fmodel_2eproto() {
   63|      1|  GOOGLE_PROTOBUF_VERIFY_VERSION;
  ------------------
  |  |  118|      1|  ::google::protobuf::internal::VerifyVersion(                            \
  |  |  119|      1|    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |   85|      1|#define GOOGLE_PROTOBUF_VERSION 3014000
  |  |  ------------------
  |  |                   GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |  328|      1|#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 3014000
  |  |  ------------------
  |  |  120|       |    __FILE__)
  ------------------
   64|       |
   65|      1|  {
   66|      1|    void* ptr = &::sentencepiece::_ModelProto_SentencePiece_default_instance_;
   67|      1|    new (ptr) ::sentencepiece::ModelProto_SentencePiece();
   68|      1|    ::PROTOBUF_NAMESPACE_ID::internal::OnShutdownDestroyMessage(ptr);
   69|      1|  }
   70|      1|}
sentencepiece_model.pb.cc:_ZL65InitDefaultsscc_info_NormalizerSpec_sentencepiece_5fmodel_2eprotov:
   75|      1|static void InitDefaultsscc_info_NormalizerSpec_sentencepiece_5fmodel_2eproto() {
   76|      1|  GOOGLE_PROTOBUF_VERIFY_VERSION;
  ------------------
  |  |  118|      1|  ::google::protobuf::internal::VerifyVersion(                            \
  |  |  119|      1|    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |   85|      1|#define GOOGLE_PROTOBUF_VERSION 3014000
  |  |  ------------------
  |  |                   GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |  328|      1|#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 3014000
  |  |  ------------------
  |  |  120|       |    __FILE__)
  ------------------
   77|       |
   78|      1|  {
   79|      1|    void* ptr = &::sentencepiece::_NormalizerSpec_default_instance_;
   80|      1|    new (ptr) ::sentencepiece::NormalizerSpec();
   81|      1|    ::PROTOBUF_NAMESPACE_ID::internal::OnShutdownDestroyMessage(ptr);
   82|      1|  }
   83|      1|}
sentencepiece_model.pb.cc:_ZL63InitDefaultsscc_info_SelfTestData_sentencepiece_5fmodel_2eprotov:
   88|      1|static void InitDefaultsscc_info_SelfTestData_sentencepiece_5fmodel_2eproto() {
   89|      1|  GOOGLE_PROTOBUF_VERIFY_VERSION;
  ------------------
  |  |  118|      1|  ::google::protobuf::internal::VerifyVersion(                            \
  |  |  119|      1|    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |   85|      1|#define GOOGLE_PROTOBUF_VERSION 3014000
  |  |  ------------------
  |  |                   GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |  328|      1|#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 3014000
  |  |  ------------------
  |  |  120|       |    __FILE__)
  ------------------
   90|       |
   91|      1|  {
   92|      1|    void* ptr = &::sentencepiece::_SelfTestData_default_instance_;
   93|      1|    new (ptr) ::sentencepiece::SelfTestData();
   94|      1|    ::PROTOBUF_NAMESPACE_ID::internal::OnShutdownDestroyMessage(ptr);
   95|      1|  }
   96|      1|}
sentencepiece_model.pb.cc:_ZL70InitDefaultsscc_info_SelfTestData_Sample_sentencepiece_5fmodel_2eprotov:
  102|      1|static void InitDefaultsscc_info_SelfTestData_Sample_sentencepiece_5fmodel_2eproto() {
  103|      1|  GOOGLE_PROTOBUF_VERIFY_VERSION;
  ------------------
  |  |  118|      1|  ::google::protobuf::internal::VerifyVersion(                            \
  |  |  119|      1|    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |   85|      1|#define GOOGLE_PROTOBUF_VERSION 3014000
  |  |  ------------------
  |  |                   GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |  328|      1|#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 3014000
  |  |  ------------------
  |  |  120|       |    __FILE__)
  ------------------
  104|       |
  105|      1|  {
  106|      1|    void* ptr = &::sentencepiece::_SelfTestData_Sample_default_instance_;
  107|      1|    new (ptr) ::sentencepiece::SelfTestData_Sample();
  108|      1|    ::PROTOBUF_NAMESPACE_ID::internal::OnShutdownDestroyMessage(ptr);
  109|      1|  }
  110|      1|}
sentencepiece_model.pb.cc:_ZL62InitDefaultsscc_info_TrainerSpec_sentencepiece_5fmodel_2eprotov:
  115|      1|static void InitDefaultsscc_info_TrainerSpec_sentencepiece_5fmodel_2eproto() {
  116|      1|  GOOGLE_PROTOBUF_VERIFY_VERSION;
  ------------------
  |  |  118|      1|  ::google::protobuf::internal::VerifyVersion(                            \
  |  |  119|      1|    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |   85|      1|#define GOOGLE_PROTOBUF_VERSION 3014000
  |  |  ------------------
  |  |                   GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
  |  |  ------------------
  |  |  |  |  328|      1|#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 3014000
  |  |  ------------------
  |  |  120|       |    __FILE__)
  ------------------
  117|       |
  118|      1|  {
  119|      1|    void* ptr = &::sentencepiece::_TrainerSpec_default_instance_;
  120|      1|    new (ptr) ::sentencepiece::TrainerSpec();
  121|      1|    ::PROTOBUF_NAMESPACE_ID::internal::OnShutdownDestroyMessage(ptr);
  122|      1|  }
  123|      1|}
_ZN13sentencepiece11TrainerSpec10SharedCtorEv:
  490|      2|void TrainerSpec::SharedCtor() {
  491|      2|  ::PROTOBUF_NAMESPACE_ID::internal::InitSCC(&scc_info_TrainerSpec_sentencepiece_5fmodel_2eproto.base);
  492|      2|  model_prefix_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
  493|      2|  input_format_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
  494|      2|  required_chars_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
  495|      2|  unk_surface_.UnsafeSetDefault(nullptr);
  496|      2|  unk_piece_.UnsafeSetDefault(nullptr);
  497|      2|  bos_piece_.UnsafeSetDefault(nullptr);
  498|      2|  eos_piece_.UnsafeSetDefault(nullptr);
  499|      2|  pad_piece_.UnsafeSetDefault(nullptr);
  500|      2|  pretokenization_delimiter_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
  501|      2|  seed_sentencepieces_file_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
  502|      2|  ::memset(reinterpret_cast<char*>(this) + static_cast<size_t>(
  503|      2|      reinterpret_cast<char*>(&self_test_sample_size_) - reinterpret_cast<char*>(this)),
  504|      2|      0, static_cast<size_t>(reinterpret_cast<char*>(&differential_privacy_clipping_threshold_) -
  505|      2|      reinterpret_cast<char*>(&self_test_sample_size_)) + sizeof(differential_privacy_clipping_threshold_));
  506|      2|  model_type_ = 1;
  507|      2|  vocab_size_ = 8000;
  508|      2|  character_coverage_ = 0.9995f;
  509|      2|  seed_sentencepiece_size_ = 1000000;
  510|      2|  shrinking_factor_ = 0.75f;
  511|      2|  num_threads_ = 16;
  512|      2|  num_sub_iterations_ = 2;
  513|      2|  max_sentence_length_ = 4192;
  514|      2|  max_sentencepiece_length_ = 16;
  515|      2|  shuffle_input_sentence_ = true;
  516|      2|  split_by_unicode_script_ = true;
  517|      2|  split_by_number_ = true;
  518|      2|  split_by_whitespace_ = true;
  519|      2|  vocabulary_output_piece_score_ = true;
  520|      2|  hard_vocab_limit_ = true;
  521|      2|  bos_id_ = 1;
  522|      2|  eos_id_ = 2;
  523|      2|  pad_id_ = -1;
  524|      2|}
_ZN13sentencepiece11TrainerSpec17RegisterArenaDtorEPN6google8protobuf5ArenaE:
  550|      2|void TrainerSpec::RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena*) {
  551|      2|}
_ZN13sentencepiece11TrainerSpec9_Internal18set_has_vocab_sizeEPN6google8protobuf8internal7HasBitsILm2EEE:
  290|      1|  static void set_has_vocab_size(HasBits* has_bits) {
  291|      1|    (*has_bits)[0] |= 33554432u;
  292|      1|  }
_ZN13sentencepiece11TrainerSpec9_Internal21set_has_byte_fallbackEPN6google8protobuf8internal7HasBitsILm2EEE:
  362|      1|  static void set_has_byte_fallback(HasBits* has_bits) {
  363|      1|    (*has_bits)[0] |= 262144u;
  364|      1|  }
_ZN13sentencepiece14NormalizerSpec10SharedCtorEv:
 1989|      2|void NormalizerSpec::SharedCtor() {
 1990|      2|  ::PROTOBUF_NAMESPACE_ID::internal::InitSCC(&scc_info_NormalizerSpec_sentencepiece_5fmodel_2eproto.base);
 1991|      2|  name_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
 1992|      2|  precompiled_charsmap_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
 1993|      2|  normalization_rule_tsv_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
 1994|      2|  add_dummy_prefix_ = true;
 1995|      2|  remove_extra_whitespaces_ = true;
 1996|      2|  escape_whitespaces_ = true;
 1997|      2|}
_ZN13sentencepiece14NormalizerSpec17RegisterArenaDtorEPN6google8protobuf5ArenaE:
 2016|      2|void NormalizerSpec::RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena*) {
 2017|      2|}
_ZN13sentencepiece14NormalizerSpec9_Internal24set_has_add_dummy_prefixEPN6google8protobuf8internal7HasBitsILm1EEE:
 1942|      1|  static void set_has_add_dummy_prefix(HasBits* has_bits) {
 1943|      1|    (*has_bits)[0] |= 8u;
 1944|      1|  }
_ZN13sentencepiece14NormalizerSpec9_Internal32set_has_remove_extra_whitespacesEPN6google8protobuf8internal7HasBitsILm1EEE:
 1945|      1|  static void set_has_remove_extra_whitespaces(HasBits* has_bits) {
 1946|      1|    (*has_bits)[0] |= 16u;
 1947|      1|  }
_ZN13sentencepiece14NormalizerSpec9_Internal26set_has_escape_whitespacesEPN6google8protobuf8internal7HasBitsILm1EEE:
 1948|      1|  static void set_has_escape_whitespaces(HasBits* has_bits) {
 1949|      1|    (*has_bits)[0] |= 32u;
 1950|      1|  }
_ZN13sentencepiece19SelfTestData_Sample10SharedCtorEv:
 2357|      1|void SelfTestData_Sample::SharedCtor() {
 2358|      1|  ::PROTOBUF_NAMESPACE_ID::internal::InitSCC(&scc_info_SelfTestData_Sample_sentencepiece_5fmodel_2eproto.base);
 2359|      1|  input_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
 2360|      1|  expected_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
 2361|      1|}
_ZN13sentencepiece19SelfTestData_Sample17RegisterArenaDtorEPN6google8protobuf5ArenaE:
 2379|      1|void SelfTestData_Sample::RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena*) {
 2380|      1|}
_ZN13sentencepiece12SelfTestData10SharedCtorEv:
 2586|      1|void SelfTestData::SharedCtor() {
 2587|      1|  ::PROTOBUF_NAMESPACE_ID::internal::InitSCC(&scc_info_SelfTestData_sentencepiece_5fmodel_2eproto.base);
 2588|      1|}
_ZN13sentencepiece12SelfTestData17RegisterArenaDtorEPN6google8protobuf5ArenaE:
 2604|      1|void SelfTestData::RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena*) {
 2605|      1|}
_ZN13sentencepiece24ModelProto_SentencePiece10SharedCtorEv:
 2807|    299|void ModelProto_SentencePiece::SharedCtor() {
 2808|    299|  ::PROTOBUF_NAMESPACE_ID::internal::InitSCC(&scc_info_ModelProto_SentencePiece_sentencepiece_5fmodel_2eproto.base);
 2809|    299|  piece_.UnsafeSetDefault(&::PROTOBUF_NAMESPACE_ID::internal::GetEmptyStringAlreadyInited());
 2810|    299|  score_ = 0;
 2811|    299|  type_ = 1;
 2812|    299|}
_ZN13sentencepiece24ModelProto_SentencePiece17RegisterArenaDtorEPN6google8protobuf5ArenaE:
 2829|    299|void ModelProto_SentencePiece::RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena*) {
 2830|    299|}
_ZN13sentencepiece24ModelProto_SentencePiece9_Internal13set_has_scoreEPN6google8protobuf8internal7HasBitsILm1EEE:
 2776|    298|  static void set_has_score(HasBits* has_bits) {
 2777|    298|    (*has_bits)[0] |= 2u;
 2778|    298|  }
_ZN13sentencepiece10ModelProto10SharedCtorEv:
 3136|      2|void ModelProto::SharedCtor() {
 3137|      2|  ::PROTOBUF_NAMESPACE_ID::internal::InitSCC(&scc_info_ModelProto_sentencepiece_5fmodel_2eproto.base);
 3138|      2|  ::memset(reinterpret_cast<char*>(this) + static_cast<size_t>(
 3139|      2|      reinterpret_cast<char*>(&trainer_spec_) - reinterpret_cast<char*>(this)),
 3140|      2|      0, static_cast<size_t>(reinterpret_cast<char*>(&denormalizer_spec_) -
 3141|      2|      reinterpret_cast<char*>(&trainer_spec_)) + sizeof(denormalizer_spec_));
 3142|      2|}
_ZN13sentencepiece10ModelProto17RegisterArenaDtorEPN6google8protobuf5ArenaE:
 3162|      2|void ModelProto::RegisterArenaDtor(::PROTOBUF_NAMESPACE_ID::Arena*) {
 3163|      2|}

_ZNK13sentencepiece10ModelProto15normalizer_specEv:
 4771|      1|inline const ::sentencepiece::NormalizerSpec& ModelProto::normalizer_spec() const {
 4772|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.normalizer_spec)
 4773|      1|  return _internal_normalizer_spec();
 4774|      1|}
_ZNK13sentencepiece10ModelProto25_internal_normalizer_specEv:
 4766|      1|inline const ::sentencepiece::NormalizerSpec& ModelProto::_internal_normalizer_spec() const {
 4767|      1|  const ::sentencepiece::NormalizerSpec* p = normalizer_spec_;
 4768|      1|  return p != nullptr ? *p : reinterpret_cast<const ::sentencepiece::NormalizerSpec&>(
  ------------------
  |  Branch (4768:10): [True: 1, False: 0]
  ------------------
 4769|      0|      ::sentencepiece::_NormalizerSpec_default_instance_);
 4770|      1|}
_ZNK13sentencepiece10ModelProto12trainer_specEv:
 4688|    267|inline const ::sentencepiece::TrainerSpec& ModelProto::trainer_spec() const {
 4689|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.trainer_spec)
 4690|    267|  return _internal_trainer_spec();
 4691|    267|}
_ZNK13sentencepiece10ModelProto22_internal_trainer_specEv:
 4683|    267|inline const ::sentencepiece::TrainerSpec& ModelProto::_internal_trainer_spec() const {
 4684|    267|  const ::sentencepiece::TrainerSpec* p = trainer_spec_;
 4685|    267|  return p != nullptr ? *p : reinterpret_cast<const ::sentencepiece::TrainerSpec&>(
  ------------------
  |  Branch (4685:10): [True: 267, False: 0]
  ------------------
 4686|      0|      ::sentencepiece::_TrainerSpec_default_instance_);
 4687|    267|}
_ZNK13sentencepiece10ModelProto21has_denormalizer_specEv:
 4925|      1|inline bool ModelProto::has_denormalizer_spec() const {
 4926|      1|  return _internal_has_denormalizer_spec();
 4927|      1|}
_ZNK13sentencepiece10ModelProto31_internal_has_denormalizer_specEv:
 4920|      2|inline bool ModelProto::_internal_has_denormalizer_spec() const {
 4921|      2|  bool value = (_has_bits_[0] & 0x00000008u) != 0;
 4922|      2|  PROTOBUF_ASSUME(!value || denormalizer_spec_ != nullptr);
  ------------------
  |  |  493|      2|  GOOGLE_DCHECK(pred);               \
  |  |  ------------------
  |  |  |  |  181|      2|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 2]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  494|      2|  __builtin_assume(pred)
  |  |  ------------------
  |  |  |  Branch (494:20): [True: 2, False: 0]
  |  |  |  Branch (494:20): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 4923|      2|  return value;
 4924|      2|}
_ZNK13sentencepiece14NormalizerSpec20precompiled_charsmapEv:
 4082|      1|inline const std::string& NormalizerSpec::precompiled_charsmap() const {
 4083|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.precompiled_charsmap)
 4084|      1|  return _internal_precompiled_charsmap();
 4085|      1|}
_ZNK13sentencepiece14NormalizerSpec30_internal_precompiled_charsmapEv:
 4094|      1|inline const std::string& NormalizerSpec::_internal_precompiled_charsmap() const {
 4095|      1|  return precompiled_charsmap_.Get();
 4096|      1|}
_ZNK13sentencepiece10ModelProto14self_test_dataEv:
 4854|      1|inline const ::sentencepiece::SelfTestData& ModelProto::self_test_data() const {
 4855|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.self_test_data)
 4856|      1|  return _internal_self_test_data();
 4857|      1|}
_ZNK13sentencepiece10ModelProto24_internal_self_test_dataEv:
 4849|      1|inline const ::sentencepiece::SelfTestData& ModelProto::_internal_self_test_data() const {
 4850|      1|  const ::sentencepiece::SelfTestData* p = self_test_data_;
 4851|      1|  return p != nullptr ? *p : reinterpret_cast<const ::sentencepiece::SelfTestData&>(
  ------------------
  |  Branch (4851:10): [True: 0, False: 1]
  ------------------
 4852|      1|      ::sentencepiece::_SelfTestData_default_instance_);
 4853|      1|}
_ZNK13sentencepiece12SelfTestData7samplesEv:
 4488|      1|SelfTestData::samples() const {
 4489|       |  // @@protoc_insertion_point(field_list:sentencepiece.SelfTestData.samples)
 4490|      1|  return samples_;
 4491|      1|}
_ZNK13sentencepiece11TrainerSpec10model_typeEv:
 2300|      1|inline ::sentencepiece::TrainerSpec_ModelType TrainerSpec::model_type() const {
 2301|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.model_type)
 2302|      1|  return _internal_model_type();
 2303|      1|}
_ZNK13sentencepiece11TrainerSpec20_internal_model_typeEv:
 2297|      1|inline ::sentencepiece::TrainerSpec_ModelType TrainerSpec::_internal_model_type() const {
 2298|      1|  return static_cast< ::sentencepiece::TrainerSpec_ModelType >(model_type_);
 2299|      1|}
_ZNK13sentencepiece10ModelProto11pieces_sizeEv:
 4635|    598|inline int ModelProto::pieces_size() const {
 4636|    598|  return _internal_pieces_size();
 4637|    598|}
_ZNK13sentencepiece10ModelProto21_internal_pieces_sizeEv:
 4632|    598|inline int ModelProto::_internal_pieces_size() const {
 4633|    598|  return pieces_.size();
 4634|    598|}
_ZNK13sentencepiece24ModelProto_SentencePiece4typeEv:
 4613|  2.82k|inline ::sentencepiece::ModelProto_SentencePiece_Type ModelProto_SentencePiece::type() const {
 4614|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.type)
 4615|  2.82k|  return _internal_type();
 4616|  2.82k|}
_ZNK13sentencepiece24ModelProto_SentencePiece14_internal_typeEv:
 4610|  2.82k|inline ::sentencepiece::ModelProto_SentencePiece_Type ModelProto_SentencePiece::_internal_type() const {
 4611|  2.82k|  return static_cast< ::sentencepiece::ModelProto_SentencePiece_Type >(type_);
 4612|  2.82k|}
_ZNK13sentencepiece24ModelProto_SentencePiece5pieceEv:
 4509|  1.44k|inline const std::string& ModelProto_SentencePiece::piece() const {
 4510|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.piece)
 4511|  1.44k|  return _internal_piece();
 4512|  1.44k|}
_ZNK13sentencepiece24ModelProto_SentencePiece15_internal_pieceEv:
 4521|  1.44k|inline const std::string& ModelProto_SentencePiece::_internal_piece() const {
 4522|  1.44k|  return piece_.Get();
 4523|  1.44k|}
_ZN13sentencepiece24ModelProto_SentencePiece18_internal_set_typeENS_29ModelProto_SentencePiece_TypeE:
 4617|    259|inline void ModelProto_SentencePiece::_internal_set_type(::sentencepiece::ModelProto_SentencePiece_Type value) {
 4618|       |  assert(::sentencepiece::ModelProto_SentencePiece_Type_IsValid(value));
 4619|    259|  _has_bits_[0] |= 0x00000004u;
 4620|    259|  type_ = value;
 4621|    259|}
_ZN13sentencepiece10ModelProto33_internal_mutable_normalizer_specEv:
 4804|      1|inline ::sentencepiece::NormalizerSpec* ModelProto::_internal_mutable_normalizer_spec() {
 4805|      1|  _has_bits_[0] |= 0x00000002u;
 4806|      1|  if (normalizer_spec_ == nullptr) {
  ------------------
  |  Branch (4806:7): [True: 1, False: 0]
  ------------------
 4807|      1|    auto* p = CreateMaybeMessage<::sentencepiece::NormalizerSpec>(GetArena());
 4808|      1|    normalizer_spec_ = p;
 4809|      1|  }
 4810|      1|  return normalizer_spec_;
 4811|      1|}
_ZN13sentencepiece10ModelProtoC2Ev:
 1836|      2|  inline ModelProto() : ModelProto(nullptr) {}
_ZN13sentencepiece11TrainerSpecC2Ev:
  133|      2|  inline TrainerSpec() : TrainerSpec(nullptr) {}
_ZN13sentencepiece14NormalizerSpecC2Ev:
 1093|      2|  inline NormalizerSpec() : NormalizerSpec(nullptr) {}
_ZN13sentencepiece19SelfTestData_SampleC2Ev:
 1325|      1|  inline SelfTestData_Sample() : SelfTestData_Sample(nullptr) {}
_ZN13sentencepiece12SelfTestDataC2Ev:
 1487|      1|  inline SelfTestData() : SelfTestData(nullptr) {}
_ZN13sentencepiece24ModelProto_SentencePieceC2Ev:
 1629|    299|  inline ModelProto_SentencePiece() : ModelProto_SentencePiece(nullptr) {}
_ZN13sentencepiece11TrainerSpec24_internal_set_model_typeENS_21TrainerSpec_ModelTypeE:
 2304|      1|inline void TrainerSpec::_internal_set_model_type(::sentencepiece::TrainerSpec_ModelType value) {
 2305|       |  assert(::sentencepiece::TrainerSpec_ModelType_IsValid(value));
 2306|      1|  _has_bits_[0] |= 0x01000000u;
 2307|      1|  model_type_ = value;
 2308|      1|}
_ZNK13sentencepiece11TrainerSpec36_internal_treat_whitespace_as_suffixEv:
 2932|      1|inline bool TrainerSpec::_internal_treat_whitespace_as_suffix() const {
 2933|      1|  return treat_whitespace_as_suffix_;
 2934|      1|}
_ZNK13sentencepiece11TrainerSpec26treat_whitespace_as_suffixEv:
 2935|      1|inline bool TrainerSpec::treat_whitespace_as_suffix() const {
 2936|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.treat_whitespace_as_suffix)
 2937|      1|  return _internal_treat_whitespace_as_suffix();
 2938|      1|}
_ZNK13sentencepiece11TrainerSpec23_internal_byte_fallbackEv:
 3310|    257|inline bool TrainerSpec::_internal_byte_fallback() const {
 3311|    257|  return byte_fallback_;
 3312|    257|}
_ZNK13sentencepiece11TrainerSpec13byte_fallbackEv:
 3313|    257|inline bool TrainerSpec::byte_fallback() const {
 3314|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.byte_fallback)
 3315|    257|  return _internal_byte_fallback();
 3316|    257|}
_ZNK13sentencepiece11TrainerSpec9unk_pieceEv:
 3534|      2|inline const std::string& TrainerSpec::unk_piece() const {
 3535|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.unk_piece)
 3536|      2|  if (unk_piece_.IsDefault(nullptr)) return _i_give_permission_to_break_this_code_default_unk_piece_.get();
  ------------------
  |  Branch (3536:7): [True: 2, False: 0]
  ------------------
 3537|      0|  return _internal_unk_piece();
 3538|      2|}
_ZNK13sentencepiece11TrainerSpec9bos_pieceEv:
 3608|      2|inline const std::string& TrainerSpec::bos_piece() const {
 3609|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.bos_piece)
 3610|      2|  if (bos_piece_.IsDefault(nullptr)) return _i_give_permission_to_break_this_code_default_bos_piece_.get();
  ------------------
  |  Branch (3610:7): [True: 2, False: 0]
  ------------------
 3611|      0|  return _internal_bos_piece();
 3612|      2|}
_ZNK13sentencepiece11TrainerSpec9eos_pieceEv:
 3682|      2|inline const std::string& TrainerSpec::eos_piece() const {
 3683|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.eos_piece)
 3684|      2|  if (eos_piece_.IsDefault(nullptr)) return _i_give_permission_to_break_this_code_default_eos_piece_.get();
  ------------------
  |  Branch (3684:7): [True: 2, False: 0]
  ------------------
 3685|      0|  return _internal_eos_piece();
 3686|      2|}
_ZNK13sentencepiece11TrainerSpec9pad_pieceEv:
 3756|      2|inline const std::string& TrainerSpec::pad_piece() const {
 3757|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.pad_piece)
 3758|      2|  if (pad_piece_.IsDefault(nullptr)) return _i_give_permission_to_break_this_code_default_pad_piece_.get();
  ------------------
  |  Branch (3758:7): [True: 2, False: 0]
  ------------------
 3759|      0|  return _internal_pad_piece();
 3760|      2|}
_ZN13sentencepiece24ModelProto_SentencePiece23_internal_mutable_pieceEv:
 4547|    298|inline std::string* ModelProto_SentencePiece::_internal_mutable_piece() {
 4548|    298|  _has_bits_[0] |= 0x00000001u;
 4549|    298|  return piece_.Mutable(::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr::EmptyDefault{}, GetArena());
 4550|    298|}
_ZNK13sentencepiece24ModelProto_SentencePiece15_internal_scoreEv:
 4582|     39|inline float ModelProto_SentencePiece::_internal_score() const {
 4583|     39|  return score_;
 4584|     39|}
_ZNK13sentencepiece24ModelProto_SentencePiece5scoreEv:
 4585|     39|inline float ModelProto_SentencePiece::score() const {
 4586|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.score)
 4587|     39|  return _internal_score();
 4588|     39|}
_ZNK13sentencepiece10ModelProto16_internal_piecesEi:
 4650|    600|inline const ::sentencepiece::ModelProto_SentencePiece& ModelProto::_internal_pieces(int index) const {
 4651|    600|  return pieces_.Get(index);
 4652|    600|}
_ZNK13sentencepiece10ModelProto6piecesEi:
 4653|    600|inline const ::sentencepiece::ModelProto_SentencePiece& ModelProto::pieces(int index) const {
 4654|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.pieces)
 4655|    600|  return _internal_pieces(index);
 4656|    600|}
_ZN13sentencepiece10ModelProto20_internal_add_piecesEv:
 4657|    298|inline ::sentencepiece::ModelProto_SentencePiece* ModelProto::_internal_add_pieces() {
 4658|    298|  return pieces_.Add();
 4659|    298|}
_ZNK13sentencepiece10ModelProto6piecesEv:
 4665|      1|ModelProto::pieces() const {
 4666|       |  // @@protoc_insertion_point(field_list:sentencepiece.ModelProto.pieces)
 4667|      1|  return pieces_;
 4668|      1|}
_ZNK13sentencepiece10ModelProto26_internal_has_trainer_specEv:
 4671|      1|inline bool ModelProto::_internal_has_trainer_spec() const {
 4672|      1|  bool value = (_has_bits_[0] & 0x00000001u) != 0;
 4673|      1|  PROTOBUF_ASSUME(!value || trainer_spec_ != nullptr);
  ------------------
  |  |  493|      1|  GOOGLE_DCHECK(pred);               \
  |  |  ------------------
  |  |  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  494|      2|  __builtin_assume(pred)
  |  |  ------------------
  |  |  |  Branch (494:20): [True: 0, False: 1]
  |  |  |  Branch (494:20): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 4674|      1|  return value;
 4675|      1|}
_ZN13sentencepiece10ModelProto30_internal_mutable_trainer_specEv:
 4721|      1|inline ::sentencepiece::TrainerSpec* ModelProto::_internal_mutable_trainer_spec() {
 4722|      1|  _has_bits_[0] |= 0x00000001u;
 4723|      1|  if (trainer_spec_ == nullptr) {
  ------------------
  |  Branch (4723:7): [True: 1, False: 0]
  ------------------
 4724|      1|    auto* p = CreateMaybeMessage<::sentencepiece::TrainerSpec>(GetArena());
 4725|      1|    trainer_spec_ = p;
 4726|      1|  }
 4727|      1|  return trainer_spec_;
 4728|      1|}
_ZNK13sentencepiece10ModelProto29_internal_has_normalizer_specEv:
 4754|      1|inline bool ModelProto::_internal_has_normalizer_spec() const {
 4755|      1|  bool value = (_has_bits_[0] & 0x00000002u) != 0;
 4756|      1|  PROTOBUF_ASSUME(!value || normalizer_spec_ != nullptr);
  ------------------
  |  |  493|      1|  GOOGLE_DCHECK(pred);               \
  |  |  ------------------
  |  |  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  494|      2|  __builtin_assume(pred)
  |  |  ------------------
  |  |  |  Branch (494:20): [True: 0, False: 1]
  |  |  |  Branch (494:20): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 4757|      1|  return value;
 4758|      1|}
_ZNK13sentencepiece10ModelProto28_internal_has_self_test_dataEv:
 4837|      1|inline bool ModelProto::_internal_has_self_test_data() const {
 4838|      1|  bool value = (_has_bits_[0] & 0x00000004u) != 0;
 4839|      1|  PROTOBUF_ASSUME(!value || self_test_data_ != nullptr);
  ------------------
  |  |  493|      1|  GOOGLE_DCHECK(pred);               \
  |  |  ------------------
  |  |  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  494|      1|  __builtin_assume(pred)
  |  |  ------------------
  |  |  |  Branch (494:20): [True: 1, False: 0]
  |  |  |  Branch (494:20): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 4840|      1|  return value;
 4841|      1|}

_ZN13sentencepiece12ModelFactory6CreateERKNS_10ModelProtoE:
   26|      1|    const ModelProto& model_proto) {
   27|      1|  const auto& trainer_spec = model_proto.trainer_spec();
   28|       |
   29|      1|  switch (trainer_spec.model_type()) {
   30|      1|    case TrainerSpec::UNIGRAM:
  ------------------
  |  Branch (30:5): [True: 1, False: 0]
  ------------------
   31|      1|      return std::make_unique<unigram::Model>(model_proto);
   32|      0|      break;
   33|      0|    case TrainerSpec::BPE:
  ------------------
  |  Branch (33:5): [True: 0, False: 1]
  ------------------
   34|      0|      return std::make_unique<bpe::Model>(model_proto);
   35|      0|      break;
   36|      0|    case TrainerSpec::WORD:
  ------------------
  |  Branch (36:5): [True: 0, False: 1]
  ------------------
   37|      0|      return std::make_unique<word::Model>(model_proto);
   38|      0|      break;
   39|      0|    case TrainerSpec::CHAR:
  ------------------
  |  Branch (39:5): [True: 0, False: 1]
  ------------------
   40|      0|      return std::make_unique<character::Model>(model_proto);
   41|      0|      break;
   42|      0|    default:
  ------------------
  |  Branch (42:5): [True: 0, False: 1]
  ------------------
   43|      0|      LOG(ERROR) << "Unknown model_type: " << trainer_spec.model_type();
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  176|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |   64|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::ErrorTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   44|      0|      return nullptr;
   45|      0|      break;
   46|      1|  }
   47|       |
   48|      0|  return std::make_unique<unigram::Model>(model_proto);
   49|      1|}

_ZNK13sentencepiece14ModelInterface9unk_pieceEv:
   35|      1|absl::string_view ModelInterface::unk_piece() const {
   36|      1|  RETURN_PIECE(unk_piece, "<unk>");
  ------------------
  |  |   32|      1|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (32:7): [True: 0, False: 1]
  |  |  ------------------
  |  |   33|      1|  return model_proto_->trainer_spec().name();
  ------------------
   37|      0|}
_ZNK13sentencepiece14ModelInterface9bos_pieceEv:
   39|      1|absl::string_view ModelInterface::bos_piece() const {
   40|      1|  RETURN_PIECE(bos_piece, "<s>");
  ------------------
  |  |   32|      1|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (32:7): [True: 0, False: 1]
  |  |  ------------------
  |  |   33|      1|  return model_proto_->trainer_spec().name();
  ------------------
   41|      0|}
_ZNK13sentencepiece14ModelInterface9eos_pieceEv:
   43|      1|absl::string_view ModelInterface::eos_piece() const {
   44|      1|  RETURN_PIECE(eos_piece, "</s>");
  ------------------
  |  |   32|      1|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (32:7): [True: 0, False: 1]
  |  |  ------------------
  |  |   33|      1|  return model_proto_->trainer_spec().name();
  ------------------
   45|      0|}
_ZNK13sentencepiece14ModelInterface9pad_pieceEv:
   47|      1|absl::string_view ModelInterface::pad_piece() const {
   48|      1|  RETURN_PIECE(pad_piece, "<pad>");
  ------------------
  |  |   32|      1|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (32:7): [True: 0, False: 1]
  |  |  ------------------
  |  |   33|      1|  return model_proto_->trainer_spec().name();
  ------------------
   49|      0|}
_ZN13sentencepiece14ModelInterface16InitializePiecesEv:
   67|      1|void ModelInterface::InitializePieces() {
   68|      1|  pieces_.clear();
   69|      1|  reserved_id_map_.clear();
   70|      1|  unk_id_ = -1;
   71|       |
   72|      1|  std::set<absl::string_view> user_defined_symbols;
   73|      1|  std::vector<bool> byte_found(256, false);
   74|       |
   75|      1|  int pieces_size = 0;
   76|      1|  int reserved_id_map_size = 0;
   77|    299|  for (int i = 0; i < model_proto_->pieces_size(); ++i) {
  ------------------
  |  Branch (77:19): [True: 298, False: 1]
  ------------------
   78|    298|    const auto& sp = model_proto_->pieces(i);
   79|    298|    static constexpr size_t kMaxPieceSize = 8000;
   80|    298|    if (sp.piece().size() >= kMaxPieceSize) {
  ------------------
  |  Branch (80:9): [True: 0, False: 298]
  ------------------
   81|      0|      status_ = absl::InternalError("piece is too long.");
   82|      0|      return;
   83|      0|    }
   84|    298|    const bool is_normal_piece =
   85|    298|        (sp.type() == ModelProto::SentencePiece::NORMAL ||
  ------------------
  |  Branch (85:10): [True: 39, False: 259]
  ------------------
   86|    259|         sp.type() == ModelProto::SentencePiece::USER_DEFINED ||
  ------------------
  |  Branch (86:10): [True: 0, False: 259]
  ------------------
   87|    259|         sp.type() == ModelProto::SentencePiece::UNUSED);
  ------------------
  |  Branch (87:10): [True: 0, False: 259]
  ------------------
   88|    298|    if (is_normal_piece) {
  ------------------
  |  Branch (88:9): [True: 39, False: 259]
  ------------------
   89|     39|      ++pieces_size;
   90|    259|    } else {
   91|    259|      ++reserved_id_map_size;
   92|    259|    }
   93|    298|  }
   94|      1|  pieces_.reserve(pieces_size);
   95|      1|  reserved_id_map_.reserve(reserved_id_map_size);
   96|       |
   97|    299|  for (int i = 0; i < model_proto_->pieces_size(); ++i) {
  ------------------
  |  Branch (97:19): [True: 298, False: 1]
  ------------------
   98|    298|    const auto& sp = model_proto_->pieces(i);
   99|    298|    if (sp.piece().empty()) {
  ------------------
  |  Branch (99:9): [True: 0, False: 298]
  ------------------
  100|      0|      status_ = absl::InternalError("piece must not be empty.");
  101|      0|      return;
  102|      0|    }
  103|    298|    if (sp.piece().find('\0') != absl::string_view::npos) {
  ------------------
  |  Branch (103:9): [True: 0, False: 298]
  ------------------
  104|      0|      status_ = absl::InternalError("piece must not include null character.");
  105|      0|      return;
  106|      0|    }
  107|    298|    const bool is_normal_piece =
  108|    298|        (sp.type() == ModelProto::SentencePiece::NORMAL ||
  ------------------
  |  Branch (108:10): [True: 39, False: 259]
  ------------------
  109|    259|         sp.type() == ModelProto::SentencePiece::USER_DEFINED ||
  ------------------
  |  Branch (109:10): [True: 0, False: 259]
  ------------------
  110|    259|         sp.type() == ModelProto::SentencePiece::UNUSED);
  ------------------
  |  Branch (110:10): [True: 0, False: 259]
  ------------------
  111|    298|    if (!port::InsertIfNotPresent(
  ------------------
  |  Branch (111:9): [True: 0, False: 298]
  ------------------
  112|    298|            is_normal_piece ? &pieces_ : &reserved_id_map_, sp.piece(), i)) {
  ------------------
  |  Branch (112:13): [True: 39, False: 259]
  ------------------
  113|      0|      status_ = absl::InternalError(
  114|      0|          absl::StrCat(sp.piece(), " is already defined."));
  115|      0|      return;
  116|      0|    }
  117|       |
  118|    298|    if (sp.type() == ModelProto::SentencePiece::USER_DEFINED) {
  ------------------
  |  Branch (118:9): [True: 0, False: 298]
  ------------------
  119|      0|      user_defined_symbols.insert(sp.piece());
  120|      0|    }
  121|       |
  122|    298|    if (sp.type() == ModelProto::SentencePiece::UNKNOWN) {
  ------------------
  |  Branch (122:9): [True: 1, False: 297]
  ------------------
  123|      1|      if (unk_id_ >= 0) {
  ------------------
  |  Branch (123:11): [True: 0, False: 1]
  ------------------
  124|      0|        status_ = absl::InternalError("unk is already defined.");
  125|      0|        return;
  126|      0|      }
  127|      1|      unk_id_ = i;
  128|      1|    }
  129|       |
  130|    298|    if (sp.type() == ModelProto::SentencePiece::BYTE) {
  ------------------
  |  Branch (130:9): [True: 256, False: 42]
  ------------------
  131|    256|      if (!model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (131:11): [True: 0, False: 256]
  ------------------
  132|      0|        status_ = absl::InternalError(
  133|      0|            absl::StrCat("byte piece ", sp.piece(),
  134|      0|                         " is found although `byte_fallback` is false."));
  135|      0|        return;
  136|      0|      }
  137|    256|      const int byte = PieceToByte(sp.piece());
  138|    256|      if (0 <= byte && byte < 256) {
  ------------------
  |  Branch (138:11): [True: 256, False: 0]
  |  Branch (138:24): [True: 256, False: 0]
  ------------------
  139|    256|        byte_found[byte] = true;
  140|    256|      } else {
  141|      0|        status_ = absl::InternalError(
  142|      0|            absl::StrCat("byte piece ", sp.piece(), " is invalid."));
  143|      0|        return;
  144|      0|      }
  145|    256|    }
  146|    298|  }
  147|       |
  148|      1|  if (unk_id_ == -1) {
  ------------------
  |  Branch (148:7): [True: 0, False: 1]
  ------------------
  149|      0|    status_ = absl::InternalError("unk is not defined.");
  150|      0|    return;
  151|      0|  }
  152|       |
  153|      1|  if (model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (153:7): [True: 1, False: 0]
  ------------------
  154|       |    // Checks that there are 256 byte pieces.
  155|      1|    if (std::find(byte_found.begin(), byte_found.end(), false) !=
  ------------------
  |  Branch (155:9): [True: 0, False: 1]
  ------------------
  156|      1|        byte_found.end()) {
  157|      0|      status_ = absl::InternalError(
  158|      0|          "there are not 256 byte pieces although `byte_fallback` is true.");
  159|      0|      return;
  160|      0|    }
  161|      1|  }
  162|       |
  163|      1|  matcher_ = std::make_unique<normalizer::PrefixMatcher>(user_defined_symbols);
  164|      1|}
_ZN13sentencepiece11ByteToPieceEh:
  230|    256|const std::string& ByteToPiece(unsigned char c) {
  231|    256|  static const std::vector<std::string>* const kBytePieces = [] {
  232|    256|    auto* v = new std::vector<std::string>(256);
  233|    256|    for (int i = 0; i < 256; ++i) {
  234|    256|      (*v)[i] = absl::StrFormat("<0x%02X>", i);
  235|    256|    }
  236|    256|    return v;
  237|    256|  }();
  238|    256|  return (*kBytePieces)[c];
  239|    256|}
_ZN13sentencepiece11PieceToByteENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE:
  241|    256|int PieceToByte(absl::string_view piece) {
  242|    256|  using PieceToByteMap = absl::flat_hash_map<absl::string_view, unsigned char>;
  243|    256|  static const auto* const kMap = []() -> PieceToByteMap* {
  244|    256|    auto* m = new PieceToByteMap();
  245|    256|    for (int i = 0; i < 256; ++i) {
  246|    256|      (*m)[ByteToPiece(i)] = i;
  247|    256|    }
  248|    256|    return m;
  249|    256|  }();
  250|       |
  251|    256|  if (const auto it = kMap->find(piece); it != kMap->end()) {
  ------------------
  |  Branch (251:42): [True: 256, False: 0]
  ------------------
  252|    256|    return it->second;
  253|    256|  }
  254|       |
  255|      0|  return -1;
  256|    256|}
model_interface.cc:_ZZN13sentencepiece11ByteToPieceEhENK3$_0clEv:
  231|      1|  static const std::vector<std::string>* const kBytePieces = [] {
  232|      1|    auto* v = new std::vector<std::string>(256);
  233|    257|    for (int i = 0; i < 256; ++i) {
  ------------------
  |  Branch (233:21): [True: 256, False: 1]
  ------------------
  234|    256|      (*v)[i] = absl::StrFormat("<0x%02X>", i);
  235|    256|    }
  236|      1|    return v;
  237|      1|  }();
model_interface.cc:_ZZN13sentencepiece11PieceToByteENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEENK3$_0clEv:
  243|      1|  static const auto* const kMap = []() -> PieceToByteMap* {
  244|      1|    auto* m = new PieceToByteMap();
  245|    257|    for (int i = 0; i < 256; ++i) {
  ------------------
  |  Branch (245:21): [True: 256, False: 1]
  ------------------
  246|    256|      (*m)[ByteToPiece(i)] = i;
  247|    256|    }
  248|      1|    return m;
  249|      1|  }();

_ZNK13sentencepiece14ModelInterface6statusEv:
   72|     10|  virtual absl::Status status() const { return status_; }
_ZNK13sentencepiece14ModelInterface14prefix_matcherEv:
   79|      1|      const {
   80|      1|    return matcher_.get();
   81|      1|  }
_ZNK13sentencepiece14ModelInterface9IsUnknownEi:
  177|      1|  [[nodiscard]] virtual bool IsUnknown(int id) const {
  178|      1|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|      1|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|      1|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      1|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 1]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      1|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  179|      1|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|      1|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|      1|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      1|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 1]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      1|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  180|      1|    return (model_proto_->pieces(id).type() ==
  181|      1|            ModelProto::SentencePiece::UNKNOWN);
  182|      1|  }
_ZNK13sentencepiece14ModelInterface9IsControlEi:
  185|      3|  [[nodiscard]] virtual bool IsControl(int id) const {
  186|      3|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|      3|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|      3|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      3|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 3]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      3|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  187|      3|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|      3|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|      3|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      3|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 3]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      3|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  188|      3|    return (model_proto_->pieces(id).type() ==
  189|      3|            ModelProto::SentencePiece::CONTROL);
  190|      3|  }
_ZN13sentencepiece14ModelInterfaceC2Ev:
   66|      1|  ModelInterface() = default;

_ZN13sentencepiece10normalizer10NormalizerC2ERKNS_14NormalizerSpecERKNS_11TrainerSpecE:
   36|      1|    : spec_(&spec),
   37|      1|      treat_whitespace_as_suffix_(trainer_spec.treat_whitespace_as_suffix()),
   38|      1|      status_(absl::OkStatus()) {
   39|      1|  Init();
   40|      1|}
_ZN13sentencepiece10normalizer10Normalizer4InitEv:
   49|      1|void Normalizer::Init() {
   50|      1|  absl::string_view index = spec_->precompiled_charsmap();
   51|       |
   52|      1|  if (!index.empty()) {
  ------------------
  |  Branch (52:7): [True: 0, False: 1]
  ------------------
   53|      0|    absl::string_view trie_blob;
   54|      0|    status_ = DecodePrecompiledCharsMap(index, &trie_blob, &normalized_,
   55|      0|                                        &precompiled_charsmap_buffer_);
   56|       |
   57|      0|    if (!status_.ok()) return;
  ------------------
  |  Branch (57:9): [True: 0, False: 0]
  ------------------
   58|       |
   59|       |    // Reads the body of double array.
   60|      0|    trie_ = std::make_unique<Darts::DoubleArray>();
   61|       |
   62|       |    // copy_array ensures correct alignment even if the trie_blob is
   63|       |    // mis-aligned. Although standard proto parsing copies data to the heap
   64|       |    // (guaranteeing alignment), zero-copy parsing or custom buffers might
   65|       |    // pass misaligned data.
   66|      0|    if (reinterpret_cast<uintptr_t>(trie_blob.data()) % 4 == 0) {
  ------------------
  |  Branch (66:9): [True: 0, False: 0]
  ------------------
   67|      0|      trie_->set_array(const_cast<char*>(trie_blob.data()),
   68|      0|                       trie_blob.size() / trie_->unit_size());
   69|      0|    } else {
   70|      0|      trie_->copy_array(reinterpret_cast<const char*>(trie_blob.data()),
   71|      0|                        trie_blob.size());
   72|      0|    }
   73|       |
   74|      0|    if (!trie_->validate(normalized_.size())) {
  ------------------
  |  Branch (74:9): [True: 0, False: 0]
  ------------------
   75|      0|      status_ = absl::InternalError("precompiled_charsmap is invalid.");
   76|      0|      trie_.reset();
   77|      0|      return;
   78|      0|    }
   79|      0|  }
   80|      1|}
_ZN13sentencepiece10normalizer13PrefixMatcherC2ERKNSt3__13setINS2_17basic_string_viewIcNS2_11char_traitsIcEEEENS2_4lessIS7_EENS2_9allocatorIS7_EEEE:
  332|      1|PrefixMatcher::PrefixMatcher(const std::set<absl::string_view>& dic) {
  333|      1|  if (dic.empty()) return;
  ------------------
  |  Branch (333:7): [True: 1, False: 0]
  ------------------
  334|      0|  std::vector<const char*> key;
  335|      0|  std::vector<size_t> lengths;
  336|      0|  key.reserve(dic.size());
  337|      0|  lengths.reserve(dic.size());
  338|      0|  for (const auto& it : dic) {
  ------------------
  |  Branch (338:23): [True: 0, False: 0]
  ------------------
  339|      0|    key.push_back(it.data());
  340|      0|    lengths.push_back(it.size());
  341|      0|  }
  342|      0|  trie_ = std::make_unique<Darts::DoubleArray>();
  343|      0|  if (trie_->build(key.size(), const_cast<char**>(key.data()),
  ------------------
  |  Branch (343:7): [True: 0, False: 0]
  ------------------
  344|      0|                   const_cast<size_t*>(lengths.data()), nullptr) != 0) {
  345|      0|    LOG(ERROR) << "Failed to build the TRIE for PrefixMatcher";
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  176|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |   64|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::ErrorTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  346|      0|    trie_.reset();
  347|      0|  }
  348|      0|}

_ZN13sentencepiece10normalizer10Normalizer16SetPrefixMatcherEPKNS0_13PrefixMatcherE:
   72|      1|  virtual void SetPrefixMatcher(const PrefixMatcher* matcher) {
   73|      1|    matcher_ = matcher;
   74|      1|  }
_ZNK13sentencepiece10normalizer10Normalizer6statusEv:
   78|      9|  virtual absl::Status status() const { return status_; }

_ZN13sentencepiece22SentencePieceProcessorC2Ev:
  235|      1|SentencePieceProcessor::SentencePieceProcessor() {}
_ZN13sentencepiece22SentencePieceProcessor23LoadFromSerializedProtoENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  255|      1|    absl::string_view serialized) {
  256|      1|  auto model_proto = std::make_unique<ModelProto>();
  257|      1|  RET_CHECK(model_proto->ParseFromArray(serialized.data(), serialized.size()));
  ------------------
  |  |  285|      1|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (285:7): [True: 1, False: 0]
  |  |  ------------------
  |  |  286|      1|  } else /* NOLINT */                                         \
  |  |  287|      1|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  288|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  258|      1|  return Load(std::move(model_proto));
  259|      1|}
_ZN13sentencepiece22SentencePieceProcessor4LoadENSt3__110unique_ptrINS_10ModelProtoENS1_14default_deleteIS3_EEEE:
  262|      1|    std::unique_ptr<ModelProto> model_proto) {
  263|      1|  model_proto_ = std::move(model_proto);
  264|      1|  model_ = ModelFactory::Create(*model_proto_);
  265|      1|  normalizer_ = std::make_unique<normalizer::Normalizer>(
  266|      1|      model_proto_->normalizer_spec(), model_proto_->trainer_spec());
  267|      1|  if (model_proto_->has_denormalizer_spec() &&
  ------------------
  |  Branch (267:7): [True: 0, False: 1]
  ------------------
  268|      0|      !model_proto_->denormalizer_spec().precompiled_charsmap().empty()) {
  ------------------
  |  Branch (268:7): [True: 0, False: 0]
  ------------------
  269|      0|    denormalizer_ = std::make_unique<normalizer::Normalizer>(
  270|      0|        model_proto_->denormalizer_spec());
  271|      0|  }
  272|       |
  273|       |  // Escapes user-defined-symbols in normalizer.
  274|      1|  normalizer_->SetPrefixMatcher(model_->prefix_matcher());
  275|       |
  276|      1|  RETURN_IF_ERROR(status());
  ------------------
  |  |   44|      1|#define RETURN_IF_ERROR(...) ABSL_RETURN_IF_ERROR(__VA_ARGS__)
  |  |  ------------------
  |  |  |  |   90|      1|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|      2|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|      2|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|      2|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|      1|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|      2|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|      2|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|      2|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|      1|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|      2|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  277|       |
  278|       |  // Precomputes and caches special token IDs.
  279|       |  // Note that these IDs are not always the same as the IDs in TrainerSpec.
  280|      1|  unk_id_ = PieceToId(model_->unk_piece());
  281|      1|  if (!IsUnknown(unk_id_)) unk_id_ = -1;
  ------------------
  |  Branch (281:7): [True: 0, False: 1]
  ------------------
  282|       |
  283|      1|  bos_id_ = PieceToId(model_->bos_piece());
  284|      1|  if (!IsControl(bos_id_)) bos_id_ = -1;
  ------------------
  |  Branch (284:7): [True: 0, False: 1]
  ------------------
  285|       |
  286|      1|  eos_id_ = PieceToId(model_->eos_piece());
  287|      1|  if (!IsControl(eos_id_)) eos_id_ = -1;
  ------------------
  |  Branch (287:7): [True: 0, False: 1]
  ------------------
  288|       |
  289|      1|  pad_id_ = PieceToId(model_->pad_piece());
  290|      1|  if (!IsControl(pad_id_)) pad_id_ = -1;
  ------------------
  |  Branch (290:7): [True: 1, False: 0]
  ------------------
  291|       |
  292|       |  // Running self-testing.
  293|      1|  std::vector<std::string> errors, sps;
  294|      1|  for (const auto& s : model_proto_->self_test_data().samples()) {
  ------------------
  |  Branch (294:22): [True: 0, False: 1]
  ------------------
  295|      0|    RETURN_IF_ERROR(Encode(s.input(), &sps));
  ------------------
  |  |   44|      0|#define RETURN_IF_ERROR(...) ABSL_RETURN_IF_ERROR(__VA_ARGS__)
  |  |  ------------------
  |  |  |  |   90|      0|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|      0|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|      0|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|      0|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|      0|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|      0|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|      0|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|      0|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|      0|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|      0|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  296|      0|    const std::string result = absl::StrJoin(sps, " ");
  297|      0|    if (!model_->VerifyOutputsEquivalent(s.expected(), result)) {
  ------------------
  |  Branch (297:9): [True: 0, False: 0]
  ------------------
  298|      0|      errors.emplace_back(
  299|      0|          absl::StrCat(s.input(), "\t", s.expected(), "\t", result));
  300|      0|    }
  301|      0|  }
  302|       |
  303|      1|  if (!errors.empty()) {
  ------------------
  |  Branch (303:7): [True: 0, False: 1]
  ------------------
  304|      0|    LOG(INFO) << errors.size() << "/"
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  172|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   57|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |   58|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::InfoTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  305|      0|              << model_proto_->self_test_data().samples_size()
  306|      0|              << " samples did not pass the test.";
  307|      0|    for (const auto& e : errors) {
  ------------------
  |  Branch (307:24): [True: 0, False: 0]
  ------------------
  308|      0|      LOG(INFO) << e;
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  172|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   57|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |   58|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::InfoTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  309|      0|    }
  310|      0|    return absl::InternalError("Self-test failures. See LOG(INFO).");
  311|      0|  }
  312|       |
  313|      1|  return absl::OkStatus();
  314|      1|}
_ZNK13sentencepiece22SentencePieceProcessor6statusEv:
  326|      9|absl::Status SentencePieceProcessor::status() const {
  327|      9|  RET_CHECK(model_) << "Model is not initialized.";
  ------------------
  |  |  285|      9|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (285:7): [True: 9, False: 0]
  |  |  ------------------
  |  |  286|      9|  } else /* NOLINT */                                         \
  |  |  287|      9|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  288|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  328|      9|  RET_CHECK(normalizer_) << "Normalizer is not initialized.";
  ------------------
  |  |  285|      9|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (285:7): [True: 9, False: 0]
  |  |  ------------------
  |  |  286|      9|  } else /* NOLINT */                                         \
  |  |  287|      9|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  288|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  329|      9|  RETURN_IF_ERROR(model_->status());
  ------------------
  |  |   44|      9|#define RETURN_IF_ERROR(...) ABSL_RETURN_IF_ERROR(__VA_ARGS__)
  |  |  ------------------
  |  |  |  |   90|      9|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|     27|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|     18|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|     18|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 9, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|      9|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 9]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|     27|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 9, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|     27|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|     27|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|      9|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|     27|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  330|      9|  RETURN_IF_ERROR(normalizer_->status());
  ------------------
  |  |   44|      9|#define RETURN_IF_ERROR(...) ABSL_RETURN_IF_ERROR(__VA_ARGS__)
  |  |  ------------------
  |  |  |  |   90|      9|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|     27|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|     18|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|     18|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 9, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|      9|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 9]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|     27|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 9, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|     27|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|     27|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|      9|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|     27|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  331|      9|  return absl::OkStatus();
  332|      9|}
_ZNK13sentencepiece22SentencePieceProcessor9PieceToIdENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
 1469|      4|int SentencePieceProcessor::PieceToId(absl::string_view piece) const {
 1470|      4|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1440|      4|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1440:7): [True: 0, False: 4]
  |  |  ------------------
  |  | 1441|      0|    LOG(ERROR) << status().message() << "\nReturns default value " << value; \
  |  |  ------------------
  |  |  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  176|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   63|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |  |  |   64|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::ErrorTag{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1442|      0|    return value;                                                            \
  |  | 1443|      0|  }
  ------------------
 1471|      4|  return model_->PieceToId(piece);
 1472|      4|}
_ZNK13sentencepiece22SentencePieceProcessor9IsControlEi:
 1494|      3|bool SentencePieceProcessor::IsControl(int id) const {
 1495|      3|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1440|      3|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1440:7): [True: 0, False: 3]
  |  |  ------------------
  |  | 1441|      0|    LOG(ERROR) << status().message() << "\nReturns default value " << value; \
  |  |  ------------------
  |  |  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  176|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   63|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |  |  |   64|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::ErrorTag{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1442|      0|    return value;                                                            \
  |  | 1443|      0|  }
  ------------------
 1496|      3|  return model_->IsControl(id);
 1497|      3|}
_ZNK13sentencepiece22SentencePieceProcessor9IsUnknownEi:
 1499|      1|bool SentencePieceProcessor::IsUnknown(int id) const {
 1500|      1|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1440|      1|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1440:7): [True: 0, False: 1]
  |  |  ------------------
  |  | 1441|      0|    LOG(ERROR) << status().message() << "\nReturns default value " << value; \
  |  |  ------------------
  |  |  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  176|      0|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      0|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      0|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      0|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      0|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   63|      0|  ::absl::log_internal::LogMessage( \
  |  |  |  |  |  |  |  |   64|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::ErrorTag{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1442|      0|    return value;                                                            \
  |  | 1443|      0|  }
  ------------------
 1501|      1|  return model_->IsUnknown(id);
 1502|      1|}

_ZNK13sentencepiece7unigram5Model9PieceToIdENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  631|      4|int Model::PieceToId(absl::string_view piece) const {
  632|      4|  auto it = reserved_id_map_.find(piece);
  633|      4|  if (it != reserved_id_map_.end()) {
  ------------------
  |  Branch (633:7): [True: 3, False: 1]
  ------------------
  634|      3|    return it->second;
  635|      3|  }
  636|      1|  int id = 0;
  637|      1|  trie_->exactMatchSearch(piece.data(), id, piece.size());
  638|      1|  return id == -1 ? unk_id_ : id;
  ------------------
  |  Branch (638:10): [True: 1, False: 0]
  ------------------
  639|      4|}
_ZN13sentencepiece7unigram5Model9BuildTrieEPNSt3__16vectorINS2_4pairINS2_17basic_string_viewIcNS2_11char_traitsIcEEEEiEENS2_9allocatorIS9_EEEE:
  641|      1|void Model::BuildTrie(std::vector<std::pair<absl::string_view, int>> *pieces) {
  642|      1|  if (!status().ok()) return;
  ------------------
  |  Branch (642:7): [True: 0, False: 1]
  ------------------
  643|       |
  644|      1|  if (pieces->empty()) {
  ------------------
  |  Branch (644:7): [True: 0, False: 1]
  ------------------
  645|      0|    status_ = absl::InternalError("no pieces are loaded.");
  646|      0|    return;
  647|      0|  }
  648|       |
  649|       |  // sort by sentencepiece since DoubleArray::build()
  650|       |  // only accepts sorted strings.
  651|      1|  sort(pieces->begin(), pieces->end());
  652|       |
  653|       |  // Makes key/value/length set for DoubleArrayTrie.
  654|      1|  std::vector<const char *> key(pieces->size());
  655|      1|  std::vector<size_t> length(pieces->size());
  656|      1|  std::vector<int> value(pieces->size());
  657|     40|  for (size_t i = 0; i < pieces->size(); ++i) {
  ------------------
  |  Branch (657:22): [True: 39, False: 1]
  ------------------
  658|     39|    key[i] = (*pieces)[i].first.data();  // sorted piece.
  659|     39|    length[i] = (*pieces)[i].first.size();
  660|     39|    value[i] = (*pieces)[i].second;  // vocab_id
  661|     39|  }
  662|       |
  663|      1|  trie_ = std::make_unique<Darts::DoubleArray>();
  664|      1|  if (trie_->build(key.size(), const_cast<char **>(&key[0]),
  ------------------
  |  Branch (664:7): [True: 0, False: 1]
  ------------------
  665|      1|                   const_cast<size_t *>(&length[0]), &value[0]) != 0) {
  666|      0|    status_ = absl::InternalError("cannot build double-array.");
  667|      0|    return;
  668|      0|  }
  669|       |
  670|       |  // Computes the maximum number of shared prefixes in the trie.
  671|      1|  const int kMaxTrieResultsSize = 1024;
  672|      1|  std::vector<Darts::DoubleArray::result_pair_type> results(
  673|      1|      kMaxTrieResultsSize);
  674|      1|  trie_results_size_ = 0;
  675|     39|  for (const auto &p : *pieces) {
  ------------------
  |  Branch (675:22): [True: 39, False: 1]
  ------------------
  676|     39|    const int num_nodes = trie_->commonPrefixSearch(
  677|     39|        p.first.data(), results.data(), results.size(), p.first.size());
  678|     39|    trie_results_size_ = std::max(trie_results_size_, num_nodes);
  679|     39|  }
  680|       |
  681|      1|  pieces_.clear();
  682|       |
  683|      1|  if (trie_results_size_ == 0)
  ------------------
  |  Branch (683:7): [True: 0, False: 1]
  ------------------
  684|      0|    status_ = absl::InternalError("no entry is found in the trie.");
  685|      1|}
_ZN13sentencepiece7unigram5ModelC2ERKNS_10ModelProtoE:
  687|      1|Model::Model(const ModelProto &model_proto) {
  688|      1|  model_proto_ = &model_proto;
  689|       |
  690|      1|  InitializePieces();
  691|       |
  692|      1|  min_score_ = FLT_MAX;
  693|    298|  for (const auto &sp : model_proto_->pieces()) {
  ------------------
  |  Branch (693:23): [True: 298, False: 1]
  ------------------
  694|    298|    if (sp.type() == ModelProto::SentencePiece::NORMAL) {
  ------------------
  |  Branch (694:9): [True: 39, False: 259]
  ------------------
  695|     39|      min_score_ = std::min(min_score_, sp.score());
  696|     39|    }
  697|    298|  }
  698|       |
  699|      1|  std::vector<std::pair<absl::string_view, int>> pieces;
  700|     39|  for (const auto &it : pieces_) pieces.emplace_back(it.first, it.second);
  ------------------
  |  Branch (700:23): [True: 39, False: 1]
  ------------------
  701|       |
  702|      1|  BuildTrie(&pieces);
  703|      1|}

_ZN13sentencepiece4port18InsertIfNotPresentIN4absl12lts_2026052613flat_hash_mapINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEiNS3_18container_internal10StringHashENSA_8StringEqENS5_9allocatorINS5_4pairIKS9_iEEEEEEEEbPT_RKNSJ_10value_type10first_typeERKNSL_11second_typeE:
  200|    298|    const typename Collection::value_type::second_type& value) {
  201|    298|  return InsertIfNotPresent(collection,
  202|    298|                            typename Collection::value_type(key, value));
  203|    298|}
_ZN13sentencepiece4port18InsertIfNotPresentIN4absl12lts_2026052613flat_hash_mapINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEiNS3_18container_internal10StringHashENSA_8StringEqENS5_9allocatorINS5_4pairIKS9_iEEEEEEEEbPT_RKNSJ_10value_typeE:
  192|    298|                        const typename Collection::value_type& vt) {
  193|    298|  return collection->insert(vt).second;
  194|    298|}

_ZN4absl12lts_2026052613little_endian10FromHost64Em:
  109|      5|inline uint64_t FromHost64(uint64_t x) { return x; }
_ZN4absl12lts_2026052613little_endian6Load64EPKv:
  176|      2|inline uint64_t Load64(const void* absl_nonnull p) {
  177|      2|  return ToHost64(ABSL_INTERNAL_UNALIGNED_LOAD64(p));
  ------------------
  |  |   78|      2|  (absl::base_internal::UnalignedLoad64(_p))
  ------------------
  178|      2|}
_ZN4absl12lts_2026052613little_endian7Store64EPvm:
  180|      5|inline void Store64(void* absl_nonnull p, uint64_t v) {
  181|      5|  ABSL_INTERNAL_UNALIGNED_STORE64(p, FromHost64(v));
  ------------------
  |  |   85|      5|  (absl::base_internal::UnalignedStore64(_p, _val))
  ------------------
  182|      5|}

_ZN4absl12lts_2026052613base_internal16UnalignedStore64EPvm:
   65|      5|inline void UnalignedStore64(void* absl_nonnull p, uint64_t v) {
   66|      5|  memcpy(p, &v, sizeof v);
   67|      5|}

_ZN4absl12lts_2026052618container_internal8AllocateILm8ENSt3__19allocatorIcEEEEPvPT0_m:
   62|     11|void* Allocate(Alloc* alloc, size_t n) {
   63|     11|  static_assert(Alignment > 0, "");
   64|     11|  assert(n && "n must be positive");
   65|     11|  using M = AlignedType<Alignment>;
   66|     11|  using A = typename std::allocator_traits<Alloc>::template rebind_alloc<M>;
   67|     11|  using AT = typename std::allocator_traits<Alloc>::template rebind_traits<M>;
   68|       |  // On macOS, "mem_alloc" is a #define with one argument defined in
   69|       |  // rpc/types.h, so we can't name the variable "mem_alloc" and initialize it
   70|       |  // with the "foo(bar)" syntax.
   71|     11|  A my_mem_alloc(*alloc);
   72|     11|  void* p = AT::allocate(my_mem_alloc, (n + sizeof(M) - 1) / sizeof(M));
   73|       |  assert(reinterpret_cast<uintptr_t>(p) % Alignment == 0 &&
   74|     11|         "allocator does not respect alignment");
   75|     11|  return p;
   76|     11|}
_ZN4absl12lts_2026052618container_internal10DeallocateILm8ENSt3__19allocatorIcEEEEvPT0_Pvm:
   93|      8|void Deallocate(Alloc* alloc, void* p, size_t n) {
   94|      8|  static_assert(Alignment > 0, "");
   95|      8|  assert(n && "n must be positive");
   96|      8|  using M = AlignedType<Alignment>;
   97|      8|  using A = typename std::allocator_traits<Alloc>::template rebind_alloc<M>;
   98|      8|  using AT = typename std::allocator_traits<Alloc>::template rebind_traits<M>;
   99|       |  // On macOS, "mem_alloc" is a #define with one argument defined in
  100|       |  // rpc/types.h, so we can't name the variable "mem_alloc" and initialize it
  101|       |  // with the "foo(bar)" syntax.
  102|      8|  A my_mem_alloc(*alloc);
  103|      8|  AT::deallocate(my_mem_alloc, static_cast<M*>(p),
  104|      8|                 (n + sizeof(M) - 1) / sizeof(M));
  105|      8|}

_ZNK4absl12lts_2026052618container_internal13GroupSse2Impl18MaskEmptyOrDeletedEv:
  316|      5|  NonIterableBitMaskType MaskEmptyOrDeleted() const {
  317|      5|    auto special = _mm_set1_epi8(static_cast<char>(ctrl_t::kSentinel));
  318|      5|    return NonIterableBitMaskType(
  319|      5|        MoveMask(_mm_cmpgt_epi8_fixed(special, ctrl)));
  320|      5|  }
_ZN4absl12lts_2026052618container_internal6IsFullENS1_6ctrl_tE:
  221|    554|inline bool IsFull(ctrl_t c) {
  222|       |  // Cast `c` to the underlying type instead of casting `0` to `ctrl_t` as `0`
  223|       |  // is not a value in the enum. Both ways are equivalent, but this way makes
  224|       |  // linters happier.
  225|    554|  return static_cast<std::underlying_type_t<ctrl_t>>(c) >= 0;
  226|    554|}
_ZN4absl12lts_2026052618container_internal20_mm_cmpgt_epi8_fixedEDv2_xS2_:
  264|      5|inline __m128i _mm_cmpgt_epi8_fixed(__m128i a, __m128i b) {
  265|       |#if defined(__GNUC__) && !defined(__clang__)
  266|       |  if (std::is_unsigned<char>::value) {
  267|       |    const __m128i mask = _mm_set1_epi8(0x80);
  268|       |    const __m128i diff = _mm_subs_epi8(b, a);
  269|       |    return _mm_cmpeq_epi8(_mm_and_si128(diff, mask), mask);
  270|       |  }
  271|       |#endif
  272|      5|  return _mm_cmpgt_epi8(a, b);
  273|      5|}

_ZNK4absl12lts_2026052618container_internal20HashtablezInfoHandle9IsSampledEv:
  204|     11|  inline bool IsSampled() const { return false; }
_ZN4absl12lts_2026052618container_internal20HashtablezInfoHandle20RecordStorageChangedEmm:
  205|      1|  inline void RecordStorageChanged(size_t /*size*/, size_t /*capacity*/) {}
_ZN4absl12lts_2026052618container_internal20HashtablezInfoHandle17RecordReservationEm:
  207|      2|  inline void RecordReservation(size_t /*target_capacity*/) {}
_ZN4absl12lts_2026052618container_internal20HashtablezInfoHandle16RecordInsertMissEmm:
  210|    545|                               size_t /*distance_from_desired*/) {}

_ZN4absl12lts_2026052618container_internal17NextHashTableSeedEv:
  138|      3|uint16_t NextHashTableSeed() {
  139|      3|  static_assert(PerTableSeed::kBitCount <= 16);
  140|      3|  thread_local uint16_t seed =
  141|      3|      static_cast<uint16_t>(reinterpret_cast<uintptr_t>(&seed));
  142|      3|  seed += uint16_t{0xad53};
  143|      3|  return seed;
  144|      3|}
_ZN4absl12lts_2026052618container_internal17ClearBackingArrayERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPvb:
  670|      1|                       bool reuse) {
  671|      1|  ABSL_SWISSTABLE_ASSERT(c.capacity() > MaxSmallCapacity());
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  672|      1|  if (reuse) {
  ------------------
  |  Branch (672:7): [True: 1, False: 0]
  ------------------
  673|      1|    c.set_size_to_zero();
  674|      1|    ResetCtrl(c, policy.slot_size);
  675|      1|    ResetGrowthLeft(c);
  676|      1|    c.infoz().RecordStorageChanged(0, c.capacity());
  677|      1|  } else {
  678|      0|    ClearBackingArrayNoReuse(c, policy, alloc);
  679|      0|  }
  680|      1|}
_ZN4absl12lts_2026052618container_internal24PrepareInsertSmallNonSooERNS1_12CommonFieldsERKNS1_15PolicyFunctionsENS0_11FunctionRefIFmmEEE:
 1541|      2|    absl::FunctionRef<size_t(size_t)> get_hash) {
 1542|      2|  ABSL_SWISSTABLE_ASSERT(common.is_small());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1543|      2|  ABSL_SWISSTABLE_ASSERT(!policy.soo_enabled);
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1544|      2|  if (common.capacity() == 1) {
  ------------------
  |  Branch (1544:7): [True: 1, False: 1]
  ------------------
 1545|      1|    if (common.empty()) {
  ------------------
  |  Branch (1545:9): [True: 0, False: 1]
  ------------------
 1546|      0|      IncrementSmallSizeNonSoo(common, policy);
 1547|      0|      if (common.has_infoz()) {
  ------------------
  |  Branch (1547:11): [True: 0, False: 0]
  ------------------
 1548|      0|        common.infoz().RecordInsertMiss(get_hash(common.seed().seed()),
 1549|      0|                                        /*distance_from_desired=*/0);
 1550|      0|      }
 1551|      0|      return {SooControl(), common.slot_array()};
 1552|      1|    } else {
 1553|      1|      return Grow1To3AndPrepareInsert(common, policy, get_hash);
 1554|      1|    }
 1555|      1|  }
 1556|       |
 1557|       |  // Growing from 0 to 1 capacity.
 1558|      1|  ABSL_SWISSTABLE_ASSERT(common.capacity() == 0);
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1559|      1|  constexpr size_t kNewCapacity = 1;
 1560|       |
 1561|      1|  common.set_capacity(kNewCapacity);
 1562|      1|  HashtablezInfoHandle infoz;
 1563|      1|  const bool should_sample =
 1564|      1|      policy.is_hashtablez_eligible && ShouldSampleNextTable();
  ------------------
  |  Branch (1564:7): [True: 1, False: 0]
  |  Branch (1564:40): [True: 0, False: 1]
  ------------------
 1565|      1|  if (ABSL_PREDICT_FALSE(should_sample)) {
  ------------------
  |  |  190|      1|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1]
  |  |  |  Branch (190:49): [Folded, False: 1]
  |  |  |  Branch (190:58): [True: 0, False: 1]
  |  |  ------------------
  ------------------
 1566|      0|    infoz = ForcedTrySample(policy.slot_size, policy.key_size,
 1567|      0|                            policy.value_size, policy.soo_capacity());
 1568|      0|  }
 1569|      1|  const bool has_infoz = infoz.IsSampled();
 1570|      1|  void* alloc = policy.get_char_alloc(common);
 1571|       |
 1572|      1|  const auto [new_ctrl, new_slots] =
 1573|      1|      AllocBackingArray(common, policy, kNewCapacity, has_infoz, alloc);
 1574|      1|  common.set_control(new_ctrl);
 1575|      1|  common.set_slots(new_slots);
 1576|       |
 1577|      1|  static_assert(NextCapacity(0) == 1);
 1578|      1|  PrepareInsertCommon(common);
 1579|       |
 1580|      1|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|      1|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1]
  |  |  |  Branch (190:49): [Folded, False: 1]
  |  |  |  Branch (190:58): [True: 0, False: 1]
  |  |  ------------------
  ------------------
 1581|      0|    common.generate_new_seed(/*has_infoz=*/true);
 1582|      0|    ReportSingleGroupTableGrowthToInfoz(common, infoz,
 1583|      0|                                        get_hash(common.seed().seed()));
 1584|      0|  }
 1585|      1|  return {SooControl(), new_slots};
 1586|      2|}
_ZN4absl12lts_2026052618container_internal19GetRefForEmptyClassERNS1_12CommonFieldsE:
 1752|     12|void* GetRefForEmptyClass(CommonFields& common) {
 1753|       |  // Empty base optimization typically make the empty base class address to be
 1754|       |  // the same as the first address of the derived class object.
 1755|       |  // But we generally assume that for empty classes we can return any valid
 1756|       |  // pointer.
 1757|     12|  return &common;
 1758|     12|}
_ZN4absl12lts_2026052618container_internal24ReserveTableToFitNewSizeERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1966|      2|                              size_t new_size) {
 1967|      2|  common.reset_reserved_growth(new_size);
 1968|      2|  common.set_reservation_size(new_size);
 1969|      2|  ABSL_SWISSTABLE_ASSERT(new_size > policy.soo_capacity());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1970|      2|  const size_t cap = common.capacity();
 1971|      2|  if (ABSL_PREDICT_TRUE(common.empty() && cap <= policy.soo_capacity())) {
  ------------------
  |  |  191|      4|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 2, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 2]
  |  |  |  Branch (191:58): [True: 2, False: 0]
  |  |  |  Branch (191:58): [True: 2, False: 0]
  |  |  ------------------
  ------------------
 1972|      2|    return ReserveEmptyNonAllocatedTableToFitNewSize(common, policy, new_size);
 1973|      2|  }
 1974|       |
 1975|      0|  ABSL_SWISSTABLE_ASSERT(!common.empty() || cap > policy.soo_capacity());
  ------------------
  |  |   62|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1976|      0|  ABSL_SWISSTABLE_ASSERT(cap > 0);
  ------------------
  |  |   62|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1977|      0|  const size_t max_size_before_growth =
 1978|      0|      IsSmallCapacity(cap) ? cap : common.size() + common.growth_left();
  ------------------
  |  Branch (1978:7): [True: 0, False: 0]
  ------------------
 1979|      0|  if (new_size <= max_size_before_growth) {
  ------------------
  |  Branch (1979:7): [True: 0, False: 0]
  ------------------
 1980|      0|    return;
 1981|      0|  }
 1982|      0|  ReserveAllocatedTable(common, policy, new_size);
 1983|      0|}
_ZN4absl12lts_2026052618container_internal18PrepareInsertLargeERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmNS1_18NonIterableBitMaskIjLi16ELi0EEENS1_8FindInfoE:
 2012|    552|                          FindInfo target_group) {
 2013|       |  // NOLINTNEXTLINE(misc-static-assert)
 2014|       |  ABSL_SWISSTABLE_ASSERT(!SwisstableGenerationsEnabled());
  ------------------
  |  |   62|    552|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2015|    552|  return PrepareInsertLargeImpl(common, policy, hash, mask_empty, target_group);
 2016|    552|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119Resize1To3NewOffsetEmNS1_16PerTableSeedImplIhEE:
  107|      1|size_t Resize1To3NewOffset(size_t hash, PerTableSeed seed) {
  108|       |  // After resize from capacity 1 to 3, we always have exactly the slot with
  109|       |  // index 1 occupied, so we need to insert either at index 0 or index 2.
  110|      1|  static_assert(SooSlotIndex() == 1);
  111|      1|  return SingleGroupTableH1(hash, seed) & 2;
  112|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_118SingleGroupTableH1EmNS1_16PerTableSeedImplIhEE:
  102|      3|size_t SingleGroupTableH1(size_t hash, PerTableSeed seed) {
  103|      3|  return hash ^ seed.seed();
  104|      3|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_111SlotAddressEPvmm:
  116|      5|inline void* SlotAddress(void* slot_array, size_t slot, size_t slot_size) {
  117|      5|  return static_cast<void*>(static_cast<char*>(slot_array) +
  118|      5|                            (slot * slot_size));
  119|      5|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119PrepareInsertCommonERNS1_12CommonFieldsE:
  335|    554|void PrepareInsertCommon(CommonFields& common) {
  336|    554|  common.increment_size();
  337|    554|  common.maybe_increment_generation_on_insert();
  338|    554|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_135InitializeThreeElementsControlBytesEhhmPNS1_6ctrl_tE:
  557|      1|    h2_t orig_h2, h2_t new_h2, size_t new_offset, ctrl_t* new_ctrl) {
  558|      1|  static constexpr size_t kNewCapacity = NextCapacity(SooCapacity());
  559|      1|  static_assert(kNewCapacity == 3);
  560|      1|  static_assert(is_single_group(kNewCapacity));
  561|      1|  static_assert(SooSlotIndex() == 1);
  562|      1|  ABSL_SWISSTABLE_ASSERT(new_offset == 0 || new_offset == 2);
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  563|       |
  564|      1|  static constexpr uint64_t kEmptyXorSentinel =
  565|      1|      static_cast<uint8_t>(ctrl_t::kEmpty) ^
  566|      1|      static_cast<uint8_t>(ctrl_t::kSentinel);
  567|      1|  static constexpr uint64_t kEmpty64 = static_cast<uint8_t>(ctrl_t::kEmpty);
  568|      1|  static constexpr size_t kMirroredSooSlotIndex =
  569|      1|      SooSlotIndex() + kNewCapacity + 1;
  570|       |  // The first 8 bytes, where SOO slot original and mirrored positions are
  571|       |  // replaced with 0.
  572|       |  // Result will look like: E0ESE0EE
  573|      1|  static constexpr uint64_t kFirstCtrlBytesWithZeroes =
  574|      1|      k8EmptyBytes ^ (kEmpty64 << (8 * SooSlotIndex())) ^
  575|      1|      (kEmptyXorSentinel << (8 * kNewCapacity)) ^
  576|      1|      (kEmpty64 << (8 * kMirroredSooSlotIndex));
  577|       |
  578|      1|  const uint64_t soo_h2 = static_cast<uint64_t>(orig_h2);
  579|      1|  const uint64_t new_h2_xor_empty =
  580|      1|      static_cast<uint64_t>(new_h2 ^ static_cast<uint8_t>(ctrl_t::kEmpty));
  581|       |  // Fill the original and mirrored bytes for SOO slot.
  582|       |  // Result will look like:
  583|       |  // EHESEHEE
  584|       |  // Where H = soo_h2, E = kEmpty, S = kSentinel.
  585|      1|  uint64_t first_ctrl_bytes =
  586|      1|      ((soo_h2 << (8 * SooSlotIndex())) | kFirstCtrlBytesWithZeroes) |
  587|      1|      (soo_h2 << (8 * kMirroredSooSlotIndex));
  588|       |  // Replace original and mirrored empty bytes for the new position.
  589|       |  // Result for new_offset 0 will look like:
  590|       |  // NHESNHEE
  591|       |  // Where H = soo_h2, N = H2(new_hash), E = kEmpty, S = kSentinel.
  592|       |  // Result for new_offset 2 will look like:
  593|       |  // EHNSEHNE
  594|      1|  first_ctrl_bytes ^= (new_h2_xor_empty << (8 * new_offset));
  595|      1|  size_t new_mirrored_offset = new_offset + kNewCapacity + 1;
  596|      1|  first_ctrl_bytes ^= (new_h2_xor_empty << (8 * new_mirrored_offset));
  597|       |
  598|       |  // Fill last bytes with kEmpty.
  599|      1|  std::memset(new_ctrl + kNewCapacity, static_cast<int8_t>(ctrl_t::kEmpty),
  600|      1|              Group::kWidth);
  601|       |  // Overwrite the first 8 bytes with first_ctrl_bytes.
  602|      1|  absl::little_endian::Store64(new_ctrl, first_ctrl_bytes);
  603|       |
  604|       |  // Example for group size 16:
  605|       |  // new_ctrl after 1st memset =      ???EEEEEEEEEEEEEEEE
  606|       |  // new_offset 0:
  607|       |  // new_ctrl after 2nd store  =      NHESNHEEEEEEEEEEEEE
  608|       |  // new_offset 2:
  609|       |  // new_ctrl after 2nd store  =      EHNSEHNEEEEEEEEEEEE
  610|       |
  611|       |  // Example for group size 8:
  612|       |  // new_ctrl after 1st memset =      ???EEEEEEEE
  613|       |  // new_offset 0:
  614|       |  // new_ctrl after 2nd store  =      NHESNHEEEEE
  615|       |  // new_offset 2:
  616|       |  // new_ctrl after 2nd store  =      EHNSEHNEEEE
  617|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_17SetCtrlERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  357|    545|                    size_t slot_size) {
  358|       |  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   62|    545|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  359|    545|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  360|    545|  ctrl_t* ctrl = c.control();
  361|    545|  ctrl[i] = h;
  362|    545|  ctrl[((i - NumClonedBytes()) & c.capacity()) +
  363|    545|       (NumClonedBytes() & c.capacity())] = h;
  364|    545|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119DoSanitizeOnSetCtrlERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  342|    554|                                size_t slot_size) {
  343|    554|  ABSL_SWISSTABLE_ASSERT(i < c.capacity());
  ------------------
  |  |   62|    554|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  344|    554|  auto* slot_i = static_cast<const char*>(c.slot_array()) + i * slot_size;
  345|    554|  if (IsFull(h)) {
  ------------------
  |  Branch (345:7): [True: 554, False: 0]
  ------------------
  346|    554|    SanitizerUnpoisonMemoryRegion(slot_i, slot_size);
  347|    554|  } else {
  348|      0|    SanitizerPoisonMemoryRegion(slot_i, slot_size);
  349|      0|  }
  350|    554|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119SetCtrlInLargeTableERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  390|      7|                                size_t slot_size) {
  391|       |  ABSL_SWISSTABLE_ASSERT(c.capacity() >= Group::kWidth - 1);
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  392|      7|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  393|      7|  ctrl_t* ctrl = c.control();
  394|      7|  ctrl[i] = h;
  395|      7|  ctrl[((i - NumClonedBytes()) & c.capacity()) + NumClonedBytes()] = h;
  396|      7|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_19ResetCtrlERNS1_12CommonFieldsEm:
  532|      3|void ResetCtrl(CommonFields& common, size_t slot_size) {
  533|      3|  const size_t capacity = common.capacity();
  534|      3|  ctrl_t* ctrl = common.control();
  535|      3|  static constexpr size_t kTwoGroupCapacity = 2 * Group::kWidth - 1;
  536|      3|  if (ABSL_PREDICT_TRUE(capacity <= kTwoGroupCapacity)) {
  ------------------
  |  |  191|      3|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 3]
  |  |  |  Branch (191:48): [Folded, False: 3]
  |  |  |  Branch (191:57): [True: 0, False: 3]
  |  |  ------------------
  ------------------
  537|      0|    if (IsSmallCapacity(capacity)) return;
  ------------------
  |  Branch (537:9): [True: 0, False: 0]
  ------------------
  538|      0|    std::memset(ctrl, static_cast<int8_t>(ctrl_t::kEmpty), Group::kWidth);
  539|      0|    std::memset(ctrl + capacity, static_cast<int8_t>(ctrl_t::kEmpty),
  540|      0|                Group::kWidth);
  541|      0|    if (capacity == kTwoGroupCapacity) {
  ------------------
  |  Branch (541:9): [True: 0, False: 0]
  ------------------
  542|      0|      std::memset(ctrl + Group::kWidth, static_cast<int8_t>(ctrl_t::kEmpty),
  543|      0|                  Group::kWidth);
  544|      0|    }
  545|      3|  } else {
  546|      3|    std::memset(ctrl, static_cast<int8_t>(ctrl_t::kEmpty),
  547|      3|                capacity + 1 + NumClonedBytes());
  548|      3|  }
  549|      3|  ctrl[capacity] = ctrl_t::kSentinel;
  550|      3|  SanitizerPoisonMemoryRegion(common.slot_array(), slot_size * capacity);
  551|      3|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_115ResetGrowthLeftERNS1_12CommonFieldsE:
  306|      1|void ResetGrowthLeft(CommonFields& common) {
  307|      1|  ResetGrowthLeft(common.growth_info(), common.capacity(), common.size());
  308|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_115ResetGrowthLeftERNS1_10GrowthInfoEmm:
  302|      8|void ResetGrowthLeft(GrowthInfo& growth_info, size_t capacity, size_t size) {
  303|      8|  growth_info.InitGrowthLeftNoDeleted(CapacityToGrowth(capacity) - size);
  304|      8|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_117AllocBackingArrayERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmbPv:
  776|     11|                                   void* alloc) {
  777|     11|  RawHashSetLayout layout(new_capacity, policy.slot_size, policy.slot_align,
  778|     11|                          has_infoz);
  779|       |  // Perform a direct call in the common case to allow for profile-guided
  780|       |  // heap optimization (PGHO) to understand which allocation function is used.
  781|     11|  constexpr size_t kDefaultAlignment = BackingArrayAlignment(alignof(size_t));
  782|     11|  char* mem = static_cast<char*>(
  783|     11|      ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|     11|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 11, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 11]
  |  |  |  Branch (191:57): [True: 11, False: 0]
  |  |  ------------------
  ------------------
  784|     11|          policy.alloc ==
  785|     11|          (&AllocateBackingArray<kDefaultAlignment, std::allocator<char>>))
  786|     11|          ? AllocateBackingArray<kDefaultAlignment, std::allocator<char>>(
  787|     11|                alloc, layout.alloc_size())
  788|     11|          : policy.alloc(alloc, layout.alloc_size()));
  789|     11|  const GenerationType old_generation = common.generation();
  790|     11|  common.set_generation_ptr(
  791|     11|      reinterpret_cast<GenerationType*>(mem + layout.generation_offset()));
  792|     11|  common.set_generation(NextGeneration(old_generation));
  793|       |
  794|     11|  return {reinterpret_cast<ctrl_t*>(mem + layout.control_offset()),
  795|     11|          mem + layout.slot_offset()};
  796|     11|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_124Grow1To3AndPrepareInsertERNS1_12CommonFieldsERKNS1_15PolicyFunctionsENS0_11FunctionRefIFmmEEE:
 1415|      1|    absl::FunctionRef<size_t(size_t)> get_hash) {
 1416|       |  // TODO(b/413062340): Refactor to reuse more code with
 1417|       |  // GrowSooTableToNextCapacityAndPrepareInsert.
 1418|      1|  ABSL_SWISSTABLE_ASSERT(common.capacity() == 1);
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1419|      1|  ABSL_SWISSTABLE_ASSERT(!common.empty());
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1420|      1|  ABSL_SWISSTABLE_ASSERT(!policy.soo_enabled);
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1421|      1|  constexpr size_t kOldCapacity = 1;
 1422|      1|  constexpr size_t kNewCapacity = NextCapacity(kOldCapacity);
 1423|      1|  ctrl_t* old_ctrl = common.control();
 1424|      1|  void* old_slots = common.slot_array();
 1425|       |
 1426|      1|  const size_t slot_size = policy.slot_size;
 1427|      1|  const size_t slot_align = policy.slot_align;
 1428|      1|  void* alloc = policy.get_char_alloc(common);
 1429|      1|  HashtablezInfoHandle infoz = common.infoz();
 1430|      1|  const bool has_infoz = infoz.IsSampled();
 1431|      1|  common.set_capacity(kNewCapacity);
 1432|       |
 1433|      1|  const auto [new_ctrl, new_slots] =
 1434|      1|      AllocBackingArray(common, policy, kNewCapacity, has_infoz, alloc);
 1435|      1|  common.set_control(new_ctrl);
 1436|      1|  common.set_slots(new_slots);
 1437|      1|  SanitizerPoisonMemoryRegion(new_slots, kNewCapacity * slot_size);
 1438|       |
 1439|      1|  if (ABSL_PREDICT_TRUE(!has_infoz)) {
  ------------------
  |  |  191|      1|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 1, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 1]
  |  |  |  Branch (191:57): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 1440|       |    // When we're sampled, we already have a seed.
 1441|      1|    common.generate_new_seed(/*has_infoz=*/false);
 1442|      1|  }
 1443|      1|  const size_t new_hash = get_hash(common.seed().seed());
 1444|      1|  h2_t new_h2 = H2(new_hash);
 1445|      1|  size_t orig_hash =
 1446|      1|      policy.hash_slot(policy.hash_fn(common), old_slots, common.seed().seed());
 1447|      1|  size_t offset = Resize1To3NewOffset(new_hash, common.seed());
 1448|      1|  InitializeThreeElementsControlBytes(H2(orig_hash), new_h2, offset, new_ctrl);
 1449|       |
 1450|      1|  void* old_element_target = NextSlot(new_slots, slot_size);
 1451|      1|  SanitizerUnpoisonMemoryRegion(old_element_target, slot_size);
 1452|      1|  policy.transfer_n(&common, old_element_target, old_slots, 1);
 1453|       |
 1454|      1|  void* new_element_target_slot = SlotAddress(new_slots, offset, slot_size);
 1455|      1|  SanitizerUnpoisonMemoryRegion(new_element_target_slot, slot_size);
 1456|       |
 1457|      1|  policy.dealloc(alloc, kOldCapacity, old_ctrl, slot_size, slot_align,
 1458|      1|                 has_infoz);
 1459|      1|  PrepareInsertCommon(common);
 1460|      1|  ABSL_SWISSTABLE_ASSERT(common.size() == 2);
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1461|      1|  GetGrowthInfoFromControl(new_ctrl).InitGrowthLeftNoDeleted(kNewCapacity - 2);
 1462|       |
 1463|      1|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|      1|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1]
  |  |  |  Branch (190:49): [Folded, False: 1]
  |  |  |  Branch (190:58): [True: 0, False: 1]
  |  |  ------------------
  ------------------
 1464|      0|    ReportSingleGroupTableGrowthToInfoz(common, infoz, new_hash);
 1465|      0|  }
 1466|      1|  return {new_ctrl + offset, new_element_target_slot};
 1467|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_18NextSlotEPvmm:
  123|      3|inline void* NextSlot(void* slot, size_t slot_size, size_t i = 1) {
  124|      3|  return reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(slot) +
  125|      3|                                 slot_size * i);
  126|      3|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_125SetCtrlInSingleGroupTableERKNS1_12CommonFieldsEmhm:
  383|      2|                                      size_t slot_size) {
  384|      2|  SetCtrlInSingleGroupTable(c, i, static_cast<ctrl_t>(h), slot_size);
  385|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_125SetCtrlInSingleGroupTableERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  373|      2|                                      size_t slot_size) {
  374|      2|  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  375|       |  ABSL_SWISSTABLE_ASSERT(is_single_group(c.capacity()));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  376|      2|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  377|      2|  ctrl_t* ctrl = c.control();
  378|      2|  ctrl[i] = h;
  379|      2|  ctrl[i + c.capacity() + 1] = h;
  380|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_115ValidateMaxSizeEmmm:
   67|      2|                     [[maybe_unused]] size_t slot_size) {
   68|       |  ABSL_SWISSTABLE_ASSERT(size <= MaxValidSize(key_size, slot_size));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
   69|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_132ResizeEmptyNonAllocatedTableImplERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmb:
  854|      2|                                      size_t new_capacity, bool force_infoz) {
  855|      2|  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(new_capacity));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  856|      2|  ABSL_SWISSTABLE_ASSERT(new_capacity > policy.soo_capacity());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  857|      2|  ABSL_SWISSTABLE_ASSERT(!force_infoz || policy.soo_enabled);
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  858|      2|  ABSL_SWISSTABLE_ASSERT(common.capacity() <= policy.soo_capacity());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  859|      2|  ABSL_SWISSTABLE_ASSERT(common.empty());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  860|      2|  const size_t slot_size = policy.slot_size;
  861|      2|  HashtablezInfoHandle infoz;
  862|      2|  const bool should_sample =
  863|      2|      policy.is_hashtablez_eligible && (force_infoz || ShouldSampleNextTable());
  ------------------
  |  Branch (863:7): [True: 2, False: 0]
  |  Branch (863:41): [True: 0, False: 2]
  |  Branch (863:56): [True: 0, False: 2]
  ------------------
  864|      2|  if (ABSL_PREDICT_FALSE(should_sample)) {
  ------------------
  |  |  190|      2|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 2]
  |  |  |  Branch (190:49): [Folded, False: 2]
  |  |  |  Branch (190:58): [True: 0, False: 2]
  |  |  ------------------
  ------------------
  865|      0|    infoz = ForcedTrySample(slot_size, policy.key_size, policy.value_size,
  866|      0|                            policy.soo_capacity());
  867|      0|  }
  868|      2|  ResizeNonSooImpl<ResizeNonSooMode::kGuaranteedEmpty>(common, policy,
  869|      2|                                                       new_capacity, infoz);
  870|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_116ResizeNonSooImplILNS2_16ResizeNonSooModeE0EEEvRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmNS1_20HashtablezInfoHandleE:
  801|      2|                      size_t new_capacity, HashtablezInfoHandle infoz) {
  802|      2|  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(new_capacity));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  803|      2|  ABSL_SWISSTABLE_ASSERT(new_capacity > policy.soo_capacity());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  804|       |
  805|      2|  [[maybe_unused]] const size_t old_capacity = common.capacity();
  806|      2|  [[maybe_unused]] ctrl_t* old_ctrl;
  807|      2|  [[maybe_unused]] void* old_slots;
  808|       |  if constexpr (kMode == ResizeNonSooMode::kGuaranteedAllocated) {
  809|       |    old_ctrl = common.control();
  810|       |    old_slots = common.slot_array();
  811|       |  }
  812|       |
  813|      2|  const size_t slot_size = policy.slot_size;
  814|      2|  [[maybe_unused]] const size_t slot_align = policy.slot_align;
  815|      2|  const bool has_infoz = infoz.IsSampled();
  816|      2|  void* alloc = policy.get_char_alloc(common);
  817|       |
  818|      2|  common.set_capacity(new_capacity);
  819|      2|  const auto [new_ctrl, new_slots] =
  820|      2|      AllocBackingArray(common, policy, new_capacity, has_infoz, alloc);
  821|      2|  common.set_control(new_ctrl);
  822|      2|  common.set_slots(new_slots);
  823|      2|  common.generate_new_seed(has_infoz);
  824|       |
  825|      2|  size_t total_probe_length = 0;
  826|      2|  ResetCtrl(common, slot_size);
  827|      2|  ABSL_SWISSTABLE_ASSERT(kMode != ResizeNonSooMode::kGuaranteedEmpty ||
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  828|      2|                         old_capacity == policy.soo_capacity());
  829|      2|  ABSL_SWISSTABLE_ASSERT(kMode != ResizeNonSooMode::kGuaranteedAllocated ||
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  830|      2|                         old_capacity > 0);
  831|       |  if constexpr (kMode == ResizeNonSooMode::kGuaranteedAllocated) {
  832|       |    total_probe_length = FindNewPositionsAndTransferSlots(
  833|       |        common, policy, old_ctrl, old_slots, old_capacity);
  834|       |    (*policy.dealloc)(alloc, old_capacity, old_ctrl, slot_size, slot_align,
  835|       |                      has_infoz);
  836|       |    if (HasGrowthInfoForCapacity(new_capacity)) {
  837|       |      ResetGrowthLeft(GetGrowthInfoFromControl(new_ctrl), new_capacity,
  838|       |                      common.size());
  839|       |    }
  840|      2|  } else {
  841|      2|    if (HasGrowthInfoForCapacity(new_capacity)) {
  ------------------
  |  Branch (841:9): [True: 2, False: 0]
  ------------------
  842|      2|      GetGrowthInfoFromControl(new_ctrl).InitGrowthLeftNoDeleted(
  843|      2|          CapacityToGrowth(new_capacity));
  844|      2|    }
  845|      2|  }
  846|       |
  847|      2|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|      2|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 2]
  |  |  |  Branch (190:49): [Folded, False: 2]
  |  |  |  Branch (190:58): [True: 0, False: 2]
  |  |  ------------------
  ------------------
  848|      0|    ReportResizeToInfoz(common, infoz, total_probe_length);
  849|      0|  }
  850|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_17SetCtrlERKNS1_12CommonFieldsEmhm:
  366|    545|inline void SetCtrl(const CommonFields& c, size_t i, h2_t h, size_t slot_size) {
  367|    545|  SetCtrl(c, i, static_cast<ctrl_t>(h), slot_size);
  368|    545|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_141ReserveEmptyNonAllocatedTableToFitNewSizeERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1704|      2|    size_t new_size) {
 1705|      2|  ValidateMaxSize(new_size, policy.key_size, policy.slot_size);
 1706|      2|  ABSL_ASSUME(new_size > 0);
  ------------------
  |  |  271|      2|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1707|      2|  ResizeEmptyNonAllocatedTableImpl(common, policy, SizeToCapacity(new_size),
 1708|      2|                                   /*force_infoz=*/false);
 1709|       |  // This is after resize, to ensure that we have completed the allocation
 1710|       |  // and have potentially sampled the hashtable.
 1711|      2|  common.infoz().RecordReservation(new_size);
 1712|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_122PrepareInsertLargeImplERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmNS1_18NonIterableBitMaskIjLi16ELi0EEENS1_8FindInfoE:
 1990|    552|                              FindInfo target_group) {
 1991|    552|  ABSL_SWISSTABLE_ASSERT(!common.is_small());
  ------------------
  |  |   62|    552|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1992|    552|  const GrowthInfo growth_info = common.growth_info();
 1993|       |  // When there are no deleted slots in the table
 1994|       |  // and growth_left is positive, we can insert at the first
 1995|       |  // empty slot in the probe sequence (target).
 1996|    552|  if (ABSL_PREDICT_FALSE(!growth_info.HasNoDeletedAndGrowthLeft())) {
  ------------------
  |  |  190|    552|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 7, False: 545]
  |  |  |  Branch (190:49): [Folded, False: 552]
  |  |  |  Branch (190:58): [True: 7, False: 545]
  |  |  ------------------
  ------------------
 1997|      7|    return PrepareInsertLargeSlow(common, policy, hash);
 1998|      7|  }
 1999|    545|  PrepareInsertCommon(common);
 2000|    545|  common.growth_info().OverwriteEmptyAsFull();
 2001|    545|  target_group.offset += mask_empty.LowestBitSet();
 2002|    545|  target_group.offset &= common.capacity();
 2003|    545|  SetCtrl(common, target_group.offset, H2(hash), policy.slot_size);
 2004|    545|  common.infoz().RecordInsertMiss(hash, target_group.probe_length);
 2005|    545|  return target_group.offset;
 2006|    552|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_122PrepareInsertLargeSlowERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1653|      7|                              size_t hash) {
 1654|      7|  const GrowthInfo growth_info = common.growth_info();
 1655|      7|  ABSL_SWISSTABLE_ASSERT(!growth_info.HasNoDeletedAndGrowthLeft());
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1656|      7|  if (ABSL_PREDICT_TRUE(growth_info.HasNoGrowthLeftAndNoDeleted())) {
  ------------------
  |  |  191|      7|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 7, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 7]
  |  |  |  Branch (191:57): [True: 7, False: 0]
  |  |  ------------------
  ------------------
 1657|       |    // Table without deleted slots (>95% cases) that needs to be resized.
 1658|      7|    ABSL_SWISSTABLE_ASSERT(growth_info.HasNoDeleted() &&
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1659|      7|                           growth_info.GetGrowthLeft() == 0);
 1660|      7|    return GrowToNextCapacityAndPrepareInsert(common, policy, hash);
 1661|      7|  }
 1662|      0|  if (ABSL_PREDICT_FALSE(growth_info.HasNoGrowthLeftAssumingMayHaveDeleted())) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1663|       |    // Table with deleted slots that needs to be rehashed or resized.
 1664|      0|    return RehashOrGrowToNextCapacityAndPrepareInsert(common, policy, hash);
 1665|      0|  }
 1666|       |  // Table with deleted slots that has space for the inserting element.
 1667|      0|  FindInfo target = find_first_non_full(common, hash);
 1668|      0|  PrepareInsertCommon(common);
 1669|      0|  common.growth_info().OverwriteControlAsFull(common.control()[target.offset]);
 1670|      0|  SetCtrlInLargeTable(common, target.offset, H2(hash), policy.slot_size);
 1671|      0|  common.infoz().RecordInsertMiss(hash, target.probe_length);
 1672|      0|  return target.offset;
 1673|      0|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_134GrowToNextCapacityAndPrepareInsertERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1473|      7|    size_t new_hash) {
 1474|      7|  ABSL_SWISSTABLE_ASSERT(common.growth_left() == 0);
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1475|      7|  const size_t old_capacity = common.capacity();
 1476|      7|  ABSL_SWISSTABLE_ASSERT(old_capacity > policy.soo_capacity());
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1477|      7|  ABSL_SWISSTABLE_ASSERT(!IsSmallCapacity(old_capacity));
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1478|       |
 1479|      7|  const size_t new_capacity = NextCapacity(old_capacity);
 1480|      7|  ctrl_t* old_ctrl = common.control();
 1481|      7|  void* old_slots = common.slot_array();
 1482|       |
 1483|      7|  common.set_capacity(new_capacity);
 1484|      7|  const size_t slot_size = policy.slot_size;
 1485|      7|  const size_t slot_align = policy.slot_align;
 1486|      7|  void* alloc = policy.get_char_alloc(common);
 1487|      7|  HashtablezInfoHandle infoz = common.infoz();
 1488|      7|  const bool has_infoz = infoz.IsSampled();
 1489|       |
 1490|      7|  const auto [new_ctrl, new_slots] =
 1491|      7|      AllocBackingArray(common, policy, new_capacity, has_infoz, alloc);
 1492|      7|  common.set_control(new_ctrl);
 1493|      7|  common.set_slots(new_slots);
 1494|      7|  SanitizerPoisonMemoryRegion(new_slots, new_capacity * slot_size);
 1495|       |
 1496|      7|  h2_t new_h2 = H2(new_hash);
 1497|      7|  size_t total_probe_length = 0;
 1498|      7|  FindInfo find_info;
 1499|      7|  if (ABSL_PREDICT_TRUE(is_single_group(new_capacity))) {
  ------------------
  |  |  191|      7|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 2, False: 5]
  |  |  |  Branch (191:48): [Folded, False: 7]
  |  |  |  Branch (191:57): [True: 2, False: 5]
  |  |  ------------------
  ------------------
 1500|      2|    size_t offset;
 1501|      2|    GrowIntoSingleGroupShuffleControlBytes(old_ctrl, old_capacity, new_ctrl,
 1502|      2|                                           new_capacity);
 1503|       |    // We put the new element either at the beginning or at the end of the
 1504|       |    // table with approximately equal probability.
 1505|      2|    offset =
 1506|      2|        SingleGroupTableH1(new_hash, common.seed()) & 1 ? 0 : new_capacity - 1;
  ------------------
  |  Branch (1506:9): [True: 0, False: 2]
  ------------------
 1507|       |
 1508|      2|    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[offset]));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1509|      2|    SetCtrlInSingleGroupTable(common, offset, new_h2, policy.slot_size);
 1510|      2|    find_info = FindInfo{offset, 0};
 1511|       |    // Single group tables have all slots full on resize. So we can transfer
 1512|       |    // all slots without checking the control bytes.
 1513|      2|    ABSL_SWISSTABLE_ASSERT(common.size() == old_capacity);
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1514|      2|    void* target = NextSlot(new_slots, slot_size);
 1515|      2|    SanitizerUnpoisonMemoryRegion(target, old_capacity * slot_size);
 1516|      2|    policy.transfer_n(&common, target, old_slots, old_capacity);
 1517|      5|  } else {
 1518|      5|    total_probe_length =
 1519|      5|        GrowToNextCapacityDispatch(common, policy, old_ctrl, old_slots);
 1520|      5|    find_info = find_first_non_full(common, new_hash);
 1521|      5|    SetCtrlInLargeTable(common, find_info.offset, new_h2, policy.slot_size);
 1522|      5|  }
 1523|      7|  ABSL_SWISSTABLE_ASSERT(old_capacity > policy.soo_capacity());
  ------------------
  |  |   62|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1524|      7|  (*policy.dealloc)(alloc, old_capacity, old_ctrl, slot_size, slot_align,
 1525|      7|                    has_infoz);
 1526|      7|  PrepareInsertCommon(common);
 1527|      7|  ResetGrowthLeft(GetGrowthInfoFromControl(new_ctrl), new_capacity,
 1528|      7|                  common.size());
 1529|       |
 1530|      7|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|      7|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 7]
  |  |  |  Branch (190:49): [Folded, False: 7]
  |  |  |  Branch (190:58): [True: 0, False: 7]
  |  |  ------------------
  ------------------
 1531|      0|    ReportGrowthToInfoz(common, infoz, new_hash, total_probe_length,
 1532|      0|                        find_info.probe_length);
 1533|      0|  }
 1534|      7|  return find_info.offset;
 1535|      7|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_138GrowIntoSingleGroupShuffleControlBytesEPNS1_6ctrl_tEmS4_m:
  957|      2|                                            size_t new_capacity) {
  958|      2|  ABSL_SWISSTABLE_ASSERT(is_single_group(new_capacity));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  959|      2|  constexpr size_t kHalfWidth = Group::kWidth / 2;
  960|      2|  ABSL_ASSUME(old_capacity < kHalfWidth);
  ------------------
  |  |  271|      2|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  961|      2|  ABSL_ASSUME(old_capacity > 0);
  ------------------
  |  |  271|      2|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  962|      2|  static_assert(Group::kWidth == 8 || Group::kWidth == 16,
  963|      2|                "Group size is not supported.");
  964|       |
  965|       |  // NOTE: operations are done with compile time known size = 8.
  966|       |  // Compiler optimizes that into single ASM operation.
  967|       |
  968|       |  // Load the bytes from old_capacity. This contains
  969|       |  // - the sentinel byte
  970|       |  // - all the old control bytes
  971|       |  // - the rest is filled with kEmpty bytes
  972|       |  // Example:
  973|       |  // old_ctrl =     012S012EEEEEEEEE...
  974|       |  // copied_bytes = S012EEEE
  975|      2|  uint64_t copied_bytes = absl::little_endian::Load64(old_ctrl + old_capacity);
  976|       |
  977|       |  // We change the sentinel byte to kEmpty before storing to both the start of
  978|       |  // the new_ctrl, and past the end of the new_ctrl later for the new cloned
  979|       |  // bytes. Note that this is faster than setting the sentinel byte to kEmpty
  980|       |  // after the copy directly in new_ctrl because we are limited on store
  981|       |  // bandwidth.
  982|      2|  static constexpr uint64_t kEmptyXorSentinel =
  983|      2|      static_cast<uint8_t>(ctrl_t::kEmpty) ^
  984|      2|      static_cast<uint8_t>(ctrl_t::kSentinel);
  985|       |
  986|       |  // Replace the first byte kSentinel with kEmpty.
  987|       |  // Resulting bytes will be shifted by one byte old control blocks.
  988|       |  // Example:
  989|       |  // old_ctrl = 012S012EEEEEEEEE...
  990|       |  // before =   S012EEEE
  991|       |  // after  =   E012EEEE
  992|      2|  copied_bytes ^= kEmptyXorSentinel;
  993|       |
  994|      2|  if (Group::kWidth == 8) {
  ------------------
  |  Branch (994:7): [Folded, False: 2]
  ------------------
  995|       |    // With group size 8, we can grow with two write operations.
  996|      0|    ABSL_SWISSTABLE_ASSERT(old_capacity < 8 &&
  ------------------
  |  |   62|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  997|      0|                           "old_capacity is too large for group size 8");
  998|      0|    absl::little_endian::Store64(new_ctrl, copied_bytes);
  999|       |
 1000|      0|    static constexpr uint64_t kSentinal64 =
 1001|      0|        static_cast<uint8_t>(ctrl_t::kSentinel);
 1002|       |
 1003|       |    // Prepend kSentinel byte to the beginning of copied_bytes.
 1004|       |    // We have maximum 3 non-empty bytes at the beginning of copied_bytes for
 1005|       |    // group size 8.
 1006|       |    // Example:
 1007|       |    // old_ctrl = 012S012EEEE
 1008|       |    // before =   E012EEEE
 1009|       |    // after  =   SE012EEE
 1010|      0|    copied_bytes = (copied_bytes << 8) ^ kSentinal64;
 1011|      0|    absl::little_endian::Store64(new_ctrl + new_capacity, copied_bytes);
 1012|       |    // Example for capacity 3:
 1013|       |    // old_ctrl = 012S012EEEE
 1014|       |    // After the first store:
 1015|       |    //           >!
 1016|       |    // new_ctrl = E012EEEE???????
 1017|       |    // After the second store:
 1018|       |    //                  >!
 1019|       |    // new_ctrl = E012EEESE012EEE
 1020|      0|    return;
 1021|      0|  }
 1022|       |
 1023|      2|  ABSL_SWISSTABLE_ASSERT(Group::kWidth == 16);  // NOLINT(misc-static-assert)
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1024|       |
 1025|       |  // Fill the second half of the main control bytes with kEmpty.
 1026|       |  // For small capacity that may write into mirrored control bytes.
 1027|       |  // It is fine as we will overwrite all the bytes later.
 1028|      2|  std::memset(new_ctrl + kHalfWidth, static_cast<int8_t>(ctrl_t::kEmpty),
 1029|      2|              kHalfWidth);
 1030|       |  // Fill the second half of the mirrored control bytes with kEmpty.
 1031|      2|  std::memset(new_ctrl + new_capacity + kHalfWidth,
 1032|      2|              static_cast<int8_t>(ctrl_t::kEmpty), kHalfWidth);
 1033|       |  // Copy the first half of the non-mirrored control bytes.
 1034|      2|  absl::little_endian::Store64(new_ctrl, copied_bytes);
 1035|      2|  new_ctrl[new_capacity] = ctrl_t::kSentinel;
 1036|       |  // Copy the first half of the mirrored control bytes.
 1037|      2|  absl::little_endian::Store64(new_ctrl + new_capacity + 1, copied_bytes);
 1038|       |
 1039|       |  // Example for growth capacity 1->3:
 1040|       |  // old_ctrl =                  0S0EEEEEEEEEEEEEE
 1041|       |  // new_ctrl at the end =       E0ESE0EEEEEEEEEEEEE
 1042|       |  //                                    >!
 1043|       |  // new_ctrl after 1st memset = ????????EEEEEEEE???
 1044|       |  //                                       >!
 1045|       |  // new_ctrl after 2nd memset = ????????EEEEEEEEEEE
 1046|       |  //                            >!
 1047|       |  // new_ctrl after 1st store =  E0EEEEEEEEEEEEEEEEE
 1048|       |  // new_ctrl after kSentinel =  E0ESEEEEEEEEEEEEEEE
 1049|       |  //                                >!
 1050|       |  // new_ctrl after 2nd store =  E0ESE0EEEEEEEEEEEEE
 1051|       |
 1052|       |  // Example for growth capacity 3->7:
 1053|       |  // old_ctrl =                  012S012EEEEEEEEEEEE
 1054|       |  // new_ctrl at the end =       E012EEESE012EEEEEEEEEEE
 1055|       |  //                                    >!
 1056|       |  // new_ctrl after 1st memset = ????????EEEEEEEE???????
 1057|       |  //                                           >!
 1058|       |  // new_ctrl after 2nd memset = ????????EEEEEEEEEEEEEEE
 1059|       |  //                            >!
 1060|       |  // new_ctrl after 1st store =  E012EEEEEEEEEEEEEEEEEEE
 1061|       |  // new_ctrl after kSentinel =  E012EEESEEEEEEEEEEEEEEE
 1062|       |  //                                >!
 1063|       |  // new_ctrl after 2nd store =  E012EEESE012EEEEEEEEEEE
 1064|       |
 1065|       |  // Example for growth capacity 7->15:
 1066|       |  // old_ctrl =                  0123456S0123456EEEEEEEE
 1067|       |  // new_ctrl at the end =       E0123456EEEEEEESE0123456EEEEEEE
 1068|       |  //                                    >!
 1069|       |  // new_ctrl after 1st memset = ????????EEEEEEEE???????????????
 1070|       |  //                                                   >!
 1071|       |  // new_ctrl after 2nd memset = ????????EEEEEEEE???????EEEEEEEE
 1072|       |  //                            >!
 1073|       |  // new_ctrl after 1st store =  E0123456EEEEEEEE???????EEEEEEEE
 1074|       |  // new_ctrl after kSentinel =  E0123456EEEEEEES???????EEEEEEEE
 1075|       |  //                                            >!
 1076|       |  // new_ctrl after 2nd store =  E0123456EEEEEEESE0123456EEEEEEE
 1077|      2|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_126GrowToNextCapacityDispatchERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1385|      5|                                  ctrl_t* old_ctrl, void* old_slots) {
 1386|      5|  const size_t new_capacity = common.capacity();
 1387|      5|  if (ABSL_PREDICT_TRUE(new_capacity <= kMaxLocalBufferNewCapacity)) {
  ------------------
  |  |  191|      5|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 4, False: 1]
  |  |  |  Branch (191:48): [Folded, False: 5]
  |  |  |  Branch (191:57): [True: 4, False: 1]
  |  |  ------------------
  ------------------
 1388|      4|    return GrowToNextCapacityThatFitsInLocalBuffer(common, policy, old_ctrl,
 1389|      4|                                                   old_slots);
 1390|      4|  } else {
 1391|      1|    return GrowToNextCapacityOverflowLocalBuffer(common, policy, old_ctrl,
 1392|      1|                                                 old_slots);
 1393|      1|  }
 1394|      5|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_139GrowToNextCapacityThatFitsInLocalBufferERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1335|      4|    ctrl_t* old_ctrl, void* old_slots) {
 1336|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= kMaxLocalBufferNewCapacity);
  ------------------
  |  |   62|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1337|      4|  return GrowToNextCapacity<
 1338|      4|      ProbedItemEncoder<ProbedItem4Bytes, /*kGuaranteedFitToBuffer=*/true>>(
 1339|      4|      common, policy, old_ctrl, old_slots);
 1340|      4|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1316|      4|                          ctrl_t* old_ctrl, void* old_slots) {
 1317|      4|  using ProbedItem = typename Encoder::ProbedItem;
 1318|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   62|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1319|      4|  Encoder encoder(old_ctrl);
 1320|      4|  policy.transfer_unprobed_elements_to_next_capacity(
 1321|      4|      common, old_ctrl, old_slots, &encoder,
 1322|      4|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1323|      4|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1324|      4|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1325|      4|      });
 1326|      4|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1327|      4|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1328|      4|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEC2EPNS1_6ctrl_tE:
 1190|      4|  explicit ProbedItemEncoder(ctrl_t* control) : control_(control) {}
raw_hash_set.cc:_ZZN4absl12lts_2026052618container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPvENKUlSF_hmmE_clESF_hmm:
 1322|      2|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1323|      2|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1324|      2|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1325|      2|      });
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EE10EncodeItemES5_:
 1193|      2|  void EncodeItem(ProbedItem item) {
 1194|      2|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|      2|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [Folded, False: 2]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:59): [Folded, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1195|      0|      return ProcessEncodeWithOverflow(item);
 1196|      0|    }
 1197|      2|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1198|      2|    *pos_ = item;
 1199|      2|    ++pos_;
 1200|      2|  }
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_130InitializeMirroredControlBytesEPNS1_6ctrl_tEm:
 1166|      5|void InitializeMirroredControlBytes(ctrl_t* new_ctrl, size_t new_capacity) {
 1167|      5|  std::memcpy(new_ctrl + new_capacity,
 1168|       |              // We own GrowthInfo just before control bytes. So it is ok
 1169|       |              // to read one byte from it.
 1170|      5|              new_ctrl - 1, Group::kWidth);
 1171|      5|  new_ctrl[new_capacity] = ctrl_t::kSentinel;
 1172|      5|}
raw_hash_set.cc:_ZNK4absl12lts_2026052618container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1207|      4|                                void* old_slots) const {
 1208|      4|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1208:9): [True: 3, False: 1]
  ------------------
 1209|      3|      return 0;
 1210|      3|    }
 1211|      1|    if constexpr (kGuaranteedFitToBuffer) {
 1212|      1|      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1213|      1|    }
 1214|      0|    size_t total_probe_length = DecodeAndInsertImpl(
 1215|      1|        common, policy, buffer_,
 1216|      1|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1216:9): [True: 0, False: 1]
  ------------------
 1217|      1|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1217:9): [True: 0, False: 1]
  ------------------
 1218|      0|      return total_probe_length;
 1219|      0|    }
 1220|      1|    total_probe_length +=
 1221|      1|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1222|      1|    return total_probe_length;
 1223|      1|  }
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119DecodeAndInsertImplINS1_14ProbedItemImplIjLm32EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPKT_SD_Pv:
 1089|      1|    const ProbedItem* start, const ProbedItem* end, void* old_slots) {
 1090|      1|  const HashtableCapacity new_capacity = c.capacity_impl();
 1091|       |
 1092|      1|  void* new_slots = c.slot_array();
 1093|      1|  ctrl_t* new_ctrl = c.control();
 1094|      1|  size_t total_probe_length = 0;
 1095|       |
 1096|      1|  const size_t slot_size = policy.slot_size;
 1097|      1|  auto transfer_n = policy.transfer_n;
 1098|       |
 1099|      3|  for (; start < end; ++start) {
  ------------------
  |  Branch (1099:10): [True: 2, False: 1]
  ------------------
 1100|      2|    const FindInfo target = find_first_non_full_from_h1(
 1101|      2|        new_ctrl, static_cast<size_t>(start->h1), new_capacity);
 1102|      2|    total_probe_length += target.probe_length;
 1103|      2|    const size_t old_index = static_cast<size_t>(start->source_offset);
 1104|      2|    const size_t new_i = target.offset;
 1105|      2|    ABSL_SWISSTABLE_ASSERT(old_index < new_capacity.capacity() / 2);
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1106|      2|    ABSL_SWISSTABLE_ASSERT(new_i < new_capacity.capacity());
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1107|       |    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_i]));
  ------------------
  |  |   62|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1108|      2|    void* src_slot = SlotAddress(old_slots, old_index, slot_size);
 1109|      2|    void* dst_slot = SlotAddress(new_slots, new_i, slot_size);
 1110|      2|    SanitizerUnpoisonMemoryRegion(dst_slot, slot_size);
 1111|      2|    transfer_n(&c, dst_slot, src_slot, 1);
 1112|      2|    SetCtrlInLargeTable(c, new_i, static_cast<h2_t>(start->h2), slot_size);
 1113|      2|  }
 1114|      1|  return total_probe_length;
 1115|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_127find_first_non_full_from_h1EPKNS1_6ctrl_tEmNS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEE:
  188|      7|                                     HashtableCapacity capacity) {
  189|      7|  auto seq = probe_h1(capacity, h1);
  190|      7|  if (IsEmptyOrDeleted(ctrl[seq.offset()])) {
  ------------------
  |  Branch (190:7): [True: 2, False: 5]
  ------------------
  191|      2|    return {seq.offset(), /*probe_length=*/0};
  192|      2|  }
  193|      5|  auto mask = probe_till_first_non_full_group(ctrl, seq, capacity.capacity());
  194|      5|  return {seq.offset(mask.LowestBitSet()), seq.index()};
  195|      7|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_131probe_till_first_non_full_groupEPKNS1_6ctrl_tERNS1_9probe_seqILm16EEEm:
  175|      5|    [[maybe_unused]] size_t capacity) {
  176|      5|  while (true) {
  ------------------
  |  Branch (176:10): [True: 5, Folded]
  ------------------
  177|      5|    GroupFullEmptyOrDeleted g{ctrl + seq.offset()};
  178|      5|    auto mask = g.MaskEmptyOrDeleted();
  179|      5|    if (mask) {
  ------------------
  |  Branch (179:9): [True: 5, False: 0]
  ------------------
  180|      5|      return mask;
  181|      5|    }
  182|      0|    seq.next();
  183|       |    ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity && "full table!");
  ------------------
  |  |   62|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  184|      0|  }
  185|      5|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_137GrowToNextCapacityOverflowLocalBufferERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1368|      1|    ctrl_t* old_ctrl, void* old_slots) {
 1369|      1|  const size_t new_capacity = common.capacity();
 1370|      1|  if (ABSL_PREDICT_TRUE(new_capacity <= ProbedItem4Bytes::kMaxNewCapacity)) {
  ------------------
  |  |  191|      1|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 1, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 1]
  |  |  |  Branch (191:57): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 1371|      1|    return GrowToNextCapacity4BytesEncoder(common, policy, old_ctrl, old_slots);
 1372|      1|  }
 1373|      0|  if (ABSL_PREDICT_TRUE(new_capacity <= ProbedItem8Bytes::kMaxNewCapacity)) {
  ------------------
  |  |  191|      0|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 0]
  |  |  |  Branch (191:57): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1374|      0|    return GrowToNextCapacity8BytesEncoder(common, policy, old_ctrl, old_slots);
 1375|      0|  }
 1376|       |  // 16 bytes encoding supports the maximum swisstable capacity.
 1377|      0|  return GrowToNextCapacity16BytesEncoder(common, policy, old_ctrl, old_slots);
 1378|      0|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_131GrowToNextCapacity4BytesEncoderERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1346|      1|                                       ctrl_t* old_ctrl, void* old_slots) {
 1347|      1|  return GrowToNextCapacity<ProbedItemEncoder<ProbedItem4Bytes>>(
 1348|      1|      common, policy, old_ctrl, old_slots);
 1349|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1316|      1|                          ctrl_t* old_ctrl, void* old_slots) {
 1317|      1|  using ProbedItem = typename Encoder::ProbedItem;
 1318|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   62|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1319|      1|  Encoder encoder(old_ctrl);
 1320|      1|  policy.transfer_unprobed_elements_to_next_capacity(
 1321|      1|      common, old_ctrl, old_slots, &encoder,
 1322|      1|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1323|      1|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1324|      1|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1325|      1|      });
 1326|      1|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1327|      1|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1328|      1|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEC2EPNS1_6ctrl_tE:
 1190|      1|  explicit ProbedItemEncoder(ctrl_t* control) : control_(control) {}
raw_hash_set.cc:_ZNK4absl12lts_2026052618container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1207|      1|                                void* old_slots) const {
 1208|      1|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1208:9): [True: 1, False: 0]
  ------------------
 1209|      1|      return 0;
 1210|      1|    }
 1211|       |    if constexpr (kGuaranteedFitToBuffer) {
 1212|       |      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1213|       |    }
 1214|      0|    size_t total_probe_length = DecodeAndInsertImpl(
 1215|      0|        common, policy, buffer_,
 1216|      0|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1216:9): [True: 0, False: 0]
  ------------------
 1217|      0|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1217:9): [True: 0, False: 0]
  ------------------
 1218|      0|      return total_probe_length;
 1219|      0|    }
 1220|      0|    total_probe_length +=
 1221|      0|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1222|      0|    return total_probe_length;
 1223|      0|  }
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119find_first_non_fullERKNS1_12CommonFieldsEm:
  204|      5|FindInfo find_first_non_full(const CommonFields& common, size_t hash) {
  205|      5|  return find_first_non_full_from_h1(common.control(), H1(hash),
  206|      5|                                     common.capacity_impl());
  207|      5|}
raw_hash_set.cc:_ZN4absl12lts_2026052618container_internal12_GLOBAL__N_119SetCtrlInLargeTableERKNS1_12CommonFieldsEmhm:
  399|      7|                                size_t slot_size) {
  400|      7|  SetCtrlInLargeTable(c, i, static_cast<ctrl_t>(h), slot_size);
  401|      7|}

_ZN4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled36maybe_increment_generation_on_insertEv:
  838|    554|  void maybe_increment_generation_on_insert() {}
_ZN4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled21reset_reserved_growthEmm:
  840|      2|  void reset_reserved_growth(size_t, size_t) {}
_ZNK4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled10generationEv:
  845|     11|  GenerationType generation() const { return 0; }
_ZN4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled14set_generationEh:
  846|     11|  void set_generation(GenerationType) {}
_ZN4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled18set_generation_ptrEPh:
  848|     11|  void set_generation_ptr(GenerationType*) {}
_ZN4absl12lts_2026052618container_internal10GrowthInfo23InitGrowthLeftNoDeletedEm:
  914|     11|  void InitGrowthLeftNoDeleted(size_t growth_left) {
  915|     11|    growth_left_info_ = growth_left;
  916|     11|  }
_ZN4absl12lts_2026052618container_internal10GrowthInfo20OverwriteEmptyAsFullEv:
  922|    545|  void OverwriteEmptyAsFull() {
  923|       |    ABSL_SWISSTABLE_ASSERT(GetGrowthLeft() > 0);
  ------------------
  |  |  256|    545|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  924|    545|    --growth_left_info_;
  925|    545|  }
_ZNK4absl12lts_2026052618container_internal10GrowthInfo25HasNoDeletedAndGrowthLeftEv:
  946|    552|  bool HasNoDeletedAndGrowthLeft() const {
  947|    552|    return static_cast<std::make_signed_t<size_t>>(growth_left_info_) > 0;
  948|    552|  }
_ZNK4absl12lts_2026052618container_internal10GrowthInfo27HasNoGrowthLeftAndNoDeletedEv:
  953|      7|  bool HasNoGrowthLeftAndNoDeleted() const { return growth_left_info_ == 0; }
_ZN4absl12lts_2026052618container_internal16RawHashSetLayoutC2Emmmb:
 1020|     19|            ControlOffset(has_infoz, HasGrowthInfoForCapacity(capacity))),
 1021|     19|        generation_offset_(control_offset_ + NumControlBytes(capacity)),
 1022|       |        slot_offset_(
 1023|     19|            AlignUpTo(generation_offset_ + NumGenerationBytes(), slot_align)),
 1024|     19|        alloc_size_(slot_offset_ + capacity * slot_size) {
 1025|     19|    ABSL_SWISSTABLE_ASSERT(IsValidCapacity(capacity));
  ------------------
  |  |  256|     19|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1026|       |    ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |  256|     19|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1027|     19|        slot_size <=
 1028|     19|        ((std::numeric_limits<size_t>::max)() - slot_offset_) / capacity);
 1029|     19|  }
_ZNK4absl12lts_2026052618container_internal16RawHashSetLayout14control_offsetEv:
 1033|     19|  size_t control_offset() const { return control_offset_; }
_ZNK4absl12lts_2026052618container_internal16RawHashSetLayout17generation_offsetEv:
 1037|     11|  size_t generation_offset() const { return generation_offset_; }
_ZNK4absl12lts_2026052618container_internal16RawHashSetLayout11slot_offsetEv:
 1041|     11|  size_t slot_offset() const { return slot_offset_; }
_ZNK4absl12lts_2026052618container_internal16RawHashSetLayout10alloc_sizeEv:
 1045|     27|  size_t alloc_size() const { return alloc_size_; }
_ZN4absl12lts_2026052618container_internal9HeapOrSoo7controlEv:
 1088|     11|  MaybeInitializedPtr<ctrl_t>& control() {
 1089|     11|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.control);
  ------------------
  |  |  488|     11|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1090|     11|  }
_ZN4absl12lts_2026052618container_internal9HeapOrSoo10slot_arrayEv:
 1094|     11|  MaybeInitializedPtr<void>& slot_array() {
 1095|     11|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.slot_array);
  ------------------
  |  |  488|     11|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1096|     11|  }
_ZN4absl12lts_2026052618container_internal12CommonFields11set_controlEPNS1_6ctrl_tE:
 1170|     11|  void set_control(ctrl_t* c) { heap_or_soo_.control().set(c); }
_ZN4absl12lts_2026052618container_internal12CommonFields9set_slotsEPv:
 1177|     11|  void set_slots(void* s) { heap_or_soo_.slot_array().set(s); }
_ZN4absl12lts_2026052618container_internal12CommonFields16set_size_to_zeroEv:
 1182|      1|  void set_size_to_zero() { inline_data_.set_size(0); }
_ZN4absl12lts_2026052618container_internal12CommonFields14increment_sizeEv:
 1191|    554|  void increment_size() {
 1192|       |    ABSL_SWISSTABLE_ASSERT(size() < capacity());
  ------------------
  |  |  256|    554|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1193|    554|    inline_data_.increment_size();
 1194|    554|  }
_ZNK4absl12lts_2026052618container_internal12CommonFields5emptyEv:
 1203|      3|  bool empty() const { return inline_data_.empty(); }
_ZN4absl12lts_2026052618container_internal12CommonFields17generate_new_seedEb:
 1216|      3|  void generate_new_seed(bool has_infoz) {
 1217|       |    // Note: we can't use has_infoz() here because we set has_infoz later than
 1218|       |    // we generate the seed.
 1219|      3|    if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|      3|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 3]
  |  |  |  Branch (190:49): [Folded, False: 3]
  |  |  |  Branch (190:58): [True: 0, False: 3]
  |  |  ------------------
  ------------------
 1220|      0|      inline_data_.set_sampled_seed();
 1221|      0|      return;
 1222|      0|    }
 1223|      3|    inline_data_.generate_new_seed();
 1224|      3|  }
_ZN4absl12lts_2026052618container_internal12CommonFields12set_capacityENS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEE:
 1238|     11|  void set_capacity(HashtableCapacity c) { inline_data_.set_capacity(c); }
_ZN4absl12lts_2026052618container_internal12CommonFields12set_capacityEm:
 1239|     11|  void set_capacity(size_t c) {
 1240|     11|    set_capacity(HashtableCapacity(c));
 1241|     11|  }
_ZN4absl12lts_2026052618container_internal12CommonFields11growth_infoEv:
 1250|  1.10k|  GrowthInfo& growth_info() {
 1251|       |    ABSL_SWISSTABLE_ASSERT(HasGrowthInfoForCapacity(capacity()));
  ------------------
  |  |  256|  1.10k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1252|  1.10k|    return GetGrowthInfoFromControl(control());
 1253|  1.10k|  }
_ZN4absl12lts_2026052618container_internal12CommonFields21reset_reserved_growthEm:
 1296|      2|  void reset_reserved_growth(size_t reservation) {
 1297|      2|    CommonFieldsGenerationInfo::reset_reserved_growth(reservation, size());
 1298|      2|  }
_ZNK4absl12lts_2026052618container_internal15PolicyFunctions12soo_capacityEv:
 1788|      2|  uint8_t soo_capacity() const {
 1789|      2|    return static_cast<uint8_t>(soo_enabled ? SooCapacity() : 0);
  ------------------
  |  Branch (1789:33): [True: 0, False: 2]
  ------------------
 1790|      2|  }
_ZN4absl12lts_2026052618container_internal23SentinelEmptyGenerationEv:
  264|     11|constexpr GenerationType SentinelEmptyGeneration() { return 0; }
_ZN4absl12lts_2026052618container_internal14NextGenerationEh:
  266|     11|constexpr GenerationType NextGeneration(GenerationType generation) {
  267|     11|  return ++generation == SentinelEmptyGeneration() ? ++generation : generation;
  ------------------
  |  Branch (267:10): [True: 0, False: 11]
  ------------------
  268|     11|}
_ZN4absl12lts_2026052618container_internal18NumGenerationBytesEv:
  275|     19|constexpr size_t NumGenerationBytes() { return 0; }
_ZN4absl12lts_2026052618container_internal12NextCapacityEm:
  394|      7|constexpr size_t NextCapacity(size_t n) {
  395|       |  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(n) || n == 0);
  ------------------
  |  |  256|      7|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  396|      7|  return n * 2 + 1;
  397|      7|}
_ZN4absl12lts_2026052618container_internal9AlignUpToEmm:
 1010|     19|constexpr size_t AlignUpTo(size_t offset, size_t align) {
 1011|     19|  return (offset + align - 1) & (~align + 1);
 1012|     19|}
_ZN4absl12lts_2026052618container_internal24GetGrowthInfoFromControlEPNS1_6ctrl_tE:
 1113|  1.11k|inline GrowthInfo& GetGrowthInfoFromControl(ctrl_t* control) {
 1114|  1.11k|  auto* gl_ptr = reinterpret_cast<GrowthInfo*>(control) - 1;
 1115|       |  ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |  256|  1.11k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1116|  1.11k|      reinterpret_cast<uintptr_t>(gl_ptr) % alignof(GrowthInfo) == 0);
 1117|  1.11k|  return *gl_ptr;
 1118|  1.11k|}
_ZN4absl12lts_2026052618container_internal15is_single_groupEm:
 1571|      7|constexpr bool is_single_group(size_t capacity) {
 1572|      7|  return capacity <= Group::kWidth;
 1573|      7|}
_ZN4absl12lts_2026052618container_internal12SooSlotIndexEv:
 1848|      1|constexpr size_t SooSlotIndex() { return 1; }
_ZN4absl12lts_2026052618container_internal19MaybeInitializedPtrINS1_6ctrl_tEE3setEPS3_:
 1061|     11|  void set(T* ptr) { p = ptr; }
_ZN4absl12lts_2026052618container_internal19MaybeInitializedPtrIvE3setEPv:
 1061|     11|  void set(T* ptr) { p = ptr; }
_ZN4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE14increment_sizeEv:
  646|    554|  void increment_size() { data_ += kSizeOneNoMetadata; }
_ZNK4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE5emptyEv:
  652|      3|  bool empty() const { return data_ < kSizeOneNoMetadata; }
_ZN4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8set_seedEh:
  712|      3|  void set_seed(typename PerTableSeed::IntType seed) {
  713|      3|    data_ = (data_ & ~kSeedMask) | seed;
  714|      3|  }
_ZN4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE17generate_new_seedEv:
  670|      3|  void generate_new_seed() {
  671|      3|    set_seed(static_cast<typename PerTableSeed::IntType>(NextHashTableSeed()));
  672|      3|  }
_ZN4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE12set_capacityENS1_21HashtableCapacityImplILS3_1EEE:
  641|     11|  void set_capacity(HashtableCapacity c) { capacity_internal_ = c.ToRawData(); }
_ZN4absl12lts_2026052618container_internal20AllocateBackingArrayILm8ENSt3__19allocatorIcEEEEPvS6_m:
 1722|     11|void* AllocateBackingArray(void* alloc, size_t n) {
 1723|     11|  return Allocate<AlignOfBackingArray>(static_cast<Alloc*>(alloc), n);
 1724|     11|}
_ZN4absl12lts_2026052618container_internal22DeallocateBackingArrayILm8ENSt3__19allocatorIcEEEEvPvmPNS1_6ctrl_tEmmb:
 1731|      8|    size_t slot_align, bool had_infoz) {
 1732|      8|  RawHashSetLayout layout(capacity, slot_size, slot_align, had_infoz);
 1733|      8|  void* backing_array = ctrl - layout.control_offset();
 1734|       |  // Unpoison before returning the memory to the allocator.
 1735|      8|  SanitizerUnpoisonMemoryRegion(backing_array, layout.alloc_size());
 1736|      8|  Deallocate<AlignOfBackingArray>(static_cast<Alloc*>(alloc), backing_array,
 1737|      8|                                  layout.alloc_size());
 1738|      8|}

_ZN4absl12lts_2026052618container_internal14ProbedItemImplIjLm32EEC2Ehmm:
   59|      2|      : h2(h2_arg),
   60|      2|        source_offset(static_cast<IntType>(source_offset_arg)),
   61|      2|        h1(static_cast<IntType>(h1_arg)) {}

_ZNK4absl12lts_2026052611FunctionRefIFmmEEclEm:
  164|      1|  R operator()(Args... args) const {
  165|      1|    return invoker_(ptr_, std::forward<Args>(args)...);
  166|      1|  }

_ZNK4absl12lts_202605266Status2okEv:
  942|     29|inline bool Status::ok() const {
  943|     29|  return rep_ == CodeToInlinedRep(absl::StatusCode::kOk);
  944|     29|}
_ZN4absl12lts_202605266Status16CodeToInlinedRepENS0_10StatusCodeE:
 1018|     60|constexpr uintptr_t Status::CodeToInlinedRep(absl::StatusCode code) {
 1019|     60|  return (static_cast<uintptr_t>(code) << 2) + 1;
 1020|     60|}
_ZN4absl12lts_202605266StatusD2Ev:
  940|     29|inline Status::~Status() { Unref(rep_); }
_ZN4absl12lts_202605266Status5UnrefEm:
 1046|     29|inline void Status::Unref(uintptr_t rep) {
 1047|     29|  if (!IsInlined(rep)) RepToPointer(rep)->Unref();
  ------------------
  |  Branch (1047:7): [True: 0, False: 29]
  ------------------
 1048|     29|}
_ZN4absl12lts_202605266Status9IsInlinedEm:
 1014|     48|constexpr bool Status::IsInlined(uintptr_t rep) { return (rep & 1) != 0; }

_ZN4absl12lts_2026052619str_format_internal13ConvertIntArgIiEEbT_NS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  349|    256|bool ConvertIntArg(T v, FormatConversionSpecImpl conv, FormatSinkImpl *sink) {
  350|    256|  using U = typename MakeUnsigned<T>::type;
  351|    256|  IntDigits as_digits;
  352|       |
  353|       |  // This odd casting is due to a bug in -Wswitch behavior in gcc49 which causes
  354|       |  // it to complain about a switch/case type mismatch, even though both are
  355|       |  // FormatConversionChar.  Likely this is because at this point
  356|       |  // FormatConversionChar is declared, but not defined.
  357|    256|  switch (static_cast<uint8_t>(conv.conversion_char())) {
  358|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::c):
  ------------------
  |  Branch (358:5): [True: 0, False: 256]
  ------------------
  359|      0|      return (std::is_same<T, wchar_t>::value ||
  ------------------
  |  Branch (359:15): [Folded, False: 0]
  ------------------
  360|      0|              (conv.length_mod() == LengthMod::l))
  ------------------
  |  Branch (360:15): [True: 0, False: 0]
  ------------------
  361|      0|                 ? ConvertWCharTImpl(static_cast<wchar_t>(v), conv, sink)
  362|      0|                 : ConvertCharImpl(static_cast<char>(v), conv, sink);
  363|       |
  364|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::o):
  ------------------
  |  Branch (364:5): [True: 0, False: 256]
  ------------------
  365|      0|      as_digits.PrintAsOct(static_cast<U>(v));
  366|      0|      break;
  367|       |
  368|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::x):
  ------------------
  |  Branch (368:5): [True: 0, False: 256]
  ------------------
  369|      0|      as_digits.PrintAsHexLower(static_cast<U>(v));
  370|      0|      break;
  371|    256|    case static_cast<uint8_t>(FormatConversionCharInternal::X):
  ------------------
  |  Branch (371:5): [True: 256, False: 0]
  ------------------
  372|    256|      as_digits.PrintAsHexUpper(static_cast<U>(v));
  373|    256|      break;
  374|       |
  375|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::u):
  ------------------
  |  Branch (375:5): [True: 0, False: 256]
  ------------------
  376|      0|      as_digits.PrintAsDec(static_cast<U>(v));
  377|      0|      break;
  378|       |
  379|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::d):
  ------------------
  |  Branch (379:5): [True: 0, False: 256]
  ------------------
  380|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::i):
  ------------------
  |  Branch (380:5): [True: 0, False: 256]
  ------------------
  381|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::v):
  ------------------
  |  Branch (381:5): [True: 0, False: 256]
  ------------------
  382|      0|      as_digits.PrintAsDec(v);
  383|      0|      break;
  384|       |
  385|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::a):
  ------------------
  |  Branch (385:5): [True: 0, False: 256]
  ------------------
  386|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::e):
  ------------------
  |  Branch (386:5): [True: 0, False: 256]
  ------------------
  387|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::f):
  ------------------
  |  Branch (387:5): [True: 0, False: 256]
  ------------------
  388|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::g):
  ------------------
  |  Branch (388:5): [True: 0, False: 256]
  ------------------
  389|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::A):
  ------------------
  |  Branch (389:5): [True: 0, False: 256]
  ------------------
  390|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::E):
  ------------------
  |  Branch (390:5): [True: 0, False: 256]
  ------------------
  391|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::F):
  ------------------
  |  Branch (391:5): [True: 0, False: 256]
  ------------------
  392|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::G):
  ------------------
  |  Branch (392:5): [True: 0, False: 256]
  ------------------
  393|      0|      return ConvertFloatImpl(static_cast<double>(v), conv, sink);
  394|       |
  395|      0|    default:
  ------------------
  |  Branch (395:5): [True: 0, False: 256]
  ------------------
  396|      0|      ABSL_ASSUME(false);
  ------------------
  |  |  271|      0|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  397|    256|  }
  398|       |
  399|    256|  if (conv.is_basic()) {
  ------------------
  |  Branch (399:7): [True: 0, False: 256]
  ------------------
  400|      0|    sink->Append(as_digits.with_neg_and_zero());
  401|      0|    return true;
  402|      0|  }
  403|    256|  return ConvertIntImplInnerSlow(as_digits, conv, sink);
  404|    256|}
_ZN4absl12lts_2026052619str_format_internal17FormatConvertImplEiNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  569|    256|                                        FormatSinkImpl *sink) {
  570|    256|  return {ConvertIntArg(v, conv, sink)};
  571|    256|}
arg.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_113ReducePaddingEmPm:
   53|    256|void ReducePadding(size_t n, size_t *capacity) {
   54|    256|  *capacity = Excess(n, *capacity);
   55|    256|}
arg.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_123ConvertIntImplInnerSlowERKNS2_9IntDigitsENS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  238|    256|                             FormatSinkImpl *sink) {
  239|       |  // Print as a sequence of Substrings:
  240|       |  //   [left_spaces][sign][base_indicator][zeroes][formatted][right_spaces]
  241|    256|  size_t fill = 0;
  242|    256|  if (conv.width() >= 0)
  ------------------
  |  Branch (242:7): [True: 256, False: 0]
  ------------------
  243|    256|    fill = static_cast<size_t>(conv.width());
  244|       |
  245|    256|  string_view formatted = as_digits.without_neg_or_zero();
  246|    256|  ReducePadding(formatted, &fill);
  247|       |
  248|    256|  string_view sign = SignColumn(as_digits.is_negative(), conv);
  249|    256|  ReducePadding(sign, &fill);
  250|       |
  251|    256|  string_view base_indicator = BaseIndicator(as_digits, conv);
  252|    256|  ReducePadding(base_indicator, &fill);
  253|       |
  254|    256|  bool precision_specified = conv.precision() >= 0;
  255|    256|  size_t precision =
  256|    256|      precision_specified ? static_cast<size_t>(conv.precision()) : size_t{1};
  ------------------
  |  Branch (256:7): [True: 0, False: 256]
  ------------------
  257|       |
  258|    256|  if (conv.has_alt_flag() &&
  ------------------
  |  Branch (258:7): [True: 0, False: 256]
  ------------------
  259|      0|      conv.conversion_char() == FormatConversionCharInternal::o) {
  ------------------
  |  Branch (259:7): [True: 0, False: 0]
  ------------------
  260|       |    // From POSIX description of the '#' (alt) flag:
  261|       |    //   "For o conversion, it increases the precision (if necessary) to
  262|       |    //   force the first digit of the result to be zero."
  263|      0|    if (formatted.empty() || *formatted.begin() != '0') {
  ------------------
  |  Branch (263:9): [True: 0, False: 0]
  |  Branch (263:30): [True: 0, False: 0]
  ------------------
  264|      0|      size_t needed = formatted.size() + 1;
  265|      0|      precision = std::max(precision, needed);
  266|      0|    }
  267|      0|  }
  268|       |
  269|    256|  size_t num_zeroes = Excess(formatted.size(), precision);
  270|    256|  ReducePadding(num_zeroes, &fill);
  271|       |
  272|    256|  size_t num_left_spaces = !conv.has_left_flag() ? fill : 0;
  ------------------
  |  Branch (272:28): [True: 256, False: 0]
  ------------------
  273|    256|  size_t num_right_spaces = conv.has_left_flag() ? fill : 0;
  ------------------
  |  Branch (273:29): [True: 0, False: 256]
  ------------------
  274|       |
  275|       |  // From POSIX description of the '0' (zero) flag:
  276|       |  //   "For d, i, o, u, x, and X conversion specifiers, if a precision
  277|       |  //   is specified, the '0' flag is ignored."
  278|    256|  if (!precision_specified && conv.has_zero_flag()) {
  ------------------
  |  Branch (278:7): [True: 256, False: 0]
  |  Branch (278:31): [True: 256, False: 0]
  ------------------
  279|    256|    num_zeroes += num_left_spaces;
  280|    256|    num_left_spaces = 0;
  281|    256|  }
  282|       |
  283|    256|  sink->Append(num_left_spaces, ' ');
  284|    256|  sink->Append(sign);
  285|    256|  sink->Append(base_indicator);
  286|    256|  sink->Append(num_zeroes, '0');
  287|    256|  sink->Append(formatted);
  288|    256|  sink->Append(num_right_spaces, ' ');
  289|    256|  return true;
  290|    256|}
arg.cc:_ZNK4absl12lts_2026052619str_format_internal12_GLOBAL__N_19IntDigits19without_neg_or_zeroEv:
  178|    256|  string_view without_neg_or_zero() const {
  179|    256|    static_assert('-' < '0', "The check below verifies both.");
  180|    256|    size_t advance = start_[0] <= '0' ? 1 : 0;
  ------------------
  |  Branch (180:22): [True: 1, False: 255]
  ------------------
  181|    256|    return {start_ + advance, size_ - advance};
  182|    256|  }
arg.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_113ReducePaddingENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEPm:
   48|    768|void ReducePadding(string_view s, size_t *capacity) {
   49|    768|  *capacity = Excess(s.size(), *capacity);
   50|    768|}
arg.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_110SignColumnEbNS1_24FormatConversionSpecImplE:
  213|    256|string_view SignColumn(bool neg, const FormatConversionSpecImpl conv) {
  214|    256|  if (conv.conversion_char() == FormatConversionCharInternal::d ||
  ------------------
  |  Branch (214:7): [True: 0, False: 256]
  ------------------
  215|    256|      conv.conversion_char() == FormatConversionCharInternal::i) {
  ------------------
  |  Branch (215:7): [True: 0, False: 256]
  ------------------
  216|      0|    if (neg) return "-";
  ------------------
  |  Branch (216:9): [True: 0, False: 0]
  ------------------
  217|      0|    if (conv.has_show_pos_flag()) return "+";
  ------------------
  |  Branch (217:9): [True: 0, False: 0]
  ------------------
  218|      0|    if (conv.has_sign_col_flag()) return " ";
  ------------------
  |  Branch (218:9): [True: 0, False: 0]
  ------------------
  219|      0|  }
  220|    256|  return {};
  221|    256|}
arg.cc:_ZNK4absl12lts_2026052619str_format_internal12_GLOBAL__N_19IntDigits11is_negativeEv:
  184|    256|  bool is_negative() const { return start_[0] == '-'; }
arg.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_113BaseIndicatorERKNS2_9IntDigitsENS1_24FormatConversionSpecImplE:
  196|    256|                          const FormatConversionSpecImpl conv) {
  197|       |  // always show 0x for %p.
  198|    256|  bool alt = conv.has_alt_flag() ||
  ------------------
  |  Branch (198:14): [True: 0, False: 256]
  ------------------
  199|    256|             conv.conversion_char() == FormatConversionCharInternal::p;
  ------------------
  |  Branch (199:14): [True: 0, False: 256]
  ------------------
  200|    256|  bool hex = (conv.conversion_char() == FormatConversionCharInternal::x ||
  ------------------
  |  Branch (200:15): [True: 0, False: 256]
  ------------------
  201|    256|              conv.conversion_char() == FormatConversionCharInternal::X ||
  ------------------
  |  Branch (201:15): [True: 256, False: 0]
  ------------------
  202|      0|              conv.conversion_char() == FormatConversionCharInternal::p);
  ------------------
  |  Branch (202:15): [True: 0, False: 0]
  ------------------
  203|       |  // From the POSIX description of '#' flag:
  204|       |  //   "For x or X conversion specifiers, a non-zero result shall have
  205|       |  //   0x (or 0X) prefixed to it."
  206|    256|  if (alt && hex && !as_digits.without_neg_or_zero().empty()) {
  ------------------
  |  Branch (206:7): [True: 0, False: 256]
  |  Branch (206:7): [True: 0, False: 256]
  |  Branch (206:14): [True: 0, False: 0]
  |  Branch (206:21): [True: 0, False: 0]
  ------------------
  207|      0|    return conv.conversion_char() == FormatConversionCharInternal::X ? "0X"
  ------------------
  |  Branch (207:12): [True: 0, False: 0]
  ------------------
  208|      0|                                                                     : "0x";
  209|      0|  }
  210|    256|  return {};
  211|    256|}
arg.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_19IntDigits15PrintAsHexUpperIjEEvT_:
  159|    256|  void PrintAsHexUpper(T v) {
  160|    256|    static_assert(!IsSigned<T>::value, "");
  161|    256|    char *p = storage_ + sizeof(storage_);
  162|       |
  163|       |    // kHexTable is only lowercase, so do it manually for uppercase.
  164|    496|    do {
  165|    496|      *--p = "0123456789ABCDEF"[static_cast<size_t>(v) & 15];
  166|    496|      v >>= 4;
  167|    496|    } while (v);
  ------------------
  |  Branch (167:14): [True: 240, False: 256]
  ------------------
  168|    256|    start_ = p;
  169|    256|    size_ = static_cast<size_t>(storage_ + sizeof(storage_) - p);
  170|    256|  }

_ZN4absl12lts_2026052619str_format_internal19FormatArgImplFriend7ConvertINS1_13FormatArgImplEEEbT_NS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  409|    256|                      FormatSinkImpl* out) {
  410|    256|    return arg.dispatcher_(arg.data_, conv, out);
  411|    256|  }

_ZN4absl12lts_2026052619str_format_internal13FormatUntypedENS1_17FormatRawSinkImplENS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEE:
  214|    256|                   absl::Span<const FormatArgImpl> args) {
  215|    256|  FormatSinkImpl sink(raw_sink);
  216|    256|  using Converter = DefaultConverter;
  217|    256|  return ConvertAll(format, args, Converter(&sink));
  218|    256|}
_ZN4absl12lts_2026052619str_format_internal10FormatPackENS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEE:
  235|    256|                       absl::Span<const FormatArgImpl> args) {
  236|    256|  std::string out;
  237|    256|  if (ABSL_PREDICT_FALSE(!FormatUntyped(&out, format, args))) {
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  238|      0|    out.clear();
  239|      0|  }
  240|    256|  return out;
  241|    256|}
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_110ArgContextC2ENS0_4SpanIKNS1_13FormatArgImplEEE:
   55|    256|  explicit ArgContext(absl::Span<const FormatArgImpl> pack) : pack_(pack) {}
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_110ArgContext4BindEPKNS1_17UnboundConversionEPNS1_15BoundConversionE:
   70|    256|                             BoundConversion* bound) {
   71|    256|  const FormatArgImpl* arg = nullptr;
   72|    256|  int arg_position = unbound->arg_position;
   73|    256|  if (static_cast<size_t>(arg_position - 1) >= pack_.size()) return false;
  ------------------
  |  Branch (73:7): [True: 0, False: 256]
  ------------------
   74|    256|  arg = &pack_[static_cast<size_t>(arg_position - 1)];  // 1-based
   75|       |
   76|    256|  if (unbound->flags != Flags::kBasic) {
  ------------------
  |  Branch (76:7): [True: 256, False: 0]
  ------------------
   77|    256|    int width = unbound->width.value();
   78|    256|    bool force_left = false;
   79|    256|    if (unbound->width.is_from_arg()) {
  ------------------
  |  Branch (79:9): [True: 0, False: 256]
  ------------------
   80|      0|      if (!BindFromPosition(unbound->width.get_from_arg(), &width, pack_))
  ------------------
  |  Branch (80:11): [True: 0, False: 0]
  ------------------
   81|      0|        return false;
   82|      0|      if (width < 0) {
  ------------------
  |  Branch (82:11): [True: 0, False: 0]
  ------------------
   83|       |        // "A negative field width is taken as a '-' flag followed by a
   84|       |        // positive field width."
   85|      0|        force_left = true;
   86|       |        // Make sure we don't overflow the width when negating it.
   87|      0|        width = -std::max(width, -std::numeric_limits<int>::max());
   88|      0|      }
   89|      0|    }
   90|       |
   91|    256|    int precision = unbound->precision.value();
   92|    256|    if (unbound->precision.is_from_arg()) {
  ------------------
  |  Branch (92:9): [True: 0, False: 256]
  ------------------
   93|      0|      if (!BindFromPosition(unbound->precision.get_from_arg(), &precision,
  ------------------
  |  Branch (93:11): [True: 0, False: 0]
  ------------------
   94|      0|                            pack_))
   95|      0|        return false;
   96|      0|    }
   97|       |
   98|    256|    FormatConversionSpecImplFriend::SetWidth(width, bound);
   99|    256|    FormatConversionSpecImplFriend::SetPrecision(precision, bound);
  100|       |
  101|    256|    if (force_left) {
  ------------------
  |  Branch (101:9): [True: 0, False: 256]
  ------------------
  102|      0|      FormatConversionSpecImplFriend::SetFlags(unbound->flags | Flags::kLeft,
  103|      0|                                               bound);
  104|    256|    } else {
  105|    256|      FormatConversionSpecImplFriend::SetFlags(unbound->flags, bound);
  106|    256|    }
  107|       |
  108|    256|    FormatConversionSpecImplFriend::SetLengthMod(unbound->length_mod, bound);
  109|    256|  } else {
  110|      0|    FormatConversionSpecImplFriend::SetFlags(unbound->flags, bound);
  111|      0|    FormatConversionSpecImplFriend::SetWidth(-1, bound);
  112|      0|    FormatConversionSpecImplFriend::SetPrecision(-1, bound);
  113|      0|  }
  114|    256|  FormatConversionSpecImplFriend::SetConversionChar(unbound->conv, bound);
  115|    256|  bound->set_arg(arg);
  116|    256|  return true;
  117|    256|}
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_116DefaultConverterC2EPNS1_14FormatSinkImplE:
  154|    256|  explicit DefaultConverter(FormatSinkImpl* sink) : sink_(sink) {}
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_110ConvertAllINS2_16DefaultConverterEEEbNS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEET_:
  142|    256|                absl::Span<const FormatArgImpl> args, Converter converter) {
  143|    256|  if (format.has_parsed_conversion()) {
  ------------------
  |  Branch (143:7): [True: 0, False: 256]
  ------------------
  144|      0|    return format.parsed_conversion()->ProcessFormat(
  145|      0|        ConverterConsumer<Converter>(converter, args));
  146|    256|  } else {
  147|    256|    return ParseFormatString(format.str(),
  148|    256|                             ConverterConsumer<Converter>(converter, args));
  149|    256|  }
  150|    256|}
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_117ConverterConsumerINS2_16DefaultConverterEE10ConvertOneERKNS1_17UnboundConversionENSt3__117basic_string_viewIcNS9_11char_traitsIcEEEE:
  129|    256|  bool ConvertOne(const UnboundConversion& conv, string_view conv_string) {
  130|    256|    BoundConversion bound;
  131|    256|    if (!arg_context_.Bind(&conv, &bound)) return false;
  ------------------
  |  Branch (131:9): [True: 0, False: 256]
  ------------------
  132|    256|    return converter_.ConvertOne(bound, conv_string);
  133|    256|  }
bind.cc:_ZNK4absl12lts_2026052619str_format_internal12_GLOBAL__N_116DefaultConverter10ConvertOneERKNS1_15BoundConversionENSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE:
  158|    256|  bool ConvertOne(const BoundConversion& bound, string_view /*conv*/) const {
  159|    256|    return FormatArgImplFriend::Convert(*bound.arg(), bound, sink_);
  160|    256|  }
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_117ConverterConsumerINS2_16DefaultConverterEE6AppendENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE:
  125|    512|  bool Append(string_view s) {
  126|    512|    converter_.Append(s);
  127|    512|    return true;
  128|    512|  }
bind.cc:_ZNK4absl12lts_2026052619str_format_internal12_GLOBAL__N_116DefaultConverter6AppendENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE:
  156|    512|  void Append(string_view s) const { sink_->Append(s); }
bind.cc:_ZN4absl12lts_2026052619str_format_internal12_GLOBAL__N_117ConverterConsumerINS2_16DefaultConverterEEC2ES4_NS0_4SpanIKNS1_13FormatArgImplEEE:
  123|    256|      : converter_(converter), arg_context_(pack) {}

_ZNK4absl12lts_2026052619str_format_internal15BoundConversion3argEv:
   43|    256|  const FormatArgImpl* arg() const { return arg_; }
_ZN4absl12lts_2026052619str_format_internal15BoundConversion7set_argEPKNS1_13FormatArgImplE:
   44|    256|  void set_arg(const FormatArgImpl* a) { arg_ = a; }
_ZNK4absl12lts_2026052619str_format_internal21UntypedFormatSpecImpl21has_parsed_conversionEv:
   61|    256|  bool has_parsed_conversion() const { return size_ == ~size_t{}; }
_ZNK4absl12lts_2026052619str_format_internal21UntypedFormatSpecImpl3strEv:
   63|    256|  string_view str() const {
   64|       |    assert(!has_parsed_conversion());
   65|    256|    return string_view(static_cast<const char*>(data_), size_);
   66|    256|  }

_ZN4absl12lts_2026052619str_format_internal17UnboundConversionC2Ev:
   36|    256|  UnboundConversion() {}  // NOLINT
_ZN4absl12lts_2026052619str_format_internal17UnboundConversion10InputValue9set_valueEi:
   45|    256|    constexpr void set_value(int value) {
   46|       |      assert(value >= 0);
   47|    256|      value_ = value;
   48|    256|    }
_ZNK4absl12lts_2026052619str_format_internal17UnboundConversion10InputValue5valueEv:
   49|    512|    constexpr int value() const { return value_; }
_ZNK4absl12lts_2026052619str_format_internal17UnboundConversion10InputValue11is_from_argEv:
   60|    512|    constexpr bool is_from_arg() const { return value_ < -1; }
_ZNK4absl12lts_2026052619str_format_internal7ConvTag7is_convEv:
   94|    512|  constexpr bool is_conv() const { return (tag_ & 0x80) == 0; }
_ZNK4absl12lts_2026052619str_format_internal7ConvTag8is_flagsEv:
   96|    256|  constexpr bool is_flags() const { return (tag_ & 0xE0) == 0xC0; }
_ZNK4absl12lts_2026052619str_format_internal7ConvTag7as_convEv:
   98|    256|  constexpr FormatConversionChar as_conv() const {
   99|    256|    assert(is_conv());
  100|    256|    assert(!is_length());
  101|       |    assert(!is_flags());
  102|    256|    return static_cast<FormatConversionChar>(tag_);
  103|    256|  }
_ZNK4absl12lts_2026052619str_format_internal7ConvTag8as_flagsEv:
  110|    256|  constexpr Flags as_flags() const {
  111|    256|    assert(!is_conv());
  112|    256|    assert(!is_length());
  113|       |    assert(is_flags());
  114|    256|    return static_cast<Flags>(tag_ & 0x1F);
  115|    256|  }
_ZN4absl12lts_2026052619str_format_internal17ConsumeConversionILb0EEEPKcS4_S4_PNS1_17UnboundConversionEPi:
  216|    256|                                        int* next_arg) {
  217|    256|  const char* const original_pos = pos;
  218|    256|  char c = 0;
  219|       |  // Read the next char into `c` and update `pos`. Returns false if there are
  220|       |  // no more chars to read.
  221|    256|#define ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR()          \
  222|    256|  do {                                                  \
  223|    256|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  224|    256|    c = *pos++;                                         \
  225|    256|  } while (0)
  226|       |
  227|    256|  if (is_positional) {
  ------------------
  |  Branch (227:7): [Folded, False: 256]
  ------------------
  228|      0|    ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  229|      0|    if (ABSL_PREDICT_FALSE(c < '1' || c > '9')) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  230|      0|    conv->arg_position = ParseDigits(c, pos, end);
  231|      0|    assert(conv->arg_position > 0);
  232|      0|    if (ABSL_PREDICT_FALSE(c != '$')) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  233|      0|  }
  234|       |
  235|    256|  ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|    256|  do {                                                  \
  |  |  223|    256|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|    256|    c = *pos++;                                         \
  |  |  225|    256|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 256]
  |  |  ------------------
  ------------------
  236|       |
  237|       |  // We should start with the basic flag on.
  238|    256|  assert(conv->flags == Flags::kBasic);
  239|       |
  240|       |  // Any non alpha character makes this conversion not basic.
  241|       |  // This includes flags (-+ #0), width (1-9, *) or precision (.).
  242|       |  // All conversion characters and length modifiers are alpha characters.
  243|    256|  if (c < 'A') {
  ------------------
  |  Branch (243:7): [True: 256, False: 0]
  ------------------
  244|    512|    while (c <= '0') {
  ------------------
  |  Branch (244:12): [True: 256, False: 256]
  ------------------
  245|    256|      auto tag = GetTagForChar(c);
  246|    256|      if (tag.is_flags()) {
  ------------------
  |  Branch (246:11): [True: 256, False: 0]
  ------------------
  247|    256|        conv->flags = conv->flags | tag.as_flags();
  248|    256|        ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|    256|  do {                                                  \
  |  |  223|    256|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|    256|    c = *pos++;                                         \
  |  |  225|    256|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 256]
  |  |  ------------------
  ------------------
  249|    256|      } else {
  250|      0|        break;
  251|      0|      }
  252|    256|    }
  253|       |
  254|    256|    if (c <= '9') {
  ------------------
  |  Branch (254:9): [True: 256, False: 0]
  ------------------
  255|    256|      if (c >= '0') {
  ------------------
  |  Branch (255:11): [True: 256, False: 0]
  ------------------
  256|    256|        int maybe_width = ParseDigits(c, pos, end);
  257|    256|        if (!is_positional && c == '$') {
  ------------------
  |  Branch (257:13): [True: 256, Folded]
  |  Branch (257:31): [True: 0, False: 256]
  ------------------
  258|      0|          if (ABSL_PREDICT_FALSE(*next_arg != 0)) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  259|       |          // Positional conversion.
  260|      0|          *next_arg = -1;
  261|      0|          return ConsumeConversion<true>(original_pos, end, conv, next_arg);
  262|      0|        }
  263|    256|        conv->flags = conv->flags | Flags::kNonBasic;
  264|    256|        conv->width.set_value(maybe_width);
  265|    256|      } else if (c == '*') {
  ------------------
  |  Branch (265:18): [True: 0, False: 0]
  ------------------
  266|      0|        conv->flags = conv->flags | Flags::kNonBasic;
  267|      0|        ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  268|      0|        if (is_positional) {
  ------------------
  |  Branch (268:13): [Folded, False: 0]
  ------------------
  269|      0|          if (ABSL_PREDICT_FALSE(c < '1' || c > '9')) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  270|      0|          conv->width.set_from_arg(ParseDigits(c, pos, end));
  271|      0|          if (ABSL_PREDICT_FALSE(c != '$')) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  272|      0|          ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  273|      0|        } else {
  274|      0|          conv->width.set_from_arg(++*next_arg);
  275|      0|        }
  276|      0|      }
  277|    256|    }
  278|       |
  279|    256|    if (c == '.') {
  ------------------
  |  Branch (279:9): [True: 0, False: 256]
  ------------------
  280|      0|      conv->flags = conv->flags | Flags::kNonBasic;
  281|      0|      ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  282|      0|      if ('0' <= c && c <= '9') {
  ------------------
  |  Branch (282:11): [True: 0, False: 0]
  |  Branch (282:23): [True: 0, False: 0]
  ------------------
  283|      0|        conv->precision.set_value(ParseDigits(c, pos, end));
  284|      0|      } else if (c == '*') {
  ------------------
  |  Branch (284:18): [True: 0, False: 0]
  ------------------
  285|      0|        ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  286|      0|        if (is_positional) {
  ------------------
  |  Branch (286:13): [Folded, False: 0]
  ------------------
  287|      0|          if (ABSL_PREDICT_FALSE(c < '1' || c > '9')) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  288|      0|          conv->precision.set_from_arg(ParseDigits(c, pos, end));
  289|      0|          if (c != '$') return nullptr;
  ------------------
  |  Branch (289:15): [True: 0, False: 0]
  ------------------
  290|      0|          ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  291|      0|        } else {
  292|      0|          conv->precision.set_from_arg(++*next_arg);
  293|      0|        }
  294|      0|      } else {
  295|      0|        conv->precision.set_value(0);
  296|      0|      }
  297|      0|    }
  298|    256|  }
  299|       |
  300|    256|  auto tag = GetTagForChar(c);
  301|       |
  302|    256|  if (ABSL_PREDICT_FALSE(c == 'v' && conv->flags != Flags::kBasic)) {
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:59): [True: 0, False: 256]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  303|      0|    return nullptr;
  304|      0|  }
  305|       |
  306|    256|  if (ABSL_PREDICT_FALSE(!tag.is_conv())) {
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  307|      0|    if (ABSL_PREDICT_FALSE(!tag.is_length())) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  308|       |
  309|       |    // It is a length modifier.
  310|      0|    LengthMod length_mod = tag.as_length();
  311|      0|    ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  312|      0|    if (c == 'h' && length_mod == LengthMod::h) {
  ------------------
  |  Branch (312:9): [True: 0, False: 0]
  |  Branch (312:21): [True: 0, False: 0]
  ------------------
  313|      0|      conv->length_mod = LengthMod::hh;
  314|      0|      ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  315|      0|    } else if (c == 'l' && length_mod == LengthMod::l) {
  ------------------
  |  Branch (315:16): [True: 0, False: 0]
  |  Branch (315:28): [True: 0, False: 0]
  ------------------
  316|      0|      conv->length_mod = LengthMod::ll;
  317|      0|      ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|      0|  do {                                                  \
  |  |  223|      0|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|      0|    c = *pos++;                                         \
  |  |  225|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  318|      0|    } else {
  319|      0|      conv->length_mod = length_mod;
  320|      0|    }
  321|      0|    tag = GetTagForChar(c);
  322|       |
  323|      0|    if (ABSL_PREDICT_FALSE(c == 'v')) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  324|      0|    if (ABSL_PREDICT_FALSE(!tag.is_conv())) return nullptr;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  325|       |
  326|       |    // `wchar_t` args are marked non-basic so `Bind()` will copy the length mod.
  327|      0|    if (conv->length_mod == LengthMod::l && c == 'c') {
  ------------------
  |  Branch (327:9): [True: 0, False: 0]
  |  Branch (327:45): [True: 0, False: 0]
  ------------------
  328|      0|      conv->flags = conv->flags | Flags::kNonBasic;
  329|      0|    }
  330|      0|  }
  331|    256|#undef ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR
  332|       |
  333|    256|  assert(CheckFastPathSetting(*conv));
  334|    256|  (void)(&CheckFastPathSetting);
  335|       |
  336|    256|  conv->conv = tag.as_conv();
  337|    256|  if (!is_positional) conv->arg_position = ++*next_arg;
  ------------------
  |  Branch (337:7): [True: 256, Folded]
  ------------------
  338|    256|  return pos;
  339|    256|}
_ZN4absl12lts_2026052619str_format_internal13GetTagForCharEc:
  169|    768|constexpr ConvTag GetTagForChar(char c) {
  170|    768|  return ConvTagHolder::value[static_cast<unsigned char>(c)];
  171|    768|}
_ZN4absl12lts_2026052619str_format_internal11ParseDigitsERcRPKcS4_:
  196|    256|constexpr int ParseDigits(char& c, const char*& pos, const char* const end) {
  197|    256|  int digits = c - '0';
  198|       |  // We do not want to overflow `digits` so we consume at most digits10
  199|       |  // digits. If there are more digits the parsing will fail later on when the
  200|       |  // digit doesn't match the expected characters.
  201|    256|  int num_digits = std::numeric_limits<int>::digits10;
  202|    256|  for (;;) {
  203|    256|    if (ABSL_PREDICT_FALSE(pos == end)) break;
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  204|    256|    c = *pos++;
  205|    256|    if ('0' > c || c > '9') break;
  ------------------
  |  Branch (205:9): [True: 0, False: 256]
  |  Branch (205:20): [True: 256, False: 0]
  ------------------
  206|      0|    --num_digits;
  207|      0|    if (ABSL_PREDICT_FALSE(!num_digits)) break;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  208|      0|    digits = 10 * digits + c - '0';
  209|      0|  }
  210|    256|  return digits;
  211|    256|}
_ZN4absl12lts_2026052619str_format_internal24ConsumeUnboundConversionEPKcS3_PNS1_17UnboundConversionEPi:
  348|    256|                                               int* next_arg) {
  349|    256|  if (*next_arg < 0) return ConsumeConversion<true>(p, end, conv, next_arg);
  ------------------
  |  Branch (349:7): [True: 0, False: 256]
  ------------------
  350|    256|  return ConsumeConversion<false>(p, end, conv, next_arg);
  351|    256|}

_ZN4absl12lts_2026052619str_format_internal17FormatRawSinkImpl5WriteENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   48|    256|  void Write(string_view s) { write_(sink_, s); }
_ZN4absl12lts_2026052619str_format_internal14FormatSinkImplC2ENS1_17FormatRawSinkImplE:
   68|    256|  explicit FormatSinkImpl(FormatRawSinkImpl raw) : raw_(raw) {}
_ZN4absl12lts_2026052619str_format_internal14FormatSinkImplD2Ev:
   70|    256|  ~FormatSinkImpl() { Flush(); }
_ZN4absl12lts_2026052619str_format_internal14FormatSinkImpl5FlushEv:
   72|    256|  void Flush() {
   73|    256|    raw_.Write(string_view(buf_, static_cast<size_t>(pos_ - buf_)));
   74|    256|    pos_ = buf_;
   75|    256|  }
_ZN4absl12lts_2026052619str_format_internal14FormatSinkImpl6AppendEmc:
   77|    768|  void Append(size_t n, char c) {
   78|    768|    if (n == 0) return;
  ------------------
  |  Branch (78:9): [True: 752, False: 16]
  ------------------
   79|     16|    size_ += n;
   80|     16|    auto raw_append = [&](size_t count) {
   81|     16|      memset(pos_, c, count);
   82|     16|      pos_ += count;
   83|     16|    };
   84|     16|    while (n > Avail()) {
  ------------------
  |  Branch (84:12): [True: 0, False: 16]
  ------------------
   85|      0|      n -= Avail();
   86|      0|      if (Avail() > 0) {
  ------------------
  |  Branch (86:11): [True: 0, False: 0]
  ------------------
   87|      0|        raw_append(Avail());
   88|      0|      }
   89|      0|      Flush();
   90|      0|    }
   91|     16|    raw_append(n);
   92|     16|  }
_ZN4absl12lts_2026052619str_format_internal14FormatSinkImpl6AppendENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   94|  1.28k|  void Append(string_view v) {
   95|  1.28k|    size_t n = v.size();
   96|  1.28k|    if (n == 0) return;
  ------------------
  |  Branch (96:9): [True: 513, False: 767]
  ------------------
   97|    767|    size_ += n;
   98|    767|    if (n >= Avail()) {
  ------------------
  |  Branch (98:9): [True: 0, False: 767]
  ------------------
   99|      0|      Flush();
  100|      0|      raw_.Write(v);
  101|      0|      return;
  102|      0|    }
  103|    767|    memcpy(pos_, v.data(), n);
  104|    767|    pos_ += n;
  105|    767|  }
_ZNK4absl12lts_2026052619str_format_internal14FormatSinkImpl5AvailEv:
  123|    783|  size_t Avail() const {
  124|    783|    return static_cast<size_t>(buf_ + sizeof(buf_) - pos_);
  125|    783|  }
_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl8is_basicEv:
  277|    256|  bool is_basic() const { return flags_ == Flags::kBasic; }
_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl13has_left_flagEv:
  278|    512|  bool has_left_flag() const { return FlagsContains(flags_, Flags::kLeft); }
_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl12has_alt_flagEv:
  285|    512|  bool has_alt_flag() const { return FlagsContains(flags_, Flags::kAlt); }
_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl13has_zero_flagEv:
  286|    256|  bool has_zero_flag() const { return FlagsContains(flags_, Flags::kZero); }
_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl5widthEv:
  301|    512|  int width() const { return width_; }
_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl9precisionEv:
  304|    256|  int precision() const { return precision_; }
_ZN4absl12lts_2026052619str_format_internal30FormatConversionSpecImplFriend8SetFlagsENS1_5FlagsEPNS1_24FormatConversionSpecImplE:
  321|    256|  static void SetFlags(Flags f, FormatConversionSpecImpl* conv) {
  322|    256|    conv->flags_ = f;
  323|    256|  }
_ZN4absl12lts_2026052619str_format_internal30FormatConversionSpecImplFriend12SetLengthModENS0_9LengthModEPNS1_24FormatConversionSpecImplE:
  324|    256|  static void SetLengthMod(LengthMod l, FormatConversionSpecImpl* conv) {
  325|    256|    conv->length_mod_ = l;
  326|    256|  }
_ZN4absl12lts_2026052619str_format_internal30FormatConversionSpecImplFriend17SetConversionCharENS0_20FormatConversionCharEPNS1_24FormatConversionSpecImplE:
  328|    256|                                FormatConversionSpecImpl* conv) {
  329|    256|    conv->conv_ = c;
  330|    256|  }
_ZN4absl12lts_2026052619str_format_internal30FormatConversionSpecImplFriend8SetWidthEiPNS1_24FormatConversionSpecImplE:
  331|    256|  static void SetWidth(int w, FormatConversionSpecImpl* conv) {
  332|    256|    conv->width_ = w;
  333|    256|  }
_ZN4absl12lts_2026052619str_format_internal30FormatConversionSpecImplFriend12SetPrecisionEiPNS1_24FormatConversionSpecImplE:
  334|    256|  static void SetPrecision(int p, FormatConversionSpecImpl* conv) {
  335|    256|    conv->precision_ = p;
  336|    256|  }
_ZN4absl12lts_2026052619str_format_internalorENS1_5FlagsES2_:
  146|    512|constexpr Flags operator|(Flags a, Flags b) {
  147|    512|  return static_cast<Flags>(static_cast<uint8_t>(a) | static_cast<uint8_t>(b));
  148|    512|}
_ZN4absl12lts_2026052619str_format_internal13FlagsContainsENS1_5FlagsES2_:
  150|  1.28k|constexpr bool FlagsContains(Flags haystack, Flags needle) {
  151|  1.28k|  return (static_cast<uint8_t>(haystack) & static_cast<uint8_t>(needle)) ==
  152|  1.28k|         static_cast<uint8_t>(needle);
  153|  1.28k|}
_ZN4absl12lts_2026052619str_format_internal6ExcessEmm:
  447|  1.28k|inline size_t Excess(size_t used, size_t capacity) {
  448|  1.28k|  return used < capacity ? capacity - used : 0;
  ------------------
  |  Branch (448:10): [True: 65, False: 1.21k]
  ------------------
  449|  1.28k|}
_ZZN4absl12lts_2026052619str_format_internal14FormatSinkImpl6AppendEmcENKUlmE_clEm:
   80|     16|    auto raw_append = [&](size_t count) {
   81|     16|      memset(pos_, c, count);
   82|     16|      pos_ += count;
   83|     16|    };
_ZN4absl12lts_2026052619str_format_internal17FormatRawSinkImplC2INSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEETnPDTclsr19str_format_internalE11InvokeFlushclsr3stdE7declvalIPT_EEcvNS4_17basic_string_viewIcS7_EE_EEELPv0EEESC_:
   46|    256|      : sink_(raw), write_(&FormatRawSinkImpl::Flush<T>) {}
_ZN4absl12lts_2026052619str_format_internal17FormatRawSinkImpl5FlushINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEvPvNS4_17basic_string_viewIcS7_EE:
   57|    256|  static void Flush(void* r, string_view s) {
   58|    256|    str_format_internal::InvokeFlush(static_cast<T*>(r), s);
   59|    256|  }

_ZN4absl12lts_2026052619str_format_internal15AbslFormatFlushEPNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EE:
   71|    256|inline void AbslFormatFlush(std::string* out, string_view s) {
   72|    256|  out->append(s.data(), s.size());
   73|    256|}
_ZN4absl12lts_2026052619str_format_internal11InvokeFlushINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEEEDTcl15AbslFormatFlushfp_fp0_EEPT_NS3_17basic_string_viewIcS6_EE:
   89|    256|auto InvokeFlush(T* out, string_view s) -> decltype(AbslFormatFlush(out, s)) {
   90|    256|  AbslFormatFlush(out, s);
   91|    256|}

_ZN4absl12lts_2026052619str_format_internal32ConsumeUnboundConversionNoInlineEPKcS3_PNS1_17UnboundConversionEPi:
   38|    256|    const char* p, const char* end, UnboundConversion* conv, int* next_arg) {
   39|    256|  return ConsumeUnboundConversion(p, end, conv, next_arg);
   40|    256|}

bind.cc:_ZN4absl12lts_2026052619str_format_internal17ParseFormatStringINS1_12_GLOBAL__N_117ConverterConsumerINS3_16DefaultConverterEEEEEbNSt3__117basic_string_viewIcNS7_11char_traitsIcEEEET_:
   57|    256|bool ParseFormatString(string_view src, Consumer consumer) {
   58|    256|  int next_arg = 0;
   59|    256|  const char* p = src.data();
   60|    256|  const char* const end = p + src.size();
   61|    512|  while (p != end) {
  ------------------
  |  Branch (61:10): [True: 512, False: 0]
  ------------------
   62|    512|    const char* percent =
   63|    512|        static_cast<const char*>(memchr(p, '%', static_cast<size_t>(end - p)));
   64|    512|    if (!percent) {
  ------------------
  |  Branch (64:9): [True: 256, False: 256]
  ------------------
   65|       |      // We found the last substring.
   66|    256|      return consumer.Append(string_view(p, static_cast<size_t>(end - p)));
   67|    256|    }
   68|       |    // We found a percent, so push the text run then process the percent.
   69|    256|    if (ABSL_PREDICT_FALSE(!consumer.Append(
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
   70|    256|            string_view(p, static_cast<size_t>(percent - p))))) {
   71|      0|      return false;
   72|      0|    }
   73|    256|    if (ABSL_PREDICT_FALSE(percent + 1 >= end)) return false;
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
   74|       |
   75|    256|    auto tag = GetTagForChar(percent[1]);
   76|    256|    if (tag.is_conv()) {
  ------------------
  |  Branch (76:9): [True: 0, False: 256]
  ------------------
   77|      0|      if (ABSL_PREDICT_FALSE(next_arg < 0)) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
   78|       |        // This indicates an error in the format string.
   79|       |        // The only way to get `next_arg < 0` here is to have a positional
   80|       |        // argument first which sets next_arg to -1 and then a non-positional
   81|       |        // argument.
   82|      0|        return false;
   83|      0|      }
   84|      0|      p = percent + 2;
   85|       |
   86|       |      // Keep this case separate from the one below.
   87|       |      // ConvertOne is more efficient when the compiler can see that the `basic`
   88|       |      // flag is set.
   89|      0|      UnboundConversion conv;
   90|      0|      conv.conv = tag.as_conv();
   91|      0|      conv.arg_position = ++next_arg;
   92|      0|      if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
   93|      0|              !consumer.ConvertOne(conv, string_view(percent + 1, 1)))) {
   94|      0|        return false;
   95|      0|      }
   96|    256|    } else if (percent[1] != '%') {
  ------------------
  |  Branch (96:16): [True: 256, False: 0]
  ------------------
   97|    256|      UnboundConversion conv;
   98|    256|      p = ConsumeUnboundConversionNoInline(percent + 1, end, &conv, &next_arg);
   99|    256|      if (ABSL_PREDICT_FALSE(p == nullptr)) return false;
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  100|    256|      if (ABSL_PREDICT_FALSE(!consumer.ConvertOne(
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  101|    256|              conv, string_view(percent + 1,
  102|    256|                                static_cast<size_t>(p - (percent + 1)))))) {
  103|      0|        return false;
  104|      0|      }
  105|    256|    } else {
  106|      0|      if (ABSL_PREDICT_FALSE(!consumer.Append("%"))) return false;
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  107|      0|      p = percent + 2;
  108|      0|      continue;
  109|      0|    }
  110|    256|  }
  111|      0|  return true;
  112|    256|}

_ZNK4absl12lts_202605264SpanIKNS0_19str_format_internal13FormatArgImplEE4sizeEv:
  323|    512|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202605264SpanIKNS0_19str_format_internal13FormatArgImplEEixEm:
  338|    256|  constexpr reference operator[](size_type i) const noexcept {
  339|    256|    absl::base_internal::HardeningAssertLT(i, size());
  340|    256|    return ptr_[i];
  341|    256|  }

_ZN4absl12lts_2026052613little_endian8ToHost64Em:
  110|      2|inline uint64_t ToHost64(uint64_t x) { return x; }

_ZN4absl12lts_2026052613base_internal17HardeningAssertLTImEEvT_S3_:
   88|    256|constexpr void HardeningAssertLT(T val1, T val2) {
   89|    256|  ABSL_ASSERT(val1 < val2);
  ------------------
  |  |  127|    256|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|    256|#define ABSL_INTERNAL_UNEVALUATED(expr) (false ? (void)(expr) : void())
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (87:42): [Folded, False: 256]
  |  |  |  |  |  Branch (87:57): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   90|       |#if (ABSL_OPTION_HARDENED == 1 || ABSL_OPTION_HARDENED == 2) && defined(NDEBUG)
   91|       |  if (!ABSL_PREDICT_TRUE(val1 < val2)) {
   92|       |    base_internal::HardeningAbort();
   93|       |  }
   94|       |#endif
   95|    256|}

_ZN4absl12lts_2026052613base_internal15UnalignedLoad32EPKv:
   45|  2.43k|inline uint32_t UnalignedLoad32(const void* absl_nonnull p) {
   46|  2.43k|  uint32_t t;
   47|  2.43k|  memcpy(&t, p, sizeof t);
   48|  2.43k|  return t;
   49|  2.43k|}
_ZN4absl12lts_2026052613base_internal15UnalignedLoad64EPKv:
   51|  1.25k|inline uint64_t UnalignedLoad64(const void* absl_nonnull p) {
   52|  1.25k|  uint64_t t;
   53|  1.25k|  memcpy(&t, p, sizeof t);
   54|  1.25k|  return t;
   55|  1.25k|}

_ZN4absl12lts_2026052620PrefetchToLocalCacheEPKv:
  146|    823|    const void* addr) {
  147|    823|  __builtin_prefetch(addr, 0, 3);
  148|    823|}

_ZN4absl12lts_2026052613flat_hash_mapINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS7_8StringEqENS2_9allocatorINS2_4pairIKS6_hEEEEEC2Ev:
  196|      1|  flat_hash_map() {}
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5valueEPNS3_4pairIKS7_hEE:
  696|    256|  static V& value(std::pair<const K, V>* kv) { return kv->second; }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE7elementEPNS1_13map_slot_typeIS7_hEE:
  694|  1.22k|  static std::pair<const K, V>& element(slot_type* slot) { return slot->value; }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5applyINS1_12EqualElementINS3_12basic_stringIcS6_NS3_9allocatorIcEEEENS1_8StringEqEEEJRNS3_4pairIKS7_hEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSL_DpOSM_:
  680|     19|  apply(F&& f, Args&&... args) {
  681|     19|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  682|     19|                                                   std::forward<Args>(args)...);
  683|     19|  }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5applyINS1_11HashElementINS1_10StringHashELb1EEEJRNS3_4pairIKS7_hEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSH_DpOSI_:
  680|    434|  apply(F&& f, Args&&... args) {
  681|    434|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  682|    434|                                                   std::forward<Args>(args)...);
  683|    434|  }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE8transferINS3_9allocatorINS3_4pairIKS7_hEEEEEEDaPT_PNS1_13map_slot_typeIS7_hEESJ_:
  673|    432|                       slot_type* old_slot) {
  674|    432|    return slot_policy::transfer(alloc, new_slot, old_slot);
  675|    432|  }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE9constructINS3_9allocatorINS3_4pairIKS7_hEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKNS3_12basic_stringIcS6_NSA_IcEEEEEEENSI_IJEEEEEEvPT_PNS1_13map_slot_typeIS7_hEEDpOT0_:
  661|    256|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  662|    256|    slot_policy::construct(alloc, slot, std::forward<Args>(args)...);
  663|    256|  }
_ZN4absl12lts_2026052613flat_hash_mapINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEiNS0_18container_internal10StringHashENS7_8StringEqENS2_9allocatorINS2_4pairIKS6_iEEEEEC2Ev:
  196|      2|  flat_hash_map() {}
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE5applyINS1_12EqualElementIS7_NS1_8StringEqEEEJRNS3_4pairIKS7_iEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSH_DpOSI_:
  680|     18|  apply(F&& f, Args&&... args) {
  681|     18|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  682|     18|                                                   std::forward<Args>(args)...);
  683|     18|  }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE7elementEPNS1_13map_slot_typeIS7_iEE:
  694|     60|  static std::pair<const K, V>& element(slot_type* slot) { return slot->value; }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE5applyINS1_12raw_hash_setIS8_JEE19EmplaceDecomposableEJRKNS3_4pairIKS7_iEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSI_DpOSJ_:
  680|    298|  apply(F&& f, Args&&... args) {
  681|    298|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  682|    298|                                                   std::forward<Args>(args)...);
  683|    298|  }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE9constructINS3_9allocatorINS3_4pairIKS7_iEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRSC_EEENSI_IJRKiEEEEEEvPT_PNS1_13map_slot_typeIS7_iEEDpOT0_:
  661|    298|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  662|    298|    slot_policy::construct(alloc, slot, std::forward<Args>(args)...);
  663|    298|  }
_ZN4absl12lts_2026052618container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5applyINS1_12EqualElementIS7_NS1_8StringEqEEEJRNS3_4pairIKS7_hEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSH_DpOSI_:
  680|    258|  apply(F&& f, Args&&... args) {
  681|    258|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  682|    258|                                                   std::forward<Args>(args)...);
  683|    258|  }

_ZN4absl12lts_2026052618container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE7elementIS9_EEDTclsrT_7elementfp_EEPNS1_13map_slot_typeIS8_hEE:
   85|  1.22k|      -> decltype(P::element(slot)) {
   86|  1.22k|    return P::element(slot);
   87|  1.22k|  }
_ZN4absl12lts_2026052618container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE8transferINS4_9allocatorINS4_4pairIKS8_hEEEEEEvPT_PNS1_13map_slot_typeIS8_hEESL_:
   75|    432|  static void transfer(Alloc* alloc, slot_type* new_slot, slot_type* old_slot) {
   76|    432|    transfer_impl(alloc, new_slot, old_slot, Rank2{});
   77|    432|  }
_ZN4absl12lts_2026052618container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE13transfer_implINS4_9allocatorINS4_4pairIKS8_hEEEES9_EEDTclsrT0_8transferfp_fp0_fp1_EEPT_PNS1_13map_slot_typeIS8_hEESN_NSA_5Rank2E:
  119|    432|                                                           old_slot)) {
  120|    432|    return P::transfer(alloc, new_slot, old_slot);
  121|    432|  }
_ZN4absl12lts_2026052618container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE9constructINS4_9allocatorINS4_4pairIKS8_hEEEEJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NSC_IcEEEEEEENSK_IJEEEEEEvPT_PNS1_13map_slot_typeIS8_hEEDpOT0_:
   51|    256|  static void construct(Alloc* alloc, slot_type* slot, Args&&... args) {
   52|    256|    Policy::construct(alloc, slot, std::forward<Args>(args)...);
   53|    256|  }
_ZN4absl12lts_2026052618container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE7elementIS9_EEDTclsrT_7elementfp_EEPNS1_13map_slot_typeIS8_iEE:
   85|     60|      -> decltype(P::element(slot)) {
   86|     60|    return P::element(slot);
   87|     60|  }
_ZN4absl12lts_2026052618container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE9constructINS4_9allocatorINS4_4pairIKS8_iEEEEJRKNS4_21piecewise_construct_tENS4_5tupleIJRSE_EEENSK_IJRKiEEEEEEvPT_PNS1_13map_slot_typeIS8_iEEDpOT0_:
   51|    298|  static void construct(Alloc* alloc, slot_type* slot, Args&&... args) {
   52|    298|    Policy::construct(alloc, slot, std::forward<Args>(args)...);
   53|    298|  }

_ZN4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EEC2IS4_EENS8_10in_place_tEOT_:
   90|      3|      : value(std::forward<V>(v)) {}
_ZNR4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi0EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  244|  3.43k|  constexpr ElemT<I>& get() & {
  245|  3.43k|    return StorageT<I>::get();
  246|  3.43k|  }
_ZNR4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EE3getEv:
   92|  3.43k|  constexpr T& get() & { return value; }
_ZNKR4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi0EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  249|  6.43k|  constexpr const ElemT<I>& get() const& {
  250|  6.43k|    return StorageT<I>::get();
  251|  6.43k|  }
_ZNKR4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EE3getEv:
   91|  6.43k|  constexpr const T& get() const& { return value; }
_ZNKR4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi1EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  249|  1.24k|  constexpr const ElemT<I>& get() const& {
  250|  1.24k|    return StorageT<I>::get();
  251|  1.24k|  }
_ZNKR4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EE3getEv:
  104|  1.24k|  constexpr const T& get() const& { return *this; }
_ZNR4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi3EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  244|    987|  constexpr ElemT<I>& get() & {
  245|    987|    return StorageT<I>::get();
  246|    987|  }
_ZNR4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqES6_EEELb1EE3getEv:
  105|    987|  constexpr T& get() & { return *this; }
_ZNKR4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi2EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  249|    295|  constexpr const ElemT<I>& get() const& {
  250|    295|    return StorageT<I>::get();
  251|    295|  }
_ZNKR4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EE3getEv:
  104|    295|  constexpr const T& get() const& { return *this; }
_ZNR4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi1EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  244|      2|  constexpr ElemT<I>& get() & {
  245|      2|    return StorageT<I>::get();
  246|      2|  }
_ZNR4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EE3getEv:
  105|      2|  constexpr T& get() & { return *this; }
_ZN4absl12lts_2026052618container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEC2IS3_JS4_S5_S8_ETnNS6_9enable_ifIXsr3std11conjunctionINS6_8negationINS6_7is_sameIFvS9_EFvu7__decayIT_EEEEEENS1_25internal_compressed_tuple27TupleItemsMoveConstructibleIS9_JSF_DpT0_EEEEE5valueEbE4typeELb1EEEOSF_DpOSM_:
  239|      3|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  240|      3|                                             std::forward<First>(first),
  241|      3|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026052618container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEENS8_16integer_sequenceImJLm0ELm1ELm2ELm3EEEELb1EEC2IJS5_S6_S7_SA_EEENS8_10in_place_tEDpOT_:
  126|     12|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  127|     12|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EEC2IS4_EENS8_10in_place_tEOT_:
  102|      3|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EEC2IS4_EENS8_10in_place_tEOT_:
  102|      3|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026052618container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqES6_EEELb1EEC2IS6_EENS4_10in_place_tEOT_:
  102|      3|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}

_ZN4absl12lts_2026052618container_internal27SanitizerPoisonMemoryRegionEPKvm:
  240|    443|inline void SanitizerPoisonMemoryRegion(const void* m, size_t s) {
  241|       |#ifdef ABSL_HAVE_ADDRESS_SANITIZER
  242|       |  ASAN_POISON_MEMORY_REGION(m, s);
  243|       |#endif
  244|       |#ifdef ABSL_HAVE_MEMORY_SANITIZER
  245|       |  __msan_poison(m, s);
  246|       |#endif
  247|    443|  (void)m;
  248|    443|  (void)s;
  249|    443|}
_ZN4absl12lts_2026052618container_internal29SanitizerUnpoisonMemoryRegionEPKvm:
  251|  1.00k|inline void SanitizerUnpoisonMemoryRegion(const void* m, size_t s) {
  252|       |#ifdef ABSL_HAVE_ADDRESS_SANITIZER
  253|       |  ASAN_UNPOISON_MEMORY_REGION(m, s);
  254|       |#endif
  255|       |#ifdef ABSL_HAVE_MEMORY_SANITIZER
  256|       |  __msan_unpoison(m, s);
  257|       |#endif
  258|  1.00k|  (void)m;
  259|  1.00k|  (void)s;
  260|  1.00k|}
_ZN4absl12lts_2026052618container_internal23TypeErasedApplyToSlotFnINS1_10StringHashENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEELb1EEEmPKvPvm:
  542|      1|size_t TypeErasedApplyToSlotFn(const void* fn, void* slot, size_t seed) {
  543|      1|  const auto* f = static_cast<const Fn*>(fn);
  544|      1|  return HashElement<Fn, kIsDefault>{*f, seed}(*static_cast<const T*>(slot));
  545|      1|}
_ZN4absl12lts_2026052618container_internal11HashElementINS1_10StringHashELb1EEC2ERKS3_m:
  495|  1.24k|  HashElement(const Hash& h, size_t s) : hash(h), seed(s) {}
_ZNK4absl12lts_2026052618container_internal11HashElementINS1_10StringHashELb1EEclINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJEEEmRKT_DpOT0_:
  498|    559|  size_t operator()(const K& key, Args&&...) const {
  499|    559|    if constexpr (kIsDefault) {
  500|       |      // TODO(b/384509507): resolve `no header providing
  501|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  502|       |      // Maybe we should make "internal/hash.h" be a separate library.
  503|    559|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  504|    559|    }
  505|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  506|      0|    return hash(key) ^ seed;
  507|    559|  }
_ZNK4absl12lts_2026052618container_internal11HashElementINS1_10StringHashELb1EEclINSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEEJEEEmRKT_DpOT0_:
  498|    255|  size_t operator()(const K& key, Args&&...) const {
  499|    255|    if constexpr (kIsDefault) {
  500|       |      // TODO(b/384509507): resolve `no header providing
  501|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  502|       |      // Maybe we should make "internal/hash.h" be a separate library.
  503|    255|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  504|    255|    }
  505|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  506|      0|    return hash(key) ^ seed;
  507|    255|  }
_ZN4absl12lts_2026052618container_internal13DecomposePairINS1_12EqualElementINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS1_8StringEqEEEJRNS4_4pairIKNS4_17basic_string_viewIcS7_EEhEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSJ_DpOSK_:
  226|     19|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  227|     19|  return memory_internal::DecomposePairImpl(
  228|     19|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  229|     19|}
_ZN4absl12lts_2026052618container_internal15memory_internal17DecomposePairImplINS1_12EqualElementINSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEENS1_8StringEqEEERKNS5_17basic_string_viewIcS8_EENS5_5tupleIJRKhEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS5_19piecewise_constructEEclsr3stdE7declvalINSI_IJSN_EEEEEclsr3stdE7declvalIT1_EEEEOSM_NS5_4pairISQ_SR_EE:
  158|     19|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  159|     19|  const auto& key = std::get<0>(p.first);
  160|     19|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  161|     19|                            std::move(p.second));
  162|     19|}
_ZNK4absl12lts_2026052618container_internal12EqualElementINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS1_8StringEqEEclINS3_17basic_string_viewIcS6_EEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKSE_EEENSI_IJRKhEEEEEEbRKT_DpOT0_:
  529|     19|  bool operator()(const K2& lhs, Args&&...) const {
  530|     19|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  488|     19|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  531|     19|  }
_ZN4absl12lts_2026052618container_internal8PairArgsIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhEENS3_4pairINS3_5tupleIJRKT_EEENSA_IJRKT0_EEEEERKNS9_ISB_SF_EE:
  207|    711|    const std::pair<F, S>& p) {
  208|    711|  return PairArgs(p.first, p.second);
  209|    711|}
_ZN4absl12lts_2026052618container_internal8PairArgsIRKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEERKhEENS3_4pairINS3_5tupleIJOT_EEENSD_IJOT0_EEEEESF_SI_:
  201|    711|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  202|    711|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  203|    711|          std::forward_as_tuple(std::forward<S>(s))};
  204|    711|}
_ZN4absl12lts_2026052618container_internal13DecomposePairINS1_11HashElementINS1_10StringHashELb1EEEJRNSt3__14pairIKNS6_17basic_string_viewIcNS6_11char_traitsIcEEEEhEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSF_DpOSG_:
  226|    434|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  227|    434|  return memory_internal::DecomposePairImpl(
  228|    434|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  229|    434|}
_ZN4absl12lts_2026052618container_internal15memory_internal17DecomposePairImplINS1_11HashElementINS1_10StringHashELb1EEERKNSt3__117basic_string_viewIcNS7_11char_traitsIcEEEENS7_5tupleIJRKhEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS7_19piecewise_constructEEclsr3stdE7declvalINSE_IJSJ_EEEEEclsr3stdE7declvalIT1_EEEEOSI_NS7_4pairISM_SN_EE:
  158|    434|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  159|    434|  const auto& key = std::get<0>(p.first);
  160|    434|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  161|    434|                            std::move(p.second));
  162|    434|}
_ZNK4absl12lts_2026052618container_internal11HashElementINS1_10StringHashELb1EEclINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJRKNS6_21piecewise_construct_tENS6_5tupleIJRKSA_EEENSE_IJRKhEEEEEEmRKT_DpOT0_:
  498|    434|  size_t operator()(const K& key, Args&&...) const {
  499|    434|    if constexpr (kIsDefault) {
  500|       |      // TODO(b/384509507): resolve `no header providing
  501|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  502|       |      // Maybe we should make "internal/hash.h" be a separate library.
  503|    434|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  504|    434|    }
  505|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  506|      0|    return hash(key) ^ seed;
  507|    434|  }
_ZN4absl12lts_2026052618container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE8transferINS3_9allocatorINS3_4pairIKS7_hEEEEEEDaPT_PNS1_13map_slot_typeIS7_hEESJ_:
  442|    432|                       slot_type* old_slot) {
  443|       |    // This should really just be
  444|       |    // typename absl::is_trivially_relocatable<value_type>::type()
  445|       |    // but std::pair is not trivially copyable in C++23 in some standard
  446|       |    // library versions.
  447|       |    // See https://github.com/llvm/llvm-project/pull/95444 for instance.
  448|    432|    auto is_relocatable = typename std::conjunction<
  449|    432|        absl::is_trivially_relocatable<typename value_type::first_type>,
  450|    432|        absl::is_trivially_relocatable<typename value_type::second_type>>::
  451|    432|        type();
  452|       |
  453|    432|    emplace(new_slot);
  454|    432|    if (is_relocatable) {
  ------------------
  |  Branch (454:9): [True: 432, Folded]
  ------------------
  455|       |      // TODO(b/247130232,b/251814870): remove casts after fixing warnings.
  456|    432|      std::memcpy(static_cast<void*>(std::launder(&new_slot->value)),
  457|    432|                  static_cast<const void*>(&old_slot->value),
  458|    432|                  sizeof(value_type));
  459|    432|      return is_relocatable;
  460|    432|    }
  461|       |
  462|      0|    if (kMutableKeys::value) {
  ------------------
  |  Branch (462:9): [True: 0, Folded]
  ------------------
  463|      0|      std::allocator_traits<Allocator>::construct(
  464|      0|          *alloc, &new_slot->mutable_value, std::move(old_slot->mutable_value));
  465|      0|    } else {
  466|      0|      std::allocator_traits<Allocator>::construct(*alloc, &new_slot->value,
  467|      0|                                                  std::move(old_slot->value));
  468|      0|    }
  469|      0|    destroy(alloc, old_slot);
  470|      0|    return is_relocatable;
  471|    432|  }
_ZN4absl12lts_2026052618container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE7emplaceEPNS1_13map_slot_typeIS7_hEE:
  368|    688|  static void emplace(slot_type* slot) {
  369|       |    // The construction of union doesn't do anything at runtime but it allows us
  370|       |    // to access its members without violating aliasing rules.
  371|    688|    new (slot) slot_type;
  372|    688|  }
_ZN4absl12lts_2026052618container_internal13map_slot_typeINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhEC2Ev:
  349|    688|  map_slot_type() {}
_ZN4absl12lts_2026052618container_internal7HashKeyINS1_10StringHashENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEELb1EEC2ERKS3_RKSA_:
  515|      2|  HashKey(const Hash& h, const Key& k) : hash(h), key(k) {}
_ZNK4absl12lts_2026052618container_internal7HashKeyINS1_10StringHashENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEELb1EEclEm:
  517|      1|  size_t operator()(size_t seed) const {
  518|      1|    return HashElement<Hash, kIsDefault>{hash, seed}(key);
  519|      1|  }
_ZN4absl12lts_2026052618container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE9constructINS3_9allocatorINS3_4pairIKS7_hEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKNS3_12basic_stringIcS6_NSA_IcEEEEEEENSI_IJEEEEEEvPT_PNS1_13map_slot_typeIS7_hEEDpOT0_:
  397|    256|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  398|    256|    emplace(slot);
  399|    256|    if (kMutableKeys::value) {
  ------------------
  |  Branch (399:9): [True: 256, Folded]
  ------------------
  400|    256|      std::allocator_traits<Allocator>::construct(*alloc, &slot->mutable_value,
  401|    256|                                                  std::forward<Args>(args)...);
  402|    256|    } else {
  403|      0|      std::allocator_traits<Allocator>::construct(*alloc, &slot->value,
  404|      0|                                                  std::forward<Args>(args)...);
  405|      0|    }
  406|    256|  }
_ZN4absl12lts_2026052618container_internal13DecomposePairINS1_12EqualElementINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS1_8StringEqEEEJRNS4_4pairIKS8_iEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSF_DpOSG_:
  226|     18|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  227|     18|  return memory_internal::DecomposePairImpl(
  228|     18|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  229|     18|}
_ZN4absl12lts_2026052618container_internal15memory_internal17DecomposePairImplINS1_12EqualElementINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEENS1_8StringEqEEERKS9_NS5_5tupleIJRKiEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS5_19piecewise_constructEEclsr3stdE7declvalINSE_IJSJ_EEEEEclsr3stdE7declvalIT1_EEEEOSI_NS5_4pairISM_SN_EE:
  158|     18|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  159|     18|  const auto& key = std::get<0>(p.first);
  160|     18|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  161|     18|                            std::move(p.second));
  162|     18|}
_ZNK4absl12lts_2026052618container_internal12EqualElementINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEENS1_8StringEqEEclIS7_JRKNS3_21piecewise_construct_tENS3_5tupleIJRKS7_EEENSE_IJRKiEEEEEEbRKT_DpOT0_:
  529|     18|  bool operator()(const K2& lhs, Args&&...) const {
  530|     18|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  488|     18|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  531|     18|  }
_ZN4absl12lts_2026052618container_internal8PairArgsIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiEENS3_4pairINS3_5tupleIJRKT_EEENSA_IJRKT0_EEEEERKNS9_ISB_SF_EE:
  207|    316|    const std::pair<F, S>& p) {
  208|    316|  return PairArgs(p.first, p.second);
  209|    316|}
_ZN4absl12lts_2026052618container_internal8PairArgsIRKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEERKiEENS3_4pairINS3_5tupleIJOT_EEENSD_IJOT0_EEEEESF_SI_:
  201|    316|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  202|    316|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  203|    316|          std::forward_as_tuple(std::forward<S>(s))};
  204|    316|}
_ZN4absl12lts_2026052618container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE7emplaceEPNS1_13map_slot_typeIS7_iEE:
  368|    298|  static void emplace(slot_type* slot) {
  369|       |    // The construction of union doesn't do anything at runtime but it allows us
  370|       |    // to access its members without violating aliasing rules.
  371|    298|    new (slot) slot_type;
  372|    298|  }
_ZN4absl12lts_2026052618container_internal13map_slot_typeINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiEC2Ev:
  349|    298|  map_slot_type() {}
_ZN4absl12lts_2026052618container_internal13DecomposePairINS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEiEEJEE19EmplaceDecomposableEJRKNS5_4pairIKS9_iEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSI_DpOSJ_:
  226|    298|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  227|    298|  return memory_internal::DecomposePairImpl(
  228|    298|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  229|    298|}
_ZN4absl12lts_2026052618container_internal15memory_internal17DecomposePairImplINS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEiEEJEE19EmplaceDecomposableERKSA_NS6_5tupleIJRKiEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS6_19piecewise_constructEEclsr3stdE7declvalINSG_IJSL_EEEEEclsr3stdE7declvalIT1_EEEEOSK_NS6_4pairISO_SP_EE:
  158|    298|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  159|    298|  const auto& key = std::get<0>(p.first);
  160|    298|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  161|    298|                            std::move(p.second));
  162|    298|}
_ZN4absl12lts_2026052618container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE9constructINS3_9allocatorINS3_4pairIKS7_iEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRSC_EEENSI_IJRKiEEEEEEvPT_PNS1_13map_slot_typeIS7_iEEDpOT0_:
  397|    298|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  398|    298|    emplace(slot);
  399|    298|    if (kMutableKeys::value) {
  ------------------
  |  Branch (399:9): [True: 298, Folded]
  ------------------
  400|    298|      std::allocator_traits<Allocator>::construct(*alloc, &slot->mutable_value,
  401|    298|                                                  std::forward<Args>(args)...);
  402|    298|    } else {
  403|      0|      std::allocator_traits<Allocator>::construct(*alloc, &slot->value,
  404|      0|                                                  std::forward<Args>(args)...);
  405|      0|    }
  406|    298|  }
_ZN4absl12lts_2026052618container_internal13DecomposePairINS1_12EqualElementINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS1_8StringEqEEEJRNS4_4pairIKS8_hEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSF_DpOSG_:
  226|    258|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  227|    258|  return memory_internal::DecomposePairImpl(
  228|    258|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  229|    258|}
_ZN4absl12lts_2026052618container_internal15memory_internal17DecomposePairImplINS1_12EqualElementINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEENS1_8StringEqEEERKS9_NS5_5tupleIJRKhEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS5_19piecewise_constructEEclsr3stdE7declvalINSE_IJSJ_EEEEEclsr3stdE7declvalIT1_EEEEOSI_NS5_4pairISM_SN_EE:
  158|    258|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  159|    258|  const auto& key = std::get<0>(p.first);
  160|    258|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  161|    258|                            std::move(p.second));
  162|    258|}
_ZNK4absl12lts_2026052618container_internal12EqualElementINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEENS1_8StringEqEEclIS7_JRKNS3_21piecewise_construct_tENS3_5tupleIJRKS7_EEENSE_IJRKhEEEEEEbRKT_DpOT0_:
  529|    258|  bool operator()(const K2& lhs, Args&&...) const {
  530|    258|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  488|    258|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  531|    258|  }

_ZNK4absl12lts_2026052618container_internal10StringHash14hash_with_seedENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm:
   86|  1.24k|  size_t hash_with_seed(absl::string_view v, size_t seed) const {
   87|  1.24k|    return absl::hash_internal::HashWithSeed().hash(
   88|  1.24k|        absl::Hash<absl::string_view>{}, v, seed);
   89|  1.24k|  }
_ZNK4absl12lts_2026052618container_internal8StringEqclENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEES7_:
   98|    295|  bool operator()(absl::string_view lhs, absl::string_view rhs) const {
   99|    295|    return lhs == rhs;
  100|    295|  }

_ZN4absl12lts_2026052618container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE5applyINS1_12EqualElementINS4_12basic_stringIcS7_NS4_9allocatorIcEEEENS1_8StringEqEEEJRNS4_4pairIKS8_hEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSO_DpOSP_:
  130|     19|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|     19|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|     19|  }
_ZN4absl12lts_2026052618container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE5applyINS1_11HashElementINS1_10StringHashELb1EEEJRNS4_4pairIKS8_hEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSK_DpOSL_:
  130|    434|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|    434|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|    434|  }
_ZN4absl12lts_2026052618container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE5applyINS1_12EqualElementIS8_NS1_8StringEqEEEJRNS4_4pairIKS8_iEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSK_DpOSL_:
  130|     18|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|     18|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|     18|  }
_ZN4absl12lts_2026052618container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE5applyINS1_12raw_hash_setIS9_JEE19EmplaceDecomposableEJRKNS4_4pairIKS8_iEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSL_DpOSM_:
  130|    298|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|    298|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|    298|  }
_ZN4absl12lts_2026052618container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE5applyINS1_12EqualElementIS8_NS1_8StringEqEEEJRNS4_4pairIKS8_hEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSK_DpOSL_:
  130|    258|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|    258|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|    258|  }

_ZN4absl12lts_2026052618container_internal13TrailingZerosImEEjT_:
   63|     14|uint32_t TrailingZeros(T x) {
   64|     14|  ABSL_ASSUME(x != 0);
  ------------------
  |  |  271|     14|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
   65|     14|  return static_cast<uint32_t>(countr_zero(x));
   66|     14|}
_ZN4absl12lts_2026052618container_internal13GroupSse2ImplC2EPKNS1_6ctrl_tE:
  284|    866|  explicit GroupSse2Impl(const ctrl_t* pos) {
  285|    866|    ctrl = _mm_loadu_si128(reinterpret_cast<const __m128i*>(pos));
  286|    866|  }
_ZNK4absl12lts_2026052618container_internal13GroupSse2Impl8MaskFullEv:
  308|     31|  BitMaskType MaskFull() const { return BitMaskType(MoveMask(ctrl) ^ 0xffff); }
_ZN4absl12lts_2026052618container_internal13GroupSse2Impl8MoveMaskEDv2_x:
  344|  1.43k|  static MaskInt MoveMask(__m128i xmm) {
  345|  1.43k|    auto mask = static_cast<MaskInt>(_mm_movemask_epi8(xmm));
  346|  1.43k|#ifdef __clang__
  347|       |    // TODO(b/472522597): Without the inline asm, clang ends up generating an
  348|       |    // unnecessary movzx to zero the upper bits of the output, but those bits
  349|       |    // are already zero. See https://godbolt.org/z/G6xW1Ecbx.
  350|  1.43k|    asm("" : "+r"(mask));  // NOLINT
  351|  1.43k|#endif
  352|  1.43k|    return mask;
  353|  1.43k|  }
_ZN4absl12lts_2026052618container_internal7BitMaskIjLi16ELi0ELb0EEC2Ej:
  133|  1.71k|  explicit BitMask(T mask) : Base(mask) {
  134|  1.71k|    if (Shift == 3 && !NullifyBitsOnIteration) {
  ------------------
  |  Branch (134:9): [Folded, False: 1.71k]
  |  Branch (134:23): [True: 0, Folded]
  ------------------
  135|       |      ABSL_SWISSTABLE_ASSERT(this->mask_ == (this->mask_ & kMsbs8Bytes));
  ------------------
  |  |   58|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  136|      0|    }
  137|  1.71k|  }
_ZN4absl12lts_2026052618container_internal18NonIterableBitMaskIjLi16ELi0EEC2Ej:
   85|  2.28k|  explicit NonIterableBitMask(T mask) : mask_(mask) {}
_ZNK4absl12lts_2026052618container_internal7BitMaskIjLi16ELi0ELb0EE5beginEv:
  153|    854|  BitMask begin() const { return *this; }
_ZNK4absl12lts_2026052618container_internal7BitMaskIjLi16ELi0ELb0EE3endEv:
  154|    854|  BitMask end() const { return BitMask(0); }
_ZN4absl12lts_2026052618container_internalneERKNS1_7BitMaskIjLi16ELi0ELb0EEES5_:
  160|  1.32k|  friend bool operator!=(const BitMask& a, const BitMask& b) {
  161|  1.32k|    return a.mask_ != b.mask_;
  162|  1.32k|  }
_ZNK4absl12lts_2026052618container_internal7BitMaskIjLi16ELi0ELb0EEdeEv:
  151|    728|  uint32_t operator*() const { return Base::LowestBitSet(); }
_ZNK4absl12lts_2026052618container_internal18NonIterableBitMaskIjLi16ELi0EE12LowestBitSetEv:
   90|  1.28k|  uint32_t LowestBitSet() const {
   91|  1.28k|    return container_internal::TrailingZeros(mask_) >> Shift;
   92|  1.28k|  }
_ZN4absl12lts_2026052618container_internal13TrailingZerosIjEEjT_:
   63|  1.28k|uint32_t TrailingZeros(T x) {
   64|  1.28k|  ABSL_ASSUME(x != 0);
  ------------------
  |  |  271|  1.28k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
   65|  1.28k|  return static_cast<uint32_t>(countr_zero(x));
   66|  1.28k|}
_ZNK4absl12lts_2026052618container_internal13GroupSse2Impl11MaskNonFullEv:
  313|      7|  auto MaskNonFull() const { return BitMaskType(MoveMask(ctrl)); }
_ZNK4absl12lts_2026052618container_internal18NonIterableBitMaskIjLi16ELi0EEcvbEv:
   87|    576|  explicit operator bool() const { return mask_ != 0; }
_ZN4absl12lts_2026052618container_internal7BitMaskIjLi16ELi0ELb0EEppEv:
  143|    469|  BitMask& operator++() {
  144|    469|    if (Shift == 3 && NullifyBitsOnIteration) {
  ------------------
  |  Branch (144:9): [Folded, False: 469]
  |  Branch (144:23): [Folded, False: 0]
  ------------------
  145|      0|      this->mask_ &= kMsbs8Bytes;
  146|      0|    }
  147|    469|    this->mask_ &= (this->mask_ - 1);
  148|    469|    return *this;
  149|    469|  }
_ZNK4absl12lts_2026052618container_internal13GroupSse2Impl5MatchEh:
  289|    823|  BitMaskType Match(h2_t hash) const {
  290|    823|    auto match = _mm_set1_epi8(static_cast<char>(hash));
  291|    823|    return BitMaskType(MoveMask(_mm_cmpeq_epi8(match, ctrl)));
  292|    823|  }
_ZNK4absl12lts_2026052618container_internal13GroupSse2Impl9MaskEmptyEv:
  295|    564|  NonIterableBitMaskType MaskEmpty() const {
  296|       |#ifdef ABSL_INTERNAL_HAVE_SSSE3
  297|       |    // This only works because ctrl_t::kEmpty is -128.
  298|       |    return NonIterableBitMaskType(MoveMask(_mm_sign_epi8(ctrl, ctrl)));
  299|       |#else
  300|    564|    auto match = _mm_set1_epi8(static_cast<char>(ctrl_t::kEmpty));
  301|    564|    return NonIterableBitMaskType(MoveMask(_mm_cmpeq_epi8(match, ctrl)));
  302|    564|#endif
  303|    564|  }
_ZN4absl12lts_2026052618container_internal16IsEmptyOrDeletedENS1_6ctrl_tE:
  228|     71|inline bool IsEmptyOrDeleted(ctrl_t c) { return c < ctrl_t::kSentinel; }

_ZN4absl12lts_2026052618container_internal21ShouldSampleNextTableEv:
  226|      3|inline bool ShouldSampleNextTable() {
  227|       |#if defined(ABSL_INTERNAL_HASHTABLEZ_SAMPLE)
  228|       |  if (ABSL_PREDICT_TRUE(--global_next_sample.next_sample > 0)) {
  229|       |    return false;
  230|       |  }
  231|       |  return true;
  232|       |#else
  233|      3|  return false;
  234|      3|#endif  // ABSL_INTERNAL_HASHTABLEZ_SAMPLE
  235|      3|}

_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEC2Ev:
  107|      1|  raw_hash_map() {}
_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEixINS4_12basic_stringIcS7_NS4_9allocatorIcEEEES9_TpTnRiJETnNS4_9enable_ifIXsr14LifetimeBoundKIT_Lb1EPSI_EE5valueEiE4typeELi0EEEDTclsrT0_5valueclL_ZNS4_9addressofB8ne220000INS4_4pairIKS8_hEEEESJ_RSI_EclL_ZNS4_7declvalB8ne220000IRSQ_EEDTclsr3stdE9__declvalISI_ELi0EEEvEEEEERKSI_:
  339|    256|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  340|    256|    return this->template operator[]<K, P, 0>(key);
  341|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEixINS4_12basic_stringIcS7_NS4_9allocatorIcEEEES9_Li0EEEDTclsrT0_5valueclL_ZNS4_9addressofB8ne220000INS4_4pairIKS8_hEEEEPT_RSL_EclL_ZNS4_7declvalB8ne220000IRSK_EEDTclsr3stdE9__declvalISL_ELi0EEEvEEEEERKSL_:
  329|    256|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  330|       |    // It is safe to use unchecked_deref here because try_emplace
  331|       |    // will always return an iterator pointing to a valid item in the table,
  332|       |    // since it inserts if nothing is found for the given key.
  333|    256|    return Policy::value(&this->unchecked_deref(try_emplace(key).first));
  334|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11try_emplaceINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEJETnNS4_9enable_ifIXsr14LifetimeBoundKIT_Lb1EPSH_EE5valueEiE4typeELi0ETnNSG_IXntsr3std14is_convertibleISH_NS1_12raw_hash_setIS9_JEE14const_iteratorEEE5valueEiE4typeELi0EEENS4_4pairINSM_8iteratorEbEERKSH_DpOT0_:
  253|    256|      Args&&... args) ABSL_ATTRIBUTE_LIFETIME_BOUND {
  254|    256|    return this->template try_emplace<K, 0>(k, std::forward<Args>(args)...);
  255|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11try_emplaceINS4_12basic_stringIcS7_NS4_9allocatorIcEEEELi0EJETnNS4_9enable_ifIXntsr3std14is_convertibleIT_NS1_12raw_hash_setIS9_JEE14const_iteratorEEE5valueEiE4typeELi0EEENS4_4pairINSJ_8iteratorEbEERKSH_DpOT1_:
  244|    256|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  245|    256|    return try_emplace_impl(k, std::forward<Args>(args)...);
  246|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE16try_emplace_implIRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEJEEENS4_4pairINS1_12raw_hash_setIS9_JEE8iteratorEbEEOT_DpOT0_:
  365|    256|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  366|    256|    auto res = this->find_or_prepare_insert(k);
  367|    256|    if (res.second) {
  ------------------
  |  Branch (367:9): [True: 256, False: 0]
  ------------------
  368|    256|      this->emplace_at(res.first, std::piecewise_construct,
  369|    256|                       std::forward_as_tuple(std::forward<K>(k)),
  370|    256|                       std::forward_as_tuple(std::forward<Args>(args)...));
  371|    256|    }
  372|    256|    return res;
  373|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEEC2Ev:
  107|      2|  raw_hash_map() {}

_ZN4absl12lts_2026052618container_internal14SizeToCapacityEm:
  430|      2|constexpr size_t SizeToCapacity(size_t size) {
  431|      2|  if (size == 0) {
  ------------------
  |  Branch (431:7): [True: 0, False: 2]
  ------------------
  432|      0|    return 0;
  433|      0|  }
  434|       |  // The minimum possible capacity is NormalizeCapacity(size).
  435|       |  // Shifting right `~size_t{}` by `leading_zeros` yields
  436|       |  // NormalizeCapacity(size).
  437|      2|  int leading_zeros = absl::countl_zero(size);
  438|      2|  constexpr size_t kLast3Bits = size_t{7} << (sizeof(size_t) * 8 - 3);
  439|       |  // max_size_for_next_capacity = max_load_factor * next_capacity
  440|       |  //                            = (7/8) * (~size_t{} >> leading_zeros)
  441|       |  //                            = (7/8*~size_t{}) >> leading_zeros
  442|       |  //                            = kLast3Bits >> leading_zeros
  443|      2|  size_t max_size_for_next_capacity = kLast3Bits >> leading_zeros;
  444|       |  // Decrease shift if size is too big for the minimum capacity.
  445|      2|  leading_zeros -= static_cast<int>(size > max_size_for_next_capacity);
  446|       |  if constexpr (Group::kWidth == 8) {
  447|       |    // Formula doesn't work when size==7 for 8-wide groups.
  448|       |    leading_zeros -= (size == 7);
  449|       |  }
  450|      2|  return (~size_t{}) >> leading_zeros;
  451|      2|}
_ZN4absl12lts_2026052618container_internal11SooCapacityEv:
  364|      2|constexpr size_t SooCapacity() { return 1; }
_ZN4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEC2Em:
  491|     14|      : capacity_data_(static_cast<IntType>(
  492|     14|            StorageMode == kCapacityByValue ? capacity
  ------------------
  |  Branch (492:13): [Folded, False: 14]
  ------------------
  493|     14|                                            : TrailingZeros(capacity + 1))) {
  494|       |    ABSL_SWISSTABLE_ASSERT(capacity == 0 || IsValidCapacity(capacity));
  ------------------
  |  |  256|     14|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  495|     14|  }
_ZN4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EEC2ENS1_21HashtableCapacityImplILS3_1EEENS1_19no_seed_empty_tag_tE:
  629|      3|      : capacity_internal_(capacity.ToRawData()), data_(0) {}
_ZNK4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE9ToRawDataEv:
  506|     14|  IntType ToRawData() const { return capacity_data_; }
_ZN4absl12lts_2026052618container_internal12CommonFieldsC2ENS1_13non_soo_tag_tE:
 1131|      3|      : inline_data_(HashtableCapacity(0), no_seed_empty_tag_t{}) {}
_ZNK4absl12lts_2026052618container_internal12CommonFields8capacityEv:
 1232|  5.80k|  size_t capacity() const { return capacity_impl().capacity(); }
_ZNK4absl12lts_2026052618container_internal12CommonFields13capacity_implEv:
 1227|  6.62k|  HashtableCapacity capacity_impl() const {
 1228|  6.62k|    HashtableCapacity cap = inline_data_.capacity();
 1229|       |    ABSL_SWISSTABLE_ASSERT(cap.IsValid());
  ------------------
  |  |  256|  6.62k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1230|  6.62k|    return cap;
 1231|  6.62k|  }
_ZNK4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8capacityEv:
  636|  7.43k|  HashtableCapacity capacity() const {
  637|  7.43k|    return HashtableCapacity::FromRawData(capacity_internal_);
  638|  7.43k|  }
_ZN4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE11FromRawDataEm:
  501|  7.43k|  static HashtableCapacityImpl FromRawData(uint64_t capacity) {
  502|  7.43k|    auto cap = HashtableCapacityImpl(uninitialized_tag_t{});
  503|  7.43k|    cap.capacity_data_ = static_cast<IntType>(capacity);
  504|  7.43k|    return cap;
  505|  7.43k|  }
_ZN4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEC2ENS1_19uninitialized_tag_tE:
  489|  7.43k|  explicit HashtableCapacityImpl(uninitialized_tag_t) {}
_ZNK4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE8capacityEv:
  520|  7.19k|  constexpr size_t capacity() const {
  521|  7.19k|    ABSL_SWISSTABLE_ASSERT(IsValid());
  ------------------
  |  |  256|  7.19k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  522|  7.19k|    return StorageMode == kCapacityByValue ? capacity_data_
  ------------------
  |  Branch (522:12): [Folded, False: 7.19k]
  ------------------
  523|  7.19k|                                           : (size_t{1} << capacity_data_) - 1;
  524|  7.19k|  }
_ZN4absl12lts_2026052618container_internal16PreviousCapacityEm:
  400|      5|constexpr size_t PreviousCapacity(size_t n) {
  401|       |  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(n));
  ------------------
  |  |  256|      5|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  402|      5|  return n / 2;
  403|      5|}
_ZNK4absl12lts_2026052618container_internal12CommonFields7controlEv:
 1158|  4.12k|  ctrl_t* control() const {
 1159|  4.12k|    ABSL_SWISSTABLE_ASSERT(capacity() > 0);
  ------------------
  |  |  256|  4.12k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1160|       |    // Assume that the control bytes don't alias `this`.
 1161|  4.12k|    ctrl_t* ctrl = heap_or_soo_.control().get();
 1162|  4.12k|    [[maybe_unused]] size_t num_control_bytes = NumControlBytes(capacity());
 1163|  4.12k|    ABSL_ASSUME(reinterpret_cast<uintptr_t>(ctrl + num_control_bytes) <=
  ------------------
  |  |  271|  8.24k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (271:44): [True: 0, False: 4.12k]
  |  |  |  Branch (271:44): [True: 4.12k, False: 0]
  |  |  ------------------
  ------------------
 1164|  4.12k|                    reinterpret_cast<uintptr_t>(this) ||
 1165|  4.12k|                reinterpret_cast<uintptr_t>(this + 1) <=
 1166|  4.12k|                    reinterpret_cast<uintptr_t>(ctrl));
 1167|  4.12k|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(ctrl);
  ------------------
  |  |  488|  4.12k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1168|  4.12k|  }
_ZNK4absl12lts_2026052618container_internal9HeapOrSoo7controlEv:
 1091|  4.12k|  MaybeInitializedPtr<ctrl_t> control() const {
 1092|  4.12k|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.control);
  ------------------
  |  |  488|  4.12k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1093|  4.12k|  }
_ZNK4absl12lts_2026052618container_internal19MaybeInitializedPtrINS1_6ctrl_tEE3getEv:
 1060|  4.12k|  T* get() const { ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(p); }
  ------------------
  |  |  488|  4.12k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
_ZN4absl12lts_2026052618container_internal15NumControlBytesEm:
  988|  4.14k|constexpr size_t NumControlBytes(size_t capacity) {
  989|  4.14k|  return IsSmallCapacity(capacity) ? 0 : capacity + 1 + NumClonedBytes();
  ------------------
  |  Branch (989:10): [True: 3, False: 4.13k]
  ------------------
  990|  4.14k|}
_ZN4absl12lts_2026052618container_internal15IsSmallCapacityEm:
  384|  4.16k|constexpr bool IsSmallCapacity(size_t capacity) {
  385|  4.16k|  return capacity <= MaxSmallCapacity();
  386|  4.16k|}
_ZN4absl12lts_2026052618container_internal16MaxSmallCapacityEv:
  366|  4.16k|constexpr size_t MaxSmallCapacity() { return 1; }
_ZN4absl12lts_2026052618container_internal14NumClonedBytesEv:
  985|  5.24k|constexpr size_t NumClonedBytes() { return Group::kWidth - 1; }
_ZNK4absl12lts_2026052618container_internal12CommonFields10slot_arrayEv:
 1173|  2.50k|  void* slot_array() const { return heap_or_soo_.slot_array().get(); }
_ZNK4absl12lts_2026052618container_internal9HeapOrSoo10slot_arrayEv:
 1097|  2.50k|  MaybeInitializedPtr<void> slot_array() const {
 1098|  2.50k|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.slot_array);
  ------------------
  |  |  488|  2.50k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1099|  2.50k|  }
_ZNK4absl12lts_2026052618container_internal19MaybeInitializedPtrIvE3getEv:
 1060|  2.50k|  T* get() const { ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(p); }
  ------------------
  |  |  488|  2.50k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
_ZNK4absl12lts_2026052618container_internal12CommonFields4seedEv:
 1212|  1.25k|  PerTableSeed seed() const { return inline_data_.seed(); }
_ZNK4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE4seedEv:
  668|  1.25k|  PerTableSeed seed() const { return PerTableSeed(data_ & kSeedMask); }
_ZN4absl12lts_2026052618container_internal16PerTableSeedImplIhEC2Em:
  605|  1.25k|      : seed_(static_cast<IntType>(seed)) {}
_ZNK4absl12lts_2026052618container_internal16PerTableSeedImplIhE4seedEv:
  598|  1.25k|  size_t seed() const { return seed_; }
_ZN4absl12lts_2026052618container_internal2H1Em:
  740|  1.25k|inline size_t H1(size_t hash) { return hash; }
_ZN4absl12lts_2026052618container_internal2H2Em:
  745|  1.80k|inline h2_t H2(size_t hash) { return hash >> (sizeof(size_t) * 8 - 7); }
_ZN4absl12lts_2026052618container_internal29TryFindNewIndexWithoutProbingIvEEmmmmPNS1_6ctrl_tEm:
 1652|    434|                                            size_t new_capacity) {
 1653|    434|  size_t index_diff = old_index - h1;
 1654|       |  // The first probe group starts with h1 & capacity.
 1655|       |  // All following groups start at (h1 + Group::kWidth * K) & capacity.
 1656|       |  // We can find an index within the floating group as index_diff modulo
 1657|       |  // Group::kWidth.
 1658|       |  // Both old and new capacity are larger than Group::kWidth so we can avoid
 1659|       |  // computing `& capacity`.
 1660|    434|  size_t in_floating_group_index = index_diff & (Group::kWidth - 1);
 1661|       |  // By subtracting we will get the difference between the first probe group
 1662|       |  // and the probe group corresponding to old_index.
 1663|    434|  index_diff -= in_floating_group_index;
 1664|    434|  if (ABSL_PREDICT_TRUE((index_diff & old_capacity) == 0)) {
  ------------------
  |  |  191|    434|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 425, False: 9]
  |  |  |  Branch (191:48): [Folded, False: 434]
  |  |  |  Branch (191:57): [True: 425, False: 9]
  |  |  ------------------
  ------------------
 1665|    425|    size_t new_index = (h1 + in_floating_group_index) & new_capacity;
 1666|    425|    ABSL_ASSUME(new_index != kProbedElementIndexSentinel);
  ------------------
  |  |  271|    425|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1667|    425|    return new_index;
 1668|    425|  }
 1669|      9|  ABSL_SWISSTABLE_ASSERT(((old_index - h1) & old_capacity) >= Group::kWidth);
  ------------------
  |  |  256|      9|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1670|       |  // Try to insert element into the first probe group.
 1671|       |  // new_ctrl is not yet fully initialized so we can't use regular search via
 1672|       |  // find_first_non_full.
 1673|       |
 1674|       |  // We can search in the first probe group only if it is located in already
 1675|       |  // initialized part of the table.
 1676|      9|  if (ABSL_PREDICT_FALSE((h1 & old_capacity) >= old_index)) {
  ------------------
  |  |  190|      9|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 2, False: 7]
  |  |  |  Branch (190:49): [Folded, False: 9]
  |  |  |  Branch (190:58): [True: 2, False: 7]
  |  |  ------------------
  ------------------
 1677|      2|    return kProbedElementIndexSentinel;
 1678|      2|  }
 1679|      7|  size_t offset = h1 & new_capacity;
 1680|      7|  Group new_g(new_ctrl + offset);
 1681|      7|  if (auto mask = new_g.MaskNonFull(); ABSL_PREDICT_TRUE(mask)) {
  ------------------
  |  |  191|      7|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 7, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 7]
  |  |  |  Branch (191:57): [True: 7, False: 0]
  |  |  ------------------
  ------------------
 1682|      7|    size_t result = offset + mask.LowestBitSet();
 1683|      7|    ABSL_ASSUME(result != kProbedElementIndexSentinel);
  ------------------
  |  |  271|      7|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1684|      7|    return result;
 1685|      7|  }
 1686|      0|  return kProbedElementIndexSentinel;
 1687|      7|}
_ZN4absl12lts_2026052618container_internal12MaxValidSizeILm8EEEmmm:
 1838|      2|constexpr size_t MaxValidSize(size_t key_size, size_t slot_size) {
 1839|      2|  return (std::min)(MaxValidSizeForKeySize<kSizeOfSizeT>(key_size),
 1840|      2|                    MaxValidSizeForSlotSize<kSizeOfSizeT>(slot_size));
 1841|      2|}
_ZN4absl12lts_2026052618container_internal22MaxValidSizeForKeySizeILm8EEEmm:
 1819|      2|constexpr size_t MaxValidSizeForKeySize(size_t key_size) {
 1820|      2|  if (key_size < kSizeOfSizeT) return size_t{1} << 8 * key_size;
  ------------------
  |  Branch (1820:7): [True: 0, False: 2]
  ------------------
 1821|      2|  return (std::numeric_limits<size_t>::max)();
 1822|      2|}
_ZN4absl12lts_2026052618container_internal23MaxValidSizeForSlotSizeILm8EEEmm:
 1825|      2|constexpr size_t MaxValidSizeForSlotSize(size_t slot_size) {
 1826|      2|  if constexpr (kSizeOfSizeT == 8) {
 1827|       |    // For small slot sizes we are limited by HashtableStackData::kSizeBitCount.
 1828|      2|    if (slot_size < size_t{1} << (64 - HashtableInlineData::kSizeBitCount)) {
  ------------------
  |  Branch (1828:9): [True: 2, False: 0]
  ------------------
 1829|      2|      return MaxStorableSize();
 1830|      2|    }
 1831|      2|  }
 1832|      0|  return MaxSizeAtMaxValidCapacity<kSizeOfSizeT>(slot_size);
 1833|      2|}
_ZN4absl12lts_2026052618container_internal15MaxStorableSizeEv:
 1809|      2|constexpr size_t MaxStorableSize() {
 1810|      2|  return static_cast<size_t>(uint64_t{1}
 1811|      2|                             << HashtableInlineData::kSizeBitCount) -
 1812|      2|         1;
 1813|      2|}
_ZN4absl12lts_2026052618container_internal16CapacityToGrowthEm:
  415|     10|constexpr size_t CapacityToGrowth(size_t capacity) {
  416|     10|  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(capacity));
  ------------------
  |  |  256|     10|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  417|       |  // `capacity*7/8`
  418|     10|  if (Group::kWidth == 8 && capacity == 7) {
  ------------------
  |  Branch (418:7): [Folded, False: 10]
  |  Branch (418:29): [True: 0, False: 0]
  ------------------
  419|       |    // x-x/8 does not work when x==7.
  420|      0|    return 6;
  421|      0|  }
  422|     10|  return capacity - capacity / 8;
  423|     10|}
_ZNK4absl12lts_2026052618container_internal12CommonFields8is_smallEv:
 1242|    816|  bool is_small() const { return inline_data_.is_small(); }
_ZNK4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8is_smallEv:
  639|    816|  bool is_small() const { return capacity().is_small(); }
_ZNK4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE8is_smallEv:
  526|    816|  constexpr bool is_small() const {
  527|       |    // Small tables have capacity 0 or 1. This expression is valid for both
  528|       |    // capacity storage modes.
  529|       |    // Comparing capacity_data_ directly leads to a better generated code.
  530|       |    // One byte comparison is used before computing the capacity in order to
  531|       |    // detect small tables faster for critical path.
  532|    816|    static_assert(MaxSmallCapacity() == 1);
  533|    816|    return capacity_data_ <= 1;
  534|    816|  }
_ZNK4absl12lts_2026052618container_internal12CommonFields4sizeEv:
 1180|     13|  size_t size() const { return inline_data_.size(); }
_ZNK4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE4sizeEv:
  645|     13|  size_t size() const { return static_cast<size_t>(data_ >> kSizeShift); }
_ZN4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8set_sizeEm:
  663|      1|  void set_size(size_t size) {
  664|      1|    data_ =
  665|      1|        (data_ & kMetadataMask) | (static_cast<uint64_t>(size) << kSizeShift);
  666|      1|  }
_ZN4absl12lts_2026052618container_internal10SooControlEv:
  340|      1|inline ctrl_t* SooControl() {
  341|       |  // Const must be cast away here; no uses of this function will actually write
  342|       |  // to it because it is only used for SOO iterators.
  343|      1|  return const_cast<ctrl_t*>(kSooControl);
  344|      1|}
_ZNK4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled14generation_ptrEv:
  847|  1.07k|  GenerationType* generation_ptr() const { return nullptr; }
_ZN4absl12lts_2026052618container_internal37HashSetIteratorGenerationInfoDisabledC2EPKh:
  871|  1.07k|  explicit HashSetIteratorGenerationInfoDisabled(const GenerationType*) {}
_ZN4absl12lts_2026052618container_internal5probeERKNS1_12CommonFieldsEm:
 1631|    812|inline probe_seq<Group::kWidth> probe(const CommonFields& common, size_t hash) {
 1632|    812|  return probe(common.capacity_impl(), hash);
 1633|    812|}
_ZN4absl12lts_2026052618container_internal5probeENS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEEm:
 1628|    812|inline probe_seq<Group::kWidth> probe(HashtableCapacity capacity, size_t hash) {
 1629|    812|  return probe_h1(capacity, H1(hash));
 1630|    812|}
_ZN4absl12lts_2026052618container_internal8probe_h1ENS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEEm:
 1625|    819|                                         size_t h1) {
 1626|    819|  return probe_seq<Group::kWidth>(capacity, h1);
 1627|    819|}
_ZN4absl12lts_2026052618container_internal9probe_seqILm16EEC2ENS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEEm:
 1603|    819|      : capacity_(capacity), offset_(capacity.mask(hash)) {}
_ZNK4absl12lts_2026052618container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE4maskEm:
  536|  1.38k|  constexpr size_t mask(size_t value) const {
  537|       |#ifdef __BMI2__
  538|       |    if constexpr (StorageMode == kCapacityByLog) {
  539|       |      if constexpr (sizeof(size_t) == 8) {
  540|       |        return _bzhi_u64(value, capacity_data_);
  541|       |      } else {
  542|       |        return _bzhi_u32(value, capacity_data_);
  543|       |      }
  544|       |    }
  545|       |#endif  // __BMI2__
  546|  1.38k|    return value & capacity();
  547|  1.38k|  }
_ZNK4absl12lts_2026052618container_internal9probe_seqILm16EE6offsetEv:
 1606|  2.21k|  size_t offset() const { return offset_; }
_ZNK4absl12lts_2026052618container_internal9probe_seqILm16EE6offsetEm:
 1607|    558|  size_t offset(size_t i) const { return capacity_.mask(offset_ + i); }
_ZNK4absl12lts_2026052618container_internal9probe_seqILm16EE5indexEv:
 1615|    557|  size_t index() const { return index_; }
_ZN4absl12lts_2026052618container_internal9probe_seqILm16EE4nextEv:
 1609|     11|  void next() {
 1610|     11|    index_ += Width;
 1611|     11|    offset_ += index_;
 1612|     11|    offset_ = capacity_.mask(offset_);
 1613|     11|  }
_ZN4absl12lts_2026052618container_internal15IsValidCapacityEm:
  381|      3|constexpr bool IsValidCapacity(size_t n) { return ((n + 1) & n) == 0 && n > 0; }
  ------------------
  |  Branch (381:51): [True: 3, False: 0]
  |  Branch (381:73): [True: 1, False: 2]
  ------------------
_ZN4absl12lts_2026052618container_internal12CommonFields5infozEv:
 1274|    556|  HashtablezInfoHandle infoz() {
 1275|    556|    return has_infoz() ? *infoz_ptr() : HashtablezInfoHandle();
  ------------------
  |  Branch (1275:12): [True: 0, False: 556]
  ------------------
 1276|    556|  }
_ZN4absl12lts_2026052618container_internal13ControlOffsetEbb:
  999|     19|constexpr size_t ControlOffset(bool has_infoz, bool has_growth_info) {
 1000|     19|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|     19|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 19]
  |  |  |  Branch (190:49): [Folded, False: 19]
  |  |  |  Branch (190:58): [True: 0, False: 19]
  |  |  ------------------
  ------------------
 1001|       |    // We always allocate GrowthInfo for sampled tables to allow branchless
 1002|       |    // access to infoz pointer.
 1003|      0|    return sizeof(HashtablezInfoHandle) + sizeof(GrowthInfo);
 1004|      0|  }
 1005|     19|  return has_growth_info ? sizeof(GrowthInfo) : 0;
  ------------------
  |  Branch (1005:10): [True: 17, False: 2]
  ------------------
 1006|     19|}
_ZN4absl12lts_2026052618container_internal24HasGrowthInfoForCapacityEm:
  993|     21|constexpr bool HasGrowthInfoForCapacity(size_t capacity) {
  994|     21|  return !IsSmallCapacity(capacity);
  995|     21|}
_ZNK4absl12lts_2026052618container_internal12CommonFields9has_infozEv:
 1258|    556|  bool has_infoz() const { return inline_data_.has_infoz(); }
_ZNK4absl12lts_2026052618container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE9has_infozEv:
  683|    556|  bool has_infoz() const {
  684|    556|    return ABSL_PREDICT_FALSE((data_ & kHasInfozMask) != 0);
  ------------------
  |  |  190|    556|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:49): [Folded, False: 556]
  |  |  |  Branch (190:58): [True: 0, False: 556]
  |  |  ------------------
  ------------------
  685|    556|  }
_ZN4absl12lts_2026052618container_internal26AssertIsValidForComparisonEPKNS1_6ctrl_tEhPKh:
 1456|    600|                                       const GenerationType* generation_ptr) {
 1457|    600|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1457:7): [True: 600, Folded]
  ------------------
 1458|      0|  const bool ctrl_is_valid_for_comparison =
 1459|      0|      ctrl == nullptr || ctrl == DefaultIterControl() ||
  ------------------
  |  Branch (1459:7): [True: 0, False: 0]
  |  Branch (1459:26): [True: 0, False: 0]
  ------------------
 1460|      0|      IsFull(CrashIfIteratorIsInvalid(ctrl));
  ------------------
  |  Branch (1460:7): [True: 0, False: 0]
  ------------------
 1461|      0|  if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (1461:7): [Folded, False: 0]
  ------------------
 1462|      0|    if (ABSL_PREDICT_FALSE(generation !=
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1463|      0|                           CrashIfIteratorIsInvalid(generation_ptr))) {
 1464|       |      // Note: in the case of a rehash, we would expect to see a sanitizer crash
 1465|       |      // in CrashIfIteratorIsInvalid so this assertion will only catch moved
 1466|       |      // table cases, unless we're using a custom allocator that does not
 1467|       |      // deallocate the old backing array (e.g. an arena allocator).
 1468|      0|      ABSL_RAW_LOG(
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1469|      0|          FATAL,
 1470|      0|          "Invalid iterator comparison. The table was likely moved (or "
 1471|      0|          "possibly rehashed) since this iterator was initialized.");
 1472|      0|    }
 1473|      0|    if (ABSL_PREDICT_FALSE(!ctrl_is_valid_for_comparison)) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1474|      0|      ABSL_RAW_LOG(
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1475|      0|          FATAL, "Invalid iterator comparison. The element was likely erased.");
 1476|      0|    }
 1477|      0|  } else {
 1478|      0|    ABSL_HARDENING_ASSERT_SLOW(
  ------------------
  |  |  175|      0|#define ABSL_HARDENING_ASSERT_SLOW(expr) ABSL_ASSERT(expr)
  |  |  ------------------
  |  |  |  |  127|      0|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  |  |  ------------------
  |  |  |  |  |  |   87|      0|#define ABSL_INTERNAL_UNEVALUATED(expr) (false ? (void)(expr) : void())
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (87:42): [Folded, False: 0]
  |  |  |  |  |  |  |  Branch (87:57): [True: 0, False: 0]
  |  |  |  |  |  |  |  Branch (87:57): [True: 0, Folded]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1479|      0|        ctrl_is_valid_for_comparison &&
 1480|      0|        "Invalid iterator comparison. The element might have been erased or "
 1481|      0|        "the table might have rehashed. Consider running with --config=asan to "
 1482|      0|        "diagnose rehashing issues.");
 1483|      0|  }
 1484|      0|}
_ZNK4absl12lts_2026052618container_internal37HashSetIteratorGenerationInfoDisabled10generationEv:
  873|  1.19k|  GenerationType generation() const { return 0; }
_ZNK4absl12lts_2026052618container_internal37HashSetIteratorGenerationInfoDisabled14generation_ptrEv:
  875|  1.79k|  const GenerationType* generation_ptr() const { return nullptr; }
_ZN4absl12lts_2026052618container_internal19AssertSameContainerEPKNS1_6ctrl_tES4_RKPKvS8_PKhSA_:
 1516|    300|                                const GenerationType* generation_ptr_b) {
 1517|    300|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1517:7): [True: 300, Folded]
  ------------------
 1518|       |  // `SwisstableDebugEnabled()` is also true for release builds with hardening
 1519|       |  // enabled. To minimize their impact in those builds:
 1520|       |  // - use `ABSL_PREDICT_FALSE()` to provide a compiler hint for code layout
 1521|       |  // - use `ABSL_RAW_LOG()` with a format string to reduce code size and improve
 1522|       |  //   the chances that the hot paths will be inlined.
 1523|       |
 1524|       |  // fail_if(is_invalid, message) crashes when is_invalid is true and provides
 1525|       |  // an error message based on `message`.
 1526|      0|  const auto fail_if = [](bool is_invalid, const char* message) {
 1527|      0|    if (ABSL_PREDICT_FALSE(is_invalid)) {
 1528|      0|      ABSL_RAW_LOG(FATAL, "Invalid iterator comparison. %s", message);
 1529|      0|    }
 1530|      0|  };
 1531|       |
 1532|      0|  const bool a_is_default = ctrl_a == DefaultIterControl();
 1533|      0|  const bool b_is_default = ctrl_b == DefaultIterControl();
 1534|      0|  if (a_is_default && b_is_default) return;
  ------------------
  |  Branch (1534:7): [True: 0, False: 0]
  |  Branch (1534:23): [True: 0, False: 0]
  ------------------
 1535|      0|  fail_if(a_is_default != b_is_default,
 1536|      0|          "Comparing default-constructed hashtable iterator with a "
 1537|      0|          "non-default-constructed hashtable iterator.");
 1538|       |
 1539|      0|  if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (1539:7): [Folded, False: 0]
  ------------------
 1540|      0|    if (ABSL_PREDICT_TRUE(generation_ptr_a == generation_ptr_b)) return;
  ------------------
  |  |  191|      0|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 0]
  |  |  |  Branch (191:57): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1541|      0|    const bool a_is_empty = IsEmptyGeneration(generation_ptr_a);
 1542|      0|    const bool b_is_empty = IsEmptyGeneration(generation_ptr_b);
 1543|      0|    fail_if(a_is_empty != b_is_empty,
 1544|      0|            "Comparing an iterator from an empty hashtable with an iterator "
 1545|      0|            "from a non-empty hashtable.");
 1546|      0|    fail_if(a_is_empty && b_is_empty,
  ------------------
  |  Branch (1546:13): [True: 0, False: 0]
  |  Branch (1546:27): [True: 0, False: 0]
  ------------------
 1547|      0|            "Comparing iterators from different empty hashtables.");
 1548|       |
 1549|      0|    const bool a_is_end = ctrl_a == nullptr;
 1550|      0|    const bool b_is_end = ctrl_b == nullptr;
 1551|      0|    fail_if(a_is_end || b_is_end,
  ------------------
  |  Branch (1551:13): [True: 0, False: 0]
  |  Branch (1551:25): [True: 0, False: 0]
  ------------------
 1552|      0|            "Comparing iterator with an end() iterator from a different "
 1553|      0|            "hashtable.");
 1554|      0|    fail_if(true, "Comparing non-end() iterators from different hashtables.");
 1555|      0|  } else {
 1556|      0|    ABSL_HARDENING_ASSERT_SLOW(
  ------------------
  |  |  175|      0|#define ABSL_HARDENING_ASSERT_SLOW(expr) ABSL_ASSERT(expr)
  |  |  ------------------
  |  |  |  |  127|      0|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  |  |  ------------------
  |  |  |  |  |  |   87|      0|#define ABSL_INTERNAL_UNEVALUATED(expr) (false ? (void)(expr) : void())
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (87:42): [Folded, False: 0]
  |  |  |  |  |  |  |  Branch (87:57): [True: 0, False: 0]
  |  |  |  |  |  |  |  Branch (87:57): [True: 0, Folded]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1557|      0|        AreItersFromSameContainer(ctrl_a, ctrl_b, slot_a, slot_b) &&
 1558|      0|        "Invalid iterator comparison. The iterators may be from different "
 1559|      0|        "containers or the container might have rehashed or moved. Consider "
 1560|      0|        "running with --config=asan to diagnose issues.");
 1561|      0|  }
 1562|      0|}
_ZN4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled19set_reserved_growthEm:
  842|      3|  void set_reserved_growth(size_t) {}
_ZN4absl12lts_2026052618container_internal34CommonFieldsGenerationInfoDisabled20set_reservation_sizeEm:
  844|      5|  void set_reservation_size(size_t) {}
_ZNK4absl12lts_2026052618container_internal12CommonFields11slots_unionEv:
 1174|      1|  MaybeInitializedPtr<void> slots_union() const {
 1175|      1|    return heap_or_soo_.slot_array();
 1176|      1|  }
_ZN4absl12lts_2026052618container_internal12AssertIsFullEPKNS1_6ctrl_tEhPKhPKc:
 1413|    596|                         const char* operation) {
 1414|    596|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1414:7): [True: 596, Folded]
  ------------------
 1415|       |  // `SwisstableDebugEnabled()` is also true for release builds with hardening
 1416|       |  // enabled. To minimize their impact in those builds:
 1417|       |  // - use `ABSL_PREDICT_FALSE()` to provide a compiler hint for code layout
 1418|       |  // - use `ABSL_RAW_LOG()` with a format string to reduce code size and improve
 1419|       |  //   the chances that the hot paths will be inlined.
 1420|      0|  if (ABSL_PREDICT_FALSE(ctrl == nullptr)) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1421|      0|    ABSL_RAW_LOG(FATAL, "%s called on end() iterator.", operation);
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1422|      0|  }
 1423|      0|  if (ABSL_PREDICT_FALSE(ctrl == DefaultIterControl())) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1424|      0|    ABSL_RAW_LOG(FATAL, "%s called on default-constructed iterator.",
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1425|      0|                 operation);
 1426|      0|  }
 1427|      0|  if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (1427:7): [Folded, False: 0]
  ------------------
 1428|      0|    if (ABSL_PREDICT_FALSE(generation !=
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1429|      0|                           CrashIfIteratorIsInvalid(generation_ptr))) {
 1430|      0|      ABSL_RAW_LOG(FATAL,
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1431|      0|                   "%s called on invalid iterator. The table could have "
 1432|      0|                   "rehashed or moved since this iterator was initialized.",
 1433|      0|                   operation);
 1434|      0|    }
 1435|      0|    if (ABSL_PREDICT_FALSE(!IsFull(CrashIfIteratorIsInvalid(ctrl)))) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1436|      0|      ABSL_RAW_LOG(
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1437|      0|          FATAL,
 1438|      0|          "%s called on invalid iterator. The element was likely erased.",
 1439|      0|          operation);
 1440|      0|    }
 1441|      0|  } else {
 1442|      0|    if (ABSL_PREDICT_FALSE(!IsFull(CrashIfIteratorIsInvalid(ctrl)))) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1443|       |      ABSL_RAW_LOG(
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 1444|      0|          FATAL,
 1445|      0|          "%s called on invalid iterator. The element might have been erased "
 1446|      0|          "or the table might have rehashed. Consider running with "
 1447|      0|          "--config=asan to diagnose rehashing issues.",
 1448|      0|          operation);
 1449|      0|    }
 1450|      0|  }
 1451|      0|}
_ZN4absl12lts_2026052618container_internal12CommonFields13CreateDefaultILb0EEES2_v:
 1149|      3|  static CommonFields CreateDefault() {
 1150|      3|    return kSooEnabled ? CommonFields{soo_tag_t{}}
  ------------------
  |  Branch (1150:12): [Folded, False: 3]
  ------------------
 1151|      3|                       : CommonFields{non_soo_tag_t{}};
 1152|      3|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6commonEv:
 3719|  2.13k|  const CommonFields& common() const { return settings_.template get<0>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE15DefaultCapacityEv:
 2095|      2|  constexpr static size_t DefaultCapacity() {
 2096|      2|    return SooEnabled() ? SooCapacity() : 0;
  ------------------
  |  Branch (2096:12): [Folded, False: 2]
  ------------------
 2097|      2|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE12MaxValidSizeEv:
 2098|      2|  constexpr static size_t MaxValidSize() {
 2099|      2|    return container_internal::MaxValidSize(sizeof(key_type),
 2100|      2|                                            sizeof(slot_type));
 2101|      2|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8capacityEv:
 2601|      3|  size_t capacity() const {
 2602|      3|    const size_t cap = common().capacity();
 2603|       |    // Compiler complains when using functions in ASSUME so use local variables.
 2604|      3|    [[maybe_unused]] const bool kIsValid = IsValidCapacity(cap);
 2605|      3|    [[maybe_unused]] const size_t kDefaultCapacity = DefaultCapacity();
 2606|      3|    [[maybe_unused]] const size_t kMaxValidCapacity = MaxValidCapacity();
 2607|      3|    ABSL_ASSUME(kIsValid || cap == 0);
  ------------------
  |  |  271|      5|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (271:44): [True: 1, False: 2]
  |  |  |  Branch (271:44): [True: 2, False: 0]
  |  |  ------------------
  ------------------
 2608|      3|    ABSL_ASSUME(cap >= kDefaultCapacity);
  ------------------
  |  |  271|      3|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2609|      3|    ABSL_ASSUME(cap <= kMaxValidCapacity);
  ------------------
  |  |  271|      3|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2610|      3|    return cap;
 2611|      3|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8is_smallEv:
 2117|    304|  bool is_small() const { return common().is_small(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE5emptyEv:
 2593|      1|  bool empty() const { return !size(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4sizeEv:
 2594|      1|  size_t size() const {
 2595|      1|    AssertNotDebugCapacity();
 2596|      1|    const size_t size = common().size();
 2597|      1|    [[maybe_unused]] const size_t kMaxValidSize = MaxValidSize();
 2598|      1|    ABSL_ASSUME(size <= kMaxValidSize);
  ------------------
  |  |  271|      1|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2599|      1|    return size;
 2600|      1|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22AssertNotDebugCapacityEv:
 3573|    312|  void AssertNotDebugCapacity() const {
 3574|    312|#ifdef NDEBUG
 3575|    312|    if (!SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (3575:9): [True: 312, Folded]
  ------------------
 3576|    312|      return;
 3577|    312|    }
 3578|      0|#endif
 3579|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 3580|      0|    if (ABSL_PREDICT_TRUE(cap.IsValid())) {
  ------------------
  |  |  191|      0|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 0]
  |  |  |  Branch (191:57): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3581|      0|      return;
 3582|      0|    }
 3583|      0|    assert(!cap.IsReentrance() &&
 3584|      0|           "Reentrant container access during element construction/destruction "
 3585|      0|           "is not allowed.");
 3586|       |    if constexpr (SwisstableAssertAccessToDestroyedTable()) {
 3587|       |      if (cap.IsDestroyed()) {
 3588|       |        ABSL_RAW_LOG(FATAL, "Use of destroyed hash table.");
 3589|       |      }
 3590|       |    }
 3591|      0|    if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (3591:9): [Folded, False: 0]
  ------------------
 3592|      0|        ABSL_PREDICT_FALSE(cap.IsMovedFrom())) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3593|      0|      if (cap.IsSelfMovedFrom()) {
  ------------------
  |  Branch (3593:11): [True: 0, False: 0]
  ------------------
 3594|       |        // If this log triggers, then a hash table was move-assigned to itself
 3595|       |        // and then used again later without being reinitialized.
 3596|      0|        ABSL_RAW_LOG(FATAL, "Use of self-move-assigned hash table.");
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3597|      0|      }
 3598|      0|      ABSL_RAW_LOG(FATAL, "Use of moved-from hash table.");
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3599|      0|    }
 3600|      0|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6commonEv:
 3718|  1.21k|  CommonFields& common() { return settings_.template get<0>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14char_alloc_refEv:
 3772|    299|  CharAlloc& char_alloc_ref() { return settings_.template get<3>(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10slot_arrayEv:
 3730|    621|  slot_type* slot_array() const {
 3731|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|    621|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3732|    621|    return static_cast<slot_type*>(common().slot_array());
 3733|    621|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE13destroy_slotsEv:
 3280|      1|  void destroy_slots() {
 3281|      1|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  256|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3282|      1|    if (PolicyTraits::template destroy_is_trivial<Alloc>()) return;
  ------------------
  |  Branch (3282:9): [True: 1, Folded]
  ------------------
 3283|      0|    auto destroy_slot = [&](const ctrl_t*, void* slot) {
 3284|      0|      this->destroy(static_cast<slot_type*>(slot));
 3285|      0|    };
 3286|       |    if constexpr (SwisstableAssertAccessToDestroyedTable()) {
 3287|       |      CommonFields common_copy(non_soo_tag_t{}, this->common());
 3288|       |      common().set_capacity(HashtableCapacity::CreateDestroyed());
 3289|       |      IterateOverFullSlots(common_copy, sizeof(slot_type), destroy_slot);
 3290|       |      common().set_capacity(common_copy.capacity());
 3291|      0|    } else {
 3292|      0|      IterateOverFullSlots(common(), sizeof(slot_type), destroy_slot);
 3293|      0|    }
 3294|      0|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7controlEv:
 3726|    906|  ctrl_t* control() const {
 3727|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|    906|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3728|    906|    return common().control();
 3729|    906|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEC2Ev:
 2352|      1|      std::is_nothrow_default_constructible<allocator_type>::value) {}
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE15unchecked_derefENSA_8iteratorE:
 3682|    256|  reference unchecked_deref(iterator it) { return it.unchecked_deref(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator15unchecked_derefEv:
 2282|    512|    reference unchecked_deref() const { return PolicyTraits::element(slot_); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22find_or_prepare_insertINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairINSA_8iteratorEbEERKT_:
 3646|    256|  std::pair<iterator, bool> find_or_prepare_insert(const K& key) {
 3647|    256|    AssertOnFind(key);
 3648|    256|    if (is_small()) return find_or_prepare_insert_small(key);
  ------------------
  |  Branch (3648:9): [True: 2, False: 254]
  ------------------
 3649|    254|    return find_or_prepare_insert_large(key);
 3650|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE12AssertOnFindINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEvRKT_:
 3567|    256|  void AssertOnFind([[maybe_unused]] const K& key) {
 3568|    256|    AssertHashEqConsistent(key);
 3569|    256|    AssertNotDebugCapacity();
 3570|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertHashEqConsistentINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEvRKT_:
 3605|    256|  void AssertHashEqConsistent(const K& key) {
 3606|    256|#ifdef NDEBUG
 3607|    256|    return;
 3608|      0|#endif
 3609|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3610|      0|    if (std::is_same<hasher, absl::container_internal::StringHash>::value &&
  ------------------
  |  Branch (3610:9): [True: 0, Folded]
  ------------------
 3611|      0|        std::is_same<key_equal, absl::container_internal::StringEq>::value) {
  ------------------
  |  Branch (3611:9): [True: 0, Folded]
  ------------------
 3612|      0|      return;
 3613|      0|    }
 3614|      0|    if (std::is_scalar<key_type>::value &&
  ------------------
  |  Branch (3614:9): [Folded, False: 0]
  ------------------
 3615|      0|        std::is_same<hasher, absl::Hash<key_type>>::value &&
  ------------------
  |  Branch (3615:9): [Folded, False: 0]
  ------------------
 3616|      0|        std::is_same<key_equal, std::equal_to<key_type>>::value) {
  ------------------
  |  Branch (3616:9): [Folded, False: 0]
  ------------------
 3617|      0|      return;
 3618|      0|    }
 3619|      0|    if (empty()) return;
  ------------------
  |  Branch (3619:9): [True: 0, False: 0]
  ------------------
 3620|       |
 3621|      0|    const size_t hash_of_arg = hash_of(key);
 3622|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3623|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3624|      0|      if (!is_key_equal) return;
 3625|       |
 3626|      0|      [[maybe_unused]] const bool is_hash_equal =
 3627|      0|          hash_of_arg == hash_of(to_slot(slot));
 3628|      0|      assert((!is_key_equal || is_hash_equal) &&
 3629|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3630|      0|             "hash/eq functors are inconsistent.");
 3631|      0|    };
 3632|       |
 3633|      0|    if (is_small()) {
  ------------------
  |  Branch (3633:9): [True: 0, False: 0]
  ------------------
 3634|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3635|      0|      return;
 3636|      0|    }
 3637|       |    // We only do validation for small tables so that it's constant time.
 3638|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3638:9): [True: 0, False: 0]
  ------------------
 3639|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3640|      0|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertNotDebugCapacityEv:
 3573|    770|  void AssertNotDebugCapacity() const {
 3574|    770|#ifdef NDEBUG
 3575|    770|    if (!SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (3575:9): [True: 770, Folded]
  ------------------
 3576|    770|      return;
 3577|    770|    }
 3578|      0|#endif
 3579|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 3580|      0|    if (ABSL_PREDICT_TRUE(cap.IsValid())) {
  ------------------
  |  |  191|      0|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 0]
  |  |  |  Branch (191:57): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3581|      0|      return;
 3582|      0|    }
 3583|      0|    assert(!cap.IsReentrance() &&
 3584|      0|           "Reentrant container access during element construction/destruction "
 3585|      0|           "is not allowed.");
 3586|       |    if constexpr (SwisstableAssertAccessToDestroyedTable()) {
 3587|       |      if (cap.IsDestroyed()) {
 3588|       |        ABSL_RAW_LOG(FATAL, "Use of destroyed hash table.");
 3589|       |      }
 3590|       |    }
 3591|      0|    if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (3591:9): [Folded, False: 0]
  ------------------
 3592|      0|        ABSL_PREDICT_FALSE(cap.IsMovedFrom())) {
  ------------------
  |  |  190|      0|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:58): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3593|      0|      if (cap.IsSelfMovedFrom()) {
  ------------------
  |  Branch (3593:11): [True: 0, False: 0]
  ------------------
 3594|       |        // If this log triggers, then a hash table was move-assigned to itself
 3595|       |        // and then used again later without being reinitialized.
 3596|      0|        ABSL_RAW_LOG(FATAL, "Use of self-move-assigned hash table.");
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3597|      0|      }
 3598|      0|      ABSL_RAW_LOG(FATAL, "Use of moved-from hash table.");
  ------------------
  |  |   45|      0|  do {                                                                         \
  |  |   46|      0|    constexpr const char* absl_raw_log_internal_basename =                     \
  |  |   47|      0|        ::absl::raw_log_internal::Basename(__FILE__, sizeof(__FILE__) - 1);    \
  |  |   48|      0|    ::absl::raw_log_internal::RawLog(ABSL_RAW_LOG_INTERNAL_##severity,         \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   49|      0|                                     absl_raw_log_internal_basename, __LINE__, \
  |  |   50|      0|                                     __VA_ARGS__);                             \
  |  |   51|      0|    ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_##severity;                        \
  |  |  ------------------
  |  |  |  |  118|      0|#define ABSL_RAW_LOG_INTERNAL_MAYBE_UNREACHABLE_FATAL ABSL_UNREACHABLE()
  |  |  |  |  ------------------
  |  |  |  |  |  |  237|      0|  do {                                           \
  |  |  |  |  |  |  238|      0|    /* NOLINTNEXTLINE: misc-static-assert */     \
  |  |  |  |  |  |  239|      0|    assert(false && "ABSL_UNREACHABLE reached"); \
  |  |  |  |  |  |  240|      0|    ABSL_INTERNAL_UNREACHABLE_IMPL();            \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  215|      0|#define ABSL_INTERNAL_UNREACHABLE_IMPL() __builtin_unreachable()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  241|      0|  } while (false)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (241:12): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   52|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (52:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
 3599|      0|    }
 3600|      0|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8is_smallEv:
 2117|    512|  bool is_small() const { return common().is_small(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6commonEv:
 3719|  4.30k|  const CommonFields& common() const { return settings_.template get<0>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE28find_or_prepare_insert_smallINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairINSA_8iteratorEbEERKT_:
 3497|      2|  std::pair<iterator, bool> find_or_prepare_insert_small(const K& key) {
 3498|      2|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  256|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3499|       |    if constexpr (SooEnabled()) {
 3500|       |      return find_or_prepare_insert_soo(key);
 3501|       |    }
 3502|      2|    if (!empty()) {
  ------------------
  |  Branch (3502:9): [True: 1, False: 1]
  ------------------
 3503|      1|      if (equal_to(key, single_slot())) {
  ------------------
  |  Branch (3503:11): [True: 0, False: 1]
  ------------------
 3504|      0|        return {single_iterator(), false};
 3505|      0|      }
 3506|      1|    }
 3507|      2|    return {iterator_at_ptr(PrepareInsertSmallNonSoo(
 3508|      2|                common(), GetPolicyFunctions(),
 3509|      2|                HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})),
 3510|      2|            true};
 3511|      2|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE5emptyEv:
 2593|      2|  bool empty() const { return !size(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4sizeEv:
 2594|      2|  size_t size() const {
 2595|      2|    AssertNotDebugCapacity();
 2596|      2|    const size_t size = common().size();
 2597|      2|    [[maybe_unused]] const size_t kMaxValidSize = MaxValidSize();
 2598|      2|    ABSL_ASSUME(size <= kMaxValidSize);
  ------------------
  |  |  271|      2|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2599|      2|    return size;
 2600|      2|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8equal_toINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEbRKT_PNS1_13map_slot_typeIS8_hEE:
 3344|     19|                                             slot_type* slot) const {
 3345|     19|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3346|     19|                               PolicyTraits::element(slot));
 3347|     19|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6eq_refEv:
 3771|    277|  const key_equal& eq_ref() const { return settings_.template get<2>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11single_slotEv:
 3743|      1|  slot_type* single_slot() {
 3744|      1|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  256|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3745|      1|    return SooEnabled() ? soo_slot() : slot_array();
  ------------------
  |  Branch (3745:12): [Folded, False: 1]
  ------------------
 3746|      1|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10slot_arrayEv:
 3730|  1.31k|  slot_type* slot_array() const {
 3731|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|  1.31k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3732|  1.31k|    return static_cast<slot_type*>(common().slot_array());
 3733|  1.31k|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorC2EPNS1_6ctrl_tEPNS1_13map_slot_typeIS8_hEEPKh:
 2236|    512|        : HashSetIteratorGenerationInfo(generation_ptr),
 2237|    512|          ctrl_(ctrl),
 2238|    512|          slot_(slot) {
 2239|       |      // This assumption helps the compiler know that any non-end iterator is
 2240|       |      // not equal to any end iterator.
 2241|    512|      ABSL_ASSUME(ctrl != nullptr);
  ------------------
  |  |  271|    512|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2242|    512|    }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE15iterator_at_ptrENS4_4pairIPNS1_6ctrl_tEPvEE:
 3678|      2|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3679|      2|    return {ptrs.first, to_slot(ptrs.second), common().generation_ptr()};
 3680|      2|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7to_slotEPv:
 3361|      7|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3362|      7|    return static_cast<slot_type*>(buf);
 3363|      7|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6commonEv:
 3718|  2.22k|  CommonFields& common() { return settings_.template get<0>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE18GetPolicyFunctionsEv:
 3851|    256|  static const PolicyFunctions& GetPolicyFunctions() {
 3852|    256|    static_assert(sizeof(slot_type) <= (std::numeric_limits<uint32_t>::max)(),
 3853|    256|                  "Slot size is too large. Use std::unique_ptr for value type "
 3854|    256|                  "or use absl::node_hash_{map,set}.");
 3855|    256|    static_assert(alignof(slot_type) <=
 3856|    256|                  size_t{(std::numeric_limits<uint16_t>::max)()});
 3857|    256|    static_assert(sizeof(key_type) <=
 3858|    256|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3859|    256|    static_assert(sizeof(value_type) <=
 3860|    256|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3861|    256|    static constexpr size_t kBackingArrayAlignment =
 3862|    256|        BackingArrayAlignment(alignof(slot_type));
 3863|    256|    static constexpr PolicyFunctions value = {
 3864|    256|        static_cast<uint32_t>(sizeof(key_type)),
 3865|    256|        static_cast<uint32_t>(sizeof(value_type)),
 3866|    256|        static_cast<uint32_t>(sizeof(slot_type)),
 3867|    256|        static_cast<uint16_t>(alignof(slot_type)), SooEnabled(),
 3868|    256|        ShouldSampleHashtablezInfoForAlloc<CharAlloc>(),
 3869|       |        // TODO(b/328722020): try to type erase
 3870|       |        // for standard layout and alignof(Hash) <= alignof(CommonFields).
 3871|    256|        std::is_empty_v<hasher> ? &GetRefForEmptyClass
  ------------------
  |  Branch (3871:9): [True: 0, Folded]
  ------------------
 3872|    256|                                : &raw_hash_set::get_hash_ref_fn,
 3873|    256|        PolicyTraits::template get_hash_slot_fn<hasher, kIsDefaultHash>(),
 3874|    256|        PolicyTraits::transfer_uses_memcpy()
  ------------------
  |  Branch (3874:9): [True: 0, Folded]
  ------------------
 3875|    256|            ? TransferNRelocatable<sizeof(slot_type)>
 3876|    256|            : &raw_hash_set::transfer_n_slots_fn,
 3877|    256|        std::is_empty_v<Alloc> ? &GetRefForEmptyClass
  ------------------
  |  Branch (3877:9): [True: 0, Folded]
  ------------------
 3878|    256|                               : &raw_hash_set::get_char_alloc_ref_fn,
 3879|    256|        &AllocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 3880|    256|        &DeallocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 3881|    256|        &raw_hash_set::transfer_unprobed_elements_to_next_capacity_fn};
 3882|    256|    return value;
 3883|    256|  }
_ZN4absl12lts_2026052618container_internal20TransferNRelocatableILm24EEEvPvS3_S3_m:
 1955|      5|                                                  size_t count) {
 1956|       |  // TODO(b/382423690): Experiment with making specialization for power of 2 and
 1957|       |  // non power of 2. This would require passing the size of the slot.
 1958|      5|  memcpy(dst, src, SizeOfSlot * count);
 1959|      5|}
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE46transfer_unprobed_elements_to_next_capacity_fnERNS1_12CommonFieldsEPKNS1_6ctrl_tEPvSG_PFvSG_hmmE:
 3804|      5|                                    size_t source_offset, size_t h1)) {
 3805|      5|    const size_t new_capacity = common.capacity();
 3806|      5|    const size_t old_capacity = PreviousCapacity(new_capacity);
 3807|      5|    ABSL_ASSUME(old_capacity + 1 >= Group::kWidth);
  ------------------
  |  |  271|      5|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3808|      5|    ABSL_ASSUME((old_capacity + 1) % Group::kWidth == 0);
  ------------------
  |  |  271|      5|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3809|       |
 3810|      5|    auto* set = reinterpret_cast<raw_hash_set*>(&common);
 3811|      5|    slot_type* old_slots_ptr = to_slot(old_slots);
 3812|      5|    ctrl_t* new_ctrl = common.control();
 3813|      5|    slot_type* new_slots = set->slot_array();
 3814|       |
 3815|     36|    for (size_t group_index = 0; group_index < old_capacity;
  ------------------
  |  Branch (3815:34): [True: 31, False: 5]
  ------------------
 3816|     31|         group_index += Group::kWidth) {
 3817|     31|      GroupFullEmptyOrDeleted old_g(old_ctrl + group_index);
 3818|     31|      std::memset(new_ctrl + group_index, static_cast<int8_t>(ctrl_t::kEmpty),
 3819|     31|                  Group::kWidth);
 3820|     31|      std::memset(new_ctrl + group_index + old_capacity + 1,
 3821|     31|                  static_cast<int8_t>(ctrl_t::kEmpty), Group::kWidth);
 3822|       |      // TODO(b/382423690): try to type erase everything outside of the loop.
 3823|       |      // We will share a lot of code in expense of one function call per group.
 3824|    434|      for (auto in_fixed_group_index : old_g.MaskFull()) {
  ------------------
  |  Branch (3824:38): [True: 434, False: 31]
  ------------------
 3825|    434|        size_t old_index = group_index + in_fixed_group_index;
 3826|    434|        slot_type* old_slot = old_slots_ptr + old_index;
 3827|       |        // TODO(b/382423690): try to avoid entire hash calculation since we need
 3828|       |        // only one new bit of h1.
 3829|    434|        size_t hash = set->hash_of(old_slot);
 3830|    434|        size_t h1 = H1(hash);
 3831|    434|        h2_t h2 = H2(hash);
 3832|    434|        size_t new_index = TryFindNewIndexWithoutProbing(
 3833|    434|            h1, old_index, old_capacity, new_ctrl, new_capacity);
 3834|       |        // Note that encode_probed_element is allowed to use old_ctrl buffer
 3835|       |        // till and included the old_index.
 3836|    434|        if (ABSL_PREDICT_FALSE(new_index == kProbedElementIndexSentinel)) {
  ------------------
  |  |  190|    434|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 2, False: 432]
  |  |  |  Branch (190:49): [Folded, False: 434]
  |  |  |  Branch (190:58): [True: 2, False: 432]
  |  |  ------------------
  ------------------
 3837|      2|          encode_probed_element(probed_storage, h2, old_index, h1);
 3838|      2|          continue;
 3839|      2|        }
 3840|    432|        ABSL_SWISSTABLE_ASSERT((new_index & old_capacity) <= old_index);
  ------------------
  |  |  256|    432|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3841|       |        ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_index]));
  ------------------
  |  |  256|    432|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3842|    432|        new_ctrl[new_index] = static_cast<ctrl_t>(h2);
 3843|    432|        auto* new_slot = new_slots + new_index;
 3844|    432|        SanitizerUnpoisonMemoryRegion(new_slot, sizeof(slot_type));
 3845|    432|        set->transfer(new_slot, old_slot);
 3846|    432|        SanitizerPoisonMemoryRegion(old_slot, sizeof(slot_type));
 3847|    432|      }
 3848|     31|    }
 3849|      5|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofEPNS1_13map_slot_typeIS8_hEE:
 3353|    434|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(slot_type* slot) const {
 3354|    434|    return PolicyTraits::apply(
 3355|    434|        HashElement<hasher, kIsDefaultHash>{hash_ref(), common().seed().seed()},
 3356|    434|        PolicyTraits::element(slot));
 3357|    434|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8hash_refEv:
 3769|    944|  const hasher& hash_ref() const { return settings_.template get<1>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8transferEPNS1_13map_slot_typeIS8_hEESD_:
 3217|    432|  inline void transfer(slot_type* to, slot_type* from) {
 3218|    432|    common().RunWithReentrancyGuard([&] {
 3219|    432|      allocator_type alloc(char_alloc_ref());
 3220|    432|      PolicyTraits::transfer(&alloc, to, from);
 3221|    432|    });
 3222|    432|  }
_ZN4absl12lts_2026052618container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEhEEJEE8transferEPNS1_13map_slot_typeISA_hEESF_EUlvE_EEvT_:
 1322|    432|  void RunWithReentrancyGuard(F f) {
 1323|    432|#ifdef NDEBUG
 1324|    432|    f();
 1325|    432|    return;
 1326|      0|#endif
 1327|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1328|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1329|      0|    f();
 1330|      0|    set_capacity(cap);
 1331|      0|  }
_ZZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8transferEPNS1_13map_slot_typeIS8_hEESD_ENKUlvE_clEv:
 3218|    432|    common().RunWithReentrancyGuard([&] {
 3219|    432|      allocator_type alloc(char_alloc_ref());
 3220|    432|      PolicyTraits::transfer(&alloc, to, from);
 3221|    432|    });
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14char_alloc_refEv:
 3772|    688|  CharAlloc& char_alloc_ref() { return settings_.template get<3>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8hash_refEv:
 3768|      2|  hasher& hash_ref() { return settings_.template get<1>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE28find_or_prepare_insert_largeINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairINSA_8iteratorEbEERKT_:
 3514|    254|  std::pair<iterator, bool> find_or_prepare_insert_large(const K& key) {
 3515|    254|    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|    254|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3516|    254|    prefetch_heap_block();
 3517|    254|    const size_t hash = hash_of(key);
 3518|    254|    auto seq = probe(common(), hash);
 3519|    254|    const h2_t h2 = H2(hash);
 3520|    254|    const ctrl_t* ctrl = control();
 3521|    254|    size_t index;
 3522|    254|    bool inserted;
 3523|       |    // We use a lambda function to be able to exit from the nested loop without
 3524|       |    // duplicating generated code for the return statement (e.g. iterator_at).
 3525|    254|    [&]() ABSL_ATTRIBUTE_ALWAYS_INLINE {
 3526|    254|      while (true) {
 3527|    254|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3528|    254|        absl::PrefetchToLocalCache(slot_array() + seq.offset());
 3529|    254|#endif
 3530|    254|        Group g{ctrl + seq.offset()};
 3531|    254|        for (uint32_t i : g.Match(h2)) {
 3532|    254|          if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i)))) {
 3533|    254|            index = seq.offset(i);
 3534|    254|            inserted = false;
 3535|    254|            return;
 3536|    254|          }
 3537|    254|        }
 3538|    254|        auto mask_empty = g.MaskEmpty();
 3539|    254|        if (ABSL_PREDICT_TRUE(mask_empty)) {
 3540|    254|          size_t target_group_offset = seq.offset();
 3541|    254|          index = SwisstableGenerationsEnabled()
 3542|    254|                      ? PrepareInsertLargeGenerationsEnabled(
 3543|    254|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3544|    254|                            FindInfo{target_group_offset, seq.index()},
 3545|    254|                            HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3546|    254|                      : PrepareInsertLarge(
 3547|    254|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3548|    254|                            FindInfo{target_group_offset, seq.index()});
 3549|    254|          inserted = true;
 3550|    254|          return;
 3551|    254|        }
 3552|    254|        seq.next();
 3553|    254|        ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
 3554|    254|      }
 3555|    254|    }();
 3556|    254|    return {iterator_at(index), inserted};
 3557|    254|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE19prefetch_heap_blockEv:
 3711|    510|  void prefetch_heap_block() const {
 3712|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|    510|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3713|    510|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3714|    510|    __builtin_prefetch(control(), 0, 1);
 3715|    510|#endif
 3716|    510|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEmRKT_:
 3349|    254|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3350|    254|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3351|    254|                                               common().seed().seed()}(key);
 3352|    254|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7controlEv:
 3726|  1.53k|  ctrl_t* control() const {
 3727|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|  1.53k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3728|  1.53k|    return common().control();
 3729|  1.53k|  }
_ZZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE28find_or_prepare_insert_largeINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairINSA_8iteratorEbEERKT_ENKUlvE_clEv:
 3525|    254|    [&]() ABSL_ATTRIBUTE_ALWAYS_INLINE {
 3526|    265|      while (true) {
  ------------------
  |  Branch (3526:14): [True: 265, Folded]
  ------------------
 3527|    265|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3528|    265|        absl::PrefetchToLocalCache(slot_array() + seq.offset());
 3529|    265|#endif
 3530|    265|        Group g{ctrl + seq.offset()};
 3531|    265|        for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3531:25): [True: 18, False: 265]
  ------------------
 3532|     18|          if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i)))) {
  ------------------
  |  |  191|     18|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 18]
  |  |  |  Branch (191:48): [Folded, False: 18]
  |  |  |  Branch (191:57): [True: 0, False: 18]
  |  |  ------------------
  ------------------
 3533|      0|            index = seq.offset(i);
 3534|      0|            inserted = false;
 3535|      0|            return;
 3536|      0|          }
 3537|     18|        }
 3538|    265|        auto mask_empty = g.MaskEmpty();
 3539|    265|        if (ABSL_PREDICT_TRUE(mask_empty)) {
  ------------------
  |  |  191|    265|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 254, False: 11]
  |  |  |  Branch (191:48): [Folded, False: 265]
  |  |  |  Branch (191:57): [True: 254, False: 11]
  |  |  ------------------
  ------------------
 3540|    254|          size_t target_group_offset = seq.offset();
 3541|    254|          index = SwisstableGenerationsEnabled()
  ------------------
  |  Branch (3541:19): [Folded, False: 254]
  ------------------
 3542|    254|                      ? PrepareInsertLargeGenerationsEnabled(
 3543|      0|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3544|      0|                            FindInfo{target_group_offset, seq.index()},
 3545|      0|                            HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3546|    254|                      : PrepareInsertLarge(
 3547|    254|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3548|    254|                            FindInfo{target_group_offset, seq.index()});
 3549|    254|          inserted = true;
 3550|    254|          return;
 3551|    254|        }
 3552|     11|        seq.next();
 3553|       |        ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  256|     11|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3554|     11|      }
 3555|    254|    }();
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11iterator_atEm:
 3671|    510|  iterator iterator_at(size_t i) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3672|    510|    return {control() + i, slot_array() + i, common().generation_ptr()};
 3673|    510|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10emplace_atIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJEEEEEEvNSA_8iteratorEDpOT_:
 3661|    256|  void emplace_at(iterator iter, Args&&... args) {
 3662|    256|    construct(iter.slot(), std::forward<Args>(args)...);
 3663|       |
 3664|       |    // When is_small, find calls find_small and if size is 0, then it will
 3665|       |    // return an end iterator. This can happen in the raw_hash_set copy ctor.
 3666|       |    assert((is_small() ||
 3667|    256|            PolicyTraits::apply(FindElement{*this}, *iter) == iter) &&
 3668|    256|           "constructed value does not match the lookup key");
 3669|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJEEEEEEvPNS1_13map_slot_typeIS8_hEEDpOT_:
 3205|    256|  inline void construct(slot_type* slot, Args&&... args) {
 3206|    256|    common().RunWithReentrancyGuard([&] {
 3207|    256|      allocator_type alloc(char_alloc_ref());
 3208|    256|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3209|    256|    });
 3210|    256|  }
_ZN4absl12lts_2026052618container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEhEEJEE9constructIJRKNS6_21piecewise_construct_tENS6_5tupleIJRKNS6_12basic_stringIcS9_NS6_9allocatorIcEEEEEEENSH_IJEEEEEEvPNS1_13map_slot_typeISA_hEEDpOT_EUlvE_EEvT_:
 1322|    256|  void RunWithReentrancyGuard(F f) {
 1323|    256|#ifdef NDEBUG
 1324|    256|    f();
 1325|    256|    return;
 1326|      0|#endif
 1327|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1328|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1329|      0|    f();
 1330|      0|    set_capacity(cap);
 1331|      0|  }
_ZZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJEEEEEEvPNS1_13map_slot_typeIS8_hEEDpOT_ENKUlvE_clEv:
 3206|    256|    common().RunWithReentrancyGuard([&] {
 3207|    256|      allocator_type alloc(char_alloc_ref());
 3208|    256|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3209|    256|    });
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator4slotEv:
 2285|    256|    slot_type* slot() const { return slot_; }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEEC2Ev:
 2352|      2|      std::is_nothrow_default_constructible<allocator_type>::value) {}
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4findIS8_EENSA_14const_iteratorERKT_:
 3079|      4|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3080|      4|    return const_cast<raw_hash_set*>(this)->find(key);
 3081|      4|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4findIS8_EENSA_8iteratorERKT_:
 3064|      4|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3065|      4|    AssertOnFind(key);
 3066|      4|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3066:9): [True: 0, False: 4]
  ------------------
 3067|      4|    prefetch_heap_block();
 3068|      4|    return find_large(key, hash_of(key));
 3069|      4|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE12AssertOnFindIS8_EEvRKT_:
 3567|    302|  void AssertOnFind([[maybe_unused]] const K& key) {
 3568|    302|    AssertHashEqConsistent(key);
 3569|    302|    AssertNotDebugCapacity();
 3570|    302|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22AssertHashEqConsistentIS8_EEvRKT_:
 3605|    302|  void AssertHashEqConsistent(const K& key) {
 3606|    302|#ifdef NDEBUG
 3607|    302|    return;
 3608|      0|#endif
 3609|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3610|      0|    if (std::is_same<hasher, absl::container_internal::StringHash>::value &&
  ------------------
  |  Branch (3610:9): [True: 0, Folded]
  ------------------
 3611|      0|        std::is_same<key_equal, absl::container_internal::StringEq>::value) {
  ------------------
  |  Branch (3611:9): [True: 0, Folded]
  ------------------
 3612|      0|      return;
 3613|      0|    }
 3614|      0|    if (std::is_scalar<key_type>::value &&
  ------------------
  |  Branch (3614:9): [Folded, False: 0]
  ------------------
 3615|      0|        std::is_same<hasher, absl::Hash<key_type>>::value &&
  ------------------
  |  Branch (3615:9): [Folded, False: 0]
  ------------------
 3616|      0|        std::is_same<key_equal, std::equal_to<key_type>>::value) {
  ------------------
  |  Branch (3616:9): [Folded, False: 0]
  ------------------
 3617|      0|      return;
 3618|      0|    }
 3619|      0|    if (empty()) return;
  ------------------
  |  Branch (3619:9): [True: 0, False: 0]
  ------------------
 3620|       |
 3621|      0|    const size_t hash_of_arg = hash_of(key);
 3622|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3623|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3624|      0|      if (!is_key_equal) return;
 3625|       |
 3626|      0|      [[maybe_unused]] const bool is_hash_equal =
 3627|      0|          hash_of_arg == hash_of(to_slot(slot));
 3628|      0|      assert((!is_key_equal || is_hash_equal) &&
 3629|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3630|      0|             "hash/eq functors are inconsistent.");
 3631|      0|    };
 3632|       |
 3633|      0|    if (is_small()) {
  ------------------
  |  Branch (3633:9): [True: 0, False: 0]
  ------------------
 3634|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3635|      0|      return;
 3636|      0|    }
 3637|       |    // We only do validation for small tables so that it's constant time.
 3638|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3638:9): [True: 0, False: 0]
  ------------------
 3639|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3640|      0|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8equal_toIS8_EEbRKT_PNS1_13map_slot_typeIS8_iEE:
 3344|     18|                                             slot_type* slot) const {
 3345|     18|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3346|     18|                               PolicyTraits::element(slot));
 3347|     18|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6eq_refEv:
 3771|     18|  const key_equal& eq_ref() const { return settings_.template get<2>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE3endEv:
 2577|      6|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2578|      6|    AssertNotDebugCapacity();
 2579|      6|    return iterator(common().generation_ptr());
 2580|      6|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPKh:
 2257|      6|        : HashSetIteratorGenerationInfo(generation_ptr), ctrl_(nullptr) {}
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPNS1_6ctrl_tEPNS1_13map_slot_typeIS8_iEEPKh:
 2236|    301|        : HashSetIteratorGenerationInfo(generation_ptr),
 2237|    301|          ctrl_(ctrl),
 2238|    301|          slot_(slot) {
 2239|       |      // This assumption helps the compiler know that any non-end iterator is
 2240|       |      // not equal to any end iterator.
 2241|    301|      ABSL_ASSUME(ctrl != nullptr);
  ------------------
  |  |  271|    301|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2242|    301|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19prefetch_heap_blockEv:
 3711|    302|  void prefetch_heap_block() const {
 3712|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|    302|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3713|    302|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3714|    302|    __builtin_prefetch(control(), 0, 1);
 3715|    302|#endif
 3716|    302|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10find_largeIS8_EENSA_8iteratorERKT_m:
 3233|      4|  iterator find_large(const key_arg<K>& key, size_t hash) {
 3234|      4|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  256|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3235|      4|    auto seq = probe(common(), hash);
 3236|      4|    const h2_t h2 = H2(hash);
 3237|      4|    const ctrl_t* ctrl = control();
 3238|      4|    while (true) {
  ------------------
  |  Branch (3238:12): [True: 4, Folded]
  ------------------
 3239|      4|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3240|      4|      absl::PrefetchToLocalCache(slot_array() + seq.offset());
 3241|      4|#endif
 3242|      4|      Group g{ctrl + seq.offset()};
 3243|      4|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3243:23): [True: 3, False: 1]
  ------------------
 3244|      3|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i))))
  ------------------
  |  |  191|      3|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 3, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 3]
  |  |  |  Branch (191:57): [True: 3, False: 0]
  |  |  ------------------
  ------------------
 3245|      3|          return iterator_at(seq.offset(i));
 3246|      3|      }
 3247|      1|      if (ABSL_PREDICT_TRUE(g.MaskEmpty())) return end();
  ------------------
  |  |  191|      1|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 1, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 1]
  |  |  |  Branch (191:57): [True: 1, False: 0]
  |  |  ------------------
  ------------------
 3248|      0|      seq.next();
 3249|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  256|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3250|      0|    }
 3251|      4|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE11iterator_atEm:
 3671|    301|  iterator iterator_at(size_t i) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3672|    301|    return {control() + i, slot_array() + i, common().generation_ptr()};
 3673|    301|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7hash_ofIS8_EEmRKT_:
 3349|    302|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3350|    302|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3351|    302|                                               common().seed().seed()}(key);
 3352|    302|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8hash_refEv:
 3769|    302|  const hasher& hash_ref() const { return settings_.template get<1>(); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorC2ENSA_8iteratorE:
 2312|      8|    const_iterator(iterator i) : inner_(std::move(i)) {}  // NOLINT
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE3endEv:
 2585|      4|  const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2586|      4|    return const_cast<raw_hash_set*>(this)->end();
 2587|      4|  }
_ZN4absl12lts_2026052618container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorESD_:
 2326|      4|    friend bool operator!=(const const_iterator& a, const const_iterator& b) {
 2327|      4|      return !(a == b);
 2328|      4|    }
_ZN4absl12lts_2026052618container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorESD_:
 2323|      4|    friend bool operator==(const const_iterator& a, const const_iterator& b) {
 2324|      4|      return a.inner_ == b.inner_;
 2325|      4|    }
_ZN4absl12lts_2026052618container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorESD_:
 2222|     44|    friend bool operator==(const iterator& a, const iterator& b) {
 2223|     44|      AssertIsValidForComparison(a.ctrl_, a.generation(), a.generation_ptr());
 2224|     44|      AssertIsValidForComparison(b.ctrl_, b.generation(), b.generation_ptr());
 2225|     44|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2226|     44|                          a.generation_ptr(), b.generation_ptr());
 2227|     44|      return a.ctrl_ == b.ctrl_;
 2228|     44|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorptEv:
 2315|      3|    pointer operator->() const { return inner_.operator->(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorptEv:
 2201|      3|    pointer operator->() const {
 2202|      3|      assert_is_full("operator->");
 2203|      3|      return &operator*();
 2204|      3|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator14assert_is_fullEPKc:
 2259|     84|    void assert_is_full(const char* operation) const {
 2260|     84|      AssertIsFull(ctrl_, generation(), generation_ptr(), operation);
 2261|     84|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratordeEv:
 2195|     42|    reference operator*() const {
 2196|     42|      assert_is_full("operator*()");
 2197|     42|      return unchecked_deref();
 2198|     42|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator15unchecked_derefEv:
 2282|     42|    reference unchecked_deref() const { return PolicyTraits::element(slot_); }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE5clearEv:
 2614|      3|  ABSL_ATTRIBUTE_REINITIALIZES void clear() {
 2615|      3|    if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (2615:9): [Folded, False: 3]
  |  Branch (2615:9): [Folded, False: 3]
  ------------------
 2616|      0|        maybe_invalid_capacity().IsMovedFrom()) {
  ------------------
  |  Branch (2616:9): [True: 0, False: 0]
  ------------------
 2617|      0|      common().set_capacity(DefaultCapacity());
 2618|      0|    }
 2619|      3|    AssertNotDebugCapacity();
 2620|       |    // Iterating over this container is O(bucket_count()). When bucket_count()
 2621|       |    // is much greater than size(), iteration becomes prohibitively expensive.
 2622|       |    // For clear() it is more important to reuse the allocated array when the
 2623|       |    // container is small because allocation takes comparatively long time
 2624|       |    // compared to destruction of the elements of the container. So we pick the
 2625|       |    // largest bucket_count() threshold for which iteration is still fast and
 2626|       |    // past that we simply deallocate the array.
 2627|      3|    const size_t cap = capacity();
 2628|      3|    if (cap == 0) {
  ------------------
  |  Branch (2628:9): [True: 2, False: 1]
  ------------------
 2629|       |      // Already guaranteed to be empty; so nothing to do.
 2630|      2|    } else if (is_small()) {
  ------------------
  |  Branch (2630:16): [True: 0, False: 1]
  ------------------
 2631|      0|      if (!empty()) {
  ------------------
  |  Branch (2631:11): [True: 0, False: 0]
  ------------------
 2632|      0|        destroy(single_slot());
 2633|      0|        decrement_small_size();
 2634|      0|      }
 2635|      1|    } else {
 2636|      1|      destroy_slots();
 2637|      1|      clear_backing_array(/*reuse=*/cap < 128);
 2638|      1|    }
 2639|      3|    common().set_reserved_growth(0);
 2640|      3|    common().set_reservation_size(0);
 2641|      3|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19clear_backing_arrayEb:
 3275|      1|  void clear_backing_array(bool reuse) {
 3276|       |    ABSL_SWISSTABLE_ASSERT(capacity() > MaxSmallCapacity());
  ------------------
  |  |  256|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3277|      1|    ClearBackingArray(common(), GetPolicyFunctions(), &char_alloc_ref(), reuse);
 3278|      1|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE18GetPolicyFunctionsEv:
 3851|    301|  static const PolicyFunctions& GetPolicyFunctions() {
 3852|    301|    static_assert(sizeof(slot_type) <= (std::numeric_limits<uint32_t>::max)(),
 3853|    301|                  "Slot size is too large. Use std::unique_ptr for value type "
 3854|    301|                  "or use absl::node_hash_{map,set}.");
 3855|    301|    static_assert(alignof(slot_type) <=
 3856|    301|                  size_t{(std::numeric_limits<uint16_t>::max)()});
 3857|    301|    static_assert(sizeof(key_type) <=
 3858|    301|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3859|    301|    static_assert(sizeof(value_type) <=
 3860|    301|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3861|    301|    static constexpr size_t kBackingArrayAlignment =
 3862|    301|        BackingArrayAlignment(alignof(slot_type));
 3863|    301|    static constexpr PolicyFunctions value = {
 3864|    301|        static_cast<uint32_t>(sizeof(key_type)),
 3865|    301|        static_cast<uint32_t>(sizeof(value_type)),
 3866|    301|        static_cast<uint32_t>(sizeof(slot_type)),
 3867|    301|        static_cast<uint16_t>(alignof(slot_type)), SooEnabled(),
 3868|    301|        ShouldSampleHashtablezInfoForAlloc<CharAlloc>(),
 3869|       |        // TODO(b/328722020): try to type erase
 3870|       |        // for standard layout and alignof(Hash) <= alignof(CommonFields).
 3871|    301|        std::is_empty_v<hasher> ? &GetRefForEmptyClass
  ------------------
  |  Branch (3871:9): [True: 0, Folded]
  ------------------
 3872|    301|                                : &raw_hash_set::get_hash_ref_fn,
 3873|    301|        PolicyTraits::template get_hash_slot_fn<hasher, kIsDefaultHash>(),
 3874|    301|        PolicyTraits::transfer_uses_memcpy()
  ------------------
  |  Branch (3874:9): [True: 0, Folded]
  ------------------
 3875|    301|            ? TransferNRelocatable<sizeof(slot_type)>
 3876|    301|            : &raw_hash_set::transfer_n_slots_fn,
 3877|    301|        std::is_empty_v<Alloc> ? &GetRefForEmptyClass
  ------------------
  |  Branch (3877:9): [True: 0, Folded]
  ------------------
 3878|    301|                               : &raw_hash_set::get_char_alloc_ref_fn,
 3879|    301|        &AllocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 3880|    301|        &DeallocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 3881|    301|        &raw_hash_set::transfer_unprobed_elements_to_next_capacity_fn};
 3882|    301|    return value;
 3883|    301|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7to_slotEPv:
 3361|      1|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3362|      1|    return static_cast<slot_type*>(buf);
 3363|      1|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7reserveEm:
 3016|      2|  void reserve(size_t n) {
 3017|      2|    if (ABSL_PREDICT_TRUE(n > DefaultCapacity())) {
  ------------------
  |  |  191|      2|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 2, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 2]
  |  |  |  Branch (191:57): [True: 2, False: 0]
  |  |  ------------------
  ------------------
 3018|      2|      ReserveTableToFitNewSize(common(), GetPolicyFunctions(),
 3019|      2|                               (std::min)(n, MaxValidSize()));
 3020|      2|    }
 3021|      2|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6insertINS4_4pairIKS8_iEELi0EEENSC_INSA_8iteratorEbEERKT_:
 2684|    298|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2685|    298|    return emplace(value);
 2686|    298|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7emplaceIJRKNS4_4pairIKS8_iEEETnNS4_9enable_ifIXsr14IsDecomposableIDpT_EE5valueEiE4typeELi0EEENSC_INSA_8iteratorEbEEDpOSI_:
 2799|    298|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2800|    298|    return PolicyTraits::apply(EmplaceDecomposable{*this},
 2801|    298|                               std::forward<Args>(args)...);
 2802|    298|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19EmplaceDecomposableclIS8_JRKNS4_21piecewise_construct_tENS4_5tupleIJRKS8_EEENSG_IJRKiEEEEEENS4_4pairINSA_8iteratorEbEERKT_DpOT0_:
 3177|    298|    std::pair<iterator, bool> operator()(const K& key, Args&&... args) const {
 3178|    298|      auto res = s.find_or_prepare_insert(key);
 3179|    298|      if (res.second) {
  ------------------
  |  Branch (3179:11): [True: 298, False: 0]
  ------------------
 3180|    298|        s.emplace_at(res.first, std::forward<Args>(args)...);
 3181|    298|      }
 3182|    298|      return res;
 3183|    298|    }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22find_or_prepare_insertIS8_EENS4_4pairINSA_8iteratorEbEERKT_:
 3646|    298|  std::pair<iterator, bool> find_or_prepare_insert(const K& key) {
 3647|    298|    AssertOnFind(key);
 3648|    298|    if (is_small()) return find_or_prepare_insert_small(key);
  ------------------
  |  Branch (3648:9): [True: 0, False: 298]
  ------------------
 3649|    298|    return find_or_prepare_insert_large(key);
 3650|    298|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE28find_or_prepare_insert_largeIS8_EENS4_4pairINSA_8iteratorEbEERKT_:
 3514|    298|  std::pair<iterator, bool> find_or_prepare_insert_large(const K& key) {
 3515|    298|    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  256|    298|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3516|    298|    prefetch_heap_block();
 3517|    298|    const size_t hash = hash_of(key);
 3518|    298|    auto seq = probe(common(), hash);
 3519|    298|    const h2_t h2 = H2(hash);
 3520|    298|    const ctrl_t* ctrl = control();
 3521|    298|    size_t index;
 3522|    298|    bool inserted;
 3523|       |    // We use a lambda function to be able to exit from the nested loop without
 3524|       |    // duplicating generated code for the return statement (e.g. iterator_at).
 3525|    298|    [&]() ABSL_ATTRIBUTE_ALWAYS_INLINE {
 3526|    298|      while (true) {
 3527|    298|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3528|    298|        absl::PrefetchToLocalCache(slot_array() + seq.offset());
 3529|    298|#endif
 3530|    298|        Group g{ctrl + seq.offset()};
 3531|    298|        for (uint32_t i : g.Match(h2)) {
 3532|    298|          if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i)))) {
 3533|    298|            index = seq.offset(i);
 3534|    298|            inserted = false;
 3535|    298|            return;
 3536|    298|          }
 3537|    298|        }
 3538|    298|        auto mask_empty = g.MaskEmpty();
 3539|    298|        if (ABSL_PREDICT_TRUE(mask_empty)) {
 3540|    298|          size_t target_group_offset = seq.offset();
 3541|    298|          index = SwisstableGenerationsEnabled()
 3542|    298|                      ? PrepareInsertLargeGenerationsEnabled(
 3543|    298|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3544|    298|                            FindInfo{target_group_offset, seq.index()},
 3545|    298|                            HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3546|    298|                      : PrepareInsertLarge(
 3547|    298|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3548|    298|                            FindInfo{target_group_offset, seq.index()});
 3549|    298|          inserted = true;
 3550|    298|          return;
 3551|    298|        }
 3552|    298|        seq.next();
 3553|    298|        ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
 3554|    298|      }
 3555|    298|    }();
 3556|    298|    return {iterator_at(index), inserted};
 3557|    298|  }
_ZZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE28find_or_prepare_insert_largeIS8_EENS4_4pairINSA_8iteratorEbEERKT_ENKUlvE_clEv:
 3525|    298|    [&]() ABSL_ATTRIBUTE_ALWAYS_INLINE {
 3526|    298|      while (true) {
  ------------------
  |  Branch (3526:14): [True: 298, Folded]
  ------------------
 3527|    298|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3528|    298|        absl::PrefetchToLocalCache(slot_array() + seq.offset());
 3529|    298|#endif
 3530|    298|        Group g{ctrl + seq.offset()};
 3531|    298|        for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3531:25): [True: 15, False: 298]
  ------------------
 3532|     15|          if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i)))) {
  ------------------
  |  |  191|     15|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 15]
  |  |  |  Branch (191:48): [Folded, False: 15]
  |  |  |  Branch (191:57): [True: 0, False: 15]
  |  |  ------------------
  ------------------
 3533|      0|            index = seq.offset(i);
 3534|      0|            inserted = false;
 3535|      0|            return;
 3536|      0|          }
 3537|     15|        }
 3538|    298|        auto mask_empty = g.MaskEmpty();
 3539|    298|        if (ABSL_PREDICT_TRUE(mask_empty)) {
  ------------------
  |  |  191|    298|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 298, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 298]
  |  |  |  Branch (191:57): [True: 298, False: 0]
  |  |  ------------------
  ------------------
 3540|    298|          size_t target_group_offset = seq.offset();
 3541|    298|          index = SwisstableGenerationsEnabled()
  ------------------
  |  Branch (3541:19): [Folded, False: 298]
  ------------------
 3542|    298|                      ? PrepareInsertLargeGenerationsEnabled(
 3543|      0|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3544|      0|                            FindInfo{target_group_offset, seq.index()},
 3545|      0|                            HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3546|    298|                      : PrepareInsertLarge(
 3547|    298|                            common(), GetPolicyFunctions(), hash, mask_empty,
 3548|    298|                            FindInfo{target_group_offset, seq.index()});
 3549|    298|          inserted = true;
 3550|    298|          return;
 3551|    298|        }
 3552|      0|        seq.next();
 3553|       |        ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  256|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3554|      0|      }
 3555|    298|    }();
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10emplace_atIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKS8_EEENSF_IJRKiEEEEEEvNSA_8iteratorEDpOT_:
 3661|    298|  void emplace_at(iterator iter, Args&&... args) {
 3662|    298|    construct(iter.slot(), std::forward<Args>(args)...);
 3663|       |
 3664|       |    // When is_small, find calls find_small and if size is 0, then it will
 3665|       |    // return an end iterator. This can happen in the raw_hash_set copy ctor.
 3666|       |    assert((is_small() ||
 3667|    298|            PolicyTraits::apply(FindElement{*this}, *iter) == iter) &&
 3668|    298|           "constructed value does not match the lookup key");
 3669|    298|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKS8_EEENSF_IJRKiEEEEEEvPNS1_13map_slot_typeIS8_iEEDpOT_:
 3205|    298|  inline void construct(slot_type* slot, Args&&... args) {
 3206|    298|    common().RunWithReentrancyGuard([&] {
 3207|    298|      allocator_type alloc(char_alloc_ref());
 3208|    298|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3209|    298|    });
 3210|    298|  }
_ZN4absl12lts_2026052618container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEiEEJEE9constructIJRKNS6_21piecewise_construct_tENS6_5tupleIJRKSA_EEENSH_IJRKiEEEEEEvPNS1_13map_slot_typeISA_iEEDpOT_EUlvE_EEvT_:
 1322|    298|  void RunWithReentrancyGuard(F f) {
 1323|    298|#ifdef NDEBUG
 1324|    298|    f();
 1325|    298|    return;
 1326|      0|#endif
 1327|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1328|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1329|      0|    f();
 1330|      0|    set_capacity(cap);
 1331|      0|  }
_ZZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKS8_EEENSF_IJRKiEEEEEEvPNS1_13map_slot_typeIS8_iEEDpOT_ENKUlvE_clEv:
 3206|    298|    common().RunWithReentrancyGuard([&] {
 3207|    298|      allocator_type alloc(char_alloc_ref());
 3208|    298|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3209|    298|    });
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator4slotEv:
 2285|    298|    slot_type* slot() const { return slot_; }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4findIS8_EENSA_14const_iteratorERKT_:
 3079|    256|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3080|    256|    return const_cast<raw_hash_set*>(this)->find(key);
 3081|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4findIS8_EENSA_8iteratorERKT_:
 3064|    256|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3065|    256|    AssertOnFind(key);
 3066|    256|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3066:9): [True: 0, False: 256]
  ------------------
 3067|    256|    prefetch_heap_block();
 3068|    256|    return find_large(key, hash_of(key));
 3069|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE12AssertOnFindIS8_EEvRKT_:
 3567|    256|  void AssertOnFind([[maybe_unused]] const K& key) {
 3568|    256|    AssertHashEqConsistent(key);
 3569|    256|    AssertNotDebugCapacity();
 3570|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertHashEqConsistentIS8_EEvRKT_:
 3605|    256|  void AssertHashEqConsistent(const K& key) {
 3606|    256|#ifdef NDEBUG
 3607|    256|    return;
 3608|      0|#endif
 3609|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3610|      0|    if (std::is_same<hasher, absl::container_internal::StringHash>::value &&
  ------------------
  |  Branch (3610:9): [True: 0, Folded]
  ------------------
 3611|      0|        std::is_same<key_equal, absl::container_internal::StringEq>::value) {
  ------------------
  |  Branch (3611:9): [True: 0, Folded]
  ------------------
 3612|      0|      return;
 3613|      0|    }
 3614|      0|    if (std::is_scalar<key_type>::value &&
  ------------------
  |  Branch (3614:9): [Folded, False: 0]
  ------------------
 3615|      0|        std::is_same<hasher, absl::Hash<key_type>>::value &&
  ------------------
  |  Branch (3615:9): [Folded, False: 0]
  ------------------
 3616|      0|        std::is_same<key_equal, std::equal_to<key_type>>::value) {
  ------------------
  |  Branch (3616:9): [Folded, False: 0]
  ------------------
 3617|      0|      return;
 3618|      0|    }
 3619|      0|    if (empty()) return;
  ------------------
  |  Branch (3619:9): [True: 0, False: 0]
  ------------------
 3620|       |
 3621|      0|    const size_t hash_of_arg = hash_of(key);
 3622|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3623|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3624|      0|      if (!is_key_equal) return;
 3625|       |
 3626|      0|      [[maybe_unused]] const bool is_hash_equal =
 3627|      0|          hash_of_arg == hash_of(to_slot(slot));
 3628|      0|      assert((!is_key_equal || is_hash_equal) &&
 3629|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3630|      0|             "hash/eq functors are inconsistent.");
 3631|      0|    };
 3632|       |
 3633|      0|    if (is_small()) {
  ------------------
  |  Branch (3633:9): [True: 0, False: 0]
  ------------------
 3634|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3635|      0|      return;
 3636|      0|    }
 3637|       |    // We only do validation for small tables so that it's constant time.
 3638|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3638:9): [True: 0, False: 0]
  ------------------
 3639|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3640|      0|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8equal_toIS8_EEbRKT_PNS1_13map_slot_typeIS8_hEE:
 3344|    258|                                             slot_type* slot) const {
 3345|    258|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3346|    258|                               PolicyTraits::element(slot));
 3347|    258|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE3endEv:
 2577|    256|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2578|    256|    AssertNotDebugCapacity();
 2579|    256|    return iterator(common().generation_ptr());
 2580|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorC2EPKh:
 2257|    256|        : HashSetIteratorGenerationInfo(generation_ptr), ctrl_(nullptr) {}
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10find_largeIS8_EENSA_8iteratorERKT_m:
 3233|    256|  iterator find_large(const key_arg<K>& key, size_t hash) {
 3234|    256|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  256|    256|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3235|    256|    auto seq = probe(common(), hash);
 3236|    256|    const h2_t h2 = H2(hash);
 3237|    256|    const ctrl_t* ctrl = control();
 3238|    256|    while (true) {
  ------------------
  |  Branch (3238:12): [True: 256, Folded]
  ------------------
 3239|    256|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3240|    256|      absl::PrefetchToLocalCache(slot_array() + seq.offset());
 3241|    256|#endif
 3242|    256|      Group g{ctrl + seq.offset()};
 3243|    258|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3243:23): [True: 258, False: 0]
  ------------------
 3244|    258|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array() + seq.offset(i))))
  ------------------
  |  |  191|    258|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 256, False: 2]
  |  |  |  Branch (191:48): [Folded, False: 258]
  |  |  |  Branch (191:57): [True: 256, False: 2]
  |  |  ------------------
  ------------------
 3245|    256|          return iterator_at(seq.offset(i));
 3246|    258|      }
 3247|      0|      if (ABSL_PREDICT_TRUE(g.MaskEmpty())) return end();
  ------------------
  |  |  191|      0|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 0]
  |  |  |  Branch (191:57): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 3248|      0|      seq.next();
 3249|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  256|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3250|      0|    }
 3251|    256|  }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofIS8_EEmRKT_:
 3349|    256|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3350|    256|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3351|    256|                                               common().seed().seed()}(key);
 3352|    256|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorC2ENSA_8iteratorE:
 2312|    512|    const_iterator(iterator i) : inner_(std::move(i)) {}  // NOLINT
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE3endEv:
 2585|    256|  const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2586|    256|    return const_cast<raw_hash_set*>(this)->end();
 2587|    256|  }
_ZN4absl12lts_2026052618container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorESD_:
 2326|    256|    friend bool operator!=(const const_iterator& a, const const_iterator& b) {
 2327|    256|      return !(a == b);
 2328|    256|    }
_ZN4absl12lts_2026052618container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorESD_:
 2323|    256|    friend bool operator==(const const_iterator& a, const const_iterator& b) {
 2324|    256|      return a.inner_ == b.inner_;
 2325|    256|    }
_ZN4absl12lts_2026052618container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorESD_:
 2222|    256|    friend bool operator==(const iterator& a, const iterator& b) {
 2223|    256|      AssertIsValidForComparison(a.ctrl_, a.generation(), a.generation_ptr());
 2224|    256|      AssertIsValidForComparison(b.ctrl_, b.generation(), b.generation_ptr());
 2225|    256|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2226|    256|                          a.generation_ptr(), b.generation_ptr());
 2227|    256|      return a.ctrl_ == b.ctrl_;
 2228|    256|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorptEv:
 2315|    256|    pointer operator->() const { return inner_.operator->(); }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorptEv:
 2201|    256|    pointer operator->() const {
 2202|    256|      assert_is_full("operator->");
 2203|    256|      return &operator*();
 2204|    256|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator14assert_is_fullEPKc:
 2259|    512|    void assert_is_full(const char* operation) const {
 2260|    512|      AssertIsFull(ctrl_, generation(), generation_ptr(), operation);
 2261|    512|    }
_ZNK4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratordeEv:
 2195|    256|    reference operator*() const {
 2196|    256|      assert_is_full("operator*()");
 2197|    256|      return unchecked_deref();
 2198|    256|    }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE5beginEv:
 2568|      1|  iterator begin() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2569|      1|    if (ABSL_PREDICT_FALSE(empty())) return end();
  ------------------
  |  |  190|      1|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1]
  |  |  |  Branch (190:49): [Folded, False: 1]
  |  |  |  Branch (190:58): [True: 0, False: 1]
  |  |  ------------------
  ------------------
 2570|      1|    if (is_small()) return single_iterator();
  ------------------
  |  Branch (2570:9): [True: 0, False: 1]
  ------------------
 2571|      1|    iterator it = {control(), common().slots_union(),
 2572|      1|                   common().generation_ptr()};
 2573|      1|    it.skip_empty_or_deleted();
 2574|       |    ABSL_SWISSTABLE_ASSERT(IsFull(*it.control()));
  ------------------
  |  |  256|      1|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2575|      1|    return it;
 2576|      1|  }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPNS1_6ctrl_tENS1_19MaybeInitializedPtrIvEEPKh:
 2248|      1|        : HashSetIteratorGenerationInfo(generation_ptr),
 2249|      1|          ctrl_(ctrl),
 2250|      1|          slot_(to_slot(slot.get())) {
 2251|       |      // This assumption helps the compiler know that any non-end iterator is
 2252|       |      // not equal to any end iterator.
 2253|      1|      ABSL_ASSUME(ctrl != nullptr);
  ------------------
  |  |  271|      1|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2254|      1|    }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator21skip_empty_or_deletedEv:
 2265|     40|    void skip_empty_or_deleted() {
 2266|     64|      while (IsEmptyOrDeleted(*ctrl_)) {
  ------------------
  |  Branch (2266:14): [True: 24, False: 40]
  ------------------
 2267|     24|        ++ctrl_;
 2268|     24|        ++slot_;
 2269|     24|      }
 2270|     40|    }
_ZN4absl12lts_2026052618container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorESD_:
 2229|     40|    friend bool operator!=(const iterator& a, const iterator& b) {
 2230|     40|      return !(a == b);
 2231|     40|    }
_ZN4absl12lts_2026052618container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorppEv:
 2207|     39|    iterator& operator++() {
 2208|     39|      assert_is_full("operator++");
 2209|     39|      ++ctrl_;
 2210|     39|      ++slot_;
 2211|     39|      skip_empty_or_deleted();
 2212|     39|      if (ABSL_PREDICT_FALSE(*ctrl_ == ctrl_t::kSentinel)) ctrl_ = nullptr;
  ------------------
  |  |  190|     39|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1, False: 38]
  |  |  |  Branch (190:49): [Folded, False: 39]
  |  |  |  Branch (190:58): [True: 1, False: 38]
  |  |  ------------------
  ------------------
 2213|     39|      return *this;
 2214|     39|    }

_ZN4absl12lts_2026052611FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_10StringHashENSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEELb1EEEvEEOT_:
  112|      2|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026052611FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_10StringHashENSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEELb1EEEEENS8_10in_place_tEOT_:
  100|      2|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|      2|    absl::functional_internal::AssertNonNull(f);
  102|      2|    ptr_.obj = &f;
  103|      2|  }

_ZN4absl12lts_2026052619functional_internal12InvokeObjectIRNS0_18container_internal7HashKeyINS3_10StringHashENSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEELb1EEEmJmEEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   74|      1|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   75|      1|  using T = std::remove_reference_t<Obj>;
   76|      1|  return static_cast<R>(std::invoke(
   77|      1|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   78|      1|      std::forward<typename ForwardT<Args>::type>(args)...));
   79|      1|}
_ZN4absl12lts_2026052619functional_internal13AssertNonNullINS0_18container_internal7HashKeyINS3_10StringHashENSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEELb1EEEEEvRKT_:
  136|      2|void AssertNonNull(const F&) {}

_ZN4absl12lts_2026052613hash_internal15MixingHashState18combine_contiguousES2_PKhm:
 1399|  1.24k|                                            size_t size) {
 1400|  1.24k|    return MixingHashState(
 1401|  1.24k|        CombineContiguousImpl(hash_state.state_, first, size,
 1402|  1.24k|                              std::integral_constant<int, sizeof(size_t)>{}));
 1403|  1.24k|  }
_ZN4absl12lts_2026052613hash_internal15MixingHashStateC2Em:
 1450|  2.49k|  explicit MixingHashState(uint64_t state) : state_(state) {}
_ZN4absl12lts_2026052613hash_internal19PrecombineLengthMixEmm:
 1005|  1.24k|inline uint64_t PrecombineLengthMix(uint64_t state, size_t len) {
 1006|  1.24k|  ABSL_ASSUME(len + sizeof(uint64_t) <= sizeof(kStaticRandomData));
  ------------------
  |  |  271|  1.24k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1007|  1.24k|  uint64_t data = absl::base_internal::UnalignedLoad64(
 1008|  1.24k|      reinterpret_cast<const unsigned char*>(&kStaticRandomData[0]) + len);
 1009|  1.24k|  return state ^ data;
 1010|  1.24k|}
_ZN4absl12lts_2026052613hash_internal3MixEmm:
 1012|  1.24k|ABSL_ATTRIBUTE_ALWAYS_INLINE inline uint64_t Mix(uint64_t lhs, uint64_t rhs) {
 1013|       |  // Though the 128-bit product needs multiple instructions on non-x86-64
 1014|       |  // platforms, it is still a good balance between speed and hash quality.
 1015|  1.24k|  absl::uint128 m = lhs;
 1016|  1.24k|  m *= rhs;
 1017|  1.24k|  return Uint128High64(m) ^ Uint128Low64(m);
 1018|  1.24k|}
_ZN4absl12lts_2026052613hash_internal8Read4To8EPKhm:
 1045|  1.21k|inline uint64_t Read4To8(const unsigned char* p, size_t len) {
 1046|       |  // If `len < 8`, we duplicate bytes. We always put low memory at the end.
 1047|       |  // E.g., on little endian platforms:
 1048|       |  // `ABCD` will be read as `ABCDABCD`.
 1049|       |  // `ABCDE` will be read as `BCDEABCD`.
 1050|       |  // `ABCDEF` will be read as `CDEFABCD`.
 1051|       |  // `ABCDEFG` will be read as `DEFGABCD`.
 1052|       |  // `ABCDEFGH` will be read as `EFGHABCD`.
 1053|       |  // We also do not care about endianness. On big-endian platforms, bytes will
 1054|       |  // be permuted differently. We always shift low memory by 32, because that
 1055|       |  // can be pipelined earlier. Reading high memory requires computing
 1056|       |  // `p + len - 4`.
 1057|  1.21k|  uint64_t most_significant =
 1058|  1.21k|      static_cast<uint64_t>(absl::base_internal::UnalignedLoad32(p)) << 32;
 1059|  1.21k|  uint64_t least_significant =
 1060|  1.21k|      absl::base_internal::UnalignedLoad32(p + len - 4);
 1061|  1.21k|  return most_significant | least_significant;
 1062|  1.21k|}
_ZN4absl12lts_2026052613hash_internal8Read1To3EPKhm:
 1065|     33|inline uint32_t Read1To3(const unsigned char* p, size_t len) {
 1066|       |  // The trick used by this implementation is to avoid branches.
 1067|       |  // We always read three bytes by duplicating.
 1068|       |  // E.g.,
 1069|       |  // `A` is read as `AAA`.
 1070|       |  // `AB` is read as `ABB`.
 1071|       |  // `ABC` is read as `ABC`.
 1072|       |  // We always shift `p[0]` so that it can be pipelined better.
 1073|       |  // Other bytes require extra computation to find indices.
 1074|     33|  uint32_t mem0 = (static_cast<uint32_t>(p[0]) << 16) | p[len - 1];
 1075|     33|  uint32_t mem1 = static_cast<uint32_t>(p[len / 2]) << 8;
 1076|     33|  return mem0 | mem1;
 1077|     33|}
_ZN4absl12lts_2026052613hash_internal14CombineRawImplEmm:
 1120|  1.24k|                                                            uint64_t value) {
 1121|  1.24k|  return Mix(state ^ value, kMul);
 1122|  1.24k|}
_ZN4absl12lts_2026052613hash_internal26CombineSmallContiguousImplEmPKhm:
 1136|  1.24k|    uint64_t state, const unsigned char* first, size_t len) {
 1137|  1.24k|  ABSL_ASSUME(len <= 8);
  ------------------
  |  |  271|  1.24k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1138|  1.24k|  uint64_t v;
 1139|  1.24k|  if (len >= 4) {
  ------------------
  |  Branch (1139:7): [True: 1.21k, False: 33]
  ------------------
 1140|  1.21k|    v = Read4To8(first, len);
 1141|  1.21k|  } else if (len > 0) {
  ------------------
  |  Branch (1141:14): [True: 33, False: 0]
  ------------------
 1142|     33|    v = Read1To3(first, len);
 1143|     33|  } else {
 1144|       |    // Empty string must modify the state.
 1145|      0|    v = 0x57;
 1146|      0|  }
 1147|  1.24k|  return CombineRawImpl(state, v);
 1148|  1.24k|}
_ZN4absl12lts_2026052613hash_internal21CombineContiguousImplEmPKhmNSt3__117integral_constantIiLi8EEE:
 1260|  1.24k|    std::integral_constant<int, 8> /* sizeof_size_t */) {
 1261|       |  // For large values we use LowLevelHash or CityHash depending on the platform,
 1262|       |  // for small ones we use custom low latency hash.
 1263|  1.24k|  if (len <= 8) {
  ------------------
  |  Branch (1263:7): [True: 1.24k, False: 0]
  ------------------
 1264|  1.24k|    return CombineSmallContiguousImpl(PrecombineLengthMix(state, len), first,
 1265|  1.24k|                                      len);
 1266|  1.24k|  }
 1267|      0|  if (len <= 16) {
  ------------------
  |  Branch (1267:7): [True: 0, False: 0]
  ------------------
 1268|      0|    return CombineContiguousImpl9to16(PrecombineLengthMix(state, len), first,
 1269|      0|                                      len);
 1270|      0|  }
 1271|      0|  if (len <= 32) {
  ------------------
  |  Branch (1271:7): [True: 0, False: 0]
  ------------------
 1272|      0|    return CombineContiguousImpl17to32(PrecombineLengthMix(state, len), first,
 1273|      0|                                       len);
 1274|      0|  }
 1275|       |  // We must not mix length into the state here because calling
 1276|       |  // CombineContiguousImpl twice with PiecewiseChunkSize() must be equivalent
 1277|       |  // to calling CombineLargeContiguousImpl once with 2 * PiecewiseChunkSize().
 1278|      0|  return CombineLargeContiguousImplOn64BitLengthGt32(state, first, len);
 1279|      0|}
_ZNK4absl12lts_2026052613hash_internal12HashWithSeed4hashINS0_18container_internal10StringHashENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEEmRKT_RKT0_m:
  412|    993|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|    993|    return hasher.hash_with_seed(value, seed);
  415|    993|  }
_ZNK4absl12lts_2026052613hash_internal12HashWithSeed4hashINS1_4HashINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEEES9_EEmRKT_RKT0_m:
  412|  1.24k|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|  1.24k|    return hasher.hash_with_seed(value, seed);
  415|  1.24k|  }
_ZNK4absl12lts_2026052613hash_internal8HashImplINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEE14hash_with_seedERKS7_m:
 1537|  1.24k|  size_t hash_with_seed(const T& value, size_t seed) const {
 1538|  1.24k|    return MixingHashState::hash_with_seed(value, seed);
 1539|  1.24k|  }
_ZN4absl12lts_2026052613hash_internal15MixingHashState14hash_with_seedINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEETnNS4_9enable_ifIXntsr16IntegralFastPathIT_EE5valueEiE4typeELi0EEEmRKSA_m:
 1423|  1.24k|  static size_t hash_with_seed(const T& value, size_t seed) {
 1424|  1.24k|    return static_cast<size_t>(combine(MixingHashState{seed}, value).state_);
 1425|  1.24k|  }
_ZN4absl12lts_2026052613hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJEEES3_S3_RKT_DpRKT0_:
 1548|  1.24k|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1549|  1.24k|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1550|  1.24k|                        std::move(state), value),
 1551|  1.24k|                    values...);
 1552|  1.24k|}
_ZN4absl12lts_2026052613hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineES3_:
  299|  1.24k|  static H combine(H state) { return state; }
_ZN4absl12lts_2026052613hash_internal10HashSelect14HashValueProbe6InvokeINS1_15MixingHashStateENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEENS6_9enable_ifIXsr3std7is_sameIT_DTcl13AbslHashValueclsr3stdE4movefp_Efp0_EEEE5valueESC_E4typeESC_RKT0_:
 1326|  1.24k|        H> {
 1327|  1.24k|      return AbslHashValue(std::move(state), value);
 1328|  1.24k|    }
_ZN4absl12lts_2026052613hash_internal13AbslHashValueINS1_15MixingHashStateEEET_S4_NSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
  661|  1.24k|H AbslHashValue(H hash_state, absl::string_view str) {
  662|  1.24k|  return H::combine_contiguous(std::move(hash_state), str.data(), str.size());
  663|  1.24k|}
_ZN4absl12lts_2026052613hash_internal13HashStateBaseINS1_15MixingHashStateEE18combine_contiguousIcEES3_S3_PKT_m:
 1556|  1.24k|H HashStateBase<H>::combine_contiguous(H state, const T* data, size_t size) {
 1557|  1.24k|  return hash_internal::hash_range_or_bytes(std::move(state), data, size);
 1558|  1.24k|}
_ZN4absl12lts_2026052613hash_internal19hash_range_or_bytesINS1_15MixingHashStateEcEENSt3__19enable_ifIXsr23is_uniquely_representedIT0_EE5valueET_E4typeES7_PKS6_m:
  978|  1.24k|hash_range_or_bytes(H hash_state, const T* data, size_t size) {
  979|  1.24k|  const auto* bytes = reinterpret_cast<const unsigned char*>(data);
  980|  1.24k|  return H::combine_contiguous(std::move(hash_state), bytes, sizeof(T) * size);
  981|  1.24k|}
_ZNK4absl12lts_2026052613hash_internal12HashWithSeed4hashINS0_18container_internal10StringHashENSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEEEEmRKT_RKT0_m:
  412|    255|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|    255|    return hasher.hash_with_seed(value, seed);
  415|    255|  }

_ZN4absl12lts_2026052611countl_zeroImEENSt3__19enable_ifIXsr3std11is_unsignedIT_EE5valueEiE4typeES4_:
  108|      2|    countl_zero(T x) noexcept {
  109|      2|  return numeric_internal::CountLeadingZeroes(x);
  110|      2|}
_ZN4absl12lts_2026052611countr_zeroImEENSt3__19enable_ifIXsr3std11is_unsignedIT_EE5valueEiE4typeES4_:
  123|     14|    countr_zero(T x) noexcept {
  124|     14|  return numeric_internal::CountTrailingZeroes(x);
  125|     14|}
_ZN4absl12lts_2026052611countr_zeroIjEENSt3__19enable_ifIXsr3std11is_unsignedIT_EE5valueEiE4typeES4_:
  123|  1.28k|    countr_zero(T x) noexcept {
  124|  1.28k|  return numeric_internal::CountTrailingZeroes(x);
  125|  1.28k|}

_ZN4absl12lts_202605267uint128mLES1_:
  646|  1.24k|inline uint128& uint128::operator*=(uint128 other) {
  647|  1.24k|  *this = *this * other;
  648|  1.24k|  return *this;
  649|  1.24k|}
_ZN4absl12lts_2026052612Uint128Low64ENS0_7uint128E:
  661|  1.24k|constexpr uint64_t Uint128Low64(uint128 v) { return v.lo_; }
_ZN4absl12lts_2026052613Uint128High64ENS0_7uint128E:
  663|  1.24k|constexpr uint64_t Uint128High64(uint128 v) { return v.hi_; }
_ZNK4absl12lts_202605267uint128cvoEv:
  794|  2.49k|constexpr uint128::operator unsigned __int128() const {
  795|  2.49k|  return (static_cast<unsigned __int128>(hi_) << 64) + lo_;
  796|  2.49k|}
_ZN4absl12lts_20260526mlENS0_7uint128ES1_:
 1059|  1.24k|constexpr uint128 operator*(uint128 lhs, uint128 rhs) {
 1060|       |  // TODO(strel) Remove once alignment issues are resolved and unsigned __int128
 1061|       |  // can be used for uint128 storage.
 1062|  1.24k|  return static_cast<unsigned __int128>(lhs) *
 1063|  1.24k|         static_cast<unsigned __int128>(rhs);
 1064|  1.24k|}
_ZN4absl12lts_202605267uint128C2Em:
  683|  2.49k|constexpr uint128::uint128(unsigned long v) : lo_{v}, hi_{0} {}
_ZN4absl12lts_202605267uint128C2Eo:
  692|  1.24k|    : lo_{static_cast<uint64_t>(v & ~uint64_t{0})},
  693|  1.24k|      hi_{static_cast<uint64_t>(v >> 64)} {}

_ZN4absl12lts_2026052616numeric_internal20CountLeadingZeroes64Em:
  214|      2|CountLeadingZeroes64(uint64_t x) {
  215|      2|#if ABSL_NUMERIC_INTERNAL_HAVE_BUILTIN_OR_GCC(__builtin_clzll)
  216|       |  // Use __builtin_clzll, which uses the following instructions:
  217|       |  //  x86: bsr, lzcnt
  218|       |  //  ARM64: clz
  219|       |  //  PPC: cntlzd
  220|      2|  static_assert(sizeof(unsigned long long) == sizeof(x),  // NOLINT(runtime/int)
  221|      2|                "__builtin_clzll does not take 64-bit arg");
  222|       |
  223|       |  // Handle 0 as a special case because __builtin_clzll(0) is undefined.
  224|      2|  return x == 0 ? 64 : __builtin_clzll(x);
  ------------------
  |  Branch (224:10): [True: 0, False: 2]
  ------------------
  225|       |#elif defined(_MSC_VER) && !defined(__clang__) && \
  226|       |    (defined(_M_X64) || defined(_M_ARM64))
  227|       |  // MSVC does not have __buitin_clzll. Use _BitScanReverse64.
  228|       |  unsigned long result = 0;  // NOLINT(runtime/int)
  229|       |  if (_BitScanReverse64(&result, x)) {
  230|       |    return 63 - result;
  231|       |  }
  232|       |  return 64;
  233|       |#elif defined(_MSC_VER) && !defined(__clang__)
  234|       |  // MSVC does not have __buitin_clzll. Compose two calls to _BitScanReverse
  235|       |  unsigned long result = 0;  // NOLINT(runtime/int)
  236|       |  if ((x >> 32) &&
  237|       |      _BitScanReverse(&result, static_cast<unsigned long>(x >> 32))) {
  238|       |    return 31 - result;
  239|       |  }
  240|       |  if (_BitScanReverse(&result, static_cast<unsigned long>(x))) {
  241|       |    return 63 - result;
  242|       |  }
  243|       |  return 64;
  244|       |#else
  245|       |  int zeroes = 60;
  246|       |  if (x >> 32) {
  247|       |    zeroes -= 32;
  248|       |    x >>= 32;
  249|       |  }
  250|       |  if (x >> 16) {
  251|       |    zeroes -= 16;
  252|       |    x >>= 16;
  253|       |  }
  254|       |  if (x >> 8) {
  255|       |    zeroes -= 8;
  256|       |    x >>= 8;
  257|       |  }
  258|       |  if (x >> 4) {
  259|       |    zeroes -= 4;
  260|       |    x >>= 4;
  261|       |  }
  262|       |  return "\4\3\2\2\1\1\1\1\0\0\0\0\0\0\0"[x] + zeroes;
  263|       |#endif
  264|      2|}
_ZN4absl12lts_2026052616numeric_internal28CountTrailingZeroesNonzero32Ej:
  285|  1.28k|CountTrailingZeroesNonzero32(uint32_t x) {
  286|  1.28k|#if ABSL_NUMERIC_INTERNAL_HAVE_BUILTIN_OR_GCC(__builtin_ctz)
  287|  1.28k|  static_assert(sizeof(unsigned int) == sizeof(x),
  288|  1.28k|                "__builtin_ctz does not take 32-bit arg");
  289|  1.28k|  return __builtin_ctz(x);
  290|       |#elif defined(_MSC_VER) && !defined(__clang__)
  291|       |  unsigned long result = 0;  // NOLINT(runtime/int)
  292|       |  _BitScanForward(&result, x);
  293|       |  return result;
  294|       |#else
  295|       |  int c = 31;
  296|       |  x &= ~x + 1;
  297|       |  if (x & 0x0000FFFF) c -= 16;
  298|       |  if (x & 0x00FF00FF) c -= 8;
  299|       |  if (x & 0x0F0F0F0F) c -= 4;
  300|       |  if (x & 0x33333333) c -= 2;
  301|       |  if (x & 0x55555555) c -= 1;
  302|       |  return c;
  303|       |#endif
  304|  1.28k|}
_ZN4absl12lts_2026052616numeric_internal28CountTrailingZeroesNonzero64Em:
  307|     14|CountTrailingZeroesNonzero64(uint64_t x) {
  308|     14|#if ABSL_NUMERIC_INTERNAL_HAVE_BUILTIN_OR_GCC(__builtin_ctzll)
  309|     14|  static_assert(sizeof(unsigned long long) == sizeof(x),  // NOLINT(runtime/int)
  310|     14|                "__builtin_ctzll does not take 64-bit arg");
  311|     14|  return __builtin_ctzll(x);
  312|       |#elif defined(_MSC_VER) && !defined(__clang__) && \
  313|       |    (defined(_M_X64) || defined(_M_ARM64))
  314|       |  unsigned long result = 0;  // NOLINT(runtime/int)
  315|       |  _BitScanForward64(&result, x);
  316|       |  return result;
  317|       |#elif defined(_MSC_VER) && !defined(__clang__)
  318|       |  unsigned long result = 0;  // NOLINT(runtime/int)
  319|       |  if (static_cast<uint32_t>(x) == 0) {
  320|       |    _BitScanForward(&result, static_cast<unsigned long>(x >> 32));
  321|       |    return result + 32;
  322|       |  }
  323|       |  _BitScanForward(&result, static_cast<unsigned long>(x));
  324|       |  return result;
  325|       |#else
  326|       |  int c = 63;
  327|       |  x &= ~x + 1;
  328|       |  if (x & 0x00000000FFFFFFFF) c -= 32;
  329|       |  if (x & 0x0000FFFF0000FFFF) c -= 16;
  330|       |  if (x & 0x00FF00FF00FF00FF) c -= 8;
  331|       |  if (x & 0x0F0F0F0F0F0F0F0F) c -= 4;
  332|       |  if (x & 0x3333333333333333) c -= 2;
  333|       |  if (x & 0x5555555555555555) c -= 1;
  334|       |  return c;
  335|       |#endif
  336|     14|}
_ZN4absl12lts_2026052616numeric_internal18CountLeadingZeroesImEEiT_:
  268|      2|CountLeadingZeroes(T x) {
  269|      2|  static_assert(std::is_unsigned<T>::value, "T must be unsigned");
  270|      2|  static_assert(IsPowerOf2(std::numeric_limits<T>::digits),
  271|      2|                "T must have a power-of-2 size");
  272|      2|  static_assert(sizeof(T) <= sizeof(uint64_t), "T too large");
  273|      2|  return sizeof(T) <= sizeof(uint16_t)
  ------------------
  |  Branch (273:10): [Folded, False: 2]
  ------------------
  274|      2|             ? CountLeadingZeroes16(static_cast<uint16_t>(x)) -
  275|      0|                   (std::numeric_limits<uint16_t>::digits -
  276|      0|                    std::numeric_limits<T>::digits)
  277|      2|             : (sizeof(T) <= sizeof(uint32_t)
  ------------------
  |  Branch (277:17): [Folded, False: 2]
  ------------------
  278|      2|                    ? CountLeadingZeroes32(static_cast<uint32_t>(x)) -
  279|      0|                          (std::numeric_limits<uint32_t>::digits -
  280|      0|                           std::numeric_limits<T>::digits)
  281|      2|                    : CountLeadingZeroes64(x));
  282|      2|}
_ZN4absl12lts_2026052616numeric_internal19CountTrailingZeroesImEEiT_:
  353|     14|CountTrailingZeroes(T x) noexcept {
  354|     14|  static_assert(std::is_unsigned<T>::value, "T must be unsigned");
  355|     14|  static_assert(IsPowerOf2(std::numeric_limits<T>::digits),
  356|     14|                "T must have a power-of-2 size");
  357|     14|  static_assert(sizeof(T) <= sizeof(uint64_t), "T too large");
  358|     14|  return x == 0 ? std::numeric_limits<T>::digits
  ------------------
  |  Branch (358:10): [True: 0, False: 14]
  ------------------
  359|     14|                : (sizeof(T) <= sizeof(uint16_t)
  ------------------
  |  Branch (359:20): [Folded, False: 14]
  ------------------
  360|     14|                       ? CountTrailingZeroesNonzero16(static_cast<uint16_t>(x))
  361|     14|                       : (sizeof(T) <= sizeof(uint32_t)
  ------------------
  |  Branch (361:27): [Folded, False: 14]
  ------------------
  362|     14|                              ? CountTrailingZeroesNonzero32(
  363|      0|                                    static_cast<uint32_t>(x))
  364|     14|                              : CountTrailingZeroesNonzero64(x)));
  365|     14|}
_ZN4absl12lts_2026052616numeric_internal19CountTrailingZeroesIjEEiT_:
  353|  1.28k|CountTrailingZeroes(T x) noexcept {
  354|  1.28k|  static_assert(std::is_unsigned<T>::value, "T must be unsigned");
  355|  1.28k|  static_assert(IsPowerOf2(std::numeric_limits<T>::digits),
  356|  1.28k|                "T must have a power-of-2 size");
  357|  1.28k|  static_assert(sizeof(T) <= sizeof(uint64_t), "T too large");
  358|  1.28k|  return x == 0 ? std::numeric_limits<T>::digits
  ------------------
  |  Branch (358:10): [True: 0, False: 1.28k]
  ------------------
  359|  1.28k|                : (sizeof(T) <= sizeof(uint16_t)
  ------------------
  |  Branch (359:20): [Folded, False: 1.28k]
  ------------------
  360|  1.28k|                       ? CountTrailingZeroesNonzero16(static_cast<uint16_t>(x))
  361|  1.28k|                       : (sizeof(T) <= sizeof(uint32_t)
  ------------------
  |  Branch (361:27): [True: 1.28k, Folded]
  ------------------
  362|  1.28k|                              ? CountTrailingZeroesNonzero32(
  363|  1.28k|                                    static_cast<uint32_t>(x))
  364|  1.28k|                              : CountTrailingZeroesNonzero64(x)));
  365|  1.28k|}

_ZN4absl12lts_202605266StatusC2Em:
  714|     50|  explicit Status(uintptr_t rep) : rep_(rep) {}
_ZN4absl12lts_202605266Status12MovedFromRepEv:
 1027|     19|constexpr uintptr_t Status::MovedFromRep() {
 1028|     19|  return CodeToInlinedRep(absl::StatusCode::kInternal) | 2;
 1029|     19|}
_ZN4absl12lts_202605266Status3RefEm:
 1042|     19|inline void Status::Ref(uintptr_t rep) {
 1043|     19|  if (!IsInlined(rep)) RepToPointer(rep)->Ref();
  ------------------
  |  Branch (1043:7): [True: 0, False: 19]
  ------------------
 1044|     19|}
_ZN4absl12lts_202605268OkStatusEv:
 1050|     11|inline Status OkStatus() { return Status(); }
_ZN4absl12lts_202605266StatusC2EOS1_:
  914|     19|inline Status::Status(Status&& x) noexcept : Status(x.rep_) {
  915|     19|  x.rep_ = MovedFromRep();
  916|     19|}
_ZN4absl12lts_202605266StatusC2Ev:
  894|     12|inline Status::Status() : Status(absl::StatusCode::kOk) {}
_ZN4absl12lts_202605266StatusC2ENS0_10StatusCodeE:
  896|     12|inline Status::Status(absl::StatusCode code) : Status(CodeToInlinedRep(code)) {}
_ZN4absl12lts_202605266StatusC2ERKS1_:
  902|     19|inline Status::Status(const Status& x) : Status(x.rep_) { Ref(rep_); }

_ZN4absl12lts_2026052621status_macro_internal12MacroAdaptorEONS0_6StatusENS0_14SourceLocationE:
  444|     19|                                         absl::SourceLocation loc) {
  445|     19|  return ReturnIfErrorAdaptor(std::move(s), loc);
  446|     19|}
_ZN4absl12lts_2026052621status_macro_internal20ReturnIfErrorAdaptorC2EONS0_6StatusENS0_14SourceLocationE:
  404|     19|      : status_(std::move(status)), loc_(loc) {}
_ZNK4absl12lts_2026052621status_macro_internal20ReturnIfErrorAdaptorcvbEv:
  420|     19|  explicit operator bool() const { return ABSL_PREDICT_TRUE(status_.ok()); }
  ------------------
  |  |  191|     19|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:48): [Folded, False: 19]
  |  |  |  Branch (191:57): [True: 19, False: 0]
  |  |  ------------------
  ------------------
_ZN4absl12lts_2026052621status_macro_internal20ReturnIfErrorAdaptorD2Ev:
  406|     19|  ~ReturnIfErrorAdaptor() {
  407|       |    // WARNING! WARNING! WARNING!
  408|       |    //
  409|       |    // We play fast and loose here and avoid destroying status_. This should be
  410|       |    // safe because status_ will never own memory at destruction time. The two
  411|       |    // cases to consider are:
  412|       |    //  (1) OK: OkStatus() representation needs no cleanup
  413|       |    //  (2) Not-OK: we take the else branch in ABSL_RETURN_IF_ERROR and move
  414|       |    //      status_ into StatusBuilder which leaves status_ with a MovedFromRep
  415|       |    //      that needs no cleanup.
  416|       |    // If the absl::Status implementation changes, leaks should be caught by
  417|       |    // the various tests we have when run under lsan or debug leak checker.
  418|     19|  }

_ZN4absl12lts_2026052619str_format_internal14ExtractCharSetILNS0_23FormatConversionCharSetE655355EEES3_NS1_16ArgConvertResultIXT_EEE:
  206|    256|constexpr FormatConversionCharSet ExtractCharSet(ArgConvertResult<C>) {
  207|    256|  return C;
  208|    256|}
_ZN4absl12lts_2026052619str_format_internal13FormatArgImplC2IiEERKT_:
  494|    256|  explicit FormatArgImpl(const T& value) {
  495|    256|    using D = typename DecayType<T>::type;
  496|    256|    static_assert(
  497|    256|        std::is_same<D, const T&>::value || storage_policy<D>::value == ByValue,
  498|    256|        "Decayed types must be stored by value");
  499|    256|    Init(static_cast<D>(value));
  500|    256|  }
_ZN4absl12lts_2026052619str_format_internal13FormatArgImpl4InitIiEEvRKT_:
  547|    256|  void Init(const T& value) {
  548|    256|    data_ = Manager<T>::SetValue(value);
  549|    256|    dispatcher_ = &Dispatch<T>;
  550|    256|  }
_ZN4absl12lts_2026052619str_format_internal13FormatArgImpl7ManagerIiLNS2_13StoragePolicyE2EE8SetValueERKi:
  533|    256|    static Data SetValue(const T& value) {
  534|    256|      Data data;
  535|    256|      memcpy(data.buf, &value, sizeof(value));
  536|    256|      return data;
  537|    256|    }
_ZN4absl12lts_2026052619str_format_internal13FormatArgImpl8DispatchIiEEbNS2_4DataENS1_24FormatConversionSpecImplEPv:
  588|    256|  static bool Dispatch(Data arg, FormatConversionSpecImpl spec, void* out) {
  589|       |    // A `none` conv indicates that we want the `int` conversion.
  590|    256|    if (ABSL_PREDICT_FALSE(spec.conversion_char() ==
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  591|    256|                           FormatConversionCharInternal::kNone)) {
  592|      0|      return ToInt<T>(arg, static_cast<int*>(out), std::is_integral<T>(),
  593|      0|                      std::is_enum<T>());
  594|      0|    }
  595|    256|    if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|    256|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 256]
  |  |  |  Branch (190:49): [Folded, False: 256]
  |  |  |  Branch (190:58): [True: 0, False: 256]
  |  |  ------------------
  ------------------
  596|    256|            !Contains(ArgumentToConv<T>(), spec.conversion_char()))) {
  597|      0|      return false;
  598|      0|    }
  599|    256|    return str_format_internal::FormatConvertImpl(
  600|    256|               Manager<T>::Value(arg), spec, static_cast<FormatSinkImpl*>(out))
  601|    256|        .value;
  602|    256|  }
_ZN4absl12lts_2026052619str_format_internal14ArgumentToConvIiEENS0_23FormatConversionCharSetEv:
  420|    256|constexpr FormatConversionCharSet ArgumentToConv() {
  421|    256|  using ConvResult = decltype(str_format_internal::FormatConvertImpl(
  422|    256|      std::declval<const Arg&>(),
  423|    256|      std::declval<const FormatConversionSpecImpl&>(),
  424|    256|      std::declval<FormatSinkImpl*>()));
  425|    256|  return absl::str_format_internal::ExtractCharSet(ConvResult{});
  426|    256|}
_ZN4absl12lts_2026052619str_format_internal13FormatArgImpl7ManagerIiLNS2_13StoragePolicyE2EE5ValueENS2_4DataE:
  539|    256|    static T Value(Data arg) {
  540|    256|      T value;
  541|    256|      memcpy(&value, arg.buf, sizeof(T));
  542|    256|      return value;
  543|    256|    }

_ZN4absl12lts_2026052619str_format_internal21UntypedFormatSpecImplC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   56|    256|      : data_(s.data()), size_(s.size()) {}
_ZN4absl12lts_2026052619str_format_internal21UntypedFormatSpecImpl7ExtractINS1_18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE655355EEEEEERKS2_RKT_:
   73|    256|  static const UntypedFormatSpecImpl& Extract(const T& s) {
   74|    256|    return s.spec_;
   75|    256|  }
_ZN4absl12lts_2026052619str_format_internal18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE655355EEEC2EUa9enable_ifIXclL_ZNS1_15ValidFormatImplIJLS3_655355EEEEbNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEfL0p_EEEPKc:
  159|    256|      : Base(s) {}

_ZNK4absl12lts_2026052619str_format_internal24FormatConversionSpecImpl15conversion_charEv:
  290|  2.04k|  FormatConversionChar conversion_char() const {
  291|       |    // Keep this field first in the struct . It generates better code when
  292|       |    // accessing it when ConversionSpec is passed by value in registers.
  293|  2.04k|    static_assert(offsetof(FormatConversionSpecImpl, conv_) == 0, "");
  294|  2.04k|    return conv_;
  295|  2.04k|  }
_ZN4absl12lts_2026052619str_format_internal29FormatConversionCharToConvIntENS0_20FormatConversionCharE:
  360|    256|constexpr uint64_t FormatConversionCharToConvInt(FormatConversionChar c) {
  361|    256|  return uint64_t{1} << (1 + static_cast<uint8_t>(c));
  362|    256|}
_ZN4absl12lts_2026052619str_format_internal8ContainsENS0_23FormatConversionCharSetENS0_20FormatConversionCharE:
  442|    256|constexpr bool Contains(FormatConversionCharSet set, FormatConversionChar c) {
  443|    256|  return (static_cast<uint64_t>(set) & FormatConversionCharToConvInt(c)) != 0;
  444|    256|}

_ZN4absl12lts_2026052617UntypedFormatSpecC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  111|    256|  explicit UntypedFormatSpec(string_view s) : spec_(s) {}
_ZN4absl12lts_202605269StrFormatIJiEEENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEERKNS0_19str_format_internal18FormatSpecTemplateIJXspclsr19str_format_internalE14ArgumentToConvIT_EEEEEEDpRKSB_:
  363|    256|                                    const Args&... args) {
  364|    256|  return str_format_internal::FormatPack(
  365|    256|      str_format_internal::UntypedFormatSpecImpl::Extract(format),
  366|    256|      {str_format_internal::FormatArgImpl(args)...});
  367|    256|}

_ZN4absl12lts_2026052614SourceLocation7currentENS1_10PrivateTagEjPKc:
  113|     19|      const char* absl_nonnull file_name = __builtin_FILE()) {
  114|     19|    return SourceLocation(line, file_name);
  115|     19|  }
_ZN4absl12lts_2026052614SourceLocationC2EjPKc:
  151|     19|      : line_(line), file_name_(file_name) {}

_ZN4absl12lts_202605264SpanIKNS0_19str_format_internal13FormatArgImplEEC2IS4_S4_EESt16initializer_listIS3_E:
  310|    256|      : Span(v.begin(), v.size()) {}
_ZN4absl12lts_202605264SpanIKNS0_19str_format_internal13FormatArgImplEEC2EPS4_m:
  230|    256|      : ptr_(array), len_(length) {}

_ZN5Darts7Details15DoubleArrayUnitC2Ev:
   53|    256|  DoubleArrayUnit() : unit_() {}
_ZNK5Darts7Details15DoubleArrayUnit8has_leafEv:
   57|     93|  bool has_leaf() const {
   58|     93|    return ((unit_ >> 8) & 1) == 1;
   59|     93|  }
_ZNK5Darts7Details15DoubleArrayUnit5valueEv:
   62|     58|  value_type value() const {
   63|     58|    return static_cast<value_type>(unit_ & ((1U << 31) - 1));
   64|     58|  }
_ZNK5Darts7Details15DoubleArrayUnit5labelEv:
   69|     94|  id_type label() const {
   70|     94|    return unit_ & ((1U << 31) | 0xFF);
   71|     94|  }
_ZNK5Darts7Details15DoubleArrayUnit6offsetEv:
   73|    133|  id_type offset() const {
   74|    133|    return (unit_ >> 10) << ((unit_ & (1U << 9)) >> 6);
   75|    133|  }
_ZN5Darts7Details9BitVectorC2Ev:
  804|      1|  BitVector() : units_(), ranks_(), num_ones_(0), size_(0) {}
_ZN5Darts7Details9BitVectorD2Ev:
  805|      1|  ~BitVector() {
  806|      1|    clear();
  807|      1|  }
_ZNK5Darts7Details9BitVectorixEm:
  809|    120|  bool operator[](std::size_t id) const {
  810|    120|    return (units_[id / UNIT_SIZE] >> (id % UNIT_SIZE) & 1) == 1;
  811|    120|  }
_ZNK5Darts7Details9BitVector8num_onesEv:
  830|      2|  std::size_t num_ones() const {
  831|      2|    return num_ones_;
  832|      2|  }
_ZNK5Darts7Details9BitVector4sizeEv:
  833|     99|  std::size_t size() const {
  834|     99|    return size_;
  835|     99|  }
_ZN5Darts7Details9BitVector6appendEv:
  837|     99|  void append() {
  838|     99|    if ((size_ % UNIT_SIZE) == 0) {
  ------------------
  |  Branch (838:9): [True: 4, False: 95]
  ------------------
  839|      4|      units_.append(0);
  840|      4|    }
  841|     99|    ++size_;
  842|     99|  }
_ZN5Darts7Details9BitVector5clearEv:
  845|      3|  void clear() {
  846|      3|    units_.clear();
  847|      3|    ranks_.clear();
  848|      3|  }
_ZN5Darts7Details9BitVector9pop_countEj:
  862|      4|  static id_type pop_count(id_type unit) {
  863|      4|    unit = ((unit & 0xAAAAAAAA) >> 1) + (unit & 0x55555555);
  864|      4|    unit = ((unit & 0xCCCCCCCC) >> 2) + (unit & 0x33333333);
  865|      4|    unit = ((unit >> 4) + unit) & 0x0F0F0F0F;
  866|      4|    unit += unit >> 8;
  867|      4|    unit += unit >> 16;
  868|      4|    return unit & 0xFF;
  869|      4|  }
_ZN5Darts7Details8DawgNodeC2Ev:
  950|     99|  DawgNode() : child_(0), sibling_(0), label_('\0'),
  951|     99|    is_state_(false), has_sibling_(false) {}
_ZN5Darts7Details8DawgNode9set_childEj:
  953|    158|  void set_child(id_type child) {
  954|    158|    child_ = child;
  955|    158|  }
_ZN5Darts7Details8DawgNode11set_siblingEj:
  956|     98|  void set_sibling(id_type sibling) {
  957|     98|    sibling_ = sibling;
  958|     98|  }
_ZN5Darts7Details8DawgNode9set_valueEi:
  959|     39|  void set_value(value_type value) {
  960|     39|    child_ = value;
  961|     39|  }
_ZN5Darts7Details8DawgNode9set_labelEh:
  962|     99|  void set_label(uchar_type label) {
  963|     99|    label_ = label;
  964|     99|  }
_ZN5Darts7Details8DawgNode12set_is_stateEb:
  965|     60|  void set_is_state(bool is_state) {
  966|     60|    is_state_ = is_state;
  967|     60|  }
_ZN5Darts7Details8DawgNode15set_has_siblingEb:
  968|     38|  void set_has_sibling(bool has_sibling) {
  969|     38|    has_sibling_ = has_sibling;
  970|     38|  }
_ZNK5Darts7Details8DawgNode5childEv:
  972|    269|  id_type child() const {
  973|    269|    return child_;
  974|    269|  }
_ZNK5Darts7Details8DawgNode7siblingEv:
  975|    394|  id_type sibling() const {
  976|    394|    return sibling_;
  977|    394|  }
_ZNK5Darts7Details8DawgNode5labelEv:
  981|    269|  uchar_type label() const {
  982|    269|    return label_;
  983|    269|  }
_ZNK5Darts7Details8DawgNode4unitEv:
  991|    199|  id_type unit() const {
  992|    199|    if (label_ == '\0') {
  ------------------
  |  Branch (992:9): [True: 78, False: 121]
  ------------------
  993|     78|      return (child_ << 1) | (has_sibling_ ? 1 : 0);
  ------------------
  |  Branch (993:31): [True: 18, False: 60]
  ------------------
  994|     78|    }
  995|    121|    return (child_ << 2) | (is_state_ ? 2 : 0) | (has_sibling_ ? 1 : 0);
  ------------------
  |  Branch (995:29): [True: 44, False: 77]
  |  Branch (995:51): [True: 58, False: 63]
  ------------------
  996|    199|  }
_ZN5Darts7Details8DawgUnitC2Ej:
 1014|     99|  explicit DawgUnit(id_type unit = 0) : unit_(unit) {}
_ZN5Darts7Details8DawgUnitC2ERKS1_:
 1015|    127|  DawgUnit(const DawgUnit &unit) : unit_(unit.unit_) {}
_ZN5Darts7Details8DawgUnitaSEj:
 1017|     99|  DawgUnit &operator=(id_type unit) {
 1018|     99|    unit_ = unit;
 1019|     99|    return *this;
 1020|     99|  }
_ZNK5Darts7Details8DawgUnit4unitEv:
 1022|      2|  id_type unit() const {
 1023|      2|    return unit_;
 1024|      2|  }
_ZNK5Darts7Details8DawgUnit5childEv:
 1026|    181|  id_type child() const {
 1027|    181|    return unit_ >> 2;
 1028|    181|  }
_ZNK5Darts7Details8DawgUnit11has_siblingEv:
 1029|    296|  bool has_sibling() const {
 1030|    296|    return (unit_ & 1) == 1;
 1031|    296|  }
_ZNK5Darts7Details8DawgUnit5valueEv:
 1032|     39|  value_type value() const {
 1033|     39|    return static_cast<value_type>(unit_ >> 1);
 1034|     39|  }
_ZN5Darts7Details11DawgBuilderC2Ev:
 1051|      1|  DawgBuilder() : nodes_(), units_(), labels_(), is_intersections_(),
 1052|      1|    table_(), node_stack_(), recycle_bin_(), num_states_(0) {}
_ZN5Darts7Details11DawgBuilderD2Ev:
 1053|      1|  ~DawgBuilder() {
 1054|      1|    clear();
 1055|      1|  }
_ZNK5Darts7Details11DawgBuilder4rootEv:
 1057|      2|  id_type root() const {
 1058|      2|    return 0;
 1059|      2|  }
_ZNK5Darts7Details11DawgBuilder5childEj:
 1061|    181|  id_type child(id_type id) const {
 1062|    181|    return units_[id].child();
 1063|    181|  }
_ZNK5Darts7Details11DawgBuilder7siblingEj:
 1064|    294|  id_type sibling(id_type id) const {
 1065|    294|    return units_[id].has_sibling() ? (id + 1) : 0;
  ------------------
  |  Branch (1065:12): [True: 114, False: 180]
  ------------------
 1066|    294|  }
_ZNK5Darts7Details11DawgBuilder5valueEj:
 1067|     39|  int value(id_type id) const {
 1068|     39|    return units_[id].value();
 1069|     39|  }
_ZNK5Darts7Details11DawgBuilder7is_leafEj:
 1071|     98|  bool is_leaf(id_type id) const {
 1072|     98|    return label(id) == '\0';
 1073|     98|  }
_ZNK5Darts7Details11DawgBuilder5labelEj:
 1074|    294|  uchar_type label(id_type id) const {
 1075|    294|    return labels_[id];
 1076|    294|  }
_ZNK5Darts7Details11DawgBuilder15is_intersectionEj:
 1078|    120|  bool is_intersection(id_type id) const {
 1079|    120|    return is_intersections_[id];
 1080|    120|  }
_ZNK5Darts7Details11DawgBuilder17num_intersectionsEv:
 1085|      2|  std::size_t num_intersections() const {
 1086|      2|    return is_intersections_.num_ones();
 1087|      2|  }
_ZNK5Darts7Details11DawgBuilder4sizeEv:
 1089|      8|  std::size_t size() const {
 1090|      8|    return units_.size();
 1091|      8|  }
_ZN5Darts7Details11DawgBuilder9free_nodeEj:
 1131|     98|  void free_node(id_type id) {
 1132|     98|    recycle_bin_.push(id);
 1133|     98|  }
_ZN5Darts7Details11DawgBuilder4hashEj:
 1135|     98|  static id_type hash(id_type key) {
 1136|     98|    key = ~key + (key << 15);  // key = (key << 15) - key - 1;
 1137|     98|    key = key ^ (key >> 12);
 1138|     98|    key = key + (key << 2);
 1139|     98|    key = key ^ (key >> 4);
 1140|     98|    key = key * 2057;  // key = (key + (key << 3)) + (key << 11);
 1141|     98|    key = key ^ (key >> 16);
 1142|     98|    return key;
 1143|     98|  }
_ZN5Darts7Details22DoubleArrayBuilderUnitC2Ev:
 1397|    256|  DoubleArrayBuilderUnit() : unit_(0) {}
_ZN5Darts7Details22DoubleArrayBuilderUnit12set_has_leafEb:
 1399|     39|  void set_has_leaf(bool has_leaf) {
 1400|     39|    if (has_leaf) {
  ------------------
  |  Branch (1400:9): [True: 39, False: 0]
  ------------------
 1401|     39|      unit_ |= 1U << 8;
 1402|     39|    } else {
 1403|      0|      unit_ &= ~(1U << 8);
 1404|      0|    }
 1405|     39|  }
_ZN5Darts7Details22DoubleArrayBuilderUnit9set_valueEi:
 1406|     39|  void set_value(value_type value) {
 1407|     39|    unit_ = value | (1U << 31);
 1408|     39|  }
_ZN5Darts7Details22DoubleArrayBuilderUnit9set_labelEh:
 1409|    217|  void set_label(uchar_type label) {
 1410|    217|    unit_ = (unit_ & ~0xFFU) | label;
 1411|    217|  }
_ZN5Darts7Details22DoubleArrayBuilderUnit10set_offsetEj:
 1412|     61|  void set_offset(id_type offset) {
 1413|     61|    if (offset >= 1U << 29) {
  ------------------
  |  Branch (1413:9): [True: 0, False: 61]
  ------------------
 1414|      0|      DARTS_THROW("failed to modify unit: too large offset");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
 1415|      0|    }
 1416|     61|    unit_ &= (1U << 31) | (1U << 8) | 0xFF;
 1417|     61|    if (offset < 1U << 21) {
  ------------------
  |  Branch (1417:9): [True: 61, False: 0]
  ------------------
 1418|     61|      unit_ |= (offset << 10);
 1419|     61|    } else {
 1420|      0|      unit_ |= (offset << 2) | (1U << 9);
 1421|      0|    }
 1422|     61|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnitC2Ev:
 1436|  4.09k|  DoubleArrayBuilderExtraUnit() : prev_(0), next_(0),
 1437|  4.09k|      is_fixed_(false), is_used_(false) {}
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit8set_prevEj:
 1439|    514|  void set_prev(id_type prev) {
 1440|    514|    prev_ = prev;
 1441|    514|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit8set_nextEj:
 1442|    514|  void set_next(id_type next) {
 1443|    514|    next_ = next;
 1444|    514|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit12set_is_fixedEb:
 1445|    256|  void set_is_fixed(bool is_fixed) {
 1446|    256|    is_fixed_ = is_fixed;
 1447|    256|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit11set_is_usedEb:
 1448|     61|  void set_is_used(bool is_used) {
 1449|     61|    is_used_ = is_used;
 1450|     61|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit4prevEv:
 1452|    514|  id_type prev() const {
 1453|    514|    return prev_;
 1454|    514|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit4nextEv:
 1455|    787|  id_type next() const {
 1456|    787|    return next_;
 1457|    787|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit8is_fixedEv:
 1458|    305|  bool is_fixed() const {
 1459|    305|    return is_fixed_;
 1460|    305|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit7is_usedEv:
 1461|    132|  bool is_used() const {
 1462|    132|    return is_used_;
 1463|    132|  }
_ZN5Darts7Details18DoubleArrayBuilderC2EPFimmE:
 1481|      1|      : progress_func_(progress_func), units_(), extras_(), labels_(),
 1482|      1|        table_(), extras_head_(0) {}
_ZN5Darts7Details18DoubleArrayBuilderD2Ev:
 1483|      1|  ~DoubleArrayBuilder() {
 1484|      1|    clear();
 1485|      1|  }
_ZNK5Darts7Details18DoubleArrayBuilder10num_blocksEv:
 1515|      3|  std::size_t num_blocks() const {
 1516|      3|    return units_.size() / BLOCK_SIZE;
 1517|      3|  }
_ZNK5Darts7Details18DoubleArrayBuilder6extrasEj:
 1519|    249|  const extra_type &extras(id_type id) const {
 1520|    249|    return extras_[id % NUM_EXTRAS];
 1521|    249|  }
_ZN5Darts7Details18DoubleArrayBuilder6extrasEj:
 1522|  2.83k|  extra_type &extras(id_type id) {
 1523|  2.83k|    return extras_[id % NUM_EXTRAS];
 1524|  2.83k|  }
_ZN5Darts7Details9BitVector5buildEv:
  872|      1|inline void BitVector::build() {
  873|      1|  try {
  874|      1|    ranks_.reset(new id_type[units_.size()]);
  875|      1|  } catch (const std::bad_alloc &) {
  876|      0|    DARTS_THROW("failed to build rank index: std::bad_alloc");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
  877|      0|  }
  878|       |
  879|      1|  num_ones_ = 0;
  880|      5|  for (std::size_t i = 0; i < units_.size(); ++i) {
  ------------------
  |  Branch (880:27): [True: 4, False: 1]
  ------------------
  881|      4|    ranks_[i] = num_ones_;
  882|      4|    num_ones_ += pop_count(units_[i]);
  883|      4|  }
  884|      1|}
_ZN5Darts7Details11DawgBuilder4initEv:
 1146|      1|inline void DawgBuilder::init() {
 1147|      1|  table_.resize(INITIAL_TABLE_SIZE, 0);
 1148|       |
 1149|      1|  append_node();
 1150|      1|  append_unit();
 1151|       |
 1152|      1|  num_states_ = 1;
 1153|       |
 1154|      1|  nodes_[0].set_label(0xFF);
 1155|      1|  node_stack_.push(0);
 1156|      1|}
_ZN5Darts7Details11DawgBuilder6finishEv:
 1158|      1|inline void DawgBuilder::finish() {
 1159|      1|  flush(0);
 1160|       |
 1161|      1|  units_[0] = nodes_[0].unit();
 1162|      1|  labels_[0] = nodes_[0].label();
 1163|       |
 1164|      1|  nodes_.clear();
 1165|      1|  table_.clear();
 1166|      1|  node_stack_.clear();
 1167|      1|  recycle_bin_.clear();
 1168|       |
 1169|      1|  is_intersections_.build();
 1170|      1|}
_ZN5Darts7Details11DawgBuilder6insertEPKcmi:
 1173|     39|    value_type value) {
 1174|     39|  if (value < 0) {
  ------------------
  |  Branch (1174:7): [True: 0, False: 39]
  ------------------
 1175|      0|    DARTS_THROW("failed to insert key: negative value");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
 1176|     39|  } else if (length == 0) {
  ------------------
  |  Branch (1176:14): [True: 0, False: 39]
  ------------------
 1177|      0|    DARTS_THROW("failed to insert key: zero-length key");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
 1178|      0|  }
 1179|       |
 1180|     39|  id_type id = 0;
 1181|     39|  std::size_t key_pos = 0;
 1182|       |
 1183|     73|  for ( ; key_pos <= length; ++key_pos) {
  ------------------
  |  Branch (1183:11): [True: 73, False: 0]
  ------------------
 1184|     73|    id_type child_id = nodes_[id].child();
 1185|     73|    if (child_id == 0) {
  ------------------
  |  Branch (1185:9): [True: 1, False: 72]
  ------------------
 1186|      1|      break;
 1187|      1|    }
 1188|       |
 1189|     72|    uchar_type key_label = static_cast<uchar_type>(key[key_pos]);
 1190|     72|    if (key_pos < length && key_label == '\0') {
  ------------------
  |  Branch (1190:9): [True: 72, False: 0]
  |  Branch (1190:29): [True: 0, False: 72]
  ------------------
 1191|      0|      DARTS_THROW("failed to insert key: invalid null character");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
 1192|      0|    }
 1193|       |
 1194|     72|    uchar_type unit_label = nodes_[child_id].label();
 1195|     72|    if (key_label < unit_label) {
  ------------------
  |  Branch (1195:9): [True: 0, False: 72]
  ------------------
 1196|      0|      DARTS_THROW("failed to insert key: wrong key order");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
 1197|     72|    } else if (key_label > unit_label) {
  ------------------
  |  Branch (1197:16): [True: 38, False: 34]
  ------------------
 1198|     38|      nodes_[child_id].set_has_sibling(true);
 1199|     38|      flush(child_id);
 1200|     38|      break;
 1201|     38|    }
 1202|     34|    id = child_id;
 1203|     34|  }
 1204|       |
 1205|     39|  if (key_pos > length) {
  ------------------
  |  Branch (1205:7): [True: 0, False: 39]
  ------------------
 1206|      0|    return;
 1207|      0|  }
 1208|       |
 1209|    137|  for ( ; key_pos <= length; ++key_pos) {
  ------------------
  |  Branch (1209:11): [True: 98, False: 39]
  ------------------
 1210|     98|    uchar_type key_label = static_cast<uchar_type>(
 1211|     98|        (key_pos < length) ? key[key_pos] : '\0');
  ------------------
  |  Branch (1211:9): [True: 59, False: 39]
  ------------------
 1212|     98|    id_type child_id = append_node();
 1213|       |
 1214|     98|    if (nodes_[id].child() == 0) {
  ------------------
  |  Branch (1214:9): [True: 60, False: 38]
  ------------------
 1215|     60|      nodes_[child_id].set_is_state(true);
 1216|     60|    }
 1217|     98|    nodes_[child_id].set_sibling(nodes_[id].child());
 1218|     98|    nodes_[child_id].set_label(key_label);
 1219|     98|    nodes_[id].set_child(child_id);
 1220|     98|    node_stack_.push(child_id);
 1221|       |
 1222|     98|    id = child_id;
 1223|     98|  }
 1224|     39|  nodes_[id].set_value(value);
 1225|     39|}
_ZN5Darts7Details11DawgBuilder5clearEv:
 1227|      2|inline void DawgBuilder::clear() {
 1228|      2|  nodes_.clear();
 1229|      2|  units_.clear();
 1230|      2|  labels_.clear();
 1231|      2|  is_intersections_.clear();
 1232|      2|  table_.clear();
 1233|      2|  node_stack_.clear();
 1234|      2|  recycle_bin_.clear();
 1235|      2|  num_states_ = 0;
 1236|      2|}
_ZN5Darts7Details11DawgBuilder5flushEj:
 1238|     39|inline void DawgBuilder::flush(id_type id) {
 1239|     99|  while (node_stack_.top() != id) {
  ------------------
  |  Branch (1239:10): [True: 60, False: 39]
  ------------------
 1240|     60|    id_type node_id = node_stack_.top();
 1241|     60|    node_stack_.pop();
 1242|       |
 1243|     60|    if (num_states_ >= table_.size() - (table_.size() >> 2)) {
  ------------------
  |  Branch (1243:9): [True: 0, False: 60]
  ------------------
 1244|      0|      expand_table();
 1245|      0|    }
 1246|       |
 1247|     60|    id_type num_siblings = 0;
 1248|    158|    for (id_type i = node_id; i != 0; i = nodes_[i].sibling()) {
  ------------------
  |  Branch (1248:31): [True: 98, False: 60]
  ------------------
 1249|     98|      ++num_siblings;
 1250|     98|    }
 1251|       |
 1252|     60|    id_type hash_id;
 1253|     60|    id_type match_id = find_node(node_id, &hash_id);
 1254|     60|    if (match_id != 0) {
  ------------------
  |  Branch (1254:9): [True: 0, False: 60]
  ------------------
 1255|      0|      is_intersections_.set(match_id, true);
 1256|     60|    } else {
 1257|     60|      id_type unit_id = 0;
 1258|    158|      for (id_type i = 0; i < num_siblings; ++i) {
  ------------------
  |  Branch (1258:27): [True: 98, False: 60]
  ------------------
 1259|     98|        unit_id = append_unit();
 1260|     98|      }
 1261|    158|      for (id_type i = node_id; i != 0; i = nodes_[i].sibling()) {
  ------------------
  |  Branch (1261:33): [True: 98, False: 60]
  ------------------
 1262|     98|        units_[unit_id] = nodes_[i].unit();
 1263|     98|        labels_[unit_id] = nodes_[i].label();
 1264|     98|        --unit_id;
 1265|     98|      }
 1266|     60|      match_id = unit_id + 1;
 1267|     60|      table_[hash_id] = match_id;
 1268|     60|      ++num_states_;
 1269|     60|    }
 1270|       |
 1271|    158|    for (id_type i = node_id, next; i != 0; i = next) {
  ------------------
  |  Branch (1271:37): [True: 98, False: 60]
  ------------------
 1272|     98|      next = nodes_[i].sibling();
 1273|     98|      free_node(i);
 1274|     98|    }
 1275|       |
 1276|     60|    nodes_[node_stack_.top()].set_child(match_id);
 1277|     60|  }
 1278|     39|  node_stack_.pop();
 1279|     39|}
_ZNK5Darts7Details11DawgBuilder9find_nodeEjPj:
 1310|     60|    id_type *hash_id) const {
 1311|     60|  *hash_id = hash_node(node_id) % table_.size();
 1312|     62|  for ( ; ; *hash_id = (*hash_id + 1) % table_.size()) {
 1313|     62|    id_type unit_id = table_[*hash_id];
 1314|     62|    if (unit_id == 0) {
  ------------------
  |  Branch (1314:9): [True: 60, False: 2]
  ------------------
 1315|     60|      break;
 1316|     60|    }
 1317|       |
 1318|      2|    if (are_equal(node_id, unit_id)) {
  ------------------
  |  Branch (1318:9): [True: 0, False: 2]
  ------------------
 1319|      0|      return unit_id;
 1320|      0|    }
 1321|      2|  }
 1322|     60|  return 0;
 1323|     60|}
_ZNK5Darts7Details11DawgBuilder9are_equalEjj:
 1325|      2|inline bool DawgBuilder::are_equal(id_type node_id, id_type unit_id) const {
 1326|      2|  for (id_type i = nodes_[node_id].sibling(); i != 0;
  ------------------
  |  Branch (1326:47): [True: 0, False: 2]
  ------------------
 1327|      2|      i = nodes_[i].sibling()) {
 1328|      0|    if (units_[unit_id].has_sibling() == false) {
  ------------------
  |  Branch (1328:9): [True: 0, False: 0]
  ------------------
 1329|      0|      return false;
 1330|      0|    }
 1331|      0|    ++unit_id;
 1332|      0|  }
 1333|      2|  if (units_[unit_id].has_sibling() == true) {
  ------------------
  |  Branch (1333:7): [True: 0, False: 2]
  ------------------
 1334|      0|    return false;
 1335|      0|  }
 1336|       |
 1337|      2|  for (id_type i = node_id; i != 0; i = nodes_[i].sibling(), --unit_id) {
  ------------------
  |  Branch (1337:29): [True: 2, False: 0]
  ------------------
 1338|      2|    if (nodes_[i].unit() != units_[unit_id].unit() ||
  ------------------
  |  Branch (1338:9): [True: 2, False: 0]
  ------------------
 1339|      2|        nodes_[i].label() != labels_[unit_id]) {
  ------------------
  |  Branch (1339:9): [True: 0, False: 0]
  ------------------
 1340|      2|      return false;
 1341|      2|    }
 1342|      2|  }
 1343|      0|  return true;
 1344|      2|}
_ZNK5Darts7Details11DawgBuilder9hash_nodeEj:
 1360|     60|inline id_type DawgBuilder::hash_node(id_type id) const {
 1361|     60|  id_type hash_value = 0;
 1362|    158|  for ( ; id != 0; id = nodes_[id].sibling()) {
  ------------------
  |  Branch (1362:11): [True: 98, False: 60]
  ------------------
 1363|     98|    id_type unit = nodes_[id].unit();
 1364|     98|    uchar_type label = nodes_[id].label();
 1365|     98|    hash_value ^= hash((label << 24) ^ unit);
 1366|     98|  }
 1367|     60|  return hash_value;
 1368|     60|}
_ZN5Darts7Details11DawgBuilder11append_unitEv:
 1370|     99|inline id_type DawgBuilder::append_unit() {
 1371|     99|  is_intersections_.append();
 1372|     99|  units_.append();
 1373|     99|  labels_.append();
 1374|       |
 1375|     99|  return static_cast<id_type>(is_intersections_.size() - 1);
 1376|     99|}
_ZN5Darts7Details11DawgBuilder11append_nodeEv:
 1378|     99|inline id_type DawgBuilder::append_node() {
 1379|     99|  id_type id;
 1380|     99|  if (recycle_bin_.empty()) {
  ------------------
  |  Branch (1380:7): [True: 36, False: 63]
  ------------------
 1381|     36|    id = static_cast<id_type>(nodes_.size());
 1382|     36|    nodes_.append();
 1383|     63|  } else {
 1384|     63|    id = recycle_bin_.top();
 1385|     63|    nodes_[id] = DawgNode();
 1386|     63|    recycle_bin_.pop();
 1387|     63|  }
 1388|     99|  return id;
 1389|     99|}
_ZNK5Darts7Details18DoubleArrayBuilder4copyEPmPPNS0_15DoubleArrayUnitE:
 1566|      1|    DoubleArrayUnit **buf_ptr) const {
 1567|      1|  if (size_ptr != NULL) {
  ------------------
  |  Branch (1567:7): [True: 1, False: 0]
  ------------------
 1568|      1|    *size_ptr = units_.size();
 1569|      1|  }
 1570|      1|  if (buf_ptr != NULL) {
  ------------------
  |  Branch (1570:7): [True: 1, False: 0]
  ------------------
 1571|      1|    *buf_ptr = new DoubleArrayUnit[units_.size()];
 1572|      1|    unit_type *units = reinterpret_cast<unit_type *>(*buf_ptr);
 1573|    257|    for (std::size_t i = 0; i < units_.size(); ++i) {
  ------------------
  |  Branch (1573:29): [True: 256, False: 1]
  ------------------
 1574|    256|      units[i] = units_[i];
 1575|    256|    }
 1576|      1|  }
 1577|      1|}
_ZN5Darts7Details18DoubleArrayBuilder5clearEv:
 1579|      1|inline void DoubleArrayBuilder::clear() {
 1580|      1|  units_.clear();
 1581|      1|  extras_.clear();
 1582|      1|  labels_.clear();
 1583|      1|  table_.clear();
 1584|      1|  extras_head_ = 0;
 1585|      1|}
_ZN5Darts7Details18DoubleArrayBuilder15build_from_dawgERKNS0_11DawgBuilderE:
 1600|      1|inline void DoubleArrayBuilder::build_from_dawg(const DawgBuilder &dawg) {
 1601|      1|  std::size_t num_units = 1;
 1602|      8|  while (num_units < dawg.size()) {
  ------------------
  |  Branch (1602:10): [True: 7, False: 1]
  ------------------
 1603|      7|    num_units <<= 1;
 1604|      7|  }
 1605|      1|  units_.reserve(num_units);
 1606|       |
 1607|      1|  table_.reset(new id_type[dawg.num_intersections()]);
 1608|      1|  for (std::size_t i = 0; i < dawg.num_intersections(); ++i) {
  ------------------
  |  Branch (1608:27): [True: 0, False: 1]
  ------------------
 1609|      0|    table_[i] = 0;
 1610|      0|  }
 1611|       |
 1612|      1|  extras_.reset(new extra_type[NUM_EXTRAS]);
 1613|       |
 1614|      1|  reserve_id(0);
 1615|      1|  extras(0).set_is_used(true);
 1616|      1|  units_[0].set_offset(1);
 1617|      1|  units_[0].set_label('\0');
 1618|       |
 1619|      1|  if (dawg.child(dawg.root()) != 0) {
  ------------------
  |  Branch (1619:7): [True: 1, False: 0]
  ------------------
 1620|      1|    build_from_dawg(dawg, dawg.root(), 0);
 1621|      1|  }
 1622|       |
 1623|      1|  fix_all_blocks();
 1624|       |
 1625|      1|  extras_.clear();
 1626|      1|  labels_.clear();
 1627|      1|  table_.clear();
 1628|      1|}
_ZN5Darts7Details18DoubleArrayBuilder15build_from_dawgERKNS0_11DawgBuilderEjj:
 1631|     60|    id_type dawg_id, id_type dic_id) {
 1632|     60|  id_type dawg_child_id = dawg.child(dawg_id);
 1633|     60|  if (dawg.is_intersection(dawg_child_id)) {
  ------------------
  |  Branch (1633:7): [True: 0, False: 60]
  ------------------
 1634|      0|    id_type intersection_id = dawg.intersection_id(dawg_child_id);
 1635|      0|    id_type offset = table_[intersection_id];
 1636|      0|    if (offset != 0) {
  ------------------
  |  Branch (1636:9): [True: 0, False: 0]
  ------------------
 1637|      0|      offset ^= dic_id;
 1638|      0|      if (!(offset & UPPER_MASK) || !(offset & LOWER_MASK)) {
  ------------------
  |  Branch (1638:11): [True: 0, False: 0]
  |  Branch (1638:37): [True: 0, False: 0]
  ------------------
 1639|      0|        if (dawg.is_leaf(dawg_child_id)) {
  ------------------
  |  Branch (1639:13): [True: 0, False: 0]
  ------------------
 1640|      0|          units_[dic_id].set_has_leaf(true);
 1641|      0|        }
 1642|      0|        units_[dic_id].set_offset(offset);
 1643|      0|        return;
 1644|      0|      }
 1645|      0|    }
 1646|      0|  }
 1647|       |
 1648|     60|  id_type offset = arrange_from_dawg(dawg, dawg_id, dic_id);
 1649|     60|  if (dawg.is_intersection(dawg_child_id)) {
  ------------------
  |  Branch (1649:7): [True: 0, False: 60]
  ------------------
 1650|      0|    table_[dawg.intersection_id(dawg_child_id)] = offset;
 1651|      0|  }
 1652|       |
 1653|     98|  do {
 1654|     98|    uchar_type child_label = dawg.label(dawg_child_id);
 1655|     98|    id_type dic_child_id = offset ^ child_label;
 1656|     98|    if (child_label != '\0') {
  ------------------
  |  Branch (1656:9): [True: 59, False: 39]
  ------------------
 1657|     59|      build_from_dawg(dawg, dawg_child_id, dic_child_id);
 1658|     59|    }
 1659|     98|    dawg_child_id = dawg.sibling(dawg_child_id);
 1660|     98|  } while (dawg_child_id != 0);
  ------------------
  |  Branch (1660:12): [True: 38, False: 60]
  ------------------
 1661|     60|}
_ZN5Darts7Details18DoubleArrayBuilder17arrange_from_dawgERKNS0_11DawgBuilderEjj:
 1664|     60|    id_type dawg_id, id_type dic_id) {
 1665|     60|  labels_.resize(0);
 1666|       |
 1667|     60|  id_type dawg_child_id = dawg.child(dawg_id);
 1668|    158|  while (dawg_child_id != 0) {
  ------------------
  |  Branch (1668:10): [True: 98, False: 60]
  ------------------
 1669|     98|    labels_.append(dawg.label(dawg_child_id));
 1670|     98|    dawg_child_id = dawg.sibling(dawg_child_id);
 1671|     98|  }
 1672|       |
 1673|     60|  id_type offset = find_valid_offset(dic_id);
 1674|     60|  units_[dic_id].set_offset(dic_id ^ offset);
 1675|       |
 1676|     60|  dawg_child_id = dawg.child(dawg_id);
 1677|    158|  for (std::size_t i = 0; i < labels_.size(); ++i) {
  ------------------
  |  Branch (1677:27): [True: 98, False: 60]
  ------------------
 1678|     98|    id_type dic_child_id = offset ^ labels_[i];
 1679|     98|    reserve_id(dic_child_id);
 1680|       |
 1681|     98|    if (dawg.is_leaf(dawg_child_id)) {
  ------------------
  |  Branch (1681:9): [True: 39, False: 59]
  ------------------
 1682|     39|      units_[dic_id].set_has_leaf(true);
 1683|     39|      units_[dic_child_id].set_value(dawg.value(dawg_child_id));
 1684|     59|    } else {
 1685|     59|      units_[dic_child_id].set_label(labels_[i]);
 1686|     59|    }
 1687|       |
 1688|     98|    dawg_child_id = dawg.sibling(dawg_child_id);
 1689|     98|  }
 1690|     60|  extras(offset).set_is_used(true);
 1691|       |
 1692|     60|  return offset;
 1693|     60|}
_ZNK5Darts7Details18DoubleArrayBuilder17find_valid_offsetEj:
 1801|     60|inline id_type DoubleArrayBuilder::find_valid_offset(id_type id) const {
 1802|     60|  if (extras_head_ >= units_.size()) {
  ------------------
  |  Branch (1802:7): [True: 0, False: 60]
  ------------------
 1803|      0|    return units_.size() | (id & LOWER_MASK);
 1804|      0|  }
 1805|       |
 1806|     60|  id_type unfixed_id = extras_head_;
 1807|    130|  do {
 1808|    130|    id_type offset = unfixed_id ^ labels_[0];
 1809|    130|    if (is_valid_offset(id, offset)) {
  ------------------
  |  Branch (1809:9): [True: 60, False: 70]
  ------------------
 1810|     60|      return offset;
 1811|     60|    }
 1812|     70|    unfixed_id = extras(unfixed_id).next();
 1813|     70|  } while (unfixed_id != extras_head_);
  ------------------
  |  Branch (1813:12): [True: 70, False: 0]
  ------------------
 1814|       |
 1815|      0|  return units_.size() | (id & LOWER_MASK);
 1816|     60|}
_ZNK5Darts7Details18DoubleArrayBuilder15is_valid_offsetEjj:
 1819|    130|    id_type offset) const {
 1820|    130|  if (extras(offset).is_used()) {
  ------------------
  |  Branch (1820:7): [True: 64, False: 66]
  ------------------
 1821|     64|    return false;
 1822|     64|  }
 1823|       |
 1824|     66|  id_type rel_offset = id ^ offset;
 1825|     66|  if ((rel_offset & LOWER_MASK) && (rel_offset & UPPER_MASK)) {
  ------------------
  |  Branch (1825:7): [True: 66, False: 0]
  |  Branch (1825:36): [True: 0, False: 66]
  ------------------
 1826|      0|    return false;
 1827|      0|  }
 1828|       |
 1829|    109|  for (std::size_t i = 1; i < labels_.size(); ++i) {
  ------------------
  |  Branch (1829:27): [True: 49, False: 60]
  ------------------
 1830|     49|    if (extras(offset ^ labels_[i]).is_fixed()) {
  ------------------
  |  Branch (1830:9): [True: 6, False: 43]
  ------------------
 1831|      6|      return false;
 1832|      6|    }
 1833|     49|  }
 1834|       |
 1835|     60|  return true;
 1836|     66|}
_ZN5Darts7Details18DoubleArrayBuilder10reserve_idEj:
 1838|    256|inline void DoubleArrayBuilder::reserve_id(id_type id) {
 1839|    256|  if (id >= units_.size()) {
  ------------------
  |  Branch (1839:7): [True: 1, False: 255]
  ------------------
 1840|      1|    expand_units();
 1841|      1|  }
 1842|       |
 1843|    256|  if (id == extras_head_) {
  ------------------
  |  Branch (1843:7): [True: 205, False: 51]
  ------------------
 1844|    205|    extras_head_ = extras(id).next();
 1845|    205|    if (extras_head_ == id) {
  ------------------
  |  Branch (1845:9): [True: 1, False: 204]
  ------------------
 1846|      1|      extras_head_ = units_.size();
 1847|      1|    }
 1848|    205|  }
 1849|    256|  extras(extras(id).prev()).set_next(extras(id).next());
 1850|    256|  extras(extras(id).next()).set_prev(extras(id).prev());
 1851|    256|  extras(id).set_is_fixed(true);
 1852|    256|}
_ZN5Darts7Details18DoubleArrayBuilder12expand_unitsEv:
 1854|      1|inline void DoubleArrayBuilder::expand_units() {
 1855|      1|  id_type src_num_units = units_.size();
 1856|      1|  id_type src_num_blocks = num_blocks();
 1857|       |
 1858|      1|  id_type dest_num_units = src_num_units + BLOCK_SIZE;
 1859|      1|  id_type dest_num_blocks = src_num_blocks + 1;
 1860|       |
 1861|      1|  if (dest_num_blocks > NUM_EXTRA_BLOCKS) {
  ------------------
  |  Branch (1861:7): [True: 0, False: 1]
  ------------------
 1862|      0|    fix_block(src_num_blocks - NUM_EXTRA_BLOCKS);
 1863|      0|  }
 1864|       |
 1865|      1|  units_.resize(dest_num_units);
 1866|       |
 1867|      1|  if (dest_num_blocks > NUM_EXTRA_BLOCKS) {
  ------------------
  |  Branch (1867:7): [True: 0, False: 1]
  ------------------
 1868|      0|    for (std::size_t id = src_num_units; id < dest_num_units; ++id) {
  ------------------
  |  Branch (1868:42): [True: 0, False: 0]
  ------------------
 1869|      0|      extras(id).set_is_used(false);
 1870|      0|      extras(id).set_is_fixed(false);
 1871|      0|    }
 1872|      0|  }
 1873|       |
 1874|    256|  for (id_type i = src_num_units + 1; i < dest_num_units; ++i) {
  ------------------
  |  Branch (1874:39): [True: 255, False: 1]
  ------------------
 1875|    255|    extras(i - 1).set_next(i);
 1876|    255|    extras(i).set_prev(i - 1);
 1877|    255|  }
 1878|       |
 1879|      1|  extras(src_num_units).set_prev(dest_num_units - 1);
 1880|      1|  extras(dest_num_units - 1).set_next(src_num_units);
 1881|       |
 1882|      1|  extras(src_num_units).set_prev(extras(extras_head_).prev());
 1883|      1|  extras(dest_num_units - 1).set_next(extras_head_);
 1884|       |
 1885|      1|  extras(extras(extras_head_).prev()).set_next(src_num_units);
 1886|      1|  extras(extras_head_).set_prev(dest_num_units - 1);
 1887|      1|}
_ZN5Darts7Details18DoubleArrayBuilder14fix_all_blocksEv:
 1889|      1|inline void DoubleArrayBuilder::fix_all_blocks() {
 1890|      1|  id_type begin = 0;
 1891|      1|  if (num_blocks() > NUM_EXTRA_BLOCKS) {
  ------------------
  |  Branch (1891:7): [True: 0, False: 1]
  ------------------
 1892|      0|    begin = num_blocks() - NUM_EXTRA_BLOCKS;
 1893|      0|  }
 1894|      1|  id_type end = num_blocks();
 1895|       |
 1896|      2|  for (id_type block_id = begin; block_id != end; ++block_id) {
  ------------------
  |  Branch (1896:34): [True: 1, False: 1]
  ------------------
 1897|      1|    fix_block(block_id);
 1898|      1|  }
 1899|      1|}
_ZN5Darts7Details18DoubleArrayBuilder9fix_blockEj:
 1901|      1|inline void DoubleArrayBuilder::fix_block(id_type block_id) {
 1902|      1|  id_type begin = block_id * BLOCK_SIZE;
 1903|      1|  id_type end = begin + BLOCK_SIZE;
 1904|       |
 1905|      1|  id_type unused_offset = 0;
 1906|      2|  for (id_type offset = begin; offset != end; ++offset) {
  ------------------
  |  Branch (1906:32): [True: 2, False: 0]
  ------------------
 1907|      2|    if (!extras(offset).is_used()) {
  ------------------
  |  Branch (1907:9): [True: 1, False: 1]
  ------------------
 1908|      1|      unused_offset = offset;
 1909|      1|      break;
 1910|      1|    }
 1911|      2|  }
 1912|       |
 1913|    257|  for (id_type id = begin; id != end; ++id) {
  ------------------
  |  Branch (1913:28): [True: 256, False: 1]
  ------------------
 1914|    256|    if (!extras(id).is_fixed()) {
  ------------------
  |  Branch (1914:9): [True: 157, False: 99]
  ------------------
 1915|    157|      reserve_id(id);
 1916|    157|      units_[id].set_label(static_cast<uchar_type>(id ^ unused_offset));
 1917|    157|    }
 1918|    256|  }
 1919|      1|}
_ZN5Darts7Details9AutoArrayIcE5clearEv:
  608|    136|  void clear() {
  609|    136|    if (array_ != NULL) {
  ------------------
  |  Branch (609:9): [True: 47, False: 89]
  ------------------
  610|     47|      delete[] array_;
  611|       |      array_ = NULL;
  612|     47|    }
  613|    136|  }
_ZNK5Darts7Details8AutoPoolIjEixEm:
  641|    182|  const T &operator[](std::size_t id) const {
  642|    182|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  643|    182|  }
_ZNK5Darts7Details9AutoArrayIcEixEm:
  597|  1.72k|  const T &operator[](std::size_t id) const {
  598|  1.72k|    return array_[id];
  599|  1.72k|  }
_ZN5Darts7Details8AutoPoolIjEixEm:
  644|  2.79k|  T &operator[](std::size_t id) {
  645|  2.79k|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  646|  2.79k|  }
_ZN5Darts7Details9AutoArrayIcEixEm:
  600|  6.14k|  T &operator[](std::size_t id) {
  601|  6.14k|    return array_[id];
  602|  6.14k|  }
_ZNK5Darts7Details8AutoPoolIjE5emptyEv:
  648|     99|  bool empty() const {
  649|     99|    return size_ == 0;
  650|     99|  }
_ZN5Darts7Details8AutoPoolIjE6appendERKj:
  674|    201|  void append(const T &value) {
  675|    201|    if (size_ == capacity_)
  ------------------
  |  Branch (675:9): [True: 15, False: 186]
  ------------------
  676|     15|      resize_buf(size_ + 1);
  677|    201|    new(&(*this)[size_++]) T(value);
  678|    201|  }
_ZN5Darts7Details8AutoPoolIjE10resize_bufEm:
  722|     16|void AutoPool<T>::resize_buf(std::size_t size) {
  723|     16|  std::size_t capacity;
  724|     16|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (724:7): [True: 7, False: 9]
  ------------------
  725|      7|    capacity = size;
  726|      9|  } else {
  727|      9|    capacity = 1;
  728|     40|    while (capacity < size) {
  ------------------
  |  Branch (728:12): [True: 31, False: 9]
  ------------------
  729|     31|      capacity <<= 1;
  730|     31|    }
  731|      9|  }
  732|       |
  733|     16|  AutoArray<char> buf;
  734|     16|  try {
  735|     16|    buf.reset(new char[sizeof(T) * capacity]);
  736|     16|  } catch (const std::bad_alloc &) {
  737|      0|    DARTS_THROW("failed to resize pool: std::bad_alloc");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
  738|      0|  }
  739|       |
  740|     16|  if (size_ > 0) {
  ------------------
  |  Branch (740:7): [True: 12, False: 4]
  ------------------
  741|     12|    T *src = reinterpret_cast<T *>(&buf_[0]);
  742|     12|    T *dest = reinterpret_cast<T *>(&buf[0]);
  743|     93|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (743:29): [True: 81, False: 12]
  ------------------
  744|     81|      new(&dest[i]) T(src[i]);
  745|     81|      src[i].~T();
  746|     81|    }
  747|     12|  }
  748|       |
  749|     16|  buf_.swap(&buf);
  750|     16|  capacity_ = capacity;
  751|     16|}
_ZN5Darts7Details9AutoArrayIcE5resetEPc:
  619|     47|  void reset(T *array = NULL) {
  620|     47|    AutoArray(array).swap(this);
  621|     47|  }
_ZN5Darts7Details9AutoArrayIcE4swapEPS2_:
  614|     94|  void swap(AutoArray *array) {
  615|     94|    T *temp = array_;
  616|     94|    array_ = array->array_;
  617|     94|    array->array_ = temp;
  618|     94|  }
_ZN5Darts7Details8AutoPoolIjE5clearEv:
  655|     18|  void clear() {
  656|     18|    resize(0);
  657|     18|    buf_.clear();
  658|     18|    size_ = 0;
  659|     18|    capacity_ = 0;
  660|     18|  }
_ZN5Darts7Details8AutoPoolIjE6resizeEm:
  680|     18|  void resize(std::size_t size) {
  681|  1.08k|    while (size_ > size) {
  ------------------
  |  Branch (681:12): [True: 1.06k, False: 18]
  ------------------
  682|  1.06k|      (*this)[--size_].~T();
  683|  1.06k|    }
  684|     18|    if (size > capacity_) {
  ------------------
  |  Branch (684:9): [True: 0, False: 18]
  ------------------
  685|      0|      resize_buf(size);
  686|      0|    }
  687|     18|    while (size_ < size) {
  ------------------
  |  Branch (687:12): [True: 0, False: 18]
  ------------------
  688|      0|      new(&(*this)[size_++]) T;
  689|      0|    }
  690|     18|  }
_ZN5Darts7Details9AutoArrayIjE5clearEv:
  608|      9|  void clear() {
  609|      9|    if (array_ != NULL) {
  ------------------
  |  Branch (609:9): [True: 2, False: 7]
  ------------------
  610|      2|      delete[] array_;
  611|       |      array_ = NULL;
  612|      2|    }
  613|      9|  }
_ZN5Darts7Details9AutoArrayIjE5resetEPj:
  619|      2|  void reset(T *array = NULL) {
  620|      2|    AutoArray(array).swap(this);
  621|      2|  }
_ZN5Darts7Details9AutoArrayIjE4swapEPS2_:
  614|      2|  void swap(AutoArray *array) {
  615|      2|    T *temp = array_;
  616|      2|    array_ = array->array_;
  617|      2|    array->array_ = temp;
  618|      2|  }
_ZNK5Darts7Details8AutoPoolIjE4sizeEv:
  651|    470|  std::size_t size() const {
  652|    470|    return size_;
  653|    470|  }
_ZN5Darts7Details9AutoArrayIjEixEm:
  600|      4|  T &operator[](std::size_t id) {
  601|      4|    return array_[id];
  602|      4|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgUnitEEixEm:
  641|    518|  const T &operator[](std::size_t id) const {
  642|    518|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  643|    518|  }
_ZNK5Darts7Details8AutoPoolIhEixEm:
  641|    473|  const T &operator[](std::size_t id) const {
  642|    473|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  643|    473|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgUnitEE4sizeEv:
  651|      8|  std::size_t size() const {
  652|      8|    return size_;
  653|      8|  }
_ZN5Darts7Details9AutoStackIjE4pushERKj:
  779|    197|  void push(const T &value) {
  780|    197|    pool_.push_back(value);
  781|    197|  }
_ZN5Darts7Details8AutoPoolIjE9push_backERKj:
  662|    197|  void push_back(const T &value) {
  663|    197|    append(value);
  664|    197|  }
_ZN5Darts7Details8AutoPoolIjE6resizeEmRKj:
  691|      1|  void resize(std::size_t size, const T &value) {
  692|      1|    while (size_ > size) {
  ------------------
  |  Branch (692:12): [True: 0, False: 1]
  ------------------
  693|      0|      (*this)[--size_].~T();
  694|      0|    }
  695|      1|    if (size > capacity_) {
  ------------------
  |  Branch (695:9): [True: 1, False: 0]
  ------------------
  696|      1|      resize_buf(size);
  697|      1|    }
  698|  1.02k|    while (size_ < size) {
  ------------------
  |  Branch (698:12): [True: 1.02k, False: 1]
  ------------------
  699|  1.02k|      new(&(*this)[size_++]) T(value);
  700|  1.02k|    }
  701|      1|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEEixEm:
  644|  1.46k|  T &operator[](std::size_t id) {
  645|  1.46k|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  646|  1.46k|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEEixEm:
  644|    297|  T &operator[](std::size_t id) {
  645|    297|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  646|    297|  }
_ZN5Darts7Details8AutoPoolIhEixEm:
  644|    650|  T &operator[](std::size_t id) {
  645|    650|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  646|    650|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE5clearEv:
  655|      4|  void clear() {
  656|      4|    resize(0);
  657|      4|    buf_.clear();
  658|      4|    size_ = 0;
  659|      4|    capacity_ = 0;
  660|      4|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE6resizeEm:
  680|      4|  void resize(std::size_t size) {
  681|     40|    while (size_ > size) {
  ------------------
  |  Branch (681:12): [True: 36, False: 4]
  ------------------
  682|     36|      (*this)[--size_].~T();
  683|     36|    }
  684|      4|    if (size > capacity_) {
  ------------------
  |  Branch (684:9): [True: 0, False: 4]
  ------------------
  685|      0|      resize_buf(size);
  686|      0|    }
  687|      4|    while (size_ < size) {
  ------------------
  |  Branch (687:12): [True: 0, False: 4]
  ------------------
  688|      0|      new(&(*this)[size_++]) T;
  689|      0|    }
  690|      4|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE10resize_bufEm:
  722|      7|void AutoPool<T>::resize_buf(std::size_t size) {
  723|      7|  std::size_t capacity;
  724|      7|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (724:7): [True: 2, False: 5]
  ------------------
  725|      2|    capacity = size;
  726|      5|  } else {
  727|      5|    capacity = 1;
  728|     25|    while (capacity < size) {
  ------------------
  |  Branch (728:12): [True: 20, False: 5]
  ------------------
  729|     20|      capacity <<= 1;
  730|     20|    }
  731|      5|  }
  732|       |
  733|      7|  AutoArray<char> buf;
  734|      7|  try {
  735|      7|    buf.reset(new char[sizeof(T) * capacity]);
  736|      7|  } catch (const std::bad_alloc &) {
  737|      0|    DARTS_THROW("failed to resize pool: std::bad_alloc");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
  738|      0|  }
  739|       |
  740|      7|  if (size_ > 0) {
  ------------------
  |  Branch (740:7): [True: 6, False: 1]
  ------------------
  741|      6|    T *src = reinterpret_cast<T *>(&buf_[0]);
  742|      6|    T *dest = reinterpret_cast<T *>(&buf[0]);
  743|     69|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (743:29): [True: 63, False: 6]
  ------------------
  744|     63|      new(&dest[i]) T(src[i]);
  745|     63|      src[i].~T();
  746|     63|    }
  747|      6|  }
  748|       |
  749|      7|  buf_.swap(&buf);
  750|      7|  capacity_ = capacity;
  751|      7|}
_ZN5Darts7Details9AutoStackIjE5clearEv:
  786|      8|  void clear() {
  787|      8|    pool_.clear();
  788|      8|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE5clearEv:
  655|      3|  void clear() {
  656|      3|    resize(0);
  657|      3|    buf_.clear();
  658|      3|    size_ = 0;
  659|      3|    capacity_ = 0;
  660|      3|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE6resizeEm:
  680|      3|  void resize(std::size_t size) {
  681|    102|    while (size_ > size) {
  ------------------
  |  Branch (681:12): [True: 99, False: 3]
  ------------------
  682|     99|      (*this)[--size_].~T();
  683|     99|    }
  684|      3|    if (size > capacity_) {
  ------------------
  |  Branch (684:9): [True: 0, False: 3]
  ------------------
  685|      0|      resize_buf(size);
  686|      0|    }
  687|      3|    while (size_ < size) {
  ------------------
  |  Branch (687:12): [True: 0, False: 3]
  ------------------
  688|      0|      new(&(*this)[size_++]) T;
  689|      0|    }
  690|      3|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE10resize_bufEm:
  722|      8|void AutoPool<T>::resize_buf(std::size_t size) {
  723|      8|  std::size_t capacity;
  724|      8|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (724:7): [True: 2, False: 6]
  ------------------
  725|      2|    capacity = size;
  726|      6|  } else {
  727|      6|    capacity = 1;
  728|     33|    while (capacity < size) {
  ------------------
  |  Branch (728:12): [True: 27, False: 6]
  ------------------
  729|     27|      capacity <<= 1;
  730|     27|    }
  731|      6|  }
  732|       |
  733|      8|  AutoArray<char> buf;
  734|      8|  try {
  735|      8|    buf.reset(new char[sizeof(T) * capacity]);
  736|      8|  } catch (const std::bad_alloc &) {
  737|      0|    DARTS_THROW("failed to resize pool: std::bad_alloc");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
  738|      0|  }
  739|       |
  740|      8|  if (size_ > 0) {
  ------------------
  |  Branch (740:7): [True: 7, False: 1]
  ------------------
  741|      7|    T *src = reinterpret_cast<T *>(&buf_[0]);
  742|      7|    T *dest = reinterpret_cast<T *>(&buf[0]);
  743|    134|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (743:29): [True: 127, False: 7]
  ------------------
  744|    127|      new(&dest[i]) T(src[i]);
  745|    127|      src[i].~T();
  746|    127|    }
  747|      7|  }
  748|       |
  749|      8|  buf_.swap(&buf);
  750|      8|  capacity_ = capacity;
  751|      8|}
_ZN5Darts7Details8AutoPoolIhE5clearEv:
  655|      6|  void clear() {
  656|      6|    resize(0);
  657|      6|    buf_.clear();
  658|      6|    size_ = 0;
  659|      6|    capacity_ = 0;
  660|      6|  }
_ZN5Darts7Details9AutoStackIjE3topEv:
  768|    282|  T &top() {
  769|    282|    return pool_[size() - 1];
  770|    282|  }
_ZNK5Darts7Details9AutoStackIjE4sizeEv:
  775|    282|  std::size_t size() const {
  776|    282|    return pool_.size();
  777|    282|  }
_ZN5Darts7Details9AutoStackIjE3popEv:
  782|    162|  void pop() {
  783|    162|    pool_.pop_back();
  784|    162|  }
_ZN5Darts7Details8AutoPoolIjE8pop_backEv:
  665|    162|  void pop_back() {
  666|    162|    (*this)[--size_].~T();
  667|    162|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgNodeEEixEm:
  641|    298|  const T &operator[](std::size_t id) const {
  642|    298|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  643|    298|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE6appendEv:
  669|     99|  void append() {
  670|     99|    if (size_ == capacity_)
  ------------------
  |  Branch (670:9): [True: 8, False: 91]
  ------------------
  671|      8|      resize_buf(size_ + 1);
  672|     99|    new(&(*this)[size_++]) T;
  673|     99|  }
_ZN5Darts7Details8AutoPoolIhE6appendEv:
  669|     99|  void append() {
  670|     99|    if (size_ == capacity_)
  ------------------
  |  Branch (670:9): [True: 8, False: 91]
  ------------------
  671|      8|      resize_buf(size_ + 1);
  672|     99|    new(&(*this)[size_++]) T;
  673|     99|  }
_ZN5Darts7Details8AutoPoolIhE10resize_bufEm:
  722|     14|void AutoPool<T>::resize_buf(std::size_t size) {
  723|     14|  std::size_t capacity;
  724|     14|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (724:7): [True: 4, False: 10]
  ------------------
  725|      4|    capacity = size;
  726|     10|  } else {
  727|     10|    capacity = 1;
  728|     51|    while (capacity < size) {
  ------------------
  |  Branch (728:12): [True: 41, False: 10]
  ------------------
  729|     41|      capacity <<= 1;
  730|     41|    }
  731|     10|  }
  732|       |
  733|     14|  AutoArray<char> buf;
  734|     14|  try {
  735|     14|    buf.reset(new char[sizeof(T) * capacity]);
  736|     14|  } catch (const std::bad_alloc &) {
  737|      0|    DARTS_THROW("failed to resize pool: std::bad_alloc");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
  738|      0|  }
  739|       |
  740|     14|  if (size_ > 0) {
  ------------------
  |  Branch (740:7): [True: 12, False: 2]
  ------------------
  741|     12|    T *src = reinterpret_cast<T *>(&buf_[0]);
  742|     12|    T *dest = reinterpret_cast<T *>(&buf[0]);
  743|    170|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (743:29): [True: 158, False: 12]
  ------------------
  744|    158|      new(&dest[i]) T(src[i]);
  745|    158|      src[i].~T();
  746|    158|    }
  747|     12|  }
  748|       |
  749|     14|  buf_.swap(&buf);
  750|     14|  capacity_ = capacity;
  751|     14|}
_ZNK5Darts7Details9AutoStackIjE5emptyEv:
  772|     99|  bool empty() const {
  773|     99|    return pool_.empty();
  774|     99|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgNodeEE4sizeEv:
  651|     36|  std::size_t size() const {
  652|     36|    return size_;
  653|     36|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE6appendEv:
  669|     36|  void append() {
  670|     36|    if (size_ == capacity_)
  ------------------
  |  Branch (670:9): [True: 7, False: 29]
  ------------------
  671|      7|      resize_buf(size_ + 1);
  672|     36|    new(&(*this)[size_++]) T;
  673|     36|  }
_ZNK5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE4sizeEv:
  651|    580|  std::size_t size() const {
  652|    580|    return size_;
  653|    580|  }
_ZNK5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEEixEm:
  597|    249|  const T &operator[](std::size_t id) const {
  598|    249|    return array_[id];
  599|    249|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEEixEm:
  600|  2.83k|  T &operator[](std::size_t id) {
  601|  2.83k|    return array_[id];
  602|  2.83k|  }
_ZNK5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEEixEm:
  641|    256|  const T &operator[](std::size_t id) const {
  642|    256|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  643|    256|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE5clearEv:
  655|      2|  void clear() {
  656|      2|    resize(0);
  657|      2|    buf_.clear();
  658|      2|    size_ = 0;
  659|      2|    capacity_ = 0;
  660|      2|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEE5clearEv:
  608|      4|  void clear() {
  609|      4|    if (array_ != NULL) {
  ------------------
  |  Branch (609:9): [True: 1, False: 3]
  ------------------
  610|      1|      delete[] array_;
  611|       |      array_ = NULL;
  612|      1|    }
  613|      4|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE7reserveEm:
  703|      1|  void reserve(std::size_t size) {
  704|      1|    if (size > capacity_) {
  ------------------
  |  Branch (704:9): [True: 1, False: 0]
  ------------------
  705|      1|      resize_buf(size);
  706|      1|    }
  707|      1|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE10resize_bufEm:
  722|      2|void AutoPool<T>::resize_buf(std::size_t size) {
  723|      2|  std::size_t capacity;
  724|      2|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (724:7): [True: 2, False: 0]
  ------------------
  725|      2|    capacity = size;
  726|      2|  } else {
  727|      0|    capacity = 1;
  728|      0|    while (capacity < size) {
  ------------------
  |  Branch (728:12): [True: 0, False: 0]
  ------------------
  729|      0|      capacity <<= 1;
  730|      0|    }
  731|      0|  }
  732|       |
  733|      2|  AutoArray<char> buf;
  734|      2|  try {
  735|      2|    buf.reset(new char[sizeof(T) * capacity]);
  736|      2|  } catch (const std::bad_alloc &) {
  737|      0|    DARTS_THROW("failed to resize pool: std::bad_alloc");
  ------------------
  |  |   19|      0|#define DARTS_THROW(msg) throw Darts::Details::Exception( \
  |  |   20|       |  __FILE__ ":" DARTS_LINE_STR ": exception: " msg)
  ------------------
  738|      0|  }
  739|       |
  740|      2|  if (size_ > 0) {
  ------------------
  |  Branch (740:7): [True: 0, False: 2]
  ------------------
  741|      0|    T *src = reinterpret_cast<T *>(&buf_[0]);
  742|      0|    T *dest = reinterpret_cast<T *>(&buf[0]);
  743|      0|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (743:29): [True: 0, False: 0]
  ------------------
  744|      0|      new(&dest[i]) T(src[i]);
  745|      0|      src[i].~T();
  746|      0|    }
  747|      0|  }
  748|       |
  749|      2|  buf_.swap(&buf);
  750|      2|  capacity_ = capacity;
  751|      2|}
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEE5resetEPS2_:
  619|      1|  void reset(T *array = NULL) {
  620|      1|    AutoArray(array).swap(this);
  621|      1|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEE4swapEPS3_:
  614|      1|  void swap(AutoArray *array) {
  615|      1|    T *temp = array_;
  616|      1|    array_ = array->array_;
  617|      1|    array->array_ = temp;
  618|      1|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEEixEm:
  644|    868|  T &operator[](std::size_t id) {
  645|    868|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  646|    868|  }
_ZN5Darts7Details8AutoPoolIhE6resizeEm:
  680|     66|  void resize(std::size_t size) {
  681|    263|    while (size_ > size) {
  ------------------
  |  Branch (681:12): [True: 197, False: 66]
  ------------------
  682|    197|      (*this)[--size_].~T();
  683|    197|    }
  684|     66|    if (size > capacity_) {
  ------------------
  |  Branch (684:9): [True: 0, False: 66]
  ------------------
  685|      0|      resize_buf(size);
  686|      0|    }
  687|     66|    while (size_ < size) {
  ------------------
  |  Branch (687:12): [True: 0, False: 66]
  ------------------
  688|      0|      new(&(*this)[size_++]) T;
  689|      0|    }
  690|     66|  }
_ZN5Darts7Details8AutoPoolIhE6appendERKh:
  674|     98|  void append(const T &value) {
  675|     98|    if (size_ == capacity_)
  ------------------
  |  Branch (675:9): [True: 6, False: 92]
  ------------------
  676|      6|      resize_buf(size_ + 1);
  677|     98|    new(&(*this)[size_++]) T(value);
  678|     98|  }
_ZNK5Darts7Details8AutoPoolIhE4sizeEv:
  651|    267|  std::size_t size() const {
  652|    267|    return size_;
  653|    267|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE6resizeEm:
  680|      3|  void resize(std::size_t size) {
  681|    259|    while (size_ > size) {
  ------------------
  |  Branch (681:12): [True: 256, False: 3]
  ------------------
  682|    256|      (*this)[--size_].~T();
  683|    256|    }
  684|      3|    if (size > capacity_) {
  ------------------
  |  Branch (684:9): [True: 1, False: 2]
  ------------------
  685|      1|      resize_buf(size);
  686|      1|    }
  687|    259|    while (size_ < size) {
  ------------------
  |  Branch (687:12): [True: 256, False: 3]
  ------------------
  688|    256|      new(&(*this)[size_++]) T;
  689|    256|    }
  690|      3|  }
_ZN5Darts15DoubleArrayImplIvvivE5clearEv:
  194|      1|  void clear() {
  195|      1|    size_ = 0;
  196|      1|    array_ = NULL;
  197|      1|    if (buf_ != NULL) {
  ------------------
  |  Branch (197:9): [True: 0, False: 1]
  ------------------
  198|      0|      delete[] buf_;
  199|       |      buf_ = NULL;
  200|      0|    }
  201|      1|  }
_ZN5Darts15DoubleArrayImplIvvivEC2Ev:
  139|      1|  DoubleArrayImpl() : size_(0), array_(NULL), buf_(NULL) {}
_ZNK5Darts15DoubleArrayImplIvvivE18commonPrefixSearchINS1_16result_pair_typeEEEmPKcPT_mmm:
  505|     39|    std::size_t length, std::size_t node_pos) const {
  506|     39|  std::size_t num_results = 0;
  507|       |
  508|     39|  unit_type unit = array_[node_pos];
  509|     39|  node_pos ^= unit.offset();
  510|     39|  if (length != 0) {
  ------------------
  |  Branch (510:7): [True: 39, False: 0]
  ------------------
  511|    132|    for (std::size_t i = 0; i < length; ++i) {
  ------------------
  |  Branch (511:29): [True: 93, False: 39]
  ------------------
  512|     93|      node_pos ^= static_cast<uchar_type>(key[i]);
  513|     93|      unit = array_[node_pos];
  514|     93|      if (unit.label() != static_cast<uchar_type>(key[i])) {
  ------------------
  |  Branch (514:11): [True: 0, False: 93]
  ------------------
  515|      0|        return num_results;
  516|      0|      }
  517|       |
  518|     93|      node_pos ^= unit.offset();
  519|     93|      if (unit.has_leaf()) {
  ------------------
  |  Branch (519:11): [True: 58, False: 35]
  ------------------
  520|     58|        if (num_results < max_num_results) {
  ------------------
  |  Branch (520:13): [True: 58, False: 0]
  ------------------
  521|     58|          set_result(&results[num_results], static_cast<value_type>(
  522|     58|              array_[node_pos].value()), i + 1);
  523|     58|        }
  524|     58|        ++num_results;
  525|     58|      }
  526|     93|    }
  527|     39|  } else {
  528|      0|    for ( ; key[length] != '\0'; ++length) {
  ------------------
  |  Branch (528:13): [True: 0, False: 0]
  ------------------
  529|      0|      node_pos ^= static_cast<uchar_type>(key[length]);
  530|      0|      unit = array_[node_pos];
  531|      0|      if (unit.label() != static_cast<uchar_type>(key[length])) {
  ------------------
  |  Branch (531:11): [True: 0, False: 0]
  ------------------
  532|      0|        return num_results;
  533|      0|      }
  534|       |
  535|      0|      node_pos ^= unit.offset();
  536|      0|      if (unit.has_leaf()) {
  ------------------
  |  Branch (536:11): [True: 0, False: 0]
  ------------------
  537|      0|        if (num_results < max_num_results) {
  ------------------
  |  Branch (537:13): [True: 0, False: 0]
  ------------------
  538|      0|          set_result(&results[num_results], static_cast<value_type>(
  539|      0|              array_[node_pos].value()), length + 1);
  540|      0|        }
  541|      0|        ++num_results;
  542|      0|      }
  543|      0|    }
  544|      0|  }
  545|       |
  546|     39|  return num_results;
  547|     39|}
_ZNK5Darts15DoubleArrayImplIvvivE10set_resultEPNS1_16result_pair_typeEim:
  160|     58|      value_type value, std::size_t length) const {
  161|     58|    result->value = value;
  162|     58|    result->length = length;
  163|     58|  }
_ZN5Darts15DoubleArrayImplIvvivE5buildEmPKPKcPKmPKiPFimmE:
 1930|      1|    const value_type *values, Details::progress_func_type progress_func) {
 1931|      1|  Details::Keyset<value_type> keyset(num_keys, keys, lengths, values);
 1932|       |
 1933|      1|  Details::DoubleArrayBuilder builder(progress_func);
 1934|      1|  builder.build(keyset);
 1935|       |
 1936|      1|  std::size_t size = 0;
 1937|      1|  unit_type *buf = NULL;
 1938|      1|  builder.copy(&size, &buf);
 1939|       |
 1940|      1|  clear();
 1941|       |
 1942|      1|  size_ = size;
 1943|      1|  array_ = buf;
 1944|      1|  buf_ = buf;
 1945|       |
 1946|      1|  if (progress_func != NULL) {
  ------------------
  |  Branch (1946:7): [True: 0, False: 1]
  ------------------
 1947|      0|    progress_func(num_keys + 1, num_keys + 1);
 1948|      0|  }
 1949|       |
 1950|      1|  return 0;
 1951|      1|}
_ZN5Darts7Details6KeysetIiEC2EmPKPKcPKmPKi:
  895|      1|      num_keys_(num_keys), keys_(keys), lengths_(lengths), values_(values) {}
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEEC2Ev:
  638|      1|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details9AutoArrayIcEC2EPc:
  592|    103|  explicit AutoArray(T *array = NULL) : array_(array) {}
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEEC2EPS2_:
  592|      2|  explicit AutoArray(T *array = NULL) : array_(array) {}
_ZN5Darts7Details8AutoPoolIhEC2Ev:
  638|      2|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details9AutoArrayIjEC2EPj:
  592|      4|  explicit AutoArray(T *array = NULL) : array_(array) {}
_ZN5Darts7Details8AutoPoolIhED2Ev:
  639|      2|  ~AutoPool() { clear(); }
_ZN5Darts7Details9AutoArrayIcED2Ev:
  593|    103|  ~AutoArray() {
  594|    103|    clear();
  595|    103|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEED2Ev:
  593|      2|  ~AutoArray() {
  594|      2|    clear();
  595|      2|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEED2Ev:
  639|      1|  ~AutoPool() { clear(); }
_ZN5Darts7Details18DoubleArrayBuilder5buildIiEEvRKNS0_6KeysetIT_EE:
 1554|      1|void DoubleArrayBuilder::build(const Keyset<T> &keyset) {
 1555|      1|  if (keyset.has_values()) {
  ------------------
  |  Branch (1555:7): [True: 1, False: 0]
  ------------------
 1556|      1|    Details::DawgBuilder dawg_builder;
 1557|      1|    build_dawg(keyset, &dawg_builder);
 1558|      1|    build_from_dawg(dawg_builder);
 1559|      1|    dawg_builder.clear();
 1560|      1|  } else {
 1561|      0|    build_from_keyset(keyset);
 1562|      0|  }
 1563|      1|}
_ZNK5Darts7Details6KeysetIiE10has_valuesEv:
  923|     40|  bool has_values() const {
  924|       |    return values_ != NULL;
  925|     40|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEEC2Ev:
  638|      1|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEEC2Ev:
  638|      1|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details8AutoPoolIjEC2Ev:
  638|      4|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details9AutoStackIjEC2Ev:
  760|      2|  AutoStack() : pool_() {}
_ZN5Darts7Details9AutoStackIjED2Ev:
  761|      2|  ~AutoStack() {
  762|      2|    clear();
  763|      2|  }
_ZN5Darts7Details8AutoPoolIjED2Ev:
  639|      4|  ~AutoPool() { clear(); }
_ZN5Darts7Details9AutoArrayIjED2Ev:
  593|      4|  ~AutoArray() {
  594|      4|    clear();
  595|      4|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEED2Ev:
  639|      1|  ~AutoPool() { clear(); }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEED2Ev:
  639|      1|  ~AutoPool() { clear(); }
_ZN5Darts7Details18DoubleArrayBuilder10build_dawgIiEEvRKNS0_6KeysetIT_EEPNS0_11DawgBuilderE:
 1589|      1|    DawgBuilder *dawg_builder) {
 1590|      1|  dawg_builder->init();
 1591|     40|  for (std::size_t i = 0; i < keyset.num_keys(); ++i) {
  ------------------
  |  Branch (1591:27): [True: 39, False: 1]
  ------------------
 1592|     39|    dawg_builder->insert(keyset.keys(i), keyset.lengths(i), keyset.values(i));
 1593|     39|    if (progress_func_ != NULL) {
  ------------------
  |  Branch (1593:9): [True: 0, False: 39]
  ------------------
 1594|      0|      progress_func_(i + 1, keyset.num_keys() + 1);
 1595|      0|    }
 1596|     39|  }
 1597|      1|  dawg_builder->finish();
 1598|      1|}
_ZNK5Darts7Details6KeysetIiE8num_keysEv:
  897|     40|  std::size_t num_keys() const {
  898|     40|    return num_keys_;
  899|     40|  }
_ZNK5Darts7Details6KeysetIiE4keysEm:
  900|     39|  const char_type *keys(std::size_t id) const {
  901|     39|    return keys_[id];
  902|     39|  }
_ZNK5Darts7Details6KeysetIiE7lengthsEm:
  912|     39|  std::size_t lengths(std::size_t id) const {
  913|     39|    if (has_lengths()) {
  ------------------
  |  Branch (913:9): [True: 39, False: 0]
  ------------------
  914|     39|      return lengths_[id];
  915|     39|    }
  916|      0|    std::size_t length = 0;
  917|      0|    while (keys_[id][length] != '\0') {
  ------------------
  |  Branch (917:12): [True: 0, False: 0]
  ------------------
  918|      0|      ++length;
  919|      0|    }
  920|      0|    return length;
  921|     39|  }
_ZNK5Darts7Details6KeysetIiE11has_lengthsEv:
  909|     39|  bool has_lengths() const {
  910|       |    return lengths_ != NULL;
  911|     39|  }
_ZNK5Darts7Details6KeysetIiE6valuesEm:
  926|     39|  const value_type values(std::size_t id) const {
  927|     39|    if (has_values()) {
  ------------------
  |  Branch (927:9): [True: 39, False: 0]
  ------------------
  928|     39|      return static_cast<value_type>(values_[id]);
  929|     39|    }
  930|      0|    return static_cast<value_type>(id);
  931|     39|  }
_ZNK5Darts15DoubleArrayImplIvvivE16exactMatchSearchIiEEvPKcRT_mm:
  273|      1|      std::size_t length = 0, std::size_t node_pos = 0) const {
  274|      1|    result = exactMatchSearch<U>(key, length, node_pos);
  275|      1|  }
_ZNK5Darts15DoubleArrayImplIvvivE16exactMatchSearchIiEET_PKcmm:
  470|      1|    std::size_t length, std::size_t node_pos) const {
  471|      1|  U result;
  472|      1|  set_result(&result, static_cast<value_type>(-1), 0);
  473|       |
  474|      1|  unit_type unit = array_[node_pos];
  475|      1|  if (length != 0) {
  ------------------
  |  Branch (475:7): [True: 1, False: 0]
  ------------------
  476|      1|    for (std::size_t i = 0; i < length; ++i) {
  ------------------
  |  Branch (476:29): [True: 1, False: 0]
  ------------------
  477|      1|      node_pos ^= unit.offset() ^ static_cast<uchar_type>(key[i]);
  478|      1|      unit = array_[node_pos];
  479|      1|      if (unit.label() != static_cast<uchar_type>(key[i])) {
  ------------------
  |  Branch (479:11): [True: 1, False: 0]
  ------------------
  480|      1|        return result;
  481|      1|      }
  482|      1|    }
  483|      1|  } else {
  484|      0|    for ( ; key[length] != '\0'; ++length) {
  ------------------
  |  Branch (484:13): [True: 0, False: 0]
  ------------------
  485|      0|      node_pos ^= unit.offset() ^ static_cast<uchar_type>(key[length]);
  486|      0|      unit = array_[node_pos];
  487|      0|      if (unit.label() != static_cast<uchar_type>(key[length])) {
  ------------------
  |  Branch (487:11): [True: 0, False: 0]
  ------------------
  488|      0|        return result;
  489|      0|      }
  490|      0|    }
  491|      0|  }
  492|       |
  493|      0|  if (!unit.has_leaf()) {
  ------------------
  |  Branch (493:7): [True: 0, False: 0]
  ------------------
  494|      0|    return result;
  495|      0|  }
  496|      0|  unit = array_[node_pos ^ unit.offset()];
  497|      0|  set_result(&result, static_cast<value_type>(unit.value()), length);
  498|      0|  return result;
  499|      0|}
_ZNK5Darts15DoubleArrayImplIvvivE10set_resultEPiim:
  155|      1|  void set_result(value_type *result, value_type value, std::size_t) const {
  156|      1|    *result = value;
  157|      1|  }

_ZNK6google8protobuf8internal10LazyString4InitEv:
   50|      4|const std::string& LazyString::Init() const {
   51|      4|  static WrappedMutex mu{GOOGLE_PROTOBUF_LINKER_INITIALIZED};
   52|      4|  mu.Lock();
   53|      4|  const std::string* res = inited_.load(std::memory_order_acquire);
   54|      4|  if (res == nullptr) {
  ------------------
  |  Branch (54:7): [True: 4, False: 0]
  ------------------
   55|      4|    auto init_value = init_value_;
   56|      4|    res = ::new (static_cast<void*>(string_buf_))
   57|      4|        std::string(init_value.ptr, init_value.size);
   58|      4|    inited_.store(res, std::memory_order_release);
   59|      4|  }
   60|      4|  mu.Unlock();
   61|      4|  return *res;
   62|      4|}
_ZN6google8protobuf8internal14ArenaStringPtr7MutableENS2_12EmptyDefaultEPNS0_5ArenaE:
  112|    298|std::string* ArenaStringPtr::Mutable(EmptyDefault, ::google::protobuf::Arena* arena) {
  113|    298|  if (!IsDonatedString() && !IsDefault(&GetEmptyStringAlreadyInited())) {
  ------------------
  |  Branch (113:7): [True: 298, False: 0]
  |  Branch (113:29): [True: 0, False: 298]
  ------------------
  114|      0|    return UnsafeMutablePointer();
  115|    298|  } else {
  116|    298|    return MutableSlow(arena);
  117|    298|  }
  118|    298|}
_ZN6google8protobuf8internal14ArenaStringPtr11MutableSlowIJEEEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEPNS0_5ArenaEDpRKT_:
  144|    298|                                         const Lazy&... lazy_default) {
  145|    298|  const std::string* const default_value =
  146|    298|      sizeof...(Lazy) == 0 ? &GetEmptyStringAlreadyInited() : nullptr;
  ------------------
  |  Branch (146:7): [True: 298, Folded]
  ------------------
  147|    298|  GOOGLE_DCHECK(IsDefault(default_value));
  ------------------
  |  |  181|    298|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 298]
  |  |  ------------------
  ------------------
  148|    298|  std::string* new_string =
  149|    298|      Arena::Create<std::string>(arena, lazy_default.get()...);
  150|    298|  tagged_ptr_.Set(new_string);
  151|    298|  return new_string;
  152|    298|}

_ZN6google8protobuf8internal13VerifyVersionEiiPKc:
   73|      6|                   const char* filename) {
   74|      6|  if (GOOGLE_PROTOBUF_VERSION < minLibraryVersion) {
  ------------------
  |  |   85|      6|#define GOOGLE_PROTOBUF_VERSION 3014000
  ------------------
  |  Branch (74:7): [True: 0, False: 6]
  ------------------
   75|       |    // Library is too old for headers.
   76|      0|    GOOGLE_LOG(FATAL)
  ------------------
  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  ------------------
   77|      0|      << "This program requires version " << VersionString(minLibraryVersion)
   78|      0|      << " of the Protocol Buffer runtime library, but the installed version "
   79|      0|         "is " << VersionString(GOOGLE_PROTOBUF_VERSION) << ".  Please update "
  ------------------
  |  |   85|      0|#define GOOGLE_PROTOBUF_VERSION 3014000
  ------------------
   80|      0|         "your library.  If you compiled the program yourself, make sure that "
   81|      0|         "your headers are from the same version of Protocol Buffers as your "
   82|      0|         "link-time library.  (Version verification failed in \""
   83|      0|      << filename << "\".)";
   84|      0|  }
   85|      6|  if (headerVersion < kMinHeaderVersionForLibrary) {
  ------------------
  |  Branch (85:7): [True: 0, False: 6]
  ------------------
   86|       |    // Headers are too old for library.
   87|      0|    GOOGLE_LOG(FATAL)
  ------------------
  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  ------------------
   88|      0|      << "This program was compiled against version "
   89|      0|      << VersionString(headerVersion) << " of the Protocol Buffer runtime "
   90|      0|         "library, which is not compatible with the installed version ("
   91|      0|      << VersionString(GOOGLE_PROTOBUF_VERSION) <<  ").  Contact the program "
  ------------------
  |  |   85|      0|#define GOOGLE_PROTOBUF_VERSION 3014000
  ------------------
   92|      0|         "author for an update.  If you compiled the program yourself, make "
   93|      0|         "sure that your headers are from the same version of Protocol Buffers "
   94|      0|         "as your link-time library.  (Version verification failed in \""
   95|      0|      << filename << "\".)";
   96|      0|  }
   97|      6|}

_ZN6google8protobuf8internal12ExtensionSetC2EPNS0_5ArenaE:
  188|    306|    : arena_(arena),
  189|    306|      flat_capacity_(0),
  190|    306|      flat_size_(0),
  191|    306|      map_{flat_capacity_ == 0
  ------------------
  |  Branch (191:12): [True: 306, False: 0]
  ------------------
  192|    306|               ? NULL
  193|    306|               : Arena::CreateArray<KeyValue>(arena_, flat_capacity_)} {}
_ZN6google8protobuf8internal12ExtensionSet5ClearEv:
  877|      1|void ExtensionSet::Clear() {
  878|      1|  ForEach([](int /* number */, Extension& ext) { ext.Clear(); });
  879|      1|}
_ZNK6google8protobuf8internal12ExtensionSet13IsInitializedEv:
 1127|    301|bool ExtensionSet::IsInitialized() const {
 1128|       |  // Extensions are never required.  However, we need to check that all
 1129|       |  // embedded messages are initialized.
 1130|    301|  if (PROTOBUF_PREDICT_FALSE(is_large())) {
  ------------------
  |  |  247|    301|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 301]
  |  |  ------------------
  ------------------
 1131|      0|    for (const auto& kv : *map_.large) {
  ------------------
  |  Branch (1131:25): [True: 0, False: 0]
  ------------------
 1132|      0|      if (!kv.second.IsInitialized()) return false;
  ------------------
  |  Branch (1132:11): [True: 0, False: 0]
  ------------------
 1133|      0|    }
 1134|      0|    return true;
 1135|      0|  }
 1136|    301|  for (const KeyValue* it = flat_begin(); it != flat_end(); ++it) {
  ------------------
  |  Branch (1136:43): [True: 0, False: 301]
  ------------------
 1137|      0|    if (!it->second.IsInitialized()) return false;
  ------------------
  |  Branch (1137:9): [True: 0, False: 0]
  ------------------
 1138|      0|  }
 1139|    301|  return true;
 1140|    301|}

_ZN6google8protobuf8internal24InitProtobufDefaultsSlowEv:
   89|      1|void InitProtobufDefaultsSlow() {
   90|      1|  static bool is_inited = InitProtobufDefaultsImpl();
   91|      1|  (void)is_inited;
   92|      1|}
_ZN6google8protobuf8internal11InitSCCImplEPNS1_11SCCInfoBaseE:
  764|      7|void InitSCCImpl(SCCInfoBase* scc) {
  765|      7|  static WrappedMutex mu{GOOGLE_PROTOBUF_LINKER_INITIALIZED};
  766|       |  // Either the default in case no initialization is running or the id of the
  767|       |  // thread that is currently initializing.
  768|      7|#ifndef GOOGLE_PROTOBUF_SUPPORT_WINDOWS_XP
  769|      7|  static std::atomic<std::thread::id> runner;
  770|      7|  auto me = std::this_thread::get_id();
  771|       |#else
  772|       |  // This is a lightweight replacement for std::thread::id. std::thread does not
  773|       |  // work on Windows XP SP2 with the latest VC++ libraries, because it utilizes
  774|       |  // the Concurrency Runtime that is only supported on Windows XP SP3 and above.
  775|       |  static std::atomic_llong runner(-1);
  776|       |  auto me = ::GetCurrentThreadId();
  777|       |#endif  // #ifndef GOOGLE_PROTOBUF_SUPPORT_WINDOWS_XP
  778|       |
  779|       |  // This will only happen because the constructor will call InitSCC while
  780|       |  // constructing the default instance.
  781|      7|  if (runner.load(std::memory_order_relaxed) == me) {
  ------------------
  |  Branch (781:7): [True: 6, False: 1]
  ------------------
  782|       |    // Because we're in the process of constructing the default instance.
  783|       |    // We can be assured that we're already exploring this SCC.
  784|      6|    GOOGLE_CHECK_EQ(scc->visit_status.load(std::memory_order_relaxed),
  ------------------
  |  |  156|      6|#define GOOGLE_CHECK_EQ(A, B) GOOGLE_CHECK((A) == (B))
  |  |  ------------------
  |  |  |  |  154|      6|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      6|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 6, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  785|      6|             SCCInfoBase::kRunning);
  786|      6|    return;
  787|      6|  }
  788|      1|  InitProtobufDefaults();
  789|      1|  mu.Lock();
  790|      1|  runner.store(me, std::memory_order_relaxed);
  791|      1|  InitSCC_DFS(scc);
  792|       |
  793|      1|#ifndef GOOGLE_PROTOBUF_SUPPORT_WINDOWS_XP
  794|      1|  runner.store(std::thread::id{}, std::memory_order_relaxed);
  795|       |#else
  796|       |  runner.store(-1, std::memory_order_relaxed);
  797|       |#endif  // #ifndef GOOGLE_PROTOBUF_SUPPORT_WINDOWS_XP
  798|       |
  799|      1|  mu.Unlock();
  800|      1|}
generated_message_util.cc:_ZN6google8protobuf8internalL24InitProtobufDefaultsImplEv:
   76|      1|static bool InitProtobufDefaultsImpl() {
   77|      1|  ::new (static_cast<void*>(&fixed_address_empty_string.value)) std::string();
   78|      1|  OnShutdownDestroyString(&fixed_address_empty_string.value);
   79|       |
   80|       |  // Verify that we can indeed get the address during constant evaluation.
   81|      1|  PROTOBUF_CONSTINIT static const std::string& fixed_address_empty_string_test =
  ------------------
  |  |  589|      1|#define PROTOBUF_CONSTINIT [[clang::require_constant_initialization]]
  ------------------
   82|      1|      GetEmptyStringAlreadyInited();
   83|      1|  (void)fixed_address_empty_string_test;
   84|       |
   85|      1|  init_protobuf_defaults_state.store(true, std::memory_order_release);
   86|      1|  return true;
   87|      1|}
generated_message_util.cc:_ZN6google8protobuf8internal12_GLOBAL__N_111InitSCC_DFSEPNS1_11SCCInfoBaseE:
  736|      6|void InitSCC_DFS(SCCInfoBase* scc) {
  737|      6|  if (scc->visit_status.load(std::memory_order_relaxed) !=
  ------------------
  |  Branch (737:7): [True: 0, False: 6]
  ------------------
  738|      6|      SCCInfoBase::kUninitialized)
  739|      0|    return;
  740|      6|  scc->visit_status.store(SCCInfoBase::kRunning, std::memory_order_relaxed);
  741|       |  // Each base is followed by an array of void*, containing first pointers to
  742|       |  // SCCInfoBase and then pointers-to-pointers to SCCInfoBase.
  743|      6|  auto deps = reinterpret_cast<void**>(scc + 1);
  744|      6|  auto strong_deps = reinterpret_cast<SCCInfoBase* const*>(deps);
  745|     11|  for (int i = 0; i < scc->num_deps; ++i) {
  ------------------
  |  Branch (745:19): [True: 5, False: 6]
  ------------------
  746|      5|    if (strong_deps[i]) InitSCC_DFS(strong_deps[i]);
  ------------------
  |  Branch (746:9): [True: 5, False: 0]
  ------------------
  747|      5|  }
  748|      6|  auto implicit_weak_deps =
  749|      6|      reinterpret_cast<SCCInfoBase** const*>(deps + scc->num_deps);
  750|      6|  for (int i = 0; i < scc->num_implicit_weak_deps; ++i) {
  ------------------
  |  Branch (750:19): [True: 0, False: 6]
  ------------------
  751|      0|    if (*implicit_weak_deps[i]) {
  ------------------
  |  Branch (751:9): [True: 0, False: 0]
  ------------------
  752|      0|      InitSCC_DFS(*implicit_weak_deps[i]);
  753|      0|    }
  754|      0|  }
  755|      6|  scc->init_func();
  756|       |  // Mark done (note we use memory order release here), other threads could
  757|       |  // now see this as initialized and thus the initialization must have happened
  758|       |  // before.
  759|      6|  scc->visit_status.store(SCCInfoBase::kInitialized, std::memory_order_release);
  760|      6|}

_ZN6google8protobuf5Arena6CreateINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_DpOT0_:
  292|    298|  PROTOBUF_ALWAYS_INLINE static T* Create(Arena* arena, Args&&... args) {
  293|    298|    return CreateNoMessage<T>(arena, is_arena_constructable<T>(),
  294|    298|                              std::forward<Args>(args)...);
  295|    298|  }
_ZN6google8protobuf5Arena15CreateNoMessageINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_NS3_17integral_constantIbLb0EEEDpOT0_:
  547|    298|                                                   Args&&... args) {
  548|       |    // User is constructing with Create() and the type does not support arena
  549|       |    // construction.  In this case we can delegate to CreateMaybeMessage() and
  550|       |    // use any specialization that may be available for that.
  551|    298|    return CreateMaybeMessage<T>(arena, std::forward<Args>(args)...);
  552|    298|  }
_ZN6google8protobuf5Arena18CreateMaybeMessageINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_DpOT0_:
  530|    298|                                                      Args&&... args) {
  531|    298|    return DoCreateMaybeMessage<T>(arena, is_arena_constructable<T>(),
  532|    298|                                   std::forward<Args>(args)...);
  533|    298|  }
_ZN6google8protobuf5Arena20DoCreateMaybeMessageINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_NS3_17integral_constantIbLb0EEEDpOT0_:
  524|    298|                                                        Args&&... args) {
  525|    298|    return CreateInternal<T>(arena, std::forward<Args>(args)...);
  526|    298|  }
_ZN6google8protobuf5Arena14CreateInternalINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_DpOT0_:
  472|    298|                                                  Args&&... args) {
  473|    298|    if (arena == NULL) {
  ------------------
  |  Branch (473:9): [True: 298, False: 0]
  ------------------
  474|    298|      return new T(std::forward<Args>(args)...);
  475|    298|    } else {
  476|      0|      return arena->DoCreate<T>(std::is_trivially_destructible<T>::value,
  477|      0|                                std::forward<Args>(args)...);
  478|      0|    }
  479|    298|  }
_ZN6google8protobuf5Arena21CreateMessageInternalIN13sentencepiece11TrainerSpecEEEPT_PS1_:
  459|      1|  PROTOBUF_ALWAYS_INLINE static T* CreateMessageInternal(Arena* arena) {
  460|      1|    static_assert(
  461|      1|        InternalHelper<T>::is_arena_constructable::value,
  462|      1|        "CreateMessage can only construct types that are ArenaConstructable");
  463|      1|    if (arena == NULL) {
  ------------------
  |  Branch (463:9): [True: 1, False: 0]
  ------------------
  464|      1|      return new T();
  465|      1|    } else {
  466|      0|      return arena->DoCreateMessage<T>();
  467|      0|    }
  468|      1|  }
_ZN6google8protobuf5Arena21CreateMessageInternalIN13sentencepiece14NormalizerSpecEEEPT_PS1_:
  459|      1|  PROTOBUF_ALWAYS_INLINE static T* CreateMessageInternal(Arena* arena) {
  460|      1|    static_assert(
  461|      1|        InternalHelper<T>::is_arena_constructable::value,
  462|      1|        "CreateMessage can only construct types that are ArenaConstructable");
  463|      1|    if (arena == NULL) {
  ------------------
  |  Branch (463:9): [True: 1, False: 0]
  ------------------
  464|      1|      return new T();
  465|      1|    } else {
  466|      0|      return arena->DoCreateMessage<T>();
  467|      0|    }
  468|      1|  }
_ZN6google8protobuf5Arena21CreateMessageInternalIN13sentencepiece24ModelProto_SentencePieceEEEPT_PS1_:
  459|    298|  PROTOBUF_ALWAYS_INLINE static T* CreateMessageInternal(Arena* arena) {
  460|    298|    static_assert(
  461|    298|        InternalHelper<T>::is_arena_constructable::value,
  462|    298|        "CreateMessage can only construct types that are ArenaConstructable");
  463|    298|    if (arena == NULL) {
  ------------------
  |  Branch (463:9): [True: 298, False: 0]
  ------------------
  464|    298|      return new T();
  465|    298|    } else {
  466|      0|      return arena->DoCreateMessage<T>();
  467|      0|    }
  468|    298|  }

_ZNK6google8protobuf8internal14ArenaStringPtr3GetEv:
  194|  1.44k|  const std::string& Get() const PROTOBUF_ALWAYS_INLINE {
  195|       |    // Unconditionally mask away the tag.
  196|  1.44k|    return *tagged_ptr_.Get();
  197|  1.44k|  }
_ZNK6google8protobuf8internal9TaggedPtrINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEE3GetEv:
   99|  1.44k|  T* Get() const { return reinterpret_cast<T*>(as_int() & -2); }
_ZNK6google8protobuf8internal9TaggedPtrINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEE6as_intEv:
  109|  1.44k|  uintptr_t as_int() const { return reinterpret_cast<uintptr_t>(ptr_); }
_ZNK6google8protobuf8internal14ArenaStringPtr9IsDefaultEPKNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE:
  279|    306|  inline bool IsDefault(const std::string* default_value) const {
  280|       |    // Relies on the fact that kPtrTagString == 0, so if IsString(), ptr_ is the
  281|       |    // actual std::string pointer (and if !IsString(), ptr_ will never be equal
  282|       |    // to any aligned |default_value| pointer). The key is that we want to avoid
  283|       |    // masking in the fastpath const-pointer Get() case for non-arena code.
  284|    306|    return tagged_ptr_.UnsafeGet() == default_value;
  285|    306|  }
_ZNK6google8protobuf8internal9TaggedPtrINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEE9UnsafeGetEv:
  104|    306|  T* UnsafeGet() const { return static_cast<T*>(ptr_); }
_ZNK6google8protobuf8internal10LazyString3getEv:
   74|      8|  const std::string& get() const {
   75|       |    // This check generates less code than a call-once invocation.
   76|      8|    auto* res = inited_.load(std::memory_order_acquire);
   77|      8|    if (PROTOBUF_PREDICT_FALSE(res == nullptr)) return Init();
  ------------------
  |  |  247|      8|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 4, False: 4]
  |  |  ------------------
  ------------------
   78|      4|    return *res;
   79|      8|  }
_ZNK6google8protobuf8internal14ArenaStringPtr15IsDonatedStringEv:
  290|    298|  bool IsDonatedString() const { return false; }
_ZN6google8protobuf8internal14ArenaStringPtr16UnsafeSetDefaultEPKNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE:
  301|    327|inline void ArenaStringPtr::UnsafeSetDefault(const std::string* value) {
  302|    327|  tagged_ptr_.Set(const_cast<std::string*>(value));
  303|    327|}
_ZN6google8protobuf8internal9TaggedPtrINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEE3SetEPS9_:
   98|    625|  void Set(T* p) { ptr_ = p; }

_ZNK6google8protobuf8internal12ExtensionSet8is_largeEv:
  667|    302|  bool is_large() const { return flat_capacity_ > kMaximumFlatCapacity; }
_ZN6google8protobuf8internal12ExtensionSet10flat_beginEv:
  816|      1|  KeyValue* flat_begin() {
  817|       |    assert(!is_large());
  818|      1|    return map_.flat;
  819|      1|  }
_ZNK6google8protobuf8internal12ExtensionSet10flat_beginEv:
  820|    301|  const KeyValue* flat_begin() const {
  821|       |    assert(!is_large());
  822|    301|    return map_.flat;
  823|    301|  }
_ZN6google8protobuf8internal12ExtensionSet8flat_endEv:
  824|      1|  KeyValue* flat_end() {
  825|       |    assert(!is_large());
  826|      1|    return map_.flat + flat_size_;
  827|      1|  }
_ZNK6google8protobuf8internal12ExtensionSet8flat_endEv:
  828|    301|  const KeyValue* flat_end() const {
  829|       |    assert(!is_large());
  830|    301|    return map_.flat + flat_size_;
  831|    301|  }
extension_set.cc:_ZN6google8protobuf8internal12ExtensionSet7ForEachIZNS2_5ClearEvE3$_0EET_S5_:
  688|      1|  KeyValueFunctor ForEach(KeyValueFunctor func) {
  689|      1|    if (PROTOBUF_PREDICT_FALSE(is_large())) {
  ------------------
  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  ------------------
  ------------------
  690|      0|      return ForEach(map_.large->begin(), map_.large->end(), std::move(func));
  691|      0|    }
  692|      1|    return ForEach(flat_begin(), flat_end(), std::move(func));
  693|      1|  }
extension_set.cc:_ZN6google8protobuf8internal12ExtensionSet7ForEachIPNS2_8KeyValueEZNS2_5ClearEvE3$_0EET0_T_S8_S7_:
  681|      1|                                 KeyValueFunctor func) {
  682|      1|    for (Iterator it = begin; it != end; ++it) func(it->first, it->second);
  ------------------
  |  Branch (682:31): [True: 0, False: 1]
  ------------------
  683|      1|    return std::move(func);
  684|      1|  }

_ZN6google8protobuf8internal20InitProtobufDefaultsEv:
   93|      1|PROTOBUF_EXPORT inline void InitProtobufDefaults() {
   94|      1|  if (PROTOBUF_PREDICT_FALSE(
  ------------------
  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 1, False: 0]
  |  |  ------------------
  ------------------
   95|      1|          !init_protobuf_defaults_state.load(std::memory_order_acquire))) {
   96|      1|    InitProtobufDefaultsSlow();
   97|      1|  }
   98|      1|}
_ZN6google8protobuf8internal7InitSCCEPNS1_11SCCInfoBaseE:
  247|    307|inline void InitSCC(SCCInfoBase* scc) {
  248|    307|  auto status = scc->visit_status.load(std::memory_order_acquire);
  249|    307|  if (PROTOBUF_PREDICT_FALSE(status != SCCInfoBase::kInitialized))
  ------------------
  |  |  247|    307|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 7, False: 300]
  |  |  ------------------
  ------------------
  250|      7|    InitSCCImpl(scc);
  251|    307|}
_ZN6google8protobuf8internal24OnShutdownDestroyMessageEPKv:
  256|      6|inline void OnShutdownDestroyMessage(const void* ptr) {
  257|      6|  OnShutdownRun(DestroyMessage, ptr);
  258|      6|}
_ZN6google8protobuf8internal23OnShutdownDestroyStringEPKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEE:
  260|      1|inline void OnShutdownDestroyString(const std::string* ptr) {
  261|      1|  OnShutdownRun(DestroyString, ptr);
  262|      1|}
_ZN6google8protobuf8internal17AllAreInitializedIN13sentencepiece24ModelProto_SentencePieceEEEbRKNS0_16RepeatedPtrFieldIT_EE:
  113|      1|bool AllAreInitialized(const RepeatedPtrField<Msg>& t) {
  114|    299|  for (int i = t.size(); --i >= 0;) {
  ------------------
  |  Branch (114:26): [True: 298, False: 1]
  ------------------
  115|    298|    if (!t.Get(i).IsInitialized()) return false;
  ------------------
  |  Branch (115:9): [True: 0, False: 298]
  ------------------
  116|    298|  }
  117|      1|  return true;
  118|      1|}

_ZNK6google8protobuf8internal7HasBitsILm1EEixEi:
   60|    305|  const uint32& operator[](int index) const PROTOBUF_ALWAYS_INLINE {
   61|    305|    return has_bits_[index];
   62|    305|  }
_ZN6google8protobuf8internal7HasBitsILm1EEixEi:
   56|    861|  uint32& operator[](int index) PROTOBUF_ALWAYS_INLINE {
   57|    861|    return has_bits_[index];
   58|    861|  }
_ZN6google8protobuf8internal7HasBitsILm2EEixEi:
   56|      3|  uint32& operator[](int index) PROTOBUF_ALWAYS_INLINE {
   57|      3|    return has_bits_[index];
   58|      3|  }
_ZN6google8protobuf8internal7HasBitsILm1EEC2Ev:
   50|    604|  constexpr HasBits() PROTOBUF_ALWAYS_INLINE : has_bits_{} {}
_ZN6google8protobuf8internal7HasBitsILm1EE5ClearEv:
   52|      1|  void Clear() PROTOBUF_ALWAYS_INLINE {
   53|      1|    memset(has_bits_, 0, sizeof(has_bits_));
   54|      1|  }
_ZN6google8protobuf8internal7HasBitsILm1EE2OrERKS3_:
   72|    300|  void Or(const HasBits<doublewords>& rhs) {
   73|    600|    for (size_t i = 0; i < doublewords; i++) has_bits_[i] |= rhs[i];
  ------------------
  |  Branch (73:24): [True: 300, False: 300]
  ------------------
   74|    300|  }
_ZN6google8protobuf8internal7HasBitsILm2EEC2Ev:
   50|      2|  constexpr HasBits() PROTOBUF_ALWAYS_INLINE : has_bits_{} {}

_ZN6google8protobuf2io16CodedInputStream24GetDefaultRecursionLimitEv:
  415|      1|  static int GetDefaultRecursionLimit() { return default_recursion_limit_; }

_ZNK6google8protobuf11MessageLite8GetArenaEv:
  230|    300|  Arena* GetArena() const { return _internal_metadata_.arena(); }
_ZN6google8protobuf11MessageLite18CreateMaybeMessageIN13sentencepiece14NormalizerSpecEEEPT_PNS0_5ArenaE:
  479|      1|  static T* CreateMaybeMessage(Arena* arena) {
  480|      1|    return Arena::CreateMaybeMessage<T>(arena);
  481|      1|  }
_ZN6google8protobuf11MessageLiteC2EPNS0_5ArenaE:
  483|    307|  inline explicit MessageLite(Arena* arena) : _internal_metadata_(arena) {}
_ZNK6google8protobuf11MessageLite23IsInitializedWithErrorsEv:
  508|      1|  bool IsInitializedWithErrors() const {
  509|      1|    if (IsInitialized()) return true;
  ------------------
  |  Branch (509:9): [True: 1, False: 0]
  ------------------
  510|      0|    LogInitializationErrorMessage();
  511|      0|    return false;
  512|      1|  }
_ZN6google8protobuf8internal27GetEmptyStringAlreadyInitedEv:
  173|    913|PROTOBUF_EXPORT constexpr const std::string& GetEmptyStringAlreadyInited() {
  174|    913|  return fixed_address_empty_string.value;
  175|    913|}
_ZN6google8protobuf11MessageLite18CreateMaybeMessageIN13sentencepiece11TrainerSpecEEEPT_PNS0_5ArenaE:
  479|      1|  static T* CreateMaybeMessage(Arena* arena) {
  480|      1|    return Arena::CreateMaybeMessage<T>(arena);
  481|      1|  }
_ZN6google8protobuf11MessageLite9ParseFromILNS1_10ParseFlagsE1ENS0_11StringPieceEEEbRKT0_:
  576|      1|bool MessageLite::ParseFrom(const T& input) {
  577|      1|  if (flags & kParse) Clear();
  ------------------
  |  Branch (577:7): [True: 1, Folded]
  ------------------
  578|      1|  constexpr bool alias = (flags & kMergeWithAliasing) != 0;
  579|      1|  return internal::MergeFromImpl<alias>(input, this, flags);
  580|      1|}

_ZNK6google8protobuf8internal16InternalMetadata5arenaEv:
   72|    300|  PROTOBUF_ALWAYS_INLINE Arena* arena() const {
   73|    300|    if (PROTOBUF_PREDICT_FALSE(have_unknown_fields())) {
  ------------------
  |  |  247|    300|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 300]
  |  |  ------------------
  ------------------
   74|      0|      return PtrValue<ContainerBase>()->arena;
   75|    300|    } else {
   76|    300|      return PtrValue<Arena>();
   77|    300|    }
   78|    300|  }
_ZNK6google8protobuf8internal16InternalMetadata19have_unknown_fieldsEv:
   80|    301|  PROTOBUF_ALWAYS_INLINE bool have_unknown_fields() const {
   81|    301|    return PtrTag() == kTagContainer;
   82|    301|  }
_ZNK6google8protobuf8internal16InternalMetadata6PtrTagEv:
  146|    301|  PROTOBUF_ALWAYS_INLINE int PtrTag() const {
  147|    301|    return reinterpret_cast<intptr_t>(ptr_) & kPtrTagMask;
  148|    301|  }
_ZNK6google8protobuf8internal16InternalMetadata8PtrValueINS0_5ArenaEEEPT_v:
  151|    300|  U* PtrValue() const {
  152|    300|    return reinterpret_cast<U*>(reinterpret_cast<intptr_t>(ptr_) &
  153|    300|                                kPtrValueMask);
  154|    300|  }
_ZN6google8protobuf8internal16InternalMetadataC2EPNS0_5ArenaE:
   62|    307|  explicit InternalMetadata(Arena* arena) : ptr_(arena) {}
_ZN6google8protobuf8internal16InternalMetadata5ClearINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEvv:
  126|      1|  PROTOBUF_ALWAYS_INLINE void Clear() {
  127|      1|    if (have_unknown_fields()) {
  ------------------
  |  Branch (127:9): [True: 0, False: 1]
  ------------------
  128|      0|      DoClear<T>();
  129|      0|    }
  130|      1|  }

_ZN6google8protobuf8internal18EpsCopyInputStreamC2Eb:
  113|      1|      : aliasing_(enable_aliasing ? kOnPatch : kNoAliasing) {}
  ------------------
  |  Branch (113:19): [True: 0, False: 1]
  ------------------
_ZN6google8protobuf8internal18EpsCopyInputStream9PushLimitEPKci:
  127|    300|  PROTOBUF_MUST_USE_RESULT int PushLimit(const char* ptr, int limit) {
  128|    300|    GOOGLE_DCHECK(limit >= 0 && limit <= INT_MAX - kSlopBytes);
  ------------------
  |  |  181|    300|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  |  Branch (151:5): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 300]
  |  |  ------------------
  ------------------
  129|       |    // This add is safe due to the invariant above, because
  130|       |    // ptr - buffer_end_ <= kSlopBytes.
  131|    300|    limit += static_cast<int>(ptr - buffer_end_);
  132|    300|    limit_end_ = buffer_end_ + (std::min)(0, limit);
  133|    300|    auto old_limit = limit_;
  134|    300|    limit_ = limit;
  135|    300|    return old_limit - limit;
  136|    300|  }
_ZN6google8protobuf8internal18EpsCopyInputStream8PopLimitEi:
  138|    300|  PROTOBUF_MUST_USE_RESULT bool PopLimit(int delta) {
  139|    300|    if (PROTOBUF_PREDICT_FALSE(!EndedAtLimit())) return false;
  ------------------
  |  |  247|    300|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 300]
  |  |  ------------------
  ------------------
  140|    300|    limit_ = limit_ + delta;
  141|       |    // TODO(gerbens) We could remove this line and hoist the code to
  142|       |    // DoneFallback. Study the perf/bin-size effects.
  143|    300|    limit_end_ = buffer_end_ + (std::min)(0, limit_);
  144|    300|    return true;
  145|    300|  }
_ZN6google8protobuf8internal18EpsCopyInputStream10ReadStringEPKciPNSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEE:
  154|    298|                                                  std::string* s) {
  155|    298|    if (size <= buffer_end_ + kSlopBytes - ptr) {
  ------------------
  |  Branch (155:9): [True: 298, False: 0]
  ------------------
  156|    298|      s->assign(ptr, size);
  157|    298|      return ptr + size;
  158|    298|    }
  159|      0|    return ReadStringFallback(ptr, size, s);
  160|    298|  }
_ZNK6google8protobuf8internal18EpsCopyInputStream12EndedAtLimitEv:
  189|    301|  bool EndedAtLimit() const { return last_tag_minus_1_ == 0; }
_ZN6google8protobuf8internal18EpsCopyInputStream13DataAvailableEPKc:
  202|    298|  bool DataAvailable(const char* ptr) { return ptr < limit_end_; }
_ZN6google8protobuf8internal18EpsCopyInputStream13DoneWithCheckEPPKci:
  208|  1.16k|  bool DoneWithCheck(const char** ptr, int d) {
  209|  1.16k|    GOOGLE_DCHECK(*ptr);
  ------------------
  |  |  181|  1.16k|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1.16k]
  |  |  ------------------
  ------------------
  210|  1.16k|    if (PROTOBUF_PREDICT_TRUE(*ptr < limit_end_)) return false;
  ------------------
  |  |  236|  1.16k|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 863, False: 302]
  |  |  ------------------
  ------------------
  211|    302|    int overrun = *ptr - buffer_end_;
  212|    302|    GOOGLE_DCHECK_LE(overrun, kSlopBytes);  // Guaranteed by parse loop.
  ------------------
  |  |  186|    302|#define GOOGLE_DCHECK_LE(A, B) GOOGLE_DCHECK((A) <= (B))
  |  |  ------------------
  |  |  |  |  181|    302|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 302]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  213|    302|    if (overrun ==
  ------------------
  |  Branch (213:9): [True: 301, False: 1]
  ------------------
  214|    302|        limit_) {  //  No need to flip buffers if we ended on a limit.
  215|       |      // If we actually overrun the buffer and next_chunk_ is null. It means
  216|       |      // the stream ended and we passed the stream end.
  217|    301|      if (overrun > 0 && next_chunk_ == nullptr) *ptr = nullptr;
  ------------------
  |  Branch (217:11): [True: 0, False: 301]
  |  Branch (217:26): [True: 0, False: 0]
  ------------------
  218|    301|      return true;
  219|    301|    }
  220|      1|    auto res = DoneFallback(overrun, d);
  221|      1|    *ptr = res.first;
  222|      1|    return res.second;
  223|    302|  }
_ZN6google8protobuf8internal18EpsCopyInputStream8InitFromENS0_11StringPieceE:
  225|      1|  const char* InitFrom(StringPiece flat) {
  226|      1|    overall_limit_ = 0;
  227|      1|    if (flat.size() > kSlopBytes) {
  ------------------
  |  Branch (227:9): [True: 1, False: 0]
  ------------------
  228|      1|      limit_ = kSlopBytes;
  229|      1|      limit_end_ = buffer_end_ = flat.data() + flat.size() - kSlopBytes;
  230|      1|      next_chunk_ = buffer_;
  231|      1|      if (aliasing_ == kOnPatch) aliasing_ = kNoDelta;
  ------------------
  |  Branch (231:11): [True: 0, False: 1]
  ------------------
  232|      1|      return flat.data();
  233|      1|    } else {
  234|      0|      std::memcpy(buffer_, flat.data(), flat.size());
  235|      0|      limit_ = 0;
  236|      0|      limit_end_ = buffer_end_ = buffer_ + flat.size();
  237|      0|      next_chunk_ = nullptr;
  238|      0|      if (aliasing_ == kOnPatch) {
  ------------------
  |  Branch (238:11): [True: 0, False: 0]
  ------------------
  239|      0|        aliasing_ = reinterpret_cast<std::uintptr_t>(flat.data()) -
  240|      0|                    reinterpret_cast<std::uintptr_t>(buffer_);
  241|      0|      }
  242|      0|      return buffer_;
  243|      0|    }
  244|      1|  }
_ZN6google8protobuf8internal12ParseContext4DoneEPPKc:
  390|  1.16k|  bool Done(const char** ptr) { return DoneWithCheck(ptr, group_depth_); }
_ZN6google8protobuf8internal12EndianHelperILi4EE4LoadEPKv:
  461|    298|  static uint32 Load(const void* p) {
  462|    298|    uint32 tmp;
  463|    298|    std::memcpy(&tmp, p, 4);
  464|       |#ifndef PROTOBUF_LITTLE_ENDIAN
  465|       |    tmp = bswap_32(tmp);
  466|       |#endif
  467|    298|    return tmp;
  468|    298|  }
_ZN6google8protobuf8internal7ReadTagEPKcPjj:
  532|    864|inline const char* ReadTag(const char* p, uint32* out, uint32 /*max_tag*/ = 0) {
  533|    864|  uint32 res = static_cast<uint8>(p[0]);
  534|    864|  if (res < 128) {
  ------------------
  |  Branch (534:7): [True: 863, False: 1]
  ------------------
  535|    863|    *out = res;
  536|    863|    return p + 1;
  537|    863|  }
  538|      1|  uint32 second = static_cast<uint8>(p[1]);
  539|      1|  res += (second - 1) << 7;
  540|      1|  if (second < 128) {
  ------------------
  |  Branch (540:7): [True: 1, False: 0]
  ------------------
  541|      1|    *out = res;
  542|      1|    return p + 2;
  543|      1|  }
  544|      0|  auto tmp = ReadTagFallback(p, res);
  545|      0|  *out = tmp.second;
  546|      0|  return tmp.first;
  547|      1|}
_ZN6google8protobuf8internal8ReadSizeEPPKc:
  599|    598|inline uint32 ReadSize(const char** pp) {
  600|    598|  auto p = *pp;
  601|    598|  uint32 res = static_cast<uint8>(p[0]);
  602|    598|  if (res < 128) {
  ------------------
  |  Branch (602:7): [True: 598, False: 0]
  ------------------
  603|    598|    *pp = p + 1;
  604|    598|    return res;
  605|    598|  }
  606|      0|  auto x = ReadSizeFallback(p, res);
  607|      0|  *pp = x.first;
  608|      0|  return x.second;
  609|    598|}
_ZN6google8protobuf8internal12ReadVarint64EPPKc:
  616|    265|inline uint64 ReadVarint64(const char** p) {
  617|    265|  uint64 tmp;
  618|    265|  *p = VarintParse(*p, &tmp);
  619|    265|  return tmp;
  620|    265|}
_ZN6google8protobuf8internal11VarintParseImEEPKcS4_PT_:
  509|    265|PROTOBUF_MUST_USE_RESULT const char* VarintParse(const char* p, T* out) {
  510|    265|  auto ptr = reinterpret_cast<const uint8*>(p);
  511|    265|  uint32 res = ptr[0];
  512|    265|  if (!(res & 0x80)) {
  ------------------
  |  Branch (512:7): [True: 265, False: 0]
  ------------------
  513|    265|    *out = res;
  514|    265|    return p + 1;
  515|    265|  }
  516|      0|  uint32 byte = ptr[1];
  517|      0|  res += (byte - 1) << 7;
  518|      0|  if (!(byte & 0x80)) {
  ------------------
  |  Branch (518:7): [True: 0, False: 0]
  ------------------
  519|      0|    *out = res;
  520|      0|    return p + 2;
  521|      0|  }
  522|      0|  return VarintParseSlow(p, res, out);
  523|      0|}
_ZN6google8protobuf8internal13UnalignedLoadIfEET_PKc:
  484|    298|T UnalignedLoad(const char* p) {
  485|    298|  auto tmp = EndianHelper<sizeof(T)>::Load(p);
  486|    298|  T res;
  487|    298|  memcpy(&res, &tmp, sizeof(T));
  488|    298|  return res;
  489|    298|}
_ZN6google8protobuf8internal12ParseContextC2IJRNS0_11StringPieceEEEEibPPKcDpOT_:
  384|      1|      : EpsCopyInputStream(aliasing), depth_(depth) {
  385|      1|    *start = InitFrom(std::forward<T>(args)...);
  386|      1|  }
_ZN6google8protobuf8internal9ExpectTagILj10EEEbPKc:
  429|    298|bool ExpectTag(const char* ptr) {
  430|    298|  if (tag < 128) {
  ------------------
  |  Branch (430:7): [True: 298, Folded]
  ------------------
  431|    298|    return *ptr == tag;
  432|    298|  } else {
  433|      0|    static_assert(tag < 128 * 128, "We only expect tags for 1 or 2 bytes");
  434|      0|    char buf[2] = {static_cast<char>(tag | 0x80), static_cast<char>(tag >> 7)};
  435|      0|    return std::memcmp(ptr, buf, 2) == 0;
  436|      0|  }
  437|    298|}
_ZN6google8protobuf8internal12ParseContext12ParseMessageIN13sentencepiece24ModelProto_SentencePieceEEEPKcPT_S7_:
  642|    298|    T* msg, const char* ptr) {
  643|    298|  int size = ReadSize(&ptr);
  644|    298|  if (!ptr) return nullptr;
  ------------------
  |  Branch (644:7): [True: 0, False: 298]
  ------------------
  645|    298|  auto old = PushLimit(ptr, size);
  646|    298|  if (--depth_ < 0) return nullptr;
  ------------------
  |  Branch (646:7): [True: 0, False: 298]
  ------------------
  647|    298|  ptr = msg->_InternalParse(ptr, this);
  648|    298|  if (PROTOBUF_PREDICT_FALSE(ptr == nullptr)) return nullptr;
  ------------------
  |  |  247|    298|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 298]
  |  |  ------------------
  ------------------
  649|    298|  depth_++;
  650|    298|  if (!PopLimit(old)) return nullptr;
  ------------------
  |  Branch (650:7): [True: 0, False: 298]
  ------------------
  651|    298|  return ptr;
  652|    298|}
_ZN6google8protobuf8internal12ParseContext12ParseMessageIN13sentencepiece11TrainerSpecEEEPKcPT_S7_:
  642|      1|    T* msg, const char* ptr) {
  643|      1|  int size = ReadSize(&ptr);
  644|      1|  if (!ptr) return nullptr;
  ------------------
  |  Branch (644:7): [True: 0, False: 1]
  ------------------
  645|      1|  auto old = PushLimit(ptr, size);
  646|      1|  if (--depth_ < 0) return nullptr;
  ------------------
  |  Branch (646:7): [True: 0, False: 1]
  ------------------
  647|      1|  ptr = msg->_InternalParse(ptr, this);
  648|      1|  if (PROTOBUF_PREDICT_FALSE(ptr == nullptr)) return nullptr;
  ------------------
  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  ------------------
  ------------------
  649|      1|  depth_++;
  650|      1|  if (!PopLimit(old)) return nullptr;
  ------------------
  |  Branch (650:7): [True: 0, False: 1]
  ------------------
  651|      1|  return ptr;
  652|      1|}
_ZN6google8protobuf8internal12ParseContext12ParseMessageIN13sentencepiece14NormalizerSpecEEEPKcPT_S7_:
  642|      1|    T* msg, const char* ptr) {
  643|      1|  int size = ReadSize(&ptr);
  644|      1|  if (!ptr) return nullptr;
  ------------------
  |  Branch (644:7): [True: 0, False: 1]
  ------------------
  645|      1|  auto old = PushLimit(ptr, size);
  646|      1|  if (--depth_ < 0) return nullptr;
  ------------------
  |  Branch (646:7): [True: 0, False: 1]
  ------------------
  647|      1|  ptr = msg->_InternalParse(ptr, this);
  648|      1|  if (PROTOBUF_PREDICT_FALSE(ptr == nullptr)) return nullptr;
  ------------------
  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  ------------------
  ------------------
  649|      1|  depth_++;
  650|      1|  if (!PopLimit(old)) return nullptr;
  ------------------
  |  Branch (650:7): [True: 0, False: 1]
  ------------------
  651|      1|  return ptr;
  652|      1|}

_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece19SelfTestData_SampleEE4sizeEv:
 2167|      1|inline int RepeatedPtrField<Element>::size() const {
 2168|      1|  return RepeatedPtrFieldBase::size();
 2169|      1|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase4sizeEv:
 1700|    601|inline int RepeatedPtrFieldBase::size() const { return current_size_; }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE4sizeEv:
 2167|    600|inline int RepeatedPtrField<Element>::size() const {
 2168|    600|  return RepeatedPtrFieldBase::size();
 2169|    600|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS0_16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE11TypeHandlerEEEPNT_4TypeEPv:
  748|    898|  static inline typename TypeHandler::Type* cast(void* element) {
  749|    898|    return reinterpret_cast<typename TypeHandler::Type*>(element);
  750|    898|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8raw_dataEv:
 1857|      4|inline void* const* RepeatedPtrFieldBase::raw_data() const {
 1858|      4|  return rep_ ? rep_->elements : NULL;
  ------------------
  |  Branch (1858:10): [True: 2, False: 2]
  ------------------
 1859|      4|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece19SelfTestData_SampleEE5beginEv:
 2613|      1|RepeatedPtrField<Element>::begin() const {
 2614|      1|  return iterator(raw_data());
 2615|      1|}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece19SelfTestData_SampleEEC2EPKPv:
 2432|      2|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece19SelfTestData_SampleEEC2IS4_EERKNS2_IT_EE:
 2438|      2|      : it_(other.it_) {
 2439|       |    // Force a compiler error if the other type is not convertible to ours.
 2440|      2|    if (false) {
  ------------------
  |  Branch (2440:9): [Folded, False: 2]
  ------------------
 2441|      0|      implicit_cast<Element*>(static_cast<OtherElement*>(nullptr));
 2442|      0|    }
 2443|      2|  }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece19SelfTestData_SampleEE3endEv:
 2628|      1|RepeatedPtrField<Element>::end() const {
 2629|      1|  return iterator(raw_data() + size());
 2630|      1|}
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece19SelfTestData_SampleEEneERKS6_:
 2463|      1|  bool operator!=(const iterator& x) const { return it_ != x.it_; }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece24ModelProto_SentencePieceEEC2EPKPv:
 2432|      2|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8GetArenaEv:
  719|      8|  inline Arena* GetArena() const { return arena_; }
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE5ClearEv:
 2293|      1|inline void RepeatedPtrField<Element>::Clear() {
 2294|      1|  RepeatedPtrFieldBase::Clear<TypeHandler>();
 2295|      1|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase5ClearINS0_16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE11TypeHandlerEEEvv:
 1778|      1|void RepeatedPtrFieldBase::Clear() {
 1779|      1|  const int n = current_size_;
 1780|      1|  GOOGLE_DCHECK_GE(n, 0);
  ------------------
  |  |  188|      1|#define GOOGLE_DCHECK_GE(A, B) GOOGLE_DCHECK((A) >= (B))
  |  |  ------------------
  |  |  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1781|      1|  if (n > 0) {
  ------------------
  |  Branch (1781:7): [True: 0, False: 1]
  ------------------
 1782|      0|    void* const* elements = rep_->elements;
 1783|      0|    int i = 0;
 1784|      0|    do {
 1785|      0|      TypeHandler::Clear(cast<TypeHandler>(elements[i++]));
 1786|      0|    } while (i < n);
  ------------------
  |  Branch (1786:14): [True: 0, False: 0]
  ------------------
 1787|      0|    current_size_ = 0;
 1788|      0|  }
 1789|      1|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE3GetEi:
 2172|    898|inline const Element& RepeatedPtrField<Element>::Get(int index) const {
 2173|    898|  return RepeatedPtrFieldBase::Get<TypeHandler>(index);
 2174|    898|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase3GetINS0_16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE11TypeHandlerEEERKNT_4TypeEi:
 1704|    898|    int index) const {
 1705|    898|  GOOGLE_DCHECK_GE(index, 0);
  ------------------
  |  |  188|    898|#define GOOGLE_DCHECK_GE(A, B) GOOGLE_DCHECK((A) >= (B))
  |  |  ------------------
  |  |  |  |  181|    898|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 898]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1706|    898|  GOOGLE_DCHECK_LT(index, current_size_);
  ------------------
  |  |  185|    898|#define GOOGLE_DCHECK_LT(A, B) GOOGLE_DCHECK((A) <  (B))
  |  |  ------------------
  |  |  |  |  181|    898|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  |  |  ------------------
  |  |  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (181:41): [Folded, False: 898]
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1707|    898|  return *cast<TypeHandler>(rep_->elements[index]);
 1708|    898|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE3AddEv:
 2193|    298|inline Element* RepeatedPtrField<Element>::Add() {
 2194|    298|  return RepeatedPtrFieldBase::Add<TypeHandler>();
 2195|    298|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3AddINS0_16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE11TypeHandlerEEEPNT_4TypeESB_:
 1741|    298|    typename TypeHandler::Type* prototype) {
 1742|    298|  if (rep_ != NULL && current_size_ < rep_->allocated_size) {
  ------------------
  |  Branch (1742:7): [True: 297, False: 1]
  |  Branch (1742:23): [True: 0, False: 297]
  ------------------
 1743|      0|    return cast<TypeHandler>(rep_->elements[current_size_++]);
 1744|      0|  }
 1745|    298|  if (!rep_ || rep_->allocated_size == total_size_) {
  ------------------
  |  Branch (1745:7): [True: 1, False: 297]
  |  Branch (1745:16): [True: 7, False: 290]
  ------------------
 1746|      8|    Reserve(total_size_ + 1);
 1747|      8|  }
 1748|    298|  ++rep_->allocated_size;
 1749|    298|  typename TypeHandler::Type* result =
 1750|    298|      TypeHandler::NewFromPrototype(prototype, arena_);
 1751|    298|  rep_->elements[current_size_++] = result;
 1752|    298|  return result;
 1753|    298|}
_ZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEE16NewFromPrototypeEPKS4_PNS0_5ArenaE:
  836|    298|    const GenericType* /* prototype */, Arena* arena) {
  837|    298|  return New(arena);
  838|    298|}
_ZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEE3NewEPNS0_5ArenaE:
  806|    298|  static inline GenericType* New(Arena* arena) {
  807|    298|    return Arena::CreateMaybeMessage<Type>(arena);
  808|    298|  }
_ZN6google8protobuf16RepeatedPtrFieldINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEC2EPNS0_5ArenaE:
 2098|      8|    : RepeatedPtrFieldBase(arena) {}
_ZN6google8protobuf8internal20RepeatedPtrFieldBaseC2EPNS0_5ArenaE:
 1654|     11|    : arena_(arena), current_size_(0), total_size_(0), rep_(NULL) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece19SelfTestData_SampleEEC2EPNS0_5ArenaE:
 2098|      1|    : RepeatedPtrFieldBase(arena) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEEC2EPNS0_5ArenaE:
 2098|      2|    : RepeatedPtrFieldBase(arena) {}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE5beginEv:
 2613|      1|RepeatedPtrField<Element>::begin() const {
 2614|      1|  return iterator(raw_data());
 2615|      1|}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEC2IS4_EERKNS2_IT_EE:
 2438|      2|      : it_(other.it_) {
 2439|       |    // Force a compiler error if the other type is not convertible to ours.
 2440|      2|    if (false) {
  ------------------
  |  Branch (2440:9): [Folded, False: 2]
  ------------------
 2441|      0|      implicit_cast<Element*>(static_cast<OtherElement*>(nullptr));
 2442|      0|    }
 2443|      2|  }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE3endEv:
 2628|      1|RepeatedPtrField<Element>::end() const {
 2629|      1|  return iterator(raw_data() + size());
 2630|      1|}
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEneERKS6_:
 2463|    299|  bool operator!=(const iterator& x) const { return it_ != x.it_; }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEppEv:
 2450|    298|  iterator& operator++() {
 2451|    298|    ++it_;
 2452|    298|    return *this;
 2453|    298|  }
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEdeEv:
 2446|    298|  reference operator*() const { return *reinterpret_cast<Element*>(*it_); }

_ZN6google8protobuf8internal12WrappedMutex4LockEv:
   99|     12|  void Lock() GOOGLE_PROTOBUF_ACQUIRE() { mu_.lock(); }
_ZN6google8protobuf8internal12WrappedMutex6UnlockEv:
  100|     12|  void Unlock() GOOGLE_PROTOBUF_RELEASE() { mu_.unlock(); }
_ZN6google8protobuf8internal9MutexLockC2EPNS1_12WrappedMutexE:
  118|      7|  explicit MutexLock(Mutex *mu) : mu_(mu) { this->mu_->Lock(); }
_ZN6google8protobuf8internal9MutexLockD2Ev:
  119|      7|  ~MutexLock() { this->mu_->Unlock(); }
_ZN6google8protobuf8internal12WrappedMutexC2Ev:
   98|      1|  WrappedMutex() = default;

_ZN6google8protobuf11StringPiece22CheckedSsizeTFromSizeTEm:
  186|      2|  static stringpiece_ssize_type CheckedSsizeTFromSizeT(size_t size) {
  187|       |#if STRINGPIECE_CHECK_SIZE > 0
  188|       |#ifdef max
  189|       |#undef max
  190|       |#endif
  191|       |    if (size > static_cast<size_t>(
  192|       |        std::numeric_limits<stringpiece_ssize_type>::max())) {
  193|       |      // Some people grep for this message in logs
  194|       |      // so take care if you ever change it.
  195|       |      LogFatalSizeTooBig(size, "size_t to int conversion");
  196|       |    }
  197|       |#endif
  198|      2|    return static_cast<stringpiece_ssize_type>(size);
  199|      2|  }
_ZN6google8protobuf11StringPieceC2EPKc:
  214|      2|      : ptr_(str), length_(0) {
  215|      2|    if (str != nullptr) {
  ------------------
  |  Branch (215:9): [True: 2, False: 0]
  ------------------
  216|      2|      length_ = CheckedSsizeTFromSizeT(strlen(str));
  217|      2|    }
  218|      2|  }
_ZN6google8protobuf11StringPieceC2EPKcl:
  228|     11|      : ptr_(offset), length_(len) {
  229|       |    assert(len >= 0);
  230|     11|  }
_ZNK6google8protobuf11StringPiece4dataEv:
  246|      4|  const char* data() const { return ptr_; }
_ZNK6google8protobuf11StringPiece4sizeEv:
  247|      4|  stringpiece_ssize_type size() const { return length_; }
_ZNK6google8protobuf11StringPiece8ToStringEv:
  310|      2|  std::string ToString() const {
  311|      2|    if (ptr_ == nullptr) return "";
  ------------------
  |  Branch (311:9): [True: 0, False: 2]
  ------------------
  312|      2|    return std::string(data(), static_cast<size_type>(size()));
  313|      2|  }

_ZN6google8protobuf8internal13MergeFromImplILb0EEEbNS0_11StringPieceEPNS0_11MessageLiteENS4_10ParseFlagsE:
  140|      1|                   MessageLite::ParseFlags parse_flags) {
  141|      1|  const char* ptr;
  142|      1|  internal::ParseContext ctx(io::CodedInputStream::GetDefaultRecursionLimit(),
  143|      1|                             aliasing, &ptr, input);
  144|      1|  ptr = msg->_InternalParse(ptr, &ctx);
  145|       |  // ctx has an explicit limit set (length of string_view).
  146|      1|  if (PROTOBUF_PREDICT_TRUE(ptr && ctx.EndedAtLimit())) {
  ------------------
  |  |  236|      2|#define PROTOBUF_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
  |  |  ------------------
  |  |  |  Branch (236:34): [True: 1, False: 0]
  |  |  |  Branch (236:55): [True: 1, False: 0]
  |  |  |  Branch (236:55): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  147|      1|    return CheckFieldPresence(ctx, *msg, parse_flags);
  148|      1|  }
  149|      0|  return false;
  150|      1|}
_ZN6google8protobuf11MessageLite14ParseFromArrayEPKvi:
  324|      1|bool MessageLite::ParseFromArray(const void* data, int size) {
  325|      1|  return ParseFrom<kParse>(as_string_view(data, size));
  326|      1|}
_ZN6google8protobuf8internal13OnShutdownRunEPFvPKvES3_:
  564|      7|void OnShutdownRun(void (*f)(const void*), const void* arg) {
  565|      7|  auto shutdown_data = ShutdownData::get();
  566|      7|  MutexLock lock(&shutdown_data->mutex);
  567|      7|  shutdown_data->functions.push_back(std::make_pair(f, arg));
  568|      7|}
message_lite.cc:_ZN6google8protobuf12_GLOBAL__N_118CheckFieldPresenceERKNS0_8internal12ParseContextERKNS0_11MessageLiteENS6_10ParseFlagsE:
  123|      1|                               MessageLite::ParseFlags parse_flags) {
  124|      1|  if (PROTOBUF_PREDICT_FALSE((parse_flags & MessageLite::kMergePartial) != 0)) {
  ------------------
  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  ------------------
  ------------------
  125|      0|    return true;
  126|      0|  }
  127|      1|  return msg.IsInitializedWithErrors();
  128|      1|}
message_lite.cc:_ZN6google8protobuf12_GLOBAL__N_114as_string_viewEPKvi:
  116|      1|inline StringPiece as_string_view(const void* data, int size) {
  117|      1|  return StringPiece(static_cast<const char*>(data), size);
  118|      1|}
_ZN6google8protobuf8internal12ShutdownData3getEv:
  546|      7|  static ShutdownData* get() {
  547|      7|    static auto* data = new ShutdownData;
  548|      7|    return data;
  549|      7|  }

_ZN6google8protobuf8internal18EpsCopyInputStream12DoneFallbackEii:
  172|      1|                                                              int depth) {
  173|       |  // Did we exceeded the limit (parse error).
  174|      1|  if (PROTOBUF_PREDICT_FALSE(overrun > limit_)) return {nullptr, true};
  ------------------
  |  |  247|      1|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 1]
  |  |  ------------------
  ------------------
  175|      1|  GOOGLE_DCHECK(overrun != limit_);  // Guaranteed by caller.
  ------------------
  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  ------------------
  ------------------
  176|      1|  GOOGLE_DCHECK(overrun < limit_);   // Follows from above
  ------------------
  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  ------------------
  ------------------
  177|       |  // TODO(gerbens) Instead of this dcheck we could just assign, and remove
  178|       |  // updating the limit_end from PopLimit, ie.
  179|       |  // limit_end_ = buffer_end_ + (std::min)(0, limit_);
  180|       |  // if (ptr < limit_end_) return {ptr, false};
  181|      1|  GOOGLE_DCHECK(limit_end_ == buffer_end_ + (std::min)(0, limit_));
  ------------------
  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  ------------------
  ------------------
  182|       |  // At this point we know the following assertion holds.
  183|      1|  GOOGLE_DCHECK(limit_ > 0);
  ------------------
  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  ------------------
  ------------------
  184|      1|  GOOGLE_DCHECK(limit_end_ == buffer_end_);  // because limit_ > 0
  ------------------
  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  ------------------
  ------------------
  185|      1|  const char* p;
  186|      1|  do {
  187|       |    // We are past the end of buffer_end_, in the slop region.
  188|      1|    GOOGLE_DCHECK(overrun >= 0);
  ------------------
  |  |  181|      1|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 1]
  |  |  ------------------
  ------------------
  189|      1|    p = NextBuffer(overrun, depth);
  190|      1|    if (p == nullptr) {
  ------------------
  |  Branch (190:9): [True: 0, False: 1]
  ------------------
  191|       |      // We are at the end of the stream
  192|      0|      if (PROTOBUF_PREDICT_FALSE(overrun != 0)) return {nullptr, true};
  ------------------
  |  |  247|      0|#define PROTOBUF_PREDICT_FALSE(x) (__builtin_expect(x, 0))
  |  |  ------------------
  |  |  |  Branch (247:35): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  193|      0|      GOOGLE_DCHECK(limit_ > 0);
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
  194|      0|      limit_end_ = buffer_end_;
  195|       |      // Distinguish ending on a pushed limit or ending on end-of-stream.
  196|      0|      SetEndOfStream();
  197|      0|      return {buffer_end_, true};
  198|      0|    }
  199|      1|    limit_ -= buffer_end_ - p;  // Adjust limit_ relative to new anchor
  200|      1|    p += overrun;
  201|      1|    overrun = p - buffer_end_;
  202|      1|  } while (overrun >= 0);
  ------------------
  |  Branch (202:12): [True: 0, False: 1]
  ------------------
  203|      1|  limit_end_ = buffer_end_ + std::min(0, limit_);
  204|      1|  return {p, false};
  205|      1|}
_ZN6google8protobuf8internal24InlineGreedyStringParserEPNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEPKcPNS1_12ParseContextE:
  438|    298|                                     ParseContext* ctx) {
  439|    298|  int size = ReadSize(&ptr);
  440|    298|  if (!ptr) return nullptr;
  ------------------
  |  Branch (440:7): [True: 0, False: 298]
  ------------------
  441|    298|  return ctx->ReadString(ptr, size, s);
  442|    298|}
_ZN6google8protobuf8internal18EpsCopyInputStream10NextBufferEii:
  102|      1|const char* EpsCopyInputStream::NextBuffer(int overrun, int depth) {
  103|      1|  if (next_chunk_ == nullptr) return nullptr;  // We've reached end of stream.
  ------------------
  |  Branch (103:7): [True: 0, False: 1]
  ------------------
  104|      1|  if (next_chunk_ != buffer_) {
  ------------------
  |  Branch (104:7): [True: 0, False: 1]
  ------------------
  105|      0|    GOOGLE_DCHECK(size_ > kSlopBytes);
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
  106|       |    // The chunk is large enough to be used directly
  107|      0|    buffer_end_ = next_chunk_ + size_ - kSlopBytes;
  108|      0|    auto res = next_chunk_;
  109|      0|    next_chunk_ = buffer_;
  110|      0|    if (aliasing_ == kOnPatch) aliasing_ = kNoDelta;
  ------------------
  |  Branch (110:9): [True: 0, False: 0]
  ------------------
  111|      0|    return res;
  112|      0|  }
  113|       |  // Move the slop bytes of previous buffer to start of the patch buffer.
  114|       |  // Note we must use memmove because the previous buffer could be part of
  115|       |  // buffer_.
  116|      1|  std::memmove(buffer_, buffer_end_, kSlopBytes);
  117|      1|  if (overall_limit_ > 0 &&
  ------------------
  |  Branch (117:7): [True: 0, False: 1]
  ------------------
  118|      0|      (depth < 0 || !ParseEndsInSlopRegion(buffer_, overrun, depth))) {
  ------------------
  |  Branch (118:8): [True: 0, False: 0]
  |  Branch (118:21): [True: 0, False: 0]
  ------------------
  119|      0|    const void* data;
  120|       |    // ZeroCopyInputStream indicates Next may return 0 size buffers. Hence
  121|       |    // we loop.
  122|      0|    while (StreamNext(&data)) {
  ------------------
  |  Branch (122:12): [True: 0, False: 0]
  ------------------
  123|      0|      if (size_ > kSlopBytes) {
  ------------------
  |  Branch (123:11): [True: 0, False: 0]
  ------------------
  124|       |        // We got a large chunk
  125|      0|        std::memcpy(buffer_ + kSlopBytes, data, kSlopBytes);
  126|      0|        next_chunk_ = static_cast<const char*>(data);
  127|      0|        buffer_end_ = buffer_ + kSlopBytes;
  128|      0|        if (aliasing_ >= kNoDelta) aliasing_ = kOnPatch;
  ------------------
  |  Branch (128:13): [True: 0, False: 0]
  ------------------
  129|      0|        return buffer_;
  130|      0|      } else if (size_ > 0) {
  ------------------
  |  Branch (130:18): [True: 0, False: 0]
  ------------------
  131|      0|        std::memcpy(buffer_ + kSlopBytes, data, size_);
  132|      0|        next_chunk_ = buffer_;
  133|      0|        buffer_end_ = buffer_ + size_;
  134|      0|        if (aliasing_ >= kNoDelta) aliasing_ = kOnPatch;
  ------------------
  |  Branch (134:13): [True: 0, False: 0]
  ------------------
  135|      0|        return buffer_;
  136|      0|      }
  137|      0|      GOOGLE_DCHECK(size_ == 0) << size_;
  ------------------
  |  |  181|      0|#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
  |  |  ------------------
  |  |  |  |  154|      0|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      0|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  |  Branch (181:41): [Folded, False: 0]
  |  |  ------------------
  ------------------
  138|      0|    }
  139|      0|    overall_limit_ = 0;  // Next failed, no more needs for next
  140|      0|  }
  141|       |  // End of stream or array
  142|      1|  if (aliasing_ == kNoDelta) {
  ------------------
  |  Branch (142:7): [True: 0, False: 1]
  ------------------
  143|       |    // If there is no more block and aliasing is true, the previous block
  144|       |    // is still valid and we can alias. We have users relying on string_view's
  145|       |    // obtained from protos to outlive the proto, when the parse was from an
  146|       |    // array. This guarantees string_view's are always aliased if parsed from
  147|       |    // an array.
  148|      0|    aliasing_ = reinterpret_cast<std::uintptr_t>(buffer_end_) -
  149|      0|                reinterpret_cast<std::uintptr_t>(buffer_);
  150|      0|  }
  151|      1|  next_chunk_ = nullptr;
  152|      1|  buffer_end_ = buffer_ + kSlopBytes;
  153|      1|  size_ = 0;
  154|      1|  return buffer_;
  155|      1|}

_ZN6google8protobuf8internal20RepeatedPtrFieldBase14InternalExtendEi:
   50|      8|void** RepeatedPtrFieldBase::InternalExtend(int extend_amount) {
   51|      8|  int new_size = current_size_ + extend_amount;
   52|      8|  if (total_size_ >= new_size) {
  ------------------
  |  Branch (52:7): [True: 0, False: 8]
  ------------------
   53|       |    // N.B.: rep_ is non-NULL because extend_amount is always > 0, hence
   54|       |    // total_size must be non-zero since it is lower-bounded by new_size.
   55|      0|    return &rep_->elements[current_size_];
   56|      0|  }
   57|      8|  Rep* old_rep = rep_;
   58|      8|  Arena* arena = GetArena();
   59|      8|  new_size = std::max(internal::kRepeatedFieldLowerClampLimit,
   60|      8|                      std::max(total_size_ * 2, new_size));
   61|      8|  GOOGLE_CHECK_LE(new_size, (std::numeric_limits<size_t>::max() - kRepHeaderSize) /
  ------------------
  |  |  159|      0|#define GOOGLE_CHECK_LE(A, B) GOOGLE_CHECK((A) <= (B))
  |  |  ------------------
  |  |  |  |  154|      8|  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
  |  |  |  |  ------------------
  |  |  |  |  |  |  151|      8|  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  147|      0|  ::google::protobuf::internal::LogFinisher() = \
  |  |  |  |  |  |  |  |  148|      0|      ::google::protobuf::internal::LogMessage( \
  |  |  |  |  |  |  |  |  149|      0|          ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (151:3): [True: 8, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   62|      0|                         sizeof(old_rep->elements[0]))
   63|      0|      << "Requested size is too large to fit into size_t.";
   64|      8|  size_t bytes = kRepHeaderSize + sizeof(old_rep->elements[0]) * new_size;
   65|      8|  if (arena == NULL) {
  ------------------
  |  Branch (65:7): [True: 8, False: 0]
  ------------------
   66|      8|    rep_ = reinterpret_cast<Rep*>(::operator new(bytes));
   67|      8|  } else {
   68|      0|    rep_ = reinterpret_cast<Rep*>(Arena::CreateArray<char>(arena, bytes));
   69|      0|  }
   70|      8|#if defined(__GXX_DELETE_WITH_SIZE__) || defined(__cpp_sized_deallocation)
   71|      8|  const int old_total_size = total_size_;
   72|      8|#endif
   73|      8|  total_size_ = new_size;
   74|      8|  if (old_rep && old_rep->allocated_size > 0) {
  ------------------
  |  Branch (74:7): [True: 7, False: 1]
  |  Branch (74:18): [True: 7, False: 0]
  ------------------
   75|      7|    memcpy(rep_->elements, old_rep->elements,
   76|      7|           old_rep->allocated_size * sizeof(rep_->elements[0]));
   77|      7|    rep_->allocated_size = old_rep->allocated_size;
   78|      7|  } else {
   79|      1|    rep_->allocated_size = 0;
   80|      1|  }
   81|      8|  if (arena == NULL) {
  ------------------
  |  Branch (81:7): [True: 8, False: 0]
  ------------------
   82|      8|#if defined(__GXX_DELETE_WITH_SIZE__) || defined(__cpp_sized_deallocation)
   83|      8|    const size_t old_size =
   84|      8|        old_total_size * sizeof(rep_->elements[0]) + kRepHeaderSize;
   85|      8|    ::operator delete(static_cast<void*>(old_rep), old_size);
   86|       |#else
   87|       |    ::operator delete(static_cast<void*>(old_rep));
   88|       |#endif
   89|      8|  }
   90|      8|  return &rep_->elements[current_size_];
   91|      8|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase7ReserveEi:
   93|      8|void RepeatedPtrFieldBase::Reserve(int new_size) {
   94|      8|  if (new_size > current_size_) {
  ------------------
  |  Branch (94:7): [True: 8, False: 0]
  ------------------
   95|      8|    InternalExtend(new_size - current_size_);
   96|      8|  }
   97|      8|}

_ZN6google8protobuf4util6StatusC2Ev:
   89|      1|Status::Status() : error_code_(error::OK) {
   90|      1|}
_ZN6google8protobuf4util6StatusC2ENS1_5error4CodeENS0_11StringPieceE:
   93|      2|    : error_code_(error_code) {
   94|      2|  if (error_code != error::OK) {
  ------------------
  |  Branch (94:7): [True: 2, False: 0]
  ------------------
   95|      2|    error_message_ = error_message.ToString();
   96|      2|  }
   97|      2|}

structurally_valid.cc:_ZN6google8protobuf8internal12_GLOBAL__N_112InitDetectorC2Ev:
  547|      1|  InitDetector() {
  548|      1|    module_initialized_ = true;
  549|      1|  }