LLVMFuzzerInitialize:
   34|      2|extern "C" int LLVMFuzzerInitialize(int *argc, char ***argv) {
   35|      2|  g_processor = std::make_unique<sentencepiece::SentencePieceProcessor>();
   36|       |
   37|       |  // Load the model from the embedded byte array
   38|      2|  std::string model_data(
   39|      2|      reinterpret_cast<const char *>(kEmbeddedModelData),
   40|      2|      kEmbeddedModelSize);
   41|      2|  auto status = g_processor->LoadFromSerializedProto(model_data);
   42|      2|  if (!status.ok()) {
  ------------------
  |  Branch (42:7): [True: 0, False: 2]
  ------------------
   43|      0|    fprintf(stderr, "Failed to load embedded model: %s\n",
   44|      0|            status.ToString().c_str());
   45|      0|    abort();
   46|      0|  }
   47|       |
   48|      2|  return 0;
   49|      2|}
LLVMFuzzerTestOneInput:
   51|  2.30k|extern "C" int LLVMFuzzerTestOneInput(const uint8_t *data, size_t size) {
   52|  2.30k|  if (!g_processor || size < 2)
  ------------------
  |  Branch (52:7): [True: 0, False: 2.30k]
  |  Branch (52:23): [True: 1, False: 2.30k]
  ------------------
   53|      1|    return 0;
   54|       |
   55|  2.30k|  FuzzedDataProvider fdp(data, size);
   56|  2.30k|  uint8_t ops = fdp.ConsumeIntegral<uint8_t>();
   57|  2.30k|  std::string text = fdp.ConsumeRemainingBytesAsString();
   58|       |
   59|       |  // === Core encoding operations ===
   60|  2.30k|  if (ops & 0x01) {
  ------------------
  |  Branch (60:7): [True: 1.57k, False: 735]
  ------------------
   61|       |    // Encode to pieces (strings)
   62|  1.57k|    std::vector<std::string> pieces;
   63|  1.57k|    g_processor->Encode(text, &pieces);
   64|       |
   65|       |    // Decode back from pieces
   66|  1.57k|    if (!pieces.empty()) {
  ------------------
  |  Branch (66:9): [True: 1.54k, False: 21]
  ------------------
   67|  1.54k|      std::string decoded;
   68|  1.54k|      g_processor->Decode(pieces, &decoded);
   69|  1.54k|    }
   70|  1.57k|  }
   71|       |
   72|  2.30k|  if (ops & 0x02) {
  ------------------
  |  Branch (72:7): [True: 1.63k, False: 671]
  ------------------
   73|       |    // Encode to IDs
   74|  1.63k|    std::vector<int> ids;
   75|  1.63k|    g_processor->Encode(text, &ids);
   76|       |
   77|       |    // Decode back from IDs
   78|  1.63k|    if (!ids.empty()) {
  ------------------
  |  Branch (78:9): [True: 1.61k, False: 17]
  ------------------
   79|  1.61k|      std::string decoded;
   80|  1.61k|      g_processor->Decode(ids, &decoded);
   81|  1.61k|    }
   82|  1.63k|  }
   83|       |
   84|       |  // === Advanced encoding operations ===
   85|  2.30k|  if (ops & 0x04) {
  ------------------
  |  Branch (85:7): [True: 1.53k, False: 767]
  ------------------
   86|       |    // NBest encoding - use small nbest to avoid being too slow
   87|  1.53k|    std::vector<std::vector<std::string>> nbest_pieces;
   88|  1.53k|    g_processor->NBestEncode(text, 3, &nbest_pieces);
   89|       |
   90|       |    // NBest encode to IDs
   91|  1.53k|    std::vector<std::vector<int>> nbest_ids;
   92|  1.53k|    g_processor->NBestEncode(text, 3, &nbest_ids);
   93|  1.53k|  }
   94|       |
   95|  2.30k|  if (ops & 0x08) {
  ------------------
  |  Branch (95:7): [True: 1.41k, False: 889]
  ------------------
   96|       |    // Sample encoding with various alpha values
   97|  1.41k|    std::vector<std::string> sampled;
   98|  1.41k|    g_processor->SampleEncode(text, -1, 0.5, &sampled);
   99|       |
  100|  1.41k|    std::vector<int> sampled_ids;
  101|  1.41k|    g_processor->SampleEncode(text, -1, 0.1, &sampled_ids);
  102|  1.41k|  }
  103|       |
  104|  2.30k|  if (ops & 0x10) {
  ------------------
  |  Branch (104:7): [True: 1.52k, False: 782]
  ------------------
  105|       |    // Upstream removed the *AsSerializedProto family; the piece-returning
  106|       |    // overloads reach the same encode paths. They are [[nodiscard]], so the
  107|       |    // results are kept alive.
  108|  1.52k|    auto pieces = g_processor->EncodeAsPieces(text);
  109|  1.52k|    (void)pieces;
  110|       |
  111|  1.52k|    auto nb_pieces = g_processor->NBestEncodeAsPieces(text, 2);
  112|  1.52k|    (void)nb_pieces;
  113|       |
  114|  1.52k|    auto sample_pieces = g_processor->SampleEncodeAsPieces(text, -1, 0.5);
  115|  1.52k|    (void)sample_pieces;
  116|  1.52k|  }
  117|       |
  118|       |  // === Normalization ===
  119|  2.30k|  if (ops & 0x20) {
  ------------------
  |  Branch (119:7): [True: 1.70k, False: 596]
  ------------------
  120|  1.70k|    std::string normalized;
  121|  1.70k|    g_processor->Normalize(text, &normalized);
  122|       |
  123|       |    // Normalize with alignment info
  124|  1.70k|    std::string normalized2;
  125|  1.70k|    std::vector<size_t> norm_to_orig;
  126|  1.70k|    g_processor->Normalize(text, &normalized2, &norm_to_orig);
  127|  1.70k|  }
  128|       |
  129|       |  // === Vocabulary operations ===
  130|  2.30k|  if (ops & 0x40) {
  ------------------
  |  Branch (130:7): [True: 1.69k, False: 608]
  ------------------
  131|       |    // PieceToId with fuzz text
  132|  1.69k|    g_processor->PieceToId(text);
  133|       |
  134|       |    // Try splitting text into substrings and looking them up
  135|  1.69k|    if (text.size() > 2) {
  ------------------
  |  Branch (135:9): [True: 1.60k, False: 88]
  ------------------
  136|  13.7k|      for (size_t i = 0; i < text.size() && i < 8; i++) {
  ------------------
  |  Branch (136:26): [True: 13.4k, False: 239]
  |  Branch (136:45): [True: 12.0k, False: 1.37k]
  ------------------
  137|  12.0k|        std::string sub = text.substr(0, i + 1);
  138|  12.0k|        int id = g_processor->PieceToId(sub);
  139|  12.0k|        if (id >= 0 && id < g_processor->GetPieceSize()) {
  ------------------
  |  Branch (139:13): [True: 12.0k, False: 0]
  |  Branch (139:24): [True: 12.0k, False: 0]
  ------------------
  140|  12.0k|          g_processor->IdToPiece(id);
  141|  12.0k|          g_processor->GetScore(id);
  142|  12.0k|          g_processor->IsUnknown(id);
  143|  12.0k|          g_processor->IsControl(id);
  144|  12.0k|          g_processor->IsUnused(id);
  145|  12.0k|          g_processor->IsByte(id);
  146|  12.0k|        }
  147|  12.0k|      }
  148|  1.60k|    }
  149|  1.69k|  }
  150|       |
  151|       |  // Upstream removed CalculateEntropy(). Exercise the sampling path it used
  152|       |  // to sit on instead, so this branch still does work.
  153|  2.30k|  if (ops & 0x80) {
  ------------------
  |  Branch (153:7): [True: 1.39k, False: 909]
  ------------------
  154|  1.39k|    if (text.size() > 0 && text.size() < 256) {
  ------------------
  |  Branch (154:9): [True: 1.39k, False: 0]
  |  Branch (154:28): [True: 848, False: 548]
  ------------------
  155|    848|      auto sampled_pieces = g_processor->SampleEncodeAsPieces(text, 8, 0.5);
  156|    848|      (void)sampled_pieces;
  157|    848|    }
  158|  1.39k|  }
  159|       |
  160|  2.30k|  return 0;
  161|  2.30k|}

_ZN4absl12lts_202608176c_copyINS0_4SpanIKjEEPjEENSt3__19enable_ifIXaasr28container_algorithm_internal10IsIteratorIu14__remove_cvrefIT0_EEE5valuentsr28container_algorithm_internal23IsMultidimensionalArrayIu20__remove_reference_tIT_EEE5valueEu7__decayIS8_EE4typeERKSA_OS8_:
  616|      8|c_copy(const InputSequence& input, OutputIterator&& output) {
  617|      8|  return std::copy(container_algorithm_internal::c_begin(input),
  618|      8|                   container_algorithm_internal::c_end(input),
  619|      8|                   std::forward<OutputIterator>(output));
  620|      8|}
_ZN4absl12lts_2026081728container_algorithm_internal7c_beginIKNS0_4SpanIKjEEEEDTcl5beginclsr3stdE7declvalIRT_EEEES8_:
  111|      8|constexpr ContainerIter<C> c_begin(C& c) {
  112|      8|  return begin(c);
  113|      8|}
_ZN4absl12lts_2026081728container_algorithm_internal5c_endIKNS0_4SpanIKjEEEEDTcl5beginclsr3stdE7declvalIRT_EEEES8_:
  116|      8|constexpr ContainerIter<C> c_end(C& c) {
  117|      8|  return end(c);
  118|      8|}

_ZN4absl12lts_2026081713base_internal16SchedulingHelperC2ENS1_14SchedulingModeE:
  118|      2|  explicit SchedulingHelper(base_internal::SchedulingMode mode) : mode_(mode) {
  119|      2|    if (mode_ == base_internal::SCHEDULE_KERNEL_ONLY) {
  ------------------
  |  Branch (119:9): [True: 0, False: 2]
  ------------------
  120|      0|      guard_result_ = base_internal::SchedulingGuard::DisableRescheduling();
  121|      0|    }
  122|      2|  }
_ZN4absl12lts_2026081713base_internal16SchedulingHelperD2Ev:
  124|      2|  ~SchedulingHelper() {
  125|      2|    if (mode_ == base_internal::SCHEDULE_KERNEL_ONLY) {
  ------------------
  |  Branch (125:9): [True: 0, False: 2]
  ------------------
  126|      0|      base_internal::SchedulingGuard::EnableRescheduling(guard_result_);
  127|      0|    }
  128|      2|  }
_ZN4absl12lts_2026081713base_internal11ControlWordEPNS0_9once_flagE:
  195|  5.85k|    once_flag* absl_nonnull flag) {
  196|  5.85k|  return &flag->control_;
  197|  5.85k|}
_ZN4absl12lts_202608179call_onceIRFvvEJEEEvRNS0_9once_flagEOT_DpOT0_:
  215|      1|    call_once(absl::once_flag& flag, Callable&& fn, Args&&... args) {
  216|      1|  std::atomic<uint32_t>* once = base_internal::ControlWord(&flag);
  217|      1|  uint32_t s = once->load(std::memory_order_acquire);
  218|      1|  if (ABSL_PREDICT_FALSE(s != base_internal::kOnceDone)) {
  ------------------
  |  |  190|      1|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 1]
  |  |  |  Branch (190:58): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  219|      1|    base_internal::CallOnceImpl(
  220|      1|        once, base_internal::SCHEDULE_COOPERATIVE_AND_KERNEL,
  221|      1|        std::forward<Callable>(fn), std::forward<Args>(args)...);
  222|      1|  }
  223|      1|}
_ZN4absl12lts_2026081713base_internal12CallOnceImplIRFvvEJEEEvPNSt3__16atomicIjEENS1_14SchedulingModeEOT_DpOT0_:
  155|      1|                 Args&&... args) {
  156|       |#ifndef NDEBUG
  157|       |  {
  158|       |    uint32_t old_control = control->load(std::memory_order_relaxed);
  159|       |    if (old_control != kOnceInit &&
  160|       |        old_control != kOnceRunning &&
  161|       |        old_control != kOnceWaiter &&
  162|       |        old_control != kOnceDone) {
  163|       |      // Memory corruption may cause this error.
  164|       |      ABSL_RAW_LOG(FATAL, "Unexpected value for control word: 0x%lx",
  165|       |                   static_cast<unsigned long>(old_control));  // NOLINT
  166|       |    }
  167|       |  }
  168|       |#endif  // NDEBUG
  169|      1|  static const base_internal::SpinLockWaitTransition trans[] = {
  170|      1|      {kOnceInit, kOnceRunning, true},
  171|      1|      {kOnceRunning, kOnceWaiter, false},
  172|      1|      {kOnceDone, kOnceDone, true}};
  173|       |
  174|       |  // Must do this before potentially modifying control word's state.
  175|      1|  base_internal::SchedulingHelper maybe_disable_scheduling(scheduling_mode);
  176|       |  // Short circuit the simplest case to avoid procedure call overhead.
  177|       |  // The base_internal::SpinLockWait() call returns either kOnceInit or
  178|       |  // kOnceDone. If it returns kOnceDone, it must have loaded the control word
  179|       |  // with std::memory_order_acquire and seen a value of kOnceDone.
  180|      1|  uint32_t old_control = kOnceInit;
  181|      1|  if (control->compare_exchange_strong(old_control, kOnceRunning,
  ------------------
  |  Branch (181:7): [True: 1, False: 0]
  ------------------
  182|      1|                                       std::memory_order_relaxed) ||
  183|      0|      base_internal::SpinLockWait(control, std::size(trans), trans,
  ------------------
  |  Branch (183:7): [True: 0, False: 0]
  ------------------
  184|      1|                                  scheduling_mode) == kOnceInit) {
  185|      1|    std::invoke(std::forward<Callable>(fn), std::forward<Args>(args)...);
  186|      1|    old_control =
  187|      1|        control->exchange(base_internal::kOnceDone, std::memory_order_release);
  188|      1|    if (old_control == base_internal::kOnceWaiter) {
  ------------------
  |  Branch (188:9): [True: 0, False: 1]
  ------------------
  189|      0|      base_internal::SpinLockWake(control, true);
  190|      0|    }
  191|      1|  }  // else *control is already kOnceDone
  192|      1|}
log_sink_set.cc:_ZN4absl12lts_202608179call_onceIZNS0_12log_internal12_GLOBAL__N_113StderrLogSink4SendERKNS0_8LogEntryEEUlvE_JEEEvRNS0_9once_flagEOT_DpOT0_:
  215|  5.85k|    call_once(absl::once_flag& flag, Callable&& fn, Args&&... args) {
  216|  5.85k|  std::atomic<uint32_t>* once = base_internal::ControlWord(&flag);
  217|  5.85k|  uint32_t s = once->load(std::memory_order_acquire);
  218|  5.85k|  if (ABSL_PREDICT_FALSE(s != base_internal::kOnceDone)) {
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 1, False: 5.85k]
  |  |  ------------------
  ------------------
  219|      1|    base_internal::CallOnceImpl(
  220|      1|        once, base_internal::SCHEDULE_COOPERATIVE_AND_KERNEL,
  221|      1|        std::forward<Callable>(fn), std::forward<Args>(args)...);
  222|      1|  }
  223|  5.85k|}
log_sink_set.cc:_ZN4absl12lts_2026081713base_internal12CallOnceImplIZNS0_12log_internal12_GLOBAL__N_113StderrLogSink4SendERKNS0_8LogEntryEEUlvE_JEEEvPNSt3__16atomicIjEENS1_14SchedulingModeEOT_DpOT0_:
  155|      1|                 Args&&... args) {
  156|       |#ifndef NDEBUG
  157|       |  {
  158|       |    uint32_t old_control = control->load(std::memory_order_relaxed);
  159|       |    if (old_control != kOnceInit &&
  160|       |        old_control != kOnceRunning &&
  161|       |        old_control != kOnceWaiter &&
  162|       |        old_control != kOnceDone) {
  163|       |      // Memory corruption may cause this error.
  164|       |      ABSL_RAW_LOG(FATAL, "Unexpected value for control word: 0x%lx",
  165|       |                   static_cast<unsigned long>(old_control));  // NOLINT
  166|       |    }
  167|       |  }
  168|       |#endif  // NDEBUG
  169|      1|  static const base_internal::SpinLockWaitTransition trans[] = {
  170|      1|      {kOnceInit, kOnceRunning, true},
  171|      1|      {kOnceRunning, kOnceWaiter, false},
  172|      1|      {kOnceDone, kOnceDone, true}};
  173|       |
  174|       |  // Must do this before potentially modifying control word's state.
  175|      1|  base_internal::SchedulingHelper maybe_disable_scheduling(scheduling_mode);
  176|       |  // Short circuit the simplest case to avoid procedure call overhead.
  177|       |  // The base_internal::SpinLockWait() call returns either kOnceInit or
  178|       |  // kOnceDone. If it returns kOnceDone, it must have loaded the control word
  179|       |  // with std::memory_order_acquire and seen a value of kOnceDone.
  180|      1|  uint32_t old_control = kOnceInit;
  181|      1|  if (control->compare_exchange_strong(old_control, kOnceRunning,
  ------------------
  |  Branch (181:7): [True: 1, False: 0]
  ------------------
  182|      1|                                       std::memory_order_relaxed) ||
  183|      0|      base_internal::SpinLockWait(control, std::size(trans), trans,
  ------------------
  |  Branch (183:7): [True: 0, False: 0]
  ------------------
  184|      1|                                  scheduling_mode) == kOnceInit) {
  185|      1|    std::invoke(std::forward<Callable>(fn), std::forward<Args>(args)...);
  186|      1|    old_control =
  187|      1|        control->exchange(base_internal::kOnceDone, std::memory_order_release);
  188|      1|    if (old_control == base_internal::kOnceWaiter) {
  ------------------
  |  Branch (188:9): [True: 0, False: 1]
  ------------------
  189|      0|      base_internal::SpinLockWake(control, true);
  190|      0|    }
  191|      1|  }  // else *control is already kOnceDone
  192|      1|}

_ZN4absl12lts_2026081713little_endian10FromHost16Et:
  103|  5.85k|inline uint16_t FromHost16(uint16_t x) { return x; }
_ZN4absl12lts_2026081713little_endian10FromHost64Em:
  109|  1.71M|inline uint64_t FromHost64(uint64_t x) { return x; }
_ZN4absl12lts_2026081713little_endian8ToHost64Em:
  110|  44.1M|inline uint64_t ToHost64(uint64_t x) { return x; }
_ZN4absl12lts_2026081713little_endian6ToHostEm:
  136|  42.5M|inline uint64_t ToHost(uint64_t x) { return ToHost64(x); }
_ZN4absl12lts_2026081713little_endian7Store16EPvt:
  164|  5.85k|inline void Store16(void* absl_nonnull p, uint16_t v) {
  165|  5.85k|  ABSL_INTERNAL_UNALIGNED_STORE16(p, FromHost16(v));
  ------------------
  |  |   81|  5.85k|  (absl::base_internal::UnalignedStore16(_p, _val))
  ------------------
  166|  5.85k|}
_ZN4absl12lts_2026081713little_endian6Load64EPKv:
  176|  1.63M|inline uint64_t Load64(const void* absl_nonnull p) {
  177|  1.63M|  return ToHost64(ABSL_INTERNAL_UNALIGNED_LOAD64(p));
  ------------------
  |  |   78|  1.63M|  (absl::base_internal::UnalignedLoad64(_p))
  ------------------
  178|  1.63M|}
_ZN4absl12lts_2026081713little_endian7Store64EPvm:
  180|  1.71M|inline void Store64(void* absl_nonnull p, uint64_t v) {
  181|  1.71M|  ABSL_INTERNAL_UNALIGNED_STORE64(p, FromHost64(v));
  ------------------
  |  |   85|  1.71M|  (absl::base_internal::UnalignedStore64(_p, _val))
  ------------------
  182|  1.71M|}

_ZN4absl12lts_2026081713base_internal10ErrnoSaverC2Ev:
   31|  5.85k|  ErrnoSaver() : saved_errno_(errno) {}
_ZN4absl12lts_2026081713base_internal10ErrnoSaverD2Ev:
   32|  5.85k|  ~ErrnoSaver() { errno = saved_errno_; }

_ZN4absl12lts_2026081713base_internal17HardeningAssertLTImmEEvT_T0_:
   92|   392M|constexpr void HardeningAssertLT(T1 val1, T2 val2) {
   93|   392M|  ABSL_ASSERT(val1 < val2);
  ------------------
  |  |  131|   392M|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|   392M|#define ABSL_INTERNAL_UNEVALUATED(expr) (decltype((void)(expr))())
  |  |  ------------------
  ------------------
   94|       |#if (ABSL_OPTION_HARDENED == 1 || ABSL_OPTION_HARDENED == 2) && defined(NDEBUG)
   95|       |  if (!ABSL_PREDICT_TRUE(val1 < val2)) {
   96|       |    ABSL_INTERNAL_HARDENING_ABORT();
   97|       |  }
   98|       |#endif
   99|   392M|}
_ZN4absl12lts_2026081713base_internal17HardeningAssertLEImmEEvT_T0_:
  102|  81.2M|constexpr void HardeningAssertLE(T1 val1, T2 val2) {
  103|  81.2M|  ABSL_ASSERT(val1 <= val2);
  ------------------
  |  |  131|  81.2M|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|  81.2M|#define ABSL_INTERNAL_UNEVALUATED(expr) (decltype((void)(expr))())
  |  |  ------------------
  ------------------
  104|       |#if (ABSL_OPTION_HARDENED == 1 || ABSL_OPTION_HARDENED == 2) && defined(NDEBUG)
  105|       |  if (!ABSL_PREDICT_TRUE(val1 <= val2)) {
  106|       |    ABSL_INTERNAL_HARDENING_ABORT();
  107|       |  }
  108|       |#endif
  109|  81.2M|}
_ZN4absl12lts_2026081713base_internal17HardeningAssertGEImmEEvT_T0_:
   82|  82.0M|constexpr void HardeningAssertGE(T1 val1, T2 val2) {
   83|  82.0M|  ABSL_ASSERT(val1 >= val2);
  ------------------
  |  |  131|  82.0M|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  ------------------
  |  |  |  |   87|  82.0M|#define ABSL_INTERNAL_UNEVALUATED(expr) (decltype((void)(expr))())
  |  |  ------------------
  ------------------
   84|       |#if (ABSL_OPTION_HARDENED == 1 || ABSL_OPTION_HARDENED == 2) && defined(NDEBUG)
   85|       |  if (!ABSL_PREDICT_TRUE(val1 >= val2)) {
   86|       |    ABSL_INTERNAL_HARDENING_ABORT();
   87|       |  }
   88|       |#endif
   89|  82.0M|}

_ZN4absl12lts_2026081713base_internal8SpinLockC2Ev:
   62|      8|  constexpr SpinLock() : lockword_(kSpinLockCooperative) { RegisterWithTsan(); }
_ZN4absl12lts_2026081713base_internal8SpinLock16RegisterWithTsanEv:
  221|      8|  constexpr void RegisterWithTsan() {
  222|      8|#if ABSL_HAVE_BUILTIN(__builtin_is_constant_evaluated)
  223|      8|    if (!__builtin_is_constant_evaluated()) {
  ------------------
  |  Branch (223:9): [True: 8, Folded]
  ------------------
  224|      8|      ABSL_TSAN_MUTEX_CREATE(this, __tsan_mutex_not_static);
  225|      8|    }
  226|      8|#endif
  227|      8|  }
_ZN4absl12lts_2026081713base_internal14SpinLockHolderC2ERNS1_8SpinLockE:
  257|      9|      : std::lock_guard<SpinLock>(l) {}
_ZN4absl12lts_2026081713base_internal8SpinLock4lockEv:
   98|      9|  inline void lock() ABSL_EXCLUSIVE_LOCK_FUNCTION() {
   99|      9|    ABSL_TSAN_MUTEX_PRE_LOCK(this, 0);
  100|      9|    if (!TryLockImpl()) {
  ------------------
  |  Branch (100:9): [True: 0, False: 9]
  ------------------
  101|      0|      SlowLock();
  102|      0|    }
  103|      9|    ABSL_TSAN_MUTEX_POST_LOCK(this, 0, 0);
  104|      9|  }
_ZN4absl12lts_2026081713base_internal8SpinLock11TryLockImplEv:
  238|      9|  inline bool TryLockImpl() {
  239|      9|    uint32_t lock_value = lockword_.load(std::memory_order_relaxed);
  240|      9|    return (TryLockInternal(lock_value, 0) & kSpinLockHeld) == 0;
  241|      9|  }
_ZN4absl12lts_2026081713base_internal8SpinLock15TryLockInternalEjj:
  282|      9|                                          uint32_t wait_cycles) {
  283|      9|  if ((lock_value & kSpinLockHeld) != 0) {
  ------------------
  |  Branch (283:7): [True: 0, False: 9]
  ------------------
  284|      0|    return lock_value;
  285|      0|  }
  286|       |
  287|      9|  uint32_t sched_disabled_bit = 0;
  288|      9|  if ((lock_value & kSpinLockCooperative) == 0) {
  ------------------
  |  Branch (288:7): [True: 0, False: 9]
  ------------------
  289|       |    // For non-cooperative locks we must make sure we mark ourselves as
  290|       |    // non-reschedulable before we attempt to CompareAndSwap.
  291|      0|    if (SchedulingGuard::DisableRescheduling()) {
  ------------------
  |  Branch (291:9): [True: 0, False: 0]
  ------------------
  292|      0|      sched_disabled_bit = kSpinLockDisabledScheduling;
  293|      0|    }
  294|      0|  }
  295|       |
  296|      9|  if (!lockword_.compare_exchange_strong(
  ------------------
  |  Branch (296:7): [True: 0, False: 9]
  ------------------
  297|      9|          lock_value,
  298|      9|          kSpinLockHeld | lock_value | wait_cycles | sched_disabled_bit,
  299|      9|          std::memory_order_acquire, std::memory_order_relaxed)) {
  300|      0|    SchedulingGuard::EnableRescheduling(sched_disabled_bit != 0);
  301|      0|  }
  302|       |
  303|      9|  return lock_value;
  304|      9|}
_ZN4absl12lts_2026081713base_internal8SpinLock6unlockEv:
  128|      9|  inline void unlock() ABSL_UNLOCK_FUNCTION() {
  129|      9|    ABSL_TSAN_MUTEX_PRE_UNLOCK(this, 0);
  130|      9|    uint32_t lock_value = lockword_.load(std::memory_order_relaxed);
  131|      9|    lock_value = lockword_.exchange(lock_value & kSpinLockCooperative,
  132|      9|                                    std::memory_order_release);
  133|       |
  134|      9|    if ((lock_value & kSpinLockDisabledScheduling) != 0) {
  ------------------
  |  Branch (134:9): [True: 0, False: 9]
  ------------------
  135|      0|      SchedulingGuard::EnableRescheduling(true);
  136|      0|    }
  137|      9|    if ((lock_value & kWaitTimeMask) != 0) {
  ------------------
  |  Branch (137:9): [True: 0, False: 9]
  ------------------
  138|       |      // Collect contentionz profile info, and speed the wakeup of any waiter.
  139|       |      // The wait_cycles value indicates how long this thread spent waiting
  140|       |      // for the lock.
  141|      0|      SlowUnlock(lock_value);
  142|      0|    }
  143|      9|    ABSL_TSAN_MUTEX_POST_UNLOCK(this, 0);
  144|      9|  }

_ZN4absl12lts_2026081713base_internal6GetTIDEv:
  407|      1|pid_t GetTID() { return static_cast<pid_t>(syscall(SYS_gettid)); }
_ZN4absl12lts_2026081713base_internal12GetCachedTIDEv:
  489|  5.85k|pid_t GetCachedTID() {
  490|       |#ifdef __ANDROID__
  491|       |// NDK defaults to emulated TLS for API < 29, and native ELF TLS for API >= 29.
  492|       |// Emulated TLS is slower than bionic's internal caching.
  493|       |#if __ANDROID_API__ < 29
  494|       |#define ABSL_INTERNAL_USING_EMULATED_TLS 1
  495|       |#endif
  496|       |#endif
  497|       |
  498|  5.85k|#if defined(ABSL_HAVE_THREAD_LOCAL) && \
  499|  5.85k|    !defined(ABSL_INTERNAL_USING_EMULATED_TLS)
  500|  5.85k|  static thread_local pid_t thread_id = GetTID();
  501|  5.85k|  return thread_id;
  502|       |#else
  503|       |  return GetTID();
  504|       |#endif  // defined(ABSL_HAVE_THREAD_LOCAL) &&
  505|       |        // !defined(ABSL_INTERNAL_USING_EMULATED_TLS)
  506|  5.85k|#undef ABSL_INTERNAL_USING_EMULATED_TLS
  507|  5.85k|}

_ZN4absl12lts_2026081713base_internal15UnalignedLoad32EPKv:
   45|   661M|inline uint32_t UnalignedLoad32(const void* absl_nonnull p) {
   46|   661M|  uint32_t t;
   47|   661M|  memcpy(&t, p, sizeof t);
   48|   661M|  return t;
   49|   661M|}
_ZN4absl12lts_2026081713base_internal15UnalignedLoad64EPKv:
   51|  1.04G|inline uint64_t UnalignedLoad64(const void* absl_nonnull p) {
   52|  1.04G|  uint64_t t;
   53|  1.04G|  memcpy(&t, p, sizeof t);
   54|  1.04G|  return t;
   55|  1.04G|}
_ZN4absl12lts_2026081713base_internal16UnalignedStore16EPvt:
   57|  5.85k|inline void UnalignedStore16(void* absl_nonnull p, uint16_t v) {
   58|  5.85k|  memcpy(p, &v, sizeof v);
   59|  5.85k|}
_ZN4absl12lts_2026081713base_internal16UnalignedStore64EPvm:
   65|  1.71M|inline void UnalignedStore64(void* absl_nonnull p, uint64_t v) {
   66|  1.71M|  memcpy(p, &v, sizeof v);
   67|  1.71M|}

_ZN4absl12lts_2026081715LogSeverityNameENS0_11LogSeverityE:
  101|  5.85k|constexpr const char* LogSeverityName(absl::LogSeverity s) {
  102|  5.85k|  switch (s) {
  ------------------
  |  Branch (102:11): [True: 5.85k, False: 0]
  ------------------
  103|      0|    case absl::LogSeverity::kInfo: return "INFO";
  ------------------
  |  Branch (103:5): [True: 0, False: 5.85k]
  ------------------
  104|  5.85k|    case absl::LogSeverity::kWarning: return "WARNING";
  ------------------
  |  Branch (104:5): [True: 5.85k, False: 0]
  ------------------
  105|      0|    case absl::LogSeverity::kError: return "ERROR";
  ------------------
  |  Branch (105:5): [True: 0, False: 5.85k]
  ------------------
  106|      0|    case absl::LogSeverity::kFatal: return "FATAL";
  ------------------
  |  Branch (106:5): [True: 0, False: 5.85k]
  ------------------
  107|  5.85k|  }
  108|      0|  return "UNKNOWN";
  109|  5.85k|}
_ZN4absl12lts_2026081720NormalizeLogSeverityENS0_11LogSeverityE:
  115|  5.85k|constexpr absl::LogSeverity NormalizeLogSeverity(absl::LogSeverity s) {
  116|  5.85k|  absl::LogSeverity n = s;
  117|  5.85k|  if (n < absl::LogSeverity::kInfo) n = absl::LogSeverity::kInfo;
  ------------------
  |  Branch (117:7): [True: 0, False: 5.85k]
  ------------------
  118|  5.85k|  if (n > absl::LogSeverity::kFatal) n = absl::LogSeverity::kError;
  ------------------
  |  Branch (118:7): [True: 0, False: 5.85k]
  ------------------
  119|  5.85k|  return n;
  120|  5.85k|}
_ZN4absl12lts_20260817ltENS0_11LogSeverityENS0_18LogSeverityAtLeastE:
  165|  11.7k|  constexpr bool operator op2(absl::LogSeverity lhs, absl::T rhs) { \
  166|  11.7k|    return lhs op2 static_cast<absl::LogSeverity>(rhs);             \
  167|  11.7k|  }

_ZN4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEEC2EOSB_:
  129|      2|      : impl_(std::move(x)) {}
_ZN4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEE13PlacementImplC2IJSB_EEEDpOT_:
  160|      2|    explicit PlacementImpl(Args&&... args) {
  161|      2|      new (&space_) T(std::forward<Args>(args)...);
  162|      2|    }
_ZN4absl12lts_2026081712NoDestructorINS0_13flat_hash_mapINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS8_8StringEqENS3_9allocatorINS3_4pairIKS7_hEEEEEEEC2EOSG_:
  129|      2|      : impl_(std::move(x)) {}
_ZN4absl12lts_2026081712NoDestructorINS0_13flat_hash_mapINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS8_8StringEqENS3_9allocatorINS3_4pairIKS7_hEEEEEEE13PlacementImplC2IJSG_EEEDpOT_:
  160|      2|    explicit PlacementImpl(Args&&... args) {
  161|      2|      new (&space_) T(std::forward<Args>(args)...);
  162|      2|    }
_ZNK4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEEdeEv:
  140|   253M|  const T& operator*() const { return *get(); }
_ZNK4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEE3getEv:
  142|   253M|  const T* absl_nonnull get() const { return impl_.get(); }
_ZNK4absl12lts_2026081712NoDestructorINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEE13PlacementImpl3getEv:
  163|   253M|    const T* absl_nonnull get() const {
  164|   253M|      return std::launder(reinterpret_cast<const T*>(&space_));
  165|   253M|    }
_ZNK4absl12lts_2026081712NoDestructorINS0_13flat_hash_mapINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS8_8StringEqENS3_9allocatorINS3_4pairIKS7_hEEEEEEEptEv:
  141|   194M|  const T* absl_nonnull operator->() const { return get(); }
_ZNK4absl12lts_2026081712NoDestructorINS0_13flat_hash_mapINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS8_8StringEqENS3_9allocatorINS3_4pairIKS7_hEEEEEEE3getEv:
  142|   194M|  const T* absl_nonnull get() const { return impl_.get(); }
_ZNK4absl12lts_2026081712NoDestructorINS0_13flat_hash_mapINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS8_8StringEqENS3_9allocatorINS3_4pairIKS7_hEEEEEEE13PlacementImpl3getEv:
  163|   194M|    const T* absl_nonnull get() const {
  164|   194M|      return std::launder(reinterpret_cast<const T*>(&space_));
  165|   194M|    }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEEC2IJETnNSt3__19enable_ifIXntsr3stdE9is_same_vIFvDpRu7__decayIT_EEFvRS5_EEEiE4typeELi0EEEDpOS9_:
  122|      1|      : impl_(std::forward<Ts>(args)...) {}
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEE13PlacementImplC2IJEEEDpOT_:
  160|      1|    explicit PlacementImpl(Args&&... args) {
  161|      1|      new (&space_) T(std::forward<Args>(args)...);
  162|      1|    }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_113StderrLogSinkEEC2IJETnNSt3__19enable_ifIXntsr3stdE9is_same_vIFvDpRu7__decayIT_EEFvRS5_EEEiE4typeELi0EEEDpOS9_:
  122|      1|      : impl_(std::forward<Ts>(args)...) {}
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_113StderrLogSinkEE13PlacementImplC2IJEEEDpOT_:
  160|      1|    explicit PlacementImpl(Args&&... args) {
  161|      1|      new (&space_) T(std::forward<Args>(args)...);
  162|      1|    }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_113StderrLogSinkEE3getEv:
  139|      1|  T* absl_nonnull get() { return impl_.get(); }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_113StderrLogSinkEE13PlacementImpl3getEv:
  166|      1|    T* absl_nonnull get() {
  167|      1|      return std::launder(reinterpret_cast<T*>(&space_));
  168|      1|    }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEEdeEv:
  137|  5.85k|  T& operator*() { return *get(); }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEE3getEv:
  139|  5.85k|  T* absl_nonnull get() { return impl_.get(); }
log_sink_set.cc:_ZN4absl12lts_2026081712NoDestructorINS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSetEE13PlacementImpl3getEv:
  166|  5.85k|    T* absl_nonnull get() {
  167|  5.85k|      return std::launder(reinterpret_cast<T*>(&space_));
  168|  5.85k|    }

_ZN4absl12lts_2026081720PrefetchToLocalCacheEPKv:
  146|   957M|    const void* addr) {
  147|   957M|  __builtin_prefetch(addr, 0, 3);
  148|   957M|}
_ZN4absl12lts_2026081723PrefetchToLocalCacheNtaEPKv:
  151|   794k|    const void* addr) {
  152|   794k|  __builtin_prefetch(addr, 0, 0);
  153|   794k|}
_ZN4absl12lts_2026081728PrefetchToLocalCacheForWriteEPKv:
  156|   189M|    const void* addr) {
  157|       |  // [x86] gcc/clang don't generate PREFETCHW for __builtin_prefetch(.., 1)
  158|       |  // unless -march=broadwell or newer; this is not generally the default, so we
  159|       |  // manually emit prefetchw. PREFETCHW is recognized as a no-op on older Intel
  160|       |  // processors and has been present on AMD processors since the K6-2.
  161|   189M|#if defined(__x86_64__) && !defined(__PRFCHW__)
  162|   189M|  asm("prefetchw %0" : : "m"(*reinterpret_cast<const char*>(addr)));
  163|       |#else
  164|       |  __builtin_prefetch(addr, 1, 3);
  165|       |#endif
  166|   189M|}

log_sink_set.cc:_ZN4absl12lts_2026081711MakeCleanupIJEZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_EENS0_7CleanupINS0_16cleanup_internal3TagET0_EESG_:
  130|  5.85k|absl::Cleanup<cleanup_internal::Tag, Callback> MakeCleanup(Callback callback) {
  131|  5.85k|  static_assert(cleanup_internal::WasDeduced<cleanup_internal::Tag, Args...>(),
  132|  5.85k|                "Explicit template parameters are not supported.");
  133|       |
  134|  5.85k|  static_assert(cleanup_internal::ReturnsVoid<Callback>(),
  135|  5.85k|                "Callbacks that return values are not supported.");
  136|       |
  137|  5.85k|  return {std::move(callback)};
  138|  5.85k|}
log_sink_set.cc:_ZN4absl12lts_202608177CleanupINS0_16cleanup_internal3TagEZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_EC2ESE_:
   94|  5.85k|  Cleanup(Callback callback) : storage_(std::move(callback)) {}  // NOLINT
log_sink_set.cc:_ZN4absl12lts_202608177CleanupINS0_16cleanup_internal3TagEZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_ED2Ev:
  109|  5.85k|  ~Cleanup() {
  110|  5.85k|    if (storage_.IsCallbackEngaged()) {
  ------------------
  |  Branch (110:9): [True: 5.85k, False: 0]
  ------------------
  111|  5.85k|      storage_.InvokeCallback();
  112|  5.85k|      storage_.DestroyCallback();
  113|  5.85k|    }
  114|  5.85k|  }

log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_EC2ESD_:
   49|  5.85k|  explicit Storage(Callback callback) {
   50|       |    // Placement-new into a character buffer is used for eager destruction when
   51|       |    // the cleanup is invoked or cancelled. To ensure this optimizes well, the
   52|       |    // behavior is implemented locally instead of using a std::optional.
   53|  5.85k|    ::new (GetCallbackBuffer()) Callback(std::move(callback));
   54|  5.85k|    is_callback_engaged_ = true;
   55|  5.85k|  }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E17GetCallbackBufferEv:
   72|  17.5k|  void* GetCallbackBuffer() { return static_cast<void*>(callback_buffer_); }
log_sink_set.cc:_ZNK4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E17IsCallbackEngagedEv:
   78|  5.85k|  bool IsCallbackEngaged() const { return is_callback_engaged_; }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E14InvokeCallbackEv:
   85|  5.85k|  void InvokeCallback() ABSL_NO_THREAD_SAFETY_ANALYSIS {
   86|  5.85k|    std::move(GetCallback())();
   87|  5.85k|  }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E11GetCallbackEv:
   74|  11.7k|  Callback& GetCallback() {
   75|  11.7k|    return *reinterpret_cast<Callback*>(GetCallbackBuffer());
   76|  11.7k|  }
log_sink_set.cc:_ZN4absl12lts_2026081716cleanup_internal7StorageIZNS0_12log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbEUlvE_E15DestroyCallbackEv:
   80|  5.85k|  void DestroyCallback() {
   81|  5.85k|    is_callback_engaged_ = false;
   82|  5.85k|    GetCallback().~Callback();
   83|  5.85k|  }

_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE4dataEv:
  210|  1.54k|  const_pointer data() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
  211|  1.54k|    return AsValueType(storage_.begin());
  212|  1.54k|  }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE11AsValueTypeEPS6_:
  428|  2.43k|  static pointer AsValueType(pointer ptr) { return ptr; }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage5beginEv:
  487|  58.9M|    StorageElement* begin() const { return data_; }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE4sizeEv:
  185|  1.54k|  size_type size() const { return storage_.size(); }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage4sizeEv:
  486|  58.9M|    size_type size() const { return size_alloc_.template get<0>(); }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEEC2IPKNS2_12basic_stringIcS5_NS7_IcEEEETnPNS2_9enable_ifIXsr13base_internal22IsAtLeastInputIteratorIT_EE5valueEvE4typeELPv0EEESH_SH_RKS8_:
  167|  1.54k|      : storage_(std::distance(first, last), a) {
  168|  1.54k|    memory_internal::CopyRange(storage_.alloc(), storage_.begin(), first, last);
  169|  1.54k|  }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7StorageC2EmRKS8_:
  476|  1.54k|        : size_alloc_(n, a), data_(InitializeData()) {}
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage14InitializeDataEv:
  502|  1.54k|    StorageElement* InitializeData() {
  503|  1.54k|      if (UsingInlinedStorage(size())) {
  ------------------
  |  Branch (503:11): [True: 665, False: 884]
  ------------------
  504|    665|        InlinedStorage::AnnotateConstruct(size());
  505|    665|        return InlinedStorage::data();
  506|    884|      } else {
  507|    884|        return reinterpret_cast<StorageElement*>(
  508|    884|            AllocatorTraits::allocate(alloc(), size()));
  509|    884|      }
  510|  1.54k|    }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage19UsingInlinedStorageEm:
  495|  3.09k|    static bool UsingInlinedStorage(size_type n) {
  496|  3.09k|      return n <= inline_elements;
  497|  3.09k|    }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE22NonEmptyInlinedStorage17AnnotateConstructEm:
  522|    665|    typename FixedArray<T, N, A>::size_type n) {
  523|       |#ifdef ABSL_HAVE_ADDRESS_SANITIZER
  524|       |  if (!n) return;
  525|       |  ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(data(), RedzoneEnd(), RedzoneEnd(),
  526|       |                                     data() + n);
  527|       |  ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(RedzoneBegin(), data(), data(),
  528|       |                                     RedzoneBegin());
  529|       |#endif  // ABSL_HAVE_ADDRESS_SANITIZER
  530|    665|  static_cast<void>(n);  // Mark used when not in asan mode
  531|    665|}
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE22NonEmptyInlinedStorage4dataEv:
  438|    665|    StorageElement* data() { return reinterpret_cast<StorageElement*>(buff_); }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage5allocEv:
  489|  58.9M|    allocator_type& alloc() { return size_alloc_.template get<1>(); }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7StorageD2Ev:
  478|  1.54k|    ~Storage() noexcept {
  479|  1.54k|      if (UsingInlinedStorage(size())) {
  ------------------
  |  Branch (479:11): [True: 665, False: 884]
  ------------------
  480|    665|        InlinedStorage::AnnotateDestruct(size());
  481|    884|      } else {
  482|    884|        AllocatorTraits::deallocate(alloc(), AsValueType(begin()), size());
  483|    884|      }
  484|  1.54k|    }
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE22NonEmptyInlinedStorage16AnnotateDestructEm:
  535|    665|    typename FixedArray<T, N, A>::size_type n) {
  536|       |#ifdef ABSL_HAVE_ADDRESS_SANITIZER
  537|       |  if (!n) return;
  538|       |  ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(data(), RedzoneEnd(), data() + n,
  539|       |                                     RedzoneEnd());
  540|       |  ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(RedzoneBegin(), data(), RedzoneBegin(),
  541|       |                                     data());
  542|       |#endif  // ABSL_HAVE_ADDRESS_SANITIZER
  543|    665|  static_cast<void>(n);  // Mark used when not in asan mode
  544|    665|}
_ZN4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEED2Ev:
  171|  1.54k|  ~FixedArray() noexcept {
  172|  58.9M|    for (auto* cur = storage_.begin(); cur != storage_.end(); ++cur) {
  ------------------
  |  Branch (172:40): [True: 58.9M, False: 1.54k]
  ------------------
  173|  58.9M|      AllocatorTraits::destroy(storage_.alloc(), cur);
  174|  58.9M|    }
  175|  1.54k|  }
_ZNK4absl12lts_2026081710FixedArrayINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEELm128ENS2_9allocatorIS6_EEE7Storage3endEv:
  488|  58.9M|    StorageElement* end() const { return begin() + size(); }

_ZN4absl12lts_2026081713flat_hash_mapINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEhNS0_18container_internal10StringHashENS7_8StringEqENS2_9allocatorINS2_4pairIKS6_hEEEEEC2Ev:
  205|      2|  flat_hash_map() {}
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5valueEPNS3_4pairIKS7_hEE:
  705|    512|  static V& value(std::pair<const K, V>* kv) { return kv->second; }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE7elementEPNS1_13map_slot_typeIS7_hEE:
  703|   194M|  static std::pair<const K, V>& element(slot_type* slot) { return slot->value; }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5applyINS1_12EqualElementINS3_12basic_stringIcS6_NS3_9allocatorIcEEEENS1_8StringEqEEEJRNS3_4pairIKS7_hEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSL_DpOSM_:
  689|     24|  apply(F&& f, Args&&... args) {
  690|     24|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|     24|                                                   std::forward<Args>(args)...);
  692|     24|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5applyINS1_11HashElementINS1_10StringHashELb1EEEJRNS3_4pairIKS7_hEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSH_DpOSI_:
  689|    884|  apply(F&& f, Args&&... args) {
  690|    884|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|    884|                                                   std::forward<Args>(args)...);
  692|    884|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE8transferINS3_9allocatorINS3_4pairIKS7_hEEEEEEDaPT_PNS1_13map_slot_typeIS7_hEESJ_:
  682|    878|                       slot_type* old_slot) {
  683|    878|    return slot_policy::transfer(alloc, new_slot, old_slot);
  684|    878|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE9constructINS3_9allocatorINS3_4pairIKS7_hEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKNS3_12basic_stringIcS6_NSA_IcEEEEEEENSI_IJEEEEEEvPT_PNS1_13map_slot_typeIS7_hEEDpOT0_:
  670|    512|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  671|    512|    slot_policy::construct(alloc, slot, std::forward<Args>(args)...);
  672|    512|  }
_ZN4absl12lts_2026081713flat_hash_mapINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEiNS0_18container_internal10StringHashENS7_8StringEqENS2_9allocatorINS2_4pairIKS6_iEEEEEC2Ev:
  205|      4|  flat_hash_map() {}
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE5applyINS1_12EqualElementIS7_NS1_8StringEqEEEJRNS3_4pairIKS7_iEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSH_DpOSI_:
  689|   281M|  apply(F&& f, Args&&... args) {
  690|   281M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|   281M|                                                   std::forward<Args>(args)...);
  692|   281M|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE7elementEPNS1_13map_slot_typeIS7_iEE:
  703|   514M|  static std::pair<const K, V>& element(slot_type* slot) { return slot->value; }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE5applyINS1_12raw_hash_setIS8_JEE19EmplaceDecomposableEJRKNS3_12basic_stringIcS6_NS3_9allocatorIcEEEERiEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSK_DpOSL_:
  689|    596|  apply(F&& f, Args&&... args) {
  690|    596|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|    596|                                                   std::forward<Args>(args)...);
  692|    596|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE5applyINS1_12EqualElementINS3_12basic_stringIcS6_NS3_9allocatorIcEEEENS1_8StringEqEEEJRNS3_4pairIKS7_iEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSL_DpOSM_:
  689|     18|  apply(F&& f, Args&&... args) {
  690|     18|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|     18|                                                   std::forward<Args>(args)...);
  692|     18|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE9constructINS3_9allocatorINS3_4pairIKS7_iEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKNS3_12basic_stringIcS6_NSA_IcEEEEEEENSI_IJRiEEEEEEvPT_PNS1_13map_slot_typeIS7_iEEDpOT0_:
  670|    596|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  671|    596|    slot_policy::construct(alloc, slot, std::forward<Args>(args)...);
  672|    596|  }
_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE5applyINS1_12EqualElementIS7_NS1_8StringEqEEEJRNS3_4pairIKS7_hEEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSH_DpOSI_:
  689|  97.4M|  apply(F&& f, Args&&... args) {
  690|  97.4M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|  97.4M|                                                   std::forward<Args>(args)...);
  692|  97.4M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E5applyINS1_12EqualElementIS8_NS1_6HashEqIS8_vE2EqEEEJRNSt3__14pairIKS8_S9_EEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSM_DpOSN_:
  689|  36.6M|  apply(F&& f, Args&&... args) {
  690|  36.6M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|  36.6M|                                                   std::forward<Args>(args)...);
  692|  36.6M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E7elementEPNS1_13map_slot_typeIS8_S9_EE:
  703|   327M|  static std::pair<const K, V>& element(slot_type* slot) { return slot->value; }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E5applyINS1_12raw_hash_setISA_JEE19EmplaceDecomposableEJNSt3__14pairIS8_S9_EEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSI_DpOSJ_:
  689|   204M|  apply(F&& f, Args&&... args) {
  690|   204M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|   204M|                                                   std::forward<Args>(args)...);
  692|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E5applyINS1_11HashElementINS1_6HashEqIS8_vE4HashELb0EEEJRNSt3__14pairIKS8_S9_EEEEEDTclsr4absl18container_internalE13DecomposePairclsr3stdE7declvalIT_EEspclsr3stdE7declvalIT0_EEEEOSM_DpOSN_:
  689|   291M|  apply(F&& f, Args&&... args) {
  690|   291M|    return absl::container_internal::DecomposePair(std::forward<F>(f),
  691|   291M|                                                   std::forward<Args>(args)...);
  692|   291M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E8transferINSt3__19allocatorINSC_4pairIKS8_S9_EEEEEEDaPT_PNS1_13map_slot_typeIS8_S9_EESM_:
  682|   290M|                       slot_type* old_slot) {
  683|   290M|    return slot_policy::transfer(alloc, new_slot, old_slot);
  684|   290M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E9constructINSt3__19allocatorINSC_4pairIKS8_S9_EEEEJRKNSC_21piecewise_construct_tENSC_5tupleIJOS8_EEENSL_IJOS9_EEEEEEvPT_PNS1_13map_slot_typeIS8_S9_EEDpOT0_:
  670|   204M|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  671|   204M|    slot_policy::construct(alloc, slot, std::forward<Args>(args)...);
  672|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081713flat_hash_mapIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS5_NS0_18container_internal6HashEqIS7_vE4HashENSB_2EqENSt3__19allocatorINSE_4pairIKS7_S8_EEEEEC2Ev:
  205|  5.57k|  flat_hash_map() {}

_ZN4absl12lts_2026081713InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS3_EEE4dataEv:
  357|  5.85k|  pointer data() noexcept ABSL_ATTRIBUTE_LIFETIME_BOUND {
  358|  5.85k|    return storage_.GetIsAllocated() ? storage_.GetAllocatedData()
  ------------------
  |  Branch (358:12): [True: 0, False: 5.85k]
  ------------------
  359|  5.85k|                                     : storage_.GetInlinedData();
  360|  5.85k|  }
_ZNK4absl12lts_2026081713InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS3_EEE4sizeEv:
  323|  5.85k|  size_type size() const noexcept { return storage_.GetSize(); }
_ZN4absl12lts_2026081713InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS3_EEEC2Ev:
  128|  5.85k|  InlinedVector() noexcept(noexcept(allocator_type())) : storage_() {}
_ZN4absl12lts_2026081713InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS3_EEED2Ev:
  309|  5.85k|  ~InlinedVector() {}

_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE7elementIS9_EEDTclsrT_7elementfp_EEPNS1_13map_slot_typeIS8_hEE:
   85|   194M|      -> decltype(P::element(slot)) {
   86|   194M|    return P::element(slot);
   87|   194M|  }
_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE8transferINS4_9allocatorINS4_4pairIKS8_hEEEEEEvPT_PNS1_13map_slot_typeIS8_hEESL_:
   75|    878|  static void transfer(Alloc* alloc, slot_type* new_slot, slot_type* old_slot) {
   76|    878|    transfer_impl(alloc, new_slot, old_slot, Rank2{});
   77|    878|  }
_ZN4absl12lts_2026081718container_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|    878|                                                           old_slot)) {
  120|    878|    return P::transfer(alloc, new_slot, old_slot);
  121|    878|  }
_ZN4absl12lts_2026081718container_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|    512|  static void construct(Alloc* alloc, slot_type* slot, Args&&... args) {
   52|    512|    Policy::construct(alloc, slot, std::forward<Args>(args)...);
   53|    512|  }
_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE20transfer_uses_memcpyEv:
   93|      2|  static constexpr bool transfer_uses_memcpy() {
   94|      2|    return std::is_same_v<decltype(transfer_impl<std::allocator<char>>(
   95|      2|                              nullptr, nullptr, nullptr, Rank2{})),
   96|      2|                          std::true_type>;
   97|      2|  }
_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE7elementIS9_EEDTclsrT_7elementfp_EEPNS1_13map_slot_typeIS8_iEE:
   85|   514M|      -> decltype(P::element(slot)) {
   86|   514M|    return P::element(slot);
   87|   514M|  }
_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE9constructINS4_9allocatorINS4_4pairIKS8_iEEEEJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NSC_IcEEEEEEENSK_IJRiEEEEEEvPT_PNS1_13map_slot_typeIS8_iEEDpOT0_:
   51|    596|  static void construct(Alloc* alloc, slot_type* slot, Args&&... args) {
   52|    596|    Policy::construct(alloc, slot, std::forward<Args>(args)...);
   53|    596|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE7elementISB_EEDTclsrT_7elementfp_EEPNS1_13map_slot_typeIS9_SA_EE:
   85|   327M|      -> decltype(P::element(slot)) {
   86|   327M|    return P::element(slot);
   87|   327M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE8transferINSt3__19allocatorINSE_4pairIKS9_SA_EEEEEEvPT_PNS1_13map_slot_typeIS9_SA_EESO_:
   75|   290M|  static void transfer(Alloc* alloc, slot_type* new_slot, slot_type* old_slot) {
   76|   290M|    transfer_impl(alloc, new_slot, old_slot, Rank2{});
   77|   290M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE13transfer_implINSt3__19allocatorINSE_4pairIKS9_SA_EEEESB_EEDTclsrT0_8transferfp_fp0_fp1_EEPT_PNS1_13map_slot_typeIS9_SA_EESQ_NSC_5Rank2E:
  119|   290M|                                                           old_slot)) {
  120|   290M|    return P::transfer(alloc, new_slot, old_slot);
  121|   290M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal20common_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE9constructINSt3__19allocatorINSE_4pairIKS9_SA_EEEEJRKNSE_21piecewise_construct_tENSE_5tupleIJOS9_EEENSN_IJOSA_EEEEEEvPT_PNS1_13map_slot_typeIS9_SA_EEDpOT0_:
   51|   204M|  static void construct(Alloc* alloc, slot_type* slot, Args&&... args) {
   52|   204M|    Policy::construct(alloc, slot, std::forward<Args>(args)...);
   53|   204M|  }

_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJmNSt3__19allocatorINS3_17basic_string_viewIcNS3_11char_traitsIcEEEEEEEE3getILi0EEERKNS1_25internal_compressed_tuple4ElemISA_XT_EE4typeEv:
  245|  58.9M|  constexpr const ElemT<I>& get() const& {
  246|  58.9M|    return StorageT<I>::get();
  247|  58.9M|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm0ENS2_10StorageTagIJmNSt3__19allocatorINS5_17basic_string_viewIcNS5_11char_traitsIcEEEEEEEEELb0EE3getEv:
   90|  58.9M|  constexpr const T& get() const& { return value; }
_ZN4absl12lts_2026081718container_internal15CompressedTupleIJmNSt3__19allocatorINS3_17basic_string_viewIcNS3_11char_traitsIcEEEEEEEEC2IRmJRKS9_ETnNS3_9enable_ifIXsr3stdE13conjunction_vINS3_8negationINS3_7is_sameIFvSA_EFvu7__decayIT_EEEEEENS1_25internal_compressed_tuple27TupleItemsMoveConstructibleISA_JSJ_DpT0_EEEEEbE4typeELb1EEEOSJ_DpOSQ_:
  235|  1.54k|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|  1.54k|                                             std::forward<First>(first),
  237|  1.54k|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJmNSt3__19allocatorINS5_17basic_string_viewIcNS5_11char_traitsIcEEEEEEEEENS5_16integer_sequenceImJLm0ELm1EEEELb1EEC2IJRmRKSB_EEENS5_10in_place_tEDpOT_:
  125|  3.09k|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|  3.09k|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm0ENS2_10StorageTagIJmNSt3__19allocatorINS5_17basic_string_viewIcNS5_11char_traitsIcEEEEEEEEELb0EEC2IRmEENS5_10in_place_tEOT_:
   89|  1.54k|      : value(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorINS4_17basic_string_viewIcNS4_11char_traitsIcEEEEEELm1ENS2_10StorageTagIJmSA_EEELb1EEC2IRKSA_EENS4_10in_place_tEOT_:
  101|  1.54k|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJmNSt3__19allocatorINS3_17basic_string_viewIcNS3_11char_traitsIcEEEEEEEE3getILi1EEERNS1_25internal_compressed_tuple4ElemISA_XT_EE4typeEv:
  240|  58.9M|  constexpr ElemT<I>& get() & {
  241|  58.9M|    return StorageT<I>::get();
  242|  58.9M|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorINS4_17basic_string_viewIcNS4_11char_traitsIcEEEEEELm1ENS2_10StorageTagIJmSA_EEELb1EE3getEv:
  104|  58.9M|  constexpr T& get() & { return *this; }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EE3getEv:
   90|  2.07G|  constexpr const T& get() const& { return value; }
_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi0EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  245|  2.07G|  constexpr const ElemT<I>& get() const& {
  246|  2.07G|    return StorageT<I>::get();
  247|  2.07G|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EE3getEv:
   91|  1.37G|  constexpr T& get() & { return value; }
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi0EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  240|  1.37G|  constexpr ElemT<I>& get() & {
  241|  1.37G|    return StorageT<I>::get();
  242|  1.37G|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqES6_EEELb1EE3getEv:
  104|  1.99k|  constexpr T& get() & { return *this; }
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi3EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  240|  1.99k|  constexpr ElemT<I>& get() & {
  241|  1.99k|    return StorageT<I>::get();
  242|  1.99k|  }
_ZN4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEC2IS3_JS4_S5_S8_ETnNS6_9enable_ifIXsr3stdE13conjunction_vINS6_8negationINS6_7is_sameIFvS9_EFvu7__decayIT_EEEEEENS1_25internal_compressed_tuple27TupleItemsMoveConstructibleIS9_JSF_DpT0_EEEEEbE4typeELb1EEEOSF_DpOSM_:
  235|      6|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|      6|                                             std::forward<First>(first),
  237|      6|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEENS8_16integer_sequenceImJLm0ELm1ELm2ELm3EEEELb1EEC2IJS5_S6_S7_SA_EEENS8_10in_place_tEDpOT_:
  125|     24|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|     24|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEELb0EEC2IS4_EENS8_10in_place_tEOT_:
   89|      8|      : value(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EEC2IS4_EENS8_10in_place_tEOT_:
  101|      6|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EEC2IS4_EENS8_10in_place_tEOT_:
  101|      6|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqES6_EEELb1EEC2IS6_EENS4_10in_place_tEOT_:
  101|      6|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi2EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  245|   378M|  constexpr const ElemT<I>& get() const& {
  246|   378M|    return StorageT<I>::get();
  247|   378M|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EE3getEv:
  103|   378M|  constexpr const T& get() const& { return *this; }
_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi1EEERKNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  245|   343M|  constexpr const ElemT<I>& get() const& {
  246|   343M|    return StorageT<I>::get();
  247|   343M|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EE3getEv:
  103|   343M|  constexpr const T& get() const& { return *this; }
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi1EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  240|      6|  constexpr ElemT<I>& get() & {
  241|      6|    return StorageT<I>::get();
  242|      6|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EE3getEv:
  104|      6|  constexpr T& get() & { return *this; }
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEE3getILi2EEERNS1_25internal_compressed_tuple4ElemIS9_XT_EE4typeEv:
  240|      2|  constexpr ElemT<I>& get() & {
  241|      2|    return StorageT<I>::get();
  242|      2|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EE3getEv:
  104|      2|  constexpr T& get() & { return *this; }
_ZN4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEC2IS3_JRS4_RS5_RS8_ETnNS6_9enable_ifIXsr3stdE13conjunction_vINS6_8negationINS6_7is_sameIFvS9_EFvu7__decayIT_EEEEEENS1_25internal_compressed_tuple27TupleItemsMoveConstructibleIS9_JSI_DpT0_EEEEEbE4typeELb1EEEOSI_DpOSP_:
  235|      2|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|      2|                                             std::forward<First>(first),
  237|      2|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqENSt3__19allocatorIcEEEEENS8_16integer_sequenceImJLm0ELm1ELm2ELm3EEEELb1EEC2IJS5_RS6_RS7_RSA_EEENS8_10in_place_tEDpOT_:
  125|      8|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|      8|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_10StringHashELm1ENS2_10StorageTagIJNS1_12CommonFieldsES4_NS1_8StringEqENSt3__19allocatorIcEEEEELb1EEC2IRS4_EENS8_10in_place_tEOT_:
  101|      2|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_8StringEqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashES4_NSt3__19allocatorIcEEEEELb1EEC2IRS4_EENS8_10in_place_tEOT_:
  101|      2|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_10StringHashENS1_8StringEqES6_EEELb1EEC2IRS6_EENS4_10in_place_tEOT_:
  101|      2|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi0EEERKNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  245|  2.94G|  constexpr const ElemT<I>& get() const& {
  246|  2.94G|    return StorageT<I>::get();
  247|  2.94G|  }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSD_2EqENSt3__19allocatorIcEEEEELb0EE3getEv:
   90|  2.94G|  constexpr const T& get() const& { return value; }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi2EEERKNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  245|  36.6M|  constexpr const ElemT<I>& get() const& {
  246|  36.6M|    return StorageT<I>::get();
  247|  36.6M|  }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE2EqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENSB_4HashESC_NSt3__19allocatorIcEEEEELb1EE3getEv:
  103|  36.6M|  constexpr const T& get() const& { return *this; }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi0EEERNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  240|  1.92G|  constexpr ElemT<I>& get() & {
  241|  1.92G|    return StorageT<I>::get();
  242|  1.92G|  }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSD_2EqENSt3__19allocatorIcEEEEELb0EE3getEv:
   91|  1.92G|  constexpr T& get() & { return value; }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi1EEERKNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  245|   699M|  constexpr const ElemT<I>& get() const& {
  246|   699M|    return StorageT<I>::get();
  247|   699M|  }
unigram_model.cc:_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELm1ENS2_10StorageTagIJNS1_12CommonFieldsESC_NSB_2EqENSt3__19allocatorIcEEEEELb1EE3getEv:
  103|   699M|  constexpr const T& get() const& { return *this; }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi3EEERNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  240|   495M|  constexpr ElemT<I>& get() & {
  241|   495M|    return StorageT<I>::get();
  242|   495M|  }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSG_2EqES6_EEELb1EE3getEv:
  104|   495M|  constexpr T& get() & { return *this; }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEE3getILi1EEERNS1_25internal_compressed_tuple4ElemISH_XT_EE4typeEv:
  240|  11.1k|  constexpr ElemT<I>& get() & {
  241|  11.1k|    return StorageT<I>::get();
  242|  11.1k|  }
unigram_model.cc:_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELm1ENS2_10StorageTagIJNS1_12CommonFieldsESC_NSB_2EqENSt3__19allocatorIcEEEEELb1EE3getEv:
  104|  11.1k|  constexpr T& get() & { return *this; }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSB_2EqENSt3__19allocatorIcEEEEC2IS3_JSC_SD_SG_ETnNSE_9enable_ifIXsr3stdE13conjunction_vINSE_8negationINSE_7is_sameIFvSH_EFvu7__decayIT_EEEEEENS1_25internal_compressed_tuple27TupleItemsMoveConstructibleISH_JSN_DpT0_EEEEEbE4typeELb1EEEOSN_DpOSU_:
  235|  5.57k|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|  5.57k|                                             std::forward<First>(first),
  237|  5.57k|                                             std::forward<Vs>(base)...) {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSD_2EqENSt3__19allocatorIcEEEEENSG_16integer_sequenceImJLm0ELm1ELm2ELm3EEEELb1EEC2IJS5_SE_SF_SI_EEENSG_10in_place_tEDpOT_:
  125|  22.2k|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|  22.2k|                                          std::forward<Vs>(args))... {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_12CommonFieldsELm0ENS2_10StorageTagIJS4_NS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSD_2EqENSt3__19allocatorIcEEEEELb0EEC2IS4_EENSG_10in_place_tEOT_:
   89|  5.57k|      : value(std::forward<V>(v)) {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELm1ENS2_10StorageTagIJNS1_12CommonFieldsESC_NSB_2EqENSt3__19allocatorIcEEEEELb1EEC2ISC_EENSG_10in_place_tEOT_:
  101|  5.57k|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE2EqELm2ENS2_10StorageTagIJNS1_12CommonFieldsENSB_4HashESC_NSt3__19allocatorIcEEEEELb1EEC2ISC_EENSG_10in_place_tEOT_:
  101|  5.57k|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIcEELm3ENS2_10StorageTagIJNS1_12CommonFieldsENS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashENSG_2EqES6_EEELb1EEC2IS6_EENS4_10in_place_tEOT_:
  101|  5.57k|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZNKR4absl12lts_2026081718container_internal15CompressedTupleIJNSt3__19allocatorIPNS0_7LogSinkEEEmEE3getILi1EEERKNS1_25internal_compressed_tuple4ElemIS8_XT_EE4typeEv:
  245|  11.7k|  constexpr const ElemT<I>& get() const& {
  246|  11.7k|    return StorageT<I>::get();
  247|  11.7k|  }
_ZNKR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm1ENS2_10StorageTagIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEELb0EE3getEv:
   90|  11.7k|  constexpr const T& get() const& { return value; }
_ZN4absl12lts_2026081718container_internal15CompressedTupleIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEC2IS7_JjETnNS3_9enable_ifIXsr3stdE13conjunction_vINS3_8negationINS3_7is_sameIFvS8_EFvu7__decayIT_EEEEEENS1_25internal_compressed_tuple27TupleItemsMoveConstructibleIS8_JSE_DpT0_EEEEEbE4typeELb1EEEOSE_DpOSL_:
  235|  5.85k|      : CompressedTuple::CompressedTupleImpl(std::in_place,
  236|  5.85k|                                             std::forward<First>(first),
  237|  5.85k|                                             std::forward<Vs>(base)...) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple19CompressedTupleImplINS1_15CompressedTupleIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEENS5_16integer_sequenceImJLm0ELm1EEEELb1EEC2IJS9_jEEENS5_10in_place_tEDpOT_:
  125|  11.7k|      : Storage<Ts, I, StorageTag<Ts...>>(std::in_place,
  126|  11.7k|                                          std::forward<Vs>(args))... {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageINSt3__19allocatorIPNS0_7LogSinkEEELm0ENS2_10StorageTagIJS8_mEEELb1EEC2IS8_EENS4_10in_place_tEOT_:
  101|  5.85k|  explicit constexpr Storage(std::in_place_t, V&& v) : T(std::forward<V>(v)) {}
_ZN4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm1ENS2_10StorageTagIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEELb0EEC2IjEENS5_10in_place_tEOT_:
   89|  5.85k|      : value(std::forward<V>(v)) {}
_ZNR4absl12lts_2026081718container_internal15CompressedTupleIJNSt3__19allocatorIPNS0_7LogSinkEEEmEE3getILi1EEERNS1_25internal_compressed_tuple4ElemIS8_XT_EE4typeEv:
  240|  5.85k|  constexpr ElemT<I>& get() & {
  241|  5.85k|    return StorageT<I>::get();
  242|  5.85k|  }
_ZNR4absl12lts_2026081718container_internal25internal_compressed_tuple7StorageImLm1ENS2_10StorageTagIJNSt3__19allocatorIPNS0_7LogSinkEEEmEEELb0EE3getEv:
   91|  5.85k|  constexpr T& get() & { return value; }

_ZN4absl12lts_2026081718container_internal27SanitizerPoisonMemoryRegionEPKvm:
  236|   291M|inline void SanitizerPoisonMemoryRegion(const void* m, size_t s) {
  237|       |#ifdef ABSL_HAVE_ADDRESS_SANITIZER
  238|       |  ASAN_POISON_MEMORY_REGION(m, s);
  239|       |#endif
  240|       |#ifdef ABSL_HAVE_MEMORY_SANITIZER
  241|       |  __msan_poison(m, s);
  242|       |#endif
  243|   291M|  (void)m;
  244|   291M|  (void)s;
  245|   291M|}
_ZN4absl12lts_2026081718container_internal29SanitizerUnpoisonMemoryRegionEPKvm:
  247|   495M|inline void SanitizerUnpoisonMemoryRegion(const void* m, size_t s) {
  248|       |#ifdef ABSL_HAVE_ADDRESS_SANITIZER
  249|       |  ASAN_UNPOISON_MEMORY_REGION(m, s);
  250|       |#endif
  251|       |#ifdef ABSL_HAVE_MEMORY_SANITIZER
  252|       |  __msan_unpoison(m, s);
  253|       |#endif
  254|   495M|  (void)m;
  255|   495M|  (void)s;
  256|   495M|}
_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12EqualElementINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS1_8StringEqEEEJRNS4_4pairIKNS4_17basic_string_viewIcS7_EEhEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSJ_DpOSK_:
  222|     24|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|     24|  return memory_internal::DecomposePairImpl(
  224|     24|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|     24|}
_ZN4absl12lts_2026081718container_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:
  156|     24|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|     24|  const auto& key = std::get<0>(p.first);
  158|     24|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|     24|                            std::move(p.second));
  160|     24|}
_ZNK4absl12lts_2026081718container_internal12EqualElementINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS1_8StringEqEEclINS3_17basic_string_viewIcS6_EEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKSE_EEENSI_IJRKhEEEEEEbRKT_DpOT0_:
  525|     24|  bool operator()(const K2& lhs, Args&&...) const {
  526|     24|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|     24|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|     24|  }
_ZN4absl12lts_2026081718container_internal8PairArgsIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhEENS3_4pairINS3_5tupleIJRKT_EEENSA_IJRKT0_EEEEERKNS9_ISB_SF_EE:
  203|  97.4M|    const std::pair<F, S>& p) {
  204|  97.4M|  return PairArgs(p.first, p.second);
  205|  97.4M|}
_ZN4absl12lts_2026081718container_internal8PairArgsIRKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEERKhEENS3_4pairINS3_5tupleIJOT_EEENSD_IJOT0_EEEEESF_SI_:
  197|  97.4M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|  97.4M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|  97.4M|          std::forward_as_tuple(std::forward<S>(s))};
  200|  97.4M|}
_ZN4absl12lts_2026081718container_internal23TypeErasedApplyToSlotFnINS1_10StringHashENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEELb1EEEmPKvPvm:
  538|      2|size_t TypeErasedApplyToSlotFn(const void* fn, void* slot, size_t seed) {
  539|      2|  const auto* f = static_cast<const Fn*>(fn);
  540|      2|  return HashElement<Fn, kIsDefault>{*f, seed}(*static_cast<const T*>(slot));
  541|      2|}
_ZN4absl12lts_2026081718container_internal11HashElementINS1_10StringHashELb1EEC2ERKS3_m:
  491|   343M|  HashElement(const Hash& h, size_t s) : hash(h), seed(s) {}
_ZNK4absl12lts_2026081718container_internal11HashElementINS1_10StringHashELb1EEclINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJEEEmRKT_DpOT0_:
  494|   343M|  size_t operator()(const K& key, Args&&...) const {
  495|   343M|    if constexpr (kIsDefault) {
  496|       |      // TODO(b/384509507): resolve `no header providing
  497|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  498|       |      // Maybe we should make "internal/hash.h" be a separate library.
  499|   343M|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  500|   343M|    }
  501|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  502|      0|    return hash(key) ^ seed;
  503|   343M|  }
_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_11HashElementINS1_10StringHashELb1EEEJRNSt3__14pairIKNS6_17basic_string_viewIcNS6_11char_traitsIcEEEEhEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSF_DpOSG_:
  222|    884|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|    884|  return memory_internal::DecomposePairImpl(
  224|    884|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|    884|}
_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_11HashElementINS1_10StringHashELb1EEERKNSt3__117basic_string_viewIcNS7_11char_traitsIcEEEENS7_5tupleIJRKhEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS7_19piecewise_constructEEclsr3stdE7declvalINSE_IJSJ_EEEEEclsr3stdE7declvalIT1_EEEEOSI_NS7_4pairISM_SN_EE:
  156|    884|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|    884|  const auto& key = std::get<0>(p.first);
  158|    884|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|    884|                            std::move(p.second));
  160|    884|}
_ZNK4absl12lts_2026081718container_internal11HashElementINS1_10StringHashELb1EEclINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJRKNS6_21piecewise_construct_tENS6_5tupleIJRKSA_EEENSE_IJRKhEEEEEEmRKT_DpOT0_:
  494|    884|  size_t operator()(const K& key, Args&&...) const {
  495|    884|    if constexpr (kIsDefault) {
  496|       |      // TODO(b/384509507): resolve `no header providing
  497|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  498|       |      // Maybe we should make "internal/hash.h" be a separate library.
  499|    884|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  500|    884|    }
  501|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  502|      0|    return hash(key) ^ seed;
  503|    884|  }
_ZN4absl12lts_2026081718container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE8transferINS3_9allocatorINS3_4pairIKS7_hEEEEEEDaPT_PNS1_13map_slot_typeIS7_hEESJ_:
  438|    878|                       slot_type* old_slot) {
  439|       |    // This should really just be
  440|       |    // typename absl::is_trivially_relocatable<value_type>::type()
  441|       |    // but std::pair is not trivially copyable in C++23 in some standard
  442|       |    // library versions.
  443|       |    // See https://github.com/llvm/llvm-project/pull/95444 for instance.
  444|    878|    auto is_relocatable = typename std::conjunction<
  445|    878|        absl::is_trivially_relocatable<typename value_type::first_type>,
  446|    878|        absl::is_trivially_relocatable<typename value_type::second_type>>::
  447|    878|        type();
  448|       |
  449|    878|    emplace(new_slot);
  450|    878|    if (is_relocatable) {
  ------------------
  |  Branch (450:9): [True: 878, Folded]
  ------------------
  451|       |      // TODO(b/247130232,b/251814870): remove casts after fixing warnings.
  452|    878|      std::memcpy(static_cast<void*>(std::launder(&new_slot->value)),
  453|    878|                  static_cast<const void*>(&old_slot->value),
  454|    878|                  sizeof(value_type));
  455|    878|      return is_relocatable;
  456|    878|    }
  457|       |
  458|      0|    if (kMutableKeys::value) {
  ------------------
  |  Branch (458:9): [True: 0, Folded]
  ------------------
  459|      0|      std::allocator_traits<Allocator>::construct(
  460|      0|          *alloc, &new_slot->mutable_value, std::move(old_slot->mutable_value));
  461|      0|    } else {
  462|      0|      std::allocator_traits<Allocator>::construct(*alloc, &new_slot->value,
  463|      0|                                                  std::move(old_slot->value));
  464|      0|    }
  465|      0|    destroy(alloc, old_slot);
  466|      0|    return is_relocatable;
  467|    878|  }
_ZN4absl12lts_2026081718container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhE7emplaceEPNS1_13map_slot_typeIS7_hEE:
  364|  1.39k|  static void emplace(slot_type* slot) {
  365|       |    // The construction of union doesn't do anything at runtime but it allows us
  366|       |    // to access its members without violating aliasing rules.
  367|  1.39k|    new (slot) slot_type;
  368|  1.39k|  }
_ZN4absl12lts_2026081718container_internal13map_slot_typeINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEhEC2Ev:
  345|  1.39k|  map_slot_type() {}
_ZN4absl12lts_2026081718container_internal7HashKeyINS1_10StringHashENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEELb1EEC2ERKS3_RKSA_:
  511|      4|  HashKey(const Hash& h, const Key& k) : hash(h), key(k) {}
_ZNK4absl12lts_2026081718container_internal7HashKeyINS1_10StringHashENSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEELb1EEclEm:
  513|      2|  size_t operator()(size_t seed) const {
  514|      2|    return HashElement<Hash, kIsDefault>{hash, seed}(key);
  515|      2|  }
_ZNK4absl12lts_2026081718container_internal11HashElementINS1_10StringHashELb1EEclINSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEEJEEEmRKT_DpOT0_:
  494|  1.10k|  size_t operator()(const K& key, Args&&...) const {
  495|  1.10k|    if constexpr (kIsDefault) {
  496|       |      // TODO(b/384509507): resolve `no header providing
  497|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  498|       |      // Maybe we should make "internal/hash.h" be a separate library.
  499|  1.10k|      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  500|  1.10k|    }
  501|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  502|      0|    return hash(key) ^ seed;
  503|  1.10k|  }
_ZN4absl12lts_2026081718container_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_:
  393|    512|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  394|    512|    emplace(slot);
  395|    512|    if (kMutableKeys::value) {
  ------------------
  |  Branch (395:9): [True: 512, Folded]
  ------------------
  396|    512|      std::allocator_traits<Allocator>::construct(*alloc, &slot->mutable_value,
  397|    512|                                                  std::forward<Args>(args)...);
  398|    512|    } else {
  399|      0|      std::allocator_traits<Allocator>::construct(*alloc, &slot->value,
  400|      0|                                                  std::forward<Args>(args)...);
  401|      0|    }
  402|    512|  }
_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12EqualElementINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS1_8StringEqEEEJRNS4_4pairIKS8_iEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSF_DpOSG_:
  222|   281M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|   281M|  return memory_internal::DecomposePairImpl(
  224|   281M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|   281M|}
_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_12EqualElementINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEENS1_8StringEqEEERKS9_NS5_5tupleIJRKiEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS5_19piecewise_constructEEclsr3stdE7declvalINSE_IJSJ_EEEEEclsr3stdE7declvalIT1_EEEEOSI_NS5_4pairISM_SN_EE:
  156|   281M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|   281M|  const auto& key = std::get<0>(p.first);
  158|   281M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|   281M|                            std::move(p.second));
  160|   281M|}
_ZNK4absl12lts_2026081718container_internal12EqualElementINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEENS1_8StringEqEEclIS7_JRKNS3_21piecewise_construct_tENS3_5tupleIJRKS7_EEENSE_IJRKiEEEEEEbRKT_DpOT0_:
  525|   281M|  bool operator()(const K2& lhs, Args&&...) const {
  526|   281M|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|   281M|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|   281M|  }
_ZN4absl12lts_2026081718container_internal8PairArgsIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiEENS3_4pairINS3_5tupleIJRKT_EEENSA_IJRKT0_EEEEERKNS9_ISB_SF_EE:
  203|   281M|    const std::pair<F, S>& p) {
  204|   281M|  return PairArgs(p.first, p.second);
  205|   281M|}
_ZN4absl12lts_2026081718container_internal8PairArgsIRKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEERKiEENS3_4pairINS3_5tupleIJOT_EEENSD_IJOT0_EEEEESF_SI_:
  197|   281M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|   281M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|   281M|          std::forward_as_tuple(std::forward<S>(s))};
  200|   281M|}
_ZN4absl12lts_2026081718container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE7emplaceEPNS1_13map_slot_typeIS7_iEE:
  364|    596|  static void emplace(slot_type* slot) {
  365|       |    // The construction of union doesn't do anything at runtime but it allows us
  366|       |    // to access its members without violating aliasing rules.
  367|    596|    new (slot) slot_type;
  368|    596|  }
_ZN4absl12lts_2026081718container_internal13map_slot_typeINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiEC2Ev:
  345|    596|  map_slot_type() {}
_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEiEEJEE19EmplaceDecomposableEJRKNS5_12basic_stringIcS8_NS5_9allocatorIcEEEERiEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSK_DpOSL_:
  222|    596|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|    596|  return memory_internal::DecomposePairImpl(
  224|    596|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|    596|}
_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEiEEJEE19EmplaceDecomposableERKNS6_12basic_stringIcS9_NS6_9allocatorIcEEEENS6_5tupleIJRiEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS6_19piecewise_constructEEclsr3stdE7declvalINSK_IJSO_EEEEEclsr3stdE7declvalIT1_EEEEOSN_NS6_4pairISR_SS_EE:
  156|    596|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|    596|  const auto& key = std::get<0>(p.first);
  158|    596|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|    596|                            std::move(p.second));
  160|    596|}
_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12EqualElementINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEENS1_8StringEqEEEJRNS4_4pairIKNS4_17basic_string_viewIcS7_EEiEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSJ_DpOSK_:
  222|     18|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|     18|  return memory_internal::DecomposePairImpl(
  224|     18|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|     18|}
_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_12EqualElementINSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEENS1_8StringEqEEERKNS5_17basic_string_viewIcS8_EENS5_5tupleIJRKiEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS5_19piecewise_constructEEclsr3stdE7declvalINSI_IJSN_EEEEEclsr3stdE7declvalIT1_EEEEOSM_NS5_4pairISQ_SR_EE:
  156|     18|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|     18|  const auto& key = std::get<0>(p.first);
  158|     18|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|     18|                            std::move(p.second));
  160|     18|}
_ZNK4absl12lts_2026081718container_internal12EqualElementINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS1_8StringEqEEclINS3_17basic_string_viewIcS6_EEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKSE_EEENSI_IJRKiEEEEEEbRKT_DpOT0_:
  525|     18|  bool operator()(const K2& lhs, Args&&...) const {
  526|     18|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|     18|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|     18|  }
_ZN4absl12lts_2026081718container_internal15map_slot_policyINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiE9constructINS3_9allocatorINS3_4pairIKS7_iEEEEJRKNS3_21piecewise_construct_tENS3_5tupleIJRKNS3_12basic_stringIcS6_NSA_IcEEEEEEENSI_IJRiEEEEEEvPT_PNS1_13map_slot_typeIS7_iEEDpOT0_:
  393|    596|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  394|    596|    emplace(slot);
  395|    596|    if (kMutableKeys::value) {
  ------------------
  |  Branch (395:9): [True: 596, Folded]
  ------------------
  396|    596|      std::allocator_traits<Allocator>::construct(*alloc, &slot->mutable_value,
  397|    596|                                                  std::forward<Args>(args)...);
  398|    596|    } else {
  399|      0|      std::allocator_traits<Allocator>::construct(*alloc, &slot->value,
  400|      0|                                                  std::forward<Args>(args)...);
  401|      0|    }
  402|    596|  }
_ZN4absl12lts_2026081718container_internal8PairArgsIRKNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEERiEENS3_4pairINS3_5tupleIJOT_EEENSE_IJOT0_EEEEESG_SJ_:
  197|    596|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|    596|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|    596|          std::forward_as_tuple(std::forward<S>(s))};
  200|    596|}
_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12EqualElementINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEENS1_8StringEqEEEJRNS4_4pairIKS8_hEEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSF_DpOSG_:
  222|  97.4M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|  97.4M|  return memory_internal::DecomposePairImpl(
  224|  97.4M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|  97.4M|}
_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_12EqualElementINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEENS1_8StringEqEEERKS9_NS5_5tupleIJRKhEEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNS5_19piecewise_constructEEclsr3stdE7declvalINSE_IJSJ_EEEEEclsr3stdE7declvalIT1_EEEEOSI_NS5_4pairISM_SN_EE:
  156|  97.4M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|  97.4M|  const auto& key = std::get<0>(p.first);
  158|  97.4M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|  97.4M|                            std::move(p.second));
  160|  97.4M|}
_ZNK4absl12lts_2026081718container_internal12EqualElementINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEENS1_8StringEqEEclIS7_JRKNS3_21piecewise_construct_tENS3_5tupleIJRKS7_EEENSE_IJRKhEEEEEEbRKT_DpOT0_:
  525|  97.4M|  bool operator()(const K2& lhs, Args&&...) const {
  526|  97.4M|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|  97.4M|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|  97.4M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12EqualElementIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisENS1_6HashEqIS9_vE2EqEEEJRNSt3__14pairIKS9_PS7_EEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSK_DpOSL_:
  222|  36.6M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|  36.6M|  return memory_internal::DecomposePairImpl(
  224|  36.6M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|  36.6M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_12EqualElementIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisENS1_6HashEqISA_vE2EqEEERKSA_NSt3__15tupleIJRKPS8_EEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNSH_19piecewise_constructEEclsr3stdE7declvalINSI_IJSO_EEEEEclsr3stdE7declvalIT1_EEEEOSN_NSH_4pairISR_SS_EE:
  156|  36.6M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|  36.6M|  const auto& key = std::get<0>(p.first);
  158|  36.6M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|  36.6M|                            std::move(p.second));
  160|  36.6M|}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12EqualElementIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisENS1_6HashEqIS8_vE2EqEEclIS8_JRKNSt3__121piecewise_construct_tENSE_5tupleIJRKS8_EEENSI_IJRKPS6_EEEEEEbRKT_DpOT0_:
  525|  36.6M|  bool operator()(const K2& lhs, Args&&...) const {
  526|  36.6M|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(eq(lhs, rhs));
  ------------------
  |  |  484|  36.6M|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
  527|  36.6M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIKPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EENSt3__14pairINSB_5tupleIJRKT_EEENSD_IJRKT0_EEEEERKNSC_ISE_SI_EE:
  203|   327M|    const std::pair<F, S>& p) {
  204|   327M|  return PairArgs(p.first, p.second);
  205|   327M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIRKPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisERKPS6_EENSt3__14pairINSE_5tupleIJOT_EEENSG_IJOT0_EEEEESI_SL_:
  197|   327M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|   327M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|   327M|          std::forward_as_tuple(std::forward<S>(s))};
  200|   327M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEC2ERKSB_m:
  491|   699M|  HashElement(const Hash& h, size_t s) : hash(h), seed(s) {}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEclIS9_JEEEmRKT_DpOT0_:
  494|   408M|  size_t operator()(const K& key, Args&&...) const {
  495|       |    if constexpr (kIsDefault) {
  496|       |      // TODO(b/384509507): resolve `no header providing
  497|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  498|       |      // Maybe we should make "internal/hash.h" be a separate library.
  499|       |      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  500|       |    }
  501|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  502|   408M|    return hash(key) ^ seed;
  503|   408M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS8_EEJEE19EmplaceDecomposableEJNSt3__14pairISA_SB_EEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSI_DpOSJ_:
  222|   204M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|   204M|  return memory_internal::DecomposePairImpl(
  224|   204M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|   204M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS9_EEJEE19EmplaceDecomposableEOSB_NSt3__15tupleIJOSC_EEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNSH_19piecewise_constructEEclsr3stdE7declvalINSI_IJSM_EEEEEclsr3stdE7declvalIT1_EEEEOSL_NSH_4pairISP_SQ_EE:
  156|   204M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|   204M|  const auto& key = std::get<0>(p.first);
  158|   204M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|   204M|                            std::move(p.second));
  160|   204M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal23TypeErasedApplyToSlotFnINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashES9_Lb0EEEmPKvPvm:
  538|  5.57k|size_t TypeErasedApplyToSlotFn(const void* fn, void* slot, size_t seed) {
  539|  5.57k|  const auto* f = static_cast<const Fn*>(fn);
  540|  5.57k|  return HashElement<Fn, kIsDefault>{*f, seed}(*static_cast<const T*>(slot));
  541|  5.57k|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13DecomposePairINS1_11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEEJRNSt3__14pairIKSA_PS8_EEEEEDTclsr15memory_internalE17DecomposePairImplclsr3stdE7forwardIT_Efp_Ecl8PairArgsspclsr3stdE7forwardIT0_Efp0_EEEEOSK_DpOSL_:
  222|   291M|        std::forward<F>(f), PairArgs(std::forward<Args>(args)...))) {
  223|   291M|  return memory_internal::DecomposePairImpl(
  224|   291M|      std::forward<F>(f), PairArgs(std::forward<Args>(args)...));
  225|   291M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15memory_internal17DecomposePairImplINS1_11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEERKSB_NSt3__15tupleIJRKPS9_EEEEEDTclclsr3stdE7declvalIT_EEclsr3stdE7declvalIRKT0_EEL_ZNSH_19piecewise_constructEEclsr3stdE7declvalINSI_IJSO_EEEEEclsr3stdE7declvalIT1_EEEEOSN_NSH_4pairISR_SS_EE:
  156|   291M|DecomposePairImpl(F&& f, std::pair<std::tuple<K>, V> p) {
  157|   291M|  const auto& key = std::get<0>(p.first);
  158|   291M|  return std::forward<F>(f)(key, std::piecewise_construct, std::move(p.first),
  159|   291M|                            std::move(p.second));
  160|   291M|}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal11HashElementINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashELb0EEclIS9_JRKNSt3__121piecewise_construct_tENSE_5tupleIJRKS9_EEENSI_IJRKPS7_EEEEEEmRKT_DpOT0_:
  494|   291M|  size_t operator()(const K& key, Args&&...) const {
  495|       |    if constexpr (kIsDefault) {
  496|       |      // TODO(b/384509507): resolve `no header providing
  497|       |      // "absl::hash_internal::SupportsHashWithSeed" is directly included`.
  498|       |      // Maybe we should make "internal/hash.h" be a separate library.
  499|       |      return absl::hash_internal::HashWithSeed().hash(hash, key, seed);
  500|       |    }
  501|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  502|   291M|    return hash(key) ^ seed;
  503|   291M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15map_slot_policyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E8transferINSt3__19allocatorINSC_4pairIKS8_S9_EEEEEEDaPT_PNS1_13map_slot_typeIS8_S9_EESM_:
  438|   290M|                       slot_type* old_slot) {
  439|       |    // This should really just be
  440|       |    // typename absl::is_trivially_relocatable<value_type>::type()
  441|       |    // but std::pair is not trivially copyable in C++23 in some standard
  442|       |    // library versions.
  443|       |    // See https://github.com/llvm/llvm-project/pull/95444 for instance.
  444|   290M|    auto is_relocatable = typename std::conjunction<
  445|   290M|        absl::is_trivially_relocatable<typename value_type::first_type>,
  446|   290M|        absl::is_trivially_relocatable<typename value_type::second_type>>::
  447|   290M|        type();
  448|       |
  449|   290M|    emplace(new_slot);
  450|   290M|    if (is_relocatable) {
  ------------------
  |  Branch (450:9): [True: 290M, Folded]
  ------------------
  451|       |      // TODO(b/247130232,b/251814870): remove casts after fixing warnings.
  452|   290M|      std::memcpy(static_cast<void*>(std::launder(&new_slot->value)),
  453|   290M|                  static_cast<const void*>(&old_slot->value),
  454|   290M|                  sizeof(value_type));
  455|   290M|      return is_relocatable;
  456|   290M|    }
  457|       |
  458|      0|    if (kMutableKeys::value) {
  ------------------
  |  Branch (458:9): [True: 0, Folded]
  ------------------
  459|      0|      std::allocator_traits<Allocator>::construct(
  460|      0|          *alloc, &new_slot->mutable_value, std::move(old_slot->mutable_value));
  461|      0|    } else {
  462|      0|      std::allocator_traits<Allocator>::construct(*alloc, &new_slot->value,
  463|      0|                                                  std::move(old_slot->value));
  464|      0|    }
  465|      0|    destroy(alloc, old_slot);
  466|      0|    return is_relocatable;
  467|   290M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15map_slot_policyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E7emplaceEPNS1_13map_slot_typeIS8_S9_EE:
  364|   495M|  static void emplace(slot_type* slot) {
  365|       |    // The construction of union doesn't do anything at runtime but it allows us
  366|       |    // to access its members without violating aliasing rules.
  367|   495M|    new (slot) slot_type;
  368|   495M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal13map_slot_typeIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EC2Ev:
  345|   495M|  map_slot_type() {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal7HashKeyINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashES9_Lb0EEC2ERKSB_RKS9_:
  511|  11.1k|  HashKey(const Hash& h, const Key& k) : hash(h), key(k) {}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal7HashKeyINS1_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashES9_Lb0EEclEm:
  513|  5.57k|  size_t operator()(size_t seed) const {
  514|  5.57k|    return HashElement<Hash, kIsDefault>{hash, seed}(key);
  515|  5.57k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal15map_slot_policyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_E9constructINSt3__19allocatorINSC_4pairIKS8_S9_EEEEJRKNSC_21piecewise_construct_tENSC_5tupleIJOS8_EEENSL_IJOS9_EEEEEEvPT_PNS1_13map_slot_typeIS8_S9_EEDpOT0_:
  393|   204M|  static void construct(Allocator* alloc, slot_type* slot, Args&&... args) {
  394|   204M|    emplace(slot);
  395|   204M|    if (kMutableKeys::value) {
  ------------------
  |  Branch (395:9): [True: 204M, Folded]
  ------------------
  396|   204M|      std::allocator_traits<Allocator>::construct(*alloc, &slot->mutable_value,
  397|   204M|                                                  std::forward<Args>(args)...);
  398|   204M|    } else {
  399|      0|      std::allocator_traits<Allocator>::construct(*alloc, &slot->value,
  400|      0|                                                  std::forward<Args>(args)...);
  401|      0|    }
  402|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EENSt3__14pairINSA_5tupleIJOT_EEENSC_IJOT0_EEEEEONSB_ISD_SG_EE:
  207|   204M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(std::pair<F, S>&& p) {
  208|   204M|  return PairArgs(std::forward<F>(p.first), std::forward<S>(p.second));
  209|   204M|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal8PairArgsIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS6_EENSt3__14pairINSA_5tupleIJOT_EEENSC_IJOT0_EEEEESE_SH_:
  197|   204M|std::pair<std::tuple<F&&>, std::tuple<S&&>> PairArgs(F&& f, S&& s) {
  198|   204M|  return {std::piecewise_construct, std::forward_as_tuple(std::forward<F>(f)),
  199|   204M|          std::forward_as_tuple(std::forward<S>(s))};
  200|   204M|}
_ZN4absl12lts_2026081718container_internal8AllocateILm8ENSt3__19allocatorIcEEEEPvPT0_m:
   62|  82.1k|void* Allocate(Alloc* alloc, size_t n) {
   63|  82.1k|  static_assert(Alignment > 0, "");
   64|  82.1k|  assert(n && "n must be positive");
   65|  82.1k|  using M = AlignedType<Alignment>;
   66|  82.1k|  using A = typename std::allocator_traits<Alloc>::template rebind_alloc<M>;
   67|  82.1k|  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|  82.1k|  A my_mem_alloc(*alloc);
   72|  82.1k|  void* p = AT::allocate(my_mem_alloc, (n + sizeof(M) - 1) / sizeof(M));
   73|       |  assert(reinterpret_cast<uintptr_t>(p) % Alignment == 0 &&
   74|  82.1k|         "allocator does not respect alignment");
   75|  82.1k|  return p;
   76|  82.1k|}
_ZN4absl12lts_2026081718container_internal10DeallocateILm8ENSt3__19allocatorIcEEEEvPT0_Pvm:
   93|  82.1k|void Deallocate(Alloc* alloc, void* p, size_t n) {
   94|  82.1k|  static_assert(Alignment > 0, "");
   95|  82.1k|  assert(n && "n must be positive");
   96|  82.1k|  using M = AlignedType<Alignment>;
   97|  82.1k|  using A = typename std::allocator_traits<Alloc>::template rebind_alloc<M>;
   98|  82.1k|  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|  82.1k|  A my_mem_alloc(*alloc);
  103|  82.1k|  AT::deallocate(my_mem_alloc, static_cast<M*>(p),
  104|  82.1k|                 (n + sizeof(M) - 1) / sizeof(M));
  105|  82.1k|}

_ZNK4absl12lts_2026081718container_internal10StringHash14hash_with_seedENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEm:
   86|   343M|  size_t hash_with_seed(absl::string_view v, size_t seed) const {
   87|   343M|    return absl::hash_internal::HashWithSeed().hash(
   88|   343M|        absl::Hash<absl::string_view>{}, v, seed);
   89|   343M|  }
_ZNK4absl12lts_2026081718container_internal8StringEqclENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEES7_:
   98|   378M|  bool operator()(absl::string_view lhs, absl::string_view rhs) const {
   99|   378M|    return lhs == rhs;
  100|   378M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE2EqclIS8_S8_EEbRKT_RKT0_:
  182|  36.6M|    bool operator()(const A& a, const B& b) const {
  183|  36.6M|      return HashEq::ToPtr(a) == HashEq::ToPtr(b);
  184|  36.6M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE5ToPtrES8_:
  188|   773M|  static const T* ToPtr(const T* ptr) { return ptr; }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashclIS8_EEmRKT_:
  175|   699M|    size_t operator()(const U& ptr) const {
  176|   699M|      return absl::Hash<const T*>{}(HashEq::ToPtr(ptr));
  177|   699M|    }

_ZN4absl12lts_2026081718container_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|     24|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|     24|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|     24|  }
_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE5applyINS1_11HashElementINS1_10StringHashELb1EEEJRNS4_4pairIKS8_hEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSK_DpOSL_:
  130|    884|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|    884|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|    884|  }
_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE5applyINS1_12EqualElementIS8_NS1_8StringEqEEEJRNS4_4pairIKS8_iEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSK_DpOSL_:
  130|   281M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|   281M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|   281M|  }
_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE5applyINS1_12raw_hash_setIS9_JEE19EmplaceDecomposableEJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEERiES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSN_DpOSO_:
  130|    596|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|    596|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|    596|  }
_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEvE5applyINS1_12EqualElementINS4_12basic_stringIcS7_NS4_9allocatorIcEEEENS1_8StringEqEEEJRNS4_4pairIKS8_iEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSO_DpOSP_:
  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_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEvE5applyINS1_12EqualElementIS8_NS1_8StringEqEEEJRNS4_4pairIKS8_hEEES9_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSK_DpOSL_:
  130|  97.4M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|  97.4M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|  97.4M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE5applyINS1_12EqualElementIS9_NS1_6HashEqIS9_vE2EqEEEJRNSt3__14pairIKS9_SA_EEESB_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSP_DpOSQ_:
  130|  36.6M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|  36.6M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|  36.6M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE5applyINS1_12raw_hash_setISB_JEE19EmplaceDecomposableEJNSt3__14pairIS9_SA_EEESB_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSL_DpOSM_:
  130|   204M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|   204M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal18hash_policy_traitsINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEvE5applyINS1_11HashElementINS1_6HashEqIS9_vE4HashELb0EEEJRNSt3__14pairIKS9_SA_EEESB_EEDTclsrT1_5applyclsr3stdE7forwardIT_Efp_Espclsr3stdE7forwardIT0_Efp0_EEEOSP_DpOSQ_:
  130|   291M|      -> decltype(P::apply(std::forward<F>(f), std::forward<Ts>(ts)...)) {
  131|   291M|    return P::apply(std::forward<F>(f), std::forward<Ts>(ts)...);
  132|   291M|  }

_ZN4absl12lts_2026081718container_internal13GroupSse2ImplC2EPKNS1_6ctrl_tE:
  286|   835M|  explicit GroupSse2Impl(const ctrl_t* pos) {
  287|   835M|    ctrl = _mm_loadu_si128(reinterpret_cast<const __m128i*>(pos));
  288|   835M|  }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl5MatchEh:
  291|   799M|  BitMaskType Match(h2_t hash) const {
  292|   799M|    auto match = _mm_set1_epi8(static_cast<char>(hash));
  293|   799M|    return BitMaskType(MoveMask(_mm_cmpeq_epi8(match, ctrl)));
  294|   799M|  }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl9MaskEmptyEv:
  297|   469M|  NonIterableBitMaskType MaskEmpty() const {
  298|       |#ifdef ABSL_INTERNAL_HAVE_SSSE3
  299|       |    // This only works because ctrl_t::kEmpty is -128.
  300|       |    return NonIterableBitMaskType(MoveMask(_mm_sign_epi8(ctrl, ctrl)));
  301|       |#else
  302|   469M|    auto match = _mm_set1_epi8(static_cast<char>(ctrl_t::kEmpty));
  303|   469M|    return NonIterableBitMaskType(MoveMask(_mm_cmpeq_epi8(match, ctrl)));
  304|   469M|#endif
  305|   469M|  }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl8MaskFullEv:
  310|  20.7M|  BitMaskType MaskFull() const { return BitMaskType(MoveMask(ctrl) ^ 0xffff); }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl11MaskNonFullEv:
  315|  13.0M|  auto MaskNonFull() const { return BitMaskType(MoveMask(ctrl)); }
_ZNK4absl12lts_2026081718container_internal13GroupSse2Impl18MaskEmptyOrDeletedEv:
  318|  1.27M|  NonIterableBitMaskType MaskEmptyOrDeleted() const {
  319|  1.27M|    auto special = _mm_set1_epi8(static_cast<char>(ctrl_t::kSentinel));
  320|  1.27M|    return NonIterableBitMaskType(
  321|  1.27M|        MoveMask(_mm_cmpgt_epi8_fixed(special, ctrl)));
  322|  1.27M|  }
_ZN4absl12lts_2026081718container_internal13GroupSse2Impl8MoveMaskEDv2_x:
  346|  1.30G|  static MaskInt MoveMask(__m128i xmm) {
  347|  1.30G|    auto mask = static_cast<MaskInt>(_mm_movemask_epi8(xmm));
  348|  1.30G|#ifdef __clang__
  349|       |    // TODO(b/472522597): Without the inline asm, clang ends up generating an
  350|       |    // unnecessary movzx to zero the upper bits of the output, but those bits
  351|       |    // are already zero. See https://godbolt.org/z/G6xW1Ecbx.
  352|  1.30G|    asm("" : "+r"(mask));  // NOLINT
  353|  1.30G|#endif
  354|  1.30G|    return mask;
  355|  1.30G|  }
_ZN4absl12lts_2026081718container_internal7IsEmptyENS1_6ctrl_tE:
  222|  1.58M|inline bool IsEmpty(ctrl_t c) { return c == ctrl_t::kEmpty; }
_ZN4absl12lts_2026081718container_internal6IsFullENS1_6ctrl_tE:
  223|   204M|inline bool IsFull(ctrl_t c) {
  224|       |  // Cast `c` to the underlying type instead of casting `0` to `ctrl_t` as `0`
  225|       |  // is not a value in the enum. Both ways are equivalent, but this way makes
  226|       |  // linters happier.
  227|   204M|  return static_cast<std::underlying_type_t<ctrl_t>>(c) >= 0;
  228|   204M|}
_ZN4absl12lts_2026081718container_internal16IsEmptyOrDeletedENS1_6ctrl_tE:
  230|  1.74M|inline bool IsEmptyOrDeleted(ctrl_t c) { return c < ctrl_t::kSentinel; }
_ZN4absl12lts_2026081718container_internal20_mm_cmpgt_epi8_fixedEDv2_xS2_:
  266|  1.27M|inline __m128i _mm_cmpgt_epi8_fixed(__m128i a, __m128i b) {
  267|       |#if defined(__GNUC__) && !defined(__clang__)
  268|       |  if (std::is_unsigned_v<char>) {
  269|       |    const __m128i mask = _mm_set1_epi8(0x80);
  270|       |    const __m128i diff = _mm_subs_epi8(b, a);
  271|       |    return _mm_cmpeq_epi8(_mm_and_si128(diff, mask), mask);
  272|       |  }
  273|       |#endif
  274|  1.27M|  return _mm_cmpgt_epi8(a, b);
  275|  1.27M|}
_ZN4absl12lts_2026081718container_internal13TrailingZerosImEEjT_:
   63|  87.7k|uint32_t TrailingZeros(T x) {
   64|  87.7k|  ABSL_ASSUME(x != 0);
  ------------------
  |  |  272|  87.7k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
   65|  87.7k|  return static_cast<uint32_t>(countr_zero(x));
   66|  87.7k|}
_ZN4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EEC2Ej:
  133|  1.65G|  explicit BitMask(T mask) : Base(mask) {
  134|  1.65G|    if (Shift == 3 && !NullifyBitsOnIteration) {
  ------------------
  |  Branch (134:9): [Folded, False: 1.65G]
  |  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.65G|  }
_ZN4absl12lts_2026081718container_internal18NonIterableBitMaskIjLi16ELi0EEC2Ej:
   85|  2.12G|  explicit NonIterableBitMask(T mask) : mask_(mask) {}
_ZNK4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EE5beginEv:
  153|   820M|  BitMask begin() const { return *this; }
_ZNK4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EE3endEv:
  154|   820M|  BitMask end() const { return BitMask(0); }
_ZN4absl12lts_2026081718container_internalneERKNS1_7BitMaskIjLi16ELi0ELb0EEES5_:
  160|  1.19G|  friend bool operator!=(const BitMask& a, const BitMask& b) {
  161|  1.19G|    return a.mask_ != b.mask_;
  162|  1.19G|  }
_ZNK4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EEdeEv:
  151|   706M|  uint32_t operator*() const { return Base::LowestBitSet(); }
_ZNK4absl12lts_2026081718container_internal18NonIterableBitMaskIjLi16ELi0EE12LowestBitSetEv:
   90|   923M|  uint32_t LowestBitSet() const {
   91|   923M|    return container_internal::TrailingZeros(mask_) >> Shift;
   92|   923M|  }
_ZN4absl12lts_2026081718container_internal13TrailingZerosIjEEjT_:
   63|   923M|uint32_t TrailingZeros(T x) {
   64|   923M|  ABSL_ASSUME(x != 0);
  ------------------
  |  |  272|   923M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
   65|   923M|  return static_cast<uint32_t>(countr_zero(x));
   66|   923M|}
_ZNK4absl12lts_2026081718container_internal18NonIterableBitMaskIjLi16ELi0EEcvbEv:
   87|   483M|  explicit operator bool() const { return mask_ != 0; }
_ZN4absl12lts_2026081718container_internal7BitMaskIjLi16ELi0ELb0EEppEv:
  143|   375M|  BitMask& operator++() {
  144|   375M|    if (Shift == 3 && NullifyBitsOnIteration) {
  ------------------
  |  Branch (144:9): [Folded, False: 375M]
  |  Branch (144:23): [Folded, False: 0]
  ------------------
  145|      0|      this->mask_ &= kMsbs8Bytes;
  146|      0|    }
  147|   375M|    this->mask_ &= (this->mask_ - 1);
  148|   375M|    return *this;
  149|   375M|  }

_ZN4absl12lts_2026081718container_internal20HashtablezInfoHandle10UnregisterEv:
  203|  5.57k|  inline void Unregister() {}
_ZNK4absl12lts_2026081718container_internal20HashtablezInfoHandle9IsSampledEv:
  204|  82.1k|  inline bool IsSampled() const { return false; }
_ZN4absl12lts_2026081718container_internal20HashtablezInfoHandle20RecordStorageChangedEmm:
  205|      2|  inline void RecordStorageChanged(size_t /*size*/, size_t /*capacity*/) {}
_ZN4absl12lts_2026081718container_internal20HashtablezInfoHandle17RecordReservationEm:
  207|      4|  inline void RecordReservation(size_t /*target_capacity*/) {}
_ZN4absl12lts_2026081718container_internal20HashtablezInfoHandle16RecordInsertMissEmm:
  210|   204M|                               size_t /*distance_from_desired*/) {}
_ZN4absl12lts_2026081718container_internal21ShouldSampleNextTableEv:
  226|  5.57k|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|  5.57k|  return false;
  234|  5.57k|#endif  // ABSL_INTERNAL_HASHTABLEZ_SAMPLE
  235|  5.57k|}

_ZNK4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE14GetIsAllocatedEv:
  372|  5.85k|  bool GetIsAllocated() const { return GetSizeAndIsAllocated() & 1; }
_ZNK4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE21GetSizeAndIsAllocatedEv:
  366|  11.7k|  const SizeType<A>& GetSizeAndIsAllocated() const {
  367|  11.7k|    return metadata_.template get<1>();
  368|  11.7k|  }
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE14GetInlinedDataEv:
  396|  5.85k|  ABSL_ATTRIBUTE_NO_SANITIZE_CFI Pointer<A> GetInlinedData() {
  397|  5.85k|    return reinterpret_cast<Pointer<A>>(data_.inlined.inlined_data);
  398|  5.85k|  }
_ZNK4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE7GetSizeEv:
  370|  5.85k|  SizeType<A> GetSize() const { return GetSizeAndIsAllocated() >> 1; }
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEEC2Ev:
  337|  5.85k|  Storage() : metadata_(A(), /* size and is_allocated */ 0u) {}
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEED2Ev:
  342|  5.85k|  ~Storage() {
  343|       |    // Fast path: if we are empty and not allocated, there's nothing to do.
  344|  5.85k|    if (GetSizeAndIsAllocated() == 0) {
  ------------------
  |  Branch (344:9): [True: 5.85k, False: 0]
  ------------------
  345|  5.85k|      return;
  346|  5.85k|    }
  347|       |
  348|       |    // Fast path: if no destructors need to be run and we know the allocator
  349|       |    // doesn't do anything fancy, then all we need to do is deallocate (and
  350|       |    // maybe not even that).
  351|      0|    if (std::is_trivially_destructible_v<ValueType<A>> &&
  ------------------
  |  Branch (351:9): [True: 0, Folded]
  ------------------
  352|      0|        std::is_same_v<A, std::allocator<ValueType<A>>>) {
  ------------------
  |  Branch (352:9): [True: 0, Folded]
  ------------------
  353|      0|      DeallocateIfAllocated();
  354|      0|      return;
  355|      0|    }
  356|       |
  357|      0|    DestroyContents();
  358|      0|  }
_ZN4absl12lts_2026081723inlined_vector_internal7StorageIPNS0_7LogSinkELm16ENSt3__19allocatorIS4_EEE21GetSizeAndIsAllocatedEv:
  364|  5.85k|  SizeType<A>& GetSizeAndIsAllocated() { return metadata_.template get<1>(); }

_ZN4absl12lts_2026081718container_internal15internal_layout21LayoutWithStaticSizesINSt3__116integer_sequenceImJLm1EEEEJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSB_IPNS9_11SerialArenaEEEEE7PartialIJEEENS2_10LayoutImplINS4_5tupleIJSA_SD_SG_EEES6_18__make_integer_seqIS5_mXsZT_EESM_IS5_mXplsZT_clL_ZNS4_18__integer_sequenceImJLm1EEE4sizeB8ne220000EvEEEESM_IS5_mXclL_ZNS2_11adl_barrier3MinEmmEsZT1_plplsZT_clL_ZNSP_4sizeB8ne220000EvEELi1EEEEEEDpOT_:
  741|  19.6k|  static constexpr PartialType<sizeof...(Sizes)> Partial(Sizes&&... sizes) {
  742|  19.6k|    static_assert(sizeof...(Sizes) + StaticSizeSeq::size() <= sizeof...(Ts),
  743|  19.6k|                  "");
  744|  19.6k|    return PartialType<sizeof...(Sizes)>(
  745|  19.6k|        static_cast<size_t>(std::forward<Sizes>(sizes))...);
  746|  19.6k|  }
_ZN4absl12lts_2026081718container_internal15internal_layout10LayoutImplINSt3__15tupleIJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSA_IPNS8_11SerialArenaEEEEEENS4_16integer_sequenceImJLm1EEEENSH_ImJEEENSH_ImJLm0EEEENSH_ImJLm0ELm1EEEEEC2Ev:
  401|  19.6k|      : size_{sizes...} {}
_ZNK4absl12lts_2026081718container_internal15internal_layout10LayoutImplINSt3__15tupleIJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSA_IPNS8_11SerialArenaEEEEEENS4_16integer_sequenceImJLm1EEEENSH_ImJEEENSH_ImJLm0EEEENSH_ImJLm0ELm1EEEEE6OffsetILm0EEEmv:
  418|  19.6k|  constexpr size_t Offset() const {
  419|  19.6k|    if constexpr (N == 0) {
  420|  19.6k|      return 0;
  421|       |    } else {
  422|       |      static_assert(N < NumOffsets, "Index out of bounds");
  423|       |      return adl_barrier::Align(
  424|       |          Offset<N - 1>() + SizeOf<ElementType<N - 1>>::value * Size<N - 1>(),
  425|       |          ElementAlignment<N>::value);
  426|       |    }
  427|  19.6k|  }
_ZNK4absl12lts_2026081718container_internal15internal_layout10LayoutImplINSt3__15tupleIJN6google8protobuf8internal22SerialArenaChunkHeaderENS4_6atomicIPvEENSA_IPNS8_11SerialArenaEEEEEENS4_16integer_sequenceImJLm1EEEENSH_ImJEEENSH_ImJLm0EEEENSH_ImJLm0ELm1EEEEE7PointerILm0EKcEEPNS4_11conditionalIXsr3stdE10is_const_vIT0_EEKNS4_13tuple_elementIXT_ESG_E4typeEST_E4typeEPSQ_:
  496|  19.6k|  CopyConst<Char, ElementType<N>>* Pointer(Char* p) const {
  497|  19.6k|    using C = std::remove_const_t<Char>;
  498|  19.6k|    static_assert(
  499|  19.6k|        std::is_same<C, char>() || std::is_same<C, unsigned char>() ||
  500|  19.6k|            std::is_same<C, signed char>(),
  501|  19.6k|        "The argument must be a pointer to [const] [signed|unsigned] char");
  502|  19.6k|    constexpr size_t alignment = Alignment();
  503|  19.6k|    (void)alignment;
  504|       |    assert(reinterpret_cast<uintptr_t>(p) % alignment == 0);
  505|  19.6k|    return reinterpret_cast<CopyConst<Char, ElementType<N>>*>(p + Offset<N>());
  506|  19.6k|  }

_ZN4absl12lts_2026081718container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEC2Ev:
  107|      2|  raw_hash_map() {}
_ZN4absl12lts_2026081718container_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|    512|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  340|    512|    return this->template operator[]<K, P, 0>(key);
  341|    512|  }
_ZN4absl12lts_2026081718container_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|    512|      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|    512|    return Policy::value(&this->unchecked_deref(try_emplace(key).first));
  334|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11try_emplaceINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEJETnNS4_9enable_ifIXsr14LifetimeBoundKIT_Lb1EPSH_EE5valueEiE4typeELi0ETnNSG_IXntsr3stdE16is_convertible_vISH_NS1_12raw_hash_setIS9_JEE14const_iteratorEEEiE4typeELi0EEENS4_4pairINSM_8iteratorEbEERKSH_DpOT0_:
  253|    512|      Args&&... args) ABSL_ATTRIBUTE_LIFETIME_BOUND {
  254|    512|    return this->template try_emplace<K, 0>(k, std::forward<Args>(args)...);
  255|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11try_emplaceINS4_12basic_stringIcS7_NS4_9allocatorIcEEEELi0EJETnNS4_9enable_ifIXntsr3stdE16is_convertible_vIT_NS1_12raw_hash_setIS9_JEE14const_iteratorEEEiE4typeELi0EEENS4_4pairINSJ_8iteratorEbEERKSH_DpOT1_:
  245|    512|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  246|    512|    return try_emplace_impl(k, std::forward<Args>(args)...);
  247|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE16try_emplace_implIRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEJEEENS4_4pairINS1_12raw_hash_setIS9_JEE8iteratorEbEEOT_DpOT0_:
  365|    512|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  366|    512|    auto res = this->find_or_prepare_insert(k);
  367|    512|    if (res.second) {
  ------------------
  |  Branch (367:9): [True: 512, False: 0]
  ------------------
  368|    512|      this->emplace_at(res.first, std::piecewise_construct,
  369|    512|                       std::forward_as_tuple(std::forward<K>(k)),
  370|    512|                       std::forward_as_tuple(std::forward<Args>(args)...));
  371|    512|    }
  372|    512|    return {this->non_iterable_iterator_at_slot(res.first), res.second};
  373|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_mapINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEEC2Ev:
  107|      4|  raw_hash_map() {}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_mapINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEEC2Ev:
  107|  5.57k|  raw_hash_map() {}

_ZN4absl12lts_2026081718container_internal5ClearILb0EEEvRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPFvPvS8_ES8_:
  929|      6|           DestroySlotFn destroy_slot, void* alloc) {
  930|      6|  if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (930:7): [Folded, False: 6]
  |  Branch (930:7): [Folded, False: 6]
  ------------------
  931|      0|      c.maybe_invalid_capacity().IsMovedFrom()) {
  ------------------
  |  Branch (931:7): [True: 0, False: 0]
  ------------------
  932|      0|    c.set_capacity(policy.soo_capacity());
  933|      0|  }
  934|      6|  c.AssertNotDebugCapacity();
  935|      6|  const size_t cap = c.capacity();
  936|       |  if constexpr (kSooEnabled) {
  937|       |    ABSL_ASSUME(cap > 0);
  938|       |  }
  939|      6|  if (c.is_small()) {
  ------------------
  |  Branch (939:7): [True: 4, False: 2]
  ------------------
  940|      4|    if (!c.empty()) {
  ------------------
  |  Branch (940:9): [True: 0, False: 4]
  ------------------
  941|      0|      if (destroy_slot != nullptr) {
  ------------------
  |  Branch (941:11): [True: 0, False: 0]
  ------------------
  942|      0|        destroy_slot(&c, SingleSlotAddress<kSooEnabled>(c));
  943|      0|      }
  944|      0|      DecrementSmallSize<kSooEnabled>(c);
  945|      0|      c.infoz().RecordStorageChanged(0, cap);
  946|      0|    }
  947|      4|  } else {
  948|      2|    if (destroy_slot != nullptr) {
  ------------------
  |  Branch (948:9): [True: 0, False: 2]
  ------------------
  949|      0|      DestroySlots(c, policy.slot_size, destroy_slot);
  950|      0|    }
  951|       |    // Iterating over this container is O(bucket_count()). When bucket_count()
  952|       |    // is much greater than size(), iteration becomes prohibitively expensive.
  953|       |    // For clear() it is more important to reuse the allocated array when the
  954|       |    // container is small because allocation takes comparatively long time
  955|       |    // compared to destruction of the elements of the container. So we pick the
  956|       |    // largest bucket_count() threshold for which iteration is still fast and
  957|       |    // past that we simply deallocate the array.
  958|      2|    ClearBackingArray(c, policy, alloc, /*reuse=*/cap < 128);
  959|      2|  }
  960|      6|  c.set_reserved_growth(0);
  961|      6|  c.set_reservation_size(0);
  962|      6|}
_ZN4absl12lts_2026081718container_internal17NextHashTableSeedEv:
  144|  5.57k|uint8_t NextHashTableSeed() {
  145|  5.57k|  return static_cast<uint8_t>(RandomSeed());
  146|  5.57k|}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor23InitGrowthLeftNoDeletedEmm:
  361|  76.5k|                                                 size_t capacity) {
  362|  76.5k|  if (capacity <= GrowthInfoLowerBound::kMaxGrowthLeftLowerBound) {
  ------------------
  |  Branch (362:7): [True: 33.4k, False: 43.1k]
  ------------------
  363|  33.4k|    *growth_info_lower_bound_ = static_cast<uint8_t>(growth_left);
  364|  43.1k|  } else {
  365|  43.1k|    uint64_t lower_bound =
  366|  43.1k|        (std::min)(uint64_t{growth_left},
  367|  43.1k|                   GrowthInfoLowerBound::kMaxGrowthLeftLowerBound);
  368|  43.1k|    little_endian::Store64(
  369|  43.1k|        full_growth_info_ptr(),
  370|  43.1k|        GetPackedIncrement(lower_bound, growth_left - lower_bound));
  371|  43.1k|  }
  372|  76.5k|}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor29RebalanceGrowthLeftLowerBoundEm:
  375|  1.65M|    size_t capacity) {
  376|  1.65M|  auto growth_left_lower_bound = GetGrowthInfoLowerBound();
  377|  1.65M|  if (capacity <= GrowthInfoLowerBound::kMaxGrowthLeftLowerBound ||
  ------------------
  |  Branch (377:7): [True: 33.4k, False: 1.62M]
  ------------------
  378|       |      // For tables with deleted slots, we often call rebalance even if
  379|       |      // we have growth left in the lower bound.
  380|  1.62M|      growth_left_lower_bound.HasDeletedAndGrowthLeft()) {
  ------------------
  |  Branch (380:7): [True: 0, False: 1.62M]
  ------------------
  381|  33.4k|    return growth_left_lower_bound;
  382|  1.62M|  } else {
  383|  1.62M|    return RebalanceGrowthLeftLowerBoundLargeCapacity();
  384|  1.62M|  }
  385|  1.65M|}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor42RebalanceGrowthLeftLowerBoundLargeCapacityEv:
  397|  1.62M|GrowthInfoAccessor::RebalanceGrowthLeftLowerBoundLargeCapacity() {
  398|  1.62M|  void* full_growth_info = full_growth_info_ptr();
  399|  1.62M|  uint64_t packed_full_growth_info = little_endian::Load64(full_growth_info);
  400|  1.62M|  uint64_t overflow_growth_left =
  401|  1.62M|      GetOverflowGrowthLeftFromPacked(packed_full_growth_info);
  402|  1.62M|  uint64_t lower_bound_growth_left =
  403|  1.62M|      GetGrowthLeftLowerBoundFromPacked(packed_full_growth_info);
  404|  1.62M|  uint64_t overflow_to_lower_bound_size =
  405|  1.62M|      (std::min)(overflow_growth_left,
  406|  1.62M|                 GrowthInfoLowerBound::kMaxGrowthLeftLowerBound -
  407|  1.62M|                     lower_bound_growth_left);
  408|  1.62M|  packed_full_growth_info +=
  409|  1.62M|      GetRebalanceIncrement(overflow_to_lower_bound_size);
  410|  1.62M|  little_endian::Store64(full_growth_info, packed_full_growth_info);
  411|  1.62M|  auto result = GetGrowthInfoLowerBoundFromPacked(packed_full_growth_info);
  412|  1.62M|  ABSL_SWISSTABLE_ASSERT(result.HasNoDeleted() ==
  ------------------
  |  |   66|  1.62M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  413|  1.62M|                         GetGrowthInfoLowerBound().HasNoDeleted());
  414|       |  ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |   66|  1.62M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  415|  1.62M|      (result.GetGrowthLeft() > 0 ||
  416|  1.62M|       GetGrowthLeftTotalBigCapacity(full_growth_info_ptr()) == 0) &&
  417|  1.62M|      "rebalance may return 0 only if we have absolutely no growth left");
  418|  1.62M|  return result;
  419|  1.62M|}
_ZN4absl12lts_2026081718container_internal17ClearBackingArrayERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPvb:
  887|      2|                       bool reuse) {
  888|      2|  ABSL_SWISSTABLE_ASSERT(c.capacity() > kMaxSmallCapacity);
  ------------------
  |  |   66|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  889|      2|  if (reuse) {
  ------------------
  |  Branch (889:7): [True: 2, False: 0]
  ------------------
  890|      2|    const size_t blocked_element_count = c.blocked_element_count();
  891|      2|    c.set_size_to_zero();
  892|      2|    ABSL_SWISSTABLE_ASSERT(c.capacity() > policy.soo_capacity());
  ------------------
  |  |   66|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  893|      2|    ResetCtrl(c, policy.slot_size, blocked_element_count);
  894|      2|    ResetGrowthLeft(c.growth_info(), c.capacity(), blocked_element_count);
  895|      2|    ABSL_SWISSTABLE_ASSERT(c.blocked_element_count() == blocked_element_count);
  ------------------
  |  |   66|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  896|      2|    c.infoz().RecordStorageChanged(0, c.capacity());
  897|      2|  } else {
  898|      0|    ClearBackingArrayNoReuse(c, policy, alloc);
  899|      0|  }
  900|      2|}
_ZN4absl12lts_2026081718container_internal19DeallocBackingArrayERNS1_12CommonFieldsEmmPFvPvmPNS1_6ctrl_tEmmbmES4_:
  920|  5.57k|                         DeallocBackingArrayFn dealloc, void* alloc) {
  921|  5.57k|  const size_t cap = c.capacity();
  922|  5.57k|  c.infoz().Unregister();
  923|  5.57k|  dealloc(alloc, cap, c.control(), slot_size, slot_align, c.has_infoz(),
  924|  5.57k|          c.blocked_element_count());
  925|  5.57k|}
_ZN4absl12lts_2026081718container_internal14DestructNonSooERNS1_12CommonFieldsEmmPFvPvS4_EPFvS4_mPNS1_6ctrl_tEmmbmES4_:
  981|  5.57k|                    void* alloc) {
  982|  5.57k|  ABSL_SWISSTABLE_ASSERT(c.capacity() > 0);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  983|  5.57k|  if (destroy_slot != nullptr) {
  ------------------
  |  Branch (983:7): [True: 0, False: 5.57k]
  ------------------
  984|      0|    if (c.is_small()) {
  ------------------
  |  Branch (984:9): [True: 0, False: 0]
  ------------------
  985|      0|      if (!c.empty()) {
  ------------------
  |  Branch (985:11): [True: 0, False: 0]
  ------------------
  986|      0|        static_assert(kMaxSmallCapacity == 1);
  987|      0|        destroy_slot(&c, c.slot_array(/*capacity=*/1));
  988|      0|      }
  989|      0|    } else {
  990|      0|      DestroySlots(c, slot_size, destroy_slot);
  991|      0|    }
  992|      0|  }
  993|  5.57k|  DeallocBackingArray(c, slot_size, slot_align, dealloc, alloc);
  994|  5.57k|}
_ZN4absl12lts_2026081718container_internal24PrepareInsertSmallNonSooERNS1_12CommonFieldsERKNS1_15PolicyFunctionsENS0_11FunctionRefIFmmEEE:
 1855|  11.1k|                               absl::FunctionRef<size_t(size_t)> get_hash) {
 1856|  11.1k|  ABSL_SWISSTABLE_ASSERT(common.is_small());
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1857|  11.1k|  ABSL_SWISSTABLE_ASSERT(!policy.soo_enabled);
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1858|  11.1k|  if (common.capacity() == 1) {
  ------------------
  |  Branch (1858:7): [True: 5.57k, False: 5.57k]
  ------------------
 1859|  5.57k|    if (common.empty()) {
  ------------------
  |  Branch (1859:9): [True: 0, False: 5.57k]
  ------------------
 1860|      0|      IncrementSmallSizeNonSoo(common, policy);
 1861|      0|      if (common.has_infoz()) {
  ------------------
  |  Branch (1861:11): [True: 0, False: 0]
  ------------------
 1862|      0|        common.infoz().RecordInsertMiss(get_hash(common.seed().seed()),
 1863|      0|                                        /*distance_from_desired=*/0);
 1864|      0|      }
 1865|      0|      return common.slot_array(/*capacity=*/1);
 1866|  5.57k|    } else {
 1867|  5.57k|      return Grow1To3AndPrepareInsert(common, policy, get_hash);
 1868|  5.57k|    }
 1869|  5.57k|  }
 1870|       |
 1871|       |  // Growing from 0 to 1 capacity.
 1872|  5.57k|  ABSL_SWISSTABLE_ASSERT(common.capacity() == 0);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1873|  5.57k|  constexpr size_t kNewCapacity = 1;
 1874|       |
 1875|  5.57k|  common.set_capacity(kNewCapacity);
 1876|  5.57k|  HashtablezInfoHandle infoz;
 1877|  5.57k|  const bool should_sample =
 1878|  5.57k|      policy.is_hashtablez_eligible && ShouldSampleNextTable();
  ------------------
  |  Branch (1878:7): [True: 5.57k, False: 0]
  |  Branch (1878:40): [True: 0, False: 5.57k]
  ------------------
 1879|  5.57k|  if (ABSL_PREDICT_FALSE(should_sample)) {
  ------------------
  |  |  190|  5.57k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.57k]
  |  |  |  Branch (190:49): [Folded, False: 5.57k]
  |  |  |  Branch (190:58): [True: 0, False: 5.57k]
  |  |  ------------------
  ------------------
 1880|      0|    infoz = ForcedTrySample(policy.slot_size, policy.key_size,
 1881|      0|                            policy.value_size, policy.soo_capacity());
 1882|      0|  }
 1883|  5.57k|  const bool has_infoz = infoz.IsSampled();
 1884|  5.57k|  void* alloc = policy.get_char_alloc(common);
 1885|       |
 1886|  5.57k|  const auto [new_ctrl, new_slots] =
 1887|  5.57k|      AllocBackingArray(common, policy, kNewCapacity, has_infoz, alloc,
 1888|  5.57k|                        /*blocked_element_count=*/0);
 1889|  5.57k|  common.set_control(new_ctrl);
 1890|       |
 1891|  5.57k|  static_assert(NextCapacity(0) == 1);
 1892|  5.57k|  PrepareInsertCommon(common);
 1893|       |
 1894|  5.57k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  5.57k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.57k]
  |  |  |  Branch (190:49): [Folded, False: 5.57k]
  |  |  |  Branch (190:58): [True: 0, False: 5.57k]
  |  |  ------------------
  ------------------
 1895|      0|    common.generate_new_seed(/*has_infoz=*/true);
 1896|      0|    ReportSingleGroupTableGrowthToInfoz(common, infoz,
 1897|      0|                                        get_hash(common.seed().seed()));
 1898|      0|  }
 1899|  5.57k|  return new_slots;
 1900|  11.1k|}
_ZN4absl12lts_2026081718container_internal19GetRefForEmptyClassERNS1_12CommonFieldsE:
 2096|  87.7k|void* GetRefForEmptyClass(CommonFields& common) {
 2097|       |  // Empty base optimization typically make the empty base class address to be
 2098|       |  // the same as the first address of the derived class object.
 2099|       |  // But we generally assume that for empty classes we can return any valid
 2100|       |  // pointer.
 2101|  87.7k|  return &common;
 2102|  87.7k|}
_ZN4absl12lts_2026081718container_internal24ReserveTableToFitNewSizeERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 2346|      4|                              size_t new_size) {
 2347|      4|  new_size =
 2348|      4|      std::min(new_size, MaxValidSize(policy.key_size, policy.slot_size));
 2349|      4|  common.reset_reserved_growth(new_size);
 2350|      4|  common.set_reservation_size(new_size);
 2351|      4|  ABSL_SWISSTABLE_ASSERT(new_size > policy.soo_capacity());
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2352|      4|  const size_t cap = common.capacity();
 2353|      4|  if (ABSL_PREDICT_TRUE(common.empty() && cap <= policy.soo_capacity())) {
  ------------------
  |  |  191|      8|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 4, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 4]
  |  |  |  Branch (191:58): [True: 4, False: 0]
  |  |  |  Branch (191:58): [True: 4, False: 0]
  |  |  ------------------
  ------------------
 2354|      4|    return ReserveEmptyNonAllocatedTableToFitNewSize(common, policy, new_size);
 2355|      4|  }
 2356|       |
 2357|      0|  ABSL_SWISSTABLE_ASSERT(!common.empty() || cap > policy.soo_capacity());
  ------------------
  |  |   66|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2358|      0|  ABSL_SWISSTABLE_ASSERT(cap > 0);
  ------------------
  |  |   66|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2359|      0|  const size_t max_size_before_growth =
 2360|      0|      IsSmallCapacity(cap)
  ------------------
  |  Branch (2360:7): [True: 0, False: 0]
  ------------------
 2361|      0|          ? cap
 2362|      0|          : common.size() + common.growth_info().GetGrowthLeftTotalSlow(cap);
 2363|      0|  if (new_size <= max_size_before_growth) {
  ------------------
  |  Branch (2363:7): [True: 0, False: 0]
  ------------------
 2364|      0|    return;
 2365|      0|  }
 2366|      0|  ReserveAllocatedTable(common, policy, new_size);
 2367|      0|}
_ZN4absl12lts_2026081718container_internal18PrepareInsertLargeERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmNS1_18NonIterableBitMaskIjLi16ELi0EEENS1_8FindInfoE:
 2400|   204M|                         FindInfo target_group) {
 2401|       |  // NOLINTNEXTLINE(misc-static-assert)
 2402|       |  ABSL_SWISSTABLE_ASSERT(!SwisstableGenerationsEnabled());
  ------------------
  |  |   66|   204M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2403|   204M|  return PrepareInsertLargeImpl(common, policy, hash, mask_empty, target_group);
 2404|   204M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119Resize1To3NewOffsetEmNS1_12PerTableSeedE:
  113|  5.57k|size_t Resize1To3NewOffset(size_t hash, PerTableSeed seed) {
  114|       |  // After resize from capacity 1 to 3, we always have exactly the slot with
  115|       |  // index 1 occupied, so we need to insert either at index 0 or index 2.
  116|  5.57k|  static_assert(SooSlotIndex() == 1);
  117|  5.57k|  return SingleGroupTableH1(hash, seed) & 2;
  118|  5.57k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118SingleGroupTableH1EmNS1_12PerTableSeedE:
  108|  16.7k|size_t SingleGroupTableH1(size_t hash, PerTableSeed seed) {
  109|  16.7k|  return hash ^ seed.seed();
  110|  16.7k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_111SlotAddressEPvmm:
  122|   204M|inline void* SlotAddress(void* slot_array, size_t slot, size_t slot_size) {
  123|   204M|  return static_cast<void*>(static_cast<char*>(slot_array) +
  124|   204M|                            (slot * slot_size));
  125|   204M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_110RandomSeedEv:
   81|  5.57k|inline size_t RandomSeed() {
   82|  5.57k|  constexpr size_t kIncrement = 0xad53;
   83|  5.57k|#ifdef ABSL_HAVE_THREAD_LOCAL
   84|  5.57k|  static thread_local size_t counter = 0;
   85|  5.57k|  counter += kIncrement;
   86|  5.57k|  size_t value = counter;
   87|       |#else   // ABSL_HAVE_THREAD_LOCAL
   88|       |  static std::atomic<size_t> counter(0);
   89|       |  size_t value = counter.fetch_add(kIncrement, std::memory_order_relaxed);
   90|       |#endif  // ABSL_HAVE_THREAD_LOCAL
   91|  5.57k|  return value ^ static_cast<size_t>(reinterpret_cast<uintptr_t>(&counter));
   92|  5.57k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GetPackedIncrementEmm:
  292|  1.66M|                                      uint64_t overflow_increment) {
  293|  1.66M|  return (lower_bound_increment << GrowthInfoAccessor::kLowerBoundShift) +
  294|  1.66M|         overflow_increment;
  295|  1.66M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131GetOverflowGrowthLeftFromPackedEm:
  308|  1.62M|    uint64_t packed_full_growth_info) {
  309|  1.62M|  constexpr uint64_t kFullGrowthMask =
  310|  1.62M|      (uint64_t{1} << GrowthInfoAccessor::kLowerBoundShift) - 1;
  311|  1.62M|  return packed_full_growth_info & kFullGrowthMask;
  312|  1.62M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_133GetGrowthLeftLowerBoundFromPackedEm:
  324|  1.62M|    uint64_t packed_full_growth_info) {
  325|  1.62M|  return GetGrowthInfoLowerBoundFromPacked(packed_full_growth_info)
  326|  1.62M|      .GetGrowthLeft();
  327|  1.62M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_121GetRebalanceIncrementEm:
  301|  1.62M|    uint64_t overflow_to_lower_bound_size) {
  302|  1.62M|  return GetPackedIncrement(overflow_to_lower_bound_size,
  303|  1.62M|                            0u - overflow_to_lower_bound_size);
  304|  1.62M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_133GetGrowthInfoLowerBoundFromPackedEm:
  317|  3.24M|    uint64_t packed_full_growth_info) {
  318|  3.24M|  return GrowthInfoLowerBound(packed_full_growth_info >>
  319|  3.24M|                              GrowthInfoAccessor::kLowerBoundShift);
  320|  3.24M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119PrepareInsertCommonERNS1_12CommonFieldsE:
  500|   204M|void PrepareInsertCommon(CommonFields& common) {
  501|   204M|  common.increment_size();
  502|   204M|  common.maybe_increment_generation_on_insert();
  503|   204M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_135InitializeThreeElementsControlBytesEhhmPNS1_6ctrl_tE:
  759|  5.57k|    h2_t orig_h2, h2_t new_h2, size_t new_offset, ctrl_t* new_ctrl) {
  760|  5.57k|  static constexpr size_t kNewCapacity = NextCapacity(SooCapacity());
  761|  5.57k|  static_assert(kNewCapacity == 3);
  762|  5.57k|  static_assert(is_single_group(kNewCapacity));
  763|  5.57k|  static_assert(SooSlotIndex() == 1);
  764|  5.57k|  ABSL_SWISSTABLE_ASSERT(new_offset == 0 || new_offset == 2);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  765|       |
  766|  5.57k|  static constexpr uint64_t kEmptyXorSentinel =
  767|  5.57k|      static_cast<uint8_t>(ctrl_t::kEmpty) ^
  768|  5.57k|      static_cast<uint8_t>(ctrl_t::kSentinel);
  769|  5.57k|  static constexpr uint64_t kEmpty64 = static_cast<uint8_t>(ctrl_t::kEmpty);
  770|  5.57k|  static constexpr size_t kMirroredSooSlotIndex =
  771|  5.57k|      SooSlotIndex() + kNewCapacity + 1;
  772|       |  // The first 8 bytes, where SOO slot original and mirrored positions are
  773|       |  // replaced with 0.
  774|       |  // Result will look like: E0ESE0EE
  775|  5.57k|  static constexpr uint64_t kFirstCtrlBytesWithZeroes =
  776|  5.57k|      k8EmptyBytes ^ (kEmpty64 << (8 * SooSlotIndex())) ^
  777|  5.57k|      (kEmptyXorSentinel << (8 * kNewCapacity)) ^
  778|  5.57k|      (kEmpty64 << (8 * kMirroredSooSlotIndex));
  779|       |
  780|  5.57k|  const uint64_t soo_h2 = static_cast<uint64_t>(orig_h2);
  781|  5.57k|  const uint64_t new_h2_xor_empty =
  782|  5.57k|      static_cast<uint64_t>(new_h2 ^ static_cast<uint8_t>(ctrl_t::kEmpty));
  783|       |  // Fill the original and mirrored bytes for SOO slot.
  784|       |  // Result will look like:
  785|       |  // EHESEHEE
  786|       |  // Where H = soo_h2, E = kEmpty, S = kSentinel.
  787|  5.57k|  uint64_t first_ctrl_bytes =
  788|  5.57k|      ((soo_h2 << (8 * SooSlotIndex())) | kFirstCtrlBytesWithZeroes) |
  789|  5.57k|      (soo_h2 << (8 * kMirroredSooSlotIndex));
  790|       |  // Replace original and mirrored empty bytes for the new position.
  791|       |  // Result for new_offset 0 will look like:
  792|       |  // NHESNHEE
  793|       |  // Where H = soo_h2, N = H2(new_hash), E = kEmpty, S = kSentinel.
  794|       |  // Result for new_offset 2 will look like:
  795|       |  // EHNSEHNE
  796|  5.57k|  first_ctrl_bytes ^= (new_h2_xor_empty << (8 * new_offset));
  797|  5.57k|  size_t new_mirrored_offset = new_offset + kNewCapacity + 1;
  798|  5.57k|  first_ctrl_bytes ^= (new_h2_xor_empty << (8 * new_mirrored_offset));
  799|       |
  800|       |  // Fill last bytes with kEmpty.
  801|  5.57k|  std::memset(new_ctrl + kNewCapacity, static_cast<int8_t>(ctrl_t::kEmpty),
  802|  5.57k|              Group::kWidth);
  803|       |  // Overwrite the first 8 bytes with first_ctrl_bytes.
  804|  5.57k|  absl::little_endian::Store64(new_ctrl, first_ctrl_bytes);
  805|       |
  806|       |  // Example for group size 16:
  807|       |  // new_ctrl after 1st memset =      ???EEEEEEEEEEEEEEEE
  808|       |  // new_offset 0:
  809|       |  // new_ctrl after 2nd store  =      NHESNHEEEEEEEEEEEEE
  810|       |  // new_offset 2:
  811|       |  // new_ctrl after 2nd store  =      EHNSEHNEEEEEEEEEEEE
  812|       |
  813|       |  // Example for group size 8:
  814|       |  // new_ctrl after 1st memset =      ???EEEEEEEE
  815|       |  // new_offset 0:
  816|       |  // new_ctrl after 2nd store  =      NHESNHEEEEE
  817|       |  // new_offset 2:
  818|       |  // new_ctrl after 2nd store  =      EHNSEHNEEEE
  819|  5.57k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_17SetCtrlERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  532|   202M|                    size_t slot_size) {
  533|       |  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   66|   202M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  534|   202M|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  535|   202M|  SetCtrlNoSanitizeImpl(c, i, h);
  536|   202M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119DoSanitizeOnSetCtrlERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  507|   204M|                                size_t slot_size) {
  508|   204M|  const size_t cap = c.capacity();
  509|   204M|  ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  510|   204M|  ABSL_SWISSTABLE_ASSERT(i < cap);
  ------------------
  |  |   66|   204M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  511|   204M|  auto* slot_i = static_cast<const char*>(c.slot_array(cap)) + i * slot_size;
  512|   204M|  if (IsFull(h)) {
  ------------------
  |  Branch (512:7): [True: 204M, False: 0]
  ------------------
  513|   204M|    SanitizerUnpoisonMemoryRegion(slot_i, slot_size);
  514|   204M|  } else {
  515|      0|    SanitizerPoisonMemoryRegion(slot_i, slot_size);
  516|      0|  }
  517|   204M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_121SetCtrlNoSanitizeImplERKNS1_12CommonFieldsEmNS1_6ctrl_tE:
  523|   202M|inline void SetCtrlNoSanitizeImpl(const CommonFields& c, size_t i, ctrl_t h) {
  524|       |  ABSL_SWISSTABLE_ASSERT(i < c.capacity());
  ------------------
  |  |   66|   202M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  525|   202M|  ctrl_t* ctrl = c.control();
  526|   202M|  const size_t cap = c.capacity();
  527|   202M|  ctrl[i] = h;
  528|   202M|  ctrl[((i - NumClonedBytes()) & cap) + (NumClonedBytes() & cap)] = h;
  529|   202M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119SetCtrlInLargeTableERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  572|  1.74M|                                size_t slot_size) {
  573|       |  ABSL_SWISSTABLE_ASSERT(c.capacity() >= Group::kWidth - 1);
  ------------------
  |  |   66|  1.74M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  574|  1.74M|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  575|  1.74M|  ctrl_t* ctrl = c.control();
  576|  1.74M|  ctrl[i] = h;
  577|  1.74M|  ctrl[((i - NumClonedBytes()) & c.capacity()) + NumClonedBytes()] = h;
  578|  1.74M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_19ResetCtrlERNS1_12CommonFieldsEmm:
  730|      6|               size_t blocked_element_count) {
  731|      6|  ABSL_SWISSTABLE_ASSERT(IsCapacityValidForBlockedElements(common.capacity()) ||
  ------------------
  |  |   66|      6|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  732|      6|                         blocked_element_count == 0);
  733|      6|  const size_t capacity = common.capacity();
  734|      6|  ctrl_t* ctrl = common.control();
  735|      6|  static constexpr size_t kTwoGroupCapacity = 2 * Group::kWidth - 1;
  736|      6|  if (ABSL_PREDICT_TRUE(capacity <= kTwoGroupCapacity)) {
  ------------------
  |  |  191|      6|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 6]
  |  |  |  Branch (191:48): [Folded, False: 6]
  |  |  |  Branch (191:57): [True: 0, False: 6]
  |  |  ------------------
  ------------------
  737|      0|    if (IsSmallCapacity(capacity)) return;
  ------------------
  |  Branch (737:9): [True: 0, False: 0]
  ------------------
  738|      0|    std::memset(ctrl, static_cast<int8_t>(ctrl_t::kEmpty), Group::kWidth);
  739|      0|    std::memset(ctrl + capacity, static_cast<int8_t>(ctrl_t::kEmpty),
  740|      0|                Group::kWidth);
  741|      0|    if (capacity == kTwoGroupCapacity) {
  ------------------
  |  Branch (741:9): [True: 0, False: 0]
  ------------------
  742|      0|      std::memset(ctrl + Group::kWidth, static_cast<int8_t>(ctrl_t::kEmpty),
  743|      0|                  Group::kWidth);
  744|      0|    }
  745|      6|  } else {
  746|      6|    std::memset(ctrl, static_cast<int8_t>(ctrl_t::kEmpty),
  747|      6|                capacity + 1 + NumClonedBytes());
  748|      6|  }
  749|      6|  ctrl[capacity] = ctrl_t::kSentinel;
  750|      6|  SanitizerPoisonMemoryRegion(common.slot_array(capacity),
  751|      6|                              slot_size * (capacity - blocked_element_count));
  752|      6|  BlockControlBytes(common, blocked_element_count);
  753|      6|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117BlockControlBytesERNS1_12CommonFieldsEm:
  585|      6|void BlockControlBytes(CommonFields& common, size_t blocked_element_count) {
  586|      6|  const size_t capacity = common.capacity();
  587|     36|  while (blocked_element_count > 0) {
  ------------------
  |  Branch (587:10): [True: 30, False: 6]
  ------------------
  588|     30|    BlockCtrl(common, capacity - blocked_element_count);
  589|     30|    --blocked_element_count;
  590|     30|  }
  591|      6|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_19BlockCtrlERKNS1_12CommonFieldsEm:
  546|     30|inline void BlockCtrl(const CommonFields& c, size_t i) {
  547|       |  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   66|     30|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  548|     30|  SetCtrlNoSanitizeImpl(c, i, ctrl_t::kSentinel);
  549|     30|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_115ResetGrowthLeftENS1_18GrowthInfoAccessorEmm:
  470|  70.9k|                     size_t occupied_elements) {
  471|  70.9k|  growth_info.InitGrowthLeftNoDeleted(
  472|  70.9k|      CapacityToGrowth(capacity) - occupied_elements, capacity);
  473|  70.9k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117AllocBackingArrayERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmbPvm:
 1085|  82.1k|                                   void* alloc, size_t blocked_element_count) {
 1086|  82.1k|  RawHashSetLayout layout(new_capacity, policy.slot_size, policy.slot_align,
 1087|  82.1k|                          has_infoz, blocked_element_count);
 1088|       |  // Perform a direct call in the common case to allow for profile-guided
 1089|       |  // heap optimization (PGHO) to understand which allocation function is used.
 1090|  82.1k|  constexpr size_t kDefaultAlignment = BackingArrayAlignment(alignof(size_t));
 1091|  82.1k|  char* mem = static_cast<char*>(
 1092|  82.1k|      ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|  82.1k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 82.1k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 82.1k]
  |  |  |  Branch (191:57): [True: 82.1k, False: 0]
  |  |  ------------------
  ------------------
 1093|  82.1k|          policy.alloc ==
 1094|  82.1k|          (&AllocateBackingArray<kDefaultAlignment, std::allocator<char>>))
 1095|  82.1k|          ? AllocateBackingArray<kDefaultAlignment, std::allocator<char>>(
 1096|  82.1k|                alloc, layout.alloc_size())
 1097|  82.1k|          : policy.alloc(alloc, layout.alloc_size()));
 1098|  82.1k|  const GenerationType old_generation = common.generation();
 1099|  82.1k|  common.set_generation_ptr(
 1100|  82.1k|      reinterpret_cast<GenerationType*>(mem + layout.generation_offset()));
 1101|  82.1k|  common.set_generation(NextGeneration(old_generation));
 1102|       |
 1103|  82.1k|  return {reinterpret_cast<ctrl_t*>(mem + layout.control_offset()),
 1104|  82.1k|          mem + layout.slot_offset()};
 1105|  82.1k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_124Grow1To3AndPrepareInsertERNS1_12CommonFieldsERKNS1_15PolicyFunctionsENS0_11FunctionRefIFmmEEE:
 1717|  5.57k|                               absl::FunctionRef<size_t(size_t)> get_hash) {
 1718|       |  // TODO(b/413062340): Refactor to reuse more code with
 1719|       |  // GrowSooTableToNextCapacityAndPrepareInsert.
 1720|  5.57k|  ABSL_SWISSTABLE_ASSERT(common.capacity() == 1);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1721|  5.57k|  ABSL_SWISSTABLE_ASSERT(!common.empty());
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1722|  5.57k|  ABSL_SWISSTABLE_ASSERT(!policy.soo_enabled);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1723|       |  // 1-element tables can't have any blocked elements.
 1724|  5.57k|  ABSL_SWISSTABLE_ASSERT(common.blocked_element_count() == 0);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1725|  5.57k|  constexpr size_t kOldCapacity = 1;
 1726|  5.57k|  constexpr size_t kNewCapacity = NextCapacity(kOldCapacity);
 1727|  5.57k|  void* old_slots = common.slot_array(kOldCapacity);
 1728|       |
 1729|  5.57k|  const size_t slot_size = policy.slot_size;
 1730|  5.57k|  const size_t slot_align = policy.slot_align;
 1731|  5.57k|  void* alloc = policy.get_char_alloc(common);
 1732|  5.57k|  HashtablezInfoHandle infoz = common.infoz();
 1733|  5.57k|  const bool has_infoz = infoz.IsSampled();
 1734|  5.57k|  common.set_capacity(kNewCapacity);
 1735|       |
 1736|  5.57k|  const auto [new_ctrl, new_slots] =
 1737|  5.57k|      AllocBackingArray(common, policy, kNewCapacity, has_infoz, alloc,
 1738|  5.57k|                        /*blocked_element_count=*/0);
 1739|  5.57k|  common.set_control(new_ctrl);
 1740|  5.57k|  SanitizerPoisonMemoryRegion(new_slots, kNewCapacity * slot_size);
 1741|       |
 1742|  5.57k|  if (ABSL_PREDICT_TRUE(!has_infoz)) {
  ------------------
  |  |  191|  5.57k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 5.57k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 5.57k]
  |  |  |  Branch (191:57): [True: 5.57k, False: 0]
  |  |  ------------------
  ------------------
 1743|       |    // When we're sampled, we already have a seed.
 1744|  5.57k|    common.generate_new_seed(/*has_infoz=*/false);
 1745|  5.57k|  }
 1746|  5.57k|  const size_t new_hash = get_hash(common.seed().seed());
 1747|  5.57k|  h2_t new_h2 = H2(new_hash);
 1748|  5.57k|  size_t orig_hash =
 1749|  5.57k|      policy.hash_slot(policy.hash_fn(common), old_slots, common.seed().seed());
 1750|  5.57k|  size_t offset = Resize1To3NewOffset(new_hash, common.seed());
 1751|  5.57k|  InitializeThreeElementsControlBytes(H2(orig_hash), new_h2, offset, new_ctrl);
 1752|       |
 1753|  5.57k|  void* old_element_target = NextSlot(new_slots, slot_size);
 1754|  5.57k|  SanitizerUnpoisonMemoryRegion(old_element_target, slot_size);
 1755|  5.57k|  policy.transfer_n(&common, old_element_target, old_slots, 1);
 1756|       |
 1757|  5.57k|  void* new_element_target_slot = SlotAddress(new_slots, offset, slot_size);
 1758|  5.57k|  SanitizerUnpoisonMemoryRegion(new_element_target_slot, slot_size);
 1759|       |
 1760|  5.57k|  policy.dealloc(alloc, kOldCapacity,
 1761|       |                 // old_slots == old_ctrl in case of capacity == 1.
 1762|  5.57k|                 static_cast<ctrl_t*>(old_slots),
 1763|  5.57k|                 slot_size, slot_align, has_infoz,
 1764|  5.57k|                 /*blocked_element_count=*/0);
 1765|  5.57k|  PrepareInsertCommon(common);
 1766|  5.57k|  ABSL_SWISSTABLE_ASSERT(common.size() == 2);
  ------------------
  |  |   66|  5.57k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1767|  5.57k|  GetGrowthInfoFromControl(new_ctrl).InitGrowthLeftNoDeleted(kNewCapacity - 2,
 1768|  5.57k|                                                             kNewCapacity);
 1769|       |
 1770|  5.57k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  5.57k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.57k]
  |  |  |  Branch (190:49): [Folded, False: 5.57k]
  |  |  |  Branch (190:58): [True: 0, False: 5.57k]
  |  |  ------------------
  ------------------
 1771|      0|    ReportSingleGroupTableGrowthToInfoz(common, infoz, new_hash);
 1772|      0|  }
 1773|  5.57k|  return new_element_target_slot;
 1774|  5.57k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_18NextSlotEPvmm:
  129|  16.7k|inline void* NextSlot(void* slot, size_t slot_size, size_t i = 1) {
  130|  16.7k|  return reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(slot) +
  131|  16.7k|                                 slot_size * i);
  132|  16.7k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_125SetCtrlInSingleGroupTableERKNS1_12CommonFieldsEmhm:
  565|  11.1k|                                      size_t slot_size) {
  566|  11.1k|  SetCtrlInSingleGroupTable(c, i, static_cast<ctrl_t>(h), slot_size);
  567|  11.1k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_125SetCtrlInSingleGroupTableERKNS1_12CommonFieldsEmNS1_6ctrl_tEm:
  554|  11.1k|                                      size_t slot_size) {
  555|  11.1k|  const size_t cap = c.capacity();
  556|  11.1k|  ABSL_SWISSTABLE_ASSERT(!c.is_small());
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  557|       |  ABSL_SWISSTABLE_ASSERT(is_single_group(cap));
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  558|  11.1k|  DoSanitizeOnSetCtrl(c, i, h, slot_size);
  559|  11.1k|  ctrl_t* ctrl = c.control();
  560|  11.1k|  ctrl[i] = h;
  561|  11.1k|  ctrl[i + cap + 1] = h;
  562|  11.1k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119find_first_non_fullERKNS1_12CommonFieldsEm:
  207|  1.64M|FindInfo find_first_non_full(const CommonFields& common, size_t hash) {
  208|  1.64M|  return find_first_non_full_from_h1(common.control(), H1(hash),
  209|  1.64M|                                     common.capacity_impl());
  210|  1.64M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_127find_first_non_full_from_h1EPKNS1_6ctrl_tEmNS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEE:
  190|  1.74M|                                     HashtableCapacity capacity) {
  191|  1.74M|  const size_t cap = capacity.capacity();
  192|  1.74M|  auto seq = probe_h1(ProbeCapacity{cap}, h1);
  193|  1.74M|  if (IsEmptyOrDeleted(ctrl[seq.offset()])) {
  ------------------
  |  Branch (193:7): [True: 665k, False: 1.07M]
  ------------------
  194|   665k|    return {seq.offset(), /*probe_length=*/0};
  195|   665k|  }
  196|  1.07M|  auto mask = probe_till_first_non_full_group(ctrl, seq, cap);
  197|  1.07M|  return {seq.offset(mask.LowestBitSet()), seq.index()};
  198|  1.74M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131probe_till_first_non_full_groupEPKNS1_6ctrl_tERNS1_9probe_seqILm16EEEm:
  177|  1.07M|    [[maybe_unused]] size_t capacity) {
  178|  1.27M|  while (true) {
  ------------------
  |  Branch (178:10): [True: 1.27M, Folded]
  ------------------
  179|  1.27M|    GroupFullEmptyOrDeleted g{ctrl + seq.offset()};
  180|  1.27M|    auto mask = g.MaskEmptyOrDeleted();
  181|  1.27M|    if (mask) {
  ------------------
  |  Branch (181:9): [True: 1.07M, False: 198k]
  ------------------
  182|  1.07M|      return mask;
  183|  1.07M|    }
  184|   198k|    seq.next();
  185|       |    ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity && "full table!");
  ------------------
  |  |   66|   198k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  186|   198k|  }
  187|  1.07M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_17SetCtrlERKNS1_12CommonFieldsEmhm:
  538|   202M|inline void SetCtrl(const CommonFields& c, size_t i, h2_t h, size_t slot_size) {
  539|   202M|  SetCtrl(c, i, static_cast<ctrl_t>(h), slot_size);
  540|   202M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_115ValidateMaxSizeEmmm:
   71|      4|                     [[maybe_unused]] size_t slot_size) {
   72|       |  ABSL_SWISSTABLE_ASSERT(size <= MaxValidSize(key_size, slot_size));
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
   73|      4|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_132ResizeEmptyNonAllocatedTableImplERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmmb:
 1111|      4|                                      bool force_infoz) {
 1112|      4|  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(new_capacity));
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1113|      4|  ABSL_SWISSTABLE_ASSERT(new_capacity > policy.soo_capacity());
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1114|      4|  ABSL_SWISSTABLE_ASSERT(!force_infoz || policy.soo_enabled);
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1115|      4|  ABSL_SWISSTABLE_ASSERT(common.capacity() == policy.soo_capacity());
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1116|      4|  ABSL_SWISSTABLE_ASSERT(common.empty());
  ------------------
  |  |   66|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1117|      4|  const size_t slot_size = policy.slot_size;
 1118|      4|  HashtablezInfoHandle infoz;
 1119|      4|  const bool should_sample =
 1120|      4|      policy.is_hashtablez_eligible && (force_infoz || ShouldSampleNextTable());
  ------------------
  |  Branch (1120:7): [True: 4, False: 0]
  |  Branch (1120:41): [True: 0, False: 4]
  |  Branch (1120:56): [True: 0, False: 4]
  ------------------
 1121|      4|  if (ABSL_PREDICT_FALSE(should_sample)) {
  ------------------
  |  |  190|      4|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 4]
  |  |  |  Branch (190:49): [Folded, False: 4]
  |  |  |  Branch (190:58): [True: 0, False: 4]
  |  |  ------------------
  ------------------
 1122|      0|    infoz = ForcedTrySample(slot_size, policy.key_size, policy.value_size,
 1123|      0|                            policy.soo_capacity());
 1124|      0|  }
 1125|      4|  const bool has_infoz = infoz.IsSampled();
 1126|      4|  void* alloc = policy.get_char_alloc(common);
 1127|       |
 1128|      4|  common.set_capacity(new_capacity);
 1129|      4|  common.init_blocked_element_count(blocked_element_count);
 1130|      4|  const auto [new_ctrl, new_slots] = AllocBackingArray(
 1131|      4|      common, policy, new_capacity, has_infoz, alloc, blocked_element_count);
 1132|      4|  common.set_control(new_ctrl);
 1133|      4|  common.generate_new_seed(has_infoz);
 1134|       |
 1135|      4|  ResetCtrl(common, slot_size, blocked_element_count);
 1136|      4|  if (GrowthInfoSizeForCapacity(new_capacity) > 0) {
  ------------------
  |  Branch (1136:7): [True: 4, False: 0]
  ------------------
 1137|      4|    ResetGrowthLeft(GetGrowthInfoFromControl(new_ctrl), new_capacity,
 1138|      4|                    blocked_element_count);
 1139|      4|  }
 1140|       |
 1141|      4|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|      4|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 4]
  |  |  |  Branch (190:49): [Folded, False: 4]
  |  |  |  Branch (190:58): [True: 0, False: 4]
  |  |  ------------------
  ------------------
 1142|      0|    ReportResizeToInfoz(common, infoz, 0);
 1143|      0|  }
 1144|      4|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_141ReserveEmptyNonAllocatedTableToFitNewSizeERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 2045|      4|    size_t new_size) {
 2046|      4|  ValidateMaxSize(new_size, policy.key_size, policy.slot_size);
 2047|      4|  ABSL_ASSUME(new_size > 0);
  ------------------
  |  |  272|      4|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2048|      4|  const size_t new_capacity = SizeToCapacity(new_size);
 2049|      4|  ResizeEmptyNonAllocatedTableImpl(
 2050|      4|      common, policy, new_capacity,
 2051|      4|      BlockedElementCountForReservedTable(new_capacity, new_size),
 2052|      4|      /*force_infoz=*/false);
 2053|       |  // This is after resize, to ensure that we have completed the allocation
 2054|       |  // and have potentially sampled the hashtable.
 2055|      4|  common.infoz().RecordReservation(new_size);
 2056|      4|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_135BlockedElementCountForReservedTableEmm:
 2025|      4|                                           size_t reserved_size) {
 2026|      4|  if (!IsCapacityValidForBlockedElements(capacity)) {
  ------------------
  |  Branch (2026:7): [True: 0, False: 4]
  ------------------
 2027|      0|    return 0;
 2028|      0|  }
 2029|      4|  const size_t blocked_elements = CapacityToGrowth(capacity) - reserved_size;
 2030|      4|  if (is_single_group(capacity)) {
  ------------------
  |  Branch (2030:7): [True: 0, False: 4]
  ------------------
 2031|       |    // Single group tables never probes, so we can block all the slots.
 2032|      0|    return blocked_elements;
 2033|      0|  }
 2034|      4|  return (std::min)(blocked_elements, kMaxBlockedElementsForLargeTables);
 2035|      4|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_122PrepareInsertLargeImplERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEmNS1_18NonIterableBitMaskIjLi16ELi0EEENS1_8FindInfoE:
 2374|   204M|                             FindInfo target_group) {
 2375|   204M|  ABSL_SWISSTABLE_ASSERT(!common.is_small());
  ------------------
  |  |   66|   204M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2376|   204M|  GrowthInfoAccessor growth_info = common.growth_info();
 2377|       |  // When there are no deleted slots in the table
 2378|       |  // and growth_left is positive, we can insert at the first
 2379|       |  // empty slot in the probe sequence (target).
 2380|   204M|  if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|   204M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1.65M, False: 202M]
  |  |  |  Branch (190:49): [Folded, False: 204M]
  |  |  |  Branch (190:58): [True: 1.65M, False: 202M]
  |  |  ------------------
  ------------------
 2381|   204M|          !growth_info.GetGrowthInfoLowerBound().HasNoDeletedAndGrowthLeft())) {
 2382|  1.65M|    return PrepareInsertLargeSlow(common, policy, hash);
 2383|  1.65M|  }
 2384|   202M|  PrepareInsertCommon(common);
 2385|   202M|  growth_info.OverwriteEmptyAsFull();
 2386|   202M|  const size_t cap = common.capacity();
 2387|   202M|  ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   202M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2388|   202M|  target_group.offset += mask_empty.LowestBitSet();
 2389|   202M|  target_group.offset &= cap;
 2390|   202M|  SetCtrl(common, target_group.offset, H2(hash), policy.slot_size);
 2391|   202M|  common.infoz().RecordInsertMiss(hash, target_group.probe_length);
 2392|   202M|  return SlotAddress(common.slot_array(cap), target_group.offset,
 2393|   202M|                     policy.slot_size);
 2394|   204M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_122PrepareInsertLargeSlowERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1970|  1.65M|                             size_t hash) {
 1971|  1.65M|  GrowthInfoAccessor growth_info = common.growth_info();
 1972|  1.65M|  const size_t cap = common.capacity();
 1973|  1.65M|  ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|  1.65M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1974|  1.65M|  GrowthInfoLowerBound growth_info_lower_bound =
 1975|  1.65M|      growth_info.RebalanceGrowthLeftLowerBound(cap);
 1976|  1.65M|  if (ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|  1.65M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 70.9k, False: 1.58M]
  |  |  |  Branch (191:48): [Folded, False: 1.65M]
  |  |  |  Branch (191:57): [True: 70.9k, False: 1.58M]
  |  |  ------------------
  ------------------
 1977|  1.65M|          growth_info_lower_bound.HasNoGrowthLeftAndNoDeleted())) {
 1978|       |    // Table without deleted slots (>95% cases) that needs to be resized.
 1979|  70.9k|    return GrowToNextCapacityAndPrepareInsert(common, policy, hash);
 1980|  70.9k|  }
 1981|  1.58M|  if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|  1.58M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1.58M]
  |  |  |  Branch (190:49): [Folded, False: 1.58M]
  |  |  |  Branch (190:58): [True: 0, False: 1.58M]
  |  |  ------------------
  ------------------
 1982|  1.58M|          growth_info_lower_bound.HasNoGrowthLeftAndHaveDeleted())) {
 1983|       |    // Table with deleted slots that needs to be rehashed or resized.
 1984|      0|    return RehashOrGrowToNextCapacityAndPrepareInsert(common, policy, hash);
 1985|      0|  }
 1986|       |  // Covers two cases:
 1987|       |  // 1. Table with deleted slots that has space for the inserting element.
 1988|       |  // 2. Table without deleted slots that has space and GrowthInfoView was
 1989|       |  //    rebalanced.
 1990|  1.58M|  FindInfo target = find_first_non_full(common, hash);
 1991|  1.58M|  PrepareInsertCommon(common);
 1992|  1.58M|  growth_info.OverwriteControlAsFull(common.control()[target.offset]);
 1993|  1.58M|  SetCtrlInLargeTable(common, target.offset, H2(hash), policy.slot_size);
 1994|  1.58M|  common.infoz().RecordInsertMiss(hash, target.probe_length);
 1995|  1.58M|  return SlotAddress(common.slot_array(cap), target.offset, policy.slot_size);
 1996|  1.58M|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_134GrowToNextCapacityAndPrepareInsertERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEm:
 1780|  70.9k|    size_t new_hash) {
 1781|  70.9k|  const size_t old_capacity = common.capacity();
 1782|  70.9k|  ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |   66|  70.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1783|  70.9k|      common.growth_info().GetGrowthLeftTotalSlow(old_capacity) == 0);
 1784|  70.9k|  ABSL_SWISSTABLE_ASSERT(old_capacity > policy.soo_capacity());
  ------------------
  |  |   66|  70.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1785|  70.9k|  ABSL_SWISSTABLE_ASSERT(!IsSmallCapacity(old_capacity));
  ------------------
  |  |   66|  70.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1786|  70.9k|  ABSL_ASSUME(old_capacity > kMaxSmallCapacity);
  ------------------
  |  |  272|  70.9k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1787|       |
 1788|  70.9k|  const size_t new_capacity = NextCapacity(old_capacity);
 1789|  70.9k|  ctrl_t* old_ctrl = common.control();
 1790|  70.9k|  void* old_slots = common.slot_array(old_capacity);
 1791|  70.9k|  size_t old_blocked_element_count = common.blocked_element_count();
 1792|       |
 1793|  70.9k|  HashtablezInfoHandle infoz = common.infoz();
 1794|  70.9k|  const bool has_infoz = infoz.IsSampled();
 1795|  70.9k|  common.set_capacity(new_capacity);
 1796|  70.9k|  common.set_blocked_element_count_to_zero();
 1797|  70.9k|  const size_t slot_size = policy.slot_size;
 1798|  70.9k|  const size_t slot_align = policy.slot_align;
 1799|  70.9k|  void* alloc = policy.get_char_alloc(common);
 1800|       |
 1801|  70.9k|  const auto [new_ctrl, new_slots] =
 1802|  70.9k|      AllocBackingArray(common, policy, new_capacity, has_infoz, alloc,
 1803|  70.9k|                        /*blocked_element_count=*/0);
 1804|  70.9k|  common.set_control(new_ctrl);
 1805|  70.9k|  SanitizerPoisonMemoryRegion(new_slots, new_capacity * slot_size);
 1806|       |
 1807|  70.9k|  h2_t new_h2 = H2(new_hash);
 1808|  70.9k|  size_t total_probe_length = 0;
 1809|  70.9k|  FindInfo find_info;
 1810|  70.9k|  if (ABSL_PREDICT_TRUE(is_single_group(new_capacity))) {
  ------------------
  |  |  191|  70.9k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 11.1k, False: 59.8k]
  |  |  |  Branch (191:48): [Folded, False: 70.9k]
  |  |  |  Branch (191:57): [True: 11.1k, False: 59.8k]
  |  |  ------------------
  ------------------
 1811|  11.1k|    size_t offset;
 1812|  11.1k|    const size_t old_size = common.size();
 1813|  11.1k|    GrowIntoSingleGroupShuffleControlBytes(old_ctrl, old_capacity,
 1814|  11.1k|                                           old_blocked_element_count, new_ctrl,
 1815|  11.1k|                                           new_capacity);
 1816|       |    // We put the new element either at the beginning or at the end of the
 1817|       |    // table with approximately equal probability.
 1818|  11.1k|    offset =
 1819|  11.1k|        SingleGroupTableH1(new_hash, common.seed()) & 1 ? 0 : new_capacity - 1;
  ------------------
  |  Branch (1819:9): [True: 5.43k, False: 5.71k]
  ------------------
 1820|       |
 1821|  11.1k|    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[offset]));
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1822|  11.1k|    SetCtrlInSingleGroupTable(common, offset, new_h2, policy.slot_size);
 1823|  11.1k|    find_info = FindInfo{offset, 0};
 1824|       |    // Single group tables have all slots full on resize. So we can transfer
 1825|       |    // all slots without checking the control bytes.
 1826|  11.1k|    ABSL_SWISSTABLE_ASSERT(common.size() + old_blocked_element_count ==
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1827|  11.1k|                           old_capacity);
 1828|  11.1k|    void* target = NextSlot(new_slots, slot_size);
 1829|  11.1k|    SanitizerUnpoisonMemoryRegion(target, old_size * slot_size);
 1830|  11.1k|    policy.transfer_n(&common, target, old_slots, old_size);
 1831|  59.8k|  } else {
 1832|  59.8k|    total_probe_length =
 1833|  59.8k|        GrowToNextCapacityDispatch(common, policy, old_ctrl, old_slots);
 1834|  59.8k|    find_info = find_first_non_full(common, new_hash);
 1835|  59.8k|    SetCtrlInLargeTable(common, find_info.offset, new_h2, policy.slot_size);
 1836|  59.8k|  }
 1837|  70.9k|  ABSL_SWISSTABLE_ASSERT(old_capacity > policy.soo_capacity());
  ------------------
  |  |   66|  70.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1838|  70.9k|  (*policy.dealloc)(alloc, old_capacity, old_ctrl, slot_size, slot_align,
 1839|  70.9k|                    has_infoz, old_blocked_element_count);
 1840|  70.9k|  PrepareInsertCommon(common);
 1841|  70.9k|  ResetGrowthLeft(GetGrowthInfoFromControl(new_ctrl), new_capacity,
 1842|  70.9k|                  common.size());
 1843|       |
 1844|  70.9k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  70.9k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 70.9k]
  |  |  |  Branch (190:49): [Folded, False: 70.9k]
  |  |  |  Branch (190:58): [True: 0, False: 70.9k]
  |  |  ------------------
  ------------------
 1845|      0|    ReportGrowthToInfoz(common, infoz, new_hash, total_probe_length,
 1846|      0|                        find_info.probe_length);
 1847|      0|  }
 1848|  70.9k|  return SlotAddress(new_slots, find_info.offset, policy.slot_size);
 1849|  70.9k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_138GrowIntoSingleGroupShuffleControlBytesEPNS1_6ctrl_tEmmS4_m:
 1233|  11.1k|                                            size_t new_capacity) {
 1234|  11.1k|  ABSL_SWISSTABLE_ASSERT(is_single_group(new_capacity));
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1235|  11.1k|  constexpr size_t kHalfWidth = Group::kWidth / 2;
 1236|  11.1k|  ABSL_ASSUME(old_capacity < kHalfWidth);
  ------------------
  |  |  272|  11.1k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1237|  11.1k|  ABSL_ASSUME(old_capacity > 0);
  ------------------
  |  |  272|  11.1k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1238|  11.1k|  static_assert(Group::kWidth == 8 || Group::kWidth == 16,
 1239|  11.1k|                "Group size is not supported.");
 1240|       |
 1241|       |  // NOTE: operations are done with compile time known size = 8.
 1242|       |  // Compiler optimizes that into single ASM operation.
 1243|       |
 1244|       |  // Load the bytes from old_capacity. This contains
 1245|       |  // - the sentinel byte
 1246|       |  // - all the old control bytes
 1247|       |  // - the rest is filled with kEmpty bytes
 1248|       |  // Example:
 1249|       |  // old_ctrl =     012S012EEEEEEEEE...
 1250|       |  // copied_bytes = S012EEEE
 1251|       |  // Example with blocked elements:
 1252|       |  // old_ctrl =     01SS01SEEEEEEEEE...
 1253|       |  // copied_bytes = S01SEEEE
 1254|  11.1k|  uint64_t copied_bytes = absl::little_endian::Load64(old_ctrl + old_capacity);
 1255|       |
 1256|       |  // We change the sentinel byte to kEmpty before storing to both the start of
 1257|       |  // the new_ctrl, and past the end of the new_ctrl later for the new cloned
 1258|       |  // bytes. Note that this is faster than setting the sentinel byte to kEmpty
 1259|       |  // after the copy directly in new_ctrl because we are limited on store
 1260|       |  // bandwidth.
 1261|  11.1k|  static constexpr uint64_t kEmptyXorSentinel =
 1262|  11.1k|      static_cast<uint8_t>(ctrl_t::kEmpty) ^
 1263|  11.1k|      static_cast<uint8_t>(ctrl_t::kSentinel);
 1264|       |
 1265|       |  // Replace the first byte kSentinel with kEmpty.
 1266|       |  // Resulting bytes will be shifted by one byte old control blocks.
 1267|       |  // Example:
 1268|       |  // old_ctrl = 012S012EEEEEEEEE...
 1269|       |  // before =   S012EEEE
 1270|       |  // after  =   E012EEEE
 1271|  11.1k|  copied_bytes ^= kEmptyXorSentinel;
 1272|       |
 1273|  11.1k|  if (ABSL_PREDICT_FALSE(old_blocked_element_count > 0)) {
  ------------------
  |  |  190|  11.1k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 11.1k]
  |  |  |  Branch (190:49): [Folded, False: 11.1k]
  |  |  |  Branch (190:58): [True: 0, False: 11.1k]
  |  |  ------------------
  ------------------
 1274|       |    // Replacing blocked sentinel elements with kEmpty.
 1275|      0|    static constexpr uint64_t kAllBytesEmptyXorSentinel =
 1276|      0|        kEmptyXorSentinel * uint64_t{0x0101010101010101};
 1277|      0|    uint64_t blocked_mask = kAllBytesEmptyXorSentinel;
 1278|       |    // Keep old_blocked_element_count bytes in the mask.
 1279|      0|    blocked_mask >>= 64 - old_blocked_element_count * 8;
 1280|       |    // Shift the mask to the start of the blocked elements bytes.
 1281|      0|    blocked_mask <<= (old_capacity - old_blocked_element_count + 1) * 8;
 1282|       |    // Example with blocked elements:
 1283|       |    // old_ctrl = 0SSS0SSEEEEEEEEE...
 1284|       |    // before =   E0SSEEEE
 1285|       |    // after  =   E0EEEEEE
 1286|      0|    copied_bytes ^= blocked_mask;
 1287|      0|  }
 1288|       |
 1289|  11.1k|  if (Group::kWidth == 8) {
  ------------------
  |  Branch (1289:7): [Folded, False: 11.1k]
  ------------------
 1290|       |    // With group size 8, we can grow with two write operations.
 1291|      0|    ABSL_SWISSTABLE_ASSERT(old_capacity < 8 &&
  ------------------
  |  |   66|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1292|      0|                           "old_capacity is too large for group size 8");
 1293|      0|    absl::little_endian::Store64(new_ctrl, copied_bytes);
 1294|       |
 1295|      0|    static constexpr uint64_t kSentinal64 =
 1296|      0|        static_cast<uint8_t>(ctrl_t::kSentinel);
 1297|       |
 1298|       |    // Prepend kSentinel byte to the beginning of copied_bytes.
 1299|       |    // We have maximum 3 non-empty bytes at the beginning of copied_bytes for
 1300|       |    // group size 8.
 1301|       |    // Example:
 1302|       |    // old_ctrl = 012S012EEEE
 1303|       |    // before =   E012EEEE
 1304|       |    // after  =   SE012EEE
 1305|      0|    copied_bytes = (copied_bytes << 8) ^ kSentinal64;
 1306|      0|    absl::little_endian::Store64(new_ctrl + new_capacity, copied_bytes);
 1307|       |    // Example for capacity 3:
 1308|       |    // old_ctrl = 012S012EEEE
 1309|       |    // After the first store:
 1310|       |    //           >!
 1311|       |    // new_ctrl = E012EEEE???????
 1312|       |    // After the second store:
 1313|       |    //                  >!
 1314|       |    // new_ctrl = E012EEESE012EEE
 1315|      0|    return;
 1316|      0|  }
 1317|       |
 1318|  11.1k|  ABSL_SWISSTABLE_ASSERT(Group::kWidth == 16);  // NOLINT(misc-static-assert)
  ------------------
  |  |   66|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1319|       |
 1320|       |  // Fill the second half of the main control bytes with kEmpty.
 1321|       |  // For small capacity that may write into mirrored control bytes.
 1322|       |  // It is fine as we will overwrite all the bytes later.
 1323|  11.1k|  std::memset(new_ctrl + kHalfWidth, static_cast<int8_t>(ctrl_t::kEmpty),
 1324|  11.1k|              kHalfWidth);
 1325|       |  // Fill the second half of the mirrored control bytes with kEmpty.
 1326|  11.1k|  std::memset(new_ctrl + new_capacity + kHalfWidth,
 1327|  11.1k|              static_cast<int8_t>(ctrl_t::kEmpty), kHalfWidth);
 1328|       |  // Copy the first half of the non-mirrored control bytes.
 1329|  11.1k|  absl::little_endian::Store64(new_ctrl, copied_bytes);
 1330|  11.1k|  new_ctrl[new_capacity] = ctrl_t::kSentinel;
 1331|       |  // Copy the first half of the mirrored control bytes.
 1332|  11.1k|  absl::little_endian::Store64(new_ctrl + new_capacity + 1, copied_bytes);
 1333|       |
 1334|       |  // Example for growth capacity 1->3:
 1335|       |  // old_ctrl =                  0S0EEEEEEEEEEEEEE
 1336|       |  // new_ctrl at the end =       E0ESE0EEEEEEEEEEEEE
 1337|       |  //                                    >!
 1338|       |  // new_ctrl after 1st memset = ????????EEEEEEEE???
 1339|       |  //                                       >!
 1340|       |  // new_ctrl after 2nd memset = ????????EEEEEEEEEEE
 1341|       |  //                            >!
 1342|       |  // new_ctrl after 1st store =  E0EEEEEEEEEEEEEEEEE
 1343|       |  // new_ctrl after kSentinel =  E0ESEEEEEEEEEEEEEEE
 1344|       |  //                                >!
 1345|       |  // new_ctrl after 2nd store =  E0ESE0EEEEEEEEEEEEE
 1346|       |
 1347|       |  // Example for growth capacity 3->7:
 1348|       |  // old_ctrl =                  012S012EEEEEEEEEEEE
 1349|       |  // new_ctrl at the end =       E012EEESE012EEEEEEEEEEE
 1350|       |  //                                    >!
 1351|       |  // new_ctrl after 1st memset = ????????EEEEEEEE???????
 1352|       |  //                                           >!
 1353|       |  // new_ctrl after 2nd memset = ????????EEEEEEEEEEEEEEE
 1354|       |  //                            >!
 1355|       |  // new_ctrl after 1st store =  E012EEEEEEEEEEEEEEEEEEE
 1356|       |  // new_ctrl after kSentinel =  E012EEESEEEEEEEEEEEEEEE
 1357|       |  //                                >!
 1358|       |  // new_ctrl after 2nd store =  E012EEESE012EEEEEEEEEEE
 1359|       |
 1360|       |  // Example for growth capacity 7->15:
 1361|       |  // old_ctrl =                  0123456S0123456EEEEEEEE
 1362|       |  // new_ctrl at the end =       E0123456EEEEEEESE0123456EEEEEEE
 1363|       |  //                                    >!
 1364|       |  // new_ctrl after 1st memset = ????????EEEEEEEE???????????????
 1365|       |  //                                                   >!
 1366|       |  // new_ctrl after 2nd memset = ????????EEEEEEEE???????EEEEEEEE
 1367|       |  //                            >!
 1368|       |  // new_ctrl after 1st store =  E0123456EEEEEEEE???????EEEEEEEE
 1369|       |  // new_ctrl after kSentinel =  E0123456EEEEEEES???????EEEEEEEE
 1370|       |  //                                            >!
 1371|       |  // new_ctrl after 2nd store =  E0123456EEEEEEESE0123456EEEEEEE
 1372|  11.1k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_126GrowToNextCapacityDispatchERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1686|  59.8k|                                  ctrl_t* old_ctrl, void* old_slots) {
 1687|  59.8k|  const size_t new_capacity = common.capacity();
 1688|  59.8k|  if (ABSL_PREDICT_TRUE(new_capacity <= kMaxLocalBufferNewCapacity)) {
  ------------------
  |  |  191|  59.8k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 22.2k, False: 37.5k]
  |  |  |  Branch (191:48): [Folded, False: 59.8k]
  |  |  |  Branch (191:57): [True: 22.2k, False: 37.5k]
  |  |  ------------------
  ------------------
 1689|  22.2k|    return GrowToNextCapacityThatFitsInLocalBuffer(common, policy, old_ctrl,
 1690|  22.2k|                                                   old_slots);
 1691|  37.5k|  } else {
 1692|  37.5k|    return GrowToNextCapacityOverflowLocalBuffer(common, policy, old_ctrl,
 1693|  37.5k|                                                 old_slots);
 1694|  37.5k|  }
 1695|  59.8k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_139GrowToNextCapacityThatFitsInLocalBufferERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1636|  22.2k|    ctrl_t* old_ctrl, void* old_slots) {
 1637|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= kMaxLocalBufferNewCapacity);
  ------------------
  |  |   66|  22.2k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1638|  22.2k|  return GrowToNextCapacity<
 1639|  22.2k|      ProbedItemEncoder<ProbedItem4Bytes, /*kGuaranteedFitToBuffer=*/true>>(
 1640|  22.2k|      common, policy, old_ctrl, old_slots);
 1641|  22.2k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1617|  22.2k|                          ctrl_t* old_ctrl, void* old_slots) {
 1618|  22.2k|  using ProbedItem = typename Encoder::ProbedItem;
 1619|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   66|  22.2k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1620|  22.2k|  Encoder encoder(old_ctrl);
 1621|  22.2k|  policy.transfer_unprobed_elements_to_next_capacity(
 1622|  22.2k|      common, old_ctrl, old_slots, &encoder,
 1623|  22.2k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  22.2k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  22.2k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  22.2k|      });
 1627|  22.2k|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1628|  22.2k|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1629|  22.2k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEC2EPNS1_6ctrl_tE:
 1485|  22.2k|  explicit ProbedItemEncoder(ctrl_t* control) : control_(control) {}
raw_hash_set.cc:_ZZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPvENKUlSF_hmmE_clESF_hmm:
 1623|  23.4k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  23.4k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  23.4k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  23.4k|      });
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EE10EncodeItemES5_:
 1488|  23.4k|  void EncodeItem(ProbedItem item) {
 1489|  23.4k|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|  23.4k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [Folded, False: 23.4k]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:59): [Folded, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1490|      0|      return ProcessEncodeWithOverflow(item);
 1491|      0|    }
 1492|  23.4k|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   66|  23.4k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1493|  23.4k|    *pos_ = item;
 1494|  23.4k|    ++pos_;
 1495|  23.4k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_130InitializeMirroredControlBytesEPNS1_6ctrl_tEm:
 1461|  59.8k|void InitializeMirroredControlBytes(ctrl_t* new_ctrl, size_t new_capacity) {
 1462|  59.8k|  std::memcpy(new_ctrl + new_capacity,
 1463|       |              // We own GrowthInfo just before control bytes. So it is ok
 1464|       |              // to read one byte from it.
 1465|  59.8k|              new_ctrl - 1, Group::kWidth);
 1466|  59.8k|  new_ctrl[new_capacity] = ctrl_t::kSentinel;
 1467|  59.8k|}
raw_hash_set.cc:_ZNK4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb1EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1502|  22.2k|                                void* old_slots) const {
 1503|  22.2k|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1503:9): [True: 12.2k, False: 10.0k]
  ------------------
 1504|  12.2k|      return 0;
 1505|  12.2k|    }
 1506|  10.0k|    if constexpr (kGuaranteedFitToBuffer) {
 1507|  10.0k|      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1508|  10.0k|    }
 1509|      0|    size_t total_probe_length = DecodeAndInsertImpl(
 1510|  10.0k|        common, policy, buffer_,
 1511|  10.0k|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1511:9): [True: 0, False: 10.0k]
  ------------------
 1512|  10.0k|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1512:9): [True: 0, False: 10.0k]
  ------------------
 1513|      0|      return total_probe_length;
 1514|      0|    }
 1515|  10.0k|    total_probe_length +=
 1516|  10.0k|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1517|  10.0k|    return total_probe_length;
 1518|  10.0k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119DecodeAndInsertImplINS1_14ProbedItemImplIjLm32EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPKT_SD_Pv:
 1384|  24.2k|    const ProbedItem* start, const ProbedItem* end, void* old_slots) {
 1385|  24.2k|  const HashtableCapacity new_capacity = c.capacity_impl();
 1386|       |
 1387|  24.2k|  void* new_slots = c.slot_array(new_capacity.capacity());
 1388|  24.2k|  ctrl_t* new_ctrl = c.control();
 1389|  24.2k|  size_t total_probe_length = 0;
 1390|       |
 1391|  24.2k|  const size_t slot_size = policy.slot_size;
 1392|  24.2k|  auto transfer_n = policy.transfer_n;
 1393|       |
 1394|  93.9k|  for (; start < end; ++start) {
  ------------------
  |  Branch (1394:10): [True: 69.6k, False: 24.2k]
  ------------------
 1395|  69.6k|    const FindInfo target = find_first_non_full_from_h1(
 1396|  69.6k|        new_ctrl, static_cast<size_t>(start->h1), new_capacity);
 1397|  69.6k|    total_probe_length += target.probe_length;
 1398|  69.6k|    const size_t old_index = static_cast<size_t>(start->source_offset);
 1399|  69.6k|    const size_t new_i = target.offset;
 1400|  69.6k|    ABSL_SWISSTABLE_ASSERT(old_index < new_capacity.capacity() / 2);
  ------------------
  |  |   66|  69.6k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1401|  69.6k|    ABSL_SWISSTABLE_ASSERT(new_i < new_capacity.capacity());
  ------------------
  |  |   66|  69.6k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1402|       |    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_i]));
  ------------------
  |  |   66|  69.6k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1403|  69.6k|    void* src_slot = SlotAddress(old_slots, old_index, slot_size);
 1404|  69.6k|    void* dst_slot = SlotAddress(new_slots, new_i, slot_size);
 1405|  69.6k|    SanitizerUnpoisonMemoryRegion(dst_slot, slot_size);
 1406|  69.6k|    transfer_n(&c, dst_slot, src_slot, 1);
 1407|  69.6k|    SetCtrlInLargeTable(c, new_i, static_cast<h2_t>(start->h2), slot_size);
 1408|  69.6k|  }
 1409|  24.2k|  return total_probe_length;
 1410|  24.2k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_137GrowToNextCapacityOverflowLocalBufferERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1669|  37.5k|    ctrl_t* old_ctrl, void* old_slots) {
 1670|  37.5k|  const size_t new_capacity = common.capacity();
 1671|  37.5k|  if (ABSL_PREDICT_TRUE(new_capacity <= ProbedItem4Bytes::kMaxNewCapacity)) {
  ------------------
  |  |  191|  37.5k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 26.5k, False: 11.0k]
  |  |  |  Branch (191:48): [Folded, False: 37.5k]
  |  |  |  Branch (191:57): [True: 26.5k, False: 11.0k]
  |  |  ------------------
  ------------------
 1672|  26.5k|    return GrowToNextCapacity4BytesEncoder(common, policy, old_ctrl, old_slots);
 1673|  26.5k|  }
 1674|  11.0k|  if (ABSL_PREDICT_TRUE(new_capacity <= ProbedItem8Bytes::kMaxNewCapacity)) {
  ------------------
  |  |  191|  11.0k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 11.0k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 11.0k]
  |  |  |  Branch (191:57): [True: 11.0k, False: 0]
  |  |  ------------------
  ------------------
 1675|  11.0k|    return GrowToNextCapacity8BytesEncoder(common, policy, old_ctrl, old_slots);
 1676|  11.0k|  }
 1677|       |  // 16 bytes encoding supports the maximum swisstable capacity.
 1678|      0|  return GrowToNextCapacity16BytesEncoder(common, policy, old_ctrl, old_slots);
 1679|  11.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131GrowToNextCapacity4BytesEncoderERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1647|  26.5k|                                       ctrl_t* old_ctrl, void* old_slots) {
 1648|  26.5k|  return GrowToNextCapacity<ProbedItemEncoder<ProbedItem4Bytes>>(
 1649|  26.5k|      common, policy, old_ctrl, old_slots);
 1650|  26.5k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1617|  26.5k|                          ctrl_t* old_ctrl, void* old_slots) {
 1618|  26.5k|  using ProbedItem = typename Encoder::ProbedItem;
 1619|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   66|  26.5k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1620|  26.5k|  Encoder encoder(old_ctrl);
 1621|  26.5k|  policy.transfer_unprobed_elements_to_next_capacity(
 1622|  26.5k|      common, old_ctrl, old_slots, &encoder,
 1623|  26.5k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  26.5k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  26.5k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  26.5k|      });
 1627|  26.5k|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1628|  26.5k|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1629|  26.5k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEC2EPNS1_6ctrl_tE:
 1485|  26.5k|  explicit ProbedItemEncoder(ctrl_t* control) : control_(control) {}
raw_hash_set.cc:_ZZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPvENKUlSF_hmmE_clESF_hmm:
 1623|  46.1k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  46.1k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  46.1k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  46.1k|      });
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EE10EncodeItemES5_:
 1488|  46.1k|  void EncodeItem(ProbedItem item) {
 1489|  46.1k|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|  92.3k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 46.1k]
  |  |  |  Branch (190:49): [Folded, False: 46.1k]
  |  |  |  Branch (190:59): [True: 46.1k, Folded]
  |  |  |  Branch (190:59): [True: 0, False: 46.1k]
  |  |  ------------------
  ------------------
 1490|      0|      return ProcessEncodeWithOverflow(item);
 1491|      0|    }
 1492|  46.1k|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   66|  46.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1493|  46.1k|    *pos_ = item;
 1494|  46.1k|    ++pos_;
 1495|  46.1k|  }
raw_hash_set.cc:_ZNK4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplIjLm32EEELb0EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1502|  26.5k|                                void* old_slots) const {
 1503|  26.5k|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1503:9): [True: 12.2k, False: 14.2k]
  ------------------
 1504|  12.2k|      return 0;
 1505|  12.2k|    }
 1506|       |    if constexpr (kGuaranteedFitToBuffer) {
 1507|       |      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1508|       |    }
 1509|  14.2k|    size_t total_probe_length = DecodeAndInsertImpl(
 1510|  14.2k|        common, policy, buffer_,
 1511|  14.2k|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1511:9): [True: 0, False: 14.2k]
  ------------------
 1512|  14.2k|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1512:9): [True: 14.2k, False: 0]
  ------------------
 1513|  14.2k|      return total_probe_length;
 1514|  14.2k|    }
 1515|      0|    total_probe_length +=
 1516|      0|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1517|      0|    return total_probe_length;
 1518|  14.2k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_131GrowToNextCapacity8BytesEncoderERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1653|  11.0k|                                       ctrl_t* old_ctrl, void* old_slots) {
 1654|  11.0k|  return GrowToNextCapacity<ProbedItemEncoder<ProbedItem8Bytes>>(
 1655|  11.0k|      common, policy, old_ctrl, old_slots);
 1656|  11.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPv:
 1617|  11.0k|                          ctrl_t* old_ctrl, void* old_slots) {
 1618|  11.0k|  using ProbedItem = typename Encoder::ProbedItem;
 1619|       |  ABSL_SWISSTABLE_ASSERT(common.capacity() <= ProbedItem::kMaxNewCapacity);
  ------------------
  |  |   66|  11.0k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1620|  11.0k|  Encoder encoder(old_ctrl);
 1621|  11.0k|  policy.transfer_unprobed_elements_to_next_capacity(
 1622|  11.0k|      common, old_ctrl, old_slots, &encoder,
 1623|  11.0k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  11.0k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  11.0k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  11.0k|      });
 1627|  11.0k|  InitializeMirroredControlBytes(common.control(), common.capacity());
 1628|  11.0k|  return encoder.DecodeAndInsertToTable(common, policy, old_slots);
 1629|  11.0k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EEC2EPNS1_6ctrl_tE:
 1485|  11.0k|  explicit ProbedItemEncoder(ctrl_t* control) : control_(control) {}
raw_hash_set.cc:_ZZN4absl12lts_2026081718container_internal12_GLOBAL__N_118GrowToNextCapacityINS2_17ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPNS1_6ctrl_tEPvENKUlSF_hmmE_clESF_hmm:
 1623|  28.1k|      [](void* probed_storage, h2_t h2, size_t source_offset, size_t h1) {
 1624|  28.1k|        auto encoder_ptr = static_cast<Encoder*>(probed_storage);
 1625|  28.1k|        encoder_ptr->EncodeItem(ProbedItem(h2, source_offset, h1));
 1626|  28.1k|      });
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EE10EncodeItemES5_:
 1488|  28.1k|  void EncodeItem(ProbedItem item) {
 1489|  28.1k|    if (ABSL_PREDICT_FALSE(!kGuaranteedFitToBuffer && pos_ >= end_)) {
  ------------------
  |  |  190|  56.2k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 28.1k]
  |  |  |  Branch (190:49): [Folded, False: 28.1k]
  |  |  |  Branch (190:59): [True: 28.1k, Folded]
  |  |  |  Branch (190:59): [True: 0, False: 28.1k]
  |  |  ------------------
  ------------------
 1490|      0|      return ProcessEncodeWithOverflow(item);
 1491|      0|    }
 1492|  28.1k|    ABSL_SWISSTABLE_ASSERT(pos_ < end_);
  ------------------
  |  |   66|  28.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1493|  28.1k|    *pos_ = item;
 1494|  28.1k|    ++pos_;
 1495|  28.1k|  }
raw_hash_set.cc:_ZNK4absl12lts_2026081718container_internal12_GLOBAL__N_117ProbedItemEncoderINS1_14ProbedItemImplImLm64EEELb0EE22DecodeAndInsertToTableERNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPv:
 1502|  11.0k|                                void* old_slots) const {
 1503|  11.0k|    if (pos_ == buffer_) {
  ------------------
  |  Branch (1503:9): [True: 3.44k, False: 7.59k]
  ------------------
 1504|  3.44k|      return 0;
 1505|  3.44k|    }
 1506|       |    if constexpr (kGuaranteedFitToBuffer) {
 1507|       |      return DecodeAndInsertImpl(common, policy, buffer_, pos_, old_slots);
 1508|       |    }
 1509|  7.59k|    size_t total_probe_length = DecodeAndInsertImpl(
 1510|  7.59k|        common, policy, buffer_,
 1511|  7.59k|        local_buffer_full_ ? buffer_ + kBufferSize : pos_, old_slots);
  ------------------
  |  Branch (1511:9): [True: 0, False: 7.59k]
  ------------------
 1512|  7.59k|    if (!local_buffer_full_) {
  ------------------
  |  Branch (1512:9): [True: 7.59k, False: 0]
  ------------------
 1513|  7.59k|      return total_probe_length;
 1514|  7.59k|    }
 1515|      0|    total_probe_length +=
 1516|      0|        DecodeAndInsertToTableOverflow(common, policy, old_slots);
 1517|      0|    return total_probe_length;
 1518|  7.59k|  }
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119DecodeAndInsertImplINS1_14ProbedItemImplImLm64EEEEEmRNS1_12CommonFieldsERKNS1_15PolicyFunctionsEPKT_SD_Pv:
 1384|  7.59k|    const ProbedItem* start, const ProbedItem* end, void* old_slots) {
 1385|  7.59k|  const HashtableCapacity new_capacity = c.capacity_impl();
 1386|       |
 1387|  7.59k|  void* new_slots = c.slot_array(new_capacity.capacity());
 1388|  7.59k|  ctrl_t* new_ctrl = c.control();
 1389|  7.59k|  size_t total_probe_length = 0;
 1390|       |
 1391|  7.59k|  const size_t slot_size = policy.slot_size;
 1392|  7.59k|  auto transfer_n = policy.transfer_n;
 1393|       |
 1394|  35.7k|  for (; start < end; ++start) {
  ------------------
  |  Branch (1394:10): [True: 28.1k, False: 7.59k]
  ------------------
 1395|  28.1k|    const FindInfo target = find_first_non_full_from_h1(
 1396|  28.1k|        new_ctrl, static_cast<size_t>(start->h1), new_capacity);
 1397|  28.1k|    total_probe_length += target.probe_length;
 1398|  28.1k|    const size_t old_index = static_cast<size_t>(start->source_offset);
 1399|  28.1k|    const size_t new_i = target.offset;
 1400|  28.1k|    ABSL_SWISSTABLE_ASSERT(old_index < new_capacity.capacity() / 2);
  ------------------
  |  |   66|  28.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1401|  28.1k|    ABSL_SWISSTABLE_ASSERT(new_i < new_capacity.capacity());
  ------------------
  |  |   66|  28.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1402|       |    ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_i]));
  ------------------
  |  |   66|  28.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1403|  28.1k|    void* src_slot = SlotAddress(old_slots, old_index, slot_size);
 1404|  28.1k|    void* dst_slot = SlotAddress(new_slots, new_i, slot_size);
 1405|  28.1k|    SanitizerUnpoisonMemoryRegion(dst_slot, slot_size);
 1406|  28.1k|    transfer_n(&c, dst_slot, src_slot, 1);
 1407|  28.1k|    SetCtrlInLargeTable(c, new_i, static_cast<h2_t>(start->h2), slot_size);
 1408|  28.1k|  }
 1409|  7.59k|  return total_probe_length;
 1410|  7.59k|}
raw_hash_set.cc:_ZN4absl12lts_2026081718container_internal12_GLOBAL__N_119SetCtrlInLargeTableERKNS1_12CommonFieldsEmhm:
  581|  1.74M|                                size_t slot_size) {
  582|  1.74M|  SetCtrlInLargeTable(c, i, static_cast<ctrl_t>(h), slot_size);
  583|  1.74M|}

_ZNK4absl12lts_2026081718container_internal12PerTableSeed4seedEv:
  603|  1.04G|  size_t seed() const { return seed_; }
_ZN4absl12lts_2026081718container_internal12PerTableSeedC2Em:
  610|  1.04G|      : seed_(static_cast<uint16_t>(seed)) {}
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled36maybe_increment_generation_on_insertEv:
  930|   204M|  void maybe_increment_generation_on_insert() {}
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled21reset_reserved_growthEmm:
  932|      4|  void reset_reserved_growth(size_t, size_t) {}
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled19set_reserved_growthEm:
  934|      6|  void set_reserved_growth(size_t) {}
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled20set_reservation_sizeEm:
  936|     10|  void set_reservation_size(size_t) {}
_ZNK4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled10generationEv:
  937|  82.1k|  GenerationType generation() const { return 0; }
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled14set_generationEh:
  938|  82.1k|  void set_generation(GenerationType) {}
_ZNK4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled14generation_ptrEv:
  939|  1.29G|  GenerationType* generation_ptr() const { return nullptr; }
_ZN4absl12lts_2026081718container_internal34CommonFieldsGenerationInfoDisabled18set_generation_ptrEPh:
  940|  82.1k|  void set_generation_ptr(GenerationType*) {}
_ZN4absl12lts_2026081718container_internal37HashSetIteratorGenerationInfoDisabledC2EPKh:
  963|  1.29G|  explicit HashSetIteratorGenerationInfoDisabled(const GenerationType*) {}
_ZNK4absl12lts_2026081718container_internal37HashSetIteratorGenerationInfoDisabled10generationEv:
  965|  1.75G|  GenerationType generation() const { return 0; }
_ZNK4absl12lts_2026081718container_internal37HashSetIteratorGenerationInfoDisabled14generation_ptrEv:
  967|  2.85G|  const GenerationType* generation_ptr() const { return nullptr; }
_ZN4absl12lts_2026081718container_internal20GrowthInfoLowerBoundC2Eh:
 1023|   209M|      : growth_left_(growth_left) {}
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound25HasNoDeletedAndGrowthLeftEv:
 1028|   204M|  constexpr bool HasNoDeletedAndGrowthLeft() const {
 1029|   204M|    return static_cast<int8_t>(growth_left_) > 0;
 1030|   204M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound23HasDeletedAndGrowthLeftEv:
 1035|  1.62M|  constexpr bool HasDeletedAndGrowthLeft() const {
 1036|  1.62M|    return growth_left_ > kDeletedBit;
 1037|  1.62M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound27HasNoGrowthLeftAndNoDeletedEv:
 1042|  1.65M|  constexpr bool HasNoGrowthLeftAndNoDeleted() const {
 1043|  1.65M|    return growth_left_ == 0;
 1044|  1.65M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound29HasNoGrowthLeftAndHaveDeletedEv:
 1048|  1.58M|  constexpr bool HasNoGrowthLeftAndHaveDeleted() const {
 1049|  1.58M|    return growth_left_ == kDeletedBit;
 1050|  1.58M|  }
_ZNK4absl12lts_2026081718container_internal20GrowthInfoLowerBound13GetGrowthLeftEv:
 1061|  1.62M|  constexpr uint8_t GetGrowthLeft() const {
 1062|  1.62M|    return growth_left_ & kGrowthLeftMask;
 1063|  1.62M|  }
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessorC2EPv:
 1078|   206M|      : growth_info_lower_bound_(reinterpret_cast<uint8_t*>(control) - 1 -
 1079|   206M|                                 NumGenerationBytes()) {}
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor20OverwriteEmptyAsFullEv:
 1096|   202M|  void OverwriteEmptyAsFull() {
 1097|       |    ABSL_SWISSTABLE_ASSERT(GetGrowthLeftLowerBound() > 0);
  ------------------
  |  |  257|   202M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1098|   202M|    --(*growth_info_lower_bound_);
 1099|   202M|  }
_ZN4absl12lts_2026081718container_internal18GrowthInfoAccessor22OverwriteControlAsFullENS1_6ctrl_tE:
 1103|  1.58M|  void OverwriteControlAsFull(ctrl_t ctrl) {
 1104|       |    ABSL_SWISSTABLE_ASSERT(GetGrowthLeftLowerBound() >=
  ------------------
  |  |  257|  1.58M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1105|  1.58M|                           static_cast<size_t>(IsEmpty(ctrl)));
 1106|  1.58M|    *growth_info_lower_bound_ -= static_cast<size_t>(IsEmpty(ctrl));
 1107|  1.58M|  }
_ZNK4absl12lts_2026081718container_internal18GrowthInfoAccessor23GetGrowthInfoLowerBoundEv:
 1116|   205M|  GrowthInfoLowerBound GetGrowthInfoLowerBound() const {
 1117|   205M|    return GrowthInfoLowerBound(*growth_info_lower_bound_);
 1118|   205M|  }
_ZNK4absl12lts_2026081718container_internal18GrowthInfoAccessor20full_growth_info_ptrEv:
 1131|  1.66M|  void* full_growth_info_ptr() const { return growth_info_lower_bound_ - 7; }
_ZN4absl12lts_2026081718container_internal16RawHashSetLayoutC2Emmmbm:
 1191|   164k|      : control_offset_(MetadataBeforeControlSize(has_infoz, capacity)),
 1192|   164k|        generation_offset_(control_offset_ - NumGenerationBytes()),
 1193|   164k|        slot_offset_(control_offset_ + NumControlBytes(capacity)) {
 1194|   164k|    ABSL_SWISSTABLE_ASSERT(IsValidCapacity(capacity));
  ------------------
  |  |  257|   164k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1195|   164k|    size_t aligned_slot_offset = AlignUpTo(slot_offset_, slot_align);
 1196|   164k|    size_t slot_array_padding = aligned_slot_offset - slot_offset_;
 1197|   164k|    slot_offset_ = aligned_slot_offset;
 1198|   164k|    ABSL_SWISSTABLE_ASSERT(
  ------------------
  |  |  257|   164k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1199|   164k|        slot_size <=
 1200|   164k|        ((std::numeric_limits<size_t>::max)() - slot_offset_) / capacity);
 1201|   164k|    control_offset_ += slot_array_padding;
 1202|   164k|    generation_offset_ += slot_array_padding;
 1203|       |    ABSL_SWISSTABLE_ASSERT(!IsSmallCapacity(capacity) ||
  ------------------
  |  |  257|   164k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1204|   164k|                           control_offset_ == slot_offset_);
 1205|   164k|    alloc_size_ = slot_offset_ + (capacity - blocked_element_count) * slot_size;
 1206|   164k|  }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout14control_offsetEv:
 1210|   164k|  size_t control_offset() const { return control_offset_; }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout17generation_offsetEv:
 1214|  82.1k|  size_t generation_offset() const { return generation_offset_; }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout11slot_offsetEv:
 1218|  82.1k|  size_t slot_offset() const { return slot_offset_; }
_ZNK4absl12lts_2026081718container_internal16RawHashSetLayout10alloc_sizeEv:
 1222|   246k|  size_t alloc_size() const { return alloc_size_; }
_ZN4absl12lts_2026081718container_internal9HeapOrSoo7controlEv:
 1260|  82.1k|  MaybeInitializedPtr<ctrl_t>& control() {
 1261|  82.1k|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.control);
  ------------------
  |  |  484|  82.1k|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1262|  82.1k|  }
_ZNK4absl12lts_2026081718container_internal9HeapOrSoo7controlEv:
 1263|  3.07G|  MaybeInitializedPtr<ctrl_t> control() const {
 1264|  3.07G|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(heap.control);
  ------------------
  |  |  484|  3.07G|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1265|  3.07G|  }
_ZN4absl12lts_2026081718container_internal12CommonFieldsC2ENS1_13non_soo_tag_tE:
 1294|  5.58k|      : inline_data_(HashtableCapacity(0), no_seed_empty_tag_t{}) {}
_ZNK4absl12lts_2026081718container_internal12CommonFields7controlEv:
 1321|  3.07G|  ctrl_t* control() const {
 1322|  3.07G|    ABSL_SWISSTABLE_ASSERT(capacity() > 0);
  ------------------
  |  |  257|  3.07G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1323|       |    // Assume that the control bytes don't alias `this`.
 1324|  3.07G|    ctrl_t* ctrl = heap_or_soo_.control().get();
 1325|  3.07G|    [[maybe_unused]] size_t num_control_bytes = NumControlBytes(capacity());
 1326|  3.07G|    ABSL_ASSUME(reinterpret_cast<uintptr_t>(ctrl + num_control_bytes) <=
  ------------------
  |  |  272|  4.10G|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (272:44): [True: 2.04G, False: 1.02G]
  |  |  |  Branch (272:44): [True: 1.02G, False: 0]
  |  |  ------------------
  ------------------
 1327|  3.07G|                    reinterpret_cast<uintptr_t>(this) ||
 1328|  3.07G|                reinterpret_cast<uintptr_t>(this + 1) <=
 1329|  3.07G|                    reinterpret_cast<uintptr_t>(ctrl));
 1330|  3.07G|    ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(ctrl);
  ------------------
  |  |  484|  3.07G|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
 1331|  3.07G|  }
_ZN4absl12lts_2026081718container_internal12CommonFields11set_controlEPNS1_6ctrl_tE:
 1333|  82.1k|  void set_control(ctrl_t* c) { heap_or_soo_.control().set(c); }
_ZNK4absl12lts_2026081718container_internal12CommonFields10slot_arrayEm:
 1341|  1.16G|  void* slot_array(size_t capacity) const {
 1342|       |    ABSL_SWISSTABLE_ASSERT(capacity == this->capacity());
  ------------------
  |  |  257|  1.16G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1343|  1.16G|    ctrl_t* ctrl = control();
 1344|  1.16G|    return ctrl + NumControlBytes(capacity);
 1345|  1.16G|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields4sizeEv:
 1348|   104k|  size_t size() const { return inline_data_.size(); }
_ZN4absl12lts_2026081718container_internal12CommonFields16set_size_to_zeroEv:
 1350|      2|  void set_size_to_zero() { inline_data_.set_size(0); }
_ZN4absl12lts_2026081718container_internal12CommonFields14increment_sizeEv:
 1359|   204M|  void increment_size() {
 1360|       |    ABSL_SWISSTABLE_ASSERT(size() < capacity());
  ------------------
  |  |  257|   204M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1361|   204M|    inline_data_.increment_size();
 1362|   204M|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields5emptyEv:
 1371|  5.58k|  bool empty() const { return inline_data_.empty(); }
_ZNK4absl12lts_2026081718container_internal12CommonFields4seedEv:
 1380|  1.04G|  PerTableSeed seed() const { return inline_data_.seed(); }
_ZN4absl12lts_2026081718container_internal12CommonFields17generate_new_seedEb:
 1384|  5.57k|  void generate_new_seed(bool has_infoz) {
 1385|       |    // Note: we can't use has_infoz() here because we set has_infoz later than
 1386|       |    // we generate the seed.
 1387|  5.57k|    if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|  5.57k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.57k]
  |  |  |  Branch (190:49): [Folded, False: 5.57k]
  |  |  |  Branch (190:58): [True: 0, False: 5.57k]
  |  |  ------------------
  ------------------
 1388|      0|      inline_data_.set_sampled_seed();
 1389|      0|      return;
 1390|      0|    }
 1391|  5.57k|    inline_data_.generate_new_seed();
 1392|  5.57k|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields13capacity_implEv:
 1395|  4.44G|  HashtableCapacity capacity_impl() const {
 1396|  4.44G|    HashtableCapacity cap = inline_data_.capacity();
 1397|       |    ABSL_SWISSTABLE_ASSERT(cap.IsValid());
  ------------------
  |  |  257|  4.44G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1398|  4.44G|    return cap;
 1399|  4.44G|  }
_ZNK4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE8capacityEv:
  551|  4.44G|  constexpr size_t capacity() const {
  552|  4.44G|    ABSL_SWISSTABLE_ASSERT(IsValid());
  ------------------
  |  |  257|  4.44G|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  553|  4.44G|    return StorageMode == kCapacityByValue ? capacity_data_
  ------------------
  |  Branch (553:12): [Folded, False: 4.44G]
  ------------------
  554|  4.44G|                                           : (size_t{1} << capacity_data_) - 1;
  555|  4.44G|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields8capacityEv:
 1400|  4.44G|  size_t capacity() const { return capacity_impl().capacity(); }
_ZN4absl12lts_2026081718container_internal12CommonFields12set_capacityENS1_21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEE:
 1406|  82.1k|  void set_capacity(HashtableCapacity c) { inline_data_.set_capacity(c); }
_ZN4absl12lts_2026081718container_internal12CommonFields12set_capacityEm:
 1407|  82.1k|  void set_capacity(size_t c) {
 1408|  82.1k|    set_capacity(HashtableCapacity(c));
 1409|  82.1k|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields8is_smallEv:
 1410|   751M|  bool is_small() const { return inline_data_.is_small(); }
_ZNK4absl12lts_2026081718container_internal12CommonFields11growth_infoEv:
 1412|   205M|  GrowthInfoAccessor growth_info() const {
 1413|       |    ABSL_SWISSTABLE_ASSERT(GrowthInfoSizeForCapacity(capacity()) > 0);
  ------------------
  |  |  257|   205M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1414|   205M|    return GetGrowthInfoFromControl(control());
 1415|   205M|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields9has_infozEv:
 1417|   204M|  bool has_infoz() const { return inline_data_.has_infoz(); }
_ZN4absl12lts_2026081718container_internal12CommonFields5infozEv:
 1425|   204M|  HashtablezInfoHandle infoz() {
 1426|   204M|    return has_infoz() ? infoz_ptr() : HashtablezInfoHandle();
  ------------------
  |  Branch (1426:12): [True: 0, False: 204M]
  ------------------
 1427|   204M|  }
_ZN4absl12lts_2026081718container_internal12CommonFields21reset_reserved_growthEm:
 1441|      4|  void reset_reserved_growth(size_t reservation) {
 1442|      4|    CommonFieldsGenerationInfo::reset_reserved_growth(reservation, size());
 1443|      4|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields21blocked_element_countEv:
 1449|  76.5k|  size_t blocked_element_count() const {
 1450|  76.5k|    return inline_data_.blocked_element_count();
 1451|  76.5k|  }
_ZN4absl12lts_2026081718container_internal12CommonFields26init_blocked_element_countEm:
 1456|      4|  void init_blocked_element_count(size_t count) {
 1457|      4|    inline_data_.init_blocked_element_count(count);
 1458|      4|  }
_ZN4absl12lts_2026081718container_internal12CommonFields33set_blocked_element_count_to_zeroEv:
 1459|  70.9k|  void set_blocked_element_count_to_zero() {
 1460|  70.9k|    inline_data_.set_blocked_element_count_to_zero();
 1461|  70.9k|  }
_ZNK4absl12lts_2026081718container_internal12CommonFields22AssertNotDebugCapacityEv:
 1498|  1.51G|  void AssertNotDebugCapacity() const {
 1499|  1.51G|    if (!SwisstableGenerationsOrDebugEnabled()) {
  ------------------
  |  Branch (1499:9): [True: 1.51G, Folded]
  ------------------
 1500|  1.51G|      return;
 1501|  1.51G|    }
 1502|      0|    AssertNotDebugCapacityImpl();
 1503|      0|  }
_ZNK4absl12lts_2026081718container_internal15PolicyFunctions12soo_capacityEv:
 1967|      4|  uint8_t soo_capacity() const {
 1968|      4|    return static_cast<uint8_t>(soo_enabled ? SooCapacity() : 0);
  ------------------
  |  Branch (1968:33): [True: 0, False: 4]
  ------------------
 1969|      4|  }
_ZN4absl12lts_2026081718container_internal22MaxValidSizeForKeySizeILm8EEEmm:
 1998|      4|constexpr size_t MaxValidSizeForKeySize(size_t key_size) {
 1999|      4|  if (key_size < kSizeOfSizeT) return size_t{1} << 8 * key_size;
  ------------------
  |  Branch (1999:7): [True: 0, False: 4]
  ------------------
 2000|      4|  return (std::numeric_limits<size_t>::max)();
 2001|      4|}
_ZN4absl12lts_2026081718container_internal23MaxValidSizeForSlotSizeILm8EEEmm:
 2004|      4|constexpr size_t MaxValidSizeForSlotSize(size_t slot_size) {
 2005|      4|  if constexpr (kSizeOfSizeT == 8) {
 2006|       |    // For small slot sizes we are limited by HashtableStackData::kSizeBitCount.
 2007|      4|    if (slot_size < size_t{1} << (64 - HashtableInlineData::kSizeBitCount)) {
  ------------------
  |  Branch (2007:9): [True: 4, False: 0]
  ------------------
 2008|      4|      return MaxStorableSize();
 2009|      4|    }
 2010|      4|  }
 2011|      0|  return MaxSizeAtMaxValidCapacity<kSizeOfSizeT>(slot_size);
 2012|      4|}
_ZN4absl12lts_2026081718container_internal12MaxValidSizeILm8EEEmmm:
 2017|      4|constexpr size_t MaxValidSize(size_t key_size, size_t slot_size) {
 2018|      4|  return (std::min)(MaxValidSizeForKeySize<kSizeOfSizeT>(key_size),
 2019|      4|                    MaxValidSizeForSlotSize<kSizeOfSizeT>(slot_size));
 2020|      4|}
_ZN4absl12lts_2026081718container_internal23SentinelEmptyGenerationEv:
  265|  82.1k|constexpr GenerationType SentinelEmptyGeneration() { return 0; }
_ZN4absl12lts_2026081718container_internal14NextGenerationEh:
  267|  82.1k|constexpr GenerationType NextGeneration(GenerationType generation) {
  268|  82.1k|  return ++generation == SentinelEmptyGeneration() ? ++generation : generation;
  ------------------
  |  Branch (268:10): [True: 0, False: 82.1k]
  ------------------
  269|  82.1k|}
_ZN4absl12lts_2026081718container_internal18NumGenerationBytesEv:
  276|   206M|constexpr size_t NumGenerationBytes() { return 0; }
_ZN4absl12lts_2026081718container_internal21InsertIteratorControlEv:
  351|   204M|inline ctrl_t* InsertIteratorControl() {
  352|       |  // Const must be cast away here; no uses of this function will actually write
  353|       |  // to it because it is only used for iterators returned by `insert` and
  354|       |  // similar.
  355|   204M|  return const_cast<ctrl_t*>(kInsertIteratorControl);
  356|   204M|}
_ZN4absl12lts_2026081718container_internal11SooCapacityEv:
  378|      4|constexpr size_t SooCapacity() { return 1; }
_ZN4absl12lts_2026081718container_internal15IsValidCapacityEm:
  395|   204M|constexpr bool IsValidCapacity(size_t n) { return ((n + 1) & n) == 0 && n > 0; }
  ------------------
  |  Branch (395:51): [True: 204M, False: 0]
  |  Branch (395:73): [True: 204M, False: 2]
  ------------------
_ZN4absl12lts_2026081718container_internal15IsSmallCapacityEm:
  398|  4.23G|constexpr bool IsSmallCapacity(size_t capacity) {
  399|  4.23G|  return capacity <= kMaxSmallCapacity;
  400|  4.23G|}
_ZN4absl12lts_2026081718container_internal15is_single_groupEm:
  404|  70.9k|constexpr bool is_single_group(size_t capacity) {
  405|  70.9k|  return capacity <= Group::kWidth;
  406|  70.9k|}
_ZN4absl12lts_2026081718container_internal33IsCapacityValidForBlockedElementsEm:
  410|      4|constexpr bool IsCapacityValidForBlockedElements(size_t cap) {
  411|      4|  return !IsSmallCapacity(cap);
  412|      4|}
_ZN4absl12lts_2026081718container_internal12NextCapacityEm:
  420|  70.9k|constexpr size_t NextCapacity(size_t n) {
  421|       |  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(n) || n == 0);
  ------------------
  |  |  257|  70.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  422|  70.9k|  return n * 2 + 1;
  423|  70.9k|}
_ZN4absl12lts_2026081718container_internal16PreviousCapacityEm:
  426|  59.8k|constexpr size_t PreviousCapacity(size_t n) {
  427|       |  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(n));
  ------------------
  |  |  257|  59.8k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  428|  59.8k|  return n / 2;
  429|  59.8k|}
_ZN4absl12lts_2026081718container_internal16CapacityToGrowthEm:
  444|  70.9k|constexpr size_t CapacityToGrowth(size_t capacity) {
  445|  70.9k|  ABSL_SWISSTABLE_ASSERT(IsValidCapacity(capacity));
  ------------------
  |  |  257|  70.9k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  446|       |  // `capacity*7/8`
  447|  70.9k|  if (capacity <= kMaxCapacityForLoadFactorOne) {
  ------------------
  |  Branch (447:7): [True: 22.3k, False: 48.6k]
  ------------------
  448|       |    // For small capacities we leave at most one empty slot.
  449|  22.3k|    return capacity - (capacity >= Group::kWidth - 1);
  450|  22.3k|  }
  451|  48.6k|  return capacity - capacity / 8;
  452|  70.9k|}
_ZN4absl12lts_2026081718container_internal14SizeToCapacityEm:
  459|      4|constexpr size_t SizeToCapacity(size_t size) {
  460|      4|  if (size == 0) {
  ------------------
  |  Branch (460:7): [True: 0, False: 4]
  ------------------
  461|      0|    return 0;
  462|      0|  }
  463|       |  // The minimum possible capacity is NormalizeCapacity(size).
  464|       |  // Shifting right `~size_t{}` by `leading_zeros` yields
  465|       |  // NormalizeCapacity(size).
  466|      4|  int leading_zeros = absl::countl_zero(
  467|      4|      size +
  468|       |      // Tables larger than half a group require at least one empty slot.
  469|      4|      (size >= Group::kWidth / 2));
  470|      4|  if (size < kMaxCapacityForLoadFactorOne) {
  ------------------
  |  Branch (470:7): [True: 2, False: 2]
  ------------------
  471|      2|    return (~size_t{}) >> leading_zeros;
  472|      2|  }
  473|      2|  constexpr size_t kLast3Bits = size_t{7} << (sizeof(size_t) * 8 - 3);
  474|       |  // max_size_for_next_capacity = max_load_factor * next_capacity
  475|       |  //                            = (7/8) * (~size_t{} >> leading_zeros)
  476|       |  //                            = (7/8*~size_t{}) >> leading_zeros
  477|       |  //                            = kLast3Bits >> leading_zeros
  478|      2|  size_t max_size_for_next_capacity = kLast3Bits >> leading_zeros;
  479|       |  // Decrease shift if size is too big for the minimum capacity.
  480|      2|  leading_zeros -= static_cast<int>(size > max_size_for_next_capacity);
  481|      2|  return (~size_t{}) >> leading_zeros;
  482|      4|}
_ZN4absl12lts_2026081718container_internal2H1Em:
  832|  1.04G|inline size_t H1(size_t hash) { return hash; }
_ZN4absl12lts_2026081718container_internal2H2Em:
  837|  1.24G|inline h2_t H2(size_t hash) { return hash >> (sizeof(size_t) * 8 - 7); }
_ZN4absl12lts_2026081718container_internal14NumClonedBytesEv:
 1149|  4.64G|constexpr size_t NumClonedBytes() { return Group::kWidth - 1; }
_ZN4absl12lts_2026081718container_internal15NumControlBytesEm:
 1152|  4.23G|constexpr size_t NumControlBytes(size_t capacity) {
 1153|  4.23G|  return IsSmallCapacity(capacity) ? 0 : capacity + 1 + NumClonedBytes();
  ------------------
  |  Branch (1153:10): [True: 44.5k, False: 4.23G]
  ------------------
 1154|  4.23G|}
_ZN4absl12lts_2026081718container_internal25GrowthInfoSizeForCapacityEm:
 1158|   164k|constexpr size_t GrowthInfoSizeForCapacity(size_t capacity) {
 1159|   164k|  if (IsSmallCapacity(capacity)) {
  ------------------
  |  Branch (1159:7): [True: 11.1k, False: 153k]
  ------------------
 1160|  11.1k|    return 0;
 1161|  11.1k|  }
 1162|   153k|  return capacity <= GrowthInfoLowerBound::kMaxGrowthLeftLowerBound
  ------------------
  |  Branch (1162:10): [True: 66.8k, False: 86.2k]
  ------------------
 1163|   153k|             ? sizeof(uint8_t)
 1164|   153k|             : sizeof(uint64_t);
 1165|   164k|}
_ZN4absl12lts_2026081718container_internal25MetadataBeforeControlSizeEbm:
 1169|   164k|constexpr size_t MetadataBeforeControlSize(bool has_infoz, size_t capacity) {
 1170|   164k|  if (ABSL_PREDICT_FALSE(has_infoz)) {
  ------------------
  |  |  190|   164k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 164k]
  |  |  |  Branch (190:49): [Folded, False: 164k]
  |  |  |  Branch (190:58): [True: 0, False: 164k]
  |  |  ------------------
  ------------------
 1171|       |    // We always allocate 8 bytes of growth info for sampled tables to allow
 1172|       |    // branchless access to infoz pointer.
 1173|      0|    return sizeof(HashtablezInfoHandle) + sizeof(uint64_t) +
 1174|      0|           NumGenerationBytes();
 1175|      0|  }
 1176|   164k|  return GrowthInfoSizeForCapacity(capacity) + NumGenerationBytes();
 1177|   164k|}
_ZN4absl12lts_2026081718container_internal9AlignUpToEmm:
 1181|   164k|constexpr size_t AlignUpTo(size_t offset, size_t align) {
 1182|   164k|  return (offset + align - 1) & (~align + 1);
 1183|   164k|}
_ZN4absl12lts_2026081718container_internal24GetGrowthInfoFromControlEPNS1_6ctrl_tE:
 1279|   206M|inline GrowthInfoAccessor GetGrowthInfoFromControl(ctrl_t* control) {
 1280|   206M|  return GrowthInfoAccessor(control);
 1281|   206M|}
_ZN4absl12lts_2026081718container_internal12AssertIsFullERKPKNS1_6ctrl_tEPKvhPKhPKc:
 1589|   661M|                         const char* operation) {
 1590|   661M|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1590:7): [True: 661M, Folded]
  ------------------
 1591|       |  // `SwisstableDebugEnabled()` is also true for release builds with hardening
 1592|       |  // enabled. To minimize their impact in those builds:
 1593|       |  // - use `ABSL_PREDICT_FALSE()` to provide a compiler hint for code layout
 1594|       |  // - use `ABSL_RAW_LOG()` with a format string to reduce code size and improve
 1595|       |  //   the chances that the hot paths will be inlined.
 1596|      0|  if (ABSL_PREDICT_FALSE(slot == 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]
  |  |  ------------------
  ------------------
 1597|      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]
  |  |  ------------------
  ------------------
 1598|      0|  }
 1599|      0|  if (ABSL_PREDICT_FALSE(slot == DefaultIterSlot())) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1600|      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]
  |  |  ------------------
  ------------------
 1601|      0|                 operation);
 1602|      0|  }
 1603|      0|  if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (1603:7): [Folded, False: 0]
  ------------------
 1604|      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]
  |  |  ------------------
  ------------------
 1605|      0|                           CrashIfIteratorIsInvalid(generation_ptr))) {
 1606|      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]
  |  |  ------------------
  ------------------
 1607|      0|                   "%s called on invalid iterator. The table could have "
 1608|      0|                   "rehashed or moved since this iterator was initialized.",
 1609|      0|                   operation);
 1610|      0|    }
 1611|      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]
  |  |  ------------------
  ------------------
 1612|      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]
  |  |  ------------------
  ------------------
 1613|      0|          FATAL,
 1614|      0|          "%s called on invalid iterator. The element was likely erased.",
 1615|      0|          operation);
 1616|      0|    }
 1617|      0|  } else {
 1618|      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]
  |  |  ------------------
  ------------------
 1619|       |      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]
  |  |  ------------------
  ------------------
 1620|      0|          FATAL,
 1621|      0|          "%s called on invalid iterator. The element might have been erased "
 1622|      0|          "or the table might have rehashed. Consider running with "
 1623|      0|          "--config=asan to diagnose rehashing issues.",
 1624|      0|          operation);
 1625|      0|    }
 1626|      0|  }
 1627|      0|}
_ZN4absl12lts_2026081718container_internal26AssertIsValidForComparisonERKPKNS1_6ctrl_tEPKvhPKh:
 1633|  1.09G|                                       const GenerationType* generation_ptr) {
 1634|  1.09G|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1634:7): [True: 1.09G, Folded]
  ------------------
 1635|      0|  const bool ctrl_is_valid_for_comparison =
 1636|      0|      slot == nullptr || slot == DefaultIterSlot() ||
  ------------------
  |  Branch (1636:7): [True: 0, False: 0]
  |  Branch (1636:26): [True: 0, False: 0]
  ------------------
 1637|      0|      IsFull(CrashIfIteratorIsInvalid(ctrl));
  ------------------
  |  Branch (1637:7): [True: 0, False: 0]
  ------------------
 1638|      0|  if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (1638:7): [Folded, False: 0]
  ------------------
 1639|      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]
  |  |  ------------------
  ------------------
 1640|      0|                           CrashIfIteratorIsInvalid(generation_ptr))) {
 1641|       |      // Note: in the case of a rehash, we would expect to see a sanitizer crash
 1642|       |      // in CrashIfIteratorIsInvalid so this assertion will only catch moved
 1643|       |      // table cases, unless we're using a custom allocator that does not
 1644|       |      // deallocate the old backing array (e.g. an arena allocator).
 1645|      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]
  |  |  ------------------
  ------------------
 1646|      0|          FATAL,
 1647|      0|          "Invalid iterator comparison. The table was likely moved (or "
 1648|      0|          "possibly rehashed) since this iterator was initialized.");
 1649|      0|    }
 1650|      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]
  |  |  ------------------
  ------------------
 1651|      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]
  |  |  ------------------
  ------------------
 1652|      0|          FATAL, "Invalid iterator comparison. The element was likely erased.");
 1653|      0|    }
 1654|      0|  } else {
 1655|      0|    ABSL_HARDENING_ASSERT_SLOW(
  ------------------
  |  |  188|      0|#define ABSL_HARDENING_ASSERT_SLOW(expr) ABSL_ASSERT(expr)
  |  |  ------------------
  |  |  |  |  131|      0|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  |  |  ------------------
  |  |  |  |  |  |   87|      0|#define ABSL_INTERNAL_UNEVALUATED(expr) (decltype((void)(expr))())
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1656|      0|        ctrl_is_valid_for_comparison &&
 1657|      0|        "Invalid iterator comparison. The element might have been erased or "
 1658|      0|        "the table might have rehashed. Consider running with --config=asan to "
 1659|      0|        "diagnose rehashing issues.");
 1660|      0|  }
 1661|      0|}
_ZN4absl12lts_2026081718container_internal19AssertSameContainerERKPKNS1_6ctrl_tES6_PKvS8_PKhSA_:
 1694|   547M|                                const GenerationType* generation_ptr_b) {
 1695|   547M|  if (!SwisstableDebugEnabled()) return;
  ------------------
  |  Branch (1695:7): [True: 547M, Folded]
  ------------------
 1696|       |  // `SwisstableDebugEnabled()` is also true for release builds with hardening
 1697|       |  // enabled. To minimize their impact in those builds:
 1698|       |  // - use `ABSL_PREDICT_FALSE()` to provide a compiler hint for code layout
 1699|       |  // - use `ABSL_RAW_LOG()` with a format string to reduce code size and improve
 1700|       |  //   the chances that the hot paths will be inlined.
 1701|       |
 1702|       |  // fail_if(is_invalid, message) crashes when is_invalid is true and provides
 1703|       |  // an error message based on `message`.
 1704|      0|  const auto fail_if = [](bool is_invalid, const char* message) {
 1705|      0|    if (ABSL_PREDICT_FALSE(is_invalid)) {
 1706|      0|      ABSL_RAW_LOG(FATAL, "Invalid iterator comparison. %s", message);
 1707|      0|    }
 1708|      0|  };
 1709|       |
 1710|      0|  const bool a_is_default = slot_a == DefaultIterSlot();
 1711|      0|  const bool b_is_default = slot_b == DefaultIterSlot();
 1712|      0|  if (a_is_default && b_is_default) return;
  ------------------
  |  Branch (1712:7): [True: 0, False: 0]
  |  Branch (1712:23): [True: 0, False: 0]
  ------------------
 1713|      0|  fail_if(a_is_default != b_is_default,
 1714|      0|          "Comparing default-constructed hashtable iterator with a "
 1715|      0|          "non-default-constructed hashtable iterator.");
 1716|       |
 1717|      0|  if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (1717:7): [Folded, False: 0]
  ------------------
 1718|      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]
  |  |  ------------------
  ------------------
 1719|      0|    const bool a_is_empty = IsEmptyGeneration(generation_ptr_a);
 1720|      0|    const bool b_is_empty = IsEmptyGeneration(generation_ptr_b);
 1721|      0|    fail_if(a_is_empty != b_is_empty,
 1722|      0|            "Comparing an iterator from an empty hashtable with an iterator "
 1723|      0|            "from a non-empty hashtable.");
 1724|      0|    fail_if(a_is_empty && b_is_empty,
  ------------------
  |  Branch (1724:13): [True: 0, False: 0]
  |  Branch (1724:27): [True: 0, False: 0]
  ------------------
 1725|      0|            "Comparing iterators from different empty hashtables.");
 1726|       |
 1727|      0|    const bool a_is_end = slot_a == nullptr;
 1728|      0|    const bool b_is_end = slot_b == nullptr;
 1729|      0|    fail_if(a_is_end || b_is_end,
  ------------------
  |  Branch (1729:13): [True: 0, False: 0]
  |  Branch (1729:25): [True: 0, False: 0]
  ------------------
 1730|      0|            "Comparing iterator with an end() iterator from a different "
 1731|      0|            "hashtable.");
 1732|      0|    fail_if(true, "Comparing non-end() iterators from different hashtables.");
 1733|      0|  } else {
 1734|      0|    ABSL_HARDENING_ASSERT_SLOW(
  ------------------
  |  |  188|      0|#define ABSL_HARDENING_ASSERT_SLOW(expr) ABSL_ASSERT(expr)
  |  |  ------------------
  |  |  |  |  131|      0|#define ABSL_ASSERT(expr) ABSL_INTERNAL_UNEVALUATED((expr) ? void() : void())
  |  |  |  |  ------------------
  |  |  |  |  |  |   87|      0|#define ABSL_INTERNAL_UNEVALUATED(expr) (decltype((void)(expr))())
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1735|      0|        AreItersFromSameContainer(ctrl_a, ctrl_b, slot_a, slot_b) &&
 1736|      0|        "Invalid iterator comparison. The iterators may be from different "
 1737|      0|        "containers or the container might have rehashed or moved. Consider "
 1738|      0|        "running with --config=asan to diagnose issues.");
 1739|      0|  }
 1740|      0|}
_ZN4absl12lts_2026081718container_internal8probe_h1ENS1_13ProbeCapacityEm:
 1800|   753M|inline probe_seq<Group::kWidth> probe_h1(ProbeCapacity capacity, size_t h1) {
 1801|   753M|  return probe_seq<Group::kWidth>(capacity, h1);
 1802|   753M|}
_ZN4absl12lts_2026081718container_internal5probeENS1_13ProbeCapacityEm:
 1803|   751M|inline probe_seq<Group::kWidth> probe(ProbeCapacity capacity, size_t hash) {
 1804|   751M|  return probe_h1(capacity, H1(hash));
 1805|   751M|}
_ZN4absl12lts_2026081718container_internal15MaxStorableSizeEv:
 1988|      4|constexpr size_t MaxStorableSize() {
 1989|      4|  return static_cast<size_t>(uint64_t{1}
 1990|      4|                             << HashtableInlineData::kSizeBitCount) -
 1991|      4|         1;
 1992|      4|}
_ZN4absl12lts_2026081718container_internal12SooSlotIndexEv:
 2027|  5.57k|constexpr size_t SooSlotIndex() { return 1; }
_ZNK4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE9ToRawDataEv:
  537|  87.7k|  IntType ToRawData() const { return capacity_data_; }
_ZNK4absl12lts_2026081718container_internal19MaybeInitializedPtrINS1_6ctrl_tEE3getEv:
 1237|  3.07G|  T* get() const { ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(p); }
  ------------------
  |  |  484|  3.07G|#define ABSL_SWISSTABLE_IGNORE_UNINITIALIZED_RETURN(x) return x
  ------------------
_ZN4absl12lts_2026081718container_internal19MaybeInitializedPtrINS1_6ctrl_tEE3setEPS3_:
 1238|  82.1k|  void set(T* ptr) { p = ptr; }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE4sizeEv:
  701|   104k|  size_t size() const { return static_cast<size_t>(data_ >> kSizeShift); }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8set_sizeEm:
  719|      2|  void set_size(size_t size) {
  720|      2|    data_ =
  721|      2|        (data_ & kMetadataMask) | (static_cast<uint64_t>(size) << kSizeShift);
  722|      2|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE14increment_sizeEv:
  702|   204M|  void increment_size() { data_ += kSizeOneNoMetadata; }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE5emptyEv:
  708|  5.58k|  bool empty() const { return data_ < kSizeOneNoMetadata; }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE12ToPublicSeedEm:
  792|  1.04G|  static constexpr uint64_t ToPublicSeed(uint64_t seed) {
  793|       |    // In kCapacityByLog mode, we shift public seed to the left to keep bits of
  794|       |    // the seed in the original place. It allows us to use single instruction to
  795|       |    // access the seed (e.g., `andl $0x7c0, %r8d`).
  796|  1.04G|    return seed << kCapacityBitStoredInDataCount;
  797|  1.04G|  }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE4seedEv:
  724|  1.04G|  PerTableSeed seed() const {
  725|  1.04G|    return PerTableSeed(ToPublicSeed(data_ & kSeedMask));
  726|  1.04G|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8set_seedEh:
  799|  5.57k|  void set_seed(uint8_t seed) {
  800|  5.57k|    data_ = (data_ & ~kSeedMask) | (seed & kSeedMask);
  801|  5.57k|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE17generate_new_seedEv:
  728|  5.57k|  void generate_new_seed() { set_seed(NextHashTableSeed()); }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8capacityEv:
  692|  5.19G|  HashtableCapacity capacity() const {
  693|  5.19G|    return HashtableCapacity::FromRawData(capacity_internal_);
  694|  5.19G|  }
_ZN4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE11FromRawDataEm:
  532|  5.19G|  static HashtableCapacityImpl FromRawData(uint64_t capacity) {
  533|  5.19G|    auto cap = HashtableCapacityImpl(uninitialized_tag_t{});
  534|  5.19G|    cap.capacity_data_ = static_cast<IntType>(capacity);
  535|  5.19G|    return cap;
  536|  5.19G|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE12set_capacityENS1_21HashtableCapacityImplILS3_1EEE:
  697|  82.1k|  void set_capacity(HashtableCapacity c) { capacity_internal_ = c.ToRawData(); }
_ZNK4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EE8is_smallEv:
  557|   751M|  constexpr bool is_small() const {
  558|       |    // Small tables have capacity 0 or 1. This expression is valid for both
  559|       |    // capacity storage modes.
  560|       |    // Comparing capacity_data_ directly leads to a better generated code.
  561|       |    // One byte comparison is used before computing the capacity in order to
  562|       |    // detect small tables faster for critical path.
  563|   751M|    static_assert(kMaxSmallCapacity == 1);
  564|   751M|    return capacity_data_ <= 1;
  565|   751M|  }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE8is_smallEv:
  695|   751M|  bool is_small() const { return capacity().is_small(); }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE9has_infozEv:
  739|   204M|  bool has_infoz() const {
  740|   204M|    return ABSL_PREDICT_FALSE((data_ & kHasInfozMask) != 0);
  ------------------
  |  |  190|   204M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:49): [Folded, False: 204M]
  |  |  |  Branch (190:58): [True: 0, False: 204M]
  |  |  ------------------
  ------------------
  741|   204M|  }
_ZNK4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE21blocked_element_countEv:
  747|  76.5k|  size_t blocked_element_count() const {
  748|  76.5k|    return (data_ & kBlockedElementMask) >> kBlockedElementsShift;
  749|  76.5k|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE26init_blocked_element_countEm:
  754|      4|  void init_blocked_element_count(uint64_t count) {
  755|      4|    ABSL_SWISSTABLE_ASSERT(blocked_element_count() == 0);
  ------------------
  |  |  257|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  756|       |    ABSL_SWISSTABLE_ASSERT(count <= kMaxBlockedElementCount);
  ------------------
  |  |  257|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  757|      4|    data_ |= count << kBlockedElementsShift;
  758|      4|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EE33set_blocked_element_count_to_zeroEv:
  759|  70.9k|  void set_blocked_element_count_to_zero() { data_ &= ~kBlockedElementMask; }
_ZN4absl12lts_2026081718container_internal12CommonFields13CreateDefaultILb0EEES2_v:
 1312|  5.58k|  static CommonFields CreateDefault() {
 1313|  5.58k|    return kSooEnabled ? CommonFields{soo_tag_t{}}
  ------------------
  |  Branch (1313:12): [Folded, False: 5.58k]
  ------------------
 1314|  5.58k|                       : CommonFields{non_soo_tag_t{}};
 1315|  5.58k|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19get_destroy_slot_fnEv:
 3922|      6|  static constexpr DestroySlotFn get_destroy_slot_fn() {
 3923|      6|    return PolicyTraits::template destroy_is_trivial<Alloc>()
  ------------------
  |  Branch (3923:12): [True: 6, Folded]
  ------------------
 3924|      6|               ? nullptr
 3925|      6|               : &raw_hash_set::destroy_slot_fn_impl;
 3926|      6|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6commonEv:
 3838|  1.48G|  const CommonFields& common() const { return settings_.template get<0>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE15DefaultCapacityEv:
 2290|      4|  constexpr static size_t DefaultCapacity() {
 2291|      4|    return SooEnabled() ? SooCapacity() : 0;
  ------------------
  |  Branch (2291:12): [Folded, False: 4]
  ------------------
 2292|      4|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8capacityEv:
 2786|    598|  size_t capacity() const {
 2787|    598|    const size_t cap = common().capacity();
 2788|       |    // Compiler complains when using functions in ASSUME so use local variables.
 2789|    598|    [[maybe_unused]] const bool kIsValid = IsValidCapacity(cap);
 2790|    598|    [[maybe_unused]] const size_t kDefaultCapacity = DefaultCapacity();
 2791|    598|    [[maybe_unused]] const size_t kMaxValidCapacity = MaxValidCapacity();
 2792|    598|    ABSL_ASSUME(kIsValid || cap == 0);
  ------------------
  |  |  272|    598|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (272:44): [True: 598, False: 0]
  |  |  |  Branch (272:44): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 2793|    598|    ABSL_ASSUME(cap >= kDefaultCapacity);
  ------------------
  |  |  272|    598|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2794|    598|    ABSL_ASSUME(cap <= kMaxValidCapacity);
  ------------------
  |  |  272|    598|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2795|    598|    return cap;
 2796|    598|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6commonEv:
 3837|   982M|  CommonFields& common() { return settings_.template get<0>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7to_slotEPv:
 3519|   479M|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3520|   479M|    return static_cast<slot_type*>(buf);
 3521|   479M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14char_alloc_refEv:
 3893|    602|  CharAlloc& char_alloc_ref() { return settings_.template get<3>(); }
_ZN4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEC2ENS1_19uninitialized_tag_tE:
  520|  5.19G|  explicit HashtableCapacityImpl(uninitialized_tag_t) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEC2Ev:
 2534|      2|      std::is_nothrow_default_constructible_v<allocator_type>) {}
_ZN4absl12lts_2026081718container_internal21HashtableCapacityImplILNS1_28HashtableCapacityStorageModeE1EEC2Em:
  522|  87.7k|      : capacity_data_(static_cast<IntType>(
  523|  87.7k|            StorageMode == kCapacityByValue ? capacity
  ------------------
  |  Branch (523:13): [Folded, False: 87.7k]
  ------------------
  524|  87.7k|                                            : TrailingZeros(capacity + 1))) {
  525|       |    ABSL_SWISSTABLE_ASSERT(capacity == 0 || IsValidCapacity(capacity));
  ------------------
  |  |  257|  87.7k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
  526|  87.7k|  }
_ZN4absl12lts_2026081718container_internal23HashtableInlineDataImplILNS1_28HashtableCapacityStorageModeE1EEC2ENS1_21HashtableCapacityImplILS3_1EEENS1_19no_seed_empty_tag_tE:
  685|  5.58k|      : capacity_internal_(capacity.ToRawData()), data_(0) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE15unchecked_derefENSA_8iteratorE:
 3820|    512|  reference unchecked_deref(iterator it) { return it.unchecked_deref(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator15unchecked_derefEv:
 2466|  97.4M|    reference unchecked_deref() const { return PolicyTraits::element(slot_); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22find_or_prepare_insertINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairIPNS1_13map_slot_typeIS8_hEEbEERKT_:
 3777|    512|  std::pair<slot_type*, bool> find_or_prepare_insert(const K& key) {
 3778|    512|    AssertOnFind(key);
 3779|    512|    return is_small() ? find_or_prepare_insert_small(key)
  ------------------
  |  Branch (3779:12): [True: 4, False: 508]
  ------------------
 3780|    512|                      : find_or_prepare_insert_large(key);
 3781|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE12AssertOnFindINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEvRKT_:
 3725|    512|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|    512|    AssertHashEqConsistent(key);
 3727|    512|    AssertNotDebugCapacity();
 3728|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertHashEqConsistentINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEvRKT_:
 3736|    512|  void AssertHashEqConsistent(const K& key) {
 3737|    512|#ifdef NDEBUG
 3738|    512|    return;
 3739|      0|#endif
 3740|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3741|      0|    if (std::is_same_v<hasher, absl::container_internal::StringHash> &&
  ------------------
  |  Branch (3741:9): [True: 0, Folded]
  ------------------
 3742|      0|        std::is_same_v<key_equal, absl::container_internal::StringEq>) {
  ------------------
  |  Branch (3742:9): [True: 0, Folded]
  ------------------
 3743|      0|      return;
 3744|      0|    }
 3745|      0|    if (std::is_scalar_v<key_type> &&
  ------------------
  |  Branch (3745:9): [Folded, False: 0]
  ------------------
 3746|      0|        std::is_same_v<hasher, absl::Hash<key_type>> &&
  ------------------
  |  Branch (3746:9): [Folded, False: 0]
  ------------------
 3747|      0|        std::is_same_v<key_equal, std::equal_to<key_type>>) {
  ------------------
  |  Branch (3747:9): [Folded, False: 0]
  ------------------
 3748|      0|      return;
 3749|      0|    }
 3750|      0|    if (empty()) return;
  ------------------
  |  Branch (3750:9): [True: 0, False: 0]
  ------------------
 3751|       |
 3752|      0|    const size_t hash_of_arg = hash_of(key);
 3753|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3754|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3755|      0|      if (!is_key_equal) return;
 3756|       |
 3757|      0|      [[maybe_unused]] const bool is_hash_equal =
 3758|      0|          hash_of_arg == hash_of(to_slot(slot));
 3759|      0|      assert((!is_key_equal || is_hash_equal) &&
 3760|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3761|      0|             "hash/eq functors are inconsistent.");
 3762|      0|    };
 3763|       |
 3764|      0|    if (is_small()) {
  ------------------
  |  Branch (3764:9): [True: 0, False: 0]
  ------------------
 3765|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3766|      0|      return;
 3767|      0|    }
 3768|       |    // We only do validation for small tables so that it's constant time.
 3769|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3769:9): [True: 0, False: 0]
  ------------------
 3770|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3771|      0|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertNotDebugCapacityEv:
 3731|   194M|  void AssertNotDebugCapacity() const { common().AssertNotDebugCapacity(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6commonEv:
 3838|   584M|  const CommonFields& common() const { return settings_.template get<0>(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8is_smallEv:
 2312|  97.4M|  bool is_small() const { return common().is_small(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE28find_or_prepare_insert_smallINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairIPNS1_13map_slot_typeIS8_hEEbEERKT_:
 3660|      4|  find_or_prepare_insert_small(const K& key) {
 3661|      4|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|      4|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3662|       |    if constexpr (SooEnabled()) {
 3663|       |      return find_or_prepare_insert_soo(key);
 3664|       |    }
 3665|      4|    if (!empty()) {
  ------------------
  |  Branch (3665:9): [True: 2, False: 2]
  ------------------
 3666|      2|      if (equal_to(key, single_slot())) {
  ------------------
  |  Branch (3666:11): [True: 0, False: 2]
  ------------------
 3667|      0|        return {single_slot(), false};
 3668|      0|      }
 3669|      2|    }
 3670|      4|    return {to_slot(PrepareInsertSmallNonSoo(
 3671|      4|                common(), GetPolicyFunctions(),
 3672|      4|                HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})),
 3673|      4|            true};
 3674|      4|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE5emptyEv:
 2778|      4|  bool empty() const { return !size(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4sizeEv:
 2779|      4|  size_t size() const {
 2780|      4|    AssertNotDebugCapacity();
 2781|      4|    const size_t size = common().size();
 2782|      4|    [[maybe_unused]] const size_t kMaxValidSize = MaxValidSize();
 2783|      4|    ABSL_ASSUME(size <= kMaxValidSize);
  ------------------
  |  |  272|      4|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2784|      4|    return size;
 2785|      4|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8equal_toINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEbRKT_PNS1_13map_slot_typeIS8_hEE:
 3502|     24|                                             slot_type* slot) const {
 3503|     24|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|     24|                               PolicyTraits::element(slot));
 3505|     24|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6eq_refEv:
 3892|  97.4M|  const key_equal& eq_ref() const { return settings_.template get<2>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE11single_slotEv:
 3862|      2|  slot_type* single_slot() {
 3863|      2|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3864|      2|    return SooEnabled()
  ------------------
  |  Branch (3864:12): [Folded, False: 2]
  ------------------
 3865|      2|               ? soo_slot()
 3866|      2|               : to_slot(common().slot_array(/*capacity=*/1));
 3867|      2|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7to_slotEPv:
 3519|   194M|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3520|   194M|    return static_cast<slot_type*>(buf);
 3521|   194M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6commonEv:
 3837|   389M|  CommonFields& common() { return settings_.template get<0>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE18GetPolicyFunctionsEv:
 3988|    512|  static const PolicyFunctions& GetPolicyFunctions() {
 3989|    512|    static_assert(sizeof(slot_type) <= (std::numeric_limits<uint32_t>::max)(),
 3990|    512|                  "Slot size is too large. Use std::unique_ptr for value type "
 3991|    512|                  "or use absl::node_hash_{map,set}.");
 3992|    512|    static_assert(alignof(slot_type) <=
 3993|    512|                  size_t{(std::numeric_limits<uint16_t>::max)()});
 3994|    512|    static_assert(sizeof(key_type) <=
 3995|    512|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3996|    512|    static_assert(sizeof(value_type) <=
 3997|    512|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3998|    512|    static constexpr size_t kBackingArrayAlignment =
 3999|    512|        BackingArrayAlignment(alignof(slot_type));
 4000|    512|    static constexpr PolicyFunctions value = {
 4001|    512|        static_cast<uint32_t>(sizeof(key_type)),
 4002|    512|        static_cast<uint32_t>(sizeof(value_type)),
 4003|    512|        static_cast<uint32_t>(sizeof(slot_type)),
 4004|    512|        static_cast<uint16_t>(alignof(slot_type)), SooEnabled(),
 4005|    512|        ShouldSampleHashtablezInfoForAlloc<CharAlloc>(),
 4006|       |        // TODO(b/328722020): try to type erase
 4007|       |        // for standard layout and alignof(Hash) <= alignof(CommonFields).
 4008|    512|        std::is_empty_v<hasher> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4008:9): [True: 0, Folded]
  ------------------
 4009|    512|                                : &raw_hash_set::get_hash_ref_fn,
 4010|    512|        PolicyTraits::template get_hash_slot_fn<hasher, kIsDefaultHash>(),
 4011|    512|        PolicyTraits::transfer_uses_memcpy()
  ------------------
  |  Branch (4011:9): [True: 0, Folded]
  ------------------
 4012|    512|            ? TransferNRelocatable<sizeof(slot_type)>
 4013|    512|            : &raw_hash_set::transfer_n_slots_fn,
 4014|    512|        std::is_empty_v<Alloc> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4014:9): [True: 0, Folded]
  ------------------
 4015|    512|                               : &raw_hash_set::get_char_alloc_ref_fn,
 4016|    512|        &AllocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 4017|    512|        get_dealloc_backing_array_fn(),
 4018|    512|        &raw_hash_set::transfer_unprobed_elements_to_next_capacity_fn};
 4019|    512|    return value;
 4020|    512|  }
_ZN4absl12lts_2026081718container_internal20TransferNRelocatableILm24EEEvPvS3_S3_m:
 2151|     12|                                                  size_t count) {
 2152|       |  // TODO(b/382423690): Experiment with making specialization for power of 2 and
 2153|       |  // non power of 2. This would require passing the size of the slot.
 2154|     12|  memcpy(dst, src, SizeOfSlot * count);
 2155|     12|}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE46transfer_unprobed_elements_to_next_capacity_fnERNS1_12CommonFieldsEPKNS1_6ctrl_tEPvSG_PFvSG_hmmE:
 3935|     10|                                    size_t source_offset, size_t h1)) {
 3936|     10|    const size_t new_capacity = common.capacity();
 3937|     10|    ABSL_ASSUME(new_capacity > kMaxSmallCapacity);
  ------------------
  |  |  272|     10|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3938|     10|    const size_t old_capacity = PreviousCapacity(new_capacity);
 3939|     10|    ABSL_ASSUME(old_capacity + 1 >= Group::kWidth);
  ------------------
  |  |  272|     10|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3940|     10|    ABSL_ASSUME((old_capacity + 1) % Group::kWidth == 0);
  ------------------
  |  |  272|     10|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3941|       |
 3942|     10|    auto* set = reinterpret_cast<raw_hash_set*>(&common);
 3943|     10|    slot_type* old_slots_ptr = to_slot(old_slots);
 3944|     10|    ctrl_t* new_ctrl = common.control();
 3945|     10|    slot_type* new_slots = set->slot_array(new_capacity);
 3946|       |
 3947|     72|    for (size_t group_index = 0; group_index < old_capacity;
  ------------------
  |  Branch (3947:34): [True: 62, False: 10]
  ------------------
 3948|     62|         group_index += Group::kWidth) {
 3949|     62|      GroupFullEmptyOrDeleted old_g(old_ctrl + group_index);
 3950|     62|      std::memset(new_ctrl + group_index, static_cast<int8_t>(ctrl_t::kEmpty),
 3951|     62|                  Group::kWidth);
 3952|     62|      std::memset(new_ctrl + group_index + old_capacity + 1,
 3953|     62|                  static_cast<int8_t>(ctrl_t::kEmpty), Group::kWidth);
 3954|       |      // TODO(b/382423690): try to type erase everything outside of the loop.
 3955|       |      // We will share a lot of code in expense of one function call per group.
 3956|    884|      for (auto in_fixed_group_index : old_g.MaskFull()) {
  ------------------
  |  Branch (3956:38): [True: 884, False: 62]
  ------------------
 3957|    884|        size_t old_index = group_index + in_fixed_group_index;
 3958|    884|        slot_type* old_slot = old_slots_ptr + old_index;
 3959|       |        // TODO(b/382423690): try to avoid entire hash calculation since we need
 3960|       |        // only one new bit of h1.
 3961|    884|        size_t hash = set->hash_of(old_slot);
 3962|    884|        size_t h1 = H1(hash);
 3963|    884|        h2_t h2 = H2(hash);
 3964|    884|        size_t new_index = TryFindNewIndexWithoutProbing(
 3965|    884|            h1, old_index, old_capacity, new_ctrl, new_capacity);
 3966|       |        // Note that encode_probed_element is allowed to use old_ctrl buffer
 3967|       |        // till and included the old_index.
 3968|    884|        if (ABSL_PREDICT_FALSE(new_index == kProbedElementIndexSentinel)) {
  ------------------
  |  |  190|    884|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 6, False: 878]
  |  |  |  Branch (190:49): [Folded, False: 884]
  |  |  |  Branch (190:58): [True: 6, False: 878]
  |  |  ------------------
  ------------------
 3969|      6|          encode_probed_element(probed_storage, h2, old_index, h1);
 3970|      6|          continue;
 3971|      6|        }
 3972|    878|        ABSL_SWISSTABLE_ASSERT((new_index & old_capacity) <= old_index);
  ------------------
  |  |  257|    878|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3973|       |        ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_index]));
  ------------------
  |  |  257|    878|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3974|    878|        new_ctrl[new_index] = static_cast<ctrl_t>(h2);
 3975|    878|        auto* new_slot = new_slots + new_index;
 3976|    878|        SanitizerUnpoisonMemoryRegion(new_slot, sizeof(slot_type));
 3977|    878|        set->transfer(new_slot, old_slot);
 3978|    878|        SanitizerPoisonMemoryRegion(old_slot, sizeof(slot_type));
 3979|    878|      }
 3980|     62|    }
 3981|     10|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10slot_arrayEm:
 3849|     10|  slot_type* slot_array(size_t capacity) const {
 3850|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|     10|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3851|     10|    return static_cast<slot_type*>(common().slot_array(capacity));
 3852|     10|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofEPNS1_13map_slot_typeIS8_hEE:
 3511|    884|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(slot_type* slot) const {
 3512|    884|    return PolicyTraits::apply(
 3513|    884|        HashElement<hasher, kIsDefaultHash>{hash_ref(), common().seed().seed()},
 3514|    884|        PolicyTraits::element(slot));
 3515|    884|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8hash_refEv:
 3890|  97.4M|  const hasher& hash_ref() const { return settings_.template get<1>(); }
_ZN4absl12lts_2026081718container_internal29TryFindNewIndexWithoutProbingIvEEmmmmPNS1_6ctrl_tEm:
 1827|   291M|                                            size_t new_capacity) {
 1828|   291M|  size_t index_diff = old_index - h1;
 1829|       |  // The first probe group starts with h1 & capacity.
 1830|       |  // All following groups start at (h1 + Group::kWidth * K) & capacity.
 1831|       |  // We can find an index within the floating group as index_diff modulo
 1832|       |  // Group::kWidth.
 1833|       |  // Both old and new capacity are larger than Group::kWidth so we can avoid
 1834|       |  // computing `& capacity`.
 1835|   291M|  size_t in_floating_group_index = index_diff & (Group::kWidth - 1);
 1836|       |  // By subtracting we will get the difference between the first probe group
 1837|       |  // and the probe group corresponding to old_index.
 1838|   291M|  index_diff -= in_floating_group_index;
 1839|   291M|  if (ABSL_PREDICT_TRUE((index_diff & old_capacity) == 0)) {
  ------------------
  |  |  191|   291M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 277M, False: 13.1M]
  |  |  |  Branch (191:48): [Folded, False: 291M]
  |  |  |  Branch (191:57): [True: 277M, False: 13.1M]
  |  |  ------------------
  ------------------
 1840|   277M|    size_t new_index = (h1 + in_floating_group_index) & new_capacity;
 1841|   277M|    ABSL_ASSUME(new_index != kProbedElementIndexSentinel);
  ------------------
  |  |  272|   277M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1842|   277M|    return new_index;
 1843|   277M|  }
 1844|  13.1M|  ABSL_SWISSTABLE_ASSERT(((old_index - h1) & old_capacity) >= Group::kWidth);
  ------------------
  |  |  257|  13.1M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 1845|       |  // Try to insert element into the first probe group.
 1846|       |  // new_ctrl is not yet fully initialized so we can't use regular search via
 1847|       |  // find_first_non_full.
 1848|       |
 1849|       |  // We can search in the first probe group only if it is located in already
 1850|       |  // initialized part of the table.
 1851|  13.1M|  if (ABSL_PREDICT_FALSE((h1 & old_capacity) >= old_index)) {
  ------------------
  |  |  190|  13.1M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 90.8k, False: 13.0M]
  |  |  |  Branch (190:49): [Folded, False: 13.1M]
  |  |  |  Branch (190:58): [True: 90.8k, False: 13.0M]
  |  |  ------------------
  ------------------
 1852|  90.8k|    return kProbedElementIndexSentinel;
 1853|  90.8k|  }
 1854|  13.0M|  size_t offset = h1 & new_capacity;
 1855|  13.0M|  Group new_g(new_ctrl + offset);
 1856|  13.0M|  if (auto mask = new_g.MaskNonFull(); ABSL_PREDICT_TRUE(mask)) {
  ------------------
  |  |  191|  13.0M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 13.0M, False: 6.94k]
  |  |  |  Branch (191:48): [Folded, False: 13.0M]
  |  |  |  Branch (191:57): [True: 13.0M, False: 6.94k]
  |  |  ------------------
  ------------------
 1857|  13.0M|    size_t result = offset + mask.LowestBitSet();
 1858|  13.0M|    ABSL_ASSUME(result != kProbedElementIndexSentinel);
  ------------------
  |  |  272|  13.0M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1859|  13.0M|    return result;
 1860|  13.0M|  }
 1861|  6.94k|  return kProbedElementIndexSentinel;
 1862|  13.0M|}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8transferEPNS1_13map_slot_typeIS8_hEESD_:
 3377|    878|  void transfer(slot_type* to, slot_type* from) {
 3378|    878|    common().RunWithReentrancyGuard([&] {
 3379|    878|      allocator_type alloc(char_alloc_ref());
 3380|    878|      PolicyTraits::transfer(&alloc, to, from);
 3381|    878|    });
 3382|    878|  }
_ZN4absl12lts_2026081718container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEhEEJEE8transferEPNS1_13map_slot_typeISA_hEESF_EUlvE_EEvT_:
 1486|    878|  void RunWithReentrancyGuard(F f) {
 1487|    878|#ifdef NDEBUG
 1488|    878|    f();
 1489|    878|    return;
 1490|      0|#endif
 1491|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1492|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1493|      0|    f();
 1494|      0|    set_capacity(cap);
 1495|      0|  }
_ZZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8transferEPNS1_13map_slot_typeIS8_hEESD_ENKUlvE_clEv:
 3378|    878|    common().RunWithReentrancyGuard([&] {
 3379|    878|      allocator_type alloc(char_alloc_ref());
 3380|    878|      PolicyTraits::transfer(&alloc, to, from);
 3381|    878|    });
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14char_alloc_refEv:
 3893|  1.39k|  CharAlloc& char_alloc_ref() { return settings_.template get<3>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8hash_refEv:
 3889|      6|  hasher& hash_ref() { return settings_.template get<1>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE28find_or_prepare_insert_largeINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairIPNS1_13map_slot_typeIS8_hEEbEERKT_:
 3677|    508|  std::pair<slot_type*, bool> find_or_prepare_insert_large(const K& key) {
 3678|    508|    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|    508|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3679|    508|    prefetch_heap_block();
 3680|    508|    const size_t cap = capacity();
 3681|    508|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|    508|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3682|    508|    const size_t hash = hash_of(key);
 3683|    508|    auto seq = probe(ProbeCapacity{cap}, hash);
 3684|    508|    const h2_t h2 = H2(hash);
 3685|    508|    const ctrl_t* ctrl = control();
 3686|    508|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3687|    550|    while (true) {
  ------------------
  |  Branch (3687:12): [True: 550, Folded]
  ------------------
 3688|    550|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3689|    550|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3690|    550|#endif
 3691|    550|      Group g{ctrl + seq.offset()};
 3692|    550|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3692:23): [True: 22, False: 550]
  ------------------
 3693|     22|        slot_type* slot = slot_array + seq.offset(i);
 3694|     22|        if (ABSL_PREDICT_TRUE(equal_to(key, slot))) {
  ------------------
  |  |  191|     22|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 22]
  |  |  |  Branch (191:48): [Folded, False: 22]
  |  |  |  Branch (191:57): [True: 0, False: 22]
  |  |  ------------------
  ------------------
 3695|      0|          return {slot, false};
 3696|      0|        }
 3697|     22|      }
 3698|    550|      auto mask_empty = g.MaskEmpty();
 3699|    550|      if (ABSL_PREDICT_TRUE(mask_empty)) {
  ------------------
  |  |  191|    550|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 508, False: 42]
  |  |  |  Branch (191:48): [Folded, False: 550]
  |  |  |  Branch (191:57): [True: 508, False: 42]
  |  |  ------------------
  ------------------
 3700|    508|        size_t target_group_offset = seq.offset();
 3701|    508|        void* slot =
 3702|    508|            SwisstableGenerationsEnabled()
  ------------------
  |  Branch (3702:13): [Folded, False: 508]
  ------------------
 3703|    508|                ? PrepareInsertLargeGenerationsEnabled(
 3704|      0|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3705|      0|                      FindInfo{target_group_offset, seq.index()},
 3706|      0|                      HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3707|    508|                : PrepareInsertLarge(
 3708|    508|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3709|    508|                      FindInfo{target_group_offset, seq.index()});
 3710|    508|        return {to_slot(slot), true};
 3711|    508|      }
 3712|     42|      seq.next();
 3713|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  257|     42|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3714|     42|    }
 3715|    508|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE19prefetch_heap_blockEv:
 3830|  97.4M|  void prefetch_heap_block() const {
 3831|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|  97.4M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3832|  97.4M|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3833|  97.4M|    __builtin_prefetch(control(), 0, 1);
 3834|  97.4M|#endif
 3835|  97.4M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8capacityEv:
 2786|    510|  size_t capacity() const {
 2787|    510|    const size_t cap = common().capacity();
 2788|       |    // Compiler complains when using functions in ASSUME so use local variables.
 2789|    510|    [[maybe_unused]] const bool kIsValid = IsValidCapacity(cap);
 2790|    510|    [[maybe_unused]] const size_t kDefaultCapacity = DefaultCapacity();
 2791|    510|    [[maybe_unused]] const size_t kMaxValidCapacity = MaxValidCapacity();
 2792|    510|    ABSL_ASSUME(kIsValid || cap == 0);
  ------------------
  |  |  272|    512|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (272:44): [True: 508, False: 2]
  |  |  |  Branch (272:44): [True: 2, False: 0]
  |  |  ------------------
  ------------------
 2793|    510|    ABSL_ASSUME(cap >= kDefaultCapacity);
  ------------------
  |  |  272|    510|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2794|    510|    ABSL_ASSUME(cap <= kMaxValidCapacity);
  ------------------
  |  |  272|    510|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2795|    510|    return cap;
 2796|    510|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEmRKT_:
 3507|    508|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|    508|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|    508|                                               common().seed().seed()}(key);
 3510|    508|  }
_ZN4absl12lts_2026081718container_internal9probe_seqILm16EEC2ENS1_13ProbeCapacityEm:
 1779|   753M|      : capacity_(capacity.capacity), offset_(hash & capacity_) {}
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7controlEv:
 3845|   194M|  ctrl_t* control() const {
 3846|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   194M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3847|   194M|    return common().control();
 3848|   194M|  }
_ZNK4absl12lts_2026081718container_internal9probe_seqILm16EE6offsetEv:
 1782|  1.80G|  size_t offset() const { return offset_; }
_ZNK4absl12lts_2026081718container_internal9probe_seqILm16EE6offsetEm:
 1783|   416M|  size_t offset(size_t i) const { return (offset_ + i) & capacity_; }
_ZNK4absl12lts_2026081718container_internal9probe_seqILm16EE5indexEv:
 1791|   205M|  size_t index() const { return index_; }
_ZN4absl12lts_2026081718container_internal9probe_seqILm16EE4nextEv:
 1785|  48.3M|  void next() {
 1786|  48.3M|    index_ += Width;
 1787|  48.3M|    offset_ += index_;
 1788|  48.3M|    offset_ &= capacity_;
 1789|  48.3M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10emplace_atIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJEEEEEEvPNS1_13map_slot_typeIS8_hEEDpOT_:
 3792|    512|  void emplace_at(slot_type* slot, Args&&... args) {
 3793|    512|    construct(slot, std::forward<Args>(args)...);
 3794|       |
 3795|       |    // When is_small, find calls find_small and if size is 0, then it will
 3796|       |    // return an end iterator. This can happen in the raw_hash_set copy ctor.
 3797|       |    assert((is_small() ||
 3798|    512|            PolicyTraits::apply(FindElement{*this}, PolicyTraits::element(slot))
 3799|    512|                    .slot() == slot) &&
 3800|    512|           "constructed value does not match the lookup key");
 3801|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJEEEEEEvPNS1_13map_slot_typeIS8_hEEDpOT_:
 3365|    512|  void construct(slot_type* slot, Args&&... args) {
 3366|    512|    common().RunWithReentrancyGuard([&] {
 3367|    512|      allocator_type alloc(char_alloc_ref());
 3368|    512|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|    512|    });
 3370|    512|  }
_ZN4absl12lts_2026081718container_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_:
 1486|    512|  void RunWithReentrancyGuard(F f) {
 1487|    512|#ifdef NDEBUG
 1488|    512|    f();
 1489|    512|    return;
 1490|      0|#endif
 1491|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1492|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1493|      0|    f();
 1494|      0|    set_capacity(cap);
 1495|      0|  }
_ZZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJEEEEEEvPNS1_13map_slot_typeIS8_hEEDpOT_ENKUlvE_clEv:
 3366|    512|    common().RunWithReentrancyGuard([&] {
 3367|    512|      allocator_type alloc(char_alloc_ref());
 3368|    512|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|    512|    });
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE29non_iterable_iterator_at_slotEPNS1_13map_slot_typeIS8_hEE:
 3806|    512|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3807|    512|    return {InsertIteratorControl(), slot, common().generation_ptr()};
 3808|    512|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorC2EPNS1_6ctrl_tEPNS1_13map_slot_typeIS8_hEEPKh:
 2434|  97.4M|        : HashSetIteratorGenerationInfo(generation_ptr),
 2435|  97.4M|          ctrl_(ctrl),
 2436|  97.4M|          slot_(slot) {
 2437|       |      // This assumption helps the compiler know that any non-end iterator is
 2438|       |      // not equal to any end iterator.
 2439|  97.4M|      ABSL_ASSUME(slot != nullptr);
  ------------------
  |  |  272|  97.4M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2440|  97.4M|    }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEEC2EOSA_:
 2695|      2|        settings_(PolicyTraits::transfer_uses_memcpy() || !that.is_full_soo()
  ------------------
  |  Branch (2695:19): [True: 2, Folded]
  |  Branch (2695:59): [True: 0, False: 0]
  ------------------
 2696|      2|                      ? std::move(that.common())
 2697|      2|                      : CommonFields{full_soo_tag_t{},
 2698|      0|                                     that.common().soo_has_tried_sampling()},
 2699|      2|                  that.hash_ref(), that.eq_ref(), that.char_alloc_ref()) {
 2700|      2|    if (!PolicyTraits::transfer_uses_memcpy() && that.is_full_soo()) {
  ------------------
  |  Branch (2700:9): [Folded, False: 2]
  |  Branch (2700:50): [True: 0, False: 0]
  ------------------
 2701|      0|      transfer(soo_slot(), that.soo_slot());
 2702|      0|    }
 2703|      2|    that.common() = CommonFields::CreateDefault<SooEnabled()>();
 2704|      2|    annotate_for_bug_detection_on_move(that);
 2705|      2|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE6eq_refEv:
 3891|      2|  key_equal& eq_ref() { return settings_.template get<2>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE34annotate_for_bug_detection_on_moveERSA_:
 3557|      2|  void annotate_for_bug_detection_on_move([[maybe_unused]] raw_hash_set& that) {
 3558|       |    // We only enable moved-from validation when generations are enabled (rather
 3559|       |    // than using NDEBUG) to avoid issues in which NDEBUG is enabled in some
 3560|       |    // translation units but not in others.
 3561|      2|    if (SwisstableGenerationsEnabled()) {
  ------------------
  |  Branch (3561:9): [Folded, False: 2]
  ------------------
 3562|      0|      that.common().set_capacity(this == &that
  ------------------
  |  Branch (3562:34): [True: 0, False: 0]
  ------------------
 3563|      0|                                     ? HashtableCapacity::CreateSelfMovedFrom()
 3564|      0|                                     : HashtableCapacity::CreateMovedFrom());
 3565|      0|    }
 3566|      2|    if (!SwisstableGenerationsEnabled() ||
  ------------------
  |  Branch (3566:9): [True: 2, Folded]
  |  Branch (3566:9): [True: 2, Folded]
  ------------------
 3567|      0|        !maybe_invalid_capacity().IsValid() ||
  ------------------
  |  Branch (3567:9): [True: 0, False: 0]
  ------------------
 3568|      2|        capacity() == DefaultCapacity()) {
  ------------------
  |  Branch (3568:9): [True: 0, False: 0]
  ------------------
 3569|      2|      return;
 3570|      2|    }
 3571|      0|    common().increment_generation();
 3572|      0|    if (!empty() && common().should_rehash_for_bug_detection_on_move()) {
  ------------------
  |  Branch (3572:9): [True: 0, False: 0]
  |  Branch (3572:21): [True: 0, False: 0]
  ------------------
 3573|      0|      ResizeAllocatedTableWithSeedChange(common(), GetPolicyFunctions(),
 3574|      0|                                         capacity());
 3575|      0|    }
 3576|      0|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEED2Ev:
 2746|      2|  ~raw_hash_set() {
 2747|      2|    destructor_impl();
 2748|       |    if constexpr (SwisstableGenerationsOrDebugEnabled()) {
 2749|       |      common().set_capacity(HashtableCapacity::CreateDestroyed());
 2750|       |    }
 2751|      2|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE15destructor_implEv:
 3457|      2|  void destructor_impl() {
 3458|      2|    if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (3458:9): [Folded, False: 2]
  |  Branch (3458:9): [Folded, False: 2]
  ------------------
 3459|      0|        maybe_invalid_capacity().IsMovedFrom()) {
  ------------------
  |  Branch (3459:9): [True: 0, False: 0]
  ------------------
 3460|      0|      return;
 3461|      0|    }
 3462|       |    if constexpr (SooEnabled()) {
 3463|       |      if (is_small() &&
 3464|       |          (PolicyTraits::template destroy_is_trivial<Alloc>() || empty())) {
 3465|       |        return;
 3466|       |      }
 3467|       |      DestructSoo(common(), sizeof(slot_type), alignof(slot_type),
 3468|       |                  get_destroy_slot_fn(), get_dealloc_backing_array_fn(),
 3469|       |                  &char_alloc_ref());
 3470|      2|    } else {
 3471|      2|      if (capacity() == 0) return;
  ------------------
  |  Branch (3471:11): [True: 2, False: 0]
  ------------------
 3472|      0|      DestructNonSoo(common(), sizeof(slot_type), alignof(slot_type),
 3473|      0|                     get_destroy_slot_fn(), get_dealloc_backing_array_fn(),
 3474|      0|                     &char_alloc_ref());
 3475|      0|    }
 3476|      2|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEEC2Ev:
 2534|      4|      std::is_nothrow_default_constructible_v<allocator_type>) {}
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4findIS8_EENSA_14const_iteratorERKT_:
 3240|   245M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3241|   245M|    return const_cast<raw_hash_set*>(this)->find(key);
 3242|   245M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4findIS8_EENSA_8iteratorERKT_:
 3225|   245M|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3226|   245M|    AssertOnFind(key);
 3227|   245M|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3227:9): [True: 0, False: 245M]
  ------------------
 3228|   245M|    prefetch_heap_block();
 3229|   245M|    return find_large(key);
 3230|   245M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE12AssertOnFindIS8_EEvRKT_:
 3725|   245M|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|   245M|    AssertHashEqConsistent(key);
 3727|   245M|    AssertNotDebugCapacity();
 3728|   245M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22AssertHashEqConsistentIS8_EEvRKT_:
 3736|   245M|  void AssertHashEqConsistent(const K& key) {
 3737|   245M|#ifdef NDEBUG
 3738|   245M|    return;
 3739|      0|#endif
 3740|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3741|      0|    if (std::is_same_v<hasher, absl::container_internal::StringHash> &&
  ------------------
  |  Branch (3741:9): [True: 0, Folded]
  ------------------
 3742|      0|        std::is_same_v<key_equal, absl::container_internal::StringEq>) {
  ------------------
  |  Branch (3742:9): [True: 0, Folded]
  ------------------
 3743|      0|      return;
 3744|      0|    }
 3745|      0|    if (std::is_scalar_v<key_type> &&
  ------------------
  |  Branch (3745:9): [Folded, False: 0]
  ------------------
 3746|      0|        std::is_same_v<hasher, absl::Hash<key_type>> &&
  ------------------
  |  Branch (3746:9): [Folded, False: 0]
  ------------------
 3747|      0|        std::is_same_v<key_equal, std::equal_to<key_type>>) {
  ------------------
  |  Branch (3747:9): [Folded, False: 0]
  ------------------
 3748|      0|      return;
 3749|      0|    }
 3750|      0|    if (empty()) return;
  ------------------
  |  Branch (3750:9): [True: 0, False: 0]
  ------------------
 3751|       |
 3752|      0|    const size_t hash_of_arg = hash_of(key);
 3753|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3754|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3755|      0|      if (!is_key_equal) return;
 3756|       |
 3757|      0|      [[maybe_unused]] const bool is_hash_equal =
 3758|      0|          hash_of_arg == hash_of(to_slot(slot));
 3759|      0|      assert((!is_key_equal || is_hash_equal) &&
 3760|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3761|      0|             "hash/eq functors are inconsistent.");
 3762|      0|    };
 3763|       |
 3764|      0|    if (is_small()) {
  ------------------
  |  Branch (3764:9): [True: 0, False: 0]
  ------------------
 3765|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3766|      0|      return;
 3767|      0|    }
 3768|       |    // We only do validation for small tables so that it's constant time.
 3769|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3769:9): [True: 0, False: 0]
  ------------------
 3770|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3771|      0|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22AssertNotDebugCapacityEv:
 3731|   503M|  void AssertNotDebugCapacity() const { common().AssertNotDebugCapacity(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8is_smallEv:
 2312|   245M|  bool is_small() const { return common().is_small(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE5emptyEv:
 2778|      2|  bool empty() const { return !size(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE4sizeEv:
 2779|      2|  size_t size() const {
 2780|      2|    AssertNotDebugCapacity();
 2781|      2|    const size_t size = common().size();
 2782|      2|    [[maybe_unused]] const size_t kMaxValidSize = MaxValidSize();
 2783|      2|    ABSL_ASSUME(size <= kMaxValidSize);
  ------------------
  |  |  272|      2|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2784|      2|    return size;
 2785|      2|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8equal_toIS8_EEbRKT_PNS1_13map_slot_typeIS8_iEE:
 3502|   281M|                                             slot_type* slot) const {
 3503|   281M|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|   281M|                               PolicyTraits::element(slot));
 3505|   281M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE6eq_refEv:
 3892|   281M|  const key_equal& eq_ref() const { return settings_.template get<2>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE3endEv:
 2762|   258M|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2763|   258M|    AssertNotDebugCapacity();
 2764|   258M|    return iterator(common().generation_ptr());
 2765|   258M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPKh:
 2443|   258M|        : HashSetIteratorGenerationInfo(generation_ptr), slot_(nullptr) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorC2EPNS1_6ctrl_tEPNS1_13map_slot_typeIS8_iEEPKh:
 2434|   233M|        : HashSetIteratorGenerationInfo(generation_ptr),
 2435|   233M|          ctrl_(ctrl),
 2436|   233M|          slot_(slot) {
 2437|       |      // This assumption helps the compiler know that any non-end iterator is
 2438|       |      // not equal to any end iterator.
 2439|   233M|      ABSL_ASSUME(slot != nullptr);
  ------------------
  |  |  272|   233M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2440|   233M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19prefetch_heap_blockEv:
 3830|   245M|  void prefetch_heap_block() const {
 3831|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   245M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3832|   245M|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3833|   245M|    __builtin_prefetch(control(), 0, 1);
 3834|   245M|#endif
 3835|   245M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7controlEv:
 3845|   491M|  ctrl_t* control() const {
 3846|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   491M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3847|   491M|    return common().control();
 3848|   491M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10find_largeIS8_EENSA_8iteratorERKT_:
 3393|   245M|  iterator find_large(const key_arg<K>& key) {
 3394|   245M|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  257|   245M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3395|   245M|    const size_t cap = common().capacity();
 3396|   245M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   245M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3397|   245M|    const size_t hash = hash_of(key);
 3398|   245M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3399|   245M|    const h2_t h2 = H2(hash);
 3400|   245M|    ctrl_t* ctrl = control();
 3401|   245M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3402|   245M|    while (true) {
  ------------------
  |  Branch (3402:12): [True: 245M, Folded]
  ------------------
 3403|   245M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3404|   245M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3405|   245M|#endif
 3406|   245M|      Group g{ctrl + seq.offset()};
 3407|   281M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3407:23): [True: 281M, False: 12.3M]
  ------------------
 3408|   281M|        const size_t offset = seq.offset(i);
 3409|   281M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array + offset)))
  ------------------
  |  |  191|   281M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 233M, False: 48.0M]
  |  |  |  Branch (191:48): [Folded, False: 281M]
  |  |  |  Branch (191:57): [True: 233M, False: 48.0M]
  |  |  ------------------
  ------------------
 3410|   233M|          return iterator_at_ptr(ctrl + offset, slot_array + offset);
 3411|   281M|      }
 3412|  12.3M|      if (ABSL_PREDICT_TRUE(g.MaskEmpty())) return end();
  ------------------
  |  |  191|  12.3M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 12.3M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 12.3M]
  |  |  |  Branch (191:57): [True: 12.3M, False: 0]
  |  |  ------------------
  ------------------
 3413|      0|      seq.next();
 3414|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= cap && "full table!");
  ------------------
  |  |  257|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3415|      0|    }
 3416|   245M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7hash_ofIS8_EEmRKT_:
 3507|   245M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|   245M|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|   245M|                                               common().seed().seed()}(key);
 3510|   245M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8hash_refEv:
 3890|   245M|  const hasher& hash_ref() const { return settings_.template get<1>(); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE15iterator_at_ptrEPNS1_6ctrl_tEPv:
 3816|   233M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3817|   233M|    return {ctrl, to_slot(slot), common().generation_ptr()};
 3818|   233M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorC2ENSA_8iteratorE:
 2494|   491M|    const_iterator(iterator i) : inner_(std::move(i)) {}  // NOLINT
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE3endEv:
 2770|   245M|  const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2771|   245M|    return const_cast<raw_hash_set*>(this)->end();
 2772|   245M|  }
_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorESD_:
 2508|   245M|    friend bool operator!=(const const_iterator& a, const const_iterator& b) {
 2509|   245M|      return !(a == b);
 2510|   245M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorESD_:
 2505|   245M|    friend bool operator==(const const_iterator& a, const const_iterator& b) {
 2506|   245M|      return a.inner_ == b.inner_;
 2507|   245M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorESD_:
 2418|   245M|    friend bool operator==(const iterator& a, const iterator& b) {
 2419|   245M|      AssertIsValidForComparison(a.ctrl_, a.slot_, a.generation(),
 2420|   245M|                                 a.generation_ptr());
 2421|   245M|      AssertIsValidForComparison(b.ctrl_, b.slot_, b.generation(),
 2422|   245M|                                 b.generation_ptr());
 2423|   245M|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2424|   245M|                          a.generation_ptr(), b.generation_ptr());
 2425|   245M|      return a.unchecked_equals(b);
 2426|   245M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator16unchecked_equalsERKSB_:
 2462|   245M|    bool unchecked_equals(const iterator& b) const { return slot_ == b.slot(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator4slotEv:
 2469|   245M|    slot_type* slot() const { return slot_; }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE14const_iteratorptEv:
 2497|   233M|    pointer operator->() const { return inner_.operator->(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorptEv:
 2397|   233M|    pointer operator->() const {
 2398|   233M|      assert_is_full("operator->");
 2399|   233M|      return &operator*();
 2400|   233M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator14assert_is_fullEPKc:
 2445|   466M|    void assert_is_full(const char* operation) const {
 2446|   466M|      AssertIsFull(ctrl_, slot_, generation(), generation_ptr(), operation);
 2447|   466M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratordeEv:
 2391|   233M|    reference operator*() const {
 2392|   233M|      assert_is_full("operator*()");
 2393|   233M|      return unchecked_deref();
 2394|   233M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator15unchecked_derefEv:
 2466|   233M|    reference unchecked_deref() const { return PolicyTraits::element(slot_); }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE5clearEv:
 2799|      6|  ABSL_ATTRIBUTE_REINITIALIZES void clear() {
 2800|      6|    Clear<SooEnabled()>(common(), GetPolicyFunctions(), get_destroy_slot_fn(),
 2801|      6|                        &char_alloc_ref());
 2802|      6|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE18GetPolicyFunctionsEv:
 3988|    606|  static const PolicyFunctions& GetPolicyFunctions() {
 3989|    606|    static_assert(sizeof(slot_type) <= (std::numeric_limits<uint32_t>::max)(),
 3990|    606|                  "Slot size is too large. Use std::unique_ptr for value type "
 3991|    606|                  "or use absl::node_hash_{map,set}.");
 3992|    606|    static_assert(alignof(slot_type) <=
 3993|    606|                  size_t{(std::numeric_limits<uint16_t>::max)()});
 3994|    606|    static_assert(sizeof(key_type) <=
 3995|    606|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3996|    606|    static_assert(sizeof(value_type) <=
 3997|    606|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3998|    606|    static constexpr size_t kBackingArrayAlignment =
 3999|    606|        BackingArrayAlignment(alignof(slot_type));
 4000|    606|    static constexpr PolicyFunctions value = {
 4001|    606|        static_cast<uint32_t>(sizeof(key_type)),
 4002|    606|        static_cast<uint32_t>(sizeof(value_type)),
 4003|    606|        static_cast<uint32_t>(sizeof(slot_type)),
 4004|    606|        static_cast<uint16_t>(alignof(slot_type)), SooEnabled(),
 4005|    606|        ShouldSampleHashtablezInfoForAlloc<CharAlloc>(),
 4006|       |        // TODO(b/328722020): try to type erase
 4007|       |        // for standard layout and alignof(Hash) <= alignof(CommonFields).
 4008|    606|        std::is_empty_v<hasher> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4008:9): [True: 0, Folded]
  ------------------
 4009|    606|                                : &raw_hash_set::get_hash_ref_fn,
 4010|    606|        PolicyTraits::template get_hash_slot_fn<hasher, kIsDefaultHash>(),
 4011|    606|        PolicyTraits::transfer_uses_memcpy()
  ------------------
  |  Branch (4011:9): [True: 0, Folded]
  ------------------
 4012|    606|            ? TransferNRelocatable<sizeof(slot_type)>
 4013|    606|            : &raw_hash_set::transfer_n_slots_fn,
 4014|    606|        std::is_empty_v<Alloc> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4014:9): [True: 0, Folded]
  ------------------
 4015|    606|                               : &raw_hash_set::get_char_alloc_ref_fn,
 4016|    606|        &AllocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 4017|    606|        get_dealloc_backing_array_fn(),
 4018|    606|        &raw_hash_set::transfer_unprobed_elements_to_next_capacity_fn};
 4019|    606|    return value;
 4020|    606|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10slot_arrayEm:
 3849|      2|  slot_type* slot_array(size_t capacity) const {
 3850|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3851|      2|    return static_cast<slot_type*>(common().slot_array(capacity));
 3852|      2|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7reserveEm:
 3178|      4|  void reserve(size_t n) {
 3179|      4|    if (ABSL_PREDICT_TRUE(n > DefaultCapacity())) {
  ------------------
  |  |  191|      4|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 4, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 4]
  |  |  |  Branch (191:57): [True: 4, False: 0]
  |  |  ------------------
  ------------------
 3180|      4|      ReserveTableToFitNewSize(common(), GetPolicyFunctions(), n);
 3181|      4|    }
 3182|      4|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7emplaceIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEERiETnNS4_9enable_ifIXsr14IsDecomposableIDpT_EE5valueEiE4typeELi0EEENS4_4pairINSA_8iteratorEbEEDpOSK_:
 2960|    596|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2961|    596|    return PolicyTraits::apply(EmplaceDecomposable{*this},
 2962|    596|                               std::forward<Args>(args)...);
 2963|    596|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE19EmplaceDecomposableclINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEJRKNS4_21piecewise_construct_tENS4_5tupleIJRKSG_EEENSK_IJRiEEEEEENS4_4pairINSA_8iteratorEbEERKT_DpOT0_:
 3337|    596|    std::pair<iterator, bool> operator()(const K& key, Args&&... args) const {
 3338|    596|      auto res = s.find_or_prepare_insert(key);
 3339|    596|      if (res.second) {
  ------------------
  |  Branch (3339:11): [True: 596, False: 0]
  ------------------
 3340|    596|        s.emplace_at(res.first, std::forward<Args>(args)...);
 3341|    596|      }
 3342|    596|      return {s.non_iterable_iterator_at_slot(res.first), res.second};
 3343|    596|    }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22find_or_prepare_insertINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairIPNS1_13map_slot_typeIS8_iEEbEERKT_:
 3777|    596|  std::pair<slot_type*, bool> find_or_prepare_insert(const K& key) {
 3778|    596|    AssertOnFind(key);
 3779|    596|    return is_small() ? find_or_prepare_insert_small(key)
  ------------------
  |  Branch (3779:12): [True: 0, False: 596]
  ------------------
 3780|    596|                      : find_or_prepare_insert_large(key);
 3781|    596|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE12AssertOnFindINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEvRKT_:
 3725|    596|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|    596|    AssertHashEqConsistent(key);
 3727|    596|    AssertNotDebugCapacity();
 3728|    596|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE22AssertHashEqConsistentINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEvRKT_:
 3736|    596|  void AssertHashEqConsistent(const K& key) {
 3737|    596|#ifdef NDEBUG
 3738|    596|    return;
 3739|      0|#endif
 3740|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3741|      0|    if (std::is_same_v<hasher, absl::container_internal::StringHash> &&
  ------------------
  |  Branch (3741:9): [True: 0, Folded]
  ------------------
 3742|      0|        std::is_same_v<key_equal, absl::container_internal::StringEq>) {
  ------------------
  |  Branch (3742:9): [True: 0, Folded]
  ------------------
 3743|      0|      return;
 3744|      0|    }
 3745|      0|    if (std::is_scalar_v<key_type> &&
  ------------------
  |  Branch (3745:9): [Folded, False: 0]
  ------------------
 3746|      0|        std::is_same_v<hasher, absl::Hash<key_type>> &&
  ------------------
  |  Branch (3746:9): [Folded, False: 0]
  ------------------
 3747|      0|        std::is_same_v<key_equal, std::equal_to<key_type>>) {
  ------------------
  |  Branch (3747:9): [Folded, False: 0]
  ------------------
 3748|      0|      return;
 3749|      0|    }
 3750|      0|    if (empty()) return;
  ------------------
  |  Branch (3750:9): [True: 0, False: 0]
  ------------------
 3751|       |
 3752|      0|    const size_t hash_of_arg = hash_of(key);
 3753|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3754|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3755|      0|      if (!is_key_equal) return;
 3756|       |
 3757|      0|      [[maybe_unused]] const bool is_hash_equal =
 3758|      0|          hash_of_arg == hash_of(to_slot(slot));
 3759|      0|      assert((!is_key_equal || is_hash_equal) &&
 3760|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3761|      0|             "hash/eq functors are inconsistent.");
 3762|      0|    };
 3763|       |
 3764|      0|    if (is_small()) {
  ------------------
  |  Branch (3764:9): [True: 0, False: 0]
  ------------------
 3765|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3766|      0|      return;
 3767|      0|    }
 3768|       |    // We only do validation for small tables so that it's constant time.
 3769|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3769:9): [True: 0, False: 0]
  ------------------
 3770|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3771|      0|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8equal_toINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEbRKT_PNS1_13map_slot_typeIS8_iEE:
 3502|     18|                                             slot_type* slot) const {
 3503|     18|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|     18|                               PolicyTraits::element(slot));
 3505|     18|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE28find_or_prepare_insert_largeINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEENS4_4pairIPNS1_13map_slot_typeIS8_iEEbEERKT_:
 3677|    596|  std::pair<slot_type*, bool> find_or_prepare_insert_large(const K& key) {
 3678|    596|    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|    596|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3679|    596|    prefetch_heap_block();
 3680|    596|    const size_t cap = capacity();
 3681|    596|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|    596|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3682|    596|    const size_t hash = hash_of(key);
 3683|    596|    auto seq = probe(ProbeCapacity{cap}, hash);
 3684|    596|    const h2_t h2 = H2(hash);
 3685|    596|    const ctrl_t* ctrl = control();
 3686|    596|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3687|    596|    while (true) {
  ------------------
  |  Branch (3687:12): [True: 596, Folded]
  ------------------
 3688|    596|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3689|    596|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3690|    596|#endif
 3691|    596|      Group g{ctrl + seq.offset()};
 3692|    596|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3692:23): [True: 18, False: 596]
  ------------------
 3693|     18|        slot_type* slot = slot_array + seq.offset(i);
 3694|     18|        if (ABSL_PREDICT_TRUE(equal_to(key, slot))) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 3695|      0|          return {slot, false};
 3696|      0|        }
 3697|     18|      }
 3698|    596|      auto mask_empty = g.MaskEmpty();
 3699|    596|      if (ABSL_PREDICT_TRUE(mask_empty)) {
  ------------------
  |  |  191|    596|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 596, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 596]
  |  |  |  Branch (191:57): [True: 596, False: 0]
  |  |  ------------------
  ------------------
 3700|    596|        size_t target_group_offset = seq.offset();
 3701|    596|        void* slot =
 3702|    596|            SwisstableGenerationsEnabled()
  ------------------
  |  Branch (3702:13): [Folded, False: 596]
  ------------------
 3703|    596|                ? PrepareInsertLargeGenerationsEnabled(
 3704|      0|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3705|      0|                      FindInfo{target_group_offset, seq.index()},
 3706|      0|                      HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3707|    596|                : PrepareInsertLarge(
 3708|    596|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3709|    596|                      FindInfo{target_group_offset, seq.index()});
 3710|    596|        return {to_slot(slot), true};
 3711|    596|      }
 3712|      0|      seq.next();
 3713|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  257|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3714|      0|    }
 3715|    596|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE7hash_ofINS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEmRKT_:
 3507|    596|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|    596|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|    596|                                               common().seed().seed()}(key);
 3510|    596|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE10emplace_atIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJRiEEEEEEvPNS1_13map_slot_typeIS8_iEEDpOT_:
 3792|    596|  void emplace_at(slot_type* slot, Args&&... args) {
 3793|    596|    construct(slot, std::forward<Args>(args)...);
 3794|       |
 3795|       |    // When is_small, find calls find_small and if size is 0, then it will
 3796|       |    // return an end iterator. This can happen in the raw_hash_set copy ctor.
 3797|       |    assert((is_small() ||
 3798|    596|            PolicyTraits::apply(FindElement{*this}, PolicyTraits::element(slot))
 3799|    596|                    .slot() == slot) &&
 3800|    596|           "constructed value does not match the lookup key");
 3801|    596|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJRiEEEEEEvPNS1_13map_slot_typeIS8_iEEDpOT_:
 3365|    596|  void construct(slot_type* slot, Args&&... args) {
 3366|    596|    common().RunWithReentrancyGuard([&] {
 3367|    596|      allocator_type alloc(char_alloc_ref());
 3368|    596|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|    596|    });
 3370|    596|  }
_ZN4absl12lts_2026081718container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEiEEJEE9constructIJRKNS6_21piecewise_construct_tENS6_5tupleIJRKNS6_12basic_stringIcS9_NS6_9allocatorIcEEEEEEENSH_IJRiEEEEEEvPNS1_13map_slot_typeISA_iEEDpOT_EUlvE_EEvT_:
 1486|    596|  void RunWithReentrancyGuard(F f) {
 1487|    596|#ifdef NDEBUG
 1488|    596|    f();
 1489|    596|    return;
 1490|      0|#endif
 1491|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1492|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1493|      0|    f();
 1494|      0|    set_capacity(cap);
 1495|      0|  }
_ZZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE9constructIJRKNS4_21piecewise_construct_tENS4_5tupleIJRKNS4_12basic_stringIcS7_NS4_9allocatorIcEEEEEEENSF_IJRiEEEEEEvPNS1_13map_slot_typeIS8_iEEDpOT_ENKUlvE_clEv:
 3366|    596|    common().RunWithReentrancyGuard([&] {
 3367|    596|      allocator_type alloc(char_alloc_ref());
 3368|    596|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|    596|    });
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE29non_iterable_iterator_at_slotEPNS1_13map_slot_typeIS8_iEE:
 3806|    596|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3807|    596|    return {InsertIteratorControl(), slot, common().generation_ptr()};
 3808|    596|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4findIS8_EENSA_14const_iteratorERKT_:
 3240|  97.4M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3241|  97.4M|    return const_cast<raw_hash_set*>(this)->find(key);
 3242|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE4findIS8_EENSA_8iteratorERKT_:
 3225|  97.4M|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3226|  97.4M|    AssertOnFind(key);
 3227|  97.4M|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3227:9): [True: 0, False: 97.4M]
  ------------------
 3228|  97.4M|    prefetch_heap_block();
 3229|  97.4M|    return find_large(key);
 3230|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE12AssertOnFindIS8_EEvRKT_:
 3725|  97.4M|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|  97.4M|    AssertHashEqConsistent(key);
 3727|  97.4M|    AssertNotDebugCapacity();
 3728|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE22AssertHashEqConsistentIS8_EEvRKT_:
 3736|  97.4M|  void AssertHashEqConsistent(const K& key) {
 3737|  97.4M|#ifdef NDEBUG
 3738|  97.4M|    return;
 3739|      0|#endif
 3740|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3741|      0|    if (std::is_same_v<hasher, absl::container_internal::StringHash> &&
  ------------------
  |  Branch (3741:9): [True: 0, Folded]
  ------------------
 3742|      0|        std::is_same_v<key_equal, absl::container_internal::StringEq>) {
  ------------------
  |  Branch (3742:9): [True: 0, Folded]
  ------------------
 3743|      0|      return;
 3744|      0|    }
 3745|      0|    if (std::is_scalar_v<key_type> &&
  ------------------
  |  Branch (3745:9): [Folded, False: 0]
  ------------------
 3746|      0|        std::is_same_v<hasher, absl::Hash<key_type>> &&
  ------------------
  |  Branch (3746:9): [Folded, False: 0]
  ------------------
 3747|      0|        std::is_same_v<key_equal, std::equal_to<key_type>>) {
  ------------------
  |  Branch (3747:9): [Folded, False: 0]
  ------------------
 3748|      0|      return;
 3749|      0|    }
 3750|      0|    if (empty()) return;
  ------------------
  |  Branch (3750:9): [True: 0, False: 0]
  ------------------
 3751|       |
 3752|      0|    const size_t hash_of_arg = hash_of(key);
 3753|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3754|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3755|      0|      if (!is_key_equal) return;
 3756|       |
 3757|      0|      [[maybe_unused]] const bool is_hash_equal =
 3758|      0|          hash_of_arg == hash_of(to_slot(slot));
 3759|      0|      assert((!is_key_equal || is_hash_equal) &&
 3760|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3761|      0|             "hash/eq functors are inconsistent.");
 3762|      0|    };
 3763|       |
 3764|      0|    if (is_small()) {
  ------------------
  |  Branch (3764:9): [True: 0, False: 0]
  ------------------
 3765|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3766|      0|      return;
 3767|      0|    }
 3768|       |    // We only do validation for small tables so that it's constant time.
 3769|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3769:9): [True: 0, False: 0]
  ------------------
 3770|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3771|      0|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8equal_toIS8_EEbRKT_PNS1_13map_slot_typeIS8_hEE:
 3502|  97.4M|                                             slot_type* slot) const {
 3503|  97.4M|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|  97.4M|                               PolicyTraits::element(slot));
 3505|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE3endEv:
 2762|  97.4M|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2763|  97.4M|    AssertNotDebugCapacity();
 2764|  97.4M|    return iterator(common().generation_ptr());
 2765|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorC2EPKh:
 2443|  97.4M|        : HashSetIteratorGenerationInfo(generation_ptr), slot_(nullptr) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE10find_largeIS8_EENSA_8iteratorERKT_:
 3393|  97.4M|  iterator find_large(const key_arg<K>& key) {
 3394|  97.4M|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  257|  97.4M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3395|  97.4M|    const size_t cap = common().capacity();
 3396|  97.4M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|  97.4M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3397|  97.4M|    const size_t hash = hash_of(key);
 3398|  97.4M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3399|  97.4M|    const h2_t h2 = H2(hash);
 3400|  97.4M|    ctrl_t* ctrl = control();
 3401|  97.4M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3402|  97.4M|    while (true) {
  ------------------
  |  Branch (3402:12): [True: 97.4M, Folded]
  ------------------
 3403|  97.4M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3404|  97.4M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3405|  97.4M|#endif
 3406|  97.4M|      Group g{ctrl + seq.offset()};
 3407|  97.4M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3407:23): [True: 97.4M, False: 0]
  ------------------
 3408|  97.4M|        const size_t offset = seq.offset(i);
 3409|  97.4M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array + offset)))
  ------------------
  |  |  191|  97.4M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 97.4M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 97.4M]
  |  |  |  Branch (191:57): [True: 97.4M, False: 0]
  |  |  ------------------
  ------------------
 3410|  97.4M|          return iterator_at_ptr(ctrl + offset, slot_array + offset);
 3411|  97.4M|      }
 3412|      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]
  |  |  ------------------
  ------------------
 3413|      0|      seq.next();
 3414|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= cap && "full table!");
  ------------------
  |  |  257|      0|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3415|      0|    }
 3416|  97.4M|  }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE7hash_ofIS8_EEmRKT_:
 3507|  97.4M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|  97.4M|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|  97.4M|                                               common().seed().seed()}(key);
 3510|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE15iterator_at_ptrEPNS1_6ctrl_tEPv:
 3816|  97.4M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3817|  97.4M|    return {ctrl, to_slot(slot), common().generation_ptr()};
 3818|  97.4M|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorC2ENSA_8iteratorE:
 2494|   194M|    const_iterator(iterator i) : inner_(std::move(i)) {}  // NOLINT
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE3endEv:
 2770|  97.4M|  const_iterator end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2771|  97.4M|    return const_cast<raw_hash_set*>(this)->end();
 2772|  97.4M|  }
_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorESD_:
 2508|  97.4M|    friend bool operator!=(const const_iterator& a, const const_iterator& b) {
 2509|  97.4M|      return !(a == b);
 2510|  97.4M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorESD_:
 2505|  97.4M|    friend bool operator==(const const_iterator& a, const const_iterator& b) {
 2506|  97.4M|      return a.inner_ == b.inner_;
 2507|  97.4M|    }
_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorESD_:
 2418|  97.4M|    friend bool operator==(const iterator& a, const iterator& b) {
 2419|  97.4M|      AssertIsValidForComparison(a.ctrl_, a.slot_, a.generation(),
 2420|  97.4M|                                 a.generation_ptr());
 2421|  97.4M|      AssertIsValidForComparison(b.ctrl_, b.slot_, b.generation(),
 2422|  97.4M|                                 b.generation_ptr());
 2423|  97.4M|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2424|  97.4M|                          a.generation_ptr(), b.generation_ptr());
 2425|  97.4M|      return a.unchecked_equals(b);
 2426|  97.4M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator16unchecked_equalsERKSB_:
 2462|  97.4M|    bool unchecked_equals(const iterator& b) const { return slot_ == b.slot(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator4slotEv:
 2469|  97.4M|    slot_type* slot() const { return slot_; }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE14const_iteratorptEv:
 2497|  97.4M|    pointer operator->() const { return inner_.operator->(); }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratorptEv:
 2397|  97.4M|    pointer operator->() const {
 2398|  97.4M|      assert_is_full("operator->");
 2399|  97.4M|      return &operator*();
 2400|  97.4M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iterator14assert_is_fullEPKc:
 2445|   194M|    void assert_is_full(const char* operation) const {
 2446|   194M|      AssertIsFull(ctrl_, slot_, generation(), generation_ptr(), operation);
 2447|   194M|    }
_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEhEEJEE8iteratordeEv:
 2391|  97.4M|    reference operator*() const {
 2392|  97.4M|      assert_is_full("operator*()");
 2393|  97.4M|      return unchecked_deref();
 2394|  97.4M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE4findIS9_EENSC_8iteratorERKT_:
 3225|   204M|  iterator find(const key_arg<K>& key) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3226|   204M|    AssertOnFind(key);
 3227|   204M|    if (is_small()) return find_small(key);
  ------------------
  |  Branch (3227:9): [True: 11.1k, False: 204M]
  ------------------
 3228|   204M|    prefetch_heap_block();
 3229|   204M|    return find_large(key);
 3230|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE12AssertOnFindIS9_EEvRKT_:
 3725|   408M|  void AssertOnFind([[maybe_unused]] const K& key) {
 3726|   408M|    AssertHashEqConsistent(key);
 3727|   408M|    AssertNotDebugCapacity();
 3728|   408M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE22AssertHashEqConsistentIS9_EEvRKT_:
 3736|   408M|  void AssertHashEqConsistent(const K& key) {
 3737|   408M|#ifdef NDEBUG
 3738|   408M|    return;
 3739|      0|#endif
 3740|       |    // If the hash/eq functors are known to be consistent, then skip validation.
 3741|      0|    if (std::is_same_v<hasher, absl::container_internal::StringHash> &&
  ------------------
  |  Branch (3741:9): [Folded, False: 0]
  ------------------
 3742|      0|        std::is_same_v<key_equal, absl::container_internal::StringEq>) {
  ------------------
  |  Branch (3742:9): [Folded, False: 0]
  ------------------
 3743|      0|      return;
 3744|      0|    }
 3745|      0|    if (std::is_scalar_v<key_type> &&
  ------------------
  |  Branch (3745:9): [True: 0, Folded]
  ------------------
 3746|      0|        std::is_same_v<hasher, absl::Hash<key_type>> &&
  ------------------
  |  Branch (3746:9): [Folded, False: 0]
  ------------------
 3747|      0|        std::is_same_v<key_equal, std::equal_to<key_type>>) {
  ------------------
  |  Branch (3747:9): [Folded, False: 0]
  ------------------
 3748|      0|      return;
 3749|      0|    }
 3750|      0|    if (empty()) return;
  ------------------
  |  Branch (3750:9): [True: 0, False: 0]
  ------------------
 3751|       |
 3752|      0|    const size_t hash_of_arg = hash_of(key);
 3753|      0|    const auto assert_consistent = [&](const ctrl_t*, void* slot) {
 3754|      0|      const bool is_key_equal = equal_to(key, to_slot(slot));
 3755|      0|      if (!is_key_equal) return;
 3756|       |
 3757|      0|      [[maybe_unused]] const bool is_hash_equal =
 3758|      0|          hash_of_arg == hash_of(to_slot(slot));
 3759|      0|      assert((!is_key_equal || is_hash_equal) &&
 3760|      0|             "eq(k1, k2) must imply that hash(k1) == hash(k2). "
 3761|      0|             "hash/eq functors are inconsistent.");
 3762|      0|    };
 3763|       |
 3764|      0|    if (is_small()) {
  ------------------
  |  Branch (3764:9): [True: 0, False: 0]
  ------------------
 3765|      0|      assert_consistent(/*unused*/ nullptr, single_slot());
 3766|      0|      return;
 3767|      0|    }
 3768|       |    // We only do validation for small tables so that it's constant time.
 3769|      0|    if (capacity() > 16) return;
  ------------------
  |  Branch (3769:9): [True: 0, False: 0]
  ------------------
 3770|      0|    IterateOverFullSlots(common(), sizeof(slot_type), assert_consistent);
 3771|      0|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE22AssertNotDebugCapacityEv:
 3731|   817M|  void AssertNotDebugCapacity() const { common().AssertNotDebugCapacity(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6commonEv:
 3838|  2.94G|  const CommonFields& common() const { return settings_.template get<0>(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8is_smallEv:
 2312|   408M|  bool is_small() const { return common().is_small(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE10find_smallIS9_EENSC_8iteratorERKT_:
 3387|  11.1k|  ABSL_ATTRIBUTE_ALWAYS_INLINE iterator find_small(const key_arg<K>& key) {
 3388|  11.1k|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3389|  11.1k|    return empty() || !equal_to(key, single_slot()) ? end() : single_iterator();
  ------------------
  |  Branch (3389:12): [True: 5.57k, False: 5.57k]
  |  Branch (3389:23): [True: 5.57k, False: 0]
  ------------------
 3390|  11.1k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE5emptyEv:
 2778|  22.2k|  bool empty() const { return !size(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE4sizeEv:
 2779|  22.2k|  size_t size() const {
 2780|  22.2k|    AssertNotDebugCapacity();
 2781|  22.2k|    const size_t size = common().size();
 2782|  22.2k|    [[maybe_unused]] const size_t kMaxValidSize = MaxValidSize();
 2783|  22.2k|    ABSL_ASSUME(size <= kMaxValidSize);
  ------------------
  |  |  272|  22.2k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2784|  22.2k|    return size;
 2785|  22.2k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8equal_toIS9_EEbRKT_PNS1_13map_slot_typeIS9_SA_EE:
 3502|  36.6M|                                             slot_type* slot) const {
 3503|  36.6M|    return PolicyTraits::apply(EqualElement<K, key_equal>{key, eq_ref()},
 3504|  36.6M|                               PolicyTraits::element(slot));
 3505|  36.6M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6eq_refEv:
 3892|  36.6M|  const key_equal& eq_ref() const { return settings_.template get<2>(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE11single_slotEv:
 3862|  11.1k|  slot_type* single_slot() {
 3863|  11.1k|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3864|  11.1k|    return SooEnabled()
  ------------------
  |  Branch (3864:12): [Folded, False: 11.1k]
  ------------------
 3865|  11.1k|               ? soo_slot()
 3866|  11.1k|               : to_slot(common().slot_array(/*capacity=*/1));
 3867|  11.1k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7to_slotEPv:
 3519|   613M|  static ABSL_ATTRIBUTE_ALWAYS_INLINE slot_type* to_slot(void* buf) {
 3520|   613M|    return static_cast<slot_type*>(buf);
 3521|   613M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6commonEv:
 3837|  1.92G|  CommonFields& common() { return settings_.template get<0>(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorC2EPNS1_6ctrl_tEPNS1_13map_slot_typeIS9_SA_EEPKh:
 2434|   204M|        : HashSetIteratorGenerationInfo(generation_ptr),
 2435|   204M|          ctrl_(ctrl),
 2436|   204M|          slot_(slot) {
 2437|       |      // This assumption helps the compiler know that any non-end iterator is
 2438|       |      // not equal to any end iterator.
 2439|   204M|      ABSL_ASSUME(slot != nullptr);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2440|   204M|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE19prefetch_heap_blockEv:
 3830|   408M|  void prefetch_heap_block() const {
 3831|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   408M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3832|   408M|#if ABSL_HAVE_BUILTIN(__builtin_prefetch) || defined(__GNUC__)
 3833|   408M|    __builtin_prefetch(control(), 0, 1);
 3834|   408M|#endif
 3835|   408M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7controlEv:
 3845|   817M|  ctrl_t* control() const {
 3846|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   817M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3847|   817M|    return common().control();
 3848|   817M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE10find_largeIS9_EENSC_8iteratorERKT_:
 3393|   204M|  iterator find_large(const key_arg<K>& key) {
 3394|   204M|    ABSL_SWISSTABLE_ASSERT(!is_small());
  ------------------
  |  |  257|   204M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3395|   204M|    const size_t cap = common().capacity();
 3396|   204M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3397|   204M|    const size_t hash = hash_of(key);
 3398|   204M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3399|   204M|    const h2_t h2 = H2(hash);
 3400|   204M|    ctrl_t* ctrl = control();
 3401|   204M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3402|   228M|    while (true) {
  ------------------
  |  Branch (3402:12): [True: 228M, Folded]
  ------------------
 3403|   228M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3404|   228M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3405|   228M|#endif
 3406|   228M|      Group g{ctrl + seq.offset()};
 3407|   228M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3407:23): [True: 18.4M, False: 228M]
  ------------------
 3408|  18.4M|        const size_t offset = seq.offset(i);
 3409|  18.4M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot_array + offset)))
  ------------------
  |  |  191|  18.4M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 151k, False: 18.2M]
  |  |  |  Branch (191:48): [Folded, False: 18.4M]
  |  |  |  Branch (191:57): [True: 151k, False: 18.2M]
  |  |  ------------------
  ------------------
 3410|   151k|          return iterator_at_ptr(ctrl + offset, slot_array + offset);
 3411|  18.4M|      }
 3412|   228M|      if (ABSL_PREDICT_TRUE(g.MaskEmpty())) return end();
  ------------------
  |  |  191|   228M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 204M, False: 24.0M]
  |  |  |  Branch (191:48): [Folded, False: 228M]
  |  |  |  Branch (191:57): [True: 204M, False: 24.0M]
  |  |  ------------------
  ------------------
 3413|  24.0M|      seq.next();
 3414|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= cap && "full table!");
  ------------------
  |  |  257|  24.0M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3415|  24.0M|    }
 3416|   204M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7hash_ofIS9_EEmRKT_:
 3507|   408M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(const K& key) const {
 3508|   408M|    return HashElement<hasher, kIsDefaultHash>{hash_ref(),
 3509|   408M|                                               common().seed().seed()}(key);
 3510|   408M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8hash_refEv:
 3890|   699M|  const hasher& hash_ref() const { return settings_.template get<1>(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE15iterator_at_ptrEPNS1_6ctrl_tEPv:
 3816|   151k|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3817|   151k|    return {ctrl, to_slot(slot), common().generation_ptr()};
 3818|   151k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorESF_:
 2427|   204M|    friend bool operator!=(const iterator& a, const iterator& b) {
 2428|   204M|      return !(a == b);
 2429|   204M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internaleqERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorESF_:
 2418|   204M|    friend bool operator==(const iterator& a, const iterator& b) {
 2419|   204M|      AssertIsValidForComparison(a.ctrl_, a.slot_, a.generation(),
 2420|   204M|                                 a.generation_ptr());
 2421|   204M|      AssertIsValidForComparison(b.ctrl_, b.slot_, b.generation(),
 2422|   204M|                                 b.generation_ptr());
 2423|   204M|      AssertSameContainer(a.ctrl_, b.ctrl_, a.slot_, b.slot_,
 2424|   204M|                          a.generation_ptr(), b.generation_ptr());
 2425|   204M|      return a.unchecked_equals(b);
 2426|   204M|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator16unchecked_equalsERKSD_:
 2462|   204M|    bool unchecked_equals(const iterator& b) const { return slot_ == b.slot(); }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator4slotEv:
 2469|   204M|    slot_type* slot() const { return slot_; }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE3endEv:
 2762|   408M|  iterator end() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2763|   408M|    AssertNotDebugCapacity();
 2764|   408M|    return iterator(common().generation_ptr());
 2765|   408M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorC2EPKh:
 2443|   408M|        : HashSetIteratorGenerationInfo(generation_ptr), slot_(nullptr) {}
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratorptEv:
 2397|   151k|    pointer operator->() const {
 2398|   151k|      assert_is_full("operator->");
 2399|   151k|      return &operator*();
 2400|   151k|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator14assert_is_fullEPKc:
 2445|   303k|    void assert_is_full(const char* operation) const {
 2446|   303k|      AssertIsFull(ctrl_, slot_, generation(), generation_ptr(), operation);
 2447|   303k|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iteratordeEv:
 2391|   151k|    reference operator*() const {
 2392|   151k|      assert_is_full("operator*()");
 2393|   151k|      return unchecked_deref();
 2394|   151k|    }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8iterator15unchecked_derefEv:
 2466|   151k|    reference unchecked_deref() const { return PolicyTraits::element(slot_); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE6insertEONSt3__14pairIS9_SA_EEQntsr29IsLifetimeBoundAssignmentFromINS1_18hash_policy_traitsIT_vE9init_typeEEE5value:
 2868|   204M|  {
 2869|   204M|    return emplace(std::move(value));
 2870|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7emplaceIJNSt3__14pairIS9_SA_EEETnNSE_9enable_ifIXsr14IsDecomposableIDpT_EE5valueEiE4typeELi0EEENSF_INSC_8iteratorEbEEDpOSI_:
 2960|   204M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2961|   204M|    return PolicyTraits::apply(EmplaceDecomposable{*this},
 2962|   204M|                               std::forward<Args>(args)...);
 2963|   204M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE19EmplaceDecomposableclIS9_JRKNSt3__121piecewise_construct_tENSF_5tupleIJOS9_EEENSJ_IJOSA_EEEEEENSF_4pairINSC_8iteratorEbEERKT_DpOT0_:
 3337|   204M|    std::pair<iterator, bool> operator()(const K& key, Args&&... args) const {
 3338|   204M|      auto res = s.find_or_prepare_insert(key);
 3339|   204M|      if (res.second) {
  ------------------
  |  Branch (3339:11): [True: 204M, False: 0]
  ------------------
 3340|   204M|        s.emplace_at(res.first, std::forward<Args>(args)...);
 3341|   204M|      }
 3342|   204M|      return {s.non_iterable_iterator_at_slot(res.first), res.second};
 3343|   204M|    }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE22find_or_prepare_insertIS9_EENSt3__14pairIPNS1_13map_slot_typeIS9_SA_EEbEERKT_:
 3777|   204M|  std::pair<slot_type*, bool> find_or_prepare_insert(const K& key) {
 3778|   204M|    AssertOnFind(key);
 3779|   204M|    return is_small() ? find_or_prepare_insert_small(key)
  ------------------
  |  Branch (3779:12): [True: 11.1k, False: 204M]
  ------------------
 3780|   204M|                      : find_or_prepare_insert_large(key);
 3781|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE28find_or_prepare_insert_smallIS9_EENSt3__14pairIPNS1_13map_slot_typeIS9_SA_EEbEERKT_:
 3660|  11.1k|  find_or_prepare_insert_small(const K& key) {
 3661|  11.1k|    ABSL_SWISSTABLE_ASSERT(is_small());
  ------------------
  |  |  257|  11.1k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3662|       |    if constexpr (SooEnabled()) {
 3663|       |      return find_or_prepare_insert_soo(key);
 3664|       |    }
 3665|  11.1k|    if (!empty()) {
  ------------------
  |  Branch (3665:9): [True: 5.57k, False: 5.57k]
  ------------------
 3666|  5.57k|      if (equal_to(key, single_slot())) {
  ------------------
  |  Branch (3666:11): [True: 0, False: 5.57k]
  ------------------
 3667|      0|        return {single_slot(), false};
 3668|      0|      }
 3669|  5.57k|    }
 3670|  11.1k|    return {to_slot(PrepareInsertSmallNonSoo(
 3671|  11.1k|                common(), GetPolicyFunctions(),
 3672|  11.1k|                HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})),
 3673|  11.1k|            true};
 3674|  11.1k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE18GetPolicyFunctionsEv:
 3988|   204M|  static const PolicyFunctions& GetPolicyFunctions() {
 3989|   204M|    static_assert(sizeof(slot_type) <= (std::numeric_limits<uint32_t>::max)(),
 3990|   204M|                  "Slot size is too large. Use std::unique_ptr for value type "
 3991|   204M|                  "or use absl::node_hash_{map,set}.");
 3992|   204M|    static_assert(alignof(slot_type) <=
 3993|   204M|                  size_t{(std::numeric_limits<uint16_t>::max)()});
 3994|   204M|    static_assert(sizeof(key_type) <=
 3995|   204M|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3996|   204M|    static_assert(sizeof(value_type) <=
 3997|   204M|                  size_t{(std::numeric_limits<uint32_t>::max)()});
 3998|   204M|    static constexpr size_t kBackingArrayAlignment =
 3999|   204M|        BackingArrayAlignment(alignof(slot_type));
 4000|   204M|    static constexpr PolicyFunctions value = {
 4001|   204M|        static_cast<uint32_t>(sizeof(key_type)),
 4002|   204M|        static_cast<uint32_t>(sizeof(value_type)),
 4003|   204M|        static_cast<uint32_t>(sizeof(slot_type)),
 4004|   204M|        static_cast<uint16_t>(alignof(slot_type)), SooEnabled(),
 4005|   204M|        ShouldSampleHashtablezInfoForAlloc<CharAlloc>(),
 4006|       |        // TODO(b/328722020): try to type erase
 4007|       |        // for standard layout and alignof(Hash) <= alignof(CommonFields).
 4008|   204M|        std::is_empty_v<hasher> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4008:9): [True: 0, Folded]
  ------------------
 4009|   204M|                                : &raw_hash_set::get_hash_ref_fn,
 4010|   204M|        PolicyTraits::template get_hash_slot_fn<hasher, kIsDefaultHash>(),
 4011|   204M|        PolicyTraits::transfer_uses_memcpy()
  ------------------
  |  Branch (4011:9): [True: 0, Folded]
  ------------------
 4012|   204M|            ? TransferNRelocatable<sizeof(slot_type)>
 4013|   204M|            : &raw_hash_set::transfer_n_slots_fn,
 4014|   204M|        std::is_empty_v<Alloc> ? &GetRefForEmptyClass
  ------------------
  |  Branch (4014:9): [True: 0, Folded]
  ------------------
 4015|   204M|                               : &raw_hash_set::get_char_alloc_ref_fn,
 4016|   204M|        &AllocateBackingArray<kBackingArrayAlignment, CharAlloc>,
 4017|   204M|        get_dealloc_backing_array_fn(),
 4018|   204M|        &raw_hash_set::transfer_unprobed_elements_to_next_capacity_fn};
 4019|   204M|    return value;
 4020|   204M|  }
_ZN4absl12lts_2026081718container_internal20TransferNRelocatableILm16EEEvPvS3_S3_m:
 2151|   114k|                                                  size_t count) {
 2152|       |  // TODO(b/382423690): Experiment with making specialization for power of 2 and
 2153|       |  // non power of 2. This would require passing the size of the slot.
 2154|   114k|  memcpy(dst, src, SizeOfSlot * count);
 2155|   114k|}
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE46transfer_unprobed_elements_to_next_capacity_fnERNS1_12CommonFieldsEPKNS1_6ctrl_tEPvSI_PFvSI_hmmE:
 3935|  59.8k|                                    size_t source_offset, size_t h1)) {
 3936|  59.8k|    const size_t new_capacity = common.capacity();
 3937|  59.8k|    ABSL_ASSUME(new_capacity > kMaxSmallCapacity);
  ------------------
  |  |  272|  59.8k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3938|  59.8k|    const size_t old_capacity = PreviousCapacity(new_capacity);
 3939|  59.8k|    ABSL_ASSUME(old_capacity + 1 >= Group::kWidth);
  ------------------
  |  |  272|  59.8k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3940|  59.8k|    ABSL_ASSUME((old_capacity + 1) % Group::kWidth == 0);
  ------------------
  |  |  272|  59.8k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3941|       |
 3942|  59.8k|    auto* set = reinterpret_cast<raw_hash_set*>(&common);
 3943|  59.8k|    slot_type* old_slots_ptr = to_slot(old_slots);
 3944|  59.8k|    ctrl_t* new_ctrl = common.control();
 3945|  59.8k|    slot_type* new_slots = set->slot_array(new_capacity);
 3946|       |
 3947|  20.8M|    for (size_t group_index = 0; group_index < old_capacity;
  ------------------
  |  Branch (3947:34): [True: 20.7M, False: 59.8k]
  ------------------
 3948|  20.7M|         group_index += Group::kWidth) {
 3949|  20.7M|      GroupFullEmptyOrDeleted old_g(old_ctrl + group_index);
 3950|  20.7M|      std::memset(new_ctrl + group_index, static_cast<int8_t>(ctrl_t::kEmpty),
 3951|  20.7M|                  Group::kWidth);
 3952|  20.7M|      std::memset(new_ctrl + group_index + old_capacity + 1,
 3953|  20.7M|                  static_cast<int8_t>(ctrl_t::kEmpty), Group::kWidth);
 3954|       |      // TODO(b/382423690): try to type erase everything outside of the loop.
 3955|       |      // We will share a lot of code in expense of one function call per group.
 3956|   291M|      for (auto in_fixed_group_index : old_g.MaskFull()) {
  ------------------
  |  Branch (3956:38): [True: 291M, False: 20.7M]
  ------------------
 3957|   291M|        size_t old_index = group_index + in_fixed_group_index;
 3958|   291M|        slot_type* old_slot = old_slots_ptr + old_index;
 3959|       |        // TODO(b/382423690): try to avoid entire hash calculation since we need
 3960|       |        // only one new bit of h1.
 3961|   291M|        size_t hash = set->hash_of(old_slot);
 3962|   291M|        size_t h1 = H1(hash);
 3963|   291M|        h2_t h2 = H2(hash);
 3964|   291M|        size_t new_index = TryFindNewIndexWithoutProbing(
 3965|   291M|            h1, old_index, old_capacity, new_ctrl, new_capacity);
 3966|       |        // Note that encode_probed_element is allowed to use old_ctrl buffer
 3967|       |        // till and included the old_index.
 3968|   291M|        if (ABSL_PREDICT_FALSE(new_index == kProbedElementIndexSentinel)) {
  ------------------
  |  |  190|   291M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 97.7k, False: 290M]
  |  |  |  Branch (190:49): [Folded, False: 291M]
  |  |  |  Branch (190:58): [True: 97.7k, False: 290M]
  |  |  ------------------
  ------------------
 3969|  97.7k|          encode_probed_element(probed_storage, h2, old_index, h1);
 3970|  97.7k|          continue;
 3971|  97.7k|        }
 3972|   290M|        ABSL_SWISSTABLE_ASSERT((new_index & old_capacity) <= old_index);
  ------------------
  |  |  257|   290M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3973|       |        ABSL_SWISSTABLE_ASSERT(IsEmpty(new_ctrl[new_index]));
  ------------------
  |  |  257|   290M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3974|   290M|        new_ctrl[new_index] = static_cast<ctrl_t>(h2);
 3975|   290M|        auto* new_slot = new_slots + new_index;
 3976|   290M|        SanitizerUnpoisonMemoryRegion(new_slot, sizeof(slot_type));
 3977|   290M|        set->transfer(new_slot, old_slot);
 3978|   290M|        SanitizerPoisonMemoryRegion(old_slot, sizeof(slot_type));
 3979|   290M|      }
 3980|  20.7M|    }
 3981|  59.8k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE10slot_arrayEm:
 3849|  59.8k|  slot_type* slot_array(size_t capacity) const {
 3850|       |    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|  59.8k|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3851|  59.8k|    return static_cast<slot_type*>(common().slot_array(capacity));
 3852|  59.8k|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE7hash_ofEPNS1_13map_slot_typeIS9_SA_EE:
 3511|   291M|  ABSL_ATTRIBUTE_ALWAYS_INLINE size_t hash_of(slot_type* slot) const {
 3512|   291M|    return PolicyTraits::apply(
 3513|   291M|        HashElement<hasher, kIsDefaultHash>{hash_ref(), common().seed().seed()},
 3514|   291M|        PolicyTraits::element(slot));
 3515|   291M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8transferEPNS1_13map_slot_typeIS9_SA_EESF_:
 3377|   290M|  void transfer(slot_type* to, slot_type* from) {
 3378|   290M|    common().RunWithReentrancyGuard([&] {
 3379|   290M|      allocator_type alloc(char_alloc_ref());
 3380|   290M|      PolicyTraits::transfer(&alloc, to, from);
 3381|   290M|    });
 3382|   290M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS9_EEJEE8transferEPNS1_13map_slot_typeISB_SC_EESH_EUlvE_EEvT_:
 1486|   290M|  void RunWithReentrancyGuard(F f) {
 1487|   290M|#ifdef NDEBUG
 1488|   290M|    f();
 1489|   290M|    return;
 1490|      0|#endif
 1491|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1492|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1493|      0|    f();
 1494|      0|    set_capacity(cap);
 1495|      0|  }
unigram_model.cc:_ZZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8transferEPNS1_13map_slot_typeIS9_SA_EESF_ENKUlvE_clEv:
 3378|   290M|    common().RunWithReentrancyGuard([&] {
 3379|   290M|      allocator_type alloc(char_alloc_ref());
 3380|   290M|      PolicyTraits::transfer(&alloc, to, from);
 3381|   290M|    });
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE14char_alloc_refEv:
 3893|   495M|  CharAlloc& char_alloc_ref() { return settings_.template get<3>(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8hash_refEv:
 3889|  11.1k|  hasher& hash_ref() { return settings_.template get<1>(); }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE28find_or_prepare_insert_largeIS9_EENSt3__14pairIPNS1_13map_slot_typeIS9_SA_EEbEERKT_:
 3677|   204M|  std::pair<slot_type*, bool> find_or_prepare_insert_large(const K& key) {
 3678|   204M|    ABSL_SWISSTABLE_ASSERT(!is_soo());
  ------------------
  |  |  257|   204M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3679|   204M|    prefetch_heap_block();
 3680|   204M|    const size_t cap = capacity();
 3681|   204M|    ABSL_ASSUME(cap > kMaxSmallCapacity);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 3682|   204M|    const size_t hash = hash_of(key);
 3683|   204M|    auto seq = probe(ProbeCapacity{cap}, hash);
 3684|   204M|    const h2_t h2 = H2(hash);
 3685|   204M|    const ctrl_t* ctrl = control();
 3686|   204M|    slot_type* slot_array = to_slot(common().slot_array(cap));
 3687|   228M|    while (true) {
  ------------------
  |  Branch (3687:12): [True: 228M, Folded]
  ------------------
 3688|   228M|#ifndef ABSL_HAVE_MEMORY_SANITIZER
 3689|   228M|      absl::PrefetchToLocalCache(slot_array + seq.offset());
 3690|   228M|#endif
 3691|   228M|      Group g{ctrl + seq.offset()};
 3692|   228M|      for (uint32_t i : g.Match(h2)) {
  ------------------
  |  Branch (3692:23): [True: 18.2M, False: 228M]
  ------------------
 3693|  18.2M|        slot_type* slot = slot_array + seq.offset(i);
 3694|  18.2M|        if (ABSL_PREDICT_TRUE(equal_to(key, slot))) {
  ------------------
  |  |  191|  18.2M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 18.2M]
  |  |  |  Branch (191:48): [Folded, False: 18.2M]
  |  |  |  Branch (191:57): [True: 0, False: 18.2M]
  |  |  ------------------
  ------------------
 3695|      0|          return {slot, false};
 3696|      0|        }
 3697|  18.2M|      }
 3698|   228M|      auto mask_empty = g.MaskEmpty();
 3699|   228M|      if (ABSL_PREDICT_TRUE(mask_empty)) {
  ------------------
  |  |  191|   228M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 204M, False: 24.0M]
  |  |  |  Branch (191:48): [Folded, False: 228M]
  |  |  |  Branch (191:57): [True: 204M, False: 24.0M]
  |  |  ------------------
  ------------------
 3700|   204M|        size_t target_group_offset = seq.offset();
 3701|   204M|        void* slot =
 3702|   204M|            SwisstableGenerationsEnabled()
  ------------------
  |  Branch (3702:13): [Folded, False: 204M]
  ------------------
 3703|   204M|                ? PrepareInsertLargeGenerationsEnabled(
 3704|      0|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3705|      0|                      FindInfo{target_group_offset, seq.index()},
 3706|      0|                      HashKey<hasher, K, kIsDefaultHash>{hash_ref(), key})
 3707|   204M|                : PrepareInsertLarge(
 3708|   204M|                      common(), GetPolicyFunctions(), hash, mask_empty,
 3709|   204M|                      FindInfo{target_group_offset, seq.index()});
 3710|   204M|        return {to_slot(slot), true};
 3711|   204M|      }
 3712|  24.0M|      seq.next();
 3713|       |      ABSL_SWISSTABLE_ASSERT(seq.index() <= capacity() && "full table!");
  ------------------
  |  |  257|  24.0M|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 3714|  24.0M|    }
 3715|   204M|  }
unigram_model.cc:_ZNK4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE8capacityEv:
 2786|   204M|  size_t capacity() const {
 2787|   204M|    const size_t cap = common().capacity();
 2788|       |    // Compiler complains when using functions in ASSUME so use local variables.
 2789|   204M|    [[maybe_unused]] const bool kIsValid = IsValidCapacity(cap);
 2790|   204M|    [[maybe_unused]] const size_t kDefaultCapacity = DefaultCapacity();
 2791|   204M|    [[maybe_unused]] const size_t kMaxValidCapacity = MaxValidCapacity();
 2792|   204M|    ABSL_ASSUME(kIsValid || cap == 0);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  |  |  ------------------
  |  |  |  Branch (272:44): [True: 204M, False: 0]
  |  |  |  Branch (272:44): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 2793|   204M|    ABSL_ASSUME(cap >= kDefaultCapacity);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2794|   204M|    ABSL_ASSUME(cap <= kMaxValidCapacity);
  ------------------
  |  |  272|   204M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 2795|   204M|    return cap;
 2796|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE10emplace_atIJRKNSt3__121piecewise_construct_tENSE_5tupleIJOS9_EEENSI_IJOSA_EEEEEEvPNS1_13map_slot_typeIS9_SA_EEDpOT_:
 3792|   204M|  void emplace_at(slot_type* slot, Args&&... args) {
 3793|   204M|    construct(slot, std::forward<Args>(args)...);
 3794|       |
 3795|       |    // When is_small, find calls find_small and if size is 0, then it will
 3796|       |    // return an end iterator. This can happen in the raw_hash_set copy ctor.
 3797|       |    assert((is_small() ||
 3798|   204M|            PolicyTraits::apply(FindElement{*this}, PolicyTraits::element(slot))
 3799|   204M|                    .slot() == slot) &&
 3800|   204M|           "constructed value does not match the lookup key");
 3801|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE9constructIJRKNSt3__121piecewise_construct_tENSE_5tupleIJOS9_EEENSI_IJOSA_EEEEEEvPNS1_13map_slot_typeIS9_SA_EEDpOT_:
 3365|   204M|  void construct(slot_type* slot, Args&&... args) {
 3366|   204M|    common().RunWithReentrancyGuard([&] {
 3367|   204M|      allocator_type alloc(char_alloc_ref());
 3368|   204M|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|   204M|    });
 3370|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12CommonFields22RunWithReentrancyGuardIZNS1_12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS9_EEJEE9constructIJRKNSt3__121piecewise_construct_tENSG_5tupleIJOSB_EEENSK_IJOSC_EEEEEEvPNS1_13map_slot_typeISB_SC_EEDpOT_EUlvE_EEvT_:
 1486|   204M|  void RunWithReentrancyGuard(F f) {
 1487|   204M|#ifdef NDEBUG
 1488|   204M|    f();
 1489|   204M|    return;
 1490|      0|#endif
 1491|      0|    const HashtableCapacity cap = maybe_invalid_capacity();
 1492|      0|    set_capacity(HashtableCapacity::CreateReentrance());
 1493|      0|    f();
 1494|      0|    set_capacity(cap);
 1495|      0|  }
unigram_model.cc:_ZZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE9constructIJRKNSt3__121piecewise_construct_tENSE_5tupleIJOS9_EEENSI_IJOSA_EEEEEEvPNS1_13map_slot_typeIS9_SA_EEDpOT_ENKUlvE_clEv:
 3366|   204M|    common().RunWithReentrancyGuard([&] {
 3367|   204M|      allocator_type alloc(char_alloc_ref());
 3368|   204M|      PolicyTraits::construct(&alloc, slot, std::forward<Args>(args)...);
 3369|   204M|    });
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE29non_iterable_iterator_at_slotEPNS1_13map_slot_typeIS9_SA_EE:
 3806|   204M|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3807|   204M|    return {InsertIteratorControl(), slot, common().generation_ptr()};
 3808|   204M|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEED2Ev:
 2746|  5.57k|  ~raw_hash_set() {
 2747|  5.57k|    destructor_impl();
 2748|       |    if constexpr (SwisstableGenerationsOrDebugEnabled()) {
 2749|       |      common().set_capacity(HashtableCapacity::CreateDestroyed());
 2750|       |    }
 2751|  5.57k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE15destructor_implEv:
 3457|  5.57k|  void destructor_impl() {
 3458|  5.57k|    if (SwisstableGenerationsEnabled() &&
  ------------------
  |  Branch (3458:9): [Folded, False: 5.57k]
  |  Branch (3458:9): [Folded, False: 5.57k]
  ------------------
 3459|      0|        maybe_invalid_capacity().IsMovedFrom()) {
  ------------------
  |  Branch (3459:9): [True: 0, False: 0]
  ------------------
 3460|      0|      return;
 3461|      0|    }
 3462|       |    if constexpr (SooEnabled()) {
 3463|       |      if (is_small() &&
 3464|       |          (PolicyTraits::template destroy_is_trivial<Alloc>() || empty())) {
 3465|       |        return;
 3466|       |      }
 3467|       |      DestructSoo(common(), sizeof(slot_type), alignof(slot_type),
 3468|       |                  get_destroy_slot_fn(), get_dealloc_backing_array_fn(),
 3469|       |                  &char_alloc_ref());
 3470|  5.57k|    } else {
 3471|  5.57k|      if (capacity() == 0) return;
  ------------------
  |  Branch (3471:11): [True: 0, False: 5.57k]
  ------------------
 3472|  5.57k|      DestructNonSoo(common(), sizeof(slot_type), alignof(slot_type),
 3473|  5.57k|                     get_destroy_slot_fn(), get_dealloc_backing_array_fn(),
 3474|  5.57k|                     &char_alloc_ref());
 3475|  5.57k|    }
 3476|  5.57k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE19get_destroy_slot_fnEv:
 3922|  5.57k|  static constexpr DestroySlotFn get_destroy_slot_fn() {
 3923|  5.57k|    return PolicyTraits::template destroy_is_trivial<Alloc>()
  ------------------
  |  Branch (3923:12): [True: 5.57k, Folded]
  ------------------
 3924|  5.57k|               ? nullptr
 3925|  5.57k|               : &raw_hash_set::destroy_slot_fn_impl;
 3926|  5.57k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEE28get_dealloc_backing_array_fnEv:
 3983|  5.57k|  static constexpr DeallocBackingArrayFn get_dealloc_backing_array_fn() {
 3984|  5.57k|    return &DeallocateBackingArray<BackingArrayAlignment(alignof(slot_type)),
 3985|  5.57k|                                   CharAlloc>;
 3986|  5.57k|  }
unigram_model.cc:_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEPS7_EEJEEC2Ev:
 2534|  5.57k|      std::is_nothrow_default_constructible_v<allocator_type>) {}
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE5beginEv:
 2753|      2|  iterator begin() ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2754|      2|    if (ABSL_PREDICT_FALSE(empty())) return end();
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 2755|      2|    if (is_small()) return single_iterator();
  ------------------
  |  Branch (2755:9): [True: 0, False: 2]
  ------------------
 2756|      2|    iterator it = {control(), slot_array(capacity()),
 2757|      2|                   common().generation_ptr()};
 2758|      2|    it.skip_empty_or_deleted();
 2759|       |    ABSL_SWISSTABLE_ASSERT(IsFull(*it.control()));
  ------------------
  |  |  257|      2|  assert((CONDITION) && "Try enabling sanitizers.")
  ------------------
 2760|      2|    return it;
 2761|      2|  }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iterator21skip_empty_or_deletedEv:
 2451|     80|    void skip_empty_or_deleted() {
 2452|    118|      while (IsEmptyOrDeleted(*ctrl_)) {
  ------------------
  |  Branch (2452:14): [True: 38, False: 80]
  ------------------
 2453|     38|        ++ctrl_;
 2454|     38|        ++slot_;
 2455|     38|      }
 2456|     80|    }
_ZN4absl12lts_2026081718container_internalneERKNS1_12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorESD_:
 2427|     80|    friend bool operator!=(const iterator& a, const iterator& b) {
 2428|     80|      return !(a == b);
 2429|     80|    }
_ZN4absl12lts_2026081718container_internal12raw_hash_setINS1_17FlatHashMapPolicyINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiEEJEE8iteratorppEv:
 2403|     78|    iterator& operator++() {
 2404|     78|      assert_is_full("operator++");
 2405|     78|      ++ctrl_;
 2406|     78|      ++slot_;
 2407|     78|      skip_empty_or_deleted();
 2408|     78|      if (ABSL_PREDICT_FALSE(*ctrl_ == ctrl_t::kSentinel)) slot_ = nullptr;
  ------------------
  |  |  190|     78|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 2, False: 76]
  |  |  |  Branch (190:49): [Folded, False: 78]
  |  |  |  Branch (190:58): [True: 2, False: 76]
  |  |  ------------------
  ------------------
 2409|     78|      return *this;
 2410|     78|    }
_ZN4absl12lts_2026081718container_internal20AllocateBackingArrayILm8ENSt3__19allocatorIcEEEEPvS6_m:
 1900|  82.1k|void* AllocateBackingArray(void* alloc, size_t n) {
 1901|  82.1k|  return Allocate<AlignOfBackingArray>(static_cast<Alloc*>(alloc), n);
 1902|  82.1k|}
_ZN4absl12lts_2026081718container_internal22DeallocateBackingArrayILm8ENSt3__19allocatorIcEEEEvPvmPNS1_6ctrl_tEmmbm:
 1907|  82.1k|                            size_t blocked_element_count) {
 1908|  82.1k|  RawHashSetLayout layout(capacity, slot_size, slot_align, had_infoz,
 1909|  82.1k|                          blocked_element_count);
 1910|  82.1k|  void* backing_array = ctrl - layout.control_offset();
 1911|       |  // Unpoison before returning the memory to the allocator.
 1912|  82.1k|  SanitizerUnpoisonMemoryRegion(backing_array, layout.alloc_size());
 1913|  82.1k|  Deallocate<AlignOfBackingArray>(static_cast<Alloc*>(alloc), backing_array,
 1914|  82.1k|                                  layout.alloc_size());
 1915|  82.1k|}

_ZN4absl12lts_2026081718container_internal14ProbedItemImplIjLm32EEC2Ehmm:
   59|  69.6k|      : h2(h2_arg),
   60|  69.6k|        source_offset(static_cast<IntType>(source_offset_arg)),
   61|  69.6k|        h1(static_cast<IntType>(h1_arg)) {}
_ZN4absl12lts_2026081718container_internal14ProbedItemImplImLm64EEC2Ehmm:
   59|  28.1k|      : h2(h2_arg),
   60|  28.1k|        source_offset(static_cast<IntType>(source_offset_arg)),
   61|  28.1k|        h1(static_cast<IntType>(h1_arg)) {}

_ZNK4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEclES5_S7_:
  164|   157M|  R operator()(Args... args) const {
  165|   157M|    return invoker_(ptr_, std::forward<Args>(args)...);
  166|   157M|  }
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlS5_S7_E_vEEOT_:
  112|   157M|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlS5_S7_E_EENSt3__110in_place_tEOT_:
  100|   157M|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|   157M|    absl::functional_internal::AssertNonNull(f);
  102|   157M|    ptr_.obj = &f;
  103|   157M|  }
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlS5_S7_E_vEEOT_:
  112|  9.29k|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlS5_S7_E_EENSt3__110in_place_tEOT_:
  100|  9.29k|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|  9.29k|    absl::functional_internal::AssertNonNull(f);
  102|  9.29k|    ptr_.obj = &f;
  103|  9.29k|  }
_ZN4absl12lts_2026081711FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_10StringHashENSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEELb1EEEvEEOT_:
  112|      4|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026081711FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_10StringHashENSt3__112basic_stringIcNS8_11char_traitsIcEENS8_9allocatorIcEEEELb1EEEEENS8_10in_place_tEOT_:
  100|      4|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|      4|    absl::functional_internal::AssertNonNull(f);
  102|      4|    ptr_.obj = &f;
  103|      4|  }
unigram_model.cc:_ZN4absl12lts_2026081711FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashESD_Lb0EEEvEEOT_:
  112|  11.1k|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
unigram_model.cc:_ZN4absl12lts_2026081711FunctionRefIFmmEEC2INS0_18container_internal7HashKeyINS5_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashESD_Lb0EEEEENSt3__110in_place_tEOT_:
  100|  11.1k|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|  11.1k|    absl::functional_internal::AssertNonNull(f);
  102|  11.1k|    ptr_.obj = &f;
  103|  11.1k|  }
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerINS3_11MessageLiteEE23GetNewFromPrototypeFuncEPKSD_EUlS5_S7_E_vEEOT_:
  112|    596|      : FunctionRef(std::in_place, std::forward<F>(f)) {}
_ZN4absl12lts_2026081711FunctionRefIFvPN6google8protobuf5ArenaERPvEEC2IZNS3_8internal18GenericTypeHandlerINS3_11MessageLiteEE23GetNewFromPrototypeFuncEPKSD_EUlS5_S7_E_EENSt3__110in_place_tEOT_:
  100|    596|      : invoker_(&absl::functional_internal::InvokeObject<F&, R, Args...>) {
  101|    596|    absl::functional_internal::AssertNonNull(f);
  102|    596|    ptr_.obj = &f;
  103|    596|  }
_ZNK4absl12lts_2026081711FunctionRefIFmmEEclEm:
  164|  5.57k|  R operator()(Args... args) const {
  165|  5.57k|    return invoker_(ptr_, std::forward<Args>(args)...);
  166|  5.57k|  }

_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_vJSB_SD_EEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|   157M|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|   157M|  using T = std::remove_reference_t<Obj>;
   74|   157M|  return static_cast<R>(std::invoke(
   75|   157M|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|   157M|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|   157M|}
_ZN4absl12lts_2026081719functional_internal13AssertNonNullIZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_EEvRKT_:
  134|   157M|void AssertNonNull(const F&) {}
_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_vJSB_SD_EEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|  9.29k|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|  9.29k|  using T = std::remove_reference_t<Obj>;
   74|  9.29k|  return static_cast<R>(std::invoke(
   75|  9.29k|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|  9.29k|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|  9.29k|}
_ZN4absl12lts_2026081719functional_internal13AssertNonNullIZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvEUlPNS4_5ArenaERPvE_EEvRKT_:
  134|  9.29k|void AssertNonNull(const F&) {}
_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRZN6google8protobuf8internal18GenericTypeHandlerINS4_11MessageLiteEE23GetNewFromPrototypeFuncEPKS7_EUlPNS4_5ArenaERPvE_vJSC_SE_EEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|    596|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|    596|  using T = std::remove_reference_t<Obj>;
   74|    596|  return static_cast<R>(std::invoke(
   75|    596|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|    596|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|    596|}
_ZN4absl12lts_2026081719functional_internal13AssertNonNullIZN6google8protobuf8internal18GenericTypeHandlerINS4_11MessageLiteEE23GetNewFromPrototypeFuncEPKS7_EUlPNS4_5ArenaERPvE_EEvRKT_:
  134|    596|void AssertNonNull(const F&) {}
_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRNS0_18container_internal7HashKeyINS3_10StringHashENSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEELb1EEEmJmEEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|      2|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|      2|  using T = std::remove_reference_t<Obj>;
   74|      2|  return static_cast<R>(std::invoke(
   75|      2|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|      2|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|      2|}
_ZN4absl12lts_2026081719functional_internal13AssertNonNullINS0_18container_internal7HashKeyINS3_10StringHashENSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEELb1EEEEEvRKT_:
  134|      4|void AssertNonNull(const F&) {}
unigram_model.cc:_ZN4absl12lts_2026081719functional_internal12InvokeObjectIRNS0_18container_internal7HashKeyINS3_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashESB_Lb0EEEmJmEEET0_NS1_7VoidPtrEDpNS1_8ForwardTIT1_E4typeE:
   72|  5.57k|R InvokeObject(VoidPtr ptr, typename ForwardT<Args>::type... args) {
   73|  5.57k|  using T = std::remove_reference_t<Obj>;
   74|  5.57k|  return static_cast<R>(std::invoke(
   75|  5.57k|      std::forward<Obj>(*const_cast<T*>(static_cast<const T*>(ptr.obj))),
   76|  5.57k|      std::forward<typename ForwardT<Args>::type>(args)...));
   77|  5.57k|}
unigram_model.cc:_ZN4absl12lts_2026081719functional_internal13AssertNonNullINS0_18container_internal7HashKeyINS3_6HashEqIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEvE4HashESB_Lb0EEEEEvRKT_:
  134|  11.1k|void AssertNonNull(const F&) {}

_ZN4absl12lts_2026081713hash_internal43CombineLargeContiguousImplOn64BitLengthGt32EmPKhm:
  417|  1.58k|                                                     size_t len) {
  418|  1.58k|  assert(len > 32);
  419|  1.58k|  assert(sizeof(size_t) == 8);  // NOLINT(misc-static-assert)
  420|  1.58k|  if (ABSL_PREDICT_TRUE(len <= PiecewiseChunkSize())) {
  ------------------
  |  |  191|  1.58k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 1.06k, False: 527]
  |  |  |  Branch (191:48): [Folded, False: 1.58k]
  |  |  |  Branch (191:57): [True: 1.06k, False: 527]
  |  |  ------------------
  ------------------
  421|  1.06k|    return HashBlockOn64Bit(state, first, len);
  422|  1.06k|  }
  423|    527|  return SplitAndCombineOn64Bit(state, first, len);
  424|  1.58k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_116HashBlockOn64BitEmPKhm:
  376|  41.1k|    uint64_t state, const unsigned char* data, size_t len) {
  377|  41.1k|#ifdef ABSL_HAVE_INTRINSIC_INT128
  378|  41.1k|  return LowLevelHashLenGt32(state, data, len);
  379|       |#else
  380|       |  return hash_internal::CityHash64WithSeed(reinterpret_cast<const char*>(data),
  381|       |                                           len, state);
  382|       |#endif
  383|  41.1k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_119LowLevelHashLenGt32EmPKvm:
  341|  41.1k|                                              size_t len) {
  342|  41.1k|  assert(len > 32);
  343|  41.1k|  if (ABSL_PREDICT_FALSE(len > 64)) {
  ------------------
  |  |  190|  41.1k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 41.0k, False: 119]
  |  |  |  Branch (190:49): [Folded, False: 41.1k]
  |  |  |  Branch (190:58): [True: 41.0k, False: 119]
  |  |  ------------------
  ------------------
  344|  41.0k|    return LowLevelHashLenGt64(seed, data, len);
  345|  41.0k|  }
  346|    119|  return LowLevelHash33To64(seed, static_cast<const uint8_t*>(data), len);
  347|  41.1k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_119LowLevelHashLenGt64EmPKvm:
  291|  41.0k|LowLevelHashLenGt64(uint64_t seed, const void* data, size_t len) {
  292|  41.0k|  assert(len > 64);
  293|  41.0k|  const uint8_t* ptr = static_cast<const uint8_t*>(data);
  294|  41.0k|  uint64_t current_state = seed ^ kStaticRandomData[0] ^ len;
  295|  41.0k|  const uint8_t* last_32_ptr = ptr + len - 32;
  296|       |  // If we have more than 64 bytes, we're going to handle chunks of 64
  297|       |  // bytes at a time. We're going to build up four separate hash states
  298|       |  // which we will then hash together. This avoids short dependency chains.
  299|  41.0k|  uint64_t duplicated_state0 = current_state;
  300|  41.0k|  uint64_t duplicated_state1 = current_state;
  301|  41.0k|  uint64_t duplicated_state2 = current_state;
  302|       |
  303|   608k|  do {
  304|   608k|    PrefetchFutureDataToLocalCache(ptr);
  305|       |
  306|   608k|    uint64_t a = absl::base_internal::UnalignedLoad64(ptr);
  307|   608k|    uint64_t b = absl::base_internal::UnalignedLoad64(ptr + 8);
  308|   608k|    uint64_t c = absl::base_internal::UnalignedLoad64(ptr + 16);
  309|   608k|    uint64_t d = absl::base_internal::UnalignedLoad64(ptr + 24);
  310|   608k|    uint64_t e = absl::base_internal::UnalignedLoad64(ptr + 32);
  311|   608k|    uint64_t f = absl::base_internal::UnalignedLoad64(ptr + 40);
  312|   608k|    uint64_t g = absl::base_internal::UnalignedLoad64(ptr + 48);
  313|   608k|    uint64_t h = absl::base_internal::UnalignedLoad64(ptr + 56);
  314|       |
  315|   608k|    current_state = Mix(a ^ kStaticRandomData[1], b ^ current_state);
  316|   608k|    duplicated_state0 = Mix(c ^ kStaticRandomData[2], d ^ duplicated_state0);
  317|       |
  318|   608k|    duplicated_state1 = Mix(e ^ kStaticRandomData[3], f ^ duplicated_state1);
  319|   608k|    duplicated_state2 = Mix(g ^ kStaticRandomData[4], h ^ duplicated_state2);
  320|       |
  321|   608k|    ptr += 64;
  322|   608k|    len -= 64;
  323|   608k|  } while (len > 64);
  ------------------
  |  Branch (323:12): [True: 567k, False: 41.0k]
  ------------------
  324|       |
  325|  41.0k|  current_state = (current_state ^ duplicated_state0) ^
  326|  41.0k|                  (duplicated_state1 + duplicated_state2);
  327|       |  // We now have a data `ptr` with at most 64 bytes and the current state
  328|       |  // of the hashing state machine stored in current_state.
  329|  41.0k|  if (len > 32) {
  ------------------
  |  Branch (329:7): [True: 40.7k, False: 349]
  ------------------
  330|  40.7k|    current_state = Mix32Bytes(ptr, current_state);
  331|  40.7k|  }
  332|       |
  333|       |  // We now have a data `ptr` with at most 32 bytes and the current state
  334|       |  // of the hashing state machine stored in current_state. But we can
  335|       |  // safely read from `ptr + len - 32`.
  336|  41.0k|  return Mix32Bytes(last_32_ptr, current_state);
  337|  41.0k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_130PrefetchFutureDataToLocalCacheEPKh:
   55|   608k|void PrefetchFutureDataToLocalCache(const uint8_t* ptr) {
   56|   608k|  PrefetchToLocalCache(ptr + 5 * ABSL_CACHELINE_SIZE);
  ------------------
  |  |   89|   608k|#define ABSL_CACHELINE_SIZE 64
  ------------------
   57|   608k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_110Mix32BytesEPKhm:
  271|  82.0k|uint64_t Mix32Bytes(const uint8_t* ptr, uint64_t current_state) {
  272|  82.0k|  uint64_t a = absl::base_internal::UnalignedLoad64(ptr);
  273|  82.0k|  uint64_t b = absl::base_internal::UnalignedLoad64(ptr + 8);
  274|  82.0k|  uint64_t c = absl::base_internal::UnalignedLoad64(ptr + 16);
  275|  82.0k|  uint64_t d = absl::base_internal::UnalignedLoad64(ptr + 24);
  276|       |
  277|  82.0k|  uint64_t cs0 = Mix(a ^ kStaticRandomData[1], b ^ current_state);
  278|  82.0k|  uint64_t cs1 = Mix(c ^ kStaticRandomData[2], d ^ current_state);
  279|  82.0k|  return cs0 ^ cs1;
  280|  82.0k|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_118LowLevelHash33To64EmPKhm:
  282|    119|uint64_t LowLevelHash33To64(uint64_t seed, const uint8_t* ptr, size_t len) {
  283|    119|  assert(len > 32);
  284|       |  assert(len <= 64);
  285|    119|  uint64_t current_state = seed ^ kStaticRandomData[0] ^ len;
  286|    119|  const uint8_t* last_32_ptr = ptr + len - 32;
  287|    119|  return Mix32Bytes(last_32_ptr, Mix32Bytes(ptr, current_state));
  288|    119|}
hash.cc:_ZN4absl12lts_2026081713hash_internal12_GLOBAL__N_122SplitAndCombineOn64BitEmPKhm:
  386|    527|SplitAndCombineOn64Bit(uint64_t state, const unsigned char* first, size_t len) {
  387|  40.6k|  while (len >= PiecewiseChunkSize()) {
  ------------------
  |  Branch (387:10): [True: 40.1k, False: 527]
  ------------------
  388|  40.1k|    state = HashBlockOn64Bit(state, first, PiecewiseChunkSize());
  389|  40.1k|    len -= PiecewiseChunkSize();
  390|  40.1k|    first += PiecewiseChunkSize();
  391|  40.1k|  }
  392|       |  // Do not call CombineContiguousImpl for empty range since it is modifying
  393|       |  // state.
  394|    527|  if (len == 0) {
  ------------------
  |  Branch (394:7): [True: 10, False: 517]
  ------------------
  395|     10|    return state;
  396|     10|  }
  397|       |  // Handle the remainder.
  398|    517|  return CombineContiguousImpl(state, first, len,
  399|    517|                               std::integral_constant<int, 8>{});
  400|    527|}

_ZN4absl12lts_2026081713hash_internal15MixingHashState18combine_contiguousES2_PKhm:
 1449|   343M|                                            size_t size) {
 1450|   343M|    return MixingHashState(
 1451|   343M|        CombineContiguousImpl(hash_state.state_, first, size,
 1452|   343M|                              std::integral_constant<int, sizeof(size_t)>{}));
 1453|   343M|  }
_ZN4absl12lts_2026081713hash_internal15MixingHashStateC2Em:
 1500|  2.08G|  explicit MixingHashState(uint64_t state) : state_(state) {}
_ZN4absl12lts_2026081713hash_internal15MixingHashState11combine_rawES2_m:
 1506|   699M|                                     uint64_t value) {
 1507|   699M|    return MixingHashState(CombineRawImpl(hash_state.state_, value));
 1508|   699M|  }
_ZN4absl12lts_2026081713hash_internal15MixingHashState4SeedEv:
 1552|   699M|  ABSL_ATTRIBUTE_ALWAYS_INLINE static size_t Seed() {
 1553|   699M|#if (!defined(__clang__) || __clang_major__ > 11) && \
 1554|   699M|    (!defined(__apple_build_version__) ||            \
 1555|   699M|     __apple_build_version__ >= 19558921)  // Xcode 12
 1556|   699M|    return static_cast<size_t>(reinterpret_cast<uintptr_t>(&kSeed));
 1557|       |#else
 1558|       |    // Workaround the absence of
 1559|       |    // https://github.com/llvm/llvm-project/commit/bc15bf66dcca76cc06fe71fca35b74dc4d521021.
 1560|       |    return static_cast<size_t>(reinterpret_cast<uintptr_t>(kSeed));
 1561|       |#endif
 1562|   699M|  }
_ZN4absl12lts_2026081713hash_internal18PiecewiseChunkSizeEv:
  157|   162k|constexpr size_t PiecewiseChunkSize() { return 1024; }
_ZN4absl12lts_2026081713hash_internal19PrecombineLengthMixEmm:
 1056|   343M|inline uint64_t PrecombineLengthMix(uint64_t state, size_t len) {
 1057|   343M|  ABSL_ASSUME(len + sizeof(uint64_t) <= sizeof(kStaticRandomData));
  ------------------
  |  |  272|   343M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1058|   343M|  uint64_t data = absl::base_internal::UnalignedLoad64(
 1059|   343M|      reinterpret_cast<const unsigned char*>(&kStaticRandomData[0]) + len);
 1060|   343M|  return state ^ data;
 1061|   343M|}
_ZN4absl12lts_2026081713hash_internal3MixEmm:
 1063|  1.04G|ABSL_ATTRIBUTE_ALWAYS_INLINE inline uint64_t Mix(uint64_t lhs, uint64_t rhs) {
 1064|       |  // Though the 128-bit product needs multiple instructions on non-x86-64
 1065|       |  // platforms, it is still a good balance between speed and hash quality.
 1066|  1.04G|  absl::uint128 m = lhs;
 1067|  1.04G|  m *= rhs;
 1068|  1.04G|  return Uint128High64(m) ^ Uint128Low64(m);
 1069|  1.04G|}
_ZN4absl12lts_2026081713hash_internal5Read8EPKh:
 1079|    830|inline uint64_t Read8(const unsigned char* p) {
 1080|    830|  return absl::base_internal::UnalignedLoad64(p);
 1081|    830|}
_ZN4absl12lts_2026081713hash_internal9Read9To16EPKhm:
 1090|    127|                                               size_t len) {
 1091|    127|  return {Read8(p), Read8(p + len - 8)};
 1092|    127|}
_ZN4absl12lts_2026081713hash_internal8Read4To8EPKhm:
 1096|   330M|inline uint64_t Read4To8(const unsigned char* p, size_t len) {
 1097|       |  // If `len < 8`, we duplicate bytes. We always put low memory at the end.
 1098|       |  // E.g., on little endian platforms:
 1099|       |  // `ABCD` will be read as `ABCDABCD`.
 1100|       |  // `ABCDE` will be read as `BCDEABCD`.
 1101|       |  // `ABCDEF` will be read as `CDEFABCD`.
 1102|       |  // `ABCDEFG` will be read as `DEFGABCD`.
 1103|       |  // `ABCDEFGH` will be read as `EFGHABCD`.
 1104|       |  // We also do not care about endianness. On big-endian platforms, bytes will
 1105|       |  // be permuted differently. We always shift low memory by 32, because that
 1106|       |  // can be pipelined earlier. Reading high memory requires computing
 1107|       |  // `p + len - 4`.
 1108|   330M|  uint64_t most_significant =
 1109|   330M|      static_cast<uint64_t>(absl::base_internal::UnalignedLoad32(p)) << 32;
 1110|   330M|  uint64_t least_significant =
 1111|   330M|      absl::base_internal::UnalignedLoad32(p + len - 4);
 1112|   330M|  return most_significant | least_significant;
 1113|   330M|}
_ZN4absl12lts_2026081713hash_internal8Read1To3EPKhm:
 1116|  12.3M|inline uint32_t Read1To3(const unsigned char* p, size_t len) {
 1117|       |  // The trick used by this implementation is to avoid branches.
 1118|       |  // We always read three bytes by duplicating.
 1119|       |  // E.g.,
 1120|       |  // `A` is read as `AAA`.
 1121|       |  // `AB` is read as `ABB`.
 1122|       |  // `ABC` is read as `ABC`.
 1123|       |  // We always shift `p[0]` so that it can be pipelined better.
 1124|       |  // Other bytes require extra computation to find indices.
 1125|  12.3M|  uint32_t mem0 = (static_cast<uint32_t>(p[0]) << 16) | p[len - 1];
 1126|  12.3M|  uint32_t mem1 = static_cast<uint32_t>(p[len / 2]) << 8;
 1127|  12.3M|  return mem0 | mem1;
 1128|  12.3M|}
_ZN4absl12lts_2026081713hash_internal14CombineRawImplEmm:
 1171|  1.04G|                                                            uint64_t value) {
 1172|  1.04G|  return Mix(state ^ value, kMul);
 1173|  1.04G|}
_ZN4absl12lts_2026081713hash_internal26CombineSmallContiguousImplEmPKhm:
 1187|   343M|    uint64_t state, const unsigned char* first, size_t len) {
 1188|   343M|  ABSL_ASSUME(len <= 8);
  ------------------
  |  |  272|   343M|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1189|   343M|  uint64_t v;
 1190|   343M|  if (len >= 4) {
  ------------------
  |  Branch (1190:7): [True: 330M, False: 12.3M]
  ------------------
 1191|   330M|    v = Read4To8(first, len);
 1192|   330M|  } else if (len > 0) {
  ------------------
  |  Branch (1192:14): [True: 12.3M, False: 0]
  ------------------
 1193|  12.3M|    v = Read1To3(first, len);
 1194|  12.3M|  } else {
 1195|       |    // Empty string must modify the state.
 1196|      0|    v = 0x57;
 1197|      0|  }
 1198|   343M|  return CombineRawImpl(state, v);
 1199|   343M|}
_ZN4absl12lts_2026081713hash_internal26CombineContiguousImpl9to16EmPKhm:
 1202|    127|    uint64_t state, const unsigned char* first, size_t len) {
 1203|    127|  ABSL_ASSUME(len >= 9);
  ------------------
  |  |  272|    127|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1204|    127|  ABSL_ASSUME(len <= 16);
  ------------------
  |  |  272|    127|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1205|       |  // Note: any time one half of the mix function becomes zero it will fail to
 1206|       |  // incorporate any bits from the other half. However, there is exactly 1 in
 1207|       |  // 2^64 values for each side that achieve this, and only when the size is
 1208|       |  // exactly 16 -- for smaller sizes there is an overlapping byte that makes
 1209|       |  // this impossible unless the seed is *also* incredibly unlucky.
 1210|    127|  auto p = Read9To16(first, len);
 1211|    127|  return Mix(state ^ p.first, kMul ^ p.second);
 1212|    127|}
_ZN4absl12lts_2026081713hash_internal27CombineContiguousImpl17to32EmPKhm:
 1215|    144|    uint64_t state, const unsigned char* first, size_t len) {
 1216|    144|  ABSL_ASSUME(len >= 17);
  ------------------
  |  |  272|    144|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1217|    144|  ABSL_ASSUME(len <= 32);
  ------------------
  |  |  272|    144|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
 1218|       |  // Do two mixes of overlapping 16-byte ranges in parallel to minimize
 1219|       |  // latency.
 1220|    144|  const uint64_t m0 =
 1221|    144|      Mix(Read8(first) ^ kStaticRandomData[1], Read8(first + 8) ^ state);
 1222|       |
 1223|    144|  const unsigned char* tail_16b_ptr = first + (len - 16);
 1224|    144|  const uint64_t m1 = Mix(Read8(tail_16b_ptr) ^ kStaticRandomData[3],
 1225|    144|                          Read8(tail_16b_ptr + 8) ^ state);
 1226|    144|  return m0 ^ m1;
 1227|    144|}
_ZN4absl12lts_2026081713hash_internal21CombineContiguousImplEmPKhmNSt3__117integral_constantIiLi8EEE:
 1311|   343M|    std::integral_constant<int, 8> /* sizeof_size_t */) {
 1312|       |  // For large values we use LowLevelHash or CityHash depending on the platform,
 1313|       |  // for small ones we use custom low latency hash.
 1314|   343M|  if (len <= 8) {
  ------------------
  |  Branch (1314:7): [True: 343M, False: 1.86k]
  ------------------
 1315|   343M|    return CombineSmallContiguousImpl(PrecombineLengthMix(state, len), first,
 1316|   343M|                                      len);
 1317|   343M|  }
 1318|  1.86k|  if (len <= 16) {
  ------------------
  |  Branch (1318:7): [True: 127, False: 1.73k]
  ------------------
 1319|    127|    return CombineContiguousImpl9to16(PrecombineLengthMix(state, len), first,
 1320|    127|                                      len);
 1321|    127|  }
 1322|  1.73k|  if (len <= 32) {
  ------------------
  |  Branch (1322:7): [True: 144, False: 1.58k]
  ------------------
 1323|    144|    return CombineContiguousImpl17to32(PrecombineLengthMix(state, len), first,
 1324|    144|                                       len);
 1325|    144|  }
 1326|       |  // We must not mix length into the state here because calling
 1327|       |  // CombineContiguousImpl twice with PiecewiseChunkSize() must be equivalent
 1328|       |  // to calling CombineLargeContiguousImpl once with 2 * PiecewiseChunkSize().
 1329|  1.58k|  return CombineLargeContiguousImplOn64BitLengthGt32(state, first, len);
 1330|  1.73k|}
_ZN4absl12lts_2026081713hash_internal15MixingHashState14hash_with_seedINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEETnNS4_9enable_ifIXntsr16IntegralFastPathIT_EE5valueEiE4typeELi0EEEmRKSA_m:
 1473|   343M|  static size_t hash_with_seed(const T& value, size_t seed) {
 1474|   343M|    return static_cast<size_t>(combine(MixingHashState{seed}, value).state_);
 1475|   343M|  }
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineINSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEJEEES3_S3_RKT_DpRKT0_:
 1598|   343M|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1599|   343M|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1600|   343M|                        std::move(state), value),
 1601|   343M|                    values...);
 1602|   343M|}
_ZN4absl12lts_2026081713hash_internal10HashSelect14HashValueProbe6InvokeINS1_15MixingHashStateENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEENS6_9enable_ifIXsr3stdE9is_same_vIT_DTcl13AbslHashValueclsr3stdE4movefp_Efp0_EEEESC_E4typeESC_RKT0_:
 1376|   343M|        H> {
 1377|   343M|      return AbslHashValue(std::move(state), value);
 1378|   343M|    }
_ZN4absl12lts_2026081713hash_internal13AbslHashValueINS1_15MixingHashStateEEET_S4_NSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
  659|   343M|H AbslHashValue(H hash_state, absl::string_view str) {
  660|   343M|  return H::combine_contiguous(std::move(hash_state), str.data(), str.size());
  661|   343M|}
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE18combine_contiguousIcEES3_S3_PKT_m:
 1606|   343M|H HashStateBase<H>::combine_contiguous(H state, const T* data, size_t size) {
 1607|   343M|  return hash_internal::hash_range_or_bytes(std::move(state), data, size);
 1608|   343M|}
_ZN4absl12lts_2026081713hash_internal19hash_range_or_bytesINS1_15MixingHashStateEcEENSt3__19enable_ifIXsr23is_uniquely_representedIT0_EE5valueET_E4typeES7_PKS6_m:
 1029|   343M|    H hash_state, const T* data, size_t size) {
 1030|   343M|  const auto* bytes = reinterpret_cast<const unsigned char*>(data);
 1031|   343M|  return H::combine_contiguous(std::move(hash_state), bytes, sizeof(T) * size);
 1032|   343M|}
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineES3_:
  299|  1.74G|  static H combine(H state) { return state; }
_ZNK4absl12lts_2026081713hash_internal12HashWithSeed4hashINS1_4HashINSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEEES9_EEmRKT_RKT0_m:
  412|   343M|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|   343M|    return hasher.hash_with_seed(value, seed);
  415|   343M|  }
_ZNK4absl12lts_2026081713hash_internal8HashImplINSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEE14hash_with_seedERKS7_m:
 1587|   343M|  size_t hash_with_seed(const T& value, size_t seed) const {
 1588|   343M|    return MixingHashState::hash_with_seed(value, seed);
 1589|   343M|  }
_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineImJEEES3_S3_RKT_DpRKT0_:
 1598|   699M|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1599|   699M|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1600|   699M|                        std::move(state), value),
 1601|   699M|                    values...);
 1602|   699M|}
_ZN4absl12lts_2026081713hash_internal10HashSelect24UniquelyRepresentedProbe6InvokeINS1_15MixingHashStateEmEENSt3__19enable_ifIXsr23is_uniquely_representedIT0_EE5valueET_E4typeES9_RKS8_:
 1367|   699M|        -> std::enable_if_t<is_uniquely_represented<T>::value, H> {
 1368|   699M|      return hash_internal::hash_bytes(std::move(state), value);
 1369|   699M|    }
_ZN4absl12lts_2026081713hash_internal10hash_bytesINS1_15MixingHashStateEmTnNSt3__19enable_ifIXsr12FitsIn64BitsIT0_EE5valueEiE4typeELi0EEET_S9_RKS6_:
  422|   699M|H hash_bytes(H hash_state, const T& value) {
  423|   699M|  const unsigned char* start = reinterpret_cast<const unsigned char*>(&value);
  424|   699M|  uint64_t v;
  425|       |  if constexpr (sizeof(T) == 1) {
  426|       |    v = *start;
  427|       |  } else if constexpr (sizeof(T) == 2) {
  428|       |    v = absl::base_internal::UnalignedLoad16(start);
  429|       |  } else if constexpr (sizeof(T) == 4) {
  430|       |    v = absl::base_internal::UnalignedLoad32(start);
  431|   699M|  } else {
  432|   699M|    static_assert(sizeof(T) == 8);
  433|   699M|    v = absl::base_internal::UnalignedLoad64(start);
  434|   699M|  }
  435|   699M|  return CombineRaw()(std::move(hash_state), v);
  436|   699M|}
_ZNK4absl12lts_2026081713hash_internal10CombineRawclINS1_15MixingHashStateEEET_S5_m:
  404|   699M|  H operator()(H state, uint64_t value) const {
  405|   699M|    return H::combine_raw(std::move(state), value);
  406|   699M|  }
_ZNK4absl12lts_2026081713hash_internal12HashWithSeed4hashINS0_18container_internal10StringHashENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEEmRKT_RKT0_m:
  412|   343M|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|   343M|    return hasher.hash_with_seed(value, seed);
  415|   343M|  }
_ZNK4absl12lts_2026081713hash_internal12HashWithSeed4hashINS0_18container_internal10StringHashENSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEEEEmRKT_RKT0_m:
  412|  1.10k|  size_t hash(const Hasher& hasher, const T& value, size_t seed) const {
  413|       |    // NOLINTNEXTLINE(clang-diagnostic-sign-conversion)
  414|  1.10k|    return hasher.hash_with_seed(value, seed);
  415|  1.10k|  }
unigram_model.cc:_ZNK4absl12lts_2026081713hash_internal8HashImplIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEclERKS8_:
 1580|   699M|  size_t operator()(const T& value) const {
 1581|   699M|    return MixingHashState::hash(value);
 1582|   699M|  }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal15MixingHashState4hashIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEEmRKT_:
 1457|   699M|  static size_t hash(const T& value) {
 1458|   699M|    return hash_with_seed(value, Seed());
 1459|   699M|  }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal15MixingHashState14hash_with_seedIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisETnNSt3__19enable_ifIXntsr16IntegralFastPathIT_EE5valueEiE4typeELi0EEEmRKSC_m:
 1473|   699M|  static size_t hash_with_seed(const T& value, size_t seed) {
 1474|   699M|    return static_cast<size_t>(combine(MixingHashState{seed}, value).state_);
 1475|   699M|  }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal13HashStateBaseINS1_15MixingHashStateEE7combineIPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEJEEES3_S3_RKT_DpRKT0_:
 1598|   699M|H HashStateBase<H>::combine(H state, const T& value, const Ts&... values) {
 1599|   699M|  return H::combine(hash_internal::HashSelect::template Apply<T>::Invoke(
 1600|   699M|                        std::move(state), value),
 1601|   699M|                    values...);
 1602|   699M|}
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal10HashSelect14HashValueProbe6InvokeINS1_15MixingHashStateEPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEENSt3__19enable_ifIXsr3stdE9is_same_vIT_DTcl13AbslHashValueclsr3stdE4movefp_Efp0_EEEESE_E4typeESE_RKT0_:
 1376|   699M|        H> {
 1377|   699M|      return AbslHashValue(std::move(state), value);
 1378|   699M|    }
unigram_model.cc:_ZN4absl12lts_2026081713hash_internal13AbslHashValueINS1_15MixingHashStateEPKN13sentencepiece7unigram12_GLOBAL__N_110HypothesisEEENSt3__19enable_ifIXsr3stdE12is_pointer_vIT0_EET_E4typeESD_SC_:
  541|   699M|std::enable_if_t<std::is_pointer_v<T>, H> AbslHashValue(H hash_state, T ptr) {
  542|   699M|  auto v = reinterpret_cast<uintptr_t>(ptr);
  543|       |  // Due to alignment, pointers tend to have low bits as zero, and the next few
  544|       |  // bits follow a pattern since they are also multiples of some base value.
  545|       |  // The PointerAlignment test verifies that our mixing is good enough to handle
  546|       |  // these cases.
  547|   699M|  return H::combine(std::move(hash_state), v);
  548|   699M|}

_ZN4absl12lts_2026081711MinLogLevelEv:
   87|  5.85k|absl::LogSeverityAtLeast MinLogLevel() {
   88|  5.85k|  return static_cast<absl::LogSeverityAtLeast>(
   89|  5.85k|      min_log_level.load(std::memory_order_acquire));
   90|  5.85k|}
_ZN4absl12lts_2026081715StderrThresholdEv:
  109|  5.85k|absl::LogSeverityAtLeast StderrThreshold() {
  110|  5.85k|  return static_cast<absl::LogSeverityAtLeast>(
  111|  5.85k|      stderrthreshold.load(std::memory_order_acquire));
  112|  5.85k|}
_ZN4absl12lts_2026081722ShouldPrependLogPrefixEv:
  168|  5.85k|bool ShouldPrependLogPrefix() {
  169|  5.85k|  return prepend_log_prefix.load(std::memory_order_acquire);
  170|  5.85k|}

_ZN4absl12lts_2026081712log_internal15AppendTruncatedENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEERNS0_4SpanIcEE:
   32|  57.2k|inline size_t AppendTruncated(absl::string_view src, absl::Span<char> &dst) {
   33|  57.2k|  if (src.size() > dst.size()) src = src.substr(0, dst.size());
  ------------------
  |  Branch (33:7): [True: 0, False: 57.2k]
  ------------------
   34|  57.2k|  memcpy(dst.data(), src.data(), src.size());
   35|  57.2k|  dst.remove_prefix(src.size());
   36|  57.2k|  return src.size();
   37|  57.2k|}

_ZN4absl12lts_2026081712log_internal21GetReferenceableValueEm:
  544|  1.31M|constexpr unsigned long GetReferenceableValue(unsigned long t) { return t; }
_ZN4absl12lts_2026081712log_internal12Check_LEImplImmEEPKcRKT_RKT0_S4_:
  489|   656k|      const T1& v1, const T2& v2, const char* absl_nonnull exprtext) {     \
  490|   656k|    using U1 = CheckOpStreamType<T1, T2>;                                  \
  491|   656k|    using U2 = CheckOpStreamType<T2, T1>;                                  \
  492|   656k|    return ABSL_PREDICT_TRUE(v1 op v2)                                     \
  ------------------
  |  |  191|   656k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 656k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 656k]
  |  |  |  Branch (191:57): [True: 656k, False: 0]
  |  |  ------------------
  ------------------
  493|   656k|               ? nullptr                                                   \
  494|   656k|               : ABSL_LOG_INTERNAL_CHECK_OP_IMPL_RESULT(U1, U2, U1(v1),    \
  ------------------
  |  |  479|      0|  MakeCheckOpString<U1, U2>(v1, v2, exprtext)
  ------------------
  495|   656k|                                                        U2(v2), exprtext); \
  496|   656k|  }                                                                        \

_ZN4absl12lts_2026081712log_internal13IsInitializedEv:
   54|  11.7k|bool IsInitialized() {
   55|  11.7k|  return logging_initialized.load(std::memory_order_acquire);
   56|  11.7k|}
_ZN4absl12lts_2026081712log_internal13WriteToStderrENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEENS0_11LogSeverityE:
   62|  5.85k|void WriteToStderr(absl::string_view message, absl::LogSeverity severity) {
   63|  5.85k|  if (message.empty()) return;
  ------------------
  |  Branch (63:7): [True: 0, False: 5.85k]
  ------------------
   64|       |#if defined(__EMSCRIPTEN__)
   65|       |  // In WebAssembly, bypass filesystem emulation via fwrite.
   66|       |  // Skip a trailing newline character as emscripten_errn adds one itself.
   67|       |  const auto message_minus_newline = absl::StripSuffix(message, "\n");
   68|       |  // emscripten_errn was introduced in 3.1.41 but broken in standalone mode
   69|       |  // until 3.1.43.
   70|       |#if ABSL_INTERNAL_EMSCRIPTEN_VERSION >= 3001043
   71|       |  emscripten_errn(message_minus_newline.data(), message_minus_newline.size());
   72|       |#else
   73|       |  std::string null_terminated_message(message_minus_newline);
   74|       |  _emscripten_err(null_terminated_message.c_str());
   75|       |#endif
   76|       |#else
   77|       |  // Avoid using std::cerr from this module since we may get called during
   78|       |  // exit code, and cerr may be partially or fully destroyed by then.
   79|  5.85k|  std::fwrite(message.data(), message.size(), 1, stderr);
   80|  5.85k|#endif
   81|       |
   82|       |#if defined(_WIN64) || defined(_WIN32) || defined(_WIN16)
   83|       |  // C99 requires stderr to not be fully-buffered by default (7.19.3.7), but
   84|       |  // MS CRT buffers it anyway, so we must `fflush` to ensure the string hits
   85|       |  // the console/file before the program dies (and takes the libc buffers
   86|       |  // with it).
   87|       |  // https://docs.microsoft.com/en-us/cpp/c-runtime-library/stream-i-o
   88|       |  if (severity >= absl::LogSeverity::kWarning) {
   89|       |    std::fflush(stderr);
   90|       |  }
   91|       |#else
   92|       |  // Avoid unused parameter warning in this branch.
   93|  5.85k|  (void)severity;
   94|  5.85k|#endif
   95|  5.85k|}
_ZN4absl12lts_2026081712log_internal8TimeZoneEv:
  109|  5.85k|const absl::TimeZone* TimeZone() {
  110|  5.85k|  return timezone_ptr.load(std::memory_order_acquire);
  111|  5.85k|}

_ZN4absl12lts_2026081712log_internal15FormatLogPrefixENS0_11LogSeverityENS0_4TimeEiNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiNS1_12PrefixFormatERNS0_4SpanIcEE:
  194|  5.85k|                       int line, PrefixFormat format, absl::Span<char>& buf) {
  195|  5.85k|  auto prefix_size = FormatBoundedFields(severity, timestamp, tid, buf);
  196|  5.85k|  prefix_size += log_internal::AppendTruncated(basename, buf);
  197|  5.85k|  prefix_size += FormatLineNumber(line, buf);
  198|  5.85k|  if (format == PrefixFormat::kRaw)
  ------------------
  |  Branch (198:7): [True: 0, False: 5.85k]
  ------------------
  199|      0|    prefix_size += log_internal::AppendTruncated("RAW: ", buf);
  200|  5.85k|  return prefix_size;
  201|  5.85k|}
log_format.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_119FormatBoundedFieldsENS0_11LogSeverityENS0_4TimeEiRNS0_4SpanIcEE:
   78|  5.85k|                           log_internal::Tid tid, absl::Span<char>& buf) {
   79|  5.85k|  constexpr size_t kBoundedFieldsMaxLen =
   80|  5.85k|      sizeof("SMMDD HH:MM:SS.NNNNNN  ") +
   81|  5.85k|      (1 + std::numeric_limits<log_internal::Tid>::digits10 + 1) - sizeof("");
   82|  5.85k|  if (ABSL_PREDICT_FALSE(buf.size() < kBoundedFieldsMaxLen)) {
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
   83|       |    // We don't bother trying to truncate these fields if the buffer is too
   84|       |    // short (or almost too short) because it would require doing a lot more
   85|       |    // length checking (slow) and it should never happen.  A 15kB buffer should
   86|       |    // be enough for anyone.  Instead we mark `buf` full without writing
   87|       |    // anything.
   88|      0|    buf.remove_suffix(buf.size());
   89|      0|    return 0;
   90|      0|  }
   91|       |
   92|       |  // We can't call absl::LocalTime(), localtime_r(), or anything else here that
   93|       |  // isn't async-signal-safe. We can only use the time zone if it has already
   94|       |  // been loaded.
   95|  5.85k|  const absl::TimeZone* tz = absl::log_internal::TimeZone();
   96|  5.85k|  if (ABSL_PREDICT_FALSE(tz == nullptr)) {
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 5.85k, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 5.85k, False: 0]
  |  |  ------------------
  ------------------
   97|       |    // If a time zone hasn't been set yet because we are logging before the
   98|       |    // logging library has been initialized, we fallback to a simpler, slower
   99|       |    // method. Just report the raw Unix time in seconds. We cram this into the
  100|       |    // normal time format for the benefit of parsers.
  101|  5.85k|    auto tv = absl::ToTimeval(timestamp);
  102|  5.85k|    int snprintf_result = absl::SNPrintF(
  103|  5.85k|        buf.data(), buf.size(), "%c0000 00:00:%02d.%06d %7d ",
  104|  5.85k|        absl::LogSeverityName(severity)[0], static_cast<int>(tv.tv_sec),
  105|  5.85k|        static_cast<int>(tv.tv_usec), static_cast<int>(tid));
  106|  5.85k|    if (snprintf_result >= 0) {
  ------------------
  |  Branch (106:9): [True: 5.85k, False: 0]
  ------------------
  107|  5.85k|      buf.remove_prefix(static_cast<size_t>(snprintf_result));
  108|  5.85k|      return static_cast<size_t>(snprintf_result);
  109|  5.85k|    }
  110|      0|    return 0;
  111|  5.85k|  }
  112|       |
  113|      0|  char* p = buf.data();
  114|      0|  *p++ = absl::LogSeverityName(severity)[0];
  115|      0|  const absl::TimeZone::CivilInfo ci = tz->At(timestamp);
  116|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(ci.cs.month()), p);
  117|      0|  p += 2;
  118|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(ci.cs.day()), p);
  119|      0|  p += 2;
  120|      0|  *p++ = ' ';
  121|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(ci.cs.hour()), p);
  122|      0|  p += 2;
  123|      0|  *p++ = ':';
  124|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(ci.cs.minute()),
  125|      0|                                       p);
  126|      0|  p += 2;
  127|      0|  *p++ = ':';
  128|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(ci.cs.second()),
  129|      0|                                       p);
  130|      0|  p += 2;
  131|      0|  *p++ = '.';
  132|      0|  const int64_t usecs = absl::ToInt64Microseconds(ci.subsecond);
  133|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(usecs / 10000), p);
  134|      0|  p += 2;
  135|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(usecs / 100 % 100),
  136|      0|                                       p);
  137|      0|  p += 2;
  138|      0|  absl::numbers_internal::PutTwoDigits(static_cast<uint32_t>(usecs % 100), p);
  139|      0|  p += 2;
  140|      0|  *p++ = ' ';
  141|      0|  PutLeadingWhitespace(tid, p);
  142|      0|  p = absl::numbers_internal::FastIntToBuffer(tid, p);
  143|      0|  *p++ = ' ';
  144|      0|  const size_t bytes_formatted = static_cast<size_t>(p - buf.data());
  145|      0|  buf.remove_prefix(bytes_formatted);
  146|      0|  return bytes_formatted;
  147|  5.85k|}
log_format.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116FormatLineNumberEiRNS0_4SpanIcEE:
  149|  5.85k|size_t FormatLineNumber(int line, absl::Span<char>& buf) {
  150|  5.85k|  constexpr size_t kLineFieldMaxLen =
  151|  5.85k|      sizeof(":] ") + (1 + std::numeric_limits<int>::digits10 + 1) - sizeof("");
  152|  5.85k|  if (ABSL_PREDICT_FALSE(buf.size() < kLineFieldMaxLen)) {
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
  153|       |    // As above, we don't bother trying to truncate this if the buffer is too
  154|       |    // short and it should never happen.
  155|      0|    buf.remove_suffix(buf.size());
  156|      0|    return 0;
  157|      0|  }
  158|  5.85k|  char* p = buf.data();
  159|  5.85k|  *p++ = ':';
  160|  5.85k|  p = absl::numbers_internal::FastIntToBuffer(line, p);
  161|  5.85k|  *p++ = ']';
  162|  5.85k|  *p++ = ' ';
  163|  5.85k|  const size_t bytes_formatted = static_cast<size_t>(p - buf.data());
  164|  5.85k|  buf.remove_prefix(bytes_formatted);
  165|  5.85k|  return bytes_formatted;
  166|  5.85k|}

_ZN4absl12lts_2026081712log_internal10LogMessage19CopyToEncodedBufferILNS2_10StringTypeE0EEEvNSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
  607|  28.6k|void LogMessage::CopyToEncodedBuffer(absl::string_view str) {
  608|  28.6k|  auto encoded_remaining_copy = data_->encoded_remaining();
  609|  28.6k|  constexpr uint8_t tag_value = str_type == StringType::kLiteral
  ------------------
  |  Branch (609:33): [True: 0, Folded]
  ------------------
  610|  28.6k|                                    ? ValueTag::kStringLiteral
  611|  28.6k|                                    : ValueTag::kString;
  612|  28.6k|  auto start = EncodeMessageStart(
  613|  28.6k|      EventTag::kValue,
  614|  28.6k|      BufferSizeFor(tag_value, WireType::kLengthDelimited) + str.size(),
  615|  28.6k|      &encoded_remaining_copy);
  616|       |  // If the `logging.proto.Event.value` field header did not fit,
  617|       |  // `EncodeMessageStart` will have zeroed `encoded_remaining_copy`'s size and
  618|       |  // `EncodeStringTruncate` will fail too.
  619|  28.6k|  if (EncodeStringTruncate(tag_value, str, &encoded_remaining_copy)) {
  ------------------
  |  Branch (619:7): [True: 28.6k, False: 0]
  ------------------
  620|       |    // The string may have been truncated, but the field header fit.
  621|  28.6k|    EncodeMessageLength(start, &encoded_remaining_copy);
  622|  28.6k|    data_->encoded_remaining() = encoded_remaining_copy;
  623|  28.6k|  } else {
  624|       |    // The field header(s) did not fit; zero `encoded_remaining()` so we don't
  625|       |    // write anything else later.
  626|      0|    data_->encoded_remaining().remove_suffix(data_->encoded_remaining().size());
  627|      0|  }
  628|  28.6k|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageDataC2ENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEiNS0_11LogSeverityENS0_4TimeE:
  206|  5.85k|    : extra_sinks_only(false), manipulated(nullptr) {
  207|       |  // Legacy defaults for LOG's ostream:
  208|  5.85k|  manipulated.setf(std::ios_base::showbase | std::ios_base::boolalpha);
  209|  5.85k|  entry.full_filename_ = file;
  210|  5.85k|  entry.base_filename_ = Basename(file);
  211|  5.85k|  entry.line_ = line;
  212|  5.85k|  entry.prefix_ = absl::ShouldPrependLogPrefix();
  213|  5.85k|  entry.severity_ = absl::NormalizeLogSeverity(severity);
  214|  5.85k|  entry.verbose_level_ = absl::LogEntry::kNoVerbosityLevel;
  215|  5.85k|  entry.timestamp_ = timestamp;
  216|  5.85k|  entry.tid_ = absl::base_internal::GetCachedTID();
  217|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageData27InitializeEncodingAndFormatEv:
  219|  5.85k|void LogMessage::LogMessageData::InitializeEncodingAndFormat() {
  220|  5.85k|  EncodeStringTruncate(EventTag::kFileName, entry.source_filename(),
  221|  5.85k|                       &encoded_remaining());
  222|  5.85k|  EncodeVarint(EventTag::kFileLine, entry.source_line(), &encoded_remaining());
  223|  5.85k|  EncodeVarint(EventTag::kTimeNsecs, absl::ToUnixNanos(entry.timestamp()),
  224|  5.85k|               &encoded_remaining());
  225|  5.85k|  EncodeVarint(EventTag::kSeverity,
  226|  5.85k|               ProtoSeverity(entry.log_severity(), entry.verbosity()),
  227|  5.85k|               &encoded_remaining());
  228|  5.85k|  EncodeVarint(EventTag::kThreadId, static_cast<uint64_t>(entry.tid()),
  229|  5.85k|               &encoded_remaining());
  230|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageData25FinalizeEncodingAndFormatEv:
  232|  5.85k|void LogMessage::LogMessageData::FinalizeEncodingAndFormat() {
  233|       |  // Note that `encoded_remaining()` may have zero size without pointing past
  234|       |  // the end of `encoded_buf`, so the difference between `data()` pointers is
  235|       |  // used to compute the size of `encoded_data`.
  236|  5.85k|  absl::Span<const char> encoded_data(
  237|  5.85k|      encoded_buf.data(),
  238|  5.85k|      static_cast<size_t>(encoded_remaining().data() - encoded_buf.data()));
  239|       |  // `string_remaining` is the suffix of `string_buf` that has not been filled
  240|       |  // yet.
  241|  5.85k|  absl::Span<char> string_remaining(string_buf);
  242|       |  // We may need to write a newline and nul-terminator at the end of the decoded
  243|       |  // string data.  Rather than worry about whether those should overwrite the
  244|       |  // end of the string (if the buffer is full) or be appended, we avoid writing
  245|       |  // into the last two bytes so we always have space to append.
  246|  5.85k|  string_remaining.remove_suffix(2);
  247|  5.85k|  entry.prefix_len_ =
  248|  5.85k|      entry.prefix() ? log_internal::FormatLogPrefix(
  ------------------
  |  Branch (248:7): [True: 5.85k, False: 0]
  ------------------
  249|  5.85k|                           entry.log_severity(), entry.timestamp(), entry.tid(),
  250|  5.85k|                           entry.source_basename(), entry.source_line(),
  251|  5.85k|                           log_internal::ThreadIsLoggingToLogSink()
  ------------------
  |  Branch (251:28): [True: 0, False: 5.85k]
  ------------------
  252|  5.85k|                               ? PrefixFormat::kRaw
  253|  5.85k|                               : PrefixFormat::kNotRaw,
  254|  5.85k|                           string_remaining)
  255|  5.85k|                     : 0;
  256|       |  // Decode data from `encoded_buf` until we run out of data or we run out of
  257|       |  // `string_remaining`.
  258|  5.85k|  ProtoField field;
  259|  86.5k|  while (field.DecodeFrom(&encoded_data)) {
  ------------------
  |  Branch (259:10): [True: 80.6k, False: 5.85k]
  ------------------
  260|  80.6k|    switch (field.tag()) {
  ------------------
  |  Branch (260:13): [True: 51.3k, False: 29.2k]
  ------------------
  261|  51.3k|      case EventTag::kValue:
  ------------------
  |  Branch (261:7): [True: 51.3k, False: 29.2k]
  ------------------
  262|  51.3k|        if (field.type() != WireType::kLengthDelimited) continue;
  ------------------
  |  Branch (262:13): [True: 0, False: 51.3k]
  ------------------
  263|  51.3k|        if (PrintValue(string_remaining, field.bytes_value())) continue;
  ------------------
  |  Branch (263:13): [True: 51.3k, False: 0]
  ------------------
  264|      0|        break;
  265|  80.6k|    }
  266|  80.6k|  }
  267|  5.85k|  auto chars_written =
  268|  5.85k|      static_cast<size_t>(string_remaining.data() - string_buf.data());
  269|  5.85k|    string_buf[chars_written++] = '\n';
  270|  5.85k|  string_buf[chars_written++] = '\0';
  271|  5.85k|  entry.text_message_with_prefix_and_newline_and_nul_ =
  272|  5.85k|      absl::MakeSpan(string_buf).subspan(0, chars_written);
  273|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessageC2EPKciNS0_11LogSeverityE:
  277|  5.85k|  : LogMessage(absl::string_view(file), line, severity) {}
_ZN4absl12lts_2026081712log_internal10LogMessageC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEiNS0_11LogSeverityE:
  281|  5.85k|          std::make_unique<LogMessageData>(file, line, severity, absl::Now())) {
  282|  5.85k|  data_->first_fatal = false;
  283|  5.85k|  data_->is_perror = false;
  284|  5.85k|  data_->fail_quietly = false;
  285|       |
  286|       |  // This logs a backtrace even if the location is subsequently changed using
  287|       |  // AtLocation.  This quirk, and the behavior when AtLocation is called twice,
  288|       |  // are fixable but probably not worth fixing.
  289|  5.85k|  LogBacktraceIfNeeded();
  290|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessageC2EPKciNS2_10WarningTagE:
  295|  5.85k|    : LogMessage(file, line, absl::LogSeverity::kWarning) {}
_ZN4absl12lts_2026081712log_internal10LogMessageD2Ev:
  300|  5.85k|LogMessage::~LogMessage() = default;
_ZN4absl12lts_2026081712log_internal10LogMessage5FlushEv:
  470|  5.85k|void LogMessage::Flush() {
  471|  5.85k|  if (data_->entry.log_severity() < absl::MinLogLevel()) return;
  ------------------
  |  Branch (471:7): [True: 0, False: 5.85k]
  ------------------
  472|       |
  473|  5.85k|  if (data_->is_perror) {
  ------------------
  |  Branch (473:7): [True: 0, False: 5.85k]
  ------------------
  474|      0|    InternalStream() << ": " << absl::base_internal::StrError(errno_saver_())
  475|      0|                     << " [" << errno_saver_() << "]";
  476|      0|  }
  477|       |
  478|       |  // Have we already seen a fatal message?
  479|  5.85k|  ABSL_CONST_INIT static std::atomic<bool> seen_fatal(false);
  ------------------
  |  |  847|  5.85k|#define ABSL_CONST_INIT constinit
  ------------------
  480|  5.85k|  if (data_->entry.log_severity() == absl::LogSeverity::kFatal &&
  ------------------
  |  Branch (480:7): [True: 0, False: 5.85k]
  ------------------
  481|      0|      absl::log_internal::ExitOnDFatal()) {
  ------------------
  |  Branch (481:7): [True: 0, False: 0]
  ------------------
  482|       |    // Exactly one LOG(FATAL) message is responsible for aborting the process,
  483|       |    // even if multiple threads LOG(FATAL) concurrently.
  484|      0|    bool expected_seen_fatal = false;
  485|      0|    if (seen_fatal.compare_exchange_strong(expected_seen_fatal, true,
  ------------------
  |  Branch (485:9): [True: 0, False: 0]
  ------------------
  486|      0|                                           std::memory_order_relaxed)) {
  487|      0|      data_->first_fatal = true;
  488|      0|    }
  489|      0|  }
  490|       |
  491|  5.85k|  data_->FinalizeEncodingAndFormat();
  492|  5.85k|  data_->entry.encoding_ =
  493|  5.85k|      absl::string_view(data_->encoded_buf.data(),
  494|  5.85k|                        static_cast<size_t>(data_->encoded_remaining().data() -
  495|  5.85k|                                            data_->encoded_buf.data()));
  496|  5.85k|  SendToLog();
  497|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessage11OstreamViewC2ERNS2_14LogMessageDataE:
  502|  22.7k|    : data_(message_data), encoded_remaining_copy_(data_.encoded_remaining()) {
  503|       |  // This constructor sets the `streambuf` up so that streaming into an attached
  504|       |  // ostream encodes string data in-place.  To do that, we write appropriate
  505|       |  // headers into the buffer using a copy of the buffer view so that we can
  506|       |  // decide not to keep them later if nothing is ever streamed in.  We don't
  507|       |  // know how much data we'll get, but we can use the size of the remaining
  508|       |  // buffer as an upper bound and fill in the right size once we know it.
  509|  22.7k|  message_start_ =
  510|  22.7k|      EncodeMessageStart(EventTag::kValue, encoded_remaining_copy_.size(),
  511|  22.7k|                         &encoded_remaining_copy_);
  512|  22.7k|  string_start_ =
  513|  22.7k|      EncodeMessageStart(ValueTag::kString, encoded_remaining_copy_.size(),
  514|  22.7k|                         &encoded_remaining_copy_);
  515|  22.7k|  setp(encoded_remaining_copy_.data(),
  516|  22.7k|       encoded_remaining_copy_.data() + encoded_remaining_copy_.size());
  517|  22.7k|  data_.manipulated.rdbuf(this);
  518|  22.7k|}
_ZN4absl12lts_2026081712log_internal10LogMessage11OstreamViewD2Ev:
  520|  22.7k|LogMessage::OstreamView::~OstreamView() {
  521|  22.7k|  data_.manipulated.rdbuf(nullptr);
  522|  22.7k|  if (!string_start_.data()) {
  ------------------
  |  Branch (522:7): [True: 0, False: 22.7k]
  ------------------
  523|       |    // The second field header didn't fit.  Whether the first one did or not, we
  524|       |    // shouldn't commit `encoded_remaining_copy_`, and we also need to zero the
  525|       |    // size of `data_->encoded_remaining()` so that no more data are encoded.
  526|      0|    data_.encoded_remaining().remove_suffix(data_.encoded_remaining().size());
  527|      0|    return;
  528|      0|  }
  529|  22.7k|  const absl::Span<const char> contents(pbase(),
  530|  22.7k|                                        static_cast<size_t>(pptr() - pbase()));
  531|  22.7k|  if (contents.empty()) return;
  ------------------
  |  Branch (531:7): [True: 0, False: 22.7k]
  ------------------
  532|  22.7k|  encoded_remaining_copy_.remove_prefix(contents.size());
  533|  22.7k|  EncodeMessageLength(string_start_, &encoded_remaining_copy_);
  534|  22.7k|  EncodeMessageLength(message_start_, &encoded_remaining_copy_);
  535|  22.7k|  data_.encoded_remaining() = encoded_remaining_copy_;
  536|  22.7k|}
_ZN4absl12lts_2026081712log_internal10LogMessage11OstreamView6streamEv:
  538|  22.7k|std::ostream& LogMessage::OstreamView::stream() { return data_.manipulated; }
_ZNK4absl12lts_2026081712log_internal10LogMessage7IsFatalEv:
  540|  11.7k|bool LogMessage::IsFatal() const {
  541|  11.7k|  return data_->entry.log_severity() == absl::LogSeverity::kFatal &&
  ------------------
  |  Branch (541:10): [True: 0, False: 11.7k]
  ------------------
  542|      0|         absl::log_internal::ExitOnDFatal();
  ------------------
  |  Branch (542:10): [True: 0, False: 0]
  ------------------
  543|  11.7k|}
_ZN4absl12lts_2026081712log_internal10LogMessage9SendToLogEv:
  579|  5.85k|void LogMessage::SendToLog() {
  580|  5.85k|  if (IsFatal()) PrepareToDie();
  ------------------
  |  Branch (580:7): [True: 0, False: 5.85k]
  ------------------
  581|       |  // Also log to all registered sinks, even if OnlyLogToStderr() is set.
  582|  5.85k|  log_internal::LogToSinks(data_->entry, absl::MakeSpan(data_->extra_sinks),
  583|  5.85k|                           data_->extra_sinks_only);
  584|  5.85k|  if (IsFatal()) Die();
  ------------------
  |  Branch (584:7): [True: 0, False: 5.85k]
  ------------------
  585|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessage20LogBacktraceIfNeededEv:
  587|  5.85k|void LogMessage::LogBacktraceIfNeeded() {
  588|  5.85k|  if (!absl::log_internal::IsInitialized()) return;
  ------------------
  |  Branch (588:7): [True: 5.85k, False: 0]
  ------------------
  589|       |
  590|      0|  if (!absl::log_internal::ShouldLogBacktraceAt(data_->entry.source_basename(),
  ------------------
  |  Branch (590:7): [True: 0, False: 0]
  ------------------
  591|      0|                                                data_->entry.source_line()))
  592|      0|    return;
  593|      0|  OstreamView view(*data_);
  594|      0|  view.stream() << " (stacktrace:\n";
  595|      0|  debugging_internal::DumpStackTrace(
  596|      0|      1, log_internal::MaxFramesInLogStackTrace(),
  597|      0|      log_internal::ShouldSymbolizeLogStackTrace(), WriteToStream,
  598|      0|      &view.stream());
  599|      0|  view.stream() << ") ";
  600|      0|}
_ZN4absl12lts_2026081712log_internal10LogMessage14LogMessageData17encoded_remainingEv:
  186|   143k|  absl::Span<char>& encoded_remaining() {
  187|   143k|    if (encoded_remaining_actual_do_not_use_directly.data() == nullptr) {
  ------------------
  |  Branch (187:9): [True: 5.85k, False: 137k]
  ------------------
  188|  5.85k|      encoded_remaining_actual_do_not_use_directly =
  189|  5.85k|          absl::MakeSpan(encoded_buf);
  190|  5.85k|      InitializeEncodingAndFormat();
  191|  5.85k|    }
  192|   143k|    return encoded_remaining_actual_do_not_use_directly;
  193|   143k|  }
log_message.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_18BasenameENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
  131|  5.85k|absl::string_view Basename(absl::string_view filepath) {
  132|       |#ifdef _WIN32
  133|       |  size_t path = filepath.find_last_of("/\\");
  134|       |#else
  135|  5.85k|  size_t path = filepath.find_last_of('/');
  136|  5.85k|#endif
  137|  5.85k|  if (path != filepath.npos) filepath.remove_prefix(path + 1);
  ------------------
  |  Branch (137:7): [True: 5.85k, False: 0]
  ------------------
  138|  5.85k|  return filepath;
  139|  5.85k|}
log_message.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_113ProtoSeverityENS0_11LogSeverityEi:
  115|  5.85k|int32_t ProtoSeverity(absl::LogSeverity severity, int verbose_level) {
  116|  5.85k|  switch (severity) {
  117|      0|    case absl::LogSeverity::kInfo:
  ------------------
  |  Branch (117:5): [True: 0, False: 5.85k]
  ------------------
  118|      0|      if (verbose_level == absl::LogEntry::kNoVerbosityLevel) return 800;
  ------------------
  |  Branch (118:11): [True: 0, False: 0]
  ------------------
  119|      0|      return 600 - verbose_level;
  120|  5.85k|    case absl::LogSeverity::kWarning:
  ------------------
  |  Branch (120:5): [True: 5.85k, False: 0]
  ------------------
  121|  5.85k|      return 900;
  122|      0|    case absl::LogSeverity::kError:
  ------------------
  |  Branch (122:5): [True: 0, False: 5.85k]
  ------------------
  123|      0|      return 950;
  124|      0|    case absl::LogSeverity::kFatal:
  ------------------
  |  Branch (124:5): [True: 0, False: 5.85k]
  ------------------
  125|      0|      return 1100;
  126|      0|    default:
  ------------------
  |  Branch (126:5): [True: 0, False: 5.85k]
  ------------------
  127|      0|      return 800;
  128|  5.85k|  }
  129|  5.85k|}
log_message.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_110PrintValueERNS0_4SpanIcEENS3_IKcEE:
   98|  51.3k|bool PrintValue(absl::Span<char>& dst, absl::Span<const char> buf) {
   99|  51.3k|  if (dst.size() <= 1) return false;
  ------------------
  |  Branch (99:7): [True: 0, False: 51.3k]
  ------------------
  100|  51.3k|  ProtoField field;
  101|   102k|  while (field.DecodeFrom(&buf)) {
  ------------------
  |  Branch (101:10): [True: 51.3k, False: 51.3k]
  ------------------
  102|  51.3k|    switch (field.tag()) {
  ------------------
  |  Branch (102:13): [True: 51.3k, False: 0]
  ------------------
  103|  22.7k|      case ValueTag::kString:
  ------------------
  |  Branch (103:7): [True: 22.7k, False: 28.6k]
  ------------------
  104|  51.3k|      case ValueTag::kStringLiteral:
  ------------------
  |  Branch (104:7): [True: 28.6k, False: 22.7k]
  ------------------
  105|  51.3k|        if (field.type() == WireType::kLengthDelimited)
  ------------------
  |  Branch (105:13): [True: 51.3k, False: 0]
  ------------------
  106|  51.3k|          if (log_internal::AppendTruncated(field.string_value(), dst) <
  ------------------
  |  Branch (106:15): [True: 0, False: 51.3k]
  ------------------
  107|  51.3k|              field.string_value().size())
  108|      0|            return false;
  109|  51.3k|    }
  110|  51.3k|  }
  111|  51.3k|  return true;
  112|  51.3k|}

_ZN4absl12lts_2026081712log_internal10LogMessage14InternalStreamEv:
  124|  5.85k|  LogMessage& InternalStream() { return *this; }
_ZN4absl12lts_2026081712log_internal10LogMessagelsEi:
  139|  5.85k|  LogMessage& operator<<(signed int v) { return operator<< <signed int>(v); }
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi24EEERS2_RAT__Kc:
  364|    181|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|    181|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|    181|  return *this;
  367|    181|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsEm:
  152|  16.8k|  LogMessage& operator<<(unsigned long v) {
  153|  16.8k|    return operator<< <unsigned long>(v);
  154|  16.8k|  }
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi2EEERS2_RAT__Kc:
  364|  5.57k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  5.57k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  5.57k|  return *this;
  367|  5.57k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi21EEERS2_RAT__Kc:
  364|  11.1k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  11.1k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  11.1k|  return *this;
  367|  11.1k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi28EEERS2_RAT__Kc:
  364|    181|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|    181|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|    181|  return *this;
  367|    181|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi37EEERS2_RAT__Kc:
  364|    286|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|    286|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|    286|  return *this;
  367|    286|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi40EEERS2_RAT__Kc:
  364|    105|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|    105|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|    105|  return *this;
  367|    105|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi18EEERS2_RAT__Kc:
  364|  5.57k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  5.57k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  5.57k|  return *this;
  367|  5.57k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsILi11EEERS2_RAT__Kc:
  364|  5.57k|LogMessage& LogMessage::operator<<(const char (&buf)[SIZE]) {
  365|  5.57k|  CopyToEncodedBuffer<StringType::kLiteral>(buf);
  366|  5.57k|  return *this;
  367|  5.57k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsIiEERS2_RKT_:
  351|  5.85k|LogMessage& LogMessage::operator<<(const T& v) {
  352|       |  if constexpr (absl::HasAbslStringify<T>::value) {
  353|       |    StringifySink sink(*this);
  354|       |    // Replace with public API.
  355|       |    AbslStringify(sink, v);
  356|  5.85k|  } else {
  357|  5.85k|    OstreamView view(*data_);
  358|  5.85k|    view.stream() << log_internal::NullGuard<T>().Guard(v);
  359|  5.85k|  }
  360|  5.85k|  return *this;
  361|  5.85k|}
_ZN4absl12lts_2026081712log_internal10LogMessagelsImEERS2_RKT_:
  351|  16.8k|LogMessage& LogMessage::operator<<(const T& v) {
  352|       |  if constexpr (absl::HasAbslStringify<T>::value) {
  353|       |    StringifySink sink(*this);
  354|       |    // Replace with public API.
  355|       |    AbslStringify(sink, v);
  356|  16.8k|  } else {
  357|  16.8k|    OstreamView view(*data_);
  358|  16.8k|    view.stream() << log_internal::NullGuard<T>().Guard(v);
  359|  16.8k|  }
  360|  16.8k|  return *this;
  361|  16.8k|}

_ZN4absl12lts_2026081712log_internal24ThreadIsLoggingToLogSinkEv:
  277|  11.7k|bool ThreadIsLoggingToLogSink() { return ThreadIsLoggingStatus(); }
_ZN4absl12lts_2026081712log_internal10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEb:
  280|  5.85k|                absl::Span<absl::LogSink*> extra_sinks, bool extra_sinks_only) {
  281|  5.85k|  log_internal::GlobalSinks().LogToSinks(entry, extra_sinks, extra_sinks_only);
  282|  5.85k|}
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_121ThreadIsLoggingStatusEv:
   58|  23.4k|bool& ThreadIsLoggingStatus() {
   59|  23.4k|#ifdef ABSL_HAVE_THREAD_LOCAL
   60|  23.4k|  ABSL_CONST_INIT thread_local bool thread_is_logging = false;
  ------------------
  |  |  847|  23.4k|#define ABSL_CONST_INIT constinit
  ------------------
   61|  23.4k|  return thread_is_logging;
   62|       |#else
   63|       |  ABSL_CONST_INIT static pthread_key_t thread_is_logging_key;
   64|       |  static const bool unused = [] {
   65|       |    if (pthread_key_create(&thread_is_logging_key, [](void* data) {
   66|       |          delete reinterpret_cast<bool*>(data);
   67|       |        })) {
   68|       |      perror("pthread_key_create failed!");
   69|       |      abort();
   70|       |    }
   71|       |    return true;
   72|       |  }();
   73|       |  (void)unused;  // Fixes -wunused-variable warning
   74|       |  bool* thread_is_logging_ptr =
   75|       |      reinterpret_cast<bool*>(pthread_getspecific(thread_is_logging_key));
   76|       |
   77|       |  if (ABSL_PREDICT_FALSE(!thread_is_logging_ptr)) {
   78|       |    thread_is_logging_ptr = new bool{false};
   79|       |    if (pthread_setspecific(thread_is_logging_key, thread_is_logging_ptr)) {
   80|       |      perror("pthread_setspecific failed");
   81|       |      abort();
   82|       |    }
   83|       |  }
   84|       |  return *thread_is_logging_ptr;
   85|       |#endif
   86|  23.4k|}
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_111GlobalSinksEv:
  270|  5.85k|GlobalLogSinkSet& GlobalSinks() {
  271|  5.85k|  static absl::NoDestructor<GlobalLogSinkSet> global_sinks;
  272|  5.85k|  return *global_sinks;
  273|  5.85k|}
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSetC2Ev:
  168|      1|  GlobalLogSinkSet() {
  169|       |#if defined(__myriad2__) || defined(__Fuchsia__)
  170|       |    // myriad2 and Fuchsia do not log to stderr by default.
  171|       |#else
  172|      1|    static absl::NoDestructor<StderrLogSink> stderr_log_sink;
  173|      1|    AddLogSink(stderr_log_sink.get());
  174|      1|#endif
  175|       |#ifdef __ANDROID__
  176|       |    static absl::NoDestructor<AndroidLogSink> android_log_sink;
  177|       |    AddLogSink(android_log_sink.get());
  178|       |#endif
  179|       |#if defined(_WIN32)
  180|       |    static absl::NoDestructor<WindowsDebuggerLogSink> debugger_log_sink;
  181|       |    AddLogSink(debugger_log_sink.get());
  182|       |#endif  // !defined(_WIN32)
  183|      1|  }
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_113StderrLogSink4SendERKNS0_8LogEntryE:
   92|  5.85k|  void Send(const absl::LogEntry& entry) override {
   93|  5.85k|    if (entry.log_severity() < absl::StderrThreshold() &&
  ------------------
  |  Branch (93:9): [True: 5.85k, False: 0]
  ------------------
   94|  5.85k|        absl::log_internal::IsInitialized()) {
  ------------------
  |  Branch (94:9): [True: 0, False: 5.85k]
  ------------------
   95|      0|      return;
   96|      0|    }
   97|       |
   98|  5.85k|    ABSL_CONST_INIT static absl::once_flag warn_if_not_initialized;
  ------------------
  |  |  847|  5.85k|#define ABSL_CONST_INIT constinit
  ------------------
   99|  5.85k|    absl::call_once(warn_if_not_initialized, []() {
  100|  5.85k|      if (absl::log_internal::IsInitialized()) return;
  101|  5.85k|      const char w[] =
  102|  5.85k|          "WARNING: All log messages before absl::InitializeLog() is called"
  103|  5.85k|          " are written to STDERR\n";
  104|  5.85k|      absl::log_internal::WriteToStderr(w, absl::LogSeverity::kWarning);
  105|  5.85k|    });
  106|       |
  107|  5.85k|    if (!entry.stacktrace().empty()) {
  ------------------
  |  Branch (107:9): [True: 0, False: 5.85k]
  ------------------
  108|      0|      absl::log_internal::WriteToStderr(entry.stacktrace(),
  109|      0|                                        entry.log_severity());
  110|  5.85k|    } else {
  111|       |      // TODO(b/226937039): do this outside else condition once we avoid
  112|       |      // ReprintFatalMessage
  113|  5.85k|      absl::log_internal::WriteToStderr(
  114|  5.85k|          entry.text_message_with_prefix_and_newline(), entry.log_severity());
  115|  5.85k|    }
  116|  5.85k|  }
log_sink_set.cc:_ZZN4absl12lts_2026081712log_internal12_GLOBAL__N_113StderrLogSink4SendERKNS0_8LogEntryEENKUlvE_clEv:
   99|      1|    absl::call_once(warn_if_not_initialized, []() {
  100|      1|      if (absl::log_internal::IsInitialized()) return;
  ------------------
  |  Branch (100:11): [True: 0, False: 1]
  ------------------
  101|      1|      const char w[] =
  102|      1|          "WARNING: All log messages before absl::InitializeLog() is called"
  103|      1|          " are written to STDERR\n";
  104|      1|      absl::log_internal::WriteToStderr(w, absl::LogSeverity::kWarning);
  105|      1|    });
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEb:
  187|  5.85k|      ABSL_LOCKS_EXCLUDED(guard_) {
  188|  5.85k|    SendToSinks(entry, extra_sinks);
  189|       |
  190|  5.85k|    if (!extra_sinks_only) {
  ------------------
  |  Branch (190:9): [True: 5.85k, False: 0]
  ------------------
  191|  5.85k|      if (ThreadIsLoggingToLogSink()) {
  ------------------
  |  Branch (191:11): [True: 0, False: 5.85k]
  ------------------
  192|      0|        absl::log_internal::WriteToStderr(
  193|      0|            entry.text_message_with_prefix_and_newline(), entry.log_severity());
  194|  5.85k|      } else {
  195|  5.85k|        absl::ReaderMutexLock global_sinks_lock(guard_);
  196|  5.85k|        ThreadIsLoggingStatus() = true;
  197|       |        // Ensure the "thread is logging" status is reverted upon leaving the
  198|       |        // scope even in case of exceptions.
  199|  5.85k|        auto status_cleanup =
  200|  5.85k|            absl::MakeCleanup([] { ThreadIsLoggingStatus() = false; });
  201|  5.85k|        SendToSinks(entry, absl::MakeSpan(sinks_));
  202|  5.85k|      }
  203|  5.85k|    }
  204|  5.85k|  }
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSet11SendToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEE:
  258|  11.7k|                          absl::Span<absl::LogSink*> sinks) {
  259|  11.7k|    for (absl::LogSink* sink : sinks) {
  ------------------
  |  Branch (259:30): [True: 5.85k, False: 11.7k]
  ------------------
  260|  5.85k|      sink->Send(entry);
  261|  5.85k|    }
  262|  11.7k|  }
log_sink_set.cc:_ZZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSet10LogToSinksERKNS0_8LogEntryENS0_4SpanIPNS0_7LogSinkEEEbENKUlvE_clEv:
  200|  5.85k|            absl::MakeCleanup([] { ThreadIsLoggingStatus() = false; });
log_sink_set.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_116GlobalLogSinkSet10AddLogSinkEPNS0_7LogSinkE:
  206|      1|  void AddLogSink(absl::LogSink* sink) ABSL_LOCKS_EXCLUDED(guard_) {
  207|      1|    {
  208|      1|      absl::WriterMutexLock global_sinks_lock(guard_);
  209|      1|      auto pos = std::find(sinks_.begin(), sinks_.end(), sink);
  210|      1|      if (pos == sinks_.end()) {
  ------------------
  |  Branch (210:11): [True: 1, False: 0]
  ------------------
  211|      1|        sinks_.push_back(sink);
  212|      1|        return;
  213|      1|      }
  214|      1|    }
  215|      0|    ABSL_INTERNAL_LOG(FATAL, "Duplicate log sinks are not supported");
  ------------------
  |  |   76|      0|  do {                                                                    \
  |  |   77|      0|    constexpr const char* absl_raw_log_internal_filename = __FILE__;      \
  |  |   78|      0|    ::absl::raw_log_internal::internal_log_function(                      \
  |  |   79|      0|        ABSL_RAW_LOG_INTERNAL_##severity, absl_raw_log_internal_filename, \
  |  |  ------------------
  |  |  |  |  110|      0|#define ABSL_RAW_LOG_INTERNAL_FATAL ::absl::LogSeverity::kFatal
  |  |  ------------------
  |  |   80|      0|        __LINE__, message);                                               \
  |  |   81|      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]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   82|      0|  } while (0)
  |  |  ------------------
  |  |  |  Branch (82:12): [Folded, False: 0]
  |  |  ------------------
  ------------------
  216|      0|  }

_ZN4absl12lts_2026081712log_internal9NullGuardImE5GuardERKm:
   45|  16.8k|  static const T& Guard(const T& v) { return v; }
_ZN4absl12lts_2026081712log_internal9NullGuardIiE5GuardERKi:
   45|  5.85k|  static const T& Guard(const T& v) { return v; }

_ZN4absl12lts_2026081712log_internal12EncodeVarintEmmPNS0_4SpanIcEE:
   52|  23.4k|bool EncodeVarint(uint64_t tag, uint64_t value, absl::Span<char> *buf) {
   53|  23.4k|  const uint64_t tag_type = MakeTagType(tag, WireType::kVarint);
   54|  23.4k|  const size_t tag_type_size = VarintSize(tag_type);
   55|  23.4k|  const size_t value_size = VarintSize(value);
   56|  23.4k|  if (tag_type_size + value_size > buf->size()) {
  ------------------
  |  Branch (56:7): [True: 0, False: 23.4k]
  ------------------
   57|      0|    buf->remove_suffix(buf->size());
   58|      0|    return false;
   59|      0|  }
   60|  23.4k|  EncodeRawVarint(tag_type, tag_type_size, buf);
   61|  23.4k|  EncodeRawVarint(value, value_size, buf);
   62|  23.4k|  return true;
   63|  23.4k|}
_ZN4absl12lts_2026081712log_internal19EncodeBytesTruncateEmNS0_4SpanIKcEEPNS2_IcEE:
  115|  34.4k|                         absl::Span<char> *buf) {
  116|  34.4k|  const uint64_t tag_type = MakeTagType(tag, WireType::kLengthDelimited);
  117|  34.4k|  const size_t tag_type_size = VarintSize(tag_type);
  118|  34.4k|  uint64_t length = value.size();
  119|  34.4k|  const size_t length_size =
  120|  34.4k|      VarintSize(std::min<uint64_t>(length, buf->size()));
  121|  34.4k|  if (tag_type_size + length_size <= buf->size() &&
  ------------------
  |  Branch (121:7): [True: 34.4k, False: 0]
  ------------------
  122|  34.4k|      tag_type_size + length_size + value.size() > buf->size()) {
  ------------------
  |  Branch (122:7): [True: 0, False: 34.4k]
  ------------------
  123|      0|    value.remove_suffix(tag_type_size + length_size + value.size() -
  124|      0|                        buf->size());
  125|      0|    length = value.size();
  126|      0|  }
  127|  34.4k|  if (tag_type_size + length_size + value.size() > buf->size()) {
  ------------------
  |  Branch (127:7): [True: 0, False: 34.4k]
  ------------------
  128|      0|    buf->remove_suffix(buf->size());
  129|      0|    return false;
  130|      0|  }
  131|  34.4k|  EncodeRawVarint(tag_type, tag_type_size, buf);
  132|  34.4k|  EncodeRawVarint(length, length_size, buf);
  133|  34.4k|  memcpy(buf->data(), value.data(), value.size());
  134|  34.4k|  buf->remove_prefix(value.size());
  135|  34.4k|  return true;
  136|  34.4k|}
_ZN4absl12lts_2026081712log_internal18EncodeMessageStartEmmPNS0_4SpanIcEE:
  140|  74.1k|                                                  absl::Span<char> *buf) {
  141|  74.1k|  const uint64_t tag_type = MakeTagType(tag, WireType::kLengthDelimited);
  142|  74.1k|  const size_t tag_type_size = VarintSize(tag_type);
  143|  74.1k|  max_size = std::min<uint64_t>(max_size, buf->size());
  144|  74.1k|  const size_t length_size = VarintSize(max_size);
  145|  74.1k|  if (tag_type_size + length_size > buf->size()) {
  ------------------
  |  Branch (145:7): [True: 0, False: 74.1k]
  ------------------
  146|      0|    buf->remove_suffix(buf->size());
  147|      0|    return absl::Span<char>();
  148|      0|  }
  149|  74.1k|  EncodeRawVarint(tag_type, tag_type_size, buf);
  150|  74.1k|  const absl::Span<char> ret = buf->subspan(0, length_size);
  151|  74.1k|  EncodeRawVarint(0, length_size, buf);
  152|  74.1k|  return ret;
  153|  74.1k|}
_ZN4absl12lts_2026081712log_internal19EncodeMessageLengthENS0_4SpanIcEEPKS3_:
  155|  74.1k|void EncodeMessageLength(absl::Span<char> msg, const absl::Span<char> *buf) {
  156|  74.1k|  if (!msg.data()) return;
  ------------------
  |  Branch (156:7): [True: 0, False: 74.1k]
  ------------------
  157|  74.1k|  assert(buf->data() >= msg.data());
  158|  74.1k|  if (buf->data() < msg.data()) return;
  ------------------
  |  Branch (158:7): [True: 0, False: 74.1k]
  ------------------
  159|  74.1k|  EncodeRawVarint(
  160|  74.1k|      static_cast<uint64_t>(buf->data() - (msg.data() + msg.size())),
  161|  74.1k|      msg.size(), &msg);
  162|  74.1k|}
_ZN4absl12lts_2026081712log_internal10ProtoField10DecodeFromEPNS0_4SpanIKcEE:
  202|   189k|bool ProtoField::DecodeFrom(absl::Span<const char> *data) {
  203|   189k|  if (data->empty()) return false;
  ------------------
  |  Branch (203:7): [True: 57.2k, False: 132k]
  ------------------
  204|   132k|  const uint64_t tag_type = DecodeVarint(data);
  205|   132k|  tag_ = tag_type >> 3;
  206|   132k|  type_ = static_cast<WireType>(tag_type & 0x07);
  207|   132k|  switch (type_) {
  ------------------
  |  Branch (207:11): [True: 132k, False: 0]
  ------------------
  208|  23.4k|    case WireType::kVarint:
  ------------------
  |  Branch (208:5): [True: 23.4k, False: 108k]
  ------------------
  209|  23.4k|      value_ = DecodeVarint(data);
  210|  23.4k|      break;
  211|      0|    case WireType::k64Bit:
  ------------------
  |  Branch (211:5): [True: 0, False: 132k]
  ------------------
  212|      0|      value_ = Decode64Bit(data);
  213|      0|      break;
  214|   108k|    case WireType::kLengthDelimited: {
  ------------------
  |  Branch (214:5): [True: 108k, False: 23.4k]
  ------------------
  215|   108k|      value_ = DecodeVarint(data);
  216|   108k|      data_ = data->subspan(
  217|   108k|          0, static_cast<size_t>(std::min<uint64_t>(value_, data->size())));
  218|   108k|      data->remove_prefix(data_.size());
  219|   108k|      break;
  220|      0|    }
  221|      0|    case WireType::k32Bit:
  ------------------
  |  Branch (221:5): [True: 0, False: 132k]
  ------------------
  222|      0|      value_ = Decode32Bit(data);
  223|      0|      break;
  224|   132k|  }
  225|   132k|  return true;
  226|   132k|}
proto.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_115EncodeRawVarintEmmPNS0_4SpanIcEE:
   43|   338k|void EncodeRawVarint(uint64_t value, size_t size, absl::Span<char> *buf) {
   44|   825k|  for (size_t s = 0; s < size; s++) {
  ------------------
  |  Branch (44:22): [True: 487k, False: 338k]
  ------------------
   45|   487k|    (*buf)[s] = static_cast<char>((value & 0x7f) | (s + 1 == size ? 0 : 0x80));
  ------------------
  |  Branch (45:53): [True: 338k, False: 149k]
  ------------------
   46|   487k|    value >>= 7;
   47|   487k|  }
   48|   338k|  buf->remove_prefix(size);
   49|   338k|}
proto.cc:_ZN4absl12lts_2026081712log_internal12_GLOBAL__N_112DecodeVarintEPNS0_4SpanIKcEE:
  165|   264k|uint64_t DecodeVarint(absl::Span<const char> *buf) {
  166|   264k|  uint64_t value = 0;
  167|   264k|  size_t s = 0;
  168|   368k|  while (s < buf->size()) {
  ------------------
  |  Branch (168:10): [True: 368k, False: 0]
  ------------------
  169|   368k|    value |= static_cast<uint64_t>(static_cast<unsigned char>((*buf)[s]) & 0x7f)
  170|   368k|             << 7 * s;
  171|   368k|    if (!((*buf)[s++] & 0x80)) break;
  ------------------
  |  Branch (171:9): [True: 264k, False: 104k]
  ------------------
  172|   368k|  }
  173|   264k|  buf->remove_prefix(s);
  174|   264k|  return value;
  175|   264k|}

_ZNK4absl12lts_2026081712log_internal10ProtoField3tagEv:
  245|   132k|  uint64_t tag() const { return tag_; }
_ZNK4absl12lts_2026081712log_internal10ProtoField4typeEv:
  246|   102k|  WireType type() const { return type_; }
_ZNK4absl12lts_2026081712log_internal10ProtoField11bytes_valueEv:
  275|   154k|  absl::Span<const char> bytes_value() const { return data_; }
_ZNK4absl12lts_2026081712log_internal10ProtoField12string_valueEv:
  276|   102k|  absl::string_view string_value() const {
  277|   102k|    const auto data = bytes_value();
  278|   102k|    return absl::string_view(data.data(), data.size());
  279|   102k|  }
_ZN4absl12lts_2026081712log_internal12EncodeVarintEmlPNS0_4SpanIcEE:
   73|  5.85k|inline bool EncodeVarint(uint64_t tag, int64_t value, absl::Span<char> *buf) {
   74|  5.85k|  return EncodeVarint(tag, static_cast<uint64_t>(value), buf);
   75|  5.85k|}
_ZN4absl12lts_2026081712log_internal12EncodeVarintEmiPNS0_4SpanIcEE:
   79|  11.7k|inline bool EncodeVarint(uint64_t tag, int32_t value, absl::Span<char> *buf) {
   80|  11.7k|  return EncodeVarint(tag, static_cast<uint64_t>(value), buf);
   81|  11.7k|}
_ZN4absl12lts_2026081712log_internal20EncodeStringTruncateEmNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEPNS0_4SpanIcEE:
  160|  34.4k|                                 absl::Span<char> *buf) {
  161|  34.4k|  return EncodeBytesTruncate(tag, value, buf);
  162|  34.4k|}
_ZN4absl12lts_2026081712log_internal10VarintSizeEm:
  188|   682k|constexpr size_t VarintSize(uint64_t value) {
  189|   682k|  return value < 128 ? 1 : 1 + VarintSize(value >> 7);
  ------------------
  |  Branch (189:10): [True: 321k, False: 361k]
  ------------------
  190|   682k|}
_ZN4absl12lts_2026081712log_internal13MaxVarintSizeEv:
  194|  28.6k|constexpr size_t MaxVarintSize() {
  195|  28.6k|  return VarintSize((std::numeric_limits<uint64_t>::max)());
  196|  28.6k|}
_ZN4absl12lts_2026081712log_internal11MakeTagTypeEmNS1_8WireTypeE:
  202|   160k|constexpr uint64_t MakeTagType(uint64_t tag, WireType type) {
  203|   160k|  return tag << 3 | static_cast<uint64_t>(type);
  204|   160k|}
_ZN4absl12lts_2026081712log_internal13BufferSizeForEmNS1_8WireTypeE:
  212|  28.6k|constexpr size_t BufferSizeFor(uint64_t tag, WireType type) {
  213|  28.6k|  size_t buffer_size = VarintSize(MakeTagType(tag, type));
  214|  28.6k|  switch (type) {
  ------------------
  |  Branch (214:11): [True: 28.6k, False: 0]
  ------------------
  215|      0|    case WireType::kVarint:
  ------------------
  |  Branch (215:5): [True: 0, False: 28.6k]
  ------------------
  216|      0|      buffer_size += MaxVarintSize();
  217|      0|      break;
  218|      0|    case WireType::k64Bit:
  ------------------
  |  Branch (218:5): [True: 0, False: 28.6k]
  ------------------
  219|      0|      buffer_size += size_t{8};
  220|      0|      break;
  221|  28.6k|    case WireType::kLengthDelimited:
  ------------------
  |  Branch (221:5): [True: 28.6k, False: 0]
  ------------------
  222|  28.6k|      buffer_size += MaxVarintSize();
  223|  28.6k|      break;
  224|      0|    case WireType::k32Bit:
  ------------------
  |  Branch (224:5): [True: 0, False: 28.6k]
  ------------------
  225|      0|      buffer_size += size_t{4};
  226|      0|      break;
  227|  28.6k|  }
  228|  28.6k|  return buffer_size;
  229|  28.6k|}

_ZNKO4absl12lts_2026081712log_internal7VoidifyaaIRNS1_10LogMessageEEEvOT_:
   39|  5.85k|  ABSL_ATTRIBUTE_COLD void operator&&(T&& message) const&& {
   40|       |    // The dispatching of the completed `absl::LogEntry` to applicable
   41|       |    // `absl::LogSink`s happens here.
   42|  5.85k|    message.Flush();
   43|  5.85k|  }

_ZNK4absl12lts_202608178LogEntry15source_filenameEv:
   76|  5.85k|  absl::string_view source_filename() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
   77|  5.85k|    return full_filename_;
   78|  5.85k|  }
_ZNK4absl12lts_202608178LogEntry15source_basenameEv:
   79|  5.85k|  absl::string_view source_basename() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
   80|  5.85k|    return base_filename_;
   81|  5.85k|  }
_ZNK4absl12lts_202608178LogEntry11source_lineEv:
   82|  11.7k|  int source_line() const { return line_; }
_ZNK4absl12lts_202608178LogEntry6prefixEv:
   89|  5.85k|  bool prefix() const { return prefix_; }
_ZNK4absl12lts_202608178LogEntry12log_severityEv:
   95|  46.8k|  absl::LogSeverity log_severity() const { return severity_; }
_ZNK4absl12lts_202608178LogEntry9verbosityEv:
  102|  5.85k|  int verbosity() const { return verbose_level_; }
_ZNK4absl12lts_202608178LogEntry9timestampEv:
  113|  11.7k|  absl::Time timestamp() const { return timestamp_; }
_ZNK4absl12lts_202608178LogEntry3tidEv:
  122|  11.7k|  tid_t tid() const { return tid_; }
_ZNK4absl12lts_202608178LogEntry36text_message_with_prefix_and_newlineEv:
  147|  5.85k|      ABSL_ATTRIBUTE_LIFETIME_BOUND {
  148|  5.85k|    return absl::string_view(
  149|  5.85k|        text_message_with_prefix_and_newline_and_nul_.data(),
  150|  5.85k|        text_message_with_prefix_and_newline_and_nul_.size() - 1);
  151|  5.85k|  }
_ZNK4absl12lts_202608178LogEntry10stacktraceEv:
  195|  5.85k|  absl::string_view stacktrace() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
  196|  5.85k|    return stacktrace_;
  197|  5.85k|  }
_ZN4absl12lts_202608178LogEntryC2Ev:
  200|  5.85k|  LogEntry() = default;

_ZN4absl12lts_202608177LogSinkC2Ev:
   58|      1|  LogSink() = default;

_ZN4absl12lts_2026081715memory_internal9CopyRangeINSt3__19allocatorINS3_17basic_string_viewIcNS3_11char_traitsIcEEEEEEPS8_PKNS3_12basic_stringIcS7_NS4_IcEEEEEEvRT_T0_T1_SJ_:
  315|  1.54k|               InputIterator last) {
  316|  58.9M|  for (Iterator cur = destination; first != last;
  ------------------
  |  Branch (316:36): [True: 58.9M, False: 1.54k]
  ------------------
  317|  58.9M|       static_cast<void>(++cur), static_cast<void>(++first)) {
  318|  58.9M|    ABSL_INTERNAL_TRY {
  ------------------
  |  |  192|  58.9M|#define ABSL_INTERNAL_TRY try
  ------------------
  319|  58.9M|      std::allocator_traits<Allocator>::construct(alloc, std::addressof(*cur),
  320|  58.9M|                                                  *first);
  321|  58.9M|    }
  322|  58.9M|    ABSL_INTERNAL_CATCH_ANY {
  323|      0|      while (cur != destination) {
  ------------------
  |  Branch (323:14): [True: 0, False: 0]
  ------------------
  324|      0|        --cur;
  325|      0|        std::allocator_traits<Allocator>::destroy(alloc, std::addressof(*cur));
  326|      0|      }
  327|      0|      ABSL_INTERNAL_RETHROW;
  ------------------
  |  |  194|      0|#define ABSL_INTERNAL_RETHROW do { throw; } while (false)
  |  |  ------------------
  |  |  |  Branch (194:52): [Folded, False: 0]
  |  |  ------------------
  ------------------
  328|      0|    }
  329|  58.9M|  }
  330|  1.54k|}

_ZN4absl12lts_202608177uint128mLES1_:
  646|  1.04G|inline uint128& uint128::operator*=(uint128 other) {
  647|  1.04G|  *this = *this * other;
  648|  1.04G|  return *this;
  649|  1.04G|}
_ZN4absl12lts_2026081712Uint128Low64ENS0_7uint128E:
  661|  1.04G|constexpr uint64_t Uint128Low64(uint128 v) { return v.lo_; }
_ZN4absl12lts_2026081713Uint128High64ENS0_7uint128E:
  663|  1.04G|constexpr uint64_t Uint128High64(uint128 v) { return v.hi_; }
_ZNK4absl12lts_202608177uint128cvoEv:
  794|  2.09G|constexpr uint128::operator unsigned __int128() const {
  795|  2.09G|  return (static_cast<unsigned __int128>(hi_) << 64) + lo_;
  796|  2.09G|}
_ZN4absl12lts_20260817eoENS0_7uint128ES1_:
  933|  1.41M|constexpr inline uint128 operator^(uint128 lhs, uint128 rhs) {
  934|  1.41M|#if defined(ABSL_HAVE_INTRINSIC_INT128)
  935|  1.41M|  return static_cast<unsigned __int128>(lhs) ^
  936|  1.41M|         static_cast<unsigned __int128>(rhs);
  937|       |#else
  938|       |  return MakeUint128(Uint128High64(lhs) ^ Uint128High64(rhs),
  939|       |                     Uint128Low64(lhs) ^ Uint128Low64(rhs));
  940|       |#endif
  941|  1.41M|}
_ZN4absl12lts_202608177uint128eOES1_:
  953|  1.41M|inline uint128& uint128::operator^=(uint128 other) {
  954|  1.41M|  *this = *this ^ other;
  955|  1.41M|  return *this;
  956|  1.41M|}
_ZN4absl12lts_20260817mlENS0_7uint128ES1_:
 1059|  1.04G|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.04G|  return static_cast<unsigned __int128>(lhs) *
 1063|  1.04G|         static_cast<unsigned __int128>(rhs);
 1064|  1.04G|}
_ZN4absl12lts_202608177uint128C2Em:
  683|  2.09G|constexpr uint128::uint128(unsigned long v) : lo_{v}, hi_{0} {}
_ZN4absl12lts_202608177uint128C2Eo:
  692|  1.04G|    : lo_{static_cast<uint64_t>(v & ~uint64_t{0})},
  693|  1.04G|      hi_{static_cast<uint64_t>(v >> 64)} {}

_ZN4absl12lts_2026081715random_internal24GetEntropyFromRandenPoolEPvm:
  179|      1|void GetEntropyFromRandenPool(void* dest, size_t bytes) {
  180|      1|  auto* pool = GetPoolForCurrentThread();
  181|      1|  pool->Fill(reinterpret_cast<uint8_t*>(dest), bytes);
  182|      1|}
entropy_pool.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_123GetPoolForCurrentThreadEv:
  172|      1|RandenPoolEntry* GetPoolForCurrentThread() {
  173|      1|  absl::call_once(pool_once, InitPoolURBG);
  174|      1|  return shared_pools[GetPoolID()];
  175|      1|}
entropy_pool.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_112InitPoolURBGEv:
  156|      1|void InitPoolURBG() {
  157|      1|  static constexpr size_t kSeedSize =
  158|      1|      RandenTraits::kStateBytes / sizeof(uint32_t);
  159|       |  // Read OS entropy once, and use it to initialize each pool entry.
  160|      1|  uint32_t seed_material[kPoolSize * kSeedSize];
  161|      1|  if (!ReadSeedMaterialFromOSEntropy(absl::MakeSpan(seed_material))) {
  ------------------
  |  Branch (161:7): [True: 0, False: 1]
  ------------------
  162|      0|    ThrowSeedGenException();
  163|      0|  }
  164|      9|  for (size_t i = 0; i < kPoolSize; i++) {
  ------------------
  |  Branch (164:22): [True: 8, False: 1]
  ------------------
  165|      8|    shared_pools[i] = new RandenPoolEntry();
  166|      8|    shared_pools[i]->Init(
  167|      8|        absl::MakeSpan(&seed_material[i * kSeedSize], kSeedSize));
  168|      8|  }
  169|      1|}
entropy_pool.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_115RandenPoolEntry4InitENS0_4SpanIKjEE:
   58|      8|  void Init(absl::Span<const uint32_t> data) {
   59|      8|    SpinLockHolder l(mu_);  // Always uncontested.
   60|      8|    absl::c_copy(data, std::begin(state_));
   61|      8|    next_ = kState;
   62|      8|  }
entropy_pool.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_19GetPoolIDEv:
  117|      1|size_t GetPoolID() {
  118|      1|  static_assert(kPoolSize >= 1,
  119|      1|                "At least one urbg instance is required for PoolURBG");
  120|       |
  121|      1|  ABSL_CONST_INIT static std::atomic<uint64_t> sequence{0};
  ------------------
  |  |  847|      1|#define ABSL_CONST_INIT constinit
  ------------------
  122|       |
  123|      1|#ifdef ABSL_HAVE_THREAD_LOCAL
  124|      1|  static thread_local size_t my_pool_id = kPoolSize;
  125|      1|  if (ABSL_PREDICT_FALSE(my_pool_id == kPoolSize)) {
  ------------------
  |  |  190|      1|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 1, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 1]
  |  |  |  Branch (190:58): [True: 1, False: 0]
  |  |  ------------------
  ------------------
  126|      1|    my_pool_id = (sequence++ % kPoolSize);
  127|      1|  }
  128|      1|  return my_pool_id;
  129|       |#else
  130|       |  static pthread_key_t tid_key = [] {
  131|       |    pthread_key_t tmp_key;
  132|       |    int err = pthread_key_create(&tmp_key, nullptr);
  133|       |    if (err) {
  134|       |      ABSL_RAW_LOG(FATAL, "pthread_key_create failed with %d", err);
  135|       |    }
  136|       |    return tmp_key;
  137|       |  }();
  138|       |
  139|       |  // Store the value in the pthread_{get/set}specific. However an uninitialized
  140|       |  // value is 0, so add +1 to distinguish from the null value.
  141|       |  uintptr_t my_pool_id =
  142|       |      reinterpret_cast<uintptr_t>(pthread_getspecific(tid_key));
  143|       |  if (ABSL_PREDICT_FALSE(my_pool_id == 0)) {
  144|       |    // No allocated ID, allocate the next value, cache it, and return.
  145|       |    my_pool_id = (sequence++ % kPoolSize) + 1;
  146|       |    int err = pthread_setspecific(tid_key, reinterpret_cast<void*>(my_pool_id));
  147|       |    if (err) {
  148|       |      ABSL_RAW_LOG(FATAL, "pthread_setspecific failed with %d", err);
  149|       |    }
  150|       |  }
  151|       |  return my_pool_id - 1;
  152|       |#endif
  153|      1|}
entropy_pool.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_115RandenPoolEntry4FillEPhm:
   87|      1|void RandenPoolEntry::Fill(uint8_t* out, size_t bytes) {
   88|      1|  SpinLockHolder l(mu_);
   89|      2|  while (bytes > 0) {
  ------------------
  |  Branch (89:10): [True: 1, False: 1]
  ------------------
   90|      1|    MaybeRefill();
   91|      1|    size_t remaining = available() * sizeof(state_[0]);
   92|      1|    size_t to_copy = std::min(bytes, remaining);
   93|      1|    std::memcpy(out, &state_[next_], to_copy);
   94|      1|    out += to_copy;
   95|      1|    bytes -= to_copy;
   96|      1|    next_ += (to_copy + sizeof(state_[0]) - 1) / sizeof(state_[0]);
   97|      1|  }
   98|      1|}
entropy_pool.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_115RandenPoolEntry11MaybeRefillEv:
   67|      1|  void MaybeRefill() ABSL_EXCLUSIVE_LOCKS_REQUIRED(mu_) {
   68|      1|    if (next_ >= kState) {
  ------------------
  |  Branch (68:9): [True: 1, False: 0]
  ------------------
   69|      1|      next_ = kCapacity;
   70|      1|      impl_.Generate(state_);
   71|      1|    }
   72|      1|  }
entropy_pool.cc:_ZNK4absl12lts_2026081715random_internal12_GLOBAL__N_115RandenPoolEntry9availableEv:
   74|      1|  size_t available() const ABSL_SHARED_LOCKS_REQUIRED(mu_) {
   75|      1|    return kState - next_;
   76|      1|  }

_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEE3maxEv:
  122|  42.5M|  static constexpr result_type(max)() { return (URBG::max)(); }
_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEE3minEv:
  119|  85.0M|  static constexpr result_type(min)() { return (URBG::min)(); }
_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEEclEv:
  125|  42.5M|  result_type operator()() { return urbg_(); }
_ZN4absl12lts_2026081715random_internal17RandenPoolSeedSeq4sizeEv:
   66|      1|  size_t size() { return 0; }
_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEEC2Ev:
  100|      1|  NonsecureURBGBase() : urbg_(ConstructURBG()) {}
_ZN4absl12lts_2026081715random_internal17NonsecureURBGBaseINS1_13randen_engineImEENS1_17RandenPoolSeedSeqEE13ConstructURBGEv:
  141|      1|  static URBG ConstructURBG() {
  142|      1|    Seeder seeder;
  143|      1|    return URBG(seeder);
  144|      1|  }
_ZN4absl12lts_2026081715random_internal17RandenPoolSeedSeq8generateIPjEEvT_S5_:
   72|      1|  void generate(RandomAccessIterator begin, RandomAccessIterator end) {
   73|       |    // RandomAccessIterator must be assignable from uint32_t
   74|      1|    if (begin != end) {
  ------------------
  |  Branch (74:9): [True: 1, False: 0]
  ------------------
   75|      1|      using U = typename std::iterator_traits<RandomAccessIterator>::value_type;
   76|       |      // ContiguousTag indicates the common case of a known contiguous buffer,
   77|       |      // which allows directly filling the buffer. In C++20,
   78|       |      // std::contiguous_iterator_tag provides a mechanism for testing this
   79|       |      // capability, however until Abseil's support requirements allow us to
   80|       |      // assume C++20, limit checks to a few common cases.
   81|      1|      using TagType = std::conditional_t<
   82|      1|          (std::is_pointer_v<RandomAccessIterator> ||
   83|      1|           std::is_same_v<RandomAccessIterator,
   84|      1|                          typename std::vector<U>::iterator>),
   85|      1|          ContiguousTag, BufferTag>;
   86|       |
   87|      1|      generate_impl(TagType{}, begin, end);
   88|      1|    }
   89|      1|  }
_ZN4absl12lts_2026081715random_internal17RandenPoolSeedSeq13generate_implIPjEEvNS2_13ContiguousTagET_S6_:
   46|      1|  void generate_impl(ContiguousTag, Contiguous begin, Contiguous end) {
   47|      1|    const size_t n = static_cast<size_t>(std::distance(begin, end));
   48|      1|    auto* a = &(*begin);
   49|      1|    GetEntropyFromRandenPool(a, sizeof(*a) * n);
   50|      1|  }

_ZN4absl12lts_2026081715random_internal6RandenC2Ev:
   84|      9|Randen::Randen() {
   85|      9|  auto tmp = GetRandenState();
   86|      9|  keys_ = tmp.keys;
   87|      9|#if ABSL_RANDOM_INTERNAL_AES_DISPATCH
   88|      9|  has_crypto_ = tmp.has_crypto;
   89|      9|#endif
   90|      9|}
randen.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_114GetRandenStateEv:
   56|      9|RandenState GetRandenState() {
   57|      9|  static const RandenState state = []() {
   58|      9|    RandenState tmp;
   59|      9|#if ABSL_RANDOM_INTERNAL_AES_DISPATCH
   60|       |    // HW AES Dispatch.
   61|      9|    if (HasRandenHwAesImplementation() && CPUSupportsRandenHwAes()) {
   62|      9|      tmp.has_crypto = true;
   63|      9|      tmp.keys = RandenHwAes::GetKeys();
   64|      9|    } else {
   65|      9|      tmp.has_crypto = false;
   66|      9|      tmp.keys = RandenSlow::GetKeys();
   67|      9|    }
   68|       |#elif ABSL_HAVE_ACCELERATED_AES
   69|       |    // HW AES is enabled.
   70|       |    tmp.has_crypto = true;
   71|       |    tmp.keys = RandenHwAes::GetKeys();
   72|       |#else
   73|       |    // HW AES is disabled.
   74|       |    tmp.has_crypto = false;
   75|       |    tmp.keys = RandenSlow::GetKeys();
   76|       |#endif
   77|      9|    return tmp;
   78|      9|  }();
   79|      9|  return state;
   80|      9|}
randen.cc:_ZZN4absl12lts_2026081715random_internal12_GLOBAL__N_114GetRandenStateEvENK3$_0clEv:
   57|      1|  static const RandenState state = []() {
   58|      1|    RandenState tmp;
   59|      1|#if ABSL_RANDOM_INTERNAL_AES_DISPATCH
   60|       |    // HW AES Dispatch.
   61|      1|    if (HasRandenHwAesImplementation() && CPUSupportsRandenHwAes()) {
  ------------------
  |  Branch (61:9): [True: 0, False: 1]
  |  Branch (61:43): [True: 0, False: 0]
  ------------------
   62|      0|      tmp.has_crypto = true;
   63|      0|      tmp.keys = RandenHwAes::GetKeys();
   64|      1|    } else {
   65|      1|      tmp.has_crypto = false;
   66|      1|      tmp.keys = RandenSlow::GetKeys();
   67|      1|    }
   68|       |#elif ABSL_HAVE_ACCELERATED_AES
   69|       |    // HW AES is enabled.
   70|       |    tmp.has_crypto = true;
   71|       |    tmp.keys = RandenHwAes::GetKeys();
   72|       |#else
   73|       |    // HW AES is disabled.
   74|       |    tmp.has_crypto = false;
   75|       |    tmp.keys = RandenSlow::GetKeys();
   76|       |#endif
   77|      1|    return tmp;
   78|      1|  }();

_ZNK4absl12lts_2026081715random_internal6Randen8GenerateEPv:
   47|  1.41M|  void Generate(void* state) const {
   48|  1.41M|#if ABSL_RANDOM_INTERNAL_AES_DISPATCH
   49|       |    // HW AES Dispatch.
   50|  1.41M|    if (has_crypto_) {
  ------------------
  |  Branch (50:9): [True: 0, False: 1.41M]
  ------------------
   51|      0|      RandenHwAes::Generate(keys_, state);
   52|  1.41M|    } else {
   53|  1.41M|      RandenSlow::Generate(keys_, state);
   54|  1.41M|    }
   55|       |#elif ABSL_HAVE_ACCELERATED_AES
   56|       |    // HW AES is enabled.
   57|       |    RandenHwAes::Generate(keys_, state);
   58|       |#else
   59|       |    // HW AES is disabled.
   60|       |    RandenSlow::Generate(keys_, state);
   61|       |#endif
   62|  1.41M|  }
_ZNK4absl12lts_2026081715random_internal6Randen6AbsorbEPKvPv:
   68|      1|  void Absorb(const void* seed, void* state) const {
   69|      1|#if ABSL_RANDOM_INTERNAL_AES_DISPATCH
   70|       |    // HW AES Dispatch.
   71|      1|    if (has_crypto_) {
  ------------------
  |  Branch (71:9): [True: 0, False: 1]
  ------------------
   72|      0|      RandenHwAes::Absorb(seed, state);
   73|      1|    } else {
   74|      1|      RandenSlow::Absorb(seed, state);
   75|      1|    }
   76|       |#elif ABSL_HAVE_ACCELERATED_AES
   77|       |    // HW AES is enabled.
   78|       |    RandenHwAes::Absorb(seed, state);
   79|       |#else
   80|       |    // HW AES is disabled.
   81|       |    RandenSlow::Absorb(seed, state);
   82|       |#endif
   83|      1|  }

_ZN4absl12lts_2026081715random_internal13randen_engineImE3maxEv:
   58|  42.5M|  static constexpr result_type(max)() {
   59|  42.5M|    return (std::numeric_limits<result_type>::max)();
   60|  42.5M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE3minEv:
   54|  85.0M|  static constexpr result_type(min)() {
   55|  85.0M|    return (std::numeric_limits<result_type>::min)();
   56|  85.0M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImEclEv:
   85|  42.5M|  result_type operator()() {
   86|       |    // Refill the buffer if needed (unlikely).
   87|  42.5M|    auto* begin = state();
   88|  42.5M|    if (next_ >= kStateSizeT) {
  ------------------
  |  Branch (88:9): [True: 1.41M, False: 41.0M]
  ------------------
   89|  1.41M|      next_ = kCapacityT;
   90|  1.41M|      impl_.Generate(begin);
   91|  1.41M|    }
   92|  42.5M|    return little_endian::ToHost(begin[next_++]);
   93|  42.5M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE5stateEv:
  244|  42.5M|  result_type* state() {
  245|  42.5M|    return reinterpret_cast<result_type*>(
  246|  42.5M|        (reinterpret_cast<uintptr_t>(&raw_state_) & 0xf) ? (raw_state_ + 8)
  ------------------
  |  Branch (246:9): [True: 0, False: 42.5M]
  ------------------
  247|  42.5M|                                                         : raw_state_);
  248|  42.5M|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImEC2IRNS1_17RandenPoolSeedSeqEvEEOT_:
   68|      1|  explicit randen_engine(SeedSequence&& seq) {
   69|      1|    seed(seq);
   70|      1|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE4seedIRNS1_17RandenPoolSeedSeqEEENSt3__19enable_ifIXntsr3stdE16is_convertible_vIT_mEEvE4typeEOS9_:
   97|      1|  seed(SeedSequence&& seq) {
   98|       |    // Zeroes the state.
   99|      1|    seed();
  100|      1|    reseed(seq);
  101|      1|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE4seedEm:
  103|      1|  void seed(result_type seed_value = 0) {
  104|      1|    next_ = kStateSizeT;
  105|       |    // Zeroes the inner state and fills the outer state with seed_value to
  106|       |    // mimic the behaviour of reseed
  107|      1|    auto* begin = state();
  108|      1|    std::fill(begin, begin + kCapacityT, 0);
  109|      1|    std::fill(begin + kCapacityT, begin + kStateSizeT, seed_value);
  110|      1|  }
_ZN4absl12lts_2026081715random_internal13randen_engineImE6reseedINS1_17RandenPoolSeedSeqEEEvRT_:
  116|      1|  void reseed(SeedSequence& seq) {
  117|      1|    using sequence_result_type = typename SeedSequence::result_type;
  118|      1|    static_assert(sizeof(sequence_result_type) == 4,
  119|      1|                  "SeedSequence::result_type must be 32-bit");
  120|      1|    constexpr size_t kBufferSize =
  121|      1|        Randen::kSeedBytes / sizeof(sequence_result_type);
  122|      1|    alignas(16) sequence_result_type buffer[kBufferSize];
  123|       |
  124|       |    // Randen::Absorb XORs the seed into state, which is then mixed by a call
  125|       |    // to Randen::Generate. Seeding with only the provided entropy is preferred
  126|       |    // to using an arbitrary generate() call, so use [rand.req.seed_seq]
  127|       |    // size as a proxy for the number of entropy units that can be generated
  128|       |    // without relying on seed sequence mixing...
  129|      1|    const size_t entropy_size = seq.size();
  130|      1|    if (entropy_size < kBufferSize) {
  ------------------
  |  Branch (130:9): [True: 1, False: 0]
  ------------------
  131|       |      // ... and only request that many values, or 256-bits, when unspecified.
  132|      1|      const size_t requested_entropy = (entropy_size == 0) ? 8u : entropy_size;
  ------------------
  |  Branch (132:40): [True: 1, False: 0]
  ------------------
  133|      1|      std::fill(buffer + requested_entropy, buffer + kBufferSize, 0);
  134|      1|      seq.generate(buffer, buffer + requested_entropy);
  135|       |#ifdef ABSL_IS_BIG_ENDIAN
  136|       |      // Randen expects the seed buffer to be in Little Endian; reverse it on
  137|       |      // Big Endian platforms.
  138|       |      for (sequence_result_type& e : buffer) {
  139|       |        e = absl::little_endian::FromHost(e);
  140|       |      }
  141|       |#endif
  142|       |      // The Randen paper suggests preferentially initializing even-numbered
  143|       |      // 128-bit vectors of the randen state (there are 16 such vectors).
  144|       |      // The seed data is merged into the state offset by 128-bits, which
  145|       |      // implies preferring seed bytes [16..31, ..., 208..223]. Since the
  146|       |      // buffer is 32-bit values, we swap the corresponding buffer positions in
  147|       |      // 128-bit chunks.
  148|      1|      size_t dst = kBufferSize;
  149|      8|      while (dst > 7) {
  ------------------
  |  Branch (149:14): [True: 7, False: 1]
  ------------------
  150|       |        // leave the odd bucket as-is.
  151|      7|        dst -= 4;
  152|      7|        size_t src = dst >> 1;
  153|       |        // swap 128-bits into the even bucket
  154|      7|        std::swap(buffer[--dst], buffer[--src]);
  155|      7|        std::swap(buffer[--dst], buffer[--src]);
  156|      7|        std::swap(buffer[--dst], buffer[--src]);
  157|      7|        std::swap(buffer[--dst], buffer[--src]);
  158|      7|      }
  159|      1|    } else {
  160|      0|      seq.generate(buffer, buffer + kBufferSize);
  161|      0|    }
  162|      1|    impl_.Absorb(buffer, state());
  163|       |
  164|       |    // Generate will be called when operator() is called
  165|      1|    next_ = kStateSizeT;
  166|      1|  }

_ZN4absl12lts_2026081715random_internal28HasRandenHwAesImplementationEv:
   53|      1|bool HasRandenHwAesImplementation() { return false; }

_ZN4absl12lts_2026081715random_internal10RandenSlow7GetKeysEv:
  422|      1|const void* RandenSlow::GetKeys() {
  423|       |  // Round keys for one AES per Feistel round and branch.
  424|       |  // The canonical implementation uses first digits of Pi.
  425|      1|#ifdef ABSL_IS_LITTLE_ENDIAN
  426|      1|  return kRandenRoundKeys;
  427|       |#else
  428|       |  return kRandenRoundKeysBE;
  429|       |#endif
  430|      1|}
_ZN4absl12lts_2026081715random_internal10RandenSlow6AbsorbEPKvPv:
  432|      1|void RandenSlow::Absorb(const void* seed_void, void* state_void) {
  433|      1|  auto* state =
  434|      1|      reinterpret_cast<uint64_t * ABSL_RANDOM_INTERNAL_RESTRICT>(state_void);
  435|      1|  const auto* seed =
  436|      1|      reinterpret_cast<const uint64_t * ABSL_RANDOM_INTERNAL_RESTRICT>(
  437|      1|          seed_void);
  438|       |
  439|      1|  constexpr size_t kCapacityBlocks =
  440|      1|      RandenTraits::kCapacityBytes / sizeof(uint64_t);
  441|      1|  static_assert(
  442|      1|      kCapacityBlocks * sizeof(uint64_t) == RandenTraits::kCapacityBytes,
  443|      1|      "Not i*V");
  444|       |
  445|      1|  for (size_t i = kCapacityBlocks;
  446|     31|       i < RandenTraits::kStateBytes / sizeof(uint64_t); ++i) {
  ------------------
  |  Branch (446:8): [True: 30, False: 1]
  ------------------
  447|     30|    state[i] ^= seed[i - kCapacityBlocks];
  448|     30|  }
  449|      1|}
_ZN4absl12lts_2026081715random_internal10RandenSlow8GenerateEPKvPv:
  451|  1.41M|void RandenSlow::Generate(const void* keys_void, void* state_void) {
  452|  1.41M|  static_assert(RandenTraits::kCapacityBytes == sizeof(absl::uint128),
  453|  1.41M|                "Capacity mismatch");
  454|       |
  455|  1.41M|  auto* state = reinterpret_cast<absl::uint128*>(state_void);
  456|  1.41M|  const auto* keys = reinterpret_cast<const absl::uint128*>(keys_void);
  457|       |
  458|  1.41M|  const absl::uint128 prev_inner = state[0];
  459|       |
  460|  1.41M|  SwapEndian(state);
  461|       |
  462|  1.41M|  Permute(state, keys);
  463|       |
  464|  1.41M|  SwapEndian(state);
  465|       |
  466|       |  // Ensure backtracking resistance.
  467|  1.41M|  *state ^= prev_inner;
  468|  1.41M|}
randen_slow.cc:_ZN12_GLOBAL__N_110SwapEndianEPN4absl12lts_202608177uint128E:
  401|  2.83M|    absl::uint128* state) {
  402|       |#ifdef ABSL_IS_BIG_ENDIAN
  403|       |  for (uint32_t block = 0; block < RandenTraits::kFeistelBlocks; ++block) {
  404|       |    uint64_t new_lo = absl::little_endian::ToHost64(
  405|       |        static_cast<uint64_t>(state[block] >> 64));
  406|       |    uint64_t new_hi = absl::little_endian::ToHost64(
  407|       |        static_cast<uint64_t>((state[block] << 64) >> 64));
  408|       |    state[block] = (static_cast<absl::uint128>(new_hi) << 64) | new_lo;
  409|       |  }
  410|       |#else
  411|       |  // Avoid warning about unused variable.
  412|  2.83M|  (void)state;
  413|  2.83M|#endif
  414|  2.83M|}
randen_slow.cc:_ZN12_GLOBAL__N_17PermuteEPN4absl12lts_202608177uint128EPKS2_:
  392|  1.41M|    const absl::uint128* ABSL_RANDOM_INTERNAL_RESTRICT keys) {
  393|  25.5M|  for (size_t round = 0; round < RandenTraits::kFeistelRounds; ++round) {
  ------------------
  |  Branch (393:26): [True: 24.0M, False: 1.41M]
  ------------------
  394|  24.0M|    keys = FeistelRound(state, keys);
  395|  24.0M|    BlockShuffle(state);
  396|  24.0M|  }
  397|  1.41M|}
randen_slow.cc:_ZN12_GLOBAL__N_112FeistelRoundEPN4absl12lts_202608177uint128EPKS2_:
  366|  24.0M|             const absl::uint128* ABSL_RANDOM_INTERNAL_RESTRICT keys) {
  367|   120M|  for (size_t branch = 0; branch < RandenTraits::kFeistelBlocks; branch += 4) {
  ------------------
  |  Branch (367:27): [True: 96.3M, False: 24.0M]
  ------------------
  368|  96.3M|    const Vector128 s0 = Vector128Load(state + branch);
  369|  96.3M|    const Vector128 s1 = Vector128Load(state + branch + 1);
  370|  96.3M|    const Vector128 f0 = AesRound(s0, Vector128Load(keys));
  371|  96.3M|    keys++;
  372|  96.3M|    const Vector128 o1 = AesRound(f0, s1);
  373|  96.3M|    Vector128Store(o1, state + branch + 1);
  374|       |
  375|       |    // Manually unroll this loop once. about 10% better than not unrolled.
  376|  96.3M|    const Vector128 s2 = Vector128Load(state + branch + 2);
  377|  96.3M|    const Vector128 s3 = Vector128Load(state + branch + 3);
  378|  96.3M|    const Vector128 f2 = AesRound(s2, Vector128Load(keys));
  379|  96.3M|    keys++;
  380|  96.3M|    const Vector128 o3 = AesRound(f2, s3);
  381|  96.3M|    Vector128Store(o3, state + branch + 3);
  382|  96.3M|  }
  383|  24.0M|  return keys;
  384|  24.0M|}
randen_slow.cc:_ZN12_GLOBAL__N_113Vector128LoadEPKv:
  240|   578M|Vector128Load(const void* from) {
  241|   578M|  Vector128 result;
  242|   578M|  std::memcpy(result.s, from, sizeof(Vector128));
  243|   578M|  return result;
  244|   578M|}
randen_slow.cc:_ZN12_GLOBAL__N_18AesRoundERKNS_9Vector128ES2_:
  254|   385M|AesRound(const Vector128& state, const Vector128& round_key) {
  255|   385M|  Vector128 result;
  256|   385M|#ifdef ABSL_IS_LITTLE_ENDIAN
  257|   385M|  result.s[0] = round_key.s[0] ^                  //
  258|   385M|                te0[uint8_t(state.s[0])] ^        //
  259|   385M|                te1[uint8_t(state.s[1] >> 8)] ^   //
  260|   385M|                te2[uint8_t(state.s[2] >> 16)] ^  //
  261|   385M|                te3[uint8_t(state.s[3] >> 24)];
  262|   385M|  result.s[1] = round_key.s[1] ^                  //
  263|   385M|                te0[uint8_t(state.s[1])] ^        //
  264|   385M|                te1[uint8_t(state.s[2] >> 8)] ^   //
  265|   385M|                te2[uint8_t(state.s[3] >> 16)] ^  //
  266|   385M|                te3[uint8_t(state.s[0] >> 24)];
  267|   385M|  result.s[2] = round_key.s[2] ^                  //
  268|   385M|                te0[uint8_t(state.s[2])] ^        //
  269|   385M|                te1[uint8_t(state.s[3] >> 8)] ^   //
  270|   385M|                te2[uint8_t(state.s[0] >> 16)] ^  //
  271|   385M|                te3[uint8_t(state.s[1] >> 24)];
  272|   385M|  result.s[3] = round_key.s[3] ^                  //
  273|   385M|                te0[uint8_t(state.s[3])] ^        //
  274|   385M|                te1[uint8_t(state.s[0] >> 8)] ^   //
  275|   385M|                te2[uint8_t(state.s[1] >> 16)] ^  //
  276|   385M|                te3[uint8_t(state.s[2] >> 24)];
  277|       |#else
  278|       |  result.s[0] = round_key.s[0] ^                  //
  279|       |                te0[uint8_t(state.s[0])] ^        //
  280|       |                te1[uint8_t(state.s[3] >> 8)] ^   //
  281|       |                te2[uint8_t(state.s[2] >> 16)] ^  //
  282|       |                te3[uint8_t(state.s[1] >> 24)];
  283|       |  result.s[1] = round_key.s[1] ^                  //
  284|       |                te0[uint8_t(state.s[1])] ^        //
  285|       |                te1[uint8_t(state.s[0] >> 8)] ^   //
  286|       |                te2[uint8_t(state.s[3] >> 16)] ^  //
  287|       |                te3[uint8_t(state.s[2] >> 24)];
  288|       |  result.s[2] = round_key.s[2] ^                  //
  289|       |                te0[uint8_t(state.s[2])] ^        //
  290|       |                te1[uint8_t(state.s[1] >> 8)] ^   //
  291|       |                te2[uint8_t(state.s[0] >> 16)] ^  //
  292|       |                te3[uint8_t(state.s[3] >> 24)];
  293|       |  result.s[3] = round_key.s[3] ^                  //
  294|       |                te0[uint8_t(state.s[3])] ^        //
  295|       |                te1[uint8_t(state.s[2] >> 8)] ^   //
  296|       |                te2[uint8_t(state.s[1] >> 16)] ^  //
  297|       |                te3[uint8_t(state.s[0] >> 24)];
  298|       |#endif
  299|   385M|  return result;
  300|   385M|}
randen_slow.cc:_ZN12_GLOBAL__N_114Vector128StoreERKNS_9Vector128EPv:
  247|   192M|    const Vector128& v, void* to) {
  248|   192M|  std::memcpy(to, v.s, sizeof(Vector128));
  249|   192M|}
randen_slow.cc:_ZN12_GLOBAL__N_112BlockShuffleEPN4absl12lts_202608177uint128E:
  306|  24.0M|    absl::uint128* state) {
  307|  24.0M|  static_assert(RandenTraits::kFeistelBlocks == 16,
  308|  24.0M|                "Feistel block shuffle only works for 16 blocks.");
  309|       |
  310|  24.0M|  constexpr size_t shuffle[RandenTraits::kFeistelBlocks] = {
  311|  24.0M|      7, 2, 13, 4, 11, 8, 3, 6, 15, 0, 9, 10, 1, 14, 5, 12};
  312|       |
  313|       |  // The fully unrolled loop without the memcpy improves the speed by about
  314|       |  // 30% over the equivalent:
  315|       |#if 0
  316|       |  absl::uint128 source[RandenTraits::kFeistelBlocks];
  317|       |  std::memcpy(source, state, sizeof(source));
  318|       |  for (size_t i = 0; i < RandenTraits::kFeistelBlocks; i++) {
  319|       |    const absl::uint128 v0 = source[shuffle[i]];
  320|       |    state[i] = v0;
  321|       |  }
  322|       |  return;
  323|       |#endif
  324|       |
  325|  24.0M|  const absl::uint128 v0 = state[shuffle[0]];
  326|  24.0M|  const absl::uint128 v1 = state[shuffle[1]];
  327|  24.0M|  const absl::uint128 v2 = state[shuffle[2]];
  328|  24.0M|  const absl::uint128 v3 = state[shuffle[3]];
  329|  24.0M|  const absl::uint128 v4 = state[shuffle[4]];
  330|  24.0M|  const absl::uint128 v5 = state[shuffle[5]];
  331|  24.0M|  const absl::uint128 v6 = state[shuffle[6]];
  332|  24.0M|  const absl::uint128 v7 = state[shuffle[7]];
  333|  24.0M|  const absl::uint128 w0 = state[shuffle[8]];
  334|  24.0M|  const absl::uint128 w1 = state[shuffle[9]];
  335|  24.0M|  const absl::uint128 w2 = state[shuffle[10]];
  336|  24.0M|  const absl::uint128 w3 = state[shuffle[11]];
  337|  24.0M|  const absl::uint128 w4 = state[shuffle[12]];
  338|  24.0M|  const absl::uint128 w5 = state[shuffle[13]];
  339|  24.0M|  const absl::uint128 w6 = state[shuffle[14]];
  340|  24.0M|  const absl::uint128 w7 = state[shuffle[15]];
  341|  24.0M|  state[0] = v0;
  342|  24.0M|  state[1] = v1;
  343|  24.0M|  state[2] = v2;
  344|  24.0M|  state[3] = v3;
  345|  24.0M|  state[4] = v4;
  346|  24.0M|  state[5] = v5;
  347|  24.0M|  state[6] = v6;
  348|  24.0M|  state[7] = v7;
  349|  24.0M|  state[8] = w0;
  350|  24.0M|  state[9] = w1;
  351|  24.0M|  state[10] = w2;
  352|  24.0M|  state[11] = w3;
  353|  24.0M|  state[12] = w4;
  354|  24.0M|  state[13] = w5;
  355|  24.0M|  state[14] = w6;
  356|  24.0M|  state[15] = w7;
  357|  24.0M|}

_ZN4absl12lts_2026081715random_internal29ReadSeedMaterialFromOSEntropyENS0_4SpanIjEE:
  186|      1|bool ReadSeedMaterialFromOSEntropy(absl::Span<uint32_t> values) {
  187|      1|  assert(values.data() != nullptr);
  188|      1|  if (values.data() == nullptr) {
  ------------------
  |  Branch (188:7): [True: 0, False: 1]
  ------------------
  189|      0|    return false;
  190|      0|  }
  191|      1|  if (values.empty()) {
  ------------------
  |  Branch (191:7): [True: 0, False: 1]
  ------------------
  192|      0|    return true;
  193|      0|  }
  194|      1|  return ReadSeedMaterialFromOSEntropyImpl(values);
  195|      1|}
seed_material.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_133ReadSeedMaterialFromOSEntropyImplENS0_4SpanIjEE:
  171|      1|bool ReadSeedMaterialFromOSEntropyImpl(absl::Span<uint32_t> values) {
  172|      1|#if defined(ABSL_RANDOM_USE_GET_ENTROPY)
  173|      1|  if (ReadSeedMaterialFromGetEntropy(values)) {
  ------------------
  |  Branch (173:7): [True: 1, False: 0]
  ------------------
  174|      1|    return true;
  175|      1|  }
  176|      0|#endif
  177|       |  // Libc may support getentropy, but the kernel may not, so we still have
  178|       |  // to fallback to ReadSeedMaterialFromDevURandom().
  179|      0|  return ReadSeedMaterialFromDevURandom(values);
  180|      1|}
seed_material.cc:_ZN4absl12lts_2026081715random_internal12_GLOBAL__N_130ReadSeedMaterialFromGetEntropyENS0_4SpanIjEE:
  120|      1|bool ReadSeedMaterialFromGetEntropy(absl::Span<uint32_t> values) {
  121|      1|  auto buffer = reinterpret_cast<uint8_t*>(values.data());
  122|      1|  size_t buffer_size = sizeof(uint32_t) * values.size();
  123|      9|  while (buffer_size > 0) {
  ------------------
  |  Branch (123:10): [True: 8, False: 1]
  ------------------
  124|       |    // getentropy() has a maximum permitted length of 256.
  125|      8|    size_t to_read = std::min<size_t>(buffer_size, 256);
  126|      8|    int result = getentropy(buffer, to_read);
  127|      8|    if (result < 0) {
  ------------------
  |  Branch (127:9): [True: 0, False: 8]
  ------------------
  128|      0|      return false;
  129|      0|    }
  130|       |    // https://github.com/google/sanitizers/issues/1173
  131|       |    // MemorySanitizer can't see through getentropy().
  132|      8|    ABSL_ANNOTATE_MEMORY_IS_INITIALIZED(buffer, to_read);
  133|      8|    buffer += to_read;
  134|      8|    buffer_size -= to_read;
  135|      8|  }
  136|      1|  return true;
  137|      1|}

_ZN4absl12lts_202608176StatusC2Em:
  770|  39.5M|  explicit Status(uintptr_t rep) : rep_(rep) {}
_ZN4absl12lts_202608176Status12MovedFromRepEv:
 1102|  19.7M|constexpr uintptr_t Status::MovedFromRep() {
 1103|  19.7M|  return CodeToInlinedRep(absl::StatusCode::kInternal) | 2;
 1104|  19.7M|}
_ZN4absl12lts_202608176Status3RefEm:
 1117|   284k|inline void Status::Ref(uintptr_t rep) {
 1118|   284k|  if (!IsInlined(rep)) RepToPointer(rep)->Ref();
  ------------------
  |  Branch (1118:7): [True: 0, False: 284k]
  ------------------
 1119|   284k|}
_ZN4absl12lts_202608178OkStatusEv:
 1126|  19.5M|inline Status OkStatus() { return Status(); }
_ZN4absl12lts_202608176StatusC2EOS1_:
  979|  19.7M|inline Status::Status(Status&& x) noexcept : Status(x.rep_) {
  980|  19.7M|  x.rep_ = MovedFromRep();
  981|  19.7M|}
_ZN4absl12lts_202608176StatusC2Ev:
  950|  19.5M|inline Status::Status() : Status(absl::StatusCode::kOk) {}
_ZN4absl12lts_202608176StatusC2ENS0_10StatusCodeE:
  952|  19.5M|inline Status::Status(absl::StatusCode code) : Status(CodeToInlinedRep(code)) {}
_ZN4absl12lts_202608176StatusC2ERKS1_:
  966|   284k|inline Status::Status(const Status& x) : Status(x.rep_) { Ref(rep_); }

_ZN4absl12lts_2026081721status_macro_internal12MacroAdaptorEONS0_6StatusENSt3__115source_locationE:
  444|  19.7M|                                         absl::SourceLocation loc) {
  445|  19.7M|  return ReturnIfErrorAdaptor(std::move(s), loc);
  446|  19.7M|}
_ZN4absl12lts_2026081721status_macro_internal20ReturnIfErrorAdaptorC2EONS0_6StatusENSt3__115source_locationE:
  404|  19.7M|      : status_(std::move(status)), loc_(loc) {}
_ZNK4absl12lts_2026081721status_macro_internal20ReturnIfErrorAdaptorcvbEv:
  420|  19.7M|  explicit operator bool() const { return ABSL_PREDICT_TRUE(status_.ok()); }
  ------------------
  |  |  191|  19.7M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:48): [Folded, False: 19.7M]
  |  |  |  Branch (191:57): [True: 19.7M, False: 0]
  |  |  ------------------
  ------------------
_ZN4absl12lts_2026081721status_macro_internal20ReturnIfErrorAdaptorD2Ev:
  406|  19.7M|  ~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.7M|  }

str_cat.cc:_ZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumEE3$_0EEvRT_NSF_9size_typeET0_:
   48|  79.3M|                              Op append_op) {
   49|  79.3M|  if (ABSL_PREDICT_FALSE(append_n > str.max_size() - str.size())) {
  ------------------
  |  |  190|  79.3M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 79.3M]
  |  |  |  Branch (190:49): [Folded, False: 79.3M]
  |  |  |  Branch (190:58): [True: 0, False: 79.3M]
  |  |  ------------------
  ------------------
   50|      0|    ThrowStdLengthError("absl::strings_internal::StringAppendAndOverwrite");
   51|      0|  }
   52|       |
   53|  79.3M|  auto old_size = str.size();
   54|  79.3M|  auto resize = old_size + append_n;
   55|       |
   56|  79.3M|  if (resize > str.capacity()) {
  ------------------
  |  Branch (56:7): [True: 14.5k, False: 79.3M]
  ------------------
   57|       |    // Make sure to always grow by at least a factor of 2x.
   58|  14.5k|    const auto min_growth = str.capacity();
   59|  14.5k|    if (ABSL_PREDICT_FALSE(str.capacity() > str.max_size() - min_growth)) {
  ------------------
  |  |  190|  14.5k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 14.5k]
  |  |  |  Branch (190:49): [Folded, False: 14.5k]
  |  |  |  Branch (190:58): [True: 0, False: 14.5k]
  |  |  ------------------
  ------------------
   60|      0|      str.reserve(str.max_size());
   61|  14.5k|    } else if (resize < str.capacity() + min_growth) {
  ------------------
  |  Branch (61:16): [True: 14.5k, False: 0]
  ------------------
   62|  14.5k|      str.reserve(str.capacity() + min_growth);
   63|  14.5k|    }
   64|  14.5k|  }
   65|       |
   66|       |  // Avoid calling StringResizeAndOverwrite() here since it does an MSAN
   67|       |  // verification on the entire string. StringResizeAndOverwriteImpl() is
   68|       |  // StringResizeAndOverwrite() without the MSAN verification.
   69|  79.3M|  StringResizeAndOverwriteImpl(
   70|  79.3M|      str, resize,
   71|  79.3M|      [old_size, append_n, do_append = std::move(append_op)](
   72|  79.3M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  79.3M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  79.3M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  79.3M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  79.3M|                                               typename T::size_type{0});
   77|  79.3M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  79.3M|        return old_size + num_appended;
   79|  79.3M|      });
   80|       |
   81|       |#if defined(ABSL_HAVE_MEMORY_SANITIZER)
   82|       |  // Only check the region appended to. Checking the entire string would cause
   83|       |  // pathological quadratic verfication on repeated small appends.
   84|       |  __msan_check_mem_is_initialized(str.data() + old_size, str.size() - old_size);
   85|       |#endif
   86|  79.3M|}
str_cat.cc:_ZZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumEE3$_0EEvRT_NSF_9size_typeET0_ENUlPcmE_clESJ_m:
   72|  79.3M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  79.3M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  79.3M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  79.3M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  79.3M|                                               typename T::size_type{0});
   77|  79.3M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  79.3M|        return old_size + num_appended;
   79|  79.3M|      });
str_cat.cc:_ZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumESD_E3$_0EEvRT_NSF_9size_typeET0_:
   48|  1.88M|                              Op append_op) {
   49|  1.88M|  if (ABSL_PREDICT_FALSE(append_n > str.max_size() - str.size())) {
  ------------------
  |  |  190|  1.88M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1.88M]
  |  |  |  Branch (190:49): [Folded, False: 1.88M]
  |  |  |  Branch (190:58): [True: 0, False: 1.88M]
  |  |  ------------------
  ------------------
   50|      0|    ThrowStdLengthError("absl::strings_internal::StringAppendAndOverwrite");
   51|      0|  }
   52|       |
   53|  1.88M|  auto old_size = str.size();
   54|  1.88M|  auto resize = old_size + append_n;
   55|       |
   56|  1.88M|  if (resize > str.capacity()) {
  ------------------
  |  Branch (56:7): [True: 0, False: 1.88M]
  ------------------
   57|       |    // Make sure to always grow by at least a factor of 2x.
   58|      0|    const auto min_growth = str.capacity();
   59|      0|    if (ABSL_PREDICT_FALSE(str.capacity() > str.max_size() - min_growth)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   60|      0|      str.reserve(str.max_size());
   61|      0|    } else if (resize < str.capacity() + min_growth) {
  ------------------
  |  Branch (61:16): [True: 0, False: 0]
  ------------------
   62|      0|      str.reserve(str.capacity() + min_growth);
   63|      0|    }
   64|      0|  }
   65|       |
   66|       |  // Avoid calling StringResizeAndOverwrite() here since it does an MSAN
   67|       |  // verification on the entire string. StringResizeAndOverwriteImpl() is
   68|       |  // StringResizeAndOverwrite() without the MSAN verification.
   69|  1.88M|  StringResizeAndOverwriteImpl(
   70|  1.88M|      str, resize,
   71|  1.88M|      [old_size, append_n, do_append = std::move(append_op)](
   72|  1.88M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  1.88M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  1.88M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  1.88M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  1.88M|                                               typename T::size_type{0});
   77|  1.88M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  1.88M|        return old_size + num_appended;
   79|  1.88M|      });
   80|       |
   81|       |#if defined(ABSL_HAVE_MEMORY_SANITIZER)
   82|       |  // Only check the region appended to. Checking the entire string would cause
   83|       |  // pathological quadratic verfication on repeated small appends.
   84|       |  __msan_check_mem_is_initialized(str.data() + old_size, str.size() - old_size);
   85|       |#endif
   86|  1.88M|}
str_cat.cc:_ZZN4absl12lts_2026081716strings_internal24StringAppendAndOverwriteINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS0_9StrAppendEPS9_RKNS0_8AlphaNumESD_E3$_0EEvRT_NSF_9size_typeET0_ENUlPcmE_clESJ_m:
   72|  1.88M|          typename T::value_type* data_ptr, typename T::size_type) mutable {
   73|  1.88M|        typename T::size_type num_appended = static_cast<typename T::size_type>(
   74|  1.88M|            std::move(do_append)(data_ptr + old_size, append_n));
   75|  1.88M|        absl::base_internal::HardeningAssertGE(num_appended,
   76|  1.88M|                                               typename T::size_type{0});
   77|  1.88M|        absl::base_internal::HardeningAssertLE(num_appended, append_n);
   78|  1.88M|        return old_size + num_appended;
   79|  1.88M|      });

_ZN4absl12lts_2026081716strings_internal28STLStringResizeUninitializedINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEvEEvPT_m:
   68|    596|inline void STLStringResizeUninitialized(string_type* s, size_t new_size) {
   69|    596|  ResizeUninitializedTraits<string_type>::Resize(s, new_size);
   70|    596|}
_ZN4absl12lts_2026081716strings_internal25ResizeUninitializedTraitsINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEvE6ResizeEPS9_m:
   48|    596|  static void Resize(string_type* s, size_t new_size) {
   49|    596|    s->__resize_default_init(new_size);
   50|    596|  }

_ZN4absl12lts_2026081719str_format_internal13ConvertIntArgIcEEbT_NS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  369|  5.85k|bool ConvertIntArg(T v, FormatConversionSpecImpl conv, FormatSinkImpl *sink) {
  370|  5.85k|  using U = typename MakeUnsigned<T>::type;
  371|  5.85k|  IntDigits as_digits;
  372|       |
  373|       |  // This odd casting is due to a bug in -Wswitch behavior in gcc49 which causes
  374|       |  // it to complain about a switch/case type mismatch, even though both are
  375|       |  // FormatConversionChar.  Likely this is because at this point
  376|       |  // FormatConversionChar is declared, but not defined.
  377|  5.85k|  switch (static_cast<uint8_t>(conv.conversion_char())) {
  378|  5.85k|    case static_cast<uint8_t>(FormatConversionCharInternal::c):
  ------------------
  |  Branch (378:5): [True: 5.85k, False: 0]
  ------------------
  379|  5.85k|      return (std::is_same_v<T, wchar_t> || (conv.length_mod() == LengthMod::l))
  ------------------
  |  Branch (379:15): [Folded, False: 5.85k]
  |  Branch (379:45): [True: 0, False: 5.85k]
  ------------------
  380|  5.85k|                 ? ConvertWCharTImpl(static_cast<wchar_t>(v), conv, sink)
  381|  5.85k|                 : ConvertCharImpl(static_cast<char>(v), conv, sink);
  382|       |
  383|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::o):
  ------------------
  |  Branch (383:5): [True: 0, False: 5.85k]
  ------------------
  384|      0|      as_digits.PrintAsOct(static_cast<U>(v));
  385|      0|      break;
  386|       |
  387|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::x):
  ------------------
  |  Branch (387:5): [True: 0, False: 5.85k]
  ------------------
  388|      0|      as_digits.PrintAsHexLower(static_cast<U>(v));
  389|      0|      break;
  390|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::X):
  ------------------
  |  Branch (390:5): [True: 0, False: 5.85k]
  ------------------
  391|      0|      as_digits.PrintAsHexUpper(static_cast<U>(v));
  392|      0|      break;
  393|       |
  394|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::u):
  ------------------
  |  Branch (394:5): [True: 0, False: 5.85k]
  ------------------
  395|      0|      as_digits.PrintAsDec(static_cast<U>(v));
  396|      0|      break;
  397|       |
  398|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::d):
  ------------------
  |  Branch (398:5): [True: 0, False: 5.85k]
  ------------------
  399|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::i):
  ------------------
  |  Branch (399:5): [True: 0, False: 5.85k]
  ------------------
  400|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::v):
  ------------------
  |  Branch (400:5): [True: 0, False: 5.85k]
  ------------------
  401|      0|      as_digits.PrintAsDec(v);
  402|      0|      break;
  403|       |
  404|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::a):
  ------------------
  |  Branch (404:5): [True: 0, False: 5.85k]
  ------------------
  405|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::e):
  ------------------
  |  Branch (405:5): [True: 0, False: 5.85k]
  ------------------
  406|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::f):
  ------------------
  |  Branch (406:5): [True: 0, False: 5.85k]
  ------------------
  407|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::g):
  ------------------
  |  Branch (407:5): [True: 0, False: 5.85k]
  ------------------
  408|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::A):
  ------------------
  |  Branch (408:5): [True: 0, False: 5.85k]
  ------------------
  409|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::E):
  ------------------
  |  Branch (409:5): [True: 0, False: 5.85k]
  ------------------
  410|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::F):
  ------------------
  |  Branch (410:5): [True: 0, False: 5.85k]
  ------------------
  411|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::G):
  ------------------
  |  Branch (411:5): [True: 0, False: 5.85k]
  ------------------
  412|      0|      return ConvertFloatImpl(static_cast<double>(v), conv, sink);
  413|       |
  414|      0|    default:
  ------------------
  |  Branch (414:5): [True: 0, False: 5.85k]
  ------------------
  415|      0|      ABSL_ASSUME(false);
  ------------------
  |  |  272|      0|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  416|  5.85k|  }
  417|       |
  418|      0|  if (conv.is_basic()) {
  ------------------
  |  Branch (418:7): [True: 0, False: 0]
  ------------------
  419|      0|    sink->Append(as_digits.with_neg_and_zero());
  420|      0|    return true;
  421|      0|  }
  422|      0|  return ConvertIntImplInnerSlow(as_digits, conv, sink);
  423|      0|}
_ZN4absl12lts_2026081719str_format_internal13ConvertIntArgIiEEbT_NS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  369|  18.0k|bool ConvertIntArg(T v, FormatConversionSpecImpl conv, FormatSinkImpl *sink) {
  370|  18.0k|  using U = typename MakeUnsigned<T>::type;
  371|  18.0k|  IntDigits as_digits;
  372|       |
  373|       |  // This odd casting is due to a bug in -Wswitch behavior in gcc49 which causes
  374|       |  // it to complain about a switch/case type mismatch, even though both are
  375|       |  // FormatConversionChar.  Likely this is because at this point
  376|       |  // FormatConversionChar is declared, but not defined.
  377|  18.0k|  switch (static_cast<uint8_t>(conv.conversion_char())) {
  378|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::c):
  ------------------
  |  Branch (378:5): [True: 0, False: 18.0k]
  ------------------
  379|      0|      return (std::is_same_v<T, wchar_t> || (conv.length_mod() == LengthMod::l))
  ------------------
  |  Branch (379:15): [Folded, False: 0]
  |  Branch (379:45): [True: 0, False: 0]
  ------------------
  380|      0|                 ? ConvertWCharTImpl(static_cast<wchar_t>(v), conv, sink)
  381|      0|                 : ConvertCharImpl(static_cast<char>(v), conv, sink);
  382|       |
  383|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::o):
  ------------------
  |  Branch (383:5): [True: 0, False: 18.0k]
  ------------------
  384|      0|      as_digits.PrintAsOct(static_cast<U>(v));
  385|      0|      break;
  386|       |
  387|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::x):
  ------------------
  |  Branch (387:5): [True: 0, False: 18.0k]
  ------------------
  388|      0|      as_digits.PrintAsHexLower(static_cast<U>(v));
  389|      0|      break;
  390|    512|    case static_cast<uint8_t>(FormatConversionCharInternal::X):
  ------------------
  |  Branch (390:5): [True: 512, False: 17.5k]
  ------------------
  391|    512|      as_digits.PrintAsHexUpper(static_cast<U>(v));
  392|    512|      break;
  393|       |
  394|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::u):
  ------------------
  |  Branch (394:5): [True: 0, False: 18.0k]
  ------------------
  395|      0|      as_digits.PrintAsDec(static_cast<U>(v));
  396|      0|      break;
  397|       |
  398|  17.5k|    case static_cast<uint8_t>(FormatConversionCharInternal::d):
  ------------------
  |  Branch (398:5): [True: 17.5k, False: 512]
  ------------------
  399|  17.5k|    case static_cast<uint8_t>(FormatConversionCharInternal::i):
  ------------------
  |  Branch (399:5): [True: 0, False: 18.0k]
  ------------------
  400|  17.5k|    case static_cast<uint8_t>(FormatConversionCharInternal::v):
  ------------------
  |  Branch (400:5): [True: 0, False: 18.0k]
  ------------------
  401|  17.5k|      as_digits.PrintAsDec(v);
  402|  17.5k|      break;
  403|       |
  404|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::a):
  ------------------
  |  Branch (404:5): [True: 0, False: 18.0k]
  ------------------
  405|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::e):
  ------------------
  |  Branch (405:5): [True: 0, False: 18.0k]
  ------------------
  406|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::f):
  ------------------
  |  Branch (406:5): [True: 0, False: 18.0k]
  ------------------
  407|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::g):
  ------------------
  |  Branch (407:5): [True: 0, False: 18.0k]
  ------------------
  408|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::A):
  ------------------
  |  Branch (408:5): [True: 0, False: 18.0k]
  ------------------
  409|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::E):
  ------------------
  |  Branch (409:5): [True: 0, False: 18.0k]
  ------------------
  410|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::F):
  ------------------
  |  Branch (410:5): [True: 0, False: 18.0k]
  ------------------
  411|      0|    case static_cast<uint8_t>(FormatConversionCharInternal::G):
  ------------------
  |  Branch (411:5): [True: 0, False: 18.0k]
  ------------------
  412|      0|      return ConvertFloatImpl(static_cast<double>(v), conv, sink);
  413|       |
  414|      0|    default:
  ------------------
  |  Branch (414:5): [True: 0, False: 18.0k]
  ------------------
  415|      0|      ABSL_ASSUME(false);
  ------------------
  |  |  272|      0|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  416|  18.0k|  }
  417|       |
  418|  18.0k|  if (conv.is_basic()) {
  ------------------
  |  Branch (418:7): [True: 0, False: 18.0k]
  ------------------
  419|      0|    sink->Append(as_digits.with_neg_and_zero());
  420|      0|    return true;
  421|      0|  }
  422|  18.0k|  return ConvertIntImplInnerSlow(as_digits, conv, sink);
  423|  18.0k|}
_ZN4absl12lts_2026081719str_format_internal17FormatConvertImplEcNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  556|  5.85k|                                    FormatSinkImpl *sink) {
  557|  5.85k|  return {ConvertIntArg(v, conv, sink)};
  558|  5.85k|}
_ZN4absl12lts_2026081719str_format_internal17FormatConvertImplEiNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  588|  18.0k|                                        FormatSinkImpl *sink) {
  589|  18.0k|  return {ConvertIntArg(v, conv, sink)};
  590|  18.0k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_115ConvertCharImplEcNS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  226|  5.85k|                     FormatSinkImpl* sink) {
  227|  5.85k|  size_t fill = 0;
  228|  5.85k|  if (conv.width() >= 0)
  ------------------
  |  Branch (228:7): [True: 0, False: 5.85k]
  ------------------
  229|      0|    fill = static_cast<size_t>(conv.width());
  230|  5.85k|  ReducePadding(1, &fill);
  231|  5.85k|  if (!conv.has_left_flag()) sink->Append(fill, ' ');
  ------------------
  |  Branch (231:7): [True: 5.85k, False: 0]
  ------------------
  232|  5.85k|  sink->Append(1, v);
  233|  5.85k|  if (conv.has_left_flag()) sink->Append(fill, ' ');
  ------------------
  |  Branch (233:7): [True: 0, False: 5.85k]
  ------------------
  234|  5.85k|  return true;
  235|  5.85k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_113ReducePaddingEmPm:
   54|  23.9k|void ReducePadding(size_t n, size_t *capacity) {
   55|  23.9k|  *capacity = Excess(n, *capacity);
   56|  23.9k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_123ConvertIntImplInnerSlowERKNS2_9IntDigitsENS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  239|  18.0k|                             FormatSinkImpl *sink) {
  240|       |  // Print as a sequence of Substrings:
  241|       |  //   [left_spaces][sign][base_indicator][zeroes][formatted][right_spaces]
  242|  18.0k|  size_t fill = 0;
  243|  18.0k|  if (conv.width() >= 0)
  ------------------
  |  Branch (243:7): [True: 18.0k, False: 0]
  ------------------
  244|  18.0k|    fill = static_cast<size_t>(conv.width());
  245|       |
  246|  18.0k|  string_view formatted = as_digits.without_neg_or_zero();
  247|  18.0k|  ReducePadding(formatted, &fill);
  248|       |
  249|  18.0k|  string_view sign = SignColumn(as_digits.is_negative(), conv);
  250|  18.0k|  ReducePadding(sign, &fill);
  251|       |
  252|  18.0k|  string_view base_indicator = BaseIndicator(as_digits, conv);
  253|  18.0k|  ReducePadding(base_indicator, &fill);
  254|       |
  255|  18.0k|  bool precision_specified = conv.precision() >= 0;
  256|  18.0k|  size_t precision =
  257|  18.0k|      precision_specified ? static_cast<size_t>(conv.precision()) : size_t{1};
  ------------------
  |  Branch (257:7): [True: 0, False: 18.0k]
  ------------------
  258|       |
  259|  18.0k|  if (conv.has_alt_flag() &&
  ------------------
  |  Branch (259:7): [True: 0, False: 18.0k]
  ------------------
  260|      0|      conv.conversion_char() == FormatConversionCharInternal::o) {
  ------------------
  |  Branch (260:7): [True: 0, False: 0]
  ------------------
  261|       |    // From POSIX description of the '#' (alt) flag:
  262|       |    //   "For o conversion, it increases the precision (if necessary) to
  263|       |    //   force the first digit of the result to be zero."
  264|      0|    if (formatted.empty() || *formatted.begin() != '0') {
  ------------------
  |  Branch (264:9): [True: 0, False: 0]
  |  Branch (264:30): [True: 0, False: 0]
  ------------------
  265|      0|      size_t needed = formatted.size() + 1;
  266|      0|      precision = std::max(precision, needed);
  267|      0|    }
  268|      0|  }
  269|       |
  270|  18.0k|  size_t num_zeroes = Excess(formatted.size(), precision);
  271|  18.0k|  ReducePadding(num_zeroes, &fill);
  272|       |
  273|  18.0k|  size_t num_left_spaces = !conv.has_left_flag() ? fill : 0;
  ------------------
  |  Branch (273:28): [True: 18.0k, False: 0]
  ------------------
  274|  18.0k|  size_t num_right_spaces = conv.has_left_flag() ? fill : 0;
  ------------------
  |  Branch (274:29): [True: 0, False: 18.0k]
  ------------------
  275|       |
  276|       |  // From POSIX description of the '0' (zero) flag:
  277|       |  //   "For d, i, o, u, x, and X conversion specifiers, if a precision
  278|       |  //   is specified, the '0' flag is ignored."
  279|  18.0k|  if (!precision_specified && conv.has_zero_flag()) {
  ------------------
  |  Branch (279:7): [True: 18.0k, False: 0]
  |  Branch (279:31): [True: 12.2k, False: 5.85k]
  ------------------
  280|  12.2k|    num_zeroes += num_left_spaces;
  281|  12.2k|    num_left_spaces = 0;
  282|  12.2k|  }
  283|       |
  284|  18.0k|  sink->Append(num_left_spaces, ' ');
  285|  18.0k|  sink->Append(sign);
  286|  18.0k|  sink->Append(base_indicator);
  287|  18.0k|  sink->Append(num_zeroes, '0');
  288|  18.0k|  sink->Append(formatted);
  289|  18.0k|  sink->Append(num_right_spaces, ' ');
  290|  18.0k|  return true;
  291|  18.0k|}
arg.cc:_ZNK4absl12lts_2026081719str_format_internal12_GLOBAL__N_19IntDigits19without_neg_or_zeroEv:
  179|  18.0k|  string_view without_neg_or_zero() const {
  180|  18.0k|    static_assert('-' < '0', "The check below verifies both.");
  181|  18.0k|    size_t advance = start_[0] <= '0' ? 1 : 0;
  ------------------
  |  Branch (181:22): [True: 2, False: 18.0k]
  ------------------
  182|  18.0k|    return {start_ + advance, size_ - advance};
  183|  18.0k|  }
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_113ReducePaddingENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEPm:
   49|  54.2k|void ReducePadding(string_view s, size_t *capacity) {
   50|  54.2k|  *capacity = Excess(s.size(), *capacity);
   51|  54.2k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_110SignColumnEbNS1_24FormatConversionSpecImplE:
  214|  18.0k|string_view SignColumn(bool neg, const FormatConversionSpecImpl conv) {
  215|  18.0k|  if (conv.conversion_char() == FormatConversionCharInternal::d ||
  ------------------
  |  Branch (215:7): [True: 17.5k, False: 512]
  ------------------
  216|  17.5k|      conv.conversion_char() == FormatConversionCharInternal::i) {
  ------------------
  |  Branch (216:7): [True: 0, False: 512]
  ------------------
  217|  17.5k|    if (neg) return "-";
  ------------------
  |  Branch (217:9): [True: 0, False: 17.5k]
  ------------------
  218|  17.5k|    if (conv.has_show_pos_flag()) return "+";
  ------------------
  |  Branch (218:9): [True: 0, False: 17.5k]
  ------------------
  219|  17.5k|    if (conv.has_sign_col_flag()) return " ";
  ------------------
  |  Branch (219:9): [True: 0, False: 17.5k]
  ------------------
  220|  17.5k|  }
  221|  18.0k|  return {};
  222|  18.0k|}
arg.cc:_ZNK4absl12lts_2026081719str_format_internal12_GLOBAL__N_19IntDigits11is_negativeEv:
  185|  18.0k|  bool is_negative() const { return start_[0] == '-'; }
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_113BaseIndicatorERKNS2_9IntDigitsENS1_24FormatConversionSpecImplE:
  197|  18.0k|                          const FormatConversionSpecImpl conv) {
  198|       |  // always show 0x for %p.
  199|  18.0k|  bool alt = conv.has_alt_flag() ||
  ------------------
  |  Branch (199:14): [True: 0, False: 18.0k]
  ------------------
  200|  18.0k|             conv.conversion_char() == FormatConversionCharInternal::p;
  ------------------
  |  Branch (200:14): [True: 0, False: 18.0k]
  ------------------
  201|  18.0k|  bool hex = (conv.conversion_char() == FormatConversionCharInternal::x ||
  ------------------
  |  Branch (201:15): [True: 0, False: 18.0k]
  ------------------
  202|  18.0k|              conv.conversion_char() == FormatConversionCharInternal::X ||
  ------------------
  |  Branch (202:15): [True: 512, False: 17.5k]
  ------------------
  203|  17.5k|              conv.conversion_char() == FormatConversionCharInternal::p);
  ------------------
  |  Branch (203:15): [True: 0, False: 17.5k]
  ------------------
  204|       |  // From the POSIX description of '#' flag:
  205|       |  //   "For x or X conversion specifiers, a non-zero result shall have
  206|       |  //   0x (or 0X) prefixed to it."
  207|  18.0k|  if (alt && hex && !as_digits.without_neg_or_zero().empty()) {
  ------------------
  |  Branch (207:7): [True: 0, False: 18.0k]
  |  Branch (207:7): [True: 0, False: 18.0k]
  |  Branch (207:14): [True: 0, False: 0]
  |  Branch (207:21): [True: 0, False: 0]
  ------------------
  208|      0|    return conv.conversion_char() == FormatConversionCharInternal::X ? "0X"
  ------------------
  |  Branch (208:12): [True: 0, False: 0]
  ------------------
  209|      0|                                                                     : "0x";
  210|      0|  }
  211|  18.0k|  return {};
  212|  18.0k|}
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_19IntDigits15PrintAsHexUpperIjEEvT_:
  160|    512|  void PrintAsHexUpper(T v) {
  161|    512|    static_assert(!IsSigned<T>::value, "");
  162|    512|    char *p = storage_ + sizeof(storage_);
  163|       |
  164|       |    // kHexTable is only lowercase, so do it manually for uppercase.
  165|    992|    do {
  166|    992|      *--p = "0123456789ABCDEF"[static_cast<size_t>(v) & 15];
  167|    992|      v >>= 4;
  168|    992|    } while (v);
  ------------------
  |  Branch (168:14): [True: 480, False: 512]
  ------------------
  169|    512|    start_ = p;
  170|    512|    size_ = static_cast<size_t>(storage_ + sizeof(storage_) - p);
  171|    512|  }
arg.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_19IntDigits10PrintAsDecIiEEvT_:
   98|  17.5k|  void PrintAsDec(T v) {
   99|  17.5k|    static_assert(std::is_integral_v<T>, "");
  100|  17.5k|    start_ = storage_;
  101|  17.5k|    size_ = static_cast<size_t>(numbers_internal::FastIntToBuffer(v, storage_) -
  102|  17.5k|                                storage_);
  103|  17.5k|  }

_ZN4absl12lts_2026081719str_format_internal14ExtractCharSetILNS0_23FormatConversionCharSetE655355EEES3_NS1_16ArgConvertResultIXT_EEE:
  205|  18.0k|constexpr FormatConversionCharSet ExtractCharSet(ArgConvertResult<C>) {
  206|  18.0k|  return C;
  207|  18.0k|}
_ZN4absl12lts_2026081719str_format_internal13FormatArgImplC2IiEERKT_:
  490|  18.0k|  explicit FormatArgImpl(const T& value) {
  491|  18.0k|    using D = typename DecayType<T>::type;
  492|  18.0k|    static_assert(
  493|  18.0k|        std::is_same_v<D, const T&> || storage_policy<D>::value == ByValue,
  494|  18.0k|        "Decayed types must be stored by value");
  495|  18.0k|    Init(static_cast<D>(value));
  496|  18.0k|  }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl4InitIiEEvRKT_:
  543|  18.0k|  void Init(const T& value) {
  544|  18.0k|    data_ = Manager<T>::SetValue(value);
  545|  18.0k|    dispatcher_ = &Dispatch<T>;
  546|  18.0k|  }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl7ManagerIiLNS2_13StoragePolicyE2EE8SetValueERKi:
  529|  18.0k|    static Data SetValue(const T& value) {
  530|  18.0k|      Data data;
  531|  18.0k|      memcpy(data.buf, &value, sizeof(value));
  532|  18.0k|      return data;
  533|  18.0k|    }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl8DispatchIiEEbNS2_4DataENS1_24FormatConversionSpecImplEPv:
  584|  18.0k|  static bool Dispatch(Data arg, FormatConversionSpecImpl spec, void* out) {
  585|       |    // A `none` conv indicates that we want the `int` conversion.
  586|  18.0k|    if (ABSL_PREDICT_FALSE(spec.conversion_char() ==
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  ------------------
  ------------------
  587|  18.0k|                           FormatConversionCharInternal::kNone)) {
  588|      0|      return ToInt<T>(arg, static_cast<int*>(out), std::is_integral<T>(),
  589|      0|                      std::is_enum<T>());
  590|      0|    }
  591|  18.0k|    if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  ------------------
  ------------------
  592|  18.0k|            !Contains(ArgumentToConv<T>(), spec.conversion_char()))) {
  593|      0|      return false;
  594|      0|    }
  595|  18.0k|    return str_format_internal::FormatConvertImpl(
  596|  18.0k|               Manager<T>::Value(arg), spec, static_cast<FormatSinkImpl*>(out))
  597|  18.0k|        .value;
  598|  18.0k|  }
_ZN4absl12lts_2026081719str_format_internal14ArgumentToConvIiEENS0_23FormatConversionCharSetEv:
  418|  18.0k|constexpr FormatConversionCharSet ArgumentToConv() {
  419|  18.0k|  using ConvResult = decltype(str_format_internal::FormatConvertImpl(
  420|  18.0k|      std::declval<const Arg&>(),
  421|  18.0k|      std::declval<const FormatConversionSpecImpl&>(),
  422|  18.0k|      std::declval<FormatSinkImpl*>()));
  423|  18.0k|  return absl::str_format_internal::ExtractCharSet(ConvResult{});
  424|  18.0k|}
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl7ManagerIiLNS2_13StoragePolicyE2EE5ValueENS2_4DataE:
  535|  18.0k|    static T Value(Data arg) {
  536|  18.0k|      T value;
  537|  18.0k|      memcpy(&value, arg.buf, sizeof(T));
  538|  18.0k|      return value;
  539|  18.0k|    }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl8DispatchIcEEbNS2_4DataENS1_24FormatConversionSpecImplEPv:
  584|  5.85k|  static bool Dispatch(Data arg, FormatConversionSpecImpl spec, void* out) {
  585|       |    // A `none` conv indicates that we want the `int` conversion.
  586|  5.85k|    if (ABSL_PREDICT_FALSE(spec.conversion_char() ==
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
  587|  5.85k|                           FormatConversionCharInternal::kNone)) {
  588|      0|      return ToInt<T>(arg, static_cast<int*>(out), std::is_integral<T>(),
  589|      0|                      std::is_enum<T>());
  590|      0|    }
  591|  5.85k|    if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
  592|  5.85k|            !Contains(ArgumentToConv<T>(), spec.conversion_char()))) {
  593|      0|      return false;
  594|      0|    }
  595|  5.85k|    return str_format_internal::FormatConvertImpl(
  596|  5.85k|               Manager<T>::Value(arg), spec, static_cast<FormatSinkImpl*>(out))
  597|  5.85k|        .value;
  598|  5.85k|  }
_ZN4absl12lts_2026081719str_format_internal14ArgumentToConvIcEENS0_23FormatConversionCharSetEv:
  418|  5.85k|constexpr FormatConversionCharSet ArgumentToConv() {
  419|  5.85k|  using ConvResult = decltype(str_format_internal::FormatConvertImpl(
  420|  5.85k|      std::declval<const Arg&>(),
  421|  5.85k|      std::declval<const FormatConversionSpecImpl&>(),
  422|  5.85k|      std::declval<FormatSinkImpl*>()));
  423|  5.85k|  return absl::str_format_internal::ExtractCharSet(ConvResult{});
  424|  5.85k|}
_ZN4absl12lts_2026081719str_format_internal14ExtractCharSetILNS0_23FormatConversionCharSetE131067EEES3_NS1_16ArgConvertResultIXT_EEE:
  205|  5.85k|constexpr FormatConversionCharSet ExtractCharSet(ArgConvertResult<C>) {
  206|  5.85k|  return C;
  207|  5.85k|}
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl7ManagerIcLNS2_13StoragePolicyE2EE5ValueENS2_4DataE:
  535|  5.85k|    static T Value(Data arg) {
  536|  5.85k|      T value;
  537|  5.85k|      memcpy(&value, arg.buf, sizeof(T));
  538|  5.85k|      return value;
  539|  5.85k|    }
_ZN4absl12lts_2026081719str_format_internal19FormatArgImplFriend7ConvertINS1_13FormatArgImplEEEbT_NS1_24FormatConversionSpecImplEPNS1_14FormatSinkImplE:
  407|  23.9k|                      FormatSinkImpl* out) {
  408|  23.9k|    return arg.dispatcher_(arg.data_, conv, out);
  409|  23.9k|  }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImplC2IcEERKT_:
  490|  5.85k|  explicit FormatArgImpl(const T& value) {
  491|  5.85k|    using D = typename DecayType<T>::type;
  492|  5.85k|    static_assert(
  493|  5.85k|        std::is_same_v<D, const T&> || storage_policy<D>::value == ByValue,
  494|  5.85k|        "Decayed types must be stored by value");
  495|  5.85k|    Init(static_cast<D>(value));
  496|  5.85k|  }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl4InitIcEEvRKT_:
  543|  5.85k|  void Init(const T& value) {
  544|  5.85k|    data_ = Manager<T>::SetValue(value);
  545|  5.85k|    dispatcher_ = &Dispatch<T>;
  546|  5.85k|  }
_ZN4absl12lts_2026081719str_format_internal13FormatArgImpl7ManagerIcLNS2_13StoragePolicyE2EE8SetValueERKc:
  529|  5.85k|    static Data SetValue(const T& value) {
  530|  5.85k|      Data data;
  531|  5.85k|      memcpy(data.buf, &value, sizeof(value));
  532|  5.85k|      return data;
  533|  5.85k|    }

_ZN4absl12lts_2026081719str_format_internal13FormatUntypedENS1_17FormatRawSinkImplENS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEE:
  214|  6.37k|                   absl::Span<const FormatArgImpl> args) {
  215|  6.37k|  FormatSinkImpl sink(raw_sink);
  216|  6.37k|  using Converter = DefaultConverter;
  217|  6.37k|  return ConvertAll(format, args, Converter(&sink));
  218|  6.37k|}
_ZN4absl12lts_2026081719str_format_internal10FormatPackENS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEE:
  235|    512|                       absl::Span<const FormatArgImpl> args) {
  236|    512|  std::string out;
  237|    512|  if (ABSL_PREDICT_FALSE(!FormatUntyped(&out, format, args))) {
  ------------------
  |  |  190|    512|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 512]
  |  |  |  Branch (190:49): [Folded, False: 512]
  |  |  |  Branch (190:58): [True: 0, False: 512]
  |  |  ------------------
  ------------------
  238|      0|    out.clear();
  239|      0|  }
  240|    512|  return out;
  241|    512|}
_ZN4absl12lts_2026081719str_format_internal8SnprintFEPcmNS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEE:
  262|  5.85k|             absl::Span<const FormatArgImpl> args) {
  263|  5.85k|  BufferRawSink sink(output, size ? size - 1 : 0);
  ------------------
  |  Branch (263:30): [True: 5.85k, False: 0]
  ------------------
  264|  5.85k|  if (!FormatUntyped(&sink, format, args)) {
  ------------------
  |  Branch (264:7): [True: 0, False: 5.85k]
  ------------------
  265|      0|    errno = EINVAL;
  266|      0|    return -1;
  267|      0|  }
  268|  5.85k|  size_t total = sink.total_written();
  269|  5.85k|  if (size) output[std::min(total, size - 1)] = 0;
  ------------------
  |  Branch (269:7): [True: 5.85k, False: 0]
  ------------------
  270|  5.85k|  return static_cast<int>(total);
  271|  5.85k|}
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_110ArgContextC2ENS0_4SpanIKNS1_13FormatArgImplEEE:
   55|  6.37k|  explicit ArgContext(absl::Span<const FormatArgImpl> pack) : pack_(pack) {}
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_110ArgContext4BindEPKNS1_17UnboundConversionEPNS1_15BoundConversionE:
   70|  23.9k|                             BoundConversion* bound) {
   71|  23.9k|  const FormatArgImpl* arg = nullptr;
   72|  23.9k|  int arg_position = unbound->arg_position;
   73|  23.9k|  if (static_cast<size_t>(arg_position - 1) >= pack_.size()) return false;
  ------------------
  |  Branch (73:7): [True: 0, False: 23.9k]
  ------------------
   74|  23.9k|  arg = &pack_[static_cast<size_t>(arg_position - 1)];  // 1-based
   75|       |
   76|  23.9k|  if (unbound->flags != Flags::kBasic) {
  ------------------
  |  Branch (76:7): [True: 18.0k, False: 5.85k]
  ------------------
   77|  18.0k|    int width = unbound->width.value();
   78|  18.0k|    bool force_left = false;
   79|  18.0k|    if (unbound->width.is_from_arg()) {
  ------------------
  |  Branch (79:9): [True: 0, False: 18.0k]
  ------------------
   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|  18.0k|    int precision = unbound->precision.value();
   92|  18.0k|    if (unbound->precision.is_from_arg()) {
  ------------------
  |  Branch (92:9): [True: 0, False: 18.0k]
  ------------------
   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|  18.0k|    FormatConversionSpecImplFriend::SetWidth(width, bound);
   99|  18.0k|    FormatConversionSpecImplFriend::SetPrecision(precision, bound);
  100|       |
  101|  18.0k|    if (force_left) {
  ------------------
  |  Branch (101:9): [True: 0, False: 18.0k]
  ------------------
  102|      0|      FormatConversionSpecImplFriend::SetFlags(unbound->flags | Flags::kLeft,
  103|      0|                                               bound);
  104|  18.0k|    } else {
  105|  18.0k|      FormatConversionSpecImplFriend::SetFlags(unbound->flags, bound);
  106|  18.0k|    }
  107|       |
  108|  18.0k|    FormatConversionSpecImplFriend::SetLengthMod(unbound->length_mod, bound);
  109|  18.0k|  } else {
  110|  5.85k|    FormatConversionSpecImplFriend::SetFlags(unbound->flags, bound);
  111|  5.85k|    FormatConversionSpecImplFriend::SetWidth(-1, bound);
  112|  5.85k|    FormatConversionSpecImplFriend::SetPrecision(-1, bound);
  113|  5.85k|  }
  114|  23.9k|  FormatConversionSpecImplFriend::SetConversionChar(unbound->conv, bound);
  115|  23.9k|  bound->set_arg(arg);
  116|  23.9k|  return true;
  117|  23.9k|}
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_116DefaultConverterC2EPNS1_14FormatSinkImplE:
  154|  6.37k|  explicit DefaultConverter(FormatSinkImpl* sink) : sink_(sink) {}
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_110ConvertAllINS2_16DefaultConverterEEEbNS1_21UntypedFormatSpecImplENS0_4SpanIKNS1_13FormatArgImplEEET_:
  142|  6.37k|                absl::Span<const FormatArgImpl> args, Converter converter) {
  143|  6.37k|  if (format.has_parsed_conversion()) {
  ------------------
  |  Branch (143:7): [True: 0, False: 6.37k]
  ------------------
  144|      0|    return format.parsed_conversion()->ProcessFormat(
  145|      0|        ConverterConsumer<Converter>(converter, args));
  146|  6.37k|  } else {
  147|  6.37k|    return ParseFormatString(format.str(),
  148|  6.37k|                             ConverterConsumer<Converter>(converter, args));
  149|  6.37k|  }
  150|  6.37k|}
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_117ConverterConsumerINS2_16DefaultConverterEE10ConvertOneERKNS1_17UnboundConversionENSt3__117basic_string_viewIcNS9_11char_traitsIcEEEE:
  129|  23.9k|  bool ConvertOne(const UnboundConversion& conv, string_view conv_string) {
  130|  23.9k|    BoundConversion bound;
  131|  23.9k|    if (!arg_context_.Bind(&conv, &bound)) return false;
  ------------------
  |  Branch (131:9): [True: 0, False: 23.9k]
  ------------------
  132|  23.9k|    return converter_.ConvertOne(bound, conv_string);
  133|  23.9k|  }
bind.cc:_ZNK4absl12lts_2026081719str_format_internal12_GLOBAL__N_116DefaultConverter10ConvertOneERKNS1_15BoundConversionENSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE:
  158|  23.9k|  bool ConvertOne(const BoundConversion& bound, string_view /*conv*/) const {
  159|  23.9k|    return FormatArgImplFriend::Convert(*bound.arg(), bound, sink_);
  160|  23.9k|  }
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_117ConverterConsumerINS2_16DefaultConverterEE6AppendENSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE:
  125|  30.3k|  bool Append(string_view s) {
  126|  30.3k|    converter_.Append(s);
  127|  30.3k|    return true;
  128|  30.3k|  }
bind.cc:_ZNK4absl12lts_2026081719str_format_internal12_GLOBAL__N_116DefaultConverter6AppendENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE:
  156|  30.3k|  void Append(string_view s) const { sink_->Append(s); }
bind.cc:_ZN4absl12lts_2026081719str_format_internal12_GLOBAL__N_117ConverterConsumerINS2_16DefaultConverterEEC2ES4_NS0_4SpanIKNS1_13FormatArgImplEEE:
  123|  6.37k|      : converter_(converter), arg_context_(pack) {}

_ZNK4absl12lts_2026081719str_format_internal15BoundConversion3argEv:
   43|  23.9k|  const FormatArgImpl* arg() const { return arg_; }
_ZN4absl12lts_2026081719str_format_internal15BoundConversion7set_argEPKNS1_13FormatArgImplE:
   44|  23.9k|  void set_arg(const FormatArgImpl* a) { arg_ = a; }
_ZN4absl12lts_2026081719str_format_internal21UntypedFormatSpecImplC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   56|  6.37k|      : data_(s.data()), size_(s.size()) {}
_ZNK4absl12lts_2026081719str_format_internal21UntypedFormatSpecImpl21has_parsed_conversionEv:
   61|  6.37k|  bool has_parsed_conversion() const { return size_ == ~size_t{}; }
_ZNK4absl12lts_2026081719str_format_internal21UntypedFormatSpecImpl3strEv:
   63|  6.37k|  string_view str() const {
   64|       |    assert(!has_parsed_conversion());
   65|  6.37k|    return string_view(static_cast<const char*>(data_), size_);
   66|  6.37k|  }
_ZN4absl12lts_2026081719str_format_internal21UntypedFormatSpecImpl7ExtractINS1_18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE655355EEEEEERKS2_RKT_:
   73|    512|  static const UntypedFormatSpecImpl& Extract(const T& s) {
   74|    512|    return s.spec_;
   75|    512|  }
_ZN4absl12lts_2026081719str_format_internal18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE655355EEEC2EUa9enable_ifIXclL_ZNS1_15ValidFormatImplIJLS3_655355EEEEbNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEfL0p_EEEPKc:
  159|    512|      : Base(s) {}
_ZN4absl12lts_2026081719str_format_internal21UntypedFormatSpecImpl7ExtractINS1_18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE131067ELS5_655355ELS5_655355ELS5_655355EEEEEERKS2_RKT_:
   73|  5.85k|  static const UntypedFormatSpecImpl& Extract(const T& s) {
   74|  5.85k|    return s.spec_;
   75|  5.85k|  }
_ZN4absl12lts_2026081719str_format_internal18FormatSpecTemplateIJLNS0_23FormatConversionCharSetE131067ELS3_655355ELS3_655355ELS3_655355EEEC2EUa9enable_ifIXclL_ZNS1_15ValidFormatImplIJLS3_131067ELS3_655355ELS3_655355ELS3_655355EEEEbNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEEEfL0p_EEEPKc:
  159|  5.85k|      : Base(s) {}

_ZN4absl12lts_2026081719str_format_internal17UnboundConversionC2Ev:
   36|  23.9k|  UnboundConversion() {}  // NOLINT
_ZN4absl12lts_2026081719str_format_internal17UnboundConversion10InputValue9set_valueEi:
   45|  18.0k|    constexpr void set_value(int value) {
   46|       |      assert(value >= 0);
   47|  18.0k|      value_ = value;
   48|  18.0k|    }
_ZNK4absl12lts_2026081719str_format_internal17UnboundConversion10InputValue5valueEv:
   49|  36.1k|    constexpr int value() const { return value_; }
_ZNK4absl12lts_2026081719str_format_internal17UnboundConversion10InputValue11is_from_argEv:
   60|  36.1k|    constexpr bool is_from_arg() const { return value_ < -1; }
_ZNK4absl12lts_2026081719str_format_internal7ConvTag7is_convEv:
   94|  42.0k|  constexpr bool is_conv() const { return (tag_ & 0x80) == 0; }
_ZNK4absl12lts_2026081719str_format_internal7ConvTag8is_flagsEv:
   96|  12.2k|  constexpr bool is_flags() const { return (tag_ & 0xE0) == 0xC0; }
_ZNK4absl12lts_2026081719str_format_internal7ConvTag7as_convEv:
   98|  23.9k|  constexpr FormatConversionChar as_conv() const {
   99|  23.9k|    assert(is_conv());
  100|  23.9k|    assert(!is_length());
  101|       |    assert(!is_flags());
  102|  23.9k|    return static_cast<FormatConversionChar>(tag_);
  103|  23.9k|  }
_ZNK4absl12lts_2026081719str_format_internal7ConvTag8as_flagsEv:
  110|  12.2k|  constexpr Flags as_flags() const {
  111|  12.2k|    assert(!is_conv());
  112|  12.2k|    assert(!is_length());
  113|       |    assert(is_flags());
  114|  12.2k|    return static_cast<Flags>(tag_ & 0x1F);
  115|  12.2k|  }
_ZN4absl12lts_2026081719str_format_internal17ConsumeConversionILb0EEEPKcS4_S4_PNS1_17UnboundConversionEPi:
  216|  18.0k|                                        int* next_arg) {
  217|  18.0k|  const char* const original_pos = pos;
  218|  18.0k|  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|  18.0k|#define ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR()          \
  222|  18.0k|  do {                                                  \
  223|  18.0k|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  224|  18.0k|    c = *pos++;                                         \
  225|  18.0k|  } while (0)
  226|       |
  227|  18.0k|  if (is_positional) {
  ------------------
  |  Branch (227:7): [Folded, False: 18.0k]
  ------------------
  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|  18.0k|  ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|  18.0k|  do {                                                  \
  |  |  223|  18.0k|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|  18.0k|    c = *pos++;                                         \
  |  |  225|  18.0k|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 18.0k]
  |  |  ------------------
  ------------------
  236|       |
  237|       |  // We should start with the basic flag on.
  238|  18.0k|  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|  18.0k|  if (c < 'A') {
  ------------------
  |  Branch (243:7): [True: 18.0k, False: 0]
  ------------------
  244|  30.3k|    while (c <= '0') {
  ------------------
  |  Branch (244:12): [True: 12.2k, False: 18.0k]
  ------------------
  245|  12.2k|      auto tag = GetTagForChar(c);
  246|  12.2k|      if (tag.is_flags()) {
  ------------------
  |  Branch (246:11): [True: 12.2k, False: 0]
  ------------------
  247|  12.2k|        conv->flags = conv->flags | tag.as_flags();
  248|  12.2k|        ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR();
  ------------------
  |  |  222|  12.2k|  do {                                                  \
  |  |  223|  12.2k|    if (ABSL_PREDICT_FALSE(pos == end)) return nullptr; \
  |  |  ------------------
  |  |  |  |  190|  12.2k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 12.2k]
  |  |  |  |  |  Branch (190:49): [Folded, False: 12.2k]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 12.2k]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  224|  12.2k|    c = *pos++;                                         \
  |  |  225|  12.2k|  } while (0)
  |  |  ------------------
  |  |  |  Branch (225:12): [Folded, False: 12.2k]
  |  |  ------------------
  ------------------
  249|  12.2k|      } else {
  250|      0|        break;
  251|      0|      }
  252|  12.2k|    }
  253|       |
  254|  18.0k|    if (c <= '9') {
  ------------------
  |  Branch (254:9): [True: 18.0k, False: 0]
  ------------------
  255|  18.0k|      if (c >= '0') {
  ------------------
  |  Branch (255:11): [True: 18.0k, False: 0]
  ------------------
  256|  18.0k|        int maybe_width = ParseDigits(c, pos, end);
  257|  18.0k|        if (!is_positional && c == '$') {
  ------------------
  |  Branch (257:13): [True: 18.0k, Folded]
  |  Branch (257:31): [True: 0, False: 18.0k]
  ------------------
  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|  18.0k|        conv->flags = conv->flags | Flags::kNonBasic;
  264|  18.0k|        conv->width.set_value(maybe_width);
  265|  18.0k|      } 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|  18.0k|    }
  278|       |
  279|  18.0k|    if (c == '.') {
  ------------------
  |  Branch (279:9): [True: 0, False: 18.0k]
  ------------------
  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|  18.0k|  }
  299|       |
  300|  18.0k|  auto tag = GetTagForChar(c);
  301|       |
  302|  18.0k|  if (ABSL_PREDICT_FALSE(c == 'v' && conv->flags != Flags::kBasic)) {
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:59): [True: 0, False: 18.0k]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
  303|      0|    return nullptr;
  304|      0|  }
  305|       |
  306|  18.0k|  if (ABSL_PREDICT_FALSE(!tag.is_conv())) {
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  ------------------
  ------------------
  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|  18.0k|#undef ABSL_FORMAT_PARSER_INTERNAL_GET_CHAR
  332|       |
  333|  18.0k|  assert(CheckFastPathSetting(*conv));
  334|  18.0k|  (void)(&CheckFastPathSetting);
  335|       |
  336|  18.0k|  conv->conv = tag.as_conv();
  337|  18.0k|  if (!is_positional) conv->arg_position = ++*next_arg;
  ------------------
  |  Branch (337:7): [True: 18.0k, Folded]
  ------------------
  338|  18.0k|  return pos;
  339|  18.0k|}
_ZN4absl12lts_2026081719str_format_internal13GetTagForCharEc:
  169|  54.2k|constexpr ConvTag GetTagForChar(char c) {
  170|  54.2k|  return ConvTagHolder::value[static_cast<unsigned char>(c)];
  171|  54.2k|}
_ZN4absl12lts_2026081719str_format_internal11ParseDigitsERcRPKcS4_:
  196|  18.0k|constexpr int ParseDigits(char& c, const char*& pos, const char* const end) {
  197|  18.0k|  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|  18.0k|  int num_digits = std::numeric_limits<int>::digits10;
  202|  18.0k|  for (;;) {
  203|  18.0k|    if (ABSL_PREDICT_FALSE(pos == end)) break;
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  ------------------
  ------------------
  204|  18.0k|    c = *pos++;
  205|  18.0k|    if ('0' > c || c > '9') break;
  ------------------
  |  Branch (205:9): [True: 0, False: 18.0k]
  |  Branch (205:20): [True: 18.0k, 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|  18.0k|  return digits;
  211|  18.0k|}
_ZN4absl12lts_2026081719str_format_internal24ConsumeUnboundConversionEPKcS3_PNS1_17UnboundConversionEPi:
  348|  18.0k|                                               int* next_arg) {
  349|  18.0k|  if (*next_arg < 0) return ConsumeConversion<true>(p, end, conv, next_arg);
  ------------------
  |  Branch (349:7): [True: 0, False: 18.0k]
  ------------------
  350|  18.0k|  return ConsumeConversion<false>(p, end, conv, next_arg);
  351|  18.0k|}

_ZN4absl12lts_2026081719str_format_internal17FormatRawSinkImpl5WriteENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   48|  6.37k|  void Write(string_view s) { write_(sink_, s); }
_ZN4absl12lts_2026081719str_format_internal14FormatSinkImplC2ENS1_17FormatRawSinkImplE:
   68|  6.37k|  explicit FormatSinkImpl(FormatRawSinkImpl raw) : raw_(raw) {}
_ZN4absl12lts_2026081719str_format_internal14FormatSinkImplD2Ev:
   70|  6.37k|  ~FormatSinkImpl() { Flush(); }
_ZN4absl12lts_2026081719str_format_internal14FormatSinkImpl5FlushEv:
   72|  6.37k|  void Flush() {
   73|  6.37k|    raw_.Write(string_view(buf_, static_cast<size_t>(pos_ - buf_)));
   74|  6.37k|    pos_ = buf_;
   75|  6.37k|  }
_ZN4absl12lts_2026081719str_format_internal14FormatSinkImpl6AppendEmc:
   77|  65.9k|  void Append(size_t n, char c) {
   78|  65.9k|    if (n == 0) return;
  ------------------
  |  Branch (78:9): [True: 53.6k, False: 12.3k]
  ------------------
   79|  12.3k|    size_ += n;
   80|  12.3k|    auto raw_append = [&](size_t count) {
   81|  12.3k|      memset(pos_, c, count);
   82|  12.3k|      pos_ += count;
   83|  12.3k|    };
   84|  12.3k|    while (n > Avail()) {
  ------------------
  |  Branch (84:12): [True: 0, False: 12.3k]
  ------------------
   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|  12.3k|    raw_append(n);
   92|  12.3k|  }
_ZN4absl12lts_2026081719str_format_internal14FormatSinkImpl6AppendENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   94|  84.5k|  void Append(string_view v) {
   95|  84.5k|    size_t n = v.size();
   96|  84.5k|    if (n == 0) return;
  ------------------
  |  Branch (96:9): [True: 42.0k, False: 42.5k]
  ------------------
   97|  42.5k|    size_ += n;
   98|  42.5k|    if (n >= Avail()) {
  ------------------
  |  Branch (98:9): [True: 0, False: 42.5k]
  ------------------
   99|      0|      Flush();
  100|      0|      raw_.Write(v);
  101|      0|      return;
  102|      0|    }
  103|  42.5k|    memcpy(pos_, v.data(), n);
  104|  42.5k|    pos_ += n;
  105|  42.5k|  }
_ZNK4absl12lts_2026081719str_format_internal14FormatSinkImpl5AvailEv:
  123|  54.8k|  size_t Avail() const {
  124|  54.8k|    return static_cast<size_t>(buf_ + sizeof(buf_) - pos_);
  125|  54.8k|  }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl8is_basicEv:
  277|  18.0k|  bool is_basic() const { return flags_ == Flags::kBasic; }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl13has_left_flagEv:
  278|  47.8k|  bool has_left_flag() const { return FlagsContains(flags_, Flags::kLeft); }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl17has_show_pos_flagEv:
  279|  17.5k|  bool has_show_pos_flag() const {
  280|  17.5k|    return FlagsContains(flags_, Flags::kShowPos);
  281|  17.5k|  }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl17has_sign_col_flagEv:
  282|  17.5k|  bool has_sign_col_flag() const {
  283|  17.5k|    return FlagsContains(flags_, Flags::kSignCol);
  284|  17.5k|  }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl12has_alt_flagEv:
  285|  36.1k|  bool has_alt_flag() const { return FlagsContains(flags_, Flags::kAlt); }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl13has_zero_flagEv:
  286|  18.0k|  bool has_zero_flag() const { return FlagsContains(flags_, Flags::kZero); }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl10length_modEv:
  288|  5.85k|  LengthMod length_mod() const { return length_mod_; }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl15conversion_charEv:
  290|   162k|  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|   162k|    static_assert(offsetof(FormatConversionSpecImpl, conv_) == 0, "");
  294|   162k|    return conv_;
  295|   162k|  }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl5widthEv:
  301|  42.0k|  int width() const { return width_; }
_ZNK4absl12lts_2026081719str_format_internal24FormatConversionSpecImpl9precisionEv:
  304|  18.0k|  int precision() const { return precision_; }
_ZN4absl12lts_2026081719str_format_internal30FormatConversionSpecImplFriend8SetFlagsENS1_5FlagsEPNS1_24FormatConversionSpecImplE:
  321|  23.9k|  static void SetFlags(Flags f, FormatConversionSpecImpl* conv) {
  322|  23.9k|    conv->flags_ = f;
  323|  23.9k|  }
_ZN4absl12lts_2026081719str_format_internal30FormatConversionSpecImplFriend12SetLengthModENS0_9LengthModEPNS1_24FormatConversionSpecImplE:
  324|  18.0k|  static void SetLengthMod(LengthMod l, FormatConversionSpecImpl* conv) {
  325|  18.0k|    conv->length_mod_ = l;
  326|  18.0k|  }
_ZN4absl12lts_2026081719str_format_internal30FormatConversionSpecImplFriend17SetConversionCharENS0_20FormatConversionCharEPNS1_24FormatConversionSpecImplE:
  328|  23.9k|                                FormatConversionSpecImpl* conv) {
  329|  23.9k|    conv->conv_ = c;
  330|  23.9k|  }
_ZN4absl12lts_2026081719str_format_internal30FormatConversionSpecImplFriend8SetWidthEiPNS1_24FormatConversionSpecImplE:
  331|  23.9k|  static void SetWidth(int w, FormatConversionSpecImpl* conv) {
  332|  23.9k|    conv->width_ = w;
  333|  23.9k|  }
_ZN4absl12lts_2026081719str_format_internal30FormatConversionSpecImplFriend12SetPrecisionEiPNS1_24FormatConversionSpecImplE:
  334|  23.9k|  static void SetPrecision(int p, FormatConversionSpecImpl* conv) {
  335|  23.9k|    conv->precision_ = p;
  336|  23.9k|  }
_ZN4absl12lts_2026081719str_format_internalorENS1_5FlagsES2_:
  146|  30.3k|constexpr Flags operator|(Flags a, Flags b) {
  147|  30.3k|  return static_cast<Flags>(static_cast<uint8_t>(a) | static_cast<uint8_t>(b));
  148|  30.3k|}
_ZN4absl12lts_2026081719str_format_internal13FlagsContainsENS1_5FlagsES2_:
  150|   137k|constexpr bool FlagsContains(Flags haystack, Flags needle) {
  151|   137k|  return (static_cast<uint8_t>(haystack) & static_cast<uint8_t>(needle)) ==
  152|   137k|         static_cast<uint8_t>(needle);
  153|   137k|}
_ZN4absl12lts_2026081719str_format_internal29FormatConversionCharToConvIntENS0_20FormatConversionCharE:
  360|  23.9k|constexpr uint64_t FormatConversionCharToConvInt(FormatConversionChar c) {
  361|  23.9k|  return uint64_t{1} << (1 + static_cast<uint8_t>(c));
  362|  23.9k|}
_ZN4absl12lts_2026081719str_format_internal8ContainsENS0_23FormatConversionCharSetENS0_20FormatConversionCharE:
  442|  23.9k|constexpr bool Contains(FormatConversionCharSet set, FormatConversionChar c) {
  443|  23.9k|  return (static_cast<uint64_t>(set) & FormatConversionCharToConvInt(c)) != 0;
  444|  23.9k|}
_ZN4absl12lts_2026081719str_format_internal6ExcessEmm:
  447|  96.2k|inline size_t Excess(size_t used, size_t capacity) {
  448|  96.2k|  return used < capacity ? capacity - used : 0;
  ------------------
  |  Branch (448:10): [True: 25.8k, False: 70.3k]
  ------------------
  449|  96.2k|}
_ZZN4absl12lts_2026081719str_format_internal14FormatSinkImpl6AppendEmcENKUlmE_clEm:
   80|  12.3k|    auto raw_append = [&](size_t count) {
   81|  12.3k|      memset(pos_, c, count);
   82|  12.3k|      pos_ += count;
   83|  12.3k|    };
_ZN4absl12lts_2026081719str_format_internal17FormatRawSinkImplC2INSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEETnPDTclsr19str_format_internalE11InvokeFlushclsr3stdE7declvalIPT_EEcvNS4_17basic_string_viewIcS7_EE_EEELPv0EEESC_:
   46|    512|      : sink_(raw), write_(&FormatRawSinkImpl::Flush<T>) {}
_ZN4absl12lts_2026081719str_format_internal17FormatRawSinkImpl5FlushINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEvPvNS4_17basic_string_viewIcS7_EE:
   57|    512|  static void Flush(void* r, string_view s) {
   58|    512|    str_format_internal::InvokeFlush(static_cast<T*>(r), s);
   59|    512|  }
_ZN4absl12lts_2026081719str_format_internal17FormatRawSinkImplC2INS1_13BufferRawSinkETnPDTclsr19str_format_internalE11InvokeFlushclsr3stdE7declvalIPT_EEcvNSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE_EEELPv0EEES6_:
   46|  5.85k|      : sink_(raw), write_(&FormatRawSinkImpl::Flush<T>) {}
_ZN4absl12lts_2026081719str_format_internal17FormatRawSinkImpl5FlushINS1_13BufferRawSinkEEEvPvNSt3__117basic_string_viewIcNS6_11char_traitsIcEEEE:
   57|  5.85k|  static void Flush(void* r, string_view s) {
   58|  5.85k|    str_format_internal::InvokeFlush(static_cast<T*>(r), s);
   59|  5.85k|  }

_ZN4absl12lts_2026081719str_format_internal13BufferRawSink5WriteENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
   34|  5.85k|void BufferRawSink::Write(string_view v) {
   35|  5.85k|  size_t to_write = std::min(v.size(), size_);
   36|  5.85k|  if (to_write > 0) {
  ------------------
  |  Branch (36:7): [True: 5.85k, False: 0]
  ------------------
   37|  5.85k|    std::memcpy(buffer_, v.data(), to_write);
   38|  5.85k|    buffer_ += to_write;
   39|  5.85k|    size_ -= to_write;
   40|  5.85k|  }
   41|  5.85k|  total_written_ += v.size();
   42|  5.85k|}

_ZN4absl12lts_2026081719str_format_internal13BufferRawSinkC2EPcm:
   41|  5.85k|  BufferRawSink(char* buffer, size_t size) : buffer_(buffer), size_(size) {}
_ZNK4absl12lts_2026081719str_format_internal13BufferRawSink13total_writtenEv:
   43|  5.85k|  size_t total_written() const { return total_written_; }
_ZN4absl12lts_2026081719str_format_internal15AbslFormatFlushEPNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS2_17basic_string_viewIcS5_EE:
   71|    512|inline void AbslFormatFlush(std::string* out, string_view s) {
   72|    512|  out->append(s.data(), s.size());
   73|    512|}
_ZN4absl12lts_2026081719str_format_internal15AbslFormatFlushEPNS1_13BufferRawSinkENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEE:
   82|  5.85k|inline void AbslFormatFlush(BufferRawSink* sink, string_view v) {
   83|  5.85k|  sink->Write(v);
   84|  5.85k|}
_ZN4absl12lts_2026081719str_format_internal11InvokeFlushINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEEEDTcl15AbslFormatFlushfp_fp0_EEPT_NS3_17basic_string_viewIcS6_EE:
   89|    512|auto InvokeFlush(T* out, string_view s) -> decltype(AbslFormatFlush(out, s)) {
   90|    512|  AbslFormatFlush(out, s);
   91|    512|}
_ZN4absl12lts_2026081719str_format_internal11InvokeFlushINS1_13BufferRawSinkEEEDTcl15AbslFormatFlushfp_fp0_EEPT_NSt3__117basic_string_viewIcNS7_11char_traitsIcEEEE:
   89|  5.85k|auto InvokeFlush(T* out, string_view s) -> decltype(AbslFormatFlush(out, s)) {
   90|  5.85k|  AbslFormatFlush(out, s);
   91|  5.85k|}

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

bind.cc:_ZN4absl12lts_2026081719str_format_internal17ParseFormatStringINS1_12_GLOBAL__N_117ConverterConsumerINS3_16DefaultConverterEEEEEbNSt3__117basic_string_viewIcNS7_11char_traitsIcEEEET_:
   57|  6.37k|bool ParseFormatString(string_view src, Consumer consumer) {
   58|  6.37k|  int next_arg = 0;
   59|  6.37k|  const char* p = src.data();
   60|  6.37k|  const char* const end = p + src.size();
   61|  30.3k|  while (p != end) {
  ------------------
  |  Branch (61:10): [True: 30.3k, False: 0]
  ------------------
   62|  30.3k|    const char* percent =
   63|  30.3k|        static_cast<const char*>(memchr(p, '%', static_cast<size_t>(end - p)));
   64|  30.3k|    if (!percent) {
  ------------------
  |  Branch (64:9): [True: 6.37k, False: 23.9k]
  ------------------
   65|       |      // We found the last substring.
   66|  6.37k|      return consumer.Append(string_view(p, static_cast<size_t>(end - p)));
   67|  6.37k|    }
   68|       |    // We found a percent, so push the text run then process the percent.
   69|  23.9k|    if (ABSL_PREDICT_FALSE(!consumer.Append(
  ------------------
  |  |  190|  23.9k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 23.9k]
  |  |  |  Branch (190:49): [Folded, False: 23.9k]
  |  |  |  Branch (190:58): [True: 0, False: 23.9k]
  |  |  ------------------
  ------------------
   70|  23.9k|            string_view(p, static_cast<size_t>(percent - p))))) {
   71|      0|      return false;
   72|      0|    }
   73|  23.9k|    if (ABSL_PREDICT_FALSE(percent + 1 >= end)) return false;
  ------------------
  |  |  190|  23.9k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 23.9k]
  |  |  |  Branch (190:49): [Folded, False: 23.9k]
  |  |  |  Branch (190:58): [True: 0, False: 23.9k]
  |  |  ------------------
  ------------------
   74|       |
   75|  23.9k|    auto tag = GetTagForChar(percent[1]);
   76|  23.9k|    if (tag.is_conv()) {
  ------------------
  |  Branch (76:9): [True: 5.85k, False: 18.0k]
  ------------------
   77|  5.85k|      if (ABSL_PREDICT_FALSE(next_arg < 0)) {
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
   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|  5.85k|      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|  5.85k|      UnboundConversion conv;
   90|  5.85k|      conv.conv = tag.as_conv();
   91|  5.85k|      conv.arg_position = ++next_arg;
   92|  5.85k|      if (ABSL_PREDICT_FALSE(
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
   93|  5.85k|              !consumer.ConvertOne(conv, string_view(percent + 1, 1)))) {
   94|      0|        return false;
   95|      0|      }
   96|  18.0k|    } else if (percent[1] != '%') {
  ------------------
  |  Branch (96:16): [True: 18.0k, False: 0]
  ------------------
   97|  18.0k|      UnboundConversion conv;
   98|  18.0k|      p = ConsumeUnboundConversionNoInline(percent + 1, end, &conv, &next_arg);
   99|  18.0k|      if (ABSL_PREDICT_FALSE(p == nullptr)) return false;
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  ------------------
  ------------------
  100|  18.0k|      if (ABSL_PREDICT_FALSE(!consumer.ConvertOne(
  ------------------
  |  |  190|  18.0k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 18.0k]
  |  |  |  Branch (190:49): [Folded, False: 18.0k]
  |  |  |  Branch (190:58): [True: 0, False: 18.0k]
  |  |  ------------------
  ------------------
  101|  18.0k|              conv, string_view(percent + 1,
  102|  18.0k|                                static_cast<size_t>(p - (percent + 1)))))) {
  103|      0|        return false;
  104|      0|      }
  105|  18.0k|    } 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|  23.9k|  }
  111|      0|  return true;
  112|  6.37k|}

_ZN4absl12lts_2026081710StartsWithENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   59|  16.0M|                                 absl::string_view prefix) noexcept {
   60|  16.0M|  if (prefix.empty()) {
  ------------------
  |  Branch (60:7): [True: 0, False: 16.0M]
  ------------------
   61|      0|    return true;
   62|      0|  }
   63|  16.0M|  if (text.size() < prefix.size()) {
  ------------------
  |  Branch (63:7): [True: 2.93M, False: 13.1M]
  ------------------
   64|  2.93M|    return false;
   65|  2.93M|  }
   66|  13.1M|  absl::string_view possible_match = text.substr(0, prefix.size());
   67|       |
   68|  13.1M|  return possible_match == prefix;
   69|  16.0M|}
_ZN4absl12lts_202608178EndsWithENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   75|   273M|                               absl::string_view suffix) noexcept {
   76|   273M|  if (suffix.empty()) {
  ------------------
  |  Branch (76:7): [True: 0, False: 273M]
  ------------------
   77|      0|    return true;
   78|      0|  }
   79|   273M|  if (text.size() < suffix.size()) {
  ------------------
  |  Branch (79:7): [True: 100, False: 273M]
  ------------------
   80|    100|    return false;
   81|    100|  }
   82|   273M|  absl::string_view possible_match = text.substr(text.size() - suffix.size());
   83|   273M|  return possible_match == suffix;
   84|   273M|}

_ZN4absl12lts_2026081716numbers_internal15FastIntToBufferEiPc:
  350|  23.4k|    int32_t i, char* absl_nonnull buffer) {
  351|  23.4k|  uint32_t u = static_cast<uint32_t>(i);
  352|  23.4k|  if (i < 0) {
  ------------------
  |  Branch (352:7): [True: 0, False: 23.4k]
  ------------------
  353|      0|    *buffer++ = '-';
  354|       |    // We need to do the negation in modular (i.e., "unsigned")
  355|       |    // arithmetic; MSVC++ apparently warns for plain "-u", so
  356|       |    // we write the equivalent expression "0 - u" instead.
  357|      0|    u = 0 - u;
  358|      0|  }
  359|  23.4k|  buffer = EncodeFullU32(u, buffer);
  360|  23.4k|  *buffer = '\0';
  361|  23.4k|  return buffer;
  362|  23.4k|}
numbers.cc:_ZN4absl12lts_2026081712_GLOBAL__N_113EncodeFullU32EjPc:
  260|  23.4k|    uint32_t n, char* absl_nonnull out_str) {
  261|  23.4k|  if (n < 10) {
  ------------------
  |  Branch (261:7): [True: 0, False: 23.4k]
  ------------------
  262|      0|    *out_str = static_cast<char>('0' + n);
  263|      0|    return out_str + 1;
  264|      0|  }
  265|  23.4k|  if (n < 100'000'000) {
  ------------------
  |  Branch (265:7): [True: 17.5k, False: 5.85k]
  ------------------
  266|  17.5k|    uint64_t bottom = PrepareEightDigits(n);
  267|  17.5k|    ABSL_ASSUME(bottom != 0);
  ------------------
  |  |  272|  17.5k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  268|       |    // 0 minus 8 to make MSVC happy.
  269|  17.5k|    uint32_t zeroes =
  270|  17.5k|        static_cast<uint32_t>(absl::countr_zero(bottom)) & (0 - 8u);
  271|  17.5k|    little_endian::Store64(out_str, (bottom + kEightZeroBytes) >> zeroes);
  272|  17.5k|    return out_str + sizeof(bottom) - zeroes / 8;
  273|  17.5k|  }
  274|  5.85k|  uint32_t div08 = n / 100'000'000;
  275|  5.85k|  uint32_t mod08 = n % 100'000'000;
  276|  5.85k|  uint64_t bottom = PrepareEightDigits(mod08) + kEightZeroBytes;
  277|  5.85k|  out_str = EncodeHundred(div08, out_str);
  278|  5.85k|  little_endian::Store64(out_str, bottom);
  279|  5.85k|  return out_str + sizeof(bottom);
  280|  23.4k|}
numbers.cc:_ZN4absl12lts_2026081712_GLOBAL__N_118PrepareEightDigitsEj:
  231|  23.4k|inline uint64_t PrepareEightDigits(uint32_t i) {
  232|  23.4k|  ABSL_ASSUME(i < 10000'0000);
  ------------------
  |  |  272|  23.4k|#define ABSL_ASSUME(cond) __builtin_assume(cond)
  ------------------
  233|       |  // Prepare 2 blocks of 4 digits "in parallel".
  234|  23.4k|  uint32_t hi = i / 10000;
  235|  23.4k|  uint32_t lo = i % 10000;
  236|  23.4k|  uint64_t merged = hi | (uint64_t{lo} << 32);
  237|  23.4k|  uint64_t div100 = ((merged * kDivisionBy100Mul) / kDivisionBy100Div) &
  238|  23.4k|                    ((0x7Full << 32) | 0x7Full);
  239|  23.4k|  uint64_t mod100 = merged - 100ull * div100;
  240|  23.4k|  uint64_t hundreds = (mod100 << 16) + div100;
  241|  23.4k|  uint64_t tens = (hundreds * kDivisionBy10Mul) / kDivisionBy10Div;
  242|  23.4k|  tens &= (0xFull << 48) | (0xFull << 32) | (0xFull << 16) | 0xFull;
  243|  23.4k|  tens += (hundreds - 10ull * tens) << 8;
  244|  23.4k|  return tens;
  245|  23.4k|}
numbers.cc:_ZN4absl12lts_2026081712_GLOBAL__N_113EncodeHundredEjPc:
  181|  5.85k|inline char* EncodeHundred(uint32_t n, char* absl_nonnull out_str) {
  182|  5.85k|  int num_digits = static_cast<int>(n - 10) >> 8;
  183|  5.85k|  uint32_t div10 = (n * kDivisionBy10Mul) / kDivisionBy10Div;
  184|  5.85k|  uint32_t mod10 = n - 10u * div10;
  185|  5.85k|  uint32_t base = kTwoZeroBytes + div10 + (mod10 << 8);
  186|  5.85k|  base >>= num_digits & 8;
  187|  5.85k|  little_endian::Store16(out_str, static_cast<uint16_t>(base));
  188|  5.85k|  return out_str + 2 + num_digits;
  189|  5.85k|}

str_cat.cc:_ZN4absl12lts_2026081716strings_internal28StringResizeAndOverwriteImplINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS1_24StringAppendAndOverwriteIS9_ZNS0_9StrAppendEPS9_RKNS0_8AlphaNumEE3$_0EEvRT_NSG_9size_typeET0_EUlPcmE_EEvSH_SI_SJ_:
  149|  79.3M|void StringResizeAndOverwriteImpl(T& str, typename T::size_type n, Op op) {
  150|       |#ifdef ABSL_INTERNAL_HAS_RESIZE_AND_OVERWRITE
  151|       |  str.resize_and_overwrite(n, std::move(op));
  152|       |#else
  153|       |  if constexpr (strings_internal::
  154|       |                    has__google_nonstandard_backport_resize_and_overwrite<
  155|       |                        T>::value) {
  156|       |    str.__google_nonstandard_backport_resize_and_overwrite(n, std::move(op));
  157|       |  } else if constexpr (strings_internal::has__resize_and_overwrite<T>::value) {
  158|       |    str.__resize_and_overwrite(n, std::move(op));
  159|  79.3M|  } else if constexpr (strings_internal::has__resize_default_init<T>::value) {
  160|  79.3M|    str.__resize_default_init(n);
  161|  79.3M|    str.__resize_default_init(
  162|  79.3M|        static_cast<typename T::size_type>(std::move(op)(str.data(), n)));
  163|       |  } else if constexpr (strings_internal::has_Resize_and_overwrite<T>::value) {
  164|       |    str._Resize_and_overwrite(n, std::move(op));
  165|       |  } else {
  166|       |    strings_internal::StringResizeAndOverwriteFallback(str, n, std::move(op));
  167|       |  }
  168|  79.3M|#endif
  169|  79.3M|}
str_cat.cc:_ZN4absl12lts_2026081716strings_internal28StringResizeAndOverwriteImplINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEZNS1_24StringAppendAndOverwriteIS9_ZNS0_9StrAppendEPS9_RKNS0_8AlphaNumESE_E3$_0EEvRT_NSG_9size_typeET0_EUlPcmE_EEvSH_SI_SJ_:
  149|  1.88M|void StringResizeAndOverwriteImpl(T& str, typename T::size_type n, Op op) {
  150|       |#ifdef ABSL_INTERNAL_HAS_RESIZE_AND_OVERWRITE
  151|       |  str.resize_and_overwrite(n, std::move(op));
  152|       |#else
  153|       |  if constexpr (strings_internal::
  154|       |                    has__google_nonstandard_backport_resize_and_overwrite<
  155|       |                        T>::value) {
  156|       |    str.__google_nonstandard_backport_resize_and_overwrite(n, std::move(op));
  157|       |  } else if constexpr (strings_internal::has__resize_and_overwrite<T>::value) {
  158|       |    str.__resize_and_overwrite(n, std::move(op));
  159|  1.88M|  } else if constexpr (strings_internal::has__resize_default_init<T>::value) {
  160|  1.88M|    str.__resize_default_init(n);
  161|  1.88M|    str.__resize_default_init(
  162|  1.88M|        static_cast<typename T::size_type>(std::move(op)(str.data(), n)));
  163|       |  } else if constexpr (strings_internal::has_Resize_and_overwrite<T>::value) {
  164|       |    str._Resize_and_overwrite(n, std::move(op));
  165|       |  } else {
  166|       |    strings_internal::StringResizeAndOverwriteFallback(str, n, std::move(op));
  167|       |  }
  168|  1.88M|#endif
  169|  1.88M|}

_ZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumE:
  207|  79.3M|void StrAppend(std::string* absl_nonnull dest, const AlphaNum& a) {
  208|       |  ASSERT_NO_OVERLAP(*dest, a);
  ------------------
  |  |  180|  79.3M|  assert(((src).size() == 0) ||      \
  |  |  181|  79.3M|         (uintptr_t((src).data() - (dest).data()) > uintptr_t((dest).size())))
  ------------------
  209|  79.3M|  strings_internal::StringAppendAndOverwrite(
  210|  79.3M|      *dest, a.size(), [&a](char* const buf, size_t buf_size) {
  211|  79.3M|        char* out = buf;
  212|  79.3M|        out = Append(out, a);
  213|  79.3M|        assert(out == buf + buf_size);
  214|  79.3M|        return buf_size;
  215|  79.3M|      });
  216|  79.3M|}
_ZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumESB_:
  219|  1.88M|               const AlphaNum& b) {
  220|  1.88M|  ASSERT_NO_OVERLAP(*dest, a);
  ------------------
  |  |  180|  1.88M|  assert(((src).size() == 0) ||      \
  |  |  181|  1.88M|         (uintptr_t((src).data() - (dest).data()) > uintptr_t((dest).size())))
  ------------------
  221|       |  ASSERT_NO_OVERLAP(*dest, b);
  ------------------
  |  |  180|  1.88M|  assert(((src).size() == 0) ||      \
  |  |  181|  1.88M|         (uintptr_t((src).data() - (dest).data()) > uintptr_t((dest).size())))
  ------------------
  222|  1.88M|  strings_internal::StringAppendAndOverwrite(
  223|  1.88M|      *dest, SafeAdd(a.size(), b.size()),
  224|  1.88M|      [&a, &b](char* const buf, size_t buf_size) {
  225|  1.88M|        char* out = buf;
  226|  1.88M|        out = Append(out, a);
  227|  1.88M|        out = Append(out, b);
  228|  1.88M|        assert(out == buf + buf_size);
  229|  1.88M|        return buf_size;
  230|  1.88M|      });
  231|  1.88M|}
str_cat.cc:_ZN4absl12lts_2026081712_GLOBAL__N_17SafeAddEmm:
   59|  1.88M|inline size_t SafeAdd(size_t a, size_t b) {
   60|  1.88M|  const uint64_t sum = static_cast<uint64_t>(a) + b;
   61|  1.88M|  if (ABSL_PREDICT_FALSE(sum > (std::numeric_limits<size_t>::max)())) {
  ------------------
  |  |  190|  1.88M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 1.88M]
  |  |  |  Branch (190:49): [Folded, False: 1.88M]
  |  |  |  Branch (190:58): [True: 0, False: 1.88M]
  |  |  ------------------
  ------------------
   62|      0|    ThrowStdLengthError("absl string append length overflow");
   63|      0|  }
   64|  1.88M|  return static_cast<size_t>(sum);
   65|  1.88M|}
str_cat.cc:_ZN4absl12lts_2026081712_GLOBAL__N_16AppendEPcRKNS0_8AlphaNumE:
   48|  83.1M|inline char* absl_nonnull Append(char* absl_nonnull out, const AlphaNum& x) {
   49|       |  // memcpy is allowed to overwrite arbitrary memory, so doing this after the
   50|       |  // call would force an extra fetch of x.size().
   51|  83.1M|  char* after = out + x.size();
   52|  83.1M|  if (x.size() != 0) {
  ------------------
  |  Branch (52:7): [True: 81.2M, False: 1.89M]
  ------------------
   53|  81.2M|    memcpy(out, x.data(), x.size());
   54|  81.2M|  }
   55|  83.1M|  return after;
   56|  83.1M|}
str_cat.cc:_ZZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumEENK3$_0clEPcm:
  210|  79.3M|      *dest, a.size(), [&a](char* const buf, size_t buf_size) {
  211|  79.3M|        char* out = buf;
  212|  79.3M|        out = Append(out, a);
  213|       |        assert(out == buf + buf_size);
  214|  79.3M|        return buf_size;
  215|  79.3M|      });
str_cat.cc:_ZZN4absl12lts_202608179StrAppendEPNSt3__112basic_stringIcNS1_11char_traitsIcEENS1_9allocatorIcEEEERKNS0_8AlphaNumESB_ENK3$_0clEPcm:
  224|  1.88M|      [&a, &b](char* const buf, size_t buf_size) {
  225|  1.88M|        char* out = buf;
  226|  1.88M|        out = Append(out, a);
  227|  1.88M|        out = Append(out, b);
  228|       |        assert(out == buf + buf_size);
  229|  1.88M|        return buf_size;
  230|  1.88M|      });

_ZN4absl12lts_202608178AlphaNumC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  399|  63.7M|      : piece_(pc) {}
_ZN4absl12lts_202608178AlphaNumC2INSt3__19allocatorIcEEEERKNS3_12basic_stringIcNS3_11char_traitsIcEET_EE:
  417|  19.3M|      : piece_(str) {}
_ZNK4absl12lts_202608178AlphaNum4sizeEv:
  425|   330M|  absl::string_view::size_type size() const { return piece_.size(); }
_ZNK4absl12lts_202608178AlphaNum4dataEv:
  426|  81.2M|  const char* absl_nullable data() const { return piece_.data(); }

_ZN4absl12lts_2026081717UntypedFormatSpecC2ENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  112|  6.37k|  explicit UntypedFormatSpec(string_view s) : spec_(s) {}
_ZN4absl12lts_202608179StrFormatIJiEEENSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEERKNS0_19str_format_internal18FormatSpecTemplateIJXspclsr19str_format_internalE14ArgumentToConvIT_EEEEEEDpRKSB_:
  366|    512|                                    const Args&... args) {
  367|    512|  return str_format_internal::FormatPack(
  368|    512|      str_format_internal::UntypedFormatSpecImpl::Extract(format),
  369|    512|      {str_format_internal::FormatArgImpl(args)...});
  370|    512|}
_ZN4absl12lts_202608178SNPrintFIJciiiEEEiPcmRKNS0_19str_format_internal18FormatSpecTemplateIJXspclsr19str_format_internalE14ArgumentToConvIT_EEEEEEDpRKS5_:
  473|  5.85k|             const FormatSpec<Args...>& format, const Args&... args) {
  474|  5.85k|  return str_format_internal::SnprintF(
  475|  5.85k|      output, size, str_format_internal::UntypedFormatSpecImpl::Extract(format),
  476|  5.85k|      {str_format_internal::FormatArgImpl(args)...});
  477|  5.85k|}

_ZN4absl12lts_2026081716strings_internal18ApplySubstitutionsENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEPNS2_6vectorINS1_18ViableSubstitutionENS2_9allocatorIS8_EEEEPNS2_12basic_stringIcS5_NS9_IcEEEE:
   41|  19.3M|    std::string* absl_nonnull result_ptr) {
   42|  19.3M|  auto& subs = *subs_ptr;
   43|  19.3M|  int substitutions = 0;
   44|  19.3M|  size_t pos = 0;
   45|  21.2M|  while (!subs.empty()) {
  ------------------
  |  Branch (45:10): [True: 1.88M, False: 19.3M]
  ------------------
   46|  1.88M|    auto& sub = subs.back();
   47|  1.88M|    if (sub.offset >= pos) {
  ------------------
  |  Branch (47:9): [True: 1.88M, False: 0]
  ------------------
   48|  1.88M|      if (pos <= s.size()) {
  ------------------
  |  Branch (48:11): [True: 1.88M, False: 0]
  ------------------
   49|  1.88M|        StrAppend(result_ptr, s.substr(pos, sub.offset - pos), sub.replacement);
   50|  1.88M|      }
   51|  1.88M|      pos = sub.offset + sub.old.size();
   52|  1.88M|      substitutions += 1;
   53|  1.88M|    }
   54|  1.88M|    sub.offset = s.find(sub.old, pos);
   55|  1.88M|    if (sub.offset == s.npos) {
  ------------------
  |  Branch (55:9): [True: 1.88M, False: 0]
  ------------------
   56|  1.88M|      subs.pop_back();
   57|  1.88M|    } else {
   58|       |      // Insertion sort to ensure the last ViableSubstitution continues to be
   59|       |      // before all the others.
   60|      0|      size_t index = subs.size();
   61|      0|      while (--index && subs[index - 1].OccursBefore(subs[index])) {
  ------------------
  |  Branch (61:14): [True: 0, False: 0]
  |  Branch (61:25): [True: 0, False: 0]
  ------------------
   62|      0|        std::swap(subs[index], subs[index - 1]);
   63|      0|      }
   64|      0|    }
   65|  1.88M|  }
   66|  19.3M|  result_ptr->append(s.data() + pos, s.size() - pos);
   67|  19.3M|  return substitutions;
   68|  19.3M|}
_ZN4absl12lts_2026081713StrReplaceAllENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEESt16initializer_listINS1_4pairIS5_S5_EEE:
   81|  19.3M|                          strings_internal::FixedMapping replacements) {
   82|  19.3M|  return StrReplaceAll<strings_internal::FixedMapping>(s, replacements);
   83|  19.3M|}

_ZN4absl12lts_2026081716strings_internal18ViableSubstitutionC2ENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEES7_m:
  145|  1.88M|      : old(old_str), replacement(replacement_str), offset(offset_val) {}
_ZN4absl12lts_2026081713StrReplaceAllISt16initializer_listINSt3__14pairINS3_17basic_string_viewIcNS3_11char_traitsIcEEEES8_EEEEENS3_12basic_stringIcS7_NS3_9allocatorIcEEEES8_RKT_:
  197|  19.3M|                          const StrToStrMapping& replacements) {
  198|  19.3M|  auto subs = strings_internal::FindSubstitutions(s, replacements);
  199|  19.3M|  std::string result;
  200|  19.3M|  result.reserve(s.size());
  201|  19.3M|  strings_internal::ApplySubstitutions(s, &subs, &result);
  202|  19.3M|  return result;
  203|  19.3M|}
_ZN4absl12lts_2026081716strings_internal17FindSubstitutionsISt16initializer_listINSt3__14pairINS4_17basic_string_viewIcNS4_11char_traitsIcEEEES9_EEEEENS4_6vectorINS1_18ViableSubstitutionENS4_9allocatorISD_EEEES9_RKT_:
  161|  19.3M|    absl::string_view s, const StrToStrMapping& replacements) {
  162|  19.3M|  std::vector<ViableSubstitution> subs;
  163|  19.3M|  subs.reserve(std::size(replacements));
  164|       |
  165|  19.3M|  for (const auto& rep : replacements) {
  ------------------
  |  Branch (165:24): [True: 19.3M, False: 19.3M]
  ------------------
  166|  19.3M|    using std::get;
  167|  19.3M|    absl::string_view old(get<0>(rep));
  168|       |
  169|  19.3M|    size_t pos = s.find(old);
  170|  19.3M|    if (pos == s.npos) continue;
  ------------------
  |  Branch (170:9): [True: 17.4M, False: 1.88M]
  ------------------
  171|       |
  172|       |    // Ignore attempts to replace "". This condition is almost never true,
  173|       |    // but above condition is frequently true. That's why we test for this
  174|       |    // now and not before.
  175|  1.88M|    if (old.empty()) continue;
  ------------------
  |  Branch (175:9): [True: 0, False: 1.88M]
  ------------------
  176|       |
  177|  1.88M|    subs.emplace_back(old, get<1>(rep), pos);
  178|       |
  179|       |    // Insertion sort to ensure the last ViableSubstitution comes before
  180|       |    // all the others.
  181|  1.88M|    size_t index = subs.size();
  182|  1.88M|    while (--index && subs[index - 1].OccursBefore(subs[index])) {
  ------------------
  |  Branch (182:12): [True: 0, False: 1.88M]
  |  Branch (182:23): [True: 0, False: 0]
  ------------------
  183|      0|      std::swap(subs[index], subs[index - 1]);
  184|      0|    }
  185|  1.88M|  }
  186|  19.3M|  return subs;
  187|  19.3M|}

_ZN4absl12lts_2026081713ClippedSubstrENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEmm:
   43|  97.6M|                                 size_t pos, size_t n = string_view::npos) {
   44|  97.6M|  pos = (std::min)(pos, static_cast<size_t>(s.size()));
   45|  97.6M|  return s.substr(pos, n);
   46|  97.6M|}

_ZN4absl12lts_2026081713ConsumePrefixEPNSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_:
   49|  16.0M|                                    absl::string_view expected) {
   50|  16.0M|  if (!absl::StartsWith(*str, expected)) return false;
  ------------------
  |  Branch (50:7): [True: 13.1M, False: 2.93M]
  ------------------
   51|  2.93M|  str->remove_prefix(expected.size());
   52|  2.93M|  return true;
   53|  16.0M|}

_ZN4absl12lts_2026081724synchronization_internal14InvalidGraphIdEv:
   58|  5.86k|inline GraphId InvalidGraphId() {
   59|  5.86k|  return GraphId{0};
   60|  5.86k|}

_ZN4absl12lts_202608175Mutex4lockEv:
 1538|      9|void Mutex::lock() {
 1539|      9|  ABSL_TSAN_MUTEX_PRE_LOCK(this, 0);
 1540|      9|  GraphId id = DebugOnlyDeadlockCheck(this);
 1541|      9|  intptr_t v = mu_.load(std::memory_order_relaxed);
 1542|       |  // try fast acquire, then spin loop
 1543|      9|  if (ABSL_PREDICT_FALSE((v & (kMuWriter | kMuReader | kMuEvent)) != 0) ||
  ------------------
  |  |  190|     18|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 9]
  |  |  |  Branch (190:49): [Folded, False: 9]
  |  |  |  Branch (190:58): [True: 0, False: 9]
  |  |  ------------------
  ------------------
 1544|      9|      ABSL_PREDICT_FALSE(!mu_.compare_exchange_strong(
  ------------------
  |  |  190|      9|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 9]
  |  |  |  Branch (190:49): [Folded, False: 9]
  |  |  |  Branch (190:58): [True: 0, False: 9]
  |  |  ------------------
  ------------------
 1545|      9|          v, kMuWriter | v, std::memory_order_acquire,
 1546|      9|          std::memory_order_relaxed))) {
 1547|       |    // try spin acquire, then slow loop
 1548|      0|    if (ABSL_PREDICT_FALSE(!TryAcquireWithSpinning(&this->mu_))) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1549|      0|      this->LockSlow(kExclusive, nullptr, 0);
 1550|      0|    }
 1551|      0|  }
 1552|      9|  DebugOnlyLockEnter(this, id);
 1553|      9|  ABSL_TSAN_MUTEX_POST_LOCK(this, 0, 0);
 1554|      9|}
_ZN4absl12lts_202608175Mutex11lock_sharedEv:
 1556|  5.85k|void Mutex::lock_shared() {
 1557|  5.85k|  ABSL_TSAN_MUTEX_PRE_LOCK(this, __tsan_mutex_read_lock);
 1558|  5.85k|  GraphId id = DebugOnlyDeadlockCheck(this);
 1559|  5.85k|  intptr_t v = mu_.load(std::memory_order_relaxed);
 1560|  5.85k|  for (;;) {
 1561|       |    // If there are non-readers holding the lock, use the slow loop.
 1562|  5.85k|    if (ABSL_PREDICT_FALSE(v & (kMuWriter | kMuWait | kMuEvent)) != 0) {
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
  |  Branch (1562:9): [True: 0, False: 5.85k]
  ------------------
 1563|      0|      this->LockSlow(kShared, nullptr, 0);
 1564|      0|      break;
 1565|      0|    }
 1566|       |    // We can avoid the loop and only use the CAS when the lock is free or
 1567|       |    // only held by readers.
 1568|  5.85k|    if (ABSL_PREDICT_TRUE(mu_.compare_exchange_weak(
  ------------------
  |  |  191|  5.85k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 5.85k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 5.85k]
  |  |  |  Branch (191:57): [True: 5.85k, False: 0]
  |  |  ------------------
  ------------------
 1569|  5.85k|            v, (kMuReader | v) + kMuOne, std::memory_order_acquire,
 1570|  5.85k|            std::memory_order_relaxed))) {
 1571|  5.85k|      break;
 1572|  5.85k|    }
 1573|  5.85k|  }
 1574|  5.85k|  DebugOnlyLockEnter(this, id);
 1575|  5.85k|  ABSL_TSAN_MUTEX_POST_LOCK(this, __tsan_mutex_read_lock, 0);
 1576|  5.85k|}
_ZN4absl12lts_202608175Mutex6unlockEv:
 1716|      9|void Mutex::unlock() {
 1717|      9|  ABSL_TSAN_MUTEX_PRE_UNLOCK(this, 0);
 1718|      9|  DebugOnlyLockLeave(this);
 1719|      9|  intptr_t v = mu_.load(std::memory_order_relaxed);
 1720|       |
 1721|      9|  if (kDebugMode && ((v & (kMuWriter | kMuReader)) != kMuWriter)) {
  ------------------
  |  Branch (1721:7): [Folded, False: 9]
  |  Branch (1721:21): [True: 0, False: 0]
  ------------------
 1722|      0|    ABSL_RAW_LOG(FATAL, "Mutex unlocked when destroyed or not locked: v=0x%x",
  ------------------
  |  |   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]
  |  |  ------------------
  ------------------
 1723|      0|                 static_cast<unsigned>(v));
 1724|      0|  }
 1725|       |
 1726|       |  // should_try_cas is whether we'll try a compare-and-swap immediately.
 1727|       |  // NOTE: optimized out when kDebugMode is false.
 1728|      9|  bool should_try_cas = ((v & (kMuEvent | kMuWriter)) == kMuWriter &&
  ------------------
  |  Branch (1728:26): [True: 9, False: 0]
  ------------------
 1729|      9|                         (v & (kMuWait | kMuDesig)) != kMuWait);
  ------------------
  |  Branch (1729:26): [True: 9, False: 0]
  ------------------
 1730|       |
 1731|       |  // But, we can use an alternate computation of it, that compilers
 1732|       |  // currently don't find on their own.  When that changes, this function
 1733|       |  // can be simplified.
 1734|       |  //
 1735|       |  // should_try_cas is true iff the bits satisfy the following conditions:
 1736|       |  //
 1737|       |  //                   Ev Wr Wa De
 1738|       |  // equal to           0  1
 1739|       |  // and not equal to         1  0
 1740|       |  //
 1741|       |  // after xoring by    0  1  0  1,  this is equivalent to:
 1742|       |  //
 1743|       |  // equal to           0  0
 1744|       |  // and not equal to         1  1,  which is the same as:
 1745|       |  //
 1746|       |  // smaller than       0  0  1  1
 1747|      9|  static_assert(kMuEvent > kMuWait, "Needed for should_try_cas_fast");
 1748|      9|  static_assert(kMuEvent > kMuDesig, "Needed for should_try_cas_fast");
 1749|      9|  static_assert(kMuWriter > kMuWait, "Needed for should_try_cas_fast");
 1750|      9|  static_assert(kMuWriter > kMuDesig, "Needed for should_try_cas_fast");
 1751|       |
 1752|      9|  bool should_try_cas_fast =
 1753|      9|      ((v ^ (kMuWriter | kMuDesig)) &
 1754|      9|       (kMuEvent | kMuWriter | kMuWait | kMuDesig)) < (kMuWait | kMuDesig);
 1755|       |
 1756|      9|  if (kDebugMode && should_try_cas != should_try_cas_fast) {
  ------------------
  |  Branch (1756:7): [Folded, False: 9]
  |  Branch (1756:21): [True: 0, False: 0]
  ------------------
 1757|       |    // We would usually use PRIdPTR here, but is not correctly implemented
 1758|       |    // within the android toolchain.
 1759|      0|    ABSL_RAW_LOG(FATAL, "internal logic error %llx %llx %llx\n",
  ------------------
  |  |   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]
  |  |  ------------------
  ------------------
 1760|      0|                 static_cast<long long>(v),
 1761|      0|                 static_cast<long long>(should_try_cas),
 1762|      0|                 static_cast<long long>(should_try_cas_fast));
 1763|      0|  }
 1764|      9|  if (should_try_cas_fast &&
  ------------------
  |  Branch (1764:7): [True: 9, False: 0]
  ------------------
 1765|      9|      mu_.compare_exchange_strong(v, v & ~(kMuWrWait | kMuWriter),
  ------------------
  |  Branch (1765:7): [True: 9, False: 0]
  ------------------
 1766|      9|                                  std::memory_order_release,
 1767|      9|                                  std::memory_order_relaxed)) {
 1768|       |    // fast writer release (writer with no waiters or with designated waker)
 1769|      9|  } else {
 1770|      0|    this->UnlockSlow(nullptr /*no waitp*/);  // take slow path
 1771|      0|  }
 1772|      9|  ABSL_TSAN_MUTEX_POST_UNLOCK(this, 0);
 1773|      9|}
_ZN4absl12lts_202608175Mutex13unlock_sharedEv:
 1786|  5.85k|void Mutex::unlock_shared() {
 1787|  5.85k|  ABSL_TSAN_MUTEX_PRE_UNLOCK(this, __tsan_mutex_read_lock);
 1788|  5.85k|  DebugOnlyLockLeave(this);
 1789|  5.85k|  intptr_t v = mu_.load(std::memory_order_relaxed);
 1790|  5.85k|  assert((v & (kMuWriter | kMuReader)) == kMuReader);
 1791|  5.85k|  for (;;) {
 1792|  5.85k|    if (ABSL_PREDICT_FALSE((v & (kMuReader | kMuWait | kMuEvent)) !=
  ------------------
  |  |  190|  5.85k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.85k]
  |  |  |  Branch (190:49): [Folded, False: 5.85k]
  |  |  |  Branch (190:58): [True: 0, False: 5.85k]
  |  |  ------------------
  ------------------
 1793|  5.85k|                           kMuReader)) {
 1794|      0|      this->UnlockSlow(nullptr /*no waitp*/);  // take slow path
 1795|      0|      break;
 1796|      0|    }
 1797|       |    // fast reader release (reader with no waiters)
 1798|  5.85k|    intptr_t clear = ExactlyOneReader(v) ? kMuReader | kMuOne : kMuOne;
  ------------------
  |  Branch (1798:22): [True: 5.85k, False: 0]
  ------------------
 1799|  5.85k|    if (ABSL_PREDICT_TRUE(
  ------------------
  |  |  191|  5.85k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 5.85k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 5.85k]
  |  |  |  Branch (191:57): [True: 5.85k, False: 0]
  |  |  ------------------
  ------------------
 1800|  5.85k|            mu_.compare_exchange_strong(v, v - clear, std::memory_order_release,
 1801|  5.85k|                                        std::memory_order_relaxed))) {
 1802|  5.85k|      break;
 1803|  5.85k|    }
 1804|  5.85k|  }
 1805|  5.85k|  ABSL_TSAN_MUTEX_POST_UNLOCK(this, __tsan_mutex_read_lock);
 1806|  5.85k|}
mutex.cc:_ZN4absl12lts_20260817L22DebugOnlyDeadlockCheckEPNS0_5MutexE:
 1480|  5.86k|static inline GraphId DebugOnlyDeadlockCheck(Mutex* mu) {
 1481|  5.86k|  if (kDebugMode && synch_deadlock_detection.load(std::memory_order_acquire) !=
  ------------------
  |  Branch (1481:7): [Folded, False: 5.86k]
  |  Branch (1481:21): [True: 0, False: 0]
  ------------------
 1482|      0|                        OnDeadlockCycle::kIgnore) {
 1483|      0|    return DeadlockCheck(mu);
 1484|  5.86k|  } else {
 1485|  5.86k|    return InvalidGraphId();
 1486|  5.86k|  }
 1487|  5.86k|}
mutex.cc:_ZN4absl12lts_20260817L18DebugOnlyLockEnterEPNS0_5MutexENS0_24synchronization_internal7GraphIdE:
 1313|  5.86k|static inline void DebugOnlyLockEnter(Mutex* mu, GraphId id) {
 1314|  5.86k|  if (kDebugMode) {
  ------------------
  |  Branch (1314:7): [Folded, False: 5.86k]
  ------------------
 1315|      0|    if (synch_deadlock_detection.load(std::memory_order_acquire) !=
  ------------------
  |  Branch (1315:9): [True: 0, False: 0]
  ------------------
 1316|      0|        OnDeadlockCycle::kIgnore) {
 1317|      0|      LockEnter(mu, id, Synch_GetAllLocks());
 1318|      0|    }
 1319|      0|  }
 1320|  5.86k|}
mutex.cc:_ZN4absl12lts_20260817L18DebugOnlyLockLeaveEPNS0_5MutexE:
 1323|  5.86k|static inline void DebugOnlyLockLeave(Mutex* mu) {
 1324|  5.86k|  if (kDebugMode) {
  ------------------
  |  Branch (1324:7): [Folded, False: 5.86k]
  ------------------
 1325|      0|    if (synch_deadlock_detection.load(std::memory_order_acquire) !=
  ------------------
  |  Branch (1325:9): [True: 0, False: 0]
  ------------------
 1326|      0|        OnDeadlockCycle::kIgnore) {
 1327|      0|      LockLeave(mu, GetGraphId(mu), Synch_GetAllLocks());
 1328|      0|    }
 1329|      0|  }
 1330|  5.86k|}
mutex.cc:_ZN4absl12lts_20260817L16ExactlyOneReaderEl:
 1776|  5.85k|static bool ExactlyOneReader(intptr_t v) {
 1777|  5.85k|  assert((v & (kMuWriter | kMuReader)) == kMuReader);
 1778|  5.85k|  assert((v & kMuHigh) != 0);
 1779|       |  // The more straightforward "(v & kMuHigh) == kMuOne" also works, but
 1780|       |  // on some architectures the following generates slightly smaller code.
 1781|       |  // It may be faster too.
 1782|  5.85k|  constexpr intptr_t kMuMultipleWaitersMask = kMuHigh ^ kMuOne;
 1783|  5.85k|  return (v & kMuMultipleWaitersMask) == 0;
 1784|  5.85k|}

_ZN4absl12lts_202608175Mutex4LockEv:
  195|      8|  inline void Lock() ABSL_EXCLUSIVE_LOCK_FUNCTION() { lock(); }
_ZN4absl12lts_202608175Mutex6UnlockEv:
  204|      8|  inline void Unlock() ABSL_UNLOCK_FUNCTION() { unlock(); }
_ZN4absl12lts_2026081715ReaderMutexLockC2ERNS0_5MutexE:
  672|  5.85k|      : mu_(mu) {
  673|  5.85k|    mu.lock_shared();
  674|  5.85k|  }
_ZN4absl12lts_2026081715ReaderMutexLockD2Ev:
  698|  5.85k|  ~ReaderMutexLock() ABSL_UNLOCK_FUNCTION() { this->mu_.unlock_shared(); }
_ZN4absl12lts_2026081715WriterMutexLockC2ERNS0_5MutexE:
  712|      1|      : mu_(mu) {
  713|      1|    mu.lock();
  714|      1|  }
_ZN4absl12lts_2026081715WriterMutexLockD2Ev:
  740|      1|  ~WriterMutexLock() ABSL_UNLOCK_FUNCTION() { this->mu_.unlock(); }
_ZN4absl12lts_202608175MutexC2Ev:
 1187|  9.80k|inline Mutex::Mutex() : mu_(0) {
 1188|  9.80k|  ABSL_TSAN_MUTEX_CREATE(this, __tsan_mutex_not_static);
 1189|  9.80k|}
_ZN4absl12lts_202608175MutexD2Ev:
 1195|  9.80k|inline Mutex::~Mutex() { Dtor(); }
_ZN4absl12lts_202608175Mutex4DtorEv:
 1206|  9.80k|inline void Mutex::Dtor() {}

_ZN4absl12lts_202608173NowEv:
   39|  66.4k|Time Now() {
   40|       |  // TODO(bww): Get a timespec instead so we don't have to divide.
   41|  66.4k|  int64_t n = absl::GetCurrentTimeNanos();
   42|  66.4k|  if (n >= 0) {
  ------------------
  |  Branch (42:7): [True: 66.4k, False: 0]
  ------------------
   43|  66.4k|    return time_internal::FromUnixDuration(
   44|  66.4k|        time_internal::MakeDuration(n / 1000000000, n % 1000000000 * 4));
   45|  66.4k|  }
   46|      0|  return time_internal::FromUnixDuration(absl::Nanoseconds(n));
   47|  66.4k|}
_ZN4absl12lts_2026081719GetCurrentTimeNanosEv:
   77|  66.4k|int64_t GetCurrentTimeNanos() { return GET_CURRENT_TIME_NANOS_FROM_SYSTEM(); }
  ------------------
  |  |   71|  66.4k|  ::absl::time_internal::GetCurrentTimeNanosFromSystem()
  ------------------

_ZN4absl12lts_202608178DurationmIES1_:
  436|  55.2k|Duration& Duration::operator-=(Duration rhs) {
  437|  55.2k|  if (time_internal::IsInfiniteDuration(*this)) return *this;
  ------------------
  |  Branch (437:7): [True: 0, False: 55.2k]
  ------------------
  438|  55.2k|  if (time_internal::IsInfiniteDuration(rhs)) {
  ------------------
  |  Branch (438:7): [True: 0, False: 55.2k]
  ------------------
  439|      0|    return *this = rhs.rep_hi_.Get() >= 0 ? -InfiniteDuration()
  ------------------
  |  Branch (439:20): [True: 0, False: 0]
  ------------------
  440|      0|                                          : InfiniteDuration();
  441|      0|  }
  442|  55.2k|  const int64_t orig_rep_hi = rep_hi_.Get();
  443|  55.2k|  rep_hi_ = DecodeTwosComp(EncodeTwosComp(rep_hi_.Get()) -
  444|  55.2k|                           EncodeTwosComp(rhs.rep_hi_.Get()));
  445|  55.2k|  if (rep_lo_ < rhs.rep_lo_) {
  ------------------
  |  Branch (445:7): [True: 1.21k, False: 54.0k]
  ------------------
  446|  1.21k|    rep_hi_ = DecodeTwosComp(EncodeTwosComp(rep_hi_.Get()) - 1);
  447|  1.21k|    rep_lo_ += kTicksPerSecond;
  448|  1.21k|  }
  449|  55.2k|  rep_lo_ -= rhs.rep_lo_;
  450|  55.2k|  if (rhs.rep_hi_.Get() < 0 ? rep_hi_.Get() < orig_rep_hi
  ------------------
  |  Branch (450:7): [True: 0, False: 55.2k]
  |  Branch (450:7): [True: 0, False: 55.2k]
  ------------------
  451|  55.2k|                            : rep_hi_.Get() > orig_rep_hi) {
  452|      0|    return *this = rhs.rep_hi_.Get() >= 0 ? -InfiniteDuration()
  ------------------
  |  Branch (452:20): [True: 0, False: 0]
  ------------------
  453|      0|                                          : InfiniteDuration();
  454|      0|  }
  455|  55.2k|  return *this;
  456|  55.2k|}
duration.cc:_ZN4absl12lts_2026081712_GLOBAL__N_114DecodeTwosCompEm:
  187|  56.4k|inline int64_t DecodeTwosComp(uint64_t v) { return absl::bit_cast<int64_t>(v); }
duration.cc:_ZN4absl12lts_2026081712_GLOBAL__N_114EncodeTwosCompEl:
  184|   111k|inline uint64_t EncodeTwosComp(int64_t v) {
  185|   111k|  return absl::bit_cast<uint64_t>(v);
  186|   111k|}

clock.cc:_ZN4absl12lts_2026081713time_internalL29GetCurrentTimeNanosFromSystemEv:
   13|  66.4k|static int64_t GetCurrentTimeNanosFromSystem() {
   14|  66.4k|  const int64_t kNanosPerSecond = 1000 * 1000 * 1000;
   15|  66.4k|  struct timespec ts;
   16|  66.4k|  ABSL_RAW_CHECK(clock_gettime(CLOCK_REALTIME, &ts) == 0,
  ------------------
  |  |   60|  66.4k|  do {                                                                 \
  |  |   61|  66.4k|    if (ABSL_PREDICT_FALSE(!(condition))) {                            \
  |  |  ------------------
  |  |  |  |  190|  66.4k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (190:31): [True: 0, False: 66.4k]
  |  |  |  |  |  Branch (190:49): [Folded, False: 66.4k]
  |  |  |  |  |  Branch (190:58): [True: 0, False: 66.4k]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   62|      0|      ABSL_RAW_LOG(FATAL, "Check %s failed: %s", #condition, message); \
  |  |  ------------------
  |  |  |  |   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]
  |  |  |  |  ------------------
  |  |  ------------------
  |  |   63|      0|    }                                                                  \
  |  |   64|  66.4k|  } while (0)
  |  |  ------------------
  |  |  |  Branch (64:12): [Folded, False: 66.4k]
  |  |  ------------------
  ------------------
   17|  66.4k|                 "Failed to read real-time clock.");
   18|  66.4k|  return (int64_t{ts.tv_sec} * kNanosPerSecond +
   19|  66.4k|          int64_t{ts.tv_nsec});
   20|  66.4k|}

_ZN4absl12lts_2026081711ToUnixNanosENS0_4TimeE:
  249|  5.85k|int64_t ToUnixNanos(Time t) {
  250|  5.85k|  if (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >= 0 &&
  ------------------
  |  Branch (250:7): [True: 5.85k, False: 0]
  ------------------
  251|  5.85k|      time_internal::GetRepHi(time_internal::ToUnixDuration(t)) >> 33 == 0) {
  ------------------
  |  Branch (251:7): [True: 5.85k, False: 0]
  ------------------
  252|  5.85k|    return (time_internal::GetRepHi(time_internal::ToUnixDuration(t)) * 1000 *
  253|  5.85k|            1000 * 1000) +
  254|  5.85k|           (time_internal::GetRepLo(time_internal::ToUnixDuration(t)) / 4);
  255|  5.85k|  }
  256|      0|  return FloorToUnit(time_internal::ToUnixDuration(t), absl::Nanoseconds(1));
  257|  5.85k|}
_ZN4absl12lts_2026081710ToTimespecENS0_4TimeE:
  302|  5.85k|timespec ToTimespec(Time t) {
  303|  5.85k|  timespec ts;
  304|  5.85k|  absl::Duration d = time_internal::ToUnixDuration(t);
  305|  5.85k|  if (!time_internal::IsInfiniteDuration(d)) {
  ------------------
  |  Branch (305:7): [True: 5.85k, False: 0]
  ------------------
  306|  5.85k|    ts.tv_sec = static_cast<decltype(ts.tv_sec)>(time_internal::GetRepHi(d));
  307|  5.85k|    if (ts.tv_sec == time_internal::GetRepHi(d)) {  // no time_t narrowing
  ------------------
  |  Branch (307:9): [True: 5.85k, False: 0]
  ------------------
  308|  5.85k|      ts.tv_nsec = time_internal::GetRepLo(d) / 4;  // floor
  309|  5.85k|      return ts;
  310|  5.85k|    }
  311|  5.85k|  }
  312|      0|  if (d >= absl::ZeroDuration()) {
  ------------------
  |  Branch (312:7): [True: 0, False: 0]
  ------------------
  313|      0|    ts.tv_sec = std::numeric_limits<time_t>::max();
  314|      0|    ts.tv_nsec = 1000 * 1000 * 1000 - 1;
  315|      0|  } else {
  316|      0|    ts.tv_sec = std::numeric_limits<time_t>::min();
  317|      0|    ts.tv_nsec = 0;
  318|      0|  }
  319|      0|  return ts;
  320|  5.85k|}
_ZN4absl12lts_202608179ToTimevalENS0_4TimeE:
  322|  5.85k|timeval ToTimeval(Time t) {
  323|  5.85k|  timeval tv;
  324|  5.85k|  timespec ts = absl::ToTimespec(t);
  325|  5.85k|  tv.tv_sec = static_cast<decltype(tv.tv_sec)>(ts.tv_sec);
  326|  5.85k|  if (tv.tv_sec != ts.tv_sec) {  // narrowing
  ------------------
  |  Branch (326:7): [True: 0, False: 5.85k]
  ------------------
  327|      0|    if (ts.tv_sec < 0) {
  ------------------
  |  Branch (327:9): [True: 0, False: 0]
  ------------------
  328|      0|      tv.tv_sec = std::numeric_limits<decltype(tv.tv_sec)>::min();
  329|      0|      tv.tv_usec = 0;
  330|      0|    } else {
  331|      0|      tv.tv_sec = std::numeric_limits<decltype(tv.tv_sec)>::max();
  332|      0|      tv.tv_usec = 1000 * 1000 - 1;
  333|      0|    }
  334|      0|    return tv;
  335|      0|  }
  336|  5.85k|  tv.tv_usec = static_cast<int>(ts.tv_nsec / 1000);  // suseconds_t
  337|  5.85k|  return tv;
  338|  5.85k|}

_ZN4absl12lts_202608178DurationC2Ev:
  185|  5.85k|  constexpr Duration() : rep_hi_(0), rep_lo_(0) {}  // zero-length duration
_ZN4absl12lts_202608178DurationC2Elj:
  247|  66.4k|  constexpr Duration(int64_t hi, uint32_t lo) : rep_hi_(hi), rep_lo_(lo) {}
_ZN4absl12lts_202608178Duration5HiRepC2El:
  267|  72.3k|          lo_(0),
  268|  72.3k|          hi_(0)
  269|       |#endif
  270|  72.3k|    {
  271|  72.3k|      *this = value;
  272|  72.3k|    }
_ZNK4absl12lts_202608178Duration5HiRep3GetEv:
  274|   344k|    constexpr int64_t Get() const {
  275|   344k|      const uint64_t unsigned_value =
  276|   344k|          (static_cast<uint64_t>(hi_) << 32) | static_cast<uint64_t>(lo_);
  277|       |      // `static_cast<int64_t>(unsigned_value)` is implementation-defined
  278|       |      // before c++20. On all supported platforms the behaviour is that mandated
  279|       |      // by c++20, i.e. "If the destination type is signed, [...] the result is
  280|       |      // the unique value of the destination type equal to the source value
  281|       |      // modulo 2^n, where n is the number of bits used to represent the
  282|       |      // destination type."
  283|   344k|      static_assert(
  284|   344k|          (static_cast<int64_t>((std::numeric_limits<uint64_t>::max)()) ==
  285|   344k|           int64_t{-1}) &&
  286|   344k|              (static_cast<int64_t>(static_cast<uint64_t>(
  287|   344k|                                        (std::numeric_limits<int64_t>::max)()) +
  288|   344k|                                    1) ==
  289|   344k|               (std::numeric_limits<int64_t>::min)()),
  290|   344k|          "static_cast<int64_t>(uint64_t) does not have c++20 semantics");
  291|   344k|      return static_cast<int64_t>(unsigned_value);
  292|   344k|    }
_ZN4absl12lts_202608178Duration5HiRepaSEl:
  294|   128k|    constexpr HiRep& operator=(const int64_t value) {
  295|       |      // "If the destination type is unsigned, the resulting value is the
  296|       |      // smallest unsigned value equal to the source value modulo 2^n
  297|       |      // where `n` is the number of bits used to represent the destination
  298|       |      // type".
  299|   128k|      const auto unsigned_value = static_cast<uint64_t>(value);
  300|   128k|      hi_ = static_cast<uint32_t>(unsigned_value >> 32);
  301|   128k|      lo_ = static_cast<uint32_t>(unsigned_value);
  302|   128k|      return *this;
  303|   128k|    }
_ZN4absl12lts_202608174TimeC2ENS0_8DurationE:
  877|  66.4k|  constexpr explicit Time(Duration rep) : rep_(rep) {}
_ZN4absl12lts_20260817miENS0_8DurationES1_:
  361|  55.2k|                                                        Duration rhs) {
  362|  55.2k|  return lhs -= rhs;
  363|  55.2k|}
_ZN4absl12lts_20260817miENS0_4TimeES1_:
  920|  55.2k|ABSL_ATTRIBUTE_CONST_FUNCTION inline Duration operator-(Time lhs, Time rhs) {
  921|  55.2k|  return lhs.rep_ - rhs.rep_;
  922|  55.2k|}
_ZN4absl12lts_2026081713time_internal12MakeDurationElj:
 1592|  66.4k|                                                              uint32_t lo = 0) {
 1593|  66.4k|  return Duration(hi, lo);
 1594|  66.4k|}
_ZN4absl12lts_2026081713time_internal12MakeDurationEll:
 1597|  66.4k|                                                              int64_t lo) {
 1598|  66.4k|  return MakeDuration(hi, static_cast<uint32_t>(lo));
 1599|  66.4k|}
_ZN4absl12lts_2026081713time_internal8GetRepHiENS0_8DurationE:
 1624|  66.9k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr int64_t GetRepHi(Duration d) {
 1625|  66.9k|  return d.rep_hi_.Get();
 1626|  66.9k|}
_ZN4absl12lts_2026081713time_internal8GetRepLoENS0_8DurationE:
 1627|   183k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr uint32_t GetRepLo(Duration d) {
 1628|   183k|  return d.rep_lo_;
 1629|   183k|}
_ZN4absl12lts_2026081713time_internal18IsInfiniteDurationENS0_8DurationE:
 1632|   116k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr bool IsInfiniteDuration(Duration d) {
 1633|   116k|  return GetRepLo(d) == ~uint32_t{0};
 1634|   116k|}
_ZN4absl12lts_2026081713time_internal16FromUnixDurationENS0_8DurationE:
 1657|  66.4k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr Time FromUnixDuration(Duration d) {
 1658|  66.4k|  return Time(d);
 1659|  66.4k|}
_ZN4absl12lts_2026081713time_internal14ToUnixDurationENS0_4TimeE:
 1660|  11.7k|ABSL_ATTRIBUTE_CONST_FUNCTION constexpr Duration ToUnixDuration(Time t) {
 1661|  11.7k|  return t.rep_;
 1662|  11.7k|}
_ZN4absl12lts_2026081719ToInt64MillisecondsENS0_8DurationE:
 1885|  55.2k|    Duration d) {
 1886|  55.2k|  if (time_internal::GetRepHi(d) >= 0 &&
  ------------------
  |  Branch (1886:7): [True: 55.2k, False: 0]
  ------------------
 1887|  55.2k|      time_internal::GetRepHi(d) >> 53 == 0) {
  ------------------
  |  Branch (1887:7): [True: 55.2k, False: 0]
  ------------------
 1888|  55.2k|    return (time_internal::GetRepHi(d) * 1000) +
 1889|  55.2k|           (time_internal::GetRepLo(d) /
 1890|  55.2k|            (time_internal::kTicksPerNanosecond * 1000 * 1000));
 1891|  55.2k|  } else {
 1892|      0|    return d / Milliseconds(1);
 1893|      0|  }
 1894|  55.2k|}
_ZN4absl12lts_202608174TimeC2Ev:
  802|  5.85k|  constexpr Time() = default;

_ZN4absl12lts_2026081713span_internal7GetDataIKNS0_10FixedArrayINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEELm128ENS4_9allocatorIS8_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  1.54k|    -> decltype(GetDataImpl(c, 0)) {
   51|  1.54k|  return GetDataImpl(c, 0);
   52|  1.54k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNS0_10FixedArrayINSt3__117basic_string_viewIcNS4_11char_traitsIcEEEELm128ENS4_9allocatorIS8_EEEEEEDTcldtfp_4dataEERT_c:
   38|  1.54k|    -> decltype(c.data()) {
   39|  1.54k|  return c.data();
   40|  1.54k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorIN13sentencepiece22SentencePieceProcessor11ExtraOptionENS3_9allocatorIS7_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  19.2k|    -> decltype(GetDataImpl(c, 0)) {
   51|  19.2k|  return GetDataImpl(c, 0);
   52|  19.2k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorIN13sentencepiece22SentencePieceProcessor11ExtraOptionENS3_9allocatorIS7_EEEEEEDTcldtfp_4dataEERT_c:
   38|  19.2k|    -> decltype(c.data()) {
   39|  19.2k|  return c.data();
   40|  19.2k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorImNS3_9allocatorImEEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  14.4k|    -> decltype(GetDataImpl(c, 0)) {
   51|  14.4k|  return GetDataImpl(c, 0);
   52|  14.4k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorImNS3_9allocatorImEEEEEEDTcldtfp_4dataEERT_c:
   38|  14.4k|    -> decltype(c.data()) {
   39|  14.4k|  return c.data();
   40|  14.4k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEDTcldtfp_4dataEERT_c:
   38|  34.4k|    -> decltype(c.data()) {
   39|  34.4k|  return c.data();
   40|  34.4k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  34.4k|    -> decltype(GetDataImpl(c, 0)) {
   51|  34.4k|  return GetDataImpl(c, 0);
   52|  34.4k|}
_ZN4absl12lts_2026081713span_internal7GetDataINSt3__15arrayIcLm15000EEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  17.5k|    -> decltype(GetDataImpl(c, 0)) {
   51|  17.5k|  return GetDataImpl(c, 0);
   52|  17.5k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplINSt3__15arrayIcLm15000EEEEEDTcldtfp_4dataEERT_c:
   38|  17.5k|    -> decltype(c.data()) {
   39|  17.5k|  return c.data();
   40|  17.5k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNS0_4SpanIcEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  5.85k|    -> decltype(GetDataImpl(c, 0)) {
   51|  5.85k|  return GetDataImpl(c, 0);
   52|  5.85k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNS0_4SpanIcEEEEDTcldtfp_4dataEERT_c:
   38|  5.85k|    -> decltype(c.data()) {
   39|  5.85k|  return c.data();
   40|  5.85k|}
_ZN4absl12lts_2026081713span_internal7GetDataINS0_13InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS5_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  5.85k|    -> decltype(GetDataImpl(c, 0)) {
   51|  5.85k|  return GetDataImpl(c, 0);
   52|  5.85k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplINS0_13InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS5_EEEEEEDTcldtfp_4dataEERT_c:
   38|  5.85k|    -> decltype(c.data()) {
   39|  5.85k|  return c.data();
   40|  5.85k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNS0_4SpanIjEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|      8|    -> decltype(GetDataImpl(c, 0)) {
   51|      8|  return GetDataImpl(c, 0);
   52|      8|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNS0_4SpanIjEEEEDTcldtfp_4dataEERT_c:
   38|      8|    -> decltype(c.data()) {
   39|      8|  return c.data();
   40|      8|}
_ZN4absl12lts_2026081713span_internal7GetDataINSt3__16vectorIPNS0_7LogSinkENS3_9allocatorIS6_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  5.85k|    -> decltype(GetDataImpl(c, 0)) {
   51|  5.85k|  return GetDataImpl(c, 0);
   52|  5.85k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplINSt3__16vectorIPNS0_7LogSinkENS3_9allocatorIS6_EEEEEEDTcldtfp_4dataEERT_c:
   38|  5.85k|    -> decltype(c.data()) {
   39|  5.85k|  return c.data();
   40|  5.85k|}

_ZNK4absl12lts_202608174SpanIKNS0_19str_format_internal13FormatArgImplEE4sizeEv:
  321|  47.8k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIcE4sizeEv:
  321|  1.77M|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIcE4dataEv:
  316|   795k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIcE7subspanEmm:
  465|  79.9k|  constexpr Span subspan(size_type pos = 0, size_type len = npos) const {
  466|  79.9k|    return (pos <= size()) ? Span(data() + pos, (std::min)(size() - pos, len))
  ------------------
  |  Branch (466:12): [True: 79.9k, False: 0]
  ------------------
  467|  79.9k|                           : (ThrowStdOutOfRange("pos > size()"), Span());
  468|  79.9k|  }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE5beginEv:
  373|  1.54k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE4dataEv:
  316|  3.09k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE3endEv:
  386|  1.54k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEE4sizeEv:
  321|  1.54k|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEC2INS0_10FixedArrayIS6_Lm128ENS2_9allocatorIS6_EEEEvSD_iEERKT_:
  252|  1.54k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEC2EPS7_m:
  228|  1.54k|      : ptr_(array), len_(length) {}
_ZNK4absl12lts_202608174SpanIKmEixEm:
  336|   390M|  constexpr reference operator[](size_type i) const noexcept {
  337|   390M|    absl::base_internal::HardeningAssertLT(i, size());
  338|   390M|    return ptr_[i];
  339|   390M|  }
_ZNK4absl12lts_202608174SpanIKmE4sizeEv:
  321|   586M|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEEC2INSt3__16vectorIS4_NS8_9allocatorIS4_EEEEvSC_iEERKT_:
  252|  19.2k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEEC2EPS5_m:
  228|  19.2k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIKmEC2INSt3__16vectorImNS5_9allocatorImEEEEvS9_iEERKT_:
  252|  14.4k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKmEC2EPS2_m:
  228|  14.4k|      : ptr_(array), len_(length) {}
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE4sizeEv:
  321|  3.09k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE5beginEv:
  373|  1.54k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE4dataEv:
  316|  3.09k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE3endEv:
  386|  1.54k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKiE4sizeEv:
  321|  3.23k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIKiE5beginEv:
  373|  1.61k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKiE4dataEv:
  316|  3.23k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKiE3endEv:
  386|  1.61k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKNSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEE5emptyEv:
  331|  1.54k|  constexpr bool empty() const noexcept { return size() == 0; }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE5beginEv:
  373|  19.2k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE4dataEv:
  316|  38.4k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE3endEv:
  386|  19.2k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKN13sentencepiece22SentencePieceProcessor11ExtraOptionEE4sizeEv:
  321|  19.2k|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIKiE5emptyEv:
  331|  1.61k|  constexpr bool empty() const noexcept { return size() == 0; }
_ZNK4absl12lts_202608174SpanIKcE4dataEv:
  316|   251k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKcE4sizeEv:
  321|  2.42M|  constexpr size_type size() const noexcept { return len_; }
_ZNK4absl12lts_202608174SpanIjE4dataEv:
  316|     10|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIjE4sizeEv:
  321|     10|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608174SpanIjEC2EPjm:
  228|      9|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIKjEC2EPS2_m:
  228|      8|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIKNS0_19str_format_internal13FormatArgImplEEC2IS4_S4_EESt16initializer_listIS3_E:
  308|  6.37k|      : Span(v.begin(), v.size()) {}
_ZN4absl12lts_202608174SpanIKNS0_19str_format_internal13FormatArgImplEEC2EPS4_m:
  228|  6.37k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608178MakeSpanITpTnRiJEjEENS0_4SpanIT0_EEPS4_m:
  727|      8|                           size_t size) noexcept {
  728|      8|  return Span<T>(ptr, size);
  729|      8|}
_ZN4absl12lts_202608174SpanIcEC2EPcm:
  228|   148k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIcEC2Ev:
  225|  51.3k|  constexpr Span() noexcept : Span(nullptr, 0) {}
_ZN4absl12lts_202608174SpanIKcEC2Ev:
  225|  63.0k|  constexpr Span() noexcept : Span(nullptr, 0) {}
_ZN4absl12lts_202608174SpanIKcEC2EPS2_m:
  228|   240k|      : ptr_(array), len_(length) {}
_ZNK4absl12lts_202608174SpanIKcE5emptyEv:
  331|   212k|  constexpr bool empty() const noexcept { return size() == 0; }
_ZN4absl12lts_202608174SpanIcE13remove_prefixEm:
  430|   464k|  void remove_prefix(size_type n) noexcept {
  431|   464k|    absl::base_internal::HardeningAssertGE(size(), n);
  432|   464k|    ptr_ += n;
  433|   464k|    len_ -= n;
  434|   464k|  }
_ZN4absl12lts_202608174SpanIKcE13remove_prefixEm:
  430|   372k|  void remove_prefix(size_type n) noexcept {
  431|   372k|    absl::base_internal::HardeningAssertGE(size(), n);
  432|   372k|    ptr_ += n;
  433|   372k|    len_ -= n;
  434|   372k|  }
_ZN4absl12lts_202608174SpanIKcEC2INSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEvS9_TnNS5_9enable_ifIXsr6IsViewIT_EE5valueEiE4typeELi0EEERKSB_:
  267|  34.4k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608178MakeSpanITpTnRiJENSt3__15arrayIcLm15000EEEEENS3_9enable_ifIXntsr13span_internal6IsViewIT0_EE5valueEDTclsr4abslE8MakeSpanclsr13span_internalE7GetDatafp_Ecldtfp_4sizeEEEE4typeERS7_:
  751|  11.7k|                                                c.size()))> {
  752|  11.7k|  return MakeSpan(span_internal::GetData(c), c.size());
  753|  11.7k|}
_ZN4absl12lts_202608178MakeSpanITpTnRiJEcEENS0_4SpanIT0_EEPS4_m:
  727|  11.7k|                           size_t size) noexcept {
  728|  11.7k|  return Span<T>(ptr, size);
  729|  11.7k|}
_ZN4absl12lts_202608174SpanIKcEC2INS1_IcEEvS5_TnNSt3__19enable_ifIXsr6IsViewIT_EE5valueEiE4typeELi0EEERKS8_:
  267|  5.85k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608178MakeSpanITpTnRiJENS0_13InlinedVectorIPNS0_7LogSinkELm16ENSt3__19allocatorIS5_EEEEEENS6_9enable_ifIXntsr13span_internal6IsViewIT0_EE5valueEDTclsr4abslE8MakeSpanclsr13span_internalE7GetDatafp_Ecldtfp_4sizeEEEE4typeERSB_:
  751|  5.85k|                                                c.size()))> {
  752|  5.85k|  return MakeSpan(span_internal::GetData(c), c.size());
  753|  5.85k|}
_ZN4absl12lts_202608178MakeSpanITpTnRiJEPNS0_7LogSinkEEENS0_4SpanIT0_EEPS6_m:
  727|  11.7k|                           size_t size) noexcept {
  728|  11.7k|  return Span<T>(ptr, size);
  729|  11.7k|}
_ZN4absl12lts_202608174SpanIPNS0_7LogSinkEEC2EPS3_m:
  228|  11.7k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIcEC2INSt3__15arrayIcLm15000EEEvS6_iEERT_:
  244|  5.85k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIcE13remove_suffixEm:
  439|  5.85k|  void remove_suffix(size_type n) noexcept {
  440|  5.85k|    absl::base_internal::HardeningAssertGE(size(), n);
  441|  5.85k|    len_ -= n;
  442|  5.85k|  }
_ZNK4absl12lts_202608174SpanIcEixEm:
  336|   487k|  constexpr reference operator[](size_type i) const noexcept {
  337|   487k|    absl::base_internal::HardeningAssertLT(i, size());
  338|   487k|    return ptr_[i];
  339|   487k|  }
_ZNK4absl12lts_202608174SpanIKcEixEm:
  336|   736k|  constexpr reference operator[](size_type i) const noexcept {
  337|   736k|    absl::base_internal::HardeningAssertLT(i, size());
  338|   736k|    return ptr_[i];
  339|   736k|  }
_ZNK4absl12lts_202608174SpanIKcE7subspanEmm:
  465|   108k|  constexpr Span subspan(size_type pos = 0, size_type len = npos) const {
  466|   108k|    return (pos <= size()) ? Span(data() + pos, (std::min)(size() - pos, len))
  ------------------
  |  Branch (466:12): [True: 108k, False: 0]
  ------------------
  467|   108k|                           : (ThrowStdOutOfRange("pos > size()"), Span());
  468|   108k|  }
_ZN4absl12lts_202608178MakeSpanITpTnRiJEjLm512EEENS0_4SpanIT0_EERAT1__S4_:
  757|      1|    T (&array ABSL_ATTRIBUTE_LIFETIME_BOUND)[N]) noexcept {
  758|      1|  return Span<T>(array, N);
  759|      1|}
_ZNK4absl12lts_202608174SpanIKjE5beginEv:
  373|      8|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIKjE4dataEv:
  316|     16|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIKjE3endEv:
  386|      8|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIKjE4sizeEv:
  321|      8|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608174SpanIKjEC2INS1_IjEEvS5_TnNSt3__19enable_ifIXsr6IsViewIT_EE5valueEiE4typeELi0EEERKS8_:
  267|      8|      : Span(span_internal::GetData(v), v.size()) {}
_ZNK4absl12lts_202608174SpanIjE5emptyEv:
  331|      1|  constexpr bool empty() const noexcept { return size() == 0; }
_ZNK4absl12lts_202608174SpanIKNS0_19str_format_internal13FormatArgImplEEixEm:
  336|  23.9k|  constexpr reference operator[](size_type i) const noexcept {
  337|  23.9k|    absl::base_internal::HardeningAssertLT(i, size());
  338|  23.9k|    return ptr_[i];
  339|  23.9k|  }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE5beginEv:
  373|  11.7k|  constexpr iterator begin() const noexcept { return data(); }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE4dataEv:
  316|  23.4k|  constexpr pointer data() const noexcept { return ptr_; }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE3endEv:
  386|  11.7k|  constexpr iterator end() const noexcept { return data() + size(); }
_ZNK4absl12lts_202608174SpanIPNS0_7LogSinkEE4sizeEv:
  321|  11.7k|  constexpr size_type size() const noexcept { return len_; }
_ZN4absl12lts_202608178MakeSpanITpTnRiJENSt3__16vectorIPNS0_7LogSinkENS3_9allocatorIS6_EEEEEENS3_9enable_ifIXntsr13span_internal6IsViewIT0_EE5valueEDTclsr4abslE8MakeSpanclsr13span_internalE7GetDatafp_Ecldtfp_4sizeEEEE4typeERSB_:
  751|  5.85k|                                                c.size()))> {
  752|  5.85k|  return MakeSpan(span_internal::GetData(c), c.size());
  753|  5.85k|}

_ZN6google8protobuf8internal7cleanup9ChunkList7CleanupERKNS1_11SerialArenaE:
  140|  9.80k|void ChunkList::Cleanup(const SerialArena& arena) {
  141|  9.80k|  Chunk* c = head_;
  142|  9.80k|  if (c == nullptr) return;
  ------------------
  |  Branch (142:7): [True: 9.80k, False: 0]
  ------------------
  143|      0|  GetDeallocator deallocator(arena.parent_.AllocPolicy());
  144|       |
  145|       |  // Iterate backwards in order to destroy in the right order.
  146|      0|  CleanupNode* it = next_ - 1;
  147|      0|  while (true) {
  ------------------
  |  Branch (147:10): [True: 0, Folded]
  ------------------
  148|      0|    CleanupNode* first = c->First();
  149|       |    // A prefetch distance of 8 here was chosen arbitrarily.
  150|      0|    constexpr int kPrefetchDistance = 8;
  151|      0|    CleanupNode* prefetch = it;
  152|       |    // Prefetch the first kPrefetchDistance nodes.
  153|      0|    for (int i = 0; prefetch >= first && i < kPrefetchDistance;
  ------------------
  |  Branch (153:21): [True: 0, False: 0]
  |  Branch (153:42): [True: 0, False: 0]
  ------------------
  154|      0|         --prefetch, ++i) {
  155|      0|      prefetch->Prefetch();
  156|      0|    }
  157|       |    // For the middle nodes, run destructor and prefetch the node
  158|       |    // kPrefetchDistance after the current one.
  159|      0|    for (; prefetch >= first; --it, --prefetch) {
  ------------------
  |  Branch (159:12): [True: 0, False: 0]
  ------------------
  160|      0|      it->Destroy();
  161|      0|      prefetch->Prefetch();
  162|      0|    }
  163|       |    // Note: we could consider prefetching `next` chunk earlier.
  164|      0|    absl::PrefetchToLocalCacheNta(c->next);
  165|       |    // Destroy the rest without prefetching.
  166|      0|    for (; it >= first; --it) {
  ------------------
  |  Branch (166:12): [True: 0, False: 0]
  ------------------
  167|      0|      it->Destroy();
  168|      0|    }
  169|      0|    Chunk* next = c->next;
  170|      0|    deallocator({c, c->size});
  171|      0|    if (next == nullptr) return;
  ------------------
  |  Branch (171:9): [True: 0, False: 0]
  ------------------
  172|      0|    c = next;
  173|      0|    it = c->Last();
  174|      0|  };
  175|      0|}
_ZN6google8protobuf8internal11SerialArena23AllocateAlignedFallbackEm:
  264|   542k|void* SerialArena::AllocateAlignedFallback(size_t n) {
  265|   542k|  AllocateNewBlock(n);
  266|   542k|  void* ret = nullptr;
  267|   542k|  bool res = MaybeAllocateAligned(n, &ret);
  268|   542k|  ABSL_DCHECK(res);
  ------------------
  |  |   47|   542k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   542k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.08M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   542k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.08M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.08M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 542k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   542k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 542k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   542k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 542k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.08M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.08M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  269|   542k|  return ret;
  270|   542k|}
_ZN6google8protobuf8internal11SerialArena31AllocateFromStringBlockFallbackEv:
  273|   794k|void* SerialArena::AllocateFromStringBlockFallback() {
  274|   794k|  ABSL_DCHECK_EQ(string_block_unused_.load(std::memory_order_relaxed), 0U);
  ------------------
  |  |   74|   794k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   794k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   794k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 794k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   794k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  275|   794k|  StringBlock* sb = string_block_.load(std::memory_order_relaxed);
  276|   794k|  if (sb) {
  ------------------
  |  Branch (276:7): [True: 784k, False: 9.80k]
  ------------------
  277|   784k|    AddSpaceUsed(sb->effective_size());
  278|   784k|  }
  279|       |
  280|   794k|  void* ptr;
  281|   794k|  StringBlock* new_sb;
  282|   794k|  size_t size = StringBlock::NextSize(sb);
  283|   794k|  if (MaybeAllocateAligned(size, &ptr)) {
  ------------------
  |  Branch (283:7): [True: 508k, False: 286k]
  ------------------
  284|       |    // Correct space_used_ to avoid double counting
  285|   508k|    AddSpaceUsed(-size);
  286|   508k|    new_sb = StringBlock::Emplace(ptr, size, sb);
  287|   508k|  } else {
  288|   286k|    new_sb = StringBlock::New(sb);
  289|   286k|    AddSpaceAllocated(new_sb->allocated_size());
  290|   286k|  }
  291|   794k|  string_block_.store(new_sb, std::memory_order_release);
  292|   794k|  size_t unused = new_sb->effective_size() - sizeof(std::string);
  293|   794k|  string_block_unused_.store(unused, std::memory_order_relaxed);
  294|   794k|  return new_sb->AtOffset(unused);
  295|   794k|}
_ZN6google8protobuf8internal11SerialArena16FreeStringBlocksEPNS1_11StringBlockEm:
  361|  9.80k|                                     size_t unused_bytes) {
  362|  9.80k|  ABSL_DCHECK(string_block != nullptr);
  ------------------
  |  |   47|  9.80k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|  9.80k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  19.6k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|  9.80k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  19.6k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  19.6k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 9.80k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|  9.80k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 9.80k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|  9.80k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 9.80k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  19.6k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  19.6k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  363|  9.80k|  StringBlock* next = string_block->next();
  364|  9.80k|  absl::PrefetchToLocalCacheNta(next);
  365|  9.80k|  std::string* end = string_block->end();
  366|   861k|  for (std::string* s = string_block->AtOffset(unused_bytes); s != end; ++s) {
  ------------------
  |  Branch (366:63): [True: 851k, False: 9.80k]
  ------------------
  367|   851k|    s->~basic_string();
  368|   851k|  }
  369|  9.80k|  size_t deallocated = StringBlock::Delete(string_block);
  370|       |
  371|   794k|  while ((string_block = next) != nullptr) {
  ------------------
  |  Branch (371:10): [True: 784k, False: 9.80k]
  ------------------
  372|   784k|    next = string_block->next();
  373|   784k|    absl::PrefetchToLocalCacheNta(next);
  374|   254M|    for (std::string& s : *string_block) {
  ------------------
  |  Branch (374:25): [True: 254M, False: 784k]
  ------------------
  375|   254M|      s.~basic_string();
  376|   254M|    }
  377|   784k|    deallocated += StringBlock::Delete(string_block);
  378|   784k|  }
  379|  9.80k|  return deallocated;
  380|  9.80k|}
_ZN6google8protobuf8internal15ThreadSafeArena22SentrySerialArenaChunkEv:
  532|  9.80k|ThreadSafeArena::SerialArenaChunk* ThreadSafeArena::SentrySerialArenaChunk() {
  533|       |  // const_cast is okay because the sentry chunk is never mutated. Also,
  534|       |  // reinterpret_cast is acceptable here as it should be identical to
  535|       |  // SerialArenaChunk with zero payload. This is a necessary trick to
  536|       |  // constexpr initialize kSentryArenaChunk.
  537|  9.80k|  return reinterpret_cast<SerialArenaChunk*>(
  538|  9.80k|      const_cast<SerialArenaChunkHeader*>(&kSentryArenaChunk));
  539|  9.80k|}
_ZN6google8protobuf8internal15ThreadSafeArenaC2Ev:
  560|  9.80k|ThreadSafeArena::ThreadSafeArena() : first_arena_(*this) { Init(); }
_ZN6google8protobuf8internal15ThreadSafeArena18GetNextLifeCycleIdEv:
  649|  9.80k|uint64_t ThreadSafeArena::GetNextLifeCycleId() {
  650|  9.80k|  ThreadCache& tc = thread_cache();
  651|  9.80k|  uint64_t id = tc.next_lifecycle_id;
  652|  9.80k|  constexpr uint64_t kInc = ThreadCache::kPerThreadIds;
  653|  9.80k|  if (ABSL_PREDICT_FALSE((id & (kInc - 1)) == 0)) {
  ------------------
  |  |  190|  9.80k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 39, False: 9.76k]
  |  |  |  Branch (190:49): [Folded, False: 9.80k]
  |  |  |  Branch (190:58): [True: 39, False: 9.76k]
  |  |  ------------------
  ------------------
  654|       |    // On platforms that don't support uint64_t atomics we can certainly not
  655|       |    // afford to increment by large intervals and expect uniqueness due to
  656|       |    // wrapping, hence we only add by 1.
  657|     39|    id = lifecycle_id_.fetch_add(1, std::memory_order_relaxed) * kInc;
  658|     39|  }
  659|  9.80k|  tc.next_lifecycle_id = id + 1;
  660|  9.80k|  return id;
  661|  9.80k|}
_ZN6google8protobuf8internal15ThreadSafeArena4InitEv:
  730|  9.80k|void ThreadSafeArena::Init() {
  731|  9.80k|  tag_and_id_ = GetNextLifeCycleId();
  732|  9.80k|  arena_stats_ = Sample();
  733|  9.80k|  head_.store(SentrySerialArenaChunk(), std::memory_order_relaxed);
  734|  9.80k|  first_owner_ = &thread_cache();
  735|       |
  736|       |  // Record allocation for the first block that was either user-provided or
  737|       |  // newly allocated.
  738|  9.80k|  ThreadSafeArenaStats::RecordAllocateStats(
  739|  9.80k|      arena_stats_.MutableStats(),
  740|  9.80k|      /*used=*/0,
  741|  9.80k|      /*allocated=*/first_arena_.SpaceAllocated(),
  742|  9.80k|      /*wasted=*/0);
  743|       |
  744|  9.80k|  CacheSerialArena(&first_arena_);
  745|  9.80k|}
_ZN6google8protobuf8internal15ThreadSafeArenaD2Ev:
  747|  9.80k|ThreadSafeArena::~ThreadSafeArena() {
  748|       |  // Have to do this in a first pass, because some of the destructors might
  749|       |  // refer to memory in other blocks.
  750|  9.80k|  CleanupList();
  751|       |
  752|  9.80k|  auto mem = Free();
  753|  9.80k|  if (alloc_policy_.is_user_owned_initial_block()) {
  ------------------
  |  Branch (753:7): [True: 0, False: 9.80k]
  ------------------
  754|       |    // Unpoison the initial block, now that it's going back to the user.
  755|      0|    internal::UnpoisonMemoryRegion(mem.p, mem.n);
  756|  9.80k|  } else if (mem.n > 0) {
  ------------------
  |  Branch (756:14): [True: 0, False: 9.80k]
  ------------------
  757|      0|    GetDeallocator(alloc_policy_.get())(mem);
  758|      0|  }
  759|  9.80k|}
_ZN6google8protobuf8internal15ThreadSafeArena4FreeEv:
  761|  9.80k|SizedPtr ThreadSafeArena::Free() {
  762|  9.80k|  auto deallocator = GetDeallocator(alloc_policy_.get());
  763|       |
  764|  9.80k|  WalkSerialArenaChunk([&](SerialArenaChunk* chunk) {
  765|  9.80k|    absl::Span<std::atomic<SerialArena*>> span = chunk->arenas();
  766|       |    // Walks arenas backward to handle the first serial arena the last. Freeing
  767|       |    // in reverse-order to the order in which objects were created may not be
  768|       |    // necessary to Free and we should revisit this. (b/247560530)
  769|  9.80k|    for (auto it = span.rbegin(); it != span.rend(); ++it) {
  770|  9.80k|      SerialArena* serial = it->load(std::memory_order_relaxed);
  771|  9.80k|      ABSL_DCHECK_NE(serial, nullptr);
  772|       |      // Always frees the first block of "serial" as it cannot be user-provided.
  773|  9.80k|      SizedPtr mem = serial->Free(deallocator);
  774|  9.80k|      ABSL_DCHECK_NE(mem.p, nullptr);
  775|  9.80k|      deallocator(mem);
  776|  9.80k|    }
  777|       |
  778|       |    // Delete the chunk as we're done with it.
  779|  9.80k|    internal::SizedDelete(chunk,
  780|  9.80k|                          SerialArenaChunk::AllocSize(chunk->capacity()));
  781|  9.80k|  });
  782|       |
  783|       |  // The first block of the first arena is special and let the caller handle it.
  784|  9.80k|  return first_arena_.Free(deallocator);
  785|  9.80k|}
_ZN6google8protobuf8internal15ThreadSafeArena23AllocateFromStringBlockEv:
  848|   255M|void* ThreadSafeArena::AllocateFromStringBlock() {
  849|   255M|  return GetSerialArena()->AllocateFromStringBlock();
  850|   255M|}
_ZN6google8protobuf8internal15ThreadSafeArena11CleanupListEv:
  926|  9.80k|void ThreadSafeArena::CleanupList() {
  927|       |  if constexpr (HasMemoryPoisoning()) {
  928|       |    UnpoisonAllArenaBlocks();
  929|       |  }
  930|       |
  931|  9.80k|  WalkSerialArenaChunk([](SerialArenaChunk* chunk) {
  932|  9.80k|    absl::Span<std::atomic<SerialArena*>> span = chunk->arenas();
  933|       |    // Walks arenas backward to handle the first serial arena the last.
  934|       |    // Destroying in reverse-order to the construction is often assumed by users
  935|       |    // and required not to break inter-object dependencies. (b/247560530)
  936|  9.80k|    for (auto it = span.rbegin(); it != span.rend(); ++it) {
  937|  9.80k|      SerialArena* serial = it->load(std::memory_order_relaxed);
  938|  9.80k|      ABSL_DCHECK_NE(serial, nullptr);
  939|  9.80k|      serial->CleanupList();
  940|  9.80k|    }
  941|  9.80k|  });
  942|       |  // First arena must be cleaned up last. (b/247560530)
  943|  9.80k|  first_arena_.CleanupList();
  944|  9.80k|}
_ZN6google8protobuf5Arena8AllocateEm:
  983|   157M|void* PROTOBUF_NONNULL Arena::Allocate(size_t n) {
  984|   157M|  return impl_.AllocateAligned(n);
  985|   157M|}
_ZN6google8protobuf5Arena16AllocateForArrayEm:
  987|   114k|void* PROTOBUF_NONNULL Arena::AllocateForArray(size_t n) {
  988|   114k|  return impl_.AllocateAligned<internal::AllocationClient::kArray>(n);
  989|   114k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_114AllocationSizeEmmm:
   54|   542k|                             size_t max_size) {
   55|   542k|  if (last_size == 0) return start_size;
  ------------------
  |  Branch (55:7): [True: 9.80k, False: 532k]
  ------------------
   56|       |  // Double the current block size, up to a limit.
   57|   532k|  return std::min(2 * last_size, max_size);
   58|   542k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_114AllocateMemoryERKNS1_16AllocationPolicyEm:
   60|   542k|SizedPtr AllocateMemory(const AllocationPolicy& policy, size_t size) {
   61|   542k|  if (policy.block_alloc == nullptr) {
  ------------------
  |  Branch (61:7): [True: 542k, False: 0]
  ------------------
   62|   542k|    return AllocateAtLeast(size);
   63|   542k|  }
   64|      0|  return {policy.block_alloc(size), size};
   65|   542k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_114GetDeallocatorC2EPKNS1_16AllocationPolicyE:
   95|  9.80k|      : dealloc_(policy ? policy->block_dealloc : nullptr) {}
  ------------------
  |  Branch (95:18): [True: 0, False: 9.80k]
  ------------------
arena.cc:_ZNK6google8protobuf8internal12_GLOBAL__N_114GetDeallocatorclENS1_8SizedPtrE:
   97|   542k|  void operator()(SizedPtr mem) const {
   98|   542k|    if (dealloc_) {
  ------------------
  |  Branch (98:9): [True: 0, False: 542k]
  ------------------
   99|      0|      dealloc_(mem.p, mem.n);
  100|   542k|    } else {
  101|   542k|      internal::SizedDelete(mem.p, mem.n);
  102|   542k|    }
  103|   542k|  }
_ZN6google8protobuf8internal11SerialArena16AllocateNewBlockEm:
  305|   542k|void SerialArena::AllocateNewBlock(size_t n) {
  306|   542k|  size_t used = 0;
  307|   542k|  size_t wasted = 0;
  308|   542k|  ArenaBlock* old_head = head();
  309|   542k|  if (!old_head->IsSentry()) {
  ------------------
  |  Branch (309:7): [True: 532k, False: 9.80k]
  ------------------
  310|       |    // Record how much used in this block.
  311|   532k|    used = static_cast<size_t>(ptr() - old_head->Pointer(kBlockHeaderSize));
  312|   532k|    wasted = old_head->size - used - kBlockHeaderSize;
  313|   532k|    AddSpaceUsed(used);
  314|   532k|  }
  315|       |
  316|       |  // TODO: Evaluate if pushing unused space into the cached blocks is a
  317|       |  // win. In preliminary testing showed increased memory savings as expected,
  318|       |  // but with a CPU regression. The regression might have been an artifact of
  319|       |  // the microbenchmark.
  320|       |
  321|   542k|  auto mem = AllocateBlock(parent_.AllocPolicy(), old_head->size, n);
  322|   542k|  AddSpaceAllocated(mem.n);
  323|   542k|  ThreadSafeArenaStats::RecordAllocateStats(parent_.arena_stats_.MutableStats(),
  324|   542k|                                            /*used=*/used,
  325|   542k|                                            /*allocated=*/mem.n, wasted);
  326|   542k|  auto* new_head = new (mem.p) ArenaBlock{old_head, mem.n};
  327|   542k|  set_range(new_head->Pointer(kBlockHeaderSize), new_head->Limit());
  328|       |  // Previous writes must take effect before writing new head.
  329|   542k|  head_.store(new_head, std::memory_order_release);
  330|       |
  331|   542k|  internal::PoisonMemoryRegion(ptr(), limit_ - ptr());
  332|   542k|}
_ZN6google8protobuf8internal11SerialArenaC2ERNS1_15ThreadSafeArenaE:
  210|  9.80k|    : head_{SentryArenaBlock()}, parent_{parent} {}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_116SentryArenaBlockEv:
   48|  9.80k|ArenaBlock* SentryArenaBlock() {
   49|       |  // const_cast<> is okay as kSentryArenaBlock will never be mutated.
   50|  9.80k|  return const_cast<ArenaBlock*>(&kSentryArenaBlock);
   51|  9.80k|}
arena.cc:_ZN6google8protobuf8internal12_GLOBAL__N_113AllocateBlockEPKNS1_16AllocationPolicyEmm:
   68|   542k|                       size_t min_bytes) {
   69|   542k|  AllocationPolicy policy;  // default policy
   70|   542k|  if (policy_ptr) policy = *policy_ptr;
  ------------------
  |  Branch (70:7): [True: 0, False: 542k]
  ------------------
   71|   542k|  size_t size =
   72|   542k|      AllocationSize(last_size, policy.start_block_size, policy.max_block_size);
   73|       |  // Verify that min_bytes + kBlockHeaderSize won't overflow.
   74|   542k|  ABSL_CHECK_LE(min_bytes, std::numeric_limits<size_t>::max() -
  ------------------
  |  |   54|   542k|  ABSL_LOG_INTERNAL_CHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   53|   542k|  ABSL_LOG_INTERNAL_CHECK_OP(Check_LE, <=, val1, val1_text, val2, val2_text)
  |  |  |  |  ------------------
  |  |  |  |  |  |   68|   542k|  while (const char* absl_nullable absl_log_internal_check_op_result           \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (68:36): [True: 0, False: 542k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   69|   542k|         [[maybe_unused]] = ::absl::log_internal::name##Impl(                  \
  |  |  |  |  |  |   70|   542k|             ::absl::log_internal::GetReferenceableValue(val1),                \
  |  |  |  |  |  |   71|   542k|             ::absl::log_internal::GetReferenceableValue(val2),                \
  |  |  |  |  |  |   72|   542k|             ABSL_LOG_INTERNAL_STRIP_STRING_LITERAL(val1_text " " #op          \
  |  |  |  |  |  |   73|   542k|                                                              " " val2_text))) \
  |  |  |  |  |  |   74|   542k|    ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS, true)                         \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   75|      0|  ABSL_LOG_INTERNAL_CHECK(::absl::implicit_cast<const char* absl_nonnull>(     \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   76|      0|                              absl_log_internal_check_op_result))              \
  |  |  |  |  |  |   77|      0|      .InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   75|   542k|                               SerialArena::kBlockHeaderSize);
   76|   542k|  size = std::max(size, SerialArena::kBlockHeaderSize + min_bytes);
   77|       |
   78|   542k|  return AllocateMemory(policy, size);
   79|   542k|}
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk8IsSentryEv:
  431|  19.6k|  bool IsSentry() const { return capacity() == 0; }
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk8capacityEv:
  441|  19.6k|  uint32_t capacity() const { return header().capacity; }
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk6headerEv:
  511|  19.6k|  const SerialArenaChunkHeader& header() const {
  512|  19.6k|    return *layout_type::Partial().Pointer<kHeader>(ptr());
  513|  19.6k|  }
_ZNK6google8protobuf8internal15ThreadSafeArena16SerialArenaChunk3ptrEv:
  505|  19.6k|  const char* ptr() const { return reinterpret_cast<const char*>(this); }
arena.cc:_ZN6google8protobuf8internal11SerialArena4FreeINS1_12_GLOBAL__N_114GetDeallocatorEEENS1_8SizedPtrET_:
  250|  9.80k|SizedPtr SerialArena::Free(Deallocator deallocator) {
  251|  9.80k|  FreeStringBlocks();
  252|       |
  253|  9.80k|  ArenaBlock* b = head();
  254|  9.80k|  SizedPtr mem = {b, b->size};
  255|   551k|  while (b->next) {
  ------------------
  |  Branch (255:10): [True: 542k, False: 9.80k]
  ------------------
  256|   542k|    b = b->next;  // We must first advance before deleting this block
  257|   542k|    deallocator(mem);
  258|   542k|    mem = {b, b->size};
  259|   542k|  }
  260|  9.80k|  return mem;
  261|  9.80k|}
arena.cc:_ZN6google8protobuf8internal15ThreadSafeArena20WalkSerialArenaChunkIZNS2_4FreeEvE3$_0EEvT_:
  864|  9.80k|void ThreadSafeArena::WalkSerialArenaChunk(Callback fn) {
  865|       |  // By omitting an Acquire barrier we help the sanitizer that any user code
  866|       |  // that doesn't properly synchronize Reset() or the destructor will throw a
  867|       |  // TSAN warning.
  868|  9.80k|  SerialArenaChunk* chunk = head_.load(std::memory_order_relaxed);
  869|       |
  870|  9.80k|  while (!chunk->IsSentry()) {
  ------------------
  |  Branch (870:10): [True: 0, False: 9.80k]
  ------------------
  871|       |    // Cache next chunk in case this chunk is destroyed.
  872|      0|    SerialArenaChunk* next_chunk = chunk->next_chunk();
  873|       |    // Prefetch the next chunk.
  874|      0|    absl::PrefetchToLocalCache(next_chunk);
  875|      0|    fn(chunk);
  876|      0|    chunk = next_chunk;
  877|      0|  }
  878|  9.80k|}
arena.cc:_ZN6google8protobuf8internal15ThreadSafeArena20WalkSerialArenaChunkIZNS2_11CleanupListEvE3$_0EEvT_:
  864|  9.80k|void ThreadSafeArena::WalkSerialArenaChunk(Callback fn) {
  865|       |  // By omitting an Acquire barrier we help the sanitizer that any user code
  866|       |  // that doesn't properly synchronize Reset() or the destructor will throw a
  867|       |  // TSAN warning.
  868|  9.80k|  SerialArenaChunk* chunk = head_.load(std::memory_order_relaxed);
  869|       |
  870|  9.80k|  while (!chunk->IsSentry()) {
  ------------------
  |  Branch (870:10): [True: 0, False: 9.80k]
  ------------------
  871|       |    // Cache next chunk in case this chunk is destroyed.
  872|      0|    SerialArenaChunk* next_chunk = chunk->next_chunk();
  873|       |    // Prefetch the next chunk.
  874|      0|    absl::PrefetchToLocalCache(next_chunk);
  875|      0|    fn(chunk);
  876|      0|    chunk = next_chunk;
  877|      0|  }
  878|  9.80k|}

_ZN6google8protobuf5ArenaC2Ev:
  293|  9.80k|  inline Arena() : impl_() {}
_ZN6google8protobuf5ArenaD2Ev:
  318|  9.80k|  inline ~Arena() = default;
_ZN6google8protobuf5Arena16DefaultConstructIN13sentencepiece31SentencePieceText_SentencePieceEEEPvPS1_:
 1134|   157M|Arena::DefaultConstruct(Arena* PROTOBUF_NULLABLE arena) {
 1135|       |  if constexpr (internal::FieldHasArenaOffset<T>()) {
 1136|       |    if (arena != nullptr) {
 1137|       |      using ArenaRepT = typename internal::FieldArenaRep<T>::Type;
 1138|       |      static_assert(is_destructor_skippable<ArenaRepT>::value);
 1139|       |
 1140|       |      void* mem = arena->AllocateAligned(sizeof(ArenaRepT));
 1141|       |      ArenaRepT* arena_rep = new (mem) ArenaRepT(arena);
 1142|       |      return internal::FieldArenaRep<T>::Get(arena_rep);
 1143|       |    } else {
 1144|       |      static_assert(is_destructor_skippable<T>::value);
 1145|       |      // Fields which use arena offsets don't have constructors that take an
 1146|       |      // arena pointer. Since the arena is nullptr, it is safe to default
 1147|       |      // construct the object.
 1148|       |      return new (internal::Allocate(sizeof(T))) T();
 1149|       |    }
 1150|   157M|  } else {
 1151|   157M|    static_assert(is_destructor_skippable<T>::value);
 1152|   157M|    void* mem = arena != nullptr ? arena->AllocateAligned(sizeof(T))
  ------------------
  |  Branch (1152:17): [True: 157M, False: 0]
  ------------------
 1153|   157M|                                 : internal::Allocate(sizeof(T));
 1154|       |    if constexpr (internal::HasDeprecatedArenaConstructor<T>()) {
 1155|       |      return new (mem) T(internal::InternalVisibility(), arena);
 1156|   157M|    } else {
 1157|   157M|      return new (mem) T(arena);
 1158|   157M|    }
 1159|   157M|  }
 1160|   157M|}
_ZN6google8protobuf5Arena15AllocateAlignedEmm:
  406|   157M|  AllocateAligned(size_t size, size_t align = 8) {
  407|   157M|    if (align <= internal::ArenaAlignDefault::align) {
  ------------------
  |  Branch (407:9): [True: 157M, False: 0]
  ------------------
  408|   157M|      return Allocate(internal::ArenaAlignDefault::Ceil(size));
  409|   157M|    } else {
  410|       |      // We are wasting space by over allocating align - 8 bytes. Compared
  411|       |      // to a dedicated function that takes current alignment in consideration.
  412|       |      // Such a scheme would only waste (align - 8)/2 bytes on average, but
  413|       |      // requires a dedicated function in the outline arena allocation
  414|       |      // functions. Possibly re-evaluate tradeoffs later.
  415|      0|      auto align_as = internal::ArenaAlignAs(align);
  416|      0|      return align_as.Ceil(Allocate(align_as.Padded(size)));
  417|      0|    }
  418|   157M|  }
_ZN6google8protobuf5Arena16DefaultConstructIN13sentencepiece17SentencePieceTextEEEPvPS1_:
 1134|  14.4k|Arena::DefaultConstruct(Arena* PROTOBUF_NULLABLE arena) {
 1135|       |  if constexpr (internal::FieldHasArenaOffset<T>()) {
 1136|       |    if (arena != nullptr) {
 1137|       |      using ArenaRepT = typename internal::FieldArenaRep<T>::Type;
 1138|       |      static_assert(is_destructor_skippable<ArenaRepT>::value);
 1139|       |
 1140|       |      void* mem = arena->AllocateAligned(sizeof(ArenaRepT));
 1141|       |      ArenaRepT* arena_rep = new (mem) ArenaRepT(arena);
 1142|       |      return internal::FieldArenaRep<T>::Get(arena_rep);
 1143|       |    } else {
 1144|       |      static_assert(is_destructor_skippable<T>::value);
 1145|       |      // Fields which use arena offsets don't have constructors that take an
 1146|       |      // arena pointer. Since the arena is nullptr, it is safe to default
 1147|       |      // construct the object.
 1148|       |      return new (internal::Allocate(sizeof(T))) T();
 1149|       |    }
 1150|  14.4k|  } else {
 1151|  14.4k|    static_assert(is_destructor_skippable<T>::value);
 1152|  14.4k|    void* mem = arena != nullptr ? arena->AllocateAligned(sizeof(T))
  ------------------
  |  Branch (1152:17): [True: 14.4k, False: 0]
  ------------------
 1153|  14.4k|                                 : internal::Allocate(sizeof(T));
 1154|       |    if constexpr (internal::HasDeprecatedArenaConstructor<T>()) {
 1155|       |      return new (mem) T(internal::InternalVisibility(), arena);
 1156|  14.4k|    } else {
 1157|  14.4k|      return new (mem) T(arena);
 1158|  14.4k|    }
 1159|  14.4k|  }
 1160|  14.4k|}
_ZN6google8protobuf5Arena6CreateIN13sentencepiece22NBestSentencePieceTextEJEEEPT_PS1_DpOT0_:
  330|  4.59k|      Create(Arena* PROTOBUF_NULLABLE arena, Args&&... args) {
  331|  4.59k|    if constexpr (is_arena_constructable<T>::value) {
  332|  4.59k|      using Type = std::remove_const_t<T>;
  333|       |      // DefaultConstruct/CopyConstruct are optimized for messages, which
  334|       |      // are both arena constructible and destructor skippable and they
  335|       |      // assume much. Don't use these functions unless the invariants
  336|       |      // hold.
  337|  4.59k|      if constexpr (is_destructor_skippable<T>::value) {
  338|  4.59k|        constexpr auto construct_type = GetConstructType<T, Args&&...>();
  339|       |        // We delegate to DefaultConstruct/CopyConstruct where appropriate
  340|       |        // because protobuf generated classes have external templates for
  341|       |        // these functions for code size reasons. When `if constexpr` is not
  342|       |        // available always use the fallback.
  343|  4.59k|        if constexpr (construct_type == ConstructType::kDefault) {
  344|  4.59k|          return static_cast<Type*>(DefaultConstruct<Type>(arena));
  345|       |        } else if constexpr (construct_type == ConstructType::kCopy) {
  346|       |          return static_cast<Type*>(CopyConstruct<Type>(arena, &args...));
  347|       |        }
  348|  4.59k|      }
  349|      0|      return CreateArenaCompatible<Type>(arena, std::forward<Args>(args)...);
  350|       |    } else {
  351|       |      if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  352|       |        return new T(std::forward<Args>(args)...);
  353|       |      }
  354|       |      return new (arena->AllocateInternal<T>()) T(std::forward<Args>(args)...);
  355|       |    }
  356|  4.59k|  }
_ZN6google8protobuf5Arena16DefaultConstructIN13sentencepiece22NBestSentencePieceTextEEEPvPS1_:
 1134|  4.59k|Arena::DefaultConstruct(Arena* PROTOBUF_NULLABLE arena) {
 1135|       |  if constexpr (internal::FieldHasArenaOffset<T>()) {
 1136|       |    if (arena != nullptr) {
 1137|       |      using ArenaRepT = typename internal::FieldArenaRep<T>::Type;
 1138|       |      static_assert(is_destructor_skippable<ArenaRepT>::value);
 1139|       |
 1140|       |      void* mem = arena->AllocateAligned(sizeof(ArenaRepT));
 1141|       |      ArenaRepT* arena_rep = new (mem) ArenaRepT(arena);
 1142|       |      return internal::FieldArenaRep<T>::Get(arena_rep);
 1143|       |    } else {
 1144|       |      static_assert(is_destructor_skippable<T>::value);
 1145|       |      // Fields which use arena offsets don't have constructors that take an
 1146|       |      // arena pointer. Since the arena is nullptr, it is safe to default
 1147|       |      // construct the object.
 1148|       |      return new (internal::Allocate(sizeof(T))) T();
 1149|       |    }
 1150|  4.59k|  } else {
 1151|  4.59k|    static_assert(is_destructor_skippable<T>::value);
 1152|  4.59k|    void* mem = arena != nullptr ? arena->AllocateAligned(sizeof(T))
  ------------------
  |  Branch (1152:17): [True: 4.59k, False: 0]
  ------------------
 1153|  4.59k|                                 : internal::Allocate(sizeof(T));
 1154|       |    if constexpr (internal::HasDeprecatedArenaConstructor<T>()) {
 1155|       |      return new (mem) T(internal::InternalVisibility(), arena);
 1156|  4.59k|    } else {
 1157|  4.59k|      return new (mem) T(arena);
 1158|  4.59k|    }
 1159|  4.59k|  }
 1160|  4.59k|}
_ZN6google8protobuf5Arena6CreateIN13sentencepiece17SentencePieceTextEJEEEPT_PS1_DpOT0_:
  330|  5.20k|      Create(Arena* PROTOBUF_NULLABLE arena, Args&&... args) {
  331|  5.20k|    if constexpr (is_arena_constructable<T>::value) {
  332|  5.20k|      using Type = std::remove_const_t<T>;
  333|       |      // DefaultConstruct/CopyConstruct are optimized for messages, which
  334|       |      // are both arena constructible and destructor skippable and they
  335|       |      // assume much. Don't use these functions unless the invariants
  336|       |      // hold.
  337|  5.20k|      if constexpr (is_destructor_skippable<T>::value) {
  338|  5.20k|        constexpr auto construct_type = GetConstructType<T, Args&&...>();
  339|       |        // We delegate to DefaultConstruct/CopyConstruct where appropriate
  340|       |        // because protobuf generated classes have external templates for
  341|       |        // these functions for code size reasons. When `if constexpr` is not
  342|       |        // available always use the fallback.
  343|  5.20k|        if constexpr (construct_type == ConstructType::kDefault) {
  344|  5.20k|          return static_cast<Type*>(DefaultConstruct<Type>(arena));
  345|       |        } else if constexpr (construct_type == ConstructType::kCopy) {
  346|       |          return static_cast<Type*>(CopyConstruct<Type>(arena, &args...));
  347|       |        }
  348|  5.20k|      }
  349|      0|      return CreateArenaCompatible<Type>(arena, std::forward<Args>(args)...);
  350|       |    } else {
  351|       |      if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  352|       |        return new T(std::forward<Args>(args)...);
  353|       |      }
  354|       |      return new (arena->AllocateInternal<T>()) T(std::forward<Args>(args)...);
  355|       |    }
  356|  5.20k|  }
_ZN6google8protobuf5Arena17ReturnArrayMemoryEPvm:
  695|  97.2k|  void ReturnArrayMemory(void* PROTOBUF_NONNULL p, size_t size) {
  696|  97.2k|    impl_.ReturnArrayMemory(p, size);
  697|  97.2k|  }
_ZN6google8protobuf5Arena23AllocateAlignedForArrayEmm:
  804|   114k|  void* PROTOBUF_NONNULL AllocateAlignedForArray(size_t n, size_t align) {
  805|   114k|    if (align <= internal::ArenaAlignDefault::align) {
  ------------------
  |  Branch (805:9): [True: 114k, False: 0]
  ------------------
  806|   114k|      return AllocateForArray(internal::ArenaAlignDefault::Ceil(n));
  807|   114k|    } else {
  808|       |      // We are wasting space by over allocating align - 8 bytes. Compared
  809|       |      // to a dedicated function that takes current alignment in consideration.
  810|       |      // Such a scheme would only waste (align - 8)/2 bytes on average, but
  811|       |      // requires a dedicated function in the outline arena allocation
  812|       |      // functions. Possibly re-evaluate tradeoffs later.
  813|      0|      auto align_as = internal::ArenaAlignAs(align);
  814|      0|      return align_as.Ceil(AllocateForArray(align_as.Padded(n)));
  815|      0|    }
  816|   114k|  }
_ZN6google8protobuf5Arena16AllocateInternalINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEELb0EEEPvv:
 1191|   255M|inline void* PROTOBUF_NONNULL Arena::AllocateInternal<std::string, false>() {
 1192|   255M|  return impl_.AllocateFromStringBlock();
 1193|   255M|}
_ZN6google8protobuf5Arena6CreateINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJEEEPT_PS1_DpOT0_:
  330|   135M|      Create(Arena* PROTOBUF_NULLABLE arena, Args&&... args) {
  331|       |    if constexpr (is_arena_constructable<T>::value) {
  332|       |      using Type = std::remove_const_t<T>;
  333|       |      // DefaultConstruct/CopyConstruct are optimized for messages, which
  334|       |      // are both arena constructible and destructor skippable and they
  335|       |      // assume much. Don't use these functions unless the invariants
  336|       |      // hold.
  337|       |      if constexpr (is_destructor_skippable<T>::value) {
  338|       |        constexpr auto construct_type = GetConstructType<T, Args&&...>();
  339|       |        // We delegate to DefaultConstruct/CopyConstruct where appropriate
  340|       |        // because protobuf generated classes have external templates for
  341|       |        // these functions for code size reasons. When `if constexpr` is not
  342|       |        // available always use the fallback.
  343|       |        if constexpr (construct_type == ConstructType::kDefault) {
  344|       |          return static_cast<Type*>(DefaultConstruct<Type>(arena));
  345|       |        } else if constexpr (construct_type == ConstructType::kCopy) {
  346|       |          return static_cast<Type*>(CopyConstruct<Type>(arena, &args...));
  347|       |        }
  348|       |      }
  349|       |      return CreateArenaCompatible<Type>(arena, std::forward<Args>(args)...);
  350|   135M|    } else {
  351|   135M|      if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  ------------------
  |  |  190|   135M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 135M]
  |  |  |  Branch (190:49): [Folded, False: 135M]
  |  |  |  Branch (190:58): [True: 0, False: 135M]
  |  |  ------------------
  ------------------
  352|      0|        return new T(std::forward<Args>(args)...);
  353|      0|      }
  354|   135M|      return new (arena->AllocateInternal<T>()) T(std::forward<Args>(args)...);
  355|   135M|    }
  356|   135M|  }
_ZN6google8protobuf5Arena6CreateINSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEEJPKcmEEEPT_PS1_DpOT0_:
  330|   119M|      Create(Arena* PROTOBUF_NULLABLE arena, Args&&... args) {
  331|       |    if constexpr (is_arena_constructable<T>::value) {
  332|       |      using Type = std::remove_const_t<T>;
  333|       |      // DefaultConstruct/CopyConstruct are optimized for messages, which
  334|       |      // are both arena constructible and destructor skippable and they
  335|       |      // assume much. Don't use these functions unless the invariants
  336|       |      // hold.
  337|       |      if constexpr (is_destructor_skippable<T>::value) {
  338|       |        constexpr auto construct_type = GetConstructType<T, Args&&...>();
  339|       |        // We delegate to DefaultConstruct/CopyConstruct where appropriate
  340|       |        // because protobuf generated classes have external templates for
  341|       |        // these functions for code size reasons. When `if constexpr` is not
  342|       |        // available always use the fallback.
  343|       |        if constexpr (construct_type == ConstructType::kDefault) {
  344|       |          return static_cast<Type*>(DefaultConstruct<Type>(arena));
  345|       |        } else if constexpr (construct_type == ConstructType::kCopy) {
  346|       |          return static_cast<Type*>(CopyConstruct<Type>(arena, &args...));
  347|       |        }
  348|       |      }
  349|       |      return CreateArenaCompatible<Type>(arena, std::forward<Args>(args)...);
  350|   119M|    } else {
  351|   119M|      if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  ------------------
  |  |  190|   119M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 119M]
  |  |  |  Branch (190:49): [Folded, False: 119M]
  |  |  |  Branch (190:58): [True: 0, False: 119M]
  |  |  ------------------
  ------------------
  352|      0|        return new T(std::forward<Args>(args)...);
  353|      0|      }
  354|   119M|      return new (arena->AllocateInternal<T>()) T(std::forward<Args>(args)...);
  355|   119M|    }
  356|   119M|  }
_ZN6google8protobuf5Arena11CreateArrayIcEEPT_PS1_m:
  429|   114k|      CreateArray(Arena* PROTOBUF_NULLABLE arena, size_t num_elements) {
  430|   114k|    static_assert(std::is_trivially_default_constructible_v<T>,
  431|   114k|                  "CreateArray requires a trivially constructible type");
  432|   114k|    static_assert(std::is_trivially_destructible_v<T>,
  433|   114k|                  "CreateArray requires a trivially destructible type");
  434|   114k|    ABSL_CHECK_LE(num_elements,
  ------------------
  |  |   54|      0|  ABSL_LOG_INTERNAL_CHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   53|   114k|  ABSL_LOG_INTERNAL_CHECK_OP(Check_LE, <=, val1, val1_text, val2, val2_text)
  |  |  |  |  ------------------
  |  |  |  |  |  |   68|   114k|  while (const char* absl_nullable absl_log_internal_check_op_result           \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (68:36): [True: 0, False: 114k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   69|   114k|         [[maybe_unused]] = ::absl::log_internal::name##Impl(                  \
  |  |  |  |  |  |   70|   114k|             ::absl::log_internal::GetReferenceableValue(val1),                \
  |  |  |  |  |  |   71|   114k|             ::absl::log_internal::GetReferenceableValue(val2),                \
  |  |  |  |  |  |   72|   114k|             ABSL_LOG_INTERNAL_STRIP_STRING_LITERAL(val1_text " " #op          \
  |  |  |  |  |  |   73|   114k|                                                              " " val2_text))) \
  |  |  |  |  |  |   74|   114k|    ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS, true)                         \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   75|   114k|  ABSL_LOG_INTERNAL_CHECK(::absl::implicit_cast<const char* absl_nonnull>(     \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|   114k|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   76|      0|                              absl_log_internal_check_op_result))              \
  |  |  |  |  |  |   77|      0|      .InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  435|       |                  // Max rounded down to the 8 byte alignment.
  436|      0|                  (std::numeric_limits<size_t>::max() & ~7) / sizeof(T))
  437|      0|        << "Requested size is too large to fit into size_t.";
  438|   114k|    if (ABSL_PREDICT_FALSE(arena == nullptr)) {
  ------------------
  |  |  190|   114k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 114k]
  |  |  |  Branch (190:49): [Folded, False: 114k]
  |  |  |  Branch (190:58): [True: 0, False: 114k]
  |  |  ------------------
  ------------------
  439|      0|      return new T[num_elements];
  440|   114k|    } else {
  441|       |      // We count on compiler to realize that if sizeof(T) is a multiple of
  442|       |      // 8 AlignUpTo can be elided.
  443|   114k|      return static_cast<T*>(
  444|   114k|          arena->AllocateAlignedForArray(sizeof(T) * num_elements, alignof(T)));
  445|   114k|    }
  446|   114k|  }

_ZN6google8protobuf8internal17ArenaAlignDefault4CeilEm:
   79|   157M|  static PROTOBUF_ALWAYS_INLINE constexpr size_t Ceil(size_t n) {
   80|   157M|    return (n + align - 1) & ~(align - 1);
   81|   157M|  }

_ZN6google8protobuf8internal16AllocationPolicy19DefaultMaxBlockSizeEv:
   30|   542k|  static size_t DefaultMaxBlockSize() {
   31|   542k|    return kCurrentDefaultMaxBlockSize;
   32|   542k|  }
_ZN6google8protobuf8internal25TaggedAllocationPolicyPtrC2Ev:
   50|  9.80k|  constexpr TaggedAllocationPolicyPtr() : policy_(0) {}
_ZN6google8protobuf8internal25TaggedAllocationPolicyPtr3getEv:
   60|  9.80k|  AllocationPolicy* get() {
   61|  9.80k|    return reinterpret_cast<AllocationPolicy*>(policy_ & kPtrMask);
   62|  9.80k|  }
_ZNK6google8protobuf8internal25TaggedAllocationPolicyPtr3getEv:
   63|   542k|  const AllocationPolicy* get() const {
   64|   542k|    return reinterpret_cast<const AllocationPolicy*>(policy_ & kPtrMask);
   65|   542k|  }
_ZNK6google8protobuf8internal25TaggedAllocationPolicyPtr27is_user_owned_initial_blockEv:
   73|  9.80k|  bool is_user_owned_initial_block() const {
   74|  9.80k|    return static_cast<bool>(get_mask<kUserOwnedInitialBlock>());
   75|  9.80k|  }
_ZNK6google8protobuf8internal25TaggedAllocationPolicyPtr8get_maskILm1EEEmv:
   91|  9.80k|  uintptr_t get_mask() const {
   92|  9.80k|    return policy_ & kMask;
   93|  9.80k|  }

_ZNK6google8protobuf8internal10LazyString4InitEv:
   58|      8|const std::string& LazyString::Init() const {
   59|      8|  static absl::Mutex mu{absl::kConstInit};
   60|      8|  mu.Lock();
   61|      8|  const std::string* res = inited_.load(std::memory_order_acquire);
   62|      8|  if (res == nullptr) {
  ------------------
  |  Branch (62:7): [True: 8, False: 0]
  ------------------
   63|      8|    auto init_value = init_value_;
   64|      8|    res = ::new (static_cast<void*>(string_buf_))
   65|      8|        std::string(init_value.ptr, init_value.size);
   66|      8|    inited_.store(res, std::memory_order_release);
   67|      8|  }
   68|      8|  mu.Unlock();
   69|      8|  return *res;
   70|      8|}
_ZN6google8protobuf8internal14ArenaStringPtr3SetENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEPNS0_5ArenaE:
  105|   119M|void ArenaStringPtr::Set(absl::string_view value, Arena* arena) {
  106|   119M|  ScopedCheckPtrInvariants check(&tagged_ptr_);
  107|   119M|  if (IsDefault()) {
  ------------------
  |  Branch (107:7): [True: 119M, False: 0]
  ------------------
  108|       |    // If we're not on an arena, skip straight to a true string to avoid
  109|       |    // possible copy cost later.
  110|   119M|    tagged_ptr_ = arena != nullptr ? CreateArenaString(*arena, value)
  ------------------
  |  Branch (110:19): [True: 119M, False: 0]
  ------------------
  111|   119M|                                   : CreateString(value);
  112|   119M|  } else {
  113|      0|    if (internal::DebugHardenForceCopyDefaultString()) {
  ------------------
  |  Branch (113:9): [Folded, False: 0]
  ------------------
  114|      0|      if (arena == nullptr) {
  ------------------
  |  Branch (114:11): [True: 0, False: 0]
  ------------------
  115|      0|        auto* old = tagged_ptr_.GetIfAllocated();
  116|      0|        tagged_ptr_ = CreateString(value);
  117|      0|        delete old;
  118|      0|      } else {
  119|      0|        auto* old = UnsafeMutablePointer();
  120|      0|        tagged_ptr_ = CreateArenaString(*arena, value);
  121|      0|        old->assign("garbagedata");
  122|      0|      }
  123|      0|    } else {
  124|      0|      UnsafeMutablePointer()->assign(value.data(), value.length());
  125|      0|    }
  126|      0|  }
  127|   119M|}
_ZN6google8protobuf8internal14ArenaStringPtr7MutableEPNS0_5ArenaE:
  169|   135M|std::string* ArenaStringPtr::Mutable(Arena* arena) {
  170|   135M|  ScopedCheckPtrInvariants check(&tagged_ptr_);
  171|   135M|  if (tagged_ptr_.IsMutable()) {
  ------------------
  |  Branch (171:7): [True: 0, False: 135M]
  ------------------
  172|      0|    return tagged_ptr_.Get();
  173|   135M|  } else {
  174|   135M|    return MutableSlow(arena);
  175|   135M|  }
  176|   135M|}
_ZN6google8protobuf8internal14ArenaStringPtr13MutableNoCopyEPNS0_5ArenaE:
  188|    596|std::string* ArenaStringPtr::MutableNoCopy(Arena* arena) {
  189|    596|  ScopedCheckPtrInvariants check(&tagged_ptr_);
  190|    596|  if (tagged_ptr_.IsMutable()) {
  ------------------
  |  Branch (190:7): [True: 0, False: 596]
  ------------------
  191|      0|    return tagged_ptr_.Get();
  192|    596|  } else {
  193|    596|    ABSL_DCHECK(IsDefault());
  ------------------
  |  |   47|    596|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|    596|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.19k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|    596|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.19k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.19k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 596, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|    596|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 596]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|    596|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 596, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.19k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.19k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  194|       |    // Allocate empty. The contents are not relevant.
  195|    596|    return NewString(arena);
  196|    596|  }
  197|    596|}
arenastring.cc:_ZN6google8protobuf8internal12_GLOBAL__N_117CreateArenaStringERNS0_5ArenaENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEE:
   85|   119M|TaggedStringPtr CreateArenaString(Arena& arena, absl::string_view s) {
   86|   119M|  TaggedStringPtr res;
   87|   119M|  res.SetMutableArena(Arena::Create<std::string>(&arena, s.data(), s.length()));
   88|   119M|  return res;
   89|   119M|}
_ZN6google8protobuf8internal24ScopedCheckPtrInvariantsC2EPKNS1_15TaggedStringPtrE:
   97|   255M|  explicit ScopedCheckPtrInvariants(const TaggedStringPtr*) {}
_ZN6google8protobuf8internal14ArenaStringPtr11MutableSlowIJEEEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEPNS0_5ArenaEDpRKT_:
  201|   135M|                                         const Lazy&... lazy_default) {
  202|   135M|  ABSL_DCHECK(IsDefault());
  ------------------
  |  |   47|   135M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   135M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   271M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   135M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   271M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   271M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 135M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   135M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 135M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   135M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 135M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   271M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   271M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  203|       |
  204|       |  // For empty defaults, this ends up calling the default constructor which is
  205|       |  // more efficient than a copy construction from
  206|       |  // GetEmptyStringAlreadyInited().
  207|   135M|  return NewString(arena, lazy_default.get()...);
  208|   135M|}

_ZNK6google8protobuf8internal14ArenaStringPtr3GetEv:
  338|   163M|  PROTOBUF_NDEBUG_INLINE const std::string& Get() const {
  339|       |    // Unconditionally mask away the tag.
  340|   163M|    return *tagged_ptr_.Get();
  341|   163M|  }
_ZNK6google8protobuf8internal15TaggedStringPtr3GetEv:
  164|   163M|  inline std::string* Get() const {
  165|   163M|    return reinterpret_cast<std::string*>(as_int() & ~kMask);
  166|   163M|  }
_ZNK6google8protobuf8internal15TaggedStringPtr6as_intEv:
  200|   418M|  uintptr_t as_int() const { return reinterpret_cast<uintptr_t>(ptr_); }
_ZNK6google8protobuf8internal14ArenaStringPtr9IsDefaultEv:
  395|   119M|  inline bool IsDefault() const { return tagged_ptr_.IsDefault(); }
_ZNK6google8protobuf8internal15TaggedStringPtr9IsDefaultEv:
  141|   119M|  inline bool IsDefault() const { return (as_int() & kMask) == kDefault; }
_ZNK6google8protobuf8internal10LazyString3getEv:
   59|     16|  const std::string& get() const {
   60|       |    // This check generates less code than a call-once invocation.
   61|     16|    auto* res = inited_.load(std::memory_order_acquire);
   62|     16|    if (ABSL_PREDICT_FALSE(res == nullptr)) return Init();
  ------------------
  |  |  190|     16|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 8, False: 8]
  |  |  |  Branch (190:49): [Folded, False: 16]
  |  |  |  Branch (190:58): [True: 8, False: 8]
  |  |  ------------------
  ------------------
   63|      8|    return *res;
   64|     16|  }
_ZN6google8protobuf8internal14ArenaStringPtr3SetEPKcmPNS0_5ArenaE:
  484|   119M|inline void ArenaStringPtr::Set(const char* s, size_t n, Arena* arena) {
  485|   119M|  Set(absl::string_view{s, n}, arena);
  486|   119M|}
_ZN6google8protobuf8internal15TaggedStringPtrC2EPKNS1_26GlobalEmptyStringConstexprE:
  108|   314M|      : ptr_(const_cast<void*>(static_cast<const void*>(ptr))) {}
_ZN6google8protobuf8internal15TaggedStringPtr12SetAllocatedEPNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE:
  119|    596|  inline std::string* SetAllocated(std::string* p) {
  120|    596|    return TagAs(kAllocated, p);
  121|    596|  }
_ZN6google8protobuf8internal15TaggedStringPtr15SetMutableArenaEPNSt3__112basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEE:
  133|   255M|  inline std::string* SetMutableArena(std::string* p) {
  134|   255M|    return TagAs(kMutableArena, p);
  135|   255M|  }
_ZNK6google8protobuf8internal15TaggedStringPtr9IsMutableEv:
  138|   135M|  inline bool IsMutable() const { return as_int() & kMutableBit; }
_ZN6google8protobuf8internal15TaggedStringPtr14assert_alignedEPKv:
  183|   255M|  static inline void assert_aligned(const void* p) {
  184|   255M|    static_assert(kMask <= alignof(void*), "Pointer underaligned for bit mask");
  185|   255M|    static_assert(kMask <= alignof(std::string),
  186|   255M|                  "std::string underaligned for bit mask");
  187|   255M|    ABSL_DCHECK_EQ(reinterpret_cast<uintptr_t>(p) & kMask, 0UL);
  ------------------
  |  |   74|   255M|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   255M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   255M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 255M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   255M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  188|   255M|  }
_ZN6google8protobuf8internal15TaggedStringPtr5TagAsENS2_4TypeEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEE:
  193|   255M|  inline std::string* TagAs(Type type, std::string* p) {
  194|   255M|    ABSL_DCHECK(p != nullptr);
  ------------------
  |  |   47|   255M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   255M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   510M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   255M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   510M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   510M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 255M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   255M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 255M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   255M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 255M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   510M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   510M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  195|   255M|    assert_aligned(p);
  196|   255M|    ptr_ = reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(p) | type);
  197|   255M|    return p;
  198|   255M|  }
_ZN6google8protobuf8internal14ArenaStringPtrC2EPNS0_5ArenaE:
  243|   314M|      : tagged_ptr_(&fixed_address_empty_string) {
  244|   314M|    if (DebugHardenForceCopyDefaultString()) {
  ------------------
  |  Branch (244:9): [Folded, False: 314M]
  ------------------
  245|      0|      Set(absl::string_view(""), arena);
  246|      0|    }
  247|   314M|  }
_ZN6google8protobuf8internal14ArenaStringPtr9NewStringIJEEEPNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEPNS0_5ArenaEDpOT_:
  399|   135M|  inline std::string* NewString(Arena* arena, Args&&... args) {
  400|   135M|    if (arena == nullptr) {
  ------------------
  |  Branch (400:9): [True: 596, False: 135M]
  ------------------
  401|    596|      auto* s = new std::string(std::forward<Args>(args)...);
  402|    596|      return tagged_ptr_.SetAllocated(s);
  403|   135M|    } else {
  404|   135M|      auto* s = Arena::Create<std::string>(arena, std::forward<Args>(args)...);
  405|   135M|      return tagged_ptr_.SetMutableArena(s);
  406|   135M|    }
  407|   135M|  }

_ZN6google8protobuf8internal20ThreadSafeArenaStats19RecordAllocateStatsEPS2_mmm:
  169|   551k|                                  size_t /*allocated*/, size_t /*wasted*/) {}
_ZN6google8protobuf8internal26ThreadSafeArenaStatsHandleC2EPNS1_20ThreadSafeArenaStatsE:
  178|  9.80k|  explicit ThreadSafeArenaStatsHandle(ThreadSafeArenaStats*) {}
_ZN6google8protobuf8internal26ThreadSafeArenaStatsHandle12MutableStatsEv:
  182|   551k|  ThreadSafeArenaStats* MutableStats() { return nullptr; }
_ZN6google8protobuf8internal6SampleEv:
  198|  9.80k|[[nodiscard]] inline ThreadSafeArenaStatsHandle Sample() {
  199|  9.80k|  return ThreadSafeArenaStatsHandle(nullptr);
  200|  9.80k|}

_ZNK6google8protobuf8internal14MessageCreator3tagEv:
   98|    600|  Tag tag() const { return tag_; }
_ZNK6google8protobuf8internal9ClassData16default_instanceEv:
  203|  1.19k|  const MessageLite* default_instance() const { return prototype; }
_ZNK6google8protobuf8internal13ClassDataLite4baseEv:
  227|    600|  constexpr const ClassData* base() const { return this; }
_ZNK6google8protobuf8internal14MessageCreator15AllocateMessageINS0_5ArenaEEEPvPT_:
   90|    600|  void* AllocateMessage(Arena* arena) const {
   91|    600|    if (arena != nullptr) {
  ------------------
  |  Branch (91:9): [True: 0, False: 600]
  ------------------
   92|      0|      return arena->AllocateAligned(allocation_size_);
   93|    600|    } else {
   94|    600|      return Allocate(allocation_size_);
   95|    600|    }
   96|    600|  }

_ZN6google8protobuf8internal13little_endian6ToHostEt:
  100|  1.72k|inline uint16_t ToHost(uint16_t value) {
  101|       |#if defined(ABSL_IS_BIG_ENDIAN)
  102|       |  return BSwap16(value);
  103|       |#else
  104|  1.72k|  return value;
  105|  1.72k|#endif
  106|  1.72k|}
_ZN6google8protobuf8internal13little_endian6ToHostEj:
  109|    596|inline uint32_t ToHost(uint32_t value) {
  110|       |#if defined(ABSL_IS_BIG_ENDIAN)
  111|       |  return BSwap32(value);
  112|       |#else
  113|    596|  return value;
  114|    596|#endif
  115|    596|}

_ZN6google8protobuf8internal12ExtensionSet5ClearEv:
  762|  5.20k|void ExtensionSet::Clear() {
  763|  5.20k|  ForEach([](int /* number */, Extension& ext) { ext.Clear(); }, Prefetch{});
  764|  5.20k|}
_ZNK6google8protobuf8internal12ExtensionSet13IsInitializedEPNS0_5ArenaEPKNS0_11MessageLiteE:
 1111|    602|                                 const MessageLite* extendee) const {
 1112|       |  // Extensions are never required.  However, we need to check that all
 1113|       |  // embedded messages are initialized.
 1114|    602|  if (ABSL_PREDICT_FALSE(is_large())) {
  ------------------
  |  |  190|    602|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 602]
  |  |  |  Branch (190:49): [Folded, False: 602]
  |  |  |  Branch (190:58): [True: 0, False: 602]
  |  |  ------------------
  ------------------
 1115|      0|    for (const auto& kv : *map_.large) {
  ------------------
  |  Branch (1115:25): [True: 0, False: 0]
  ------------------
 1116|      0|      if (!kv.second.IsInitialized(this, extendee, kv.first, arena)) {
  ------------------
  |  Branch (1116:11): [True: 0, False: 0]
  ------------------
 1117|      0|        return false;
 1118|      0|      }
 1119|      0|    }
 1120|      0|    return true;
 1121|      0|  }
 1122|    602|  for (const KeyValue* it = flat_begin(); it != flat_end(); ++it) {
  ------------------
  |  Branch (1122:43): [True: 0, False: 602]
  ------------------
 1123|      0|    if (!it->second.IsInitialized(this, extendee, it->first, arena)) {
  ------------------
  |  Branch (1123:9): [True: 0, False: 0]
  ------------------
 1124|      0|      return false;
 1125|      0|    }
 1126|      0|  }
 1127|    602|  return true;
 1128|    602|}

_ZNK6google8protobuf8internal12ExtensionSet8is_largeEv:
  914|  5.80k|  bool is_large() const { return static_cast<int16_t>(flat_size_) < 0; }
_ZN6google8protobuf8internal12ExtensionSet10flat_beginEv:
 1210|  5.20k|  KeyValue* flat_begin() {
 1211|       |    assert(!is_large());
 1212|  5.20k|    return map_.flat;
 1213|  5.20k|  }
_ZNK6google8protobuf8internal12ExtensionSet10flat_beginEv:
 1214|    602|  const KeyValue* flat_begin() const {
 1215|       |    assert(!is_large());
 1216|    602|    return map_.flat;
 1217|    602|  }
_ZN6google8protobuf8internal12ExtensionSet8flat_endEv:
 1218|  5.20k|  KeyValue* flat_end() {
 1219|       |    assert(!is_large());
 1220|  5.20k|    return map_.flat + flat_size_;
 1221|  5.20k|  }
_ZNK6google8protobuf8internal12ExtensionSet8flat_endEv:
 1222|    602|  const KeyValue* flat_end() const {
 1223|       |    assert(!is_large());
 1224|    602|    return map_.flat + flat_size_;
 1225|    602|  }
_ZN6google8protobuf8internal12ExtensionSetC2Ev:
  265|   157M|  constexpr ExtensionSet() = default;
extension_set.cc:_ZN6google8protobuf8internal12ExtensionSet7ForEachIZNS2_5ClearEvE3$_0NS2_8PrefetchEEEvT_T0_:
  964|  5.20k|  void ForEach(KeyValueFunctor func, PrefetchFunctor prefetch_func) {
  965|  5.20k|    if (ABSL_PREDICT_FALSE(is_large())) {
  ------------------
  |  |  190|  5.20k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 5.20k]
  |  |  |  Branch (190:49): [Folded, False: 5.20k]
  |  |  |  Branch (190:58): [True: 0, False: 5.20k]
  |  |  ------------------
  ------------------
  966|      0|      ForEachPrefetchImpl(map_.large->begin(), map_.large->end(),
  967|      0|                          std::move(func), std::move(prefetch_func));
  968|      0|      return;
  969|      0|    }
  970|  5.20k|    ForEachPrefetchImpl(flat_begin(), flat_end(), std::move(func),
  971|  5.20k|                        std::move(prefetch_func));
  972|  5.20k|  }
extension_set.cc:_ZN6google8protobuf8internal12ExtensionSet19ForEachPrefetchImplIPNS2_8KeyValueEZNS2_5ClearEvE3$_0NS2_8PrefetchEEEvT_S8_T0_T1_:
  939|  5.20k|                                  PrefetchFunctor prefetch_func) {
  940|       |    // Note: based on arena's ChunkList::Cleanup().
  941|       |    // Prefetch distance 16 performs better than 8 in load tests.
  942|  5.20k|    constexpr int kPrefetchDistance = 16;
  943|  5.20k|    Iterator prefetch = it;
  944|       |    // Prefetch the first kPrefetchDistance extensions.
  945|  5.20k|    for (int i = 0; prefetch != end && i < kPrefetchDistance; ++prefetch, ++i) {
  ------------------
  |  Branch (945:21): [True: 0, False: 5.20k]
  |  Branch (945:40): [True: 0, False: 0]
  ------------------
  946|      0|      prefetch_func(prefetch->second.PrefetchPtr());
  947|      0|    }
  948|       |    // For the middle extensions, call func and then prefetch the extension
  949|       |    // kPrefetchDistance after the current one.
  950|  5.20k|    for (; prefetch != end; ++it, ++prefetch) {
  ------------------
  |  Branch (950:12): [True: 0, False: 5.20k]
  ------------------
  951|      0|      func(it->first, it->second);
  952|      0|      prefetch_func(prefetch->second.PrefetchPtr());
  953|      0|    }
  954|       |    // Call func on the rest without prefetching.
  955|  5.20k|    for (; it != end; ++it) func(it->first, it->second);
  ------------------
  |  Branch (955:12): [True: 0, False: 5.20k]
  ------------------
  956|  5.20k|  }

_ZN6google8protobuf8internal11TcFieldDataC2ENS2_11DefaultInitE:
   64|  4.05k|  TcFieldData(DefaultInit) {}  // NOLINT(google-explicit-constructor)
_ZNK6google8protobuf8internal11TcFieldData10hasbit_idxEv:
   85|  1.72k|  uint8_t hasbit_idx() const { return static_cast<uint8_t>(data >> 16); }
_ZNK6google8protobuf8internal11TcFieldData7aux_idxEv:
   86|    526|  uint8_t aux_idx() const { return static_cast<uint8_t>(data >> 24); }
_ZNK6google8protobuf8internal11TcFieldData6offsetEv:
   87|  1.72k|  uint16_t offset() const { return static_cast<uint16_t>(data >> 48); }
_ZNK6google8protobuf8internal11TcFieldData3tagEv:
  145|      2|  uint32_t tag() const { return static_cast<uint32_t>(data); }
_ZNK6google8protobuf8internal11TcFieldData12entry_offsetEv:
  146|      2|  uint32_t entry_offset() const { return static_cast<uint32_t>(data >> 32); }
_ZNK6google8protobuf8internal16TcParseTableBase14FastFieldEntry6targetEv:
  376|  1.72k|    TailCallParseFunc target() const { return target_function; }
_ZNK6google8protobuf8internal16TcParseTableBase10fast_entryEm:
  379|  1.72k|  const FastFieldEntry* fast_entry(size_t idx) const {
  380|  1.72k|    return reinterpret_cast<const FastFieldEntry*>(this + 1) + idx;
  381|  1.72k|  }
_ZNK6google8protobuf8internal16TcParseTableBase18field_lookup_beginEv:
  421|      2|  const uint16_t* field_lookup_begin() const {
  422|      2|    return reinterpret_cast<const uint16_t*>(reinterpret_cast<uintptr_t>(this) +
  423|      2|                                             lookup_table_offset);
  424|      2|  }
_ZNK6google8protobuf8internal16TcParseTableBase19field_entries_beginEv:
  441|      2|  const FieldEntry* field_entries_begin() const {
  442|      2|    return reinterpret_cast<const FieldEntry*>(
  443|      2|        reinterpret_cast<uintptr_t>(this) + field_entries_offset);
  444|      2|  }
_ZNK6google8protobuf8internal16TcParseTableBase8FieldAux9table_ptrEv:
  492|      6|    const TcParseTableBase* table_ptr() const {
  493|      6|#ifndef PROTOBUF_MESSAGE_GLOBALS
  494|      6|      return table;
  495|       |#else
  496|       |      return MessageGlobalsBase::ToParseTableBase(message_globals_p);
  497|       |#endif
  498|      6|    }
_ZNK6google8protobuf8internal16TcParseTableBase9field_auxEj:
  500|      6|  const FieldAux* field_aux(uint32_t idx) const {
  501|      6|    return reinterpret_cast<const FieldAux*>(reinterpret_cast<uintptr_t>(this) +
  502|      6|                                             aux_offset) +
  503|      6|           idx;
  504|      6|  }
_ZNK6google8protobuf8internal11TcFieldData9coded_tagIhEET_v:
   82|  1.72k|  TagType coded_tag() const {
   83|  1.72k|    return static_cast<TagType>(data);
   84|  1.72k|  }
_ZNK6google8protobuf8internal11TcFieldData9coded_tagItEET_v:
   82|      8|  TagType coded_tag() const {
   83|      8|    return static_cast<TagType>(data);
   84|      8|  }

_ZN6google8protobuf8internal8TcParser11SyncHasbitsEPNS0_11MessageLiteEmPKNS1_16TcParseTableBaseE:
  924|    604|      MessageLite* msg, uint64_t hasbits, const TcParseTableBase* table) {
  925|    604|    const uint32_t has_bits_offset = table->has_bits_offset;
  926|       |    if constexpr (internal::PerformDebugChecks()) {
  927|       |      // We always have some offset to write to.
  928|       |      ABSL_DCHECK_NE(has_bits_offset, 0u);
  929|       |      // and if we actually have has bits to push, we should be pushing to a
  930|       |      // real HasBits.
  931|       |      // `has_bits_offset` points to `_cached_size_` when we have
  932|       |      // no has bits, just to point somewhere and avoid a branch here.
  933|       |      // In that case we would be doing `|= 0` so the target just need to be
  934|       |      // some valid space in the message.
  935|       |      if (static_cast<uint32_t>(hasbits) != 0) {
  936|       |        ABSL_DCHECK_NE(has_bits_offset, table->class_data->cached_size_offset);
  937|       |      }
  938|       |    }
  939|       |    // Only the first 32 has-bits are updated. Nothing above those is stored,
  940|       |    // but e.g. messages without has-bits update the upper bits.
  941|    604|    RefAt<uint32_t>(msg, has_bits_offset) |= static_cast<uint32_t>(hasbits);
  942|    604|  }
_ZN6google8protobuf8internal8TcParser11TagDispatchEPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1142|  1.72k|    PROTOBUF_TC_PARAM_NO_DATA_DECL) {
 1143|  1.72k|  const auto coded_tag = UnalignedLoad<uint16_t>(ptr);
 1144|  1.72k|  const size_t idx = coded_tag & table->fast_idx_mask;
 1145|  1.72k|  PROTOBUF_ASSUME((idx & 7) == 0);
  ------------------
  |  |  733|  1.72k|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
 1146|  1.72k|  auto* fast_entry = table->fast_entry(idx >> 3);
 1147|  1.72k|  TcFieldData data = fast_entry->bits;
 1148|  1.72k|  data.data ^= coded_tag;
 1149|  1.72k|  PROTOBUF_MUSTTAIL return fast_entry->target()(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|  1.72k|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return fast_entry->target()(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|  1.72k|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 1150|  1.72k|}
_ZN6google8protobuf8internal8TcParser13ToTagDispatchEPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1158|  1.72k|    PROTOBUF_TC_PARAM_NO_DATA_DECL) {
 1159|  1.72k|  constexpr bool always_return = !PROTOBUF_TAILCALL;
  ------------------
  |  |  234|  1.72k|#define PROTOBUF_TAILCALL true
  ------------------
 1160|  1.72k|  if (always_return || !ctx->DataAvailable(ptr)) {
  ------------------
  |  Branch (1160:7): [Folded, False: 1.72k]
  |  Branch (1160:24): [True: 600, False: 1.12k]
  ------------------
 1161|    600|    PROTOBUF_MUSTTAIL return ToParseLoop(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|    600|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return ToParseLoop(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|    600|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1162|    600|  }
 1163|  1.12k|  PROTOBUF_MUSTTAIL return TagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|  1.12k|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return TagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|  1.12k|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1164|  1.72k|}
_ZN6google8protobuf8internal8TcParser11ToParseLoopEPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1167|    600|    PROTOBUF_TC_PARAM_NO_DATA_DECL) {
 1168|    600|  (void)ctx;
 1169|    600|  SyncHasbits(msg, hasbits, table);
 1170|    600|  return ptr;
 1171|    600|}
_ZN6google8protobuf8internal8TcParser9ParseLoopEPNS0_11MessageLiteEPKcPNS1_12ParseContextEPKNS1_16TcParseTableBaseE:
 1175|    602|    const TcParseTableBase* table) {
 1176|       |  // Note: TagDispatch uses a dispatch table at "&table->fast_entries".
 1177|       |  // For fast dispatch, we'd like to have a pointer to that, but if we use
 1178|       |  // that expression, there's no easy way to get back to "table", which we also
 1179|       |  // need during dispatch.  It turns out that "table + 1" points exactly to
 1180|       |  // fast_entries, so we just increment table by 1 here, to get the register
 1181|       |  // holding the value we want.
 1182|    602|  table += 1;
 1183|  1.20k|  while (!ctx->Done(&ptr)) {
  ------------------
  |  Branch (1183:10): [True: 604, False: 602]
  ------------------
 1184|    604|#if defined(__GNUC__)
 1185|       |    // Note: this asm prevents the compiler (clang, specifically) from
 1186|       |    // believing (thanks to CSE) that it needs to dedicate a register both
 1187|       |    // to "table" and "&table->fast_entries".
 1188|       |    // TODO: remove this asm
 1189|    604|    asm("" : "+r"(table));
 1190|    604|#endif
 1191|    604|    ptr = TagDispatch(msg, ptr, ctx, TcFieldData::DefaultInit(), table - 1, 0);
 1192|    604|    if (ptr == nullptr) break;
  ------------------
  |  Branch (1192:9): [True: 0, False: 604]
  ------------------
 1193|    604|    if (ctx->LastTag() != 1) break;  // Ended on terminating tag
  ------------------
  |  Branch (1193:9): [True: 0, False: 604]
  ------------------
 1194|    604|  }
 1195|    602|  table -= 1;
 1196|    602|  if (ABSL_PREDICT_FALSE(table->has_post_loop_handler)) {
  ------------------
  |  |  190|    602|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 602]
  |  |  |  Branch (190:49): [Folded, False: 602]
  |  |  |  Branch (190:58): [True: 0, False: 602]
  |  |  ------------------
  ------------------
 1197|      0|    return table->post_loop_handler(msg, ptr, ctx);
 1198|      0|  }
 1199|    602|  if (ABSL_PREDICT_FALSE(PerformDebugChecks() && ptr == nullptr)) {
  ------------------
  |  |  190|    602|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [Folded, False: 602]
  |  |  |  Branch (190:49): [Folded, False: 0]
  |  |  |  Branch (190:59): [Folded, False: 0]
  |  |  |  Branch (190:59): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 1200|      0|    CheckHasBitConsistency(msg, table);
 1201|      0|  }
 1202|    602|  return ptr;
 1203|    602|}
_ZN6google8protobuf8internal8TcParser5RefAtIjEERT_Pvm:
  727|  1.20k|  static inline T& RefAt(void* x, size_t offset) {
  728|  1.20k|    T* target = reinterpret_cast<T*>(static_cast<char*>(x) + offset);
  729|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  730|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  731|       |    // not respect the alignment as expressed by `alignof(T)`
  732|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  733|       |                           0)) {
  734|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  735|       |                reinterpret_cast<uintptr_t>(target));
  736|       |    }
  737|       |#endif
  738|  1.20k|    return *target;
  739|  1.20k|  }
_ZN6google8protobuf8internal8TcParser5RefAtINS1_16TcParseTableBase10FieldEntryEEERKT_PKvm:
  742|      2|  static inline const T& RefAt(const void* x, size_t offset) {
  743|      2|    const T* target =
  744|      2|        reinterpret_cast<const T*>(static_cast<const char*>(x) + offset);
  745|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  746|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  747|       |    // not respect the alignment as expressed by `alignof(T)`
  748|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  749|       |                           0)) {
  750|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  751|       |                reinterpret_cast<uintptr_t>(target));
  752|       |    }
  753|       |#endif
  754|      2|    return *target;
  755|      2|  }
_ZN6google8protobuf8internal8TcParser5RefAtINS1_20RepeatedPtrFieldBaseEEERT_Pvm:
  727|      2|  static inline T& RefAt(void* x, size_t offset) {
  728|      2|    T* target = reinterpret_cast<T*>(static_cast<char*>(x) + offset);
  729|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  730|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  731|       |    // not respect the alignment as expressed by `alignof(T)`
  732|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  733|       |                           0)) {
  734|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  735|       |                reinterpret_cast<uintptr_t>(target));
  736|       |    }
  737|       |#endif
  738|      2|    return *target;
  739|      2|  }
_ZN6google8protobuf8internal8TcParser5RefAtIbEERT_Pvm:
  727|      8|  static inline T& RefAt(void* x, size_t offset) {
  728|      8|    T* target = reinterpret_cast<T*>(static_cast<char*>(x) + offset);
  729|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  730|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  731|       |    // not respect the alignment as expressed by `alignof(T)`
  732|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  733|       |                           0)) {
  734|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  735|       |                reinterpret_cast<uintptr_t>(target));
  736|       |    }
  737|       |#endif
  738|      8|    return *target;
  739|      8|  }
_ZN6google8protobuf8internal8TcParser5RefAtIiEERT_Pvm:
  727|    520|  static inline T& RefAt(void* x, size_t offset) {
  728|    520|    T* target = reinterpret_cast<T*>(static_cast<char*>(x) + offset);
  729|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  730|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  731|       |    // not respect the alignment as expressed by `alignof(T)`
  732|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  733|       |                           0)) {
  734|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  735|       |                reinterpret_cast<uintptr_t>(target));
  736|       |    }
  737|       |#endif
  738|    520|    return *target;
  739|    520|  }
_ZN6google8protobuf8internal8TcParser5RefAtINS1_14ArenaStringPtrEEERT_Pvm:
  727|    596|  static inline T& RefAt(void* x, size_t offset) {
  728|    596|    T* target = reinterpret_cast<T*>(static_cast<char*>(x) + offset);
  729|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  730|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  731|       |    // not respect the alignment as expressed by `alignof(T)`
  732|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  733|       |                           0)) {
  734|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  735|       |                reinterpret_cast<uintptr_t>(target));
  736|       |    }
  737|       |#endif
  738|    596|    return *target;
  739|    596|  }
_ZN6google8protobuf8internal8TcParser5RefAtIPNS0_11MessageLiteEEERT_Pvm:
  727|      4|  static inline T& RefAt(void* x, size_t offset) {
  728|      4|    T* target = reinterpret_cast<T*>(static_cast<char*>(x) + offset);
  729|       |#if !defined(NDEBUG) && !(defined(_MSC_VER) && defined(_M_IX86))
  730|       |    // Check the alignment in debug mode, except in 32-bit msvc because it does
  731|       |    // not respect the alignment as expressed by `alignof(T)`
  732|       |    if (ABSL_PREDICT_FALSE(reinterpret_cast<uintptr_t>(target) % alignof(T) !=
  733|       |                           0)) {
  734|       |      AlignFail(std::integral_constant<size_t, alignof(T)>(),
  735|       |                reinterpret_cast<uintptr_t>(target));
  736|       |    }
  737|       |#endif
  738|      4|    return *target;
  739|      4|  }

_ZN6google8protobuf8internal8TcParser14FindFieldEntryEPKNS1_16TcParseTableBaseEj:
  357|      2|    const TcParseTableBase* table, uint32_t field_num) {
  358|      2|  const FieldEntry* const field_entries = table->field_entries_begin();
  359|       |
  360|      2|  uint32_t fstart = 1;
  361|      2|  uint32_t adj_fnum = field_num - fstart;
  362|       |
  363|      2|  if (ABSL_PREDICT_TRUE(adj_fnum < 32)) {
  ------------------
  |  |  191|      2|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 0, False: 2]
  |  |  |  Branch (191:48): [Folded, False: 2]
  |  |  |  Branch (191:57): [True: 0, False: 2]
  |  |  ------------------
  ------------------
  364|      0|    uint32_t skipmap = table->skipmap32;
  365|      0|    uint32_t skipbit = 1 << adj_fnum;
  366|      0|    if (ABSL_PREDICT_FALSE(skipmap & skipbit)) 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]
  |  |  ------------------
  ------------------
  367|      0|    skipmap &= skipbit - 1;
  368|      0|    adj_fnum -= absl::popcount(skipmap);
  369|      0|    auto* entry = field_entries + adj_fnum;
  370|      0|    PROTOBUF_ASSUME(entry != nullptr);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  371|      0|    return entry;
  372|      0|  }
  373|      2|  const uint16_t* lookup_table = table->field_lookup_begin();
  374|      2|  for (;;) {
  375|      2|#ifdef ABSL_IS_LITTLE_ENDIAN
  376|      2|    memcpy(&fstart, lookup_table, sizeof(fstart));
  377|       |#else
  378|       |    fstart = lookup_table[0] | (lookup_table[1] << 16);
  379|       |#endif
  380|      2|    lookup_table += sizeof(fstart) / sizeof(*lookup_table);
  381|      2|    uint32_t num_skip_entries = *lookup_table++;
  382|      2|    if (field_num < fstart) return nullptr;
  ------------------
  |  Branch (382:9): [True: 0, False: 2]
  ------------------
  383|      2|    adj_fnum = field_num - fstart;
  384|      2|    uint32_t skip_num = adj_fnum / 16;
  385|      2|    if (ABSL_PREDICT_TRUE(skip_num < num_skip_entries)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  386|       |      // for each group of 16 fields we have:
  387|       |      // a bitmap of 16 bits
  388|       |      // a 16-bit field-entry offset for the first of them.
  389|      2|      auto* skip_data = lookup_table + (adj_fnum / 16) * (sizeof(SkipEntry16) /
  390|      2|                                                          sizeof(uint16_t));
  391|      2|      SkipEntry16 se = {skip_data[0], skip_data[1]};
  392|      2|      adj_fnum &= 15;
  393|      2|      uint32_t skipmap = se.skipmap;
  394|      2|      uint16_t skipbit = 1 << adj_fnum;
  395|      2|      if (ABSL_PREDICT_FALSE(skipmap & skipbit)) return nullptr;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  396|      2|      skipmap &= skipbit - 1;
  397|      2|      adj_fnum += se.field_entry_offset;
  398|      2|      adj_fnum -= absl::popcount(skipmap);
  399|      2|      auto* entry = field_entries + adj_fnum;
  400|      2|      PROTOBUF_ASSUME(entry != nullptr);
  ------------------
  |  |  733|      2|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  401|      2|      return entry;
  402|      2|    }
  403|      0|    lookup_table +=
  404|      0|        num_skip_entries * (sizeof(SkipEntry16) / sizeof(*lookup_table));
  405|      0|  }
  406|      2|}
_ZN6google8protobuf8internal8TcParser9MiniParseEPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  592|      2|    PROTOBUF_TC_PARAM_NO_DATA_DECL) {
  593|      2|  PROTOBUF_MUSTTAIL return MiniParse<false>(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return MiniParse<false>(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      2|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  594|      2|}
_ZN6google8protobuf8internal8TcParser10AddMessageEPKNS1_9ClassDataERNS1_20RepeatedPtrFieldBaseEPNS0_5ArenaE:
  634|    596|                                  RepeatedPtrFieldBase& field, Arena* arena) {
  635|    596|  return field.AddFromPrototype<GenericTypeHandler<MessageLite>>(
  636|    596|      arena, class_data->default_instance());
  637|    596|}
_ZN6google8protobuf8internal8TcParser8FastMtS1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  738|      4|PROTOBUF_NOINLINE const char* TcParser::FastMtS1(PROTOBUF_TC_PARAM_DECL) {
  739|      4|  PROTOBUF_MUSTTAIL return SingularParseMessageAuxImpl<uint8_t, false, true>(
  ------------------
  |  |  233|      4|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
  740|      4|      PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      4|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
  741|      4|}
_ZN6google8protobuf8internal8TcParser8FastMtR1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  829|      2|PROTOBUF_NOINLINE const char* TcParser::FastMtR1(PROTOBUF_TC_PARAM_DECL) {
  830|      2|  PROTOBUF_MUSTTAIL return RepeatedParseMessageAuxImpl<uint8_t, false, true>(
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
  831|      2|      PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      2|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
  832|      2|}
_ZN6google8protobuf8internal8TcParser9FastF32S1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  866|    596|PROTOBUF_NOINLINE const char* TcParser::FastF32S1(PROTOBUF_TC_PARAM_DECL) {
  867|    596|  PROTOBUF_MUSTTAIL return SingularFixed<uint32_t, uint8_t>(
  ------------------
  |  |  233|    596|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
  868|    596|      PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|    596|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
  869|    596|}
_ZN6google8protobuf8internal8TcParser8FastV8S1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1131|      6|PROTOBUF_NOINLINE const char* TcParser::FastV8S1(PROTOBUF_TC_PARAM_DECL) {
 1132|      6|  using TagType = uint8_t;
 1133|       |
 1134|       |  // Special case for a varint bool field with a tag of 1 byte:
 1135|       |  // The coded_tag() field will actually contain the value too and we can check
 1136|       |  // both at the same time.
 1137|      6|  auto coded_tag = data.coded_tag<uint16_t>();
 1138|      6|  if (ABSL_PREDICT_TRUE(coded_tag == 0x0000 || coded_tag == 0x0100)) {
  ------------------
  |  |  191|     12|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 6, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 6]
  |  |  |  Branch (191:58): [True: 0, False: 6]
  |  |  |  Branch (191:58): [True: 6, False: 0]
  |  |  ------------------
  ------------------
 1139|      6|    auto& field = RefAt<bool>(msg, data.offset());
 1140|       |    // Note: we use `data.data` because Clang generates suboptimal code when
 1141|       |    // using coded_tag.
 1142|       |    // In x86_64 this uses the CH register to read the second byte out of
 1143|       |    // `data`.
 1144|      6|    uint8_t value = data.data >> 8;
 1145|       |    // The assume allows using a mov instead of test+setne.
 1146|      6|    PROTOBUF_ASSUME(value <= 1);
  ------------------
  |  |  733|      6|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
 1147|      6|    field = static_cast<bool>(value);
 1148|       |
 1149|      6|    ptr += sizeof(TagType) + 1;  // Consume the tag and the value.
 1150|      6|    SetCachedHasBit(hasbits, data.hasbit_idx());
 1151|       |
 1152|      6|    PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      6|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      6|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1153|      6|  }
 1154|       |
 1155|       |  // If it didn't match above either the tag is wrong, or the value is encoded
 1156|       |  // non-canonically.
 1157|       |  // Jump to MiniParse as wrong tag is the most probable reason.
 1158|      0|  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1159|      6|}
_ZN6google8protobuf8internal8TcParser8FastV8S2EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1161|      2|PROTOBUF_NOINLINE const char* TcParser::FastV8S2(PROTOBUF_TC_PARAM_DECL) {
 1162|      2|  PROTOBUF_MUSTTAIL return SingularVarint<bool, uint16_t>(
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
 1163|      2|      PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      2|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 1164|      2|}
_ZN6google8protobuf8internal8TcParser9FastV32S1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1165|      2|PROTOBUF_NOINLINE const char* TcParser::FastV32S1(PROTOBUF_TC_PARAM_DECL) {
 1166|      2|  PROTOBUF_MUSTTAIL return FastVarintS1<uint32_t>(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return FastVarintS1<uint32_t>(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      2|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 1167|      2|}
_ZN6google8protobuf8internal8TcParser9FastEr1S1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1610|    520|PROTOBUF_NOINLINE const char* TcParser::FastEr1S1(PROTOBUF_TC_PARAM_DECL) {
 1611|    520|  PROTOBUF_MUSTTAIL return SingularEnumSmallRange<uint8_t, 1>(
  ------------------
  |  |  233|    520|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
 1612|    520|      PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|    520|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 1613|    520|}
_ZN6google8protobuf8internal8TcParser7FastBS1EPNS0_11MessageLiteEPKcPNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1849|    596|PROTOBUF_NOINLINE const char* TcParser::FastBS1(PROTOBUF_TC_PARAM_DECL) {
 1850|    596|  PROTOBUF_MUSTTAIL return SingularString<uint8_t, ArenaStringPtr, kNoUtf8>(
  ------------------
  |  |  233|    596|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
 1851|    596|      PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|    596|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 1852|    596|}
_ZN6google8protobuf8internal8TcParser17MaybeGetSplitBaseEPNS0_11MessageLiteEbPKNS1_16TcParseTableBaseE:
 2141|      2|                                  const TcParseTableBase* table) {
 2142|      2|  void* out = msg;
 2143|      2|  if (is_split) {
  ------------------
  |  Branch (2143:7): [True: 0, False: 2]
  ------------------
 2144|      0|    const uint32_t split_offset = GetSplitOffset(table);
 2145|      0|    void* default_split =
 2146|      0|        TcParser::RefAt<void*>(table->default_instance(), split_offset);
 2147|      0|    void*& split = TcParser::RefAt<void*>(msg, split_offset);
 2148|      0|    if (split == default_split) {
  ------------------
  |  Branch (2148:9): [True: 0, False: 0]
  ------------------
 2149|       |      // Allocate split instance when needed.
 2150|      0|      uint32_t size = GetSizeofSplit(table);
 2151|      0|      Arena* arena = msg->GetArena();
 2152|      0|      split =
 2153|      0|          (arena == nullptr) ? Allocate(size) : arena->AllocateAligned(size);
  ------------------
  |  Branch (2153:11): [True: 0, False: 0]
  ------------------
 2154|      0|      memcpy(split, default_split, size);
 2155|      0|    }
 2156|      0|    out = split;
 2157|      0|  }
 2158|      2|  return out;
 2159|      2|}
generated_message_tctable_lite.cc:_ZN6google8protobuf8internal12_GLOBAL__N_115SetCachedHasBitERmh:
   89|  1.72k|                                            uint8_t hasbit_idx) {
   90|  1.72k|  cached_hasbits |= uint64_t{1} << hasbit_idx;
   91|  1.72k|}
_ZN6google8protobuf8internal8TcParser10NewMessageEPKNS1_9ClassDataEPNS0_5ArenaE:
  629|      4|    const ClassData* class_data, Arena* arena) {
  630|      4|  return class_data->New(arena);
  631|      4|}
_ZN6google8protobuf8internal8TcParser8MpVarintILb0EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 2300|      2|PROTOBUF_NOINLINE const char* TcParser::MpVarint(PROTOBUF_TC_PARAM_DECL) {
 2301|      2|  const auto& entry = RefAt<FieldEntry>(table, data.entry_offset());
 2302|      2|  const uint16_t type_card = entry.type_card;
 2303|      2|  const uint16_t card = type_card & field_layout::kFcMask;
 2304|       |
 2305|       |  // Check for repeated parsing:
 2306|      2|  if (card == field_layout::kFcRepeated) {
  ------------------
  |  Branch (2306:7): [True: 0, False: 2]
  ------------------
 2307|      0|    PROTOBUF_MUSTTAIL return MpRepeatedVarint<is_split>(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MpRepeatedVarint<is_split>(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      0|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 2308|      0|  }
 2309|       |  // Check for wire type mismatch:
 2310|      2|  if ((data.tag() & 7) != WireFormatLite::WIRETYPE_VARINT) {
  ------------------
  |  Branch (2310:7): [True: 0, False: 2]
  ------------------
 2311|      0|    PROTOBUF_MUSTTAIL return table->fallback(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return table->fallback(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      0|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 2312|      0|  }
 2313|      2|  const uint16_t xform_val = type_card & field_layout::kTvMask;
 2314|      2|  const bool is_zigzag = xform_val == field_layout::kTvZigZag;
 2315|      2|  const bool is_validated_enum = xform_val & field_layout::kTvEnum;
 2316|       |
 2317|       |  // Parse the value:
 2318|      2|  const char* ptr2 = ptr;  // save for unknown enum case
 2319|      2|  uint64_t tmp;
 2320|      2|  ptr = ParseVarint(ptr, &tmp);
 2321|      2|  if (ptr == nullptr) {
  ------------------
  |  Branch (2321:7): [True: 0, False: 2]
  ------------------
 2322|      0|    PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 2323|      0|  }
 2324|       |
 2325|       |  // Transform and/or validate the value
 2326|      2|  uint16_t rep = type_card & field_layout::kRepMask;
 2327|      2|  if (rep == field_layout::kRep64Bits) {
  ------------------
  |  Branch (2327:7): [True: 0, False: 2]
  ------------------
 2328|      0|    if (is_zigzag) {
  ------------------
  |  Branch (2328:9): [True: 0, False: 0]
  ------------------
 2329|      0|      tmp = WireFormatLite::ZigZagDecode64(tmp);
 2330|      0|    }
 2331|      2|  } else if (rep == field_layout::kRep32Bits) {
  ------------------
  |  Branch (2331:14): [True: 0, False: 2]
  ------------------
 2332|      0|    if (is_validated_enum) {
  ------------------
  |  Branch (2332:9): [True: 0, False: 0]
  ------------------
 2333|      0|      if (!EnumIsValidAux(tmp, xform_val, *table->field_aux(&entry))) {
  ------------------
  |  Branch (2333:11): [True: 0, False: 0]
  ------------------
 2334|      0|        ptr = ptr2;
 2335|      0|        PROTOBUF_MUSTTAIL return MpUnknownEnumFallback(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                      PROTOBUF_MUSTTAIL return MpUnknownEnumFallback(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      0|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 2336|      0|      }
 2337|      0|    } else if (is_zigzag) {
  ------------------
  |  Branch (2337:16): [True: 0, False: 0]
  ------------------
 2338|      0|      tmp = WireFormatLite::ZigZagDecode32(static_cast<uint32_t>(tmp));
 2339|      0|    }
 2340|      0|  }
 2341|       |
 2342|       |  // Mark the field as present:
 2343|      2|  const bool is_oneof = card == field_layout::kFcOneof;
 2344|      2|  if (card == field_layout::kFcOptional) {
  ------------------
  |  Branch (2344:7): [True: 2, False: 0]
  ------------------
 2345|      2|    SetHas(entry, msg);
 2346|      2|  } else if (is_oneof) {
  ------------------
  |  Branch (2346:14): [True: 0, False: 0]
  ------------------
 2347|      0|    ChangeOneof(table, /*class_data=*/nullptr, entry, data.tag() >> 3, ctx,
 2348|      0|                msg);
 2349|      0|  }
 2350|       |
 2351|      2|  void* const base = MaybeGetSplitBase(msg, is_split, table);
 2352|      2|  if (rep == field_layout::kRep64Bits) {
  ------------------
  |  Branch (2352:7): [True: 0, False: 2]
  ------------------
 2353|      0|    RefAt<uint64_t>(base, entry.offset) = tmp;
 2354|      2|  } else if (rep == field_layout::kRep32Bits) {
  ------------------
  |  Branch (2354:14): [True: 0, False: 2]
  ------------------
 2355|      0|    RefAt<uint32_t>(base, entry.offset) = static_cast<uint32_t>(tmp);
 2356|      2|  } else {
 2357|      2|    ABSL_DCHECK_EQ(rep, static_cast<uint16_t>(field_layout::kRep8Bits));
  ------------------
  |  |   74|      2|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|      2|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      2|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 2]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      2|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2358|      2|    RefAt<bool>(base, entry.offset) = static_cast<bool>(tmp);
 2359|      2|  }
 2360|       |
 2361|      2|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      2|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 2362|      2|}
generated_message_tctable_lite.cc:_ZN6google8protobuf8internal12_GLOBAL__N_16SetHasERKNS1_16TcParseTableBase10FieldEntryEPNS0_11MessageLiteE:
 2005|      2|inline void SetHas(const FieldEntry& entry, MessageLite* msg) {
 2006|      2|  auto has_idx = static_cast<uint32_t>(entry.has_idx);
 2007|      2|  auto& hasblock = TcParser::RefAt<uint32_t>(msg, has_idx / 32 * 4);
 2008|      2|  hasblock |= uint32_t{1} << (has_idx % 32);
 2009|      2|}
_ZN6google8protobuf8internal8TcParser27GetTableAndClassDataFromAuxILb1EEENS2_17TableAndClassDataENS1_16TcParseTableBase8FieldAuxE:
  641|      2|    TcParseTableBase::FieldAux aux) {
  642|      2|  if constexpr (kIsTable) {
  643|      2|#ifndef PROTOBUF_MESSAGE_GLOBALS
  644|      2|    const TcParseTableBase* inner_table = aux.table_ptr();
  645|      2|    return {inner_table, inner_table->class_data};
  646|       |#else
  647|       |    const auto* globals = aux.message_globals();
  648|       |    return {MessageGlobalsBase::ToParseTableBase(globals),
  649|       |            MessageGlobalsBase::GetClassData(globals)};
  650|       |#endif
  651|       |  } else {
  652|       |    const MessageLite* prototype = aux.message_default();
  653|       |    const TcParseTableBase* inner_table = prototype->GetTcParseTable();
  654|       |    return {inner_table, inner_table->class_data};
  655|       |  }
  656|      2|}
_ZN6google8protobuf8internal8TcParser9MiniParseILb0EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  520|      2|PROTOBUF_ALWAYS_INLINE const char* TcParser::MiniParse(PROTOBUF_TC_PARAM_DECL) {
  521|      2|  TestMiniParseResult* test_out;
  522|      2|  if (export_called_function) {
  ------------------
  |  Branch (522:7): [Folded, False: 2]
  ------------------
  523|      0|    test_out = reinterpret_cast<TestMiniParseResult*>(
  524|      0|        static_cast<uintptr_t>(data.data));
  525|      0|  }
  526|       |
  527|      2|  uint32_t tag;
  528|      2|  ptr = ReadTagInlined(ptr, &tag);
  529|      2|  if (ABSL_PREDICT_FALSE(ptr == nullptr)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  530|      0|    if (export_called_function) *test_out = {Error};
  ------------------
  |  Branch (530:9): [Folded, False: 0]
  ------------------
  531|      0|    PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  532|      0|  }
  533|       |
  534|      2|  auto* entry = FindFieldEntry(table, tag >> 3);
  535|      2|  if (entry == nullptr) {
  ------------------
  |  Branch (535:7): [True: 0, False: 2]
  ------------------
  536|      0|    if (export_called_function) *test_out = {table->fallback, tag};
  ------------------
  |  Branch (536:9): [Folded, False: 0]
  ------------------
  537|      0|    data.data = tag;
  538|      0|    PROTOBUF_MUSTTAIL return table->fallback(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return table->fallback(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      0|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
  539|      0|  }
  540|       |
  541|       |  // The handler may need the tag and the entry to resolve fallback logic. Both
  542|       |  // of these are 32 bits, so pack them into (the 64-bit) `data`. Since we can't
  543|       |  // pack the entry pointer itself, just pack its offset from `table`.
  544|      2|  uint64_t entry_offset = reinterpret_cast<const char*>(entry) -
  545|      2|                          reinterpret_cast<const char*>(table);
  546|      2|  data.data = entry_offset << 32 | tag;
  547|       |
  548|      2|  using field_layout::FieldKind;
  549|       |
  550|      2|  static_assert(
  551|      2|      absl::has_single_bit(size_t{kMiniParseTableTypeCardMask} + 1) &&
  552|      2|          kMiniParseTableTypeCardMask + 1 == kMiniParseTableSize,
  553|      2|      "kMiniParseTableTypeCardMask must be of the form 2^n - 1, as it is used "
  554|      2|      "to index the mini parse table");
  555|       |
  556|      2|  auto field_type = entry->type_card & kMiniParseTableTypeCardMask;
  557|       |  // Just to be sure we got the order right, above.
  558|      2|  static_assert(0 == FieldKind::kFkNone, "Invalid table order");
  559|      2|  static_assert(1 == FieldKind::kFkVarint, "Invalid table order");
  560|      2|  static_assert(2 == FieldKind::kFkPackedVarint, "Invalid table order");
  561|      2|  static_assert(3 == FieldKind::kFkFixed, "Invalid table order");
  562|      2|  static_assert(4 == FieldKind::kFkPackedFixed, "Invalid table order");
  563|      2|  static_assert(5 == FieldKind::kFkString, "Invalid table order");
  564|      2|  static_assert(6 == FieldKind::kFkMessage, "Invalid table order");
  565|      2|  static_assert(7 == FieldKind::kFkMap, "Invalid table order");
  566|       |
  567|      2|  static_assert(8 == (+field_layout::kSplitMask | FieldKind::kFkNone),
  568|      2|                "Invalid table order");
  569|      2|  static_assert(9 == (+field_layout::kSplitMask | FieldKind::kFkVarint),
  570|      2|                "Invalid table order");
  571|      2|  static_assert(10 == (+field_layout::kSplitMask | FieldKind::kFkPackedVarint),
  572|      2|                "Invalid table order");
  573|      2|  static_assert(11 == (+field_layout::kSplitMask | FieldKind::kFkFixed),
  574|      2|                "Invalid table order");
  575|      2|  static_assert(12 == (+field_layout::kSplitMask | FieldKind::kFkPackedFixed),
  576|      2|                "Invalid table order");
  577|      2|  static_assert(13 == (+field_layout::kSplitMask | FieldKind::kFkString),
  578|      2|                "Invalid table order");
  579|      2|  static_assert(14 == (+field_layout::kSplitMask | FieldKind::kFkMessage),
  580|      2|                "Invalid table order");
  581|      2|  static_assert(15 == (+field_layout::kSplitMask | FieldKind::kFkMap),
  582|      2|                "Invalid table order");
  583|       |
  584|      2|  ABSL_DCHECK_LT(field_type, kMiniParseTableSize);
  ------------------
  |  |   80|      2|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|      2|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      2|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 2]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      2|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  585|      2|  TailCallParseFunc parse_fn = kMiniParseTable[field_type];
  586|      2|  if (export_called_function) *test_out = {parse_fn, tag, entry};
  ------------------
  |  Branch (586:7): [Folded, False: 2]
  ------------------
  587|       |
  588|      2|  PROTOBUF_MUSTTAIL return parse_fn(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return parse_fn(PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      2|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
  589|      2|}
_ZN6google8protobuf8internal8TcParser27SingularParseMessageAuxImplIhLb0ELb1EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  676|      4|    PROTOBUF_TC_PARAM_DECL) {
  677|      4|  PROTOBUF_PREFETCH_WITH_OFFSET(ptr, 192);
  ------------------
  |  |  594|      4|  asm("prefetcht0 " #offset "(%0)" : : "r"(base));
  ------------------
  678|      4|  PROTOBUF_PREFETCH_WITH_OFFSET(ptr, 256);
  ------------------
  |  |  594|      4|  asm("prefetcht0 " #offset "(%0)" : : "r"(base));
  ------------------
  679|      4|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  190|      4|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 4]
  |  |  |  Branch (190:49): [Folded, False: 4]
  |  |  |  Branch (190:58): [True: 0, False: 4]
  |  |  ------------------
  ------------------
  680|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  681|      0|  }
  682|      4|  auto saved_tag = UnalignedLoad<TagType>(ptr);
  683|      4|  ptr += sizeof(TagType);
  684|      4|  SetCachedHasBit(hasbits, data.hasbit_idx());
  685|      4|  SyncHasbits(msg, hasbits, table);
  686|      4|  auto& field = RefAt<MessageLite*>(msg, data.offset());
  687|      4|  const auto aux = *table->field_aux(data.aux_idx());
  688|      4|#ifndef PROTOBUF_MESSAGE_GLOBALS
  689|      4|  const auto* inner_table =
  690|      4|      aux_is_table ? aux.table_ptr() : aux.message_default()->GetTcParseTable();
  ------------------
  |  Branch (690:7): [True: 4, Folded]
  ------------------
  691|      4|  if (field == nullptr) {
  ------------------
  |  Branch (691:7): [True: 4, False: 0]
  ------------------
  692|      4|    field = NewMessage(inner_table->class_data, msg->GetArena());
  693|      4|  }
  694|       |#else
  695|       |  const TcParseTableBase* inner_table;
  696|       |  if constexpr (aux_is_table) {
  697|       |    inner_table = MessageGlobalsBase::ToParseTableBase(aux.message_globals());
  698|       |    if (field == nullptr) {
  699|       |      field =
  700|       |          NewMessage(MessageGlobalsBase::GetClassData(aux.message_globals()),
  701|       |                     msg->GetArena());
  702|       |    }
  703|       |  } else {
  704|       |    inner_table = aux.message_default()->GetTcParseTable();
  705|       |    if (field == nullptr) {
  706|       |      field = NewMessage(inner_table->class_data, msg->GetArena());
  707|       |    }
  708|       |  }
  709|       |#endif  // PROTOBUF_MESSAGE_GLOBALS
  710|      4|  const auto inner_loop = [&](const char* ptr) {
  711|      4|    return ParseLoop(field, ptr, ctx, inner_table);
  712|      4|  };
  713|      4|  return group_coding
  ------------------
  |  Branch (713:10): [Folded, False: 4]
  ------------------
  714|      4|             ? ctx->ParseGroupInlined(ptr, FastDecodeTag(saved_tag), inner_loop)
  715|      4|             : ctx->ParseLengthDelimitedInlined(ptr, inner_loop);
  716|      4|}
_ZZN6google8protobuf8internal8TcParser27SingularParseMessageAuxImplIhLb0ELb1EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEmENKUlS5_E_clES5_:
  710|      4|  const auto inner_loop = [&](const char* ptr) {
  711|      4|    return ParseLoop(field, ptr, ctx, inner_table);
  712|      4|  };
_ZN6google8protobuf8internal8TcParser27RepeatedParseMessageAuxImplIhLb0ELb1EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  774|      2|    PROTOBUF_TC_PARAM_DECL) {
  775|      2|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  776|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  777|      0|  }
  778|      2|  PROTOBUF_PREFETCH_WITH_OFFSET(ptr, 256);
  ------------------
  |  |  594|      2|  asm("prefetcht0 " #offset "(%0)" : : "r"(base));
  ------------------
  779|      2|  SetCachedHasBit(hasbits, data.hasbit_idx());
  780|      2|  Arena* arena = msg->GetArena();
  781|      2|  const auto expected_tag = UnalignedLoad<TagType>(ptr);
  782|      2|  const auto aux = *table->field_aux(data.aux_idx());
  783|      2|  auto& field = RefAt<RepeatedPtrFieldBase>(msg, data.offset());
  784|      2|  ABSL_DCHECK_EQ(field.GetArena(), arena);
  ------------------
  |  |   74|      2|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|      2|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      2|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 2]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      2|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  785|       |  // Captured structured bindings are a C++20 feature.
  786|      2|  auto [inner_table_alias, class_data] =
  787|      2|      GetTableAndClassDataFromAux<aux_is_table>(aux);
  788|      2|  const TcParseTableBase* inner_table = inner_table_alias;
  789|    596|  do {
  790|    596|    ptr += sizeof(TagType);
  791|    596|    MessageLite* submsg = AddMessage(class_data, field, arena);
  792|    596|    const auto inner_loop = [&](const char* ptr) {
  793|    596|      return ParseLoop(submsg, ptr, ctx, inner_table);
  794|    596|    };
  795|    596|    ptr = group_coding ? ctx->ParseGroupInlined(
  ------------------
  |  Branch (795:11): [Folded, False: 596]
  ------------------
  796|      0|                             ptr, FastDecodeTag(expected_tag), inner_loop)
  797|    596|                       : ctx->ParseLengthDelimitedInlined(ptr, inner_loop);
  798|    596|    if (ABSL_PREDICT_FALSE(ptr == nullptr)) {
  ------------------
  |  |  190|    596|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 596]
  |  |  |  Branch (190:49): [Folded, False: 596]
  |  |  |  Branch (190:58): [True: 0, False: 596]
  |  |  ------------------
  ------------------
  799|      0|      PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                    PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  800|      0|    }
  801|    596|    if (ABSL_PREDICT_FALSE(!ctx->DataAvailable(ptr))) {
  ------------------
  |  |  190|    596|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 596]
  |  |  |  Branch (190:49): [Folded, False: 596]
  |  |  |  Branch (190:58): [True: 0, False: 596]
  |  |  ------------------
  ------------------
  802|      0|      PROTOBUF_MUSTTAIL return ToParseLoop(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                    PROTOBUF_MUSTTAIL return ToParseLoop(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  803|      0|    }
  804|    596|  } while (UnalignedLoad<TagType>(ptr) == expected_tag);
  ------------------
  |  Branch (804:12): [True: 594, False: 2]
  ------------------
  805|       |
  806|      2|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      2|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  807|      2|}
_ZZN6google8protobuf8internal8TcParser27RepeatedParseMessageAuxImplIhLb0ELb1EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEmENKUlS5_E_clES5_:
  792|    596|    const auto inner_loop = [&](const char* ptr) {
  793|    596|      return ParseLoop(submsg, ptr, ctx, inner_table);
  794|    596|    };
_ZN6google8protobuf8internal8TcParser13SingularFixedIjhEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
  855|    596|    PROTOBUF_TC_PARAM_DECL) {
  856|    596|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  190|    596|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 596]
  |  |  |  Branch (190:49): [Folded, False: 596]
  |  |  |  Branch (190:58): [True: 0, False: 596]
  |  |  ------------------
  ------------------
  857|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  858|      0|  }
  859|    596|  ptr += sizeof(TagType);  // Consume tag
  860|    596|  SetCachedHasBit(hasbits, data.hasbit_idx());
  861|    596|  RefAt<LayoutType>(msg, data.offset()) = UnalignedLoad<LayoutType>(ptr);
  862|    596|  ptr += sizeof(LayoutType);
  863|    596|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|    596|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|    596|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
  864|    596|}
_ZN6google8protobuf8internal8TcParser14SingularVarintIbtLb0EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1079|      2|    PROTOBUF_TC_PARAM_DECL) {
 1080|      2|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  190|      2|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 2, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 2]
  |  |  |  Branch (190:58): [True: 2, False: 0]
  |  |  ------------------
  ------------------
 1081|      2|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      2|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1082|      2|  }
 1083|      0|  ptr += sizeof(TagType);  // Consume tag
 1084|      0|  SetCachedHasBit(hasbits, data.hasbit_idx());
 1085|       |
 1086|       |  // clang isn't smart enough to be able to only conditionally save
 1087|       |  // registers to the stack, so we turn the integer-greater-than-128
 1088|       |  // case into a separate routine.
 1089|      0|  if (ABSL_PREDICT_FALSE(static_cast<int8_t>(*ptr) < 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]
  |  |  ------------------
  ------------------
 1090|      0|    PROTOBUF_MUSTTAIL return SingularVarBigint<FieldType, TagType, zigzag>(
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
 1091|      0|        PROTOBUF_TC_PARAM_PASS);
  ------------------
  |  |  536|      0|#define PROTOBUF_TC_PARAM_PASS msg, ptr, ctx, data, table, hasbits
  ------------------
 1092|      0|  }
 1093|       |
 1094|      0|  RefAt<FieldType>(msg, data.offset()) =
 1095|      0|      ZigZagDecodeHelper<FieldType, zigzag>(static_cast<uint8_t>(*ptr++));
 1096|      0|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1097|      0|}
_ZN6google8protobuf8internal8TcParser12FastVarintS1IjEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1116|      2|    PROTOBUF_TC_PARAM_DECL) {
 1117|      2|  using TagType = uint8_t;
 1118|      2|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1119|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1120|      0|  }
 1121|      2|  int64_t res;
 1122|      2|  ptr = ShiftMixParseVarint<FieldType>(ptr + sizeof(TagType), res);
 1123|      2|  if (ABSL_PREDICT_FALSE(ptr == nullptr)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1124|      0|    PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1125|      0|  }
 1126|      2|  SetCachedHasBit(hasbits, data.hasbit_idx());
 1127|      2|  RefAt<FieldType>(msg, data.offset()) = res;
 1128|      2|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      2|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      2|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1129|      2|}
generated_message_tctable_lite.cc:_ZN6google8protobuf8internal12_GLOBAL__N_111ParseVarintImEEPKcS5_PT_:
  962|      2|PROTOBUF_ALWAYS_INLINE const char* ParseVarint(const char* p, Type* value) {
  963|      2|  static_assert(sizeof(Type) == 4 || sizeof(Type) == 8,
  964|      2|                "Only [u]int32_t and [u]int64_t please");
  965|       |#ifdef __aarch64__
  966|       |  // The VarintParse parser has a faster implementation on ARM.
  967|       |  std::conditional_t<sizeof(Type) == 4, uint32_t, uint64_t> tmp;
  968|       |  p = VarintParse(p, &tmp);
  969|       |  if (p != nullptr) {
  970|       |    *value = tmp;
  971|       |  }
  972|       |  return p;
  973|       |#endif
  974|      2|  int64_t res;
  975|      2|  p = ShiftMixParseVarint<Type>(p, res);
  976|      2|  *value = res;
  977|      2|  return p;
  978|      2|}
_ZN6google8protobuf8internal8TcParser22SingularEnumSmallRangeIhLh1EEEPKcPNS0_11MessageLiteES5_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1584|    520|    PROTOBUF_TC_PARAM_DECL) {
 1585|    520|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  190|    520|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 520]
  |  |  |  Branch (190:49): [Folded, False: 520]
  |  |  |  Branch (190:58): [True: 0, False: 520]
  |  |  ------------------
  ------------------
 1586|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1587|      0|  }
 1588|       |
 1589|    520|  uint8_t v = ptr[sizeof(TagType)];
 1590|    520|  if (ABSL_PREDICT_FALSE(min > v || v > data.aux_idx())) {
  ------------------
  |  |  190|  1.04k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 520]
  |  |  |  Branch (190:49): [Folded, False: 520]
  |  |  |  Branch (190:59): [True: 0, False: 520]
  |  |  |  Branch (190:59): [True: 0, False: 520]
  |  |  ------------------
  ------------------
 1591|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1592|      0|  }
 1593|       |
 1594|    520|  RefAt<int32_t>(msg, data.offset()) = v;
 1595|    520|  ptr += sizeof(TagType) + 1;
 1596|    520|  SetCachedHasBit(hasbits, data.hasbit_idx());
 1597|    520|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|    520|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|    520|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1598|    520|}
_ZN6google8protobuf8internal8TcParser14SingularStringIhNS1_14ArenaStringPtrELNS2_8Utf8TypeE0EEEPKcPNS0_11MessageLiteES7_PNS1_12ParseContextENS1_11TcFieldDataEPKNS1_16TcParseTableBaseEm:
 1817|    596|    PROTOBUF_TC_PARAM_DECL) {
 1818|    596|  if (ABSL_PREDICT_FALSE(data.coded_tag<TagType>() != 0)) {
  ------------------
  |  |  190|    596|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 596]
  |  |  |  Branch (190:49): [Folded, False: 596]
  |  |  |  Branch (190:58): [True: 0, False: 596]
  |  |  ------------------
  ------------------
 1819|      0|    PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return MiniParse(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1820|      0|  }
 1821|    596|  auto saved_tag = UnalignedLoad<TagType>(ptr);
 1822|    596|  ptr += sizeof(TagType);
 1823|    596|  SetCachedHasBit(hasbits, data.hasbit_idx());
 1824|    596|  auto& field = RefAt<FieldType>(msg, data.offset());
 1825|    596|  auto arena = msg->GetArena();
 1826|    596|  if (arena) {
  ------------------
  |  Branch (1826:7): [True: 0, False: 596]
  ------------------
 1827|      0|    ptr = ReadStringIntoArena(ptr, ctx, data, field, arena);
 1828|    596|  } else {
 1829|    596|    ptr = ReadStringNoArena(ptr, ctx, data, field);
 1830|    596|  }
 1831|    596|  if (ABSL_PREDICT_FALSE(ptr == nullptr)) {
  ------------------
  |  |  190|    596|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 596]
  |  |  |  Branch (190:49): [Folded, False: 596]
  |  |  |  Branch (190:58): [True: 0, False: 596]
  |  |  ------------------
  ------------------
 1832|      0|    EnsureArenaStringIsNotDefault(msg, &field);
 1833|      0|    PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                  PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1834|      0|  }
 1835|    596|  switch (utf8) {
  ------------------
  |  Branch (1835:11): [Folded, False: 0]
  ------------------
 1836|    596|    case kNoUtf8:
  ------------------
  |  Branch (1836:5): [True: 596, False: 0]
  ------------------
 1837|    596|      break;
 1838|      0|    case kUtf8:
  ------------------
  |  Branch (1838:5): [True: 0, False: 596]
  ------------------
 1839|      0|      if (ABSL_PREDICT_TRUE(IsValidUTF8(field))) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1840|      0|        break;
 1841|      0|      }
 1842|      0|      ReportFastUtf8Error(FastDecodeTag(saved_tag), table);
 1843|      0|      PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|      0|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                    PROTOBUF_MUSTTAIL return Error(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|      0|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1844|    596|  }
 1845|       |
 1846|    596|  PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  233|    596|#define PROTOBUF_MUSTTAIL [[clang::musttail]]
  ------------------
                PROTOBUF_MUSTTAIL return ToTagDispatch(PROTOBUF_TC_PARAM_NO_DATA_PASS);
  ------------------
  |  |  549|    596|  msg, ptr, ctx, ::google::protobuf::internal::TcFieldData::DefaultInit(), table, hasbits
  ------------------
 1847|    596|}
generated_message_tctable_lite.cc:_ZN6google8protobuf8internal12_GLOBAL__N_117ReadStringNoArenaEPKcPNS1_12ParseContextENS1_11TcFieldDataERNS1_14ArenaStringPtrE:
 1770|    596|                              ArenaStringPtr& field) {
 1771|    596|  int size = ReadSize(&ptr);
 1772|    596|  if (!ptr) return nullptr;
  ------------------
  |  Branch (1772:7): [True: 0, False: 596]
  ------------------
 1773|    596|  return ctx->ReadString(ptr, size, field.MutableNoCopy(nullptr));
 1774|    596|}

_ZN6google8protobuf8internal24InitProtobufDefaultsSlowEv:
  104|      2|void InitProtobufDefaultsSlow() {
  105|      2|  static bool is_inited = InitProtobufDefaultsImpl();
  106|      2|  (void)is_inited;
  107|      2|}
generated_message_util.cc:_ZN6google8protobuf8internalL24InitProtobufDefaultsImplEv:
   93|      2|static bool InitProtobufDefaultsImpl() {
   94|      2|  if (auto* to_destroy = fixed_address_empty_string.Init()) {
  ------------------
  |  Branch (94:13): [True: 0, False: 2]
  ------------------
   95|      0|    OnShutdownDestroyString(to_destroy);
   96|      0|  }
   97|      2|  InitWeakDefaults();
   98|       |
   99|       |
  100|      2|  init_protobuf_defaults_state.store(true, std::memory_order_release);
  101|      2|  return true;
  102|      2|}
generated_message_util.cc:_ZN6google8protobuf8internalL16InitWeakDefaultsEv:
   72|      2|static void InitWeakDefaults() {
   73|       |  // force link the dummy entry.
   74|      2|  StrongPointer<DummyWeakDefault*, &dummy_weak_default>();
   75|       |  // We don't know the size of each object, but we know the layout of the tail.
   76|       |  // It contains a WeakDescriptorDefaultTail object.
   77|       |  // As such, we iterate the section backwards.
   78|      2|  const char* start = &__start_pb_defaults;
   79|      2|  const char* end = &__stop_pb_defaults;
   80|      4|  while (start != end) {
  ------------------
  |  Branch (80:10): [True: 2, False: 2]
  ------------------
   81|      2|    auto* tail = reinterpret_cast<const WeakDescriptorDefaultTail*>(end) - 1;
   82|      2|    end -= tail->size;
   83|      2|    const MessageGlobalsBase* instance =
   84|      2|        reinterpret_cast<const MessageGlobalsBase*>(end);
   85|      2|    *tail->target = instance;
   86|      2|  }
   87|      2|}

_ZN6google8protobuf8internal17AllAreInitializedIN13sentencepiece24ModelProto_SentencePieceEEEbRKNS0_16RepeatedPtrFieldIT_EE:
  111|      2|    const RepeatedPtrField<Msg>& t) {
  112|    598|  for (int i = t.size(); --i >= 0;) {
  ------------------
  |  Branch (112:26): [True: 596, False: 2]
  ------------------
  113|    596|    if (!t.Get(i).IsInitialized()) return false;
  ------------------
  |  Branch (113:9): [True: 0, False: 596]
  ------------------
  114|    596|  }
  115|      2|  return true;
  116|      2|}

_ZN6google8protobuf8internal7HasBitsILi1EEixEi:
   45|   884M|  PROTOBUF_NDEBUG_INLINE uint32_t& operator[](int index) {
   46|   884M|    return has_bits_[index];
   47|   884M|  }
_ZNK6google8protobuf8internal7HasBitsILi1EEixEi:
   50|      8|  operator[](int index) const {
   51|      8|    return has_bits_[index];
   52|      8|  }
_ZNK6google8protobuf8internal7HasBitsILi2EEixEi:
   50|  3.16k|  operator[](int index) const {
   51|  3.16k|    return has_bits_[index];
   52|  3.16k|  }
_ZN6google8protobuf8internal7HasBitsILi1EEC2Ev:
   35|   157M|  PROTOBUF_NDEBUG_INLINE constexpr HasBits() : has_bits_{} {}
_ZN6google8protobuf8internal7HasBitsILi1EE5ClearEv:
   41|  9.80k|  PROTOBUF_NDEBUG_INLINE void Clear() {
   42|  9.80k|    memset(has_bits_, 0, sizeof(has_bits_));
   43|  9.80k|  }

_ZNK6google8protobuf8internal22InternalMetadataOffset6OffsetEv:
  150|  19.0k|  constexpr int32_t Offset() const { return offset_; }
_ZN6google8protobuf8internal22InternalMetadataOffsetC2Ei:
  155|  19.0k|  explicit constexpr InternalMetadataOffset(int32_t offset) : offset_(offset) {}
_ZN6google8protobuf8internal22InternalMetadataOffset5BuildIN13sentencepiece17SentencePieceTextELm40EEES2_v:
   38|  14.4k|  static constexpr PROTOBUF_ALWAYS_INLINE InternalMetadataOffset Build() {
   39|  14.4k|    static_assert(
   40|  14.4k|        std::is_same_v<std::remove_const_t<decltype(T::_internal_metadata_)>,
   41|  14.4k|                       InternalMetadata>,
   42|  14.4k|        "Field `_internal_metadata_ is not of type `InternalMetadata`");
   43|       |
   44|  14.4k|    constexpr int64_t kInternalMetadataOffset =
   45|  14.4k|        static_cast<int64_t>(PROTOBUF_FIELD_OFFSET(T, _internal_metadata_));
  ------------------
  |  |  311|  14.4k|  _Pragma("clang diagnostic push")                           \
  |  |  312|  14.4k|  _Pragma("clang diagnostic ignored \"-Winvalid-offsetof\"") \
  |  |  313|  14.4k|  __builtin_offsetof(TYPE, FIELD)                            \
  |  |  314|  14.4k|  _Pragma("clang diagnostic pop")
  ------------------
   46|       |
   47|  14.4k|    static_assert(
   48|  14.4k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) >=
   49|  14.4k|            int64_t{INT32_MIN},
   50|  14.4k|        "Offset from `_internal_metadata_` is underflowing an int32_t, "
   51|  14.4k|        "likely meaning your message body is too large.");
   52|  14.4k|    static_assert(
   53|  14.4k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) <=
   54|  14.4k|            int64_t{INT32_MAX},
   55|  14.4k|        "Offset from `_internal_metadata_` is overflowing an int32_t, "
   56|  14.4k|        "likely meaning your message body is too large.");
   57|       |
   58|  14.4k|    return InternalMetadataOffset(
   59|  14.4k|        static_cast<int32_t>(kInternalMetadataOffset - kFieldOffset));
   60|  14.4k|  }
_ZN6google8protobuf8internal30TaggedInternalMetadataResolverILj0EEC2ENS1_22InternalMetadataOffsetE:
  173|  19.0k|      : offset_(static_cast<uint32_t>(offset.Offset())) {
  174|  19.0k|    ABSL_DCHECK_EQ(offset_ & kTagMask, uint32_t{0});
  ------------------
  |  |   74|  19.0k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|  19.0k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  19.0k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 19.0k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  19.0k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  175|  19.0k|  }
_ZN6google8protobuf8internal22InternalMetadataOffset5BuildIN13sentencepiece22NBestSentencePieceTextELm24EEES2_v:
   38|  4.59k|  static constexpr PROTOBUF_ALWAYS_INLINE InternalMetadataOffset Build() {
   39|  4.59k|    static_assert(
   40|  4.59k|        std::is_same_v<std::remove_const_t<decltype(T::_internal_metadata_)>,
   41|  4.59k|                       InternalMetadata>,
   42|  4.59k|        "Field `_internal_metadata_ is not of type `InternalMetadata`");
   43|       |
   44|  4.59k|    constexpr int64_t kInternalMetadataOffset =
   45|  4.59k|        static_cast<int64_t>(PROTOBUF_FIELD_OFFSET(T, _internal_metadata_));
  ------------------
  |  |  311|  4.59k|  _Pragma("clang diagnostic push")                           \
  |  |  312|  4.59k|  _Pragma("clang diagnostic ignored \"-Winvalid-offsetof\"") \
  |  |  313|  4.59k|  __builtin_offsetof(TYPE, FIELD)                            \
  |  |  314|  4.59k|  _Pragma("clang diagnostic pop")
  ------------------
   46|       |
   47|  4.59k|    static_assert(
   48|  4.59k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) >=
   49|  4.59k|            int64_t{INT32_MIN},
   50|  4.59k|        "Offset from `_internal_metadata_` is underflowing an int32_t, "
   51|  4.59k|        "likely meaning your message body is too large.");
   52|  4.59k|    static_assert(
   53|  4.59k|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) <=
   54|  4.59k|            int64_t{INT32_MAX},
   55|  4.59k|        "Offset from `_internal_metadata_` is overflowing an int32_t, "
   56|  4.59k|        "likely meaning your message body is too large.");
   57|       |
   58|  4.59k|    return InternalMetadataOffset(
   59|  4.59k|        static_cast<int32_t>(kInternalMetadataOffset - kFieldOffset));
   60|  4.59k|  }
_ZN6google8protobuf8internal22InternalMetadataOffset5BuildIN13sentencepiece10ModelProtoELm40EEES2_v:
   38|      2|  static constexpr PROTOBUF_ALWAYS_INLINE InternalMetadataOffset Build() {
   39|      2|    static_assert(
   40|      2|        std::is_same_v<std::remove_const_t<decltype(T::_internal_metadata_)>,
   41|      2|                       InternalMetadata>,
   42|      2|        "Field `_internal_metadata_ is not of type `InternalMetadata`");
   43|       |
   44|      2|    constexpr int64_t kInternalMetadataOffset =
   45|      2|        static_cast<int64_t>(PROTOBUF_FIELD_OFFSET(T, _internal_metadata_));
  ------------------
  |  |  311|      2|  _Pragma("clang diagnostic push")                           \
  |  |  312|      2|  _Pragma("clang diagnostic ignored \"-Winvalid-offsetof\"") \
  |  |  313|      2|  __builtin_offsetof(TYPE, FIELD)                            \
  |  |  314|      2|  _Pragma("clang diagnostic pop")
  ------------------
   46|       |
   47|      2|    static_assert(
   48|      2|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) >=
   49|      2|            int64_t{INT32_MIN},
   50|      2|        "Offset from `_internal_metadata_` is underflowing an int32_t, "
   51|      2|        "likely meaning your message body is too large.");
   52|      2|    static_assert(
   53|      2|        kInternalMetadataOffset - static_cast<int64_t>(kFieldOffset) <=
   54|      2|            int64_t{INT32_MAX},
   55|      2|        "Offset from `_internal_metadata_` is overflowing an int32_t, "
   56|      2|        "likely meaning your message body is too large.");
   57|       |
   58|      2|    return InternalMetadataOffset(
   59|      2|        static_cast<int32_t>(kInternalMetadataOffset - kFieldOffset));
   60|      2|  }

_ZN6google8protobuf8internal18InternalVisibilityC2Ev:
   49|   314M|inline constexpr InternalVisibility::InternalVisibility() = default;

_ZN6google8protobuf2io16CodedInputStream24GetDefaultRecursionLimitEv:
  399|      2|  PROTOBUF_FUTURE_ADD_EARLY_NODISCARD static int GetDefaultRecursionLimit() {
  400|      2|    return default_recursion_limit_;
  401|      2|  }

_ZN6google8protobuf8internal13MergeFromImplILb0EEEbNSt3__117basic_string_viewIcNS3_11char_traitsIcEEEEPNS0_11MessageLiteEPKNS1_16TcParseTableBaseENS8_10ParseFlagsE:
  228|      2|                   MessageLite::ParseFlags parse_flags) {
  229|      2|  const char* ptr;
  230|      2|  internal::ParseContext ctx(io::CodedInputStream::GetDefaultRecursionLimit(),
  231|      2|                             aliasing, &ptr, input);
  232|      2|  ptr = internal::TcParser::ParseLoop(msg, ptr, &ctx, tc_table);
  233|       |  // ctx has an explicit limit set (length of string_view).
  234|      2|  if (ABSL_PREDICT_TRUE(ptr && ctx.EndedAtLimit())) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  235|      2|    return CheckFieldPresenceImpl(ctx, *msg, parse_flags);
  236|      2|  }
  237|      0|  return false;
  238|      2|}
_ZNK6google8protobuf11MessageLite3NewEPNS0_5ArenaE:
   92|    596|MessageLite* MessageLite::New(Arena* arena) const {
   93|    596|  auto* data = GetClassData();
   94|    596|  void* mem = data->message_creator.AllocateMessage(arena);
   95|       |  // The `instance->New()` expression requires using the actual instance
   96|       |  // instead of the prototype for the inner function call.
   97|       |  // Certain custom instances have special per-instance state that needs to be
   98|       |  // copied.
   99|    596|  return data->message_creator.PlacementNew(this, data->default_instance(), mem,
  100|    596|                                            arena);
  101|    596|}
_ZNK6google8protobuf11MessageLite13IsInitializedEv:
  103|      2|bool MessageLite::IsInitialized() const {
  104|      2|  auto* data = GetClassData();
  105|      2|  return data->is_initialized != nullptr ? data->is_initialized(*this) : true;
  ------------------
  |  Branch (105:10): [True: 2, False: 0]
  ------------------
  106|      2|}
_ZN6google8protobuf11MessageLite14ParseFromArrayEPKvi:
  425|      2|bool MessageLite::ParseFromArray(const void* data, int size) {
  426|      2|  return ParseFrom<kParse>(as_string_view(data, size));
  427|      2|}
message_lite.cc:_ZN6google8protobuf12_GLOBAL__N_122CheckFieldPresenceImplERKNS0_8internal12ParseContextERKNS0_11MessageLiteENS6_10ParseFlagsE:
  182|      2|                                   MessageLite::ParseFlags parse_flags) {
  183|      2|  (void)ctx;  // Parameter is used by Google-internal code.
  184|      2|  if (ABSL_PREDICT_FALSE((parse_flags & MessageLite::kMergePartial) != 0)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  185|      0|    return true;
  186|      0|  }
  187|      2|  return msg.IsInitializedWithErrors();
  188|      2|}
message_lite.cc:_ZN6google8protobuf12_GLOBAL__N_114as_string_viewEPKvi:
  175|      2|inline absl::string_view as_string_view(const void* data, int size) {
  176|      2|  return absl::string_view(static_cast<const char*>(data), size);
  177|      2|}

_ZN6google8protobuf8internal18MessageGlobalsBase17ToDefaultInstanceIN13sentencepiece11TrainerSpecEEEPKT_PKv:
  261|      2|  static const T* ToDefaultInstance(const void* globals) {
  262|      2|    return reinterpret_cast<const T*>(globals);
  263|      2|  }
_ZN6google8protobuf11MessageLite9SetHasBitERjj:
  891|   884M|      uint32_t& cached_has_bits, uint32_t has_bit_mask) {
  892|   884M|    cached_has_bits |= has_bit_mask;
  893|   884M|  }
_ZN6google8protobuf8internal18MessageGlobalsBase17ToDefaultInstanceIN13sentencepiece14NormalizerSpecEEEPKT_PKv:
  261|      2|  static const T* ToDefaultInstance(const void* globals) {
  262|      2|    return reinterpret_cast<const T*>(globals);
  263|      2|  }
_ZN6google8protobuf11MessageLite11CheckHasBitEjj:
  901|  7.77k|      uint32_t cached_has_bits, uint32_t has_bit_mask) {
  902|  7.77k|    return (cached_has_bits & has_bit_mask) != 0;
  903|  7.77k|  }
_ZN6google8protobuf11MessageLite19internal_visibilityEv:
  788|   314M|  static constexpr internal::InternalVisibility internal_visibility() {
  789|   314M|    return internal::InternalVisibility{};
  790|   314M|  }
_ZNK6google8protobuf11MessageLite8GetArenaEv:
  419|   412M|  [[nodiscard]] Arena* GetArena() const { return _internal_metadata_.arena(); }
_ZN6google8protobuf8internal10CachedSizeC2Ev:
  126|   157M|  constexpr CachedSize() noexcept : atom_(Scalar{}) {}
_ZNK6google8protobuf11MessageLite15GetTcParseTableEv:
  838|      2|  const internal::TcParseTableBase* GetTcParseTable() const {
  839|      2|    auto* data = GetClassData();
  840|      2|    ABSL_DCHECK(data != nullptr);
  ------------------
  |  |   47|      2|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      2|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      4|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      2|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      4|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      4|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 2, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      2|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 2]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      2|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 2, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      4|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      4|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  841|      2|    return data->GetTcParseTable();
  842|      2|  }
_ZN6google8protobuf11MessageLiteC2EPNS0_5ArenaE:
  851|   157M|  explicit MessageLite(Arena* arena) : _internal_metadata_(arena) {}
_ZN6google8protobuf11MessageLite16BatchCheckHasBitEjj:
  906|  5.20k|      uint32_t cached_has_bits, uint32_t batch_has_bits_mask) {
  907|  5.20k|    return (cached_has_bits & batch_has_bits_mask) != 0;
  908|  5.20k|  }
_ZNK6google8protobuf11MessageLite23IsInitializedWithErrorsEv:
  954|      2|  PROTOBUF_FUTURE_ADD_EARLY_NODISCARD bool IsInitializedWithErrors() const {
  955|      2|    if (IsInitialized()) return true;
  ------------------
  |  Branch (955:9): [True: 2, False: 0]
  ------------------
  956|      0|    LogInitializationErrorMessage();
  957|      0|    return false;
  958|      2|  }
_ZNK6google8protobuf8internal9ClassData15GetTcParseTableEv:
  351|      2|inline const TcParseTableBase* ClassData::GetTcParseTable() const {
  352|       |#ifdef PROTOBUF_MESSAGE_GLOBALS
  353|       |  if (ABSL_PREDICT_FALSE(is_dynamic)) {
  354|       |#else
  355|      2|  if (ABSL_PREDICT_FALSE(tc_table == nullptr)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  356|      0|#endif
  357|      0|    ABSL_DCHECK(!is_lite);
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  358|      0|    return full().descriptor_methods()->get_tc_table(this);
  359|      0|  }
  360|       |#ifdef PROTOBUF_MESSAGE_GLOBALS
  361|       |  return MessageGlobalsBase::ToParseTableBase(this);
  362|       |#else
  363|      2|  return tc_table;
  364|      2|#endif
  365|      2|}
_ZNK6google8protobuf8internal9ClassData3NewEPNS0_5ArenaE:
 1129|      4|PROTOBUF_ALWAYS_INLINE MessageLite* ClassData::New(Arena* arena) const {
 1130|       |  // Allocate the memory first, to reduce the number of spills.
 1131|       |  // This way we only spill `this` and `arena`.
 1132|      4|  void* mem = message_creator.AllocateMessage(arena);
 1133|      4|  const MessageLite* def = default_instance();
 1134|      4|  return message_creator.PlacementNew(def, def, mem, arena);
 1135|      4|}
_ZNK6google8protobuf8internal14MessageCreator12PlacementNewINS0_11MessageLiteEEEPT_PKS5_S8_PvPNS0_5ArenaE:
 1146|    600|    const MessageLite* prototype_for_copy, void* mem, Arena* arena) const {
 1147|    600|  ABSL_DCHECK_EQ(reinterpret_cast<uintptr_t>(mem) % alignment_, 0u);
  ------------------
  |  |   74|    600|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|    600|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    600|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 600]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    600|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1148|    600|  const Tag as_tag = tag();
 1149|    600|  static_assert(kFunc < 0 && !(kZeroInit < 0) && !(kMemcpy < 0),
 1150|    600|                "Only kFunc must be the only negative value");
 1151|    600|  if (ABSL_PREDICT_FALSE(static_cast<int8_t>(as_tag) < 0)) {
  ------------------
  |  |  190|    600|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 600]
  |  |  |  Branch (190:49): [Folded, False: 600]
  |  |  |  Branch (190:58): [True: 0, False: 600]
  |  |  ------------------
  ------------------
 1152|      0|    PROTOBUF_DEBUG_COUNTER("MessageCreator.Func").Inc();
  ------------------
  |  |  856|      0|  ::google::protobuf::internal::NoopDebugCounter {}
  ------------------
 1153|      0|    return static_cast<MessageLite*>(func_(prototype_for_func, mem, arena));
 1154|      0|  }
 1155|       |
 1156|    600|  char* dst = static_cast<char*>(mem);
 1157|    600|  const size_t size = allocation_size_;
 1158|    600|  const char* src = reinterpret_cast<const char*>(prototype_for_copy);
 1159|       |
 1160|       |  // These are a bit more efficient than calling normal memset/memcpy because:
 1161|       |  //  - We know the minimum size is 16. We have a fallback for when it is not.
 1162|       |  //  - We can "underflow" the buffer because those are the MessageLite bytes
 1163|       |  //    we will set later.
 1164|    600|  if (as_tag == kZeroInit) {
  ------------------
  |  Branch (1164:7): [True: 0, False: 600]
  ------------------
 1165|      0|    PROTOBUF_DEBUG_COUNTER("MessageCreator.ZeroInit").IncLog(size);
  ------------------
  |  |  856|      0|  ::google::protobuf::internal::NoopDebugCounter {}
  ------------------
 1166|       |    // Make sure the input is really all zeros.
 1167|      0|    ABSL_DCHECK(std::all_of(src + sizeof(MessageLite), src + size,
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1168|      0|                            [](auto c) { return c == 0; }));
 1169|       |
 1170|      0|    if (sizeof(MessageLite) != 16) {
  ------------------
  |  Branch (1170:9): [Folded, False: 0]
  ------------------
 1171|      0|      memset(dst, 0, size);
 1172|      0|    } else if (size <= 32) {
  ------------------
  |  Branch (1172:16): [True: 0, False: 0]
  ------------------
 1173|      0|      memset(dst + size - 16, 0, 16);
 1174|      0|    } else if (size <= 64) {
  ------------------
  |  Branch (1174:16): [True: 0, False: 0]
  ------------------
 1175|      0|      memset(dst + 16, 0, 16);
 1176|      0|      memset(dst + size - 32, 0, 32);
 1177|      0|    } else {
 1178|      0|      for (size_t offset = 16; offset + 64 < size; offset += 64) {
  ------------------
  |  Branch (1178:32): [True: 0, False: 0]
  ------------------
 1179|      0|        absl::PrefetchToLocalCacheForWrite(dst + offset + 64);
 1180|      0|        memset(dst + offset, 0, 64);
 1181|      0|      }
 1182|      0|      memset(dst + size - 64, 0, 64);
 1183|      0|    }
 1184|    600|  } else {
 1185|    600|    PROTOBUF_DEBUG_COUNTER("MessageCreator.Memcpy").IncLog(size);
  ------------------
  |  |  856|    600|  ::google::protobuf::internal::NoopDebugCounter {}
  ------------------
 1186|    600|    ABSL_DCHECK_EQ(+as_tag, +kMemcpy);
  ------------------
  |  |   74|    600|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|    600|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    600|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 600]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    600|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1187|       |
 1188|    600|    if (sizeof(MessageLite) != 16) {
  ------------------
  |  Branch (1188:9): [Folded, False: 600]
  ------------------
 1189|      0|      memcpy(dst, src, size);
 1190|    600|    } else if (size <= 32) {
  ------------------
  |  Branch (1190:16): [True: 0, False: 600]
  ------------------
 1191|      0|      memcpy(dst + size - 16, src + size - 16, 16);
 1192|    600|    } else if (size <= 64) {
  ------------------
  |  Branch (1192:16): [True: 596, False: 4]
  ------------------
 1193|    596|      memcpy(dst + 16, src + 16, 16);
 1194|    596|      memcpy(dst + size - 32, src + size - 32, 32);
 1195|    596|    } else {
 1196|     12|      for (size_t offset = 16; offset + 64 < size; offset += 64) {
  ------------------
  |  Branch (1196:32): [True: 8, False: 4]
  ------------------
 1197|      8|        absl::PrefetchToLocalCache(src + offset + 64);
 1198|      8|        absl::PrefetchToLocalCacheForWrite(dst + offset + 64);
 1199|      8|        memcpy(dst + offset, src + offset, 64);
 1200|      8|      }
 1201|      4|      memcpy(dst + size - 64, src + size - 64, 64);
 1202|      4|    }
 1203|    600|  }
 1204|       |
 1205|       |  // The second memcpy overwrites part of the first, but the compiler should
 1206|       |  // avoid the double-write. It's easier than trying to avoid the overlap.
 1207|    600|  memcpy(dst, static_cast<const void*>(prototype_for_copy),
 1208|    600|         sizeof(MessageLite));
 1209|    600|  memcpy(dst + PROTOBUF_FIELD_OFFSET(MessageLite, _internal_metadata_), &arena,
  ------------------
  |  |  311|    600|  _Pragma("clang diagnostic push")                           \
  |  |  312|    600|  _Pragma("clang diagnostic ignored \"-Winvalid-offsetof\"") \
  |  |  313|    600|  __builtin_offsetof(TYPE, FIELD)                            \
  |  |  314|    600|  _Pragma("clang diagnostic pop")
  ------------------
 1210|    600|         sizeof(arena));
 1211|    600|  return Launder(reinterpret_cast<MessageLite*>(mem));
 1212|    600|}
_ZN6google8protobuf8internal18MessageGlobalsBase17ToDefaultInstanceIN13sentencepiece24ModelProto_SentencePieceEEEPKT_PKv:
  261|    596|  static const T* ToDefaultInstance(const void* globals) {
  262|    596|    return reinterpret_cast<const T*>(globals);
  263|    596|  }
_ZN6google8protobuf8internal18MessageGlobalsBase17ToDefaultInstanceIN13sentencepiece10ModelProtoEEEPKT_PKv:
  261|      2|  static const T* ToDefaultInstance(const void* globals) {
  262|      2|    return reinterpret_cast<const T*>(globals);
  263|      2|  }
_ZN6google8protobuf11MessageLite9ParseFromILNS1_10ParseFlagsE1ENSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEbRKT0_:
 1088|      2|    const T& input) {
 1089|      2|  if (flags & kParse) Clear();
  ------------------
  |  Branch (1089:7): [True: 2, Folded]
  ------------------
 1090|      2|  constexpr bool alias = (flags & kMergeWithAliasing) != 0;
 1091|      2|  const internal::TcParseTableBase* tc_table;
 1092|      2|  PROTOBUF_ALWAYS_INLINE_CALL tc_table = GetTcParseTable();
  ------------------
  |  |  174|      2|#define PROTOBUF_ALWAYS_INLINE_CALL [[clang::always_inline]]
  ------------------
 1093|      2|  return internal::MergeFromImpl<alias>(input, this, tc_table, flags);
 1094|      2|}

_ZNK6google8protobuf8internal16InternalMetadata5arenaEv:
   67|   412M|  PROTOBUF_NDEBUG_INLINE Arena* arena() const {
   68|   412M|    if (ABSL_PREDICT_FALSE(have_unknown_fields())) {
  ------------------
  |  |  190|   412M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 412M]
  |  |  |  Branch (190:49): [Folded, False: 412M]
  |  |  |  Branch (190:58): [True: 0, False: 412M]
  |  |  ------------------
  ------------------
   69|      0|      return PtrValue<ContainerBase>()->arena;
   70|   412M|    } else {
   71|   412M|      return PtrValue<Arena>();
   72|   412M|    }
   73|   412M|  }
_ZNK6google8protobuf8internal16InternalMetadata19have_unknown_fieldsEv:
   75|   412M|  PROTOBUF_NDEBUG_INLINE bool have_unknown_fields() const {
   76|   412M|    return HasUnknownFieldsTag();
   77|   412M|  }
_ZNK6google8protobuf8internal16InternalMetadata19HasUnknownFieldsTagEv:
  143|   412M|  PROTOBUF_ALWAYS_INLINE bool HasUnknownFieldsTag() const {
  144|   412M|    return ptr_ & kUnknownFieldsTagMask;
  145|   412M|  }
_ZNK6google8protobuf8internal16InternalMetadata8PtrValueINS0_5ArenaEEEPT_v:
  148|   412M|  U* PtrValue() const {
  149|   412M|    if constexpr (std::is_same_v<U, Arena>) {
  150|       |      // No mask to remove.
  151|   412M|      ABSL_DCHECK_EQ(ptr_ & kPtrTagMask, 0);
  ------------------
  |  |   74|   412M|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   412M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   412M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 412M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   412M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  152|   412M|      return reinterpret_cast<U*>(ptr_);
  153|       |    } else {
  154|       |      static_assert(kPtrTagMask == 1);
  155|       |      ABSL_DCHECK_EQ(ptr_ & kPtrTagMask, kPtrTagMask);
  156|       |      // We can remove the mask via -1, which is smaller asm and can be merged
  157|       |      // with other arithmetic operations.
  158|       |      // Eg PtrValue<Container>()->unknown_fields can merge the offset into the
  159|       |      // mask removal.
  160|       |      return reinterpret_cast<U*>(ptr_ - kPtrTagMask);
  161|       |    }
  162|   412M|  }
_ZN6google8protobuf8internal16InternalMetadataC2EPNS0_5ArenaE:
   48|   157M|  explicit InternalMetadata(Arena* arena) {
   49|   157M|    ptr_ = reinterpret_cast<intptr_t>(arena);
   50|   157M|  }
_ZN6google8protobuf8internal16InternalMetadata5ClearINSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEvv:
  128|  9.80k|  PROTOBUF_NDEBUG_INLINE void Clear() {
  129|  9.80k|    if (ABSL_PREDICT_FALSE(have_unknown_fields())) {
  ------------------
  |  |  190|  9.80k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 9.80k]
  |  |  |  Branch (190:49): [Folded, False: 9.80k]
  |  |  |  Branch (190:58): [True: 0, False: 9.80k]
  |  |  ------------------
  ------------------
  130|      0|      DoClear<T>();
  131|      0|    }
  132|  9.80k|  }

_ZN6google8protobuf8internal18EpsCopyInputStream28IsRequestedLessThanOrEqualToEii:
   90|    596|                                                      int available) {
   91|    596|  return static_cast<int64_t>(static_cast<uint32_t>(requested)) <=
   92|    596|         static_cast<int64_t>(available);
   93|    596|}
_ZN6google8protobuf8internal18EpsCopyInputStream14CanReadFromPtrEiPKc:
   95|    596|bool EpsCopyInputStream::CanReadFromPtr(int requested, const char* ptr) {
   96|    596|  return IsRequestedLessThanOrEqualTo(requested, BytesAvailable(ptr));
   97|    596|}
_ZN6google8protobuf8internal18EpsCopyInputStream10NextBufferEii:
  114|      2|const char* EpsCopyInputStream::NextBuffer(int overrun, int depth) {
  115|      2|  if (next_chunk_ == nullptr) return nullptr;  // We've reached end of stream.
  ------------------
  |  Branch (115:7): [True: 0, False: 2]
  ------------------
  116|      2|  if (next_chunk_ != patch_buffer_) {
  ------------------
  |  Branch (116:7): [True: 0, False: 2]
  ------------------
  117|      0|    ABSL_DCHECK(size_ > kSlopBytes);
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  118|       |    // The chunk is large enough to be used directly
  119|      0|    buffer_end_ = next_chunk_ + size_ - kSlopBytes;
  120|      0|    auto res = next_chunk_;
  121|      0|    next_chunk_ = patch_buffer_;
  122|      0|    if (aliasing_ == kOnPatch) aliasing_ = kNoDelta;
  ------------------
  |  Branch (122:9): [True: 0, False: 0]
  ------------------
  123|      0|    return res;
  124|      0|  }
  125|       |  // Move the slop bytes of previous buffer to start of the patch buffer.
  126|       |  // Note we must use memmove because the previous buffer could be part of
  127|       |  // patch_buffer_.
  128|      2|  std::memmove(patch_buffer_, buffer_end_, kSlopBytes);
  129|      2|  if (overall_limit_ > 0 &&
  ------------------
  |  Branch (129:7): [True: 0, False: 2]
  ------------------
  130|      0|      (depth < 0 || !ParseEndsInSlopRegion(patch_buffer_, overrun, depth))) {
  ------------------
  |  Branch (130:8): [True: 0, False: 0]
  |  Branch (130:21): [True: 0, False: 0]
  ------------------
  131|      0|    const void* data;
  132|       |    // ZeroCopyInputStream indicates Next may return 0 size buffers. Hence
  133|       |    // we loop.
  134|      0|    while (StreamNext(&data)) {
  ------------------
  |  Branch (134:12): [True: 0, False: 0]
  ------------------
  135|      0|      if (size_ > kSlopBytes) {
  ------------------
  |  Branch (135:11): [True: 0, False: 0]
  ------------------
  136|       |        // We got a large chunk
  137|      0|        std::memcpy(patch_buffer_ + kSlopBytes, data, kSlopBytes);
  138|      0|        next_chunk_ = static_cast<const char*>(data);
  139|      0|        buffer_end_ = patch_buffer_ + kSlopBytes;
  140|      0|        if (aliasing_ >= kNoDelta) aliasing_ = kOnPatch;
  ------------------
  |  Branch (140:13): [True: 0, False: 0]
  ------------------
  141|      0|        return patch_buffer_;
  142|      0|      } else if (size_ > 0) {
  ------------------
  |  Branch (142:18): [True: 0, False: 0]
  ------------------
  143|      0|        std::memcpy(patch_buffer_ + kSlopBytes, data, size_);
  144|      0|        next_chunk_ = patch_buffer_;
  145|      0|        buffer_end_ = patch_buffer_ + size_;
  146|      0|        if (aliasing_ >= kNoDelta) aliasing_ = kOnPatch;
  ------------------
  |  Branch (146:13): [True: 0, False: 0]
  ------------------
  147|      0|        return patch_buffer_;
  148|      0|      }
  149|      0|      ABSL_DCHECK(size_ == 0) << size_;
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  150|      0|    }
  151|      0|    overall_limit_ = 0;  // Next failed, no more needs for next
  152|      0|  }
  153|       |  // End of stream or array
  154|      2|  if (aliasing_ == kNoDelta) {
  ------------------
  |  Branch (154:7): [True: 0, False: 2]
  ------------------
  155|       |    // If there is no more block and aliasing is true, the previous block
  156|       |    // is still valid and we can alias. We have users relying on string_view's
  157|       |    // obtained from protos to outlive the proto, when the parse was from an
  158|       |    // array. This guarantees string_view's are always aliased if parsed from
  159|       |    // an array.
  160|      0|    aliasing_ = reinterpret_cast<std::uintptr_t>(buffer_end_) -
  161|      0|                reinterpret_cast<std::uintptr_t>(patch_buffer_);
  162|      0|  }
  163|      2|  next_chunk_ = nullptr;
  164|      2|  buffer_end_ = patch_buffer_ + kSlopBytes;
  165|      2|  size_ = 0;
  166|      2|  return patch_buffer_;
  167|      2|}
_ZN6google8protobuf8internal18EpsCopyInputStream12DoneFallbackEii:
  184|      2|                                                              int depth) {
  185|       |  // Did we exceeded the limit (parse error).
  186|      2|  if (ABSL_PREDICT_FALSE(overrun > limit_)) return {nullptr, true};
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  187|      2|  ABSL_DCHECK(overrun != limit_);  // Guaranteed by caller.
  ------------------
  |  |   47|      2|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      2|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      6|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      2|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      4|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      4|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 2, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      2|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 2]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      2|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 2, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      6|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      6|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  188|      2|  ABSL_DCHECK(overrun < limit_);   // Follows from above
  ------------------
  |  |   47|      2|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      2|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      6|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      2|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      4|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      4|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 2, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      2|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 2]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      2|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 2, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      6|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      6|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  189|       |  // TODO Instead of this dcheck we could just assign, and remove
  190|       |  // updating the limit_end from PopLimit, ie.
  191|       |  // limit_end_ = buffer_end_ + (std::min)(0, limit_);
  192|       |  // if (ptr < limit_end_) return {ptr, false};
  193|      2|  ABSL_DCHECK(limit_end_ == buffer_end_ + (std::min)(0, limit_));
  ------------------
  |  |   47|      2|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      2|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      6|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      2|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      4|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      4|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 2, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      2|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 2]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      2|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 2, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      6|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      6|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  194|       |  // At this point we know the following assertion holds.
  195|      2|  ABSL_DCHECK_GT(limit_, 0);
  ------------------
  |  |   84|      2|  ABSL_LOG_INTERNAL_DCHECK_GT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   97|      2|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      2|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 2]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      2|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  196|      2|  ABSL_DCHECK(limit_end_ == buffer_end_);  // because limit_ > 0
  ------------------
  |  |   47|      2|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      2|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      4|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      2|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|      4|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|      4|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 2, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|      2|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 2]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|      2|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 2, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      4|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      4|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  197|      2|  const char* p;
  198|      2|  do {
  199|       |    // We are past the end of buffer_end_, in the slop region.
  200|      2|    ABSL_DCHECK_GE(overrun, 0);
  ------------------
  |  |   82|      2|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|      2|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      2|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 2]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      2|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  201|      2|    p = NextBuffer(overrun, depth);
  202|      2|    if (p == nullptr) {
  ------------------
  |  Branch (202:9): [True: 0, False: 2]
  ------------------
  203|       |      // We are at the end of the stream
  204|      0|      if (ABSL_PREDICT_FALSE(overrun != 0)) return {nullptr, true};
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  205|      0|      ABSL_DCHECK_GT(limit_, 0);
  ------------------
  |  |   84|      0|  ABSL_LOG_INTERNAL_DCHECK_GT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   97|      0|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      0|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 0]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      0|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  206|      0|      limit_end_ = buffer_end_;
  207|       |      // Distinguish ending on a pushed limit or ending on end-of-stream.
  208|      0|      SetEndOfStream();
  209|      0|      return {buffer_end_, true};
  210|      0|    }
  211|      2|    limit_ -= buffer_end_ - p;  // Adjust limit_ relative to new anchor
  212|      2|    p += overrun;
  213|      2|    overrun = p - buffer_end_;
  214|      2|  } while (overrun >= 0);
  ------------------
  |  Branch (214:12): [True: 0, False: 2]
  ------------------
  215|      2|  limit_end_ = buffer_end_ + std::min(0, limit_);
  216|      2|  return {p, false};
  217|      2|}

_ZN6google8protobuf8internal18EpsCopyInputStreamC2Eb:
  121|      2|      : aliasing_(enable_aliasing ? kOnPatch : kNoAliasing) {}
  ------------------
  |  Branch (121:19): [True: 0, False: 2]
  ------------------
_ZN6google8protobuf8internal18EpsCopyInputStream10LimitTokenC2Ev:
  140|    600|    LimitToken() { internal::PoisonMemoryRegion(&token_, sizeof(token_)); }
_ZN6google8protobuf8internal18EpsCopyInputStream10LimitTokenC2Ei:
  142|    600|    explicit LimitToken(int token) : token_(token) {
  143|    600|      internal::UnpoisonMemoryRegion(&token_, sizeof(token_));
  144|    600|    }
_ZN6google8protobuf8internal18EpsCopyInputStream10LimitTokenC2EOS3_:
  149|    600|    LimitToken(LimitToken&& other) { *this = std::move(other); }
_ZN6google8protobuf8internal18EpsCopyInputStream10LimitTokenaSEOS3_:
  151|  1.20k|    LimitToken& operator=(LimitToken&& other) {
  152|  1.20k|      internal::UnpoisonMemoryRegion(&token_, sizeof(token_));
  153|  1.20k|      token_ = other.token_;
  154|  1.20k|      internal::PoisonMemoryRegion(&other.token_, sizeof(token_));
  155|  1.20k|      return *this;
  156|  1.20k|    }
_ZN6google8protobuf8internal18EpsCopyInputStream10LimitTokenD2Ev:
  158|  1.80k|    ~LimitToken() { internal::UnpoisonMemoryRegion(&token_, sizeof(token_)); }
_ZNO6google8protobuf8internal18EpsCopyInputStream10LimitToken5tokenEv:
  160|    600|    int token() && {
  161|    600|      int t = token_;
  162|    600|      internal::PoisonMemoryRegion(&token_, sizeof(token_));
  163|    600|      return t;
  164|    600|    }
_ZN6google8protobuf8internal18EpsCopyInputStream9PushLimitEPKci:
  171|    600|  [[nodiscard]] LimitToken PushLimit(const char* ptr, int limit) {
  172|    600|    ABSL_DCHECK(limit >= 0 && limit <= INT_MAX - kSlopBytes);
  ------------------
  |  |   47|    600|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|    600|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.20k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|    600|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.20k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.20k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 600, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|    600|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 600]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|    600|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 600, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.20k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.20k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  173|       |    // This add is safe due to the invariant above, because
  174|       |    // ptr - buffer_end_ <= kSlopBytes.
  175|    600|    limit += static_cast<int>(ptr - buffer_end_);
  176|    600|    if (ABSL_PREDICT_TRUE(limit <= 0)) {
  ------------------
  |  |  191|    600|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 598, False: 2]
  |  |  |  Branch (191:48): [Folded, False: 600]
  |  |  |  Branch (191:57): [True: 598, False: 2]
  |  |  ------------------
  ------------------
  177|    598|      limit_end_ = buffer_end_ + limit;
  178|    598|    } else {
  179|      2|      limit_end_ = buffer_end_;
  180|      2|    }
  181|    600|    auto old_limit = limit_;
  182|    600|    limit_ = limit;
  183|    600|    return LimitToken(old_limit - limit);
  184|    600|  }
_ZN6google8protobuf8internal18EpsCopyInputStream8PopLimitENS2_10LimitTokenE:
  186|    600|  [[nodiscard]] bool PopLimit(LimitToken delta) {
  187|       |    // We must update the limit first before the early return. Otherwise, we can
  188|       |    // end up with an invalid limit and it can lead to integer overflows.
  189|    600|    int old_limit = limit_ + std::move(delta).token();
  190|    600|    limit_ = old_limit;
  191|    600|    if (ABSL_PREDICT_FALSE(!EndedAtLimit())) return false;
  ------------------
  |  |  190|    600|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 600]
  |  |  |  Branch (190:49): [Folded, False: 600]
  |  |  |  Branch (190:58): [True: 0, False: 600]
  |  |  ------------------
  ------------------
  192|       |    // TODO We could remove this line and hoist the code to
  193|       |    // DoneFallback. Study the perf/bin-size effects.
  194|    600|    if (ABSL_PREDICT_TRUE(old_limit <= 0)) {
  ------------------
  |  |  191|    600|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 4, False: 596]
  |  |  |  Branch (191:48): [Folded, False: 600]
  |  |  |  Branch (191:57): [True: 4, False: 596]
  |  |  ------------------
  ------------------
  195|      4|      limit_end_ = buffer_end_ + old_limit;
  196|    596|    } else {
  197|    596|      limit_end_ = buffer_end_;
  198|    596|    }
  199|    600|    return true;
  200|    600|  }
_ZN6google8protobuf8internal18EpsCopyInputStream10ReadStringEPKciPNSt3__112basic_stringIcNS5_11char_traitsIcEENS5_9allocatorIcEEEE:
  209|    596|                                       std::string* s) {
  210|    596|    if (CanReadFromPtr(size, ptr)) {
  ------------------
  |  Branch (210:9): [True: 596, False: 0]
  ------------------
  211|       |      // Fundamentally we just want to do assign to the string.
  212|       |      // However micro-benchmarks regress on string reading cases. So we copy
  213|       |      // the same logic from the old CodedInputStream ReadString. Note: as of
  214|       |      // Apr 2021, this is still a significant win over `assign()`.
  215|    596|      absl::strings_internal::STLStringResizeUninitialized(s, size);
  216|    596|      char* z = &(*s)[0];
  217|    596|      memcpy(z, ptr, size);
  218|    596|      return ptr + size;
  219|    596|    }
  220|      0|    return ReadStringFallback(ptr, size, s);
  221|    596|  }
_ZNK6google8protobuf8internal18EpsCopyInputStream7LastTagEv:
  302|    604|  PROTOBUF_FUTURE_ADD_EARLY_NODISCARD uint32_t LastTag() const {
  303|    604|    return last_tag_minus_1_ + 1;
  304|    604|  }
_ZNK6google8protobuf8internal18EpsCopyInputStream12EndedAtLimitEv:
  310|    602|  PROTOBUF_FUTURE_ADD_EARLY_NODISCARD bool EndedAtLimit() const {
  311|    602|    return last_tag_minus_1_ == 0;
  312|    602|  }
_ZN6google8protobuf8internal18EpsCopyInputStream13DataAvailableEPKc:
  336|  2.32k|  PROTOBUF_FUTURE_ADD_EARLY_NODISCARD bool DataAvailable(const char* ptr) {
  337|  2.32k|    return ptr < limit_end_;
  338|  2.32k|  }
_ZNK6google8protobuf8internal18EpsCopyInputStream14BytesAvailableEPKc:
  341|    596|      const char* ptr) const {
  342|    596|    ABSL_DCHECK_NE(ptr, nullptr);
  ------------------
  |  |   76|    596|  ABSL_LOG_INTERNAL_DCHECK_NE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   89|    596|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    596|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 596]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    596|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  343|    596|    ptrdiff_t available = buffer_end_ + kSlopBytes - ptr;
  344|    596|    ABSL_DCHECK_GE(available, 0);
  ------------------
  |  |   82|    596|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|    596|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    596|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 596]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    596|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  345|    596|    ABSL_DCHECK_LE(available, INT_MAX);
  ------------------
  |  |   78|    596|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|    596|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    596|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 596]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    596|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  346|    596|    return static_cast<int>(available);
  347|    596|  }
_ZN6google8protobuf8internal18EpsCopyInputStream18WireFormatNoOpSink5FlushEPKc:
  455|    604|    void Flush(const char* p) {}
_ZN6google8protobuf8internal18EpsCopyInputStream18WireFormatNoOpSink5ResetEPKc:
  457|    604|    void Reset(const char* p) {}
_ZN6google8protobuf8internal18EpsCopyInputStream8InitFromENSt3__117basic_string_viewIcNS3_11char_traitsIcEEEE:
  489|      2|  const char* InitFrom(absl::string_view flat) {
  490|      2|    overall_limit_ = 0;
  491|      2|    if (flat.size() > kSlopBytes) {
  ------------------
  |  Branch (491:9): [True: 2, False: 0]
  ------------------
  492|      2|      limit_ = kSlopBytes;
  493|      2|      limit_end_ = buffer_end_ = flat.data() + flat.size() - kSlopBytes;
  494|      2|      next_chunk_ = patch_buffer_;
  495|      2|      if (aliasing_ == kOnPatch) aliasing_ = kNoDelta;
  ------------------
  |  Branch (495:11): [True: 0, False: 2]
  ------------------
  496|      2|      return flat.data();
  497|      2|    } else {
  498|      0|      if (!flat.empty()) {
  ------------------
  |  Branch (498:11): [True: 0, False: 0]
  ------------------
  499|      0|        std::memcpy(patch_buffer_, flat.data(), flat.size());
  500|      0|      }
  501|      0|      limit_ = 0;
  502|      0|      limit_end_ = buffer_end_ = patch_buffer_ + flat.size();
  503|      0|      next_chunk_ = nullptr;
  504|      0|      if (aliasing_ == kOnPatch) {
  ------------------
  |  Branch (504:11): [True: 0, False: 0]
  ------------------
  505|      0|        aliasing_ = reinterpret_cast<std::uintptr_t>(flat.data()) -
  506|      0|                    reinterpret_cast<std::uintptr_t>(patch_buffer_);
  507|      0|      }
  508|      0|      return patch_buffer_;
  509|      0|    }
  510|      2|  }
_ZN6google8protobuf8internal12ParseContext4DoneEPPKc:
  729|  1.20k|  PROTOBUF_FUTURE_ADD_EARLY_NODISCARD bool Done(const char** ptr) {
  730|  1.20k|    WireFormatNoOpSink sink;
  731|  1.20k|    return DoneWithCheck(ptr, group_depth_, sink);
  732|  1.20k|  }
_ZN6google8protobuf8internal12EndianHelperILi1EE4LoadEPKv:
  871|  1.19k|  static uint8_t Load(const void* p) { return *static_cast<const uint8_t*>(p); }
_ZN6google8protobuf8internal12EndianHelperILi2EE4LoadEPKv:
  876|  1.72k|  static uint16_t Load(const void* p) {
  877|  1.72k|    uint16_t tmp;
  878|  1.72k|    std::memcpy(&tmp, p, 2);
  879|  1.72k|    return little_endian::ToHost(tmp);
  880|  1.72k|  }
_ZN6google8protobuf8internal12EndianHelperILi4EE4LoadEPKv:
  885|    596|  static uint32_t Load(const void* p) {
  886|    596|    uint32_t tmp;
  887|    596|    std::memcpy(&tmp, p, 4);
  888|    596|    return little_endian::ToHost(tmp);
  889|    596|  }
_ZN6google8protobuf8internal10RotateLeftImEET_S3_i:
 1247|      2|    RotateLeft(T x, int s) noexcept {
 1248|      2|  return static_cast<T>(x << (s & (std::numeric_limits<T>::digits - 1))) |
 1249|      2|         static_cast<T>(x >> ((-s) & (std::numeric_limits<T>::digits - 1)));
 1250|      2|}
_ZN6google8protobuf8internal26RotRight7AndReplaceLowByteEmc:
 1253|      2|RotRight7AndReplaceLowByte(uint64_t res, const char byte) {
 1254|       |  // TODO: remove the inline assembly
 1255|      2|#if defined(__x86_64__) && defined(__GNUC__)
 1256|       |  // This will only use one register for `res`.
 1257|       |  // `byte` comes as a reference to allow the compiler to generate code like:
 1258|       |  //
 1259|       |  //   rorq    $7, %rcx
 1260|       |  //   movb    1(%rax), %cl
 1261|       |  //
 1262|       |  // which avoids loading the incoming bytes into a separate register first.
 1263|      2|  asm("ror $7,%0\n\t"
 1264|      2|      "movb %1,%b0"
 1265|      2|      : "+r"(res)
 1266|      2|      : "m"(byte));
 1267|       |#else
 1268|       |  res = RotateLeft(res, -7);
 1269|       |  res = res & ~0xFF;
 1270|       |  res |= 0xFF & byte;
 1271|       |#endif
 1272|      2|  return res;
 1273|      2|}
_ZN6google8protobuf8internal14ReadTagInlinedEPKcPj:
 1277|      2|                                                  uint32_t* out) {
 1278|      2|  uint64_t res = 0xFF & ptr[0];
 1279|      2|  if (ABSL_PREDICT_FALSE(res >= 128)) {
  ------------------
  |  |  190|      2|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 2, False: 0]
  |  |  |  Branch (190:49): [Folded, False: 2]
  |  |  |  Branch (190:58): [True: 2, False: 0]
  |  |  ------------------
  ------------------
 1280|      2|    res = RotRight7AndReplaceLowByte(res, ptr[1]);
 1281|      2|    if (ABSL_PREDICT_FALSE(res & 0x80)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1282|      0|      res = RotRight7AndReplaceLowByte(res, ptr[2]);
 1283|      0|      if (ABSL_PREDICT_FALSE(res & 0x80)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1284|      0|        res = RotRight7AndReplaceLowByte(res, ptr[3]);
 1285|      0|        if (ABSL_PREDICT_FALSE(res & 0x80)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1286|       |          // Note: this wouldn't work if res were 32-bit,
 1287|       |          // because then replacing the low byte would overwrite
 1288|       |          // the bottom 4 bits of the result.
 1289|      0|          res = RotRight7AndReplaceLowByte(res, ptr[4]);
 1290|      0|          if (ABSL_PREDICT_FALSE(res & 0x80)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
 1291|       |            // The proto format does not permit longer than 5-byte encodings for
 1292|       |            // tags.
 1293|      0|            *out = 0;
 1294|      0|            return nullptr;
 1295|      0|          }
 1296|      0|          *out = static_cast<uint32_t>(RotateLeft(res, 28));
 1297|      0|#if defined(__GNUC__)
 1298|       |          // Note: this asm statement prevents the compiler from
 1299|       |          // trying to share the "return ptr + constant" among all
 1300|       |          // branches.
 1301|      0|          asm("" : "+r"(ptr));
 1302|      0|#endif
 1303|      0|          return ptr + 5;
 1304|      0|        }
 1305|      0|        *out = static_cast<uint32_t>(RotateLeft(res, 21));
 1306|      0|        return ptr + 4;
 1307|      0|      }
 1308|      0|      *out = static_cast<uint32_t>(RotateLeft(res, 14));
 1309|      0|      return ptr + 3;
 1310|      0|    }
 1311|      2|    *out = static_cast<uint32_t>(RotateLeft(res, 7));
 1312|      2|    return ptr + 2;
 1313|      2|  }
 1314|      0|  *out = static_cast<uint32_t>(res);
 1315|      0|  return ptr + 1;
 1316|      2|}
_ZN6google8protobuf8internal8ReadSizeEPPKc:
 1374|  1.19k|inline uint32_t ReadSize(const char** pp) {
 1375|  1.19k|  auto p = *pp;
 1376|  1.19k|  uint32_t res = static_cast<uint8_t>(p[0]);
 1377|  1.19k|  if (res < 128) {
  ------------------
  |  Branch (1377:7): [True: 1.19k, False: 0]
  ------------------
 1378|  1.19k|    *pp = p + 1;
 1379|  1.19k|    return res;
 1380|  1.19k|  }
 1381|      0|  auto x = ReadSizeFallback(p, res);
 1382|      0|  *pp = x.first;
 1383|      0|  return x.second;
 1384|  1.19k|}
_ZN6google8protobuf8internal12ParseContext35ReadSizeAndPushLimitAndDepthInlinedEPKcPNS1_18EpsCopyInputStream10LimitTokenE:
 1454|    600|    const char* ptr, LimitToken* old_limit) {
 1455|    600|  int size = ReadSize(&ptr);
 1456|    600|  if (ABSL_PREDICT_FALSE(!ptr) || depth_ <= 0) {
  ------------------
  |  |  190|  1.20k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 600]
  |  |  |  Branch (190:49): [Folded, False: 600]
  |  |  |  Branch (190:58): [True: 0, False: 600]
  |  |  ------------------
  ------------------
  |  Branch (1456:35): [True: 0, False: 600]
  ------------------
 1457|      0|    return nullptr;
 1458|      0|  }
 1459|    600|  *old_limit = PushLimit(ptr, size);
 1460|    600|  --depth_;
 1461|    600|  return ptr;
 1462|    600|}
_ZN6google8protobuf8internal18EpsCopyInputStream13DoneWithCheckINS2_18WireFormatNoOpSinkEEEbPPKciRT_:
  465|  1.20k|  bool DoneWithCheck(const char** ptr, int d, SinkT& sink) {
  466|  1.20k|    ABSL_DCHECK(*ptr);
  ------------------
  |  |   47|  1.20k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|  1.20k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  2.41k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|  1.20k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  2.41k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  2.41k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 1.20k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|  1.20k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 1.20k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|  1.20k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 1.20k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  2.41k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  2.41k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  467|  1.20k|    if (ABSL_PREDICT_TRUE(*ptr < limit_end_)) return false;
  ------------------
  |  |  191|  1.20k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 602, False: 604]
  |  |  |  Branch (191:48): [Folded, False: 1.20k]
  |  |  |  Branch (191:57): [True: 602, False: 604]
  |  |  ------------------
  ------------------
  468|    604|    int overrun = static_cast<int>(*ptr - buffer_end_);
  469|    604|    ABSL_DCHECK_LE(overrun, kSlopBytes);  // Guaranteed by parse loop.
  ------------------
  |  |   78|    604|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|    604|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    604|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 604]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    604|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  470|    604|    if (overrun ==
  ------------------
  |  Branch (470:9): [True: 602, False: 2]
  ------------------
  471|    604|        limit_) {  //  No need to flip buffers if we ended on a limit.
  472|       |      // Flush up to *ptr since we're done with it.
  473|    602|      sink.Flush(*ptr);
  474|    602|      sink.Reset(*ptr);
  475|       |      // If we actually overrun the buffer and next_chunk_ is null, it means
  476|       |      // the stream ended and we passed the stream end.
  477|    602|      if (overrun > 0 && next_chunk_ == nullptr) *ptr = nullptr;
  ------------------
  |  Branch (477:11): [True: 0, False: 602]
  |  Branch (477:26): [True: 0, False: 0]
  ------------------
  478|    602|      return true;
  479|    602|    }
  480|       |    // Flush up to *ptr before updating it.
  481|      2|    sink.Flush(*ptr);
  482|      2|    auto res = DoneFallback(overrun, d);
  483|      2|    *ptr = res.first;
  484|       |    // Reset the sink to the new start pointer.
  485|      2|    sink.Reset(res.first);
  486|      2|    return res.second;
  487|    604|  }
_ZN6google8protobuf8internal13UnalignedLoadItEET_PKc:
  902|  1.72k|PROTOBUF_FUTURE_ADD_EARLY_NODISCARD T UnalignedLoad(const char* p) {
  903|  1.72k|  auto tmp = EndianHelper<sizeof(T)>::Load(p);
  904|  1.72k|  T res;
  905|  1.72k|  memcpy(&res, &tmp, sizeof(T));
  906|  1.72k|  return res;
  907|  1.72k|}
_ZN6google8protobuf8internal13UnalignedLoadIjEET_PKc:
  902|    596|PROTOBUF_FUTURE_ADD_EARLY_NODISCARD T UnalignedLoad(const char* p) {
  903|    596|  auto tmp = EndianHelper<sizeof(T)>::Load(p);
  904|    596|  T res;
  905|    596|  memcpy(&res, &tmp, sizeof(T));
  906|    596|  return res;
  907|    596|}
_ZN6google8protobuf8internal13UnalignedLoadIhEET_PKc:
  902|  1.19k|PROTOBUF_FUTURE_ADD_EARLY_NODISCARD T UnalignedLoad(const char* p) {
  903|  1.19k|  auto tmp = EndianHelper<sizeof(T)>::Load(p);
  904|  1.19k|  T res;
  905|  1.19k|  memcpy(&res, &tmp, sizeof(T));
  906|  1.19k|  return res;
  907|  1.19k|}
_ZN6google8protobuf8internal12ParseContext27ParseLengthDelimitedInlinedIZNS1_8TcParser27SingularParseMessageAuxImplIhLb0ELb1EEEPKcPNS0_11MessageLiteES7_PS2_NS1_11TcFieldDataEPKNS1_16TcParseTableBaseEmEUlS7_E_EES7_S7_RKT_:
 1421|      4|ParseContext::ParseLengthDelimitedInlined(const char* ptr, const Func& func) {
 1422|      4|  LimitToken old;
 1423|      4|  ptr = ReadSizeAndPushLimitAndDepthInlined(ptr, &old);
 1424|      4|  if (ptr == nullptr) return ptr;
  ------------------
  |  Branch (1424:7): [True: 0, False: 4]
  ------------------
 1425|      4|  auto old_depth = depth_;
 1426|      4|  PROTOBUF_ALWAYS_INLINE_CALL ptr = func(ptr);
  ------------------
  |  |  174|      4|#define PROTOBUF_ALWAYS_INLINE_CALL [[clang::always_inline]]
  ------------------
 1427|      4|  if (ptr != nullptr) ABSL_DCHECK_EQ(old_depth, depth_);
  ------------------
  |  |   74|      4|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|      4|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      4|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 4]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      4|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  |  Branch (1427:7): [True: 4, False: 0]
  ------------------
 1428|      4|  depth_++;
 1429|      4|  if (!PopLimit(std::move(old))) return nullptr;
  ------------------
  |  Branch (1429:7): [True: 0, False: 4]
  ------------------
 1430|      4|  return ptr;
 1431|      4|}
_ZN6google8protobuf8internal12ParseContext27ParseLengthDelimitedInlinedIZNS1_8TcParser27RepeatedParseMessageAuxImplIhLb0ELb1EEEPKcPNS0_11MessageLiteES7_PS2_NS1_11TcFieldDataEPKNS1_16TcParseTableBaseEmEUlS7_E_EES7_S7_RKT_:
 1421|    596|ParseContext::ParseLengthDelimitedInlined(const char* ptr, const Func& func) {
 1422|    596|  LimitToken old;
 1423|    596|  ptr = ReadSizeAndPushLimitAndDepthInlined(ptr, &old);
 1424|    596|  if (ptr == nullptr) return ptr;
  ------------------
  |  Branch (1424:7): [True: 0, False: 596]
  ------------------
 1425|    596|  auto old_depth = depth_;
 1426|    596|  PROTOBUF_ALWAYS_INLINE_CALL ptr = func(ptr);
  ------------------
  |  |  174|    596|#define PROTOBUF_ALWAYS_INLINE_CALL [[clang::always_inline]]
  ------------------
 1427|    596|  if (ptr != nullptr) ABSL_DCHECK_EQ(old_depth, depth_);
  ------------------
  |  |   74|    596|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|    596|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|    596|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 596]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|    596|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  |  Branch (1427:7): [True: 596, False: 0]
  ------------------
 1428|    596|  depth_++;
 1429|    596|  if (!PopLimit(std::move(old))) return nullptr;
  ------------------
  |  Branch (1429:7): [True: 0, False: 596]
  ------------------
 1430|    596|  return ptr;
 1431|    596|}
_ZN6google8protobuf8internal12ParseContextC2IJRNSt3__117basic_string_viewIcNS4_11char_traitsIcEEEEEEEibPPKcDpOT_:
  697|      2|      : EpsCopyInputStream(aliasing), depth_(depth) {
  698|      2|    *start = InitFrom(std::forward<T>(args)...);
  699|      2|  }

_ZN6google8protobuf8internal8TSanReadEPKv:
  730|  2.34G|PROTOBUF_ALWAYS_INLINE void TSanRead(const void*) {}
_ZN6google8protobuf8internal9TSanWriteEPKv:
  731|   884M|PROTOBUF_ALWAYS_INLINE void TSanWrite(const void*) {}
_ZN6google8protobuf8internal8AllocateEm:
  141|   828k|PROTOBUF_ALWAYS_INLINE PROTOBUF_MALLOC void* Allocate(size_t size) {
  142|   828k|#if ABSL_HAVE_BUILTIN(__builtin_operator_new)
  143|       |  // Allows the compiler to merge or optimize away the allocation even if it
  144|       |  // would violate the observability guarantees of ::operator new.
  145|   828k|  return __builtin_operator_new(size);
  146|       |#else
  147|       |  return ::operator new(size);
  148|       |#endif
  149|   828k|}
_ZN6google8protobuf8internal16NoopDebugCounter6IncLogEm:
  824|    600|  constexpr void IncLog(uint64_t) {}
_ZNK6google8protobuf8internal26GlobalEmptyStringConstexpr4InitEv:
  867|      2|  std::string* Init() const { return nullptr; }
_ZN6google8protobuf8internal15AllocateAtLeastEm:
  155|   542k|inline SizedPtr AllocateAtLeast(size_t size) {
  156|       |#if !defined(NDEBUG) && defined(ABSL_HAVE_THREAD_LOCAL) && \
  157|       |    defined(__cpp_inline_variables)
  158|       |  if (allocate_at_least_hook != nullptr) {
  159|       |    return allocate_at_least_hook(size, allocate_at_least_hook_context);
  160|       |  }
  161|       |#endif  // !NDEBUG && ABSL_HAVE_THREAD_LOCAL && __cpp_inline_variables
  162|   542k|  return {Allocate(size), size};
  163|   542k|}
_ZN6google8protobuf8internal11SizedDeleteEPvm:
  165|   828k|inline void SizedDelete(void* p, size_t size) {
  166|   828k|#if defined(__cpp_sized_deallocation)
  167|   828k|  ::operator delete(p, size);
  168|       |#else
  169|       |  // Avoid -Wunused-parameter
  170|       |  (void)size;
  171|       |  ::operator delete(p);
  172|       |#endif
  173|   828k|}
_ZN6google8protobuf8internal18PoisonMemoryRegionEPKvm:
  639|   625k|                               [[maybe_unused]] size_t n) {
  640|       |#if defined(ABSL_HAVE_ADDRESS_SANITIZER)
  641|       |  ASAN_POISON_MEMORY_REGION(p, n);
  642|       |#else
  643|       |  // Nothing
  644|   625k|#endif
  645|   625k|}
_ZN6google8protobuf8internal20UnpoisonMemoryRegionEPKvm:
  648|   158M|                                 [[maybe_unused]] size_t n) {
  649|       |#if defined(ABSL_HAVE_ADDRESS_SANITIZER)
  650|       |  static const bool kReallyHasMemoryPoisoning = [] {
  651|       |    // Test if poisoning is on. `allow_user_poisoning=0` would disable it.
  652|       |    // There is no official API for this, so we just probe.
  653|       |    alignas(8) char buf[8];
  654|       |    ASAN_POISON_MEMORY_REGION(buf, sizeof(buf));
  655|       |    bool res = __asan_address_is_poisoned(buf);
  656|       |    ASAN_UNPOISON_MEMORY_REGION(buf, sizeof(buf));
  657|       |    return res;
  658|       |  }();
  659|       |  if (kReallyHasMemoryPoisoning) {
  660|       |    ASAN_UNPOISON_MEMORY_REGION(p, n);
  661|       |  } else {
  662|       |    // When in ASan but with memory poisoning off, we still want to clear
  663|       |    // container annotations from such memory.
  664|       |    // We annotate the whole block as usable.
  665|       |    ABSL_ANNOTATE_CONTIGUOUS_CONTAINER(p, static_cast<const char*>(p) + n, p,
  666|       |                                       static_cast<const char*>(p) + n);
  667|       |  }
  668|       |#else
  669|       |  // Nothing
  670|   158M|#endif
  671|   158M|}
_ZN6google8protobuf8internal7LaunderINS0_11MessageLiteEEEPT_S5_:
  747|    600|constexpr T* Launder(T* p) {
  748|    600|#if defined(__cpp_lib_launder) && __cpp_lib_launder >= 201606L
  749|    600|  return std::launder(p);
  750|       |#elif ABSL_HAVE_BUILTIN(__builtin_launder)
  751|       |  return __builtin_launder(p);
  752|       |#else
  753|       |  return p;
  754|       |#endif
  755|    600|}
_ZN6google8protobuf8internal13StrongPointerIPNS1_16DummyWeakDefaultETnT_XadL_ZNS1_18dummy_weak_defaultEEEEEvv:
   74|      2|PROTOBUF_ALWAYS_INLINE void StrongPointer() {
   75|       |  // This injects a relocation in the code path without having to run code, but
   76|       |  // we can only do it with a newer clang.
   77|      2|  asm(".reloc ., BFD_RELOC_NONE, %p0" ::"Ws"(ptr));
   78|      2|}

_ZN6google8protobuf8internal20CalculateReserveSizeIPvLi8EEEiii:
 1502|   114k|inline int CalculateReserveSize(int capacity, int new_size) {
 1503|   114k|  constexpr int lower_limit =
 1504|   114k|      RepeatedFieldLowerClampLimit<T, kHeapRepHeaderSize>();
 1505|   114k|  if (new_size < lower_limit) {
  ------------------
  |  Branch (1505:7): [True: 0, False: 114k]
  ------------------
 1506|       |    // Clamp to smallest allowed size.
 1507|      0|    return lower_limit;
 1508|      0|  }
 1509|   114k|  constexpr int kMaxSizeBeforeClamp =
 1510|   114k|      (std::numeric_limits<int>::max() - kHeapRepHeaderSize) / 2;
 1511|   114k|  if (ABSL_PREDICT_FALSE(capacity > kMaxSizeBeforeClamp)) {
  ------------------
  |  |  190|   114k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 114k]
  |  |  |  Branch (190:49): [Folded, False: 114k]
  |  |  |  Branch (190:58): [True: 0, False: 114k]
  |  |  ------------------
  ------------------
 1512|      0|    return std::numeric_limits<int>::max();
 1513|      0|  }
 1514|   114k|  constexpr int kSooCapacityElements = SooCapacityElements<T>();
 1515|   114k|  if (kSooCapacityElements > 0 && kSooCapacityElements < lower_limit) {
  ------------------
  |  Branch (1515:7): [True: 0, Folded]
  |  Branch (1515:35): [Folded, False: 0]
  ------------------
 1516|       |    // In this case, we need to set capacity to 0 here to ensure power-of-two
 1517|       |    // sized allocations.
 1518|      0|    if (capacity < lower_limit) capacity = 0;
  ------------------
  |  Branch (1518:9): [True: 0, False: 0]
  ------------------
 1519|   114k|  } else {
 1520|   229k|    ABSL_DCHECK(capacity == 0 || capacity >= lower_limit)
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   114k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   114k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   229k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   229k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 114k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   114k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 114k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   114k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 114k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   114k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|   114k|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1521|   229k|        << capacity << " " << lower_limit;
 1522|   114k|  }
 1523|       |  // We want to double the number of bytes, not the number of elements, to try
 1524|       |  // to stay within power-of-two allocations.
 1525|       |  // The allocation has kHeapRepHeaderSize + sizeof(T) * capacity.
 1526|   114k|  int doubled_size = 2 * capacity + kHeapRepHeaderSize / sizeof(T);
 1527|   114k|  return std::max(doubled_size, new_size);
 1528|   114k|}

_ZN6google8protobuf8internal20RepeatedPtrFieldBase14InternalExtendEiPNS0_5ArenaE:
   46|   114k|void** RepeatedPtrFieldBase::InternalExtend(int extend_amount, Arena* arena) {
   47|   114k|  ABSL_DCHECK(extend_amount > 0);
  ------------------
  |  |   47|   114k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   114k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   229k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   114k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   229k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   229k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 114k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   114k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 114k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   114k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 114k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   229k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   229k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   48|   114k|  ABSL_DCHECK_EQ(arena, GetArena());
  ------------------
  |  |   74|   114k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   114k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   114k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 114k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   114k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   49|   114k|  constexpr size_t kPtrSize = sizeof(rep()->elements[0]);
   50|   114k|  constexpr size_t kMaxSize = std::numeric_limits<size_t>::max();
   51|   114k|  constexpr size_t kMaxCapacity = (kMaxSize - kRepHeaderSize) / kPtrSize;
   52|   114k|  const int old_capacity = Capacity();
   53|   114k|  Rep* new_rep = nullptr;
   54|       |
   55|   114k|  int new_capacity = internal::CalculateReserveSize<void*, kRepHeaderSize>(
   56|   114k|      old_capacity, old_capacity + extend_amount);
   57|   114k|  {
   58|   114k|    ABSL_DCHECK_LE(new_capacity, kMaxCapacity)
  ------------------
  |  |   78|      0|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   114k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   114k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 114k]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   114k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   59|      0|        << "New capacity is too large to fit into internal representation";
   60|   114k|    const size_t new_size = kRepHeaderSize + kPtrSize * new_capacity;
   61|   114k|    if (arena == nullptr) {
  ------------------
  |  Branch (61:9): [True: 16, False: 114k]
  ------------------
   62|     16|      const internal::SizedPtr alloc = internal::AllocateAtLeast(new_size);
   63|     16|      new_capacity = static_cast<int>((alloc.n - kRepHeaderSize) / kPtrSize);
   64|     16|      new_rep = reinterpret_cast<Rep*>(alloc.p);
   65|   114k|    } else {
   66|   114k|      auto* alloc = Arena::CreateArray<char>(arena, new_size);
   67|   114k|      new_rep = reinterpret_cast<Rep*>(alloc);
   68|   114k|    }
   69|   114k|  }
   70|       |
   71|   114k|  if (using_sso()) {
  ------------------
  |  Branch (71:7): [True: 17.2k, False: 97.2k]
  ------------------
   72|  17.2k|    new_rep->capacity = new_capacity;
   73|  17.2k|    new_rep->allocated_size = tagged_rep_or_elem_ != nullptr ? 1 : 0;
  ------------------
  |  Branch (73:31): [True: 17.2k, False: 0]
  ------------------
   74|  17.2k|    new_rep->elements[0] = tagged_rep_or_elem_;
   75|  97.2k|  } else {
   76|  97.2k|    Rep* old_rep = rep();
   77|  97.2k|    new_rep->capacity = new_capacity;
   78|  97.2k|    new_rep->allocated_size = old_rep->allocated_size;
   79|  97.2k|    memcpy(new_rep->elements, old_rep->elements,
   80|  97.2k|           new_rep->allocated_size * kPtrSize);
   81|  97.2k|    size_t old_total_size = old_capacity * kPtrSize + kRepHeaderSize;
   82|  97.2k|    if (arena == nullptr) {
  ------------------
  |  Branch (82:9): [True: 14, False: 97.2k]
  ------------------
   83|     14|      internal::SizedDelete(old_rep, old_total_size);
   84|  97.2k|    } else {
   85|  97.2k|      arena->ReturnArrayMemory(old_rep, old_total_size);
   86|  97.2k|    }
   87|  97.2k|  }
   88|       |
   89|   114k|  tagged_rep_or_elem_ =
   90|   114k|      reinterpret_cast<void*>(reinterpret_cast<uintptr_t>(new_rep) + 1);
   91|       |
   92|   114k|  return &new_rep->elements[current_size_];
   93|   114k|}

_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE4sizeEv:
 1740|   416M|inline int RepeatedPtrField<Element>::size() const {
 1741|   416M|  return RepeatedPtrFieldBase::size();
 1742|   416M|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase4sizeEv:
  227|  1.00G|  int size() const {
  228|  1.00G|    int res = current_size_;
  229|  1.00G|    PROTOBUF_ASSUME(res >= 0);
  ------------------
  |  |  733|  1.00G|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  230|  1.00G|    return res;
  231|  1.00G|  }
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE7MutableEi:
 1764|    596|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1765|    596|  return RepeatedPtrFieldBase::Mutable<TypeHandler>(index);
 1766|    596|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase7MutableINS1_18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEEEEEPNT_4TypeEi:
  259|    596|  Value<TypeHandler>* Mutable(int index) {
  260|    596|    RuntimeAssertInBounds(index, size());
  261|    596|    return cast<TypeHandler>(element_at(index));
  262|    596|  }
_ZN6google8protobuf8internal21RuntimeAssertInBoundsEii:
  130|   591M|PROTOBUF_EXPORT inline void RuntimeAssertInBounds(int index, int size) {
  131|       |  if constexpr (GetBoundsCheckMode() == BoundsCheckMode::kAbort) {
  132|       |    if (ABSL_PREDICT_FALSE(index < 0 || index >= size)) {
  133|       |      // "No merge" attribute used to improve debuggability by telling the
  134|       |      // compiler not to merge these failure paths. Note that this is currently
  135|       |      // best-effort in clang/llvm.
  136|       |      PROTOBUF_NO_MERGE LogIndexOutOfBoundsAndAbort(index, size);
  137|       |    }
  138|       |  }
  139|   591M|  ABSL_DCHECK_GE(index, 0);
  ------------------
  |  |   82|   591M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   591M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   591M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 591M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   591M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  140|   591M|  ABSL_DCHECK_LT(index, size);
  ------------------
  |  |   80|   591M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|   591M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   591M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 591M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   591M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  141|   591M|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEEEEEPNT_4TypeEPv:
  811|    596|  static inline Value<TypeHandler>* cast(void* element) {
  812|    596|    return reinterpret_cast<Value<TypeHandler>*>(element);
  813|    596|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase10element_atEi:
  782|   591M|  void*& element_at(int index) {
  783|   591M|    if (using_sso()) {
  ------------------
  |  Branch (783:9): [True: 0, False: 591M]
  ------------------
  784|      0|      ABSL_DCHECK_EQ(index, 0);
  ------------------
  |  |   74|      0|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|      0|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|      0|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 0]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|      0|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  785|      0|      return tagged_rep_or_elem_;
  786|      0|    }
  787|   591M|    return rep()->elements[index];
  788|   591M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase9using_ssoEv:
  806|  1.06G|  bool using_sso() const {
  807|  1.06G|    return (reinterpret_cast<uintptr_t>(tagged_rep_or_elem_) & 1) == 0;
  808|  1.06G|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3repEv:
  797|  1.06G|  Rep* rep() {
  798|  1.06G|    ABSL_DCHECK(!using_sso());
  ------------------
  |  |   47|  1.06G|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|  1.06G|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  2.12G|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|  1.06G|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  2.12G|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  2.12G|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 1.06G, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|  1.06G|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 1.06G]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|  1.06G|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 1.06G, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  2.12G|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  2.12G|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  799|  1.06G|    return reinterpret_cast<Rep*>(
  800|  1.06G|        reinterpret_cast<uintptr_t>(tagged_rep_or_elem_) - 1);
  801|  1.06G|  }
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE20InternalAddWithArenaENS0_8internal18InternalVisibilityEPNS0_5ArenaE:
 1776|   157M|    internal::InternalVisibility, Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1777|   157M|  return AddWithArena(arena);
 1778|   157M|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE12AddWithArenaEPNS0_5ArenaE:
 1782|   157M|    Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1783|   157M|  return RepeatedPtrFieldBase::Add<TypeHandler>(arena);
 1784|   157M|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3AddINS1_18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEEEEEPNT_4TypeEPNS0_5ArenaE:
  265|   157M|  Value<TypeHandler>* Add(Arena* arena) {
  266|   157M|    return cast<TypeHandler>(AddInternal(arena, TypeHandler::GetNewFunc()));
  267|   157M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEEEEEPNT_4TypeEPv:
  811|   157M|  static inline Value<TypeHandler>* cast(void* element) {
  812|   157M|    return reinterpret_cast<Value<TypeHandler>*>(element);
  813|   157M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase11AddInternalEPNS0_5ArenaEN4absl12lts_2026081711FunctionRefIFvS4_RPvEEE:
  910|   157M|    Arena* arena, absl::FunctionRef<ElementNewFn> factory) {
  911|   157M|  ABSL_DCHECK_EQ(arena, GetArena());
  ------------------
  |  |   74|   157M|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   157M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   157M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 157M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   157M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  912|   157M|  if (tagged_rep_or_elem_ == nullptr) {
  ------------------
  |  Branch (912:7): [True: 18.9k, False: 157M]
  ------------------
  913|  18.9k|    ExchangeCurrentSize(1);
  914|  18.9k|    factory(arena, tagged_rep_or_elem_);
  915|  18.9k|    return tagged_rep_or_elem_;
  916|  18.9k|  }
  917|   157M|  absl::PrefetchToLocalCache(tagged_rep_or_elem_);
  918|   157M|  if (using_sso()) {
  ------------------
  |  Branch (918:7): [True: 17.2k, False: 157M]
  ------------------
  919|  17.2k|    if (current_size_ == 0) {
  ------------------
  |  Branch (919:9): [True: 0, False: 17.2k]
  ------------------
  920|      0|      ExchangeCurrentSize(1);
  921|      0|      return tagged_rep_or_elem_;
  922|      0|    }
  923|  17.2k|    void*& result = *InternalExtend(1, arena);
  924|  17.2k|    factory(arena, result);
  925|  17.2k|    Rep* r = rep();
  926|  17.2k|    r->allocated_size = 2;
  927|  17.2k|    ExchangeCurrentSize(2);
  928|  17.2k|    return result;
  929|  17.2k|  }
  930|   157M|  Rep* r = rep();
  931|   157M|  if (ABSL_PREDICT_FALSE(SizeAtCapacity())) {
  ------------------
  |  |  190|   157M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 97.2k, False: 157M]
  |  |  |  Branch (190:49): [Folded, False: 157M]
  |  |  |  Branch (190:58): [True: 97.2k, False: 157M]
  |  |  ------------------
  ------------------
  932|  97.2k|    InternalExtend(1, arena);
  933|  97.2k|    r = rep();
  934|   157M|  } else {
  935|   157M|    if (ClearedCount() > 0) {
  ------------------
  |  Branch (935:9): [True: 0, False: 157M]
  ------------------
  936|      0|      return r->elements[ExchangeCurrentSize(current_size_ + 1)];
  937|      0|    }
  938|   157M|  }
  939|   157M|  ++r->allocated_size;
  940|   157M|  void*& result = r->elements[ExchangeCurrentSize(current_size_ + 1)];
  941|   157M|  factory(arena, result);
  942|   157M|  return result;
  943|   157M|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase19ExchangeCurrentSizeEi:
  759|   157M|  inline int ExchangeCurrentSize(int new_size) {
  760|   157M|    return std::exchange(current_size_, new_size);
  761|   157M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase14SizeAtCapacityEv:
  762|   157M|  inline bool SizeAtCapacity() const {
  763|       |    // Harden invariant size() <= allocated_size() <= Capacity().
  764|   157M|    ABSL_DCHECK_LE(size(), allocated_size());
  ------------------
  |  |   78|   157M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   157M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   157M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 157M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   157M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  765|   157M|    ABSL_DCHECK_LE(allocated_size(), Capacity());
  ------------------
  |  |   78|   157M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   157M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   157M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 157M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   157M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  766|   157M|    return current_size_ == Capacity();
  767|   157M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8CapacityEv:
  238|   157M|  int Capacity() const {
  239|   157M|    int res = using_sso() ? kSSOCapacity : rep()->capacity;
  ------------------
  |  Branch (239:15): [True: 17.2k, False: 157M]
  ------------------
  240|   157M|    PROTOBUF_ASSUME(res >= 0);
  ------------------
  |  |  733|   157M|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  241|   157M|    return res;
  242|   157M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase3repEv:
  802|   314M|  const Rep* rep() const {
  803|   314M|    return const_cast<RepeatedPtrFieldBase*>(this)->rep();
  804|   314M|  }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase12ClearedCountEv:
  642|   157M|  int ClearedCount() const { return allocated_size() - current_size_; }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase14allocated_sizeEv:
  793|   157M|  int allocated_size() const {
  794|   157M|    return using_sso() ? (tagged_rep_or_elem_ != nullptr ? 1 : 0)
  ------------------
  |  Branch (794:12): [True: 0, False: 157M]
  |  Branch (794:27): [True: 0, False: 0]
  ------------------
  795|   157M|                       : rep()->allocated_size;
  796|   157M|  }
_ZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEv:
 1059|   157M|  static constexpr auto GetNewFunc() {
 1060|   157M|    return [](Arena* arena, void*& ptr) {
 1061|   157M|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|   157M|    };
 1063|   157M|  }
_ZZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece31SentencePieceText_SentencePieceEE10GetNewFuncEvENKUlPNS0_5ArenaERPvE_clES7_S9_:
 1060|   157M|    return [](Arena* arena, void*& ptr) {
 1061|   157M|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|   157M|    };
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE20InternalAddWithArenaENS0_8internal18InternalVisibilityEPNS0_5ArenaE:
 1776|  9.29k|    internal::InternalVisibility, Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1777|  9.29k|  return AddWithArena(arena);
 1778|  9.29k|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE12AddWithArenaEPNS0_5ArenaE:
 1782|  9.29k|    Arena* arena) ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1783|  9.29k|  return RepeatedPtrFieldBase::Add<TypeHandler>(arena);
 1784|  9.29k|}
_ZN6google8protobuf8internal20RepeatedPtrFieldBase3AddINS1_18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEEEEEPNT_4TypeEPNS0_5ArenaE:
  265|  9.29k|  Value<TypeHandler>* Add(Arena* arena) {
  266|  9.29k|    return cast<TypeHandler>(AddInternal(arena, TypeHandler::GetNewFunc()));
  267|  9.29k|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEEEEEPNT_4TypeEPv:
  811|  9.29k|  static inline Value<TypeHandler>* cast(void* element) {
  812|  9.29k|    return reinterpret_cast<Value<TypeHandler>*>(element);
  813|  9.29k|  }
_ZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEv:
 1059|  9.29k|  static constexpr auto GetNewFunc() {
 1060|  9.29k|    return [](Arena* arena, void*& ptr) {
 1061|  9.29k|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|  9.29k|    };
 1063|  9.29k|  }
_ZZN6google8protobuf8internal18GenericTypeHandlerIN13sentencepiece17SentencePieceTextEE10GetNewFuncEvENKUlPNS0_5ArenaERPvE_clES7_S9_:
 1060|  9.29k|    return [](Arena* arena, void*& ptr) {
 1061|  9.29k|      ptr = Arena::DefaultConstruct<Type>(arena);
 1062|  9.29k|    };
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase10element_atEi:
  789|   591M|  const void* element_at(int index) const {
  790|   591M|    return const_cast<RepeatedPtrFieldBase*>(this)->element_at(index);
  791|   591M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerINS0_11MessageLiteEEEEEPNT_4TypeEPv:
  811|    596|  static inline Value<TypeHandler>* cast(void* element) {
  812|    596|    return reinterpret_cast<Value<TypeHandler>*>(element);
  813|    596|  }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE4sizeEv:
 1740|  27.5k|inline int RepeatedPtrField<Element>::size() const {
 1741|  27.5k|  return RepeatedPtrFieldBase::size();
 1742|  27.5k|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE4sizeEv:
 1740|  9.19k|inline int RepeatedPtrField<Element>::size() const {
 1741|  9.19k|  return RepeatedPtrFieldBase::size();
 1742|  9.19k|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE5beginEv:
 2409|  4.59k|RepeatedPtrField<Element>::begin() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2410|  4.59k|  return iterator(raw_data());
 2411|  4.59k|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8raw_dataEv:
  489|  38.1k|  void* const* raw_data() const { return elements(); }
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase8elementsEv:
  775|  38.1k|  void* const* elements() const {
  776|  38.1k|    return using_sso() ? &tagged_rep_or_elem_ : +rep()->elements;
  ------------------
  |  Branch (776:12): [True: 3.64k, False: 34.5k]
  ------------------
  777|  38.1k|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece17SentencePieceTextEEC2EPKPv:
 2169|  9.19k|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEC2IS4_vEERKNS2_IT_EE:
 2177|  9.19k|      : it_(other.it_) {}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEE3endEv:
 2424|  4.59k|RepeatedPtrField<Element>::end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2425|  4.59k|  return iterator(raw_data() + size());
 2426|  4.59k|}
_ZN6google8protobuf8internalneERKNS1_19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEES8_:
 2203|  13.8k|  friend bool operator!=(const iterator& x, const iterator& y) {
 2204|  13.8k|    return x.it_ != y.it_;
 2205|  13.8k|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEppEv:
 2188|  9.29k|  iterator& operator++() {
 2189|  9.29k|    ++it_;
 2190|  9.29k|    return *this;
 2191|  9.29k|  }
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece17SentencePieceTextEEdeEv:
 2180|  9.29k|  PROTOBUF_FUTURE_ADD_NODISCARD reference operator*() const {
 2181|  9.29k|    return *reinterpret_cast<Element*>(*it_);
 2182|  9.29k|  }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE5beginEv:
 2409|  14.4k|RepeatedPtrField<Element>::begin() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2410|  14.4k|  return iterator(raw_data());
 2411|  14.4k|}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece31SentencePieceText_SentencePieceEEC2EPKPv:
 2169|  28.9k|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEC2IS4_vEERKNS2_IT_EE:
 2177|  28.9k|      : it_(other.it_) {}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEE3endEv:
 2424|  14.4k|RepeatedPtrField<Element>::end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2425|  14.4k|  return iterator(raw_data() + size());
 2426|  14.4k|}
_ZN6google8protobuf8internalneERKNS1_19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEES8_:
 2203|   157M|  friend bool operator!=(const iterator& x, const iterator& y) {
 2204|   157M|    return x.it_ != y.it_;
 2205|   157M|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEppEv:
 2188|   157M|  iterator& operator++() {
 2189|   157M|    ++it_;
 2190|   157M|    return *this;
 2191|   157M|  }
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece31SentencePieceText_SentencePieceEEdeEv:
 2180|   157M|  PROTOBUF_FUTURE_ADD_NODISCARD reference operator*() const {
 2181|   157M|    return *reinterpret_cast<Element*>(*it_);
 2182|   157M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBaseC2ENS1_22InternalMetadataOffsetE:
  211|  19.0k|      : tagged_rep_or_elem_(nullptr), current_size_(0), resolver_(offset) {}
_ZN6google8protobuf8internal18GenericTypeHandlerINS0_11MessageLiteEE23GetNewFromPrototypeFuncEPKS3_:
 1082|    596|  static constexpr auto GetNewFromPrototypeFunc(const Type* prototype) {
 1083|    596|    static_assert(std::is_base_of_v<MessageLite, Type>);
 1084|    596|    ABSL_DCHECK(prototype != nullptr);
  ------------------
  |  |   47|    596|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|    596|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.19k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|    596|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.19k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.19k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 596, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|    596|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 596]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|    596|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 596, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.19k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.19k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 1085|    596|    return
 1086|    596|        [prototype](Arena* arena, void*& ptr) { ptr = prototype->New(arena); };
 1087|    596|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase16AddFromPrototypeINS1_18GenericTypeHandlerINS0_11MessageLiteEEEEEPNT_4TypeEPNS0_5ArenaEPKS8_:
  376|    596|      Arena* arena, const Value<TypeHandler>* prototype) {
  377|    596|    using H = CommonHandler<TypeHandler>;
  378|    596|    Value<TypeHandler>* result = cast<TypeHandler>(
  379|    596|        AddInternal(arena, H::GetNewFromPrototypeFunc(prototype)));
  380|    596|    return result;
  381|    596|  }
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE3GetEi:
 1746|   591M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1747|   591M|  return RepeatedPtrFieldBase::Get<TypeHandler>(index);
 1748|   591M|}
_ZNK6google8protobuf8internal20RepeatedPtrFieldBase3GetINS1_18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEEEEERKNT_4TypeEi:
  354|   591M|  PROTOBUF_FUTURE_ADD_NODISCARD const Value<TypeHandler>& Get(int index) const {
  355|       |    if constexpr (GetBoundsCheckMode() == BoundsCheckMode::kReturnDefault) {
  356|       |      if (ABSL_PREDICT_FALSE(index < 0 || index >= size())) {
  357|       |        // `default_instance()` is not supported for MessageLite and Message.
  358|       |        if constexpr (TypeHandler::has_default_instance()) {
  359|       |          LogIndexOutOfBounds(index, current_size_);
  360|       |          return TypeHandler::default_instance();
  361|       |        }
  362|       |      }
  363|       |    }
  364|       |    // We refactor this to a separate function instead of inlining it so we
  365|       |    // can measure the performance impact more easily.
  366|   591M|    RuntimeAssertInBounds(index, size());
  367|   591M|    return *cast<TypeHandler>(element_at(index));
  368|   591M|  }
_ZN6google8protobuf8internal20RepeatedPtrFieldBase4castINS1_18GenericTypeHandlerIN13sentencepiece24ModelProto_SentencePieceEEEEEPKNT_4TypeEPKv:
  815|   591M|  static inline const Value<TypeHandler>* cast(const void* element) {
  816|   591M|    return reinterpret_cast<const Value<TypeHandler>*>(element);
  817|   591M|  }
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEEC2ENS0_8internal18InternalVisibilityENS5_22InternalMetadataOffsetE:
 1236|  14.4k|      : RepeatedPtrField(offset) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece31SentencePieceText_SentencePieceEEC2ENS0_8internal22InternalMetadataOffsetE:
 1627|  14.4k|    : RepeatedPtrFieldBase(offset) {
 1628|       |  // We can't have StaticValidityCheck here because that requires Element to be
 1629|       |  // a complete type, and in split repeated fields cases, we call
 1630|       |  // CreateMessage<RepeatedPtrField<T>> for incomplete Ts.
 1631|  14.4k|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEEC2ENS0_8internal18InternalVisibilityENS5_22InternalMetadataOffsetE:
 1236|  4.59k|      : RepeatedPtrField(offset) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece17SentencePieceTextEEC2ENS0_8internal22InternalMetadataOffsetE:
 1627|  4.59k|    : RepeatedPtrFieldBase(offset) {
 1628|       |  // We can't have StaticValidityCheck here because that requires Element to be
 1629|       |  // a complete type, and in split repeated fields cases, we call
 1630|       |  // CreateMessage<RepeatedPtrField<T>> for incomplete Ts.
 1631|  4.59k|}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEEC2ENS0_8internal18InternalVisibilityENS5_22InternalMetadataOffsetE:
 1236|      2|      : RepeatedPtrField(offset) {}
_ZN6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEEC2ENS0_8internal22InternalMetadataOffsetE:
 1627|      2|    : RepeatedPtrFieldBase(offset) {
 1628|       |  // We can't have StaticValidityCheck here because that requires Element to be
 1629|       |  // a complete type, and in split repeated fields cases, we call
 1630|       |  // CreateMessage<RepeatedPtrField<T>> for incomplete Ts.
 1631|      2|}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE5beginEv:
 2409|      2|RepeatedPtrField<Element>::begin() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2410|      2|  return iterator(raw_data());
 2411|      2|}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIN13sentencepiece24ModelProto_SentencePieceEEC2EPKPv:
 2169|      4|  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEC2IS4_vEERKNS2_IT_EE:
 2177|      4|      : it_(other.it_) {}
_ZNK6google8protobuf16RepeatedPtrFieldIN13sentencepiece24ModelProto_SentencePieceEE3endEv:
 2424|      2|RepeatedPtrField<Element>::end() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 2425|      2|  return iterator(raw_data() + size());
 2426|      2|}
_ZN6google8protobuf8internalneERKNS1_19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEES8_:
 2203|    598|  friend bool operator!=(const iterator& x, const iterator& y) {
 2204|    598|    return x.it_ != y.it_;
 2205|    598|  }
_ZN6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEppEv:
 2188|    596|  iterator& operator++() {
 2189|    596|    ++it_;
 2190|    596|    return *this;
 2191|    596|  }
_ZNK6google8protobuf8internal19RepeatedPtrIteratorIKN13sentencepiece24ModelProto_SentencePieceEEdeEv:
 2180|    596|  PROTOBUF_FUTURE_ADD_NODISCARD reference operator*() const {
 2181|    596|    return *reinterpret_cast<Element*>(*it_);
 2182|    596|  }
_ZZN6google8protobuf8internal18GenericTypeHandlerINS0_11MessageLiteEE23GetNewFromPrototypeFuncEPKS3_ENKUlPNS0_5ArenaERPvE_clES8_SA_:
 1086|    596|        [prototype](Arena* arena, void*& ptr) { ptr = prototype->New(arena); };

_ZN6google8protobuf8internal10ArenaBlockC2EPS2_m:
   43|   542k|  ArenaBlock(ArenaBlock* next, size_t size) : next(next), size(size) {
   44|   542k|    ABSL_DCHECK_GT(size, sizeof(ArenaBlock));
  ------------------
  |  |   84|   542k|  ABSL_LOG_INTERNAL_DCHECK_GT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   97|   542k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   542k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 542k]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   542k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   45|   542k|  }
_ZN6google8protobuf8internal10ArenaBlock7PointerEm:
   47|  1.61M|  char* Pointer(size_t n) {
   48|  1.61M|    ABSL_DCHECK_LE(n, size);
  ------------------
  |  |   78|  1.61M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|  1.61M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  1.61M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 1.61M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  1.61M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   49|  1.61M|    return reinterpret_cast<char*>(this) + n;
   50|  1.61M|  }
_ZN6google8protobuf8internal10ArenaBlock5LimitEv:
   51|   542k|  char* Limit() { return Pointer(size & static_cast<size_t>(-8)); }
_ZNK6google8protobuf8internal10ArenaBlock8IsSentryEv:
   53|   542k|  bool IsSentry() const { return size == 0; }
_ZN6google8protobuf8internal11SerialArena11CleanupListEv:
   85|  9.80k|  void CleanupList() { cleanup_list_.Cleanup(*this); }
_ZNK6google8protobuf8internal11SerialArena14SpaceAllocatedEv:
   86|  9.80k|  uint64_t SpaceAllocated() const {
   87|  9.80k|    return space_allocated_.load(std::memory_order_relaxed);
   88|  9.80k|  }
_ZN6google8protobuf8internal11SerialArena26TryAllocateFromCachedBlockEm:
   92|   114k|  PROTOBUF_ALWAYS_INLINE void* TryAllocateFromCachedBlock(size_t size) {
   93|   114k|    if (ABSL_PREDICT_FALSE(size < 16)) return nullptr;
  ------------------
  |  |  190|   114k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 0, False: 114k]
  |  |  |  Branch (190:49): [Folded, False: 114k]
  |  |  |  Branch (190:58): [True: 0, False: 114k]
  |  |  ------------------
  ------------------
   94|       |    // We round up to the next larger block in case the memory doesn't match
   95|       |    // the pattern we are looking for.
   96|   114k|    const size_t index = absl::bit_width(size - 1) - 4;
   97|       |
   98|   114k|    if (ABSL_PREDICT_FALSE(index >= cached_block_length_)) return nullptr;
  ------------------
  |  |  190|   114k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 33.9k, False: 80.5k]
  |  |  |  Branch (190:49): [Folded, False: 114k]
  |  |  |  Branch (190:58): [True: 33.9k, False: 80.5k]
  |  |  ------------------
  ------------------
   99|  80.5k|    auto& cached_head = cached_blocks_[index];
  100|  80.5k|    if (cached_head == nullptr) return nullptr;
  ------------------
  |  Branch (100:9): [True: 51.7k, False: 28.8k]
  ------------------
  101|       |
  102|  28.8k|    void* ret = cached_head;
  103|  28.8k|    internal::UnpoisonMemoryRegion(ret, size);
  104|  28.8k|    cached_head = cached_head->next;
  105|  28.8k|    return ret;
  106|  80.5k|  }
_ZN6google8protobuf8internal11SerialArena17ReturnArrayMemoryEPvm:
  151|  97.2k|  void ReturnArrayMemory(void* p, size_t size) {
  152|       |    // We only need to check for 32-bit platforms.
  153|       |    // In 64-bit platforms the minimum allocation size from Repeated*Field will
  154|       |    // be 16 guaranteed.
  155|  97.2k|    if (sizeof(void*) < 8) {
  ------------------
  |  Branch (155:9): [Folded, False: 97.2k]
  ------------------
  156|      0|      if (ABSL_PREDICT_FALSE(size < 16)) return;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  157|  97.2k|    } else {
  158|  97.2k|      PROTOBUF_ASSUME(size >= 16);
  ------------------
  |  |  733|  97.2k|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  159|  97.2k|    }
  160|       |
  161|       |    // We round down to the next smaller block in case the memory doesn't match
  162|       |    // the pattern we are looking for. eg, someone might have called Reserve()
  163|       |    // on the repeated field.
  164|  97.2k|    const size_t index = absl::bit_width(size) - 5;
  165|       |
  166|  97.2k|    if (ABSL_PREDICT_FALSE(index >= cached_block_length_)) {
  ------------------
  |  |  190|  97.2k|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 16.2k, False: 81.0k]
  |  |  |  Branch (190:49): [Folded, False: 97.2k]
  |  |  |  Branch (190:58): [True: 16.2k, False: 81.0k]
  |  |  ------------------
  ------------------
  167|       |      // We can't put this object on the freelist so make this object the
  168|       |      // freelist. It is guaranteed it is larger than the one we have, and
  169|       |      // large enough to hold another allocation of `size`.
  170|  16.2k|      CachedBlock** new_list = static_cast<CachedBlock**>(p);
  171|  16.2k|      size_t new_size = size / sizeof(CachedBlock*);
  172|       |
  173|  16.2k|      std::copy(cached_blocks_, cached_blocks_ + cached_block_length_,
  174|  16.2k|                new_list);
  175|       |
  176|       |      // We need to unpoison this memory before filling it in case it has been
  177|       |      // poisoned by another sanitizer client.
  178|  16.2k|      internal::UnpoisonMemoryRegion(
  179|  16.2k|          new_list + cached_block_length_,
  180|  16.2k|          (new_size - cached_block_length_) * sizeof(CachedBlock*));
  181|       |
  182|  16.2k|      std::fill(new_list + cached_block_length_, new_list + new_size, nullptr);
  183|       |
  184|  16.2k|      cached_blocks_ = new_list;
  185|       |      // Make the size fit in uint8_t. This is the power of two, so we don't
  186|       |      // need anything larger.
  187|  16.2k|      cached_block_length_ =
  188|  16.2k|          static_cast<uint8_t>(std::min(size_t{64}, new_size));
  189|       |
  190|  16.2k|      return;
  191|  16.2k|    }
  192|       |
  193|  81.0k|    auto& cached_head = cached_blocks_[index];
  194|  81.0k|    auto* new_node = static_cast<CachedBlock*>(p);
  195|  81.0k|    new_node->next = cached_head;
  196|  81.0k|    cached_head = new_node;
  197|  81.0k|    internal::PoisonMemoryRegion(p, size);
  198|  81.0k|  }
_ZN6google8protobuf8internal11SerialArena20MaybeAllocateAlignedEmPPv:
  201|   158M|  bool MaybeAllocateAligned(size_t n, void** out) {
  202|   158M|    ABSL_DCHECK(internal::ArenaAlignDefault::IsAligned(n));
  ------------------
  |  |   47|   158M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   158M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   317M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   158M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   317M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   317M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 158M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   158M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 158M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   158M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 158M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   317M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   317M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  203|   158M|    ABSL_DCHECK_GE(limit_, ptr());
  ------------------
  |  |   82|   158M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   158M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   158M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 158M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   158M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  204|   158M|    char* ret = ptr();
  205|   158M|    if (ABSL_PREDICT_FALSE(limit_ - ret < static_cast<ptrdiff_t>(n))) {
  ------------------
  |  |  190|   158M|#define ABSL_PREDICT_FALSE(x) (__builtin_expect(false || (x), false))
  |  |  ------------------
  |  |  |  Branch (190:31): [True: 828k, False: 158M]
  |  |  |  Branch (190:49): [Folded, False: 158M]
  |  |  |  Branch (190:58): [True: 828k, False: 158M]
  |  |  ------------------
  ------------------
  206|   828k|      return false;
  207|   828k|    }
  208|   158M|    internal::UnpoisonMemoryRegion(ret, n);
  209|   158M|    *out = ret;
  210|   158M|    char* next = ret + n;
  211|   158M|    set_ptr(next);
  212|   158M|    MaybePrefetchData(next);
  213|   158M|    return true;
  214|   158M|  }
_ZN6google8protobuf8internal11SerialArena17MaybePrefetchImplElPKcS4_S4_:
  281|   158M|                                       const char* prefetch_ptr) {
  282|   158M|    if (ABSL_PREDICT_TRUE(prefetch_ptr - next > prefetch_degree))
  ------------------
  |  |  191|   158M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 139M, False: 18.8M]
  |  |  |  Branch (191:48): [Folded, False: 158M]
  |  |  |  Branch (191:57): [True: 139M, False: 18.8M]
  |  |  ------------------
  ------------------
  283|   139M|      return prefetch_ptr;
  284|  18.8M|    if (ABSL_PREDICT_TRUE(prefetch_ptr < limit)) {
  ------------------
  |  |  191|  18.8M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 12.1M, False: 6.74M]
  |  |  |  Branch (191:48): [Folded, False: 18.8M]
  |  |  |  Branch (191:57): [True: 12.1M, False: 6.74M]
  |  |  ------------------
  ------------------
  285|  12.1M|      prefetch_ptr = std::max(next, prefetch_ptr);
  286|  12.1M|      ABSL_DCHECK(prefetch_ptr != nullptr);
  ------------------
  |  |   47|  12.1M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|  12.1M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  24.2M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|  12.1M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  24.2M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  24.2M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 12.1M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|  12.1M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 12.1M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|  12.1M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 12.1M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  24.2M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  24.2M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  287|  12.1M|      const char* end = std::min(limit, prefetch_ptr + prefetch_degree);
  288|   202M|      for (; prefetch_ptr < end; prefetch_ptr += ABSL_CACHELINE_SIZE) {
  ------------------
  |  |   89|   189M|#define ABSL_CACHELINE_SIZE 64
  ------------------
  |  Branch (288:14): [True: 189M, False: 12.1M]
  ------------------
  289|   189M|        absl::PrefetchToLocalCacheForWrite(prefetch_ptr);
  290|   189M|      }
  291|  12.1M|    }
  292|  18.8M|    return prefetch_ptr;
  293|  18.8M|  }
_ZN6google8protobuf8internal11SerialArena17MaybePrefetchDataEPKc:
  295|   158M|  void MaybePrefetchData(const char* next) {
  296|   158M|    ABSL_DCHECK(static_cast<const void*>(prefetch_ptr_) == ptr() ||
  ------------------
  |  |   47|   158M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   158M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   316M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   158M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   316M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   316M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 158M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   158M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 158M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   158M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 158M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   316M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   316M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  297|   158M|                static_cast<const void*>(prefetch_ptr_) >= head());
  298|   158M|    prefetch_ptr_ =
  299|   158M|        MaybePrefetchImpl(kPrefetchDataDegree, next, limit_, prefetch_ptr_);
  300|   158M|  }
_ZN6google8protobuf8internal11SerialArena16FreeStringBlocksEv:
  322|  9.80k|  size_t FreeStringBlocks() {
  323|       |    // On the active block delete all strings skipping the unused instances.
  324|  9.80k|    size_t unused_bytes = string_block_unused_.load(std::memory_order_relaxed);
  325|  9.80k|    if (StringBlock* sb = string_block_.load(std::memory_order_relaxed)) {
  ------------------
  |  Branch (325:22): [True: 9.80k, False: 0]
  ------------------
  326|  9.80k|      return FreeStringBlocks(sb, unused_bytes);
  327|  9.80k|    }
  328|      0|    return 0;
  329|  9.80k|  }
_ZN6google8protobuf8internal11SerialArena12AddSpaceUsedEm:
  333|  1.82M|  void AddSpaceUsed(size_t space_used) {
  334|  1.82M|    space_used_.store(space_used_.load(std::memory_order_relaxed) + space_used,
  335|  1.82M|                      std::memory_order_relaxed);
  336|  1.82M|  }
_ZN6google8protobuf8internal11SerialArena17AddSpaceAllocatedEm:
  339|   828k|  void AddSpaceAllocated(size_t space_allocated) {
  340|   828k|    space_allocated_.store(
  341|   828k|        space_allocated_.load(std::memory_order_relaxed) + space_allocated,
  342|   828k|        std::memory_order_relaxed);
  343|   828k|  }
_ZN6google8protobuf8internal11SerialArena4headEv:
  346|   551k|  ArenaBlock* head() { return head_.load(std::memory_order_relaxed); }
_ZN6google8protobuf8internal11SerialArena3ptrEv:
  351|   160M|  char* ptr() { return ptr_.load(std::memory_order_relaxed); }
_ZN6google8protobuf8internal11SerialArena7set_ptrEPc:
  353|   158M|  void set_ptr(char* ptr) { return ptr_.store(ptr, std::memory_order_relaxed); }
_ZN6google8protobuf8internal11SerialArena9set_rangeEPcS3_:
  354|   542k|  PROTOBUF_ALWAYS_INLINE void set_range(char* ptr, char* limit) {
  355|   542k|    set_ptr(ptr);
  356|   542k|    prefetch_ptr_ = ptr;
  357|   542k|    limit_ = limit;
  358|   542k|  }
_ZN6google8protobuf8internal11SerialArena31ArbitraryInternalPointerForInitEv:
  373|  29.4k|  static char* ArbitraryInternalPointerForInit() {
  374|       |    // Use rodata to detect potential bugs. No one should be writing here.
  375|  29.4k|    alignas(8) static constexpr char dummy{};
  376|  29.4k|    return const_cast<char*>(&dummy);
  377|  29.4k|  }
_ZN6google8protobuf8internal11SerialArena19MaybeAllocateStringERPv:
  422|   255M|PROTOBUF_ALWAYS_INLINE bool SerialArena::MaybeAllocateString(void*& p) {
  423|       |  // Check how many unused instances are in the current block.
  424|   255M|  size_t unused_bytes = string_block_unused_.load(std::memory_order_relaxed);
  425|   255M|  if (ABSL_PREDICT_TRUE(unused_bytes != 0)) {
  ------------------
  |  |  191|   255M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 254M, False: 794k]
  |  |  |  Branch (191:48): [Folded, False: 255M]
  |  |  |  Branch (191:57): [True: 254M, False: 794k]
  |  |  ------------------
  ------------------
  426|   254M|    unused_bytes -= sizeof(std::string);
  427|   254M|    string_block_unused_.store(unused_bytes, std::memory_order_relaxed);
  428|   254M|    p = string_block_.load(std::memory_order_relaxed)->AtOffset(unused_bytes);
  429|   254M|    return true;
  430|   254M|  }
  431|   794k|  return false;
  432|   255M|}
_ZN6google8protobuf8internal11SerialArena23AllocateFromStringBlockEv:
  435|   255M|SerialArena::AllocateFromStringBlock() {
  436|   255M|  void* p;
  437|   255M|  if (ABSL_PREDICT_TRUE(MaybeAllocateString(p))) return p;
  ------------------
  |  |  191|   255M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 254M, False: 794k]
  |  |  |  Branch (191:48): [Folded, False: 255M]
  |  |  |  Branch (191:57): [True: 254M, False: 794k]
  |  |  ------------------
  ------------------
  438|   794k|  return AllocateFromStringBlockFallback();
  439|   255M|}
_ZN6google8protobuf8internal11SerialArena15AllocateAlignedILNS1_16AllocationClientE1EEEPvm:
  116|   114k|  void* AllocateAligned(size_t n) {
  117|   114k|    ABSL_DCHECK(internal::ArenaAlignDefault::IsAligned(n));
  ------------------
  |  |   47|   114k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   114k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   229k|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   114k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   229k|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   229k|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 114k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   114k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 114k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   114k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 114k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   229k|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   229k|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  118|   114k|    ABSL_DCHECK_GE(limit_, ptr());
  ------------------
  |  |   82|   114k|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   114k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   114k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 114k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   114k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  119|       |
  120|   114k|    if (alloc_client == AllocationClient::kArray) {
  ------------------
  |  Branch (120:9): [True: 114k, Folded]
  ------------------
  121|   114k|      if (void* res = TryAllocateFromCachedBlock(n)) {
  ------------------
  |  Branch (121:17): [True: 28.8k, False: 85.7k]
  ------------------
  122|  28.8k|        return res;
  123|  28.8k|      }
  124|   114k|    }
  125|       |
  126|  85.7k|    void* ptr;
  127|  85.7k|    if (ABSL_PREDICT_TRUE(MaybeAllocateAligned(n, &ptr))) {
  ------------------
  |  |  191|  85.7k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 54.0k, False: 31.6k]
  |  |  |  Branch (191:48): [Folded, False: 85.7k]
  |  |  |  Branch (191:57): [True: 54.0k, False: 31.6k]
  |  |  ------------------
  ------------------
  128|  54.0k|      return ptr;
  129|  54.0k|    }
  130|  31.6k|    return AllocateAlignedFallback(n);
  131|  85.7k|  }
_ZN6google8protobuf8internal11SerialArena15AllocateAlignedILNS1_16AllocationClientE0EEEPvm:
  116|   157M|  void* AllocateAligned(size_t n) {
  117|   157M|    ABSL_DCHECK(internal::ArenaAlignDefault::IsAligned(n));
  ------------------
  |  |   47|   157M|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   157M|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|   314M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   157M|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|   314M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|   314M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 157M, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   157M|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 157M]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   157M|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 157M, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|   314M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|   314M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  118|   157M|    ABSL_DCHECK_GE(limit_, ptr());
  ------------------
  |  |   82|   157M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   157M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   157M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 157M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   157M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  119|       |
  120|   157M|    if (alloc_client == AllocationClient::kArray) {
  ------------------
  |  Branch (120:9): [Folded, False: 157M]
  ------------------
  121|      0|      if (void* res = TryAllocateFromCachedBlock(n)) {
  ------------------
  |  Branch (121:17): [True: 0, False: 0]
  ------------------
  122|      0|        return res;
  123|      0|      }
  124|      0|    }
  125|       |
  126|   157M|    void* ptr;
  127|   157M|    if (ABSL_PREDICT_TRUE(MaybeAllocateAligned(n, &ptr))) {
  ------------------
  |  |  191|   157M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 156M, False: 510k]
  |  |  |  Branch (191:48): [Folded, False: 157M]
  |  |  |  Branch (191:57): [True: 156M, False: 510k]
  |  |  ------------------
  ------------------
  128|   156M|      return ptr;
  129|   156M|    }
  130|   510k|    return AllocateAlignedFallback(n);
  131|   157M|  }

_ZNK6google8protobuf8internal11StringBlock14allocated_sizeEv:
   74|   572k|  size_t allocated_size() const { return allocated_size_; }
_ZN6google8protobuf8internal11StringBlockC2EPS2_btt:
   94|   794k|      : next_(next),
   95|   794k|        allocated_size_(size),
   96|   794k|        next_size_(next_size),
   97|   794k|        heap_allocated_(heap_allocated) {}
_ZN6google8protobuf8internal11StringBlock8min_sizeEv:
   99|   581k|  static constexpr size_type min_size() { return size_type{256}; }
_ZN6google8protobuf8internal11StringBlock8max_sizeEv:
  100|   784k|  static constexpr size_type max_size() { return size_type{8192}; }
_ZNK6google8protobuf8internal11StringBlock9next_sizeEv:
  107|   784k|  size_t next_size() const { return next_size_; }
_ZN6google8protobuf8internal11StringBlock11RoundedSizeEt:
  115|   794k|constexpr StringBlock::size_type StringBlock::RoundedSize(size_type size) {
  116|   794k|  return size - (size - sizeof(StringBlock)) % sizeof(std::string);
  117|   794k|}
_ZN6google8protobuf8internal11StringBlock8NextSizeEPS2_:
  119|   794k|inline size_t StringBlock::NextSize(StringBlock* block) {
  120|   794k|  return block ? block->next_size() : min_size();
  ------------------
  |  Branch (120:10): [True: 784k, False: 9.80k]
  ------------------
  121|   794k|}
_ZN6google8protobuf8internal11StringBlock7EmplaceEPvmPS2_:
  123|   508k|inline StringBlock* StringBlock::Emplace(void* p, size_t n, StringBlock* next) {
  124|   508k|  const auto count = static_cast<size_type>(n);
  125|   508k|  ABSL_DCHECK_EQ(count, NextSize(next));
  ------------------
  |  |   74|   508k|  ABSL_LOG_INTERNAL_DCHECK_EQ_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   87|   508k|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   508k|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 508k]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   508k|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  126|   508k|  size_type doubled = count * 2;
  127|   508k|  size_type next_size = next ? std::min(doubled, max_size()) : min_size();
  ------------------
  |  Branch (127:25): [True: 508k, False: 0]
  ------------------
  128|   508k|  return new (p) StringBlock(next, false, RoundedSize(count), next_size);
  129|   508k|}
_ZN6google8protobuf8internal11StringBlock3NewEPS2_:
  131|   286k|inline StringBlock* StringBlock::New(StringBlock* next) {
  132|       |  // Compute required size, rounding down to a multiple of sizeof(std:string)
  133|       |  // so that we can optimize the allocation path. I.e., we incur a (constant
  134|       |  // size) MOD() operation cost here to avoid any MUL() later on.
  135|   286k|  size_type size = min_size();
  136|   286k|  size_type next_size = min_size();
  137|   286k|  if (next) {
  ------------------
  |  Branch (137:7): [True: 276k, False: 9.80k]
  ------------------
  138|   276k|    size = next->next_size_;
  139|   276k|    next_size = std::min<size_type>(size * 2, max_size());
  140|   276k|  }
  141|   286k|  size = RoundedSize(size);
  142|   286k|  void* p = Allocate(size);
  143|   286k|  return new (p) StringBlock(next, true, size, next_size);
  144|   286k|}
_ZN6google8protobuf8internal11StringBlock6DeleteEPS2_:
  146|   794k|inline size_t StringBlock::Delete(StringBlock* block) {
  147|   794k|  ABSL_DCHECK(block != nullptr);
  ------------------
  |  |   47|   794k|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|   794k|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|  1.58M|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|   794k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   65|  1.58M|  switch (0)                                             \
  |  |  |  |  |  |  |  |  |  |   66|  1.58M|  case 0:                                                \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 794k, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   67|   794k|  default:                                               \
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 794k]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |   68|   794k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:5): [True: 794k, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|  1.58M|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|  1.58M|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  148|   794k|  if (!block->heap_allocated_) return size_t{0};
  ------------------
  |  Branch (148:7): [True: 508k, False: 286k]
  ------------------
  149|   286k|  size_t size = block->allocated_size();
  150|   286k|  internal::SizedDelete(block, size);
  151|   286k|  return size;
  152|   794k|}
_ZNK6google8protobuf8internal11StringBlock4nextEv:
  154|   794k|inline StringBlock* StringBlock::next() const { return next_; }
_ZNK6google8protobuf8internal11StringBlock14effective_sizeEv:
  156|  2.37M|inline size_t StringBlock::effective_size() const {
  157|  2.37M|  return allocated_size_ - sizeof(StringBlock);
  158|  2.37M|}
_ZN6google8protobuf8internal11StringBlock8AtOffsetEm:
  161|   256M|    size_t offset) {
  162|   256M|  ABSL_DCHECK_LE(offset, effective_size());
  ------------------
  |  |   78|   256M|  ABSL_LOG_INTERNAL_DCHECK_LE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   91|   256M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   256M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 256M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   256M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  163|   256M|  return reinterpret_cast<std::string*>(reinterpret_cast<char*>(this + 1) +
  164|   256M|                                        offset);
  165|   256M|}
_ZN6google8protobuf8internal11StringBlock5beginEv:
  167|   784k|ABSL_ATTRIBUTE_RETURNS_NONNULL inline std::string* StringBlock::begin() {
  168|   784k|  return AtOffset(0);
  169|   784k|}
_ZN6google8protobuf8internal11StringBlock3endEv:
  171|   794k|ABSL_ATTRIBUTE_RETURNS_NONNULL inline std::string* StringBlock::end() {
  172|   794k|  return AtOffset(effective_size());
  173|   794k|}

_ZN6google8protobuf8internal15ThreadSafeArena17ReturnArrayMemoryEPvm:
   82|  97.2k|  void ReturnArrayMemory(void* p, size_t size) {
   83|  97.2k|    SerialArena* arena = nullptr;
   84|  97.2k|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|  97.2k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 97.2k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 97.2k]
  |  |  |  Branch (191:57): [True: 97.2k, False: 0]
  |  |  ------------------
  ------------------
   85|  97.2k|      arena->ReturnArrayMemory(p, size);
   86|  97.2k|    }
   87|  97.2k|  }
_ZNK6google8protobuf8internal15ThreadSafeArena11AllocPolicyEv:
  167|   542k|  const AllocationPolicy* AllocPolicy() const { return alloc_policy_.get(); }
_ZN6google8protobuf8internal15ThreadSafeArena16CacheSerialArenaEPNS1_11SerialArenaE:
  177|  9.80k|  inline void CacheSerialArena(SerialArena* serial) {
  178|  9.80k|    thread_cache().last_serial_arena = serial;
  179|  9.80k|    thread_cache().last_lifecycle_id_seen = tag_and_id_;
  180|  9.80k|  }
_ZN6google8protobuf8internal15ThreadSafeArena18GetSerialArenaFastEPPNS1_11SerialArenaE:
  182|   412M|  PROTOBUF_NDEBUG_INLINE bool GetSerialArenaFast(SerialArena** arena) {
  183|       |    // If this thread already owns a block in this arena then try to use that.
  184|       |    // This fast path optimizes the case where multiple threads allocate from
  185|       |    // the same arena.
  186|   412M|    ThreadCache* tc = &thread_cache();
  187|   412M|    if (ABSL_PREDICT_TRUE(tc->last_lifecycle_id_seen == tag_and_id_)) {
  ------------------
  |  |  191|   412M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 412M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 412M]
  |  |  |  Branch (191:57): [True: 412M, False: 0]
  |  |  ------------------
  ------------------
  188|   412M|      *arena = tc->last_serial_arena;
  189|   412M|      return true;
  190|   412M|    }
  191|      0|    return false;
  192|   412M|  }
_ZN6google8protobuf8internal15ThreadSafeArena14GetSerialArenaEv:
  199|   255M|  SerialArena* GetSerialArena() {
  200|   255M|    SerialArena* arena;
  201|   255M|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|   255M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 255M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 255M]
  |  |  |  Branch (191:57): [True: 255M, False: 0]
  |  |  ------------------
  ------------------
  202|   255M|      return arena;
  203|   255M|    }
  204|      0|    return GetSerialArenaSlow();
  205|   255M|  }
_ZN6google8protobuf8internal15ThreadSafeArena12thread_cacheEv:
  273|   412M|  static ThreadCache& thread_cache() { return thread_cache_; }
_ZN6google8protobuf8internal15ThreadSafeArena15AllocateAlignedILNS1_16AllocationClientE0EEEPvm:
   73|   157M|  void* AllocateAligned(size_t n) {
   74|   157M|    SerialArena* arena;
   75|   157M|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|   157M|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 157M, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 157M]
  |  |  |  Branch (191:57): [True: 157M, False: 0]
  |  |  ------------------
  ------------------
   76|   157M|      return arena->AllocateAligned<alloc_client>(n);
   77|   157M|    } else {
   78|      0|      return AllocateAlignedFallback<alloc_client>(n);
   79|      0|    }
   80|   157M|  }
_ZN6google8protobuf8internal15ThreadSafeArena15AllocateAlignedILNS1_16AllocationClientE1EEEPvm:
   73|   114k|  void* AllocateAligned(size_t n) {
   74|   114k|    SerialArena* arena;
   75|   114k|    if (ABSL_PREDICT_TRUE(GetSerialArenaFast(&arena))) {
  ------------------
  |  |  191|   114k|#define ABSL_PREDICT_TRUE(x) (__builtin_expect(false || (x), true))
  |  |  ------------------
  |  |  |  Branch (191:30): [True: 114k, False: 0]
  |  |  |  Branch (191:48): [Folded, False: 114k]
  |  |  |  Branch (191:57): [True: 114k, False: 0]
  |  |  ------------------
  ------------------
   76|   114k|      return arena->AllocateAligned<alloc_client>(n);
   77|   114k|    } else {
   78|      0|      return AllocateAlignedFallback<alloc_client>(n);
   79|      0|    }
   80|   114k|  }

_ZN6google8protobuf8internal19ShiftMixParseVarintIjLi10EEEPKcS4_Rl:
   55|      2|ShiftMixParseVarint(const char* p, int64_t& res1) {
   56|      2|  using Signed = std::make_signed_t<VarintType>;
   57|      2|  constexpr bool kIs64BitVarint = std::is_same_v<Signed, int64_t>;
   58|      2|  constexpr bool kIs32BitVarint = std::is_same_v<Signed, int32_t>;
   59|      2|  static_assert(kIs64BitVarint || kIs32BitVarint, "");
   60|       |
   61|       |  // The algorithm relies on sign extension for each byte to set all high bits
   62|       |  // when the varint continues. It also relies on asserting all of the lower
   63|       |  // bits for each successive byte read. This allows the result to be aggregated
   64|       |  // using a bitwise AND. For example:
   65|       |  //
   66|       |  //          8       1          64     57 ... 24     17  16      9  8       1
   67|       |  // ptr[0] = 1aaa aaaa ; res1 = 1111 1111 ... 1111 1111  1111 1111  1aaa aaaa
   68|       |  // ptr[1] = 1bbb bbbb ; res2 = 1111 1111 ... 1111 1111  11bb bbbb  b111 1111
   69|       |  // ptr[2] = 0ccc cccc ; res3 = 0000 0000 ... 000c cccc  cc11 1111  1111 1111
   70|       |  //                             ---------------------------------------------
   71|       |  //        res1 & res2 & res3 = 0000 0000 ... 000c cccc  ccbb bbbb  baaa aaaa
   72|       |  //
   73|       |  // On x86-64, a shld from a single register filled with enough 1s in the high
   74|       |  // bits can accomplish all this in one instruction. It so happens that res1
   75|       |  // has 57 high bits of ones, which is enough for the largest shift done.
   76|       |  //
   77|       |  // Just as importantly, by keeping results in res1, res2, and res3, we take
   78|       |  // advantage of the superscalar abilities of the CPU.
   79|      2|  const auto next = [&p] { return static_cast<const int8_t>(*p++); };
   80|      2|  const auto last = [&p] { return static_cast<const int8_t>(p[-1]); };
   81|       |
   82|      2|  int64_t res2, res3;  // accumulated result chunks
   83|      2|  res1 = next();
   84|      2|  if (ABSL_PREDICT_TRUE(res1 >= 0)) return p;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   85|      0|  if (limit <= 1) goto limit0;
  ------------------
  |  Branch (85:7): [Folded, False: 0]
  ------------------
   86|       |
   87|       |  // Densify all ops with explicit FALSE predictions from here on, except that
   88|       |  // we predict length = 5 as a common length for fields like timestamp.
   89|      0|  if (ABSL_PREDICT_FALSE(VarintShl<1>(next(), res1, res2))) goto done1;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   90|      0|  if (limit <= 2) goto limit1;
  ------------------
  |  Branch (90:7): [Folded, False: 0]
  ------------------
   91|      0|  if (ABSL_PREDICT_FALSE(VarintShl<2>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   92|      0|  if (limit <= 3) goto limit2;
  ------------------
  |  Branch (92:7): [Folded, False: 0]
  ------------------
   93|      0|  if (ABSL_PREDICT_FALSE(VarintShlAnd<3>(next(), res1, res2))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   94|      0|  if (limit <= 4) goto limit2;
  ------------------
  |  Branch (94:7): [Folded, False: 0]
  ------------------
   95|      0|  if (ABSL_PREDICT_TRUE(VarintShlAnd<4>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   96|      0|  if (limit <= 5) goto limit2;
  ------------------
  |  Branch (96:7): [Folded, False: 0]
  ------------------
   97|       |
   98|      0|  if (kIs64BitVarint) {
  ------------------
  |  Branch (98:7): [Folded, False: 0]
  ------------------
   99|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<5>(next(), res1, res2))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  100|      0|    if (limit <= 6) goto limit2;
  ------------------
  |  Branch (100:9): [Folded, False: 0]
  ------------------
  101|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<6>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  102|      0|    if (limit <= 7) goto limit2;
  ------------------
  |  Branch (102:9): [Folded, False: 0]
  ------------------
  103|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<7>(next(), res1, res2))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  104|      0|    if (limit <= 8) goto limit2;
  ------------------
  |  Branch (104:9): [Folded, False: 0]
  ------------------
  105|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<8>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  106|      0|    if (limit <= 9) goto limit2;
  ------------------
  |  Branch (106:9): [Folded, False: 0]
  ------------------
  107|      0|  } else {
  108|       |    // An overlong int32 is expected to span the full 10 bytes
  109|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  110|      0|    if (limit <= 6) goto limit2;
  ------------------
  |  Branch (110:9): [Folded, False: 0]
  ------------------
  111|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  112|      0|    if (limit <= 7) goto limit2;
  ------------------
  |  Branch (112:9): [Folded, False: 0]
  ------------------
  113|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  114|      0|    if (limit <= 8) goto limit2;
  ------------------
  |  Branch (114:9): [Folded, False: 0]
  ------------------
  115|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  116|      0|    if (limit <= 9) goto limit2;
  ------------------
  |  Branch (116:9): [Folded, False: 0]
  ------------------
  117|      0|  }
  118|       |
  119|       |  // For valid 64bit varints, the 10th byte/ptr[9] should be exactly 1. In this
  120|       |  // case, the continuation bit of ptr[8] already set the top bit of res3
  121|       |  // correctly, so all we have to do is check that the expected case is true.
  122|      0|  if (ABSL_PREDICT_TRUE(next() == 1)) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  123|       |
  124|      0|  if (ABSL_PREDICT_FALSE(last() & 0x80)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  125|       |    // If the continue bit is set, it is an unterminated varint.
  126|      0|    return nullptr;
  127|      0|  }
  128|       |
  129|       |  // A zero value of the first bit of the 10th byte represents an
  130|       |  // over-serialized varint. This case should not happen, but if does (say, due
  131|       |  // to a nonconforming serializer), deassert the continuation bit that came
  132|       |  // from ptr[8].
  133|      0|  if (kIs64BitVarint && (last() & 1) == 0) {
  ------------------
  |  Branch (133:7): [Folded, False: 0]
  |  Branch (133:25): [True: 0, False: 0]
  ------------------
  134|      0|    static constexpr int bits = 64 - 1;
  135|      0|#if defined(__GCC_ASM_FLAG_OUTPUTS__) && defined(__x86_64__)
  136|       |    // Use a small instruction since this is an uncommon code path.
  137|      0|    asm("btc %[bits], %[res3]" : [res3] "+r"(res3) : [bits] "i"(bits));
  138|       |#else
  139|       |    res3 ^= int64_t{1} << bits;
  140|       |#endif
  141|      0|  }
  142|       |
  143|      0|done2:
  144|      0|  res2 &= res3;
  145|      0|done1:
  146|      0|  res1 &= res2;
  147|      0|  PROTOBUF_ASSUME(p != nullptr);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  148|      0|  return p;
  149|      0|limit2:
  150|      0|  res2 &= res3;
  151|      0|limit1:
  152|      0|  res1 &= res2;
  153|      0|limit0:
  154|      0|  PROTOBUF_ASSUME(p != nullptr);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  155|      0|  PROTOBUF_ASSUME(res1 < 0);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  156|      0|  return p;
  157|      0|}
_ZZN6google8protobuf8internal19ShiftMixParseVarintIjLi10EEEPKcS4_RlENKUlvE_clEv:
   79|      2|  const auto next = [&p] { return static_cast<const int8_t>(*p++); };
_ZN6google8protobuf8internal19ShiftMixParseVarintImLi10EEEPKcS4_Rl:
   55|      2|ShiftMixParseVarint(const char* p, int64_t& res1) {
   56|      2|  using Signed = std::make_signed_t<VarintType>;
   57|      2|  constexpr bool kIs64BitVarint = std::is_same_v<Signed, int64_t>;
   58|      2|  constexpr bool kIs32BitVarint = std::is_same_v<Signed, int32_t>;
   59|      2|  static_assert(kIs64BitVarint || kIs32BitVarint, "");
   60|       |
   61|       |  // The algorithm relies on sign extension for each byte to set all high bits
   62|       |  // when the varint continues. It also relies on asserting all of the lower
   63|       |  // bits for each successive byte read. This allows the result to be aggregated
   64|       |  // using a bitwise AND. For example:
   65|       |  //
   66|       |  //          8       1          64     57 ... 24     17  16      9  8       1
   67|       |  // ptr[0] = 1aaa aaaa ; res1 = 1111 1111 ... 1111 1111  1111 1111  1aaa aaaa
   68|       |  // ptr[1] = 1bbb bbbb ; res2 = 1111 1111 ... 1111 1111  11bb bbbb  b111 1111
   69|       |  // ptr[2] = 0ccc cccc ; res3 = 0000 0000 ... 000c cccc  cc11 1111  1111 1111
   70|       |  //                             ---------------------------------------------
   71|       |  //        res1 & res2 & res3 = 0000 0000 ... 000c cccc  ccbb bbbb  baaa aaaa
   72|       |  //
   73|       |  // On x86-64, a shld from a single register filled with enough 1s in the high
   74|       |  // bits can accomplish all this in one instruction. It so happens that res1
   75|       |  // has 57 high bits of ones, which is enough for the largest shift done.
   76|       |  //
   77|       |  // Just as importantly, by keeping results in res1, res2, and res3, we take
   78|       |  // advantage of the superscalar abilities of the CPU.
   79|      2|  const auto next = [&p] { return static_cast<const int8_t>(*p++); };
   80|      2|  const auto last = [&p] { return static_cast<const int8_t>(p[-1]); };
   81|       |
   82|      2|  int64_t res2, res3;  // accumulated result chunks
   83|      2|  res1 = next();
   84|      2|  if (ABSL_PREDICT_TRUE(res1 >= 0)) return p;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   85|      0|  if (limit <= 1) goto limit0;
  ------------------
  |  Branch (85:7): [Folded, False: 0]
  ------------------
   86|       |
   87|       |  // Densify all ops with explicit FALSE predictions from here on, except that
   88|       |  // we predict length = 5 as a common length for fields like timestamp.
   89|      0|  if (ABSL_PREDICT_FALSE(VarintShl<1>(next(), res1, res2))) goto done1;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   90|      0|  if (limit <= 2) goto limit1;
  ------------------
  |  Branch (90:7): [Folded, False: 0]
  ------------------
   91|      0|  if (ABSL_PREDICT_FALSE(VarintShl<2>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   92|      0|  if (limit <= 3) goto limit2;
  ------------------
  |  Branch (92:7): [Folded, False: 0]
  ------------------
   93|      0|  if (ABSL_PREDICT_FALSE(VarintShlAnd<3>(next(), res1, res2))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   94|      0|  if (limit <= 4) goto limit2;
  ------------------
  |  Branch (94:7): [Folded, False: 0]
  ------------------
   95|      0|  if (ABSL_PREDICT_TRUE(VarintShlAnd<4>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
   96|      0|  if (limit <= 5) goto limit2;
  ------------------
  |  Branch (96:7): [Folded, False: 0]
  ------------------
   97|       |
   98|      0|  if (kIs64BitVarint) {
  ------------------
  |  Branch (98:7): [True: 0, Folded]
  ------------------
   99|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<5>(next(), res1, res2))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  100|      0|    if (limit <= 6) goto limit2;
  ------------------
  |  Branch (100:9): [Folded, False: 0]
  ------------------
  101|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<6>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  102|      0|    if (limit <= 7) goto limit2;
  ------------------
  |  Branch (102:9): [Folded, False: 0]
  ------------------
  103|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<7>(next(), res1, res2))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  104|      0|    if (limit <= 8) goto limit2;
  ------------------
  |  Branch (104:9): [Folded, False: 0]
  ------------------
  105|      0|    if (ABSL_PREDICT_FALSE(VarintShlAnd<8>(next(), res1, res3))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  106|      0|    if (limit <= 9) goto limit2;
  ------------------
  |  Branch (106:9): [Folded, False: 0]
  ------------------
  107|      0|  } else {
  108|       |    // An overlong int32 is expected to span the full 10 bytes
  109|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  110|      0|    if (limit <= 6) goto limit2;
  ------------------
  |  Branch (110:9): [Folded, False: 0]
  ------------------
  111|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  112|      0|    if (limit <= 7) goto limit2;
  ------------------
  |  Branch (112:9): [Folded, False: 0]
  ------------------
  113|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  114|      0|    if (limit <= 8) goto limit2;
  ------------------
  |  Branch (114:9): [Folded, False: 0]
  ------------------
  115|      0|    if (ABSL_PREDICT_FALSE(!(next() & 0x80))) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  116|      0|    if (limit <= 9) goto limit2;
  ------------------
  |  Branch (116:9): [Folded, False: 0]
  ------------------
  117|      0|  }
  118|       |
  119|       |  // For valid 64bit varints, the 10th byte/ptr[9] should be exactly 1. In this
  120|       |  // case, the continuation bit of ptr[8] already set the top bit of res3
  121|       |  // correctly, so all we have to do is check that the expected case is true.
  122|      0|  if (ABSL_PREDICT_TRUE(next() == 1)) goto done2;
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  123|       |
  124|      0|  if (ABSL_PREDICT_FALSE(last() & 0x80)) {
  ------------------
  |  |  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]
  |  |  ------------------
  ------------------
  125|       |    // If the continue bit is set, it is an unterminated varint.
  126|      0|    return nullptr;
  127|      0|  }
  128|       |
  129|       |  // A zero value of the first bit of the 10th byte represents an
  130|       |  // over-serialized varint. This case should not happen, but if does (say, due
  131|       |  // to a nonconforming serializer), deassert the continuation bit that came
  132|       |  // from ptr[8].
  133|      0|  if (kIs64BitVarint && (last() & 1) == 0) {
  ------------------
  |  Branch (133:7): [True: 0, Folded]
  |  Branch (133:25): [True: 0, False: 0]
  ------------------
  134|      0|    static constexpr int bits = 64 - 1;
  135|      0|#if defined(__GCC_ASM_FLAG_OUTPUTS__) && defined(__x86_64__)
  136|       |    // Use a small instruction since this is an uncommon code path.
  137|      0|    asm("btc %[bits], %[res3]" : [res3] "+r"(res3) : [bits] "i"(bits));
  138|       |#else
  139|       |    res3 ^= int64_t{1} << bits;
  140|       |#endif
  141|      0|  }
  142|       |
  143|      0|done2:
  144|      0|  res2 &= res3;
  145|      0|done1:
  146|      0|  res1 &= res2;
  147|      0|  PROTOBUF_ASSUME(p != nullptr);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  148|      0|  return p;
  149|      0|limit2:
  150|      0|  res2 &= res3;
  151|      0|limit1:
  152|      0|  res1 &= res2;
  153|      0|limit0:
  154|      0|  PROTOBUF_ASSUME(p != nullptr);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  155|      0|  PROTOBUF_ASSUME(res1 < 0);
  ------------------
  |  |  733|      0|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  ------------------
  156|      0|  return p;
  157|      0|}
_ZZN6google8protobuf8internal19ShiftMixParseVarintImLi10EEEPKcS4_RlENKUlvE_clEv:
   79|      2|  const auto next = [&p] { return static_cast<const int8_t>(*p++); };

_ZNK4absl12lts_202608176Status2okEv:
 1010|  19.8M|inline bool Status::ok() const {
 1011|  19.8M|  return rep_ == CodeToInlinedRep(absl::StatusCode::kOk);
 1012|  19.8M|}
_ZN4absl12lts_202608176Status16CodeToInlinedRepENS0_10StatusCodeE:
 1093|  59.1M|constexpr uintptr_t Status::CodeToInlinedRep(absl::StatusCode code) {
 1094|  59.1M|  return (static_cast<uintptr_t>(code) << 2) + 1;
 1095|  59.1M|}
_ZN4absl12lts_202608176StatusD2Ev:
 1008|  19.8M|inline Status::~Status() { Unref(rep_); }
_ZN4absl12lts_202608176Status5UnrefEm:
 1121|  19.8M|inline void Status::Unref(uintptr_t rep) {
 1122|  19.8M|  if (!IsInlined(rep)) RepToPointer(rep)->Unref();
  ------------------
  |  Branch (1122:7): [True: 0, False: 19.8M]
  ------------------
 1123|  19.8M|}
_ZN4absl12lts_202608176Status9IsInlinedEm:
 1089|  20.1M|constexpr bool Status::IsInlined(uintptr_t rep) { return (rep & 1) != 0; }

_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorINS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS8_ISA_EEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  1.54k|    -> decltype(GetDataImpl(c, 0)) {
   51|  1.54k|  return GetDataImpl(c, 0);
   52|  1.54k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorINS3_12basic_stringIcNS3_11char_traitsIcEENS3_9allocatorIcEEEENS8_ISA_EEEEEEDTcldtfp_4dataEERT_c:
   38|  1.54k|    -> decltype(c.data()) {
   39|  1.54k|  return c.data();
   40|  1.54k|}
_ZN4absl12lts_2026081713span_internal7GetDataIKNSt3__16vectorIiNS3_9allocatorIiEEEEEEDTcl11GetDataImplfp_Li0EEERT_:
   50|  1.61k|    -> decltype(GetDataImpl(c, 0)) {
   51|  1.61k|  return GetDataImpl(c, 0);
   52|  1.61k|}
_ZN4absl12lts_2026081713span_internal11GetDataImplIKNSt3__16vectorIiNS3_9allocatorIiEEEEEEDTcldtfp_4dataEERT_c:
   38|  1.61k|    -> decltype(c.data()) {
   39|  1.61k|  return c.data();
   40|  1.61k|}

_ZN4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEC2INS2_6vectorIS8_NS6_IS8_EEEEvSE_iEERKT_:
  252|  1.54k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEC2EPS9_m:
  228|  1.54k|      : ptr_(array), len_(length) {}
_ZN4absl12lts_202608174SpanIKiEC2INSt3__16vectorIiNS5_9allocatorIiEEEEvS9_iEERKT_:
  252|  1.61k|      : Span(span_internal::GetData(v), v.size()) {}
_ZN4absl12lts_202608174SpanIKiEC2EPS2_m:
  228|  1.61k|      : ptr_(array), len_(length) {}

_ZN13sentencepiece31SentencePieceText_SentencePieceC2EPN6google8protobuf5ArenaE:
  508|   157M|    : Super_(arena) {
  509|   157M|#endif  // PROTOBUF_CUSTOM_VTABLE
  510|   157M|  SharedCtor(arena);
  511|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.SentencePieceText.SentencePiece)
  512|   157M|}
_ZN13sentencepiece17SentencePieceTextC2EPN6google8protobuf5ArenaE:
  822|  14.4k|    : Super_(arena) {
  823|  14.4k|#endif  // PROTOBUF_CUSTOM_VTABLE
  824|  14.4k|  SharedCtor(arena);
  825|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.SentencePieceText)
  826|  14.4k|}
_ZN13sentencepiece17SentencePieceText5ClearEv:
  916|  5.20k|PROTOBUF_NOINLINE void SentencePieceText::Clear() {
  917|  5.20k|  auto& this_ [[maybe_unused]] = *this;
  918|       |  // @@protoc_insertion_point(message_clear_start:sentencepiece.SentencePieceText)
  919|  5.20k|  ::google::protobuf::internal::TSanWrite(&_impl_);
  920|  5.20k|  ::uint32_t cached_has_bits [[maybe_unused]] = 0;
  921|       |
  922|  5.20k|  _impl_._extensions_.Clear();
  923|  5.20k|  cached_has_bits = this_._impl_._has_bits_[0];
  924|  5.20k|  if (BatchCheckHasBit(cached_has_bits, 0x00000003U)) {
  ------------------
  |  Branch (924:7): [True: 0, False: 5.20k]
  ------------------
  925|      0|    if (CheckHasBit(cached_has_bits, 0x00000001U)) {
  ------------------
  |  Branch (925:9): [True: 0, False: 0]
  ------------------
  926|      0|      _impl_.pieces_.Clear();
  927|      0|    }
  928|      0|    if (CheckHasBit(cached_has_bits, 0x00000002U)) {
  ------------------
  |  Branch (928:9): [True: 0, False: 0]
  ------------------
  929|      0|      this_._impl_.text_.ClearNonDefaultToEmpty();
  930|      0|    }
  931|      0|  }
  932|  5.20k|  this_._impl_.score_ = 0;
  933|  5.20k|  _impl_._has_bits_.Clear();
  934|  5.20k|  _internal_metadata_.Clear<::std::string>();
  935|  5.20k|}
_ZN13sentencepiece22NBestSentencePieceTextC2EPN6google8protobuf5ArenaE:
 1101|  4.59k|    : Super_(arena) {
 1102|  4.59k|#endif  // PROTOBUF_CUSTOM_VTABLE
 1103|  4.59k|  SharedCtor(arena);
 1104|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.NBestSentencePieceText)
 1105|  4.59k|}
_ZN13sentencepiece22NBestSentencePieceText5ClearEv:
 1184|  4.59k|PROTOBUF_NOINLINE void NBestSentencePieceText::Clear() {
 1185|  4.59k|  auto& this_ [[maybe_unused]] = *this;
 1186|       |  // @@protoc_insertion_point(message_clear_start:sentencepiece.NBestSentencePieceText)
 1187|  4.59k|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1188|  4.59k|  ::uint32_t cached_has_bits [[maybe_unused]] = 0;
 1189|       |
 1190|  4.59k|  cached_has_bits = this_._impl_._has_bits_[0];
 1191|  4.59k|  if (CheckHasBit(cached_has_bits, 0x00000001U)) {
  ------------------
  |  Branch (1191:7): [True: 0, False: 4.59k]
  ------------------
 1192|      0|    _impl_.nbests_.Clear();
 1193|      0|  }
 1194|  4.59k|  _impl_._has_bits_.Clear();
 1195|  4.59k|  _internal_metadata_.Clear<::std::string>();
 1196|  4.59k|}
_ZN13sentencepiece31SentencePieceText_SentencePiece10SharedCtorEPN6google8protobuf5ArenaE:
  557|   157M|inline void SentencePieceText_SentencePiece::SharedCtor(::_pb::Arena* PROTOBUF_NULLABLE arena) {
  558|   157M|  new (&_impl_) Impl_(internal_visibility(), arena);
  559|   157M|  ::memset(reinterpret_cast<char*>(&_impl_) +
  560|   157M|               offsetof(Impl_, id_),
  561|   157M|           0,
  562|   157M|           offsetof(Impl_, end_) -
  563|       |               offsetof(Impl_, id_) +
  564|   157M|               sizeof(Impl_::end_));
  565|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece5Impl_C2EN6google8protobuf8internal18InternalVisibilityEPNS3_5ArenaE:
  552|   157M|      : _extensions_ {}
  553|       |        ,
  554|   157M|        piece_(arena),
  555|   157M|        surface_(arena) {}
_ZN13sentencepiece17SentencePieceText10SharedCtorEPN6google8protobuf5ArenaE:
  875|  14.4k|inline void SentencePieceText::SharedCtor(::_pb::Arena* PROTOBUF_NULLABLE arena) {
  876|  14.4k|  new (&_impl_) Impl_(internal_visibility(), arena);
  877|  14.4k|  _impl_.score_ = {};
  878|  14.4k|}
_ZN13sentencepiece17SentencePieceText5Impl_C2EN6google8protobuf8internal18InternalVisibilityEPNS3_5ArenaE:
  866|  14.4k|      : _extensions_ {}
  867|       |        ,
  868|  14.4k|        pieces_ { visibility, ::_pbi::InternalMetadataOffset::Build<
  869|  14.4k|            ::sentencepiece::SentencePieceText,
  870|  14.4k|            PROTOBUF_FIELD_OFFSET(::sentencepiece::SentencePieceText, _impl_.pieces_)>()
  871|  14.4k|         }
  872|       |        ,
  873|  14.4k|        text_(arena) {}
_ZN13sentencepiece22NBestSentencePieceText10SharedCtorEPN6google8protobuf5ArenaE:
 1145|  4.59k|inline void NBestSentencePieceText::SharedCtor(::_pb::Arena* PROTOBUF_NULLABLE arena) {
 1146|  4.59k|  new (&_impl_) Impl_(internal_visibility(), arena);
 1147|  4.59k|}
_ZN13sentencepiece22NBestSentencePieceText5Impl_C2EN6google8protobuf8internal18InternalVisibilityEPNS3_5ArenaE:
 1139|  4.59k|      : nbests_ { visibility, ::_pbi::InternalMetadataOffset::Build<
 1140|  4.59k|            ::sentencepiece::NBestSentencePieceText,
 1141|  4.59k|            PROTOBUF_FIELD_OFFSET(::sentencepiece::NBestSentencePieceText, _impl_.nbests_)>()
 1142|  4.59k|         }
 1143|  4.59k|     {}

_ZNK13sentencepiece22NBestSentencePieceText6nbestsEv:
 1582|  9.19k|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1583|       |  // @@protoc_insertion_point(field_list:sentencepiece.NBestSentencePieceText.nbests)
 1584|  9.19k|  return _internal_nbests();
 1585|  9.19k|}
_ZNK13sentencepiece22NBestSentencePieceText16_internal_nbestsEv:
 1594|  9.19k|NBestSentencePieceText::_internal_nbests() const {
 1595|  9.19k|  ::google::protobuf::internal::TSanRead(&_impl_);
 1596|  9.19k|  return _impl_.nbests_;
 1597|  9.19k|}
_ZNK13sentencepiece17SentencePieceText6piecesEv:
 1495|  27.5k|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1496|       |  // @@protoc_insertion_point(field_list:sentencepiece.SentencePieceText.pieces)
 1497|  27.5k|  return _internal_pieces();
 1498|  27.5k|}
_ZNK13sentencepiece17SentencePieceText16_internal_piecesEv:
 1507|  27.5k|SentencePieceText::_internal_pieces() const {
 1508|  27.5k|  ::google::protobuf::internal::TSanRead(&_impl_);
 1509|  27.5k|  return _impl_.pieces_;
 1510|  27.5k|}
_ZNK13sentencepiece31SentencePieceText_SentencePiece5pieceEv:
 1181|   106M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1182|       |  // @@protoc_insertion_point(field_get:sentencepiece.SentencePieceText.SentencePiece.piece)
 1183|   106M|  return _internal_piece();
 1184|   106M|}
_ZNK13sentencepiece31SentencePieceText_SentencePiece15_internal_pieceEv:
 1199|   106M|inline const ::std::string& SentencePieceText_SentencePiece::_internal_piece() const {
 1200|   106M|  ::google::protobuf::internal::TSanRead(&_impl_);
 1201|   106M|  return _impl_.piece_.Get();
 1202|   106M|}
_ZNK13sentencepiece31SentencePieceText_SentencePiece2idEv:
 1248|  51.3M|inline ::uint32_t SentencePieceText_SentencePiece::id() const {
 1249|       |  // @@protoc_insertion_point(field_get:sentencepiece.SentencePieceText.SentencePiece.id)
 1250|  51.3M|  return _internal_id();
 1251|  51.3M|}
_ZNK13sentencepiece31SentencePieceText_SentencePiece12_internal_idEv:
 1257|  51.3M|inline ::uint32_t SentencePieceText_SentencePiece::_internal_id() const {
 1258|  51.3M|  ::google::protobuf::internal::TSanRead(&_impl_);
 1259|  51.3M|  return _impl_.id_;
 1260|  51.3M|}
_ZN13sentencepiece17SentencePieceText10add_piecesEv:
 1485|   157M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1486|   157M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1487|   157M|  ::sentencepiece::SentencePieceText_SentencePiece* _add =
 1488|   157M|      _internal_mutable_pieces()->InternalAddWithArena(
 1489|   157M|          ::google::protobuf::MessageLite::internal_visibility(), GetArena());
 1490|   157M|  SetHasBit(_impl_._has_bits_[0], 0x00000001U);
 1491|       |  // @@protoc_insertion_point(field_add:sentencepiece.SentencePieceText.pieces)
 1492|   157M|  return _add;
 1493|   157M|}
_ZN13sentencepiece17SentencePieceText24_internal_mutable_piecesEv:
 1512|   157M|SentencePieceText::_internal_mutable_pieces() {
 1513|   157M|  ::google::protobuf::internal::TSanRead(&_impl_);
 1514|   157M|  return &_impl_.pieces_;
 1515|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece6set_idEj:
 1252|   157M|inline void SentencePieceText_SentencePiece::set_id(::uint32_t value) {
 1253|   157M|  _internal_set_id(value);
 1254|   157M|  SetHasBit(_impl_._has_bits_[0], 0x00000004U);
 1255|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.SentencePiece.id)
 1256|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece16_internal_set_idEj:
 1261|   157M|inline void SentencePieceText_SentencePiece::_internal_set_id(::uint32_t value) {
 1262|   157M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1263|   157M|  _impl_.id_ = value;
 1264|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece9set_beginEj:
 1348|   157M|inline void SentencePieceText_SentencePiece::set_begin(::uint32_t value) {
 1349|   157M|  _internal_set_begin(value);
 1350|   157M|  SetHasBit(_impl_._has_bits_[0], 0x00000008U);
 1351|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.SentencePiece.begin)
 1352|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece19_internal_set_beginEj:
 1357|   157M|inline void SentencePieceText_SentencePiece::_internal_set_begin(::uint32_t value) {
 1358|   157M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1359|   157M|  _impl_.begin_ = value;
 1360|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece7set_endEj:
 1376|   157M|inline void SentencePieceText_SentencePiece::set_end(::uint32_t value) {
 1377|   157M|  _internal_set_end(value);
 1378|   157M|  SetHasBit(_impl_._has_bits_[0], 0x00000010U);
 1379|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.SentencePiece.end)
 1380|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece17_internal_set_endEj:
 1385|   157M|inline void SentencePieceText_SentencePiece::_internal_set_end(::uint32_t value) {
 1386|   157M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1387|   157M|  _impl_.end_ = value;
 1388|   157M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece13mutable_pieceEv:
 1193|   135M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1194|   135M|  SetHasBit(_impl_._has_bits_[0], 0x00000001U);
 1195|   135M|  ::std::string* _s = _internal_mutable_piece();
 1196|       |  // @@protoc_insertion_point(field_mutable:sentencepiece.SentencePieceText.SentencePiece.piece)
 1197|   135M|  return _s;
 1198|   135M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece23_internal_mutable_pieceEv:
 1207|   135M|inline ::std::string* PROTOBUF_NONNULL SentencePieceText_SentencePiece::_internal_mutable_piece() {
 1208|   135M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1209|   135M|  return _impl_.piece_.Mutable( GetArena());
 1210|   135M|}
_ZN13sentencepiece22NBestSentencePieceText10add_nbestsEv:
 1572|  9.29k|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 1573|  9.29k|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1574|  9.29k|  ::sentencepiece::SentencePieceText* _add =
 1575|  9.29k|      _internal_mutable_nbests()->InternalAddWithArena(
 1576|  9.29k|          ::google::protobuf::MessageLite::internal_visibility(), GetArena());
 1577|  9.29k|  SetHasBit(_impl_._has_bits_[0], 0x00000001U);
 1578|       |  // @@protoc_insertion_point(field_add:sentencepiece.NBestSentencePieceText.nbests)
 1579|  9.29k|  return _add;
 1580|  9.29k|}
_ZN13sentencepiece22NBestSentencePieceText24_internal_mutable_nbestsEv:
 1599|  9.29k|NBestSentencePieceText::_internal_mutable_nbests() {
 1600|  9.29k|  ::google::protobuf::internal::TSanRead(&_impl_);
 1601|  9.29k|  return &_impl_.nbests_;
 1602|  9.29k|}
_ZN13sentencepiece17SentencePieceText9set_scoreEf:
 1531|  9.29k|inline void SentencePieceText::set_score(float value) {
 1532|  9.29k|  _internal_set_score(value);
 1533|  9.29k|  SetHasBit(_impl_._has_bits_[0], 0x00000004U);
 1534|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.score)
 1535|  9.29k|}
_ZN13sentencepiece17SentencePieceText19_internal_set_scoreEf:
 1540|  9.29k|inline void SentencePieceText::_internal_set_score(float value) {
 1541|  9.29k|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1542|  9.29k|  _impl_.score_ = value;
 1543|  9.29k|}
_ZN13sentencepiece31SentencePieceText_SentencePiece9set_pieceIPKcJmEEEvOT_DpT0_:
 1186|  21.4M|PROTOBUF_ALWAYS_INLINE void SentencePieceText_SentencePiece::set_piece(Arg_&& arg, Args_... args) {
 1187|  21.4M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1188|  21.4M|  SetHasBit(_impl_._has_bits_[0], 0x00000001U);
 1189|  21.4M|  _impl_.piece_.Set(static_cast<Arg_&&>(arg), args..., GetArena());
 1190|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.SentencePiece.piece)
 1191|  21.4M|}
_ZN13sentencepiece31SentencePieceText_SentencePiece11set_surfaceIPKcJmEEEvOT_DpT0_:
 1282|  97.6M|PROTOBUF_ALWAYS_INLINE void SentencePieceText_SentencePiece::set_surface(Arg_&& arg, Args_... args) {
 1283|  97.6M|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1284|  97.6M|  SetHasBit(_impl_._has_bits_[0], 0x00000002U);
 1285|  97.6M|  _impl_.surface_.Set(static_cast<Arg_&&>(arg), args..., GetArena());
 1286|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.SentencePiece.surface)
 1287|  97.6M|}
_ZN13sentencepiece17SentencePieceText8set_textIPKcJmEEEvOT_DpT0_:
 1410|  14.4k|PROTOBUF_ALWAYS_INLINE void SentencePieceText::set_text(Arg_&& arg, Args_... args) {
 1411|  14.4k|  ::google::protobuf::internal::TSanWrite(&_impl_);
 1412|  14.4k|  SetHasBit(_impl_._has_bits_[0], 0x00000002U);
 1413|  14.4k|  _impl_.text_.Set(static_cast<Arg_&&>(arg), args..., GetArena());
 1414|       |  // @@protoc_insertion_point(field_set:sentencepiece.SentencePieceText.text)
 1415|  14.4k|}

_ZN13sentencepiece11TrainerSpec17IsInitializedImplERKN6google8protobuf11MessageLiteE:
 2152|      2|    const MessageLite& msg) {
 2153|      2|  auto& this_ = static_cast<const TrainerSpec&>(msg);
 2154|      2|  if (!this_._impl_._extensions_.IsInitialized(this_.GetArena(),
  ------------------
  |  Branch (2154:7): [True: 0, False: 2]
  ------------------
 2155|      2|                                        &default_instance())) {
 2156|      0|    return false;
 2157|      0|  }
 2158|      2|  return true;
 2159|      2|}
_ZN13sentencepiece14NormalizerSpec17IsInitializedImplERKN6google8protobuf11MessageLiteE:
 2484|      2|    const MessageLite& msg) {
 2485|      2|  auto& this_ = static_cast<const NormalizerSpec&>(msg);
 2486|      2|  if (!this_._impl_._extensions_.IsInitialized(this_.GetArena(),
  ------------------
  |  Branch (2486:7): [True: 0, False: 2]
  ------------------
 2487|      2|                                        &default_instance())) {
 2488|      0|    return false;
 2489|      0|  }
 2490|      2|  return true;
 2491|      2|}
_ZNK13sentencepiece24ModelProto_SentencePiece12GetClassDataEv:
 2591|    596|ModelProto_SentencePiece::GetClassData() const {
 2592|    596|  return ModelProto_SentencePiece_class_data_.base();
 2593|    596|}
_ZN13sentencepiece24ModelProto_SentencePiece17IsInitializedImplERKN6google8protobuf11MessageLiteE:
 2751|    596|    const MessageLite& msg) {
 2752|    596|  auto& this_ = static_cast<const ModelProto_SentencePiece&>(msg);
 2753|    596|  if (!this_._impl_._extensions_.IsInitialized(this_.GetArena(),
  ------------------
  |  Branch (2753:7): [True: 0, False: 596]
  ------------------
 2754|    596|                                        &default_instance())) {
 2755|      0|    return false;
 2756|      0|  }
 2757|    596|  return true;
 2758|    596|}
_ZN13sentencepiece10ModelProtoC2EPN6google8protobuf5ArenaE:
 2782|      2|    : Super_(arena) {
 2783|      2|#endif  // PROTOBUF_CUSTOM_VTABLE
 2784|      2|  SharedCtor(arena);
 2785|       |  // @@protoc_insertion_point(arena_constructor:sentencepiece.ModelProto)
 2786|      2|}
_ZNK13sentencepiece10ModelProto12GetClassDataEv:
 2875|      4|ModelProto::GetClassData() const {
 2876|      4|  return ModelProto_class_data_.base();
 2877|      4|}
_ZN13sentencepiece10ModelProto5ClearEv:
 2890|      2|PROTOBUF_NOINLINE void ModelProto::Clear() {
 2891|      2|  auto& this_ [[maybe_unused]] = *this;
 2892|       |  // @@protoc_insertion_point(message_clear_start:sentencepiece.ModelProto)
 2893|      2|  ::google::protobuf::internal::TSanWrite(&_impl_);
 2894|      2|  ::uint32_t cached_has_bits [[maybe_unused]] = 0;
 2895|       |
 2896|      2|  _impl_._extensions_.Clear();
 2897|      2|  cached_has_bits = this_._impl_._has_bits_[0];
 2898|      2|  if (BatchCheckHasBit(cached_has_bits, 0x0000000fU)) {
  ------------------
  |  Branch (2898:7): [True: 0, False: 2]
  ------------------
 2899|      0|    if (CheckHasBit(cached_has_bits, 0x00000001U)) {
  ------------------
  |  Branch (2899:9): [True: 0, False: 0]
  ------------------
 2900|      0|      _impl_.pieces_.Clear();
 2901|      0|    }
 2902|      0|    if (CheckHasBit(cached_has_bits, 0x00000002U)) {
  ------------------
  |  Branch (2902:9): [True: 0, False: 0]
  ------------------
 2903|      0|      ABSL_DCHECK(this_._impl_.trainer_spec_ != nullptr);
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2904|      0|      this_._impl_.trainer_spec_->Clear();
 2905|      0|    }
 2906|      0|    if (CheckHasBit(cached_has_bits, 0x00000004U)) {
  ------------------
  |  Branch (2906:9): [True: 0, False: 0]
  ------------------
 2907|      0|      ABSL_DCHECK(this_._impl_.normalizer_spec_ != nullptr);
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2908|      0|      this_._impl_.normalizer_spec_->Clear();
 2909|      0|    }
 2910|      0|    if (CheckHasBit(cached_has_bits, 0x00000008U)) {
  ------------------
  |  Branch (2910:9): [True: 0, False: 0]
  ------------------
 2911|      0|      ABSL_DCHECK(this_._impl_.denormalizer_spec_ != nullptr);
  ------------------
  |  |   47|      0|  ABSL_LOG_INTERNAL_DCHECK_IMPL((condition), #condition)
  |  |  ------------------
  |  |  |  |   44|      0|  ABSL_LOG_INTERNAL_CHECK_IMPL(true || (condition), "true")
  |  |  |  |  ------------------
  |  |  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION_FATAL(STATELESS,                        \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  180|      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): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, Folded]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [True: 0, False: 0]
  |  |  |  |  |  |  |  |  |  |  |  Branch (68:7): [Folded, False: 0]
  |  |  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   28|      0|                                    ABSL_PREDICT_FALSE(!(condition))) \
  |  |  |  |  |  |   29|      0|  ABSL_LOG_INTERNAL_CHECK(condition_text).InternalStream()
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   84|      0|  ::absl::log_internal::LogMessageFatal(__FILE__, __LINE__, failure_message)
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
 2912|      0|      this_._impl_.denormalizer_spec_->Clear();
 2913|      0|    }
 2914|      0|  }
 2915|      2|  _impl_._has_bits_.Clear();
 2916|      2|  _internal_metadata_.Clear<::std::string>();
 2917|      2|}
_ZN13sentencepiece10ModelProto17IsInitializedImplERKN6google8protobuf11MessageLiteE:
 3089|      2|    const MessageLite& msg) {
 3090|      2|  auto& this_ = static_cast<const ModelProto&>(msg);
 3091|      2|  if (!this_._impl_._extensions_.IsInitialized(this_.GetArena(),
  ------------------
  |  Branch (3091:7): [True: 0, False: 2]
  ------------------
 3092|      2|                                        &default_instance())) {
 3093|      0|    return false;
 3094|      0|  }
 3095|      2|  if (!::google::protobuf::internal::AllAreInitialized(this_._internal_pieces()))
  ------------------
  |  Branch (3095:7): [True: 0, False: 2]
  ------------------
 3096|      0|    return false;
 3097|      2|  if (CheckHasBit(this_._impl_._has_bits_[0], 0x00000002U)) {
  ------------------
  |  Branch (3097:7): [True: 2, False: 0]
  ------------------
 3098|      2|    if (!this_._impl_.trainer_spec_->IsInitialized()) return false;
  ------------------
  |  Branch (3098:9): [True: 0, False: 2]
  ------------------
 3099|      2|  }
 3100|      2|  if (CheckHasBit(this_._impl_._has_bits_[0], 0x00000004U)) {
  ------------------
  |  Branch (3100:7): [True: 2, False: 0]
  ------------------
 3101|      2|    if (!this_._impl_.normalizer_spec_->IsInitialized()) return false;
  ------------------
  |  Branch (3101:9): [True: 0, False: 2]
  ------------------
 3102|      2|  }
 3103|      2|  if (CheckHasBit(this_._impl_._has_bits_[0], 0x00000008U)) {
  ------------------
  |  Branch (3103:7): [True: 0, False: 2]
  ------------------
 3104|      0|    if (!this_._impl_.denormalizer_spec_->IsInitialized()) return false;
  ------------------
  |  Branch (3104:9): [True: 0, False: 0]
  ------------------
 3105|      0|  }
 3106|      2|  return true;
 3107|      2|}
_ZN13sentencepiece10ModelProto10SharedCtorEPN6google8protobuf5ArenaE:
 2842|      2|inline void ModelProto::SharedCtor(::_pb::Arena* PROTOBUF_NULLABLE arena) {
 2843|      2|  new (&_impl_) Impl_(internal_visibility(), arena);
 2844|      2|  ::memset(reinterpret_cast<char*>(&_impl_) +
 2845|      2|               offsetof(Impl_, trainer_spec_),
 2846|      2|           0,
 2847|      2|           offsetof(Impl_, denormalizer_spec_) -
 2848|       |               offsetof(Impl_, trainer_spec_) +
 2849|      2|               sizeof(Impl_::denormalizer_spec_));
 2850|      2|}
_ZN13sentencepiece10ModelProto5Impl_C2EN6google8protobuf8internal18InternalVisibilityEPNS3_5ArenaE:
 2834|      2|      : _extensions_ {}
 2835|       |        ,
 2836|      2|        pieces_ { visibility, ::_pbi::InternalMetadataOffset::Build<
 2837|      2|            ::sentencepiece::ModelProto,
 2838|      2|            PROTOBUF_FIELD_OFFSET(::sentencepiece::ModelProto, _impl_.pieces_)>()
 2839|      2|         }
 2840|      2|     {}

_ZNK13sentencepiece10ModelProto12trainer_specEv:
 5007|  76.2M|inline const ::sentencepiece::TrainerSpec& ModelProto::trainer_spec() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 5008|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.trainer_spec)
 5009|  76.2M|  return _internal_trainer_spec();
 5010|  76.2M|}
_ZNK13sentencepiece10ModelProto22_internal_trainer_specEv:
 5002|  76.2M|inline const ::sentencepiece::TrainerSpec& ModelProto::_internal_trainer_spec() const {
 5003|  76.2M|  ::google::protobuf::internal::TSanRead(&_impl_);
 5004|  76.2M|  const ::sentencepiece::TrainerSpec* p = _impl_.trainer_spec_;
 5005|  76.2M|  return p != nullptr ? *p : *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<::sentencepiece::TrainerSpec>(&::sentencepiece::TrainerSpec_globals_);
  ------------------
  |  Branch (5005:10): [True: 76.2M, False: 0]
  ------------------
 5006|  76.2M|}
_ZNK13sentencepiece11TrainerSpec13byte_fallbackEv:
 3611|  76.2M|inline bool TrainerSpec::byte_fallback() const {
 3612|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.byte_fallback)
 3613|  76.2M|  return _internal_byte_fallback();
 3614|  76.2M|}
_ZNK13sentencepiece11TrainerSpec23_internal_byte_fallbackEv:
 3620|  76.2M|inline bool TrainerSpec::_internal_byte_fallback() const {
 3621|  76.2M|  ::google::protobuf::internal::TSanRead(&_impl_);
 3622|  76.2M|  return _impl_.byte_fallback_;
 3623|  76.2M|}
_ZNK13sentencepiece10ModelProto11pieces_sizeEv:
 4940|   416M|inline int ModelProto::pieces_size() const {
 4941|   416M|  return _internal_pieces_size();
 4942|   416M|}
_ZNK13sentencepiece10ModelProto21_internal_pieces_sizeEv:
 4937|   416M|inline int ModelProto::_internal_pieces_size() const {
 4938|   416M|  return _internal_pieces().size();
 4939|   416M|}
_ZNK13sentencepiece10ModelProto16_internal_piecesEv:
 4981|  1.00G|ModelProto::_internal_pieces() const {
 4982|  1.00G|  ::google::protobuf::internal::TSanRead(&_impl_);
 4983|  1.00G|  return _impl_.pieces_;
 4984|  1.00G|}
_ZN13sentencepiece10ModelProto14mutable_piecesEi:
 4954|    596|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4955|       |  // @@protoc_insertion_point(field_mutable:sentencepiece.ModelProto.pieces)
 4956|    596|  return _internal_mutable_pieces()->Mutable(index);
 4957|    596|}
_ZN13sentencepiece10ModelProto24_internal_mutable_piecesEv:
 4986|    596|ModelProto::_internal_mutable_pieces() {
 4987|    596|  ::google::protobuf::internal::TSanRead(&_impl_);
 4988|    596|  return &_impl_.pieces_;
 4989|    596|}
_ZNK13sentencepiece24ModelProto_SentencePiece5pieceEv:
 4816|  57.8M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4817|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.piece)
 4818|  57.8M|  return _internal_piece();
 4819|  57.8M|}
_ZNK13sentencepiece24ModelProto_SentencePiece15_internal_pieceEv:
 4834|  57.8M|inline const ::std::string& ModelProto_SentencePiece::_internal_piece() const {
 4835|  57.8M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4836|  57.8M|  return _impl_.piece_.Get();
 4837|  57.8M|}
_ZNK13sentencepiece10ModelProto15normalizer_specEv:
 5105|  9.49k|inline const ::sentencepiece::NormalizerSpec& ModelProto::normalizer_spec() const ABSL_ATTRIBUTE_LIFETIME_BOUND {
 5106|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.normalizer_spec)
 5107|  9.49k|  return _internal_normalizer_spec();
 5108|  9.49k|}
_ZNK13sentencepiece10ModelProto25_internal_normalizer_specEv:
 5100|  9.49k|inline const ::sentencepiece::NormalizerSpec& ModelProto::_internal_normalizer_spec() const {
 5101|  9.49k|  ::google::protobuf::internal::TSanRead(&_impl_);
 5102|  9.49k|  const ::sentencepiece::NormalizerSpec* p = _impl_.normalizer_spec_;
 5103|  9.49k|  return p != nullptr ? *p : *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<::sentencepiece::NormalizerSpec>(&::sentencepiece::NormalizerSpec_globals_);
  ------------------
  |  Branch (5103:10): [True: 9.49k, False: 0]
  ------------------
 5104|  9.49k|}
_ZNK13sentencepiece10ModelProto21has_denormalizer_specEv:
 5188|      2|inline bool ModelProto::has_denormalizer_spec() const {
 5189|      2|  bool value = CheckHasBit(_impl_._has_bits_[0], 0x00000008U);
 5190|      2|  PROTOBUF_ASSUME(!value || _impl_.denormalizer_spec_ != nullptr);
  ------------------
  |  |  733|      2|#define PROTOBUF_ASSUME(pred) __builtin_assume(pred)
  |  |  ------------------
  |  |  |  Branch (733:48): [True: 2, False: 0]
  |  |  |  Branch (733:48): [True: 0, False: 0]
  |  |  ------------------
  ------------------
 5191|      2|  return value;
 5192|      2|}
_ZNK13sentencepiece14NormalizerSpec20precompiled_charsmapEv:
 4592|      2|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4593|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.precompiled_charsmap)
 4594|      2|  return _internal_precompiled_charsmap();
 4595|      2|}
_ZNK13sentencepiece14NormalizerSpec30_internal_precompiled_charsmapEv:
 4610|      2|inline const ::std::string& NormalizerSpec::_internal_precompiled_charsmap() const {
 4611|      2|  ::google::protobuf::internal::TSanRead(&_impl_);
 4612|      2|  return _impl_.precompiled_charsmap_.Get();
 4613|      2|}
_ZNK13sentencepiece11TrainerSpec15has_unk_surfaceEv:
 4082|  3.16k|inline bool TrainerSpec::has_unk_surface() const {
 4083|  3.16k|  bool value = CheckHasBit(_impl_._has_bits_[0], 0x00000040U);
 4084|  3.16k|  return value;
 4085|  3.16k|}
_ZNK13sentencepiece14NormalizerSpec16add_dummy_prefixEv:
 4659|  22.5k|inline bool NormalizerSpec::add_dummy_prefix() const {
 4660|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.add_dummy_prefix)
 4661|  22.5k|  return _internal_add_dummy_prefix();
 4662|  22.5k|}
_ZNK13sentencepiece14NormalizerSpec26_internal_add_dummy_prefixEv:
 4668|  22.5k|inline bool NormalizerSpec::_internal_add_dummy_prefix() const {
 4669|  22.5k|  ::google::protobuf::internal::TSanRead(&_impl_);
 4670|  22.5k|  return _impl_.add_dummy_prefix_;
 4671|  22.5k|}
_ZNK13sentencepiece14NormalizerSpec24remove_extra_whitespacesEv:
 4687|   276M|inline bool NormalizerSpec::remove_extra_whitespaces() const {
 4688|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.remove_extra_whitespaces)
 4689|   276M|  return _internal_remove_extra_whitespaces();
 4690|   276M|}
_ZNK13sentencepiece14NormalizerSpec34_internal_remove_extra_whitespacesEv:
 4696|   276M|inline bool NormalizerSpec::_internal_remove_extra_whitespaces() const {
 4697|   276M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4698|   276M|  return _impl_.remove_extra_whitespaces_;
 4699|   276M|}
_ZN13sentencepiece10ModelProtoC2Ev:
 2178|      2|  inline ModelProto() : ModelProto(nullptr) {}
_ZN13sentencepiece11TrainerSpec16default_instanceEv:
  199|      2|  [[nodiscard]] static const TrainerSpec& default_instance() {
  200|      2|    return *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<TrainerSpec>(&TrainerSpec_globals_);
  201|      2|  }
_ZNK13sentencepiece11TrainerSpec13IsInitializedEv:
  232|      2|  [[nodiscard]] bool IsInitialized() const {
  233|      2|    return IsInitializedImpl(*this);
  234|      2|  }
_ZN13sentencepiece14NormalizerSpec16default_instanceEv:
 1316|      2|  [[nodiscard]] static const NormalizerSpec& default_instance() {
 1317|      2|    return *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<NormalizerSpec>(&NormalizerSpec_globals_);
 1318|      2|  }
_ZNK13sentencepiece14NormalizerSpec13IsInitializedEv:
 1349|      2|  [[nodiscard]] bool IsInitialized() const {
 1350|      2|    return IsInitializedImpl(*this);
 1351|      2|  }
_ZN13sentencepiece24ModelProto_SentencePiece16default_instanceEv:
 1781|    596|  [[nodiscard]] static const ModelProto_SentencePiece& default_instance() {
 1782|    596|    return *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<ModelProto_SentencePiece>(&ModelProto_SentencePiece_globals_);
 1783|    596|  }
_ZNK13sentencepiece24ModelProto_SentencePiece13IsInitializedEv:
 1814|    596|  [[nodiscard]] bool IsInitialized() const {
 1815|    596|    return IsInitializedImpl(*this);
 1816|    596|  }
_ZN13sentencepiece10ModelProto16default_instanceEv:
 2218|      2|  [[nodiscard]] static const ModelProto& default_instance() {
 2219|      2|    return *::google::protobuf::internal::MessageGlobalsBase::ToDefaultInstance<ModelProto>(&ModelProto_globals_);
 2220|      2|  }
_ZNK13sentencepiece11TrainerSpec10model_typeEv:
 2852|      2|inline ::sentencepiece::TrainerSpec_ModelType TrainerSpec::model_type() const {
 2853|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.model_type)
 2854|      2|  return _internal_model_type();
 2855|      2|}
_ZNK13sentencepiece11TrainerSpec20_internal_model_typeEv:
 2861|      2|inline ::sentencepiece::TrainerSpec_ModelType TrainerSpec::_internal_model_type() const {
 2862|      2|  ::google::protobuf::internal::TSanRead(&_impl_);
 2863|      2|  return static_cast<::sentencepiece::TrainerSpec_ModelType>(_impl_.model_type_);
 2864|      2|}
_ZNK13sentencepiece11TrainerSpec26treat_whitespace_as_suffixEv:
 3247|      2|inline bool TrainerSpec::treat_whitespace_as_suffix() const {
 3248|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.treat_whitespace_as_suffix)
 3249|      2|  return _internal_treat_whitespace_as_suffix();
 3250|      2|}
_ZNK13sentencepiece11TrainerSpec36_internal_treat_whitespace_as_suffixEv:
 3256|      2|inline bool TrainerSpec::_internal_treat_whitespace_as_suffix() const {
 3257|      2|  ::google::protobuf::internal::TSanRead(&_impl_);
 3258|      2|  return _impl_.treat_whitespace_as_suffix_;
 3259|      2|}
_ZNK13sentencepiece11TrainerSpec9unk_pieceEv:
 3836|      4|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3837|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.unk_piece)
 3838|      4|  if (_impl_.unk_piece_.IsDefault()) {
  ------------------
  |  Branch (3838:7): [True: 4, False: 0]
  ------------------
 3839|      4|    return Impl_::_i_give_permission_to_break_this_code_default_unk_piece_.get();
 3840|      4|  }
 3841|      0|  return _internal_unk_piece();
 3842|      4|}
_ZNK13sentencepiece11TrainerSpec9bos_pieceEv:
 3900|      4|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3901|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.bos_piece)
 3902|      4|  if (_impl_.bos_piece_.IsDefault()) {
  ------------------
  |  Branch (3902:7): [True: 4, False: 0]
  ------------------
 3903|      4|    return Impl_::_i_give_permission_to_break_this_code_default_bos_piece_.get();
 3904|      4|  }
 3905|      0|  return _internal_bos_piece();
 3906|      4|}
_ZNK13sentencepiece11TrainerSpec9eos_pieceEv:
 3964|      4|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 3965|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.eos_piece)
 3966|      4|  if (_impl_.eos_piece_.IsDefault()) {
  ------------------
  |  Branch (3966:7): [True: 4, False: 0]
  ------------------
 3967|      4|    return Impl_::_i_give_permission_to_break_this_code_default_eos_piece_.get();
 3968|      4|  }
 3969|      0|  return _internal_eos_piece();
 3970|      4|}
_ZNK13sentencepiece11TrainerSpec9pad_pieceEv:
 4028|      4|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4029|       |  // @@protoc_insertion_point(field_get:sentencepiece.TrainerSpec.pad_piece)
 4030|      4|  if (_impl_.pad_piece_.IsDefault()) {
  ------------------
  |  Branch (4030:7): [True: 4, False: 0]
  ------------------
 4031|      4|    return Impl_::_i_give_permission_to_break_this_code_default_pad_piece_.get();
 4032|      4|  }
 4033|      0|  return _internal_pad_piece();
 4034|      4|}
_ZNK13sentencepiece14NormalizerSpec18escape_whitespacesEv:
 4715|  17.8k|inline bool NormalizerSpec::escape_whitespaces() const {
 4716|       |  // @@protoc_insertion_point(field_get:sentencepiece.NormalizerSpec.escape_whitespaces)
 4717|  17.8k|  return _internal_escape_whitespaces();
 4718|  17.8k|}
_ZNK13sentencepiece14NormalizerSpec28_internal_escape_whitespacesEv:
 4724|  17.8k|inline bool NormalizerSpec::_internal_escape_whitespaces() const {
 4725|  17.8k|  ::google::protobuf::internal::TSanRead(&_impl_);
 4726|  17.8k|  return _impl_.escape_whitespaces_;
 4727|  17.8k|}
_ZNK13sentencepiece24ModelProto_SentencePiece5scoreEv:
 4883|  47.7M|inline float ModelProto_SentencePiece::score() const {
 4884|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.score)
 4885|  47.7M|  return _internal_score();
 4886|  47.7M|}
_ZNK13sentencepiece24ModelProto_SentencePiece15_internal_scoreEv:
 4892|  47.7M|inline float ModelProto_SentencePiece::_internal_score() const {
 4893|  47.7M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4894|  47.7M|  return _impl_.score_;
 4895|  47.7M|}
_ZNK13sentencepiece24ModelProto_SentencePiece4typeEv:
 4911|   486M|inline ::sentencepiece::ModelProto_SentencePiece_Type ModelProto_SentencePiece::type() const {
 4912|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.SentencePiece.type)
 4913|   486M|  return _internal_type();
 4914|   486M|}
_ZNK13sentencepiece24ModelProto_SentencePiece14_internal_typeEv:
 4920|   486M|inline ::sentencepiece::ModelProto_SentencePiece_Type ModelProto_SentencePiece::_internal_type() const {
 4921|   486M|  ::google::protobuf::internal::TSanRead(&_impl_);
 4922|   486M|  return static_cast<::sentencepiece::ModelProto_SentencePiece_Type>(_impl_.type_);
 4923|   486M|}
_ZNK13sentencepiece10ModelProto6piecesEi:
 4949|   591M|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4950|       |  // @@protoc_insertion_point(field_get:sentencepiece.ModelProto.pieces)
 4951|   591M|  return _internal_pieces().Get(index);
 4952|   591M|}
_ZNK13sentencepiece10ModelProto6piecesEv:
 4969|      2|    ABSL_ATTRIBUTE_LIFETIME_BOUND {
 4970|       |  // @@protoc_insertion_point(field_list:sentencepiece.ModelProto.pieces)
 4971|      2|  return _internal_pieces();
 4972|      2|}

_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEED2Ev:
   39|  9.67k|  virtual ~FreeList() = default;
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEEaSEOS5_:
   44|  5.57k|  FreeList& operator=(FreeList&& other) noexcept = default;
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEED2Ev:
   39|  10.9k|  virtual ~FreeList() = default;
_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEEC2Em:
   38|  9.67k|  explicit FreeList(size_t chunk_size) : chunk_size_(chunk_size) {}
_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEE8AllocateEv:
   59|  85.7M|  T* Allocate() {
   60|  85.7M|    if (element_index_ >= chunk_size_) {
  ------------------
  |  Branch (60:9): [True: 81.4k, False: 85.6M]
  ------------------
   61|  81.4k|      ++chunk_index_;
   62|  81.4k|      element_index_ = 0;
   63|  81.4k|    }
   64|       |
   65|  85.7M|    if (chunk_index_ == freelist_.size()) {
  ------------------
  |  Branch (65:9): [True: 91.1k, False: 85.6M]
  ------------------
   66|  91.1k|      auto chunk = std::make_unique<T[]>(chunk_size_);
   67|  91.1k|      std::memset(static_cast<void*>(chunk.get()), 0, sizeof(T) * chunk_size_);
   68|  91.1k|      freelist_.push_back(std::move(chunk));
   69|  91.1k|    }
   70|       |
   71|  85.7M|    T* result = freelist_[chunk_index_].get() + element_index_;
   72|  85.7M|    ++element_index_;
   73|       |
   74|  85.7M|    return result;
   75|  85.7M|  }
_ZNK13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEE4sizeEv:
   56|  85.7M|  size_t size() const { return chunk_size_ * chunk_index_ + element_index_; }
_ZN13sentencepiece5model8FreeListINS_7unigram7Lattice4NodeEE4FreeEv:
   47|  9.67k|  void Free() {
   48|  9.67k|    for (auto& chunk : freelist_) {
  ------------------
  |  Branch (48:22): [True: 0, False: 9.67k]
  ------------------
   49|      0|      std::memset(static_cast<void*>(chunk.get()), 0, sizeof(T) * chunk_size_);
   50|      0|    }
   51|  9.67k|    chunk_index_ = 0;
   52|  9.67k|    element_index_ = 0;
   53|  9.67k|  }
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEE8AllocateEv:
   59|   470M|  T* Allocate() {
   60|   470M|    if (element_index_ >= chunk_size_) {
  ------------------
  |  Branch (60:9): [True: 914k, False: 469M]
  ------------------
   61|   914k|      ++chunk_index_;
   62|   914k|      element_index_ = 0;
   63|   914k|    }
   64|       |
   65|   470M|    if (chunk_index_ == freelist_.size()) {
  ------------------
  |  Branch (65:9): [True: 925k, False: 469M]
  ------------------
   66|   925k|      auto chunk = std::make_unique<T[]>(chunk_size_);
   67|   925k|      std::memset(static_cast<void*>(chunk.get()), 0, sizeof(T) * chunk_size_);
   68|   925k|      freelist_.push_back(std::move(chunk));
   69|   925k|    }
   70|       |
   71|   470M|    T* result = freelist_[chunk_index_].get() + element_index_;
   72|   470M|    ++element_index_;
   73|       |
   74|   470M|    return result;
   75|   470M|  }
unigram_model.cc:_ZN13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEEC2Em:
   38|  10.9k|  explicit FreeList(size_t chunk_size) : chunk_size_(chunk_size) {}
unigram_model.cc:_ZNK13sentencepiece5model8FreeListINS_7unigram12_GLOBAL__N_110HypothesisEE4sizeEv:
   56|   382M|  size_t size() const { return chunk_size_ * chunk_index_ + element_index_; }

_ZN13sentencepiece12ModelFactory6CreateERKNS_10ModelProtoE:
   29|      2|    const ModelProto& model_proto) {
   30|      2|  const auto& trainer_spec = model_proto.trainer_spec();
   31|       |
   32|      2|  switch (trainer_spec.model_type()) {
   33|      2|    case TrainerSpec::UNIGRAM:
  ------------------
  |  Branch (33:5): [True: 2, False: 0]
  ------------------
   34|      2|      return std::make_unique<unigram::Model>(model_proto);
   35|      0|    case TrainerSpec::BPE:
  ------------------
  |  Branch (35:5): [True: 0, False: 2]
  ------------------
   36|      0|      return std::make_unique<bpe::Model>(model_proto);
   37|      0|    case TrainerSpec::WORD:
  ------------------
  |  Branch (37:5): [True: 0, False: 2]
  ------------------
   38|      0|      return std::make_unique<word::Model>(model_proto);
   39|      0|    case TrainerSpec::CHAR:
  ------------------
  |  Branch (39:5): [True: 0, False: 2]
  ------------------
   40|      0|      return std::make_unique<character::Model>(model_proto);
   41|      0|    default:
  ------------------
  |  Branch (41:5): [True: 0, False: 2]
  ------------------
   42|      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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
   43|      0|      return nullptr;
   44|      2|  }
   45|      2|}

_ZNK13sentencepiece14ModelInterface9unk_pieceEv:
   51|      2|absl::string_view ModelInterface::unk_piece() const {
   52|      2|  RETURN_PIECE(unk_piece, "<unk>");
  ------------------
  |  |   48|      2|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (48:7): [True: 0, False: 2]
  |  |  ------------------
  |  |   49|      2|  return model_proto_->trainer_spec().name();
  ------------------
   53|      0|}
_ZNK13sentencepiece14ModelInterface9bos_pieceEv:
   55|      2|absl::string_view ModelInterface::bos_piece() const {
   56|      2|  RETURN_PIECE(bos_piece, "<s>");
  ------------------
  |  |   48|      2|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (48:7): [True: 0, False: 2]
  |  |  ------------------
  |  |   49|      2|  return model_proto_->trainer_spec().name();
  ------------------
   57|      0|}
_ZNK13sentencepiece14ModelInterface9eos_pieceEv:
   59|      2|absl::string_view ModelInterface::eos_piece() const {
   60|      2|  RETURN_PIECE(eos_piece, "</s>");
  ------------------
  |  |   48|      2|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (48:7): [True: 0, False: 2]
  |  |  ------------------
  |  |   49|      2|  return model_proto_->trainer_spec().name();
  ------------------
   61|      0|}
_ZNK13sentencepiece14ModelInterface9pad_pieceEv:
   63|      2|absl::string_view ModelInterface::pad_piece() const {
   64|      2|  RETURN_PIECE(pad_piece, "<pad>");
  ------------------
  |  |   48|      2|  if (model_proto_->trainer_spec().name().empty()) return default_value; \
  |  |  ------------------
  |  |  |  Branch (48:7): [True: 0, False: 2]
  |  |  ------------------
  |  |   49|      2|  return model_proto_->trainer_spec().name();
  ------------------
   65|      0|}
_ZN13sentencepiece14ModelInterface16InitializePiecesEb:
   83|      2|void ModelInterface::InitializePieces(bool use_reserved_id_map) {
   84|      2|  pieces_.clear();
   85|      2|  reserved_id_map_.clear();
   86|      2|  unk_id_ = -1;
   87|       |
   88|      2|  std::set<absl::string_view> user_defined_symbols;
   89|      2|  std::vector<bool> byte_found(256, false);
   90|       |
   91|      2|  int pieces_size = 0;
   92|      2|  int reserved_id_map_size = 0;
   93|    598|  for (int i = 0; i < model_proto_->pieces_size(); ++i) {
  ------------------
  |  Branch (93:19): [True: 596, False: 2]
  ------------------
   94|    596|    const auto& sp = model_proto_->pieces(i);
   95|    596|    static constexpr size_t kMaxPieceSize = 8000;
   96|    596|    if (sp.piece().size() >= kMaxPieceSize) {
  ------------------
  |  Branch (96:9): [True: 0, False: 596]
  ------------------
   97|      0|      status_ = absl::InternalError("piece is too long.");
   98|      0|      return;
   99|      0|    }
  100|    596|    const bool is_normal_piece =
  101|    596|        (sp.type() == ModelProto::SentencePiece::NORMAL ||
  ------------------
  |  Branch (101:10): [True: 78, False: 518]
  ------------------
  102|    518|         sp.type() == ModelProto::SentencePiece::USER_DEFINED ||
  ------------------
  |  Branch (102:10): [True: 0, False: 518]
  ------------------
  103|    518|         sp.type() == ModelProto::SentencePiece::UNUSED);
  ------------------
  |  Branch (103:10): [True: 0, False: 518]
  ------------------
  104|    596|    if (is_normal_piece || !use_reserved_id_map) {
  ------------------
  |  Branch (104:9): [True: 78, False: 518]
  |  Branch (104:28): [True: 0, False: 518]
  ------------------
  105|     78|      ++pieces_size;
  106|    518|    } else {
  107|    518|      ++reserved_id_map_size;
  108|    518|    }
  109|    596|  }
  110|      2|  pieces_.reserve(pieces_size);
  111|      2|  reserved_id_map_.reserve(reserved_id_map_size);
  112|       |
  113|    598|  for (int i = 0; i < model_proto_->pieces_size(); ++i) {
  ------------------
  |  Branch (113:19): [True: 596, False: 2]
  ------------------
  114|    596|    const auto& sp = model_proto_->pieces(i);
  115|    596|    if (sp.piece().empty()) {
  ------------------
  |  Branch (115:9): [True: 0, False: 596]
  ------------------
  116|      0|      status_ = absl::InternalError("piece must not be empty.");
  117|      0|      return;
  118|      0|    }
  119|    596|    if (sp.piece() == kNullPiece &&
  ------------------
  |  Branch (119:9): [True: 0, False: 596]
  ------------------
  120|      0|        sp.type() == ModelProto::SentencePiece::UNUSED) {
  ------------------
  |  Branch (120:9): [True: 0, False: 0]
  ------------------
  121|      0|      continue;
  122|      0|    }
  123|    596|    if (sp.piece().find('\0') != absl::string_view::npos) {
  ------------------
  |  Branch (123:9): [True: 0, False: 596]
  ------------------
  124|      0|      status_ = absl::InternalError("piece must not include null character.");
  125|      0|      return;
  126|      0|    }
  127|    596|    if (use_reserved_id_map) {
  ------------------
  |  Branch (127:9): [True: 596, False: 0]
  ------------------
  128|    596|      const bool is_normal_piece =
  129|    596|          (sp.type() == ModelProto::SentencePiece::NORMAL ||
  ------------------
  |  Branch (129:12): [True: 78, False: 518]
  ------------------
  130|    518|           sp.type() == ModelProto::SentencePiece::USER_DEFINED ||
  ------------------
  |  Branch (130:12): [True: 0, False: 518]
  ------------------
  131|    518|           sp.type() == ModelProto::SentencePiece::UNUSED);
  ------------------
  |  Branch (131:12): [True: 0, False: 518]
  ------------------
  132|    596|      auto* target_map = is_normal_piece ? &pieces_ : &reserved_id_map_;
  ------------------
  |  Branch (132:26): [True: 78, False: 518]
  ------------------
  133|    596|      if (!target_map->emplace(sp.piece(), i).second) {
  ------------------
  |  Branch (133:11): [True: 0, False: 596]
  ------------------
  134|      0|        status_ = absl::InternalError(
  135|      0|            absl::StrCat(sp.piece(), " is already defined."));
  136|      0|        return;
  137|      0|      }
  138|    596|    } else if (!pieces_.emplace(sp.piece(), i).second) {
  ------------------
  |  Branch (138:16): [True: 0, False: 0]
  ------------------
  139|      0|      status_ =
  140|      0|          absl::InternalError(absl::StrCat(sp.piece(), " is already defined."));
  141|      0|      return;
  142|      0|    }
  143|       |
  144|    596|    if (sp.type() == ModelProto::SentencePiece::USER_DEFINED) {
  ------------------
  |  Branch (144:9): [True: 0, False: 596]
  ------------------
  145|      0|      user_defined_symbols.insert(sp.piece());
  146|      0|    }
  147|       |
  148|    596|    if (sp.type() == ModelProto::SentencePiece::UNKNOWN) {
  ------------------
  |  Branch (148:9): [True: 2, False: 594]
  ------------------
  149|      2|      if (unk_id_ >= 0) {
  ------------------
  |  Branch (149:11): [True: 0, False: 2]
  ------------------
  150|      0|        status_ = absl::InternalError("unk is already defined.");
  151|      0|        return;
  152|      0|      }
  153|      2|      unk_id_ = i;
  154|      2|    }
  155|       |
  156|    596|    if (sp.type() == ModelProto::SentencePiece::BYTE) {
  ------------------
  |  Branch (156:9): [True: 512, False: 84]
  ------------------
  157|    512|      if (!model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (157:11): [True: 0, False: 512]
  ------------------
  158|      0|        status_ = absl::InternalError(
  159|      0|            absl::StrCat("byte piece ", sp.piece(),
  160|      0|                         " is found although `byte_fallback` is false."));
  161|      0|        return;
  162|      0|      }
  163|    512|      const int byte = PieceToByte(sp.piece());
  164|    512|      if (0 <= byte && byte < 256) {
  ------------------
  |  Branch (164:11): [True: 512, False: 0]
  |  Branch (164:24): [True: 512, False: 0]
  ------------------
  165|    512|        byte_found[byte] = true;
  166|    512|      } else {
  167|      0|        status_ = absl::InternalError(
  168|      0|            absl::StrCat("byte piece ", sp.piece(), " is invalid."));
  169|      0|        return;
  170|      0|      }
  171|    512|    }
  172|    596|  }
  173|       |
  174|      2|  if (unk_id_ == -1 && !model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (174:7): [True: 0, False: 2]
  |  Branch (174:24): [True: 0, False: 0]
  ------------------
  175|      0|    status_ = absl::InternalError("unk is not defined.");
  176|      0|    return;
  177|      0|  }
  178|       |
  179|      2|  if (model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (179:7): [True: 2, False: 0]
  ------------------
  180|       |    // Checks that there are 256 byte pieces.
  181|      2|    if (std::find(byte_found.begin(), byte_found.end(), false) !=
  ------------------
  |  Branch (181:9): [True: 0, False: 2]
  ------------------
  182|      2|        byte_found.end()) {
  183|      0|      status_ = absl::InternalError(
  184|      0|          "there are not 256 byte pieces although `byte_fallback` is true.");
  185|      0|      return;
  186|      0|    }
  187|      2|  }
  188|       |
  189|      2|  matcher_ = std::make_unique<normalizer::PrefixMatcher>(user_defined_symbols);
  190|      2|}
_ZN13sentencepiece11ByteToPieceEh:
  256|   253M|const std::string& ByteToPiece(unsigned char c) {
  257|   253M|  static const absl::NoDestructor<std::vector<std::string>> kBytePieces([] {
  258|   253M|    std::vector<std::string> v(256);
  259|   253M|    for (int i = 0; i < 256; ++i) {
  260|   253M|      v[i] = absl::StrFormat("<0x%02X>", i);
  261|   253M|    }
  262|   253M|    return v;
  263|   253M|  }());
  264|   253M|  return (*kBytePieces)[c];
  265|   253M|}
_ZN13sentencepiece11PieceToByteENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEE:
  267|  97.4M|int PieceToByte(absl::string_view piece) {
  268|  97.4M|  using PieceToByteMap = absl::flat_hash_map<absl::string_view, unsigned char>;
  269|  97.4M|  static const absl::NoDestructor<PieceToByteMap> kMap([] {
  270|  97.4M|    PieceToByteMap m;
  271|  97.4M|    for (int i = 0; i < 256; ++i) {
  272|  97.4M|      m[ByteToPiece(i)] = i;
  273|  97.4M|    }
  274|  97.4M|    return m;
  275|  97.4M|  }());
  276|       |
  277|  97.4M|  if (const auto it = kMap->find(piece); it != kMap->end()) {
  ------------------
  |  Branch (277:42): [True: 97.4M, False: 0]
  ------------------
  278|  97.4M|    return it->second;
  279|  97.4M|  }
  280|       |
  281|      0|  return -1;
  282|  97.4M|}
model_interface.cc:_ZZN13sentencepiece11ByteToPieceEhENK3$_0clEv:
  257|      2|  static const absl::NoDestructor<std::vector<std::string>> kBytePieces([] {
  258|      2|    std::vector<std::string> v(256);
  259|    514|    for (int i = 0; i < 256; ++i) {
  ------------------
  |  Branch (259:21): [True: 512, False: 2]
  ------------------
  260|    512|      v[i] = absl::StrFormat("<0x%02X>", i);
  261|    512|    }
  262|      2|    return v;
  263|      2|  }());
model_interface.cc:_ZZN13sentencepiece11PieceToByteENSt3__117basic_string_viewIcNS0_11char_traitsIcEEEEENK3$_0clEv:
  269|      2|  static const absl::NoDestructor<PieceToByteMap> kMap([] {
  270|      2|    PieceToByteMap m;
  271|    514|    for (int i = 0; i < 256; ++i) {
  ------------------
  |  Branch (271:21): [True: 512, False: 2]
  ------------------
  272|    512|      m[ByteToPiece(i)] = i;
  273|    512|    }
  274|      2|    return m;
  275|      2|  }());

_ZNK13sentencepiece14ModelInterface6statusEv:
   71|   140k|  virtual absl::Status status() const { return status_; }
_ZNK13sentencepiece14ModelInterface14prefix_matcherEv:
   78|      2|      const {
   79|      2|    return matcher_.get();
   80|      2|  }
_ZNK13sentencepiece14ModelInterface9IdToPieceEi:
  119|  57.8M|  [[nodiscard]] virtual const std::string& IdToPiece(int id) const {
  120|  57.8M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  57.8M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  57.8M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  57.8M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 57.8M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  57.8M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  121|  57.8M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  57.8M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  57.8M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  57.8M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 57.8M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  57.8M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  122|  57.8M|    return model_proto_->pieces(id).piece();
  123|  57.8M|  }
_ZNK13sentencepiece14ModelInterface12GetPieceSizeEv:
  127|   416M|  [[nodiscard]] virtual int GetPieceSize() const {
  128|   416M|    if (model_proto_ == nullptr) {
  ------------------
  |  Branch (128:9): [True: 0, False: 416M]
  ------------------
  129|      0|      return 0;
  130|      0|    }
  131|   416M|    return model_proto_->pieces_size();
  132|   416M|  }
_ZNK13sentencepiece14ModelInterface8GetScoreEi:
  137|  12.0k|  [[nodiscard]] virtual float GetScore(int id) const {
  138|  12.0k|    return GetScoreInlined(id);
  139|  12.0k|  }
_ZNK13sentencepiece14ModelInterface9IsUnknownEi:
  142|  63.5M|  [[nodiscard]] virtual bool IsUnknown(int id) const {
  143|  63.5M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  63.5M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  63.5M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  63.5M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 63.5M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  63.5M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  144|  63.5M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  63.5M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  63.5M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  63.5M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 63.5M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  63.5M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  145|  63.5M|    return (model_proto_->pieces(id).type() ==
  146|  63.5M|            ModelProto::SentencePiece::UNKNOWN);
  147|  63.5M|  }
_ZNK13sentencepiece14ModelInterface9IsControlEi:
  150|   210M|  [[nodiscard]] virtual bool IsControl(int id) const {
  151|   210M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|   210M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   210M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   210M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 210M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   210M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  152|   210M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|   210M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|   210M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   210M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 210M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   210M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  153|   210M|    return (model_proto_->pieces(id).type() ==
  154|   210M|            ModelProto::SentencePiece::CONTROL);
  155|   210M|  }
_ZNK13sentencepiece14ModelInterface8IsUnusedEi:
  158|  12.0k|  [[nodiscard]] virtual bool IsUnused(int id) const {
  159|  12.0k|    return IsUnusedInlined(id);
  160|  12.0k|  }
_ZNK13sentencepiece14ModelInterface6IsByteEi:
  168|   116M|  [[nodiscard]] virtual bool IsByte(int id) const {
  169|   116M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|   116M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|   116M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   116M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 116M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   116M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  170|   116M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|   116M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|   116M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|   116M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 116M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|   116M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  171|   116M|    return (model_proto_->pieces(id).type() == ModelProto::SentencePiece::BYTE);
  172|   116M|  }
_ZNK13sentencepiece14ModelInterface19ByteFallbackEnabledEv:
  174|  76.2M|  [[nodiscard]] virtual bool ByteFallbackEnabled() const {
  175|  76.2M|    return (model_proto_ != nullptr) &&
  ------------------
  |  Branch (175:12): [True: 76.2M, False: 0]
  ------------------
  176|  76.2M|           model_proto_->trainer_spec().byte_fallback();
  ------------------
  |  Branch (176:12): [True: 76.2M, False: 0]
  ------------------
  177|  76.2M|  }
_ZNK13sentencepiece14ModelInterface15GetScoreInlinedEi:
  188|  47.7M|  [[nodiscard]] float GetScoreInlined(int id) const {
  189|  47.7M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  47.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 47.7M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  47.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  190|  47.7M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  47.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 47.7M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  47.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  191|  47.7M|    return model_proto_->pieces(id).score();
  192|  47.7M|  }
_ZNK13sentencepiece14ModelInterface15IsUnusedInlinedEi:
  194|  47.7M|  [[nodiscard]] bool IsUnusedInlined(int id) const {
  195|  47.7M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  47.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 47.7M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  47.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  196|  47.7M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  47.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 47.7M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  47.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  197|  47.7M|    return (model_proto_->pieces(id).type() ==
  198|  47.7M|            ModelProto::SentencePiece::UNUSED);
  199|  47.7M|  }
_ZNK13sentencepiece14ModelInterface20IsUserDefinedInlinedEi:
  201|  47.7M|  [[nodiscard]] bool IsUserDefinedInlined(int id) const {
  202|  47.7M|    DCHECK_GE(id, 0);
  ------------------
  |  |  150|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_GE_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   95|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  47.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 47.7M]
  |  |  |  |  |  |  |  Branch (63:19): [Folded, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  47.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  203|  47.7M|    DCHECK_LT(id, model_proto_->pieces_size());
  ------------------
  |  |  148|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_LT_IMPL((val1), #val1, (val2), #val2)
  |  |  ------------------
  |  |  |  |   93|  47.7M|  ABSL_LOG_INTERNAL_DCHECK_NOP(val1, val2)
  |  |  |  |  ------------------
  |  |  |  |  |  |   63|  47.7M|  while (false && ((void)(x), (void)(y), 0)) \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (63:10): [Folded, False: 47.7M]
  |  |  |  |  |  |  |  Branch (63:19): [True: 0, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |   64|  47.7M|  ::absl::log_internal::NullStream().InternalStream()
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  204|  47.7M|    return (model_proto_->pieces(id).type() ==
  205|  47.7M|            ModelProto::SentencePiece::USER_DEFINED);
  206|  47.7M|  }
_ZN13sentencepiece14ModelInterfaceC2Ev:
   65|      2|  ModelInterface() = default;

_ZN13sentencepiece10normalizer10NormalizerC2ERKNS_14NormalizerSpecERKNS_11TrainerSpecE:
   42|      2|    : spec_(&spec),
   43|      2|      treat_whitespace_as_suffix_(trainer_spec.treat_whitespace_as_suffix()),
   44|      2|      status_(absl::OkStatus()) {
   45|      2|  Init();
   46|      2|}
_ZN13sentencepiece10normalizer10Normalizer4InitEv:
   55|      2|void Normalizer::Init() {
   56|      2|  absl::string_view index = spec_->precompiled_charsmap();
   57|       |
   58|      2|  if (!index.empty()) {
  ------------------
  |  Branch (58:7): [True: 0, False: 2]
  ------------------
   59|      0|    absl::string_view trie_blob;
   60|      0|    status_ = DecodePrecompiledCharsMap(index, &trie_blob, &normalized_,
   61|      0|                                        &precompiled_charsmap_buffer_);
   62|       |
   63|      0|    if (!status_.ok()) return;
  ------------------
  |  Branch (63:9): [True: 0, False: 0]
  ------------------
   64|       |
   65|       |    // Reads the body of double array.
   66|      0|    trie_ = std::make_unique<Darts::DoubleArray>();
   67|       |
   68|       |    // copy_array ensures correct alignment even if the trie_blob is
   69|       |    // mis-aligned. Although standard proto parsing copies data to the heap
   70|       |    // (guaranteeing alignment), zero-copy parsing or custom buffers might
   71|       |    // pass misaligned data.
   72|      0|    if (reinterpret_cast<uintptr_t>(trie_blob.data()) % 4 == 0) {
  ------------------
  |  Branch (72:9): [True: 0, False: 0]
  ------------------
   73|      0|      trie_->set_array(const_cast<char*>(trie_blob.data()),
   74|      0|                       trie_blob.size() / trie_->unit_size());
   75|      0|    } else {
   76|      0|      trie_->copy_array(reinterpret_cast<const char*>(trie_blob.data()),
   77|      0|                        trie_blob.size());
   78|      0|    }
   79|       |
   80|      0|    if (!trie_->validate(normalized_.size())) {
  ------------------
  |  Branch (80:9): [True: 0, False: 0]
  ------------------
   81|      0|      status_ = absl::InternalError("precompiled_charsmap is invalid.");
   82|      0|      trie_.reset();
   83|      0|      return;
   84|      0|    }
   85|      0|  }
   86|      2|}
_ZNK13sentencepiece10normalizer10Normalizer9NormalizeENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEPNS2_12basic_stringIcS5_NS2_9allocatorIcEEEEPNS2_6vectorImNS8_ImEEEE:
   90|  17.9k|                                   std::vector<size_t>* norm_to_orig) const {
   91|  17.9k|  if (norm_to_orig) norm_to_orig->clear();
  ------------------
  |  Branch (91:7): [True: 11.5k, False: 6.43k]
  ------------------
   92|  17.9k|  normalized->clear();
   93|       |
   94|  17.9k|  if (input.empty()) {
  ------------------
  |  Branch (94:7): [True: 0, False: 17.9k]
  ------------------
   95|      0|    return absl::OkStatus();
   96|      0|  }
   97|       |
   98|  17.9k|  ABSL_RETURN_IF_ERROR(status());
  ------------------
  |  |   90|  17.9k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  53.8k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  35.8k|  switch (0)                                           \
  |  |  |  |  |  |  350|  35.8k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 17.9k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  17.9k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 17.9k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  53.8k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 17.9k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  53.8k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  53.8k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  17.9k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  53.8k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
   99|       |
  100|  17.9k|  size_t consumed = 0;
  101|       |
  102|       |  // Ignores heading space.
  103|  17.9k|  if (spec_->remove_extra_whitespaces()) {
  ------------------
  |  Branch (103:7): [True: 17.9k, False: 0]
  ------------------
  104|  9.45M|    while (!input.empty()) {
  ------------------
  |  Branch (104:12): [True: 9.45M, False: 127]
  ------------------
  105|  9.45M|      const auto p = NormalizePrefix(input);
  106|  9.45M|      if (p.first != " ") {
  ------------------
  |  Branch (106:11): [True: 17.8k, False: 9.43M]
  ------------------
  107|  17.8k|        break;
  108|  17.8k|      }
  109|  9.43M|      input.remove_prefix(p.second);
  110|  9.43M|      consumed += p.second;
  111|  9.43M|    }
  112|  17.9k|  }
  113|       |
  114|       |  // all chars are whitespace.
  115|  17.9k|  if (input.empty()) {
  ------------------
  |  Branch (115:7): [True: 127, False: 17.8k]
  ------------------
  116|    127|    return absl::OkStatus();
  117|    127|  }
  118|       |
  119|       |  // Reserves the output buffer to avoid re-allocations.
  120|  17.8k|  const size_t kReservedSize = input.size() * 1.5;
  121|  17.8k|  normalized->reserve(kReservedSize);
  122|  17.8k|  if (norm_to_orig) norm_to_orig->reserve(kReservedSize);
  ------------------
  |  Branch (122:7): [True: 11.4k, False: 6.38k]
  ------------------
  123|       |
  124|       |  // Replaces white space with U+2581 (LOWER ONE EIGHT BLOCK)
  125|       |  // if escape_whitespaces() is set (default = true).
  126|  17.8k|  const absl::string_view kSpaceSymbol =
  127|  17.8k|      spec_->escape_whitespaces() ? "\xe2\x96\x81" : " ";
  ------------------
  |  Branch (127:7): [True: 17.8k, False: 0]
  ------------------
  128|       |
  129|       |  // adds kSpaceSymbol to the current context.
  130|  17.8k|  auto add_ws = [&consumed, &normalized, &norm_to_orig, &kSpaceSymbol]() {
  131|  17.8k|    normalized->append(kSpaceSymbol.data(), kSpaceSymbol.size());
  132|  17.8k|    if (norm_to_orig) {
  133|  17.8k|      norm_to_orig->insert(norm_to_orig->end(), kSpaceSymbol.size(), consumed);
  134|  17.8k|    }
  135|  17.8k|  };
  136|       |
  137|       |  // Adds a space symbol as a prefix (default is true)
  138|       |  // With this prefix, "world" and "hello world" are converted into
  139|       |  // "_world" and "_hello_world", which help the trainer to extract
  140|       |  // "_world" as one symbol.
  141|  17.8k|  if (!treat_whitespace_as_suffix_ && spec_->add_dummy_prefix()) add_ws();
  ------------------
  |  Branch (141:7): [True: 17.8k, False: 0]
  |  Branch (141:39): [True: 17.8k, False: 0]
  ------------------
  142|       |
  143|  17.8k|  bool is_prev_space = spec_->remove_extra_whitespaces();
  144|   276M|  while (!input.empty()) {
  ------------------
  |  Branch (144:10): [True: 276M, False: 17.8k]
  ------------------
  145|   276M|    auto p = NormalizePrefix(input);
  146|   276M|    absl::string_view sp = p.first;
  147|       |
  148|       |    // Removes heading spaces in sentence piece,
  149|       |    // if the previous sentence piece ends with whitespace.
  150|   279M|    while (is_prev_space && absl::ConsumePrefix(&sp, " ")) {
  ------------------
  |  Branch (150:12): [True: 16.0M, False: 263M]
  |  Branch (150:29): [True: 2.93M, False: 13.1M]
  ------------------
  151|  2.93M|    }
  152|       |
  153|   276M|    if (!sp.empty()) {
  ------------------
  |  Branch (153:9): [True: 273M, False: 2.93M]
  ------------------
  154|   273M|      const char* data = sp.data();
  155|   668M|      for (size_t n = 0; n < sp.size(); ++n) {
  ------------------
  |  Branch (155:26): [True: 394M, False: 273M]
  ------------------
  156|   394M|        if (data[n] == ' ') {
  ------------------
  |  Branch (156:13): [True: 10.1M, False: 384M]
  ------------------
  157|  10.1M|          add_ws();
  158|   384M|        } else {
  159|   384M|          *normalized += data[n];
  160|   384M|          if (norm_to_orig) norm_to_orig->push_back(consumed);
  ------------------
  |  Branch (160:15): [True: 185M, False: 199M]
  ------------------
  161|   384M|        }
  162|   394M|      }
  163|       |      // Checks whether the last character of sp is whitespace.
  164|   273M|      is_prev_space = absl::EndsWith(sp, " ");
  165|   273M|    }
  166|       |
  167|   276M|    consumed += p.second;
  168|   276M|    input.remove_prefix(p.second);
  169|   276M|    if (!spec_->remove_extra_whitespaces()) {
  ------------------
  |  Branch (169:9): [True: 0, False: 276M]
  ------------------
  170|      0|      is_prev_space = false;
  171|      0|    }
  172|   276M|  }
  173|       |
  174|       |  // Ignores trailing space.
  175|  17.8k|  if (spec_->remove_extra_whitespaces()) {
  ------------------
  |  Branch (175:7): [True: 17.8k, False: 0]
  ------------------
  176|  19.7k|    while (absl::EndsWith(*normalized, kSpaceSymbol)) {
  ------------------
  |  Branch (176:12): [True: 1.93k, False: 17.8k]
  ------------------
  177|  1.93k|      const int length = normalized->size() - kSpaceSymbol.size();
  178|  1.93k|      RET_CHECK_GE(length, 0);
  ------------------
  |  |   30|  1.93k|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  1.93k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.93k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.93k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.93k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  179|  1.93k|      normalized->resize(length);
  180|  1.93k|      if (norm_to_orig) {
  ------------------
  |  Branch (180:11): [True: 1.18k, False: 745]
  ------------------
  181|  1.18k|        consumed = (*norm_to_orig)[length];
  182|  1.18k|        norm_to_orig->resize(length);
  183|  1.18k|      }
  184|  1.93k|    }
  185|  17.8k|  }
  186|       |
  187|       |  // Adds a space symbol as a suffix (default is false)
  188|  17.8k|  if (treat_whitespace_as_suffix_ && spec_->add_dummy_prefix()) add_ws();
  ------------------
  |  Branch (188:7): [True: 0, False: 17.8k]
  |  Branch (188:38): [True: 0, False: 0]
  ------------------
  189|       |
  190|  17.8k|  if (norm_to_orig) {
  ------------------
  |  Branch (190:7): [True: 11.4k, False: 6.38k]
  ------------------
  191|  11.4k|    norm_to_orig->push_back(consumed);
  192|  11.4k|    RET_CHECK_EQ(norm_to_orig->size(), normalized->size() + 1);
  ------------------
  |  |   28|  11.4k|#define RET_CHECK_EQ(a, b) RET_CHECK((a) == (b))
  |  |  ------------------
  |  |  |  |   23|  11.4k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 11.4k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  11.4k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  11.4k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  193|  11.4k|  }
  194|       |
  195|  17.8k|  return absl::OkStatus();
  196|  17.8k|}
_ZNK13sentencepiece10normalizer10Normalizer15NormalizePrefixENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  205|   286M|    absl::string_view input) const {
  206|   286M|  if (input.empty()) return {};
  ------------------
  |  Branch (206:7): [True: 0, False: 286M]
  ------------------
  207|       |
  208|   286M|  if (matcher_ != nullptr) {
  ------------------
  |  Branch (208:7): [True: 286M, False: 0]
  ------------------
  209|   286M|    bool found = false;
  210|   286M|    const int mblen = matcher_->PrefixMatch(input, &found);
  211|   286M|    if (found) return {input.substr(0, mblen), mblen};
  ------------------
  |  Branch (211:9): [True: 0, False: 286M]
  ------------------
  212|   286M|  }
  213|       |
  214|   286M|  size_t longest_length = 0;
  215|   286M|  size_t longest_value = 0;
  216|       |
  217|   286M|  if (trie_ != nullptr) {
  ------------------
  |  Branch (217:7): [True: 0, False: 286M]
  ------------------
  218|       |    // Allocates trie_results in stack, which makes the encoding speed 36%
  219|       |    // faster. (38k sentences/sec => 60k sentences/sec). Builder checks that the
  220|       |    // result size never exceeds kMaxTrieResultsSize. This array consumes
  221|       |    // 0.5kByte in stack, which is less than default stack frames (16kByte).
  222|      0|    Darts::DoubleArray::result_pair_type
  223|      0|        trie_results[Normalizer::kMaxTrieResultsSize];
  224|       |
  225|       |    // commonPrefixSearch returns the total number of matches, which can be
  226|       |    // larger than the buffer size (see darts.h). A precompiled charsmap loaded
  227|       |    // from an untrusted model is not subject to the build-time
  228|       |    // kMaxTrieResultsSize check, so cap the count to the buffer capacity before
  229|       |    // indexing trie_results.
  230|      0|    const size_t num_nodes =
  231|      0|        std::min<size_t>(trie_->commonPrefixSearch(
  232|      0|                             input.data(), trie_results,
  233|      0|                             Normalizer::kMaxTrieResultsSize, input.size()),
  234|      0|                         Normalizer::kMaxTrieResultsSize);
  235|       |
  236|       |    // Finds the longest rule.
  237|      0|    for (size_t k = 0; k < num_nodes; ++k) {
  ------------------
  |  Branch (237:24): [True: 0, False: 0]
  ------------------
  238|      0|      if (longest_length == 0 || trie_results[k].length > longest_length) {
  ------------------
  |  Branch (238:11): [True: 0, False: 0]
  |  Branch (238:34): [True: 0, False: 0]
  ------------------
  239|      0|        longest_length = trie_results[k].length;  // length of prefix
  240|      0|        longest_value = trie_results[k].value;    // pointer to |normalized_|.
  241|      0|      }
  242|      0|    }
  243|      0|  }
  244|       |
  245|   286M|  std::pair<absl::string_view, int> result;
  246|   286M|  if (longest_length == 0 || longest_length > input.size() ||
  ------------------
  |  Branch (246:7): [True: 286M, False: 0]
  |  Branch (246:30): [True: 0, False: 0]
  ------------------
  247|   286M|      longest_value >= normalized_.size()) {
  ------------------
  |  Branch (247:7): [True: 0, False: 0]
  ------------------
  248|   286M|    size_t length = 0;
  249|   286M|    if (!string_util::IsValidDecodeUTF8(input, &length)) {
  ------------------
  |  Branch (249:9): [True: 59.5M, False: 226M]
  ------------------
  250|       |      // Found a malformed utf8.
  251|       |      // The rune is set to be 0xFFFD (REPLACEMENT CHARACTER),
  252|       |      // which is a valid Unicode of three bytes in utf8,
  253|       |      // but here we only consume one byte.
  254|  59.5M|      result.second = 1;
  255|  59.5M|      static constexpr absl::string_view kReplacementChar = "\xEF\xBF\xBD";
  256|  59.5M|      result.first = kReplacementChar;
  257|   226M|    } else {
  258|   226M|      result.second = length;
  259|   226M|      result.first = absl::string_view(input.data(), result.second);
  260|   226M|    }
  261|   286M|  } else {
  262|      0|    result.second = longest_length;
  263|       |    // No need to pass the size of normalized sentence,
  264|       |    // since |normalized| is delimitered by "\0".
  265|      0|    result.first = normalized_.data() + longest_value;
  266|      0|  }
  267|       |
  268|   286M|  return result;
  269|   286M|}
_ZN13sentencepiece10normalizer13PrefixMatcherC2ERKNSt3__13setINS2_17basic_string_viewIcNS2_11char_traitsIcEEEENS2_4lessIS7_EENS2_9allocatorIS7_EEEE:
  339|      2|PrefixMatcher::PrefixMatcher(const std::set<absl::string_view>& dic) {
  340|      2|  if (dic.empty()) return;
  ------------------
  |  Branch (340:7): [True: 2, False: 0]
  ------------------
  341|      0|  std::vector<const char*> key;
  342|      0|  std::vector<size_t> lengths;
  343|      0|  key.reserve(dic.size());
  344|      0|  lengths.reserve(dic.size());
  345|      0|  for (const auto& it : dic) {
  ------------------
  |  Branch (345:23): [True: 0, False: 0]
  ------------------
  346|      0|    key.push_back(it.data());
  347|      0|    lengths.push_back(it.size());
  348|      0|  }
  349|      0|  trie_ = std::make_unique<Darts::DoubleArray>();
  350|      0|  if (trie_->build(key.size(), const_cast<char**>(key.data()),
  ------------------
  |  Branch (350:7): [True: 0, False: 0]
  ------------------
  351|      0|                   const_cast<size_t*>(lengths.data()), nullptr) != 0) {
  352|      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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  353|      0|    trie_.reset();
  354|      0|  }
  355|      0|}
_ZNK13sentencepiece10normalizer13PrefixMatcher11PrefixMatchENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEPb:
  357|   286M|int PrefixMatcher::PrefixMatch(absl::string_view w, bool* found) const {
  358|   286M|  if (w.empty()) {
  ------------------
  |  Branch (358:7): [True: 0, False: 286M]
  ------------------
  359|      0|    if (found) *found = false;
  ------------------
  |  Branch (359:9): [True: 0, False: 0]
  ------------------
  360|      0|    return 0;
  361|      0|  }
  362|       |
  363|   286M|  if (trie_ == nullptr) {
  ------------------
  |  Branch (363:7): [True: 286M, False: 0]
  ------------------
  364|   286M|    if (found) *found = false;
  ------------------
  |  Branch (364:9): [True: 286M, False: 0]
  ------------------
  365|   286M|    return std::min<int>(w.size(), string_util::OneCharLen(w.data()));
  366|   286M|  }
  367|       |
  368|      0|  constexpr int kResultSize = 64;
  369|      0|  Darts::DoubleArray::result_pair_type trie_results[kResultSize];
  370|      0|  const int num_nodes = std::min<int>(
  371|      0|      trie_->commonPrefixSearch(w.data(), trie_results, kResultSize, w.size()),
  372|      0|      kResultSize);
  373|       |
  374|      0|  if (found) *found = (num_nodes > 0);
  ------------------
  |  Branch (374:7): [True: 0, False: 0]
  ------------------
  375|      0|  if (num_nodes == 0) {
  ------------------
  |  Branch (375:7): [True: 0, False: 0]
  ------------------
  376|      0|    return std::min<int>(w.size(), string_util::OneCharLen(w.data()));
  377|      0|  }
  378|       |
  379|      0|  int mblen = 0;
  380|      0|  for (int i = 0; i < num_nodes; ++i) {
  ------------------
  |  Branch (380:19): [True: 0, False: 0]
  ------------------
  381|      0|    mblen = std::max<int>(trie_results[i].length, mblen);
  382|      0|  }
  383|       |
  384|      0|  return mblen;
  385|      0|}
normalizer.cc:_ZZNK13sentencepiece10normalizer10Normalizer9NormalizeENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEPNS2_12basic_stringIcS5_NS2_9allocatorIcEEEEPNS2_6vectorImNS8_ImEEEEENK3$_0clEv:
  130|  10.1M|  auto add_ws = [&consumed, &normalized, &norm_to_orig, &kSpaceSymbol]() {
  131|  10.1M|    normalized->append(kSpaceSymbol.data(), kSpaceSymbol.size());
  132|  10.1M|    if (norm_to_orig) {
  ------------------
  |  Branch (132:9): [True: 5.84M, False: 4.33M]
  ------------------
  133|  5.84M|      norm_to_orig->insert(norm_to_orig->end(), kSpaceSymbol.size(), consumed);
  134|  5.84M|    }
  135|  10.1M|  };

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

_ZN13sentencepiece22SentencePieceProcessorC2Ev:
   87|      2|SentencePieceProcessor::SentencePieceProcessor() {}
_ZN13sentencepiece22SentencePieceProcessor23LoadFromSerializedProtoENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  107|      2|    absl::string_view serialized) {
  108|      2|  auto model_proto = std::make_unique<ModelProto>();
  109|      2|  RET_CHECK(model_proto->ParseFromArray(serialized.data(), serialized.size()));
  ------------------
  |  |   23|      2|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 2, False: 0]
  |  |  ------------------
  |  |   24|      2|  } else /* NOLINT */                                         \
  |  |   25|      2|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  110|      2|  return Load(std::move(model_proto));
  111|      2|}
_ZN13sentencepiece22SentencePieceProcessor4LoadENSt3__110unique_ptrINS_10ModelProtoENS1_14default_deleteIS3_EEEE:
  114|      2|    std::unique_ptr<ModelProto> model_proto) {
  115|      2|  RET_CHECK(model_proto != nullptr);
  ------------------
  |  |   23|      2|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 2, False: 0]
  |  |  ------------------
  |  |   24|      2|  } else /* NOLINT */                                         \
  |  |   25|      2|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  116|      2|  model_proto_ = std::move(model_proto);
  117|       |  // Workaround for https://github.com/google/sentencepiece/issues/1308
  118|       |  // Third-party conversion scripts may erroneously insert a raw null-byte
  119|       |  // piece ("\0") even when byte_fallback is enabled (where "<0x00>" is
  120|       |  // already defined). Mark it as UNUSED so it is excluded from trie building
  121|       |  // and encoding.
  122|      2|  if (model_proto_->trainer_spec().byte_fallback()) {
  ------------------
  |  Branch (122:7): [True: 2, False: 0]
  ------------------
  123|    598|    for (int i = 0; i < model_proto_->pieces_size(); ++i) {
  ------------------
  |  Branch (123:21): [True: 596, False: 2]
  ------------------
  124|    596|      auto* sp = model_proto_->mutable_pieces(i);
  125|    596|      if (sp->piece() == kNullPiece) {
  ------------------
  |  Branch (125:11): [True: 0, False: 596]
  ------------------
  126|      0|        LOG(WARNING)
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|      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()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|      0|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  127|      0|            << "Piece at index " << i
  128|      0|            << " is a null character (\\0) and byte_fallback is enabled. "
  129|      0|            << "Treating it as an UNUSED piece.";
  130|      0|        sp->set_type(ModelProto::SentencePiece::UNUSED);
  131|      0|      }
  132|    596|    }
  133|      2|  }
  134|      2|  model_ = ModelFactory::Create(*model_proto_);
  135|      2|  normalizer_ = std::make_unique<normalizer::Normalizer>(
  136|      2|      model_proto_->normalizer_spec(), model_proto_->trainer_spec());
  137|      2|  if (model_proto_->has_denormalizer_spec() &&
  ------------------
  |  Branch (137:7): [True: 0, False: 2]
  ------------------
  138|      0|      !model_proto_->denormalizer_spec().precompiled_charsmap().empty()) {
  ------------------
  |  Branch (138:7): [True: 0, False: 0]
  ------------------
  139|      0|    denormalizer_ = std::make_unique<normalizer::Normalizer>(
  140|      0|        model_proto_->denormalizer_spec());
  141|      0|  }
  142|       |
  143|       |  // Escapes user-defined-symbols in normalizer.
  144|      2|  if (model_) {
  ------------------
  |  Branch (144:7): [True: 2, False: 0]
  ------------------
  145|      2|    normalizer_->SetPrefixMatcher(model_->prefix_matcher());
  146|      2|  }
  147|       |
  148|      2|  ABSL_RETURN_IF_ERROR(status());
  ------------------
  |  |   90|      2|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|      4|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|      4|  switch (0)                                           \
  |  |  |  |  |  |  350|      4|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 2, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|      2|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 2]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|      4|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 2, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|      4|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|      4|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|      2|  } else /* NOLINT */                                                     \
  |  |  |  |  167|      4|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  149|       |
  150|       |  // Precomputes and caches special token IDs.
  151|       |  // Note that these IDs are not always the same as the IDs in TrainerSpec.
  152|      2|  unk_id_ = PieceToId(model_->unk_piece());
  153|      2|  if (unk_id_ >= 0 && !model_->IsUnknown(unk_id_)) unk_id_ = -1;
  ------------------
  |  Branch (153:7): [True: 2, False: 0]
  |  Branch (153:23): [True: 0, False: 2]
  ------------------
  154|       |
  155|      2|  bos_id_ = PieceToId(model_->bos_piece());
  156|      2|  if (bos_id_ >= 0 && !IsControl(bos_id_)) bos_id_ = -1;
  ------------------
  |  Branch (156:7): [True: 2, False: 0]
  |  Branch (156:23): [True: 0, False: 2]
  ------------------
  157|       |
  158|      2|  eos_id_ = PieceToId(model_->eos_piece());
  159|      2|  if (eos_id_ >= 0 && !IsControl(eos_id_)) eos_id_ = -1;
  ------------------
  |  Branch (159:7): [True: 2, False: 0]
  |  Branch (159:23): [True: 0, False: 2]
  ------------------
  160|       |
  161|      2|  pad_id_ = PieceToId(model_->pad_piece());
  162|      2|  if (pad_id_ >= 0 && !IsControl(pad_id_)) pad_id_ = -1;
  ------------------
  |  Branch (162:7): [True: 2, False: 0]
  |  Branch (162:23): [True: 2, False: 0]
  ------------------
  163|       |
  164|      2|  return absl::OkStatus();
  165|      2|}
_ZNK13sentencepiece22SentencePieceProcessor6statusEv:
  177|   125k|absl::Status SentencePieceProcessor::status() const {
  178|   125k|  RET_CHECK(model_) << "Model is not initialized.";
  ------------------
  |  |   23|   125k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 125k, False: 0]
  |  |  ------------------
  |  |   24|   125k|  } else /* NOLINT */                                         \
  |  |   25|   125k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  179|   125k|  RET_CHECK(normalizer_) << "Normalizer is not initialized.";
  ------------------
  |  |   23|   125k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 125k, False: 0]
  |  |  ------------------
  |  |   24|   125k|  } else /* NOLINT */                                         \
  |  |   25|   125k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  180|   125k|  ABSL_RETURN_IF_ERROR(model_->status());
  ------------------
  |  |   90|   125k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|   377k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|   251k|  switch (0)                                           \
  |  |  |  |  |  |  350|   251k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 125k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|   125k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 125k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|   377k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 125k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|   377k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|   377k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|   125k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|   377k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  181|   125k|  ABSL_RETURN_IF_ERROR(normalizer_->status());
  ------------------
  |  |   90|   125k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|   377k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|   251k|  switch (0)                                           \
  |  |  |  |  |  |  350|   251k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 125k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|   125k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 125k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|   377k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 125k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|   377k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|   377k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|   125k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|   377k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  182|   125k|  if (denormalizer_) {
  ------------------
  |  Branch (182:7): [True: 0, False: 125k]
  ------------------
  183|      0|    ABSL_RETURN_IF_ERROR(denormalizer_->status());
  ------------------
  |  |   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()
  |  |  ------------------
  ------------------
  184|      0|  }
  185|   125k|  return absl::OkStatus();
  186|   125k|}
_ZNK13sentencepiece22SentencePieceProcessor6EncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_6vectorINS1_12basic_stringIcS4_NS1_9allocatorIcEEEENS8_ISA_EEEE:
  201|  3.09k|    absl::string_view input, std::vector<std::string>* pieces) const {
  202|  3.09k|  return EncodeOptimized(input, pieces);
  203|  3.09k|}
_ZNK13sentencepiece22SentencePieceProcessor6EncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_6vectorIiNS1_9allocatorIiEEEE:
  206|  1.63k|                                            std::vector<int>* ids) const {
  207|  1.63k|  return EncodeOptimized(input, ids);
  208|  1.63k|}
_ZNK13sentencepiece22SentencePieceProcessor6DecodeEN4absl12lts_202608174SpanIKNSt3__112basic_stringIcNS4_11char_traitsIcEENS4_9allocatorIcEEEEEEPSA_:
  211|  1.54k|    absl::Span<const std::string> pieces, std::string* detokenized) const {
  212|  1.54k|  absl::FixedArray<absl::string_view, 128> views(pieces.begin(), pieces.end());
  213|  1.54k|  return DecodeOptimized<absl::string_view>(views, detokenized);
  214|  1.54k|}
_ZNK13sentencepiece22SentencePieceProcessor6DecodeEN4absl12lts_202608174SpanIKiEEPNSt3__112basic_stringIcNS6_11char_traitsIcEENS6_9allocatorIcEEEE:
  223|  1.61k|                                            std::string* detokenized) const {
  224|  1.61k|  return DecodeOptimized(ids, detokenized);
  225|  1.61k|}
_ZNK13sentencepiece22SentencePieceProcessor11NBestEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEiPNS1_6vectorINS6_INS1_12basic_stringIcS4_NS1_9allocatorIcEEEENS8_ISA_EEEENS8_ISC_EEEE:
  229|  3.06k|    std::vector<std::vector<std::string>>* pieces) const {
  230|  6.12k|  RET_CHECK_STATUS_STL(pieces);
  ------------------
  |  |  189|  3.06k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  3.06k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  6.12k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  6.12k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  6.12k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 3.06k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  3.06k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.06k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  6.12k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 3.06k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  6.12k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  6.12k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  3.06k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  6.12k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  3.06k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  3.06k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 3.06k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  3.06k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  3.06k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  3.06k|  container->clear();
  ------------------
  231|       |
  232|  6.12k|  Arena arena;
  233|  6.12k|  auto* spt = Arena::Create<NBestSentencePieceText>(&arena);
  234|  6.12k|  ABSL_RETURN_IF_ERROR(NBestEncode(input, nbest_size, spt));
  ------------------
  |  |   90|  3.06k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  6.12k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  6.12k|  switch (0)                                           \
  |  |  |  |  |  |  350|  6.12k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 3.06k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  3.06k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.06k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  6.12k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 3.06k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  6.12k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  6.12k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  3.06k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  6.12k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  235|  3.06k|  pieces->reserve(spt->nbests().size());
  236|  5.90k|  for (const auto& nbest : spt->nbests()) {
  ------------------
  |  Branch (236:26): [True: 5.90k, False: 3.06k]
  ------------------
  237|  5.90k|    std::vector<std::string>& result = pieces->emplace_back();
  238|  5.90k|    result.reserve(nbest.pieces().size());
  239|  61.0M|    for (const auto& sp : nbest.pieces()) {
  ------------------
  |  Branch (239:25): [True: 61.0M, False: 5.90k]
  ------------------
  240|  61.0M|      result.emplace_back(sp.piece());
  241|  61.0M|    }
  242|  5.90k|  }
  243|       |
  244|  3.06k|  return absl::OkStatus();
  245|  6.12k|}
_ZNK13sentencepiece22SentencePieceProcessor11NBestEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEiPNS1_6vectorINS6_IiNS1_9allocatorIiEEEENS7_IS9_EEEE:
  249|  1.53k|    std::vector<std::vector<int>>* ids) const {
  250|  3.07k|  RET_CHECK_STATUS_STL(ids);
  ------------------
  |  |  189|  1.53k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.53k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  3.07k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  3.07k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  3.07k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.53k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.53k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.53k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  3.07k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.53k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  3.07k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  3.07k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.53k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  3.07k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  1.53k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.53k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.53k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.53k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.53k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  1.53k|  container->clear();
  ------------------
  251|       |
  252|  3.07k|  Arena arena;
  253|  3.07k|  auto* spt = Arena::Create<NBestSentencePieceText>(&arena);
  254|  3.07k|  ABSL_RETURN_IF_ERROR(NBestEncode(input, nbest_size, spt));
  ------------------
  |  |   90|  1.53k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  3.07k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  3.07k|  switch (0)                                           \
  |  |  |  |  |  |  350|  3.07k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.53k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.53k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.53k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  3.07k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.53k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  3.07k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  3.07k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.53k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  3.07k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  255|  1.53k|  ids->reserve(spt->nbests().size());
  256|  3.38k|  for (const auto& nbest : spt->nbests()) {
  ------------------
  |  Branch (256:26): [True: 3.38k, False: 1.53k]
  ------------------
  257|  3.38k|    std::vector<int>& result = ids->emplace_back();
  258|  3.38k|    result.reserve(nbest.pieces().size());
  259|  29.3M|    for (const auto& sp : nbest.pieces()) {
  ------------------
  |  Branch (259:25): [True: 29.3M, False: 3.38k]
  ------------------
  260|  29.3M|      result.emplace_back(sp.id());
  261|  29.3M|    }
  262|  3.38k|  }
  263|       |
  264|  1.53k|  return absl::OkStatus();
  265|  3.07k|}
_ZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS1_6vectorINS1_12basic_stringIcS4_NS1_9allocatorIcEEEENS8_ISA_EEEE:
  269|  3.78k|    std::vector<std::string>* pieces) const {
  270|  7.57k|  RET_CHECK_STATUS_STL(pieces);
  ------------------
  |  |  189|  3.78k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  3.78k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  7.57k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  7.57k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  7.57k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 3.78k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  3.78k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.78k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  7.57k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 3.78k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  7.57k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  7.57k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  3.78k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  7.57k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  3.78k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  3.78k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 3.78k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  3.78k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  3.78k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  3.78k|  container->clear();
  ------------------
  271|       |
  272|  7.57k|  Arena arena;
  273|  7.57k|  auto* spt = Arena::Create<SentencePieceText>(&arena);
  274|  7.57k|  ABSL_RETURN_IF_ERROR(SampleEncode(input, nbest_size, alpha, spt));
  ------------------
  |  |   90|  3.78k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  7.57k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  7.57k|  switch (0)                                           \
  |  |  |  |  |  |  350|  7.57k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 3.78k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  3.78k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.78k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  7.57k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 3.78k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  7.57k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  7.57k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  3.78k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  7.57k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  275|  3.78k|  pieces->reserve(spt->pieces().size());
  276|  45.0M|  for (const auto& sp : spt->pieces()) {
  ------------------
  |  Branch (276:23): [True: 45.0M, False: 3.78k]
  ------------------
  277|  45.0M|    pieces->emplace_back(sp.piece());
  278|  45.0M|  }
  279|       |
  280|  3.78k|  return absl::OkStatus();
  281|  7.57k|}
_ZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS1_6vectorIiNS1_9allocatorIiEEEE:
  285|  1.41k|                                                  std::vector<int>* ids) const {
  286|  2.83k|  RET_CHECK_STATUS_STL(ids);
  ------------------
  |  |  189|  1.41k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.41k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  2.83k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  2.83k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  2.83k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.41k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.41k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.41k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  2.83k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.41k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  2.83k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  2.83k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.41k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  2.83k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  1.41k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.41k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.41k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.41k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.41k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  1.41k|  container->clear();
  ------------------
  287|       |
  288|  2.83k|  Arena arena;
  289|  2.83k|  auto* spt = Arena::Create<SentencePieceText>(&arena);
  290|  2.83k|  ABSL_RETURN_IF_ERROR(SampleEncode(input, nbest_size, alpha, spt));
  ------------------
  |  |   90|  1.41k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  2.83k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  2.83k|  switch (0)                                           \
  |  |  |  |  |  |  350|  2.83k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.41k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.41k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.41k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  2.83k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.41k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  2.83k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  2.83k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.41k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  2.83k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  291|  22.0M|  for (const auto& sp : spt->pieces()) {
  ------------------
  |  Branch (291:23): [True: 22.0M, False: 1.41k]
  ------------------
  292|  22.0M|    ids->emplace_back(sp.id());
  293|  22.0M|  }
  294|       |
  295|  1.41k|  return absl::OkStatus();
  296|  2.83k|}
_ZNK13sentencepiece22SentencePieceProcessor25PopulateSentencePieceTextENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEES5_N4absl12lts_202608174SpanIKmEERKNS1_6vectorINS1_4pairIS5_iEENS1_9allocatorISD_EEEEPNS_17SentencePieceTextEbmb:
  302|  14.4k|    bool apply_extra_options) const {
  303|  14.4k|  size_t consumed = 0;
  304|  14.4k|  bool is_prev_unk = false;
  305|  97.6M|  for (const auto& p : result) {
  ------------------
  |  Branch (305:22): [True: 97.6M, False: 14.4k]
  ------------------
  306|  97.6M|    const absl::string_view w = p.first;  // piece
  307|  97.6M|    const int id = p.second;              // id
  308|       |
  309|  97.6M|    RET_CHECK(!w.empty()) << "Empty piece is not allowed.";
  ------------------
  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  ------------------
  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  310|       |
  311|  97.6M|    const bool is_unk = IsUnknownId(*model_, unk_id_, id);
  312|       |
  313|  97.6M|    if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (313:9): [True: 0, False: 97.6M]
  ------------------
  314|       |      // Control symbol has no corresponding source surface, so begin == end.
  315|      0|      auto* sp = spt->add_pieces();
  316|      0|      sp->set_piece(w.data(), w.size());
  317|      0|      sp->set_id(id);
  318|      0|      RET_CHECK_GE(norm_to_orig[consumed], input_start_offset);
  ------------------
  |  |   30|      0|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|      0|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|      0|  } else /* NOLINT */                                         \
  |  |  |  |   25|      0|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  319|      0|      const size_t orig_offset = norm_to_orig[consumed] - input_start_offset;
  320|      0|      sp->set_begin(orig_offset);
  321|      0|      sp->set_end(orig_offset);
  322|  97.6M|    } else {
  323|  97.6M|      const size_t begin = consumed;
  324|  97.6M|      const size_t end = consumed + w.size();
  325|  97.6M|      RET_CHECK_LT(begin, norm_to_orig.size());
  ------------------
  |  |   33|  97.6M|#define RET_CHECK_LT(a, b) RET_CHECK((a) < (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  326|  97.6M|      RET_CHECK_LT(end, norm_to_orig.size());
  ------------------
  |  |   33|  97.6M|#define RET_CHECK_LT(a, b) RET_CHECK((a) < (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  327|  97.6M|      RET_CHECK_GE(norm_to_orig[begin], input_start_offset);
  ------------------
  |  |   30|  97.6M|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  328|  97.6M|      RET_CHECK_GE(norm_to_orig[end], input_start_offset);
  ------------------
  |  |   30|  97.6M|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  329|  97.6M|      const size_t orig_begin = norm_to_orig[begin] - input_start_offset;
  330|  97.6M|      const size_t orig_end = norm_to_orig[end] - input_start_offset;
  331|  97.6M|      RET_CHECK_LE(orig_begin, input.size());
  ------------------
  |  |   31|  97.6M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  332|  97.6M|      RET_CHECK_LE(orig_end, input.size());
  ------------------
  |  |   31|  97.6M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  333|  97.6M|      RET_CHECK_LE(orig_begin, orig_end);
  ------------------
  |  |   31|  97.6M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  97.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 97.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  97.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  97.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  334|  97.6M|      const auto surface =
  335|  97.6M|          absl::ClippedSubstr(input, orig_begin, orig_end - orig_begin);
  336|       |
  337|  97.6M|      if (is_unk && model_->ByteFallbackEnabled()) {
  ------------------
  |  Branch (337:11): [True: 76.2M, False: 21.4M]
  |  Branch (337:21): [True: 76.2M, False: 0]
  ------------------
  338|       |        // Decomposes an unknown piece into UTF-8 bytes
  339|   212M|        for (size_t i = 0; i < w.size(); ++i) {
  ------------------
  |  Branch (339:28): [True: 135M, False: 76.2M]
  ------------------
  340|       |          // Create a byte piece
  341|   135M|          const uint8_t b = static_cast<uint8_t>(w[i]);
  342|   135M|          SentencePieceText::SentencePiece* sp = spt->add_pieces();
  343|   135M|          std::string& piece = *sp->mutable_piece();
  344|   135M|          piece = ByteToPiece(b);
  345|   135M|          int sp_id = model_->PieceToId(piece);
  346|   135M|          sp->set_id(sp_id);
  347|       |
  348|       |          // The last byte piece holds the surface of the original unknown
  349|       |          // character. The other byte pieces have no surface.
  350|   135M|          if (i == w.size() - 1) {
  ------------------
  |  Branch (350:15): [True: 76.2M, False: 59.7M]
  ------------------
  351|  76.2M|            if (!skip_surface) sp->set_surface(surface.data(), surface.size());
  ------------------
  |  Branch (351:17): [True: 76.2M, False: 0]
  ------------------
  352|  76.2M|            sp->set_begin(orig_begin);
  353|  76.2M|            sp->set_end(orig_end);
  354|  76.2M|          } else {
  355|       |            // begin == end
  356|  59.7M|            sp->set_begin(orig_begin);
  357|  59.7M|            sp->set_end(orig_begin);
  358|  59.7M|          }
  359|   135M|        }
  360|  76.2M|      } else {
  361|       |        // Merges continuous run of unknown pieces so that decoder
  362|       |        // can copy or generate unknown tokens easily.
  363|       |        // Note that merged tokens are still unknown,
  364|       |        // since known pieces never consist of unknown characters.
  365|  21.4M|        if (is_prev_unk && is_unk) {
  ------------------
  |  Branch (365:13): [True: 6.65M, False: 14.8M]
  |  Branch (365:28): [True: 0, False: 6.65M]
  ------------------
  366|      0|          auto* sp = spt->mutable_pieces(spt->pieces_size() - 1);
  367|      0|          sp->mutable_piece()->append(w);
  368|      0|          if (!skip_surface) sp->mutable_surface()->append(surface);
  ------------------
  |  Branch (368:15): [True: 0, False: 0]
  ------------------
  369|      0|          sp->set_end(orig_end);
  370|  21.4M|        } else {
  371|  21.4M|          auto* sp = spt->add_pieces();
  372|  21.4M|          sp->set_piece(w.data(), w.size());
  373|  21.4M|          sp->set_id(id);
  374|  21.4M|          if (!skip_surface) sp->set_surface(surface.data(), surface.size());
  ------------------
  |  Branch (374:15): [True: 21.4M, False: 0]
  ------------------
  375|  21.4M|          sp->set_begin(orig_begin);
  376|  21.4M|          sp->set_end(orig_end);
  377|  21.4M|        }
  378|  21.4M|      }
  379|  97.6M|      consumed += w.size();
  380|  97.6M|    }
  381|  97.6M|    is_prev_unk = is_unk;
  382|  97.6M|  }
  383|       |
  384|  14.4k|  RET_CHECK_EQ(consumed, normalized.size())
  ------------------
  |  |   28|  14.4k|#define RET_CHECK_EQ(a, b) RET_CHECK((a) == (b))
  |  |  ------------------
  |  |  |  |   23|  14.4k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 14.4k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  14.4k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  14.4k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  385|      0|      << "all normalized characters are not consumed.";
  386|       |
  387|  14.4k|  spt->set_text(input.data(), input.size());
  388|       |
  389|  14.4k|  if (apply_extra_options) {
  ------------------
  |  Branch (389:7): [True: 14.4k, False: 0]
  ------------------
  390|  14.4k|    ABSL_RETURN_IF_ERROR(ApplyExtraOptions(encode_extra_options_, spt));
  ------------------
  |  |   90|  14.4k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  28.9k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  28.9k|  switch (0)                                           \
  |  |  |  |  |  |  350|  28.9k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 14.4k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  14.4k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 14.4k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  28.9k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 14.4k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  28.9k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  28.9k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  14.4k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  28.9k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  391|  14.4k|  }
  392|       |
  393|  14.4k|  return absl::OkStatus();
  394|  14.4k|}  // namespace sentencepiece
_ZNK13sentencepiece22SentencePieceProcessor11NBestEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEiPNS_22NBestSentencePieceTextE:
  414|  4.59k|    NBestSentencePieceText* nbest_spt) const {
  415|  9.19k|  RET_CHECK_STATUS_PROTO(nbest_spt);
  ------------------
  |  |  194|  4.59k|  ABSL_RETURN_IF_ERROR(status());             \
  |  |  ------------------
  |  |  |  |   90|  4.59k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  9.19k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  9.19k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  9.19k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 4.59k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  4.59k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 4.59k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  9.19k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 4.59k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  9.19k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  9.19k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  4.59k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  9.19k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  195|  4.59k|  RET_CHECK(proto) << "output proto is null"; \
  |  |  ------------------
  |  |  |  |   23|  4.59k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 4.59k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  4.59k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  4.59k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  196|  4.59k|  proto->Clear();
  ------------------
  416|       |
  417|  9.19k|  RET_CHECK_LE(nbest_size, kMaxNBestSize)
  ------------------
  |  |   31|  4.59k|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  4.59k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 4.59k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  4.59k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  4.59k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  418|      0|      << "nbest_size must be nbest_size <= " << kMaxNBestSize;
  419|       |
  420|  4.59k|  std::string normalized;
  421|  4.59k|  std::vector<size_t> norm_to_orig;
  422|  4.59k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  4.59k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  9.19k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  9.19k|  switch (0)                                           \
  |  |  |  |  |  |  350|  9.19k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 4.59k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  4.59k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 4.59k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  9.19k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 4.59k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  9.19k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  9.19k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  4.59k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  9.19k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  423|  4.59k|      normalizer_->Normalize(input, &normalized, &norm_to_orig));
  424|       |
  425|  4.59k|  RET_CHECK(model_->IsNBestEncodeAvailable())
  ------------------
  |  |   23|  4.59k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 4.59k, False: 0]
  |  |  ------------------
  |  |   24|  4.59k|  } else /* NOLINT */                                         \
  |  |   25|  4.59k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  426|      0|      << "NBestEncode is not available for the current model.";
  427|       |
  428|  4.59k|  const auto nbests = model_->NBestEncode(normalized, nbest_size);
  429|  4.59k|  RET_CHECK(!nbests.empty()) << "NBestEncode returns empty result.";
  ------------------
  |  |   23|  4.59k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 4.59k, False: 0]
  |  |  ------------------
  |  |   24|  4.59k|  } else /* NOLINT */                                         \
  |  |   25|  4.59k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  430|       |
  431|  9.29k|  for (const auto& result : nbests) {
  ------------------
  |  Branch (431:27): [True: 9.29k, False: 4.59k]
  ------------------
  432|  9.29k|    auto* spt = nbest_spt->add_nbests();
  433|  9.29k|    spt->set_score(result.second);
  434|  9.29k|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(
  ------------------
  |  |   90|  9.29k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  18.5k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  18.5k|  switch (0)                                           \
  |  |  |  |  |  |  350|  18.5k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 9.29k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  9.29k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 9.29k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  18.5k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 9.29k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  18.5k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  18.5k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  9.29k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  18.5k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  435|  9.29k|        input, normalized, norm_to_orig, result.first, spt));
  436|  9.29k|  }
  437|       |
  438|  4.59k|  return absl::OkStatus();
  439|  4.59k|}
_ZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS_17SentencePieceTextE:
  443|  5.20k|    SentencePieceText* spt) const {
  444|  10.4k|  RET_CHECK_STATUS_PROTO(spt);
  ------------------
  |  |  194|  5.20k|  ABSL_RETURN_IF_ERROR(status());             \
  |  |  ------------------
  |  |  |  |   90|  5.20k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  10.4k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  10.4k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  10.4k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 5.20k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  5.20k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 5.20k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  10.4k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 5.20k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  10.4k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  10.4k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  5.20k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  10.4k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  195|  5.20k|  RET_CHECK(proto) << "output proto is null"; \
  |  |  ------------------
  |  |  |  |   23|  5.20k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 5.20k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  5.20k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  5.20k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  196|  5.20k|  proto->Clear();
  ------------------
  445|       |
  446|  10.4k|  RET_CHECK(std::isfinite(alpha));
  ------------------
  |  |   23|  5.20k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 5.20k, False: 0]
  |  |  ------------------
  |  |   24|  5.20k|  } else /* NOLINT */                                         \
  |  |   25|  5.20k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  447|  5.20k|  RET_CHECK_GE(alpha, 0.0);
  ------------------
  |  |   30|  5.20k|#define RET_CHECK_GE(a, b) RET_CHECK((a) >= (b))
  |  |  ------------------
  |  |  |  |   23|  5.20k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 5.20k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  5.20k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  5.20k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  448|  5.20k|  RET_CHECK_LE(nbest_size, kMaxNBestSize)
  ------------------
  |  |   31|  5.20k|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  5.20k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 5.20k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  5.20k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  5.20k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
  449|      0|      << "nbest_size must be nbest_size <= " << kMaxNBestSize;
  450|       |
  451|  5.20k|  std::string normalized;
  452|  5.20k|  std::vector<size_t> norm_to_orig;
  453|  5.20k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  5.20k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  10.4k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  10.4k|  switch (0)                                           \
  |  |  |  |  |  |  350|  10.4k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 5.20k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  5.20k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 5.20k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  10.4k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 5.20k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  10.4k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  10.4k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  5.20k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  10.4k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  454|  5.20k|      normalizer_->Normalize(input, &normalized, &norm_to_orig));
  455|       |
  456|  5.20k|  if (!model_->IsNBestEncodeAvailable() || nbest_size < 0) {
  ------------------
  |  Branch (456:7): [True: 0, False: 5.20k]
  |  Branch (456:44): [True: 4.35k, False: 848]
  ------------------
  457|  4.35k|    RET_CHECK(model_->IsSampleEncodeAvailable())
  ------------------
  |  |   23|  4.35k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 4.35k, False: 0]
  |  |  ------------------
  |  |   24|  4.35k|  } else /* NOLINT */                                         \
  |  |   25|  4.35k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  458|      0|        << "SampleEncode is not available for the current model.";
  459|  4.35k|    const auto result = model_->SampleEncode(normalized, alpha);
  460|  4.35k|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(input, normalized,
  ------------------
  |  |   90|  4.35k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  8.71k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  8.71k|  switch (0)                                           \
  |  |  |  |  |  |  350|  8.71k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 4.35k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  4.35k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 4.35k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  8.71k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 4.35k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  8.71k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  8.71k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  4.35k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  8.71k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  461|  4.35k|                                                   norm_to_orig, result, spt));
  462|  4.35k|  } else if (nbest_size == 1 || nbest_size == 0) {
  ------------------
  |  Branch (462:14): [True: 0, False: 848]
  |  Branch (462:33): [True: 0, False: 848]
  ------------------
  463|      0|    const auto result = model_->Encode(normalized);
  464|      0|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(input, normalized,
  ------------------
  |  |   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()
  |  |  ------------------
  ------------------
  465|      0|                                                   norm_to_orig, result, spt));
  466|    848|  } else if (nbest_size > 1) {
  ------------------
  |  Branch (466:14): [True: 848, False: 0]
  ------------------
  467|    848|    const auto nbests = model_->NBestEncode(normalized, nbest_size);
  468|    848|    RET_CHECK(!nbests.empty()) << "NBestEncode returns empty result.";
  ------------------
  |  |   23|    848|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 848, False: 0]
  |  |  ------------------
  |  |   24|    848|  } else /* NOLINT */                                         \
  |  |   25|    848|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
  469|       |
  470|    848|    std::vector<double> log_probs;
  471|    848|    log_probs.reserve(nbests.size());
  472|    848|    std::transform(nbests.begin(), nbests.end(), std::back_inserter(log_probs),
  473|    848|                   [alpha](const auto& nbest) { return alpha * nbest.second; });
  474|       |
  475|    848|    const double Z = log_domain::LogSum(log_probs);
  476|    848|    std::vector<double> probs;
  477|    848|    probs.reserve(log_probs.size());
  478|    848|    std::transform(
  479|    848|        log_probs.begin(), log_probs.end(), std::back_inserter(probs),
  480|    848|        [Z](const auto& log_prob) { return std::exp(log_prob - Z); });
  481|    848|    log_domain::SanitizeDiscreteProbs(&probs);
  482|       |
  483|    848|    auto* mt = random::GetRandomGenerator();
  484|    848|    std::discrete_distribution<int> dist(probs.begin(), probs.end());
  485|    848|    ABSL_RETURN_IF_ERROR(PopulateSentencePieceText(
  ------------------
  |  |   90|    848|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  1.69k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  1.69k|  switch (0)                                           \
  |  |  |  |  |  |  350|  1.69k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 848, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|    848|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 848]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  1.69k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 848, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  1.69k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  1.69k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|    848|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  1.69k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
  486|    848|        input, normalized, norm_to_orig, nbests[dist(*mt)].first, spt));
  487|    848|  }
  488|       |
  489|  5.20k|  return absl::OkStatus();
  490|  5.20k|}
_ZNK13sentencepiece22SentencePieceProcessor9NormalizeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_12basic_stringIcS4_NS1_9allocatorIcEEEE:
 1078|  1.70k|                                               std::string* normalized) const {
 1079|  1.70k|  RET_CHECK(normalizer_);
  ------------------
  |  |   23|  1.70k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 1.70k, False: 0]
  |  |  ------------------
  |  |   24|  1.70k|  } else /* NOLINT */                                         \
  |  |   25|  1.70k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1080|  1.70k|  return normalizer_->Normalize(input, normalized, nullptr);
 1081|  1.70k|}
_ZNK13sentencepiece22SentencePieceProcessor9NormalizeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPNS1_12basic_stringIcS4_NS1_9allocatorIcEEEEPNS1_6vectorImNS7_ImEEEE:
 1085|  1.70k|    std::vector<size_t>* norm_to_orig) const {
 1086|  1.70k|  RET_CHECK(normalizer_);
  ------------------
  |  |   23|  1.70k|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 1.70k, False: 0]
  |  |  ------------------
  |  |   24|  1.70k|  } else /* NOLINT */                                         \
  |  |   25|  1.70k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1087|  1.70k|  return normalizer_->Normalize(input, normalized, norm_to_orig);
 1088|  1.70k|}
_ZNK13sentencepiece22SentencePieceProcessor12GetPieceSizeEv:
 1096|  12.0k|int SentencePieceProcessor::GetPieceSize() const {
 1097|  12.0k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1072|  12.0k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.0k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1098|  12.0k|  return model_->GetPieceSize();
 1099|  12.0k|}
_ZNK13sentencepiece22SentencePieceProcessor9PieceToIdENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
 1101|  13.8k|int SentencePieceProcessor::PieceToId(absl::string_view piece) const {
 1102|  13.8k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1072|  13.8k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 13.8k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1103|  13.8k|  return model_->PieceToId(piece);
 1104|  13.8k|}
_ZNK13sentencepiece22SentencePieceProcessor9IdToPieceEi:
 1106|  12.0k|const std::string& SentencePieceProcessor::IdToPiece(int id) const {
 1107|  12.0k|  static const std::string* kEmptyString = new std::string;
 1108|  12.0k|  RET_CHECK_OR_RETURN_DEFAULT(*kEmptyString);
  ------------------
  |  | 1072|  12.0k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.0k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1109|  12.0k|  if (id < 0 || id >= model_->GetPieceSize()) {
  ------------------
  |  Branch (1109:7): [True: 0, False: 12.0k]
  |  Branch (1109:17): [True: 0, False: 12.0k]
  ------------------
 1110|      0|    return *kEmptyString;
 1111|      0|  }
 1112|  12.0k|  return model_->IdToPiece(id);
 1113|  12.0k|}
_ZNK13sentencepiece22SentencePieceProcessor8GetScoreEi:
 1124|  12.0k|float SentencePieceProcessor::GetScore(int id) const {
 1125|  12.0k|  RET_CHECK_OR_RETURN_DEFAULT(0.0);
  ------------------
  |  | 1072|  12.0k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.0k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1126|  12.0k|  if (id < 0 || id >= model_->GetPieceSize()) {
  ------------------
  |  Branch (1126:7): [True: 0, False: 12.0k]
  |  Branch (1126:17): [True: 0, False: 12.0k]
  ------------------
 1127|      0|    return 0.0;
 1128|      0|  }
 1129|  12.0k|  return model_->GetScore(id);
 1130|  12.0k|}
_ZNK13sentencepiece22SentencePieceProcessor9IsControlEi:
 1132|  12.1k|bool SentencePieceProcessor::IsControl(int id) const {
 1133|  12.1k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1072|  12.1k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.1k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1134|  12.1k|  return id >= 0 && id < model_->GetPieceSize() && model_->IsControl(id);
  ------------------
  |  Branch (1134:10): [True: 12.1k, False: 0]
  |  Branch (1134:21): [True: 12.1k, False: 0]
  |  Branch (1134:52): [True: 5, False: 12.0k]
  ------------------
 1135|  12.1k|}
_ZNK13sentencepiece22SentencePieceProcessor9IsUnknownEi:
 1137|  12.0k|bool SentencePieceProcessor::IsUnknown(int id) const {
 1138|  12.0k|  RET_CHECK_OR_RETURN_DEFAULT(0);
  ------------------
  |  | 1072|  12.0k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.0k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1139|  12.0k|  return IsUnknownId(*model_, unk_id_, id);
 1140|  12.0k|}
_ZNK13sentencepiece22SentencePieceProcessor8IsUnusedEi:
 1142|  12.0k|bool SentencePieceProcessor::IsUnused(int id) const {
 1143|  12.0k|  RET_CHECK_OR_RETURN_DEFAULT(false);
  ------------------
  |  | 1072|  12.0k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.0k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1144|  12.0k|  return id >= 0 && id < model_->GetPieceSize() && model_->IsUnused(id);
  ------------------
  |  Branch (1144:10): [True: 12.0k, False: 0]
  |  Branch (1144:21): [True: 12.0k, False: 0]
  |  Branch (1144:52): [True: 0, False: 12.0k]
  ------------------
 1145|  12.0k|}
_ZNK13sentencepiece22SentencePieceProcessor6IsByteEi:
 1147|  12.0k|bool SentencePieceProcessor::IsByte(int id) const {
 1148|  12.0k|  RET_CHECK_OR_RETURN_DEFAULT(false);
  ------------------
  |  | 1072|  12.0k|  if (!status().ok()) {                                                      \
  |  |  ------------------
  |  |  |  Branch (1072:7): [True: 0, False: 12.0k]
  |  |  ------------------
  |  | 1073|      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{})
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  ------------------
  |  | 1074|      0|    return value;                                                            \
  |  | 1075|      0|  }
  ------------------
 1149|  12.0k|  return id >= 0 && id < model_->GetPieceSize() && model_->IsByte(id);
  ------------------
  |  Branch (1149:10): [True: 12.0k, False: 0]
  |  Branch (1149:21): [True: 12.0k, False: 0]
  |  Branch (1149:52): [True: 9, False: 12.0k]
  ------------------
 1150|  12.0k|}
_ZNK13sentencepiece22SentencePieceProcessor17HasUnkPieceOptionEv:
 1239|  4.72k|bool SentencePieceProcessor::HasUnkPieceOption() const {
 1240|  4.72k|  for (const auto& option : encode_extra_options_) {
  ------------------
  |  Branch (1240:27): [True: 0, False: 4.72k]
  ------------------
 1241|      0|    if (option == UNK_PIECE) return true;
  ------------------
  |  Branch (1241:9): [True: 0, False: 0]
  ------------------
 1242|      0|  }
 1243|  4.72k|  return false;
 1244|  4.72k|}
sentencepiece_processor.cc:_ZN13sentencepiece12_GLOBAL__N_111IsUnknownIdERKNS_14ModelInterfaceEii:
   80|   210M|inline bool IsUnknownId(const ModelInterface& model, int unk_id, int id) {
   81|   210M|  return id == unk_id ||
  ------------------
  |  Branch (81:10): [True: 147M, False: 63.5M]
  ------------------
   82|  63.5M|         (id >= 0 && id < model.GetPieceSize() && model.IsUnknown(id));
  ------------------
  |  Branch (82:11): [True: 63.5M, False: 0]
  |  Branch (82:22): [True: 63.5M, False: 0]
  |  Branch (82:51): [True: 0, False: 63.5M]
  ------------------
   83|   210M|}
sentencepiece_processor.cc:_ZN13sentencepiece12_GLOBAL__N_111IsControlIdERKNS_14ModelInterfaceEi:
   72|   210M|inline bool IsControlId(const ModelInterface& model, int id) {
   73|   210M|  return id >= 0 && id < model.GetPieceSize() && model.IsControl(id);
  ------------------
  |  Branch (73:10): [True: 210M, False: 0]
  |  Branch (73:21): [True: 210M, False: 0]
  |  Branch (73:50): [True: 0, False: 210M]
  ------------------
   74|   210M|}
sentencepiece_processor.cc:_ZZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS_17SentencePieceTextEENK3$_0clINS1_4pairINS1_6vectorINSA_IS5_iEENS1_9allocatorISC_EEEEfEEEEDaRKT_:
  473|  3.03k|                   [alpha](const auto& nbest) { return alpha * nbest.second; });
sentencepiece_processor.cc:_ZZNK13sentencepiece22SentencePieceProcessor12SampleEncodeENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEifPNS_17SentencePieceTextEENK3$_1clIdEEDaRKT_:
  480|  3.03k|        [Z](const auto& log_prob) { return std::exp(log_prob - Z); });
sentencepiece_processor.cc:_ZN13sentencepiece12_GLOBAL__N_18IsByteIdERKNS_14ModelInterfaceEi:
   76|   116M|inline bool IsByteId(const ModelInterface& model, int id) {
   77|   116M|  return id >= 0 && id < model.GetPieceSize() && model.IsByte(id);
  ------------------
  |  Branch (77:10): [True: 116M, False: 0]
  |  Branch (77:21): [True: 116M, False: 0]
  |  Branch (77:50): [True: 97.4M, False: 19.3M]
  ------------------
   78|   116M|}
_ZNK13sentencepiece22SentencePieceProcessor15EncodeOptimizedINSt3__112basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEEEEN4absl12lts_202608176StatusENS2_17basic_string_viewIcS5_EEPNS2_6vectorIT_NS6_ISF_EEEE:
 1300|  3.09k|    absl::string_view input, std::vector<T>* output) const {
 1301|  6.18k|  RET_CHECK_STATUS_STL(output);
  ------------------
  |  |  189|  3.09k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  3.09k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  6.18k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  6.18k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  6.18k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 3.09k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  3.09k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.09k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  6.18k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 3.09k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  6.18k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  6.18k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  3.09k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  6.18k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  3.09k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  3.09k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 3.09k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  3.09k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  3.09k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  3.09k|  container->clear();
  ------------------
 1302|       |
 1303|  6.18k|  if (input.empty()) {
  ------------------
  |  Branch (1303:7): [True: 0, False: 3.09k]
  ------------------
 1304|      0|    return ApplyExtraOptions(encode_extra_options_, output);
 1305|      0|  }
 1306|       |
 1307|  3.09k|  std::string normalized;
 1308|  3.09k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  3.09k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  6.18k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  6.18k|  switch (0)                                           \
  |  |  |  |  |  |  350|  6.18k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 3.09k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  3.09k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 3.09k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  6.18k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 3.09k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  6.18k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  6.18k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  3.09k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  6.18k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1309|  3.09k|      normalizer_->Normalize(input, &normalized, /*norm_to_orig=*/nullptr));
 1310|  3.09k|  const EncodeResult result = model_->Encode(normalized);
 1311|  3.09k|  const bool byte_fallback_enabled = model_->ByteFallbackEnabled();
 1312|  3.09k|  const bool has_unk_piece = HasUnkPieceOption();
 1313|  3.09k|  bool is_prev_unk = false;
 1314|  3.09k|  output->reserve(result.size());
 1315|       |
 1316|  54.0M|  for (const auto& piece : result) {
  ------------------
  |  Branch (1316:26): [True: 54.0M, False: 3.09k]
  ------------------
 1317|  54.0M|    const absl::string_view w = piece.first;
 1318|  54.0M|    RET_CHECK(!piece.first.empty()) << "Empty piece is not allowed.";
  ------------------
  |  |   23|  54.0M|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 54.0M, False: 0]
  |  |  ------------------
  |  |   24|  54.0M|  } else /* NOLINT */                                         \
  |  |   25|  54.0M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1319|  54.0M|    const int id = piece.second;
 1320|  54.0M|    if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1320:9): [True: 0, False: 54.0M]
  ------------------
 1321|       |      if constexpr (std::is_same_v<T, int>) {
 1322|       |        output->emplace_back(id);
 1323|      0|      } else {
 1324|      0|        output->emplace_back(w.data(), w.size());
 1325|      0|      }
 1326|      0|      is_prev_unk = false;
 1327|  54.0M|    } else {
 1328|  54.0M|      const bool is_unk = IsUnknownId(*model_, unk_id_, id);
 1329|  54.0M|      if (is_unk && byte_fallback_enabled) {
  ------------------
  |  Branch (1329:11): [True: 38.3M, False: 15.7M]
  |  Branch (1329:21): [True: 38.3M, False: 0]
  ------------------
 1330|   104M|        for (size_t i = 0; i < w.size(); ++i) {
  ------------------
  |  Branch (1330:28): [True: 66.2M, False: 38.3M]
  ------------------
 1331|       |          if constexpr (std::is_same_v<T, int>) {
 1332|       |            const auto sp_id =
 1333|       |                model_->PieceToId(ByteToPiece(static_cast<uint8_t>(w[i])));
 1334|       |            output->emplace_back(sp_id);
 1335|  66.2M|          } else {
 1336|  66.2M|            output->emplace_back(ByteToPiece(static_cast<uint8_t>(w[i])));
 1337|  66.2M|          }
 1338|  66.2M|        }
 1339|  38.3M|      } else {
 1340|       |        // Merge continuous runs of unknown pieces.
 1341|  15.7M|        if (!is_prev_unk || !is_unk) {
  ------------------
  |  Branch (1341:13): [True: 12.6M, False: 3.10M]
  |  Branch (1341:29): [True: 3.10M, False: 0]
  ------------------
 1342|       |          if constexpr (std::is_same_v<T, int>) {
 1343|       |            output->emplace_back(id);
 1344|  15.7M|          } else {
 1345|  15.7M|            if (is_unk && has_unk_piece) {
  ------------------
  |  Branch (1345:17): [True: 0, False: 15.7M]
  |  Branch (1345:27): [True: 0, False: 0]
  ------------------
 1346|      0|              output->emplace_back(model_->unk_piece());
 1347|  15.7M|            } else {
 1348|  15.7M|              output->emplace_back(w.data(), w.size());
 1349|  15.7M|            }
 1350|  15.7M|          }
 1351|  15.7M|        } else {
 1352|      0|          if constexpr (!std::is_same_v<T, int>) {
 1353|      0|            if (!has_unk_piece) {
  ------------------
  |  Branch (1353:17): [True: 0, False: 0]
  ------------------
 1354|      0|              output->back().append(w.data(), w.size());
 1355|      0|            }
 1356|      0|          }
 1357|      0|        }
 1358|  15.7M|      }
 1359|  54.0M|      is_prev_unk = is_unk;
 1360|  54.0M|    }
 1361|  54.0M|  }
 1362|       |
 1363|  3.09k|  return ApplyExtraOptions(encode_extra_options_, output);
 1364|  3.09k|}
_ZNK13sentencepiece22SentencePieceProcessor15EncodeOptimizedIiEEN4absl12lts_202608176StatusENSt3__117basic_string_viewIcNS5_11char_traitsIcEEEEPNS5_6vectorIT_NS5_9allocatorISB_EEEE:
 1300|  1.63k|    absl::string_view input, std::vector<T>* output) const {
 1301|  3.26k|  RET_CHECK_STATUS_STL(output);
  ------------------
  |  |  189|  1.63k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.63k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  3.26k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  3.26k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  3.26k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.63k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.63k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.63k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  3.26k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.63k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  3.26k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  3.26k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.63k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  3.26k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  1.63k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.63k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.63k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.63k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.63k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  1.63k|  container->clear();
  ------------------
 1302|       |
 1303|  3.26k|  if (input.empty()) {
  ------------------
  |  Branch (1303:7): [True: 0, False: 1.63k]
  ------------------
 1304|      0|    return ApplyExtraOptions(encode_extra_options_, output);
 1305|      0|  }
 1306|       |
 1307|  1.63k|  std::string normalized;
 1308|  1.63k|  ABSL_RETURN_IF_ERROR(
  ------------------
  |  |   90|  1.63k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  3.26k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  3.26k|  switch (0)                                           \
  |  |  |  |  |  |  350|  3.26k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.63k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.63k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.63k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  3.26k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.63k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  3.26k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  3.26k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.63k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  3.26k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1309|  1.63k|      normalizer_->Normalize(input, &normalized, /*norm_to_orig=*/nullptr));
 1310|  1.63k|  const EncodeResult result = model_->Encode(normalized);
 1311|  1.63k|  const bool byte_fallback_enabled = model_->ByteFallbackEnabled();
 1312|  1.63k|  const bool has_unk_piece = HasUnkPieceOption();
 1313|  1.63k|  bool is_prev_unk = false;
 1314|  1.63k|  output->reserve(result.size());
 1315|       |
 1316|  39.4M|  for (const auto& piece : result) {
  ------------------
  |  Branch (1316:26): [True: 39.4M, False: 1.63k]
  ------------------
 1317|  39.4M|    const absl::string_view w = piece.first;
 1318|  39.4M|    RET_CHECK(!piece.first.empty()) << "Empty piece is not allowed.";
  ------------------
  |  |   23|  39.4M|  if (condition) {                                            \
  |  |  ------------------
  |  |  |  Branch (23:7): [True: 39.4M, False: 0]
  |  |  ------------------
  |  |   24|  39.4M|  } else /* NOLINT */                                         \
  |  |   25|  39.4M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  ------------------
 1319|  39.4M|    const int id = piece.second;
 1320|  39.4M|    if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1320:9): [True: 0, False: 39.4M]
  ------------------
 1321|      0|      if constexpr (std::is_same_v<T, int>) {
 1322|      0|        output->emplace_back(id);
 1323|       |      } else {
 1324|       |        output->emplace_back(w.data(), w.size());
 1325|       |      }
 1326|      0|      is_prev_unk = false;
 1327|  39.4M|    } else {
 1328|  39.4M|      const bool is_unk = IsUnknownId(*model_, unk_id_, id);
 1329|  39.4M|      if (is_unk && byte_fallback_enabled) {
  ------------------
  |  Branch (1329:11): [True: 32.4M, False: 7.00M]
  |  Branch (1329:21): [True: 32.4M, False: 0]
  ------------------
 1330|  83.2M|        for (size_t i = 0; i < w.size(); ++i) {
  ------------------
  |  Branch (1330:28): [True: 50.8M, False: 32.4M]
  ------------------
 1331|  50.8M|          if constexpr (std::is_same_v<T, int>) {
 1332|  50.8M|            const auto sp_id =
 1333|  50.8M|                model_->PieceToId(ByteToPiece(static_cast<uint8_t>(w[i])));
 1334|  50.8M|            output->emplace_back(sp_id);
 1335|       |          } else {
 1336|       |            output->emplace_back(ByteToPiece(static_cast<uint8_t>(w[i])));
 1337|       |          }
 1338|  50.8M|        }
 1339|  32.4M|      } else {
 1340|       |        // Merge continuous runs of unknown pieces.
 1341|  7.00M|        if (!is_prev_unk || !is_unk) {
  ------------------
  |  Branch (1341:13): [True: 5.65M, False: 1.35M]
  |  Branch (1341:29): [True: 1.35M, False: 0]
  ------------------
 1342|  7.00M|          if constexpr (std::is_same_v<T, int>) {
 1343|  7.00M|            output->emplace_back(id);
 1344|       |          } else {
 1345|       |            if (is_unk && has_unk_piece) {
 1346|       |              output->emplace_back(model_->unk_piece());
 1347|       |            } else {
 1348|       |              output->emplace_back(w.data(), w.size());
 1349|       |            }
 1350|       |          }
 1351|  7.00M|        } else {
 1352|       |          if constexpr (!std::is_same_v<T, int>) {
 1353|       |            if (!has_unk_piece) {
 1354|       |              output->back().append(w.data(), w.size());
 1355|       |            }
 1356|       |          }
 1357|      0|        }
 1358|  7.00M|      }
 1359|  39.4M|      is_prev_unk = is_unk;
 1360|  39.4M|    }
 1361|  39.4M|  }
 1362|       |
 1363|  1.63k|  return ApplyExtraOptions(encode_extra_options_, output);
 1364|  1.63k|}
_ZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEN4absl12lts_202608176StatusENS8_4SpanIKT_EEPNS2_12basic_stringIcS5_NS2_9allocatorIcEEEE:
 1368|  1.54k|    absl::Span<const T> input, std::string* detokenized) const {
 1369|  3.09k|  RET_CHECK_STATUS_STL(detokenized);
  ------------------
  |  |  189|  1.54k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.54k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  3.09k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  3.09k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  3.09k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.54k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.54k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.54k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  3.09k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.54k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  3.09k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  3.09k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.54k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  3.09k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  1.54k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.54k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.54k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.54k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.54k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  1.54k|  container->clear();
  ------------------
 1370|       |
 1371|  3.09k|  if (input.empty()) {
  ------------------
  |  Branch (1371:7): [True: 0, False: 1.54k]
  ------------------
 1372|      0|    return absl::OkStatus();
 1373|      0|  }
 1374|       |
 1375|       |  // active_input points to the data we will decode. By default it points to the
 1376|       |  // input span (zero-copy).
 1377|  1.54k|  absl::Span<const T> active_input = input;
 1378|       |  // If we have extra options to apply, we must copy the input to a mutable
 1379|       |  // container (work_input) to apply the modifications, as the input span is
 1380|       |  // const.
 1381|  1.54k|  std::vector<T> work_input;
 1382|       |
 1383|  1.54k|  if (!decode_extra_options_.empty()) {
  ------------------
  |  Branch (1383:7): [True: 0, False: 1.54k]
  ------------------
 1384|      0|    work_input.assign(input.begin(), input.end());
 1385|      0|    ABSL_RETURN_IF_ERROR(ApplyExtraOptions(decode_extra_options_, &work_input));
  ------------------
  |  |   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()
  |  |  ------------------
  ------------------
 1386|      0|    active_input = work_input;
 1387|      0|  }
 1388|       |
 1389|  1.54k|  absl::string_view unk_surface = kDefaultUnknownSymbol;
 1390|  1.54k|  if (model_proto_ && model_proto_->trainer_spec().has_unk_surface())
  ------------------
  |  Branch (1390:7): [True: 1.54k, False: 0]
  |  Branch (1390:23): [True: 0, False: 1.54k]
  ------------------
 1391|      0|    unk_surface = model_proto_->trainer_spec().unk_surface();
 1392|       |
 1393|  1.54k|  std::string byte_queue;
 1394|       |
 1395|  1.54k|  auto ProcessByteQueue = [&]() -> absl::Status {
 1396|  1.54k|    if (byte_queue.empty()) return absl::OkStatus();
 1397|  1.54k|    int offset = 0;
 1398|  1.54k|    const int bytes_len = byte_queue.size();
 1399|  1.54k|    while (offset < bytes_len) {
 1400|  1.54k|      size_t consumed;
 1401|  1.54k|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1402|  1.54k|          absl::string_view(byte_queue).substr(offset), &consumed);
 1403|  1.54k|      if (!is_valid) {
 1404|  1.54k|        RET_CHECK_EQ(consumed, 1);
 1405|  1.54k|        absl::StrAppend(detokenized, kReplacementCharacter);
 1406|  1.54k|      } else {
 1407|  1.54k|        const absl::string_view utf8 =
 1408|  1.54k|            absl::string_view(byte_queue).substr(offset, consumed);
 1409|  1.54k|        absl::StrAppend(detokenized, utf8);
 1410|  1.54k|      }
 1411|  1.54k|      offset += consumed;
 1412|  1.54k|    }
 1413|  1.54k|    byte_queue.clear();
 1414|  1.54k|    return absl::OkStatus();
 1415|  1.54k|  };
 1416|       |
 1417|  1.54k|  bool is_bos_ws = true;
 1418|  1.54k|  const int num_pieces = model_->GetPieceSize();
 1419|  58.9M|  for (const auto& item : active_input) {
  ------------------
  |  Branch (1419:25): [True: 58.9M, False: 1.54k]
  ------------------
 1420|  58.9M|    int id = -1;
 1421|  58.9M|    absl::string_view piece;
 1422|       |    if constexpr (std::is_same_v<T, int>) {
 1423|       |      id = item;
 1424|       |      if (id < 0 || id >= num_pieces) {
 1425|       |        return absl::Status(absl::StatusCode::kOutOfRange,
 1426|       |                            absl::StrCat("Invalid id: ", id));
 1427|       |      }
 1428|       |      piece = model_->IdToPiece(id);
 1429|  58.9M|    } else {
 1430|  58.9M|      piece = item;
 1431|  58.9M|      id = model_->PieceToId(piece);
 1432|  58.9M|    }
 1433|       |
 1434|  58.9M|    if (IsByteId(*model_, id)) {
  ------------------
  |  Branch (1434:9): [True: 46.6M, False: 12.3M]
  ------------------
 1435|  46.6M|      const int byte = PieceToByte(piece);
 1436|  46.6M|      RET_CHECK_LE(0, byte);
  ------------------
  |  |   31|  46.6M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  46.6M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 46.6M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  46.6M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  46.6M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
 1437|  46.6M|      byte_queue.append(1, byte);
 1438|  46.6M|    } else {
 1439|  12.3M|      ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  12.3M|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  24.6M|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  24.6M|  switch (0)                                           \
  |  |  |  |  |  |  350|  24.6M|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 12.3M, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  12.3M|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 12.3M]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  24.6M|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 12.3M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  24.6M|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  24.6M|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  12.3M|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  24.6M|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1440|  12.3M|      if (!detokenized->empty()) {
  ------------------
  |  Branch (1440:11): [True: 12.3M, False: 2.31k]
  ------------------
 1441|  12.3M|        is_bos_ws = false;
 1442|  12.3M|      }
 1443|       |
 1444|  12.3M|      if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1444:11): [True: 0, False: 12.3M]
  ------------------
 1445|      0|        continue;
 1446|      0|      }
 1447|       |
 1448|  12.3M|      absl::string_view p = piece;
 1449|  12.3M|      bool has_bos_ws = false;
 1450|  12.3M|      if (is_bos_ws &&
  ------------------
  |  Branch (1450:11): [True: 2.31k, False: 12.3M]
  ------------------
 1451|  2.31k|          (!model_proto_ ||
  ------------------
  |  Branch (1451:12): [True: 0, False: 2.31k]
  ------------------
 1452|  2.31k|           model_proto_->normalizer_spec().add_dummy_prefix() ||
  ------------------
  |  Branch (1452:12): [True: 2.31k, False: 0]
  ------------------
 1453|  2.31k|           model_proto_->normalizer_spec().remove_extra_whitespaces())) {
  ------------------
  |  Branch (1453:12): [True: 0, False: 0]
  ------------------
 1454|  2.31k|        has_bos_ws = absl::ConsumePrefix(&p, kSpaceSymbol);
 1455|  2.31k|        if (model_proto_ &&
  ------------------
  |  Branch (1455:13): [True: 2.31k, False: 0]
  ------------------
 1456|  2.31k|            model_proto_->normalizer_spec().remove_extra_whitespaces()) {
  ------------------
  |  Branch (1456:13): [True: 2.31k, False: 0]
  ------------------
 1457|  2.31k|          has_bos_ws = false;
 1458|  2.31k|        }
 1459|  2.31k|      }
 1460|       |
 1461|  12.3M|      if (IsUnknownId(*model_, unk_id_, id)) {
  ------------------
  |  Branch (1461:11): [True: 0, False: 12.3M]
  ------------------
 1462|      0|        if (id >= 0 && model_->IdToPiece(id) == piece) {
  ------------------
  |  Branch (1462:13): [True: 0, False: 0]
  |  Branch (1462:24): [True: 0, False: 0]
  ------------------
 1463|      0|          absl::StrAppend(detokenized, unk_surface);
 1464|      0|        } else {
 1465|      0|          absl::StrAppend(detokenized, piece);
 1466|      0|        }
 1467|  12.3M|      } else {
 1468|  12.3M|        absl::StrAppend(detokenized,
 1469|  12.3M|                        absl::StrReplaceAll(p, {{kSpaceSymbol, " "}}));
 1470|  12.3M|      }
 1471|       |
 1472|  12.3M|      if (has_bos_ws || !detokenized->empty()) {
  ------------------
  |  Branch (1472:11): [True: 0, False: 12.3M]
  |  Branch (1472:25): [True: 12.3M, False: 1.95k]
  ------------------
 1473|  12.3M|        is_bos_ws = false;
 1474|  12.3M|      }
 1475|  12.3M|    }
 1476|  58.9M|  }
 1477|  1.54k|  ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  1.54k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  4.64k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  3.09k|  switch (0)                                           \
  |  |  |  |  |  |  350|  3.09k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.54k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.54k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.54k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  4.64k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.54k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  4.64k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  4.64k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.54k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  4.64k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1478|       |
 1479|  1.54k|  if (denormalizer_) {
  ------------------
  |  Branch (1479:7): [True: 0, False: 1.54k]
  ------------------
 1480|      0|    *detokenized = denormalizer_->Normalize(*detokenized);
 1481|      0|  }
 1482|       |
 1483|  1.54k|  return absl::OkStatus();
 1484|  1.54k|}
_ZZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedINSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEEEN4absl12lts_202608176StatusENS8_4SpanIKT_EEPNS2_12basic_stringIcS5_NS2_9allocatorIcEEEEENKUlvE_clEv:
 1395|  12.3M|  auto ProcessByteQueue = [&]() -> absl::Status {
 1396|  12.3M|    if (byte_queue.empty()) return absl::OkStatus();
  ------------------
  |  Branch (1396:9): [True: 10.0M, False: 2.29M]
  ------------------
 1397|  2.29M|    int offset = 0;
 1398|  2.29M|    const int bytes_len = byte_queue.size();
 1399|  29.8M|    while (offset < bytes_len) {
  ------------------
  |  Branch (1399:12): [True: 27.5M, False: 2.29M]
  ------------------
 1400|  27.5M|      size_t consumed;
 1401|  27.5M|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1402|  27.5M|          absl::string_view(byte_queue).substr(offset), &consumed);
 1403|  27.5M|      if (!is_valid) {
  ------------------
  |  Branch (1403:11): [True: 0, False: 27.5M]
  ------------------
 1404|      0|        RET_CHECK_EQ(consumed, 1);
  ------------------
  |  |   28|      0|#define RET_CHECK_EQ(a, b) RET_CHECK((a) == (b))
  |  |  ------------------
  |  |  |  |   23|      0|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|      0|  } else /* NOLINT */                                         \
  |  |  |  |   25|      0|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
 1405|      0|        absl::StrAppend(detokenized, kReplacementCharacter);
 1406|  27.5M|      } else {
 1407|  27.5M|        const absl::string_view utf8 =
 1408|  27.5M|            absl::string_view(byte_queue).substr(offset, consumed);
 1409|  27.5M|        absl::StrAppend(detokenized, utf8);
 1410|  27.5M|      }
 1411|  27.5M|      offset += consumed;
 1412|  27.5M|    }
 1413|  2.29M|    byte_queue.clear();
 1414|  2.29M|    return absl::OkStatus();
 1415|  2.29M|  };
_ZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedIiEEN4absl12lts_202608176StatusENS3_4SpanIKT_EEPNSt3__112basic_stringIcNS9_11char_traitsIcEENS9_9allocatorIcEEEE:
 1368|  1.61k|    absl::Span<const T> input, std::string* detokenized) const {
 1369|  3.23k|  RET_CHECK_STATUS_STL(detokenized);
  ------------------
  |  |  189|  1.61k|  ABSL_RETURN_IF_ERROR(status());                     \
  |  |  ------------------
  |  |  |  |   90|  1.61k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  |  |  ------------------
  |  |  |  |  |  |  162|  3.23k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  349|  3.23k|  switch (0)                                           \
  |  |  |  |  |  |  |  |  350|  3.23k|  case 0:                                              \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (350:3): [True: 1.61k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  351|  1.61k|  default:  // NOLINT
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.61k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  163|  3.23k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (163:12): [True: 1.61k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  164|  3.23k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  |  |  165|  3.23k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  |  |  166|  1.61k|  } else /* NOLINT */                                                     \
  |  |  |  |  |  |  167|  3.23k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  |  |  ------------------
  |  |  ------------------
  |  |  190|  1.61k|  RET_CHECK(container) << "output container is null"; \
  |  |  ------------------
  |  |  |  |   23|  1.61k|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 1.61k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  1.61k|  } else /* NOLINT */                                         \
  |  |  |  |   25|  1.61k|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  |  |  191|  1.61k|  container->clear();
  ------------------
 1370|       |
 1371|  3.23k|  if (input.empty()) {
  ------------------
  |  Branch (1371:7): [True: 0, False: 1.61k]
  ------------------
 1372|      0|    return absl::OkStatus();
 1373|      0|  }
 1374|       |
 1375|       |  // active_input points to the data we will decode. By default it points to the
 1376|       |  // input span (zero-copy).
 1377|  1.61k|  absl::Span<const T> active_input = input;
 1378|       |  // If we have extra options to apply, we must copy the input to a mutable
 1379|       |  // container (work_input) to apply the modifications, as the input span is
 1380|       |  // const.
 1381|  1.61k|  std::vector<T> work_input;
 1382|       |
 1383|  1.61k|  if (!decode_extra_options_.empty()) {
  ------------------
  |  Branch (1383:7): [True: 0, False: 1.61k]
  ------------------
 1384|      0|    work_input.assign(input.begin(), input.end());
 1385|      0|    ABSL_RETURN_IF_ERROR(ApplyExtraOptions(decode_extra_options_, &work_input));
  ------------------
  |  |   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()
  |  |  ------------------
  ------------------
 1386|      0|    active_input = work_input;
 1387|      0|  }
 1388|       |
 1389|  1.61k|  absl::string_view unk_surface = kDefaultUnknownSymbol;
 1390|  1.61k|  if (model_proto_ && model_proto_->trainer_spec().has_unk_surface())
  ------------------
  |  Branch (1390:7): [True: 1.61k, False: 0]
  |  Branch (1390:23): [True: 0, False: 1.61k]
  ------------------
 1391|      0|    unk_surface = model_proto_->trainer_spec().unk_surface();
 1392|       |
 1393|  1.61k|  std::string byte_queue;
 1394|       |
 1395|  1.61k|  auto ProcessByteQueue = [&]() -> absl::Status {
 1396|  1.61k|    if (byte_queue.empty()) return absl::OkStatus();
 1397|  1.61k|    int offset = 0;
 1398|  1.61k|    const int bytes_len = byte_queue.size();
 1399|  1.61k|    while (offset < bytes_len) {
 1400|  1.61k|      size_t consumed;
 1401|  1.61k|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1402|  1.61k|          absl::string_view(byte_queue).substr(offset), &consumed);
 1403|  1.61k|      if (!is_valid) {
 1404|  1.61k|        RET_CHECK_EQ(consumed, 1);
 1405|  1.61k|        absl::StrAppend(detokenized, kReplacementCharacter);
 1406|  1.61k|      } else {
 1407|  1.61k|        const absl::string_view utf8 =
 1408|  1.61k|            absl::string_view(byte_queue).substr(offset, consumed);
 1409|  1.61k|        absl::StrAppend(detokenized, utf8);
 1410|  1.61k|      }
 1411|  1.61k|      offset += consumed;
 1412|  1.61k|    }
 1413|  1.61k|    byte_queue.clear();
 1414|  1.61k|    return absl::OkStatus();
 1415|  1.61k|  };
 1416|       |
 1417|  1.61k|  bool is_bos_ws = true;
 1418|  1.61k|  const int num_pieces = model_->GetPieceSize();
 1419|  57.8M|  for (const auto& item : active_input) {
  ------------------
  |  Branch (1419:25): [True: 57.8M, False: 1.61k]
  ------------------
 1420|  57.8M|    int id = -1;
 1421|  57.8M|    absl::string_view piece;
 1422|  57.8M|    if constexpr (std::is_same_v<T, int>) {
 1423|  57.8M|      id = item;
 1424|  57.8M|      if (id < 0 || id >= num_pieces) {
  ------------------
  |  Branch (1424:11): [True: 0, False: 57.8M]
  |  Branch (1424:21): [True: 0, False: 57.8M]
  ------------------
 1425|      0|        return absl::Status(absl::StatusCode::kOutOfRange,
 1426|      0|                            absl::StrCat("Invalid id: ", id));
 1427|      0|      }
 1428|  57.8M|      piece = model_->IdToPiece(id);
 1429|       |    } else {
 1430|       |      piece = item;
 1431|       |      id = model_->PieceToId(piece);
 1432|       |    }
 1433|       |
 1434|  57.8M|    if (IsByteId(*model_, id)) {
  ------------------
  |  Branch (1434:9): [True: 50.8M, False: 7.00M]
  ------------------
 1435|  50.8M|      const int byte = PieceToByte(piece);
 1436|  50.8M|      RET_CHECK_LE(0, byte);
  ------------------
  |  |   31|  50.8M|#define RET_CHECK_LE(a, b) RET_CHECK((a) <= (b))
  |  |  ------------------
  |  |  |  |   23|  50.8M|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 50.8M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|  50.8M|  } else /* NOLINT */                                         \
  |  |  |  |   25|  50.8M|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
 1437|  50.8M|      byte_queue.append(1, byte);
 1438|  50.8M|    } else {
 1439|  7.00M|      ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  7.00M|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  14.0M|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  14.0M|  switch (0)                                           \
  |  |  |  |  |  |  350|  14.0M|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 7.00M, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  7.00M|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 7.00M]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  14.0M|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 7.00M, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  14.0M|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  14.0M|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  7.00M|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  14.0M|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1440|  7.00M|      if (!detokenized->empty()) {
  ------------------
  |  Branch (1440:11): [True: 7.00M, False: 2.43k]
  ------------------
 1441|  7.00M|        is_bos_ws = false;
 1442|  7.00M|      }
 1443|       |
 1444|  7.00M|      if (IsControlId(*model_, id)) {
  ------------------
  |  Branch (1444:11): [True: 0, False: 7.00M]
  ------------------
 1445|      0|        continue;
 1446|      0|      }
 1447|       |
 1448|  7.00M|      absl::string_view p = piece;
 1449|  7.00M|      bool has_bos_ws = false;
 1450|  7.00M|      if (is_bos_ws &&
  ------------------
  |  Branch (1450:11): [True: 2.43k, False: 7.00M]
  ------------------
 1451|  2.43k|          (!model_proto_ ||
  ------------------
  |  Branch (1451:12): [True: 0, False: 2.43k]
  ------------------
 1452|  2.43k|           model_proto_->normalizer_spec().add_dummy_prefix() ||
  ------------------
  |  Branch (1452:12): [True: 2.43k, False: 0]
  ------------------
 1453|  2.43k|           model_proto_->normalizer_spec().remove_extra_whitespaces())) {
  ------------------
  |  Branch (1453:12): [True: 0, False: 0]
  ------------------
 1454|  2.43k|        has_bos_ws = absl::ConsumePrefix(&p, kSpaceSymbol);
 1455|  2.43k|        if (model_proto_ &&
  ------------------
  |  Branch (1455:13): [True: 2.43k, False: 0]
  ------------------
 1456|  2.43k|            model_proto_->normalizer_spec().remove_extra_whitespaces()) {
  ------------------
  |  Branch (1456:13): [True: 2.43k, False: 0]
  ------------------
 1457|  2.43k|          has_bos_ws = false;
 1458|  2.43k|        }
 1459|  2.43k|      }
 1460|       |
 1461|  7.00M|      if (IsUnknownId(*model_, unk_id_, id)) {
  ------------------
  |  Branch (1461:11): [True: 0, False: 7.00M]
  ------------------
 1462|      0|        if (id >= 0 && model_->IdToPiece(id) == piece) {
  ------------------
  |  Branch (1462:13): [True: 0, False: 0]
  |  Branch (1462:24): [True: 0, False: 0]
  ------------------
 1463|      0|          absl::StrAppend(detokenized, unk_surface);
 1464|      0|        } else {
 1465|      0|          absl::StrAppend(detokenized, piece);
 1466|      0|        }
 1467|  7.00M|      } else {
 1468|  7.00M|        absl::StrAppend(detokenized,
 1469|  7.00M|                        absl::StrReplaceAll(p, {{kSpaceSymbol, " "}}));
 1470|  7.00M|      }
 1471|       |
 1472|  7.00M|      if (has_bos_ws || !detokenized->empty()) {
  ------------------
  |  Branch (1472:11): [True: 0, False: 7.00M]
  |  Branch (1472:25): [True: 7.00M, False: 2.04k]
  ------------------
 1473|  7.00M|        is_bos_ws = false;
 1474|  7.00M|      }
 1475|  7.00M|    }
 1476|  57.8M|  }
 1477|  1.61k|  ABSL_RETURN_IF_ERROR(ProcessByteQueue());
  ------------------
  |  |   90|  1.61k|  ABSL_INTERNAL_STATUS_MACROS_RETURN_IF_ERROR_IMPL_(return, expr)
  |  |  ------------------
  |  |  |  |  162|  4.85k|  ABSL_INTERNAL_STATUS_MACROS_IMPL_ELSE_BLOCKER_                          \
  |  |  |  |  ------------------
  |  |  |  |  |  |  349|  3.23k|  switch (0)                                           \
  |  |  |  |  |  |  350|  3.23k|  case 0:                                              \
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (350:3): [True: 1.61k, False: 0]
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  351|  1.61k|  default:  // NOLINT
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  Branch (351:3): [True: 0, False: 1.61k]
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |  163|  4.85k|  if (auto status_macro_internal_adaptor =                                \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (163:12): [True: 1.61k, False: 0]
  |  |  |  |  ------------------
  |  |  |  |  164|  4.85k|          absl::status_macro_internal::MacroAdaptor(                      \
  |  |  |  |  165|  4.85k|              (expr), absl::SourceLocation::current())) {                 \
  |  |  |  |  166|  1.61k|  } else /* NOLINT */                                                     \
  |  |  |  |  167|  4.85k|    return_keyword status_macro_internal_adaptor.Consume()
  |  |  ------------------
  ------------------
 1478|       |
 1479|  1.61k|  if (denormalizer_) {
  ------------------
  |  Branch (1479:7): [True: 0, False: 1.61k]
  ------------------
 1480|      0|    *detokenized = denormalizer_->Normalize(*detokenized);
 1481|      0|  }
 1482|       |
 1483|  1.61k|  return absl::OkStatus();
 1484|  1.61k|}
_ZZNK13sentencepiece22SentencePieceProcessor15DecodeOptimizedIiEEN4absl12lts_202608176StatusENS3_4SpanIKT_EEPNSt3__112basic_stringIcNS9_11char_traitsIcEENS9_9allocatorIcEEEEENKUlvE_clEv:
 1395|  7.01M|  auto ProcessByteQueue = [&]() -> absl::Status {
 1396|  7.01M|    if (byte_queue.empty()) return absl::OkStatus();
  ------------------
  |  Branch (1396:9): [True: 5.65M, False: 1.35M]
  ------------------
 1397|  1.35M|    int offset = 0;
 1398|  1.35M|    const int bytes_len = byte_queue.size();
 1399|  33.7M|    while (offset < bytes_len) {
  ------------------
  |  Branch (1399:12): [True: 32.4M, False: 1.35M]
  ------------------
 1400|  32.4M|      size_t consumed;
 1401|  32.4M|      const bool is_valid = string_util::IsValidDecodeUTF8(
 1402|  32.4M|          absl::string_view(byte_queue).substr(offset), &consumed);
 1403|  32.4M|      if (!is_valid) {
  ------------------
  |  Branch (1403:11): [True: 0, False: 32.4M]
  ------------------
 1404|      0|        RET_CHECK_EQ(consumed, 1);
  ------------------
  |  |   28|      0|#define RET_CHECK_EQ(a, b) RET_CHECK((a) == (b))
  |  |  ------------------
  |  |  |  |   23|      0|  if (condition) {                                            \
  |  |  |  |  ------------------
  |  |  |  |  |  Branch (23:7): [True: 0, False: 0]
  |  |  |  |  ------------------
  |  |  |  |   24|      0|  } else /* NOLINT */                                         \
  |  |  |  |   25|      0|    return absl::StatusBuilder(::absl::StatusCode::kInternal) \
  |  |  |  |   26|      0|           << __FILE__ << "(" << __LINE__ << ") [" << #condition << "] "
  |  |  ------------------
  ------------------
 1405|      0|        absl::StrAppend(detokenized, kReplacementCharacter);
 1406|  32.4M|      } else {
 1407|  32.4M|        const absl::string_view utf8 =
 1408|  32.4M|            absl::string_view(byte_queue).substr(offset, consumed);
 1409|  32.4M|        absl::StrAppend(detokenized, utf8);
 1410|  32.4M|      }
 1411|  32.4M|      offset += consumed;
 1412|  32.4M|    }
 1413|  1.35M|    byte_queue.clear();
 1414|  1.35M|    return absl::OkStatus();
 1415|  1.35M|  };
_ZNK13sentencepiece22SentencePieceProcessor17ApplyExtraOptionsINS_17SentencePieceTextEEEN4absl12lts_202608176StatusENS4_4SpanIKNS0_11ExtraOptionEEEPT_:
 1162|  14.4k|    absl::Span<const ExtraOption> extra_options, T* output) const {
 1163|  14.4k|  for (const auto& extra_option : extra_options) {
  ------------------
  |  Branch (1163:33): [True: 0, False: 14.4k]
  ------------------
 1164|      0|    switch (extra_option) {
 1165|      0|      case REVERSE:
  ------------------
  |  Branch (1165:7): [True: 0, False: 0]
  ------------------
 1166|      0|        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1167|      0|          std::reverse(output->mutable_pieces()->begin(),
 1168|      0|                       output->mutable_pieces()->end());
 1169|       |        } else {
 1170|       |          std::reverse(output->begin(), output->end());
 1171|       |        }
 1172|      0|        break;
 1173|      0|      case EOS:
  ------------------
  |  Branch (1173:7): [True: 0, False: 0]
  ------------------
 1174|      0|        if (const int id = eos_id(); id != -1) {
  ------------------
  |  Branch (1174:38): [True: 0, False: 0]
  ------------------
 1175|      0|          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1176|      0|            auto* piece = output->add_pieces();
 1177|      0|            piece->set_id(id);
 1178|      0|            piece->set_piece(model_->eos_piece().data(),
 1179|      0|                             model_->eos_piece().size());
 1180|      0|            piece->set_begin(output->text().size());
 1181|      0|            piece->set_end(output->text().size());
 1182|       |          } else {
 1183|       |            using V = typename T::value_type;
 1184|       |            if constexpr (std::is_same_v<V, int>) {
 1185|       |              output->emplace_back(id);
 1186|       |            } else {
 1187|       |              output->emplace_back(model_->eos_piece());
 1188|       |            }
 1189|       |          }
 1190|      0|        }
 1191|      0|        break;
 1192|      0|      case BOS:
  ------------------
  |  Branch (1192:7): [True: 0, False: 0]
  ------------------
 1193|      0|        if (const int id = bos_id(); id != -1) {
  ------------------
  |  Branch (1193:38): [True: 0, False: 0]
  ------------------
 1194|      0|          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1195|      0|            auto* array = output->mutable_pieces();
 1196|      0|            array->Add();
 1197|      0|            for (int i = array->size() - 1; i > 0; --i) {
  ------------------
  |  Branch (1197:45): [True: 0, False: 0]
  ------------------
 1198|      0|              array->SwapElements(i - 1, i);
 1199|      0|            }
 1200|      0|            auto* piece = array->Mutable(0);
 1201|      0|            piece->set_id(id);
 1202|      0|            piece->set_piece(model_->bos_piece().data(),
 1203|      0|                             model_->bos_piece().size());
 1204|      0|            piece->set_begin(0);
 1205|      0|            piece->set_end(0);
 1206|       |          } else {
 1207|       |            using V = typename T::value_type;
 1208|       |            if constexpr (std::is_same_v<V, int>) {
 1209|       |              output->emplace(output->begin(), id);
 1210|       |            } else {
 1211|       |              output->emplace(output->begin(), model_->bos_piece());
 1212|       |            }
 1213|       |          }
 1214|      0|        }
 1215|      0|        break;
 1216|      0|      case UNK_PIECE:
  ------------------
  |  Branch (1216:7): [True: 0, False: 0]
  ------------------
 1217|      0|        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1218|      0|          for (int i = 0; i < output->pieces_size(); ++i) {
  ------------------
  |  Branch (1218:27): [True: 0, False: 0]
  ------------------
 1219|      0|            auto* piece = output->mutable_pieces(i);
 1220|      0|            if (IsUnknownId(*model_, unk_id_, piece->id())) {
  ------------------
  |  Branch (1220:17): [True: 0, False: 0]
  ------------------
 1221|      0|              piece->set_piece(model_->unk_piece().data(),
 1222|      0|                               model_->unk_piece().size());
 1223|      0|            }
 1224|      0|          }
 1225|      0|        }
 1226|      0|        break;
 1227|      0|      default:
  ------------------
  |  Branch (1227:7): [True: 0, False: 0]
  ------------------
 1228|      0|        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1229|      0|          output->Clear();
 1230|       |        } else {
 1231|       |          output->clear();
 1232|       |        }
 1233|      0|        return absl::InternalError("unknown extra_option type.");
 1234|      0|    }
 1235|      0|  }
 1236|  14.4k|  return absl::OkStatus();
 1237|  14.4k|}
_ZNK13sentencepiece22SentencePieceProcessor17ApplyExtraOptionsINSt3__16vectorINS2_12basic_stringIcNS2_11char_traitsIcEENS2_9allocatorIcEEEENS7_IS9_EEEEEEN4absl12lts_202608176StatusENSD_4SpanIKNS0_11ExtraOptionEEEPT_:
 1162|  3.09k|    absl::Span<const ExtraOption> extra_options, T* output) const {
 1163|  3.09k|  for (const auto& extra_option : extra_options) {
  ------------------
  |  Branch (1163:33): [True: 0, False: 3.09k]
  ------------------
 1164|      0|    switch (extra_option) {
 1165|      0|      case REVERSE:
  ------------------
  |  Branch (1165:7): [True: 0, False: 0]
  ------------------
 1166|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1167|       |          std::reverse(output->mutable_pieces()->begin(),
 1168|       |                       output->mutable_pieces()->end());
 1169|      0|        } else {
 1170|      0|          std::reverse(output->begin(), output->end());
 1171|      0|        }
 1172|      0|        break;
 1173|      0|      case EOS:
  ------------------
  |  Branch (1173:7): [True: 0, False: 0]
  ------------------
 1174|      0|        if (const int id = eos_id(); id != -1) {
  ------------------
  |  Branch (1174:38): [True: 0, False: 0]
  ------------------
 1175|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1176|       |            auto* piece = output->add_pieces();
 1177|       |            piece->set_id(id);
 1178|       |            piece->set_piece(model_->eos_piece().data(),
 1179|       |                             model_->eos_piece().size());
 1180|       |            piece->set_begin(output->text().size());
 1181|       |            piece->set_end(output->text().size());
 1182|      0|          } else {
 1183|      0|            using V = typename T::value_type;
 1184|       |            if constexpr (std::is_same_v<V, int>) {
 1185|       |              output->emplace_back(id);
 1186|      0|            } else {
 1187|      0|              output->emplace_back(model_->eos_piece());
 1188|      0|            }
 1189|      0|          }
 1190|      0|        }
 1191|      0|        break;
 1192|      0|      case BOS:
  ------------------
  |  Branch (1192:7): [True: 0, False: 0]
  ------------------
 1193|      0|        if (const int id = bos_id(); id != -1) {
  ------------------
  |  Branch (1193:38): [True: 0, False: 0]
  ------------------
 1194|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1195|       |            auto* array = output->mutable_pieces();
 1196|       |            array->Add();
 1197|       |            for (int i = array->size() - 1; i > 0; --i) {
 1198|       |              array->SwapElements(i - 1, i);
 1199|       |            }
 1200|       |            auto* piece = array->Mutable(0);
 1201|       |            piece->set_id(id);
 1202|       |            piece->set_piece(model_->bos_piece().data(),
 1203|       |                             model_->bos_piece().size());
 1204|       |            piece->set_begin(0);
 1205|       |            piece->set_end(0);
 1206|      0|          } else {
 1207|      0|            using V = typename T::value_type;
 1208|       |            if constexpr (std::is_same_v<V, int>) {
 1209|       |              output->emplace(output->begin(), id);
 1210|      0|            } else {
 1211|      0|              output->emplace(output->begin(), model_->bos_piece());
 1212|      0|            }
 1213|      0|          }
 1214|      0|        }
 1215|      0|        break;
 1216|      0|      case UNK_PIECE:
  ------------------
  |  Branch (1216:7): [True: 0, False: 0]
  ------------------
 1217|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1218|       |          for (int i = 0; i < output->pieces_size(); ++i) {
 1219|       |            auto* piece = output->mutable_pieces(i);
 1220|       |            if (IsUnknownId(*model_, unk_id_, piece->id())) {
 1221|       |              piece->set_piece(model_->unk_piece().data(),
 1222|       |                               model_->unk_piece().size());
 1223|       |            }
 1224|       |          }
 1225|       |        }
 1226|      0|        break;
 1227|      0|      default:
  ------------------
  |  Branch (1227:7): [True: 0, False: 0]
  ------------------
 1228|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1229|       |          output->Clear();
 1230|      0|        } else {
 1231|      0|          output->clear();
 1232|      0|        }
 1233|      0|        return absl::InternalError("unknown extra_option type.");
 1234|      0|    }
 1235|      0|  }
 1236|  3.09k|  return absl::OkStatus();
 1237|  3.09k|}
_ZNK13sentencepiece22SentencePieceProcessor17ApplyExtraOptionsINSt3__16vectorIiNS2_9allocatorIiEEEEEEN4absl12lts_202608176StatusENS8_4SpanIKNS0_11ExtraOptionEEEPT_:
 1162|  1.63k|    absl::Span<const ExtraOption> extra_options, T* output) const {
 1163|  1.63k|  for (const auto& extra_option : extra_options) {
  ------------------
  |  Branch (1163:33): [True: 0, False: 1.63k]
  ------------------
 1164|      0|    switch (extra_option) {
 1165|      0|      case REVERSE:
  ------------------
  |  Branch (1165:7): [True: 0, False: 0]
  ------------------
 1166|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1167|       |          std::reverse(output->mutable_pieces()->begin(),
 1168|       |                       output->mutable_pieces()->end());
 1169|      0|        } else {
 1170|      0|          std::reverse(output->begin(), output->end());
 1171|      0|        }
 1172|      0|        break;
 1173|      0|      case EOS:
  ------------------
  |  Branch (1173:7): [True: 0, False: 0]
  ------------------
 1174|      0|        if (const int id = eos_id(); id != -1) {
  ------------------
  |  Branch (1174:38): [True: 0, False: 0]
  ------------------
 1175|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1176|       |            auto* piece = output->add_pieces();
 1177|       |            piece->set_id(id);
 1178|       |            piece->set_piece(model_->eos_piece().data(),
 1179|       |                             model_->eos_piece().size());
 1180|       |            piece->set_begin(output->text().size());
 1181|       |            piece->set_end(output->text().size());
 1182|      0|          } else {
 1183|      0|            using V = typename T::value_type;
 1184|      0|            if constexpr (std::is_same_v<V, int>) {
 1185|      0|              output->emplace_back(id);
 1186|       |            } else {
 1187|       |              output->emplace_back(model_->eos_piece());
 1188|       |            }
 1189|      0|          }
 1190|      0|        }
 1191|      0|        break;
 1192|      0|      case BOS:
  ------------------
  |  Branch (1192:7): [True: 0, False: 0]
  ------------------
 1193|      0|        if (const int id = bos_id(); id != -1) {
  ------------------
  |  Branch (1193:38): [True: 0, False: 0]
  ------------------
 1194|       |          if constexpr (std::is_same_v<T, SentencePieceText>) {
 1195|       |            auto* array = output->mutable_pieces();
 1196|       |            array->Add();
 1197|       |            for (int i = array->size() - 1; i > 0; --i) {
 1198|       |              array->SwapElements(i - 1, i);
 1199|       |            }
 1200|       |            auto* piece = array->Mutable(0);
 1201|       |            piece->set_id(id);
 1202|       |            piece->set_piece(model_->bos_piece().data(),
 1203|       |                             model_->bos_piece().size());
 1204|       |            piece->set_begin(0);
 1205|       |            piece->set_end(0);
 1206|      0|          } else {
 1207|      0|            using V = typename T::value_type;
 1208|      0|            if constexpr (std::is_same_v<V, int>) {
 1209|      0|              output->emplace(output->begin(), id);
 1210|       |            } else {
 1211|       |              output->emplace(output->begin(), model_->bos_piece());
 1212|       |            }
 1213|      0|          }
 1214|      0|        }
 1215|      0|        break;
 1216|      0|      case UNK_PIECE:
  ------------------
  |  Branch (1216:7): [True: 0, False: 0]
  ------------------
 1217|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1218|       |          for (int i = 0; i < output->pieces_size(); ++i) {
 1219|       |            auto* piece = output->mutable_pieces(i);
 1220|       |            if (IsUnknownId(*model_, unk_id_, piece->id())) {
 1221|       |              piece->set_piece(model_->unk_piece().data(),
 1222|       |                               model_->unk_piece().size());
 1223|       |            }
 1224|       |          }
 1225|       |        }
 1226|      0|        break;
 1227|      0|      default:
  ------------------
  |  Branch (1227:7): [True: 0, False: 0]
  ------------------
 1228|       |        if constexpr (std::is_same_v<T, SentencePieceText>) {
 1229|       |          output->Clear();
 1230|      0|        } else {
 1231|      0|          output->clear();
 1232|      0|        }
 1233|      0|        return absl::InternalError("unknown extra_option type.");
 1234|      0|    }
 1235|      0|  }
 1236|  1.63k|  return absl::OkStatus();
 1237|  1.63k|}

_ZNK13sentencepiece22SentencePieceProcessor14EncodeAsPiecesENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEE:
  286|  1.52k|      absl::string_view input) const {
  287|  1.52k|    DEFINE_SPP_DIRECT_FUNC_IMPL(Encode, std::vector<std::string>, input);
  ------------------
  |  |  278|  1.52k|  OutType output;                                           \
  |  |  279|  1.52k|  const auto status = FuncName(__VA_ARGS__, &output);       \
  |  |  280|  1.52k|  return output;
  ------------------
  288|      0|  }
_ZNK13sentencepiece22SentencePieceProcessor19NBestEncodeAsPiecesENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEi:
  296|  1.52k|  NBestEncodeAsPieces(absl::string_view input, int nbest_size) const {
  297|  1.52k|    DEFINE_SPP_DIRECT_FUNC_IMPL(
  ------------------
  |  |  278|  1.52k|  OutType output;                                           \
  |  |  279|  1.52k|  const auto status = FuncName(__VA_ARGS__, &output);       \
  |  |  280|  1.52k|  return output;
  ------------------
  298|  1.52k|        NBestEncode, std::vector<std::vector<std::string>>, input, nbest_size);
  299|      0|  }
_ZNK13sentencepiece22SentencePieceProcessor20SampleEncodeAsPiecesENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEif:
  308|  2.37k|      absl::string_view input, int nbest_size, float alpha) const {
  309|  2.37k|    DEFINE_SPP_DIRECT_FUNC_IMPL(SampleEncode, std::vector<std::string>, input,
  ------------------
  |  |  278|  2.37k|  OutType output;                                           \
  |  |  279|  2.37k|  const auto status = FuncName(__VA_ARGS__, &output);       \
  |  |  280|  2.37k|  return output;
  ------------------
  310|  2.37k|                                nbest_size, alpha);
  311|      0|  }

_ZN13sentencepiece7unigram7LatticeC2Ev:
   92|  9.67k|Lattice::Lattice() : node_allocator_(kPreallocateLatticeNodeSize) {}
_ZN13sentencepiece7unigram7LatticeD2Ev:
   93|  9.67k|Lattice::~Lattice() {}
_ZNK13sentencepiece7unigram7Lattice9end_nodesEi:
   99|   474M|const std::vector<Lattice::Node*>& Lattice::end_nodes(int pos) const {
  100|   474M|  return end_nodes_[pos];
  101|   474M|}
_ZNK13sentencepiece7unigram7Lattice4sizeEv:
  103|  85.7M|int Lattice::size() const {
  104|       |  // -1 because surface_ may include the EOS.
  105|  85.7M|  return std::max<int>(0, surface_.size() - 1);
  106|  85.7M|}
_ZNK13sentencepiece7unigram7Lattice9utf8_sizeEv:
  108|  9.67k|int Lattice::utf8_size() const { return sentence_.size(); }
_ZNK13sentencepiece7unigram7Lattice8sentenceEv:
  110|  9.67k|const char* Lattice::sentence() const { return sentence_.data(); }
_ZNK13sentencepiece7unigram7Lattice7surfaceEi:
  112|   387M|const char* Lattice::surface(int pos) const { return surface_[pos]; }
_ZNK13sentencepiece7unigram7Lattice8bos_nodeEv:
  114|   250M|Lattice::Node* Lattice::bos_node() const { return end_nodes_[0][0]; }
_ZNK13sentencepiece7unigram7Lattice8eos_nodeEv:
  116|  13.9k|Lattice::Node* Lattice::eos_node() const { return begin_nodes_[size()][0]; }
_ZN13sentencepiece7unigram7Lattice7NewNodeEv:
  118|  85.7M|Lattice::Node* Lattice::NewNode() {
  119|  85.7M|  Node* node = node_allocator_.Allocate();
  120|  85.7M|  node->node_id = node_allocator_.size() - 1;
  121|  85.7M|  return node;
  122|  85.7M|}
_ZN13sentencepiece7unigram7Lattice5ClearEv:
  124|  9.67k|void Lattice::Clear() {
  125|  9.67k|  begin_nodes_.clear();
  126|  9.67k|  end_nodes_.clear();
  127|  9.67k|  sentence_ = absl::string_view("");
  128|  9.67k|  surface_.clear();
  129|  9.67k|  node_allocator_.Free();
  130|  9.67k|}
_ZN13sentencepiece7unigram7Lattice11SetSentenceENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  132|  9.67k|void Lattice::SetSentence(absl::string_view sentence) {
  133|  9.67k|  Clear();
  134|       |
  135|  9.67k|  sentence_ = sentence;
  136|  9.67k|  surface_.reserve(sentence.size() + 1);
  137|       |
  138|  80.7M|  while (!sentence.empty()) {
  ------------------
  |  Branch (138:10): [True: 80.7M, False: 9.67k]
  ------------------
  139|  80.7M|    const int mblen = std::min<int>(string_util::OneCharLen(sentence.data()),
  140|  80.7M|                                    sentence.size());
  141|  80.7M|    surface_.push_back(sentence.data());
  142|  80.7M|    sentence.remove_prefix(mblen);
  143|  80.7M|  }
  144|  9.67k|  surface_.push_back(sentence.data());
  145|       |
  146|  9.67k|  const size_t len = size();
  147|  9.67k|  begin_nodes_.resize(len + 1);
  148|  9.67k|  end_nodes_.resize(len + 1);
  149|       |
  150|  9.67k|  constexpr size_t kReservedNodeSize = 16;
  151|  80.7M|  for (size_t i = 0; i <= len; ++i) {
  ------------------
  |  Branch (151:22): [True: 80.7M, False: 9.67k]
  ------------------
  152|  80.7M|    begin_nodes_[i].reserve(kReservedNodeSize);
  153|  80.7M|    end_nodes_[i].reserve(kReservedNodeSize);
  154|  80.7M|  }
  155|       |
  156|  9.67k|  Node* bos = NewNode();
  157|  9.67k|  bos->id = -1;
  158|  9.67k|  bos->pos = 0;
  159|  9.67k|  end_nodes_[0].push_back(bos);
  160|       |
  161|  9.67k|  Node* eos = NewNode();
  162|  9.67k|  eos->id = -1;
  163|  9.67k|  eos->pos = len;
  164|  9.67k|  begin_nodes_[len].push_back(eos);
  165|  9.67k|}
_ZN13sentencepiece7unigram7Lattice6InsertEii:
  167|  85.6M|Lattice::Node* Lattice::Insert(int pos, int length) {
  168|  85.6M|  const int len = size();
  169|  85.6M|  if (pos < 0 || length <= 0 || pos + length > len) {
  ------------------
  |  Branch (169:7): [True: 0, False: 85.6M]
  |  Branch (169:18): [True: 0, False: 85.6M]
  |  Branch (169:33): [True: 0, False: 85.6M]
  ------------------
  170|      0|    LOG(ERROR) << "Invalid node position or length: pos=" << pos
  ------------------
  |  |  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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  171|      0|               << " length=" << length << " size=" << len;
  172|      0|    return nullptr;
  173|      0|  }
  174|  85.6M|  Node* node = NewNode();
  175|  85.6M|  node->pos = pos;
  176|  85.6M|  node->length = length;
  177|  85.6M|  const int utf8_length =
  178|  85.6M|      static_cast<int>(surface(pos + length) - surface(pos));
  179|  85.6M|  node->piece = absl::string_view(surface(pos), utf8_length);
  180|  85.6M|  begin_nodes_[pos].push_back(node);
  181|  85.6M|  end_nodes_[pos + node->length].push_back(node);
  182|       |
  183|  85.6M|  return node;
  184|  85.6M|}
_ZN13sentencepiece7unigram7Lattice7ViterbiEv:
  186|  5.66k|Lattice::LatticePathWithScore Lattice::Viterbi() {
  187|  5.66k|  const size_t len = size();
  188|  5.66k|  if (len == 0) return {};
  ------------------
  |  Branch (188:7): [True: 0, False: 5.66k]
  ------------------
  189|       |
  190|  58.9M|  for (size_t pos = 0; pos <= len; ++pos) {
  ------------------
  |  Branch (190:24): [True: 58.9M, False: 5.66k]
  ------------------
  191|  62.8M|    for (Node* rnode : begin_nodes_[pos]) {
  ------------------
  |  Branch (191:22): [True: 62.8M, False: 58.9M]
  ------------------
  192|  62.8M|      rnode->prev = nullptr;
  193|  62.8M|      float best_score = 0.0;
  194|  62.8M|      Node* best_node = nullptr;
  195|  69.3M|      for (Node* lnode : end_nodes_[pos]) {
  ------------------
  |  Branch (195:24): [True: 69.3M, False: 62.8M]
  ------------------
  196|  69.3M|        const float score = lnode->backtrace_score + rnode->score;
  197|  69.3M|        if (best_node == nullptr || score > best_score) {
  ------------------
  |  Branch (197:13): [True: 62.8M, False: 6.52M]
  |  Branch (197:37): [True: 6.41M, False: 107k]
  ------------------
  198|  69.2M|          best_node = lnode;
  199|  69.2M|          best_score = score;
  200|  69.2M|        }
  201|  69.3M|      }
  202|  62.8M|      if (best_node == nullptr) {
  ------------------
  |  Branch (202:11): [True: 0, False: 62.8M]
  ------------------
  203|      0|        LOG(ERROR) << "Failed to find the best path in Viterbi.";
  ------------------
  |  |  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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  204|      0|        return {};
  205|      0|      }
  206|  62.8M|      rnode->prev = best_node;
  207|  62.8M|      rnode->backtrace_score = best_score;
  208|  62.8M|    }
  209|  58.9M|  }
  210|       |
  211|       |  // backtrace
  212|  5.66k|  std::vector<Node*> results;
  213|  5.66k|  if (begin_nodes_[len].empty() || begin_nodes_[len][0] == nullptr) {
  ------------------
  |  Branch (213:7): [True: 0, False: 5.66k]
  |  Branch (213:36): [True: 0, False: 5.66k]
  ------------------
  214|      0|    LOG(ERROR) << "EOS node is missing in Viterbi.";
  ------------------
  |  |  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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  215|      0|    return {};
  216|      0|  }
  217|  5.66k|  float score = begin_nodes_[len][0]->backtrace_score;
  218|  5.66k|  for (Node* node = begin_nodes_[len][0]->prev;
  219|  58.9M|       node != nullptr && node->prev != nullptr; node = node->prev) {
  ------------------
  |  Branch (219:8): [True: 58.9M, False: 0]
  |  Branch (219:27): [True: 58.9M, False: 5.66k]
  ------------------
  220|  58.9M|    results.push_back(node);
  221|  58.9M|    if (results.size() > len) {
  ------------------
  |  Branch (221:9): [True: 0, False: 58.9M]
  ------------------
  222|      0|      LOG(ERROR) << "Detected cycle or infinite loop in Viterbi backtrace.";
  ------------------
  |  |  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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  223|      0|      return {};
  224|      0|    }
  225|  58.9M|  }
  226|       |
  227|  5.66k|  std::reverse(results.begin(), results.end());
  228|       |
  229|  5.66k|  LatticePathWithScore retval = {results, score};
  230|       |
  231|  5.66k|  return retval;
  232|  5.66k|}
_ZNK13sentencepiece7unigram7Lattice16ForwardAlgorithmEf:
  234|  4.29k|std::vector<float> Lattice::ForwardAlgorithm(float inv_theta) const {
  235|  4.29k|  const size_t len = size();
  236|  4.29k|  std::vector<float> alpha(node_allocator_.size(), 0.0);
  237|       |
  238|  43.1M|  for (size_t pos = 0; pos <= len; ++pos) {
  ------------------
  |  Branch (238:24): [True: 43.1M, False: 4.29k]
  ------------------
  239|  45.3M|    for (Node* rnode : begin_nodes_[pos]) {
  ------------------
  |  Branch (239:22): [True: 45.3M, False: 43.1M]
  ------------------
  240|  49.3M|      for (Node* lnode : end_nodes_[pos]) {
  ------------------
  |  Branch (240:24): [True: 49.3M, False: 45.3M]
  ------------------
  241|  49.3M|        alpha[rnode->node_id] =
  242|  49.3M|            LogSumExp(alpha[rnode->node_id],
  243|  49.3M|                      inv_theta * lnode->score + alpha[lnode->node_id],
  244|  49.3M|                      lnode == end_nodes_[pos][0]);
  245|  49.3M|      }
  246|  45.3M|    }
  247|  43.1M|  }
  248|       |
  249|  4.29k|  return alpha;
  250|  4.29k|}
_ZN13sentencepiece7unigram7Lattice5NBestEmbf:
  351|  5.38k|                                                          float inv_theta) {
  352|  5.38k|  if (nbest_size < 1) {
  ------------------
  |  Branch (352:7): [True: 0, False: 5.38k]
  ------------------
  353|      0|    LOG(WARNING) << "nbest_size >= 1. Returns empty result.";
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|      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()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|      0|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  354|      0|    return {};
  355|      0|  }
  356|       |
  357|  5.38k|  const size_t len = size();
  358|  5.38k|  if (len == 0) return {};
  ------------------
  |  Branch (358:7): [True: 0, False: 5.38k]
  ------------------
  359|       |
  360|  5.38k|  if (nbest_size == 1 && !sample) {
  ------------------
  |  Branch (360:7): [True: 0, False: 5.38k]
  |  Branch (360:26): [True: 0, False: 0]
  ------------------
  361|      0|    return {Viterbi()};
  362|      0|  }
  363|       |
  364|  5.38k|  const int timeout_ms = sentencepiece::GetNBestTimeout();
  365|  5.38k|  const absl::Time start_time = absl::Now();
  366|       |
  367|       |  // Uses A* search to enumerate N-bests.
  368|       |  // Given a lattice, enumerates hypotheses (paths) from EOS.
  369|       |  // At each partial path x, compute f(x) as follows
  370|       |  //   f(x) = g(x) + h(x).
  371|       |  // g(x): the sum of scores from  EOS to the left-most node in x.
  372|       |  //       for a complete hypothesis, g(hyp) is the score of the hypothesis.
  373|       |  // h(x): a heuristic that estimates the largest score from x to BOS.
  374|       |  // f(x): the priority to pop a new hypothesis from the priority queue.
  375|       |  //
  376|       |  // As left-to-right Viterbi search can tell the *exact* value of h(x),
  377|       |  // we can obtain the exact n-best results with A*.
  378|       |
  379|  5.38k|  class HypothesisComparator {
  380|  5.38k|   public:
  381|  5.38k|    const bool operator()(Hypothesis* h1, Hypothesis* h2) {
  382|  5.38k|      return (h1->fx < h2->fx);
  383|  5.38k|    }
  384|  5.38k|  };
  385|       |
  386|  5.38k|  using Agenda = std::priority_queue<Hypothesis*, std::vector<Hypothesis*>,
  387|  5.38k|                                     HypothesisComparator>;
  388|  5.38k|  constexpr size_t kPreallocatedHypothesisSize = 512;
  389|  5.38k|  model::FreeList<Hypothesis> hypothesis_allocator(kPreallocatedHypothesisSize);
  390|       |
  391|  5.38k|  Agenda agenda;
  392|  5.38k|  std::vector<Lattice::LatticePathWithScore> results;
  393|       |
  394|  5.38k|  auto* eos = hypothesis_allocator.Allocate();
  395|  5.38k|  eos->node = eos_node();
  396|  5.38k|  eos->next = nullptr;
  397|  5.38k|  eos->gx = 0.0;
  398|       |
  399|  5.38k|  std::vector<float> alpha;
  400|       |
  401|  5.38k|  if (sample) {
  ------------------
  |  Branch (401:7): [True: 0, False: 5.38k]
  ------------------
  402|       |    // Run forwards algorithm to get normalising constants
  403|      0|    alpha = ForwardAlgorithm(inv_theta);
  404|       |    // f(eos) = Gumbel(0), as it is the perturbed score of the entire lattice.
  405|      0|    eos->fx = Gumbel();
  406|  5.38k|  } else {
  407|       |    // Run Viterbi first to fill backtrace score.
  408|  5.38k|    Viterbi();
  409|  5.38k|    eos->fx = eos->node->backtrace_score;
  410|  5.38k|  }
  411|  5.38k|  agenda.push(eos);
  412|       |
  413|  5.38k|  constexpr size_t kMaxAgendaSize = 10000;
  414|  5.38k|  constexpr size_t kMinAgendaSize = 512;
  415|  5.38k|  constexpr size_t kMaxHypothesisSize = 100000;
  416|  5.38k|  constexpr size_t kMaxAllocatorSize = 500000;
  417|  5.38k|  constexpr int kMaxShrinkCount = 10;
  418|  5.38k|  const size_t min_agenda_size =
  419|  5.38k|      std::min<size_t>(kMinAgendaSize, nbest_size * 10);
  420|  5.38k|  size_t max_hypothesis_size = kMaxHypothesisSize;
  421|  5.38k|  size_t total_hypotheses = 1;  // Includes EOS hypothesis.
  422|  5.38k|  int shrink_count = 0;         // Number of times agenda has shrunk.
  423|  5.38k|  size_t step_count = 0;
  424|   208M|  while (!agenda.empty()) {
  ------------------
  |  Branch (424:10): [True: 208M, False: 2.11k]
  ------------------
  425|   208M|    if (timeout_ms > 0 && (++step_count & 0xFFF) == 0) {
  ------------------
  |  Branch (425:9): [True: 208M, False: 0]
  |  Branch (425:27): [True: 49.5k, False: 208M]
  ------------------
  426|  49.5k|      const auto elapsed = absl::ToInt64Milliseconds(absl::Now() - start_time);
  427|  49.5k|      if (elapsed >= timeout_ms) {
  ------------------
  |  Branch (427:11): [True: 0, False: 49.5k]
  ------------------
  428|      0|        LOG(WARNING) << "NBest search timed out after " << elapsed << " ms. "
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|      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()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|      0|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  429|      0|                     << "Falling back to Viterbi best path.";
  430|      0|        return {Viterbi()};
  431|      0|      }
  432|  49.5k|    }
  433|       |
  434|   208M|    auto* top = agenda.top();
  435|   208M|    agenda.pop();
  436|   208M|    auto* node = top->node;
  437|       |
  438|       |    // Reaches to BOS
  439|   208M|    if (node == bos_node()) {
  ------------------
  |  Branch (439:9): [True: 12.0k, False: 208M]
  ------------------
  440|  12.0k|      results.resize(results.size() + 1);
  441|  37.4M|      for (auto* n = top->next; n != nullptr && n->next != nullptr;
  ------------------
  |  Branch (441:33): [True: 37.4M, False: 0]
  |  Branch (441:49): [True: 37.4M, False: 12.0k]
  ------------------
  442|  37.4M|           n = n->next) {
  443|  37.4M|        results.back().first.push_back(n->node);
  444|  37.4M|        if (results.back().first.size() > len) {
  ------------------
  |  Branch (444:13): [True: 0, False: 37.4M]
  ------------------
  445|      0|          LOG(ERROR) << "Detected cycle in NBest path.";
  ------------------
  |  |  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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  446|      0|          break;
  447|      0|        }
  448|  37.4M|      }
  449|  12.0k|      results.back().second = top->fx;
  450|  12.0k|      if (results.size() == nbest_size) {
  ------------------
  |  Branch (450:11): [True: 2.97k, False: 9.09k]
  ------------------
  451|  2.97k|        break;
  452|  2.97k|      }
  453|  9.09k|      continue;
  454|  12.0k|    }
  455|       |
  456|   208M|    const size_t end_nodes_size = end_nodes(node->pos).size();
  457|   208M|    std::vector<float> probs;
  458|   208M|    std::vector<double> adjusted_probs;
  459|   208M|    if (sample) {
  ------------------
  |  Branch (459:9): [True: 0, False: 208M]
  ------------------
  460|      0|      probs.resize(end_nodes_size, 0.0);
  461|      0|      std::vector<float> perturbed_probs(end_nodes_size, 0.0);
  462|      0|      adjusted_probs.resize(end_nodes_size, 0.0);
  463|      0|      const float Z = alpha[node->node_id];
  464|      0|      float max_score = -1e8;
  465|       |      // Calculate the marginal and perturbed scores for stochastic search
  466|      0|      for (size_t i = 0; i < end_nodes_size; i++) {
  ------------------
  |  Branch (466:26): [True: 0, False: 0]
  ------------------
  467|      0|        Node* lnode = end_nodes(node->pos)[i];
  468|       |        // Calculate backwards transition score
  469|      0|        probs[i] =
  470|      0|            top->gx + alpha[lnode->node_id] + (inv_theta * lnode->score) - Z;
  471|      0|        perturbed_probs[i] = probs[i] + Gumbel();
  472|      0|        if (perturbed_probs[i] > max_score) {
  ------------------
  |  Branch (472:13): [True: 0, False: 0]
  ------------------
  473|      0|          max_score = perturbed_probs[i];
  474|      0|        }
  475|      0|      }
  476|       |      // Now constrain the sampled continuations to match the score of parent
  477|      0|      for (size_t i = 0; i < adjusted_probs.size(); i++) {
  ------------------
  |  Branch (477:26): [True: 0, False: 0]
  ------------------
  478|       |        // Use numerically stable version of truncated Gumbel:
  479|       |        // https://arxiv.org/pdf/1903.06059.pdf appendix B.3
  480|      0|        const float v = top->fx - perturbed_probs[i] +
  481|      0|                        std::log1p(-std::exp(perturbed_probs[i] - max_score));
  482|      0|        adjusted_probs[i] = top->fx - std::max(static_cast<float>(0.0), v) -
  483|      0|                            std::log1p(std::exp(-std::abs(v)));
  484|      0|      }
  485|      0|    }
  486|       |
  487|       |    // Expands new node ending at node->pos
  488|   474M|    for (size_t i = 0; i < end_nodes_size; i++) {
  ------------------
  |  Branch (488:24): [True: 266M, False: 208M]
  ------------------
  489|   266M|      Node* lnode = end_nodes(node->pos)[i];
  490|   266M|      auto* hyp = hypothesis_allocator.Allocate();
  491|   266M|      hyp->node = lnode;
  492|   266M|      if (sample) {
  ------------------
  |  Branch (492:11): [True: 0, False: 266M]
  ------------------
  493|      0|        hyp->gx = probs[i];
  494|      0|        hyp->fx = adjusted_probs[i];
  495|   266M|      } else {
  496|   266M|        hyp->gx = lnode->score + top->gx;  // just adds node->score
  497|   266M|        hyp->fx =
  498|   266M|            lnode->backtrace_score + top->gx;  // backtrace_score is h(node).
  499|   266M|      }
  500|   266M|      hyp->next = top;
  501|   266M|      agenda.push(hyp);
  502|   266M|    }
  503|       |
  504|   208M|    total_hypotheses += end_nodes_size;
  505|   208M|    if (total_hypotheses >= kMaxAllocatorSize ||
  ------------------
  |  Branch (505:9): [True: 181, False: 208M]
  ------------------
  506|   208M|        hypothesis_allocator.size() >= kMaxAllocatorSize) {
  ------------------
  |  Branch (506:9): [True: 0, False: 208M]
  ------------------
  507|    543|      LOG(WARNING) << "Allocator size exceeds " << kMaxAllocatorSize
  ------------------
  |  |  218|    181|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|    181|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|    181|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|    362|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|    362|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 181, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|    181|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 181]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|    181|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 181]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|    181|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|  1.08k|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|  1.08k|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  508|    543|                   << " with an example of length " << this->size()
  509|    543|                   << ". Falling back to Viterbi best path.";
  510|    181|      return {Viterbi()};
  511|    181|    }
  512|       |
  513|       |    // When the input is too long or contains duplicated phrases,
  514|       |    // `agenda` or `hypothesis_allocator` will get extremely big. Here we avoid
  515|       |    // this case by dynamically shrinking the agenda.
  516|   208M|    if (agenda.size() >= kMaxAgendaSize ||
  ------------------
  |  Branch (516:9): [True: 5.11k, False: 208M]
  ------------------
  517|   208M|        (agenda.size() > min_agenda_size &&
  ------------------
  |  Branch (517:10): [True: 174M, False: 33.3M]
  ------------------
  518|   174M|         hypothesis_allocator.size() >= max_hypothesis_size)) {
  ------------------
  |  Branch (518:10): [True: 561, False: 174M]
  ------------------
  519|  5.67k|      if (timeout_ms > 0) {
  ------------------
  |  Branch (519:11): [True: 5.67k, False: 0]
  ------------------
  520|  5.67k|        const auto elapsed =
  521|  5.67k|            absl::ToInt64Milliseconds(absl::Now() - start_time);
  522|  5.67k|        if (elapsed >= timeout_ms) {
  ------------------
  |  Branch (522:13): [True: 0, False: 5.67k]
  ------------------
  523|      0|          LOG(WARNING) << "NBest search timed out after " << elapsed << " ms. "
  ------------------
  |  |  218|      0|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|      0|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|      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()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|      0|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|      0|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  524|      0|                       << "Falling back to Viterbi best path.";
  525|      0|          return {Viterbi()};
  526|      0|        }
  527|  5.67k|      }
  528|  5.67k|      if (shrink_count >= kMaxShrinkCount) {
  ------------------
  |  Branch (528:11): [True: 105, False: 5.57k]
  ------------------
  529|    315|        LOG(WARNING) << "NBest search exceeded max shrink count "
  ------------------
  |  |  218|    105|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|    105|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|    105|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|    210|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|    210|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 105, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|    105|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 105]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|    105|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 105]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|    105|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|    420|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|    420|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  530|    315|                     << kMaxShrinkCount
  531|    315|                     << ". Falling back to Viterbi best path.";
  532|    105|        return {Viterbi()};
  533|    105|      }
  534|       |      // Keeps the top `min_agenda_size` hypotheses.
  535|  5.57k|      Agenda new_agenda;
  536|       |      // Keeps the top hypothesis and the ones on their "next" paths.
  537|  5.57k|      model::FreeList<Hypothesis> new_allocator(kPreallocatedHypothesisSize);
  538|       |      // Map between old Hypothesis* and new Hypothesis*.
  539|  5.57k|      absl::flat_hash_map<const Hypothesis*, Hypothesis*> clone_map;
  540|       |
  541|  5.57k|      const size_t size = std::min<size_t>(agenda.size(), min_agenda_size);
  542|  5.57k|      shrink_count++;
  543|  16.7k|      LOG(WARNING) << "Too big agenda size " << agenda.size()
  ------------------
  |  |  218|  5.57k|#define LOG(severity) ABSL_LOG_INTERNAL_LOG_IMPL(_##severity)
  |  |  ------------------
  |  |  |  |   27|  5.57k|  ABSL_LOG_INTERNAL_CONDITION##severity(STATELESS, true) \
  |  |  |  |  ------------------
  |  |  |  |  |  |  174|  5.57k|  ABSL_LOG_INTERNAL_##type##_CONDITION(condition)
  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   65|  11.1k|  switch (0)                                             \
  |  |  |  |  |  |  |  |   66|  11.1k|  case 0:                                                \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (66:3): [True: 5.57k, False: 0]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   67|  5.57k|  default:                                               \
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (67:3): [True: 0, False: 5.57k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |   68|  5.57k|    !(condition) ? (void)0 : ::absl::log_internal::Voidify() &&
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  |  |  |  Branch (68:5): [Folded, False: 5.57k]
  |  |  |  |  |  |  |  |  ------------------
  |  |  |  |  |  |  ------------------
  |  |  |  |  ------------------
  |  |  |  |   28|  5.57k|      ABSL_LOG_INTERNAL_LOG##severity.InternalStream()
  |  |  |  |  ------------------
  |  |  |  |  |  |   60|  55.7k|  ::absl::log_internal::LogMessage(   \
  |  |  |  |  |  |   61|  55.7k|      __FILE__, __LINE__, ::absl::log_internal::LogMessage::WarningTag{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  544|  16.7k|                   << " (allocator size " << hypothesis_allocator.size()
  545|  16.7k|                   << "). Shrinking (round " << shrink_count << ") down to "
  546|  16.7k|                   << size << ".";
  547|   162k|      for (size_t i = 0; i < size; ++i) {
  ------------------
  |  Branch (547:26): [True: 157k, False: 5.57k]
  ------------------
  548|   157k|        const Hypothesis* top_hyp = agenda.top();
  549|   157k|        Hypothesis* cloned_hyp =
  550|   157k|            CloneHypAndDependents(top_hyp, &clone_map, &new_allocator);
  551|   157k|        new_agenda.push(cloned_hyp);
  552|   157k|        agenda.pop();
  553|   157k|      }
  554|  5.57k|      agenda = std::move(new_agenda);
  555|  5.57k|      hypothesis_allocator = std::move(new_allocator);
  556|  5.57k|      max_hypothesis_size = hypothesis_allocator.size() + kMaxHypothesisSize;
  557|  5.57k|    }
  558|   208M|  }
  559|       |
  560|  5.09k|  return results;
  561|  5.38k|}
_ZN13sentencepiece7unigram7Lattice6SampleEf:
  563|  4.29k|std::vector<Lattice::Node*> Lattice::Sample(float inv_theta) {
  564|  4.29k|  const size_t len = size();
  565|  4.29k|  if (len == 0) return {};
  ------------------
  |  Branch (565:7): [True: 0, False: 4.29k]
  ------------------
  566|       |
  567|  4.29k|  const std::vector<float> alpha = ForwardAlgorithm(inv_theta);
  568|       |
  569|  4.29k|  auto* mt = random::GetRandomGenerator();
  570|       |
  571|  4.29k|  std::vector<Node*> results;
  572|  4.29k|  std::vector<float> probs;
  573|       |
  574|  4.29k|  float Z = alpha[eos_node()->node_id];
  575|  4.29k|  Node* node = eos_node();
  576|  42.5M|  while (true) {
  ------------------
  |  Branch (576:10): [True: 42.5M, Folded]
  ------------------
  577|  42.5M|    if (end_nodes_[node->pos].empty()) break;
  ------------------
  |  Branch (577:9): [True: 0, False: 42.5M]
  ------------------
  578|  42.5M|    probs.clear();
  579|  44.4M|    for (const Node* lnode : end_nodes_[node->pos]) {
  ------------------
  |  Branch (579:28): [True: 44.4M, False: 42.5M]
  ------------------
  580|  44.4M|      probs.push_back(std::exp(static_cast<double>(
  581|  44.4M|          alpha[lnode->node_id] + inv_theta * lnode->score - Z)));
  582|  44.4M|    }
  583|  42.5M|    log_domain::SanitizeDiscreteProbs(&probs);
  584|  42.5M|    std::discrete_distribution<int> dist(probs.begin(), probs.end());
  585|  42.5M|    node = end_nodes_[node->pos][dist(*mt)];
  586|  42.5M|    if (node == bos_node()) break;
  ------------------
  |  Branch (586:9): [True: 4.29k, False: 42.5M]
  ------------------
  587|       |
  588|  42.5M|    Z = alpha[node->node_id];
  589|  42.5M|    results.push_back(node);
  590|  42.5M|    if (results.size() > len) {
  ------------------
  |  Branch (590:9): [True: 0, False: 42.5M]
  ------------------
  591|      0|      LOG(ERROR) << "Detected cycle or infinite loop in Sample.";
  ------------------
  |  |  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{})
  |  |  |  |  ------------------
  |  |  ------------------
  ------------------
  592|      0|      break;
  593|      0|    }
  594|  42.5M|  }
  595|       |
  596|  4.29k|  std::reverse(results.begin(), results.end());
  597|  4.29k|  return results;
  598|  4.29k|}
_ZNK13sentencepiece7unigram5Model13PopulateNodesEPNS0_7LatticeE:
  600|  9.67k|void Model::PopulateNodes(Lattice* lattice) const {
  601|  9.67k|  auto get_chars_length = [&lattice](int begin_pos, const char* end) {
  602|  9.67k|    int pos = begin_pos;
  603|  9.67k|    while (lattice->surface(pos) < end) ++pos;
  604|  9.67k|    return pos - begin_pos;
  605|  9.67k|  };
  606|       |
  607|  9.67k|  const float unk_score = min_score() - kUnkPenalty;
  608|       |
  609|  9.67k|  const size_t len = lattice->size();
  610|  9.67k|  const char* end = lattice->sentence() + lattice->utf8_size();
  611|       |
  612|       |  // +1 just in case.
  613|  9.67k|  std::vector<Darts::DoubleArray::result_pair_type> trie_results(
  614|  9.67k|      trie_results_size_ + 1);
  615|       |
  616|  80.7M|  for (size_t begin_pos = 0; begin_pos < len; ++begin_pos) {
  ------------------
  |  Branch (616:30): [True: 80.7M, False: 9.67k]
  ------------------
  617|  80.7M|    const char* begin = lattice->surface(begin_pos);
  618|       |
  619|       |    // Finds all pieces which are prefix of surface(begin_pos).
  620|  80.7M|    size_t num_nodes = trie_->commonPrefixSearch(begin, trie_results.data(),
  621|  80.7M|                                                 trie_results.size(),
  622|  80.7M|                                                 static_cast<int>(end - begin));
  623|  80.7M|    if (num_nodes > trie_results.size()) {
  ------------------
  |  Branch (623:9): [True: 0, False: 80.7M]
  ------------------
  624|      0|      trie_results.resize(num_nodes + 1);
  625|      0|      num_nodes = trie_->commonPrefixSearch(begin, trie_results.data(),
  626|      0|                                            trie_results.size(),
  627|      0|                                            static_cast<int>(end - begin));
  628|      0|    }
  629|       |
  630|  80.7M|    bool has_single_node = false;
  631|       |
  632|       |    // Inserts pieces to the lattice.
  633|   103M|    for (size_t k = 0; k < num_nodes; ++k) {
  ------------------
  |  Branch (633:24): [True: 22.3M, False: 80.7M]
  ------------------
  634|  22.3M|      const int length =
  635|  22.3M|          get_chars_length(begin_pos, begin + trie_results[k].length);
  636|  22.3M|      const int id = trie_results[k].value;
  637|  22.3M|      if (IsUnusedInlined(id)) continue;
  ------------------
  |  Branch (637:11): [True: 0, False: 22.3M]
  ------------------
  638|  22.3M|      if (length <= 0) continue;
  ------------------
  |  Branch (638:11): [True: 0, False: 22.3M]
  ------------------
  639|  22.3M|      Lattice::Node* node = lattice->Insert(begin_pos, length);
  640|  22.3M|      if (!node) continue;
  ------------------
  |  Branch (640:11): [True: 0, False: 22.3M]
  ------------------
  641|  22.3M|      node->id = id;  // the value of Trie stores vocab_id.
  642|       |      // User defined symbol receives extra bonus to always be selected.
  643|  22.3M|      node->score = IsUserDefinedInlined(id) ? GetUserDefinedScore(length)
  ------------------
  |  Branch (643:21): [True: 0, False: 22.3M]
  ------------------
  644|  22.3M|                                             : GetScoreInlined(id);
  645|  22.3M|      if (!has_single_node && node->length == 1) {
  ------------------
  |  Branch (645:11): [True: 17.4M, False: 4.94M]
  |  Branch (645:31): [True: 17.4M, False: 0]
  ------------------
  646|  17.4M|        has_single_node = true;
  647|  17.4M|      }
  648|  22.3M|    }
  649|       |
  650|  80.7M|    if (!has_single_node) {
  ------------------
  |  Branch (650:9): [True: 63.2M, False: 17.4M]
  ------------------
  651|  63.2M|      Lattice::Node* node = lattice->Insert(begin_pos, 1);
  652|  63.2M|      if (node) {
  ------------------
  |  Branch (652:11): [True: 63.2M, False: 0]
  ------------------
  653|  63.2M|        node->id = unk_id_;  // add UNK node.
  654|  63.2M|        node->score = unk_score;
  655|  63.2M|      }
  656|  63.2M|    }
  657|  80.7M|  }
  658|  9.67k|}
_ZNK13sentencepiece7unigram5Model9PieceToIdENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  660|   245M|int Model::PieceToId(absl::string_view piece) const {
  661|   245M|  auto it = reserved_id_map_.find(piece);
  662|   245M|  if (it != reserved_id_map_.end()) {
  ------------------
  |  Branch (662:7): [True: 233M, False: 12.3M]
  ------------------
  663|   233M|    return it->second;
  664|   233M|  }
  665|       |  // An empty piece has no id and must resolve to <unk>. exactMatchSearch()
  666|       |  // treats length 0 as "key is a zero-terminated C string" and scans
  667|       |  // piece.data() forward until a NUL, so forwarding piece.size() == 0 reads
  668|       |  // past the (empty) view: for a view over non-terminated bytes it runs off
  669|       |  // the buffer, and for a zero-length view over live data it spuriously
  670|       |  // matches a following key.
  671|  12.3M|  if (piece.empty()) return unk_id_;
  ------------------
  |  Branch (671:7): [True: 0, False: 12.3M]
  ------------------
  672|  12.3M|  int id = 0;
  673|  12.3M|  trie_->exactMatchSearch(piece.data(), id, piece.size());
  674|  12.3M|  return id == -1 ? unk_id_ : id;
  ------------------
  |  Branch (674:10): [True: 13.2k, False: 12.3M]
  ------------------
  675|  12.3M|}
_ZN13sentencepiece7unigram5Model9BuildTrieEPNSt3__16vectorINS2_4pairINS2_17basic_string_viewIcNS2_11char_traitsIcEEEEiEENS2_9allocatorIS9_EEEE:
  677|      2|void Model::BuildTrie(std::vector<std::pair<absl::string_view, int>>* pieces) {
  678|      2|  if (!status().ok()) return;
  ------------------
  |  Branch (678:7): [True: 0, False: 2]
  ------------------
  679|       |
  680|      2|  if (pieces->empty()) {
  ------------------
  |  Branch (680:7): [True: 0, False: 2]
  ------------------
  681|      0|    status_ = absl::InternalError("no pieces are loaded.");
  682|      0|    return;
  683|      0|  }
  684|       |
  685|       |  // sort by sentencepiece since DoubleArray::build()
  686|       |  // only accepts sorted strings.
  687|      2|  sort(pieces->begin(), pieces->end());
  688|       |
  689|       |  // Makes key/value/length set for DoubleArrayTrie.
  690|      2|  std::vector<const char*> key(pieces->size());
  691|      2|  std::vector<size_t> length(pieces->size());
  692|      2|  std::vector<int> value(pieces->size());
  693|     80|  for (size_t i = 0; i < pieces->size(); ++i) {
  ------------------
  |  Branch (693:22): [True: 78, False: 2]
  ------------------
  694|     78|    key[i] = (*pieces)[i].first.data();  // sorted piece.
  695|     78|    length[i] = (*pieces)[i].first.size();
  696|     78|    value[i] = (*pieces)[i].second;  // vocab_id
  697|     78|  }
  698|       |
  699|      2|  trie_ = std::make_unique<Darts::DoubleArray>();
  700|      2|  if (trie_->build(key.size(), const_cast<char**>(&key[0]),
  ------------------
  |  Branch (700:7): [True: 0, False: 2]
  ------------------
  701|      2|                   const_cast<size_t*>(&length[0]), &value[0]) != 0) {
  702|      0|    status_ = absl::InternalError("cannot build double-array.");
  703|      0|    return;
  704|      0|  }
  705|       |
  706|       |  // Computes the maximum number of shared prefixes in the trie.
  707|      2|  const int kMaxTrieResultsSize = 1024;
  708|      2|  std::vector<Darts::DoubleArray::result_pair_type> results(
  709|      2|      kMaxTrieResultsSize);
  710|      2|  trie_results_size_ = 0;
  711|     78|  for (const auto& p : *pieces) {
  ------------------
  |  Branch (711:22): [True: 78, False: 2]
  ------------------
  712|     78|    const int num_nodes = trie_->commonPrefixSearch(
  713|     78|        p.first.data(), results.data(), results.size(), p.first.size());
  714|     78|    trie_results_size_ = std::max(trie_results_size_, num_nodes);
  715|     78|  }
  716|       |
  717|      2|  pieces_.clear();
  718|       |
  719|      2|  if (trie_results_size_ == 0)
  ------------------
  |  Branch (719:7): [True: 0, False: 2]
  ------------------
  720|      0|    status_ = absl::InternalError("no entry is found in the trie.");
  721|      2|}
_ZN13sentencepiece7unigram5ModelC2ERKNS_10ModelProtoE:
  723|      2|Model::Model(const ModelProto& model_proto) {
  724|      2|  model_proto_ = &model_proto;
  725|       |
  726|      2|  InitializePieces(/* use_reserved_id_map= */ true);
  727|       |
  728|      2|  min_score_ = FLT_MAX;
  729|    596|  for (const auto& sp : model_proto_->pieces()) {
  ------------------
  |  Branch (729:23): [True: 596, False: 2]
  ------------------
  730|    596|    if (std::isnan(sp.score()) || std::isinf(sp.score())) {
  ------------------
  |  Branch (730:9): [True: 0, False: 596]
  |  Branch (730:35): [True: 0, False: 596]
  ------------------
  731|      0|      status_ = absl::InternalError("score is NaN or Inf.");
  732|      0|      return;
  733|      0|    }
  734|    596|    if (sp.type() == ModelProto::SentencePiece::NORMAL) {
  ------------------
  |  Branch (734:9): [True: 78, False: 518]
  ------------------
  735|     78|      min_score_ = std::min(min_score_, sp.score());
  736|     78|    }
  737|    596|  }
  738|       |
  739|      2|  std::vector<std::pair<absl::string_view, int>> pieces;
  740|     78|  for (const auto& it : pieces_) pieces.emplace_back(it.first, it.second);
  ------------------
  |  Branch (740:23): [True: 78, False: 2]
  ------------------
  741|       |
  742|      2|  BuildTrie(&pieces);
  743|      2|}
_ZNK13sentencepiece7unigram5Model6EncodeENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  747|  4.72k|EncodeResult Model::Encode(absl::string_view normalized) const {
  748|  4.72k|  return EncodeOptimized(normalized);
  749|  4.72k|}
_ZNK13sentencepiece7unigram5Model11NBestEncodeENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEi:
  752|  5.44k|                                     int nbest_size) const {
  753|  5.44k|  if (!status().ok() || normalized.empty()) {
  ------------------
  |  Branch (753:7): [True: 0, False: 5.44k]
  |  Branch (753:7): [True: 67, False: 5.38k]
  |  Branch (753:25): [True: 67, False: 5.38k]
  ------------------
  754|     67|    return {{{}, 0.0}};
  755|     67|  }
  756|       |
  757|  5.38k|  nbest_size = std::max<int>(1, std::min<int>(nbest_size, 1024));
  758|       |
  759|  5.38k|  if (nbest_size <= 1) {
  ------------------
  |  Branch (759:7): [True: 0, False: 5.38k]
  ------------------
  760|      0|    return {std::pair<EncodeResult, float>(Encode(normalized), 0.0)};
  761|      0|  }
  762|       |
  763|  5.38k|  Lattice lattice;
  764|  5.38k|  lattice.SetSentence(normalized);
  765|  5.38k|  PopulateNodes(&lattice);
  766|       |
  767|  5.38k|  NBestEncodeResult nbest_results;
  768|  12.2k|  for (const auto& nbest : lattice.NBest(nbest_size, false, 0.0)) {
  ------------------
  |  Branch (768:26): [True: 12.2k, False: 5.38k]
  ------------------
  769|  12.2k|    EncodeResult results;
  770|  55.4M|    for (const auto* node : nbest.first) {
  ------------------
  |  Branch (770:27): [True: 55.4M, False: 12.2k]
  ------------------
  771|  55.4M|      results.emplace_back(node->piece, node->id);
  772|  55.4M|    }
  773|  12.2k|    nbest_results.emplace_back(results, nbest.second);
  774|  12.2k|  }
  775|       |
  776|  5.38k|  return nbest_results;
  777|  5.38k|}
_ZNK13sentencepiece7unigram5Model12SampleEncodeENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEEf:
  780|  4.35k|                                 float inv_theta) const {
  781|  4.35k|  if (!status().ok() || normalized.empty()) {
  ------------------
  |  Branch (781:7): [True: 0, False: 4.35k]
  |  Branch (781:7): [True: 56, False: 4.29k]
  |  Branch (781:25): [True: 56, False: 4.29k]
  ------------------
  782|     56|    return {};
  783|     56|  }
  784|       |
  785|  4.29k|  Lattice lattice;
  786|  4.29k|  lattice.SetSentence(normalized);
  787|  4.29k|  PopulateNodes(&lattice);
  788|       |
  789|  4.29k|  EncodeResult results;
  790|  42.5M|  for (const auto* node : lattice.Sample(inv_theta)) {
  ------------------
  |  Branch (790:25): [True: 42.5M, False: 4.29k]
  ------------------
  791|  42.5M|    results.emplace_back(node->piece, node->id);
  792|  42.5M|  }
  793|       |
  794|  4.29k|  return results;
  795|  4.35k|}
_ZNK13sentencepiece7unigram5Model15EncodeOptimizedENSt3__117basic_string_viewIcNS2_11char_traitsIcEEEE:
  797|  4.72k|EncodeResult Model::EncodeOptimized(absl::string_view normalized) const {
  798|       |  // An optimized Viterbi algorithm for unigram language models. Benchmarking
  799|       |  // results show that it generates almost identical outputs and achieves 2.1x
  800|       |  // speedup on average for 102 languages compared to the original
  801|       |  // implementation. It's based on the following three ideas:
  802|       |  //
  803|       |  // 1. Because it uses the *unigram* model:
  804|       |  //     best_score(x1, x2, …, xt) = best_score(x1, x2, …, x{t-1}) + score(xt)
  805|       |  // Deciding the best path (and score) can be decoupled into two isolated
  806|       |  // terms: (a) the best path ended before the last token `best_score(x1, x2, …,
  807|       |  // x{t-1})`, and (b) the last token and its `score(xt)`. The two terms are
  808|       |  // not related to each other at all.
  809|       |  //
  810|       |  // Therefore, we can compute once and store the *best_path ending at
  811|       |  // each character position*. In this way, when we know best_path_ends_at[M],
  812|       |  // we can reuse it to compute all the best_path_ends_at_[...] where the last
  813|       |  // token starts at the same character position M.
  814|       |  //
  815|       |  // This improves the time complexity from O(n*k*k) to O(n*k) because it
  816|       |  // eliminates the extra loop of recomputing the best path ending at the same
  817|       |  // position, where n is the input length and k is the maximum number of tokens
  818|       |  // that can be recognized starting at each position.
  819|       |  //
  820|       |  // 2. Again, because it uses the *unigram* model, we don’t need to actually
  821|       |  // store the lattice nodes. We still recognize all the tokens and lattice
  822|       |  // nodes from the input, but along identifying them, we use and discard them
  823|       |  // on the fly. There is no need to actually store them for best path Viterbi
  824|       |  // decoding. The only thing we need to store is the best_path ending at
  825|       |  // each character position.
  826|       |  //
  827|       |  // This improvement reduces the things needed to store in memory from O(n*k)
  828|       |  // to O(n), where n is the input length and k is the maximum number of tokens
  829|       |  // that can be recognized starting at each position.
  830|       |  //
  831|       |  // It also avoids the need of dynamic-size lattice node pool, because the
  832|       |  // number of things to store is fixed as n.
  833|       |  //
  834|       |  // 3. SentencePiece is designed to work with unicode, taking utf-8 encoding
  835|       |  // inputs. In the original implementation, the lattice positions are based on
  836|       |  // unicode positions. A mapping from unicode position to the utf-8 position is
  837|       |  // maintained to recover the utf-8 string piece.
  838|       |  //
  839|       |  // We found that it is sufficient and beneficial to directly work with utf-8
  840|       |  // positions:
  841|       |  //
  842|       |  // Firstly, it saves the conversion and mapping between unicode positions and
  843|       |  // utf-8 positions.
  844|       |  //
  845|       |  // Secondly, it reduces the number of fields we need to maintain in the
  846|       |  // node/path structure. Specifically, there are 8 fields defined in
  847|       |  // `Lattice::Node` used by the original encoder, but here in the optimized
  848|       |  // encoder we only need to define 3 fields in `BestPathNode`.
  849|       |
  850|  4.72k|  if (!status().ok() || normalized.empty()) {
  ------------------
  |  Branch (850:7): [True: 0, False: 4.72k]
  |  Branch (850:7): [True: 56, False: 4.67k]
  |  Branch (850:25): [True: 56, False: 4.67k]
  ------------------
  851|     56|    return {};
  852|     56|  }
  853|       |  // Represents the last node of the best path.
  854|  4.67k|  struct BestPathNode {
  855|  4.67k|    int id = -1;  // The vocab id. (maybe -1 for UNK)
  856|  4.67k|    float best_path_score =
  857|  4.67k|        0;  // The total score of the best path ending at this node.
  858|  4.67k|    int starts_at =
  859|  4.67k|        -1;  // The starting position (in utf-8) of this node. The entire best
  860|       |             // path can be constructed by backtracking along this link.
  861|  4.67k|  };
  862|  4.67k|  const size_t size = normalized.size();
  863|  4.67k|  const float unk_score = min_score() - kUnkPenalty;
  864|       |  // The ends are exclusive.
  865|  4.67k|  std::vector<BestPathNode> best_path_ends_at(size + 1);
  866|       |  // Generate lattice on-the-fly (not stored) and update best_path_ends_at.
  867|  4.67k|  size_t starts_at = 0;
  868|  4.67k|  const float kScoreResetThreshold = 100000.0f;
  869|  4.67k|  size_t max_frontier = 0;
  870|  93.5M|  while (starts_at < size) {
  ------------------
  |  Branch (870:10): [True: 93.5M, False: 4.67k]
  ------------------
  871|  93.5M|    std::size_t node_pos = 0;
  872|  93.5M|    std::size_t key_pos = starts_at;
  873|  93.5M|    float best_path_score_till_here =
  874|  93.5M|        best_path_ends_at[starts_at].best_path_score;
  875|  93.5M|    if (best_path_score_till_here < -kScoreResetThreshold ||
  ------------------
  |  Branch (875:9): [True: 9.48k, False: 93.5M]
  ------------------
  876|  93.5M|        best_path_score_till_here > kScoreResetThreshold) {
  ------------------
  |  Branch (876:9): [True: 0, False: 93.5M]
  ------------------
  877|  9.48k|      const float offset = best_path_score_till_here;
  878|  19.0k|      for (size_t i = starts_at; i <= max_frontier; ++i) {
  ------------------
  |  Branch (878:34): [True: 9.53k, False: 9.48k]
  ------------------
  879|  9.53k|        if (i == starts_at || best_path_ends_at[i].starts_at != -1) {
  ------------------
  |  Branch (879:13): [True: 9.48k, False: 54]
  |  Branch (879:31): [True: 48, False: 6]
  ------------------
  880|  9.53k|          best_path_ends_at[i].best_path_score -= offset;
  881|  9.53k|        }
  882|  9.53k|      }
  883|  9.48k|      best_path_score_till_here = 0.0f;
  884|  9.48k|    }
  885|  93.5M|    bool has_single_node = false;
  886|  93.5M|    const int mblen =
  887|  93.5M|        std::min<int>(string_util::OneCharLen(normalized.data() + starts_at),
  888|  93.5M|                      size - starts_at);
  889|   123M|    while (key_pos < size) {
  ------------------
  |  Branch (889:12): [True: 123M, False: 2.75k]
  ------------------
  890|   123M|      const int ret =
  891|   123M|          trie_->traverse(normalized.data(), node_pos, key_pos, key_pos + 1);
  892|   123M|      if (ret == -2) break;
  ------------------
  |  Branch (892:11): [True: 93.5M, False: 30.0M]
  ------------------
  893|  30.0M|      if (ret >= 0 && ret < GetPieceSize()) {
  ------------------
  |  Branch (893:11): [True: 25.3M, False: 4.68M]
  |  Branch (893:23): [True: 25.3M, False: 0]
  ------------------
  894|  25.3M|        if (IsUnusedInlined(ret)) continue;
  ------------------
  |  Branch (894:13): [True: 0, False: 25.3M]
  ------------------
  895|  25.3M|        max_frontier = std::max(max_frontier, key_pos);
  896|       |        // Update the best path node.
  897|  25.3M|        auto& target_node = best_path_ends_at[key_pos];
  898|  25.3M|        const auto length = (key_pos - starts_at);
  899|       |        // User defined symbol receives extra bonus to always be selected.
  900|  25.3M|        const auto score = IsUserDefinedInlined(ret)
  ------------------
  |  Branch (900:28): [True: 0, False: 25.3M]
  ------------------
  901|  25.3M|                               ? GetUserDefinedScore(length)
  902|  25.3M|                               : GetScoreInlined(ret);
  903|  25.3M|        const auto candidate_best_path_score =
  904|  25.3M|            score + best_path_score_till_here;
  905|  25.3M|        if (target_node.starts_at == -1 ||
  ------------------
  |  Branch (905:13): [True: 22.7M, False: 2.58M]
  ------------------
  906|  25.2M|            candidate_best_path_score > target_node.best_path_score) {
  ------------------
  |  Branch (906:13): [True: 2.55M, False: 22.7k]
  ------------------
  907|  25.2M|          target_node.best_path_score = candidate_best_path_score;
  908|  25.2M|          target_node.starts_at = starts_at;
  909|  25.2M|          target_node.id = ret;
  910|  25.2M|        }
  911|  25.3M|        if (!has_single_node && length == static_cast<size_t>(mblen)) {
  ------------------
  |  Branch (911:13): [True: 22.7M, False: 2.58M]
  |  Branch (911:33): [True: 22.7M, False: 0]
  ------------------
  912|  22.7M|          has_single_node = true;
  913|  22.7M|        }
  914|  25.3M|      }
  915|  30.0M|    }
  916|  93.5M|    if (!has_single_node) {
  ------------------
  |  Branch (916:9): [True: 70.7M, False: 22.7M]
  ------------------
  917|  70.7M|      max_frontier =
  918|  70.7M|          std::max(max_frontier, starts_at + static_cast<size_t>(mblen));
  919|  70.7M|      auto& target_node = best_path_ends_at[starts_at + mblen];
  920|  70.7M|      const auto candidate_best_path_score =
  921|  70.7M|          unk_score + best_path_score_till_here;
  922|  70.7M|      if (target_node.starts_at == -1 ||
  ------------------
  |  Branch (922:11): [True: 70.7M, False: 0]
  ------------------
  923|  70.7M|          candidate_best_path_score > target_node.best_path_score) {
  ------------------
  |  Branch (923:11): [True: 0, False: 0]
  ------------------
  924|  70.7M|        target_node.best_path_score = candidate_best_path_score;
  925|  70.7M|        target_node.starts_at = starts_at;
  926|  70.7M|        target_node.id = unk_id_;
  927|  70.7M|      }
  928|  70.7M|    }
  929|       |    // Move by one unicode character.
  930|  93.5M|    starts_at += mblen;
  931|  93.5M|  }
  932|       |  // Backtrack to identify the best path.
  933|  4.67k|  EncodeResult results;
  934|  4.67k|  results.reserve(size / 4 + 1);
  935|  4.67k|  int ends_at = size;
  936|  93.5M|  while (ends_at > 0) {
  ------------------
  |  Branch (936:10): [True: 93.5M, False: 4.67k]
  ------------------
  937|  93.5M|    const auto& node = best_path_ends_at[ends_at];
  938|  93.5M|    results.emplace_back(
  939|  93.5M|        normalized.substr(node.starts_at, ends_at - node.starts_at), node.id);
  940|  93.5M|    ends_at = node.starts_at;
  941|  93.5M|  }
  942|  4.67k|  std::reverse(results.begin(), results.end());
  943|  4.67k|  return results;
  944|  4.72k|}
unigram_model.cc:_ZN13sentencepiece7unigram12_GLOBAL__N_19LogSumExpEffb:
   52|  49.3M|inline float LogSumExp(float x, float y, bool init_mode) {
   53|  49.3M|  if (init_mode) {
  ------------------
  |  Branch (53:7): [True: 45.3M, False: 3.97M]
  ------------------
   54|  45.3M|    return y;
   55|  45.3M|  }
   56|  3.97M|  const float vmin = std::min(x, y);
   57|  3.97M|  const float vmax = std::max(x, y);
   58|  3.97M|  constexpr float kMinusLogEpsilon = 50;
   59|  3.97M|  if (vmax > vmin + kMinusLogEpsilon) {
  ------------------
  |  Branch (59:7): [True: 0, False: 3.97M]
  ------------------
   60|      0|    return vmax;
   61|  3.97M|  } else {
   62|  3.97M|    return vmax + std::log1p(std::exp(static_cast<double>(vmin - vmax)));
   63|  3.97M|  }
   64|  3.97M|}
unigram_model.cc:_ZN13sentencepiece7unigram12_GLOBAL__N_121CloneHypAndDependentsEPKNS1_10HypothesisEPN4absl12lts_2026081713flat_hash_mapIS4_PS2_NS6_18container_internal6HashEqIS4_vE4HashENSB_2EqENSt3__19allocatorINSE_4pairIKS4_S8_EEEEEEPNS_5model8FreeListIS2_EE:
  320|   157k|    model::FreeList<Hypothesis>* allocator) {
  321|   157k|  Hypothesis* cloned = nullptr;
  322|   157k|  Hypothesis** result_callback = &cloned;
  323|       |
  324|       |  // Iteratively clone "to_clone" and its dependencies.
  325|       |  // The new pointer will be written back to *result_callback.
  326|   204M|  while (to_clone != nullptr) {
  ------------------
  |  Branch (326:10): [True: 204M, False: 5.57k]
  ------------------
  327|       |    // If "to_clone" has already been cloned before, we just look up the result.
  328|   204M|    auto iter = clone_map->find(to_clone);
  329|   204M|    if (iter != clone_map->end()) {
  ------------------
  |  Branch (329:9): [True: 151k, False: 204M]
  ------------------
  330|   151k|      *result_callback = iter->second;
  331|   151k|      break;
  332|   151k|    }
  333|       |
  334|       |    // Allocate a new Hypothesis and copy the values.
  335|   204M|    Hypothesis* new_hyp = allocator->Allocate();
  336|   204M|    *new_hyp = *to_clone;
  337|   204M|    *result_callback = new_hyp;
  338|   204M|    clone_map->insert({to_clone, new_hyp});
  339|       |
  340|       |    // Move on to clone "to_clone->next".
  341|   204M|    to_clone = to_clone->next;
  342|   204M|    result_callback = &(new_hyp->next);
  343|   204M|  }
  344|   157k|  return cloned;
  345|   157k|}
unigram_model.cc:_ZZNK13sentencepiece7unigram5Model13PopulateNodesEPNS0_7LatticeEENK3$_0clEiPKc:
  601|  22.3M|  auto get_chars_length = [&lattice](int begin_pos, const char* end) {
  602|  22.3M|    int pos = begin_pos;
  603|  49.8M|    while (lattice->surface(pos) < end) ++pos;
  ------------------
  |  Branch (603:12): [True: 27.4M, False: 22.3M]
  ------------------
  604|  22.3M|    return pos - begin_pos;
  605|  22.3M|  };
unigram_model.cc:_ZZN13sentencepiece7unigram7Lattice5NBestEmbfEN20HypothesisComparatorclEPNS0_12_GLOBAL__N_110HypothesisES5_:
  381|  3.45G|    const bool operator()(Hypothesis* h1, Hypothesis* h2) {
  382|  3.45G|      return (h1->fx < h2->fx);
  383|  3.45G|    }

_ZNK13sentencepiece7unigram5Model23IsSampleEncodeAvailableEv:
  137|  4.35k|  bool IsSampleEncodeAvailable() const override { return true; }
_ZNK13sentencepiece7unigram5Model22IsNBestEncodeAvailableEv:
  139|  9.80k|  bool IsNBestEncodeAvailable() const override { return true; }
_ZNK13sentencepiece7unigram5Model9min_scoreEv:
  143|  14.3k|  float min_score() const { return min_score_; }

_ZN13sentencepiece22GetRandomGeneratorSeedEv:
   53|      1|uint32_t GetRandomGeneratorSeed() { return g_seed.load(); }
_ZN13sentencepiece15GetNBestTimeoutEv:
   79|  5.38k|int GetNBestTimeout() { return g_nbest_timeout_ms.load(); }
_ZN13sentencepiece11string_util10DecodeUTF8EPKcS2_Pm:
   84|   346M|char32_t DecodeUTF8(const char* begin, const char* end, size_t* mblen) {
   85|   346M|  const size_t len = end - begin;
   86|       |
   87|   346M|  if (static_cast<unsigned char>(begin[0]) < 0x80) {
  ------------------
  |  Branch (87:7): [True: 266M, False: 80.0M]
  ------------------
   88|   266M|    *mblen = 1;
   89|   266M|    return static_cast<unsigned char>(begin[0]);
   90|   266M|  } else if (len >= 2 && (begin[0] & 0xE0) == 0xC0) {
  ------------------
  |  Branch (90:14): [True: 80.0M, False: 7.73k]
  |  Branch (90:26): [True: 12.4M, False: 67.5M]
  ------------------
   91|  12.4M|    const char32_t cp = (((begin[0] & 0x1F) << 6) | ((begin[1] & 0x3F)));
   92|  12.4M|    if (IsTrailByte(begin[1]) && cp >= 0x0080 && IsValidCodepoint(cp)) {
  ------------------
  |  Branch (92:9): [True: 1.81M, False: 10.6M]
  |  Branch (92:34): [True: 1.74M, False: 70.8k]
  |  Branch (92:50): [True: 1.74M, False: 0]
  ------------------
   93|  1.74M|      *mblen = 2;
   94|  1.74M|      return cp;
   95|  1.74M|    }
   96|  67.5M|  } else if (len >= 3 && (begin[0] & 0xF0) == 0xE0) {
  ------------------
  |  Branch (96:14): [True: 67.5M, False: 13.5k]
  |  Branch (96:26): [True: 26.9M, False: 40.5M]
  ------------------
   97|  26.9M|    const char32_t cp = (((begin[0] & 0x0F) << 12) | ((begin[1] & 0x3F) << 6) |
   98|  26.9M|                         ((begin[2] & 0x3F)));
   99|  26.9M|    if (IsTrailByte(begin[1]) && IsTrailByte(begin[2]) && cp >= 0x0800 &&
  ------------------
  |  Branch (99:9): [True: 18.9M, False: 8.00M]
  |  Branch (99:34): [True: 18.6M, False: 332k]
  |  Branch (99:59): [True: 18.6M, False: 2.56k]
  ------------------
  100|  18.6M|        IsValidCodepoint(cp)) {
  ------------------
  |  Branch (100:9): [True: 18.6M, False: 4.66k]
  ------------------
  101|  18.6M|      *mblen = 3;
  102|  18.6M|      return cp;
  103|  18.6M|    }
  104|  40.5M|  } else if (len >= 4 && (begin[0] & 0xf8) == 0xF0) {
  ------------------
  |  Branch (104:14): [True: 40.5M, False: 19.5k]
  |  Branch (104:26): [True: 1.17M, False: 39.3M]
  ------------------
  105|  1.17M|    const char32_t cp = (((begin[0] & 0x07) << 18) | ((begin[1] & 0x3F) << 12) |
  106|  1.17M|                         ((begin[2] & 0x3F) << 6) | ((begin[3] & 0x3F)));
  107|  1.17M|    if (IsTrailByte(begin[1]) && IsTrailByte(begin[2]) &&
  ------------------
  |  Branch (107:9): [True: 311k, False: 866k]
  |  Branch (107:34): [True: 109k, False: 201k]
  ------------------
  108|   109k|        IsTrailByte(begin[3]) && cp >= 0x10000 && IsValidCodepoint(cp)) {
  ------------------
  |  Branch (108:9): [True: 61.8k, False: 47.6k]
  |  Branch (108:34): [True: 61.1k, False: 650]
  |  Branch (108:51): [True: 53.9k, False: 7.17k]
  ------------------
  109|  53.9k|      *mblen = 4;
  110|  53.9k|      return cp;
  111|  53.9k|    }
  112|  1.17M|  }
  113|       |
  114|       |  // Invalid UTF-8.
  115|  59.5M|  *mblen = 1;
  116|  59.5M|  return kUnicodeError;
  117|   346M|}
_ZN13sentencepiece6random18GetRandomGeneratorEv:
  220|  5.14k|absl::BitGen* GetRandomGenerator() {
  221|       |  // Thread-locals occupy stack space in every thread ever created by the
  222|       |  // program, even if that thread never uses the thread-local variable.
  223|  5.14k|  thread_local static auto mt =
  224|  5.14k|      GetRandomGeneratorSeed() == kDefaultSeed
  ------------------
  |  Branch (224:7): [True: 1, False: 5.14k]
  ------------------
  225|  5.14k|          ? std::make_unique<absl::BitGen>()
  226|  5.14k|          : std::make_unique<absl::BitGen>(
  227|  5.14k|                std::seed_seq{GetRandomGeneratorSeed()});
  228|  5.14k|  return mt.get();
  229|  5.14k|}
_ZN13sentencepiece10log_domain6LogSumERKNSt3__16vectorIdNS1_9allocatorIdEEEE:
  378|    848|double LogSum(const std::vector<double>& xs) {
  379|    848|  if (xs.empty()) {
  ------------------
  |  Branch (379:7): [True: 0, False: 848]
  ------------------
  380|      0|    return -1.0 * std::numeric_limits<double>::max();
  381|      0|  }
  382|    848|  double sum = xs.front();
  383|       |
  384|    848|  auto log_add = [](double xa, double xb) {
  385|    848|    if (xa > xb) {
  386|    848|      std::swap(xa, xb);
  387|    848|    }
  388|    848|    return xb + std::log1p(std::exp(xa - xb));
  389|    848|  };
  390|  3.03k|  for (size_t i = 1; i < xs.size(); ++i) {
  ------------------
  |  Branch (390:22): [True: 2.18k, False: 848]
  ------------------
  391|  2.18k|    sum = log_add(sum, xs[i]);
  392|  2.18k|  }
  393|    848|  return sum;
  394|    848|}
util.cc:_ZZN13sentencepiece10log_domain6LogSumERKNSt3__16vectorIdNS1_9allocatorIdEEEEENK3$_0clEdd:
  384|  2.18k|  auto log_add = [](double xa, double xb) {
  385|  2.18k|    if (xa > xb) {
  ------------------
  |  Branch (385:9): [True: 2.18k, False: 0]
  ------------------
  386|  2.18k|      std::swap(xa, xb);
  387|  2.18k|    }
  388|  2.18k|    return xb + std::log1p(std::exp(xa - xb));
  389|  2.18k|  };

_ZN13sentencepiece11string_util17IsValidDecodeUTF8ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPm:
  136|   346M|inline bool IsValidDecodeUTF8(absl::string_view input, size_t* mblen) {
  137|   346M|  const char32_t c = DecodeUTF8(input, mblen);
  138|   346M|  return c != kUnicodeError || *mblen == 3;
  ------------------
  |  Branch (138:10): [True: 268M, False: 78.0M]
  |  Branch (138:32): [True: 18.4M, False: 59.5M]
  ------------------
  139|   346M|}
_ZN13sentencepiece11string_util10DecodeUTF8ENSt3__117basic_string_viewIcNS1_11char_traitsIcEEEEPm:
  132|   346M|inline char32_t DecodeUTF8(absl::string_view input, size_t* mblen) {
  133|   346M|  return DecodeUTF8(input.data(), input.data() + input.size(), mblen);
  134|   346M|}
_ZN13sentencepiece10log_domain21SanitizeDiscreteProbsIdEEvPNSt3__16vectorIT_NS2_9allocatorIS4_EEEE:
  214|    848|inline void SanitizeDiscreteProbs(std::vector<T>* probs) {
  215|    848|  bool has_positive = false;
  216|  3.03k|  for (T& p : *probs) {
  ------------------
  |  Branch (216:13): [True: 3.03k, False: 848]
  ------------------
  217|  3.03k|    if (std::isfinite(p) && p > T{0}) {
  ------------------
  |  Branch (217:9): [True: 3.03k, False: 0]
  |  Branch (217:29): [True: 3.03k, False: 0]
  ------------------
  218|  3.03k|      has_positive = true;
  219|  3.03k|    } else {
  220|      0|      p = T{0};
  221|      0|    }
  222|  3.03k|  }
  223|    848|  if (!has_positive && !probs->empty()) {
  ------------------
  |  Branch (223:7): [True: 0, False: 848]
  |  Branch (223:24): [True: 0, False: 0]
  ------------------
  224|      0|    (*probs)[0] = T{1};
  225|      0|  }
  226|    848|}
_ZN13sentencepiece11string_util10OneCharLenEPKc:
   84|   460M|inline size_t OneCharLen(const char* src) {
   85|   460M|  return "\1\1\1\1\1\1\1\1\1\1\1\1\2\2\3\4"[(*src & 0xFF) >> 4];
   86|   460M|}
_ZN13sentencepiece11string_util11IsTrailByteEc:
  111|  60.0M|inline bool IsTrailByte(char x) { return static_cast<signed char>(x) < -0x40; }
_ZN13sentencepiece11string_util16IsValidCodepointEDi:
  122|  20.4M|inline bool IsValidCodepoint(char32_t c) {
  123|  20.4M|  return (static_cast<uint32_t>(c) < 0xD800) || (c >= 0xE000 && c <= 0x10FFFF);
  ------------------
  |  Branch (123:10): [True: 1.93M, False: 18.5M]
  |  Branch (123:50): [True: 18.5M, False: 4.66k]
  |  Branch (123:65): [True: 18.5M, False: 7.17k]
  ------------------
  124|  20.4M|}
_ZN13sentencepiece10log_domain21SanitizeDiscreteProbsIfEEvPNSt3__16vectorIT_NS2_9allocatorIS4_EEEE:
  214|  42.5M|inline void SanitizeDiscreteProbs(std::vector<T>* probs) {
  215|  42.5M|  bool has_positive = false;
  216|  44.4M|  for (T& p : *probs) {
  ------------------
  |  Branch (216:13): [True: 44.4M, False: 42.5M]
  ------------------
  217|  44.4M|    if (std::isfinite(p) && p > T{0}) {
  ------------------
  |  Branch (217:9): [True: 44.4M, False: 0]
  |  Branch (217:29): [True: 44.4M, False: 0]
  ------------------
  218|  44.4M|      has_positive = true;
  219|  44.4M|    } else {
  220|      0|      p = T{0};
  221|      0|    }
  222|  44.4M|  }
  223|  42.5M|  if (!has_positive && !probs->empty()) {
  ------------------
  |  Branch (223:7): [True: 0, False: 42.5M]
  |  Branch (223:24): [True: 0, False: 0]
  ------------------
  224|      0|    (*probs)[0] = T{1};
  225|      0|  }
  226|  42.5M|}

_ZN5Darts7Details15DoubleArrayUnitC2Ev:
   53|    512|  DoubleArrayUnit() : unit_() {}
_ZNK5Darts7Details15DoubleArrayUnit8has_leafEv:
   57|  72.5M|  bool has_leaf() const {
   58|  72.5M|    return ((unit_ >> 8) & 1) == 1;
   59|  72.5M|  }
_ZNK5Darts7Details15DoubleArrayUnit5valueEv:
   62|  60.0M|  value_type value() const {
   63|  60.0M|    return static_cast<value_type>(unit_ & ((1U << 31) - 1));
   64|  60.0M|  }
_ZNK5Darts7Details15DoubleArrayUnit5labelEv:
   69|   249M|  id_type label() const {
   70|   249M|    return unit_ & ((1U << 31) | 0xFF);
   71|   249M|  }
_ZNK5Darts7Details15DoubleArrayUnit6offsetEv:
   73|   286M|  id_type offset() const {
   74|   286M|    return (unit_ >> 10) << ((unit_ & (1U << 9)) >> 6);
   75|   286M|  }
_ZN5Darts7Details9BitVectorC2Ev:
  808|      2|  BitVector() : units_(), ranks_(), num_ones_(0), size_(0) {}
_ZN5Darts7Details9BitVectorD2Ev:
  809|      2|  ~BitVector() {
  810|      2|    clear();
  811|      2|  }
_ZNK5Darts7Details9BitVectorixEm:
  813|    240|  bool operator[](std::size_t id) const {
  814|    240|    return (units_[id / UNIT_SIZE] >> (id % UNIT_SIZE) & 1) == 1;
  815|    240|  }
_ZNK5Darts7Details9BitVector8num_onesEv:
  834|      4|  std::size_t num_ones() const {
  835|      4|    return num_ones_;
  836|      4|  }
_ZNK5Darts7Details9BitVector4sizeEv:
  837|    198|  std::size_t size() const {
  838|    198|    return size_;
  839|    198|  }
_ZN5Darts7Details9BitVector6appendEv:
  841|    198|  void append() {
  842|    198|    if ((size_ % UNIT_SIZE) == 0) {
  ------------------
  |  Branch (842:9): [True: 8, False: 190]
  ------------------
  843|      8|      units_.append(0);
  844|      8|    }
  845|    198|    ++size_;
  846|    198|  }
_ZN5Darts7Details9BitVector5clearEv:
  849|      6|  void clear() {
  850|      6|    units_.clear();
  851|      6|    ranks_.clear();
  852|      6|  }
_ZN5Darts7Details9BitVector9pop_countEj:
  866|      8|  static id_type pop_count(id_type unit) {
  867|      8|    unit = ((unit & 0xAAAAAAAA) >> 1) + (unit & 0x55555555);
  868|      8|    unit = ((unit & 0xCCCCCCCC) >> 2) + (unit & 0x33333333);
  869|      8|    unit = ((unit >> 4) + unit) & 0x0F0F0F0F;
  870|      8|    unit += unit >> 8;
  871|      8|    unit += unit >> 16;
  872|      8|    return unit & 0xFF;
  873|      8|  }
_ZN5Darts7Details8DawgNodeC2Ev:
  954|    198|  DawgNode() : child_(0), sibling_(0), label_('\0'),
  955|    198|    is_state_(false), has_sibling_(false) {}
_ZN5Darts7Details8DawgNode9set_childEj:
  957|    316|  void set_child(id_type child) {
  958|    316|    child_ = child;
  959|    316|  }
_ZN5Darts7Details8DawgNode11set_siblingEj:
  960|    196|  void set_sibling(id_type sibling) {
  961|    196|    sibling_ = sibling;
  962|    196|  }
_ZN5Darts7Details8DawgNode9set_valueEi:
  963|     78|  void set_value(value_type value) {
  964|     78|    child_ = value;
  965|     78|  }
_ZN5Darts7Details8DawgNode9set_labelEh:
  966|    198|  void set_label(uchar_type label) {
  967|    198|    label_ = label;
  968|    198|  }
_ZN5Darts7Details8DawgNode12set_is_stateEb:
  969|    120|  void set_is_state(bool is_state) {
  970|    120|    is_state_ = is_state;
  971|    120|  }
_ZN5Darts7Details8DawgNode15set_has_siblingEb:
  972|     76|  void set_has_sibling(bool has_sibling) {
  973|     76|    has_sibling_ = has_sibling;
  974|     76|  }
_ZNK5Darts7Details8DawgNode5childEv:
  976|    538|  id_type child() const {
  977|    538|    return child_;
  978|    538|  }
_ZNK5Darts7Details8DawgNode7siblingEv:
  979|    788|  id_type sibling() const {
  980|    788|    return sibling_;
  981|    788|  }
_ZNK5Darts7Details8DawgNode5labelEv:
  985|    538|  uchar_type label() const {
  986|    538|    return label_;
  987|    538|  }
_ZNK5Darts7Details8DawgNode4unitEv:
  995|    398|  id_type unit() const {
  996|    398|    if (label_ == '\0') {
  ------------------
  |  Branch (996:9): [True: 156, False: 242]
  ------------------
  997|    156|      return (child_ << 1) | (has_sibling_ ? 1 : 0);
  ------------------
  |  Branch (997:31): [True: 36, False: 120]
  ------------------
  998|    156|    }
  999|    242|    return (child_ << 2) | (is_state_ ? 2 : 0) | (has_sibling_ ? 1 : 0);
  ------------------
  |  Branch (999:29): [True: 88, False: 154]
  |  Branch (999:51): [True: 116, False: 126]
  ------------------
 1000|    398|  }
_ZN5Darts7Details8DawgUnitC2Ej:
 1018|    198|  explicit DawgUnit(id_type unit = 0) : unit_(unit) {}
_ZN5Darts7Details8DawgUnitC2ERKS1_:
 1019|    254|  DawgUnit(const DawgUnit &unit) : unit_(unit.unit_) {}
_ZN5Darts7Details8DawgUnitaSEj:
 1021|    198|  DawgUnit &operator=(id_type unit) {
 1022|    198|    unit_ = unit;
 1023|    198|    return *this;
 1024|    198|  }
_ZNK5Darts7Details8DawgUnit4unitEv:
 1026|      4|  id_type unit() const {
 1027|      4|    return unit_;
 1028|      4|  }
_ZNK5Darts7Details8DawgUnit5childEv:
 1030|    362|  id_type child() const {
 1031|    362|    return unit_ >> 2;
 1032|    362|  }
_ZNK5Darts7Details8DawgUnit11has_siblingEv:
 1033|    592|  bool has_sibling() const {
 1034|    592|    return (unit_ & 1) == 1;
 1035|    592|  }
_ZNK5Darts7Details8DawgUnit5valueEv:
 1036|     78|  value_type value() const {
 1037|     78|    return static_cast<value_type>(unit_ >> 1);
 1038|     78|  }
_ZN5Darts7Details11DawgBuilderC2Ev:
 1055|      2|  DawgBuilder() : nodes_(), units_(), labels_(), is_intersections_(),
 1056|      2|    table_(), node_stack_(), recycle_bin_(), num_states_(0) {}
_ZN5Darts7Details11DawgBuilderD2Ev:
 1057|      2|  ~DawgBuilder() {
 1058|      2|    clear();
 1059|      2|  }
_ZNK5Darts7Details11DawgBuilder4rootEv:
 1061|      4|  id_type root() const {
 1062|      4|    return 0;
 1063|      4|  }
_ZNK5Darts7Details11DawgBuilder5childEj:
 1065|    362|  id_type child(id_type id) const {
 1066|    362|    return units_[id].child();
 1067|    362|  }
_ZNK5Darts7Details11DawgBuilder7siblingEj:
 1068|    588|  id_type sibling(id_type id) const {
 1069|    588|    return units_[id].has_sibling() ? (id + 1) : 0;
  ------------------
  |  Branch (1069:12): [True: 228, False: 360]
  ------------------
 1070|    588|  }
_ZNK5Darts7Details11DawgBuilder5valueEj:
 1071|     78|  int value(id_type id) const {
 1072|     78|    return units_[id].value();
 1073|     78|  }
_ZNK5Darts7Details11DawgBuilder7is_leafEj:
 1075|    196|  bool is_leaf(id_type id) const {
 1076|    196|    return label(id) == '\0';
 1077|    196|  }
_ZNK5Darts7Details11DawgBuilder5labelEj:
 1078|    588|  uchar_type label(id_type id) const {
 1079|    588|    return labels_[id];
 1080|    588|  }
_ZNK5Darts7Details11DawgBuilder15is_intersectionEj:
 1082|    240|  bool is_intersection(id_type id) const {
 1083|    240|    return is_intersections_[id];
 1084|    240|  }
_ZNK5Darts7Details11DawgBuilder17num_intersectionsEv:
 1089|      4|  std::size_t num_intersections() const {
 1090|      4|    return is_intersections_.num_ones();
 1091|      4|  }
_ZNK5Darts7Details11DawgBuilder4sizeEv:
 1093|     16|  std::size_t size() const {
 1094|     16|    return units_.size();
 1095|     16|  }
_ZN5Darts7Details11DawgBuilder9free_nodeEj:
 1135|    196|  void free_node(id_type id) {
 1136|    196|    recycle_bin_.push(id);
 1137|    196|  }
_ZN5Darts7Details11DawgBuilder4hashEj:
 1139|    196|  static id_type hash(id_type key) {
 1140|    196|    key = ~key + (key << 15);  // key = (key << 15) - key - 1;
 1141|    196|    key = key ^ (key >> 12);
 1142|    196|    key = key + (key << 2);
 1143|    196|    key = key ^ (key >> 4);
 1144|    196|    key = key * 2057;  // key = (key + (key << 3)) + (key << 11);
 1145|    196|    key = key ^ (key >> 16);
 1146|    196|    return key;
 1147|    196|  }
_ZN5Darts7Details22DoubleArrayBuilderUnitC2Ev:
 1401|    512|  DoubleArrayBuilderUnit() : unit_(0) {}
_ZN5Darts7Details22DoubleArrayBuilderUnit12set_has_leafEb:
 1403|     78|  void set_has_leaf(bool has_leaf) {
 1404|     78|    if (has_leaf) {
  ------------------
  |  Branch (1404:9): [True: 78, False: 0]
  ------------------
 1405|     78|      unit_ |= 1U << 8;
 1406|     78|    } else {
 1407|      0|      unit_ &= ~(1U << 8);
 1408|      0|    }
 1409|     78|  }
_ZN5Darts7Details22DoubleArrayBuilderUnit9set_valueEi:
 1410|     78|  void set_value(value_type value) {
 1411|     78|    unit_ = value | (1U << 31);
 1412|     78|  }
_ZN5Darts7Details22DoubleArrayBuilderUnit9set_labelEh:
 1413|    434|  void set_label(uchar_type label) {
 1414|    434|    unit_ = (unit_ & ~0xFFU) | label;
 1415|    434|  }
_ZN5Darts7Details22DoubleArrayBuilderUnit10set_offsetEj:
 1416|    122|  void set_offset(id_type offset) {
 1417|    122|    if (offset >= 1U << 29) {
  ------------------
  |  Branch (1417:9): [True: 0, False: 122]
  ------------------
 1418|      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)
  ------------------
 1419|      0|    }
 1420|    122|    unit_ &= (1U << 31) | (1U << 8) | 0xFF;
 1421|    122|    if (offset < 1U << 21) {
  ------------------
  |  Branch (1421:9): [True: 122, False: 0]
  ------------------
 1422|    122|      unit_ |= (offset << 10);
 1423|    122|    } else {
 1424|      0|      unit_ |= (offset << 2) | (1U << 9);
 1425|      0|    }
 1426|    122|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnitC2Ev:
 1440|  8.19k|  DoubleArrayBuilderExtraUnit() : prev_(0), next_(0),
 1441|  8.19k|      is_fixed_(false), is_used_(false) {}
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit8set_prevEj:
 1443|  1.02k|  void set_prev(id_type prev) {
 1444|  1.02k|    prev_ = prev;
 1445|  1.02k|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit8set_nextEj:
 1446|  1.02k|  void set_next(id_type next) {
 1447|  1.02k|    next_ = next;
 1448|  1.02k|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit12set_is_fixedEb:
 1449|    512|  void set_is_fixed(bool is_fixed) {
 1450|    512|    is_fixed_ = is_fixed;
 1451|    512|  }
_ZN5Darts7Details27DoubleArrayBuilderExtraUnit11set_is_usedEb:
 1452|    122|  void set_is_used(bool is_used) {
 1453|    122|    is_used_ = is_used;
 1454|    122|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit4prevEv:
 1456|  1.02k|  id_type prev() const {
 1457|  1.02k|    return prev_;
 1458|  1.02k|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit4nextEv:
 1459|  1.57k|  id_type next() const {
 1460|  1.57k|    return next_;
 1461|  1.57k|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit8is_fixedEv:
 1462|    610|  bool is_fixed() const {
 1463|    610|    return is_fixed_;
 1464|    610|  }
_ZNK5Darts7Details27DoubleArrayBuilderExtraUnit7is_usedEv:
 1465|    264|  bool is_used() const {
 1466|    264|    return is_used_;
 1467|    264|  }
_ZN5Darts7Details18DoubleArrayBuilderC2EPFimmE:
 1485|      2|      : progress_func_(progress_func), units_(), extras_(), labels_(),
 1486|      2|        table_(), extras_head_(0) {}
_ZN5Darts7Details18DoubleArrayBuilderD2Ev:
 1487|      2|  ~DoubleArrayBuilder() {
 1488|      2|    clear();
 1489|      2|  }
_ZNK5Darts7Details18DoubleArrayBuilder10num_blocksEv:
 1519|      6|  std::size_t num_blocks() const {
 1520|      6|    return units_.size() / BLOCK_SIZE;
 1521|      6|  }
_ZNK5Darts7Details18DoubleArrayBuilder6extrasEj:
 1523|    498|  const extra_type &extras(id_type id) const {
 1524|    498|    return extras_[id % NUM_EXTRAS];
 1525|    498|  }
_ZN5Darts7Details18DoubleArrayBuilder6extrasEj:
 1526|  5.66k|  extra_type &extras(id_type id) {
 1527|  5.66k|    return extras_[id % NUM_EXTRAS];
 1528|  5.66k|  }
_ZN5Darts7Details9BitVector5buildEv:
  876|      2|inline void BitVector::build() {
  877|      2|  try {
  878|      2|    ranks_.reset(new id_type[units_.size()]);
  879|      2|  } catch (const std::bad_alloc &) {
  880|      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)
  ------------------
  881|      0|  }
  882|       |
  883|      2|  num_ones_ = 0;
  884|     10|  for (std::size_t i = 0; i < units_.size(); ++i) {
  ------------------
  |  Branch (884:27): [True: 8, False: 2]
  ------------------
  885|      8|    ranks_[i] = num_ones_;
  886|      8|    num_ones_ += pop_count(units_[i]);
  887|      8|  }
  888|      2|}
_ZN5Darts7Details11DawgBuilder4initEv:
 1150|      2|inline void DawgBuilder::init() {
 1151|      2|  table_.resize(INITIAL_TABLE_SIZE, 0);
 1152|       |
 1153|      2|  append_node();
 1154|      2|  append_unit();
 1155|       |
 1156|      2|  num_states_ = 1;
 1157|       |
 1158|      2|  nodes_[0].set_label(0xFF);
 1159|      2|  node_stack_.push(0);
 1160|      2|}
_ZN5Darts7Details11DawgBuilder6finishEv:
 1162|      2|inline void DawgBuilder::finish() {
 1163|      2|  flush(0);
 1164|       |
 1165|      2|  units_[0] = nodes_[0].unit();
 1166|      2|  labels_[0] = nodes_[0].label();
 1167|       |
 1168|      2|  nodes_.clear();
 1169|      2|  table_.clear();
 1170|      2|  node_stack_.clear();
 1171|      2|  recycle_bin_.clear();
 1172|       |
 1173|      2|  is_intersections_.build();
 1174|      2|}
_ZN5Darts7Details11DawgBuilder6insertEPKcmi:
 1177|     78|    value_type value) {
 1178|     78|  if (value < 0) {
  ------------------
  |  Branch (1178:7): [True: 0, False: 78]
  ------------------
 1179|      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)
  ------------------
 1180|     78|  } else if (length == 0) {
  ------------------
  |  Branch (1180:14): [True: 0, False: 78]
  ------------------
 1181|      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)
  ------------------
 1182|      0|  }
 1183|       |
 1184|     78|  id_type id = 0;
 1185|     78|  std::size_t key_pos = 0;
 1186|       |
 1187|    146|  for ( ; key_pos <= length; ++key_pos) {
  ------------------
  |  Branch (1187:11): [True: 146, False: 0]
  ------------------
 1188|    146|    id_type child_id = nodes_[id].child();
 1189|    146|    if (child_id == 0) {
  ------------------
  |  Branch (1189:9): [True: 2, False: 144]
  ------------------
 1190|      2|      break;
 1191|      2|    }
 1192|       |
 1193|    144|    uchar_type key_label = static_cast<uchar_type>(key[key_pos]);
 1194|    144|    if (key_pos < length && key_label == '\0') {
  ------------------
  |  Branch (1194:9): [True: 144, False: 0]
  |  Branch (1194:29): [True: 0, False: 144]
  ------------------
 1195|      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)
  ------------------
 1196|      0|    }
 1197|       |
 1198|    144|    uchar_type unit_label = nodes_[child_id].label();
 1199|    144|    if (key_label < unit_label) {
  ------------------
  |  Branch (1199:9): [True: 0, False: 144]
  ------------------
 1200|      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)
  ------------------
 1201|    144|    } else if (key_label > unit_label) {
  ------------------
  |  Branch (1201:16): [True: 76, False: 68]
  ------------------
 1202|     76|      nodes_[child_id].set_has_sibling(true);
 1203|     76|      flush(child_id);
 1204|     76|      break;
 1205|     76|    }
 1206|     68|    id = child_id;
 1207|     68|  }
 1208|       |
 1209|     78|  if (key_pos > length) {
  ------------------
  |  Branch (1209:7): [True: 0, False: 78]
  ------------------
 1210|      0|    return;
 1211|      0|  }
 1212|       |
 1213|    274|  for ( ; key_pos <= length; ++key_pos) {
  ------------------
  |  Branch (1213:11): [True: 196, False: 78]
  ------------------
 1214|    196|    uchar_type key_label = static_cast<uchar_type>(
 1215|    196|        (key_pos < length) ? key[key_pos] : '\0');
  ------------------
  |  Branch (1215:9): [True: 118, False: 78]
  ------------------
 1216|    196|    id_type child_id = append_node();
 1217|       |
 1218|    196|    if (nodes_[id].child() == 0) {
  ------------------
  |  Branch (1218:9): [True: 120, False: 76]
  ------------------
 1219|    120|      nodes_[child_id].set_is_state(true);
 1220|    120|    }
 1221|    196|    nodes_[child_id].set_sibling(nodes_[id].child());
 1222|    196|    nodes_[child_id].set_label(key_label);
 1223|    196|    nodes_[id].set_child(child_id);
 1224|    196|    node_stack_.push(child_id);
 1225|       |
 1226|    196|    id = child_id;
 1227|    196|  }
 1228|     78|  nodes_[id].set_value(value);
 1229|     78|}
_ZN5Darts7Details11DawgBuilder5clearEv:
 1231|      4|inline void DawgBuilder::clear() {
 1232|      4|  nodes_.clear();
 1233|      4|  units_.clear();
 1234|      4|  labels_.clear();
 1235|      4|  is_intersections_.clear();
 1236|      4|  table_.clear();
 1237|      4|  node_stack_.clear();
 1238|      4|  recycle_bin_.clear();
 1239|      4|  num_states_ = 0;
 1240|      4|}
_ZN5Darts7Details11DawgBuilder5flushEj:
 1242|     78|inline void DawgBuilder::flush(id_type id) {
 1243|    198|  while (node_stack_.top() != id) {
  ------------------
  |  Branch (1243:10): [True: 120, False: 78]
  ------------------
 1244|    120|    id_type node_id = node_stack_.top();
 1245|    120|    node_stack_.pop();
 1246|       |
 1247|    120|    if (num_states_ >= table_.size() - (table_.size() >> 2)) {
  ------------------
  |  Branch (1247:9): [True: 0, False: 120]
  ------------------
 1248|      0|      expand_table();
 1249|      0|    }
 1250|       |
 1251|    120|    id_type num_siblings = 0;
 1252|    316|    for (id_type i = node_id; i != 0; i = nodes_[i].sibling()) {
  ------------------
  |  Branch (1252:31): [True: 196, False: 120]
  ------------------
 1253|    196|      ++num_siblings;
 1254|    196|    }
 1255|       |
 1256|    120|    id_type hash_id;
 1257|    120|    id_type match_id = find_node(node_id, &hash_id);
 1258|    120|    if (match_id != 0) {
  ------------------
  |  Branch (1258:9): [True: 0, False: 120]
  ------------------
 1259|      0|      is_intersections_.set(match_id, true);
 1260|    120|    } else {
 1261|    120|      id_type unit_id = 0;
 1262|    316|      for (id_type i = 0; i < num_siblings; ++i) {
  ------------------
  |  Branch (1262:27): [True: 196, False: 120]
  ------------------
 1263|    196|        unit_id = append_unit();
 1264|    196|      }
 1265|    316|      for (id_type i = node_id; i != 0; i = nodes_[i].sibling()) {
  ------------------
  |  Branch (1265:33): [True: 196, False: 120]
  ------------------
 1266|    196|        units_[unit_id] = nodes_[i].unit();
 1267|    196|        labels_[unit_id] = nodes_[i].label();
 1268|    196|        --unit_id;
 1269|    196|      }
 1270|    120|      match_id = unit_id + 1;
 1271|    120|      table_[hash_id] = match_id;
 1272|    120|      ++num_states_;
 1273|    120|    }
 1274|       |
 1275|    316|    for (id_type i = node_id, next; i != 0; i = next) {
  ------------------
  |  Branch (1275:37): [True: 196, False: 120]
  ------------------
 1276|    196|      next = nodes_[i].sibling();
 1277|    196|      free_node(i);
 1278|    196|    }
 1279|       |
 1280|    120|    nodes_[node_stack_.top()].set_child(match_id);
 1281|    120|  }
 1282|     78|  node_stack_.pop();
 1283|     78|}
_ZNK5Darts7Details11DawgBuilder9find_nodeEjPj:
 1314|    120|    id_type *hash_id) const {
 1315|    120|  *hash_id = hash_node(node_id) % table_.size();
 1316|    124|  for ( ; ; *hash_id = (*hash_id + 1) % table_.size()) {
 1317|    124|    id_type unit_id = table_[*hash_id];
 1318|    124|    if (unit_id == 0) {
  ------------------
  |  Branch (1318:9): [True: 120, False: 4]
  ------------------
 1319|    120|      break;
 1320|    120|    }
 1321|       |
 1322|      4|    if (are_equal(node_id, unit_id)) {
  ------------------
  |  Branch (1322:9): [True: 0, False: 4]
  ------------------
 1323|      0|      return unit_id;
 1324|      0|    }
 1325|      4|  }
 1326|    120|  return 0;
 1327|    120|}
_ZNK5Darts7Details11DawgBuilder9are_equalEjj:
 1329|      4|inline bool DawgBuilder::are_equal(id_type node_id, id_type unit_id) const {
 1330|      4|  for (id_type i = nodes_[node_id].sibling(); i != 0;
  ------------------
  |  Branch (1330:47): [True: 0, False: 4]
  ------------------
 1331|      4|      i = nodes_[i].sibling()) {
 1332|      0|    if (units_[unit_id].has_sibling() == false) {
  ------------------
  |  Branch (1332:9): [True: 0, False: 0]
  ------------------
 1333|      0|      return false;
 1334|      0|    }
 1335|      0|    ++unit_id;
 1336|      0|  }
 1337|      4|  if (units_[unit_id].has_sibling() == true) {
  ------------------
  |  Branch (1337:7): [True: 0, False: 4]
  ------------------
 1338|      0|    return false;
 1339|      0|  }
 1340|       |
 1341|      4|  for (id_type i = node_id; i != 0; i = nodes_[i].sibling(), --unit_id) {
  ------------------
  |  Branch (1341:29): [True: 4, False: 0]
  ------------------
 1342|      4|    if (nodes_[i].unit() != units_[unit_id].unit() ||
  ------------------
  |  Branch (1342:9): [True: 4, False: 0]
  ------------------
 1343|      4|        nodes_[i].label() != labels_[unit_id]) {
  ------------------
  |  Branch (1343:9): [True: 0, False: 0]
  ------------------
 1344|      4|      return false;
 1345|      4|    }
 1346|      4|  }
 1347|      0|  return true;
 1348|      4|}
_ZNK5Darts7Details11DawgBuilder9hash_nodeEj:
 1364|    120|inline id_type DawgBuilder::hash_node(id_type id) const {
 1365|    120|  id_type hash_value = 0;
 1366|    316|  for ( ; id != 0; id = nodes_[id].sibling()) {
  ------------------
  |  Branch (1366:11): [True: 196, False: 120]
  ------------------
 1367|    196|    id_type unit = nodes_[id].unit();
 1368|    196|    uchar_type label = nodes_[id].label();
 1369|    196|    hash_value ^= hash((label << 24) ^ unit);
 1370|    196|  }
 1371|    120|  return hash_value;
 1372|    120|}
_ZN5Darts7Details11DawgBuilder11append_unitEv:
 1374|    198|inline id_type DawgBuilder::append_unit() {
 1375|    198|  is_intersections_.append();
 1376|    198|  units_.append();
 1377|    198|  labels_.append();
 1378|       |
 1379|    198|  return static_cast<id_type>(is_intersections_.size() - 1);
 1380|    198|}
_ZN5Darts7Details11DawgBuilder11append_nodeEv:
 1382|    198|inline id_type DawgBuilder::append_node() {
 1383|    198|  id_type id;
 1384|    198|  if (recycle_bin_.empty()) {
  ------------------
  |  Branch (1384:7): [True: 72, False: 126]
  ------------------
 1385|     72|    id = static_cast<id_type>(nodes_.size());
 1386|     72|    nodes_.append();
 1387|    126|  } else {
 1388|    126|    id = recycle_bin_.top();
 1389|    126|    nodes_[id] = DawgNode();
 1390|    126|    recycle_bin_.pop();
 1391|    126|  }
 1392|    198|  return id;
 1393|    198|}
_ZNK5Darts7Details18DoubleArrayBuilder4copyEPmPPNS0_15DoubleArrayUnitE:
 1570|      2|    DoubleArrayUnit **buf_ptr) const {
 1571|      2|  if (size_ptr != NULL) {
  ------------------
  |  Branch (1571:7): [True: 2, False: 0]
  ------------------
 1572|      2|    *size_ptr = units_.size();
 1573|      2|  }
 1574|      2|  if (buf_ptr != NULL) {
  ------------------
  |  Branch (1574:7): [True: 2, False: 0]
  ------------------
 1575|      2|    *buf_ptr = new DoubleArrayUnit[units_.size()];
 1576|      2|    unit_type *units = reinterpret_cast<unit_type *>(*buf_ptr);
 1577|    514|    for (std::size_t i = 0; i < units_.size(); ++i) {
  ------------------
  |  Branch (1577:29): [True: 512, False: 2]
  ------------------
 1578|    512|      units[i] = units_[i];
 1579|    512|    }
 1580|      2|  }
 1581|      2|}
_ZN5Darts7Details18DoubleArrayBuilder5clearEv:
 1583|      2|inline void DoubleArrayBuilder::clear() {
 1584|      2|  units_.clear();
 1585|      2|  extras_.clear();
 1586|      2|  labels_.clear();
 1587|      2|  table_.clear();
 1588|      2|  extras_head_ = 0;
 1589|      2|}
_ZN5Darts7Details18DoubleArrayBuilder15build_from_dawgERKNS0_11DawgBuilderE:
 1604|      2|inline void DoubleArrayBuilder::build_from_dawg(const DawgBuilder &dawg) {
 1605|      2|  std::size_t num_units = 1;
 1606|     16|  while (num_units < dawg.size()) {
  ------------------
  |  Branch (1606:10): [True: 14, False: 2]
  ------------------
 1607|     14|    num_units <<= 1;
 1608|     14|  }
 1609|      2|  units_.reserve(num_units);
 1610|       |
 1611|      2|  table_.reset(new id_type[dawg.num_intersections()]);
 1612|      2|  for (std::size_t i = 0; i < dawg.num_intersections(); ++i) {
  ------------------
  |  Branch (1612:27): [True: 0, False: 2]
  ------------------
 1613|      0|    table_[i] = 0;
 1614|      0|  }
 1615|       |
 1616|      2|  extras_.reset(new extra_type[NUM_EXTRAS]);
 1617|       |
 1618|      2|  reserve_id(0);
 1619|      2|  extras(0).set_is_used(true);
 1620|      2|  units_[0].set_offset(1);
 1621|      2|  units_[0].set_label('\0');
 1622|       |
 1623|      2|  if (dawg.child(dawg.root()) != 0) {
  ------------------
  |  Branch (1623:7): [True: 2, False: 0]
  ------------------
 1624|      2|    build_from_dawg(dawg, dawg.root(), 0);
 1625|      2|  }
 1626|       |
 1627|      2|  fix_all_blocks();
 1628|       |
 1629|      2|  extras_.clear();
 1630|      2|  labels_.clear();
 1631|      2|  table_.clear();
 1632|      2|}
_ZN5Darts7Details18DoubleArrayBuilder15build_from_dawgERKNS0_11DawgBuilderEjj:
 1635|    120|    id_type dawg_id, id_type dic_id) {
 1636|    120|  id_type dawg_child_id = dawg.child(dawg_id);
 1637|    120|  if (dawg.is_intersection(dawg_child_id)) {
  ------------------
  |  Branch (1637:7): [True: 0, False: 120]
  ------------------
 1638|      0|    id_type intersection_id = dawg.intersection_id(dawg_child_id);
 1639|      0|    id_type offset = table_[intersection_id];
 1640|      0|    if (offset != 0) {
  ------------------
  |  Branch (1640:9): [True: 0, False: 0]
  ------------------
 1641|      0|      offset ^= dic_id;
 1642|      0|      if (!(offset & UPPER_MASK) || !(offset & LOWER_MASK)) {
  ------------------
  |  Branch (1642:11): [True: 0, False: 0]
  |  Branch (1642:37): [True: 0, False: 0]
  ------------------
 1643|      0|        if (dawg.is_leaf(dawg_child_id)) {
  ------------------
  |  Branch (1643:13): [True: 0, False: 0]
  ------------------
 1644|      0|          units_[dic_id].set_has_leaf(true);
 1645|      0|        }
 1646|      0|        units_[dic_id].set_offset(offset);
 1647|      0|        return;
 1648|      0|      }
 1649|      0|    }
 1650|      0|  }
 1651|       |
 1652|    120|  id_type offset = arrange_from_dawg(dawg, dawg_id, dic_id);
 1653|    120|  if (dawg.is_intersection(dawg_child_id)) {
  ------------------
  |  Branch (1653:7): [True: 0, False: 120]
  ------------------
 1654|      0|    table_[dawg.intersection_id(dawg_child_id)] = offset;
 1655|      0|  }
 1656|       |
 1657|    196|  do {
 1658|    196|    uchar_type child_label = dawg.label(dawg_child_id);
 1659|    196|    id_type dic_child_id = offset ^ child_label;
 1660|    196|    if (child_label != '\0') {
  ------------------
  |  Branch (1660:9): [True: 118, False: 78]
  ------------------
 1661|    118|      build_from_dawg(dawg, dawg_child_id, dic_child_id);
 1662|    118|    }
 1663|    196|    dawg_child_id = dawg.sibling(dawg_child_id);
 1664|    196|  } while (dawg_child_id != 0);
  ------------------
  |  Branch (1664:12): [True: 76, False: 120]
  ------------------
 1665|    120|}
_ZN5Darts7Details18DoubleArrayBuilder17arrange_from_dawgERKNS0_11DawgBuilderEjj:
 1668|    120|    id_type dawg_id, id_type dic_id) {
 1669|    120|  labels_.resize(0);
 1670|       |
 1671|    120|  id_type dawg_child_id = dawg.child(dawg_id);
 1672|    316|  while (dawg_child_id != 0) {
  ------------------
  |  Branch (1672:10): [True: 196, False: 120]
  ------------------
 1673|    196|    labels_.append(dawg.label(dawg_child_id));
 1674|    196|    dawg_child_id = dawg.sibling(dawg_child_id);
 1675|    196|  }
 1676|       |
 1677|    120|  id_type offset = find_valid_offset(dic_id);
 1678|    120|  units_[dic_id].set_offset(dic_id ^ offset);
 1679|       |
 1680|    120|  dawg_child_id = dawg.child(dawg_id);
 1681|    316|  for (std::size_t i = 0; i < labels_.size(); ++i) {
  ------------------
  |  Branch (1681:27): [True: 196, False: 120]
  ------------------
 1682|    196|    id_type dic_child_id = offset ^ labels_[i];
 1683|    196|    reserve_id(dic_child_id);
 1684|       |
 1685|    196|    if (dawg.is_leaf(dawg_child_id)) {
  ------------------
  |  Branch (1685:9): [True: 78, False: 118]
  ------------------
 1686|     78|      units_[dic_id].set_has_leaf(true);
 1687|     78|      units_[dic_child_id].set_value(dawg.value(dawg_child_id));
 1688|    118|    } else {
 1689|    118|      units_[dic_child_id].set_label(labels_[i]);
 1690|    118|    }
 1691|       |
 1692|    196|    dawg_child_id = dawg.sibling(dawg_child_id);
 1693|    196|  }
 1694|    120|  extras(offset).set_is_used(true);
 1695|       |
 1696|    120|  return offset;
 1697|    120|}
_ZNK5Darts7Details18DoubleArrayBuilder17find_valid_offsetEj:
 1805|    120|inline id_type DoubleArrayBuilder::find_valid_offset(id_type id) const {
 1806|    120|  if (extras_head_ >= units_.size()) {
  ------------------
  |  Branch (1806:7): [True: 0, False: 120]
  ------------------
 1807|      0|    return units_.size() | (id & LOWER_MASK);
 1808|      0|  }
 1809|       |
 1810|    120|  id_type unfixed_id = extras_head_;
 1811|    260|  do {
 1812|    260|    id_type offset = unfixed_id ^ labels_[0];
 1813|    260|    if (is_valid_offset(id, offset)) {
  ------------------
  |  Branch (1813:9): [True: 120, False: 140]
  ------------------
 1814|    120|      return offset;
 1815|    120|    }
 1816|    140|    unfixed_id = extras(unfixed_id).next();
 1817|    140|  } while (unfixed_id != extras_head_);
  ------------------
  |  Branch (1817:12): [True: 140, False: 0]
  ------------------
 1818|       |
 1819|      0|  return units_.size() | (id & LOWER_MASK);
 1820|    120|}
_ZNK5Darts7Details18DoubleArrayBuilder15is_valid_offsetEjj:
 1823|    260|    id_type offset) const {
 1824|    260|  if (extras(offset).is_used()) {
  ------------------
  |  Branch (1824:7): [True: 128, False: 132]
  ------------------
 1825|    128|    return false;
 1826|    128|  }
 1827|       |
 1828|    132|  id_type rel_offset = id ^ offset;
 1829|    132|  if ((rel_offset & LOWER_MASK) && (rel_offset & UPPER_MASK)) {
  ------------------
  |  Branch (1829:7): [True: 132, False: 0]
  |  Branch (1829:36): [True: 0, False: 132]
  ------------------
 1830|      0|    return false;
 1831|      0|  }
 1832|       |
 1833|    218|  for (std::size_t i = 1; i < labels_.size(); ++i) {
  ------------------
  |  Branch (1833:27): [True: 98, False: 120]
  ------------------
 1834|     98|    if (extras(offset ^ labels_[i]).is_fixed()) {
  ------------------
  |  Branch (1834:9): [True: 12, False: 86]
  ------------------
 1835|     12|      return false;
 1836|     12|    }
 1837|     98|  }
 1838|       |
 1839|    120|  return true;
 1840|    132|}
_ZN5Darts7Details18DoubleArrayBuilder10reserve_idEj:
 1842|    512|inline void DoubleArrayBuilder::reserve_id(id_type id) {
 1843|    512|  if (id >= units_.size()) {
  ------------------
  |  Branch (1843:7): [True: 2, False: 510]
  ------------------
 1844|      2|    expand_units();
 1845|      2|  }
 1846|       |
 1847|    512|  if (id == extras_head_) {
  ------------------
  |  Branch (1847:7): [True: 410, False: 102]
  ------------------
 1848|    410|    extras_head_ = extras(id).next();
 1849|    410|    if (extras_head_ == id) {
  ------------------
  |  Branch (1849:9): [True: 2, False: 408]
  ------------------
 1850|      2|      extras_head_ = units_.size();
 1851|      2|    }
 1852|    410|  }
 1853|    512|  extras(extras(id).prev()).set_next(extras(id).next());
 1854|    512|  extras(extras(id).next()).set_prev(extras(id).prev());
 1855|    512|  extras(id).set_is_fixed(true);
 1856|    512|}
_ZN5Darts7Details18DoubleArrayBuilder12expand_unitsEv:
 1858|      2|inline void DoubleArrayBuilder::expand_units() {
 1859|      2|  id_type src_num_units = units_.size();
 1860|      2|  id_type src_num_blocks = num_blocks();
 1861|       |
 1862|      2|  id_type dest_num_units = src_num_units + BLOCK_SIZE;
 1863|      2|  id_type dest_num_blocks = src_num_blocks + 1;
 1864|       |
 1865|      2|  if (dest_num_blocks > NUM_EXTRA_BLOCKS) {
  ------------------
  |  Branch (1865:7): [True: 0, False: 2]
  ------------------
 1866|      0|    fix_block(src_num_blocks - NUM_EXTRA_BLOCKS);
 1867|      0|  }
 1868|       |
 1869|      2|  units_.resize(dest_num_units);
 1870|       |
 1871|      2|  if (dest_num_blocks > NUM_EXTRA_BLOCKS) {
  ------------------
  |  Branch (1871:7): [True: 0, False: 2]
  ------------------
 1872|      0|    for (std::size_t id = src_num_units; id < dest_num_units; ++id) {
  ------------------
  |  Branch (1872:42): [True: 0, False: 0]
  ------------------
 1873|      0|      extras(id).set_is_used(false);
 1874|      0|      extras(id).set_is_fixed(false);
 1875|      0|    }
 1876|      0|  }
 1877|       |
 1878|    512|  for (id_type i = src_num_units + 1; i < dest_num_units; ++i) {
  ------------------
  |  Branch (1878:39): [True: 510, False: 2]
  ------------------
 1879|    510|    extras(i - 1).set_next(i);
 1880|    510|    extras(i).set_prev(i - 1);
 1881|    510|  }
 1882|       |
 1883|      2|  extras(src_num_units).set_prev(dest_num_units - 1);
 1884|      2|  extras(dest_num_units - 1).set_next(src_num_units);
 1885|       |
 1886|      2|  extras(src_num_units).set_prev(extras(extras_head_).prev());
 1887|      2|  extras(dest_num_units - 1).set_next(extras_head_);
 1888|       |
 1889|      2|  extras(extras(extras_head_).prev()).set_next(src_num_units);
 1890|      2|  extras(extras_head_).set_prev(dest_num_units - 1);
 1891|      2|}
_ZN5Darts7Details18DoubleArrayBuilder14fix_all_blocksEv:
 1893|      2|inline void DoubleArrayBuilder::fix_all_blocks() {
 1894|      2|  id_type begin = 0;
 1895|      2|  if (num_blocks() > NUM_EXTRA_BLOCKS) {
  ------------------
  |  Branch (1895:7): [True: 0, False: 2]
  ------------------
 1896|      0|    begin = num_blocks() - NUM_EXTRA_BLOCKS;
 1897|      0|  }
 1898|      2|  id_type end = num_blocks();
 1899|       |
 1900|      4|  for (id_type block_id = begin; block_id != end; ++block_id) {
  ------------------
  |  Branch (1900:34): [True: 2, False: 2]
  ------------------
 1901|      2|    fix_block(block_id);
 1902|      2|  }
 1903|      2|}
_ZN5Darts7Details18DoubleArrayBuilder9fix_blockEj:
 1905|      2|inline void DoubleArrayBuilder::fix_block(id_type block_id) {
 1906|      2|  id_type begin = block_id * BLOCK_SIZE;
 1907|      2|  id_type end = begin + BLOCK_SIZE;
 1908|       |
 1909|      2|  id_type unused_offset = 0;
 1910|      4|  for (id_type offset = begin; offset != end; ++offset) {
  ------------------
  |  Branch (1910:32): [True: 4, False: 0]
  ------------------
 1911|      4|    if (!extras(offset).is_used()) {
  ------------------
  |  Branch (1911:9): [True: 2, False: 2]
  ------------------
 1912|      2|      unused_offset = offset;
 1913|      2|      break;
 1914|      2|    }
 1915|      4|  }
 1916|       |
 1917|    514|  for (id_type id = begin; id != end; ++id) {
  ------------------
  |  Branch (1917:28): [True: 512, False: 2]
  ------------------
 1918|    512|    if (!extras(id).is_fixed()) {
  ------------------
  |  Branch (1918:9): [True: 314, False: 198]
  ------------------
 1919|    314|      reserve_id(id);
 1920|    314|      units_[id].set_label(static_cast<uchar_type>(id ^ unused_offset));
 1921|    314|    }
 1922|    512|  }
 1923|      2|}
_ZN5Darts7Details9AutoArrayIcE5clearEv:
  612|    272|  void clear() {
  613|    272|    if (array_ != NULL) {
  ------------------
  |  Branch (613:9): [True: 94, False: 178]
  ------------------
  614|     94|      delete[] array_;
  615|       |      array_ = NULL;
  616|     94|    }
  617|    272|  }
_ZNK5Darts7Details8AutoPoolIjEixEm:
  645|    364|  const T &operator[](std::size_t id) const {
  646|    364|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  647|    364|  }
_ZNK5Darts7Details9AutoArrayIcEixEm:
  601|  3.45k|  const T &operator[](std::size_t id) const {
  602|  3.45k|    return array_[id];
  603|  3.45k|  }
_ZN5Darts7Details8AutoPoolIjEixEm:
  648|  5.59k|  T &operator[](std::size_t id) {
  649|  5.59k|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  650|  5.59k|  }
_ZN5Darts7Details9AutoArrayIcEixEm:
  604|  12.2k|  T &operator[](std::size_t id) {
  605|  12.2k|    return array_[id];
  606|  12.2k|  }
_ZNK5Darts7Details8AutoPoolIjE5emptyEv:
  652|    198|  bool empty() const {
  653|    198|    return size_ == 0;
  654|    198|  }
_ZN5Darts7Details8AutoPoolIjE6appendERKj:
  678|    402|  void append(const T &value) {
  679|    402|    if (size_ == capacity_)
  ------------------
  |  Branch (679:9): [True: 30, False: 372]
  ------------------
  680|     30|      resize_buf(size_ + 1);
  681|    402|    new(&(*this)[size_++]) T(value);
  682|    402|  }
_ZN5Darts7Details8AutoPoolIjE10resize_bufEm:
  726|     32|void AutoPool<T>::resize_buf(std::size_t size) {
  727|     32|  std::size_t capacity;
  728|     32|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (728:7): [True: 14, False: 18]
  ------------------
  729|     14|    capacity = size;
  730|     18|  } else {
  731|     18|    capacity = 1;
  732|     80|    while (capacity < size) {
  ------------------
  |  Branch (732:12): [True: 62, False: 18]
  ------------------
  733|     62|      capacity <<= 1;
  734|     62|    }
  735|     18|  }
  736|       |
  737|     32|  AutoArray<char> buf;
  738|     32|  try {
  739|     32|    buf.reset(new char[sizeof(T) * capacity]);
  740|     32|  } catch (const std::bad_alloc &) {
  741|      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)
  ------------------
  742|      0|  }
  743|       |
  744|     32|  if (size_ > 0) {
  ------------------
  |  Branch (744:7): [True: 24, False: 8]
  ------------------
  745|     24|    T *src = reinterpret_cast<T *>(&buf_[0]);
  746|     24|    T *dest = reinterpret_cast<T *>(&buf[0]);
  747|    186|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (747:29): [True: 162, False: 24]
  ------------------
  748|    162|      new(&dest[i]) T(src[i]);
  749|    162|      src[i].~T();
  750|    162|    }
  751|     24|  }
  752|       |
  753|     32|  buf_.swap(&buf);
  754|     32|  capacity_ = capacity;
  755|     32|}
_ZN5Darts7Details9AutoArrayIcE5resetEPc:
  623|     94|  void reset(T *array = NULL) {
  624|     94|    AutoArray(array).swap(this);
  625|     94|  }
_ZN5Darts7Details9AutoArrayIcE4swapEPS2_:
  618|    188|  void swap(AutoArray *array) {
  619|    188|    T *temp = array_;
  620|    188|    array_ = array->array_;
  621|    188|    array->array_ = temp;
  622|    188|  }
_ZN5Darts7Details8AutoPoolIjE5clearEv:
  659|     36|  void clear() {
  660|     36|    resize(0);
  661|     36|    buf_.clear();
  662|     36|    size_ = 0;
  663|     36|    capacity_ = 0;
  664|     36|  }
_ZN5Darts7Details8AutoPoolIjE6resizeEm:
  684|     36|  void resize(std::size_t size) {
  685|  2.16k|    while (size_ > size) {
  ------------------
  |  Branch (685:12): [True: 2.12k, False: 36]
  ------------------
  686|  2.12k|      (*this)[--size_].~T();
  687|  2.12k|    }
  688|     36|    if (size > capacity_) {
  ------------------
  |  Branch (688:9): [True: 0, False: 36]
  ------------------
  689|      0|      resize_buf(size);
  690|      0|    }
  691|     36|    while (size_ < size) {
  ------------------
  |  Branch (691:12): [True: 0, False: 36]
  ------------------
  692|      0|      new(&(*this)[size_++]) T;
  693|      0|    }
  694|     36|  }
_ZN5Darts7Details9AutoArrayIjE5clearEv:
  612|     18|  void clear() {
  613|     18|    if (array_ != NULL) {
  ------------------
  |  Branch (613:9): [True: 4, False: 14]
  ------------------
  614|      4|      delete[] array_;
  615|       |      array_ = NULL;
  616|      4|    }
  617|     18|  }
_ZN5Darts7Details9AutoArrayIjE5resetEPj:
  623|      4|  void reset(T *array = NULL) {
  624|      4|    AutoArray(array).swap(this);
  625|      4|  }
_ZN5Darts7Details9AutoArrayIjE4swapEPS2_:
  618|      4|  void swap(AutoArray *array) {
  619|      4|    T *temp = array_;
  620|      4|    array_ = array->array_;
  621|      4|    array->array_ = temp;
  622|      4|  }
_ZNK5Darts7Details8AutoPoolIjE4sizeEv:
  655|    940|  std::size_t size() const {
  656|    940|    return size_;
  657|    940|  }
_ZN5Darts7Details9AutoArrayIjEixEm:
  604|      8|  T &operator[](std::size_t id) {
  605|      8|    return array_[id];
  606|      8|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgUnitEEixEm:
  645|  1.03k|  const T &operator[](std::size_t id) const {
  646|  1.03k|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  647|  1.03k|  }
_ZNK5Darts7Details8AutoPoolIhEixEm:
  645|    946|  const T &operator[](std::size_t id) const {
  646|    946|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  647|    946|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgUnitEE4sizeEv:
  655|     16|  std::size_t size() const {
  656|     16|    return size_;
  657|     16|  }
_ZN5Darts7Details9AutoStackIjE4pushERKj:
  783|    394|  void push(const T &value) {
  784|    394|    pool_.push_back(value);
  785|    394|  }
_ZN5Darts7Details8AutoPoolIjE9push_backERKj:
  666|    394|  void push_back(const T &value) {
  667|    394|    append(value);
  668|    394|  }
_ZN5Darts7Details8AutoPoolIjE6resizeEmRKj:
  695|      2|  void resize(std::size_t size, const T &value) {
  696|      2|    while (size_ > size) {
  ------------------
  |  Branch (696:12): [True: 0, False: 2]
  ------------------
  697|      0|      (*this)[--size_].~T();
  698|      0|    }
  699|      2|    if (size > capacity_) {
  ------------------
  |  Branch (699:9): [True: 2, False: 0]
  ------------------
  700|      2|      resize_buf(size);
  701|      2|    }
  702|  2.05k|    while (size_ < size) {
  ------------------
  |  Branch (702:12): [True: 2.04k, False: 2]
  ------------------
  703|  2.04k|      new(&(*this)[size_++]) T(value);
  704|  2.04k|    }
  705|      2|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEEixEm:
  648|  2.92k|  T &operator[](std::size_t id) {
  649|  2.92k|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  650|  2.92k|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEEixEm:
  648|    594|  T &operator[](std::size_t id) {
  649|    594|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  650|    594|  }
_ZN5Darts7Details8AutoPoolIhEixEm:
  648|  1.30k|  T &operator[](std::size_t id) {
  649|  1.30k|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  650|  1.30k|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE5clearEv:
  659|      8|  void clear() {
  660|      8|    resize(0);
  661|      8|    buf_.clear();
  662|      8|    size_ = 0;
  663|      8|    capacity_ = 0;
  664|      8|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE6resizeEm:
  684|      8|  void resize(std::size_t size) {
  685|     80|    while (size_ > size) {
  ------------------
  |  Branch (685:12): [True: 72, False: 8]
  ------------------
  686|     72|      (*this)[--size_].~T();
  687|     72|    }
  688|      8|    if (size > capacity_) {
  ------------------
  |  Branch (688:9): [True: 0, False: 8]
  ------------------
  689|      0|      resize_buf(size);
  690|      0|    }
  691|      8|    while (size_ < size) {
  ------------------
  |  Branch (691:12): [True: 0, False: 8]
  ------------------
  692|      0|      new(&(*this)[size_++]) T;
  693|      0|    }
  694|      8|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE10resize_bufEm:
  726|     14|void AutoPool<T>::resize_buf(std::size_t size) {
  727|     14|  std::size_t capacity;
  728|     14|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (728:7): [True: 4, False: 10]
  ------------------
  729|      4|    capacity = size;
  730|     10|  } else {
  731|     10|    capacity = 1;
  732|     50|    while (capacity < size) {
  ------------------
  |  Branch (732:12): [True: 40, False: 10]
  ------------------
  733|     40|      capacity <<= 1;
  734|     40|    }
  735|     10|  }
  736|       |
  737|     14|  AutoArray<char> buf;
  738|     14|  try {
  739|     14|    buf.reset(new char[sizeof(T) * capacity]);
  740|     14|  } catch (const std::bad_alloc &) {
  741|      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)
  ------------------
  742|      0|  }
  743|       |
  744|     14|  if (size_ > 0) {
  ------------------
  |  Branch (744:7): [True: 12, False: 2]
  ------------------
  745|     12|    T *src = reinterpret_cast<T *>(&buf_[0]);
  746|     12|    T *dest = reinterpret_cast<T *>(&buf[0]);
  747|    138|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (747:29): [True: 126, False: 12]
  ------------------
  748|    126|      new(&dest[i]) T(src[i]);
  749|    126|      src[i].~T();
  750|    126|    }
  751|     12|  }
  752|       |
  753|     14|  buf_.swap(&buf);
  754|     14|  capacity_ = capacity;
  755|     14|}
_ZN5Darts7Details9AutoStackIjE5clearEv:
  790|     16|  void clear() {
  791|     16|    pool_.clear();
  792|     16|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE5clearEv:
  659|      6|  void clear() {
  660|      6|    resize(0);
  661|      6|    buf_.clear();
  662|      6|    size_ = 0;
  663|      6|    capacity_ = 0;
  664|      6|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE6resizeEm:
  684|      6|  void resize(std::size_t size) {
  685|    204|    while (size_ > size) {
  ------------------
  |  Branch (685:12): [True: 198, False: 6]
  ------------------
  686|    198|      (*this)[--size_].~T();
  687|    198|    }
  688|      6|    if (size > capacity_) {
  ------------------
  |  Branch (688:9): [True: 0, False: 6]
  ------------------
  689|      0|      resize_buf(size);
  690|      0|    }
  691|      6|    while (size_ < size) {
  ------------------
  |  Branch (691:12): [True: 0, False: 6]
  ------------------
  692|      0|      new(&(*this)[size_++]) T;
  693|      0|    }
  694|      6|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE10resize_bufEm:
  726|     16|void AutoPool<T>::resize_buf(std::size_t size) {
  727|     16|  std::size_t capacity;
  728|     16|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (728:7): [True: 4, False: 12]
  ------------------
  729|      4|    capacity = size;
  730|     12|  } else {
  731|     12|    capacity = 1;
  732|     66|    while (capacity < size) {
  ------------------
  |  Branch (732:12): [True: 54, False: 12]
  ------------------
  733|     54|      capacity <<= 1;
  734|     54|    }
  735|     12|  }
  736|       |
  737|     16|  AutoArray<char> buf;
  738|     16|  try {
  739|     16|    buf.reset(new char[sizeof(T) * capacity]);
  740|     16|  } catch (const std::bad_alloc &) {
  741|      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)
  ------------------
  742|      0|  }
  743|       |
  744|     16|  if (size_ > 0) {
  ------------------
  |  Branch (744:7): [True: 14, False: 2]
  ------------------
  745|     14|    T *src = reinterpret_cast<T *>(&buf_[0]);
  746|     14|    T *dest = reinterpret_cast<T *>(&buf[0]);
  747|    268|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (747:29): [True: 254, False: 14]
  ------------------
  748|    254|      new(&dest[i]) T(src[i]);
  749|    254|      src[i].~T();
  750|    254|    }
  751|     14|  }
  752|       |
  753|     16|  buf_.swap(&buf);
  754|     16|  capacity_ = capacity;
  755|     16|}
_ZN5Darts7Details8AutoPoolIhE5clearEv:
  659|     12|  void clear() {
  660|     12|    resize(0);
  661|     12|    buf_.clear();
  662|     12|    size_ = 0;
  663|     12|    capacity_ = 0;
  664|     12|  }
_ZN5Darts7Details9AutoStackIjE3topEv:
  772|    564|  T &top() {
  773|    564|    return pool_[size() - 1];
  774|    564|  }
_ZNK5Darts7Details9AutoStackIjE4sizeEv:
  779|    564|  std::size_t size() const {
  780|    564|    return pool_.size();
  781|    564|  }
_ZN5Darts7Details9AutoStackIjE3popEv:
  786|    324|  void pop() {
  787|    324|    pool_.pop_back();
  788|    324|  }
_ZN5Darts7Details8AutoPoolIjE8pop_backEv:
  669|    324|  void pop_back() {
  670|    324|    (*this)[--size_].~T();
  671|    324|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgNodeEEixEm:
  645|    596|  const T &operator[](std::size_t id) const {
  646|    596|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  647|    596|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEE6appendEv:
  673|    198|  void append() {
  674|    198|    if (size_ == capacity_)
  ------------------
  |  Branch (674:9): [True: 16, False: 182]
  ------------------
  675|     16|      resize_buf(size_ + 1);
  676|    198|    new(&(*this)[size_++]) T;
  677|    198|  }
_ZN5Darts7Details8AutoPoolIhE6appendEv:
  673|    198|  void append() {
  674|    198|    if (size_ == capacity_)
  ------------------
  |  Branch (674:9): [True: 16, False: 182]
  ------------------
  675|     16|      resize_buf(size_ + 1);
  676|    198|    new(&(*this)[size_++]) T;
  677|    198|  }
_ZN5Darts7Details8AutoPoolIhE10resize_bufEm:
  726|     28|void AutoPool<T>::resize_buf(std::size_t size) {
  727|     28|  std::size_t capacity;
  728|     28|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (728:7): [True: 8, False: 20]
  ------------------
  729|      8|    capacity = size;
  730|     20|  } else {
  731|     20|    capacity = 1;
  732|    102|    while (capacity < size) {
  ------------------
  |  Branch (732:12): [True: 82, False: 20]
  ------------------
  733|     82|      capacity <<= 1;
  734|     82|    }
  735|     20|  }
  736|       |
  737|     28|  AutoArray<char> buf;
  738|     28|  try {
  739|     28|    buf.reset(new char[sizeof(T) * capacity]);
  740|     28|  } catch (const std::bad_alloc &) {
  741|      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)
  ------------------
  742|      0|  }
  743|       |
  744|     28|  if (size_ > 0) {
  ------------------
  |  Branch (744:7): [True: 24, False: 4]
  ------------------
  745|     24|    T *src = reinterpret_cast<T *>(&buf_[0]);
  746|     24|    T *dest = reinterpret_cast<T *>(&buf[0]);
  747|    340|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (747:29): [True: 316, False: 24]
  ------------------
  748|    316|      new(&dest[i]) T(src[i]);
  749|    316|      src[i].~T();
  750|    316|    }
  751|     24|  }
  752|       |
  753|     28|  buf_.swap(&buf);
  754|     28|  capacity_ = capacity;
  755|     28|}
_ZNK5Darts7Details9AutoStackIjE5emptyEv:
  776|    198|  bool empty() const {
  777|    198|    return pool_.empty();
  778|    198|  }
_ZNK5Darts7Details8AutoPoolINS0_8DawgNodeEE4sizeEv:
  655|     72|  std::size_t size() const {
  656|     72|    return size_;
  657|     72|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEE6appendEv:
  673|     72|  void append() {
  674|     72|    if (size_ == capacity_)
  ------------------
  |  Branch (674:9): [True: 14, False: 58]
  ------------------
  675|     14|      resize_buf(size_ + 1);
  676|     72|    new(&(*this)[size_++]) T;
  677|     72|  }
_ZNK5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE4sizeEv:
  655|  1.16k|  std::size_t size() const {
  656|  1.16k|    return size_;
  657|  1.16k|  }
_ZNK5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEEixEm:
  601|    498|  const T &operator[](std::size_t id) const {
  602|    498|    return array_[id];
  603|    498|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEEixEm:
  604|  5.66k|  T &operator[](std::size_t id) {
  605|  5.66k|    return array_[id];
  606|  5.66k|  }
_ZNK5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEEixEm:
  645|    512|  const T &operator[](std::size_t id) const {
  646|    512|    return *(reinterpret_cast<const T *>(&buf_[0]) + id);
  647|    512|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE5clearEv:
  659|      4|  void clear() {
  660|      4|    resize(0);
  661|      4|    buf_.clear();
  662|      4|    size_ = 0;
  663|      4|    capacity_ = 0;
  664|      4|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEE5clearEv:
  612|      8|  void clear() {
  613|      8|    if (array_ != NULL) {
  ------------------
  |  Branch (613:9): [True: 2, False: 6]
  ------------------
  614|      2|      delete[] array_;
  615|       |      array_ = NULL;
  616|      2|    }
  617|      8|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE7reserveEm:
  707|      2|  void reserve(std::size_t size) {
  708|      2|    if (size > capacity_) {
  ------------------
  |  Branch (708:9): [True: 2, False: 0]
  ------------------
  709|      2|      resize_buf(size);
  710|      2|    }
  711|      2|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE10resize_bufEm:
  726|      4|void AutoPool<T>::resize_buf(std::size_t size) {
  727|      4|  std::size_t capacity;
  728|      4|  if (size >= capacity_ * 2) {
  ------------------
  |  Branch (728:7): [True: 4, False: 0]
  ------------------
  729|      4|    capacity = size;
  730|      4|  } else {
  731|      0|    capacity = 1;
  732|      0|    while (capacity < size) {
  ------------------
  |  Branch (732:12): [True: 0, False: 0]
  ------------------
  733|      0|      capacity <<= 1;
  734|      0|    }
  735|      0|  }
  736|       |
  737|      4|  AutoArray<char> buf;
  738|      4|  try {
  739|      4|    buf.reset(new char[sizeof(T) * capacity]);
  740|      4|  } catch (const std::bad_alloc &) {
  741|      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)
  ------------------
  742|      0|  }
  743|       |
  744|      4|  if (size_ > 0) {
  ------------------
  |  Branch (744:7): [True: 0, False: 4]
  ------------------
  745|      0|    T *src = reinterpret_cast<T *>(&buf_[0]);
  746|      0|    T *dest = reinterpret_cast<T *>(&buf[0]);
  747|      0|    for (std::size_t i = 0; i < size_; ++i) {
  ------------------
  |  Branch (747:29): [True: 0, False: 0]
  ------------------
  748|      0|      new(&dest[i]) T(src[i]);
  749|      0|      src[i].~T();
  750|      0|    }
  751|      0|  }
  752|       |
  753|      4|  buf_.swap(&buf);
  754|      4|  capacity_ = capacity;
  755|      4|}
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEE5resetEPS2_:
  623|      2|  void reset(T *array = NULL) {
  624|      2|    AutoArray(array).swap(this);
  625|      2|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEE4swapEPS3_:
  618|      2|  void swap(AutoArray *array) {
  619|      2|    T *temp = array_;
  620|      2|    array_ = array->array_;
  621|      2|    array->array_ = temp;
  622|      2|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEEixEm:
  648|  1.73k|  T &operator[](std::size_t id) {
  649|  1.73k|    return *(reinterpret_cast<T *>(&buf_[0]) + id);
  650|  1.73k|  }
_ZN5Darts7Details8AutoPoolIhE6resizeEm:
  684|    132|  void resize(std::size_t size) {
  685|    526|    while (size_ > size) {
  ------------------
  |  Branch (685:12): [True: 394, False: 132]
  ------------------
  686|    394|      (*this)[--size_].~T();
  687|    394|    }
  688|    132|    if (size > capacity_) {
  ------------------
  |  Branch (688:9): [True: 0, False: 132]
  ------------------
  689|      0|      resize_buf(size);
  690|      0|    }
  691|    132|    while (size_ < size) {
  ------------------
  |  Branch (691:12): [True: 0, False: 132]
  ------------------
  692|      0|      new(&(*this)[size_++]) T;
  693|      0|    }
  694|    132|  }
_ZN5Darts7Details8AutoPoolIhE6appendERKh:
  678|    196|  void append(const T &value) {
  679|    196|    if (size_ == capacity_)
  ------------------
  |  Branch (679:9): [True: 12, False: 184]
  ------------------
  680|     12|      resize_buf(size_ + 1);
  681|    196|    new(&(*this)[size_++]) T(value);
  682|    196|  }
_ZNK5Darts7Details8AutoPoolIhE4sizeEv:
  655|    534|  std::size_t size() const {
  656|    534|    return size_;
  657|    534|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEE6resizeEm:
  684|      6|  void resize(std::size_t size) {
  685|    518|    while (size_ > size) {
  ------------------
  |  Branch (685:12): [True: 512, False: 6]
  ------------------
  686|    512|      (*this)[--size_].~T();
  687|    512|    }
  688|      6|    if (size > capacity_) {
  ------------------
  |  Branch (688:9): [True: 2, False: 4]
  ------------------
  689|      2|      resize_buf(size);
  690|      2|    }
  691|    518|    while (size_ < size) {
  ------------------
  |  Branch (691:12): [True: 512, False: 6]
  ------------------
  692|    512|      new(&(*this)[size_++]) T;
  693|    512|    }
  694|      6|  }
_ZN5Darts15DoubleArrayImplIvvivE5clearEv:
  194|      2|  void clear() {
  195|      2|    size_ = 0;
  196|      2|    array_ = NULL;
  197|      2|    if (buf_ != NULL) {
  ------------------
  |  Branch (197:9): [True: 0, False: 2]
  ------------------
  198|      0|      delete[] buf_;
  199|       |      buf_ = NULL;
  200|      0|    }
  201|      2|  }
_ZN5Darts15DoubleArrayImplIvvivEC2Ev:
  139|      2|  DoubleArrayImpl() : size_(0), array_(NULL), buf_(NULL) {}
_ZNK5Darts15DoubleArrayImplIvvivE18commonPrefixSearchINS1_16result_pair_typeEEEmPKcPT_mmm:
  509|  80.7M|    std::size_t length, std::size_t node_pos) const {
  510|  80.7M|  std::size_t num_results = 0;
  511|       |
  512|  80.7M|  unit_type unit = array_[node_pos];
  513|  80.7M|  node_pos ^= unit.offset();
  514|  80.7M|  if (length != 0) {
  ------------------
  |  Branch (514:7): [True: 80.7M, False: 0]
  ------------------
  515|   110M|    for (std::size_t i = 0; i < length; ++i) {
  ------------------
  |  Branch (515:29): [True: 110M, False: 5.42k]
  ------------------
  516|   110M|      node_pos ^= static_cast<uchar_type>(key[i]);
  517|   110M|      unit = array_[node_pos];
  518|   110M|      if (unit.label() != static_cast<uchar_type>(key[i])) {
  ------------------
  |  Branch (518:11): [True: 80.7M, False: 30.1M]
  ------------------
  519|  80.7M|        return num_results;
  520|  80.7M|      }
  521|       |
  522|  30.1M|      node_pos ^= unit.offset();
  523|  30.1M|      if (unit.has_leaf()) {
  ------------------
  |  Branch (523:11): [True: 22.3M, False: 7.79M]
  ------------------
  524|  22.3M|        if (num_results < max_num_results) {
  ------------------
  |  Branch (524:13): [True: 22.3M, False: 0]
  ------------------
  525|  22.3M|          set_result(&results[num_results], static_cast<value_type>(
  526|  22.3M|              array_[node_pos].value()), i + 1);
  527|  22.3M|        }
  528|  22.3M|        ++num_results;
  529|  22.3M|      }
  530|  30.1M|    }
  531|  80.7M|  } else {
  532|      0|    for ( ; key[length] != '\0'; ++length) {
  ------------------
  |  Branch (532:13): [True: 0, False: 0]
  ------------------
  533|      0|      node_pos ^= static_cast<uchar_type>(key[length]);
  534|      0|      unit = array_[node_pos];
  535|      0|      if (unit.label() != static_cast<uchar_type>(key[length])) {
  ------------------
  |  Branch (535:11): [True: 0, False: 0]
  ------------------
  536|      0|        return num_results;
  537|      0|      }
  538|       |
  539|      0|      node_pos ^= unit.offset();
  540|      0|      if (unit.has_leaf()) {
  ------------------
  |  Branch (540:11): [True: 0, False: 0]
  ------------------
  541|      0|        if (num_results < max_num_results) {
  ------------------
  |  Branch (541:13): [True: 0, False: 0]
  ------------------
  542|      0|          set_result(&results[num_results], static_cast<value_type>(
  543|      0|              array_[node_pos].value()), length + 1);
  544|      0|        }
  545|      0|        ++num_results;
  546|      0|      }
  547|      0|    }
  548|      0|  }
  549|       |
  550|  5.42k|  return num_results;
  551|  80.7M|}
_ZNK5Darts15DoubleArrayImplIvvivE10set_resultEPNS1_16result_pair_typeEim:
  160|  22.3M|      value_type value, std::size_t length) const {
  161|  22.3M|    result->value = value;
  162|  22.3M|    result->length = length;
  163|  22.3M|  }
_ZN5Darts15DoubleArrayImplIvvivE5buildEmPKPKcPKmPKiPFimmE:
 1934|      2|    const value_type *values, Details::progress_func_type progress_func) {
 1935|      2|  Details::Keyset<value_type> keyset(num_keys, keys, lengths, values);
 1936|       |
 1937|      2|  Details::DoubleArrayBuilder builder(progress_func);
 1938|      2|  builder.build(keyset);
 1939|       |
 1940|      2|  std::size_t size = 0;
 1941|      2|  unit_type *buf = NULL;
 1942|      2|  builder.copy(&size, &buf);
 1943|       |
 1944|      2|  clear();
 1945|       |
 1946|      2|  size_ = size;
 1947|      2|  array_ = buf;
 1948|      2|  buf_ = buf;
 1949|       |
 1950|      2|  if (progress_func != NULL) {
  ------------------
  |  Branch (1950:7): [True: 0, False: 2]
  ------------------
 1951|      0|    progress_func(num_keys + 1, num_keys + 1);
 1952|      0|  }
 1953|       |
 1954|      2|  return 0;
 1955|      2|}
_ZN5Darts7Details6KeysetIiEC2EmPKPKcPKmPKi:
  899|      2|      num_keys_(num_keys), keys_(keys), lengths_(lengths), values_(values) {}
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEEC2Ev:
  642|      2|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details9AutoArrayIcEC2EPc:
  596|    206|  explicit AutoArray(T *array = NULL) : array_(array) {}
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEEC2EPS2_:
  596|      4|  explicit AutoArray(T *array = NULL) : array_(array) {}
_ZN5Darts7Details8AutoPoolIhEC2Ev:
  642|      4|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details9AutoArrayIjEC2EPj:
  596|      8|  explicit AutoArray(T *array = NULL) : array_(array) {}
_ZN5Darts7Details8AutoPoolIhED2Ev:
  643|      4|  ~AutoPool() { clear(); }
_ZN5Darts7Details9AutoArrayIcED2Ev:
  597|    206|  ~AutoArray() {
  598|    206|    clear();
  599|    206|  }
_ZN5Darts7Details9AutoArrayINS0_27DoubleArrayBuilderExtraUnitEED2Ev:
  597|      4|  ~AutoArray() {
  598|      4|    clear();
  599|      4|  }
_ZN5Darts7Details8AutoPoolINS0_22DoubleArrayBuilderUnitEED2Ev:
  643|      2|  ~AutoPool() { clear(); }
_ZN5Darts7Details18DoubleArrayBuilder5buildIiEEvRKNS0_6KeysetIT_EE:
 1558|      2|void DoubleArrayBuilder::build(const Keyset<T> &keyset) {
 1559|      2|  if (keyset.has_values()) {
  ------------------
  |  Branch (1559:7): [True: 2, False: 0]
  ------------------
 1560|      2|    Details::DawgBuilder dawg_builder;
 1561|      2|    build_dawg(keyset, &dawg_builder);
 1562|      2|    build_from_dawg(dawg_builder);
 1563|      2|    dawg_builder.clear();
 1564|      2|  } else {
 1565|      0|    build_from_keyset(keyset);
 1566|      0|  }
 1567|      2|}
_ZNK5Darts7Details6KeysetIiE10has_valuesEv:
  927|     80|  bool has_values() const {
  928|       |    return values_ != NULL;
  929|     80|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEEC2Ev:
  642|      2|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEEC2Ev:
  642|      2|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details8AutoPoolIjEC2Ev:
  642|      8|  AutoPool() : buf_(), size_(0), capacity_(0) {}
_ZN5Darts7Details9AutoStackIjEC2Ev:
  764|      4|  AutoStack() : pool_() {}
_ZN5Darts7Details9AutoStackIjED2Ev:
  765|      4|  ~AutoStack() {
  766|      4|    clear();
  767|      4|  }
_ZN5Darts7Details8AutoPoolIjED2Ev:
  643|      8|  ~AutoPool() { clear(); }
_ZN5Darts7Details9AutoArrayIjED2Ev:
  597|      8|  ~AutoArray() {
  598|      8|    clear();
  599|      8|  }
_ZN5Darts7Details8AutoPoolINS0_8DawgUnitEED2Ev:
  643|      2|  ~AutoPool() { clear(); }
_ZN5Darts7Details8AutoPoolINS0_8DawgNodeEED2Ev:
  643|      2|  ~AutoPool() { clear(); }
_ZN5Darts7Details18DoubleArrayBuilder10build_dawgIiEEvRKNS0_6KeysetIT_EEPNS0_11DawgBuilderE:
 1593|      2|    DawgBuilder *dawg_builder) {
 1594|      2|  dawg_builder->init();
 1595|     80|  for (std::size_t i = 0; i < keyset.num_keys(); ++i) {
  ------------------
  |  Branch (1595:27): [True: 78, False: 2]
  ------------------
 1596|     78|    dawg_builder->insert(keyset.keys(i), keyset.lengths(i), keyset.values(i));
 1597|     78|    if (progress_func_ != NULL) {
  ------------------
  |  Branch (1597:9): [True: 0, False: 78]
  ------------------
 1598|      0|      progress_func_(i + 1, keyset.num_keys() + 1);
 1599|      0|    }
 1600|     78|  }
 1601|      2|  dawg_builder->finish();
 1602|      2|}
_ZNK5Darts7Details6KeysetIiE8num_keysEv:
  901|     80|  std::size_t num_keys() const {
  902|     80|    return num_keys_;
  903|     80|  }
_ZNK5Darts7Details6KeysetIiE4keysEm:
  904|     78|  const char_type *keys(std::size_t id) const {
  905|     78|    return keys_[id];
  906|     78|  }
_ZNK5Darts7Details6KeysetIiE7lengthsEm:
  916|     78|  std::size_t lengths(std::size_t id) const {
  917|     78|    if (has_lengths()) {
  ------------------
  |  Branch (917:9): [True: 78, False: 0]
  ------------------
  918|     78|      return lengths_[id];
  919|     78|    }
  920|      0|    std::size_t length = 0;
  921|      0|    while (keys_[id][length] != '\0') {
  ------------------
  |  Branch (921:12): [True: 0, False: 0]
  ------------------
  922|      0|      ++length;
  923|      0|    }
  924|      0|    return length;
  925|     78|  }
_ZNK5Darts7Details6KeysetIiE11has_lengthsEv:
  913|     78|  bool has_lengths() const {
  914|       |    return lengths_ != NULL;
  915|     78|  }
_ZNK5Darts7Details6KeysetIiE6valuesEm:
  930|     78|  const value_type values(std::size_t id) const {
  931|     78|    if (has_values()) {
  ------------------
  |  Branch (931:9): [True: 78, False: 0]
  ------------------
  932|     78|      return static_cast<value_type>(values_[id]);
  933|     78|    }
  934|      0|    return static_cast<value_type>(id);
  935|     78|  }
_ZNK5Darts15DoubleArrayImplIvvivE16exactMatchSearchIiEEvPKcRT_mm:
  273|  12.3M|      std::size_t length = 0, std::size_t node_pos = 0) const {
  274|  12.3M|    result = exactMatchSearch<U>(key, length, node_pos);
  275|  12.3M|  }
_ZNK5Darts15DoubleArrayImplIvvivE16exactMatchSearchIiEET_PKcmm:
  474|  12.3M|    std::size_t length, std::size_t node_pos) const {
  475|  12.3M|  U result;
  476|  12.3M|  set_result(&result, static_cast<value_type>(-1), 0);
  477|       |
  478|  12.3M|  unit_type unit = array_[node_pos];
  479|  12.3M|  if (length != 0) {
  ------------------
  |  Branch (479:7): [True: 12.3M, False: 0]
  ------------------
  480|  27.1M|    for (std::size_t i = 0; i < length; ++i) {
  ------------------
  |  Branch (480:29): [True: 14.8M, False: 12.3M]
  ------------------
  481|  14.8M|      node_pos ^= unit.offset() ^ static_cast<uchar_type>(key[i]);
  482|  14.8M|      unit = array_[node_pos];
  483|  14.8M|      if (unit.label() != static_cast<uchar_type>(key[i])) {
  ------------------
  |  Branch (483:11): [True: 13.0k, False: 14.8M]
  ------------------
  484|  13.0k|        return result;
  485|  13.0k|      }
  486|  14.8M|    }
  487|  12.3M|  } else {
  488|      0|    for ( ; key[length] != '\0'; ++length) {
  ------------------
  |  Branch (488:13): [True: 0, False: 0]
  ------------------
  489|      0|      node_pos ^= unit.offset() ^ static_cast<uchar_type>(key[length]);
  490|      0|      unit = array_[node_pos];
  491|      0|      if (unit.label() != static_cast<uchar_type>(key[length])) {
  ------------------
  |  Branch (491:11): [True: 0, False: 0]
  ------------------
  492|      0|        return result;
  493|      0|      }
  494|      0|    }
  495|      0|  }
  496|       |
  497|  12.3M|  if (!unit.has_leaf()) {
  ------------------
  |  Branch (497:7): [True: 152, False: 12.3M]
  ------------------
  498|    152|    return result;
  499|    152|  }
  500|  12.3M|  unit = array_[node_pos ^ unit.offset()];
  501|  12.3M|  set_result(&result, static_cast<value_type>(unit.value()), length);
  502|  12.3M|  return result;
  503|  12.3M|}
_ZNK5Darts15DoubleArrayImplIvvivE10set_resultEPiim:
  155|  24.7M|  void set_result(value_type *result, value_type value, std::size_t) const {
  156|  24.7M|    *result = value;
  157|  24.7M|  }
_ZNK5Darts15DoubleArrayImplIvvivE8traverseEPKcRmS4_m:
  556|   123M|    std::size_t &node_pos, std::size_t &key_pos, std::size_t length) const {
  557|   123M|  id_type id = static_cast<id_type>(node_pos);
  558|   123M|  unit_type unit = array_[id];
  559|       |
  560|   123M|  if (length != 0) {
  ------------------
  |  Branch (560:7): [True: 123M, False: 0]
  ------------------
  561|   153M|    for ( ; key_pos < length; ++key_pos) {
  ------------------
  |  Branch (561:13): [True: 123M, False: 30.0M]
  ------------------
  562|   123M|      id ^= unit.offset() ^ static_cast<uchar_type>(key[key_pos]);
  563|   123M|      unit = array_[id];
  564|   123M|      if (unit.label() != static_cast<uchar_type>(key[key_pos])) {
  ------------------
  |  Branch (564:11): [True: 93.5M, False: 30.0M]
  ------------------
  565|  93.5M|        return static_cast<value_type>(-2);
  566|  93.5M|      }
  567|  30.0M|      node_pos = id;
  568|  30.0M|    }
  569|   123M|  } else {
  570|      0|    for ( ; key[key_pos] != '\0'; ++key_pos) {
  ------------------
  |  Branch (570:13): [True: 0, False: 0]
  ------------------
  571|      0|      id ^= unit.offset() ^ static_cast<uchar_type>(key[key_pos]);
  572|      0|      unit = array_[id];
  573|      0|      if (unit.label() != static_cast<uchar_type>(key[key_pos])) {
  ------------------
  |  Branch (573:11): [True: 0, False: 0]
  ------------------
  574|      0|        return static_cast<value_type>(-2);
  575|      0|      }
  576|      0|      node_pos = id;
  577|      0|    }
  578|      0|  }
  579|       |
  580|  30.0M|  if (!unit.has_leaf()) {
  ------------------
  |  Branch (580:7): [True: 4.68M, False: 25.3M]
  ------------------
  581|  4.68M|    return static_cast<value_type>(-1);
  582|  4.68M|  }
  583|  25.3M|  unit = array_[id ^ unit.offset()];
  584|  25.3M|  return static_cast<value_type>(unit.value());
  585|  30.0M|}